diff options
Diffstat (limited to 'src/js/out/modules_dev/node/crypto.js.map')
| -rw-r--r-- | src/js/out/modules_dev/node/crypto.js.map | 15 |
1 files changed, 0 insertions, 15 deletions
diff --git a/src/js/out/modules_dev/node/crypto.js.map b/src/js/out/modules_dev/node/crypto.js.map deleted file mode 100644 index 1f3854a72..000000000 --- a/src/js/out/modules_dev/node/crypto.js.map +++ /dev/null @@ -1,15 +0,0 @@ -{ - "version": 3, - "sources": ["src/js/node/crypto.js", "src/js/node/crypto.js", "src/js/node/crypto.js", "src/js/node/crypto.js", "src/js/node/crypto.js", "src/js/node/crypto.js"], - "sourcesContent": [ - "// Hardcoded module \"node:crypto\"\nvar __create = Object.create;\nvar __defProp = Object.defineProperty;\nvar __getOwnPropDesc = Object.getOwnPropertyDescriptor;\nvar __getOwnPropNames = Object.getOwnPropertyNames;\nvar __getProtoOf = Object.getPrototypeOf,\n __hasOwnProp = Object.prototype.hasOwnProperty;\n\nconst MAX_STRING_LENGTH = 536870888;\n\nvar __require = id => import.meta.require(id);\nconst crypto = globalThis.crypto;\nconst globalCrypto = crypto;\n\nvar __esm = (fn, res) =>\n function () {\n return fn && (res = (0, fn[__getOwnPropNames(fn)[0]])((fn = 0))), res;\n };\nvar __commonJS = (cb, mod) =>\n function () {\n return mod || (0, cb[__getOwnPropNames(cb)[0]])((mod = { exports: {} }).exports, mod), mod.exports;\n };\nvar __export = (target, all) => {\n for (var name in all) __defProp(target, name, { get: all[name], enumerable: !0 });\n },\n __copyProps = (to, from, except, desc) => {\n if ((from && typeof from == \"object\") || typeof from == \"function\")\n for (let key of __getOwnPropNames(from))\n !__hasOwnProp.call(to, key) &&\n key !== except &&\n __defProp(to, key, {\n get: () => from[key],\n enumerable: !(desc = __getOwnPropDesc(from, key)) || desc.enumerable,\n });\n return to;\n },\n __reExport = (target, mod, secondTarget) => (\n __copyProps(target, mod, \"default\"), secondTarget && __copyProps(secondTarget, mod, \"default\")\n ),\n __toESM = (mod, isNodeMode, target) => (\n (target = mod != null ? __create(__getProtoOf(mod)) : {}),\n __copyProps(\n isNodeMode || !mod || !mod.__esModule ? __defProp(target, \"default\", { value: mod, enumerable: !0 }) : target,\n mod,\n )\n );\n\n// node_modules/safe-buffer/index.js\nvar require_safe_buffer = __commonJS({\n \"node_modules/safe-buffer/index.js\"(exports, module) {\n var buffer = __require(\"buffer\"),\n Buffer2 = buffer.Buffer;\n function copyProps(src, dst) {\n for (var key in src) dst[key] = src[key];\n }\n Buffer2.from && Buffer2.alloc && Buffer2.allocUnsafe && Buffer2.allocUnsafeSlow\n ? (module.exports = buffer)\n : (copyProps(buffer, exports), (exports.Buffer = SafeBuffer));\n function SafeBuffer(arg, encodingOrOffset, length) {\n return Buffer2(arg, encodingOrOffset, length);\n }\n SafeBuffer.prototype = Object.create(Buffer2.prototype);\n copyProps(Buffer2, SafeBuffer);\n SafeBuffer.from = function (arg, encodingOrOffset, length) {\n if (typeof arg == \"number\") throw new TypeError(\"Argument must not be a number\");\n return Buffer2(arg, encodingOrOffset, length);\n };\n SafeBuffer.alloc = function (size, fill, encoding) {\n if (typeof size != \"number\") throw new TypeError(\"Argument must be a number\");\n var buf = Buffer2(size);\n return (\n fill !== void 0 ? (typeof encoding == \"string\" ? buf.fill(fill, encoding) : buf.fill(fill)) : buf.fill(0), buf\n );\n };\n SafeBuffer.allocUnsafe = function (size) {\n if (typeof size != \"number\") throw new TypeError(\"Argument must be a number\");\n return Buffer2(size);\n };\n SafeBuffer.allocUnsafeSlow = function (size) {\n if (typeof size != \"number\") throw new TypeError(\"Argument must be a number\");\n return buffer.SlowBuffer(size);\n };\n },\n});\n\n// node_modules/randombytes/browser.js\nvar require_browser = __commonJS({\n \"node_modules/randombytes/browser.js\"(exports, module) {\n \"use strict\";\n var MAX_BYTES = 65536,\n MAX_UINT32 = 4294967295;\n function oldBrowser() {\n throw new Error(`Secure random number generation is not supported by this browser.\nUse Chrome, Firefox or Internet Explorer 11`);\n }\n var Buffer2 = require_safe_buffer().Buffer,\n crypto2 = globalCrypto;\n crypto2 && crypto2.getRandomValues ? (module.exports = randomBytes) : (module.exports = oldBrowser);\n function randomBytes(size, cb) {\n if (size > MAX_UINT32) throw new RangeError(\"requested too many random bytes\");\n var bytes = Buffer2.allocUnsafe(size);\n if (size > 0)\n if (size > MAX_BYTES)\n for (var generated = 0; generated < size; generated += MAX_BYTES)\n crypto2.getRandomValues(bytes.slice(generated, generated + MAX_BYTES));\n else crypto2.getRandomValues(bytes);\n return typeof cb == \"function\"\n ? process.nextTick(function () {\n cb(null, bytes);\n })\n : bytes;\n }\n },\n});\n\n// node_modules/inherits/inherits_browser.js\nvar require_inherits_browser = __commonJS({\n \"node_modules/inherits/inherits_browser.js\"(exports, module) {\n typeof Object.create == \"function\"\n ? (module.exports = function (ctor, superCtor) {\n superCtor &&\n ((ctor.super_ = superCtor),\n (ctor.prototype = Object.create(superCtor.prototype, {\n constructor: {\n value: ctor,\n enumerable: !1,\n writable: !0,\n configurable: !0,\n },\n })));\n })\n : (module.exports = function (ctor, superCtor) {\n if (superCtor) {\n ctor.super_ = superCtor;\n var TempCtor = function () {};\n (TempCtor.prototype = superCtor.prototype),\n (ctor.prototype = new TempCtor()),\n (ctor.prototype.constructor = ctor);\n }\n });\n },\n});\n\n// node_modules/hash-base/index.js\nvar require_hash_base = __commonJS({\n \"node_modules/hash-base/index.js\"(exports, module) {\n \"use strict\";\n var Buffer2 = require_safe_buffer().Buffer,\n Transform = __require(\"readable-stream\").Transform,\n inherits = require_inherits_browser();\n function throwIfNotStringOrBuffer(val, prefix) {\n if (!Buffer2.isBuffer(val) && typeof val != \"string\")\n throw new TypeError(prefix + \" must be a string or a buffer\");\n }\n function HashBase(blockSize) {\n Transform.call(this),\n (this._block = Buffer2.allocUnsafe(blockSize)),\n (this._blockSize = blockSize),\n (this._blockOffset = 0),\n (this._length = [0, 0, 0, 0]),\n (this._finalized = !1);\n }\n inherits(HashBase, Transform);\n HashBase.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 callback(error);\n };\n HashBase.prototype._flush = function (callback) {\n var error = null;\n try {\n this.push(this.digest());\n } catch (err) {\n error = err;\n }\n callback(error);\n };\n HashBase.prototype.update = function (data, encoding) {\n if ((throwIfNotStringOrBuffer(data, \"Data\"), this._finalized)) throw new Error(\"Digest already called\");\n Buffer2.isBuffer(data) || (data = Buffer2.from(data, encoding));\n for (var block = this._block, offset = 0; this._blockOffset + data.length - offset >= this._blockSize; ) {\n for (var i = this._blockOffset; i < this._blockSize; ) block[i++] = data[offset++];\n this._update(), (this._blockOffset = 0);\n }\n for (; offset < data.length; ) block[this._blockOffset++] = data[offset++];\n for (var j = 0, carry = data.length * 8; carry > 0; ++j)\n (this._length[j] += carry),\n (carry = (this._length[j] / 4294967296) | 0),\n carry > 0 && (this._length[j] -= 4294967296 * carry);\n return this;\n };\n HashBase.prototype._update = function () {\n throw new Error(\"_update is not implemented\");\n };\n HashBase.prototype.digest = function (encoding) {\n if (this._finalized) throw new Error(\"Digest already called\");\n this._finalized = !0;\n var digest = this._digest();\n encoding !== void 0 && (digest = digest.toString(encoding)), this._block.fill(0), (this._blockOffset = 0);\n for (var i = 0; i < 4; ++i) this._length[i] = 0;\n return digest;\n };\n HashBase.prototype._digest = function () {\n throw new Error(\"_digest is not implemented\");\n };\n module.exports = HashBase;\n },\n});\n\n// node_modules/md5.js/index.js\nvar require_md5 = __commonJS({\n \"node_modules/md5.js/index.js\"(exports, module) {\n \"use strict\";\n var inherits = require_inherits_browser(),\n HashBase = require_hash_base(),\n Buffer2 = require_safe_buffer().Buffer,\n ARRAY16 = new Array(16);\n function MD5() {\n HashBase.call(this, 64),\n (this._a = 1732584193),\n (this._b = 4023233417),\n (this._c = 2562383102),\n (this._d = 271733878);\n }\n inherits(MD5, HashBase);\n MD5.prototype._update = function () {\n for (var M = ARRAY16, i = 0; i < 16; ++i) M[i] = this._block.readInt32LE(i * 4);\n var a = this._a,\n b = this._b,\n c = this._c,\n d = this._d;\n (a = fnF(a, b, c, d, M[0], 3614090360, 7)),\n (d = fnF(d, a, b, c, M[1], 3905402710, 12)),\n (c = fnF(c, d, a, b, M[2], 606105819, 17)),\n (b = fnF(b, c, d, a, M[3], 3250441966, 22)),\n (a = fnF(a, b, c, d, M[4], 4118548399, 7)),\n (d = fnF(d, a, b, c, M[5], 1200080426, 12)),\n (c = fnF(c, d, a, b, M[6], 2821735955, 17)),\n (b = fnF(b, c, d, a, M[7], 4249261313, 22)),\n (a = fnF(a, b, c, d, M[8], 1770035416, 7)),\n (d = fnF(d, a, b, c, M[9], 2336552879, 12)),\n (c = fnF(c, d, a, b, M[10], 4294925233, 17)),\n (b = fnF(b, c, d, a, M[11], 2304563134, 22)),\n (a = fnF(a, b, c, d, M[12], 1804603682, 7)),\n (d = fnF(d, a, b, c, M[13], 4254626195, 12)),\n (c = fnF(c, d, a, b, M[14], 2792965006, 17)),\n (b = fnF(b, c, d, a, M[15], 1236535329, 22)),\n (a = fnG(a, b, c, d, M[1], 4129170786, 5)),\n (d = fnG(d, a, b, c, M[6], 3225465664, 9)),\n (c = fnG(c, d, a, b, M[11], 643717713, 14)),\n (b = fnG(b, c, d, a, M[0], 3921069994, 20)),\n (a = fnG(a, b, c, d, M[5], 3593408605, 5)),\n (d = fnG(d, a, b, c, M[10], 38016083, 9)),\n (c = fnG(c, d, a, b, M[15], 3634488961, 14)),\n (b = fnG(b, c, d, a, M[4], 3889429448, 20)),\n (a = fnG(a, b, c, d, M[9], 568446438, 5)),\n (d = fnG(d, a, b, c, M[14], 3275163606, 9)),\n (c = fnG(c, d, a, b, M[3], 4107603335, 14)),\n (b = fnG(b, c, d, a, M[8], 1163531501, 20)),\n (a = fnG(a, b, c, d, M[13], 2850285829, 5)),\n (d = fnG(d, a, b, c, M[2], 4243563512, 9)),\n (c = fnG(c, d, a, b, M[7], 1735328473, 14)),\n (b = fnG(b, c, d, a, M[12], 2368359562, 20)),\n (a = fnH(a, b, c, d, M[5], 4294588738, 4)),\n (d = fnH(d, a, b, c, M[8], 2272392833, 11)),\n (c = fnH(c, d, a, b, M[11], 1839030562, 16)),\n (b = fnH(b, c, d, a, M[14], 4259657740, 23)),\n (a = fnH(a, b, c, d, M[1], 2763975236, 4)),\n (d = fnH(d, a, b, c, M[4], 1272893353, 11)),\n (c = fnH(c, d, a, b, M[7], 4139469664, 16)),\n (b = fnH(b, c, d, a, M[10], 3200236656, 23)),\n (a = fnH(a, b, c, d, M[13], 681279174, 4)),\n (d = fnH(d, a, b, c, M[0], 3936430074, 11)),\n (c = fnH(c, d, a, b, M[3], 3572445317, 16)),\n (b = fnH(b, c, d, a, M[6], 76029189, 23)),\n (a = fnH(a, b, c, d, M[9], 3654602809, 4)),\n (d = fnH(d, a, b, c, M[12], 3873151461, 11)),\n (c = fnH(c, d, a, b, M[15], 530742520, 16)),\n (b = fnH(b, c, d, a, M[2], 3299628645, 23)),\n (a = fnI(a, b, c, d, M[0], 4096336452, 6)),\n (d = fnI(d, a, b, c, M[7], 1126891415, 10)),\n (c = fnI(c, d, a, b, M[14], 2878612391, 15)),\n (b = fnI(b, c, d, a, M[5], 4237533241, 21)),\n (a = fnI(a, b, c, d, M[12], 1700485571, 6)),\n (d = fnI(d, a, b, c, M[3], 2399980690, 10)),\n (c = fnI(c, d, a, b, M[10], 4293915773, 15)),\n (b = fnI(b, c, d, a, M[1], 2240044497, 21)),\n (a = fnI(a, b, c, d, M[8], 1873313359, 6)),\n (d = fnI(d, a, b, c, M[15], 4264355552, 10)),\n (c = fnI(c, d, a, b, M[6], 2734768916, 15)),\n (b = fnI(b, c, d, a, M[13], 1309151649, 21)),\n (a = fnI(a, b, c, d, M[4], 4149444226, 6)),\n (d = fnI(d, a, b, c, M[11], 3174756917, 10)),\n (c = fnI(c, d, a, b, M[2], 718787259, 15)),\n (b = fnI(b, c, d, a, M[9], 3951481745, 21)),\n (this._a = (this._a + a) | 0),\n (this._b = (this._b + b) | 0),\n (this._c = (this._c + c) | 0),\n (this._d = (this._d + d) | 0);\n };\n MD5.prototype._digest = function () {\n (this._block[this._blockOffset++] = 128),\n this._blockOffset > 56 && (this._block.fill(0, this._blockOffset, 64), this._update(), (this._blockOffset = 0)),\n this._block.fill(0, this._blockOffset, 56),\n this._block.writeUInt32LE(this._length[0], 56),\n this._block.writeUInt32LE(this._length[1], 60),\n this._update();\n var buffer = Buffer2.allocUnsafe(16);\n return (\n buffer.writeInt32LE(this._a, 0),\n buffer.writeInt32LE(this._b, 4),\n buffer.writeInt32LE(this._c, 8),\n buffer.writeInt32LE(this._d, 12),\n buffer\n );\n };\n function rotl(x, n) {\n return (x << n) | (x >>> (32 - n));\n }\n function fnF(a, b, c, d, m, k, s) {\n return (rotl((a + ((b & c) | (~b & d)) + m + k) | 0, s) + b) | 0;\n }\n function fnG(a, b, c, d, m, k, s) {\n return (rotl((a + ((b & d) | (c & ~d)) + m + k) | 0, s) + b) | 0;\n }\n function fnH(a, b, c, d, m, k, s) {\n return (rotl((a + (b ^ c ^ d) + m + k) | 0, s) + b) | 0;\n }\n function fnI(a, b, c, d, m, k, s) {\n return (rotl((a + (c ^ (b | ~d)) + m + k) | 0, s) + b) | 0;\n }\n module.exports = MD5;\n },\n});\n\n// node_modules/ripemd160/index.js\nvar require_ripemd160 = __commonJS({\n \"node_modules/ripemd160/index.js\"(exports, module) {\n \"use strict\";\n var Buffer2 = __require(\"buffer\").Buffer,\n inherits = require_inherits_browser(),\n HashBase = require_hash_base(),\n ARRAY16 = new Array(16),\n zl = [\n 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 7, 4, 13, 1, 10, 6, 15, 3, 12, 0, 9, 5, 2, 14, 11, 8, 3,\n 10, 14, 4, 9, 15, 8, 1, 2, 7, 0, 6, 13, 11, 5, 12, 1, 9, 11, 10, 0, 8, 12, 4, 13, 3, 7, 15, 14, 5, 6, 2, 4, 0,\n 5, 9, 7, 12, 2, 10, 14, 1, 3, 8, 11, 6, 15, 13,\n ],\n zr = [\n 5, 14, 7, 0, 9, 2, 11, 4, 13, 6, 15, 8, 1, 10, 3, 12, 6, 11, 3, 7, 0, 13, 5, 10, 14, 15, 8, 12, 4, 9, 1, 2, 15,\n 5, 1, 3, 7, 14, 6, 9, 11, 8, 12, 2, 10, 0, 4, 13, 8, 6, 4, 1, 3, 11, 15, 0, 5, 12, 2, 13, 9, 7, 10, 14, 12, 15,\n 10, 4, 1, 5, 8, 7, 6, 2, 13, 14, 0, 3, 9, 11,\n ],\n sl = [\n 11, 14, 15, 12, 5, 8, 7, 9, 11, 13, 14, 15, 6, 7, 9, 8, 7, 6, 8, 13, 11, 9, 7, 15, 7, 12, 15, 9, 11, 7, 13, 12,\n 11, 13, 6, 7, 14, 9, 13, 15, 14, 8, 13, 6, 5, 12, 7, 5, 11, 12, 14, 15, 14, 15, 9, 8, 9, 14, 5, 6, 8, 6, 5, 12,\n 9, 15, 5, 11, 6, 8, 13, 12, 5, 12, 13, 14, 11, 8, 5, 6,\n ],\n sr = [\n 8, 9, 9, 11, 13, 15, 15, 5, 7, 7, 8, 11, 14, 14, 12, 6, 9, 13, 15, 7, 12, 8, 9, 11, 7, 7, 12, 7, 6, 15, 13, 11,\n 9, 7, 15, 11, 8, 6, 6, 14, 12, 13, 5, 14, 13, 13, 7, 5, 15, 5, 8, 11, 14, 14, 6, 14, 6, 9, 12, 9, 12, 5, 15, 8,\n 8, 5, 12, 9, 12, 5, 14, 6, 8, 13, 6, 5, 15, 13, 11, 11,\n ],\n hl = [0, 1518500249, 1859775393, 2400959708, 2840853838],\n hr = [1352829926, 1548603684, 1836072691, 2053994217, 0];\n function RIPEMD160() {\n HashBase.call(this, 64),\n (this._a = 1732584193),\n (this._b = 4023233417),\n (this._c = 2562383102),\n (this._d = 271733878),\n (this._e = 3285377520);\n }\n inherits(RIPEMD160, HashBase);\n RIPEMD160.prototype._update = function () {\n for (var words = ARRAY16, j = 0; j < 16; ++j) words[j] = this._block.readInt32LE(j * 4);\n for (\n var al = this._a | 0,\n bl = this._b | 0,\n cl = this._c | 0,\n dl = this._d | 0,\n el = this._e | 0,\n ar = this._a | 0,\n br = this._b | 0,\n cr = this._c | 0,\n dr = this._d | 0,\n er = this._e | 0,\n i = 0;\n i < 80;\n i += 1\n ) {\n var tl, tr;\n i < 16\n ? ((tl = fn1(al, bl, cl, dl, el, words[zl[i]], hl[0], sl[i])),\n (tr = fn5(ar, br, cr, dr, er, words[zr[i]], hr[0], sr[i])))\n : i < 32\n ? ((tl = fn2(al, bl, cl, dl, el, words[zl[i]], hl[1], sl[i])),\n (tr = fn4(ar, br, cr, dr, er, words[zr[i]], hr[1], sr[i])))\n : i < 48\n ? ((tl = fn3(al, bl, cl, dl, el, words[zl[i]], hl[2], sl[i])),\n (tr = fn3(ar, br, cr, dr, er, words[zr[i]], hr[2], sr[i])))\n : i < 64\n ? ((tl = fn4(al, bl, cl, dl, el, words[zl[i]], hl[3], sl[i])),\n (tr = fn2(ar, br, cr, dr, er, words[zr[i]], hr[3], sr[i])))\n : ((tl = fn5(al, bl, cl, dl, el, words[zl[i]], hl[4], sl[i])),\n (tr = fn1(ar, br, cr, dr, er, words[zr[i]], hr[4], sr[i]))),\n (al = el),\n (el = dl),\n (dl = rotl(cl, 10)),\n (cl = bl),\n (bl = tl),\n (ar = er),\n (er = dr),\n (dr = rotl(cr, 10)),\n (cr = br),\n (br = tr);\n }\n var t = (this._b + cl + dr) | 0;\n (this._b = (this._c + dl + er) | 0),\n (this._c = (this._d + el + ar) | 0),\n (this._d = (this._e + al + br) | 0),\n (this._e = (this._a + bl + cr) | 0),\n (this._a = t);\n };\n RIPEMD160.prototype._digest = function () {\n (this._block[this._blockOffset++] = 128),\n this._blockOffset > 56 && (this._block.fill(0, this._blockOffset, 64), this._update(), (this._blockOffset = 0)),\n this._block.fill(0, this._blockOffset, 56),\n this._block.writeUInt32LE(this._length[0], 56),\n this._block.writeUInt32LE(this._length[1], 60),\n this._update();\n var buffer = Buffer2.alloc ? Buffer2.alloc(20) : new Buffer2(20);\n return (\n buffer.writeInt32LE(this._a, 0),\n buffer.writeInt32LE(this._b, 4),\n buffer.writeInt32LE(this._c, 8),\n buffer.writeInt32LE(this._d, 12),\n buffer.writeInt32LE(this._e, 16),\n buffer\n );\n };\n function rotl(x, n) {\n return (x << n) | (x >>> (32 - n));\n }\n function fn1(a, b, c, d, e, m, k, s) {\n return (rotl((a + (b ^ c ^ d) + m + k) | 0, s) + e) | 0;\n }\n function fn2(a, b, c, d, e, m, k, s) {\n return (rotl((a + ((b & c) | (~b & d)) + m + k) | 0, s) + e) | 0;\n }\n function fn3(a, b, c, d, e, m, k, s) {\n return (rotl((a + ((b | ~c) ^ d) + m + k) | 0, s) + e) | 0;\n }\n function fn4(a, b, c, d, e, m, k, s) {\n return (rotl((a + ((b & d) | (c & ~d)) + m + k) | 0, s) + e) | 0;\n }\n function fn5(a, b, c, d, e, m, k, s) {\n return (rotl((a + (b ^ (c | ~d)) + m + k) | 0, s) + e) | 0;\n }\n module.exports = RIPEMD160;\n },\n});\n\n// node_modules/sha.js/hash.js\nvar require_hash = __commonJS({\n \"node_modules/sha.js/hash.js\"(exports, module) {\n var Buffer2 = require_safe_buffer().Buffer;\n function Hash(blockSize, finalSize) {\n (this._block = Buffer2.alloc(blockSize)),\n (this._finalSize = finalSize),\n (this._blockSize = blockSize),\n (this._len = 0);\n }\n Hash.prototype.update = function (data, enc) {\n typeof data == \"string\" && ((enc = enc || \"utf8\"), (data = Buffer2.from(data, enc)));\n for (\n var block = this._block, blockSize = this._blockSize, length = data.length, accum = this._len, offset = 0;\n offset < length;\n\n ) {\n for (\n var assigned = accum % blockSize, remainder = Math.min(length - offset, blockSize - assigned), i = 0;\n i < remainder;\n i++\n )\n block[assigned + i] = data[offset + i];\n (accum += remainder), (offset += remainder), accum % blockSize === 0 && this._update(block);\n }\n return (this._len += length), this;\n };\n Hash.prototype.digest = function (enc) {\n var rem = this._len % this._blockSize;\n (this._block[rem] = 128),\n this._block.fill(0, rem + 1),\n rem >= this._finalSize && (this._update(this._block), this._block.fill(0));\n var bits = this._len * 8;\n if (bits <= 4294967295) this._block.writeUInt32BE(bits, this._blockSize - 4);\n else {\n var lowBits = (bits & 4294967295) >>> 0,\n highBits = (bits - lowBits) / 4294967296;\n this._block.writeUInt32BE(highBits, this._blockSize - 8),\n this._block.writeUInt32BE(lowBits, this._blockSize - 4);\n }\n this._update(this._block);\n var hash = this._hash();\n return enc ? hash.toString(enc) : hash;\n };\n Hash.prototype._update = function () {\n throw new Error(\"_update must be implemented by subclass\");\n };\n module.exports = Hash;\n },\n});\n\n// node_modules/sha.js/sha.js\nvar require_sha = __commonJS({\n \"node_modules/sha.js/sha.js\"(exports, module) {\n var inherits = require_inherits_browser(),\n Hash = require_hash(),\n Buffer2 = require_safe_buffer().Buffer,\n K = [1518500249, 1859775393, -1894007588, -899497514],\n W = new Array(80);\n function Sha() {\n this.init(), (this._w = W), Hash.call(this, 64, 56);\n }\n inherits(Sha, Hash);\n Sha.prototype.init = function () {\n return (\n (this._a = 1732584193),\n (this._b = 4023233417),\n (this._c = 2562383102),\n (this._d = 271733878),\n (this._e = 3285377520),\n this\n );\n };\n function rotl5(num) {\n return (num << 5) | (num >>> 27);\n }\n function rotl30(num) {\n return (num << 30) | (num >>> 2);\n }\n function ft(s, b, c, d) {\n return s === 0 ? (b & c) | (~b & d) : s === 2 ? (b & c) | (b & d) | (c & d) : b ^ c ^ d;\n }\n Sha.prototype._update = function (M) {\n for (\n var W2 = this._w, a = this._a | 0, b = this._b | 0, c = this._c | 0, d = this._d | 0, e = this._e | 0, i = 0;\n i < 16;\n ++i\n )\n W2[i] = M.readInt32BE(i * 4);\n for (; i < 80; ++i) W2[i] = W2[i - 3] ^ W2[i - 8] ^ W2[i - 14] ^ W2[i - 16];\n for (var j = 0; j < 80; ++j) {\n var s = ~~(j / 20),\n t = (rotl5(a) + ft(s, b, c, d) + e + W2[j] + K[s]) | 0;\n (e = d), (d = c), (c = rotl30(b)), (b = a), (a = t);\n }\n (this._a = (a + this._a) | 0),\n (this._b = (b + this._b) | 0),\n (this._c = (c + this._c) | 0),\n (this._d = (d + this._d) | 0),\n (this._e = (e + this._e) | 0);\n };\n Sha.prototype._hash = function () {\n var H = Buffer2.allocUnsafe(20);\n return (\n H.writeInt32BE(this._a | 0, 0),\n H.writeInt32BE(this._b | 0, 4),\n H.writeInt32BE(this._c | 0, 8),\n H.writeInt32BE(this._d | 0, 12),\n H.writeInt32BE(this._e | 0, 16),\n H\n );\n };\n module.exports = Sha;\n },\n});\n\n// node_modules/sha.js/sha1.js\nvar require_sha1 = __commonJS({\n \"node_modules/sha.js/sha1.js\"(exports, module) {\n var inherits = require_inherits_browser(),\n Hash = require_hash(),\n Buffer2 = require_safe_buffer().Buffer,\n K = [1518500249, 1859775393, -1894007588, -899497514],\n W = new Array(80);\n function Sha1() {\n this.init(), (this._w = W), Hash.call(this, 64, 56);\n }\n inherits(Sha1, Hash);\n Sha1.prototype.init = function () {\n return (\n (this._a = 1732584193),\n (this._b = 4023233417),\n (this._c = 2562383102),\n (this._d = 271733878),\n (this._e = 3285377520),\n this\n );\n };\n function rotl1(num) {\n return (num << 1) | (num >>> 31);\n }\n function rotl5(num) {\n return (num << 5) | (num >>> 27);\n }\n function rotl30(num) {\n return (num << 30) | (num >>> 2);\n }\n function ft(s, b, c, d) {\n return s === 0 ? (b & c) | (~b & d) : s === 2 ? (b & c) | (b & d) | (c & d) : b ^ c ^ d;\n }\n Sha1.prototype._update = function (M) {\n for (\n var W2 = this._w, a = this._a | 0, b = this._b | 0, c = this._c | 0, d = this._d | 0, e = this._e | 0, i = 0;\n i < 16;\n ++i\n )\n W2[i] = M.readInt32BE(i * 4);\n for (; i < 80; ++i) W2[i] = rotl1(W2[i - 3] ^ W2[i - 8] ^ W2[i - 14] ^ W2[i - 16]);\n for (var j = 0; j < 80; ++j) {\n var s = ~~(j / 20),\n t = (rotl5(a) + ft(s, b, c, d) + e + W2[j] + K[s]) | 0;\n (e = d), (d = c), (c = rotl30(b)), (b = a), (a = t);\n }\n (this._a = (a + this._a) | 0),\n (this._b = (b + this._b) | 0),\n (this._c = (c + this._c) | 0),\n (this._d = (d + this._d) | 0),\n (this._e = (e + this._e) | 0);\n };\n Sha1.prototype._hash = function () {\n var H = Buffer2.allocUnsafe(20);\n return (\n H.writeInt32BE(this._a | 0, 0),\n H.writeInt32BE(this._b | 0, 4),\n H.writeInt32BE(this._c | 0, 8),\n H.writeInt32BE(this._d | 0, 12),\n H.writeInt32BE(this._e | 0, 16),\n H\n );\n };\n module.exports = Sha1;\n },\n});\n\n// node_modules/sha.js/sha256.js\nvar require_sha256 = __commonJS({\n \"node_modules/sha.js/sha256.js\"(exports, module) {\n var inherits = require_inherits_browser(),\n Hash = require_hash(),\n Buffer2 = require_safe_buffer().Buffer,\n K = [\n 1116352408, 1899447441, 3049323471, 3921009573, 961987163, 1508970993, 2453635748, 2870763221, 3624381080,\n 310598401, 607225278, 1426881987, 1925078388, 2162078206, 2614888103, 3248222580, 3835390401, 4022224774,\n 264347078, 604807628, 770255983, 1249150122, 1555081692, 1996064986, 2554220882, 2821834349, 2952996808,\n 3210313671, 3336571891, 3584528711, 113926993, 338241895, 666307205, 773529912, 1294757372, 1396182291,\n 1695183700, 1986661051, 2177026350, 2456956037, 2730485921, 2820302411, 3259730800, 3345764771, 3516065817,\n 3600352804, 4094571909, 275423344, 430227734, 506948616, 659060556, 883997877, 958139571, 1322822218,\n 1537002063, 1747873779, 1955562222, 2024104815, 2227730452, 2361852424, 2428436474, 2756734187, 3204031479,\n 3329325298,\n ],\n W = new Array(64);\n function Sha256() {\n this.init(), (this._w = W), Hash.call(this, 64, 56);\n }\n inherits(Sha256, Hash);\n Sha256.prototype.init = function () {\n return (\n (this._a = 1779033703),\n (this._b = 3144134277),\n (this._c = 1013904242),\n (this._d = 2773480762),\n (this._e = 1359893119),\n (this._f = 2600822924),\n (this._g = 528734635),\n (this._h = 1541459225),\n this\n );\n };\n function ch(x, y, z) {\n return z ^ (x & (y ^ z));\n }\n function maj(x, y, z) {\n return (x & y) | (z & (x | y));\n }\n function sigma0(x) {\n return ((x >>> 2) | (x << 30)) ^ ((x >>> 13) | (x << 19)) ^ ((x >>> 22) | (x << 10));\n }\n function sigma1(x) {\n return ((x >>> 6) | (x << 26)) ^ ((x >>> 11) | (x << 21)) ^ ((x >>> 25) | (x << 7));\n }\n function gamma0(x) {\n return ((x >>> 7) | (x << 25)) ^ ((x >>> 18) | (x << 14)) ^ (x >>> 3);\n }\n function gamma1(x) {\n return ((x >>> 17) | (x << 15)) ^ ((x >>> 19) | (x << 13)) ^ (x >>> 10);\n }\n Sha256.prototype._update = function (M) {\n for (\n var W2 = this._w,\n a = this._a | 0,\n b = this._b | 0,\n c = this._c | 0,\n d = this._d | 0,\n e = this._e | 0,\n f = this._f | 0,\n g = this._g | 0,\n h = this._h | 0,\n i = 0;\n i < 16;\n ++i\n )\n W2[i] = M.readInt32BE(i * 4);\n for (; i < 64; ++i) W2[i] = (gamma1(W2[i - 2]) + W2[i - 7] + gamma0(W2[i - 15]) + W2[i - 16]) | 0;\n for (var j = 0; j < 64; ++j) {\n var T1 = (h + sigma1(e) + ch(e, f, g) + K[j] + W2[j]) | 0,\n T2 = (sigma0(a) + maj(a, b, c)) | 0;\n (h = g), (g = f), (f = e), (e = (d + T1) | 0), (d = c), (c = b), (b = a), (a = (T1 + T2) | 0);\n }\n (this._a = (a + this._a) | 0),\n (this._b = (b + this._b) | 0),\n (this._c = (c + this._c) | 0),\n (this._d = (d + this._d) | 0),\n (this._e = (e + this._e) | 0),\n (this._f = (f + this._f) | 0),\n (this._g = (g + this._g) | 0),\n (this._h = (h + this._h) | 0);\n };\n Sha256.prototype._hash = function () {\n var H = Buffer2.allocUnsafe(32);\n return (\n H.writeInt32BE(this._a, 0),\n H.writeInt32BE(this._b, 4),\n H.writeInt32BE(this._c, 8),\n H.writeInt32BE(this._d, 12),\n H.writeInt32BE(this._e, 16),\n H.writeInt32BE(this._f, 20),\n H.writeInt32BE(this._g, 24),\n H.writeInt32BE(this._h, 28),\n H\n );\n };\n module.exports = Sha256;\n },\n});\n\n// node_modules/sha.js/sha224.js\nvar require_sha224 = __commonJS({\n \"node_modules/sha.js/sha224.js\"(exports, module) {\n var inherits = require_inherits_browser(),\n Sha256 = require_sha256(),\n Hash = require_hash(),\n Buffer2 = require_safe_buffer().Buffer,\n W = new Array(64);\n function Sha224() {\n this.init(), (this._w = W), Hash.call(this, 64, 56);\n }\n inherits(Sha224, Sha256);\n Sha224.prototype.init = function () {\n return (\n (this._a = 3238371032),\n (this._b = 914150663),\n (this._c = 812702999),\n (this._d = 4144912697),\n (this._e = 4290775857),\n (this._f = 1750603025),\n (this._g = 1694076839),\n (this._h = 3204075428),\n this\n );\n };\n Sha224.prototype._hash = function () {\n var H = Buffer2.allocUnsafe(28);\n return (\n H.writeInt32BE(this._a, 0),\n H.writeInt32BE(this._b, 4),\n H.writeInt32BE(this._c, 8),\n H.writeInt32BE(this._d, 12),\n H.writeInt32BE(this._e, 16),\n H.writeInt32BE(this._f, 20),\n H.writeInt32BE(this._g, 24),\n H\n );\n };\n module.exports = Sha224;\n },\n});\n\n// node_modules/sha.js/sha512.js\nvar require_sha512 = __commonJS({\n \"node_modules/sha.js/sha512.js\"(exports, module) {\n var inherits = require_inherits_browser(),\n Hash = require_hash(),\n Buffer2 = require_safe_buffer().Buffer,\n K = [\n 1116352408, 3609767458, 1899447441, 602891725, 3049323471, 3964484399, 3921009573, 2173295548, 961987163,\n 4081628472, 1508970993, 3053834265, 2453635748, 2937671579, 2870763221, 3664609560, 3624381080, 2734883394,\n 310598401, 1164996542, 607225278, 1323610764, 1426881987, 3590304994, 1925078388, 4068182383, 2162078206,\n 991336113, 2614888103, 633803317, 3248222580, 3479774868, 3835390401, 2666613458, 4022224774, 944711139,\n 264347078, 2341262773, 604807628, 2007800933, 770255983, 1495990901, 1249150122, 1856431235, 1555081692,\n 3175218132, 1996064986, 2198950837, 2554220882, 3999719339, 2821834349, 766784016, 2952996808, 2566594879,\n 3210313671, 3203337956, 3336571891, 1034457026, 3584528711, 2466948901, 113926993, 3758326383, 338241895,\n 168717936, 666307205, 1188179964, 773529912, 1546045734, 1294757372, 1522805485, 1396182291, 2643833823,\n 1695183700, 2343527390, 1986661051, 1014477480, 2177026350, 1206759142, 2456956037, 344077627, 2730485921,\n 1290863460, 2820302411, 3158454273, 3259730800, 3505952657, 3345764771, 106217008, 3516065817, 3606008344,\n 3600352804, 1432725776, 4094571909, 1467031594, 275423344, 851169720, 430227734, 3100823752, 506948616,\n 1363258195, 659060556, 3750685593, 883997877, 3785050280, 958139571, 3318307427, 1322822218, 3812723403,\n 1537002063, 2003034995, 1747873779, 3602036899, 1955562222, 1575990012, 2024104815, 1125592928, 2227730452,\n 2716904306, 2361852424, 442776044, 2428436474, 593698344, 2756734187, 3733110249, 3204031479, 2999351573,\n 3329325298, 3815920427, 3391569614, 3928383900, 3515267271, 566280711, 3940187606, 3454069534, 4118630271,\n 4000239992, 116418474, 1914138554, 174292421, 2731055270, 289380356, 3203993006, 460393269, 320620315,\n 685471733, 587496836, 852142971, 1086792851, 1017036298, 365543100, 1126000580, 2618297676, 1288033470,\n 3409855158, 1501505948, 4234509866, 1607167915, 987167468, 1816402316, 1246189591,\n ],\n W = new Array(160);\n function Sha512() {\n this.init(), (this._w = W), Hash.call(this, 128, 112);\n }\n inherits(Sha512, Hash);\n Sha512.prototype.init = function () {\n return (\n (this._ah = 1779033703),\n (this._bh = 3144134277),\n (this._ch = 1013904242),\n (this._dh = 2773480762),\n (this._eh = 1359893119),\n (this._fh = 2600822924),\n (this._gh = 528734635),\n (this._hh = 1541459225),\n (this._al = 4089235720),\n (this._bl = 2227873595),\n (this._cl = 4271175723),\n (this._dl = 1595750129),\n (this._el = 2917565137),\n (this._fl = 725511199),\n (this._gl = 4215389547),\n (this._hl = 327033209),\n this\n );\n };\n function Ch(x, y, z) {\n return z ^ (x & (y ^ z));\n }\n function maj(x, y, z) {\n return (x & y) | (z & (x | y));\n }\n function sigma0(x, xl) {\n return ((x >>> 28) | (xl << 4)) ^ ((xl >>> 2) | (x << 30)) ^ ((xl >>> 7) | (x << 25));\n }\n function sigma1(x, xl) {\n return ((x >>> 14) | (xl << 18)) ^ ((x >>> 18) | (xl << 14)) ^ ((xl >>> 9) | (x << 23));\n }\n function Gamma0(x, xl) {\n return ((x >>> 1) | (xl << 31)) ^ ((x >>> 8) | (xl << 24)) ^ (x >>> 7);\n }\n function Gamma0l(x, xl) {\n return ((x >>> 1) | (xl << 31)) ^ ((x >>> 8) | (xl << 24)) ^ ((x >>> 7) | (xl << 25));\n }\n function Gamma1(x, xl) {\n return ((x >>> 19) | (xl << 13)) ^ ((xl >>> 29) | (x << 3)) ^ (x >>> 6);\n }\n function Gamma1l(x, xl) {\n return ((x >>> 19) | (xl << 13)) ^ ((xl >>> 29) | (x << 3)) ^ ((x >>> 6) | (xl << 26));\n }\n function getCarry(a, b) {\n return a >>> 0 < b >>> 0 ? 1 : 0;\n }\n Sha512.prototype._update = function (M) {\n for (\n var W2 = this._w,\n ah = this._ah | 0,\n bh = this._bh | 0,\n ch = this._ch | 0,\n dh = this._dh | 0,\n eh = this._eh | 0,\n fh = this._fh | 0,\n gh = this._gh | 0,\n hh = this._hh | 0,\n al = this._al | 0,\n bl = this._bl | 0,\n cl = this._cl | 0,\n dl = this._dl | 0,\n el = this._el | 0,\n fl = this._fl | 0,\n gl = this._gl | 0,\n hl = this._hl | 0,\n i = 0;\n i < 32;\n i += 2\n )\n (W2[i] = M.readInt32BE(i * 4)), (W2[i + 1] = M.readInt32BE(i * 4 + 4));\n for (; i < 160; i += 2) {\n var xh = W2[i - 30],\n xl = W2[i - 15 * 2 + 1],\n gamma0 = Gamma0(xh, xl),\n gamma0l = Gamma0l(xl, xh);\n (xh = W2[i - 2 * 2]), (xl = W2[i - 2 * 2 + 1]);\n var gamma1 = Gamma1(xh, xl),\n gamma1l = Gamma1l(xl, xh),\n Wi7h = W2[i - 7 * 2],\n Wi7l = W2[i - 7 * 2 + 1],\n Wi16h = W2[i - 16 * 2],\n Wi16l = W2[i - 16 * 2 + 1],\n Wil = (gamma0l + Wi7l) | 0,\n 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 (W2[i] = Wih),\n (W2[i + 1] = Wil);\n }\n for (var j = 0; j < 160; j += 2) {\n (Wih = W2[j]), (Wil = W2[j + 1]);\n var majh = maj(ah, bh, ch),\n majl = maj(al, bl, cl),\n sigma0h = sigma0(ah, al),\n sigma0l = sigma0(al, ah),\n sigma1h = sigma1(eh, el),\n sigma1l = sigma1(el, eh),\n Kih = K[j],\n Kil = K[j + 1],\n chh = Ch(eh, fh, gh),\n chl = Ch(el, fl, gl),\n t1l = (hl + sigma1l) | 0,\n 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 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 (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 Sha512.prototype._hash = function () {\n var H = Buffer2.allocUnsafe(64);\n function writeInt64BE(h, l, offset) {\n H.writeInt32BE(h, offset), H.writeInt32BE(l, offset + 4);\n }\n return (\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 H\n );\n };\n module.exports = Sha512;\n },\n});\n\n// node_modules/sha.js/sha384.js\nvar require_sha384 = __commonJS({\n \"node_modules/sha.js/sha384.js\"(exports, module) {\n var inherits = require_inherits_browser(),\n SHA512 = require_sha512(),\n Hash = require_hash(),\n Buffer2 = require_safe_buffer().Buffer,\n W = new Array(160);\n function Sha384() {\n this.init(), (this._w = W), Hash.call(this, 128, 112);\n }\n inherits(Sha384, SHA512);\n Sha384.prototype.init = function () {\n return (\n (this._ah = 3418070365),\n (this._bh = 1654270250),\n (this._ch = 2438529370),\n (this._dh = 355462360),\n (this._eh = 1731405415),\n (this._fh = 2394180231),\n (this._gh = 3675008525),\n (this._hh = 1203062813),\n (this._al = 3238371032),\n (this._bl = 914150663),\n (this._cl = 812702999),\n (this._dl = 4144912697),\n (this._el = 4290775857),\n (this._fl = 1750603025),\n (this._gl = 1694076839),\n (this._hl = 3204075428),\n this\n );\n };\n Sha384.prototype._hash = function () {\n var H = Buffer2.allocUnsafe(48);\n function writeInt64BE(h, l, offset) {\n H.writeInt32BE(h, offset), H.writeInt32BE(l, offset + 4);\n }\n return (\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 H\n );\n };\n module.exports = Sha384;\n },\n});\n\n// node_modules/sha.js/index.js\nvar require_sha2 = __commonJS({\n \"node_modules/sha.js/index.js\"(exports, module) {\n var exports = (module.exports = function (algorithm) {\n algorithm = algorithm.toLowerCase();\n var Algorithm = exports[algorithm];\n if (!Algorithm) throw new Error(algorithm + \" is not supported (we accept pull requests)\");\n return new Algorithm();\n });\n exports.sha = require_sha();\n exports.sha1 = require_sha1();\n exports.sha224 = require_sha224();\n exports.sha256 = require_sha256();\n exports.sha384 = require_sha384();\n exports.sha512 = require_sha512();\n },\n});\n\n// stream.js\nvar stream_exports = import.meta.require(\"node:stream\");\n\n// node_modules/cipher-base/index.js\nvar require_cipher_base = __commonJS({\n \"node_modules/cipher-base/index.js\"(exports, module) {\n var Buffer2 = require_safe_buffer().Buffer,\n Transform = stream_exports.Transform,\n StringDecoder = __require(\"string_decoder\").StringDecoder,\n inherits = require_inherits_browser();\n function CipherBase(hashMode) {\n Transform.call(this),\n (this.hashMode = typeof hashMode == \"string\"),\n this.hashMode ? (this[hashMode] = this._finalOrDigest) : (this.final = this._finalOrDigest),\n this._final && ((this.__final = this._final), (this._final = null)),\n (this._decoder = null),\n (this._encoding = null);\n }\n inherits(CipherBase, Transform);\n CipherBase.prototype.update = function (data, inputEnc, outputEnc) {\n typeof data == \"string\" && (data = Buffer2.from(data, inputEnc));\n var outData = this._update(data);\n return this.hashMode ? this : (outputEnc && (outData = this._toString(outData, outputEnc)), outData);\n };\n CipherBase.prototype.setAutoPadding = function () {};\n CipherBase.prototype.getAuthTag = function () {\n throw new Error(\"trying to get auth tag in unsupported state\");\n };\n CipherBase.prototype.setAuthTag = function () {\n throw new Error(\"trying to set auth tag in unsupported state\");\n };\n CipherBase.prototype.setAAD = function () {\n throw new Error(\"trying to set aad in unsupported state\");\n };\n CipherBase.prototype._transform = function (data, _, next) {\n var err;\n try {\n this.hashMode ? this._update(data) : this.push(this._update(data));\n } catch (e) {\n err = e;\n } finally {\n next(err);\n }\n };\n CipherBase.prototype._flush = function (done) {\n var err;\n try {\n this.push(this.__final());\n } catch (e) {\n err = e;\n }\n done(err);\n };\n CipherBase.prototype._finalOrDigest = function (outputEnc) {\n var outData = this.__final() || Buffer2.alloc(0);\n return outputEnc && (outData = this._toString(outData, outputEnc, !0)), outData;\n };\n CipherBase.prototype._toString = function (value, enc, fin) {\n if ((this._decoder || ((this._decoder = new StringDecoder(enc)), (this._encoding = enc)), this._encoding !== enc))\n throw new Error(\"can't switch encodings\");\n var out = this._decoder.write(value);\n return fin && (out += this._decoder.end()), out;\n };\n module.exports = CipherBase;\n },\n});\n\n// node_modules/create-hash/browser.js\nvar require_browser2 = __commonJS({\n \"node_modules/create-hash/browser.js\"(exports, module) {\n (\"use strict\");\n const { Transform } = stream_exports;\n\n // does not become a node stream unless you create it into one\n const LazyHash = function Hash(algorithm, options) {\n this._options = options;\n this._hasher = new CryptoHasher(algorithm, options);\n this._finalized = false;\n };\n LazyHash.prototype = Object.create(Transform.prototype);\n LazyHash.prototype.update = function update(data, encoding) {\n this._checkFinalized();\n this._hasher.update(data, encoding);\n return this;\n };\n LazyHash.prototype.digest = function update(data, encoding) {\n this._checkFinalized();\n this._finalized = true;\n return this._hasher.digest(data, encoding);\n };\n LazyHash.prototype._checkFinalized = function _checkFinalized() {\n if (this._finalized) {\n var err = new Error(\"Digest already called\");\n err.code = \"ERR_CRYPTO_HASH_FINALIZED\";\n throw err;\n }\n };\n LazyHash.prototype.copy = function copy() {\n const copy = Object.create(LazyHash.prototype);\n copy._options = this._options;\n copy._hasher = this._hasher.copy();\n copy._finalized = this._finalized;\n return copy;\n };\n\n const lazyHashFullInitProto = {\n __proto__: Transform.prototype,\n ...LazyHash.prototype,\n _transform(data, encoding, callback) {\n this.update(data, encoding);\n callback && callback();\n },\n _flush(callback) {\n this.push(this.digest());\n callback();\n },\n };\n\n const triggerMethods = [\n \"_events\",\n \"_eventsCount\",\n \"_final\",\n \"_maxListeners\",\n \"_maxListeners\",\n \"_read\",\n \"_undestroy\",\n \"_writableState\",\n \"_write\",\n \"_writev\",\n \"addListener\",\n \"asIndexedPairs\",\n \"closed\",\n \"compose\",\n \"constructor\",\n \"cork\",\n \"destroy\",\n \"destroyed\",\n \"drop\",\n \"emit\",\n \"end\",\n \"errored\",\n \"eventNames\",\n \"every\",\n \"filter\",\n \"find\",\n \"flatMap\",\n \"forEach\",\n \"getMaxListeners\",\n \"hasOwnProperty\",\n \"isPaused\",\n \"isPrototypeOf\",\n \"iterator\",\n \"listenerCount\",\n \"listeners\",\n \"map\",\n \"off\",\n \"on\",\n \"once\",\n \"pause\",\n \"pipe\",\n \"prependListener\",\n \"prependOnceListener\",\n \"propertyIsEnumerable\",\n \"push\",\n \"rawListeners\",\n \"read\",\n \"readable\",\n \"readableAborted\",\n \"readableBuffer\",\n \"readableDidRead\",\n \"readableEncoding\",\n \"readableEnded\",\n \"readableFlowing\",\n \"readableHighWaterMark\",\n \"readableLength\",\n \"readableObjectMode\",\n \"reduce\",\n \"removeAllListeners\",\n \"removeListener\",\n \"resume\",\n \"setDefaultEncoding\",\n \"setEncoding\",\n \"setMaxListeners\",\n \"some\",\n \"take\",\n \"toArray\",\n \"toLocaleString\",\n \"toString\",\n \"uncork\",\n \"unpipe\",\n \"unshift\",\n \"valueOf\",\n \"wrap\",\n \"writable\",\n \"writableBuffer\",\n \"writableCorked\",\n \"writableEnded\",\n \"writableFinished\",\n \"writableHighWaterMark\",\n \"writableLength\",\n \"writableNeedDrain\",\n \"writableObjectMode\",\n \"write\",\n ];\n for (const method of triggerMethods) {\n Object.defineProperty(LazyHash.prototype, method, {\n get() {\n Object.setPrototypeOf(this, lazyHashFullInitProto);\n Transform.call(this, this._options);\n return this[method];\n },\n enumerable: false,\n configurable: true,\n });\n }\n\n module.exports = function createHash(algorithm) {\n return new LazyHash(algorithm);\n };\n\n module.exports.createHash = module.exports;\n module.exports.Hash = LazyHash;\n },\n});\n\n// node_modules/create-hmac/legacy.js\nvar require_legacy = __commonJS({\n \"node_modules/create-hmac/legacy.js\"(exports, module) {\n \"use strict\";\n var inherits = require_inherits_browser(),\n Buffer2 = require_safe_buffer().Buffer,\n Base = require_cipher_base(),\n ZEROS = Buffer2.alloc(128),\n blocksize = 64;\n function Hmac(alg, key) {\n Base.call(this, \"digest\"),\n typeof key == \"string\" && (key = Buffer2.from(key)),\n (this._alg = alg),\n (this._key = key),\n key.length > blocksize\n ? (key = alg(key))\n : key.length < blocksize && (key = Buffer2.concat([key, ZEROS], blocksize));\n for (\n var ipad = (this._ipad = Buffer2.allocUnsafe(blocksize)),\n opad = (this._opad = Buffer2.allocUnsafe(blocksize)),\n i = 0;\n i < blocksize;\n i++\n )\n (ipad[i] = key[i] ^ 54), (opad[i] = key[i] ^ 92);\n this._hash = [ipad];\n }\n inherits(Hmac, Base);\n Hmac.prototype._update = function (data) {\n this._hash.push(data);\n };\n Hmac.prototype._final = function () {\n var h = this._alg(Buffer2.concat(this._hash));\n return this._alg(Buffer2.concat([this._opad, h]));\n };\n module.exports = Hmac;\n },\n});\n\n// node_modules/create-hash/md5.js\nvar require_md52 = __commonJS({\n \"node_modules/create-hash/md5.js\"(exports, module) {\n var MD5 = require_md5();\n module.exports = function (buffer) {\n return new MD5().update(buffer).digest();\n };\n },\n});\n\n// node_modules/create-hmac/browser.js\nvar require_browser3 = __commonJS({\n \"node_modules/create-hmac/browser.js\"(exports, module) {\n \"use strict\";\n var inherits = require_inherits_browser(),\n Legacy = require_legacy(),\n Base = require_cipher_base(),\n Buffer2 = require_safe_buffer().Buffer,\n md5 = require_md52(),\n RIPEMD160 = require_ripemd160(),\n sha = require_sha2(),\n ZEROS = Buffer2.alloc(128);\n function Hmac(alg, key) {\n Base.call(this, \"digest\"), typeof key == \"string\" && (key = Buffer2.from(key));\n var blocksize = alg === \"sha512\" || alg === \"sha384\" ? 128 : 64;\n if (((this._alg = alg), (this._key = key), key.length > blocksize)) {\n var hash = alg === \"rmd160\" ? new RIPEMD160() : sha(alg);\n key = hash.update(key).digest();\n } else key.length < blocksize && (key = Buffer2.concat([key, ZEROS], blocksize));\n for (\n var ipad = (this._ipad = Buffer2.allocUnsafe(blocksize)),\n opad = (this._opad = Buffer2.allocUnsafe(blocksize)),\n i = 0;\n i < blocksize;\n i++\n )\n (ipad[i] = key[i] ^ 54), (opad[i] = key[i] ^ 92);\n (this._hash = alg === \"rmd160\" ? new RIPEMD160() : sha(alg)), this._hash.update(ipad);\n }\n inherits(Hmac, Base);\n Hmac.prototype._update = function (data) {\n this._hash.update(data);\n };\n Hmac.prototype._final = function () {\n var h = this._hash.digest(),\n hash = this._alg === \"rmd160\" ? new RIPEMD160() : sha(this._alg);\n return hash.update(this._opad).update(h).digest();\n };\n module.exports = function (alg, key) {\n return (\n (alg = alg.toLowerCase()),\n alg === \"rmd160\" || alg === \"ripemd160\"\n ? new Hmac(\"rmd160\", key)\n : alg === \"md5\"\n ? new Legacy(md5, key)\n : new Hmac(alg, key)\n );\n };\n },\n});\n\n// node_modules/browserify-sign/browser/algorithms.json\nvar require_algorithms = __commonJS({\n \"node_modules/browserify-sign/browser/algorithms.json\"(exports, module) {\n module.exports = {\n sha224WithRSAEncryption: {\n sign: \"rsa\",\n hash: \"sha224\",\n id: \"302d300d06096086480165030402040500041c\",\n },\n \"RSA-SHA224\": {\n sign: \"ecdsa/rsa\",\n hash: \"sha224\",\n id: \"302d300d06096086480165030402040500041c\",\n },\n sha256WithRSAEncryption: {\n sign: \"rsa\",\n hash: \"sha256\",\n id: \"3031300d060960864801650304020105000420\",\n },\n \"RSA-SHA256\": {\n sign: \"ecdsa/rsa\",\n hash: \"sha256\",\n id: \"3031300d060960864801650304020105000420\",\n },\n sha384WithRSAEncryption: {\n sign: \"rsa\",\n hash: \"sha384\",\n id: \"3041300d060960864801650304020205000430\",\n },\n \"RSA-SHA384\": {\n sign: \"ecdsa/rsa\",\n hash: \"sha384\",\n id: \"3041300d060960864801650304020205000430\",\n },\n sha512WithRSAEncryption: {\n sign: \"rsa\",\n hash: \"sha512\",\n id: \"3051300d060960864801650304020305000440\",\n },\n \"RSA-SHA512\": {\n sign: \"ecdsa/rsa\",\n hash: \"sha512\",\n id: \"3051300d060960864801650304020305000440\",\n },\n \"RSA-SHA1\": {\n sign: \"rsa\",\n hash: \"sha1\",\n id: \"3021300906052b0e03021a05000414\",\n },\n \"ecdsa-with-SHA1\": {\n sign: \"ecdsa\",\n hash: \"sha1\",\n id: \"\",\n },\n sha256: {\n sign: \"ecdsa\",\n hash: \"sha256\",\n id: \"\",\n },\n sha224: {\n sign: \"ecdsa\",\n hash: \"sha224\",\n id: \"\",\n },\n sha384: {\n sign: \"ecdsa\",\n hash: \"sha384\",\n id: \"\",\n },\n sha512: {\n sign: \"ecdsa\",\n hash: \"sha512\",\n id: \"\",\n },\n \"DSA-SHA\": {\n sign: \"dsa\",\n hash: \"sha1\",\n id: \"\",\n },\n \"DSA-SHA1\": {\n sign: \"dsa\",\n hash: \"sha1\",\n id: \"\",\n },\n DSA: {\n sign: \"dsa\",\n hash: \"sha1\",\n id: \"\",\n },\n \"DSA-WITH-SHA224\": {\n sign: \"dsa\",\n hash: \"sha224\",\n id: \"\",\n },\n \"DSA-SHA224\": {\n sign: \"dsa\",\n hash: \"sha224\",\n id: \"\",\n },\n \"DSA-WITH-SHA256\": {\n sign: \"dsa\",\n hash: \"sha256\",\n id: \"\",\n },\n \"DSA-SHA256\": {\n sign: \"dsa\",\n hash: \"sha256\",\n id: \"\",\n },\n \"DSA-WITH-SHA384\": {\n sign: \"dsa\",\n hash: \"sha384\",\n id: \"\",\n },\n \"DSA-SHA384\": {\n sign: \"dsa\",\n hash: \"sha384\",\n id: \"\",\n },\n \"DSA-WITH-SHA512\": {\n sign: \"dsa\",\n hash: \"sha512\",\n id: \"\",\n },\n \"DSA-SHA512\": {\n sign: \"dsa\",\n hash: \"sha512\",\n id: \"\",\n },\n \"DSA-RIPEMD160\": {\n sign: \"dsa\",\n hash: \"rmd160\",\n id: \"\",\n },\n ripemd160WithRSA: {\n sign: \"rsa\",\n hash: \"rmd160\",\n id: \"3021300906052b2403020105000414\",\n },\n \"RSA-RIPEMD160\": {\n sign: \"rsa\",\n hash: \"rmd160\",\n id: \"3021300906052b2403020105000414\",\n },\n md5WithRSAEncryption: {\n sign: \"rsa\",\n hash: \"md5\",\n id: \"3020300c06082a864886f70d020505000410\",\n },\n \"RSA-MD5\": {\n sign: \"rsa\",\n hash: \"md5\",\n id: \"3020300c06082a864886f70d020505000410\",\n },\n };\n },\n});\n\n// node_modules/browserify-sign/algos.js\nvar require_algos = __commonJS({\n \"node_modules/browserify-sign/algos.js\"(exports, module) {\n module.exports = require_algorithms();\n },\n});\n\n// node_modules/pbkdf2/lib/precondition.js\nvar require_precondition = __commonJS({\n \"node_modules/pbkdf2/lib/precondition.js\"(exports, module) {\n var MAX_ALLOC = Math.pow(2, 30) - 1;\n module.exports = function (iterations, keylen) {\n if (typeof iterations != \"number\") throw new TypeError(\"Iterations not a number\");\n if (iterations < 0) throw new TypeError(\"Bad iterations\");\n if (typeof keylen != \"number\") throw new TypeError(\"Key length not a number\");\n if (keylen < 0 || keylen > MAX_ALLOC || keylen !== keylen) throw new TypeError(\"Bad key length\");\n };\n },\n});\n\n// node_modules/pbkdf2/lib/default-encoding.js\nvar require_default_encoding = __commonJS({\n \"node_modules/pbkdf2/lib/default-encoding.js\"(exports, module) {\n var defaultEncoding;\n global.process && global.process.browser\n ? (defaultEncoding = \"utf-8\")\n : global.process && global.process.version\n ? ((pVersionMajor = parseInt(process.version.split(\".\")[0].slice(1), 10)),\n (defaultEncoding = pVersionMajor >= 6 ? \"utf-8\" : \"binary\"))\n : (defaultEncoding = \"utf-8\");\n var pVersionMajor;\n module.exports = defaultEncoding;\n },\n});\n\n// node_modules/pbkdf2/lib/to-buffer.js\nvar require_to_buffer = __commonJS({\n \"node_modules/pbkdf2/lib/to-buffer.js\"(exports, module) {\n var Buffer2 = require_safe_buffer().Buffer;\n module.exports = function (thing, encoding, name) {\n if (Buffer2.isBuffer(thing)) return thing;\n if (typeof thing == \"string\") return Buffer2.from(thing, encoding);\n if (ArrayBuffer.isView(thing)) return Buffer2.from(thing.buffer);\n throw new TypeError(name + \" must be a string, a Buffer, a typed array or a DataView\");\n };\n },\n});\n\n// node_modules/pbkdf2/lib/sync-browser.js\nvar require_sync_browser = __commonJS({\n \"node_modules/pbkdf2/lib/sync-browser.js\"(exports, module) {\n var md5 = require_md52(),\n RIPEMD160 = require_ripemd160(),\n sha = require_sha2(),\n Buffer2 = require_safe_buffer().Buffer,\n checkParameters = require_precondition(),\n defaultEncoding = require_default_encoding(),\n toBuffer = require_to_buffer(),\n ZEROS = Buffer2.alloc(128),\n sizes = {\n md5: 16,\n sha1: 20,\n sha224: 28,\n sha256: 32,\n sha384: 48,\n sha512: 64,\n rmd160: 20,\n ripemd160: 20,\n };\n function Hmac(alg, key, saltLen) {\n var hash = getDigest(alg),\n blocksize = alg === \"sha512\" || alg === \"sha384\" ? 128 : 64;\n key.length > blocksize\n ? (key = hash(key))\n : key.length < blocksize && (key = Buffer2.concat([key, ZEROS], blocksize));\n for (\n var ipad = Buffer2.allocUnsafe(blocksize + sizes[alg]),\n opad = Buffer2.allocUnsafe(blocksize + sizes[alg]),\n i = 0;\n i < blocksize;\n i++\n )\n (ipad[i] = key[i] ^ 54), (opad[i] = key[i] ^ 92);\n var ipad1 = Buffer2.allocUnsafe(blocksize + saltLen + 4);\n ipad.copy(ipad1, 0, 0, blocksize),\n (this.ipad1 = ipad1),\n (this.ipad2 = ipad),\n (this.opad = opad),\n (this.alg = alg),\n (this.blocksize = blocksize),\n (this.hash = hash),\n (this.size = sizes[alg]);\n }\n Hmac.prototype.run = function (data, ipad) {\n data.copy(ipad, this.blocksize);\n var h = this.hash(ipad);\n return h.copy(this.opad, this.blocksize), this.hash(this.opad);\n };\n function getDigest(alg) {\n function shaFunc(data) {\n return sha(alg).update(data).digest();\n }\n function rmd160Func(data) {\n return new RIPEMD160().update(data).digest();\n }\n return alg === \"rmd160\" || alg === \"ripemd160\" ? rmd160Func : alg === \"md5\" ? md5 : shaFunc;\n }\n function pbkdf2(password, salt, iterations, keylen, digest) {\n checkParameters(iterations, keylen),\n (password = toBuffer(password, defaultEncoding, \"Password\")),\n (salt = toBuffer(salt, defaultEncoding, \"Salt\")),\n (digest = digest || \"sha1\");\n var hmac = new Hmac(digest, password, salt.length),\n DK = Buffer2.allocUnsafe(keylen),\n block1 = Buffer2.allocUnsafe(salt.length + 4);\n salt.copy(block1, 0, 0, salt.length);\n for (var destPos = 0, hLen = sizes[digest], l = Math.ceil(keylen / hLen), i = 1; i <= l; i++) {\n block1.writeUInt32BE(i, salt.length);\n for (var T = hmac.run(block1, hmac.ipad1), U = T, j = 1; j < iterations; j++) {\n U = hmac.run(U, hmac.ipad2);\n for (var k = 0; k < hLen; k++) T[k] ^= U[k];\n }\n T.copy(DK, destPos), (destPos += hLen);\n }\n return DK;\n }\n module.exports = pbkdf2;\n },\n});\n\n// node_modules/pbkdf2/lib/async.js\nvar require_async = __commonJS({\n \"node_modules/pbkdf2/lib/async.js\"(exports, module) {\n var Buffer2 = require_safe_buffer().Buffer,\n checkParameters = require_precondition(),\n defaultEncoding = require_default_encoding(),\n sync = require_sync_browser(),\n toBuffer = require_to_buffer(),\n ZERO_BUF,\n subtle = globalCrypto.subtle,\n toBrowser = {\n sha: \"SHA-1\",\n \"sha-1\": \"SHA-1\",\n sha1: \"SHA-1\",\n sha256: \"SHA-256\",\n \"sha-256\": \"SHA-256\",\n sha384: \"SHA-384\",\n \"sha-384\": \"SHA-384\",\n \"sha-512\": \"SHA-512\",\n sha512: \"SHA-512\",\n },\n checks = [];\n function checkNative(algo) {\n if ((global.process && !global.process.browser) || !subtle || !subtle.importKey || !subtle.deriveBits)\n return Promise.resolve(!1);\n if (checks[algo] !== void 0) return checks[algo];\n ZERO_BUF = ZERO_BUF || Buffer2.alloc(8);\n var prom = browserPbkdf2(ZERO_BUF, ZERO_BUF, 10, 128, algo)\n .then(function () {\n return !0;\n })\n .catch(function () {\n return !1;\n });\n return (checks[algo] = prom), prom;\n }\n var nextTick;\n function getNextTick() {\n return (\n nextTick ||\n (global.process && global.process.nextTick\n ? (nextTick = global.process.nextTick)\n : global.queueMicrotask\n ? (nextTick = global.queueMicrotask)\n : global.setImmediate\n ? (nextTick = global.setImmediate)\n : (nextTick = global.setTimeout),\n nextTick)\n );\n }\n function browserPbkdf2(password, salt, iterations, length, algo) {\n return subtle\n .importKey(\"raw\", password, { name: \"PBKDF2\" }, !1, [\"deriveBits\"])\n .then(function (key) {\n return subtle.deriveBits(\n {\n name: \"PBKDF2\",\n salt,\n iterations,\n hash: {\n name: algo,\n },\n },\n key,\n length << 3,\n );\n })\n .then(function (res) {\n return Buffer2.from(res);\n });\n }\n function resolvePromise(promise, callback) {\n promise.then(\n function (out) {\n getNextTick()(function () {\n callback(null, out);\n });\n },\n function (e) {\n getNextTick()(function () {\n callback(e);\n });\n },\n );\n }\n module.exports = function (password, salt, iterations, keylen, digest, callback) {\n typeof digest == \"function\" && ((callback = digest), (digest = void 0)), (digest = digest || \"sha1\");\n var algo = toBrowser[digest.toLowerCase()];\n if (!algo || typeof global.Promise != \"function\") {\n getNextTick()(function () {\n var out;\n try {\n out = sync(password, salt, iterations, keylen, digest);\n } catch (e) {\n return callback(e);\n }\n callback(null, out);\n });\n return;\n }\n if (\n (checkParameters(iterations, keylen),\n (password = toBuffer(password, defaultEncoding, \"Password\")),\n (salt = toBuffer(salt, defaultEncoding, \"Salt\")),\n typeof callback != \"function\")\n )\n throw new Error(\"No callback provided to pbkdf2\");\n resolvePromise(\n checkNative(algo).then(function (resp) {\n return resp\n ? browserPbkdf2(password, salt, iterations, keylen, algo)\n : sync(password, salt, iterations, keylen, digest);\n }),\n callback,\n );\n };\n },\n});\n\n// node_modules/pbkdf2/browser.js\nvar require_browser4 = __commonJS({\n \"node_modules/pbkdf2/browser.js\"(exports) {\n exports.pbkdf2 = require_async();\n exports.pbkdf2Sync = require_sync_browser();\n },\n});\n\n// node_modules/des.js/lib/des/utils.js\nvar require_utils = __commonJS({\n \"node_modules/des.js/lib/des/utils.js\"(exports) {\n \"use strict\";\n exports.readUInt32BE = function (bytes, off) {\n var res = (bytes[0 + off] << 24) | (bytes[1 + off] << 16) | (bytes[2 + off] << 8) | bytes[3 + off];\n return res >>> 0;\n };\n exports.writeUInt32BE = function (bytes, value, off) {\n (bytes[0 + off] = value >>> 24),\n (bytes[1 + off] = (value >>> 16) & 255),\n (bytes[2 + off] = (value >>> 8) & 255),\n (bytes[3 + off] = value & 255);\n };\n exports.ip = function (inL, inR, out, off) {\n for (var outL = 0, outR = 0, i = 6; i >= 0; i -= 2) {\n for (var j = 0; j <= 24; j += 8) (outL <<= 1), (outL |= (inR >>> (j + i)) & 1);\n for (var j = 0; j <= 24; j += 8) (outL <<= 1), (outL |= (inL >>> (j + i)) & 1);\n }\n for (var i = 6; i >= 0; i -= 2) {\n for (var j = 1; j <= 25; j += 8) (outR <<= 1), (outR |= (inR >>> (j + i)) & 1);\n for (var j = 1; j <= 25; j += 8) (outR <<= 1), (outR |= (inL >>> (j + i)) & 1);\n }\n (out[off + 0] = outL >>> 0), (out[off + 1] = outR >>> 0);\n };\n exports.rip = function (inL, inR, out, off) {\n for (var outL = 0, outR = 0, i = 0; i < 4; i++)\n for (var j = 24; j >= 0; j -= 8)\n (outL <<= 1), (outL |= (inR >>> (j + i)) & 1), (outL <<= 1), (outL |= (inL >>> (j + i)) & 1);\n for (var i = 4; i < 8; i++)\n for (var j = 24; j >= 0; j -= 8)\n (outR <<= 1), (outR |= (inR >>> (j + i)) & 1), (outR <<= 1), (outR |= (inL >>> (j + i)) & 1);\n (out[off + 0] = outL >>> 0), (out[off + 1] = outR >>> 0);\n };\n exports.pc1 = function (inL, inR, out, off) {\n for (var outL = 0, outR = 0, i = 7; i >= 5; i--) {\n for (var j = 0; j <= 24; j += 8) (outL <<= 1), (outL |= (inR >> (j + i)) & 1);\n for (var j = 0; j <= 24; j += 8) (outL <<= 1), (outL |= (inL >> (j + i)) & 1);\n }\n for (var j = 0; j <= 24; j += 8) (outL <<= 1), (outL |= (inR >> (j + i)) & 1);\n for (var i = 1; i <= 3; i++) {\n for (var j = 0; j <= 24; j += 8) (outR <<= 1), (outR |= (inR >> (j + i)) & 1);\n for (var j = 0; j <= 24; j += 8) (outR <<= 1), (outR |= (inL >> (j + i)) & 1);\n }\n for (var j = 0; j <= 24; j += 8) (outR <<= 1), (outR |= (inL >> (j + i)) & 1);\n (out[off + 0] = outL >>> 0), (out[off + 1] = outR >>> 0);\n };\n exports.r28shl = function (num, shift) {\n return ((num << shift) & 268435455) | (num >>> (28 - shift));\n };\n var pc2table = [\n 14, 11, 17, 4, 27, 23, 25, 0, 13, 22, 7, 18, 5, 9, 16, 24, 2, 20, 12, 21, 1, 8, 15, 26, 15, 4, 25, 19, 9, 1, 26,\n 16, 5, 11, 23, 8, 12, 7, 17, 0, 22, 3, 10, 14, 6, 20, 27, 24,\n ];\n exports.pc2 = function (inL, inR, out, off) {\n for (var outL = 0, outR = 0, len = pc2table.length >>> 1, i = 0; i < len; i++)\n (outL <<= 1), (outL |= (inL >>> pc2table[i]) & 1);\n for (var i = len; i < pc2table.length; i++) (outR <<= 1), (outR |= (inR >>> pc2table[i]) & 1);\n (out[off + 0] = outL >>> 0), (out[off + 1] = outR >>> 0);\n };\n exports.expand = function (r, out, off) {\n var outL = 0,\n outR = 0;\n outL = ((r & 1) << 5) | (r >>> 27);\n for (var i = 23; i >= 15; i -= 4) (outL <<= 6), (outL |= (r >>> i) & 63);\n for (var i = 11; i >= 3; i -= 4) (outR |= (r >>> i) & 63), (outR <<= 6);\n (outR |= ((r & 31) << 1) | (r >>> 31)), (out[off + 0] = outL >>> 0), (out[off + 1] = outR >>> 0);\n };\n var sTable = [\n 14, 0, 4, 15, 13, 7, 1, 4, 2, 14, 15, 2, 11, 13, 8, 1, 3, 10, 10, 6, 6, 12, 12, 11, 5, 9, 9, 5, 0, 3, 7, 8, 4, 15,\n 1, 12, 14, 8, 8, 2, 13, 4, 6, 9, 2, 1, 11, 7, 15, 5, 12, 11, 9, 3, 7, 14, 3, 10, 10, 0, 5, 6, 0, 13, 15, 3, 1, 13,\n 8, 4, 14, 7, 6, 15, 11, 2, 3, 8, 4, 14, 9, 12, 7, 0, 2, 1, 13, 10, 12, 6, 0, 9, 5, 11, 10, 5, 0, 13, 14, 8, 7, 10,\n 11, 1, 10, 3, 4, 15, 13, 4, 1, 2, 5, 11, 8, 6, 12, 7, 6, 12, 9, 0, 3, 5, 2, 14, 15, 9, 10, 13, 0, 7, 9, 0, 14, 9,\n 6, 3, 3, 4, 15, 6, 5, 10, 1, 2, 13, 8, 12, 5, 7, 14, 11, 12, 4, 11, 2, 15, 8, 1, 13, 1, 6, 10, 4, 13, 9, 0, 8, 6,\n 15, 9, 3, 8, 0, 7, 11, 4, 1, 15, 2, 14, 12, 3, 5, 11, 10, 5, 14, 2, 7, 12, 7, 13, 13, 8, 14, 11, 3, 5, 0, 6, 6,\n 15, 9, 0, 10, 3, 1, 4, 2, 7, 8, 2, 5, 12, 11, 1, 12, 10, 4, 14, 15, 9, 10, 3, 6, 15, 9, 0, 0, 6, 12, 10, 11, 1, 7,\n 13, 13, 8, 15, 9, 1, 4, 3, 5, 14, 11, 5, 12, 2, 7, 8, 2, 4, 14, 2, 14, 12, 11, 4, 2, 1, 12, 7, 4, 10, 7, 11, 13,\n 6, 1, 8, 5, 5, 0, 3, 15, 15, 10, 13, 3, 0, 9, 14, 8, 9, 6, 4, 11, 2, 8, 1, 12, 11, 7, 10, 1, 13, 14, 7, 2, 8, 13,\n 15, 6, 9, 15, 12, 0, 5, 9, 6, 10, 3, 4, 0, 5, 14, 3, 12, 10, 1, 15, 10, 4, 15, 2, 9, 7, 2, 12, 6, 9, 8, 5, 0, 6,\n 13, 1, 3, 13, 4, 14, 14, 0, 7, 11, 5, 3, 11, 8, 9, 4, 14, 3, 15, 2, 5, 12, 2, 9, 8, 5, 12, 15, 3, 10, 7, 11, 0,\n 14, 4, 1, 10, 7, 1, 6, 13, 0, 11, 8, 6, 13, 4, 13, 11, 0, 2, 11, 14, 7, 15, 4, 0, 9, 8, 1, 13, 10, 3, 14, 12, 3,\n 9, 5, 7, 12, 5, 2, 10, 15, 6, 8, 1, 6, 1, 6, 4, 11, 11, 13, 13, 8, 12, 1, 3, 4, 7, 10, 14, 7, 10, 9, 15, 5, 6, 0,\n 8, 15, 0, 14, 5, 2, 9, 3, 2, 12, 13, 1, 2, 15, 8, 13, 4, 8, 6, 10, 15, 3, 11, 7, 1, 4, 10, 12, 9, 5, 3, 6, 14, 11,\n 5, 0, 0, 14, 12, 9, 7, 2, 7, 2, 11, 1, 4, 14, 1, 7, 9, 4, 12, 10, 14, 8, 2, 13, 0, 15, 6, 12, 10, 9, 13, 0, 15, 3,\n 3, 5, 5, 6, 8, 11,\n ];\n exports.substitute = function (inL, inR) {\n for (var out = 0, i = 0; i < 4; i++) {\n var b = (inL >>> (18 - i * 6)) & 63,\n sb = sTable[i * 64 + b];\n (out <<= 4), (out |= sb);\n }\n for (var i = 0; i < 4; i++) {\n var b = (inR >>> (18 - i * 6)) & 63,\n sb = sTable[4 * 64 + i * 64 + b];\n (out <<= 4), (out |= sb);\n }\n return out >>> 0;\n };\n var permuteTable = [\n 16, 25, 12, 11, 3, 20, 4, 15, 31, 17, 9, 6, 27, 14, 1, 22, 30, 24, 8, 18, 0, 5, 29, 23, 13, 19, 2, 26, 10, 21, 28,\n 7,\n ];\n exports.permute = function (num) {\n for (var out = 0, i = 0; i < permuteTable.length; i++) (out <<= 1), (out |= (num >>> permuteTable[i]) & 1);\n return out >>> 0;\n };\n exports.padSplit = function (num, size, group) {\n for (var str = num.toString(2); str.length < size; ) str = \"0\" + str;\n for (var out = [], i = 0; i < size; i += group) out.push(str.slice(i, i + group));\n return out.join(\" \");\n };\n },\n});\n\n// node_modules/minimalistic-assert/index.js\nvar require_minimalistic_assert = __commonJS({\n \"node_modules/minimalistic-assert/index.js\"(exports, module) {\n module.exports = assert;\n function assert(val, msg) {\n if (!val) throw new Error(msg || \"Assertion failed\");\n }\n assert.equal = function (l, r, msg) {\n if (l != r) throw new Error(msg || \"Assertion failed: \" + l + \" != \" + r);\n };\n },\n});\n\n// node_modules/des.js/lib/des/cipher.js\nvar require_cipher = __commonJS({\n \"node_modules/des.js/lib/des/cipher.js\"(exports, module) {\n \"use strict\";\n var assert = require_minimalistic_assert();\n function Cipher(options) {\n (this.options = options),\n (this.type = this.options.type),\n (this.blockSize = 8),\n this._init(),\n (this.buffer = new Array(this.blockSize)),\n (this.bufferOff = 0);\n }\n module.exports = Cipher;\n Cipher.prototype._init = function () {};\n Cipher.prototype.update = function (data) {\n return data.length === 0 ? [] : this.type === \"decrypt\" ? this._updateDecrypt(data) : this._updateEncrypt(data);\n };\n Cipher.prototype._buffer = function (data, off) {\n for (var min = Math.min(this.buffer.length - this.bufferOff, data.length - off), i = 0; i < min; i++)\n this.buffer[this.bufferOff + i] = data[off + i];\n return (this.bufferOff += min), min;\n };\n Cipher.prototype._flushBuffer = function (out, off) {\n return this._update(this.buffer, 0, out, off), (this.bufferOff = 0), this.blockSize;\n };\n Cipher.prototype._updateEncrypt = function (data) {\n var inputOff = 0,\n outputOff = 0,\n count = ((this.bufferOff + data.length) / this.blockSize) | 0,\n out = new Array(count * this.blockSize);\n this.bufferOff !== 0 &&\n ((inputOff += this._buffer(data, inputOff)),\n this.bufferOff === this.buffer.length && (outputOff += this._flushBuffer(out, outputOff)));\n for (\n var max = data.length - ((data.length - inputOff) % this.blockSize);\n inputOff < max;\n inputOff += this.blockSize\n )\n this._update(data, inputOff, out, outputOff), (outputOff += this.blockSize);\n for (; inputOff < data.length; inputOff++, this.bufferOff++) this.buffer[this.bufferOff] = data[inputOff];\n return out;\n };\n Cipher.prototype._updateDecrypt = function (data) {\n for (\n var inputOff = 0,\n outputOff = 0,\n count = Math.ceil((this.bufferOff + data.length) / this.blockSize) - 1,\n out = new Array(count * this.blockSize);\n count > 0;\n count--\n )\n (inputOff += this._buffer(data, inputOff)), (outputOff += this._flushBuffer(out, outputOff));\n return (inputOff += this._buffer(data, inputOff)), out;\n };\n Cipher.prototype.final = function (buffer) {\n var first;\n buffer && (first = this.update(buffer));\n var last;\n return (\n this.type === \"encrypt\" ? (last = this._finalEncrypt()) : (last = this._finalDecrypt()),\n first ? first.concat(last) : last\n );\n };\n Cipher.prototype._pad = function (buffer, off) {\n if (off === 0) return !1;\n for (; off < buffer.length; ) buffer[off++] = 0;\n return !0;\n };\n Cipher.prototype._finalEncrypt = function () {\n if (!this._pad(this.buffer, this.bufferOff)) return [];\n var out = new Array(this.blockSize);\n return this._update(this.buffer, 0, out, 0), out;\n };\n Cipher.prototype._unpad = function (buffer) {\n return buffer;\n };\n Cipher.prototype._finalDecrypt = function () {\n assert.equal(this.bufferOff, this.blockSize, \"Not enough data to decrypt\");\n var out = new Array(this.blockSize);\n return this._flushBuffer(out, 0), this._unpad(out);\n };\n },\n});\n\n// node_modules/des.js/lib/des/des.js\nvar require_des = __commonJS({\n \"node_modules/des.js/lib/des/des.js\"(exports, module) {\n \"use strict\";\n var assert = require_minimalistic_assert(),\n inherits = require_inherits_browser(),\n utils = require_utils(),\n Cipher = require_cipher();\n function DESState() {\n (this.tmp = new Array(2)), (this.keys = null);\n }\n function DES(options) {\n Cipher.call(this, options);\n var state = new DESState();\n (this._desState = state), this.deriveKeys(state, options.key);\n }\n inherits(DES, Cipher);\n module.exports = DES;\n DES.create = function (options) {\n return new DES(options);\n };\n var shiftTable = [1, 1, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 1];\n DES.prototype.deriveKeys = function (state, key) {\n (state.keys = new Array(16 * 2)), assert.equal(key.length, this.blockSize, \"Invalid key length\");\n var kL = utils.readUInt32BE(key, 0),\n kR = utils.readUInt32BE(key, 4);\n utils.pc1(kL, kR, state.tmp, 0), (kL = state.tmp[0]), (kR = state.tmp[1]);\n for (var i = 0; i < state.keys.length; i += 2) {\n var shift = shiftTable[i >>> 1];\n (kL = utils.r28shl(kL, shift)), (kR = utils.r28shl(kR, shift)), utils.pc2(kL, kR, state.keys, i);\n }\n };\n DES.prototype._update = function (inp, inOff, out, outOff) {\n var state = this._desState,\n l = utils.readUInt32BE(inp, inOff),\n r = utils.readUInt32BE(inp, inOff + 4);\n utils.ip(l, r, state.tmp, 0),\n (l = state.tmp[0]),\n (r = state.tmp[1]),\n this.type === \"encrypt\" ? this._encrypt(state, l, r, state.tmp, 0) : this._decrypt(state, l, r, state.tmp, 0),\n (l = state.tmp[0]),\n (r = state.tmp[1]),\n utils.writeUInt32BE(out, l, outOff),\n utils.writeUInt32BE(out, r, outOff + 4);\n };\n DES.prototype._pad = function (buffer, off) {\n for (var value = buffer.length - off, i = off; i < buffer.length; i++) buffer[i] = value;\n return !0;\n };\n DES.prototype._unpad = function (buffer) {\n for (var pad = buffer[buffer.length - 1], i = buffer.length - pad; i < buffer.length; i++)\n assert.equal(buffer[i], pad);\n return buffer.slice(0, buffer.length - pad);\n };\n DES.prototype._encrypt = function (state, lStart, rStart, out, off) {\n for (var l = lStart, r = rStart, i = 0; i < state.keys.length; i += 2) {\n var keyL = state.keys[i],\n keyR = state.keys[i + 1];\n utils.expand(r, state.tmp, 0), (keyL ^= state.tmp[0]), (keyR ^= state.tmp[1]);\n var s = utils.substitute(keyL, keyR),\n f = utils.permute(s),\n t = r;\n (r = (l ^ f) >>> 0), (l = t);\n }\n utils.rip(r, l, out, off);\n };\n DES.prototype._decrypt = function (state, lStart, rStart, out, off) {\n for (var l = rStart, r = lStart, i = state.keys.length - 2; i >= 0; i -= 2) {\n var keyL = state.keys[i],\n keyR = state.keys[i + 1];\n utils.expand(l, state.tmp, 0), (keyL ^= state.tmp[0]), (keyR ^= state.tmp[1]);\n var s = utils.substitute(keyL, keyR),\n f = utils.permute(s),\n t = l;\n (l = (r ^ f) >>> 0), (r = t);\n }\n utils.rip(l, r, out, off);\n };\n },\n});\n\n// node_modules/des.js/lib/des/cbc.js\nvar require_cbc = __commonJS({\n \"node_modules/des.js/lib/des/cbc.js\"(exports) {\n \"use strict\";\n var assert = require_minimalistic_assert(),\n inherits = require_inherits_browser(),\n proto = {};\n function CBCState(iv) {\n assert.equal(iv.length, 8, \"Invalid IV length\"), (this.iv = new Array(8));\n for (var i = 0; i < this.iv.length; i++) this.iv[i] = iv[i];\n }\n function instantiate(Base) {\n function CBC(options) {\n Base.call(this, options), this._cbcInit();\n }\n inherits(CBC, Base);\n for (var keys = Object.keys(proto), i = 0; i < keys.length; i++) {\n var key = keys[i];\n CBC.prototype[key] = proto[key];\n }\n return (\n (CBC.create = function (options) {\n return new CBC(options);\n }),\n CBC\n );\n }\n exports.instantiate = instantiate;\n proto._cbcInit = function () {\n var state = new CBCState(this.options.iv);\n this._cbcState = state;\n };\n proto._update = function (inp, inOff, out, outOff) {\n var state = this._cbcState,\n superProto = this.constructor.super_.prototype,\n iv = state.iv;\n if (this.type === \"encrypt\") {\n for (var i = 0; i < this.blockSize; i++) iv[i] ^= inp[inOff + i];\n superProto._update.call(this, iv, 0, out, outOff);\n for (var i = 0; i < this.blockSize; i++) iv[i] = out[outOff + i];\n } else {\n superProto._update.call(this, inp, inOff, out, outOff);\n for (var i = 0; i < this.blockSize; i++) out[outOff + i] ^= iv[i];\n for (var i = 0; i < this.blockSize; i++) iv[i] = inp[inOff + i];\n }\n };\n },\n});\n\n// node_modules/des.js/lib/des/ede.js\nvar require_ede = __commonJS({\n \"node_modules/des.js/lib/des/ede.js\"(exports, module) {\n \"use strict\";\n var assert = require_minimalistic_assert(),\n inherits = require_inherits_browser(),\n Cipher = require_cipher(),\n DES = require_des();\n function EDEState(type, key) {\n assert.equal(key.length, 24, \"Invalid key length\");\n var k1 = key.slice(0, 8),\n k2 = key.slice(8, 16),\n k3 = key.slice(16, 24);\n type === \"encrypt\"\n ? (this.ciphers = [\n DES.create({ type: \"encrypt\", key: k1 }),\n DES.create({ type: \"decrypt\", key: k2 }),\n DES.create({ type: \"encrypt\", key: k3 }),\n ])\n : (this.ciphers = [\n DES.create({ type: \"decrypt\", key: k3 }),\n DES.create({ type: \"encrypt\", key: k2 }),\n DES.create({ type: \"decrypt\", key: k1 }),\n ]);\n }\n function EDE(options) {\n Cipher.call(this, options);\n var state = new EDEState(this.type, this.options.key);\n this._edeState = state;\n }\n inherits(EDE, Cipher);\n module.exports = EDE;\n EDE.create = function (options) {\n return new EDE(options);\n };\n EDE.prototype._update = function (inp, inOff, out, outOff) {\n var state = this._edeState;\n state.ciphers[0]._update(inp, inOff, out, outOff),\n state.ciphers[1]._update(out, outOff, out, outOff),\n state.ciphers[2]._update(out, outOff, out, outOff);\n };\n EDE.prototype._pad = DES.prototype._pad;\n EDE.prototype._unpad = DES.prototype._unpad;\n },\n});\n\n// node_modules/des.js/lib/des.js\nvar require_des2 = __commonJS({\n \"node_modules/des.js/lib/des.js\"(exports) {\n \"use strict\";\n exports.utils = require_utils();\n exports.Cipher = require_cipher();\n exports.DES = require_des();\n exports.CBC = require_cbc();\n exports.EDE = require_ede();\n },\n});\n\n// node_modules/browserify-des/index.js\nvar require_browserify_des = __commonJS({\n \"node_modules/browserify-des/index.js\"(exports, module) {\n var CipherBase = require_cipher_base(),\n des = require_des2(),\n inherits = require_inherits_browser(),\n Buffer2 = require_safe_buffer().Buffer,\n modes = {\n \"des-ede3-cbc\": des.CBC.instantiate(des.EDE),\n \"des-ede3\": des.EDE,\n \"des-ede-cbc\": des.CBC.instantiate(des.EDE),\n \"des-ede\": des.EDE,\n \"des-cbc\": des.CBC.instantiate(des.DES),\n \"des-ecb\": des.DES,\n };\n modes.des = modes[\"des-cbc\"];\n modes.des3 = modes[\"des-ede3-cbc\"];\n module.exports = DES;\n inherits(DES, CipherBase);\n function DES(opts) {\n CipherBase.call(this);\n var modeName = opts.mode.toLowerCase(),\n mode = modes[modeName],\n type;\n opts.decrypt ? (type = \"decrypt\") : (type = \"encrypt\");\n var key = opts.key;\n Buffer2.isBuffer(key) || (key = Buffer2.from(key)),\n (modeName === \"des-ede\" || modeName === \"des-ede-cbc\") && (key = Buffer2.concat([key, key.slice(0, 8)]));\n var iv = opts.iv;\n Buffer2.isBuffer(iv) || (iv = Buffer2.from(iv)),\n (this._des = mode.create({\n key,\n iv,\n type,\n }));\n }\n DES.prototype._update = function (data) {\n return Buffer2.from(this._des.update(data));\n };\n DES.prototype._final = function () {\n return Buffer2.from(this._des.final());\n };\n },\n});\n\n// node_modules/browserify-aes/modes/ecb.js\nvar require_ecb = __commonJS({\n \"node_modules/browserify-aes/modes/ecb.js\"(exports) {\n exports.encrypt = function (self2, block) {\n return self2._cipher.encryptBlock(block);\n };\n exports.decrypt = function (self2, block) {\n return self2._cipher.decryptBlock(block);\n };\n },\n});\n\n// node_modules/buffer-xor/index.js\nvar require_buffer_xor = __commonJS({\n \"node_modules/buffer-xor/index.js\"(exports, module) {\n module.exports = function (a, b) {\n for (var length = Math.min(a.length, b.length), buffer = new Buffer(length), i = 0; i < length; ++i)\n buffer[i] = a[i] ^ b[i];\n return buffer;\n };\n },\n});\n\n// node_modules/browserify-aes/modes/cbc.js\nvar require_cbc2 = __commonJS({\n \"node_modules/browserify-aes/modes/cbc.js\"(exports) {\n var xor = require_buffer_xor();\n exports.encrypt = function (self2, block) {\n var data = xor(block, self2._prev);\n return (self2._prev = self2._cipher.encryptBlock(data)), self2._prev;\n };\n exports.decrypt = function (self2, block) {\n var pad = self2._prev;\n self2._prev = block;\n var out = self2._cipher.decryptBlock(block);\n return xor(out, pad);\n };\n },\n});\n\n// node_modules/browserify-aes/modes/cfb.js\nvar require_cfb = __commonJS({\n \"node_modules/browserify-aes/modes/cfb.js\"(exports) {\n var Buffer2 = require_safe_buffer().Buffer,\n xor = require_buffer_xor();\n function encryptStart(self2, data, decrypt) {\n var len = data.length,\n out = xor(data, self2._cache);\n return (\n (self2._cache = self2._cache.slice(len)),\n (self2._prev = Buffer2.concat([self2._prev, decrypt ? data : out])),\n out\n );\n }\n exports.encrypt = function (self2, data, decrypt) {\n for (var out = Buffer2.allocUnsafe(0), len; data.length; )\n if (\n (self2._cache.length === 0 &&\n ((self2._cache = self2._cipher.encryptBlock(self2._prev)), (self2._prev = Buffer2.allocUnsafe(0))),\n self2._cache.length <= data.length)\n )\n (len = self2._cache.length),\n (out = Buffer2.concat([out, encryptStart(self2, data.slice(0, len), decrypt)])),\n (data = data.slice(len));\n else {\n out = Buffer2.concat([out, encryptStart(self2, data, decrypt)]);\n break;\n }\n return out;\n };\n },\n});\n\n// node_modules/browserify-aes/modes/cfb8.js\nvar require_cfb8 = __commonJS({\n \"node_modules/browserify-aes/modes/cfb8.js\"(exports) {\n var Buffer2 = require_safe_buffer().Buffer;\n function encryptByte(self2, byteParam, decrypt) {\n var pad = self2._cipher.encryptBlock(self2._prev),\n out = pad[0] ^ byteParam;\n return (self2._prev = Buffer2.concat([self2._prev.slice(1), Buffer2.from([decrypt ? byteParam : out])])), out;\n }\n exports.encrypt = function (self2, chunk, decrypt) {\n for (var len = chunk.length, out = Buffer2.allocUnsafe(len), i = -1; ++i < len; )\n out[i] = encryptByte(self2, chunk[i], decrypt);\n return out;\n };\n },\n});\n\n// node_modules/browserify-aes/modes/cfb1.js\nvar require_cfb1 = __commonJS({\n \"node_modules/browserify-aes/modes/cfb1.js\"(exports) {\n var Buffer2 = require_safe_buffer().Buffer;\n function encryptByte(self2, byteParam, decrypt) {\n for (var pad, i = -1, len = 8, out = 0, bit, value; ++i < len; )\n (pad = self2._cipher.encryptBlock(self2._prev)),\n (bit = byteParam & (1 << (7 - i)) ? 128 : 0),\n (value = pad[0] ^ bit),\n (out += (value & 128) >> i % 8),\n (self2._prev = shiftIn(self2._prev, decrypt ? bit : value));\n return out;\n }\n function shiftIn(buffer, value) {\n var len = buffer.length,\n i = -1,\n out = Buffer2.allocUnsafe(buffer.length);\n for (buffer = Buffer2.concat([buffer, Buffer2.from([value])]); ++i < len; )\n out[i] = (buffer[i] << 1) | (buffer[i + 1] >> 7);\n return out;\n }\n exports.encrypt = function (self2, chunk, decrypt) {\n for (var len = chunk.length, out = Buffer2.allocUnsafe(len), i = -1; ++i < len; )\n out[i] = encryptByte(self2, chunk[i], decrypt);\n return out;\n };\n },\n});\n\n// node_modules/browserify-aes/modes/ofb.js\nvar require_ofb = __commonJS({\n \"node_modules/browserify-aes/modes/ofb.js\"(exports) {\n var xor = require_buffer_xor();\n function getBlock(self2) {\n return (self2._prev = self2._cipher.encryptBlock(self2._prev)), self2._prev;\n }\n exports.encrypt = function (self2, chunk) {\n for (; self2._cache.length < chunk.length; ) self2._cache = Buffer.concat([self2._cache, getBlock(self2)]);\n var pad = self2._cache.slice(0, chunk.length);\n return (self2._cache = self2._cache.slice(chunk.length)), xor(chunk, pad);\n };\n },\n});\n\n// node_modules/browserify-aes/incr32.js\nvar require_incr32 = __commonJS({\n \"node_modules/browserify-aes/incr32.js\"(exports, module) {\n function incr32(iv) {\n for (var len = iv.length, item; len--; )\n if (((item = iv.readUInt8(len)), item === 255)) iv.writeUInt8(0, len);\n else {\n item++, iv.writeUInt8(item, len);\n break;\n }\n }\n module.exports = incr32;\n },\n});\n\n// node_modules/browserify-aes/modes/ctr.js\nvar require_ctr = __commonJS({\n \"node_modules/browserify-aes/modes/ctr.js\"(exports) {\n var xor = require_buffer_xor(),\n Buffer2 = require_safe_buffer().Buffer,\n incr32 = require_incr32();\n function getBlock(self2) {\n var out = self2._cipher.encryptBlockRaw(self2._prev);\n return incr32(self2._prev), out;\n }\n var blockSize = 16;\n exports.encrypt = function (self2, chunk) {\n var chunkNum = Math.ceil(chunk.length / blockSize),\n start = self2._cache.length;\n self2._cache = Buffer2.concat([self2._cache, Buffer2.allocUnsafe(chunkNum * blockSize)]);\n for (var i = 0; i < chunkNum; i++) {\n var out = getBlock(self2),\n offset = start + i * blockSize;\n self2._cache.writeUInt32BE(out[0], offset + 0),\n self2._cache.writeUInt32BE(out[1], offset + 4),\n self2._cache.writeUInt32BE(out[2], offset + 8),\n self2._cache.writeUInt32BE(out[3], offset + 12);\n }\n var pad = self2._cache.slice(0, chunk.length);\n return (self2._cache = self2._cache.slice(chunk.length)), xor(chunk, pad);\n };\n },\n});\n\n// node_modules/browserify-aes/modes/list.json\nvar require_list = __commonJS({\n \"node_modules/browserify-aes/modes/list.json\"(exports, module) {\n module.exports = {\n \"aes-128-ecb\": {\n cipher: \"AES\",\n key: 128,\n iv: 0,\n mode: \"ECB\",\n type: \"block\",\n },\n \"aes-192-ecb\": {\n cipher: \"AES\",\n key: 192,\n iv: 0,\n mode: \"ECB\",\n type: \"block\",\n },\n \"aes-256-ecb\": {\n cipher: \"AES\",\n key: 256,\n iv: 0,\n mode: \"ECB\",\n type: \"block\",\n },\n \"aes-128-cbc\": {\n cipher: \"AES\",\n key: 128,\n iv: 16,\n mode: \"CBC\",\n type: \"block\",\n },\n \"aes-192-cbc\": {\n cipher: \"AES\",\n key: 192,\n iv: 16,\n mode: \"CBC\",\n type: \"block\",\n },\n \"aes-256-cbc\": {\n cipher: \"AES\",\n key: 256,\n iv: 16,\n mode: \"CBC\",\n type: \"block\",\n },\n aes128: {\n cipher: \"AES\",\n key: 128,\n iv: 16,\n mode: \"CBC\",\n type: \"block\",\n },\n aes192: {\n cipher: \"AES\",\n key: 192,\n iv: 16,\n mode: \"CBC\",\n type: \"block\",\n },\n aes256: {\n cipher: \"AES\",\n key: 256,\n iv: 16,\n mode: \"CBC\",\n type: \"block\",\n },\n \"aes-128-cfb\": {\n cipher: \"AES\",\n key: 128,\n iv: 16,\n mode: \"CFB\",\n type: \"stream\",\n },\n \"aes-192-cfb\": {\n cipher: \"AES\",\n key: 192,\n iv: 16,\n mode: \"CFB\",\n type: \"stream\",\n },\n \"aes-256-cfb\": {\n cipher: \"AES\",\n key: 256,\n iv: 16,\n mode: \"CFB\",\n type: \"stream\",\n },\n \"aes-128-cfb8\": {\n cipher: \"AES\",\n key: 128,\n iv: 16,\n mode: \"CFB8\",\n type: \"stream\",\n },\n \"aes-192-cfb8\": {\n cipher: \"AES\",\n key: 192,\n iv: 16,\n mode: \"CFB8\",\n type: \"stream\",\n },\n \"aes-256-cfb8\": {\n cipher: \"AES\",\n key: 256,\n iv: 16,\n mode: \"CFB8\",\n type: \"stream\",\n },\n \"aes-128-cfb1\": {\n cipher: \"AES\",\n key: 128,\n iv: 16,\n mode: \"CFB1\",\n type: \"stream\",\n },\n \"aes-192-cfb1\": {\n cipher: \"AES\",\n key: 192,\n iv: 16,\n mode: \"CFB1\",\n type: \"stream\",\n },\n \"aes-256-cfb1\": {\n cipher: \"AES\",\n key: 256,\n iv: 16,\n mode: \"CFB1\",\n type: \"stream\",\n },\n \"aes-128-ofb\": {\n cipher: \"AES\",\n key: 128,\n iv: 16,\n mode: \"OFB\",\n type: \"stream\",\n },\n \"aes-192-ofb\": {\n cipher: \"AES\",\n key: 192,\n iv: 16,\n mode: \"OFB\",\n type: \"stream\",\n },\n \"aes-256-ofb\": {\n cipher: \"AES\",\n key: 256,\n iv: 16,\n mode: \"OFB\",\n type: \"stream\",\n },\n \"aes-128-ctr\": {\n cipher: \"AES\",\n key: 128,\n iv: 16,\n mode: \"CTR\",\n type: \"stream\",\n },\n \"aes-192-ctr\": {\n cipher: \"AES\",\n key: 192,\n iv: 16,\n mode: \"CTR\",\n type: \"stream\",\n },\n \"aes-256-ctr\": {\n cipher: \"AES\",\n key: 256,\n iv: 16,\n mode: \"CTR\",\n type: \"stream\",\n },\n \"aes-128-gcm\": {\n cipher: \"AES\",\n key: 128,\n iv: 12,\n mode: \"GCM\",\n type: \"auth\",\n },\n \"aes-192-gcm\": {\n cipher: \"AES\",\n key: 192,\n iv: 12,\n mode: \"GCM\",\n type: \"auth\",\n },\n \"aes-256-gcm\": {\n cipher: \"AES\",\n key: 256,\n iv: 12,\n mode: \"GCM\",\n type: \"auth\",\n },\n };\n },\n});\n\n// node_modules/browserify-aes/modes/index.js\nvar require_modes = __commonJS({\n \"node_modules/browserify-aes/modes/index.js\"(exports, module) {\n var modeModules = {\n ECB: require_ecb(),\n CBC: require_cbc2(),\n CFB: require_cfb(),\n CFB8: require_cfb8(),\n CFB1: require_cfb1(),\n OFB: require_ofb(),\n CTR: require_ctr(),\n GCM: require_ctr(),\n },\n modes = require_list();\n for (key in modes) modes[key].module = modeModules[modes[key].mode];\n var key;\n module.exports = modes;\n },\n});\n\n// node_modules/browserify-aes/aes.js\nvar require_aes = __commonJS({\n \"node_modules/browserify-aes/aes.js\"(exports, module) {\n var Buffer2 = require_safe_buffer().Buffer;\n function asUInt32Array(buf) {\n Buffer2.isBuffer(buf) || (buf = Buffer2.from(buf));\n for (var len = (buf.length / 4) | 0, out = new Array(len), i = 0; i < len; i++) out[i] = buf.readUInt32BE(i * 4);\n return out;\n }\n function scrubVec(v) {\n for (var i = 0; i < v.length; v++) v[i] = 0;\n }\n function cryptBlock(M, keySchedule, SUB_MIX, SBOX, nRounds) {\n for (\n var SUB_MIX0 = SUB_MIX[0],\n SUB_MIX1 = SUB_MIX[1],\n SUB_MIX2 = SUB_MIX[2],\n SUB_MIX3 = SUB_MIX[3],\n s0 = M[0] ^ keySchedule[0],\n s1 = M[1] ^ keySchedule[1],\n s2 = M[2] ^ keySchedule[2],\n s3 = M[3] ^ keySchedule[3],\n t0,\n t1,\n t2,\n t3,\n ksRow = 4,\n round = 1;\n round < nRounds;\n round++\n )\n (t0 =\n SUB_MIX0[s0 >>> 24] ^\n SUB_MIX1[(s1 >>> 16) & 255] ^\n SUB_MIX2[(s2 >>> 8) & 255] ^\n SUB_MIX3[s3 & 255] ^\n keySchedule[ksRow++]),\n (t1 =\n SUB_MIX0[s1 >>> 24] ^\n SUB_MIX1[(s2 >>> 16) & 255] ^\n SUB_MIX2[(s3 >>> 8) & 255] ^\n SUB_MIX3[s0 & 255] ^\n keySchedule[ksRow++]),\n (t2 =\n SUB_MIX0[s2 >>> 24] ^\n SUB_MIX1[(s3 >>> 16) & 255] ^\n SUB_MIX2[(s0 >>> 8) & 255] ^\n SUB_MIX3[s1 & 255] ^\n keySchedule[ksRow++]),\n (t3 =\n SUB_MIX0[s3 >>> 24] ^\n SUB_MIX1[(s0 >>> 16) & 255] ^\n SUB_MIX2[(s1 >>> 8) & 255] ^\n SUB_MIX3[s2 & 255] ^\n keySchedule[ksRow++]),\n (s0 = t0),\n (s1 = t1),\n (s2 = t2),\n (s3 = t3);\n return (\n (t0 =\n ((SBOX[s0 >>> 24] << 24) | (SBOX[(s1 >>> 16) & 255] << 16) | (SBOX[(s2 >>> 8) & 255] << 8) | SBOX[s3 & 255]) ^\n keySchedule[ksRow++]),\n (t1 =\n ((SBOX[s1 >>> 24] << 24) | (SBOX[(s2 >>> 16) & 255] << 16) | (SBOX[(s3 >>> 8) & 255] << 8) | SBOX[s0 & 255]) ^\n keySchedule[ksRow++]),\n (t2 =\n ((SBOX[s2 >>> 24] << 24) | (SBOX[(s3 >>> 16) & 255] << 16) | (SBOX[(s0 >>> 8) & 255] << 8) | SBOX[s1 & 255]) ^\n keySchedule[ksRow++]),\n (t3 =\n ((SBOX[s3 >>> 24] << 24) | (SBOX[(s0 >>> 16) & 255] << 16) | (SBOX[(s1 >>> 8) & 255] << 8) | SBOX[s2 & 255]) ^\n keySchedule[ksRow++]),\n (t0 = t0 >>> 0),\n (t1 = t1 >>> 0),\n (t2 = t2 >>> 0),\n (t3 = t3 >>> 0),\n [t0, t1, t2, t3]\n );\n }\n var RCON = [0, 1, 2, 4, 8, 16, 32, 64, 128, 27, 54],\n G = (function () {\n for (var d = new Array(256), j = 0; j < 256; j++) j < 128 ? (d[j] = j << 1) : (d[j] = (j << 1) ^ 283);\n for (\n var SBOX = [],\n INV_SBOX = [],\n SUB_MIX = [[], [], [], []],\n INV_SUB_MIX = [[], [], [], []],\n x = 0,\n xi = 0,\n i = 0;\n i < 256;\n ++i\n ) {\n var sx = xi ^ (xi << 1) ^ (xi << 2) ^ (xi << 3) ^ (xi << 4);\n (sx = (sx >>> 8) ^ (sx & 255) ^ 99), (SBOX[x] = sx), (INV_SBOX[sx] = x);\n var x2 = d[x],\n x4 = d[x2],\n x8 = d[x4],\n t = (d[sx] * 257) ^ (sx * 16843008);\n (SUB_MIX[0][x] = (t << 24) | (t >>> 8)),\n (SUB_MIX[1][x] = (t << 16) | (t >>> 16)),\n (SUB_MIX[2][x] = (t << 8) | (t >>> 24)),\n (SUB_MIX[3][x] = t),\n (t = (x8 * 16843009) ^ (x4 * 65537) ^ (x2 * 257) ^ (x * 16843008)),\n (INV_SUB_MIX[0][sx] = (t << 24) | (t >>> 8)),\n (INV_SUB_MIX[1][sx] = (t << 16) | (t >>> 16)),\n (INV_SUB_MIX[2][sx] = (t << 8) | (t >>> 24)),\n (INV_SUB_MIX[3][sx] = t),\n x === 0 ? (x = xi = 1) : ((x = x2 ^ d[d[d[x8 ^ x2]]]), (xi ^= d[d[xi]]));\n }\n return {\n SBOX,\n INV_SBOX,\n SUB_MIX,\n INV_SUB_MIX,\n };\n })();\n function AES(key) {\n (this._key = asUInt32Array(key)), this._reset();\n }\n AES.blockSize = 4 * 4;\n AES.keySize = 256 / 8;\n AES.prototype.blockSize = AES.blockSize;\n AES.prototype.keySize = AES.keySize;\n AES.prototype._reset = function () {\n for (\n var keyWords = this._key,\n keySize = keyWords.length,\n nRounds = keySize + 6,\n ksRows = (nRounds + 1) * 4,\n keySchedule = [],\n k = 0;\n k < keySize;\n k++\n )\n keySchedule[k] = keyWords[k];\n for (k = keySize; k < ksRows; k++) {\n var t = keySchedule[k - 1];\n k % keySize === 0\n ? ((t = (t << 8) | (t >>> 24)),\n (t =\n (G.SBOX[t >>> 24] << 24) |\n (G.SBOX[(t >>> 16) & 255] << 16) |\n (G.SBOX[(t >>> 8) & 255] << 8) |\n G.SBOX[t & 255]),\n (t ^= RCON[(k / keySize) | 0] << 24))\n : keySize > 6 &&\n k % keySize === 4 &&\n (t =\n (G.SBOX[t >>> 24] << 24) |\n (G.SBOX[(t >>> 16) & 255] << 16) |\n (G.SBOX[(t >>> 8) & 255] << 8) |\n G.SBOX[t & 255]),\n (keySchedule[k] = keySchedule[k - keySize] ^ t);\n }\n for (var invKeySchedule = [], ik = 0; ik < ksRows; ik++) {\n var ksR = ksRows - ik,\n tt = keySchedule[ksR - (ik % 4 ? 0 : 4)];\n ik < 4 || ksR <= 4\n ? (invKeySchedule[ik] = tt)\n : (invKeySchedule[ik] =\n G.INV_SUB_MIX[0][G.SBOX[tt >>> 24]] ^\n G.INV_SUB_MIX[1][G.SBOX[(tt >>> 16) & 255]] ^\n G.INV_SUB_MIX[2][G.SBOX[(tt >>> 8) & 255]] ^\n G.INV_SUB_MIX[3][G.SBOX[tt & 255]]);\n }\n (this._nRounds = nRounds), (this._keySchedule = keySchedule), (this._invKeySchedule = invKeySchedule);\n };\n AES.prototype.encryptBlockRaw = function (M) {\n return (M = asUInt32Array(M)), cryptBlock(M, this._keySchedule, G.SUB_MIX, G.SBOX, this._nRounds);\n };\n AES.prototype.encryptBlock = function (M) {\n var out = this.encryptBlockRaw(M),\n buf = Buffer2.allocUnsafe(16);\n return (\n buf.writeUInt32BE(out[0], 0),\n buf.writeUInt32BE(out[1], 4),\n buf.writeUInt32BE(out[2], 8),\n buf.writeUInt32BE(out[3], 12),\n buf\n );\n };\n AES.prototype.decryptBlock = function (M) {\n M = asUInt32Array(M);\n var m1 = M[1];\n (M[1] = M[3]), (M[3] = m1);\n var out = cryptBlock(M, this._invKeySchedule, G.INV_SUB_MIX, G.INV_SBOX, this._nRounds),\n buf = Buffer2.allocUnsafe(16);\n return (\n buf.writeUInt32BE(out[0], 0),\n buf.writeUInt32BE(out[3], 4),\n buf.writeUInt32BE(out[2], 8),\n buf.writeUInt32BE(out[1], 12),\n buf\n );\n };\n AES.prototype.scrub = function () {\n scrubVec(this._keySchedule), scrubVec(this._invKeySchedule), scrubVec(this._key);\n };\n module.exports.AES = AES;\n },\n});\n\n// node_modules/browserify-aes/ghash.js\nvar require_ghash = __commonJS({\n \"node_modules/browserify-aes/ghash.js\"(exports, module) {\n var Buffer2 = require_safe_buffer().Buffer,\n ZEROES = Buffer2.alloc(16, 0);\n function toArray(buf) {\n return [buf.readUInt32BE(0), buf.readUInt32BE(4), buf.readUInt32BE(8), buf.readUInt32BE(12)];\n }\n function fromArray(out) {\n var buf = Buffer2.allocUnsafe(16);\n return (\n buf.writeUInt32BE(out[0] >>> 0, 0),\n buf.writeUInt32BE(out[1] >>> 0, 4),\n buf.writeUInt32BE(out[2] >>> 0, 8),\n buf.writeUInt32BE(out[3] >>> 0, 12),\n buf\n );\n }\n function GHASH(key) {\n (this.h = key), (this.state = Buffer2.alloc(16, 0)), (this.cache = Buffer2.allocUnsafe(0));\n }\n GHASH.prototype.ghash = function (block) {\n for (var i = -1; ++i < block.length; ) this.state[i] ^= block[i];\n this._multiply();\n };\n GHASH.prototype._multiply = function () {\n for (var Vi = toArray(this.h), Zi = [0, 0, 0, 0], j, xi, lsbVi, i = -1; ++i < 128; ) {\n for (\n xi = (this.state[~~(i / 8)] & (1 << (7 - (i % 8)))) !== 0,\n xi && ((Zi[0] ^= Vi[0]), (Zi[1] ^= Vi[1]), (Zi[2] ^= Vi[2]), (Zi[3] ^= Vi[3])),\n lsbVi = (Vi[3] & 1) !== 0,\n j = 3;\n j > 0;\n j--\n )\n Vi[j] = (Vi[j] >>> 1) | ((Vi[j - 1] & 1) << 31);\n (Vi[0] = Vi[0] >>> 1), lsbVi && (Vi[0] = Vi[0] ^ (225 << 24));\n }\n this.state = fromArray(Zi);\n };\n GHASH.prototype.update = function (buf) {\n this.cache = Buffer2.concat([this.cache, buf]);\n for (var chunk; this.cache.length >= 16; )\n (chunk = this.cache.slice(0, 16)), (this.cache = this.cache.slice(16)), this.ghash(chunk);\n };\n GHASH.prototype.final = function (abl, bl) {\n return (\n this.cache.length && this.ghash(Buffer2.concat([this.cache, ZEROES], 16)),\n this.ghash(fromArray([0, abl, 0, bl])),\n this.state\n );\n };\n module.exports = GHASH;\n },\n});\n\n// node_modules/browserify-aes/authCipher.js\nvar require_authCipher = __commonJS({\n \"node_modules/browserify-aes/authCipher.js\"(exports, module) {\n var aes = require_aes(),\n Buffer2 = require_safe_buffer().Buffer,\n Transform = require_cipher_base(),\n inherits = require_inherits_browser(),\n GHASH = require_ghash(),\n xor = require_buffer_xor(),\n incr32 = require_incr32();\n function xorTest(a, b) {\n var out = 0;\n a.length !== b.length && out++;\n for (var len = Math.min(a.length, b.length), i = 0; i < len; ++i) out += a[i] ^ b[i];\n return out;\n }\n function calcIv(self2, iv, ck) {\n if (iv.length === 12)\n return (\n (self2._finID = Buffer2.concat([iv, Buffer2.from([0, 0, 0, 1])])),\n Buffer2.concat([iv, Buffer2.from([0, 0, 0, 2])])\n );\n var ghash = new GHASH(ck),\n len = iv.length,\n toPad = len % 16;\n ghash.update(iv),\n toPad && ((toPad = 16 - toPad), ghash.update(Buffer2.alloc(toPad, 0))),\n ghash.update(Buffer2.alloc(8, 0));\n var ivBits = len * 8,\n tail = Buffer2.alloc(8);\n tail.writeUIntBE(ivBits, 0, 8), ghash.update(tail), (self2._finID = ghash.state);\n var out = Buffer2.from(self2._finID);\n return incr32(out), out;\n }\n function StreamCipher(mode, key, iv, decrypt) {\n Transform.call(this);\n var h = Buffer2.alloc(4, 0);\n this._cipher = new aes.AES(key);\n var ck = this._cipher.encryptBlock(h);\n (this._ghash = new GHASH(ck)),\n (iv = calcIv(this, iv, ck)),\n (this._prev = Buffer2.from(iv)),\n (this._cache = Buffer2.allocUnsafe(0)),\n (this._secCache = Buffer2.allocUnsafe(0)),\n (this._decrypt = decrypt),\n (this._alen = 0),\n (this._len = 0),\n (this._mode = mode),\n (this._authTag = null),\n (this._called = !1);\n }\n inherits(StreamCipher, Transform);\n StreamCipher.prototype._update = function (chunk) {\n if (!this._called && this._alen) {\n var rump = 16 - (this._alen % 16);\n rump < 16 && ((rump = Buffer2.alloc(rump, 0)), this._ghash.update(rump));\n }\n this._called = !0;\n var out = this._mode.encrypt(this, chunk);\n return this._decrypt ? this._ghash.update(chunk) : this._ghash.update(out), (this._len += chunk.length), out;\n };\n StreamCipher.prototype._final = function () {\n if (this._decrypt && !this._authTag) throw new Error(\"Unsupported state or unable to authenticate data\");\n var tag = xor(this._ghash.final(this._alen * 8, this._len * 8), this._cipher.encryptBlock(this._finID));\n if (this._decrypt && xorTest(tag, this._authTag))\n throw new Error(\"Unsupported state or unable to authenticate data\");\n (this._authTag = tag), this._cipher.scrub();\n };\n StreamCipher.prototype.getAuthTag = function () {\n if (this._decrypt || !Buffer2.isBuffer(this._authTag))\n throw new Error(\"Attempting to get auth tag in unsupported state\");\n return this._authTag;\n };\n StreamCipher.prototype.setAuthTag = function (tag) {\n if (!this._decrypt) throw new Error(\"Attempting to set auth tag in unsupported state\");\n this._authTag = tag;\n };\n StreamCipher.prototype.setAAD = function (buf) {\n if (this._called) throw new Error(\"Attempting to set AAD in unsupported state\");\n this._ghash.update(buf), (this._alen += buf.length);\n };\n module.exports = StreamCipher;\n },\n});\n\n// node_modules/browserify-aes/streamCipher.js\nvar require_streamCipher = __commonJS({\n \"node_modules/browserify-aes/streamCipher.js\"(exports, module) {\n var aes = require_aes(),\n Buffer2 = require_safe_buffer().Buffer,\n Transform = require_cipher_base(),\n inherits = require_inherits_browser();\n function StreamCipher(mode, key, iv, decrypt) {\n Transform.call(this),\n (this._cipher = new aes.AES(key)),\n (this._prev = Buffer2.from(iv)),\n (this._cache = Buffer2.allocUnsafe(0)),\n (this._secCache = Buffer2.allocUnsafe(0)),\n (this._decrypt = decrypt),\n (this._mode = mode);\n }\n inherits(StreamCipher, Transform);\n StreamCipher.prototype._update = function (chunk) {\n return this._mode.encrypt(this, chunk, this._decrypt);\n };\n StreamCipher.prototype._final = function () {\n this._cipher.scrub();\n };\n module.exports = StreamCipher;\n },\n});\n\n// node_modules/evp_bytestokey/index.js\nvar require_evp_bytestokey = __commonJS({\n \"node_modules/evp_bytestokey/index.js\"(exports, module) {\n var Buffer2 = require_safe_buffer().Buffer,\n MD5 = require_md5();\n function EVP_BytesToKey(password, salt, keyBits, ivLen) {\n if (\n (Buffer2.isBuffer(password) || (password = Buffer2.from(password, \"binary\")),\n salt && (Buffer2.isBuffer(salt) || (salt = Buffer2.from(salt, \"binary\")), salt.length !== 8))\n )\n throw new RangeError(\"salt should be Buffer with 8 byte length\");\n for (\n var keyLen = keyBits / 8, key = Buffer2.alloc(keyLen), iv = Buffer2.alloc(ivLen || 0), tmp = Buffer2.alloc(0);\n keyLen > 0 || ivLen > 0;\n\n ) {\n var hash = new MD5();\n hash.update(tmp), hash.update(password), salt && hash.update(salt), (tmp = hash.digest());\n var used = 0;\n if (keyLen > 0) {\n var keyStart = key.length - keyLen;\n (used = Math.min(keyLen, tmp.length)), tmp.copy(key, keyStart, 0, used), (keyLen -= used);\n }\n if (used < tmp.length && ivLen > 0) {\n var ivStart = iv.length - ivLen,\n length = Math.min(ivLen, tmp.length - used);\n tmp.copy(iv, ivStart, used, used + length), (ivLen -= length);\n }\n }\n return tmp.fill(0), { key, iv };\n }\n module.exports = EVP_BytesToKey;\n },\n});\n\n// node_modules/browserify-aes/encrypter.js\nvar require_encrypter = __commonJS({\n \"node_modules/browserify-aes/encrypter.js\"(exports) {\n var MODES = require_modes(),\n AuthCipher = require_authCipher(),\n Buffer2 = require_safe_buffer().Buffer,\n StreamCipher = require_streamCipher(),\n Transform = require_cipher_base(),\n aes = require_aes(),\n ebtk = require_evp_bytestokey(),\n inherits = require_inherits_browser();\n function Cipher(mode, key, iv) {\n Transform.call(this),\n (this._cache = new Splitter()),\n (this._cipher = new aes.AES(key)),\n (this._prev = Buffer2.from(iv)),\n (this._mode = mode),\n (this._autopadding = !0);\n }\n inherits(Cipher, Transform);\n Cipher.prototype._update = function (data) {\n this._cache.add(data);\n for (var chunk, thing, out = []; (chunk = this._cache.get()); )\n (thing = this._mode.encrypt(this, chunk)), out.push(thing);\n return Buffer2.concat(out);\n };\n var PADDING = Buffer2.alloc(16, 16);\n Cipher.prototype._final = function () {\n var chunk = this._cache.flush();\n if (this._autopadding) return (chunk = this._mode.encrypt(this, chunk)), this._cipher.scrub(), chunk;\n if (!chunk.equals(PADDING)) throw (this._cipher.scrub(), new Error(\"data not multiple of block length\"));\n };\n Cipher.prototype.setAutoPadding = function (setTo) {\n return (this._autopadding = !!setTo), this;\n };\n function Splitter() {\n this.cache = Buffer2.allocUnsafe(0);\n }\n Splitter.prototype.add = function (data) {\n this.cache = Buffer2.concat([this.cache, data]);\n };\n Splitter.prototype.get = function () {\n if (this.cache.length > 15) {\n var out = this.cache.slice(0, 16);\n return (this.cache = this.cache.slice(16)), out;\n }\n return null;\n };\n Splitter.prototype.flush = function () {\n for (var len = 16 - this.cache.length, padBuff = Buffer2.allocUnsafe(len), i = -1; ++i < len; )\n padBuff.writeUInt8(len, i);\n return Buffer2.concat([this.cache, padBuff]);\n };\n function createCipheriv(suite, password, iv) {\n var config = MODES[suite.toLowerCase()];\n if (!config) throw new TypeError(\"invalid suite type\");\n if ((typeof password == \"string\" && (password = Buffer2.from(password)), password.length !== config.key / 8))\n throw new TypeError(\"invalid key length \" + password.length);\n if ((typeof iv == \"string\" && (iv = Buffer2.from(iv)), config.mode !== \"GCM\" && iv.length !== config.iv))\n throw new TypeError(\"invalid iv length \" + iv.length);\n return config.type === \"stream\"\n ? new StreamCipher(config.module, password, iv)\n : config.type === \"auth\"\n ? new AuthCipher(config.module, password, iv)\n : new Cipher(config.module, password, iv);\n }\n function createCipher(suite, password) {\n var config = MODES[suite.toLowerCase()];\n if (!config) throw new TypeError(\"invalid suite type\");\n var keys = ebtk(password, !1, config.key, config.iv);\n return createCipheriv(suite, keys.key, keys.iv);\n }\n exports.createCipheriv = createCipheriv;\n exports.createCipher = createCipher;\n },\n});\n\n// node_modules/browserify-aes/decrypter.js\nvar require_decrypter = __commonJS({\n \"node_modules/browserify-aes/decrypter.js\"(exports) {\n var AuthCipher = require_authCipher(),\n Buffer2 = require_safe_buffer().Buffer,\n MODES = require_modes(),\n StreamCipher = require_streamCipher(),\n Transform = require_cipher_base(),\n aes = require_aes(),\n ebtk = require_evp_bytestokey(),\n inherits = require_inherits_browser();\n function Decipher(mode, key, iv) {\n Transform.call(this),\n (this._cache = new Splitter()),\n (this._last = void 0),\n (this._cipher = new aes.AES(key)),\n (this._prev = Buffer2.from(iv)),\n (this._mode = mode),\n (this._autopadding = !0);\n }\n inherits(Decipher, Transform);\n Decipher.prototype._update = function (data) {\n this._cache.add(data);\n for (var chunk, thing, out = []; (chunk = this._cache.get(this._autopadding)); )\n (thing = this._mode.decrypt(this, chunk)), out.push(thing);\n return Buffer2.concat(out);\n };\n Decipher.prototype._final = function () {\n var chunk = this._cache.flush();\n if (this._autopadding) return unpad(this._mode.decrypt(this, chunk));\n if (chunk) throw new Error(\"data not multiple of block length\");\n };\n Decipher.prototype.setAutoPadding = function (setTo) {\n return (this._autopadding = !!setTo), this;\n };\n function Splitter() {\n this.cache = Buffer2.allocUnsafe(0);\n }\n Splitter.prototype.add = function (data) {\n this.cache = Buffer2.concat([this.cache, data]);\n };\n Splitter.prototype.get = function (autoPadding) {\n var out;\n if (autoPadding) {\n if (this.cache.length > 16) return (out = this.cache.slice(0, 16)), (this.cache = this.cache.slice(16)), out;\n } else if (this.cache.length >= 16)\n return (out = this.cache.slice(0, 16)), (this.cache = this.cache.slice(16)), out;\n return null;\n };\n Splitter.prototype.flush = function () {\n if (this.cache.length) return this.cache;\n };\n function unpad(last) {\n var padded = last[15];\n if (padded < 1 || padded > 16) throw new Error(\"unable to decrypt data\");\n for (var i = -1; ++i < padded; )\n if (last[i + (16 - padded)] !== padded) throw new Error(\"unable to decrypt data\");\n if (padded !== 16) return last.slice(0, 16 - padded);\n }\n function createDecipheriv(suite, password, iv) {\n var config = MODES[suite.toLowerCase()];\n if (!config) throw new TypeError(\"invalid suite type\");\n if ((typeof iv == \"string\" && (iv = Buffer2.from(iv)), config.mode !== \"GCM\" && iv.length !== config.iv))\n throw new TypeError(\"invalid iv length \" + iv.length);\n if ((typeof password == \"string\" && (password = Buffer2.from(password)), password.length !== config.key / 8))\n throw new TypeError(\"invalid key length \" + password.length);\n return config.type === \"stream\"\n ? new StreamCipher(config.module, password, iv, !0)\n : config.type === \"auth\"\n ? new AuthCipher(config.module, password, iv, !0)\n : new Decipher(config.module, password, iv);\n }\n function createDecipher(suite, password) {\n var config = MODES[suite.toLowerCase()];\n if (!config) throw new TypeError(\"invalid suite type\");\n var keys = ebtk(password, !1, config.key, config.iv);\n return createDecipheriv(suite, keys.key, keys.iv);\n }\n exports.createDecipher = createDecipher;\n exports.createDecipheriv = createDecipheriv;\n },\n});\n\n// node_modules/browserify-aes/browser.js\nvar require_browser5 = __commonJS({\n \"node_modules/browserify-aes/browser.js\"(exports) {\n var ciphers = require_encrypter(),\n deciphers = require_decrypter(),\n modes = require_list();\n function getCiphers() {\n return Object.keys(modes);\n }\n exports.createCipher = exports.Cipher = ciphers.createCipher;\n exports.createCipheriv = exports.Cipheriv = ciphers.createCipheriv;\n exports.createDecipher = exports.Decipher = deciphers.createDecipher;\n exports.createDecipheriv = exports.Decipheriv = deciphers.createDecipheriv;\n exports.listCiphers = exports.getCiphers = getCiphers;\n },\n});\n\n// node_modules/browserify-des/modes.js\nvar require_modes2 = __commonJS({\n \"node_modules/browserify-des/modes.js\"(exports) {\n exports[\"des-ecb\"] = {\n key: 8,\n iv: 0,\n };\n exports[\"des-cbc\"] = exports.des = {\n key: 8,\n iv: 8,\n };\n exports[\"des-ede3-cbc\"] = exports.des3 = {\n key: 24,\n iv: 8,\n };\n exports[\"des-ede3\"] = {\n key: 24,\n iv: 0,\n };\n exports[\"des-ede-cbc\"] = {\n key: 16,\n iv: 8,\n };\n exports[\"des-ede\"] = {\n key: 16,\n iv: 0,\n };\n },\n});\n\n// node_modules/browserify-cipher/browser.js\nvar require_browser6 = __commonJS({\n \"node_modules/browserify-cipher/browser.js\"(exports) {\n var DES = require_browserify_des(),\n aes = require_browser5(),\n aesModes = require_modes(),\n desModes = require_modes2(),\n ebtk = require_evp_bytestokey();\n function createCipher(suite, password) {\n suite = suite.toLowerCase();\n var keyLen, ivLen;\n if (aesModes[suite]) (keyLen = aesModes[suite].key), (ivLen = aesModes[suite].iv);\n else if (desModes[suite]) (keyLen = desModes[suite].key * 8), (ivLen = desModes[suite].iv);\n else throw new TypeError(\"invalid suite type\");\n var keys = ebtk(password, !1, keyLen, ivLen);\n return createCipheriv(suite, keys.key, keys.iv);\n }\n function createDecipher(suite, password) {\n suite = suite.toLowerCase();\n var keyLen, ivLen;\n if (aesModes[suite]) (keyLen = aesModes[suite].key), (ivLen = aesModes[suite].iv);\n else if (desModes[suite]) (keyLen = desModes[suite].key * 8), (ivLen = desModes[suite].iv);\n else throw new TypeError(\"invalid suite type\");\n var keys = ebtk(password, !1, keyLen, ivLen);\n return createDecipheriv(suite, keys.key, keys.iv);\n }\n function createCipheriv(suite, key, iv) {\n if (((suite = suite.toLowerCase()), aesModes[suite])) return aes.createCipheriv(suite, key, iv);\n if (desModes[suite]) return new DES({ key, iv, mode: suite });\n throw new TypeError(\"invalid suite type\");\n }\n function createDecipheriv(suite, key, iv) {\n if (((suite = suite.toLowerCase()), aesModes[suite])) return aes.createDecipheriv(suite, key, iv);\n if (desModes[suite]) return new DES({ key, iv, mode: suite, decrypt: !0 });\n throw new TypeError(\"invalid suite type\");\n }\n function getCiphers() {\n return Object.keys(desModes).concat(aes.getCiphers());\n }\n exports.createCipher = exports.Cipher = createCipher;\n exports.createCipheriv = exports.Cipheriv = createCipheriv;\n exports.createDecipher = exports.Decipher = createDecipher;\n exports.createDecipheriv = exports.Decipheriv = createDecipheriv;\n exports.listCiphers = exports.getCiphers = getCiphers;\n },\n});\n\n// node_modules/diffie-hellman/node_modules/bn.js/lib/bn.js\nvar require_bn = __commonJS({\n \"node_modules/diffie-hellman/node_modules/bn.js/lib/bn.js\"(exports, module) {\n (function (module2, exports2) {\n \"use strict\";\n function assert(val, msg) {\n if (!val) throw new Error(msg || \"Assertion failed\");\n }\n function inherits(ctor, superCtor) {\n ctor.super_ = superCtor;\n var TempCtor = function () {};\n (TempCtor.prototype = superCtor.prototype),\n (ctor.prototype = new TempCtor()),\n (ctor.prototype.constructor = ctor);\n }\n function BN(number, base, endian) {\n if (BN.isBN(number)) return number;\n (this.negative = 0),\n (this.words = null),\n (this.length = 0),\n (this.red = null),\n number !== null &&\n ((base === \"le\" || base === \"be\") && ((endian = base), (base = 10)),\n this._init(number || 0, base || 10, endian || \"be\"));\n }\n typeof module2 == \"object\" ? (module2.exports = BN) : (exports2.BN = BN), (BN.BN = BN), (BN.wordSize = 26);\n var Buffer2;\n try {\n typeof window < \"u\" && typeof window.Buffer < \"u\"\n ? (Buffer2 = window.Buffer)\n : (Buffer2 = __require(\"buffer\").Buffer);\n } catch {}\n (BN.isBN = function (num) {\n return num instanceof BN\n ? !0\n : num !== null &&\n typeof num == \"object\" &&\n num.constructor.wordSize === BN.wordSize &&\n Array.isArray(num.words);\n }),\n (BN.max = function (left, right) {\n return left.cmp(right) > 0 ? left : right;\n }),\n (BN.min = function (left, right) {\n return left.cmp(right) < 0 ? left : right;\n }),\n (BN.prototype._init = function (number, base, endian) {\n if (typeof number == \"number\") return this._initNumber(number, base, endian);\n if (typeof number == \"object\") return this._initArray(number, base, endian);\n base === \"hex\" && (base = 16),\n assert(base === (base | 0) && base >= 2 && base <= 36),\n (number = number.toString().replace(/\\s+/g, \"\"));\n var start = 0;\n number[0] === \"-\" && (start++, (this.negative = 1)),\n start < number.length &&\n (base === 16\n ? this._parseHex(number, start, endian)\n : (this._parseBase(number, base, start),\n endian === \"le\" && this._initArray(this.toArray(), base, endian)));\n }),\n (BN.prototype._initNumber = function (number, base, endian) {\n number < 0 && ((this.negative = 1), (number = -number)),\n number < 67108864\n ? ((this.words = [number & 67108863]), (this.length = 1))\n : number < 4503599627370496\n ? ((this.words = [number & 67108863, (number / 67108864) & 67108863]), (this.length = 2))\n : (assert(number < 9007199254740992),\n (this.words = [number & 67108863, (number / 67108864) & 67108863, 1]),\n (this.length = 3)),\n endian === \"le\" && this._initArray(this.toArray(), base, endian);\n }),\n (BN.prototype._initArray = function (number, base, endian) {\n if ((assert(typeof number.length == \"number\"), number.length <= 0))\n return (this.words = [0]), (this.length = 1), this;\n (this.length = Math.ceil(number.length / 3)), (this.words = new Array(this.length));\n for (var i = 0; i < this.length; i++) this.words[i] = 0;\n var j,\n w,\n off = 0;\n if (endian === \"be\")\n for (i = number.length - 1, j = 0; i >= 0; i -= 3)\n (w = number[i] | (number[i - 1] << 8) | (number[i - 2] << 16)),\n (this.words[j] |= (w << off) & 67108863),\n (this.words[j + 1] = (w >>> (26 - off)) & 67108863),\n (off += 24),\n off >= 26 && ((off -= 26), j++);\n else if (endian === \"le\")\n for (i = 0, j = 0; i < number.length; i += 3)\n (w = number[i] | (number[i + 1] << 8) | (number[i + 2] << 16)),\n (this.words[j] |= (w << off) & 67108863),\n (this.words[j + 1] = (w >>> (26 - off)) & 67108863),\n (off += 24),\n off >= 26 && ((off -= 26), j++);\n return this.strip();\n });\n function parseHex4Bits(string, index) {\n var c = string.charCodeAt(index);\n return c >= 65 && c <= 70 ? c - 55 : c >= 97 && c <= 102 ? c - 87 : (c - 48) & 15;\n }\n function parseHexByte(string, lowerBound, index) {\n var r = parseHex4Bits(string, index);\n return index - 1 >= lowerBound && (r |= parseHex4Bits(string, index - 1) << 4), r;\n }\n BN.prototype._parseHex = function (number, start, endian) {\n (this.length = Math.ceil((number.length - start) / 6)), (this.words = new Array(this.length));\n for (var i = 0; i < this.length; i++) this.words[i] = 0;\n var off = 0,\n j = 0,\n w;\n if (endian === \"be\")\n for (i = number.length - 1; i >= start; i -= 2)\n (w = parseHexByte(number, start, i) << off),\n (this.words[j] |= w & 67108863),\n off >= 18 ? ((off -= 18), (j += 1), (this.words[j] |= w >>> 26)) : (off += 8);\n else {\n var parseLength = number.length - start;\n for (i = parseLength % 2 === 0 ? start + 1 : start; i < number.length; i += 2)\n (w = parseHexByte(number, start, i) << off),\n (this.words[j] |= w & 67108863),\n off >= 18 ? ((off -= 18), (j += 1), (this.words[j] |= w >>> 26)) : (off += 8);\n }\n this.strip();\n };\n function parseBase(str, start, end, mul) {\n for (var r = 0, len = Math.min(str.length, end), i = start; i < len; i++) {\n var c = str.charCodeAt(i) - 48;\n (r *= mul), c >= 49 ? (r += c - 49 + 10) : c >= 17 ? (r += c - 17 + 10) : (r += c);\n }\n return r;\n }\n (BN.prototype._parseBase = function (number, base, start) {\n (this.words = [0]), (this.length = 1);\n for (var limbLen = 0, limbPow = 1; limbPow <= 67108863; limbPow *= base) limbLen++;\n limbLen--, (limbPow = (limbPow / base) | 0);\n for (\n var total = number.length - start,\n mod = total % limbLen,\n end = Math.min(total, total - mod) + start,\n word = 0,\n i = start;\n i < end;\n i += limbLen\n )\n (word = parseBase(number, i, i + limbLen, base)),\n this.imuln(limbPow),\n this.words[0] + word < 67108864 ? (this.words[0] += word) : this._iaddn(word);\n if (mod !== 0) {\n var pow = 1;\n for (word = parseBase(number, i, number.length, base), i = 0; i < mod; i++) pow *= base;\n this.imuln(pow), this.words[0] + word < 67108864 ? (this.words[0] += word) : this._iaddn(word);\n }\n this.strip();\n }),\n (BN.prototype.copy = function (dest) {\n dest.words = new Array(this.length);\n for (var i = 0; i < this.length; i++) dest.words[i] = this.words[i];\n (dest.length = this.length), (dest.negative = this.negative), (dest.red = this.red);\n }),\n (BN.prototype.clone = function () {\n var r = new BN(null);\n return this.copy(r), r;\n }),\n (BN.prototype._expand = function (size) {\n for (; this.length < size; ) this.words[this.length++] = 0;\n return this;\n }),\n (BN.prototype.strip = function () {\n for (; this.length > 1 && this.words[this.length - 1] === 0; ) this.length--;\n return this._normSign();\n }),\n (BN.prototype._normSign = function () {\n return this.length === 1 && this.words[0] === 0 && (this.negative = 0), this;\n }),\n (BN.prototype.inspect = function () {\n return (this.red ? \"<BN-R: \" : \"<BN: \") + this.toString(16) + \">\";\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 groupSizes = [\n 0, 0, 25, 16, 12, 11, 10, 9, 8, 8, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5,\n 5, 5,\n ],\n groupBases = [\n 0, 0, 33554432, 43046721, 16777216, 48828125, 60466176, 40353607, 16777216, 43046721, 1e7, 19487171, 35831808,\n 62748517, 7529536, 11390625, 16777216, 24137569, 34012224, 47045881, 64e6, 4084101, 5153632, 6436343, 7962624,\n 9765625, 11881376, 14348907, 17210368, 20511149, 243e5, 28629151, 33554432, 39135393, 45435424, 52521875,\n 60466176,\n ];\n (BN.prototype.toString = function (base, padding) {\n (base = base || 10), (padding = padding | 0 || 1);\n var out;\n if (base === 16 || base === \"hex\") {\n out = \"\";\n for (var off = 0, carry = 0, i = 0; i < this.length; i++) {\n var w = this.words[i],\n word = (((w << off) | carry) & 16777215).toString(16);\n (carry = (w >>> (24 - off)) & 16777215),\n carry !== 0 || i !== this.length - 1 ? (out = zeros[6 - word.length] + word + out) : (out = word + out),\n (off += 2),\n off >= 26 && ((off -= 26), i--);\n }\n for (carry !== 0 && (out = carry.toString(16) + out); out.length % padding !== 0; ) out = \"0\" + out;\n return this.negative !== 0 && (out = \"-\" + out), out;\n }\n if (base === (base | 0) && base >= 2 && base <= 36) {\n var groupSize = groupSizes[base],\n groupBase = groupBases[base];\n out = \"\";\n var c = this.clone();\n for (c.negative = 0; !c.isZero(); ) {\n var r = c.modn(groupBase).toString(base);\n (c = c.idivn(groupBase)), c.isZero() ? (out = r + out) : (out = zeros[groupSize - r.length] + r + out);\n }\n for (this.isZero() && (out = \"0\" + out); out.length % padding !== 0; ) out = \"0\" + out;\n return this.negative !== 0 && (out = \"-\" + out), out;\n }\n assert(!1, \"Base should be between 2 and 36\");\n }),\n (BN.prototype.toNumber = function () {\n var ret = this.words[0];\n return (\n this.length === 2\n ? (ret += this.words[1] * 67108864)\n : this.length === 3 && this.words[2] === 1\n ? (ret += 4503599627370496 + this.words[1] * 67108864)\n : this.length > 2 && assert(!1, \"Number can only safely store up to 53 bits\"),\n this.negative !== 0 ? -ret : ret\n );\n }),\n (BN.prototype.toJSON = function () {\n return this.toString(16);\n }),\n (BN.prototype.toBuffer = function (endian, length) {\n return assert(typeof Buffer2 < \"u\"), this.toArrayLike(Buffer2, endian, length);\n }),\n (BN.prototype.toArray = function (endian, length) {\n return this.toArrayLike(Array, endian, length);\n }),\n (BN.prototype.toArrayLike = function (ArrayType, endian, length) {\n var byteLength = this.byteLength(),\n 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 this.strip();\n var littleEndian = endian === \"le\",\n res = new ArrayType(reqLength),\n b,\n i,\n q = this.clone();\n if (littleEndian) {\n for (i = 0; !q.isZero(); i++) (b = q.andln(255)), q.iushrn(8), (res[i] = b);\n for (; i < reqLength; i++) res[i] = 0;\n } else {\n for (i = 0; i < reqLength - byteLength; i++) res[i] = 0;\n for (i = 0; !q.isZero(); i++) (b = q.andln(255)), q.iushrn(8), (res[reqLength - i - 1] = b);\n }\n return res;\n }),\n Math.clz32\n ? (BN.prototype._countBits = function (w) {\n return 32 - Math.clz32(w);\n })\n : (BN.prototype._countBits = function (w) {\n var t = w,\n r = 0;\n return (\n t >= 4096 && ((r += 13), (t >>>= 13)),\n t >= 64 && ((r += 7), (t >>>= 7)),\n t >= 8 && ((r += 4), (t >>>= 4)),\n t >= 2 && ((r += 2), (t >>>= 2)),\n r + t\n );\n }),\n (BN.prototype._zeroBits = function (w) {\n if (w === 0) return 26;\n var t = w,\n r = 0;\n return (\n (t & 8191) === 0 && ((r += 13), (t >>>= 13)),\n (t & 127) === 0 && ((r += 7), (t >>>= 7)),\n (t & 15) === 0 && ((r += 4), (t >>>= 4)),\n (t & 3) === 0 && ((r += 2), (t >>>= 2)),\n (t & 1) === 0 && r++,\n r\n );\n }),\n (BN.prototype.bitLength = function () {\n var w = this.words[this.length - 1],\n hi = this._countBits(w);\n return (this.length - 1) * 26 + hi;\n });\n function toBitArray(num) {\n for (var w = new Array(num.bitLength()), bit = 0; bit < w.length; bit++) {\n var off = (bit / 26) | 0,\n wbit = bit % 26;\n w[bit] = (num.words[off] & (1 << wbit)) >>> wbit;\n }\n return w;\n }\n (BN.prototype.zeroBits = function () {\n if (this.isZero()) return 0;\n for (var r = 0, i = 0; i < this.length; i++) {\n var b = this._zeroBits(this.words[i]);\n if (((r += b), b !== 26)) break;\n }\n return r;\n }),\n (BN.prototype.byteLength = function () {\n return Math.ceil(this.bitLength() / 8);\n }),\n (BN.prototype.toTwos = function (width) {\n return this.negative !== 0 ? this.abs().inotn(width).iaddn(1) : this.clone();\n }),\n (BN.prototype.fromTwos = function (width) {\n return this.testn(width - 1) ? this.notn(width).iaddn(1).ineg() : this.clone();\n }),\n (BN.prototype.isNeg = function () {\n return this.negative !== 0;\n }),\n (BN.prototype.neg = function () {\n return this.clone().ineg();\n }),\n (BN.prototype.ineg = function () {\n return this.isZero() || (this.negative ^= 1), this;\n }),\n (BN.prototype.iuor = function (num) {\n for (; this.length < num.length; ) this.words[this.length++] = 0;\n for (var i = 0; i < num.length; i++) this.words[i] = this.words[i] | num.words[i];\n return this.strip();\n }),\n (BN.prototype.ior = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuor(num);\n }),\n (BN.prototype.or = function (num) {\n return this.length > num.length ? this.clone().ior(num) : num.clone().ior(this);\n }),\n (BN.prototype.uor = function (num) {\n return this.length > num.length ? this.clone().iuor(num) : num.clone().iuor(this);\n }),\n (BN.prototype.iuand = function (num) {\n var b;\n this.length > num.length ? (b = num) : (b = this);\n for (var i = 0; i < b.length; i++) this.words[i] = this.words[i] & num.words[i];\n return (this.length = b.length), this.strip();\n }),\n (BN.prototype.iand = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuand(num);\n }),\n (BN.prototype.and = function (num) {\n return this.length > num.length ? this.clone().iand(num) : num.clone().iand(this);\n }),\n (BN.prototype.uand = function (num) {\n return this.length > num.length ? this.clone().iuand(num) : num.clone().iuand(this);\n }),\n (BN.prototype.iuxor = function (num) {\n var a, b;\n this.length > num.length ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var i = 0; i < b.length; i++) this.words[i] = a.words[i] ^ b.words[i];\n if (this !== a) for (; i < a.length; i++) this.words[i] = a.words[i];\n return (this.length = a.length), this.strip();\n }),\n (BN.prototype.ixor = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuxor(num);\n }),\n (BN.prototype.xor = function (num) {\n return this.length > num.length ? this.clone().ixor(num) : num.clone().ixor(this);\n }),\n (BN.prototype.uxor = function (num) {\n return this.length > num.length ? this.clone().iuxor(num) : num.clone().iuxor(this);\n }),\n (BN.prototype.inotn = function (width) {\n assert(typeof width == \"number\" && width >= 0);\n var bytesNeeded = Math.ceil(width / 26) | 0,\n bitsLeft = width % 26;\n this._expand(bytesNeeded), bitsLeft > 0 && bytesNeeded--;\n for (var i = 0; i < bytesNeeded; i++) this.words[i] = ~this.words[i] & 67108863;\n return bitsLeft > 0 && (this.words[i] = ~this.words[i] & (67108863 >> (26 - bitsLeft))), this.strip();\n }),\n (BN.prototype.notn = function (width) {\n return this.clone().inotn(width);\n }),\n (BN.prototype.setn = function (bit, val) {\n assert(typeof bit == \"number\" && bit >= 0);\n var off = (bit / 26) | 0,\n wbit = bit % 26;\n return (\n this._expand(off + 1),\n val\n ? (this.words[off] = this.words[off] | (1 << wbit))\n : (this.words[off] = this.words[off] & ~(1 << wbit)),\n this.strip()\n );\n }),\n (BN.prototype.iadd = function (num) {\n var r;\n if (this.negative !== 0 && num.negative === 0)\n return (this.negative = 0), (r = this.isub(num)), (this.negative ^= 1), this._normSign();\n if (this.negative === 0 && num.negative !== 0)\n return (num.negative = 0), (r = this.isub(num)), (num.negative = 1), r._normSign();\n var a, b;\n this.length > num.length ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var carry = 0, i = 0; i < b.length; i++)\n (r = (a.words[i] | 0) + (b.words[i] | 0) + carry), (this.words[i] = r & 67108863), (carry = r >>> 26);\n for (; carry !== 0 && i < a.length; i++)\n (r = (a.words[i] | 0) + carry), (this.words[i] = r & 67108863), (carry = r >>> 26);\n if (((this.length = a.length), carry !== 0)) (this.words[this.length] = carry), this.length++;\n else if (a !== this) for (; i < a.length; i++) this.words[i] = a.words[i];\n return this;\n }),\n (BN.prototype.add = function (num) {\n var res;\n return num.negative !== 0 && this.negative === 0\n ? ((num.negative = 0), (res = this.sub(num)), (num.negative ^= 1), res)\n : num.negative === 0 && this.negative !== 0\n ? ((this.negative = 0), (res = num.sub(this)), (this.negative = 1), res)\n : this.length > num.length\n ? this.clone().iadd(num)\n : num.clone().iadd(this);\n }),\n (BN.prototype.isub = function (num) {\n if (num.negative !== 0) {\n num.negative = 0;\n var r = this.iadd(num);\n return (num.negative = 1), r._normSign();\n } else if (this.negative !== 0)\n return (this.negative = 0), this.iadd(num), (this.negative = 1), this._normSign();\n var cmp = this.cmp(num);\n if (cmp === 0) return (this.negative = 0), (this.length = 1), (this.words[0] = 0), this;\n var a, b;\n cmp > 0 ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var carry = 0, i = 0; i < b.length; i++)\n (r = (a.words[i] | 0) - (b.words[i] | 0) + carry), (carry = r >> 26), (this.words[i] = r & 67108863);\n for (; carry !== 0 && i < a.length; i++)\n (r = (a.words[i] | 0) + carry), (carry = r >> 26), (this.words[i] = r & 67108863);\n if (carry === 0 && i < a.length && a !== this) for (; i < a.length; i++) this.words[i] = a.words[i];\n return (this.length = Math.max(this.length, i)), a !== this && (this.negative = 1), this.strip();\n }),\n (BN.prototype.sub = function (num) {\n return this.clone().isub(num);\n });\n function smallMulTo(self2, num, out) {\n out.negative = num.negative ^ self2.negative;\n var len = (self2.length + num.length) | 0;\n (out.length = len), (len = (len - 1) | 0);\n var a = self2.words[0] | 0,\n b = num.words[0] | 0,\n r = a * b,\n lo = r & 67108863,\n carry = (r / 67108864) | 0;\n out.words[0] = lo;\n for (var k = 1; k < len; k++) {\n for (\n var ncarry = carry >>> 26,\n rword = carry & 67108863,\n maxJ = Math.min(k, num.length - 1),\n j = Math.max(0, k - self2.length + 1);\n j <= maxJ;\n j++\n ) {\n var i = (k - j) | 0;\n (a = self2.words[i] | 0),\n (b = num.words[j] | 0),\n (r = a * b + rword),\n (ncarry += (r / 67108864) | 0),\n (rword = r & 67108863);\n }\n (out.words[k] = rword | 0), (carry = ncarry | 0);\n }\n return carry !== 0 ? (out.words[k] = carry | 0) : out.length--, out.strip();\n }\n var comb10MulTo = function (self2, num, out) {\n var a = self2.words,\n b = num.words,\n o = out.words,\n c = 0,\n lo,\n mid,\n hi,\n a0 = a[0] | 0,\n al0 = a0 & 8191,\n ah0 = a0 >>> 13,\n a1 = a[1] | 0,\n al1 = a1 & 8191,\n ah1 = a1 >>> 13,\n a2 = a[2] | 0,\n al2 = a2 & 8191,\n ah2 = a2 >>> 13,\n a3 = a[3] | 0,\n al3 = a3 & 8191,\n ah3 = a3 >>> 13,\n a4 = a[4] | 0,\n al4 = a4 & 8191,\n ah4 = a4 >>> 13,\n a5 = a[5] | 0,\n al5 = a5 & 8191,\n ah5 = a5 >>> 13,\n a6 = a[6] | 0,\n al6 = a6 & 8191,\n ah6 = a6 >>> 13,\n a7 = a[7] | 0,\n al7 = a7 & 8191,\n ah7 = a7 >>> 13,\n a8 = a[8] | 0,\n al8 = a8 & 8191,\n ah8 = a8 >>> 13,\n a9 = a[9] | 0,\n al9 = a9 & 8191,\n ah9 = a9 >>> 13,\n b0 = b[0] | 0,\n bl0 = b0 & 8191,\n bh0 = b0 >>> 13,\n b1 = b[1] | 0,\n bl1 = b1 & 8191,\n bh1 = b1 >>> 13,\n b2 = b[2] | 0,\n bl2 = b2 & 8191,\n bh2 = b2 >>> 13,\n b3 = b[3] | 0,\n bl3 = b3 & 8191,\n bh3 = b3 >>> 13,\n b4 = b[4] | 0,\n bl4 = b4 & 8191,\n bh4 = b4 >>> 13,\n b5 = b[5] | 0,\n bl5 = b5 & 8191,\n bh5 = b5 >>> 13,\n b6 = b[6] | 0,\n bl6 = b6 & 8191,\n bh6 = b6 >>> 13,\n b7 = b[7] | 0,\n bl7 = b7 & 8191,\n bh7 = b7 >>> 13,\n b8 = b[8] | 0,\n bl8 = b8 & 8191,\n bh8 = b8 >>> 13,\n b9 = b[9] | 0,\n bl9 = b9 & 8191,\n bh9 = b9 >>> 13;\n (out.negative = self2.negative ^ num.negative),\n (out.length = 19),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w0 >>> 26)) | 0),\n (w0 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w1 >>> 26)) | 0),\n (w1 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w2 >>> 26)) | 0),\n (w2 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w3 >>> 26)) | 0),\n (w3 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w4 >>> 26)) | 0),\n (w4 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w5 >>> 26)) | 0),\n (w5 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w6 >>> 26)) | 0),\n (w6 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w7 >>> 26)) | 0),\n (w7 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w8 >>> 26)) | 0),\n (w8 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w9 >>> 26)) | 0),\n (w9 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w10 >>> 26)) | 0),\n (w10 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w11 >>> 26)) | 0),\n (w11 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w12 >>> 26)) | 0),\n (w12 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w13 >>> 26)) | 0),\n (w13 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w14 >>> 26)) | 0),\n (w14 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w15 >>> 26)) | 0),\n (w15 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w16 >>> 26)) | 0),\n (w16 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w17 >>> 26)) | 0),\n (w17 &= 67108863),\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 & 8191) << 13)) | 0;\n return (\n (c = (((hi + (mid >>> 13)) | 0) + (w18 >>> 26)) | 0),\n (w18 &= 67108863),\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 c !== 0 && ((o[19] = c), out.length++),\n out\n );\n };\n Math.imul || (comb10MulTo = smallMulTo);\n function bigMulTo(self2, num, out) {\n (out.negative = num.negative ^ self2.negative), (out.length = self2.length + num.length);\n for (var carry = 0, hncarry = 0, k = 0; k < out.length - 1; k++) {\n var ncarry = hncarry;\n hncarry = 0;\n for (\n var rword = carry & 67108863, maxJ = Math.min(k, num.length - 1), j = Math.max(0, k - self2.length + 1);\n j <= maxJ;\n j++\n ) {\n var i = k - j,\n a = self2.words[i] | 0,\n b = num.words[j] | 0,\n r = a * b,\n lo = r & 67108863;\n (ncarry = (ncarry + ((r / 67108864) | 0)) | 0),\n (lo = (lo + rword) | 0),\n (rword = lo & 67108863),\n (ncarry = (ncarry + (lo >>> 26)) | 0),\n (hncarry += ncarry >>> 26),\n (ncarry &= 67108863);\n }\n (out.words[k] = rword), (carry = ncarry), (ncarry = hncarry);\n }\n return carry !== 0 ? (out.words[k] = carry) : out.length--, out.strip();\n }\n function jumboMulTo(self2, num, out) {\n var fftm = new FFTM();\n return fftm.mulp(self2, num, out);\n }\n BN.prototype.mulTo = function (num, out) {\n var res,\n len = this.length + num.length;\n return (\n this.length === 10 && num.length === 10\n ? (res = comb10MulTo(this, num, out))\n : len < 63\n ? (res = smallMulTo(this, num, out))\n : len < 1024\n ? (res = bigMulTo(this, num, out))\n : (res = jumboMulTo(this, num, out)),\n res\n );\n };\n function FFTM(x, y) {\n (this.x = x), (this.y = y);\n }\n (FFTM.prototype.makeRBT = function (N) {\n for (var t = new Array(N), l = BN.prototype._countBits(N) - 1, i = 0; i < N; i++) t[i] = this.revBin(i, l, N);\n return t;\n }),\n (FFTM.prototype.revBin = function (x, l, N) {\n if (x === 0 || x === N - 1) return x;\n for (var rb = 0, i = 0; i < l; i++) (rb |= (x & 1) << (l - i - 1)), (x >>= 1);\n return rb;\n }),\n (FFTM.prototype.permute = function (rbt, rws, iws, rtws, itws, N) {\n for (var i = 0; i < N; i++) (rtws[i] = rws[rbt[i]]), (itws[i] = iws[rbt[i]]);\n }),\n (FFTM.prototype.transform = function (rws, iws, rtws, itws, N, rbt) {\n this.permute(rbt, rws, iws, rtws, itws, N);\n for (var s = 1; s < N; s <<= 1)\n for (\n var l = s << 1, rtwdf = Math.cos((2 * Math.PI) / l), itwdf = Math.sin((2 * Math.PI) / l), p = 0;\n p < N;\n p += l\n )\n for (var rtwdf_ = rtwdf, itwdf_ = itwdf, j = 0; j < s; j++) {\n var re = rtws[p + j],\n ie = itws[p + j],\n ro = rtws[p + j + s],\n io = itws[p + j + s],\n rx = rtwdf_ * ro - itwdf_ * io;\n (io = rtwdf_ * io + itwdf_ * ro),\n (ro = rx),\n (rtws[p + j] = re + ro),\n (itws[p + j] = ie + io),\n (rtws[p + j + s] = re - ro),\n (itws[p + j + s] = ie - io),\n j !== l &&\n ((rx = rtwdf * rtwdf_ - itwdf * itwdf_), (itwdf_ = rtwdf * itwdf_ + itwdf * rtwdf_), (rtwdf_ = rx));\n }\n }),\n (FFTM.prototype.guessLen13b = function (n, m) {\n var N = Math.max(m, n) | 1,\n odd = N & 1,\n i = 0;\n for (N = (N / 2) | 0; N; N = N >>> 1) i++;\n return 1 << (i + 1 + odd);\n }),\n (FFTM.prototype.conjugate = function (rws, iws, N) {\n if (!(N <= 1))\n for (var i = 0; i < N / 2; i++) {\n var t = rws[i];\n (rws[i] = rws[N - i - 1]),\n (rws[N - i - 1] = t),\n (t = iws[i]),\n (iws[i] = -iws[N - i - 1]),\n (iws[N - i - 1] = -t);\n }\n }),\n (FFTM.prototype.normalize13b = function (ws, N) {\n for (var carry = 0, i = 0; i < N / 2; i++) {\n var w = Math.round(ws[2 * i + 1] / N) * 8192 + Math.round(ws[2 * i] / N) + carry;\n (ws[i] = w & 67108863), w < 67108864 ? (carry = 0) : (carry = (w / 67108864) | 0);\n }\n return ws;\n }),\n (FFTM.prototype.convert13b = function (ws, len, rws, N) {\n for (var carry = 0, i = 0; i < len; i++)\n (carry = carry + (ws[i] | 0)),\n (rws[2 * i] = carry & 8191),\n (carry = carry >>> 13),\n (rws[2 * i + 1] = carry & 8191),\n (carry = carry >>> 13);\n for (i = 2 * len; i < N; ++i) rws[i] = 0;\n assert(carry === 0), assert((carry & -8192) === 0);\n }),\n (FFTM.prototype.stub = function (N) {\n for (var ph = new Array(N), i = 0; i < N; i++) ph[i] = 0;\n return ph;\n }),\n (FFTM.prototype.mulp = function (x, y, out) {\n var N = 2 * this.guessLen13b(x.length, y.length),\n rbt = this.makeRBT(N),\n _ = this.stub(N),\n rws = new Array(N),\n rwst = new Array(N),\n iwst = new Array(N),\n nrws = new Array(N),\n nrwst = new Array(N),\n niwst = new Array(N),\n rmws = out.words;\n (rmws.length = N),\n this.convert13b(x.words, x.length, rws, N),\n this.convert13b(y.words, y.length, nrws, N),\n this.transform(rws, _, rwst, iwst, N, rbt),\n this.transform(nrws, _, nrwst, niwst, N, rbt);\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]), (rwst[i] = rx);\n }\n return (\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 (out.negative = x.negative ^ y.negative),\n (out.length = x.length + y.length),\n out.strip()\n );\n }),\n (BN.prototype.mul = function (num) {\n var out = new BN(null);\n return (out.words = new Array(this.length + num.length)), this.mulTo(num, out);\n }),\n (BN.prototype.mulf = function (num) {\n var out = new BN(null);\n return (out.words = new Array(this.length + num.length)), jumboMulTo(this, num, out);\n }),\n (BN.prototype.imul = function (num) {\n return this.clone().mulTo(num, this);\n }),\n (BN.prototype.imuln = function (num) {\n assert(typeof num == \"number\"), assert(num < 67108864);\n for (var carry = 0, i = 0; i < this.length; i++) {\n var w = (this.words[i] | 0) * num,\n lo = (w & 67108863) + (carry & 67108863);\n (carry >>= 26), (carry += (w / 67108864) | 0), (carry += lo >>> 26), (this.words[i] = lo & 67108863);\n }\n return carry !== 0 && ((this.words[i] = carry), this.length++), this;\n }),\n (BN.prototype.muln = function (num) {\n return this.clone().imuln(num);\n }),\n (BN.prototype.sqr = function () {\n return this.mul(this);\n }),\n (BN.prototype.isqr = function () {\n return this.imul(this.clone());\n }),\n (BN.prototype.pow = function (num) {\n var w = toBitArray(num);\n if (w.length === 0) return new BN(1);\n for (var res = this, i = 0; i < w.length && w[i] === 0; i++, res = res.sqr());\n if (++i < w.length) for (var q = res.sqr(); i < w.length; i++, q = q.sqr()) w[i] !== 0 && (res = res.mul(q));\n return res;\n }),\n (BN.prototype.iushln = function (bits) {\n assert(typeof bits == \"number\" && bits >= 0);\n var r = bits % 26,\n s = (bits - r) / 26,\n carryMask = (67108863 >>> (26 - r)) << (26 - r),\n i;\n if (r !== 0) {\n var carry = 0;\n for (i = 0; i < this.length; i++) {\n var newCarry = this.words[i] & carryMask,\n c = ((this.words[i] | 0) - newCarry) << r;\n (this.words[i] = c | carry), (carry = newCarry >>> (26 - r));\n }\n carry && ((this.words[i] = carry), this.length++);\n }\n if (s !== 0) {\n for (i = this.length - 1; i >= 0; i--) this.words[i + s] = this.words[i];\n for (i = 0; i < s; i++) this.words[i] = 0;\n this.length += s;\n }\n return this.strip();\n }),\n (BN.prototype.ishln = function (bits) {\n return assert(this.negative === 0), this.iushln(bits);\n }),\n (BN.prototype.iushrn = function (bits, hint, extended) {\n assert(typeof bits == \"number\" && bits >= 0);\n var h;\n hint ? (h = (hint - (hint % 26)) / 26) : (h = 0);\n var r = bits % 26,\n s = Math.min((bits - r) / 26, this.length),\n mask = 67108863 ^ ((67108863 >>> r) << r),\n maskedWords = extended;\n if (((h -= s), (h = Math.max(0, h)), maskedWords)) {\n for (var i = 0; i < s; i++) maskedWords.words[i] = this.words[i];\n maskedWords.length = s;\n }\n if (s !== 0)\n if (this.length > s) for (this.length -= s, i = 0; i < this.length; i++) this.words[i] = this.words[i + s];\n else (this.words[0] = 0), (this.length = 1);\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)), (carry = word & mask);\n }\n return (\n maskedWords && carry !== 0 && (maskedWords.words[maskedWords.length++] = carry),\n this.length === 0 && ((this.words[0] = 0), (this.length = 1)),\n this.strip()\n );\n }),\n (BN.prototype.ishrn = function (bits, hint, extended) {\n return assert(this.negative === 0), this.iushrn(bits, hint, extended);\n }),\n (BN.prototype.shln = function (bits) {\n return this.clone().ishln(bits);\n }),\n (BN.prototype.ushln = function (bits) {\n return this.clone().iushln(bits);\n }),\n (BN.prototype.shrn = function (bits) {\n return this.clone().ishrn(bits);\n }),\n (BN.prototype.ushrn = function (bits) {\n return this.clone().iushrn(bits);\n }),\n (BN.prototype.testn = function (bit) {\n assert(typeof bit == \"number\" && bit >= 0);\n var r = bit % 26,\n s = (bit - r) / 26,\n q = 1 << r;\n if (this.length <= s) return !1;\n var w = this.words[s];\n return !!(w & q);\n }),\n (BN.prototype.imaskn = function (bits) {\n assert(typeof bits == \"number\" && bits >= 0);\n var r = bits % 26,\n s = (bits - r) / 26;\n if ((assert(this.negative === 0, \"imaskn works only with positive numbers\"), this.length <= s)) return this;\n if ((r !== 0 && s++, (this.length = Math.min(s, this.length)), r !== 0)) {\n var mask = 67108863 ^ ((67108863 >>> r) << r);\n this.words[this.length - 1] &= mask;\n }\n return this.strip();\n }),\n (BN.prototype.maskn = function (bits) {\n return this.clone().imaskn(bits);\n }),\n (BN.prototype.iaddn = function (num) {\n return (\n assert(typeof num == \"number\"),\n assert(num < 67108864),\n num < 0\n ? this.isubn(-num)\n : this.negative !== 0\n ? this.length === 1 && (this.words[0] | 0) < num\n ? ((this.words[0] = num - (this.words[0] | 0)), (this.negative = 0), this)\n : ((this.negative = 0), this.isubn(num), (this.negative = 1), this)\n : this._iaddn(num)\n );\n }),\n (BN.prototype._iaddn = function (num) {\n this.words[0] += num;\n for (var i = 0; i < this.length && this.words[i] >= 67108864; i++)\n (this.words[i] -= 67108864), i === this.length - 1 ? (this.words[i + 1] = 1) : this.words[i + 1]++;\n return (this.length = Math.max(this.length, i + 1)), this;\n }),\n (BN.prototype.isubn = function (num) {\n if ((assert(typeof num == \"number\"), assert(num < 67108864), num < 0)) return this.iaddn(-num);\n if (this.negative !== 0) return (this.negative = 0), this.iaddn(num), (this.negative = 1), this;\n if (((this.words[0] -= num), this.length === 1 && this.words[0] < 0))\n (this.words[0] = -this.words[0]), (this.negative = 1);\n else\n for (var i = 0; i < this.length && this.words[i] < 0; i++)\n (this.words[i] += 67108864), (this.words[i + 1] -= 1);\n return this.strip();\n }),\n (BN.prototype.addn = function (num) {\n return this.clone().iaddn(num);\n }),\n (BN.prototype.subn = function (num) {\n return this.clone().isubn(num);\n }),\n (BN.prototype.iabs = function () {\n return (this.negative = 0), this;\n }),\n (BN.prototype.abs = function () {\n return this.clone().iabs();\n }),\n (BN.prototype._ishlnsubmul = function (num, mul, shift) {\n var len = num.length + shift,\n i;\n this._expand(len);\n var w,\n 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 & 67108863),\n (carry = (w >> 26) - ((right / 67108864) | 0)),\n (this.words[i + shift] = w & 67108863);\n }\n for (; i < this.length - shift; i++)\n (w = (this.words[i + shift] | 0) + carry), (carry = w >> 26), (this.words[i + shift] = w & 67108863);\n if (carry === 0) return this.strip();\n for (assert(carry === -1), carry = 0, i = 0; i < this.length; i++)\n (w = -(this.words[i] | 0) + carry), (carry = w >> 26), (this.words[i] = w & 67108863);\n return (this.negative = 1), this.strip();\n }),\n (BN.prototype._wordDiv = function (num, mode) {\n var shift = this.length - num.length,\n a = this.clone(),\n b = num,\n bhi = b.words[b.length - 1] | 0,\n bhiBits = this._countBits(bhi);\n (shift = 26 - bhiBits),\n shift !== 0 && ((b = b.ushln(shift)), a.iushln(shift), (bhi = b.words[b.length - 1] | 0));\n var m = a.length - b.length,\n q;\n if (mode !== \"mod\") {\n (q = new BN(null)), (q.length = m + 1), (q.words = new Array(q.length));\n for (var i = 0; i < q.length; i++) q.words[i] = 0;\n }\n var diff = a.clone()._ishlnsubmul(b, 1, m);\n diff.negative === 0 && ((a = diff), q && (q.words[m] = 1));\n for (var j = m - 1; j >= 0; j--) {\n var qj = (a.words[b.length + j] | 0) * 67108864 + (a.words[b.length + j - 1] | 0);\n for (qj = Math.min((qj / bhi) | 0, 67108863), a._ishlnsubmul(b, qj, j); a.negative !== 0; )\n qj--, (a.negative = 0), a._ishlnsubmul(b, 1, j), a.isZero() || (a.negative ^= 1);\n q && (q.words[j] = qj);\n }\n return (\n q && q.strip(),\n a.strip(),\n mode !== \"div\" && shift !== 0 && a.iushrn(shift),\n {\n div: q || null,\n mod: a,\n }\n );\n }),\n (BN.prototype.divmod = function (num, mode, positive) {\n if ((assert(!num.isZero()), this.isZero()))\n return {\n div: new BN(0),\n mod: new BN(0),\n };\n var div, mod, res;\n return this.negative !== 0 && num.negative === 0\n ? ((res = this.neg().divmod(num, mode)),\n mode !== \"mod\" && (div = res.div.neg()),\n mode !== \"div\" && ((mod = res.mod.neg()), positive && mod.negative !== 0 && mod.iadd(num)),\n {\n div,\n mod,\n })\n : this.negative === 0 && num.negative !== 0\n ? ((res = this.divmod(num.neg(), mode)),\n mode !== \"mod\" && (div = res.div.neg()),\n {\n div,\n mod: res.mod,\n })\n : (this.negative & num.negative) !== 0\n ? ((res = this.neg().divmod(num.neg(), mode)),\n mode !== \"div\" && ((mod = res.mod.neg()), positive && mod.negative !== 0 && mod.isub(num)),\n {\n div: res.div,\n mod,\n })\n : num.length > this.length || this.cmp(num) < 0\n ? {\n div: new BN(0),\n mod: this,\n }\n : num.length === 1\n ? mode === \"div\"\n ? {\n div: this.divn(num.words[0]),\n mod: null,\n }\n : mode === \"mod\"\n ? {\n div: null,\n mod: new BN(this.modn(num.words[0])),\n }\n : {\n div: this.divn(num.words[0]),\n mod: new BN(this.modn(num.words[0])),\n }\n : this._wordDiv(num, mode);\n }),\n (BN.prototype.div = function (num) {\n return this.divmod(num, \"div\", !1).div;\n }),\n (BN.prototype.mod = function (num) {\n return this.divmod(num, \"mod\", !1).mod;\n }),\n (BN.prototype.umod = function (num) {\n return this.divmod(num, \"mod\", !0).mod;\n }),\n (BN.prototype.divRound = function (num) {\n var dm = this.divmod(num);\n if (dm.mod.isZero()) return dm.div;\n var mod = dm.div.negative !== 0 ? dm.mod.isub(num) : dm.mod,\n half = num.ushrn(1),\n r2 = num.andln(1),\n cmp = mod.cmp(half);\n return cmp < 0 || (r2 === 1 && cmp === 0)\n ? dm.div\n : dm.div.negative !== 0\n ? dm.div.isubn(1)\n : dm.div.iaddn(1);\n }),\n (BN.prototype.modn = function (num) {\n assert(num <= 67108863);\n for (var p = (1 << 26) % num, acc = 0, i = this.length - 1; i >= 0; i--)\n acc = (p * acc + (this.words[i] | 0)) % num;\n return acc;\n }),\n (BN.prototype.idivn = function (num) {\n assert(num <= 67108863);\n for (var carry = 0, i = this.length - 1; i >= 0; i--) {\n var w = (this.words[i] | 0) + carry * 67108864;\n (this.words[i] = (w / num) | 0), (carry = w % num);\n }\n return this.strip();\n }),\n (BN.prototype.divn = function (num) {\n return this.clone().idivn(num);\n }),\n (BN.prototype.egcd = function (p) {\n assert(p.negative === 0), assert(!p.isZero());\n var x = this,\n y = p.clone();\n x.negative !== 0 ? (x = x.umod(p)) : (x = x.clone());\n for (var A = new BN(1), B = new BN(0), C = new BN(0), D = new BN(1), g = 0; x.isEven() && y.isEven(); )\n x.iushrn(1), y.iushrn(1), ++g;\n for (var yp = y.clone(), xp = x.clone(); !x.isZero(); ) {\n for (var i = 0, im = 1; (x.words[0] & im) === 0 && i < 26; ++i, im <<= 1);\n if (i > 0)\n for (x.iushrn(i); i-- > 0; )\n (A.isOdd() || B.isOdd()) && (A.iadd(yp), B.isub(xp)), A.iushrn(1), B.iushrn(1);\n for (var j = 0, jm = 1; (y.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n if (j > 0)\n for (y.iushrn(j); j-- > 0; )\n (C.isOdd() || D.isOdd()) && (C.iadd(yp), D.isub(xp)), C.iushrn(1), D.iushrn(1);\n x.cmp(y) >= 0 ? (x.isub(y), A.isub(C), B.isub(D)) : (y.isub(x), C.isub(A), D.isub(B));\n }\n return {\n a: C,\n b: D,\n gcd: y.iushln(g),\n };\n }),\n (BN.prototype._invmp = function (p) {\n assert(p.negative === 0), assert(!p.isZero());\n var a = this,\n b = p.clone();\n a.negative !== 0 ? (a = a.umod(p)) : (a = a.clone());\n for (var x1 = new BN(1), x2 = new BN(0), delta = b.clone(); 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) for (a.iushrn(i); i-- > 0; ) x1.isOdd() && x1.iadd(delta), x1.iushrn(1);\n for (var j = 0, jm = 1; (b.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n if (j > 0) for (b.iushrn(j); j-- > 0; ) x2.isOdd() && x2.iadd(delta), x2.iushrn(1);\n a.cmp(b) >= 0 ? (a.isub(b), x1.isub(x2)) : (b.isub(a), x2.isub(x1));\n }\n var res;\n return a.cmpn(1) === 0 ? (res = x1) : (res = x2), res.cmpn(0) < 0 && res.iadd(p), res;\n }),\n (BN.prototype.gcd = function (num) {\n if (this.isZero()) return num.abs();\n if (num.isZero()) return this.abs();\n var a = this.clone(),\n b = num.clone();\n (a.negative = 0), (b.negative = 0);\n for (var shift = 0; a.isEven() && b.isEven(); shift++) a.iushrn(1), b.iushrn(1);\n do {\n for (; a.isEven(); ) a.iushrn(1);\n for (; b.isEven(); ) b.iushrn(1);\n var r = a.cmp(b);\n if (r < 0) {\n var t = a;\n (a = b), (b = t);\n } else if (r === 0 || b.cmpn(1) === 0) break;\n a.isub(b);\n } while (!0);\n return b.iushln(shift);\n }),\n (BN.prototype.invm = function (num) {\n return this.egcd(num).a.umod(num);\n }),\n (BN.prototype.isEven = function () {\n return (this.words[0] & 1) === 0;\n }),\n (BN.prototype.isOdd = function () {\n return (this.words[0] & 1) === 1;\n }),\n (BN.prototype.andln = function (num) {\n return this.words[0] & num;\n }),\n (BN.prototype.bincn = function (bit) {\n assert(typeof bit == \"number\");\n var r = bit % 26,\n s = (bit - r) / 26,\n q = 1 << r;\n if (this.length <= s) return this._expand(s + 1), (this.words[s] |= q), this;\n for (var carry = q, i = s; carry !== 0 && i < this.length; i++) {\n var w = this.words[i] | 0;\n (w += carry), (carry = w >>> 26), (w &= 67108863), (this.words[i] = w);\n }\n return carry !== 0 && ((this.words[i] = carry), this.length++), this;\n }),\n (BN.prototype.isZero = function () {\n return this.length === 1 && this.words[0] === 0;\n }),\n (BN.prototype.cmpn = function (num) {\n var negative = num < 0;\n if (this.negative !== 0 && !negative) return -1;\n if (this.negative === 0 && negative) return 1;\n this.strip();\n var res;\n if (this.length > 1) res = 1;\n else {\n negative && (num = -num), assert(num <= 67108863, \"Number is too big\");\n var w = this.words[0] | 0;\n res = w === num ? 0 : w < num ? -1 : 1;\n }\n return this.negative !== 0 ? -res | 0 : res;\n }),\n (BN.prototype.cmp = function (num) {\n if (this.negative !== 0 && num.negative === 0) return -1;\n if (this.negative === 0 && num.negative !== 0) return 1;\n var res = this.ucmp(num);\n return this.negative !== 0 ? -res | 0 : res;\n }),\n (BN.prototype.ucmp = function (num) {\n if (this.length > num.length) return 1;\n if (this.length < num.length) return -1;\n for (var res = 0, i = this.length - 1; i >= 0; i--) {\n var a = this.words[i] | 0,\n b = num.words[i] | 0;\n if (a !== b) {\n a < b ? (res = -1) : a > b && (res = 1);\n break;\n }\n }\n return res;\n }),\n (BN.prototype.gtn = function (num) {\n return this.cmpn(num) === 1;\n }),\n (BN.prototype.gt = function (num) {\n return this.cmp(num) === 1;\n }),\n (BN.prototype.gten = function (num) {\n return this.cmpn(num) >= 0;\n }),\n (BN.prototype.gte = function (num) {\n return this.cmp(num) >= 0;\n }),\n (BN.prototype.ltn = function (num) {\n return this.cmpn(num) === -1;\n }),\n (BN.prototype.lt = function (num) {\n return this.cmp(num) === -1;\n }),\n (BN.prototype.lten = function (num) {\n return this.cmpn(num) <= 0;\n }),\n (BN.prototype.lte = function (num) {\n return this.cmp(num) <= 0;\n }),\n (BN.prototype.eqn = function (num) {\n return this.cmpn(num) === 0;\n }),\n (BN.prototype.eq = function (num) {\n return this.cmp(num) === 0;\n }),\n (BN.red = function (num) {\n return new Red(num);\n }),\n (BN.prototype.toRed = function (ctx) {\n return (\n assert(!this.red, \"Already a number in reduction context\"),\n assert(this.negative === 0, \"red works only with positives\"),\n ctx.convertTo(this)._forceRed(ctx)\n );\n }),\n (BN.prototype.fromRed = function () {\n return assert(this.red, \"fromRed works only with numbers in reduction context\"), this.red.convertFrom(this);\n }),\n (BN.prototype._forceRed = function (ctx) {\n return (this.red = ctx), this;\n }),\n (BN.prototype.forceRed = function (ctx) {\n return assert(!this.red, \"Already a number in reduction context\"), this._forceRed(ctx);\n }),\n (BN.prototype.redAdd = function (num) {\n return assert(this.red, \"redAdd works only with red numbers\"), this.red.add(this, num);\n }),\n (BN.prototype.redIAdd = function (num) {\n return assert(this.red, \"redIAdd works only with red numbers\"), this.red.iadd(this, num);\n }),\n (BN.prototype.redSub = function (num) {\n return assert(this.red, \"redSub works only with red numbers\"), this.red.sub(this, num);\n }),\n (BN.prototype.redISub = function (num) {\n return assert(this.red, \"redISub works only with red numbers\"), this.red.isub(this, num);\n }),\n (BN.prototype.redShl = function (num) {\n return assert(this.red, \"redShl works only with red numbers\"), this.red.shl(this, num);\n }),\n (BN.prototype.redMul = function (num) {\n return (\n assert(this.red, \"redMul works only with red numbers\"),\n this.red._verify2(this, num),\n this.red.mul(this, num)\n );\n }),\n (BN.prototype.redIMul = function (num) {\n return (\n assert(this.red, \"redMul works only with red numbers\"),\n this.red._verify2(this, num),\n this.red.imul(this, num)\n );\n }),\n (BN.prototype.redSqr = function () {\n return assert(this.red, \"redSqr works only with red numbers\"), this.red._verify1(this), this.red.sqr(this);\n }),\n (BN.prototype.redISqr = function () {\n return assert(this.red, \"redISqr works only with red numbers\"), this.red._verify1(this), this.red.isqr(this);\n }),\n (BN.prototype.redSqrt = function () {\n return assert(this.red, \"redSqrt works only with red numbers\"), this.red._verify1(this), this.red.sqrt(this);\n }),\n (BN.prototype.redInvm = function () {\n return assert(this.red, \"redInvm works only with red numbers\"), this.red._verify1(this), this.red.invm(this);\n }),\n (BN.prototype.redNeg = function () {\n return assert(this.red, \"redNeg works only with red numbers\"), this.red._verify1(this), this.red.neg(this);\n }),\n (BN.prototype.redPow = function (num) {\n return assert(this.red && !num.red, \"redPow(normalNum)\"), this.red._verify1(this), this.red.pow(this, num);\n });\n var primes = {\n k256: null,\n p224: null,\n p192: null,\n p25519: null,\n };\n function MPrime(name, p) {\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 (this.tmp = this._tmp());\n }\n (MPrime.prototype._tmp = function () {\n var tmp = new BN(null);\n return (tmp.words = new Array(Math.ceil(this.n / 13))), tmp;\n }),\n (MPrime.prototype.ireduce = function (num) {\n var r = num,\n rlen;\n do this.split(r, this.tmp), (r = this.imulK(r)), (r = r.iadd(this.tmp)), (rlen = r.bitLength());\n while (rlen > this.n);\n var cmp = rlen < this.n ? -1 : r.ucmp(this.p);\n return (\n cmp === 0\n ? ((r.words[0] = 0), (r.length = 1))\n : cmp > 0\n ? r.isub(this.p)\n : r.strip !== void 0\n ? r.strip()\n : r._strip(),\n r\n );\n }),\n (MPrime.prototype.split = function (input, out) {\n input.iushrn(this.n, 0, out);\n }),\n (MPrime.prototype.imulK = function (num) {\n return num.imul(this.k);\n });\n function K256() {\n MPrime.call(this, \"k256\", \"ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f\");\n }\n inherits(K256, MPrime),\n (K256.prototype.split = function (input, output) {\n for (var mask = 4194303, outLen = Math.min(input.length, 9), i = 0; i < outLen; i++)\n output.words[i] = input.words[i];\n if (((output.length = outLen), input.length <= 9)) {\n (input.words[0] = 0), (input.length = 1);\n return;\n }\n var prev = input.words[9];\n for (output.words[output.length++] = prev & mask, i = 10; i < input.length; i++) {\n var next = input.words[i] | 0;\n (input.words[i - 10] = ((next & mask) << 4) | (prev >>> 22)), (prev = next);\n }\n (prev >>>= 22),\n (input.words[i - 10] = prev),\n prev === 0 && input.length > 10 ? (input.length -= 10) : (input.length -= 9);\n }),\n (K256.prototype.imulK = function (num) {\n (num.words[num.length] = 0), (num.words[num.length + 1] = 0), (num.length += 2);\n for (var lo = 0, i = 0; i < num.length; i++) {\n var w = num.words[i] | 0;\n (lo += w * 977), (num.words[i] = lo & 67108863), (lo = w * 64 + ((lo / 67108864) | 0));\n }\n return (\n num.words[num.length - 1] === 0 && (num.length--, num.words[num.length - 1] === 0 && num.length--), num\n );\n });\n function P224() {\n MPrime.call(this, \"p224\", \"ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001\");\n }\n inherits(P224, MPrime);\n function P192() {\n MPrime.call(this, \"p192\", \"ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff\");\n }\n inherits(P192, MPrime);\n function P25519() {\n MPrime.call(this, \"25519\", \"7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed\");\n }\n inherits(P25519, MPrime),\n (P25519.prototype.imulK = function (num) {\n for (var carry = 0, i = 0; i < num.length; i++) {\n var hi = (num.words[i] | 0) * 19 + carry,\n lo = hi & 67108863;\n (hi >>>= 26), (num.words[i] = lo), (carry = hi);\n }\n return carry !== 0 && (num.words[num.length++] = carry), num;\n }),\n (BN._prime = function (name) {\n if (primes[name]) return primes[name];\n var prime2;\n if (name === \"k256\") prime2 = new K256();\n else if (name === \"p224\") prime2 = new P224();\n else if (name === \"p192\") prime2 = new P192();\n else if (name === \"p25519\") prime2 = new P25519();\n else throw new Error(\"Unknown prime \" + name);\n return (primes[name] = prime2), prime2;\n });\n function Red(m) {\n if (typeof m == \"string\") {\n var prime = BN._prime(m);\n (this.m = prime.p), (this.prime = prime);\n } else assert(m.gtn(1), \"modulus must be greater than 1\"), (this.m = m), (this.prime = null);\n }\n (Red.prototype._verify1 = function (a) {\n assert(a.negative === 0, \"red works only with positives\"), assert(a.red, \"red works only with red numbers\");\n }),\n (Red.prototype._verify2 = function (a, b) {\n assert((a.negative | b.negative) === 0, \"red works only with positives\"),\n assert(a.red && a.red === b.red, \"red works only with red numbers\");\n }),\n (Red.prototype.imod = function (a) {\n return this.prime ? this.prime.ireduce(a)._forceRed(this) : a.umod(this.m)._forceRed(this);\n }),\n (Red.prototype.neg = function (a) {\n return a.isZero() ? a.clone() : this.m.sub(a)._forceRed(this);\n }),\n (Red.prototype.add = function (a, b) {\n this._verify2(a, b);\n var res = a.add(b);\n return res.cmp(this.m) >= 0 && res.isub(this.m), res._forceRed(this);\n }),\n (Red.prototype.iadd = function (a, b) {\n this._verify2(a, b);\n var res = a.iadd(b);\n return res.cmp(this.m) >= 0 && res.isub(this.m), res;\n }),\n (Red.prototype.sub = function (a, b) {\n this._verify2(a, b);\n var res = a.sub(b);\n return res.cmpn(0) < 0 && res.iadd(this.m), res._forceRed(this);\n }),\n (Red.prototype.isub = function (a, b) {\n this._verify2(a, b);\n var res = a.isub(b);\n return res.cmpn(0) < 0 && res.iadd(this.m), res;\n }),\n (Red.prototype.shl = function (a, num) {\n return this._verify1(a), this.imod(a.ushln(num));\n }),\n (Red.prototype.imul = function (a, b) {\n return this._verify2(a, b), this.imod(a.imul(b));\n }),\n (Red.prototype.mul = function (a, b) {\n return this._verify2(a, b), this.imod(a.mul(b));\n }),\n (Red.prototype.isqr = function (a) {\n return this.imul(a, a.clone());\n }),\n (Red.prototype.sqr = function (a) {\n return this.mul(a, a);\n }),\n (Red.prototype.sqrt = function (a) {\n if (a.isZero()) return a.clone();\n var mod3 = this.m.andln(3);\n if ((assert(mod3 % 2 === 1), mod3 === 3)) {\n var pow = this.m.add(new BN(1)).iushrn(2);\n return this.pow(a, pow);\n }\n for (var q = this.m.subn(1), s = 0; !q.isZero() && q.andln(1) === 0; ) s++, q.iushrn(1);\n assert(!q.isZero());\n var one = new BN(1).toRed(this),\n nOne = one.redNeg(),\n lpow = this.m.subn(1).iushrn(1),\n z = this.m.bitLength();\n for (z = new BN(2 * z * z).toRed(this); this.pow(z, lpow).cmp(nOne) !== 0; ) z.redIAdd(nOne);\n for (\n var c = this.pow(z, q), r = this.pow(a, q.addn(1).iushrn(1)), t = this.pow(a, q), m = s;\n t.cmp(one) !== 0;\n\n ) {\n for (var tmp = t, i = 0; tmp.cmp(one) !== 0; i++) tmp = tmp.redSqr();\n assert(i < m);\n var b = this.pow(c, new BN(1).iushln(m - i - 1));\n (r = r.redMul(b)), (c = b.redSqr()), (t = t.redMul(c)), (m = i);\n }\n return r;\n }),\n (Red.prototype.invm = function (a) {\n var inv = a._invmp(this.m);\n return inv.negative !== 0 ? ((inv.negative = 0), this.imod(inv).redNeg()) : this.imod(inv);\n }),\n (Red.prototype.pow = function (a, num) {\n if (num.isZero()) return new BN(1).toRed(this);\n if (num.cmpn(1) === 0) return a.clone();\n var windowSize = 4,\n wnd = new Array(1 << windowSize);\n (wnd[0] = new BN(1).toRed(this)), (wnd[1] = a);\n for (var i = 2; i < wnd.length; i++) wnd[i] = this.mul(wnd[i - 1], a);\n var res = wnd[0],\n current = 0,\n currentLen = 0,\n start = num.bitLength() % 26;\n for (start === 0 && (start = 26), i = num.length - 1; i >= 0; i--) {\n for (var word = num.words[i], j = start - 1; j >= 0; j--) {\n var bit = (word >> j) & 1;\n if ((res !== wnd[0] && (res = this.sqr(res)), bit === 0 && current === 0)) {\n currentLen = 0;\n continue;\n }\n (current <<= 1),\n (current |= bit),\n currentLen++,\n !(currentLen !== windowSize && (i !== 0 || j !== 0)) &&\n ((res = this.mul(res, wnd[current])), (currentLen = 0), (current = 0));\n }\n start = 26;\n }\n return res;\n }),\n (Red.prototype.convertTo = function (num) {\n var r = num.umod(this.m);\n return r === num ? r.clone() : r;\n }),\n (Red.prototype.convertFrom = function (num) {\n var res = num.clone();\n return (res.red = null), res;\n }),\n (BN.mont = function (num) {\n return new Mont(num);\n });\n function Mont(m) {\n Red.call(this, m),\n (this.shift = this.m.bitLength()),\n this.shift % 26 !== 0 && (this.shift += 26 - (this.shift % 26)),\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 (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 (Mont.prototype.convertTo = function (num) {\n return this.imod(num.ushln(this.shift));\n }),\n (Mont.prototype.convertFrom = function (num) {\n var r = this.imod(num.mul(this.rinv));\n return (r.red = null), r;\n }),\n (Mont.prototype.imul = function (a, b) {\n if (a.isZero() || b.isZero()) return (a.words[0] = 0), (a.length = 1), a;\n var t = a.imul(b),\n c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m),\n u = t.isub(c).iushrn(this.shift),\n res = u;\n return (\n u.cmp(this.m) >= 0 ? (res = u.isub(this.m)) : u.cmpn(0) < 0 && (res = u.iadd(this.m)), res._forceRed(this)\n );\n }),\n (Mont.prototype.mul = function (a, b) {\n if (a.isZero() || b.isZero()) return new BN(0)._forceRed(this);\n var t = a.mul(b),\n c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m),\n u = t.isub(c).iushrn(this.shift),\n res = u;\n return (\n u.cmp(this.m) >= 0 ? (res = u.isub(this.m)) : u.cmpn(0) < 0 && (res = u.iadd(this.m)), res._forceRed(this)\n );\n }),\n (Mont.prototype.invm = function (a) {\n var res = this.imod(a._invmp(this.m).mul(this.r2));\n return res._forceRed(this);\n });\n })(typeof module > \"u\" || module, exports);\n },\n});\n\n// node_modules/miller-rabin/node_modules/bn.js/lib/bn.js\nvar require_bn2 = __commonJS({\n \"node_modules/miller-rabin/node_modules/bn.js/lib/bn.js\"(exports, module) {\n (function (module2, exports2) {\n \"use strict\";\n function assert(val, msg) {\n if (!val) throw new Error(msg || \"Assertion failed\");\n }\n function inherits(ctor, superCtor) {\n ctor.super_ = superCtor;\n var TempCtor = function () {};\n (TempCtor.prototype = superCtor.prototype),\n (ctor.prototype = new TempCtor()),\n (ctor.prototype.constructor = ctor);\n }\n function BN(number, base, endian) {\n if (BN.isBN(number)) return number;\n (this.negative = 0),\n (this.words = null),\n (this.length = 0),\n (this.red = null),\n number !== null &&\n ((base === \"le\" || base === \"be\") && ((endian = base), (base = 10)),\n this._init(number || 0, base || 10, endian || \"be\"));\n }\n typeof module2 == \"object\" ? (module2.exports = BN) : (exports2.BN = BN), (BN.BN = BN), (BN.wordSize = 26);\n var Buffer2;\n try {\n typeof window < \"u\" && typeof window.Buffer < \"u\"\n ? (Buffer2 = window.Buffer)\n : (Buffer2 = __require(\"buffer\").Buffer);\n } catch {}\n (BN.isBN = function (num) {\n return num instanceof BN\n ? !0\n : num !== null &&\n typeof num == \"object\" &&\n num.constructor.wordSize === BN.wordSize &&\n Array.isArray(num.words);\n }),\n (BN.max = function (left, right) {\n return left.cmp(right) > 0 ? left : right;\n }),\n (BN.min = function (left, right) {\n return left.cmp(right) < 0 ? left : right;\n }),\n (BN.prototype._init = function (number, base, endian) {\n if (typeof number == \"number\") return this._initNumber(number, base, endian);\n if (typeof number == \"object\") return this._initArray(number, base, endian);\n base === \"hex\" && (base = 16),\n assert(base === (base | 0) && base >= 2 && base <= 36),\n (number = number.toString().replace(/\\s+/g, \"\"));\n var start = 0;\n number[0] === \"-\" && (start++, (this.negative = 1)),\n start < number.length &&\n (base === 16\n ? this._parseHex(number, start, endian)\n : (this._parseBase(number, base, start),\n endian === \"le\" && this._initArray(this.toArray(), base, endian)));\n }),\n (BN.prototype._initNumber = function (number, base, endian) {\n number < 0 && ((this.negative = 1), (number = -number)),\n number < 67108864\n ? ((this.words = [number & 67108863]), (this.length = 1))\n : number < 4503599627370496\n ? ((this.words = [number & 67108863, (number / 67108864) & 67108863]), (this.length = 2))\n : (assert(number < 9007199254740992),\n (this.words = [number & 67108863, (number / 67108864) & 67108863, 1]),\n (this.length = 3)),\n endian === \"le\" && this._initArray(this.toArray(), base, endian);\n }),\n (BN.prototype._initArray = function (number, base, endian) {\n if ((assert(typeof number.length == \"number\"), number.length <= 0))\n return (this.words = [0]), (this.length = 1), this;\n (this.length = Math.ceil(number.length / 3)), (this.words = new Array(this.length));\n for (var i = 0; i < this.length; i++) this.words[i] = 0;\n var j,\n w,\n off = 0;\n if (endian === \"be\")\n for (i = number.length - 1, j = 0; i >= 0; i -= 3)\n (w = number[i] | (number[i - 1] << 8) | (number[i - 2] << 16)),\n (this.words[j] |= (w << off) & 67108863),\n (this.words[j + 1] = (w >>> (26 - off)) & 67108863),\n (off += 24),\n off >= 26 && ((off -= 26), j++);\n else if (endian === \"le\")\n for (i = 0, j = 0; i < number.length; i += 3)\n (w = number[i] | (number[i + 1] << 8) | (number[i + 2] << 16)),\n (this.words[j] |= (w << off) & 67108863),\n (this.words[j + 1] = (w >>> (26 - off)) & 67108863),\n (off += 24),\n off >= 26 && ((off -= 26), j++);\n return this.strip();\n });\n function parseHex4Bits(string, index) {\n var c = string.charCodeAt(index);\n return c >= 65 && c <= 70 ? c - 55 : c >= 97 && c <= 102 ? c - 87 : (c - 48) & 15;\n }\n function parseHexByte(string, lowerBound, index) {\n var r = parseHex4Bits(string, index);\n return index - 1 >= lowerBound && (r |= parseHex4Bits(string, index - 1) << 4), r;\n }\n BN.prototype._parseHex = function (number, start, endian) {\n (this.length = Math.ceil((number.length - start) / 6)), (this.words = new Array(this.length));\n for (var i = 0; i < this.length; i++) this.words[i] = 0;\n var off = 0,\n j = 0,\n w;\n if (endian === \"be\")\n for (i = number.length - 1; i >= start; i -= 2)\n (w = parseHexByte(number, start, i) << off),\n (this.words[j] |= w & 67108863),\n off >= 18 ? ((off -= 18), (j += 1), (this.words[j] |= w >>> 26)) : (off += 8);\n else {\n var parseLength = number.length - start;\n for (i = parseLength % 2 === 0 ? start + 1 : start; i < number.length; i += 2)\n (w = parseHexByte(number, start, i) << off),\n (this.words[j] |= w & 67108863),\n off >= 18 ? ((off -= 18), (j += 1), (this.words[j] |= w >>> 26)) : (off += 8);\n }\n this.strip();\n };\n function parseBase(str, start, end, mul) {\n for (var r = 0, len = Math.min(str.length, end), i = start; i < len; i++) {\n var c = str.charCodeAt(i) - 48;\n (r *= mul), c >= 49 ? (r += c - 49 + 10) : c >= 17 ? (r += c - 17 + 10) : (r += c);\n }\n return r;\n }\n (BN.prototype._parseBase = function (number, base, start) {\n (this.words = [0]), (this.length = 1);\n for (var limbLen = 0, limbPow = 1; limbPow <= 67108863; limbPow *= base) limbLen++;\n limbLen--, (limbPow = (limbPow / base) | 0);\n for (\n var total = number.length - start,\n mod = total % limbLen,\n end = Math.min(total, total - mod) + start,\n word = 0,\n i = start;\n i < end;\n i += limbLen\n )\n (word = parseBase(number, i, i + limbLen, base)),\n this.imuln(limbPow),\n this.words[0] + word < 67108864 ? (this.words[0] += word) : this._iaddn(word);\n if (mod !== 0) {\n var pow = 1;\n for (word = parseBase(number, i, number.length, base), i = 0; i < mod; i++) pow *= base;\n this.imuln(pow), this.words[0] + word < 67108864 ? (this.words[0] += word) : this._iaddn(word);\n }\n this.strip();\n }),\n (BN.prototype.copy = function (dest) {\n dest.words = new Array(this.length);\n for (var i = 0; i < this.length; i++) dest.words[i] = this.words[i];\n (dest.length = this.length), (dest.negative = this.negative), (dest.red = this.red);\n }),\n (BN.prototype.clone = function () {\n var r = new BN(null);\n return this.copy(r), r;\n }),\n (BN.prototype._expand = function (size) {\n for (; this.length < size; ) this.words[this.length++] = 0;\n return this;\n }),\n (BN.prototype.strip = function () {\n for (; this.length > 1 && this.words[this.length - 1] === 0; ) this.length--;\n return this._normSign();\n }),\n (BN.prototype._normSign = function () {\n return this.length === 1 && this.words[0] === 0 && (this.negative = 0), this;\n }),\n (BN.prototype.inspect = function () {\n return (this.red ? \"<BN-R: \" : \"<BN: \") + this.toString(16) + \">\";\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 groupSizes = [\n 0, 0, 25, 16, 12, 11, 10, 9, 8, 8, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5,\n 5, 5,\n ],\n groupBases = [\n 0, 0, 33554432, 43046721, 16777216, 48828125, 60466176, 40353607, 16777216, 43046721, 1e7, 19487171, 35831808,\n 62748517, 7529536, 11390625, 16777216, 24137569, 34012224, 47045881, 64e6, 4084101, 5153632, 6436343, 7962624,\n 9765625, 11881376, 14348907, 17210368, 20511149, 243e5, 28629151, 33554432, 39135393, 45435424, 52521875,\n 60466176,\n ];\n (BN.prototype.toString = function (base, padding) {\n (base = base || 10), (padding = padding | 0 || 1);\n var out;\n if (base === 16 || base === \"hex\") {\n out = \"\";\n for (var off = 0, carry = 0, i = 0; i < this.length; i++) {\n var w = this.words[i],\n word = (((w << off) | carry) & 16777215).toString(16);\n (carry = (w >>> (24 - off)) & 16777215),\n carry !== 0 || i !== this.length - 1 ? (out = zeros[6 - word.length] + word + out) : (out = word + out),\n (off += 2),\n off >= 26 && ((off -= 26), i--);\n }\n for (carry !== 0 && (out = carry.toString(16) + out); out.length % padding !== 0; ) out = \"0\" + out;\n return this.negative !== 0 && (out = \"-\" + out), out;\n }\n if (base === (base | 0) && base >= 2 && base <= 36) {\n var groupSize = groupSizes[base],\n groupBase = groupBases[base];\n out = \"\";\n var c = this.clone();\n for (c.negative = 0; !c.isZero(); ) {\n var r = c.modn(groupBase).toString(base);\n (c = c.idivn(groupBase)), c.isZero() ? (out = r + out) : (out = zeros[groupSize - r.length] + r + out);\n }\n for (this.isZero() && (out = \"0\" + out); out.length % padding !== 0; ) out = \"0\" + out;\n return this.negative !== 0 && (out = \"-\" + out), out;\n }\n assert(!1, \"Base should be between 2 and 36\");\n }),\n (BN.prototype.toNumber = function () {\n var ret = this.words[0];\n return (\n this.length === 2\n ? (ret += this.words[1] * 67108864)\n : this.length === 3 && this.words[2] === 1\n ? (ret += 4503599627370496 + this.words[1] * 67108864)\n : this.length > 2 && assert(!1, \"Number can only safely store up to 53 bits\"),\n this.negative !== 0 ? -ret : ret\n );\n }),\n (BN.prototype.toJSON = function () {\n return this.toString(16);\n }),\n (BN.prototype.toBuffer = function (endian, length) {\n return assert(typeof Buffer2 < \"u\"), this.toArrayLike(Buffer2, endian, length);\n }),\n (BN.prototype.toArray = function (endian, length) {\n return this.toArrayLike(Array, endian, length);\n }),\n (BN.prototype.toArrayLike = function (ArrayType, endian, length) {\n var byteLength = this.byteLength(),\n 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 this.strip();\n var littleEndian = endian === \"le\",\n res = new ArrayType(reqLength),\n b,\n i,\n q = this.clone();\n if (littleEndian) {\n for (i = 0; !q.isZero(); i++) (b = q.andln(255)), q.iushrn(8), (res[i] = b);\n for (; i < reqLength; i++) res[i] = 0;\n } else {\n for (i = 0; i < reqLength - byteLength; i++) res[i] = 0;\n for (i = 0; !q.isZero(); i++) (b = q.andln(255)), q.iushrn(8), (res[reqLength - i - 1] = b);\n }\n return res;\n }),\n Math.clz32\n ? (BN.prototype._countBits = function (w) {\n return 32 - Math.clz32(w);\n })\n : (BN.prototype._countBits = function (w) {\n var t = w,\n r = 0;\n return (\n t >= 4096 && ((r += 13), (t >>>= 13)),\n t >= 64 && ((r += 7), (t >>>= 7)),\n t >= 8 && ((r += 4), (t >>>= 4)),\n t >= 2 && ((r += 2), (t >>>= 2)),\n r + t\n );\n }),\n (BN.prototype._zeroBits = function (w) {\n if (w === 0) return 26;\n var t = w,\n r = 0;\n return (\n (t & 8191) === 0 && ((r += 13), (t >>>= 13)),\n (t & 127) === 0 && ((r += 7), (t >>>= 7)),\n (t & 15) === 0 && ((r += 4), (t >>>= 4)),\n (t & 3) === 0 && ((r += 2), (t >>>= 2)),\n (t & 1) === 0 && r++,\n r\n );\n }),\n (BN.prototype.bitLength = function () {\n var w = this.words[this.length - 1],\n hi = this._countBits(w);\n return (this.length - 1) * 26 + hi;\n });\n function toBitArray(num) {\n for (var w = new Array(num.bitLength()), bit = 0; bit < w.length; bit++) {\n var off = (bit / 26) | 0,\n wbit = bit % 26;\n w[bit] = (num.words[off] & (1 << wbit)) >>> wbit;\n }\n return w;\n }\n (BN.prototype.zeroBits = function () {\n if (this.isZero()) return 0;\n for (var r = 0, i = 0; i < this.length; i++) {\n var b = this._zeroBits(this.words[i]);\n if (((r += b), b !== 26)) break;\n }\n return r;\n }),\n (BN.prototype.byteLength = function () {\n return Math.ceil(this.bitLength() / 8);\n }),\n (BN.prototype.toTwos = function (width) {\n return this.negative !== 0 ? this.abs().inotn(width).iaddn(1) : this.clone();\n }),\n (BN.prototype.fromTwos = function (width) {\n return this.testn(width - 1) ? this.notn(width).iaddn(1).ineg() : this.clone();\n }),\n (BN.prototype.isNeg = function () {\n return this.negative !== 0;\n }),\n (BN.prototype.neg = function () {\n return this.clone().ineg();\n }),\n (BN.prototype.ineg = function () {\n return this.isZero() || (this.negative ^= 1), this;\n }),\n (BN.prototype.iuor = function (num) {\n for (; this.length < num.length; ) this.words[this.length++] = 0;\n for (var i = 0; i < num.length; i++) this.words[i] = this.words[i] | num.words[i];\n return this.strip();\n }),\n (BN.prototype.ior = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuor(num);\n }),\n (BN.prototype.or = function (num) {\n return this.length > num.length ? this.clone().ior(num) : num.clone().ior(this);\n }),\n (BN.prototype.uor = function (num) {\n return this.length > num.length ? this.clone().iuor(num) : num.clone().iuor(this);\n }),\n (BN.prototype.iuand = function (num) {\n var b;\n this.length > num.length ? (b = num) : (b = this);\n for (var i = 0; i < b.length; i++) this.words[i] = this.words[i] & num.words[i];\n return (this.length = b.length), this.strip();\n }),\n (BN.prototype.iand = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuand(num);\n }),\n (BN.prototype.and = function (num) {\n return this.length > num.length ? this.clone().iand(num) : num.clone().iand(this);\n }),\n (BN.prototype.uand = function (num) {\n return this.length > num.length ? this.clone().iuand(num) : num.clone().iuand(this);\n }),\n (BN.prototype.iuxor = function (num) {\n var a, b;\n this.length > num.length ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var i = 0; i < b.length; i++) this.words[i] = a.words[i] ^ b.words[i];\n if (this !== a) for (; i < a.length; i++) this.words[i] = a.words[i];\n return (this.length = a.length), this.strip();\n }),\n (BN.prototype.ixor = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuxor(num);\n }),\n (BN.prototype.xor = function (num) {\n return this.length > num.length ? this.clone().ixor(num) : num.clone().ixor(this);\n }),\n (BN.prototype.uxor = function (num) {\n return this.length > num.length ? this.clone().iuxor(num) : num.clone().iuxor(this);\n }),\n (BN.prototype.inotn = function (width) {\n assert(typeof width == \"number\" && width >= 0);\n var bytesNeeded = Math.ceil(width / 26) | 0,\n bitsLeft = width % 26;\n this._expand(bytesNeeded), bitsLeft > 0 && bytesNeeded--;\n for (var i = 0; i < bytesNeeded; i++) this.words[i] = ~this.words[i] & 67108863;\n return bitsLeft > 0 && (this.words[i] = ~this.words[i] & (67108863 >> (26 - bitsLeft))), this.strip();\n }),\n (BN.prototype.notn = function (width) {\n return this.clone().inotn(width);\n }),\n (BN.prototype.setn = function (bit, val) {\n assert(typeof bit == \"number\" && bit >= 0);\n var off = (bit / 26) | 0,\n wbit = bit % 26;\n return (\n this._expand(off + 1),\n val\n ? (this.words[off] = this.words[off] | (1 << wbit))\n : (this.words[off] = this.words[off] & ~(1 << wbit)),\n this.strip()\n );\n }),\n (BN.prototype.iadd = function (num) {\n var r;\n if (this.negative !== 0 && num.negative === 0)\n return (this.negative = 0), (r = this.isub(num)), (this.negative ^= 1), this._normSign();\n if (this.negative === 0 && num.negative !== 0)\n return (num.negative = 0), (r = this.isub(num)), (num.negative = 1), r._normSign();\n var a, b;\n this.length > num.length ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var carry = 0, i = 0; i < b.length; i++)\n (r = (a.words[i] | 0) + (b.words[i] | 0) + carry), (this.words[i] = r & 67108863), (carry = r >>> 26);\n for (; carry !== 0 && i < a.length; i++)\n (r = (a.words[i] | 0) + carry), (this.words[i] = r & 67108863), (carry = r >>> 26);\n if (((this.length = a.length), carry !== 0)) (this.words[this.length] = carry), this.length++;\n else if (a !== this) for (; i < a.length; i++) this.words[i] = a.words[i];\n return this;\n }),\n (BN.prototype.add = function (num) {\n var res;\n return num.negative !== 0 && this.negative === 0\n ? ((num.negative = 0), (res = this.sub(num)), (num.negative ^= 1), res)\n : num.negative === 0 && this.negative !== 0\n ? ((this.negative = 0), (res = num.sub(this)), (this.negative = 1), res)\n : this.length > num.length\n ? this.clone().iadd(num)\n : num.clone().iadd(this);\n }),\n (BN.prototype.isub = function (num) {\n if (num.negative !== 0) {\n num.negative = 0;\n var r = this.iadd(num);\n return (num.negative = 1), r._normSign();\n } else if (this.negative !== 0)\n return (this.negative = 0), this.iadd(num), (this.negative = 1), this._normSign();\n var cmp = this.cmp(num);\n if (cmp === 0) return (this.negative = 0), (this.length = 1), (this.words[0] = 0), this;\n var a, b;\n cmp > 0 ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var carry = 0, i = 0; i < b.length; i++)\n (r = (a.words[i] | 0) - (b.words[i] | 0) + carry), (carry = r >> 26), (this.words[i] = r & 67108863);\n for (; carry !== 0 && i < a.length; i++)\n (r = (a.words[i] | 0) + carry), (carry = r >> 26), (this.words[i] = r & 67108863);\n if (carry === 0 && i < a.length && a !== this) for (; i < a.length; i++) this.words[i] = a.words[i];\n return (this.length = Math.max(this.length, i)), a !== this && (this.negative = 1), this.strip();\n }),\n (BN.prototype.sub = function (num) {\n return this.clone().isub(num);\n });\n function smallMulTo(self2, num, out) {\n out.negative = num.negative ^ self2.negative;\n var len = (self2.length + num.length) | 0;\n (out.length = len), (len = (len - 1) | 0);\n var a = self2.words[0] | 0,\n b = num.words[0] | 0,\n r = a * b,\n lo = r & 67108863,\n carry = (r / 67108864) | 0;\n out.words[0] = lo;\n for (var k = 1; k < len; k++) {\n for (\n var ncarry = carry >>> 26,\n rword = carry & 67108863,\n maxJ = Math.min(k, num.length - 1),\n j = Math.max(0, k - self2.length + 1);\n j <= maxJ;\n j++\n ) {\n var i = (k - j) | 0;\n (a = self2.words[i] | 0),\n (b = num.words[j] | 0),\n (r = a * b + rword),\n (ncarry += (r / 67108864) | 0),\n (rword = r & 67108863);\n }\n (out.words[k] = rword | 0), (carry = ncarry | 0);\n }\n return carry !== 0 ? (out.words[k] = carry | 0) : out.length--, out.strip();\n }\n var comb10MulTo = function (self2, num, out) {\n var a = self2.words,\n b = num.words,\n o = out.words,\n c = 0,\n lo,\n mid,\n hi,\n a0 = a[0] | 0,\n al0 = a0 & 8191,\n ah0 = a0 >>> 13,\n a1 = a[1] | 0,\n al1 = a1 & 8191,\n ah1 = a1 >>> 13,\n a2 = a[2] | 0,\n al2 = a2 & 8191,\n ah2 = a2 >>> 13,\n a3 = a[3] | 0,\n al3 = a3 & 8191,\n ah3 = a3 >>> 13,\n a4 = a[4] | 0,\n al4 = a4 & 8191,\n ah4 = a4 >>> 13,\n a5 = a[5] | 0,\n al5 = a5 & 8191,\n ah5 = a5 >>> 13,\n a6 = a[6] | 0,\n al6 = a6 & 8191,\n ah6 = a6 >>> 13,\n a7 = a[7] | 0,\n al7 = a7 & 8191,\n ah7 = a7 >>> 13,\n a8 = a[8] | 0,\n al8 = a8 & 8191,\n ah8 = a8 >>> 13,\n a9 = a[9] | 0,\n al9 = a9 & 8191,\n ah9 = a9 >>> 13,\n b0 = b[0] | 0,\n bl0 = b0 & 8191,\n bh0 = b0 >>> 13,\n b1 = b[1] | 0,\n bl1 = b1 & 8191,\n bh1 = b1 >>> 13,\n b2 = b[2] | 0,\n bl2 = b2 & 8191,\n bh2 = b2 >>> 13,\n b3 = b[3] | 0,\n bl3 = b3 & 8191,\n bh3 = b3 >>> 13,\n b4 = b[4] | 0,\n bl4 = b4 & 8191,\n bh4 = b4 >>> 13,\n b5 = b[5] | 0,\n bl5 = b5 & 8191,\n bh5 = b5 >>> 13,\n b6 = b[6] | 0,\n bl6 = b6 & 8191,\n bh6 = b6 >>> 13,\n b7 = b[7] | 0,\n bl7 = b7 & 8191,\n bh7 = b7 >>> 13,\n b8 = b[8] | 0,\n bl8 = b8 & 8191,\n bh8 = b8 >>> 13,\n b9 = b[9] | 0,\n bl9 = b9 & 8191,\n bh9 = b9 >>> 13;\n (out.negative = self2.negative ^ num.negative),\n (out.length = 19),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w0 >>> 26)) | 0),\n (w0 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w1 >>> 26)) | 0),\n (w1 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w2 >>> 26)) | 0),\n (w2 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w3 >>> 26)) | 0),\n (w3 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w4 >>> 26)) | 0),\n (w4 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w5 >>> 26)) | 0),\n (w5 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w6 >>> 26)) | 0),\n (w6 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w7 >>> 26)) | 0),\n (w7 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w8 >>> 26)) | 0),\n (w8 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w9 >>> 26)) | 0),\n (w9 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w10 >>> 26)) | 0),\n (w10 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w11 >>> 26)) | 0),\n (w11 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w12 >>> 26)) | 0),\n (w12 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w13 >>> 26)) | 0),\n (w13 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w14 >>> 26)) | 0),\n (w14 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w15 >>> 26)) | 0),\n (w15 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w16 >>> 26)) | 0),\n (w16 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w17 >>> 26)) | 0),\n (w17 &= 67108863),\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 & 8191) << 13)) | 0;\n return (\n (c = (((hi + (mid >>> 13)) | 0) + (w18 >>> 26)) | 0),\n (w18 &= 67108863),\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 c !== 0 && ((o[19] = c), out.length++),\n out\n );\n };\n Math.imul || (comb10MulTo = smallMulTo);\n function bigMulTo(self2, num, out) {\n (out.negative = num.negative ^ self2.negative), (out.length = self2.length + num.length);\n for (var carry = 0, hncarry = 0, k = 0; k < out.length - 1; k++) {\n var ncarry = hncarry;\n hncarry = 0;\n for (\n var rword = carry & 67108863, maxJ = Math.min(k, num.length - 1), j = Math.max(0, k - self2.length + 1);\n j <= maxJ;\n j++\n ) {\n var i = k - j,\n a = self2.words[i] | 0,\n b = num.words[j] | 0,\n r = a * b,\n lo = r & 67108863;\n (ncarry = (ncarry + ((r / 67108864) | 0)) | 0),\n (lo = (lo + rword) | 0),\n (rword = lo & 67108863),\n (ncarry = (ncarry + (lo >>> 26)) | 0),\n (hncarry += ncarry >>> 26),\n (ncarry &= 67108863);\n }\n (out.words[k] = rword), (carry = ncarry), (ncarry = hncarry);\n }\n return carry !== 0 ? (out.words[k] = carry) : out.length--, out.strip();\n }\n function jumboMulTo(self2, num, out) {\n var fftm = new FFTM();\n return fftm.mulp(self2, num, out);\n }\n BN.prototype.mulTo = function (num, out) {\n var res,\n len = this.length + num.length;\n return (\n this.length === 10 && num.length === 10\n ? (res = comb10MulTo(this, num, out))\n : len < 63\n ? (res = smallMulTo(this, num, out))\n : len < 1024\n ? (res = bigMulTo(this, num, out))\n : (res = jumboMulTo(this, num, out)),\n res\n );\n };\n function FFTM(x, y) {\n (this.x = x), (this.y = y);\n }\n (FFTM.prototype.makeRBT = function (N) {\n for (var t = new Array(N), l = BN.prototype._countBits(N) - 1, i = 0; i < N; i++) t[i] = this.revBin(i, l, N);\n return t;\n }),\n (FFTM.prototype.revBin = function (x, l, N) {\n if (x === 0 || x === N - 1) return x;\n for (var rb = 0, i = 0; i < l; i++) (rb |= (x & 1) << (l - i - 1)), (x >>= 1);\n return rb;\n }),\n (FFTM.prototype.permute = function (rbt, rws, iws, rtws, itws, N) {\n for (var i = 0; i < N; i++) (rtws[i] = rws[rbt[i]]), (itws[i] = iws[rbt[i]]);\n }),\n (FFTM.prototype.transform = function (rws, iws, rtws, itws, N, rbt) {\n this.permute(rbt, rws, iws, rtws, itws, N);\n for (var s = 1; s < N; s <<= 1)\n for (\n var l = s << 1, rtwdf = Math.cos((2 * Math.PI) / l), itwdf = Math.sin((2 * Math.PI) / l), p = 0;\n p < N;\n p += l\n )\n for (var rtwdf_ = rtwdf, itwdf_ = itwdf, j = 0; j < s; j++) {\n var re = rtws[p + j],\n ie = itws[p + j],\n ro = rtws[p + j + s],\n io = itws[p + j + s],\n rx = rtwdf_ * ro - itwdf_ * io;\n (io = rtwdf_ * io + itwdf_ * ro),\n (ro = rx),\n (rtws[p + j] = re + ro),\n (itws[p + j] = ie + io),\n (rtws[p + j + s] = re - ro),\n (itws[p + j + s] = ie - io),\n j !== l &&\n ((rx = rtwdf * rtwdf_ - itwdf * itwdf_), (itwdf_ = rtwdf * itwdf_ + itwdf * rtwdf_), (rtwdf_ = rx));\n }\n }),\n (FFTM.prototype.guessLen13b = function (n, m) {\n var N = Math.max(m, n) | 1,\n odd = N & 1,\n i = 0;\n for (N = (N / 2) | 0; N; N = N >>> 1) i++;\n return 1 << (i + 1 + odd);\n }),\n (FFTM.prototype.conjugate = function (rws, iws, N) {\n if (!(N <= 1))\n for (var i = 0; i < N / 2; i++) {\n var t = rws[i];\n (rws[i] = rws[N - i - 1]),\n (rws[N - i - 1] = t),\n (t = iws[i]),\n (iws[i] = -iws[N - i - 1]),\n (iws[N - i - 1] = -t);\n }\n }),\n (FFTM.prototype.normalize13b = function (ws, N) {\n for (var carry = 0, i = 0; i < N / 2; i++) {\n var w = Math.round(ws[2 * i + 1] / N) * 8192 + Math.round(ws[2 * i] / N) + carry;\n (ws[i] = w & 67108863), w < 67108864 ? (carry = 0) : (carry = (w / 67108864) | 0);\n }\n return ws;\n }),\n (FFTM.prototype.convert13b = function (ws, len, rws, N) {\n for (var carry = 0, i = 0; i < len; i++)\n (carry = carry + (ws[i] | 0)),\n (rws[2 * i] = carry & 8191),\n (carry = carry >>> 13),\n (rws[2 * i + 1] = carry & 8191),\n (carry = carry >>> 13);\n for (i = 2 * len; i < N; ++i) rws[i] = 0;\n assert(carry === 0), assert((carry & -8192) === 0);\n }),\n (FFTM.prototype.stub = function (N) {\n for (var ph = new Array(N), i = 0; i < N; i++) ph[i] = 0;\n return ph;\n }),\n (FFTM.prototype.mulp = function (x, y, out) {\n var N = 2 * this.guessLen13b(x.length, y.length),\n rbt = this.makeRBT(N),\n _ = this.stub(N),\n rws = new Array(N),\n rwst = new Array(N),\n iwst = new Array(N),\n nrws = new Array(N),\n nrwst = new Array(N),\n niwst = new Array(N),\n rmws = out.words;\n (rmws.length = N),\n this.convert13b(x.words, x.length, rws, N),\n this.convert13b(y.words, y.length, nrws, N),\n this.transform(rws, _, rwst, iwst, N, rbt),\n this.transform(nrws, _, nrwst, niwst, N, rbt);\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]), (rwst[i] = rx);\n }\n return (\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 (out.negative = x.negative ^ y.negative),\n (out.length = x.length + y.length),\n out.strip()\n );\n }),\n (BN.prototype.mul = function (num) {\n var out = new BN(null);\n return (out.words = new Array(this.length + num.length)), this.mulTo(num, out);\n }),\n (BN.prototype.mulf = function (num) {\n var out = new BN(null);\n return (out.words = new Array(this.length + num.length)), jumboMulTo(this, num, out);\n }),\n (BN.prototype.imul = function (num) {\n return this.clone().mulTo(num, this);\n }),\n (BN.prototype.imuln = function (num) {\n assert(typeof num == \"number\"), assert(num < 67108864);\n for (var carry = 0, i = 0; i < this.length; i++) {\n var w = (this.words[i] | 0) * num,\n lo = (w & 67108863) + (carry & 67108863);\n (carry >>= 26), (carry += (w / 67108864) | 0), (carry += lo >>> 26), (this.words[i] = lo & 67108863);\n }\n return carry !== 0 && ((this.words[i] = carry), this.length++), this;\n }),\n (BN.prototype.muln = function (num) {\n return this.clone().imuln(num);\n }),\n (BN.prototype.sqr = function () {\n return this.mul(this);\n }),\n (BN.prototype.isqr = function () {\n return this.imul(this.clone());\n }),\n (BN.prototype.pow = function (num) {\n var w = toBitArray(num);\n if (w.length === 0) return new BN(1);\n for (var res = this, i = 0; i < w.length && w[i] === 0; i++, res = res.sqr());\n if (++i < w.length) for (var q = res.sqr(); i < w.length; i++, q = q.sqr()) w[i] !== 0 && (res = res.mul(q));\n return res;\n }),\n (BN.prototype.iushln = function (bits) {\n assert(typeof bits == \"number\" && bits >= 0);\n var r = bits % 26,\n s = (bits - r) / 26,\n carryMask = (67108863 >>> (26 - r)) << (26 - r),\n i;\n if (r !== 0) {\n var carry = 0;\n for (i = 0; i < this.length; i++) {\n var newCarry = this.words[i] & carryMask,\n c = ((this.words[i] | 0) - newCarry) << r;\n (this.words[i] = c | carry), (carry = newCarry >>> (26 - r));\n }\n carry && ((this.words[i] = carry), this.length++);\n }\n if (s !== 0) {\n for (i = this.length - 1; i >= 0; i--) this.words[i + s] = this.words[i];\n for (i = 0; i < s; i++) this.words[i] = 0;\n this.length += s;\n }\n return this.strip();\n }),\n (BN.prototype.ishln = function (bits) {\n return assert(this.negative === 0), this.iushln(bits);\n }),\n (BN.prototype.iushrn = function (bits, hint, extended) {\n assert(typeof bits == \"number\" && bits >= 0);\n var h;\n hint ? (h = (hint - (hint % 26)) / 26) : (h = 0);\n var r = bits % 26,\n s = Math.min((bits - r) / 26, this.length),\n mask = 67108863 ^ ((67108863 >>> r) << r),\n maskedWords = extended;\n if (((h -= s), (h = Math.max(0, h)), maskedWords)) {\n for (var i = 0; i < s; i++) maskedWords.words[i] = this.words[i];\n maskedWords.length = s;\n }\n if (s !== 0)\n if (this.length > s) for (this.length -= s, i = 0; i < this.length; i++) this.words[i] = this.words[i + s];\n else (this.words[0] = 0), (this.length = 1);\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)), (carry = word & mask);\n }\n return (\n maskedWords && carry !== 0 && (maskedWords.words[maskedWords.length++] = carry),\n this.length === 0 && ((this.words[0] = 0), (this.length = 1)),\n this.strip()\n );\n }),\n (BN.prototype.ishrn = function (bits, hint, extended) {\n return assert(this.negative === 0), this.iushrn(bits, hint, extended);\n }),\n (BN.prototype.shln = function (bits) {\n return this.clone().ishln(bits);\n }),\n (BN.prototype.ushln = function (bits) {\n return this.clone().iushln(bits);\n }),\n (BN.prototype.shrn = function (bits) {\n return this.clone().ishrn(bits);\n }),\n (BN.prototype.ushrn = function (bits) {\n return this.clone().iushrn(bits);\n }),\n (BN.prototype.testn = function (bit) {\n assert(typeof bit == \"number\" && bit >= 0);\n var r = bit % 26,\n s = (bit - r) / 26,\n q = 1 << r;\n if (this.length <= s) return !1;\n var w = this.words[s];\n return !!(w & q);\n }),\n (BN.prototype.imaskn = function (bits) {\n assert(typeof bits == \"number\" && bits >= 0);\n var r = bits % 26,\n s = (bits - r) / 26;\n if ((assert(this.negative === 0, \"imaskn works only with positive numbers\"), this.length <= s)) return this;\n if ((r !== 0 && s++, (this.length = Math.min(s, this.length)), r !== 0)) {\n var mask = 67108863 ^ ((67108863 >>> r) << r);\n this.words[this.length - 1] &= mask;\n }\n return this.strip();\n }),\n (BN.prototype.maskn = function (bits) {\n return this.clone().imaskn(bits);\n }),\n (BN.prototype.iaddn = function (num) {\n return (\n assert(typeof num == \"number\"),\n assert(num < 67108864),\n num < 0\n ? this.isubn(-num)\n : this.negative !== 0\n ? this.length === 1 && (this.words[0] | 0) < num\n ? ((this.words[0] = num - (this.words[0] | 0)), (this.negative = 0), this)\n : ((this.negative = 0), this.isubn(num), (this.negative = 1), this)\n : this._iaddn(num)\n );\n }),\n (BN.prototype._iaddn = function (num) {\n this.words[0] += num;\n for (var i = 0; i < this.length && this.words[i] >= 67108864; i++)\n (this.words[i] -= 67108864), i === this.length - 1 ? (this.words[i + 1] = 1) : this.words[i + 1]++;\n return (this.length = Math.max(this.length, i + 1)), this;\n }),\n (BN.prototype.isubn = function (num) {\n if ((assert(typeof num == \"number\"), assert(num < 67108864), num < 0)) return this.iaddn(-num);\n if (this.negative !== 0) return (this.negative = 0), this.iaddn(num), (this.negative = 1), this;\n if (((this.words[0] -= num), this.length === 1 && this.words[0] < 0))\n (this.words[0] = -this.words[0]), (this.negative = 1);\n else\n for (var i = 0; i < this.length && this.words[i] < 0; i++)\n (this.words[i] += 67108864), (this.words[i + 1] -= 1);\n return this.strip();\n }),\n (BN.prototype.addn = function (num) {\n return this.clone().iaddn(num);\n }),\n (BN.prototype.subn = function (num) {\n return this.clone().isubn(num);\n }),\n (BN.prototype.iabs = function () {\n return (this.negative = 0), this;\n }),\n (BN.prototype.abs = function () {\n return this.clone().iabs();\n }),\n (BN.prototype._ishlnsubmul = function (num, mul, shift) {\n var len = num.length + shift,\n i;\n this._expand(len);\n var w,\n 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 & 67108863),\n (carry = (w >> 26) - ((right / 67108864) | 0)),\n (this.words[i + shift] = w & 67108863);\n }\n for (; i < this.length - shift; i++)\n (w = (this.words[i + shift] | 0) + carry), (carry = w >> 26), (this.words[i + shift] = w & 67108863);\n if (carry === 0) return this.strip();\n for (assert(carry === -1), carry = 0, i = 0; i < this.length; i++)\n (w = -(this.words[i] | 0) + carry), (carry = w >> 26), (this.words[i] = w & 67108863);\n return (this.negative = 1), this.strip();\n }),\n (BN.prototype._wordDiv = function (num, mode) {\n var shift = this.length - num.length,\n a = this.clone(),\n b = num,\n bhi = b.words[b.length - 1] | 0,\n bhiBits = this._countBits(bhi);\n (shift = 26 - bhiBits),\n shift !== 0 && ((b = b.ushln(shift)), a.iushln(shift), (bhi = b.words[b.length - 1] | 0));\n var m = a.length - b.length,\n q;\n if (mode !== \"mod\") {\n (q = new BN(null)), (q.length = m + 1), (q.words = new Array(q.length));\n for (var i = 0; i < q.length; i++) q.words[i] = 0;\n }\n var diff = a.clone()._ishlnsubmul(b, 1, m);\n diff.negative === 0 && ((a = diff), q && (q.words[m] = 1));\n for (var j = m - 1; j >= 0; j--) {\n var qj = (a.words[b.length + j] | 0) * 67108864 + (a.words[b.length + j - 1] | 0);\n for (qj = Math.min((qj / bhi) | 0, 67108863), a._ishlnsubmul(b, qj, j); a.negative !== 0; )\n qj--, (a.negative = 0), a._ishlnsubmul(b, 1, j), a.isZero() || (a.negative ^= 1);\n q && (q.words[j] = qj);\n }\n return (\n q && q.strip(),\n a.strip(),\n mode !== \"div\" && shift !== 0 && a.iushrn(shift),\n {\n div: q || null,\n mod: a,\n }\n );\n }),\n (BN.prototype.divmod = function (num, mode, positive) {\n if ((assert(!num.isZero()), this.isZero()))\n return {\n div: new BN(0),\n mod: new BN(0),\n };\n var div, mod, res;\n return this.negative !== 0 && num.negative === 0\n ? ((res = this.neg().divmod(num, mode)),\n mode !== \"mod\" && (div = res.div.neg()),\n mode !== \"div\" && ((mod = res.mod.neg()), positive && mod.negative !== 0 && mod.iadd(num)),\n {\n div,\n mod,\n })\n : this.negative === 0 && num.negative !== 0\n ? ((res = this.divmod(num.neg(), mode)),\n mode !== \"mod\" && (div = res.div.neg()),\n {\n div,\n mod: res.mod,\n })\n : (this.negative & num.negative) !== 0\n ? ((res = this.neg().divmod(num.neg(), mode)),\n mode !== \"div\" && ((mod = res.mod.neg()), positive && mod.negative !== 0 && mod.isub(num)),\n {\n div: res.div,\n mod,\n })\n : num.length > this.length || this.cmp(num) < 0\n ? {\n div: new BN(0),\n mod: this,\n }\n : num.length === 1\n ? mode === \"div\"\n ? {\n div: this.divn(num.words[0]),\n mod: null,\n }\n : mode === \"mod\"\n ? {\n div: null,\n mod: new BN(this.modn(num.words[0])),\n }\n : {\n div: this.divn(num.words[0]),\n mod: new BN(this.modn(num.words[0])),\n }\n : this._wordDiv(num, mode);\n }),\n (BN.prototype.div = function (num) {\n return this.divmod(num, \"div\", !1).div;\n }),\n (BN.prototype.mod = function (num) {\n return this.divmod(num, \"mod\", !1).mod;\n }),\n (BN.prototype.umod = function (num) {\n return this.divmod(num, \"mod\", !0).mod;\n }),\n (BN.prototype.divRound = function (num) {\n var dm = this.divmod(num);\n if (dm.mod.isZero()) return dm.div;\n var mod = dm.div.negative !== 0 ? dm.mod.isub(num) : dm.mod,\n half = num.ushrn(1),\n r2 = num.andln(1),\n cmp = mod.cmp(half);\n return cmp < 0 || (r2 === 1 && cmp === 0)\n ? dm.div\n : dm.div.negative !== 0\n ? dm.div.isubn(1)\n : dm.div.iaddn(1);\n }),\n (BN.prototype.modn = function (num) {\n assert(num <= 67108863);\n for (var p = (1 << 26) % num, acc = 0, i = this.length - 1; i >= 0; i--)\n acc = (p * acc + (this.words[i] | 0)) % num;\n return acc;\n }),\n (BN.prototype.idivn = function (num) {\n assert(num <= 67108863);\n for (var carry = 0, i = this.length - 1; i >= 0; i--) {\n var w = (this.words[i] | 0) + carry * 67108864;\n (this.words[i] = (w / num) | 0), (carry = w % num);\n }\n return this.strip();\n }),\n (BN.prototype.divn = function (num) {\n return this.clone().idivn(num);\n }),\n (BN.prototype.egcd = function (p) {\n assert(p.negative === 0), assert(!p.isZero());\n var x = this,\n y = p.clone();\n x.negative !== 0 ? (x = x.umod(p)) : (x = x.clone());\n for (var A = new BN(1), B = new BN(0), C = new BN(0), D = new BN(1), g = 0; x.isEven() && y.isEven(); )\n x.iushrn(1), y.iushrn(1), ++g;\n for (var yp = y.clone(), xp = x.clone(); !x.isZero(); ) {\n for (var i = 0, im = 1; (x.words[0] & im) === 0 && i < 26; ++i, im <<= 1);\n if (i > 0)\n for (x.iushrn(i); i-- > 0; )\n (A.isOdd() || B.isOdd()) && (A.iadd(yp), B.isub(xp)), A.iushrn(1), B.iushrn(1);\n for (var j = 0, jm = 1; (y.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n if (j > 0)\n for (y.iushrn(j); j-- > 0; )\n (C.isOdd() || D.isOdd()) && (C.iadd(yp), D.isub(xp)), C.iushrn(1), D.iushrn(1);\n x.cmp(y) >= 0 ? (x.isub(y), A.isub(C), B.isub(D)) : (y.isub(x), C.isub(A), D.isub(B));\n }\n return {\n a: C,\n b: D,\n gcd: y.iushln(g),\n };\n }),\n (BN.prototype._invmp = function (p) {\n assert(p.negative === 0), assert(!p.isZero());\n var a = this,\n b = p.clone();\n a.negative !== 0 ? (a = a.umod(p)) : (a = a.clone());\n for (var x1 = new BN(1), x2 = new BN(0), delta = b.clone(); 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) for (a.iushrn(i); i-- > 0; ) x1.isOdd() && x1.iadd(delta), x1.iushrn(1);\n for (var j = 0, jm = 1; (b.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n if (j > 0) for (b.iushrn(j); j-- > 0; ) x2.isOdd() && x2.iadd(delta), x2.iushrn(1);\n a.cmp(b) >= 0 ? (a.isub(b), x1.isub(x2)) : (b.isub(a), x2.isub(x1));\n }\n var res;\n return a.cmpn(1) === 0 ? (res = x1) : (res = x2), res.cmpn(0) < 0 && res.iadd(p), res;\n }),\n (BN.prototype.gcd = function (num) {\n if (this.isZero()) return num.abs();\n if (num.isZero()) return this.abs();\n var a = this.clone(),\n b = num.clone();\n (a.negative = 0), (b.negative = 0);\n for (var shift = 0; a.isEven() && b.isEven(); shift++) a.iushrn(1), b.iushrn(1);\n do {\n for (; a.isEven(); ) a.iushrn(1);\n for (; b.isEven(); ) b.iushrn(1);\n var r = a.cmp(b);\n if (r < 0) {\n var t = a;\n (a = b), (b = t);\n } else if (r === 0 || b.cmpn(1) === 0) break;\n a.isub(b);\n } while (!0);\n return b.iushln(shift);\n }),\n (BN.prototype.invm = function (num) {\n return this.egcd(num).a.umod(num);\n }),\n (BN.prototype.isEven = function () {\n return (this.words[0] & 1) === 0;\n }),\n (BN.prototype.isOdd = function () {\n return (this.words[0] & 1) === 1;\n }),\n (BN.prototype.andln = function (num) {\n return this.words[0] & num;\n }),\n (BN.prototype.bincn = function (bit) {\n assert(typeof bit == \"number\");\n var r = bit % 26,\n s = (bit - r) / 26,\n q = 1 << r;\n if (this.length <= s) return this._expand(s + 1), (this.words[s] |= q), this;\n for (var carry = q, i = s; carry !== 0 && i < this.length; i++) {\n var w = this.words[i] | 0;\n (w += carry), (carry = w >>> 26), (w &= 67108863), (this.words[i] = w);\n }\n return carry !== 0 && ((this.words[i] = carry), this.length++), this;\n }),\n (BN.prototype.isZero = function () {\n return this.length === 1 && this.words[0] === 0;\n }),\n (BN.prototype.cmpn = function (num) {\n var negative = num < 0;\n if (this.negative !== 0 && !negative) return -1;\n if (this.negative === 0 && negative) return 1;\n this.strip();\n var res;\n if (this.length > 1) res = 1;\n else {\n negative && (num = -num), assert(num <= 67108863, \"Number is too big\");\n var w = this.words[0] | 0;\n res = w === num ? 0 : w < num ? -1 : 1;\n }\n return this.negative !== 0 ? -res | 0 : res;\n }),\n (BN.prototype.cmp = function (num) {\n if (this.negative !== 0 && num.negative === 0) return -1;\n if (this.negative === 0 && num.negative !== 0) return 1;\n var res = this.ucmp(num);\n return this.negative !== 0 ? -res | 0 : res;\n }),\n (BN.prototype.ucmp = function (num) {\n if (this.length > num.length) return 1;\n if (this.length < num.length) return -1;\n for (var res = 0, i = this.length - 1; i >= 0; i--) {\n var a = this.words[i] | 0,\n b = num.words[i] | 0;\n if (a !== b) {\n a < b ? (res = -1) : a > b && (res = 1);\n break;\n }\n }\n return res;\n }),\n (BN.prototype.gtn = function (num) {\n return this.cmpn(num) === 1;\n }),\n (BN.prototype.gt = function (num) {\n return this.cmp(num) === 1;\n }),\n (BN.prototype.gten = function (num) {\n return this.cmpn(num) >= 0;\n }),\n (BN.prototype.gte = function (num) {\n return this.cmp(num) >= 0;\n }),\n (BN.prototype.ltn = function (num) {\n return this.cmpn(num) === -1;\n }),\n (BN.prototype.lt = function (num) {\n return this.cmp(num) === -1;\n }),\n (BN.prototype.lten = function (num) {\n return this.cmpn(num) <= 0;\n }),\n (BN.prototype.lte = function (num) {\n return this.cmp(num) <= 0;\n }),\n (BN.prototype.eqn = function (num) {\n return this.cmpn(num) === 0;\n }),\n (BN.prototype.eq = function (num) {\n return this.cmp(num) === 0;\n }),\n (BN.red = function (num) {\n return new Red(num);\n }),\n (BN.prototype.toRed = function (ctx) {\n return (\n assert(!this.red, \"Already a number in reduction context\"),\n assert(this.negative === 0, \"red works only with positives\"),\n ctx.convertTo(this)._forceRed(ctx)\n );\n }),\n (BN.prototype.fromRed = function () {\n return assert(this.red, \"fromRed works only with numbers in reduction context\"), this.red.convertFrom(this);\n }),\n (BN.prototype._forceRed = function (ctx) {\n return (this.red = ctx), this;\n }),\n (BN.prototype.forceRed = function (ctx) {\n return assert(!this.red, \"Already a number in reduction context\"), this._forceRed(ctx);\n }),\n (BN.prototype.redAdd = function (num) {\n return assert(this.red, \"redAdd works only with red numbers\"), this.red.add(this, num);\n }),\n (BN.prototype.redIAdd = function (num) {\n return assert(this.red, \"redIAdd works only with red numbers\"), this.red.iadd(this, num);\n }),\n (BN.prototype.redSub = function (num) {\n return assert(this.red, \"redSub works only with red numbers\"), this.red.sub(this, num);\n }),\n (BN.prototype.redISub = function (num) {\n return assert(this.red, \"redISub works only with red numbers\"), this.red.isub(this, num);\n }),\n (BN.prototype.redShl = function (num) {\n return assert(this.red, \"redShl works only with red numbers\"), this.red.shl(this, num);\n }),\n (BN.prototype.redMul = function (num) {\n return (\n assert(this.red, \"redMul works only with red numbers\"),\n this.red._verify2(this, num),\n this.red.mul(this, num)\n );\n }),\n (BN.prototype.redIMul = function (num) {\n return (\n assert(this.red, \"redMul works only with red numbers\"),\n this.red._verify2(this, num),\n this.red.imul(this, num)\n );\n }),\n (BN.prototype.redSqr = function () {\n return assert(this.red, \"redSqr works only with red numbers\"), this.red._verify1(this), this.red.sqr(this);\n }),\n (BN.prototype.redISqr = function () {\n return assert(this.red, \"redISqr works only with red numbers\"), this.red._verify1(this), this.red.isqr(this);\n }),\n (BN.prototype.redSqrt = function () {\n return assert(this.red, \"redSqrt works only with red numbers\"), this.red._verify1(this), this.red.sqrt(this);\n }),\n (BN.prototype.redInvm = function () {\n return assert(this.red, \"redInvm works only with red numbers\"), this.red._verify1(this), this.red.invm(this);\n }),\n (BN.prototype.redNeg = function () {\n return assert(this.red, \"redNeg works only with red numbers\"), this.red._verify1(this), this.red.neg(this);\n }),\n (BN.prototype.redPow = function (num) {\n return assert(this.red && !num.red, \"redPow(normalNum)\"), this.red._verify1(this), this.red.pow(this, num);\n });\n var primes = {\n k256: null,\n p224: null,\n p192: null,\n p25519: null,\n };\n function MPrime(name, p) {\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 (this.tmp = this._tmp());\n }\n (MPrime.prototype._tmp = function () {\n var tmp = new BN(null);\n return (tmp.words = new Array(Math.ceil(this.n / 13))), tmp;\n }),\n (MPrime.prototype.ireduce = function (num) {\n var r = num,\n rlen;\n do this.split(r, this.tmp), (r = this.imulK(r)), (r = r.iadd(this.tmp)), (rlen = r.bitLength());\n while (rlen > this.n);\n var cmp = rlen < this.n ? -1 : r.ucmp(this.p);\n return (\n cmp === 0\n ? ((r.words[0] = 0), (r.length = 1))\n : cmp > 0\n ? r.isub(this.p)\n : r.strip !== void 0\n ? r.strip()\n : r._strip(),\n r\n );\n }),\n (MPrime.prototype.split = function (input, out) {\n input.iushrn(this.n, 0, out);\n }),\n (MPrime.prototype.imulK = function (num) {\n return num.imul(this.k);\n });\n function K256() {\n MPrime.call(this, \"k256\", \"ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f\");\n }\n inherits(K256, MPrime),\n (K256.prototype.split = function (input, output) {\n for (var mask = 4194303, outLen = Math.min(input.length, 9), i = 0; i < outLen; i++)\n output.words[i] = input.words[i];\n if (((output.length = outLen), input.length <= 9)) {\n (input.words[0] = 0), (input.length = 1);\n return;\n }\n var prev = input.words[9];\n for (output.words[output.length++] = prev & mask, i = 10; i < input.length; i++) {\n var next = input.words[i] | 0;\n (input.words[i - 10] = ((next & mask) << 4) | (prev >>> 22)), (prev = next);\n }\n (prev >>>= 22),\n (input.words[i - 10] = prev),\n prev === 0 && input.length > 10 ? (input.length -= 10) : (input.length -= 9);\n }),\n (K256.prototype.imulK = function (num) {\n (num.words[num.length] = 0), (num.words[num.length + 1] = 0), (num.length += 2);\n for (var lo = 0, i = 0; i < num.length; i++) {\n var w = num.words[i] | 0;\n (lo += w * 977), (num.words[i] = lo & 67108863), (lo = w * 64 + ((lo / 67108864) | 0));\n }\n return (\n num.words[num.length - 1] === 0 && (num.length--, num.words[num.length - 1] === 0 && num.length--), num\n );\n });\n function P224() {\n MPrime.call(this, \"p224\", \"ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001\");\n }\n inherits(P224, MPrime);\n function P192() {\n MPrime.call(this, \"p192\", \"ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff\");\n }\n inherits(P192, MPrime);\n function P25519() {\n MPrime.call(this, \"25519\", \"7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed\");\n }\n inherits(P25519, MPrime),\n (P25519.prototype.imulK = function (num) {\n for (var carry = 0, i = 0; i < num.length; i++) {\n var hi = (num.words[i] | 0) * 19 + carry,\n lo = hi & 67108863;\n (hi >>>= 26), (num.words[i] = lo), (carry = hi);\n }\n return carry !== 0 && (num.words[num.length++] = carry), num;\n }),\n (BN._prime = function (name) {\n if (primes[name]) return primes[name];\n var prime2;\n if (name === \"k256\") prime2 = new K256();\n else if (name === \"p224\") prime2 = new P224();\n else if (name === \"p192\") prime2 = new P192();\n else if (name === \"p25519\") prime2 = new P25519();\n else throw new Error(\"Unknown prime \" + name);\n return (primes[name] = prime2), prime2;\n });\n function Red(m) {\n if (typeof m == \"string\") {\n var prime = BN._prime(m);\n (this.m = prime.p), (this.prime = prime);\n } else assert(m.gtn(1), \"modulus must be greater than 1\"), (this.m = m), (this.prime = null);\n }\n (Red.prototype._verify1 = function (a) {\n assert(a.negative === 0, \"red works only with positives\"), assert(a.red, \"red works only with red numbers\");\n }),\n (Red.prototype._verify2 = function (a, b) {\n assert((a.negative | b.negative) === 0, \"red works only with positives\"),\n assert(a.red && a.red === b.red, \"red works only with red numbers\");\n }),\n (Red.prototype.imod = function (a) {\n return this.prime ? this.prime.ireduce(a)._forceRed(this) : a.umod(this.m)._forceRed(this);\n }),\n (Red.prototype.neg = function (a) {\n return a.isZero() ? a.clone() : this.m.sub(a)._forceRed(this);\n }),\n (Red.prototype.add = function (a, b) {\n this._verify2(a, b);\n var res = a.add(b);\n return res.cmp(this.m) >= 0 && res.isub(this.m), res._forceRed(this);\n }),\n (Red.prototype.iadd = function (a, b) {\n this._verify2(a, b);\n var res = a.iadd(b);\n return res.cmp(this.m) >= 0 && res.isub(this.m), res;\n }),\n (Red.prototype.sub = function (a, b) {\n this._verify2(a, b);\n var res = a.sub(b);\n return res.cmpn(0) < 0 && res.iadd(this.m), res._forceRed(this);\n }),\n (Red.prototype.isub = function (a, b) {\n this._verify2(a, b);\n var res = a.isub(b);\n return res.cmpn(0) < 0 && res.iadd(this.m), res;\n }),\n (Red.prototype.shl = function (a, num) {\n return this._verify1(a), this.imod(a.ushln(num));\n }),\n (Red.prototype.imul = function (a, b) {\n return this._verify2(a, b), this.imod(a.imul(b));\n }),\n (Red.prototype.mul = function (a, b) {\n return this._verify2(a, b), this.imod(a.mul(b));\n }),\n (Red.prototype.isqr = function (a) {\n return this.imul(a, a.clone());\n }),\n (Red.prototype.sqr = function (a) {\n return this.mul(a, a);\n }),\n (Red.prototype.sqrt = function (a) {\n if (a.isZero()) return a.clone();\n var mod3 = this.m.andln(3);\n if ((assert(mod3 % 2 === 1), mod3 === 3)) {\n var pow = this.m.add(new BN(1)).iushrn(2);\n return this.pow(a, pow);\n }\n for (var q = this.m.subn(1), s = 0; !q.isZero() && q.andln(1) === 0; ) s++, q.iushrn(1);\n assert(!q.isZero());\n var one = new BN(1).toRed(this),\n nOne = one.redNeg(),\n lpow = this.m.subn(1).iushrn(1),\n z = this.m.bitLength();\n for (z = new BN(2 * z * z).toRed(this); this.pow(z, lpow).cmp(nOne) !== 0; ) z.redIAdd(nOne);\n for (\n var c = this.pow(z, q), r = this.pow(a, q.addn(1).iushrn(1)), t = this.pow(a, q), m = s;\n t.cmp(one) !== 0;\n\n ) {\n for (var tmp = t, i = 0; tmp.cmp(one) !== 0; i++) tmp = tmp.redSqr();\n assert(i < m);\n var b = this.pow(c, new BN(1).iushln(m - i - 1));\n (r = r.redMul(b)), (c = b.redSqr()), (t = t.redMul(c)), (m = i);\n }\n return r;\n }),\n (Red.prototype.invm = function (a) {\n var inv = a._invmp(this.m);\n return inv.negative !== 0 ? ((inv.negative = 0), this.imod(inv).redNeg()) : this.imod(inv);\n }),\n (Red.prototype.pow = function (a, num) {\n if (num.isZero()) return new BN(1).toRed(this);\n if (num.cmpn(1) === 0) return a.clone();\n var windowSize = 4,\n wnd = new Array(1 << windowSize);\n (wnd[0] = new BN(1).toRed(this)), (wnd[1] = a);\n for (var i = 2; i < wnd.length; i++) wnd[i] = this.mul(wnd[i - 1], a);\n var res = wnd[0],\n current = 0,\n currentLen = 0,\n start = num.bitLength() % 26;\n for (start === 0 && (start = 26), i = num.length - 1; i >= 0; i--) {\n for (var word = num.words[i], j = start - 1; j >= 0; j--) {\n var bit = (word >> j) & 1;\n if ((res !== wnd[0] && (res = this.sqr(res)), bit === 0 && current === 0)) {\n currentLen = 0;\n continue;\n }\n (current <<= 1),\n (current |= bit),\n currentLen++,\n !(currentLen !== windowSize && (i !== 0 || j !== 0)) &&\n ((res = this.mul(res, wnd[current])), (currentLen = 0), (current = 0));\n }\n start = 26;\n }\n return res;\n }),\n (Red.prototype.convertTo = function (num) {\n var r = num.umod(this.m);\n return r === num ? r.clone() : r;\n }),\n (Red.prototype.convertFrom = function (num) {\n var res = num.clone();\n return (res.red = null), res;\n }),\n (BN.mont = function (num) {\n return new Mont(num);\n });\n function Mont(m) {\n Red.call(this, m),\n (this.shift = this.m.bitLength()),\n this.shift % 26 !== 0 && (this.shift += 26 - (this.shift % 26)),\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 (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 (Mont.prototype.convertTo = function (num) {\n return this.imod(num.ushln(this.shift));\n }),\n (Mont.prototype.convertFrom = function (num) {\n var r = this.imod(num.mul(this.rinv));\n return (r.red = null), r;\n }),\n (Mont.prototype.imul = function (a, b) {\n if (a.isZero() || b.isZero()) return (a.words[0] = 0), (a.length = 1), a;\n var t = a.imul(b),\n c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m),\n u = t.isub(c).iushrn(this.shift),\n res = u;\n return (\n u.cmp(this.m) >= 0 ? (res = u.isub(this.m)) : u.cmpn(0) < 0 && (res = u.iadd(this.m)), res._forceRed(this)\n );\n }),\n (Mont.prototype.mul = function (a, b) {\n if (a.isZero() || b.isZero()) return new BN(0)._forceRed(this);\n var t = a.mul(b),\n c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m),\n u = t.isub(c).iushrn(this.shift),\n res = u;\n return (\n u.cmp(this.m) >= 0 ? (res = u.isub(this.m)) : u.cmpn(0) < 0 && (res = u.iadd(this.m)), res._forceRed(this)\n );\n }),\n (Mont.prototype.invm = function (a) {\n var res = this.imod(a._invmp(this.m).mul(this.r2));\n return res._forceRed(this);\n });\n })(typeof module > \"u\" || module, exports);\n },\n});\n\n// (disabled):node_modules/crypto-browserify/index.js\nvar require_crypto_browserify = __commonJS({\n \"(disabled):node_modules/crypto-browserify/index.js\"() {},\n});\n\n// node_modules/brorand/index.js\nvar require_brorand = __commonJS({\n \"node_modules/brorand/index.js\"(exports, module) {\n var r;\n module.exports = function (len) {\n return r || (r = new Rand(null)), r.generate(len);\n };\n function Rand(rand) {\n this.rand = rand;\n }\n module.exports.Rand = Rand;\n Rand.prototype.generate = function (len) {\n return this._rand(len);\n };\n Rand.prototype._rand = function (n) {\n var out = new Buffer(n);\n crypto.getRandomValues(out);\n return out;\n };\n },\n});\n\n// node_modules/miller-rabin/lib/mr.js\nvar require_mr = __commonJS({\n \"node_modules/miller-rabin/lib/mr.js\"(exports, module) {\n var bn = require_bn2(),\n brorand = require_brorand();\n function MillerRabin(rand) {\n this.rand = rand || new brorand.Rand();\n }\n module.exports = MillerRabin;\n MillerRabin.create = function (rand) {\n return new MillerRabin(rand);\n };\n MillerRabin.prototype._randbelow = function (n) {\n var len = n.bitLength(),\n min_bytes = Math.ceil(len / 8);\n do var a = new bn(this.rand.generate(min_bytes));\n while (a.cmp(n) >= 0);\n return a;\n };\n MillerRabin.prototype._randrange = function (start, stop) {\n var size = stop.sub(start);\n return start.add(this._randbelow(size));\n };\n MillerRabin.prototype.test = function (n, k, cb) {\n var len = n.bitLength(),\n red = bn.mont(n),\n rone = new bn(1).toRed(red);\n k || (k = Math.max(1, (len / 48) | 0));\n for (var n1 = n.subn(1), s = 0; !n1.testn(s); s++);\n for (var d = n.shrn(s), rn1 = n1.toRed(red), prime = !0; k > 0; k--) {\n var a = this._randrange(new bn(2), n1);\n cb && cb(a);\n var x = a.toRed(red).redPow(d);\n if (!(x.cmp(rone) === 0 || x.cmp(rn1) === 0)) {\n for (var i = 1; i < s; i++) {\n if (((x = x.redSqr()), x.cmp(rone) === 0)) return !1;\n if (x.cmp(rn1) === 0) break;\n }\n if (i === s) return !1;\n }\n }\n return prime;\n };\n MillerRabin.prototype.getDivisor = function (n, k) {\n var len = n.bitLength(),\n red = bn.mont(n),\n rone = new bn(1).toRed(red);\n k || (k = Math.max(1, (len / 48) | 0));\n for (var n1 = n.subn(1), s = 0; !n1.testn(s); s++);\n for (var d = n.shrn(s), rn1 = n1.toRed(red); k > 0; k--) {\n var a = this._randrange(new bn(2), n1),\n g = n.gcd(a);\n if (g.cmpn(1) !== 0) return g;\n var x = a.toRed(red).redPow(d);\n if (!(x.cmp(rone) === 0 || x.cmp(rn1) === 0)) {\n for (var i = 1; i < s; i++) {\n if (((x = x.redSqr()), x.cmp(rone) === 0)) return x.fromRed().subn(1).gcd(n);\n if (x.cmp(rn1) === 0) break;\n }\n if (i === s) return (x = x.redSqr()), x.fromRed().subn(1).gcd(n);\n }\n }\n return !1;\n };\n },\n});\n\n// node_modules/diffie-hellman/lib/generatePrime.js\nvar require_generatePrime = __commonJS({\n \"node_modules/diffie-hellman/lib/generatePrime.js\"(exports, module) {\n var randomBytes = require_browser();\n module.exports = findPrime;\n findPrime.simpleSieve = simpleSieve;\n findPrime.fermatTest = fermatTest;\n var BN = require_bn(),\n TWENTYFOUR = new BN(24),\n MillerRabin = require_mr(),\n millerRabin = new MillerRabin(),\n ONE = new BN(1),\n TWO = new BN(2),\n FIVE = new BN(5),\n SIXTEEN = new BN(16),\n EIGHT = new BN(8),\n TEN = new BN(10),\n THREE = new BN(3),\n SEVEN = new BN(7),\n ELEVEN = new BN(11),\n FOUR = new BN(4),\n TWELVE = new BN(12),\n primes = null;\n function _getPrimes() {\n if (primes !== null) return primes;\n var limit = 1048576,\n res = [];\n res[0] = 2;\n for (var i = 1, k = 3; k < limit; k += 2) {\n for (var sqrt = Math.ceil(Math.sqrt(k)), j = 0; j < i && res[j] <= sqrt && k % res[j] !== 0; j++);\n (i !== j && res[j] <= sqrt) || (res[i++] = k);\n }\n return (primes = res), res;\n }\n function simpleSieve(p) {\n for (var primes2 = _getPrimes(), i = 0; i < primes2.length; i++)\n if (p.modn(primes2[i]) === 0) return p.cmpn(primes2[i]) === 0;\n return !0;\n }\n function fermatTest(p) {\n var red = BN.mont(p);\n return TWO.toRed(red).redPow(p.subn(1)).fromRed().cmpn(1) === 0;\n }\n function findPrime(bits, gen) {\n if (bits < 16) return gen === 2 || gen === 5 ? new BN([140, 123]) : new BN([140, 39]);\n gen = new BN(gen);\n for (var num, n2; ; ) {\n for (num = new BN(randomBytes(Math.ceil(bits / 8))); num.bitLength() > bits; ) num.ishrn(1);\n if ((num.isEven() && num.iadd(ONE), num.testn(1) || num.iadd(TWO), gen.cmp(TWO))) {\n if (!gen.cmp(FIVE)) for (; num.mod(TEN).cmp(THREE); ) num.iadd(FOUR);\n } else for (; num.mod(TWENTYFOUR).cmp(ELEVEN); ) num.iadd(FOUR);\n if (\n ((n2 = num.shrn(1)),\n simpleSieve(n2) &&\n simpleSieve(num) &&\n fermatTest(n2) &&\n fermatTest(num) &&\n millerRabin.test(n2) &&\n millerRabin.test(num))\n )\n return num;\n }\n }\n },\n});\n\n// node_modules/diffie-hellman/lib/primes.json\nvar require_primes = __commonJS({\n \"node_modules/diffie-hellman/lib/primes.json\"(exports, module) {\n module.exports = {\n modp1: {\n gen: \"02\",\n prime:\n \"ffffffffffffffffc90fdaa22168c234c4c6628b80dc1cd129024e088a67cc74020bbea63b139b22514a08798e3404ddef9519b3cd3a431b302b0a6df25f14374fe1356d6d51c245e485b576625e7ec6f44c42e9a63a3620ffffffffffffffff\",\n },\n modp2: {\n gen: \"02\",\n prime:\n \"ffffffffffffffffc90fdaa22168c234c4c6628b80dc1cd129024e088a67cc74020bbea63b139b22514a08798e3404ddef9519b3cd3a431b302b0a6df25f14374fe1356d6d51c245e485b576625e7ec6f44c42e9a637ed6b0bff5cb6f406b7edee386bfb5a899fa5ae9f24117c4b1fe649286651ece65381ffffffffffffffff\",\n },\n modp5: {\n gen: \"02\",\n prime:\n \"ffffffffffffffffc90fdaa22168c234c4c6628b80dc1cd129024e088a67cc74020bbea63b139b22514a08798e3404ddef9519b3cd3a431b302b0a6df25f14374fe1356d6d51c245e485b576625e7ec6f44c42e9a637ed6b0bff5cb6f406b7edee386bfb5a899fa5ae9f24117c4b1fe649286651ece45b3dc2007cb8a163bf0598da48361c55d39a69163fa8fd24cf5f83655d23dca3ad961c62f356208552bb9ed529077096966d670c354e4abc9804f1746c08ca237327ffffffffffffffff\",\n },\n modp14: {\n gen: \"02\",\n prime:\n \"ffffffffffffffffc90fdaa22168c234c4c6628b80dc1cd129024e088a67cc74020bbea63b139b22514a08798e3404ddef9519b3cd3a431b302b0a6df25f14374fe1356d6d51c245e485b576625e7ec6f44c42e9a637ed6b0bff5cb6f406b7edee386bfb5a899fa5ae9f24117c4b1fe649286651ece45b3dc2007cb8a163bf0598da48361c55d39a69163fa8fd24cf5f83655d23dca3ad961c62f356208552bb9ed529077096966d670c354e4abc9804f1746c08ca18217c32905e462e36ce3be39e772c180e86039b2783a2ec07a28fb5c55df06f4c52c9de2bcbf6955817183995497cea956ae515d2261898fa051015728e5a8aacaa68ffffffffffffffff\",\n },\n modp15: {\n gen: \"02\",\n prime:\n \"ffffffffffffffffc90fdaa22168c234c4c6628b80dc1cd129024e088a67cc74020bbea63b139b22514a08798e3404ddef9519b3cd3a431b302b0a6df25f14374fe1356d6d51c245e485b576625e7ec6f44c42e9a637ed6b0bff5cb6f406b7edee386bfb5a899fa5ae9f24117c4b1fe649286651ece45b3dc2007cb8a163bf0598da48361c55d39a69163fa8fd24cf5f83655d23dca3ad961c62f356208552bb9ed529077096966d670c354e4abc9804f1746c08ca18217c32905e462e36ce3be39e772c180e86039b2783a2ec07a28fb5c55df06f4c52c9de2bcbf6955817183995497cea956ae515d2261898fa051015728e5a8aaac42dad33170d04507a33a85521abdf1cba64ecfb850458dbef0a8aea71575d060c7db3970f85a6e1e4c7abf5ae8cdb0933d71e8c94e04a25619dcee3d2261ad2ee6bf12ffa06d98a0864d87602733ec86a64521f2b18177b200cbbe117577a615d6c770988c0bad946e208e24fa074e5ab3143db5bfce0fd108e4b82d120a93ad2caffffffffffffffff\",\n },\n modp16: {\n gen: \"02\",\n prime:\n \"ffffffffffffffffc90fdaa22168c234c4c6628b80dc1cd129024e088a67cc74020bbea63b139b22514a08798e3404ddef9519b3cd3a431b302b0a6df25f14374fe1356d6d51c245e485b576625e7ec6f44c42e9a637ed6b0bff5cb6f406b7edee386bfb5a899fa5ae9f24117c4b1fe649286651ece45b3dc2007cb8a163bf0598da48361c55d39a69163fa8fd24cf5f83655d23dca3ad961c62f356208552bb9ed529077096966d670c354e4abc9804f1746c08ca18217c32905e462e36ce3be39e772c180e86039b2783a2ec07a28fb5c55df06f4c52c9de2bcbf6955817183995497cea956ae515d2261898fa051015728e5a8aaac42dad33170d04507a33a85521abdf1cba64ecfb850458dbef0a8aea71575d060c7db3970f85a6e1e4c7abf5ae8cdb0933d71e8c94e04a25619dcee3d2261ad2ee6bf12ffa06d98a0864d87602733ec86a64521f2b18177b200cbbe117577a615d6c770988c0bad946e208e24fa074e5ab3143db5bfce0fd108e4b82d120a92108011a723c12a787e6d788719a10bdba5b2699c327186af4e23c1a946834b6150bda2583e9ca2ad44ce8dbbbc2db04de8ef92e8efc141fbecaa6287c59474e6bc05d99b2964fa090c3a2233ba186515be7ed1f612970cee2d7afb81bdd762170481cd0069127d5b05aa993b4ea988d8fddc186ffb7dc90a6c08f4df435c934063199ffffffffffffffff\",\n },\n modp17: {\n gen: \"02\",\n prime:\n \"ffffffffffffffffc90fdaa22168c234c4c6628b80dc1cd129024e088a67cc74020bbea63b139b22514a08798e3404ddef9519b3cd3a431b302b0a6df25f14374fe1356d6d51c245e485b576625e7ec6f44c42e9a637ed6b0bff5cb6f406b7edee386bfb5a899fa5ae9f24117c4b1fe649286651ece45b3dc2007cb8a163bf0598da48361c55d39a69163fa8fd24cf5f83655d23dca3ad961c62f356208552bb9ed529077096966d670c354e4abc9804f1746c08ca18217c32905e462e36ce3be39e772c180e86039b2783a2ec07a28fb5c55df06f4c52c9de2bcbf6955817183995497cea956ae515d2261898fa051015728e5a8aaac42dad33170d04507a33a85521abdf1cba64ecfb850458dbef0a8aea71575d060c7db3970f85a6e1e4c7abf5ae8cdb0933d71e8c94e04a25619dcee3d2261ad2ee6bf12ffa06d98a0864d87602733ec86a64521f2b18177b200cbbe117577a615d6c770988c0bad946e208e24fa074e5ab3143db5bfce0fd108e4b82d120a92108011a723c12a787e6d788719a10bdba5b2699c327186af4e23c1a946834b6150bda2583e9ca2ad44ce8dbbbc2db04de8ef92e8efc141fbecaa6287c59474e6bc05d99b2964fa090c3a2233ba186515be7ed1f612970cee2d7afb81bdd762170481cd0069127d5b05aa993b4ea988d8fddc186ffb7dc90a6c08f4df435c93402849236c3fab4d27c7026c1d4dcb2602646dec9751e763dba37bdf8ff9406ad9e530ee5db382f413001aeb06a53ed9027d831179727b0865a8918da3edbebcf9b14ed44ce6cbaced4bb1bdb7f1447e6cc254b332051512bd7af426fb8f401378cd2bf5983ca01c64b92ecf032ea15d1721d03f482d7ce6e74fef6d55e702f46980c82b5a84031900b1c9e59e7c97fbec7e8f323a97a7e36cc88be0f1d45b7ff585ac54bd407b22b4154aacc8f6d7ebf48e1d814cc5ed20f8037e0a79715eef29be32806a1d58bb7c5da76f550aa3d8a1fbff0eb19ccb1a313d55cda56c9ec2ef29632387fe8d76e3c0468043e8f663f4860ee12bf2d5b0b7474d6e694f91e6dcc4024ffffffffffffffff\",\n },\n modp18: {\n gen: \"02\",\n prime:\n \"ffffffffffffffffc90fdaa22168c234c4c6628b80dc1cd129024e088a67cc74020bbea63b139b22514a08798e3404ddef9519b3cd3a431b302b0a6df25f14374fe1356d6d51c245e485b576625e7ec6f44c42e9a637ed6b0bff5cb6f406b7edee386bfb5a899fa5ae9f24117c4b1fe649286651ece45b3dc2007cb8a163bf0598da48361c55d39a69163fa8fd24cf5f83655d23dca3ad961c62f356208552bb9ed529077096966d670c354e4abc9804f1746c08ca18217c32905e462e36ce3be39e772c180e86039b2783a2ec07a28fb5c55df06f4c52c9de2bcbf6955817183995497cea956ae515d2261898fa051015728e5a8aaac42dad33170d04507a33a85521abdf1cba64ecfb850458dbef0a8aea71575d060c7db3970f85a6e1e4c7abf5ae8cdb0933d71e8c94e04a25619dcee3d2261ad2ee6bf12ffa06d98a0864d87602733ec86a64521f2b18177b200cbbe117577a615d6c770988c0bad946e208e24fa074e5ab3143db5bfce0fd108e4b82d120a92108011a723c12a787e6d788719a10bdba5b2699c327186af4e23c1a946834b6150bda2583e9ca2ad44ce8dbbbc2db04de8ef92e8efc141fbecaa6287c59474e6bc05d99b2964fa090c3a2233ba186515be7ed1f612970cee2d7afb81bdd762170481cd0069127d5b05aa993b4ea988d8fddc186ffb7dc90a6c08f4df435c93402849236c3fab4d27c7026c1d4dcb2602646dec9751e763dba37bdf8ff9406ad9e530ee5db382f413001aeb06a53ed9027d831179727b0865a8918da3edbebcf9b14ed44ce6cbaced4bb1bdb7f1447e6cc254b332051512bd7af426fb8f401378cd2bf5983ca01c64b92ecf032ea15d1721d03f482d7ce6e74fef6d55e702f46980c82b5a84031900b1c9e59e7c97fbec7e8f323a97a7e36cc88be0f1d45b7ff585ac54bd407b22b4154aacc8f6d7ebf48e1d814cc5ed20f8037e0a79715eef29be32806a1d58bb7c5da76f550aa3d8a1fbff0eb19ccb1a313d55cda56c9ec2ef29632387fe8d76e3c0468043e8f663f4860ee12bf2d5b0b7474d6e694f91e6dbe115974a3926f12fee5e438777cb6a932df8cd8bec4d073b931ba3bc832b68d9dd300741fa7bf8afc47ed2576f6936ba424663aab639c5ae4f5683423b4742bf1c978238f16cbe39d652de3fdb8befc848ad922222e04a4037c0713eb57a81a23f0c73473fc646cea306b4bcbc8862f8385ddfa9d4b7fa2c087e879683303ed5bdd3a062b3cf5b3a278a66d2a13f83f44f82ddf310ee074ab6a364597e899a0255dc164f31cc50846851df9ab48195ded7ea1b1d510bd7ee74d73faf36bc31ecfa268359046f4eb879f924009438b481c6cd7889a002ed5ee382bc9190da6fc026e479558e4475677e9aa9e3050e2765694dfc81f56e880b96e7160c980dd98edd3dfffffffffffffffff\",\n },\n };\n },\n});\n\n// node_modules/diffie-hellman/lib/dh.js\nvar require_dh = __commonJS({\n \"node_modules/diffie-hellman/lib/dh.js\"(exports, module) {\n var BN = require_bn(),\n MillerRabin = require_mr(),\n millerRabin = new MillerRabin(),\n TWENTYFOUR = new BN(24),\n ELEVEN = new BN(11),\n TEN = new BN(10),\n THREE = new BN(3),\n SEVEN = new BN(7),\n primes = require_generatePrime(),\n randomBytes = require_browser();\n module.exports = DH;\n function setPublicKey(pub, enc) {\n return (\n (enc = enc || \"utf8\"), Buffer.isBuffer(pub) || (pub = new Buffer(pub, enc)), (this._pub = new BN(pub)), this\n );\n }\n function setPrivateKey(priv, enc) {\n return (\n (enc = enc || \"utf8\"),\n Buffer.isBuffer(priv) || (priv = new Buffer(priv, enc)),\n (this._priv = new BN(priv)),\n this\n );\n }\n var primeCache = {};\n function checkPrime(prime, generator) {\n var gen = generator.toString(\"hex\"),\n hex = [gen, prime.toString(16)].join(\"_\");\n if (hex in primeCache) return primeCache[hex];\n var error = 0;\n if (prime.isEven() || !primes.simpleSieve || !primes.fermatTest(prime) || !millerRabin.test(prime))\n return (\n (error += 1), gen === \"02\" || gen === \"05\" ? (error += 8) : (error += 4), (primeCache[hex] = error), error\n );\n millerRabin.test(prime.shrn(1)) || (error += 2);\n var rem;\n switch (gen) {\n case \"02\":\n prime.mod(TWENTYFOUR).cmp(ELEVEN) && (error += 8);\n break;\n case \"05\":\n (rem = prime.mod(TEN)), rem.cmp(THREE) && rem.cmp(SEVEN) && (error += 8);\n break;\n default:\n error += 4;\n }\n return (primeCache[hex] = error), error;\n }\n function DH(prime, generator, malleable) {\n this.setGenerator(generator),\n (this.__prime = new BN(prime)),\n (this._prime = BN.mont(this.__prime)),\n (this._primeLen = prime.length),\n (this._pub = void 0),\n (this._priv = void 0),\n (this._primeCode = void 0),\n malleable ? ((this.setPublicKey = setPublicKey), (this.setPrivateKey = setPrivateKey)) : (this._primeCode = 8);\n }\n Object.defineProperty(DH.prototype, \"verifyError\", {\n enumerable: !0,\n get: function () {\n return (\n typeof this._primeCode != \"number\" && (this._primeCode = checkPrime(this.__prime, this.__gen)),\n this._primeCode\n );\n },\n });\n DH.prototype.generateKeys = function () {\n return (\n this._priv || (this._priv = new BN(randomBytes(this._primeLen))),\n (this._pub = this._gen.toRed(this._prime).redPow(this._priv).fromRed()),\n this.getPublicKey()\n );\n };\n DH.prototype.computeSecret = function (other) {\n (other = new BN(other)), (other = other.toRed(this._prime));\n var secret = other.redPow(this._priv).fromRed(),\n out = new Buffer(secret.toArray()),\n prime = this.getPrime();\n if (out.length < prime.length) {\n var front = new Buffer(prime.length - out.length);\n front.fill(0), (out = Buffer.concat([front, out]));\n }\n return out;\n };\n DH.prototype.getPublicKey = function (enc) {\n return formatReturnValue(this._pub, enc);\n };\n DH.prototype.getPrivateKey = function (enc) {\n return formatReturnValue(this._priv, enc);\n };\n DH.prototype.getPrime = function (enc) {\n return formatReturnValue(this.__prime, enc);\n };\n DH.prototype.getGenerator = function (enc) {\n return formatReturnValue(this._gen, enc);\n };\n DH.prototype.setGenerator = function (gen, enc) {\n return (\n (enc = enc || \"utf8\"),\n Buffer.isBuffer(gen) || (gen = new Buffer(gen, enc)),\n (this.__gen = gen),\n (this._gen = new BN(gen)),\n this\n );\n };\n function formatReturnValue(bn, enc) {\n var buf = new Buffer(bn.toArray());\n return enc ? buf.toString(enc) : buf;\n }\n },\n});\n\n// node_modules/diffie-hellman/browser.js\nvar require_browser7 = __commonJS({\n \"node_modules/diffie-hellman/browser.js\"(exports) {\n var generatePrime = require_generatePrime(),\n primes = require_primes(),\n DH = require_dh();\n function getDiffieHellman(mod) {\n var prime = new Buffer(primes[mod].prime, \"hex\"),\n gen = new Buffer(primes[mod].gen, \"hex\");\n return new DH(prime, gen);\n }\n var ENCODINGS = {\n binary: !0,\n hex: !0,\n base64: !0,\n };\n function createDiffieHellman(prime, enc, generator, genc) {\n return Buffer.isBuffer(enc) || ENCODINGS[enc] === void 0\n ? createDiffieHellman(prime, \"binary\", enc, generator)\n : ((enc = enc || \"binary\"),\n (genc = genc || \"binary\"),\n (generator = generator || new Buffer([2])),\n Buffer.isBuffer(generator) || (generator = new Buffer(generator, genc)),\n typeof prime == \"number\"\n ? new DH(generatePrime(prime, generator), generator, !0)\n : (Buffer.isBuffer(prime) || (prime = new Buffer(prime, enc)), new DH(prime, generator, !0)));\n }\n exports.DiffieHellmanGroup = exports.createDiffieHellmanGroup = exports.getDiffieHellman = getDiffieHellman;\n exports.createDiffieHellman = exports.DiffieHellman = createDiffieHellman;\n },\n});\n\n// node_modules/bn.js/lib/bn.js\nvar require_bn3 = __commonJS({\n \"node_modules/bn.js/lib/bn.js\"(exports, module) {\n (function (module2, exports2) {\n \"use strict\";\n function assert(val, msg) {\n if (!val) throw new Error(msg || \"Assertion failed\");\n }\n function inherits(ctor, superCtor) {\n ctor.super_ = superCtor;\n var TempCtor = function () {};\n (TempCtor.prototype = superCtor.prototype),\n (ctor.prototype = new TempCtor()),\n (ctor.prototype.constructor = ctor);\n }\n function BN(number, base, endian) {\n if (BN.isBN(number)) return number;\n (this.negative = 0),\n (this.words = null),\n (this.length = 0),\n (this.red = null),\n number !== null &&\n ((base === \"le\" || base === \"be\") && ((endian = base), (base = 10)),\n this._init(number || 0, base || 10, endian || \"be\"));\n }\n typeof module2 == \"object\" ? (module2.exports = BN) : (exports2.BN = BN), (BN.BN = BN), (BN.wordSize = 26);\n var Buffer2;\n try {\n typeof window < \"u\" && typeof window.Buffer < \"u\"\n ? (Buffer2 = window.Buffer)\n : (Buffer2 = __require(\"buffer\").Buffer);\n } catch {}\n (BN.isBN = function (num) {\n return num instanceof BN\n ? !0\n : num !== null &&\n typeof num == \"object\" &&\n num.constructor.wordSize === BN.wordSize &&\n Array.isArray(num.words);\n }),\n (BN.max = function (left, right) {\n return left.cmp(right) > 0 ? left : right;\n }),\n (BN.min = function (left, right) {\n return left.cmp(right) < 0 ? left : right;\n }),\n (BN.prototype._init = function (number, base, endian) {\n if (typeof number == \"number\") return this._initNumber(number, base, endian);\n if (typeof number == \"object\") return this._initArray(number, base, endian);\n base === \"hex\" && (base = 16),\n assert(base === (base | 0) && base >= 2 && base <= 36),\n (number = number.toString().replace(/\\s+/g, \"\"));\n var start = 0;\n number[0] === \"-\" && (start++, (this.negative = 1)),\n start < number.length &&\n (base === 16\n ? this._parseHex(number, start, endian)\n : (this._parseBase(number, base, start),\n endian === \"le\" && this._initArray(this.toArray(), base, endian)));\n }),\n (BN.prototype._initNumber = function (number, base, endian) {\n number < 0 && ((this.negative = 1), (number = -number)),\n number < 67108864\n ? ((this.words = [number & 67108863]), (this.length = 1))\n : number < 4503599627370496\n ? ((this.words = [number & 67108863, (number / 67108864) & 67108863]), (this.length = 2))\n : (assert(number < 9007199254740992),\n (this.words = [number & 67108863, (number / 67108864) & 67108863, 1]),\n (this.length = 3)),\n endian === \"le\" && this._initArray(this.toArray(), base, endian);\n }),\n (BN.prototype._initArray = function (number, base, endian) {\n if ((assert(typeof number.length == \"number\"), number.length <= 0))\n return (this.words = [0]), (this.length = 1), this;\n (this.length = Math.ceil(number.length / 3)), (this.words = new Array(this.length));\n for (var i = 0; i < this.length; i++) this.words[i] = 0;\n var j,\n w,\n off = 0;\n if (endian === \"be\")\n for (i = number.length - 1, j = 0; i >= 0; i -= 3)\n (w = number[i] | (number[i - 1] << 8) | (number[i - 2] << 16)),\n (this.words[j] |= (w << off) & 67108863),\n (this.words[j + 1] = (w >>> (26 - off)) & 67108863),\n (off += 24),\n off >= 26 && ((off -= 26), j++);\n else if (endian === \"le\")\n for (i = 0, j = 0; i < number.length; i += 3)\n (w = number[i] | (number[i + 1] << 8) | (number[i + 2] << 16)),\n (this.words[j] |= (w << off) & 67108863),\n (this.words[j + 1] = (w >>> (26 - off)) & 67108863),\n (off += 24),\n off >= 26 && ((off -= 26), j++);\n return this._strip();\n });\n function parseHex4Bits(string, index) {\n var c = string.charCodeAt(index);\n if (c >= 48 && c <= 57) return c - 48;\n if (c >= 65 && c <= 70) return c - 55;\n if (c >= 97 && c <= 102) return c - 87;\n assert(!1, \"Invalid character in \" + string);\n }\n function parseHexByte(string, lowerBound, index) {\n var r = parseHex4Bits(string, index);\n return index - 1 >= lowerBound && (r |= parseHex4Bits(string, index - 1) << 4), r;\n }\n BN.prototype._parseHex = function (number, start, endian) {\n (this.length = Math.ceil((number.length - start) / 6)), (this.words = new Array(this.length));\n for (var i = 0; i < this.length; i++) this.words[i] = 0;\n var off = 0,\n j = 0,\n w;\n if (endian === \"be\")\n for (i = number.length - 1; i >= start; i -= 2)\n (w = parseHexByte(number, start, i) << off),\n (this.words[j] |= w & 67108863),\n off >= 18 ? ((off -= 18), (j += 1), (this.words[j] |= w >>> 26)) : (off += 8);\n else {\n var parseLength = number.length - start;\n for (i = parseLength % 2 === 0 ? start + 1 : start; i < number.length; i += 2)\n (w = parseHexByte(number, start, i) << off),\n (this.words[j] |= w & 67108863),\n off >= 18 ? ((off -= 18), (j += 1), (this.words[j] |= w >>> 26)) : (off += 8);\n }\n this._strip();\n };\n function parseBase(str, start, end, mul) {\n for (var r = 0, b = 0, len = Math.min(str.length, end), i = start; i < len; i++) {\n var c = str.charCodeAt(i) - 48;\n (r *= mul),\n c >= 49 ? (b = c - 49 + 10) : c >= 17 ? (b = c - 17 + 10) : (b = c),\n assert(c >= 0 && b < mul, \"Invalid character\"),\n (r += b);\n }\n return r;\n }\n (BN.prototype._parseBase = function (number, base, start) {\n (this.words = [0]), (this.length = 1);\n for (var limbLen = 0, limbPow = 1; limbPow <= 67108863; limbPow *= base) limbLen++;\n limbLen--, (limbPow = (limbPow / base) | 0);\n for (\n var total = number.length - start,\n mod = total % limbLen,\n end = Math.min(total, total - mod) + start,\n word = 0,\n i = start;\n i < end;\n i += limbLen\n )\n (word = parseBase(number, i, i + limbLen, base)),\n this.imuln(limbPow),\n this.words[0] + word < 67108864 ? (this.words[0] += word) : this._iaddn(word);\n if (mod !== 0) {\n var pow = 1;\n for (word = parseBase(number, i, number.length, base), i = 0; i < mod; i++) pow *= base;\n this.imuln(pow), this.words[0] + word < 67108864 ? (this.words[0] += word) : this._iaddn(word);\n }\n this._strip();\n }),\n (BN.prototype.copy = function (dest) {\n dest.words = new Array(this.length);\n for (var i = 0; i < this.length; i++) dest.words[i] = this.words[i];\n (dest.length = this.length), (dest.negative = this.negative), (dest.red = this.red);\n });\n function move(dest, src) {\n (dest.words = src.words), (dest.length = src.length), (dest.negative = src.negative), (dest.red = src.red);\n }\n if (\n ((BN.prototype._move = function (dest) {\n move(dest, this);\n }),\n (BN.prototype.clone = function () {\n var r = new BN(null);\n return this.copy(r), r;\n }),\n (BN.prototype._expand = function (size) {\n for (; this.length < size; ) this.words[this.length++] = 0;\n return this;\n }),\n (BN.prototype._strip = function () {\n for (; this.length > 1 && this.words[this.length - 1] === 0; ) this.length--;\n return this._normSign();\n }),\n (BN.prototype._normSign = function () {\n return this.length === 1 && this.words[0] === 0 && (this.negative = 0), this;\n }),\n typeof Symbol < \"u\" && typeof Symbol.for == \"function\")\n )\n try {\n BN.prototype[Symbol.for(\"nodejs.util.inspect.custom\")] = inspect;\n } catch {\n BN.prototype.inspect = inspect;\n }\n else BN.prototype.inspect = inspect;\n function inspect() {\n return (this.red ? \"<BN-R: \" : \"<BN: \") + this.toString(16) + \">\";\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 groupSizes = [\n 0, 0, 25, 16, 12, 11, 10, 9, 8, 8, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5,\n 5, 5,\n ],\n groupBases = [\n 0, 0, 33554432, 43046721, 16777216, 48828125, 60466176, 40353607, 16777216, 43046721, 1e7, 19487171, 35831808,\n 62748517, 7529536, 11390625, 16777216, 24137569, 34012224, 47045881, 64e6, 4084101, 5153632, 6436343, 7962624,\n 9765625, 11881376, 14348907, 17210368, 20511149, 243e5, 28629151, 33554432, 39135393, 45435424, 52521875,\n 60466176,\n ];\n (BN.prototype.toString = function (base, padding) {\n (base = base || 10), (padding = padding | 0 || 1);\n var out;\n if (base === 16 || base === \"hex\") {\n out = \"\";\n for (var off = 0, carry = 0, i = 0; i < this.length; i++) {\n var w = this.words[i],\n word = (((w << off) | carry) & 16777215).toString(16);\n (carry = (w >>> (24 - off)) & 16777215),\n (off += 2),\n off >= 26 && ((off -= 26), i--),\n carry !== 0 || i !== this.length - 1 ? (out = zeros[6 - word.length] + word + out) : (out = word + out);\n }\n for (carry !== 0 && (out = carry.toString(16) + out); out.length % padding !== 0; ) out = \"0\" + out;\n return this.negative !== 0 && (out = \"-\" + out), out;\n }\n if (base === (base | 0) && base >= 2 && base <= 36) {\n var groupSize = groupSizes[base],\n groupBase = groupBases[base];\n out = \"\";\n var c = this.clone();\n for (c.negative = 0; !c.isZero(); ) {\n var r = c.modrn(groupBase).toString(base);\n (c = c.idivn(groupBase)), c.isZero() ? (out = r + out) : (out = zeros[groupSize - r.length] + r + out);\n }\n for (this.isZero() && (out = \"0\" + out); out.length % padding !== 0; ) out = \"0\" + out;\n return this.negative !== 0 && (out = \"-\" + out), out;\n }\n assert(!1, \"Base should be between 2 and 36\");\n }),\n (BN.prototype.toNumber = function () {\n var ret = this.words[0];\n return (\n this.length === 2\n ? (ret += this.words[1] * 67108864)\n : this.length === 3 && this.words[2] === 1\n ? (ret += 4503599627370496 + this.words[1] * 67108864)\n : this.length > 2 && assert(!1, \"Number can only safely store up to 53 bits\"),\n this.negative !== 0 ? -ret : ret\n );\n }),\n (BN.prototype.toJSON = function () {\n return this.toString(16, 2);\n }),\n Buffer2 &&\n (BN.prototype.toBuffer = function (endian, length) {\n return this.toArrayLike(Buffer2, endian, length);\n }),\n (BN.prototype.toArray = function (endian, length) {\n return this.toArrayLike(Array, endian, length);\n });\n var allocate = function (ArrayType, size) {\n return ArrayType.allocUnsafe ? ArrayType.allocUnsafe(size) : new ArrayType(size);\n };\n (BN.prototype.toArrayLike = function (ArrayType, endian, length) {\n this._strip();\n var byteLength = this.byteLength(),\n 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 var res = allocate(ArrayType, reqLength),\n postfix = endian === \"le\" ? \"LE\" : \"BE\";\n return this[\"_toArrayLike\" + postfix](res, byteLength), res;\n }),\n (BN.prototype._toArrayLikeLE = function (res, byteLength) {\n for (var position = 0, carry = 0, i = 0, shift = 0; i < this.length; i++) {\n var word = (this.words[i] << shift) | carry;\n (res[position++] = word & 255),\n position < res.length && (res[position++] = (word >> 8) & 255),\n position < res.length && (res[position++] = (word >> 16) & 255),\n shift === 6\n ? (position < res.length && (res[position++] = (word >> 24) & 255), (carry = 0), (shift = 0))\n : ((carry = word >>> 24), (shift += 2));\n }\n if (position < res.length) for (res[position++] = carry; position < res.length; ) res[position++] = 0;\n }),\n (BN.prototype._toArrayLikeBE = function (res, byteLength) {\n for (var position = res.length - 1, carry = 0, i = 0, shift = 0; i < this.length; i++) {\n var word = (this.words[i] << shift) | carry;\n (res[position--] = word & 255),\n position >= 0 && (res[position--] = (word >> 8) & 255),\n position >= 0 && (res[position--] = (word >> 16) & 255),\n shift === 6\n ? (position >= 0 && (res[position--] = (word >> 24) & 255), (carry = 0), (shift = 0))\n : ((carry = word >>> 24), (shift += 2));\n }\n if (position >= 0) for (res[position--] = carry; position >= 0; ) res[position--] = 0;\n }),\n Math.clz32\n ? (BN.prototype._countBits = function (w) {\n return 32 - Math.clz32(w);\n })\n : (BN.prototype._countBits = function (w) {\n var t = w,\n r = 0;\n return (\n t >= 4096 && ((r += 13), (t >>>= 13)),\n t >= 64 && ((r += 7), (t >>>= 7)),\n t >= 8 && ((r += 4), (t >>>= 4)),\n t >= 2 && ((r += 2), (t >>>= 2)),\n r + t\n );\n }),\n (BN.prototype._zeroBits = function (w) {\n if (w === 0) return 26;\n var t = w,\n r = 0;\n return (\n (t & 8191) === 0 && ((r += 13), (t >>>= 13)),\n (t & 127) === 0 && ((r += 7), (t >>>= 7)),\n (t & 15) === 0 && ((r += 4), (t >>>= 4)),\n (t & 3) === 0 && ((r += 2), (t >>>= 2)),\n (t & 1) === 0 && r++,\n r\n );\n }),\n (BN.prototype.bitLength = function () {\n var w = this.words[this.length - 1],\n hi = this._countBits(w);\n return (this.length - 1) * 26 + hi;\n });\n function toBitArray(num) {\n for (var w = new Array(num.bitLength()), bit = 0; bit < w.length; bit++) {\n var off = (bit / 26) | 0,\n wbit = bit % 26;\n w[bit] = (num.words[off] >>> wbit) & 1;\n }\n return w;\n }\n (BN.prototype.zeroBits = function () {\n if (this.isZero()) return 0;\n for (var r = 0, i = 0; i < this.length; i++) {\n var b = this._zeroBits(this.words[i]);\n if (((r += b), b !== 26)) break;\n }\n return r;\n }),\n (BN.prototype.byteLength = function () {\n return Math.ceil(this.bitLength() / 8);\n }),\n (BN.prototype.toTwos = function (width) {\n return this.negative !== 0 ? this.abs().inotn(width).iaddn(1) : this.clone();\n }),\n (BN.prototype.fromTwos = function (width) {\n return this.testn(width - 1) ? this.notn(width).iaddn(1).ineg() : this.clone();\n }),\n (BN.prototype.isNeg = function () {\n return this.negative !== 0;\n }),\n (BN.prototype.neg = function () {\n return this.clone().ineg();\n }),\n (BN.prototype.ineg = function () {\n return this.isZero() || (this.negative ^= 1), this;\n }),\n (BN.prototype.iuor = function (num) {\n for (; this.length < num.length; ) this.words[this.length++] = 0;\n for (var i = 0; i < num.length; i++) this.words[i] = this.words[i] | num.words[i];\n return this._strip();\n }),\n (BN.prototype.ior = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuor(num);\n }),\n (BN.prototype.or = function (num) {\n return this.length > num.length ? this.clone().ior(num) : num.clone().ior(this);\n }),\n (BN.prototype.uor = function (num) {\n return this.length > num.length ? this.clone().iuor(num) : num.clone().iuor(this);\n }),\n (BN.prototype.iuand = function (num) {\n var b;\n this.length > num.length ? (b = num) : (b = this);\n for (var i = 0; i < b.length; i++) this.words[i] = this.words[i] & num.words[i];\n return (this.length = b.length), this._strip();\n }),\n (BN.prototype.iand = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuand(num);\n }),\n (BN.prototype.and = function (num) {\n return this.length > num.length ? this.clone().iand(num) : num.clone().iand(this);\n }),\n (BN.prototype.uand = function (num) {\n return this.length > num.length ? this.clone().iuand(num) : num.clone().iuand(this);\n }),\n (BN.prototype.iuxor = function (num) {\n var a, b;\n this.length > num.length ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var i = 0; i < b.length; i++) this.words[i] = a.words[i] ^ b.words[i];\n if (this !== a) for (; i < a.length; i++) this.words[i] = a.words[i];\n return (this.length = a.length), this._strip();\n }),\n (BN.prototype.ixor = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuxor(num);\n }),\n (BN.prototype.xor = function (num) {\n return this.length > num.length ? this.clone().ixor(num) : num.clone().ixor(this);\n }),\n (BN.prototype.uxor = function (num) {\n return this.length > num.length ? this.clone().iuxor(num) : num.clone().iuxor(this);\n }),\n (BN.prototype.inotn = function (width) {\n assert(typeof width == \"number\" && width >= 0);\n var bytesNeeded = Math.ceil(width / 26) | 0,\n bitsLeft = width % 26;\n this._expand(bytesNeeded), bitsLeft > 0 && bytesNeeded--;\n for (var i = 0; i < bytesNeeded; i++) this.words[i] = ~this.words[i] & 67108863;\n return bitsLeft > 0 && (this.words[i] = ~this.words[i] & (67108863 >> (26 - bitsLeft))), this._strip();\n }),\n (BN.prototype.notn = function (width) {\n return this.clone().inotn(width);\n }),\n (BN.prototype.setn = function (bit, val) {\n assert(typeof bit == \"number\" && bit >= 0);\n var off = (bit / 26) | 0,\n wbit = bit % 26;\n return (\n this._expand(off + 1),\n val\n ? (this.words[off] = this.words[off] | (1 << wbit))\n : (this.words[off] = this.words[off] & ~(1 << wbit)),\n this._strip()\n );\n }),\n (BN.prototype.iadd = function (num) {\n var r;\n if (this.negative !== 0 && num.negative === 0)\n return (this.negative = 0), (r = this.isub(num)), (this.negative ^= 1), this._normSign();\n if (this.negative === 0 && num.negative !== 0)\n return (num.negative = 0), (r = this.isub(num)), (num.negative = 1), r._normSign();\n var a, b;\n this.length > num.length ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var carry = 0, i = 0; i < b.length; i++)\n (r = (a.words[i] | 0) + (b.words[i] | 0) + carry), (this.words[i] = r & 67108863), (carry = r >>> 26);\n for (; carry !== 0 && i < a.length; i++)\n (r = (a.words[i] | 0) + carry), (this.words[i] = r & 67108863), (carry = r >>> 26);\n if (((this.length = a.length), carry !== 0)) (this.words[this.length] = carry), this.length++;\n else if (a !== this) for (; i < a.length; i++) this.words[i] = a.words[i];\n return this;\n }),\n (BN.prototype.add = function (num) {\n var res;\n return num.negative !== 0 && this.negative === 0\n ? ((num.negative = 0), (res = this.sub(num)), (num.negative ^= 1), res)\n : num.negative === 0 && this.negative !== 0\n ? ((this.negative = 0), (res = num.sub(this)), (this.negative = 1), res)\n : this.length > num.length\n ? this.clone().iadd(num)\n : num.clone().iadd(this);\n }),\n (BN.prototype.isub = function (num) {\n if (num.negative !== 0) {\n num.negative = 0;\n var r = this.iadd(num);\n return (num.negative = 1), r._normSign();\n } else if (this.negative !== 0)\n return (this.negative = 0), this.iadd(num), (this.negative = 1), this._normSign();\n var cmp = this.cmp(num);\n if (cmp === 0) return (this.negative = 0), (this.length = 1), (this.words[0] = 0), this;\n var a, b;\n cmp > 0 ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var carry = 0, i = 0; i < b.length; i++)\n (r = (a.words[i] | 0) - (b.words[i] | 0) + carry), (carry = r >> 26), (this.words[i] = r & 67108863);\n for (; carry !== 0 && i < a.length; i++)\n (r = (a.words[i] | 0) + carry), (carry = r >> 26), (this.words[i] = r & 67108863);\n if (carry === 0 && i < a.length && a !== this) for (; i < a.length; i++) this.words[i] = a.words[i];\n return (this.length = Math.max(this.length, i)), a !== this && (this.negative = 1), this._strip();\n }),\n (BN.prototype.sub = function (num) {\n return this.clone().isub(num);\n });\n function smallMulTo(self2, num, out) {\n out.negative = num.negative ^ self2.negative;\n var len = (self2.length + num.length) | 0;\n (out.length = len), (len = (len - 1) | 0);\n var a = self2.words[0] | 0,\n b = num.words[0] | 0,\n r = a * b,\n lo = r & 67108863,\n carry = (r / 67108864) | 0;\n out.words[0] = lo;\n for (var k = 1; k < len; k++) {\n for (\n var ncarry = carry >>> 26,\n rword = carry & 67108863,\n maxJ = Math.min(k, num.length - 1),\n j = Math.max(0, k - self2.length + 1);\n j <= maxJ;\n j++\n ) {\n var i = (k - j) | 0;\n (a = self2.words[i] | 0),\n (b = num.words[j] | 0),\n (r = a * b + rword),\n (ncarry += (r / 67108864) | 0),\n (rword = r & 67108863);\n }\n (out.words[k] = rword | 0), (carry = ncarry | 0);\n }\n return carry !== 0 ? (out.words[k] = carry | 0) : out.length--, out._strip();\n }\n var comb10MulTo = function (self2, num, out) {\n var a = self2.words,\n b = num.words,\n o = out.words,\n c = 0,\n lo,\n mid,\n hi,\n a0 = a[0] | 0,\n al0 = a0 & 8191,\n ah0 = a0 >>> 13,\n a1 = a[1] | 0,\n al1 = a1 & 8191,\n ah1 = a1 >>> 13,\n a2 = a[2] | 0,\n al2 = a2 & 8191,\n ah2 = a2 >>> 13,\n a3 = a[3] | 0,\n al3 = a3 & 8191,\n ah3 = a3 >>> 13,\n a4 = a[4] | 0,\n al4 = a4 & 8191,\n ah4 = a4 >>> 13,\n a5 = a[5] | 0,\n al5 = a5 & 8191,\n ah5 = a5 >>> 13,\n a6 = a[6] | 0,\n al6 = a6 & 8191,\n ah6 = a6 >>> 13,\n a7 = a[7] | 0,\n al7 = a7 & 8191,\n ah7 = a7 >>> 13,\n a8 = a[8] | 0,\n al8 = a8 & 8191,\n ah8 = a8 >>> 13,\n a9 = a[9] | 0,\n al9 = a9 & 8191,\n ah9 = a9 >>> 13,\n b0 = b[0] | 0,\n bl0 = b0 & 8191,\n bh0 = b0 >>> 13,\n b1 = b[1] | 0,\n bl1 = b1 & 8191,\n bh1 = b1 >>> 13,\n b2 = b[2] | 0,\n bl2 = b2 & 8191,\n bh2 = b2 >>> 13,\n b3 = b[3] | 0,\n bl3 = b3 & 8191,\n bh3 = b3 >>> 13,\n b4 = b[4] | 0,\n bl4 = b4 & 8191,\n bh4 = b4 >>> 13,\n b5 = b[5] | 0,\n bl5 = b5 & 8191,\n bh5 = b5 >>> 13,\n b6 = b[6] | 0,\n bl6 = b6 & 8191,\n bh6 = b6 >>> 13,\n b7 = b[7] | 0,\n bl7 = b7 & 8191,\n bh7 = b7 >>> 13,\n b8 = b[8] | 0,\n bl8 = b8 & 8191,\n bh8 = b8 >>> 13,\n b9 = b[9] | 0,\n bl9 = b9 & 8191,\n bh9 = b9 >>> 13;\n (out.negative = self2.negative ^ num.negative),\n (out.length = 19),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w0 >>> 26)) | 0),\n (w0 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w1 >>> 26)) | 0),\n (w1 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w2 >>> 26)) | 0),\n (w2 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w3 >>> 26)) | 0),\n (w3 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w4 >>> 26)) | 0),\n (w4 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w5 >>> 26)) | 0),\n (w5 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w6 >>> 26)) | 0),\n (w6 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w7 >>> 26)) | 0),\n (w7 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w8 >>> 26)) | 0),\n (w8 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w9 >>> 26)) | 0),\n (w9 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w10 >>> 26)) | 0),\n (w10 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w11 >>> 26)) | 0),\n (w11 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w12 >>> 26)) | 0),\n (w12 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w13 >>> 26)) | 0),\n (w13 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w14 >>> 26)) | 0),\n (w14 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w15 >>> 26)) | 0),\n (w15 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w16 >>> 26)) | 0),\n (w16 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w17 >>> 26)) | 0),\n (w17 &= 67108863),\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 & 8191) << 13)) | 0;\n return (\n (c = (((hi + (mid >>> 13)) | 0) + (w18 >>> 26)) | 0),\n (w18 &= 67108863),\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 c !== 0 && ((o[19] = c), out.length++),\n out\n );\n };\n Math.imul || (comb10MulTo = smallMulTo);\n function bigMulTo(self2, num, out) {\n (out.negative = num.negative ^ self2.negative), (out.length = self2.length + num.length);\n for (var carry = 0, hncarry = 0, k = 0; k < out.length - 1; k++) {\n var ncarry = hncarry;\n hncarry = 0;\n for (\n var rword = carry & 67108863, maxJ = Math.min(k, num.length - 1), j = Math.max(0, k - self2.length + 1);\n j <= maxJ;\n j++\n ) {\n var i = k - j,\n a = self2.words[i] | 0,\n b = num.words[j] | 0,\n r = a * b,\n lo = r & 67108863;\n (ncarry = (ncarry + ((r / 67108864) | 0)) | 0),\n (lo = (lo + rword) | 0),\n (rword = lo & 67108863),\n (ncarry = (ncarry + (lo >>> 26)) | 0),\n (hncarry += ncarry >>> 26),\n (ncarry &= 67108863);\n }\n (out.words[k] = rword), (carry = ncarry), (ncarry = hncarry);\n }\n return carry !== 0 ? (out.words[k] = carry) : out.length--, out._strip();\n }\n function jumboMulTo(self2, num, out) {\n return bigMulTo(self2, num, out);\n }\n BN.prototype.mulTo = function (num, out) {\n var res,\n len = this.length + num.length;\n return (\n this.length === 10 && num.length === 10\n ? (res = comb10MulTo(this, num, out))\n : len < 63\n ? (res = smallMulTo(this, num, out))\n : len < 1024\n ? (res = bigMulTo(this, num, out))\n : (res = jumboMulTo(this, num, out)),\n res\n );\n };\n function FFTM(x, y) {\n (this.x = x), (this.y = y);\n }\n (FFTM.prototype.makeRBT = function (N) {\n for (var t = new Array(N), l = BN.prototype._countBits(N) - 1, i = 0; i < N; i++) t[i] = this.revBin(i, l, N);\n return t;\n }),\n (FFTM.prototype.revBin = function (x, l, N) {\n if (x === 0 || x === N - 1) return x;\n for (var rb = 0, i = 0; i < l; i++) (rb |= (x & 1) << (l - i - 1)), (x >>= 1);\n return rb;\n }),\n (FFTM.prototype.permute = function (rbt, rws, iws, rtws, itws, N) {\n for (var i = 0; i < N; i++) (rtws[i] = rws[rbt[i]]), (itws[i] = iws[rbt[i]]);\n }),\n (FFTM.prototype.transform = function (rws, iws, rtws, itws, N, rbt) {\n this.permute(rbt, rws, iws, rtws, itws, N);\n for (var s = 1; s < N; s <<= 1)\n for (\n var l = s << 1, rtwdf = Math.cos((2 * Math.PI) / l), itwdf = Math.sin((2 * Math.PI) / l), p = 0;\n p < N;\n p += l\n )\n for (var rtwdf_ = rtwdf, itwdf_ = itwdf, j = 0; j < s; j++) {\n var re = rtws[p + j],\n ie = itws[p + j],\n ro = rtws[p + j + s],\n io = itws[p + j + s],\n rx = rtwdf_ * ro - itwdf_ * io;\n (io = rtwdf_ * io + itwdf_ * ro),\n (ro = rx),\n (rtws[p + j] = re + ro),\n (itws[p + j] = ie + io),\n (rtws[p + j + s] = re - ro),\n (itws[p + j + s] = ie - io),\n j !== l &&\n ((rx = rtwdf * rtwdf_ - itwdf * itwdf_), (itwdf_ = rtwdf * itwdf_ + itwdf * rtwdf_), (rtwdf_ = rx));\n }\n }),\n (FFTM.prototype.guessLen13b = function (n, m) {\n var N = Math.max(m, n) | 1,\n odd = N & 1,\n i = 0;\n for (N = (N / 2) | 0; N; N = N >>> 1) i++;\n return 1 << (i + 1 + odd);\n }),\n (FFTM.prototype.conjugate = function (rws, iws, N) {\n if (!(N <= 1))\n for (var i = 0; i < N / 2; i++) {\n var t = rws[i];\n (rws[i] = rws[N - i - 1]),\n (rws[N - i - 1] = t),\n (t = iws[i]),\n (iws[i] = -iws[N - i - 1]),\n (iws[N - i - 1] = -t);\n }\n }),\n (FFTM.prototype.normalize13b = function (ws, N) {\n for (var carry = 0, i = 0; i < N / 2; i++) {\n var w = Math.round(ws[2 * i + 1] / N) * 8192 + Math.round(ws[2 * i] / N) + carry;\n (ws[i] = w & 67108863), w < 67108864 ? (carry = 0) : (carry = (w / 67108864) | 0);\n }\n return ws;\n }),\n (FFTM.prototype.convert13b = function (ws, len, rws, N) {\n for (var carry = 0, i = 0; i < len; i++)\n (carry = carry + (ws[i] | 0)),\n (rws[2 * i] = carry & 8191),\n (carry = carry >>> 13),\n (rws[2 * i + 1] = carry & 8191),\n (carry = carry >>> 13);\n for (i = 2 * len; i < N; ++i) rws[i] = 0;\n assert(carry === 0), assert((carry & -8192) === 0);\n }),\n (FFTM.prototype.stub = function (N) {\n for (var ph = new Array(N), i = 0; i < N; i++) ph[i] = 0;\n return ph;\n }),\n (FFTM.prototype.mulp = function (x, y, out) {\n var N = 2 * this.guessLen13b(x.length, y.length),\n rbt = this.makeRBT(N),\n _ = this.stub(N),\n rws = new Array(N),\n rwst = new Array(N),\n iwst = new Array(N),\n nrws = new Array(N),\n nrwst = new Array(N),\n niwst = new Array(N),\n rmws = out.words;\n (rmws.length = N),\n this.convert13b(x.words, x.length, rws, N),\n this.convert13b(y.words, y.length, nrws, N),\n this.transform(rws, _, rwst, iwst, N, rbt),\n this.transform(nrws, _, nrwst, niwst, N, rbt);\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]), (rwst[i] = rx);\n }\n return (\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 (out.negative = x.negative ^ y.negative),\n (out.length = x.length + y.length),\n out._strip()\n );\n }),\n (BN.prototype.mul = function (num) {\n var out = new BN(null);\n return (out.words = new Array(this.length + num.length)), this.mulTo(num, out);\n }),\n (BN.prototype.mulf = function (num) {\n var out = new BN(null);\n return (out.words = new Array(this.length + num.length)), jumboMulTo(this, num, out);\n }),\n (BN.prototype.imul = function (num) {\n return this.clone().mulTo(num, this);\n }),\n (BN.prototype.imuln = function (num) {\n var isNegNum = num < 0;\n isNegNum && (num = -num), assert(typeof num == \"number\"), assert(num < 67108864);\n for (var carry = 0, i = 0; i < this.length; i++) {\n var w = (this.words[i] | 0) * num,\n lo = (w & 67108863) + (carry & 67108863);\n (carry >>= 26), (carry += (w / 67108864) | 0), (carry += lo >>> 26), (this.words[i] = lo & 67108863);\n }\n return carry !== 0 && ((this.words[i] = carry), this.length++), isNegNum ? this.ineg() : this;\n }),\n (BN.prototype.muln = function (num) {\n return this.clone().imuln(num);\n }),\n (BN.prototype.sqr = function () {\n return this.mul(this);\n }),\n (BN.prototype.isqr = function () {\n return this.imul(this.clone());\n }),\n (BN.prototype.pow = function (num) {\n var w = toBitArray(num);\n if (w.length === 0) return new BN(1);\n for (var res = this, i = 0; i < w.length && w[i] === 0; i++, res = res.sqr());\n if (++i < w.length) for (var q = res.sqr(); i < w.length; i++, q = q.sqr()) w[i] !== 0 && (res = res.mul(q));\n return res;\n }),\n (BN.prototype.iushln = function (bits) {\n assert(typeof bits == \"number\" && bits >= 0);\n var r = bits % 26,\n s = (bits - r) / 26,\n carryMask = (67108863 >>> (26 - r)) << (26 - r),\n i;\n if (r !== 0) {\n var carry = 0;\n for (i = 0; i < this.length; i++) {\n var newCarry = this.words[i] & carryMask,\n c = ((this.words[i] | 0) - newCarry) << r;\n (this.words[i] = c | carry), (carry = newCarry >>> (26 - r));\n }\n carry && ((this.words[i] = carry), this.length++);\n }\n if (s !== 0) {\n for (i = this.length - 1; i >= 0; i--) this.words[i + s] = this.words[i];\n for (i = 0; i < s; i++) this.words[i] = 0;\n this.length += s;\n }\n return this._strip();\n }),\n (BN.prototype.ishln = function (bits) {\n return assert(this.negative === 0), this.iushln(bits);\n }),\n (BN.prototype.iushrn = function (bits, hint, extended) {\n assert(typeof bits == \"number\" && bits >= 0);\n var h;\n hint ? (h = (hint - (hint % 26)) / 26) : (h = 0);\n var r = bits % 26,\n s = Math.min((bits - r) / 26, this.length),\n mask = 67108863 ^ ((67108863 >>> r) << r),\n maskedWords = extended;\n if (((h -= s), (h = Math.max(0, h)), maskedWords)) {\n for (var i = 0; i < s; i++) maskedWords.words[i] = this.words[i];\n maskedWords.length = s;\n }\n if (s !== 0)\n if (this.length > s) for (this.length -= s, i = 0; i < this.length; i++) this.words[i] = this.words[i + s];\n else (this.words[0] = 0), (this.length = 1);\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)), (carry = word & mask);\n }\n return (\n maskedWords && carry !== 0 && (maskedWords.words[maskedWords.length++] = carry),\n this.length === 0 && ((this.words[0] = 0), (this.length = 1)),\n this._strip()\n );\n }),\n (BN.prototype.ishrn = function (bits, hint, extended) {\n return assert(this.negative === 0), this.iushrn(bits, hint, extended);\n }),\n (BN.prototype.shln = function (bits) {\n return this.clone().ishln(bits);\n }),\n (BN.prototype.ushln = function (bits) {\n return this.clone().iushln(bits);\n }),\n (BN.prototype.shrn = function (bits) {\n return this.clone().ishrn(bits);\n }),\n (BN.prototype.ushrn = function (bits) {\n return this.clone().iushrn(bits);\n }),\n (BN.prototype.testn = function (bit) {\n assert(typeof bit == \"number\" && bit >= 0);\n var r = bit % 26,\n s = (bit - r) / 26,\n q = 1 << r;\n if (this.length <= s) return !1;\n var w = this.words[s];\n return !!(w & q);\n }),\n (BN.prototype.imaskn = function (bits) {\n assert(typeof bits == \"number\" && bits >= 0);\n var r = bits % 26,\n s = (bits - r) / 26;\n if ((assert(this.negative === 0, \"imaskn works only with positive numbers\"), this.length <= s)) return this;\n if ((r !== 0 && s++, (this.length = Math.min(s, this.length)), r !== 0)) {\n var mask = 67108863 ^ ((67108863 >>> r) << r);\n this.words[this.length - 1] &= mask;\n }\n return this._strip();\n }),\n (BN.prototype.maskn = function (bits) {\n return this.clone().imaskn(bits);\n }),\n (BN.prototype.iaddn = function (num) {\n return (\n assert(typeof num == \"number\"),\n assert(num < 67108864),\n num < 0\n ? this.isubn(-num)\n : this.negative !== 0\n ? this.length === 1 && (this.words[0] | 0) <= num\n ? ((this.words[0] = num - (this.words[0] | 0)), (this.negative = 0), this)\n : ((this.negative = 0), this.isubn(num), (this.negative = 1), this)\n : this._iaddn(num)\n );\n }),\n (BN.prototype._iaddn = function (num) {\n this.words[0] += num;\n for (var i = 0; i < this.length && this.words[i] >= 67108864; i++)\n (this.words[i] -= 67108864), i === this.length - 1 ? (this.words[i + 1] = 1) : this.words[i + 1]++;\n return (this.length = Math.max(this.length, i + 1)), this;\n }),\n (BN.prototype.isubn = function (num) {\n if ((assert(typeof num == \"number\"), assert(num < 67108864), num < 0)) return this.iaddn(-num);\n if (this.negative !== 0) return (this.negative = 0), this.iaddn(num), (this.negative = 1), this;\n if (((this.words[0] -= num), this.length === 1 && this.words[0] < 0))\n (this.words[0] = -this.words[0]), (this.negative = 1);\n else\n for (var i = 0; i < this.length && this.words[i] < 0; i++)\n (this.words[i] += 67108864), (this.words[i + 1] -= 1);\n return this._strip();\n }),\n (BN.prototype.addn = function (num) {\n return this.clone().iaddn(num);\n }),\n (BN.prototype.subn = function (num) {\n return this.clone().isubn(num);\n }),\n (BN.prototype.iabs = function () {\n return (this.negative = 0), this;\n }),\n (BN.prototype.abs = function () {\n return this.clone().iabs();\n }),\n (BN.prototype._ishlnsubmul = function (num, mul, shift) {\n var len = num.length + shift,\n i;\n this._expand(len);\n var w,\n 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 & 67108863),\n (carry = (w >> 26) - ((right / 67108864) | 0)),\n (this.words[i + shift] = w & 67108863);\n }\n for (; i < this.length - shift; i++)\n (w = (this.words[i + shift] | 0) + carry), (carry = w >> 26), (this.words[i + shift] = w & 67108863);\n if (carry === 0) return this._strip();\n for (assert(carry === -1), carry = 0, i = 0; i < this.length; i++)\n (w = -(this.words[i] | 0) + carry), (carry = w >> 26), (this.words[i] = w & 67108863);\n return (this.negative = 1), this._strip();\n }),\n (BN.prototype._wordDiv = function (num, mode) {\n var shift = this.length - num.length,\n a = this.clone(),\n b = num,\n bhi = b.words[b.length - 1] | 0,\n bhiBits = this._countBits(bhi);\n (shift = 26 - bhiBits),\n shift !== 0 && ((b = b.ushln(shift)), a.iushln(shift), (bhi = b.words[b.length - 1] | 0));\n var m = a.length - b.length,\n q;\n if (mode !== \"mod\") {\n (q = new BN(null)), (q.length = m + 1), (q.words = new Array(q.length));\n for (var i = 0; i < q.length; i++) q.words[i] = 0;\n }\n var diff = a.clone()._ishlnsubmul(b, 1, m);\n diff.negative === 0 && ((a = diff), q && (q.words[m] = 1));\n for (var j = m - 1; j >= 0; j--) {\n var qj = (a.words[b.length + j] | 0) * 67108864 + (a.words[b.length + j - 1] | 0);\n for (qj = Math.min((qj / bhi) | 0, 67108863), a._ishlnsubmul(b, qj, j); a.negative !== 0; )\n qj--, (a.negative = 0), a._ishlnsubmul(b, 1, j), a.isZero() || (a.negative ^= 1);\n q && (q.words[j] = qj);\n }\n return (\n q && q._strip(),\n a._strip(),\n mode !== \"div\" && shift !== 0 && a.iushrn(shift),\n {\n div: q || null,\n mod: a,\n }\n );\n }),\n (BN.prototype.divmod = function (num, mode, positive) {\n if ((assert(!num.isZero()), this.isZero()))\n return {\n div: new BN(0),\n mod: new BN(0),\n };\n var div, mod, res;\n return this.negative !== 0 && num.negative === 0\n ? ((res = this.neg().divmod(num, mode)),\n mode !== \"mod\" && (div = res.div.neg()),\n mode !== \"div\" && ((mod = res.mod.neg()), positive && mod.negative !== 0 && mod.iadd(num)),\n {\n div,\n mod,\n })\n : this.negative === 0 && num.negative !== 0\n ? ((res = this.divmod(num.neg(), mode)),\n mode !== \"mod\" && (div = res.div.neg()),\n {\n div,\n mod: res.mod,\n })\n : (this.negative & num.negative) !== 0\n ? ((res = this.neg().divmod(num.neg(), mode)),\n mode !== \"div\" && ((mod = res.mod.neg()), positive && mod.negative !== 0 && mod.isub(num)),\n {\n div: res.div,\n mod,\n })\n : num.length > this.length || this.cmp(num) < 0\n ? {\n div: new BN(0),\n mod: this,\n }\n : num.length === 1\n ? mode === \"div\"\n ? {\n div: this.divn(num.words[0]),\n mod: null,\n }\n : mode === \"mod\"\n ? {\n div: null,\n mod: new BN(this.modrn(num.words[0])),\n }\n : {\n div: this.divn(num.words[0]),\n mod: new BN(this.modrn(num.words[0])),\n }\n : this._wordDiv(num, mode);\n }),\n (BN.prototype.div = function (num) {\n return this.divmod(num, \"div\", !1).div;\n }),\n (BN.prototype.mod = function (num) {\n return this.divmod(num, \"mod\", !1).mod;\n }),\n (BN.prototype.umod = function (num) {\n return this.divmod(num, \"mod\", !0).mod;\n }),\n (BN.prototype.divRound = function (num) {\n var dm = this.divmod(num);\n if (dm.mod.isZero()) return dm.div;\n var mod = dm.div.negative !== 0 ? dm.mod.isub(num) : dm.mod,\n half = num.ushrn(1),\n r2 = num.andln(1),\n cmp = mod.cmp(half);\n return cmp < 0 || (r2 === 1 && cmp === 0)\n ? dm.div\n : dm.div.negative !== 0\n ? dm.div.isubn(1)\n : dm.div.iaddn(1);\n }),\n (BN.prototype.modrn = function (num) {\n var isNegNum = num < 0;\n isNegNum && (num = -num), assert(num <= 67108863);\n for (var p = (1 << 26) % num, acc = 0, i = this.length - 1; i >= 0; i--)\n acc = (p * acc + (this.words[i] | 0)) % num;\n return isNegNum ? -acc : acc;\n }),\n (BN.prototype.modn = function (num) {\n return this.modrn(num);\n }),\n (BN.prototype.idivn = function (num) {\n var isNegNum = num < 0;\n isNegNum && (num = -num), assert(num <= 67108863);\n for (var carry = 0, i = this.length - 1; i >= 0; i--) {\n var w = (this.words[i] | 0) + carry * 67108864;\n (this.words[i] = (w / num) | 0), (carry = w % num);\n }\n return this._strip(), isNegNum ? this.ineg() : this;\n }),\n (BN.prototype.divn = function (num) {\n return this.clone().idivn(num);\n }),\n (BN.prototype.egcd = function (p) {\n assert(p.negative === 0), assert(!p.isZero());\n var x = this,\n y = p.clone();\n x.negative !== 0 ? (x = x.umod(p)) : (x = x.clone());\n for (var A = new BN(1), B = new BN(0), C = new BN(0), D = new BN(1), g = 0; x.isEven() && y.isEven(); )\n x.iushrn(1), y.iushrn(1), ++g;\n for (var yp = y.clone(), xp = x.clone(); !x.isZero(); ) {\n for (var i = 0, im = 1; (x.words[0] & im) === 0 && i < 26; ++i, im <<= 1);\n if (i > 0)\n for (x.iushrn(i); i-- > 0; )\n (A.isOdd() || B.isOdd()) && (A.iadd(yp), B.isub(xp)), A.iushrn(1), B.iushrn(1);\n for (var j = 0, jm = 1; (y.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n if (j > 0)\n for (y.iushrn(j); j-- > 0; )\n (C.isOdd() || D.isOdd()) && (C.iadd(yp), D.isub(xp)), C.iushrn(1), D.iushrn(1);\n x.cmp(y) >= 0 ? (x.isub(y), A.isub(C), B.isub(D)) : (y.isub(x), C.isub(A), D.isub(B));\n }\n return {\n a: C,\n b: D,\n gcd: y.iushln(g),\n };\n }),\n (BN.prototype._invmp = function (p) {\n assert(p.negative === 0), assert(!p.isZero());\n var a = this,\n b = p.clone();\n a.negative !== 0 ? (a = a.umod(p)) : (a = a.clone());\n for (var x1 = new BN(1), x2 = new BN(0), delta = b.clone(); 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) for (a.iushrn(i); i-- > 0; ) x1.isOdd() && x1.iadd(delta), x1.iushrn(1);\n for (var j = 0, jm = 1; (b.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n if (j > 0) for (b.iushrn(j); j-- > 0; ) x2.isOdd() && x2.iadd(delta), x2.iushrn(1);\n a.cmp(b) >= 0 ? (a.isub(b), x1.isub(x2)) : (b.isub(a), x2.isub(x1));\n }\n var res;\n return a.cmpn(1) === 0 ? (res = x1) : (res = x2), res.cmpn(0) < 0 && res.iadd(p), res;\n }),\n (BN.prototype.gcd = function (num) {\n if (this.isZero()) return num.abs();\n if (num.isZero()) return this.abs();\n var a = this.clone(),\n b = num.clone();\n (a.negative = 0), (b.negative = 0);\n for (var shift = 0; a.isEven() && b.isEven(); shift++) a.iushrn(1), b.iushrn(1);\n do {\n for (; a.isEven(); ) a.iushrn(1);\n for (; b.isEven(); ) b.iushrn(1);\n var r = a.cmp(b);\n if (r < 0) {\n var t = a;\n (a = b), (b = t);\n } else if (r === 0 || b.cmpn(1) === 0) break;\n a.isub(b);\n } while (!0);\n return b.iushln(shift);\n }),\n (BN.prototype.invm = function (num) {\n return this.egcd(num).a.umod(num);\n }),\n (BN.prototype.isEven = function () {\n return (this.words[0] & 1) === 0;\n }),\n (BN.prototype.isOdd = function () {\n return (this.words[0] & 1) === 1;\n }),\n (BN.prototype.andln = function (num) {\n return this.words[0] & num;\n }),\n (BN.prototype.bincn = function (bit) {\n assert(typeof bit == \"number\");\n var r = bit % 26,\n s = (bit - r) / 26,\n q = 1 << r;\n if (this.length <= s) return this._expand(s + 1), (this.words[s] |= q), this;\n for (var carry = q, i = s; carry !== 0 && i < this.length; i++) {\n var w = this.words[i] | 0;\n (w += carry), (carry = w >>> 26), (w &= 67108863), (this.words[i] = w);\n }\n return carry !== 0 && ((this.words[i] = carry), this.length++), this;\n }),\n (BN.prototype.isZero = function () {\n return this.length === 1 && this.words[0] === 0;\n }),\n (BN.prototype.cmpn = function (num) {\n var negative = num < 0;\n if (this.negative !== 0 && !negative) return -1;\n if (this.negative === 0 && negative) return 1;\n this._strip();\n var res;\n if (this.length > 1) res = 1;\n else {\n negative && (num = -num), assert(num <= 67108863, \"Number is too big\");\n var w = this.words[0] | 0;\n res = w === num ? 0 : w < num ? -1 : 1;\n }\n return this.negative !== 0 ? -res | 0 : res;\n }),\n (BN.prototype.cmp = function (num) {\n if (this.negative !== 0 && num.negative === 0) return -1;\n if (this.negative === 0 && num.negative !== 0) return 1;\n var res = this.ucmp(num);\n return this.negative !== 0 ? -res | 0 : res;\n }),\n (BN.prototype.ucmp = function (num) {\n if (this.length > num.length) return 1;\n if (this.length < num.length) return -1;\n for (var res = 0, i = this.length - 1; i >= 0; i--) {\n var a = this.words[i] | 0,\n b = num.words[i] | 0;\n if (a !== b) {\n a < b ? (res = -1) : a > b && (res = 1);\n break;\n }\n }\n return res;\n }),\n (BN.prototype.gtn = function (num) {\n return this.cmpn(num) === 1;\n }),\n (BN.prototype.gt = function (num) {\n return this.cmp(num) === 1;\n }),\n (BN.prototype.gten = function (num) {\n return this.cmpn(num) >= 0;\n }),\n (BN.prototype.gte = function (num) {\n return this.cmp(num) >= 0;\n }),\n (BN.prototype.ltn = function (num) {\n return this.cmpn(num) === -1;\n }),\n (BN.prototype.lt = function (num) {\n return this.cmp(num) === -1;\n }),\n (BN.prototype.lten = function (num) {\n return this.cmpn(num) <= 0;\n }),\n (BN.prototype.lte = function (num) {\n return this.cmp(num) <= 0;\n }),\n (BN.prototype.eqn = function (num) {\n return this.cmpn(num) === 0;\n }),\n (BN.prototype.eq = function (num) {\n return this.cmp(num) === 0;\n }),\n (BN.red = function (num) {\n return new Red(num);\n }),\n (BN.prototype.toRed = function (ctx) {\n return (\n assert(!this.red, \"Already a number in reduction context\"),\n assert(this.negative === 0, \"red works only with positives\"),\n ctx.convertTo(this)._forceRed(ctx)\n );\n }),\n (BN.prototype.fromRed = function () {\n return assert(this.red, \"fromRed works only with numbers in reduction context\"), this.red.convertFrom(this);\n }),\n (BN.prototype._forceRed = function (ctx) {\n return (this.red = ctx), this;\n }),\n (BN.prototype.forceRed = function (ctx) {\n return assert(!this.red, \"Already a number in reduction context\"), this._forceRed(ctx);\n }),\n (BN.prototype.redAdd = function (num) {\n return assert(this.red, \"redAdd works only with red numbers\"), this.red.add(this, num);\n }),\n (BN.prototype.redIAdd = function (num) {\n return assert(this.red, \"redIAdd works only with red numbers\"), this.red.iadd(this, num);\n }),\n (BN.prototype.redSub = function (num) {\n return assert(this.red, \"redSub works only with red numbers\"), this.red.sub(this, num);\n }),\n (BN.prototype.redISub = function (num) {\n return assert(this.red, \"redISub works only with red numbers\"), this.red.isub(this, num);\n }),\n (BN.prototype.redShl = function (num) {\n return assert(this.red, \"redShl works only with red numbers\"), this.red.shl(this, num);\n }),\n (BN.prototype.redMul = function (num) {\n return (\n assert(this.red, \"redMul works only with red numbers\"),\n this.red._verify2(this, num),\n this.red.mul(this, num)\n );\n }),\n (BN.prototype.redIMul = function (num) {\n return (\n assert(this.red, \"redMul works only with red numbers\"),\n this.red._verify2(this, num),\n this.red.imul(this, num)\n );\n }),\n (BN.prototype.redSqr = function () {\n return assert(this.red, \"redSqr works only with red numbers\"), this.red._verify1(this), this.red.sqr(this);\n }),\n (BN.prototype.redISqr = function () {\n return assert(this.red, \"redISqr works only with red numbers\"), this.red._verify1(this), this.red.isqr(this);\n }),\n (BN.prototype.redSqrt = function () {\n return assert(this.red, \"redSqrt works only with red numbers\"), this.red._verify1(this), this.red.sqrt(this);\n }),\n (BN.prototype.redInvm = function () {\n return assert(this.red, \"redInvm works only with red numbers\"), this.red._verify1(this), this.red.invm(this);\n }),\n (BN.prototype.redNeg = function () {\n return assert(this.red, \"redNeg works only with red numbers\"), this.red._verify1(this), this.red.neg(this);\n }),\n (BN.prototype.redPow = function (num) {\n return assert(this.red && !num.red, \"redPow(normalNum)\"), this.red._verify1(this), this.red.pow(this, num);\n });\n var primes = {\n k256: null,\n p224: null,\n p192: null,\n p25519: null,\n };\n function MPrime(name, p) {\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 (this.tmp = this._tmp());\n }\n (MPrime.prototype._tmp = function () {\n var tmp = new BN(null);\n return (tmp.words = new Array(Math.ceil(this.n / 13))), tmp;\n }),\n (MPrime.prototype.ireduce = function (num) {\n var r = num,\n rlen;\n do this.split(r, this.tmp), (r = this.imulK(r)), (r = r.iadd(this.tmp)), (rlen = r.bitLength());\n while (rlen > this.n);\n var cmp = rlen < this.n ? -1 : r.ucmp(this.p);\n return (\n cmp === 0\n ? ((r.words[0] = 0), (r.length = 1))\n : cmp > 0\n ? r.isub(this.p)\n : r.strip !== void 0\n ? r.strip()\n : r._strip(),\n r\n );\n }),\n (MPrime.prototype.split = function (input, out) {\n input.iushrn(this.n, 0, out);\n }),\n (MPrime.prototype.imulK = function (num) {\n return num.imul(this.k);\n });\n function K256() {\n MPrime.call(this, \"k256\", \"ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f\");\n }\n inherits(K256, MPrime),\n (K256.prototype.split = function (input, output) {\n for (var mask = 4194303, outLen = Math.min(input.length, 9), i = 0; i < outLen; i++)\n output.words[i] = input.words[i];\n if (((output.length = outLen), input.length <= 9)) {\n (input.words[0] = 0), (input.length = 1);\n return;\n }\n var prev = input.words[9];\n for (output.words[output.length++] = prev & mask, i = 10; i < input.length; i++) {\n var next = input.words[i] | 0;\n (input.words[i - 10] = ((next & mask) << 4) | (prev >>> 22)), (prev = next);\n }\n (prev >>>= 22),\n (input.words[i - 10] = prev),\n prev === 0 && input.length > 10 ? (input.length -= 10) : (input.length -= 9);\n }),\n (K256.prototype.imulK = function (num) {\n (num.words[num.length] = 0), (num.words[num.length + 1] = 0), (num.length += 2);\n for (var lo = 0, i = 0; i < num.length; i++) {\n var w = num.words[i] | 0;\n (lo += w * 977), (num.words[i] = lo & 67108863), (lo = w * 64 + ((lo / 67108864) | 0));\n }\n return (\n num.words[num.length - 1] === 0 && (num.length--, num.words[num.length - 1] === 0 && num.length--), num\n );\n });\n function P224() {\n MPrime.call(this, \"p224\", \"ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001\");\n }\n inherits(P224, MPrime);\n function P192() {\n MPrime.call(this, \"p192\", \"ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff\");\n }\n inherits(P192, MPrime);\n function P25519() {\n MPrime.call(this, \"25519\", \"7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed\");\n }\n inherits(P25519, MPrime),\n (P25519.prototype.imulK = function (num) {\n for (var carry = 0, i = 0; i < num.length; i++) {\n var hi = (num.words[i] | 0) * 19 + carry,\n lo = hi & 67108863;\n (hi >>>= 26), (num.words[i] = lo), (carry = hi);\n }\n return carry !== 0 && (num.words[num.length++] = carry), num;\n }),\n (BN._prime = function (name) {\n if (primes[name]) return primes[name];\n var prime2;\n if (name === \"k256\") prime2 = new K256();\n else if (name === \"p224\") prime2 = new P224();\n else if (name === \"p192\") prime2 = new P192();\n else if (name === \"p25519\") prime2 = new P25519();\n else throw new Error(\"Unknown prime \" + name);\n return (primes[name] = prime2), prime2;\n });\n function Red(m) {\n if (typeof m == \"string\") {\n var prime = BN._prime(m);\n (this.m = prime.p), (this.prime = prime);\n } else assert(m.gtn(1), \"modulus must be greater than 1\"), (this.m = m), (this.prime = null);\n }\n (Red.prototype._verify1 = function (a) {\n assert(a.negative === 0, \"red works only with positives\"), assert(a.red, \"red works only with red numbers\");\n }),\n (Red.prototype._verify2 = function (a, b) {\n assert((a.negative | b.negative) === 0, \"red works only with positives\"),\n assert(a.red && a.red === b.red, \"red works only with red numbers\");\n }),\n (Red.prototype.imod = function (a) {\n return this.prime ? this.prime.ireduce(a)._forceRed(this) : (move(a, a.umod(this.m)._forceRed(this)), a);\n }),\n (Red.prototype.neg = function (a) {\n return a.isZero() ? a.clone() : this.m.sub(a)._forceRed(this);\n }),\n (Red.prototype.add = function (a, b) {\n this._verify2(a, b);\n var res = a.add(b);\n return res.cmp(this.m) >= 0 && res.isub(this.m), res._forceRed(this);\n }),\n (Red.prototype.iadd = function (a, b) {\n this._verify2(a, b);\n var res = a.iadd(b);\n return res.cmp(this.m) >= 0 && res.isub(this.m), res;\n }),\n (Red.prototype.sub = function (a, b) {\n this._verify2(a, b);\n var res = a.sub(b);\n return res.cmpn(0) < 0 && res.iadd(this.m), res._forceRed(this);\n }),\n (Red.prototype.isub = function (a, b) {\n this._verify2(a, b);\n var res = a.isub(b);\n return res.cmpn(0) < 0 && res.iadd(this.m), res;\n }),\n (Red.prototype.shl = function (a, num) {\n return this._verify1(a), this.imod(a.ushln(num));\n }),\n (Red.prototype.imul = function (a, b) {\n return this._verify2(a, b), this.imod(a.imul(b));\n }),\n (Red.prototype.mul = function (a, b) {\n return this._verify2(a, b), this.imod(a.mul(b));\n }),\n (Red.prototype.isqr = function (a) {\n return this.imul(a, a.clone());\n }),\n (Red.prototype.sqr = function (a) {\n return this.mul(a, a);\n }),\n (Red.prototype.sqrt = function (a) {\n if (a.isZero()) return a.clone();\n var mod3 = this.m.andln(3);\n if ((assert(mod3 % 2 === 1), mod3 === 3)) {\n var pow = this.m.add(new BN(1)).iushrn(2);\n return this.pow(a, pow);\n }\n for (var q = this.m.subn(1), s = 0; !q.isZero() && q.andln(1) === 0; ) s++, q.iushrn(1);\n assert(!q.isZero());\n var one = new BN(1).toRed(this),\n nOne = one.redNeg(),\n lpow = this.m.subn(1).iushrn(1),\n z = this.m.bitLength();\n for (z = new BN(2 * z * z).toRed(this); this.pow(z, lpow).cmp(nOne) !== 0; ) z.redIAdd(nOne);\n for (\n var c = this.pow(z, q), r = this.pow(a, q.addn(1).iushrn(1)), t = this.pow(a, q), m = s;\n t.cmp(one) !== 0;\n\n ) {\n for (var tmp = t, i = 0; tmp.cmp(one) !== 0; i++) tmp = tmp.redSqr();\n assert(i < m);\n var b = this.pow(c, new BN(1).iushln(m - i - 1));\n (r = r.redMul(b)), (c = b.redSqr()), (t = t.redMul(c)), (m = i);\n }\n return r;\n }),\n (Red.prototype.invm = function (a) {\n var inv = a._invmp(this.m);\n return inv.negative !== 0 ? ((inv.negative = 0), this.imod(inv).redNeg()) : this.imod(inv);\n }),\n (Red.prototype.pow = function (a, num) {\n if (num.isZero()) return new BN(1).toRed(this);\n if (num.cmpn(1) === 0) return a.clone();\n var windowSize = 4,\n wnd = new Array(1 << windowSize);\n (wnd[0] = new BN(1).toRed(this)), (wnd[1] = a);\n for (var i = 2; i < wnd.length; i++) wnd[i] = this.mul(wnd[i - 1], a);\n var res = wnd[0],\n current = 0,\n currentLen = 0,\n start = num.bitLength() % 26;\n for (start === 0 && (start = 26), i = num.length - 1; i >= 0; i--) {\n for (var word = num.words[i], j = start - 1; j >= 0; j--) {\n var bit = (word >> j) & 1;\n if ((res !== wnd[0] && (res = this.sqr(res)), bit === 0 && current === 0)) {\n currentLen = 0;\n continue;\n }\n (current <<= 1),\n (current |= bit),\n currentLen++,\n !(currentLen !== windowSize && (i !== 0 || j !== 0)) &&\n ((res = this.mul(res, wnd[current])), (currentLen = 0), (current = 0));\n }\n start = 26;\n }\n return res;\n }),\n (Red.prototype.convertTo = function (num) {\n var r = num.umod(this.m);\n return r === num ? r.clone() : r;\n }),\n (Red.prototype.convertFrom = function (num) {\n var res = num.clone();\n return (res.red = null), res;\n }),\n (BN.mont = function (num) {\n return new Mont(num);\n });\n function Mont(m) {\n Red.call(this, m),\n (this.shift = this.m.bitLength()),\n this.shift % 26 !== 0 && (this.shift += 26 - (this.shift % 26)),\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 (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 (Mont.prototype.convertTo = function (num) {\n return this.imod(num.ushln(this.shift));\n }),\n (Mont.prototype.convertFrom = function (num) {\n var r = this.imod(num.mul(this.rinv));\n return (r.red = null), r;\n }),\n (Mont.prototype.imul = function (a, b) {\n if (a.isZero() || b.isZero()) return (a.words[0] = 0), (a.length = 1), a;\n var t = a.imul(b),\n c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m),\n u = t.isub(c).iushrn(this.shift),\n res = u;\n return (\n u.cmp(this.m) >= 0 ? (res = u.isub(this.m)) : u.cmpn(0) < 0 && (res = u.iadd(this.m)), res._forceRed(this)\n );\n }),\n (Mont.prototype.mul = function (a, b) {\n if (a.isZero() || b.isZero()) return new BN(0)._forceRed(this);\n var t = a.mul(b),\n c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m),\n u = t.isub(c).iushrn(this.shift),\n res = u;\n return (\n u.cmp(this.m) >= 0 ? (res = u.isub(this.m)) : u.cmpn(0) < 0 && (res = u.iadd(this.m)), res._forceRed(this)\n );\n }),\n (Mont.prototype.invm = function (a) {\n var res = this.imod(a._invmp(this.m).mul(this.r2));\n return res._forceRed(this);\n });\n })(typeof module > \"u\" || module, exports);\n },\n});\n\n// node_modules/browserify-rsa/index.js\nvar require_browserify_rsa = __commonJS({\n \"node_modules/browserify-rsa/index.js\"(exports, module) {\n var BN = require_bn3(),\n randomBytes = require_browser();\n function blind(priv) {\n var r = getr(priv),\n blinder = r.toRed(BN.mont(priv.modulus)).redPow(new BN(priv.publicExponent)).fromRed();\n return { blinder, unblinder: r.invm(priv.modulus) };\n }\n function getr(priv) {\n var len = priv.modulus.byteLength(),\n r;\n do r = new BN(randomBytes(len));\n while (r.cmp(priv.modulus) >= 0 || !r.umod(priv.prime1) || !r.umod(priv.prime2));\n return r;\n }\n function crt(msg, priv) {\n var blinds = blind(priv),\n len = priv.modulus.byteLength(),\n blinded = new BN(msg).mul(blinds.blinder).umod(priv.modulus),\n c1 = blinded.toRed(BN.mont(priv.prime1)),\n c2 = blinded.toRed(BN.mont(priv.prime2)),\n qinv = priv.coefficient,\n p = priv.prime1,\n q = priv.prime2,\n m1 = c1.redPow(priv.exponent1).fromRed(),\n m2 = c2.redPow(priv.exponent2).fromRed(),\n h = m1.isub(m2).imul(qinv).umod(p).imul(q);\n return m2.iadd(h).imul(blinds.unblinder).umod(priv.modulus).toArrayLike(Buffer, \"be\", len);\n }\n crt.getr = getr;\n module.exports = crt;\n },\n});\n\n// node_modules/elliptic/package.json\nvar require_package = __commonJS({\n \"node_modules/elliptic/package.json\"(exports, module) {\n module.exports = {\n name: \"elliptic\",\n version: \"6.5.4\",\n description: \"EC cryptography\",\n main: \"lib/elliptic.js\",\n files: [\"lib\"],\n scripts: {\n lint: \"eslint lib test\",\n \"lint:fix\": \"npm run lint -- --fix\",\n unit: \"istanbul test _mocha --reporter=spec test/index.js\",\n test: \"npm run lint && npm run unit\",\n version: \"grunt dist && git add dist/\",\n },\n repository: {\n type: \"git\",\n url: \"git@github.com:indutny/elliptic\",\n },\n keywords: [\"EC\", \"Elliptic\", \"curve\", \"Cryptography\"],\n author: \"Fedor Indutny <fedor@indutny.com>\",\n license: \"MIT\",\n bugs: {\n url: \"https://github.com/indutny/elliptic/issues\",\n },\n homepage: \"https://github.com/indutny/elliptic\",\n devDependencies: {\n brfs: \"^2.0.2\",\n coveralls: \"^3.1.0\",\n eslint: \"^7.6.0\",\n grunt: \"^1.2.1\",\n \"grunt-browserify\": \"^5.3.0\",\n \"grunt-cli\": \"^1.3.2\",\n \"grunt-contrib-connect\": \"^3.0.0\",\n \"grunt-contrib-copy\": \"^1.0.0\",\n \"grunt-contrib-uglify\": \"^5.0.0\",\n \"grunt-mocha-istanbul\": \"^5.0.2\",\n \"grunt-saucelabs\": \"^9.0.1\",\n istanbul: \"^0.4.5\",\n mocha: \"^8.0.1\",\n },\n dependencies: {\n \"bn.js\": \"^4.11.9\",\n brorand: \"^1.1.0\",\n \"hash.js\": \"^1.0.0\",\n \"hmac-drbg\": \"^1.0.1\",\n inherits: \"^2.0.4\",\n \"minimalistic-assert\": \"^1.0.1\",\n \"minimalistic-crypto-utils\": \"^1.0.1\",\n },\n };\n },\n});\n\n// node_modules/elliptic/node_modules/bn.js/lib/bn.js\nvar require_bn4 = __commonJS({\n \"node_modules/elliptic/node_modules/bn.js/lib/bn.js\"(exports, module) {\n (function (module2, exports2) {\n \"use strict\";\n function assert(val, msg) {\n if (!val) throw new Error(msg || \"Assertion failed\");\n }\n function inherits(ctor, superCtor) {\n ctor.super_ = superCtor;\n var TempCtor = function () {};\n (TempCtor.prototype = superCtor.prototype),\n (ctor.prototype = new TempCtor()),\n (ctor.prototype.constructor = ctor);\n }\n function BN(number, base, endian) {\n if (BN.isBN(number)) return number;\n (this.negative = 0),\n (this.words = null),\n (this.length = 0),\n (this.red = null),\n number !== null &&\n ((base === \"le\" || base === \"be\") && ((endian = base), (base = 10)),\n this._init(number || 0, base || 10, endian || \"be\"));\n }\n typeof module2 == \"object\" ? (module2.exports = BN) : (exports2.BN = BN), (BN.BN = BN), (BN.wordSize = 26);\n var Buffer2;\n try {\n typeof window < \"u\" && typeof window.Buffer < \"u\"\n ? (Buffer2 = window.Buffer)\n : (Buffer2 = __require(\"buffer\").Buffer);\n } catch {}\n (BN.isBN = function (num) {\n return num instanceof BN\n ? !0\n : num !== null &&\n typeof num == \"object\" &&\n num.constructor.wordSize === BN.wordSize &&\n Array.isArray(num.words);\n }),\n (BN.max = function (left, right) {\n return left.cmp(right) > 0 ? left : right;\n }),\n (BN.min = function (left, right) {\n return left.cmp(right) < 0 ? left : right;\n }),\n (BN.prototype._init = function (number, base, endian) {\n if (typeof number == \"number\") return this._initNumber(number, base, endian);\n if (typeof number == \"object\") return this._initArray(number, base, endian);\n base === \"hex\" && (base = 16),\n assert(base === (base | 0) && base >= 2 && base <= 36),\n (number = number.toString().replace(/\\s+/g, \"\"));\n var start = 0;\n number[0] === \"-\" && (start++, (this.negative = 1)),\n start < number.length &&\n (base === 16\n ? this._parseHex(number, start, endian)\n : (this._parseBase(number, base, start),\n endian === \"le\" && this._initArray(this.toArray(), base, endian)));\n }),\n (BN.prototype._initNumber = function (number, base, endian) {\n number < 0 && ((this.negative = 1), (number = -number)),\n number < 67108864\n ? ((this.words = [number & 67108863]), (this.length = 1))\n : number < 4503599627370496\n ? ((this.words = [number & 67108863, (number / 67108864) & 67108863]), (this.length = 2))\n : (assert(number < 9007199254740992),\n (this.words = [number & 67108863, (number / 67108864) & 67108863, 1]),\n (this.length = 3)),\n endian === \"le\" && this._initArray(this.toArray(), base, endian);\n }),\n (BN.prototype._initArray = function (number, base, endian) {\n if ((assert(typeof number.length == \"number\"), number.length <= 0))\n return (this.words = [0]), (this.length = 1), this;\n (this.length = Math.ceil(number.length / 3)), (this.words = new Array(this.length));\n for (var i = 0; i < this.length; i++) this.words[i] = 0;\n var j,\n w,\n off = 0;\n if (endian === \"be\")\n for (i = number.length - 1, j = 0; i >= 0; i -= 3)\n (w = number[i] | (number[i - 1] << 8) | (number[i - 2] << 16)),\n (this.words[j] |= (w << off) & 67108863),\n (this.words[j + 1] = (w >>> (26 - off)) & 67108863),\n (off += 24),\n off >= 26 && ((off -= 26), j++);\n else if (endian === \"le\")\n for (i = 0, j = 0; i < number.length; i += 3)\n (w = number[i] | (number[i + 1] << 8) | (number[i + 2] << 16)),\n (this.words[j] |= (w << off) & 67108863),\n (this.words[j + 1] = (w >>> (26 - off)) & 67108863),\n (off += 24),\n off >= 26 && ((off -= 26), j++);\n return this.strip();\n });\n function parseHex4Bits(string, index) {\n var c = string.charCodeAt(index);\n return c >= 65 && c <= 70 ? c - 55 : c >= 97 && c <= 102 ? c - 87 : (c - 48) & 15;\n }\n function parseHexByte(string, lowerBound, index) {\n var r = parseHex4Bits(string, index);\n return index - 1 >= lowerBound && (r |= parseHex4Bits(string, index - 1) << 4), r;\n }\n BN.prototype._parseHex = function (number, start, endian) {\n (this.length = Math.ceil((number.length - start) / 6)), (this.words = new Array(this.length));\n for (var i = 0; i < this.length; i++) this.words[i] = 0;\n var off = 0,\n j = 0,\n w;\n if (endian === \"be\")\n for (i = number.length - 1; i >= start; i -= 2)\n (w = parseHexByte(number, start, i) << off),\n (this.words[j] |= w & 67108863),\n off >= 18 ? ((off -= 18), (j += 1), (this.words[j] |= w >>> 26)) : (off += 8);\n else {\n var parseLength = number.length - start;\n for (i = parseLength % 2 === 0 ? start + 1 : start; i < number.length; i += 2)\n (w = parseHexByte(number, start, i) << off),\n (this.words[j] |= w & 67108863),\n off >= 18 ? ((off -= 18), (j += 1), (this.words[j] |= w >>> 26)) : (off += 8);\n }\n this.strip();\n };\n function parseBase(str, start, end, mul) {\n for (var r = 0, len = Math.min(str.length, end), i = start; i < len; i++) {\n var c = str.charCodeAt(i) - 48;\n (r *= mul), c >= 49 ? (r += c - 49 + 10) : c >= 17 ? (r += c - 17 + 10) : (r += c);\n }\n return r;\n }\n (BN.prototype._parseBase = function (number, base, start) {\n (this.words = [0]), (this.length = 1);\n for (var limbLen = 0, limbPow = 1; limbPow <= 67108863; limbPow *= base) limbLen++;\n limbLen--, (limbPow = (limbPow / base) | 0);\n for (\n var total = number.length - start,\n mod = total % limbLen,\n end = Math.min(total, total - mod) + start,\n word = 0,\n i = start;\n i < end;\n i += limbLen\n )\n (word = parseBase(number, i, i + limbLen, base)),\n this.imuln(limbPow),\n this.words[0] + word < 67108864 ? (this.words[0] += word) : this._iaddn(word);\n if (mod !== 0) {\n var pow = 1;\n for (word = parseBase(number, i, number.length, base), i = 0; i < mod; i++) pow *= base;\n this.imuln(pow), this.words[0] + word < 67108864 ? (this.words[0] += word) : this._iaddn(word);\n }\n this.strip();\n }),\n (BN.prototype.copy = function (dest) {\n dest.words = new Array(this.length);\n for (var i = 0; i < this.length; i++) dest.words[i] = this.words[i];\n (dest.length = this.length), (dest.negative = this.negative), (dest.red = this.red);\n }),\n (BN.prototype.clone = function () {\n var r = new BN(null);\n return this.copy(r), r;\n }),\n (BN.prototype._expand = function (size) {\n for (; this.length < size; ) this.words[this.length++] = 0;\n return this;\n }),\n (BN.prototype.strip = function () {\n for (; this.length > 1 && this.words[this.length - 1] === 0; ) this.length--;\n return this._normSign();\n }),\n (BN.prototype._normSign = function () {\n return this.length === 1 && this.words[0] === 0 && (this.negative = 0), this;\n }),\n (BN.prototype.inspect = function () {\n return (this.red ? \"<BN-R: \" : \"<BN: \") + this.toString(16) + \">\";\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 groupSizes = [\n 0, 0, 25, 16, 12, 11, 10, 9, 8, 8, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5,\n 5, 5,\n ],\n groupBases = [\n 0, 0, 33554432, 43046721, 16777216, 48828125, 60466176, 40353607, 16777216, 43046721, 1e7, 19487171, 35831808,\n 62748517, 7529536, 11390625, 16777216, 24137569, 34012224, 47045881, 64e6, 4084101, 5153632, 6436343, 7962624,\n 9765625, 11881376, 14348907, 17210368, 20511149, 243e5, 28629151, 33554432, 39135393, 45435424, 52521875,\n 60466176,\n ];\n (BN.prototype.toString = function (base, padding) {\n (base = base || 10), (padding = padding | 0 || 1);\n var out;\n if (base === 16 || base === \"hex\") {\n out = \"\";\n for (var off = 0, carry = 0, i = 0; i < this.length; i++) {\n var w = this.words[i],\n word = (((w << off) | carry) & 16777215).toString(16);\n (carry = (w >>> (24 - off)) & 16777215),\n carry !== 0 || i !== this.length - 1 ? (out = zeros[6 - word.length] + word + out) : (out = word + out),\n (off += 2),\n off >= 26 && ((off -= 26), i--);\n }\n for (carry !== 0 && (out = carry.toString(16) + out); out.length % padding !== 0; ) out = \"0\" + out;\n return this.negative !== 0 && (out = \"-\" + out), out;\n }\n if (base === (base | 0) && base >= 2 && base <= 36) {\n var groupSize = groupSizes[base],\n groupBase = groupBases[base];\n out = \"\";\n var c = this.clone();\n for (c.negative = 0; !c.isZero(); ) {\n var r = c.modn(groupBase).toString(base);\n (c = c.idivn(groupBase)), c.isZero() ? (out = r + out) : (out = zeros[groupSize - r.length] + r + out);\n }\n for (this.isZero() && (out = \"0\" + out); out.length % padding !== 0; ) out = \"0\" + out;\n return this.negative !== 0 && (out = \"-\" + out), out;\n }\n assert(!1, \"Base should be between 2 and 36\");\n }),\n (BN.prototype.toNumber = function () {\n var ret = this.words[0];\n return (\n this.length === 2\n ? (ret += this.words[1] * 67108864)\n : this.length === 3 && this.words[2] === 1\n ? (ret += 4503599627370496 + this.words[1] * 67108864)\n : this.length > 2 && assert(!1, \"Number can only safely store up to 53 bits\"),\n this.negative !== 0 ? -ret : ret\n );\n }),\n (BN.prototype.toJSON = function () {\n return this.toString(16);\n }),\n (BN.prototype.toBuffer = function (endian, length) {\n return assert(typeof Buffer2 < \"u\"), this.toArrayLike(Buffer2, endian, length);\n }),\n (BN.prototype.toArray = function (endian, length) {\n return this.toArrayLike(Array, endian, length);\n }),\n (BN.prototype.toArrayLike = function (ArrayType, endian, length) {\n var byteLength = this.byteLength(),\n 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 this.strip();\n var littleEndian = endian === \"le\",\n res = new ArrayType(reqLength),\n b,\n i,\n q = this.clone();\n if (littleEndian) {\n for (i = 0; !q.isZero(); i++) (b = q.andln(255)), q.iushrn(8), (res[i] = b);\n for (; i < reqLength; i++) res[i] = 0;\n } else {\n for (i = 0; i < reqLength - byteLength; i++) res[i] = 0;\n for (i = 0; !q.isZero(); i++) (b = q.andln(255)), q.iushrn(8), (res[reqLength - i - 1] = b);\n }\n return res;\n }),\n Math.clz32\n ? (BN.prototype._countBits = function (w) {\n return 32 - Math.clz32(w);\n })\n : (BN.prototype._countBits = function (w) {\n var t = w,\n r = 0;\n return (\n t >= 4096 && ((r += 13), (t >>>= 13)),\n t >= 64 && ((r += 7), (t >>>= 7)),\n t >= 8 && ((r += 4), (t >>>= 4)),\n t >= 2 && ((r += 2), (t >>>= 2)),\n r + t\n );\n }),\n (BN.prototype._zeroBits = function (w) {\n if (w === 0) return 26;\n var t = w,\n r = 0;\n return (\n (t & 8191) === 0 && ((r += 13), (t >>>= 13)),\n (t & 127) === 0 && ((r += 7), (t >>>= 7)),\n (t & 15) === 0 && ((r += 4), (t >>>= 4)),\n (t & 3) === 0 && ((r += 2), (t >>>= 2)),\n (t & 1) === 0 && r++,\n r\n );\n }),\n (BN.prototype.bitLength = function () {\n var w = this.words[this.length - 1],\n hi = this._countBits(w);\n return (this.length - 1) * 26 + hi;\n });\n function toBitArray(num) {\n for (var w = new Array(num.bitLength()), bit = 0; bit < w.length; bit++) {\n var off = (bit / 26) | 0,\n wbit = bit % 26;\n w[bit] = (num.words[off] & (1 << wbit)) >>> wbit;\n }\n return w;\n }\n (BN.prototype.zeroBits = function () {\n if (this.isZero()) return 0;\n for (var r = 0, i = 0; i < this.length; i++) {\n var b = this._zeroBits(this.words[i]);\n if (((r += b), b !== 26)) break;\n }\n return r;\n }),\n (BN.prototype.byteLength = function () {\n return Math.ceil(this.bitLength() / 8);\n }),\n (BN.prototype.toTwos = function (width) {\n return this.negative !== 0 ? this.abs().inotn(width).iaddn(1) : this.clone();\n }),\n (BN.prototype.fromTwos = function (width) {\n return this.testn(width - 1) ? this.notn(width).iaddn(1).ineg() : this.clone();\n }),\n (BN.prototype.isNeg = function () {\n return this.negative !== 0;\n }),\n (BN.prototype.neg = function () {\n return this.clone().ineg();\n }),\n (BN.prototype.ineg = function () {\n return this.isZero() || (this.negative ^= 1), this;\n }),\n (BN.prototype.iuor = function (num) {\n for (; this.length < num.length; ) this.words[this.length++] = 0;\n for (var i = 0; i < num.length; i++) this.words[i] = this.words[i] | num.words[i];\n return this.strip();\n }),\n (BN.prototype.ior = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuor(num);\n }),\n (BN.prototype.or = function (num) {\n return this.length > num.length ? this.clone().ior(num) : num.clone().ior(this);\n }),\n (BN.prototype.uor = function (num) {\n return this.length > num.length ? this.clone().iuor(num) : num.clone().iuor(this);\n }),\n (BN.prototype.iuand = function (num) {\n var b;\n this.length > num.length ? (b = num) : (b = this);\n for (var i = 0; i < b.length; i++) this.words[i] = this.words[i] & num.words[i];\n return (this.length = b.length), this.strip();\n }),\n (BN.prototype.iand = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuand(num);\n }),\n (BN.prototype.and = function (num) {\n return this.length > num.length ? this.clone().iand(num) : num.clone().iand(this);\n }),\n (BN.prototype.uand = function (num) {\n return this.length > num.length ? this.clone().iuand(num) : num.clone().iuand(this);\n }),\n (BN.prototype.iuxor = function (num) {\n var a, b;\n this.length > num.length ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var i = 0; i < b.length; i++) this.words[i] = a.words[i] ^ b.words[i];\n if (this !== a) for (; i < a.length; i++) this.words[i] = a.words[i];\n return (this.length = a.length), this.strip();\n }),\n (BN.prototype.ixor = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuxor(num);\n }),\n (BN.prototype.xor = function (num) {\n return this.length > num.length ? this.clone().ixor(num) : num.clone().ixor(this);\n }),\n (BN.prototype.uxor = function (num) {\n return this.length > num.length ? this.clone().iuxor(num) : num.clone().iuxor(this);\n }),\n (BN.prototype.inotn = function (width) {\n assert(typeof width == \"number\" && width >= 0);\n var bytesNeeded = Math.ceil(width / 26) | 0,\n bitsLeft = width % 26;\n this._expand(bytesNeeded), bitsLeft > 0 && bytesNeeded--;\n for (var i = 0; i < bytesNeeded; i++) this.words[i] = ~this.words[i] & 67108863;\n return bitsLeft > 0 && (this.words[i] = ~this.words[i] & (67108863 >> (26 - bitsLeft))), this.strip();\n }),\n (BN.prototype.notn = function (width) {\n return this.clone().inotn(width);\n }),\n (BN.prototype.setn = function (bit, val) {\n assert(typeof bit == \"number\" && bit >= 0);\n var off = (bit / 26) | 0,\n wbit = bit % 26;\n return (\n this._expand(off + 1),\n val\n ? (this.words[off] = this.words[off] | (1 << wbit))\n : (this.words[off] = this.words[off] & ~(1 << wbit)),\n this.strip()\n );\n }),\n (BN.prototype.iadd = function (num) {\n var r;\n if (this.negative !== 0 && num.negative === 0)\n return (this.negative = 0), (r = this.isub(num)), (this.negative ^= 1), this._normSign();\n if (this.negative === 0 && num.negative !== 0)\n return (num.negative = 0), (r = this.isub(num)), (num.negative = 1), r._normSign();\n var a, b;\n this.length > num.length ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var carry = 0, i = 0; i < b.length; i++)\n (r = (a.words[i] | 0) + (b.words[i] | 0) + carry), (this.words[i] = r & 67108863), (carry = r >>> 26);\n for (; carry !== 0 && i < a.length; i++)\n (r = (a.words[i] | 0) + carry), (this.words[i] = r & 67108863), (carry = r >>> 26);\n if (((this.length = a.length), carry !== 0)) (this.words[this.length] = carry), this.length++;\n else if (a !== this) for (; i < a.length; i++) this.words[i] = a.words[i];\n return this;\n }),\n (BN.prototype.add = function (num) {\n var res;\n return num.negative !== 0 && this.negative === 0\n ? ((num.negative = 0), (res = this.sub(num)), (num.negative ^= 1), res)\n : num.negative === 0 && this.negative !== 0\n ? ((this.negative = 0), (res = num.sub(this)), (this.negative = 1), res)\n : this.length > num.length\n ? this.clone().iadd(num)\n : num.clone().iadd(this);\n }),\n (BN.prototype.isub = function (num) {\n if (num.negative !== 0) {\n num.negative = 0;\n var r = this.iadd(num);\n return (num.negative = 1), r._normSign();\n } else if (this.negative !== 0)\n return (this.negative = 0), this.iadd(num), (this.negative = 1), this._normSign();\n var cmp = this.cmp(num);\n if (cmp === 0) return (this.negative = 0), (this.length = 1), (this.words[0] = 0), this;\n var a, b;\n cmp > 0 ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var carry = 0, i = 0; i < b.length; i++)\n (r = (a.words[i] | 0) - (b.words[i] | 0) + carry), (carry = r >> 26), (this.words[i] = r & 67108863);\n for (; carry !== 0 && i < a.length; i++)\n (r = (a.words[i] | 0) + carry), (carry = r >> 26), (this.words[i] = r & 67108863);\n if (carry === 0 && i < a.length && a !== this) for (; i < a.length; i++) this.words[i] = a.words[i];\n return (this.length = Math.max(this.length, i)), a !== this && (this.negative = 1), this.strip();\n }),\n (BN.prototype.sub = function (num) {\n return this.clone().isub(num);\n });\n function smallMulTo(self2, num, out) {\n out.negative = num.negative ^ self2.negative;\n var len = (self2.length + num.length) | 0;\n (out.length = len), (len = (len - 1) | 0);\n var a = self2.words[0] | 0,\n b = num.words[0] | 0,\n r = a * b,\n lo = r & 67108863,\n carry = (r / 67108864) | 0;\n out.words[0] = lo;\n for (var k = 1; k < len; k++) {\n for (\n var ncarry = carry >>> 26,\n rword = carry & 67108863,\n maxJ = Math.min(k, num.length - 1),\n j = Math.max(0, k - self2.length + 1);\n j <= maxJ;\n j++\n ) {\n var i = (k - j) | 0;\n (a = self2.words[i] | 0),\n (b = num.words[j] | 0),\n (r = a * b + rword),\n (ncarry += (r / 67108864) | 0),\n (rword = r & 67108863);\n }\n (out.words[k] = rword | 0), (carry = ncarry | 0);\n }\n return carry !== 0 ? (out.words[k] = carry | 0) : out.length--, out.strip();\n }\n var comb10MulTo = function (self2, num, out) {\n var a = self2.words,\n b = num.words,\n o = out.words,\n c = 0,\n lo,\n mid,\n hi,\n a0 = a[0] | 0,\n al0 = a0 & 8191,\n ah0 = a0 >>> 13,\n a1 = a[1] | 0,\n al1 = a1 & 8191,\n ah1 = a1 >>> 13,\n a2 = a[2] | 0,\n al2 = a2 & 8191,\n ah2 = a2 >>> 13,\n a3 = a[3] | 0,\n al3 = a3 & 8191,\n ah3 = a3 >>> 13,\n a4 = a[4] | 0,\n al4 = a4 & 8191,\n ah4 = a4 >>> 13,\n a5 = a[5] | 0,\n al5 = a5 & 8191,\n ah5 = a5 >>> 13,\n a6 = a[6] | 0,\n al6 = a6 & 8191,\n ah6 = a6 >>> 13,\n a7 = a[7] | 0,\n al7 = a7 & 8191,\n ah7 = a7 >>> 13,\n a8 = a[8] | 0,\n al8 = a8 & 8191,\n ah8 = a8 >>> 13,\n a9 = a[9] | 0,\n al9 = a9 & 8191,\n ah9 = a9 >>> 13,\n b0 = b[0] | 0,\n bl0 = b0 & 8191,\n bh0 = b0 >>> 13,\n b1 = b[1] | 0,\n bl1 = b1 & 8191,\n bh1 = b1 >>> 13,\n b2 = b[2] | 0,\n bl2 = b2 & 8191,\n bh2 = b2 >>> 13,\n b3 = b[3] | 0,\n bl3 = b3 & 8191,\n bh3 = b3 >>> 13,\n b4 = b[4] | 0,\n bl4 = b4 & 8191,\n bh4 = b4 >>> 13,\n b5 = b[5] | 0,\n bl5 = b5 & 8191,\n bh5 = b5 >>> 13,\n b6 = b[6] | 0,\n bl6 = b6 & 8191,\n bh6 = b6 >>> 13,\n b7 = b[7] | 0,\n bl7 = b7 & 8191,\n bh7 = b7 >>> 13,\n b8 = b[8] | 0,\n bl8 = b8 & 8191,\n bh8 = b8 >>> 13,\n b9 = b[9] | 0,\n bl9 = b9 & 8191,\n bh9 = b9 >>> 13;\n (out.negative = self2.negative ^ num.negative),\n (out.length = 19),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w0 >>> 26)) | 0),\n (w0 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w1 >>> 26)) | 0),\n (w1 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w2 >>> 26)) | 0),\n (w2 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w3 >>> 26)) | 0),\n (w3 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w4 >>> 26)) | 0),\n (w4 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w5 >>> 26)) | 0),\n (w5 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w6 >>> 26)) | 0),\n (w6 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w7 >>> 26)) | 0),\n (w7 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w8 >>> 26)) | 0),\n (w8 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w9 >>> 26)) | 0),\n (w9 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w10 >>> 26)) | 0),\n (w10 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w11 >>> 26)) | 0),\n (w11 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w12 >>> 26)) | 0),\n (w12 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w13 >>> 26)) | 0),\n (w13 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w14 >>> 26)) | 0),\n (w14 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w15 >>> 26)) | 0),\n (w15 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w16 >>> 26)) | 0),\n (w16 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w17 >>> 26)) | 0),\n (w17 &= 67108863),\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 & 8191) << 13)) | 0;\n return (\n (c = (((hi + (mid >>> 13)) | 0) + (w18 >>> 26)) | 0),\n (w18 &= 67108863),\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 c !== 0 && ((o[19] = c), out.length++),\n out\n );\n };\n Math.imul || (comb10MulTo = smallMulTo);\n function bigMulTo(self2, num, out) {\n (out.negative = num.negative ^ self2.negative), (out.length = self2.length + num.length);\n for (var carry = 0, hncarry = 0, k = 0; k < out.length - 1; k++) {\n var ncarry = hncarry;\n hncarry = 0;\n for (\n var rword = carry & 67108863, maxJ = Math.min(k, num.length - 1), j = Math.max(0, k - self2.length + 1);\n j <= maxJ;\n j++\n ) {\n var i = k - j,\n a = self2.words[i] | 0,\n b = num.words[j] | 0,\n r = a * b,\n lo = r & 67108863;\n (ncarry = (ncarry + ((r / 67108864) | 0)) | 0),\n (lo = (lo + rword) | 0),\n (rword = lo & 67108863),\n (ncarry = (ncarry + (lo >>> 26)) | 0),\n (hncarry += ncarry >>> 26),\n (ncarry &= 67108863);\n }\n (out.words[k] = rword), (carry = ncarry), (ncarry = hncarry);\n }\n return carry !== 0 ? (out.words[k] = carry) : out.length--, out.strip();\n }\n function jumboMulTo(self2, num, out) {\n var fftm = new FFTM();\n return fftm.mulp(self2, num, out);\n }\n BN.prototype.mulTo = function (num, out) {\n var res,\n len = this.length + num.length;\n return (\n this.length === 10 && num.length === 10\n ? (res = comb10MulTo(this, num, out))\n : len < 63\n ? (res = smallMulTo(this, num, out))\n : len < 1024\n ? (res = bigMulTo(this, num, out))\n : (res = jumboMulTo(this, num, out)),\n res\n );\n };\n function FFTM(x, y) {\n (this.x = x), (this.y = y);\n }\n (FFTM.prototype.makeRBT = function (N) {\n for (var t = new Array(N), l = BN.prototype._countBits(N) - 1, i = 0; i < N; i++) t[i] = this.revBin(i, l, N);\n return t;\n }),\n (FFTM.prototype.revBin = function (x, l, N) {\n if (x === 0 || x === N - 1) return x;\n for (var rb = 0, i = 0; i < l; i++) (rb |= (x & 1) << (l - i - 1)), (x >>= 1);\n return rb;\n }),\n (FFTM.prototype.permute = function (rbt, rws, iws, rtws, itws, N) {\n for (var i = 0; i < N; i++) (rtws[i] = rws[rbt[i]]), (itws[i] = iws[rbt[i]]);\n }),\n (FFTM.prototype.transform = function (rws, iws, rtws, itws, N, rbt) {\n this.permute(rbt, rws, iws, rtws, itws, N);\n for (var s = 1; s < N; s <<= 1)\n for (\n var l = s << 1, rtwdf = Math.cos((2 * Math.PI) / l), itwdf = Math.sin((2 * Math.PI) / l), p = 0;\n p < N;\n p += l\n )\n for (var rtwdf_ = rtwdf, itwdf_ = itwdf, j = 0; j < s; j++) {\n var re = rtws[p + j],\n ie = itws[p + j],\n ro = rtws[p + j + s],\n io = itws[p + j + s],\n rx = rtwdf_ * ro - itwdf_ * io;\n (io = rtwdf_ * io + itwdf_ * ro),\n (ro = rx),\n (rtws[p + j] = re + ro),\n (itws[p + j] = ie + io),\n (rtws[p + j + s] = re - ro),\n (itws[p + j + s] = ie - io),\n j !== l &&\n ((rx = rtwdf * rtwdf_ - itwdf * itwdf_), (itwdf_ = rtwdf * itwdf_ + itwdf * rtwdf_), (rtwdf_ = rx));\n }\n }),\n (FFTM.prototype.guessLen13b = function (n, m) {\n var N = Math.max(m, n) | 1,\n odd = N & 1,\n i = 0;\n for (N = (N / 2) | 0; N; N = N >>> 1) i++;\n return 1 << (i + 1 + odd);\n }),\n (FFTM.prototype.conjugate = function (rws, iws, N) {\n if (!(N <= 1))\n for (var i = 0; i < N / 2; i++) {\n var t = rws[i];\n (rws[i] = rws[N - i - 1]),\n (rws[N - i - 1] = t),\n (t = iws[i]),\n (iws[i] = -iws[N - i - 1]),\n (iws[N - i - 1] = -t);\n }\n }),\n (FFTM.prototype.normalize13b = function (ws, N) {\n for (var carry = 0, i = 0; i < N / 2; i++) {\n var w = Math.round(ws[2 * i + 1] / N) * 8192 + Math.round(ws[2 * i] / N) + carry;\n (ws[i] = w & 67108863), w < 67108864 ? (carry = 0) : (carry = (w / 67108864) | 0);\n }\n return ws;\n }),\n (FFTM.prototype.convert13b = function (ws, len, rws, N) {\n for (var carry = 0, i = 0; i < len; i++)\n (carry = carry + (ws[i] | 0)),\n (rws[2 * i] = carry & 8191),\n (carry = carry >>> 13),\n (rws[2 * i + 1] = carry & 8191),\n (carry = carry >>> 13);\n for (i = 2 * len; i < N; ++i) rws[i] = 0;\n assert(carry === 0), assert((carry & -8192) === 0);\n }),\n (FFTM.prototype.stub = function (N) {\n for (var ph = new Array(N), i = 0; i < N; i++) ph[i] = 0;\n return ph;\n }),\n (FFTM.prototype.mulp = function (x, y, out) {\n var N = 2 * this.guessLen13b(x.length, y.length),\n rbt = this.makeRBT(N),\n _ = this.stub(N),\n rws = new Array(N),\n rwst = new Array(N),\n iwst = new Array(N),\n nrws = new Array(N),\n nrwst = new Array(N),\n niwst = new Array(N),\n rmws = out.words;\n (rmws.length = N),\n this.convert13b(x.words, x.length, rws, N),\n this.convert13b(y.words, y.length, nrws, N),\n this.transform(rws, _, rwst, iwst, N, rbt),\n this.transform(nrws, _, nrwst, niwst, N, rbt);\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]), (rwst[i] = rx);\n }\n return (\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 (out.negative = x.negative ^ y.negative),\n (out.length = x.length + y.length),\n out.strip()\n );\n }),\n (BN.prototype.mul = function (num) {\n var out = new BN(null);\n return (out.words = new Array(this.length + num.length)), this.mulTo(num, out);\n }),\n (BN.prototype.mulf = function (num) {\n var out = new BN(null);\n return (out.words = new Array(this.length + num.length)), jumboMulTo(this, num, out);\n }),\n (BN.prototype.imul = function (num) {\n return this.clone().mulTo(num, this);\n }),\n (BN.prototype.imuln = function (num) {\n assert(typeof num == \"number\"), assert(num < 67108864);\n for (var carry = 0, i = 0; i < this.length; i++) {\n var w = (this.words[i] | 0) * num,\n lo = (w & 67108863) + (carry & 67108863);\n (carry >>= 26), (carry += (w / 67108864) | 0), (carry += lo >>> 26), (this.words[i] = lo & 67108863);\n }\n return carry !== 0 && ((this.words[i] = carry), this.length++), this;\n }),\n (BN.prototype.muln = function (num) {\n return this.clone().imuln(num);\n }),\n (BN.prototype.sqr = function () {\n return this.mul(this);\n }),\n (BN.prototype.isqr = function () {\n return this.imul(this.clone());\n }),\n (BN.prototype.pow = function (num) {\n var w = toBitArray(num);\n if (w.length === 0) return new BN(1);\n for (var res = this, i = 0; i < w.length && w[i] === 0; i++, res = res.sqr());\n if (++i < w.length) for (var q = res.sqr(); i < w.length; i++, q = q.sqr()) w[i] !== 0 && (res = res.mul(q));\n return res;\n }),\n (BN.prototype.iushln = function (bits) {\n assert(typeof bits == \"number\" && bits >= 0);\n var r = bits % 26,\n s = (bits - r) / 26,\n carryMask = (67108863 >>> (26 - r)) << (26 - r),\n i;\n if (r !== 0) {\n var carry = 0;\n for (i = 0; i < this.length; i++) {\n var newCarry = this.words[i] & carryMask,\n c = ((this.words[i] | 0) - newCarry) << r;\n (this.words[i] = c | carry), (carry = newCarry >>> (26 - r));\n }\n carry && ((this.words[i] = carry), this.length++);\n }\n if (s !== 0) {\n for (i = this.length - 1; i >= 0; i--) this.words[i + s] = this.words[i];\n for (i = 0; i < s; i++) this.words[i] = 0;\n this.length += s;\n }\n return this.strip();\n }),\n (BN.prototype.ishln = function (bits) {\n return assert(this.negative === 0), this.iushln(bits);\n }),\n (BN.prototype.iushrn = function (bits, hint, extended) {\n assert(typeof bits == \"number\" && bits >= 0);\n var h;\n hint ? (h = (hint - (hint % 26)) / 26) : (h = 0);\n var r = bits % 26,\n s = Math.min((bits - r) / 26, this.length),\n mask = 67108863 ^ ((67108863 >>> r) << r),\n maskedWords = extended;\n if (((h -= s), (h = Math.max(0, h)), maskedWords)) {\n for (var i = 0; i < s; i++) maskedWords.words[i] = this.words[i];\n maskedWords.length = s;\n }\n if (s !== 0)\n if (this.length > s) for (this.length -= s, i = 0; i < this.length; i++) this.words[i] = this.words[i + s];\n else (this.words[0] = 0), (this.length = 1);\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)), (carry = word & mask);\n }\n return (\n maskedWords && carry !== 0 && (maskedWords.words[maskedWords.length++] = carry),\n this.length === 0 && ((this.words[0] = 0), (this.length = 1)),\n this.strip()\n );\n }),\n (BN.prototype.ishrn = function (bits, hint, extended) {\n return assert(this.negative === 0), this.iushrn(bits, hint, extended);\n }),\n (BN.prototype.shln = function (bits) {\n return this.clone().ishln(bits);\n }),\n (BN.prototype.ushln = function (bits) {\n return this.clone().iushln(bits);\n }),\n (BN.prototype.shrn = function (bits) {\n return this.clone().ishrn(bits);\n }),\n (BN.prototype.ushrn = function (bits) {\n return this.clone().iushrn(bits);\n }),\n (BN.prototype.testn = function (bit) {\n assert(typeof bit == \"number\" && bit >= 0);\n var r = bit % 26,\n s = (bit - r) / 26,\n q = 1 << r;\n if (this.length <= s) return !1;\n var w = this.words[s];\n return !!(w & q);\n }),\n (BN.prototype.imaskn = function (bits) {\n assert(typeof bits == \"number\" && bits >= 0);\n var r = bits % 26,\n s = (bits - r) / 26;\n if ((assert(this.negative === 0, \"imaskn works only with positive numbers\"), this.length <= s)) return this;\n if ((r !== 0 && s++, (this.length = Math.min(s, this.length)), r !== 0)) {\n var mask = 67108863 ^ ((67108863 >>> r) << r);\n this.words[this.length - 1] &= mask;\n }\n return this.strip();\n }),\n (BN.prototype.maskn = function (bits) {\n return this.clone().imaskn(bits);\n }),\n (BN.prototype.iaddn = function (num) {\n return (\n assert(typeof num == \"number\"),\n assert(num < 67108864),\n num < 0\n ? this.isubn(-num)\n : this.negative !== 0\n ? this.length === 1 && (this.words[0] | 0) < num\n ? ((this.words[0] = num - (this.words[0] | 0)), (this.negative = 0), this)\n : ((this.negative = 0), this.isubn(num), (this.negative = 1), this)\n : this._iaddn(num)\n );\n }),\n (BN.prototype._iaddn = function (num) {\n this.words[0] += num;\n for (var i = 0; i < this.length && this.words[i] >= 67108864; i++)\n (this.words[i] -= 67108864), i === this.length - 1 ? (this.words[i + 1] = 1) : this.words[i + 1]++;\n return (this.length = Math.max(this.length, i + 1)), this;\n }),\n (BN.prototype.isubn = function (num) {\n if ((assert(typeof num == \"number\"), assert(num < 67108864), num < 0)) return this.iaddn(-num);\n if (this.negative !== 0) return (this.negative = 0), this.iaddn(num), (this.negative = 1), this;\n if (((this.words[0] -= num), this.length === 1 && this.words[0] < 0))\n (this.words[0] = -this.words[0]), (this.negative = 1);\n else\n for (var i = 0; i < this.length && this.words[i] < 0; i++)\n (this.words[i] += 67108864), (this.words[i + 1] -= 1);\n return this.strip();\n }),\n (BN.prototype.addn = function (num) {\n return this.clone().iaddn(num);\n }),\n (BN.prototype.subn = function (num) {\n return this.clone().isubn(num);\n }),\n (BN.prototype.iabs = function () {\n return (this.negative = 0), this;\n }),\n (BN.prototype.abs = function () {\n return this.clone().iabs();\n }),\n (BN.prototype._ishlnsubmul = function (num, mul, shift) {\n var len = num.length + shift,\n i;\n this._expand(len);\n var w,\n 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 & 67108863),\n (carry = (w >> 26) - ((right / 67108864) | 0)),\n (this.words[i + shift] = w & 67108863);\n }\n for (; i < this.length - shift; i++)\n (w = (this.words[i + shift] | 0) + carry), (carry = w >> 26), (this.words[i + shift] = w & 67108863);\n if (carry === 0) return this.strip();\n for (assert(carry === -1), carry = 0, i = 0; i < this.length; i++)\n (w = -(this.words[i] | 0) + carry), (carry = w >> 26), (this.words[i] = w & 67108863);\n return (this.negative = 1), this.strip();\n }),\n (BN.prototype._wordDiv = function (num, mode) {\n var shift = this.length - num.length,\n a = this.clone(),\n b = num,\n bhi = b.words[b.length - 1] | 0,\n bhiBits = this._countBits(bhi);\n (shift = 26 - bhiBits),\n shift !== 0 && ((b = b.ushln(shift)), a.iushln(shift), (bhi = b.words[b.length - 1] | 0));\n var m = a.length - b.length,\n q;\n if (mode !== \"mod\") {\n (q = new BN(null)), (q.length = m + 1), (q.words = new Array(q.length));\n for (var i = 0; i < q.length; i++) q.words[i] = 0;\n }\n var diff = a.clone()._ishlnsubmul(b, 1, m);\n diff.negative === 0 && ((a = diff), q && (q.words[m] = 1));\n for (var j = m - 1; j >= 0; j--) {\n var qj = (a.words[b.length + j] | 0) * 67108864 + (a.words[b.length + j - 1] | 0);\n for (qj = Math.min((qj / bhi) | 0, 67108863), a._ishlnsubmul(b, qj, j); a.negative !== 0; )\n qj--, (a.negative = 0), a._ishlnsubmul(b, 1, j), a.isZero() || (a.negative ^= 1);\n q && (q.words[j] = qj);\n }\n return (\n q && q.strip(),\n a.strip(),\n mode !== \"div\" && shift !== 0 && a.iushrn(shift),\n {\n div: q || null,\n mod: a,\n }\n );\n }),\n (BN.prototype.divmod = function (num, mode, positive) {\n if ((assert(!num.isZero()), this.isZero()))\n return {\n div: new BN(0),\n mod: new BN(0),\n };\n var div, mod, res;\n return this.negative !== 0 && num.negative === 0\n ? ((res = this.neg().divmod(num, mode)),\n mode !== \"mod\" && (div = res.div.neg()),\n mode !== \"div\" && ((mod = res.mod.neg()), positive && mod.negative !== 0 && mod.iadd(num)),\n {\n div,\n mod,\n })\n : this.negative === 0 && num.negative !== 0\n ? ((res = this.divmod(num.neg(), mode)),\n mode !== \"mod\" && (div = res.div.neg()),\n {\n div,\n mod: res.mod,\n })\n : (this.negative & num.negative) !== 0\n ? ((res = this.neg().divmod(num.neg(), mode)),\n mode !== \"div\" && ((mod = res.mod.neg()), positive && mod.negative !== 0 && mod.isub(num)),\n {\n div: res.div,\n mod,\n })\n : num.length > this.length || this.cmp(num) < 0\n ? {\n div: new BN(0),\n mod: this,\n }\n : num.length === 1\n ? mode === \"div\"\n ? {\n div: this.divn(num.words[0]),\n mod: null,\n }\n : mode === \"mod\"\n ? {\n div: null,\n mod: new BN(this.modn(num.words[0])),\n }\n : {\n div: this.divn(num.words[0]),\n mod: new BN(this.modn(num.words[0])),\n }\n : this._wordDiv(num, mode);\n }),\n (BN.prototype.div = function (num) {\n return this.divmod(num, \"div\", !1).div;\n }),\n (BN.prototype.mod = function (num) {\n return this.divmod(num, \"mod\", !1).mod;\n }),\n (BN.prototype.umod = function (num) {\n return this.divmod(num, \"mod\", !0).mod;\n }),\n (BN.prototype.divRound = function (num) {\n var dm = this.divmod(num);\n if (dm.mod.isZero()) return dm.div;\n var mod = dm.div.negative !== 0 ? dm.mod.isub(num) : dm.mod,\n half = num.ushrn(1),\n r2 = num.andln(1),\n cmp = mod.cmp(half);\n return cmp < 0 || (r2 === 1 && cmp === 0)\n ? dm.div\n : dm.div.negative !== 0\n ? dm.div.isubn(1)\n : dm.div.iaddn(1);\n }),\n (BN.prototype.modn = function (num) {\n assert(num <= 67108863);\n for (var p = (1 << 26) % num, acc = 0, i = this.length - 1; i >= 0; i--)\n acc = (p * acc + (this.words[i] | 0)) % num;\n return acc;\n }),\n (BN.prototype.idivn = function (num) {\n assert(num <= 67108863);\n for (var carry = 0, i = this.length - 1; i >= 0; i--) {\n var w = (this.words[i] | 0) + carry * 67108864;\n (this.words[i] = (w / num) | 0), (carry = w % num);\n }\n return this.strip();\n }),\n (BN.prototype.divn = function (num) {\n return this.clone().idivn(num);\n }),\n (BN.prototype.egcd = function (p) {\n assert(p.negative === 0), assert(!p.isZero());\n var x = this,\n y = p.clone();\n x.negative !== 0 ? (x = x.umod(p)) : (x = x.clone());\n for (var A = new BN(1), B = new BN(0), C = new BN(0), D = new BN(1), g = 0; x.isEven() && y.isEven(); )\n x.iushrn(1), y.iushrn(1), ++g;\n for (var yp = y.clone(), xp = x.clone(); !x.isZero(); ) {\n for (var i = 0, im = 1; (x.words[0] & im) === 0 && i < 26; ++i, im <<= 1);\n if (i > 0)\n for (x.iushrn(i); i-- > 0; )\n (A.isOdd() || B.isOdd()) && (A.iadd(yp), B.isub(xp)), A.iushrn(1), B.iushrn(1);\n for (var j = 0, jm = 1; (y.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n if (j > 0)\n for (y.iushrn(j); j-- > 0; )\n (C.isOdd() || D.isOdd()) && (C.iadd(yp), D.isub(xp)), C.iushrn(1), D.iushrn(1);\n x.cmp(y) >= 0 ? (x.isub(y), A.isub(C), B.isub(D)) : (y.isub(x), C.isub(A), D.isub(B));\n }\n return {\n a: C,\n b: D,\n gcd: y.iushln(g),\n };\n }),\n (BN.prototype._invmp = function (p) {\n assert(p.negative === 0), assert(!p.isZero());\n var a = this,\n b = p.clone();\n a.negative !== 0 ? (a = a.umod(p)) : (a = a.clone());\n for (var x1 = new BN(1), x2 = new BN(0), delta = b.clone(); 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) for (a.iushrn(i); i-- > 0; ) x1.isOdd() && x1.iadd(delta), x1.iushrn(1);\n for (var j = 0, jm = 1; (b.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n if (j > 0) for (b.iushrn(j); j-- > 0; ) x2.isOdd() && x2.iadd(delta), x2.iushrn(1);\n a.cmp(b) >= 0 ? (a.isub(b), x1.isub(x2)) : (b.isub(a), x2.isub(x1));\n }\n var res;\n return a.cmpn(1) === 0 ? (res = x1) : (res = x2), res.cmpn(0) < 0 && res.iadd(p), res;\n }),\n (BN.prototype.gcd = function (num) {\n if (this.isZero()) return num.abs();\n if (num.isZero()) return this.abs();\n var a = this.clone(),\n b = num.clone();\n (a.negative = 0), (b.negative = 0);\n for (var shift = 0; a.isEven() && b.isEven(); shift++) a.iushrn(1), b.iushrn(1);\n do {\n for (; a.isEven(); ) a.iushrn(1);\n for (; b.isEven(); ) b.iushrn(1);\n var r = a.cmp(b);\n if (r < 0) {\n var t = a;\n (a = b), (b = t);\n } else if (r === 0 || b.cmpn(1) === 0) break;\n a.isub(b);\n } while (!0);\n return b.iushln(shift);\n }),\n (BN.prototype.invm = function (num) {\n return this.egcd(num).a.umod(num);\n }),\n (BN.prototype.isEven = function () {\n return (this.words[0] & 1) === 0;\n }),\n (BN.prototype.isOdd = function () {\n return (this.words[0] & 1) === 1;\n }),\n (BN.prototype.andln = function (num) {\n return this.words[0] & num;\n }),\n (BN.prototype.bincn = function (bit) {\n assert(typeof bit == \"number\");\n var r = bit % 26,\n s = (bit - r) / 26,\n q = 1 << r;\n if (this.length <= s) return this._expand(s + 1), (this.words[s] |= q), this;\n for (var carry = q, i = s; carry !== 0 && i < this.length; i++) {\n var w = this.words[i] | 0;\n (w += carry), (carry = w >>> 26), (w &= 67108863), (this.words[i] = w);\n }\n return carry !== 0 && ((this.words[i] = carry), this.length++), this;\n }),\n (BN.prototype.isZero = function () {\n return this.length === 1 && this.words[0] === 0;\n }),\n (BN.prototype.cmpn = function (num) {\n var negative = num < 0;\n if (this.negative !== 0 && !negative) return -1;\n if (this.negative === 0 && negative) return 1;\n this.strip();\n var res;\n if (this.length > 1) res = 1;\n else {\n negative && (num = -num), assert(num <= 67108863, \"Number is too big\");\n var w = this.words[0] | 0;\n res = w === num ? 0 : w < num ? -1 : 1;\n }\n return this.negative !== 0 ? -res | 0 : res;\n }),\n (BN.prototype.cmp = function (num) {\n if (this.negative !== 0 && num.negative === 0) return -1;\n if (this.negative === 0 && num.negative !== 0) return 1;\n var res = this.ucmp(num);\n return this.negative !== 0 ? -res | 0 : res;\n }),\n (BN.prototype.ucmp = function (num) {\n if (this.length > num.length) return 1;\n if (this.length < num.length) return -1;\n for (var res = 0, i = this.length - 1; i >= 0; i--) {\n var a = this.words[i] | 0,\n b = num.words[i] | 0;\n if (a !== b) {\n a < b ? (res = -1) : a > b && (res = 1);\n break;\n }\n }\n return res;\n }),\n (BN.prototype.gtn = function (num) {\n return this.cmpn(num) === 1;\n }),\n (BN.prototype.gt = function (num) {\n return this.cmp(num) === 1;\n }),\n (BN.prototype.gten = function (num) {\n return this.cmpn(num) >= 0;\n }),\n (BN.prototype.gte = function (num) {\n return this.cmp(num) >= 0;\n }),\n (BN.prototype.ltn = function (num) {\n return this.cmpn(num) === -1;\n }),\n (BN.prototype.lt = function (num) {\n return this.cmp(num) === -1;\n }),\n (BN.prototype.lten = function (num) {\n return this.cmpn(num) <= 0;\n }),\n (BN.prototype.lte = function (num) {\n return this.cmp(num) <= 0;\n }),\n (BN.prototype.eqn = function (num) {\n return this.cmpn(num) === 0;\n }),\n (BN.prototype.eq = function (num) {\n return this.cmp(num) === 0;\n }),\n (BN.red = function (num) {\n return new Red(num);\n }),\n (BN.prototype.toRed = function (ctx) {\n return (\n assert(!this.red, \"Already a number in reduction context\"),\n assert(this.negative === 0, \"red works only with positives\"),\n ctx.convertTo(this)._forceRed(ctx)\n );\n }),\n (BN.prototype.fromRed = function () {\n return assert(this.red, \"fromRed works only with numbers in reduction context\"), this.red.convertFrom(this);\n }),\n (BN.prototype._forceRed = function (ctx) {\n return (this.red = ctx), this;\n }),\n (BN.prototype.forceRed = function (ctx) {\n return assert(!this.red, \"Already a number in reduction context\"), this._forceRed(ctx);\n }),\n (BN.prototype.redAdd = function (num) {\n return assert(this.red, \"redAdd works only with red numbers\"), this.red.add(this, num);\n }),\n (BN.prototype.redIAdd = function (num) {\n return assert(this.red, \"redIAdd works only with red numbers\"), this.red.iadd(this, num);\n }),\n (BN.prototype.redSub = function (num) {\n return assert(this.red, \"redSub works only with red numbers\"), this.red.sub(this, num);\n }),\n (BN.prototype.redISub = function (num) {\n return assert(this.red, \"redISub works only with red numbers\"), this.red.isub(this, num);\n }),\n (BN.prototype.redShl = function (num) {\n return assert(this.red, \"redShl works only with red numbers\"), this.red.shl(this, num);\n }),\n (BN.prototype.redMul = function (num) {\n return (\n assert(this.red, \"redMul works only with red numbers\"),\n this.red._verify2(this, num),\n this.red.mul(this, num)\n );\n }),\n (BN.prototype.redIMul = function (num) {\n return (\n assert(this.red, \"redMul works only with red numbers\"),\n this.red._verify2(this, num),\n this.red.imul(this, num)\n );\n }),\n (BN.prototype.redSqr = function () {\n return assert(this.red, \"redSqr works only with red numbers\"), this.red._verify1(this), this.red.sqr(this);\n }),\n (BN.prototype.redISqr = function () {\n return assert(this.red, \"redISqr works only with red numbers\"), this.red._verify1(this), this.red.isqr(this);\n }),\n (BN.prototype.redSqrt = function () {\n return assert(this.red, \"redSqrt works only with red numbers\"), this.red._verify1(this), this.red.sqrt(this);\n }),\n (BN.prototype.redInvm = function () {\n return assert(this.red, \"redInvm works only with red numbers\"), this.red._verify1(this), this.red.invm(this);\n }),\n (BN.prototype.redNeg = function () {\n return assert(this.red, \"redNeg works only with red numbers\"), this.red._verify1(this), this.red.neg(this);\n }),\n (BN.prototype.redPow = function (num) {\n return assert(this.red && !num.red, \"redPow(normalNum)\"), this.red._verify1(this), this.red.pow(this, num);\n });\n var primes = {\n k256: null,\n p224: null,\n p192: null,\n p25519: null,\n };\n function MPrime(name, p) {\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 (this.tmp = this._tmp());\n }\n (MPrime.prototype._tmp = function () {\n var tmp = new BN(null);\n return (tmp.words = new Array(Math.ceil(this.n / 13))), tmp;\n }),\n (MPrime.prototype.ireduce = function (num) {\n var r = num,\n rlen;\n do this.split(r, this.tmp), (r = this.imulK(r)), (r = r.iadd(this.tmp)), (rlen = r.bitLength());\n while (rlen > this.n);\n var cmp = rlen < this.n ? -1 : r.ucmp(this.p);\n return (\n cmp === 0\n ? ((r.words[0] = 0), (r.length = 1))\n : cmp > 0\n ? r.isub(this.p)\n : r.strip !== void 0\n ? r.strip()\n : r._strip(),\n r\n );\n }),\n (MPrime.prototype.split = function (input, out) {\n input.iushrn(this.n, 0, out);\n }),\n (MPrime.prototype.imulK = function (num) {\n return num.imul(this.k);\n });\n function K256() {\n MPrime.call(this, \"k256\", \"ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f\");\n }\n inherits(K256, MPrime),\n (K256.prototype.split = function (input, output) {\n for (var mask = 4194303, outLen = Math.min(input.length, 9), i = 0; i < outLen; i++)\n output.words[i] = input.words[i];\n if (((output.length = outLen), input.length <= 9)) {\n (input.words[0] = 0), (input.length = 1);\n return;\n }\n var prev = input.words[9];\n for (output.words[output.length++] = prev & mask, i = 10; i < input.length; i++) {\n var next = input.words[i] | 0;\n (input.words[i - 10] = ((next & mask) << 4) | (prev >>> 22)), (prev = next);\n }\n (prev >>>= 22),\n (input.words[i - 10] = prev),\n prev === 0 && input.length > 10 ? (input.length -= 10) : (input.length -= 9);\n }),\n (K256.prototype.imulK = function (num) {\n (num.words[num.length] = 0), (num.words[num.length + 1] = 0), (num.length += 2);\n for (var lo = 0, i = 0; i < num.length; i++) {\n var w = num.words[i] | 0;\n (lo += w * 977), (num.words[i] = lo & 67108863), (lo = w * 64 + ((lo / 67108864) | 0));\n }\n return (\n num.words[num.length - 1] === 0 && (num.length--, num.words[num.length - 1] === 0 && num.length--), num\n );\n });\n function P224() {\n MPrime.call(this, \"p224\", \"ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001\");\n }\n inherits(P224, MPrime);\n function P192() {\n MPrime.call(this, \"p192\", \"ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff\");\n }\n inherits(P192, MPrime);\n function P25519() {\n MPrime.call(this, \"25519\", \"7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed\");\n }\n inherits(P25519, MPrime),\n (P25519.prototype.imulK = function (num) {\n for (var carry = 0, i = 0; i < num.length; i++) {\n var hi = (num.words[i] | 0) * 19 + carry,\n lo = hi & 67108863;\n (hi >>>= 26), (num.words[i] = lo), (carry = hi);\n }\n return carry !== 0 && (num.words[num.length++] = carry), num;\n }),\n (BN._prime = function (name) {\n if (primes[name]) return primes[name];\n var prime2;\n if (name === \"k256\") prime2 = new K256();\n else if (name === \"p224\") prime2 = new P224();\n else if (name === \"p192\") prime2 = new P192();\n else if (name === \"p25519\") prime2 = new P25519();\n else throw new Error(\"Unknown prime \" + name);\n return (primes[name] = prime2), prime2;\n });\n function Red(m) {\n if (typeof m == \"string\") {\n var prime = BN._prime(m);\n (this.m = prime.p), (this.prime = prime);\n } else assert(m.gtn(1), \"modulus must be greater than 1\"), (this.m = m), (this.prime = null);\n }\n (Red.prototype._verify1 = function (a) {\n assert(a.negative === 0, \"red works only with positives\"), assert(a.red, \"red works only with red numbers\");\n }),\n (Red.prototype._verify2 = function (a, b) {\n assert((a.negative | b.negative) === 0, \"red works only with positives\"),\n assert(a.red && a.red === b.red, \"red works only with red numbers\");\n }),\n (Red.prototype.imod = function (a) {\n return this.prime ? this.prime.ireduce(a)._forceRed(this) : a.umod(this.m)._forceRed(this);\n }),\n (Red.prototype.neg = function (a) {\n return a.isZero() ? a.clone() : this.m.sub(a)._forceRed(this);\n }),\n (Red.prototype.add = function (a, b) {\n this._verify2(a, b);\n var res = a.add(b);\n return res.cmp(this.m) >= 0 && res.isub(this.m), res._forceRed(this);\n }),\n (Red.prototype.iadd = function (a, b) {\n this._verify2(a, b);\n var res = a.iadd(b);\n return res.cmp(this.m) >= 0 && res.isub(this.m), res;\n }),\n (Red.prototype.sub = function (a, b) {\n this._verify2(a, b);\n var res = a.sub(b);\n return res.cmpn(0) < 0 && res.iadd(this.m), res._forceRed(this);\n }),\n (Red.prototype.isub = function (a, b) {\n this._verify2(a, b);\n var res = a.isub(b);\n return res.cmpn(0) < 0 && res.iadd(this.m), res;\n }),\n (Red.prototype.shl = function (a, num) {\n return this._verify1(a), this.imod(a.ushln(num));\n }),\n (Red.prototype.imul = function (a, b) {\n return this._verify2(a, b), this.imod(a.imul(b));\n }),\n (Red.prototype.mul = function (a, b) {\n return this._verify2(a, b), this.imod(a.mul(b));\n }),\n (Red.prototype.isqr = function (a) {\n return this.imul(a, a.clone());\n }),\n (Red.prototype.sqr = function (a) {\n return this.mul(a, a);\n }),\n (Red.prototype.sqrt = function (a) {\n if (a.isZero()) return a.clone();\n var mod3 = this.m.andln(3);\n if ((assert(mod3 % 2 === 1), mod3 === 3)) {\n var pow = this.m.add(new BN(1)).iushrn(2);\n return this.pow(a, pow);\n }\n for (var q = this.m.subn(1), s = 0; !q.isZero() && q.andln(1) === 0; ) s++, q.iushrn(1);\n assert(!q.isZero());\n var one = new BN(1).toRed(this),\n nOne = one.redNeg(),\n lpow = this.m.subn(1).iushrn(1),\n z = this.m.bitLength();\n for (z = new BN(2 * z * z).toRed(this); this.pow(z, lpow).cmp(nOne) !== 0; ) z.redIAdd(nOne);\n for (\n var c = this.pow(z, q), r = this.pow(a, q.addn(1).iushrn(1)), t = this.pow(a, q), m = s;\n t.cmp(one) !== 0;\n\n ) {\n for (var tmp = t, i = 0; tmp.cmp(one) !== 0; i++) tmp = tmp.redSqr();\n assert(i < m);\n var b = this.pow(c, new BN(1).iushln(m - i - 1));\n (r = r.redMul(b)), (c = b.redSqr()), (t = t.redMul(c)), (m = i);\n }\n return r;\n }),\n (Red.prototype.invm = function (a) {\n var inv = a._invmp(this.m);\n return inv.negative !== 0 ? ((inv.negative = 0), this.imod(inv).redNeg()) : this.imod(inv);\n }),\n (Red.prototype.pow = function (a, num) {\n if (num.isZero()) return new BN(1).toRed(this);\n if (num.cmpn(1) === 0) return a.clone();\n var windowSize = 4,\n wnd = new Array(1 << windowSize);\n (wnd[0] = new BN(1).toRed(this)), (wnd[1] = a);\n for (var i = 2; i < wnd.length; i++) wnd[i] = this.mul(wnd[i - 1], a);\n var res = wnd[0],\n current = 0,\n currentLen = 0,\n start = num.bitLength() % 26;\n for (start === 0 && (start = 26), i = num.length - 1; i >= 0; i--) {\n for (var word = num.words[i], j = start - 1; j >= 0; j--) {\n var bit = (word >> j) & 1;\n if ((res !== wnd[0] && (res = this.sqr(res)), bit === 0 && current === 0)) {\n currentLen = 0;\n continue;\n }\n (current <<= 1),\n (current |= bit),\n currentLen++,\n !(currentLen !== windowSize && (i !== 0 || j !== 0)) &&\n ((res = this.mul(res, wnd[current])), (currentLen = 0), (current = 0));\n }\n start = 26;\n }\n return res;\n }),\n (Red.prototype.convertTo = function (num) {\n var r = num.umod(this.m);\n return r === num ? r.clone() : r;\n }),\n (Red.prototype.convertFrom = function (num) {\n var res = num.clone();\n return (res.red = null), res;\n }),\n (BN.mont = function (num) {\n return new Mont(num);\n });\n function Mont(m) {\n Red.call(this, m),\n (this.shift = this.m.bitLength()),\n this.shift % 26 !== 0 && (this.shift += 26 - (this.shift % 26)),\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 (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 (Mont.prototype.convertTo = function (num) {\n return this.imod(num.ushln(this.shift));\n }),\n (Mont.prototype.convertFrom = function (num) {\n var r = this.imod(num.mul(this.rinv));\n return (r.red = null), r;\n }),\n (Mont.prototype.imul = function (a, b) {\n if (a.isZero() || b.isZero()) return (a.words[0] = 0), (a.length = 1), a;\n var t = a.imul(b),\n c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m),\n u = t.isub(c).iushrn(this.shift),\n res = u;\n return (\n u.cmp(this.m) >= 0 ? (res = u.isub(this.m)) : u.cmpn(0) < 0 && (res = u.iadd(this.m)), res._forceRed(this)\n );\n }),\n (Mont.prototype.mul = function (a, b) {\n if (a.isZero() || b.isZero()) return new BN(0)._forceRed(this);\n var t = a.mul(b),\n c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m),\n u = t.isub(c).iushrn(this.shift),\n res = u;\n return (\n u.cmp(this.m) >= 0 ? (res = u.isub(this.m)) : u.cmpn(0) < 0 && (res = u.iadd(this.m)), res._forceRed(this)\n );\n }),\n (Mont.prototype.invm = function (a) {\n var res = this.imod(a._invmp(this.m).mul(this.r2));\n return res._forceRed(this);\n });\n })(typeof module > \"u\" || module, exports);\n },\n});\n\n// node_modules/minimalistic-crypto-utils/lib/utils.js\nvar require_utils2 = __commonJS({\n \"node_modules/minimalistic-crypto-utils/lib/utils.js\"(exports) {\n \"use strict\";\n var utils = exports;\n function toArray(msg, enc) {\n if (Array.isArray(msg)) return msg.slice();\n if (!msg) return [];\n var res = [];\n if (typeof msg != \"string\") {\n for (var i = 0; i < msg.length; i++) res[i] = msg[i] | 0;\n return res;\n }\n if (enc === \"hex\") {\n (msg = msg.replace(/[^a-z0-9]+/gi, \"\")), msg.length % 2 !== 0 && (msg = \"0\" + msg);\n for (var i = 0; i < msg.length; i += 2) res.push(parseInt(msg[i] + msg[i + 1], 16));\n } else\n for (var i = 0; i < msg.length; i++) {\n var c = msg.charCodeAt(i),\n hi = c >> 8,\n lo = c & 255;\n hi ? res.push(hi, lo) : res.push(lo);\n }\n return res;\n }\n utils.toArray = toArray;\n function zero2(word) {\n return word.length === 1 ? \"0\" + word : word;\n }\n utils.zero2 = zero2;\n function toHex(msg) {\n for (var res = \"\", i = 0; i < msg.length; i++) res += zero2(msg[i].toString(16));\n return res;\n }\n utils.toHex = toHex;\n utils.encode = function (arr, enc) {\n return enc === \"hex\" ? toHex(arr) : arr;\n };\n },\n});\n\n// node_modules/elliptic/lib/elliptic/utils.js\nvar require_utils3 = __commonJS({\n \"node_modules/elliptic/lib/elliptic/utils.js\"(exports) {\n \"use strict\";\n var utils = exports,\n BN = require_bn4(),\n minAssert = require_minimalistic_assert(),\n minUtils = require_utils2();\n utils.assert = minAssert;\n utils.toArray = minUtils.toArray;\n utils.zero2 = minUtils.zero2;\n utils.toHex = minUtils.toHex;\n utils.encode = minUtils.encode;\n function getNAF(num, w, bits) {\n var naf = new Array(Math.max(num.bitLength(), bits) + 1);\n naf.fill(0);\n for (var ws = 1 << (w + 1), k = num.clone(), i = 0; i < naf.length; i++) {\n var z,\n mod = k.andln(ws - 1);\n k.isOdd() ? (mod > (ws >> 1) - 1 ? (z = (ws >> 1) - mod) : (z = mod), k.isubn(z)) : (z = 0),\n (naf[i] = z),\n k.iushrn(1);\n }\n return naf;\n }\n utils.getNAF = getNAF;\n function getJSF(k1, k2) {\n var jsf = [[], []];\n (k1 = k1.clone()), (k2 = k2.clone());\n for (var d1 = 0, d2 = 0, m8; k1.cmpn(-d1) > 0 || k2.cmpn(-d2) > 0; ) {\n var m14 = (k1.andln(3) + d1) & 3,\n m24 = (k2.andln(3) + d2) & 3;\n m14 === 3 && (m14 = -1), m24 === 3 && (m24 = -1);\n var u1;\n (m14 & 1) === 0\n ? (u1 = 0)\n : ((m8 = (k1.andln(7) + d1) & 7), (m8 === 3 || m8 === 5) && m24 === 2 ? (u1 = -m14) : (u1 = m14)),\n jsf[0].push(u1);\n var u2;\n (m24 & 1) === 0\n ? (u2 = 0)\n : ((m8 = (k2.andln(7) + d2) & 7), (m8 === 3 || m8 === 5) && m14 === 2 ? (u2 = -m24) : (u2 = m24)),\n jsf[1].push(u2),\n 2 * d1 === u1 + 1 && (d1 = 1 - d1),\n 2 * d2 === u2 + 1 && (d2 = 1 - d2),\n k1.iushrn(1),\n k2.iushrn(1);\n }\n return jsf;\n }\n utils.getJSF = getJSF;\n function cachedProperty(obj, name, computer) {\n var key = \"_\" + name;\n obj.prototype[name] = function () {\n return this[key] !== void 0 ? this[key] : (this[key] = computer.call(this));\n };\n }\n utils.cachedProperty = cachedProperty;\n function parseBytes(bytes) {\n return typeof bytes == \"string\" ? utils.toArray(bytes, \"hex\") : bytes;\n }\n utils.parseBytes = parseBytes;\n function intFromLE(bytes) {\n return new BN(bytes, \"hex\", \"le\");\n }\n utils.intFromLE = intFromLE;\n },\n});\n\n// node_modules/elliptic/lib/elliptic/curve/base.js\nvar require_base = __commonJS({\n \"node_modules/elliptic/lib/elliptic/curve/base.js\"(exports, module) {\n \"use strict\";\n var BN = require_bn4(),\n utils = require_utils3(),\n getNAF = utils.getNAF,\n getJSF = utils.getJSF,\n assert = utils.assert;\n function BaseCurve(type, conf) {\n (this.type = type),\n (this.p = new BN(conf.p, 16)),\n (this.red = conf.prime ? BN.red(conf.prime) : BN.mont(this.p)),\n (this.zero = new BN(0).toRed(this.red)),\n (this.one = new BN(1).toRed(this.red)),\n (this.two = new BN(2).toRed(this.red)),\n (this.n = conf.n && new BN(conf.n, 16)),\n (this.g = conf.g && this.pointFromJSON(conf.g, conf.gRed)),\n (this._wnafT1 = new Array(4)),\n (this._wnafT2 = new Array(4)),\n (this._wnafT3 = new Array(4)),\n (this._wnafT4 = new Array(4)),\n (this._bitLength = this.n ? this.n.bitLength() : 0);\n var adjustCount = this.n && this.p.div(this.n);\n !adjustCount || adjustCount.cmpn(100) > 0\n ? (this.redN = null)\n : ((this._maxwellTrick = !0), (this.redN = this.n.toRed(this.red)));\n }\n module.exports = BaseCurve;\n BaseCurve.prototype.point = function () {\n throw new Error(\"Not implemented\");\n };\n BaseCurve.prototype.validate = function () {\n throw new Error(\"Not implemented\");\n };\n BaseCurve.prototype._fixedNafMul = function (p, k) {\n assert(p.precomputed);\n var doubles = p._getDoubles(),\n naf = getNAF(k, 1, this._bitLength),\n I = (1 << (doubles.step + 1)) - (doubles.step % 2 === 0 ? 2 : 1);\n I /= 3;\n var repr = [],\n j,\n nafW;\n for (j = 0; j < naf.length; j += doubles.step) {\n nafW = 0;\n for (var l = j + doubles.step - 1; l >= j; l--) nafW = (nafW << 1) + naf[l];\n repr.push(nafW);\n }\n for (var a = this.jpoint(null, null, null), b = this.jpoint(null, null, null), i = I; i > 0; i--) {\n for (j = 0; j < repr.length; j++)\n (nafW = repr[j]),\n nafW === i ? (b = b.mixedAdd(doubles.points[j])) : nafW === -i && (b = b.mixedAdd(doubles.points[j].neg()));\n a = a.add(b);\n }\n return a.toP();\n };\n BaseCurve.prototype._wnafMul = function (p, k) {\n var w = 4,\n nafPoints = p._getNAFPoints(w);\n w = nafPoints.wnd;\n for (\n var wnd = nafPoints.points,\n naf = getNAF(k, w, this._bitLength),\n acc = this.jpoint(null, null, null),\n i = naf.length - 1;\n i >= 0;\n i--\n ) {\n for (var l = 0; i >= 0 && naf[i] === 0; i--) l++;\n if ((i >= 0 && l++, (acc = acc.dblp(l)), i < 0)) break;\n var z = naf[i];\n assert(z !== 0),\n p.type === \"affine\"\n ? z > 0\n ? (acc = acc.mixedAdd(wnd[(z - 1) >> 1]))\n : (acc = acc.mixedAdd(wnd[(-z - 1) >> 1].neg()))\n : z > 0\n ? (acc = acc.add(wnd[(z - 1) >> 1]))\n : (acc = acc.add(wnd[(-z - 1) >> 1].neg()));\n }\n return p.type === \"affine\" ? acc.toP() : acc;\n };\n BaseCurve.prototype._wnafMulAdd = function (defW, points, coeffs, len, jacobianResult) {\n var wndWidth = this._wnafT1,\n wnd = this._wnafT2,\n naf = this._wnafT3,\n max = 0,\n i,\n j,\n p;\n for (i = 0; i < len; i++) {\n p = points[i];\n var nafPoints = p._getNAFPoints(defW);\n (wndWidth[i] = nafPoints.wnd), (wnd[i] = nafPoints.points);\n }\n for (i = len - 1; i >= 1; i -= 2) {\n var a = i - 1,\n b = i;\n if (wndWidth[a] !== 1 || wndWidth[b] !== 1) {\n (naf[a] = getNAF(coeffs[a], wndWidth[a], this._bitLength)),\n (naf[b] = getNAF(coeffs[b], wndWidth[b], this._bitLength)),\n (max = Math.max(naf[a].length, max)),\n (max = Math.max(naf[b].length, max));\n continue;\n }\n var comb = [points[a], null, null, points[b]];\n points[a].y.cmp(points[b].y) === 0\n ? ((comb[1] = points[a].add(points[b])), (comb[2] = points[a].toJ().mixedAdd(points[b].neg())))\n : points[a].y.cmp(points[b].y.redNeg()) === 0\n ? ((comb[1] = points[a].toJ().mixedAdd(points[b])), (comb[2] = points[a].add(points[b].neg())))\n : ((comb[1] = points[a].toJ().mixedAdd(points[b])), (comb[2] = points[a].toJ().mixedAdd(points[b].neg())));\n var index = [-3, -1, -5, -7, 0, 7, 5, 1, 3],\n jsf = getJSF(coeffs[a], coeffs[b]);\n for (\n max = Math.max(jsf[0].length, max), naf[a] = new Array(max), naf[b] = new Array(max), j = 0;\n j < max;\n j++\n ) {\n var ja = jsf[0][j] | 0,\n jb = jsf[1][j] | 0;\n (naf[a][j] = index[(ja + 1) * 3 + (jb + 1)]), (naf[b][j] = 0), (wnd[a] = comb);\n }\n }\n var acc = this.jpoint(null, null, null),\n tmp = this._wnafT4;\n for (i = max; i >= 0; i--) {\n for (var k = 0; i >= 0; ) {\n var zero = !0;\n for (j = 0; j < len; j++) (tmp[j] = naf[j][i] | 0), tmp[j] !== 0 && (zero = !1);\n if (!zero) break;\n k++, i--;\n }\n if ((i >= 0 && k++, (acc = acc.dblp(k)), i < 0)) break;\n for (j = 0; j < len; j++) {\n var z = tmp[j];\n z !== 0 &&\n (z > 0 ? (p = wnd[j][(z - 1) >> 1]) : z < 0 && (p = wnd[j][(-z - 1) >> 1].neg()),\n p.type === \"affine\" ? (acc = acc.mixedAdd(p)) : (acc = acc.add(p)));\n }\n }\n for (i = 0; i < len; i++) wnd[i] = null;\n return jacobianResult ? acc : acc.toP();\n };\n function BasePoint(curve, type) {\n (this.curve = curve), (this.type = type), (this.precomputed = null);\n }\n BaseCurve.BasePoint = BasePoint;\n BasePoint.prototype.eq = function () {\n throw new Error(\"Not implemented\");\n };\n BasePoint.prototype.validate = function () {\n return this.curve.validate(this);\n };\n BaseCurve.prototype.decodePoint = function (bytes, enc) {\n bytes = utils.toArray(bytes, enc);\n var len = this.p.byteLength();\n if ((bytes[0] === 4 || bytes[0] === 6 || bytes[0] === 7) && bytes.length - 1 === 2 * len) {\n bytes[0] === 6\n ? assert(bytes[bytes.length - 1] % 2 === 0)\n : bytes[0] === 7 && assert(bytes[bytes.length - 1] % 2 === 1);\n var res = this.point(bytes.slice(1, 1 + len), bytes.slice(1 + len, 1 + 2 * len));\n return res;\n } else if ((bytes[0] === 2 || bytes[0] === 3) && bytes.length - 1 === len)\n return this.pointFromX(bytes.slice(1, 1 + len), bytes[0] === 3);\n throw new Error(\"Unknown point format\");\n };\n BasePoint.prototype.encodeCompressed = function (enc) {\n return this.encode(enc, !0);\n };\n BasePoint.prototype._encode = function (compact) {\n var len = this.curve.p.byteLength(),\n x = this.getX().toArray(\"be\", len);\n return compact ? [this.getY().isEven() ? 2 : 3].concat(x) : [4].concat(x, this.getY().toArray(\"be\", len));\n };\n BasePoint.prototype.encode = function (enc, compact) {\n return utils.encode(this._encode(compact), enc);\n };\n BasePoint.prototype.precompute = function (power) {\n if (this.precomputed) return this;\n var precomputed = {\n doubles: null,\n naf: null,\n beta: null,\n };\n return (\n (precomputed.naf = this._getNAFPoints(8)),\n (precomputed.doubles = this._getDoubles(4, power)),\n (precomputed.beta = this._getBeta()),\n (this.precomputed = precomputed),\n this\n );\n };\n BasePoint.prototype._hasDoubles = function (k) {\n if (!this.precomputed) return !1;\n var doubles = this.precomputed.doubles;\n return doubles ? doubles.points.length >= Math.ceil((k.bitLength() + 1) / doubles.step) : !1;\n };\n BasePoint.prototype._getDoubles = function (step, power) {\n if (this.precomputed && this.precomputed.doubles) return this.precomputed.doubles;\n for (var doubles = [this], acc = this, i = 0; i < power; i += step) {\n for (var j = 0; j < step; j++) acc = acc.dbl();\n doubles.push(acc);\n }\n return {\n step,\n points: doubles,\n };\n };\n BasePoint.prototype._getNAFPoints = function (wnd) {\n if (this.precomputed && this.precomputed.naf) return this.precomputed.naf;\n for (var res = [this], max = (1 << wnd) - 1, dbl = max === 1 ? null : this.dbl(), i = 1; i < max; i++)\n res[i] = res[i - 1].add(dbl);\n return {\n wnd,\n points: res,\n };\n };\n BasePoint.prototype._getBeta = function () {\n return null;\n };\n BasePoint.prototype.dblp = function (k) {\n for (var r = this, i = 0; i < k; i++) r = r.dbl();\n return r;\n };\n },\n});\n\n// node_modules/elliptic/lib/elliptic/curve/short.js\nvar require_short = __commonJS({\n \"node_modules/elliptic/lib/elliptic/curve/short.js\"(exports, module) {\n \"use strict\";\n var utils = require_utils3(),\n BN = require_bn4(),\n inherits = require_inherits_browser(),\n Base = require_base(),\n assert = utils.assert;\n function ShortCurve(conf) {\n Base.call(this, \"short\", conf),\n (this.a = new BN(conf.a, 16).toRed(this.red)),\n (this.b = new BN(conf.b, 16).toRed(this.red)),\n (this.tinv = this.two.redInvm()),\n (this.zeroA = this.a.fromRed().cmpn(0) === 0),\n (this.threeA = this.a.fromRed().sub(this.p).cmpn(-3) === 0),\n (this.endo = this._getEndomorphism(conf)),\n (this._endoWnafT1 = new Array(4)),\n (this._endoWnafT2 = new Array(4));\n }\n inherits(ShortCurve, Base);\n module.exports = ShortCurve;\n ShortCurve.prototype._getEndomorphism = function (conf) {\n if (!(!this.zeroA || !this.g || !this.n || this.p.modn(3) !== 1)) {\n var beta, lambda;\n if (conf.beta) beta = new BN(conf.beta, 16).toRed(this.red);\n else {\n var betas = this._getEndoRoots(this.p);\n (beta = betas[0].cmp(betas[1]) < 0 ? betas[0] : betas[1]), (beta = beta.toRed(this.red));\n }\n if (conf.lambda) lambda = new BN(conf.lambda, 16);\n else {\n var lambdas = this._getEndoRoots(this.n);\n this.g.mul(lambdas[0]).x.cmp(this.g.x.redMul(beta)) === 0\n ? (lambda = lambdas[0])\n : ((lambda = lambdas[1]), assert(this.g.mul(lambda).x.cmp(this.g.x.redMul(beta)) === 0));\n }\n var basis;\n return (\n conf.basis\n ? (basis = conf.basis.map(function (vec) {\n return {\n a: new BN(vec.a, 16),\n b: new BN(vec.b, 16),\n };\n }))\n : (basis = this._getEndoBasis(lambda)),\n {\n beta,\n lambda,\n basis,\n }\n );\n }\n };\n ShortCurve.prototype._getEndoRoots = function (num) {\n var red = num === this.p ? this.red : BN.mont(num),\n tinv = new BN(2).toRed(red).redInvm(),\n ntinv = tinv.redNeg(),\n s = new BN(3).toRed(red).redNeg().redSqrt().redMul(tinv),\n l1 = ntinv.redAdd(s).fromRed(),\n l2 = ntinv.redSub(s).fromRed();\n return [l1, l2];\n };\n ShortCurve.prototype._getEndoBasis = function (lambda) {\n for (\n var aprxSqrt = this.n.ushrn(Math.floor(this.n.bitLength() / 2)),\n u = lambda,\n v = this.n.clone(),\n x1 = new BN(1),\n y1 = new BN(0),\n x2 = new BN(0),\n y2 = new BN(1),\n a0,\n b0,\n a1,\n b1,\n a2,\n b2,\n prevR,\n i = 0,\n r,\n x;\n u.cmpn(0) !== 0;\n\n ) {\n var q = v.div(u);\n (r = v.sub(q.mul(u))), (x = x2.sub(q.mul(x1)));\n var y = y2.sub(q.mul(y1));\n if (!a1 && r.cmp(aprxSqrt) < 0) (a0 = prevR.neg()), (b0 = x1), (a1 = r.neg()), (b1 = x);\n else if (a1 && ++i === 2) break;\n (prevR = r), (v = u), (u = r), (x2 = x1), (x1 = x), (y2 = y1), (y1 = y);\n }\n (a2 = r.neg()), (b2 = x);\n var len1 = a1.sqr().add(b1.sqr()),\n len2 = a2.sqr().add(b2.sqr());\n return (\n len2.cmp(len1) >= 0 && ((a2 = a0), (b2 = b0)),\n a1.negative && ((a1 = a1.neg()), (b1 = b1.neg())),\n a2.negative && ((a2 = a2.neg()), (b2 = b2.neg())),\n [\n { a: a1, b: b1 },\n { a: a2, b: b2 },\n ]\n );\n };\n ShortCurve.prototype._endoSplit = function (k) {\n var basis = this.endo.basis,\n v1 = basis[0],\n v2 = basis[1],\n c1 = v2.b.mul(k).divRound(this.n),\n c2 = v1.b.neg().mul(k).divRound(this.n),\n p1 = c1.mul(v1.a),\n p2 = c2.mul(v2.a),\n q1 = c1.mul(v1.b),\n q2 = c2.mul(v2.b),\n k1 = k.sub(p1).sub(p2),\n k2 = q1.add(q2).neg();\n return { k1, k2 };\n };\n ShortCurve.prototype.pointFromX = function (x, odd) {\n (x = new BN(x, 16)), x.red || (x = x.toRed(this.red));\n var y2 = x.redSqr().redMul(x).redIAdd(x.redMul(this.a)).redIAdd(this.b),\n y = y2.redSqrt();\n if (y.redSqr().redSub(y2).cmp(this.zero) !== 0) throw new Error(\"invalid point\");\n var isOdd = y.fromRed().isOdd();\n return ((odd && !isOdd) || (!odd && isOdd)) && (y = y.redNeg()), this.point(x, y);\n };\n ShortCurve.prototype.validate = function (point) {\n if (point.inf) return !0;\n var x = point.x,\n y = point.y,\n ax = this.a.redMul(x),\n rhs = x.redSqr().redMul(x).redIAdd(ax).redIAdd(this.b);\n return y.redSqr().redISub(rhs).cmpn(0) === 0;\n };\n ShortCurve.prototype._endoWnafMulAdd = function (points, coeffs, jacobianResult) {\n for (var npoints = this._endoWnafT1, ncoeffs = this._endoWnafT2, i = 0; i < points.length; i++) {\n var split = this._endoSplit(coeffs[i]),\n p = points[i],\n beta = p._getBeta();\n split.k1.negative && (split.k1.ineg(), (p = p.neg(!0))),\n split.k2.negative && (split.k2.ineg(), (beta = beta.neg(!0))),\n (npoints[i * 2] = p),\n (npoints[i * 2 + 1] = beta),\n (ncoeffs[i * 2] = split.k1),\n (ncoeffs[i * 2 + 1] = split.k2);\n }\n for (var res = this._wnafMulAdd(1, npoints, ncoeffs, i * 2, jacobianResult), j = 0; j < i * 2; j++)\n (npoints[j] = null), (ncoeffs[j] = null);\n return res;\n };\n function Point(curve, x, y, isRed) {\n Base.BasePoint.call(this, curve, \"affine\"),\n x === null && y === null\n ? ((this.x = null), (this.y = null), (this.inf = !0))\n : ((this.x = new BN(x, 16)),\n (this.y = new BN(y, 16)),\n isRed && (this.x.forceRed(this.curve.red), this.y.forceRed(this.curve.red)),\n this.x.red || (this.x = this.x.toRed(this.curve.red)),\n this.y.red || (this.y = this.y.toRed(this.curve.red)),\n (this.inf = !1));\n }\n inherits(Point, Base.BasePoint);\n ShortCurve.prototype.point = function (x, y, isRed) {\n return new Point(this, x, y, isRed);\n };\n ShortCurve.prototype.pointFromJSON = function (obj, red) {\n return Point.fromJSON(this, obj, red);\n };\n Point.prototype._getBeta = function () {\n if (!!this.curve.endo) {\n var pre = this.precomputed;\n if (pre && pre.beta) return pre.beta;\n var beta = this.curve.point(this.x.redMul(this.curve.endo.beta), this.y);\n if (pre) {\n var curve = this.curve,\n endoMul = function (p) {\n return curve.point(p.x.redMul(curve.endo.beta), p.y);\n };\n (pre.beta = beta),\n (beta.precomputed = {\n beta: null,\n naf: pre.naf && {\n wnd: pre.naf.wnd,\n points: pre.naf.points.map(endoMul),\n },\n doubles: pre.doubles && {\n step: pre.doubles.step,\n points: pre.doubles.points.map(endoMul),\n },\n });\n }\n return beta;\n }\n };\n Point.prototype.toJSON = function () {\n return this.precomputed\n ? [\n this.x,\n this.y,\n this.precomputed && {\n doubles: this.precomputed.doubles && {\n step: this.precomputed.doubles.step,\n points: this.precomputed.doubles.points.slice(1),\n },\n naf: this.precomputed.naf && {\n wnd: this.precomputed.naf.wnd,\n points: this.precomputed.naf.points.slice(1),\n },\n },\n ]\n : [this.x, this.y];\n };\n Point.fromJSON = function (curve, obj, red) {\n typeof obj == \"string\" && (obj = JSON.parse(obj));\n var res = curve.point(obj[0], obj[1], red);\n if (!obj[2]) return res;\n function obj2point(obj2) {\n return curve.point(obj2[0], obj2[1], red);\n }\n var pre = obj[2];\n return (\n (res.precomputed = {\n beta: null,\n doubles: pre.doubles && {\n step: pre.doubles.step,\n points: [res].concat(pre.doubles.points.map(obj2point)),\n },\n naf: pre.naf && {\n wnd: pre.naf.wnd,\n points: [res].concat(pre.naf.points.map(obj2point)),\n },\n }),\n res\n );\n };\n Point.prototype.inspect = function () {\n return this.isInfinity()\n ? \"<EC Point Infinity>\"\n : \"<EC Point x: \" + this.x.fromRed().toString(16, 2) + \" y: \" + this.y.fromRed().toString(16, 2) + \">\";\n };\n Point.prototype.isInfinity = function () {\n return this.inf;\n };\n Point.prototype.add = function (p) {\n if (this.inf) return p;\n if (p.inf) return this;\n if (this.eq(p)) return this.dbl();\n if (this.neg().eq(p)) return this.curve.point(null, null);\n if (this.x.cmp(p.x) === 0) return this.curve.point(null, null);\n var c = this.y.redSub(p.y);\n c.cmpn(0) !== 0 && (c = c.redMul(this.x.redSub(p.x).redInvm()));\n var nx = c.redSqr().redISub(this.x).redISub(p.x),\n ny = c.redMul(this.x.redSub(nx)).redISub(this.y);\n return this.curve.point(nx, ny);\n };\n Point.prototype.dbl = function () {\n if (this.inf) return this;\n var ys1 = this.y.redAdd(this.y);\n if (ys1.cmpn(0) === 0) return this.curve.point(null, null);\n var a = this.curve.a,\n x2 = this.x.redSqr(),\n dyinv = ys1.redInvm(),\n c = x2.redAdd(x2).redIAdd(x2).redIAdd(a).redMul(dyinv),\n nx = c.redSqr().redISub(this.x.redAdd(this.x)),\n ny = c.redMul(this.x.redSub(nx)).redISub(this.y);\n return this.curve.point(nx, ny);\n };\n Point.prototype.getX = function () {\n return this.x.fromRed();\n };\n Point.prototype.getY = function () {\n return this.y.fromRed();\n };\n Point.prototype.mul = function (k) {\n return (\n (k = new BN(k, 16)),\n this.isInfinity()\n ? this\n : this._hasDoubles(k)\n ? this.curve._fixedNafMul(this, k)\n : this.curve.endo\n ? this.curve._endoWnafMulAdd([this], [k])\n : this.curve._wnafMul(this, k)\n );\n };\n Point.prototype.mulAdd = function (k1, p2, k2) {\n var points = [this, p2],\n coeffs = [k1, k2];\n return this.curve.endo\n ? this.curve._endoWnafMulAdd(points, coeffs)\n : this.curve._wnafMulAdd(1, points, coeffs, 2);\n };\n Point.prototype.jmulAdd = function (k1, p2, k2) {\n var points = [this, p2],\n coeffs = [k1, k2];\n return this.curve.endo\n ? this.curve._endoWnafMulAdd(points, coeffs, !0)\n : this.curve._wnafMulAdd(1, points, coeffs, 2, !0);\n };\n Point.prototype.eq = function (p) {\n return this === p || (this.inf === p.inf && (this.inf || (this.x.cmp(p.x) === 0 && this.y.cmp(p.y) === 0)));\n };\n Point.prototype.neg = function (_precompute) {\n if (this.inf) return this;\n var res = this.curve.point(this.x, this.y.redNeg());\n if (_precompute && this.precomputed) {\n var pre = this.precomputed,\n negate = function (p) {\n return p.neg();\n };\n res.precomputed = {\n naf: pre.naf && {\n wnd: pre.naf.wnd,\n points: pre.naf.points.map(negate),\n },\n doubles: pre.doubles && {\n step: pre.doubles.step,\n points: pre.doubles.points.map(negate),\n },\n };\n }\n return res;\n };\n Point.prototype.toJ = function () {\n if (this.inf) return this.curve.jpoint(null, null, null);\n var res = this.curve.jpoint(this.x, this.y, this.curve.one);\n return res;\n };\n function JPoint(curve, x, y, z) {\n Base.BasePoint.call(this, curve, \"jacobian\"),\n x === null && y === null && z === null\n ? ((this.x = this.curve.one), (this.y = this.curve.one), (this.z = new BN(0)))\n : ((this.x = new BN(x, 16)), (this.y = new BN(y, 16)), (this.z = new BN(z, 16))),\n this.x.red || (this.x = this.x.toRed(this.curve.red)),\n this.y.red || (this.y = this.y.toRed(this.curve.red)),\n this.z.red || (this.z = this.z.toRed(this.curve.red)),\n (this.zOne = this.z === this.curve.one);\n }\n inherits(JPoint, Base.BasePoint);\n ShortCurve.prototype.jpoint = function (x, y, z) {\n return new JPoint(this, x, y, z);\n };\n JPoint.prototype.toP = function () {\n if (this.isInfinity()) return this.curve.point(null, null);\n var zinv = this.z.redInvm(),\n zinv2 = zinv.redSqr(),\n ax = this.x.redMul(zinv2),\n ay = this.y.redMul(zinv2).redMul(zinv);\n return this.curve.point(ax, ay);\n };\n JPoint.prototype.neg = function () {\n return this.curve.jpoint(this.x, this.y.redNeg(), this.z);\n };\n JPoint.prototype.add = function (p) {\n if (this.isInfinity()) return p;\n if (p.isInfinity()) return this;\n var pz2 = p.z.redSqr(),\n z2 = this.z.redSqr(),\n u1 = this.x.redMul(pz2),\n u2 = p.x.redMul(z2),\n s1 = this.y.redMul(pz2.redMul(p.z)),\n s2 = p.y.redMul(z2.redMul(this.z)),\n h = u1.redSub(u2),\n r = s1.redSub(s2);\n if (h.cmpn(0) === 0) return r.cmpn(0) !== 0 ? this.curve.jpoint(null, null, null) : this.dbl();\n var h2 = h.redSqr(),\n h3 = h2.redMul(h),\n v = u1.redMul(h2),\n nx = r.redSqr().redIAdd(h3).redISub(v).redISub(v),\n ny = r.redMul(v.redISub(nx)).redISub(s1.redMul(h3)),\n nz = this.z.redMul(p.z).redMul(h);\n return this.curve.jpoint(nx, ny, nz);\n };\n JPoint.prototype.mixedAdd = function (p) {\n if (this.isInfinity()) return p.toJ();\n if (p.isInfinity()) return this;\n var z2 = this.z.redSqr(),\n u1 = this.x,\n u2 = p.x.redMul(z2),\n s1 = this.y,\n s2 = p.y.redMul(z2).redMul(this.z),\n h = u1.redSub(u2),\n r = s1.redSub(s2);\n if (h.cmpn(0) === 0) return r.cmpn(0) !== 0 ? this.curve.jpoint(null, null, null) : this.dbl();\n var h2 = h.redSqr(),\n h3 = h2.redMul(h),\n v = u1.redMul(h2),\n nx = r.redSqr().redIAdd(h3).redISub(v).redISub(v),\n ny = r.redMul(v.redISub(nx)).redISub(s1.redMul(h3)),\n nz = this.z.redMul(h);\n return this.curve.jpoint(nx, ny, nz);\n };\n JPoint.prototype.dblp = function (pow) {\n if (pow === 0) return this;\n if (this.isInfinity()) return this;\n if (!pow) return this.dbl();\n var i;\n if (this.curve.zeroA || this.curve.threeA) {\n var r = this;\n for (i = 0; i < pow; i++) r = r.dbl();\n return r;\n }\n var a = this.curve.a,\n tinv = this.curve.tinv,\n jx = this.x,\n jy = this.y,\n jz = this.z,\n jz4 = jz.redSqr().redSqr(),\n jyd = jy.redAdd(jy);\n for (i = 0; i < pow; i++) {\n var jx2 = jx.redSqr(),\n jyd2 = jyd.redSqr(),\n jyd4 = jyd2.redSqr(),\n c = jx2.redAdd(jx2).redIAdd(jx2).redIAdd(a.redMul(jz4)),\n t1 = jx.redMul(jyd2),\n nx = c.redSqr().redISub(t1.redAdd(t1)),\n t2 = t1.redISub(nx),\n dny = c.redMul(t2);\n dny = dny.redIAdd(dny).redISub(jyd4);\n var nz = jyd.redMul(jz);\n i + 1 < pow && (jz4 = jz4.redMul(jyd4)), (jx = nx), (jz = nz), (jyd = dny);\n }\n return this.curve.jpoint(jx, jyd.redMul(tinv), jz);\n };\n JPoint.prototype.dbl = function () {\n return this.isInfinity()\n ? this\n : this.curve.zeroA\n ? this._zeroDbl()\n : this.curve.threeA\n ? this._threeDbl()\n : this._dbl();\n };\n JPoint.prototype._zeroDbl = function () {\n var nx, ny, nz;\n if (this.zOne) {\n var xx = this.x.redSqr(),\n yy = this.y.redSqr(),\n yyyy = yy.redSqr(),\n s = this.x.redAdd(yy).redSqr().redISub(xx).redISub(yyyy);\n s = s.redIAdd(s);\n var m = xx.redAdd(xx).redIAdd(xx),\n t = m.redSqr().redISub(s).redISub(s),\n yyyy8 = yyyy.redIAdd(yyyy);\n (yyyy8 = yyyy8.redIAdd(yyyy8)),\n (yyyy8 = yyyy8.redIAdd(yyyy8)),\n (nx = t),\n (ny = m.redMul(s.redISub(t)).redISub(yyyy8)),\n (nz = this.y.redAdd(this.y));\n } else {\n var a = this.x.redSqr(),\n b = this.y.redSqr(),\n c = b.redSqr(),\n d = this.x.redAdd(b).redSqr().redISub(a).redISub(c);\n d = d.redIAdd(d);\n var e = a.redAdd(a).redIAdd(a),\n f = e.redSqr(),\n c8 = c.redIAdd(c);\n (c8 = c8.redIAdd(c8)),\n (c8 = c8.redIAdd(c8)),\n (nx = f.redISub(d).redISub(d)),\n (ny = e.redMul(d.redISub(nx)).redISub(c8)),\n (nz = this.y.redMul(this.z)),\n (nz = nz.redIAdd(nz));\n }\n return this.curve.jpoint(nx, ny, nz);\n };\n JPoint.prototype._threeDbl = function () {\n var nx, ny, nz;\n if (this.zOne) {\n var xx = this.x.redSqr(),\n yy = this.y.redSqr(),\n yyyy = yy.redSqr(),\n s = this.x.redAdd(yy).redSqr().redISub(xx).redISub(yyyy);\n s = s.redIAdd(s);\n var m = xx.redAdd(xx).redIAdd(xx).redIAdd(this.curve.a),\n t = m.redSqr().redISub(s).redISub(s);\n nx = t;\n var yyyy8 = yyyy.redIAdd(yyyy);\n (yyyy8 = yyyy8.redIAdd(yyyy8)),\n (yyyy8 = yyyy8.redIAdd(yyyy8)),\n (ny = m.redMul(s.redISub(t)).redISub(yyyy8)),\n (nz = this.y.redAdd(this.y));\n } else {\n var delta = this.z.redSqr(),\n gamma = this.y.redSqr(),\n beta = this.x.redMul(gamma),\n alpha = this.x.redSub(delta).redMul(this.x.redAdd(delta));\n alpha = alpha.redAdd(alpha).redIAdd(alpha);\n var beta4 = beta.redIAdd(beta);\n beta4 = beta4.redIAdd(beta4);\n var beta8 = beta4.redAdd(beta4);\n (nx = alpha.redSqr().redISub(beta8)), (nz = this.y.redAdd(this.z).redSqr().redISub(gamma).redISub(delta));\n var ggamma8 = gamma.redSqr();\n (ggamma8 = ggamma8.redIAdd(ggamma8)),\n (ggamma8 = ggamma8.redIAdd(ggamma8)),\n (ggamma8 = ggamma8.redIAdd(ggamma8)),\n (ny = alpha.redMul(beta4.redISub(nx)).redISub(ggamma8));\n }\n return this.curve.jpoint(nx, ny, nz);\n };\n JPoint.prototype._dbl = function () {\n var a = this.curve.a,\n jx = this.x,\n jy = this.y,\n jz = this.z,\n jz4 = jz.redSqr().redSqr(),\n jx2 = jx.redSqr(),\n jy2 = jy.redSqr(),\n c = jx2.redAdd(jx2).redIAdd(jx2).redIAdd(a.redMul(jz4)),\n jxd4 = jx.redAdd(jx);\n jxd4 = jxd4.redIAdd(jxd4);\n var t1 = jxd4.redMul(jy2),\n nx = c.redSqr().redISub(t1.redAdd(t1)),\n t2 = t1.redISub(nx),\n jyd8 = jy2.redSqr();\n (jyd8 = jyd8.redIAdd(jyd8)), (jyd8 = jyd8.redIAdd(jyd8)), (jyd8 = jyd8.redIAdd(jyd8));\n var ny = c.redMul(t2).redISub(jyd8),\n nz = jy.redAdd(jy).redMul(jz);\n return this.curve.jpoint(nx, ny, nz);\n };\n JPoint.prototype.trpl = function () {\n if (!this.curve.zeroA) return this.dbl().add(this);\n var xx = this.x.redSqr(),\n yy = this.y.redSqr(),\n zz = this.z.redSqr(),\n yyyy = yy.redSqr(),\n m = xx.redAdd(xx).redIAdd(xx),\n mm = m.redSqr(),\n e = this.x.redAdd(yy).redSqr().redISub(xx).redISub(yyyy);\n (e = e.redIAdd(e)), (e = e.redAdd(e).redIAdd(e)), (e = e.redISub(mm));\n var ee = e.redSqr(),\n t = yyyy.redIAdd(yyyy);\n (t = t.redIAdd(t)), (t = t.redIAdd(t)), (t = t.redIAdd(t));\n var u = m.redIAdd(e).redSqr().redISub(mm).redISub(ee).redISub(t),\n yyu4 = yy.redMul(u);\n (yyu4 = yyu4.redIAdd(yyu4)), (yyu4 = yyu4.redIAdd(yyu4));\n var nx = this.x.redMul(ee).redISub(yyu4);\n (nx = nx.redIAdd(nx)), (nx = nx.redIAdd(nx));\n var ny = this.y.redMul(u.redMul(t.redISub(u)).redISub(e.redMul(ee)));\n (ny = ny.redIAdd(ny)), (ny = ny.redIAdd(ny)), (ny = ny.redIAdd(ny));\n var nz = this.z.redAdd(e).redSqr().redISub(zz).redISub(ee);\n return this.curve.jpoint(nx, ny, nz);\n };\n JPoint.prototype.mul = function (k, kbase) {\n return (k = new BN(k, kbase)), this.curve._wnafMul(this, k);\n };\n JPoint.prototype.eq = function (p) {\n if (p.type === \"affine\") return this.eq(p.toJ());\n if (this === p) return !0;\n var z2 = this.z.redSqr(),\n pz2 = p.z.redSqr();\n if (this.x.redMul(pz2).redISub(p.x.redMul(z2)).cmpn(0) !== 0) return !1;\n var z3 = z2.redMul(this.z),\n pz3 = pz2.redMul(p.z);\n return this.y.redMul(pz3).redISub(p.y.redMul(z3)).cmpn(0) === 0;\n };\n JPoint.prototype.eqXToP = function (x) {\n var zs = this.z.redSqr(),\n rx = x.toRed(this.curve.red).redMul(zs);\n if (this.x.cmp(rx) === 0) return !0;\n for (var xc = x.clone(), t = this.curve.redN.redMul(zs); ; ) {\n if ((xc.iadd(this.curve.n), xc.cmp(this.curve.p) >= 0)) return !1;\n if ((rx.redIAdd(t), this.x.cmp(rx) === 0)) return !0;\n }\n };\n JPoint.prototype.inspect = function () {\n return this.isInfinity()\n ? \"<EC JPoint Infinity>\"\n : \"<EC JPoint x: \" +\n this.x.toString(16, 2) +\n \" y: \" +\n this.y.toString(16, 2) +\n \" z: \" +\n this.z.toString(16, 2) +\n \">\";\n };\n JPoint.prototype.isInfinity = function () {\n return this.z.cmpn(0) === 0;\n };\n },\n});\n\n// node_modules/elliptic/lib/elliptic/curve/mont.js\nvar require_mont = __commonJS({\n \"node_modules/elliptic/lib/elliptic/curve/mont.js\"(exports, module) {\n \"use strict\";\n var BN = require_bn4(),\n inherits = require_inherits_browser(),\n Base = require_base(),\n utils = require_utils3();\n function MontCurve(conf) {\n Base.call(this, \"mont\", conf),\n (this.a = new BN(conf.a, 16).toRed(this.red)),\n (this.b = new BN(conf.b, 16).toRed(this.red)),\n (this.i4 = new BN(4).toRed(this.red).redInvm()),\n (this.two = new BN(2).toRed(this.red)),\n (this.a24 = this.i4.redMul(this.a.redAdd(this.two)));\n }\n inherits(MontCurve, Base);\n module.exports = MontCurve;\n MontCurve.prototype.validate = function (point) {\n var x = point.normalize().x,\n x2 = x.redSqr(),\n rhs = x2.redMul(x).redAdd(x2.redMul(this.a)).redAdd(x),\n y = rhs.redSqrt();\n return y.redSqr().cmp(rhs) === 0;\n };\n function Point(curve, x, z) {\n Base.BasePoint.call(this, curve, \"projective\"),\n x === null && z === null\n ? ((this.x = this.curve.one), (this.z = this.curve.zero))\n : ((this.x = new BN(x, 16)),\n (this.z = new BN(z, 16)),\n this.x.red || (this.x = this.x.toRed(this.curve.red)),\n this.z.red || (this.z = this.z.toRed(this.curve.red)));\n }\n inherits(Point, Base.BasePoint);\n MontCurve.prototype.decodePoint = function (bytes, enc) {\n return this.point(utils.toArray(bytes, enc), 1);\n };\n MontCurve.prototype.point = function (x, z) {\n return new Point(this, x, z);\n };\n MontCurve.prototype.pointFromJSON = function (obj) {\n return Point.fromJSON(this, obj);\n };\n Point.prototype.precompute = function () {};\n Point.prototype._encode = function () {\n return this.getX().toArray(\"be\", this.curve.p.byteLength());\n };\n Point.fromJSON = function (curve, obj) {\n return new Point(curve, obj[0], obj[1] || curve.one);\n };\n Point.prototype.inspect = function () {\n return this.isInfinity()\n ? \"<EC Point Infinity>\"\n : \"<EC Point x: \" + this.x.fromRed().toString(16, 2) + \" z: \" + this.z.fromRed().toString(16, 2) + \">\";\n };\n Point.prototype.isInfinity = function () {\n return this.z.cmpn(0) === 0;\n };\n Point.prototype.dbl = function () {\n var a = this.x.redAdd(this.z),\n aa = a.redSqr(),\n b = this.x.redSub(this.z),\n bb = b.redSqr(),\n c = aa.redSub(bb),\n nx = aa.redMul(bb),\n nz = c.redMul(bb.redAdd(this.curve.a24.redMul(c)));\n return this.curve.point(nx, nz);\n };\n Point.prototype.add = function () {\n throw new Error(\"Not supported on Montgomery curve\");\n };\n Point.prototype.diffAdd = function (p, diff) {\n var a = this.x.redAdd(this.z),\n b = this.x.redSub(this.z),\n c = p.x.redAdd(p.z),\n d = p.x.redSub(p.z),\n da = d.redMul(a),\n cb = c.redMul(b),\n nx = diff.z.redMul(da.redAdd(cb).redSqr()),\n nz = diff.x.redMul(da.redISub(cb).redSqr());\n return this.curve.point(nx, nz);\n };\n Point.prototype.mul = function (k) {\n for (\n var t = k.clone(), a = this, b = this.curve.point(null, null), c = this, bits = [];\n t.cmpn(0) !== 0;\n t.iushrn(1)\n )\n bits.push(t.andln(1));\n for (var i = bits.length - 1; i >= 0; i--)\n bits[i] === 0 ? ((a = a.diffAdd(b, c)), (b = b.dbl())) : ((b = a.diffAdd(b, c)), (a = a.dbl()));\n return b;\n };\n Point.prototype.mulAdd = function () {\n throw new Error(\"Not supported on Montgomery curve\");\n };\n Point.prototype.jumlAdd = function () {\n throw new Error(\"Not supported on Montgomery curve\");\n };\n Point.prototype.eq = function (other) {\n return this.getX().cmp(other.getX()) === 0;\n };\n Point.prototype.normalize = function () {\n return (this.x = this.x.redMul(this.z.redInvm())), (this.z = this.curve.one), this;\n };\n Point.prototype.getX = function () {\n return this.normalize(), this.x.fromRed();\n };\n },\n});\n\n// node_modules/elliptic/lib/elliptic/curve/edwards.js\nvar require_edwards = __commonJS({\n \"node_modules/elliptic/lib/elliptic/curve/edwards.js\"(exports, module) {\n \"use strict\";\n var utils = require_utils3(),\n BN = require_bn4(),\n inherits = require_inherits_browser(),\n Base = require_base(),\n assert = utils.assert;\n function EdwardsCurve(conf) {\n (this.twisted = (conf.a | 0) !== 1),\n (this.mOneA = this.twisted && (conf.a | 0) === -1),\n (this.extended = this.mOneA),\n Base.call(this, \"edwards\", conf),\n (this.a = new BN(conf.a, 16).umod(this.red.m)),\n (this.a = this.a.toRed(this.red)),\n (this.c = new BN(conf.c, 16).toRed(this.red)),\n (this.c2 = this.c.redSqr()),\n (this.d = new BN(conf.d, 16).toRed(this.red)),\n (this.dd = this.d.redAdd(this.d)),\n assert(!this.twisted || this.c.fromRed().cmpn(1) === 0),\n (this.oneC = (conf.c | 0) === 1);\n }\n inherits(EdwardsCurve, Base);\n module.exports = EdwardsCurve;\n EdwardsCurve.prototype._mulA = function (num) {\n return this.mOneA ? num.redNeg() : this.a.redMul(num);\n };\n EdwardsCurve.prototype._mulC = function (num) {\n return this.oneC ? num : this.c.redMul(num);\n };\n EdwardsCurve.prototype.jpoint = function (x, y, z, t) {\n return this.point(x, y, z, t);\n };\n EdwardsCurve.prototype.pointFromX = function (x, odd) {\n (x = new BN(x, 16)), x.red || (x = x.toRed(this.red));\n var x2 = x.redSqr(),\n rhs = this.c2.redSub(this.a.redMul(x2)),\n lhs = this.one.redSub(this.c2.redMul(this.d).redMul(x2)),\n y2 = rhs.redMul(lhs.redInvm()),\n y = y2.redSqrt();\n if (y.redSqr().redSub(y2).cmp(this.zero) !== 0) throw new Error(\"invalid point\");\n var isOdd = y.fromRed().isOdd();\n return ((odd && !isOdd) || (!odd && isOdd)) && (y = y.redNeg()), this.point(x, y);\n };\n EdwardsCurve.prototype.pointFromY = function (y, odd) {\n (y = new BN(y, 16)), y.red || (y = y.toRed(this.red));\n var y2 = y.redSqr(),\n lhs = y2.redSub(this.c2),\n rhs = y2.redMul(this.d).redMul(this.c2).redSub(this.a),\n x2 = lhs.redMul(rhs.redInvm());\n if (x2.cmp(this.zero) === 0) {\n if (odd) throw new Error(\"invalid point\");\n return this.point(this.zero, y);\n }\n var x = x2.redSqrt();\n if (x.redSqr().redSub(x2).cmp(this.zero) !== 0) throw new Error(\"invalid point\");\n return x.fromRed().isOdd() !== odd && (x = x.redNeg()), this.point(x, y);\n };\n EdwardsCurve.prototype.validate = function (point) {\n if (point.isInfinity()) return !0;\n point.normalize();\n var x2 = point.x.redSqr(),\n y2 = point.y.redSqr(),\n lhs = x2.redMul(this.a).redAdd(y2),\n rhs = this.c2.redMul(this.one.redAdd(this.d.redMul(x2).redMul(y2)));\n return lhs.cmp(rhs) === 0;\n };\n function Point(curve, x, y, z, t) {\n Base.BasePoint.call(this, curve, \"projective\"),\n x === null && y === null && z === null\n ? ((this.x = this.curve.zero),\n (this.y = this.curve.one),\n (this.z = this.curve.one),\n (this.t = this.curve.zero),\n (this.zOne = !0))\n : ((this.x = new BN(x, 16)),\n (this.y = new BN(y, 16)),\n (this.z = z ? new BN(z, 16) : this.curve.one),\n (this.t = t && new BN(t, 16)),\n this.x.red || (this.x = this.x.toRed(this.curve.red)),\n this.y.red || (this.y = this.y.toRed(this.curve.red)),\n this.z.red || (this.z = this.z.toRed(this.curve.red)),\n this.t && !this.t.red && (this.t = this.t.toRed(this.curve.red)),\n (this.zOne = this.z === this.curve.one),\n this.curve.extended &&\n !this.t &&\n ((this.t = this.x.redMul(this.y)), this.zOne || (this.t = this.t.redMul(this.z.redInvm()))));\n }\n inherits(Point, Base.BasePoint);\n EdwardsCurve.prototype.pointFromJSON = function (obj) {\n return Point.fromJSON(this, obj);\n };\n EdwardsCurve.prototype.point = function (x, y, z, t) {\n return new Point(this, x, y, z, t);\n };\n Point.fromJSON = function (curve, obj) {\n return new Point(curve, obj[0], obj[1], obj[2]);\n };\n Point.prototype.inspect = function () {\n return this.isInfinity()\n ? \"<EC Point Infinity>\"\n : \"<EC Point x: \" +\n this.x.fromRed().toString(16, 2) +\n \" y: \" +\n this.y.fromRed().toString(16, 2) +\n \" z: \" +\n this.z.fromRed().toString(16, 2) +\n \">\";\n };\n Point.prototype.isInfinity = function () {\n return this.x.cmpn(0) === 0 && (this.y.cmp(this.z) === 0 || (this.zOne && this.y.cmp(this.curve.c) === 0));\n };\n Point.prototype._extDbl = function () {\n var a = this.x.redSqr(),\n b = this.y.redSqr(),\n c = this.z.redSqr();\n c = c.redIAdd(c);\n var d = this.curve._mulA(a),\n e = this.x.redAdd(this.y).redSqr().redISub(a).redISub(b),\n g = d.redAdd(b),\n f = g.redSub(c),\n h = d.redSub(b),\n nx = e.redMul(f),\n ny = g.redMul(h),\n nt = e.redMul(h),\n nz = f.redMul(g);\n return this.curve.point(nx, ny, nz, nt);\n };\n Point.prototype._projDbl = function () {\n var b = this.x.redAdd(this.y).redSqr(),\n c = this.x.redSqr(),\n d = this.y.redSqr(),\n nx,\n ny,\n nz,\n e,\n h,\n j;\n if (this.curve.twisted) {\n e = this.curve._mulA(c);\n var f = e.redAdd(d);\n this.zOne\n ? ((nx = b.redSub(c).redSub(d).redMul(f.redSub(this.curve.two))),\n (ny = f.redMul(e.redSub(d))),\n (nz = f.redSqr().redSub(f).redSub(f)))\n : ((h = this.z.redSqr()),\n (j = f.redSub(h).redISub(h)),\n (nx = b.redSub(c).redISub(d).redMul(j)),\n (ny = f.redMul(e.redSub(d))),\n (nz = f.redMul(j)));\n } else\n (e = c.redAdd(d)),\n (h = this.curve._mulC(this.z).redSqr()),\n (j = e.redSub(h).redSub(h)),\n (nx = this.curve._mulC(b.redISub(e)).redMul(j)),\n (ny = this.curve._mulC(e).redMul(c.redISub(d))),\n (nz = e.redMul(j));\n return this.curve.point(nx, ny, nz);\n };\n Point.prototype.dbl = function () {\n return this.isInfinity() ? this : this.curve.extended ? this._extDbl() : this._projDbl();\n };\n Point.prototype._extAdd = function (p) {\n var a = this.y.redSub(this.x).redMul(p.y.redSub(p.x)),\n b = this.y.redAdd(this.x).redMul(p.y.redAdd(p.x)),\n c = this.t.redMul(this.curve.dd).redMul(p.t),\n d = this.z.redMul(p.z.redAdd(p.z)),\n e = b.redSub(a),\n f = d.redSub(c),\n g = d.redAdd(c),\n h = b.redAdd(a),\n nx = e.redMul(f),\n ny = g.redMul(h),\n nt = e.redMul(h),\n nz = f.redMul(g);\n return this.curve.point(nx, ny, nz, nt);\n };\n Point.prototype._projAdd = function (p) {\n var a = this.z.redMul(p.z),\n b = a.redSqr(),\n c = this.x.redMul(p.x),\n d = this.y.redMul(p.y),\n e = this.curve.d.redMul(c).redMul(d),\n f = b.redSub(e),\n g = b.redAdd(e),\n tmp = this.x.redAdd(this.y).redMul(p.x.redAdd(p.y)).redISub(c).redISub(d),\n nx = a.redMul(f).redMul(tmp),\n ny,\n nz;\n return (\n this.curve.twisted\n ? ((ny = a.redMul(g).redMul(d.redSub(this.curve._mulA(c)))), (nz = f.redMul(g)))\n : ((ny = a.redMul(g).redMul(d.redSub(c))), (nz = this.curve._mulC(f).redMul(g))),\n this.curve.point(nx, ny, nz)\n );\n };\n Point.prototype.add = function (p) {\n return this.isInfinity() ? p : p.isInfinity() ? this : this.curve.extended ? this._extAdd(p) : this._projAdd(p);\n };\n Point.prototype.mul = function (k) {\n return this._hasDoubles(k) ? this.curve._fixedNafMul(this, k) : this.curve._wnafMul(this, k);\n };\n Point.prototype.mulAdd = function (k1, p, k2) {\n return this.curve._wnafMulAdd(1, [this, p], [k1, k2], 2, !1);\n };\n Point.prototype.jmulAdd = function (k1, p, k2) {\n return this.curve._wnafMulAdd(1, [this, p], [k1, k2], 2, !0);\n };\n Point.prototype.normalize = function () {\n if (this.zOne) return this;\n var zi = this.z.redInvm();\n return (\n (this.x = this.x.redMul(zi)),\n (this.y = this.y.redMul(zi)),\n this.t && (this.t = this.t.redMul(zi)),\n (this.z = this.curve.one),\n (this.zOne = !0),\n this\n );\n };\n Point.prototype.neg = function () {\n return this.curve.point(this.x.redNeg(), this.y, this.z, this.t && this.t.redNeg());\n };\n Point.prototype.getX = function () {\n return this.normalize(), this.x.fromRed();\n };\n Point.prototype.getY = function () {\n return this.normalize(), this.y.fromRed();\n };\n Point.prototype.eq = function (other) {\n return this === other || (this.getX().cmp(other.getX()) === 0 && this.getY().cmp(other.getY()) === 0);\n };\n Point.prototype.eqXToP = function (x) {\n var rx = x.toRed(this.curve.red).redMul(this.z);\n if (this.x.cmp(rx) === 0) return !0;\n for (var xc = x.clone(), t = this.curve.redN.redMul(this.z); ; ) {\n if ((xc.iadd(this.curve.n), xc.cmp(this.curve.p) >= 0)) return !1;\n if ((rx.redIAdd(t), this.x.cmp(rx) === 0)) return !0;\n }\n };\n Point.prototype.toP = Point.prototype.normalize;\n Point.prototype.mixedAdd = Point.prototype.add;\n },\n});\n\n// node_modules/elliptic/lib/elliptic/curve/index.js\nvar require_curve = __commonJS({\n \"node_modules/elliptic/lib/elliptic/curve/index.js\"(exports) {\n \"use strict\";\n var curve = exports;\n curve.base = require_base();\n curve.short = require_short();\n curve.mont = require_mont();\n curve.edwards = require_edwards();\n },\n});\n\n// node_modules/hash.js/lib/hash/utils.js\nvar require_utils4 = __commonJS({\n \"node_modules/hash.js/lib/hash/utils.js\"(exports) {\n \"use strict\";\n var assert = require_minimalistic_assert(),\n inherits = require_inherits_browser();\n exports.inherits = inherits;\n function isSurrogatePair(msg, i) {\n return (msg.charCodeAt(i) & 64512) !== 55296 || i < 0 || i + 1 >= msg.length\n ? !1\n : (msg.charCodeAt(i + 1) & 64512) === 56320;\n }\n function toArray(msg, enc) {\n if (Array.isArray(msg)) return msg.slice();\n if (!msg) return [];\n var res = [];\n if (typeof msg == \"string\")\n if (enc) {\n if (enc === \"hex\")\n for (\n msg = msg.replace(/[^a-z0-9]+/gi, \"\"), msg.length % 2 !== 0 && (msg = \"0\" + msg), i = 0;\n i < msg.length;\n i += 2\n )\n res.push(parseInt(msg[i] + msg[i + 1], 16));\n } else\n for (var p = 0, i = 0; i < msg.length; i++) {\n var c = msg.charCodeAt(i);\n c < 128\n ? (res[p++] = c)\n : c < 2048\n ? ((res[p++] = (c >> 6) | 192), (res[p++] = (c & 63) | 128))\n : isSurrogatePair(msg, i)\n ? ((c = 65536 + ((c & 1023) << 10) + (msg.charCodeAt(++i) & 1023)),\n (res[p++] = (c >> 18) | 240),\n (res[p++] = ((c >> 12) & 63) | 128),\n (res[p++] = ((c >> 6) & 63) | 128),\n (res[p++] = (c & 63) | 128))\n : ((res[p++] = (c >> 12) | 224), (res[p++] = ((c >> 6) & 63) | 128), (res[p++] = (c & 63) | 128));\n }\n else for (i = 0; i < msg.length; i++) res[i] = msg[i] | 0;\n return res;\n }\n exports.toArray = toArray;\n function toHex(msg) {\n for (var res = \"\", i = 0; i < msg.length; i++) res += zero2(msg[i].toString(16));\n return res;\n }\n exports.toHex = toHex;\n function htonl(w) {\n var res = (w >>> 24) | ((w >>> 8) & 65280) | ((w << 8) & 16711680) | ((w & 255) << 24);\n return res >>> 0;\n }\n exports.htonl = htonl;\n function toHex32(msg, endian) {\n for (var res = \"\", i = 0; i < msg.length; i++) {\n var w = msg[i];\n endian === \"little\" && (w = htonl(w)), (res += zero8(w.toString(16)));\n }\n return res;\n }\n exports.toHex32 = toHex32;\n function zero2(word) {\n return word.length === 1 ? \"0\" + word : word;\n }\n exports.zero2 = zero2;\n function zero8(word) {\n return word.length === 7\n ? \"0\" + word\n : word.length === 6\n ? \"00\" + word\n : word.length === 5\n ? \"000\" + word\n : word.length === 4\n ? \"0000\" + word\n : word.length === 3\n ? \"00000\" + word\n : word.length === 2\n ? \"000000\" + word\n : word.length === 1\n ? \"0000000\" + word\n : word;\n }\n exports.zero8 = zero8;\n function join32(msg, start, end, endian) {\n var len = end - start;\n assert(len % 4 === 0);\n for (var res = new Array(len / 4), i = 0, k = start; i < res.length; i++, k += 4) {\n var w;\n endian === \"big\"\n ? (w = (msg[k] << 24) | (msg[k + 1] << 16) | (msg[k + 2] << 8) | msg[k + 3])\n : (w = (msg[k + 3] << 24) | (msg[k + 2] << 16) | (msg[k + 1] << 8) | msg[k]),\n (res[i] = w >>> 0);\n }\n return res;\n }\n exports.join32 = join32;\n function split32(msg, endian) {\n for (var res = new Array(msg.length * 4), i = 0, k = 0; i < msg.length; i++, k += 4) {\n var m = msg[i];\n endian === \"big\"\n ? ((res[k] = m >>> 24),\n (res[k + 1] = (m >>> 16) & 255),\n (res[k + 2] = (m >>> 8) & 255),\n (res[k + 3] = m & 255))\n : ((res[k + 3] = m >>> 24),\n (res[k + 2] = (m >>> 16) & 255),\n (res[k + 1] = (m >>> 8) & 255),\n (res[k] = m & 255));\n }\n return res;\n }\n exports.split32 = split32;\n function rotr32(w, b) {\n return (w >>> b) | (w << (32 - b));\n }\n exports.rotr32 = rotr32;\n function rotl32(w, b) {\n return (w << b) | (w >>> (32 - b));\n }\n exports.rotl32 = rotl32;\n function sum32(a, b) {\n return (a + b) >>> 0;\n }\n exports.sum32 = sum32;\n function sum32_3(a, b, c) {\n return (a + b + c) >>> 0;\n }\n exports.sum32_3 = sum32_3;\n function sum32_4(a, b, c, d) {\n return (a + b + c + d) >>> 0;\n }\n exports.sum32_4 = sum32_4;\n function sum32_5(a, b, c, d, e) {\n return (a + b + c + d + e) >>> 0;\n }\n exports.sum32_5 = sum32_5;\n function sum64(buf, pos, ah, al) {\n var bh = buf[pos],\n bl = buf[pos + 1],\n lo = (al + bl) >>> 0,\n hi = (lo < al ? 1 : 0) + ah + bh;\n (buf[pos] = hi >>> 0), (buf[pos + 1] = lo);\n }\n exports.sum64 = sum64;\n function sum64_hi(ah, al, bh, bl) {\n var lo = (al + bl) >>> 0,\n hi = (lo < al ? 1 : 0) + ah + bh;\n return hi >>> 0;\n }\n exports.sum64_hi = sum64_hi;\n function sum64_lo(ah, al, bh, bl) {\n var lo = al + bl;\n return lo >>> 0;\n }\n exports.sum64_lo = sum64_lo;\n function sum64_4_hi(ah, al, bh, bl, ch, cl, dh, dl) {\n var carry = 0,\n lo = al;\n (lo = (lo + bl) >>> 0),\n (carry += lo < al ? 1 : 0),\n (lo = (lo + cl) >>> 0),\n (carry += lo < cl ? 1 : 0),\n (lo = (lo + dl) >>> 0),\n (carry += lo < dl ? 1 : 0);\n var hi = ah + bh + ch + dh + carry;\n return hi >>> 0;\n }\n exports.sum64_4_hi = sum64_4_hi;\n function sum64_4_lo(ah, al, bh, bl, ch, cl, dh, dl) {\n var lo = al + bl + cl + dl;\n return lo >>> 0;\n }\n exports.sum64_4_lo = sum64_4_lo;\n function sum64_5_hi(ah, al, bh, bl, ch, cl, dh, dl, eh, el) {\n var carry = 0,\n lo = al;\n (lo = (lo + bl) >>> 0),\n (carry += lo < al ? 1 : 0),\n (lo = (lo + cl) >>> 0),\n (carry += lo < cl ? 1 : 0),\n (lo = (lo + dl) >>> 0),\n (carry += lo < dl ? 1 : 0),\n (lo = (lo + el) >>> 0),\n (carry += lo < el ? 1 : 0);\n var hi = ah + bh + ch + dh + eh + carry;\n return hi >>> 0;\n }\n exports.sum64_5_hi = sum64_5_hi;\n function sum64_5_lo(ah, al, bh, bl, ch, cl, dh, dl, eh, el) {\n var lo = al + bl + cl + dl + el;\n return lo >>> 0;\n }\n exports.sum64_5_lo = sum64_5_lo;\n function rotr64_hi(ah, al, num) {\n var r = (al << (32 - num)) | (ah >>> num);\n return r >>> 0;\n }\n exports.rotr64_hi = rotr64_hi;\n function rotr64_lo(ah, al, num) {\n var r = (ah << (32 - num)) | (al >>> num);\n return r >>> 0;\n }\n exports.rotr64_lo = rotr64_lo;\n function shr64_hi(ah, al, num) {\n return ah >>> num;\n }\n exports.shr64_hi = shr64_hi;\n function shr64_lo(ah, al, num) {\n var r = (ah << (32 - num)) | (al >>> num);\n return r >>> 0;\n }\n exports.shr64_lo = shr64_lo;\n },\n});\n\n// node_modules/hash.js/lib/hash/common.js\nvar require_common = __commonJS({\n \"node_modules/hash.js/lib/hash/common.js\"(exports) {\n \"use strict\";\n var utils = require_utils4(),\n assert = require_minimalistic_assert();\n function BlockHash() {\n (this.pending = null),\n (this.pendingTotal = 0),\n (this.blockSize = this.constructor.blockSize),\n (this.outSize = this.constructor.outSize),\n (this.hmacStrength = this.constructor.hmacStrength),\n (this.padLength = this.constructor.padLength / 8),\n (this.endian = \"big\"),\n (this._delta8 = this.blockSize / 8),\n (this._delta32 = this.blockSize / 32);\n }\n exports.BlockHash = BlockHash;\n BlockHash.prototype.update = function (msg, enc) {\n if (\n ((msg = utils.toArray(msg, enc)),\n this.pending ? (this.pending = this.pending.concat(msg)) : (this.pending = msg),\n (this.pendingTotal += msg.length),\n this.pending.length >= this._delta8)\n ) {\n msg = this.pending;\n var r = msg.length % this._delta8;\n (this.pending = msg.slice(msg.length - r, msg.length)),\n this.pending.length === 0 && (this.pending = null),\n (msg = utils.join32(msg, 0, msg.length - r, this.endian));\n for (var i = 0; i < msg.length; i += this._delta32) this._update(msg, i, i + this._delta32);\n }\n return this;\n };\n BlockHash.prototype.digest = function (enc) {\n return this.update(this._pad()), assert(this.pending === null), this._digest(enc);\n };\n BlockHash.prototype._pad = function () {\n var len = this.pendingTotal,\n bytes = this._delta8,\n k = bytes - ((len + this.padLength) % bytes),\n res = new Array(k + this.padLength);\n res[0] = 128;\n for (var i = 1; i < k; i++) res[i] = 0;\n if (((len <<= 3), this.endian === \"big\")) {\n for (var t = 8; t < this.padLength; t++) res[i++] = 0;\n (res[i++] = 0),\n (res[i++] = 0),\n (res[i++] = 0),\n (res[i++] = 0),\n (res[i++] = (len >>> 24) & 255),\n (res[i++] = (len >>> 16) & 255),\n (res[i++] = (len >>> 8) & 255),\n (res[i++] = len & 255);\n } else\n for (\n res[i++] = len & 255,\n res[i++] = (len >>> 8) & 255,\n res[i++] = (len >>> 16) & 255,\n res[i++] = (len >>> 24) & 255,\n res[i++] = 0,\n res[i++] = 0,\n res[i++] = 0,\n res[i++] = 0,\n t = 8;\n t < this.padLength;\n t++\n )\n res[i++] = 0;\n return res;\n };\n },\n});\n\n// node_modules/hash.js/lib/hash/sha/common.js\nvar require_common2 = __commonJS({\n \"node_modules/hash.js/lib/hash/sha/common.js\"(exports) {\n \"use strict\";\n var utils = require_utils4(),\n rotr32 = utils.rotr32;\n function ft_1(s, x, y, z) {\n if (s === 0) return ch32(x, y, z);\n if (s === 1 || s === 3) return p32(x, y, z);\n if (s === 2) return maj32(x, y, z);\n }\n exports.ft_1 = ft_1;\n function ch32(x, y, z) {\n return (x & y) ^ (~x & z);\n }\n exports.ch32 = ch32;\n function maj32(x, y, z) {\n return (x & y) ^ (x & z) ^ (y & z);\n }\n exports.maj32 = maj32;\n function p32(x, y, z) {\n return x ^ y ^ z;\n }\n exports.p32 = p32;\n function s0_256(x) {\n return rotr32(x, 2) ^ rotr32(x, 13) ^ rotr32(x, 22);\n }\n exports.s0_256 = s0_256;\n function s1_256(x) {\n return rotr32(x, 6) ^ rotr32(x, 11) ^ rotr32(x, 25);\n }\n exports.s1_256 = s1_256;\n function g0_256(x) {\n return rotr32(x, 7) ^ rotr32(x, 18) ^ (x >>> 3);\n }\n exports.g0_256 = g0_256;\n function g1_256(x) {\n return rotr32(x, 17) ^ rotr32(x, 19) ^ (x >>> 10);\n }\n exports.g1_256 = g1_256;\n },\n});\n\n// node_modules/hash.js/lib/hash/sha/1.js\nvar require__ = __commonJS({\n \"node_modules/hash.js/lib/hash/sha/1.js\"(exports, module) {\n \"use strict\";\n var utils = require_utils4(),\n common = require_common(),\n shaCommon = require_common2(),\n rotl32 = utils.rotl32,\n sum32 = utils.sum32,\n sum32_5 = utils.sum32_5,\n ft_1 = shaCommon.ft_1,\n BlockHash = common.BlockHash,\n sha1_K = [1518500249, 1859775393, 2400959708, 3395469782];\n function SHA1() {\n if (!(this instanceof SHA1)) return new SHA1();\n BlockHash.call(this),\n (this.h = [1732584193, 4023233417, 2562383102, 271733878, 3285377520]),\n (this.W = new Array(80));\n }\n utils.inherits(SHA1, BlockHash);\n module.exports = SHA1;\n SHA1.blockSize = 512;\n SHA1.outSize = 160;\n SHA1.hmacStrength = 80;\n SHA1.padLength = 64;\n SHA1.prototype._update = function (msg, start) {\n for (var W = this.W, i = 0; i < 16; i++) W[i] = msg[start + i];\n for (; i < W.length; i++) W[i] = rotl32(W[i - 3] ^ W[i - 8] ^ W[i - 14] ^ W[i - 16], 1);\n var a = this.h[0],\n b = this.h[1],\n c = this.h[2],\n d = this.h[3],\n e = this.h[4];\n for (i = 0; i < W.length; i++) {\n var s = ~~(i / 20),\n t = sum32_5(rotl32(a, 5), ft_1(s, b, c, d), e, W[i], sha1_K[s]);\n (e = d), (d = c), (c = rotl32(b, 30)), (b = a), (a = t);\n }\n (this.h[0] = sum32(this.h[0], a)),\n (this.h[1] = sum32(this.h[1], b)),\n (this.h[2] = sum32(this.h[2], c)),\n (this.h[3] = sum32(this.h[3], d)),\n (this.h[4] = sum32(this.h[4], e));\n };\n SHA1.prototype._digest = function (enc) {\n return enc === \"hex\" ? utils.toHex32(this.h, \"big\") : utils.split32(this.h, \"big\");\n };\n },\n});\n\n// node_modules/hash.js/lib/hash/sha/256.js\nvar require__2 = __commonJS({\n \"node_modules/hash.js/lib/hash/sha/256.js\"(exports, module) {\n \"use strict\";\n var utils = require_utils4(),\n common = require_common(),\n shaCommon = require_common2(),\n assert = require_minimalistic_assert(),\n sum32 = utils.sum32,\n sum32_4 = utils.sum32_4,\n sum32_5 = utils.sum32_5,\n ch32 = shaCommon.ch32,\n maj32 = shaCommon.maj32,\n s0_256 = shaCommon.s0_256,\n s1_256 = shaCommon.s1_256,\n g0_256 = shaCommon.g0_256,\n g1_256 = shaCommon.g1_256,\n BlockHash = common.BlockHash,\n sha256_K = [\n 1116352408, 1899447441, 3049323471, 3921009573, 961987163, 1508970993, 2453635748, 2870763221, 3624381080,\n 310598401, 607225278, 1426881987, 1925078388, 2162078206, 2614888103, 3248222580, 3835390401, 4022224774,\n 264347078, 604807628, 770255983, 1249150122, 1555081692, 1996064986, 2554220882, 2821834349, 2952996808,\n 3210313671, 3336571891, 3584528711, 113926993, 338241895, 666307205, 773529912, 1294757372, 1396182291,\n 1695183700, 1986661051, 2177026350, 2456956037, 2730485921, 2820302411, 3259730800, 3345764771, 3516065817,\n 3600352804, 4094571909, 275423344, 430227734, 506948616, 659060556, 883997877, 958139571, 1322822218,\n 1537002063, 1747873779, 1955562222, 2024104815, 2227730452, 2361852424, 2428436474, 2756734187, 3204031479,\n 3329325298,\n ];\n function SHA256() {\n if (!(this instanceof SHA256)) return new SHA256();\n BlockHash.call(this),\n (this.h = [1779033703, 3144134277, 1013904242, 2773480762, 1359893119, 2600822924, 528734635, 1541459225]),\n (this.k = sha256_K),\n (this.W = new Array(64));\n }\n utils.inherits(SHA256, BlockHash);\n module.exports = SHA256;\n SHA256.blockSize = 512;\n SHA256.outSize = 256;\n SHA256.hmacStrength = 192;\n SHA256.padLength = 64;\n SHA256.prototype._update = function (msg, start) {\n for (var W = this.W, i = 0; i < 16; i++) W[i] = msg[start + i];\n for (; i < W.length; i++) W[i] = sum32_4(g1_256(W[i - 2]), W[i - 7], g0_256(W[i - 15]), W[i - 16]);\n var a = this.h[0],\n b = this.h[1],\n c = this.h[2],\n d = this.h[3],\n e = this.h[4],\n f = this.h[5],\n g = this.h[6],\n h = this.h[7];\n for (assert(this.k.length === W.length), i = 0; i < W.length; i++) {\n var T1 = sum32_5(h, s1_256(e), ch32(e, f, g), this.k[i], W[i]),\n T2 = sum32(s0_256(a), maj32(a, b, c));\n (h = g), (g = f), (f = e), (e = sum32(d, T1)), (d = c), (c = b), (b = a), (a = sum32(T1, T2));\n }\n (this.h[0] = sum32(this.h[0], a)),\n (this.h[1] = sum32(this.h[1], b)),\n (this.h[2] = sum32(this.h[2], c)),\n (this.h[3] = sum32(this.h[3], d)),\n (this.h[4] = sum32(this.h[4], e)),\n (this.h[5] = sum32(this.h[5], f)),\n (this.h[6] = sum32(this.h[6], g)),\n (this.h[7] = sum32(this.h[7], h));\n };\n SHA256.prototype._digest = function (enc) {\n return enc === \"hex\" ? utils.toHex32(this.h, \"big\") : utils.split32(this.h, \"big\");\n };\n },\n});\n\n// node_modules/hash.js/lib/hash/sha/224.js\nvar require__3 = __commonJS({\n \"node_modules/hash.js/lib/hash/sha/224.js\"(exports, module) {\n \"use strict\";\n var utils = require_utils4(),\n SHA256 = require__2();\n function SHA224() {\n if (!(this instanceof SHA224)) return new SHA224();\n SHA256.call(this),\n (this.h = [3238371032, 914150663, 812702999, 4144912697, 4290775857, 1750603025, 1694076839, 3204075428]);\n }\n utils.inherits(SHA224, SHA256);\n module.exports = SHA224;\n SHA224.blockSize = 512;\n SHA224.outSize = 224;\n SHA224.hmacStrength = 192;\n SHA224.padLength = 64;\n SHA224.prototype._digest = function (enc) {\n return enc === \"hex\" ? utils.toHex32(this.h.slice(0, 7), \"big\") : utils.split32(this.h.slice(0, 7), \"big\");\n };\n },\n});\n\n// node_modules/hash.js/lib/hash/sha/512.js\nvar require__4 = __commonJS({\n \"node_modules/hash.js/lib/hash/sha/512.js\"(exports, module) {\n \"use strict\";\n var utils = require_utils4(),\n common = require_common(),\n assert = require_minimalistic_assert(),\n rotr64_hi = utils.rotr64_hi,\n rotr64_lo = utils.rotr64_lo,\n shr64_hi = utils.shr64_hi,\n shr64_lo = utils.shr64_lo,\n sum64 = utils.sum64,\n sum64_hi = utils.sum64_hi,\n sum64_lo = utils.sum64_lo,\n sum64_4_hi = utils.sum64_4_hi,\n sum64_4_lo = utils.sum64_4_lo,\n sum64_5_hi = utils.sum64_5_hi,\n sum64_5_lo = utils.sum64_5_lo,\n BlockHash = common.BlockHash,\n sha512_K = [\n 1116352408, 3609767458, 1899447441, 602891725, 3049323471, 3964484399, 3921009573, 2173295548, 961987163,\n 4081628472, 1508970993, 3053834265, 2453635748, 2937671579, 2870763221, 3664609560, 3624381080, 2734883394,\n 310598401, 1164996542, 607225278, 1323610764, 1426881987, 3590304994, 1925078388, 4068182383, 2162078206,\n 991336113, 2614888103, 633803317, 3248222580, 3479774868, 3835390401, 2666613458, 4022224774, 944711139,\n 264347078, 2341262773, 604807628, 2007800933, 770255983, 1495990901, 1249150122, 1856431235, 1555081692,\n 3175218132, 1996064986, 2198950837, 2554220882, 3999719339, 2821834349, 766784016, 2952996808, 2566594879,\n 3210313671, 3203337956, 3336571891, 1034457026, 3584528711, 2466948901, 113926993, 3758326383, 338241895,\n 168717936, 666307205, 1188179964, 773529912, 1546045734, 1294757372, 1522805485, 1396182291, 2643833823,\n 1695183700, 2343527390, 1986661051, 1014477480, 2177026350, 1206759142, 2456956037, 344077627, 2730485921,\n 1290863460, 2820302411, 3158454273, 3259730800, 3505952657, 3345764771, 106217008, 3516065817, 3606008344,\n 3600352804, 1432725776, 4094571909, 1467031594, 275423344, 851169720, 430227734, 3100823752, 506948616,\n 1363258195, 659060556, 3750685593, 883997877, 3785050280, 958139571, 3318307427, 1322822218, 3812723403,\n 1537002063, 2003034995, 1747873779, 3602036899, 1955562222, 1575990012, 2024104815, 1125592928, 2227730452,\n 2716904306, 2361852424, 442776044, 2428436474, 593698344, 2756734187, 3733110249, 3204031479, 2999351573,\n 3329325298, 3815920427, 3391569614, 3928383900, 3515267271, 566280711, 3940187606, 3454069534, 4118630271,\n 4000239992, 116418474, 1914138554, 174292421, 2731055270, 289380356, 3203993006, 460393269, 320620315,\n 685471733, 587496836, 852142971, 1086792851, 1017036298, 365543100, 1126000580, 2618297676, 1288033470,\n 3409855158, 1501505948, 4234509866, 1607167915, 987167468, 1816402316, 1246189591,\n ];\n function SHA512() {\n if (!(this instanceof SHA512)) return new SHA512();\n BlockHash.call(this),\n (this.h = [\n 1779033703, 4089235720, 3144134277, 2227873595, 1013904242, 4271175723, 2773480762, 1595750129, 1359893119,\n 2917565137, 2600822924, 725511199, 528734635, 4215389547, 1541459225, 327033209,\n ]),\n (this.k = sha512_K),\n (this.W = new Array(160));\n }\n utils.inherits(SHA512, BlockHash);\n module.exports = SHA512;\n SHA512.blockSize = 1024;\n SHA512.outSize = 512;\n SHA512.hmacStrength = 192;\n SHA512.padLength = 128;\n SHA512.prototype._prepareBlock = function (msg, start) {\n for (var W = this.W, i = 0; i < 32; i++) W[i] = msg[start + i];\n for (; i < W.length; i += 2) {\n var c0_hi = g1_512_hi(W[i - 4], W[i - 3]),\n c0_lo = g1_512_lo(W[i - 4], W[i - 3]),\n c1_hi = W[i - 14],\n c1_lo = W[i - 13],\n c2_hi = g0_512_hi(W[i - 30], W[i - 29]),\n c2_lo = g0_512_lo(W[i - 30], W[i - 29]),\n c3_hi = W[i - 32],\n c3_lo = W[i - 31];\n (W[i] = sum64_4_hi(c0_hi, c0_lo, c1_hi, c1_lo, c2_hi, c2_lo, c3_hi, c3_lo)),\n (W[i + 1] = sum64_4_lo(c0_hi, c0_lo, c1_hi, c1_lo, c2_hi, c2_lo, c3_hi, c3_lo));\n }\n };\n SHA512.prototype._update = function (msg, start) {\n this._prepareBlock(msg, start);\n var W = this.W,\n ah = this.h[0],\n al = this.h[1],\n bh = this.h[2],\n bl = this.h[3],\n ch = this.h[4],\n cl = this.h[5],\n dh = this.h[6],\n dl = this.h[7],\n eh = this.h[8],\n el = this.h[9],\n fh = this.h[10],\n fl = this.h[11],\n gh = this.h[12],\n gl = this.h[13],\n hh = this.h[14],\n hl = this.h[15];\n assert(this.k.length === W.length);\n for (var i = 0; i < W.length; i += 2) {\n var c0_hi = hh,\n c0_lo = hl,\n c1_hi = s1_512_hi(eh, el),\n c1_lo = s1_512_lo(eh, el),\n c2_hi = ch64_hi(eh, el, fh, fl, gh, gl),\n c2_lo = ch64_lo(eh, el, fh, fl, gh, gl),\n c3_hi = this.k[i],\n c3_lo = this.k[i + 1],\n c4_hi = W[i],\n c4_lo = W[i + 1],\n T1_hi = sum64_5_hi(c0_hi, c0_lo, c1_hi, c1_lo, c2_hi, c2_lo, c3_hi, c3_lo, c4_hi, c4_lo),\n T1_lo = sum64_5_lo(c0_hi, c0_lo, c1_hi, c1_lo, c2_hi, c2_lo, c3_hi, c3_lo, c4_hi, c4_lo);\n (c0_hi = s0_512_hi(ah, al)),\n (c0_lo = s0_512_lo(ah, al)),\n (c1_hi = maj64_hi(ah, al, bh, bl, ch, cl)),\n (c1_lo = maj64_lo(ah, al, bh, bl, ch, cl));\n var T2_hi = sum64_hi(c0_hi, c0_lo, c1_hi, c1_lo),\n T2_lo = sum64_lo(c0_hi, c0_lo, c1_hi, c1_lo);\n (hh = gh),\n (hl = gl),\n (gh = fh),\n (gl = fl),\n (fh = eh),\n (fl = el),\n (eh = sum64_hi(dh, dl, T1_hi, T1_lo)),\n (el = sum64_lo(dl, dl, T1_hi, T1_lo)),\n (dh = ch),\n (dl = cl),\n (ch = bh),\n (cl = bl),\n (bh = ah),\n (bl = al),\n (ah = sum64_hi(T1_hi, T1_lo, T2_hi, T2_lo)),\n (al = sum64_lo(T1_hi, T1_lo, T2_hi, T2_lo));\n }\n sum64(this.h, 0, ah, al),\n sum64(this.h, 2, bh, bl),\n sum64(this.h, 4, ch, cl),\n sum64(this.h, 6, dh, dl),\n sum64(this.h, 8, eh, el),\n sum64(this.h, 10, fh, fl),\n sum64(this.h, 12, gh, gl),\n sum64(this.h, 14, hh, hl);\n };\n SHA512.prototype._digest = function (enc) {\n return enc === \"hex\" ? utils.toHex32(this.h, \"big\") : utils.split32(this.h, \"big\");\n };\n function ch64_hi(xh, xl, yh, yl, zh) {\n var r = (xh & yh) ^ (~xh & zh);\n return r < 0 && (r += 4294967296), r;\n }\n function ch64_lo(xh, xl, yh, yl, zh, zl) {\n var r = (xl & yl) ^ (~xl & zl);\n return r < 0 && (r += 4294967296), r;\n }\n function maj64_hi(xh, xl, yh, yl, zh) {\n var r = (xh & yh) ^ (xh & zh) ^ (yh & zh);\n return r < 0 && (r += 4294967296), r;\n }\n function maj64_lo(xh, xl, yh, yl, zh, zl) {\n var r = (xl & yl) ^ (xl & zl) ^ (yl & zl);\n return r < 0 && (r += 4294967296), r;\n }\n function s0_512_hi(xh, xl) {\n var c0_hi = rotr64_hi(xh, xl, 28),\n c1_hi = rotr64_hi(xl, xh, 2),\n c2_hi = rotr64_hi(xl, xh, 7),\n r = c0_hi ^ c1_hi ^ c2_hi;\n return r < 0 && (r += 4294967296), r;\n }\n function s0_512_lo(xh, xl) {\n var c0_lo = rotr64_lo(xh, xl, 28),\n c1_lo = rotr64_lo(xl, xh, 2),\n c2_lo = rotr64_lo(xl, xh, 7),\n r = c0_lo ^ c1_lo ^ c2_lo;\n return r < 0 && (r += 4294967296), r;\n }\n function s1_512_hi(xh, xl) {\n var c0_hi = rotr64_hi(xh, xl, 14),\n c1_hi = rotr64_hi(xh, xl, 18),\n c2_hi = rotr64_hi(xl, xh, 9),\n r = c0_hi ^ c1_hi ^ c2_hi;\n return r < 0 && (r += 4294967296), r;\n }\n function s1_512_lo(xh, xl) {\n var c0_lo = rotr64_lo(xh, xl, 14),\n c1_lo = rotr64_lo(xh, xl, 18),\n c2_lo = rotr64_lo(xl, xh, 9),\n r = c0_lo ^ c1_lo ^ c2_lo;\n return r < 0 && (r += 4294967296), r;\n }\n function g0_512_hi(xh, xl) {\n var c0_hi = rotr64_hi(xh, xl, 1),\n c1_hi = rotr64_hi(xh, xl, 8),\n c2_hi = shr64_hi(xh, xl, 7),\n r = c0_hi ^ c1_hi ^ c2_hi;\n return r < 0 && (r += 4294967296), r;\n }\n function g0_512_lo(xh, xl) {\n var c0_lo = rotr64_lo(xh, xl, 1),\n c1_lo = rotr64_lo(xh, xl, 8),\n c2_lo = shr64_lo(xh, xl, 7),\n r = c0_lo ^ c1_lo ^ c2_lo;\n return r < 0 && (r += 4294967296), r;\n }\n function g1_512_hi(xh, xl) {\n var c0_hi = rotr64_hi(xh, xl, 19),\n c1_hi = rotr64_hi(xl, xh, 29),\n c2_hi = shr64_hi(xh, xl, 6),\n r = c0_hi ^ c1_hi ^ c2_hi;\n return r < 0 && (r += 4294967296), r;\n }\n function g1_512_lo(xh, xl) {\n var c0_lo = rotr64_lo(xh, xl, 19),\n c1_lo = rotr64_lo(xl, xh, 29),\n c2_lo = shr64_lo(xh, xl, 6),\n r = c0_lo ^ c1_lo ^ c2_lo;\n return r < 0 && (r += 4294967296), r;\n }\n },\n});\n\n// node_modules/hash.js/lib/hash/sha/384.js\nvar require__5 = __commonJS({\n \"node_modules/hash.js/lib/hash/sha/384.js\"(exports, module) {\n \"use strict\";\n var utils = require_utils4(),\n SHA512 = require__4();\n function SHA384() {\n if (!(this instanceof SHA384)) return new SHA384();\n SHA512.call(this),\n (this.h = [\n 3418070365, 3238371032, 1654270250, 914150663, 2438529370, 812702999, 355462360, 4144912697, 1731405415,\n 4290775857, 2394180231, 1750603025, 3675008525, 1694076839, 1203062813, 3204075428,\n ]);\n }\n utils.inherits(SHA384, SHA512);\n module.exports = SHA384;\n SHA384.blockSize = 1024;\n SHA384.outSize = 384;\n SHA384.hmacStrength = 192;\n SHA384.padLength = 128;\n SHA384.prototype._digest = function (enc) {\n return enc === \"hex\" ? utils.toHex32(this.h.slice(0, 12), \"big\") : utils.split32(this.h.slice(0, 12), \"big\");\n };\n },\n});\n\n// node_modules/hash.js/lib/hash/sha.js\nvar require_sha3 = __commonJS({\n \"node_modules/hash.js/lib/hash/sha.js\"(exports) {\n \"use strict\";\n exports.sha1 = require__();\n exports.sha224 = require__3();\n exports.sha256 = require__2();\n exports.sha384 = require__5();\n exports.sha512 = require__4();\n },\n});\n\n// node_modules/hash.js/lib/hash/ripemd.js\nvar require_ripemd = __commonJS({\n \"node_modules/hash.js/lib/hash/ripemd.js\"(exports) {\n \"use strict\";\n var utils = require_utils4(),\n common = require_common(),\n rotl32 = utils.rotl32,\n sum32 = utils.sum32,\n sum32_3 = utils.sum32_3,\n sum32_4 = utils.sum32_4,\n BlockHash = common.BlockHash;\n function RIPEMD160() {\n if (!(this instanceof RIPEMD160)) return new RIPEMD160();\n BlockHash.call(this),\n (this.h = [1732584193, 4023233417, 2562383102, 271733878, 3285377520]),\n (this.endian = \"little\");\n }\n utils.inherits(RIPEMD160, BlockHash);\n exports.ripemd160 = RIPEMD160;\n RIPEMD160.blockSize = 512;\n RIPEMD160.outSize = 160;\n RIPEMD160.hmacStrength = 192;\n RIPEMD160.padLength = 64;\n RIPEMD160.prototype._update = function (msg, start) {\n for (\n var A = this.h[0],\n B = this.h[1],\n C = this.h[2],\n D = this.h[3],\n E = this.h[4],\n Ah = A,\n Bh = B,\n Ch = C,\n Dh = D,\n Eh = E,\n j = 0;\n j < 80;\n j++\n ) {\n var T = sum32(rotl32(sum32_4(A, f(j, B, C, D), msg[r[j] + start], K(j)), s[j]), E);\n (A = E),\n (E = D),\n (D = rotl32(C, 10)),\n (C = B),\n (B = T),\n (T = sum32(rotl32(sum32_4(Ah, f(79 - j, Bh, Ch, Dh), msg[rh[j] + start], Kh(j)), sh[j]), Eh)),\n (Ah = Eh),\n (Eh = Dh),\n (Dh = rotl32(Ch, 10)),\n (Ch = Bh),\n (Bh = T);\n }\n (T = sum32_3(this.h[1], C, Dh)),\n (this.h[1] = sum32_3(this.h[2], D, Eh)),\n (this.h[2] = sum32_3(this.h[3], E, Ah)),\n (this.h[3] = sum32_3(this.h[4], A, Bh)),\n (this.h[4] = sum32_3(this.h[0], B, Ch)),\n (this.h[0] = T);\n };\n RIPEMD160.prototype._digest = function (enc) {\n return enc === \"hex\" ? utils.toHex32(this.h, \"little\") : utils.split32(this.h, \"little\");\n };\n function f(j, x, y, z) {\n return j <= 15\n ? x ^ y ^ z\n : j <= 31\n ? (x & y) | (~x & z)\n : j <= 47\n ? (x | ~y) ^ z\n : j <= 63\n ? (x & z) | (y & ~z)\n : x ^ (y | ~z);\n }\n function K(j) {\n return j <= 15 ? 0 : j <= 31 ? 1518500249 : j <= 47 ? 1859775393 : j <= 63 ? 2400959708 : 2840853838;\n }\n function Kh(j) {\n return j <= 15 ? 1352829926 : j <= 31 ? 1548603684 : j <= 47 ? 1836072691 : j <= 63 ? 2053994217 : 0;\n }\n var r = [\n 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 7, 4, 13, 1, 10, 6, 15, 3, 12, 0, 9, 5, 2, 14, 11, 8, 3,\n 10, 14, 4, 9, 15, 8, 1, 2, 7, 0, 6, 13, 11, 5, 12, 1, 9, 11, 10, 0, 8, 12, 4, 13, 3, 7, 15, 14, 5, 6, 2, 4, 0,\n 5, 9, 7, 12, 2, 10, 14, 1, 3, 8, 11, 6, 15, 13,\n ],\n rh = [\n 5, 14, 7, 0, 9, 2, 11, 4, 13, 6, 15, 8, 1, 10, 3, 12, 6, 11, 3, 7, 0, 13, 5, 10, 14, 15, 8, 12, 4, 9, 1, 2, 15,\n 5, 1, 3, 7, 14, 6, 9, 11, 8, 12, 2, 10, 0, 4, 13, 8, 6, 4, 1, 3, 11, 15, 0, 5, 12, 2, 13, 9, 7, 10, 14, 12, 15,\n 10, 4, 1, 5, 8, 7, 6, 2, 13, 14, 0, 3, 9, 11,\n ],\n s = [\n 11, 14, 15, 12, 5, 8, 7, 9, 11, 13, 14, 15, 6, 7, 9, 8, 7, 6, 8, 13, 11, 9, 7, 15, 7, 12, 15, 9, 11, 7, 13, 12,\n 11, 13, 6, 7, 14, 9, 13, 15, 14, 8, 13, 6, 5, 12, 7, 5, 11, 12, 14, 15, 14, 15, 9, 8, 9, 14, 5, 6, 8, 6, 5, 12,\n 9, 15, 5, 11, 6, 8, 13, 12, 5, 12, 13, 14, 11, 8, 5, 6,\n ],\n sh = [\n 8, 9, 9, 11, 13, 15, 15, 5, 7, 7, 8, 11, 14, 14, 12, 6, 9, 13, 15, 7, 12, 8, 9, 11, 7, 7, 12, 7, 6, 15, 13, 11,\n 9, 7, 15, 11, 8, 6, 6, 14, 12, 13, 5, 14, 13, 13, 7, 5, 15, 5, 8, 11, 14, 14, 6, 14, 6, 9, 12, 9, 12, 5, 15, 8,\n 8, 5, 12, 9, 12, 5, 14, 6, 8, 13, 6, 5, 15, 13, 11, 11,\n ];\n },\n});\n\n// node_modules/hash.js/lib/hash/hmac.js\nvar require_hmac = __commonJS({\n \"node_modules/hash.js/lib/hash/hmac.js\"(exports, module) {\n \"use strict\";\n var utils = require_utils4(),\n assert = require_minimalistic_assert();\n function Hmac(hash, key, enc) {\n if (!(this instanceof Hmac)) return new Hmac(hash, key, enc);\n (this.Hash = hash),\n (this.blockSize = hash.blockSize / 8),\n (this.outSize = hash.outSize / 8),\n (this.inner = null),\n (this.outer = null),\n this._init(utils.toArray(key, enc));\n }\n module.exports = Hmac;\n Hmac.prototype._init = function (key) {\n key.length > this.blockSize && (key = new this.Hash().update(key).digest()), assert(key.length <= this.blockSize);\n for (var i = key.length; i < this.blockSize; i++) key.push(0);\n for (i = 0; i < key.length; i++) key[i] ^= 54;\n for (this.inner = new this.Hash().update(key), i = 0; i < key.length; i++) key[i] ^= 106;\n this.outer = new this.Hash().update(key);\n };\n Hmac.prototype.update = function (msg, enc) {\n return this.inner.update(msg, enc), this;\n };\n Hmac.prototype.digest = function (enc) {\n return this.outer.update(this.inner.digest()), this.outer.digest(enc);\n };\n },\n});\n\n// node_modules/hash.js/lib/hash.js\nvar require_hash2 = __commonJS({\n \"node_modules/hash.js/lib/hash.js\"(exports) {\n var hash = exports;\n hash.utils = require_utils4();\n hash.common = require_common();\n hash.sha = require_sha3();\n hash.ripemd = require_ripemd();\n hash.hmac = require_hmac();\n hash.sha1 = hash.sha.sha1;\n hash.sha256 = hash.sha.sha256;\n hash.sha224 = hash.sha.sha224;\n hash.sha384 = hash.sha.sha384;\n hash.sha512 = hash.sha.sha512;\n hash.ripemd160 = hash.ripemd.ripemd160;\n },\n});\n\n// node_modules/elliptic/lib/elliptic/precomputed/secp256k1.js\nvar require_secp256k1 = __commonJS({\n \"node_modules/elliptic/lib/elliptic/precomputed/secp256k1.js\"(exports, module) {\n module.exports = {\n doubles: {\n step: 4,\n points: [\n [\n \"e60fce93b59e9ec53011aabc21c23e97b2a31369b87a5ae9c44ee89e2a6dec0a\",\n \"f7e3507399e595929db99f34f57937101296891e44d23f0be1f32cce69616821\",\n ],\n [\n \"8282263212c609d9ea2a6e3e172de238d8c39cabd5ac1ca10646e23fd5f51508\",\n \"11f8a8098557dfe45e8256e830b60ace62d613ac2f7b17bed31b6eaff6e26caf\",\n ],\n [\n \"175e159f728b865a72f99cc6c6fc846de0b93833fd2222ed73fce5b551e5b739\",\n \"d3506e0d9e3c79eba4ef97a51ff71f5eacb5955add24345c6efa6ffee9fed695\",\n ],\n [\n \"363d90d447b00c9c99ceac05b6262ee053441c7e55552ffe526bad8f83ff4640\",\n \"4e273adfc732221953b445397f3363145b9a89008199ecb62003c7f3bee9de9\",\n ],\n [\n \"8b4b5f165df3c2be8c6244b5b745638843e4a781a15bcd1b69f79a55dffdf80c\",\n \"4aad0a6f68d308b4b3fbd7813ab0da04f9e336546162ee56b3eff0c65fd4fd36\",\n ],\n [\n \"723cbaa6e5db996d6bf771c00bd548c7b700dbffa6c0e77bcb6115925232fcda\",\n \"96e867b5595cc498a921137488824d6e2660a0653779494801dc069d9eb39f5f\",\n ],\n [\n \"eebfa4d493bebf98ba5feec812c2d3b50947961237a919839a533eca0e7dd7fa\",\n \"5d9a8ca3970ef0f269ee7edaf178089d9ae4cdc3a711f712ddfd4fdae1de8999\",\n ],\n [\n \"100f44da696e71672791d0a09b7bde459f1215a29b3c03bfefd7835b39a48db0\",\n \"cdd9e13192a00b772ec8f3300c090666b7ff4a18ff5195ac0fbd5cd62bc65a09\",\n ],\n [\n \"e1031be262c7ed1b1dc9227a4a04c017a77f8d4464f3b3852c8acde6e534fd2d\",\n \"9d7061928940405e6bb6a4176597535af292dd419e1ced79a44f18f29456a00d\",\n ],\n [\n \"feea6cae46d55b530ac2839f143bd7ec5cf8b266a41d6af52d5e688d9094696d\",\n \"e57c6b6c97dce1bab06e4e12bf3ecd5c981c8957cc41442d3155debf18090088\",\n ],\n [\n \"da67a91d91049cdcb367be4be6ffca3cfeed657d808583de33fa978bc1ec6cb1\",\n \"9bacaa35481642bc41f463f7ec9780e5dec7adc508f740a17e9ea8e27a68be1d\",\n ],\n [\n \"53904faa0b334cdda6e000935ef22151ec08d0f7bb11069f57545ccc1a37b7c0\",\n \"5bc087d0bc80106d88c9eccac20d3c1c13999981e14434699dcb096b022771c8\",\n ],\n [\n \"8e7bcd0bd35983a7719cca7764ca906779b53a043a9b8bcaeff959f43ad86047\",\n \"10b7770b2a3da4b3940310420ca9514579e88e2e47fd68b3ea10047e8460372a\",\n ],\n [\n \"385eed34c1cdff21e6d0818689b81bde71a7f4f18397e6690a841e1599c43862\",\n \"283bebc3e8ea23f56701de19e9ebf4576b304eec2086dc8cc0458fe5542e5453\",\n ],\n [\n \"6f9d9b803ecf191637c73a4413dfa180fddf84a5947fbc9c606ed86c3fac3a7\",\n \"7c80c68e603059ba69b8e2a30e45c4d47ea4dd2f5c281002d86890603a842160\",\n ],\n [\n \"3322d401243c4e2582a2147c104d6ecbf774d163db0f5e5313b7e0e742d0e6bd\",\n \"56e70797e9664ef5bfb019bc4ddaf9b72805f63ea2873af624f3a2e96c28b2a0\",\n ],\n [\n \"85672c7d2de0b7da2bd1770d89665868741b3f9af7643397721d74d28134ab83\",\n \"7c481b9b5b43b2eb6374049bfa62c2e5e77f17fcc5298f44c8e3094f790313a6\",\n ],\n [\n \"948bf809b1988a46b06c9f1919413b10f9226c60f668832ffd959af60c82a0a\",\n \"53a562856dcb6646dc6b74c5d1c3418c6d4dff08c97cd2bed4cb7f88d8c8e589\",\n ],\n [\n \"6260ce7f461801c34f067ce0f02873a8f1b0e44dfc69752accecd819f38fd8e8\",\n \"bc2da82b6fa5b571a7f09049776a1ef7ecd292238051c198c1a84e95b2b4ae17\",\n ],\n [\n \"e5037de0afc1d8d43d8348414bbf4103043ec8f575bfdc432953cc8d2037fa2d\",\n \"4571534baa94d3b5f9f98d09fb990bddbd5f5b03ec481f10e0e5dc841d755bda\",\n ],\n [\n \"e06372b0f4a207adf5ea905e8f1771b4e7e8dbd1c6a6c5b725866a0ae4fce725\",\n \"7a908974bce18cfe12a27bb2ad5a488cd7484a7787104870b27034f94eee31dd\",\n ],\n [\n \"213c7a715cd5d45358d0bbf9dc0ce02204b10bdde2a3f58540ad6908d0559754\",\n \"4b6dad0b5ae462507013ad06245ba190bb4850f5f36a7eeddff2c27534b458f2\",\n ],\n [\n \"4e7c272a7af4b34e8dbb9352a5419a87e2838c70adc62cddf0cc3a3b08fbd53c\",\n \"17749c766c9d0b18e16fd09f6def681b530b9614bff7dd33e0b3941817dcaae6\",\n ],\n [\n \"fea74e3dbe778b1b10f238ad61686aa5c76e3db2be43057632427e2840fb27b6\",\n \"6e0568db9b0b13297cf674deccb6af93126b596b973f7b77701d3db7f23cb96f\",\n ],\n [\n \"76e64113f677cf0e10a2570d599968d31544e179b760432952c02a4417bdde39\",\n \"c90ddf8dee4e95cf577066d70681f0d35e2a33d2b56d2032b4b1752d1901ac01\",\n ],\n [\n \"c738c56b03b2abe1e8281baa743f8f9a8f7cc643df26cbee3ab150242bcbb891\",\n \"893fb578951ad2537f718f2eacbfbbbb82314eef7880cfe917e735d9699a84c3\",\n ],\n [\n \"d895626548b65b81e264c7637c972877d1d72e5f3a925014372e9f6588f6c14b\",\n \"febfaa38f2bc7eae728ec60818c340eb03428d632bb067e179363ed75d7d991f\",\n ],\n [\n \"b8da94032a957518eb0f6433571e8761ceffc73693e84edd49150a564f676e03\",\n \"2804dfa44805a1e4d7c99cc9762808b092cc584d95ff3b511488e4e74efdf6e7\",\n ],\n [\n \"e80fea14441fb33a7d8adab9475d7fab2019effb5156a792f1a11778e3c0df5d\",\n \"eed1de7f638e00771e89768ca3ca94472d155e80af322ea9fcb4291b6ac9ec78\",\n ],\n [\n \"a301697bdfcd704313ba48e51d567543f2a182031efd6915ddc07bbcc4e16070\",\n \"7370f91cfb67e4f5081809fa25d40f9b1735dbf7c0a11a130c0d1a041e177ea1\",\n ],\n [\n \"90ad85b389d6b936463f9d0512678de208cc330b11307fffab7ac63e3fb04ed4\",\n \"e507a3620a38261affdcbd9427222b839aefabe1582894d991d4d48cb6ef150\",\n ],\n [\n \"8f68b9d2f63b5f339239c1ad981f162ee88c5678723ea3351b7b444c9ec4c0da\",\n \"662a9f2dba063986de1d90c2b6be215dbbea2cfe95510bfdf23cbf79501fff82\",\n ],\n [\n \"e4f3fb0176af85d65ff99ff9198c36091f48e86503681e3e6686fd5053231e11\",\n \"1e63633ad0ef4f1c1661a6d0ea02b7286cc7e74ec951d1c9822c38576feb73bc\",\n ],\n [\n \"8c00fa9b18ebf331eb961537a45a4266c7034f2f0d4e1d0716fb6eae20eae29e\",\n \"efa47267fea521a1a9dc343a3736c974c2fadafa81e36c54e7d2a4c66702414b\",\n ],\n [\n \"e7a26ce69dd4829f3e10cec0a9e98ed3143d084f308b92c0997fddfc60cb3e41\",\n \"2a758e300fa7984b471b006a1aafbb18d0a6b2c0420e83e20e8a9421cf2cfd51\",\n ],\n [\n \"b6459e0ee3662ec8d23540c223bcbdc571cbcb967d79424f3cf29eb3de6b80ef\",\n \"67c876d06f3e06de1dadf16e5661db3c4b3ae6d48e35b2ff30bf0b61a71ba45\",\n ],\n [\n \"d68a80c8280bb840793234aa118f06231d6f1fc67e73c5a5deda0f5b496943e8\",\n \"db8ba9fff4b586d00c4b1f9177b0e28b5b0e7b8f7845295a294c84266b133120\",\n ],\n [\n \"324aed7df65c804252dc0270907a30b09612aeb973449cea4095980fc28d3d5d\",\n \"648a365774b61f2ff130c0c35aec1f4f19213b0c7e332843967224af96ab7c84\",\n ],\n [\n \"4df9c14919cde61f6d51dfdbe5fee5dceec4143ba8d1ca888e8bd373fd054c96\",\n \"35ec51092d8728050974c23a1d85d4b5d506cdc288490192ebac06cad10d5d\",\n ],\n [\n \"9c3919a84a474870faed8a9c1cc66021523489054d7f0308cbfc99c8ac1f98cd\",\n \"ddb84f0f4a4ddd57584f044bf260e641905326f76c64c8e6be7e5e03d4fc599d\",\n ],\n [\n \"6057170b1dd12fdf8de05f281d8e06bb91e1493a8b91d4cc5a21382120a959e5\",\n \"9a1af0b26a6a4807add9a2daf71df262465152bc3ee24c65e899be932385a2a8\",\n ],\n [\n \"a576df8e23a08411421439a4518da31880cef0fba7d4df12b1a6973eecb94266\",\n \"40a6bf20e76640b2c92b97afe58cd82c432e10a7f514d9f3ee8be11ae1b28ec8\",\n ],\n [\n \"7778a78c28dec3e30a05fe9629de8c38bb30d1f5cf9a3a208f763889be58ad71\",\n \"34626d9ab5a5b22ff7098e12f2ff580087b38411ff24ac563b513fc1fd9f43ac\",\n ],\n [\n \"928955ee637a84463729fd30e7afd2ed5f96274e5ad7e5cb09eda9c06d903ac\",\n \"c25621003d3f42a827b78a13093a95eeac3d26efa8a8d83fc5180e935bcd091f\",\n ],\n [\n \"85d0fef3ec6db109399064f3a0e3b2855645b4a907ad354527aae75163d82751\",\n \"1f03648413a38c0be29d496e582cf5663e8751e96877331582c237a24eb1f962\",\n ],\n [\n \"ff2b0dce97eece97c1c9b6041798b85dfdfb6d8882da20308f5404824526087e\",\n \"493d13fef524ba188af4c4dc54d07936c7b7ed6fb90e2ceb2c951e01f0c29907\",\n ],\n [\n \"827fbbe4b1e880ea9ed2b2e6301b212b57f1ee148cd6dd28780e5e2cf856e241\",\n \"c60f9c923c727b0b71bef2c67d1d12687ff7a63186903166d605b68baec293ec\",\n ],\n [\n \"eaa649f21f51bdbae7be4ae34ce6e5217a58fdce7f47f9aa7f3b58fa2120e2b3\",\n \"be3279ed5bbbb03ac69a80f89879aa5a01a6b965f13f7e59d47a5305ba5ad93d\",\n ],\n [\n \"e4a42d43c5cf169d9391df6decf42ee541b6d8f0c9a137401e23632dda34d24f\",\n \"4d9f92e716d1c73526fc99ccfb8ad34ce886eedfa8d8e4f13a7f7131deba9414\",\n ],\n [\n \"1ec80fef360cbdd954160fadab352b6b92b53576a88fea4947173b9d4300bf19\",\n \"aeefe93756b5340d2f3a4958a7abbf5e0146e77f6295a07b671cdc1cc107cefd\",\n ],\n [\n \"146a778c04670c2f91b00af4680dfa8bce3490717d58ba889ddb5928366642be\",\n \"b318e0ec3354028add669827f9d4b2870aaa971d2f7e5ed1d0b297483d83efd0\",\n ],\n [\n \"fa50c0f61d22e5f07e3acebb1aa07b128d0012209a28b9776d76a8793180eef9\",\n \"6b84c6922397eba9b72cd2872281a68a5e683293a57a213b38cd8d7d3f4f2811\",\n ],\n [\n \"da1d61d0ca721a11b1a5bf6b7d88e8421a288ab5d5bba5220e53d32b5f067ec2\",\n \"8157f55a7c99306c79c0766161c91e2966a73899d279b48a655fba0f1ad836f1\",\n ],\n [\n \"a8e282ff0c9706907215ff98e8fd416615311de0446f1e062a73b0610d064e13\",\n \"7f97355b8db81c09abfb7f3c5b2515888b679a3e50dd6bd6cef7c73111f4cc0c\",\n ],\n [\n \"174a53b9c9a285872d39e56e6913cab15d59b1fa512508c022f382de8319497c\",\n \"ccc9dc37abfc9c1657b4155f2c47f9e6646b3a1d8cb9854383da13ac079afa73\",\n ],\n [\n \"959396981943785c3d3e57edf5018cdbe039e730e4918b3d884fdff09475b7ba\",\n \"2e7e552888c331dd8ba0386a4b9cd6849c653f64c8709385e9b8abf87524f2fd\",\n ],\n [\n \"d2a63a50ae401e56d645a1153b109a8fcca0a43d561fba2dbb51340c9d82b151\",\n \"e82d86fb6443fcb7565aee58b2948220a70f750af484ca52d4142174dcf89405\",\n ],\n [\n \"64587e2335471eb890ee7896d7cfdc866bacbdbd3839317b3436f9b45617e073\",\n \"d99fcdd5bf6902e2ae96dd6447c299a185b90a39133aeab358299e5e9faf6589\",\n ],\n [\n \"8481bde0e4e4d885b3a546d3e549de042f0aa6cea250e7fd358d6c86dd45e458\",\n \"38ee7b8cba5404dd84a25bf39cecb2ca900a79c42b262e556d64b1b59779057e\",\n ],\n [\n \"13464a57a78102aa62b6979ae817f4637ffcfed3c4b1ce30bcd6303f6caf666b\",\n \"69be159004614580ef7e433453ccb0ca48f300a81d0942e13f495a907f6ecc27\",\n ],\n [\n \"bc4a9df5b713fe2e9aef430bcc1dc97a0cd9ccede2f28588cada3a0d2d83f366\",\n \"d3a81ca6e785c06383937adf4b798caa6e8a9fbfa547b16d758d666581f33c1\",\n ],\n [\n \"8c28a97bf8298bc0d23d8c749452a32e694b65e30a9472a3954ab30fe5324caa\",\n \"40a30463a3305193378fedf31f7cc0eb7ae784f0451cb9459e71dc73cbef9482\",\n ],\n [\n \"8ea9666139527a8c1dd94ce4f071fd23c8b350c5a4bb33748c4ba111faccae0\",\n \"620efabbc8ee2782e24e7c0cfb95c5d735b783be9cf0f8e955af34a30e62b945\",\n ],\n [\n \"dd3625faef5ba06074669716bbd3788d89bdde815959968092f76cc4eb9a9787\",\n \"7a188fa3520e30d461da2501045731ca941461982883395937f68d00c644a573\",\n ],\n [\n \"f710d79d9eb962297e4f6232b40e8f7feb2bc63814614d692c12de752408221e\",\n \"ea98e67232d3b3295d3b535532115ccac8612c721851617526ae47a9c77bfc82\",\n ],\n ],\n },\n naf: {\n wnd: 7,\n points: [\n [\n \"f9308a019258c31049344f85f89d5229b531c845836f99b08601f113bce036f9\",\n \"388f7b0f632de8140fe337e62a37f3566500a99934c2231b6cb9fd7584b8e672\",\n ],\n [\n \"2f8bde4d1a07209355b4a7250a5c5128e88b84bddc619ab7cba8d569b240efe4\",\n \"d8ac222636e5e3d6d4dba9dda6c9c426f788271bab0d6840dca87d3aa6ac62d6\",\n ],\n [\n \"5cbdf0646e5db4eaa398f365f2ea7a0e3d419b7e0330e39ce92bddedcac4f9bc\",\n \"6aebca40ba255960a3178d6d861a54dba813d0b813fde7b5a5082628087264da\",\n ],\n [\n \"acd484e2f0c7f65309ad178a9f559abde09796974c57e714c35f110dfc27ccbe\",\n \"cc338921b0a7d9fd64380971763b61e9add888a4375f8e0f05cc262ac64f9c37\",\n ],\n [\n \"774ae7f858a9411e5ef4246b70c65aac5649980be5c17891bbec17895da008cb\",\n \"d984a032eb6b5e190243dd56d7b7b365372db1e2dff9d6a8301d74c9c953c61b\",\n ],\n [\n \"f28773c2d975288bc7d1d205c3748651b075fbc6610e58cddeeddf8f19405aa8\",\n \"ab0902e8d880a89758212eb65cdaf473a1a06da521fa91f29b5cb52db03ed81\",\n ],\n [\n \"d7924d4f7d43ea965a465ae3095ff41131e5946f3c85f79e44adbcf8e27e080e\",\n \"581e2872a86c72a683842ec228cc6defea40af2bd896d3a5c504dc9ff6a26b58\",\n ],\n [\n \"defdea4cdb677750a420fee807eacf21eb9898ae79b9768766e4faa04a2d4a34\",\n \"4211ab0694635168e997b0ead2a93daeced1f4a04a95c0f6cfb199f69e56eb77\",\n ],\n [\n \"2b4ea0a797a443d293ef5cff444f4979f06acfebd7e86d277475656138385b6c\",\n \"85e89bc037945d93b343083b5a1c86131a01f60c50269763b570c854e5c09b7a\",\n ],\n [\n \"352bbf4a4cdd12564f93fa332ce333301d9ad40271f8107181340aef25be59d5\",\n \"321eb4075348f534d59c18259dda3e1f4a1b3b2e71b1039c67bd3d8bcf81998c\",\n ],\n [\n \"2fa2104d6b38d11b0230010559879124e42ab8dfeff5ff29dc9cdadd4ecacc3f\",\n \"2de1068295dd865b64569335bd5dd80181d70ecfc882648423ba76b532b7d67\",\n ],\n [\n \"9248279b09b4d68dab21a9b066edda83263c3d84e09572e269ca0cd7f5453714\",\n \"73016f7bf234aade5d1aa71bdea2b1ff3fc0de2a887912ffe54a32ce97cb3402\",\n ],\n [\n \"daed4f2be3a8bf278e70132fb0beb7522f570e144bf615c07e996d443dee8729\",\n \"a69dce4a7d6c98e8d4a1aca87ef8d7003f83c230f3afa726ab40e52290be1c55\",\n ],\n [\n \"c44d12c7065d812e8acf28d7cbb19f9011ecd9e9fdf281b0e6a3b5e87d22e7db\",\n \"2119a460ce326cdc76c45926c982fdac0e106e861edf61c5a039063f0e0e6482\",\n ],\n [\n \"6a245bf6dc698504c89a20cfded60853152b695336c28063b61c65cbd269e6b4\",\n \"e022cf42c2bd4a708b3f5126f16a24ad8b33ba48d0423b6efd5e6348100d8a82\",\n ],\n [\n \"1697ffa6fd9de627c077e3d2fe541084ce13300b0bec1146f95ae57f0d0bd6a5\",\n \"b9c398f186806f5d27561506e4557433a2cf15009e498ae7adee9d63d01b2396\",\n ],\n [\n \"605bdb019981718b986d0f07e834cb0d9deb8360ffb7f61df982345ef27a7479\",\n \"2972d2de4f8d20681a78d93ec96fe23c26bfae84fb14db43b01e1e9056b8c49\",\n ],\n [\n \"62d14dab4150bf497402fdc45a215e10dcb01c354959b10cfe31c7e9d87ff33d\",\n \"80fc06bd8cc5b01098088a1950eed0db01aa132967ab472235f5642483b25eaf\",\n ],\n [\n \"80c60ad0040f27dade5b4b06c408e56b2c50e9f56b9b8b425e555c2f86308b6f\",\n \"1c38303f1cc5c30f26e66bad7fe72f70a65eed4cbe7024eb1aa01f56430bd57a\",\n ],\n [\n \"7a9375ad6167ad54aa74c6348cc54d344cc5dc9487d847049d5eabb0fa03c8fb\",\n \"d0e3fa9eca8726909559e0d79269046bdc59ea10c70ce2b02d499ec224dc7f7\",\n ],\n [\n \"d528ecd9b696b54c907a9ed045447a79bb408ec39b68df504bb51f459bc3ffc9\",\n \"eecf41253136e5f99966f21881fd656ebc4345405c520dbc063465b521409933\",\n ],\n [\n \"49370a4b5f43412ea25f514e8ecdad05266115e4a7ecb1387231808f8b45963\",\n \"758f3f41afd6ed428b3081b0512fd62a54c3f3afbb5b6764b653052a12949c9a\",\n ],\n [\n \"77f230936ee88cbbd73df930d64702ef881d811e0e1498e2f1c13eb1fc345d74\",\n \"958ef42a7886b6400a08266e9ba1b37896c95330d97077cbbe8eb3c7671c60d6\",\n ],\n [\n \"f2dac991cc4ce4b9ea44887e5c7c0bce58c80074ab9d4dbaeb28531b7739f530\",\n \"e0dedc9b3b2f8dad4da1f32dec2531df9eb5fbeb0598e4fd1a117dba703a3c37\",\n ],\n [\n \"463b3d9f662621fb1b4be8fbbe2520125a216cdfc9dae3debcba4850c690d45b\",\n \"5ed430d78c296c3543114306dd8622d7c622e27c970a1de31cb377b01af7307e\",\n ],\n [\n \"f16f804244e46e2a09232d4aff3b59976b98fac14328a2d1a32496b49998f247\",\n \"cedabd9b82203f7e13d206fcdf4e33d92a6c53c26e5cce26d6579962c4e31df6\",\n ],\n [\n \"caf754272dc84563b0352b7a14311af55d245315ace27c65369e15f7151d41d1\",\n \"cb474660ef35f5f2a41b643fa5e460575f4fa9b7962232a5c32f908318a04476\",\n ],\n [\n \"2600ca4b282cb986f85d0f1709979d8b44a09c07cb86d7c124497bc86f082120\",\n \"4119b88753c15bd6a693b03fcddbb45d5ac6be74ab5f0ef44b0be9475a7e4b40\",\n ],\n [\n \"7635ca72d7e8432c338ec53cd12220bc01c48685e24f7dc8c602a7746998e435\",\n \"91b649609489d613d1d5e590f78e6d74ecfc061d57048bad9e76f302c5b9c61\",\n ],\n [\n \"754e3239f325570cdbbf4a87deee8a66b7f2b33479d468fbc1a50743bf56cc18\",\n \"673fb86e5bda30fb3cd0ed304ea49a023ee33d0197a695d0c5d98093c536683\",\n ],\n [\n \"e3e6bd1071a1e96aff57859c82d570f0330800661d1c952f9fe2694691d9b9e8\",\n \"59c9e0bba394e76f40c0aa58379a3cb6a5a2283993e90c4167002af4920e37f5\",\n ],\n [\n \"186b483d056a033826ae73d88f732985c4ccb1f32ba35f4b4cc47fdcf04aa6eb\",\n \"3b952d32c67cf77e2e17446e204180ab21fb8090895138b4a4a797f86e80888b\",\n ],\n [\n \"df9d70a6b9876ce544c98561f4be4f725442e6d2b737d9c91a8321724ce0963f\",\n \"55eb2dafd84d6ccd5f862b785dc39d4ab157222720ef9da217b8c45cf2ba2417\",\n ],\n [\n \"5edd5cc23c51e87a497ca815d5dce0f8ab52554f849ed8995de64c5f34ce7143\",\n \"efae9c8dbc14130661e8cec030c89ad0c13c66c0d17a2905cdc706ab7399a868\",\n ],\n [\n \"290798c2b6476830da12fe02287e9e777aa3fba1c355b17a722d362f84614fba\",\n \"e38da76dcd440621988d00bcf79af25d5b29c094db2a23146d003afd41943e7a\",\n ],\n [\n \"af3c423a95d9f5b3054754efa150ac39cd29552fe360257362dfdecef4053b45\",\n \"f98a3fd831eb2b749a93b0e6f35cfb40c8cd5aa667a15581bc2feded498fd9c6\",\n ],\n [\n \"766dbb24d134e745cccaa28c99bf274906bb66b26dcf98df8d2fed50d884249a\",\n \"744b1152eacbe5e38dcc887980da38b897584a65fa06cedd2c924f97cbac5996\",\n ],\n [\n \"59dbf46f8c94759ba21277c33784f41645f7b44f6c596a58ce92e666191abe3e\",\n \"c534ad44175fbc300f4ea6ce648309a042ce739a7919798cd85e216c4a307f6e\",\n ],\n [\n \"f13ada95103c4537305e691e74e9a4a8dd647e711a95e73cb62dc6018cfd87b8\",\n \"e13817b44ee14de663bf4bc808341f326949e21a6a75c2570778419bdaf5733d\",\n ],\n [\n \"7754b4fa0e8aced06d4167a2c59cca4cda1869c06ebadfb6488550015a88522c\",\n \"30e93e864e669d82224b967c3020b8fa8d1e4e350b6cbcc537a48b57841163a2\",\n ],\n [\n \"948dcadf5990e048aa3874d46abef9d701858f95de8041d2a6828c99e2262519\",\n \"e491a42537f6e597d5d28a3224b1bc25df9154efbd2ef1d2cbba2cae5347d57e\",\n ],\n [\n \"7962414450c76c1689c7b48f8202ec37fb224cf5ac0bfa1570328a8a3d7c77ab\",\n \"100b610ec4ffb4760d5c1fc133ef6f6b12507a051f04ac5760afa5b29db83437\",\n ],\n [\n \"3514087834964b54b15b160644d915485a16977225b8847bb0dd085137ec47ca\",\n \"ef0afbb2056205448e1652c48e8127fc6039e77c15c2378b7e7d15a0de293311\",\n ],\n [\n \"d3cc30ad6b483e4bc79ce2c9dd8bc54993e947eb8df787b442943d3f7b527eaf\",\n \"8b378a22d827278d89c5e9be8f9508ae3c2ad46290358630afb34db04eede0a4\",\n ],\n [\n \"1624d84780732860ce1c78fcbfefe08b2b29823db913f6493975ba0ff4847610\",\n \"68651cf9b6da903e0914448c6cd9d4ca896878f5282be4c8cc06e2a404078575\",\n ],\n [\n \"733ce80da955a8a26902c95633e62a985192474b5af207da6df7b4fd5fc61cd4\",\n \"f5435a2bd2badf7d485a4d8b8db9fcce3e1ef8e0201e4578c54673bc1dc5ea1d\",\n ],\n [\n \"15d9441254945064cf1a1c33bbd3b49f8966c5092171e699ef258dfab81c045c\",\n \"d56eb30b69463e7234f5137b73b84177434800bacebfc685fc37bbe9efe4070d\",\n ],\n [\n \"a1d0fcf2ec9de675b612136e5ce70d271c21417c9d2b8aaaac138599d0717940\",\n \"edd77f50bcb5a3cab2e90737309667f2641462a54070f3d519212d39c197a629\",\n ],\n [\n \"e22fbe15c0af8ccc5780c0735f84dbe9a790badee8245c06c7ca37331cb36980\",\n \"a855babad5cd60c88b430a69f53a1a7a38289154964799be43d06d77d31da06\",\n ],\n [\n \"311091dd9860e8e20ee13473c1155f5f69635e394704eaa74009452246cfa9b3\",\n \"66db656f87d1f04fffd1f04788c06830871ec5a64feee685bd80f0b1286d8374\",\n ],\n [\n \"34c1fd04d301be89b31c0442d3e6ac24883928b45a9340781867d4232ec2dbdf\",\n \"9414685e97b1b5954bd46f730174136d57f1ceeb487443dc5321857ba73abee\",\n ],\n [\n \"f219ea5d6b54701c1c14de5b557eb42a8d13f3abbcd08affcc2a5e6b049b8d63\",\n \"4cb95957e83d40b0f73af4544cccf6b1f4b08d3c07b27fb8d8c2962a400766d1\",\n ],\n [\n \"d7b8740f74a8fbaab1f683db8f45de26543a5490bca627087236912469a0b448\",\n \"fa77968128d9c92ee1010f337ad4717eff15db5ed3c049b3411e0315eaa4593b\",\n ],\n [\n \"32d31c222f8f6f0ef86f7c98d3a3335ead5bcd32abdd94289fe4d3091aa824bf\",\n \"5f3032f5892156e39ccd3d7915b9e1da2e6dac9e6f26e961118d14b8462e1661\",\n ],\n [\n \"7461f371914ab32671045a155d9831ea8793d77cd59592c4340f86cbc18347b5\",\n \"8ec0ba238b96bec0cbdddcae0aa442542eee1ff50c986ea6b39847b3cc092ff6\",\n ],\n [\n \"ee079adb1df1860074356a25aa38206a6d716b2c3e67453d287698bad7b2b2d6\",\n \"8dc2412aafe3be5c4c5f37e0ecc5f9f6a446989af04c4e25ebaac479ec1c8c1e\",\n ],\n [\n \"16ec93e447ec83f0467b18302ee620f7e65de331874c9dc72bfd8616ba9da6b5\",\n \"5e4631150e62fb40d0e8c2a7ca5804a39d58186a50e497139626778e25b0674d\",\n ],\n [\n \"eaa5f980c245f6f038978290afa70b6bd8855897f98b6aa485b96065d537bd99\",\n \"f65f5d3e292c2e0819a528391c994624d784869d7e6ea67fb18041024edc07dc\",\n ],\n [\n \"78c9407544ac132692ee1910a02439958ae04877151342ea96c4b6b35a49f51\",\n \"f3e0319169eb9b85d5404795539a5e68fa1fbd583c064d2462b675f194a3ddb4\",\n ],\n [\n \"494f4be219a1a77016dcd838431aea0001cdc8ae7a6fc688726578d9702857a5\",\n \"42242a969283a5f339ba7f075e36ba2af925ce30d767ed6e55f4b031880d562c\",\n ],\n [\n \"a598a8030da6d86c6bc7f2f5144ea549d28211ea58faa70ebf4c1e665c1fe9b5\",\n \"204b5d6f84822c307e4b4a7140737aec23fc63b65b35f86a10026dbd2d864e6b\",\n ],\n [\n \"c41916365abb2b5d09192f5f2dbeafec208f020f12570a184dbadc3e58595997\",\n \"4f14351d0087efa49d245b328984989d5caf9450f34bfc0ed16e96b58fa9913\",\n ],\n [\n \"841d6063a586fa475a724604da03bc5b92a2e0d2e0a36acfe4c73a5514742881\",\n \"73867f59c0659e81904f9a1c7543698e62562d6744c169ce7a36de01a8d6154\",\n ],\n [\n \"5e95bb399a6971d376026947f89bde2f282b33810928be4ded112ac4d70e20d5\",\n \"39f23f366809085beebfc71181313775a99c9aed7d8ba38b161384c746012865\",\n ],\n [\n \"36e4641a53948fd476c39f8a99fd974e5ec07564b5315d8bf99471bca0ef2f66\",\n \"d2424b1b1abe4eb8164227b085c9aa9456ea13493fd563e06fd51cf5694c78fc\",\n ],\n [\n \"336581ea7bfbbb290c191a2f507a41cf5643842170e914faeab27c2c579f726\",\n \"ead12168595fe1be99252129b6e56b3391f7ab1410cd1e0ef3dcdcabd2fda224\",\n ],\n [\n \"8ab89816dadfd6b6a1f2634fcf00ec8403781025ed6890c4849742706bd43ede\",\n \"6fdcef09f2f6d0a044e654aef624136f503d459c3e89845858a47a9129cdd24e\",\n ],\n [\n \"1e33f1a746c9c5778133344d9299fcaa20b0938e8acff2544bb40284b8c5fb94\",\n \"60660257dd11b3aa9c8ed618d24edff2306d320f1d03010e33a7d2057f3b3b6\",\n ],\n [\n \"85b7c1dcb3cec1b7ee7f30ded79dd20a0ed1f4cc18cbcfcfa410361fd8f08f31\",\n \"3d98a9cdd026dd43f39048f25a8847f4fcafad1895d7a633c6fed3c35e999511\",\n ],\n [\n \"29df9fbd8d9e46509275f4b125d6d45d7fbe9a3b878a7af872a2800661ac5f51\",\n \"b4c4fe99c775a606e2d8862179139ffda61dc861c019e55cd2876eb2a27d84b\",\n ],\n [\n \"a0b1cae06b0a847a3fea6e671aaf8adfdfe58ca2f768105c8082b2e449fce252\",\n \"ae434102edde0958ec4b19d917a6a28e6b72da1834aff0e650f049503a296cf2\",\n ],\n [\n \"4e8ceafb9b3e9a136dc7ff67e840295b499dfb3b2133e4ba113f2e4c0e121e5\",\n \"cf2174118c8b6d7a4b48f6d534ce5c79422c086a63460502b827ce62a326683c\",\n ],\n [\n \"d24a44e047e19b6f5afb81c7ca2f69080a5076689a010919f42725c2b789a33b\",\n \"6fb8d5591b466f8fc63db50f1c0f1c69013f996887b8244d2cdec417afea8fa3\",\n ],\n [\n \"ea01606a7a6c9cdd249fdfcfacb99584001edd28abbab77b5104e98e8e3b35d4\",\n \"322af4908c7312b0cfbfe369f7a7b3cdb7d4494bc2823700cfd652188a3ea98d\",\n ],\n [\n \"af8addbf2b661c8a6c6328655eb96651252007d8c5ea31be4ad196de8ce2131f\",\n \"6749e67c029b85f52a034eafd096836b2520818680e26ac8f3dfbcdb71749700\",\n ],\n [\n \"e3ae1974566ca06cc516d47e0fb165a674a3dabcfca15e722f0e3450f45889\",\n \"2aeabe7e4531510116217f07bf4d07300de97e4874f81f533420a72eeb0bd6a4\",\n ],\n [\n \"591ee355313d99721cf6993ffed1e3e301993ff3ed258802075ea8ced397e246\",\n \"b0ea558a113c30bea60fc4775460c7901ff0b053d25ca2bdeee98f1a4be5d196\",\n ],\n [\n \"11396d55fda54c49f19aa97318d8da61fa8584e47b084945077cf03255b52984\",\n \"998c74a8cd45ac01289d5833a7beb4744ff536b01b257be4c5767bea93ea57a4\",\n ],\n [\n \"3c5d2a1ba39c5a1790000738c9e0c40b8dcdfd5468754b6405540157e017aa7a\",\n \"b2284279995a34e2f9d4de7396fc18b80f9b8b9fdd270f6661f79ca4c81bd257\",\n ],\n [\n \"cc8704b8a60a0defa3a99a7299f2e9c3fbc395afb04ac078425ef8a1793cc030\",\n \"bdd46039feed17881d1e0862db347f8cf395b74fc4bcdc4e940b74e3ac1f1b13\",\n ],\n [\n \"c533e4f7ea8555aacd9777ac5cad29b97dd4defccc53ee7ea204119b2889b197\",\n \"6f0a256bc5efdf429a2fb6242f1a43a2d9b925bb4a4b3a26bb8e0f45eb596096\",\n ],\n [\n \"c14f8f2ccb27d6f109f6d08d03cc96a69ba8c34eec07bbcf566d48e33da6593\",\n \"c359d6923bb398f7fd4473e16fe1c28475b740dd098075e6c0e8649113dc3a38\",\n ],\n [\n \"a6cbc3046bc6a450bac24789fa17115a4c9739ed75f8f21ce441f72e0b90e6ef\",\n \"21ae7f4680e889bb130619e2c0f95a360ceb573c70603139862afd617fa9b9f\",\n ],\n [\n \"347d6d9a02c48927ebfb86c1359b1caf130a3c0267d11ce6344b39f99d43cc38\",\n \"60ea7f61a353524d1c987f6ecec92f086d565ab687870cb12689ff1e31c74448\",\n ],\n [\n \"da6545d2181db8d983f7dcb375ef5866d47c67b1bf31c8cf855ef7437b72656a\",\n \"49b96715ab6878a79e78f07ce5680c5d6673051b4935bd897fea824b77dc208a\",\n ],\n [\n \"c40747cc9d012cb1a13b8148309c6de7ec25d6945d657146b9d5994b8feb1111\",\n \"5ca560753be2a12fc6de6caf2cb489565db936156b9514e1bb5e83037e0fa2d4\",\n ],\n [\n \"4e42c8ec82c99798ccf3a610be870e78338c7f713348bd34c8203ef4037f3502\",\n \"7571d74ee5e0fb92a7a8b33a07783341a5492144cc54bcc40a94473693606437\",\n ],\n [\n \"3775ab7089bc6af823aba2e1af70b236d251cadb0c86743287522a1b3b0dedea\",\n \"be52d107bcfa09d8bcb9736a828cfa7fac8db17bf7a76a2c42ad961409018cf7\",\n ],\n [\n \"cee31cbf7e34ec379d94fb814d3d775ad954595d1314ba8846959e3e82f74e26\",\n \"8fd64a14c06b589c26b947ae2bcf6bfa0149ef0be14ed4d80f448a01c43b1c6d\",\n ],\n [\n \"b4f9eaea09b6917619f6ea6a4eb5464efddb58fd45b1ebefcdc1a01d08b47986\",\n \"39e5c9925b5a54b07433a4f18c61726f8bb131c012ca542eb24a8ac07200682a\",\n ],\n [\n \"d4263dfc3d2df923a0179a48966d30ce84e2515afc3dccc1b77907792ebcc60e\",\n \"62dfaf07a0f78feb30e30d6295853ce189e127760ad6cf7fae164e122a208d54\",\n ],\n [\n \"48457524820fa65a4f8d35eb6930857c0032acc0a4a2de422233eeda897612c4\",\n \"25a748ab367979d98733c38a1fa1c2e7dc6cc07db2d60a9ae7a76aaa49bd0f77\",\n ],\n [\n \"dfeeef1881101f2cb11644f3a2afdfc2045e19919152923f367a1767c11cceda\",\n \"ecfb7056cf1de042f9420bab396793c0c390bde74b4bbdff16a83ae09a9a7517\",\n ],\n [\n \"6d7ef6b17543f8373c573f44e1f389835d89bcbc6062ced36c82df83b8fae859\",\n \"cd450ec335438986dfefa10c57fea9bcc521a0959b2d80bbf74b190dca712d10\",\n ],\n [\n \"e75605d59102a5a2684500d3b991f2e3f3c88b93225547035af25af66e04541f\",\n \"f5c54754a8f71ee540b9b48728473e314f729ac5308b06938360990e2bfad125\",\n ],\n [\n \"eb98660f4c4dfaa06a2be453d5020bc99a0c2e60abe388457dd43fefb1ed620c\",\n \"6cb9a8876d9cb8520609af3add26cd20a0a7cd8a9411131ce85f44100099223e\",\n ],\n [\n \"13e87b027d8514d35939f2e6892b19922154596941888336dc3563e3b8dba942\",\n \"fef5a3c68059a6dec5d624114bf1e91aac2b9da568d6abeb2570d55646b8adf1\",\n ],\n [\n \"ee163026e9fd6fe017c38f06a5be6fc125424b371ce2708e7bf4491691e5764a\",\n \"1acb250f255dd61c43d94ccc670d0f58f49ae3fa15b96623e5430da0ad6c62b2\",\n ],\n [\n \"b268f5ef9ad51e4d78de3a750c2dc89b1e626d43505867999932e5db33af3d80\",\n \"5f310d4b3c99b9ebb19f77d41c1dee018cf0d34fd4191614003e945a1216e423\",\n ],\n [\n \"ff07f3118a9df035e9fad85eb6c7bfe42b02f01ca99ceea3bf7ffdba93c4750d\",\n \"438136d603e858a3a5c440c38eccbaddc1d2942114e2eddd4740d098ced1f0d8\",\n ],\n [\n \"8d8b9855c7c052a34146fd20ffb658bea4b9f69e0d825ebec16e8c3ce2b526a1\",\n \"cdb559eedc2d79f926baf44fb84ea4d44bcf50fee51d7ceb30e2e7f463036758\",\n ],\n [\n \"52db0b5384dfbf05bfa9d472d7ae26dfe4b851ceca91b1eba54263180da32b63\",\n \"c3b997d050ee5d423ebaf66a6db9f57b3180c902875679de924b69d84a7b375\",\n ],\n [\n \"e62f9490d3d51da6395efd24e80919cc7d0f29c3f3fa48c6fff543becbd43352\",\n \"6d89ad7ba4876b0b22c2ca280c682862f342c8591f1daf5170e07bfd9ccafa7d\",\n ],\n [\n \"7f30ea2476b399b4957509c88f77d0191afa2ff5cb7b14fd6d8e7d65aaab1193\",\n \"ca5ef7d4b231c94c3b15389a5f6311e9daff7bb67b103e9880ef4bff637acaec\",\n ],\n [\n \"5098ff1e1d9f14fb46a210fada6c903fef0fb7b4a1dd1d9ac60a0361800b7a00\",\n \"9731141d81fc8f8084d37c6e7542006b3ee1b40d60dfe5362a5b132fd17ddc0\",\n ],\n [\n \"32b78c7de9ee512a72895be6b9cbefa6e2f3c4ccce445c96b9f2c81e2778ad58\",\n \"ee1849f513df71e32efc3896ee28260c73bb80547ae2275ba497237794c8753c\",\n ],\n [\n \"e2cb74fddc8e9fbcd076eef2a7c72b0ce37d50f08269dfc074b581550547a4f7\",\n \"d3aa2ed71c9dd2247a62df062736eb0baddea9e36122d2be8641abcb005cc4a4\",\n ],\n [\n \"8438447566d4d7bedadc299496ab357426009a35f235cb141be0d99cd10ae3a8\",\n \"c4e1020916980a4da5d01ac5e6ad330734ef0d7906631c4f2390426b2edd791f\",\n ],\n [\n \"4162d488b89402039b584c6fc6c308870587d9c46f660b878ab65c82c711d67e\",\n \"67163e903236289f776f22c25fb8a3afc1732f2b84b4e95dbda47ae5a0852649\",\n ],\n [\n \"3fad3fa84caf0f34f0f89bfd2dcf54fc175d767aec3e50684f3ba4a4bf5f683d\",\n \"cd1bc7cb6cc407bb2f0ca647c718a730cf71872e7d0d2a53fa20efcdfe61826\",\n ],\n [\n \"674f2600a3007a00568c1a7ce05d0816c1fb84bf1370798f1c69532faeb1a86b\",\n \"299d21f9413f33b3edf43b257004580b70db57da0b182259e09eecc69e0d38a5\",\n ],\n [\n \"d32f4da54ade74abb81b815ad1fb3b263d82d6c692714bcff87d29bd5ee9f08f\",\n \"f9429e738b8e53b968e99016c059707782e14f4535359d582fc416910b3eea87\",\n ],\n [\n \"30e4e670435385556e593657135845d36fbb6931f72b08cb1ed954f1e3ce3ff6\",\n \"462f9bce619898638499350113bbc9b10a878d35da70740dc695a559eb88db7b\",\n ],\n [\n \"be2062003c51cc3004682904330e4dee7f3dcd10b01e580bf1971b04d4cad297\",\n \"62188bc49d61e5428573d48a74e1c655b1c61090905682a0d5558ed72dccb9bc\",\n ],\n [\n \"93144423ace3451ed29e0fb9ac2af211cb6e84a601df5993c419859fff5df04a\",\n \"7c10dfb164c3425f5c71a3f9d7992038f1065224f72bb9d1d902a6d13037b47c\",\n ],\n [\n \"b015f8044f5fcbdcf21ca26d6c34fb8197829205c7b7d2a7cb66418c157b112c\",\n \"ab8c1e086d04e813744a655b2df8d5f83b3cdc6faa3088c1d3aea1454e3a1d5f\",\n ],\n [\n \"d5e9e1da649d97d89e4868117a465a3a4f8a18de57a140d36b3f2af341a21b52\",\n \"4cb04437f391ed73111a13cc1d4dd0db1693465c2240480d8955e8592f27447a\",\n ],\n [\n \"d3ae41047dd7ca065dbf8ed77b992439983005cd72e16d6f996a5316d36966bb\",\n \"bd1aeb21ad22ebb22a10f0303417c6d964f8cdd7df0aca614b10dc14d125ac46\",\n ],\n [\n \"463e2763d885f958fc66cdd22800f0a487197d0a82e377b49f80af87c897b065\",\n \"bfefacdb0e5d0fd7df3a311a94de062b26b80c61fbc97508b79992671ef7ca7f\",\n ],\n [\n \"7985fdfd127c0567c6f53ec1bb63ec3158e597c40bfe747c83cddfc910641917\",\n \"603c12daf3d9862ef2b25fe1de289aed24ed291e0ec6708703a5bd567f32ed03\",\n ],\n [\n \"74a1ad6b5f76e39db2dd249410eac7f99e74c59cb83d2d0ed5ff1543da7703e9\",\n \"cc6157ef18c9c63cd6193d83631bbea0093e0968942e8c33d5737fd790e0db08\",\n ],\n [\n \"30682a50703375f602d416664ba19b7fc9bab42c72747463a71d0896b22f6da3\",\n \"553e04f6b018b4fa6c8f39e7f311d3176290d0e0f19ca73f17714d9977a22ff8\",\n ],\n [\n \"9e2158f0d7c0d5f26c3791efefa79597654e7a2b2464f52b1ee6c1347769ef57\",\n \"712fcdd1b9053f09003a3481fa7762e9ffd7c8ef35a38509e2fbf2629008373\",\n ],\n [\n \"176e26989a43c9cfeba4029c202538c28172e566e3c4fce7322857f3be327d66\",\n \"ed8cc9d04b29eb877d270b4878dc43c19aefd31f4eee09ee7b47834c1fa4b1c3\",\n ],\n [\n \"75d46efea3771e6e68abb89a13ad747ecf1892393dfc4f1b7004788c50374da8\",\n \"9852390a99507679fd0b86fd2b39a868d7efc22151346e1a3ca4726586a6bed8\",\n ],\n [\n \"809a20c67d64900ffb698c4c825f6d5f2310fb0451c869345b7319f645605721\",\n \"9e994980d9917e22b76b061927fa04143d096ccc54963e6a5ebfa5f3f8e286c1\",\n ],\n [\n \"1b38903a43f7f114ed4500b4eac7083fdefece1cf29c63528d563446f972c180\",\n \"4036edc931a60ae889353f77fd53de4a2708b26b6f5da72ad3394119daf408f9\",\n ],\n ],\n },\n };\n },\n});\n\n// node_modules/elliptic/lib/elliptic/curves.js\nvar require_curves = __commonJS({\n \"node_modules/elliptic/lib/elliptic/curves.js\"(exports) {\n \"use strict\";\n var curves = exports,\n hash = require_hash2(),\n curve = require_curve(),\n utils = require_utils3(),\n assert = utils.assert;\n function PresetCurve(options) {\n options.type === \"short\"\n ? (this.curve = new curve.short(options))\n : options.type === \"edwards\"\n ? (this.curve = new curve.edwards(options))\n : (this.curve = new curve.mont(options)),\n (this.g = this.curve.g),\n (this.n = this.curve.n),\n (this.hash = options.hash),\n assert(this.g.validate(), \"Invalid curve\"),\n assert(this.g.mul(this.n).isInfinity(), \"Invalid curve, G*N != O\");\n }\n curves.PresetCurve = PresetCurve;\n function defineCurve(name, options) {\n Object.defineProperty(curves, name, {\n configurable: !0,\n enumerable: !0,\n get: function () {\n var curve2 = new PresetCurve(options);\n return (\n Object.defineProperty(curves, name, {\n configurable: !0,\n enumerable: !0,\n value: curve2,\n }),\n curve2\n );\n },\n });\n }\n defineCurve(\"p192\", {\n type: \"short\",\n prime: \"p192\",\n p: \"ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff\",\n a: \"ffffffff ffffffff ffffffff fffffffe ffffffff fffffffc\",\n b: \"64210519 e59c80e7 0fa7e9ab 72243049 feb8deec c146b9b1\",\n n: \"ffffffff ffffffff ffffffff 99def836 146bc9b1 b4d22831\",\n hash: hash.sha256,\n gRed: !1,\n g: [\n \"188da80e b03090f6 7cbf20eb 43a18800 f4ff0afd 82ff1012\",\n \"07192b95 ffc8da78 631011ed 6b24cdd5 73f977a1 1e794811\",\n ],\n });\n defineCurve(\"p224\", {\n type: \"short\",\n prime: \"p224\",\n p: \"ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001\",\n a: \"ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff fffffffe\",\n b: \"b4050a85 0c04b3ab f5413256 5044b0b7 d7bfd8ba 270b3943 2355ffb4\",\n n: \"ffffffff ffffffff ffffffff ffff16a2 e0b8f03e 13dd2945 5c5c2a3d\",\n hash: hash.sha256,\n gRed: !1,\n g: [\n \"b70e0cbd 6bb4bf7f 321390b9 4a03c1d3 56c21122 343280d6 115c1d21\",\n \"bd376388 b5f723fb 4c22dfe6 cd4375a0 5a074764 44d58199 85007e34\",\n ],\n });\n defineCurve(\"p256\", {\n type: \"short\",\n prime: null,\n p: \"ffffffff 00000001 00000000 00000000 00000000 ffffffff ffffffff ffffffff\",\n a: \"ffffffff 00000001 00000000 00000000 00000000 ffffffff ffffffff fffffffc\",\n b: \"5ac635d8 aa3a93e7 b3ebbd55 769886bc 651d06b0 cc53b0f6 3bce3c3e 27d2604b\",\n n: \"ffffffff 00000000 ffffffff ffffffff bce6faad a7179e84 f3b9cac2 fc632551\",\n hash: hash.sha256,\n gRed: !1,\n g: [\n \"6b17d1f2 e12c4247 f8bce6e5 63a440f2 77037d81 2deb33a0 f4a13945 d898c296\",\n \"4fe342e2 fe1a7f9b 8ee7eb4a 7c0f9e16 2bce3357 6b315ece cbb64068 37bf51f5\",\n ],\n });\n defineCurve(\"p384\", {\n type: \"short\",\n prime: null,\n p: \"ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe ffffffff 00000000 00000000 ffffffff\",\n a: \"ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe ffffffff 00000000 00000000 fffffffc\",\n b: \"b3312fa7 e23ee7e4 988e056b e3f82d19 181d9c6e fe814112 0314088f 5013875a c656398d 8a2ed19d 2a85c8ed d3ec2aef\",\n n: \"ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff c7634d81 f4372ddf 581a0db2 48b0a77a ecec196a ccc52973\",\n hash: hash.sha384,\n gRed: !1,\n g: [\n \"aa87ca22 be8b0537 8eb1c71e f320ad74 6e1d3b62 8ba79b98 59f741e0 82542a38 5502f25d bf55296c 3a545e38 72760ab7\",\n \"3617de4a 96262c6f 5d9e98bf 9292dc29 f8f41dbd 289a147c e9da3113 b5f0b8c0 0a60b1ce 1d7e819d 7a431d7c 90ea0e5f\",\n ],\n });\n defineCurve(\"p521\", {\n type: \"short\",\n prime: null,\n p: \"000001ff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff\",\n a: \"000001ff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffc\",\n b: \"00000051 953eb961 8e1c9a1f 929a21a0 b68540ee a2da725b 99b315f3 b8b48991 8ef109e1 56193951 ec7e937b 1652c0bd 3bb1bf07 3573df88 3d2c34f1 ef451fd4 6b503f00\",\n n: \"000001ff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffa 51868783 bf2f966b 7fcc0148 f709a5d0 3bb5c9b8 899c47ae bb6fb71e 91386409\",\n hash: hash.sha512,\n gRed: !1,\n g: [\n \"000000c6 858e06b7 0404e9cd 9e3ecb66 2395b442 9c648139 053fb521 f828af60 6b4d3dba a14b5e77 efe75928 fe1dc127 a2ffa8de 3348b3c1 856a429b f97e7e31 c2e5bd66\",\n \"00000118 39296a78 9a3bc004 5c8a5fb4 2c7d1bd9 98f54449 579b4468 17afbd17 273e662c 97ee7299 5ef42640 c550b901 3fad0761 353c7086 a272c240 88be9476 9fd16650\",\n ],\n });\n defineCurve(\"curve25519\", {\n type: \"mont\",\n prime: \"p25519\",\n p: \"7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed\",\n a: \"76d06\",\n b: \"1\",\n n: \"1000000000000000 0000000000000000 14def9dea2f79cd6 5812631a5cf5d3ed\",\n hash: hash.sha256,\n gRed: !1,\n g: [\"9\"],\n });\n defineCurve(\"ed25519\", {\n type: \"edwards\",\n prime: \"p25519\",\n p: \"7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed\",\n a: \"-1\",\n c: \"1\",\n d: \"52036cee2b6ffe73 8cc740797779e898 00700a4d4141d8ab 75eb4dca135978a3\",\n n: \"1000000000000000 0000000000000000 14def9dea2f79cd6 5812631a5cf5d3ed\",\n hash: hash.sha256,\n gRed: !1,\n g: [\n \"216936d3cd6e53fec0a4e231fdd6dc5c692cc7609525a7b2c9562d608f25d51a\",\n \"6666666666666666666666666666666666666666666666666666666666666658\",\n ],\n });\n var pre;\n try {\n pre = require_secp256k1();\n } catch {\n pre = void 0;\n }\n defineCurve(\"secp256k1\", {\n type: \"short\",\n prime: \"k256\",\n p: \"ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f\",\n a: \"0\",\n b: \"7\",\n n: \"ffffffff ffffffff ffffffff fffffffe baaedce6 af48a03b bfd25e8c d0364141\",\n h: \"1\",\n hash: hash.sha256,\n beta: \"7ae96a2b657c07106e64479eac3434e99cf0497512f58995c1396c28719501ee\",\n lambda: \"5363ad4cc05c30e0a5261c028812645a122e22ea20816678df02967c1b23bd72\",\n basis: [\n {\n a: \"3086d221a7d46bcde86c90e49284eb15\",\n b: \"-e4437ed6010e88286f547fa90abfe4c3\",\n },\n {\n a: \"114ca50f7a8e2f3f657c1108d9d44cfd8\",\n b: \"3086d221a7d46bcde86c90e49284eb15\",\n },\n ],\n gRed: !1,\n g: [\n \"79be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798\",\n \"483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8\",\n pre,\n ],\n });\n },\n});\n\n// node_modules/hmac-drbg/lib/hmac-drbg.js\nvar require_hmac_drbg = __commonJS({\n \"node_modules/hmac-drbg/lib/hmac-drbg.js\"(exports, module) {\n \"use strict\";\n var hash = require_hash2(),\n utils = require_utils2(),\n assert = require_minimalistic_assert();\n function HmacDRBG(options) {\n if (!(this instanceof HmacDRBG)) return new HmacDRBG(options);\n (this.hash = options.hash),\n (this.predResist = !!options.predResist),\n (this.outLen = this.hash.outSize),\n (this.minEntropy = options.minEntropy || this.hash.hmacStrength),\n (this._reseed = null),\n (this.reseedInterval = null),\n (this.K = null),\n (this.V = null);\n var entropy = utils.toArray(options.entropy, options.entropyEnc || \"hex\"),\n nonce = utils.toArray(options.nonce, options.nonceEnc || \"hex\"),\n pers = utils.toArray(options.pers, options.persEnc || \"hex\");\n assert(entropy.length >= this.minEntropy / 8, \"Not enough entropy. Minimum is: \" + this.minEntropy + \" bits\"),\n this._init(entropy, nonce, pers);\n }\n module.exports = HmacDRBG;\n HmacDRBG.prototype._init = function (entropy, nonce, pers) {\n var seed = entropy.concat(nonce).concat(pers);\n (this.K = new Array(this.outLen / 8)), (this.V = new Array(this.outLen / 8));\n for (var i = 0; i < this.V.length; i++) (this.K[i] = 0), (this.V[i] = 1);\n this._update(seed), (this._reseed = 1), (this.reseedInterval = 281474976710656);\n };\n HmacDRBG.prototype._hmac = function () {\n return new hash.hmac(this.hash, this.K);\n };\n HmacDRBG.prototype._update = function (seed) {\n var kmac = this._hmac().update(this.V).update([0]);\n seed && (kmac = kmac.update(seed)),\n (this.K = kmac.digest()),\n (this.V = this._hmac().update(this.V).digest()),\n seed &&\n ((this.K = this._hmac().update(this.V).update([1]).update(seed).digest()),\n (this.V = this._hmac().update(this.V).digest()));\n };\n HmacDRBG.prototype.reseed = function (entropy, entropyEnc, add, addEnc) {\n typeof entropyEnc != \"string\" && ((addEnc = add), (add = entropyEnc), (entropyEnc = null)),\n (entropy = utils.toArray(entropy, entropyEnc)),\n (add = utils.toArray(add, addEnc)),\n assert(entropy.length >= this.minEntropy / 8, \"Not enough entropy. Minimum is: \" + this.minEntropy + \" bits\"),\n this._update(entropy.concat(add || [])),\n (this._reseed = 1);\n };\n HmacDRBG.prototype.generate = function (len, enc, add, addEnc) {\n if (this._reseed > this.reseedInterval) throw new Error(\"Reseed is required\");\n typeof enc != \"string\" && ((addEnc = add), (add = enc), (enc = null)),\n add && ((add = utils.toArray(add, addEnc || \"hex\")), this._update(add));\n for (var temp = []; temp.length < len; )\n (this.V = this._hmac().update(this.V).digest()), (temp = temp.concat(this.V));\n var res = temp.slice(0, len);\n return this._update(add), this._reseed++, utils.encode(res, enc);\n };\n },\n});\n\n// node_modules/elliptic/lib/elliptic/ec/key.js\nvar require_key = __commonJS({\n \"node_modules/elliptic/lib/elliptic/ec/key.js\"(exports, module) {\n \"use strict\";\n var BN = require_bn4(),\n utils = require_utils3(),\n assert = utils.assert;\n function KeyPair(ec, options) {\n (this.ec = ec),\n (this.priv = null),\n (this.pub = null),\n options.priv && this._importPrivate(options.priv, options.privEnc),\n options.pub && this._importPublic(options.pub, options.pubEnc);\n }\n module.exports = KeyPair;\n KeyPair.fromPublic = function (ec, pub, enc) {\n return pub instanceof KeyPair\n ? pub\n : new KeyPair(ec, {\n pub,\n pubEnc: enc,\n });\n };\n KeyPair.fromPrivate = function (ec, priv, enc) {\n return priv instanceof KeyPair\n ? priv\n : new KeyPair(ec, {\n priv,\n privEnc: enc,\n });\n };\n KeyPair.prototype.validate = function () {\n var pub = this.getPublic();\n return pub.isInfinity()\n ? { result: !1, reason: \"Invalid public key\" }\n : pub.validate()\n ? pub.mul(this.ec.curve.n).isInfinity()\n ? { result: !0, reason: null }\n : { result: !1, reason: \"Public key * N != O\" }\n : { result: !1, reason: \"Public key is not a point\" };\n };\n KeyPair.prototype.getPublic = function (compact, enc) {\n return (\n typeof compact == \"string\" && ((enc = compact), (compact = null)),\n this.pub || (this.pub = this.ec.g.mul(this.priv)),\n enc ? this.pub.encode(enc, compact) : this.pub\n );\n };\n KeyPair.prototype.getPrivate = function (enc) {\n return enc === \"hex\" ? this.priv.toString(16, 2) : this.priv;\n };\n KeyPair.prototype._importPrivate = function (key, enc) {\n (this.priv = new BN(key, enc || 16)), (this.priv = this.priv.umod(this.ec.curve.n));\n };\n KeyPair.prototype._importPublic = function (key, enc) {\n if (key.x || key.y) {\n this.ec.curve.type === \"mont\"\n ? assert(key.x, \"Need x coordinate\")\n : (this.ec.curve.type === \"short\" || this.ec.curve.type === \"edwards\") &&\n assert(key.x && key.y, \"Need both x and y coordinate\"),\n (this.pub = this.ec.curve.point(key.x, key.y));\n return;\n }\n this.pub = this.ec.curve.decodePoint(key, enc);\n };\n KeyPair.prototype.derive = function (pub) {\n return pub.validate() || assert(pub.validate(), \"public point not validated\"), pub.mul(this.priv).getX();\n };\n KeyPair.prototype.sign = function (msg, enc, options) {\n return this.ec.sign(msg, this, enc, options);\n };\n KeyPair.prototype.verify = function (msg, signature) {\n return this.ec.verify(msg, signature, this);\n };\n KeyPair.prototype.inspect = function () {\n return (\n \"<Key priv: \" + (this.priv && this.priv.toString(16, 2)) + \" pub: \" + (this.pub && this.pub.inspect()) + \" >\"\n );\n };\n },\n});\n\n// node_modules/elliptic/lib/elliptic/ec/signature.js\nvar require_signature = __commonJS({\n \"node_modules/elliptic/lib/elliptic/ec/signature.js\"(exports, module) {\n \"use strict\";\n var BN = require_bn4(),\n utils = require_utils3(),\n assert = utils.assert;\n function Signature(options, enc) {\n if (options instanceof Signature) return options;\n this._importDER(options, enc) ||\n (assert(options.r && options.s, \"Signature without r or s\"),\n (this.r = new BN(options.r, 16)),\n (this.s = new BN(options.s, 16)),\n options.recoveryParam === void 0 ? (this.recoveryParam = null) : (this.recoveryParam = options.recoveryParam));\n }\n module.exports = Signature;\n function Position() {\n this.place = 0;\n }\n function getLength(buf, p) {\n var initial = buf[p.place++];\n if (!(initial & 128)) return initial;\n var octetLen = initial & 15;\n if (octetLen === 0 || octetLen > 4) return !1;\n for (var val = 0, i = 0, off = p.place; i < octetLen; i++, off++) (val <<= 8), (val |= buf[off]), (val >>>= 0);\n return val <= 127 ? !1 : ((p.place = off), val);\n }\n function rmPadding(buf) {\n for (var i = 0, len = buf.length - 1; !buf[i] && !(buf[i + 1] & 128) && i < len; ) i++;\n return i === 0 ? buf : buf.slice(i);\n }\n Signature.prototype._importDER = function (data, enc) {\n data = utils.toArray(data, enc);\n var p = new Position();\n if (data[p.place++] !== 48) return !1;\n var len = getLength(data, p);\n if (len === !1 || len + p.place !== data.length || data[p.place++] !== 2) return !1;\n var rlen = getLength(data, p);\n if (rlen === !1) return !1;\n var r = data.slice(p.place, rlen + p.place);\n if (((p.place += rlen), data[p.place++] !== 2)) return !1;\n var slen = getLength(data, p);\n if (slen === !1 || data.length !== slen + p.place) return !1;\n var s = data.slice(p.place, slen + p.place);\n if (r[0] === 0)\n if (r[1] & 128) r = r.slice(1);\n else return !1;\n if (s[0] === 0)\n if (s[1] & 128) s = s.slice(1);\n else return !1;\n return (this.r = new BN(r)), (this.s = new BN(s)), (this.recoveryParam = null), !0;\n };\n function constructLength(arr, len) {\n if (len < 128) {\n arr.push(len);\n return;\n }\n var octets = 1 + ((Math.log(len) / Math.LN2) >>> 3);\n for (arr.push(octets | 128); --octets; ) arr.push((len >>> (octets << 3)) & 255);\n arr.push(len);\n }\n Signature.prototype.toDER = function (enc) {\n var r = this.r.toArray(),\n s = this.s.toArray();\n for (\n r[0] & 128 && (r = [0].concat(r)), s[0] & 128 && (s = [0].concat(s)), r = rmPadding(r), s = rmPadding(s);\n !s[0] && !(s[1] & 128);\n\n )\n s = s.slice(1);\n var arr = [2];\n constructLength(arr, r.length), (arr = arr.concat(r)), arr.push(2), constructLength(arr, s.length);\n var backHalf = arr.concat(s),\n res = [48];\n return constructLength(res, backHalf.length), (res = res.concat(backHalf)), utils.encode(res, enc);\n };\n },\n});\n\n// node_modules/elliptic/lib/elliptic/ec/index.js\nvar require_ec = __commonJS({\n \"node_modules/elliptic/lib/elliptic/ec/index.js\"(exports, module) {\n \"use strict\";\n var BN = require_bn4(),\n HmacDRBG = require_hmac_drbg(),\n utils = require_utils3(),\n curves = require_curves(),\n rand = require_brorand(),\n assert = utils.assert,\n KeyPair = require_key(),\n Signature = require_signature();\n function EC(options) {\n if (!(this instanceof EC)) return new EC(options);\n typeof options == \"string\" &&\n (assert(Object.prototype.hasOwnProperty.call(curves, options), \"Unknown curve \" + options),\n (options = curves[options])),\n options instanceof curves.PresetCurve && (options = { curve: options }),\n (this.curve = options.curve.curve),\n (this.n = this.curve.n),\n (this.nh = this.n.ushrn(1)),\n (this.g = this.curve.g),\n (this.g = options.curve.g),\n this.g.precompute(options.curve.n.bitLength() + 1),\n (this.hash = options.hash || options.curve.hash);\n }\n module.exports = EC;\n EC.prototype.keyPair = function (options) {\n return new KeyPair(this, options);\n };\n EC.prototype.keyFromPrivate = function (priv, enc) {\n return KeyPair.fromPrivate(this, priv, enc);\n };\n EC.prototype.keyFromPublic = function (pub, enc) {\n return KeyPair.fromPublic(this, pub, enc);\n };\n EC.prototype.genKeyPair = function (options) {\n options || (options = {});\n for (\n var drbg = new HmacDRBG({\n hash: this.hash,\n pers: options.pers,\n persEnc: options.persEnc || \"utf8\",\n entropy: options.entropy || rand(this.hash.hmacStrength),\n entropyEnc: (options.entropy && options.entropyEnc) || \"utf8\",\n nonce: this.n.toArray(),\n }),\n bytes = this.n.byteLength(),\n ns2 = this.n.sub(new BN(2));\n ;\n\n ) {\n var priv = new BN(drbg.generate(bytes));\n if (!(priv.cmp(ns2) > 0)) return priv.iaddn(1), this.keyFromPrivate(priv);\n }\n };\n EC.prototype._truncateToN = function (msg, truncOnly) {\n var delta = msg.byteLength() * 8 - this.n.bitLength();\n return delta > 0 && (msg = msg.ushrn(delta)), !truncOnly && msg.cmp(this.n) >= 0 ? msg.sub(this.n) : msg;\n };\n EC.prototype.sign = function (msg, key, enc, options) {\n typeof enc == \"object\" && ((options = enc), (enc = null)),\n options || (options = {}),\n (key = this.keyFromPrivate(key, enc)),\n (msg = this._truncateToN(new BN(msg, 16)));\n for (\n var bytes = this.n.byteLength(),\n bkey = key.getPrivate().toArray(\"be\", bytes),\n nonce = msg.toArray(\"be\", bytes),\n drbg = new HmacDRBG({\n hash: this.hash,\n entropy: bkey,\n nonce,\n pers: options.pers,\n persEnc: options.persEnc || \"utf8\",\n }),\n ns1 = this.n.sub(new BN(1)),\n iter = 0;\n ;\n iter++\n ) {\n var k = options.k ? options.k(iter) : new BN(drbg.generate(this.n.byteLength()));\n if (((k = this._truncateToN(k, !0)), !(k.cmpn(1) <= 0 || k.cmp(ns1) >= 0))) {\n var kp = this.g.mul(k);\n if (!kp.isInfinity()) {\n var kpX = kp.getX(),\n r = kpX.umod(this.n);\n if (r.cmpn(0) !== 0) {\n var s = k.invm(this.n).mul(r.mul(key.getPrivate()).iadd(msg));\n if (((s = s.umod(this.n)), s.cmpn(0) !== 0)) {\n var recoveryParam = (kp.getY().isOdd() ? 1 : 0) | (kpX.cmp(r) !== 0 ? 2 : 0);\n return (\n options.canonical && s.cmp(this.nh) > 0 && ((s = this.n.sub(s)), (recoveryParam ^= 1)),\n new Signature({ r, s, recoveryParam })\n );\n }\n }\n }\n }\n }\n };\n EC.prototype.verify = function (msg, signature, key, enc) {\n (msg = this._truncateToN(new BN(msg, 16))),\n (key = this.keyFromPublic(key, enc)),\n (signature = new Signature(signature, \"hex\"));\n var r = signature.r,\n s = signature.s;\n if (r.cmpn(1) < 0 || r.cmp(this.n) >= 0 || s.cmpn(1) < 0 || s.cmp(this.n) >= 0) return !1;\n var sinv = s.invm(this.n),\n u1 = sinv.mul(msg).umod(this.n),\n u2 = sinv.mul(r).umod(this.n),\n p;\n return this.curve._maxwellTrick\n ? ((p = this.g.jmulAdd(u1, key.getPublic(), u2)), p.isInfinity() ? !1 : p.eqXToP(r))\n : ((p = this.g.mulAdd(u1, key.getPublic(), u2)), p.isInfinity() ? !1 : p.getX().umod(this.n).cmp(r) === 0);\n };\n EC.prototype.recoverPubKey = function (msg, signature, j, enc) {\n assert((3 & j) === j, \"The recovery param is more than two bits\"), (signature = new Signature(signature, enc));\n var n = this.n,\n e = new BN(msg),\n r = signature.r,\n s = signature.s,\n isYOdd = j & 1,\n isSecondKey = j >> 1;\n if (r.cmp(this.curve.p.umod(this.curve.n)) >= 0 && isSecondKey)\n throw new Error(\"Unable to find sencond key candinate\");\n isSecondKey ? (r = this.curve.pointFromX(r.add(this.curve.n), isYOdd)) : (r = this.curve.pointFromX(r, isYOdd));\n var rInv = signature.r.invm(n),\n s1 = n.sub(e).mul(rInv).umod(n),\n s2 = s.mul(rInv).umod(n);\n return this.g.mulAdd(s1, r, s2);\n };\n EC.prototype.getKeyRecoveryParam = function (e, signature, Q, enc) {\n if (((signature = new Signature(signature, enc)), signature.recoveryParam !== null))\n return signature.recoveryParam;\n for (var i = 0; i < 4; i++) {\n var Qprime;\n try {\n Qprime = this.recoverPubKey(e, signature, i);\n } catch {\n continue;\n }\n if (Qprime.eq(Q)) return i;\n }\n throw new Error(\"Unable to find valid recovery factor\");\n };\n },\n});\n\n// node_modules/elliptic/lib/elliptic/eddsa/key.js\nvar require_key2 = __commonJS({\n \"node_modules/elliptic/lib/elliptic/eddsa/key.js\"(exports, module) {\n \"use strict\";\n var utils = require_utils3(),\n assert = utils.assert,\n parseBytes = utils.parseBytes,\n cachedProperty = utils.cachedProperty;\n function KeyPair(eddsa, params) {\n (this.eddsa = eddsa),\n (this._secret = parseBytes(params.secret)),\n eddsa.isPoint(params.pub) ? (this._pub = params.pub) : (this._pubBytes = parseBytes(params.pub));\n }\n KeyPair.fromPublic = function (eddsa, pub) {\n return pub instanceof KeyPair ? pub : new KeyPair(eddsa, { pub });\n };\n KeyPair.fromSecret = function (eddsa, secret) {\n return secret instanceof KeyPair ? secret : new KeyPair(eddsa, { secret });\n };\n KeyPair.prototype.secret = function () {\n return this._secret;\n };\n cachedProperty(KeyPair, \"pubBytes\", function () {\n return this.eddsa.encodePoint(this.pub());\n });\n cachedProperty(KeyPair, \"pub\", function () {\n return this._pubBytes ? this.eddsa.decodePoint(this._pubBytes) : this.eddsa.g.mul(this.priv());\n });\n cachedProperty(KeyPair, \"privBytes\", function () {\n var eddsa = this.eddsa,\n hash = this.hash(),\n lastIx = eddsa.encodingLength - 1,\n a = hash.slice(0, eddsa.encodingLength);\n return (a[0] &= 248), (a[lastIx] &= 127), (a[lastIx] |= 64), a;\n });\n cachedProperty(KeyPair, \"priv\", function () {\n return this.eddsa.decodeInt(this.privBytes());\n });\n cachedProperty(KeyPair, \"hash\", function () {\n return this.eddsa.hash().update(this.secret()).digest();\n });\n cachedProperty(KeyPair, \"messagePrefix\", function () {\n return this.hash().slice(this.eddsa.encodingLength);\n });\n KeyPair.prototype.sign = function (message) {\n return assert(this._secret, \"KeyPair can only verify\"), this.eddsa.sign(message, this);\n };\n KeyPair.prototype.verify = function (message, sig) {\n return this.eddsa.verify(message, sig, this);\n };\n KeyPair.prototype.getSecret = function (enc) {\n return assert(this._secret, \"KeyPair is public only\"), utils.encode(this.secret(), enc);\n };\n KeyPair.prototype.getPublic = function (enc) {\n return utils.encode(this.pubBytes(), enc);\n };\n module.exports = KeyPair;\n },\n});\n\n// node_modules/elliptic/lib/elliptic/eddsa/signature.js\nvar require_signature2 = __commonJS({\n \"node_modules/elliptic/lib/elliptic/eddsa/signature.js\"(exports, module) {\n \"use strict\";\n var BN = require_bn4(),\n utils = require_utils3(),\n assert = utils.assert,\n cachedProperty = utils.cachedProperty,\n parseBytes = utils.parseBytes;\n function Signature(eddsa, sig) {\n (this.eddsa = eddsa),\n typeof sig != \"object\" && (sig = parseBytes(sig)),\n Array.isArray(sig) &&\n (sig = {\n R: sig.slice(0, eddsa.encodingLength),\n S: sig.slice(eddsa.encodingLength),\n }),\n assert(sig.R && sig.S, \"Signature without R or S\"),\n eddsa.isPoint(sig.R) && (this._R = sig.R),\n sig.S instanceof BN && (this._S = sig.S),\n (this._Rencoded = Array.isArray(sig.R) ? sig.R : sig.Rencoded),\n (this._Sencoded = Array.isArray(sig.S) ? sig.S : sig.Sencoded);\n }\n cachedProperty(Signature, \"S\", function () {\n return this.eddsa.decodeInt(this.Sencoded());\n });\n cachedProperty(Signature, \"R\", function () {\n return this.eddsa.decodePoint(this.Rencoded());\n });\n cachedProperty(Signature, \"Rencoded\", function () {\n return this.eddsa.encodePoint(this.R());\n });\n cachedProperty(Signature, \"Sencoded\", function () {\n return this.eddsa.encodeInt(this.S());\n });\n Signature.prototype.toBytes = function () {\n return this.Rencoded().concat(this.Sencoded());\n };\n Signature.prototype.toHex = function () {\n return utils.encode(this.toBytes(), \"hex\").toUpperCase();\n };\n module.exports = Signature;\n },\n});\n\n// node_modules/elliptic/lib/elliptic/eddsa/index.js\nvar require_eddsa = __commonJS({\n \"node_modules/elliptic/lib/elliptic/eddsa/index.js\"(exports, module) {\n \"use strict\";\n var hash = require_hash2(),\n curves = require_curves(),\n utils = require_utils3(),\n assert = utils.assert,\n parseBytes = utils.parseBytes,\n KeyPair = require_key2(),\n Signature = require_signature2();\n function EDDSA(curve) {\n if ((assert(curve === \"ed25519\", \"only tested with ed25519 so far\"), !(this instanceof EDDSA)))\n return new EDDSA(curve);\n (curve = curves[curve].curve),\n (this.curve = curve),\n (this.g = curve.g),\n this.g.precompute(curve.n.bitLength() + 1),\n (this.pointClass = curve.point().constructor),\n (this.encodingLength = Math.ceil(curve.n.bitLength() / 8)),\n (this.hash = hash.sha512);\n }\n module.exports = EDDSA;\n EDDSA.prototype.sign = function (message, secret) {\n message = parseBytes(message);\n var key = this.keyFromSecret(secret),\n r = this.hashInt(key.messagePrefix(), message),\n R = this.g.mul(r),\n Rencoded = this.encodePoint(R),\n s_ = this.hashInt(Rencoded, key.pubBytes(), message).mul(key.priv()),\n S = r.add(s_).umod(this.curve.n);\n return this.makeSignature({ R, S, Rencoded });\n };\n EDDSA.prototype.verify = function (message, sig, pub) {\n (message = parseBytes(message)), (sig = this.makeSignature(sig));\n var key = this.keyFromPublic(pub),\n h = this.hashInt(sig.Rencoded(), key.pubBytes(), message),\n SG = this.g.mul(sig.S()),\n RplusAh = sig.R().add(key.pub().mul(h));\n return RplusAh.eq(SG);\n };\n EDDSA.prototype.hashInt = function () {\n for (var hash2 = this.hash(), i = 0; i < arguments.length; i++) hash2.update(arguments[i]);\n return utils.intFromLE(hash2.digest()).umod(this.curve.n);\n };\n EDDSA.prototype.keyFromPublic = function (pub) {\n return KeyPair.fromPublic(this, pub);\n };\n EDDSA.prototype.keyFromSecret = function (secret) {\n return KeyPair.fromSecret(this, secret);\n };\n EDDSA.prototype.makeSignature = function (sig) {\n return sig instanceof Signature ? sig : new Signature(this, sig);\n };\n EDDSA.prototype.encodePoint = function (point) {\n var enc = point.getY().toArray(\"le\", this.encodingLength);\n return (enc[this.encodingLength - 1] |= point.getX().isOdd() ? 128 : 0), enc;\n };\n EDDSA.prototype.decodePoint = function (bytes) {\n bytes = utils.parseBytes(bytes);\n var lastIx = bytes.length - 1,\n normed = bytes.slice(0, lastIx).concat(bytes[lastIx] & -129),\n xIsOdd = (bytes[lastIx] & 128) !== 0,\n y = utils.intFromLE(normed);\n return this.curve.pointFromY(y, xIsOdd);\n };\n EDDSA.prototype.encodeInt = function (num) {\n return num.toArray(\"le\", this.encodingLength);\n };\n EDDSA.prototype.decodeInt = function (bytes) {\n return utils.intFromLE(bytes);\n };\n EDDSA.prototype.isPoint = function (val) {\n return val instanceof this.pointClass;\n };\n },\n});\n\n// node_modules/elliptic/lib/elliptic.js\nvar require_elliptic = __commonJS({\n \"node_modules/elliptic/lib/elliptic.js\"(exports) {\n \"use strict\";\n var elliptic = exports;\n elliptic.version = require_package().version;\n elliptic.utils = require_utils3();\n elliptic.rand = require_brorand();\n elliptic.curve = require_curve();\n elliptic.curves = require_curves();\n elliptic.ec = require_ec();\n elliptic.eddsa = require_eddsa();\n },\n});\n\n// node_modules/asn1.js/node_modules/bn.js/lib/bn.js\nvar require_bn5 = __commonJS({\n \"node_modules/asn1.js/node_modules/bn.js/lib/bn.js\"(exports, module) {\n (function (module2, exports2) {\n \"use strict\";\n function assert(val, msg) {\n if (!val) throw new Error(msg || \"Assertion failed\");\n }\n function inherits(ctor, superCtor) {\n ctor.super_ = superCtor;\n var TempCtor = function () {};\n (TempCtor.prototype = superCtor.prototype),\n (ctor.prototype = new TempCtor()),\n (ctor.prototype.constructor = ctor);\n }\n function BN(number, base, endian) {\n if (BN.isBN(number)) return number;\n (this.negative = 0),\n (this.words = null),\n (this.length = 0),\n (this.red = null),\n number !== null &&\n ((base === \"le\" || base === \"be\") && ((endian = base), (base = 10)),\n this._init(number || 0, base || 10, endian || \"be\"));\n }\n typeof module2 == \"object\" ? (module2.exports = BN) : (exports2.BN = BN), (BN.BN = BN), (BN.wordSize = 26);\n var Buffer2;\n try {\n typeof window < \"u\" && typeof window.Buffer < \"u\"\n ? (Buffer2 = window.Buffer)\n : (Buffer2 = __require(\"buffer\").Buffer);\n } catch {}\n (BN.isBN = function (num) {\n return num instanceof BN\n ? !0\n : num !== null &&\n typeof num == \"object\" &&\n num.constructor.wordSize === BN.wordSize &&\n Array.isArray(num.words);\n }),\n (BN.max = function (left, right) {\n return left.cmp(right) > 0 ? left : right;\n }),\n (BN.min = function (left, right) {\n return left.cmp(right) < 0 ? left : right;\n }),\n (BN.prototype._init = function (number, base, endian) {\n if (typeof number == \"number\") return this._initNumber(number, base, endian);\n if (typeof number == \"object\") return this._initArray(number, base, endian);\n base === \"hex\" && (base = 16),\n assert(base === (base | 0) && base >= 2 && base <= 36),\n (number = number.toString().replace(/\\s+/g, \"\"));\n var start = 0;\n number[0] === \"-\" && (start++, (this.negative = 1)),\n start < number.length &&\n (base === 16\n ? this._parseHex(number, start, endian)\n : (this._parseBase(number, base, start),\n endian === \"le\" && this._initArray(this.toArray(), base, endian)));\n }),\n (BN.prototype._initNumber = function (number, base, endian) {\n number < 0 && ((this.negative = 1), (number = -number)),\n number < 67108864\n ? ((this.words = [number & 67108863]), (this.length = 1))\n : number < 4503599627370496\n ? ((this.words = [number & 67108863, (number / 67108864) & 67108863]), (this.length = 2))\n : (assert(number < 9007199254740992),\n (this.words = [number & 67108863, (number / 67108864) & 67108863, 1]),\n (this.length = 3)),\n endian === \"le\" && this._initArray(this.toArray(), base, endian);\n }),\n (BN.prototype._initArray = function (number, base, endian) {\n if ((assert(typeof number.length == \"number\"), number.length <= 0))\n return (this.words = [0]), (this.length = 1), this;\n (this.length = Math.ceil(number.length / 3)), (this.words = new Array(this.length));\n for (var i = 0; i < this.length; i++) this.words[i] = 0;\n var j,\n w,\n off = 0;\n if (endian === \"be\")\n for (i = number.length - 1, j = 0; i >= 0; i -= 3)\n (w = number[i] | (number[i - 1] << 8) | (number[i - 2] << 16)),\n (this.words[j] |= (w << off) & 67108863),\n (this.words[j + 1] = (w >>> (26 - off)) & 67108863),\n (off += 24),\n off >= 26 && ((off -= 26), j++);\n else if (endian === \"le\")\n for (i = 0, j = 0; i < number.length; i += 3)\n (w = number[i] | (number[i + 1] << 8) | (number[i + 2] << 16)),\n (this.words[j] |= (w << off) & 67108863),\n (this.words[j + 1] = (w >>> (26 - off)) & 67108863),\n (off += 24),\n off >= 26 && ((off -= 26), j++);\n return this.strip();\n });\n function parseHex4Bits(string, index) {\n var c = string.charCodeAt(index);\n return c >= 65 && c <= 70 ? c - 55 : c >= 97 && c <= 102 ? c - 87 : (c - 48) & 15;\n }\n function parseHexByte(string, lowerBound, index) {\n var r = parseHex4Bits(string, index);\n return index - 1 >= lowerBound && (r |= parseHex4Bits(string, index - 1) << 4), r;\n }\n BN.prototype._parseHex = function (number, start, endian) {\n (this.length = Math.ceil((number.length - start) / 6)), (this.words = new Array(this.length));\n for (var i = 0; i < this.length; i++) this.words[i] = 0;\n var off = 0,\n j = 0,\n w;\n if (endian === \"be\")\n for (i = number.length - 1; i >= start; i -= 2)\n (w = parseHexByte(number, start, i) << off),\n (this.words[j] |= w & 67108863),\n off >= 18 ? ((off -= 18), (j += 1), (this.words[j] |= w >>> 26)) : (off += 8);\n else {\n var parseLength = number.length - start;\n for (i = parseLength % 2 === 0 ? start + 1 : start; i < number.length; i += 2)\n (w = parseHexByte(number, start, i) << off),\n (this.words[j] |= w & 67108863),\n off >= 18 ? ((off -= 18), (j += 1), (this.words[j] |= w >>> 26)) : (off += 8);\n }\n this.strip();\n };\n function parseBase(str, start, end, mul) {\n for (var r = 0, len = Math.min(str.length, end), i = start; i < len; i++) {\n var c = str.charCodeAt(i) - 48;\n (r *= mul), c >= 49 ? (r += c - 49 + 10) : c >= 17 ? (r += c - 17 + 10) : (r += c);\n }\n return r;\n }\n (BN.prototype._parseBase = function (number, base, start) {\n (this.words = [0]), (this.length = 1);\n for (var limbLen = 0, limbPow = 1; limbPow <= 67108863; limbPow *= base) limbLen++;\n limbLen--, (limbPow = (limbPow / base) | 0);\n for (\n var total = number.length - start,\n mod = total % limbLen,\n end = Math.min(total, total - mod) + start,\n word = 0,\n i = start;\n i < end;\n i += limbLen\n )\n (word = parseBase(number, i, i + limbLen, base)),\n this.imuln(limbPow),\n this.words[0] + word < 67108864 ? (this.words[0] += word) : this._iaddn(word);\n if (mod !== 0) {\n var pow = 1;\n for (word = parseBase(number, i, number.length, base), i = 0; i < mod; i++) pow *= base;\n this.imuln(pow), this.words[0] + word < 67108864 ? (this.words[0] += word) : this._iaddn(word);\n }\n this.strip();\n }),\n (BN.prototype.copy = function (dest) {\n dest.words = new Array(this.length);\n for (var i = 0; i < this.length; i++) dest.words[i] = this.words[i];\n (dest.length = this.length), (dest.negative = this.negative), (dest.red = this.red);\n }),\n (BN.prototype.clone = function () {\n var r = new BN(null);\n return this.copy(r), r;\n }),\n (BN.prototype._expand = function (size) {\n for (; this.length < size; ) this.words[this.length++] = 0;\n return this;\n }),\n (BN.prototype.strip = function () {\n for (; this.length > 1 && this.words[this.length - 1] === 0; ) this.length--;\n return this._normSign();\n }),\n (BN.prototype._normSign = function () {\n return this.length === 1 && this.words[0] === 0 && (this.negative = 0), this;\n }),\n (BN.prototype.inspect = function () {\n return (this.red ? \"<BN-R: \" : \"<BN: \") + this.toString(16) + \">\";\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 groupSizes = [\n 0, 0, 25, 16, 12, 11, 10, 9, 8, 8, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5,\n 5, 5,\n ],\n groupBases = [\n 0, 0, 33554432, 43046721, 16777216, 48828125, 60466176, 40353607, 16777216, 43046721, 1e7, 19487171, 35831808,\n 62748517, 7529536, 11390625, 16777216, 24137569, 34012224, 47045881, 64e6, 4084101, 5153632, 6436343, 7962624,\n 9765625, 11881376, 14348907, 17210368, 20511149, 243e5, 28629151, 33554432, 39135393, 45435424, 52521875,\n 60466176,\n ];\n (BN.prototype.toString = function (base, padding) {\n (base = base || 10), (padding = padding | 0 || 1);\n var out;\n if (base === 16 || base === \"hex\") {\n out = \"\";\n for (var off = 0, carry = 0, i = 0; i < this.length; i++) {\n var w = this.words[i],\n word = (((w << off) | carry) & 16777215).toString(16);\n (carry = (w >>> (24 - off)) & 16777215),\n carry !== 0 || i !== this.length - 1 ? (out = zeros[6 - word.length] + word + out) : (out = word + out),\n (off += 2),\n off >= 26 && ((off -= 26), i--);\n }\n for (carry !== 0 && (out = carry.toString(16) + out); out.length % padding !== 0; ) out = \"0\" + out;\n return this.negative !== 0 && (out = \"-\" + out), out;\n }\n if (base === (base | 0) && base >= 2 && base <= 36) {\n var groupSize = groupSizes[base],\n groupBase = groupBases[base];\n out = \"\";\n var c = this.clone();\n for (c.negative = 0; !c.isZero(); ) {\n var r = c.modn(groupBase).toString(base);\n (c = c.idivn(groupBase)), c.isZero() ? (out = r + out) : (out = zeros[groupSize - r.length] + r + out);\n }\n for (this.isZero() && (out = \"0\" + out); out.length % padding !== 0; ) out = \"0\" + out;\n return this.negative !== 0 && (out = \"-\" + out), out;\n }\n assert(!1, \"Base should be between 2 and 36\");\n }),\n (BN.prototype.toNumber = function () {\n var ret = this.words[0];\n return (\n this.length === 2\n ? (ret += this.words[1] * 67108864)\n : this.length === 3 && this.words[2] === 1\n ? (ret += 4503599627370496 + this.words[1] * 67108864)\n : this.length > 2 && assert(!1, \"Number can only safely store up to 53 bits\"),\n this.negative !== 0 ? -ret : ret\n );\n }),\n (BN.prototype.toJSON = function () {\n return this.toString(16);\n }),\n (BN.prototype.toBuffer = function (endian, length) {\n return assert(typeof Buffer2 < \"u\"), this.toArrayLike(Buffer2, endian, length);\n }),\n (BN.prototype.toArray = function (endian, length) {\n return this.toArrayLike(Array, endian, length);\n }),\n (BN.prototype.toArrayLike = function (ArrayType, endian, length) {\n var byteLength = this.byteLength(),\n 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 this.strip();\n var littleEndian = endian === \"le\",\n res = new ArrayType(reqLength),\n b,\n i,\n q = this.clone();\n if (littleEndian) {\n for (i = 0; !q.isZero(); i++) (b = q.andln(255)), q.iushrn(8), (res[i] = b);\n for (; i < reqLength; i++) res[i] = 0;\n } else {\n for (i = 0; i < reqLength - byteLength; i++) res[i] = 0;\n for (i = 0; !q.isZero(); i++) (b = q.andln(255)), q.iushrn(8), (res[reqLength - i - 1] = b);\n }\n return res;\n }),\n Math.clz32\n ? (BN.prototype._countBits = function (w) {\n return 32 - Math.clz32(w);\n })\n : (BN.prototype._countBits = function (w) {\n var t = w,\n r = 0;\n return (\n t >= 4096 && ((r += 13), (t >>>= 13)),\n t >= 64 && ((r += 7), (t >>>= 7)),\n t >= 8 && ((r += 4), (t >>>= 4)),\n t >= 2 && ((r += 2), (t >>>= 2)),\n r + t\n );\n }),\n (BN.prototype._zeroBits = function (w) {\n if (w === 0) return 26;\n var t = w,\n r = 0;\n return (\n (t & 8191) === 0 && ((r += 13), (t >>>= 13)),\n (t & 127) === 0 && ((r += 7), (t >>>= 7)),\n (t & 15) === 0 && ((r += 4), (t >>>= 4)),\n (t & 3) === 0 && ((r += 2), (t >>>= 2)),\n (t & 1) === 0 && r++,\n r\n );\n }),\n (BN.prototype.bitLength = function () {\n var w = this.words[this.length - 1],\n hi = this._countBits(w);\n return (this.length - 1) * 26 + hi;\n });\n function toBitArray(num) {\n for (var w = new Array(num.bitLength()), bit = 0; bit < w.length; bit++) {\n var off = (bit / 26) | 0,\n wbit = bit % 26;\n w[bit] = (num.words[off] & (1 << wbit)) >>> wbit;\n }\n return w;\n }\n (BN.prototype.zeroBits = function () {\n if (this.isZero()) return 0;\n for (var r = 0, i = 0; i < this.length; i++) {\n var b = this._zeroBits(this.words[i]);\n if (((r += b), b !== 26)) break;\n }\n return r;\n }),\n (BN.prototype.byteLength = function () {\n return Math.ceil(this.bitLength() / 8);\n }),\n (BN.prototype.toTwos = function (width) {\n return this.negative !== 0 ? this.abs().inotn(width).iaddn(1) : this.clone();\n }),\n (BN.prototype.fromTwos = function (width) {\n return this.testn(width - 1) ? this.notn(width).iaddn(1).ineg() : this.clone();\n }),\n (BN.prototype.isNeg = function () {\n return this.negative !== 0;\n }),\n (BN.prototype.neg = function () {\n return this.clone().ineg();\n }),\n (BN.prototype.ineg = function () {\n return this.isZero() || (this.negative ^= 1), this;\n }),\n (BN.prototype.iuor = function (num) {\n for (; this.length < num.length; ) this.words[this.length++] = 0;\n for (var i = 0; i < num.length; i++) this.words[i] = this.words[i] | num.words[i];\n return this.strip();\n }),\n (BN.prototype.ior = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuor(num);\n }),\n (BN.prototype.or = function (num) {\n return this.length > num.length ? this.clone().ior(num) : num.clone().ior(this);\n }),\n (BN.prototype.uor = function (num) {\n return this.length > num.length ? this.clone().iuor(num) : num.clone().iuor(this);\n }),\n (BN.prototype.iuand = function (num) {\n var b;\n this.length > num.length ? (b = num) : (b = this);\n for (var i = 0; i < b.length; i++) this.words[i] = this.words[i] & num.words[i];\n return (this.length = b.length), this.strip();\n }),\n (BN.prototype.iand = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuand(num);\n }),\n (BN.prototype.and = function (num) {\n return this.length > num.length ? this.clone().iand(num) : num.clone().iand(this);\n }),\n (BN.prototype.uand = function (num) {\n return this.length > num.length ? this.clone().iuand(num) : num.clone().iuand(this);\n }),\n (BN.prototype.iuxor = function (num) {\n var a, b;\n this.length > num.length ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var i = 0; i < b.length; i++) this.words[i] = a.words[i] ^ b.words[i];\n if (this !== a) for (; i < a.length; i++) this.words[i] = a.words[i];\n return (this.length = a.length), this.strip();\n }),\n (BN.prototype.ixor = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuxor(num);\n }),\n (BN.prototype.xor = function (num) {\n return this.length > num.length ? this.clone().ixor(num) : num.clone().ixor(this);\n }),\n (BN.prototype.uxor = function (num) {\n return this.length > num.length ? this.clone().iuxor(num) : num.clone().iuxor(this);\n }),\n (BN.prototype.inotn = function (width) {\n assert(typeof width == \"number\" && width >= 0);\n var bytesNeeded = Math.ceil(width / 26) | 0,\n bitsLeft = width % 26;\n this._expand(bytesNeeded), bitsLeft > 0 && bytesNeeded--;\n for (var i = 0; i < bytesNeeded; i++) this.words[i] = ~this.words[i] & 67108863;\n return bitsLeft > 0 && (this.words[i] = ~this.words[i] & (67108863 >> (26 - bitsLeft))), this.strip();\n }),\n (BN.prototype.notn = function (width) {\n return this.clone().inotn(width);\n }),\n (BN.prototype.setn = function (bit, val) {\n assert(typeof bit == \"number\" && bit >= 0);\n var off = (bit / 26) | 0,\n wbit = bit % 26;\n return (\n this._expand(off + 1),\n val\n ? (this.words[off] = this.words[off] | (1 << wbit))\n : (this.words[off] = this.words[off] & ~(1 << wbit)),\n this.strip()\n );\n }),\n (BN.prototype.iadd = function (num) {\n var r;\n if (this.negative !== 0 && num.negative === 0)\n return (this.negative = 0), (r = this.isub(num)), (this.negative ^= 1), this._normSign();\n if (this.negative === 0 && num.negative !== 0)\n return (num.negative = 0), (r = this.isub(num)), (num.negative = 1), r._normSign();\n var a, b;\n this.length > num.length ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var carry = 0, i = 0; i < b.length; i++)\n (r = (a.words[i] | 0) + (b.words[i] | 0) + carry), (this.words[i] = r & 67108863), (carry = r >>> 26);\n for (; carry !== 0 && i < a.length; i++)\n (r = (a.words[i] | 0) + carry), (this.words[i] = r & 67108863), (carry = r >>> 26);\n if (((this.length = a.length), carry !== 0)) (this.words[this.length] = carry), this.length++;\n else if (a !== this) for (; i < a.length; i++) this.words[i] = a.words[i];\n return this;\n }),\n (BN.prototype.add = function (num) {\n var res;\n return num.negative !== 0 && this.negative === 0\n ? ((num.negative = 0), (res = this.sub(num)), (num.negative ^= 1), res)\n : num.negative === 0 && this.negative !== 0\n ? ((this.negative = 0), (res = num.sub(this)), (this.negative = 1), res)\n : this.length > num.length\n ? this.clone().iadd(num)\n : num.clone().iadd(this);\n }),\n (BN.prototype.isub = function (num) {\n if (num.negative !== 0) {\n num.negative = 0;\n var r = this.iadd(num);\n return (num.negative = 1), r._normSign();\n } else if (this.negative !== 0)\n return (this.negative = 0), this.iadd(num), (this.negative = 1), this._normSign();\n var cmp = this.cmp(num);\n if (cmp === 0) return (this.negative = 0), (this.length = 1), (this.words[0] = 0), this;\n var a, b;\n cmp > 0 ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var carry = 0, i = 0; i < b.length; i++)\n (r = (a.words[i] | 0) - (b.words[i] | 0) + carry), (carry = r >> 26), (this.words[i] = r & 67108863);\n for (; carry !== 0 && i < a.length; i++)\n (r = (a.words[i] | 0) + carry), (carry = r >> 26), (this.words[i] = r & 67108863);\n if (carry === 0 && i < a.length && a !== this) for (; i < a.length; i++) this.words[i] = a.words[i];\n return (this.length = Math.max(this.length, i)), a !== this && (this.negative = 1), this.strip();\n }),\n (BN.prototype.sub = function (num) {\n return this.clone().isub(num);\n });\n function smallMulTo(self2, num, out) {\n out.negative = num.negative ^ self2.negative;\n var len = (self2.length + num.length) | 0;\n (out.length = len), (len = (len - 1) | 0);\n var a = self2.words[0] | 0,\n b = num.words[0] | 0,\n r = a * b,\n lo = r & 67108863,\n carry = (r / 67108864) | 0;\n out.words[0] = lo;\n for (var k = 1; k < len; k++) {\n for (\n var ncarry = carry >>> 26,\n rword = carry & 67108863,\n maxJ = Math.min(k, num.length - 1),\n j = Math.max(0, k - self2.length + 1);\n j <= maxJ;\n j++\n ) {\n var i = (k - j) | 0;\n (a = self2.words[i] | 0),\n (b = num.words[j] | 0),\n (r = a * b + rword),\n (ncarry += (r / 67108864) | 0),\n (rword = r & 67108863);\n }\n (out.words[k] = rword | 0), (carry = ncarry | 0);\n }\n return carry !== 0 ? (out.words[k] = carry | 0) : out.length--, out.strip();\n }\n var comb10MulTo = function (self2, num, out) {\n var a = self2.words,\n b = num.words,\n o = out.words,\n c = 0,\n lo,\n mid,\n hi,\n a0 = a[0] | 0,\n al0 = a0 & 8191,\n ah0 = a0 >>> 13,\n a1 = a[1] | 0,\n al1 = a1 & 8191,\n ah1 = a1 >>> 13,\n a2 = a[2] | 0,\n al2 = a2 & 8191,\n ah2 = a2 >>> 13,\n a3 = a[3] | 0,\n al3 = a3 & 8191,\n ah3 = a3 >>> 13,\n a4 = a[4] | 0,\n al4 = a4 & 8191,\n ah4 = a4 >>> 13,\n a5 = a[5] | 0,\n al5 = a5 & 8191,\n ah5 = a5 >>> 13,\n a6 = a[6] | 0,\n al6 = a6 & 8191,\n ah6 = a6 >>> 13,\n a7 = a[7] | 0,\n al7 = a7 & 8191,\n ah7 = a7 >>> 13,\n a8 = a[8] | 0,\n al8 = a8 & 8191,\n ah8 = a8 >>> 13,\n a9 = a[9] | 0,\n al9 = a9 & 8191,\n ah9 = a9 >>> 13,\n b0 = b[0] | 0,\n bl0 = b0 & 8191,\n bh0 = b0 >>> 13,\n b1 = b[1] | 0,\n bl1 = b1 & 8191,\n bh1 = b1 >>> 13,\n b2 = b[2] | 0,\n bl2 = b2 & 8191,\n bh2 = b2 >>> 13,\n b3 = b[3] | 0,\n bl3 = b3 & 8191,\n bh3 = b3 >>> 13,\n b4 = b[4] | 0,\n bl4 = b4 & 8191,\n bh4 = b4 >>> 13,\n b5 = b[5] | 0,\n bl5 = b5 & 8191,\n bh5 = b5 >>> 13,\n b6 = b[6] | 0,\n bl6 = b6 & 8191,\n bh6 = b6 >>> 13,\n b7 = b[7] | 0,\n bl7 = b7 & 8191,\n bh7 = b7 >>> 13,\n b8 = b[8] | 0,\n bl8 = b8 & 8191,\n bh8 = b8 >>> 13,\n b9 = b[9] | 0,\n bl9 = b9 & 8191,\n bh9 = b9 >>> 13;\n (out.negative = self2.negative ^ num.negative),\n (out.length = 19),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w0 >>> 26)) | 0),\n (w0 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w1 >>> 26)) | 0),\n (w1 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w2 >>> 26)) | 0),\n (w2 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w3 >>> 26)) | 0),\n (w3 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w4 >>> 26)) | 0),\n (w4 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w5 >>> 26)) | 0),\n (w5 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w6 >>> 26)) | 0),\n (w6 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w7 >>> 26)) | 0),\n (w7 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w8 >>> 26)) | 0),\n (w8 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w9 >>> 26)) | 0),\n (w9 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w10 >>> 26)) | 0),\n (w10 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w11 >>> 26)) | 0),\n (w11 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w12 >>> 26)) | 0),\n (w12 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w13 >>> 26)) | 0),\n (w13 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w14 >>> 26)) | 0),\n (w14 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w15 >>> 26)) | 0),\n (w15 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w16 >>> 26)) | 0),\n (w16 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w17 >>> 26)) | 0),\n (w17 &= 67108863),\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 & 8191) << 13)) | 0;\n return (\n (c = (((hi + (mid >>> 13)) | 0) + (w18 >>> 26)) | 0),\n (w18 &= 67108863),\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 c !== 0 && ((o[19] = c), out.length++),\n out\n );\n };\n Math.imul || (comb10MulTo = smallMulTo);\n function bigMulTo(self2, num, out) {\n (out.negative = num.negative ^ self2.negative), (out.length = self2.length + num.length);\n for (var carry = 0, hncarry = 0, k = 0; k < out.length - 1; k++) {\n var ncarry = hncarry;\n hncarry = 0;\n for (\n var rword = carry & 67108863, maxJ = Math.min(k, num.length - 1), j = Math.max(0, k - self2.length + 1);\n j <= maxJ;\n j++\n ) {\n var i = k - j,\n a = self2.words[i] | 0,\n b = num.words[j] | 0,\n r = a * b,\n lo = r & 67108863;\n (ncarry = (ncarry + ((r / 67108864) | 0)) | 0),\n (lo = (lo + rword) | 0),\n (rword = lo & 67108863),\n (ncarry = (ncarry + (lo >>> 26)) | 0),\n (hncarry += ncarry >>> 26),\n (ncarry &= 67108863);\n }\n (out.words[k] = rword), (carry = ncarry), (ncarry = hncarry);\n }\n return carry !== 0 ? (out.words[k] = carry) : out.length--, out.strip();\n }\n function jumboMulTo(self2, num, out) {\n var fftm = new FFTM();\n return fftm.mulp(self2, num, out);\n }\n BN.prototype.mulTo = function (num, out) {\n var res,\n len = this.length + num.length;\n return (\n this.length === 10 && num.length === 10\n ? (res = comb10MulTo(this, num, out))\n : len < 63\n ? (res = smallMulTo(this, num, out))\n : len < 1024\n ? (res = bigMulTo(this, num, out))\n : (res = jumboMulTo(this, num, out)),\n res\n );\n };\n function FFTM(x, y) {\n (this.x = x), (this.y = y);\n }\n (FFTM.prototype.makeRBT = function (N) {\n for (var t = new Array(N), l = BN.prototype._countBits(N) - 1, i = 0; i < N; i++) t[i] = this.revBin(i, l, N);\n return t;\n }),\n (FFTM.prototype.revBin = function (x, l, N) {\n if (x === 0 || x === N - 1) return x;\n for (var rb = 0, i = 0; i < l; i++) (rb |= (x & 1) << (l - i - 1)), (x >>= 1);\n return rb;\n }),\n (FFTM.prototype.permute = function (rbt, rws, iws, rtws, itws, N) {\n for (var i = 0; i < N; i++) (rtws[i] = rws[rbt[i]]), (itws[i] = iws[rbt[i]]);\n }),\n (FFTM.prototype.transform = function (rws, iws, rtws, itws, N, rbt) {\n this.permute(rbt, rws, iws, rtws, itws, N);\n for (var s = 1; s < N; s <<= 1)\n for (\n var l = s << 1, rtwdf = Math.cos((2 * Math.PI) / l), itwdf = Math.sin((2 * Math.PI) / l), p = 0;\n p < N;\n p += l\n )\n for (var rtwdf_ = rtwdf, itwdf_ = itwdf, j = 0; j < s; j++) {\n var re = rtws[p + j],\n ie = itws[p + j],\n ro = rtws[p + j + s],\n io = itws[p + j + s],\n rx = rtwdf_ * ro - itwdf_ * io;\n (io = rtwdf_ * io + itwdf_ * ro),\n (ro = rx),\n (rtws[p + j] = re + ro),\n (itws[p + j] = ie + io),\n (rtws[p + j + s] = re - ro),\n (itws[p + j + s] = ie - io),\n j !== l &&\n ((rx = rtwdf * rtwdf_ - itwdf * itwdf_), (itwdf_ = rtwdf * itwdf_ + itwdf * rtwdf_), (rtwdf_ = rx));\n }\n }),\n (FFTM.prototype.guessLen13b = function (n, m) {\n var N = Math.max(m, n) | 1,\n odd = N & 1,\n i = 0;\n for (N = (N / 2) | 0; N; N = N >>> 1) i++;\n return 1 << (i + 1 + odd);\n }),\n (FFTM.prototype.conjugate = function (rws, iws, N) {\n if (!(N <= 1))\n for (var i = 0; i < N / 2; i++) {\n var t = rws[i];\n (rws[i] = rws[N - i - 1]),\n (rws[N - i - 1] = t),\n (t = iws[i]),\n (iws[i] = -iws[N - i - 1]),\n (iws[N - i - 1] = -t);\n }\n }),\n (FFTM.prototype.normalize13b = function (ws, N) {\n for (var carry = 0, i = 0; i < N / 2; i++) {\n var w = Math.round(ws[2 * i + 1] / N) * 8192 + Math.round(ws[2 * i] / N) + carry;\n (ws[i] = w & 67108863), w < 67108864 ? (carry = 0) : (carry = (w / 67108864) | 0);\n }\n return ws;\n }),\n (FFTM.prototype.convert13b = function (ws, len, rws, N) {\n for (var carry = 0, i = 0; i < len; i++)\n (carry = carry + (ws[i] | 0)),\n (rws[2 * i] = carry & 8191),\n (carry = carry >>> 13),\n (rws[2 * i + 1] = carry & 8191),\n (carry = carry >>> 13);\n for (i = 2 * len; i < N; ++i) rws[i] = 0;\n assert(carry === 0), assert((carry & -8192) === 0);\n }),\n (FFTM.prototype.stub = function (N) {\n for (var ph = new Array(N), i = 0; i < N; i++) ph[i] = 0;\n return ph;\n }),\n (FFTM.prototype.mulp = function (x, y, out) {\n var N = 2 * this.guessLen13b(x.length, y.length),\n rbt = this.makeRBT(N),\n _ = this.stub(N),\n rws = new Array(N),\n rwst = new Array(N),\n iwst = new Array(N),\n nrws = new Array(N),\n nrwst = new Array(N),\n niwst = new Array(N),\n rmws = out.words;\n (rmws.length = N),\n this.convert13b(x.words, x.length, rws, N),\n this.convert13b(y.words, y.length, nrws, N),\n this.transform(rws, _, rwst, iwst, N, rbt),\n this.transform(nrws, _, nrwst, niwst, N, rbt);\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]), (rwst[i] = rx);\n }\n return (\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 (out.negative = x.negative ^ y.negative),\n (out.length = x.length + y.length),\n out.strip()\n );\n }),\n (BN.prototype.mul = function (num) {\n var out = new BN(null);\n return (out.words = new Array(this.length + num.length)), this.mulTo(num, out);\n }),\n (BN.prototype.mulf = function (num) {\n var out = new BN(null);\n return (out.words = new Array(this.length + num.length)), jumboMulTo(this, num, out);\n }),\n (BN.prototype.imul = function (num) {\n return this.clone().mulTo(num, this);\n }),\n (BN.prototype.imuln = function (num) {\n assert(typeof num == \"number\"), assert(num < 67108864);\n for (var carry = 0, i = 0; i < this.length; i++) {\n var w = (this.words[i] | 0) * num,\n lo = (w & 67108863) + (carry & 67108863);\n (carry >>= 26), (carry += (w / 67108864) | 0), (carry += lo >>> 26), (this.words[i] = lo & 67108863);\n }\n return carry !== 0 && ((this.words[i] = carry), this.length++), this;\n }),\n (BN.prototype.muln = function (num) {\n return this.clone().imuln(num);\n }),\n (BN.prototype.sqr = function () {\n return this.mul(this);\n }),\n (BN.prototype.isqr = function () {\n return this.imul(this.clone());\n }),\n (BN.prototype.pow = function (num) {\n var w = toBitArray(num);\n if (w.length === 0) return new BN(1);\n for (var res = this, i = 0; i < w.length && w[i] === 0; i++, res = res.sqr());\n if (++i < w.length) for (var q = res.sqr(); i < w.length; i++, q = q.sqr()) w[i] !== 0 && (res = res.mul(q));\n return res;\n }),\n (BN.prototype.iushln = function (bits) {\n assert(typeof bits == \"number\" && bits >= 0);\n var r = bits % 26,\n s = (bits - r) / 26,\n carryMask = (67108863 >>> (26 - r)) << (26 - r),\n i;\n if (r !== 0) {\n var carry = 0;\n for (i = 0; i < this.length; i++) {\n var newCarry = this.words[i] & carryMask,\n c = ((this.words[i] | 0) - newCarry) << r;\n (this.words[i] = c | carry), (carry = newCarry >>> (26 - r));\n }\n carry && ((this.words[i] = carry), this.length++);\n }\n if (s !== 0) {\n for (i = this.length - 1; i >= 0; i--) this.words[i + s] = this.words[i];\n for (i = 0; i < s; i++) this.words[i] = 0;\n this.length += s;\n }\n return this.strip();\n }),\n (BN.prototype.ishln = function (bits) {\n return assert(this.negative === 0), this.iushln(bits);\n }),\n (BN.prototype.iushrn = function (bits, hint, extended) {\n assert(typeof bits == \"number\" && bits >= 0);\n var h;\n hint ? (h = (hint - (hint % 26)) / 26) : (h = 0);\n var r = bits % 26,\n s = Math.min((bits - r) / 26, this.length),\n mask = 67108863 ^ ((67108863 >>> r) << r),\n maskedWords = extended;\n if (((h -= s), (h = Math.max(0, h)), maskedWords)) {\n for (var i = 0; i < s; i++) maskedWords.words[i] = this.words[i];\n maskedWords.length = s;\n }\n if (s !== 0)\n if (this.length > s) for (this.length -= s, i = 0; i < this.length; i++) this.words[i] = this.words[i + s];\n else (this.words[0] = 0), (this.length = 1);\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)), (carry = word & mask);\n }\n return (\n maskedWords && carry !== 0 && (maskedWords.words[maskedWords.length++] = carry),\n this.length === 0 && ((this.words[0] = 0), (this.length = 1)),\n this.strip()\n );\n }),\n (BN.prototype.ishrn = function (bits, hint, extended) {\n return assert(this.negative === 0), this.iushrn(bits, hint, extended);\n }),\n (BN.prototype.shln = function (bits) {\n return this.clone().ishln(bits);\n }),\n (BN.prototype.ushln = function (bits) {\n return this.clone().iushln(bits);\n }),\n (BN.prototype.shrn = function (bits) {\n return this.clone().ishrn(bits);\n }),\n (BN.prototype.ushrn = function (bits) {\n return this.clone().iushrn(bits);\n }),\n (BN.prototype.testn = function (bit) {\n assert(typeof bit == \"number\" && bit >= 0);\n var r = bit % 26,\n s = (bit - r) / 26,\n q = 1 << r;\n if (this.length <= s) return !1;\n var w = this.words[s];\n return !!(w & q);\n }),\n (BN.prototype.imaskn = function (bits) {\n assert(typeof bits == \"number\" && bits >= 0);\n var r = bits % 26,\n s = (bits - r) / 26;\n if ((assert(this.negative === 0, \"imaskn works only with positive numbers\"), this.length <= s)) return this;\n if ((r !== 0 && s++, (this.length = Math.min(s, this.length)), r !== 0)) {\n var mask = 67108863 ^ ((67108863 >>> r) << r);\n this.words[this.length - 1] &= mask;\n }\n return this.strip();\n }),\n (BN.prototype.maskn = function (bits) {\n return this.clone().imaskn(bits);\n }),\n (BN.prototype.iaddn = function (num) {\n return (\n assert(typeof num == \"number\"),\n assert(num < 67108864),\n num < 0\n ? this.isubn(-num)\n : this.negative !== 0\n ? this.length === 1 && (this.words[0] | 0) < num\n ? ((this.words[0] = num - (this.words[0] | 0)), (this.negative = 0), this)\n : ((this.negative = 0), this.isubn(num), (this.negative = 1), this)\n : this._iaddn(num)\n );\n }),\n (BN.prototype._iaddn = function (num) {\n this.words[0] += num;\n for (var i = 0; i < this.length && this.words[i] >= 67108864; i++)\n (this.words[i] -= 67108864), i === this.length - 1 ? (this.words[i + 1] = 1) : this.words[i + 1]++;\n return (this.length = Math.max(this.length, i + 1)), this;\n }),\n (BN.prototype.isubn = function (num) {\n if ((assert(typeof num == \"number\"), assert(num < 67108864), num < 0)) return this.iaddn(-num);\n if (this.negative !== 0) return (this.negative = 0), this.iaddn(num), (this.negative = 1), this;\n if (((this.words[0] -= num), this.length === 1 && this.words[0] < 0))\n (this.words[0] = -this.words[0]), (this.negative = 1);\n else\n for (var i = 0; i < this.length && this.words[i] < 0; i++)\n (this.words[i] += 67108864), (this.words[i + 1] -= 1);\n return this.strip();\n }),\n (BN.prototype.addn = function (num) {\n return this.clone().iaddn(num);\n }),\n (BN.prototype.subn = function (num) {\n return this.clone().isubn(num);\n }),\n (BN.prototype.iabs = function () {\n return (this.negative = 0), this;\n }),\n (BN.prototype.abs = function () {\n return this.clone().iabs();\n }),\n (BN.prototype._ishlnsubmul = function (num, mul, shift) {\n var len = num.length + shift,\n i;\n this._expand(len);\n var w,\n 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 & 67108863),\n (carry = (w >> 26) - ((right / 67108864) | 0)),\n (this.words[i + shift] = w & 67108863);\n }\n for (; i < this.length - shift; i++)\n (w = (this.words[i + shift] | 0) + carry), (carry = w >> 26), (this.words[i + shift] = w & 67108863);\n if (carry === 0) return this.strip();\n for (assert(carry === -1), carry = 0, i = 0; i < this.length; i++)\n (w = -(this.words[i] | 0) + carry), (carry = w >> 26), (this.words[i] = w & 67108863);\n return (this.negative = 1), this.strip();\n }),\n (BN.prototype._wordDiv = function (num, mode) {\n var shift = this.length - num.length,\n a = this.clone(),\n b = num,\n bhi = b.words[b.length - 1] | 0,\n bhiBits = this._countBits(bhi);\n (shift = 26 - bhiBits),\n shift !== 0 && ((b = b.ushln(shift)), a.iushln(shift), (bhi = b.words[b.length - 1] | 0));\n var m = a.length - b.length,\n q;\n if (mode !== \"mod\") {\n (q = new BN(null)), (q.length = m + 1), (q.words = new Array(q.length));\n for (var i = 0; i < q.length; i++) q.words[i] = 0;\n }\n var diff = a.clone()._ishlnsubmul(b, 1, m);\n diff.negative === 0 && ((a = diff), q && (q.words[m] = 1));\n for (var j = m - 1; j >= 0; j--) {\n var qj = (a.words[b.length + j] | 0) * 67108864 + (a.words[b.length + j - 1] | 0);\n for (qj = Math.min((qj / bhi) | 0, 67108863), a._ishlnsubmul(b, qj, j); a.negative !== 0; )\n qj--, (a.negative = 0), a._ishlnsubmul(b, 1, j), a.isZero() || (a.negative ^= 1);\n q && (q.words[j] = qj);\n }\n return (\n q && q.strip(),\n a.strip(),\n mode !== \"div\" && shift !== 0 && a.iushrn(shift),\n {\n div: q || null,\n mod: a,\n }\n );\n }),\n (BN.prototype.divmod = function (num, mode, positive) {\n if ((assert(!num.isZero()), this.isZero()))\n return {\n div: new BN(0),\n mod: new BN(0),\n };\n var div, mod, res;\n return this.negative !== 0 && num.negative === 0\n ? ((res = this.neg().divmod(num, mode)),\n mode !== \"mod\" && (div = res.div.neg()),\n mode !== \"div\" && ((mod = res.mod.neg()), positive && mod.negative !== 0 && mod.iadd(num)),\n {\n div,\n mod,\n })\n : this.negative === 0 && num.negative !== 0\n ? ((res = this.divmod(num.neg(), mode)),\n mode !== \"mod\" && (div = res.div.neg()),\n {\n div,\n mod: res.mod,\n })\n : (this.negative & num.negative) !== 0\n ? ((res = this.neg().divmod(num.neg(), mode)),\n mode !== \"div\" && ((mod = res.mod.neg()), positive && mod.negative !== 0 && mod.isub(num)),\n {\n div: res.div,\n mod,\n })\n : num.length > this.length || this.cmp(num) < 0\n ? {\n div: new BN(0),\n mod: this,\n }\n : num.length === 1\n ? mode === \"div\"\n ? {\n div: this.divn(num.words[0]),\n mod: null,\n }\n : mode === \"mod\"\n ? {\n div: null,\n mod: new BN(this.modn(num.words[0])),\n }\n : {\n div: this.divn(num.words[0]),\n mod: new BN(this.modn(num.words[0])),\n }\n : this._wordDiv(num, mode);\n }),\n (BN.prototype.div = function (num) {\n return this.divmod(num, \"div\", !1).div;\n }),\n (BN.prototype.mod = function (num) {\n return this.divmod(num, \"mod\", !1).mod;\n }),\n (BN.prototype.umod = function (num) {\n return this.divmod(num, \"mod\", !0).mod;\n }),\n (BN.prototype.divRound = function (num) {\n var dm = this.divmod(num);\n if (dm.mod.isZero()) return dm.div;\n var mod = dm.div.negative !== 0 ? dm.mod.isub(num) : dm.mod,\n half = num.ushrn(1),\n r2 = num.andln(1),\n cmp = mod.cmp(half);\n return cmp < 0 || (r2 === 1 && cmp === 0)\n ? dm.div\n : dm.div.negative !== 0\n ? dm.div.isubn(1)\n : dm.div.iaddn(1);\n }),\n (BN.prototype.modn = function (num) {\n assert(num <= 67108863);\n for (var p = (1 << 26) % num, acc = 0, i = this.length - 1; i >= 0; i--)\n acc = (p * acc + (this.words[i] | 0)) % num;\n return acc;\n }),\n (BN.prototype.idivn = function (num) {\n assert(num <= 67108863);\n for (var carry = 0, i = this.length - 1; i >= 0; i--) {\n var w = (this.words[i] | 0) + carry * 67108864;\n (this.words[i] = (w / num) | 0), (carry = w % num);\n }\n return this.strip();\n }),\n (BN.prototype.divn = function (num) {\n return this.clone().idivn(num);\n }),\n (BN.prototype.egcd = function (p) {\n assert(p.negative === 0), assert(!p.isZero());\n var x = this,\n y = p.clone();\n x.negative !== 0 ? (x = x.umod(p)) : (x = x.clone());\n for (var A = new BN(1), B = new BN(0), C = new BN(0), D = new BN(1), g = 0; x.isEven() && y.isEven(); )\n x.iushrn(1), y.iushrn(1), ++g;\n for (var yp = y.clone(), xp = x.clone(); !x.isZero(); ) {\n for (var i = 0, im = 1; (x.words[0] & im) === 0 && i < 26; ++i, im <<= 1);\n if (i > 0)\n for (x.iushrn(i); i-- > 0; )\n (A.isOdd() || B.isOdd()) && (A.iadd(yp), B.isub(xp)), A.iushrn(1), B.iushrn(1);\n for (var j = 0, jm = 1; (y.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n if (j > 0)\n for (y.iushrn(j); j-- > 0; )\n (C.isOdd() || D.isOdd()) && (C.iadd(yp), D.isub(xp)), C.iushrn(1), D.iushrn(1);\n x.cmp(y) >= 0 ? (x.isub(y), A.isub(C), B.isub(D)) : (y.isub(x), C.isub(A), D.isub(B));\n }\n return {\n a: C,\n b: D,\n gcd: y.iushln(g),\n };\n }),\n (BN.prototype._invmp = function (p) {\n assert(p.negative === 0), assert(!p.isZero());\n var a = this,\n b = p.clone();\n a.negative !== 0 ? (a = a.umod(p)) : (a = a.clone());\n for (var x1 = new BN(1), x2 = new BN(0), delta = b.clone(); 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) for (a.iushrn(i); i-- > 0; ) x1.isOdd() && x1.iadd(delta), x1.iushrn(1);\n for (var j = 0, jm = 1; (b.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n if (j > 0) for (b.iushrn(j); j-- > 0; ) x2.isOdd() && x2.iadd(delta), x2.iushrn(1);\n a.cmp(b) >= 0 ? (a.isub(b), x1.isub(x2)) : (b.isub(a), x2.isub(x1));\n }\n var res;\n return a.cmpn(1) === 0 ? (res = x1) : (res = x2), res.cmpn(0) < 0 && res.iadd(p), res;\n }),\n (BN.prototype.gcd = function (num) {\n if (this.isZero()) return num.abs();\n if (num.isZero()) return this.abs();\n var a = this.clone(),\n b = num.clone();\n (a.negative = 0), (b.negative = 0);\n for (var shift = 0; a.isEven() && b.isEven(); shift++) a.iushrn(1), b.iushrn(1);\n do {\n for (; a.isEven(); ) a.iushrn(1);\n for (; b.isEven(); ) b.iushrn(1);\n var r = a.cmp(b);\n if (r < 0) {\n var t = a;\n (a = b), (b = t);\n } else if (r === 0 || b.cmpn(1) === 0) break;\n a.isub(b);\n } while (!0);\n return b.iushln(shift);\n }),\n (BN.prototype.invm = function (num) {\n return this.egcd(num).a.umod(num);\n }),\n (BN.prototype.isEven = function () {\n return (this.words[0] & 1) === 0;\n }),\n (BN.prototype.isOdd = function () {\n return (this.words[0] & 1) === 1;\n }),\n (BN.prototype.andln = function (num) {\n return this.words[0] & num;\n }),\n (BN.prototype.bincn = function (bit) {\n assert(typeof bit == \"number\");\n var r = bit % 26,\n s = (bit - r) / 26,\n q = 1 << r;\n if (this.length <= s) return this._expand(s + 1), (this.words[s] |= q), this;\n for (var carry = q, i = s; carry !== 0 && i < this.length; i++) {\n var w = this.words[i] | 0;\n (w += carry), (carry = w >>> 26), (w &= 67108863), (this.words[i] = w);\n }\n return carry !== 0 && ((this.words[i] = carry), this.length++), this;\n }),\n (BN.prototype.isZero = function () {\n return this.length === 1 && this.words[0] === 0;\n }),\n (BN.prototype.cmpn = function (num) {\n var negative = num < 0;\n if (this.negative !== 0 && !negative) return -1;\n if (this.negative === 0 && negative) return 1;\n this.strip();\n var res;\n if (this.length > 1) res = 1;\n else {\n negative && (num = -num), assert(num <= 67108863, \"Number is too big\");\n var w = this.words[0] | 0;\n res = w === num ? 0 : w < num ? -1 : 1;\n }\n return this.negative !== 0 ? -res | 0 : res;\n }),\n (BN.prototype.cmp = function (num) {\n if (this.negative !== 0 && num.negative === 0) return -1;\n if (this.negative === 0 && num.negative !== 0) return 1;\n var res = this.ucmp(num);\n return this.negative !== 0 ? -res | 0 : res;\n }),\n (BN.prototype.ucmp = function (num) {\n if (this.length > num.length) return 1;\n if (this.length < num.length) return -1;\n for (var res = 0, i = this.length - 1; i >= 0; i--) {\n var a = this.words[i] | 0,\n b = num.words[i] | 0;\n if (a !== b) {\n a < b ? (res = -1) : a > b && (res = 1);\n break;\n }\n }\n return res;\n }),\n (BN.prototype.gtn = function (num) {\n return this.cmpn(num) === 1;\n }),\n (BN.prototype.gt = function (num) {\n return this.cmp(num) === 1;\n }),\n (BN.prototype.gten = function (num) {\n return this.cmpn(num) >= 0;\n }),\n (BN.prototype.gte = function (num) {\n return this.cmp(num) >= 0;\n }),\n (BN.prototype.ltn = function (num) {\n return this.cmpn(num) === -1;\n }),\n (BN.prototype.lt = function (num) {\n return this.cmp(num) === -1;\n }),\n (BN.prototype.lten = function (num) {\n return this.cmpn(num) <= 0;\n }),\n (BN.prototype.lte = function (num) {\n return this.cmp(num) <= 0;\n }),\n (BN.prototype.eqn = function (num) {\n return this.cmpn(num) === 0;\n }),\n (BN.prototype.eq = function (num) {\n return this.cmp(num) === 0;\n }),\n (BN.red = function (num) {\n return new Red(num);\n }),\n (BN.prototype.toRed = function (ctx) {\n return (\n assert(!this.red, \"Already a number in reduction context\"),\n assert(this.negative === 0, \"red works only with positives\"),\n ctx.convertTo(this)._forceRed(ctx)\n );\n }),\n (BN.prototype.fromRed = function () {\n return assert(this.red, \"fromRed works only with numbers in reduction context\"), this.red.convertFrom(this);\n }),\n (BN.prototype._forceRed = function (ctx) {\n return (this.red = ctx), this;\n }),\n (BN.prototype.forceRed = function (ctx) {\n return assert(!this.red, \"Already a number in reduction context\"), this._forceRed(ctx);\n }),\n (BN.prototype.redAdd = function (num) {\n return assert(this.red, \"redAdd works only with red numbers\"), this.red.add(this, num);\n }),\n (BN.prototype.redIAdd = function (num) {\n return assert(this.red, \"redIAdd works only with red numbers\"), this.red.iadd(this, num);\n }),\n (BN.prototype.redSub = function (num) {\n return assert(this.red, \"redSub works only with red numbers\"), this.red.sub(this, num);\n }),\n (BN.prototype.redISub = function (num) {\n return assert(this.red, \"redISub works only with red numbers\"), this.red.isub(this, num);\n }),\n (BN.prototype.redShl = function (num) {\n return assert(this.red, \"redShl works only with red numbers\"), this.red.shl(this, num);\n }),\n (BN.prototype.redMul = function (num) {\n return (\n assert(this.red, \"redMul works only with red numbers\"),\n this.red._verify2(this, num),\n this.red.mul(this, num)\n );\n }),\n (BN.prototype.redIMul = function (num) {\n return (\n assert(this.red, \"redMul works only with red numbers\"),\n this.red._verify2(this, num),\n this.red.imul(this, num)\n );\n }),\n (BN.prototype.redSqr = function () {\n return assert(this.red, \"redSqr works only with red numbers\"), this.red._verify1(this), this.red.sqr(this);\n }),\n (BN.prototype.redISqr = function () {\n return assert(this.red, \"redISqr works only with red numbers\"), this.red._verify1(this), this.red.isqr(this);\n }),\n (BN.prototype.redSqrt = function () {\n return assert(this.red, \"redSqrt works only with red numbers\"), this.red._verify1(this), this.red.sqrt(this);\n }),\n (BN.prototype.redInvm = function () {\n return assert(this.red, \"redInvm works only with red numbers\"), this.red._verify1(this), this.red.invm(this);\n }),\n (BN.prototype.redNeg = function () {\n return assert(this.red, \"redNeg works only with red numbers\"), this.red._verify1(this), this.red.neg(this);\n }),\n (BN.prototype.redPow = function (num) {\n return assert(this.red && !num.red, \"redPow(normalNum)\"), this.red._verify1(this), this.red.pow(this, num);\n });\n var primes = {\n k256: null,\n p224: null,\n p192: null,\n p25519: null,\n };\n function MPrime(name, p) {\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 (this.tmp = this._tmp());\n }\n (MPrime.prototype._tmp = function () {\n var tmp = new BN(null);\n return (tmp.words = new Array(Math.ceil(this.n / 13))), tmp;\n }),\n (MPrime.prototype.ireduce = function (num) {\n var r = num,\n rlen;\n do this.split(r, this.tmp), (r = this.imulK(r)), (r = r.iadd(this.tmp)), (rlen = r.bitLength());\n while (rlen > this.n);\n var cmp = rlen < this.n ? -1 : r.ucmp(this.p);\n return (\n cmp === 0\n ? ((r.words[0] = 0), (r.length = 1))\n : cmp > 0\n ? r.isub(this.p)\n : r.strip !== void 0\n ? r.strip()\n : r._strip(),\n r\n );\n }),\n (MPrime.prototype.split = function (input, out) {\n input.iushrn(this.n, 0, out);\n }),\n (MPrime.prototype.imulK = function (num) {\n return num.imul(this.k);\n });\n function K256() {\n MPrime.call(this, \"k256\", \"ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f\");\n }\n inherits(K256, MPrime),\n (K256.prototype.split = function (input, output) {\n for (var mask = 4194303, outLen = Math.min(input.length, 9), i = 0; i < outLen; i++)\n output.words[i] = input.words[i];\n if (((output.length = outLen), input.length <= 9)) {\n (input.words[0] = 0), (input.length = 1);\n return;\n }\n var prev = input.words[9];\n for (output.words[output.length++] = prev & mask, i = 10; i < input.length; i++) {\n var next = input.words[i] | 0;\n (input.words[i - 10] = ((next & mask) << 4) | (prev >>> 22)), (prev = next);\n }\n (prev >>>= 22),\n (input.words[i - 10] = prev),\n prev === 0 && input.length > 10 ? (input.length -= 10) : (input.length -= 9);\n }),\n (K256.prototype.imulK = function (num) {\n (num.words[num.length] = 0), (num.words[num.length + 1] = 0), (num.length += 2);\n for (var lo = 0, i = 0; i < num.length; i++) {\n var w = num.words[i] | 0;\n (lo += w * 977), (num.words[i] = lo & 67108863), (lo = w * 64 + ((lo / 67108864) | 0));\n }\n return (\n num.words[num.length - 1] === 0 && (num.length--, num.words[num.length - 1] === 0 && num.length--), num\n );\n });\n function P224() {\n MPrime.call(this, \"p224\", \"ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001\");\n }\n inherits(P224, MPrime);\n function P192() {\n MPrime.call(this, \"p192\", \"ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff\");\n }\n inherits(P192, MPrime);\n function P25519() {\n MPrime.call(this, \"25519\", \"7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed\");\n }\n inherits(P25519, MPrime),\n (P25519.prototype.imulK = function (num) {\n for (var carry = 0, i = 0; i < num.length; i++) {\n var hi = (num.words[i] | 0) * 19 + carry,\n lo = hi & 67108863;\n (hi >>>= 26), (num.words[i] = lo), (carry = hi);\n }\n return carry !== 0 && (num.words[num.length++] = carry), num;\n }),\n (BN._prime = function (name) {\n if (primes[name]) return primes[name];\n var prime2;\n if (name === \"k256\") prime2 = new K256();\n else if (name === \"p224\") prime2 = new P224();\n else if (name === \"p192\") prime2 = new P192();\n else if (name === \"p25519\") prime2 = new P25519();\n else throw new Error(\"Unknown prime \" + name);\n return (primes[name] = prime2), prime2;\n });\n function Red(m) {\n if (typeof m == \"string\") {\n var prime = BN._prime(m);\n (this.m = prime.p), (this.prime = prime);\n } else assert(m.gtn(1), \"modulus must be greater than 1\"), (this.m = m), (this.prime = null);\n }\n (Red.prototype._verify1 = function (a) {\n assert(a.negative === 0, \"red works only with positives\"), assert(a.red, \"red works only with red numbers\");\n }),\n (Red.prototype._verify2 = function (a, b) {\n assert((a.negative | b.negative) === 0, \"red works only with positives\"),\n assert(a.red && a.red === b.red, \"red works only with red numbers\");\n }),\n (Red.prototype.imod = function (a) {\n return this.prime ? this.prime.ireduce(a)._forceRed(this) : a.umod(this.m)._forceRed(this);\n }),\n (Red.prototype.neg = function (a) {\n return a.isZero() ? a.clone() : this.m.sub(a)._forceRed(this);\n }),\n (Red.prototype.add = function (a, b) {\n this._verify2(a, b);\n var res = a.add(b);\n return res.cmp(this.m) >= 0 && res.isub(this.m), res._forceRed(this);\n }),\n (Red.prototype.iadd = function (a, b) {\n this._verify2(a, b);\n var res = a.iadd(b);\n return res.cmp(this.m) >= 0 && res.isub(this.m), res;\n }),\n (Red.prototype.sub = function (a, b) {\n this._verify2(a, b);\n var res = a.sub(b);\n return res.cmpn(0) < 0 && res.iadd(this.m), res._forceRed(this);\n }),\n (Red.prototype.isub = function (a, b) {\n this._verify2(a, b);\n var res = a.isub(b);\n return res.cmpn(0) < 0 && res.iadd(this.m), res;\n }),\n (Red.prototype.shl = function (a, num) {\n return this._verify1(a), this.imod(a.ushln(num));\n }),\n (Red.prototype.imul = function (a, b) {\n return this._verify2(a, b), this.imod(a.imul(b));\n }),\n (Red.prototype.mul = function (a, b) {\n return this._verify2(a, b), this.imod(a.mul(b));\n }),\n (Red.prototype.isqr = function (a) {\n return this.imul(a, a.clone());\n }),\n (Red.prototype.sqr = function (a) {\n return this.mul(a, a);\n }),\n (Red.prototype.sqrt = function (a) {\n if (a.isZero()) return a.clone();\n var mod3 = this.m.andln(3);\n if ((assert(mod3 % 2 === 1), mod3 === 3)) {\n var pow = this.m.add(new BN(1)).iushrn(2);\n return this.pow(a, pow);\n }\n for (var q = this.m.subn(1), s = 0; !q.isZero() && q.andln(1) === 0; ) s++, q.iushrn(1);\n assert(!q.isZero());\n var one = new BN(1).toRed(this),\n nOne = one.redNeg(),\n lpow = this.m.subn(1).iushrn(1),\n z = this.m.bitLength();\n for (z = new BN(2 * z * z).toRed(this); this.pow(z, lpow).cmp(nOne) !== 0; ) z.redIAdd(nOne);\n for (\n var c = this.pow(z, q), r = this.pow(a, q.addn(1).iushrn(1)), t = this.pow(a, q), m = s;\n t.cmp(one) !== 0;\n\n ) {\n for (var tmp = t, i = 0; tmp.cmp(one) !== 0; i++) tmp = tmp.redSqr();\n assert(i < m);\n var b = this.pow(c, new BN(1).iushln(m - i - 1));\n (r = r.redMul(b)), (c = b.redSqr()), (t = t.redMul(c)), (m = i);\n }\n return r;\n }),\n (Red.prototype.invm = function (a) {\n var inv = a._invmp(this.m);\n return inv.negative !== 0 ? ((inv.negative = 0), this.imod(inv).redNeg()) : this.imod(inv);\n }),\n (Red.prototype.pow = function (a, num) {\n if (num.isZero()) return new BN(1).toRed(this);\n if (num.cmpn(1) === 0) return a.clone();\n var windowSize = 4,\n wnd = new Array(1 << windowSize);\n (wnd[0] = new BN(1).toRed(this)), (wnd[1] = a);\n for (var i = 2; i < wnd.length; i++) wnd[i] = this.mul(wnd[i - 1], a);\n var res = wnd[0],\n current = 0,\n currentLen = 0,\n start = num.bitLength() % 26;\n for (start === 0 && (start = 26), i = num.length - 1; i >= 0; i--) {\n for (var word = num.words[i], j = start - 1; j >= 0; j--) {\n var bit = (word >> j) & 1;\n if ((res !== wnd[0] && (res = this.sqr(res)), bit === 0 && current === 0)) {\n currentLen = 0;\n continue;\n }\n (current <<= 1),\n (current |= bit),\n currentLen++,\n !(currentLen !== windowSize && (i !== 0 || j !== 0)) &&\n ((res = this.mul(res, wnd[current])), (currentLen = 0), (current = 0));\n }\n start = 26;\n }\n return res;\n }),\n (Red.prototype.convertTo = function (num) {\n var r = num.umod(this.m);\n return r === num ? r.clone() : r;\n }),\n (Red.prototype.convertFrom = function (num) {\n var res = num.clone();\n return (res.red = null), res;\n }),\n (BN.mont = function (num) {\n return new Mont(num);\n });\n function Mont(m) {\n Red.call(this, m),\n (this.shift = this.m.bitLength()),\n this.shift % 26 !== 0 && (this.shift += 26 - (this.shift % 26)),\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 (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 (Mont.prototype.convertTo = function (num) {\n return this.imod(num.ushln(this.shift));\n }),\n (Mont.prototype.convertFrom = function (num) {\n var r = this.imod(num.mul(this.rinv));\n return (r.red = null), r;\n }),\n (Mont.prototype.imul = function (a, b) {\n if (a.isZero() || b.isZero()) return (a.words[0] = 0), (a.length = 1), a;\n var t = a.imul(b),\n c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m),\n u = t.isub(c).iushrn(this.shift),\n res = u;\n return (\n u.cmp(this.m) >= 0 ? (res = u.isub(this.m)) : u.cmpn(0) < 0 && (res = u.iadd(this.m)), res._forceRed(this)\n );\n }),\n (Mont.prototype.mul = function (a, b) {\n if (a.isZero() || b.isZero()) return new BN(0)._forceRed(this);\n var t = a.mul(b),\n c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m),\n u = t.isub(c).iushrn(this.shift),\n res = u;\n return (\n u.cmp(this.m) >= 0 ? (res = u.isub(this.m)) : u.cmpn(0) < 0 && (res = u.iadd(this.m)), res._forceRed(this)\n );\n }),\n (Mont.prototype.invm = function (a) {\n var res = this.imod(a._invmp(this.m).mul(this.r2));\n return res._forceRed(this);\n });\n })(typeof module > \"u\" || module, exports);\n },\n});\n\n// node_modules/safer-buffer/safer.js\nvar require_safer = __commonJS({\n \"node_modules/safer-buffer/safer.js\"(exports, module) {\n \"use strict\";\n var buffer = __require(\"buffer\"),\n Buffer2 = buffer.Buffer,\n safer = {},\n key;\n for (key in buffer)\n !buffer.hasOwnProperty(key) || key === \"SlowBuffer\" || key === \"Buffer\" || (safer[key] = buffer[key]);\n var Safer = (safer.Buffer = {});\n for (key in Buffer2)\n !Buffer2.hasOwnProperty(key) || key === \"allocUnsafe\" || key === \"allocUnsafeSlow\" || (Safer[key] = Buffer2[key]);\n safer.Buffer.prototype = Buffer2.prototype;\n (!Safer.from || Safer.from === Uint8Array.from) &&\n (Safer.from = function (value, encodingOrOffset, length) {\n if (typeof value == \"number\")\n throw new TypeError('The \"value\" argument must not be of type number. Received type ' + typeof value);\n if (value && typeof value.length > \"u\")\n throw new TypeError(\n \"The first argument must be one of type string, Buffer, ArrayBuffer, Array, or Array-like Object. Received type \" +\n typeof value,\n );\n return Buffer2(value, encodingOrOffset, length);\n });\n Safer.alloc ||\n (Safer.alloc = function (size, fill, encoding) {\n if (typeof size != \"number\")\n throw new TypeError('The \"size\" argument must be of type number. Received type ' + typeof size);\n if (size < 0 || size >= 2 * (1 << 30))\n throw new RangeError('The value \"' + size + '\" is invalid for option \"size\"');\n var buf = Buffer2(size);\n return (\n !fill || fill.length === 0\n ? buf.fill(0)\n : typeof encoding == \"string\"\n ? buf.fill(fill, encoding)\n : buf.fill(fill),\n buf\n );\n });\n if (!safer.kStringMaxLength)\n try {\n safer.kStringMaxLength = MAX_STRING_LENGTH;\n } catch {}\n safer.constants ||\n ((safer.constants = {\n MAX_LENGTH: safer.kMaxLength,\n }),\n safer.kStringMaxLength && (safer.constants.MAX_STRING_LENGTH = safer.kStringMaxLength));\n module.exports = safer;\n },\n});\n\n// node_modules/asn1.js/lib/asn1/base/reporter.js\nvar require_reporter = __commonJS({\n \"node_modules/asn1.js/lib/asn1/base/reporter.js\"(exports) {\n \"use strict\";\n var inherits = require_inherits_browser();\n function Reporter(options) {\n this._reporterState = {\n obj: null,\n path: [],\n options: options || {},\n errors: [],\n };\n }\n exports.Reporter = Reporter;\n Reporter.prototype.isError = function (obj) {\n return obj instanceof ReporterError;\n };\n Reporter.prototype.save = function () {\n let state = this._reporterState;\n return { obj: state.obj, pathLen: state.path.length };\n };\n Reporter.prototype.restore = function (data) {\n let state = this._reporterState;\n (state.obj = data.obj), (state.path = state.path.slice(0, data.pathLen));\n };\n Reporter.prototype.enterKey = function (key) {\n return this._reporterState.path.push(key);\n };\n Reporter.prototype.exitKey = function (index) {\n let state = this._reporterState;\n state.path = state.path.slice(0, index - 1);\n };\n Reporter.prototype.leaveKey = function (index, key, value) {\n let state = this._reporterState;\n this.exitKey(index), state.obj !== null && (state.obj[key] = value);\n };\n Reporter.prototype.path = function () {\n return this._reporterState.path.join(\"/\");\n };\n Reporter.prototype.enterObject = function () {\n let state = this._reporterState,\n prev = state.obj;\n return (state.obj = {}), prev;\n };\n Reporter.prototype.leaveObject = function (prev) {\n let state = this._reporterState,\n now = state.obj;\n return (state.obj = prev), now;\n };\n Reporter.prototype.error = function (msg) {\n let err,\n state = this._reporterState,\n inherited = msg instanceof ReporterError;\n if (\n (inherited\n ? (err = msg)\n : (err = new ReporterError(\n state.path\n .map(function (elem) {\n return \"[\" + JSON.stringify(elem) + \"]\";\n })\n .join(\"\"),\n msg.message || msg,\n msg.stack,\n )),\n !state.options.partial)\n )\n throw err;\n return inherited || state.errors.push(err), err;\n };\n Reporter.prototype.wrapResult = function (result) {\n let state = this._reporterState;\n return state.options.partial\n ? {\n result: this.isError(result) ? null : result,\n errors: state.errors,\n }\n : result;\n };\n function ReporterError(path, msg) {\n (this.path = path), this.rethrow(msg);\n }\n inherits(ReporterError, Error);\n ReporterError.prototype.rethrow = function (msg) {\n if (\n ((this.message = msg + \" at: \" + (this.path || \"(shallow)\")),\n Error.captureStackTrace && Error.captureStackTrace(this, ReporterError),\n !this.stack)\n )\n try {\n throw new Error(this.message);\n } catch (e) {\n this.stack = e.stack;\n }\n return this;\n };\n },\n});\n\n// node_modules/asn1.js/lib/asn1/base/buffer.js\nvar require_buffer = __commonJS({\n \"node_modules/asn1.js/lib/asn1/base/buffer.js\"(exports) {\n \"use strict\";\n var inherits = require_inherits_browser(),\n Reporter = require_reporter().Reporter,\n Buffer2 = require_safer().Buffer;\n function DecoderBuffer(base, options) {\n if ((Reporter.call(this, options), !Buffer2.isBuffer(base))) {\n this.error(\"Input not Buffer\");\n return;\n }\n (this.base = base), (this.offset = 0), (this.length = base.length);\n }\n inherits(DecoderBuffer, Reporter);\n exports.DecoderBuffer = DecoderBuffer;\n DecoderBuffer.isDecoderBuffer = function (data) {\n return data instanceof DecoderBuffer\n ? !0\n : typeof data == \"object\" &&\n Buffer2.isBuffer(data.base) &&\n data.constructor.name === \"DecoderBuffer\" &&\n typeof data.offset == \"number\" &&\n typeof data.length == \"number\" &&\n typeof data.save == \"function\" &&\n typeof data.restore == \"function\" &&\n typeof data.isEmpty == \"function\" &&\n typeof data.readUInt8 == \"function\" &&\n typeof data.skip == \"function\" &&\n typeof data.raw == \"function\";\n };\n DecoderBuffer.prototype.save = function () {\n return {\n offset: this.offset,\n reporter: Reporter.prototype.save.call(this),\n };\n };\n DecoderBuffer.prototype.restore = function (save) {\n let res = new DecoderBuffer(this.base);\n return (\n (res.offset = save.offset),\n (res.length = this.offset),\n (this.offset = save.offset),\n Reporter.prototype.restore.call(this, save.reporter),\n res\n );\n };\n DecoderBuffer.prototype.isEmpty = function () {\n return this.offset === this.length;\n };\n DecoderBuffer.prototype.readUInt8 = function (fail) {\n return this.offset + 1 <= this.length\n ? this.base.readUInt8(this.offset++, !0)\n : this.error(fail || \"DecoderBuffer overrun\");\n };\n DecoderBuffer.prototype.skip = function (bytes, fail) {\n if (!(this.offset + bytes <= this.length)) return this.error(fail || \"DecoderBuffer overrun\");\n let res = new DecoderBuffer(this.base);\n return (\n (res._reporterState = this._reporterState),\n (res.offset = this.offset),\n (res.length = this.offset + bytes),\n (this.offset += bytes),\n res\n );\n };\n DecoderBuffer.prototype.raw = function (save) {\n return this.base.slice(save ? save.offset : this.offset, this.length);\n };\n function EncoderBuffer(value, reporter) {\n if (Array.isArray(value))\n (this.length = 0),\n (this.value = value.map(function (item) {\n return (\n EncoderBuffer.isEncoderBuffer(item) || (item = new EncoderBuffer(item, reporter)),\n (this.length += item.length),\n item\n );\n }, this));\n else if (typeof value == \"number\") {\n if (!(0 <= value && value <= 255)) return reporter.error(\"non-byte EncoderBuffer value\");\n (this.value = value), (this.length = 1);\n } else if (typeof value == \"string\") (this.value = value), (this.length = Buffer2.byteLength(value));\n else if (Buffer2.isBuffer(value)) (this.value = value), (this.length = value.length);\n else return reporter.error(\"Unsupported type: \" + typeof value);\n }\n exports.EncoderBuffer = EncoderBuffer;\n EncoderBuffer.isEncoderBuffer = function (data) {\n return data instanceof EncoderBuffer\n ? !0\n : typeof data == \"object\" &&\n data.constructor.name === \"EncoderBuffer\" &&\n typeof data.length == \"number\" &&\n typeof data.join == \"function\";\n };\n EncoderBuffer.prototype.join = function (out, offset) {\n return (\n out || (out = Buffer2.alloc(this.length)),\n offset || (offset = 0),\n this.length === 0 ||\n (Array.isArray(this.value)\n ? this.value.forEach(function (item) {\n item.join(out, offset), (offset += item.length);\n })\n : (typeof this.value == \"number\"\n ? (out[offset] = this.value)\n : typeof this.value == \"string\"\n ? out.write(this.value, offset)\n : Buffer2.isBuffer(this.value) && this.value.copy(out, offset),\n (offset += this.length))),\n out\n );\n };\n },\n});\n\n// node_modules/asn1.js/lib/asn1/base/node.js\nvar require_node = __commonJS({\n \"node_modules/asn1.js/lib/asn1/base/node.js\"(exports, module) {\n \"use strict\";\n var Reporter = require_reporter().Reporter,\n EncoderBuffer = require_buffer().EncoderBuffer,\n DecoderBuffer = require_buffer().DecoderBuffer,\n assert = require_minimalistic_assert(),\n tags = [\n \"seq\",\n \"seqof\",\n \"set\",\n \"setof\",\n \"objid\",\n \"bool\",\n \"gentime\",\n \"utctime\",\n \"null_\",\n \"enum\",\n \"int\",\n \"objDesc\",\n \"bitstr\",\n \"bmpstr\",\n \"charstr\",\n \"genstr\",\n \"graphstr\",\n \"ia5str\",\n \"iso646str\",\n \"numstr\",\n \"octstr\",\n \"printstr\",\n \"t61str\",\n \"unistr\",\n \"utf8str\",\n \"videostr\",\n ],\n methods = [\"key\", \"obj\", \"use\", \"optional\", \"explicit\", \"implicit\", \"def\", \"choice\", \"any\", \"contains\"].concat(\n tags,\n ),\n overrided = [\n \"_peekTag\",\n \"_decodeTag\",\n \"_use\",\n \"_decodeStr\",\n \"_decodeObjid\",\n \"_decodeTime\",\n \"_decodeNull\",\n \"_decodeInt\",\n \"_decodeBool\",\n \"_decodeList\",\n \"_encodeComposite\",\n \"_encodeStr\",\n \"_encodeObjid\",\n \"_encodeTime\",\n \"_encodeNull\",\n \"_encodeInt\",\n \"_encodeBool\",\n ];\n function Node(enc, parent, name) {\n let state = {};\n (this._baseState = state),\n (state.name = name),\n (state.enc = enc),\n (state.parent = parent || null),\n (state.children = null),\n (state.tag = null),\n (state.args = null),\n (state.reverseArgs = null),\n (state.choice = null),\n (state.optional = !1),\n (state.any = !1),\n (state.obj = !1),\n (state.use = null),\n (state.useDecoder = null),\n (state.key = null),\n (state.default = null),\n (state.explicit = null),\n (state.implicit = null),\n (state.contains = null),\n state.parent || ((state.children = []), this._wrap());\n }\n module.exports = Node;\n var stateProps = [\n \"enc\",\n \"parent\",\n \"children\",\n \"tag\",\n \"args\",\n \"reverseArgs\",\n \"choice\",\n \"optional\",\n \"any\",\n \"obj\",\n \"use\",\n \"alteredUse\",\n \"key\",\n \"default\",\n \"explicit\",\n \"implicit\",\n \"contains\",\n ];\n Node.prototype.clone = function () {\n let state = this._baseState,\n cstate = {};\n stateProps.forEach(function (prop) {\n cstate[prop] = state[prop];\n });\n let res = new this.constructor(cstate.parent);\n return (res._baseState = cstate), res;\n };\n Node.prototype._wrap = function () {\n let state = this._baseState;\n methods.forEach(function (method) {\n this[method] = function () {\n let clone = new this.constructor(this);\n return state.children.push(clone), clone[method].apply(clone, arguments);\n };\n }, this);\n };\n Node.prototype._init = function (body) {\n let state = this._baseState;\n assert(state.parent === null),\n body.call(this),\n (state.children = state.children.filter(function (child) {\n return child._baseState.parent === this;\n }, this)),\n assert.equal(state.children.length, 1, \"Root node can have only one child\");\n };\n Node.prototype._useArgs = function (args) {\n let state = this._baseState,\n children = args.filter(function (arg) {\n return arg instanceof this.constructor;\n }, this);\n (args = args.filter(function (arg) {\n return !(arg instanceof this.constructor);\n }, this)),\n children.length !== 0 &&\n (assert(state.children === null),\n (state.children = children),\n children.forEach(function (child) {\n child._baseState.parent = this;\n }, this)),\n args.length !== 0 &&\n (assert(state.args === null),\n (state.args = args),\n (state.reverseArgs = args.map(function (arg) {\n if (typeof arg != \"object\" || arg.constructor !== Object) return arg;\n let res = {};\n return (\n Object.keys(arg).forEach(function (key) {\n key == (key | 0) && (key |= 0);\n let value = arg[key];\n res[value] = key;\n }),\n res\n );\n })));\n };\n overrided.forEach(function (method) {\n Node.prototype[method] = function () {\n let state = this._baseState;\n throw new Error(method + \" not implemented for encoding: \" + state.enc);\n };\n });\n tags.forEach(function (tag) {\n Node.prototype[tag] = function () {\n let state = this._baseState,\n args = Array.prototype.slice.call(arguments);\n return assert(state.tag === null), (state.tag = tag), this._useArgs(args), this;\n };\n });\n Node.prototype.use = function (item) {\n assert(item);\n let state = this._baseState;\n return assert(state.use === null), (state.use = item), this;\n };\n Node.prototype.optional = function () {\n let state = this._baseState;\n return (state.optional = !0), this;\n };\n Node.prototype.def = function (val) {\n let state = this._baseState;\n return assert(state.default === null), (state.default = val), (state.optional = !0), this;\n };\n Node.prototype.explicit = function (num) {\n let state = this._baseState;\n return assert(state.explicit === null && state.implicit === null), (state.explicit = num), this;\n };\n Node.prototype.implicit = function (num) {\n let state = this._baseState;\n return assert(state.explicit === null && state.implicit === null), (state.implicit = num), this;\n };\n Node.prototype.obj = function () {\n let state = this._baseState,\n args = Array.prototype.slice.call(arguments);\n return (state.obj = !0), args.length !== 0 && this._useArgs(args), this;\n };\n Node.prototype.key = function (newKey) {\n let state = this._baseState;\n return assert(state.key === null), (state.key = newKey), this;\n };\n Node.prototype.any = function () {\n let state = this._baseState;\n return (state.any = !0), this;\n };\n Node.prototype.choice = function (obj) {\n let state = this._baseState;\n return (\n assert(state.choice === null),\n (state.choice = obj),\n this._useArgs(\n Object.keys(obj).map(function (key) {\n return obj[key];\n }),\n ),\n this\n );\n };\n Node.prototype.contains = function (item) {\n let state = this._baseState;\n return assert(state.use === null), (state.contains = item), this;\n };\n Node.prototype._decode = function (input, options) {\n let state = this._baseState;\n if (state.parent === null) return input.wrapResult(state.children[0]._decode(input, options));\n let result = state.default,\n present = !0,\n prevKey = null;\n if ((state.key !== null && (prevKey = input.enterKey(state.key)), state.optional)) {\n let tag = null;\n if (\n (state.explicit !== null\n ? (tag = state.explicit)\n : state.implicit !== null\n ? (tag = state.implicit)\n : state.tag !== null && (tag = state.tag),\n tag === null && !state.any)\n ) {\n let save = input.save();\n try {\n state.choice === null ? this._decodeGeneric(state.tag, input, options) : this._decodeChoice(input, options),\n (present = !0);\n } catch {\n present = !1;\n }\n input.restore(save);\n } else if (((present = this._peekTag(input, tag, state.any)), input.isError(present))) return present;\n }\n let prevObj;\n if ((state.obj && present && (prevObj = input.enterObject()), present)) {\n if (state.explicit !== null) {\n let explicit = this._decodeTag(input, state.explicit);\n if (input.isError(explicit)) return explicit;\n input = explicit;\n }\n let start = input.offset;\n if (state.use === null && state.choice === null) {\n let save;\n state.any && (save = input.save());\n let body = this._decodeTag(input, state.implicit !== null ? state.implicit : state.tag, state.any);\n if (input.isError(body)) return body;\n state.any ? (result = input.raw(save)) : (input = body);\n }\n if (\n (options && options.track && state.tag !== null && options.track(input.path(), start, input.length, \"tagged\"),\n options &&\n options.track &&\n state.tag !== null &&\n options.track(input.path(), input.offset, input.length, \"content\"),\n state.any ||\n (state.choice === null\n ? (result = this._decodeGeneric(state.tag, input, options))\n : (result = this._decodeChoice(input, options))),\n input.isError(result))\n )\n return result;\n if (\n (!state.any &&\n state.choice === null &&\n state.children !== null &&\n state.children.forEach(function (child) {\n child._decode(input, options);\n }),\n state.contains && (state.tag === \"octstr\" || state.tag === \"bitstr\"))\n ) {\n let data = new DecoderBuffer(result);\n result = this._getUse(state.contains, input._reporterState.obj)._decode(data, options);\n }\n }\n return (\n state.obj && present && (result = input.leaveObject(prevObj)),\n state.key !== null && (result !== null || present === !0)\n ? input.leaveKey(prevKey, state.key, result)\n : prevKey !== null && input.exitKey(prevKey),\n result\n );\n };\n Node.prototype._decodeGeneric = function (tag, input, options) {\n let state = this._baseState;\n return tag === \"seq\" || tag === \"set\"\n ? null\n : tag === \"seqof\" || tag === \"setof\"\n ? this._decodeList(input, tag, state.args[0], options)\n : /str$/.test(tag)\n ? this._decodeStr(input, tag, options)\n : tag === \"objid\" && state.args\n ? this._decodeObjid(input, state.args[0], state.args[1], options)\n : tag === \"objid\"\n ? this._decodeObjid(input, null, null, options)\n : tag === \"gentime\" || tag === \"utctime\"\n ? this._decodeTime(input, tag, options)\n : tag === \"null_\"\n ? this._decodeNull(input, options)\n : tag === \"bool\"\n ? this._decodeBool(input, options)\n : tag === \"objDesc\"\n ? this._decodeStr(input, tag, options)\n : tag === \"int\" || tag === \"enum\"\n ? this._decodeInt(input, state.args && state.args[0], options)\n : state.use !== null\n ? this._getUse(state.use, input._reporterState.obj)._decode(input, options)\n : input.error(\"unknown tag: \" + tag);\n };\n Node.prototype._getUse = function (entity, obj) {\n let state = this._baseState;\n return (\n (state.useDecoder = this._use(entity, obj)),\n assert(state.useDecoder._baseState.parent === null),\n (state.useDecoder = state.useDecoder._baseState.children[0]),\n state.implicit !== state.useDecoder._baseState.implicit &&\n ((state.useDecoder = state.useDecoder.clone()), (state.useDecoder._baseState.implicit = state.implicit)),\n state.useDecoder\n );\n };\n Node.prototype._decodeChoice = function (input, options) {\n let state = this._baseState,\n result = null,\n match = !1;\n return (\n Object.keys(state.choice).some(function (key) {\n let save = input.save(),\n node = state.choice[key];\n try {\n let value = node._decode(input, options);\n if (input.isError(value)) return !1;\n (result = { type: key, value }), (match = !0);\n } catch {\n return input.restore(save), !1;\n }\n return !0;\n }, this),\n match ? result : input.error(\"Choice not matched\")\n );\n };\n Node.prototype._createEncoderBuffer = function (data) {\n return new EncoderBuffer(data, this.reporter);\n };\n Node.prototype._encode = function (data, reporter, parent) {\n let state = this._baseState;\n if (state.default !== null && state.default === data) return;\n let result = this._encodeValue(data, reporter, parent);\n if (result !== void 0 && !this._skipDefault(result, reporter, parent)) return result;\n };\n Node.prototype._encodeValue = function (data, reporter, parent) {\n let state = this._baseState;\n if (state.parent === null) return state.children[0]._encode(data, reporter || new Reporter());\n let result = null;\n if (((this.reporter = reporter), state.optional && data === void 0))\n if (state.default !== null) data = state.default;\n else return;\n let content = null,\n primitive = !1;\n if (state.any) result = this._createEncoderBuffer(data);\n else if (state.choice) result = this._encodeChoice(data, reporter);\n else if (state.contains)\n (content = this._getUse(state.contains, parent)._encode(data, reporter)), (primitive = !0);\n else if (state.children)\n (content = state.children\n .map(function (child) {\n if (child._baseState.tag === \"null_\") return child._encode(null, reporter, data);\n if (child._baseState.key === null) return reporter.error(\"Child should have a key\");\n let prevKey = reporter.enterKey(child._baseState.key);\n if (typeof data != \"object\") return reporter.error(\"Child expected, but input is not object\");\n let res = child._encode(data[child._baseState.key], reporter, data);\n return reporter.leaveKey(prevKey), res;\n }, this)\n .filter(function (child) {\n return child;\n })),\n (content = this._createEncoderBuffer(content));\n else if (state.tag === \"seqof\" || state.tag === \"setof\") {\n if (!(state.args && state.args.length === 1)) return reporter.error(\"Too many args for : \" + state.tag);\n if (!Array.isArray(data)) return reporter.error(\"seqof/setof, but data is not Array\");\n let child = this.clone();\n (child._baseState.implicit = null),\n (content = this._createEncoderBuffer(\n data.map(function (item) {\n let state2 = this._baseState;\n return this._getUse(state2.args[0], data)._encode(item, reporter);\n }, child),\n ));\n } else\n state.use !== null\n ? (result = this._getUse(state.use, parent)._encode(data, reporter))\n : ((content = this._encodePrimitive(state.tag, data)), (primitive = !0));\n if (!state.any && state.choice === null) {\n let tag = state.implicit !== null ? state.implicit : state.tag,\n cls = state.implicit === null ? \"universal\" : \"context\";\n tag === null\n ? state.use === null && reporter.error(\"Tag could be omitted only for .use()\")\n : state.use === null && (result = this._encodeComposite(tag, primitive, cls, content));\n }\n return state.explicit !== null && (result = this._encodeComposite(state.explicit, !1, \"context\", result)), result;\n };\n Node.prototype._encodeChoice = function (data, reporter) {\n let state = this._baseState,\n node = state.choice[data.type];\n return (\n node || assert(!1, data.type + \" not found in \" + JSON.stringify(Object.keys(state.choice))),\n node._encode(data.value, reporter)\n );\n };\n Node.prototype._encodePrimitive = function (tag, data) {\n let state = this._baseState;\n if (/str$/.test(tag)) return this._encodeStr(data, tag);\n if (tag === \"objid\" && state.args) return this._encodeObjid(data, state.reverseArgs[0], state.args[1]);\n if (tag === \"objid\") return this._encodeObjid(data, null, null);\n if (tag === \"gentime\" || tag === \"utctime\") return this._encodeTime(data, tag);\n if (tag === \"null_\") return this._encodeNull();\n if (tag === \"int\" || tag === \"enum\") return this._encodeInt(data, state.args && state.reverseArgs[0]);\n if (tag === \"bool\") return this._encodeBool(data);\n if (tag === \"objDesc\") return this._encodeStr(data, tag);\n throw new Error(\"Unsupported tag: \" + tag);\n };\n Node.prototype._isNumstr = function (str) {\n return /^[0-9 ]*$/.test(str);\n };\n Node.prototype._isPrintstr = function (str) {\n return /^[A-Za-z0-9 '()+,-./:=?]*$/.test(str);\n };\n },\n});\n\n// node_modules/asn1.js/lib/asn1/constants/der.js\nvar require_der = __commonJS({\n \"node_modules/asn1.js/lib/asn1/constants/der.js\"(exports) {\n \"use strict\";\n function reverse(map) {\n let res = {};\n return (\n Object.keys(map).forEach(function (key) {\n (key | 0) == key && (key = key | 0);\n let value = map[key];\n res[value] = key;\n }),\n res\n );\n }\n exports.tagClass = {\n 0: \"universal\",\n 1: \"application\",\n 2: \"context\",\n 3: \"private\",\n };\n exports.tagClassByName = reverse(exports.tagClass);\n exports.tag = {\n 0: \"end\",\n 1: \"bool\",\n 2: \"int\",\n 3: \"bitstr\",\n 4: \"octstr\",\n 5: \"null_\",\n 6: \"objid\",\n 7: \"objDesc\",\n 8: \"external\",\n 9: \"real\",\n 10: \"enum\",\n 11: \"embed\",\n 12: \"utf8str\",\n 13: \"relativeOid\",\n 16: \"seq\",\n 17: \"set\",\n 18: \"numstr\",\n 19: \"printstr\",\n 20: \"t61str\",\n 21: \"videostr\",\n 22: \"ia5str\",\n 23: \"utctime\",\n 24: \"gentime\",\n 25: \"graphstr\",\n 26: \"iso646str\",\n 27: \"genstr\",\n 28: \"unistr\",\n 29: \"charstr\",\n 30: \"bmpstr\",\n };\n exports.tagByName = reverse(exports.tag);\n },\n});\n\n// node_modules/asn1.js/lib/asn1/encoders/der.js\nvar require_der2 = __commonJS({\n \"node_modules/asn1.js/lib/asn1/encoders/der.js\"(exports, module) {\n \"use strict\";\n var inherits = require_inherits_browser(),\n Buffer2 = require_safer().Buffer,\n Node = require_node(),\n der = require_der();\n function DEREncoder(entity) {\n (this.enc = \"der\"),\n (this.name = entity.name),\n (this.entity = entity),\n (this.tree = new DERNode()),\n this.tree._init(entity.body);\n }\n module.exports = DEREncoder;\n DEREncoder.prototype.encode = function (data, reporter) {\n return this.tree._encode(data, reporter).join();\n };\n function DERNode(parent) {\n Node.call(this, \"der\", parent);\n }\n inherits(DERNode, Node);\n DERNode.prototype._encodeComposite = function (tag, primitive, cls, content) {\n let encodedTag = encodeTag(tag, primitive, cls, this.reporter);\n if (content.length < 128) {\n let header2 = Buffer2.alloc(2);\n return (header2[0] = encodedTag), (header2[1] = content.length), this._createEncoderBuffer([header2, content]);\n }\n let lenOctets = 1;\n for (let i = content.length; i >= 256; i >>= 8) lenOctets++;\n let header = Buffer2.alloc(1 + 1 + lenOctets);\n (header[0] = encodedTag), (header[1] = 128 | lenOctets);\n for (let i = 1 + lenOctets, j = content.length; j > 0; i--, j >>= 8) header[i] = j & 255;\n return this._createEncoderBuffer([header, content]);\n };\n DERNode.prototype._encodeStr = function (str, tag) {\n if (tag === \"bitstr\") return this._createEncoderBuffer([str.unused | 0, str.data]);\n if (tag === \"bmpstr\") {\n let buf = Buffer2.alloc(str.length * 2);\n for (let i = 0; i < str.length; i++) buf.writeUInt16BE(str.charCodeAt(i), i * 2);\n return this._createEncoderBuffer(buf);\n } else\n return tag === \"numstr\"\n ? this._isNumstr(str)\n ? this._createEncoderBuffer(str)\n : this.reporter.error(\"Encoding of string type: numstr supports only digits and space\")\n : tag === \"printstr\"\n ? this._isPrintstr(str)\n ? this._createEncoderBuffer(str)\n : this.reporter.error(\n \"Encoding of string type: printstr supports only latin upper and lower case letters, digits, space, apostrophe, left and rigth parenthesis, plus sign, comma, hyphen, dot, slash, colon, equal sign, question mark\",\n )\n : /str$/.test(tag)\n ? this._createEncoderBuffer(str)\n : tag === \"objDesc\"\n ? this._createEncoderBuffer(str)\n : this.reporter.error(\"Encoding of string type: \" + tag + \" unsupported\");\n };\n DERNode.prototype._encodeObjid = function (id, values, relative) {\n if (typeof id == \"string\") {\n if (!values) return this.reporter.error(\"string objid given, but no values map found\");\n if (!values.hasOwnProperty(id)) return this.reporter.error(\"objid not found in values map\");\n id = values[id].split(/[\\s.]+/g);\n for (let i = 0; i < id.length; i++) id[i] |= 0;\n } else if (Array.isArray(id)) {\n id = id.slice();\n for (let i = 0; i < id.length; i++) id[i] |= 0;\n }\n if (!Array.isArray(id))\n return this.reporter.error(\"objid() should be either array or string, got: \" + JSON.stringify(id));\n if (!relative) {\n if (id[1] >= 40) return this.reporter.error(\"Second objid identifier OOB\");\n id.splice(0, 2, id[0] * 40 + id[1]);\n }\n let size = 0;\n for (let i = 0; i < id.length; i++) {\n let ident = id[i];\n for (size++; ident >= 128; ident >>= 7) size++;\n }\n let objid = Buffer2.alloc(size),\n offset = objid.length - 1;\n for (let i = id.length - 1; i >= 0; i--) {\n let ident = id[i];\n for (objid[offset--] = ident & 127; (ident >>= 7) > 0; ) objid[offset--] = 128 | (ident & 127);\n }\n return this._createEncoderBuffer(objid);\n };\n function two(num) {\n return num < 10 ? \"0\" + num : num;\n }\n DERNode.prototype._encodeTime = function (time, tag) {\n let str,\n date = new Date(time);\n return (\n tag === \"gentime\"\n ? (str = [\n two(date.getUTCFullYear()),\n two(date.getUTCMonth() + 1),\n two(date.getUTCDate()),\n two(date.getUTCHours()),\n two(date.getUTCMinutes()),\n two(date.getUTCSeconds()),\n \"Z\",\n ].join(\"\"))\n : tag === \"utctime\"\n ? (str = [\n two(date.getUTCFullYear() % 100),\n two(date.getUTCMonth() + 1),\n two(date.getUTCDate()),\n two(date.getUTCHours()),\n two(date.getUTCMinutes()),\n two(date.getUTCSeconds()),\n \"Z\",\n ].join(\"\"))\n : this.reporter.error(\"Encoding \" + tag + \" time is not supported yet\"),\n this._encodeStr(str, \"octstr\")\n );\n };\n DERNode.prototype._encodeNull = function () {\n return this._createEncoderBuffer(\"\");\n };\n DERNode.prototype._encodeInt = function (num, values) {\n if (typeof num == \"string\") {\n if (!values) return this.reporter.error(\"String int or enum given, but no values map\");\n if (!values.hasOwnProperty(num))\n return this.reporter.error(\"Values map doesn't contain: \" + JSON.stringify(num));\n num = values[num];\n }\n if (typeof num != \"number\" && !Buffer2.isBuffer(num)) {\n let numArray = num.toArray();\n !num.sign && numArray[0] & 128 && numArray.unshift(0), (num = Buffer2.from(numArray));\n }\n if (Buffer2.isBuffer(num)) {\n let size2 = num.length;\n num.length === 0 && size2++;\n let out2 = Buffer2.alloc(size2);\n return num.copy(out2), num.length === 0 && (out2[0] = 0), this._createEncoderBuffer(out2);\n }\n if (num < 128) return this._createEncoderBuffer(num);\n if (num < 256) return this._createEncoderBuffer([0, num]);\n let size = 1;\n for (let i = num; i >= 256; i >>= 8) size++;\n let out = new Array(size);\n for (let i = out.length - 1; i >= 0; i--) (out[i] = num & 255), (num >>= 8);\n return out[0] & 128 && out.unshift(0), this._createEncoderBuffer(Buffer2.from(out));\n };\n DERNode.prototype._encodeBool = function (value) {\n return this._createEncoderBuffer(value ? 255 : 0);\n };\n DERNode.prototype._use = function (entity, obj) {\n return typeof entity == \"function\" && (entity = entity(obj)), entity._getEncoder(\"der\").tree;\n };\n DERNode.prototype._skipDefault = function (dataBuffer, reporter, parent) {\n let state = this._baseState,\n i;\n if (state.default === null) return !1;\n let data = dataBuffer.join();\n if (\n (state.defaultBuffer === void 0 &&\n (state.defaultBuffer = this._encodeValue(state.default, reporter, parent).join()),\n data.length !== state.defaultBuffer.length)\n )\n return !1;\n for (i = 0; i < data.length; i++) if (data[i] !== state.defaultBuffer[i]) return !1;\n return !0;\n };\n function encodeTag(tag, primitive, cls, reporter) {\n let res;\n if ((tag === \"seqof\" ? (tag = \"seq\") : tag === \"setof\" && (tag = \"set\"), der.tagByName.hasOwnProperty(tag)))\n res = der.tagByName[tag];\n else if (typeof tag == \"number\" && (tag | 0) === tag) res = tag;\n else return reporter.error(\"Unknown tag: \" + tag);\n return res >= 31\n ? reporter.error(\"Multi-octet tag encoding unsupported\")\n : (primitive || (res |= 32), (res |= der.tagClassByName[cls || \"universal\"] << 6), res);\n }\n },\n});\n\n// node_modules/asn1.js/lib/asn1/encoders/pem.js\nvar require_pem = __commonJS({\n \"node_modules/asn1.js/lib/asn1/encoders/pem.js\"(exports, module) {\n \"use strict\";\n var inherits = require_inherits_browser(),\n DEREncoder = require_der2();\n function PEMEncoder(entity) {\n DEREncoder.call(this, entity), (this.enc = \"pem\");\n }\n inherits(PEMEncoder, DEREncoder);\n module.exports = PEMEncoder;\n PEMEncoder.prototype.encode = function (data, options) {\n let p = DEREncoder.prototype.encode.call(this, data).toString(\"base64\"),\n out = [\"-----BEGIN \" + options.label + \"-----\"];\n for (let i = 0; i < p.length; i += 64) out.push(p.slice(i, i + 64));\n return (\n out.push(\"-----END \" + options.label + \"-----\"),\n out.join(`\n`)\n );\n };\n },\n});\n\n// node_modules/asn1.js/lib/asn1/encoders/index.js\nvar require_encoders = __commonJS({\n \"node_modules/asn1.js/lib/asn1/encoders/index.js\"(exports) {\n \"use strict\";\n var encoders = exports;\n encoders.der = require_der2();\n encoders.pem = require_pem();\n },\n});\n\n// node_modules/asn1.js/lib/asn1/decoders/der.js\nvar require_der3 = __commonJS({\n \"node_modules/asn1.js/lib/asn1/decoders/der.js\"(exports, module) {\n \"use strict\";\n var inherits = require_inherits_browser(),\n bignum = require_bn5(),\n DecoderBuffer = require_buffer().DecoderBuffer,\n Node = require_node(),\n der = require_der();\n function DERDecoder(entity) {\n (this.enc = \"der\"),\n (this.name = entity.name),\n (this.entity = entity),\n (this.tree = new DERNode()),\n this.tree._init(entity.body);\n }\n module.exports = DERDecoder;\n DERDecoder.prototype.decode = function (data, options) {\n return (\n DecoderBuffer.isDecoderBuffer(data) || (data = new DecoderBuffer(data, options)),\n this.tree._decode(data, options)\n );\n };\n function DERNode(parent) {\n Node.call(this, \"der\", parent);\n }\n inherits(DERNode, Node);\n DERNode.prototype._peekTag = function (buffer, tag, any) {\n if (buffer.isEmpty()) return !1;\n let state = buffer.save(),\n decodedTag = derDecodeTag(buffer, 'Failed to peek tag: \"' + tag + '\"');\n return buffer.isError(decodedTag)\n ? decodedTag\n : (buffer.restore(state),\n decodedTag.tag === tag || decodedTag.tagStr === tag || decodedTag.tagStr + \"of\" === tag || any);\n };\n DERNode.prototype._decodeTag = function (buffer, tag, any) {\n let decodedTag = derDecodeTag(buffer, 'Failed to decode tag of \"' + tag + '\"');\n if (buffer.isError(decodedTag)) return decodedTag;\n let len = derDecodeLen(buffer, decodedTag.primitive, 'Failed to get length of \"' + tag + '\"');\n if (buffer.isError(len)) return len;\n if (!any && decodedTag.tag !== tag && decodedTag.tagStr !== tag && decodedTag.tagStr + \"of\" !== tag)\n return buffer.error('Failed to match tag: \"' + tag + '\"');\n if (decodedTag.primitive || len !== null) return buffer.skip(len, 'Failed to match body of: \"' + tag + '\"');\n let state = buffer.save(),\n res = this._skipUntilEnd(buffer, 'Failed to skip indefinite length body: \"' + this.tag + '\"');\n return buffer.isError(res)\n ? res\n : ((len = buffer.offset - state.offset),\n buffer.restore(state),\n buffer.skip(len, 'Failed to match body of: \"' + tag + '\"'));\n };\n DERNode.prototype._skipUntilEnd = function (buffer, fail) {\n for (;;) {\n let tag = derDecodeTag(buffer, fail);\n if (buffer.isError(tag)) return tag;\n let len = derDecodeLen(buffer, tag.primitive, fail);\n if (buffer.isError(len)) return len;\n let res;\n if (\n (tag.primitive || len !== null ? (res = buffer.skip(len)) : (res = this._skipUntilEnd(buffer, fail)),\n buffer.isError(res))\n )\n return res;\n if (tag.tagStr === \"end\") break;\n }\n };\n DERNode.prototype._decodeList = function (buffer, tag, decoder, options) {\n let result = [];\n for (; !buffer.isEmpty(); ) {\n let possibleEnd = this._peekTag(buffer, \"end\");\n if (buffer.isError(possibleEnd)) return possibleEnd;\n let res = decoder.decode(buffer, \"der\", options);\n if (buffer.isError(res) && possibleEnd) break;\n result.push(res);\n }\n return result;\n };\n DERNode.prototype._decodeStr = function (buffer, tag) {\n if (tag === \"bitstr\") {\n let unused = buffer.readUInt8();\n return buffer.isError(unused) ? unused : { unused, data: buffer.raw() };\n } else if (tag === \"bmpstr\") {\n let raw = buffer.raw();\n if (raw.length % 2 === 1) return buffer.error(\"Decoding of string type: bmpstr length mismatch\");\n let str = \"\";\n for (let i = 0; i < raw.length / 2; i++) str += String.fromCharCode(raw.readUInt16BE(i * 2));\n return str;\n } else if (tag === \"numstr\") {\n let numstr = buffer.raw().toString(\"ascii\");\n return this._isNumstr(numstr) ? numstr : buffer.error(\"Decoding of string type: numstr unsupported characters\");\n } else {\n if (tag === \"octstr\") return buffer.raw();\n if (tag === \"objDesc\") return buffer.raw();\n if (tag === \"printstr\") {\n let printstr = buffer.raw().toString(\"ascii\");\n return this._isPrintstr(printstr)\n ? printstr\n : buffer.error(\"Decoding of string type: printstr unsupported characters\");\n } else\n return /str$/.test(tag)\n ? buffer.raw().toString()\n : buffer.error(\"Decoding of string type: \" + tag + \" unsupported\");\n }\n };\n DERNode.prototype._decodeObjid = function (buffer, values, relative) {\n let result,\n identifiers = [],\n ident = 0,\n subident = 0;\n for (; !buffer.isEmpty(); )\n (subident = buffer.readUInt8()),\n (ident <<= 7),\n (ident |= subident & 127),\n (subident & 128) === 0 && (identifiers.push(ident), (ident = 0));\n subident & 128 && identifiers.push(ident);\n let first = (identifiers[0] / 40) | 0,\n second = identifiers[0] % 40;\n if ((relative ? (result = identifiers) : (result = [first, second].concat(identifiers.slice(1))), values)) {\n let tmp = values[result.join(\" \")];\n tmp === void 0 && (tmp = values[result.join(\".\")]), tmp !== void 0 && (result = tmp);\n }\n return result;\n };\n DERNode.prototype._decodeTime = function (buffer, tag) {\n let str = buffer.raw().toString(),\n year,\n mon,\n day,\n hour,\n min,\n sec;\n if (tag === \"gentime\")\n (year = str.slice(0, 4) | 0),\n (mon = str.slice(4, 6) | 0),\n (day = str.slice(6, 8) | 0),\n (hour = str.slice(8, 10) | 0),\n (min = str.slice(10, 12) | 0),\n (sec = str.slice(12, 14) | 0);\n else if (tag === \"utctime\")\n (year = str.slice(0, 2) | 0),\n (mon = str.slice(2, 4) | 0),\n (day = str.slice(4, 6) | 0),\n (hour = str.slice(6, 8) | 0),\n (min = str.slice(8, 10) | 0),\n (sec = str.slice(10, 12) | 0),\n year < 70 ? (year = 2e3 + year) : (year = 1900 + year);\n else return buffer.error(\"Decoding \" + tag + \" time is not supported yet\");\n return Date.UTC(year, mon - 1, day, hour, min, sec, 0);\n };\n DERNode.prototype._decodeNull = function () {\n return null;\n };\n DERNode.prototype._decodeBool = function (buffer) {\n let res = buffer.readUInt8();\n return buffer.isError(res) ? res : res !== 0;\n };\n DERNode.prototype._decodeInt = function (buffer, values) {\n let raw = buffer.raw(),\n res = new bignum(raw);\n return values && (res = values[res.toString(10)] || res), res;\n };\n DERNode.prototype._use = function (entity, obj) {\n return typeof entity == \"function\" && (entity = entity(obj)), entity._getDecoder(\"der\").tree;\n };\n function derDecodeTag(buf, fail) {\n let tag = buf.readUInt8(fail);\n if (buf.isError(tag)) return tag;\n let cls = der.tagClass[tag >> 6],\n primitive = (tag & 32) === 0;\n if ((tag & 31) === 31) {\n let oct = tag;\n for (tag = 0; (oct & 128) === 128; ) {\n if (((oct = buf.readUInt8(fail)), buf.isError(oct))) return oct;\n (tag <<= 7), (tag |= oct & 127);\n }\n } else tag &= 31;\n let tagStr = der.tag[tag];\n return {\n cls,\n primitive,\n tag,\n tagStr,\n };\n }\n function derDecodeLen(buf, primitive, fail) {\n let len = buf.readUInt8(fail);\n if (buf.isError(len)) return len;\n if (!primitive && len === 128) return null;\n if ((len & 128) === 0) return len;\n let num = len & 127;\n if (num > 4) return buf.error(\"length octect is too long\");\n len = 0;\n for (let i = 0; i < num; i++) {\n len <<= 8;\n let j = buf.readUInt8(fail);\n if (buf.isError(j)) return j;\n len |= j;\n }\n return len;\n }\n },\n});\n\n// node_modules/asn1.js/lib/asn1/decoders/pem.js\nvar require_pem2 = __commonJS({\n \"node_modules/asn1.js/lib/asn1/decoders/pem.js\"(exports, module) {\n \"use strict\";\n var inherits = require_inherits_browser(),\n Buffer2 = require_safer().Buffer,\n DERDecoder = require_der3();\n function PEMDecoder(entity) {\n DERDecoder.call(this, entity), (this.enc = \"pem\");\n }\n inherits(PEMDecoder, DERDecoder);\n module.exports = PEMDecoder;\n PEMDecoder.prototype.decode = function (data, options) {\n let lines = data.toString().split(/[\\r\\n]+/g),\n label = options.label.toUpperCase(),\n re = /^-----(BEGIN|END) ([^-]+)-----$/,\n start = -1,\n end = -1;\n for (let i = 0; i < lines.length; i++) {\n let match = lines[i].match(re);\n if (match !== null && match[2] === label)\n if (start === -1) {\n if (match[1] !== \"BEGIN\") break;\n start = i;\n } else {\n if (match[1] !== \"END\") break;\n end = i;\n break;\n }\n }\n if (start === -1 || end === -1) throw new Error(\"PEM section not found for: \" + label);\n let base64 = lines.slice(start + 1, end).join(\"\");\n base64.replace(/[^a-z0-9+/=]+/gi, \"\");\n let input = Buffer2.from(base64, \"base64\");\n return DERDecoder.prototype.decode.call(this, input, options);\n };\n },\n});\n\n// node_modules/asn1.js/lib/asn1/decoders/index.js\nvar require_decoders = __commonJS({\n \"node_modules/asn1.js/lib/asn1/decoders/index.js\"(exports) {\n \"use strict\";\n var decoders = exports;\n decoders.der = require_der3();\n decoders.pem = require_pem2();\n },\n});\n\n// node_modules/asn1.js/lib/asn1/api.js\nvar require_api = __commonJS({\n \"node_modules/asn1.js/lib/asn1/api.js\"(exports) {\n \"use strict\";\n var encoders = require_encoders(),\n decoders = require_decoders(),\n inherits = require_inherits_browser(),\n api = exports;\n api.define = function (name, body) {\n return new Entity(name, body);\n };\n function Entity(name, body) {\n (this.name = name), (this.body = body), (this.decoders = {}), (this.encoders = {});\n }\n Entity.prototype._createNamed = function (Base) {\n let name = this.name;\n function Generated(entity) {\n this._initNamed(entity, name);\n }\n return (\n inherits(Generated, Base),\n (Generated.prototype._initNamed = function (entity, name2) {\n Base.call(this, entity, name2);\n }),\n new Generated(this)\n );\n };\n Entity.prototype._getDecoder = function (enc) {\n return (\n (enc = enc || \"der\"),\n this.decoders.hasOwnProperty(enc) || (this.decoders[enc] = this._createNamed(decoders[enc])),\n this.decoders[enc]\n );\n };\n Entity.prototype.decode = function (data, enc, options) {\n return this._getDecoder(enc).decode(data, options);\n };\n Entity.prototype._getEncoder = function (enc) {\n return (\n (enc = enc || \"der\"),\n this.encoders.hasOwnProperty(enc) || (this.encoders[enc] = this._createNamed(encoders[enc])),\n this.encoders[enc]\n );\n };\n Entity.prototype.encode = function (data, enc, reporter) {\n return this._getEncoder(enc).encode(data, reporter);\n };\n },\n});\n\n// node_modules/asn1.js/lib/asn1/base/index.js\nvar require_base2 = __commonJS({\n \"node_modules/asn1.js/lib/asn1/base/index.js\"(exports) {\n \"use strict\";\n var base = exports;\n base.Reporter = require_reporter().Reporter;\n base.DecoderBuffer = require_buffer().DecoderBuffer;\n base.EncoderBuffer = require_buffer().EncoderBuffer;\n base.Node = require_node();\n },\n});\n\n// node_modules/asn1.js/lib/asn1/constants/index.js\nvar require_constants = __commonJS({\n \"node_modules/asn1.js/lib/asn1/constants/index.js\"(exports) {\n \"use strict\";\n var constants = exports;\n constants._reverse = function (map) {\n let res = {};\n return (\n Object.keys(map).forEach(function (key) {\n (key | 0) == key && (key = key | 0);\n let value = map[key];\n res[value] = key;\n }),\n res\n );\n };\n constants.der = require_der();\n },\n});\n\n// node_modules/asn1.js/lib/asn1.js\nvar require_asn1 = __commonJS({\n \"node_modules/asn1.js/lib/asn1.js\"(exports) {\n \"use strict\";\n var asn1 = exports;\n asn1.bignum = require_bn5();\n asn1.define = require_api().define;\n asn1.base = require_base2();\n asn1.constants = require_constants();\n asn1.decoders = require_decoders();\n asn1.encoders = require_encoders();\n },\n});\n\n// node_modules/parse-asn1/certificate.js\nvar require_certificate = __commonJS({\n \"node_modules/parse-asn1/certificate.js\"(exports, module) {\n \"use strict\";\n var asn = require_asn1(),\n Time = asn.define(\"Time\", function () {\n this.choice({\n utcTime: this.utctime(),\n generalTime: this.gentime(),\n });\n }),\n AttributeTypeValue = asn.define(\"AttributeTypeValue\", function () {\n this.seq().obj(this.key(\"type\").objid(), this.key(\"value\").any());\n }),\n AlgorithmIdentifier = asn.define(\"AlgorithmIdentifier\", function () {\n this.seq().obj(\n this.key(\"algorithm\").objid(),\n this.key(\"parameters\").optional(),\n this.key(\"curve\").objid().optional(),\n );\n }),\n SubjectPublicKeyInfo = asn.define(\"SubjectPublicKeyInfo\", function () {\n this.seq().obj(this.key(\"algorithm\").use(AlgorithmIdentifier), this.key(\"subjectPublicKey\").bitstr());\n }),\n RelativeDistinguishedName = asn.define(\"RelativeDistinguishedName\", function () {\n this.setof(AttributeTypeValue);\n }),\n RDNSequence = asn.define(\"RDNSequence\", function () {\n this.seqof(RelativeDistinguishedName);\n }),\n Name = asn.define(\"Name\", function () {\n this.choice({\n rdnSequence: this.use(RDNSequence),\n });\n }),\n Validity = asn.define(\"Validity\", function () {\n this.seq().obj(this.key(\"notBefore\").use(Time), this.key(\"notAfter\").use(Time));\n }),\n Extension = asn.define(\"Extension\", function () {\n this.seq().obj(this.key(\"extnID\").objid(), this.key(\"critical\").bool().def(!1), this.key(\"extnValue\").octstr());\n }),\n TBSCertificate = asn.define(\"TBSCertificate\", function () {\n this.seq().obj(\n this.key(\"version\").explicit(0).int().optional(),\n this.key(\"serialNumber\").int(),\n this.key(\"signature\").use(AlgorithmIdentifier),\n this.key(\"issuer\").use(Name),\n this.key(\"validity\").use(Validity),\n this.key(\"subject\").use(Name),\n this.key(\"subjectPublicKeyInfo\").use(SubjectPublicKeyInfo),\n this.key(\"issuerUniqueID\").implicit(1).bitstr().optional(),\n this.key(\"subjectUniqueID\").implicit(2).bitstr().optional(),\n this.key(\"extensions\").explicit(3).seqof(Extension).optional(),\n );\n }),\n X509Certificate = asn.define(\"X509Certificate\", function () {\n this.seq().obj(\n this.key(\"tbsCertificate\").use(TBSCertificate),\n this.key(\"signatureAlgorithm\").use(AlgorithmIdentifier),\n this.key(\"signatureValue\").bitstr(),\n );\n });\n module.exports = X509Certificate;\n },\n});\n\n// node_modules/parse-asn1/asn1.js\nvar require_asn12 = __commonJS({\n \"node_modules/parse-asn1/asn1.js\"(exports) {\n \"use strict\";\n var asn1 = require_asn1();\n exports.certificate = require_certificate();\n var RSAPrivateKey = asn1.define(\"RSAPrivateKey\", function () {\n this.seq().obj(\n this.key(\"version\").int(),\n this.key(\"modulus\").int(),\n this.key(\"publicExponent\").int(),\n this.key(\"privateExponent\").int(),\n this.key(\"prime1\").int(),\n this.key(\"prime2\").int(),\n this.key(\"exponent1\").int(),\n this.key(\"exponent2\").int(),\n this.key(\"coefficient\").int(),\n );\n });\n exports.RSAPrivateKey = RSAPrivateKey;\n var RSAPublicKey = asn1.define(\"RSAPublicKey\", function () {\n this.seq().obj(this.key(\"modulus\").int(), this.key(\"publicExponent\").int());\n });\n exports.RSAPublicKey = RSAPublicKey;\n var PublicKey = asn1.define(\"SubjectPublicKeyInfo\", function () {\n this.seq().obj(this.key(\"algorithm\").use(AlgorithmIdentifier), this.key(\"subjectPublicKey\").bitstr());\n });\n exports.PublicKey = PublicKey;\n var AlgorithmIdentifier = asn1.define(\"AlgorithmIdentifier\", function () {\n this.seq().obj(\n this.key(\"algorithm\").objid(),\n this.key(\"none\").null_().optional(),\n this.key(\"curve\").objid().optional(),\n this.key(\"params\").seq().obj(this.key(\"p\").int(), this.key(\"q\").int(), this.key(\"g\").int()).optional(),\n );\n }),\n PrivateKeyInfo = asn1.define(\"PrivateKeyInfo\", function () {\n this.seq().obj(\n this.key(\"version\").int(),\n this.key(\"algorithm\").use(AlgorithmIdentifier),\n this.key(\"subjectPrivateKey\").octstr(),\n );\n });\n exports.PrivateKey = PrivateKeyInfo;\n var EncryptedPrivateKeyInfo = asn1.define(\"EncryptedPrivateKeyInfo\", function () {\n this.seq().obj(\n this.key(\"algorithm\")\n .seq()\n .obj(\n this.key(\"id\").objid(),\n this.key(\"decrypt\")\n .seq()\n .obj(\n this.key(\"kde\")\n .seq()\n .obj(\n this.key(\"id\").objid(),\n this.key(\"kdeparams\").seq().obj(this.key(\"salt\").octstr(), this.key(\"iters\").int()),\n ),\n this.key(\"cipher\").seq().obj(this.key(\"algo\").objid(), this.key(\"iv\").octstr()),\n ),\n ),\n this.key(\"subjectPrivateKey\").octstr(),\n );\n });\n exports.EncryptedPrivateKey = EncryptedPrivateKeyInfo;\n var DSAPrivateKey = asn1.define(\"DSAPrivateKey\", function () {\n this.seq().obj(\n this.key(\"version\").int(),\n this.key(\"p\").int(),\n this.key(\"q\").int(),\n this.key(\"g\").int(),\n this.key(\"pub_key\").int(),\n this.key(\"priv_key\").int(),\n );\n });\n exports.DSAPrivateKey = DSAPrivateKey;\n exports.DSAparam = asn1.define(\"DSAparam\", function () {\n this.int();\n });\n var ECPrivateKey = asn1.define(\"ECPrivateKey\", function () {\n this.seq().obj(\n this.key(\"version\").int(),\n this.key(\"privateKey\").octstr(),\n this.key(\"parameters\").optional().explicit(0).use(ECParameters),\n this.key(\"publicKey\").optional().explicit(1).bitstr(),\n );\n });\n exports.ECPrivateKey = ECPrivateKey;\n var ECParameters = asn1.define(\"ECParameters\", function () {\n this.choice({\n namedCurve: this.objid(),\n });\n });\n exports.signature = asn1.define(\"signature\", function () {\n this.seq().obj(this.key(\"r\").int(), this.key(\"s\").int());\n });\n },\n});\n\n// node_modules/parse-asn1/aesid.json\nvar require_aesid = __commonJS({\n \"node_modules/parse-asn1/aesid.json\"(exports, module) {\n module.exports = {\n \"2.16.840.1.101.3.4.1.1\": \"aes-128-ecb\",\n \"2.16.840.1.101.3.4.1.2\": \"aes-128-cbc\",\n \"2.16.840.1.101.3.4.1.3\": \"aes-128-ofb\",\n \"2.16.840.1.101.3.4.1.4\": \"aes-128-cfb\",\n \"2.16.840.1.101.3.4.1.21\": \"aes-192-ecb\",\n \"2.16.840.1.101.3.4.1.22\": \"aes-192-cbc\",\n \"2.16.840.1.101.3.4.1.23\": \"aes-192-ofb\",\n \"2.16.840.1.101.3.4.1.24\": \"aes-192-cfb\",\n \"2.16.840.1.101.3.4.1.41\": \"aes-256-ecb\",\n \"2.16.840.1.101.3.4.1.42\": \"aes-256-cbc\",\n \"2.16.840.1.101.3.4.1.43\": \"aes-256-ofb\",\n \"2.16.840.1.101.3.4.1.44\": \"aes-256-cfb\",\n };\n },\n});\n\n// node_modules/parse-asn1/fixProc.js\nvar require_fixProc = __commonJS({\n \"node_modules/parse-asn1/fixProc.js\"(exports, module) {\n var findProc =\n /Proc-Type: 4,ENCRYPTED[\\n\\r]+DEK-Info: AES-((?:128)|(?:192)|(?:256))-CBC,([0-9A-H]+)[\\n\\r]+([0-9A-z\\n\\r+/=]+)[\\n\\r]+/m,\n startRegex = /^-----BEGIN ((?:.*? KEY)|CERTIFICATE)-----/m,\n fullRegex = /^-----BEGIN ((?:.*? KEY)|CERTIFICATE)-----([0-9A-z\\n\\r+/=]+)-----END \\1-----$/m,\n evp = require_evp_bytestokey(),\n ciphers = require_browser5(),\n Buffer2 = require_safe_buffer().Buffer;\n module.exports = function (okey, password) {\n var key = okey.toString(),\n match = key.match(findProc),\n decrypted;\n if (match) {\n var suite = \"aes\" + match[1],\n iv = Buffer2.from(match[2], \"hex\"),\n cipherText = Buffer2.from(match[3].replace(/[\\r\\n]/g, \"\"), \"base64\"),\n cipherKey = evp(password, iv.slice(0, 8), parseInt(match[1], 10)).key,\n out = [],\n cipher = ciphers.createDecipheriv(suite, cipherKey, iv);\n out.push(cipher.update(cipherText)), out.push(cipher.final()), (decrypted = Buffer2.concat(out));\n } else {\n var match2 = key.match(fullRegex);\n decrypted = Buffer2.from(match2[2].replace(/[\\r\\n]/g, \"\"), \"base64\");\n }\n var tag = key.match(startRegex)[1];\n return {\n tag,\n data: decrypted,\n };\n };\n },\n});\n\n// node_modules/parse-asn1/index.js\nvar require_parse_asn1 = __commonJS({\n \"node_modules/parse-asn1/index.js\"(exports, module) {\n var asn1 = require_asn12(),\n aesid = require_aesid(),\n fixProc = require_fixProc(),\n ciphers = require_browser5(),\n compat = require_browser4(),\n Buffer2 = require_safe_buffer().Buffer;\n module.exports = parseKeys;\n function parseKeys(buffer) {\n var password;\n typeof buffer == \"object\" && !Buffer2.isBuffer(buffer) && ((password = buffer.passphrase), (buffer = buffer.key)),\n typeof buffer == \"string\" && (buffer = Buffer2.from(buffer));\n var stripped = fixProc(buffer, password),\n type = stripped.tag,\n data = stripped.data,\n subtype,\n ndata;\n switch (type) {\n case \"CERTIFICATE\":\n ndata = asn1.certificate.decode(data, \"der\").tbsCertificate.subjectPublicKeyInfo;\n case \"PUBLIC KEY\":\n switch (\n (ndata || (ndata = asn1.PublicKey.decode(data, \"der\")),\n (subtype = ndata.algorithm.algorithm.join(\".\")),\n subtype)\n ) {\n case \"1.2.840.113549.1.1.1\":\n return asn1.RSAPublicKey.decode(ndata.subjectPublicKey.data, \"der\");\n case \"1.2.840.10045.2.1\":\n return (\n (ndata.subjectPrivateKey = ndata.subjectPublicKey),\n {\n type: \"ec\",\n data: ndata,\n }\n );\n case \"1.2.840.10040.4.1\":\n return (\n (ndata.algorithm.params.pub_key = asn1.DSAparam.decode(ndata.subjectPublicKey.data, \"der\")),\n {\n type: \"dsa\",\n data: ndata.algorithm.params,\n }\n );\n default:\n throw new Error(\"unknown key id \" + subtype);\n }\n case \"ENCRYPTED PRIVATE KEY\":\n (data = asn1.EncryptedPrivateKey.decode(data, \"der\")), (data = decrypt(data, password));\n case \"PRIVATE KEY\":\n switch (\n ((ndata = asn1.PrivateKey.decode(data, \"der\")), (subtype = ndata.algorithm.algorithm.join(\".\")), subtype)\n ) {\n case \"1.2.840.113549.1.1.1\":\n return asn1.RSAPrivateKey.decode(ndata.subjectPrivateKey, \"der\");\n case \"1.2.840.10045.2.1\":\n return {\n curve: ndata.algorithm.curve,\n privateKey: asn1.ECPrivateKey.decode(ndata.subjectPrivateKey, \"der\").privateKey,\n };\n case \"1.2.840.10040.4.1\":\n return (\n (ndata.algorithm.params.priv_key = asn1.DSAparam.decode(ndata.subjectPrivateKey, \"der\")),\n {\n type: \"dsa\",\n params: ndata.algorithm.params,\n }\n );\n default:\n throw new Error(\"unknown key id \" + subtype);\n }\n case \"RSA PUBLIC KEY\":\n return asn1.RSAPublicKey.decode(data, \"der\");\n case \"RSA PRIVATE KEY\":\n return asn1.RSAPrivateKey.decode(data, \"der\");\n case \"DSA PRIVATE KEY\":\n return {\n type: \"dsa\",\n params: asn1.DSAPrivateKey.decode(data, \"der\"),\n };\n case \"EC PRIVATE KEY\":\n return (\n (data = asn1.ECPrivateKey.decode(data, \"der\")),\n {\n curve: data.parameters.value,\n privateKey: data.privateKey,\n }\n );\n default:\n throw new Error(\"unknown key type \" + type);\n }\n }\n parseKeys.signature = asn1.signature;\n function decrypt(data, password) {\n var salt = data.algorithm.decrypt.kde.kdeparams.salt,\n iters = parseInt(data.algorithm.decrypt.kde.kdeparams.iters.toString(), 10),\n algo = aesid[data.algorithm.decrypt.cipher.algo.join(\".\")],\n iv = data.algorithm.decrypt.cipher.iv,\n cipherText = data.subjectPrivateKey,\n keylen = parseInt(algo.split(\"-\")[1], 10) / 8,\n key = compat.pbkdf2Sync(password, salt, iters, keylen, \"sha1\"),\n cipher = ciphers.createDecipheriv(algo, key, iv),\n out = [];\n return out.push(cipher.update(cipherText)), out.push(cipher.final()), Buffer2.concat(out);\n }\n },\n});\n\n// node_modules/browserify-sign/browser/curves.json\nvar require_curves2 = __commonJS({\n \"node_modules/browserify-sign/browser/curves.json\"(exports, module) {\n module.exports = {\n \"1.3.132.0.10\": \"secp256k1\",\n \"1.3.132.0.33\": \"p224\",\n \"1.2.840.10045.3.1.1\": \"p192\",\n \"1.2.840.10045.3.1.7\": \"p256\",\n \"1.3.132.0.34\": \"p384\",\n \"1.3.132.0.35\": \"p521\",\n };\n },\n});\n\n// node_modules/browserify-sign/browser/sign.js\nvar require_sign = __commonJS({\n \"node_modules/browserify-sign/browser/sign.js\"(exports, module) {\n var Buffer2 = require_safe_buffer().Buffer,\n createHmac = require_browser3(),\n crt = require_browserify_rsa(),\n EC = require_elliptic().ec,\n BN = require_bn3(),\n parseKeys = require_parse_asn1(),\n curves = require_curves2();\n function sign(hash, key, hashType, signType, tag) {\n var priv = parseKeys(key);\n if (priv.curve) {\n if (signType !== \"ecdsa\" && signType !== \"ecdsa/rsa\") throw new Error(\"wrong private key type\");\n return ecSign(hash, priv);\n } else if (priv.type === \"dsa\") {\n if (signType !== \"dsa\") throw new Error(\"wrong private key type\");\n return dsaSign(hash, priv, hashType);\n } else if (signType !== \"rsa\" && signType !== \"ecdsa/rsa\") throw new Error(\"wrong private key type\");\n hash = Buffer2.concat([tag, hash]);\n for (var len = priv.modulus.byteLength(), pad = [0, 1]; hash.length + pad.length + 1 < len; ) pad.push(255);\n pad.push(0);\n for (var i = -1; ++i < hash.length; ) pad.push(hash[i]);\n var out = crt(pad, priv);\n return out;\n }\n function ecSign(hash, priv) {\n var curveId = curves[priv.curve.join(\".\")];\n if (!curveId) throw new Error(\"unknown curve \" + priv.curve.join(\".\"));\n var curve = new EC(curveId),\n key = curve.keyFromPrivate(priv.privateKey),\n out = key.sign(hash);\n return Buffer2.from(out.toDER());\n }\n function dsaSign(hash, priv, algo) {\n for (\n var x = priv.params.priv_key,\n p = priv.params.p,\n q = priv.params.q,\n g = priv.params.g,\n r = new BN(0),\n k,\n H = bits2int(hash, q).mod(q),\n s = !1,\n kv = getKey(x, q, hash, algo);\n s === !1;\n\n )\n (k = makeKey(q, kv, algo)),\n (r = makeR(g, k, p, q)),\n (s = k\n .invm(q)\n .imul(H.add(x.mul(r)))\n .mod(q)),\n s.cmpn(0) === 0 && ((s = !1), (r = new BN(0)));\n return toDER(r, s);\n }\n function toDER(r, s) {\n (r = r.toArray()), (s = s.toArray()), r[0] & 128 && (r = [0].concat(r)), s[0] & 128 && (s = [0].concat(s));\n var total = r.length + s.length + 4,\n res = [48, total, 2, r.length];\n return (res = res.concat(r, [2, s.length], s)), Buffer2.from(res);\n }\n function getKey(x, q, hash, algo) {\n if (((x = Buffer2.from(x.toArray())), x.length < q.byteLength())) {\n var zeros = Buffer2.alloc(q.byteLength() - x.length);\n x = Buffer2.concat([zeros, x]);\n }\n var hlen = hash.length,\n hbits = bits2octets(hash, q),\n v = Buffer2.alloc(hlen);\n v.fill(1);\n var k = Buffer2.alloc(hlen);\n return (\n (k = createHmac(algo, k)\n .update(v)\n .update(Buffer2.from([0]))\n .update(x)\n .update(hbits)\n .digest()),\n (v = createHmac(algo, k).update(v).digest()),\n (k = createHmac(algo, k)\n .update(v)\n .update(Buffer2.from([1]))\n .update(x)\n .update(hbits)\n .digest()),\n (v = createHmac(algo, k).update(v).digest()),\n { k, v }\n );\n }\n function bits2int(obits, q) {\n var bits = new BN(obits),\n shift = (obits.length << 3) - q.bitLength();\n return shift > 0 && bits.ishrn(shift), bits;\n }\n function bits2octets(bits, q) {\n (bits = bits2int(bits, q)), (bits = bits.mod(q));\n var out = Buffer2.from(bits.toArray());\n if (out.length < q.byteLength()) {\n var zeros = Buffer2.alloc(q.byteLength() - out.length);\n out = Buffer2.concat([zeros, out]);\n }\n return out;\n }\n function makeKey(q, kv, algo) {\n var t, k;\n do {\n for (t = Buffer2.alloc(0); t.length * 8 < q.bitLength(); )\n (kv.v = createHmac(algo, kv.k).update(kv.v).digest()), (t = Buffer2.concat([t, kv.v]));\n (k = bits2int(t, q)),\n (kv.k = createHmac(algo, kv.k)\n .update(kv.v)\n .update(Buffer2.from([0]))\n .digest()),\n (kv.v = createHmac(algo, kv.k).update(kv.v).digest());\n } while (k.cmp(q) !== -1);\n return k;\n }\n function makeR(g, k, p, q) {\n return g.toRed(BN.mont(p)).redPow(k).fromRed().mod(q);\n }\n module.exports = sign;\n module.exports.getKey = getKey;\n module.exports.makeKey = makeKey;\n },\n});\n\n// node_modules/browserify-sign/browser/verify.js\nvar require_verify = __commonJS({\n \"node_modules/browserify-sign/browser/verify.js\"(exports, module) {\n var Buffer2 = require_safe_buffer().Buffer,\n BN = require_bn3(),\n EC = require_elliptic().ec,\n parseKeys = require_parse_asn1(),\n curves = require_curves2();\n function verify(sig, hash, key, signType, tag) {\n var pub = parseKeys(key);\n if (pub.type === \"ec\") {\n if (signType !== \"ecdsa\" && signType !== \"ecdsa/rsa\") throw new Error(\"wrong public key type\");\n return ecVerify(sig, hash, pub);\n } else if (pub.type === \"dsa\") {\n if (signType !== \"dsa\") throw new Error(\"wrong public key type\");\n return dsaVerify(sig, hash, pub);\n } else if (signType !== \"rsa\" && signType !== \"ecdsa/rsa\") throw new Error(\"wrong public key type\");\n hash = Buffer2.concat([tag, hash]);\n for (var len = pub.modulus.byteLength(), pad = [1], padNum = 0; hash.length + pad.length + 2 < len; )\n pad.push(255), padNum++;\n pad.push(0);\n for (var i = -1; ++i < hash.length; ) pad.push(hash[i]);\n pad = Buffer2.from(pad);\n var red = BN.mont(pub.modulus);\n (sig = new BN(sig).toRed(red)),\n (sig = sig.redPow(new BN(pub.publicExponent))),\n (sig = Buffer2.from(sig.fromRed().toArray()));\n var out = padNum < 8 ? 1 : 0;\n for (len = Math.min(sig.length, pad.length), sig.length !== pad.length && (out = 1), i = -1; ++i < len; )\n out |= sig[i] ^ pad[i];\n return out === 0;\n }\n function ecVerify(sig, hash, pub) {\n var curveId = curves[pub.data.algorithm.curve.join(\".\")];\n if (!curveId) throw new Error(\"unknown curve \" + pub.data.algorithm.curve.join(\".\"));\n var curve = new EC(curveId),\n pubkey = pub.data.subjectPrivateKey.data;\n return curve.verify(hash, sig, pubkey);\n }\n function dsaVerify(sig, hash, pub) {\n var p = pub.data.p,\n q = pub.data.q,\n g = pub.data.g,\n y = pub.data.pub_key,\n unpacked = parseKeys.signature.decode(sig, \"der\"),\n s = unpacked.s,\n r = unpacked.r;\n checkValue(s, q), checkValue(r, q);\n var montp = BN.mont(p),\n w = s.invm(q),\n v = g\n .toRed(montp)\n .redPow(new BN(hash).mul(w).mod(q))\n .fromRed()\n .mul(y.toRed(montp).redPow(r.mul(w).mod(q)).fromRed())\n .mod(p)\n .mod(q);\n return v.cmp(r) === 0;\n }\n function checkValue(b, q) {\n if (b.cmpn(0) <= 0) throw new Error(\"invalid sig\");\n if (b.cmp(q) >= q) throw new Error(\"invalid sig\");\n }\n module.exports = verify;\n },\n});\n\n// node_modules/browserify-sign/browser/index.js\nvar require_browser8 = __commonJS({\n \"node_modules/browserify-sign/browser/index.js\"(exports, module) {\n var Buffer2 = require_safe_buffer().Buffer,\n createHash = require_browser2(),\n stream = __require(\"readable-stream\"),\n inherits = require_inherits_browser(),\n sign = require_sign(),\n verify = require_verify(),\n algorithms = require_algorithms();\n Object.keys(algorithms).forEach(function (key) {\n (algorithms[key].id = Buffer2.from(algorithms[key].id, \"hex\")), (algorithms[key.toLowerCase()] = algorithms[key]);\n });\n function Sign(algorithm) {\n stream.Writable.call(this);\n var data = algorithms[algorithm];\n if (!data) throw new Error(\"Unknown message digest\");\n (this._hashType = data.hash),\n (this._hash = createHash(data.hash)),\n (this._tag = data.id),\n (this._signType = data.sign);\n }\n inherits(Sign, stream.Writable);\n Sign.prototype._write = function (data, _, done) {\n this._hash.update(data), done();\n };\n Sign.prototype.update = function (data, enc) {\n return typeof data == \"string\" && (data = Buffer2.from(data, enc)), this._hash.update(data), this;\n };\n Sign.prototype.sign = function (key, enc) {\n this.end();\n var hash = this._hash.digest(),\n sig = sign(hash, key, this._hashType, this._signType, this._tag);\n return enc ? sig.toString(enc) : sig;\n };\n function Verify(algorithm) {\n stream.Writable.call(this);\n var data = algorithms[algorithm];\n if (!data) throw new Error(\"Unknown message digest\");\n (this._hash = createHash(data.hash)), (this._tag = data.id), (this._signType = data.sign);\n }\n inherits(Verify, stream.Writable);\n Verify.prototype._write = function (data, _, done) {\n this._hash.update(data), done();\n };\n Verify.prototype.update = function (data, enc) {\n return typeof data == \"string\" && (data = Buffer2.from(data, enc)), this._hash.update(data), this;\n };\n Verify.prototype.verify = function (key, sig, enc) {\n typeof sig == \"string\" && (sig = Buffer2.from(sig, enc)), this.end();\n var hash = this._hash.digest();\n return verify(sig, hash, key, this._signType, this._tag);\n };\n function createSign(algorithm) {\n return new Sign(algorithm);\n }\n function createVerify(algorithm) {\n return new Verify(algorithm);\n }\n module.exports = {\n Sign: createSign,\n Verify: createVerify,\n createSign,\n createVerify,\n };\n },\n});\n\n// node_modules/create-ecdh/node_modules/bn.js/lib/bn.js\nvar require_bn6 = __commonJS({\n \"node_modules/create-ecdh/node_modules/bn.js/lib/bn.js\"(exports, module) {\n (function (module2, exports2) {\n \"use strict\";\n function assert(val, msg) {\n if (!val) throw new Error(msg || \"Assertion failed\");\n }\n function inherits(ctor, superCtor) {\n ctor.super_ = superCtor;\n var TempCtor = function () {};\n (TempCtor.prototype = superCtor.prototype),\n (ctor.prototype = new TempCtor()),\n (ctor.prototype.constructor = ctor);\n }\n function BN(number, base, endian) {\n if (BN.isBN(number)) return number;\n (this.negative = 0),\n (this.words = null),\n (this.length = 0),\n (this.red = null),\n number !== null &&\n ((base === \"le\" || base === \"be\") && ((endian = base), (base = 10)),\n this._init(number || 0, base || 10, endian || \"be\"));\n }\n typeof module2 == \"object\" ? (module2.exports = BN) : (exports2.BN = BN), (BN.BN = BN), (BN.wordSize = 26);\n var Buffer2;\n try {\n typeof window < \"u\" && typeof window.Buffer < \"u\"\n ? (Buffer2 = window.Buffer)\n : (Buffer2 = __require(\"buffer\").Buffer);\n } catch {}\n (BN.isBN = function (num) {\n return num instanceof BN\n ? !0\n : num !== null &&\n typeof num == \"object\" &&\n num.constructor.wordSize === BN.wordSize &&\n Array.isArray(num.words);\n }),\n (BN.max = function (left, right) {\n return left.cmp(right) > 0 ? left : right;\n }),\n (BN.min = function (left, right) {\n return left.cmp(right) < 0 ? left : right;\n }),\n (BN.prototype._init = function (number, base, endian) {\n if (typeof number == \"number\") return this._initNumber(number, base, endian);\n if (typeof number == \"object\") return this._initArray(number, base, endian);\n base === \"hex\" && (base = 16),\n assert(base === (base | 0) && base >= 2 && base <= 36),\n (number = number.toString().replace(/\\s+/g, \"\"));\n var start = 0;\n number[0] === \"-\" && (start++, (this.negative = 1)),\n start < number.length &&\n (base === 16\n ? this._parseHex(number, start, endian)\n : (this._parseBase(number, base, start),\n endian === \"le\" && this._initArray(this.toArray(), base, endian)));\n }),\n (BN.prototype._initNumber = function (number, base, endian) {\n number < 0 && ((this.negative = 1), (number = -number)),\n number < 67108864\n ? ((this.words = [number & 67108863]), (this.length = 1))\n : number < 4503599627370496\n ? ((this.words = [number & 67108863, (number / 67108864) & 67108863]), (this.length = 2))\n : (assert(number < 9007199254740992),\n (this.words = [number & 67108863, (number / 67108864) & 67108863, 1]),\n (this.length = 3)),\n endian === \"le\" && this._initArray(this.toArray(), base, endian);\n }),\n (BN.prototype._initArray = function (number, base, endian) {\n if ((assert(typeof number.length == \"number\"), number.length <= 0))\n return (this.words = [0]), (this.length = 1), this;\n (this.length = Math.ceil(number.length / 3)), (this.words = new Array(this.length));\n for (var i = 0; i < this.length; i++) this.words[i] = 0;\n var j,\n w,\n off = 0;\n if (endian === \"be\")\n for (i = number.length - 1, j = 0; i >= 0; i -= 3)\n (w = number[i] | (number[i - 1] << 8) | (number[i - 2] << 16)),\n (this.words[j] |= (w << off) & 67108863),\n (this.words[j + 1] = (w >>> (26 - off)) & 67108863),\n (off += 24),\n off >= 26 && ((off -= 26), j++);\n else if (endian === \"le\")\n for (i = 0, j = 0; i < number.length; i += 3)\n (w = number[i] | (number[i + 1] << 8) | (number[i + 2] << 16)),\n (this.words[j] |= (w << off) & 67108863),\n (this.words[j + 1] = (w >>> (26 - off)) & 67108863),\n (off += 24),\n off >= 26 && ((off -= 26), j++);\n return this.strip();\n });\n function parseHex4Bits(string, index) {\n var c = string.charCodeAt(index);\n return c >= 65 && c <= 70 ? c - 55 : c >= 97 && c <= 102 ? c - 87 : (c - 48) & 15;\n }\n function parseHexByte(string, lowerBound, index) {\n var r = parseHex4Bits(string, index);\n return index - 1 >= lowerBound && (r |= parseHex4Bits(string, index - 1) << 4), r;\n }\n BN.prototype._parseHex = function (number, start, endian) {\n (this.length = Math.ceil((number.length - start) / 6)), (this.words = new Array(this.length));\n for (var i = 0; i < this.length; i++) this.words[i] = 0;\n var off = 0,\n j = 0,\n w;\n if (endian === \"be\")\n for (i = number.length - 1; i >= start; i -= 2)\n (w = parseHexByte(number, start, i) << off),\n (this.words[j] |= w & 67108863),\n off >= 18 ? ((off -= 18), (j += 1), (this.words[j] |= w >>> 26)) : (off += 8);\n else {\n var parseLength = number.length - start;\n for (i = parseLength % 2 === 0 ? start + 1 : start; i < number.length; i += 2)\n (w = parseHexByte(number, start, i) << off),\n (this.words[j] |= w & 67108863),\n off >= 18 ? ((off -= 18), (j += 1), (this.words[j] |= w >>> 26)) : (off += 8);\n }\n this.strip();\n };\n function parseBase(str, start, end, mul) {\n for (var r = 0, len = Math.min(str.length, end), i = start; i < len; i++) {\n var c = str.charCodeAt(i) - 48;\n (r *= mul), c >= 49 ? (r += c - 49 + 10) : c >= 17 ? (r += c - 17 + 10) : (r += c);\n }\n return r;\n }\n (BN.prototype._parseBase = function (number, base, start) {\n (this.words = [0]), (this.length = 1);\n for (var limbLen = 0, limbPow = 1; limbPow <= 67108863; limbPow *= base) limbLen++;\n limbLen--, (limbPow = (limbPow / base) | 0);\n for (\n var total = number.length - start,\n mod = total % limbLen,\n end = Math.min(total, total - mod) + start,\n word = 0,\n i = start;\n i < end;\n i += limbLen\n )\n (word = parseBase(number, i, i + limbLen, base)),\n this.imuln(limbPow),\n this.words[0] + word < 67108864 ? (this.words[0] += word) : this._iaddn(word);\n if (mod !== 0) {\n var pow = 1;\n for (word = parseBase(number, i, number.length, base), i = 0; i < mod; i++) pow *= base;\n this.imuln(pow), this.words[0] + word < 67108864 ? (this.words[0] += word) : this._iaddn(word);\n }\n this.strip();\n }),\n (BN.prototype.copy = function (dest) {\n dest.words = new Array(this.length);\n for (var i = 0; i < this.length; i++) dest.words[i] = this.words[i];\n (dest.length = this.length), (dest.negative = this.negative), (dest.red = this.red);\n }),\n (BN.prototype.clone = function () {\n var r = new BN(null);\n return this.copy(r), r;\n }),\n (BN.prototype._expand = function (size) {\n for (; this.length < size; ) this.words[this.length++] = 0;\n return this;\n }),\n (BN.prototype.strip = function () {\n for (; this.length > 1 && this.words[this.length - 1] === 0; ) this.length--;\n return this._normSign();\n }),\n (BN.prototype._normSign = function () {\n return this.length === 1 && this.words[0] === 0 && (this.negative = 0), this;\n }),\n (BN.prototype.inspect = function () {\n return (this.red ? \"<BN-R: \" : \"<BN: \") + this.toString(16) + \">\";\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 groupSizes = [\n 0, 0, 25, 16, 12, 11, 10, 9, 8, 8, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5,\n 5, 5,\n ],\n groupBases = [\n 0, 0, 33554432, 43046721, 16777216, 48828125, 60466176, 40353607, 16777216, 43046721, 1e7, 19487171, 35831808,\n 62748517, 7529536, 11390625, 16777216, 24137569, 34012224, 47045881, 64e6, 4084101, 5153632, 6436343, 7962624,\n 9765625, 11881376, 14348907, 17210368, 20511149, 243e5, 28629151, 33554432, 39135393, 45435424, 52521875,\n 60466176,\n ];\n (BN.prototype.toString = function (base, padding) {\n (base = base || 10), (padding = padding | 0 || 1);\n var out;\n if (base === 16 || base === \"hex\") {\n out = \"\";\n for (var off = 0, carry = 0, i = 0; i < this.length; i++) {\n var w = this.words[i],\n word = (((w << off) | carry) & 16777215).toString(16);\n (carry = (w >>> (24 - off)) & 16777215),\n carry !== 0 || i !== this.length - 1 ? (out = zeros[6 - word.length] + word + out) : (out = word + out),\n (off += 2),\n off >= 26 && ((off -= 26), i--);\n }\n for (carry !== 0 && (out = carry.toString(16) + out); out.length % padding !== 0; ) out = \"0\" + out;\n return this.negative !== 0 && (out = \"-\" + out), out;\n }\n if (base === (base | 0) && base >= 2 && base <= 36) {\n var groupSize = groupSizes[base],\n groupBase = groupBases[base];\n out = \"\";\n var c = this.clone();\n for (c.negative = 0; !c.isZero(); ) {\n var r = c.modn(groupBase).toString(base);\n (c = c.idivn(groupBase)), c.isZero() ? (out = r + out) : (out = zeros[groupSize - r.length] + r + out);\n }\n for (this.isZero() && (out = \"0\" + out); out.length % padding !== 0; ) out = \"0\" + out;\n return this.negative !== 0 && (out = \"-\" + out), out;\n }\n assert(!1, \"Base should be between 2 and 36\");\n }),\n (BN.prototype.toNumber = function () {\n var ret = this.words[0];\n return (\n this.length === 2\n ? (ret += this.words[1] * 67108864)\n : this.length === 3 && this.words[2] === 1\n ? (ret += 4503599627370496 + this.words[1] * 67108864)\n : this.length > 2 && assert(!1, \"Number can only safely store up to 53 bits\"),\n this.negative !== 0 ? -ret : ret\n );\n }),\n (BN.prototype.toJSON = function () {\n return this.toString(16);\n }),\n (BN.prototype.toBuffer = function (endian, length) {\n return assert(typeof Buffer2 < \"u\"), this.toArrayLike(Buffer2, endian, length);\n }),\n (BN.prototype.toArray = function (endian, length) {\n return this.toArrayLike(Array, endian, length);\n }),\n (BN.prototype.toArrayLike = function (ArrayType, endian, length) {\n var byteLength = this.byteLength(),\n 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 this.strip();\n var littleEndian = endian === \"le\",\n res = new ArrayType(reqLength),\n b,\n i,\n q = this.clone();\n if (littleEndian) {\n for (i = 0; !q.isZero(); i++) (b = q.andln(255)), q.iushrn(8), (res[i] = b);\n for (; i < reqLength; i++) res[i] = 0;\n } else {\n for (i = 0; i < reqLength - byteLength; i++) res[i] = 0;\n for (i = 0; !q.isZero(); i++) (b = q.andln(255)), q.iushrn(8), (res[reqLength - i - 1] = b);\n }\n return res;\n }),\n Math.clz32\n ? (BN.prototype._countBits = function (w) {\n return 32 - Math.clz32(w);\n })\n : (BN.prototype._countBits = function (w) {\n var t = w,\n r = 0;\n return (\n t >= 4096 && ((r += 13), (t >>>= 13)),\n t >= 64 && ((r += 7), (t >>>= 7)),\n t >= 8 && ((r += 4), (t >>>= 4)),\n t >= 2 && ((r += 2), (t >>>= 2)),\n r + t\n );\n }),\n (BN.prototype._zeroBits = function (w) {\n if (w === 0) return 26;\n var t = w,\n r = 0;\n return (\n (t & 8191) === 0 && ((r += 13), (t >>>= 13)),\n (t & 127) === 0 && ((r += 7), (t >>>= 7)),\n (t & 15) === 0 && ((r += 4), (t >>>= 4)),\n (t & 3) === 0 && ((r += 2), (t >>>= 2)),\n (t & 1) === 0 && r++,\n r\n );\n }),\n (BN.prototype.bitLength = function () {\n var w = this.words[this.length - 1],\n hi = this._countBits(w);\n return (this.length - 1) * 26 + hi;\n });\n function toBitArray(num) {\n for (var w = new Array(num.bitLength()), bit = 0; bit < w.length; bit++) {\n var off = (bit / 26) | 0,\n wbit = bit % 26;\n w[bit] = (num.words[off] & (1 << wbit)) >>> wbit;\n }\n return w;\n }\n (BN.prototype.zeroBits = function () {\n if (this.isZero()) return 0;\n for (var r = 0, i = 0; i < this.length; i++) {\n var b = this._zeroBits(this.words[i]);\n if (((r += b), b !== 26)) break;\n }\n return r;\n }),\n (BN.prototype.byteLength = function () {\n return Math.ceil(this.bitLength() / 8);\n }),\n (BN.prototype.toTwos = function (width) {\n return this.negative !== 0 ? this.abs().inotn(width).iaddn(1) : this.clone();\n }),\n (BN.prototype.fromTwos = function (width) {\n return this.testn(width - 1) ? this.notn(width).iaddn(1).ineg() : this.clone();\n }),\n (BN.prototype.isNeg = function () {\n return this.negative !== 0;\n }),\n (BN.prototype.neg = function () {\n return this.clone().ineg();\n }),\n (BN.prototype.ineg = function () {\n return this.isZero() || (this.negative ^= 1), this;\n }),\n (BN.prototype.iuor = function (num) {\n for (; this.length < num.length; ) this.words[this.length++] = 0;\n for (var i = 0; i < num.length; i++) this.words[i] = this.words[i] | num.words[i];\n return this.strip();\n }),\n (BN.prototype.ior = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuor(num);\n }),\n (BN.prototype.or = function (num) {\n return this.length > num.length ? this.clone().ior(num) : num.clone().ior(this);\n }),\n (BN.prototype.uor = function (num) {\n return this.length > num.length ? this.clone().iuor(num) : num.clone().iuor(this);\n }),\n (BN.prototype.iuand = function (num) {\n var b;\n this.length > num.length ? (b = num) : (b = this);\n for (var i = 0; i < b.length; i++) this.words[i] = this.words[i] & num.words[i];\n return (this.length = b.length), this.strip();\n }),\n (BN.prototype.iand = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuand(num);\n }),\n (BN.prototype.and = function (num) {\n return this.length > num.length ? this.clone().iand(num) : num.clone().iand(this);\n }),\n (BN.prototype.uand = function (num) {\n return this.length > num.length ? this.clone().iuand(num) : num.clone().iuand(this);\n }),\n (BN.prototype.iuxor = function (num) {\n var a, b;\n this.length > num.length ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var i = 0; i < b.length; i++) this.words[i] = a.words[i] ^ b.words[i];\n if (this !== a) for (; i < a.length; i++) this.words[i] = a.words[i];\n return (this.length = a.length), this.strip();\n }),\n (BN.prototype.ixor = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuxor(num);\n }),\n (BN.prototype.xor = function (num) {\n return this.length > num.length ? this.clone().ixor(num) : num.clone().ixor(this);\n }),\n (BN.prototype.uxor = function (num) {\n return this.length > num.length ? this.clone().iuxor(num) : num.clone().iuxor(this);\n }),\n (BN.prototype.inotn = function (width) {\n assert(typeof width == \"number\" && width >= 0);\n var bytesNeeded = Math.ceil(width / 26) | 0,\n bitsLeft = width % 26;\n this._expand(bytesNeeded), bitsLeft > 0 && bytesNeeded--;\n for (var i = 0; i < bytesNeeded; i++) this.words[i] = ~this.words[i] & 67108863;\n return bitsLeft > 0 && (this.words[i] = ~this.words[i] & (67108863 >> (26 - bitsLeft))), this.strip();\n }),\n (BN.prototype.notn = function (width) {\n return this.clone().inotn(width);\n }),\n (BN.prototype.setn = function (bit, val) {\n assert(typeof bit == \"number\" && bit >= 0);\n var off = (bit / 26) | 0,\n wbit = bit % 26;\n return (\n this._expand(off + 1),\n val\n ? (this.words[off] = this.words[off] | (1 << wbit))\n : (this.words[off] = this.words[off] & ~(1 << wbit)),\n this.strip()\n );\n }),\n (BN.prototype.iadd = function (num) {\n var r;\n if (this.negative !== 0 && num.negative === 0)\n return (this.negative = 0), (r = this.isub(num)), (this.negative ^= 1), this._normSign();\n if (this.negative === 0 && num.negative !== 0)\n return (num.negative = 0), (r = this.isub(num)), (num.negative = 1), r._normSign();\n var a, b;\n this.length > num.length ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var carry = 0, i = 0; i < b.length; i++)\n (r = (a.words[i] | 0) + (b.words[i] | 0) + carry), (this.words[i] = r & 67108863), (carry = r >>> 26);\n for (; carry !== 0 && i < a.length; i++)\n (r = (a.words[i] | 0) + carry), (this.words[i] = r & 67108863), (carry = r >>> 26);\n if (((this.length = a.length), carry !== 0)) (this.words[this.length] = carry), this.length++;\n else if (a !== this) for (; i < a.length; i++) this.words[i] = a.words[i];\n return this;\n }),\n (BN.prototype.add = function (num) {\n var res;\n return num.negative !== 0 && this.negative === 0\n ? ((num.negative = 0), (res = this.sub(num)), (num.negative ^= 1), res)\n : num.negative === 0 && this.negative !== 0\n ? ((this.negative = 0), (res = num.sub(this)), (this.negative = 1), res)\n : this.length > num.length\n ? this.clone().iadd(num)\n : num.clone().iadd(this);\n }),\n (BN.prototype.isub = function (num) {\n if (num.negative !== 0) {\n num.negative = 0;\n var r = this.iadd(num);\n return (num.negative = 1), r._normSign();\n } else if (this.negative !== 0)\n return (this.negative = 0), this.iadd(num), (this.negative = 1), this._normSign();\n var cmp = this.cmp(num);\n if (cmp === 0) return (this.negative = 0), (this.length = 1), (this.words[0] = 0), this;\n var a, b;\n cmp > 0 ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var carry = 0, i = 0; i < b.length; i++)\n (r = (a.words[i] | 0) - (b.words[i] | 0) + carry), (carry = r >> 26), (this.words[i] = r & 67108863);\n for (; carry !== 0 && i < a.length; i++)\n (r = (a.words[i] | 0) + carry), (carry = r >> 26), (this.words[i] = r & 67108863);\n if (carry === 0 && i < a.length && a !== this) for (; i < a.length; i++) this.words[i] = a.words[i];\n return (this.length = Math.max(this.length, i)), a !== this && (this.negative = 1), this.strip();\n }),\n (BN.prototype.sub = function (num) {\n return this.clone().isub(num);\n });\n function smallMulTo(self2, num, out) {\n out.negative = num.negative ^ self2.negative;\n var len = (self2.length + num.length) | 0;\n (out.length = len), (len = (len - 1) | 0);\n var a = self2.words[0] | 0,\n b = num.words[0] | 0,\n r = a * b,\n lo = r & 67108863,\n carry = (r / 67108864) | 0;\n out.words[0] = lo;\n for (var k = 1; k < len; k++) {\n for (\n var ncarry = carry >>> 26,\n rword = carry & 67108863,\n maxJ = Math.min(k, num.length - 1),\n j = Math.max(0, k - self2.length + 1);\n j <= maxJ;\n j++\n ) {\n var i = (k - j) | 0;\n (a = self2.words[i] | 0),\n (b = num.words[j] | 0),\n (r = a * b + rword),\n (ncarry += (r / 67108864) | 0),\n (rword = r & 67108863);\n }\n (out.words[k] = rword | 0), (carry = ncarry | 0);\n }\n return carry !== 0 ? (out.words[k] = carry | 0) : out.length--, out.strip();\n }\n var comb10MulTo = function (self2, num, out) {\n var a = self2.words,\n b = num.words,\n o = out.words,\n c = 0,\n lo,\n mid,\n hi,\n a0 = a[0] | 0,\n al0 = a0 & 8191,\n ah0 = a0 >>> 13,\n a1 = a[1] | 0,\n al1 = a1 & 8191,\n ah1 = a1 >>> 13,\n a2 = a[2] | 0,\n al2 = a2 & 8191,\n ah2 = a2 >>> 13,\n a3 = a[3] | 0,\n al3 = a3 & 8191,\n ah3 = a3 >>> 13,\n a4 = a[4] | 0,\n al4 = a4 & 8191,\n ah4 = a4 >>> 13,\n a5 = a[5] | 0,\n al5 = a5 & 8191,\n ah5 = a5 >>> 13,\n a6 = a[6] | 0,\n al6 = a6 & 8191,\n ah6 = a6 >>> 13,\n a7 = a[7] | 0,\n al7 = a7 & 8191,\n ah7 = a7 >>> 13,\n a8 = a[8] | 0,\n al8 = a8 & 8191,\n ah8 = a8 >>> 13,\n a9 = a[9] | 0,\n al9 = a9 & 8191,\n ah9 = a9 >>> 13,\n b0 = b[0] | 0,\n bl0 = b0 & 8191,\n bh0 = b0 >>> 13,\n b1 = b[1] | 0,\n bl1 = b1 & 8191,\n bh1 = b1 >>> 13,\n b2 = b[2] | 0,\n bl2 = b2 & 8191,\n bh2 = b2 >>> 13,\n b3 = b[3] | 0,\n bl3 = b3 & 8191,\n bh3 = b3 >>> 13,\n b4 = b[4] | 0,\n bl4 = b4 & 8191,\n bh4 = b4 >>> 13,\n b5 = b[5] | 0,\n bl5 = b5 & 8191,\n bh5 = b5 >>> 13,\n b6 = b[6] | 0,\n bl6 = b6 & 8191,\n bh6 = b6 >>> 13,\n b7 = b[7] | 0,\n bl7 = b7 & 8191,\n bh7 = b7 >>> 13,\n b8 = b[8] | 0,\n bl8 = b8 & 8191,\n bh8 = b8 >>> 13,\n b9 = b[9] | 0,\n bl9 = b9 & 8191,\n bh9 = b9 >>> 13;\n (out.negative = self2.negative ^ num.negative),\n (out.length = 19),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w0 >>> 26)) | 0),\n (w0 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w1 >>> 26)) | 0),\n (w1 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w2 >>> 26)) | 0),\n (w2 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w3 >>> 26)) | 0),\n (w3 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w4 >>> 26)) | 0),\n (w4 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w5 >>> 26)) | 0),\n (w5 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w6 >>> 26)) | 0),\n (w6 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w7 >>> 26)) | 0),\n (w7 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w8 >>> 26)) | 0),\n (w8 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w9 >>> 26)) | 0),\n (w9 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w10 >>> 26)) | 0),\n (w10 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w11 >>> 26)) | 0),\n (w11 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w12 >>> 26)) | 0),\n (w12 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w13 >>> 26)) | 0),\n (w13 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w14 >>> 26)) | 0),\n (w14 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w15 >>> 26)) | 0),\n (w15 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w16 >>> 26)) | 0),\n (w16 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w17 >>> 26)) | 0),\n (w17 &= 67108863),\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 & 8191) << 13)) | 0;\n return (\n (c = (((hi + (mid >>> 13)) | 0) + (w18 >>> 26)) | 0),\n (w18 &= 67108863),\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 c !== 0 && ((o[19] = c), out.length++),\n out\n );\n };\n Math.imul || (comb10MulTo = smallMulTo);\n function bigMulTo(self2, num, out) {\n (out.negative = num.negative ^ self2.negative), (out.length = self2.length + num.length);\n for (var carry = 0, hncarry = 0, k = 0; k < out.length - 1; k++) {\n var ncarry = hncarry;\n hncarry = 0;\n for (\n var rword = carry & 67108863, maxJ = Math.min(k, num.length - 1), j = Math.max(0, k - self2.length + 1);\n j <= maxJ;\n j++\n ) {\n var i = k - j,\n a = self2.words[i] | 0,\n b = num.words[j] | 0,\n r = a * b,\n lo = r & 67108863;\n (ncarry = (ncarry + ((r / 67108864) | 0)) | 0),\n (lo = (lo + rword) | 0),\n (rword = lo & 67108863),\n (ncarry = (ncarry + (lo >>> 26)) | 0),\n (hncarry += ncarry >>> 26),\n (ncarry &= 67108863);\n }\n (out.words[k] = rword), (carry = ncarry), (ncarry = hncarry);\n }\n return carry !== 0 ? (out.words[k] = carry) : out.length--, out.strip();\n }\n function jumboMulTo(self2, num, out) {\n var fftm = new FFTM();\n return fftm.mulp(self2, num, out);\n }\n BN.prototype.mulTo = function (num, out) {\n var res,\n len = this.length + num.length;\n return (\n this.length === 10 && num.length === 10\n ? (res = comb10MulTo(this, num, out))\n : len < 63\n ? (res = smallMulTo(this, num, out))\n : len < 1024\n ? (res = bigMulTo(this, num, out))\n : (res = jumboMulTo(this, num, out)),\n res\n );\n };\n function FFTM(x, y) {\n (this.x = x), (this.y = y);\n }\n (FFTM.prototype.makeRBT = function (N) {\n for (var t = new Array(N), l = BN.prototype._countBits(N) - 1, i = 0; i < N; i++) t[i] = this.revBin(i, l, N);\n return t;\n }),\n (FFTM.prototype.revBin = function (x, l, N) {\n if (x === 0 || x === N - 1) return x;\n for (var rb = 0, i = 0; i < l; i++) (rb |= (x & 1) << (l - i - 1)), (x >>= 1);\n return rb;\n }),\n (FFTM.prototype.permute = function (rbt, rws, iws, rtws, itws, N) {\n for (var i = 0; i < N; i++) (rtws[i] = rws[rbt[i]]), (itws[i] = iws[rbt[i]]);\n }),\n (FFTM.prototype.transform = function (rws, iws, rtws, itws, N, rbt) {\n this.permute(rbt, rws, iws, rtws, itws, N);\n for (var s = 1; s < N; s <<= 1)\n for (\n var l = s << 1, rtwdf = Math.cos((2 * Math.PI) / l), itwdf = Math.sin((2 * Math.PI) / l), p = 0;\n p < N;\n p += l\n )\n for (var rtwdf_ = rtwdf, itwdf_ = itwdf, j = 0; j < s; j++) {\n var re = rtws[p + j],\n ie = itws[p + j],\n ro = rtws[p + j + s],\n io = itws[p + j + s],\n rx = rtwdf_ * ro - itwdf_ * io;\n (io = rtwdf_ * io + itwdf_ * ro),\n (ro = rx),\n (rtws[p + j] = re + ro),\n (itws[p + j] = ie + io),\n (rtws[p + j + s] = re - ro),\n (itws[p + j + s] = ie - io),\n j !== l &&\n ((rx = rtwdf * rtwdf_ - itwdf * itwdf_), (itwdf_ = rtwdf * itwdf_ + itwdf * rtwdf_), (rtwdf_ = rx));\n }\n }),\n (FFTM.prototype.guessLen13b = function (n, m) {\n var N = Math.max(m, n) | 1,\n odd = N & 1,\n i = 0;\n for (N = (N / 2) | 0; N; N = N >>> 1) i++;\n return 1 << (i + 1 + odd);\n }),\n (FFTM.prototype.conjugate = function (rws, iws, N) {\n if (!(N <= 1))\n for (var i = 0; i < N / 2; i++) {\n var t = rws[i];\n (rws[i] = rws[N - i - 1]),\n (rws[N - i - 1] = t),\n (t = iws[i]),\n (iws[i] = -iws[N - i - 1]),\n (iws[N - i - 1] = -t);\n }\n }),\n (FFTM.prototype.normalize13b = function (ws, N) {\n for (var carry = 0, i = 0; i < N / 2; i++) {\n var w = Math.round(ws[2 * i + 1] / N) * 8192 + Math.round(ws[2 * i] / N) + carry;\n (ws[i] = w & 67108863), w < 67108864 ? (carry = 0) : (carry = (w / 67108864) | 0);\n }\n return ws;\n }),\n (FFTM.prototype.convert13b = function (ws, len, rws, N) {\n for (var carry = 0, i = 0; i < len; i++)\n (carry = carry + (ws[i] | 0)),\n (rws[2 * i] = carry & 8191),\n (carry = carry >>> 13),\n (rws[2 * i + 1] = carry & 8191),\n (carry = carry >>> 13);\n for (i = 2 * len; i < N; ++i) rws[i] = 0;\n assert(carry === 0), assert((carry & -8192) === 0);\n }),\n (FFTM.prototype.stub = function (N) {\n for (var ph = new Array(N), i = 0; i < N; i++) ph[i] = 0;\n return ph;\n }),\n (FFTM.prototype.mulp = function (x, y, out) {\n var N = 2 * this.guessLen13b(x.length, y.length),\n rbt = this.makeRBT(N),\n _ = this.stub(N),\n rws = new Array(N),\n rwst = new Array(N),\n iwst = new Array(N),\n nrws = new Array(N),\n nrwst = new Array(N),\n niwst = new Array(N),\n rmws = out.words;\n (rmws.length = N),\n this.convert13b(x.words, x.length, rws, N),\n this.convert13b(y.words, y.length, nrws, N),\n this.transform(rws, _, rwst, iwst, N, rbt),\n this.transform(nrws, _, nrwst, niwst, N, rbt);\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]), (rwst[i] = rx);\n }\n return (\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 (out.negative = x.negative ^ y.negative),\n (out.length = x.length + y.length),\n out.strip()\n );\n }),\n (BN.prototype.mul = function (num) {\n var out = new BN(null);\n return (out.words = new Array(this.length + num.length)), this.mulTo(num, out);\n }),\n (BN.prototype.mulf = function (num) {\n var out = new BN(null);\n return (out.words = new Array(this.length + num.length)), jumboMulTo(this, num, out);\n }),\n (BN.prototype.imul = function (num) {\n return this.clone().mulTo(num, this);\n }),\n (BN.prototype.imuln = function (num) {\n assert(typeof num == \"number\"), assert(num < 67108864);\n for (var carry = 0, i = 0; i < this.length; i++) {\n var w = (this.words[i] | 0) * num,\n lo = (w & 67108863) + (carry & 67108863);\n (carry >>= 26), (carry += (w / 67108864) | 0), (carry += lo >>> 26), (this.words[i] = lo & 67108863);\n }\n return carry !== 0 && ((this.words[i] = carry), this.length++), this;\n }),\n (BN.prototype.muln = function (num) {\n return this.clone().imuln(num);\n }),\n (BN.prototype.sqr = function () {\n return this.mul(this);\n }),\n (BN.prototype.isqr = function () {\n return this.imul(this.clone());\n }),\n (BN.prototype.pow = function (num) {\n var w = toBitArray(num);\n if (w.length === 0) return new BN(1);\n for (var res = this, i = 0; i < w.length && w[i] === 0; i++, res = res.sqr());\n if (++i < w.length) for (var q = res.sqr(); i < w.length; i++, q = q.sqr()) w[i] !== 0 && (res = res.mul(q));\n return res;\n }),\n (BN.prototype.iushln = function (bits) {\n assert(typeof bits == \"number\" && bits >= 0);\n var r = bits % 26,\n s = (bits - r) / 26,\n carryMask = (67108863 >>> (26 - r)) << (26 - r),\n i;\n if (r !== 0) {\n var carry = 0;\n for (i = 0; i < this.length; i++) {\n var newCarry = this.words[i] & carryMask,\n c = ((this.words[i] | 0) - newCarry) << r;\n (this.words[i] = c | carry), (carry = newCarry >>> (26 - r));\n }\n carry && ((this.words[i] = carry), this.length++);\n }\n if (s !== 0) {\n for (i = this.length - 1; i >= 0; i--) this.words[i + s] = this.words[i];\n for (i = 0; i < s; i++) this.words[i] = 0;\n this.length += s;\n }\n return this.strip();\n }),\n (BN.prototype.ishln = function (bits) {\n return assert(this.negative === 0), this.iushln(bits);\n }),\n (BN.prototype.iushrn = function (bits, hint, extended) {\n assert(typeof bits == \"number\" && bits >= 0);\n var h;\n hint ? (h = (hint - (hint % 26)) / 26) : (h = 0);\n var r = bits % 26,\n s = Math.min((bits - r) / 26, this.length),\n mask = 67108863 ^ ((67108863 >>> r) << r),\n maskedWords = extended;\n if (((h -= s), (h = Math.max(0, h)), maskedWords)) {\n for (var i = 0; i < s; i++) maskedWords.words[i] = this.words[i];\n maskedWords.length = s;\n }\n if (s !== 0)\n if (this.length > s) for (this.length -= s, i = 0; i < this.length; i++) this.words[i] = this.words[i + s];\n else (this.words[0] = 0), (this.length = 1);\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)), (carry = word & mask);\n }\n return (\n maskedWords && carry !== 0 && (maskedWords.words[maskedWords.length++] = carry),\n this.length === 0 && ((this.words[0] = 0), (this.length = 1)),\n this.strip()\n );\n }),\n (BN.prototype.ishrn = function (bits, hint, extended) {\n return assert(this.negative === 0), this.iushrn(bits, hint, extended);\n }),\n (BN.prototype.shln = function (bits) {\n return this.clone().ishln(bits);\n }),\n (BN.prototype.ushln = function (bits) {\n return this.clone().iushln(bits);\n }),\n (BN.prototype.shrn = function (bits) {\n return this.clone().ishrn(bits);\n }),\n (BN.prototype.ushrn = function (bits) {\n return this.clone().iushrn(bits);\n }),\n (BN.prototype.testn = function (bit) {\n assert(typeof bit == \"number\" && bit >= 0);\n var r = bit % 26,\n s = (bit - r) / 26,\n q = 1 << r;\n if (this.length <= s) return !1;\n var w = this.words[s];\n return !!(w & q);\n }),\n (BN.prototype.imaskn = function (bits) {\n assert(typeof bits == \"number\" && bits >= 0);\n var r = bits % 26,\n s = (bits - r) / 26;\n if ((assert(this.negative === 0, \"imaskn works only with positive numbers\"), this.length <= s)) return this;\n if ((r !== 0 && s++, (this.length = Math.min(s, this.length)), r !== 0)) {\n var mask = 67108863 ^ ((67108863 >>> r) << r);\n this.words[this.length - 1] &= mask;\n }\n return this.strip();\n }),\n (BN.prototype.maskn = function (bits) {\n return this.clone().imaskn(bits);\n }),\n (BN.prototype.iaddn = function (num) {\n return (\n assert(typeof num == \"number\"),\n assert(num < 67108864),\n num < 0\n ? this.isubn(-num)\n : this.negative !== 0\n ? this.length === 1 && (this.words[0] | 0) < num\n ? ((this.words[0] = num - (this.words[0] | 0)), (this.negative = 0), this)\n : ((this.negative = 0), this.isubn(num), (this.negative = 1), this)\n : this._iaddn(num)\n );\n }),\n (BN.prototype._iaddn = function (num) {\n this.words[0] += num;\n for (var i = 0; i < this.length && this.words[i] >= 67108864; i++)\n (this.words[i] -= 67108864), i === this.length - 1 ? (this.words[i + 1] = 1) : this.words[i + 1]++;\n return (this.length = Math.max(this.length, i + 1)), this;\n }),\n (BN.prototype.isubn = function (num) {\n if ((assert(typeof num == \"number\"), assert(num < 67108864), num < 0)) return this.iaddn(-num);\n if (this.negative !== 0) return (this.negative = 0), this.iaddn(num), (this.negative = 1), this;\n if (((this.words[0] -= num), this.length === 1 && this.words[0] < 0))\n (this.words[0] = -this.words[0]), (this.negative = 1);\n else\n for (var i = 0; i < this.length && this.words[i] < 0; i++)\n (this.words[i] += 67108864), (this.words[i + 1] -= 1);\n return this.strip();\n }),\n (BN.prototype.addn = function (num) {\n return this.clone().iaddn(num);\n }),\n (BN.prototype.subn = function (num) {\n return this.clone().isubn(num);\n }),\n (BN.prototype.iabs = function () {\n return (this.negative = 0), this;\n }),\n (BN.prototype.abs = function () {\n return this.clone().iabs();\n }),\n (BN.prototype._ishlnsubmul = function (num, mul, shift) {\n var len = num.length + shift,\n i;\n this._expand(len);\n var w,\n 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 & 67108863),\n (carry = (w >> 26) - ((right / 67108864) | 0)),\n (this.words[i + shift] = w & 67108863);\n }\n for (; i < this.length - shift; i++)\n (w = (this.words[i + shift] | 0) + carry), (carry = w >> 26), (this.words[i + shift] = w & 67108863);\n if (carry === 0) return this.strip();\n for (assert(carry === -1), carry = 0, i = 0; i < this.length; i++)\n (w = -(this.words[i] | 0) + carry), (carry = w >> 26), (this.words[i] = w & 67108863);\n return (this.negative = 1), this.strip();\n }),\n (BN.prototype._wordDiv = function (num, mode) {\n var shift = this.length - num.length,\n a = this.clone(),\n b = num,\n bhi = b.words[b.length - 1] | 0,\n bhiBits = this._countBits(bhi);\n (shift = 26 - bhiBits),\n shift !== 0 && ((b = b.ushln(shift)), a.iushln(shift), (bhi = b.words[b.length - 1] | 0));\n var m = a.length - b.length,\n q;\n if (mode !== \"mod\") {\n (q = new BN(null)), (q.length = m + 1), (q.words = new Array(q.length));\n for (var i = 0; i < q.length; i++) q.words[i] = 0;\n }\n var diff = a.clone()._ishlnsubmul(b, 1, m);\n diff.negative === 0 && ((a = diff), q && (q.words[m] = 1));\n for (var j = m - 1; j >= 0; j--) {\n var qj = (a.words[b.length + j] | 0) * 67108864 + (a.words[b.length + j - 1] | 0);\n for (qj = Math.min((qj / bhi) | 0, 67108863), a._ishlnsubmul(b, qj, j); a.negative !== 0; )\n qj--, (a.negative = 0), a._ishlnsubmul(b, 1, j), a.isZero() || (a.negative ^= 1);\n q && (q.words[j] = qj);\n }\n return (\n q && q.strip(),\n a.strip(),\n mode !== \"div\" && shift !== 0 && a.iushrn(shift),\n {\n div: q || null,\n mod: a,\n }\n );\n }),\n (BN.prototype.divmod = function (num, mode, positive) {\n if ((assert(!num.isZero()), this.isZero()))\n return {\n div: new BN(0),\n mod: new BN(0),\n };\n var div, mod, res;\n return this.negative !== 0 && num.negative === 0\n ? ((res = this.neg().divmod(num, mode)),\n mode !== \"mod\" && (div = res.div.neg()),\n mode !== \"div\" && ((mod = res.mod.neg()), positive && mod.negative !== 0 && mod.iadd(num)),\n {\n div,\n mod,\n })\n : this.negative === 0 && num.negative !== 0\n ? ((res = this.divmod(num.neg(), mode)),\n mode !== \"mod\" && (div = res.div.neg()),\n {\n div,\n mod: res.mod,\n })\n : (this.negative & num.negative) !== 0\n ? ((res = this.neg().divmod(num.neg(), mode)),\n mode !== \"div\" && ((mod = res.mod.neg()), positive && mod.negative !== 0 && mod.isub(num)),\n {\n div: res.div,\n mod,\n })\n : num.length > this.length || this.cmp(num) < 0\n ? {\n div: new BN(0),\n mod: this,\n }\n : num.length === 1\n ? mode === \"div\"\n ? {\n div: this.divn(num.words[0]),\n mod: null,\n }\n : mode === \"mod\"\n ? {\n div: null,\n mod: new BN(this.modn(num.words[0])),\n }\n : {\n div: this.divn(num.words[0]),\n mod: new BN(this.modn(num.words[0])),\n }\n : this._wordDiv(num, mode);\n }),\n (BN.prototype.div = function (num) {\n return this.divmod(num, \"div\", !1).div;\n }),\n (BN.prototype.mod = function (num) {\n return this.divmod(num, \"mod\", !1).mod;\n }),\n (BN.prototype.umod = function (num) {\n return this.divmod(num, \"mod\", !0).mod;\n }),\n (BN.prototype.divRound = function (num) {\n var dm = this.divmod(num);\n if (dm.mod.isZero()) return dm.div;\n var mod = dm.div.negative !== 0 ? dm.mod.isub(num) : dm.mod,\n half = num.ushrn(1),\n r2 = num.andln(1),\n cmp = mod.cmp(half);\n return cmp < 0 || (r2 === 1 && cmp === 0)\n ? dm.div\n : dm.div.negative !== 0\n ? dm.div.isubn(1)\n : dm.div.iaddn(1);\n }),\n (BN.prototype.modn = function (num) {\n assert(num <= 67108863);\n for (var p = (1 << 26) % num, acc = 0, i = this.length - 1; i >= 0; i--)\n acc = (p * acc + (this.words[i] | 0)) % num;\n return acc;\n }),\n (BN.prototype.idivn = function (num) {\n assert(num <= 67108863);\n for (var carry = 0, i = this.length - 1; i >= 0; i--) {\n var w = (this.words[i] | 0) + carry * 67108864;\n (this.words[i] = (w / num) | 0), (carry = w % num);\n }\n return this.strip();\n }),\n (BN.prototype.divn = function (num) {\n return this.clone().idivn(num);\n }),\n (BN.prototype.egcd = function (p) {\n assert(p.negative === 0), assert(!p.isZero());\n var x = this,\n y = p.clone();\n x.negative !== 0 ? (x = x.umod(p)) : (x = x.clone());\n for (var A = new BN(1), B = new BN(0), C = new BN(0), D = new BN(1), g = 0; x.isEven() && y.isEven(); )\n x.iushrn(1), y.iushrn(1), ++g;\n for (var yp = y.clone(), xp = x.clone(); !x.isZero(); ) {\n for (var i = 0, im = 1; (x.words[0] & im) === 0 && i < 26; ++i, im <<= 1);\n if (i > 0)\n for (x.iushrn(i); i-- > 0; )\n (A.isOdd() || B.isOdd()) && (A.iadd(yp), B.isub(xp)), A.iushrn(1), B.iushrn(1);\n for (var j = 0, jm = 1; (y.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n if (j > 0)\n for (y.iushrn(j); j-- > 0; )\n (C.isOdd() || D.isOdd()) && (C.iadd(yp), D.isub(xp)), C.iushrn(1), D.iushrn(1);\n x.cmp(y) >= 0 ? (x.isub(y), A.isub(C), B.isub(D)) : (y.isub(x), C.isub(A), D.isub(B));\n }\n return {\n a: C,\n b: D,\n gcd: y.iushln(g),\n };\n }),\n (BN.prototype._invmp = function (p) {\n assert(p.negative === 0), assert(!p.isZero());\n var a = this,\n b = p.clone();\n a.negative !== 0 ? (a = a.umod(p)) : (a = a.clone());\n for (var x1 = new BN(1), x2 = new BN(0), delta = b.clone(); 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) for (a.iushrn(i); i-- > 0; ) x1.isOdd() && x1.iadd(delta), x1.iushrn(1);\n for (var j = 0, jm = 1; (b.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n if (j > 0) for (b.iushrn(j); j-- > 0; ) x2.isOdd() && x2.iadd(delta), x2.iushrn(1);\n a.cmp(b) >= 0 ? (a.isub(b), x1.isub(x2)) : (b.isub(a), x2.isub(x1));\n }\n var res;\n return a.cmpn(1) === 0 ? (res = x1) : (res = x2), res.cmpn(0) < 0 && res.iadd(p), res;\n }),\n (BN.prototype.gcd = function (num) {\n if (this.isZero()) return num.abs();\n if (num.isZero()) return this.abs();\n var a = this.clone(),\n b = num.clone();\n (a.negative = 0), (b.negative = 0);\n for (var shift = 0; a.isEven() && b.isEven(); shift++) a.iushrn(1), b.iushrn(1);\n do {\n for (; a.isEven(); ) a.iushrn(1);\n for (; b.isEven(); ) b.iushrn(1);\n var r = a.cmp(b);\n if (r < 0) {\n var t = a;\n (a = b), (b = t);\n } else if (r === 0 || b.cmpn(1) === 0) break;\n a.isub(b);\n } while (!0);\n return b.iushln(shift);\n }),\n (BN.prototype.invm = function (num) {\n return this.egcd(num).a.umod(num);\n }),\n (BN.prototype.isEven = function () {\n return (this.words[0] & 1) === 0;\n }),\n (BN.prototype.isOdd = function () {\n return (this.words[0] & 1) === 1;\n }),\n (BN.prototype.andln = function (num) {\n return this.words[0] & num;\n }),\n (BN.prototype.bincn = function (bit) {\n assert(typeof bit == \"number\");\n var r = bit % 26,\n s = (bit - r) / 26,\n q = 1 << r;\n if (this.length <= s) return this._expand(s + 1), (this.words[s] |= q), this;\n for (var carry = q, i = s; carry !== 0 && i < this.length; i++) {\n var w = this.words[i] | 0;\n (w += carry), (carry = w >>> 26), (w &= 67108863), (this.words[i] = w);\n }\n return carry !== 0 && ((this.words[i] = carry), this.length++), this;\n }),\n (BN.prototype.isZero = function () {\n return this.length === 1 && this.words[0] === 0;\n }),\n (BN.prototype.cmpn = function (num) {\n var negative = num < 0;\n if (this.negative !== 0 && !negative) return -1;\n if (this.negative === 0 && negative) return 1;\n this.strip();\n var res;\n if (this.length > 1) res = 1;\n else {\n negative && (num = -num), assert(num <= 67108863, \"Number is too big\");\n var w = this.words[0] | 0;\n res = w === num ? 0 : w < num ? -1 : 1;\n }\n return this.negative !== 0 ? -res | 0 : res;\n }),\n (BN.prototype.cmp = function (num) {\n if (this.negative !== 0 && num.negative === 0) return -1;\n if (this.negative === 0 && num.negative !== 0) return 1;\n var res = this.ucmp(num);\n return this.negative !== 0 ? -res | 0 : res;\n }),\n (BN.prototype.ucmp = function (num) {\n if (this.length > num.length) return 1;\n if (this.length < num.length) return -1;\n for (var res = 0, i = this.length - 1; i >= 0; i--) {\n var a = this.words[i] | 0,\n b = num.words[i] | 0;\n if (a !== b) {\n a < b ? (res = -1) : a > b && (res = 1);\n break;\n }\n }\n return res;\n }),\n (BN.prototype.gtn = function (num) {\n return this.cmpn(num) === 1;\n }),\n (BN.prototype.gt = function (num) {\n return this.cmp(num) === 1;\n }),\n (BN.prototype.gten = function (num) {\n return this.cmpn(num) >= 0;\n }),\n (BN.prototype.gte = function (num) {\n return this.cmp(num) >= 0;\n }),\n (BN.prototype.ltn = function (num) {\n return this.cmpn(num) === -1;\n }),\n (BN.prototype.lt = function (num) {\n return this.cmp(num) === -1;\n }),\n (BN.prototype.lten = function (num) {\n return this.cmpn(num) <= 0;\n }),\n (BN.prototype.lte = function (num) {\n return this.cmp(num) <= 0;\n }),\n (BN.prototype.eqn = function (num) {\n return this.cmpn(num) === 0;\n }),\n (BN.prototype.eq = function (num) {\n return this.cmp(num) === 0;\n }),\n (BN.red = function (num) {\n return new Red(num);\n }),\n (BN.prototype.toRed = function (ctx) {\n return (\n assert(!this.red, \"Already a number in reduction context\"),\n assert(this.negative === 0, \"red works only with positives\"),\n ctx.convertTo(this)._forceRed(ctx)\n );\n }),\n (BN.prototype.fromRed = function () {\n return assert(this.red, \"fromRed works only with numbers in reduction context\"), this.red.convertFrom(this);\n }),\n (BN.prototype._forceRed = function (ctx) {\n return (this.red = ctx), this;\n }),\n (BN.prototype.forceRed = function (ctx) {\n return assert(!this.red, \"Already a number in reduction context\"), this._forceRed(ctx);\n }),\n (BN.prototype.redAdd = function (num) {\n return assert(this.red, \"redAdd works only with red numbers\"), this.red.add(this, num);\n }),\n (BN.prototype.redIAdd = function (num) {\n return assert(this.red, \"redIAdd works only with red numbers\"), this.red.iadd(this, num);\n }),\n (BN.prototype.redSub = function (num) {\n return assert(this.red, \"redSub works only with red numbers\"), this.red.sub(this, num);\n }),\n (BN.prototype.redISub = function (num) {\n return assert(this.red, \"redISub works only with red numbers\"), this.red.isub(this, num);\n }),\n (BN.prototype.redShl = function (num) {\n return assert(this.red, \"redShl works only with red numbers\"), this.red.shl(this, num);\n }),\n (BN.prototype.redMul = function (num) {\n return (\n assert(this.red, \"redMul works only with red numbers\"),\n this.red._verify2(this, num),\n this.red.mul(this, num)\n );\n }),\n (BN.prototype.redIMul = function (num) {\n return (\n assert(this.red, \"redMul works only with red numbers\"),\n this.red._verify2(this, num),\n this.red.imul(this, num)\n );\n }),\n (BN.prototype.redSqr = function () {\n return assert(this.red, \"redSqr works only with red numbers\"), this.red._verify1(this), this.red.sqr(this);\n }),\n (BN.prototype.redISqr = function () {\n return assert(this.red, \"redISqr works only with red numbers\"), this.red._verify1(this), this.red.isqr(this);\n }),\n (BN.prototype.redSqrt = function () {\n return assert(this.red, \"redSqrt works only with red numbers\"), this.red._verify1(this), this.red.sqrt(this);\n }),\n (BN.prototype.redInvm = function () {\n return assert(this.red, \"redInvm works only with red numbers\"), this.red._verify1(this), this.red.invm(this);\n }),\n (BN.prototype.redNeg = function () {\n return assert(this.red, \"redNeg works only with red numbers\"), this.red._verify1(this), this.red.neg(this);\n }),\n (BN.prototype.redPow = function (num) {\n return assert(this.red && !num.red, \"redPow(normalNum)\"), this.red._verify1(this), this.red.pow(this, num);\n });\n var primes = {\n k256: null,\n p224: null,\n p192: null,\n p25519: null,\n };\n function MPrime(name, p) {\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 (this.tmp = this._tmp());\n }\n (MPrime.prototype._tmp = function () {\n var tmp = new BN(null);\n return (tmp.words = new Array(Math.ceil(this.n / 13))), tmp;\n }),\n (MPrime.prototype.ireduce = function (num) {\n var r = num,\n rlen;\n do this.split(r, this.tmp), (r = this.imulK(r)), (r = r.iadd(this.tmp)), (rlen = r.bitLength());\n while (rlen > this.n);\n var cmp = rlen < this.n ? -1 : r.ucmp(this.p);\n return (\n cmp === 0\n ? ((r.words[0] = 0), (r.length = 1))\n : cmp > 0\n ? r.isub(this.p)\n : r.strip !== void 0\n ? r.strip()\n : r._strip(),\n r\n );\n }),\n (MPrime.prototype.split = function (input, out) {\n input.iushrn(this.n, 0, out);\n }),\n (MPrime.prototype.imulK = function (num) {\n return num.imul(this.k);\n });\n function K256() {\n MPrime.call(this, \"k256\", \"ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f\");\n }\n inherits(K256, MPrime),\n (K256.prototype.split = function (input, output) {\n for (var mask = 4194303, outLen = Math.min(input.length, 9), i = 0; i < outLen; i++)\n output.words[i] = input.words[i];\n if (((output.length = outLen), input.length <= 9)) {\n (input.words[0] = 0), (input.length = 1);\n return;\n }\n var prev = input.words[9];\n for (output.words[output.length++] = prev & mask, i = 10; i < input.length; i++) {\n var next = input.words[i] | 0;\n (input.words[i - 10] = ((next & mask) << 4) | (prev >>> 22)), (prev = next);\n }\n (prev >>>= 22),\n (input.words[i - 10] = prev),\n prev === 0 && input.length > 10 ? (input.length -= 10) : (input.length -= 9);\n }),\n (K256.prototype.imulK = function (num) {\n (num.words[num.length] = 0), (num.words[num.length + 1] = 0), (num.length += 2);\n for (var lo = 0, i = 0; i < num.length; i++) {\n var w = num.words[i] | 0;\n (lo += w * 977), (num.words[i] = lo & 67108863), (lo = w * 64 + ((lo / 67108864) | 0));\n }\n return (\n num.words[num.length - 1] === 0 && (num.length--, num.words[num.length - 1] === 0 && num.length--), num\n );\n });\n function P224() {\n MPrime.call(this, \"p224\", \"ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001\");\n }\n inherits(P224, MPrime);\n function P192() {\n MPrime.call(this, \"p192\", \"ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff\");\n }\n inherits(P192, MPrime);\n function P25519() {\n MPrime.call(this, \"25519\", \"7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed\");\n }\n inherits(P25519, MPrime),\n (P25519.prototype.imulK = function (num) {\n for (var carry = 0, i = 0; i < num.length; i++) {\n var hi = (num.words[i] | 0) * 19 + carry,\n lo = hi & 67108863;\n (hi >>>= 26), (num.words[i] = lo), (carry = hi);\n }\n return carry !== 0 && (num.words[num.length++] = carry), num;\n }),\n (BN._prime = function (name) {\n if (primes[name]) return primes[name];\n var prime2;\n if (name === \"k256\") prime2 = new K256();\n else if (name === \"p224\") prime2 = new P224();\n else if (name === \"p192\") prime2 = new P192();\n else if (name === \"p25519\") prime2 = new P25519();\n else throw new Error(\"Unknown prime \" + name);\n return (primes[name] = prime2), prime2;\n });\n function Red(m) {\n if (typeof m == \"string\") {\n var prime = BN._prime(m);\n (this.m = prime.p), (this.prime = prime);\n } else assert(m.gtn(1), \"modulus must be greater than 1\"), (this.m = m), (this.prime = null);\n }\n (Red.prototype._verify1 = function (a) {\n assert(a.negative === 0, \"red works only with positives\"), assert(a.red, \"red works only with red numbers\");\n }),\n (Red.prototype._verify2 = function (a, b) {\n assert((a.negative | b.negative) === 0, \"red works only with positives\"),\n assert(a.red && a.red === b.red, \"red works only with red numbers\");\n }),\n (Red.prototype.imod = function (a) {\n return this.prime ? this.prime.ireduce(a)._forceRed(this) : a.umod(this.m)._forceRed(this);\n }),\n (Red.prototype.neg = function (a) {\n return a.isZero() ? a.clone() : this.m.sub(a)._forceRed(this);\n }),\n (Red.prototype.add = function (a, b) {\n this._verify2(a, b);\n var res = a.add(b);\n return res.cmp(this.m) >= 0 && res.isub(this.m), res._forceRed(this);\n }),\n (Red.prototype.iadd = function (a, b) {\n this._verify2(a, b);\n var res = a.iadd(b);\n return res.cmp(this.m) >= 0 && res.isub(this.m), res;\n }),\n (Red.prototype.sub = function (a, b) {\n this._verify2(a, b);\n var res = a.sub(b);\n return res.cmpn(0) < 0 && res.iadd(this.m), res._forceRed(this);\n }),\n (Red.prototype.isub = function (a, b) {\n this._verify2(a, b);\n var res = a.isub(b);\n return res.cmpn(0) < 0 && res.iadd(this.m), res;\n }),\n (Red.prototype.shl = function (a, num) {\n return this._verify1(a), this.imod(a.ushln(num));\n }),\n (Red.prototype.imul = function (a, b) {\n return this._verify2(a, b), this.imod(a.imul(b));\n }),\n (Red.prototype.mul = function (a, b) {\n return this._verify2(a, b), this.imod(a.mul(b));\n }),\n (Red.prototype.isqr = function (a) {\n return this.imul(a, a.clone());\n }),\n (Red.prototype.sqr = function (a) {\n return this.mul(a, a);\n }),\n (Red.prototype.sqrt = function (a) {\n if (a.isZero()) return a.clone();\n var mod3 = this.m.andln(3);\n if ((assert(mod3 % 2 === 1), mod3 === 3)) {\n var pow = this.m.add(new BN(1)).iushrn(2);\n return this.pow(a, pow);\n }\n for (var q = this.m.subn(1), s = 0; !q.isZero() && q.andln(1) === 0; ) s++, q.iushrn(1);\n assert(!q.isZero());\n var one = new BN(1).toRed(this),\n nOne = one.redNeg(),\n lpow = this.m.subn(1).iushrn(1),\n z = this.m.bitLength();\n for (z = new BN(2 * z * z).toRed(this); this.pow(z, lpow).cmp(nOne) !== 0; ) z.redIAdd(nOne);\n for (\n var c = this.pow(z, q), r = this.pow(a, q.addn(1).iushrn(1)), t = this.pow(a, q), m = s;\n t.cmp(one) !== 0;\n\n ) {\n for (var tmp = t, i = 0; tmp.cmp(one) !== 0; i++) tmp = tmp.redSqr();\n assert(i < m);\n var b = this.pow(c, new BN(1).iushln(m - i - 1));\n (r = r.redMul(b)), (c = b.redSqr()), (t = t.redMul(c)), (m = i);\n }\n return r;\n }),\n (Red.prototype.invm = function (a) {\n var inv = a._invmp(this.m);\n return inv.negative !== 0 ? ((inv.negative = 0), this.imod(inv).redNeg()) : this.imod(inv);\n }),\n (Red.prototype.pow = function (a, num) {\n if (num.isZero()) return new BN(1).toRed(this);\n if (num.cmpn(1) === 0) return a.clone();\n var windowSize = 4,\n wnd = new Array(1 << windowSize);\n (wnd[0] = new BN(1).toRed(this)), (wnd[1] = a);\n for (var i = 2; i < wnd.length; i++) wnd[i] = this.mul(wnd[i - 1], a);\n var res = wnd[0],\n current = 0,\n currentLen = 0,\n start = num.bitLength() % 26;\n for (start === 0 && (start = 26), i = num.length - 1; i >= 0; i--) {\n for (var word = num.words[i], j = start - 1; j >= 0; j--) {\n var bit = (word >> j) & 1;\n if ((res !== wnd[0] && (res = this.sqr(res)), bit === 0 && current === 0)) {\n currentLen = 0;\n continue;\n }\n (current <<= 1),\n (current |= bit),\n currentLen++,\n !(currentLen !== windowSize && (i !== 0 || j !== 0)) &&\n ((res = this.mul(res, wnd[current])), (currentLen = 0), (current = 0));\n }\n start = 26;\n }\n return res;\n }),\n (Red.prototype.convertTo = function (num) {\n var r = num.umod(this.m);\n return r === num ? r.clone() : r;\n }),\n (Red.prototype.convertFrom = function (num) {\n var res = num.clone();\n return (res.red = null), res;\n }),\n (BN.mont = function (num) {\n return new Mont(num);\n });\n function Mont(m) {\n Red.call(this, m),\n (this.shift = this.m.bitLength()),\n this.shift % 26 !== 0 && (this.shift += 26 - (this.shift % 26)),\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 (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 (Mont.prototype.convertTo = function (num) {\n return this.imod(num.ushln(this.shift));\n }),\n (Mont.prototype.convertFrom = function (num) {\n var r = this.imod(num.mul(this.rinv));\n return (r.red = null), r;\n }),\n (Mont.prototype.imul = function (a, b) {\n if (a.isZero() || b.isZero()) return (a.words[0] = 0), (a.length = 1), a;\n var t = a.imul(b),\n c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m),\n u = t.isub(c).iushrn(this.shift),\n res = u;\n return (\n u.cmp(this.m) >= 0 ? (res = u.isub(this.m)) : u.cmpn(0) < 0 && (res = u.iadd(this.m)), res._forceRed(this)\n );\n }),\n (Mont.prototype.mul = function (a, b) {\n if (a.isZero() || b.isZero()) return new BN(0)._forceRed(this);\n var t = a.mul(b),\n c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m),\n u = t.isub(c).iushrn(this.shift),\n res = u;\n return (\n u.cmp(this.m) >= 0 ? (res = u.isub(this.m)) : u.cmpn(0) < 0 && (res = u.iadd(this.m)), res._forceRed(this)\n );\n }),\n (Mont.prototype.invm = function (a) {\n var res = this.imod(a._invmp(this.m).mul(this.r2));\n return res._forceRed(this);\n });\n })(typeof module > \"u\" || module, exports);\n },\n});\n\n// node_modules/create-ecdh/browser.js\nvar require_browser9 = __commonJS({\n \"node_modules/create-ecdh/browser.js\"(exports, module) {\n var elliptic = require_elliptic(),\n BN = require_bn6();\n module.exports = function (curve) {\n return new ECDH(curve);\n };\n var aliases = {\n secp256k1: {\n name: \"secp256k1\",\n byteLength: 32,\n },\n secp224r1: {\n name: \"p224\",\n byteLength: 28,\n },\n prime256v1: {\n name: \"p256\",\n byteLength: 32,\n },\n prime192v1: {\n name: \"p192\",\n byteLength: 24,\n },\n ed25519: {\n name: \"ed25519\",\n byteLength: 32,\n },\n secp384r1: {\n name: \"p384\",\n byteLength: 48,\n },\n secp521r1: {\n name: \"p521\",\n byteLength: 66,\n },\n };\n aliases.p224 = aliases.secp224r1;\n aliases.p256 = aliases.secp256r1 = aliases.prime256v1;\n aliases.p192 = aliases.secp192r1 = aliases.prime192v1;\n aliases.p384 = aliases.secp384r1;\n aliases.p521 = aliases.secp521r1;\n function ECDH(curve) {\n (this.curveType = aliases[curve]),\n this.curveType ||\n (this.curveType = {\n name: curve,\n }),\n (this.curve = new elliptic.ec(this.curveType.name)),\n (this.keys = void 0);\n }\n ECDH.prototype.generateKeys = function (enc, format) {\n return (this.keys = this.curve.genKeyPair()), this.getPublicKey(enc, format);\n };\n ECDH.prototype.computeSecret = function (other, inenc, enc) {\n (inenc = inenc || \"utf8\"), Buffer.isBuffer(other) || (other = new Buffer(other, inenc));\n var otherPub = this.curve.keyFromPublic(other).getPublic(),\n out = otherPub.mul(this.keys.getPrivate()).getX();\n return formatReturnValue(out, enc, this.curveType.byteLength);\n };\n ECDH.prototype.getPublicKey = function (enc, format) {\n var key = this.keys.getPublic(format === \"compressed\", !0);\n return (\n format === \"hybrid\" && (key[key.length - 1] % 2 ? (key[0] = 7) : (key[0] = 6)), formatReturnValue(key, enc)\n );\n };\n ECDH.prototype.getPrivateKey = function (enc) {\n return formatReturnValue(this.keys.getPrivate(), enc);\n };\n ECDH.prototype.setPublicKey = function (pub, enc) {\n return (\n (enc = enc || \"utf8\"), Buffer.isBuffer(pub) || (pub = new Buffer(pub, enc)), this.keys._importPublic(pub), this\n );\n };\n ECDH.prototype.setPrivateKey = function (priv, enc) {\n (enc = enc || \"utf8\"), Buffer.isBuffer(priv) || (priv = new Buffer(priv, enc));\n var _priv = new BN(priv);\n return (_priv = _priv.toString(16)), (this.keys = this.curve.genKeyPair()), this.keys._importPrivate(_priv), this;\n };\n function formatReturnValue(bn, enc, len) {\n Array.isArray(bn) || (bn = bn.toArray());\n var buf = new Buffer(bn);\n if (len && buf.length < len) {\n var zeros = new Buffer(len - buf.length);\n zeros.fill(0), (buf = Buffer.concat([zeros, buf]));\n }\n return enc ? buf.toString(enc) : buf;\n }\n },\n});\n\n// node_modules/public-encrypt/mgf.js\nvar require_mgf = __commonJS({\n \"node_modules/public-encrypt/mgf.js\"(exports, module) {\n var createHash = require_browser2(),\n Buffer2 = require_safe_buffer().Buffer;\n module.exports = function (seed, len) {\n for (var t = Buffer2.alloc(0), i = 0, c; t.length < len; )\n (c = i2ops(i++)), (t = Buffer2.concat([t, createHash(\"sha1\").update(seed).update(c).digest()]));\n return t.slice(0, len);\n };\n function i2ops(c) {\n var out = Buffer2.allocUnsafe(4);\n return out.writeUInt32BE(c, 0), out;\n }\n },\n});\n\n// node_modules/public-encrypt/xor.js\nvar require_xor = __commonJS({\n \"node_modules/public-encrypt/xor.js\"(exports, module) {\n module.exports = function (a, b) {\n for (var len = a.length, i = -1; ++i < len; ) a[i] ^= b[i];\n return a;\n };\n },\n});\n\n// node_modules/public-encrypt/node_modules/bn.js/lib/bn.js\nvar require_bn7 = __commonJS({\n \"node_modules/public-encrypt/node_modules/bn.js/lib/bn.js\"(exports, module) {\n (function (module2, exports2) {\n \"use strict\";\n function assert(val, msg) {\n if (!val) throw new Error(msg || \"Assertion failed\");\n }\n function inherits(ctor, superCtor) {\n ctor.super_ = superCtor;\n var TempCtor = function () {};\n (TempCtor.prototype = superCtor.prototype),\n (ctor.prototype = new TempCtor()),\n (ctor.prototype.constructor = ctor);\n }\n function BN(number, base, endian) {\n if (BN.isBN(number)) return number;\n (this.negative = 0),\n (this.words = null),\n (this.length = 0),\n (this.red = null),\n number !== null &&\n ((base === \"le\" || base === \"be\") && ((endian = base), (base = 10)),\n this._init(number || 0, base || 10, endian || \"be\"));\n }\n typeof module2 == \"object\" ? (module2.exports = BN) : (exports2.BN = BN), (BN.BN = BN), (BN.wordSize = 26);\n var Buffer2 = globalThis.Buffer;\n (BN.isBN = function (num) {\n return num instanceof BN\n ? !0\n : num !== null &&\n typeof num == \"object\" &&\n num.constructor.wordSize === BN.wordSize &&\n Array.isArray(num.words);\n }),\n (BN.max = function (left, right) {\n return left.cmp(right) > 0 ? left : right;\n }),\n (BN.min = function (left, right) {\n return left.cmp(right) < 0 ? left : right;\n }),\n (BN.prototype._init = function (number, base, endian) {\n if (typeof number == \"number\") return this._initNumber(number, base, endian);\n if (typeof number == \"object\") return this._initArray(number, base, endian);\n base === \"hex\" && (base = 16),\n assert(base === (base | 0) && base >= 2 && base <= 36),\n (number = number.toString().replace(/\\s+/g, \"\"));\n var start = 0;\n number[0] === \"-\" && (start++, (this.negative = 1)),\n start < number.length &&\n (base === 16\n ? this._parseHex(number, start, endian)\n : (this._parseBase(number, base, start),\n endian === \"le\" && this._initArray(this.toArray(), base, endian)));\n }),\n (BN.prototype._initNumber = function (number, base, endian) {\n number < 0 && ((this.negative = 1), (number = -number)),\n number < 67108864\n ? ((this.words = [number & 67108863]), (this.length = 1))\n : number < 4503599627370496\n ? ((this.words = [number & 67108863, (number / 67108864) & 67108863]), (this.length = 2))\n : (assert(number < 9007199254740992),\n (this.words = [number & 67108863, (number / 67108864) & 67108863, 1]),\n (this.length = 3)),\n endian === \"le\" && this._initArray(this.toArray(), base, endian);\n }),\n (BN.prototype._initArray = function (number, base, endian) {\n if ((assert(typeof number.length == \"number\"), number.length <= 0))\n return (this.words = [0]), (this.length = 1), this;\n (this.length = Math.ceil(number.length / 3)), (this.words = new Array(this.length));\n for (var i = 0; i < this.length; i++) this.words[i] = 0;\n var j,\n w,\n off = 0;\n if (endian === \"be\")\n for (i = number.length - 1, j = 0; i >= 0; i -= 3)\n (w = number[i] | (number[i - 1] << 8) | (number[i - 2] << 16)),\n (this.words[j] |= (w << off) & 67108863),\n (this.words[j + 1] = (w >>> (26 - off)) & 67108863),\n (off += 24),\n off >= 26 && ((off -= 26), j++);\n else if (endian === \"le\")\n for (i = 0, j = 0; i < number.length; i += 3)\n (w = number[i] | (number[i + 1] << 8) | (number[i + 2] << 16)),\n (this.words[j] |= (w << off) & 67108863),\n (this.words[j + 1] = (w >>> (26 - off)) & 67108863),\n (off += 24),\n off >= 26 && ((off -= 26), j++);\n return this.strip();\n });\n function parseHex4Bits(string, index) {\n var c = string.charCodeAt(index);\n return c >= 65 && c <= 70 ? c - 55 : c >= 97 && c <= 102 ? c - 87 : (c - 48) & 15;\n }\n function parseHexByte(string, lowerBound, index) {\n var r = parseHex4Bits(string, index);\n return index - 1 >= lowerBound && (r |= parseHex4Bits(string, index - 1) << 4), r;\n }\n BN.prototype._parseHex = function (number, start, endian) {\n (this.length = Math.ceil((number.length - start) / 6)), (this.words = new Array(this.length));\n for (var i = 0; i < this.length; i++) this.words[i] = 0;\n var off = 0,\n j = 0,\n w;\n if (endian === \"be\")\n for (i = number.length - 1; i >= start; i -= 2)\n (w = parseHexByte(number, start, i) << off),\n (this.words[j] |= w & 67108863),\n off >= 18 ? ((off -= 18), (j += 1), (this.words[j] |= w >>> 26)) : (off += 8);\n else {\n var parseLength = number.length - start;\n for (i = parseLength % 2 === 0 ? start + 1 : start; i < number.length; i += 2)\n (w = parseHexByte(number, start, i) << off),\n (this.words[j] |= w & 67108863),\n off >= 18 ? ((off -= 18), (j += 1), (this.words[j] |= w >>> 26)) : (off += 8);\n }\n this.strip();\n };\n function parseBase(str, start, end, mul) {\n for (var r = 0, len = Math.min(str.length, end), i = start; i < len; i++) {\n var c = str.charCodeAt(i) - 48;\n (r *= mul), c >= 49 ? (r += c - 49 + 10) : c >= 17 ? (r += c - 17 + 10) : (r += c);\n }\n return r;\n }\n (BN.prototype._parseBase = function (number, base, start) {\n (this.words = [0]), (this.length = 1);\n for (var limbLen = 0, limbPow = 1; limbPow <= 67108863; limbPow *= base) limbLen++;\n limbLen--, (limbPow = (limbPow / base) | 0);\n for (\n var total = number.length - start,\n mod = total % limbLen,\n end = Math.min(total, total - mod) + start,\n word = 0,\n i = start;\n i < end;\n i += limbLen\n )\n (word = parseBase(number, i, i + limbLen, base)),\n this.imuln(limbPow),\n this.words[0] + word < 67108864 ? (this.words[0] += word) : this._iaddn(word);\n if (mod !== 0) {\n var pow = 1;\n for (word = parseBase(number, i, number.length, base), i = 0; i < mod; i++) pow *= base;\n this.imuln(pow), this.words[0] + word < 67108864 ? (this.words[0] += word) : this._iaddn(word);\n }\n this.strip();\n }),\n (BN.prototype.copy = function (dest) {\n dest.words = new Array(this.length);\n for (var i = 0; i < this.length; i++) dest.words[i] = this.words[i];\n (dest.length = this.length), (dest.negative = this.negative), (dest.red = this.red);\n }),\n (BN.prototype.clone = function () {\n var r = new BN(null);\n return this.copy(r), r;\n }),\n (BN.prototype._expand = function (size) {\n for (; this.length < size; ) this.words[this.length++] = 0;\n return this;\n }),\n (BN.prototype.strip = function () {\n for (; this.length > 1 && this.words[this.length - 1] === 0; ) this.length--;\n return this._normSign();\n }),\n (BN.prototype._normSign = function () {\n return this.length === 1 && this.words[0] === 0 && (this.negative = 0), this;\n }),\n (BN.prototype.inspect = function () {\n return (this.red ? \"<BN-R: \" : \"<BN: \") + this.toString(16) + \">\";\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 groupSizes = [\n 0, 0, 25, 16, 12, 11, 10, 9, 8, 8, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5,\n 5, 5,\n ],\n groupBases = [\n 0, 0, 33554432, 43046721, 16777216, 48828125, 60466176, 40353607, 16777216, 43046721, 1e7, 19487171, 35831808,\n 62748517, 7529536, 11390625, 16777216, 24137569, 34012224, 47045881, 64e6, 4084101, 5153632, 6436343, 7962624,\n 9765625, 11881376, 14348907, 17210368, 20511149, 243e5, 28629151, 33554432, 39135393, 45435424, 52521875,\n 60466176,\n ];\n (BN.prototype.toString = function (base, padding) {\n (base = base || 10), (padding = padding | 0 || 1);\n var out;\n if (base === 16 || base === \"hex\") {\n out = \"\";\n for (var off = 0, carry = 0, i = 0; i < this.length; i++) {\n var w = this.words[i],\n word = (((w << off) | carry) & 16777215).toString(16);\n (carry = (w >>> (24 - off)) & 16777215),\n carry !== 0 || i !== this.length - 1 ? (out = zeros[6 - word.length] + word + out) : (out = word + out),\n (off += 2),\n off >= 26 && ((off -= 26), i--);\n }\n for (carry !== 0 && (out = carry.toString(16) + out); out.length % padding !== 0; ) out = \"0\" + out;\n return this.negative !== 0 && (out = \"-\" + out), out;\n }\n if (base === (base | 0) && base >= 2 && base <= 36) {\n var groupSize = groupSizes[base],\n groupBase = groupBases[base];\n out = \"\";\n var c = this.clone();\n for (c.negative = 0; !c.isZero(); ) {\n var r = c.modn(groupBase).toString(base);\n (c = c.idivn(groupBase)), c.isZero() ? (out = r + out) : (out = zeros[groupSize - r.length] + r + out);\n }\n for (this.isZero() && (out = \"0\" + out); out.length % padding !== 0; ) out = \"0\" + out;\n return this.negative !== 0 && (out = \"-\" + out), out;\n }\n assert(!1, \"Base should be between 2 and 36\");\n }),\n (BN.prototype.toNumber = function () {\n var ret = this.words[0];\n return (\n this.length === 2\n ? (ret += this.words[1] * 67108864)\n : this.length === 3 && this.words[2] === 1\n ? (ret += 4503599627370496 + this.words[1] * 67108864)\n : this.length > 2 && assert(!1, \"Number can only safely store up to 53 bits\"),\n this.negative !== 0 ? -ret : ret\n );\n }),\n (BN.prototype.toJSON = function () {\n return this.toString(16);\n }),\n (BN.prototype.toBuffer = function (endian, length) {\n return assert(typeof Buffer2 < \"u\"), this.toArrayLike(Buffer2, endian, length);\n }),\n (BN.prototype.toArray = function (endian, length) {\n return this.toArrayLike(Array, endian, length);\n }),\n (BN.prototype.toArrayLike = function (ArrayType, endian, length) {\n var byteLength = this.byteLength(),\n 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 this.strip();\n var littleEndian = endian === \"le\",\n res = new ArrayType(reqLength),\n b,\n i,\n q = this.clone();\n if (littleEndian) {\n for (i = 0; !q.isZero(); i++) (b = q.andln(255)), q.iushrn(8), (res[i] = b);\n for (; i < reqLength; i++) res[i] = 0;\n } else {\n for (i = 0; i < reqLength - byteLength; i++) res[i] = 0;\n for (i = 0; !q.isZero(); i++) (b = q.andln(255)), q.iushrn(8), (res[reqLength - i - 1] = b);\n }\n return res;\n }),\n Math.clz32\n ? (BN.prototype._countBits = function (w) {\n return 32 - Math.clz32(w);\n })\n : (BN.prototype._countBits = function (w) {\n var t = w,\n r = 0;\n return (\n t >= 4096 && ((r += 13), (t >>>= 13)),\n t >= 64 && ((r += 7), (t >>>= 7)),\n t >= 8 && ((r += 4), (t >>>= 4)),\n t >= 2 && ((r += 2), (t >>>= 2)),\n r + t\n );\n }),\n (BN.prototype._zeroBits = function (w) {\n if (w === 0) return 26;\n var t = w,\n r = 0;\n return (\n (t & 8191) === 0 && ((r += 13), (t >>>= 13)),\n (t & 127) === 0 && ((r += 7), (t >>>= 7)),\n (t & 15) === 0 && ((r += 4), (t >>>= 4)),\n (t & 3) === 0 && ((r += 2), (t >>>= 2)),\n (t & 1) === 0 && r++,\n r\n );\n }),\n (BN.prototype.bitLength = function () {\n var w = this.words[this.length - 1],\n hi = this._countBits(w);\n return (this.length - 1) * 26 + hi;\n });\n function toBitArray(num) {\n for (var w = new Array(num.bitLength()), bit = 0; bit < w.length; bit++) {\n var off = (bit / 26) | 0,\n wbit = bit % 26;\n w[bit] = (num.words[off] & (1 << wbit)) >>> wbit;\n }\n return w;\n }\n (BN.prototype.zeroBits = function () {\n if (this.isZero()) return 0;\n for (var r = 0, i = 0; i < this.length; i++) {\n var b = this._zeroBits(this.words[i]);\n if (((r += b), b !== 26)) break;\n }\n return r;\n }),\n (BN.prototype.byteLength = function () {\n return Math.ceil(this.bitLength() / 8);\n }),\n (BN.prototype.toTwos = function (width) {\n return this.negative !== 0 ? this.abs().inotn(width).iaddn(1) : this.clone();\n }),\n (BN.prototype.fromTwos = function (width) {\n return this.testn(width - 1) ? this.notn(width).iaddn(1).ineg() : this.clone();\n }),\n (BN.prototype.isNeg = function () {\n return this.negative !== 0;\n }),\n (BN.prototype.neg = function () {\n return this.clone().ineg();\n }),\n (BN.prototype.ineg = function () {\n return this.isZero() || (this.negative ^= 1), this;\n }),\n (BN.prototype.iuor = function (num) {\n for (; this.length < num.length; ) this.words[this.length++] = 0;\n for (var i = 0; i < num.length; i++) this.words[i] = this.words[i] | num.words[i];\n return this.strip();\n }),\n (BN.prototype.ior = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuor(num);\n }),\n (BN.prototype.or = function (num) {\n return this.length > num.length ? this.clone().ior(num) : num.clone().ior(this);\n }),\n (BN.prototype.uor = function (num) {\n return this.length > num.length ? this.clone().iuor(num) : num.clone().iuor(this);\n }),\n (BN.prototype.iuand = function (num) {\n var b;\n this.length > num.length ? (b = num) : (b = this);\n for (var i = 0; i < b.length; i++) this.words[i] = this.words[i] & num.words[i];\n return (this.length = b.length), this.strip();\n }),\n (BN.prototype.iand = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuand(num);\n }),\n (BN.prototype.and = function (num) {\n return this.length > num.length ? this.clone().iand(num) : num.clone().iand(this);\n }),\n (BN.prototype.uand = function (num) {\n return this.length > num.length ? this.clone().iuand(num) : num.clone().iuand(this);\n }),\n (BN.prototype.iuxor = function (num) {\n var a, b;\n this.length > num.length ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var i = 0; i < b.length; i++) this.words[i] = a.words[i] ^ b.words[i];\n if (this !== a) for (; i < a.length; i++) this.words[i] = a.words[i];\n return (this.length = a.length), this.strip();\n }),\n (BN.prototype.ixor = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuxor(num);\n }),\n (BN.prototype.xor = function (num) {\n return this.length > num.length ? this.clone().ixor(num) : num.clone().ixor(this);\n }),\n (BN.prototype.uxor = function (num) {\n return this.length > num.length ? this.clone().iuxor(num) : num.clone().iuxor(this);\n }),\n (BN.prototype.inotn = function (width) {\n assert(typeof width == \"number\" && width >= 0);\n var bytesNeeded = Math.ceil(width / 26) | 0,\n bitsLeft = width % 26;\n this._expand(bytesNeeded), bitsLeft > 0 && bytesNeeded--;\n for (var i = 0; i < bytesNeeded; i++) this.words[i] = ~this.words[i] & 67108863;\n return bitsLeft > 0 && (this.words[i] = ~this.words[i] & (67108863 >> (26 - bitsLeft))), this.strip();\n }),\n (BN.prototype.notn = function (width) {\n return this.clone().inotn(width);\n }),\n (BN.prototype.setn = function (bit, val) {\n assert(typeof bit == \"number\" && bit >= 0);\n var off = (bit / 26) | 0,\n wbit = bit % 26;\n return (\n this._expand(off + 1),\n val\n ? (this.words[off] = this.words[off] | (1 << wbit))\n : (this.words[off] = this.words[off] & ~(1 << wbit)),\n this.strip()\n );\n }),\n (BN.prototype.iadd = function (num) {\n var r;\n if (this.negative !== 0 && num.negative === 0)\n return (this.negative = 0), (r = this.isub(num)), (this.negative ^= 1), this._normSign();\n if (this.negative === 0 && num.negative !== 0)\n return (num.negative = 0), (r = this.isub(num)), (num.negative = 1), r._normSign();\n var a, b;\n this.length > num.length ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var carry = 0, i = 0; i < b.length; i++)\n (r = (a.words[i] | 0) + (b.words[i] | 0) + carry), (this.words[i] = r & 67108863), (carry = r >>> 26);\n for (; carry !== 0 && i < a.length; i++)\n (r = (a.words[i] | 0) + carry), (this.words[i] = r & 67108863), (carry = r >>> 26);\n if (((this.length = a.length), carry !== 0)) (this.words[this.length] = carry), this.length++;\n else if (a !== this) for (; i < a.length; i++) this.words[i] = a.words[i];\n return this;\n }),\n (BN.prototype.add = function (num) {\n var res;\n return num.negative !== 0 && this.negative === 0\n ? ((num.negative = 0), (res = this.sub(num)), (num.negative ^= 1), res)\n : num.negative === 0 && this.negative !== 0\n ? ((this.negative = 0), (res = num.sub(this)), (this.negative = 1), res)\n : this.length > num.length\n ? this.clone().iadd(num)\n : num.clone().iadd(this);\n }),\n (BN.prototype.isub = function (num) {\n if (num.negative !== 0) {\n num.negative = 0;\n var r = this.iadd(num);\n return (num.negative = 1), r._normSign();\n } else if (this.negative !== 0)\n return (this.negative = 0), this.iadd(num), (this.negative = 1), this._normSign();\n var cmp = this.cmp(num);\n if (cmp === 0) return (this.negative = 0), (this.length = 1), (this.words[0] = 0), this;\n var a, b;\n cmp > 0 ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var carry = 0, i = 0; i < b.length; i++)\n (r = (a.words[i] | 0) - (b.words[i] | 0) + carry), (carry = r >> 26), (this.words[i] = r & 67108863);\n for (; carry !== 0 && i < a.length; i++)\n (r = (a.words[i] | 0) + carry), (carry = r >> 26), (this.words[i] = r & 67108863);\n if (carry === 0 && i < a.length && a !== this) for (; i < a.length; i++) this.words[i] = a.words[i];\n return (this.length = Math.max(this.length, i)), a !== this && (this.negative = 1), this.strip();\n }),\n (BN.prototype.sub = function (num) {\n return this.clone().isub(num);\n });\n function smallMulTo(self2, num, out) {\n out.negative = num.negative ^ self2.negative;\n var len = (self2.length + num.length) | 0;\n (out.length = len), (len = (len - 1) | 0);\n var a = self2.words[0] | 0,\n b = num.words[0] | 0,\n r = a * b,\n lo = r & 67108863,\n carry = (r / 67108864) | 0;\n out.words[0] = lo;\n for (var k = 1; k < len; k++) {\n for (\n var ncarry = carry >>> 26,\n rword = carry & 67108863,\n maxJ = Math.min(k, num.length - 1),\n j = Math.max(0, k - self2.length + 1);\n j <= maxJ;\n j++\n ) {\n var i = (k - j) | 0;\n (a = self2.words[i] | 0),\n (b = num.words[j] | 0),\n (r = a * b + rword),\n (ncarry += (r / 67108864) | 0),\n (rword = r & 67108863);\n }\n (out.words[k] = rword | 0), (carry = ncarry | 0);\n }\n return carry !== 0 ? (out.words[k] = carry | 0) : out.length--, out.strip();\n }\n var comb10MulTo = function (self2, num, out) {\n var a = self2.words,\n b = num.words,\n o = out.words,\n c = 0,\n lo,\n mid,\n hi,\n a0 = a[0] | 0,\n al0 = a0 & 8191,\n ah0 = a0 >>> 13,\n a1 = a[1] | 0,\n al1 = a1 & 8191,\n ah1 = a1 >>> 13,\n a2 = a[2] | 0,\n al2 = a2 & 8191,\n ah2 = a2 >>> 13,\n a3 = a[3] | 0,\n al3 = a3 & 8191,\n ah3 = a3 >>> 13,\n a4 = a[4] | 0,\n al4 = a4 & 8191,\n ah4 = a4 >>> 13,\n a5 = a[5] | 0,\n al5 = a5 & 8191,\n ah5 = a5 >>> 13,\n a6 = a[6] | 0,\n al6 = a6 & 8191,\n ah6 = a6 >>> 13,\n a7 = a[7] | 0,\n al7 = a7 & 8191,\n ah7 = a7 >>> 13,\n a8 = a[8] | 0,\n al8 = a8 & 8191,\n ah8 = a8 >>> 13,\n a9 = a[9] | 0,\n al9 = a9 & 8191,\n ah9 = a9 >>> 13,\n b0 = b[0] | 0,\n bl0 = b0 & 8191,\n bh0 = b0 >>> 13,\n b1 = b[1] | 0,\n bl1 = b1 & 8191,\n bh1 = b1 >>> 13,\n b2 = b[2] | 0,\n bl2 = b2 & 8191,\n bh2 = b2 >>> 13,\n b3 = b[3] | 0,\n bl3 = b3 & 8191,\n bh3 = b3 >>> 13,\n b4 = b[4] | 0,\n bl4 = b4 & 8191,\n bh4 = b4 >>> 13,\n b5 = b[5] | 0,\n bl5 = b5 & 8191,\n bh5 = b5 >>> 13,\n b6 = b[6] | 0,\n bl6 = b6 & 8191,\n bh6 = b6 >>> 13,\n b7 = b[7] | 0,\n bl7 = b7 & 8191,\n bh7 = b7 >>> 13,\n b8 = b[8] | 0,\n bl8 = b8 & 8191,\n bh8 = b8 >>> 13,\n b9 = b[9] | 0,\n bl9 = b9 & 8191,\n bh9 = b9 >>> 13;\n (out.negative = self2.negative ^ num.negative),\n (out.length = 19),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w0 >>> 26)) | 0),\n (w0 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w1 >>> 26)) | 0),\n (w1 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w2 >>> 26)) | 0),\n (w2 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w3 >>> 26)) | 0),\n (w3 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w4 >>> 26)) | 0),\n (w4 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w5 >>> 26)) | 0),\n (w5 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w6 >>> 26)) | 0),\n (w6 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w7 >>> 26)) | 0),\n (w7 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w8 >>> 26)) | 0),\n (w8 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w9 >>> 26)) | 0),\n (w9 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w10 >>> 26)) | 0),\n (w10 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w11 >>> 26)) | 0),\n (w11 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w12 >>> 26)) | 0),\n (w12 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w13 >>> 26)) | 0),\n (w13 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w14 >>> 26)) | 0),\n (w14 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w15 >>> 26)) | 0),\n (w15 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w16 >>> 26)) | 0),\n (w16 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w17 >>> 26)) | 0),\n (w17 &= 67108863),\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 & 8191) << 13)) | 0;\n return (\n (c = (((hi + (mid >>> 13)) | 0) + (w18 >>> 26)) | 0),\n (w18 &= 67108863),\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 c !== 0 && ((o[19] = c), out.length++),\n out\n );\n };\n Math.imul || (comb10MulTo = smallMulTo);\n function bigMulTo(self2, num, out) {\n (out.negative = num.negative ^ self2.negative), (out.length = self2.length + num.length);\n for (var carry = 0, hncarry = 0, k = 0; k < out.length - 1; k++) {\n var ncarry = hncarry;\n hncarry = 0;\n for (\n var rword = carry & 67108863, maxJ = Math.min(k, num.length - 1), j = Math.max(0, k - self2.length + 1);\n j <= maxJ;\n j++\n ) {\n var i = k - j,\n a = self2.words[i] | 0,\n b = num.words[j] | 0,\n r = a * b,\n lo = r & 67108863;\n (ncarry = (ncarry + ((r / 67108864) | 0)) | 0),\n (lo = (lo + rword) | 0),\n (rword = lo & 67108863),\n (ncarry = (ncarry + (lo >>> 26)) | 0),\n (hncarry += ncarry >>> 26),\n (ncarry &= 67108863);\n }\n (out.words[k] = rword), (carry = ncarry), (ncarry = hncarry);\n }\n return carry !== 0 ? (out.words[k] = carry) : out.length--, out.strip();\n }\n function jumboMulTo(self2, num, out) {\n var fftm = new FFTM();\n return fftm.mulp(self2, num, out);\n }\n BN.prototype.mulTo = function (num, out) {\n var res,\n len = this.length + num.length;\n return (\n this.length === 10 && num.length === 10\n ? (res = comb10MulTo(this, num, out))\n : len < 63\n ? (res = smallMulTo(this, num, out))\n : len < 1024\n ? (res = bigMulTo(this, num, out))\n : (res = jumboMulTo(this, num, out)),\n res\n );\n };\n function FFTM(x, y) {\n (this.x = x), (this.y = y);\n }\n (FFTM.prototype.makeRBT = function (N) {\n for (var t = new Array(N), l = BN.prototype._countBits(N) - 1, i = 0; i < N; i++) t[i] = this.revBin(i, l, N);\n return t;\n }),\n (FFTM.prototype.revBin = function (x, l, N) {\n if (x === 0 || x === N - 1) return x;\n for (var rb = 0, i = 0; i < l; i++) (rb |= (x & 1) << (l - i - 1)), (x >>= 1);\n return rb;\n }),\n (FFTM.prototype.permute = function (rbt, rws, iws, rtws, itws, N) {\n for (var i = 0; i < N; i++) (rtws[i] = rws[rbt[i]]), (itws[i] = iws[rbt[i]]);\n }),\n (FFTM.prototype.transform = function (rws, iws, rtws, itws, N, rbt) {\n this.permute(rbt, rws, iws, rtws, itws, N);\n for (var s = 1; s < N; s <<= 1)\n for (\n var l = s << 1, rtwdf = Math.cos((2 * Math.PI) / l), itwdf = Math.sin((2 * Math.PI) / l), p = 0;\n p < N;\n p += l\n )\n for (var rtwdf_ = rtwdf, itwdf_ = itwdf, j = 0; j < s; j++) {\n var re = rtws[p + j],\n ie = itws[p + j],\n ro = rtws[p + j + s],\n io = itws[p + j + s],\n rx = rtwdf_ * ro - itwdf_ * io;\n (io = rtwdf_ * io + itwdf_ * ro),\n (ro = rx),\n (rtws[p + j] = re + ro),\n (itws[p + j] = ie + io),\n (rtws[p + j + s] = re - ro),\n (itws[p + j + s] = ie - io),\n j !== l &&\n ((rx = rtwdf * rtwdf_ - itwdf * itwdf_), (itwdf_ = rtwdf * itwdf_ + itwdf * rtwdf_), (rtwdf_ = rx));\n }\n }),\n (FFTM.prototype.guessLen13b = function (n, m) {\n var N = Math.max(m, n) | 1,\n odd = N & 1,\n i = 0;\n for (N = (N / 2) | 0; N; N = N >>> 1) i++;\n return 1 << (i + 1 + odd);\n }),\n (FFTM.prototype.conjugate = function (rws, iws, N) {\n if (!(N <= 1))\n for (var i = 0; i < N / 2; i++) {\n var t = rws[i];\n (rws[i] = rws[N - i - 1]),\n (rws[N - i - 1] = t),\n (t = iws[i]),\n (iws[i] = -iws[N - i - 1]),\n (iws[N - i - 1] = -t);\n }\n }),\n (FFTM.prototype.normalize13b = function (ws, N) {\n for (var carry = 0, i = 0; i < N / 2; i++) {\n var w = Math.round(ws[2 * i + 1] / N) * 8192 + Math.round(ws[2 * i] / N) + carry;\n (ws[i] = w & 67108863), w < 67108864 ? (carry = 0) : (carry = (w / 67108864) | 0);\n }\n return ws;\n }),\n (FFTM.prototype.convert13b = function (ws, len, rws, N) {\n for (var carry = 0, i = 0; i < len; i++)\n (carry = carry + (ws[i] | 0)),\n (rws[2 * i] = carry & 8191),\n (carry = carry >>> 13),\n (rws[2 * i + 1] = carry & 8191),\n (carry = carry >>> 13);\n for (i = 2 * len; i < N; ++i) rws[i] = 0;\n assert(carry === 0), assert((carry & -8192) === 0);\n }),\n (FFTM.prototype.stub = function (N) {\n for (var ph = new Array(N), i = 0; i < N; i++) ph[i] = 0;\n return ph;\n }),\n (FFTM.prototype.mulp = function (x, y, out) {\n var N = 2 * this.guessLen13b(x.length, y.length),\n rbt = this.makeRBT(N),\n _ = this.stub(N),\n rws = new Array(N),\n rwst = new Array(N),\n iwst = new Array(N),\n nrws = new Array(N),\n nrwst = new Array(N),\n niwst = new Array(N),\n rmws = out.words;\n (rmws.length = N),\n this.convert13b(x.words, x.length, rws, N),\n this.convert13b(y.words, y.length, nrws, N),\n this.transform(rws, _, rwst, iwst, N, rbt),\n this.transform(nrws, _, nrwst, niwst, N, rbt);\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]), (rwst[i] = rx);\n }\n return (\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 (out.negative = x.negative ^ y.negative),\n (out.length = x.length + y.length),\n out.strip()\n );\n }),\n (BN.prototype.mul = function (num) {\n var out = new BN(null);\n return (out.words = new Array(this.length + num.length)), this.mulTo(num, out);\n }),\n (BN.prototype.mulf = function (num) {\n var out = new BN(null);\n return (out.words = new Array(this.length + num.length)), jumboMulTo(this, num, out);\n }),\n (BN.prototype.imul = function (num) {\n return this.clone().mulTo(num, this);\n }),\n (BN.prototype.imuln = function (num) {\n assert(typeof num == \"number\"), assert(num < 67108864);\n for (var carry = 0, i = 0; i < this.length; i++) {\n var w = (this.words[i] | 0) * num,\n lo = (w & 67108863) + (carry & 67108863);\n (carry >>= 26), (carry += (w / 67108864) | 0), (carry += lo >>> 26), (this.words[i] = lo & 67108863);\n }\n return carry !== 0 && ((this.words[i] = carry), this.length++), this;\n }),\n (BN.prototype.muln = function (num) {\n return this.clone().imuln(num);\n }),\n (BN.prototype.sqr = function () {\n return this.mul(this);\n }),\n (BN.prototype.isqr = function () {\n return this.imul(this.clone());\n }),\n (BN.prototype.pow = function (num) {\n var w = toBitArray(num);\n if (w.length === 0) return new BN(1);\n for (var res = this, i = 0; i < w.length && w[i] === 0; i++, res = res.sqr());\n if (++i < w.length) for (var q = res.sqr(); i < w.length; i++, q = q.sqr()) w[i] !== 0 && (res = res.mul(q));\n return res;\n }),\n (BN.prototype.iushln = function (bits) {\n assert(typeof bits == \"number\" && bits >= 0);\n var r = bits % 26,\n s = (bits - r) / 26,\n carryMask = (67108863 >>> (26 - r)) << (26 - r),\n i;\n if (r !== 0) {\n var carry = 0;\n for (i = 0; i < this.length; i++) {\n var newCarry = this.words[i] & carryMask,\n c = ((this.words[i] | 0) - newCarry) << r;\n (this.words[i] = c | carry), (carry = newCarry >>> (26 - r));\n }\n carry && ((this.words[i] = carry), this.length++);\n }\n if (s !== 0) {\n for (i = this.length - 1; i >= 0; i--) this.words[i + s] = this.words[i];\n for (i = 0; i < s; i++) this.words[i] = 0;\n this.length += s;\n }\n return this.strip();\n }),\n (BN.prototype.ishln = function (bits) {\n return assert(this.negative === 0), this.iushln(bits);\n }),\n (BN.prototype.iushrn = function (bits, hint, extended) {\n assert(typeof bits == \"number\" && bits >= 0);\n var h;\n hint ? (h = (hint - (hint % 26)) / 26) : (h = 0);\n var r = bits % 26,\n s = Math.min((bits - r) / 26, this.length),\n mask = 67108863 ^ ((67108863 >>> r) << r),\n maskedWords = extended;\n if (((h -= s), (h = Math.max(0, h)), maskedWords)) {\n for (var i = 0; i < s; i++) maskedWords.words[i] = this.words[i];\n maskedWords.length = s;\n }\n if (s !== 0)\n if (this.length > s) for (this.length -= s, i = 0; i < this.length; i++) this.words[i] = this.words[i + s];\n else (this.words[0] = 0), (this.length = 1);\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)), (carry = word & mask);\n }\n return (\n maskedWords && carry !== 0 && (maskedWords.words[maskedWords.length++] = carry),\n this.length === 0 && ((this.words[0] = 0), (this.length = 1)),\n this.strip()\n );\n }),\n (BN.prototype.ishrn = function (bits, hint, extended) {\n return assert(this.negative === 0), this.iushrn(bits, hint, extended);\n }),\n (BN.prototype.shln = function (bits) {\n return this.clone().ishln(bits);\n }),\n (BN.prototype.ushln = function (bits) {\n return this.clone().iushln(bits);\n }),\n (BN.prototype.shrn = function (bits) {\n return this.clone().ishrn(bits);\n }),\n (BN.prototype.ushrn = function (bits) {\n return this.clone().iushrn(bits);\n }),\n (BN.prototype.testn = function (bit) {\n assert(typeof bit == \"number\" && bit >= 0);\n var r = bit % 26,\n s = (bit - r) / 26,\n q = 1 << r;\n if (this.length <= s) return !1;\n var w = this.words[s];\n return !!(w & q);\n }),\n (BN.prototype.imaskn = function (bits) {\n assert(typeof bits == \"number\" && bits >= 0);\n var r = bits % 26,\n s = (bits - r) / 26;\n if ((assert(this.negative === 0, \"imaskn works only with positive numbers\"), this.length <= s)) return this;\n if ((r !== 0 && s++, (this.length = Math.min(s, this.length)), r !== 0)) {\n var mask = 67108863 ^ ((67108863 >>> r) << r);\n this.words[this.length - 1] &= mask;\n }\n return this.strip();\n }),\n (BN.prototype.maskn = function (bits) {\n return this.clone().imaskn(bits);\n }),\n (BN.prototype.iaddn = function (num) {\n return (\n assert(typeof num == \"number\"),\n assert(num < 67108864),\n num < 0\n ? this.isubn(-num)\n : this.negative !== 0\n ? this.length === 1 && (this.words[0] | 0) < num\n ? ((this.words[0] = num - (this.words[0] | 0)), (this.negative = 0), this)\n : ((this.negative = 0), this.isubn(num), (this.negative = 1), this)\n : this._iaddn(num)\n );\n }),\n (BN.prototype._iaddn = function (num) {\n this.words[0] += num;\n for (var i = 0; i < this.length && this.words[i] >= 67108864; i++)\n (this.words[i] -= 67108864), i === this.length - 1 ? (this.words[i + 1] = 1) : this.words[i + 1]++;\n return (this.length = Math.max(this.length, i + 1)), this;\n }),\n (BN.prototype.isubn = function (num) {\n if ((assert(typeof num == \"number\"), assert(num < 67108864), num < 0)) return this.iaddn(-num);\n if (this.negative !== 0) return (this.negative = 0), this.iaddn(num), (this.negative = 1), this;\n if (((this.words[0] -= num), this.length === 1 && this.words[0] < 0))\n (this.words[0] = -this.words[0]), (this.negative = 1);\n else\n for (var i = 0; i < this.length && this.words[i] < 0; i++)\n (this.words[i] += 67108864), (this.words[i + 1] -= 1);\n return this.strip();\n }),\n (BN.prototype.addn = function (num) {\n return this.clone().iaddn(num);\n }),\n (BN.prototype.subn = function (num) {\n return this.clone().isubn(num);\n }),\n (BN.prototype.iabs = function () {\n return (this.negative = 0), this;\n }),\n (BN.prototype.abs = function () {\n return this.clone().iabs();\n }),\n (BN.prototype._ishlnsubmul = function (num, mul, shift) {\n var len = num.length + shift,\n i;\n this._expand(len);\n var w,\n 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 & 67108863),\n (carry = (w >> 26) - ((right / 67108864) | 0)),\n (this.words[i + shift] = w & 67108863);\n }\n for (; i < this.length - shift; i++)\n (w = (this.words[i + shift] | 0) + carry), (carry = w >> 26), (this.words[i + shift] = w & 67108863);\n if (carry === 0) return this.strip();\n for (assert(carry === -1), carry = 0, i = 0; i < this.length; i++)\n (w = -(this.words[i] | 0) + carry), (carry = w >> 26), (this.words[i] = w & 67108863);\n return (this.negative = 1), this.strip();\n }),\n (BN.prototype._wordDiv = function (num, mode) {\n var shift = this.length - num.length,\n a = this.clone(),\n b = num,\n bhi = b.words[b.length - 1] | 0,\n bhiBits = this._countBits(bhi);\n (shift = 26 - bhiBits),\n shift !== 0 && ((b = b.ushln(shift)), a.iushln(shift), (bhi = b.words[b.length - 1] | 0));\n var m = a.length - b.length,\n q;\n if (mode !== \"mod\") {\n (q = new BN(null)), (q.length = m + 1), (q.words = new Array(q.length));\n for (var i = 0; i < q.length; i++) q.words[i] = 0;\n }\n var diff = a.clone()._ishlnsubmul(b, 1, m);\n diff.negative === 0 && ((a = diff), q && (q.words[m] = 1));\n for (var j = m - 1; j >= 0; j--) {\n var qj = (a.words[b.length + j] | 0) * 67108864 + (a.words[b.length + j - 1] | 0);\n for (qj = Math.min((qj / bhi) | 0, 67108863), a._ishlnsubmul(b, qj, j); a.negative !== 0; )\n qj--, (a.negative = 0), a._ishlnsubmul(b, 1, j), a.isZero() || (a.negative ^= 1);\n q && (q.words[j] = qj);\n }\n return (\n q && q.strip(),\n a.strip(),\n mode !== \"div\" && shift !== 0 && a.iushrn(shift),\n {\n div: q || null,\n mod: a,\n }\n );\n }),\n (BN.prototype.divmod = function (num, mode, positive) {\n if ((assert(!num.isZero()), this.isZero()))\n return {\n div: new BN(0),\n mod: new BN(0),\n };\n var div, mod, res;\n return this.negative !== 0 && num.negative === 0\n ? ((res = this.neg().divmod(num, mode)),\n mode !== \"mod\" && (div = res.div.neg()),\n mode !== \"div\" && ((mod = res.mod.neg()), positive && mod.negative !== 0 && mod.iadd(num)),\n {\n div,\n mod,\n })\n : this.negative === 0 && num.negative !== 0\n ? ((res = this.divmod(num.neg(), mode)),\n mode !== \"mod\" && (div = res.div.neg()),\n {\n div,\n mod: res.mod,\n })\n : (this.negative & num.negative) !== 0\n ? ((res = this.neg().divmod(num.neg(), mode)),\n mode !== \"div\" && ((mod = res.mod.neg()), positive && mod.negative !== 0 && mod.isub(num)),\n {\n div: res.div,\n mod,\n })\n : num.length > this.length || this.cmp(num) < 0\n ? {\n div: new BN(0),\n mod: this,\n }\n : num.length === 1\n ? mode === \"div\"\n ? {\n div: this.divn(num.words[0]),\n mod: null,\n }\n : mode === \"mod\"\n ? {\n div: null,\n mod: new BN(this.modn(num.words[0])),\n }\n : {\n div: this.divn(num.words[0]),\n mod: new BN(this.modn(num.words[0])),\n }\n : this._wordDiv(num, mode);\n }),\n (BN.prototype.div = function (num) {\n return this.divmod(num, \"div\", !1).div;\n }),\n (BN.prototype.mod = function (num) {\n return this.divmod(num, \"mod\", !1).mod;\n }),\n (BN.prototype.umod = function (num) {\n return this.divmod(num, \"mod\", !0).mod;\n }),\n (BN.prototype.divRound = function (num) {\n var dm = this.divmod(num);\n if (dm.mod.isZero()) return dm.div;\n var mod = dm.div.negative !== 0 ? dm.mod.isub(num) : dm.mod,\n half = num.ushrn(1),\n r2 = num.andln(1),\n cmp = mod.cmp(half);\n return cmp < 0 || (r2 === 1 && cmp === 0)\n ? dm.div\n : dm.div.negative !== 0\n ? dm.div.isubn(1)\n : dm.div.iaddn(1);\n }),\n (BN.prototype.modn = function (num) {\n assert(num <= 67108863);\n for (var p = (1 << 26) % num, acc = 0, i = this.length - 1; i >= 0; i--)\n acc = (p * acc + (this.words[i] | 0)) % num;\n return acc;\n }),\n (BN.prototype.idivn = function (num) {\n assert(num <= 67108863);\n for (var carry = 0, i = this.length - 1; i >= 0; i--) {\n var w = (this.words[i] | 0) + carry * 67108864;\n (this.words[i] = (w / num) | 0), (carry = w % num);\n }\n return this.strip();\n }),\n (BN.prototype.divn = function (num) {\n return this.clone().idivn(num);\n }),\n (BN.prototype.egcd = function (p) {\n assert(p.negative === 0), assert(!p.isZero());\n var x = this,\n y = p.clone();\n x.negative !== 0 ? (x = x.umod(p)) : (x = x.clone());\n for (var A = new BN(1), B = new BN(0), C = new BN(0), D = new BN(1), g = 0; x.isEven() && y.isEven(); )\n x.iushrn(1), y.iushrn(1), ++g;\n for (var yp = y.clone(), xp = x.clone(); !x.isZero(); ) {\n for (var i = 0, im = 1; (x.words[0] & im) === 0 && i < 26; ++i, im <<= 1);\n if (i > 0)\n for (x.iushrn(i); i-- > 0; )\n (A.isOdd() || B.isOdd()) && (A.iadd(yp), B.isub(xp)), A.iushrn(1), B.iushrn(1);\n for (var j = 0, jm = 1; (y.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n if (j > 0)\n for (y.iushrn(j); j-- > 0; )\n (C.isOdd() || D.isOdd()) && (C.iadd(yp), D.isub(xp)), C.iushrn(1), D.iushrn(1);\n x.cmp(y) >= 0 ? (x.isub(y), A.isub(C), B.isub(D)) : (y.isub(x), C.isub(A), D.isub(B));\n }\n return {\n a: C,\n b: D,\n gcd: y.iushln(g),\n };\n }),\n (BN.prototype._invmp = function (p) {\n assert(p.negative === 0), assert(!p.isZero());\n var a = this,\n b = p.clone();\n a.negative !== 0 ? (a = a.umod(p)) : (a = a.clone());\n for (var x1 = new BN(1), x2 = new BN(0), delta = b.clone(); 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) for (a.iushrn(i); i-- > 0; ) x1.isOdd() && x1.iadd(delta), x1.iushrn(1);\n for (var j = 0, jm = 1; (b.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n if (j > 0) for (b.iushrn(j); j-- > 0; ) x2.isOdd() && x2.iadd(delta), x2.iushrn(1);\n a.cmp(b) >= 0 ? (a.isub(b), x1.isub(x2)) : (b.isub(a), x2.isub(x1));\n }\n var res;\n return a.cmpn(1) === 0 ? (res = x1) : (res = x2), res.cmpn(0) < 0 && res.iadd(p), res;\n }),\n (BN.prototype.gcd = function (num) {\n if (this.isZero()) return num.abs();\n if (num.isZero()) return this.abs();\n var a = this.clone(),\n b = num.clone();\n (a.negative = 0), (b.negative = 0);\n for (var shift = 0; a.isEven() && b.isEven(); shift++) a.iushrn(1), b.iushrn(1);\n do {\n for (; a.isEven(); ) a.iushrn(1);\n for (; b.isEven(); ) b.iushrn(1);\n var r = a.cmp(b);\n if (r < 0) {\n var t = a;\n (a = b), (b = t);\n } else if (r === 0 || b.cmpn(1) === 0) break;\n a.isub(b);\n } while (!0);\n return b.iushln(shift);\n }),\n (BN.prototype.invm = function (num) {\n return this.egcd(num).a.umod(num);\n }),\n (BN.prototype.isEven = function () {\n return (this.words[0] & 1) === 0;\n }),\n (BN.prototype.isOdd = function () {\n return (this.words[0] & 1) === 1;\n }),\n (BN.prototype.andln = function (num) {\n return this.words[0] & num;\n }),\n (BN.prototype.bincn = function (bit) {\n assert(typeof bit == \"number\");\n var r = bit % 26,\n s = (bit - r) / 26,\n q = 1 << r;\n if (this.length <= s) return this._expand(s + 1), (this.words[s] |= q), this;\n for (var carry = q, i = s; carry !== 0 && i < this.length; i++) {\n var w = this.words[i] | 0;\n (w += carry), (carry = w >>> 26), (w &= 67108863), (this.words[i] = w);\n }\n return carry !== 0 && ((this.words[i] = carry), this.length++), this;\n }),\n (BN.prototype.isZero = function () {\n return this.length === 1 && this.words[0] === 0;\n }),\n (BN.prototype.cmpn = function (num) {\n var negative = num < 0;\n if (this.negative !== 0 && !negative) return -1;\n if (this.negative === 0 && negative) return 1;\n this.strip();\n var res;\n if (this.length > 1) res = 1;\n else {\n negative && (num = -num), assert(num <= 67108863, \"Number is too big\");\n var w = this.words[0] | 0;\n res = w === num ? 0 : w < num ? -1 : 1;\n }\n return this.negative !== 0 ? -res | 0 : res;\n }),\n (BN.prototype.cmp = function (num) {\n if (this.negative !== 0 && num.negative === 0) return -1;\n if (this.negative === 0 && num.negative !== 0) return 1;\n var res = this.ucmp(num);\n return this.negative !== 0 ? -res | 0 : res;\n }),\n (BN.prototype.ucmp = function (num) {\n if (this.length > num.length) return 1;\n if (this.length < num.length) return -1;\n for (var res = 0, i = this.length - 1; i >= 0; i--) {\n var a = this.words[i] | 0,\n b = num.words[i] | 0;\n if (a !== b) {\n a < b ? (res = -1) : a > b && (res = 1);\n break;\n }\n }\n return res;\n }),\n (BN.prototype.gtn = function (num) {\n return this.cmpn(num) === 1;\n }),\n (BN.prototype.gt = function (num) {\n return this.cmp(num) === 1;\n }),\n (BN.prototype.gten = function (num) {\n return this.cmpn(num) >= 0;\n }),\n (BN.prototype.gte = function (num) {\n return this.cmp(num) >= 0;\n }),\n (BN.prototype.ltn = function (num) {\n return this.cmpn(num) === -1;\n }),\n (BN.prototype.lt = function (num) {\n return this.cmp(num) === -1;\n }),\n (BN.prototype.lten = function (num) {\n return this.cmpn(num) <= 0;\n }),\n (BN.prototype.lte = function (num) {\n return this.cmp(num) <= 0;\n }),\n (BN.prototype.eqn = function (num) {\n return this.cmpn(num) === 0;\n }),\n (BN.prototype.eq = function (num) {\n return this.cmp(num) === 0;\n }),\n (BN.red = function (num) {\n return new Red(num);\n }),\n (BN.prototype.toRed = function (ctx) {\n return (\n assert(!this.red, \"Already a number in reduction context\"),\n assert(this.negative === 0, \"red works only with positives\"),\n ctx.convertTo(this)._forceRed(ctx)\n );\n }),\n (BN.prototype.fromRed = function () {\n return assert(this.red, \"fromRed works only with numbers in reduction context\"), this.red.convertFrom(this);\n }),\n (BN.prototype._forceRed = function (ctx) {\n return (this.red = ctx), this;\n }),\n (BN.prototype.forceRed = function (ctx) {\n return assert(!this.red, \"Already a number in reduction context\"), this._forceRed(ctx);\n }),\n (BN.prototype.redAdd = function (num) {\n return assert(this.red, \"redAdd works only with red numbers\"), this.red.add(this, num);\n }),\n (BN.prototype.redIAdd = function (num) {\n return assert(this.red, \"redIAdd works only with red numbers\"), this.red.iadd(this, num);\n }),\n (BN.prototype.redSub = function (num) {\n return assert(this.red, \"redSub works only with red numbers\"), this.red.sub(this, num);\n }),\n (BN.prototype.redISub = function (num) {\n return assert(this.red, \"redISub works only with red numbers\"), this.red.isub(this, num);\n }),\n (BN.prototype.redShl = function (num) {\n return assert(this.red, \"redShl works only with red numbers\"), this.red.shl(this, num);\n }),\n (BN.prototype.redMul = function (num) {\n return (\n assert(this.red, \"redMul works only with red numbers\"),\n this.red._verify2(this, num),\n this.red.mul(this, num)\n );\n }),\n (BN.prototype.redIMul = function (num) {\n return (\n assert(this.red, \"redMul works only with red numbers\"),\n this.red._verify2(this, num),\n this.red.imul(this, num)\n );\n }),\n (BN.prototype.redSqr = function () {\n return assert(this.red, \"redSqr works only with red numbers\"), this.red._verify1(this), this.red.sqr(this);\n }),\n (BN.prototype.redISqr = function () {\n return assert(this.red, \"redISqr works only with red numbers\"), this.red._verify1(this), this.red.isqr(this);\n }),\n (BN.prototype.redSqrt = function () {\n return assert(this.red, \"redSqrt works only with red numbers\"), this.red._verify1(this), this.red.sqrt(this);\n }),\n (BN.prototype.redInvm = function () {\n return assert(this.red, \"redInvm works only with red numbers\"), this.red._verify1(this), this.red.invm(this);\n }),\n (BN.prototype.redNeg = function () {\n return assert(this.red, \"redNeg works only with red numbers\"), this.red._verify1(this), this.red.neg(this);\n }),\n (BN.prototype.redPow = function (num) {\n return assert(this.red && !num.red, \"redPow(normalNum)\"), this.red._verify1(this), this.red.pow(this, num);\n });\n var primes = {\n k256: null,\n p224: null,\n p192: null,\n p25519: null,\n };\n function MPrime(name, p) {\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 (this.tmp = this._tmp());\n }\n (MPrime.prototype._tmp = function () {\n var tmp = new BN(null);\n return (tmp.words = new Array(Math.ceil(this.n / 13))), tmp;\n }),\n (MPrime.prototype.ireduce = function (num) {\n var r = num,\n rlen;\n do this.split(r, this.tmp), (r = this.imulK(r)), (r = r.iadd(this.tmp)), (rlen = r.bitLength());\n while (rlen > this.n);\n var cmp = rlen < this.n ? -1 : r.ucmp(this.p);\n return (\n cmp === 0\n ? ((r.words[0] = 0), (r.length = 1))\n : cmp > 0\n ? r.isub(this.p)\n : r.strip !== void 0\n ? r.strip()\n : r._strip(),\n r\n );\n }),\n (MPrime.prototype.split = function (input, out) {\n input.iushrn(this.n, 0, out);\n }),\n (MPrime.prototype.imulK = function (num) {\n return num.imul(this.k);\n });\n function K256() {\n MPrime.call(this, \"k256\", \"ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f\");\n }\n inherits(K256, MPrime),\n (K256.prototype.split = function (input, output) {\n for (var mask = 4194303, outLen = Math.min(input.length, 9), i = 0; i < outLen; i++)\n output.words[i] = input.words[i];\n if (((output.length = outLen), input.length <= 9)) {\n (input.words[0] = 0), (input.length = 1);\n return;\n }\n var prev = input.words[9];\n for (output.words[output.length++] = prev & mask, i = 10; i < input.length; i++) {\n var next = input.words[i] | 0;\n (input.words[i - 10] = ((next & mask) << 4) | (prev >>> 22)), (prev = next);\n }\n (prev >>>= 22),\n (input.words[i - 10] = prev),\n prev === 0 && input.length > 10 ? (input.length -= 10) : (input.length -= 9);\n }),\n (K256.prototype.imulK = function (num) {\n (num.words[num.length] = 0), (num.words[num.length + 1] = 0), (num.length += 2);\n for (var lo = 0, i = 0; i < num.length; i++) {\n var w = num.words[i] | 0;\n (lo += w * 977), (num.words[i] = lo & 67108863), (lo = w * 64 + ((lo / 67108864) | 0));\n }\n return (\n num.words[num.length - 1] === 0 && (num.length--, num.words[num.length - 1] === 0 && num.length--), num\n );\n });\n function P224() {\n MPrime.call(this, \"p224\", \"ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001\");\n }\n inherits(P224, MPrime);\n function P192() {\n MPrime.call(this, \"p192\", \"ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff\");\n }\n inherits(P192, MPrime);\n function P25519() {\n MPrime.call(this, \"25519\", \"7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed\");\n }\n inherits(P25519, MPrime),\n (P25519.prototype.imulK = function (num) {\n for (var carry = 0, i = 0; i < num.length; i++) {\n var hi = (num.words[i] | 0) * 19 + carry,\n lo = hi & 67108863;\n (hi >>>= 26), (num.words[i] = lo), (carry = hi);\n }\n return carry !== 0 && (num.words[num.length++] = carry), num;\n }),\n (BN._prime = function (name) {\n if (primes[name]) return primes[name];\n var prime2;\n if (name === \"k256\") prime2 = new K256();\n else if (name === \"p224\") prime2 = new P224();\n else if (name === \"p192\") prime2 = new P192();\n else if (name === \"p25519\") prime2 = new P25519();\n else throw new Error(\"Unknown prime \" + name);\n return (primes[name] = prime2), prime2;\n });\n function Red(m) {\n if (typeof m == \"string\") {\n var prime = BN._prime(m);\n (this.m = prime.p), (this.prime = prime);\n } else assert(m.gtn(1), \"modulus must be greater than 1\"), (this.m = m), (this.prime = null);\n }\n (Red.prototype._verify1 = function (a) {\n assert(a.negative === 0, \"red works only with positives\"), assert(a.red, \"red works only with red numbers\");\n }),\n (Red.prototype._verify2 = function (a, b) {\n assert((a.negative | b.negative) === 0, \"red works only with positives\"),\n assert(a.red && a.red === b.red, \"red works only with red numbers\");\n }),\n (Red.prototype.imod = function (a) {\n return this.prime ? this.prime.ireduce(a)._forceRed(this) : a.umod(this.m)._forceRed(this);\n }),\n (Red.prototype.neg = function (a) {\n return a.isZero() ? a.clone() : this.m.sub(a)._forceRed(this);\n }),\n (Red.prototype.add = function (a, b) {\n this._verify2(a, b);\n var res = a.add(b);\n return res.cmp(this.m) >= 0 && res.isub(this.m), res._forceRed(this);\n }),\n (Red.prototype.iadd = function (a, b) {\n this._verify2(a, b);\n var res = a.iadd(b);\n return res.cmp(this.m) >= 0 && res.isub(this.m), res;\n }),\n (Red.prototype.sub = function (a, b) {\n this._verify2(a, b);\n var res = a.sub(b);\n return res.cmpn(0) < 0 && res.iadd(this.m), res._forceRed(this);\n }),\n (Red.prototype.isub = function (a, b) {\n this._verify2(a, b);\n var res = a.isub(b);\n return res.cmpn(0) < 0 && res.iadd(this.m), res;\n }),\n (Red.prototype.shl = function (a, num) {\n return this._verify1(a), this.imod(a.ushln(num));\n }),\n (Red.prototype.imul = function (a, b) {\n return this._verify2(a, b), this.imod(a.imul(b));\n }),\n (Red.prototype.mul = function (a, b) {\n return this._verify2(a, b), this.imod(a.mul(b));\n }),\n (Red.prototype.isqr = function (a) {\n return this.imul(a, a.clone());\n }),\n (Red.prototype.sqr = function (a) {\n return this.mul(a, a);\n }),\n (Red.prototype.sqrt = function (a) {\n if (a.isZero()) return a.clone();\n var mod3 = this.m.andln(3);\n if ((assert(mod3 % 2 === 1), mod3 === 3)) {\n var pow = this.m.add(new BN(1)).iushrn(2);\n return this.pow(a, pow);\n }\n for (var q = this.m.subn(1), s = 0; !q.isZero() && q.andln(1) === 0; ) s++, q.iushrn(1);\n assert(!q.isZero());\n var one = new BN(1).toRed(this),\n nOne = one.redNeg(),\n lpow = this.m.subn(1).iushrn(1),\n z = this.m.bitLength();\n for (z = new BN(2 * z * z).toRed(this); this.pow(z, lpow).cmp(nOne) !== 0; ) z.redIAdd(nOne);\n for (\n var c = this.pow(z, q), r = this.pow(a, q.addn(1).iushrn(1)), t = this.pow(a, q), m = s;\n t.cmp(one) !== 0;\n\n ) {\n for (var tmp = t, i = 0; tmp.cmp(one) !== 0; i++) tmp = tmp.redSqr();\n assert(i < m);\n var b = this.pow(c, new BN(1).iushln(m - i - 1));\n (r = r.redMul(b)), (c = b.redSqr()), (t = t.redMul(c)), (m = i);\n }\n return r;\n }),\n (Red.prototype.invm = function (a) {\n var inv = a._invmp(this.m);\n return inv.negative !== 0 ? ((inv.negative = 0), this.imod(inv).redNeg()) : this.imod(inv);\n }),\n (Red.prototype.pow = function (a, num) {\n if (num.isZero()) return new BN(1).toRed(this);\n if (num.cmpn(1) === 0) return a.clone();\n var windowSize = 4,\n wnd = new Array(1 << windowSize);\n (wnd[0] = new BN(1).toRed(this)), (wnd[1] = a);\n for (var i = 2; i < wnd.length; i++) wnd[i] = this.mul(wnd[i - 1], a);\n var res = wnd[0],\n current = 0,\n currentLen = 0,\n start = num.bitLength() % 26;\n for (start === 0 && (start = 26), i = num.length - 1; i >= 0; i--) {\n for (var word = num.words[i], j = start - 1; j >= 0; j--) {\n var bit = (word >> j) & 1;\n if ((res !== wnd[0] && (res = this.sqr(res)), bit === 0 && current === 0)) {\n currentLen = 0;\n continue;\n }\n (current <<= 1),\n (current |= bit),\n currentLen++,\n !(currentLen !== windowSize && (i !== 0 || j !== 0)) &&\n ((res = this.mul(res, wnd[current])), (currentLen = 0), (current = 0));\n }\n start = 26;\n }\n return res;\n }),\n (Red.prototype.convertTo = function (num) {\n var r = num.umod(this.m);\n return r === num ? r.clone() : r;\n }),\n (Red.prototype.convertFrom = function (num) {\n var res = num.clone();\n return (res.red = null), res;\n }),\n (BN.mont = function (num) {\n return new Mont(num);\n });\n function Mont(m) {\n Red.call(this, m),\n (this.shift = this.m.bitLength()),\n this.shift % 26 !== 0 && (this.shift += 26 - (this.shift % 26)),\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 (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 (Mont.prototype.convertTo = function (num) {\n return this.imod(num.ushln(this.shift));\n }),\n (Mont.prototype.convertFrom = function (num) {\n var r = this.imod(num.mul(this.rinv));\n return (r.red = null), r;\n }),\n (Mont.prototype.imul = function (a, b) {\n if (a.isZero() || b.isZero()) return (a.words[0] = 0), (a.length = 1), a;\n var t = a.imul(b),\n c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m),\n u = t.isub(c).iushrn(this.shift),\n res = u;\n return (\n u.cmp(this.m) >= 0 ? (res = u.isub(this.m)) : u.cmpn(0) < 0 && (res = u.iadd(this.m)), res._forceRed(this)\n );\n }),\n (Mont.prototype.mul = function (a, b) {\n if (a.isZero() || b.isZero()) return new BN(0)._forceRed(this);\n var t = a.mul(b),\n c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m),\n u = t.isub(c).iushrn(this.shift),\n res = u;\n return (\n u.cmp(this.m) >= 0 ? (res = u.isub(this.m)) : u.cmpn(0) < 0 && (res = u.iadd(this.m)), res._forceRed(this)\n );\n }),\n (Mont.prototype.invm = function (a) {\n var res = this.imod(a._invmp(this.m).mul(this.r2));\n return res._forceRed(this);\n });\n })(typeof module > \"u\" || module, exports);\n },\n});\n\nconst { CryptoHasher } = globalThis.Bun;\n\n// node_modules/public-encrypt/withPublic.js\nvar require_withPublic = __commonJS({\n \"node_modules/public-encrypt/withPublic.js\"(exports, module) {\n var BN = require_bn7(),\n Buffer2 = require_safe_buffer().Buffer;\n function withPublic(paddedMsg, key) {\n return Buffer2.from(paddedMsg.toRed(BN.mont(key.modulus)).redPow(new BN(key.publicExponent)).fromRed().toArray());\n }\n module.exports = withPublic;\n },\n});\n\n// node_modules/public-encrypt/publicEncrypt.js\nvar require_publicEncrypt = __commonJS({\n \"node_modules/public-encrypt/publicEncrypt.js\"(exports, module) {\n var parseKeys = require_parse_asn1(),\n randomBytes = require_browser(),\n createHash = require_browser2(),\n mgf = require_mgf(),\n xor = require_xor(),\n BN = require_bn7(),\n withPublic = require_withPublic(),\n crt = require_browserify_rsa(),\n Buffer2 = require_safe_buffer().Buffer;\n module.exports = function (publicKey, msg, reverse) {\n var padding;\n publicKey.padding ? (padding = publicKey.padding) : reverse ? (padding = 1) : (padding = 4);\n var key = parseKeys(publicKey),\n paddedMsg;\n if (padding === 4) paddedMsg = oaep(key, msg);\n else if (padding === 1) paddedMsg = pkcs1(key, msg, reverse);\n else if (padding === 3) {\n if (((paddedMsg = new BN(msg)), paddedMsg.cmp(key.modulus) >= 0)) throw new Error(\"data too long for modulus\");\n } else throw new Error(\"unknown padding\");\n return reverse ? crt(paddedMsg, key) : withPublic(paddedMsg, key);\n };\n function oaep(key, msg) {\n var k = key.modulus.byteLength(),\n mLen = msg.length,\n iHash = createHash(\"sha1\").update(Buffer2.alloc(0)).digest(),\n hLen = iHash.length,\n hLen2 = 2 * hLen;\n if (mLen > k - hLen2 - 2) throw new Error(\"message too long\");\n var ps = Buffer2.alloc(k - mLen - hLen2 - 2),\n dblen = k - hLen - 1,\n seed = randomBytes(hLen),\n maskedDb = xor(Buffer2.concat([iHash, ps, Buffer2.alloc(1, 1), msg], dblen), mgf(seed, dblen)),\n maskedSeed = xor(seed, mgf(maskedDb, hLen));\n return new BN(Buffer2.concat([Buffer2.alloc(1), maskedSeed, maskedDb], k));\n }\n function pkcs1(key, msg, reverse) {\n var mLen = msg.length,\n k = key.modulus.byteLength();\n if (mLen > k - 11) throw new Error(\"message too long\");\n var ps;\n return (\n reverse ? (ps = Buffer2.alloc(k - mLen - 3, 255)) : (ps = nonZero(k - mLen - 3)),\n new BN(Buffer2.concat([Buffer2.from([0, reverse ? 1 : 2]), ps, Buffer2.alloc(1), msg], k))\n );\n }\n function nonZero(len) {\n for (var out = Buffer2.allocUnsafe(len), i = 0, cache = randomBytes(len * 2), cur = 0, num; i < len; )\n cur === cache.length && ((cache = randomBytes(len * 2)), (cur = 0)),\n (num = cache[cur++]),\n num && (out[i++] = num);\n return out;\n }\n },\n});\n\n// node_modules/public-encrypt/privateDecrypt.js\nvar require_privateDecrypt = __commonJS({\n \"node_modules/public-encrypt/privateDecrypt.js\"(exports, module) {\n var parseKeys = require_parse_asn1(),\n mgf = require_mgf(),\n xor = require_xor(),\n BN = require_bn7(),\n crt = require_browserify_rsa(),\n createHash = require_browser2(),\n withPublic = require_withPublic(),\n Buffer2 = require_safe_buffer().Buffer;\n module.exports = function (privateKey, enc, reverse) {\n var padding;\n privateKey.padding ? (padding = privateKey.padding) : reverse ? (padding = 1) : (padding = 4);\n var key = parseKeys(privateKey),\n k = key.modulus.byteLength();\n if (enc.length > k || new BN(enc).cmp(key.modulus) >= 0) throw new Error(\"decryption error\");\n var msg;\n reverse ? (msg = withPublic(new BN(enc), key)) : (msg = crt(enc, key));\n var zBuffer = Buffer2.alloc(k - msg.length);\n if (((msg = Buffer2.concat([zBuffer, msg], k)), padding === 4)) return oaep(key, msg);\n if (padding === 1) return pkcs1(key, msg, reverse);\n if (padding === 3) return msg;\n throw new Error(\"unknown padding\");\n };\n function oaep(key, msg) {\n var k = key.modulus.byteLength(),\n iHash = createHash(\"sha1\").update(Buffer2.alloc(0)).digest(),\n hLen = iHash.length;\n if (msg[0] !== 0) throw new Error(\"decryption error\");\n var maskedSeed = msg.slice(1, hLen + 1),\n maskedDb = msg.slice(hLen + 1),\n seed = xor(maskedSeed, mgf(maskedDb, hLen)),\n db = xor(maskedDb, mgf(seed, k - hLen - 1));\n if (compare(iHash, db.slice(0, hLen))) throw new Error(\"decryption error\");\n for (var i = hLen; db[i] === 0; ) i++;\n if (db[i++] !== 1) throw new Error(\"decryption error\");\n return db.slice(i);\n }\n function pkcs1(key, msg, reverse) {\n for (var p1 = msg.slice(0, 2), i = 2, status = 0; msg[i++] !== 0; )\n if (i >= msg.length) {\n status++;\n break;\n }\n var ps = msg.slice(2, i - 1);\n if (\n (((p1.toString(\"hex\") !== \"0002\" && !reverse) || (p1.toString(\"hex\") !== \"0001\" && reverse)) && status++,\n ps.length < 8 && status++,\n status)\n )\n throw new Error(\"decryption error\");\n return msg.slice(i);\n }\n function compare(a, b) {\n (a = Buffer2.from(a)), (b = Buffer2.from(b));\n var dif = 0,\n len = a.length;\n a.length !== b.length && (dif++, (len = Math.min(a.length, b.length)));\n for (var i = -1; ++i < len; ) dif += a[i] ^ b[i];\n return dif;\n }\n },\n});\n\n// node_modules/public-encrypt/browser.js\nvar require_browser10 = __commonJS({\n \"node_modules/public-encrypt/browser.js\"(exports) {\n exports.publicEncrypt = require_publicEncrypt();\n exports.privateDecrypt = require_privateDecrypt();\n exports.privateEncrypt = function (key, buf) {\n return exports.publicEncrypt(key, buf, !0);\n };\n exports.publicDecrypt = function (key, buf) {\n return exports.privateDecrypt(key, buf, !0);\n };\n },\n});\n\n// node_modules/randomfill/browser.js\nvar require_browser11 = __commonJS({\n \"node_modules/randomfill/browser.js\"(exports) {\n \"use strict\";\n var safeBuffer = require_safe_buffer(),\n randombytes = require_browser(),\n Buffer2 = safeBuffer.Buffer,\n kBufferMaxLength = safeBuffer.kMaxLength,\n kMaxUint32 = Math.pow(2, 32) - 1;\n function assertOffset(offset, length) {\n if (typeof offset != \"number\" || offset !== offset) throw new TypeError(\"offset must be a number\");\n if (offset > kMaxUint32 || offset < 0) throw new TypeError(\"offset must be a uint32\");\n if (offset > kBufferMaxLength || offset > length) throw new RangeError(\"offset out of range\");\n }\n function assertSize(size, offset, length) {\n if (typeof size != \"number\" || size !== size) throw new TypeError(\"size must be a number\");\n if (size > kMaxUint32 || size < 0) throw new TypeError(\"size must be a uint32\");\n if (size + offset > length || size > kBufferMaxLength) throw new RangeError(\"buffer too small\");\n }\n\n exports.randomFill = randomFill;\n exports.randomFillSync = randomFillSync;\n\n function randomFill(buf, offset, size, cb) {\n if (!Buffer2.isBuffer(buf) && !(buf instanceof global.Uint8Array))\n throw new TypeError('\"buf\" argument must be a Buffer or Uint8Array');\n if (typeof offset == \"function\") (cb = offset), (offset = 0), (size = buf.length);\n else if (typeof size == \"function\") (cb = size), (size = buf.length - offset);\n else if (typeof cb != \"function\") throw new TypeError('\"cb\" argument must be a function');\n return assertOffset(offset, buf.length), assertSize(size, offset, buf.length), actualFill(buf, offset, size, cb);\n }\n function actualFill(buf, offset, size, cb) {\n if (cb) {\n randombytes(size, function (err, bytes2) {\n if (err) return cb(err);\n bytes2.copy(buf, offset), cb(null, buf);\n });\n return;\n }\n var bytes = randombytes(size);\n return bytes.copy(buf, offset), buf;\n }\n function randomFillSync(buf, offset, size) {\n if ((typeof offset > \"u\" && (offset = 0), !Buffer2.isBuffer(buf) && !(buf instanceof global.Uint8Array)))\n throw new TypeError('\"buf\" argument must be a Buffer or Uint8Array');\n return (\n assertOffset(offset, buf.length),\n size === void 0 && (size = buf.length - offset),\n assertSize(size, offset, buf.length),\n actualFill(buf, offset, size)\n );\n }\n },\n});\n\n// node_modules/crypto-browserify/index.js\nvar require_crypto_browserify2 = __commonJS({\n \"node_modules/crypto-browserify/index.js\"(exports) {\n \"use strict\";\n exports.randomBytes = exports.rng = exports.pseudoRandomBytes = exports.prng = require_browser();\n exports.createHash = require_browser2();\n exports.Hash = exports.createHash.Hash;\n exports.createHmac = exports.Hmac = require_browser3();\n var algos = require_algos(),\n algoKeys = Object.keys(algos),\n hashes = [\"sha1\", \"sha224\", \"sha256\", \"sha384\", \"sha512\", \"md5\", \"rmd160\"].concat(algoKeys);\n exports.getHashes = function () {\n return hashes;\n };\n var p = require_browser4();\n exports.pbkdf2 = p.pbkdf2;\n exports.pbkdf2Sync = p.pbkdf2Sync;\n var aes = require_browser6();\n exports.Cipher = aes.Cipher;\n exports.createCipher = aes.createCipher;\n exports.Cipheriv = aes.Cipheriv;\n exports.createCipheriv = aes.createCipheriv;\n exports.Decipher = aes.Decipher;\n exports.createDecipher = aes.createDecipher;\n exports.Decipheriv = aes.Decipheriv;\n exports.createDecipheriv = aes.createDecipheriv;\n exports.getCiphers = aes.getCiphers;\n exports.listCiphers = aes.listCiphers;\n var dh = require_browser7();\n exports.DiffieHellmanGroup = dh.DiffieHellmanGroup;\n exports.createDiffieHellmanGroup = dh.createDiffieHellmanGroup;\n exports.getDiffieHellman = dh.getDiffieHellman;\n exports.createDiffieHellman = dh.createDiffieHellman;\n exports.DiffieHellman = dh.DiffieHellman;\n var sign = require_browser8();\n exports.createSign = sign.createSign;\n exports.Sign = sign.Sign;\n exports.createVerify = sign.createVerify;\n exports.Verify = sign.Verify;\n exports.createECDH = require_browser9();\n var publicEncrypt = require_browser10();\n exports.publicEncrypt = publicEncrypt.publicEncrypt;\n exports.privateEncrypt = publicEncrypt.privateEncrypt;\n exports.publicDecrypt = publicEncrypt.publicDecrypt;\n exports.privateDecrypt = publicEncrypt.privateDecrypt;\n exports.getRandomValues = values => crypto.getRandomValues(values);\n var rf = require_browser11();\n exports.randomFill = rf.randomFill;\n exports.randomFillSync = rf.randomFillSync;\n exports.createCredentials = function () {\n throw new Error(\n [\n \"sorry, createCredentials is not implemented yet\",\n \"we accept pull requests\",\n \"https://github.com/crypto-browserify/crypto-browserify\",\n ].join(`\n`),\n );\n };\n exports.constants = {\n DH_CHECK_P_NOT_SAFE_PRIME: 2,\n DH_CHECK_P_NOT_PRIME: 1,\n DH_UNABLE_TO_CHECK_GENERATOR: 4,\n DH_NOT_SUITABLE_GENERATOR: 8,\n NPN_ENABLED: 1,\n ALPN_ENABLED: 1,\n RSA_PKCS1_PADDING: 1,\n RSA_SSLV23_PADDING: 2,\n RSA_NO_PADDING: 3,\n RSA_PKCS1_OAEP_PADDING: 4,\n RSA_X931_PADDING: 5,\n RSA_PKCS1_PSS_PADDING: 6,\n POINT_CONVERSION_COMPRESSED: 2,\n POINT_CONVERSION_UNCOMPRESSED: 4,\n POINT_CONVERSION_HYBRID: 6,\n };\n },\n});\n\n// crypto.js\nvar crypto_exports = {\n ...require_crypto_browserify2(),\n [Symbol.for(\"CommonJS\")]: 0,\n};\nvar DEFAULT_ENCODING = \"buffer\",\n getRandomValues = array => crypto.getRandomValues(array),\n randomUUID = () => crypto.randomUUID(),\n timingSafeEqual =\n \"timingSafeEqual\" in crypto\n ? (a, b) => {\n let { byteLength: byteLengthA } = a,\n { byteLength: byteLengthB } = b;\n if (typeof byteLengthA != \"number\" || typeof byteLengthB != \"number\")\n throw new TypeError(\"Input must be an array buffer view\");\n if (byteLengthA !== byteLengthB) throw new RangeError(\"Input buffers must have the same length\");\n return crypto.timingSafeEqual(a, b);\n }\n : void 0,\n scryptSync =\n \"scryptSync\" in crypto\n ? (password, salt, keylen, options) => {\n let res = crypto.scryptSync(password, salt, keylen, options);\n return DEFAULT_ENCODING !== \"buffer\" ? new Buffer(res).toString(DEFAULT_ENCODING) : new Buffer(res);\n }\n : void 0,\n scrypt =\n \"scryptSync\" in crypto\n ? function (password, salt, keylen, options, callback) {\n if (\n (typeof options == \"function\" && ((callback = options), (options = void 0)), typeof callback != \"function\")\n ) {\n var err = new TypeError(\"callback must be a function\");\n throw ((err.code = \"ERR_INVALID_CALLBACK\"), err);\n }\n try {\n let result = crypto.scryptSync(password, salt, keylen, options);\n process.nextTick(\n callback,\n null,\n DEFAULT_ENCODING !== \"buffer\" ? new Buffer(result).toString(DEFAULT_ENCODING) : new Buffer(result),\n );\n } catch (err2) {\n throw err2;\n }\n }\n : void 0;\ntimingSafeEqual &&\n (Object.defineProperty(timingSafeEqual, \"name\", {\n value: \"::bunternal::\",\n }),\n Object.defineProperty(scrypt, \"name\", {\n value: \"::bunternal::\",\n }),\n Object.defineProperty(scryptSync, \"name\", {\n value: \"::bunternal::\",\n }));\nvar webcrypto = crypto;\n__export(crypto_exports, {\n DEFAULT_ENCODING: () => DEFAULT_ENCODING,\n getRandomValues: () => getRandomValues,\n randomUUID: () => randomUUID,\n scrypt: () => scrypt,\n scryptSync: () => scryptSync,\n timingSafeEqual: () => timingSafeEqual,\n webcrypto: () => webcrypto,\n subtle: () => webcrypto.subtle,\n});\n\nexport const {\n randomBytes,\n rng,\n pseudoRandomBytes,\n prng,\n Hash,\n createHash,\n createHmac,\n Hmac,\n getHashes,\n pbkdf2,\n pbkdf2Sync,\n Cipher,\n createCipher,\n Cipheriv,\n createCipheriv,\n Decipher,\n createDecipher,\n Decipheriv,\n createDecipheriv,\n getCiphers,\n listCiphers,\n DiffieHellmanGroup,\n createDiffieHellmanGroup,\n getDiffieHellman,\n createDiffieHellman,\n DiffieHellman,\n createSign,\n Sign,\n createVerify,\n Verify,\n createECDH,\n publicEncrypt,\n privateEncrypt,\n publicDecrypt,\n privateDecrypt,\n randomFill,\n randomFillSync,\n createCredentials,\n constants,\n} = crypto_exports;\nexport { DEFAULT_ENCODING, getRandomValues, randomUUID, scrypt, scryptSync, timingSafeEqual, webcrypto };\nexport default crypto_exports;\n/*! safe-buffer. MIT License. Feross Aboukhadijeh <https://feross.org/opensource> */\n", - "// Hardcoded module \"node:crypto\"\nvar __create = Object.create;\nvar __defProp = Object.defineProperty;\nvar __getOwnPropDesc = Object.getOwnPropertyDescriptor;\nvar __getOwnPropNames = Object.getOwnPropertyNames;\nvar __getProtoOf = Object.getPrototypeOf,\n __hasOwnProp = Object.prototype.hasOwnProperty;\n\nconst MAX_STRING_LENGTH = 536870888;\n\nvar __require = id => import.meta.require(id);\nconst crypto = globalThis.crypto;\nconst globalCrypto = crypto;\n\nvar __esm = (fn, res) =>\n function () {\n return fn && (res = (0, fn[__getOwnPropNames(fn)[0]])((fn = 0))), res;\n };\nvar __commonJS = (cb, mod) =>\n function () {\n return mod || (0, cb[__getOwnPropNames(cb)[0]])((mod = { exports: {} }).exports, mod), mod.exports;\n };\nvar __export = (target, all) => {\n for (var name in all) __defProp(target, name, { get: all[name], enumerable: !0 });\n },\n __copyProps = (to, from, except, desc) => {\n if ((from && typeof from == \"object\") || typeof from == \"function\")\n for (let key of __getOwnPropNames(from))\n !__hasOwnProp.call(to, key) &&\n key !== except &&\n __defProp(to, key, {\n get: () => from[key],\n enumerable: !(desc = __getOwnPropDesc(from, key)) || desc.enumerable,\n });\n return to;\n },\n __reExport = (target, mod, secondTarget) => (\n __copyProps(target, mod, \"default\"), secondTarget && __copyProps(secondTarget, mod, \"default\")\n ),\n __toESM = (mod, isNodeMode, target) => (\n (target = mod != null ? __create(__getProtoOf(mod)) : {}),\n __copyProps(\n isNodeMode || !mod || !mod.__esModule ? __defProp(target, \"default\", { value: mod, enumerable: !0 }) : target,\n mod,\n )\n );\n\n// node_modules/safe-buffer/index.js\nvar require_safe_buffer = __commonJS({\n \"node_modules/safe-buffer/index.js\"(exports, module) {\n var buffer = __require(\"buffer\"),\n Buffer2 = buffer.Buffer;\n function copyProps(src, dst) {\n for (var key in src) dst[key] = src[key];\n }\n Buffer2.from && Buffer2.alloc && Buffer2.allocUnsafe && Buffer2.allocUnsafeSlow\n ? (module.exports = buffer)\n : (copyProps(buffer, exports), (exports.Buffer = SafeBuffer));\n function SafeBuffer(arg, encodingOrOffset, length) {\n return Buffer2(arg, encodingOrOffset, length);\n }\n SafeBuffer.prototype = Object.create(Buffer2.prototype);\n copyProps(Buffer2, SafeBuffer);\n SafeBuffer.from = function (arg, encodingOrOffset, length) {\n if (typeof arg == \"number\") throw new TypeError(\"Argument must not be a number\");\n return Buffer2(arg, encodingOrOffset, length);\n };\n SafeBuffer.alloc = function (size, fill, encoding) {\n if (typeof size != \"number\") throw new TypeError(\"Argument must be a number\");\n var buf = Buffer2(size);\n return (\n fill !== void 0 ? (typeof encoding == \"string\" ? buf.fill(fill, encoding) : buf.fill(fill)) : buf.fill(0), buf\n );\n };\n SafeBuffer.allocUnsafe = function (size) {\n if (typeof size != \"number\") throw new TypeError(\"Argument must be a number\");\n return Buffer2(size);\n };\n SafeBuffer.allocUnsafeSlow = function (size) {\n if (typeof size != \"number\") throw new TypeError(\"Argument must be a number\");\n return buffer.SlowBuffer(size);\n };\n },\n});\n\n// node_modules/randombytes/browser.js\nvar require_browser = __commonJS({\n \"node_modules/randombytes/browser.js\"(exports, module) {\n \"use strict\";\n var MAX_BYTES = 65536,\n MAX_UINT32 = 4294967295;\n function oldBrowser() {\n throw new Error(`Secure random number generation is not supported by this browser.\nUse Chrome, Firefox or Internet Explorer 11`);\n }\n var Buffer2 = require_safe_buffer().Buffer,\n crypto2 = globalCrypto;\n crypto2 && crypto2.getRandomValues ? (module.exports = randomBytes) : (module.exports = oldBrowser);\n function randomBytes(size, cb) {\n if (size > MAX_UINT32) throw new RangeError(\"requested too many random bytes\");\n var bytes = Buffer2.allocUnsafe(size);\n if (size > 0)\n if (size > MAX_BYTES)\n for (var generated = 0; generated < size; generated += MAX_BYTES)\n crypto2.getRandomValues(bytes.slice(generated, generated + MAX_BYTES));\n else crypto2.getRandomValues(bytes);\n return typeof cb == \"function\"\n ? process.nextTick(function () {\n cb(null, bytes);\n })\n : bytes;\n }\n },\n});\n\n// node_modules/inherits/inherits_browser.js\nvar require_inherits_browser = __commonJS({\n \"node_modules/inherits/inherits_browser.js\"(exports, module) {\n typeof Object.create == \"function\"\n ? (module.exports = function (ctor, superCtor) {\n superCtor &&\n ((ctor.super_ = superCtor),\n (ctor.prototype = Object.create(superCtor.prototype, {\n constructor: {\n value: ctor,\n enumerable: !1,\n writable: !0,\n configurable: !0,\n },\n })));\n })\n : (module.exports = function (ctor, superCtor) {\n if (superCtor) {\n ctor.super_ = superCtor;\n var TempCtor = function () {};\n (TempCtor.prototype = superCtor.prototype),\n (ctor.prototype = new TempCtor()),\n (ctor.prototype.constructor = ctor);\n }\n });\n },\n});\n\n// node_modules/hash-base/index.js\nvar require_hash_base = __commonJS({\n \"node_modules/hash-base/index.js\"(exports, module) {\n \"use strict\";\n var Buffer2 = require_safe_buffer().Buffer,\n Transform = __require(\"readable-stream\").Transform,\n inherits = require_inherits_browser();\n function throwIfNotStringOrBuffer(val, prefix) {\n if (!Buffer2.isBuffer(val) && typeof val != \"string\")\n throw new TypeError(prefix + \" must be a string or a buffer\");\n }\n function HashBase(blockSize) {\n Transform.call(this),\n (this._block = Buffer2.allocUnsafe(blockSize)),\n (this._blockSize = blockSize),\n (this._blockOffset = 0),\n (this._length = [0, 0, 0, 0]),\n (this._finalized = !1);\n }\n inherits(HashBase, Transform);\n HashBase.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 callback(error);\n };\n HashBase.prototype._flush = function (callback) {\n var error = null;\n try {\n this.push(this.digest());\n } catch (err) {\n error = err;\n }\n callback(error);\n };\n HashBase.prototype.update = function (data, encoding) {\n if ((throwIfNotStringOrBuffer(data, \"Data\"), this._finalized)) throw new Error(\"Digest already called\");\n Buffer2.isBuffer(data) || (data = Buffer2.from(data, encoding));\n for (var block = this._block, offset = 0; this._blockOffset + data.length - offset >= this._blockSize; ) {\n for (var i = this._blockOffset; i < this._blockSize; ) block[i++] = data[offset++];\n this._update(), (this._blockOffset = 0);\n }\n for (; offset < data.length; ) block[this._blockOffset++] = data[offset++];\n for (var j = 0, carry = data.length * 8; carry > 0; ++j)\n (this._length[j] += carry),\n (carry = (this._length[j] / 4294967296) | 0),\n carry > 0 && (this._length[j] -= 4294967296 * carry);\n return this;\n };\n HashBase.prototype._update = function () {\n throw new Error(\"_update is not implemented\");\n };\n HashBase.prototype.digest = function (encoding) {\n if (this._finalized) throw new Error(\"Digest already called\");\n this._finalized = !0;\n var digest = this._digest();\n encoding !== void 0 && (digest = digest.toString(encoding)), this._block.fill(0), (this._blockOffset = 0);\n for (var i = 0; i < 4; ++i) this._length[i] = 0;\n return digest;\n };\n HashBase.prototype._digest = function () {\n throw new Error(\"_digest is not implemented\");\n };\n module.exports = HashBase;\n },\n});\n\n// node_modules/md5.js/index.js\nvar require_md5 = __commonJS({\n \"node_modules/md5.js/index.js\"(exports, module) {\n \"use strict\";\n var inherits = require_inherits_browser(),\n HashBase = require_hash_base(),\n Buffer2 = require_safe_buffer().Buffer,\n ARRAY16 = new Array(16);\n function MD5() {\n HashBase.call(this, 64),\n (this._a = 1732584193),\n (this._b = 4023233417),\n (this._c = 2562383102),\n (this._d = 271733878);\n }\n inherits(MD5, HashBase);\n MD5.prototype._update = function () {\n for (var M = ARRAY16, i = 0; i < 16; ++i) M[i] = this._block.readInt32LE(i * 4);\n var a = this._a,\n b = this._b,\n c = this._c,\n d = this._d;\n (a = fnF(a, b, c, d, M[0], 3614090360, 7)),\n (d = fnF(d, a, b, c, M[1], 3905402710, 12)),\n (c = fnF(c, d, a, b, M[2], 606105819, 17)),\n (b = fnF(b, c, d, a, M[3], 3250441966, 22)),\n (a = fnF(a, b, c, d, M[4], 4118548399, 7)),\n (d = fnF(d, a, b, c, M[5], 1200080426, 12)),\n (c = fnF(c, d, a, b, M[6], 2821735955, 17)),\n (b = fnF(b, c, d, a, M[7], 4249261313, 22)),\n (a = fnF(a, b, c, d, M[8], 1770035416, 7)),\n (d = fnF(d, a, b, c, M[9], 2336552879, 12)),\n (c = fnF(c, d, a, b, M[10], 4294925233, 17)),\n (b = fnF(b, c, d, a, M[11], 2304563134, 22)),\n (a = fnF(a, b, c, d, M[12], 1804603682, 7)),\n (d = fnF(d, a, b, c, M[13], 4254626195, 12)),\n (c = fnF(c, d, a, b, M[14], 2792965006, 17)),\n (b = fnF(b, c, d, a, M[15], 1236535329, 22)),\n (a = fnG(a, b, c, d, M[1], 4129170786, 5)),\n (d = fnG(d, a, b, c, M[6], 3225465664, 9)),\n (c = fnG(c, d, a, b, M[11], 643717713, 14)),\n (b = fnG(b, c, d, a, M[0], 3921069994, 20)),\n (a = fnG(a, b, c, d, M[5], 3593408605, 5)),\n (d = fnG(d, a, b, c, M[10], 38016083, 9)),\n (c = fnG(c, d, a, b, M[15], 3634488961, 14)),\n (b = fnG(b, c, d, a, M[4], 3889429448, 20)),\n (a = fnG(a, b, c, d, M[9], 568446438, 5)),\n (d = fnG(d, a, b, c, M[14], 3275163606, 9)),\n (c = fnG(c, d, a, b, M[3], 4107603335, 14)),\n (b = fnG(b, c, d, a, M[8], 1163531501, 20)),\n (a = fnG(a, b, c, d, M[13], 2850285829, 5)),\n (d = fnG(d, a, b, c, M[2], 4243563512, 9)),\n (c = fnG(c, d, a, b, M[7], 1735328473, 14)),\n (b = fnG(b, c, d, a, M[12], 2368359562, 20)),\n (a = fnH(a, b, c, d, M[5], 4294588738, 4)),\n (d = fnH(d, a, b, c, M[8], 2272392833, 11)),\n (c = fnH(c, d, a, b, M[11], 1839030562, 16)),\n (b = fnH(b, c, d, a, M[14], 4259657740, 23)),\n (a = fnH(a, b, c, d, M[1], 2763975236, 4)),\n (d = fnH(d, a, b, c, M[4], 1272893353, 11)),\n (c = fnH(c, d, a, b, M[7], 4139469664, 16)),\n (b = fnH(b, c, d, a, M[10], 3200236656, 23)),\n (a = fnH(a, b, c, d, M[13], 681279174, 4)),\n (d = fnH(d, a, b, c, M[0], 3936430074, 11)),\n (c = fnH(c, d, a, b, M[3], 3572445317, 16)),\n (b = fnH(b, c, d, a, M[6], 76029189, 23)),\n (a = fnH(a, b, c, d, M[9], 3654602809, 4)),\n (d = fnH(d, a, b, c, M[12], 3873151461, 11)),\n (c = fnH(c, d, a, b, M[15], 530742520, 16)),\n (b = fnH(b, c, d, a, M[2], 3299628645, 23)),\n (a = fnI(a, b, c, d, M[0], 4096336452, 6)),\n (d = fnI(d, a, b, c, M[7], 1126891415, 10)),\n (c = fnI(c, d, a, b, M[14], 2878612391, 15)),\n (b = fnI(b, c, d, a, M[5], 4237533241, 21)),\n (a = fnI(a, b, c, d, M[12], 1700485571, 6)),\n (d = fnI(d, a, b, c, M[3], 2399980690, 10)),\n (c = fnI(c, d, a, b, M[10], 4293915773, 15)),\n (b = fnI(b, c, d, a, M[1], 2240044497, 21)),\n (a = fnI(a, b, c, d, M[8], 1873313359, 6)),\n (d = fnI(d, a, b, c, M[15], 4264355552, 10)),\n (c = fnI(c, d, a, b, M[6], 2734768916, 15)),\n (b = fnI(b, c, d, a, M[13], 1309151649, 21)),\n (a = fnI(a, b, c, d, M[4], 4149444226, 6)),\n (d = fnI(d, a, b, c, M[11], 3174756917, 10)),\n (c = fnI(c, d, a, b, M[2], 718787259, 15)),\n (b = fnI(b, c, d, a, M[9], 3951481745, 21)),\n (this._a = (this._a + a) | 0),\n (this._b = (this._b + b) | 0),\n (this._c = (this._c + c) | 0),\n (this._d = (this._d + d) | 0);\n };\n MD5.prototype._digest = function () {\n (this._block[this._blockOffset++] = 128),\n this._blockOffset > 56 && (this._block.fill(0, this._blockOffset, 64), this._update(), (this._blockOffset = 0)),\n this._block.fill(0, this._blockOffset, 56),\n this._block.writeUInt32LE(this._length[0], 56),\n this._block.writeUInt32LE(this._length[1], 60),\n this._update();\n var buffer = Buffer2.allocUnsafe(16);\n return (\n buffer.writeInt32LE(this._a, 0),\n buffer.writeInt32LE(this._b, 4),\n buffer.writeInt32LE(this._c, 8),\n buffer.writeInt32LE(this._d, 12),\n buffer\n );\n };\n function rotl(x, n) {\n return (x << n) | (x >>> (32 - n));\n }\n function fnF(a, b, c, d, m, k, s) {\n return (rotl((a + ((b & c) | (~b & d)) + m + k) | 0, s) + b) | 0;\n }\n function fnG(a, b, c, d, m, k, s) {\n return (rotl((a + ((b & d) | (c & ~d)) + m + k) | 0, s) + b) | 0;\n }\n function fnH(a, b, c, d, m, k, s) {\n return (rotl((a + (b ^ c ^ d) + m + k) | 0, s) + b) | 0;\n }\n function fnI(a, b, c, d, m, k, s) {\n return (rotl((a + (c ^ (b | ~d)) + m + k) | 0, s) + b) | 0;\n }\n module.exports = MD5;\n },\n});\n\n// node_modules/ripemd160/index.js\nvar require_ripemd160 = __commonJS({\n \"node_modules/ripemd160/index.js\"(exports, module) {\n \"use strict\";\n var Buffer2 = __require(\"buffer\").Buffer,\n inherits = require_inherits_browser(),\n HashBase = require_hash_base(),\n ARRAY16 = new Array(16),\n zl = [\n 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 7, 4, 13, 1, 10, 6, 15, 3, 12, 0, 9, 5, 2, 14, 11, 8, 3,\n 10, 14, 4, 9, 15, 8, 1, 2, 7, 0, 6, 13, 11, 5, 12, 1, 9, 11, 10, 0, 8, 12, 4, 13, 3, 7, 15, 14, 5, 6, 2, 4, 0,\n 5, 9, 7, 12, 2, 10, 14, 1, 3, 8, 11, 6, 15, 13,\n ],\n zr = [\n 5, 14, 7, 0, 9, 2, 11, 4, 13, 6, 15, 8, 1, 10, 3, 12, 6, 11, 3, 7, 0, 13, 5, 10, 14, 15, 8, 12, 4, 9, 1, 2, 15,\n 5, 1, 3, 7, 14, 6, 9, 11, 8, 12, 2, 10, 0, 4, 13, 8, 6, 4, 1, 3, 11, 15, 0, 5, 12, 2, 13, 9, 7, 10, 14, 12, 15,\n 10, 4, 1, 5, 8, 7, 6, 2, 13, 14, 0, 3, 9, 11,\n ],\n sl = [\n 11, 14, 15, 12, 5, 8, 7, 9, 11, 13, 14, 15, 6, 7, 9, 8, 7, 6, 8, 13, 11, 9, 7, 15, 7, 12, 15, 9, 11, 7, 13, 12,\n 11, 13, 6, 7, 14, 9, 13, 15, 14, 8, 13, 6, 5, 12, 7, 5, 11, 12, 14, 15, 14, 15, 9, 8, 9, 14, 5, 6, 8, 6, 5, 12,\n 9, 15, 5, 11, 6, 8, 13, 12, 5, 12, 13, 14, 11, 8, 5, 6,\n ],\n sr = [\n 8, 9, 9, 11, 13, 15, 15, 5, 7, 7, 8, 11, 14, 14, 12, 6, 9, 13, 15, 7, 12, 8, 9, 11, 7, 7, 12, 7, 6, 15, 13, 11,\n 9, 7, 15, 11, 8, 6, 6, 14, 12, 13, 5, 14, 13, 13, 7, 5, 15, 5, 8, 11, 14, 14, 6, 14, 6, 9, 12, 9, 12, 5, 15, 8,\n 8, 5, 12, 9, 12, 5, 14, 6, 8, 13, 6, 5, 15, 13, 11, 11,\n ],\n hl = [0, 1518500249, 1859775393, 2400959708, 2840853838],\n hr = [1352829926, 1548603684, 1836072691, 2053994217, 0];\n function RIPEMD160() {\n HashBase.call(this, 64),\n (this._a = 1732584193),\n (this._b = 4023233417),\n (this._c = 2562383102),\n (this._d = 271733878),\n (this._e = 3285377520);\n }\n inherits(RIPEMD160, HashBase);\n RIPEMD160.prototype._update = function () {\n for (var words = ARRAY16, j = 0; j < 16; ++j) words[j] = this._block.readInt32LE(j * 4);\n for (\n var al = this._a | 0,\n bl = this._b | 0,\n cl = this._c | 0,\n dl = this._d | 0,\n el = this._e | 0,\n ar = this._a | 0,\n br = this._b | 0,\n cr = this._c | 0,\n dr = this._d | 0,\n er = this._e | 0,\n i = 0;\n i < 80;\n i += 1\n ) {\n var tl, tr;\n i < 16\n ? ((tl = fn1(al, bl, cl, dl, el, words[zl[i]], hl[0], sl[i])),\n (tr = fn5(ar, br, cr, dr, er, words[zr[i]], hr[0], sr[i])))\n : i < 32\n ? ((tl = fn2(al, bl, cl, dl, el, words[zl[i]], hl[1], sl[i])),\n (tr = fn4(ar, br, cr, dr, er, words[zr[i]], hr[1], sr[i])))\n : i < 48\n ? ((tl = fn3(al, bl, cl, dl, el, words[zl[i]], hl[2], sl[i])),\n (tr = fn3(ar, br, cr, dr, er, words[zr[i]], hr[2], sr[i])))\n : i < 64\n ? ((tl = fn4(al, bl, cl, dl, el, words[zl[i]], hl[3], sl[i])),\n (tr = fn2(ar, br, cr, dr, er, words[zr[i]], hr[3], sr[i])))\n : ((tl = fn5(al, bl, cl, dl, el, words[zl[i]], hl[4], sl[i])),\n (tr = fn1(ar, br, cr, dr, er, words[zr[i]], hr[4], sr[i]))),\n (al = el),\n (el = dl),\n (dl = rotl(cl, 10)),\n (cl = bl),\n (bl = tl),\n (ar = er),\n (er = dr),\n (dr = rotl(cr, 10)),\n (cr = br),\n (br = tr);\n }\n var t = (this._b + cl + dr) | 0;\n (this._b = (this._c + dl + er) | 0),\n (this._c = (this._d + el + ar) | 0),\n (this._d = (this._e + al + br) | 0),\n (this._e = (this._a + bl + cr) | 0),\n (this._a = t);\n };\n RIPEMD160.prototype._digest = function () {\n (this._block[this._blockOffset++] = 128),\n this._blockOffset > 56 && (this._block.fill(0, this._blockOffset, 64), this._update(), (this._blockOffset = 0)),\n this._block.fill(0, this._blockOffset, 56),\n this._block.writeUInt32LE(this._length[0], 56),\n this._block.writeUInt32LE(this._length[1], 60),\n this._update();\n var buffer = Buffer2.alloc ? Buffer2.alloc(20) : new Buffer2(20);\n return (\n buffer.writeInt32LE(this._a, 0),\n buffer.writeInt32LE(this._b, 4),\n buffer.writeInt32LE(this._c, 8),\n buffer.writeInt32LE(this._d, 12),\n buffer.writeInt32LE(this._e, 16),\n buffer\n );\n };\n function rotl(x, n) {\n return (x << n) | (x >>> (32 - n));\n }\n function fn1(a, b, c, d, e, m, k, s) {\n return (rotl((a + (b ^ c ^ d) + m + k) | 0, s) + e) | 0;\n }\n function fn2(a, b, c, d, e, m, k, s) {\n return (rotl((a + ((b & c) | (~b & d)) + m + k) | 0, s) + e) | 0;\n }\n function fn3(a, b, c, d, e, m, k, s) {\n return (rotl((a + ((b | ~c) ^ d) + m + k) | 0, s) + e) | 0;\n }\n function fn4(a, b, c, d, e, m, k, s) {\n return (rotl((a + ((b & d) | (c & ~d)) + m + k) | 0, s) + e) | 0;\n }\n function fn5(a, b, c, d, e, m, k, s) {\n return (rotl((a + (b ^ (c | ~d)) + m + k) | 0, s) + e) | 0;\n }\n module.exports = RIPEMD160;\n },\n});\n\n// node_modules/sha.js/hash.js\nvar require_hash = __commonJS({\n \"node_modules/sha.js/hash.js\"(exports, module) {\n var Buffer2 = require_safe_buffer().Buffer;\n function Hash(blockSize, finalSize) {\n (this._block = Buffer2.alloc(blockSize)),\n (this._finalSize = finalSize),\n (this._blockSize = blockSize),\n (this._len = 0);\n }\n Hash.prototype.update = function (data, enc) {\n typeof data == \"string\" && ((enc = enc || \"utf8\"), (data = Buffer2.from(data, enc)));\n for (\n var block = this._block, blockSize = this._blockSize, length = data.length, accum = this._len, offset = 0;\n offset < length;\n\n ) {\n for (\n var assigned = accum % blockSize, remainder = Math.min(length - offset, blockSize - assigned), i = 0;\n i < remainder;\n i++\n )\n block[assigned + i] = data[offset + i];\n (accum += remainder), (offset += remainder), accum % blockSize === 0 && this._update(block);\n }\n return (this._len += length), this;\n };\n Hash.prototype.digest = function (enc) {\n var rem = this._len % this._blockSize;\n (this._block[rem] = 128),\n this._block.fill(0, rem + 1),\n rem >= this._finalSize && (this._update(this._block), this._block.fill(0));\n var bits = this._len * 8;\n if (bits <= 4294967295) this._block.writeUInt32BE(bits, this._blockSize - 4);\n else {\n var lowBits = (bits & 4294967295) >>> 0,\n highBits = (bits - lowBits) / 4294967296;\n this._block.writeUInt32BE(highBits, this._blockSize - 8),\n this._block.writeUInt32BE(lowBits, this._blockSize - 4);\n }\n this._update(this._block);\n var hash = this._hash();\n return enc ? hash.toString(enc) : hash;\n };\n Hash.prototype._update = function () {\n throw new Error(\"_update must be implemented by subclass\");\n };\n module.exports = Hash;\n },\n});\n\n// node_modules/sha.js/sha.js\nvar require_sha = __commonJS({\n \"node_modules/sha.js/sha.js\"(exports, module) {\n var inherits = require_inherits_browser(),\n Hash = require_hash(),\n Buffer2 = require_safe_buffer().Buffer,\n K = [1518500249, 1859775393, -1894007588, -899497514],\n W = new Array(80);\n function Sha() {\n this.init(), (this._w = W), Hash.call(this, 64, 56);\n }\n inherits(Sha, Hash);\n Sha.prototype.init = function () {\n return (\n (this._a = 1732584193),\n (this._b = 4023233417),\n (this._c = 2562383102),\n (this._d = 271733878),\n (this._e = 3285377520),\n this\n );\n };\n function rotl5(num) {\n return (num << 5) | (num >>> 27);\n }\n function rotl30(num) {\n return (num << 30) | (num >>> 2);\n }\n function ft(s, b, c, d) {\n return s === 0 ? (b & c) | (~b & d) : s === 2 ? (b & c) | (b & d) | (c & d) : b ^ c ^ d;\n }\n Sha.prototype._update = function (M) {\n for (\n var W2 = this._w, a = this._a | 0, b = this._b | 0, c = this._c | 0, d = this._d | 0, e = this._e | 0, i = 0;\n i < 16;\n ++i\n )\n W2[i] = M.readInt32BE(i * 4);\n for (; i < 80; ++i) W2[i] = W2[i - 3] ^ W2[i - 8] ^ W2[i - 14] ^ W2[i - 16];\n for (var j = 0; j < 80; ++j) {\n var s = ~~(j / 20),\n t = (rotl5(a) + ft(s, b, c, d) + e + W2[j] + K[s]) | 0;\n (e = d), (d = c), (c = rotl30(b)), (b = a), (a = t);\n }\n (this._a = (a + this._a) | 0),\n (this._b = (b + this._b) | 0),\n (this._c = (c + this._c) | 0),\n (this._d = (d + this._d) | 0),\n (this._e = (e + this._e) | 0);\n };\n Sha.prototype._hash = function () {\n var H = Buffer2.allocUnsafe(20);\n return (\n H.writeInt32BE(this._a | 0, 0),\n H.writeInt32BE(this._b | 0, 4),\n H.writeInt32BE(this._c | 0, 8),\n H.writeInt32BE(this._d | 0, 12),\n H.writeInt32BE(this._e | 0, 16),\n H\n );\n };\n module.exports = Sha;\n },\n});\n\n// node_modules/sha.js/sha1.js\nvar require_sha1 = __commonJS({\n \"node_modules/sha.js/sha1.js\"(exports, module) {\n var inherits = require_inherits_browser(),\n Hash = require_hash(),\n Buffer2 = require_safe_buffer().Buffer,\n K = [1518500249, 1859775393, -1894007588, -899497514],\n W = new Array(80);\n function Sha1() {\n this.init(), (this._w = W), Hash.call(this, 64, 56);\n }\n inherits(Sha1, Hash);\n Sha1.prototype.init = function () {\n return (\n (this._a = 1732584193),\n (this._b = 4023233417),\n (this._c = 2562383102),\n (this._d = 271733878),\n (this._e = 3285377520),\n this\n );\n };\n function rotl1(num) {\n return (num << 1) | (num >>> 31);\n }\n function rotl5(num) {\n return (num << 5) | (num >>> 27);\n }\n function rotl30(num) {\n return (num << 30) | (num >>> 2);\n }\n function ft(s, b, c, d) {\n return s === 0 ? (b & c) | (~b & d) : s === 2 ? (b & c) | (b & d) | (c & d) : b ^ c ^ d;\n }\n Sha1.prototype._update = function (M) {\n for (\n var W2 = this._w, a = this._a | 0, b = this._b | 0, c = this._c | 0, d = this._d | 0, e = this._e | 0, i = 0;\n i < 16;\n ++i\n )\n W2[i] = M.readInt32BE(i * 4);\n for (; i < 80; ++i) W2[i] = rotl1(W2[i - 3] ^ W2[i - 8] ^ W2[i - 14] ^ W2[i - 16]);\n for (var j = 0; j < 80; ++j) {\n var s = ~~(j / 20),\n t = (rotl5(a) + ft(s, b, c, d) + e + W2[j] + K[s]) | 0;\n (e = d), (d = c), (c = rotl30(b)), (b = a), (a = t);\n }\n (this._a = (a + this._a) | 0),\n (this._b = (b + this._b) | 0),\n (this._c = (c + this._c) | 0),\n (this._d = (d + this._d) | 0),\n (this._e = (e + this._e) | 0);\n };\n Sha1.prototype._hash = function () {\n var H = Buffer2.allocUnsafe(20);\n return (\n H.writeInt32BE(this._a | 0, 0),\n H.writeInt32BE(this._b | 0, 4),\n H.writeInt32BE(this._c | 0, 8),\n H.writeInt32BE(this._d | 0, 12),\n H.writeInt32BE(this._e | 0, 16),\n H\n );\n };\n module.exports = Sha1;\n },\n});\n\n// node_modules/sha.js/sha256.js\nvar require_sha256 = __commonJS({\n \"node_modules/sha.js/sha256.js\"(exports, module) {\n var inherits = require_inherits_browser(),\n Hash = require_hash(),\n Buffer2 = require_safe_buffer().Buffer,\n K = [\n 1116352408, 1899447441, 3049323471, 3921009573, 961987163, 1508970993, 2453635748, 2870763221, 3624381080,\n 310598401, 607225278, 1426881987, 1925078388, 2162078206, 2614888103, 3248222580, 3835390401, 4022224774,\n 264347078, 604807628, 770255983, 1249150122, 1555081692, 1996064986, 2554220882, 2821834349, 2952996808,\n 3210313671, 3336571891, 3584528711, 113926993, 338241895, 666307205, 773529912, 1294757372, 1396182291,\n 1695183700, 1986661051, 2177026350, 2456956037, 2730485921, 2820302411, 3259730800, 3345764771, 3516065817,\n 3600352804, 4094571909, 275423344, 430227734, 506948616, 659060556, 883997877, 958139571, 1322822218,\n 1537002063, 1747873779, 1955562222, 2024104815, 2227730452, 2361852424, 2428436474, 2756734187, 3204031479,\n 3329325298,\n ],\n W = new Array(64);\n function Sha256() {\n this.init(), (this._w = W), Hash.call(this, 64, 56);\n }\n inherits(Sha256, Hash);\n Sha256.prototype.init = function () {\n return (\n (this._a = 1779033703),\n (this._b = 3144134277),\n (this._c = 1013904242),\n (this._d = 2773480762),\n (this._e = 1359893119),\n (this._f = 2600822924),\n (this._g = 528734635),\n (this._h = 1541459225),\n this\n );\n };\n function ch(x, y, z) {\n return z ^ (x & (y ^ z));\n }\n function maj(x, y, z) {\n return (x & y) | (z & (x | y));\n }\n function sigma0(x) {\n return ((x >>> 2) | (x << 30)) ^ ((x >>> 13) | (x << 19)) ^ ((x >>> 22) | (x << 10));\n }\n function sigma1(x) {\n return ((x >>> 6) | (x << 26)) ^ ((x >>> 11) | (x << 21)) ^ ((x >>> 25) | (x << 7));\n }\n function gamma0(x) {\n return ((x >>> 7) | (x << 25)) ^ ((x >>> 18) | (x << 14)) ^ (x >>> 3);\n }\n function gamma1(x) {\n return ((x >>> 17) | (x << 15)) ^ ((x >>> 19) | (x << 13)) ^ (x >>> 10);\n }\n Sha256.prototype._update = function (M) {\n for (\n var W2 = this._w,\n a = this._a | 0,\n b = this._b | 0,\n c = this._c | 0,\n d = this._d | 0,\n e = this._e | 0,\n f = this._f | 0,\n g = this._g | 0,\n h = this._h | 0,\n i = 0;\n i < 16;\n ++i\n )\n W2[i] = M.readInt32BE(i * 4);\n for (; i < 64; ++i) W2[i] = (gamma1(W2[i - 2]) + W2[i - 7] + gamma0(W2[i - 15]) + W2[i - 16]) | 0;\n for (var j = 0; j < 64; ++j) {\n var T1 = (h + sigma1(e) + ch(e, f, g) + K[j] + W2[j]) | 0,\n T2 = (sigma0(a) + maj(a, b, c)) | 0;\n (h = g), (g = f), (f = e), (e = (d + T1) | 0), (d = c), (c = b), (b = a), (a = (T1 + T2) | 0);\n }\n (this._a = (a + this._a) | 0),\n (this._b = (b + this._b) | 0),\n (this._c = (c + this._c) | 0),\n (this._d = (d + this._d) | 0),\n (this._e = (e + this._e) | 0),\n (this._f = (f + this._f) | 0),\n (this._g = (g + this._g) | 0),\n (this._h = (h + this._h) | 0);\n };\n Sha256.prototype._hash = function () {\n var H = Buffer2.allocUnsafe(32);\n return (\n H.writeInt32BE(this._a, 0),\n H.writeInt32BE(this._b, 4),\n H.writeInt32BE(this._c, 8),\n H.writeInt32BE(this._d, 12),\n H.writeInt32BE(this._e, 16),\n H.writeInt32BE(this._f, 20),\n H.writeInt32BE(this._g, 24),\n H.writeInt32BE(this._h, 28),\n H\n );\n };\n module.exports = Sha256;\n },\n});\n\n// node_modules/sha.js/sha224.js\nvar require_sha224 = __commonJS({\n \"node_modules/sha.js/sha224.js\"(exports, module) {\n var inherits = require_inherits_browser(),\n Sha256 = require_sha256(),\n Hash = require_hash(),\n Buffer2 = require_safe_buffer().Buffer,\n W = new Array(64);\n function Sha224() {\n this.init(), (this._w = W), Hash.call(this, 64, 56);\n }\n inherits(Sha224, Sha256);\n Sha224.prototype.init = function () {\n return (\n (this._a = 3238371032),\n (this._b = 914150663),\n (this._c = 812702999),\n (this._d = 4144912697),\n (this._e = 4290775857),\n (this._f = 1750603025),\n (this._g = 1694076839),\n (this._h = 3204075428),\n this\n );\n };\n Sha224.prototype._hash = function () {\n var H = Buffer2.allocUnsafe(28);\n return (\n H.writeInt32BE(this._a, 0),\n H.writeInt32BE(this._b, 4),\n H.writeInt32BE(this._c, 8),\n H.writeInt32BE(this._d, 12),\n H.writeInt32BE(this._e, 16),\n H.writeInt32BE(this._f, 20),\n H.writeInt32BE(this._g, 24),\n H\n );\n };\n module.exports = Sha224;\n },\n});\n\n// node_modules/sha.js/sha512.js\nvar require_sha512 = __commonJS({\n \"node_modules/sha.js/sha512.js\"(exports, module) {\n var inherits = require_inherits_browser(),\n Hash = require_hash(),\n Buffer2 = require_safe_buffer().Buffer,\n K = [\n 1116352408, 3609767458, 1899447441, 602891725, 3049323471, 3964484399, 3921009573, 2173295548, 961987163,\n 4081628472, 1508970993, 3053834265, 2453635748, 2937671579, 2870763221, 3664609560, 3624381080, 2734883394,\n 310598401, 1164996542, 607225278, 1323610764, 1426881987, 3590304994, 1925078388, 4068182383, 2162078206,\n 991336113, 2614888103, 633803317, 3248222580, 3479774868, 3835390401, 2666613458, 4022224774, 944711139,\n 264347078, 2341262773, 604807628, 2007800933, 770255983, 1495990901, 1249150122, 1856431235, 1555081692,\n 3175218132, 1996064986, 2198950837, 2554220882, 3999719339, 2821834349, 766784016, 2952996808, 2566594879,\n 3210313671, 3203337956, 3336571891, 1034457026, 3584528711, 2466948901, 113926993, 3758326383, 338241895,\n 168717936, 666307205, 1188179964, 773529912, 1546045734, 1294757372, 1522805485, 1396182291, 2643833823,\n 1695183700, 2343527390, 1986661051, 1014477480, 2177026350, 1206759142, 2456956037, 344077627, 2730485921,\n 1290863460, 2820302411, 3158454273, 3259730800, 3505952657, 3345764771, 106217008, 3516065817, 3606008344,\n 3600352804, 1432725776, 4094571909, 1467031594, 275423344, 851169720, 430227734, 3100823752, 506948616,\n 1363258195, 659060556, 3750685593, 883997877, 3785050280, 958139571, 3318307427, 1322822218, 3812723403,\n 1537002063, 2003034995, 1747873779, 3602036899, 1955562222, 1575990012, 2024104815, 1125592928, 2227730452,\n 2716904306, 2361852424, 442776044, 2428436474, 593698344, 2756734187, 3733110249, 3204031479, 2999351573,\n 3329325298, 3815920427, 3391569614, 3928383900, 3515267271, 566280711, 3940187606, 3454069534, 4118630271,\n 4000239992, 116418474, 1914138554, 174292421, 2731055270, 289380356, 3203993006, 460393269, 320620315,\n 685471733, 587496836, 852142971, 1086792851, 1017036298, 365543100, 1126000580, 2618297676, 1288033470,\n 3409855158, 1501505948, 4234509866, 1607167915, 987167468, 1816402316, 1246189591,\n ],\n W = new Array(160);\n function Sha512() {\n this.init(), (this._w = W), Hash.call(this, 128, 112);\n }\n inherits(Sha512, Hash);\n Sha512.prototype.init = function () {\n return (\n (this._ah = 1779033703),\n (this._bh = 3144134277),\n (this._ch = 1013904242),\n (this._dh = 2773480762),\n (this._eh = 1359893119),\n (this._fh = 2600822924),\n (this._gh = 528734635),\n (this._hh = 1541459225),\n (this._al = 4089235720),\n (this._bl = 2227873595),\n (this._cl = 4271175723),\n (this._dl = 1595750129),\n (this._el = 2917565137),\n (this._fl = 725511199),\n (this._gl = 4215389547),\n (this._hl = 327033209),\n this\n );\n };\n function Ch(x, y, z) {\n return z ^ (x & (y ^ z));\n }\n function maj(x, y, z) {\n return (x & y) | (z & (x | y));\n }\n function sigma0(x, xl) {\n return ((x >>> 28) | (xl << 4)) ^ ((xl >>> 2) | (x << 30)) ^ ((xl >>> 7) | (x << 25));\n }\n function sigma1(x, xl) {\n return ((x >>> 14) | (xl << 18)) ^ ((x >>> 18) | (xl << 14)) ^ ((xl >>> 9) | (x << 23));\n }\n function Gamma0(x, xl) {\n return ((x >>> 1) | (xl << 31)) ^ ((x >>> 8) | (xl << 24)) ^ (x >>> 7);\n }\n function Gamma0l(x, xl) {\n return ((x >>> 1) | (xl << 31)) ^ ((x >>> 8) | (xl << 24)) ^ ((x >>> 7) | (xl << 25));\n }\n function Gamma1(x, xl) {\n return ((x >>> 19) | (xl << 13)) ^ ((xl >>> 29) | (x << 3)) ^ (x >>> 6);\n }\n function Gamma1l(x, xl) {\n return ((x >>> 19) | (xl << 13)) ^ ((xl >>> 29) | (x << 3)) ^ ((x >>> 6) | (xl << 26));\n }\n function getCarry(a, b) {\n return a >>> 0 < b >>> 0 ? 1 : 0;\n }\n Sha512.prototype._update = function (M) {\n for (\n var W2 = this._w,\n ah = this._ah | 0,\n bh = this._bh | 0,\n ch = this._ch | 0,\n dh = this._dh | 0,\n eh = this._eh | 0,\n fh = this._fh | 0,\n gh = this._gh | 0,\n hh = this._hh | 0,\n al = this._al | 0,\n bl = this._bl | 0,\n cl = this._cl | 0,\n dl = this._dl | 0,\n el = this._el | 0,\n fl = this._fl | 0,\n gl = this._gl | 0,\n hl = this._hl | 0,\n i = 0;\n i < 32;\n i += 2\n )\n (W2[i] = M.readInt32BE(i * 4)), (W2[i + 1] = M.readInt32BE(i * 4 + 4));\n for (; i < 160; i += 2) {\n var xh = W2[i - 30],\n xl = W2[i - 15 * 2 + 1],\n gamma0 = Gamma0(xh, xl),\n gamma0l = Gamma0l(xl, xh);\n (xh = W2[i - 2 * 2]), (xl = W2[i - 2 * 2 + 1]);\n var gamma1 = Gamma1(xh, xl),\n gamma1l = Gamma1l(xl, xh),\n Wi7h = W2[i - 7 * 2],\n Wi7l = W2[i - 7 * 2 + 1],\n Wi16h = W2[i - 16 * 2],\n Wi16l = W2[i - 16 * 2 + 1],\n Wil = (gamma0l + Wi7l) | 0,\n 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 (W2[i] = Wih),\n (W2[i + 1] = Wil);\n }\n for (var j = 0; j < 160; j += 2) {\n (Wih = W2[j]), (Wil = W2[j + 1]);\n var majh = maj(ah, bh, ch),\n majl = maj(al, bl, cl),\n sigma0h = sigma0(ah, al),\n sigma0l = sigma0(al, ah),\n sigma1h = sigma1(eh, el),\n sigma1l = sigma1(el, eh),\n Kih = K[j],\n Kil = K[j + 1],\n chh = Ch(eh, fh, gh),\n chl = Ch(el, fl, gl),\n t1l = (hl + sigma1l) | 0,\n 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 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 (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 Sha512.prototype._hash = function () {\n var H = Buffer2.allocUnsafe(64);\n function writeInt64BE(h, l, offset) {\n H.writeInt32BE(h, offset), H.writeInt32BE(l, offset + 4);\n }\n return (\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 H\n );\n };\n module.exports = Sha512;\n },\n});\n\n// node_modules/sha.js/sha384.js\nvar require_sha384 = __commonJS({\n \"node_modules/sha.js/sha384.js\"(exports, module) {\n var inherits = require_inherits_browser(),\n SHA512 = require_sha512(),\n Hash = require_hash(),\n Buffer2 = require_safe_buffer().Buffer,\n W = new Array(160);\n function Sha384() {\n this.init(), (this._w = W), Hash.call(this, 128, 112);\n }\n inherits(Sha384, SHA512);\n Sha384.prototype.init = function () {\n return (\n (this._ah = 3418070365),\n (this._bh = 1654270250),\n (this._ch = 2438529370),\n (this._dh = 355462360),\n (this._eh = 1731405415),\n (this._fh = 2394180231),\n (this._gh = 3675008525),\n (this._hh = 1203062813),\n (this._al = 3238371032),\n (this._bl = 914150663),\n (this._cl = 812702999),\n (this._dl = 4144912697),\n (this._el = 4290775857),\n (this._fl = 1750603025),\n (this._gl = 1694076839),\n (this._hl = 3204075428),\n this\n );\n };\n Sha384.prototype._hash = function () {\n var H = Buffer2.allocUnsafe(48);\n function writeInt64BE(h, l, offset) {\n H.writeInt32BE(h, offset), H.writeInt32BE(l, offset + 4);\n }\n return (\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 H\n );\n };\n module.exports = Sha384;\n },\n});\n\n// node_modules/sha.js/index.js\nvar require_sha2 = __commonJS({\n \"node_modules/sha.js/index.js\"(exports, module) {\n var exports = (module.exports = function (algorithm) {\n algorithm = algorithm.toLowerCase();\n var Algorithm = exports[algorithm];\n if (!Algorithm) throw new Error(algorithm + \" is not supported (we accept pull requests)\");\n return new Algorithm();\n });\n exports.sha = require_sha();\n exports.sha1 = require_sha1();\n exports.sha224 = require_sha224();\n exports.sha256 = require_sha256();\n exports.sha384 = require_sha384();\n exports.sha512 = require_sha512();\n },\n});\n\n// stream.js\nvar stream_exports = import.meta.require(\"node:stream\");\n\n// node_modules/cipher-base/index.js\nvar require_cipher_base = __commonJS({\n \"node_modules/cipher-base/index.js\"(exports, module) {\n var Buffer2 = require_safe_buffer().Buffer,\n Transform = stream_exports.Transform,\n StringDecoder = __require(\"string_decoder\").StringDecoder,\n inherits = require_inherits_browser();\n function CipherBase(hashMode) {\n Transform.call(this),\n (this.hashMode = typeof hashMode == \"string\"),\n this.hashMode ? (this[hashMode] = this._finalOrDigest) : (this.final = this._finalOrDigest),\n this._final && ((this.__final = this._final), (this._final = null)),\n (this._decoder = null),\n (this._encoding = null);\n }\n inherits(CipherBase, Transform);\n CipherBase.prototype.update = function (data, inputEnc, outputEnc) {\n typeof data == \"string\" && (data = Buffer2.from(data, inputEnc));\n var outData = this._update(data);\n return this.hashMode ? this : (outputEnc && (outData = this._toString(outData, outputEnc)), outData);\n };\n CipherBase.prototype.setAutoPadding = function () {};\n CipherBase.prototype.getAuthTag = function () {\n throw new Error(\"trying to get auth tag in unsupported state\");\n };\n CipherBase.prototype.setAuthTag = function () {\n throw new Error(\"trying to set auth tag in unsupported state\");\n };\n CipherBase.prototype.setAAD = function () {\n throw new Error(\"trying to set aad in unsupported state\");\n };\n CipherBase.prototype._transform = function (data, _, next) {\n var err;\n try {\n this.hashMode ? this._update(data) : this.push(this._update(data));\n } catch (e) {\n err = e;\n } finally {\n next(err);\n }\n };\n CipherBase.prototype._flush = function (done) {\n var err;\n try {\n this.push(this.__final());\n } catch (e) {\n err = e;\n }\n done(err);\n };\n CipherBase.prototype._finalOrDigest = function (outputEnc) {\n var outData = this.__final() || Buffer2.alloc(0);\n return outputEnc && (outData = this._toString(outData, outputEnc, !0)), outData;\n };\n CipherBase.prototype._toString = function (value, enc, fin) {\n if ((this._decoder || ((this._decoder = new StringDecoder(enc)), (this._encoding = enc)), this._encoding !== enc))\n throw new Error(\"can't switch encodings\");\n var out = this._decoder.write(value);\n return fin && (out += this._decoder.end()), out;\n };\n module.exports = CipherBase;\n },\n});\n\n// node_modules/create-hash/browser.js\nvar require_browser2 = __commonJS({\n \"node_modules/create-hash/browser.js\"(exports, module) {\n (\"use strict\");\n const { Transform } = stream_exports;\n\n // does not become a node stream unless you create it into one\n const LazyHash = function Hash(algorithm, options) {\n this._options = options;\n this._hasher = new CryptoHasher(algorithm, options);\n this._finalized = false;\n };\n LazyHash.prototype = Object.create(Transform.prototype);\n LazyHash.prototype.update = function update(data, encoding) {\n this._checkFinalized();\n this._hasher.update(data, encoding);\n return this;\n };\n LazyHash.prototype.digest = function update(data, encoding) {\n this._checkFinalized();\n this._finalized = true;\n return this._hasher.digest(data, encoding);\n };\n LazyHash.prototype._checkFinalized = function _checkFinalized() {\n if (this._finalized) {\n var err = new Error(\"Digest already called\");\n err.code = \"ERR_CRYPTO_HASH_FINALIZED\";\n throw err;\n }\n };\n LazyHash.prototype.copy = function copy() {\n const copy = Object.create(LazyHash.prototype);\n copy._options = this._options;\n copy._hasher = this._hasher.copy();\n copy._finalized = this._finalized;\n return copy;\n };\n\n const lazyHashFullInitProto = {\n __proto__: Transform.prototype,\n ...LazyHash.prototype,\n _transform(data, encoding, callback) {\n this.update(data, encoding);\n callback && callback();\n },\n _flush(callback) {\n this.push(this.digest());\n callback();\n },\n };\n\n const triggerMethods = [\n \"_events\",\n \"_eventsCount\",\n \"_final\",\n \"_maxListeners\",\n \"_maxListeners\",\n \"_read\",\n \"_undestroy\",\n \"_writableState\",\n \"_write\",\n \"_writev\",\n \"addListener\",\n \"asIndexedPairs\",\n \"closed\",\n \"compose\",\n \"constructor\",\n \"cork\",\n \"destroy\",\n \"destroyed\",\n \"drop\",\n \"emit\",\n \"end\",\n \"errored\",\n \"eventNames\",\n \"every\",\n \"filter\",\n \"find\",\n \"flatMap\",\n \"forEach\",\n \"getMaxListeners\",\n \"hasOwnProperty\",\n \"isPaused\",\n \"isPrototypeOf\",\n \"iterator\",\n \"listenerCount\",\n \"listeners\",\n \"map\",\n \"off\",\n \"on\",\n \"once\",\n \"pause\",\n \"pipe\",\n \"prependListener\",\n \"prependOnceListener\",\n \"propertyIsEnumerable\",\n \"push\",\n \"rawListeners\",\n \"read\",\n \"readable\",\n \"readableAborted\",\n \"readableBuffer\",\n \"readableDidRead\",\n \"readableEncoding\",\n \"readableEnded\",\n \"readableFlowing\",\n \"readableHighWaterMark\",\n \"readableLength\",\n \"readableObjectMode\",\n \"reduce\",\n \"removeAllListeners\",\n \"removeListener\",\n \"resume\",\n \"setDefaultEncoding\",\n \"setEncoding\",\n \"setMaxListeners\",\n \"some\",\n \"take\",\n \"toArray\",\n \"toLocaleString\",\n \"toString\",\n \"uncork\",\n \"unpipe\",\n \"unshift\",\n \"valueOf\",\n \"wrap\",\n \"writable\",\n \"writableBuffer\",\n \"writableCorked\",\n \"writableEnded\",\n \"writableFinished\",\n \"writableHighWaterMark\",\n \"writableLength\",\n \"writableNeedDrain\",\n \"writableObjectMode\",\n \"write\",\n ];\n for (const method of triggerMethods) {\n Object.defineProperty(LazyHash.prototype, method, {\n get() {\n Object.setPrototypeOf(this, lazyHashFullInitProto);\n Transform.call(this, this._options);\n return this[method];\n },\n enumerable: false,\n configurable: true,\n });\n }\n\n module.exports = function createHash(algorithm) {\n return new LazyHash(algorithm);\n };\n\n module.exports.createHash = module.exports;\n module.exports.Hash = LazyHash;\n },\n});\n\n// node_modules/create-hmac/legacy.js\nvar require_legacy = __commonJS({\n \"node_modules/create-hmac/legacy.js\"(exports, module) {\n \"use strict\";\n var inherits = require_inherits_browser(),\n Buffer2 = require_safe_buffer().Buffer,\n Base = require_cipher_base(),\n ZEROS = Buffer2.alloc(128),\n blocksize = 64;\n function Hmac(alg, key) {\n Base.call(this, \"digest\"),\n typeof key == \"string\" && (key = Buffer2.from(key)),\n (this._alg = alg),\n (this._key = key),\n key.length > blocksize\n ? (key = alg(key))\n : key.length < blocksize && (key = Buffer2.concat([key, ZEROS], blocksize));\n for (\n var ipad = (this._ipad = Buffer2.allocUnsafe(blocksize)),\n opad = (this._opad = Buffer2.allocUnsafe(blocksize)),\n i = 0;\n i < blocksize;\n i++\n )\n (ipad[i] = key[i] ^ 54), (opad[i] = key[i] ^ 92);\n this._hash = [ipad];\n }\n inherits(Hmac, Base);\n Hmac.prototype._update = function (data) {\n this._hash.push(data);\n };\n Hmac.prototype._final = function () {\n var h = this._alg(Buffer2.concat(this._hash));\n return this._alg(Buffer2.concat([this._opad, h]));\n };\n module.exports = Hmac;\n },\n});\n\n// node_modules/create-hash/md5.js\nvar require_md52 = __commonJS({\n \"node_modules/create-hash/md5.js\"(exports, module) {\n var MD5 = require_md5();\n module.exports = function (buffer) {\n return new MD5().update(buffer).digest();\n };\n },\n});\n\n// node_modules/create-hmac/browser.js\nvar require_browser3 = __commonJS({\n \"node_modules/create-hmac/browser.js\"(exports, module) {\n \"use strict\";\n var inherits = require_inherits_browser(),\n Legacy = require_legacy(),\n Base = require_cipher_base(),\n Buffer2 = require_safe_buffer().Buffer,\n md5 = require_md52(),\n RIPEMD160 = require_ripemd160(),\n sha = require_sha2(),\n ZEROS = Buffer2.alloc(128);\n function Hmac(alg, key) {\n Base.call(this, \"digest\"), typeof key == \"string\" && (key = Buffer2.from(key));\n var blocksize = alg === \"sha512\" || alg === \"sha384\" ? 128 : 64;\n if (((this._alg = alg), (this._key = key), key.length > blocksize)) {\n var hash = alg === \"rmd160\" ? new RIPEMD160() : sha(alg);\n key = hash.update(key).digest();\n } else key.length < blocksize && (key = Buffer2.concat([key, ZEROS], blocksize));\n for (\n var ipad = (this._ipad = Buffer2.allocUnsafe(blocksize)),\n opad = (this._opad = Buffer2.allocUnsafe(blocksize)),\n i = 0;\n i < blocksize;\n i++\n )\n (ipad[i] = key[i] ^ 54), (opad[i] = key[i] ^ 92);\n (this._hash = alg === \"rmd160\" ? new RIPEMD160() : sha(alg)), this._hash.update(ipad);\n }\n inherits(Hmac, Base);\n Hmac.prototype._update = function (data) {\n this._hash.update(data);\n };\n Hmac.prototype._final = function () {\n var h = this._hash.digest(),\n hash = this._alg === \"rmd160\" ? new RIPEMD160() : sha(this._alg);\n return hash.update(this._opad).update(h).digest();\n };\n module.exports = function (alg, key) {\n return (\n (alg = alg.toLowerCase()),\n alg === \"rmd160\" || alg === \"ripemd160\"\n ? new Hmac(\"rmd160\", key)\n : alg === \"md5\"\n ? new Legacy(md5, key)\n : new Hmac(alg, key)\n );\n };\n },\n});\n\n// node_modules/browserify-sign/browser/algorithms.json\nvar require_algorithms = __commonJS({\n \"node_modules/browserify-sign/browser/algorithms.json\"(exports, module) {\n module.exports = {\n sha224WithRSAEncryption: {\n sign: \"rsa\",\n hash: \"sha224\",\n id: \"302d300d06096086480165030402040500041c\",\n },\n \"RSA-SHA224\": {\n sign: \"ecdsa/rsa\",\n hash: \"sha224\",\n id: \"302d300d06096086480165030402040500041c\",\n },\n sha256WithRSAEncryption: {\n sign: \"rsa\",\n hash: \"sha256\",\n id: \"3031300d060960864801650304020105000420\",\n },\n \"RSA-SHA256\": {\n sign: \"ecdsa/rsa\",\n hash: \"sha256\",\n id: \"3031300d060960864801650304020105000420\",\n },\n sha384WithRSAEncryption: {\n sign: \"rsa\",\n hash: \"sha384\",\n id: \"3041300d060960864801650304020205000430\",\n },\n \"RSA-SHA384\": {\n sign: \"ecdsa/rsa\",\n hash: \"sha384\",\n id: \"3041300d060960864801650304020205000430\",\n },\n sha512WithRSAEncryption: {\n sign: \"rsa\",\n hash: \"sha512\",\n id: \"3051300d060960864801650304020305000440\",\n },\n \"RSA-SHA512\": {\n sign: \"ecdsa/rsa\",\n hash: \"sha512\",\n id: \"3051300d060960864801650304020305000440\",\n },\n \"RSA-SHA1\": {\n sign: \"rsa\",\n hash: \"sha1\",\n id: \"3021300906052b0e03021a05000414\",\n },\n \"ecdsa-with-SHA1\": {\n sign: \"ecdsa\",\n hash: \"sha1\",\n id: \"\",\n },\n sha256: {\n sign: \"ecdsa\",\n hash: \"sha256\",\n id: \"\",\n },\n sha224: {\n sign: \"ecdsa\",\n hash: \"sha224\",\n id: \"\",\n },\n sha384: {\n sign: \"ecdsa\",\n hash: \"sha384\",\n id: \"\",\n },\n sha512: {\n sign: \"ecdsa\",\n hash: \"sha512\",\n id: \"\",\n },\n \"DSA-SHA\": {\n sign: \"dsa\",\n hash: \"sha1\",\n id: \"\",\n },\n \"DSA-SHA1\": {\n sign: \"dsa\",\n hash: \"sha1\",\n id: \"\",\n },\n DSA: {\n sign: \"dsa\",\n hash: \"sha1\",\n id: \"\",\n },\n \"DSA-WITH-SHA224\": {\n sign: \"dsa\",\n hash: \"sha224\",\n id: \"\",\n },\n \"DSA-SHA224\": {\n sign: \"dsa\",\n hash: \"sha224\",\n id: \"\",\n },\n \"DSA-WITH-SHA256\": {\n sign: \"dsa\",\n hash: \"sha256\",\n id: \"\",\n },\n \"DSA-SHA256\": {\n sign: \"dsa\",\n hash: \"sha256\",\n id: \"\",\n },\n \"DSA-WITH-SHA384\": {\n sign: \"dsa\",\n hash: \"sha384\",\n id: \"\",\n },\n \"DSA-SHA384\": {\n sign: \"dsa\",\n hash: \"sha384\",\n id: \"\",\n },\n \"DSA-WITH-SHA512\": {\n sign: \"dsa\",\n hash: \"sha512\",\n id: \"\",\n },\n \"DSA-SHA512\": {\n sign: \"dsa\",\n hash: \"sha512\",\n id: \"\",\n },\n \"DSA-RIPEMD160\": {\n sign: \"dsa\",\n hash: \"rmd160\",\n id: \"\",\n },\n ripemd160WithRSA: {\n sign: \"rsa\",\n hash: \"rmd160\",\n id: \"3021300906052b2403020105000414\",\n },\n \"RSA-RIPEMD160\": {\n sign: \"rsa\",\n hash: \"rmd160\",\n id: \"3021300906052b2403020105000414\",\n },\n md5WithRSAEncryption: {\n sign: \"rsa\",\n hash: \"md5\",\n id: \"3020300c06082a864886f70d020505000410\",\n },\n \"RSA-MD5\": {\n sign: \"rsa\",\n hash: \"md5\",\n id: \"3020300c06082a864886f70d020505000410\",\n },\n };\n },\n});\n\n// node_modules/browserify-sign/algos.js\nvar require_algos = __commonJS({\n \"node_modules/browserify-sign/algos.js\"(exports, module) {\n module.exports = require_algorithms();\n },\n});\n\n// node_modules/pbkdf2/lib/precondition.js\nvar require_precondition = __commonJS({\n \"node_modules/pbkdf2/lib/precondition.js\"(exports, module) {\n var MAX_ALLOC = Math.pow(2, 30) - 1;\n module.exports = function (iterations, keylen) {\n if (typeof iterations != \"number\") throw new TypeError(\"Iterations not a number\");\n if (iterations < 0) throw new TypeError(\"Bad iterations\");\n if (typeof keylen != \"number\") throw new TypeError(\"Key length not a number\");\n if (keylen < 0 || keylen > MAX_ALLOC || keylen !== keylen) throw new TypeError(\"Bad key length\");\n };\n },\n});\n\n// node_modules/pbkdf2/lib/default-encoding.js\nvar require_default_encoding = __commonJS({\n \"node_modules/pbkdf2/lib/default-encoding.js\"(exports, module) {\n var defaultEncoding;\n global.process && global.process.browser\n ? (defaultEncoding = \"utf-8\")\n : global.process && global.process.version\n ? ((pVersionMajor = parseInt(process.version.split(\".\")[0].slice(1), 10)),\n (defaultEncoding = pVersionMajor >= 6 ? \"utf-8\" : \"binary\"))\n : (defaultEncoding = \"utf-8\");\n var pVersionMajor;\n module.exports = defaultEncoding;\n },\n});\n\n// node_modules/pbkdf2/lib/to-buffer.js\nvar require_to_buffer = __commonJS({\n \"node_modules/pbkdf2/lib/to-buffer.js\"(exports, module) {\n var Buffer2 = require_safe_buffer().Buffer;\n module.exports = function (thing, encoding, name) {\n if (Buffer2.isBuffer(thing)) return thing;\n if (typeof thing == \"string\") return Buffer2.from(thing, encoding);\n if (ArrayBuffer.isView(thing)) return Buffer2.from(thing.buffer);\n throw new TypeError(name + \" must be a string, a Buffer, a typed array or a DataView\");\n };\n },\n});\n\n// node_modules/pbkdf2/lib/sync-browser.js\nvar require_sync_browser = __commonJS({\n \"node_modules/pbkdf2/lib/sync-browser.js\"(exports, module) {\n var md5 = require_md52(),\n RIPEMD160 = require_ripemd160(),\n sha = require_sha2(),\n Buffer2 = require_safe_buffer().Buffer,\n checkParameters = require_precondition(),\n defaultEncoding = require_default_encoding(),\n toBuffer = require_to_buffer(),\n ZEROS = Buffer2.alloc(128),\n sizes = {\n md5: 16,\n sha1: 20,\n sha224: 28,\n sha256: 32,\n sha384: 48,\n sha512: 64,\n rmd160: 20,\n ripemd160: 20,\n };\n function Hmac(alg, key, saltLen) {\n var hash = getDigest(alg),\n blocksize = alg === \"sha512\" || alg === \"sha384\" ? 128 : 64;\n key.length > blocksize\n ? (key = hash(key))\n : key.length < blocksize && (key = Buffer2.concat([key, ZEROS], blocksize));\n for (\n var ipad = Buffer2.allocUnsafe(blocksize + sizes[alg]),\n opad = Buffer2.allocUnsafe(blocksize + sizes[alg]),\n i = 0;\n i < blocksize;\n i++\n )\n (ipad[i] = key[i] ^ 54), (opad[i] = key[i] ^ 92);\n var ipad1 = Buffer2.allocUnsafe(blocksize + saltLen + 4);\n ipad.copy(ipad1, 0, 0, blocksize),\n (this.ipad1 = ipad1),\n (this.ipad2 = ipad),\n (this.opad = opad),\n (this.alg = alg),\n (this.blocksize = blocksize),\n (this.hash = hash),\n (this.size = sizes[alg]);\n }\n Hmac.prototype.run = function (data, ipad) {\n data.copy(ipad, this.blocksize);\n var h = this.hash(ipad);\n return h.copy(this.opad, this.blocksize), this.hash(this.opad);\n };\n function getDigest(alg) {\n function shaFunc(data) {\n return sha(alg).update(data).digest();\n }\n function rmd160Func(data) {\n return new RIPEMD160().update(data).digest();\n }\n return alg === \"rmd160\" || alg === \"ripemd160\" ? rmd160Func : alg === \"md5\" ? md5 : shaFunc;\n }\n function pbkdf2(password, salt, iterations, keylen, digest) {\n checkParameters(iterations, keylen),\n (password = toBuffer(password, defaultEncoding, \"Password\")),\n (salt = toBuffer(salt, defaultEncoding, \"Salt\")),\n (digest = digest || \"sha1\");\n var hmac = new Hmac(digest, password, salt.length),\n DK = Buffer2.allocUnsafe(keylen),\n block1 = Buffer2.allocUnsafe(salt.length + 4);\n salt.copy(block1, 0, 0, salt.length);\n for (var destPos = 0, hLen = sizes[digest], l = Math.ceil(keylen / hLen), i = 1; i <= l; i++) {\n block1.writeUInt32BE(i, salt.length);\n for (var T = hmac.run(block1, hmac.ipad1), U = T, j = 1; j < iterations; j++) {\n U = hmac.run(U, hmac.ipad2);\n for (var k = 0; k < hLen; k++) T[k] ^= U[k];\n }\n T.copy(DK, destPos), (destPos += hLen);\n }\n return DK;\n }\n module.exports = pbkdf2;\n },\n});\n\n// node_modules/pbkdf2/lib/async.js\nvar require_async = __commonJS({\n \"node_modules/pbkdf2/lib/async.js\"(exports, module) {\n var Buffer2 = require_safe_buffer().Buffer,\n checkParameters = require_precondition(),\n defaultEncoding = require_default_encoding(),\n sync = require_sync_browser(),\n toBuffer = require_to_buffer(),\n ZERO_BUF,\n subtle = globalCrypto.subtle,\n toBrowser = {\n sha: \"SHA-1\",\n \"sha-1\": \"SHA-1\",\n sha1: \"SHA-1\",\n sha256: \"SHA-256\",\n \"sha-256\": \"SHA-256\",\n sha384: \"SHA-384\",\n \"sha-384\": \"SHA-384\",\n \"sha-512\": \"SHA-512\",\n sha512: \"SHA-512\",\n },\n checks = [];\n function checkNative(algo) {\n if ((global.process && !global.process.browser) || !subtle || !subtle.importKey || !subtle.deriveBits)\n return Promise.resolve(!1);\n if (checks[algo] !== void 0) return checks[algo];\n ZERO_BUF = ZERO_BUF || Buffer2.alloc(8);\n var prom = browserPbkdf2(ZERO_BUF, ZERO_BUF, 10, 128, algo)\n .then(function () {\n return !0;\n })\n .catch(function () {\n return !1;\n });\n return (checks[algo] = prom), prom;\n }\n var nextTick;\n function getNextTick() {\n return (\n nextTick ||\n (global.process && global.process.nextTick\n ? (nextTick = global.process.nextTick)\n : global.queueMicrotask\n ? (nextTick = global.queueMicrotask)\n : global.setImmediate\n ? (nextTick = global.setImmediate)\n : (nextTick = global.setTimeout),\n nextTick)\n );\n }\n function browserPbkdf2(password, salt, iterations, length, algo) {\n return subtle\n .importKey(\"raw\", password, { name: \"PBKDF2\" }, !1, [\"deriveBits\"])\n .then(function (key) {\n return subtle.deriveBits(\n {\n name: \"PBKDF2\",\n salt,\n iterations,\n hash: {\n name: algo,\n },\n },\n key,\n length << 3,\n );\n })\n .then(function (res) {\n return Buffer2.from(res);\n });\n }\n function resolvePromise(promise, callback) {\n promise.then(\n function (out) {\n getNextTick()(function () {\n callback(null, out);\n });\n },\n function (e) {\n getNextTick()(function () {\n callback(e);\n });\n },\n );\n }\n module.exports = function (password, salt, iterations, keylen, digest, callback) {\n typeof digest == \"function\" && ((callback = digest), (digest = void 0)), (digest = digest || \"sha1\");\n var algo = toBrowser[digest.toLowerCase()];\n if (!algo || typeof global.Promise != \"function\") {\n getNextTick()(function () {\n var out;\n try {\n out = sync(password, salt, iterations, keylen, digest);\n } catch (e) {\n return callback(e);\n }\n callback(null, out);\n });\n return;\n }\n if (\n (checkParameters(iterations, keylen),\n (password = toBuffer(password, defaultEncoding, \"Password\")),\n (salt = toBuffer(salt, defaultEncoding, \"Salt\")),\n typeof callback != \"function\")\n )\n throw new Error(\"No callback provided to pbkdf2\");\n resolvePromise(\n checkNative(algo).then(function (resp) {\n return resp\n ? browserPbkdf2(password, salt, iterations, keylen, algo)\n : sync(password, salt, iterations, keylen, digest);\n }),\n callback,\n );\n };\n },\n});\n\n// node_modules/pbkdf2/browser.js\nvar require_browser4 = __commonJS({\n \"node_modules/pbkdf2/browser.js\"(exports) {\n exports.pbkdf2 = require_async();\n exports.pbkdf2Sync = require_sync_browser();\n },\n});\n\n// node_modules/des.js/lib/des/utils.js\nvar require_utils = __commonJS({\n \"node_modules/des.js/lib/des/utils.js\"(exports) {\n \"use strict\";\n exports.readUInt32BE = function (bytes, off) {\n var res = (bytes[0 + off] << 24) | (bytes[1 + off] << 16) | (bytes[2 + off] << 8) | bytes[3 + off];\n return res >>> 0;\n };\n exports.writeUInt32BE = function (bytes, value, off) {\n (bytes[0 + off] = value >>> 24),\n (bytes[1 + off] = (value >>> 16) & 255),\n (bytes[2 + off] = (value >>> 8) & 255),\n (bytes[3 + off] = value & 255);\n };\n exports.ip = function (inL, inR, out, off) {\n for (var outL = 0, outR = 0, i = 6; i >= 0; i -= 2) {\n for (var j = 0; j <= 24; j += 8) (outL <<= 1), (outL |= (inR >>> (j + i)) & 1);\n for (var j = 0; j <= 24; j += 8) (outL <<= 1), (outL |= (inL >>> (j + i)) & 1);\n }\n for (var i = 6; i >= 0; i -= 2) {\n for (var j = 1; j <= 25; j += 8) (outR <<= 1), (outR |= (inR >>> (j + i)) & 1);\n for (var j = 1; j <= 25; j += 8) (outR <<= 1), (outR |= (inL >>> (j + i)) & 1);\n }\n (out[off + 0] = outL >>> 0), (out[off + 1] = outR >>> 0);\n };\n exports.rip = function (inL, inR, out, off) {\n for (var outL = 0, outR = 0, i = 0; i < 4; i++)\n for (var j = 24; j >= 0; j -= 8)\n (outL <<= 1), (outL |= (inR >>> (j + i)) & 1), (outL <<= 1), (outL |= (inL >>> (j + i)) & 1);\n for (var i = 4; i < 8; i++)\n for (var j = 24; j >= 0; j -= 8)\n (outR <<= 1), (outR |= (inR >>> (j + i)) & 1), (outR <<= 1), (outR |= (inL >>> (j + i)) & 1);\n (out[off + 0] = outL >>> 0), (out[off + 1] = outR >>> 0);\n };\n exports.pc1 = function (inL, inR, out, off) {\n for (var outL = 0, outR = 0, i = 7; i >= 5; i--) {\n for (var j = 0; j <= 24; j += 8) (outL <<= 1), (outL |= (inR >> (j + i)) & 1);\n for (var j = 0; j <= 24; j += 8) (outL <<= 1), (outL |= (inL >> (j + i)) & 1);\n }\n for (var j = 0; j <= 24; j += 8) (outL <<= 1), (outL |= (inR >> (j + i)) & 1);\n for (var i = 1; i <= 3; i++) {\n for (var j = 0; j <= 24; j += 8) (outR <<= 1), (outR |= (inR >> (j + i)) & 1);\n for (var j = 0; j <= 24; j += 8) (outR <<= 1), (outR |= (inL >> (j + i)) & 1);\n }\n for (var j = 0; j <= 24; j += 8) (outR <<= 1), (outR |= (inL >> (j + i)) & 1);\n (out[off + 0] = outL >>> 0), (out[off + 1] = outR >>> 0);\n };\n exports.r28shl = function (num, shift) {\n return ((num << shift) & 268435455) | (num >>> (28 - shift));\n };\n var pc2table = [\n 14, 11, 17, 4, 27, 23, 25, 0, 13, 22, 7, 18, 5, 9, 16, 24, 2, 20, 12, 21, 1, 8, 15, 26, 15, 4, 25, 19, 9, 1, 26,\n 16, 5, 11, 23, 8, 12, 7, 17, 0, 22, 3, 10, 14, 6, 20, 27, 24,\n ];\n exports.pc2 = function (inL, inR, out, off) {\n for (var outL = 0, outR = 0, len = pc2table.length >>> 1, i = 0; i < len; i++)\n (outL <<= 1), (outL |= (inL >>> pc2table[i]) & 1);\n for (var i = len; i < pc2table.length; i++) (outR <<= 1), (outR |= (inR >>> pc2table[i]) & 1);\n (out[off + 0] = outL >>> 0), (out[off + 1] = outR >>> 0);\n };\n exports.expand = function (r, out, off) {\n var outL = 0,\n outR = 0;\n outL = ((r & 1) << 5) | (r >>> 27);\n for (var i = 23; i >= 15; i -= 4) (outL <<= 6), (outL |= (r >>> i) & 63);\n for (var i = 11; i >= 3; i -= 4) (outR |= (r >>> i) & 63), (outR <<= 6);\n (outR |= ((r & 31) << 1) | (r >>> 31)), (out[off + 0] = outL >>> 0), (out[off + 1] = outR >>> 0);\n };\n var sTable = [\n 14, 0, 4, 15, 13, 7, 1, 4, 2, 14, 15, 2, 11, 13, 8, 1, 3, 10, 10, 6, 6, 12, 12, 11, 5, 9, 9, 5, 0, 3, 7, 8, 4, 15,\n 1, 12, 14, 8, 8, 2, 13, 4, 6, 9, 2, 1, 11, 7, 15, 5, 12, 11, 9, 3, 7, 14, 3, 10, 10, 0, 5, 6, 0, 13, 15, 3, 1, 13,\n 8, 4, 14, 7, 6, 15, 11, 2, 3, 8, 4, 14, 9, 12, 7, 0, 2, 1, 13, 10, 12, 6, 0, 9, 5, 11, 10, 5, 0, 13, 14, 8, 7, 10,\n 11, 1, 10, 3, 4, 15, 13, 4, 1, 2, 5, 11, 8, 6, 12, 7, 6, 12, 9, 0, 3, 5, 2, 14, 15, 9, 10, 13, 0, 7, 9, 0, 14, 9,\n 6, 3, 3, 4, 15, 6, 5, 10, 1, 2, 13, 8, 12, 5, 7, 14, 11, 12, 4, 11, 2, 15, 8, 1, 13, 1, 6, 10, 4, 13, 9, 0, 8, 6,\n 15, 9, 3, 8, 0, 7, 11, 4, 1, 15, 2, 14, 12, 3, 5, 11, 10, 5, 14, 2, 7, 12, 7, 13, 13, 8, 14, 11, 3, 5, 0, 6, 6,\n 15, 9, 0, 10, 3, 1, 4, 2, 7, 8, 2, 5, 12, 11, 1, 12, 10, 4, 14, 15, 9, 10, 3, 6, 15, 9, 0, 0, 6, 12, 10, 11, 1, 7,\n 13, 13, 8, 15, 9, 1, 4, 3, 5, 14, 11, 5, 12, 2, 7, 8, 2, 4, 14, 2, 14, 12, 11, 4, 2, 1, 12, 7, 4, 10, 7, 11, 13,\n 6, 1, 8, 5, 5, 0, 3, 15, 15, 10, 13, 3, 0, 9, 14, 8, 9, 6, 4, 11, 2, 8, 1, 12, 11, 7, 10, 1, 13, 14, 7, 2, 8, 13,\n 15, 6, 9, 15, 12, 0, 5, 9, 6, 10, 3, 4, 0, 5, 14, 3, 12, 10, 1, 15, 10, 4, 15, 2, 9, 7, 2, 12, 6, 9, 8, 5, 0, 6,\n 13, 1, 3, 13, 4, 14, 14, 0, 7, 11, 5, 3, 11, 8, 9, 4, 14, 3, 15, 2, 5, 12, 2, 9, 8, 5, 12, 15, 3, 10, 7, 11, 0,\n 14, 4, 1, 10, 7, 1, 6, 13, 0, 11, 8, 6, 13, 4, 13, 11, 0, 2, 11, 14, 7, 15, 4, 0, 9, 8, 1, 13, 10, 3, 14, 12, 3,\n 9, 5, 7, 12, 5, 2, 10, 15, 6, 8, 1, 6, 1, 6, 4, 11, 11, 13, 13, 8, 12, 1, 3, 4, 7, 10, 14, 7, 10, 9, 15, 5, 6, 0,\n 8, 15, 0, 14, 5, 2, 9, 3, 2, 12, 13, 1, 2, 15, 8, 13, 4, 8, 6, 10, 15, 3, 11, 7, 1, 4, 10, 12, 9, 5, 3, 6, 14, 11,\n 5, 0, 0, 14, 12, 9, 7, 2, 7, 2, 11, 1, 4, 14, 1, 7, 9, 4, 12, 10, 14, 8, 2, 13, 0, 15, 6, 12, 10, 9, 13, 0, 15, 3,\n 3, 5, 5, 6, 8, 11,\n ];\n exports.substitute = function (inL, inR) {\n for (var out = 0, i = 0; i < 4; i++) {\n var b = (inL >>> (18 - i * 6)) & 63,\n sb = sTable[i * 64 + b];\n (out <<= 4), (out |= sb);\n }\n for (var i = 0; i < 4; i++) {\n var b = (inR >>> (18 - i * 6)) & 63,\n sb = sTable[4 * 64 + i * 64 + b];\n (out <<= 4), (out |= sb);\n }\n return out >>> 0;\n };\n var permuteTable = [\n 16, 25, 12, 11, 3, 20, 4, 15, 31, 17, 9, 6, 27, 14, 1, 22, 30, 24, 8, 18, 0, 5, 29, 23, 13, 19, 2, 26, 10, 21, 28,\n 7,\n ];\n exports.permute = function (num) {\n for (var out = 0, i = 0; i < permuteTable.length; i++) (out <<= 1), (out |= (num >>> permuteTable[i]) & 1);\n return out >>> 0;\n };\n exports.padSplit = function (num, size, group) {\n for (var str = num.toString(2); str.length < size; ) str = \"0\" + str;\n for (var out = [], i = 0; i < size; i += group) out.push(str.slice(i, i + group));\n return out.join(\" \");\n };\n },\n});\n\n// node_modules/minimalistic-assert/index.js\nvar require_minimalistic_assert = __commonJS({\n \"node_modules/minimalistic-assert/index.js\"(exports, module) {\n module.exports = assert;\n function assert(val, msg) {\n if (!val) throw new Error(msg || \"Assertion failed\");\n }\n assert.equal = function (l, r, msg) {\n if (l != r) throw new Error(msg || \"Assertion failed: \" + l + \" != \" + r);\n };\n },\n});\n\n// node_modules/des.js/lib/des/cipher.js\nvar require_cipher = __commonJS({\n \"node_modules/des.js/lib/des/cipher.js\"(exports, module) {\n \"use strict\";\n var assert = require_minimalistic_assert();\n function Cipher(options) {\n (this.options = options),\n (this.type = this.options.type),\n (this.blockSize = 8),\n this._init(),\n (this.buffer = new Array(this.blockSize)),\n (this.bufferOff = 0);\n }\n module.exports = Cipher;\n Cipher.prototype._init = function () {};\n Cipher.prototype.update = function (data) {\n return data.length === 0 ? [] : this.type === \"decrypt\" ? this._updateDecrypt(data) : this._updateEncrypt(data);\n };\n Cipher.prototype._buffer = function (data, off) {\n for (var min = Math.min(this.buffer.length - this.bufferOff, data.length - off), i = 0; i < min; i++)\n this.buffer[this.bufferOff + i] = data[off + i];\n return (this.bufferOff += min), min;\n };\n Cipher.prototype._flushBuffer = function (out, off) {\n return this._update(this.buffer, 0, out, off), (this.bufferOff = 0), this.blockSize;\n };\n Cipher.prototype._updateEncrypt = function (data) {\n var inputOff = 0,\n outputOff = 0,\n count = ((this.bufferOff + data.length) / this.blockSize) | 0,\n out = new Array(count * this.blockSize);\n this.bufferOff !== 0 &&\n ((inputOff += this._buffer(data, inputOff)),\n this.bufferOff === this.buffer.length && (outputOff += this._flushBuffer(out, outputOff)));\n for (\n var max = data.length - ((data.length - inputOff) % this.blockSize);\n inputOff < max;\n inputOff += this.blockSize\n )\n this._update(data, inputOff, out, outputOff), (outputOff += this.blockSize);\n for (; inputOff < data.length; inputOff++, this.bufferOff++) this.buffer[this.bufferOff] = data[inputOff];\n return out;\n };\n Cipher.prototype._updateDecrypt = function (data) {\n for (\n var inputOff = 0,\n outputOff = 0,\n count = Math.ceil((this.bufferOff + data.length) / this.blockSize) - 1,\n out = new Array(count * this.blockSize);\n count > 0;\n count--\n )\n (inputOff += this._buffer(data, inputOff)), (outputOff += this._flushBuffer(out, outputOff));\n return (inputOff += this._buffer(data, inputOff)), out;\n };\n Cipher.prototype.final = function (buffer) {\n var first;\n buffer && (first = this.update(buffer));\n var last;\n return (\n this.type === \"encrypt\" ? (last = this._finalEncrypt()) : (last = this._finalDecrypt()),\n first ? first.concat(last) : last\n );\n };\n Cipher.prototype._pad = function (buffer, off) {\n if (off === 0) return !1;\n for (; off < buffer.length; ) buffer[off++] = 0;\n return !0;\n };\n Cipher.prototype._finalEncrypt = function () {\n if (!this._pad(this.buffer, this.bufferOff)) return [];\n var out = new Array(this.blockSize);\n return this._update(this.buffer, 0, out, 0), out;\n };\n Cipher.prototype._unpad = function (buffer) {\n return buffer;\n };\n Cipher.prototype._finalDecrypt = function () {\n assert.equal(this.bufferOff, this.blockSize, \"Not enough data to decrypt\");\n var out = new Array(this.blockSize);\n return this._flushBuffer(out, 0), this._unpad(out);\n };\n },\n});\n\n// node_modules/des.js/lib/des/des.js\nvar require_des = __commonJS({\n \"node_modules/des.js/lib/des/des.js\"(exports, module) {\n \"use strict\";\n var assert = require_minimalistic_assert(),\n inherits = require_inherits_browser(),\n utils = require_utils(),\n Cipher = require_cipher();\n function DESState() {\n (this.tmp = new Array(2)), (this.keys = null);\n }\n function DES(options) {\n Cipher.call(this, options);\n var state = new DESState();\n (this._desState = state), this.deriveKeys(state, options.key);\n }\n inherits(DES, Cipher);\n module.exports = DES;\n DES.create = function (options) {\n return new DES(options);\n };\n var shiftTable = [1, 1, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 1];\n DES.prototype.deriveKeys = function (state, key) {\n (state.keys = new Array(16 * 2)), assert.equal(key.length, this.blockSize, \"Invalid key length\");\n var kL = utils.readUInt32BE(key, 0),\n kR = utils.readUInt32BE(key, 4);\n utils.pc1(kL, kR, state.tmp, 0), (kL = state.tmp[0]), (kR = state.tmp[1]);\n for (var i = 0; i < state.keys.length; i += 2) {\n var shift = shiftTable[i >>> 1];\n (kL = utils.r28shl(kL, shift)), (kR = utils.r28shl(kR, shift)), utils.pc2(kL, kR, state.keys, i);\n }\n };\n DES.prototype._update = function (inp, inOff, out, outOff) {\n var state = this._desState,\n l = utils.readUInt32BE(inp, inOff),\n r = utils.readUInt32BE(inp, inOff + 4);\n utils.ip(l, r, state.tmp, 0),\n (l = state.tmp[0]),\n (r = state.tmp[1]),\n this.type === \"encrypt\" ? this._encrypt(state, l, r, state.tmp, 0) : this._decrypt(state, l, r, state.tmp, 0),\n (l = state.tmp[0]),\n (r = state.tmp[1]),\n utils.writeUInt32BE(out, l, outOff),\n utils.writeUInt32BE(out, r, outOff + 4);\n };\n DES.prototype._pad = function (buffer, off) {\n for (var value = buffer.length - off, i = off; i < buffer.length; i++) buffer[i] = value;\n return !0;\n };\n DES.prototype._unpad = function (buffer) {\n for (var pad = buffer[buffer.length - 1], i = buffer.length - pad; i < buffer.length; i++)\n assert.equal(buffer[i], pad);\n return buffer.slice(0, buffer.length - pad);\n };\n DES.prototype._encrypt = function (state, lStart, rStart, out, off) {\n for (var l = lStart, r = rStart, i = 0; i < state.keys.length; i += 2) {\n var keyL = state.keys[i],\n keyR = state.keys[i + 1];\n utils.expand(r, state.tmp, 0), (keyL ^= state.tmp[0]), (keyR ^= state.tmp[1]);\n var s = utils.substitute(keyL, keyR),\n f = utils.permute(s),\n t = r;\n (r = (l ^ f) >>> 0), (l = t);\n }\n utils.rip(r, l, out, off);\n };\n DES.prototype._decrypt = function (state, lStart, rStart, out, off) {\n for (var l = rStart, r = lStart, i = state.keys.length - 2; i >= 0; i -= 2) {\n var keyL = state.keys[i],\n keyR = state.keys[i + 1];\n utils.expand(l, state.tmp, 0), (keyL ^= state.tmp[0]), (keyR ^= state.tmp[1]);\n var s = utils.substitute(keyL, keyR),\n f = utils.permute(s),\n t = l;\n (l = (r ^ f) >>> 0), (r = t);\n }\n utils.rip(l, r, out, off);\n };\n },\n});\n\n// node_modules/des.js/lib/des/cbc.js\nvar require_cbc = __commonJS({\n \"node_modules/des.js/lib/des/cbc.js\"(exports) {\n \"use strict\";\n var assert = require_minimalistic_assert(),\n inherits = require_inherits_browser(),\n proto = {};\n function CBCState(iv) {\n assert.equal(iv.length, 8, \"Invalid IV length\"), (this.iv = new Array(8));\n for (var i = 0; i < this.iv.length; i++) this.iv[i] = iv[i];\n }\n function instantiate(Base) {\n function CBC(options) {\n Base.call(this, options), this._cbcInit();\n }\n inherits(CBC, Base);\n for (var keys = Object.keys(proto), i = 0; i < keys.length; i++) {\n var key = keys[i];\n CBC.prototype[key] = proto[key];\n }\n return (\n (CBC.create = function (options) {\n return new CBC(options);\n }),\n CBC\n );\n }\n exports.instantiate = instantiate;\n proto._cbcInit = function () {\n var state = new CBCState(this.options.iv);\n this._cbcState = state;\n };\n proto._update = function (inp, inOff, out, outOff) {\n var state = this._cbcState,\n superProto = this.constructor.super_.prototype,\n iv = state.iv;\n if (this.type === \"encrypt\") {\n for (var i = 0; i < this.blockSize; i++) iv[i] ^= inp[inOff + i];\n superProto._update.call(this, iv, 0, out, outOff);\n for (var i = 0; i < this.blockSize; i++) iv[i] = out[outOff + i];\n } else {\n superProto._update.call(this, inp, inOff, out, outOff);\n for (var i = 0; i < this.blockSize; i++) out[outOff + i] ^= iv[i];\n for (var i = 0; i < this.blockSize; i++) iv[i] = inp[inOff + i];\n }\n };\n },\n});\n\n// node_modules/des.js/lib/des/ede.js\nvar require_ede = __commonJS({\n \"node_modules/des.js/lib/des/ede.js\"(exports, module) {\n \"use strict\";\n var assert = require_minimalistic_assert(),\n inherits = require_inherits_browser(),\n Cipher = require_cipher(),\n DES = require_des();\n function EDEState(type, key) {\n assert.equal(key.length, 24, \"Invalid key length\");\n var k1 = key.slice(0, 8),\n k2 = key.slice(8, 16),\n k3 = key.slice(16, 24);\n type === \"encrypt\"\n ? (this.ciphers = [\n DES.create({ type: \"encrypt\", key: k1 }),\n DES.create({ type: \"decrypt\", key: k2 }),\n DES.create({ type: \"encrypt\", key: k3 }),\n ])\n : (this.ciphers = [\n DES.create({ type: \"decrypt\", key: k3 }),\n DES.create({ type: \"encrypt\", key: k2 }),\n DES.create({ type: \"decrypt\", key: k1 }),\n ]);\n }\n function EDE(options) {\n Cipher.call(this, options);\n var state = new EDEState(this.type, this.options.key);\n this._edeState = state;\n }\n inherits(EDE, Cipher);\n module.exports = EDE;\n EDE.create = function (options) {\n return new EDE(options);\n };\n EDE.prototype._update = function (inp, inOff, out, outOff) {\n var state = this._edeState;\n state.ciphers[0]._update(inp, inOff, out, outOff),\n state.ciphers[1]._update(out, outOff, out, outOff),\n state.ciphers[2]._update(out, outOff, out, outOff);\n };\n EDE.prototype._pad = DES.prototype._pad;\n EDE.prototype._unpad = DES.prototype._unpad;\n },\n});\n\n// node_modules/des.js/lib/des.js\nvar require_des2 = __commonJS({\n \"node_modules/des.js/lib/des.js\"(exports) {\n \"use strict\";\n exports.utils = require_utils();\n exports.Cipher = require_cipher();\n exports.DES = require_des();\n exports.CBC = require_cbc();\n exports.EDE = require_ede();\n },\n});\n\n// node_modules/browserify-des/index.js\nvar require_browserify_des = __commonJS({\n \"node_modules/browserify-des/index.js\"(exports, module) {\n var CipherBase = require_cipher_base(),\n des = require_des2(),\n inherits = require_inherits_browser(),\n Buffer2 = require_safe_buffer().Buffer,\n modes = {\n \"des-ede3-cbc\": des.CBC.instantiate(des.EDE),\n \"des-ede3\": des.EDE,\n \"des-ede-cbc\": des.CBC.instantiate(des.EDE),\n \"des-ede\": des.EDE,\n \"des-cbc\": des.CBC.instantiate(des.DES),\n \"des-ecb\": des.DES,\n };\n modes.des = modes[\"des-cbc\"];\n modes.des3 = modes[\"des-ede3-cbc\"];\n module.exports = DES;\n inherits(DES, CipherBase);\n function DES(opts) {\n CipherBase.call(this);\n var modeName = opts.mode.toLowerCase(),\n mode = modes[modeName],\n type;\n opts.decrypt ? (type = \"decrypt\") : (type = \"encrypt\");\n var key = opts.key;\n Buffer2.isBuffer(key) || (key = Buffer2.from(key)),\n (modeName === \"des-ede\" || modeName === \"des-ede-cbc\") && (key = Buffer2.concat([key, key.slice(0, 8)]));\n var iv = opts.iv;\n Buffer2.isBuffer(iv) || (iv = Buffer2.from(iv)),\n (this._des = mode.create({\n key,\n iv,\n type,\n }));\n }\n DES.prototype._update = function (data) {\n return Buffer2.from(this._des.update(data));\n };\n DES.prototype._final = function () {\n return Buffer2.from(this._des.final());\n };\n },\n});\n\n// node_modules/browserify-aes/modes/ecb.js\nvar require_ecb = __commonJS({\n \"node_modules/browserify-aes/modes/ecb.js\"(exports) {\n exports.encrypt = function (self2, block) {\n return self2._cipher.encryptBlock(block);\n };\n exports.decrypt = function (self2, block) {\n return self2._cipher.decryptBlock(block);\n };\n },\n});\n\n// node_modules/buffer-xor/index.js\nvar require_buffer_xor = __commonJS({\n \"node_modules/buffer-xor/index.js\"(exports, module) {\n module.exports = function (a, b) {\n for (var length = Math.min(a.length, b.length), buffer = new Buffer(length), i = 0; i < length; ++i)\n buffer[i] = a[i] ^ b[i];\n return buffer;\n };\n },\n});\n\n// node_modules/browserify-aes/modes/cbc.js\nvar require_cbc2 = __commonJS({\n \"node_modules/browserify-aes/modes/cbc.js\"(exports) {\n var xor = require_buffer_xor();\n exports.encrypt = function (self2, block) {\n var data = xor(block, self2._prev);\n return (self2._prev = self2._cipher.encryptBlock(data)), self2._prev;\n };\n exports.decrypt = function (self2, block) {\n var pad = self2._prev;\n self2._prev = block;\n var out = self2._cipher.decryptBlock(block);\n return xor(out, pad);\n };\n },\n});\n\n// node_modules/browserify-aes/modes/cfb.js\nvar require_cfb = __commonJS({\n \"node_modules/browserify-aes/modes/cfb.js\"(exports) {\n var Buffer2 = require_safe_buffer().Buffer,\n xor = require_buffer_xor();\n function encryptStart(self2, data, decrypt) {\n var len = data.length,\n out = xor(data, self2._cache);\n return (\n (self2._cache = self2._cache.slice(len)),\n (self2._prev = Buffer2.concat([self2._prev, decrypt ? data : out])),\n out\n );\n }\n exports.encrypt = function (self2, data, decrypt) {\n for (var out = Buffer2.allocUnsafe(0), len; data.length; )\n if (\n (self2._cache.length === 0 &&\n ((self2._cache = self2._cipher.encryptBlock(self2._prev)), (self2._prev = Buffer2.allocUnsafe(0))),\n self2._cache.length <= data.length)\n )\n (len = self2._cache.length),\n (out = Buffer2.concat([out, encryptStart(self2, data.slice(0, len), decrypt)])),\n (data = data.slice(len));\n else {\n out = Buffer2.concat([out, encryptStart(self2, data, decrypt)]);\n break;\n }\n return out;\n };\n },\n});\n\n// node_modules/browserify-aes/modes/cfb8.js\nvar require_cfb8 = __commonJS({\n \"node_modules/browserify-aes/modes/cfb8.js\"(exports) {\n var Buffer2 = require_safe_buffer().Buffer;\n function encryptByte(self2, byteParam, decrypt) {\n var pad = self2._cipher.encryptBlock(self2._prev),\n out = pad[0] ^ byteParam;\n return (self2._prev = Buffer2.concat([self2._prev.slice(1), Buffer2.from([decrypt ? byteParam : out])])), out;\n }\n exports.encrypt = function (self2, chunk, decrypt) {\n for (var len = chunk.length, out = Buffer2.allocUnsafe(len), i = -1; ++i < len; )\n out[i] = encryptByte(self2, chunk[i], decrypt);\n return out;\n };\n },\n});\n\n// node_modules/browserify-aes/modes/cfb1.js\nvar require_cfb1 = __commonJS({\n \"node_modules/browserify-aes/modes/cfb1.js\"(exports) {\n var Buffer2 = require_safe_buffer().Buffer;\n function encryptByte(self2, byteParam, decrypt) {\n for (var pad, i = -1, len = 8, out = 0, bit, value; ++i < len; )\n (pad = self2._cipher.encryptBlock(self2._prev)),\n (bit = byteParam & (1 << (7 - i)) ? 128 : 0),\n (value = pad[0] ^ bit),\n (out += (value & 128) >> i % 8),\n (self2._prev = shiftIn(self2._prev, decrypt ? bit : value));\n return out;\n }\n function shiftIn(buffer, value) {\n var len = buffer.length,\n i = -1,\n out = Buffer2.allocUnsafe(buffer.length);\n for (buffer = Buffer2.concat([buffer, Buffer2.from([value])]); ++i < len; )\n out[i] = (buffer[i] << 1) | (buffer[i + 1] >> 7);\n return out;\n }\n exports.encrypt = function (self2, chunk, decrypt) {\n for (var len = chunk.length, out = Buffer2.allocUnsafe(len), i = -1; ++i < len; )\n out[i] = encryptByte(self2, chunk[i], decrypt);\n return out;\n };\n },\n});\n\n// node_modules/browserify-aes/modes/ofb.js\nvar require_ofb = __commonJS({\n \"node_modules/browserify-aes/modes/ofb.js\"(exports) {\n var xor = require_buffer_xor();\n function getBlock(self2) {\n return (self2._prev = self2._cipher.encryptBlock(self2._prev)), self2._prev;\n }\n exports.encrypt = function (self2, chunk) {\n for (; self2._cache.length < chunk.length; ) self2._cache = Buffer.concat([self2._cache, getBlock(self2)]);\n var pad = self2._cache.slice(0, chunk.length);\n return (self2._cache = self2._cache.slice(chunk.length)), xor(chunk, pad);\n };\n },\n});\n\n// node_modules/browserify-aes/incr32.js\nvar require_incr32 = __commonJS({\n \"node_modules/browserify-aes/incr32.js\"(exports, module) {\n function incr32(iv) {\n for (var len = iv.length, item; len--; )\n if (((item = iv.readUInt8(len)), item === 255)) iv.writeUInt8(0, len);\n else {\n item++, iv.writeUInt8(item, len);\n break;\n }\n }\n module.exports = incr32;\n },\n});\n\n// node_modules/browserify-aes/modes/ctr.js\nvar require_ctr = __commonJS({\n \"node_modules/browserify-aes/modes/ctr.js\"(exports) {\n var xor = require_buffer_xor(),\n Buffer2 = require_safe_buffer().Buffer,\n incr32 = require_incr32();\n function getBlock(self2) {\n var out = self2._cipher.encryptBlockRaw(self2._prev);\n return incr32(self2._prev), out;\n }\n var blockSize = 16;\n exports.encrypt = function (self2, chunk) {\n var chunkNum = Math.ceil(chunk.length / blockSize),\n start = self2._cache.length;\n self2._cache = Buffer2.concat([self2._cache, Buffer2.allocUnsafe(chunkNum * blockSize)]);\n for (var i = 0; i < chunkNum; i++) {\n var out = getBlock(self2),\n offset = start + i * blockSize;\n self2._cache.writeUInt32BE(out[0], offset + 0),\n self2._cache.writeUInt32BE(out[1], offset + 4),\n self2._cache.writeUInt32BE(out[2], offset + 8),\n self2._cache.writeUInt32BE(out[3], offset + 12);\n }\n var pad = self2._cache.slice(0, chunk.length);\n return (self2._cache = self2._cache.slice(chunk.length)), xor(chunk, pad);\n };\n },\n});\n\n// node_modules/browserify-aes/modes/list.json\nvar require_list = __commonJS({\n \"node_modules/browserify-aes/modes/list.json\"(exports, module) {\n module.exports = {\n \"aes-128-ecb\": {\n cipher: \"AES\",\n key: 128,\n iv: 0,\n mode: \"ECB\",\n type: \"block\",\n },\n \"aes-192-ecb\": {\n cipher: \"AES\",\n key: 192,\n iv: 0,\n mode: \"ECB\",\n type: \"block\",\n },\n \"aes-256-ecb\": {\n cipher: \"AES\",\n key: 256,\n iv: 0,\n mode: \"ECB\",\n type: \"block\",\n },\n \"aes-128-cbc\": {\n cipher: \"AES\",\n key: 128,\n iv: 16,\n mode: \"CBC\",\n type: \"block\",\n },\n \"aes-192-cbc\": {\n cipher: \"AES\",\n key: 192,\n iv: 16,\n mode: \"CBC\",\n type: \"block\",\n },\n \"aes-256-cbc\": {\n cipher: \"AES\",\n key: 256,\n iv: 16,\n mode: \"CBC\",\n type: \"block\",\n },\n aes128: {\n cipher: \"AES\",\n key: 128,\n iv: 16,\n mode: \"CBC\",\n type: \"block\",\n },\n aes192: {\n cipher: \"AES\",\n key: 192,\n iv: 16,\n mode: \"CBC\",\n type: \"block\",\n },\n aes256: {\n cipher: \"AES\",\n key: 256,\n iv: 16,\n mode: \"CBC\",\n type: \"block\",\n },\n \"aes-128-cfb\": {\n cipher: \"AES\",\n key: 128,\n iv: 16,\n mode: \"CFB\",\n type: \"stream\",\n },\n \"aes-192-cfb\": {\n cipher: \"AES\",\n key: 192,\n iv: 16,\n mode: \"CFB\",\n type: \"stream\",\n },\n \"aes-256-cfb\": {\n cipher: \"AES\",\n key: 256,\n iv: 16,\n mode: \"CFB\",\n type: \"stream\",\n },\n \"aes-128-cfb8\": {\n cipher: \"AES\",\n key: 128,\n iv: 16,\n mode: \"CFB8\",\n type: \"stream\",\n },\n \"aes-192-cfb8\": {\n cipher: \"AES\",\n key: 192,\n iv: 16,\n mode: \"CFB8\",\n type: \"stream\",\n },\n \"aes-256-cfb8\": {\n cipher: \"AES\",\n key: 256,\n iv: 16,\n mode: \"CFB8\",\n type: \"stream\",\n },\n \"aes-128-cfb1\": {\n cipher: \"AES\",\n key: 128,\n iv: 16,\n mode: \"CFB1\",\n type: \"stream\",\n },\n \"aes-192-cfb1\": {\n cipher: \"AES\",\n key: 192,\n iv: 16,\n mode: \"CFB1\",\n type: \"stream\",\n },\n \"aes-256-cfb1\": {\n cipher: \"AES\",\n key: 256,\n iv: 16,\n mode: \"CFB1\",\n type: \"stream\",\n },\n \"aes-128-ofb\": {\n cipher: \"AES\",\n key: 128,\n iv: 16,\n mode: \"OFB\",\n type: \"stream\",\n },\n \"aes-192-ofb\": {\n cipher: \"AES\",\n key: 192,\n iv: 16,\n mode: \"OFB\",\n type: \"stream\",\n },\n \"aes-256-ofb\": {\n cipher: \"AES\",\n key: 256,\n iv: 16,\n mode: \"OFB\",\n type: \"stream\",\n },\n \"aes-128-ctr\": {\n cipher: \"AES\",\n key: 128,\n iv: 16,\n mode: \"CTR\",\n type: \"stream\",\n },\n \"aes-192-ctr\": {\n cipher: \"AES\",\n key: 192,\n iv: 16,\n mode: \"CTR\",\n type: \"stream\",\n },\n \"aes-256-ctr\": {\n cipher: \"AES\",\n key: 256,\n iv: 16,\n mode: \"CTR\",\n type: \"stream\",\n },\n \"aes-128-gcm\": {\n cipher: \"AES\",\n key: 128,\n iv: 12,\n mode: \"GCM\",\n type: \"auth\",\n },\n \"aes-192-gcm\": {\n cipher: \"AES\",\n key: 192,\n iv: 12,\n mode: \"GCM\",\n type: \"auth\",\n },\n \"aes-256-gcm\": {\n cipher: \"AES\",\n key: 256,\n iv: 12,\n mode: \"GCM\",\n type: \"auth\",\n },\n };\n },\n});\n\n// node_modules/browserify-aes/modes/index.js\nvar require_modes = __commonJS({\n \"node_modules/browserify-aes/modes/index.js\"(exports, module) {\n var modeModules = {\n ECB: require_ecb(),\n CBC: require_cbc2(),\n CFB: require_cfb(),\n CFB8: require_cfb8(),\n CFB1: require_cfb1(),\n OFB: require_ofb(),\n CTR: require_ctr(),\n GCM: require_ctr(),\n },\n modes = require_list();\n for (key in modes) modes[key].module = modeModules[modes[key].mode];\n var key;\n module.exports = modes;\n },\n});\n\n// node_modules/browserify-aes/aes.js\nvar require_aes = __commonJS({\n \"node_modules/browserify-aes/aes.js\"(exports, module) {\n var Buffer2 = require_safe_buffer().Buffer;\n function asUInt32Array(buf) {\n Buffer2.isBuffer(buf) || (buf = Buffer2.from(buf));\n for (var len = (buf.length / 4) | 0, out = new Array(len), i = 0; i < len; i++) out[i] = buf.readUInt32BE(i * 4);\n return out;\n }\n function scrubVec(v) {\n for (var i = 0; i < v.length; v++) v[i] = 0;\n }\n function cryptBlock(M, keySchedule, SUB_MIX, SBOX, nRounds) {\n for (\n var SUB_MIX0 = SUB_MIX[0],\n SUB_MIX1 = SUB_MIX[1],\n SUB_MIX2 = SUB_MIX[2],\n SUB_MIX3 = SUB_MIX[3],\n s0 = M[0] ^ keySchedule[0],\n s1 = M[1] ^ keySchedule[1],\n s2 = M[2] ^ keySchedule[2],\n s3 = M[3] ^ keySchedule[3],\n t0,\n t1,\n t2,\n t3,\n ksRow = 4,\n round = 1;\n round < nRounds;\n round++\n )\n (t0 =\n SUB_MIX0[s0 >>> 24] ^\n SUB_MIX1[(s1 >>> 16) & 255] ^\n SUB_MIX2[(s2 >>> 8) & 255] ^\n SUB_MIX3[s3 & 255] ^\n keySchedule[ksRow++]),\n (t1 =\n SUB_MIX0[s1 >>> 24] ^\n SUB_MIX1[(s2 >>> 16) & 255] ^\n SUB_MIX2[(s3 >>> 8) & 255] ^\n SUB_MIX3[s0 & 255] ^\n keySchedule[ksRow++]),\n (t2 =\n SUB_MIX0[s2 >>> 24] ^\n SUB_MIX1[(s3 >>> 16) & 255] ^\n SUB_MIX2[(s0 >>> 8) & 255] ^\n SUB_MIX3[s1 & 255] ^\n keySchedule[ksRow++]),\n (t3 =\n SUB_MIX0[s3 >>> 24] ^\n SUB_MIX1[(s0 >>> 16) & 255] ^\n SUB_MIX2[(s1 >>> 8) & 255] ^\n SUB_MIX3[s2 & 255] ^\n keySchedule[ksRow++]),\n (s0 = t0),\n (s1 = t1),\n (s2 = t2),\n (s3 = t3);\n return (\n (t0 =\n ((SBOX[s0 >>> 24] << 24) | (SBOX[(s1 >>> 16) & 255] << 16) | (SBOX[(s2 >>> 8) & 255] << 8) | SBOX[s3 & 255]) ^\n keySchedule[ksRow++]),\n (t1 =\n ((SBOX[s1 >>> 24] << 24) | (SBOX[(s2 >>> 16) & 255] << 16) | (SBOX[(s3 >>> 8) & 255] << 8) | SBOX[s0 & 255]) ^\n keySchedule[ksRow++]),\n (t2 =\n ((SBOX[s2 >>> 24] << 24) | (SBOX[(s3 >>> 16) & 255] << 16) | (SBOX[(s0 >>> 8) & 255] << 8) | SBOX[s1 & 255]) ^\n keySchedule[ksRow++]),\n (t3 =\n ((SBOX[s3 >>> 24] << 24) | (SBOX[(s0 >>> 16) & 255] << 16) | (SBOX[(s1 >>> 8) & 255] << 8) | SBOX[s2 & 255]) ^\n keySchedule[ksRow++]),\n (t0 = t0 >>> 0),\n (t1 = t1 >>> 0),\n (t2 = t2 >>> 0),\n (t3 = t3 >>> 0),\n [t0, t1, t2, t3]\n );\n }\n var RCON = [0, 1, 2, 4, 8, 16, 32, 64, 128, 27, 54],\n G = (function () {\n for (var d = new Array(256), j = 0; j < 256; j++) j < 128 ? (d[j] = j << 1) : (d[j] = (j << 1) ^ 283);\n for (\n var SBOX = [],\n INV_SBOX = [],\n SUB_MIX = [[], [], [], []],\n INV_SUB_MIX = [[], [], [], []],\n x = 0,\n xi = 0,\n i = 0;\n i < 256;\n ++i\n ) {\n var sx = xi ^ (xi << 1) ^ (xi << 2) ^ (xi << 3) ^ (xi << 4);\n (sx = (sx >>> 8) ^ (sx & 255) ^ 99), (SBOX[x] = sx), (INV_SBOX[sx] = x);\n var x2 = d[x],\n x4 = d[x2],\n x8 = d[x4],\n t = (d[sx] * 257) ^ (sx * 16843008);\n (SUB_MIX[0][x] = (t << 24) | (t >>> 8)),\n (SUB_MIX[1][x] = (t << 16) | (t >>> 16)),\n (SUB_MIX[2][x] = (t << 8) | (t >>> 24)),\n (SUB_MIX[3][x] = t),\n (t = (x8 * 16843009) ^ (x4 * 65537) ^ (x2 * 257) ^ (x * 16843008)),\n (INV_SUB_MIX[0][sx] = (t << 24) | (t >>> 8)),\n (INV_SUB_MIX[1][sx] = (t << 16) | (t >>> 16)),\n (INV_SUB_MIX[2][sx] = (t << 8) | (t >>> 24)),\n (INV_SUB_MIX[3][sx] = t),\n x === 0 ? (x = xi = 1) : ((x = x2 ^ d[d[d[x8 ^ x2]]]), (xi ^= d[d[xi]]));\n }\n return {\n SBOX,\n INV_SBOX,\n SUB_MIX,\n INV_SUB_MIX,\n };\n })();\n function AES(key) {\n (this._key = asUInt32Array(key)), this._reset();\n }\n AES.blockSize = 4 * 4;\n AES.keySize = 256 / 8;\n AES.prototype.blockSize = AES.blockSize;\n AES.prototype.keySize = AES.keySize;\n AES.prototype._reset = function () {\n for (\n var keyWords = this._key,\n keySize = keyWords.length,\n nRounds = keySize + 6,\n ksRows = (nRounds + 1) * 4,\n keySchedule = [],\n k = 0;\n k < keySize;\n k++\n )\n keySchedule[k] = keyWords[k];\n for (k = keySize; k < ksRows; k++) {\n var t = keySchedule[k - 1];\n k % keySize === 0\n ? ((t = (t << 8) | (t >>> 24)),\n (t =\n (G.SBOX[t >>> 24] << 24) |\n (G.SBOX[(t >>> 16) & 255] << 16) |\n (G.SBOX[(t >>> 8) & 255] << 8) |\n G.SBOX[t & 255]),\n (t ^= RCON[(k / keySize) | 0] << 24))\n : keySize > 6 &&\n k % keySize === 4 &&\n (t =\n (G.SBOX[t >>> 24] << 24) |\n (G.SBOX[(t >>> 16) & 255] << 16) |\n (G.SBOX[(t >>> 8) & 255] << 8) |\n G.SBOX[t & 255]),\n (keySchedule[k] = keySchedule[k - keySize] ^ t);\n }\n for (var invKeySchedule = [], ik = 0; ik < ksRows; ik++) {\n var ksR = ksRows - ik,\n tt = keySchedule[ksR - (ik % 4 ? 0 : 4)];\n ik < 4 || ksR <= 4\n ? (invKeySchedule[ik] = tt)\n : (invKeySchedule[ik] =\n G.INV_SUB_MIX[0][G.SBOX[tt >>> 24]] ^\n G.INV_SUB_MIX[1][G.SBOX[(tt >>> 16) & 255]] ^\n G.INV_SUB_MIX[2][G.SBOX[(tt >>> 8) & 255]] ^\n G.INV_SUB_MIX[3][G.SBOX[tt & 255]]);\n }\n (this._nRounds = nRounds), (this._keySchedule = keySchedule), (this._invKeySchedule = invKeySchedule);\n };\n AES.prototype.encryptBlockRaw = function (M) {\n return (M = asUInt32Array(M)), cryptBlock(M, this._keySchedule, G.SUB_MIX, G.SBOX, this._nRounds);\n };\n AES.prototype.encryptBlock = function (M) {\n var out = this.encryptBlockRaw(M),\n buf = Buffer2.allocUnsafe(16);\n return (\n buf.writeUInt32BE(out[0], 0),\n buf.writeUInt32BE(out[1], 4),\n buf.writeUInt32BE(out[2], 8),\n buf.writeUInt32BE(out[3], 12),\n buf\n );\n };\n AES.prototype.decryptBlock = function (M) {\n M = asUInt32Array(M);\n var m1 = M[1];\n (M[1] = M[3]), (M[3] = m1);\n var out = cryptBlock(M, this._invKeySchedule, G.INV_SUB_MIX, G.INV_SBOX, this._nRounds),\n buf = Buffer2.allocUnsafe(16);\n return (\n buf.writeUInt32BE(out[0], 0),\n buf.writeUInt32BE(out[3], 4),\n buf.writeUInt32BE(out[2], 8),\n buf.writeUInt32BE(out[1], 12),\n buf\n );\n };\n AES.prototype.scrub = function () {\n scrubVec(this._keySchedule), scrubVec(this._invKeySchedule), scrubVec(this._key);\n };\n module.exports.AES = AES;\n },\n});\n\n// node_modules/browserify-aes/ghash.js\nvar require_ghash = __commonJS({\n \"node_modules/browserify-aes/ghash.js\"(exports, module) {\n var Buffer2 = require_safe_buffer().Buffer,\n ZEROES = Buffer2.alloc(16, 0);\n function toArray(buf) {\n return [buf.readUInt32BE(0), buf.readUInt32BE(4), buf.readUInt32BE(8), buf.readUInt32BE(12)];\n }\n function fromArray(out) {\n var buf = Buffer2.allocUnsafe(16);\n return (\n buf.writeUInt32BE(out[0] >>> 0, 0),\n buf.writeUInt32BE(out[1] >>> 0, 4),\n buf.writeUInt32BE(out[2] >>> 0, 8),\n buf.writeUInt32BE(out[3] >>> 0, 12),\n buf\n );\n }\n function GHASH(key) {\n (this.h = key), (this.state = Buffer2.alloc(16, 0)), (this.cache = Buffer2.allocUnsafe(0));\n }\n GHASH.prototype.ghash = function (block) {\n for (var i = -1; ++i < block.length; ) this.state[i] ^= block[i];\n this._multiply();\n };\n GHASH.prototype._multiply = function () {\n for (var Vi = toArray(this.h), Zi = [0, 0, 0, 0], j, xi, lsbVi, i = -1; ++i < 128; ) {\n for (\n xi = (this.state[~~(i / 8)] & (1 << (7 - (i % 8)))) !== 0,\n xi && ((Zi[0] ^= Vi[0]), (Zi[1] ^= Vi[1]), (Zi[2] ^= Vi[2]), (Zi[3] ^= Vi[3])),\n lsbVi = (Vi[3] & 1) !== 0,\n j = 3;\n j > 0;\n j--\n )\n Vi[j] = (Vi[j] >>> 1) | ((Vi[j - 1] & 1) << 31);\n (Vi[0] = Vi[0] >>> 1), lsbVi && (Vi[0] = Vi[0] ^ (225 << 24));\n }\n this.state = fromArray(Zi);\n };\n GHASH.prototype.update = function (buf) {\n this.cache = Buffer2.concat([this.cache, buf]);\n for (var chunk; this.cache.length >= 16; )\n (chunk = this.cache.slice(0, 16)), (this.cache = this.cache.slice(16)), this.ghash(chunk);\n };\n GHASH.prototype.final = function (abl, bl) {\n return (\n this.cache.length && this.ghash(Buffer2.concat([this.cache, ZEROES], 16)),\n this.ghash(fromArray([0, abl, 0, bl])),\n this.state\n );\n };\n module.exports = GHASH;\n },\n});\n\n// node_modules/browserify-aes/authCipher.js\nvar require_authCipher = __commonJS({\n \"node_modules/browserify-aes/authCipher.js\"(exports, module) {\n var aes = require_aes(),\n Buffer2 = require_safe_buffer().Buffer,\n Transform = require_cipher_base(),\n inherits = require_inherits_browser(),\n GHASH = require_ghash(),\n xor = require_buffer_xor(),\n incr32 = require_incr32();\n function xorTest(a, b) {\n var out = 0;\n a.length !== b.length && out++;\n for (var len = Math.min(a.length, b.length), i = 0; i < len; ++i) out += a[i] ^ b[i];\n return out;\n }\n function calcIv(self2, iv, ck) {\n if (iv.length === 12)\n return (\n (self2._finID = Buffer2.concat([iv, Buffer2.from([0, 0, 0, 1])])),\n Buffer2.concat([iv, Buffer2.from([0, 0, 0, 2])])\n );\n var ghash = new GHASH(ck),\n len = iv.length,\n toPad = len % 16;\n ghash.update(iv),\n toPad && ((toPad = 16 - toPad), ghash.update(Buffer2.alloc(toPad, 0))),\n ghash.update(Buffer2.alloc(8, 0));\n var ivBits = len * 8,\n tail = Buffer2.alloc(8);\n tail.writeUIntBE(ivBits, 0, 8), ghash.update(tail), (self2._finID = ghash.state);\n var out = Buffer2.from(self2._finID);\n return incr32(out), out;\n }\n function StreamCipher(mode, key, iv, decrypt) {\n Transform.call(this);\n var h = Buffer2.alloc(4, 0);\n this._cipher = new aes.AES(key);\n var ck = this._cipher.encryptBlock(h);\n (this._ghash = new GHASH(ck)),\n (iv = calcIv(this, iv, ck)),\n (this._prev = Buffer2.from(iv)),\n (this._cache = Buffer2.allocUnsafe(0)),\n (this._secCache = Buffer2.allocUnsafe(0)),\n (this._decrypt = decrypt),\n (this._alen = 0),\n (this._len = 0),\n (this._mode = mode),\n (this._authTag = null),\n (this._called = !1);\n }\n inherits(StreamCipher, Transform);\n StreamCipher.prototype._update = function (chunk) {\n if (!this._called && this._alen) {\n var rump = 16 - (this._alen % 16);\n rump < 16 && ((rump = Buffer2.alloc(rump, 0)), this._ghash.update(rump));\n }\n this._called = !0;\n var out = this._mode.encrypt(this, chunk);\n return this._decrypt ? this._ghash.update(chunk) : this._ghash.update(out), (this._len += chunk.length), out;\n };\n StreamCipher.prototype._final = function () {\n if (this._decrypt && !this._authTag) throw new Error(\"Unsupported state or unable to authenticate data\");\n var tag = xor(this._ghash.final(this._alen * 8, this._len * 8), this._cipher.encryptBlock(this._finID));\n if (this._decrypt && xorTest(tag, this._authTag))\n throw new Error(\"Unsupported state or unable to authenticate data\");\n (this._authTag = tag), this._cipher.scrub();\n };\n StreamCipher.prototype.getAuthTag = function () {\n if (this._decrypt || !Buffer2.isBuffer(this._authTag))\n throw new Error(\"Attempting to get auth tag in unsupported state\");\n return this._authTag;\n };\n StreamCipher.prototype.setAuthTag = function (tag) {\n if (!this._decrypt) throw new Error(\"Attempting to set auth tag in unsupported state\");\n this._authTag = tag;\n };\n StreamCipher.prototype.setAAD = function (buf) {\n if (this._called) throw new Error(\"Attempting to set AAD in unsupported state\");\n this._ghash.update(buf), (this._alen += buf.length);\n };\n module.exports = StreamCipher;\n },\n});\n\n// node_modules/browserify-aes/streamCipher.js\nvar require_streamCipher = __commonJS({\n \"node_modules/browserify-aes/streamCipher.js\"(exports, module) {\n var aes = require_aes(),\n Buffer2 = require_safe_buffer().Buffer,\n Transform = require_cipher_base(),\n inherits = require_inherits_browser();\n function StreamCipher(mode, key, iv, decrypt) {\n Transform.call(this),\n (this._cipher = new aes.AES(key)),\n (this._prev = Buffer2.from(iv)),\n (this._cache = Buffer2.allocUnsafe(0)),\n (this._secCache = Buffer2.allocUnsafe(0)),\n (this._decrypt = decrypt),\n (this._mode = mode);\n }\n inherits(StreamCipher, Transform);\n StreamCipher.prototype._update = function (chunk) {\n return this._mode.encrypt(this, chunk, this._decrypt);\n };\n StreamCipher.prototype._final = function () {\n this._cipher.scrub();\n };\n module.exports = StreamCipher;\n },\n});\n\n// node_modules/evp_bytestokey/index.js\nvar require_evp_bytestokey = __commonJS({\n \"node_modules/evp_bytestokey/index.js\"(exports, module) {\n var Buffer2 = require_safe_buffer().Buffer,\n MD5 = require_md5();\n function EVP_BytesToKey(password, salt, keyBits, ivLen) {\n if (\n (Buffer2.isBuffer(password) || (password = Buffer2.from(password, \"binary\")),\n salt && (Buffer2.isBuffer(salt) || (salt = Buffer2.from(salt, \"binary\")), salt.length !== 8))\n )\n throw new RangeError(\"salt should be Buffer with 8 byte length\");\n for (\n var keyLen = keyBits / 8, key = Buffer2.alloc(keyLen), iv = Buffer2.alloc(ivLen || 0), tmp = Buffer2.alloc(0);\n keyLen > 0 || ivLen > 0;\n\n ) {\n var hash = new MD5();\n hash.update(tmp), hash.update(password), salt && hash.update(salt), (tmp = hash.digest());\n var used = 0;\n if (keyLen > 0) {\n var keyStart = key.length - keyLen;\n (used = Math.min(keyLen, tmp.length)), tmp.copy(key, keyStart, 0, used), (keyLen -= used);\n }\n if (used < tmp.length && ivLen > 0) {\n var ivStart = iv.length - ivLen,\n length = Math.min(ivLen, tmp.length - used);\n tmp.copy(iv, ivStart, used, used + length), (ivLen -= length);\n }\n }\n return tmp.fill(0), { key, iv };\n }\n module.exports = EVP_BytesToKey;\n },\n});\n\n// node_modules/browserify-aes/encrypter.js\nvar require_encrypter = __commonJS({\n \"node_modules/browserify-aes/encrypter.js\"(exports) {\n var MODES = require_modes(),\n AuthCipher = require_authCipher(),\n Buffer2 = require_safe_buffer().Buffer,\n StreamCipher = require_streamCipher(),\n Transform = require_cipher_base(),\n aes = require_aes(),\n ebtk = require_evp_bytestokey(),\n inherits = require_inherits_browser();\n function Cipher(mode, key, iv) {\n Transform.call(this),\n (this._cache = new Splitter()),\n (this._cipher = new aes.AES(key)),\n (this._prev = Buffer2.from(iv)),\n (this._mode = mode),\n (this._autopadding = !0);\n }\n inherits(Cipher, Transform);\n Cipher.prototype._update = function (data) {\n this._cache.add(data);\n for (var chunk, thing, out = []; (chunk = this._cache.get()); )\n (thing = this._mode.encrypt(this, chunk)), out.push(thing);\n return Buffer2.concat(out);\n };\n var PADDING = Buffer2.alloc(16, 16);\n Cipher.prototype._final = function () {\n var chunk = this._cache.flush();\n if (this._autopadding) return (chunk = this._mode.encrypt(this, chunk)), this._cipher.scrub(), chunk;\n if (!chunk.equals(PADDING)) throw (this._cipher.scrub(), new Error(\"data not multiple of block length\"));\n };\n Cipher.prototype.setAutoPadding = function (setTo) {\n return (this._autopadding = !!setTo), this;\n };\n function Splitter() {\n this.cache = Buffer2.allocUnsafe(0);\n }\n Splitter.prototype.add = function (data) {\n this.cache = Buffer2.concat([this.cache, data]);\n };\n Splitter.prototype.get = function () {\n if (this.cache.length > 15) {\n var out = this.cache.slice(0, 16);\n return (this.cache = this.cache.slice(16)), out;\n }\n return null;\n };\n Splitter.prototype.flush = function () {\n for (var len = 16 - this.cache.length, padBuff = Buffer2.allocUnsafe(len), i = -1; ++i < len; )\n padBuff.writeUInt8(len, i);\n return Buffer2.concat([this.cache, padBuff]);\n };\n function createCipheriv(suite, password, iv) {\n var config = MODES[suite.toLowerCase()];\n if (!config) throw new TypeError(\"invalid suite type\");\n if ((typeof password == \"string\" && (password = Buffer2.from(password)), password.length !== config.key / 8))\n throw new TypeError(\"invalid key length \" + password.length);\n if ((typeof iv == \"string\" && (iv = Buffer2.from(iv)), config.mode !== \"GCM\" && iv.length !== config.iv))\n throw new TypeError(\"invalid iv length \" + iv.length);\n return config.type === \"stream\"\n ? new StreamCipher(config.module, password, iv)\n : config.type === \"auth\"\n ? new AuthCipher(config.module, password, iv)\n : new Cipher(config.module, password, iv);\n }\n function createCipher(suite, password) {\n var config = MODES[suite.toLowerCase()];\n if (!config) throw new TypeError(\"invalid suite type\");\n var keys = ebtk(password, !1, config.key, config.iv);\n return createCipheriv(suite, keys.key, keys.iv);\n }\n exports.createCipheriv = createCipheriv;\n exports.createCipher = createCipher;\n },\n});\n\n// node_modules/browserify-aes/decrypter.js\nvar require_decrypter = __commonJS({\n \"node_modules/browserify-aes/decrypter.js\"(exports) {\n var AuthCipher = require_authCipher(),\n Buffer2 = require_safe_buffer().Buffer,\n MODES = require_modes(),\n StreamCipher = require_streamCipher(),\n Transform = require_cipher_base(),\n aes = require_aes(),\n ebtk = require_evp_bytestokey(),\n inherits = require_inherits_browser();\n function Decipher(mode, key, iv) {\n Transform.call(this),\n (this._cache = new Splitter()),\n (this._last = void 0),\n (this._cipher = new aes.AES(key)),\n (this._prev = Buffer2.from(iv)),\n (this._mode = mode),\n (this._autopadding = !0);\n }\n inherits(Decipher, Transform);\n Decipher.prototype._update = function (data) {\n this._cache.add(data);\n for (var chunk, thing, out = []; (chunk = this._cache.get(this._autopadding)); )\n (thing = this._mode.decrypt(this, chunk)), out.push(thing);\n return Buffer2.concat(out);\n };\n Decipher.prototype._final = function () {\n var chunk = this._cache.flush();\n if (this._autopadding) return unpad(this._mode.decrypt(this, chunk));\n if (chunk) throw new Error(\"data not multiple of block length\");\n };\n Decipher.prototype.setAutoPadding = function (setTo) {\n return (this._autopadding = !!setTo), this;\n };\n function Splitter() {\n this.cache = Buffer2.allocUnsafe(0);\n }\n Splitter.prototype.add = function (data) {\n this.cache = Buffer2.concat([this.cache, data]);\n };\n Splitter.prototype.get = function (autoPadding) {\n var out;\n if (autoPadding) {\n if (this.cache.length > 16) return (out = this.cache.slice(0, 16)), (this.cache = this.cache.slice(16)), out;\n } else if (this.cache.length >= 16)\n return (out = this.cache.slice(0, 16)), (this.cache = this.cache.slice(16)), out;\n return null;\n };\n Splitter.prototype.flush = function () {\n if (this.cache.length) return this.cache;\n };\n function unpad(last) {\n var padded = last[15];\n if (padded < 1 || padded > 16) throw new Error(\"unable to decrypt data\");\n for (var i = -1; ++i < padded; )\n if (last[i + (16 - padded)] !== padded) throw new Error(\"unable to decrypt data\");\n if (padded !== 16) return last.slice(0, 16 - padded);\n }\n function createDecipheriv(suite, password, iv) {\n var config = MODES[suite.toLowerCase()];\n if (!config) throw new TypeError(\"invalid suite type\");\n if ((typeof iv == \"string\" && (iv = Buffer2.from(iv)), config.mode !== \"GCM\" && iv.length !== config.iv))\n throw new TypeError(\"invalid iv length \" + iv.length);\n if ((typeof password == \"string\" && (password = Buffer2.from(password)), password.length !== config.key / 8))\n throw new TypeError(\"invalid key length \" + password.length);\n return config.type === \"stream\"\n ? new StreamCipher(config.module, password, iv, !0)\n : config.type === \"auth\"\n ? new AuthCipher(config.module, password, iv, !0)\n : new Decipher(config.module, password, iv);\n }\n function createDecipher(suite, password) {\n var config = MODES[suite.toLowerCase()];\n if (!config) throw new TypeError(\"invalid suite type\");\n var keys = ebtk(password, !1, config.key, config.iv);\n return createDecipheriv(suite, keys.key, keys.iv);\n }\n exports.createDecipher = createDecipher;\n exports.createDecipheriv = createDecipheriv;\n },\n});\n\n// node_modules/browserify-aes/browser.js\nvar require_browser5 = __commonJS({\n \"node_modules/browserify-aes/browser.js\"(exports) {\n var ciphers = require_encrypter(),\n deciphers = require_decrypter(),\n modes = require_list();\n function getCiphers() {\n return Object.keys(modes);\n }\n exports.createCipher = exports.Cipher = ciphers.createCipher;\n exports.createCipheriv = exports.Cipheriv = ciphers.createCipheriv;\n exports.createDecipher = exports.Decipher = deciphers.createDecipher;\n exports.createDecipheriv = exports.Decipheriv = deciphers.createDecipheriv;\n exports.listCiphers = exports.getCiphers = getCiphers;\n },\n});\n\n// node_modules/browserify-des/modes.js\nvar require_modes2 = __commonJS({\n \"node_modules/browserify-des/modes.js\"(exports) {\n exports[\"des-ecb\"] = {\n key: 8,\n iv: 0,\n };\n exports[\"des-cbc\"] = exports.des = {\n key: 8,\n iv: 8,\n };\n exports[\"des-ede3-cbc\"] = exports.des3 = {\n key: 24,\n iv: 8,\n };\n exports[\"des-ede3\"] = {\n key: 24,\n iv: 0,\n };\n exports[\"des-ede-cbc\"] = {\n key: 16,\n iv: 8,\n };\n exports[\"des-ede\"] = {\n key: 16,\n iv: 0,\n };\n },\n});\n\n// node_modules/browserify-cipher/browser.js\nvar require_browser6 = __commonJS({\n \"node_modules/browserify-cipher/browser.js\"(exports) {\n var DES = require_browserify_des(),\n aes = require_browser5(),\n aesModes = require_modes(),\n desModes = require_modes2(),\n ebtk = require_evp_bytestokey();\n function createCipher(suite, password) {\n suite = suite.toLowerCase();\n var keyLen, ivLen;\n if (aesModes[suite]) (keyLen = aesModes[suite].key), (ivLen = aesModes[suite].iv);\n else if (desModes[suite]) (keyLen = desModes[suite].key * 8), (ivLen = desModes[suite].iv);\n else throw new TypeError(\"invalid suite type\");\n var keys = ebtk(password, !1, keyLen, ivLen);\n return createCipheriv(suite, keys.key, keys.iv);\n }\n function createDecipher(suite, password) {\n suite = suite.toLowerCase();\n var keyLen, ivLen;\n if (aesModes[suite]) (keyLen = aesModes[suite].key), (ivLen = aesModes[suite].iv);\n else if (desModes[suite]) (keyLen = desModes[suite].key * 8), (ivLen = desModes[suite].iv);\n else throw new TypeError(\"invalid suite type\");\n var keys = ebtk(password, !1, keyLen, ivLen);\n return createDecipheriv(suite, keys.key, keys.iv);\n }\n function createCipheriv(suite, key, iv) {\n if (((suite = suite.toLowerCase()), aesModes[suite])) return aes.createCipheriv(suite, key, iv);\n if (desModes[suite]) return new DES({ key, iv, mode: suite });\n throw new TypeError(\"invalid suite type\");\n }\n function createDecipheriv(suite, key, iv) {\n if (((suite = suite.toLowerCase()), aesModes[suite])) return aes.createDecipheriv(suite, key, iv);\n if (desModes[suite]) return new DES({ key, iv, mode: suite, decrypt: !0 });\n throw new TypeError(\"invalid suite type\");\n }\n function getCiphers() {\n return Object.keys(desModes).concat(aes.getCiphers());\n }\n exports.createCipher = exports.Cipher = createCipher;\n exports.createCipheriv = exports.Cipheriv = createCipheriv;\n exports.createDecipher = exports.Decipher = createDecipher;\n exports.createDecipheriv = exports.Decipheriv = createDecipheriv;\n exports.listCiphers = exports.getCiphers = getCiphers;\n },\n});\n\n// node_modules/diffie-hellman/node_modules/bn.js/lib/bn.js\nvar require_bn = __commonJS({\n \"node_modules/diffie-hellman/node_modules/bn.js/lib/bn.js\"(exports, module) {\n (function (module2, exports2) {\n \"use strict\";\n function assert(val, msg) {\n if (!val) throw new Error(msg || \"Assertion failed\");\n }\n function inherits(ctor, superCtor) {\n ctor.super_ = superCtor;\n var TempCtor = function () {};\n (TempCtor.prototype = superCtor.prototype),\n (ctor.prototype = new TempCtor()),\n (ctor.prototype.constructor = ctor);\n }\n function BN(number, base, endian) {\n if (BN.isBN(number)) return number;\n (this.negative = 0),\n (this.words = null),\n (this.length = 0),\n (this.red = null),\n number !== null &&\n ((base === \"le\" || base === \"be\") && ((endian = base), (base = 10)),\n this._init(number || 0, base || 10, endian || \"be\"));\n }\n typeof module2 == \"object\" ? (module2.exports = BN) : (exports2.BN = BN), (BN.BN = BN), (BN.wordSize = 26);\n var Buffer2;\n try {\n typeof window < \"u\" && typeof window.Buffer < \"u\"\n ? (Buffer2 = window.Buffer)\n : (Buffer2 = __require(\"buffer\").Buffer);\n } catch {}\n (BN.isBN = function (num) {\n return num instanceof BN\n ? !0\n : num !== null &&\n typeof num == \"object\" &&\n num.constructor.wordSize === BN.wordSize &&\n Array.isArray(num.words);\n }),\n (BN.max = function (left, right) {\n return left.cmp(right) > 0 ? left : right;\n }),\n (BN.min = function (left, right) {\n return left.cmp(right) < 0 ? left : right;\n }),\n (BN.prototype._init = function (number, base, endian) {\n if (typeof number == \"number\") return this._initNumber(number, base, endian);\n if (typeof number == \"object\") return this._initArray(number, base, endian);\n base === \"hex\" && (base = 16),\n assert(base === (base | 0) && base >= 2 && base <= 36),\n (number = number.toString().replace(/\\s+/g, \"\"));\n var start = 0;\n number[0] === \"-\" && (start++, (this.negative = 1)),\n start < number.length &&\n (base === 16\n ? this._parseHex(number, start, endian)\n : (this._parseBase(number, base, start),\n endian === \"le\" && this._initArray(this.toArray(), base, endian)));\n }),\n (BN.prototype._initNumber = function (number, base, endian) {\n number < 0 && ((this.negative = 1), (number = -number)),\n number < 67108864\n ? ((this.words = [number & 67108863]), (this.length = 1))\n : number < 4503599627370496\n ? ((this.words = [number & 67108863, (number / 67108864) & 67108863]), (this.length = 2))\n : (assert(number < 9007199254740992),\n (this.words = [number & 67108863, (number / 67108864) & 67108863, 1]),\n (this.length = 3)),\n endian === \"le\" && this._initArray(this.toArray(), base, endian);\n }),\n (BN.prototype._initArray = function (number, base, endian) {\n if ((assert(typeof number.length == \"number\"), number.length <= 0))\n return (this.words = [0]), (this.length = 1), this;\n (this.length = Math.ceil(number.length / 3)), (this.words = new Array(this.length));\n for (var i = 0; i < this.length; i++) this.words[i] = 0;\n var j,\n w,\n off = 0;\n if (endian === \"be\")\n for (i = number.length - 1, j = 0; i >= 0; i -= 3)\n (w = number[i] | (number[i - 1] << 8) | (number[i - 2] << 16)),\n (this.words[j] |= (w << off) & 67108863),\n (this.words[j + 1] = (w >>> (26 - off)) & 67108863),\n (off += 24),\n off >= 26 && ((off -= 26), j++);\n else if (endian === \"le\")\n for (i = 0, j = 0; i < number.length; i += 3)\n (w = number[i] | (number[i + 1] << 8) | (number[i + 2] << 16)),\n (this.words[j] |= (w << off) & 67108863),\n (this.words[j + 1] = (w >>> (26 - off)) & 67108863),\n (off += 24),\n off >= 26 && ((off -= 26), j++);\n return this.strip();\n });\n function parseHex4Bits(string, index) {\n var c = string.charCodeAt(index);\n return c >= 65 && c <= 70 ? c - 55 : c >= 97 && c <= 102 ? c - 87 : (c - 48) & 15;\n }\n function parseHexByte(string, lowerBound, index) {\n var r = parseHex4Bits(string, index);\n return index - 1 >= lowerBound && (r |= parseHex4Bits(string, index - 1) << 4), r;\n }\n BN.prototype._parseHex = function (number, start, endian) {\n (this.length = Math.ceil((number.length - start) / 6)), (this.words = new Array(this.length));\n for (var i = 0; i < this.length; i++) this.words[i] = 0;\n var off = 0,\n j = 0,\n w;\n if (endian === \"be\")\n for (i = number.length - 1; i >= start; i -= 2)\n (w = parseHexByte(number, start, i) << off),\n (this.words[j] |= w & 67108863),\n off >= 18 ? ((off -= 18), (j += 1), (this.words[j] |= w >>> 26)) : (off += 8);\n else {\n var parseLength = number.length - start;\n for (i = parseLength % 2 === 0 ? start + 1 : start; i < number.length; i += 2)\n (w = parseHexByte(number, start, i) << off),\n (this.words[j] |= w & 67108863),\n off >= 18 ? ((off -= 18), (j += 1), (this.words[j] |= w >>> 26)) : (off += 8);\n }\n this.strip();\n };\n function parseBase(str, start, end, mul) {\n for (var r = 0, len = Math.min(str.length, end), i = start; i < len; i++) {\n var c = str.charCodeAt(i) - 48;\n (r *= mul), c >= 49 ? (r += c - 49 + 10) : c >= 17 ? (r += c - 17 + 10) : (r += c);\n }\n return r;\n }\n (BN.prototype._parseBase = function (number, base, start) {\n (this.words = [0]), (this.length = 1);\n for (var limbLen = 0, limbPow = 1; limbPow <= 67108863; limbPow *= base) limbLen++;\n limbLen--, (limbPow = (limbPow / base) | 0);\n for (\n var total = number.length - start,\n mod = total % limbLen,\n end = Math.min(total, total - mod) + start,\n word = 0,\n i = start;\n i < end;\n i += limbLen\n )\n (word = parseBase(number, i, i + limbLen, base)),\n this.imuln(limbPow),\n this.words[0] + word < 67108864 ? (this.words[0] += word) : this._iaddn(word);\n if (mod !== 0) {\n var pow = 1;\n for (word = parseBase(number, i, number.length, base), i = 0; i < mod; i++) pow *= base;\n this.imuln(pow), this.words[0] + word < 67108864 ? (this.words[0] += word) : this._iaddn(word);\n }\n this.strip();\n }),\n (BN.prototype.copy = function (dest) {\n dest.words = new Array(this.length);\n for (var i = 0; i < this.length; i++) dest.words[i] = this.words[i];\n (dest.length = this.length), (dest.negative = this.negative), (dest.red = this.red);\n }),\n (BN.prototype.clone = function () {\n var r = new BN(null);\n return this.copy(r), r;\n }),\n (BN.prototype._expand = function (size) {\n for (; this.length < size; ) this.words[this.length++] = 0;\n return this;\n }),\n (BN.prototype.strip = function () {\n for (; this.length > 1 && this.words[this.length - 1] === 0; ) this.length--;\n return this._normSign();\n }),\n (BN.prototype._normSign = function () {\n return this.length === 1 && this.words[0] === 0 && (this.negative = 0), this;\n }),\n (BN.prototype.inspect = function () {\n return (this.red ? \"<BN-R: \" : \"<BN: \") + this.toString(16) + \">\";\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 groupSizes = [\n 0, 0, 25, 16, 12, 11, 10, 9, 8, 8, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5,\n 5, 5,\n ],\n groupBases = [\n 0, 0, 33554432, 43046721, 16777216, 48828125, 60466176, 40353607, 16777216, 43046721, 1e7, 19487171, 35831808,\n 62748517, 7529536, 11390625, 16777216, 24137569, 34012224, 47045881, 64e6, 4084101, 5153632, 6436343, 7962624,\n 9765625, 11881376, 14348907, 17210368, 20511149, 243e5, 28629151, 33554432, 39135393, 45435424, 52521875,\n 60466176,\n ];\n (BN.prototype.toString = function (base, padding) {\n (base = base || 10), (padding = padding | 0 || 1);\n var out;\n if (base === 16 || base === \"hex\") {\n out = \"\";\n for (var off = 0, carry = 0, i = 0; i < this.length; i++) {\n var w = this.words[i],\n word = (((w << off) | carry) & 16777215).toString(16);\n (carry = (w >>> (24 - off)) & 16777215),\n carry !== 0 || i !== this.length - 1 ? (out = zeros[6 - word.length] + word + out) : (out = word + out),\n (off += 2),\n off >= 26 && ((off -= 26), i--);\n }\n for (carry !== 0 && (out = carry.toString(16) + out); out.length % padding !== 0; ) out = \"0\" + out;\n return this.negative !== 0 && (out = \"-\" + out), out;\n }\n if (base === (base | 0) && base >= 2 && base <= 36) {\n var groupSize = groupSizes[base],\n groupBase = groupBases[base];\n out = \"\";\n var c = this.clone();\n for (c.negative = 0; !c.isZero(); ) {\n var r = c.modn(groupBase).toString(base);\n (c = c.idivn(groupBase)), c.isZero() ? (out = r + out) : (out = zeros[groupSize - r.length] + r + out);\n }\n for (this.isZero() && (out = \"0\" + out); out.length % padding !== 0; ) out = \"0\" + out;\n return this.negative !== 0 && (out = \"-\" + out), out;\n }\n assert(!1, \"Base should be between 2 and 36\");\n }),\n (BN.prototype.toNumber = function () {\n var ret = this.words[0];\n return (\n this.length === 2\n ? (ret += this.words[1] * 67108864)\n : this.length === 3 && this.words[2] === 1\n ? (ret += 4503599627370496 + this.words[1] * 67108864)\n : this.length > 2 && assert(!1, \"Number can only safely store up to 53 bits\"),\n this.negative !== 0 ? -ret : ret\n );\n }),\n (BN.prototype.toJSON = function () {\n return this.toString(16);\n }),\n (BN.prototype.toBuffer = function (endian, length) {\n return assert(typeof Buffer2 < \"u\"), this.toArrayLike(Buffer2, endian, length);\n }),\n (BN.prototype.toArray = function (endian, length) {\n return this.toArrayLike(Array, endian, length);\n }),\n (BN.prototype.toArrayLike = function (ArrayType, endian, length) {\n var byteLength = this.byteLength(),\n 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 this.strip();\n var littleEndian = endian === \"le\",\n res = new ArrayType(reqLength),\n b,\n i,\n q = this.clone();\n if (littleEndian) {\n for (i = 0; !q.isZero(); i++) (b = q.andln(255)), q.iushrn(8), (res[i] = b);\n for (; i < reqLength; i++) res[i] = 0;\n } else {\n for (i = 0; i < reqLength - byteLength; i++) res[i] = 0;\n for (i = 0; !q.isZero(); i++) (b = q.andln(255)), q.iushrn(8), (res[reqLength - i - 1] = b);\n }\n return res;\n }),\n Math.clz32\n ? (BN.prototype._countBits = function (w) {\n return 32 - Math.clz32(w);\n })\n : (BN.prototype._countBits = function (w) {\n var t = w,\n r = 0;\n return (\n t >= 4096 && ((r += 13), (t >>>= 13)),\n t >= 64 && ((r += 7), (t >>>= 7)),\n t >= 8 && ((r += 4), (t >>>= 4)),\n t >= 2 && ((r += 2), (t >>>= 2)),\n r + t\n );\n }),\n (BN.prototype._zeroBits = function (w) {\n if (w === 0) return 26;\n var t = w,\n r = 0;\n return (\n (t & 8191) === 0 && ((r += 13), (t >>>= 13)),\n (t & 127) === 0 && ((r += 7), (t >>>= 7)),\n (t & 15) === 0 && ((r += 4), (t >>>= 4)),\n (t & 3) === 0 && ((r += 2), (t >>>= 2)),\n (t & 1) === 0 && r++,\n r\n );\n }),\n (BN.prototype.bitLength = function () {\n var w = this.words[this.length - 1],\n hi = this._countBits(w);\n return (this.length - 1) * 26 + hi;\n });\n function toBitArray(num) {\n for (var w = new Array(num.bitLength()), bit = 0; bit < w.length; bit++) {\n var off = (bit / 26) | 0,\n wbit = bit % 26;\n w[bit] = (num.words[off] & (1 << wbit)) >>> wbit;\n }\n return w;\n }\n (BN.prototype.zeroBits = function () {\n if (this.isZero()) return 0;\n for (var r = 0, i = 0; i < this.length; i++) {\n var b = this._zeroBits(this.words[i]);\n if (((r += b), b !== 26)) break;\n }\n return r;\n }),\n (BN.prototype.byteLength = function () {\n return Math.ceil(this.bitLength() / 8);\n }),\n (BN.prototype.toTwos = function (width) {\n return this.negative !== 0 ? this.abs().inotn(width).iaddn(1) : this.clone();\n }),\n (BN.prototype.fromTwos = function (width) {\n return this.testn(width - 1) ? this.notn(width).iaddn(1).ineg() : this.clone();\n }),\n (BN.prototype.isNeg = function () {\n return this.negative !== 0;\n }),\n (BN.prototype.neg = function () {\n return this.clone().ineg();\n }),\n (BN.prototype.ineg = function () {\n return this.isZero() || (this.negative ^= 1), this;\n }),\n (BN.prototype.iuor = function (num) {\n for (; this.length < num.length; ) this.words[this.length++] = 0;\n for (var i = 0; i < num.length; i++) this.words[i] = this.words[i] | num.words[i];\n return this.strip();\n }),\n (BN.prototype.ior = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuor(num);\n }),\n (BN.prototype.or = function (num) {\n return this.length > num.length ? this.clone().ior(num) : num.clone().ior(this);\n }),\n (BN.prototype.uor = function (num) {\n return this.length > num.length ? this.clone().iuor(num) : num.clone().iuor(this);\n }),\n (BN.prototype.iuand = function (num) {\n var b;\n this.length > num.length ? (b = num) : (b = this);\n for (var i = 0; i < b.length; i++) this.words[i] = this.words[i] & num.words[i];\n return (this.length = b.length), this.strip();\n }),\n (BN.prototype.iand = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuand(num);\n }),\n (BN.prototype.and = function (num) {\n return this.length > num.length ? this.clone().iand(num) : num.clone().iand(this);\n }),\n (BN.prototype.uand = function (num) {\n return this.length > num.length ? this.clone().iuand(num) : num.clone().iuand(this);\n }),\n (BN.prototype.iuxor = function (num) {\n var a, b;\n this.length > num.length ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var i = 0; i < b.length; i++) this.words[i] = a.words[i] ^ b.words[i];\n if (this !== a) for (; i < a.length; i++) this.words[i] = a.words[i];\n return (this.length = a.length), this.strip();\n }),\n (BN.prototype.ixor = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuxor(num);\n }),\n (BN.prototype.xor = function (num) {\n return this.length > num.length ? this.clone().ixor(num) : num.clone().ixor(this);\n }),\n (BN.prototype.uxor = function (num) {\n return this.length > num.length ? this.clone().iuxor(num) : num.clone().iuxor(this);\n }),\n (BN.prototype.inotn = function (width) {\n assert(typeof width == \"number\" && width >= 0);\n var bytesNeeded = Math.ceil(width / 26) | 0,\n bitsLeft = width % 26;\n this._expand(bytesNeeded), bitsLeft > 0 && bytesNeeded--;\n for (var i = 0; i < bytesNeeded; i++) this.words[i] = ~this.words[i] & 67108863;\n return bitsLeft > 0 && (this.words[i] = ~this.words[i] & (67108863 >> (26 - bitsLeft))), this.strip();\n }),\n (BN.prototype.notn = function (width) {\n return this.clone().inotn(width);\n }),\n (BN.prototype.setn = function (bit, val) {\n assert(typeof bit == \"number\" && bit >= 0);\n var off = (bit / 26) | 0,\n wbit = bit % 26;\n return (\n this._expand(off + 1),\n val\n ? (this.words[off] = this.words[off] | (1 << wbit))\n : (this.words[off] = this.words[off] & ~(1 << wbit)),\n this.strip()\n );\n }),\n (BN.prototype.iadd = function (num) {\n var r;\n if (this.negative !== 0 && num.negative === 0)\n return (this.negative = 0), (r = this.isub(num)), (this.negative ^= 1), this._normSign();\n if (this.negative === 0 && num.negative !== 0)\n return (num.negative = 0), (r = this.isub(num)), (num.negative = 1), r._normSign();\n var a, b;\n this.length > num.length ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var carry = 0, i = 0; i < b.length; i++)\n (r = (a.words[i] | 0) + (b.words[i] | 0) + carry), (this.words[i] = r & 67108863), (carry = r >>> 26);\n for (; carry !== 0 && i < a.length; i++)\n (r = (a.words[i] | 0) + carry), (this.words[i] = r & 67108863), (carry = r >>> 26);\n if (((this.length = a.length), carry !== 0)) (this.words[this.length] = carry), this.length++;\n else if (a !== this) for (; i < a.length; i++) this.words[i] = a.words[i];\n return this;\n }),\n (BN.prototype.add = function (num) {\n var res;\n return num.negative !== 0 && this.negative === 0\n ? ((num.negative = 0), (res = this.sub(num)), (num.negative ^= 1), res)\n : num.negative === 0 && this.negative !== 0\n ? ((this.negative = 0), (res = num.sub(this)), (this.negative = 1), res)\n : this.length > num.length\n ? this.clone().iadd(num)\n : num.clone().iadd(this);\n }),\n (BN.prototype.isub = function (num) {\n if (num.negative !== 0) {\n num.negative = 0;\n var r = this.iadd(num);\n return (num.negative = 1), r._normSign();\n } else if (this.negative !== 0)\n return (this.negative = 0), this.iadd(num), (this.negative = 1), this._normSign();\n var cmp = this.cmp(num);\n if (cmp === 0) return (this.negative = 0), (this.length = 1), (this.words[0] = 0), this;\n var a, b;\n cmp > 0 ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var carry = 0, i = 0; i < b.length; i++)\n (r = (a.words[i] | 0) - (b.words[i] | 0) + carry), (carry = r >> 26), (this.words[i] = r & 67108863);\n for (; carry !== 0 && i < a.length; i++)\n (r = (a.words[i] | 0) + carry), (carry = r >> 26), (this.words[i] = r & 67108863);\n if (carry === 0 && i < a.length && a !== this) for (; i < a.length; i++) this.words[i] = a.words[i];\n return (this.length = Math.max(this.length, i)), a !== this && (this.negative = 1), this.strip();\n }),\n (BN.prototype.sub = function (num) {\n return this.clone().isub(num);\n });\n function smallMulTo(self2, num, out) {\n out.negative = num.negative ^ self2.negative;\n var len = (self2.length + num.length) | 0;\n (out.length = len), (len = (len - 1) | 0);\n var a = self2.words[0] | 0,\n b = num.words[0] | 0,\n r = a * b,\n lo = r & 67108863,\n carry = (r / 67108864) | 0;\n out.words[0] = lo;\n for (var k = 1; k < len; k++) {\n for (\n var ncarry = carry >>> 26,\n rword = carry & 67108863,\n maxJ = Math.min(k, num.length - 1),\n j = Math.max(0, k - self2.length + 1);\n j <= maxJ;\n j++\n ) {\n var i = (k - j) | 0;\n (a = self2.words[i] | 0),\n (b = num.words[j] | 0),\n (r = a * b + rword),\n (ncarry += (r / 67108864) | 0),\n (rword = r & 67108863);\n }\n (out.words[k] = rword | 0), (carry = ncarry | 0);\n }\n return carry !== 0 ? (out.words[k] = carry | 0) : out.length--, out.strip();\n }\n var comb10MulTo = function (self2, num, out) {\n var a = self2.words,\n b = num.words,\n o = out.words,\n c = 0,\n lo,\n mid,\n hi,\n a0 = a[0] | 0,\n al0 = a0 & 8191,\n ah0 = a0 >>> 13,\n a1 = a[1] | 0,\n al1 = a1 & 8191,\n ah1 = a1 >>> 13,\n a2 = a[2] | 0,\n al2 = a2 & 8191,\n ah2 = a2 >>> 13,\n a3 = a[3] | 0,\n al3 = a3 & 8191,\n ah3 = a3 >>> 13,\n a4 = a[4] | 0,\n al4 = a4 & 8191,\n ah4 = a4 >>> 13,\n a5 = a[5] | 0,\n al5 = a5 & 8191,\n ah5 = a5 >>> 13,\n a6 = a[6] | 0,\n al6 = a6 & 8191,\n ah6 = a6 >>> 13,\n a7 = a[7] | 0,\n al7 = a7 & 8191,\n ah7 = a7 >>> 13,\n a8 = a[8] | 0,\n al8 = a8 & 8191,\n ah8 = a8 >>> 13,\n a9 = a[9] | 0,\n al9 = a9 & 8191,\n ah9 = a9 >>> 13,\n b0 = b[0] | 0,\n bl0 = b0 & 8191,\n bh0 = b0 >>> 13,\n b1 = b[1] | 0,\n bl1 = b1 & 8191,\n bh1 = b1 >>> 13,\n b2 = b[2] | 0,\n bl2 = b2 & 8191,\n bh2 = b2 >>> 13,\n b3 = b[3] | 0,\n bl3 = b3 & 8191,\n bh3 = b3 >>> 13,\n b4 = b[4] | 0,\n bl4 = b4 & 8191,\n bh4 = b4 >>> 13,\n b5 = b[5] | 0,\n bl5 = b5 & 8191,\n bh5 = b5 >>> 13,\n b6 = b[6] | 0,\n bl6 = b6 & 8191,\n bh6 = b6 >>> 13,\n b7 = b[7] | 0,\n bl7 = b7 & 8191,\n bh7 = b7 >>> 13,\n b8 = b[8] | 0,\n bl8 = b8 & 8191,\n bh8 = b8 >>> 13,\n b9 = b[9] | 0,\n bl9 = b9 & 8191,\n bh9 = b9 >>> 13;\n (out.negative = self2.negative ^ num.negative),\n (out.length = 19),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w0 >>> 26)) | 0),\n (w0 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w1 >>> 26)) | 0),\n (w1 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w2 >>> 26)) | 0),\n (w2 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w3 >>> 26)) | 0),\n (w3 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w4 >>> 26)) | 0),\n (w4 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w5 >>> 26)) | 0),\n (w5 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w6 >>> 26)) | 0),\n (w6 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w7 >>> 26)) | 0),\n (w7 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w8 >>> 26)) | 0),\n (w8 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w9 >>> 26)) | 0),\n (w9 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w10 >>> 26)) | 0),\n (w10 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w11 >>> 26)) | 0),\n (w11 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w12 >>> 26)) | 0),\n (w12 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w13 >>> 26)) | 0),\n (w13 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w14 >>> 26)) | 0),\n (w14 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w15 >>> 26)) | 0),\n (w15 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w16 >>> 26)) | 0),\n (w16 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w17 >>> 26)) | 0),\n (w17 &= 67108863),\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 & 8191) << 13)) | 0;\n return (\n (c = (((hi + (mid >>> 13)) | 0) + (w18 >>> 26)) | 0),\n (w18 &= 67108863),\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 c !== 0 && ((o[19] = c), out.length++),\n out\n );\n };\n Math.imul || (comb10MulTo = smallMulTo);\n function bigMulTo(self2, num, out) {\n (out.negative = num.negative ^ self2.negative), (out.length = self2.length + num.length);\n for (var carry = 0, hncarry = 0, k = 0; k < out.length - 1; k++) {\n var ncarry = hncarry;\n hncarry = 0;\n for (\n var rword = carry & 67108863, maxJ = Math.min(k, num.length - 1), j = Math.max(0, k - self2.length + 1);\n j <= maxJ;\n j++\n ) {\n var i = k - j,\n a = self2.words[i] | 0,\n b = num.words[j] | 0,\n r = a * b,\n lo = r & 67108863;\n (ncarry = (ncarry + ((r / 67108864) | 0)) | 0),\n (lo = (lo + rword) | 0),\n (rword = lo & 67108863),\n (ncarry = (ncarry + (lo >>> 26)) | 0),\n (hncarry += ncarry >>> 26),\n (ncarry &= 67108863);\n }\n (out.words[k] = rword), (carry = ncarry), (ncarry = hncarry);\n }\n return carry !== 0 ? (out.words[k] = carry) : out.length--, out.strip();\n }\n function jumboMulTo(self2, num, out) {\n var fftm = new FFTM();\n return fftm.mulp(self2, num, out);\n }\n BN.prototype.mulTo = function (num, out) {\n var res,\n len = this.length + num.length;\n return (\n this.length === 10 && num.length === 10\n ? (res = comb10MulTo(this, num, out))\n : len < 63\n ? (res = smallMulTo(this, num, out))\n : len < 1024\n ? (res = bigMulTo(this, num, out))\n : (res = jumboMulTo(this, num, out)),\n res\n );\n };\n function FFTM(x, y) {\n (this.x = x), (this.y = y);\n }\n (FFTM.prototype.makeRBT = function (N) {\n for (var t = new Array(N), l = BN.prototype._countBits(N) - 1, i = 0; i < N; i++) t[i] = this.revBin(i, l, N);\n return t;\n }),\n (FFTM.prototype.revBin = function (x, l, N) {\n if (x === 0 || x === N - 1) return x;\n for (var rb = 0, i = 0; i < l; i++) (rb |= (x & 1) << (l - i - 1)), (x >>= 1);\n return rb;\n }),\n (FFTM.prototype.permute = function (rbt, rws, iws, rtws, itws, N) {\n for (var i = 0; i < N; i++) (rtws[i] = rws[rbt[i]]), (itws[i] = iws[rbt[i]]);\n }),\n (FFTM.prototype.transform = function (rws, iws, rtws, itws, N, rbt) {\n this.permute(rbt, rws, iws, rtws, itws, N);\n for (var s = 1; s < N; s <<= 1)\n for (\n var l = s << 1, rtwdf = Math.cos((2 * Math.PI) / l), itwdf = Math.sin((2 * Math.PI) / l), p = 0;\n p < N;\n p += l\n )\n for (var rtwdf_ = rtwdf, itwdf_ = itwdf, j = 0; j < s; j++) {\n var re = rtws[p + j],\n ie = itws[p + j],\n ro = rtws[p + j + s],\n io = itws[p + j + s],\n rx = rtwdf_ * ro - itwdf_ * io;\n (io = rtwdf_ * io + itwdf_ * ro),\n (ro = rx),\n (rtws[p + j] = re + ro),\n (itws[p + j] = ie + io),\n (rtws[p + j + s] = re - ro),\n (itws[p + j + s] = ie - io),\n j !== l &&\n ((rx = rtwdf * rtwdf_ - itwdf * itwdf_), (itwdf_ = rtwdf * itwdf_ + itwdf * rtwdf_), (rtwdf_ = rx));\n }\n }),\n (FFTM.prototype.guessLen13b = function (n, m) {\n var N = Math.max(m, n) | 1,\n odd = N & 1,\n i = 0;\n for (N = (N / 2) | 0; N; N = N >>> 1) i++;\n return 1 << (i + 1 + odd);\n }),\n (FFTM.prototype.conjugate = function (rws, iws, N) {\n if (!(N <= 1))\n for (var i = 0; i < N / 2; i++) {\n var t = rws[i];\n (rws[i] = rws[N - i - 1]),\n (rws[N - i - 1] = t),\n (t = iws[i]),\n (iws[i] = -iws[N - i - 1]),\n (iws[N - i - 1] = -t);\n }\n }),\n (FFTM.prototype.normalize13b = function (ws, N) {\n for (var carry = 0, i = 0; i < N / 2; i++) {\n var w = Math.round(ws[2 * i + 1] / N) * 8192 + Math.round(ws[2 * i] / N) + carry;\n (ws[i] = w & 67108863), w < 67108864 ? (carry = 0) : (carry = (w / 67108864) | 0);\n }\n return ws;\n }),\n (FFTM.prototype.convert13b = function (ws, len, rws, N) {\n for (var carry = 0, i = 0; i < len; i++)\n (carry = carry + (ws[i] | 0)),\n (rws[2 * i] = carry & 8191),\n (carry = carry >>> 13),\n (rws[2 * i + 1] = carry & 8191),\n (carry = carry >>> 13);\n for (i = 2 * len; i < N; ++i) rws[i] = 0;\n assert(carry === 0), assert((carry & -8192) === 0);\n }),\n (FFTM.prototype.stub = function (N) {\n for (var ph = new Array(N), i = 0; i < N; i++) ph[i] = 0;\n return ph;\n }),\n (FFTM.prototype.mulp = function (x, y, out) {\n var N = 2 * this.guessLen13b(x.length, y.length),\n rbt = this.makeRBT(N),\n _ = this.stub(N),\n rws = new Array(N),\n rwst = new Array(N),\n iwst = new Array(N),\n nrws = new Array(N),\n nrwst = new Array(N),\n niwst = new Array(N),\n rmws = out.words;\n (rmws.length = N),\n this.convert13b(x.words, x.length, rws, N),\n this.convert13b(y.words, y.length, nrws, N),\n this.transform(rws, _, rwst, iwst, N, rbt),\n this.transform(nrws, _, nrwst, niwst, N, rbt);\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]), (rwst[i] = rx);\n }\n return (\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 (out.negative = x.negative ^ y.negative),\n (out.length = x.length + y.length),\n out.strip()\n );\n }),\n (BN.prototype.mul = function (num) {\n var out = new BN(null);\n return (out.words = new Array(this.length + num.length)), this.mulTo(num, out);\n }),\n (BN.prototype.mulf = function (num) {\n var out = new BN(null);\n return (out.words = new Array(this.length + num.length)), jumboMulTo(this, num, out);\n }),\n (BN.prototype.imul = function (num) {\n return this.clone().mulTo(num, this);\n }),\n (BN.prototype.imuln = function (num) {\n assert(typeof num == \"number\"), assert(num < 67108864);\n for (var carry = 0, i = 0; i < this.length; i++) {\n var w = (this.words[i] | 0) * num,\n lo = (w & 67108863) + (carry & 67108863);\n (carry >>= 26), (carry += (w / 67108864) | 0), (carry += lo >>> 26), (this.words[i] = lo & 67108863);\n }\n return carry !== 0 && ((this.words[i] = carry), this.length++), this;\n }),\n (BN.prototype.muln = function (num) {\n return this.clone().imuln(num);\n }),\n (BN.prototype.sqr = function () {\n return this.mul(this);\n }),\n (BN.prototype.isqr = function () {\n return this.imul(this.clone());\n }),\n (BN.prototype.pow = function (num) {\n var w = toBitArray(num);\n if (w.length === 0) return new BN(1);\n for (var res = this, i = 0; i < w.length && w[i] === 0; i++, res = res.sqr());\n if (++i < w.length) for (var q = res.sqr(); i < w.length; i++, q = q.sqr()) w[i] !== 0 && (res = res.mul(q));\n return res;\n }),\n (BN.prototype.iushln = function (bits) {\n assert(typeof bits == \"number\" && bits >= 0);\n var r = bits % 26,\n s = (bits - r) / 26,\n carryMask = (67108863 >>> (26 - r)) << (26 - r),\n i;\n if (r !== 0) {\n var carry = 0;\n for (i = 0; i < this.length; i++) {\n var newCarry = this.words[i] & carryMask,\n c = ((this.words[i] | 0) - newCarry) << r;\n (this.words[i] = c | carry), (carry = newCarry >>> (26 - r));\n }\n carry && ((this.words[i] = carry), this.length++);\n }\n if (s !== 0) {\n for (i = this.length - 1; i >= 0; i--) this.words[i + s] = this.words[i];\n for (i = 0; i < s; i++) this.words[i] = 0;\n this.length += s;\n }\n return this.strip();\n }),\n (BN.prototype.ishln = function (bits) {\n return assert(this.negative === 0), this.iushln(bits);\n }),\n (BN.prototype.iushrn = function (bits, hint, extended) {\n assert(typeof bits == \"number\" && bits >= 0);\n var h;\n hint ? (h = (hint - (hint % 26)) / 26) : (h = 0);\n var r = bits % 26,\n s = Math.min((bits - r) / 26, this.length),\n mask = 67108863 ^ ((67108863 >>> r) << r),\n maskedWords = extended;\n if (((h -= s), (h = Math.max(0, h)), maskedWords)) {\n for (var i = 0; i < s; i++) maskedWords.words[i] = this.words[i];\n maskedWords.length = s;\n }\n if (s !== 0)\n if (this.length > s) for (this.length -= s, i = 0; i < this.length; i++) this.words[i] = this.words[i + s];\n else (this.words[0] = 0), (this.length = 1);\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)), (carry = word & mask);\n }\n return (\n maskedWords && carry !== 0 && (maskedWords.words[maskedWords.length++] = carry),\n this.length === 0 && ((this.words[0] = 0), (this.length = 1)),\n this.strip()\n );\n }),\n (BN.prototype.ishrn = function (bits, hint, extended) {\n return assert(this.negative === 0), this.iushrn(bits, hint, extended);\n }),\n (BN.prototype.shln = function (bits) {\n return this.clone().ishln(bits);\n }),\n (BN.prototype.ushln = function (bits) {\n return this.clone().iushln(bits);\n }),\n (BN.prototype.shrn = function (bits) {\n return this.clone().ishrn(bits);\n }),\n (BN.prototype.ushrn = function (bits) {\n return this.clone().iushrn(bits);\n }),\n (BN.prototype.testn = function (bit) {\n assert(typeof bit == \"number\" && bit >= 0);\n var r = bit % 26,\n s = (bit - r) / 26,\n q = 1 << r;\n if (this.length <= s) return !1;\n var w = this.words[s];\n return !!(w & q);\n }),\n (BN.prototype.imaskn = function (bits) {\n assert(typeof bits == \"number\" && bits >= 0);\n var r = bits % 26,\n s = (bits - r) / 26;\n if ((assert(this.negative === 0, \"imaskn works only with positive numbers\"), this.length <= s)) return this;\n if ((r !== 0 && s++, (this.length = Math.min(s, this.length)), r !== 0)) {\n var mask = 67108863 ^ ((67108863 >>> r) << r);\n this.words[this.length - 1] &= mask;\n }\n return this.strip();\n }),\n (BN.prototype.maskn = function (bits) {\n return this.clone().imaskn(bits);\n }),\n (BN.prototype.iaddn = function (num) {\n return (\n assert(typeof num == \"number\"),\n assert(num < 67108864),\n num < 0\n ? this.isubn(-num)\n : this.negative !== 0\n ? this.length === 1 && (this.words[0] | 0) < num\n ? ((this.words[0] = num - (this.words[0] | 0)), (this.negative = 0), this)\n : ((this.negative = 0), this.isubn(num), (this.negative = 1), this)\n : this._iaddn(num)\n );\n }),\n (BN.prototype._iaddn = function (num) {\n this.words[0] += num;\n for (var i = 0; i < this.length && this.words[i] >= 67108864; i++)\n (this.words[i] -= 67108864), i === this.length - 1 ? (this.words[i + 1] = 1) : this.words[i + 1]++;\n return (this.length = Math.max(this.length, i + 1)), this;\n }),\n (BN.prototype.isubn = function (num) {\n if ((assert(typeof num == \"number\"), assert(num < 67108864), num < 0)) return this.iaddn(-num);\n if (this.negative !== 0) return (this.negative = 0), this.iaddn(num), (this.negative = 1), this;\n if (((this.words[0] -= num), this.length === 1 && this.words[0] < 0))\n (this.words[0] = -this.words[0]), (this.negative = 1);\n else\n for (var i = 0; i < this.length && this.words[i] < 0; i++)\n (this.words[i] += 67108864), (this.words[i + 1] -= 1);\n return this.strip();\n }),\n (BN.prototype.addn = function (num) {\n return this.clone().iaddn(num);\n }),\n (BN.prototype.subn = function (num) {\n return this.clone().isubn(num);\n }),\n (BN.prototype.iabs = function () {\n return (this.negative = 0), this;\n }),\n (BN.prototype.abs = function () {\n return this.clone().iabs();\n }),\n (BN.prototype._ishlnsubmul = function (num, mul, shift) {\n var len = num.length + shift,\n i;\n this._expand(len);\n var w,\n 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 & 67108863),\n (carry = (w >> 26) - ((right / 67108864) | 0)),\n (this.words[i + shift] = w & 67108863);\n }\n for (; i < this.length - shift; i++)\n (w = (this.words[i + shift] | 0) + carry), (carry = w >> 26), (this.words[i + shift] = w & 67108863);\n if (carry === 0) return this.strip();\n for (assert(carry === -1), carry = 0, i = 0; i < this.length; i++)\n (w = -(this.words[i] | 0) + carry), (carry = w >> 26), (this.words[i] = w & 67108863);\n return (this.negative = 1), this.strip();\n }),\n (BN.prototype._wordDiv = function (num, mode) {\n var shift = this.length - num.length,\n a = this.clone(),\n b = num,\n bhi = b.words[b.length - 1] | 0,\n bhiBits = this._countBits(bhi);\n (shift = 26 - bhiBits),\n shift !== 0 && ((b = b.ushln(shift)), a.iushln(shift), (bhi = b.words[b.length - 1] | 0));\n var m = a.length - b.length,\n q;\n if (mode !== \"mod\") {\n (q = new BN(null)), (q.length = m + 1), (q.words = new Array(q.length));\n for (var i = 0; i < q.length; i++) q.words[i] = 0;\n }\n var diff = a.clone()._ishlnsubmul(b, 1, m);\n diff.negative === 0 && ((a = diff), q && (q.words[m] = 1));\n for (var j = m - 1; j >= 0; j--) {\n var qj = (a.words[b.length + j] | 0) * 67108864 + (a.words[b.length + j - 1] | 0);\n for (qj = Math.min((qj / bhi) | 0, 67108863), a._ishlnsubmul(b, qj, j); a.negative !== 0; )\n qj--, (a.negative = 0), a._ishlnsubmul(b, 1, j), a.isZero() || (a.negative ^= 1);\n q && (q.words[j] = qj);\n }\n return (\n q && q.strip(),\n a.strip(),\n mode !== \"div\" && shift !== 0 && a.iushrn(shift),\n {\n div: q || null,\n mod: a,\n }\n );\n }),\n (BN.prototype.divmod = function (num, mode, positive) {\n if ((assert(!num.isZero()), this.isZero()))\n return {\n div: new BN(0),\n mod: new BN(0),\n };\n var div, mod, res;\n return this.negative !== 0 && num.negative === 0\n ? ((res = this.neg().divmod(num, mode)),\n mode !== \"mod\" && (div = res.div.neg()),\n mode !== \"div\" && ((mod = res.mod.neg()), positive && mod.negative !== 0 && mod.iadd(num)),\n {\n div,\n mod,\n })\n : this.negative === 0 && num.negative !== 0\n ? ((res = this.divmod(num.neg(), mode)),\n mode !== \"mod\" && (div = res.div.neg()),\n {\n div,\n mod: res.mod,\n })\n : (this.negative & num.negative) !== 0\n ? ((res = this.neg().divmod(num.neg(), mode)),\n mode !== \"div\" && ((mod = res.mod.neg()), positive && mod.negative !== 0 && mod.isub(num)),\n {\n div: res.div,\n mod,\n })\n : num.length > this.length || this.cmp(num) < 0\n ? {\n div: new BN(0),\n mod: this,\n }\n : num.length === 1\n ? mode === \"div\"\n ? {\n div: this.divn(num.words[0]),\n mod: null,\n }\n : mode === \"mod\"\n ? {\n div: null,\n mod: new BN(this.modn(num.words[0])),\n }\n : {\n div: this.divn(num.words[0]),\n mod: new BN(this.modn(num.words[0])),\n }\n : this._wordDiv(num, mode);\n }),\n (BN.prototype.div = function (num) {\n return this.divmod(num, \"div\", !1).div;\n }),\n (BN.prototype.mod = function (num) {\n return this.divmod(num, \"mod\", !1).mod;\n }),\n (BN.prototype.umod = function (num) {\n return this.divmod(num, \"mod\", !0).mod;\n }),\n (BN.prototype.divRound = function (num) {\n var dm = this.divmod(num);\n if (dm.mod.isZero()) return dm.div;\n var mod = dm.div.negative !== 0 ? dm.mod.isub(num) : dm.mod,\n half = num.ushrn(1),\n r2 = num.andln(1),\n cmp = mod.cmp(half);\n return cmp < 0 || (r2 === 1 && cmp === 0)\n ? dm.div\n : dm.div.negative !== 0\n ? dm.div.isubn(1)\n : dm.div.iaddn(1);\n }),\n (BN.prototype.modn = function (num) {\n assert(num <= 67108863);\n for (var p = (1 << 26) % num, acc = 0, i = this.length - 1; i >= 0; i--)\n acc = (p * acc + (this.words[i] | 0)) % num;\n return acc;\n }),\n (BN.prototype.idivn = function (num) {\n assert(num <= 67108863);\n for (var carry = 0, i = this.length - 1; i >= 0; i--) {\n var w = (this.words[i] | 0) + carry * 67108864;\n (this.words[i] = (w / num) | 0), (carry = w % num);\n }\n return this.strip();\n }),\n (BN.prototype.divn = function (num) {\n return this.clone().idivn(num);\n }),\n (BN.prototype.egcd = function (p) {\n assert(p.negative === 0), assert(!p.isZero());\n var x = this,\n y = p.clone();\n x.negative !== 0 ? (x = x.umod(p)) : (x = x.clone());\n for (var A = new BN(1), B = new BN(0), C = new BN(0), D = new BN(1), g = 0; x.isEven() && y.isEven(); )\n x.iushrn(1), y.iushrn(1), ++g;\n for (var yp = y.clone(), xp = x.clone(); !x.isZero(); ) {\n for (var i = 0, im = 1; (x.words[0] & im) === 0 && i < 26; ++i, im <<= 1);\n if (i > 0)\n for (x.iushrn(i); i-- > 0; )\n (A.isOdd() || B.isOdd()) && (A.iadd(yp), B.isub(xp)), A.iushrn(1), B.iushrn(1);\n for (var j = 0, jm = 1; (y.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n if (j > 0)\n for (y.iushrn(j); j-- > 0; )\n (C.isOdd() || D.isOdd()) && (C.iadd(yp), D.isub(xp)), C.iushrn(1), D.iushrn(1);\n x.cmp(y) >= 0 ? (x.isub(y), A.isub(C), B.isub(D)) : (y.isub(x), C.isub(A), D.isub(B));\n }\n return {\n a: C,\n b: D,\n gcd: y.iushln(g),\n };\n }),\n (BN.prototype._invmp = function (p) {\n assert(p.negative === 0), assert(!p.isZero());\n var a = this,\n b = p.clone();\n a.negative !== 0 ? (a = a.umod(p)) : (a = a.clone());\n for (var x1 = new BN(1), x2 = new BN(0), delta = b.clone(); 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) for (a.iushrn(i); i-- > 0; ) x1.isOdd() && x1.iadd(delta), x1.iushrn(1);\n for (var j = 0, jm = 1; (b.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n if (j > 0) for (b.iushrn(j); j-- > 0; ) x2.isOdd() && x2.iadd(delta), x2.iushrn(1);\n a.cmp(b) >= 0 ? (a.isub(b), x1.isub(x2)) : (b.isub(a), x2.isub(x1));\n }\n var res;\n return a.cmpn(1) === 0 ? (res = x1) : (res = x2), res.cmpn(0) < 0 && res.iadd(p), res;\n }),\n (BN.prototype.gcd = function (num) {\n if (this.isZero()) return num.abs();\n if (num.isZero()) return this.abs();\n var a = this.clone(),\n b = num.clone();\n (a.negative = 0), (b.negative = 0);\n for (var shift = 0; a.isEven() && b.isEven(); shift++) a.iushrn(1), b.iushrn(1);\n do {\n for (; a.isEven(); ) a.iushrn(1);\n for (; b.isEven(); ) b.iushrn(1);\n var r = a.cmp(b);\n if (r < 0) {\n var t = a;\n (a = b), (b = t);\n } else if (r === 0 || b.cmpn(1) === 0) break;\n a.isub(b);\n } while (!0);\n return b.iushln(shift);\n }),\n (BN.prototype.invm = function (num) {\n return this.egcd(num).a.umod(num);\n }),\n (BN.prototype.isEven = function () {\n return (this.words[0] & 1) === 0;\n }),\n (BN.prototype.isOdd = function () {\n return (this.words[0] & 1) === 1;\n }),\n (BN.prototype.andln = function (num) {\n return this.words[0] & num;\n }),\n (BN.prototype.bincn = function (bit) {\n assert(typeof bit == \"number\");\n var r = bit % 26,\n s = (bit - r) / 26,\n q = 1 << r;\n if (this.length <= s) return this._expand(s + 1), (this.words[s] |= q), this;\n for (var carry = q, i = s; carry !== 0 && i < this.length; i++) {\n var w = this.words[i] | 0;\n (w += carry), (carry = w >>> 26), (w &= 67108863), (this.words[i] = w);\n }\n return carry !== 0 && ((this.words[i] = carry), this.length++), this;\n }),\n (BN.prototype.isZero = function () {\n return this.length === 1 && this.words[0] === 0;\n }),\n (BN.prototype.cmpn = function (num) {\n var negative = num < 0;\n if (this.negative !== 0 && !negative) return -1;\n if (this.negative === 0 && negative) return 1;\n this.strip();\n var res;\n if (this.length > 1) res = 1;\n else {\n negative && (num = -num), assert(num <= 67108863, \"Number is too big\");\n var w = this.words[0] | 0;\n res = w === num ? 0 : w < num ? -1 : 1;\n }\n return this.negative !== 0 ? -res | 0 : res;\n }),\n (BN.prototype.cmp = function (num) {\n if (this.negative !== 0 && num.negative === 0) return -1;\n if (this.negative === 0 && num.negative !== 0) return 1;\n var res = this.ucmp(num);\n return this.negative !== 0 ? -res | 0 : res;\n }),\n (BN.prototype.ucmp = function (num) {\n if (this.length > num.length) return 1;\n if (this.length < num.length) return -1;\n for (var res = 0, i = this.length - 1; i >= 0; i--) {\n var a = this.words[i] | 0,\n b = num.words[i] | 0;\n if (a !== b) {\n a < b ? (res = -1) : a > b && (res = 1);\n break;\n }\n }\n return res;\n }),\n (BN.prototype.gtn = function (num) {\n return this.cmpn(num) === 1;\n }),\n (BN.prototype.gt = function (num) {\n return this.cmp(num) === 1;\n }),\n (BN.prototype.gten = function (num) {\n return this.cmpn(num) >= 0;\n }),\n (BN.prototype.gte = function (num) {\n return this.cmp(num) >= 0;\n }),\n (BN.prototype.ltn = function (num) {\n return this.cmpn(num) === -1;\n }),\n (BN.prototype.lt = function (num) {\n return this.cmp(num) === -1;\n }),\n (BN.prototype.lten = function (num) {\n return this.cmpn(num) <= 0;\n }),\n (BN.prototype.lte = function (num) {\n return this.cmp(num) <= 0;\n }),\n (BN.prototype.eqn = function (num) {\n return this.cmpn(num) === 0;\n }),\n (BN.prototype.eq = function (num) {\n return this.cmp(num) === 0;\n }),\n (BN.red = function (num) {\n return new Red(num);\n }),\n (BN.prototype.toRed = function (ctx) {\n return (\n assert(!this.red, \"Already a number in reduction context\"),\n assert(this.negative === 0, \"red works only with positives\"),\n ctx.convertTo(this)._forceRed(ctx)\n );\n }),\n (BN.prototype.fromRed = function () {\n return assert(this.red, \"fromRed works only with numbers in reduction context\"), this.red.convertFrom(this);\n }),\n (BN.prototype._forceRed = function (ctx) {\n return (this.red = ctx), this;\n }),\n (BN.prototype.forceRed = function (ctx) {\n return assert(!this.red, \"Already a number in reduction context\"), this._forceRed(ctx);\n }),\n (BN.prototype.redAdd = function (num) {\n return assert(this.red, \"redAdd works only with red numbers\"), this.red.add(this, num);\n }),\n (BN.prototype.redIAdd = function (num) {\n return assert(this.red, \"redIAdd works only with red numbers\"), this.red.iadd(this, num);\n }),\n (BN.prototype.redSub = function (num) {\n return assert(this.red, \"redSub works only with red numbers\"), this.red.sub(this, num);\n }),\n (BN.prototype.redISub = function (num) {\n return assert(this.red, \"redISub works only with red numbers\"), this.red.isub(this, num);\n }),\n (BN.prototype.redShl = function (num) {\n return assert(this.red, \"redShl works only with red numbers\"), this.red.shl(this, num);\n }),\n (BN.prototype.redMul = function (num) {\n return (\n assert(this.red, \"redMul works only with red numbers\"),\n this.red._verify2(this, num),\n this.red.mul(this, num)\n );\n }),\n (BN.prototype.redIMul = function (num) {\n return (\n assert(this.red, \"redMul works only with red numbers\"),\n this.red._verify2(this, num),\n this.red.imul(this, num)\n );\n }),\n (BN.prototype.redSqr = function () {\n return assert(this.red, \"redSqr works only with red numbers\"), this.red._verify1(this), this.red.sqr(this);\n }),\n (BN.prototype.redISqr = function () {\n return assert(this.red, \"redISqr works only with red numbers\"), this.red._verify1(this), this.red.isqr(this);\n }),\n (BN.prototype.redSqrt = function () {\n return assert(this.red, \"redSqrt works only with red numbers\"), this.red._verify1(this), this.red.sqrt(this);\n }),\n (BN.prototype.redInvm = function () {\n return assert(this.red, \"redInvm works only with red numbers\"), this.red._verify1(this), this.red.invm(this);\n }),\n (BN.prototype.redNeg = function () {\n return assert(this.red, \"redNeg works only with red numbers\"), this.red._verify1(this), this.red.neg(this);\n }),\n (BN.prototype.redPow = function (num) {\n return assert(this.red && !num.red, \"redPow(normalNum)\"), this.red._verify1(this), this.red.pow(this, num);\n });\n var primes = {\n k256: null,\n p224: null,\n p192: null,\n p25519: null,\n };\n function MPrime(name, p) {\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 (this.tmp = this._tmp());\n }\n (MPrime.prototype._tmp = function () {\n var tmp = new BN(null);\n return (tmp.words = new Array(Math.ceil(this.n / 13))), tmp;\n }),\n (MPrime.prototype.ireduce = function (num) {\n var r = num,\n rlen;\n do this.split(r, this.tmp), (r = this.imulK(r)), (r = r.iadd(this.tmp)), (rlen = r.bitLength());\n while (rlen > this.n);\n var cmp = rlen < this.n ? -1 : r.ucmp(this.p);\n return (\n cmp === 0\n ? ((r.words[0] = 0), (r.length = 1))\n : cmp > 0\n ? r.isub(this.p)\n : r.strip !== void 0\n ? r.strip()\n : r._strip(),\n r\n );\n }),\n (MPrime.prototype.split = function (input, out) {\n input.iushrn(this.n, 0, out);\n }),\n (MPrime.prototype.imulK = function (num) {\n return num.imul(this.k);\n });\n function K256() {\n MPrime.call(this, \"k256\", \"ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f\");\n }\n inherits(K256, MPrime),\n (K256.prototype.split = function (input, output) {\n for (var mask = 4194303, outLen = Math.min(input.length, 9), i = 0; i < outLen; i++)\n output.words[i] = input.words[i];\n if (((output.length = outLen), input.length <= 9)) {\n (input.words[0] = 0), (input.length = 1);\n return;\n }\n var prev = input.words[9];\n for (output.words[output.length++] = prev & mask, i = 10; i < input.length; i++) {\n var next = input.words[i] | 0;\n (input.words[i - 10] = ((next & mask) << 4) | (prev >>> 22)), (prev = next);\n }\n (prev >>>= 22),\n (input.words[i - 10] = prev),\n prev === 0 && input.length > 10 ? (input.length -= 10) : (input.length -= 9);\n }),\n (K256.prototype.imulK = function (num) {\n (num.words[num.length] = 0), (num.words[num.length + 1] = 0), (num.length += 2);\n for (var lo = 0, i = 0; i < num.length; i++) {\n var w = num.words[i] | 0;\n (lo += w * 977), (num.words[i] = lo & 67108863), (lo = w * 64 + ((lo / 67108864) | 0));\n }\n return (\n num.words[num.length - 1] === 0 && (num.length--, num.words[num.length - 1] === 0 && num.length--), num\n );\n });\n function P224() {\n MPrime.call(this, \"p224\", \"ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001\");\n }\n inherits(P224, MPrime);\n function P192() {\n MPrime.call(this, \"p192\", \"ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff\");\n }\n inherits(P192, MPrime);\n function P25519() {\n MPrime.call(this, \"25519\", \"7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed\");\n }\n inherits(P25519, MPrime),\n (P25519.prototype.imulK = function (num) {\n for (var carry = 0, i = 0; i < num.length; i++) {\n var hi = (num.words[i] | 0) * 19 + carry,\n lo = hi & 67108863;\n (hi >>>= 26), (num.words[i] = lo), (carry = hi);\n }\n return carry !== 0 && (num.words[num.length++] = carry), num;\n }),\n (BN._prime = function (name) {\n if (primes[name]) return primes[name];\n var prime2;\n if (name === \"k256\") prime2 = new K256();\n else if (name === \"p224\") prime2 = new P224();\n else if (name === \"p192\") prime2 = new P192();\n else if (name === \"p25519\") prime2 = new P25519();\n else throw new Error(\"Unknown prime \" + name);\n return (primes[name] = prime2), prime2;\n });\n function Red(m) {\n if (typeof m == \"string\") {\n var prime = BN._prime(m);\n (this.m = prime.p), (this.prime = prime);\n } else assert(m.gtn(1), \"modulus must be greater than 1\"), (this.m = m), (this.prime = null);\n }\n (Red.prototype._verify1 = function (a) {\n assert(a.negative === 0, \"red works only with positives\"), assert(a.red, \"red works only with red numbers\");\n }),\n (Red.prototype._verify2 = function (a, b) {\n assert((a.negative | b.negative) === 0, \"red works only with positives\"),\n assert(a.red && a.red === b.red, \"red works only with red numbers\");\n }),\n (Red.prototype.imod = function (a) {\n return this.prime ? this.prime.ireduce(a)._forceRed(this) : a.umod(this.m)._forceRed(this);\n }),\n (Red.prototype.neg = function (a) {\n return a.isZero() ? a.clone() : this.m.sub(a)._forceRed(this);\n }),\n (Red.prototype.add = function (a, b) {\n this._verify2(a, b);\n var res = a.add(b);\n return res.cmp(this.m) >= 0 && res.isub(this.m), res._forceRed(this);\n }),\n (Red.prototype.iadd = function (a, b) {\n this._verify2(a, b);\n var res = a.iadd(b);\n return res.cmp(this.m) >= 0 && res.isub(this.m), res;\n }),\n (Red.prototype.sub = function (a, b) {\n this._verify2(a, b);\n var res = a.sub(b);\n return res.cmpn(0) < 0 && res.iadd(this.m), res._forceRed(this);\n }),\n (Red.prototype.isub = function (a, b) {\n this._verify2(a, b);\n var res = a.isub(b);\n return res.cmpn(0) < 0 && res.iadd(this.m), res;\n }),\n (Red.prototype.shl = function (a, num) {\n return this._verify1(a), this.imod(a.ushln(num));\n }),\n (Red.prototype.imul = function (a, b) {\n return this._verify2(a, b), this.imod(a.imul(b));\n }),\n (Red.prototype.mul = function (a, b) {\n return this._verify2(a, b), this.imod(a.mul(b));\n }),\n (Red.prototype.isqr = function (a) {\n return this.imul(a, a.clone());\n }),\n (Red.prototype.sqr = function (a) {\n return this.mul(a, a);\n }),\n (Red.prototype.sqrt = function (a) {\n if (a.isZero()) return a.clone();\n var mod3 = this.m.andln(3);\n if ((assert(mod3 % 2 === 1), mod3 === 3)) {\n var pow = this.m.add(new BN(1)).iushrn(2);\n return this.pow(a, pow);\n }\n for (var q = this.m.subn(1), s = 0; !q.isZero() && q.andln(1) === 0; ) s++, q.iushrn(1);\n assert(!q.isZero());\n var one = new BN(1).toRed(this),\n nOne = one.redNeg(),\n lpow = this.m.subn(1).iushrn(1),\n z = this.m.bitLength();\n for (z = new BN(2 * z * z).toRed(this); this.pow(z, lpow).cmp(nOne) !== 0; ) z.redIAdd(nOne);\n for (\n var c = this.pow(z, q), r = this.pow(a, q.addn(1).iushrn(1)), t = this.pow(a, q), m = s;\n t.cmp(one) !== 0;\n\n ) {\n for (var tmp = t, i = 0; tmp.cmp(one) !== 0; i++) tmp = tmp.redSqr();\n assert(i < m);\n var b = this.pow(c, new BN(1).iushln(m - i - 1));\n (r = r.redMul(b)), (c = b.redSqr()), (t = t.redMul(c)), (m = i);\n }\n return r;\n }),\n (Red.prototype.invm = function (a) {\n var inv = a._invmp(this.m);\n return inv.negative !== 0 ? ((inv.negative = 0), this.imod(inv).redNeg()) : this.imod(inv);\n }),\n (Red.prototype.pow = function (a, num) {\n if (num.isZero()) return new BN(1).toRed(this);\n if (num.cmpn(1) === 0) return a.clone();\n var windowSize = 4,\n wnd = new Array(1 << windowSize);\n (wnd[0] = new BN(1).toRed(this)), (wnd[1] = a);\n for (var i = 2; i < wnd.length; i++) wnd[i] = this.mul(wnd[i - 1], a);\n var res = wnd[0],\n current = 0,\n currentLen = 0,\n start = num.bitLength() % 26;\n for (start === 0 && (start = 26), i = num.length - 1; i >= 0; i--) {\n for (var word = num.words[i], j = start - 1; j >= 0; j--) {\n var bit = (word >> j) & 1;\n if ((res !== wnd[0] && (res = this.sqr(res)), bit === 0 && current === 0)) {\n currentLen = 0;\n continue;\n }\n (current <<= 1),\n (current |= bit),\n currentLen++,\n !(currentLen !== windowSize && (i !== 0 || j !== 0)) &&\n ((res = this.mul(res, wnd[current])), (currentLen = 0), (current = 0));\n }\n start = 26;\n }\n return res;\n }),\n (Red.prototype.convertTo = function (num) {\n var r = num.umod(this.m);\n return r === num ? r.clone() : r;\n }),\n (Red.prototype.convertFrom = function (num) {\n var res = num.clone();\n return (res.red = null), res;\n }),\n (BN.mont = function (num) {\n return new Mont(num);\n });\n function Mont(m) {\n Red.call(this, m),\n (this.shift = this.m.bitLength()),\n this.shift % 26 !== 0 && (this.shift += 26 - (this.shift % 26)),\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 (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 (Mont.prototype.convertTo = function (num) {\n return this.imod(num.ushln(this.shift));\n }),\n (Mont.prototype.convertFrom = function (num) {\n var r = this.imod(num.mul(this.rinv));\n return (r.red = null), r;\n }),\n (Mont.prototype.imul = function (a, b) {\n if (a.isZero() || b.isZero()) return (a.words[0] = 0), (a.length = 1), a;\n var t = a.imul(b),\n c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m),\n u = t.isub(c).iushrn(this.shift),\n res = u;\n return (\n u.cmp(this.m) >= 0 ? (res = u.isub(this.m)) : u.cmpn(0) < 0 && (res = u.iadd(this.m)), res._forceRed(this)\n );\n }),\n (Mont.prototype.mul = function (a, b) {\n if (a.isZero() || b.isZero()) return new BN(0)._forceRed(this);\n var t = a.mul(b),\n c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m),\n u = t.isub(c).iushrn(this.shift),\n res = u;\n return (\n u.cmp(this.m) >= 0 ? (res = u.isub(this.m)) : u.cmpn(0) < 0 && (res = u.iadd(this.m)), res._forceRed(this)\n );\n }),\n (Mont.prototype.invm = function (a) {\n var res = this.imod(a._invmp(this.m).mul(this.r2));\n return res._forceRed(this);\n });\n })(typeof module > \"u\" || module, exports);\n },\n});\n\n// node_modules/miller-rabin/node_modules/bn.js/lib/bn.js\nvar require_bn2 = __commonJS({\n \"node_modules/miller-rabin/node_modules/bn.js/lib/bn.js\"(exports, module) {\n (function (module2, exports2) {\n \"use strict\";\n function assert(val, msg) {\n if (!val) throw new Error(msg || \"Assertion failed\");\n }\n function inherits(ctor, superCtor) {\n ctor.super_ = superCtor;\n var TempCtor = function () {};\n (TempCtor.prototype = superCtor.prototype),\n (ctor.prototype = new TempCtor()),\n (ctor.prototype.constructor = ctor);\n }\n function BN(number, base, endian) {\n if (BN.isBN(number)) return number;\n (this.negative = 0),\n (this.words = null),\n (this.length = 0),\n (this.red = null),\n number !== null &&\n ((base === \"le\" || base === \"be\") && ((endian = base), (base = 10)),\n this._init(number || 0, base || 10, endian || \"be\"));\n }\n typeof module2 == \"object\" ? (module2.exports = BN) : (exports2.BN = BN), (BN.BN = BN), (BN.wordSize = 26);\n var Buffer2;\n try {\n typeof window < \"u\" && typeof window.Buffer < \"u\"\n ? (Buffer2 = window.Buffer)\n : (Buffer2 = __require(\"buffer\").Buffer);\n } catch {}\n (BN.isBN = function (num) {\n return num instanceof BN\n ? !0\n : num !== null &&\n typeof num == \"object\" &&\n num.constructor.wordSize === BN.wordSize &&\n Array.isArray(num.words);\n }),\n (BN.max = function (left, right) {\n return left.cmp(right) > 0 ? left : right;\n }),\n (BN.min = function (left, right) {\n return left.cmp(right) < 0 ? left : right;\n }),\n (BN.prototype._init = function (number, base, endian) {\n if (typeof number == \"number\") return this._initNumber(number, base, endian);\n if (typeof number == \"object\") return this._initArray(number, base, endian);\n base === \"hex\" && (base = 16),\n assert(base === (base | 0) && base >= 2 && base <= 36),\n (number = number.toString().replace(/\\s+/g, \"\"));\n var start = 0;\n number[0] === \"-\" && (start++, (this.negative = 1)),\n start < number.length &&\n (base === 16\n ? this._parseHex(number, start, endian)\n : (this._parseBase(number, base, start),\n endian === \"le\" && this._initArray(this.toArray(), base, endian)));\n }),\n (BN.prototype._initNumber = function (number, base, endian) {\n number < 0 && ((this.negative = 1), (number = -number)),\n number < 67108864\n ? ((this.words = [number & 67108863]), (this.length = 1))\n : number < 4503599627370496\n ? ((this.words = [number & 67108863, (number / 67108864) & 67108863]), (this.length = 2))\n : (assert(number < 9007199254740992),\n (this.words = [number & 67108863, (number / 67108864) & 67108863, 1]),\n (this.length = 3)),\n endian === \"le\" && this._initArray(this.toArray(), base, endian);\n }),\n (BN.prototype._initArray = function (number, base, endian) {\n if ((assert(typeof number.length == \"number\"), number.length <= 0))\n return (this.words = [0]), (this.length = 1), this;\n (this.length = Math.ceil(number.length / 3)), (this.words = new Array(this.length));\n for (var i = 0; i < this.length; i++) this.words[i] = 0;\n var j,\n w,\n off = 0;\n if (endian === \"be\")\n for (i = number.length - 1, j = 0; i >= 0; i -= 3)\n (w = number[i] | (number[i - 1] << 8) | (number[i - 2] << 16)),\n (this.words[j] |= (w << off) & 67108863),\n (this.words[j + 1] = (w >>> (26 - off)) & 67108863),\n (off += 24),\n off >= 26 && ((off -= 26), j++);\n else if (endian === \"le\")\n for (i = 0, j = 0; i < number.length; i += 3)\n (w = number[i] | (number[i + 1] << 8) | (number[i + 2] << 16)),\n (this.words[j] |= (w << off) & 67108863),\n (this.words[j + 1] = (w >>> (26 - off)) & 67108863),\n (off += 24),\n off >= 26 && ((off -= 26), j++);\n return this.strip();\n });\n function parseHex4Bits(string, index) {\n var c = string.charCodeAt(index);\n return c >= 65 && c <= 70 ? c - 55 : c >= 97 && c <= 102 ? c - 87 : (c - 48) & 15;\n }\n function parseHexByte(string, lowerBound, index) {\n var r = parseHex4Bits(string, index);\n return index - 1 >= lowerBound && (r |= parseHex4Bits(string, index - 1) << 4), r;\n }\n BN.prototype._parseHex = function (number, start, endian) {\n (this.length = Math.ceil((number.length - start) / 6)), (this.words = new Array(this.length));\n for (var i = 0; i < this.length; i++) this.words[i] = 0;\n var off = 0,\n j = 0,\n w;\n if (endian === \"be\")\n for (i = number.length - 1; i >= start; i -= 2)\n (w = parseHexByte(number, start, i) << off),\n (this.words[j] |= w & 67108863),\n off >= 18 ? ((off -= 18), (j += 1), (this.words[j] |= w >>> 26)) : (off += 8);\n else {\n var parseLength = number.length - start;\n for (i = parseLength % 2 === 0 ? start + 1 : start; i < number.length; i += 2)\n (w = parseHexByte(number, start, i) << off),\n (this.words[j] |= w & 67108863),\n off >= 18 ? ((off -= 18), (j += 1), (this.words[j] |= w >>> 26)) : (off += 8);\n }\n this.strip();\n };\n function parseBase(str, start, end, mul) {\n for (var r = 0, len = Math.min(str.length, end), i = start; i < len; i++) {\n var c = str.charCodeAt(i) - 48;\n (r *= mul), c >= 49 ? (r += c - 49 + 10) : c >= 17 ? (r += c - 17 + 10) : (r += c);\n }\n return r;\n }\n (BN.prototype._parseBase = function (number, base, start) {\n (this.words = [0]), (this.length = 1);\n for (var limbLen = 0, limbPow = 1; limbPow <= 67108863; limbPow *= base) limbLen++;\n limbLen--, (limbPow = (limbPow / base) | 0);\n for (\n var total = number.length - start,\n mod = total % limbLen,\n end = Math.min(total, total - mod) + start,\n word = 0,\n i = start;\n i < end;\n i += limbLen\n )\n (word = parseBase(number, i, i + limbLen, base)),\n this.imuln(limbPow),\n this.words[0] + word < 67108864 ? (this.words[0] += word) : this._iaddn(word);\n if (mod !== 0) {\n var pow = 1;\n for (word = parseBase(number, i, number.length, base), i = 0; i < mod; i++) pow *= base;\n this.imuln(pow), this.words[0] + word < 67108864 ? (this.words[0] += word) : this._iaddn(word);\n }\n this.strip();\n }),\n (BN.prototype.copy = function (dest) {\n dest.words = new Array(this.length);\n for (var i = 0; i < this.length; i++) dest.words[i] = this.words[i];\n (dest.length = this.length), (dest.negative = this.negative), (dest.red = this.red);\n }),\n (BN.prototype.clone = function () {\n var r = new BN(null);\n return this.copy(r), r;\n }),\n (BN.prototype._expand = function (size) {\n for (; this.length < size; ) this.words[this.length++] = 0;\n return this;\n }),\n (BN.prototype.strip = function () {\n for (; this.length > 1 && this.words[this.length - 1] === 0; ) this.length--;\n return this._normSign();\n }),\n (BN.prototype._normSign = function () {\n return this.length === 1 && this.words[0] === 0 && (this.negative = 0), this;\n }),\n (BN.prototype.inspect = function () {\n return (this.red ? \"<BN-R: \" : \"<BN: \") + this.toString(16) + \">\";\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 groupSizes = [\n 0, 0, 25, 16, 12, 11, 10, 9, 8, 8, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5,\n 5, 5,\n ],\n groupBases = [\n 0, 0, 33554432, 43046721, 16777216, 48828125, 60466176, 40353607, 16777216, 43046721, 1e7, 19487171, 35831808,\n 62748517, 7529536, 11390625, 16777216, 24137569, 34012224, 47045881, 64e6, 4084101, 5153632, 6436343, 7962624,\n 9765625, 11881376, 14348907, 17210368, 20511149, 243e5, 28629151, 33554432, 39135393, 45435424, 52521875,\n 60466176,\n ];\n (BN.prototype.toString = function (base, padding) {\n (base = base || 10), (padding = padding | 0 || 1);\n var out;\n if (base === 16 || base === \"hex\") {\n out = \"\";\n for (var off = 0, carry = 0, i = 0; i < this.length; i++) {\n var w = this.words[i],\n word = (((w << off) | carry) & 16777215).toString(16);\n (carry = (w >>> (24 - off)) & 16777215),\n carry !== 0 || i !== this.length - 1 ? (out = zeros[6 - word.length] + word + out) : (out = word + out),\n (off += 2),\n off >= 26 && ((off -= 26), i--);\n }\n for (carry !== 0 && (out = carry.toString(16) + out); out.length % padding !== 0; ) out = \"0\" + out;\n return this.negative !== 0 && (out = \"-\" + out), out;\n }\n if (base === (base | 0) && base >= 2 && base <= 36) {\n var groupSize = groupSizes[base],\n groupBase = groupBases[base];\n out = \"\";\n var c = this.clone();\n for (c.negative = 0; !c.isZero(); ) {\n var r = c.modn(groupBase).toString(base);\n (c = c.idivn(groupBase)), c.isZero() ? (out = r + out) : (out = zeros[groupSize - r.length] + r + out);\n }\n for (this.isZero() && (out = \"0\" + out); out.length % padding !== 0; ) out = \"0\" + out;\n return this.negative !== 0 && (out = \"-\" + out), out;\n }\n assert(!1, \"Base should be between 2 and 36\");\n }),\n (BN.prototype.toNumber = function () {\n var ret = this.words[0];\n return (\n this.length === 2\n ? (ret += this.words[1] * 67108864)\n : this.length === 3 && this.words[2] === 1\n ? (ret += 4503599627370496 + this.words[1] * 67108864)\n : this.length > 2 && assert(!1, \"Number can only safely store up to 53 bits\"),\n this.negative !== 0 ? -ret : ret\n );\n }),\n (BN.prototype.toJSON = function () {\n return this.toString(16);\n }),\n (BN.prototype.toBuffer = function (endian, length) {\n return assert(typeof Buffer2 < \"u\"), this.toArrayLike(Buffer2, endian, length);\n }),\n (BN.prototype.toArray = function (endian, length) {\n return this.toArrayLike(Array, endian, length);\n }),\n (BN.prototype.toArrayLike = function (ArrayType, endian, length) {\n var byteLength = this.byteLength(),\n 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 this.strip();\n var littleEndian = endian === \"le\",\n res = new ArrayType(reqLength),\n b,\n i,\n q = this.clone();\n if (littleEndian) {\n for (i = 0; !q.isZero(); i++) (b = q.andln(255)), q.iushrn(8), (res[i] = b);\n for (; i < reqLength; i++) res[i] = 0;\n } else {\n for (i = 0; i < reqLength - byteLength; i++) res[i] = 0;\n for (i = 0; !q.isZero(); i++) (b = q.andln(255)), q.iushrn(8), (res[reqLength - i - 1] = b);\n }\n return res;\n }),\n Math.clz32\n ? (BN.prototype._countBits = function (w) {\n return 32 - Math.clz32(w);\n })\n : (BN.prototype._countBits = function (w) {\n var t = w,\n r = 0;\n return (\n t >= 4096 && ((r += 13), (t >>>= 13)),\n t >= 64 && ((r += 7), (t >>>= 7)),\n t >= 8 && ((r += 4), (t >>>= 4)),\n t >= 2 && ((r += 2), (t >>>= 2)),\n r + t\n );\n }),\n (BN.prototype._zeroBits = function (w) {\n if (w === 0) return 26;\n var t = w,\n r = 0;\n return (\n (t & 8191) === 0 && ((r += 13), (t >>>= 13)),\n (t & 127) === 0 && ((r += 7), (t >>>= 7)),\n (t & 15) === 0 && ((r += 4), (t >>>= 4)),\n (t & 3) === 0 && ((r += 2), (t >>>= 2)),\n (t & 1) === 0 && r++,\n r\n );\n }),\n (BN.prototype.bitLength = function () {\n var w = this.words[this.length - 1],\n hi = this._countBits(w);\n return (this.length - 1) * 26 + hi;\n });\n function toBitArray(num) {\n for (var w = new Array(num.bitLength()), bit = 0; bit < w.length; bit++) {\n var off = (bit / 26) | 0,\n wbit = bit % 26;\n w[bit] = (num.words[off] & (1 << wbit)) >>> wbit;\n }\n return w;\n }\n (BN.prototype.zeroBits = function () {\n if (this.isZero()) return 0;\n for (var r = 0, i = 0; i < this.length; i++) {\n var b = this._zeroBits(this.words[i]);\n if (((r += b), b !== 26)) break;\n }\n return r;\n }),\n (BN.prototype.byteLength = function () {\n return Math.ceil(this.bitLength() / 8);\n }),\n (BN.prototype.toTwos = function (width) {\n return this.negative !== 0 ? this.abs().inotn(width).iaddn(1) : this.clone();\n }),\n (BN.prototype.fromTwos = function (width) {\n return this.testn(width - 1) ? this.notn(width).iaddn(1).ineg() : this.clone();\n }),\n (BN.prototype.isNeg = function () {\n return this.negative !== 0;\n }),\n (BN.prototype.neg = function () {\n return this.clone().ineg();\n }),\n (BN.prototype.ineg = function () {\n return this.isZero() || (this.negative ^= 1), this;\n }),\n (BN.prototype.iuor = function (num) {\n for (; this.length < num.length; ) this.words[this.length++] = 0;\n for (var i = 0; i < num.length; i++) this.words[i] = this.words[i] | num.words[i];\n return this.strip();\n }),\n (BN.prototype.ior = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuor(num);\n }),\n (BN.prototype.or = function (num) {\n return this.length > num.length ? this.clone().ior(num) : num.clone().ior(this);\n }),\n (BN.prototype.uor = function (num) {\n return this.length > num.length ? this.clone().iuor(num) : num.clone().iuor(this);\n }),\n (BN.prototype.iuand = function (num) {\n var b;\n this.length > num.length ? (b = num) : (b = this);\n for (var i = 0; i < b.length; i++) this.words[i] = this.words[i] & num.words[i];\n return (this.length = b.length), this.strip();\n }),\n (BN.prototype.iand = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuand(num);\n }),\n (BN.prototype.and = function (num) {\n return this.length > num.length ? this.clone().iand(num) : num.clone().iand(this);\n }),\n (BN.prototype.uand = function (num) {\n return this.length > num.length ? this.clone().iuand(num) : num.clone().iuand(this);\n }),\n (BN.prototype.iuxor = function (num) {\n var a, b;\n this.length > num.length ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var i = 0; i < b.length; i++) this.words[i] = a.words[i] ^ b.words[i];\n if (this !== a) for (; i < a.length; i++) this.words[i] = a.words[i];\n return (this.length = a.length), this.strip();\n }),\n (BN.prototype.ixor = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuxor(num);\n }),\n (BN.prototype.xor = function (num) {\n return this.length > num.length ? this.clone().ixor(num) : num.clone().ixor(this);\n }),\n (BN.prototype.uxor = function (num) {\n return this.length > num.length ? this.clone().iuxor(num) : num.clone().iuxor(this);\n }),\n (BN.prototype.inotn = function (width) {\n assert(typeof width == \"number\" && width >= 0);\n var bytesNeeded = Math.ceil(width / 26) | 0,\n bitsLeft = width % 26;\n this._expand(bytesNeeded), bitsLeft > 0 && bytesNeeded--;\n for (var i = 0; i < bytesNeeded; i++) this.words[i] = ~this.words[i] & 67108863;\n return bitsLeft > 0 && (this.words[i] = ~this.words[i] & (67108863 >> (26 - bitsLeft))), this.strip();\n }),\n (BN.prototype.notn = function (width) {\n return this.clone().inotn(width);\n }),\n (BN.prototype.setn = function (bit, val) {\n assert(typeof bit == \"number\" && bit >= 0);\n var off = (bit / 26) | 0,\n wbit = bit % 26;\n return (\n this._expand(off + 1),\n val\n ? (this.words[off] = this.words[off] | (1 << wbit))\n : (this.words[off] = this.words[off] & ~(1 << wbit)),\n this.strip()\n );\n }),\n (BN.prototype.iadd = function (num) {\n var r;\n if (this.negative !== 0 && num.negative === 0)\n return (this.negative = 0), (r = this.isub(num)), (this.negative ^= 1), this._normSign();\n if (this.negative === 0 && num.negative !== 0)\n return (num.negative = 0), (r = this.isub(num)), (num.negative = 1), r._normSign();\n var a, b;\n this.length > num.length ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var carry = 0, i = 0; i < b.length; i++)\n (r = (a.words[i] | 0) + (b.words[i] | 0) + carry), (this.words[i] = r & 67108863), (carry = r >>> 26);\n for (; carry !== 0 && i < a.length; i++)\n (r = (a.words[i] | 0) + carry), (this.words[i] = r & 67108863), (carry = r >>> 26);\n if (((this.length = a.length), carry !== 0)) (this.words[this.length] = carry), this.length++;\n else if (a !== this) for (; i < a.length; i++) this.words[i] = a.words[i];\n return this;\n }),\n (BN.prototype.add = function (num) {\n var res;\n return num.negative !== 0 && this.negative === 0\n ? ((num.negative = 0), (res = this.sub(num)), (num.negative ^= 1), res)\n : num.negative === 0 && this.negative !== 0\n ? ((this.negative = 0), (res = num.sub(this)), (this.negative = 1), res)\n : this.length > num.length\n ? this.clone().iadd(num)\n : num.clone().iadd(this);\n }),\n (BN.prototype.isub = function (num) {\n if (num.negative !== 0) {\n num.negative = 0;\n var r = this.iadd(num);\n return (num.negative = 1), r._normSign();\n } else if (this.negative !== 0)\n return (this.negative = 0), this.iadd(num), (this.negative = 1), this._normSign();\n var cmp = this.cmp(num);\n if (cmp === 0) return (this.negative = 0), (this.length = 1), (this.words[0] = 0), this;\n var a, b;\n cmp > 0 ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var carry = 0, i = 0; i < b.length; i++)\n (r = (a.words[i] | 0) - (b.words[i] | 0) + carry), (carry = r >> 26), (this.words[i] = r & 67108863);\n for (; carry !== 0 && i < a.length; i++)\n (r = (a.words[i] | 0) + carry), (carry = r >> 26), (this.words[i] = r & 67108863);\n if (carry === 0 && i < a.length && a !== this) for (; i < a.length; i++) this.words[i] = a.words[i];\n return (this.length = Math.max(this.length, i)), a !== this && (this.negative = 1), this.strip();\n }),\n (BN.prototype.sub = function (num) {\n return this.clone().isub(num);\n });\n function smallMulTo(self2, num, out) {\n out.negative = num.negative ^ self2.negative;\n var len = (self2.length + num.length) | 0;\n (out.length = len), (len = (len - 1) | 0);\n var a = self2.words[0] | 0,\n b = num.words[0] | 0,\n r = a * b,\n lo = r & 67108863,\n carry = (r / 67108864) | 0;\n out.words[0] = lo;\n for (var k = 1; k < len; k++) {\n for (\n var ncarry = carry >>> 26,\n rword = carry & 67108863,\n maxJ = Math.min(k, num.length - 1),\n j = Math.max(0, k - self2.length + 1);\n j <= maxJ;\n j++\n ) {\n var i = (k - j) | 0;\n (a = self2.words[i] | 0),\n (b = num.words[j] | 0),\n (r = a * b + rword),\n (ncarry += (r / 67108864) | 0),\n (rword = r & 67108863);\n }\n (out.words[k] = rword | 0), (carry = ncarry | 0);\n }\n return carry !== 0 ? (out.words[k] = carry | 0) : out.length--, out.strip();\n }\n var comb10MulTo = function (self2, num, out) {\n var a = self2.words,\n b = num.words,\n o = out.words,\n c = 0,\n lo,\n mid,\n hi,\n a0 = a[0] | 0,\n al0 = a0 & 8191,\n ah0 = a0 >>> 13,\n a1 = a[1] | 0,\n al1 = a1 & 8191,\n ah1 = a1 >>> 13,\n a2 = a[2] | 0,\n al2 = a2 & 8191,\n ah2 = a2 >>> 13,\n a3 = a[3] | 0,\n al3 = a3 & 8191,\n ah3 = a3 >>> 13,\n a4 = a[4] | 0,\n al4 = a4 & 8191,\n ah4 = a4 >>> 13,\n a5 = a[5] | 0,\n al5 = a5 & 8191,\n ah5 = a5 >>> 13,\n a6 = a[6] | 0,\n al6 = a6 & 8191,\n ah6 = a6 >>> 13,\n a7 = a[7] | 0,\n al7 = a7 & 8191,\n ah7 = a7 >>> 13,\n a8 = a[8] | 0,\n al8 = a8 & 8191,\n ah8 = a8 >>> 13,\n a9 = a[9] | 0,\n al9 = a9 & 8191,\n ah9 = a9 >>> 13,\n b0 = b[0] | 0,\n bl0 = b0 & 8191,\n bh0 = b0 >>> 13,\n b1 = b[1] | 0,\n bl1 = b1 & 8191,\n bh1 = b1 >>> 13,\n b2 = b[2] | 0,\n bl2 = b2 & 8191,\n bh2 = b2 >>> 13,\n b3 = b[3] | 0,\n bl3 = b3 & 8191,\n bh3 = b3 >>> 13,\n b4 = b[4] | 0,\n bl4 = b4 & 8191,\n bh4 = b4 >>> 13,\n b5 = b[5] | 0,\n bl5 = b5 & 8191,\n bh5 = b5 >>> 13,\n b6 = b[6] | 0,\n bl6 = b6 & 8191,\n bh6 = b6 >>> 13,\n b7 = b[7] | 0,\n bl7 = b7 & 8191,\n bh7 = b7 >>> 13,\n b8 = b[8] | 0,\n bl8 = b8 & 8191,\n bh8 = b8 >>> 13,\n b9 = b[9] | 0,\n bl9 = b9 & 8191,\n bh9 = b9 >>> 13;\n (out.negative = self2.negative ^ num.negative),\n (out.length = 19),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w0 >>> 26)) | 0),\n (w0 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w1 >>> 26)) | 0),\n (w1 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w2 >>> 26)) | 0),\n (w2 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w3 >>> 26)) | 0),\n (w3 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w4 >>> 26)) | 0),\n (w4 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w5 >>> 26)) | 0),\n (w5 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w6 >>> 26)) | 0),\n (w6 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w7 >>> 26)) | 0),\n (w7 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w8 >>> 26)) | 0),\n (w8 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w9 >>> 26)) | 0),\n (w9 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w10 >>> 26)) | 0),\n (w10 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w11 >>> 26)) | 0),\n (w11 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w12 >>> 26)) | 0),\n (w12 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w13 >>> 26)) | 0),\n (w13 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w14 >>> 26)) | 0),\n (w14 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w15 >>> 26)) | 0),\n (w15 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w16 >>> 26)) | 0),\n (w16 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w17 >>> 26)) | 0),\n (w17 &= 67108863),\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 & 8191) << 13)) | 0;\n return (\n (c = (((hi + (mid >>> 13)) | 0) + (w18 >>> 26)) | 0),\n (w18 &= 67108863),\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 c !== 0 && ((o[19] = c), out.length++),\n out\n );\n };\n Math.imul || (comb10MulTo = smallMulTo);\n function bigMulTo(self2, num, out) {\n (out.negative = num.negative ^ self2.negative), (out.length = self2.length + num.length);\n for (var carry = 0, hncarry = 0, k = 0; k < out.length - 1; k++) {\n var ncarry = hncarry;\n hncarry = 0;\n for (\n var rword = carry & 67108863, maxJ = Math.min(k, num.length - 1), j = Math.max(0, k - self2.length + 1);\n j <= maxJ;\n j++\n ) {\n var i = k - j,\n a = self2.words[i] | 0,\n b = num.words[j] | 0,\n r = a * b,\n lo = r & 67108863;\n (ncarry = (ncarry + ((r / 67108864) | 0)) | 0),\n (lo = (lo + rword) | 0),\n (rword = lo & 67108863),\n (ncarry = (ncarry + (lo >>> 26)) | 0),\n (hncarry += ncarry >>> 26),\n (ncarry &= 67108863);\n }\n (out.words[k] = rword), (carry = ncarry), (ncarry = hncarry);\n }\n return carry !== 0 ? (out.words[k] = carry) : out.length--, out.strip();\n }\n function jumboMulTo(self2, num, out) {\n var fftm = new FFTM();\n return fftm.mulp(self2, num, out);\n }\n BN.prototype.mulTo = function (num, out) {\n var res,\n len = this.length + num.length;\n return (\n this.length === 10 && num.length === 10\n ? (res = comb10MulTo(this, num, out))\n : len < 63\n ? (res = smallMulTo(this, num, out))\n : len < 1024\n ? (res = bigMulTo(this, num, out))\n : (res = jumboMulTo(this, num, out)),\n res\n );\n };\n function FFTM(x, y) {\n (this.x = x), (this.y = y);\n }\n (FFTM.prototype.makeRBT = function (N) {\n for (var t = new Array(N), l = BN.prototype._countBits(N) - 1, i = 0; i < N; i++) t[i] = this.revBin(i, l, N);\n return t;\n }),\n (FFTM.prototype.revBin = function (x, l, N) {\n if (x === 0 || x === N - 1) return x;\n for (var rb = 0, i = 0; i < l; i++) (rb |= (x & 1) << (l - i - 1)), (x >>= 1);\n return rb;\n }),\n (FFTM.prototype.permute = function (rbt, rws, iws, rtws, itws, N) {\n for (var i = 0; i < N; i++) (rtws[i] = rws[rbt[i]]), (itws[i] = iws[rbt[i]]);\n }),\n (FFTM.prototype.transform = function (rws, iws, rtws, itws, N, rbt) {\n this.permute(rbt, rws, iws, rtws, itws, N);\n for (var s = 1; s < N; s <<= 1)\n for (\n var l = s << 1, rtwdf = Math.cos((2 * Math.PI) / l), itwdf = Math.sin((2 * Math.PI) / l), p = 0;\n p < N;\n p += l\n )\n for (var rtwdf_ = rtwdf, itwdf_ = itwdf, j = 0; j < s; j++) {\n var re = rtws[p + j],\n ie = itws[p + j],\n ro = rtws[p + j + s],\n io = itws[p + j + s],\n rx = rtwdf_ * ro - itwdf_ * io;\n (io = rtwdf_ * io + itwdf_ * ro),\n (ro = rx),\n (rtws[p + j] = re + ro),\n (itws[p + j] = ie + io),\n (rtws[p + j + s] = re - ro),\n (itws[p + j + s] = ie - io),\n j !== l &&\n ((rx = rtwdf * rtwdf_ - itwdf * itwdf_), (itwdf_ = rtwdf * itwdf_ + itwdf * rtwdf_), (rtwdf_ = rx));\n }\n }),\n (FFTM.prototype.guessLen13b = function (n, m) {\n var N = Math.max(m, n) | 1,\n odd = N & 1,\n i = 0;\n for (N = (N / 2) | 0; N; N = N >>> 1) i++;\n return 1 << (i + 1 + odd);\n }),\n (FFTM.prototype.conjugate = function (rws, iws, N) {\n if (!(N <= 1))\n for (var i = 0; i < N / 2; i++) {\n var t = rws[i];\n (rws[i] = rws[N - i - 1]),\n (rws[N - i - 1] = t),\n (t = iws[i]),\n (iws[i] = -iws[N - i - 1]),\n (iws[N - i - 1] = -t);\n }\n }),\n (FFTM.prototype.normalize13b = function (ws, N) {\n for (var carry = 0, i = 0; i < N / 2; i++) {\n var w = Math.round(ws[2 * i + 1] / N) * 8192 + Math.round(ws[2 * i] / N) + carry;\n (ws[i] = w & 67108863), w < 67108864 ? (carry = 0) : (carry = (w / 67108864) | 0);\n }\n return ws;\n }),\n (FFTM.prototype.convert13b = function (ws, len, rws, N) {\n for (var carry = 0, i = 0; i < len; i++)\n (carry = carry + (ws[i] | 0)),\n (rws[2 * i] = carry & 8191),\n (carry = carry >>> 13),\n (rws[2 * i + 1] = carry & 8191),\n (carry = carry >>> 13);\n for (i = 2 * len; i < N; ++i) rws[i] = 0;\n assert(carry === 0), assert((carry & -8192) === 0);\n }),\n (FFTM.prototype.stub = function (N) {\n for (var ph = new Array(N), i = 0; i < N; i++) ph[i] = 0;\n return ph;\n }),\n (FFTM.prototype.mulp = function (x, y, out) {\n var N = 2 * this.guessLen13b(x.length, y.length),\n rbt = this.makeRBT(N),\n _ = this.stub(N),\n rws = new Array(N),\n rwst = new Array(N),\n iwst = new Array(N),\n nrws = new Array(N),\n nrwst = new Array(N),\n niwst = new Array(N),\n rmws = out.words;\n (rmws.length = N),\n this.convert13b(x.words, x.length, rws, N),\n this.convert13b(y.words, y.length, nrws, N),\n this.transform(rws, _, rwst, iwst, N, rbt),\n this.transform(nrws, _, nrwst, niwst, N, rbt);\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]), (rwst[i] = rx);\n }\n return (\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 (out.negative = x.negative ^ y.negative),\n (out.length = x.length + y.length),\n out.strip()\n );\n }),\n (BN.prototype.mul = function (num) {\n var out = new BN(null);\n return (out.words = new Array(this.length + num.length)), this.mulTo(num, out);\n }),\n (BN.prototype.mulf = function (num) {\n var out = new BN(null);\n return (out.words = new Array(this.length + num.length)), jumboMulTo(this, num, out);\n }),\n (BN.prototype.imul = function (num) {\n return this.clone().mulTo(num, this);\n }),\n (BN.prototype.imuln = function (num) {\n assert(typeof num == \"number\"), assert(num < 67108864);\n for (var carry = 0, i = 0; i < this.length; i++) {\n var w = (this.words[i] | 0) * num,\n lo = (w & 67108863) + (carry & 67108863);\n (carry >>= 26), (carry += (w / 67108864) | 0), (carry += lo >>> 26), (this.words[i] = lo & 67108863);\n }\n return carry !== 0 && ((this.words[i] = carry), this.length++), this;\n }),\n (BN.prototype.muln = function (num) {\n return this.clone().imuln(num);\n }),\n (BN.prototype.sqr = function () {\n return this.mul(this);\n }),\n (BN.prototype.isqr = function () {\n return this.imul(this.clone());\n }),\n (BN.prototype.pow = function (num) {\n var w = toBitArray(num);\n if (w.length === 0) return new BN(1);\n for (var res = this, i = 0; i < w.length && w[i] === 0; i++, res = res.sqr());\n if (++i < w.length) for (var q = res.sqr(); i < w.length; i++, q = q.sqr()) w[i] !== 0 && (res = res.mul(q));\n return res;\n }),\n (BN.prototype.iushln = function (bits) {\n assert(typeof bits == \"number\" && bits >= 0);\n var r = bits % 26,\n s = (bits - r) / 26,\n carryMask = (67108863 >>> (26 - r)) << (26 - r),\n i;\n if (r !== 0) {\n var carry = 0;\n for (i = 0; i < this.length; i++) {\n var newCarry = this.words[i] & carryMask,\n c = ((this.words[i] | 0) - newCarry) << r;\n (this.words[i] = c | carry), (carry = newCarry >>> (26 - r));\n }\n carry && ((this.words[i] = carry), this.length++);\n }\n if (s !== 0) {\n for (i = this.length - 1; i >= 0; i--) this.words[i + s] = this.words[i];\n for (i = 0; i < s; i++) this.words[i] = 0;\n this.length += s;\n }\n return this.strip();\n }),\n (BN.prototype.ishln = function (bits) {\n return assert(this.negative === 0), this.iushln(bits);\n }),\n (BN.prototype.iushrn = function (bits, hint, extended) {\n assert(typeof bits == \"number\" && bits >= 0);\n var h;\n hint ? (h = (hint - (hint % 26)) / 26) : (h = 0);\n var r = bits % 26,\n s = Math.min((bits - r) / 26, this.length),\n mask = 67108863 ^ ((67108863 >>> r) << r),\n maskedWords = extended;\n if (((h -= s), (h = Math.max(0, h)), maskedWords)) {\n for (var i = 0; i < s; i++) maskedWords.words[i] = this.words[i];\n maskedWords.length = s;\n }\n if (s !== 0)\n if (this.length > s) for (this.length -= s, i = 0; i < this.length; i++) this.words[i] = this.words[i + s];\n else (this.words[0] = 0), (this.length = 1);\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)), (carry = word & mask);\n }\n return (\n maskedWords && carry !== 0 && (maskedWords.words[maskedWords.length++] = carry),\n this.length === 0 && ((this.words[0] = 0), (this.length = 1)),\n this.strip()\n );\n }),\n (BN.prototype.ishrn = function (bits, hint, extended) {\n return assert(this.negative === 0), this.iushrn(bits, hint, extended);\n }),\n (BN.prototype.shln = function (bits) {\n return this.clone().ishln(bits);\n }),\n (BN.prototype.ushln = function (bits) {\n return this.clone().iushln(bits);\n }),\n (BN.prototype.shrn = function (bits) {\n return this.clone().ishrn(bits);\n }),\n (BN.prototype.ushrn = function (bits) {\n return this.clone().iushrn(bits);\n }),\n (BN.prototype.testn = function (bit) {\n assert(typeof bit == \"number\" && bit >= 0);\n var r = bit % 26,\n s = (bit - r) / 26,\n q = 1 << r;\n if (this.length <= s) return !1;\n var w = this.words[s];\n return !!(w & q);\n }),\n (BN.prototype.imaskn = function (bits) {\n assert(typeof bits == \"number\" && bits >= 0);\n var r = bits % 26,\n s = (bits - r) / 26;\n if ((assert(this.negative === 0, \"imaskn works only with positive numbers\"), this.length <= s)) return this;\n if ((r !== 0 && s++, (this.length = Math.min(s, this.length)), r !== 0)) {\n var mask = 67108863 ^ ((67108863 >>> r) << r);\n this.words[this.length - 1] &= mask;\n }\n return this.strip();\n }),\n (BN.prototype.maskn = function (bits) {\n return this.clone().imaskn(bits);\n }),\n (BN.prototype.iaddn = function (num) {\n return (\n assert(typeof num == \"number\"),\n assert(num < 67108864),\n num < 0\n ? this.isubn(-num)\n : this.negative !== 0\n ? this.length === 1 && (this.words[0] | 0) < num\n ? ((this.words[0] = num - (this.words[0] | 0)), (this.negative = 0), this)\n : ((this.negative = 0), this.isubn(num), (this.negative = 1), this)\n : this._iaddn(num)\n );\n }),\n (BN.prototype._iaddn = function (num) {\n this.words[0] += num;\n for (var i = 0; i < this.length && this.words[i] >= 67108864; i++)\n (this.words[i] -= 67108864), i === this.length - 1 ? (this.words[i + 1] = 1) : this.words[i + 1]++;\n return (this.length = Math.max(this.length, i + 1)), this;\n }),\n (BN.prototype.isubn = function (num) {\n if ((assert(typeof num == \"number\"), assert(num < 67108864), num < 0)) return this.iaddn(-num);\n if (this.negative !== 0) return (this.negative = 0), this.iaddn(num), (this.negative = 1), this;\n if (((this.words[0] -= num), this.length === 1 && this.words[0] < 0))\n (this.words[0] = -this.words[0]), (this.negative = 1);\n else\n for (var i = 0; i < this.length && this.words[i] < 0; i++)\n (this.words[i] += 67108864), (this.words[i + 1] -= 1);\n return this.strip();\n }),\n (BN.prototype.addn = function (num) {\n return this.clone().iaddn(num);\n }),\n (BN.prototype.subn = function (num) {\n return this.clone().isubn(num);\n }),\n (BN.prototype.iabs = function () {\n return (this.negative = 0), this;\n }),\n (BN.prototype.abs = function () {\n return this.clone().iabs();\n }),\n (BN.prototype._ishlnsubmul = function (num, mul, shift) {\n var len = num.length + shift,\n i;\n this._expand(len);\n var w,\n 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 & 67108863),\n (carry = (w >> 26) - ((right / 67108864) | 0)),\n (this.words[i + shift] = w & 67108863);\n }\n for (; i < this.length - shift; i++)\n (w = (this.words[i + shift] | 0) + carry), (carry = w >> 26), (this.words[i + shift] = w & 67108863);\n if (carry === 0) return this.strip();\n for (assert(carry === -1), carry = 0, i = 0; i < this.length; i++)\n (w = -(this.words[i] | 0) + carry), (carry = w >> 26), (this.words[i] = w & 67108863);\n return (this.negative = 1), this.strip();\n }),\n (BN.prototype._wordDiv = function (num, mode) {\n var shift = this.length - num.length,\n a = this.clone(),\n b = num,\n bhi = b.words[b.length - 1] | 0,\n bhiBits = this._countBits(bhi);\n (shift = 26 - bhiBits),\n shift !== 0 && ((b = b.ushln(shift)), a.iushln(shift), (bhi = b.words[b.length - 1] | 0));\n var m = a.length - b.length,\n q;\n if (mode !== \"mod\") {\n (q = new BN(null)), (q.length = m + 1), (q.words = new Array(q.length));\n for (var i = 0; i < q.length; i++) q.words[i] = 0;\n }\n var diff = a.clone()._ishlnsubmul(b, 1, m);\n diff.negative === 0 && ((a = diff), q && (q.words[m] = 1));\n for (var j = m - 1; j >= 0; j--) {\n var qj = (a.words[b.length + j] | 0) * 67108864 + (a.words[b.length + j - 1] | 0);\n for (qj = Math.min((qj / bhi) | 0, 67108863), a._ishlnsubmul(b, qj, j); a.negative !== 0; )\n qj--, (a.negative = 0), a._ishlnsubmul(b, 1, j), a.isZero() || (a.negative ^= 1);\n q && (q.words[j] = qj);\n }\n return (\n q && q.strip(),\n a.strip(),\n mode !== \"div\" && shift !== 0 && a.iushrn(shift),\n {\n div: q || null,\n mod: a,\n }\n );\n }),\n (BN.prototype.divmod = function (num, mode, positive) {\n if ((assert(!num.isZero()), this.isZero()))\n return {\n div: new BN(0),\n mod: new BN(0),\n };\n var div, mod, res;\n return this.negative !== 0 && num.negative === 0\n ? ((res = this.neg().divmod(num, mode)),\n mode !== \"mod\" && (div = res.div.neg()),\n mode !== \"div\" && ((mod = res.mod.neg()), positive && mod.negative !== 0 && mod.iadd(num)),\n {\n div,\n mod,\n })\n : this.negative === 0 && num.negative !== 0\n ? ((res = this.divmod(num.neg(), mode)),\n mode !== \"mod\" && (div = res.div.neg()),\n {\n div,\n mod: res.mod,\n })\n : (this.negative & num.negative) !== 0\n ? ((res = this.neg().divmod(num.neg(), mode)),\n mode !== \"div\" && ((mod = res.mod.neg()), positive && mod.negative !== 0 && mod.isub(num)),\n {\n div: res.div,\n mod,\n })\n : num.length > this.length || this.cmp(num) < 0\n ? {\n div: new BN(0),\n mod: this,\n }\n : num.length === 1\n ? mode === \"div\"\n ? {\n div: this.divn(num.words[0]),\n mod: null,\n }\n : mode === \"mod\"\n ? {\n div: null,\n mod: new BN(this.modn(num.words[0])),\n }\n : {\n div: this.divn(num.words[0]),\n mod: new BN(this.modn(num.words[0])),\n }\n : this._wordDiv(num, mode);\n }),\n (BN.prototype.div = function (num) {\n return this.divmod(num, \"div\", !1).div;\n }),\n (BN.prototype.mod = function (num) {\n return this.divmod(num, \"mod\", !1).mod;\n }),\n (BN.prototype.umod = function (num) {\n return this.divmod(num, \"mod\", !0).mod;\n }),\n (BN.prototype.divRound = function (num) {\n var dm = this.divmod(num);\n if (dm.mod.isZero()) return dm.div;\n var mod = dm.div.negative !== 0 ? dm.mod.isub(num) : dm.mod,\n half = num.ushrn(1),\n r2 = num.andln(1),\n cmp = mod.cmp(half);\n return cmp < 0 || (r2 === 1 && cmp === 0)\n ? dm.div\n : dm.div.negative !== 0\n ? dm.div.isubn(1)\n : dm.div.iaddn(1);\n }),\n (BN.prototype.modn = function (num) {\n assert(num <= 67108863);\n for (var p = (1 << 26) % num, acc = 0, i = this.length - 1; i >= 0; i--)\n acc = (p * acc + (this.words[i] | 0)) % num;\n return acc;\n }),\n (BN.prototype.idivn = function (num) {\n assert(num <= 67108863);\n for (var carry = 0, i = this.length - 1; i >= 0; i--) {\n var w = (this.words[i] | 0) + carry * 67108864;\n (this.words[i] = (w / num) | 0), (carry = w % num);\n }\n return this.strip();\n }),\n (BN.prototype.divn = function (num) {\n return this.clone().idivn(num);\n }),\n (BN.prototype.egcd = function (p) {\n assert(p.negative === 0), assert(!p.isZero());\n var x = this,\n y = p.clone();\n x.negative !== 0 ? (x = x.umod(p)) : (x = x.clone());\n for (var A = new BN(1), B = new BN(0), C = new BN(0), D = new BN(1), g = 0; x.isEven() && y.isEven(); )\n x.iushrn(1), y.iushrn(1), ++g;\n for (var yp = y.clone(), xp = x.clone(); !x.isZero(); ) {\n for (var i = 0, im = 1; (x.words[0] & im) === 0 && i < 26; ++i, im <<= 1);\n if (i > 0)\n for (x.iushrn(i); i-- > 0; )\n (A.isOdd() || B.isOdd()) && (A.iadd(yp), B.isub(xp)), A.iushrn(1), B.iushrn(1);\n for (var j = 0, jm = 1; (y.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n if (j > 0)\n for (y.iushrn(j); j-- > 0; )\n (C.isOdd() || D.isOdd()) && (C.iadd(yp), D.isub(xp)), C.iushrn(1), D.iushrn(1);\n x.cmp(y) >= 0 ? (x.isub(y), A.isub(C), B.isub(D)) : (y.isub(x), C.isub(A), D.isub(B));\n }\n return {\n a: C,\n b: D,\n gcd: y.iushln(g),\n };\n }),\n (BN.prototype._invmp = function (p) {\n assert(p.negative === 0), assert(!p.isZero());\n var a = this,\n b = p.clone();\n a.negative !== 0 ? (a = a.umod(p)) : (a = a.clone());\n for (var x1 = new BN(1), x2 = new BN(0), delta = b.clone(); 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) for (a.iushrn(i); i-- > 0; ) x1.isOdd() && x1.iadd(delta), x1.iushrn(1);\n for (var j = 0, jm = 1; (b.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n if (j > 0) for (b.iushrn(j); j-- > 0; ) x2.isOdd() && x2.iadd(delta), x2.iushrn(1);\n a.cmp(b) >= 0 ? (a.isub(b), x1.isub(x2)) : (b.isub(a), x2.isub(x1));\n }\n var res;\n return a.cmpn(1) === 0 ? (res = x1) : (res = x2), res.cmpn(0) < 0 && res.iadd(p), res;\n }),\n (BN.prototype.gcd = function (num) {\n if (this.isZero()) return num.abs();\n if (num.isZero()) return this.abs();\n var a = this.clone(),\n b = num.clone();\n (a.negative = 0), (b.negative = 0);\n for (var shift = 0; a.isEven() && b.isEven(); shift++) a.iushrn(1), b.iushrn(1);\n do {\n for (; a.isEven(); ) a.iushrn(1);\n for (; b.isEven(); ) b.iushrn(1);\n var r = a.cmp(b);\n if (r < 0) {\n var t = a;\n (a = b), (b = t);\n } else if (r === 0 || b.cmpn(1) === 0) break;\n a.isub(b);\n } while (!0);\n return b.iushln(shift);\n }),\n (BN.prototype.invm = function (num) {\n return this.egcd(num).a.umod(num);\n }),\n (BN.prototype.isEven = function () {\n return (this.words[0] & 1) === 0;\n }),\n (BN.prototype.isOdd = function () {\n return (this.words[0] & 1) === 1;\n }),\n (BN.prototype.andln = function (num) {\n return this.words[0] & num;\n }),\n (BN.prototype.bincn = function (bit) {\n assert(typeof bit == \"number\");\n var r = bit % 26,\n s = (bit - r) / 26,\n q = 1 << r;\n if (this.length <= s) return this._expand(s + 1), (this.words[s] |= q), this;\n for (var carry = q, i = s; carry !== 0 && i < this.length; i++) {\n var w = this.words[i] | 0;\n (w += carry), (carry = w >>> 26), (w &= 67108863), (this.words[i] = w);\n }\n return carry !== 0 && ((this.words[i] = carry), this.length++), this;\n }),\n (BN.prototype.isZero = function () {\n return this.length === 1 && this.words[0] === 0;\n }),\n (BN.prototype.cmpn = function (num) {\n var negative = num < 0;\n if (this.negative !== 0 && !negative) return -1;\n if (this.negative === 0 && negative) return 1;\n this.strip();\n var res;\n if (this.length > 1) res = 1;\n else {\n negative && (num = -num), assert(num <= 67108863, \"Number is too big\");\n var w = this.words[0] | 0;\n res = w === num ? 0 : w < num ? -1 : 1;\n }\n return this.negative !== 0 ? -res | 0 : res;\n }),\n (BN.prototype.cmp = function (num) {\n if (this.negative !== 0 && num.negative === 0) return -1;\n if (this.negative === 0 && num.negative !== 0) return 1;\n var res = this.ucmp(num);\n return this.negative !== 0 ? -res | 0 : res;\n }),\n (BN.prototype.ucmp = function (num) {\n if (this.length > num.length) return 1;\n if (this.length < num.length) return -1;\n for (var res = 0, i = this.length - 1; i >= 0; i--) {\n var a = this.words[i] | 0,\n b = num.words[i] | 0;\n if (a !== b) {\n a < b ? (res = -1) : a > b && (res = 1);\n break;\n }\n }\n return res;\n }),\n (BN.prototype.gtn = function (num) {\n return this.cmpn(num) === 1;\n }),\n (BN.prototype.gt = function (num) {\n return this.cmp(num) === 1;\n }),\n (BN.prototype.gten = function (num) {\n return this.cmpn(num) >= 0;\n }),\n (BN.prototype.gte = function (num) {\n return this.cmp(num) >= 0;\n }),\n (BN.prototype.ltn = function (num) {\n return this.cmpn(num) === -1;\n }),\n (BN.prototype.lt = function (num) {\n return this.cmp(num) === -1;\n }),\n (BN.prototype.lten = function (num) {\n return this.cmpn(num) <= 0;\n }),\n (BN.prototype.lte = function (num) {\n return this.cmp(num) <= 0;\n }),\n (BN.prototype.eqn = function (num) {\n return this.cmpn(num) === 0;\n }),\n (BN.prototype.eq = function (num) {\n return this.cmp(num) === 0;\n }),\n (BN.red = function (num) {\n return new Red(num);\n }),\n (BN.prototype.toRed = function (ctx) {\n return (\n assert(!this.red, \"Already a number in reduction context\"),\n assert(this.negative === 0, \"red works only with positives\"),\n ctx.convertTo(this)._forceRed(ctx)\n );\n }),\n (BN.prototype.fromRed = function () {\n return assert(this.red, \"fromRed works only with numbers in reduction context\"), this.red.convertFrom(this);\n }),\n (BN.prototype._forceRed = function (ctx) {\n return (this.red = ctx), this;\n }),\n (BN.prototype.forceRed = function (ctx) {\n return assert(!this.red, \"Already a number in reduction context\"), this._forceRed(ctx);\n }),\n (BN.prototype.redAdd = function (num) {\n return assert(this.red, \"redAdd works only with red numbers\"), this.red.add(this, num);\n }),\n (BN.prototype.redIAdd = function (num) {\n return assert(this.red, \"redIAdd works only with red numbers\"), this.red.iadd(this, num);\n }),\n (BN.prototype.redSub = function (num) {\n return assert(this.red, \"redSub works only with red numbers\"), this.red.sub(this, num);\n }),\n (BN.prototype.redISub = function (num) {\n return assert(this.red, \"redISub works only with red numbers\"), this.red.isub(this, num);\n }),\n (BN.prototype.redShl = function (num) {\n return assert(this.red, \"redShl works only with red numbers\"), this.red.shl(this, num);\n }),\n (BN.prototype.redMul = function (num) {\n return (\n assert(this.red, \"redMul works only with red numbers\"),\n this.red._verify2(this, num),\n this.red.mul(this, num)\n );\n }),\n (BN.prototype.redIMul = function (num) {\n return (\n assert(this.red, \"redMul works only with red numbers\"),\n this.red._verify2(this, num),\n this.red.imul(this, num)\n );\n }),\n (BN.prototype.redSqr = function () {\n return assert(this.red, \"redSqr works only with red numbers\"), this.red._verify1(this), this.red.sqr(this);\n }),\n (BN.prototype.redISqr = function () {\n return assert(this.red, \"redISqr works only with red numbers\"), this.red._verify1(this), this.red.isqr(this);\n }),\n (BN.prototype.redSqrt = function () {\n return assert(this.red, \"redSqrt works only with red numbers\"), this.red._verify1(this), this.red.sqrt(this);\n }),\n (BN.prototype.redInvm = function () {\n return assert(this.red, \"redInvm works only with red numbers\"), this.red._verify1(this), this.red.invm(this);\n }),\n (BN.prototype.redNeg = function () {\n return assert(this.red, \"redNeg works only with red numbers\"), this.red._verify1(this), this.red.neg(this);\n }),\n (BN.prototype.redPow = function (num) {\n return assert(this.red && !num.red, \"redPow(normalNum)\"), this.red._verify1(this), this.red.pow(this, num);\n });\n var primes = {\n k256: null,\n p224: null,\n p192: null,\n p25519: null,\n };\n function MPrime(name, p) {\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 (this.tmp = this._tmp());\n }\n (MPrime.prototype._tmp = function () {\n var tmp = new BN(null);\n return (tmp.words = new Array(Math.ceil(this.n / 13))), tmp;\n }),\n (MPrime.prototype.ireduce = function (num) {\n var r = num,\n rlen;\n do this.split(r, this.tmp), (r = this.imulK(r)), (r = r.iadd(this.tmp)), (rlen = r.bitLength());\n while (rlen > this.n);\n var cmp = rlen < this.n ? -1 : r.ucmp(this.p);\n return (\n cmp === 0\n ? ((r.words[0] = 0), (r.length = 1))\n : cmp > 0\n ? r.isub(this.p)\n : r.strip !== void 0\n ? r.strip()\n : r._strip(),\n r\n );\n }),\n (MPrime.prototype.split = function (input, out) {\n input.iushrn(this.n, 0, out);\n }),\n (MPrime.prototype.imulK = function (num) {\n return num.imul(this.k);\n });\n function K256() {\n MPrime.call(this, \"k256\", \"ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f\");\n }\n inherits(K256, MPrime),\n (K256.prototype.split = function (input, output) {\n for (var mask = 4194303, outLen = Math.min(input.length, 9), i = 0; i < outLen; i++)\n output.words[i] = input.words[i];\n if (((output.length = outLen), input.length <= 9)) {\n (input.words[0] = 0), (input.length = 1);\n return;\n }\n var prev = input.words[9];\n for (output.words[output.length++] = prev & mask, i = 10; i < input.length; i++) {\n var next = input.words[i] | 0;\n (input.words[i - 10] = ((next & mask) << 4) | (prev >>> 22)), (prev = next);\n }\n (prev >>>= 22),\n (input.words[i - 10] = prev),\n prev === 0 && input.length > 10 ? (input.length -= 10) : (input.length -= 9);\n }),\n (K256.prototype.imulK = function (num) {\n (num.words[num.length] = 0), (num.words[num.length + 1] = 0), (num.length += 2);\n for (var lo = 0, i = 0; i < num.length; i++) {\n var w = num.words[i] | 0;\n (lo += w * 977), (num.words[i] = lo & 67108863), (lo = w * 64 + ((lo / 67108864) | 0));\n }\n return (\n num.words[num.length - 1] === 0 && (num.length--, num.words[num.length - 1] === 0 && num.length--), num\n );\n });\n function P224() {\n MPrime.call(this, \"p224\", \"ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001\");\n }\n inherits(P224, MPrime);\n function P192() {\n MPrime.call(this, \"p192\", \"ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff\");\n }\n inherits(P192, MPrime);\n function P25519() {\n MPrime.call(this, \"25519\", \"7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed\");\n }\n inherits(P25519, MPrime),\n (P25519.prototype.imulK = function (num) {\n for (var carry = 0, i = 0; i < num.length; i++) {\n var hi = (num.words[i] | 0) * 19 + carry,\n lo = hi & 67108863;\n (hi >>>= 26), (num.words[i] = lo), (carry = hi);\n }\n return carry !== 0 && (num.words[num.length++] = carry), num;\n }),\n (BN._prime = function (name) {\n if (primes[name]) return primes[name];\n var prime2;\n if (name === \"k256\") prime2 = new K256();\n else if (name === \"p224\") prime2 = new P224();\n else if (name === \"p192\") prime2 = new P192();\n else if (name === \"p25519\") prime2 = new P25519();\n else throw new Error(\"Unknown prime \" + name);\n return (primes[name] = prime2), prime2;\n });\n function Red(m) {\n if (typeof m == \"string\") {\n var prime = BN._prime(m);\n (this.m = prime.p), (this.prime = prime);\n } else assert(m.gtn(1), \"modulus must be greater than 1\"), (this.m = m), (this.prime = null);\n }\n (Red.prototype._verify1 = function (a) {\n assert(a.negative === 0, \"red works only with positives\"), assert(a.red, \"red works only with red numbers\");\n }),\n (Red.prototype._verify2 = function (a, b) {\n assert((a.negative | b.negative) === 0, \"red works only with positives\"),\n assert(a.red && a.red === b.red, \"red works only with red numbers\");\n }),\n (Red.prototype.imod = function (a) {\n return this.prime ? this.prime.ireduce(a)._forceRed(this) : a.umod(this.m)._forceRed(this);\n }),\n (Red.prototype.neg = function (a) {\n return a.isZero() ? a.clone() : this.m.sub(a)._forceRed(this);\n }),\n (Red.prototype.add = function (a, b) {\n this._verify2(a, b);\n var res = a.add(b);\n return res.cmp(this.m) >= 0 && res.isub(this.m), res._forceRed(this);\n }),\n (Red.prototype.iadd = function (a, b) {\n this._verify2(a, b);\n var res = a.iadd(b);\n return res.cmp(this.m) >= 0 && res.isub(this.m), res;\n }),\n (Red.prototype.sub = function (a, b) {\n this._verify2(a, b);\n var res = a.sub(b);\n return res.cmpn(0) < 0 && res.iadd(this.m), res._forceRed(this);\n }),\n (Red.prototype.isub = function (a, b) {\n this._verify2(a, b);\n var res = a.isub(b);\n return res.cmpn(0) < 0 && res.iadd(this.m), res;\n }),\n (Red.prototype.shl = function (a, num) {\n return this._verify1(a), this.imod(a.ushln(num));\n }),\n (Red.prototype.imul = function (a, b) {\n return this._verify2(a, b), this.imod(a.imul(b));\n }),\n (Red.prototype.mul = function (a, b) {\n return this._verify2(a, b), this.imod(a.mul(b));\n }),\n (Red.prototype.isqr = function (a) {\n return this.imul(a, a.clone());\n }),\n (Red.prototype.sqr = function (a) {\n return this.mul(a, a);\n }),\n (Red.prototype.sqrt = function (a) {\n if (a.isZero()) return a.clone();\n var mod3 = this.m.andln(3);\n if ((assert(mod3 % 2 === 1), mod3 === 3)) {\n var pow = this.m.add(new BN(1)).iushrn(2);\n return this.pow(a, pow);\n }\n for (var q = this.m.subn(1), s = 0; !q.isZero() && q.andln(1) === 0; ) s++, q.iushrn(1);\n assert(!q.isZero());\n var one = new BN(1).toRed(this),\n nOne = one.redNeg(),\n lpow = this.m.subn(1).iushrn(1),\n z = this.m.bitLength();\n for (z = new BN(2 * z * z).toRed(this); this.pow(z, lpow).cmp(nOne) !== 0; ) z.redIAdd(nOne);\n for (\n var c = this.pow(z, q), r = this.pow(a, q.addn(1).iushrn(1)), t = this.pow(a, q), m = s;\n t.cmp(one) !== 0;\n\n ) {\n for (var tmp = t, i = 0; tmp.cmp(one) !== 0; i++) tmp = tmp.redSqr();\n assert(i < m);\n var b = this.pow(c, new BN(1).iushln(m - i - 1));\n (r = r.redMul(b)), (c = b.redSqr()), (t = t.redMul(c)), (m = i);\n }\n return r;\n }),\n (Red.prototype.invm = function (a) {\n var inv = a._invmp(this.m);\n return inv.negative !== 0 ? ((inv.negative = 0), this.imod(inv).redNeg()) : this.imod(inv);\n }),\n (Red.prototype.pow = function (a, num) {\n if (num.isZero()) return new BN(1).toRed(this);\n if (num.cmpn(1) === 0) return a.clone();\n var windowSize = 4,\n wnd = new Array(1 << windowSize);\n (wnd[0] = new BN(1).toRed(this)), (wnd[1] = a);\n for (var i = 2; i < wnd.length; i++) wnd[i] = this.mul(wnd[i - 1], a);\n var res = wnd[0],\n current = 0,\n currentLen = 0,\n start = num.bitLength() % 26;\n for (start === 0 && (start = 26), i = num.length - 1; i >= 0; i--) {\n for (var word = num.words[i], j = start - 1; j >= 0; j--) {\n var bit = (word >> j) & 1;\n if ((res !== wnd[0] && (res = this.sqr(res)), bit === 0 && current === 0)) {\n currentLen = 0;\n continue;\n }\n (current <<= 1),\n (current |= bit),\n currentLen++,\n !(currentLen !== windowSize && (i !== 0 || j !== 0)) &&\n ((res = this.mul(res, wnd[current])), (currentLen = 0), (current = 0));\n }\n start = 26;\n }\n return res;\n }),\n (Red.prototype.convertTo = function (num) {\n var r = num.umod(this.m);\n return r === num ? r.clone() : r;\n }),\n (Red.prototype.convertFrom = function (num) {\n var res = num.clone();\n return (res.red = null), res;\n }),\n (BN.mont = function (num) {\n return new Mont(num);\n });\n function Mont(m) {\n Red.call(this, m),\n (this.shift = this.m.bitLength()),\n this.shift % 26 !== 0 && (this.shift += 26 - (this.shift % 26)),\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 (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 (Mont.prototype.convertTo = function (num) {\n return this.imod(num.ushln(this.shift));\n }),\n (Mont.prototype.convertFrom = function (num) {\n var r = this.imod(num.mul(this.rinv));\n return (r.red = null), r;\n }),\n (Mont.prototype.imul = function (a, b) {\n if (a.isZero() || b.isZero()) return (a.words[0] = 0), (a.length = 1), a;\n var t = a.imul(b),\n c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m),\n u = t.isub(c).iushrn(this.shift),\n res = u;\n return (\n u.cmp(this.m) >= 0 ? (res = u.isub(this.m)) : u.cmpn(0) < 0 && (res = u.iadd(this.m)), res._forceRed(this)\n );\n }),\n (Mont.prototype.mul = function (a, b) {\n if (a.isZero() || b.isZero()) return new BN(0)._forceRed(this);\n var t = a.mul(b),\n c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m),\n u = t.isub(c).iushrn(this.shift),\n res = u;\n return (\n u.cmp(this.m) >= 0 ? (res = u.isub(this.m)) : u.cmpn(0) < 0 && (res = u.iadd(this.m)), res._forceRed(this)\n );\n }),\n (Mont.prototype.invm = function (a) {\n var res = this.imod(a._invmp(this.m).mul(this.r2));\n return res._forceRed(this);\n });\n })(typeof module > \"u\" || module, exports);\n },\n});\n\n// (disabled):node_modules/crypto-browserify/index.js\nvar require_crypto_browserify = __commonJS({\n \"(disabled):node_modules/crypto-browserify/index.js\"() {},\n});\n\n// node_modules/brorand/index.js\nvar require_brorand = __commonJS({\n \"node_modules/brorand/index.js\"(exports, module) {\n var r;\n module.exports = function (len) {\n return r || (r = new Rand(null)), r.generate(len);\n };\n function Rand(rand) {\n this.rand = rand;\n }\n module.exports.Rand = Rand;\n Rand.prototype.generate = function (len) {\n return this._rand(len);\n };\n Rand.prototype._rand = function (n) {\n var out = new Buffer(n);\n crypto.getRandomValues(out);\n return out;\n };\n },\n});\n\n// node_modules/miller-rabin/lib/mr.js\nvar require_mr = __commonJS({\n \"node_modules/miller-rabin/lib/mr.js\"(exports, module) {\n var bn = require_bn2(),\n brorand = require_brorand();\n function MillerRabin(rand) {\n this.rand = rand || new brorand.Rand();\n }\n module.exports = MillerRabin;\n MillerRabin.create = function (rand) {\n return new MillerRabin(rand);\n };\n MillerRabin.prototype._randbelow = function (n) {\n var len = n.bitLength(),\n min_bytes = Math.ceil(len / 8);\n do var a = new bn(this.rand.generate(min_bytes));\n while (a.cmp(n) >= 0);\n return a;\n };\n MillerRabin.prototype._randrange = function (start, stop) {\n var size = stop.sub(start);\n return start.add(this._randbelow(size));\n };\n MillerRabin.prototype.test = function (n, k, cb) {\n var len = n.bitLength(),\n red = bn.mont(n),\n rone = new bn(1).toRed(red);\n k || (k = Math.max(1, (len / 48) | 0));\n for (var n1 = n.subn(1), s = 0; !n1.testn(s); s++);\n for (var d = n.shrn(s), rn1 = n1.toRed(red), prime = !0; k > 0; k--) {\n var a = this._randrange(new bn(2), n1);\n cb && cb(a);\n var x = a.toRed(red).redPow(d);\n if (!(x.cmp(rone) === 0 || x.cmp(rn1) === 0)) {\n for (var i = 1; i < s; i++) {\n if (((x = x.redSqr()), x.cmp(rone) === 0)) return !1;\n if (x.cmp(rn1) === 0) break;\n }\n if (i === s) return !1;\n }\n }\n return prime;\n };\n MillerRabin.prototype.getDivisor = function (n, k) {\n var len = n.bitLength(),\n red = bn.mont(n),\n rone = new bn(1).toRed(red);\n k || (k = Math.max(1, (len / 48) | 0));\n for (var n1 = n.subn(1), s = 0; !n1.testn(s); s++);\n for (var d = n.shrn(s), rn1 = n1.toRed(red); k > 0; k--) {\n var a = this._randrange(new bn(2), n1),\n g = n.gcd(a);\n if (g.cmpn(1) !== 0) return g;\n var x = a.toRed(red).redPow(d);\n if (!(x.cmp(rone) === 0 || x.cmp(rn1) === 0)) {\n for (var i = 1; i < s; i++) {\n if (((x = x.redSqr()), x.cmp(rone) === 0)) return x.fromRed().subn(1).gcd(n);\n if (x.cmp(rn1) === 0) break;\n }\n if (i === s) return (x = x.redSqr()), x.fromRed().subn(1).gcd(n);\n }\n }\n return !1;\n };\n },\n});\n\n// node_modules/diffie-hellman/lib/generatePrime.js\nvar require_generatePrime = __commonJS({\n \"node_modules/diffie-hellman/lib/generatePrime.js\"(exports, module) {\n var randomBytes = require_browser();\n module.exports = findPrime;\n findPrime.simpleSieve = simpleSieve;\n findPrime.fermatTest = fermatTest;\n var BN = require_bn(),\n TWENTYFOUR = new BN(24),\n MillerRabin = require_mr(),\n millerRabin = new MillerRabin(),\n ONE = new BN(1),\n TWO = new BN(2),\n FIVE = new BN(5),\n SIXTEEN = new BN(16),\n EIGHT = new BN(8),\n TEN = new BN(10),\n THREE = new BN(3),\n SEVEN = new BN(7),\n ELEVEN = new BN(11),\n FOUR = new BN(4),\n TWELVE = new BN(12),\n primes = null;\n function _getPrimes() {\n if (primes !== null) return primes;\n var limit = 1048576,\n res = [];\n res[0] = 2;\n for (var i = 1, k = 3; k < limit; k += 2) {\n for (var sqrt = Math.ceil(Math.sqrt(k)), j = 0; j < i && res[j] <= sqrt && k % res[j] !== 0; j++);\n (i !== j && res[j] <= sqrt) || (res[i++] = k);\n }\n return (primes = res), res;\n }\n function simpleSieve(p) {\n for (var primes2 = _getPrimes(), i = 0; i < primes2.length; i++)\n if (p.modn(primes2[i]) === 0) return p.cmpn(primes2[i]) === 0;\n return !0;\n }\n function fermatTest(p) {\n var red = BN.mont(p);\n return TWO.toRed(red).redPow(p.subn(1)).fromRed().cmpn(1) === 0;\n }\n function findPrime(bits, gen) {\n if (bits < 16) return gen === 2 || gen === 5 ? new BN([140, 123]) : new BN([140, 39]);\n gen = new BN(gen);\n for (var num, n2; ; ) {\n for (num = new BN(randomBytes(Math.ceil(bits / 8))); num.bitLength() > bits; ) num.ishrn(1);\n if ((num.isEven() && num.iadd(ONE), num.testn(1) || num.iadd(TWO), gen.cmp(TWO))) {\n if (!gen.cmp(FIVE)) for (; num.mod(TEN).cmp(THREE); ) num.iadd(FOUR);\n } else for (; num.mod(TWENTYFOUR).cmp(ELEVEN); ) num.iadd(FOUR);\n if (\n ((n2 = num.shrn(1)),\n simpleSieve(n2) &&\n simpleSieve(num) &&\n fermatTest(n2) &&\n fermatTest(num) &&\n millerRabin.test(n2) &&\n millerRabin.test(num))\n )\n return num;\n }\n }\n },\n});\n\n// node_modules/diffie-hellman/lib/primes.json\nvar require_primes = __commonJS({\n \"node_modules/diffie-hellman/lib/primes.json\"(exports, module) {\n module.exports = {\n modp1: {\n gen: \"02\",\n prime:\n \"ffffffffffffffffc90fdaa22168c234c4c6628b80dc1cd129024e088a67cc74020bbea63b139b22514a08798e3404ddef9519b3cd3a431b302b0a6df25f14374fe1356d6d51c245e485b576625e7ec6f44c42e9a63a3620ffffffffffffffff\",\n },\n modp2: {\n gen: \"02\",\n prime:\n \"ffffffffffffffffc90fdaa22168c234c4c6628b80dc1cd129024e088a67cc74020bbea63b139b22514a08798e3404ddef9519b3cd3a431b302b0a6df25f14374fe1356d6d51c245e485b576625e7ec6f44c42e9a637ed6b0bff5cb6f406b7edee386bfb5a899fa5ae9f24117c4b1fe649286651ece65381ffffffffffffffff\",\n },\n modp5: {\n gen: \"02\",\n prime:\n \"ffffffffffffffffc90fdaa22168c234c4c6628b80dc1cd129024e088a67cc74020bbea63b139b22514a08798e3404ddef9519b3cd3a431b302b0a6df25f14374fe1356d6d51c245e485b576625e7ec6f44c42e9a637ed6b0bff5cb6f406b7edee386bfb5a899fa5ae9f24117c4b1fe649286651ece45b3dc2007cb8a163bf0598da48361c55d39a69163fa8fd24cf5f83655d23dca3ad961c62f356208552bb9ed529077096966d670c354e4abc9804f1746c08ca237327ffffffffffffffff\",\n },\n modp14: {\n gen: \"02\",\n prime:\n \"ffffffffffffffffc90fdaa22168c234c4c6628b80dc1cd129024e088a67cc74020bbea63b139b22514a08798e3404ddef9519b3cd3a431b302b0a6df25f14374fe1356d6d51c245e485b576625e7ec6f44c42e9a637ed6b0bff5cb6f406b7edee386bfb5a899fa5ae9f24117c4b1fe649286651ece45b3dc2007cb8a163bf0598da48361c55d39a69163fa8fd24cf5f83655d23dca3ad961c62f356208552bb9ed529077096966d670c354e4abc9804f1746c08ca18217c32905e462e36ce3be39e772c180e86039b2783a2ec07a28fb5c55df06f4c52c9de2bcbf6955817183995497cea956ae515d2261898fa051015728e5a8aacaa68ffffffffffffffff\",\n },\n modp15: {\n gen: \"02\",\n prime:\n \"ffffffffffffffffc90fdaa22168c234c4c6628b80dc1cd129024e088a67cc74020bbea63b139b22514a08798e3404ddef9519b3cd3a431b302b0a6df25f14374fe1356d6d51c245e485b576625e7ec6f44c42e9a637ed6b0bff5cb6f406b7edee386bfb5a899fa5ae9f24117c4b1fe649286651ece45b3dc2007cb8a163bf0598da48361c55d39a69163fa8fd24cf5f83655d23dca3ad961c62f356208552bb9ed529077096966d670c354e4abc9804f1746c08ca18217c32905e462e36ce3be39e772c180e86039b2783a2ec07a28fb5c55df06f4c52c9de2bcbf6955817183995497cea956ae515d2261898fa051015728e5a8aaac42dad33170d04507a33a85521abdf1cba64ecfb850458dbef0a8aea71575d060c7db3970f85a6e1e4c7abf5ae8cdb0933d71e8c94e04a25619dcee3d2261ad2ee6bf12ffa06d98a0864d87602733ec86a64521f2b18177b200cbbe117577a615d6c770988c0bad946e208e24fa074e5ab3143db5bfce0fd108e4b82d120a93ad2caffffffffffffffff\",\n },\n modp16: {\n gen: \"02\",\n prime:\n \"ffffffffffffffffc90fdaa22168c234c4c6628b80dc1cd129024e088a67cc74020bbea63b139b22514a08798e3404ddef9519b3cd3a431b302b0a6df25f14374fe1356d6d51c245e485b576625e7ec6f44c42e9a637ed6b0bff5cb6f406b7edee386bfb5a899fa5ae9f24117c4b1fe649286651ece45b3dc2007cb8a163bf0598da48361c55d39a69163fa8fd24cf5f83655d23dca3ad961c62f356208552bb9ed529077096966d670c354e4abc9804f1746c08ca18217c32905e462e36ce3be39e772c180e86039b2783a2ec07a28fb5c55df06f4c52c9de2bcbf6955817183995497cea956ae515d2261898fa051015728e5a8aaac42dad33170d04507a33a85521abdf1cba64ecfb850458dbef0a8aea71575d060c7db3970f85a6e1e4c7abf5ae8cdb0933d71e8c94e04a25619dcee3d2261ad2ee6bf12ffa06d98a0864d87602733ec86a64521f2b18177b200cbbe117577a615d6c770988c0bad946e208e24fa074e5ab3143db5bfce0fd108e4b82d120a92108011a723c12a787e6d788719a10bdba5b2699c327186af4e23c1a946834b6150bda2583e9ca2ad44ce8dbbbc2db04de8ef92e8efc141fbecaa6287c59474e6bc05d99b2964fa090c3a2233ba186515be7ed1f612970cee2d7afb81bdd762170481cd0069127d5b05aa993b4ea988d8fddc186ffb7dc90a6c08f4df435c934063199ffffffffffffffff\",\n },\n modp17: {\n gen: \"02\",\n prime:\n \"ffffffffffffffffc90fdaa22168c234c4c6628b80dc1cd129024e088a67cc74020bbea63b139b22514a08798e3404ddef9519b3cd3a431b302b0a6df25f14374fe1356d6d51c245e485b576625e7ec6f44c42e9a637ed6b0bff5cb6f406b7edee386bfb5a899fa5ae9f24117c4b1fe649286651ece45b3dc2007cb8a163bf0598da48361c55d39a69163fa8fd24cf5f83655d23dca3ad961c62f356208552bb9ed529077096966d670c354e4abc9804f1746c08ca18217c32905e462e36ce3be39e772c180e86039b2783a2ec07a28fb5c55df06f4c52c9de2bcbf6955817183995497cea956ae515d2261898fa051015728e5a8aaac42dad33170d04507a33a85521abdf1cba64ecfb850458dbef0a8aea71575d060c7db3970f85a6e1e4c7abf5ae8cdb0933d71e8c94e04a25619dcee3d2261ad2ee6bf12ffa06d98a0864d87602733ec86a64521f2b18177b200cbbe117577a615d6c770988c0bad946e208e24fa074e5ab3143db5bfce0fd108e4b82d120a92108011a723c12a787e6d788719a10bdba5b2699c327186af4e23c1a946834b6150bda2583e9ca2ad44ce8dbbbc2db04de8ef92e8efc141fbecaa6287c59474e6bc05d99b2964fa090c3a2233ba186515be7ed1f612970cee2d7afb81bdd762170481cd0069127d5b05aa993b4ea988d8fddc186ffb7dc90a6c08f4df435c93402849236c3fab4d27c7026c1d4dcb2602646dec9751e763dba37bdf8ff9406ad9e530ee5db382f413001aeb06a53ed9027d831179727b0865a8918da3edbebcf9b14ed44ce6cbaced4bb1bdb7f1447e6cc254b332051512bd7af426fb8f401378cd2bf5983ca01c64b92ecf032ea15d1721d03f482d7ce6e74fef6d55e702f46980c82b5a84031900b1c9e59e7c97fbec7e8f323a97a7e36cc88be0f1d45b7ff585ac54bd407b22b4154aacc8f6d7ebf48e1d814cc5ed20f8037e0a79715eef29be32806a1d58bb7c5da76f550aa3d8a1fbff0eb19ccb1a313d55cda56c9ec2ef29632387fe8d76e3c0468043e8f663f4860ee12bf2d5b0b7474d6e694f91e6dcc4024ffffffffffffffff\",\n },\n modp18: {\n gen: \"02\",\n prime:\n \"ffffffffffffffffc90fdaa22168c234c4c6628b80dc1cd129024e088a67cc74020bbea63b139b22514a08798e3404ddef9519b3cd3a431b302b0a6df25f14374fe1356d6d51c245e485b576625e7ec6f44c42e9a637ed6b0bff5cb6f406b7edee386bfb5a899fa5ae9f24117c4b1fe649286651ece45b3dc2007cb8a163bf0598da48361c55d39a69163fa8fd24cf5f83655d23dca3ad961c62f356208552bb9ed529077096966d670c354e4abc9804f1746c08ca18217c32905e462e36ce3be39e772c180e86039b2783a2ec07a28fb5c55df06f4c52c9de2bcbf6955817183995497cea956ae515d2261898fa051015728e5a8aaac42dad33170d04507a33a85521abdf1cba64ecfb850458dbef0a8aea71575d060c7db3970f85a6e1e4c7abf5ae8cdb0933d71e8c94e04a25619dcee3d2261ad2ee6bf12ffa06d98a0864d87602733ec86a64521f2b18177b200cbbe117577a615d6c770988c0bad946e208e24fa074e5ab3143db5bfce0fd108e4b82d120a92108011a723c12a787e6d788719a10bdba5b2699c327186af4e23c1a946834b6150bda2583e9ca2ad44ce8dbbbc2db04de8ef92e8efc141fbecaa6287c59474e6bc05d99b2964fa090c3a2233ba186515be7ed1f612970cee2d7afb81bdd762170481cd0069127d5b05aa993b4ea988d8fddc186ffb7dc90a6c08f4df435c93402849236c3fab4d27c7026c1d4dcb2602646dec9751e763dba37bdf8ff9406ad9e530ee5db382f413001aeb06a53ed9027d831179727b0865a8918da3edbebcf9b14ed44ce6cbaced4bb1bdb7f1447e6cc254b332051512bd7af426fb8f401378cd2bf5983ca01c64b92ecf032ea15d1721d03f482d7ce6e74fef6d55e702f46980c82b5a84031900b1c9e59e7c97fbec7e8f323a97a7e36cc88be0f1d45b7ff585ac54bd407b22b4154aacc8f6d7ebf48e1d814cc5ed20f8037e0a79715eef29be32806a1d58bb7c5da76f550aa3d8a1fbff0eb19ccb1a313d55cda56c9ec2ef29632387fe8d76e3c0468043e8f663f4860ee12bf2d5b0b7474d6e694f91e6dbe115974a3926f12fee5e438777cb6a932df8cd8bec4d073b931ba3bc832b68d9dd300741fa7bf8afc47ed2576f6936ba424663aab639c5ae4f5683423b4742bf1c978238f16cbe39d652de3fdb8befc848ad922222e04a4037c0713eb57a81a23f0c73473fc646cea306b4bcbc8862f8385ddfa9d4b7fa2c087e879683303ed5bdd3a062b3cf5b3a278a66d2a13f83f44f82ddf310ee074ab6a364597e899a0255dc164f31cc50846851df9ab48195ded7ea1b1d510bd7ee74d73faf36bc31ecfa268359046f4eb879f924009438b481c6cd7889a002ed5ee382bc9190da6fc026e479558e4475677e9aa9e3050e2765694dfc81f56e880b96e7160c980dd98edd3dfffffffffffffffff\",\n },\n };\n },\n});\n\n// node_modules/diffie-hellman/lib/dh.js\nvar require_dh = __commonJS({\n \"node_modules/diffie-hellman/lib/dh.js\"(exports, module) {\n var BN = require_bn(),\n MillerRabin = require_mr(),\n millerRabin = new MillerRabin(),\n TWENTYFOUR = new BN(24),\n ELEVEN = new BN(11),\n TEN = new BN(10),\n THREE = new BN(3),\n SEVEN = new BN(7),\n primes = require_generatePrime(),\n randomBytes = require_browser();\n module.exports = DH;\n function setPublicKey(pub, enc) {\n return (\n (enc = enc || \"utf8\"), Buffer.isBuffer(pub) || (pub = new Buffer(pub, enc)), (this._pub = new BN(pub)), this\n );\n }\n function setPrivateKey(priv, enc) {\n return (\n (enc = enc || \"utf8\"),\n Buffer.isBuffer(priv) || (priv = new Buffer(priv, enc)),\n (this._priv = new BN(priv)),\n this\n );\n }\n var primeCache = {};\n function checkPrime(prime, generator) {\n var gen = generator.toString(\"hex\"),\n hex = [gen, prime.toString(16)].join(\"_\");\n if (hex in primeCache) return primeCache[hex];\n var error = 0;\n if (prime.isEven() || !primes.simpleSieve || !primes.fermatTest(prime) || !millerRabin.test(prime))\n return (\n (error += 1), gen === \"02\" || gen === \"05\" ? (error += 8) : (error += 4), (primeCache[hex] = error), error\n );\n millerRabin.test(prime.shrn(1)) || (error += 2);\n var rem;\n switch (gen) {\n case \"02\":\n prime.mod(TWENTYFOUR).cmp(ELEVEN) && (error += 8);\n break;\n case \"05\":\n (rem = prime.mod(TEN)), rem.cmp(THREE) && rem.cmp(SEVEN) && (error += 8);\n break;\n default:\n error += 4;\n }\n return (primeCache[hex] = error), error;\n }\n function DH(prime, generator, malleable) {\n this.setGenerator(generator),\n (this.__prime = new BN(prime)),\n (this._prime = BN.mont(this.__prime)),\n (this._primeLen = prime.length),\n (this._pub = void 0),\n (this._priv = void 0),\n (this._primeCode = void 0),\n malleable ? ((this.setPublicKey = setPublicKey), (this.setPrivateKey = setPrivateKey)) : (this._primeCode = 8);\n }\n Object.defineProperty(DH.prototype, \"verifyError\", {\n enumerable: !0,\n get: function () {\n return (\n typeof this._primeCode != \"number\" && (this._primeCode = checkPrime(this.__prime, this.__gen)),\n this._primeCode\n );\n },\n });\n DH.prototype.generateKeys = function () {\n return (\n this._priv || (this._priv = new BN(randomBytes(this._primeLen))),\n (this._pub = this._gen.toRed(this._prime).redPow(this._priv).fromRed()),\n this.getPublicKey()\n );\n };\n DH.prototype.computeSecret = function (other) {\n (other = new BN(other)), (other = other.toRed(this._prime));\n var secret = other.redPow(this._priv).fromRed(),\n out = new Buffer(secret.toArray()),\n prime = this.getPrime();\n if (out.length < prime.length) {\n var front = new Buffer(prime.length - out.length);\n front.fill(0), (out = Buffer.concat([front, out]));\n }\n return out;\n };\n DH.prototype.getPublicKey = function (enc) {\n return formatReturnValue(this._pub, enc);\n };\n DH.prototype.getPrivateKey = function (enc) {\n return formatReturnValue(this._priv, enc);\n };\n DH.prototype.getPrime = function (enc) {\n return formatReturnValue(this.__prime, enc);\n };\n DH.prototype.getGenerator = function (enc) {\n return formatReturnValue(this._gen, enc);\n };\n DH.prototype.setGenerator = function (gen, enc) {\n return (\n (enc = enc || \"utf8\"),\n Buffer.isBuffer(gen) || (gen = new Buffer(gen, enc)),\n (this.__gen = gen),\n (this._gen = new BN(gen)),\n this\n );\n };\n function formatReturnValue(bn, enc) {\n var buf = new Buffer(bn.toArray());\n return enc ? buf.toString(enc) : buf;\n }\n },\n});\n\n// node_modules/diffie-hellman/browser.js\nvar require_browser7 = __commonJS({\n \"node_modules/diffie-hellman/browser.js\"(exports) {\n var generatePrime = require_generatePrime(),\n primes = require_primes(),\n DH = require_dh();\n function getDiffieHellman(mod) {\n var prime = new Buffer(primes[mod].prime, \"hex\"),\n gen = new Buffer(primes[mod].gen, \"hex\");\n return new DH(prime, gen);\n }\n var ENCODINGS = {\n binary: !0,\n hex: !0,\n base64: !0,\n };\n function createDiffieHellman(prime, enc, generator, genc) {\n return Buffer.isBuffer(enc) || ENCODINGS[enc] === void 0\n ? createDiffieHellman(prime, \"binary\", enc, generator)\n : ((enc = enc || \"binary\"),\n (genc = genc || \"binary\"),\n (generator = generator || new Buffer([2])),\n Buffer.isBuffer(generator) || (generator = new Buffer(generator, genc)),\n typeof prime == \"number\"\n ? new DH(generatePrime(prime, generator), generator, !0)\n : (Buffer.isBuffer(prime) || (prime = new Buffer(prime, enc)), new DH(prime, generator, !0)));\n }\n exports.DiffieHellmanGroup = exports.createDiffieHellmanGroup = exports.getDiffieHellman = getDiffieHellman;\n exports.createDiffieHellman = exports.DiffieHellman = createDiffieHellman;\n },\n});\n\n// node_modules/bn.js/lib/bn.js\nvar require_bn3 = __commonJS({\n \"node_modules/bn.js/lib/bn.js\"(exports, module) {\n (function (module2, exports2) {\n \"use strict\";\n function assert(val, msg) {\n if (!val) throw new Error(msg || \"Assertion failed\");\n }\n function inherits(ctor, superCtor) {\n ctor.super_ = superCtor;\n var TempCtor = function () {};\n (TempCtor.prototype = superCtor.prototype),\n (ctor.prototype = new TempCtor()),\n (ctor.prototype.constructor = ctor);\n }\n function BN(number, base, endian) {\n if (BN.isBN(number)) return number;\n (this.negative = 0),\n (this.words = null),\n (this.length = 0),\n (this.red = null),\n number !== null &&\n ((base === \"le\" || base === \"be\") && ((endian = base), (base = 10)),\n this._init(number || 0, base || 10, endian || \"be\"));\n }\n typeof module2 == \"object\" ? (module2.exports = BN) : (exports2.BN = BN), (BN.BN = BN), (BN.wordSize = 26);\n var Buffer2;\n try {\n typeof window < \"u\" && typeof window.Buffer < \"u\"\n ? (Buffer2 = window.Buffer)\n : (Buffer2 = __require(\"buffer\").Buffer);\n } catch {}\n (BN.isBN = function (num) {\n return num instanceof BN\n ? !0\n : num !== null &&\n typeof num == \"object\" &&\n num.constructor.wordSize === BN.wordSize &&\n Array.isArray(num.words);\n }),\n (BN.max = function (left, right) {\n return left.cmp(right) > 0 ? left : right;\n }),\n (BN.min = function (left, right) {\n return left.cmp(right) < 0 ? left : right;\n }),\n (BN.prototype._init = function (number, base, endian) {\n if (typeof number == \"number\") return this._initNumber(number, base, endian);\n if (typeof number == \"object\") return this._initArray(number, base, endian);\n base === \"hex\" && (base = 16),\n assert(base === (base | 0) && base >= 2 && base <= 36),\n (number = number.toString().replace(/\\s+/g, \"\"));\n var start = 0;\n number[0] === \"-\" && (start++, (this.negative = 1)),\n start < number.length &&\n (base === 16\n ? this._parseHex(number, start, endian)\n : (this._parseBase(number, base, start),\n endian === \"le\" && this._initArray(this.toArray(), base, endian)));\n }),\n (BN.prototype._initNumber = function (number, base, endian) {\n number < 0 && ((this.negative = 1), (number = -number)),\n number < 67108864\n ? ((this.words = [number & 67108863]), (this.length = 1))\n : number < 4503599627370496\n ? ((this.words = [number & 67108863, (number / 67108864) & 67108863]), (this.length = 2))\n : (assert(number < 9007199254740992),\n (this.words = [number & 67108863, (number / 67108864) & 67108863, 1]),\n (this.length = 3)),\n endian === \"le\" && this._initArray(this.toArray(), base, endian);\n }),\n (BN.prototype._initArray = function (number, base, endian) {\n if ((assert(typeof number.length == \"number\"), number.length <= 0))\n return (this.words = [0]), (this.length = 1), this;\n (this.length = Math.ceil(number.length / 3)), (this.words = new Array(this.length));\n for (var i = 0; i < this.length; i++) this.words[i] = 0;\n var j,\n w,\n off = 0;\n if (endian === \"be\")\n for (i = number.length - 1, j = 0; i >= 0; i -= 3)\n (w = number[i] | (number[i - 1] << 8) | (number[i - 2] << 16)),\n (this.words[j] |= (w << off) & 67108863),\n (this.words[j + 1] = (w >>> (26 - off)) & 67108863),\n (off += 24),\n off >= 26 && ((off -= 26), j++);\n else if (endian === \"le\")\n for (i = 0, j = 0; i < number.length; i += 3)\n (w = number[i] | (number[i + 1] << 8) | (number[i + 2] << 16)),\n (this.words[j] |= (w << off) & 67108863),\n (this.words[j + 1] = (w >>> (26 - off)) & 67108863),\n (off += 24),\n off >= 26 && ((off -= 26), j++);\n return this._strip();\n });\n function parseHex4Bits(string, index) {\n var c = string.charCodeAt(index);\n if (c >= 48 && c <= 57) return c - 48;\n if (c >= 65 && c <= 70) return c - 55;\n if (c >= 97 && c <= 102) return c - 87;\n assert(!1, \"Invalid character in \" + string);\n }\n function parseHexByte(string, lowerBound, index) {\n var r = parseHex4Bits(string, index);\n return index - 1 >= lowerBound && (r |= parseHex4Bits(string, index - 1) << 4), r;\n }\n BN.prototype._parseHex = function (number, start, endian) {\n (this.length = Math.ceil((number.length - start) / 6)), (this.words = new Array(this.length));\n for (var i = 0; i < this.length; i++) this.words[i] = 0;\n var off = 0,\n j = 0,\n w;\n if (endian === \"be\")\n for (i = number.length - 1; i >= start; i -= 2)\n (w = parseHexByte(number, start, i) << off),\n (this.words[j] |= w & 67108863),\n off >= 18 ? ((off -= 18), (j += 1), (this.words[j] |= w >>> 26)) : (off += 8);\n else {\n var parseLength = number.length - start;\n for (i = parseLength % 2 === 0 ? start + 1 : start; i < number.length; i += 2)\n (w = parseHexByte(number, start, i) << off),\n (this.words[j] |= w & 67108863),\n off >= 18 ? ((off -= 18), (j += 1), (this.words[j] |= w >>> 26)) : (off += 8);\n }\n this._strip();\n };\n function parseBase(str, start, end, mul) {\n for (var r = 0, b = 0, len = Math.min(str.length, end), i = start; i < len; i++) {\n var c = str.charCodeAt(i) - 48;\n (r *= mul),\n c >= 49 ? (b = c - 49 + 10) : c >= 17 ? (b = c - 17 + 10) : (b = c),\n assert(c >= 0 && b < mul, \"Invalid character\"),\n (r += b);\n }\n return r;\n }\n (BN.prototype._parseBase = function (number, base, start) {\n (this.words = [0]), (this.length = 1);\n for (var limbLen = 0, limbPow = 1; limbPow <= 67108863; limbPow *= base) limbLen++;\n limbLen--, (limbPow = (limbPow / base) | 0);\n for (\n var total = number.length - start,\n mod = total % limbLen,\n end = Math.min(total, total - mod) + start,\n word = 0,\n i = start;\n i < end;\n i += limbLen\n )\n (word = parseBase(number, i, i + limbLen, base)),\n this.imuln(limbPow),\n this.words[0] + word < 67108864 ? (this.words[0] += word) : this._iaddn(word);\n if (mod !== 0) {\n var pow = 1;\n for (word = parseBase(number, i, number.length, base), i = 0; i < mod; i++) pow *= base;\n this.imuln(pow), this.words[0] + word < 67108864 ? (this.words[0] += word) : this._iaddn(word);\n }\n this._strip();\n }),\n (BN.prototype.copy = function (dest) {\n dest.words = new Array(this.length);\n for (var i = 0; i < this.length; i++) dest.words[i] = this.words[i];\n (dest.length = this.length), (dest.negative = this.negative), (dest.red = this.red);\n });\n function move(dest, src) {\n (dest.words = src.words), (dest.length = src.length), (dest.negative = src.negative), (dest.red = src.red);\n }\n if (\n ((BN.prototype._move = function (dest) {\n move(dest, this);\n }),\n (BN.prototype.clone = function () {\n var r = new BN(null);\n return this.copy(r), r;\n }),\n (BN.prototype._expand = function (size) {\n for (; this.length < size; ) this.words[this.length++] = 0;\n return this;\n }),\n (BN.prototype._strip = function () {\n for (; this.length > 1 && this.words[this.length - 1] === 0; ) this.length--;\n return this._normSign();\n }),\n (BN.prototype._normSign = function () {\n return this.length === 1 && this.words[0] === 0 && (this.negative = 0), this;\n }),\n typeof Symbol < \"u\" && typeof Symbol.for == \"function\")\n )\n try {\n BN.prototype[Symbol.for(\"nodejs.util.inspect.custom\")] = inspect;\n } catch {\n BN.prototype.inspect = inspect;\n }\n else BN.prototype.inspect = inspect;\n function inspect() {\n return (this.red ? \"<BN-R: \" : \"<BN: \") + this.toString(16) + \">\";\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 groupSizes = [\n 0, 0, 25, 16, 12, 11, 10, 9, 8, 8, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5,\n 5, 5,\n ],\n groupBases = [\n 0, 0, 33554432, 43046721, 16777216, 48828125, 60466176, 40353607, 16777216, 43046721, 1e7, 19487171, 35831808,\n 62748517, 7529536, 11390625, 16777216, 24137569, 34012224, 47045881, 64e6, 4084101, 5153632, 6436343, 7962624,\n 9765625, 11881376, 14348907, 17210368, 20511149, 243e5, 28629151, 33554432, 39135393, 45435424, 52521875,\n 60466176,\n ];\n (BN.prototype.toString = function (base, padding) {\n (base = base || 10), (padding = padding | 0 || 1);\n var out;\n if (base === 16 || base === \"hex\") {\n out = \"\";\n for (var off = 0, carry = 0, i = 0; i < this.length; i++) {\n var w = this.words[i],\n word = (((w << off) | carry) & 16777215).toString(16);\n (carry = (w >>> (24 - off)) & 16777215),\n (off += 2),\n off >= 26 && ((off -= 26), i--),\n carry !== 0 || i !== this.length - 1 ? (out = zeros[6 - word.length] + word + out) : (out = word + out);\n }\n for (carry !== 0 && (out = carry.toString(16) + out); out.length % padding !== 0; ) out = \"0\" + out;\n return this.negative !== 0 && (out = \"-\" + out), out;\n }\n if (base === (base | 0) && base >= 2 && base <= 36) {\n var groupSize = groupSizes[base],\n groupBase = groupBases[base];\n out = \"\";\n var c = this.clone();\n for (c.negative = 0; !c.isZero(); ) {\n var r = c.modrn(groupBase).toString(base);\n (c = c.idivn(groupBase)), c.isZero() ? (out = r + out) : (out = zeros[groupSize - r.length] + r + out);\n }\n for (this.isZero() && (out = \"0\" + out); out.length % padding !== 0; ) out = \"0\" + out;\n return this.negative !== 0 && (out = \"-\" + out), out;\n }\n assert(!1, \"Base should be between 2 and 36\");\n }),\n (BN.prototype.toNumber = function () {\n var ret = this.words[0];\n return (\n this.length === 2\n ? (ret += this.words[1] * 67108864)\n : this.length === 3 && this.words[2] === 1\n ? (ret += 4503599627370496 + this.words[1] * 67108864)\n : this.length > 2 && assert(!1, \"Number can only safely store up to 53 bits\"),\n this.negative !== 0 ? -ret : ret\n );\n }),\n (BN.prototype.toJSON = function () {\n return this.toString(16, 2);\n }),\n Buffer2 &&\n (BN.prototype.toBuffer = function (endian, length) {\n return this.toArrayLike(Buffer2, endian, length);\n }),\n (BN.prototype.toArray = function (endian, length) {\n return this.toArrayLike(Array, endian, length);\n });\n var allocate = function (ArrayType, size) {\n return ArrayType.allocUnsafe ? ArrayType.allocUnsafe(size) : new ArrayType(size);\n };\n (BN.prototype.toArrayLike = function (ArrayType, endian, length) {\n this._strip();\n var byteLength = this.byteLength(),\n 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 var res = allocate(ArrayType, reqLength),\n postfix = endian === \"le\" ? \"LE\" : \"BE\";\n return this[\"_toArrayLike\" + postfix](res, byteLength), res;\n }),\n (BN.prototype._toArrayLikeLE = function (res, byteLength) {\n for (var position = 0, carry = 0, i = 0, shift = 0; i < this.length; i++) {\n var word = (this.words[i] << shift) | carry;\n (res[position++] = word & 255),\n position < res.length && (res[position++] = (word >> 8) & 255),\n position < res.length && (res[position++] = (word >> 16) & 255),\n shift === 6\n ? (position < res.length && (res[position++] = (word >> 24) & 255), (carry = 0), (shift = 0))\n : ((carry = word >>> 24), (shift += 2));\n }\n if (position < res.length) for (res[position++] = carry; position < res.length; ) res[position++] = 0;\n }),\n (BN.prototype._toArrayLikeBE = function (res, byteLength) {\n for (var position = res.length - 1, carry = 0, i = 0, shift = 0; i < this.length; i++) {\n var word = (this.words[i] << shift) | carry;\n (res[position--] = word & 255),\n position >= 0 && (res[position--] = (word >> 8) & 255),\n position >= 0 && (res[position--] = (word >> 16) & 255),\n shift === 6\n ? (position >= 0 && (res[position--] = (word >> 24) & 255), (carry = 0), (shift = 0))\n : ((carry = word >>> 24), (shift += 2));\n }\n if (position >= 0) for (res[position--] = carry; position >= 0; ) res[position--] = 0;\n }),\n Math.clz32\n ? (BN.prototype._countBits = function (w) {\n return 32 - Math.clz32(w);\n })\n : (BN.prototype._countBits = function (w) {\n var t = w,\n r = 0;\n return (\n t >= 4096 && ((r += 13), (t >>>= 13)),\n t >= 64 && ((r += 7), (t >>>= 7)),\n t >= 8 && ((r += 4), (t >>>= 4)),\n t >= 2 && ((r += 2), (t >>>= 2)),\n r + t\n );\n }),\n (BN.prototype._zeroBits = function (w) {\n if (w === 0) return 26;\n var t = w,\n r = 0;\n return (\n (t & 8191) === 0 && ((r += 13), (t >>>= 13)),\n (t & 127) === 0 && ((r += 7), (t >>>= 7)),\n (t & 15) === 0 && ((r += 4), (t >>>= 4)),\n (t & 3) === 0 && ((r += 2), (t >>>= 2)),\n (t & 1) === 0 && r++,\n r\n );\n }),\n (BN.prototype.bitLength = function () {\n var w = this.words[this.length - 1],\n hi = this._countBits(w);\n return (this.length - 1) * 26 + hi;\n });\n function toBitArray(num) {\n for (var w = new Array(num.bitLength()), bit = 0; bit < w.length; bit++) {\n var off = (bit / 26) | 0,\n wbit = bit % 26;\n w[bit] = (num.words[off] >>> wbit) & 1;\n }\n return w;\n }\n (BN.prototype.zeroBits = function () {\n if (this.isZero()) return 0;\n for (var r = 0, i = 0; i < this.length; i++) {\n var b = this._zeroBits(this.words[i]);\n if (((r += b), b !== 26)) break;\n }\n return r;\n }),\n (BN.prototype.byteLength = function () {\n return Math.ceil(this.bitLength() / 8);\n }),\n (BN.prototype.toTwos = function (width) {\n return this.negative !== 0 ? this.abs().inotn(width).iaddn(1) : this.clone();\n }),\n (BN.prototype.fromTwos = function (width) {\n return this.testn(width - 1) ? this.notn(width).iaddn(1).ineg() : this.clone();\n }),\n (BN.prototype.isNeg = function () {\n return this.negative !== 0;\n }),\n (BN.prototype.neg = function () {\n return this.clone().ineg();\n }),\n (BN.prototype.ineg = function () {\n return this.isZero() || (this.negative ^= 1), this;\n }),\n (BN.prototype.iuor = function (num) {\n for (; this.length < num.length; ) this.words[this.length++] = 0;\n for (var i = 0; i < num.length; i++) this.words[i] = this.words[i] | num.words[i];\n return this._strip();\n }),\n (BN.prototype.ior = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuor(num);\n }),\n (BN.prototype.or = function (num) {\n return this.length > num.length ? this.clone().ior(num) : num.clone().ior(this);\n }),\n (BN.prototype.uor = function (num) {\n return this.length > num.length ? this.clone().iuor(num) : num.clone().iuor(this);\n }),\n (BN.prototype.iuand = function (num) {\n var b;\n this.length > num.length ? (b = num) : (b = this);\n for (var i = 0; i < b.length; i++) this.words[i] = this.words[i] & num.words[i];\n return (this.length = b.length), this._strip();\n }),\n (BN.prototype.iand = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuand(num);\n }),\n (BN.prototype.and = function (num) {\n return this.length > num.length ? this.clone().iand(num) : num.clone().iand(this);\n }),\n (BN.prototype.uand = function (num) {\n return this.length > num.length ? this.clone().iuand(num) : num.clone().iuand(this);\n }),\n (BN.prototype.iuxor = function (num) {\n var a, b;\n this.length > num.length ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var i = 0; i < b.length; i++) this.words[i] = a.words[i] ^ b.words[i];\n if (this !== a) for (; i < a.length; i++) this.words[i] = a.words[i];\n return (this.length = a.length), this._strip();\n }),\n (BN.prototype.ixor = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuxor(num);\n }),\n (BN.prototype.xor = function (num) {\n return this.length > num.length ? this.clone().ixor(num) : num.clone().ixor(this);\n }),\n (BN.prototype.uxor = function (num) {\n return this.length > num.length ? this.clone().iuxor(num) : num.clone().iuxor(this);\n }),\n (BN.prototype.inotn = function (width) {\n assert(typeof width == \"number\" && width >= 0);\n var bytesNeeded = Math.ceil(width / 26) | 0,\n bitsLeft = width % 26;\n this._expand(bytesNeeded), bitsLeft > 0 && bytesNeeded--;\n for (var i = 0; i < bytesNeeded; i++) this.words[i] = ~this.words[i] & 67108863;\n return bitsLeft > 0 && (this.words[i] = ~this.words[i] & (67108863 >> (26 - bitsLeft))), this._strip();\n }),\n (BN.prototype.notn = function (width) {\n return this.clone().inotn(width);\n }),\n (BN.prototype.setn = function (bit, val) {\n assert(typeof bit == \"number\" && bit >= 0);\n var off = (bit / 26) | 0,\n wbit = bit % 26;\n return (\n this._expand(off + 1),\n val\n ? (this.words[off] = this.words[off] | (1 << wbit))\n : (this.words[off] = this.words[off] & ~(1 << wbit)),\n this._strip()\n );\n }),\n (BN.prototype.iadd = function (num) {\n var r;\n if (this.negative !== 0 && num.negative === 0)\n return (this.negative = 0), (r = this.isub(num)), (this.negative ^= 1), this._normSign();\n if (this.negative === 0 && num.negative !== 0)\n return (num.negative = 0), (r = this.isub(num)), (num.negative = 1), r._normSign();\n var a, b;\n this.length > num.length ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var carry = 0, i = 0; i < b.length; i++)\n (r = (a.words[i] | 0) + (b.words[i] | 0) + carry), (this.words[i] = r & 67108863), (carry = r >>> 26);\n for (; carry !== 0 && i < a.length; i++)\n (r = (a.words[i] | 0) + carry), (this.words[i] = r & 67108863), (carry = r >>> 26);\n if (((this.length = a.length), carry !== 0)) (this.words[this.length] = carry), this.length++;\n else if (a !== this) for (; i < a.length; i++) this.words[i] = a.words[i];\n return this;\n }),\n (BN.prototype.add = function (num) {\n var res;\n return num.negative !== 0 && this.negative === 0\n ? ((num.negative = 0), (res = this.sub(num)), (num.negative ^= 1), res)\n : num.negative === 0 && this.negative !== 0\n ? ((this.negative = 0), (res = num.sub(this)), (this.negative = 1), res)\n : this.length > num.length\n ? this.clone().iadd(num)\n : num.clone().iadd(this);\n }),\n (BN.prototype.isub = function (num) {\n if (num.negative !== 0) {\n num.negative = 0;\n var r = this.iadd(num);\n return (num.negative = 1), r._normSign();\n } else if (this.negative !== 0)\n return (this.negative = 0), this.iadd(num), (this.negative = 1), this._normSign();\n var cmp = this.cmp(num);\n if (cmp === 0) return (this.negative = 0), (this.length = 1), (this.words[0] = 0), this;\n var a, b;\n cmp > 0 ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var carry = 0, i = 0; i < b.length; i++)\n (r = (a.words[i] | 0) - (b.words[i] | 0) + carry), (carry = r >> 26), (this.words[i] = r & 67108863);\n for (; carry !== 0 && i < a.length; i++)\n (r = (a.words[i] | 0) + carry), (carry = r >> 26), (this.words[i] = r & 67108863);\n if (carry === 0 && i < a.length && a !== this) for (; i < a.length; i++) this.words[i] = a.words[i];\n return (this.length = Math.max(this.length, i)), a !== this && (this.negative = 1), this._strip();\n }),\n (BN.prototype.sub = function (num) {\n return this.clone().isub(num);\n });\n function smallMulTo(self2, num, out) {\n out.negative = num.negative ^ self2.negative;\n var len = (self2.length + num.length) | 0;\n (out.length = len), (len = (len - 1) | 0);\n var a = self2.words[0] | 0,\n b = num.words[0] | 0,\n r = a * b,\n lo = r & 67108863,\n carry = (r / 67108864) | 0;\n out.words[0] = lo;\n for (var k = 1; k < len; k++) {\n for (\n var ncarry = carry >>> 26,\n rword = carry & 67108863,\n maxJ = Math.min(k, num.length - 1),\n j = Math.max(0, k - self2.length + 1);\n j <= maxJ;\n j++\n ) {\n var i = (k - j) | 0;\n (a = self2.words[i] | 0),\n (b = num.words[j] | 0),\n (r = a * b + rword),\n (ncarry += (r / 67108864) | 0),\n (rword = r & 67108863);\n }\n (out.words[k] = rword | 0), (carry = ncarry | 0);\n }\n return carry !== 0 ? (out.words[k] = carry | 0) : out.length--, out._strip();\n }\n var comb10MulTo = function (self2, num, out) {\n var a = self2.words,\n b = num.words,\n o = out.words,\n c = 0,\n lo,\n mid,\n hi,\n a0 = a[0] | 0,\n al0 = a0 & 8191,\n ah0 = a0 >>> 13,\n a1 = a[1] | 0,\n al1 = a1 & 8191,\n ah1 = a1 >>> 13,\n a2 = a[2] | 0,\n al2 = a2 & 8191,\n ah2 = a2 >>> 13,\n a3 = a[3] | 0,\n al3 = a3 & 8191,\n ah3 = a3 >>> 13,\n a4 = a[4] | 0,\n al4 = a4 & 8191,\n ah4 = a4 >>> 13,\n a5 = a[5] | 0,\n al5 = a5 & 8191,\n ah5 = a5 >>> 13,\n a6 = a[6] | 0,\n al6 = a6 & 8191,\n ah6 = a6 >>> 13,\n a7 = a[7] | 0,\n al7 = a7 & 8191,\n ah7 = a7 >>> 13,\n a8 = a[8] | 0,\n al8 = a8 & 8191,\n ah8 = a8 >>> 13,\n a9 = a[9] | 0,\n al9 = a9 & 8191,\n ah9 = a9 >>> 13,\n b0 = b[0] | 0,\n bl0 = b0 & 8191,\n bh0 = b0 >>> 13,\n b1 = b[1] | 0,\n bl1 = b1 & 8191,\n bh1 = b1 >>> 13,\n b2 = b[2] | 0,\n bl2 = b2 & 8191,\n bh2 = b2 >>> 13,\n b3 = b[3] | 0,\n bl3 = b3 & 8191,\n bh3 = b3 >>> 13,\n b4 = b[4] | 0,\n bl4 = b4 & 8191,\n bh4 = b4 >>> 13,\n b5 = b[5] | 0,\n bl5 = b5 & 8191,\n bh5 = b5 >>> 13,\n b6 = b[6] | 0,\n bl6 = b6 & 8191,\n bh6 = b6 >>> 13,\n b7 = b[7] | 0,\n bl7 = b7 & 8191,\n bh7 = b7 >>> 13,\n b8 = b[8] | 0,\n bl8 = b8 & 8191,\n bh8 = b8 >>> 13,\n b9 = b[9] | 0,\n bl9 = b9 & 8191,\n bh9 = b9 >>> 13;\n (out.negative = self2.negative ^ num.negative),\n (out.length = 19),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w0 >>> 26)) | 0),\n (w0 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w1 >>> 26)) | 0),\n (w1 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w2 >>> 26)) | 0),\n (w2 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w3 >>> 26)) | 0),\n (w3 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w4 >>> 26)) | 0),\n (w4 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w5 >>> 26)) | 0),\n (w5 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w6 >>> 26)) | 0),\n (w6 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w7 >>> 26)) | 0),\n (w7 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w8 >>> 26)) | 0),\n (w8 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w9 >>> 26)) | 0),\n (w9 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w10 >>> 26)) | 0),\n (w10 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w11 >>> 26)) | 0),\n (w11 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w12 >>> 26)) | 0),\n (w12 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w13 >>> 26)) | 0),\n (w13 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w14 >>> 26)) | 0),\n (w14 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w15 >>> 26)) | 0),\n (w15 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w16 >>> 26)) | 0),\n (w16 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w17 >>> 26)) | 0),\n (w17 &= 67108863),\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 & 8191) << 13)) | 0;\n return (\n (c = (((hi + (mid >>> 13)) | 0) + (w18 >>> 26)) | 0),\n (w18 &= 67108863),\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 c !== 0 && ((o[19] = c), out.length++),\n out\n );\n };\n Math.imul || (comb10MulTo = smallMulTo);\n function bigMulTo(self2, num, out) {\n (out.negative = num.negative ^ self2.negative), (out.length = self2.length + num.length);\n for (var carry = 0, hncarry = 0, k = 0; k < out.length - 1; k++) {\n var ncarry = hncarry;\n hncarry = 0;\n for (\n var rword = carry & 67108863, maxJ = Math.min(k, num.length - 1), j = Math.max(0, k - self2.length + 1);\n j <= maxJ;\n j++\n ) {\n var i = k - j,\n a = self2.words[i] | 0,\n b = num.words[j] | 0,\n r = a * b,\n lo = r & 67108863;\n (ncarry = (ncarry + ((r / 67108864) | 0)) | 0),\n (lo = (lo + rword) | 0),\n (rword = lo & 67108863),\n (ncarry = (ncarry + (lo >>> 26)) | 0),\n (hncarry += ncarry >>> 26),\n (ncarry &= 67108863);\n }\n (out.words[k] = rword), (carry = ncarry), (ncarry = hncarry);\n }\n return carry !== 0 ? (out.words[k] = carry) : out.length--, out._strip();\n }\n function jumboMulTo(self2, num, out) {\n return bigMulTo(self2, num, out);\n }\n BN.prototype.mulTo = function (num, out) {\n var res,\n len = this.length + num.length;\n return (\n this.length === 10 && num.length === 10\n ? (res = comb10MulTo(this, num, out))\n : len < 63\n ? (res = smallMulTo(this, num, out))\n : len < 1024\n ? (res = bigMulTo(this, num, out))\n : (res = jumboMulTo(this, num, out)),\n res\n );\n };\n function FFTM(x, y) {\n (this.x = x), (this.y = y);\n }\n (FFTM.prototype.makeRBT = function (N) {\n for (var t = new Array(N), l = BN.prototype._countBits(N) - 1, i = 0; i < N; i++) t[i] = this.revBin(i, l, N);\n return t;\n }),\n (FFTM.prototype.revBin = function (x, l, N) {\n if (x === 0 || x === N - 1) return x;\n for (var rb = 0, i = 0; i < l; i++) (rb |= (x & 1) << (l - i - 1)), (x >>= 1);\n return rb;\n }),\n (FFTM.prototype.permute = function (rbt, rws, iws, rtws, itws, N) {\n for (var i = 0; i < N; i++) (rtws[i] = rws[rbt[i]]), (itws[i] = iws[rbt[i]]);\n }),\n (FFTM.prototype.transform = function (rws, iws, rtws, itws, N, rbt) {\n this.permute(rbt, rws, iws, rtws, itws, N);\n for (var s = 1; s < N; s <<= 1)\n for (\n var l = s << 1, rtwdf = Math.cos((2 * Math.PI) / l), itwdf = Math.sin((2 * Math.PI) / l), p = 0;\n p < N;\n p += l\n )\n for (var rtwdf_ = rtwdf, itwdf_ = itwdf, j = 0; j < s; j++) {\n var re = rtws[p + j],\n ie = itws[p + j],\n ro = rtws[p + j + s],\n io = itws[p + j + s],\n rx = rtwdf_ * ro - itwdf_ * io;\n (io = rtwdf_ * io + itwdf_ * ro),\n (ro = rx),\n (rtws[p + j] = re + ro),\n (itws[p + j] = ie + io),\n (rtws[p + j + s] = re - ro),\n (itws[p + j + s] = ie - io),\n j !== l &&\n ((rx = rtwdf * rtwdf_ - itwdf * itwdf_), (itwdf_ = rtwdf * itwdf_ + itwdf * rtwdf_), (rtwdf_ = rx));\n }\n }),\n (FFTM.prototype.guessLen13b = function (n, m) {\n var N = Math.max(m, n) | 1,\n odd = N & 1,\n i = 0;\n for (N = (N / 2) | 0; N; N = N >>> 1) i++;\n return 1 << (i + 1 + odd);\n }),\n (FFTM.prototype.conjugate = function (rws, iws, N) {\n if (!(N <= 1))\n for (var i = 0; i < N / 2; i++) {\n var t = rws[i];\n (rws[i] = rws[N - i - 1]),\n (rws[N - i - 1] = t),\n (t = iws[i]),\n (iws[i] = -iws[N - i - 1]),\n (iws[N - i - 1] = -t);\n }\n }),\n (FFTM.prototype.normalize13b = function (ws, N) {\n for (var carry = 0, i = 0; i < N / 2; i++) {\n var w = Math.round(ws[2 * i + 1] / N) * 8192 + Math.round(ws[2 * i] / N) + carry;\n (ws[i] = w & 67108863), w < 67108864 ? (carry = 0) : (carry = (w / 67108864) | 0);\n }\n return ws;\n }),\n (FFTM.prototype.convert13b = function (ws, len, rws, N) {\n for (var carry = 0, i = 0; i < len; i++)\n (carry = carry + (ws[i] | 0)),\n (rws[2 * i] = carry & 8191),\n (carry = carry >>> 13),\n (rws[2 * i + 1] = carry & 8191),\n (carry = carry >>> 13);\n for (i = 2 * len; i < N; ++i) rws[i] = 0;\n assert(carry === 0), assert((carry & -8192) === 0);\n }),\n (FFTM.prototype.stub = function (N) {\n for (var ph = new Array(N), i = 0; i < N; i++) ph[i] = 0;\n return ph;\n }),\n (FFTM.prototype.mulp = function (x, y, out) {\n var N = 2 * this.guessLen13b(x.length, y.length),\n rbt = this.makeRBT(N),\n _ = this.stub(N),\n rws = new Array(N),\n rwst = new Array(N),\n iwst = new Array(N),\n nrws = new Array(N),\n nrwst = new Array(N),\n niwst = new Array(N),\n rmws = out.words;\n (rmws.length = N),\n this.convert13b(x.words, x.length, rws, N),\n this.convert13b(y.words, y.length, nrws, N),\n this.transform(rws, _, rwst, iwst, N, rbt),\n this.transform(nrws, _, nrwst, niwst, N, rbt);\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]), (rwst[i] = rx);\n }\n return (\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 (out.negative = x.negative ^ y.negative),\n (out.length = x.length + y.length),\n out._strip()\n );\n }),\n (BN.prototype.mul = function (num) {\n var out = new BN(null);\n return (out.words = new Array(this.length + num.length)), this.mulTo(num, out);\n }),\n (BN.prototype.mulf = function (num) {\n var out = new BN(null);\n return (out.words = new Array(this.length + num.length)), jumboMulTo(this, num, out);\n }),\n (BN.prototype.imul = function (num) {\n return this.clone().mulTo(num, this);\n }),\n (BN.prototype.imuln = function (num) {\n var isNegNum = num < 0;\n isNegNum && (num = -num), assert(typeof num == \"number\"), assert(num < 67108864);\n for (var carry = 0, i = 0; i < this.length; i++) {\n var w = (this.words[i] | 0) * num,\n lo = (w & 67108863) + (carry & 67108863);\n (carry >>= 26), (carry += (w / 67108864) | 0), (carry += lo >>> 26), (this.words[i] = lo & 67108863);\n }\n return carry !== 0 && ((this.words[i] = carry), this.length++), isNegNum ? this.ineg() : this;\n }),\n (BN.prototype.muln = function (num) {\n return this.clone().imuln(num);\n }),\n (BN.prototype.sqr = function () {\n return this.mul(this);\n }),\n (BN.prototype.isqr = function () {\n return this.imul(this.clone());\n }),\n (BN.prototype.pow = function (num) {\n var w = toBitArray(num);\n if (w.length === 0) return new BN(1);\n for (var res = this, i = 0; i < w.length && w[i] === 0; i++, res = res.sqr());\n if (++i < w.length) for (var q = res.sqr(); i < w.length; i++, q = q.sqr()) w[i] !== 0 && (res = res.mul(q));\n return res;\n }),\n (BN.prototype.iushln = function (bits) {\n assert(typeof bits == \"number\" && bits >= 0);\n var r = bits % 26,\n s = (bits - r) / 26,\n carryMask = (67108863 >>> (26 - r)) << (26 - r),\n i;\n if (r !== 0) {\n var carry = 0;\n for (i = 0; i < this.length; i++) {\n var newCarry = this.words[i] & carryMask,\n c = ((this.words[i] | 0) - newCarry) << r;\n (this.words[i] = c | carry), (carry = newCarry >>> (26 - r));\n }\n carry && ((this.words[i] = carry), this.length++);\n }\n if (s !== 0) {\n for (i = this.length - 1; i >= 0; i--) this.words[i + s] = this.words[i];\n for (i = 0; i < s; i++) this.words[i] = 0;\n this.length += s;\n }\n return this._strip();\n }),\n (BN.prototype.ishln = function (bits) {\n return assert(this.negative === 0), this.iushln(bits);\n }),\n (BN.prototype.iushrn = function (bits, hint, extended) {\n assert(typeof bits == \"number\" && bits >= 0);\n var h;\n hint ? (h = (hint - (hint % 26)) / 26) : (h = 0);\n var r = bits % 26,\n s = Math.min((bits - r) / 26, this.length),\n mask = 67108863 ^ ((67108863 >>> r) << r),\n maskedWords = extended;\n if (((h -= s), (h = Math.max(0, h)), maskedWords)) {\n for (var i = 0; i < s; i++) maskedWords.words[i] = this.words[i];\n maskedWords.length = s;\n }\n if (s !== 0)\n if (this.length > s) for (this.length -= s, i = 0; i < this.length; i++) this.words[i] = this.words[i + s];\n else (this.words[0] = 0), (this.length = 1);\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)), (carry = word & mask);\n }\n return (\n maskedWords && carry !== 0 && (maskedWords.words[maskedWords.length++] = carry),\n this.length === 0 && ((this.words[0] = 0), (this.length = 1)),\n this._strip()\n );\n }),\n (BN.prototype.ishrn = function (bits, hint, extended) {\n return assert(this.negative === 0), this.iushrn(bits, hint, extended);\n }),\n (BN.prototype.shln = function (bits) {\n return this.clone().ishln(bits);\n }),\n (BN.prototype.ushln = function (bits) {\n return this.clone().iushln(bits);\n }),\n (BN.prototype.shrn = function (bits) {\n return this.clone().ishrn(bits);\n }),\n (BN.prototype.ushrn = function (bits) {\n return this.clone().iushrn(bits);\n }),\n (BN.prototype.testn = function (bit) {\n assert(typeof bit == \"number\" && bit >= 0);\n var r = bit % 26,\n s = (bit - r) / 26,\n q = 1 << r;\n if (this.length <= s) return !1;\n var w = this.words[s];\n return !!(w & q);\n }),\n (BN.prototype.imaskn = function (bits) {\n assert(typeof bits == \"number\" && bits >= 0);\n var r = bits % 26,\n s = (bits - r) / 26;\n if ((assert(this.negative === 0, \"imaskn works only with positive numbers\"), this.length <= s)) return this;\n if ((r !== 0 && s++, (this.length = Math.min(s, this.length)), r !== 0)) {\n var mask = 67108863 ^ ((67108863 >>> r) << r);\n this.words[this.length - 1] &= mask;\n }\n return this._strip();\n }),\n (BN.prototype.maskn = function (bits) {\n return this.clone().imaskn(bits);\n }),\n (BN.prototype.iaddn = function (num) {\n return (\n assert(typeof num == \"number\"),\n assert(num < 67108864),\n num < 0\n ? this.isubn(-num)\n : this.negative !== 0\n ? this.length === 1 && (this.words[0] | 0) <= num\n ? ((this.words[0] = num - (this.words[0] | 0)), (this.negative = 0), this)\n : ((this.negative = 0), this.isubn(num), (this.negative = 1), this)\n : this._iaddn(num)\n );\n }),\n (BN.prototype._iaddn = function (num) {\n this.words[0] += num;\n for (var i = 0; i < this.length && this.words[i] >= 67108864; i++)\n (this.words[i] -= 67108864), i === this.length - 1 ? (this.words[i + 1] = 1) : this.words[i + 1]++;\n return (this.length = Math.max(this.length, i + 1)), this;\n }),\n (BN.prototype.isubn = function (num) {\n if ((assert(typeof num == \"number\"), assert(num < 67108864), num < 0)) return this.iaddn(-num);\n if (this.negative !== 0) return (this.negative = 0), this.iaddn(num), (this.negative = 1), this;\n if (((this.words[0] -= num), this.length === 1 && this.words[0] < 0))\n (this.words[0] = -this.words[0]), (this.negative = 1);\n else\n for (var i = 0; i < this.length && this.words[i] < 0; i++)\n (this.words[i] += 67108864), (this.words[i + 1] -= 1);\n return this._strip();\n }),\n (BN.prototype.addn = function (num) {\n return this.clone().iaddn(num);\n }),\n (BN.prototype.subn = function (num) {\n return this.clone().isubn(num);\n }),\n (BN.prototype.iabs = function () {\n return (this.negative = 0), this;\n }),\n (BN.prototype.abs = function () {\n return this.clone().iabs();\n }),\n (BN.prototype._ishlnsubmul = function (num, mul, shift) {\n var len = num.length + shift,\n i;\n this._expand(len);\n var w,\n 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 & 67108863),\n (carry = (w >> 26) - ((right / 67108864) | 0)),\n (this.words[i + shift] = w & 67108863);\n }\n for (; i < this.length - shift; i++)\n (w = (this.words[i + shift] | 0) + carry), (carry = w >> 26), (this.words[i + shift] = w & 67108863);\n if (carry === 0) return this._strip();\n for (assert(carry === -1), carry = 0, i = 0; i < this.length; i++)\n (w = -(this.words[i] | 0) + carry), (carry = w >> 26), (this.words[i] = w & 67108863);\n return (this.negative = 1), this._strip();\n }),\n (BN.prototype._wordDiv = function (num, mode) {\n var shift = this.length - num.length,\n a = this.clone(),\n b = num,\n bhi = b.words[b.length - 1] | 0,\n bhiBits = this._countBits(bhi);\n (shift = 26 - bhiBits),\n shift !== 0 && ((b = b.ushln(shift)), a.iushln(shift), (bhi = b.words[b.length - 1] | 0));\n var m = a.length - b.length,\n q;\n if (mode !== \"mod\") {\n (q = new BN(null)), (q.length = m + 1), (q.words = new Array(q.length));\n for (var i = 0; i < q.length; i++) q.words[i] = 0;\n }\n var diff = a.clone()._ishlnsubmul(b, 1, m);\n diff.negative === 0 && ((a = diff), q && (q.words[m] = 1));\n for (var j = m - 1; j >= 0; j--) {\n var qj = (a.words[b.length + j] | 0) * 67108864 + (a.words[b.length + j - 1] | 0);\n for (qj = Math.min((qj / bhi) | 0, 67108863), a._ishlnsubmul(b, qj, j); a.negative !== 0; )\n qj--, (a.negative = 0), a._ishlnsubmul(b, 1, j), a.isZero() || (a.negative ^= 1);\n q && (q.words[j] = qj);\n }\n return (\n q && q._strip(),\n a._strip(),\n mode !== \"div\" && shift !== 0 && a.iushrn(shift),\n {\n div: q || null,\n mod: a,\n }\n );\n }),\n (BN.prototype.divmod = function (num, mode, positive) {\n if ((assert(!num.isZero()), this.isZero()))\n return {\n div: new BN(0),\n mod: new BN(0),\n };\n var div, mod, res;\n return this.negative !== 0 && num.negative === 0\n ? ((res = this.neg().divmod(num, mode)),\n mode !== \"mod\" && (div = res.div.neg()),\n mode !== \"div\" && ((mod = res.mod.neg()), positive && mod.negative !== 0 && mod.iadd(num)),\n {\n div,\n mod,\n })\n : this.negative === 0 && num.negative !== 0\n ? ((res = this.divmod(num.neg(), mode)),\n mode !== \"mod\" && (div = res.div.neg()),\n {\n div,\n mod: res.mod,\n })\n : (this.negative & num.negative) !== 0\n ? ((res = this.neg().divmod(num.neg(), mode)),\n mode !== \"div\" && ((mod = res.mod.neg()), positive && mod.negative !== 0 && mod.isub(num)),\n {\n div: res.div,\n mod,\n })\n : num.length > this.length || this.cmp(num) < 0\n ? {\n div: new BN(0),\n mod: this,\n }\n : num.length === 1\n ? mode === \"div\"\n ? {\n div: this.divn(num.words[0]),\n mod: null,\n }\n : mode === \"mod\"\n ? {\n div: null,\n mod: new BN(this.modrn(num.words[0])),\n }\n : {\n div: this.divn(num.words[0]),\n mod: new BN(this.modrn(num.words[0])),\n }\n : this._wordDiv(num, mode);\n }),\n (BN.prototype.div = function (num) {\n return this.divmod(num, \"div\", !1).div;\n }),\n (BN.prototype.mod = function (num) {\n return this.divmod(num, \"mod\", !1).mod;\n }),\n (BN.prototype.umod = function (num) {\n return this.divmod(num, \"mod\", !0).mod;\n }),\n (BN.prototype.divRound = function (num) {\n var dm = this.divmod(num);\n if (dm.mod.isZero()) return dm.div;\n var mod = dm.div.negative !== 0 ? dm.mod.isub(num) : dm.mod,\n half = num.ushrn(1),\n r2 = num.andln(1),\n cmp = mod.cmp(half);\n return cmp < 0 || (r2 === 1 && cmp === 0)\n ? dm.div\n : dm.div.negative !== 0\n ? dm.div.isubn(1)\n : dm.div.iaddn(1);\n }),\n (BN.prototype.modrn = function (num) {\n var isNegNum = num < 0;\n isNegNum && (num = -num), assert(num <= 67108863);\n for (var p = (1 << 26) % num, acc = 0, i = this.length - 1; i >= 0; i--)\n acc = (p * acc + (this.words[i] | 0)) % num;\n return isNegNum ? -acc : acc;\n }),\n (BN.prototype.modn = function (num) {\n return this.modrn(num);\n }),\n (BN.prototype.idivn = function (num) {\n var isNegNum = num < 0;\n isNegNum && (num = -num), assert(num <= 67108863);\n for (var carry = 0, i = this.length - 1; i >= 0; i--) {\n var w = (this.words[i] | 0) + carry * 67108864;\n (this.words[i] = (w / num) | 0), (carry = w % num);\n }\n return this._strip(), isNegNum ? this.ineg() : this;\n }),\n (BN.prototype.divn = function (num) {\n return this.clone().idivn(num);\n }),\n (BN.prototype.egcd = function (p) {\n assert(p.negative === 0), assert(!p.isZero());\n var x = this,\n y = p.clone();\n x.negative !== 0 ? (x = x.umod(p)) : (x = x.clone());\n for (var A = new BN(1), B = new BN(0), C = new BN(0), D = new BN(1), g = 0; x.isEven() && y.isEven(); )\n x.iushrn(1), y.iushrn(1), ++g;\n for (var yp = y.clone(), xp = x.clone(); !x.isZero(); ) {\n for (var i = 0, im = 1; (x.words[0] & im) === 0 && i < 26; ++i, im <<= 1);\n if (i > 0)\n for (x.iushrn(i); i-- > 0; )\n (A.isOdd() || B.isOdd()) && (A.iadd(yp), B.isub(xp)), A.iushrn(1), B.iushrn(1);\n for (var j = 0, jm = 1; (y.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n if (j > 0)\n for (y.iushrn(j); j-- > 0; )\n (C.isOdd() || D.isOdd()) && (C.iadd(yp), D.isub(xp)), C.iushrn(1), D.iushrn(1);\n x.cmp(y) >= 0 ? (x.isub(y), A.isub(C), B.isub(D)) : (y.isub(x), C.isub(A), D.isub(B));\n }\n return {\n a: C,\n b: D,\n gcd: y.iushln(g),\n };\n }),\n (BN.prototype._invmp = function (p) {\n assert(p.negative === 0), assert(!p.isZero());\n var a = this,\n b = p.clone();\n a.negative !== 0 ? (a = a.umod(p)) : (a = a.clone());\n for (var x1 = new BN(1), x2 = new BN(0), delta = b.clone(); 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) for (a.iushrn(i); i-- > 0; ) x1.isOdd() && x1.iadd(delta), x1.iushrn(1);\n for (var j = 0, jm = 1; (b.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n if (j > 0) for (b.iushrn(j); j-- > 0; ) x2.isOdd() && x2.iadd(delta), x2.iushrn(1);\n a.cmp(b) >= 0 ? (a.isub(b), x1.isub(x2)) : (b.isub(a), x2.isub(x1));\n }\n var res;\n return a.cmpn(1) === 0 ? (res = x1) : (res = x2), res.cmpn(0) < 0 && res.iadd(p), res;\n }),\n (BN.prototype.gcd = function (num) {\n if (this.isZero()) return num.abs();\n if (num.isZero()) return this.abs();\n var a = this.clone(),\n b = num.clone();\n (a.negative = 0), (b.negative = 0);\n for (var shift = 0; a.isEven() && b.isEven(); shift++) a.iushrn(1), b.iushrn(1);\n do {\n for (; a.isEven(); ) a.iushrn(1);\n for (; b.isEven(); ) b.iushrn(1);\n var r = a.cmp(b);\n if (r < 0) {\n var t = a;\n (a = b), (b = t);\n } else if (r === 0 || b.cmpn(1) === 0) break;\n a.isub(b);\n } while (!0);\n return b.iushln(shift);\n }),\n (BN.prototype.invm = function (num) {\n return this.egcd(num).a.umod(num);\n }),\n (BN.prototype.isEven = function () {\n return (this.words[0] & 1) === 0;\n }),\n (BN.prototype.isOdd = function () {\n return (this.words[0] & 1) === 1;\n }),\n (BN.prototype.andln = function (num) {\n return this.words[0] & num;\n }),\n (BN.prototype.bincn = function (bit) {\n assert(typeof bit == \"number\");\n var r = bit % 26,\n s = (bit - r) / 26,\n q = 1 << r;\n if (this.length <= s) return this._expand(s + 1), (this.words[s] |= q), this;\n for (var carry = q, i = s; carry !== 0 && i < this.length; i++) {\n var w = this.words[i] | 0;\n (w += carry), (carry = w >>> 26), (w &= 67108863), (this.words[i] = w);\n }\n return carry !== 0 && ((this.words[i] = carry), this.length++), this;\n }),\n (BN.prototype.isZero = function () {\n return this.length === 1 && this.words[0] === 0;\n }),\n (BN.prototype.cmpn = function (num) {\n var negative = num < 0;\n if (this.negative !== 0 && !negative) return -1;\n if (this.negative === 0 && negative) return 1;\n this._strip();\n var res;\n if (this.length > 1) res = 1;\n else {\n negative && (num = -num), assert(num <= 67108863, \"Number is too big\");\n var w = this.words[0] | 0;\n res = w === num ? 0 : w < num ? -1 : 1;\n }\n return this.negative !== 0 ? -res | 0 : res;\n }),\n (BN.prototype.cmp = function (num) {\n if (this.negative !== 0 && num.negative === 0) return -1;\n if (this.negative === 0 && num.negative !== 0) return 1;\n var res = this.ucmp(num);\n return this.negative !== 0 ? -res | 0 : res;\n }),\n (BN.prototype.ucmp = function (num) {\n if (this.length > num.length) return 1;\n if (this.length < num.length) return -1;\n for (var res = 0, i = this.length - 1; i >= 0; i--) {\n var a = this.words[i] | 0,\n b = num.words[i] | 0;\n if (a !== b) {\n a < b ? (res = -1) : a > b && (res = 1);\n break;\n }\n }\n return res;\n }),\n (BN.prototype.gtn = function (num) {\n return this.cmpn(num) === 1;\n }),\n (BN.prototype.gt = function (num) {\n return this.cmp(num) === 1;\n }),\n (BN.prototype.gten = function (num) {\n return this.cmpn(num) >= 0;\n }),\n (BN.prototype.gte = function (num) {\n return this.cmp(num) >= 0;\n }),\n (BN.prototype.ltn = function (num) {\n return this.cmpn(num) === -1;\n }),\n (BN.prototype.lt = function (num) {\n return this.cmp(num) === -1;\n }),\n (BN.prototype.lten = function (num) {\n return this.cmpn(num) <= 0;\n }),\n (BN.prototype.lte = function (num) {\n return this.cmp(num) <= 0;\n }),\n (BN.prototype.eqn = function (num) {\n return this.cmpn(num) === 0;\n }),\n (BN.prototype.eq = function (num) {\n return this.cmp(num) === 0;\n }),\n (BN.red = function (num) {\n return new Red(num);\n }),\n (BN.prototype.toRed = function (ctx) {\n return (\n assert(!this.red, \"Already a number in reduction context\"),\n assert(this.negative === 0, \"red works only with positives\"),\n ctx.convertTo(this)._forceRed(ctx)\n );\n }),\n (BN.prototype.fromRed = function () {\n return assert(this.red, \"fromRed works only with numbers in reduction context\"), this.red.convertFrom(this);\n }),\n (BN.prototype._forceRed = function (ctx) {\n return (this.red = ctx), this;\n }),\n (BN.prototype.forceRed = function (ctx) {\n return assert(!this.red, \"Already a number in reduction context\"), this._forceRed(ctx);\n }),\n (BN.prototype.redAdd = function (num) {\n return assert(this.red, \"redAdd works only with red numbers\"), this.red.add(this, num);\n }),\n (BN.prototype.redIAdd = function (num) {\n return assert(this.red, \"redIAdd works only with red numbers\"), this.red.iadd(this, num);\n }),\n (BN.prototype.redSub = function (num) {\n return assert(this.red, \"redSub works only with red numbers\"), this.red.sub(this, num);\n }),\n (BN.prototype.redISub = function (num) {\n return assert(this.red, \"redISub works only with red numbers\"), this.red.isub(this, num);\n }),\n (BN.prototype.redShl = function (num) {\n return assert(this.red, \"redShl works only with red numbers\"), this.red.shl(this, num);\n }),\n (BN.prototype.redMul = function (num) {\n return (\n assert(this.red, \"redMul works only with red numbers\"),\n this.red._verify2(this, num),\n this.red.mul(this, num)\n );\n }),\n (BN.prototype.redIMul = function (num) {\n return (\n assert(this.red, \"redMul works only with red numbers\"),\n this.red._verify2(this, num),\n this.red.imul(this, num)\n );\n }),\n (BN.prototype.redSqr = function () {\n return assert(this.red, \"redSqr works only with red numbers\"), this.red._verify1(this), this.red.sqr(this);\n }),\n (BN.prototype.redISqr = function () {\n return assert(this.red, \"redISqr works only with red numbers\"), this.red._verify1(this), this.red.isqr(this);\n }),\n (BN.prototype.redSqrt = function () {\n return assert(this.red, \"redSqrt works only with red numbers\"), this.red._verify1(this), this.red.sqrt(this);\n }),\n (BN.prototype.redInvm = function () {\n return assert(this.red, \"redInvm works only with red numbers\"), this.red._verify1(this), this.red.invm(this);\n }),\n (BN.prototype.redNeg = function () {\n return assert(this.red, \"redNeg works only with red numbers\"), this.red._verify1(this), this.red.neg(this);\n }),\n (BN.prototype.redPow = function (num) {\n return assert(this.red && !num.red, \"redPow(normalNum)\"), this.red._verify1(this), this.red.pow(this, num);\n });\n var primes = {\n k256: null,\n p224: null,\n p192: null,\n p25519: null,\n };\n function MPrime(name, p) {\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 (this.tmp = this._tmp());\n }\n (MPrime.prototype._tmp = function () {\n var tmp = new BN(null);\n return (tmp.words = new Array(Math.ceil(this.n / 13))), tmp;\n }),\n (MPrime.prototype.ireduce = function (num) {\n var r = num,\n rlen;\n do this.split(r, this.tmp), (r = this.imulK(r)), (r = r.iadd(this.tmp)), (rlen = r.bitLength());\n while (rlen > this.n);\n var cmp = rlen < this.n ? -1 : r.ucmp(this.p);\n return (\n cmp === 0\n ? ((r.words[0] = 0), (r.length = 1))\n : cmp > 0\n ? r.isub(this.p)\n : r.strip !== void 0\n ? r.strip()\n : r._strip(),\n r\n );\n }),\n (MPrime.prototype.split = function (input, out) {\n input.iushrn(this.n, 0, out);\n }),\n (MPrime.prototype.imulK = function (num) {\n return num.imul(this.k);\n });\n function K256() {\n MPrime.call(this, \"k256\", \"ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f\");\n }\n inherits(K256, MPrime),\n (K256.prototype.split = function (input, output) {\n for (var mask = 4194303, outLen = Math.min(input.length, 9), i = 0; i < outLen; i++)\n output.words[i] = input.words[i];\n if (((output.length = outLen), input.length <= 9)) {\n (input.words[0] = 0), (input.length = 1);\n return;\n }\n var prev = input.words[9];\n for (output.words[output.length++] = prev & mask, i = 10; i < input.length; i++) {\n var next = input.words[i] | 0;\n (input.words[i - 10] = ((next & mask) << 4) | (prev >>> 22)), (prev = next);\n }\n (prev >>>= 22),\n (input.words[i - 10] = prev),\n prev === 0 && input.length > 10 ? (input.length -= 10) : (input.length -= 9);\n }),\n (K256.prototype.imulK = function (num) {\n (num.words[num.length] = 0), (num.words[num.length + 1] = 0), (num.length += 2);\n for (var lo = 0, i = 0; i < num.length; i++) {\n var w = num.words[i] | 0;\n (lo += w * 977), (num.words[i] = lo & 67108863), (lo = w * 64 + ((lo / 67108864) | 0));\n }\n return (\n num.words[num.length - 1] === 0 && (num.length--, num.words[num.length - 1] === 0 && num.length--), num\n );\n });\n function P224() {\n MPrime.call(this, \"p224\", \"ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001\");\n }\n inherits(P224, MPrime);\n function P192() {\n MPrime.call(this, \"p192\", \"ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff\");\n }\n inherits(P192, MPrime);\n function P25519() {\n MPrime.call(this, \"25519\", \"7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed\");\n }\n inherits(P25519, MPrime),\n (P25519.prototype.imulK = function (num) {\n for (var carry = 0, i = 0; i < num.length; i++) {\n var hi = (num.words[i] | 0) * 19 + carry,\n lo = hi & 67108863;\n (hi >>>= 26), (num.words[i] = lo), (carry = hi);\n }\n return carry !== 0 && (num.words[num.length++] = carry), num;\n }),\n (BN._prime = function (name) {\n if (primes[name]) return primes[name];\n var prime2;\n if (name === \"k256\") prime2 = new K256();\n else if (name === \"p224\") prime2 = new P224();\n else if (name === \"p192\") prime2 = new P192();\n else if (name === \"p25519\") prime2 = new P25519();\n else throw new Error(\"Unknown prime \" + name);\n return (primes[name] = prime2), prime2;\n });\n function Red(m) {\n if (typeof m == \"string\") {\n var prime = BN._prime(m);\n (this.m = prime.p), (this.prime = prime);\n } else assert(m.gtn(1), \"modulus must be greater than 1\"), (this.m = m), (this.prime = null);\n }\n (Red.prototype._verify1 = function (a) {\n assert(a.negative === 0, \"red works only with positives\"), assert(a.red, \"red works only with red numbers\");\n }),\n (Red.prototype._verify2 = function (a, b) {\n assert((a.negative | b.negative) === 0, \"red works only with positives\"),\n assert(a.red && a.red === b.red, \"red works only with red numbers\");\n }),\n (Red.prototype.imod = function (a) {\n return this.prime ? this.prime.ireduce(a)._forceRed(this) : (move(a, a.umod(this.m)._forceRed(this)), a);\n }),\n (Red.prototype.neg = function (a) {\n return a.isZero() ? a.clone() : this.m.sub(a)._forceRed(this);\n }),\n (Red.prototype.add = function (a, b) {\n this._verify2(a, b);\n var res = a.add(b);\n return res.cmp(this.m) >= 0 && res.isub(this.m), res._forceRed(this);\n }),\n (Red.prototype.iadd = function (a, b) {\n this._verify2(a, b);\n var res = a.iadd(b);\n return res.cmp(this.m) >= 0 && res.isub(this.m), res;\n }),\n (Red.prototype.sub = function (a, b) {\n this._verify2(a, b);\n var res = a.sub(b);\n return res.cmpn(0) < 0 && res.iadd(this.m), res._forceRed(this);\n }),\n (Red.prototype.isub = function (a, b) {\n this._verify2(a, b);\n var res = a.isub(b);\n return res.cmpn(0) < 0 && res.iadd(this.m), res;\n }),\n (Red.prototype.shl = function (a, num) {\n return this._verify1(a), this.imod(a.ushln(num));\n }),\n (Red.prototype.imul = function (a, b) {\n return this._verify2(a, b), this.imod(a.imul(b));\n }),\n (Red.prototype.mul = function (a, b) {\n return this._verify2(a, b), this.imod(a.mul(b));\n }),\n (Red.prototype.isqr = function (a) {\n return this.imul(a, a.clone());\n }),\n (Red.prototype.sqr = function (a) {\n return this.mul(a, a);\n }),\n (Red.prototype.sqrt = function (a) {\n if (a.isZero()) return a.clone();\n var mod3 = this.m.andln(3);\n if ((assert(mod3 % 2 === 1), mod3 === 3)) {\n var pow = this.m.add(new BN(1)).iushrn(2);\n return this.pow(a, pow);\n }\n for (var q = this.m.subn(1), s = 0; !q.isZero() && q.andln(1) === 0; ) s++, q.iushrn(1);\n assert(!q.isZero());\n var one = new BN(1).toRed(this),\n nOne = one.redNeg(),\n lpow = this.m.subn(1).iushrn(1),\n z = this.m.bitLength();\n for (z = new BN(2 * z * z).toRed(this); this.pow(z, lpow).cmp(nOne) !== 0; ) z.redIAdd(nOne);\n for (\n var c = this.pow(z, q), r = this.pow(a, q.addn(1).iushrn(1)), t = this.pow(a, q), m = s;\n t.cmp(one) !== 0;\n\n ) {\n for (var tmp = t, i = 0; tmp.cmp(one) !== 0; i++) tmp = tmp.redSqr();\n assert(i < m);\n var b = this.pow(c, new BN(1).iushln(m - i - 1));\n (r = r.redMul(b)), (c = b.redSqr()), (t = t.redMul(c)), (m = i);\n }\n return r;\n }),\n (Red.prototype.invm = function (a) {\n var inv = a._invmp(this.m);\n return inv.negative !== 0 ? ((inv.negative = 0), this.imod(inv).redNeg()) : this.imod(inv);\n }),\n (Red.prototype.pow = function (a, num) {\n if (num.isZero()) return new BN(1).toRed(this);\n if (num.cmpn(1) === 0) return a.clone();\n var windowSize = 4,\n wnd = new Array(1 << windowSize);\n (wnd[0] = new BN(1).toRed(this)), (wnd[1] = a);\n for (var i = 2; i < wnd.length; i++) wnd[i] = this.mul(wnd[i - 1], a);\n var res = wnd[0],\n current = 0,\n currentLen = 0,\n start = num.bitLength() % 26;\n for (start === 0 && (start = 26), i = num.length - 1; i >= 0; i--) {\n for (var word = num.words[i], j = start - 1; j >= 0; j--) {\n var bit = (word >> j) & 1;\n if ((res !== wnd[0] && (res = this.sqr(res)), bit === 0 && current === 0)) {\n currentLen = 0;\n continue;\n }\n (current <<= 1),\n (current |= bit),\n currentLen++,\n !(currentLen !== windowSize && (i !== 0 || j !== 0)) &&\n ((res = this.mul(res, wnd[current])), (currentLen = 0), (current = 0));\n }\n start = 26;\n }\n return res;\n }),\n (Red.prototype.convertTo = function (num) {\n var r = num.umod(this.m);\n return r === num ? r.clone() : r;\n }),\n (Red.prototype.convertFrom = function (num) {\n var res = num.clone();\n return (res.red = null), res;\n }),\n (BN.mont = function (num) {\n return new Mont(num);\n });\n function Mont(m) {\n Red.call(this, m),\n (this.shift = this.m.bitLength()),\n this.shift % 26 !== 0 && (this.shift += 26 - (this.shift % 26)),\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 (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 (Mont.prototype.convertTo = function (num) {\n return this.imod(num.ushln(this.shift));\n }),\n (Mont.prototype.convertFrom = function (num) {\n var r = this.imod(num.mul(this.rinv));\n return (r.red = null), r;\n }),\n (Mont.prototype.imul = function (a, b) {\n if (a.isZero() || b.isZero()) return (a.words[0] = 0), (a.length = 1), a;\n var t = a.imul(b),\n c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m),\n u = t.isub(c).iushrn(this.shift),\n res = u;\n return (\n u.cmp(this.m) >= 0 ? (res = u.isub(this.m)) : u.cmpn(0) < 0 && (res = u.iadd(this.m)), res._forceRed(this)\n );\n }),\n (Mont.prototype.mul = function (a, b) {\n if (a.isZero() || b.isZero()) return new BN(0)._forceRed(this);\n var t = a.mul(b),\n c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m),\n u = t.isub(c).iushrn(this.shift),\n res = u;\n return (\n u.cmp(this.m) >= 0 ? (res = u.isub(this.m)) : u.cmpn(0) < 0 && (res = u.iadd(this.m)), res._forceRed(this)\n );\n }),\n (Mont.prototype.invm = function (a) {\n var res = this.imod(a._invmp(this.m).mul(this.r2));\n return res._forceRed(this);\n });\n })(typeof module > \"u\" || module, exports);\n },\n});\n\n// node_modules/browserify-rsa/index.js\nvar require_browserify_rsa = __commonJS({\n \"node_modules/browserify-rsa/index.js\"(exports, module) {\n var BN = require_bn3(),\n randomBytes = require_browser();\n function blind(priv) {\n var r = getr(priv),\n blinder = r.toRed(BN.mont(priv.modulus)).redPow(new BN(priv.publicExponent)).fromRed();\n return { blinder, unblinder: r.invm(priv.modulus) };\n }\n function getr(priv) {\n var len = priv.modulus.byteLength(),\n r;\n do r = new BN(randomBytes(len));\n while (r.cmp(priv.modulus) >= 0 || !r.umod(priv.prime1) || !r.umod(priv.prime2));\n return r;\n }\n function crt(msg, priv) {\n var blinds = blind(priv),\n len = priv.modulus.byteLength(),\n blinded = new BN(msg).mul(blinds.blinder).umod(priv.modulus),\n c1 = blinded.toRed(BN.mont(priv.prime1)),\n c2 = blinded.toRed(BN.mont(priv.prime2)),\n qinv = priv.coefficient,\n p = priv.prime1,\n q = priv.prime2,\n m1 = c1.redPow(priv.exponent1).fromRed(),\n m2 = c2.redPow(priv.exponent2).fromRed(),\n h = m1.isub(m2).imul(qinv).umod(p).imul(q);\n return m2.iadd(h).imul(blinds.unblinder).umod(priv.modulus).toArrayLike(Buffer, \"be\", len);\n }\n crt.getr = getr;\n module.exports = crt;\n },\n});\n\n// node_modules/elliptic/package.json\nvar require_package = __commonJS({\n \"node_modules/elliptic/package.json\"(exports, module) {\n module.exports = {\n name: \"elliptic\",\n version: \"6.5.4\",\n description: \"EC cryptography\",\n main: \"lib/elliptic.js\",\n files: [\"lib\"],\n scripts: {\n lint: \"eslint lib test\",\n \"lint:fix\": \"npm run lint -- --fix\",\n unit: \"istanbul test _mocha --reporter=spec test/index.js\",\n test: \"npm run lint && npm run unit\",\n version: \"grunt dist && git add dist/\",\n },\n repository: {\n type: \"git\",\n url: \"git@github.com:indutny/elliptic\",\n },\n keywords: [\"EC\", \"Elliptic\", \"curve\", \"Cryptography\"],\n author: \"Fedor Indutny <fedor@indutny.com>\",\n license: \"MIT\",\n bugs: {\n url: \"https://github.com/indutny/elliptic/issues\",\n },\n homepage: \"https://github.com/indutny/elliptic\",\n devDependencies: {\n brfs: \"^2.0.2\",\n coveralls: \"^3.1.0\",\n eslint: \"^7.6.0\",\n grunt: \"^1.2.1\",\n \"grunt-browserify\": \"^5.3.0\",\n \"grunt-cli\": \"^1.3.2\",\n \"grunt-contrib-connect\": \"^3.0.0\",\n \"grunt-contrib-copy\": \"^1.0.0\",\n \"grunt-contrib-uglify\": \"^5.0.0\",\n \"grunt-mocha-istanbul\": \"^5.0.2\",\n \"grunt-saucelabs\": \"^9.0.1\",\n istanbul: \"^0.4.5\",\n mocha: \"^8.0.1\",\n },\n dependencies: {\n \"bn.js\": \"^4.11.9\",\n brorand: \"^1.1.0\",\n \"hash.js\": \"^1.0.0\",\n \"hmac-drbg\": \"^1.0.1\",\n inherits: \"^2.0.4\",\n \"minimalistic-assert\": \"^1.0.1\",\n \"minimalistic-crypto-utils\": \"^1.0.1\",\n },\n };\n },\n});\n\n// node_modules/elliptic/node_modules/bn.js/lib/bn.js\nvar require_bn4 = __commonJS({\n \"node_modules/elliptic/node_modules/bn.js/lib/bn.js\"(exports, module) {\n (function (module2, exports2) {\n \"use strict\";\n function assert(val, msg) {\n if (!val) throw new Error(msg || \"Assertion failed\");\n }\n function inherits(ctor, superCtor) {\n ctor.super_ = superCtor;\n var TempCtor = function () {};\n (TempCtor.prototype = superCtor.prototype),\n (ctor.prototype = new TempCtor()),\n (ctor.prototype.constructor = ctor);\n }\n function BN(number, base, endian) {\n if (BN.isBN(number)) return number;\n (this.negative = 0),\n (this.words = null),\n (this.length = 0),\n (this.red = null),\n number !== null &&\n ((base === \"le\" || base === \"be\") && ((endian = base), (base = 10)),\n this._init(number || 0, base || 10, endian || \"be\"));\n }\n typeof module2 == \"object\" ? (module2.exports = BN) : (exports2.BN = BN), (BN.BN = BN), (BN.wordSize = 26);\n var Buffer2;\n try {\n typeof window < \"u\" && typeof window.Buffer < \"u\"\n ? (Buffer2 = window.Buffer)\n : (Buffer2 = __require(\"buffer\").Buffer);\n } catch {}\n (BN.isBN = function (num) {\n return num instanceof BN\n ? !0\n : num !== null &&\n typeof num == \"object\" &&\n num.constructor.wordSize === BN.wordSize &&\n Array.isArray(num.words);\n }),\n (BN.max = function (left, right) {\n return left.cmp(right) > 0 ? left : right;\n }),\n (BN.min = function (left, right) {\n return left.cmp(right) < 0 ? left : right;\n }),\n (BN.prototype._init = function (number, base, endian) {\n if (typeof number == \"number\") return this._initNumber(number, base, endian);\n if (typeof number == \"object\") return this._initArray(number, base, endian);\n base === \"hex\" && (base = 16),\n assert(base === (base | 0) && base >= 2 && base <= 36),\n (number = number.toString().replace(/\\s+/g, \"\"));\n var start = 0;\n number[0] === \"-\" && (start++, (this.negative = 1)),\n start < number.length &&\n (base === 16\n ? this._parseHex(number, start, endian)\n : (this._parseBase(number, base, start),\n endian === \"le\" && this._initArray(this.toArray(), base, endian)));\n }),\n (BN.prototype._initNumber = function (number, base, endian) {\n number < 0 && ((this.negative = 1), (number = -number)),\n number < 67108864\n ? ((this.words = [number & 67108863]), (this.length = 1))\n : number < 4503599627370496\n ? ((this.words = [number & 67108863, (number / 67108864) & 67108863]), (this.length = 2))\n : (assert(number < 9007199254740992),\n (this.words = [number & 67108863, (number / 67108864) & 67108863, 1]),\n (this.length = 3)),\n endian === \"le\" && this._initArray(this.toArray(), base, endian);\n }),\n (BN.prototype._initArray = function (number, base, endian) {\n if ((assert(typeof number.length == \"number\"), number.length <= 0))\n return (this.words = [0]), (this.length = 1), this;\n (this.length = Math.ceil(number.length / 3)), (this.words = new Array(this.length));\n for (var i = 0; i < this.length; i++) this.words[i] = 0;\n var j,\n w,\n off = 0;\n if (endian === \"be\")\n for (i = number.length - 1, j = 0; i >= 0; i -= 3)\n (w = number[i] | (number[i - 1] << 8) | (number[i - 2] << 16)),\n (this.words[j] |= (w << off) & 67108863),\n (this.words[j + 1] = (w >>> (26 - off)) & 67108863),\n (off += 24),\n off >= 26 && ((off -= 26), j++);\n else if (endian === \"le\")\n for (i = 0, j = 0; i < number.length; i += 3)\n (w = number[i] | (number[i + 1] << 8) | (number[i + 2] << 16)),\n (this.words[j] |= (w << off) & 67108863),\n (this.words[j + 1] = (w >>> (26 - off)) & 67108863),\n (off += 24),\n off >= 26 && ((off -= 26), j++);\n return this.strip();\n });\n function parseHex4Bits(string, index) {\n var c = string.charCodeAt(index);\n return c >= 65 && c <= 70 ? c - 55 : c >= 97 && c <= 102 ? c - 87 : (c - 48) & 15;\n }\n function parseHexByte(string, lowerBound, index) {\n var r = parseHex4Bits(string, index);\n return index - 1 >= lowerBound && (r |= parseHex4Bits(string, index - 1) << 4), r;\n }\n BN.prototype._parseHex = function (number, start, endian) {\n (this.length = Math.ceil((number.length - start) / 6)), (this.words = new Array(this.length));\n for (var i = 0; i < this.length; i++) this.words[i] = 0;\n var off = 0,\n j = 0,\n w;\n if (endian === \"be\")\n for (i = number.length - 1; i >= start; i -= 2)\n (w = parseHexByte(number, start, i) << off),\n (this.words[j] |= w & 67108863),\n off >= 18 ? ((off -= 18), (j += 1), (this.words[j] |= w >>> 26)) : (off += 8);\n else {\n var parseLength = number.length - start;\n for (i = parseLength % 2 === 0 ? start + 1 : start; i < number.length; i += 2)\n (w = parseHexByte(number, start, i) << off),\n (this.words[j] |= w & 67108863),\n off >= 18 ? ((off -= 18), (j += 1), (this.words[j] |= w >>> 26)) : (off += 8);\n }\n this.strip();\n };\n function parseBase(str, start, end, mul) {\n for (var r = 0, len = Math.min(str.length, end), i = start; i < len; i++) {\n var c = str.charCodeAt(i) - 48;\n (r *= mul), c >= 49 ? (r += c - 49 + 10) : c >= 17 ? (r += c - 17 + 10) : (r += c);\n }\n return r;\n }\n (BN.prototype._parseBase = function (number, base, start) {\n (this.words = [0]), (this.length = 1);\n for (var limbLen = 0, limbPow = 1; limbPow <= 67108863; limbPow *= base) limbLen++;\n limbLen--, (limbPow = (limbPow / base) | 0);\n for (\n var total = number.length - start,\n mod = total % limbLen,\n end = Math.min(total, total - mod) + start,\n word = 0,\n i = start;\n i < end;\n i += limbLen\n )\n (word = parseBase(number, i, i + limbLen, base)),\n this.imuln(limbPow),\n this.words[0] + word < 67108864 ? (this.words[0] += word) : this._iaddn(word);\n if (mod !== 0) {\n var pow = 1;\n for (word = parseBase(number, i, number.length, base), i = 0; i < mod; i++) pow *= base;\n this.imuln(pow), this.words[0] + word < 67108864 ? (this.words[0] += word) : this._iaddn(word);\n }\n this.strip();\n }),\n (BN.prototype.copy = function (dest) {\n dest.words = new Array(this.length);\n for (var i = 0; i < this.length; i++) dest.words[i] = this.words[i];\n (dest.length = this.length), (dest.negative = this.negative), (dest.red = this.red);\n }),\n (BN.prototype.clone = function () {\n var r = new BN(null);\n return this.copy(r), r;\n }),\n (BN.prototype._expand = function (size) {\n for (; this.length < size; ) this.words[this.length++] = 0;\n return this;\n }),\n (BN.prototype.strip = function () {\n for (; this.length > 1 && this.words[this.length - 1] === 0; ) this.length--;\n return this._normSign();\n }),\n (BN.prototype._normSign = function () {\n return this.length === 1 && this.words[0] === 0 && (this.negative = 0), this;\n }),\n (BN.prototype.inspect = function () {\n return (this.red ? \"<BN-R: \" : \"<BN: \") + this.toString(16) + \">\";\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 groupSizes = [\n 0, 0, 25, 16, 12, 11, 10, 9, 8, 8, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5,\n 5, 5,\n ],\n groupBases = [\n 0, 0, 33554432, 43046721, 16777216, 48828125, 60466176, 40353607, 16777216, 43046721, 1e7, 19487171, 35831808,\n 62748517, 7529536, 11390625, 16777216, 24137569, 34012224, 47045881, 64e6, 4084101, 5153632, 6436343, 7962624,\n 9765625, 11881376, 14348907, 17210368, 20511149, 243e5, 28629151, 33554432, 39135393, 45435424, 52521875,\n 60466176,\n ];\n (BN.prototype.toString = function (base, padding) {\n (base = base || 10), (padding = padding | 0 || 1);\n var out;\n if (base === 16 || base === \"hex\") {\n out = \"\";\n for (var off = 0, carry = 0, i = 0; i < this.length; i++) {\n var w = this.words[i],\n word = (((w << off) | carry) & 16777215).toString(16);\n (carry = (w >>> (24 - off)) & 16777215),\n carry !== 0 || i !== this.length - 1 ? (out = zeros[6 - word.length] + word + out) : (out = word + out),\n (off += 2),\n off >= 26 && ((off -= 26), i--);\n }\n for (carry !== 0 && (out = carry.toString(16) + out); out.length % padding !== 0; ) out = \"0\" + out;\n return this.negative !== 0 && (out = \"-\" + out), out;\n }\n if (base === (base | 0) && base >= 2 && base <= 36) {\n var groupSize = groupSizes[base],\n groupBase = groupBases[base];\n out = \"\";\n var c = this.clone();\n for (c.negative = 0; !c.isZero(); ) {\n var r = c.modn(groupBase).toString(base);\n (c = c.idivn(groupBase)), c.isZero() ? (out = r + out) : (out = zeros[groupSize - r.length] + r + out);\n }\n for (this.isZero() && (out = \"0\" + out); out.length % padding !== 0; ) out = \"0\" + out;\n return this.negative !== 0 && (out = \"-\" + out), out;\n }\n assert(!1, \"Base should be between 2 and 36\");\n }),\n (BN.prototype.toNumber = function () {\n var ret = this.words[0];\n return (\n this.length === 2\n ? (ret += this.words[1] * 67108864)\n : this.length === 3 && this.words[2] === 1\n ? (ret += 4503599627370496 + this.words[1] * 67108864)\n : this.length > 2 && assert(!1, \"Number can only safely store up to 53 bits\"),\n this.negative !== 0 ? -ret : ret\n );\n }),\n (BN.prototype.toJSON = function () {\n return this.toString(16);\n }),\n (BN.prototype.toBuffer = function (endian, length) {\n return assert(typeof Buffer2 < \"u\"), this.toArrayLike(Buffer2, endian, length);\n }),\n (BN.prototype.toArray = function (endian, length) {\n return this.toArrayLike(Array, endian, length);\n }),\n (BN.prototype.toArrayLike = function (ArrayType, endian, length) {\n var byteLength = this.byteLength(),\n 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 this.strip();\n var littleEndian = endian === \"le\",\n res = new ArrayType(reqLength),\n b,\n i,\n q = this.clone();\n if (littleEndian) {\n for (i = 0; !q.isZero(); i++) (b = q.andln(255)), q.iushrn(8), (res[i] = b);\n for (; i < reqLength; i++) res[i] = 0;\n } else {\n for (i = 0; i < reqLength - byteLength; i++) res[i] = 0;\n for (i = 0; !q.isZero(); i++) (b = q.andln(255)), q.iushrn(8), (res[reqLength - i - 1] = b);\n }\n return res;\n }),\n Math.clz32\n ? (BN.prototype._countBits = function (w) {\n return 32 - Math.clz32(w);\n })\n : (BN.prototype._countBits = function (w) {\n var t = w,\n r = 0;\n return (\n t >= 4096 && ((r += 13), (t >>>= 13)),\n t >= 64 && ((r += 7), (t >>>= 7)),\n t >= 8 && ((r += 4), (t >>>= 4)),\n t >= 2 && ((r += 2), (t >>>= 2)),\n r + t\n );\n }),\n (BN.prototype._zeroBits = function (w) {\n if (w === 0) return 26;\n var t = w,\n r = 0;\n return (\n (t & 8191) === 0 && ((r += 13), (t >>>= 13)),\n (t & 127) === 0 && ((r += 7), (t >>>= 7)),\n (t & 15) === 0 && ((r += 4), (t >>>= 4)),\n (t & 3) === 0 && ((r += 2), (t >>>= 2)),\n (t & 1) === 0 && r++,\n r\n );\n }),\n (BN.prototype.bitLength = function () {\n var w = this.words[this.length - 1],\n hi = this._countBits(w);\n return (this.length - 1) * 26 + hi;\n });\n function toBitArray(num) {\n for (var w = new Array(num.bitLength()), bit = 0; bit < w.length; bit++) {\n var off = (bit / 26) | 0,\n wbit = bit % 26;\n w[bit] = (num.words[off] & (1 << wbit)) >>> wbit;\n }\n return w;\n }\n (BN.prototype.zeroBits = function () {\n if (this.isZero()) return 0;\n for (var r = 0, i = 0; i < this.length; i++) {\n var b = this._zeroBits(this.words[i]);\n if (((r += b), b !== 26)) break;\n }\n return r;\n }),\n (BN.prototype.byteLength = function () {\n return Math.ceil(this.bitLength() / 8);\n }),\n (BN.prototype.toTwos = function (width) {\n return this.negative !== 0 ? this.abs().inotn(width).iaddn(1) : this.clone();\n }),\n (BN.prototype.fromTwos = function (width) {\n return this.testn(width - 1) ? this.notn(width).iaddn(1).ineg() : this.clone();\n }),\n (BN.prototype.isNeg = function () {\n return this.negative !== 0;\n }),\n (BN.prototype.neg = function () {\n return this.clone().ineg();\n }),\n (BN.prototype.ineg = function () {\n return this.isZero() || (this.negative ^= 1), this;\n }),\n (BN.prototype.iuor = function (num) {\n for (; this.length < num.length; ) this.words[this.length++] = 0;\n for (var i = 0; i < num.length; i++) this.words[i] = this.words[i] | num.words[i];\n return this.strip();\n }),\n (BN.prototype.ior = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuor(num);\n }),\n (BN.prototype.or = function (num) {\n return this.length > num.length ? this.clone().ior(num) : num.clone().ior(this);\n }),\n (BN.prototype.uor = function (num) {\n return this.length > num.length ? this.clone().iuor(num) : num.clone().iuor(this);\n }),\n (BN.prototype.iuand = function (num) {\n var b;\n this.length > num.length ? (b = num) : (b = this);\n for (var i = 0; i < b.length; i++) this.words[i] = this.words[i] & num.words[i];\n return (this.length = b.length), this.strip();\n }),\n (BN.prototype.iand = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuand(num);\n }),\n (BN.prototype.and = function (num) {\n return this.length > num.length ? this.clone().iand(num) : num.clone().iand(this);\n }),\n (BN.prototype.uand = function (num) {\n return this.length > num.length ? this.clone().iuand(num) : num.clone().iuand(this);\n }),\n (BN.prototype.iuxor = function (num) {\n var a, b;\n this.length > num.length ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var i = 0; i < b.length; i++) this.words[i] = a.words[i] ^ b.words[i];\n if (this !== a) for (; i < a.length; i++) this.words[i] = a.words[i];\n return (this.length = a.length), this.strip();\n }),\n (BN.prototype.ixor = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuxor(num);\n }),\n (BN.prototype.xor = function (num) {\n return this.length > num.length ? this.clone().ixor(num) : num.clone().ixor(this);\n }),\n (BN.prototype.uxor = function (num) {\n return this.length > num.length ? this.clone().iuxor(num) : num.clone().iuxor(this);\n }),\n (BN.prototype.inotn = function (width) {\n assert(typeof width == \"number\" && width >= 0);\n var bytesNeeded = Math.ceil(width / 26) | 0,\n bitsLeft = width % 26;\n this._expand(bytesNeeded), bitsLeft > 0 && bytesNeeded--;\n for (var i = 0; i < bytesNeeded; i++) this.words[i] = ~this.words[i] & 67108863;\n return bitsLeft > 0 && (this.words[i] = ~this.words[i] & (67108863 >> (26 - bitsLeft))), this.strip();\n }),\n (BN.prototype.notn = function (width) {\n return this.clone().inotn(width);\n }),\n (BN.prototype.setn = function (bit, val) {\n assert(typeof bit == \"number\" && bit >= 0);\n var off = (bit / 26) | 0,\n wbit = bit % 26;\n return (\n this._expand(off + 1),\n val\n ? (this.words[off] = this.words[off] | (1 << wbit))\n : (this.words[off] = this.words[off] & ~(1 << wbit)),\n this.strip()\n );\n }),\n (BN.prototype.iadd = function (num) {\n var r;\n if (this.negative !== 0 && num.negative === 0)\n return (this.negative = 0), (r = this.isub(num)), (this.negative ^= 1), this._normSign();\n if (this.negative === 0 && num.negative !== 0)\n return (num.negative = 0), (r = this.isub(num)), (num.negative = 1), r._normSign();\n var a, b;\n this.length > num.length ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var carry = 0, i = 0; i < b.length; i++)\n (r = (a.words[i] | 0) + (b.words[i] | 0) + carry), (this.words[i] = r & 67108863), (carry = r >>> 26);\n for (; carry !== 0 && i < a.length; i++)\n (r = (a.words[i] | 0) + carry), (this.words[i] = r & 67108863), (carry = r >>> 26);\n if (((this.length = a.length), carry !== 0)) (this.words[this.length] = carry), this.length++;\n else if (a !== this) for (; i < a.length; i++) this.words[i] = a.words[i];\n return this;\n }),\n (BN.prototype.add = function (num) {\n var res;\n return num.negative !== 0 && this.negative === 0\n ? ((num.negative = 0), (res = this.sub(num)), (num.negative ^= 1), res)\n : num.negative === 0 && this.negative !== 0\n ? ((this.negative = 0), (res = num.sub(this)), (this.negative = 1), res)\n : this.length > num.length\n ? this.clone().iadd(num)\n : num.clone().iadd(this);\n }),\n (BN.prototype.isub = function (num) {\n if (num.negative !== 0) {\n num.negative = 0;\n var r = this.iadd(num);\n return (num.negative = 1), r._normSign();\n } else if (this.negative !== 0)\n return (this.negative = 0), this.iadd(num), (this.negative = 1), this._normSign();\n var cmp = this.cmp(num);\n if (cmp === 0) return (this.negative = 0), (this.length = 1), (this.words[0] = 0), this;\n var a, b;\n cmp > 0 ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var carry = 0, i = 0; i < b.length; i++)\n (r = (a.words[i] | 0) - (b.words[i] | 0) + carry), (carry = r >> 26), (this.words[i] = r & 67108863);\n for (; carry !== 0 && i < a.length; i++)\n (r = (a.words[i] | 0) + carry), (carry = r >> 26), (this.words[i] = r & 67108863);\n if (carry === 0 && i < a.length && a !== this) for (; i < a.length; i++) this.words[i] = a.words[i];\n return (this.length = Math.max(this.length, i)), a !== this && (this.negative = 1), this.strip();\n }),\n (BN.prototype.sub = function (num) {\n return this.clone().isub(num);\n });\n function smallMulTo(self2, num, out) {\n out.negative = num.negative ^ self2.negative;\n var len = (self2.length + num.length) | 0;\n (out.length = len), (len = (len - 1) | 0);\n var a = self2.words[0] | 0,\n b = num.words[0] | 0,\n r = a * b,\n lo = r & 67108863,\n carry = (r / 67108864) | 0;\n out.words[0] = lo;\n for (var k = 1; k < len; k++) {\n for (\n var ncarry = carry >>> 26,\n rword = carry & 67108863,\n maxJ = Math.min(k, num.length - 1),\n j = Math.max(0, k - self2.length + 1);\n j <= maxJ;\n j++\n ) {\n var i = (k - j) | 0;\n (a = self2.words[i] | 0),\n (b = num.words[j] | 0),\n (r = a * b + rword),\n (ncarry += (r / 67108864) | 0),\n (rword = r & 67108863);\n }\n (out.words[k] = rword | 0), (carry = ncarry | 0);\n }\n return carry !== 0 ? (out.words[k] = carry | 0) : out.length--, out.strip();\n }\n var comb10MulTo = function (self2, num, out) {\n var a = self2.words,\n b = num.words,\n o = out.words,\n c = 0,\n lo,\n mid,\n hi,\n a0 = a[0] | 0,\n al0 = a0 & 8191,\n ah0 = a0 >>> 13,\n a1 = a[1] | 0,\n al1 = a1 & 8191,\n ah1 = a1 >>> 13,\n a2 = a[2] | 0,\n al2 = a2 & 8191,\n ah2 = a2 >>> 13,\n a3 = a[3] | 0,\n al3 = a3 & 8191,\n ah3 = a3 >>> 13,\n a4 = a[4] | 0,\n al4 = a4 & 8191,\n ah4 = a4 >>> 13,\n a5 = a[5] | 0,\n al5 = a5 & 8191,\n ah5 = a5 >>> 13,\n a6 = a[6] | 0,\n al6 = a6 & 8191,\n ah6 = a6 >>> 13,\n a7 = a[7] | 0,\n al7 = a7 & 8191,\n ah7 = a7 >>> 13,\n a8 = a[8] | 0,\n al8 = a8 & 8191,\n ah8 = a8 >>> 13,\n a9 = a[9] | 0,\n al9 = a9 & 8191,\n ah9 = a9 >>> 13,\n b0 = b[0] | 0,\n bl0 = b0 & 8191,\n bh0 = b0 >>> 13,\n b1 = b[1] | 0,\n bl1 = b1 & 8191,\n bh1 = b1 >>> 13,\n b2 = b[2] | 0,\n bl2 = b2 & 8191,\n bh2 = b2 >>> 13,\n b3 = b[3] | 0,\n bl3 = b3 & 8191,\n bh3 = b3 >>> 13,\n b4 = b[4] | 0,\n bl4 = b4 & 8191,\n bh4 = b4 >>> 13,\n b5 = b[5] | 0,\n bl5 = b5 & 8191,\n bh5 = b5 >>> 13,\n b6 = b[6] | 0,\n bl6 = b6 & 8191,\n bh6 = b6 >>> 13,\n b7 = b[7] | 0,\n bl7 = b7 & 8191,\n bh7 = b7 >>> 13,\n b8 = b[8] | 0,\n bl8 = b8 & 8191,\n bh8 = b8 >>> 13,\n b9 = b[9] | 0,\n bl9 = b9 & 8191,\n bh9 = b9 >>> 13;\n (out.negative = self2.negative ^ num.negative),\n (out.length = 19),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w0 >>> 26)) | 0),\n (w0 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w1 >>> 26)) | 0),\n (w1 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w2 >>> 26)) | 0),\n (w2 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w3 >>> 26)) | 0),\n (w3 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w4 >>> 26)) | 0),\n (w4 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w5 >>> 26)) | 0),\n (w5 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w6 >>> 26)) | 0),\n (w6 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w7 >>> 26)) | 0),\n (w7 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w8 >>> 26)) | 0),\n (w8 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w9 >>> 26)) | 0),\n (w9 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w10 >>> 26)) | 0),\n (w10 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w11 >>> 26)) | 0),\n (w11 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w12 >>> 26)) | 0),\n (w12 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w13 >>> 26)) | 0),\n (w13 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w14 >>> 26)) | 0),\n (w14 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w15 >>> 26)) | 0),\n (w15 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w16 >>> 26)) | 0),\n (w16 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w17 >>> 26)) | 0),\n (w17 &= 67108863),\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 & 8191) << 13)) | 0;\n return (\n (c = (((hi + (mid >>> 13)) | 0) + (w18 >>> 26)) | 0),\n (w18 &= 67108863),\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 c !== 0 && ((o[19] = c), out.length++),\n out\n );\n };\n Math.imul || (comb10MulTo = smallMulTo);\n function bigMulTo(self2, num, out) {\n (out.negative = num.negative ^ self2.negative), (out.length = self2.length + num.length);\n for (var carry = 0, hncarry = 0, k = 0; k < out.length - 1; k++) {\n var ncarry = hncarry;\n hncarry = 0;\n for (\n var rword = carry & 67108863, maxJ = Math.min(k, num.length - 1), j = Math.max(0, k - self2.length + 1);\n j <= maxJ;\n j++\n ) {\n var i = k - j,\n a = self2.words[i] | 0,\n b = num.words[j] | 0,\n r = a * b,\n lo = r & 67108863;\n (ncarry = (ncarry + ((r / 67108864) | 0)) | 0),\n (lo = (lo + rword) | 0),\n (rword = lo & 67108863),\n (ncarry = (ncarry + (lo >>> 26)) | 0),\n (hncarry += ncarry >>> 26),\n (ncarry &= 67108863);\n }\n (out.words[k] = rword), (carry = ncarry), (ncarry = hncarry);\n }\n return carry !== 0 ? (out.words[k] = carry) : out.length--, out.strip();\n }\n function jumboMulTo(self2, num, out) {\n var fftm = new FFTM();\n return fftm.mulp(self2, num, out);\n }\n BN.prototype.mulTo = function (num, out) {\n var res,\n len = this.length + num.length;\n return (\n this.length === 10 && num.length === 10\n ? (res = comb10MulTo(this, num, out))\n : len < 63\n ? (res = smallMulTo(this, num, out))\n : len < 1024\n ? (res = bigMulTo(this, num, out))\n : (res = jumboMulTo(this, num, out)),\n res\n );\n };\n function FFTM(x, y) {\n (this.x = x), (this.y = y);\n }\n (FFTM.prototype.makeRBT = function (N) {\n for (var t = new Array(N), l = BN.prototype._countBits(N) - 1, i = 0; i < N; i++) t[i] = this.revBin(i, l, N);\n return t;\n }),\n (FFTM.prototype.revBin = function (x, l, N) {\n if (x === 0 || x === N - 1) return x;\n for (var rb = 0, i = 0; i < l; i++) (rb |= (x & 1) << (l - i - 1)), (x >>= 1);\n return rb;\n }),\n (FFTM.prototype.permute = function (rbt, rws, iws, rtws, itws, N) {\n for (var i = 0; i < N; i++) (rtws[i] = rws[rbt[i]]), (itws[i] = iws[rbt[i]]);\n }),\n (FFTM.prototype.transform = function (rws, iws, rtws, itws, N, rbt) {\n this.permute(rbt, rws, iws, rtws, itws, N);\n for (var s = 1; s < N; s <<= 1)\n for (\n var l = s << 1, rtwdf = Math.cos((2 * Math.PI) / l), itwdf = Math.sin((2 * Math.PI) / l), p = 0;\n p < N;\n p += l\n )\n for (var rtwdf_ = rtwdf, itwdf_ = itwdf, j = 0; j < s; j++) {\n var re = rtws[p + j],\n ie = itws[p + j],\n ro = rtws[p + j + s],\n io = itws[p + j + s],\n rx = rtwdf_ * ro - itwdf_ * io;\n (io = rtwdf_ * io + itwdf_ * ro),\n (ro = rx),\n (rtws[p + j] = re + ro),\n (itws[p + j] = ie + io),\n (rtws[p + j + s] = re - ro),\n (itws[p + j + s] = ie - io),\n j !== l &&\n ((rx = rtwdf * rtwdf_ - itwdf * itwdf_), (itwdf_ = rtwdf * itwdf_ + itwdf * rtwdf_), (rtwdf_ = rx));\n }\n }),\n (FFTM.prototype.guessLen13b = function (n, m) {\n var N = Math.max(m, n) | 1,\n odd = N & 1,\n i = 0;\n for (N = (N / 2) | 0; N; N = N >>> 1) i++;\n return 1 << (i + 1 + odd);\n }),\n (FFTM.prototype.conjugate = function (rws, iws, N) {\n if (!(N <= 1))\n for (var i = 0; i < N / 2; i++) {\n var t = rws[i];\n (rws[i] = rws[N - i - 1]),\n (rws[N - i - 1] = t),\n (t = iws[i]),\n (iws[i] = -iws[N - i - 1]),\n (iws[N - i - 1] = -t);\n }\n }),\n (FFTM.prototype.normalize13b = function (ws, N) {\n for (var carry = 0, i = 0; i < N / 2; i++) {\n var w = Math.round(ws[2 * i + 1] / N) * 8192 + Math.round(ws[2 * i] / N) + carry;\n (ws[i] = w & 67108863), w < 67108864 ? (carry = 0) : (carry = (w / 67108864) | 0);\n }\n return ws;\n }),\n (FFTM.prototype.convert13b = function (ws, len, rws, N) {\n for (var carry = 0, i = 0; i < len; i++)\n (carry = carry + (ws[i] | 0)),\n (rws[2 * i] = carry & 8191),\n (carry = carry >>> 13),\n (rws[2 * i + 1] = carry & 8191),\n (carry = carry >>> 13);\n for (i = 2 * len; i < N; ++i) rws[i] = 0;\n assert(carry === 0), assert((carry & -8192) === 0);\n }),\n (FFTM.prototype.stub = function (N) {\n for (var ph = new Array(N), i = 0; i < N; i++) ph[i] = 0;\n return ph;\n }),\n (FFTM.prototype.mulp = function (x, y, out) {\n var N = 2 * this.guessLen13b(x.length, y.length),\n rbt = this.makeRBT(N),\n _ = this.stub(N),\n rws = new Array(N),\n rwst = new Array(N),\n iwst = new Array(N),\n nrws = new Array(N),\n nrwst = new Array(N),\n niwst = new Array(N),\n rmws = out.words;\n (rmws.length = N),\n this.convert13b(x.words, x.length, rws, N),\n this.convert13b(y.words, y.length, nrws, N),\n this.transform(rws, _, rwst, iwst, N, rbt),\n this.transform(nrws, _, nrwst, niwst, N, rbt);\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]), (rwst[i] = rx);\n }\n return (\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 (out.negative = x.negative ^ y.negative),\n (out.length = x.length + y.length),\n out.strip()\n );\n }),\n (BN.prototype.mul = function (num) {\n var out = new BN(null);\n return (out.words = new Array(this.length + num.length)), this.mulTo(num, out);\n }),\n (BN.prototype.mulf = function (num) {\n var out = new BN(null);\n return (out.words = new Array(this.length + num.length)), jumboMulTo(this, num, out);\n }),\n (BN.prototype.imul = function (num) {\n return this.clone().mulTo(num, this);\n }),\n (BN.prototype.imuln = function (num) {\n assert(typeof num == \"number\"), assert(num < 67108864);\n for (var carry = 0, i = 0; i < this.length; i++) {\n var w = (this.words[i] | 0) * num,\n lo = (w & 67108863) + (carry & 67108863);\n (carry >>= 26), (carry += (w / 67108864) | 0), (carry += lo >>> 26), (this.words[i] = lo & 67108863);\n }\n return carry !== 0 && ((this.words[i] = carry), this.length++), this;\n }),\n (BN.prototype.muln = function (num) {\n return this.clone().imuln(num);\n }),\n (BN.prototype.sqr = function () {\n return this.mul(this);\n }),\n (BN.prototype.isqr = function () {\n return this.imul(this.clone());\n }),\n (BN.prototype.pow = function (num) {\n var w = toBitArray(num);\n if (w.length === 0) return new BN(1);\n for (var res = this, i = 0; i < w.length && w[i] === 0; i++, res = res.sqr());\n if (++i < w.length) for (var q = res.sqr(); i < w.length; i++, q = q.sqr()) w[i] !== 0 && (res = res.mul(q));\n return res;\n }),\n (BN.prototype.iushln = function (bits) {\n assert(typeof bits == \"number\" && bits >= 0);\n var r = bits % 26,\n s = (bits - r) / 26,\n carryMask = (67108863 >>> (26 - r)) << (26 - r),\n i;\n if (r !== 0) {\n var carry = 0;\n for (i = 0; i < this.length; i++) {\n var newCarry = this.words[i] & carryMask,\n c = ((this.words[i] | 0) - newCarry) << r;\n (this.words[i] = c | carry), (carry = newCarry >>> (26 - r));\n }\n carry && ((this.words[i] = carry), this.length++);\n }\n if (s !== 0) {\n for (i = this.length - 1; i >= 0; i--) this.words[i + s] = this.words[i];\n for (i = 0; i < s; i++) this.words[i] = 0;\n this.length += s;\n }\n return this.strip();\n }),\n (BN.prototype.ishln = function (bits) {\n return assert(this.negative === 0), this.iushln(bits);\n }),\n (BN.prototype.iushrn = function (bits, hint, extended) {\n assert(typeof bits == \"number\" && bits >= 0);\n var h;\n hint ? (h = (hint - (hint % 26)) / 26) : (h = 0);\n var r = bits % 26,\n s = Math.min((bits - r) / 26, this.length),\n mask = 67108863 ^ ((67108863 >>> r) << r),\n maskedWords = extended;\n if (((h -= s), (h = Math.max(0, h)), maskedWords)) {\n for (var i = 0; i < s; i++) maskedWords.words[i] = this.words[i];\n maskedWords.length = s;\n }\n if (s !== 0)\n if (this.length > s) for (this.length -= s, i = 0; i < this.length; i++) this.words[i] = this.words[i + s];\n else (this.words[0] = 0), (this.length = 1);\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)), (carry = word & mask);\n }\n return (\n maskedWords && carry !== 0 && (maskedWords.words[maskedWords.length++] = carry),\n this.length === 0 && ((this.words[0] = 0), (this.length = 1)),\n this.strip()\n );\n }),\n (BN.prototype.ishrn = function (bits, hint, extended) {\n return assert(this.negative === 0), this.iushrn(bits, hint, extended);\n }),\n (BN.prototype.shln = function (bits) {\n return this.clone().ishln(bits);\n }),\n (BN.prototype.ushln = function (bits) {\n return this.clone().iushln(bits);\n }),\n (BN.prototype.shrn = function (bits) {\n return this.clone().ishrn(bits);\n }),\n (BN.prototype.ushrn = function (bits) {\n return this.clone().iushrn(bits);\n }),\n (BN.prototype.testn = function (bit) {\n assert(typeof bit == \"number\" && bit >= 0);\n var r = bit % 26,\n s = (bit - r) / 26,\n q = 1 << r;\n if (this.length <= s) return !1;\n var w = this.words[s];\n return !!(w & q);\n }),\n (BN.prototype.imaskn = function (bits) {\n assert(typeof bits == \"number\" && bits >= 0);\n var r = bits % 26,\n s = (bits - r) / 26;\n if ((assert(this.negative === 0, \"imaskn works only with positive numbers\"), this.length <= s)) return this;\n if ((r !== 0 && s++, (this.length = Math.min(s, this.length)), r !== 0)) {\n var mask = 67108863 ^ ((67108863 >>> r) << r);\n this.words[this.length - 1] &= mask;\n }\n return this.strip();\n }),\n (BN.prototype.maskn = function (bits) {\n return this.clone().imaskn(bits);\n }),\n (BN.prototype.iaddn = function (num) {\n return (\n assert(typeof num == \"number\"),\n assert(num < 67108864),\n num < 0\n ? this.isubn(-num)\n : this.negative !== 0\n ? this.length === 1 && (this.words[0] | 0) < num\n ? ((this.words[0] = num - (this.words[0] | 0)), (this.negative = 0), this)\n : ((this.negative = 0), this.isubn(num), (this.negative = 1), this)\n : this._iaddn(num)\n );\n }),\n (BN.prototype._iaddn = function (num) {\n this.words[0] += num;\n for (var i = 0; i < this.length && this.words[i] >= 67108864; i++)\n (this.words[i] -= 67108864), i === this.length - 1 ? (this.words[i + 1] = 1) : this.words[i + 1]++;\n return (this.length = Math.max(this.length, i + 1)), this;\n }),\n (BN.prototype.isubn = function (num) {\n if ((assert(typeof num == \"number\"), assert(num < 67108864), num < 0)) return this.iaddn(-num);\n if (this.negative !== 0) return (this.negative = 0), this.iaddn(num), (this.negative = 1), this;\n if (((this.words[0] -= num), this.length === 1 && this.words[0] < 0))\n (this.words[0] = -this.words[0]), (this.negative = 1);\n else\n for (var i = 0; i < this.length && this.words[i] < 0; i++)\n (this.words[i] += 67108864), (this.words[i + 1] -= 1);\n return this.strip();\n }),\n (BN.prototype.addn = function (num) {\n return this.clone().iaddn(num);\n }),\n (BN.prototype.subn = function (num) {\n return this.clone().isubn(num);\n }),\n (BN.prototype.iabs = function () {\n return (this.negative = 0), this;\n }),\n (BN.prototype.abs = function () {\n return this.clone().iabs();\n }),\n (BN.prototype._ishlnsubmul = function (num, mul, shift) {\n var len = num.length + shift,\n i;\n this._expand(len);\n var w,\n 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 & 67108863),\n (carry = (w >> 26) - ((right / 67108864) | 0)),\n (this.words[i + shift] = w & 67108863);\n }\n for (; i < this.length - shift; i++)\n (w = (this.words[i + shift] | 0) + carry), (carry = w >> 26), (this.words[i + shift] = w & 67108863);\n if (carry === 0) return this.strip();\n for (assert(carry === -1), carry = 0, i = 0; i < this.length; i++)\n (w = -(this.words[i] | 0) + carry), (carry = w >> 26), (this.words[i] = w & 67108863);\n return (this.negative = 1), this.strip();\n }),\n (BN.prototype._wordDiv = function (num, mode) {\n var shift = this.length - num.length,\n a = this.clone(),\n b = num,\n bhi = b.words[b.length - 1] | 0,\n bhiBits = this._countBits(bhi);\n (shift = 26 - bhiBits),\n shift !== 0 && ((b = b.ushln(shift)), a.iushln(shift), (bhi = b.words[b.length - 1] | 0));\n var m = a.length - b.length,\n q;\n if (mode !== \"mod\") {\n (q = new BN(null)), (q.length = m + 1), (q.words = new Array(q.length));\n for (var i = 0; i < q.length; i++) q.words[i] = 0;\n }\n var diff = a.clone()._ishlnsubmul(b, 1, m);\n diff.negative === 0 && ((a = diff), q && (q.words[m] = 1));\n for (var j = m - 1; j >= 0; j--) {\n var qj = (a.words[b.length + j] | 0) * 67108864 + (a.words[b.length + j - 1] | 0);\n for (qj = Math.min((qj / bhi) | 0, 67108863), a._ishlnsubmul(b, qj, j); a.negative !== 0; )\n qj--, (a.negative = 0), a._ishlnsubmul(b, 1, j), a.isZero() || (a.negative ^= 1);\n q && (q.words[j] = qj);\n }\n return (\n q && q.strip(),\n a.strip(),\n mode !== \"div\" && shift !== 0 && a.iushrn(shift),\n {\n div: q || null,\n mod: a,\n }\n );\n }),\n (BN.prototype.divmod = function (num, mode, positive) {\n if ((assert(!num.isZero()), this.isZero()))\n return {\n div: new BN(0),\n mod: new BN(0),\n };\n var div, mod, res;\n return this.negative !== 0 && num.negative === 0\n ? ((res = this.neg().divmod(num, mode)),\n mode !== \"mod\" && (div = res.div.neg()),\n mode !== \"div\" && ((mod = res.mod.neg()), positive && mod.negative !== 0 && mod.iadd(num)),\n {\n div,\n mod,\n })\n : this.negative === 0 && num.negative !== 0\n ? ((res = this.divmod(num.neg(), mode)),\n mode !== \"mod\" && (div = res.div.neg()),\n {\n div,\n mod: res.mod,\n })\n : (this.negative & num.negative) !== 0\n ? ((res = this.neg().divmod(num.neg(), mode)),\n mode !== \"div\" && ((mod = res.mod.neg()), positive && mod.negative !== 0 && mod.isub(num)),\n {\n div: res.div,\n mod,\n })\n : num.length > this.length || this.cmp(num) < 0\n ? {\n div: new BN(0),\n mod: this,\n }\n : num.length === 1\n ? mode === \"div\"\n ? {\n div: this.divn(num.words[0]),\n mod: null,\n }\n : mode === \"mod\"\n ? {\n div: null,\n mod: new BN(this.modn(num.words[0])),\n }\n : {\n div: this.divn(num.words[0]),\n mod: new BN(this.modn(num.words[0])),\n }\n : this._wordDiv(num, mode);\n }),\n (BN.prototype.div = function (num) {\n return this.divmod(num, \"div\", !1).div;\n }),\n (BN.prototype.mod = function (num) {\n return this.divmod(num, \"mod\", !1).mod;\n }),\n (BN.prototype.umod = function (num) {\n return this.divmod(num, \"mod\", !0).mod;\n }),\n (BN.prototype.divRound = function (num) {\n var dm = this.divmod(num);\n if (dm.mod.isZero()) return dm.div;\n var mod = dm.div.negative !== 0 ? dm.mod.isub(num) : dm.mod,\n half = num.ushrn(1),\n r2 = num.andln(1),\n cmp = mod.cmp(half);\n return cmp < 0 || (r2 === 1 && cmp === 0)\n ? dm.div\n : dm.div.negative !== 0\n ? dm.div.isubn(1)\n : dm.div.iaddn(1);\n }),\n (BN.prototype.modn = function (num) {\n assert(num <= 67108863);\n for (var p = (1 << 26) % num, acc = 0, i = this.length - 1; i >= 0; i--)\n acc = (p * acc + (this.words[i] | 0)) % num;\n return acc;\n }),\n (BN.prototype.idivn = function (num) {\n assert(num <= 67108863);\n for (var carry = 0, i = this.length - 1; i >= 0; i--) {\n var w = (this.words[i] | 0) + carry * 67108864;\n (this.words[i] = (w / num) | 0), (carry = w % num);\n }\n return this.strip();\n }),\n (BN.prototype.divn = function (num) {\n return this.clone().idivn(num);\n }),\n (BN.prototype.egcd = function (p) {\n assert(p.negative === 0), assert(!p.isZero());\n var x = this,\n y = p.clone();\n x.negative !== 0 ? (x = x.umod(p)) : (x = x.clone());\n for (var A = new BN(1), B = new BN(0), C = new BN(0), D = new BN(1), g = 0; x.isEven() && y.isEven(); )\n x.iushrn(1), y.iushrn(1), ++g;\n for (var yp = y.clone(), xp = x.clone(); !x.isZero(); ) {\n for (var i = 0, im = 1; (x.words[0] & im) === 0 && i < 26; ++i, im <<= 1);\n if (i > 0)\n for (x.iushrn(i); i-- > 0; )\n (A.isOdd() || B.isOdd()) && (A.iadd(yp), B.isub(xp)), A.iushrn(1), B.iushrn(1);\n for (var j = 0, jm = 1; (y.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n if (j > 0)\n for (y.iushrn(j); j-- > 0; )\n (C.isOdd() || D.isOdd()) && (C.iadd(yp), D.isub(xp)), C.iushrn(1), D.iushrn(1);\n x.cmp(y) >= 0 ? (x.isub(y), A.isub(C), B.isub(D)) : (y.isub(x), C.isub(A), D.isub(B));\n }\n return {\n a: C,\n b: D,\n gcd: y.iushln(g),\n };\n }),\n (BN.prototype._invmp = function (p) {\n assert(p.negative === 0), assert(!p.isZero());\n var a = this,\n b = p.clone();\n a.negative !== 0 ? (a = a.umod(p)) : (a = a.clone());\n for (var x1 = new BN(1), x2 = new BN(0), delta = b.clone(); 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) for (a.iushrn(i); i-- > 0; ) x1.isOdd() && x1.iadd(delta), x1.iushrn(1);\n for (var j = 0, jm = 1; (b.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n if (j > 0) for (b.iushrn(j); j-- > 0; ) x2.isOdd() && x2.iadd(delta), x2.iushrn(1);\n a.cmp(b) >= 0 ? (a.isub(b), x1.isub(x2)) : (b.isub(a), x2.isub(x1));\n }\n var res;\n return a.cmpn(1) === 0 ? (res = x1) : (res = x2), res.cmpn(0) < 0 && res.iadd(p), res;\n }),\n (BN.prototype.gcd = function (num) {\n if (this.isZero()) return num.abs();\n if (num.isZero()) return this.abs();\n var a = this.clone(),\n b = num.clone();\n (a.negative = 0), (b.negative = 0);\n for (var shift = 0; a.isEven() && b.isEven(); shift++) a.iushrn(1), b.iushrn(1);\n do {\n for (; a.isEven(); ) a.iushrn(1);\n for (; b.isEven(); ) b.iushrn(1);\n var r = a.cmp(b);\n if (r < 0) {\n var t = a;\n (a = b), (b = t);\n } else if (r === 0 || b.cmpn(1) === 0) break;\n a.isub(b);\n } while (!0);\n return b.iushln(shift);\n }),\n (BN.prototype.invm = function (num) {\n return this.egcd(num).a.umod(num);\n }),\n (BN.prototype.isEven = function () {\n return (this.words[0] & 1) === 0;\n }),\n (BN.prototype.isOdd = function () {\n return (this.words[0] & 1) === 1;\n }),\n (BN.prototype.andln = function (num) {\n return this.words[0] & num;\n }),\n (BN.prototype.bincn = function (bit) {\n assert(typeof bit == \"number\");\n var r = bit % 26,\n s = (bit - r) / 26,\n q = 1 << r;\n if (this.length <= s) return this._expand(s + 1), (this.words[s] |= q), this;\n for (var carry = q, i = s; carry !== 0 && i < this.length; i++) {\n var w = this.words[i] | 0;\n (w += carry), (carry = w >>> 26), (w &= 67108863), (this.words[i] = w);\n }\n return carry !== 0 && ((this.words[i] = carry), this.length++), this;\n }),\n (BN.prototype.isZero = function () {\n return this.length === 1 && this.words[0] === 0;\n }),\n (BN.prototype.cmpn = function (num) {\n var negative = num < 0;\n if (this.negative !== 0 && !negative) return -1;\n if (this.negative === 0 && negative) return 1;\n this.strip();\n var res;\n if (this.length > 1) res = 1;\n else {\n negative && (num = -num), assert(num <= 67108863, \"Number is too big\");\n var w = this.words[0] | 0;\n res = w === num ? 0 : w < num ? -1 : 1;\n }\n return this.negative !== 0 ? -res | 0 : res;\n }),\n (BN.prototype.cmp = function (num) {\n if (this.negative !== 0 && num.negative === 0) return -1;\n if (this.negative === 0 && num.negative !== 0) return 1;\n var res = this.ucmp(num);\n return this.negative !== 0 ? -res | 0 : res;\n }),\n (BN.prototype.ucmp = function (num) {\n if (this.length > num.length) return 1;\n if (this.length < num.length) return -1;\n for (var res = 0, i = this.length - 1; i >= 0; i--) {\n var a = this.words[i] | 0,\n b = num.words[i] | 0;\n if (a !== b) {\n a < b ? (res = -1) : a > b && (res = 1);\n break;\n }\n }\n return res;\n }),\n (BN.prototype.gtn = function (num) {\n return this.cmpn(num) === 1;\n }),\n (BN.prototype.gt = function (num) {\n return this.cmp(num) === 1;\n }),\n (BN.prototype.gten = function (num) {\n return this.cmpn(num) >= 0;\n }),\n (BN.prototype.gte = function (num) {\n return this.cmp(num) >= 0;\n }),\n (BN.prototype.ltn = function (num) {\n return this.cmpn(num) === -1;\n }),\n (BN.prototype.lt = function (num) {\n return this.cmp(num) === -1;\n }),\n (BN.prototype.lten = function (num) {\n return this.cmpn(num) <= 0;\n }),\n (BN.prototype.lte = function (num) {\n return this.cmp(num) <= 0;\n }),\n (BN.prototype.eqn = function (num) {\n return this.cmpn(num) === 0;\n }),\n (BN.prototype.eq = function (num) {\n return this.cmp(num) === 0;\n }),\n (BN.red = function (num) {\n return new Red(num);\n }),\n (BN.prototype.toRed = function (ctx) {\n return (\n assert(!this.red, \"Already a number in reduction context\"),\n assert(this.negative === 0, \"red works only with positives\"),\n ctx.convertTo(this)._forceRed(ctx)\n );\n }),\n (BN.prototype.fromRed = function () {\n return assert(this.red, \"fromRed works only with numbers in reduction context\"), this.red.convertFrom(this);\n }),\n (BN.prototype._forceRed = function (ctx) {\n return (this.red = ctx), this;\n }),\n (BN.prototype.forceRed = function (ctx) {\n return assert(!this.red, \"Already a number in reduction context\"), this._forceRed(ctx);\n }),\n (BN.prototype.redAdd = function (num) {\n return assert(this.red, \"redAdd works only with red numbers\"), this.red.add(this, num);\n }),\n (BN.prototype.redIAdd = function (num) {\n return assert(this.red, \"redIAdd works only with red numbers\"), this.red.iadd(this, num);\n }),\n (BN.prototype.redSub = function (num) {\n return assert(this.red, \"redSub works only with red numbers\"), this.red.sub(this, num);\n }),\n (BN.prototype.redISub = function (num) {\n return assert(this.red, \"redISub works only with red numbers\"), this.red.isub(this, num);\n }),\n (BN.prototype.redShl = function (num) {\n return assert(this.red, \"redShl works only with red numbers\"), this.red.shl(this, num);\n }),\n (BN.prototype.redMul = function (num) {\n return (\n assert(this.red, \"redMul works only with red numbers\"),\n this.red._verify2(this, num),\n this.red.mul(this, num)\n );\n }),\n (BN.prototype.redIMul = function (num) {\n return (\n assert(this.red, \"redMul works only with red numbers\"),\n this.red._verify2(this, num),\n this.red.imul(this, num)\n );\n }),\n (BN.prototype.redSqr = function () {\n return assert(this.red, \"redSqr works only with red numbers\"), this.red._verify1(this), this.red.sqr(this);\n }),\n (BN.prototype.redISqr = function () {\n return assert(this.red, \"redISqr works only with red numbers\"), this.red._verify1(this), this.red.isqr(this);\n }),\n (BN.prototype.redSqrt = function () {\n return assert(this.red, \"redSqrt works only with red numbers\"), this.red._verify1(this), this.red.sqrt(this);\n }),\n (BN.prototype.redInvm = function () {\n return assert(this.red, \"redInvm works only with red numbers\"), this.red._verify1(this), this.red.invm(this);\n }),\n (BN.prototype.redNeg = function () {\n return assert(this.red, \"redNeg works only with red numbers\"), this.red._verify1(this), this.red.neg(this);\n }),\n (BN.prototype.redPow = function (num) {\n return assert(this.red && !num.red, \"redPow(normalNum)\"), this.red._verify1(this), this.red.pow(this, num);\n });\n var primes = {\n k256: null,\n p224: null,\n p192: null,\n p25519: null,\n };\n function MPrime(name, p) {\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 (this.tmp = this._tmp());\n }\n (MPrime.prototype._tmp = function () {\n var tmp = new BN(null);\n return (tmp.words = new Array(Math.ceil(this.n / 13))), tmp;\n }),\n (MPrime.prototype.ireduce = function (num) {\n var r = num,\n rlen;\n do this.split(r, this.tmp), (r = this.imulK(r)), (r = r.iadd(this.tmp)), (rlen = r.bitLength());\n while (rlen > this.n);\n var cmp = rlen < this.n ? -1 : r.ucmp(this.p);\n return (\n cmp === 0\n ? ((r.words[0] = 0), (r.length = 1))\n : cmp > 0\n ? r.isub(this.p)\n : r.strip !== void 0\n ? r.strip()\n : r._strip(),\n r\n );\n }),\n (MPrime.prototype.split = function (input, out) {\n input.iushrn(this.n, 0, out);\n }),\n (MPrime.prototype.imulK = function (num) {\n return num.imul(this.k);\n });\n function K256() {\n MPrime.call(this, \"k256\", \"ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f\");\n }\n inherits(K256, MPrime),\n (K256.prototype.split = function (input, output) {\n for (var mask = 4194303, outLen = Math.min(input.length, 9), i = 0; i < outLen; i++)\n output.words[i] = input.words[i];\n if (((output.length = outLen), input.length <= 9)) {\n (input.words[0] = 0), (input.length = 1);\n return;\n }\n var prev = input.words[9];\n for (output.words[output.length++] = prev & mask, i = 10; i < input.length; i++) {\n var next = input.words[i] | 0;\n (input.words[i - 10] = ((next & mask) << 4) | (prev >>> 22)), (prev = next);\n }\n (prev >>>= 22),\n (input.words[i - 10] = prev),\n prev === 0 && input.length > 10 ? (input.length -= 10) : (input.length -= 9);\n }),\n (K256.prototype.imulK = function (num) {\n (num.words[num.length] = 0), (num.words[num.length + 1] = 0), (num.length += 2);\n for (var lo = 0, i = 0; i < num.length; i++) {\n var w = num.words[i] | 0;\n (lo += w * 977), (num.words[i] = lo & 67108863), (lo = w * 64 + ((lo / 67108864) | 0));\n }\n return (\n num.words[num.length - 1] === 0 && (num.length--, num.words[num.length - 1] === 0 && num.length--), num\n );\n });\n function P224() {\n MPrime.call(this, \"p224\", \"ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001\");\n }\n inherits(P224, MPrime);\n function P192() {\n MPrime.call(this, \"p192\", \"ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff\");\n }\n inherits(P192, MPrime);\n function P25519() {\n MPrime.call(this, \"25519\", \"7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed\");\n }\n inherits(P25519, MPrime),\n (P25519.prototype.imulK = function (num) {\n for (var carry = 0, i = 0; i < num.length; i++) {\n var hi = (num.words[i] | 0) * 19 + carry,\n lo = hi & 67108863;\n (hi >>>= 26), (num.words[i] = lo), (carry = hi);\n }\n return carry !== 0 && (num.words[num.length++] = carry), num;\n }),\n (BN._prime = function (name) {\n if (primes[name]) return primes[name];\n var prime2;\n if (name === \"k256\") prime2 = new K256();\n else if (name === \"p224\") prime2 = new P224();\n else if (name === \"p192\") prime2 = new P192();\n else if (name === \"p25519\") prime2 = new P25519();\n else throw new Error(\"Unknown prime \" + name);\n return (primes[name] = prime2), prime2;\n });\n function Red(m) {\n if (typeof m == \"string\") {\n var prime = BN._prime(m);\n (this.m = prime.p), (this.prime = prime);\n } else assert(m.gtn(1), \"modulus must be greater than 1\"), (this.m = m), (this.prime = null);\n }\n (Red.prototype._verify1 = function (a) {\n assert(a.negative === 0, \"red works only with positives\"), assert(a.red, \"red works only with red numbers\");\n }),\n (Red.prototype._verify2 = function (a, b) {\n assert((a.negative | b.negative) === 0, \"red works only with positives\"),\n assert(a.red && a.red === b.red, \"red works only with red numbers\");\n }),\n (Red.prototype.imod = function (a) {\n return this.prime ? this.prime.ireduce(a)._forceRed(this) : a.umod(this.m)._forceRed(this);\n }),\n (Red.prototype.neg = function (a) {\n return a.isZero() ? a.clone() : this.m.sub(a)._forceRed(this);\n }),\n (Red.prototype.add = function (a, b) {\n this._verify2(a, b);\n var res = a.add(b);\n return res.cmp(this.m) >= 0 && res.isub(this.m), res._forceRed(this);\n }),\n (Red.prototype.iadd = function (a, b) {\n this._verify2(a, b);\n var res = a.iadd(b);\n return res.cmp(this.m) >= 0 && res.isub(this.m), res;\n }),\n (Red.prototype.sub = function (a, b) {\n this._verify2(a, b);\n var res = a.sub(b);\n return res.cmpn(0) < 0 && res.iadd(this.m), res._forceRed(this);\n }),\n (Red.prototype.isub = function (a, b) {\n this._verify2(a, b);\n var res = a.isub(b);\n return res.cmpn(0) < 0 && res.iadd(this.m), res;\n }),\n (Red.prototype.shl = function (a, num) {\n return this._verify1(a), this.imod(a.ushln(num));\n }),\n (Red.prototype.imul = function (a, b) {\n return this._verify2(a, b), this.imod(a.imul(b));\n }),\n (Red.prototype.mul = function (a, b) {\n return this._verify2(a, b), this.imod(a.mul(b));\n }),\n (Red.prototype.isqr = function (a) {\n return this.imul(a, a.clone());\n }),\n (Red.prototype.sqr = function (a) {\n return this.mul(a, a);\n }),\n (Red.prototype.sqrt = function (a) {\n if (a.isZero()) return a.clone();\n var mod3 = this.m.andln(3);\n if ((assert(mod3 % 2 === 1), mod3 === 3)) {\n var pow = this.m.add(new BN(1)).iushrn(2);\n return this.pow(a, pow);\n }\n for (var q = this.m.subn(1), s = 0; !q.isZero() && q.andln(1) === 0; ) s++, q.iushrn(1);\n assert(!q.isZero());\n var one = new BN(1).toRed(this),\n nOne = one.redNeg(),\n lpow = this.m.subn(1).iushrn(1),\n z = this.m.bitLength();\n for (z = new BN(2 * z * z).toRed(this); this.pow(z, lpow).cmp(nOne) !== 0; ) z.redIAdd(nOne);\n for (\n var c = this.pow(z, q), r = this.pow(a, q.addn(1).iushrn(1)), t = this.pow(a, q), m = s;\n t.cmp(one) !== 0;\n\n ) {\n for (var tmp = t, i = 0; tmp.cmp(one) !== 0; i++) tmp = tmp.redSqr();\n assert(i < m);\n var b = this.pow(c, new BN(1).iushln(m - i - 1));\n (r = r.redMul(b)), (c = b.redSqr()), (t = t.redMul(c)), (m = i);\n }\n return r;\n }),\n (Red.prototype.invm = function (a) {\n var inv = a._invmp(this.m);\n return inv.negative !== 0 ? ((inv.negative = 0), this.imod(inv).redNeg()) : this.imod(inv);\n }),\n (Red.prototype.pow = function (a, num) {\n if (num.isZero()) return new BN(1).toRed(this);\n if (num.cmpn(1) === 0) return a.clone();\n var windowSize = 4,\n wnd = new Array(1 << windowSize);\n (wnd[0] = new BN(1).toRed(this)), (wnd[1] = a);\n for (var i = 2; i < wnd.length; i++) wnd[i] = this.mul(wnd[i - 1], a);\n var res = wnd[0],\n current = 0,\n currentLen = 0,\n start = num.bitLength() % 26;\n for (start === 0 && (start = 26), i = num.length - 1; i >= 0; i--) {\n for (var word = num.words[i], j = start - 1; j >= 0; j--) {\n var bit = (word >> j) & 1;\n if ((res !== wnd[0] && (res = this.sqr(res)), bit === 0 && current === 0)) {\n currentLen = 0;\n continue;\n }\n (current <<= 1),\n (current |= bit),\n currentLen++,\n !(currentLen !== windowSize && (i !== 0 || j !== 0)) &&\n ((res = this.mul(res, wnd[current])), (currentLen = 0), (current = 0));\n }\n start = 26;\n }\n return res;\n }),\n (Red.prototype.convertTo = function (num) {\n var r = num.umod(this.m);\n return r === num ? r.clone() : r;\n }),\n (Red.prototype.convertFrom = function (num) {\n var res = num.clone();\n return (res.red = null), res;\n }),\n (BN.mont = function (num) {\n return new Mont(num);\n });\n function Mont(m) {\n Red.call(this, m),\n (this.shift = this.m.bitLength()),\n this.shift % 26 !== 0 && (this.shift += 26 - (this.shift % 26)),\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 (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 (Mont.prototype.convertTo = function (num) {\n return this.imod(num.ushln(this.shift));\n }),\n (Mont.prototype.convertFrom = function (num) {\n var r = this.imod(num.mul(this.rinv));\n return (r.red = null), r;\n }),\n (Mont.prototype.imul = function (a, b) {\n if (a.isZero() || b.isZero()) return (a.words[0] = 0), (a.length = 1), a;\n var t = a.imul(b),\n c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m),\n u = t.isub(c).iushrn(this.shift),\n res = u;\n return (\n u.cmp(this.m) >= 0 ? (res = u.isub(this.m)) : u.cmpn(0) < 0 && (res = u.iadd(this.m)), res._forceRed(this)\n );\n }),\n (Mont.prototype.mul = function (a, b) {\n if (a.isZero() || b.isZero()) return new BN(0)._forceRed(this);\n var t = a.mul(b),\n c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m),\n u = t.isub(c).iushrn(this.shift),\n res = u;\n return (\n u.cmp(this.m) >= 0 ? (res = u.isub(this.m)) : u.cmpn(0) < 0 && (res = u.iadd(this.m)), res._forceRed(this)\n );\n }),\n (Mont.prototype.invm = function (a) {\n var res = this.imod(a._invmp(this.m).mul(this.r2));\n return res._forceRed(this);\n });\n })(typeof module > \"u\" || module, exports);\n },\n});\n\n// node_modules/minimalistic-crypto-utils/lib/utils.js\nvar require_utils2 = __commonJS({\n \"node_modules/minimalistic-crypto-utils/lib/utils.js\"(exports) {\n \"use strict\";\n var utils = exports;\n function toArray(msg, enc) {\n if (Array.isArray(msg)) return msg.slice();\n if (!msg) return [];\n var res = [];\n if (typeof msg != \"string\") {\n for (var i = 0; i < msg.length; i++) res[i] = msg[i] | 0;\n return res;\n }\n if (enc === \"hex\") {\n (msg = msg.replace(/[^a-z0-9]+/gi, \"\")), msg.length % 2 !== 0 && (msg = \"0\" + msg);\n for (var i = 0; i < msg.length; i += 2) res.push(parseInt(msg[i] + msg[i + 1], 16));\n } else\n for (var i = 0; i < msg.length; i++) {\n var c = msg.charCodeAt(i),\n hi = c >> 8,\n lo = c & 255;\n hi ? res.push(hi, lo) : res.push(lo);\n }\n return res;\n }\n utils.toArray = toArray;\n function zero2(word) {\n return word.length === 1 ? \"0\" + word : word;\n }\n utils.zero2 = zero2;\n function toHex(msg) {\n for (var res = \"\", i = 0; i < msg.length; i++) res += zero2(msg[i].toString(16));\n return res;\n }\n utils.toHex = toHex;\n utils.encode = function (arr, enc) {\n return enc === \"hex\" ? toHex(arr) : arr;\n };\n },\n});\n\n// node_modules/elliptic/lib/elliptic/utils.js\nvar require_utils3 = __commonJS({\n \"node_modules/elliptic/lib/elliptic/utils.js\"(exports) {\n \"use strict\";\n var utils = exports,\n BN = require_bn4(),\n minAssert = require_minimalistic_assert(),\n minUtils = require_utils2();\n utils.assert = minAssert;\n utils.toArray = minUtils.toArray;\n utils.zero2 = minUtils.zero2;\n utils.toHex = minUtils.toHex;\n utils.encode = minUtils.encode;\n function getNAF(num, w, bits) {\n var naf = new Array(Math.max(num.bitLength(), bits) + 1);\n naf.fill(0);\n for (var ws = 1 << (w + 1), k = num.clone(), i = 0; i < naf.length; i++) {\n var z,\n mod = k.andln(ws - 1);\n k.isOdd() ? (mod > (ws >> 1) - 1 ? (z = (ws >> 1) - mod) : (z = mod), k.isubn(z)) : (z = 0),\n (naf[i] = z),\n k.iushrn(1);\n }\n return naf;\n }\n utils.getNAF = getNAF;\n function getJSF(k1, k2) {\n var jsf = [[], []];\n (k1 = k1.clone()), (k2 = k2.clone());\n for (var d1 = 0, d2 = 0, m8; k1.cmpn(-d1) > 0 || k2.cmpn(-d2) > 0; ) {\n var m14 = (k1.andln(3) + d1) & 3,\n m24 = (k2.andln(3) + d2) & 3;\n m14 === 3 && (m14 = -1), m24 === 3 && (m24 = -1);\n var u1;\n (m14 & 1) === 0\n ? (u1 = 0)\n : ((m8 = (k1.andln(7) + d1) & 7), (m8 === 3 || m8 === 5) && m24 === 2 ? (u1 = -m14) : (u1 = m14)),\n jsf[0].push(u1);\n var u2;\n (m24 & 1) === 0\n ? (u2 = 0)\n : ((m8 = (k2.andln(7) + d2) & 7), (m8 === 3 || m8 === 5) && m14 === 2 ? (u2 = -m24) : (u2 = m24)),\n jsf[1].push(u2),\n 2 * d1 === u1 + 1 && (d1 = 1 - d1),\n 2 * d2 === u2 + 1 && (d2 = 1 - d2),\n k1.iushrn(1),\n k2.iushrn(1);\n }\n return jsf;\n }\n utils.getJSF = getJSF;\n function cachedProperty(obj, name, computer) {\n var key = \"_\" + name;\n obj.prototype[name] = function () {\n return this[key] !== void 0 ? this[key] : (this[key] = computer.call(this));\n };\n }\n utils.cachedProperty = cachedProperty;\n function parseBytes(bytes) {\n return typeof bytes == \"string\" ? utils.toArray(bytes, \"hex\") : bytes;\n }\n utils.parseBytes = parseBytes;\n function intFromLE(bytes) {\n return new BN(bytes, \"hex\", \"le\");\n }\n utils.intFromLE = intFromLE;\n },\n});\n\n// node_modules/elliptic/lib/elliptic/curve/base.js\nvar require_base = __commonJS({\n \"node_modules/elliptic/lib/elliptic/curve/base.js\"(exports, module) {\n \"use strict\";\n var BN = require_bn4(),\n utils = require_utils3(),\n getNAF = utils.getNAF,\n getJSF = utils.getJSF,\n assert = utils.assert;\n function BaseCurve(type, conf) {\n (this.type = type),\n (this.p = new BN(conf.p, 16)),\n (this.red = conf.prime ? BN.red(conf.prime) : BN.mont(this.p)),\n (this.zero = new BN(0).toRed(this.red)),\n (this.one = new BN(1).toRed(this.red)),\n (this.two = new BN(2).toRed(this.red)),\n (this.n = conf.n && new BN(conf.n, 16)),\n (this.g = conf.g && this.pointFromJSON(conf.g, conf.gRed)),\n (this._wnafT1 = new Array(4)),\n (this._wnafT2 = new Array(4)),\n (this._wnafT3 = new Array(4)),\n (this._wnafT4 = new Array(4)),\n (this._bitLength = this.n ? this.n.bitLength() : 0);\n var adjustCount = this.n && this.p.div(this.n);\n !adjustCount || adjustCount.cmpn(100) > 0\n ? (this.redN = null)\n : ((this._maxwellTrick = !0), (this.redN = this.n.toRed(this.red)));\n }\n module.exports = BaseCurve;\n BaseCurve.prototype.point = function () {\n throw new Error(\"Not implemented\");\n };\n BaseCurve.prototype.validate = function () {\n throw new Error(\"Not implemented\");\n };\n BaseCurve.prototype._fixedNafMul = function (p, k) {\n assert(p.precomputed);\n var doubles = p._getDoubles(),\n naf = getNAF(k, 1, this._bitLength),\n I = (1 << (doubles.step + 1)) - (doubles.step % 2 === 0 ? 2 : 1);\n I /= 3;\n var repr = [],\n j,\n nafW;\n for (j = 0; j < naf.length; j += doubles.step) {\n nafW = 0;\n for (var l = j + doubles.step - 1; l >= j; l--) nafW = (nafW << 1) + naf[l];\n repr.push(nafW);\n }\n for (var a = this.jpoint(null, null, null), b = this.jpoint(null, null, null), i = I; i > 0; i--) {\n for (j = 0; j < repr.length; j++)\n (nafW = repr[j]),\n nafW === i ? (b = b.mixedAdd(doubles.points[j])) : nafW === -i && (b = b.mixedAdd(doubles.points[j].neg()));\n a = a.add(b);\n }\n return a.toP();\n };\n BaseCurve.prototype._wnafMul = function (p, k) {\n var w = 4,\n nafPoints = p._getNAFPoints(w);\n w = nafPoints.wnd;\n for (\n var wnd = nafPoints.points,\n naf = getNAF(k, w, this._bitLength),\n acc = this.jpoint(null, null, null),\n i = naf.length - 1;\n i >= 0;\n i--\n ) {\n for (var l = 0; i >= 0 && naf[i] === 0; i--) l++;\n if ((i >= 0 && l++, (acc = acc.dblp(l)), i < 0)) break;\n var z = naf[i];\n assert(z !== 0),\n p.type === \"affine\"\n ? z > 0\n ? (acc = acc.mixedAdd(wnd[(z - 1) >> 1]))\n : (acc = acc.mixedAdd(wnd[(-z - 1) >> 1].neg()))\n : z > 0\n ? (acc = acc.add(wnd[(z - 1) >> 1]))\n : (acc = acc.add(wnd[(-z - 1) >> 1].neg()));\n }\n return p.type === \"affine\" ? acc.toP() : acc;\n };\n BaseCurve.prototype._wnafMulAdd = function (defW, points, coeffs, len, jacobianResult) {\n var wndWidth = this._wnafT1,\n wnd = this._wnafT2,\n naf = this._wnafT3,\n max = 0,\n i,\n j,\n p;\n for (i = 0; i < len; i++) {\n p = points[i];\n var nafPoints = p._getNAFPoints(defW);\n (wndWidth[i] = nafPoints.wnd), (wnd[i] = nafPoints.points);\n }\n for (i = len - 1; i >= 1; i -= 2) {\n var a = i - 1,\n b = i;\n if (wndWidth[a] !== 1 || wndWidth[b] !== 1) {\n (naf[a] = getNAF(coeffs[a], wndWidth[a], this._bitLength)),\n (naf[b] = getNAF(coeffs[b], wndWidth[b], this._bitLength)),\n (max = Math.max(naf[a].length, max)),\n (max = Math.max(naf[b].length, max));\n continue;\n }\n var comb = [points[a], null, null, points[b]];\n points[a].y.cmp(points[b].y) === 0\n ? ((comb[1] = points[a].add(points[b])), (comb[2] = points[a].toJ().mixedAdd(points[b].neg())))\n : points[a].y.cmp(points[b].y.redNeg()) === 0\n ? ((comb[1] = points[a].toJ().mixedAdd(points[b])), (comb[2] = points[a].add(points[b].neg())))\n : ((comb[1] = points[a].toJ().mixedAdd(points[b])), (comb[2] = points[a].toJ().mixedAdd(points[b].neg())));\n var index = [-3, -1, -5, -7, 0, 7, 5, 1, 3],\n jsf = getJSF(coeffs[a], coeffs[b]);\n for (\n max = Math.max(jsf[0].length, max), naf[a] = new Array(max), naf[b] = new Array(max), j = 0;\n j < max;\n j++\n ) {\n var ja = jsf[0][j] | 0,\n jb = jsf[1][j] | 0;\n (naf[a][j] = index[(ja + 1) * 3 + (jb + 1)]), (naf[b][j] = 0), (wnd[a] = comb);\n }\n }\n var acc = this.jpoint(null, null, null),\n tmp = this._wnafT4;\n for (i = max; i >= 0; i--) {\n for (var k = 0; i >= 0; ) {\n var zero = !0;\n for (j = 0; j < len; j++) (tmp[j] = naf[j][i] | 0), tmp[j] !== 0 && (zero = !1);\n if (!zero) break;\n k++, i--;\n }\n if ((i >= 0 && k++, (acc = acc.dblp(k)), i < 0)) break;\n for (j = 0; j < len; j++) {\n var z = tmp[j];\n z !== 0 &&\n (z > 0 ? (p = wnd[j][(z - 1) >> 1]) : z < 0 && (p = wnd[j][(-z - 1) >> 1].neg()),\n p.type === \"affine\" ? (acc = acc.mixedAdd(p)) : (acc = acc.add(p)));\n }\n }\n for (i = 0; i < len; i++) wnd[i] = null;\n return jacobianResult ? acc : acc.toP();\n };\n function BasePoint(curve, type) {\n (this.curve = curve), (this.type = type), (this.precomputed = null);\n }\n BaseCurve.BasePoint = BasePoint;\n BasePoint.prototype.eq = function () {\n throw new Error(\"Not implemented\");\n };\n BasePoint.prototype.validate = function () {\n return this.curve.validate(this);\n };\n BaseCurve.prototype.decodePoint = function (bytes, enc) {\n bytes = utils.toArray(bytes, enc);\n var len = this.p.byteLength();\n if ((bytes[0] === 4 || bytes[0] === 6 || bytes[0] === 7) && bytes.length - 1 === 2 * len) {\n bytes[0] === 6\n ? assert(bytes[bytes.length - 1] % 2 === 0)\n : bytes[0] === 7 && assert(bytes[bytes.length - 1] % 2 === 1);\n var res = this.point(bytes.slice(1, 1 + len), bytes.slice(1 + len, 1 + 2 * len));\n return res;\n } else if ((bytes[0] === 2 || bytes[0] === 3) && bytes.length - 1 === len)\n return this.pointFromX(bytes.slice(1, 1 + len), bytes[0] === 3);\n throw new Error(\"Unknown point format\");\n };\n BasePoint.prototype.encodeCompressed = function (enc) {\n return this.encode(enc, !0);\n };\n BasePoint.prototype._encode = function (compact) {\n var len = this.curve.p.byteLength(),\n x = this.getX().toArray(\"be\", len);\n return compact ? [this.getY().isEven() ? 2 : 3].concat(x) : [4].concat(x, this.getY().toArray(\"be\", len));\n };\n BasePoint.prototype.encode = function (enc, compact) {\n return utils.encode(this._encode(compact), enc);\n };\n BasePoint.prototype.precompute = function (power) {\n if (this.precomputed) return this;\n var precomputed = {\n doubles: null,\n naf: null,\n beta: null,\n };\n return (\n (precomputed.naf = this._getNAFPoints(8)),\n (precomputed.doubles = this._getDoubles(4, power)),\n (precomputed.beta = this._getBeta()),\n (this.precomputed = precomputed),\n this\n );\n };\n BasePoint.prototype._hasDoubles = function (k) {\n if (!this.precomputed) return !1;\n var doubles = this.precomputed.doubles;\n return doubles ? doubles.points.length >= Math.ceil((k.bitLength() + 1) / doubles.step) : !1;\n };\n BasePoint.prototype._getDoubles = function (step, power) {\n if (this.precomputed && this.precomputed.doubles) return this.precomputed.doubles;\n for (var doubles = [this], acc = this, i = 0; i < power; i += step) {\n for (var j = 0; j < step; j++) acc = acc.dbl();\n doubles.push(acc);\n }\n return {\n step,\n points: doubles,\n };\n };\n BasePoint.prototype._getNAFPoints = function (wnd) {\n if (this.precomputed && this.precomputed.naf) return this.precomputed.naf;\n for (var res = [this], max = (1 << wnd) - 1, dbl = max === 1 ? null : this.dbl(), i = 1; i < max; i++)\n res[i] = res[i - 1].add(dbl);\n return {\n wnd,\n points: res,\n };\n };\n BasePoint.prototype._getBeta = function () {\n return null;\n };\n BasePoint.prototype.dblp = function (k) {\n for (var r = this, i = 0; i < k; i++) r = r.dbl();\n return r;\n };\n },\n});\n\n// node_modules/elliptic/lib/elliptic/curve/short.js\nvar require_short = __commonJS({\n \"node_modules/elliptic/lib/elliptic/curve/short.js\"(exports, module) {\n \"use strict\";\n var utils = require_utils3(),\n BN = require_bn4(),\n inherits = require_inherits_browser(),\n Base = require_base(),\n assert = utils.assert;\n function ShortCurve(conf) {\n Base.call(this, \"short\", conf),\n (this.a = new BN(conf.a, 16).toRed(this.red)),\n (this.b = new BN(conf.b, 16).toRed(this.red)),\n (this.tinv = this.two.redInvm()),\n (this.zeroA = this.a.fromRed().cmpn(0) === 0),\n (this.threeA = this.a.fromRed().sub(this.p).cmpn(-3) === 0),\n (this.endo = this._getEndomorphism(conf)),\n (this._endoWnafT1 = new Array(4)),\n (this._endoWnafT2 = new Array(4));\n }\n inherits(ShortCurve, Base);\n module.exports = ShortCurve;\n ShortCurve.prototype._getEndomorphism = function (conf) {\n if (!(!this.zeroA || !this.g || !this.n || this.p.modn(3) !== 1)) {\n var beta, lambda;\n if (conf.beta) beta = new BN(conf.beta, 16).toRed(this.red);\n else {\n var betas = this._getEndoRoots(this.p);\n (beta = betas[0].cmp(betas[1]) < 0 ? betas[0] : betas[1]), (beta = beta.toRed(this.red));\n }\n if (conf.lambda) lambda = new BN(conf.lambda, 16);\n else {\n var lambdas = this._getEndoRoots(this.n);\n this.g.mul(lambdas[0]).x.cmp(this.g.x.redMul(beta)) === 0\n ? (lambda = lambdas[0])\n : ((lambda = lambdas[1]), assert(this.g.mul(lambda).x.cmp(this.g.x.redMul(beta)) === 0));\n }\n var basis;\n return (\n conf.basis\n ? (basis = conf.basis.map(function (vec) {\n return {\n a: new BN(vec.a, 16),\n b: new BN(vec.b, 16),\n };\n }))\n : (basis = this._getEndoBasis(lambda)),\n {\n beta,\n lambda,\n basis,\n }\n );\n }\n };\n ShortCurve.prototype._getEndoRoots = function (num) {\n var red = num === this.p ? this.red : BN.mont(num),\n tinv = new BN(2).toRed(red).redInvm(),\n ntinv = tinv.redNeg(),\n s = new BN(3).toRed(red).redNeg().redSqrt().redMul(tinv),\n l1 = ntinv.redAdd(s).fromRed(),\n l2 = ntinv.redSub(s).fromRed();\n return [l1, l2];\n };\n ShortCurve.prototype._getEndoBasis = function (lambda) {\n for (\n var aprxSqrt = this.n.ushrn(Math.floor(this.n.bitLength() / 2)),\n u = lambda,\n v = this.n.clone(),\n x1 = new BN(1),\n y1 = new BN(0),\n x2 = new BN(0),\n y2 = new BN(1),\n a0,\n b0,\n a1,\n b1,\n a2,\n b2,\n prevR,\n i = 0,\n r,\n x;\n u.cmpn(0) !== 0;\n\n ) {\n var q = v.div(u);\n (r = v.sub(q.mul(u))), (x = x2.sub(q.mul(x1)));\n var y = y2.sub(q.mul(y1));\n if (!a1 && r.cmp(aprxSqrt) < 0) (a0 = prevR.neg()), (b0 = x1), (a1 = r.neg()), (b1 = x);\n else if (a1 && ++i === 2) break;\n (prevR = r), (v = u), (u = r), (x2 = x1), (x1 = x), (y2 = y1), (y1 = y);\n }\n (a2 = r.neg()), (b2 = x);\n var len1 = a1.sqr().add(b1.sqr()),\n len2 = a2.sqr().add(b2.sqr());\n return (\n len2.cmp(len1) >= 0 && ((a2 = a0), (b2 = b0)),\n a1.negative && ((a1 = a1.neg()), (b1 = b1.neg())),\n a2.negative && ((a2 = a2.neg()), (b2 = b2.neg())),\n [\n { a: a1, b: b1 },\n { a: a2, b: b2 },\n ]\n );\n };\n ShortCurve.prototype._endoSplit = function (k) {\n var basis = this.endo.basis,\n v1 = basis[0],\n v2 = basis[1],\n c1 = v2.b.mul(k).divRound(this.n),\n c2 = v1.b.neg().mul(k).divRound(this.n),\n p1 = c1.mul(v1.a),\n p2 = c2.mul(v2.a),\n q1 = c1.mul(v1.b),\n q2 = c2.mul(v2.b),\n k1 = k.sub(p1).sub(p2),\n k2 = q1.add(q2).neg();\n return { k1, k2 };\n };\n ShortCurve.prototype.pointFromX = function (x, odd) {\n (x = new BN(x, 16)), x.red || (x = x.toRed(this.red));\n var y2 = x.redSqr().redMul(x).redIAdd(x.redMul(this.a)).redIAdd(this.b),\n y = y2.redSqrt();\n if (y.redSqr().redSub(y2).cmp(this.zero) !== 0) throw new Error(\"invalid point\");\n var isOdd = y.fromRed().isOdd();\n return ((odd && !isOdd) || (!odd && isOdd)) && (y = y.redNeg()), this.point(x, y);\n };\n ShortCurve.prototype.validate = function (point) {\n if (point.inf) return !0;\n var x = point.x,\n y = point.y,\n ax = this.a.redMul(x),\n rhs = x.redSqr().redMul(x).redIAdd(ax).redIAdd(this.b);\n return y.redSqr().redISub(rhs).cmpn(0) === 0;\n };\n ShortCurve.prototype._endoWnafMulAdd = function (points, coeffs, jacobianResult) {\n for (var npoints = this._endoWnafT1, ncoeffs = this._endoWnafT2, i = 0; i < points.length; i++) {\n var split = this._endoSplit(coeffs[i]),\n p = points[i],\n beta = p._getBeta();\n split.k1.negative && (split.k1.ineg(), (p = p.neg(!0))),\n split.k2.negative && (split.k2.ineg(), (beta = beta.neg(!0))),\n (npoints[i * 2] = p),\n (npoints[i * 2 + 1] = beta),\n (ncoeffs[i * 2] = split.k1),\n (ncoeffs[i * 2 + 1] = split.k2);\n }\n for (var res = this._wnafMulAdd(1, npoints, ncoeffs, i * 2, jacobianResult), j = 0; j < i * 2; j++)\n (npoints[j] = null), (ncoeffs[j] = null);\n return res;\n };\n function Point(curve, x, y, isRed) {\n Base.BasePoint.call(this, curve, \"affine\"),\n x === null && y === null\n ? ((this.x = null), (this.y = null), (this.inf = !0))\n : ((this.x = new BN(x, 16)),\n (this.y = new BN(y, 16)),\n isRed && (this.x.forceRed(this.curve.red), this.y.forceRed(this.curve.red)),\n this.x.red || (this.x = this.x.toRed(this.curve.red)),\n this.y.red || (this.y = this.y.toRed(this.curve.red)),\n (this.inf = !1));\n }\n inherits(Point, Base.BasePoint);\n ShortCurve.prototype.point = function (x, y, isRed) {\n return new Point(this, x, y, isRed);\n };\n ShortCurve.prototype.pointFromJSON = function (obj, red) {\n return Point.fromJSON(this, obj, red);\n };\n Point.prototype._getBeta = function () {\n if (!!this.curve.endo) {\n var pre = this.precomputed;\n if (pre && pre.beta) return pre.beta;\n var beta = this.curve.point(this.x.redMul(this.curve.endo.beta), this.y);\n if (pre) {\n var curve = this.curve,\n endoMul = function (p) {\n return curve.point(p.x.redMul(curve.endo.beta), p.y);\n };\n (pre.beta = beta),\n (beta.precomputed = {\n beta: null,\n naf: pre.naf && {\n wnd: pre.naf.wnd,\n points: pre.naf.points.map(endoMul),\n },\n doubles: pre.doubles && {\n step: pre.doubles.step,\n points: pre.doubles.points.map(endoMul),\n },\n });\n }\n return beta;\n }\n };\n Point.prototype.toJSON = function () {\n return this.precomputed\n ? [\n this.x,\n this.y,\n this.precomputed && {\n doubles: this.precomputed.doubles && {\n step: this.precomputed.doubles.step,\n points: this.precomputed.doubles.points.slice(1),\n },\n naf: this.precomputed.naf && {\n wnd: this.precomputed.naf.wnd,\n points: this.precomputed.naf.points.slice(1),\n },\n },\n ]\n : [this.x, this.y];\n };\n Point.fromJSON = function (curve, obj, red) {\n typeof obj == \"string\" && (obj = JSON.parse(obj));\n var res = curve.point(obj[0], obj[1], red);\n if (!obj[2]) return res;\n function obj2point(obj2) {\n return curve.point(obj2[0], obj2[1], red);\n }\n var pre = obj[2];\n return (\n (res.precomputed = {\n beta: null,\n doubles: pre.doubles && {\n step: pre.doubles.step,\n points: [res].concat(pre.doubles.points.map(obj2point)),\n },\n naf: pre.naf && {\n wnd: pre.naf.wnd,\n points: [res].concat(pre.naf.points.map(obj2point)),\n },\n }),\n res\n );\n };\n Point.prototype.inspect = function () {\n return this.isInfinity()\n ? \"<EC Point Infinity>\"\n : \"<EC Point x: \" + this.x.fromRed().toString(16, 2) + \" y: \" + this.y.fromRed().toString(16, 2) + \">\";\n };\n Point.prototype.isInfinity = function () {\n return this.inf;\n };\n Point.prototype.add = function (p) {\n if (this.inf) return p;\n if (p.inf) return this;\n if (this.eq(p)) return this.dbl();\n if (this.neg().eq(p)) return this.curve.point(null, null);\n if (this.x.cmp(p.x) === 0) return this.curve.point(null, null);\n var c = this.y.redSub(p.y);\n c.cmpn(0) !== 0 && (c = c.redMul(this.x.redSub(p.x).redInvm()));\n var nx = c.redSqr().redISub(this.x).redISub(p.x),\n ny = c.redMul(this.x.redSub(nx)).redISub(this.y);\n return this.curve.point(nx, ny);\n };\n Point.prototype.dbl = function () {\n if (this.inf) return this;\n var ys1 = this.y.redAdd(this.y);\n if (ys1.cmpn(0) === 0) return this.curve.point(null, null);\n var a = this.curve.a,\n x2 = this.x.redSqr(),\n dyinv = ys1.redInvm(),\n c = x2.redAdd(x2).redIAdd(x2).redIAdd(a).redMul(dyinv),\n nx = c.redSqr().redISub(this.x.redAdd(this.x)),\n ny = c.redMul(this.x.redSub(nx)).redISub(this.y);\n return this.curve.point(nx, ny);\n };\n Point.prototype.getX = function () {\n return this.x.fromRed();\n };\n Point.prototype.getY = function () {\n return this.y.fromRed();\n };\n Point.prototype.mul = function (k) {\n return (\n (k = new BN(k, 16)),\n this.isInfinity()\n ? this\n : this._hasDoubles(k)\n ? this.curve._fixedNafMul(this, k)\n : this.curve.endo\n ? this.curve._endoWnafMulAdd([this], [k])\n : this.curve._wnafMul(this, k)\n );\n };\n Point.prototype.mulAdd = function (k1, p2, k2) {\n var points = [this, p2],\n coeffs = [k1, k2];\n return this.curve.endo\n ? this.curve._endoWnafMulAdd(points, coeffs)\n : this.curve._wnafMulAdd(1, points, coeffs, 2);\n };\n Point.prototype.jmulAdd = function (k1, p2, k2) {\n var points = [this, p2],\n coeffs = [k1, k2];\n return this.curve.endo\n ? this.curve._endoWnafMulAdd(points, coeffs, !0)\n : this.curve._wnafMulAdd(1, points, coeffs, 2, !0);\n };\n Point.prototype.eq = function (p) {\n return this === p || (this.inf === p.inf && (this.inf || (this.x.cmp(p.x) === 0 && this.y.cmp(p.y) === 0)));\n };\n Point.prototype.neg = function (_precompute) {\n if (this.inf) return this;\n var res = this.curve.point(this.x, this.y.redNeg());\n if (_precompute && this.precomputed) {\n var pre = this.precomputed,\n negate = function (p) {\n return p.neg();\n };\n res.precomputed = {\n naf: pre.naf && {\n wnd: pre.naf.wnd,\n points: pre.naf.points.map(negate),\n },\n doubles: pre.doubles && {\n step: pre.doubles.step,\n points: pre.doubles.points.map(negate),\n },\n };\n }\n return res;\n };\n Point.prototype.toJ = function () {\n if (this.inf) return this.curve.jpoint(null, null, null);\n var res = this.curve.jpoint(this.x, this.y, this.curve.one);\n return res;\n };\n function JPoint(curve, x, y, z) {\n Base.BasePoint.call(this, curve, \"jacobian\"),\n x === null && y === null && z === null\n ? ((this.x = this.curve.one), (this.y = this.curve.one), (this.z = new BN(0)))\n : ((this.x = new BN(x, 16)), (this.y = new BN(y, 16)), (this.z = new BN(z, 16))),\n this.x.red || (this.x = this.x.toRed(this.curve.red)),\n this.y.red || (this.y = this.y.toRed(this.curve.red)),\n this.z.red || (this.z = this.z.toRed(this.curve.red)),\n (this.zOne = this.z === this.curve.one);\n }\n inherits(JPoint, Base.BasePoint);\n ShortCurve.prototype.jpoint = function (x, y, z) {\n return new JPoint(this, x, y, z);\n };\n JPoint.prototype.toP = function () {\n if (this.isInfinity()) return this.curve.point(null, null);\n var zinv = this.z.redInvm(),\n zinv2 = zinv.redSqr(),\n ax = this.x.redMul(zinv2),\n ay = this.y.redMul(zinv2).redMul(zinv);\n return this.curve.point(ax, ay);\n };\n JPoint.prototype.neg = function () {\n return this.curve.jpoint(this.x, this.y.redNeg(), this.z);\n };\n JPoint.prototype.add = function (p) {\n if (this.isInfinity()) return p;\n if (p.isInfinity()) return this;\n var pz2 = p.z.redSqr(),\n z2 = this.z.redSqr(),\n u1 = this.x.redMul(pz2),\n u2 = p.x.redMul(z2),\n s1 = this.y.redMul(pz2.redMul(p.z)),\n s2 = p.y.redMul(z2.redMul(this.z)),\n h = u1.redSub(u2),\n r = s1.redSub(s2);\n if (h.cmpn(0) === 0) return r.cmpn(0) !== 0 ? this.curve.jpoint(null, null, null) : this.dbl();\n var h2 = h.redSqr(),\n h3 = h2.redMul(h),\n v = u1.redMul(h2),\n nx = r.redSqr().redIAdd(h3).redISub(v).redISub(v),\n ny = r.redMul(v.redISub(nx)).redISub(s1.redMul(h3)),\n nz = this.z.redMul(p.z).redMul(h);\n return this.curve.jpoint(nx, ny, nz);\n };\n JPoint.prototype.mixedAdd = function (p) {\n if (this.isInfinity()) return p.toJ();\n if (p.isInfinity()) return this;\n var z2 = this.z.redSqr(),\n u1 = this.x,\n u2 = p.x.redMul(z2),\n s1 = this.y,\n s2 = p.y.redMul(z2).redMul(this.z),\n h = u1.redSub(u2),\n r = s1.redSub(s2);\n if (h.cmpn(0) === 0) return r.cmpn(0) !== 0 ? this.curve.jpoint(null, null, null) : this.dbl();\n var h2 = h.redSqr(),\n h3 = h2.redMul(h),\n v = u1.redMul(h2),\n nx = r.redSqr().redIAdd(h3).redISub(v).redISub(v),\n ny = r.redMul(v.redISub(nx)).redISub(s1.redMul(h3)),\n nz = this.z.redMul(h);\n return this.curve.jpoint(nx, ny, nz);\n };\n JPoint.prototype.dblp = function (pow) {\n if (pow === 0) return this;\n if (this.isInfinity()) return this;\n if (!pow) return this.dbl();\n var i;\n if (this.curve.zeroA || this.curve.threeA) {\n var r = this;\n for (i = 0; i < pow; i++) r = r.dbl();\n return r;\n }\n var a = this.curve.a,\n tinv = this.curve.tinv,\n jx = this.x,\n jy = this.y,\n jz = this.z,\n jz4 = jz.redSqr().redSqr(),\n jyd = jy.redAdd(jy);\n for (i = 0; i < pow; i++) {\n var jx2 = jx.redSqr(),\n jyd2 = jyd.redSqr(),\n jyd4 = jyd2.redSqr(),\n c = jx2.redAdd(jx2).redIAdd(jx2).redIAdd(a.redMul(jz4)),\n t1 = jx.redMul(jyd2),\n nx = c.redSqr().redISub(t1.redAdd(t1)),\n t2 = t1.redISub(nx),\n dny = c.redMul(t2);\n dny = dny.redIAdd(dny).redISub(jyd4);\n var nz = jyd.redMul(jz);\n i + 1 < pow && (jz4 = jz4.redMul(jyd4)), (jx = nx), (jz = nz), (jyd = dny);\n }\n return this.curve.jpoint(jx, jyd.redMul(tinv), jz);\n };\n JPoint.prototype.dbl = function () {\n return this.isInfinity()\n ? this\n : this.curve.zeroA\n ? this._zeroDbl()\n : this.curve.threeA\n ? this._threeDbl()\n : this._dbl();\n };\n JPoint.prototype._zeroDbl = function () {\n var nx, ny, nz;\n if (this.zOne) {\n var xx = this.x.redSqr(),\n yy = this.y.redSqr(),\n yyyy = yy.redSqr(),\n s = this.x.redAdd(yy).redSqr().redISub(xx).redISub(yyyy);\n s = s.redIAdd(s);\n var m = xx.redAdd(xx).redIAdd(xx),\n t = m.redSqr().redISub(s).redISub(s),\n yyyy8 = yyyy.redIAdd(yyyy);\n (yyyy8 = yyyy8.redIAdd(yyyy8)),\n (yyyy8 = yyyy8.redIAdd(yyyy8)),\n (nx = t),\n (ny = m.redMul(s.redISub(t)).redISub(yyyy8)),\n (nz = this.y.redAdd(this.y));\n } else {\n var a = this.x.redSqr(),\n b = this.y.redSqr(),\n c = b.redSqr(),\n d = this.x.redAdd(b).redSqr().redISub(a).redISub(c);\n d = d.redIAdd(d);\n var e = a.redAdd(a).redIAdd(a),\n f = e.redSqr(),\n c8 = c.redIAdd(c);\n (c8 = c8.redIAdd(c8)),\n (c8 = c8.redIAdd(c8)),\n (nx = f.redISub(d).redISub(d)),\n (ny = e.redMul(d.redISub(nx)).redISub(c8)),\n (nz = this.y.redMul(this.z)),\n (nz = nz.redIAdd(nz));\n }\n return this.curve.jpoint(nx, ny, nz);\n };\n JPoint.prototype._threeDbl = function () {\n var nx, ny, nz;\n if (this.zOne) {\n var xx = this.x.redSqr(),\n yy = this.y.redSqr(),\n yyyy = yy.redSqr(),\n s = this.x.redAdd(yy).redSqr().redISub(xx).redISub(yyyy);\n s = s.redIAdd(s);\n var m = xx.redAdd(xx).redIAdd(xx).redIAdd(this.curve.a),\n t = m.redSqr().redISub(s).redISub(s);\n nx = t;\n var yyyy8 = yyyy.redIAdd(yyyy);\n (yyyy8 = yyyy8.redIAdd(yyyy8)),\n (yyyy8 = yyyy8.redIAdd(yyyy8)),\n (ny = m.redMul(s.redISub(t)).redISub(yyyy8)),\n (nz = this.y.redAdd(this.y));\n } else {\n var delta = this.z.redSqr(),\n gamma = this.y.redSqr(),\n beta = this.x.redMul(gamma),\n alpha = this.x.redSub(delta).redMul(this.x.redAdd(delta));\n alpha = alpha.redAdd(alpha).redIAdd(alpha);\n var beta4 = beta.redIAdd(beta);\n beta4 = beta4.redIAdd(beta4);\n var beta8 = beta4.redAdd(beta4);\n (nx = alpha.redSqr().redISub(beta8)), (nz = this.y.redAdd(this.z).redSqr().redISub(gamma).redISub(delta));\n var ggamma8 = gamma.redSqr();\n (ggamma8 = ggamma8.redIAdd(ggamma8)),\n (ggamma8 = ggamma8.redIAdd(ggamma8)),\n (ggamma8 = ggamma8.redIAdd(ggamma8)),\n (ny = alpha.redMul(beta4.redISub(nx)).redISub(ggamma8));\n }\n return this.curve.jpoint(nx, ny, nz);\n };\n JPoint.prototype._dbl = function () {\n var a = this.curve.a,\n jx = this.x,\n jy = this.y,\n jz = this.z,\n jz4 = jz.redSqr().redSqr(),\n jx2 = jx.redSqr(),\n jy2 = jy.redSqr(),\n c = jx2.redAdd(jx2).redIAdd(jx2).redIAdd(a.redMul(jz4)),\n jxd4 = jx.redAdd(jx);\n jxd4 = jxd4.redIAdd(jxd4);\n var t1 = jxd4.redMul(jy2),\n nx = c.redSqr().redISub(t1.redAdd(t1)),\n t2 = t1.redISub(nx),\n jyd8 = jy2.redSqr();\n (jyd8 = jyd8.redIAdd(jyd8)), (jyd8 = jyd8.redIAdd(jyd8)), (jyd8 = jyd8.redIAdd(jyd8));\n var ny = c.redMul(t2).redISub(jyd8),\n nz = jy.redAdd(jy).redMul(jz);\n return this.curve.jpoint(nx, ny, nz);\n };\n JPoint.prototype.trpl = function () {\n if (!this.curve.zeroA) return this.dbl().add(this);\n var xx = this.x.redSqr(),\n yy = this.y.redSqr(),\n zz = this.z.redSqr(),\n yyyy = yy.redSqr(),\n m = xx.redAdd(xx).redIAdd(xx),\n mm = m.redSqr(),\n e = this.x.redAdd(yy).redSqr().redISub(xx).redISub(yyyy);\n (e = e.redIAdd(e)), (e = e.redAdd(e).redIAdd(e)), (e = e.redISub(mm));\n var ee = e.redSqr(),\n t = yyyy.redIAdd(yyyy);\n (t = t.redIAdd(t)), (t = t.redIAdd(t)), (t = t.redIAdd(t));\n var u = m.redIAdd(e).redSqr().redISub(mm).redISub(ee).redISub(t),\n yyu4 = yy.redMul(u);\n (yyu4 = yyu4.redIAdd(yyu4)), (yyu4 = yyu4.redIAdd(yyu4));\n var nx = this.x.redMul(ee).redISub(yyu4);\n (nx = nx.redIAdd(nx)), (nx = nx.redIAdd(nx));\n var ny = this.y.redMul(u.redMul(t.redISub(u)).redISub(e.redMul(ee)));\n (ny = ny.redIAdd(ny)), (ny = ny.redIAdd(ny)), (ny = ny.redIAdd(ny));\n var nz = this.z.redAdd(e).redSqr().redISub(zz).redISub(ee);\n return this.curve.jpoint(nx, ny, nz);\n };\n JPoint.prototype.mul = function (k, kbase) {\n return (k = new BN(k, kbase)), this.curve._wnafMul(this, k);\n };\n JPoint.prototype.eq = function (p) {\n if (p.type === \"affine\") return this.eq(p.toJ());\n if (this === p) return !0;\n var z2 = this.z.redSqr(),\n pz2 = p.z.redSqr();\n if (this.x.redMul(pz2).redISub(p.x.redMul(z2)).cmpn(0) !== 0) return !1;\n var z3 = z2.redMul(this.z),\n pz3 = pz2.redMul(p.z);\n return this.y.redMul(pz3).redISub(p.y.redMul(z3)).cmpn(0) === 0;\n };\n JPoint.prototype.eqXToP = function (x) {\n var zs = this.z.redSqr(),\n rx = x.toRed(this.curve.red).redMul(zs);\n if (this.x.cmp(rx) === 0) return !0;\n for (var xc = x.clone(), t = this.curve.redN.redMul(zs); ; ) {\n if ((xc.iadd(this.curve.n), xc.cmp(this.curve.p) >= 0)) return !1;\n if ((rx.redIAdd(t), this.x.cmp(rx) === 0)) return !0;\n }\n };\n JPoint.prototype.inspect = function () {\n return this.isInfinity()\n ? \"<EC JPoint Infinity>\"\n : \"<EC JPoint x: \" +\n this.x.toString(16, 2) +\n \" y: \" +\n this.y.toString(16, 2) +\n \" z: \" +\n this.z.toString(16, 2) +\n \">\";\n };\n JPoint.prototype.isInfinity = function () {\n return this.z.cmpn(0) === 0;\n };\n },\n});\n\n// node_modules/elliptic/lib/elliptic/curve/mont.js\nvar require_mont = __commonJS({\n \"node_modules/elliptic/lib/elliptic/curve/mont.js\"(exports, module) {\n \"use strict\";\n var BN = require_bn4(),\n inherits = require_inherits_browser(),\n Base = require_base(),\n utils = require_utils3();\n function MontCurve(conf) {\n Base.call(this, \"mont\", conf),\n (this.a = new BN(conf.a, 16).toRed(this.red)),\n (this.b = new BN(conf.b, 16).toRed(this.red)),\n (this.i4 = new BN(4).toRed(this.red).redInvm()),\n (this.two = new BN(2).toRed(this.red)),\n (this.a24 = this.i4.redMul(this.a.redAdd(this.two)));\n }\n inherits(MontCurve, Base);\n module.exports = MontCurve;\n MontCurve.prototype.validate = function (point) {\n var x = point.normalize().x,\n x2 = x.redSqr(),\n rhs = x2.redMul(x).redAdd(x2.redMul(this.a)).redAdd(x),\n y = rhs.redSqrt();\n return y.redSqr().cmp(rhs) === 0;\n };\n function Point(curve, x, z) {\n Base.BasePoint.call(this, curve, \"projective\"),\n x === null && z === null\n ? ((this.x = this.curve.one), (this.z = this.curve.zero))\n : ((this.x = new BN(x, 16)),\n (this.z = new BN(z, 16)),\n this.x.red || (this.x = this.x.toRed(this.curve.red)),\n this.z.red || (this.z = this.z.toRed(this.curve.red)));\n }\n inherits(Point, Base.BasePoint);\n MontCurve.prototype.decodePoint = function (bytes, enc) {\n return this.point(utils.toArray(bytes, enc), 1);\n };\n MontCurve.prototype.point = function (x, z) {\n return new Point(this, x, z);\n };\n MontCurve.prototype.pointFromJSON = function (obj) {\n return Point.fromJSON(this, obj);\n };\n Point.prototype.precompute = function () {};\n Point.prototype._encode = function () {\n return this.getX().toArray(\"be\", this.curve.p.byteLength());\n };\n Point.fromJSON = function (curve, obj) {\n return new Point(curve, obj[0], obj[1] || curve.one);\n };\n Point.prototype.inspect = function () {\n return this.isInfinity()\n ? \"<EC Point Infinity>\"\n : \"<EC Point x: \" + this.x.fromRed().toString(16, 2) + \" z: \" + this.z.fromRed().toString(16, 2) + \">\";\n };\n Point.prototype.isInfinity = function () {\n return this.z.cmpn(0) === 0;\n };\n Point.prototype.dbl = function () {\n var a = this.x.redAdd(this.z),\n aa = a.redSqr(),\n b = this.x.redSub(this.z),\n bb = b.redSqr(),\n c = aa.redSub(bb),\n nx = aa.redMul(bb),\n nz = c.redMul(bb.redAdd(this.curve.a24.redMul(c)));\n return this.curve.point(nx, nz);\n };\n Point.prototype.add = function () {\n throw new Error(\"Not supported on Montgomery curve\");\n };\n Point.prototype.diffAdd = function (p, diff) {\n var a = this.x.redAdd(this.z),\n b = this.x.redSub(this.z),\n c = p.x.redAdd(p.z),\n d = p.x.redSub(p.z),\n da = d.redMul(a),\n cb = c.redMul(b),\n nx = diff.z.redMul(da.redAdd(cb).redSqr()),\n nz = diff.x.redMul(da.redISub(cb).redSqr());\n return this.curve.point(nx, nz);\n };\n Point.prototype.mul = function (k) {\n for (\n var t = k.clone(), a = this, b = this.curve.point(null, null), c = this, bits = [];\n t.cmpn(0) !== 0;\n t.iushrn(1)\n )\n bits.push(t.andln(1));\n for (var i = bits.length - 1; i >= 0; i--)\n bits[i] === 0 ? ((a = a.diffAdd(b, c)), (b = b.dbl())) : ((b = a.diffAdd(b, c)), (a = a.dbl()));\n return b;\n };\n Point.prototype.mulAdd = function () {\n throw new Error(\"Not supported on Montgomery curve\");\n };\n Point.prototype.jumlAdd = function () {\n throw new Error(\"Not supported on Montgomery curve\");\n };\n Point.prototype.eq = function (other) {\n return this.getX().cmp(other.getX()) === 0;\n };\n Point.prototype.normalize = function () {\n return (this.x = this.x.redMul(this.z.redInvm())), (this.z = this.curve.one), this;\n };\n Point.prototype.getX = function () {\n return this.normalize(), this.x.fromRed();\n };\n },\n});\n\n// node_modules/elliptic/lib/elliptic/curve/edwards.js\nvar require_edwards = __commonJS({\n \"node_modules/elliptic/lib/elliptic/curve/edwards.js\"(exports, module) {\n \"use strict\";\n var utils = require_utils3(),\n BN = require_bn4(),\n inherits = require_inherits_browser(),\n Base = require_base(),\n assert = utils.assert;\n function EdwardsCurve(conf) {\n (this.twisted = (conf.a | 0) !== 1),\n (this.mOneA = this.twisted && (conf.a | 0) === -1),\n (this.extended = this.mOneA),\n Base.call(this, \"edwards\", conf),\n (this.a = new BN(conf.a, 16).umod(this.red.m)),\n (this.a = this.a.toRed(this.red)),\n (this.c = new BN(conf.c, 16).toRed(this.red)),\n (this.c2 = this.c.redSqr()),\n (this.d = new BN(conf.d, 16).toRed(this.red)),\n (this.dd = this.d.redAdd(this.d)),\n assert(!this.twisted || this.c.fromRed().cmpn(1) === 0),\n (this.oneC = (conf.c | 0) === 1);\n }\n inherits(EdwardsCurve, Base);\n module.exports = EdwardsCurve;\n EdwardsCurve.prototype._mulA = function (num) {\n return this.mOneA ? num.redNeg() : this.a.redMul(num);\n };\n EdwardsCurve.prototype._mulC = function (num) {\n return this.oneC ? num : this.c.redMul(num);\n };\n EdwardsCurve.prototype.jpoint = function (x, y, z, t) {\n return this.point(x, y, z, t);\n };\n EdwardsCurve.prototype.pointFromX = function (x, odd) {\n (x = new BN(x, 16)), x.red || (x = x.toRed(this.red));\n var x2 = x.redSqr(),\n rhs = this.c2.redSub(this.a.redMul(x2)),\n lhs = this.one.redSub(this.c2.redMul(this.d).redMul(x2)),\n y2 = rhs.redMul(lhs.redInvm()),\n y = y2.redSqrt();\n if (y.redSqr().redSub(y2).cmp(this.zero) !== 0) throw new Error(\"invalid point\");\n var isOdd = y.fromRed().isOdd();\n return ((odd && !isOdd) || (!odd && isOdd)) && (y = y.redNeg()), this.point(x, y);\n };\n EdwardsCurve.prototype.pointFromY = function (y, odd) {\n (y = new BN(y, 16)), y.red || (y = y.toRed(this.red));\n var y2 = y.redSqr(),\n lhs = y2.redSub(this.c2),\n rhs = y2.redMul(this.d).redMul(this.c2).redSub(this.a),\n x2 = lhs.redMul(rhs.redInvm());\n if (x2.cmp(this.zero) === 0) {\n if (odd) throw new Error(\"invalid point\");\n return this.point(this.zero, y);\n }\n var x = x2.redSqrt();\n if (x.redSqr().redSub(x2).cmp(this.zero) !== 0) throw new Error(\"invalid point\");\n return x.fromRed().isOdd() !== odd && (x = x.redNeg()), this.point(x, y);\n };\n EdwardsCurve.prototype.validate = function (point) {\n if (point.isInfinity()) return !0;\n point.normalize();\n var x2 = point.x.redSqr(),\n y2 = point.y.redSqr(),\n lhs = x2.redMul(this.a).redAdd(y2),\n rhs = this.c2.redMul(this.one.redAdd(this.d.redMul(x2).redMul(y2)));\n return lhs.cmp(rhs) === 0;\n };\n function Point(curve, x, y, z, t) {\n Base.BasePoint.call(this, curve, \"projective\"),\n x === null && y === null && z === null\n ? ((this.x = this.curve.zero),\n (this.y = this.curve.one),\n (this.z = this.curve.one),\n (this.t = this.curve.zero),\n (this.zOne = !0))\n : ((this.x = new BN(x, 16)),\n (this.y = new BN(y, 16)),\n (this.z = z ? new BN(z, 16) : this.curve.one),\n (this.t = t && new BN(t, 16)),\n this.x.red || (this.x = this.x.toRed(this.curve.red)),\n this.y.red || (this.y = this.y.toRed(this.curve.red)),\n this.z.red || (this.z = this.z.toRed(this.curve.red)),\n this.t && !this.t.red && (this.t = this.t.toRed(this.curve.red)),\n (this.zOne = this.z === this.curve.one),\n this.curve.extended &&\n !this.t &&\n ((this.t = this.x.redMul(this.y)), this.zOne || (this.t = this.t.redMul(this.z.redInvm()))));\n }\n inherits(Point, Base.BasePoint);\n EdwardsCurve.prototype.pointFromJSON = function (obj) {\n return Point.fromJSON(this, obj);\n };\n EdwardsCurve.prototype.point = function (x, y, z, t) {\n return new Point(this, x, y, z, t);\n };\n Point.fromJSON = function (curve, obj) {\n return new Point(curve, obj[0], obj[1], obj[2]);\n };\n Point.prototype.inspect = function () {\n return this.isInfinity()\n ? \"<EC Point Infinity>\"\n : \"<EC Point x: \" +\n this.x.fromRed().toString(16, 2) +\n \" y: \" +\n this.y.fromRed().toString(16, 2) +\n \" z: \" +\n this.z.fromRed().toString(16, 2) +\n \">\";\n };\n Point.prototype.isInfinity = function () {\n return this.x.cmpn(0) === 0 && (this.y.cmp(this.z) === 0 || (this.zOne && this.y.cmp(this.curve.c) === 0));\n };\n Point.prototype._extDbl = function () {\n var a = this.x.redSqr(),\n b = this.y.redSqr(),\n c = this.z.redSqr();\n c = c.redIAdd(c);\n var d = this.curve._mulA(a),\n e = this.x.redAdd(this.y).redSqr().redISub(a).redISub(b),\n g = d.redAdd(b),\n f = g.redSub(c),\n h = d.redSub(b),\n nx = e.redMul(f),\n ny = g.redMul(h),\n nt = e.redMul(h),\n nz = f.redMul(g);\n return this.curve.point(nx, ny, nz, nt);\n };\n Point.prototype._projDbl = function () {\n var b = this.x.redAdd(this.y).redSqr(),\n c = this.x.redSqr(),\n d = this.y.redSqr(),\n nx,\n ny,\n nz,\n e,\n h,\n j;\n if (this.curve.twisted) {\n e = this.curve._mulA(c);\n var f = e.redAdd(d);\n this.zOne\n ? ((nx = b.redSub(c).redSub(d).redMul(f.redSub(this.curve.two))),\n (ny = f.redMul(e.redSub(d))),\n (nz = f.redSqr().redSub(f).redSub(f)))\n : ((h = this.z.redSqr()),\n (j = f.redSub(h).redISub(h)),\n (nx = b.redSub(c).redISub(d).redMul(j)),\n (ny = f.redMul(e.redSub(d))),\n (nz = f.redMul(j)));\n } else\n (e = c.redAdd(d)),\n (h = this.curve._mulC(this.z).redSqr()),\n (j = e.redSub(h).redSub(h)),\n (nx = this.curve._mulC(b.redISub(e)).redMul(j)),\n (ny = this.curve._mulC(e).redMul(c.redISub(d))),\n (nz = e.redMul(j));\n return this.curve.point(nx, ny, nz);\n };\n Point.prototype.dbl = function () {\n return this.isInfinity() ? this : this.curve.extended ? this._extDbl() : this._projDbl();\n };\n Point.prototype._extAdd = function (p) {\n var a = this.y.redSub(this.x).redMul(p.y.redSub(p.x)),\n b = this.y.redAdd(this.x).redMul(p.y.redAdd(p.x)),\n c = this.t.redMul(this.curve.dd).redMul(p.t),\n d = this.z.redMul(p.z.redAdd(p.z)),\n e = b.redSub(a),\n f = d.redSub(c),\n g = d.redAdd(c),\n h = b.redAdd(a),\n nx = e.redMul(f),\n ny = g.redMul(h),\n nt = e.redMul(h),\n nz = f.redMul(g);\n return this.curve.point(nx, ny, nz, nt);\n };\n Point.prototype._projAdd = function (p) {\n var a = this.z.redMul(p.z),\n b = a.redSqr(),\n c = this.x.redMul(p.x),\n d = this.y.redMul(p.y),\n e = this.curve.d.redMul(c).redMul(d),\n f = b.redSub(e),\n g = b.redAdd(e),\n tmp = this.x.redAdd(this.y).redMul(p.x.redAdd(p.y)).redISub(c).redISub(d),\n nx = a.redMul(f).redMul(tmp),\n ny,\n nz;\n return (\n this.curve.twisted\n ? ((ny = a.redMul(g).redMul(d.redSub(this.curve._mulA(c)))), (nz = f.redMul(g)))\n : ((ny = a.redMul(g).redMul(d.redSub(c))), (nz = this.curve._mulC(f).redMul(g))),\n this.curve.point(nx, ny, nz)\n );\n };\n Point.prototype.add = function (p) {\n return this.isInfinity() ? p : p.isInfinity() ? this : this.curve.extended ? this._extAdd(p) : this._projAdd(p);\n };\n Point.prototype.mul = function (k) {\n return this._hasDoubles(k) ? this.curve._fixedNafMul(this, k) : this.curve._wnafMul(this, k);\n };\n Point.prototype.mulAdd = function (k1, p, k2) {\n return this.curve._wnafMulAdd(1, [this, p], [k1, k2], 2, !1);\n };\n Point.prototype.jmulAdd = function (k1, p, k2) {\n return this.curve._wnafMulAdd(1, [this, p], [k1, k2], 2, !0);\n };\n Point.prototype.normalize = function () {\n if (this.zOne) return this;\n var zi = this.z.redInvm();\n return (\n (this.x = this.x.redMul(zi)),\n (this.y = this.y.redMul(zi)),\n this.t && (this.t = this.t.redMul(zi)),\n (this.z = this.curve.one),\n (this.zOne = !0),\n this\n );\n };\n Point.prototype.neg = function () {\n return this.curve.point(this.x.redNeg(), this.y, this.z, this.t && this.t.redNeg());\n };\n Point.prototype.getX = function () {\n return this.normalize(), this.x.fromRed();\n };\n Point.prototype.getY = function () {\n return this.normalize(), this.y.fromRed();\n };\n Point.prototype.eq = function (other) {\n return this === other || (this.getX().cmp(other.getX()) === 0 && this.getY().cmp(other.getY()) === 0);\n };\n Point.prototype.eqXToP = function (x) {\n var rx = x.toRed(this.curve.red).redMul(this.z);\n if (this.x.cmp(rx) === 0) return !0;\n for (var xc = x.clone(), t = this.curve.redN.redMul(this.z); ; ) {\n if ((xc.iadd(this.curve.n), xc.cmp(this.curve.p) >= 0)) return !1;\n if ((rx.redIAdd(t), this.x.cmp(rx) === 0)) return !0;\n }\n };\n Point.prototype.toP = Point.prototype.normalize;\n Point.prototype.mixedAdd = Point.prototype.add;\n },\n});\n\n// node_modules/elliptic/lib/elliptic/curve/index.js\nvar require_curve = __commonJS({\n \"node_modules/elliptic/lib/elliptic/curve/index.js\"(exports) {\n \"use strict\";\n var curve = exports;\n curve.base = require_base();\n curve.short = require_short();\n curve.mont = require_mont();\n curve.edwards = require_edwards();\n },\n});\n\n// node_modules/hash.js/lib/hash/utils.js\nvar require_utils4 = __commonJS({\n \"node_modules/hash.js/lib/hash/utils.js\"(exports) {\n \"use strict\";\n var assert = require_minimalistic_assert(),\n inherits = require_inherits_browser();\n exports.inherits = inherits;\n function isSurrogatePair(msg, i) {\n return (msg.charCodeAt(i) & 64512) !== 55296 || i < 0 || i + 1 >= msg.length\n ? !1\n : (msg.charCodeAt(i + 1) & 64512) === 56320;\n }\n function toArray(msg, enc) {\n if (Array.isArray(msg)) return msg.slice();\n if (!msg) return [];\n var res = [];\n if (typeof msg == \"string\")\n if (enc) {\n if (enc === \"hex\")\n for (\n msg = msg.replace(/[^a-z0-9]+/gi, \"\"), msg.length % 2 !== 0 && (msg = \"0\" + msg), i = 0;\n i < msg.length;\n i += 2\n )\n res.push(parseInt(msg[i] + msg[i + 1], 16));\n } else\n for (var p = 0, i = 0; i < msg.length; i++) {\n var c = msg.charCodeAt(i);\n c < 128\n ? (res[p++] = c)\n : c < 2048\n ? ((res[p++] = (c >> 6) | 192), (res[p++] = (c & 63) | 128))\n : isSurrogatePair(msg, i)\n ? ((c = 65536 + ((c & 1023) << 10) + (msg.charCodeAt(++i) & 1023)),\n (res[p++] = (c >> 18) | 240),\n (res[p++] = ((c >> 12) & 63) | 128),\n (res[p++] = ((c >> 6) & 63) | 128),\n (res[p++] = (c & 63) | 128))\n : ((res[p++] = (c >> 12) | 224), (res[p++] = ((c >> 6) & 63) | 128), (res[p++] = (c & 63) | 128));\n }\n else for (i = 0; i < msg.length; i++) res[i] = msg[i] | 0;\n return res;\n }\n exports.toArray = toArray;\n function toHex(msg) {\n for (var res = \"\", i = 0; i < msg.length; i++) res += zero2(msg[i].toString(16));\n return res;\n }\n exports.toHex = toHex;\n function htonl(w) {\n var res = (w >>> 24) | ((w >>> 8) & 65280) | ((w << 8) & 16711680) | ((w & 255) << 24);\n return res >>> 0;\n }\n exports.htonl = htonl;\n function toHex32(msg, endian) {\n for (var res = \"\", i = 0; i < msg.length; i++) {\n var w = msg[i];\n endian === \"little\" && (w = htonl(w)), (res += zero8(w.toString(16)));\n }\n return res;\n }\n exports.toHex32 = toHex32;\n function zero2(word) {\n return word.length === 1 ? \"0\" + word : word;\n }\n exports.zero2 = zero2;\n function zero8(word) {\n return word.length === 7\n ? \"0\" + word\n : word.length === 6\n ? \"00\" + word\n : word.length === 5\n ? \"000\" + word\n : word.length === 4\n ? \"0000\" + word\n : word.length === 3\n ? \"00000\" + word\n : word.length === 2\n ? \"000000\" + word\n : word.length === 1\n ? \"0000000\" + word\n : word;\n }\n exports.zero8 = zero8;\n function join32(msg, start, end, endian) {\n var len = end - start;\n assert(len % 4 === 0);\n for (var res = new Array(len / 4), i = 0, k = start; i < res.length; i++, k += 4) {\n var w;\n endian === \"big\"\n ? (w = (msg[k] << 24) | (msg[k + 1] << 16) | (msg[k + 2] << 8) | msg[k + 3])\n : (w = (msg[k + 3] << 24) | (msg[k + 2] << 16) | (msg[k + 1] << 8) | msg[k]),\n (res[i] = w >>> 0);\n }\n return res;\n }\n exports.join32 = join32;\n function split32(msg, endian) {\n for (var res = new Array(msg.length * 4), i = 0, k = 0; i < msg.length; i++, k += 4) {\n var m = msg[i];\n endian === \"big\"\n ? ((res[k] = m >>> 24),\n (res[k + 1] = (m >>> 16) & 255),\n (res[k + 2] = (m >>> 8) & 255),\n (res[k + 3] = m & 255))\n : ((res[k + 3] = m >>> 24),\n (res[k + 2] = (m >>> 16) & 255),\n (res[k + 1] = (m >>> 8) & 255),\n (res[k] = m & 255));\n }\n return res;\n }\n exports.split32 = split32;\n function rotr32(w, b) {\n return (w >>> b) | (w << (32 - b));\n }\n exports.rotr32 = rotr32;\n function rotl32(w, b) {\n return (w << b) | (w >>> (32 - b));\n }\n exports.rotl32 = rotl32;\n function sum32(a, b) {\n return (a + b) >>> 0;\n }\n exports.sum32 = sum32;\n function sum32_3(a, b, c) {\n return (a + b + c) >>> 0;\n }\n exports.sum32_3 = sum32_3;\n function sum32_4(a, b, c, d) {\n return (a + b + c + d) >>> 0;\n }\n exports.sum32_4 = sum32_4;\n function sum32_5(a, b, c, d, e) {\n return (a + b + c + d + e) >>> 0;\n }\n exports.sum32_5 = sum32_5;\n function sum64(buf, pos, ah, al) {\n var bh = buf[pos],\n bl = buf[pos + 1],\n lo = (al + bl) >>> 0,\n hi = (lo < al ? 1 : 0) + ah + bh;\n (buf[pos] = hi >>> 0), (buf[pos + 1] = lo);\n }\n exports.sum64 = sum64;\n function sum64_hi(ah, al, bh, bl) {\n var lo = (al + bl) >>> 0,\n hi = (lo < al ? 1 : 0) + ah + bh;\n return hi >>> 0;\n }\n exports.sum64_hi = sum64_hi;\n function sum64_lo(ah, al, bh, bl) {\n var lo = al + bl;\n return lo >>> 0;\n }\n exports.sum64_lo = sum64_lo;\n function sum64_4_hi(ah, al, bh, bl, ch, cl, dh, dl) {\n var carry = 0,\n lo = al;\n (lo = (lo + bl) >>> 0),\n (carry += lo < al ? 1 : 0),\n (lo = (lo + cl) >>> 0),\n (carry += lo < cl ? 1 : 0),\n (lo = (lo + dl) >>> 0),\n (carry += lo < dl ? 1 : 0);\n var hi = ah + bh + ch + dh + carry;\n return hi >>> 0;\n }\n exports.sum64_4_hi = sum64_4_hi;\n function sum64_4_lo(ah, al, bh, bl, ch, cl, dh, dl) {\n var lo = al + bl + cl + dl;\n return lo >>> 0;\n }\n exports.sum64_4_lo = sum64_4_lo;\n function sum64_5_hi(ah, al, bh, bl, ch, cl, dh, dl, eh, el) {\n var carry = 0,\n lo = al;\n (lo = (lo + bl) >>> 0),\n (carry += lo < al ? 1 : 0),\n (lo = (lo + cl) >>> 0),\n (carry += lo < cl ? 1 : 0),\n (lo = (lo + dl) >>> 0),\n (carry += lo < dl ? 1 : 0),\n (lo = (lo + el) >>> 0),\n (carry += lo < el ? 1 : 0);\n var hi = ah + bh + ch + dh + eh + carry;\n return hi >>> 0;\n }\n exports.sum64_5_hi = sum64_5_hi;\n function sum64_5_lo(ah, al, bh, bl, ch, cl, dh, dl, eh, el) {\n var lo = al + bl + cl + dl + el;\n return lo >>> 0;\n }\n exports.sum64_5_lo = sum64_5_lo;\n function rotr64_hi(ah, al, num) {\n var r = (al << (32 - num)) | (ah >>> num);\n return r >>> 0;\n }\n exports.rotr64_hi = rotr64_hi;\n function rotr64_lo(ah, al, num) {\n var r = (ah << (32 - num)) | (al >>> num);\n return r >>> 0;\n }\n exports.rotr64_lo = rotr64_lo;\n function shr64_hi(ah, al, num) {\n return ah >>> num;\n }\n exports.shr64_hi = shr64_hi;\n function shr64_lo(ah, al, num) {\n var r = (ah << (32 - num)) | (al >>> num);\n return r >>> 0;\n }\n exports.shr64_lo = shr64_lo;\n },\n});\n\n// node_modules/hash.js/lib/hash/common.js\nvar require_common = __commonJS({\n \"node_modules/hash.js/lib/hash/common.js\"(exports) {\n \"use strict\";\n var utils = require_utils4(),\n assert = require_minimalistic_assert();\n function BlockHash() {\n (this.pending = null),\n (this.pendingTotal = 0),\n (this.blockSize = this.constructor.blockSize),\n (this.outSize = this.constructor.outSize),\n (this.hmacStrength = this.constructor.hmacStrength),\n (this.padLength = this.constructor.padLength / 8),\n (this.endian = \"big\"),\n (this._delta8 = this.blockSize / 8),\n (this._delta32 = this.blockSize / 32);\n }\n exports.BlockHash = BlockHash;\n BlockHash.prototype.update = function (msg, enc) {\n if (\n ((msg = utils.toArray(msg, enc)),\n this.pending ? (this.pending = this.pending.concat(msg)) : (this.pending = msg),\n (this.pendingTotal += msg.length),\n this.pending.length >= this._delta8)\n ) {\n msg = this.pending;\n var r = msg.length % this._delta8;\n (this.pending = msg.slice(msg.length - r, msg.length)),\n this.pending.length === 0 && (this.pending = null),\n (msg = utils.join32(msg, 0, msg.length - r, this.endian));\n for (var i = 0; i < msg.length; i += this._delta32) this._update(msg, i, i + this._delta32);\n }\n return this;\n };\n BlockHash.prototype.digest = function (enc) {\n return this.update(this._pad()), assert(this.pending === null), this._digest(enc);\n };\n BlockHash.prototype._pad = function () {\n var len = this.pendingTotal,\n bytes = this._delta8,\n k = bytes - ((len + this.padLength) % bytes),\n res = new Array(k + this.padLength);\n res[0] = 128;\n for (var i = 1; i < k; i++) res[i] = 0;\n if (((len <<= 3), this.endian === \"big\")) {\n for (var t = 8; t < this.padLength; t++) res[i++] = 0;\n (res[i++] = 0),\n (res[i++] = 0),\n (res[i++] = 0),\n (res[i++] = 0),\n (res[i++] = (len >>> 24) & 255),\n (res[i++] = (len >>> 16) & 255),\n (res[i++] = (len >>> 8) & 255),\n (res[i++] = len & 255);\n } else\n for (\n res[i++] = len & 255,\n res[i++] = (len >>> 8) & 255,\n res[i++] = (len >>> 16) & 255,\n res[i++] = (len >>> 24) & 255,\n res[i++] = 0,\n res[i++] = 0,\n res[i++] = 0,\n res[i++] = 0,\n t = 8;\n t < this.padLength;\n t++\n )\n res[i++] = 0;\n return res;\n };\n },\n});\n\n// node_modules/hash.js/lib/hash/sha/common.js\nvar require_common2 = __commonJS({\n \"node_modules/hash.js/lib/hash/sha/common.js\"(exports) {\n \"use strict\";\n var utils = require_utils4(),\n rotr32 = utils.rotr32;\n function ft_1(s, x, y, z) {\n if (s === 0) return ch32(x, y, z);\n if (s === 1 || s === 3) return p32(x, y, z);\n if (s === 2) return maj32(x, y, z);\n }\n exports.ft_1 = ft_1;\n function ch32(x, y, z) {\n return (x & y) ^ (~x & z);\n }\n exports.ch32 = ch32;\n function maj32(x, y, z) {\n return (x & y) ^ (x & z) ^ (y & z);\n }\n exports.maj32 = maj32;\n function p32(x, y, z) {\n return x ^ y ^ z;\n }\n exports.p32 = p32;\n function s0_256(x) {\n return rotr32(x, 2) ^ rotr32(x, 13) ^ rotr32(x, 22);\n }\n exports.s0_256 = s0_256;\n function s1_256(x) {\n return rotr32(x, 6) ^ rotr32(x, 11) ^ rotr32(x, 25);\n }\n exports.s1_256 = s1_256;\n function g0_256(x) {\n return rotr32(x, 7) ^ rotr32(x, 18) ^ (x >>> 3);\n }\n exports.g0_256 = g0_256;\n function g1_256(x) {\n return rotr32(x, 17) ^ rotr32(x, 19) ^ (x >>> 10);\n }\n exports.g1_256 = g1_256;\n },\n});\n\n// node_modules/hash.js/lib/hash/sha/1.js\nvar require__ = __commonJS({\n \"node_modules/hash.js/lib/hash/sha/1.js\"(exports, module) {\n \"use strict\";\n var utils = require_utils4(),\n common = require_common(),\n shaCommon = require_common2(),\n rotl32 = utils.rotl32,\n sum32 = utils.sum32,\n sum32_5 = utils.sum32_5,\n ft_1 = shaCommon.ft_1,\n BlockHash = common.BlockHash,\n sha1_K = [1518500249, 1859775393, 2400959708, 3395469782];\n function SHA1() {\n if (!(this instanceof SHA1)) return new SHA1();\n BlockHash.call(this),\n (this.h = [1732584193, 4023233417, 2562383102, 271733878, 3285377520]),\n (this.W = new Array(80));\n }\n utils.inherits(SHA1, BlockHash);\n module.exports = SHA1;\n SHA1.blockSize = 512;\n SHA1.outSize = 160;\n SHA1.hmacStrength = 80;\n SHA1.padLength = 64;\n SHA1.prototype._update = function (msg, start) {\n for (var W = this.W, i = 0; i < 16; i++) W[i] = msg[start + i];\n for (; i < W.length; i++) W[i] = rotl32(W[i - 3] ^ W[i - 8] ^ W[i - 14] ^ W[i - 16], 1);\n var a = this.h[0],\n b = this.h[1],\n c = this.h[2],\n d = this.h[3],\n e = this.h[4];\n for (i = 0; i < W.length; i++) {\n var s = ~~(i / 20),\n t = sum32_5(rotl32(a, 5), ft_1(s, b, c, d), e, W[i], sha1_K[s]);\n (e = d), (d = c), (c = rotl32(b, 30)), (b = a), (a = t);\n }\n (this.h[0] = sum32(this.h[0], a)),\n (this.h[1] = sum32(this.h[1], b)),\n (this.h[2] = sum32(this.h[2], c)),\n (this.h[3] = sum32(this.h[3], d)),\n (this.h[4] = sum32(this.h[4], e));\n };\n SHA1.prototype._digest = function (enc) {\n return enc === \"hex\" ? utils.toHex32(this.h, \"big\") : utils.split32(this.h, \"big\");\n };\n },\n});\n\n// node_modules/hash.js/lib/hash/sha/256.js\nvar require__2 = __commonJS({\n \"node_modules/hash.js/lib/hash/sha/256.js\"(exports, module) {\n \"use strict\";\n var utils = require_utils4(),\n common = require_common(),\n shaCommon = require_common2(),\n assert = require_minimalistic_assert(),\n sum32 = utils.sum32,\n sum32_4 = utils.sum32_4,\n sum32_5 = utils.sum32_5,\n ch32 = shaCommon.ch32,\n maj32 = shaCommon.maj32,\n s0_256 = shaCommon.s0_256,\n s1_256 = shaCommon.s1_256,\n g0_256 = shaCommon.g0_256,\n g1_256 = shaCommon.g1_256,\n BlockHash = common.BlockHash,\n sha256_K = [\n 1116352408, 1899447441, 3049323471, 3921009573, 961987163, 1508970993, 2453635748, 2870763221, 3624381080,\n 310598401, 607225278, 1426881987, 1925078388, 2162078206, 2614888103, 3248222580, 3835390401, 4022224774,\n 264347078, 604807628, 770255983, 1249150122, 1555081692, 1996064986, 2554220882, 2821834349, 2952996808,\n 3210313671, 3336571891, 3584528711, 113926993, 338241895, 666307205, 773529912, 1294757372, 1396182291,\n 1695183700, 1986661051, 2177026350, 2456956037, 2730485921, 2820302411, 3259730800, 3345764771, 3516065817,\n 3600352804, 4094571909, 275423344, 430227734, 506948616, 659060556, 883997877, 958139571, 1322822218,\n 1537002063, 1747873779, 1955562222, 2024104815, 2227730452, 2361852424, 2428436474, 2756734187, 3204031479,\n 3329325298,\n ];\n function SHA256() {\n if (!(this instanceof SHA256)) return new SHA256();\n BlockHash.call(this),\n (this.h = [1779033703, 3144134277, 1013904242, 2773480762, 1359893119, 2600822924, 528734635, 1541459225]),\n (this.k = sha256_K),\n (this.W = new Array(64));\n }\n utils.inherits(SHA256, BlockHash);\n module.exports = SHA256;\n SHA256.blockSize = 512;\n SHA256.outSize = 256;\n SHA256.hmacStrength = 192;\n SHA256.padLength = 64;\n SHA256.prototype._update = function (msg, start) {\n for (var W = this.W, i = 0; i < 16; i++) W[i] = msg[start + i];\n for (; i < W.length; i++) W[i] = sum32_4(g1_256(W[i - 2]), W[i - 7], g0_256(W[i - 15]), W[i - 16]);\n var a = this.h[0],\n b = this.h[1],\n c = this.h[2],\n d = this.h[3],\n e = this.h[4],\n f = this.h[5],\n g = this.h[6],\n h = this.h[7];\n for (assert(this.k.length === W.length), i = 0; i < W.length; i++) {\n var T1 = sum32_5(h, s1_256(e), ch32(e, f, g), this.k[i], W[i]),\n T2 = sum32(s0_256(a), maj32(a, b, c));\n (h = g), (g = f), (f = e), (e = sum32(d, T1)), (d = c), (c = b), (b = a), (a = sum32(T1, T2));\n }\n (this.h[0] = sum32(this.h[0], a)),\n (this.h[1] = sum32(this.h[1], b)),\n (this.h[2] = sum32(this.h[2], c)),\n (this.h[3] = sum32(this.h[3], d)),\n (this.h[4] = sum32(this.h[4], e)),\n (this.h[5] = sum32(this.h[5], f)),\n (this.h[6] = sum32(this.h[6], g)),\n (this.h[7] = sum32(this.h[7], h));\n };\n SHA256.prototype._digest = function (enc) {\n return enc === \"hex\" ? utils.toHex32(this.h, \"big\") : utils.split32(this.h, \"big\");\n };\n },\n});\n\n// node_modules/hash.js/lib/hash/sha/224.js\nvar require__3 = __commonJS({\n \"node_modules/hash.js/lib/hash/sha/224.js\"(exports, module) {\n \"use strict\";\n var utils = require_utils4(),\n SHA256 = require__2();\n function SHA224() {\n if (!(this instanceof SHA224)) return new SHA224();\n SHA256.call(this),\n (this.h = [3238371032, 914150663, 812702999, 4144912697, 4290775857, 1750603025, 1694076839, 3204075428]);\n }\n utils.inherits(SHA224, SHA256);\n module.exports = SHA224;\n SHA224.blockSize = 512;\n SHA224.outSize = 224;\n SHA224.hmacStrength = 192;\n SHA224.padLength = 64;\n SHA224.prototype._digest = function (enc) {\n return enc === \"hex\" ? utils.toHex32(this.h.slice(0, 7), \"big\") : utils.split32(this.h.slice(0, 7), \"big\");\n };\n },\n});\n\n// node_modules/hash.js/lib/hash/sha/512.js\nvar require__4 = __commonJS({\n \"node_modules/hash.js/lib/hash/sha/512.js\"(exports, module) {\n \"use strict\";\n var utils = require_utils4(),\n common = require_common(),\n assert = require_minimalistic_assert(),\n rotr64_hi = utils.rotr64_hi,\n rotr64_lo = utils.rotr64_lo,\n shr64_hi = utils.shr64_hi,\n shr64_lo = utils.shr64_lo,\n sum64 = utils.sum64,\n sum64_hi = utils.sum64_hi,\n sum64_lo = utils.sum64_lo,\n sum64_4_hi = utils.sum64_4_hi,\n sum64_4_lo = utils.sum64_4_lo,\n sum64_5_hi = utils.sum64_5_hi,\n sum64_5_lo = utils.sum64_5_lo,\n BlockHash = common.BlockHash,\n sha512_K = [\n 1116352408, 3609767458, 1899447441, 602891725, 3049323471, 3964484399, 3921009573, 2173295548, 961987163,\n 4081628472, 1508970993, 3053834265, 2453635748, 2937671579, 2870763221, 3664609560, 3624381080, 2734883394,\n 310598401, 1164996542, 607225278, 1323610764, 1426881987, 3590304994, 1925078388, 4068182383, 2162078206,\n 991336113, 2614888103, 633803317, 3248222580, 3479774868, 3835390401, 2666613458, 4022224774, 944711139,\n 264347078, 2341262773, 604807628, 2007800933, 770255983, 1495990901, 1249150122, 1856431235, 1555081692,\n 3175218132, 1996064986, 2198950837, 2554220882, 3999719339, 2821834349, 766784016, 2952996808, 2566594879,\n 3210313671, 3203337956, 3336571891, 1034457026, 3584528711, 2466948901, 113926993, 3758326383, 338241895,\n 168717936, 666307205, 1188179964, 773529912, 1546045734, 1294757372, 1522805485, 1396182291, 2643833823,\n 1695183700, 2343527390, 1986661051, 1014477480, 2177026350, 1206759142, 2456956037, 344077627, 2730485921,\n 1290863460, 2820302411, 3158454273, 3259730800, 3505952657, 3345764771, 106217008, 3516065817, 3606008344,\n 3600352804, 1432725776, 4094571909, 1467031594, 275423344, 851169720, 430227734, 3100823752, 506948616,\n 1363258195, 659060556, 3750685593, 883997877, 3785050280, 958139571, 3318307427, 1322822218, 3812723403,\n 1537002063, 2003034995, 1747873779, 3602036899, 1955562222, 1575990012, 2024104815, 1125592928, 2227730452,\n 2716904306, 2361852424, 442776044, 2428436474, 593698344, 2756734187, 3733110249, 3204031479, 2999351573,\n 3329325298, 3815920427, 3391569614, 3928383900, 3515267271, 566280711, 3940187606, 3454069534, 4118630271,\n 4000239992, 116418474, 1914138554, 174292421, 2731055270, 289380356, 3203993006, 460393269, 320620315,\n 685471733, 587496836, 852142971, 1086792851, 1017036298, 365543100, 1126000580, 2618297676, 1288033470,\n 3409855158, 1501505948, 4234509866, 1607167915, 987167468, 1816402316, 1246189591,\n ];\n function SHA512() {\n if (!(this instanceof SHA512)) return new SHA512();\n BlockHash.call(this),\n (this.h = [\n 1779033703, 4089235720, 3144134277, 2227873595, 1013904242, 4271175723, 2773480762, 1595750129, 1359893119,\n 2917565137, 2600822924, 725511199, 528734635, 4215389547, 1541459225, 327033209,\n ]),\n (this.k = sha512_K),\n (this.W = new Array(160));\n }\n utils.inherits(SHA512, BlockHash);\n module.exports = SHA512;\n SHA512.blockSize = 1024;\n SHA512.outSize = 512;\n SHA512.hmacStrength = 192;\n SHA512.padLength = 128;\n SHA512.prototype._prepareBlock = function (msg, start) {\n for (var W = this.W, i = 0; i < 32; i++) W[i] = msg[start + i];\n for (; i < W.length; i += 2) {\n var c0_hi = g1_512_hi(W[i - 4], W[i - 3]),\n c0_lo = g1_512_lo(W[i - 4], W[i - 3]),\n c1_hi = W[i - 14],\n c1_lo = W[i - 13],\n c2_hi = g0_512_hi(W[i - 30], W[i - 29]),\n c2_lo = g0_512_lo(W[i - 30], W[i - 29]),\n c3_hi = W[i - 32],\n c3_lo = W[i - 31];\n (W[i] = sum64_4_hi(c0_hi, c0_lo, c1_hi, c1_lo, c2_hi, c2_lo, c3_hi, c3_lo)),\n (W[i + 1] = sum64_4_lo(c0_hi, c0_lo, c1_hi, c1_lo, c2_hi, c2_lo, c3_hi, c3_lo));\n }\n };\n SHA512.prototype._update = function (msg, start) {\n this._prepareBlock(msg, start);\n var W = this.W,\n ah = this.h[0],\n al = this.h[1],\n bh = this.h[2],\n bl = this.h[3],\n ch = this.h[4],\n cl = this.h[5],\n dh = this.h[6],\n dl = this.h[7],\n eh = this.h[8],\n el = this.h[9],\n fh = this.h[10],\n fl = this.h[11],\n gh = this.h[12],\n gl = this.h[13],\n hh = this.h[14],\n hl = this.h[15];\n assert(this.k.length === W.length);\n for (var i = 0; i < W.length; i += 2) {\n var c0_hi = hh,\n c0_lo = hl,\n c1_hi = s1_512_hi(eh, el),\n c1_lo = s1_512_lo(eh, el),\n c2_hi = ch64_hi(eh, el, fh, fl, gh, gl),\n c2_lo = ch64_lo(eh, el, fh, fl, gh, gl),\n c3_hi = this.k[i],\n c3_lo = this.k[i + 1],\n c4_hi = W[i],\n c4_lo = W[i + 1],\n T1_hi = sum64_5_hi(c0_hi, c0_lo, c1_hi, c1_lo, c2_hi, c2_lo, c3_hi, c3_lo, c4_hi, c4_lo),\n T1_lo = sum64_5_lo(c0_hi, c0_lo, c1_hi, c1_lo, c2_hi, c2_lo, c3_hi, c3_lo, c4_hi, c4_lo);\n (c0_hi = s0_512_hi(ah, al)),\n (c0_lo = s0_512_lo(ah, al)),\n (c1_hi = maj64_hi(ah, al, bh, bl, ch, cl)),\n (c1_lo = maj64_lo(ah, al, bh, bl, ch, cl));\n var T2_hi = sum64_hi(c0_hi, c0_lo, c1_hi, c1_lo),\n T2_lo = sum64_lo(c0_hi, c0_lo, c1_hi, c1_lo);\n (hh = gh),\n (hl = gl),\n (gh = fh),\n (gl = fl),\n (fh = eh),\n (fl = el),\n (eh = sum64_hi(dh, dl, T1_hi, T1_lo)),\n (el = sum64_lo(dl, dl, T1_hi, T1_lo)),\n (dh = ch),\n (dl = cl),\n (ch = bh),\n (cl = bl),\n (bh = ah),\n (bl = al),\n (ah = sum64_hi(T1_hi, T1_lo, T2_hi, T2_lo)),\n (al = sum64_lo(T1_hi, T1_lo, T2_hi, T2_lo));\n }\n sum64(this.h, 0, ah, al),\n sum64(this.h, 2, bh, bl),\n sum64(this.h, 4, ch, cl),\n sum64(this.h, 6, dh, dl),\n sum64(this.h, 8, eh, el),\n sum64(this.h, 10, fh, fl),\n sum64(this.h, 12, gh, gl),\n sum64(this.h, 14, hh, hl);\n };\n SHA512.prototype._digest = function (enc) {\n return enc === \"hex\" ? utils.toHex32(this.h, \"big\") : utils.split32(this.h, \"big\");\n };\n function ch64_hi(xh, xl, yh, yl, zh) {\n var r = (xh & yh) ^ (~xh & zh);\n return r < 0 && (r += 4294967296), r;\n }\n function ch64_lo(xh, xl, yh, yl, zh, zl) {\n var r = (xl & yl) ^ (~xl & zl);\n return r < 0 && (r += 4294967296), r;\n }\n function maj64_hi(xh, xl, yh, yl, zh) {\n var r = (xh & yh) ^ (xh & zh) ^ (yh & zh);\n return r < 0 && (r += 4294967296), r;\n }\n function maj64_lo(xh, xl, yh, yl, zh, zl) {\n var r = (xl & yl) ^ (xl & zl) ^ (yl & zl);\n return r < 0 && (r += 4294967296), r;\n }\n function s0_512_hi(xh, xl) {\n var c0_hi = rotr64_hi(xh, xl, 28),\n c1_hi = rotr64_hi(xl, xh, 2),\n c2_hi = rotr64_hi(xl, xh, 7),\n r = c0_hi ^ c1_hi ^ c2_hi;\n return r < 0 && (r += 4294967296), r;\n }\n function s0_512_lo(xh, xl) {\n var c0_lo = rotr64_lo(xh, xl, 28),\n c1_lo = rotr64_lo(xl, xh, 2),\n c2_lo = rotr64_lo(xl, xh, 7),\n r = c0_lo ^ c1_lo ^ c2_lo;\n return r < 0 && (r += 4294967296), r;\n }\n function s1_512_hi(xh, xl) {\n var c0_hi = rotr64_hi(xh, xl, 14),\n c1_hi = rotr64_hi(xh, xl, 18),\n c2_hi = rotr64_hi(xl, xh, 9),\n r = c0_hi ^ c1_hi ^ c2_hi;\n return r < 0 && (r += 4294967296), r;\n }\n function s1_512_lo(xh, xl) {\n var c0_lo = rotr64_lo(xh, xl, 14),\n c1_lo = rotr64_lo(xh, xl, 18),\n c2_lo = rotr64_lo(xl, xh, 9),\n r = c0_lo ^ c1_lo ^ c2_lo;\n return r < 0 && (r += 4294967296), r;\n }\n function g0_512_hi(xh, xl) {\n var c0_hi = rotr64_hi(xh, xl, 1),\n c1_hi = rotr64_hi(xh, xl, 8),\n c2_hi = shr64_hi(xh, xl, 7),\n r = c0_hi ^ c1_hi ^ c2_hi;\n return r < 0 && (r += 4294967296), r;\n }\n function g0_512_lo(xh, xl) {\n var c0_lo = rotr64_lo(xh, xl, 1),\n c1_lo = rotr64_lo(xh, xl, 8),\n c2_lo = shr64_lo(xh, xl, 7),\n r = c0_lo ^ c1_lo ^ c2_lo;\n return r < 0 && (r += 4294967296), r;\n }\n function g1_512_hi(xh, xl) {\n var c0_hi = rotr64_hi(xh, xl, 19),\n c1_hi = rotr64_hi(xl, xh, 29),\n c2_hi = shr64_hi(xh, xl, 6),\n r = c0_hi ^ c1_hi ^ c2_hi;\n return r < 0 && (r += 4294967296), r;\n }\n function g1_512_lo(xh, xl) {\n var c0_lo = rotr64_lo(xh, xl, 19),\n c1_lo = rotr64_lo(xl, xh, 29),\n c2_lo = shr64_lo(xh, xl, 6),\n r = c0_lo ^ c1_lo ^ c2_lo;\n return r < 0 && (r += 4294967296), r;\n }\n },\n});\n\n// node_modules/hash.js/lib/hash/sha/384.js\nvar require__5 = __commonJS({\n \"node_modules/hash.js/lib/hash/sha/384.js\"(exports, module) {\n \"use strict\";\n var utils = require_utils4(),\n SHA512 = require__4();\n function SHA384() {\n if (!(this instanceof SHA384)) return new SHA384();\n SHA512.call(this),\n (this.h = [\n 3418070365, 3238371032, 1654270250, 914150663, 2438529370, 812702999, 355462360, 4144912697, 1731405415,\n 4290775857, 2394180231, 1750603025, 3675008525, 1694076839, 1203062813, 3204075428,\n ]);\n }\n utils.inherits(SHA384, SHA512);\n module.exports = SHA384;\n SHA384.blockSize = 1024;\n SHA384.outSize = 384;\n SHA384.hmacStrength = 192;\n SHA384.padLength = 128;\n SHA384.prototype._digest = function (enc) {\n return enc === \"hex\" ? utils.toHex32(this.h.slice(0, 12), \"big\") : utils.split32(this.h.slice(0, 12), \"big\");\n };\n },\n});\n\n// node_modules/hash.js/lib/hash/sha.js\nvar require_sha3 = __commonJS({\n \"node_modules/hash.js/lib/hash/sha.js\"(exports) {\n \"use strict\";\n exports.sha1 = require__();\n exports.sha224 = require__3();\n exports.sha256 = require__2();\n exports.sha384 = require__5();\n exports.sha512 = require__4();\n },\n});\n\n// node_modules/hash.js/lib/hash/ripemd.js\nvar require_ripemd = __commonJS({\n \"node_modules/hash.js/lib/hash/ripemd.js\"(exports) {\n \"use strict\";\n var utils = require_utils4(),\n common = require_common(),\n rotl32 = utils.rotl32,\n sum32 = utils.sum32,\n sum32_3 = utils.sum32_3,\n sum32_4 = utils.sum32_4,\n BlockHash = common.BlockHash;\n function RIPEMD160() {\n if (!(this instanceof RIPEMD160)) return new RIPEMD160();\n BlockHash.call(this),\n (this.h = [1732584193, 4023233417, 2562383102, 271733878, 3285377520]),\n (this.endian = \"little\");\n }\n utils.inherits(RIPEMD160, BlockHash);\n exports.ripemd160 = RIPEMD160;\n RIPEMD160.blockSize = 512;\n RIPEMD160.outSize = 160;\n RIPEMD160.hmacStrength = 192;\n RIPEMD160.padLength = 64;\n RIPEMD160.prototype._update = function (msg, start) {\n for (\n var A = this.h[0],\n B = this.h[1],\n C = this.h[2],\n D = this.h[3],\n E = this.h[4],\n Ah = A,\n Bh = B,\n Ch = C,\n Dh = D,\n Eh = E,\n j = 0;\n j < 80;\n j++\n ) {\n var T = sum32(rotl32(sum32_4(A, f(j, B, C, D), msg[r[j] + start], K(j)), s[j]), E);\n (A = E),\n (E = D),\n (D = rotl32(C, 10)),\n (C = B),\n (B = T),\n (T = sum32(rotl32(sum32_4(Ah, f(79 - j, Bh, Ch, Dh), msg[rh[j] + start], Kh(j)), sh[j]), Eh)),\n (Ah = Eh),\n (Eh = Dh),\n (Dh = rotl32(Ch, 10)),\n (Ch = Bh),\n (Bh = T);\n }\n (T = sum32_3(this.h[1], C, Dh)),\n (this.h[1] = sum32_3(this.h[2], D, Eh)),\n (this.h[2] = sum32_3(this.h[3], E, Ah)),\n (this.h[3] = sum32_3(this.h[4], A, Bh)),\n (this.h[4] = sum32_3(this.h[0], B, Ch)),\n (this.h[0] = T);\n };\n RIPEMD160.prototype._digest = function (enc) {\n return enc === \"hex\" ? utils.toHex32(this.h, \"little\") : utils.split32(this.h, \"little\");\n };\n function f(j, x, y, z) {\n return j <= 15\n ? x ^ y ^ z\n : j <= 31\n ? (x & y) | (~x & z)\n : j <= 47\n ? (x | ~y) ^ z\n : j <= 63\n ? (x & z) | (y & ~z)\n : x ^ (y | ~z);\n }\n function K(j) {\n return j <= 15 ? 0 : j <= 31 ? 1518500249 : j <= 47 ? 1859775393 : j <= 63 ? 2400959708 : 2840853838;\n }\n function Kh(j) {\n return j <= 15 ? 1352829926 : j <= 31 ? 1548603684 : j <= 47 ? 1836072691 : j <= 63 ? 2053994217 : 0;\n }\n var r = [\n 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 7, 4, 13, 1, 10, 6, 15, 3, 12, 0, 9, 5, 2, 14, 11, 8, 3,\n 10, 14, 4, 9, 15, 8, 1, 2, 7, 0, 6, 13, 11, 5, 12, 1, 9, 11, 10, 0, 8, 12, 4, 13, 3, 7, 15, 14, 5, 6, 2, 4, 0,\n 5, 9, 7, 12, 2, 10, 14, 1, 3, 8, 11, 6, 15, 13,\n ],\n rh = [\n 5, 14, 7, 0, 9, 2, 11, 4, 13, 6, 15, 8, 1, 10, 3, 12, 6, 11, 3, 7, 0, 13, 5, 10, 14, 15, 8, 12, 4, 9, 1, 2, 15,\n 5, 1, 3, 7, 14, 6, 9, 11, 8, 12, 2, 10, 0, 4, 13, 8, 6, 4, 1, 3, 11, 15, 0, 5, 12, 2, 13, 9, 7, 10, 14, 12, 15,\n 10, 4, 1, 5, 8, 7, 6, 2, 13, 14, 0, 3, 9, 11,\n ],\n s = [\n 11, 14, 15, 12, 5, 8, 7, 9, 11, 13, 14, 15, 6, 7, 9, 8, 7, 6, 8, 13, 11, 9, 7, 15, 7, 12, 15, 9, 11, 7, 13, 12,\n 11, 13, 6, 7, 14, 9, 13, 15, 14, 8, 13, 6, 5, 12, 7, 5, 11, 12, 14, 15, 14, 15, 9, 8, 9, 14, 5, 6, 8, 6, 5, 12,\n 9, 15, 5, 11, 6, 8, 13, 12, 5, 12, 13, 14, 11, 8, 5, 6,\n ],\n sh = [\n 8, 9, 9, 11, 13, 15, 15, 5, 7, 7, 8, 11, 14, 14, 12, 6, 9, 13, 15, 7, 12, 8, 9, 11, 7, 7, 12, 7, 6, 15, 13, 11,\n 9, 7, 15, 11, 8, 6, 6, 14, 12, 13, 5, 14, 13, 13, 7, 5, 15, 5, 8, 11, 14, 14, 6, 14, 6, 9, 12, 9, 12, 5, 15, 8,\n 8, 5, 12, 9, 12, 5, 14, 6, 8, 13, 6, 5, 15, 13, 11, 11,\n ];\n },\n});\n\n// node_modules/hash.js/lib/hash/hmac.js\nvar require_hmac = __commonJS({\n \"node_modules/hash.js/lib/hash/hmac.js\"(exports, module) {\n \"use strict\";\n var utils = require_utils4(),\n assert = require_minimalistic_assert();\n function Hmac(hash, key, enc) {\n if (!(this instanceof Hmac)) return new Hmac(hash, key, enc);\n (this.Hash = hash),\n (this.blockSize = hash.blockSize / 8),\n (this.outSize = hash.outSize / 8),\n (this.inner = null),\n (this.outer = null),\n this._init(utils.toArray(key, enc));\n }\n module.exports = Hmac;\n Hmac.prototype._init = function (key) {\n key.length > this.blockSize && (key = new this.Hash().update(key).digest()), assert(key.length <= this.blockSize);\n for (var i = key.length; i < this.blockSize; i++) key.push(0);\n for (i = 0; i < key.length; i++) key[i] ^= 54;\n for (this.inner = new this.Hash().update(key), i = 0; i < key.length; i++) key[i] ^= 106;\n this.outer = new this.Hash().update(key);\n };\n Hmac.prototype.update = function (msg, enc) {\n return this.inner.update(msg, enc), this;\n };\n Hmac.prototype.digest = function (enc) {\n return this.outer.update(this.inner.digest()), this.outer.digest(enc);\n };\n },\n});\n\n// node_modules/hash.js/lib/hash.js\nvar require_hash2 = __commonJS({\n \"node_modules/hash.js/lib/hash.js\"(exports) {\n var hash = exports;\n hash.utils = require_utils4();\n hash.common = require_common();\n hash.sha = require_sha3();\n hash.ripemd = require_ripemd();\n hash.hmac = require_hmac();\n hash.sha1 = hash.sha.sha1;\n hash.sha256 = hash.sha.sha256;\n hash.sha224 = hash.sha.sha224;\n hash.sha384 = hash.sha.sha384;\n hash.sha512 = hash.sha.sha512;\n hash.ripemd160 = hash.ripemd.ripemd160;\n },\n});\n\n// node_modules/elliptic/lib/elliptic/precomputed/secp256k1.js\nvar require_secp256k1 = __commonJS({\n \"node_modules/elliptic/lib/elliptic/precomputed/secp256k1.js\"(exports, module) {\n module.exports = {\n doubles: {\n step: 4,\n points: [\n [\n \"e60fce93b59e9ec53011aabc21c23e97b2a31369b87a5ae9c44ee89e2a6dec0a\",\n \"f7e3507399e595929db99f34f57937101296891e44d23f0be1f32cce69616821\",\n ],\n [\n \"8282263212c609d9ea2a6e3e172de238d8c39cabd5ac1ca10646e23fd5f51508\",\n \"11f8a8098557dfe45e8256e830b60ace62d613ac2f7b17bed31b6eaff6e26caf\",\n ],\n [\n \"175e159f728b865a72f99cc6c6fc846de0b93833fd2222ed73fce5b551e5b739\",\n \"d3506e0d9e3c79eba4ef97a51ff71f5eacb5955add24345c6efa6ffee9fed695\",\n ],\n [\n \"363d90d447b00c9c99ceac05b6262ee053441c7e55552ffe526bad8f83ff4640\",\n \"4e273adfc732221953b445397f3363145b9a89008199ecb62003c7f3bee9de9\",\n ],\n [\n \"8b4b5f165df3c2be8c6244b5b745638843e4a781a15bcd1b69f79a55dffdf80c\",\n \"4aad0a6f68d308b4b3fbd7813ab0da04f9e336546162ee56b3eff0c65fd4fd36\",\n ],\n [\n \"723cbaa6e5db996d6bf771c00bd548c7b700dbffa6c0e77bcb6115925232fcda\",\n \"96e867b5595cc498a921137488824d6e2660a0653779494801dc069d9eb39f5f\",\n ],\n [\n \"eebfa4d493bebf98ba5feec812c2d3b50947961237a919839a533eca0e7dd7fa\",\n \"5d9a8ca3970ef0f269ee7edaf178089d9ae4cdc3a711f712ddfd4fdae1de8999\",\n ],\n [\n \"100f44da696e71672791d0a09b7bde459f1215a29b3c03bfefd7835b39a48db0\",\n \"cdd9e13192a00b772ec8f3300c090666b7ff4a18ff5195ac0fbd5cd62bc65a09\",\n ],\n [\n \"e1031be262c7ed1b1dc9227a4a04c017a77f8d4464f3b3852c8acde6e534fd2d\",\n \"9d7061928940405e6bb6a4176597535af292dd419e1ced79a44f18f29456a00d\",\n ],\n [\n \"feea6cae46d55b530ac2839f143bd7ec5cf8b266a41d6af52d5e688d9094696d\",\n \"e57c6b6c97dce1bab06e4e12bf3ecd5c981c8957cc41442d3155debf18090088\",\n ],\n [\n \"da67a91d91049cdcb367be4be6ffca3cfeed657d808583de33fa978bc1ec6cb1\",\n \"9bacaa35481642bc41f463f7ec9780e5dec7adc508f740a17e9ea8e27a68be1d\",\n ],\n [\n \"53904faa0b334cdda6e000935ef22151ec08d0f7bb11069f57545ccc1a37b7c0\",\n \"5bc087d0bc80106d88c9eccac20d3c1c13999981e14434699dcb096b022771c8\",\n ],\n [\n \"8e7bcd0bd35983a7719cca7764ca906779b53a043a9b8bcaeff959f43ad86047\",\n \"10b7770b2a3da4b3940310420ca9514579e88e2e47fd68b3ea10047e8460372a\",\n ],\n [\n \"385eed34c1cdff21e6d0818689b81bde71a7f4f18397e6690a841e1599c43862\",\n \"283bebc3e8ea23f56701de19e9ebf4576b304eec2086dc8cc0458fe5542e5453\",\n ],\n [\n \"6f9d9b803ecf191637c73a4413dfa180fddf84a5947fbc9c606ed86c3fac3a7\",\n \"7c80c68e603059ba69b8e2a30e45c4d47ea4dd2f5c281002d86890603a842160\",\n ],\n [\n \"3322d401243c4e2582a2147c104d6ecbf774d163db0f5e5313b7e0e742d0e6bd\",\n \"56e70797e9664ef5bfb019bc4ddaf9b72805f63ea2873af624f3a2e96c28b2a0\",\n ],\n [\n \"85672c7d2de0b7da2bd1770d89665868741b3f9af7643397721d74d28134ab83\",\n \"7c481b9b5b43b2eb6374049bfa62c2e5e77f17fcc5298f44c8e3094f790313a6\",\n ],\n [\n \"948bf809b1988a46b06c9f1919413b10f9226c60f668832ffd959af60c82a0a\",\n \"53a562856dcb6646dc6b74c5d1c3418c6d4dff08c97cd2bed4cb7f88d8c8e589\",\n ],\n [\n \"6260ce7f461801c34f067ce0f02873a8f1b0e44dfc69752accecd819f38fd8e8\",\n \"bc2da82b6fa5b571a7f09049776a1ef7ecd292238051c198c1a84e95b2b4ae17\",\n ],\n [\n \"e5037de0afc1d8d43d8348414bbf4103043ec8f575bfdc432953cc8d2037fa2d\",\n \"4571534baa94d3b5f9f98d09fb990bddbd5f5b03ec481f10e0e5dc841d755bda\",\n ],\n [\n \"e06372b0f4a207adf5ea905e8f1771b4e7e8dbd1c6a6c5b725866a0ae4fce725\",\n \"7a908974bce18cfe12a27bb2ad5a488cd7484a7787104870b27034f94eee31dd\",\n ],\n [\n \"213c7a715cd5d45358d0bbf9dc0ce02204b10bdde2a3f58540ad6908d0559754\",\n \"4b6dad0b5ae462507013ad06245ba190bb4850f5f36a7eeddff2c27534b458f2\",\n ],\n [\n \"4e7c272a7af4b34e8dbb9352a5419a87e2838c70adc62cddf0cc3a3b08fbd53c\",\n \"17749c766c9d0b18e16fd09f6def681b530b9614bff7dd33e0b3941817dcaae6\",\n ],\n [\n \"fea74e3dbe778b1b10f238ad61686aa5c76e3db2be43057632427e2840fb27b6\",\n \"6e0568db9b0b13297cf674deccb6af93126b596b973f7b77701d3db7f23cb96f\",\n ],\n [\n \"76e64113f677cf0e10a2570d599968d31544e179b760432952c02a4417bdde39\",\n \"c90ddf8dee4e95cf577066d70681f0d35e2a33d2b56d2032b4b1752d1901ac01\",\n ],\n [\n \"c738c56b03b2abe1e8281baa743f8f9a8f7cc643df26cbee3ab150242bcbb891\",\n \"893fb578951ad2537f718f2eacbfbbbb82314eef7880cfe917e735d9699a84c3\",\n ],\n [\n \"d895626548b65b81e264c7637c972877d1d72e5f3a925014372e9f6588f6c14b\",\n \"febfaa38f2bc7eae728ec60818c340eb03428d632bb067e179363ed75d7d991f\",\n ],\n [\n \"b8da94032a957518eb0f6433571e8761ceffc73693e84edd49150a564f676e03\",\n \"2804dfa44805a1e4d7c99cc9762808b092cc584d95ff3b511488e4e74efdf6e7\",\n ],\n [\n \"e80fea14441fb33a7d8adab9475d7fab2019effb5156a792f1a11778e3c0df5d\",\n \"eed1de7f638e00771e89768ca3ca94472d155e80af322ea9fcb4291b6ac9ec78\",\n ],\n [\n \"a301697bdfcd704313ba48e51d567543f2a182031efd6915ddc07bbcc4e16070\",\n \"7370f91cfb67e4f5081809fa25d40f9b1735dbf7c0a11a130c0d1a041e177ea1\",\n ],\n [\n \"90ad85b389d6b936463f9d0512678de208cc330b11307fffab7ac63e3fb04ed4\",\n \"e507a3620a38261affdcbd9427222b839aefabe1582894d991d4d48cb6ef150\",\n ],\n [\n \"8f68b9d2f63b5f339239c1ad981f162ee88c5678723ea3351b7b444c9ec4c0da\",\n \"662a9f2dba063986de1d90c2b6be215dbbea2cfe95510bfdf23cbf79501fff82\",\n ],\n [\n \"e4f3fb0176af85d65ff99ff9198c36091f48e86503681e3e6686fd5053231e11\",\n \"1e63633ad0ef4f1c1661a6d0ea02b7286cc7e74ec951d1c9822c38576feb73bc\",\n ],\n [\n \"8c00fa9b18ebf331eb961537a45a4266c7034f2f0d4e1d0716fb6eae20eae29e\",\n \"efa47267fea521a1a9dc343a3736c974c2fadafa81e36c54e7d2a4c66702414b\",\n ],\n [\n \"e7a26ce69dd4829f3e10cec0a9e98ed3143d084f308b92c0997fddfc60cb3e41\",\n \"2a758e300fa7984b471b006a1aafbb18d0a6b2c0420e83e20e8a9421cf2cfd51\",\n ],\n [\n \"b6459e0ee3662ec8d23540c223bcbdc571cbcb967d79424f3cf29eb3de6b80ef\",\n \"67c876d06f3e06de1dadf16e5661db3c4b3ae6d48e35b2ff30bf0b61a71ba45\",\n ],\n [\n \"d68a80c8280bb840793234aa118f06231d6f1fc67e73c5a5deda0f5b496943e8\",\n \"db8ba9fff4b586d00c4b1f9177b0e28b5b0e7b8f7845295a294c84266b133120\",\n ],\n [\n \"324aed7df65c804252dc0270907a30b09612aeb973449cea4095980fc28d3d5d\",\n \"648a365774b61f2ff130c0c35aec1f4f19213b0c7e332843967224af96ab7c84\",\n ],\n [\n \"4df9c14919cde61f6d51dfdbe5fee5dceec4143ba8d1ca888e8bd373fd054c96\",\n \"35ec51092d8728050974c23a1d85d4b5d506cdc288490192ebac06cad10d5d\",\n ],\n [\n \"9c3919a84a474870faed8a9c1cc66021523489054d7f0308cbfc99c8ac1f98cd\",\n \"ddb84f0f4a4ddd57584f044bf260e641905326f76c64c8e6be7e5e03d4fc599d\",\n ],\n [\n \"6057170b1dd12fdf8de05f281d8e06bb91e1493a8b91d4cc5a21382120a959e5\",\n \"9a1af0b26a6a4807add9a2daf71df262465152bc3ee24c65e899be932385a2a8\",\n ],\n [\n \"a576df8e23a08411421439a4518da31880cef0fba7d4df12b1a6973eecb94266\",\n \"40a6bf20e76640b2c92b97afe58cd82c432e10a7f514d9f3ee8be11ae1b28ec8\",\n ],\n [\n \"7778a78c28dec3e30a05fe9629de8c38bb30d1f5cf9a3a208f763889be58ad71\",\n \"34626d9ab5a5b22ff7098e12f2ff580087b38411ff24ac563b513fc1fd9f43ac\",\n ],\n [\n \"928955ee637a84463729fd30e7afd2ed5f96274e5ad7e5cb09eda9c06d903ac\",\n \"c25621003d3f42a827b78a13093a95eeac3d26efa8a8d83fc5180e935bcd091f\",\n ],\n [\n \"85d0fef3ec6db109399064f3a0e3b2855645b4a907ad354527aae75163d82751\",\n \"1f03648413a38c0be29d496e582cf5663e8751e96877331582c237a24eb1f962\",\n ],\n [\n \"ff2b0dce97eece97c1c9b6041798b85dfdfb6d8882da20308f5404824526087e\",\n \"493d13fef524ba188af4c4dc54d07936c7b7ed6fb90e2ceb2c951e01f0c29907\",\n ],\n [\n \"827fbbe4b1e880ea9ed2b2e6301b212b57f1ee148cd6dd28780e5e2cf856e241\",\n \"c60f9c923c727b0b71bef2c67d1d12687ff7a63186903166d605b68baec293ec\",\n ],\n [\n \"eaa649f21f51bdbae7be4ae34ce6e5217a58fdce7f47f9aa7f3b58fa2120e2b3\",\n \"be3279ed5bbbb03ac69a80f89879aa5a01a6b965f13f7e59d47a5305ba5ad93d\",\n ],\n [\n \"e4a42d43c5cf169d9391df6decf42ee541b6d8f0c9a137401e23632dda34d24f\",\n \"4d9f92e716d1c73526fc99ccfb8ad34ce886eedfa8d8e4f13a7f7131deba9414\",\n ],\n [\n \"1ec80fef360cbdd954160fadab352b6b92b53576a88fea4947173b9d4300bf19\",\n \"aeefe93756b5340d2f3a4958a7abbf5e0146e77f6295a07b671cdc1cc107cefd\",\n ],\n [\n \"146a778c04670c2f91b00af4680dfa8bce3490717d58ba889ddb5928366642be\",\n \"b318e0ec3354028add669827f9d4b2870aaa971d2f7e5ed1d0b297483d83efd0\",\n ],\n [\n \"fa50c0f61d22e5f07e3acebb1aa07b128d0012209a28b9776d76a8793180eef9\",\n \"6b84c6922397eba9b72cd2872281a68a5e683293a57a213b38cd8d7d3f4f2811\",\n ],\n [\n \"da1d61d0ca721a11b1a5bf6b7d88e8421a288ab5d5bba5220e53d32b5f067ec2\",\n \"8157f55a7c99306c79c0766161c91e2966a73899d279b48a655fba0f1ad836f1\",\n ],\n [\n \"a8e282ff0c9706907215ff98e8fd416615311de0446f1e062a73b0610d064e13\",\n \"7f97355b8db81c09abfb7f3c5b2515888b679a3e50dd6bd6cef7c73111f4cc0c\",\n ],\n [\n \"174a53b9c9a285872d39e56e6913cab15d59b1fa512508c022f382de8319497c\",\n \"ccc9dc37abfc9c1657b4155f2c47f9e6646b3a1d8cb9854383da13ac079afa73\",\n ],\n [\n \"959396981943785c3d3e57edf5018cdbe039e730e4918b3d884fdff09475b7ba\",\n \"2e7e552888c331dd8ba0386a4b9cd6849c653f64c8709385e9b8abf87524f2fd\",\n ],\n [\n \"d2a63a50ae401e56d645a1153b109a8fcca0a43d561fba2dbb51340c9d82b151\",\n \"e82d86fb6443fcb7565aee58b2948220a70f750af484ca52d4142174dcf89405\",\n ],\n [\n \"64587e2335471eb890ee7896d7cfdc866bacbdbd3839317b3436f9b45617e073\",\n \"d99fcdd5bf6902e2ae96dd6447c299a185b90a39133aeab358299e5e9faf6589\",\n ],\n [\n \"8481bde0e4e4d885b3a546d3e549de042f0aa6cea250e7fd358d6c86dd45e458\",\n \"38ee7b8cba5404dd84a25bf39cecb2ca900a79c42b262e556d64b1b59779057e\",\n ],\n [\n \"13464a57a78102aa62b6979ae817f4637ffcfed3c4b1ce30bcd6303f6caf666b\",\n \"69be159004614580ef7e433453ccb0ca48f300a81d0942e13f495a907f6ecc27\",\n ],\n [\n \"bc4a9df5b713fe2e9aef430bcc1dc97a0cd9ccede2f28588cada3a0d2d83f366\",\n \"d3a81ca6e785c06383937adf4b798caa6e8a9fbfa547b16d758d666581f33c1\",\n ],\n [\n \"8c28a97bf8298bc0d23d8c749452a32e694b65e30a9472a3954ab30fe5324caa\",\n \"40a30463a3305193378fedf31f7cc0eb7ae784f0451cb9459e71dc73cbef9482\",\n ],\n [\n \"8ea9666139527a8c1dd94ce4f071fd23c8b350c5a4bb33748c4ba111faccae0\",\n \"620efabbc8ee2782e24e7c0cfb95c5d735b783be9cf0f8e955af34a30e62b945\",\n ],\n [\n \"dd3625faef5ba06074669716bbd3788d89bdde815959968092f76cc4eb9a9787\",\n \"7a188fa3520e30d461da2501045731ca941461982883395937f68d00c644a573\",\n ],\n [\n \"f710d79d9eb962297e4f6232b40e8f7feb2bc63814614d692c12de752408221e\",\n \"ea98e67232d3b3295d3b535532115ccac8612c721851617526ae47a9c77bfc82\",\n ],\n ],\n },\n naf: {\n wnd: 7,\n points: [\n [\n \"f9308a019258c31049344f85f89d5229b531c845836f99b08601f113bce036f9\",\n \"388f7b0f632de8140fe337e62a37f3566500a99934c2231b6cb9fd7584b8e672\",\n ],\n [\n \"2f8bde4d1a07209355b4a7250a5c5128e88b84bddc619ab7cba8d569b240efe4\",\n \"d8ac222636e5e3d6d4dba9dda6c9c426f788271bab0d6840dca87d3aa6ac62d6\",\n ],\n [\n \"5cbdf0646e5db4eaa398f365f2ea7a0e3d419b7e0330e39ce92bddedcac4f9bc\",\n \"6aebca40ba255960a3178d6d861a54dba813d0b813fde7b5a5082628087264da\",\n ],\n [\n \"acd484e2f0c7f65309ad178a9f559abde09796974c57e714c35f110dfc27ccbe\",\n \"cc338921b0a7d9fd64380971763b61e9add888a4375f8e0f05cc262ac64f9c37\",\n ],\n [\n \"774ae7f858a9411e5ef4246b70c65aac5649980be5c17891bbec17895da008cb\",\n \"d984a032eb6b5e190243dd56d7b7b365372db1e2dff9d6a8301d74c9c953c61b\",\n ],\n [\n \"f28773c2d975288bc7d1d205c3748651b075fbc6610e58cddeeddf8f19405aa8\",\n \"ab0902e8d880a89758212eb65cdaf473a1a06da521fa91f29b5cb52db03ed81\",\n ],\n [\n \"d7924d4f7d43ea965a465ae3095ff41131e5946f3c85f79e44adbcf8e27e080e\",\n \"581e2872a86c72a683842ec228cc6defea40af2bd896d3a5c504dc9ff6a26b58\",\n ],\n [\n \"defdea4cdb677750a420fee807eacf21eb9898ae79b9768766e4faa04a2d4a34\",\n \"4211ab0694635168e997b0ead2a93daeced1f4a04a95c0f6cfb199f69e56eb77\",\n ],\n [\n \"2b4ea0a797a443d293ef5cff444f4979f06acfebd7e86d277475656138385b6c\",\n \"85e89bc037945d93b343083b5a1c86131a01f60c50269763b570c854e5c09b7a\",\n ],\n [\n \"352bbf4a4cdd12564f93fa332ce333301d9ad40271f8107181340aef25be59d5\",\n \"321eb4075348f534d59c18259dda3e1f4a1b3b2e71b1039c67bd3d8bcf81998c\",\n ],\n [\n \"2fa2104d6b38d11b0230010559879124e42ab8dfeff5ff29dc9cdadd4ecacc3f\",\n \"2de1068295dd865b64569335bd5dd80181d70ecfc882648423ba76b532b7d67\",\n ],\n [\n \"9248279b09b4d68dab21a9b066edda83263c3d84e09572e269ca0cd7f5453714\",\n \"73016f7bf234aade5d1aa71bdea2b1ff3fc0de2a887912ffe54a32ce97cb3402\",\n ],\n [\n \"daed4f2be3a8bf278e70132fb0beb7522f570e144bf615c07e996d443dee8729\",\n \"a69dce4a7d6c98e8d4a1aca87ef8d7003f83c230f3afa726ab40e52290be1c55\",\n ],\n [\n \"c44d12c7065d812e8acf28d7cbb19f9011ecd9e9fdf281b0e6a3b5e87d22e7db\",\n \"2119a460ce326cdc76c45926c982fdac0e106e861edf61c5a039063f0e0e6482\",\n ],\n [\n \"6a245bf6dc698504c89a20cfded60853152b695336c28063b61c65cbd269e6b4\",\n \"e022cf42c2bd4a708b3f5126f16a24ad8b33ba48d0423b6efd5e6348100d8a82\",\n ],\n [\n \"1697ffa6fd9de627c077e3d2fe541084ce13300b0bec1146f95ae57f0d0bd6a5\",\n \"b9c398f186806f5d27561506e4557433a2cf15009e498ae7adee9d63d01b2396\",\n ],\n [\n \"605bdb019981718b986d0f07e834cb0d9deb8360ffb7f61df982345ef27a7479\",\n \"2972d2de4f8d20681a78d93ec96fe23c26bfae84fb14db43b01e1e9056b8c49\",\n ],\n [\n \"62d14dab4150bf497402fdc45a215e10dcb01c354959b10cfe31c7e9d87ff33d\",\n \"80fc06bd8cc5b01098088a1950eed0db01aa132967ab472235f5642483b25eaf\",\n ],\n [\n \"80c60ad0040f27dade5b4b06c408e56b2c50e9f56b9b8b425e555c2f86308b6f\",\n \"1c38303f1cc5c30f26e66bad7fe72f70a65eed4cbe7024eb1aa01f56430bd57a\",\n ],\n [\n \"7a9375ad6167ad54aa74c6348cc54d344cc5dc9487d847049d5eabb0fa03c8fb\",\n \"d0e3fa9eca8726909559e0d79269046bdc59ea10c70ce2b02d499ec224dc7f7\",\n ],\n [\n \"d528ecd9b696b54c907a9ed045447a79bb408ec39b68df504bb51f459bc3ffc9\",\n \"eecf41253136e5f99966f21881fd656ebc4345405c520dbc063465b521409933\",\n ],\n [\n \"49370a4b5f43412ea25f514e8ecdad05266115e4a7ecb1387231808f8b45963\",\n \"758f3f41afd6ed428b3081b0512fd62a54c3f3afbb5b6764b653052a12949c9a\",\n ],\n [\n \"77f230936ee88cbbd73df930d64702ef881d811e0e1498e2f1c13eb1fc345d74\",\n \"958ef42a7886b6400a08266e9ba1b37896c95330d97077cbbe8eb3c7671c60d6\",\n ],\n [\n \"f2dac991cc4ce4b9ea44887e5c7c0bce58c80074ab9d4dbaeb28531b7739f530\",\n \"e0dedc9b3b2f8dad4da1f32dec2531df9eb5fbeb0598e4fd1a117dba703a3c37\",\n ],\n [\n \"463b3d9f662621fb1b4be8fbbe2520125a216cdfc9dae3debcba4850c690d45b\",\n \"5ed430d78c296c3543114306dd8622d7c622e27c970a1de31cb377b01af7307e\",\n ],\n [\n \"f16f804244e46e2a09232d4aff3b59976b98fac14328a2d1a32496b49998f247\",\n \"cedabd9b82203f7e13d206fcdf4e33d92a6c53c26e5cce26d6579962c4e31df6\",\n ],\n [\n \"caf754272dc84563b0352b7a14311af55d245315ace27c65369e15f7151d41d1\",\n \"cb474660ef35f5f2a41b643fa5e460575f4fa9b7962232a5c32f908318a04476\",\n ],\n [\n \"2600ca4b282cb986f85d0f1709979d8b44a09c07cb86d7c124497bc86f082120\",\n \"4119b88753c15bd6a693b03fcddbb45d5ac6be74ab5f0ef44b0be9475a7e4b40\",\n ],\n [\n \"7635ca72d7e8432c338ec53cd12220bc01c48685e24f7dc8c602a7746998e435\",\n \"91b649609489d613d1d5e590f78e6d74ecfc061d57048bad9e76f302c5b9c61\",\n ],\n [\n \"754e3239f325570cdbbf4a87deee8a66b7f2b33479d468fbc1a50743bf56cc18\",\n \"673fb86e5bda30fb3cd0ed304ea49a023ee33d0197a695d0c5d98093c536683\",\n ],\n [\n \"e3e6bd1071a1e96aff57859c82d570f0330800661d1c952f9fe2694691d9b9e8\",\n \"59c9e0bba394e76f40c0aa58379a3cb6a5a2283993e90c4167002af4920e37f5\",\n ],\n [\n \"186b483d056a033826ae73d88f732985c4ccb1f32ba35f4b4cc47fdcf04aa6eb\",\n \"3b952d32c67cf77e2e17446e204180ab21fb8090895138b4a4a797f86e80888b\",\n ],\n [\n \"df9d70a6b9876ce544c98561f4be4f725442e6d2b737d9c91a8321724ce0963f\",\n \"55eb2dafd84d6ccd5f862b785dc39d4ab157222720ef9da217b8c45cf2ba2417\",\n ],\n [\n \"5edd5cc23c51e87a497ca815d5dce0f8ab52554f849ed8995de64c5f34ce7143\",\n \"efae9c8dbc14130661e8cec030c89ad0c13c66c0d17a2905cdc706ab7399a868\",\n ],\n [\n \"290798c2b6476830da12fe02287e9e777aa3fba1c355b17a722d362f84614fba\",\n \"e38da76dcd440621988d00bcf79af25d5b29c094db2a23146d003afd41943e7a\",\n ],\n [\n \"af3c423a95d9f5b3054754efa150ac39cd29552fe360257362dfdecef4053b45\",\n \"f98a3fd831eb2b749a93b0e6f35cfb40c8cd5aa667a15581bc2feded498fd9c6\",\n ],\n [\n \"766dbb24d134e745cccaa28c99bf274906bb66b26dcf98df8d2fed50d884249a\",\n \"744b1152eacbe5e38dcc887980da38b897584a65fa06cedd2c924f97cbac5996\",\n ],\n [\n \"59dbf46f8c94759ba21277c33784f41645f7b44f6c596a58ce92e666191abe3e\",\n \"c534ad44175fbc300f4ea6ce648309a042ce739a7919798cd85e216c4a307f6e\",\n ],\n [\n \"f13ada95103c4537305e691e74e9a4a8dd647e711a95e73cb62dc6018cfd87b8\",\n \"e13817b44ee14de663bf4bc808341f326949e21a6a75c2570778419bdaf5733d\",\n ],\n [\n \"7754b4fa0e8aced06d4167a2c59cca4cda1869c06ebadfb6488550015a88522c\",\n \"30e93e864e669d82224b967c3020b8fa8d1e4e350b6cbcc537a48b57841163a2\",\n ],\n [\n \"948dcadf5990e048aa3874d46abef9d701858f95de8041d2a6828c99e2262519\",\n \"e491a42537f6e597d5d28a3224b1bc25df9154efbd2ef1d2cbba2cae5347d57e\",\n ],\n [\n \"7962414450c76c1689c7b48f8202ec37fb224cf5ac0bfa1570328a8a3d7c77ab\",\n \"100b610ec4ffb4760d5c1fc133ef6f6b12507a051f04ac5760afa5b29db83437\",\n ],\n [\n \"3514087834964b54b15b160644d915485a16977225b8847bb0dd085137ec47ca\",\n \"ef0afbb2056205448e1652c48e8127fc6039e77c15c2378b7e7d15a0de293311\",\n ],\n [\n \"d3cc30ad6b483e4bc79ce2c9dd8bc54993e947eb8df787b442943d3f7b527eaf\",\n \"8b378a22d827278d89c5e9be8f9508ae3c2ad46290358630afb34db04eede0a4\",\n ],\n [\n \"1624d84780732860ce1c78fcbfefe08b2b29823db913f6493975ba0ff4847610\",\n \"68651cf9b6da903e0914448c6cd9d4ca896878f5282be4c8cc06e2a404078575\",\n ],\n [\n \"733ce80da955a8a26902c95633e62a985192474b5af207da6df7b4fd5fc61cd4\",\n \"f5435a2bd2badf7d485a4d8b8db9fcce3e1ef8e0201e4578c54673bc1dc5ea1d\",\n ],\n [\n \"15d9441254945064cf1a1c33bbd3b49f8966c5092171e699ef258dfab81c045c\",\n \"d56eb30b69463e7234f5137b73b84177434800bacebfc685fc37bbe9efe4070d\",\n ],\n [\n \"a1d0fcf2ec9de675b612136e5ce70d271c21417c9d2b8aaaac138599d0717940\",\n \"edd77f50bcb5a3cab2e90737309667f2641462a54070f3d519212d39c197a629\",\n ],\n [\n \"e22fbe15c0af8ccc5780c0735f84dbe9a790badee8245c06c7ca37331cb36980\",\n \"a855babad5cd60c88b430a69f53a1a7a38289154964799be43d06d77d31da06\",\n ],\n [\n \"311091dd9860e8e20ee13473c1155f5f69635e394704eaa74009452246cfa9b3\",\n \"66db656f87d1f04fffd1f04788c06830871ec5a64feee685bd80f0b1286d8374\",\n ],\n [\n \"34c1fd04d301be89b31c0442d3e6ac24883928b45a9340781867d4232ec2dbdf\",\n \"9414685e97b1b5954bd46f730174136d57f1ceeb487443dc5321857ba73abee\",\n ],\n [\n \"f219ea5d6b54701c1c14de5b557eb42a8d13f3abbcd08affcc2a5e6b049b8d63\",\n \"4cb95957e83d40b0f73af4544cccf6b1f4b08d3c07b27fb8d8c2962a400766d1\",\n ],\n [\n \"d7b8740f74a8fbaab1f683db8f45de26543a5490bca627087236912469a0b448\",\n \"fa77968128d9c92ee1010f337ad4717eff15db5ed3c049b3411e0315eaa4593b\",\n ],\n [\n \"32d31c222f8f6f0ef86f7c98d3a3335ead5bcd32abdd94289fe4d3091aa824bf\",\n \"5f3032f5892156e39ccd3d7915b9e1da2e6dac9e6f26e961118d14b8462e1661\",\n ],\n [\n \"7461f371914ab32671045a155d9831ea8793d77cd59592c4340f86cbc18347b5\",\n \"8ec0ba238b96bec0cbdddcae0aa442542eee1ff50c986ea6b39847b3cc092ff6\",\n ],\n [\n \"ee079adb1df1860074356a25aa38206a6d716b2c3e67453d287698bad7b2b2d6\",\n \"8dc2412aafe3be5c4c5f37e0ecc5f9f6a446989af04c4e25ebaac479ec1c8c1e\",\n ],\n [\n \"16ec93e447ec83f0467b18302ee620f7e65de331874c9dc72bfd8616ba9da6b5\",\n \"5e4631150e62fb40d0e8c2a7ca5804a39d58186a50e497139626778e25b0674d\",\n ],\n [\n \"eaa5f980c245f6f038978290afa70b6bd8855897f98b6aa485b96065d537bd99\",\n \"f65f5d3e292c2e0819a528391c994624d784869d7e6ea67fb18041024edc07dc\",\n ],\n [\n \"78c9407544ac132692ee1910a02439958ae04877151342ea96c4b6b35a49f51\",\n \"f3e0319169eb9b85d5404795539a5e68fa1fbd583c064d2462b675f194a3ddb4\",\n ],\n [\n \"494f4be219a1a77016dcd838431aea0001cdc8ae7a6fc688726578d9702857a5\",\n \"42242a969283a5f339ba7f075e36ba2af925ce30d767ed6e55f4b031880d562c\",\n ],\n [\n \"a598a8030da6d86c6bc7f2f5144ea549d28211ea58faa70ebf4c1e665c1fe9b5\",\n \"204b5d6f84822c307e4b4a7140737aec23fc63b65b35f86a10026dbd2d864e6b\",\n ],\n [\n \"c41916365abb2b5d09192f5f2dbeafec208f020f12570a184dbadc3e58595997\",\n \"4f14351d0087efa49d245b328984989d5caf9450f34bfc0ed16e96b58fa9913\",\n ],\n [\n \"841d6063a586fa475a724604da03bc5b92a2e0d2e0a36acfe4c73a5514742881\",\n \"73867f59c0659e81904f9a1c7543698e62562d6744c169ce7a36de01a8d6154\",\n ],\n [\n \"5e95bb399a6971d376026947f89bde2f282b33810928be4ded112ac4d70e20d5\",\n \"39f23f366809085beebfc71181313775a99c9aed7d8ba38b161384c746012865\",\n ],\n [\n \"36e4641a53948fd476c39f8a99fd974e5ec07564b5315d8bf99471bca0ef2f66\",\n \"d2424b1b1abe4eb8164227b085c9aa9456ea13493fd563e06fd51cf5694c78fc\",\n ],\n [\n \"336581ea7bfbbb290c191a2f507a41cf5643842170e914faeab27c2c579f726\",\n \"ead12168595fe1be99252129b6e56b3391f7ab1410cd1e0ef3dcdcabd2fda224\",\n ],\n [\n \"8ab89816dadfd6b6a1f2634fcf00ec8403781025ed6890c4849742706bd43ede\",\n \"6fdcef09f2f6d0a044e654aef624136f503d459c3e89845858a47a9129cdd24e\",\n ],\n [\n \"1e33f1a746c9c5778133344d9299fcaa20b0938e8acff2544bb40284b8c5fb94\",\n \"60660257dd11b3aa9c8ed618d24edff2306d320f1d03010e33a7d2057f3b3b6\",\n ],\n [\n \"85b7c1dcb3cec1b7ee7f30ded79dd20a0ed1f4cc18cbcfcfa410361fd8f08f31\",\n \"3d98a9cdd026dd43f39048f25a8847f4fcafad1895d7a633c6fed3c35e999511\",\n ],\n [\n \"29df9fbd8d9e46509275f4b125d6d45d7fbe9a3b878a7af872a2800661ac5f51\",\n \"b4c4fe99c775a606e2d8862179139ffda61dc861c019e55cd2876eb2a27d84b\",\n ],\n [\n \"a0b1cae06b0a847a3fea6e671aaf8adfdfe58ca2f768105c8082b2e449fce252\",\n \"ae434102edde0958ec4b19d917a6a28e6b72da1834aff0e650f049503a296cf2\",\n ],\n [\n \"4e8ceafb9b3e9a136dc7ff67e840295b499dfb3b2133e4ba113f2e4c0e121e5\",\n \"cf2174118c8b6d7a4b48f6d534ce5c79422c086a63460502b827ce62a326683c\",\n ],\n [\n \"d24a44e047e19b6f5afb81c7ca2f69080a5076689a010919f42725c2b789a33b\",\n \"6fb8d5591b466f8fc63db50f1c0f1c69013f996887b8244d2cdec417afea8fa3\",\n ],\n [\n \"ea01606a7a6c9cdd249fdfcfacb99584001edd28abbab77b5104e98e8e3b35d4\",\n \"322af4908c7312b0cfbfe369f7a7b3cdb7d4494bc2823700cfd652188a3ea98d\",\n ],\n [\n \"af8addbf2b661c8a6c6328655eb96651252007d8c5ea31be4ad196de8ce2131f\",\n \"6749e67c029b85f52a034eafd096836b2520818680e26ac8f3dfbcdb71749700\",\n ],\n [\n \"e3ae1974566ca06cc516d47e0fb165a674a3dabcfca15e722f0e3450f45889\",\n \"2aeabe7e4531510116217f07bf4d07300de97e4874f81f533420a72eeb0bd6a4\",\n ],\n [\n \"591ee355313d99721cf6993ffed1e3e301993ff3ed258802075ea8ced397e246\",\n \"b0ea558a113c30bea60fc4775460c7901ff0b053d25ca2bdeee98f1a4be5d196\",\n ],\n [\n \"11396d55fda54c49f19aa97318d8da61fa8584e47b084945077cf03255b52984\",\n \"998c74a8cd45ac01289d5833a7beb4744ff536b01b257be4c5767bea93ea57a4\",\n ],\n [\n \"3c5d2a1ba39c5a1790000738c9e0c40b8dcdfd5468754b6405540157e017aa7a\",\n \"b2284279995a34e2f9d4de7396fc18b80f9b8b9fdd270f6661f79ca4c81bd257\",\n ],\n [\n \"cc8704b8a60a0defa3a99a7299f2e9c3fbc395afb04ac078425ef8a1793cc030\",\n \"bdd46039feed17881d1e0862db347f8cf395b74fc4bcdc4e940b74e3ac1f1b13\",\n ],\n [\n \"c533e4f7ea8555aacd9777ac5cad29b97dd4defccc53ee7ea204119b2889b197\",\n \"6f0a256bc5efdf429a2fb6242f1a43a2d9b925bb4a4b3a26bb8e0f45eb596096\",\n ],\n [\n \"c14f8f2ccb27d6f109f6d08d03cc96a69ba8c34eec07bbcf566d48e33da6593\",\n \"c359d6923bb398f7fd4473e16fe1c28475b740dd098075e6c0e8649113dc3a38\",\n ],\n [\n \"a6cbc3046bc6a450bac24789fa17115a4c9739ed75f8f21ce441f72e0b90e6ef\",\n \"21ae7f4680e889bb130619e2c0f95a360ceb573c70603139862afd617fa9b9f\",\n ],\n [\n \"347d6d9a02c48927ebfb86c1359b1caf130a3c0267d11ce6344b39f99d43cc38\",\n \"60ea7f61a353524d1c987f6ecec92f086d565ab687870cb12689ff1e31c74448\",\n ],\n [\n \"da6545d2181db8d983f7dcb375ef5866d47c67b1bf31c8cf855ef7437b72656a\",\n \"49b96715ab6878a79e78f07ce5680c5d6673051b4935bd897fea824b77dc208a\",\n ],\n [\n \"c40747cc9d012cb1a13b8148309c6de7ec25d6945d657146b9d5994b8feb1111\",\n \"5ca560753be2a12fc6de6caf2cb489565db936156b9514e1bb5e83037e0fa2d4\",\n ],\n [\n \"4e42c8ec82c99798ccf3a610be870e78338c7f713348bd34c8203ef4037f3502\",\n \"7571d74ee5e0fb92a7a8b33a07783341a5492144cc54bcc40a94473693606437\",\n ],\n [\n \"3775ab7089bc6af823aba2e1af70b236d251cadb0c86743287522a1b3b0dedea\",\n \"be52d107bcfa09d8bcb9736a828cfa7fac8db17bf7a76a2c42ad961409018cf7\",\n ],\n [\n \"cee31cbf7e34ec379d94fb814d3d775ad954595d1314ba8846959e3e82f74e26\",\n \"8fd64a14c06b589c26b947ae2bcf6bfa0149ef0be14ed4d80f448a01c43b1c6d\",\n ],\n [\n \"b4f9eaea09b6917619f6ea6a4eb5464efddb58fd45b1ebefcdc1a01d08b47986\",\n \"39e5c9925b5a54b07433a4f18c61726f8bb131c012ca542eb24a8ac07200682a\",\n ],\n [\n \"d4263dfc3d2df923a0179a48966d30ce84e2515afc3dccc1b77907792ebcc60e\",\n \"62dfaf07a0f78feb30e30d6295853ce189e127760ad6cf7fae164e122a208d54\",\n ],\n [\n \"48457524820fa65a4f8d35eb6930857c0032acc0a4a2de422233eeda897612c4\",\n \"25a748ab367979d98733c38a1fa1c2e7dc6cc07db2d60a9ae7a76aaa49bd0f77\",\n ],\n [\n \"dfeeef1881101f2cb11644f3a2afdfc2045e19919152923f367a1767c11cceda\",\n \"ecfb7056cf1de042f9420bab396793c0c390bde74b4bbdff16a83ae09a9a7517\",\n ],\n [\n \"6d7ef6b17543f8373c573f44e1f389835d89bcbc6062ced36c82df83b8fae859\",\n \"cd450ec335438986dfefa10c57fea9bcc521a0959b2d80bbf74b190dca712d10\",\n ],\n [\n \"e75605d59102a5a2684500d3b991f2e3f3c88b93225547035af25af66e04541f\",\n \"f5c54754a8f71ee540b9b48728473e314f729ac5308b06938360990e2bfad125\",\n ],\n [\n \"eb98660f4c4dfaa06a2be453d5020bc99a0c2e60abe388457dd43fefb1ed620c\",\n \"6cb9a8876d9cb8520609af3add26cd20a0a7cd8a9411131ce85f44100099223e\",\n ],\n [\n \"13e87b027d8514d35939f2e6892b19922154596941888336dc3563e3b8dba942\",\n \"fef5a3c68059a6dec5d624114bf1e91aac2b9da568d6abeb2570d55646b8adf1\",\n ],\n [\n \"ee163026e9fd6fe017c38f06a5be6fc125424b371ce2708e7bf4491691e5764a\",\n \"1acb250f255dd61c43d94ccc670d0f58f49ae3fa15b96623e5430da0ad6c62b2\",\n ],\n [\n \"b268f5ef9ad51e4d78de3a750c2dc89b1e626d43505867999932e5db33af3d80\",\n \"5f310d4b3c99b9ebb19f77d41c1dee018cf0d34fd4191614003e945a1216e423\",\n ],\n [\n \"ff07f3118a9df035e9fad85eb6c7bfe42b02f01ca99ceea3bf7ffdba93c4750d\",\n \"438136d603e858a3a5c440c38eccbaddc1d2942114e2eddd4740d098ced1f0d8\",\n ],\n [\n \"8d8b9855c7c052a34146fd20ffb658bea4b9f69e0d825ebec16e8c3ce2b526a1\",\n \"cdb559eedc2d79f926baf44fb84ea4d44bcf50fee51d7ceb30e2e7f463036758\",\n ],\n [\n \"52db0b5384dfbf05bfa9d472d7ae26dfe4b851ceca91b1eba54263180da32b63\",\n \"c3b997d050ee5d423ebaf66a6db9f57b3180c902875679de924b69d84a7b375\",\n ],\n [\n \"e62f9490d3d51da6395efd24e80919cc7d0f29c3f3fa48c6fff543becbd43352\",\n \"6d89ad7ba4876b0b22c2ca280c682862f342c8591f1daf5170e07bfd9ccafa7d\",\n ],\n [\n \"7f30ea2476b399b4957509c88f77d0191afa2ff5cb7b14fd6d8e7d65aaab1193\",\n \"ca5ef7d4b231c94c3b15389a5f6311e9daff7bb67b103e9880ef4bff637acaec\",\n ],\n [\n \"5098ff1e1d9f14fb46a210fada6c903fef0fb7b4a1dd1d9ac60a0361800b7a00\",\n \"9731141d81fc8f8084d37c6e7542006b3ee1b40d60dfe5362a5b132fd17ddc0\",\n ],\n [\n \"32b78c7de9ee512a72895be6b9cbefa6e2f3c4ccce445c96b9f2c81e2778ad58\",\n \"ee1849f513df71e32efc3896ee28260c73bb80547ae2275ba497237794c8753c\",\n ],\n [\n \"e2cb74fddc8e9fbcd076eef2a7c72b0ce37d50f08269dfc074b581550547a4f7\",\n \"d3aa2ed71c9dd2247a62df062736eb0baddea9e36122d2be8641abcb005cc4a4\",\n ],\n [\n \"8438447566d4d7bedadc299496ab357426009a35f235cb141be0d99cd10ae3a8\",\n \"c4e1020916980a4da5d01ac5e6ad330734ef0d7906631c4f2390426b2edd791f\",\n ],\n [\n \"4162d488b89402039b584c6fc6c308870587d9c46f660b878ab65c82c711d67e\",\n \"67163e903236289f776f22c25fb8a3afc1732f2b84b4e95dbda47ae5a0852649\",\n ],\n [\n \"3fad3fa84caf0f34f0f89bfd2dcf54fc175d767aec3e50684f3ba4a4bf5f683d\",\n \"cd1bc7cb6cc407bb2f0ca647c718a730cf71872e7d0d2a53fa20efcdfe61826\",\n ],\n [\n \"674f2600a3007a00568c1a7ce05d0816c1fb84bf1370798f1c69532faeb1a86b\",\n \"299d21f9413f33b3edf43b257004580b70db57da0b182259e09eecc69e0d38a5\",\n ],\n [\n \"d32f4da54ade74abb81b815ad1fb3b263d82d6c692714bcff87d29bd5ee9f08f\",\n \"f9429e738b8e53b968e99016c059707782e14f4535359d582fc416910b3eea87\",\n ],\n [\n \"30e4e670435385556e593657135845d36fbb6931f72b08cb1ed954f1e3ce3ff6\",\n \"462f9bce619898638499350113bbc9b10a878d35da70740dc695a559eb88db7b\",\n ],\n [\n \"be2062003c51cc3004682904330e4dee7f3dcd10b01e580bf1971b04d4cad297\",\n \"62188bc49d61e5428573d48a74e1c655b1c61090905682a0d5558ed72dccb9bc\",\n ],\n [\n \"93144423ace3451ed29e0fb9ac2af211cb6e84a601df5993c419859fff5df04a\",\n \"7c10dfb164c3425f5c71a3f9d7992038f1065224f72bb9d1d902a6d13037b47c\",\n ],\n [\n \"b015f8044f5fcbdcf21ca26d6c34fb8197829205c7b7d2a7cb66418c157b112c\",\n \"ab8c1e086d04e813744a655b2df8d5f83b3cdc6faa3088c1d3aea1454e3a1d5f\",\n ],\n [\n \"d5e9e1da649d97d89e4868117a465a3a4f8a18de57a140d36b3f2af341a21b52\",\n \"4cb04437f391ed73111a13cc1d4dd0db1693465c2240480d8955e8592f27447a\",\n ],\n [\n \"d3ae41047dd7ca065dbf8ed77b992439983005cd72e16d6f996a5316d36966bb\",\n \"bd1aeb21ad22ebb22a10f0303417c6d964f8cdd7df0aca614b10dc14d125ac46\",\n ],\n [\n \"463e2763d885f958fc66cdd22800f0a487197d0a82e377b49f80af87c897b065\",\n \"bfefacdb0e5d0fd7df3a311a94de062b26b80c61fbc97508b79992671ef7ca7f\",\n ],\n [\n \"7985fdfd127c0567c6f53ec1bb63ec3158e597c40bfe747c83cddfc910641917\",\n \"603c12daf3d9862ef2b25fe1de289aed24ed291e0ec6708703a5bd567f32ed03\",\n ],\n [\n \"74a1ad6b5f76e39db2dd249410eac7f99e74c59cb83d2d0ed5ff1543da7703e9\",\n \"cc6157ef18c9c63cd6193d83631bbea0093e0968942e8c33d5737fd790e0db08\",\n ],\n [\n \"30682a50703375f602d416664ba19b7fc9bab42c72747463a71d0896b22f6da3\",\n \"553e04f6b018b4fa6c8f39e7f311d3176290d0e0f19ca73f17714d9977a22ff8\",\n ],\n [\n \"9e2158f0d7c0d5f26c3791efefa79597654e7a2b2464f52b1ee6c1347769ef57\",\n \"712fcdd1b9053f09003a3481fa7762e9ffd7c8ef35a38509e2fbf2629008373\",\n ],\n [\n \"176e26989a43c9cfeba4029c202538c28172e566e3c4fce7322857f3be327d66\",\n \"ed8cc9d04b29eb877d270b4878dc43c19aefd31f4eee09ee7b47834c1fa4b1c3\",\n ],\n [\n \"75d46efea3771e6e68abb89a13ad747ecf1892393dfc4f1b7004788c50374da8\",\n \"9852390a99507679fd0b86fd2b39a868d7efc22151346e1a3ca4726586a6bed8\",\n ],\n [\n \"809a20c67d64900ffb698c4c825f6d5f2310fb0451c869345b7319f645605721\",\n \"9e994980d9917e22b76b061927fa04143d096ccc54963e6a5ebfa5f3f8e286c1\",\n ],\n [\n \"1b38903a43f7f114ed4500b4eac7083fdefece1cf29c63528d563446f972c180\",\n \"4036edc931a60ae889353f77fd53de4a2708b26b6f5da72ad3394119daf408f9\",\n ],\n ],\n },\n };\n },\n});\n\n// node_modules/elliptic/lib/elliptic/curves.js\nvar require_curves = __commonJS({\n \"node_modules/elliptic/lib/elliptic/curves.js\"(exports) {\n \"use strict\";\n var curves = exports,\n hash = require_hash2(),\n curve = require_curve(),\n utils = require_utils3(),\n assert = utils.assert;\n function PresetCurve(options) {\n options.type === \"short\"\n ? (this.curve = new curve.short(options))\n : options.type === \"edwards\"\n ? (this.curve = new curve.edwards(options))\n : (this.curve = new curve.mont(options)),\n (this.g = this.curve.g),\n (this.n = this.curve.n),\n (this.hash = options.hash),\n assert(this.g.validate(), \"Invalid curve\"),\n assert(this.g.mul(this.n).isInfinity(), \"Invalid curve, G*N != O\");\n }\n curves.PresetCurve = PresetCurve;\n function defineCurve(name, options) {\n Object.defineProperty(curves, name, {\n configurable: !0,\n enumerable: !0,\n get: function () {\n var curve2 = new PresetCurve(options);\n return (\n Object.defineProperty(curves, name, {\n configurable: !0,\n enumerable: !0,\n value: curve2,\n }),\n curve2\n );\n },\n });\n }\n defineCurve(\"p192\", {\n type: \"short\",\n prime: \"p192\",\n p: \"ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff\",\n a: \"ffffffff ffffffff ffffffff fffffffe ffffffff fffffffc\",\n b: \"64210519 e59c80e7 0fa7e9ab 72243049 feb8deec c146b9b1\",\n n: \"ffffffff ffffffff ffffffff 99def836 146bc9b1 b4d22831\",\n hash: hash.sha256,\n gRed: !1,\n g: [\n \"188da80e b03090f6 7cbf20eb 43a18800 f4ff0afd 82ff1012\",\n \"07192b95 ffc8da78 631011ed 6b24cdd5 73f977a1 1e794811\",\n ],\n });\n defineCurve(\"p224\", {\n type: \"short\",\n prime: \"p224\",\n p: \"ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001\",\n a: \"ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff fffffffe\",\n b: \"b4050a85 0c04b3ab f5413256 5044b0b7 d7bfd8ba 270b3943 2355ffb4\",\n n: \"ffffffff ffffffff ffffffff ffff16a2 e0b8f03e 13dd2945 5c5c2a3d\",\n hash: hash.sha256,\n gRed: !1,\n g: [\n \"b70e0cbd 6bb4bf7f 321390b9 4a03c1d3 56c21122 343280d6 115c1d21\",\n \"bd376388 b5f723fb 4c22dfe6 cd4375a0 5a074764 44d58199 85007e34\",\n ],\n });\n defineCurve(\"p256\", {\n type: \"short\",\n prime: null,\n p: \"ffffffff 00000001 00000000 00000000 00000000 ffffffff ffffffff ffffffff\",\n a: \"ffffffff 00000001 00000000 00000000 00000000 ffffffff ffffffff fffffffc\",\n b: \"5ac635d8 aa3a93e7 b3ebbd55 769886bc 651d06b0 cc53b0f6 3bce3c3e 27d2604b\",\n n: \"ffffffff 00000000 ffffffff ffffffff bce6faad a7179e84 f3b9cac2 fc632551\",\n hash: hash.sha256,\n gRed: !1,\n g: [\n \"6b17d1f2 e12c4247 f8bce6e5 63a440f2 77037d81 2deb33a0 f4a13945 d898c296\",\n \"4fe342e2 fe1a7f9b 8ee7eb4a 7c0f9e16 2bce3357 6b315ece cbb64068 37bf51f5\",\n ],\n });\n defineCurve(\"p384\", {\n type: \"short\",\n prime: null,\n p: \"ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe ffffffff 00000000 00000000 ffffffff\",\n a: \"ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe ffffffff 00000000 00000000 fffffffc\",\n b: \"b3312fa7 e23ee7e4 988e056b e3f82d19 181d9c6e fe814112 0314088f 5013875a c656398d 8a2ed19d 2a85c8ed d3ec2aef\",\n n: \"ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff c7634d81 f4372ddf 581a0db2 48b0a77a ecec196a ccc52973\",\n hash: hash.sha384,\n gRed: !1,\n g: [\n \"aa87ca22 be8b0537 8eb1c71e f320ad74 6e1d3b62 8ba79b98 59f741e0 82542a38 5502f25d bf55296c 3a545e38 72760ab7\",\n \"3617de4a 96262c6f 5d9e98bf 9292dc29 f8f41dbd 289a147c e9da3113 b5f0b8c0 0a60b1ce 1d7e819d 7a431d7c 90ea0e5f\",\n ],\n });\n defineCurve(\"p521\", {\n type: \"short\",\n prime: null,\n p: \"000001ff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff\",\n a: \"000001ff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffc\",\n b: \"00000051 953eb961 8e1c9a1f 929a21a0 b68540ee a2da725b 99b315f3 b8b48991 8ef109e1 56193951 ec7e937b 1652c0bd 3bb1bf07 3573df88 3d2c34f1 ef451fd4 6b503f00\",\n n: \"000001ff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffa 51868783 bf2f966b 7fcc0148 f709a5d0 3bb5c9b8 899c47ae bb6fb71e 91386409\",\n hash: hash.sha512,\n gRed: !1,\n g: [\n \"000000c6 858e06b7 0404e9cd 9e3ecb66 2395b442 9c648139 053fb521 f828af60 6b4d3dba a14b5e77 efe75928 fe1dc127 a2ffa8de 3348b3c1 856a429b f97e7e31 c2e5bd66\",\n \"00000118 39296a78 9a3bc004 5c8a5fb4 2c7d1bd9 98f54449 579b4468 17afbd17 273e662c 97ee7299 5ef42640 c550b901 3fad0761 353c7086 a272c240 88be9476 9fd16650\",\n ],\n });\n defineCurve(\"curve25519\", {\n type: \"mont\",\n prime: \"p25519\",\n p: \"7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed\",\n a: \"76d06\",\n b: \"1\",\n n: \"1000000000000000 0000000000000000 14def9dea2f79cd6 5812631a5cf5d3ed\",\n hash: hash.sha256,\n gRed: !1,\n g: [\"9\"],\n });\n defineCurve(\"ed25519\", {\n type: \"edwards\",\n prime: \"p25519\",\n p: \"7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed\",\n a: \"-1\",\n c: \"1\",\n d: \"52036cee2b6ffe73 8cc740797779e898 00700a4d4141d8ab 75eb4dca135978a3\",\n n: \"1000000000000000 0000000000000000 14def9dea2f79cd6 5812631a5cf5d3ed\",\n hash: hash.sha256,\n gRed: !1,\n g: [\n \"216936d3cd6e53fec0a4e231fdd6dc5c692cc7609525a7b2c9562d608f25d51a\",\n \"6666666666666666666666666666666666666666666666666666666666666658\",\n ],\n });\n var pre;\n try {\n pre = require_secp256k1();\n } catch {\n pre = void 0;\n }\n defineCurve(\"secp256k1\", {\n type: \"short\",\n prime: \"k256\",\n p: \"ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f\",\n a: \"0\",\n b: \"7\",\n n: \"ffffffff ffffffff ffffffff fffffffe baaedce6 af48a03b bfd25e8c d0364141\",\n h: \"1\",\n hash: hash.sha256,\n beta: \"7ae96a2b657c07106e64479eac3434e99cf0497512f58995c1396c28719501ee\",\n lambda: \"5363ad4cc05c30e0a5261c028812645a122e22ea20816678df02967c1b23bd72\",\n basis: [\n {\n a: \"3086d221a7d46bcde86c90e49284eb15\",\n b: \"-e4437ed6010e88286f547fa90abfe4c3\",\n },\n {\n a: \"114ca50f7a8e2f3f657c1108d9d44cfd8\",\n b: \"3086d221a7d46bcde86c90e49284eb15\",\n },\n ],\n gRed: !1,\n g: [\n \"79be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798\",\n \"483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8\",\n pre,\n ],\n });\n },\n});\n\n// node_modules/hmac-drbg/lib/hmac-drbg.js\nvar require_hmac_drbg = __commonJS({\n \"node_modules/hmac-drbg/lib/hmac-drbg.js\"(exports, module) {\n \"use strict\";\n var hash = require_hash2(),\n utils = require_utils2(),\n assert = require_minimalistic_assert();\n function HmacDRBG(options) {\n if (!(this instanceof HmacDRBG)) return new HmacDRBG(options);\n (this.hash = options.hash),\n (this.predResist = !!options.predResist),\n (this.outLen = this.hash.outSize),\n (this.minEntropy = options.minEntropy || this.hash.hmacStrength),\n (this._reseed = null),\n (this.reseedInterval = null),\n (this.K = null),\n (this.V = null);\n var entropy = utils.toArray(options.entropy, options.entropyEnc || \"hex\"),\n nonce = utils.toArray(options.nonce, options.nonceEnc || \"hex\"),\n pers = utils.toArray(options.pers, options.persEnc || \"hex\");\n assert(entropy.length >= this.minEntropy / 8, \"Not enough entropy. Minimum is: \" + this.minEntropy + \" bits\"),\n this._init(entropy, nonce, pers);\n }\n module.exports = HmacDRBG;\n HmacDRBG.prototype._init = function (entropy, nonce, pers) {\n var seed = entropy.concat(nonce).concat(pers);\n (this.K = new Array(this.outLen / 8)), (this.V = new Array(this.outLen / 8));\n for (var i = 0; i < this.V.length; i++) (this.K[i] = 0), (this.V[i] = 1);\n this._update(seed), (this._reseed = 1), (this.reseedInterval = 281474976710656);\n };\n HmacDRBG.prototype._hmac = function () {\n return new hash.hmac(this.hash, this.K);\n };\n HmacDRBG.prototype._update = function (seed) {\n var kmac = this._hmac().update(this.V).update([0]);\n seed && (kmac = kmac.update(seed)),\n (this.K = kmac.digest()),\n (this.V = this._hmac().update(this.V).digest()),\n seed &&\n ((this.K = this._hmac().update(this.V).update([1]).update(seed).digest()),\n (this.V = this._hmac().update(this.V).digest()));\n };\n HmacDRBG.prototype.reseed = function (entropy, entropyEnc, add, addEnc) {\n typeof entropyEnc != \"string\" && ((addEnc = add), (add = entropyEnc), (entropyEnc = null)),\n (entropy = utils.toArray(entropy, entropyEnc)),\n (add = utils.toArray(add, addEnc)),\n assert(entropy.length >= this.minEntropy / 8, \"Not enough entropy. Minimum is: \" + this.minEntropy + \" bits\"),\n this._update(entropy.concat(add || [])),\n (this._reseed = 1);\n };\n HmacDRBG.prototype.generate = function (len, enc, add, addEnc) {\n if (this._reseed > this.reseedInterval) throw new Error(\"Reseed is required\");\n typeof enc != \"string\" && ((addEnc = add), (add = enc), (enc = null)),\n add && ((add = utils.toArray(add, addEnc || \"hex\")), this._update(add));\n for (var temp = []; temp.length < len; )\n (this.V = this._hmac().update(this.V).digest()), (temp = temp.concat(this.V));\n var res = temp.slice(0, len);\n return this._update(add), this._reseed++, utils.encode(res, enc);\n };\n },\n});\n\n// node_modules/elliptic/lib/elliptic/ec/key.js\nvar require_key = __commonJS({\n \"node_modules/elliptic/lib/elliptic/ec/key.js\"(exports, module) {\n \"use strict\";\n var BN = require_bn4(),\n utils = require_utils3(),\n assert = utils.assert;\n function KeyPair(ec, options) {\n (this.ec = ec),\n (this.priv = null),\n (this.pub = null),\n options.priv && this._importPrivate(options.priv, options.privEnc),\n options.pub && this._importPublic(options.pub, options.pubEnc);\n }\n module.exports = KeyPair;\n KeyPair.fromPublic = function (ec, pub, enc) {\n return pub instanceof KeyPair\n ? pub\n : new KeyPair(ec, {\n pub,\n pubEnc: enc,\n });\n };\n KeyPair.fromPrivate = function (ec, priv, enc) {\n return priv instanceof KeyPair\n ? priv\n : new KeyPair(ec, {\n priv,\n privEnc: enc,\n });\n };\n KeyPair.prototype.validate = function () {\n var pub = this.getPublic();\n return pub.isInfinity()\n ? { result: !1, reason: \"Invalid public key\" }\n : pub.validate()\n ? pub.mul(this.ec.curve.n).isInfinity()\n ? { result: !0, reason: null }\n : { result: !1, reason: \"Public key * N != O\" }\n : { result: !1, reason: \"Public key is not a point\" };\n };\n KeyPair.prototype.getPublic = function (compact, enc) {\n return (\n typeof compact == \"string\" && ((enc = compact), (compact = null)),\n this.pub || (this.pub = this.ec.g.mul(this.priv)),\n enc ? this.pub.encode(enc, compact) : this.pub\n );\n };\n KeyPair.prototype.getPrivate = function (enc) {\n return enc === \"hex\" ? this.priv.toString(16, 2) : this.priv;\n };\n KeyPair.prototype._importPrivate = function (key, enc) {\n (this.priv = new BN(key, enc || 16)), (this.priv = this.priv.umod(this.ec.curve.n));\n };\n KeyPair.prototype._importPublic = function (key, enc) {\n if (key.x || key.y) {\n this.ec.curve.type === \"mont\"\n ? assert(key.x, \"Need x coordinate\")\n : (this.ec.curve.type === \"short\" || this.ec.curve.type === \"edwards\") &&\n assert(key.x && key.y, \"Need both x and y coordinate\"),\n (this.pub = this.ec.curve.point(key.x, key.y));\n return;\n }\n this.pub = this.ec.curve.decodePoint(key, enc);\n };\n KeyPair.prototype.derive = function (pub) {\n return pub.validate() || assert(pub.validate(), \"public point not validated\"), pub.mul(this.priv).getX();\n };\n KeyPair.prototype.sign = function (msg, enc, options) {\n return this.ec.sign(msg, this, enc, options);\n };\n KeyPair.prototype.verify = function (msg, signature) {\n return this.ec.verify(msg, signature, this);\n };\n KeyPair.prototype.inspect = function () {\n return (\n \"<Key priv: \" + (this.priv && this.priv.toString(16, 2)) + \" pub: \" + (this.pub && this.pub.inspect()) + \" >\"\n );\n };\n },\n});\n\n// node_modules/elliptic/lib/elliptic/ec/signature.js\nvar require_signature = __commonJS({\n \"node_modules/elliptic/lib/elliptic/ec/signature.js\"(exports, module) {\n \"use strict\";\n var BN = require_bn4(),\n utils = require_utils3(),\n assert = utils.assert;\n function Signature(options, enc) {\n if (options instanceof Signature) return options;\n this._importDER(options, enc) ||\n (assert(options.r && options.s, \"Signature without r or s\"),\n (this.r = new BN(options.r, 16)),\n (this.s = new BN(options.s, 16)),\n options.recoveryParam === void 0 ? (this.recoveryParam = null) : (this.recoveryParam = options.recoveryParam));\n }\n module.exports = Signature;\n function Position() {\n this.place = 0;\n }\n function getLength(buf, p) {\n var initial = buf[p.place++];\n if (!(initial & 128)) return initial;\n var octetLen = initial & 15;\n if (octetLen === 0 || octetLen > 4) return !1;\n for (var val = 0, i = 0, off = p.place; i < octetLen; i++, off++) (val <<= 8), (val |= buf[off]), (val >>>= 0);\n return val <= 127 ? !1 : ((p.place = off), val);\n }\n function rmPadding(buf) {\n for (var i = 0, len = buf.length - 1; !buf[i] && !(buf[i + 1] & 128) && i < len; ) i++;\n return i === 0 ? buf : buf.slice(i);\n }\n Signature.prototype._importDER = function (data, enc) {\n data = utils.toArray(data, enc);\n var p = new Position();\n if (data[p.place++] !== 48) return !1;\n var len = getLength(data, p);\n if (len === !1 || len + p.place !== data.length || data[p.place++] !== 2) return !1;\n var rlen = getLength(data, p);\n if (rlen === !1) return !1;\n var r = data.slice(p.place, rlen + p.place);\n if (((p.place += rlen), data[p.place++] !== 2)) return !1;\n var slen = getLength(data, p);\n if (slen === !1 || data.length !== slen + p.place) return !1;\n var s = data.slice(p.place, slen + p.place);\n if (r[0] === 0)\n if (r[1] & 128) r = r.slice(1);\n else return !1;\n if (s[0] === 0)\n if (s[1] & 128) s = s.slice(1);\n else return !1;\n return (this.r = new BN(r)), (this.s = new BN(s)), (this.recoveryParam = null), !0;\n };\n function constructLength(arr, len) {\n if (len < 128) {\n arr.push(len);\n return;\n }\n var octets = 1 + ((Math.log(len) / Math.LN2) >>> 3);\n for (arr.push(octets | 128); --octets; ) arr.push((len >>> (octets << 3)) & 255);\n arr.push(len);\n }\n Signature.prototype.toDER = function (enc) {\n var r = this.r.toArray(),\n s = this.s.toArray();\n for (\n r[0] & 128 && (r = [0].concat(r)), s[0] & 128 && (s = [0].concat(s)), r = rmPadding(r), s = rmPadding(s);\n !s[0] && !(s[1] & 128);\n\n )\n s = s.slice(1);\n var arr = [2];\n constructLength(arr, r.length), (arr = arr.concat(r)), arr.push(2), constructLength(arr, s.length);\n var backHalf = arr.concat(s),\n res = [48];\n return constructLength(res, backHalf.length), (res = res.concat(backHalf)), utils.encode(res, enc);\n };\n },\n});\n\n// node_modules/elliptic/lib/elliptic/ec/index.js\nvar require_ec = __commonJS({\n \"node_modules/elliptic/lib/elliptic/ec/index.js\"(exports, module) {\n \"use strict\";\n var BN = require_bn4(),\n HmacDRBG = require_hmac_drbg(),\n utils = require_utils3(),\n curves = require_curves(),\n rand = require_brorand(),\n assert = utils.assert,\n KeyPair = require_key(),\n Signature = require_signature();\n function EC(options) {\n if (!(this instanceof EC)) return new EC(options);\n typeof options == \"string\" &&\n (assert(Object.prototype.hasOwnProperty.call(curves, options), \"Unknown curve \" + options),\n (options = curves[options])),\n options instanceof curves.PresetCurve && (options = { curve: options }),\n (this.curve = options.curve.curve),\n (this.n = this.curve.n),\n (this.nh = this.n.ushrn(1)),\n (this.g = this.curve.g),\n (this.g = options.curve.g),\n this.g.precompute(options.curve.n.bitLength() + 1),\n (this.hash = options.hash || options.curve.hash);\n }\n module.exports = EC;\n EC.prototype.keyPair = function (options) {\n return new KeyPair(this, options);\n };\n EC.prototype.keyFromPrivate = function (priv, enc) {\n return KeyPair.fromPrivate(this, priv, enc);\n };\n EC.prototype.keyFromPublic = function (pub, enc) {\n return KeyPair.fromPublic(this, pub, enc);\n };\n EC.prototype.genKeyPair = function (options) {\n options || (options = {});\n for (\n var drbg = new HmacDRBG({\n hash: this.hash,\n pers: options.pers,\n persEnc: options.persEnc || \"utf8\",\n entropy: options.entropy || rand(this.hash.hmacStrength),\n entropyEnc: (options.entropy && options.entropyEnc) || \"utf8\",\n nonce: this.n.toArray(),\n }),\n bytes = this.n.byteLength(),\n ns2 = this.n.sub(new BN(2));\n ;\n\n ) {\n var priv = new BN(drbg.generate(bytes));\n if (!(priv.cmp(ns2) > 0)) return priv.iaddn(1), this.keyFromPrivate(priv);\n }\n };\n EC.prototype._truncateToN = function (msg, truncOnly) {\n var delta = msg.byteLength() * 8 - this.n.bitLength();\n return delta > 0 && (msg = msg.ushrn(delta)), !truncOnly && msg.cmp(this.n) >= 0 ? msg.sub(this.n) : msg;\n };\n EC.prototype.sign = function (msg, key, enc, options) {\n typeof enc == \"object\" && ((options = enc), (enc = null)),\n options || (options = {}),\n (key = this.keyFromPrivate(key, enc)),\n (msg = this._truncateToN(new BN(msg, 16)));\n for (\n var bytes = this.n.byteLength(),\n bkey = key.getPrivate().toArray(\"be\", bytes),\n nonce = msg.toArray(\"be\", bytes),\n drbg = new HmacDRBG({\n hash: this.hash,\n entropy: bkey,\n nonce,\n pers: options.pers,\n persEnc: options.persEnc || \"utf8\",\n }),\n ns1 = this.n.sub(new BN(1)),\n iter = 0;\n ;\n iter++\n ) {\n var k = options.k ? options.k(iter) : new BN(drbg.generate(this.n.byteLength()));\n if (((k = this._truncateToN(k, !0)), !(k.cmpn(1) <= 0 || k.cmp(ns1) >= 0))) {\n var kp = this.g.mul(k);\n if (!kp.isInfinity()) {\n var kpX = kp.getX(),\n r = kpX.umod(this.n);\n if (r.cmpn(0) !== 0) {\n var s = k.invm(this.n).mul(r.mul(key.getPrivate()).iadd(msg));\n if (((s = s.umod(this.n)), s.cmpn(0) !== 0)) {\n var recoveryParam = (kp.getY().isOdd() ? 1 : 0) | (kpX.cmp(r) !== 0 ? 2 : 0);\n return (\n options.canonical && s.cmp(this.nh) > 0 && ((s = this.n.sub(s)), (recoveryParam ^= 1)),\n new Signature({ r, s, recoveryParam })\n );\n }\n }\n }\n }\n }\n };\n EC.prototype.verify = function (msg, signature, key, enc) {\n (msg = this._truncateToN(new BN(msg, 16))),\n (key = this.keyFromPublic(key, enc)),\n (signature = new Signature(signature, \"hex\"));\n var r = signature.r,\n s = signature.s;\n if (r.cmpn(1) < 0 || r.cmp(this.n) >= 0 || s.cmpn(1) < 0 || s.cmp(this.n) >= 0) return !1;\n var sinv = s.invm(this.n),\n u1 = sinv.mul(msg).umod(this.n),\n u2 = sinv.mul(r).umod(this.n),\n p;\n return this.curve._maxwellTrick\n ? ((p = this.g.jmulAdd(u1, key.getPublic(), u2)), p.isInfinity() ? !1 : p.eqXToP(r))\n : ((p = this.g.mulAdd(u1, key.getPublic(), u2)), p.isInfinity() ? !1 : p.getX().umod(this.n).cmp(r) === 0);\n };\n EC.prototype.recoverPubKey = function (msg, signature, j, enc) {\n assert((3 & j) === j, \"The recovery param is more than two bits\"), (signature = new Signature(signature, enc));\n var n = this.n,\n e = new BN(msg),\n r = signature.r,\n s = signature.s,\n isYOdd = j & 1,\n isSecondKey = j >> 1;\n if (r.cmp(this.curve.p.umod(this.curve.n)) >= 0 && isSecondKey)\n throw new Error(\"Unable to find sencond key candinate\");\n isSecondKey ? (r = this.curve.pointFromX(r.add(this.curve.n), isYOdd)) : (r = this.curve.pointFromX(r, isYOdd));\n var rInv = signature.r.invm(n),\n s1 = n.sub(e).mul(rInv).umod(n),\n s2 = s.mul(rInv).umod(n);\n return this.g.mulAdd(s1, r, s2);\n };\n EC.prototype.getKeyRecoveryParam = function (e, signature, Q, enc) {\n if (((signature = new Signature(signature, enc)), signature.recoveryParam !== null))\n return signature.recoveryParam;\n for (var i = 0; i < 4; i++) {\n var Qprime;\n try {\n Qprime = this.recoverPubKey(e, signature, i);\n } catch {\n continue;\n }\n if (Qprime.eq(Q)) return i;\n }\n throw new Error(\"Unable to find valid recovery factor\");\n };\n },\n});\n\n// node_modules/elliptic/lib/elliptic/eddsa/key.js\nvar require_key2 = __commonJS({\n \"node_modules/elliptic/lib/elliptic/eddsa/key.js\"(exports, module) {\n \"use strict\";\n var utils = require_utils3(),\n assert = utils.assert,\n parseBytes = utils.parseBytes,\n cachedProperty = utils.cachedProperty;\n function KeyPair(eddsa, params) {\n (this.eddsa = eddsa),\n (this._secret = parseBytes(params.secret)),\n eddsa.isPoint(params.pub) ? (this._pub = params.pub) : (this._pubBytes = parseBytes(params.pub));\n }\n KeyPair.fromPublic = function (eddsa, pub) {\n return pub instanceof KeyPair ? pub : new KeyPair(eddsa, { pub });\n };\n KeyPair.fromSecret = function (eddsa, secret) {\n return secret instanceof KeyPair ? secret : new KeyPair(eddsa, { secret });\n };\n KeyPair.prototype.secret = function () {\n return this._secret;\n };\n cachedProperty(KeyPair, \"pubBytes\", function () {\n return this.eddsa.encodePoint(this.pub());\n });\n cachedProperty(KeyPair, \"pub\", function () {\n return this._pubBytes ? this.eddsa.decodePoint(this._pubBytes) : this.eddsa.g.mul(this.priv());\n });\n cachedProperty(KeyPair, \"privBytes\", function () {\n var eddsa = this.eddsa,\n hash = this.hash(),\n lastIx = eddsa.encodingLength - 1,\n a = hash.slice(0, eddsa.encodingLength);\n return (a[0] &= 248), (a[lastIx] &= 127), (a[lastIx] |= 64), a;\n });\n cachedProperty(KeyPair, \"priv\", function () {\n return this.eddsa.decodeInt(this.privBytes());\n });\n cachedProperty(KeyPair, \"hash\", function () {\n return this.eddsa.hash().update(this.secret()).digest();\n });\n cachedProperty(KeyPair, \"messagePrefix\", function () {\n return this.hash().slice(this.eddsa.encodingLength);\n });\n KeyPair.prototype.sign = function (message) {\n return assert(this._secret, \"KeyPair can only verify\"), this.eddsa.sign(message, this);\n };\n KeyPair.prototype.verify = function (message, sig) {\n return this.eddsa.verify(message, sig, this);\n };\n KeyPair.prototype.getSecret = function (enc) {\n return assert(this._secret, \"KeyPair is public only\"), utils.encode(this.secret(), enc);\n };\n KeyPair.prototype.getPublic = function (enc) {\n return utils.encode(this.pubBytes(), enc);\n };\n module.exports = KeyPair;\n },\n});\n\n// node_modules/elliptic/lib/elliptic/eddsa/signature.js\nvar require_signature2 = __commonJS({\n \"node_modules/elliptic/lib/elliptic/eddsa/signature.js\"(exports, module) {\n \"use strict\";\n var BN = require_bn4(),\n utils = require_utils3(),\n assert = utils.assert,\n cachedProperty = utils.cachedProperty,\n parseBytes = utils.parseBytes;\n function Signature(eddsa, sig) {\n (this.eddsa = eddsa),\n typeof sig != \"object\" && (sig = parseBytes(sig)),\n Array.isArray(sig) &&\n (sig = {\n R: sig.slice(0, eddsa.encodingLength),\n S: sig.slice(eddsa.encodingLength),\n }),\n assert(sig.R && sig.S, \"Signature without R or S\"),\n eddsa.isPoint(sig.R) && (this._R = sig.R),\n sig.S instanceof BN && (this._S = sig.S),\n (this._Rencoded = Array.isArray(sig.R) ? sig.R : sig.Rencoded),\n (this._Sencoded = Array.isArray(sig.S) ? sig.S : sig.Sencoded);\n }\n cachedProperty(Signature, \"S\", function () {\n return this.eddsa.decodeInt(this.Sencoded());\n });\n cachedProperty(Signature, \"R\", function () {\n return this.eddsa.decodePoint(this.Rencoded());\n });\n cachedProperty(Signature, \"Rencoded\", function () {\n return this.eddsa.encodePoint(this.R());\n });\n cachedProperty(Signature, \"Sencoded\", function () {\n return this.eddsa.encodeInt(this.S());\n });\n Signature.prototype.toBytes = function () {\n return this.Rencoded().concat(this.Sencoded());\n };\n Signature.prototype.toHex = function () {\n return utils.encode(this.toBytes(), \"hex\").toUpperCase();\n };\n module.exports = Signature;\n },\n});\n\n// node_modules/elliptic/lib/elliptic/eddsa/index.js\nvar require_eddsa = __commonJS({\n \"node_modules/elliptic/lib/elliptic/eddsa/index.js\"(exports, module) {\n \"use strict\";\n var hash = require_hash2(),\n curves = require_curves(),\n utils = require_utils3(),\n assert = utils.assert,\n parseBytes = utils.parseBytes,\n KeyPair = require_key2(),\n Signature = require_signature2();\n function EDDSA(curve) {\n if ((assert(curve === \"ed25519\", \"only tested with ed25519 so far\"), !(this instanceof EDDSA)))\n return new EDDSA(curve);\n (curve = curves[curve].curve),\n (this.curve = curve),\n (this.g = curve.g),\n this.g.precompute(curve.n.bitLength() + 1),\n (this.pointClass = curve.point().constructor),\n (this.encodingLength = Math.ceil(curve.n.bitLength() / 8)),\n (this.hash = hash.sha512);\n }\n module.exports = EDDSA;\n EDDSA.prototype.sign = function (message, secret) {\n message = parseBytes(message);\n var key = this.keyFromSecret(secret),\n r = this.hashInt(key.messagePrefix(), message),\n R = this.g.mul(r),\n Rencoded = this.encodePoint(R),\n s_ = this.hashInt(Rencoded, key.pubBytes(), message).mul(key.priv()),\n S = r.add(s_).umod(this.curve.n);\n return this.makeSignature({ R, S, Rencoded });\n };\n EDDSA.prototype.verify = function (message, sig, pub) {\n (message = parseBytes(message)), (sig = this.makeSignature(sig));\n var key = this.keyFromPublic(pub),\n h = this.hashInt(sig.Rencoded(), key.pubBytes(), message),\n SG = this.g.mul(sig.S()),\n RplusAh = sig.R().add(key.pub().mul(h));\n return RplusAh.eq(SG);\n };\n EDDSA.prototype.hashInt = function () {\n for (var hash2 = this.hash(), i = 0; i < arguments.length; i++) hash2.update(arguments[i]);\n return utils.intFromLE(hash2.digest()).umod(this.curve.n);\n };\n EDDSA.prototype.keyFromPublic = function (pub) {\n return KeyPair.fromPublic(this, pub);\n };\n EDDSA.prototype.keyFromSecret = function (secret) {\n return KeyPair.fromSecret(this, secret);\n };\n EDDSA.prototype.makeSignature = function (sig) {\n return sig instanceof Signature ? sig : new Signature(this, sig);\n };\n EDDSA.prototype.encodePoint = function (point) {\n var enc = point.getY().toArray(\"le\", this.encodingLength);\n return (enc[this.encodingLength - 1] |= point.getX().isOdd() ? 128 : 0), enc;\n };\n EDDSA.prototype.decodePoint = function (bytes) {\n bytes = utils.parseBytes(bytes);\n var lastIx = bytes.length - 1,\n normed = bytes.slice(0, lastIx).concat(bytes[lastIx] & -129),\n xIsOdd = (bytes[lastIx] & 128) !== 0,\n y = utils.intFromLE(normed);\n return this.curve.pointFromY(y, xIsOdd);\n };\n EDDSA.prototype.encodeInt = function (num) {\n return num.toArray(\"le\", this.encodingLength);\n };\n EDDSA.prototype.decodeInt = function (bytes) {\n return utils.intFromLE(bytes);\n };\n EDDSA.prototype.isPoint = function (val) {\n return val instanceof this.pointClass;\n };\n },\n});\n\n// node_modules/elliptic/lib/elliptic.js\nvar require_elliptic = __commonJS({\n \"node_modules/elliptic/lib/elliptic.js\"(exports) {\n \"use strict\";\n var elliptic = exports;\n elliptic.version = require_package().version;\n elliptic.utils = require_utils3();\n elliptic.rand = require_brorand();\n elliptic.curve = require_curve();\n elliptic.curves = require_curves();\n elliptic.ec = require_ec();\n elliptic.eddsa = require_eddsa();\n },\n});\n\n// node_modules/asn1.js/node_modules/bn.js/lib/bn.js\nvar require_bn5 = __commonJS({\n \"node_modules/asn1.js/node_modules/bn.js/lib/bn.js\"(exports, module) {\n (function (module2, exports2) {\n \"use strict\";\n function assert(val, msg) {\n if (!val) throw new Error(msg || \"Assertion failed\");\n }\n function inherits(ctor, superCtor) {\n ctor.super_ = superCtor;\n var TempCtor = function () {};\n (TempCtor.prototype = superCtor.prototype),\n (ctor.prototype = new TempCtor()),\n (ctor.prototype.constructor = ctor);\n }\n function BN(number, base, endian) {\n if (BN.isBN(number)) return number;\n (this.negative = 0),\n (this.words = null),\n (this.length = 0),\n (this.red = null),\n number !== null &&\n ((base === \"le\" || base === \"be\") && ((endian = base), (base = 10)),\n this._init(number || 0, base || 10, endian || \"be\"));\n }\n typeof module2 == \"object\" ? (module2.exports = BN) : (exports2.BN = BN), (BN.BN = BN), (BN.wordSize = 26);\n var Buffer2;\n try {\n typeof window < \"u\" && typeof window.Buffer < \"u\"\n ? (Buffer2 = window.Buffer)\n : (Buffer2 = __require(\"buffer\").Buffer);\n } catch {}\n (BN.isBN = function (num) {\n return num instanceof BN\n ? !0\n : num !== null &&\n typeof num == \"object\" &&\n num.constructor.wordSize === BN.wordSize &&\n Array.isArray(num.words);\n }),\n (BN.max = function (left, right) {\n return left.cmp(right) > 0 ? left : right;\n }),\n (BN.min = function (left, right) {\n return left.cmp(right) < 0 ? left : right;\n }),\n (BN.prototype._init = function (number, base, endian) {\n if (typeof number == \"number\") return this._initNumber(number, base, endian);\n if (typeof number == \"object\") return this._initArray(number, base, endian);\n base === \"hex\" && (base = 16),\n assert(base === (base | 0) && base >= 2 && base <= 36),\n (number = number.toString().replace(/\\s+/g, \"\"));\n var start = 0;\n number[0] === \"-\" && (start++, (this.negative = 1)),\n start < number.length &&\n (base === 16\n ? this._parseHex(number, start, endian)\n : (this._parseBase(number, base, start),\n endian === \"le\" && this._initArray(this.toArray(), base, endian)));\n }),\n (BN.prototype._initNumber = function (number, base, endian) {\n number < 0 && ((this.negative = 1), (number = -number)),\n number < 67108864\n ? ((this.words = [number & 67108863]), (this.length = 1))\n : number < 4503599627370496\n ? ((this.words = [number & 67108863, (number / 67108864) & 67108863]), (this.length = 2))\n : (assert(number < 9007199254740992),\n (this.words = [number & 67108863, (number / 67108864) & 67108863, 1]),\n (this.length = 3)),\n endian === \"le\" && this._initArray(this.toArray(), base, endian);\n }),\n (BN.prototype._initArray = function (number, base, endian) {\n if ((assert(typeof number.length == \"number\"), number.length <= 0))\n return (this.words = [0]), (this.length = 1), this;\n (this.length = Math.ceil(number.length / 3)), (this.words = new Array(this.length));\n for (var i = 0; i < this.length; i++) this.words[i] = 0;\n var j,\n w,\n off = 0;\n if (endian === \"be\")\n for (i = number.length - 1, j = 0; i >= 0; i -= 3)\n (w = number[i] | (number[i - 1] << 8) | (number[i - 2] << 16)),\n (this.words[j] |= (w << off) & 67108863),\n (this.words[j + 1] = (w >>> (26 - off)) & 67108863),\n (off += 24),\n off >= 26 && ((off -= 26), j++);\n else if (endian === \"le\")\n for (i = 0, j = 0; i < number.length; i += 3)\n (w = number[i] | (number[i + 1] << 8) | (number[i + 2] << 16)),\n (this.words[j] |= (w << off) & 67108863),\n (this.words[j + 1] = (w >>> (26 - off)) & 67108863),\n (off += 24),\n off >= 26 && ((off -= 26), j++);\n return this.strip();\n });\n function parseHex4Bits(string, index) {\n var c = string.charCodeAt(index);\n return c >= 65 && c <= 70 ? c - 55 : c >= 97 && c <= 102 ? c - 87 : (c - 48) & 15;\n }\n function parseHexByte(string, lowerBound, index) {\n var r = parseHex4Bits(string, index);\n return index - 1 >= lowerBound && (r |= parseHex4Bits(string, index - 1) << 4), r;\n }\n BN.prototype._parseHex = function (number, start, endian) {\n (this.length = Math.ceil((number.length - start) / 6)), (this.words = new Array(this.length));\n for (var i = 0; i < this.length; i++) this.words[i] = 0;\n var off = 0,\n j = 0,\n w;\n if (endian === \"be\")\n for (i = number.length - 1; i >= start; i -= 2)\n (w = parseHexByte(number, start, i) << off),\n (this.words[j] |= w & 67108863),\n off >= 18 ? ((off -= 18), (j += 1), (this.words[j] |= w >>> 26)) : (off += 8);\n else {\n var parseLength = number.length - start;\n for (i = parseLength % 2 === 0 ? start + 1 : start; i < number.length; i += 2)\n (w = parseHexByte(number, start, i) << off),\n (this.words[j] |= w & 67108863),\n off >= 18 ? ((off -= 18), (j += 1), (this.words[j] |= w >>> 26)) : (off += 8);\n }\n this.strip();\n };\n function parseBase(str, start, end, mul) {\n for (var r = 0, len = Math.min(str.length, end), i = start; i < len; i++) {\n var c = str.charCodeAt(i) - 48;\n (r *= mul), c >= 49 ? (r += c - 49 + 10) : c >= 17 ? (r += c - 17 + 10) : (r += c);\n }\n return r;\n }\n (BN.prototype._parseBase = function (number, base, start) {\n (this.words = [0]), (this.length = 1);\n for (var limbLen = 0, limbPow = 1; limbPow <= 67108863; limbPow *= base) limbLen++;\n limbLen--, (limbPow = (limbPow / base) | 0);\n for (\n var total = number.length - start,\n mod = total % limbLen,\n end = Math.min(total, total - mod) + start,\n word = 0,\n i = start;\n i < end;\n i += limbLen\n )\n (word = parseBase(number, i, i + limbLen, base)),\n this.imuln(limbPow),\n this.words[0] + word < 67108864 ? (this.words[0] += word) : this._iaddn(word);\n if (mod !== 0) {\n var pow = 1;\n for (word = parseBase(number, i, number.length, base), i = 0; i < mod; i++) pow *= base;\n this.imuln(pow), this.words[0] + word < 67108864 ? (this.words[0] += word) : this._iaddn(word);\n }\n this.strip();\n }),\n (BN.prototype.copy = function (dest) {\n dest.words = new Array(this.length);\n for (var i = 0; i < this.length; i++) dest.words[i] = this.words[i];\n (dest.length = this.length), (dest.negative = this.negative), (dest.red = this.red);\n }),\n (BN.prototype.clone = function () {\n var r = new BN(null);\n return this.copy(r), r;\n }),\n (BN.prototype._expand = function (size) {\n for (; this.length < size; ) this.words[this.length++] = 0;\n return this;\n }),\n (BN.prototype.strip = function () {\n for (; this.length > 1 && this.words[this.length - 1] === 0; ) this.length--;\n return this._normSign();\n }),\n (BN.prototype._normSign = function () {\n return this.length === 1 && this.words[0] === 0 && (this.negative = 0), this;\n }),\n (BN.prototype.inspect = function () {\n return (this.red ? \"<BN-R: \" : \"<BN: \") + this.toString(16) + \">\";\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 groupSizes = [\n 0, 0, 25, 16, 12, 11, 10, 9, 8, 8, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5,\n 5, 5,\n ],\n groupBases = [\n 0, 0, 33554432, 43046721, 16777216, 48828125, 60466176, 40353607, 16777216, 43046721, 1e7, 19487171, 35831808,\n 62748517, 7529536, 11390625, 16777216, 24137569, 34012224, 47045881, 64e6, 4084101, 5153632, 6436343, 7962624,\n 9765625, 11881376, 14348907, 17210368, 20511149, 243e5, 28629151, 33554432, 39135393, 45435424, 52521875,\n 60466176,\n ];\n (BN.prototype.toString = function (base, padding) {\n (base = base || 10), (padding = padding | 0 || 1);\n var out;\n if (base === 16 || base === \"hex\") {\n out = \"\";\n for (var off = 0, carry = 0, i = 0; i < this.length; i++) {\n var w = this.words[i],\n word = (((w << off) | carry) & 16777215).toString(16);\n (carry = (w >>> (24 - off)) & 16777215),\n carry !== 0 || i !== this.length - 1 ? (out = zeros[6 - word.length] + word + out) : (out = word + out),\n (off += 2),\n off >= 26 && ((off -= 26), i--);\n }\n for (carry !== 0 && (out = carry.toString(16) + out); out.length % padding !== 0; ) out = \"0\" + out;\n return this.negative !== 0 && (out = \"-\" + out), out;\n }\n if (base === (base | 0) && base >= 2 && base <= 36) {\n var groupSize = groupSizes[base],\n groupBase = groupBases[base];\n out = \"\";\n var c = this.clone();\n for (c.negative = 0; !c.isZero(); ) {\n var r = c.modn(groupBase).toString(base);\n (c = c.idivn(groupBase)), c.isZero() ? (out = r + out) : (out = zeros[groupSize - r.length] + r + out);\n }\n for (this.isZero() && (out = \"0\" + out); out.length % padding !== 0; ) out = \"0\" + out;\n return this.negative !== 0 && (out = \"-\" + out), out;\n }\n assert(!1, \"Base should be between 2 and 36\");\n }),\n (BN.prototype.toNumber = function () {\n var ret = this.words[0];\n return (\n this.length === 2\n ? (ret += this.words[1] * 67108864)\n : this.length === 3 && this.words[2] === 1\n ? (ret += 4503599627370496 + this.words[1] * 67108864)\n : this.length > 2 && assert(!1, \"Number can only safely store up to 53 bits\"),\n this.negative !== 0 ? -ret : ret\n );\n }),\n (BN.prototype.toJSON = function () {\n return this.toString(16);\n }),\n (BN.prototype.toBuffer = function (endian, length) {\n return assert(typeof Buffer2 < \"u\"), this.toArrayLike(Buffer2, endian, length);\n }),\n (BN.prototype.toArray = function (endian, length) {\n return this.toArrayLike(Array, endian, length);\n }),\n (BN.prototype.toArrayLike = function (ArrayType, endian, length) {\n var byteLength = this.byteLength(),\n 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 this.strip();\n var littleEndian = endian === \"le\",\n res = new ArrayType(reqLength),\n b,\n i,\n q = this.clone();\n if (littleEndian) {\n for (i = 0; !q.isZero(); i++) (b = q.andln(255)), q.iushrn(8), (res[i] = b);\n for (; i < reqLength; i++) res[i] = 0;\n } else {\n for (i = 0; i < reqLength - byteLength; i++) res[i] = 0;\n for (i = 0; !q.isZero(); i++) (b = q.andln(255)), q.iushrn(8), (res[reqLength - i - 1] = b);\n }\n return res;\n }),\n Math.clz32\n ? (BN.prototype._countBits = function (w) {\n return 32 - Math.clz32(w);\n })\n : (BN.prototype._countBits = function (w) {\n var t = w,\n r = 0;\n return (\n t >= 4096 && ((r += 13), (t >>>= 13)),\n t >= 64 && ((r += 7), (t >>>= 7)),\n t >= 8 && ((r += 4), (t >>>= 4)),\n t >= 2 && ((r += 2), (t >>>= 2)),\n r + t\n );\n }),\n (BN.prototype._zeroBits = function (w) {\n if (w === 0) return 26;\n var t = w,\n r = 0;\n return (\n (t & 8191) === 0 && ((r += 13), (t >>>= 13)),\n (t & 127) === 0 && ((r += 7), (t >>>= 7)),\n (t & 15) === 0 && ((r += 4), (t >>>= 4)),\n (t & 3) === 0 && ((r += 2), (t >>>= 2)),\n (t & 1) === 0 && r++,\n r\n );\n }),\n (BN.prototype.bitLength = function () {\n var w = this.words[this.length - 1],\n hi = this._countBits(w);\n return (this.length - 1) * 26 + hi;\n });\n function toBitArray(num) {\n for (var w = new Array(num.bitLength()), bit = 0; bit < w.length; bit++) {\n var off = (bit / 26) | 0,\n wbit = bit % 26;\n w[bit] = (num.words[off] & (1 << wbit)) >>> wbit;\n }\n return w;\n }\n (BN.prototype.zeroBits = function () {\n if (this.isZero()) return 0;\n for (var r = 0, i = 0; i < this.length; i++) {\n var b = this._zeroBits(this.words[i]);\n if (((r += b), b !== 26)) break;\n }\n return r;\n }),\n (BN.prototype.byteLength = function () {\n return Math.ceil(this.bitLength() / 8);\n }),\n (BN.prototype.toTwos = function (width) {\n return this.negative !== 0 ? this.abs().inotn(width).iaddn(1) : this.clone();\n }),\n (BN.prototype.fromTwos = function (width) {\n return this.testn(width - 1) ? this.notn(width).iaddn(1).ineg() : this.clone();\n }),\n (BN.prototype.isNeg = function () {\n return this.negative !== 0;\n }),\n (BN.prototype.neg = function () {\n return this.clone().ineg();\n }),\n (BN.prototype.ineg = function () {\n return this.isZero() || (this.negative ^= 1), this;\n }),\n (BN.prototype.iuor = function (num) {\n for (; this.length < num.length; ) this.words[this.length++] = 0;\n for (var i = 0; i < num.length; i++) this.words[i] = this.words[i] | num.words[i];\n return this.strip();\n }),\n (BN.prototype.ior = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuor(num);\n }),\n (BN.prototype.or = function (num) {\n return this.length > num.length ? this.clone().ior(num) : num.clone().ior(this);\n }),\n (BN.prototype.uor = function (num) {\n return this.length > num.length ? this.clone().iuor(num) : num.clone().iuor(this);\n }),\n (BN.prototype.iuand = function (num) {\n var b;\n this.length > num.length ? (b = num) : (b = this);\n for (var i = 0; i < b.length; i++) this.words[i] = this.words[i] & num.words[i];\n return (this.length = b.length), this.strip();\n }),\n (BN.prototype.iand = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuand(num);\n }),\n (BN.prototype.and = function (num) {\n return this.length > num.length ? this.clone().iand(num) : num.clone().iand(this);\n }),\n (BN.prototype.uand = function (num) {\n return this.length > num.length ? this.clone().iuand(num) : num.clone().iuand(this);\n }),\n (BN.prototype.iuxor = function (num) {\n var a, b;\n this.length > num.length ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var i = 0; i < b.length; i++) this.words[i] = a.words[i] ^ b.words[i];\n if (this !== a) for (; i < a.length; i++) this.words[i] = a.words[i];\n return (this.length = a.length), this.strip();\n }),\n (BN.prototype.ixor = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuxor(num);\n }),\n (BN.prototype.xor = function (num) {\n return this.length > num.length ? this.clone().ixor(num) : num.clone().ixor(this);\n }),\n (BN.prototype.uxor = function (num) {\n return this.length > num.length ? this.clone().iuxor(num) : num.clone().iuxor(this);\n }),\n (BN.prototype.inotn = function (width) {\n assert(typeof width == \"number\" && width >= 0);\n var bytesNeeded = Math.ceil(width / 26) | 0,\n bitsLeft = width % 26;\n this._expand(bytesNeeded), bitsLeft > 0 && bytesNeeded--;\n for (var i = 0; i < bytesNeeded; i++) this.words[i] = ~this.words[i] & 67108863;\n return bitsLeft > 0 && (this.words[i] = ~this.words[i] & (67108863 >> (26 - bitsLeft))), this.strip();\n }),\n (BN.prototype.notn = function (width) {\n return this.clone().inotn(width);\n }),\n (BN.prototype.setn = function (bit, val) {\n assert(typeof bit == \"number\" && bit >= 0);\n var off = (bit / 26) | 0,\n wbit = bit % 26;\n return (\n this._expand(off + 1),\n val\n ? (this.words[off] = this.words[off] | (1 << wbit))\n : (this.words[off] = this.words[off] & ~(1 << wbit)),\n this.strip()\n );\n }),\n (BN.prototype.iadd = function (num) {\n var r;\n if (this.negative !== 0 && num.negative === 0)\n return (this.negative = 0), (r = this.isub(num)), (this.negative ^= 1), this._normSign();\n if (this.negative === 0 && num.negative !== 0)\n return (num.negative = 0), (r = this.isub(num)), (num.negative = 1), r._normSign();\n var a, b;\n this.length > num.length ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var carry = 0, i = 0; i < b.length; i++)\n (r = (a.words[i] | 0) + (b.words[i] | 0) + carry), (this.words[i] = r & 67108863), (carry = r >>> 26);\n for (; carry !== 0 && i < a.length; i++)\n (r = (a.words[i] | 0) + carry), (this.words[i] = r & 67108863), (carry = r >>> 26);\n if (((this.length = a.length), carry !== 0)) (this.words[this.length] = carry), this.length++;\n else if (a !== this) for (; i < a.length; i++) this.words[i] = a.words[i];\n return this;\n }),\n (BN.prototype.add = function (num) {\n var res;\n return num.negative !== 0 && this.negative === 0\n ? ((num.negative = 0), (res = this.sub(num)), (num.negative ^= 1), res)\n : num.negative === 0 && this.negative !== 0\n ? ((this.negative = 0), (res = num.sub(this)), (this.negative = 1), res)\n : this.length > num.length\n ? this.clone().iadd(num)\n : num.clone().iadd(this);\n }),\n (BN.prototype.isub = function (num) {\n if (num.negative !== 0) {\n num.negative = 0;\n var r = this.iadd(num);\n return (num.negative = 1), r._normSign();\n } else if (this.negative !== 0)\n return (this.negative = 0), this.iadd(num), (this.negative = 1), this._normSign();\n var cmp = this.cmp(num);\n if (cmp === 0) return (this.negative = 0), (this.length = 1), (this.words[0] = 0), this;\n var a, b;\n cmp > 0 ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var carry = 0, i = 0; i < b.length; i++)\n (r = (a.words[i] | 0) - (b.words[i] | 0) + carry), (carry = r >> 26), (this.words[i] = r & 67108863);\n for (; carry !== 0 && i < a.length; i++)\n (r = (a.words[i] | 0) + carry), (carry = r >> 26), (this.words[i] = r & 67108863);\n if (carry === 0 && i < a.length && a !== this) for (; i < a.length; i++) this.words[i] = a.words[i];\n return (this.length = Math.max(this.length, i)), a !== this && (this.negative = 1), this.strip();\n }),\n (BN.prototype.sub = function (num) {\n return this.clone().isub(num);\n });\n function smallMulTo(self2, num, out) {\n out.negative = num.negative ^ self2.negative;\n var len = (self2.length + num.length) | 0;\n (out.length = len), (len = (len - 1) | 0);\n var a = self2.words[0] | 0,\n b = num.words[0] | 0,\n r = a * b,\n lo = r & 67108863,\n carry = (r / 67108864) | 0;\n out.words[0] = lo;\n for (var k = 1; k < len; k++) {\n for (\n var ncarry = carry >>> 26,\n rword = carry & 67108863,\n maxJ = Math.min(k, num.length - 1),\n j = Math.max(0, k - self2.length + 1);\n j <= maxJ;\n j++\n ) {\n var i = (k - j) | 0;\n (a = self2.words[i] | 0),\n (b = num.words[j] | 0),\n (r = a * b + rword),\n (ncarry += (r / 67108864) | 0),\n (rword = r & 67108863);\n }\n (out.words[k] = rword | 0), (carry = ncarry | 0);\n }\n return carry !== 0 ? (out.words[k] = carry | 0) : out.length--, out.strip();\n }\n var comb10MulTo = function (self2, num, out) {\n var a = self2.words,\n b = num.words,\n o = out.words,\n c = 0,\n lo,\n mid,\n hi,\n a0 = a[0] | 0,\n al0 = a0 & 8191,\n ah0 = a0 >>> 13,\n a1 = a[1] | 0,\n al1 = a1 & 8191,\n ah1 = a1 >>> 13,\n a2 = a[2] | 0,\n al2 = a2 & 8191,\n ah2 = a2 >>> 13,\n a3 = a[3] | 0,\n al3 = a3 & 8191,\n ah3 = a3 >>> 13,\n a4 = a[4] | 0,\n al4 = a4 & 8191,\n ah4 = a4 >>> 13,\n a5 = a[5] | 0,\n al5 = a5 & 8191,\n ah5 = a5 >>> 13,\n a6 = a[6] | 0,\n al6 = a6 & 8191,\n ah6 = a6 >>> 13,\n a7 = a[7] | 0,\n al7 = a7 & 8191,\n ah7 = a7 >>> 13,\n a8 = a[8] | 0,\n al8 = a8 & 8191,\n ah8 = a8 >>> 13,\n a9 = a[9] | 0,\n al9 = a9 & 8191,\n ah9 = a9 >>> 13,\n b0 = b[0] | 0,\n bl0 = b0 & 8191,\n bh0 = b0 >>> 13,\n b1 = b[1] | 0,\n bl1 = b1 & 8191,\n bh1 = b1 >>> 13,\n b2 = b[2] | 0,\n bl2 = b2 & 8191,\n bh2 = b2 >>> 13,\n b3 = b[3] | 0,\n bl3 = b3 & 8191,\n bh3 = b3 >>> 13,\n b4 = b[4] | 0,\n bl4 = b4 & 8191,\n bh4 = b4 >>> 13,\n b5 = b[5] | 0,\n bl5 = b5 & 8191,\n bh5 = b5 >>> 13,\n b6 = b[6] | 0,\n bl6 = b6 & 8191,\n bh6 = b6 >>> 13,\n b7 = b[7] | 0,\n bl7 = b7 & 8191,\n bh7 = b7 >>> 13,\n b8 = b[8] | 0,\n bl8 = b8 & 8191,\n bh8 = b8 >>> 13,\n b9 = b[9] | 0,\n bl9 = b9 & 8191,\n bh9 = b9 >>> 13;\n (out.negative = self2.negative ^ num.negative),\n (out.length = 19),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w0 >>> 26)) | 0),\n (w0 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w1 >>> 26)) | 0),\n (w1 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w2 >>> 26)) | 0),\n (w2 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w3 >>> 26)) | 0),\n (w3 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w4 >>> 26)) | 0),\n (w4 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w5 >>> 26)) | 0),\n (w5 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w6 >>> 26)) | 0),\n (w6 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w7 >>> 26)) | 0),\n (w7 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w8 >>> 26)) | 0),\n (w8 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w9 >>> 26)) | 0),\n (w9 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w10 >>> 26)) | 0),\n (w10 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w11 >>> 26)) | 0),\n (w11 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w12 >>> 26)) | 0),\n (w12 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w13 >>> 26)) | 0),\n (w13 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w14 >>> 26)) | 0),\n (w14 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w15 >>> 26)) | 0),\n (w15 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w16 >>> 26)) | 0),\n (w16 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w17 >>> 26)) | 0),\n (w17 &= 67108863),\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 & 8191) << 13)) | 0;\n return (\n (c = (((hi + (mid >>> 13)) | 0) + (w18 >>> 26)) | 0),\n (w18 &= 67108863),\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 c !== 0 && ((o[19] = c), out.length++),\n out\n );\n };\n Math.imul || (comb10MulTo = smallMulTo);\n function bigMulTo(self2, num, out) {\n (out.negative = num.negative ^ self2.negative), (out.length = self2.length + num.length);\n for (var carry = 0, hncarry = 0, k = 0; k < out.length - 1; k++) {\n var ncarry = hncarry;\n hncarry = 0;\n for (\n var rword = carry & 67108863, maxJ = Math.min(k, num.length - 1), j = Math.max(0, k - self2.length + 1);\n j <= maxJ;\n j++\n ) {\n var i = k - j,\n a = self2.words[i] | 0,\n b = num.words[j] | 0,\n r = a * b,\n lo = r & 67108863;\n (ncarry = (ncarry + ((r / 67108864) | 0)) | 0),\n (lo = (lo + rword) | 0),\n (rword = lo & 67108863),\n (ncarry = (ncarry + (lo >>> 26)) | 0),\n (hncarry += ncarry >>> 26),\n (ncarry &= 67108863);\n }\n (out.words[k] = rword), (carry = ncarry), (ncarry = hncarry);\n }\n return carry !== 0 ? (out.words[k] = carry) : out.length--, out.strip();\n }\n function jumboMulTo(self2, num, out) {\n var fftm = new FFTM();\n return fftm.mulp(self2, num, out);\n }\n BN.prototype.mulTo = function (num, out) {\n var res,\n len = this.length + num.length;\n return (\n this.length === 10 && num.length === 10\n ? (res = comb10MulTo(this, num, out))\n : len < 63\n ? (res = smallMulTo(this, num, out))\n : len < 1024\n ? (res = bigMulTo(this, num, out))\n : (res = jumboMulTo(this, num, out)),\n res\n );\n };\n function FFTM(x, y) {\n (this.x = x), (this.y = y);\n }\n (FFTM.prototype.makeRBT = function (N) {\n for (var t = new Array(N), l = BN.prototype._countBits(N) - 1, i = 0; i < N; i++) t[i] = this.revBin(i, l, N);\n return t;\n }),\n (FFTM.prototype.revBin = function (x, l, N) {\n if (x === 0 || x === N - 1) return x;\n for (var rb = 0, i = 0; i < l; i++) (rb |= (x & 1) << (l - i - 1)), (x >>= 1);\n return rb;\n }),\n (FFTM.prototype.permute = function (rbt, rws, iws, rtws, itws, N) {\n for (var i = 0; i < N; i++) (rtws[i] = rws[rbt[i]]), (itws[i] = iws[rbt[i]]);\n }),\n (FFTM.prototype.transform = function (rws, iws, rtws, itws, N, rbt) {\n this.permute(rbt, rws, iws, rtws, itws, N);\n for (var s = 1; s < N; s <<= 1)\n for (\n var l = s << 1, rtwdf = Math.cos((2 * Math.PI) / l), itwdf = Math.sin((2 * Math.PI) / l), p = 0;\n p < N;\n p += l\n )\n for (var rtwdf_ = rtwdf, itwdf_ = itwdf, j = 0; j < s; j++) {\n var re = rtws[p + j],\n ie = itws[p + j],\n ro = rtws[p + j + s],\n io = itws[p + j + s],\n rx = rtwdf_ * ro - itwdf_ * io;\n (io = rtwdf_ * io + itwdf_ * ro),\n (ro = rx),\n (rtws[p + j] = re + ro),\n (itws[p + j] = ie + io),\n (rtws[p + j + s] = re - ro),\n (itws[p + j + s] = ie - io),\n j !== l &&\n ((rx = rtwdf * rtwdf_ - itwdf * itwdf_), (itwdf_ = rtwdf * itwdf_ + itwdf * rtwdf_), (rtwdf_ = rx));\n }\n }),\n (FFTM.prototype.guessLen13b = function (n, m) {\n var N = Math.max(m, n) | 1,\n odd = N & 1,\n i = 0;\n for (N = (N / 2) | 0; N; N = N >>> 1) i++;\n return 1 << (i + 1 + odd);\n }),\n (FFTM.prototype.conjugate = function (rws, iws, N) {\n if (!(N <= 1))\n for (var i = 0; i < N / 2; i++) {\n var t = rws[i];\n (rws[i] = rws[N - i - 1]),\n (rws[N - i - 1] = t),\n (t = iws[i]),\n (iws[i] = -iws[N - i - 1]),\n (iws[N - i - 1] = -t);\n }\n }),\n (FFTM.prototype.normalize13b = function (ws, N) {\n for (var carry = 0, i = 0; i < N / 2; i++) {\n var w = Math.round(ws[2 * i + 1] / N) * 8192 + Math.round(ws[2 * i] / N) + carry;\n (ws[i] = w & 67108863), w < 67108864 ? (carry = 0) : (carry = (w / 67108864) | 0);\n }\n return ws;\n }),\n (FFTM.prototype.convert13b = function (ws, len, rws, N) {\n for (var carry = 0, i = 0; i < len; i++)\n (carry = carry + (ws[i] | 0)),\n (rws[2 * i] = carry & 8191),\n (carry = carry >>> 13),\n (rws[2 * i + 1] = carry & 8191),\n (carry = carry >>> 13);\n for (i = 2 * len; i < N; ++i) rws[i] = 0;\n assert(carry === 0), assert((carry & -8192) === 0);\n }),\n (FFTM.prototype.stub = function (N) {\n for (var ph = new Array(N), i = 0; i < N; i++) ph[i] = 0;\n return ph;\n }),\n (FFTM.prototype.mulp = function (x, y, out) {\n var N = 2 * this.guessLen13b(x.length, y.length),\n rbt = this.makeRBT(N),\n _ = this.stub(N),\n rws = new Array(N),\n rwst = new Array(N),\n iwst = new Array(N),\n nrws = new Array(N),\n nrwst = new Array(N),\n niwst = new Array(N),\n rmws = out.words;\n (rmws.length = N),\n this.convert13b(x.words, x.length, rws, N),\n this.convert13b(y.words, y.length, nrws, N),\n this.transform(rws, _, rwst, iwst, N, rbt),\n this.transform(nrws, _, nrwst, niwst, N, rbt);\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]), (rwst[i] = rx);\n }\n return (\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 (out.negative = x.negative ^ y.negative),\n (out.length = x.length + y.length),\n out.strip()\n );\n }),\n (BN.prototype.mul = function (num) {\n var out = new BN(null);\n return (out.words = new Array(this.length + num.length)), this.mulTo(num, out);\n }),\n (BN.prototype.mulf = function (num) {\n var out = new BN(null);\n return (out.words = new Array(this.length + num.length)), jumboMulTo(this, num, out);\n }),\n (BN.prototype.imul = function (num) {\n return this.clone().mulTo(num, this);\n }),\n (BN.prototype.imuln = function (num) {\n assert(typeof num == \"number\"), assert(num < 67108864);\n for (var carry = 0, i = 0; i < this.length; i++) {\n var w = (this.words[i] | 0) * num,\n lo = (w & 67108863) + (carry & 67108863);\n (carry >>= 26), (carry += (w / 67108864) | 0), (carry += lo >>> 26), (this.words[i] = lo & 67108863);\n }\n return carry !== 0 && ((this.words[i] = carry), this.length++), this;\n }),\n (BN.prototype.muln = function (num) {\n return this.clone().imuln(num);\n }),\n (BN.prototype.sqr = function () {\n return this.mul(this);\n }),\n (BN.prototype.isqr = function () {\n return this.imul(this.clone());\n }),\n (BN.prototype.pow = function (num) {\n var w = toBitArray(num);\n if (w.length === 0) return new BN(1);\n for (var res = this, i = 0; i < w.length && w[i] === 0; i++, res = res.sqr());\n if (++i < w.length) for (var q = res.sqr(); i < w.length; i++, q = q.sqr()) w[i] !== 0 && (res = res.mul(q));\n return res;\n }),\n (BN.prototype.iushln = function (bits) {\n assert(typeof bits == \"number\" && bits >= 0);\n var r = bits % 26,\n s = (bits - r) / 26,\n carryMask = (67108863 >>> (26 - r)) << (26 - r),\n i;\n if (r !== 0) {\n var carry = 0;\n for (i = 0; i < this.length; i++) {\n var newCarry = this.words[i] & carryMask,\n c = ((this.words[i] | 0) - newCarry) << r;\n (this.words[i] = c | carry), (carry = newCarry >>> (26 - r));\n }\n carry && ((this.words[i] = carry), this.length++);\n }\n if (s !== 0) {\n for (i = this.length - 1; i >= 0; i--) this.words[i + s] = this.words[i];\n for (i = 0; i < s; i++) this.words[i] = 0;\n this.length += s;\n }\n return this.strip();\n }),\n (BN.prototype.ishln = function (bits) {\n return assert(this.negative === 0), this.iushln(bits);\n }),\n (BN.prototype.iushrn = function (bits, hint, extended) {\n assert(typeof bits == \"number\" && bits >= 0);\n var h;\n hint ? (h = (hint - (hint % 26)) / 26) : (h = 0);\n var r = bits % 26,\n s = Math.min((bits - r) / 26, this.length),\n mask = 67108863 ^ ((67108863 >>> r) << r),\n maskedWords = extended;\n if (((h -= s), (h = Math.max(0, h)), maskedWords)) {\n for (var i = 0; i < s; i++) maskedWords.words[i] = this.words[i];\n maskedWords.length = s;\n }\n if (s !== 0)\n if (this.length > s) for (this.length -= s, i = 0; i < this.length; i++) this.words[i] = this.words[i + s];\n else (this.words[0] = 0), (this.length = 1);\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)), (carry = word & mask);\n }\n return (\n maskedWords && carry !== 0 && (maskedWords.words[maskedWords.length++] = carry),\n this.length === 0 && ((this.words[0] = 0), (this.length = 1)),\n this.strip()\n );\n }),\n (BN.prototype.ishrn = function (bits, hint, extended) {\n return assert(this.negative === 0), this.iushrn(bits, hint, extended);\n }),\n (BN.prototype.shln = function (bits) {\n return this.clone().ishln(bits);\n }),\n (BN.prototype.ushln = function (bits) {\n return this.clone().iushln(bits);\n }),\n (BN.prototype.shrn = function (bits) {\n return this.clone().ishrn(bits);\n }),\n (BN.prototype.ushrn = function (bits) {\n return this.clone().iushrn(bits);\n }),\n (BN.prototype.testn = function (bit) {\n assert(typeof bit == \"number\" && bit >= 0);\n var r = bit % 26,\n s = (bit - r) / 26,\n q = 1 << r;\n if (this.length <= s) return !1;\n var w = this.words[s];\n return !!(w & q);\n }),\n (BN.prototype.imaskn = function (bits) {\n assert(typeof bits == \"number\" && bits >= 0);\n var r = bits % 26,\n s = (bits - r) / 26;\n if ((assert(this.negative === 0, \"imaskn works only with positive numbers\"), this.length <= s)) return this;\n if ((r !== 0 && s++, (this.length = Math.min(s, this.length)), r !== 0)) {\n var mask = 67108863 ^ ((67108863 >>> r) << r);\n this.words[this.length - 1] &= mask;\n }\n return this.strip();\n }),\n (BN.prototype.maskn = function (bits) {\n return this.clone().imaskn(bits);\n }),\n (BN.prototype.iaddn = function (num) {\n return (\n assert(typeof num == \"number\"),\n assert(num < 67108864),\n num < 0\n ? this.isubn(-num)\n : this.negative !== 0\n ? this.length === 1 && (this.words[0] | 0) < num\n ? ((this.words[0] = num - (this.words[0] | 0)), (this.negative = 0), this)\n : ((this.negative = 0), this.isubn(num), (this.negative = 1), this)\n : this._iaddn(num)\n );\n }),\n (BN.prototype._iaddn = function (num) {\n this.words[0] += num;\n for (var i = 0; i < this.length && this.words[i] >= 67108864; i++)\n (this.words[i] -= 67108864), i === this.length - 1 ? (this.words[i + 1] = 1) : this.words[i + 1]++;\n return (this.length = Math.max(this.length, i + 1)), this;\n }),\n (BN.prototype.isubn = function (num) {\n if ((assert(typeof num == \"number\"), assert(num < 67108864), num < 0)) return this.iaddn(-num);\n if (this.negative !== 0) return (this.negative = 0), this.iaddn(num), (this.negative = 1), this;\n if (((this.words[0] -= num), this.length === 1 && this.words[0] < 0))\n (this.words[0] = -this.words[0]), (this.negative = 1);\n else\n for (var i = 0; i < this.length && this.words[i] < 0; i++)\n (this.words[i] += 67108864), (this.words[i + 1] -= 1);\n return this.strip();\n }),\n (BN.prototype.addn = function (num) {\n return this.clone().iaddn(num);\n }),\n (BN.prototype.subn = function (num) {\n return this.clone().isubn(num);\n }),\n (BN.prototype.iabs = function () {\n return (this.negative = 0), this;\n }),\n (BN.prototype.abs = function () {\n return this.clone().iabs();\n }),\n (BN.prototype._ishlnsubmul = function (num, mul, shift) {\n var len = num.length + shift,\n i;\n this._expand(len);\n var w,\n 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 & 67108863),\n (carry = (w >> 26) - ((right / 67108864) | 0)),\n (this.words[i + shift] = w & 67108863);\n }\n for (; i < this.length - shift; i++)\n (w = (this.words[i + shift] | 0) + carry), (carry = w >> 26), (this.words[i + shift] = w & 67108863);\n if (carry === 0) return this.strip();\n for (assert(carry === -1), carry = 0, i = 0; i < this.length; i++)\n (w = -(this.words[i] | 0) + carry), (carry = w >> 26), (this.words[i] = w & 67108863);\n return (this.negative = 1), this.strip();\n }),\n (BN.prototype._wordDiv = function (num, mode) {\n var shift = this.length - num.length,\n a = this.clone(),\n b = num,\n bhi = b.words[b.length - 1] | 0,\n bhiBits = this._countBits(bhi);\n (shift = 26 - bhiBits),\n shift !== 0 && ((b = b.ushln(shift)), a.iushln(shift), (bhi = b.words[b.length - 1] | 0));\n var m = a.length - b.length,\n q;\n if (mode !== \"mod\") {\n (q = new BN(null)), (q.length = m + 1), (q.words = new Array(q.length));\n for (var i = 0; i < q.length; i++) q.words[i] = 0;\n }\n var diff = a.clone()._ishlnsubmul(b, 1, m);\n diff.negative === 0 && ((a = diff), q && (q.words[m] = 1));\n for (var j = m - 1; j >= 0; j--) {\n var qj = (a.words[b.length + j] | 0) * 67108864 + (a.words[b.length + j - 1] | 0);\n for (qj = Math.min((qj / bhi) | 0, 67108863), a._ishlnsubmul(b, qj, j); a.negative !== 0; )\n qj--, (a.negative = 0), a._ishlnsubmul(b, 1, j), a.isZero() || (a.negative ^= 1);\n q && (q.words[j] = qj);\n }\n return (\n q && q.strip(),\n a.strip(),\n mode !== \"div\" && shift !== 0 && a.iushrn(shift),\n {\n div: q || null,\n mod: a,\n }\n );\n }),\n (BN.prototype.divmod = function (num, mode, positive) {\n if ((assert(!num.isZero()), this.isZero()))\n return {\n div: new BN(0),\n mod: new BN(0),\n };\n var div, mod, res;\n return this.negative !== 0 && num.negative === 0\n ? ((res = this.neg().divmod(num, mode)),\n mode !== \"mod\" && (div = res.div.neg()),\n mode !== \"div\" && ((mod = res.mod.neg()), positive && mod.negative !== 0 && mod.iadd(num)),\n {\n div,\n mod,\n })\n : this.negative === 0 && num.negative !== 0\n ? ((res = this.divmod(num.neg(), mode)),\n mode !== \"mod\" && (div = res.div.neg()),\n {\n div,\n mod: res.mod,\n })\n : (this.negative & num.negative) !== 0\n ? ((res = this.neg().divmod(num.neg(), mode)),\n mode !== \"div\" && ((mod = res.mod.neg()), positive && mod.negative !== 0 && mod.isub(num)),\n {\n div: res.div,\n mod,\n })\n : num.length > this.length || this.cmp(num) < 0\n ? {\n div: new BN(0),\n mod: this,\n }\n : num.length === 1\n ? mode === \"div\"\n ? {\n div: this.divn(num.words[0]),\n mod: null,\n }\n : mode === \"mod\"\n ? {\n div: null,\n mod: new BN(this.modn(num.words[0])),\n }\n : {\n div: this.divn(num.words[0]),\n mod: new BN(this.modn(num.words[0])),\n }\n : this._wordDiv(num, mode);\n }),\n (BN.prototype.div = function (num) {\n return this.divmod(num, \"div\", !1).div;\n }),\n (BN.prototype.mod = function (num) {\n return this.divmod(num, \"mod\", !1).mod;\n }),\n (BN.prototype.umod = function (num) {\n return this.divmod(num, \"mod\", !0).mod;\n }),\n (BN.prototype.divRound = function (num) {\n var dm = this.divmod(num);\n if (dm.mod.isZero()) return dm.div;\n var mod = dm.div.negative !== 0 ? dm.mod.isub(num) : dm.mod,\n half = num.ushrn(1),\n r2 = num.andln(1),\n cmp = mod.cmp(half);\n return cmp < 0 || (r2 === 1 && cmp === 0)\n ? dm.div\n : dm.div.negative !== 0\n ? dm.div.isubn(1)\n : dm.div.iaddn(1);\n }),\n (BN.prototype.modn = function (num) {\n assert(num <= 67108863);\n for (var p = (1 << 26) % num, acc = 0, i = this.length - 1; i >= 0; i--)\n acc = (p * acc + (this.words[i] | 0)) % num;\n return acc;\n }),\n (BN.prototype.idivn = function (num) {\n assert(num <= 67108863);\n for (var carry = 0, i = this.length - 1; i >= 0; i--) {\n var w = (this.words[i] | 0) + carry * 67108864;\n (this.words[i] = (w / num) | 0), (carry = w % num);\n }\n return this.strip();\n }),\n (BN.prototype.divn = function (num) {\n return this.clone().idivn(num);\n }),\n (BN.prototype.egcd = function (p) {\n assert(p.negative === 0), assert(!p.isZero());\n var x = this,\n y = p.clone();\n x.negative !== 0 ? (x = x.umod(p)) : (x = x.clone());\n for (var A = new BN(1), B = new BN(0), C = new BN(0), D = new BN(1), g = 0; x.isEven() && y.isEven(); )\n x.iushrn(1), y.iushrn(1), ++g;\n for (var yp = y.clone(), xp = x.clone(); !x.isZero(); ) {\n for (var i = 0, im = 1; (x.words[0] & im) === 0 && i < 26; ++i, im <<= 1);\n if (i > 0)\n for (x.iushrn(i); i-- > 0; )\n (A.isOdd() || B.isOdd()) && (A.iadd(yp), B.isub(xp)), A.iushrn(1), B.iushrn(1);\n for (var j = 0, jm = 1; (y.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n if (j > 0)\n for (y.iushrn(j); j-- > 0; )\n (C.isOdd() || D.isOdd()) && (C.iadd(yp), D.isub(xp)), C.iushrn(1), D.iushrn(1);\n x.cmp(y) >= 0 ? (x.isub(y), A.isub(C), B.isub(D)) : (y.isub(x), C.isub(A), D.isub(B));\n }\n return {\n a: C,\n b: D,\n gcd: y.iushln(g),\n };\n }),\n (BN.prototype._invmp = function (p) {\n assert(p.negative === 0), assert(!p.isZero());\n var a = this,\n b = p.clone();\n a.negative !== 0 ? (a = a.umod(p)) : (a = a.clone());\n for (var x1 = new BN(1), x2 = new BN(0), delta = b.clone(); 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) for (a.iushrn(i); i-- > 0; ) x1.isOdd() && x1.iadd(delta), x1.iushrn(1);\n for (var j = 0, jm = 1; (b.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n if (j > 0) for (b.iushrn(j); j-- > 0; ) x2.isOdd() && x2.iadd(delta), x2.iushrn(1);\n a.cmp(b) >= 0 ? (a.isub(b), x1.isub(x2)) : (b.isub(a), x2.isub(x1));\n }\n var res;\n return a.cmpn(1) === 0 ? (res = x1) : (res = x2), res.cmpn(0) < 0 && res.iadd(p), res;\n }),\n (BN.prototype.gcd = function (num) {\n if (this.isZero()) return num.abs();\n if (num.isZero()) return this.abs();\n var a = this.clone(),\n b = num.clone();\n (a.negative = 0), (b.negative = 0);\n for (var shift = 0; a.isEven() && b.isEven(); shift++) a.iushrn(1), b.iushrn(1);\n do {\n for (; a.isEven(); ) a.iushrn(1);\n for (; b.isEven(); ) b.iushrn(1);\n var r = a.cmp(b);\n if (r < 0) {\n var t = a;\n (a = b), (b = t);\n } else if (r === 0 || b.cmpn(1) === 0) break;\n a.isub(b);\n } while (!0);\n return b.iushln(shift);\n }),\n (BN.prototype.invm = function (num) {\n return this.egcd(num).a.umod(num);\n }),\n (BN.prototype.isEven = function () {\n return (this.words[0] & 1) === 0;\n }),\n (BN.prototype.isOdd = function () {\n return (this.words[0] & 1) === 1;\n }),\n (BN.prototype.andln = function (num) {\n return this.words[0] & num;\n }),\n (BN.prototype.bincn = function (bit) {\n assert(typeof bit == \"number\");\n var r = bit % 26,\n s = (bit - r) / 26,\n q = 1 << r;\n if (this.length <= s) return this._expand(s + 1), (this.words[s] |= q), this;\n for (var carry = q, i = s; carry !== 0 && i < this.length; i++) {\n var w = this.words[i] | 0;\n (w += carry), (carry = w >>> 26), (w &= 67108863), (this.words[i] = w);\n }\n return carry !== 0 && ((this.words[i] = carry), this.length++), this;\n }),\n (BN.prototype.isZero = function () {\n return this.length === 1 && this.words[0] === 0;\n }),\n (BN.prototype.cmpn = function (num) {\n var negative = num < 0;\n if (this.negative !== 0 && !negative) return -1;\n if (this.negative === 0 && negative) return 1;\n this.strip();\n var res;\n if (this.length > 1) res = 1;\n else {\n negative && (num = -num), assert(num <= 67108863, \"Number is too big\");\n var w = this.words[0] | 0;\n res = w === num ? 0 : w < num ? -1 : 1;\n }\n return this.negative !== 0 ? -res | 0 : res;\n }),\n (BN.prototype.cmp = function (num) {\n if (this.negative !== 0 && num.negative === 0) return -1;\n if (this.negative === 0 && num.negative !== 0) return 1;\n var res = this.ucmp(num);\n return this.negative !== 0 ? -res | 0 : res;\n }),\n (BN.prototype.ucmp = function (num) {\n if (this.length > num.length) return 1;\n if (this.length < num.length) return -1;\n for (var res = 0, i = this.length - 1; i >= 0; i--) {\n var a = this.words[i] | 0,\n b = num.words[i] | 0;\n if (a !== b) {\n a < b ? (res = -1) : a > b && (res = 1);\n break;\n }\n }\n return res;\n }),\n (BN.prototype.gtn = function (num) {\n return this.cmpn(num) === 1;\n }),\n (BN.prototype.gt = function (num) {\n return this.cmp(num) === 1;\n }),\n (BN.prototype.gten = function (num) {\n return this.cmpn(num) >= 0;\n }),\n (BN.prototype.gte = function (num) {\n return this.cmp(num) >= 0;\n }),\n (BN.prototype.ltn = function (num) {\n return this.cmpn(num) === -1;\n }),\n (BN.prototype.lt = function (num) {\n return this.cmp(num) === -1;\n }),\n (BN.prototype.lten = function (num) {\n return this.cmpn(num) <= 0;\n }),\n (BN.prototype.lte = function (num) {\n return this.cmp(num) <= 0;\n }),\n (BN.prototype.eqn = function (num) {\n return this.cmpn(num) === 0;\n }),\n (BN.prototype.eq = function (num) {\n return this.cmp(num) === 0;\n }),\n (BN.red = function (num) {\n return new Red(num);\n }),\n (BN.prototype.toRed = function (ctx) {\n return (\n assert(!this.red, \"Already a number in reduction context\"),\n assert(this.negative === 0, \"red works only with positives\"),\n ctx.convertTo(this)._forceRed(ctx)\n );\n }),\n (BN.prototype.fromRed = function () {\n return assert(this.red, \"fromRed works only with numbers in reduction context\"), this.red.convertFrom(this);\n }),\n (BN.prototype._forceRed = function (ctx) {\n return (this.red = ctx), this;\n }),\n (BN.prototype.forceRed = function (ctx) {\n return assert(!this.red, \"Already a number in reduction context\"), this._forceRed(ctx);\n }),\n (BN.prototype.redAdd = function (num) {\n return assert(this.red, \"redAdd works only with red numbers\"), this.red.add(this, num);\n }),\n (BN.prototype.redIAdd = function (num) {\n return assert(this.red, \"redIAdd works only with red numbers\"), this.red.iadd(this, num);\n }),\n (BN.prototype.redSub = function (num) {\n return assert(this.red, \"redSub works only with red numbers\"), this.red.sub(this, num);\n }),\n (BN.prototype.redISub = function (num) {\n return assert(this.red, \"redISub works only with red numbers\"), this.red.isub(this, num);\n }),\n (BN.prototype.redShl = function (num) {\n return assert(this.red, \"redShl works only with red numbers\"), this.red.shl(this, num);\n }),\n (BN.prototype.redMul = function (num) {\n return (\n assert(this.red, \"redMul works only with red numbers\"),\n this.red._verify2(this, num),\n this.red.mul(this, num)\n );\n }),\n (BN.prototype.redIMul = function (num) {\n return (\n assert(this.red, \"redMul works only with red numbers\"),\n this.red._verify2(this, num),\n this.red.imul(this, num)\n );\n }),\n (BN.prototype.redSqr = function () {\n return assert(this.red, \"redSqr works only with red numbers\"), this.red._verify1(this), this.red.sqr(this);\n }),\n (BN.prototype.redISqr = function () {\n return assert(this.red, \"redISqr works only with red numbers\"), this.red._verify1(this), this.red.isqr(this);\n }),\n (BN.prototype.redSqrt = function () {\n return assert(this.red, \"redSqrt works only with red numbers\"), this.red._verify1(this), this.red.sqrt(this);\n }),\n (BN.prototype.redInvm = function () {\n return assert(this.red, \"redInvm works only with red numbers\"), this.red._verify1(this), this.red.invm(this);\n }),\n (BN.prototype.redNeg = function () {\n return assert(this.red, \"redNeg works only with red numbers\"), this.red._verify1(this), this.red.neg(this);\n }),\n (BN.prototype.redPow = function (num) {\n return assert(this.red && !num.red, \"redPow(normalNum)\"), this.red._verify1(this), this.red.pow(this, num);\n });\n var primes = {\n k256: null,\n p224: null,\n p192: null,\n p25519: null,\n };\n function MPrime(name, p) {\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 (this.tmp = this._tmp());\n }\n (MPrime.prototype._tmp = function () {\n var tmp = new BN(null);\n return (tmp.words = new Array(Math.ceil(this.n / 13))), tmp;\n }),\n (MPrime.prototype.ireduce = function (num) {\n var r = num,\n rlen;\n do this.split(r, this.tmp), (r = this.imulK(r)), (r = r.iadd(this.tmp)), (rlen = r.bitLength());\n while (rlen > this.n);\n var cmp = rlen < this.n ? -1 : r.ucmp(this.p);\n return (\n cmp === 0\n ? ((r.words[0] = 0), (r.length = 1))\n : cmp > 0\n ? r.isub(this.p)\n : r.strip !== void 0\n ? r.strip()\n : r._strip(),\n r\n );\n }),\n (MPrime.prototype.split = function (input, out) {\n input.iushrn(this.n, 0, out);\n }),\n (MPrime.prototype.imulK = function (num) {\n return num.imul(this.k);\n });\n function K256() {\n MPrime.call(this, \"k256\", \"ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f\");\n }\n inherits(K256, MPrime),\n (K256.prototype.split = function (input, output) {\n for (var mask = 4194303, outLen = Math.min(input.length, 9), i = 0; i < outLen; i++)\n output.words[i] = input.words[i];\n if (((output.length = outLen), input.length <= 9)) {\n (input.words[0] = 0), (input.length = 1);\n return;\n }\n var prev = input.words[9];\n for (output.words[output.length++] = prev & mask, i = 10; i < input.length; i++) {\n var next = input.words[i] | 0;\n (input.words[i - 10] = ((next & mask) << 4) | (prev >>> 22)), (prev = next);\n }\n (prev >>>= 22),\n (input.words[i - 10] = prev),\n prev === 0 && input.length > 10 ? (input.length -= 10) : (input.length -= 9);\n }),\n (K256.prototype.imulK = function (num) {\n (num.words[num.length] = 0), (num.words[num.length + 1] = 0), (num.length += 2);\n for (var lo = 0, i = 0; i < num.length; i++) {\n var w = num.words[i] | 0;\n (lo += w * 977), (num.words[i] = lo & 67108863), (lo = w * 64 + ((lo / 67108864) | 0));\n }\n return (\n num.words[num.length - 1] === 0 && (num.length--, num.words[num.length - 1] === 0 && num.length--), num\n );\n });\n function P224() {\n MPrime.call(this, \"p224\", \"ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001\");\n }\n inherits(P224, MPrime);\n function P192() {\n MPrime.call(this, \"p192\", \"ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff\");\n }\n inherits(P192, MPrime);\n function P25519() {\n MPrime.call(this, \"25519\", \"7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed\");\n }\n inherits(P25519, MPrime),\n (P25519.prototype.imulK = function (num) {\n for (var carry = 0, i = 0; i < num.length; i++) {\n var hi = (num.words[i] | 0) * 19 + carry,\n lo = hi & 67108863;\n (hi >>>= 26), (num.words[i] = lo), (carry = hi);\n }\n return carry !== 0 && (num.words[num.length++] = carry), num;\n }),\n (BN._prime = function (name) {\n if (primes[name]) return primes[name];\n var prime2;\n if (name === \"k256\") prime2 = new K256();\n else if (name === \"p224\") prime2 = new P224();\n else if (name === \"p192\") prime2 = new P192();\n else if (name === \"p25519\") prime2 = new P25519();\n else throw new Error(\"Unknown prime \" + name);\n return (primes[name] = prime2), prime2;\n });\n function Red(m) {\n if (typeof m == \"string\") {\n var prime = BN._prime(m);\n (this.m = prime.p), (this.prime = prime);\n } else assert(m.gtn(1), \"modulus must be greater than 1\"), (this.m = m), (this.prime = null);\n }\n (Red.prototype._verify1 = function (a) {\n assert(a.negative === 0, \"red works only with positives\"), assert(a.red, \"red works only with red numbers\");\n }),\n (Red.prototype._verify2 = function (a, b) {\n assert((a.negative | b.negative) === 0, \"red works only with positives\"),\n assert(a.red && a.red === b.red, \"red works only with red numbers\");\n }),\n (Red.prototype.imod = function (a) {\n return this.prime ? this.prime.ireduce(a)._forceRed(this) : a.umod(this.m)._forceRed(this);\n }),\n (Red.prototype.neg = function (a) {\n return a.isZero() ? a.clone() : this.m.sub(a)._forceRed(this);\n }),\n (Red.prototype.add = function (a, b) {\n this._verify2(a, b);\n var res = a.add(b);\n return res.cmp(this.m) >= 0 && res.isub(this.m), res._forceRed(this);\n }),\n (Red.prototype.iadd = function (a, b) {\n this._verify2(a, b);\n var res = a.iadd(b);\n return res.cmp(this.m) >= 0 && res.isub(this.m), res;\n }),\n (Red.prototype.sub = function (a, b) {\n this._verify2(a, b);\n var res = a.sub(b);\n return res.cmpn(0) < 0 && res.iadd(this.m), res._forceRed(this);\n }),\n (Red.prototype.isub = function (a, b) {\n this._verify2(a, b);\n var res = a.isub(b);\n return res.cmpn(0) < 0 && res.iadd(this.m), res;\n }),\n (Red.prototype.shl = function (a, num) {\n return this._verify1(a), this.imod(a.ushln(num));\n }),\n (Red.prototype.imul = function (a, b) {\n return this._verify2(a, b), this.imod(a.imul(b));\n }),\n (Red.prototype.mul = function (a, b) {\n return this._verify2(a, b), this.imod(a.mul(b));\n }),\n (Red.prototype.isqr = function (a) {\n return this.imul(a, a.clone());\n }),\n (Red.prototype.sqr = function (a) {\n return this.mul(a, a);\n }),\n (Red.prototype.sqrt = function (a) {\n if (a.isZero()) return a.clone();\n var mod3 = this.m.andln(3);\n if ((assert(mod3 % 2 === 1), mod3 === 3)) {\n var pow = this.m.add(new BN(1)).iushrn(2);\n return this.pow(a, pow);\n }\n for (var q = this.m.subn(1), s = 0; !q.isZero() && q.andln(1) === 0; ) s++, q.iushrn(1);\n assert(!q.isZero());\n var one = new BN(1).toRed(this),\n nOne = one.redNeg(),\n lpow = this.m.subn(1).iushrn(1),\n z = this.m.bitLength();\n for (z = new BN(2 * z * z).toRed(this); this.pow(z, lpow).cmp(nOne) !== 0; ) z.redIAdd(nOne);\n for (\n var c = this.pow(z, q), r = this.pow(a, q.addn(1).iushrn(1)), t = this.pow(a, q), m = s;\n t.cmp(one) !== 0;\n\n ) {\n for (var tmp = t, i = 0; tmp.cmp(one) !== 0; i++) tmp = tmp.redSqr();\n assert(i < m);\n var b = this.pow(c, new BN(1).iushln(m - i - 1));\n (r = r.redMul(b)), (c = b.redSqr()), (t = t.redMul(c)), (m = i);\n }\n return r;\n }),\n (Red.prototype.invm = function (a) {\n var inv = a._invmp(this.m);\n return inv.negative !== 0 ? ((inv.negative = 0), this.imod(inv).redNeg()) : this.imod(inv);\n }),\n (Red.prototype.pow = function (a, num) {\n if (num.isZero()) return new BN(1).toRed(this);\n if (num.cmpn(1) === 0) return a.clone();\n var windowSize = 4,\n wnd = new Array(1 << windowSize);\n (wnd[0] = new BN(1).toRed(this)), (wnd[1] = a);\n for (var i = 2; i < wnd.length; i++) wnd[i] = this.mul(wnd[i - 1], a);\n var res = wnd[0],\n current = 0,\n currentLen = 0,\n start = num.bitLength() % 26;\n for (start === 0 && (start = 26), i = num.length - 1; i >= 0; i--) {\n for (var word = num.words[i], j = start - 1; j >= 0; j--) {\n var bit = (word >> j) & 1;\n if ((res !== wnd[0] && (res = this.sqr(res)), bit === 0 && current === 0)) {\n currentLen = 0;\n continue;\n }\n (current <<= 1),\n (current |= bit),\n currentLen++,\n !(currentLen !== windowSize && (i !== 0 || j !== 0)) &&\n ((res = this.mul(res, wnd[current])), (currentLen = 0), (current = 0));\n }\n start = 26;\n }\n return res;\n }),\n (Red.prototype.convertTo = function (num) {\n var r = num.umod(this.m);\n return r === num ? r.clone() : r;\n }),\n (Red.prototype.convertFrom = function (num) {\n var res = num.clone();\n return (res.red = null), res;\n }),\n (BN.mont = function (num) {\n return new Mont(num);\n });\n function Mont(m) {\n Red.call(this, m),\n (this.shift = this.m.bitLength()),\n this.shift % 26 !== 0 && (this.shift += 26 - (this.shift % 26)),\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 (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 (Mont.prototype.convertTo = function (num) {\n return this.imod(num.ushln(this.shift));\n }),\n (Mont.prototype.convertFrom = function (num) {\n var r = this.imod(num.mul(this.rinv));\n return (r.red = null), r;\n }),\n (Mont.prototype.imul = function (a, b) {\n if (a.isZero() || b.isZero()) return (a.words[0] = 0), (a.length = 1), a;\n var t = a.imul(b),\n c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m),\n u = t.isub(c).iushrn(this.shift),\n res = u;\n return (\n u.cmp(this.m) >= 0 ? (res = u.isub(this.m)) : u.cmpn(0) < 0 && (res = u.iadd(this.m)), res._forceRed(this)\n );\n }),\n (Mont.prototype.mul = function (a, b) {\n if (a.isZero() || b.isZero()) return new BN(0)._forceRed(this);\n var t = a.mul(b),\n c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m),\n u = t.isub(c).iushrn(this.shift),\n res = u;\n return (\n u.cmp(this.m) >= 0 ? (res = u.isub(this.m)) : u.cmpn(0) < 0 && (res = u.iadd(this.m)), res._forceRed(this)\n );\n }),\n (Mont.prototype.invm = function (a) {\n var res = this.imod(a._invmp(this.m).mul(this.r2));\n return res._forceRed(this);\n });\n })(typeof module > \"u\" || module, exports);\n },\n});\n\n// node_modules/safer-buffer/safer.js\nvar require_safer = __commonJS({\n \"node_modules/safer-buffer/safer.js\"(exports, module) {\n \"use strict\";\n var buffer = __require(\"buffer\"),\n Buffer2 = buffer.Buffer,\n safer = {},\n key;\n for (key in buffer)\n !buffer.hasOwnProperty(key) || key === \"SlowBuffer\" || key === \"Buffer\" || (safer[key] = buffer[key]);\n var Safer = (safer.Buffer = {});\n for (key in Buffer2)\n !Buffer2.hasOwnProperty(key) || key === \"allocUnsafe\" || key === \"allocUnsafeSlow\" || (Safer[key] = Buffer2[key]);\n safer.Buffer.prototype = Buffer2.prototype;\n (!Safer.from || Safer.from === Uint8Array.from) &&\n (Safer.from = function (value, encodingOrOffset, length) {\n if (typeof value == \"number\")\n throw new TypeError('The \"value\" argument must not be of type number. Received type ' + typeof value);\n if (value && typeof value.length > \"u\")\n throw new TypeError(\n \"The first argument must be one of type string, Buffer, ArrayBuffer, Array, or Array-like Object. Received type \" +\n typeof value,\n );\n return Buffer2(value, encodingOrOffset, length);\n });\n Safer.alloc ||\n (Safer.alloc = function (size, fill, encoding) {\n if (typeof size != \"number\")\n throw new TypeError('The \"size\" argument must be of type number. Received type ' + typeof size);\n if (size < 0 || size >= 2 * (1 << 30))\n throw new RangeError('The value \"' + size + '\" is invalid for option \"size\"');\n var buf = Buffer2(size);\n return (\n !fill || fill.length === 0\n ? buf.fill(0)\n : typeof encoding == \"string\"\n ? buf.fill(fill, encoding)\n : buf.fill(fill),\n buf\n );\n });\n if (!safer.kStringMaxLength)\n try {\n safer.kStringMaxLength = MAX_STRING_LENGTH;\n } catch {}\n safer.constants ||\n ((safer.constants = {\n MAX_LENGTH: safer.kMaxLength,\n }),\n safer.kStringMaxLength && (safer.constants.MAX_STRING_LENGTH = safer.kStringMaxLength));\n module.exports = safer;\n },\n});\n\n// node_modules/asn1.js/lib/asn1/base/reporter.js\nvar require_reporter = __commonJS({\n \"node_modules/asn1.js/lib/asn1/base/reporter.js\"(exports) {\n \"use strict\";\n var inherits = require_inherits_browser();\n function Reporter(options) {\n this._reporterState = {\n obj: null,\n path: [],\n options: options || {},\n errors: [],\n };\n }\n exports.Reporter = Reporter;\n Reporter.prototype.isError = function (obj) {\n return obj instanceof ReporterError;\n };\n Reporter.prototype.save = function () {\n let state = this._reporterState;\n return { obj: state.obj, pathLen: state.path.length };\n };\n Reporter.prototype.restore = function (data) {\n let state = this._reporterState;\n (state.obj = data.obj), (state.path = state.path.slice(0, data.pathLen));\n };\n Reporter.prototype.enterKey = function (key) {\n return this._reporterState.path.push(key);\n };\n Reporter.prototype.exitKey = function (index) {\n let state = this._reporterState;\n state.path = state.path.slice(0, index - 1);\n };\n Reporter.prototype.leaveKey = function (index, key, value) {\n let state = this._reporterState;\n this.exitKey(index), state.obj !== null && (state.obj[key] = value);\n };\n Reporter.prototype.path = function () {\n return this._reporterState.path.join(\"/\");\n };\n Reporter.prototype.enterObject = function () {\n let state = this._reporterState,\n prev = state.obj;\n return (state.obj = {}), prev;\n };\n Reporter.prototype.leaveObject = function (prev) {\n let state = this._reporterState,\n now = state.obj;\n return (state.obj = prev), now;\n };\n Reporter.prototype.error = function (msg) {\n let err,\n state = this._reporterState,\n inherited = msg instanceof ReporterError;\n if (\n (inherited\n ? (err = msg)\n : (err = new ReporterError(\n state.path\n .map(function (elem) {\n return \"[\" + JSON.stringify(elem) + \"]\";\n })\n .join(\"\"),\n msg.message || msg,\n msg.stack,\n )),\n !state.options.partial)\n )\n throw err;\n return inherited || state.errors.push(err), err;\n };\n Reporter.prototype.wrapResult = function (result) {\n let state = this._reporterState;\n return state.options.partial\n ? {\n result: this.isError(result) ? null : result,\n errors: state.errors,\n }\n : result;\n };\n function ReporterError(path, msg) {\n (this.path = path), this.rethrow(msg);\n }\n inherits(ReporterError, Error);\n ReporterError.prototype.rethrow = function (msg) {\n if (\n ((this.message = msg + \" at: \" + (this.path || \"(shallow)\")),\n Error.captureStackTrace && Error.captureStackTrace(this, ReporterError),\n !this.stack)\n )\n try {\n throw new Error(this.message);\n } catch (e) {\n this.stack = e.stack;\n }\n return this;\n };\n },\n});\n\n// node_modules/asn1.js/lib/asn1/base/buffer.js\nvar require_buffer = __commonJS({\n \"node_modules/asn1.js/lib/asn1/base/buffer.js\"(exports) {\n \"use strict\";\n var inherits = require_inherits_browser(),\n Reporter = require_reporter().Reporter,\n Buffer2 = require_safer().Buffer;\n function DecoderBuffer(base, options) {\n if ((Reporter.call(this, options), !Buffer2.isBuffer(base))) {\n this.error(\"Input not Buffer\");\n return;\n }\n (this.base = base), (this.offset = 0), (this.length = base.length);\n }\n inherits(DecoderBuffer, Reporter);\n exports.DecoderBuffer = DecoderBuffer;\n DecoderBuffer.isDecoderBuffer = function (data) {\n return data instanceof DecoderBuffer\n ? !0\n : typeof data == \"object\" &&\n Buffer2.isBuffer(data.base) &&\n data.constructor.name === \"DecoderBuffer\" &&\n typeof data.offset == \"number\" &&\n typeof data.length == \"number\" &&\n typeof data.save == \"function\" &&\n typeof data.restore == \"function\" &&\n typeof data.isEmpty == \"function\" &&\n typeof data.readUInt8 == \"function\" &&\n typeof data.skip == \"function\" &&\n typeof data.raw == \"function\";\n };\n DecoderBuffer.prototype.save = function () {\n return {\n offset: this.offset,\n reporter: Reporter.prototype.save.call(this),\n };\n };\n DecoderBuffer.prototype.restore = function (save) {\n let res = new DecoderBuffer(this.base);\n return (\n (res.offset = save.offset),\n (res.length = this.offset),\n (this.offset = save.offset),\n Reporter.prototype.restore.call(this, save.reporter),\n res\n );\n };\n DecoderBuffer.prototype.isEmpty = function () {\n return this.offset === this.length;\n };\n DecoderBuffer.prototype.readUInt8 = function (fail) {\n return this.offset + 1 <= this.length\n ? this.base.readUInt8(this.offset++, !0)\n : this.error(fail || \"DecoderBuffer overrun\");\n };\n DecoderBuffer.prototype.skip = function (bytes, fail) {\n if (!(this.offset + bytes <= this.length)) return this.error(fail || \"DecoderBuffer overrun\");\n let res = new DecoderBuffer(this.base);\n return (\n (res._reporterState = this._reporterState),\n (res.offset = this.offset),\n (res.length = this.offset + bytes),\n (this.offset += bytes),\n res\n );\n };\n DecoderBuffer.prototype.raw = function (save) {\n return this.base.slice(save ? save.offset : this.offset, this.length);\n };\n function EncoderBuffer(value, reporter) {\n if (Array.isArray(value))\n (this.length = 0),\n (this.value = value.map(function (item) {\n return (\n EncoderBuffer.isEncoderBuffer(item) || (item = new EncoderBuffer(item, reporter)),\n (this.length += item.length),\n item\n );\n }, this));\n else if (typeof value == \"number\") {\n if (!(0 <= value && value <= 255)) return reporter.error(\"non-byte EncoderBuffer value\");\n (this.value = value), (this.length = 1);\n } else if (typeof value == \"string\") (this.value = value), (this.length = Buffer2.byteLength(value));\n else if (Buffer2.isBuffer(value)) (this.value = value), (this.length = value.length);\n else return reporter.error(\"Unsupported type: \" + typeof value);\n }\n exports.EncoderBuffer = EncoderBuffer;\n EncoderBuffer.isEncoderBuffer = function (data) {\n return data instanceof EncoderBuffer\n ? !0\n : typeof data == \"object\" &&\n data.constructor.name === \"EncoderBuffer\" &&\n typeof data.length == \"number\" &&\n typeof data.join == \"function\";\n };\n EncoderBuffer.prototype.join = function (out, offset) {\n return (\n out || (out = Buffer2.alloc(this.length)),\n offset || (offset = 0),\n this.length === 0 ||\n (Array.isArray(this.value)\n ? this.value.forEach(function (item) {\n item.join(out, offset), (offset += item.length);\n })\n : (typeof this.value == \"number\"\n ? (out[offset] = this.value)\n : typeof this.value == \"string\"\n ? out.write(this.value, offset)\n : Buffer2.isBuffer(this.value) && this.value.copy(out, offset),\n (offset += this.length))),\n out\n );\n };\n },\n});\n\n// node_modules/asn1.js/lib/asn1/base/node.js\nvar require_node = __commonJS({\n \"node_modules/asn1.js/lib/asn1/base/node.js\"(exports, module) {\n \"use strict\";\n var Reporter = require_reporter().Reporter,\n EncoderBuffer = require_buffer().EncoderBuffer,\n DecoderBuffer = require_buffer().DecoderBuffer,\n assert = require_minimalistic_assert(),\n tags = [\n \"seq\",\n \"seqof\",\n \"set\",\n \"setof\",\n \"objid\",\n \"bool\",\n \"gentime\",\n \"utctime\",\n \"null_\",\n \"enum\",\n \"int\",\n \"objDesc\",\n \"bitstr\",\n \"bmpstr\",\n \"charstr\",\n \"genstr\",\n \"graphstr\",\n \"ia5str\",\n \"iso646str\",\n \"numstr\",\n \"octstr\",\n \"printstr\",\n \"t61str\",\n \"unistr\",\n \"utf8str\",\n \"videostr\",\n ],\n methods = [\"key\", \"obj\", \"use\", \"optional\", \"explicit\", \"implicit\", \"def\", \"choice\", \"any\", \"contains\"].concat(\n tags,\n ),\n overrided = [\n \"_peekTag\",\n \"_decodeTag\",\n \"_use\",\n \"_decodeStr\",\n \"_decodeObjid\",\n \"_decodeTime\",\n \"_decodeNull\",\n \"_decodeInt\",\n \"_decodeBool\",\n \"_decodeList\",\n \"_encodeComposite\",\n \"_encodeStr\",\n \"_encodeObjid\",\n \"_encodeTime\",\n \"_encodeNull\",\n \"_encodeInt\",\n \"_encodeBool\",\n ];\n function Node(enc, parent, name) {\n let state = {};\n (this._baseState = state),\n (state.name = name),\n (state.enc = enc),\n (state.parent = parent || null),\n (state.children = null),\n (state.tag = null),\n (state.args = null),\n (state.reverseArgs = null),\n (state.choice = null),\n (state.optional = !1),\n (state.any = !1),\n (state.obj = !1),\n (state.use = null),\n (state.useDecoder = null),\n (state.key = null),\n (state.default = null),\n (state.explicit = null),\n (state.implicit = null),\n (state.contains = null),\n state.parent || ((state.children = []), this._wrap());\n }\n module.exports = Node;\n var stateProps = [\n \"enc\",\n \"parent\",\n \"children\",\n \"tag\",\n \"args\",\n \"reverseArgs\",\n \"choice\",\n \"optional\",\n \"any\",\n \"obj\",\n \"use\",\n \"alteredUse\",\n \"key\",\n \"default\",\n \"explicit\",\n \"implicit\",\n \"contains\",\n ];\n Node.prototype.clone = function () {\n let state = this._baseState,\n cstate = {};\n stateProps.forEach(function (prop) {\n cstate[prop] = state[prop];\n });\n let res = new this.constructor(cstate.parent);\n return (res._baseState = cstate), res;\n };\n Node.prototype._wrap = function () {\n let state = this._baseState;\n methods.forEach(function (method) {\n this[method] = function () {\n let clone = new this.constructor(this);\n return state.children.push(clone), clone[method].apply(clone, arguments);\n };\n }, this);\n };\n Node.prototype._init = function (body) {\n let state = this._baseState;\n assert(state.parent === null),\n body.call(this),\n (state.children = state.children.filter(function (child) {\n return child._baseState.parent === this;\n }, this)),\n assert.equal(state.children.length, 1, \"Root node can have only one child\");\n };\n Node.prototype._useArgs = function (args) {\n let state = this._baseState,\n children = args.filter(function (arg) {\n return arg instanceof this.constructor;\n }, this);\n (args = args.filter(function (arg) {\n return !(arg instanceof this.constructor);\n }, this)),\n children.length !== 0 &&\n (assert(state.children === null),\n (state.children = children),\n children.forEach(function (child) {\n child._baseState.parent = this;\n }, this)),\n args.length !== 0 &&\n (assert(state.args === null),\n (state.args = args),\n (state.reverseArgs = args.map(function (arg) {\n if (typeof arg != \"object\" || arg.constructor !== Object) return arg;\n let res = {};\n return (\n Object.keys(arg).forEach(function (key) {\n key == (key | 0) && (key |= 0);\n let value = arg[key];\n res[value] = key;\n }),\n res\n );\n })));\n };\n overrided.forEach(function (method) {\n Node.prototype[method] = function () {\n let state = this._baseState;\n throw new Error(method + \" not implemented for encoding: \" + state.enc);\n };\n });\n tags.forEach(function (tag) {\n Node.prototype[tag] = function () {\n let state = this._baseState,\n args = Array.prototype.slice.call(arguments);\n return assert(state.tag === null), (state.tag = tag), this._useArgs(args), this;\n };\n });\n Node.prototype.use = function (item) {\n assert(item);\n let state = this._baseState;\n return assert(state.use === null), (state.use = item), this;\n };\n Node.prototype.optional = function () {\n let state = this._baseState;\n return (state.optional = !0), this;\n };\n Node.prototype.def = function (val) {\n let state = this._baseState;\n return assert(state.default === null), (state.default = val), (state.optional = !0), this;\n };\n Node.prototype.explicit = function (num) {\n let state = this._baseState;\n return assert(state.explicit === null && state.implicit === null), (state.explicit = num), this;\n };\n Node.prototype.implicit = function (num) {\n let state = this._baseState;\n return assert(state.explicit === null && state.implicit === null), (state.implicit = num), this;\n };\n Node.prototype.obj = function () {\n let state = this._baseState,\n args = Array.prototype.slice.call(arguments);\n return (state.obj = !0), args.length !== 0 && this._useArgs(args), this;\n };\n Node.prototype.key = function (newKey) {\n let state = this._baseState;\n return assert(state.key === null), (state.key = newKey), this;\n };\n Node.prototype.any = function () {\n let state = this._baseState;\n return (state.any = !0), this;\n };\n Node.prototype.choice = function (obj) {\n let state = this._baseState;\n return (\n assert(state.choice === null),\n (state.choice = obj),\n this._useArgs(\n Object.keys(obj).map(function (key) {\n return obj[key];\n }),\n ),\n this\n );\n };\n Node.prototype.contains = function (item) {\n let state = this._baseState;\n return assert(state.use === null), (state.contains = item), this;\n };\n Node.prototype._decode = function (input, options) {\n let state = this._baseState;\n if (state.parent === null) return input.wrapResult(state.children[0]._decode(input, options));\n let result = state.default,\n present = !0,\n prevKey = null;\n if ((state.key !== null && (prevKey = input.enterKey(state.key)), state.optional)) {\n let tag = null;\n if (\n (state.explicit !== null\n ? (tag = state.explicit)\n : state.implicit !== null\n ? (tag = state.implicit)\n : state.tag !== null && (tag = state.tag),\n tag === null && !state.any)\n ) {\n let save = input.save();\n try {\n state.choice === null ? this._decodeGeneric(state.tag, input, options) : this._decodeChoice(input, options),\n (present = !0);\n } catch {\n present = !1;\n }\n input.restore(save);\n } else if (((present = this._peekTag(input, tag, state.any)), input.isError(present))) return present;\n }\n let prevObj;\n if ((state.obj && present && (prevObj = input.enterObject()), present)) {\n if (state.explicit !== null) {\n let explicit = this._decodeTag(input, state.explicit);\n if (input.isError(explicit)) return explicit;\n input = explicit;\n }\n let start = input.offset;\n if (state.use === null && state.choice === null) {\n let save;\n state.any && (save = input.save());\n let body = this._decodeTag(input, state.implicit !== null ? state.implicit : state.tag, state.any);\n if (input.isError(body)) return body;\n state.any ? (result = input.raw(save)) : (input = body);\n }\n if (\n (options && options.track && state.tag !== null && options.track(input.path(), start, input.length, \"tagged\"),\n options &&\n options.track &&\n state.tag !== null &&\n options.track(input.path(), input.offset, input.length, \"content\"),\n state.any ||\n (state.choice === null\n ? (result = this._decodeGeneric(state.tag, input, options))\n : (result = this._decodeChoice(input, options))),\n input.isError(result))\n )\n return result;\n if (\n (!state.any &&\n state.choice === null &&\n state.children !== null &&\n state.children.forEach(function (child) {\n child._decode(input, options);\n }),\n state.contains && (state.tag === \"octstr\" || state.tag === \"bitstr\"))\n ) {\n let data = new DecoderBuffer(result);\n result = this._getUse(state.contains, input._reporterState.obj)._decode(data, options);\n }\n }\n return (\n state.obj && present && (result = input.leaveObject(prevObj)),\n state.key !== null && (result !== null || present === !0)\n ? input.leaveKey(prevKey, state.key, result)\n : prevKey !== null && input.exitKey(prevKey),\n result\n );\n };\n Node.prototype._decodeGeneric = function (tag, input, options) {\n let state = this._baseState;\n return tag === \"seq\" || tag === \"set\"\n ? null\n : tag === \"seqof\" || tag === \"setof\"\n ? this._decodeList(input, tag, state.args[0], options)\n : /str$/.test(tag)\n ? this._decodeStr(input, tag, options)\n : tag === \"objid\" && state.args\n ? this._decodeObjid(input, state.args[0], state.args[1], options)\n : tag === \"objid\"\n ? this._decodeObjid(input, null, null, options)\n : tag === \"gentime\" || tag === \"utctime\"\n ? this._decodeTime(input, tag, options)\n : tag === \"null_\"\n ? this._decodeNull(input, options)\n : tag === \"bool\"\n ? this._decodeBool(input, options)\n : tag === \"objDesc\"\n ? this._decodeStr(input, tag, options)\n : tag === \"int\" || tag === \"enum\"\n ? this._decodeInt(input, state.args && state.args[0], options)\n : state.use !== null\n ? this._getUse(state.use, input._reporterState.obj)._decode(input, options)\n : input.error(\"unknown tag: \" + tag);\n };\n Node.prototype._getUse = function (entity, obj) {\n let state = this._baseState;\n return (\n (state.useDecoder = this._use(entity, obj)),\n assert(state.useDecoder._baseState.parent === null),\n (state.useDecoder = state.useDecoder._baseState.children[0]),\n state.implicit !== state.useDecoder._baseState.implicit &&\n ((state.useDecoder = state.useDecoder.clone()), (state.useDecoder._baseState.implicit = state.implicit)),\n state.useDecoder\n );\n };\n Node.prototype._decodeChoice = function (input, options) {\n let state = this._baseState,\n result = null,\n match = !1;\n return (\n Object.keys(state.choice).some(function (key) {\n let save = input.save(),\n node = state.choice[key];\n try {\n let value = node._decode(input, options);\n if (input.isError(value)) return !1;\n (result = { type: key, value }), (match = !0);\n } catch {\n return input.restore(save), !1;\n }\n return !0;\n }, this),\n match ? result : input.error(\"Choice not matched\")\n );\n };\n Node.prototype._createEncoderBuffer = function (data) {\n return new EncoderBuffer(data, this.reporter);\n };\n Node.prototype._encode = function (data, reporter, parent) {\n let state = this._baseState;\n if (state.default !== null && state.default === data) return;\n let result = this._encodeValue(data, reporter, parent);\n if (result !== void 0 && !this._skipDefault(result, reporter, parent)) return result;\n };\n Node.prototype._encodeValue = function (data, reporter, parent) {\n let state = this._baseState;\n if (state.parent === null) return state.children[0]._encode(data, reporter || new Reporter());\n let result = null;\n if (((this.reporter = reporter), state.optional && data === void 0))\n if (state.default !== null) data = state.default;\n else return;\n let content = null,\n primitive = !1;\n if (state.any) result = this._createEncoderBuffer(data);\n else if (state.choice) result = this._encodeChoice(data, reporter);\n else if (state.contains)\n (content = this._getUse(state.contains, parent)._encode(data, reporter)), (primitive = !0);\n else if (state.children)\n (content = state.children\n .map(function (child) {\n if (child._baseState.tag === \"null_\") return child._encode(null, reporter, data);\n if (child._baseState.key === null) return reporter.error(\"Child should have a key\");\n let prevKey = reporter.enterKey(child._baseState.key);\n if (typeof data != \"object\") return reporter.error(\"Child expected, but input is not object\");\n let res = child._encode(data[child._baseState.key], reporter, data);\n return reporter.leaveKey(prevKey), res;\n }, this)\n .filter(function (child) {\n return child;\n })),\n (content = this._createEncoderBuffer(content));\n else if (state.tag === \"seqof\" || state.tag === \"setof\") {\n if (!(state.args && state.args.length === 1)) return reporter.error(\"Too many args for : \" + state.tag);\n if (!Array.isArray(data)) return reporter.error(\"seqof/setof, but data is not Array\");\n let child = this.clone();\n (child._baseState.implicit = null),\n (content = this._createEncoderBuffer(\n data.map(function (item) {\n let state2 = this._baseState;\n return this._getUse(state2.args[0], data)._encode(item, reporter);\n }, child),\n ));\n } else\n state.use !== null\n ? (result = this._getUse(state.use, parent)._encode(data, reporter))\n : ((content = this._encodePrimitive(state.tag, data)), (primitive = !0));\n if (!state.any && state.choice === null) {\n let tag = state.implicit !== null ? state.implicit : state.tag,\n cls = state.implicit === null ? \"universal\" : \"context\";\n tag === null\n ? state.use === null && reporter.error(\"Tag could be omitted only for .use()\")\n : state.use === null && (result = this._encodeComposite(tag, primitive, cls, content));\n }\n return state.explicit !== null && (result = this._encodeComposite(state.explicit, !1, \"context\", result)), result;\n };\n Node.prototype._encodeChoice = function (data, reporter) {\n let state = this._baseState,\n node = state.choice[data.type];\n return (\n node || assert(!1, data.type + \" not found in \" + JSON.stringify(Object.keys(state.choice))),\n node._encode(data.value, reporter)\n );\n };\n Node.prototype._encodePrimitive = function (tag, data) {\n let state = this._baseState;\n if (/str$/.test(tag)) return this._encodeStr(data, tag);\n if (tag === \"objid\" && state.args) return this._encodeObjid(data, state.reverseArgs[0], state.args[1]);\n if (tag === \"objid\") return this._encodeObjid(data, null, null);\n if (tag === \"gentime\" || tag === \"utctime\") return this._encodeTime(data, tag);\n if (tag === \"null_\") return this._encodeNull();\n if (tag === \"int\" || tag === \"enum\") return this._encodeInt(data, state.args && state.reverseArgs[0]);\n if (tag === \"bool\") return this._encodeBool(data);\n if (tag === \"objDesc\") return this._encodeStr(data, tag);\n throw new Error(\"Unsupported tag: \" + tag);\n };\n Node.prototype._isNumstr = function (str) {\n return /^[0-9 ]*$/.test(str);\n };\n Node.prototype._isPrintstr = function (str) {\n return /^[A-Za-z0-9 '()+,-./:=?]*$/.test(str);\n };\n },\n});\n\n// node_modules/asn1.js/lib/asn1/constants/der.js\nvar require_der = __commonJS({\n \"node_modules/asn1.js/lib/asn1/constants/der.js\"(exports) {\n \"use strict\";\n function reverse(map) {\n let res = {};\n return (\n Object.keys(map).forEach(function (key) {\n (key | 0) == key && (key = key | 0);\n let value = map[key];\n res[value] = key;\n }),\n res\n );\n }\n exports.tagClass = {\n 0: \"universal\",\n 1: \"application\",\n 2: \"context\",\n 3: \"private\",\n };\n exports.tagClassByName = reverse(exports.tagClass);\n exports.tag = {\n 0: \"end\",\n 1: \"bool\",\n 2: \"int\",\n 3: \"bitstr\",\n 4: \"octstr\",\n 5: \"null_\",\n 6: \"objid\",\n 7: \"objDesc\",\n 8: \"external\",\n 9: \"real\",\n 10: \"enum\",\n 11: \"embed\",\n 12: \"utf8str\",\n 13: \"relativeOid\",\n 16: \"seq\",\n 17: \"set\",\n 18: \"numstr\",\n 19: \"printstr\",\n 20: \"t61str\",\n 21: \"videostr\",\n 22: \"ia5str\",\n 23: \"utctime\",\n 24: \"gentime\",\n 25: \"graphstr\",\n 26: \"iso646str\",\n 27: \"genstr\",\n 28: \"unistr\",\n 29: \"charstr\",\n 30: \"bmpstr\",\n };\n exports.tagByName = reverse(exports.tag);\n },\n});\n\n// node_modules/asn1.js/lib/asn1/encoders/der.js\nvar require_der2 = __commonJS({\n \"node_modules/asn1.js/lib/asn1/encoders/der.js\"(exports, module) {\n \"use strict\";\n var inherits = require_inherits_browser(),\n Buffer2 = require_safer().Buffer,\n Node = require_node(),\n der = require_der();\n function DEREncoder(entity) {\n (this.enc = \"der\"),\n (this.name = entity.name),\n (this.entity = entity),\n (this.tree = new DERNode()),\n this.tree._init(entity.body);\n }\n module.exports = DEREncoder;\n DEREncoder.prototype.encode = function (data, reporter) {\n return this.tree._encode(data, reporter).join();\n };\n function DERNode(parent) {\n Node.call(this, \"der\", parent);\n }\n inherits(DERNode, Node);\n DERNode.prototype._encodeComposite = function (tag, primitive, cls, content) {\n let encodedTag = encodeTag(tag, primitive, cls, this.reporter);\n if (content.length < 128) {\n let header2 = Buffer2.alloc(2);\n return (header2[0] = encodedTag), (header2[1] = content.length), this._createEncoderBuffer([header2, content]);\n }\n let lenOctets = 1;\n for (let i = content.length; i >= 256; i >>= 8) lenOctets++;\n let header = Buffer2.alloc(1 + 1 + lenOctets);\n (header[0] = encodedTag), (header[1] = 128 | lenOctets);\n for (let i = 1 + lenOctets, j = content.length; j > 0; i--, j >>= 8) header[i] = j & 255;\n return this._createEncoderBuffer([header, content]);\n };\n DERNode.prototype._encodeStr = function (str, tag) {\n if (tag === \"bitstr\") return this._createEncoderBuffer([str.unused | 0, str.data]);\n if (tag === \"bmpstr\") {\n let buf = Buffer2.alloc(str.length * 2);\n for (let i = 0; i < str.length; i++) buf.writeUInt16BE(str.charCodeAt(i), i * 2);\n return this._createEncoderBuffer(buf);\n } else\n return tag === \"numstr\"\n ? this._isNumstr(str)\n ? this._createEncoderBuffer(str)\n : this.reporter.error(\"Encoding of string type: numstr supports only digits and space\")\n : tag === \"printstr\"\n ? this._isPrintstr(str)\n ? this._createEncoderBuffer(str)\n : this.reporter.error(\n \"Encoding of string type: printstr supports only latin upper and lower case letters, digits, space, apostrophe, left and rigth parenthesis, plus sign, comma, hyphen, dot, slash, colon, equal sign, question mark\",\n )\n : /str$/.test(tag)\n ? this._createEncoderBuffer(str)\n : tag === \"objDesc\"\n ? this._createEncoderBuffer(str)\n : this.reporter.error(\"Encoding of string type: \" + tag + \" unsupported\");\n };\n DERNode.prototype._encodeObjid = function (id, values, relative) {\n if (typeof id == \"string\") {\n if (!values) return this.reporter.error(\"string objid given, but no values map found\");\n if (!values.hasOwnProperty(id)) return this.reporter.error(\"objid not found in values map\");\n id = values[id].split(/[\\s.]+/g);\n for (let i = 0; i < id.length; i++) id[i] |= 0;\n } else if (Array.isArray(id)) {\n id = id.slice();\n for (let i = 0; i < id.length; i++) id[i] |= 0;\n }\n if (!Array.isArray(id))\n return this.reporter.error(\"objid() should be either array or string, got: \" + JSON.stringify(id));\n if (!relative) {\n if (id[1] >= 40) return this.reporter.error(\"Second objid identifier OOB\");\n id.splice(0, 2, id[0] * 40 + id[1]);\n }\n let size = 0;\n for (let i = 0; i < id.length; i++) {\n let ident = id[i];\n for (size++; ident >= 128; ident >>= 7) size++;\n }\n let objid = Buffer2.alloc(size),\n offset = objid.length - 1;\n for (let i = id.length - 1; i >= 0; i--) {\n let ident = id[i];\n for (objid[offset--] = ident & 127; (ident >>= 7) > 0; ) objid[offset--] = 128 | (ident & 127);\n }\n return this._createEncoderBuffer(objid);\n };\n function two(num) {\n return num < 10 ? \"0\" + num : num;\n }\n DERNode.prototype._encodeTime = function (time, tag) {\n let str,\n date = new Date(time);\n return (\n tag === \"gentime\"\n ? (str = [\n two(date.getUTCFullYear()),\n two(date.getUTCMonth() + 1),\n two(date.getUTCDate()),\n two(date.getUTCHours()),\n two(date.getUTCMinutes()),\n two(date.getUTCSeconds()),\n \"Z\",\n ].join(\"\"))\n : tag === \"utctime\"\n ? (str = [\n two(date.getUTCFullYear() % 100),\n two(date.getUTCMonth() + 1),\n two(date.getUTCDate()),\n two(date.getUTCHours()),\n two(date.getUTCMinutes()),\n two(date.getUTCSeconds()),\n \"Z\",\n ].join(\"\"))\n : this.reporter.error(\"Encoding \" + tag + \" time is not supported yet\"),\n this._encodeStr(str, \"octstr\")\n );\n };\n DERNode.prototype._encodeNull = function () {\n return this._createEncoderBuffer(\"\");\n };\n DERNode.prototype._encodeInt = function (num, values) {\n if (typeof num == \"string\") {\n if (!values) return this.reporter.error(\"String int or enum given, but no values map\");\n if (!values.hasOwnProperty(num))\n return this.reporter.error(\"Values map doesn't contain: \" + JSON.stringify(num));\n num = values[num];\n }\n if (typeof num != \"number\" && !Buffer2.isBuffer(num)) {\n let numArray = num.toArray();\n !num.sign && numArray[0] & 128 && numArray.unshift(0), (num = Buffer2.from(numArray));\n }\n if (Buffer2.isBuffer(num)) {\n let size2 = num.length;\n num.length === 0 && size2++;\n let out2 = Buffer2.alloc(size2);\n return num.copy(out2), num.length === 0 && (out2[0] = 0), this._createEncoderBuffer(out2);\n }\n if (num < 128) return this._createEncoderBuffer(num);\n if (num < 256) return this._createEncoderBuffer([0, num]);\n let size = 1;\n for (let i = num; i >= 256; i >>= 8) size++;\n let out = new Array(size);\n for (let i = out.length - 1; i >= 0; i--) (out[i] = num & 255), (num >>= 8);\n return out[0] & 128 && out.unshift(0), this._createEncoderBuffer(Buffer2.from(out));\n };\n DERNode.prototype._encodeBool = function (value) {\n return this._createEncoderBuffer(value ? 255 : 0);\n };\n DERNode.prototype._use = function (entity, obj) {\n return typeof entity == \"function\" && (entity = entity(obj)), entity._getEncoder(\"der\").tree;\n };\n DERNode.prototype._skipDefault = function (dataBuffer, reporter, parent) {\n let state = this._baseState,\n i;\n if (state.default === null) return !1;\n let data = dataBuffer.join();\n if (\n (state.defaultBuffer === void 0 &&\n (state.defaultBuffer = this._encodeValue(state.default, reporter, parent).join()),\n data.length !== state.defaultBuffer.length)\n )\n return !1;\n for (i = 0; i < data.length; i++) if (data[i] !== state.defaultBuffer[i]) return !1;\n return !0;\n };\n function encodeTag(tag, primitive, cls, reporter) {\n let res;\n if ((tag === \"seqof\" ? (tag = \"seq\") : tag === \"setof\" && (tag = \"set\"), der.tagByName.hasOwnProperty(tag)))\n res = der.tagByName[tag];\n else if (typeof tag == \"number\" && (tag | 0) === tag) res = tag;\n else return reporter.error(\"Unknown tag: \" + tag);\n return res >= 31\n ? reporter.error(\"Multi-octet tag encoding unsupported\")\n : (primitive || (res |= 32), (res |= der.tagClassByName[cls || \"universal\"] << 6), res);\n }\n },\n});\n\n// node_modules/asn1.js/lib/asn1/encoders/pem.js\nvar require_pem = __commonJS({\n \"node_modules/asn1.js/lib/asn1/encoders/pem.js\"(exports, module) {\n \"use strict\";\n var inherits = require_inherits_browser(),\n DEREncoder = require_der2();\n function PEMEncoder(entity) {\n DEREncoder.call(this, entity), (this.enc = \"pem\");\n }\n inherits(PEMEncoder, DEREncoder);\n module.exports = PEMEncoder;\n PEMEncoder.prototype.encode = function (data, options) {\n let p = DEREncoder.prototype.encode.call(this, data).toString(\"base64\"),\n out = [\"-----BEGIN \" + options.label + \"-----\"];\n for (let i = 0; i < p.length; i += 64) out.push(p.slice(i, i + 64));\n return (\n out.push(\"-----END \" + options.label + \"-----\"),\n out.join(`\n`)\n );\n };\n },\n});\n\n// node_modules/asn1.js/lib/asn1/encoders/index.js\nvar require_encoders = __commonJS({\n \"node_modules/asn1.js/lib/asn1/encoders/index.js\"(exports) {\n \"use strict\";\n var encoders = exports;\n encoders.der = require_der2();\n encoders.pem = require_pem();\n },\n});\n\n// node_modules/asn1.js/lib/asn1/decoders/der.js\nvar require_der3 = __commonJS({\n \"node_modules/asn1.js/lib/asn1/decoders/der.js\"(exports, module) {\n \"use strict\";\n var inherits = require_inherits_browser(),\n bignum = require_bn5(),\n DecoderBuffer = require_buffer().DecoderBuffer,\n Node = require_node(),\n der = require_der();\n function DERDecoder(entity) {\n (this.enc = \"der\"),\n (this.name = entity.name),\n (this.entity = entity),\n (this.tree = new DERNode()),\n this.tree._init(entity.body);\n }\n module.exports = DERDecoder;\n DERDecoder.prototype.decode = function (data, options) {\n return (\n DecoderBuffer.isDecoderBuffer(data) || (data = new DecoderBuffer(data, options)),\n this.tree._decode(data, options)\n );\n };\n function DERNode(parent) {\n Node.call(this, \"der\", parent);\n }\n inherits(DERNode, Node);\n DERNode.prototype._peekTag = function (buffer, tag, any) {\n if (buffer.isEmpty()) return !1;\n let state = buffer.save(),\n decodedTag = derDecodeTag(buffer, 'Failed to peek tag: \"' + tag + '\"');\n return buffer.isError(decodedTag)\n ? decodedTag\n : (buffer.restore(state),\n decodedTag.tag === tag || decodedTag.tagStr === tag || decodedTag.tagStr + \"of\" === tag || any);\n };\n DERNode.prototype._decodeTag = function (buffer, tag, any) {\n let decodedTag = derDecodeTag(buffer, 'Failed to decode tag of \"' + tag + '\"');\n if (buffer.isError(decodedTag)) return decodedTag;\n let len = derDecodeLen(buffer, decodedTag.primitive, 'Failed to get length of \"' + tag + '\"');\n if (buffer.isError(len)) return len;\n if (!any && decodedTag.tag !== tag && decodedTag.tagStr !== tag && decodedTag.tagStr + \"of\" !== tag)\n return buffer.error('Failed to match tag: \"' + tag + '\"');\n if (decodedTag.primitive || len !== null) return buffer.skip(len, 'Failed to match body of: \"' + tag + '\"');\n let state = buffer.save(),\n res = this._skipUntilEnd(buffer, 'Failed to skip indefinite length body: \"' + this.tag + '\"');\n return buffer.isError(res)\n ? res\n : ((len = buffer.offset - state.offset),\n buffer.restore(state),\n buffer.skip(len, 'Failed to match body of: \"' + tag + '\"'));\n };\n DERNode.prototype._skipUntilEnd = function (buffer, fail) {\n for (;;) {\n let tag = derDecodeTag(buffer, fail);\n if (buffer.isError(tag)) return tag;\n let len = derDecodeLen(buffer, tag.primitive, fail);\n if (buffer.isError(len)) return len;\n let res;\n if (\n (tag.primitive || len !== null ? (res = buffer.skip(len)) : (res = this._skipUntilEnd(buffer, fail)),\n buffer.isError(res))\n )\n return res;\n if (tag.tagStr === \"end\") break;\n }\n };\n DERNode.prototype._decodeList = function (buffer, tag, decoder, options) {\n let result = [];\n for (; !buffer.isEmpty(); ) {\n let possibleEnd = this._peekTag(buffer, \"end\");\n if (buffer.isError(possibleEnd)) return possibleEnd;\n let res = decoder.decode(buffer, \"der\", options);\n if (buffer.isError(res) && possibleEnd) break;\n result.push(res);\n }\n return result;\n };\n DERNode.prototype._decodeStr = function (buffer, tag) {\n if (tag === \"bitstr\") {\n let unused = buffer.readUInt8();\n return buffer.isError(unused) ? unused : { unused, data: buffer.raw() };\n } else if (tag === \"bmpstr\") {\n let raw = buffer.raw();\n if (raw.length % 2 === 1) return buffer.error(\"Decoding of string type: bmpstr length mismatch\");\n let str = \"\";\n for (let i = 0; i < raw.length / 2; i++) str += String.fromCharCode(raw.readUInt16BE(i * 2));\n return str;\n } else if (tag === \"numstr\") {\n let numstr = buffer.raw().toString(\"ascii\");\n return this._isNumstr(numstr) ? numstr : buffer.error(\"Decoding of string type: numstr unsupported characters\");\n } else {\n if (tag === \"octstr\") return buffer.raw();\n if (tag === \"objDesc\") return buffer.raw();\n if (tag === \"printstr\") {\n let printstr = buffer.raw().toString(\"ascii\");\n return this._isPrintstr(printstr)\n ? printstr\n : buffer.error(\"Decoding of string type: printstr unsupported characters\");\n } else\n return /str$/.test(tag)\n ? buffer.raw().toString()\n : buffer.error(\"Decoding of string type: \" + tag + \" unsupported\");\n }\n };\n DERNode.prototype._decodeObjid = function (buffer, values, relative) {\n let result,\n identifiers = [],\n ident = 0,\n subident = 0;\n for (; !buffer.isEmpty(); )\n (subident = buffer.readUInt8()),\n (ident <<= 7),\n (ident |= subident & 127),\n (subident & 128) === 0 && (identifiers.push(ident), (ident = 0));\n subident & 128 && identifiers.push(ident);\n let first = (identifiers[0] / 40) | 0,\n second = identifiers[0] % 40;\n if ((relative ? (result = identifiers) : (result = [first, second].concat(identifiers.slice(1))), values)) {\n let tmp = values[result.join(\" \")];\n tmp === void 0 && (tmp = values[result.join(\".\")]), tmp !== void 0 && (result = tmp);\n }\n return result;\n };\n DERNode.prototype._decodeTime = function (buffer, tag) {\n let str = buffer.raw().toString(),\n year,\n mon,\n day,\n hour,\n min,\n sec;\n if (tag === \"gentime\")\n (year = str.slice(0, 4) | 0),\n (mon = str.slice(4, 6) | 0),\n (day = str.slice(6, 8) | 0),\n (hour = str.slice(8, 10) | 0),\n (min = str.slice(10, 12) | 0),\n (sec = str.slice(12, 14) | 0);\n else if (tag === \"utctime\")\n (year = str.slice(0, 2) | 0),\n (mon = str.slice(2, 4) | 0),\n (day = str.slice(4, 6) | 0),\n (hour = str.slice(6, 8) | 0),\n (min = str.slice(8, 10) | 0),\n (sec = str.slice(10, 12) | 0),\n year < 70 ? (year = 2e3 + year) : (year = 1900 + year);\n else return buffer.error(\"Decoding \" + tag + \" time is not supported yet\");\n return Date.UTC(year, mon - 1, day, hour, min, sec, 0);\n };\n DERNode.prototype._decodeNull = function () {\n return null;\n };\n DERNode.prototype._decodeBool = function (buffer) {\n let res = buffer.readUInt8();\n return buffer.isError(res) ? res : res !== 0;\n };\n DERNode.prototype._decodeInt = function (buffer, values) {\n let raw = buffer.raw(),\n res = new bignum(raw);\n return values && (res = values[res.toString(10)] || res), res;\n };\n DERNode.prototype._use = function (entity, obj) {\n return typeof entity == \"function\" && (entity = entity(obj)), entity._getDecoder(\"der\").tree;\n };\n function derDecodeTag(buf, fail) {\n let tag = buf.readUInt8(fail);\n if (buf.isError(tag)) return tag;\n let cls = der.tagClass[tag >> 6],\n primitive = (tag & 32) === 0;\n if ((tag & 31) === 31) {\n let oct = tag;\n for (tag = 0; (oct & 128) === 128; ) {\n if (((oct = buf.readUInt8(fail)), buf.isError(oct))) return oct;\n (tag <<= 7), (tag |= oct & 127);\n }\n } else tag &= 31;\n let tagStr = der.tag[tag];\n return {\n cls,\n primitive,\n tag,\n tagStr,\n };\n }\n function derDecodeLen(buf, primitive, fail) {\n let len = buf.readUInt8(fail);\n if (buf.isError(len)) return len;\n if (!primitive && len === 128) return null;\n if ((len & 128) === 0) return len;\n let num = len & 127;\n if (num > 4) return buf.error(\"length octect is too long\");\n len = 0;\n for (let i = 0; i < num; i++) {\n len <<= 8;\n let j = buf.readUInt8(fail);\n if (buf.isError(j)) return j;\n len |= j;\n }\n return len;\n }\n },\n});\n\n// node_modules/asn1.js/lib/asn1/decoders/pem.js\nvar require_pem2 = __commonJS({\n \"node_modules/asn1.js/lib/asn1/decoders/pem.js\"(exports, module) {\n \"use strict\";\n var inherits = require_inherits_browser(),\n Buffer2 = require_safer().Buffer,\n DERDecoder = require_der3();\n function PEMDecoder(entity) {\n DERDecoder.call(this, entity), (this.enc = \"pem\");\n }\n inherits(PEMDecoder, DERDecoder);\n module.exports = PEMDecoder;\n PEMDecoder.prototype.decode = function (data, options) {\n let lines = data.toString().split(/[\\r\\n]+/g),\n label = options.label.toUpperCase(),\n re = /^-----(BEGIN|END) ([^-]+)-----$/,\n start = -1,\n end = -1;\n for (let i = 0; i < lines.length; i++) {\n let match = lines[i].match(re);\n if (match !== null && match[2] === label)\n if (start === -1) {\n if (match[1] !== \"BEGIN\") break;\n start = i;\n } else {\n if (match[1] !== \"END\") break;\n end = i;\n break;\n }\n }\n if (start === -1 || end === -1) throw new Error(\"PEM section not found for: \" + label);\n let base64 = lines.slice(start + 1, end).join(\"\");\n base64.replace(/[^a-z0-9+/=]+/gi, \"\");\n let input = Buffer2.from(base64, \"base64\");\n return DERDecoder.prototype.decode.call(this, input, options);\n };\n },\n});\n\n// node_modules/asn1.js/lib/asn1/decoders/index.js\nvar require_decoders = __commonJS({\n \"node_modules/asn1.js/lib/asn1/decoders/index.js\"(exports) {\n \"use strict\";\n var decoders = exports;\n decoders.der = require_der3();\n decoders.pem = require_pem2();\n },\n});\n\n// node_modules/asn1.js/lib/asn1/api.js\nvar require_api = __commonJS({\n \"node_modules/asn1.js/lib/asn1/api.js\"(exports) {\n \"use strict\";\n var encoders = require_encoders(),\n decoders = require_decoders(),\n inherits = require_inherits_browser(),\n api = exports;\n api.define = function (name, body) {\n return new Entity(name, body);\n };\n function Entity(name, body) {\n (this.name = name), (this.body = body), (this.decoders = {}), (this.encoders = {});\n }\n Entity.prototype._createNamed = function (Base) {\n let name = this.name;\n function Generated(entity) {\n this._initNamed(entity, name);\n }\n return (\n inherits(Generated, Base),\n (Generated.prototype._initNamed = function (entity, name2) {\n Base.call(this, entity, name2);\n }),\n new Generated(this)\n );\n };\n Entity.prototype._getDecoder = function (enc) {\n return (\n (enc = enc || \"der\"),\n this.decoders.hasOwnProperty(enc) || (this.decoders[enc] = this._createNamed(decoders[enc])),\n this.decoders[enc]\n );\n };\n Entity.prototype.decode = function (data, enc, options) {\n return this._getDecoder(enc).decode(data, options);\n };\n Entity.prototype._getEncoder = function (enc) {\n return (\n (enc = enc || \"der\"),\n this.encoders.hasOwnProperty(enc) || (this.encoders[enc] = this._createNamed(encoders[enc])),\n this.encoders[enc]\n );\n };\n Entity.prototype.encode = function (data, enc, reporter) {\n return this._getEncoder(enc).encode(data, reporter);\n };\n },\n});\n\n// node_modules/asn1.js/lib/asn1/base/index.js\nvar require_base2 = __commonJS({\n \"node_modules/asn1.js/lib/asn1/base/index.js\"(exports) {\n \"use strict\";\n var base = exports;\n base.Reporter = require_reporter().Reporter;\n base.DecoderBuffer = require_buffer().DecoderBuffer;\n base.EncoderBuffer = require_buffer().EncoderBuffer;\n base.Node = require_node();\n },\n});\n\n// node_modules/asn1.js/lib/asn1/constants/index.js\nvar require_constants = __commonJS({\n \"node_modules/asn1.js/lib/asn1/constants/index.js\"(exports) {\n \"use strict\";\n var constants = exports;\n constants._reverse = function (map) {\n let res = {};\n return (\n Object.keys(map).forEach(function (key) {\n (key | 0) == key && (key = key | 0);\n let value = map[key];\n res[value] = key;\n }),\n res\n );\n };\n constants.der = require_der();\n },\n});\n\n// node_modules/asn1.js/lib/asn1.js\nvar require_asn1 = __commonJS({\n \"node_modules/asn1.js/lib/asn1.js\"(exports) {\n \"use strict\";\n var asn1 = exports;\n asn1.bignum = require_bn5();\n asn1.define = require_api().define;\n asn1.base = require_base2();\n asn1.constants = require_constants();\n asn1.decoders = require_decoders();\n asn1.encoders = require_encoders();\n },\n});\n\n// node_modules/parse-asn1/certificate.js\nvar require_certificate = __commonJS({\n \"node_modules/parse-asn1/certificate.js\"(exports, module) {\n \"use strict\";\n var asn = require_asn1(),\n Time = asn.define(\"Time\", function () {\n this.choice({\n utcTime: this.utctime(),\n generalTime: this.gentime(),\n });\n }),\n AttributeTypeValue = asn.define(\"AttributeTypeValue\", function () {\n this.seq().obj(this.key(\"type\").objid(), this.key(\"value\").any());\n }),\n AlgorithmIdentifier = asn.define(\"AlgorithmIdentifier\", function () {\n this.seq().obj(\n this.key(\"algorithm\").objid(),\n this.key(\"parameters\").optional(),\n this.key(\"curve\").objid().optional(),\n );\n }),\n SubjectPublicKeyInfo = asn.define(\"SubjectPublicKeyInfo\", function () {\n this.seq().obj(this.key(\"algorithm\").use(AlgorithmIdentifier), this.key(\"subjectPublicKey\").bitstr());\n }),\n RelativeDistinguishedName = asn.define(\"RelativeDistinguishedName\", function () {\n this.setof(AttributeTypeValue);\n }),\n RDNSequence = asn.define(\"RDNSequence\", function () {\n this.seqof(RelativeDistinguishedName);\n }),\n Name = asn.define(\"Name\", function () {\n this.choice({\n rdnSequence: this.use(RDNSequence),\n });\n }),\n Validity = asn.define(\"Validity\", function () {\n this.seq().obj(this.key(\"notBefore\").use(Time), this.key(\"notAfter\").use(Time));\n }),\n Extension = asn.define(\"Extension\", function () {\n this.seq().obj(this.key(\"extnID\").objid(), this.key(\"critical\").bool().def(!1), this.key(\"extnValue\").octstr());\n }),\n TBSCertificate = asn.define(\"TBSCertificate\", function () {\n this.seq().obj(\n this.key(\"version\").explicit(0).int().optional(),\n this.key(\"serialNumber\").int(),\n this.key(\"signature\").use(AlgorithmIdentifier),\n this.key(\"issuer\").use(Name),\n this.key(\"validity\").use(Validity),\n this.key(\"subject\").use(Name),\n this.key(\"subjectPublicKeyInfo\").use(SubjectPublicKeyInfo),\n this.key(\"issuerUniqueID\").implicit(1).bitstr().optional(),\n this.key(\"subjectUniqueID\").implicit(2).bitstr().optional(),\n this.key(\"extensions\").explicit(3).seqof(Extension).optional(),\n );\n }),\n X509Certificate = asn.define(\"X509Certificate\", function () {\n this.seq().obj(\n this.key(\"tbsCertificate\").use(TBSCertificate),\n this.key(\"signatureAlgorithm\").use(AlgorithmIdentifier),\n this.key(\"signatureValue\").bitstr(),\n );\n });\n module.exports = X509Certificate;\n },\n});\n\n// node_modules/parse-asn1/asn1.js\nvar require_asn12 = __commonJS({\n \"node_modules/parse-asn1/asn1.js\"(exports) {\n \"use strict\";\n var asn1 = require_asn1();\n exports.certificate = require_certificate();\n var RSAPrivateKey = asn1.define(\"RSAPrivateKey\", function () {\n this.seq().obj(\n this.key(\"version\").int(),\n this.key(\"modulus\").int(),\n this.key(\"publicExponent\").int(),\n this.key(\"privateExponent\").int(),\n this.key(\"prime1\").int(),\n this.key(\"prime2\").int(),\n this.key(\"exponent1\").int(),\n this.key(\"exponent2\").int(),\n this.key(\"coefficient\").int(),\n );\n });\n exports.RSAPrivateKey = RSAPrivateKey;\n var RSAPublicKey = asn1.define(\"RSAPublicKey\", function () {\n this.seq().obj(this.key(\"modulus\").int(), this.key(\"publicExponent\").int());\n });\n exports.RSAPublicKey = RSAPublicKey;\n var PublicKey = asn1.define(\"SubjectPublicKeyInfo\", function () {\n this.seq().obj(this.key(\"algorithm\").use(AlgorithmIdentifier), this.key(\"subjectPublicKey\").bitstr());\n });\n exports.PublicKey = PublicKey;\n var AlgorithmIdentifier = asn1.define(\"AlgorithmIdentifier\", function () {\n this.seq().obj(\n this.key(\"algorithm\").objid(),\n this.key(\"none\").null_().optional(),\n this.key(\"curve\").objid().optional(),\n this.key(\"params\").seq().obj(this.key(\"p\").int(), this.key(\"q\").int(), this.key(\"g\").int()).optional(),\n );\n }),\n PrivateKeyInfo = asn1.define(\"PrivateKeyInfo\", function () {\n this.seq().obj(\n this.key(\"version\").int(),\n this.key(\"algorithm\").use(AlgorithmIdentifier),\n this.key(\"subjectPrivateKey\").octstr(),\n );\n });\n exports.PrivateKey = PrivateKeyInfo;\n var EncryptedPrivateKeyInfo = asn1.define(\"EncryptedPrivateKeyInfo\", function () {\n this.seq().obj(\n this.key(\"algorithm\")\n .seq()\n .obj(\n this.key(\"id\").objid(),\n this.key(\"decrypt\")\n .seq()\n .obj(\n this.key(\"kde\")\n .seq()\n .obj(\n this.key(\"id\").objid(),\n this.key(\"kdeparams\").seq().obj(this.key(\"salt\").octstr(), this.key(\"iters\").int()),\n ),\n this.key(\"cipher\").seq().obj(this.key(\"algo\").objid(), this.key(\"iv\").octstr()),\n ),\n ),\n this.key(\"subjectPrivateKey\").octstr(),\n );\n });\n exports.EncryptedPrivateKey = EncryptedPrivateKeyInfo;\n var DSAPrivateKey = asn1.define(\"DSAPrivateKey\", function () {\n this.seq().obj(\n this.key(\"version\").int(),\n this.key(\"p\").int(),\n this.key(\"q\").int(),\n this.key(\"g\").int(),\n this.key(\"pub_key\").int(),\n this.key(\"priv_key\").int(),\n );\n });\n exports.DSAPrivateKey = DSAPrivateKey;\n exports.DSAparam = asn1.define(\"DSAparam\", function () {\n this.int();\n });\n var ECPrivateKey = asn1.define(\"ECPrivateKey\", function () {\n this.seq().obj(\n this.key(\"version\").int(),\n this.key(\"privateKey\").octstr(),\n this.key(\"parameters\").optional().explicit(0).use(ECParameters),\n this.key(\"publicKey\").optional().explicit(1).bitstr(),\n );\n });\n exports.ECPrivateKey = ECPrivateKey;\n var ECParameters = asn1.define(\"ECParameters\", function () {\n this.choice({\n namedCurve: this.objid(),\n });\n });\n exports.signature = asn1.define(\"signature\", function () {\n this.seq().obj(this.key(\"r\").int(), this.key(\"s\").int());\n });\n },\n});\n\n// node_modules/parse-asn1/aesid.json\nvar require_aesid = __commonJS({\n \"node_modules/parse-asn1/aesid.json\"(exports, module) {\n module.exports = {\n \"2.16.840.1.101.3.4.1.1\": \"aes-128-ecb\",\n \"2.16.840.1.101.3.4.1.2\": \"aes-128-cbc\",\n \"2.16.840.1.101.3.4.1.3\": \"aes-128-ofb\",\n \"2.16.840.1.101.3.4.1.4\": \"aes-128-cfb\",\n \"2.16.840.1.101.3.4.1.21\": \"aes-192-ecb\",\n \"2.16.840.1.101.3.4.1.22\": \"aes-192-cbc\",\n \"2.16.840.1.101.3.4.1.23\": \"aes-192-ofb\",\n \"2.16.840.1.101.3.4.1.24\": \"aes-192-cfb\",\n \"2.16.840.1.101.3.4.1.41\": \"aes-256-ecb\",\n \"2.16.840.1.101.3.4.1.42\": \"aes-256-cbc\",\n \"2.16.840.1.101.3.4.1.43\": \"aes-256-ofb\",\n \"2.16.840.1.101.3.4.1.44\": \"aes-256-cfb\",\n };\n },\n});\n\n// node_modules/parse-asn1/fixProc.js\nvar require_fixProc = __commonJS({\n \"node_modules/parse-asn1/fixProc.js\"(exports, module) {\n var findProc =\n /Proc-Type: 4,ENCRYPTED[\\n\\r]+DEK-Info: AES-((?:128)|(?:192)|(?:256))-CBC,([0-9A-H]+)[\\n\\r]+([0-9A-z\\n\\r+/=]+)[\\n\\r]+/m,\n startRegex = /^-----BEGIN ((?:.*? KEY)|CERTIFICATE)-----/m,\n fullRegex = /^-----BEGIN ((?:.*? KEY)|CERTIFICATE)-----([0-9A-z\\n\\r+/=]+)-----END \\1-----$/m,\n evp = require_evp_bytestokey(),\n ciphers = require_browser5(),\n Buffer2 = require_safe_buffer().Buffer;\n module.exports = function (okey, password) {\n var key = okey.toString(),\n match = key.match(findProc),\n decrypted;\n if (match) {\n var suite = \"aes\" + match[1],\n iv = Buffer2.from(match[2], \"hex\"),\n cipherText = Buffer2.from(match[3].replace(/[\\r\\n]/g, \"\"), \"base64\"),\n cipherKey = evp(password, iv.slice(0, 8), parseInt(match[1], 10)).key,\n out = [],\n cipher = ciphers.createDecipheriv(suite, cipherKey, iv);\n out.push(cipher.update(cipherText)), out.push(cipher.final()), (decrypted = Buffer2.concat(out));\n } else {\n var match2 = key.match(fullRegex);\n decrypted = Buffer2.from(match2[2].replace(/[\\r\\n]/g, \"\"), \"base64\");\n }\n var tag = key.match(startRegex)[1];\n return {\n tag,\n data: decrypted,\n };\n };\n },\n});\n\n// node_modules/parse-asn1/index.js\nvar require_parse_asn1 = __commonJS({\n \"node_modules/parse-asn1/index.js\"(exports, module) {\n var asn1 = require_asn12(),\n aesid = require_aesid(),\n fixProc = require_fixProc(),\n ciphers = require_browser5(),\n compat = require_browser4(),\n Buffer2 = require_safe_buffer().Buffer;\n module.exports = parseKeys;\n function parseKeys(buffer) {\n var password;\n typeof buffer == \"object\" && !Buffer2.isBuffer(buffer) && ((password = buffer.passphrase), (buffer = buffer.key)),\n typeof buffer == \"string\" && (buffer = Buffer2.from(buffer));\n var stripped = fixProc(buffer, password),\n type = stripped.tag,\n data = stripped.data,\n subtype,\n ndata;\n switch (type) {\n case \"CERTIFICATE\":\n ndata = asn1.certificate.decode(data, \"der\").tbsCertificate.subjectPublicKeyInfo;\n case \"PUBLIC KEY\":\n switch (\n (ndata || (ndata = asn1.PublicKey.decode(data, \"der\")),\n (subtype = ndata.algorithm.algorithm.join(\".\")),\n subtype)\n ) {\n case \"1.2.840.113549.1.1.1\":\n return asn1.RSAPublicKey.decode(ndata.subjectPublicKey.data, \"der\");\n case \"1.2.840.10045.2.1\":\n return (\n (ndata.subjectPrivateKey = ndata.subjectPublicKey),\n {\n type: \"ec\",\n data: ndata,\n }\n );\n case \"1.2.840.10040.4.1\":\n return (\n (ndata.algorithm.params.pub_key = asn1.DSAparam.decode(ndata.subjectPublicKey.data, \"der\")),\n {\n type: \"dsa\",\n data: ndata.algorithm.params,\n }\n );\n default:\n throw new Error(\"unknown key id \" + subtype);\n }\n case \"ENCRYPTED PRIVATE KEY\":\n (data = asn1.EncryptedPrivateKey.decode(data, \"der\")), (data = decrypt(data, password));\n case \"PRIVATE KEY\":\n switch (\n ((ndata = asn1.PrivateKey.decode(data, \"der\")), (subtype = ndata.algorithm.algorithm.join(\".\")), subtype)\n ) {\n case \"1.2.840.113549.1.1.1\":\n return asn1.RSAPrivateKey.decode(ndata.subjectPrivateKey, \"der\");\n case \"1.2.840.10045.2.1\":\n return {\n curve: ndata.algorithm.curve,\n privateKey: asn1.ECPrivateKey.decode(ndata.subjectPrivateKey, \"der\").privateKey,\n };\n case \"1.2.840.10040.4.1\":\n return (\n (ndata.algorithm.params.priv_key = asn1.DSAparam.decode(ndata.subjectPrivateKey, \"der\")),\n {\n type: \"dsa\",\n params: ndata.algorithm.params,\n }\n );\n default:\n throw new Error(\"unknown key id \" + subtype);\n }\n case \"RSA PUBLIC KEY\":\n return asn1.RSAPublicKey.decode(data, \"der\");\n case \"RSA PRIVATE KEY\":\n return asn1.RSAPrivateKey.decode(data, \"der\");\n case \"DSA PRIVATE KEY\":\n return {\n type: \"dsa\",\n params: asn1.DSAPrivateKey.decode(data, \"der\"),\n };\n case \"EC PRIVATE KEY\":\n return (\n (data = asn1.ECPrivateKey.decode(data, \"der\")),\n {\n curve: data.parameters.value,\n privateKey: data.privateKey,\n }\n );\n default:\n throw new Error(\"unknown key type \" + type);\n }\n }\n parseKeys.signature = asn1.signature;\n function decrypt(data, password) {\n var salt = data.algorithm.decrypt.kde.kdeparams.salt,\n iters = parseInt(data.algorithm.decrypt.kde.kdeparams.iters.toString(), 10),\n algo = aesid[data.algorithm.decrypt.cipher.algo.join(\".\")],\n iv = data.algorithm.decrypt.cipher.iv,\n cipherText = data.subjectPrivateKey,\n keylen = parseInt(algo.split(\"-\")[1], 10) / 8,\n key = compat.pbkdf2Sync(password, salt, iters, keylen, \"sha1\"),\n cipher = ciphers.createDecipheriv(algo, key, iv),\n out = [];\n return out.push(cipher.update(cipherText)), out.push(cipher.final()), Buffer2.concat(out);\n }\n },\n});\n\n// node_modules/browserify-sign/browser/curves.json\nvar require_curves2 = __commonJS({\n \"node_modules/browserify-sign/browser/curves.json\"(exports, module) {\n module.exports = {\n \"1.3.132.0.10\": \"secp256k1\",\n \"1.3.132.0.33\": \"p224\",\n \"1.2.840.10045.3.1.1\": \"p192\",\n \"1.2.840.10045.3.1.7\": \"p256\",\n \"1.3.132.0.34\": \"p384\",\n \"1.3.132.0.35\": \"p521\",\n };\n },\n});\n\n// node_modules/browserify-sign/browser/sign.js\nvar require_sign = __commonJS({\n \"node_modules/browserify-sign/browser/sign.js\"(exports, module) {\n var Buffer2 = require_safe_buffer().Buffer,\n createHmac = require_browser3(),\n crt = require_browserify_rsa(),\n EC = require_elliptic().ec,\n BN = require_bn3(),\n parseKeys = require_parse_asn1(),\n curves = require_curves2();\n function sign(hash, key, hashType, signType, tag) {\n var priv = parseKeys(key);\n if (priv.curve) {\n if (signType !== \"ecdsa\" && signType !== \"ecdsa/rsa\") throw new Error(\"wrong private key type\");\n return ecSign(hash, priv);\n } else if (priv.type === \"dsa\") {\n if (signType !== \"dsa\") throw new Error(\"wrong private key type\");\n return dsaSign(hash, priv, hashType);\n } else if (signType !== \"rsa\" && signType !== \"ecdsa/rsa\") throw new Error(\"wrong private key type\");\n hash = Buffer2.concat([tag, hash]);\n for (var len = priv.modulus.byteLength(), pad = [0, 1]; hash.length + pad.length + 1 < len; ) pad.push(255);\n pad.push(0);\n for (var i = -1; ++i < hash.length; ) pad.push(hash[i]);\n var out = crt(pad, priv);\n return out;\n }\n function ecSign(hash, priv) {\n var curveId = curves[priv.curve.join(\".\")];\n if (!curveId) throw new Error(\"unknown curve \" + priv.curve.join(\".\"));\n var curve = new EC(curveId),\n key = curve.keyFromPrivate(priv.privateKey),\n out = key.sign(hash);\n return Buffer2.from(out.toDER());\n }\n function dsaSign(hash, priv, algo) {\n for (\n var x = priv.params.priv_key,\n p = priv.params.p,\n q = priv.params.q,\n g = priv.params.g,\n r = new BN(0),\n k,\n H = bits2int(hash, q).mod(q),\n s = !1,\n kv = getKey(x, q, hash, algo);\n s === !1;\n\n )\n (k = makeKey(q, kv, algo)),\n (r = makeR(g, k, p, q)),\n (s = k\n .invm(q)\n .imul(H.add(x.mul(r)))\n .mod(q)),\n s.cmpn(0) === 0 && ((s = !1), (r = new BN(0)));\n return toDER(r, s);\n }\n function toDER(r, s) {\n (r = r.toArray()), (s = s.toArray()), r[0] & 128 && (r = [0].concat(r)), s[0] & 128 && (s = [0].concat(s));\n var total = r.length + s.length + 4,\n res = [48, total, 2, r.length];\n return (res = res.concat(r, [2, s.length], s)), Buffer2.from(res);\n }\n function getKey(x, q, hash, algo) {\n if (((x = Buffer2.from(x.toArray())), x.length < q.byteLength())) {\n var zeros = Buffer2.alloc(q.byteLength() - x.length);\n x = Buffer2.concat([zeros, x]);\n }\n var hlen = hash.length,\n hbits = bits2octets(hash, q),\n v = Buffer2.alloc(hlen);\n v.fill(1);\n var k = Buffer2.alloc(hlen);\n return (\n (k = createHmac(algo, k)\n .update(v)\n .update(Buffer2.from([0]))\n .update(x)\n .update(hbits)\n .digest()),\n (v = createHmac(algo, k).update(v).digest()),\n (k = createHmac(algo, k)\n .update(v)\n .update(Buffer2.from([1]))\n .update(x)\n .update(hbits)\n .digest()),\n (v = createHmac(algo, k).update(v).digest()),\n { k, v }\n );\n }\n function bits2int(obits, q) {\n var bits = new BN(obits),\n shift = (obits.length << 3) - q.bitLength();\n return shift > 0 && bits.ishrn(shift), bits;\n }\n function bits2octets(bits, q) {\n (bits = bits2int(bits, q)), (bits = bits.mod(q));\n var out = Buffer2.from(bits.toArray());\n if (out.length < q.byteLength()) {\n var zeros = Buffer2.alloc(q.byteLength() - out.length);\n out = Buffer2.concat([zeros, out]);\n }\n return out;\n }\n function makeKey(q, kv, algo) {\n var t, k;\n do {\n for (t = Buffer2.alloc(0); t.length * 8 < q.bitLength(); )\n (kv.v = createHmac(algo, kv.k).update(kv.v).digest()), (t = Buffer2.concat([t, kv.v]));\n (k = bits2int(t, q)),\n (kv.k = createHmac(algo, kv.k)\n .update(kv.v)\n .update(Buffer2.from([0]))\n .digest()),\n (kv.v = createHmac(algo, kv.k).update(kv.v).digest());\n } while (k.cmp(q) !== -1);\n return k;\n }\n function makeR(g, k, p, q) {\n return g.toRed(BN.mont(p)).redPow(k).fromRed().mod(q);\n }\n module.exports = sign;\n module.exports.getKey = getKey;\n module.exports.makeKey = makeKey;\n },\n});\n\n// node_modules/browserify-sign/browser/verify.js\nvar require_verify = __commonJS({\n \"node_modules/browserify-sign/browser/verify.js\"(exports, module) {\n var Buffer2 = require_safe_buffer().Buffer,\n BN = require_bn3(),\n EC = require_elliptic().ec,\n parseKeys = require_parse_asn1(),\n curves = require_curves2();\n function verify(sig, hash, key, signType, tag) {\n var pub = parseKeys(key);\n if (pub.type === \"ec\") {\n if (signType !== \"ecdsa\" && signType !== \"ecdsa/rsa\") throw new Error(\"wrong public key type\");\n return ecVerify(sig, hash, pub);\n } else if (pub.type === \"dsa\") {\n if (signType !== \"dsa\") throw new Error(\"wrong public key type\");\n return dsaVerify(sig, hash, pub);\n } else if (signType !== \"rsa\" && signType !== \"ecdsa/rsa\") throw new Error(\"wrong public key type\");\n hash = Buffer2.concat([tag, hash]);\n for (var len = pub.modulus.byteLength(), pad = [1], padNum = 0; hash.length + pad.length + 2 < len; )\n pad.push(255), padNum++;\n pad.push(0);\n for (var i = -1; ++i < hash.length; ) pad.push(hash[i]);\n pad = Buffer2.from(pad);\n var red = BN.mont(pub.modulus);\n (sig = new BN(sig).toRed(red)),\n (sig = sig.redPow(new BN(pub.publicExponent))),\n (sig = Buffer2.from(sig.fromRed().toArray()));\n var out = padNum < 8 ? 1 : 0;\n for (len = Math.min(sig.length, pad.length), sig.length !== pad.length && (out = 1), i = -1; ++i < len; )\n out |= sig[i] ^ pad[i];\n return out === 0;\n }\n function ecVerify(sig, hash, pub) {\n var curveId = curves[pub.data.algorithm.curve.join(\".\")];\n if (!curveId) throw new Error(\"unknown curve \" + pub.data.algorithm.curve.join(\".\"));\n var curve = new EC(curveId),\n pubkey = pub.data.subjectPrivateKey.data;\n return curve.verify(hash, sig, pubkey);\n }\n function dsaVerify(sig, hash, pub) {\n var p = pub.data.p,\n q = pub.data.q,\n g = pub.data.g,\n y = pub.data.pub_key,\n unpacked = parseKeys.signature.decode(sig, \"der\"),\n s = unpacked.s,\n r = unpacked.r;\n checkValue(s, q), checkValue(r, q);\n var montp = BN.mont(p),\n w = s.invm(q),\n v = g\n .toRed(montp)\n .redPow(new BN(hash).mul(w).mod(q))\n .fromRed()\n .mul(y.toRed(montp).redPow(r.mul(w).mod(q)).fromRed())\n .mod(p)\n .mod(q);\n return v.cmp(r) === 0;\n }\n function checkValue(b, q) {\n if (b.cmpn(0) <= 0) throw new Error(\"invalid sig\");\n if (b.cmp(q) >= q) throw new Error(\"invalid sig\");\n }\n module.exports = verify;\n },\n});\n\n// node_modules/browserify-sign/browser/index.js\nvar require_browser8 = __commonJS({\n \"node_modules/browserify-sign/browser/index.js\"(exports, module) {\n var Buffer2 = require_safe_buffer().Buffer,\n createHash = require_browser2(),\n stream = __require(\"readable-stream\"),\n inherits = require_inherits_browser(),\n sign = require_sign(),\n verify = require_verify(),\n algorithms = require_algorithms();\n Object.keys(algorithms).forEach(function (key) {\n (algorithms[key].id = Buffer2.from(algorithms[key].id, \"hex\")), (algorithms[key.toLowerCase()] = algorithms[key]);\n });\n function Sign(algorithm) {\n stream.Writable.call(this);\n var data = algorithms[algorithm];\n if (!data) throw new Error(\"Unknown message digest\");\n (this._hashType = data.hash),\n (this._hash = createHash(data.hash)),\n (this._tag = data.id),\n (this._signType = data.sign);\n }\n inherits(Sign, stream.Writable);\n Sign.prototype._write = function (data, _, done) {\n this._hash.update(data), done();\n };\n Sign.prototype.update = function (data, enc) {\n return typeof data == \"string\" && (data = Buffer2.from(data, enc)), this._hash.update(data), this;\n };\n Sign.prototype.sign = function (key, enc) {\n this.end();\n var hash = this._hash.digest(),\n sig = sign(hash, key, this._hashType, this._signType, this._tag);\n return enc ? sig.toString(enc) : sig;\n };\n function Verify(algorithm) {\n stream.Writable.call(this);\n var data = algorithms[algorithm];\n if (!data) throw new Error(\"Unknown message digest\");\n (this._hash = createHash(data.hash)), (this._tag = data.id), (this._signType = data.sign);\n }\n inherits(Verify, stream.Writable);\n Verify.prototype._write = function (data, _, done) {\n this._hash.update(data), done();\n };\n Verify.prototype.update = function (data, enc) {\n return typeof data == \"string\" && (data = Buffer2.from(data, enc)), this._hash.update(data), this;\n };\n Verify.prototype.verify = function (key, sig, enc) {\n typeof sig == \"string\" && (sig = Buffer2.from(sig, enc)), this.end();\n var hash = this._hash.digest();\n return verify(sig, hash, key, this._signType, this._tag);\n };\n function createSign(algorithm) {\n return new Sign(algorithm);\n }\n function createVerify(algorithm) {\n return new Verify(algorithm);\n }\n module.exports = {\n Sign: createSign,\n Verify: createVerify,\n createSign,\n createVerify,\n };\n },\n});\n\n// node_modules/create-ecdh/node_modules/bn.js/lib/bn.js\nvar require_bn6 = __commonJS({\n \"node_modules/create-ecdh/node_modules/bn.js/lib/bn.js\"(exports, module) {\n (function (module2, exports2) {\n \"use strict\";\n function assert(val, msg) {\n if (!val) throw new Error(msg || \"Assertion failed\");\n }\n function inherits(ctor, superCtor) {\n ctor.super_ = superCtor;\n var TempCtor = function () {};\n (TempCtor.prototype = superCtor.prototype),\n (ctor.prototype = new TempCtor()),\n (ctor.prototype.constructor = ctor);\n }\n function BN(number, base, endian) {\n if (BN.isBN(number)) return number;\n (this.negative = 0),\n (this.words = null),\n (this.length = 0),\n (this.red = null),\n number !== null &&\n ((base === \"le\" || base === \"be\") && ((endian = base), (base = 10)),\n this._init(number || 0, base || 10, endian || \"be\"));\n }\n typeof module2 == \"object\" ? (module2.exports = BN) : (exports2.BN = BN), (BN.BN = BN), (BN.wordSize = 26);\n var Buffer2;\n try {\n typeof window < \"u\" && typeof window.Buffer < \"u\"\n ? (Buffer2 = window.Buffer)\n : (Buffer2 = __require(\"buffer\").Buffer);\n } catch {}\n (BN.isBN = function (num) {\n return num instanceof BN\n ? !0\n : num !== null &&\n typeof num == \"object\" &&\n num.constructor.wordSize === BN.wordSize &&\n Array.isArray(num.words);\n }),\n (BN.max = function (left, right) {\n return left.cmp(right) > 0 ? left : right;\n }),\n (BN.min = function (left, right) {\n return left.cmp(right) < 0 ? left : right;\n }),\n (BN.prototype._init = function (number, base, endian) {\n if (typeof number == \"number\") return this._initNumber(number, base, endian);\n if (typeof number == \"object\") return this._initArray(number, base, endian);\n base === \"hex\" && (base = 16),\n assert(base === (base | 0) && base >= 2 && base <= 36),\n (number = number.toString().replace(/\\s+/g, \"\"));\n var start = 0;\n number[0] === \"-\" && (start++, (this.negative = 1)),\n start < number.length &&\n (base === 16\n ? this._parseHex(number, start, endian)\n : (this._parseBase(number, base, start),\n endian === \"le\" && this._initArray(this.toArray(), base, endian)));\n }),\n (BN.prototype._initNumber = function (number, base, endian) {\n number < 0 && ((this.negative = 1), (number = -number)),\n number < 67108864\n ? ((this.words = [number & 67108863]), (this.length = 1))\n : number < 4503599627370496\n ? ((this.words = [number & 67108863, (number / 67108864) & 67108863]), (this.length = 2))\n : (assert(number < 9007199254740992),\n (this.words = [number & 67108863, (number / 67108864) & 67108863, 1]),\n (this.length = 3)),\n endian === \"le\" && this._initArray(this.toArray(), base, endian);\n }),\n (BN.prototype._initArray = function (number, base, endian) {\n if ((assert(typeof number.length == \"number\"), number.length <= 0))\n return (this.words = [0]), (this.length = 1), this;\n (this.length = Math.ceil(number.length / 3)), (this.words = new Array(this.length));\n for (var i = 0; i < this.length; i++) this.words[i] = 0;\n var j,\n w,\n off = 0;\n if (endian === \"be\")\n for (i = number.length - 1, j = 0; i >= 0; i -= 3)\n (w = number[i] | (number[i - 1] << 8) | (number[i - 2] << 16)),\n (this.words[j] |= (w << off) & 67108863),\n (this.words[j + 1] = (w >>> (26 - off)) & 67108863),\n (off += 24),\n off >= 26 && ((off -= 26), j++);\n else if (endian === \"le\")\n for (i = 0, j = 0; i < number.length; i += 3)\n (w = number[i] | (number[i + 1] << 8) | (number[i + 2] << 16)),\n (this.words[j] |= (w << off) & 67108863),\n (this.words[j + 1] = (w >>> (26 - off)) & 67108863),\n (off += 24),\n off >= 26 && ((off -= 26), j++);\n return this.strip();\n });\n function parseHex4Bits(string, index) {\n var c = string.charCodeAt(index);\n return c >= 65 && c <= 70 ? c - 55 : c >= 97 && c <= 102 ? c - 87 : (c - 48) & 15;\n }\n function parseHexByte(string, lowerBound, index) {\n var r = parseHex4Bits(string, index);\n return index - 1 >= lowerBound && (r |= parseHex4Bits(string, index - 1) << 4), r;\n }\n BN.prototype._parseHex = function (number, start, endian) {\n (this.length = Math.ceil((number.length - start) / 6)), (this.words = new Array(this.length));\n for (var i = 0; i < this.length; i++) this.words[i] = 0;\n var off = 0,\n j = 0,\n w;\n if (endian === \"be\")\n for (i = number.length - 1; i >= start; i -= 2)\n (w = parseHexByte(number, start, i) << off),\n (this.words[j] |= w & 67108863),\n off >= 18 ? ((off -= 18), (j += 1), (this.words[j] |= w >>> 26)) : (off += 8);\n else {\n var parseLength = number.length - start;\n for (i = parseLength % 2 === 0 ? start + 1 : start; i < number.length; i += 2)\n (w = parseHexByte(number, start, i) << off),\n (this.words[j] |= w & 67108863),\n off >= 18 ? ((off -= 18), (j += 1), (this.words[j] |= w >>> 26)) : (off += 8);\n }\n this.strip();\n };\n function parseBase(str, start, end, mul) {\n for (var r = 0, len = Math.min(str.length, end), i = start; i < len; i++) {\n var c = str.charCodeAt(i) - 48;\n (r *= mul), c >= 49 ? (r += c - 49 + 10) : c >= 17 ? (r += c - 17 + 10) : (r += c);\n }\n return r;\n }\n (BN.prototype._parseBase = function (number, base, start) {\n (this.words = [0]), (this.length = 1);\n for (var limbLen = 0, limbPow = 1; limbPow <= 67108863; limbPow *= base) limbLen++;\n limbLen--, (limbPow = (limbPow / base) | 0);\n for (\n var total = number.length - start,\n mod = total % limbLen,\n end = Math.min(total, total - mod) + start,\n word = 0,\n i = start;\n i < end;\n i += limbLen\n )\n (word = parseBase(number, i, i + limbLen, base)),\n this.imuln(limbPow),\n this.words[0] + word < 67108864 ? (this.words[0] += word) : this._iaddn(word);\n if (mod !== 0) {\n var pow = 1;\n for (word = parseBase(number, i, number.length, base), i = 0; i < mod; i++) pow *= base;\n this.imuln(pow), this.words[0] + word < 67108864 ? (this.words[0] += word) : this._iaddn(word);\n }\n this.strip();\n }),\n (BN.prototype.copy = function (dest) {\n dest.words = new Array(this.length);\n for (var i = 0; i < this.length; i++) dest.words[i] = this.words[i];\n (dest.length = this.length), (dest.negative = this.negative), (dest.red = this.red);\n }),\n (BN.prototype.clone = function () {\n var r = new BN(null);\n return this.copy(r), r;\n }),\n (BN.prototype._expand = function (size) {\n for (; this.length < size; ) this.words[this.length++] = 0;\n return this;\n }),\n (BN.prototype.strip = function () {\n for (; this.length > 1 && this.words[this.length - 1] === 0; ) this.length--;\n return this._normSign();\n }),\n (BN.prototype._normSign = function () {\n return this.length === 1 && this.words[0] === 0 && (this.negative = 0), this;\n }),\n (BN.prototype.inspect = function () {\n return (this.red ? \"<BN-R: \" : \"<BN: \") + this.toString(16) + \">\";\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 groupSizes = [\n 0, 0, 25, 16, 12, 11, 10, 9, 8, 8, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5,\n 5, 5,\n ],\n groupBases = [\n 0, 0, 33554432, 43046721, 16777216, 48828125, 60466176, 40353607, 16777216, 43046721, 1e7, 19487171, 35831808,\n 62748517, 7529536, 11390625, 16777216, 24137569, 34012224, 47045881, 64e6, 4084101, 5153632, 6436343, 7962624,\n 9765625, 11881376, 14348907, 17210368, 20511149, 243e5, 28629151, 33554432, 39135393, 45435424, 52521875,\n 60466176,\n ];\n (BN.prototype.toString = function (base, padding) {\n (base = base || 10), (padding = padding | 0 || 1);\n var out;\n if (base === 16 || base === \"hex\") {\n out = \"\";\n for (var off = 0, carry = 0, i = 0; i < this.length; i++) {\n var w = this.words[i],\n word = (((w << off) | carry) & 16777215).toString(16);\n (carry = (w >>> (24 - off)) & 16777215),\n carry !== 0 || i !== this.length - 1 ? (out = zeros[6 - word.length] + word + out) : (out = word + out),\n (off += 2),\n off >= 26 && ((off -= 26), i--);\n }\n for (carry !== 0 && (out = carry.toString(16) + out); out.length % padding !== 0; ) out = \"0\" + out;\n return this.negative !== 0 && (out = \"-\" + out), out;\n }\n if (base === (base | 0) && base >= 2 && base <= 36) {\n var groupSize = groupSizes[base],\n groupBase = groupBases[base];\n out = \"\";\n var c = this.clone();\n for (c.negative = 0; !c.isZero(); ) {\n var r = c.modn(groupBase).toString(base);\n (c = c.idivn(groupBase)), c.isZero() ? (out = r + out) : (out = zeros[groupSize - r.length] + r + out);\n }\n for (this.isZero() && (out = \"0\" + out); out.length % padding !== 0; ) out = \"0\" + out;\n return this.negative !== 0 && (out = \"-\" + out), out;\n }\n assert(!1, \"Base should be between 2 and 36\");\n }),\n (BN.prototype.toNumber = function () {\n var ret = this.words[0];\n return (\n this.length === 2\n ? (ret += this.words[1] * 67108864)\n : this.length === 3 && this.words[2] === 1\n ? (ret += 4503599627370496 + this.words[1] * 67108864)\n : this.length > 2 && assert(!1, \"Number can only safely store up to 53 bits\"),\n this.negative !== 0 ? -ret : ret\n );\n }),\n (BN.prototype.toJSON = function () {\n return this.toString(16);\n }),\n (BN.prototype.toBuffer = function (endian, length) {\n return assert(typeof Buffer2 < \"u\"), this.toArrayLike(Buffer2, endian, length);\n }),\n (BN.prototype.toArray = function (endian, length) {\n return this.toArrayLike(Array, endian, length);\n }),\n (BN.prototype.toArrayLike = function (ArrayType, endian, length) {\n var byteLength = this.byteLength(),\n 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 this.strip();\n var littleEndian = endian === \"le\",\n res = new ArrayType(reqLength),\n b,\n i,\n q = this.clone();\n if (littleEndian) {\n for (i = 0; !q.isZero(); i++) (b = q.andln(255)), q.iushrn(8), (res[i] = b);\n for (; i < reqLength; i++) res[i] = 0;\n } else {\n for (i = 0; i < reqLength - byteLength; i++) res[i] = 0;\n for (i = 0; !q.isZero(); i++) (b = q.andln(255)), q.iushrn(8), (res[reqLength - i - 1] = b);\n }\n return res;\n }),\n Math.clz32\n ? (BN.prototype._countBits = function (w) {\n return 32 - Math.clz32(w);\n })\n : (BN.prototype._countBits = function (w) {\n var t = w,\n r = 0;\n return (\n t >= 4096 && ((r += 13), (t >>>= 13)),\n t >= 64 && ((r += 7), (t >>>= 7)),\n t >= 8 && ((r += 4), (t >>>= 4)),\n t >= 2 && ((r += 2), (t >>>= 2)),\n r + t\n );\n }),\n (BN.prototype._zeroBits = function (w) {\n if (w === 0) return 26;\n var t = w,\n r = 0;\n return (\n (t & 8191) === 0 && ((r += 13), (t >>>= 13)),\n (t & 127) === 0 && ((r += 7), (t >>>= 7)),\n (t & 15) === 0 && ((r += 4), (t >>>= 4)),\n (t & 3) === 0 && ((r += 2), (t >>>= 2)),\n (t & 1) === 0 && r++,\n r\n );\n }),\n (BN.prototype.bitLength = function () {\n var w = this.words[this.length - 1],\n hi = this._countBits(w);\n return (this.length - 1) * 26 + hi;\n });\n function toBitArray(num) {\n for (var w = new Array(num.bitLength()), bit = 0; bit < w.length; bit++) {\n var off = (bit / 26) | 0,\n wbit = bit % 26;\n w[bit] = (num.words[off] & (1 << wbit)) >>> wbit;\n }\n return w;\n }\n (BN.prototype.zeroBits = function () {\n if (this.isZero()) return 0;\n for (var r = 0, i = 0; i < this.length; i++) {\n var b = this._zeroBits(this.words[i]);\n if (((r += b), b !== 26)) break;\n }\n return r;\n }),\n (BN.prototype.byteLength = function () {\n return Math.ceil(this.bitLength() / 8);\n }),\n (BN.prototype.toTwos = function (width) {\n return this.negative !== 0 ? this.abs().inotn(width).iaddn(1) : this.clone();\n }),\n (BN.prototype.fromTwos = function (width) {\n return this.testn(width - 1) ? this.notn(width).iaddn(1).ineg() : this.clone();\n }),\n (BN.prototype.isNeg = function () {\n return this.negative !== 0;\n }),\n (BN.prototype.neg = function () {\n return this.clone().ineg();\n }),\n (BN.prototype.ineg = function () {\n return this.isZero() || (this.negative ^= 1), this;\n }),\n (BN.prototype.iuor = function (num) {\n for (; this.length < num.length; ) this.words[this.length++] = 0;\n for (var i = 0; i < num.length; i++) this.words[i] = this.words[i] | num.words[i];\n return this.strip();\n }),\n (BN.prototype.ior = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuor(num);\n }),\n (BN.prototype.or = function (num) {\n return this.length > num.length ? this.clone().ior(num) : num.clone().ior(this);\n }),\n (BN.prototype.uor = function (num) {\n return this.length > num.length ? this.clone().iuor(num) : num.clone().iuor(this);\n }),\n (BN.prototype.iuand = function (num) {\n var b;\n this.length > num.length ? (b = num) : (b = this);\n for (var i = 0; i < b.length; i++) this.words[i] = this.words[i] & num.words[i];\n return (this.length = b.length), this.strip();\n }),\n (BN.prototype.iand = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuand(num);\n }),\n (BN.prototype.and = function (num) {\n return this.length > num.length ? this.clone().iand(num) : num.clone().iand(this);\n }),\n (BN.prototype.uand = function (num) {\n return this.length > num.length ? this.clone().iuand(num) : num.clone().iuand(this);\n }),\n (BN.prototype.iuxor = function (num) {\n var a, b;\n this.length > num.length ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var i = 0; i < b.length; i++) this.words[i] = a.words[i] ^ b.words[i];\n if (this !== a) for (; i < a.length; i++) this.words[i] = a.words[i];\n return (this.length = a.length), this.strip();\n }),\n (BN.prototype.ixor = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuxor(num);\n }),\n (BN.prototype.xor = function (num) {\n return this.length > num.length ? this.clone().ixor(num) : num.clone().ixor(this);\n }),\n (BN.prototype.uxor = function (num) {\n return this.length > num.length ? this.clone().iuxor(num) : num.clone().iuxor(this);\n }),\n (BN.prototype.inotn = function (width) {\n assert(typeof width == \"number\" && width >= 0);\n var bytesNeeded = Math.ceil(width / 26) | 0,\n bitsLeft = width % 26;\n this._expand(bytesNeeded), bitsLeft > 0 && bytesNeeded--;\n for (var i = 0; i < bytesNeeded; i++) this.words[i] = ~this.words[i] & 67108863;\n return bitsLeft > 0 && (this.words[i] = ~this.words[i] & (67108863 >> (26 - bitsLeft))), this.strip();\n }),\n (BN.prototype.notn = function (width) {\n return this.clone().inotn(width);\n }),\n (BN.prototype.setn = function (bit, val) {\n assert(typeof bit == \"number\" && bit >= 0);\n var off = (bit / 26) | 0,\n wbit = bit % 26;\n return (\n this._expand(off + 1),\n val\n ? (this.words[off] = this.words[off] | (1 << wbit))\n : (this.words[off] = this.words[off] & ~(1 << wbit)),\n this.strip()\n );\n }),\n (BN.prototype.iadd = function (num) {\n var r;\n if (this.negative !== 0 && num.negative === 0)\n return (this.negative = 0), (r = this.isub(num)), (this.negative ^= 1), this._normSign();\n if (this.negative === 0 && num.negative !== 0)\n return (num.negative = 0), (r = this.isub(num)), (num.negative = 1), r._normSign();\n var a, b;\n this.length > num.length ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var carry = 0, i = 0; i < b.length; i++)\n (r = (a.words[i] | 0) + (b.words[i] | 0) + carry), (this.words[i] = r & 67108863), (carry = r >>> 26);\n for (; carry !== 0 && i < a.length; i++)\n (r = (a.words[i] | 0) + carry), (this.words[i] = r & 67108863), (carry = r >>> 26);\n if (((this.length = a.length), carry !== 0)) (this.words[this.length] = carry), this.length++;\n else if (a !== this) for (; i < a.length; i++) this.words[i] = a.words[i];\n return this;\n }),\n (BN.prototype.add = function (num) {\n var res;\n return num.negative !== 0 && this.negative === 0\n ? ((num.negative = 0), (res = this.sub(num)), (num.negative ^= 1), res)\n : num.negative === 0 && this.negative !== 0\n ? ((this.negative = 0), (res = num.sub(this)), (this.negative = 1), res)\n : this.length > num.length\n ? this.clone().iadd(num)\n : num.clone().iadd(this);\n }),\n (BN.prototype.isub = function (num) {\n if (num.negative !== 0) {\n num.negative = 0;\n var r = this.iadd(num);\n return (num.negative = 1), r._normSign();\n } else if (this.negative !== 0)\n return (this.negative = 0), this.iadd(num), (this.negative = 1), this._normSign();\n var cmp = this.cmp(num);\n if (cmp === 0) return (this.negative = 0), (this.length = 1), (this.words[0] = 0), this;\n var a, b;\n cmp > 0 ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var carry = 0, i = 0; i < b.length; i++)\n (r = (a.words[i] | 0) - (b.words[i] | 0) + carry), (carry = r >> 26), (this.words[i] = r & 67108863);\n for (; carry !== 0 && i < a.length; i++)\n (r = (a.words[i] | 0) + carry), (carry = r >> 26), (this.words[i] = r & 67108863);\n if (carry === 0 && i < a.length && a !== this) for (; i < a.length; i++) this.words[i] = a.words[i];\n return (this.length = Math.max(this.length, i)), a !== this && (this.negative = 1), this.strip();\n }),\n (BN.prototype.sub = function (num) {\n return this.clone().isub(num);\n });\n function smallMulTo(self2, num, out) {\n out.negative = num.negative ^ self2.negative;\n var len = (self2.length + num.length) | 0;\n (out.length = len), (len = (len - 1) | 0);\n var a = self2.words[0] | 0,\n b = num.words[0] | 0,\n r = a * b,\n lo = r & 67108863,\n carry = (r / 67108864) | 0;\n out.words[0] = lo;\n for (var k = 1; k < len; k++) {\n for (\n var ncarry = carry >>> 26,\n rword = carry & 67108863,\n maxJ = Math.min(k, num.length - 1),\n j = Math.max(0, k - self2.length + 1);\n j <= maxJ;\n j++\n ) {\n var i = (k - j) | 0;\n (a = self2.words[i] | 0),\n (b = num.words[j] | 0),\n (r = a * b + rword),\n (ncarry += (r / 67108864) | 0),\n (rword = r & 67108863);\n }\n (out.words[k] = rword | 0), (carry = ncarry | 0);\n }\n return carry !== 0 ? (out.words[k] = carry | 0) : out.length--, out.strip();\n }\n var comb10MulTo = function (self2, num, out) {\n var a = self2.words,\n b = num.words,\n o = out.words,\n c = 0,\n lo,\n mid,\n hi,\n a0 = a[0] | 0,\n al0 = a0 & 8191,\n ah0 = a0 >>> 13,\n a1 = a[1] | 0,\n al1 = a1 & 8191,\n ah1 = a1 >>> 13,\n a2 = a[2] | 0,\n al2 = a2 & 8191,\n ah2 = a2 >>> 13,\n a3 = a[3] | 0,\n al3 = a3 & 8191,\n ah3 = a3 >>> 13,\n a4 = a[4] | 0,\n al4 = a4 & 8191,\n ah4 = a4 >>> 13,\n a5 = a[5] | 0,\n al5 = a5 & 8191,\n ah5 = a5 >>> 13,\n a6 = a[6] | 0,\n al6 = a6 & 8191,\n ah6 = a6 >>> 13,\n a7 = a[7] | 0,\n al7 = a7 & 8191,\n ah7 = a7 >>> 13,\n a8 = a[8] | 0,\n al8 = a8 & 8191,\n ah8 = a8 >>> 13,\n a9 = a[9] | 0,\n al9 = a9 & 8191,\n ah9 = a9 >>> 13,\n b0 = b[0] | 0,\n bl0 = b0 & 8191,\n bh0 = b0 >>> 13,\n b1 = b[1] | 0,\n bl1 = b1 & 8191,\n bh1 = b1 >>> 13,\n b2 = b[2] | 0,\n bl2 = b2 & 8191,\n bh2 = b2 >>> 13,\n b3 = b[3] | 0,\n bl3 = b3 & 8191,\n bh3 = b3 >>> 13,\n b4 = b[4] | 0,\n bl4 = b4 & 8191,\n bh4 = b4 >>> 13,\n b5 = b[5] | 0,\n bl5 = b5 & 8191,\n bh5 = b5 >>> 13,\n b6 = b[6] | 0,\n bl6 = b6 & 8191,\n bh6 = b6 >>> 13,\n b7 = b[7] | 0,\n bl7 = b7 & 8191,\n bh7 = b7 >>> 13,\n b8 = b[8] | 0,\n bl8 = b8 & 8191,\n bh8 = b8 >>> 13,\n b9 = b[9] | 0,\n bl9 = b9 & 8191,\n bh9 = b9 >>> 13;\n (out.negative = self2.negative ^ num.negative),\n (out.length = 19),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w0 >>> 26)) | 0),\n (w0 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w1 >>> 26)) | 0),\n (w1 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w2 >>> 26)) | 0),\n (w2 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w3 >>> 26)) | 0),\n (w3 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w4 >>> 26)) | 0),\n (w4 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w5 >>> 26)) | 0),\n (w5 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w6 >>> 26)) | 0),\n (w6 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w7 >>> 26)) | 0),\n (w7 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w8 >>> 26)) | 0),\n (w8 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w9 >>> 26)) | 0),\n (w9 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w10 >>> 26)) | 0),\n (w10 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w11 >>> 26)) | 0),\n (w11 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w12 >>> 26)) | 0),\n (w12 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w13 >>> 26)) | 0),\n (w13 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w14 >>> 26)) | 0),\n (w14 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w15 >>> 26)) | 0),\n (w15 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w16 >>> 26)) | 0),\n (w16 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w17 >>> 26)) | 0),\n (w17 &= 67108863),\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 & 8191) << 13)) | 0;\n return (\n (c = (((hi + (mid >>> 13)) | 0) + (w18 >>> 26)) | 0),\n (w18 &= 67108863),\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 c !== 0 && ((o[19] = c), out.length++),\n out\n );\n };\n Math.imul || (comb10MulTo = smallMulTo);\n function bigMulTo(self2, num, out) {\n (out.negative = num.negative ^ self2.negative), (out.length = self2.length + num.length);\n for (var carry = 0, hncarry = 0, k = 0; k < out.length - 1; k++) {\n var ncarry = hncarry;\n hncarry = 0;\n for (\n var rword = carry & 67108863, maxJ = Math.min(k, num.length - 1), j = Math.max(0, k - self2.length + 1);\n j <= maxJ;\n j++\n ) {\n var i = k - j,\n a = self2.words[i] | 0,\n b = num.words[j] | 0,\n r = a * b,\n lo = r & 67108863;\n (ncarry = (ncarry + ((r / 67108864) | 0)) | 0),\n (lo = (lo + rword) | 0),\n (rword = lo & 67108863),\n (ncarry = (ncarry + (lo >>> 26)) | 0),\n (hncarry += ncarry >>> 26),\n (ncarry &= 67108863);\n }\n (out.words[k] = rword), (carry = ncarry), (ncarry = hncarry);\n }\n return carry !== 0 ? (out.words[k] = carry) : out.length--, out.strip();\n }\n function jumboMulTo(self2, num, out) {\n var fftm = new FFTM();\n return fftm.mulp(self2, num, out);\n }\n BN.prototype.mulTo = function (num, out) {\n var res,\n len = this.length + num.length;\n return (\n this.length === 10 && num.length === 10\n ? (res = comb10MulTo(this, num, out))\n : len < 63\n ? (res = smallMulTo(this, num, out))\n : len < 1024\n ? (res = bigMulTo(this, num, out))\n : (res = jumboMulTo(this, num, out)),\n res\n );\n };\n function FFTM(x, y) {\n (this.x = x), (this.y = y);\n }\n (FFTM.prototype.makeRBT = function (N) {\n for (var t = new Array(N), l = BN.prototype._countBits(N) - 1, i = 0; i < N; i++) t[i] = this.revBin(i, l, N);\n return t;\n }),\n (FFTM.prototype.revBin = function (x, l, N) {\n if (x === 0 || x === N - 1) return x;\n for (var rb = 0, i = 0; i < l; i++) (rb |= (x & 1) << (l - i - 1)), (x >>= 1);\n return rb;\n }),\n (FFTM.prototype.permute = function (rbt, rws, iws, rtws, itws, N) {\n for (var i = 0; i < N; i++) (rtws[i] = rws[rbt[i]]), (itws[i] = iws[rbt[i]]);\n }),\n (FFTM.prototype.transform = function (rws, iws, rtws, itws, N, rbt) {\n this.permute(rbt, rws, iws, rtws, itws, N);\n for (var s = 1; s < N; s <<= 1)\n for (\n var l = s << 1, rtwdf = Math.cos((2 * Math.PI) / l), itwdf = Math.sin((2 * Math.PI) / l), p = 0;\n p < N;\n p += l\n )\n for (var rtwdf_ = rtwdf, itwdf_ = itwdf, j = 0; j < s; j++) {\n var re = rtws[p + j],\n ie = itws[p + j],\n ro = rtws[p + j + s],\n io = itws[p + j + s],\n rx = rtwdf_ * ro - itwdf_ * io;\n (io = rtwdf_ * io + itwdf_ * ro),\n (ro = rx),\n (rtws[p + j] = re + ro),\n (itws[p + j] = ie + io),\n (rtws[p + j + s] = re - ro),\n (itws[p + j + s] = ie - io),\n j !== l &&\n ((rx = rtwdf * rtwdf_ - itwdf * itwdf_), (itwdf_ = rtwdf * itwdf_ + itwdf * rtwdf_), (rtwdf_ = rx));\n }\n }),\n (FFTM.prototype.guessLen13b = function (n, m) {\n var N = Math.max(m, n) | 1,\n odd = N & 1,\n i = 0;\n for (N = (N / 2) | 0; N; N = N >>> 1) i++;\n return 1 << (i + 1 + odd);\n }),\n (FFTM.prototype.conjugate = function (rws, iws, N) {\n if (!(N <= 1))\n for (var i = 0; i < N / 2; i++) {\n var t = rws[i];\n (rws[i] = rws[N - i - 1]),\n (rws[N - i - 1] = t),\n (t = iws[i]),\n (iws[i] = -iws[N - i - 1]),\n (iws[N - i - 1] = -t);\n }\n }),\n (FFTM.prototype.normalize13b = function (ws, N) {\n for (var carry = 0, i = 0; i < N / 2; i++) {\n var w = Math.round(ws[2 * i + 1] / N) * 8192 + Math.round(ws[2 * i] / N) + carry;\n (ws[i] = w & 67108863), w < 67108864 ? (carry = 0) : (carry = (w / 67108864) | 0);\n }\n return ws;\n }),\n (FFTM.prototype.convert13b = function (ws, len, rws, N) {\n for (var carry = 0, i = 0; i < len; i++)\n (carry = carry + (ws[i] | 0)),\n (rws[2 * i] = carry & 8191),\n (carry = carry >>> 13),\n (rws[2 * i + 1] = carry & 8191),\n (carry = carry >>> 13);\n for (i = 2 * len; i < N; ++i) rws[i] = 0;\n assert(carry === 0), assert((carry & -8192) === 0);\n }),\n (FFTM.prototype.stub = function (N) {\n for (var ph = new Array(N), i = 0; i < N; i++) ph[i] = 0;\n return ph;\n }),\n (FFTM.prototype.mulp = function (x, y, out) {\n var N = 2 * this.guessLen13b(x.length, y.length),\n rbt = this.makeRBT(N),\n _ = this.stub(N),\n rws = new Array(N),\n rwst = new Array(N),\n iwst = new Array(N),\n nrws = new Array(N),\n nrwst = new Array(N),\n niwst = new Array(N),\n rmws = out.words;\n (rmws.length = N),\n this.convert13b(x.words, x.length, rws, N),\n this.convert13b(y.words, y.length, nrws, N),\n this.transform(rws, _, rwst, iwst, N, rbt),\n this.transform(nrws, _, nrwst, niwst, N, rbt);\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]), (rwst[i] = rx);\n }\n return (\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 (out.negative = x.negative ^ y.negative),\n (out.length = x.length + y.length),\n out.strip()\n );\n }),\n (BN.prototype.mul = function (num) {\n var out = new BN(null);\n return (out.words = new Array(this.length + num.length)), this.mulTo(num, out);\n }),\n (BN.prototype.mulf = function (num) {\n var out = new BN(null);\n return (out.words = new Array(this.length + num.length)), jumboMulTo(this, num, out);\n }),\n (BN.prototype.imul = function (num) {\n return this.clone().mulTo(num, this);\n }),\n (BN.prototype.imuln = function (num) {\n assert(typeof num == \"number\"), assert(num < 67108864);\n for (var carry = 0, i = 0; i < this.length; i++) {\n var w = (this.words[i] | 0) * num,\n lo = (w & 67108863) + (carry & 67108863);\n (carry >>= 26), (carry += (w / 67108864) | 0), (carry += lo >>> 26), (this.words[i] = lo & 67108863);\n }\n return carry !== 0 && ((this.words[i] = carry), this.length++), this;\n }),\n (BN.prototype.muln = function (num) {\n return this.clone().imuln(num);\n }),\n (BN.prototype.sqr = function () {\n return this.mul(this);\n }),\n (BN.prototype.isqr = function () {\n return this.imul(this.clone());\n }),\n (BN.prototype.pow = function (num) {\n var w = toBitArray(num);\n if (w.length === 0) return new BN(1);\n for (var res = this, i = 0; i < w.length && w[i] === 0; i++, res = res.sqr());\n if (++i < w.length) for (var q = res.sqr(); i < w.length; i++, q = q.sqr()) w[i] !== 0 && (res = res.mul(q));\n return res;\n }),\n (BN.prototype.iushln = function (bits) {\n assert(typeof bits == \"number\" && bits >= 0);\n var r = bits % 26,\n s = (bits - r) / 26,\n carryMask = (67108863 >>> (26 - r)) << (26 - r),\n i;\n if (r !== 0) {\n var carry = 0;\n for (i = 0; i < this.length; i++) {\n var newCarry = this.words[i] & carryMask,\n c = ((this.words[i] | 0) - newCarry) << r;\n (this.words[i] = c | carry), (carry = newCarry >>> (26 - r));\n }\n carry && ((this.words[i] = carry), this.length++);\n }\n if (s !== 0) {\n for (i = this.length - 1; i >= 0; i--) this.words[i + s] = this.words[i];\n for (i = 0; i < s; i++) this.words[i] = 0;\n this.length += s;\n }\n return this.strip();\n }),\n (BN.prototype.ishln = function (bits) {\n return assert(this.negative === 0), this.iushln(bits);\n }),\n (BN.prototype.iushrn = function (bits, hint, extended) {\n assert(typeof bits == \"number\" && bits >= 0);\n var h;\n hint ? (h = (hint - (hint % 26)) / 26) : (h = 0);\n var r = bits % 26,\n s = Math.min((bits - r) / 26, this.length),\n mask = 67108863 ^ ((67108863 >>> r) << r),\n maskedWords = extended;\n if (((h -= s), (h = Math.max(0, h)), maskedWords)) {\n for (var i = 0; i < s; i++) maskedWords.words[i] = this.words[i];\n maskedWords.length = s;\n }\n if (s !== 0)\n if (this.length > s) for (this.length -= s, i = 0; i < this.length; i++) this.words[i] = this.words[i + s];\n else (this.words[0] = 0), (this.length = 1);\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)), (carry = word & mask);\n }\n return (\n maskedWords && carry !== 0 && (maskedWords.words[maskedWords.length++] = carry),\n this.length === 0 && ((this.words[0] = 0), (this.length = 1)),\n this.strip()\n );\n }),\n (BN.prototype.ishrn = function (bits, hint, extended) {\n return assert(this.negative === 0), this.iushrn(bits, hint, extended);\n }),\n (BN.prototype.shln = function (bits) {\n return this.clone().ishln(bits);\n }),\n (BN.prototype.ushln = function (bits) {\n return this.clone().iushln(bits);\n }),\n (BN.prototype.shrn = function (bits) {\n return this.clone().ishrn(bits);\n }),\n (BN.prototype.ushrn = function (bits) {\n return this.clone().iushrn(bits);\n }),\n (BN.prototype.testn = function (bit) {\n assert(typeof bit == \"number\" && bit >= 0);\n var r = bit % 26,\n s = (bit - r) / 26,\n q = 1 << r;\n if (this.length <= s) return !1;\n var w = this.words[s];\n return !!(w & q);\n }),\n (BN.prototype.imaskn = function (bits) {\n assert(typeof bits == \"number\" && bits >= 0);\n var r = bits % 26,\n s = (bits - r) / 26;\n if ((assert(this.negative === 0, \"imaskn works only with positive numbers\"), this.length <= s)) return this;\n if ((r !== 0 && s++, (this.length = Math.min(s, this.length)), r !== 0)) {\n var mask = 67108863 ^ ((67108863 >>> r) << r);\n this.words[this.length - 1] &= mask;\n }\n return this.strip();\n }),\n (BN.prototype.maskn = function (bits) {\n return this.clone().imaskn(bits);\n }),\n (BN.prototype.iaddn = function (num) {\n return (\n assert(typeof num == \"number\"),\n assert(num < 67108864),\n num < 0\n ? this.isubn(-num)\n : this.negative !== 0\n ? this.length === 1 && (this.words[0] | 0) < num\n ? ((this.words[0] = num - (this.words[0] | 0)), (this.negative = 0), this)\n : ((this.negative = 0), this.isubn(num), (this.negative = 1), this)\n : this._iaddn(num)\n );\n }),\n (BN.prototype._iaddn = function (num) {\n this.words[0] += num;\n for (var i = 0; i < this.length && this.words[i] >= 67108864; i++)\n (this.words[i] -= 67108864), i === this.length - 1 ? (this.words[i + 1] = 1) : this.words[i + 1]++;\n return (this.length = Math.max(this.length, i + 1)), this;\n }),\n (BN.prototype.isubn = function (num) {\n if ((assert(typeof num == \"number\"), assert(num < 67108864), num < 0)) return this.iaddn(-num);\n if (this.negative !== 0) return (this.negative = 0), this.iaddn(num), (this.negative = 1), this;\n if (((this.words[0] -= num), this.length === 1 && this.words[0] < 0))\n (this.words[0] = -this.words[0]), (this.negative = 1);\n else\n for (var i = 0; i < this.length && this.words[i] < 0; i++)\n (this.words[i] += 67108864), (this.words[i + 1] -= 1);\n return this.strip();\n }),\n (BN.prototype.addn = function (num) {\n return this.clone().iaddn(num);\n }),\n (BN.prototype.subn = function (num) {\n return this.clone().isubn(num);\n }),\n (BN.prototype.iabs = function () {\n return (this.negative = 0), this;\n }),\n (BN.prototype.abs = function () {\n return this.clone().iabs();\n }),\n (BN.prototype._ishlnsubmul = function (num, mul, shift) {\n var len = num.length + shift,\n i;\n this._expand(len);\n var w,\n 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 & 67108863),\n (carry = (w >> 26) - ((right / 67108864) | 0)),\n (this.words[i + shift] = w & 67108863);\n }\n for (; i < this.length - shift; i++)\n (w = (this.words[i + shift] | 0) + carry), (carry = w >> 26), (this.words[i + shift] = w & 67108863);\n if (carry === 0) return this.strip();\n for (assert(carry === -1), carry = 0, i = 0; i < this.length; i++)\n (w = -(this.words[i] | 0) + carry), (carry = w >> 26), (this.words[i] = w & 67108863);\n return (this.negative = 1), this.strip();\n }),\n (BN.prototype._wordDiv = function (num, mode) {\n var shift = this.length - num.length,\n a = this.clone(),\n b = num,\n bhi = b.words[b.length - 1] | 0,\n bhiBits = this._countBits(bhi);\n (shift = 26 - bhiBits),\n shift !== 0 && ((b = b.ushln(shift)), a.iushln(shift), (bhi = b.words[b.length - 1] | 0));\n var m = a.length - b.length,\n q;\n if (mode !== \"mod\") {\n (q = new BN(null)), (q.length = m + 1), (q.words = new Array(q.length));\n for (var i = 0; i < q.length; i++) q.words[i] = 0;\n }\n var diff = a.clone()._ishlnsubmul(b, 1, m);\n diff.negative === 0 && ((a = diff), q && (q.words[m] = 1));\n for (var j = m - 1; j >= 0; j--) {\n var qj = (a.words[b.length + j] | 0) * 67108864 + (a.words[b.length + j - 1] | 0);\n for (qj = Math.min((qj / bhi) | 0, 67108863), a._ishlnsubmul(b, qj, j); a.negative !== 0; )\n qj--, (a.negative = 0), a._ishlnsubmul(b, 1, j), a.isZero() || (a.negative ^= 1);\n q && (q.words[j] = qj);\n }\n return (\n q && q.strip(),\n a.strip(),\n mode !== \"div\" && shift !== 0 && a.iushrn(shift),\n {\n div: q || null,\n mod: a,\n }\n );\n }),\n (BN.prototype.divmod = function (num, mode, positive) {\n if ((assert(!num.isZero()), this.isZero()))\n return {\n div: new BN(0),\n mod: new BN(0),\n };\n var div, mod, res;\n return this.negative !== 0 && num.negative === 0\n ? ((res = this.neg().divmod(num, mode)),\n mode !== \"mod\" && (div = res.div.neg()),\n mode !== \"div\" && ((mod = res.mod.neg()), positive && mod.negative !== 0 && mod.iadd(num)),\n {\n div,\n mod,\n })\n : this.negative === 0 && num.negative !== 0\n ? ((res = this.divmod(num.neg(), mode)),\n mode !== \"mod\" && (div = res.div.neg()),\n {\n div,\n mod: res.mod,\n })\n : (this.negative & num.negative) !== 0\n ? ((res = this.neg().divmod(num.neg(), mode)),\n mode !== \"div\" && ((mod = res.mod.neg()), positive && mod.negative !== 0 && mod.isub(num)),\n {\n div: res.div,\n mod,\n })\n : num.length > this.length || this.cmp(num) < 0\n ? {\n div: new BN(0),\n mod: this,\n }\n : num.length === 1\n ? mode === \"div\"\n ? {\n div: this.divn(num.words[0]),\n mod: null,\n }\n : mode === \"mod\"\n ? {\n div: null,\n mod: new BN(this.modn(num.words[0])),\n }\n : {\n div: this.divn(num.words[0]),\n mod: new BN(this.modn(num.words[0])),\n }\n : this._wordDiv(num, mode);\n }),\n (BN.prototype.div = function (num) {\n return this.divmod(num, \"div\", !1).div;\n }),\n (BN.prototype.mod = function (num) {\n return this.divmod(num, \"mod\", !1).mod;\n }),\n (BN.prototype.umod = function (num) {\n return this.divmod(num, \"mod\", !0).mod;\n }),\n (BN.prototype.divRound = function (num) {\n var dm = this.divmod(num);\n if (dm.mod.isZero()) return dm.div;\n var mod = dm.div.negative !== 0 ? dm.mod.isub(num) : dm.mod,\n half = num.ushrn(1),\n r2 = num.andln(1),\n cmp = mod.cmp(half);\n return cmp < 0 || (r2 === 1 && cmp === 0)\n ? dm.div\n : dm.div.negative !== 0\n ? dm.div.isubn(1)\n : dm.div.iaddn(1);\n }),\n (BN.prototype.modn = function (num) {\n assert(num <= 67108863);\n for (var p = (1 << 26) % num, acc = 0, i = this.length - 1; i >= 0; i--)\n acc = (p * acc + (this.words[i] | 0)) % num;\n return acc;\n }),\n (BN.prototype.idivn = function (num) {\n assert(num <= 67108863);\n for (var carry = 0, i = this.length - 1; i >= 0; i--) {\n var w = (this.words[i] | 0) + carry * 67108864;\n (this.words[i] = (w / num) | 0), (carry = w % num);\n }\n return this.strip();\n }),\n (BN.prototype.divn = function (num) {\n return this.clone().idivn(num);\n }),\n (BN.prototype.egcd = function (p) {\n assert(p.negative === 0), assert(!p.isZero());\n var x = this,\n y = p.clone();\n x.negative !== 0 ? (x = x.umod(p)) : (x = x.clone());\n for (var A = new BN(1), B = new BN(0), C = new BN(0), D = new BN(1), g = 0; x.isEven() && y.isEven(); )\n x.iushrn(1), y.iushrn(1), ++g;\n for (var yp = y.clone(), xp = x.clone(); !x.isZero(); ) {\n for (var i = 0, im = 1; (x.words[0] & im) === 0 && i < 26; ++i, im <<= 1);\n if (i > 0)\n for (x.iushrn(i); i-- > 0; )\n (A.isOdd() || B.isOdd()) && (A.iadd(yp), B.isub(xp)), A.iushrn(1), B.iushrn(1);\n for (var j = 0, jm = 1; (y.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n if (j > 0)\n for (y.iushrn(j); j-- > 0; )\n (C.isOdd() || D.isOdd()) && (C.iadd(yp), D.isub(xp)), C.iushrn(1), D.iushrn(1);\n x.cmp(y) >= 0 ? (x.isub(y), A.isub(C), B.isub(D)) : (y.isub(x), C.isub(A), D.isub(B));\n }\n return {\n a: C,\n b: D,\n gcd: y.iushln(g),\n };\n }),\n (BN.prototype._invmp = function (p) {\n assert(p.negative === 0), assert(!p.isZero());\n var a = this,\n b = p.clone();\n a.negative !== 0 ? (a = a.umod(p)) : (a = a.clone());\n for (var x1 = new BN(1), x2 = new BN(0), delta = b.clone(); 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) for (a.iushrn(i); i-- > 0; ) x1.isOdd() && x1.iadd(delta), x1.iushrn(1);\n for (var j = 0, jm = 1; (b.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n if (j > 0) for (b.iushrn(j); j-- > 0; ) x2.isOdd() && x2.iadd(delta), x2.iushrn(1);\n a.cmp(b) >= 0 ? (a.isub(b), x1.isub(x2)) : (b.isub(a), x2.isub(x1));\n }\n var res;\n return a.cmpn(1) === 0 ? (res = x1) : (res = x2), res.cmpn(0) < 0 && res.iadd(p), res;\n }),\n (BN.prototype.gcd = function (num) {\n if (this.isZero()) return num.abs();\n if (num.isZero()) return this.abs();\n var a = this.clone(),\n b = num.clone();\n (a.negative = 0), (b.negative = 0);\n for (var shift = 0; a.isEven() && b.isEven(); shift++) a.iushrn(1), b.iushrn(1);\n do {\n for (; a.isEven(); ) a.iushrn(1);\n for (; b.isEven(); ) b.iushrn(1);\n var r = a.cmp(b);\n if (r < 0) {\n var t = a;\n (a = b), (b = t);\n } else if (r === 0 || b.cmpn(1) === 0) break;\n a.isub(b);\n } while (!0);\n return b.iushln(shift);\n }),\n (BN.prototype.invm = function (num) {\n return this.egcd(num).a.umod(num);\n }),\n (BN.prototype.isEven = function () {\n return (this.words[0] & 1) === 0;\n }),\n (BN.prototype.isOdd = function () {\n return (this.words[0] & 1) === 1;\n }),\n (BN.prototype.andln = function (num) {\n return this.words[0] & num;\n }),\n (BN.prototype.bincn = function (bit) {\n assert(typeof bit == \"number\");\n var r = bit % 26,\n s = (bit - r) / 26,\n q = 1 << r;\n if (this.length <= s) return this._expand(s + 1), (this.words[s] |= q), this;\n for (var carry = q, i = s; carry !== 0 && i < this.length; i++) {\n var w = this.words[i] | 0;\n (w += carry), (carry = w >>> 26), (w &= 67108863), (this.words[i] = w);\n }\n return carry !== 0 && ((this.words[i] = carry), this.length++), this;\n }),\n (BN.prototype.isZero = function () {\n return this.length === 1 && this.words[0] === 0;\n }),\n (BN.prototype.cmpn = function (num) {\n var negative = num < 0;\n if (this.negative !== 0 && !negative) return -1;\n if (this.negative === 0 && negative) return 1;\n this.strip();\n var res;\n if (this.length > 1) res = 1;\n else {\n negative && (num = -num), assert(num <= 67108863, \"Number is too big\");\n var w = this.words[0] | 0;\n res = w === num ? 0 : w < num ? -1 : 1;\n }\n return this.negative !== 0 ? -res | 0 : res;\n }),\n (BN.prototype.cmp = function (num) {\n if (this.negative !== 0 && num.negative === 0) return -1;\n if (this.negative === 0 && num.negative !== 0) return 1;\n var res = this.ucmp(num);\n return this.negative !== 0 ? -res | 0 : res;\n }),\n (BN.prototype.ucmp = function (num) {\n if (this.length > num.length) return 1;\n if (this.length < num.length) return -1;\n for (var res = 0, i = this.length - 1; i >= 0; i--) {\n var a = this.words[i] | 0,\n b = num.words[i] | 0;\n if (a !== b) {\n a < b ? (res = -1) : a > b && (res = 1);\n break;\n }\n }\n return res;\n }),\n (BN.prototype.gtn = function (num) {\n return this.cmpn(num) === 1;\n }),\n (BN.prototype.gt = function (num) {\n return this.cmp(num) === 1;\n }),\n (BN.prototype.gten = function (num) {\n return this.cmpn(num) >= 0;\n }),\n (BN.prototype.gte = function (num) {\n return this.cmp(num) >= 0;\n }),\n (BN.prototype.ltn = function (num) {\n return this.cmpn(num) === -1;\n }),\n (BN.prototype.lt = function (num) {\n return this.cmp(num) === -1;\n }),\n (BN.prototype.lten = function (num) {\n return this.cmpn(num) <= 0;\n }),\n (BN.prototype.lte = function (num) {\n return this.cmp(num) <= 0;\n }),\n (BN.prototype.eqn = function (num) {\n return this.cmpn(num) === 0;\n }),\n (BN.prototype.eq = function (num) {\n return this.cmp(num) === 0;\n }),\n (BN.red = function (num) {\n return new Red(num);\n }),\n (BN.prototype.toRed = function (ctx) {\n return (\n assert(!this.red, \"Already a number in reduction context\"),\n assert(this.negative === 0, \"red works only with positives\"),\n ctx.convertTo(this)._forceRed(ctx)\n );\n }),\n (BN.prototype.fromRed = function () {\n return assert(this.red, \"fromRed works only with numbers in reduction context\"), this.red.convertFrom(this);\n }),\n (BN.prototype._forceRed = function (ctx) {\n return (this.red = ctx), this;\n }),\n (BN.prototype.forceRed = function (ctx) {\n return assert(!this.red, \"Already a number in reduction context\"), this._forceRed(ctx);\n }),\n (BN.prototype.redAdd = function (num) {\n return assert(this.red, \"redAdd works only with red numbers\"), this.red.add(this, num);\n }),\n (BN.prototype.redIAdd = function (num) {\n return assert(this.red, \"redIAdd works only with red numbers\"), this.red.iadd(this, num);\n }),\n (BN.prototype.redSub = function (num) {\n return assert(this.red, \"redSub works only with red numbers\"), this.red.sub(this, num);\n }),\n (BN.prototype.redISub = function (num) {\n return assert(this.red, \"redISub works only with red numbers\"), this.red.isub(this, num);\n }),\n (BN.prototype.redShl = function (num) {\n return assert(this.red, \"redShl works only with red numbers\"), this.red.shl(this, num);\n }),\n (BN.prototype.redMul = function (num) {\n return (\n assert(this.red, \"redMul works only with red numbers\"),\n this.red._verify2(this, num),\n this.red.mul(this, num)\n );\n }),\n (BN.prototype.redIMul = function (num) {\n return (\n assert(this.red, \"redMul works only with red numbers\"),\n this.red._verify2(this, num),\n this.red.imul(this, num)\n );\n }),\n (BN.prototype.redSqr = function () {\n return assert(this.red, \"redSqr works only with red numbers\"), this.red._verify1(this), this.red.sqr(this);\n }),\n (BN.prototype.redISqr = function () {\n return assert(this.red, \"redISqr works only with red numbers\"), this.red._verify1(this), this.red.isqr(this);\n }),\n (BN.prototype.redSqrt = function () {\n return assert(this.red, \"redSqrt works only with red numbers\"), this.red._verify1(this), this.red.sqrt(this);\n }),\n (BN.prototype.redInvm = function () {\n return assert(this.red, \"redInvm works only with red numbers\"), this.red._verify1(this), this.red.invm(this);\n }),\n (BN.prototype.redNeg = function () {\n return assert(this.red, \"redNeg works only with red numbers\"), this.red._verify1(this), this.red.neg(this);\n }),\n (BN.prototype.redPow = function (num) {\n return assert(this.red && !num.red, \"redPow(normalNum)\"), this.red._verify1(this), this.red.pow(this, num);\n });\n var primes = {\n k256: null,\n p224: null,\n p192: null,\n p25519: null,\n };\n function MPrime(name, p) {\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 (this.tmp = this._tmp());\n }\n (MPrime.prototype._tmp = function () {\n var tmp = new BN(null);\n return (tmp.words = new Array(Math.ceil(this.n / 13))), tmp;\n }),\n (MPrime.prototype.ireduce = function (num) {\n var r = num,\n rlen;\n do this.split(r, this.tmp), (r = this.imulK(r)), (r = r.iadd(this.tmp)), (rlen = r.bitLength());\n while (rlen > this.n);\n var cmp = rlen < this.n ? -1 : r.ucmp(this.p);\n return (\n cmp === 0\n ? ((r.words[0] = 0), (r.length = 1))\n : cmp > 0\n ? r.isub(this.p)\n : r.strip !== void 0\n ? r.strip()\n : r._strip(),\n r\n );\n }),\n (MPrime.prototype.split = function (input, out) {\n input.iushrn(this.n, 0, out);\n }),\n (MPrime.prototype.imulK = function (num) {\n return num.imul(this.k);\n });\n function K256() {\n MPrime.call(this, \"k256\", \"ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f\");\n }\n inherits(K256, MPrime),\n (K256.prototype.split = function (input, output) {\n for (var mask = 4194303, outLen = Math.min(input.length, 9), i = 0; i < outLen; i++)\n output.words[i] = input.words[i];\n if (((output.length = outLen), input.length <= 9)) {\n (input.words[0] = 0), (input.length = 1);\n return;\n }\n var prev = input.words[9];\n for (output.words[output.length++] = prev & mask, i = 10; i < input.length; i++) {\n var next = input.words[i] | 0;\n (input.words[i - 10] = ((next & mask) << 4) | (prev >>> 22)), (prev = next);\n }\n (prev >>>= 22),\n (input.words[i - 10] = prev),\n prev === 0 && input.length > 10 ? (input.length -= 10) : (input.length -= 9);\n }),\n (K256.prototype.imulK = function (num) {\n (num.words[num.length] = 0), (num.words[num.length + 1] = 0), (num.length += 2);\n for (var lo = 0, i = 0; i < num.length; i++) {\n var w = num.words[i] | 0;\n (lo += w * 977), (num.words[i] = lo & 67108863), (lo = w * 64 + ((lo / 67108864) | 0));\n }\n return (\n num.words[num.length - 1] === 0 && (num.length--, num.words[num.length - 1] === 0 && num.length--), num\n );\n });\n function P224() {\n MPrime.call(this, \"p224\", \"ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001\");\n }\n inherits(P224, MPrime);\n function P192() {\n MPrime.call(this, \"p192\", \"ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff\");\n }\n inherits(P192, MPrime);\n function P25519() {\n MPrime.call(this, \"25519\", \"7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed\");\n }\n inherits(P25519, MPrime),\n (P25519.prototype.imulK = function (num) {\n for (var carry = 0, i = 0; i < num.length; i++) {\n var hi = (num.words[i] | 0) * 19 + carry,\n lo = hi & 67108863;\n (hi >>>= 26), (num.words[i] = lo), (carry = hi);\n }\n return carry !== 0 && (num.words[num.length++] = carry), num;\n }),\n (BN._prime = function (name) {\n if (primes[name]) return primes[name];\n var prime2;\n if (name === \"k256\") prime2 = new K256();\n else if (name === \"p224\") prime2 = new P224();\n else if (name === \"p192\") prime2 = new P192();\n else if (name === \"p25519\") prime2 = new P25519();\n else throw new Error(\"Unknown prime \" + name);\n return (primes[name] = prime2), prime2;\n });\n function Red(m) {\n if (typeof m == \"string\") {\n var prime = BN._prime(m);\n (this.m = prime.p), (this.prime = prime);\n } else assert(m.gtn(1), \"modulus must be greater than 1\"), (this.m = m), (this.prime = null);\n }\n (Red.prototype._verify1 = function (a) {\n assert(a.negative === 0, \"red works only with positives\"), assert(a.red, \"red works only with red numbers\");\n }),\n (Red.prototype._verify2 = function (a, b) {\n assert((a.negative | b.negative) === 0, \"red works only with positives\"),\n assert(a.red && a.red === b.red, \"red works only with red numbers\");\n }),\n (Red.prototype.imod = function (a) {\n return this.prime ? this.prime.ireduce(a)._forceRed(this) : a.umod(this.m)._forceRed(this);\n }),\n (Red.prototype.neg = function (a) {\n return a.isZero() ? a.clone() : this.m.sub(a)._forceRed(this);\n }),\n (Red.prototype.add = function (a, b) {\n this._verify2(a, b);\n var res = a.add(b);\n return res.cmp(this.m) >= 0 && res.isub(this.m), res._forceRed(this);\n }),\n (Red.prototype.iadd = function (a, b) {\n this._verify2(a, b);\n var res = a.iadd(b);\n return res.cmp(this.m) >= 0 && res.isub(this.m), res;\n }),\n (Red.prototype.sub = function (a, b) {\n this._verify2(a, b);\n var res = a.sub(b);\n return res.cmpn(0) < 0 && res.iadd(this.m), res._forceRed(this);\n }),\n (Red.prototype.isub = function (a, b) {\n this._verify2(a, b);\n var res = a.isub(b);\n return res.cmpn(0) < 0 && res.iadd(this.m), res;\n }),\n (Red.prototype.shl = function (a, num) {\n return this._verify1(a), this.imod(a.ushln(num));\n }),\n (Red.prototype.imul = function (a, b) {\n return this._verify2(a, b), this.imod(a.imul(b));\n }),\n (Red.prototype.mul = function (a, b) {\n return this._verify2(a, b), this.imod(a.mul(b));\n }),\n (Red.prototype.isqr = function (a) {\n return this.imul(a, a.clone());\n }),\n (Red.prototype.sqr = function (a) {\n return this.mul(a, a);\n }),\n (Red.prototype.sqrt = function (a) {\n if (a.isZero()) return a.clone();\n var mod3 = this.m.andln(3);\n if ((assert(mod3 % 2 === 1), mod3 === 3)) {\n var pow = this.m.add(new BN(1)).iushrn(2);\n return this.pow(a, pow);\n }\n for (var q = this.m.subn(1), s = 0; !q.isZero() && q.andln(1) === 0; ) s++, q.iushrn(1);\n assert(!q.isZero());\n var one = new BN(1).toRed(this),\n nOne = one.redNeg(),\n lpow = this.m.subn(1).iushrn(1),\n z = this.m.bitLength();\n for (z = new BN(2 * z * z).toRed(this); this.pow(z, lpow).cmp(nOne) !== 0; ) z.redIAdd(nOne);\n for (\n var c = this.pow(z, q), r = this.pow(a, q.addn(1).iushrn(1)), t = this.pow(a, q), m = s;\n t.cmp(one) !== 0;\n\n ) {\n for (var tmp = t, i = 0; tmp.cmp(one) !== 0; i++) tmp = tmp.redSqr();\n assert(i < m);\n var b = this.pow(c, new BN(1).iushln(m - i - 1));\n (r = r.redMul(b)), (c = b.redSqr()), (t = t.redMul(c)), (m = i);\n }\n return r;\n }),\n (Red.prototype.invm = function (a) {\n var inv = a._invmp(this.m);\n return inv.negative !== 0 ? ((inv.negative = 0), this.imod(inv).redNeg()) : this.imod(inv);\n }),\n (Red.prototype.pow = function (a, num) {\n if (num.isZero()) return new BN(1).toRed(this);\n if (num.cmpn(1) === 0) return a.clone();\n var windowSize = 4,\n wnd = new Array(1 << windowSize);\n (wnd[0] = new BN(1).toRed(this)), (wnd[1] = a);\n for (var i = 2; i < wnd.length; i++) wnd[i] = this.mul(wnd[i - 1], a);\n var res = wnd[0],\n current = 0,\n currentLen = 0,\n start = num.bitLength() % 26;\n for (start === 0 && (start = 26), i = num.length - 1; i >= 0; i--) {\n for (var word = num.words[i], j = start - 1; j >= 0; j--) {\n var bit = (word >> j) & 1;\n if ((res !== wnd[0] && (res = this.sqr(res)), bit === 0 && current === 0)) {\n currentLen = 0;\n continue;\n }\n (current <<= 1),\n (current |= bit),\n currentLen++,\n !(currentLen !== windowSize && (i !== 0 || j !== 0)) &&\n ((res = this.mul(res, wnd[current])), (currentLen = 0), (current = 0));\n }\n start = 26;\n }\n return res;\n }),\n (Red.prototype.convertTo = function (num) {\n var r = num.umod(this.m);\n return r === num ? r.clone() : r;\n }),\n (Red.prototype.convertFrom = function (num) {\n var res = num.clone();\n return (res.red = null), res;\n }),\n (BN.mont = function (num) {\n return new Mont(num);\n });\n function Mont(m) {\n Red.call(this, m),\n (this.shift = this.m.bitLength()),\n this.shift % 26 !== 0 && (this.shift += 26 - (this.shift % 26)),\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 (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 (Mont.prototype.convertTo = function (num) {\n return this.imod(num.ushln(this.shift));\n }),\n (Mont.prototype.convertFrom = function (num) {\n var r = this.imod(num.mul(this.rinv));\n return (r.red = null), r;\n }),\n (Mont.prototype.imul = function (a, b) {\n if (a.isZero() || b.isZero()) return (a.words[0] = 0), (a.length = 1), a;\n var t = a.imul(b),\n c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m),\n u = t.isub(c).iushrn(this.shift),\n res = u;\n return (\n u.cmp(this.m) >= 0 ? (res = u.isub(this.m)) : u.cmpn(0) < 0 && (res = u.iadd(this.m)), res._forceRed(this)\n );\n }),\n (Mont.prototype.mul = function (a, b) {\n if (a.isZero() || b.isZero()) return new BN(0)._forceRed(this);\n var t = a.mul(b),\n c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m),\n u = t.isub(c).iushrn(this.shift),\n res = u;\n return (\n u.cmp(this.m) >= 0 ? (res = u.isub(this.m)) : u.cmpn(0) < 0 && (res = u.iadd(this.m)), res._forceRed(this)\n );\n }),\n (Mont.prototype.invm = function (a) {\n var res = this.imod(a._invmp(this.m).mul(this.r2));\n return res._forceRed(this);\n });\n })(typeof module > \"u\" || module, exports);\n },\n});\n\n// node_modules/create-ecdh/browser.js\nvar require_browser9 = __commonJS({\n \"node_modules/create-ecdh/browser.js\"(exports, module) {\n var elliptic = require_elliptic(),\n BN = require_bn6();\n module.exports = function (curve) {\n return new ECDH(curve);\n };\n var aliases = {\n secp256k1: {\n name: \"secp256k1\",\n byteLength: 32,\n },\n secp224r1: {\n name: \"p224\",\n byteLength: 28,\n },\n prime256v1: {\n name: \"p256\",\n byteLength: 32,\n },\n prime192v1: {\n name: \"p192\",\n byteLength: 24,\n },\n ed25519: {\n name: \"ed25519\",\n byteLength: 32,\n },\n secp384r1: {\n name: \"p384\",\n byteLength: 48,\n },\n secp521r1: {\n name: \"p521\",\n byteLength: 66,\n },\n };\n aliases.p224 = aliases.secp224r1;\n aliases.p256 = aliases.secp256r1 = aliases.prime256v1;\n aliases.p192 = aliases.secp192r1 = aliases.prime192v1;\n aliases.p384 = aliases.secp384r1;\n aliases.p521 = aliases.secp521r1;\n function ECDH(curve) {\n (this.curveType = aliases[curve]),\n this.curveType ||\n (this.curveType = {\n name: curve,\n }),\n (this.curve = new elliptic.ec(this.curveType.name)),\n (this.keys = void 0);\n }\n ECDH.prototype.generateKeys = function (enc, format) {\n return (this.keys = this.curve.genKeyPair()), this.getPublicKey(enc, format);\n };\n ECDH.prototype.computeSecret = function (other, inenc, enc) {\n (inenc = inenc || \"utf8\"), Buffer.isBuffer(other) || (other = new Buffer(other, inenc));\n var otherPub = this.curve.keyFromPublic(other).getPublic(),\n out = otherPub.mul(this.keys.getPrivate()).getX();\n return formatReturnValue(out, enc, this.curveType.byteLength);\n };\n ECDH.prototype.getPublicKey = function (enc, format) {\n var key = this.keys.getPublic(format === \"compressed\", !0);\n return (\n format === \"hybrid\" && (key[key.length - 1] % 2 ? (key[0] = 7) : (key[0] = 6)), formatReturnValue(key, enc)\n );\n };\n ECDH.prototype.getPrivateKey = function (enc) {\n return formatReturnValue(this.keys.getPrivate(), enc);\n };\n ECDH.prototype.setPublicKey = function (pub, enc) {\n return (\n (enc = enc || \"utf8\"), Buffer.isBuffer(pub) || (pub = new Buffer(pub, enc)), this.keys._importPublic(pub), this\n );\n };\n ECDH.prototype.setPrivateKey = function (priv, enc) {\n (enc = enc || \"utf8\"), Buffer.isBuffer(priv) || (priv = new Buffer(priv, enc));\n var _priv = new BN(priv);\n return (_priv = _priv.toString(16)), (this.keys = this.curve.genKeyPair()), this.keys._importPrivate(_priv), this;\n };\n function formatReturnValue(bn, enc, len) {\n Array.isArray(bn) || (bn = bn.toArray());\n var buf = new Buffer(bn);\n if (len && buf.length < len) {\n var zeros = new Buffer(len - buf.length);\n zeros.fill(0), (buf = Buffer.concat([zeros, buf]));\n }\n return enc ? buf.toString(enc) : buf;\n }\n },\n});\n\n// node_modules/public-encrypt/mgf.js\nvar require_mgf = __commonJS({\n \"node_modules/public-encrypt/mgf.js\"(exports, module) {\n var createHash = require_browser2(),\n Buffer2 = require_safe_buffer().Buffer;\n module.exports = function (seed, len) {\n for (var t = Buffer2.alloc(0), i = 0, c; t.length < len; )\n (c = i2ops(i++)), (t = Buffer2.concat([t, createHash(\"sha1\").update(seed).update(c).digest()]));\n return t.slice(0, len);\n };\n function i2ops(c) {\n var out = Buffer2.allocUnsafe(4);\n return out.writeUInt32BE(c, 0), out;\n }\n },\n});\n\n// node_modules/public-encrypt/xor.js\nvar require_xor = __commonJS({\n \"node_modules/public-encrypt/xor.js\"(exports, module) {\n module.exports = function (a, b) {\n for (var len = a.length, i = -1; ++i < len; ) a[i] ^= b[i];\n return a;\n };\n },\n});\n\n// node_modules/public-encrypt/node_modules/bn.js/lib/bn.js\nvar require_bn7 = __commonJS({\n \"node_modules/public-encrypt/node_modules/bn.js/lib/bn.js\"(exports, module) {\n (function (module2, exports2) {\n \"use strict\";\n function assert(val, msg) {\n if (!val) throw new Error(msg || \"Assertion failed\");\n }\n function inherits(ctor, superCtor) {\n ctor.super_ = superCtor;\n var TempCtor = function () {};\n (TempCtor.prototype = superCtor.prototype),\n (ctor.prototype = new TempCtor()),\n (ctor.prototype.constructor = ctor);\n }\n function BN(number, base, endian) {\n if (BN.isBN(number)) return number;\n (this.negative = 0),\n (this.words = null),\n (this.length = 0),\n (this.red = null),\n number !== null &&\n ((base === \"le\" || base === \"be\") && ((endian = base), (base = 10)),\n this._init(number || 0, base || 10, endian || \"be\"));\n }\n typeof module2 == \"object\" ? (module2.exports = BN) : (exports2.BN = BN), (BN.BN = BN), (BN.wordSize = 26);\n var Buffer2 = globalThis.Buffer;\n (BN.isBN = function (num) {\n return num instanceof BN\n ? !0\n : num !== null &&\n typeof num == \"object\" &&\n num.constructor.wordSize === BN.wordSize &&\n Array.isArray(num.words);\n }),\n (BN.max = function (left, right) {\n return left.cmp(right) > 0 ? left : right;\n }),\n (BN.min = function (left, right) {\n return left.cmp(right) < 0 ? left : right;\n }),\n (BN.prototype._init = function (number, base, endian) {\n if (typeof number == \"number\") return this._initNumber(number, base, endian);\n if (typeof number == \"object\") return this._initArray(number, base, endian);\n base === \"hex\" && (base = 16),\n assert(base === (base | 0) && base >= 2 && base <= 36),\n (number = number.toString().replace(/\\s+/g, \"\"));\n var start = 0;\n number[0] === \"-\" && (start++, (this.negative = 1)),\n start < number.length &&\n (base === 16\n ? this._parseHex(number, start, endian)\n : (this._parseBase(number, base, start),\n endian === \"le\" && this._initArray(this.toArray(), base, endian)));\n }),\n (BN.prototype._initNumber = function (number, base, endian) {\n number < 0 && ((this.negative = 1), (number = -number)),\n number < 67108864\n ? ((this.words = [number & 67108863]), (this.length = 1))\n : number < 4503599627370496\n ? ((this.words = [number & 67108863, (number / 67108864) & 67108863]), (this.length = 2))\n : (assert(number < 9007199254740992),\n (this.words = [number & 67108863, (number / 67108864) & 67108863, 1]),\n (this.length = 3)),\n endian === \"le\" && this._initArray(this.toArray(), base, endian);\n }),\n (BN.prototype._initArray = function (number, base, endian) {\n if ((assert(typeof number.length == \"number\"), number.length <= 0))\n return (this.words = [0]), (this.length = 1), this;\n (this.length = Math.ceil(number.length / 3)), (this.words = new Array(this.length));\n for (var i = 0; i < this.length; i++) this.words[i] = 0;\n var j,\n w,\n off = 0;\n if (endian === \"be\")\n for (i = number.length - 1, j = 0; i >= 0; i -= 3)\n (w = number[i] | (number[i - 1] << 8) | (number[i - 2] << 16)),\n (this.words[j] |= (w << off) & 67108863),\n (this.words[j + 1] = (w >>> (26 - off)) & 67108863),\n (off += 24),\n off >= 26 && ((off -= 26), j++);\n else if (endian === \"le\")\n for (i = 0, j = 0; i < number.length; i += 3)\n (w = number[i] | (number[i + 1] << 8) | (number[i + 2] << 16)),\n (this.words[j] |= (w << off) & 67108863),\n (this.words[j + 1] = (w >>> (26 - off)) & 67108863),\n (off += 24),\n off >= 26 && ((off -= 26), j++);\n return this.strip();\n });\n function parseHex4Bits(string, index) {\n var c = string.charCodeAt(index);\n return c >= 65 && c <= 70 ? c - 55 : c >= 97 && c <= 102 ? c - 87 : (c - 48) & 15;\n }\n function parseHexByte(string, lowerBound, index) {\n var r = parseHex4Bits(string, index);\n return index - 1 >= lowerBound && (r |= parseHex4Bits(string, index - 1) << 4), r;\n }\n BN.prototype._parseHex = function (number, start, endian) {\n (this.length = Math.ceil((number.length - start) / 6)), (this.words = new Array(this.length));\n for (var i = 0; i < this.length; i++) this.words[i] = 0;\n var off = 0,\n j = 0,\n w;\n if (endian === \"be\")\n for (i = number.length - 1; i >= start; i -= 2)\n (w = parseHexByte(number, start, i) << off),\n (this.words[j] |= w & 67108863),\n off >= 18 ? ((off -= 18), (j += 1), (this.words[j] |= w >>> 26)) : (off += 8);\n else {\n var parseLength = number.length - start;\n for (i = parseLength % 2 === 0 ? start + 1 : start; i < number.length; i += 2)\n (w = parseHexByte(number, start, i) << off),\n (this.words[j] |= w & 67108863),\n off >= 18 ? ((off -= 18), (j += 1), (this.words[j] |= w >>> 26)) : (off += 8);\n }\n this.strip();\n };\n function parseBase(str, start, end, mul) {\n for (var r = 0, len = Math.min(str.length, end), i = start; i < len; i++) {\n var c = str.charCodeAt(i) - 48;\n (r *= mul), c >= 49 ? (r += c - 49 + 10) : c >= 17 ? (r += c - 17 + 10) : (r += c);\n }\n return r;\n }\n (BN.prototype._parseBase = function (number, base, start) {\n (this.words = [0]), (this.length = 1);\n for (var limbLen = 0, limbPow = 1; limbPow <= 67108863; limbPow *= base) limbLen++;\n limbLen--, (limbPow = (limbPow / base) | 0);\n for (\n var total = number.length - start,\n mod = total % limbLen,\n end = Math.min(total, total - mod) + start,\n word = 0,\n i = start;\n i < end;\n i += limbLen\n )\n (word = parseBase(number, i, i + limbLen, base)),\n this.imuln(limbPow),\n this.words[0] + word < 67108864 ? (this.words[0] += word) : this._iaddn(word);\n if (mod !== 0) {\n var pow = 1;\n for (word = parseBase(number, i, number.length, base), i = 0; i < mod; i++) pow *= base;\n this.imuln(pow), this.words[0] + word < 67108864 ? (this.words[0] += word) : this._iaddn(word);\n }\n this.strip();\n }),\n (BN.prototype.copy = function (dest) {\n dest.words = new Array(this.length);\n for (var i = 0; i < this.length; i++) dest.words[i] = this.words[i];\n (dest.length = this.length), (dest.negative = this.negative), (dest.red = this.red);\n }),\n (BN.prototype.clone = function () {\n var r = new BN(null);\n return this.copy(r), r;\n }),\n (BN.prototype._expand = function (size) {\n for (; this.length < size; ) this.words[this.length++] = 0;\n return this;\n }),\n (BN.prototype.strip = function () {\n for (; this.length > 1 && this.words[this.length - 1] === 0; ) this.length--;\n return this._normSign();\n }),\n (BN.prototype._normSign = function () {\n return this.length === 1 && this.words[0] === 0 && (this.negative = 0), this;\n }),\n (BN.prototype.inspect = function () {\n return (this.red ? \"<BN-R: \" : \"<BN: \") + this.toString(16) + \">\";\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 groupSizes = [\n 0, 0, 25, 16, 12, 11, 10, 9, 8, 8, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5,\n 5, 5,\n ],\n groupBases = [\n 0, 0, 33554432, 43046721, 16777216, 48828125, 60466176, 40353607, 16777216, 43046721, 1e7, 19487171, 35831808,\n 62748517, 7529536, 11390625, 16777216, 24137569, 34012224, 47045881, 64e6, 4084101, 5153632, 6436343, 7962624,\n 9765625, 11881376, 14348907, 17210368, 20511149, 243e5, 28629151, 33554432, 39135393, 45435424, 52521875,\n 60466176,\n ];\n (BN.prototype.toString = function (base, padding) {\n (base = base || 10), (padding = padding | 0 || 1);\n var out;\n if (base === 16 || base === \"hex\") {\n out = \"\";\n for (var off = 0, carry = 0, i = 0; i < this.length; i++) {\n var w = this.words[i],\n word = (((w << off) | carry) & 16777215).toString(16);\n (carry = (w >>> (24 - off)) & 16777215),\n carry !== 0 || i !== this.length - 1 ? (out = zeros[6 - word.length] + word + out) : (out = word + out),\n (off += 2),\n off >= 26 && ((off -= 26), i--);\n }\n for (carry !== 0 && (out = carry.toString(16) + out); out.length % padding !== 0; ) out = \"0\" + out;\n return this.negative !== 0 && (out = \"-\" + out), out;\n }\n if (base === (base | 0) && base >= 2 && base <= 36) {\n var groupSize = groupSizes[base],\n groupBase = groupBases[base];\n out = \"\";\n var c = this.clone();\n for (c.negative = 0; !c.isZero(); ) {\n var r = c.modn(groupBase).toString(base);\n (c = c.idivn(groupBase)), c.isZero() ? (out = r + out) : (out = zeros[groupSize - r.length] + r + out);\n }\n for (this.isZero() && (out = \"0\" + out); out.length % padding !== 0; ) out = \"0\" + out;\n return this.negative !== 0 && (out = \"-\" + out), out;\n }\n assert(!1, \"Base should be between 2 and 36\");\n }),\n (BN.prototype.toNumber = function () {\n var ret = this.words[0];\n return (\n this.length === 2\n ? (ret += this.words[1] * 67108864)\n : this.length === 3 && this.words[2] === 1\n ? (ret += 4503599627370496 + this.words[1] * 67108864)\n : this.length > 2 && assert(!1, \"Number can only safely store up to 53 bits\"),\n this.negative !== 0 ? -ret : ret\n );\n }),\n (BN.prototype.toJSON = function () {\n return this.toString(16);\n }),\n (BN.prototype.toBuffer = function (endian, length) {\n return assert(typeof Buffer2 < \"u\"), this.toArrayLike(Buffer2, endian, length);\n }),\n (BN.prototype.toArray = function (endian, length) {\n return this.toArrayLike(Array, endian, length);\n }),\n (BN.prototype.toArrayLike = function (ArrayType, endian, length) {\n var byteLength = this.byteLength(),\n 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 this.strip();\n var littleEndian = endian === \"le\",\n res = new ArrayType(reqLength),\n b,\n i,\n q = this.clone();\n if (littleEndian) {\n for (i = 0; !q.isZero(); i++) (b = q.andln(255)), q.iushrn(8), (res[i] = b);\n for (; i < reqLength; i++) res[i] = 0;\n } else {\n for (i = 0; i < reqLength - byteLength; i++) res[i] = 0;\n for (i = 0; !q.isZero(); i++) (b = q.andln(255)), q.iushrn(8), (res[reqLength - i - 1] = b);\n }\n return res;\n }),\n Math.clz32\n ? (BN.prototype._countBits = function (w) {\n return 32 - Math.clz32(w);\n })\n : (BN.prototype._countBits = function (w) {\n var t = w,\n r = 0;\n return (\n t >= 4096 && ((r += 13), (t >>>= 13)),\n t >= 64 && ((r += 7), (t >>>= 7)),\n t >= 8 && ((r += 4), (t >>>= 4)),\n t >= 2 && ((r += 2), (t >>>= 2)),\n r + t\n );\n }),\n (BN.prototype._zeroBits = function (w) {\n if (w === 0) return 26;\n var t = w,\n r = 0;\n return (\n (t & 8191) === 0 && ((r += 13), (t >>>= 13)),\n (t & 127) === 0 && ((r += 7), (t >>>= 7)),\n (t & 15) === 0 && ((r += 4), (t >>>= 4)),\n (t & 3) === 0 && ((r += 2), (t >>>= 2)),\n (t & 1) === 0 && r++,\n r\n );\n }),\n (BN.prototype.bitLength = function () {\n var w = this.words[this.length - 1],\n hi = this._countBits(w);\n return (this.length - 1) * 26 + hi;\n });\n function toBitArray(num) {\n for (var w = new Array(num.bitLength()), bit = 0; bit < w.length; bit++) {\n var off = (bit / 26) | 0,\n wbit = bit % 26;\n w[bit] = (num.words[off] & (1 << wbit)) >>> wbit;\n }\n return w;\n }\n (BN.prototype.zeroBits = function () {\n if (this.isZero()) return 0;\n for (var r = 0, i = 0; i < this.length; i++) {\n var b = this._zeroBits(this.words[i]);\n if (((r += b), b !== 26)) break;\n }\n return r;\n }),\n (BN.prototype.byteLength = function () {\n return Math.ceil(this.bitLength() / 8);\n }),\n (BN.prototype.toTwos = function (width) {\n return this.negative !== 0 ? this.abs().inotn(width).iaddn(1) : this.clone();\n }),\n (BN.prototype.fromTwos = function (width) {\n return this.testn(width - 1) ? this.notn(width).iaddn(1).ineg() : this.clone();\n }),\n (BN.prototype.isNeg = function () {\n return this.negative !== 0;\n }),\n (BN.prototype.neg = function () {\n return this.clone().ineg();\n }),\n (BN.prototype.ineg = function () {\n return this.isZero() || (this.negative ^= 1), this;\n }),\n (BN.prototype.iuor = function (num) {\n for (; this.length < num.length; ) this.words[this.length++] = 0;\n for (var i = 0; i < num.length; i++) this.words[i] = this.words[i] | num.words[i];\n return this.strip();\n }),\n (BN.prototype.ior = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuor(num);\n }),\n (BN.prototype.or = function (num) {\n return this.length > num.length ? this.clone().ior(num) : num.clone().ior(this);\n }),\n (BN.prototype.uor = function (num) {\n return this.length > num.length ? this.clone().iuor(num) : num.clone().iuor(this);\n }),\n (BN.prototype.iuand = function (num) {\n var b;\n this.length > num.length ? (b = num) : (b = this);\n for (var i = 0; i < b.length; i++) this.words[i] = this.words[i] & num.words[i];\n return (this.length = b.length), this.strip();\n }),\n (BN.prototype.iand = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuand(num);\n }),\n (BN.prototype.and = function (num) {\n return this.length > num.length ? this.clone().iand(num) : num.clone().iand(this);\n }),\n (BN.prototype.uand = function (num) {\n return this.length > num.length ? this.clone().iuand(num) : num.clone().iuand(this);\n }),\n (BN.prototype.iuxor = function (num) {\n var a, b;\n this.length > num.length ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var i = 0; i < b.length; i++) this.words[i] = a.words[i] ^ b.words[i];\n if (this !== a) for (; i < a.length; i++) this.words[i] = a.words[i];\n return (this.length = a.length), this.strip();\n }),\n (BN.prototype.ixor = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuxor(num);\n }),\n (BN.prototype.xor = function (num) {\n return this.length > num.length ? this.clone().ixor(num) : num.clone().ixor(this);\n }),\n (BN.prototype.uxor = function (num) {\n return this.length > num.length ? this.clone().iuxor(num) : num.clone().iuxor(this);\n }),\n (BN.prototype.inotn = function (width) {\n assert(typeof width == \"number\" && width >= 0);\n var bytesNeeded = Math.ceil(width / 26) | 0,\n bitsLeft = width % 26;\n this._expand(bytesNeeded), bitsLeft > 0 && bytesNeeded--;\n for (var i = 0; i < bytesNeeded; i++) this.words[i] = ~this.words[i] & 67108863;\n return bitsLeft > 0 && (this.words[i] = ~this.words[i] & (67108863 >> (26 - bitsLeft))), this.strip();\n }),\n (BN.prototype.notn = function (width) {\n return this.clone().inotn(width);\n }),\n (BN.prototype.setn = function (bit, val) {\n assert(typeof bit == \"number\" && bit >= 0);\n var off = (bit / 26) | 0,\n wbit = bit % 26;\n return (\n this._expand(off + 1),\n val\n ? (this.words[off] = this.words[off] | (1 << wbit))\n : (this.words[off] = this.words[off] & ~(1 << wbit)),\n this.strip()\n );\n }),\n (BN.prototype.iadd = function (num) {\n var r;\n if (this.negative !== 0 && num.negative === 0)\n return (this.negative = 0), (r = this.isub(num)), (this.negative ^= 1), this._normSign();\n if (this.negative === 0 && num.negative !== 0)\n return (num.negative = 0), (r = this.isub(num)), (num.negative = 1), r._normSign();\n var a, b;\n this.length > num.length ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var carry = 0, i = 0; i < b.length; i++)\n (r = (a.words[i] | 0) + (b.words[i] | 0) + carry), (this.words[i] = r & 67108863), (carry = r >>> 26);\n for (; carry !== 0 && i < a.length; i++)\n (r = (a.words[i] | 0) + carry), (this.words[i] = r & 67108863), (carry = r >>> 26);\n if (((this.length = a.length), carry !== 0)) (this.words[this.length] = carry), this.length++;\n else if (a !== this) for (; i < a.length; i++) this.words[i] = a.words[i];\n return this;\n }),\n (BN.prototype.add = function (num) {\n var res;\n return num.negative !== 0 && this.negative === 0\n ? ((num.negative = 0), (res = this.sub(num)), (num.negative ^= 1), res)\n : num.negative === 0 && this.negative !== 0\n ? ((this.negative = 0), (res = num.sub(this)), (this.negative = 1), res)\n : this.length > num.length\n ? this.clone().iadd(num)\n : num.clone().iadd(this);\n }),\n (BN.prototype.isub = function (num) {\n if (num.negative !== 0) {\n num.negative = 0;\n var r = this.iadd(num);\n return (num.negative = 1), r._normSign();\n } else if (this.negative !== 0)\n return (this.negative = 0), this.iadd(num), (this.negative = 1), this._normSign();\n var cmp = this.cmp(num);\n if (cmp === 0) return (this.negative = 0), (this.length = 1), (this.words[0] = 0), this;\n var a, b;\n cmp > 0 ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var carry = 0, i = 0; i < b.length; i++)\n (r = (a.words[i] | 0) - (b.words[i] | 0) + carry), (carry = r >> 26), (this.words[i] = r & 67108863);\n for (; carry !== 0 && i < a.length; i++)\n (r = (a.words[i] | 0) + carry), (carry = r >> 26), (this.words[i] = r & 67108863);\n if (carry === 0 && i < a.length && a !== this) for (; i < a.length; i++) this.words[i] = a.words[i];\n return (this.length = Math.max(this.length, i)), a !== this && (this.negative = 1), this.strip();\n }),\n (BN.prototype.sub = function (num) {\n return this.clone().isub(num);\n });\n function smallMulTo(self2, num, out) {\n out.negative = num.negative ^ self2.negative;\n var len = (self2.length + num.length) | 0;\n (out.length = len), (len = (len - 1) | 0);\n var a = self2.words[0] | 0,\n b = num.words[0] | 0,\n r = a * b,\n lo = r & 67108863,\n carry = (r / 67108864) | 0;\n out.words[0] = lo;\n for (var k = 1; k < len; k++) {\n for (\n var ncarry = carry >>> 26,\n rword = carry & 67108863,\n maxJ = Math.min(k, num.length - 1),\n j = Math.max(0, k - self2.length + 1);\n j <= maxJ;\n j++\n ) {\n var i = (k - j) | 0;\n (a = self2.words[i] | 0),\n (b = num.words[j] | 0),\n (r = a * b + rword),\n (ncarry += (r / 67108864) | 0),\n (rword = r & 67108863);\n }\n (out.words[k] = rword | 0), (carry = ncarry | 0);\n }\n return carry !== 0 ? (out.words[k] = carry | 0) : out.length--, out.strip();\n }\n var comb10MulTo = function (self2, num, out) {\n var a = self2.words,\n b = num.words,\n o = out.words,\n c = 0,\n lo,\n mid,\n hi,\n a0 = a[0] | 0,\n al0 = a0 & 8191,\n ah0 = a0 >>> 13,\n a1 = a[1] | 0,\n al1 = a1 & 8191,\n ah1 = a1 >>> 13,\n a2 = a[2] | 0,\n al2 = a2 & 8191,\n ah2 = a2 >>> 13,\n a3 = a[3] | 0,\n al3 = a3 & 8191,\n ah3 = a3 >>> 13,\n a4 = a[4] | 0,\n al4 = a4 & 8191,\n ah4 = a4 >>> 13,\n a5 = a[5] | 0,\n al5 = a5 & 8191,\n ah5 = a5 >>> 13,\n a6 = a[6] | 0,\n al6 = a6 & 8191,\n ah6 = a6 >>> 13,\n a7 = a[7] | 0,\n al7 = a7 & 8191,\n ah7 = a7 >>> 13,\n a8 = a[8] | 0,\n al8 = a8 & 8191,\n ah8 = a8 >>> 13,\n a9 = a[9] | 0,\n al9 = a9 & 8191,\n ah9 = a9 >>> 13,\n b0 = b[0] | 0,\n bl0 = b0 & 8191,\n bh0 = b0 >>> 13,\n b1 = b[1] | 0,\n bl1 = b1 & 8191,\n bh1 = b1 >>> 13,\n b2 = b[2] | 0,\n bl2 = b2 & 8191,\n bh2 = b2 >>> 13,\n b3 = b[3] | 0,\n bl3 = b3 & 8191,\n bh3 = b3 >>> 13,\n b4 = b[4] | 0,\n bl4 = b4 & 8191,\n bh4 = b4 >>> 13,\n b5 = b[5] | 0,\n bl5 = b5 & 8191,\n bh5 = b5 >>> 13,\n b6 = b[6] | 0,\n bl6 = b6 & 8191,\n bh6 = b6 >>> 13,\n b7 = b[7] | 0,\n bl7 = b7 & 8191,\n bh7 = b7 >>> 13,\n b8 = b[8] | 0,\n bl8 = b8 & 8191,\n bh8 = b8 >>> 13,\n b9 = b[9] | 0,\n bl9 = b9 & 8191,\n bh9 = b9 >>> 13;\n (out.negative = self2.negative ^ num.negative),\n (out.length = 19),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w0 >>> 26)) | 0),\n (w0 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w1 >>> 26)) | 0),\n (w1 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w2 >>> 26)) | 0),\n (w2 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w3 >>> 26)) | 0),\n (w3 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w4 >>> 26)) | 0),\n (w4 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w5 >>> 26)) | 0),\n (w5 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w6 >>> 26)) | 0),\n (w6 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w7 >>> 26)) | 0),\n (w7 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w8 >>> 26)) | 0),\n (w8 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w9 >>> 26)) | 0),\n (w9 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w10 >>> 26)) | 0),\n (w10 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w11 >>> 26)) | 0),\n (w11 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w12 >>> 26)) | 0),\n (w12 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w13 >>> 26)) | 0),\n (w13 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w14 >>> 26)) | 0),\n (w14 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w15 >>> 26)) | 0),\n (w15 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w16 >>> 26)) | 0),\n (w16 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w17 >>> 26)) | 0),\n (w17 &= 67108863),\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 & 8191) << 13)) | 0;\n return (\n (c = (((hi + (mid >>> 13)) | 0) + (w18 >>> 26)) | 0),\n (w18 &= 67108863),\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 c !== 0 && ((o[19] = c), out.length++),\n out\n );\n };\n Math.imul || (comb10MulTo = smallMulTo);\n function bigMulTo(self2, num, out) {\n (out.negative = num.negative ^ self2.negative), (out.length = self2.length + num.length);\n for (var carry = 0, hncarry = 0, k = 0; k < out.length - 1; k++) {\n var ncarry = hncarry;\n hncarry = 0;\n for (\n var rword = carry & 67108863, maxJ = Math.min(k, num.length - 1), j = Math.max(0, k - self2.length + 1);\n j <= maxJ;\n j++\n ) {\n var i = k - j,\n a = self2.words[i] | 0,\n b = num.words[j] | 0,\n r = a * b,\n lo = r & 67108863;\n (ncarry = (ncarry + ((r / 67108864) | 0)) | 0),\n (lo = (lo + rword) | 0),\n (rword = lo & 67108863),\n (ncarry = (ncarry + (lo >>> 26)) | 0),\n (hncarry += ncarry >>> 26),\n (ncarry &= 67108863);\n }\n (out.words[k] = rword), (carry = ncarry), (ncarry = hncarry);\n }\n return carry !== 0 ? (out.words[k] = carry) : out.length--, out.strip();\n }\n function jumboMulTo(self2, num, out) {\n var fftm = new FFTM();\n return fftm.mulp(self2, num, out);\n }\n BN.prototype.mulTo = function (num, out) {\n var res,\n len = this.length + num.length;\n return (\n this.length === 10 && num.length === 10\n ? (res = comb10MulTo(this, num, out))\n : len < 63\n ? (res = smallMulTo(this, num, out))\n : len < 1024\n ? (res = bigMulTo(this, num, out))\n : (res = jumboMulTo(this, num, out)),\n res\n );\n };\n function FFTM(x, y) {\n (this.x = x), (this.y = y);\n }\n (FFTM.prototype.makeRBT = function (N) {\n for (var t = new Array(N), l = BN.prototype._countBits(N) - 1, i = 0; i < N; i++) t[i] = this.revBin(i, l, N);\n return t;\n }),\n (FFTM.prototype.revBin = function (x, l, N) {\n if (x === 0 || x === N - 1) return x;\n for (var rb = 0, i = 0; i < l; i++) (rb |= (x & 1) << (l - i - 1)), (x >>= 1);\n return rb;\n }),\n (FFTM.prototype.permute = function (rbt, rws, iws, rtws, itws, N) {\n for (var i = 0; i < N; i++) (rtws[i] = rws[rbt[i]]), (itws[i] = iws[rbt[i]]);\n }),\n (FFTM.prototype.transform = function (rws, iws, rtws, itws, N, rbt) {\n this.permute(rbt, rws, iws, rtws, itws, N);\n for (var s = 1; s < N; s <<= 1)\n for (\n var l = s << 1, rtwdf = Math.cos((2 * Math.PI) / l), itwdf = Math.sin((2 * Math.PI) / l), p = 0;\n p < N;\n p += l\n )\n for (var rtwdf_ = rtwdf, itwdf_ = itwdf, j = 0; j < s; j++) {\n var re = rtws[p + j],\n ie = itws[p + j],\n ro = rtws[p + j + s],\n io = itws[p + j + s],\n rx = rtwdf_ * ro - itwdf_ * io;\n (io = rtwdf_ * io + itwdf_ * ro),\n (ro = rx),\n (rtws[p + j] = re + ro),\n (itws[p + j] = ie + io),\n (rtws[p + j + s] = re - ro),\n (itws[p + j + s] = ie - io),\n j !== l &&\n ((rx = rtwdf * rtwdf_ - itwdf * itwdf_), (itwdf_ = rtwdf * itwdf_ + itwdf * rtwdf_), (rtwdf_ = rx));\n }\n }),\n (FFTM.prototype.guessLen13b = function (n, m) {\n var N = Math.max(m, n) | 1,\n odd = N & 1,\n i = 0;\n for (N = (N / 2) | 0; N; N = N >>> 1) i++;\n return 1 << (i + 1 + odd);\n }),\n (FFTM.prototype.conjugate = function (rws, iws, N) {\n if (!(N <= 1))\n for (var i = 0; i < N / 2; i++) {\n var t = rws[i];\n (rws[i] = rws[N - i - 1]),\n (rws[N - i - 1] = t),\n (t = iws[i]),\n (iws[i] = -iws[N - i - 1]),\n (iws[N - i - 1] = -t);\n }\n }),\n (FFTM.prototype.normalize13b = function (ws, N) {\n for (var carry = 0, i = 0; i < N / 2; i++) {\n var w = Math.round(ws[2 * i + 1] / N) * 8192 + Math.round(ws[2 * i] / N) + carry;\n (ws[i] = w & 67108863), w < 67108864 ? (carry = 0) : (carry = (w / 67108864) | 0);\n }\n return ws;\n }),\n (FFTM.prototype.convert13b = function (ws, len, rws, N) {\n for (var carry = 0, i = 0; i < len; i++)\n (carry = carry + (ws[i] | 0)),\n (rws[2 * i] = carry & 8191),\n (carry = carry >>> 13),\n (rws[2 * i + 1] = carry & 8191),\n (carry = carry >>> 13);\n for (i = 2 * len; i < N; ++i) rws[i] = 0;\n assert(carry === 0), assert((carry & -8192) === 0);\n }),\n (FFTM.prototype.stub = function (N) {\n for (var ph = new Array(N), i = 0; i < N; i++) ph[i] = 0;\n return ph;\n }),\n (FFTM.prototype.mulp = function (x, y, out) {\n var N = 2 * this.guessLen13b(x.length, y.length),\n rbt = this.makeRBT(N),\n _ = this.stub(N),\n rws = new Array(N),\n rwst = new Array(N),\n iwst = new Array(N),\n nrws = new Array(N),\n nrwst = new Array(N),\n niwst = new Array(N),\n rmws = out.words;\n (rmws.length = N),\n this.convert13b(x.words, x.length, rws, N),\n this.convert13b(y.words, y.length, nrws, N),\n this.transform(rws, _, rwst, iwst, N, rbt),\n this.transform(nrws, _, nrwst, niwst, N, rbt);\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]), (rwst[i] = rx);\n }\n return (\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 (out.negative = x.negative ^ y.negative),\n (out.length = x.length + y.length),\n out.strip()\n );\n }),\n (BN.prototype.mul = function (num) {\n var out = new BN(null);\n return (out.words = new Array(this.length + num.length)), this.mulTo(num, out);\n }),\n (BN.prototype.mulf = function (num) {\n var out = new BN(null);\n return (out.words = new Array(this.length + num.length)), jumboMulTo(this, num, out);\n }),\n (BN.prototype.imul = function (num) {\n return this.clone().mulTo(num, this);\n }),\n (BN.prototype.imuln = function (num) {\n assert(typeof num == \"number\"), assert(num < 67108864);\n for (var carry = 0, i = 0; i < this.length; i++) {\n var w = (this.words[i] | 0) * num,\n lo = (w & 67108863) + (carry & 67108863);\n (carry >>= 26), (carry += (w / 67108864) | 0), (carry += lo >>> 26), (this.words[i] = lo & 67108863);\n }\n return carry !== 0 && ((this.words[i] = carry), this.length++), this;\n }),\n (BN.prototype.muln = function (num) {\n return this.clone().imuln(num);\n }),\n (BN.prototype.sqr = function () {\n return this.mul(this);\n }),\n (BN.prototype.isqr = function () {\n return this.imul(this.clone());\n }),\n (BN.prototype.pow = function (num) {\n var w = toBitArray(num);\n if (w.length === 0) return new BN(1);\n for (var res = this, i = 0; i < w.length && w[i] === 0; i++, res = res.sqr());\n if (++i < w.length) for (var q = res.sqr(); i < w.length; i++, q = q.sqr()) w[i] !== 0 && (res = res.mul(q));\n return res;\n }),\n (BN.prototype.iushln = function (bits) {\n assert(typeof bits == \"number\" && bits >= 0);\n var r = bits % 26,\n s = (bits - r) / 26,\n carryMask = (67108863 >>> (26 - r)) << (26 - r),\n i;\n if (r !== 0) {\n var carry = 0;\n for (i = 0; i < this.length; i++) {\n var newCarry = this.words[i] & carryMask,\n c = ((this.words[i] | 0) - newCarry) << r;\n (this.words[i] = c | carry), (carry = newCarry >>> (26 - r));\n }\n carry && ((this.words[i] = carry), this.length++);\n }\n if (s !== 0) {\n for (i = this.length - 1; i >= 0; i--) this.words[i + s] = this.words[i];\n for (i = 0; i < s; i++) this.words[i] = 0;\n this.length += s;\n }\n return this.strip();\n }),\n (BN.prototype.ishln = function (bits) {\n return assert(this.negative === 0), this.iushln(bits);\n }),\n (BN.prototype.iushrn = function (bits, hint, extended) {\n assert(typeof bits == \"number\" && bits >= 0);\n var h;\n hint ? (h = (hint - (hint % 26)) / 26) : (h = 0);\n var r = bits % 26,\n s = Math.min((bits - r) / 26, this.length),\n mask = 67108863 ^ ((67108863 >>> r) << r),\n maskedWords = extended;\n if (((h -= s), (h = Math.max(0, h)), maskedWords)) {\n for (var i = 0; i < s; i++) maskedWords.words[i] = this.words[i];\n maskedWords.length = s;\n }\n if (s !== 0)\n if (this.length > s) for (this.length -= s, i = 0; i < this.length; i++) this.words[i] = this.words[i + s];\n else (this.words[0] = 0), (this.length = 1);\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)), (carry = word & mask);\n }\n return (\n maskedWords && carry !== 0 && (maskedWords.words[maskedWords.length++] = carry),\n this.length === 0 && ((this.words[0] = 0), (this.length = 1)),\n this.strip()\n );\n }),\n (BN.prototype.ishrn = function (bits, hint, extended) {\n return assert(this.negative === 0), this.iushrn(bits, hint, extended);\n }),\n (BN.prototype.shln = function (bits) {\n return this.clone().ishln(bits);\n }),\n (BN.prototype.ushln = function (bits) {\n return this.clone().iushln(bits);\n }),\n (BN.prototype.shrn = function (bits) {\n return this.clone().ishrn(bits);\n }),\n (BN.prototype.ushrn = function (bits) {\n return this.clone().iushrn(bits);\n }),\n (BN.prototype.testn = function (bit) {\n assert(typeof bit == \"number\" && bit >= 0);\n var r = bit % 26,\n s = (bit - r) / 26,\n q = 1 << r;\n if (this.length <= s) return !1;\n var w = this.words[s];\n return !!(w & q);\n }),\n (BN.prototype.imaskn = function (bits) {\n assert(typeof bits == \"number\" && bits >= 0);\n var r = bits % 26,\n s = (bits - r) / 26;\n if ((assert(this.negative === 0, \"imaskn works only with positive numbers\"), this.length <= s)) return this;\n if ((r !== 0 && s++, (this.length = Math.min(s, this.length)), r !== 0)) {\n var mask = 67108863 ^ ((67108863 >>> r) << r);\n this.words[this.length - 1] &= mask;\n }\n return this.strip();\n }),\n (BN.prototype.maskn = function (bits) {\n return this.clone().imaskn(bits);\n }),\n (BN.prototype.iaddn = function (num) {\n return (\n assert(typeof num == \"number\"),\n assert(num < 67108864),\n num < 0\n ? this.isubn(-num)\n : this.negative !== 0\n ? this.length === 1 && (this.words[0] | 0) < num\n ? ((this.words[0] = num - (this.words[0] | 0)), (this.negative = 0), this)\n : ((this.negative = 0), this.isubn(num), (this.negative = 1), this)\n : this._iaddn(num)\n );\n }),\n (BN.prototype._iaddn = function (num) {\n this.words[0] += num;\n for (var i = 0; i < this.length && this.words[i] >= 67108864; i++)\n (this.words[i] -= 67108864), i === this.length - 1 ? (this.words[i + 1] = 1) : this.words[i + 1]++;\n return (this.length = Math.max(this.length, i + 1)), this;\n }),\n (BN.prototype.isubn = function (num) {\n if ((assert(typeof num == \"number\"), assert(num < 67108864), num < 0)) return this.iaddn(-num);\n if (this.negative !== 0) return (this.negative = 0), this.iaddn(num), (this.negative = 1), this;\n if (((this.words[0] -= num), this.length === 1 && this.words[0] < 0))\n (this.words[0] = -this.words[0]), (this.negative = 1);\n else\n for (var i = 0; i < this.length && this.words[i] < 0; i++)\n (this.words[i] += 67108864), (this.words[i + 1] -= 1);\n return this.strip();\n }),\n (BN.prototype.addn = function (num) {\n return this.clone().iaddn(num);\n }),\n (BN.prototype.subn = function (num) {\n return this.clone().isubn(num);\n }),\n (BN.prototype.iabs = function () {\n return (this.negative = 0), this;\n }),\n (BN.prototype.abs = function () {\n return this.clone().iabs();\n }),\n (BN.prototype._ishlnsubmul = function (num, mul, shift) {\n var len = num.length + shift,\n i;\n this._expand(len);\n var w,\n 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 & 67108863),\n (carry = (w >> 26) - ((right / 67108864) | 0)),\n (this.words[i + shift] = w & 67108863);\n }\n for (; i < this.length - shift; i++)\n (w = (this.words[i + shift] | 0) + carry), (carry = w >> 26), (this.words[i + shift] = w & 67108863);\n if (carry === 0) return this.strip();\n for (assert(carry === -1), carry = 0, i = 0; i < this.length; i++)\n (w = -(this.words[i] | 0) + carry), (carry = w >> 26), (this.words[i] = w & 67108863);\n return (this.negative = 1), this.strip();\n }),\n (BN.prototype._wordDiv = function (num, mode) {\n var shift = this.length - num.length,\n a = this.clone(),\n b = num,\n bhi = b.words[b.length - 1] | 0,\n bhiBits = this._countBits(bhi);\n (shift = 26 - bhiBits),\n shift !== 0 && ((b = b.ushln(shift)), a.iushln(shift), (bhi = b.words[b.length - 1] | 0));\n var m = a.length - b.length,\n q;\n if (mode !== \"mod\") {\n (q = new BN(null)), (q.length = m + 1), (q.words = new Array(q.length));\n for (var i = 0; i < q.length; i++) q.words[i] = 0;\n }\n var diff = a.clone()._ishlnsubmul(b, 1, m);\n diff.negative === 0 && ((a = diff), q && (q.words[m] = 1));\n for (var j = m - 1; j >= 0; j--) {\n var qj = (a.words[b.length + j] | 0) * 67108864 + (a.words[b.length + j - 1] | 0);\n for (qj = Math.min((qj / bhi) | 0, 67108863), a._ishlnsubmul(b, qj, j); a.negative !== 0; )\n qj--, (a.negative = 0), a._ishlnsubmul(b, 1, j), a.isZero() || (a.negative ^= 1);\n q && (q.words[j] = qj);\n }\n return (\n q && q.strip(),\n a.strip(),\n mode !== \"div\" && shift !== 0 && a.iushrn(shift),\n {\n div: q || null,\n mod: a,\n }\n );\n }),\n (BN.prototype.divmod = function (num, mode, positive) {\n if ((assert(!num.isZero()), this.isZero()))\n return {\n div: new BN(0),\n mod: new BN(0),\n };\n var div, mod, res;\n return this.negative !== 0 && num.negative === 0\n ? ((res = this.neg().divmod(num, mode)),\n mode !== \"mod\" && (div = res.div.neg()),\n mode !== \"div\" && ((mod = res.mod.neg()), positive && mod.negative !== 0 && mod.iadd(num)),\n {\n div,\n mod,\n })\n : this.negative === 0 && num.negative !== 0\n ? ((res = this.divmod(num.neg(), mode)),\n mode !== \"mod\" && (div = res.div.neg()),\n {\n div,\n mod: res.mod,\n })\n : (this.negative & num.negative) !== 0\n ? ((res = this.neg().divmod(num.neg(), mode)),\n mode !== \"div\" && ((mod = res.mod.neg()), positive && mod.negative !== 0 && mod.isub(num)),\n {\n div: res.div,\n mod,\n })\n : num.length > this.length || this.cmp(num) < 0\n ? {\n div: new BN(0),\n mod: this,\n }\n : num.length === 1\n ? mode === \"div\"\n ? {\n div: this.divn(num.words[0]),\n mod: null,\n }\n : mode === \"mod\"\n ? {\n div: null,\n mod: new BN(this.modn(num.words[0])),\n }\n : {\n div: this.divn(num.words[0]),\n mod: new BN(this.modn(num.words[0])),\n }\n : this._wordDiv(num, mode);\n }),\n (BN.prototype.div = function (num) {\n return this.divmod(num, \"div\", !1).div;\n }),\n (BN.prototype.mod = function (num) {\n return this.divmod(num, \"mod\", !1).mod;\n }),\n (BN.prototype.umod = function (num) {\n return this.divmod(num, \"mod\", !0).mod;\n }),\n (BN.prototype.divRound = function (num) {\n var dm = this.divmod(num);\n if (dm.mod.isZero()) return dm.div;\n var mod = dm.div.negative !== 0 ? dm.mod.isub(num) : dm.mod,\n half = num.ushrn(1),\n r2 = num.andln(1),\n cmp = mod.cmp(half);\n return cmp < 0 || (r2 === 1 && cmp === 0)\n ? dm.div\n : dm.div.negative !== 0\n ? dm.div.isubn(1)\n : dm.div.iaddn(1);\n }),\n (BN.prototype.modn = function (num) {\n assert(num <= 67108863);\n for (var p = (1 << 26) % num, acc = 0, i = this.length - 1; i >= 0; i--)\n acc = (p * acc + (this.words[i] | 0)) % num;\n return acc;\n }),\n (BN.prototype.idivn = function (num) {\n assert(num <= 67108863);\n for (var carry = 0, i = this.length - 1; i >= 0; i--) {\n var w = (this.words[i] | 0) + carry * 67108864;\n (this.words[i] = (w / num) | 0), (carry = w % num);\n }\n return this.strip();\n }),\n (BN.prototype.divn = function (num) {\n return this.clone().idivn(num);\n }),\n (BN.prototype.egcd = function (p) {\n assert(p.negative === 0), assert(!p.isZero());\n var x = this,\n y = p.clone();\n x.negative !== 0 ? (x = x.umod(p)) : (x = x.clone());\n for (var A = new BN(1), B = new BN(0), C = new BN(0), D = new BN(1), g = 0; x.isEven() && y.isEven(); )\n x.iushrn(1), y.iushrn(1), ++g;\n for (var yp = y.clone(), xp = x.clone(); !x.isZero(); ) {\n for (var i = 0, im = 1; (x.words[0] & im) === 0 && i < 26; ++i, im <<= 1);\n if (i > 0)\n for (x.iushrn(i); i-- > 0; )\n (A.isOdd() || B.isOdd()) && (A.iadd(yp), B.isub(xp)), A.iushrn(1), B.iushrn(1);\n for (var j = 0, jm = 1; (y.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n if (j > 0)\n for (y.iushrn(j); j-- > 0; )\n (C.isOdd() || D.isOdd()) && (C.iadd(yp), D.isub(xp)), C.iushrn(1), D.iushrn(1);\n x.cmp(y) >= 0 ? (x.isub(y), A.isub(C), B.isub(D)) : (y.isub(x), C.isub(A), D.isub(B));\n }\n return {\n a: C,\n b: D,\n gcd: y.iushln(g),\n };\n }),\n (BN.prototype._invmp = function (p) {\n assert(p.negative === 0), assert(!p.isZero());\n var a = this,\n b = p.clone();\n a.negative !== 0 ? (a = a.umod(p)) : (a = a.clone());\n for (var x1 = new BN(1), x2 = new BN(0), delta = b.clone(); 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) for (a.iushrn(i); i-- > 0; ) x1.isOdd() && x1.iadd(delta), x1.iushrn(1);\n for (var j = 0, jm = 1; (b.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n if (j > 0) for (b.iushrn(j); j-- > 0; ) x2.isOdd() && x2.iadd(delta), x2.iushrn(1);\n a.cmp(b) >= 0 ? (a.isub(b), x1.isub(x2)) : (b.isub(a), x2.isub(x1));\n }\n var res;\n return a.cmpn(1) === 0 ? (res = x1) : (res = x2), res.cmpn(0) < 0 && res.iadd(p), res;\n }),\n (BN.prototype.gcd = function (num) {\n if (this.isZero()) return num.abs();\n if (num.isZero()) return this.abs();\n var a = this.clone(),\n b = num.clone();\n (a.negative = 0), (b.negative = 0);\n for (var shift = 0; a.isEven() && b.isEven(); shift++) a.iushrn(1), b.iushrn(1);\n do {\n for (; a.isEven(); ) a.iushrn(1);\n for (; b.isEven(); ) b.iushrn(1);\n var r = a.cmp(b);\n if (r < 0) {\n var t = a;\n (a = b), (b = t);\n } else if (r === 0 || b.cmpn(1) === 0) break;\n a.isub(b);\n } while (!0);\n return b.iushln(shift);\n }),\n (BN.prototype.invm = function (num) {\n return this.egcd(num).a.umod(num);\n }),\n (BN.prototype.isEven = function () {\n return (this.words[0] & 1) === 0;\n }),\n (BN.prototype.isOdd = function () {\n return (this.words[0] & 1) === 1;\n }),\n (BN.prototype.andln = function (num) {\n return this.words[0] & num;\n }),\n (BN.prototype.bincn = function (bit) {\n assert(typeof bit == \"number\");\n var r = bit % 26,\n s = (bit - r) / 26,\n q = 1 << r;\n if (this.length <= s) return this._expand(s + 1), (this.words[s] |= q), this;\n for (var carry = q, i = s; carry !== 0 && i < this.length; i++) {\n var w = this.words[i] | 0;\n (w += carry), (carry = w >>> 26), (w &= 67108863), (this.words[i] = w);\n }\n return carry !== 0 && ((this.words[i] = carry), this.length++), this;\n }),\n (BN.prototype.isZero = function () {\n return this.length === 1 && this.words[0] === 0;\n }),\n (BN.prototype.cmpn = function (num) {\n var negative = num < 0;\n if (this.negative !== 0 && !negative) return -1;\n if (this.negative === 0 && negative) return 1;\n this.strip();\n var res;\n if (this.length > 1) res = 1;\n else {\n negative && (num = -num), assert(num <= 67108863, \"Number is too big\");\n var w = this.words[0] | 0;\n res = w === num ? 0 : w < num ? -1 : 1;\n }\n return this.negative !== 0 ? -res | 0 : res;\n }),\n (BN.prototype.cmp = function (num) {\n if (this.negative !== 0 && num.negative === 0) return -1;\n if (this.negative === 0 && num.negative !== 0) return 1;\n var res = this.ucmp(num);\n return this.negative !== 0 ? -res | 0 : res;\n }),\n (BN.prototype.ucmp = function (num) {\n if (this.length > num.length) return 1;\n if (this.length < num.length) return -1;\n for (var res = 0, i = this.length - 1; i >= 0; i--) {\n var a = this.words[i] | 0,\n b = num.words[i] | 0;\n if (a !== b) {\n a < b ? (res = -1) : a > b && (res = 1);\n break;\n }\n }\n return res;\n }),\n (BN.prototype.gtn = function (num) {\n return this.cmpn(num) === 1;\n }),\n (BN.prototype.gt = function (num) {\n return this.cmp(num) === 1;\n }),\n (BN.prototype.gten = function (num) {\n return this.cmpn(num) >= 0;\n }),\n (BN.prototype.gte = function (num) {\n return this.cmp(num) >= 0;\n }),\n (BN.prototype.ltn = function (num) {\n return this.cmpn(num) === -1;\n }),\n (BN.prototype.lt = function (num) {\n return this.cmp(num) === -1;\n }),\n (BN.prototype.lten = function (num) {\n return this.cmpn(num) <= 0;\n }),\n (BN.prototype.lte = function (num) {\n return this.cmp(num) <= 0;\n }),\n (BN.prototype.eqn = function (num) {\n return this.cmpn(num) === 0;\n }),\n (BN.prototype.eq = function (num) {\n return this.cmp(num) === 0;\n }),\n (BN.red = function (num) {\n return new Red(num);\n }),\n (BN.prototype.toRed = function (ctx) {\n return (\n assert(!this.red, \"Already a number in reduction context\"),\n assert(this.negative === 0, \"red works only with positives\"),\n ctx.convertTo(this)._forceRed(ctx)\n );\n }),\n (BN.prototype.fromRed = function () {\n return assert(this.red, \"fromRed works only with numbers in reduction context\"), this.red.convertFrom(this);\n }),\n (BN.prototype._forceRed = function (ctx) {\n return (this.red = ctx), this;\n }),\n (BN.prototype.forceRed = function (ctx) {\n return assert(!this.red, \"Already a number in reduction context\"), this._forceRed(ctx);\n }),\n (BN.prototype.redAdd = function (num) {\n return assert(this.red, \"redAdd works only with red numbers\"), this.red.add(this, num);\n }),\n (BN.prototype.redIAdd = function (num) {\n return assert(this.red, \"redIAdd works only with red numbers\"), this.red.iadd(this, num);\n }),\n (BN.prototype.redSub = function (num) {\n return assert(this.red, \"redSub works only with red numbers\"), this.red.sub(this, num);\n }),\n (BN.prototype.redISub = function (num) {\n return assert(this.red, \"redISub works only with red numbers\"), this.red.isub(this, num);\n }),\n (BN.prototype.redShl = function (num) {\n return assert(this.red, \"redShl works only with red numbers\"), this.red.shl(this, num);\n }),\n (BN.prototype.redMul = function (num) {\n return (\n assert(this.red, \"redMul works only with red numbers\"),\n this.red._verify2(this, num),\n this.red.mul(this, num)\n );\n }),\n (BN.prototype.redIMul = function (num) {\n return (\n assert(this.red, \"redMul works only with red numbers\"),\n this.red._verify2(this, num),\n this.red.imul(this, num)\n );\n }),\n (BN.prototype.redSqr = function () {\n return assert(this.red, \"redSqr works only with red numbers\"), this.red._verify1(this), this.red.sqr(this);\n }),\n (BN.prototype.redISqr = function () {\n return assert(this.red, \"redISqr works only with red numbers\"), this.red._verify1(this), this.red.isqr(this);\n }),\n (BN.prototype.redSqrt = function () {\n return assert(this.red, \"redSqrt works only with red numbers\"), this.red._verify1(this), this.red.sqrt(this);\n }),\n (BN.prototype.redInvm = function () {\n return assert(this.red, \"redInvm works only with red numbers\"), this.red._verify1(this), this.red.invm(this);\n }),\n (BN.prototype.redNeg = function () {\n return assert(this.red, \"redNeg works only with red numbers\"), this.red._verify1(this), this.red.neg(this);\n }),\n (BN.prototype.redPow = function (num) {\n return assert(this.red && !num.red, \"redPow(normalNum)\"), this.red._verify1(this), this.red.pow(this, num);\n });\n var primes = {\n k256: null,\n p224: null,\n p192: null,\n p25519: null,\n };\n function MPrime(name, p) {\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 (this.tmp = this._tmp());\n }\n (MPrime.prototype._tmp = function () {\n var tmp = new BN(null);\n return (tmp.words = new Array(Math.ceil(this.n / 13))), tmp;\n }),\n (MPrime.prototype.ireduce = function (num) {\n var r = num,\n rlen;\n do this.split(r, this.tmp), (r = this.imulK(r)), (r = r.iadd(this.tmp)), (rlen = r.bitLength());\n while (rlen > this.n);\n var cmp = rlen < this.n ? -1 : r.ucmp(this.p);\n return (\n cmp === 0\n ? ((r.words[0] = 0), (r.length = 1))\n : cmp > 0\n ? r.isub(this.p)\n : r.strip !== void 0\n ? r.strip()\n : r._strip(),\n r\n );\n }),\n (MPrime.prototype.split = function (input, out) {\n input.iushrn(this.n, 0, out);\n }),\n (MPrime.prototype.imulK = function (num) {\n return num.imul(this.k);\n });\n function K256() {\n MPrime.call(this, \"k256\", \"ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f\");\n }\n inherits(K256, MPrime),\n (K256.prototype.split = function (input, output) {\n for (var mask = 4194303, outLen = Math.min(input.length, 9), i = 0; i < outLen; i++)\n output.words[i] = input.words[i];\n if (((output.length = outLen), input.length <= 9)) {\n (input.words[0] = 0), (input.length = 1);\n return;\n }\n var prev = input.words[9];\n for (output.words[output.length++] = prev & mask, i = 10; i < input.length; i++) {\n var next = input.words[i] | 0;\n (input.words[i - 10] = ((next & mask) << 4) | (prev >>> 22)), (prev = next);\n }\n (prev >>>= 22),\n (input.words[i - 10] = prev),\n prev === 0 && input.length > 10 ? (input.length -= 10) : (input.length -= 9);\n }),\n (K256.prototype.imulK = function (num) {\n (num.words[num.length] = 0), (num.words[num.length + 1] = 0), (num.length += 2);\n for (var lo = 0, i = 0; i < num.length; i++) {\n var w = num.words[i] | 0;\n (lo += w * 977), (num.words[i] = lo & 67108863), (lo = w * 64 + ((lo / 67108864) | 0));\n }\n return (\n num.words[num.length - 1] === 0 && (num.length--, num.words[num.length - 1] === 0 && num.length--), num\n );\n });\n function P224() {\n MPrime.call(this, \"p224\", \"ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001\");\n }\n inherits(P224, MPrime);\n function P192() {\n MPrime.call(this, \"p192\", \"ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff\");\n }\n inherits(P192, MPrime);\n function P25519() {\n MPrime.call(this, \"25519\", \"7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed\");\n }\n inherits(P25519, MPrime),\n (P25519.prototype.imulK = function (num) {\n for (var carry = 0, i = 0; i < num.length; i++) {\n var hi = (num.words[i] | 0) * 19 + carry,\n lo = hi & 67108863;\n (hi >>>= 26), (num.words[i] = lo), (carry = hi);\n }\n return carry !== 0 && (num.words[num.length++] = carry), num;\n }),\n (BN._prime = function (name) {\n if (primes[name]) return primes[name];\n var prime2;\n if (name === \"k256\") prime2 = new K256();\n else if (name === \"p224\") prime2 = new P224();\n else if (name === \"p192\") prime2 = new P192();\n else if (name === \"p25519\") prime2 = new P25519();\n else throw new Error(\"Unknown prime \" + name);\n return (primes[name] = prime2), prime2;\n });\n function Red(m) {\n if (typeof m == \"string\") {\n var prime = BN._prime(m);\n (this.m = prime.p), (this.prime = prime);\n } else assert(m.gtn(1), \"modulus must be greater than 1\"), (this.m = m), (this.prime = null);\n }\n (Red.prototype._verify1 = function (a) {\n assert(a.negative === 0, \"red works only with positives\"), assert(a.red, \"red works only with red numbers\");\n }),\n (Red.prototype._verify2 = function (a, b) {\n assert((a.negative | b.negative) === 0, \"red works only with positives\"),\n assert(a.red && a.red === b.red, \"red works only with red numbers\");\n }),\n (Red.prototype.imod = function (a) {\n return this.prime ? this.prime.ireduce(a)._forceRed(this) : a.umod(this.m)._forceRed(this);\n }),\n (Red.prototype.neg = function (a) {\n return a.isZero() ? a.clone() : this.m.sub(a)._forceRed(this);\n }),\n (Red.prototype.add = function (a, b) {\n this._verify2(a, b);\n var res = a.add(b);\n return res.cmp(this.m) >= 0 && res.isub(this.m), res._forceRed(this);\n }),\n (Red.prototype.iadd = function (a, b) {\n this._verify2(a, b);\n var res = a.iadd(b);\n return res.cmp(this.m) >= 0 && res.isub(this.m), res;\n }),\n (Red.prototype.sub = function (a, b) {\n this._verify2(a, b);\n var res = a.sub(b);\n return res.cmpn(0) < 0 && res.iadd(this.m), res._forceRed(this);\n }),\n (Red.prototype.isub = function (a, b) {\n this._verify2(a, b);\n var res = a.isub(b);\n return res.cmpn(0) < 0 && res.iadd(this.m), res;\n }),\n (Red.prototype.shl = function (a, num) {\n return this._verify1(a), this.imod(a.ushln(num));\n }),\n (Red.prototype.imul = function (a, b) {\n return this._verify2(a, b), this.imod(a.imul(b));\n }),\n (Red.prototype.mul = function (a, b) {\n return this._verify2(a, b), this.imod(a.mul(b));\n }),\n (Red.prototype.isqr = function (a) {\n return this.imul(a, a.clone());\n }),\n (Red.prototype.sqr = function (a) {\n return this.mul(a, a);\n }),\n (Red.prototype.sqrt = function (a) {\n if (a.isZero()) return a.clone();\n var mod3 = this.m.andln(3);\n if ((assert(mod3 % 2 === 1), mod3 === 3)) {\n var pow = this.m.add(new BN(1)).iushrn(2);\n return this.pow(a, pow);\n }\n for (var q = this.m.subn(1), s = 0; !q.isZero() && q.andln(1) === 0; ) s++, q.iushrn(1);\n assert(!q.isZero());\n var one = new BN(1).toRed(this),\n nOne = one.redNeg(),\n lpow = this.m.subn(1).iushrn(1),\n z = this.m.bitLength();\n for (z = new BN(2 * z * z).toRed(this); this.pow(z, lpow).cmp(nOne) !== 0; ) z.redIAdd(nOne);\n for (\n var c = this.pow(z, q), r = this.pow(a, q.addn(1).iushrn(1)), t = this.pow(a, q), m = s;\n t.cmp(one) !== 0;\n\n ) {\n for (var tmp = t, i = 0; tmp.cmp(one) !== 0; i++) tmp = tmp.redSqr();\n assert(i < m);\n var b = this.pow(c, new BN(1).iushln(m - i - 1));\n (r = r.redMul(b)), (c = b.redSqr()), (t = t.redMul(c)), (m = i);\n }\n return r;\n }),\n (Red.prototype.invm = function (a) {\n var inv = a._invmp(this.m);\n return inv.negative !== 0 ? ((inv.negative = 0), this.imod(inv).redNeg()) : this.imod(inv);\n }),\n (Red.prototype.pow = function (a, num) {\n if (num.isZero()) return new BN(1).toRed(this);\n if (num.cmpn(1) === 0) return a.clone();\n var windowSize = 4,\n wnd = new Array(1 << windowSize);\n (wnd[0] = new BN(1).toRed(this)), (wnd[1] = a);\n for (var i = 2; i < wnd.length; i++) wnd[i] = this.mul(wnd[i - 1], a);\n var res = wnd[0],\n current = 0,\n currentLen = 0,\n start = num.bitLength() % 26;\n for (start === 0 && (start = 26), i = num.length - 1; i >= 0; i--) {\n for (var word = num.words[i], j = start - 1; j >= 0; j--) {\n var bit = (word >> j) & 1;\n if ((res !== wnd[0] && (res = this.sqr(res)), bit === 0 && current === 0)) {\n currentLen = 0;\n continue;\n }\n (current <<= 1),\n (current |= bit),\n currentLen++,\n !(currentLen !== windowSize && (i !== 0 || j !== 0)) &&\n ((res = this.mul(res, wnd[current])), (currentLen = 0), (current = 0));\n }\n start = 26;\n }\n return res;\n }),\n (Red.prototype.convertTo = function (num) {\n var r = num.umod(this.m);\n return r === num ? r.clone() : r;\n }),\n (Red.prototype.convertFrom = function (num) {\n var res = num.clone();\n return (res.red = null), res;\n }),\n (BN.mont = function (num) {\n return new Mont(num);\n });\n function Mont(m) {\n Red.call(this, m),\n (this.shift = this.m.bitLength()),\n this.shift % 26 !== 0 && (this.shift += 26 - (this.shift % 26)),\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 (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 (Mont.prototype.convertTo = function (num) {\n return this.imod(num.ushln(this.shift));\n }),\n (Mont.prototype.convertFrom = function (num) {\n var r = this.imod(num.mul(this.rinv));\n return (r.red = null), r;\n }),\n (Mont.prototype.imul = function (a, b) {\n if (a.isZero() || b.isZero()) return (a.words[0] = 0), (a.length = 1), a;\n var t = a.imul(b),\n c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m),\n u = t.isub(c).iushrn(this.shift),\n res = u;\n return (\n u.cmp(this.m) >= 0 ? (res = u.isub(this.m)) : u.cmpn(0) < 0 && (res = u.iadd(this.m)), res._forceRed(this)\n );\n }),\n (Mont.prototype.mul = function (a, b) {\n if (a.isZero() || b.isZero()) return new BN(0)._forceRed(this);\n var t = a.mul(b),\n c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m),\n u = t.isub(c).iushrn(this.shift),\n res = u;\n return (\n u.cmp(this.m) >= 0 ? (res = u.isub(this.m)) : u.cmpn(0) < 0 && (res = u.iadd(this.m)), res._forceRed(this)\n );\n }),\n (Mont.prototype.invm = function (a) {\n var res = this.imod(a._invmp(this.m).mul(this.r2));\n return res._forceRed(this);\n });\n })(typeof module > \"u\" || module, exports);\n },\n});\n\nconst { CryptoHasher } = globalThis.Bun;\n\n// node_modules/public-encrypt/withPublic.js\nvar require_withPublic = __commonJS({\n \"node_modules/public-encrypt/withPublic.js\"(exports, module) {\n var BN = require_bn7(),\n Buffer2 = require_safe_buffer().Buffer;\n function withPublic(paddedMsg, key) {\n return Buffer2.from(paddedMsg.toRed(BN.mont(key.modulus)).redPow(new BN(key.publicExponent)).fromRed().toArray());\n }\n module.exports = withPublic;\n },\n});\n\n// node_modules/public-encrypt/publicEncrypt.js\nvar require_publicEncrypt = __commonJS({\n \"node_modules/public-encrypt/publicEncrypt.js\"(exports, module) {\n var parseKeys = require_parse_asn1(),\n randomBytes = require_browser(),\n createHash = require_browser2(),\n mgf = require_mgf(),\n xor = require_xor(),\n BN = require_bn7(),\n withPublic = require_withPublic(),\n crt = require_browserify_rsa(),\n Buffer2 = require_safe_buffer().Buffer;\n module.exports = function (publicKey, msg, reverse) {\n var padding;\n publicKey.padding ? (padding = publicKey.padding) : reverse ? (padding = 1) : (padding = 4);\n var key = parseKeys(publicKey),\n paddedMsg;\n if (padding === 4) paddedMsg = oaep(key, msg);\n else if (padding === 1) paddedMsg = pkcs1(key, msg, reverse);\n else if (padding === 3) {\n if (((paddedMsg = new BN(msg)), paddedMsg.cmp(key.modulus) >= 0)) throw new Error(\"data too long for modulus\");\n } else throw new Error(\"unknown padding\");\n return reverse ? crt(paddedMsg, key) : withPublic(paddedMsg, key);\n };\n function oaep(key, msg) {\n var k = key.modulus.byteLength(),\n mLen = msg.length,\n iHash = createHash(\"sha1\").update(Buffer2.alloc(0)).digest(),\n hLen = iHash.length,\n hLen2 = 2 * hLen;\n if (mLen > k - hLen2 - 2) throw new Error(\"message too long\");\n var ps = Buffer2.alloc(k - mLen - hLen2 - 2),\n dblen = k - hLen - 1,\n seed = randomBytes(hLen),\n maskedDb = xor(Buffer2.concat([iHash, ps, Buffer2.alloc(1, 1), msg], dblen), mgf(seed, dblen)),\n maskedSeed = xor(seed, mgf(maskedDb, hLen));\n return new BN(Buffer2.concat([Buffer2.alloc(1), maskedSeed, maskedDb], k));\n }\n function pkcs1(key, msg, reverse) {\n var mLen = msg.length,\n k = key.modulus.byteLength();\n if (mLen > k - 11) throw new Error(\"message too long\");\n var ps;\n return (\n reverse ? (ps = Buffer2.alloc(k - mLen - 3, 255)) : (ps = nonZero(k - mLen - 3)),\n new BN(Buffer2.concat([Buffer2.from([0, reverse ? 1 : 2]), ps, Buffer2.alloc(1), msg], k))\n );\n }\n function nonZero(len) {\n for (var out = Buffer2.allocUnsafe(len), i = 0, cache = randomBytes(len * 2), cur = 0, num; i < len; )\n cur === cache.length && ((cache = randomBytes(len * 2)), (cur = 0)),\n (num = cache[cur++]),\n num && (out[i++] = num);\n return out;\n }\n },\n});\n\n// node_modules/public-encrypt/privateDecrypt.js\nvar require_privateDecrypt = __commonJS({\n \"node_modules/public-encrypt/privateDecrypt.js\"(exports, module) {\n var parseKeys = require_parse_asn1(),\n mgf = require_mgf(),\n xor = require_xor(),\n BN = require_bn7(),\n crt = require_browserify_rsa(),\n createHash = require_browser2(),\n withPublic = require_withPublic(),\n Buffer2 = require_safe_buffer().Buffer;\n module.exports = function (privateKey, enc, reverse) {\n var padding;\n privateKey.padding ? (padding = privateKey.padding) : reverse ? (padding = 1) : (padding = 4);\n var key = parseKeys(privateKey),\n k = key.modulus.byteLength();\n if (enc.length > k || new BN(enc).cmp(key.modulus) >= 0) throw new Error(\"decryption error\");\n var msg;\n reverse ? (msg = withPublic(new BN(enc), key)) : (msg = crt(enc, key));\n var zBuffer = Buffer2.alloc(k - msg.length);\n if (((msg = Buffer2.concat([zBuffer, msg], k)), padding === 4)) return oaep(key, msg);\n if (padding === 1) return pkcs1(key, msg, reverse);\n if (padding === 3) return msg;\n throw new Error(\"unknown padding\");\n };\n function oaep(key, msg) {\n var k = key.modulus.byteLength(),\n iHash = createHash(\"sha1\").update(Buffer2.alloc(0)).digest(),\n hLen = iHash.length;\n if (msg[0] !== 0) throw new Error(\"decryption error\");\n var maskedSeed = msg.slice(1, hLen + 1),\n maskedDb = msg.slice(hLen + 1),\n seed = xor(maskedSeed, mgf(maskedDb, hLen)),\n db = xor(maskedDb, mgf(seed, k - hLen - 1));\n if (compare(iHash, db.slice(0, hLen))) throw new Error(\"decryption error\");\n for (var i = hLen; db[i] === 0; ) i++;\n if (db[i++] !== 1) throw new Error(\"decryption error\");\n return db.slice(i);\n }\n function pkcs1(key, msg, reverse) {\n for (var p1 = msg.slice(0, 2), i = 2, status = 0; msg[i++] !== 0; )\n if (i >= msg.length) {\n status++;\n break;\n }\n var ps = msg.slice(2, i - 1);\n if (\n (((p1.toString(\"hex\") !== \"0002\" && !reverse) || (p1.toString(\"hex\") !== \"0001\" && reverse)) && status++,\n ps.length < 8 && status++,\n status)\n )\n throw new Error(\"decryption error\");\n return msg.slice(i);\n }\n function compare(a, b) {\n (a = Buffer2.from(a)), (b = Buffer2.from(b));\n var dif = 0,\n len = a.length;\n a.length !== b.length && (dif++, (len = Math.min(a.length, b.length)));\n for (var i = -1; ++i < len; ) dif += a[i] ^ b[i];\n return dif;\n }\n },\n});\n\n// node_modules/public-encrypt/browser.js\nvar require_browser10 = __commonJS({\n \"node_modules/public-encrypt/browser.js\"(exports) {\n exports.publicEncrypt = require_publicEncrypt();\n exports.privateDecrypt = require_privateDecrypt();\n exports.privateEncrypt = function (key, buf) {\n return exports.publicEncrypt(key, buf, !0);\n };\n exports.publicDecrypt = function (key, buf) {\n return exports.privateDecrypt(key, buf, !0);\n };\n },\n});\n\n// node_modules/randomfill/browser.js\nvar require_browser11 = __commonJS({\n \"node_modules/randomfill/browser.js\"(exports) {\n \"use strict\";\n var safeBuffer = require_safe_buffer(),\n randombytes = require_browser(),\n Buffer2 = safeBuffer.Buffer,\n kBufferMaxLength = safeBuffer.kMaxLength,\n kMaxUint32 = Math.pow(2, 32) - 1;\n function assertOffset(offset, length) {\n if (typeof offset != \"number\" || offset !== offset) throw new TypeError(\"offset must be a number\");\n if (offset > kMaxUint32 || offset < 0) throw new TypeError(\"offset must be a uint32\");\n if (offset > kBufferMaxLength || offset > length) throw new RangeError(\"offset out of range\");\n }\n function assertSize(size, offset, length) {\n if (typeof size != \"number\" || size !== size) throw new TypeError(\"size must be a number\");\n if (size > kMaxUint32 || size < 0) throw new TypeError(\"size must be a uint32\");\n if (size + offset > length || size > kBufferMaxLength) throw new RangeError(\"buffer too small\");\n }\n\n exports.randomFill = randomFill;\n exports.randomFillSync = randomFillSync;\n\n function randomFill(buf, offset, size, cb) {\n if (!Buffer2.isBuffer(buf) && !(buf instanceof global.Uint8Array))\n throw new TypeError('\"buf\" argument must be a Buffer or Uint8Array');\n if (typeof offset == \"function\") (cb = offset), (offset = 0), (size = buf.length);\n else if (typeof size == \"function\") (cb = size), (size = buf.length - offset);\n else if (typeof cb != \"function\") throw new TypeError('\"cb\" argument must be a function');\n return assertOffset(offset, buf.length), assertSize(size, offset, buf.length), actualFill(buf, offset, size, cb);\n }\n function actualFill(buf, offset, size, cb) {\n if (cb) {\n randombytes(size, function (err, bytes2) {\n if (err) return cb(err);\n bytes2.copy(buf, offset), cb(null, buf);\n });\n return;\n }\n var bytes = randombytes(size);\n return bytes.copy(buf, offset), buf;\n }\n function randomFillSync(buf, offset, size) {\n if ((typeof offset > \"u\" && (offset = 0), !Buffer2.isBuffer(buf) && !(buf instanceof global.Uint8Array)))\n throw new TypeError('\"buf\" argument must be a Buffer or Uint8Array');\n return (\n assertOffset(offset, buf.length),\n size === void 0 && (size = buf.length - offset),\n assertSize(size, offset, buf.length),\n actualFill(buf, offset, size)\n );\n }\n },\n});\n\n// node_modules/crypto-browserify/index.js\nvar require_crypto_browserify2 = __commonJS({\n \"node_modules/crypto-browserify/index.js\"(exports) {\n \"use strict\";\n exports.randomBytes = exports.rng = exports.pseudoRandomBytes = exports.prng = require_browser();\n exports.createHash = require_browser2();\n exports.Hash = exports.createHash.Hash;\n exports.createHmac = exports.Hmac = require_browser3();\n var algos = require_algos(),\n algoKeys = Object.keys(algos),\n hashes = [\"sha1\", \"sha224\", \"sha256\", \"sha384\", \"sha512\", \"md5\", \"rmd160\"].concat(algoKeys);\n exports.getHashes = function () {\n return hashes;\n };\n var p = require_browser4();\n exports.pbkdf2 = p.pbkdf2;\n exports.pbkdf2Sync = p.pbkdf2Sync;\n var aes = require_browser6();\n exports.Cipher = aes.Cipher;\n exports.createCipher = aes.createCipher;\n exports.Cipheriv = aes.Cipheriv;\n exports.createCipheriv = aes.createCipheriv;\n exports.Decipher = aes.Decipher;\n exports.createDecipher = aes.createDecipher;\n exports.Decipheriv = aes.Decipheriv;\n exports.createDecipheriv = aes.createDecipheriv;\n exports.getCiphers = aes.getCiphers;\n exports.listCiphers = aes.listCiphers;\n var dh = require_browser7();\n exports.DiffieHellmanGroup = dh.DiffieHellmanGroup;\n exports.createDiffieHellmanGroup = dh.createDiffieHellmanGroup;\n exports.getDiffieHellman = dh.getDiffieHellman;\n exports.createDiffieHellman = dh.createDiffieHellman;\n exports.DiffieHellman = dh.DiffieHellman;\n var sign = require_browser8();\n exports.createSign = sign.createSign;\n exports.Sign = sign.Sign;\n exports.createVerify = sign.createVerify;\n exports.Verify = sign.Verify;\n exports.createECDH = require_browser9();\n var publicEncrypt = require_browser10();\n exports.publicEncrypt = publicEncrypt.publicEncrypt;\n exports.privateEncrypt = publicEncrypt.privateEncrypt;\n exports.publicDecrypt = publicEncrypt.publicDecrypt;\n exports.privateDecrypt = publicEncrypt.privateDecrypt;\n exports.getRandomValues = values => crypto.getRandomValues(values);\n var rf = require_browser11();\n exports.randomFill = rf.randomFill;\n exports.randomFillSync = rf.randomFillSync;\n exports.createCredentials = function () {\n throw new Error(\n [\n \"sorry, createCredentials is not implemented yet\",\n \"we accept pull requests\",\n \"https://github.com/crypto-browserify/crypto-browserify\",\n ].join(`\n`),\n );\n };\n exports.constants = {\n DH_CHECK_P_NOT_SAFE_PRIME: 2,\n DH_CHECK_P_NOT_PRIME: 1,\n DH_UNABLE_TO_CHECK_GENERATOR: 4,\n DH_NOT_SUITABLE_GENERATOR: 8,\n NPN_ENABLED: 1,\n ALPN_ENABLED: 1,\n RSA_PKCS1_PADDING: 1,\n RSA_SSLV23_PADDING: 2,\n RSA_NO_PADDING: 3,\n RSA_PKCS1_OAEP_PADDING: 4,\n RSA_X931_PADDING: 5,\n RSA_PKCS1_PSS_PADDING: 6,\n POINT_CONVERSION_COMPRESSED: 2,\n POINT_CONVERSION_UNCOMPRESSED: 4,\n POINT_CONVERSION_HYBRID: 6,\n };\n },\n});\n\n// crypto.js\nvar crypto_exports = {\n ...require_crypto_browserify2(),\n [Symbol.for(\"CommonJS\")]: 0,\n};\nvar DEFAULT_ENCODING = \"buffer\",\n getRandomValues = array => crypto.getRandomValues(array),\n randomUUID = () => crypto.randomUUID(),\n timingSafeEqual =\n \"timingSafeEqual\" in crypto\n ? (a, b) => {\n let { byteLength: byteLengthA } = a,\n { byteLength: byteLengthB } = b;\n if (typeof byteLengthA != \"number\" || typeof byteLengthB != \"number\")\n throw new TypeError(\"Input must be an array buffer view\");\n if (byteLengthA !== byteLengthB) throw new RangeError(\"Input buffers must have the same length\");\n return crypto.timingSafeEqual(a, b);\n }\n : void 0,\n scryptSync =\n \"scryptSync\" in crypto\n ? (password, salt, keylen, options) => {\n let res = crypto.scryptSync(password, salt, keylen, options);\n return DEFAULT_ENCODING !== \"buffer\" ? new Buffer(res).toString(DEFAULT_ENCODING) : new Buffer(res);\n }\n : void 0,\n scrypt =\n \"scryptSync\" in crypto\n ? function (password, salt, keylen, options, callback) {\n if (\n (typeof options == \"function\" && ((callback = options), (options = void 0)), typeof callback != \"function\")\n ) {\n var err = new TypeError(\"callback must be a function\");\n throw ((err.code = \"ERR_INVALID_CALLBACK\"), err);\n }\n try {\n let result = crypto.scryptSync(password, salt, keylen, options);\n process.nextTick(\n callback,\n null,\n DEFAULT_ENCODING !== \"buffer\" ? new Buffer(result).toString(DEFAULT_ENCODING) : new Buffer(result),\n );\n } catch (err2) {\n throw err2;\n }\n }\n : void 0;\ntimingSafeEqual &&\n (Object.defineProperty(timingSafeEqual, \"name\", {\n value: \"::bunternal::\",\n }),\n Object.defineProperty(scrypt, \"name\", {\n value: \"::bunternal::\",\n }),\n Object.defineProperty(scryptSync, \"name\", {\n value: \"::bunternal::\",\n }));\nvar webcrypto = crypto;\n__export(crypto_exports, {\n DEFAULT_ENCODING: () => DEFAULT_ENCODING,\n getRandomValues: () => getRandomValues,\n randomUUID: () => randomUUID,\n scrypt: () => scrypt,\n scryptSync: () => scryptSync,\n timingSafeEqual: () => timingSafeEqual,\n webcrypto: () => webcrypto,\n subtle: () => webcrypto.subtle,\n});\n\nexport const {\n randomBytes,\n rng,\n pseudoRandomBytes,\n prng,\n Hash,\n createHash,\n createHmac,\n Hmac,\n getHashes,\n pbkdf2,\n pbkdf2Sync,\n Cipher,\n createCipher,\n Cipheriv,\n createCipheriv,\n Decipher,\n createDecipher,\n Decipheriv,\n createDecipheriv,\n getCiphers,\n listCiphers,\n DiffieHellmanGroup,\n createDiffieHellmanGroup,\n getDiffieHellman,\n createDiffieHellman,\n DiffieHellman,\n createSign,\n Sign,\n createVerify,\n Verify,\n createECDH,\n publicEncrypt,\n privateEncrypt,\n publicDecrypt,\n privateDecrypt,\n randomFill,\n randomFillSync,\n createCredentials,\n constants,\n} = crypto_exports;\nexport { DEFAULT_ENCODING, getRandomValues, randomUUID, scrypt, scryptSync, timingSafeEqual, webcrypto };\nexport default crypto_exports;\n/*! safe-buffer. MIT License. Feross Aboukhadijeh <https://feross.org/opensource> */\n", - "// Hardcoded module \"node:crypto\"\nvar __create = Object.create;\nvar __defProp = Object.defineProperty;\nvar __getOwnPropDesc = Object.getOwnPropertyDescriptor;\nvar __getOwnPropNames = Object.getOwnPropertyNames;\nvar __getProtoOf = Object.getPrototypeOf,\n __hasOwnProp = Object.prototype.hasOwnProperty;\n\nconst MAX_STRING_LENGTH = 536870888;\n\nvar __require = id => import.meta.require(id);\nconst crypto = globalThis.crypto;\nconst globalCrypto = crypto;\n\nvar __esm = (fn, res) =>\n function () {\n return fn && (res = (0, fn[__getOwnPropNames(fn)[0]])((fn = 0))), res;\n };\nvar __commonJS = (cb, mod) =>\n function () {\n return mod || (0, cb[__getOwnPropNames(cb)[0]])((mod = { exports: {} }).exports, mod), mod.exports;\n };\nvar __export = (target, all) => {\n for (var name in all) __defProp(target, name, { get: all[name], enumerable: !0 });\n },\n __copyProps = (to, from, except, desc) => {\n if ((from && typeof from == \"object\") || typeof from == \"function\")\n for (let key of __getOwnPropNames(from))\n !__hasOwnProp.call(to, key) &&\n key !== except &&\n __defProp(to, key, {\n get: () => from[key],\n enumerable: !(desc = __getOwnPropDesc(from, key)) || desc.enumerable,\n });\n return to;\n },\n __reExport = (target, mod, secondTarget) => (\n __copyProps(target, mod, \"default\"), secondTarget && __copyProps(secondTarget, mod, \"default\")\n ),\n __toESM = (mod, isNodeMode, target) => (\n (target = mod != null ? __create(__getProtoOf(mod)) : {}),\n __copyProps(\n isNodeMode || !mod || !mod.__esModule ? __defProp(target, \"default\", { value: mod, enumerable: !0 }) : target,\n mod,\n )\n );\n\n// node_modules/safe-buffer/index.js\nvar require_safe_buffer = __commonJS({\n \"node_modules/safe-buffer/index.js\"(exports, module) {\n var buffer = __require(\"buffer\"),\n Buffer2 = buffer.Buffer;\n function copyProps(src, dst) {\n for (var key in src) dst[key] = src[key];\n }\n Buffer2.from && Buffer2.alloc && Buffer2.allocUnsafe && Buffer2.allocUnsafeSlow\n ? (module.exports = buffer)\n : (copyProps(buffer, exports), (exports.Buffer = SafeBuffer));\n function SafeBuffer(arg, encodingOrOffset, length) {\n return Buffer2(arg, encodingOrOffset, length);\n }\n SafeBuffer.prototype = Object.create(Buffer2.prototype);\n copyProps(Buffer2, SafeBuffer);\n SafeBuffer.from = function (arg, encodingOrOffset, length) {\n if (typeof arg == \"number\") throw new TypeError(\"Argument must not be a number\");\n return Buffer2(arg, encodingOrOffset, length);\n };\n SafeBuffer.alloc = function (size, fill, encoding) {\n if (typeof size != \"number\") throw new TypeError(\"Argument must be a number\");\n var buf = Buffer2(size);\n return (\n fill !== void 0 ? (typeof encoding == \"string\" ? buf.fill(fill, encoding) : buf.fill(fill)) : buf.fill(0), buf\n );\n };\n SafeBuffer.allocUnsafe = function (size) {\n if (typeof size != \"number\") throw new TypeError(\"Argument must be a number\");\n return Buffer2(size);\n };\n SafeBuffer.allocUnsafeSlow = function (size) {\n if (typeof size != \"number\") throw new TypeError(\"Argument must be a number\");\n return buffer.SlowBuffer(size);\n };\n },\n});\n\n// node_modules/randombytes/browser.js\nvar require_browser = __commonJS({\n \"node_modules/randombytes/browser.js\"(exports, module) {\n \"use strict\";\n var MAX_BYTES = 65536,\n MAX_UINT32 = 4294967295;\n function oldBrowser() {\n throw new Error(`Secure random number generation is not supported by this browser.\nUse Chrome, Firefox or Internet Explorer 11`);\n }\n var Buffer2 = require_safe_buffer().Buffer,\n crypto2 = globalCrypto;\n crypto2 && crypto2.getRandomValues ? (module.exports = randomBytes) : (module.exports = oldBrowser);\n function randomBytes(size, cb) {\n if (size > MAX_UINT32) throw new RangeError(\"requested too many random bytes\");\n var bytes = Buffer2.allocUnsafe(size);\n if (size > 0)\n if (size > MAX_BYTES)\n for (var generated = 0; generated < size; generated += MAX_BYTES)\n crypto2.getRandomValues(bytes.slice(generated, generated + MAX_BYTES));\n else crypto2.getRandomValues(bytes);\n return typeof cb == \"function\"\n ? process.nextTick(function () {\n cb(null, bytes);\n })\n : bytes;\n }\n },\n});\n\n// node_modules/inherits/inherits_browser.js\nvar require_inherits_browser = __commonJS({\n \"node_modules/inherits/inherits_browser.js\"(exports, module) {\n typeof Object.create == \"function\"\n ? (module.exports = function (ctor, superCtor) {\n superCtor &&\n ((ctor.super_ = superCtor),\n (ctor.prototype = Object.create(superCtor.prototype, {\n constructor: {\n value: ctor,\n enumerable: !1,\n writable: !0,\n configurable: !0,\n },\n })));\n })\n : (module.exports = function (ctor, superCtor) {\n if (superCtor) {\n ctor.super_ = superCtor;\n var TempCtor = function () {};\n (TempCtor.prototype = superCtor.prototype),\n (ctor.prototype = new TempCtor()),\n (ctor.prototype.constructor = ctor);\n }\n });\n },\n});\n\n// node_modules/hash-base/index.js\nvar require_hash_base = __commonJS({\n \"node_modules/hash-base/index.js\"(exports, module) {\n \"use strict\";\n var Buffer2 = require_safe_buffer().Buffer,\n Transform = __require(\"readable-stream\").Transform,\n inherits = require_inherits_browser();\n function throwIfNotStringOrBuffer(val, prefix) {\n if (!Buffer2.isBuffer(val) && typeof val != \"string\")\n throw new TypeError(prefix + \" must be a string or a buffer\");\n }\n function HashBase(blockSize) {\n Transform.call(this),\n (this._block = Buffer2.allocUnsafe(blockSize)),\n (this._blockSize = blockSize),\n (this._blockOffset = 0),\n (this._length = [0, 0, 0, 0]),\n (this._finalized = !1);\n }\n inherits(HashBase, Transform);\n HashBase.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 callback(error);\n };\n HashBase.prototype._flush = function (callback) {\n var error = null;\n try {\n this.push(this.digest());\n } catch (err) {\n error = err;\n }\n callback(error);\n };\n HashBase.prototype.update = function (data, encoding) {\n if ((throwIfNotStringOrBuffer(data, \"Data\"), this._finalized)) throw new Error(\"Digest already called\");\n Buffer2.isBuffer(data) || (data = Buffer2.from(data, encoding));\n for (var block = this._block, offset = 0; this._blockOffset + data.length - offset >= this._blockSize; ) {\n for (var i = this._blockOffset; i < this._blockSize; ) block[i++] = data[offset++];\n this._update(), (this._blockOffset = 0);\n }\n for (; offset < data.length; ) block[this._blockOffset++] = data[offset++];\n for (var j = 0, carry = data.length * 8; carry > 0; ++j)\n (this._length[j] += carry),\n (carry = (this._length[j] / 4294967296) | 0),\n carry > 0 && (this._length[j] -= 4294967296 * carry);\n return this;\n };\n HashBase.prototype._update = function () {\n throw new Error(\"_update is not implemented\");\n };\n HashBase.prototype.digest = function (encoding) {\n if (this._finalized) throw new Error(\"Digest already called\");\n this._finalized = !0;\n var digest = this._digest();\n encoding !== void 0 && (digest = digest.toString(encoding)), this._block.fill(0), (this._blockOffset = 0);\n for (var i = 0; i < 4; ++i) this._length[i] = 0;\n return digest;\n };\n HashBase.prototype._digest = function () {\n throw new Error(\"_digest is not implemented\");\n };\n module.exports = HashBase;\n },\n});\n\n// node_modules/md5.js/index.js\nvar require_md5 = __commonJS({\n \"node_modules/md5.js/index.js\"(exports, module) {\n \"use strict\";\n var inherits = require_inherits_browser(),\n HashBase = require_hash_base(),\n Buffer2 = require_safe_buffer().Buffer,\n ARRAY16 = new Array(16);\n function MD5() {\n HashBase.call(this, 64),\n (this._a = 1732584193),\n (this._b = 4023233417),\n (this._c = 2562383102),\n (this._d = 271733878);\n }\n inherits(MD5, HashBase);\n MD5.prototype._update = function () {\n for (var M = ARRAY16, i = 0; i < 16; ++i) M[i] = this._block.readInt32LE(i * 4);\n var a = this._a,\n b = this._b,\n c = this._c,\n d = this._d;\n (a = fnF(a, b, c, d, M[0], 3614090360, 7)),\n (d = fnF(d, a, b, c, M[1], 3905402710, 12)),\n (c = fnF(c, d, a, b, M[2], 606105819, 17)),\n (b = fnF(b, c, d, a, M[3], 3250441966, 22)),\n (a = fnF(a, b, c, d, M[4], 4118548399, 7)),\n (d = fnF(d, a, b, c, M[5], 1200080426, 12)),\n (c = fnF(c, d, a, b, M[6], 2821735955, 17)),\n (b = fnF(b, c, d, a, M[7], 4249261313, 22)),\n (a = fnF(a, b, c, d, M[8], 1770035416, 7)),\n (d = fnF(d, a, b, c, M[9], 2336552879, 12)),\n (c = fnF(c, d, a, b, M[10], 4294925233, 17)),\n (b = fnF(b, c, d, a, M[11], 2304563134, 22)),\n (a = fnF(a, b, c, d, M[12], 1804603682, 7)),\n (d = fnF(d, a, b, c, M[13], 4254626195, 12)),\n (c = fnF(c, d, a, b, M[14], 2792965006, 17)),\n (b = fnF(b, c, d, a, M[15], 1236535329, 22)),\n (a = fnG(a, b, c, d, M[1], 4129170786, 5)),\n (d = fnG(d, a, b, c, M[6], 3225465664, 9)),\n (c = fnG(c, d, a, b, M[11], 643717713, 14)),\n (b = fnG(b, c, d, a, M[0], 3921069994, 20)),\n (a = fnG(a, b, c, d, M[5], 3593408605, 5)),\n (d = fnG(d, a, b, c, M[10], 38016083, 9)),\n (c = fnG(c, d, a, b, M[15], 3634488961, 14)),\n (b = fnG(b, c, d, a, M[4], 3889429448, 20)),\n (a = fnG(a, b, c, d, M[9], 568446438, 5)),\n (d = fnG(d, a, b, c, M[14], 3275163606, 9)),\n (c = fnG(c, d, a, b, M[3], 4107603335, 14)),\n (b = fnG(b, c, d, a, M[8], 1163531501, 20)),\n (a = fnG(a, b, c, d, M[13], 2850285829, 5)),\n (d = fnG(d, a, b, c, M[2], 4243563512, 9)),\n (c = fnG(c, d, a, b, M[7], 1735328473, 14)),\n (b = fnG(b, c, d, a, M[12], 2368359562, 20)),\n (a = fnH(a, b, c, d, M[5], 4294588738, 4)),\n (d = fnH(d, a, b, c, M[8], 2272392833, 11)),\n (c = fnH(c, d, a, b, M[11], 1839030562, 16)),\n (b = fnH(b, c, d, a, M[14], 4259657740, 23)),\n (a = fnH(a, b, c, d, M[1], 2763975236, 4)),\n (d = fnH(d, a, b, c, M[4], 1272893353, 11)),\n (c = fnH(c, d, a, b, M[7], 4139469664, 16)),\n (b = fnH(b, c, d, a, M[10], 3200236656, 23)),\n (a = fnH(a, b, c, d, M[13], 681279174, 4)),\n (d = fnH(d, a, b, c, M[0], 3936430074, 11)),\n (c = fnH(c, d, a, b, M[3], 3572445317, 16)),\n (b = fnH(b, c, d, a, M[6], 76029189, 23)),\n (a = fnH(a, b, c, d, M[9], 3654602809, 4)),\n (d = fnH(d, a, b, c, M[12], 3873151461, 11)),\n (c = fnH(c, d, a, b, M[15], 530742520, 16)),\n (b = fnH(b, c, d, a, M[2], 3299628645, 23)),\n (a = fnI(a, b, c, d, M[0], 4096336452, 6)),\n (d = fnI(d, a, b, c, M[7], 1126891415, 10)),\n (c = fnI(c, d, a, b, M[14], 2878612391, 15)),\n (b = fnI(b, c, d, a, M[5], 4237533241, 21)),\n (a = fnI(a, b, c, d, M[12], 1700485571, 6)),\n (d = fnI(d, a, b, c, M[3], 2399980690, 10)),\n (c = fnI(c, d, a, b, M[10], 4293915773, 15)),\n (b = fnI(b, c, d, a, M[1], 2240044497, 21)),\n (a = fnI(a, b, c, d, M[8], 1873313359, 6)),\n (d = fnI(d, a, b, c, M[15], 4264355552, 10)),\n (c = fnI(c, d, a, b, M[6], 2734768916, 15)),\n (b = fnI(b, c, d, a, M[13], 1309151649, 21)),\n (a = fnI(a, b, c, d, M[4], 4149444226, 6)),\n (d = fnI(d, a, b, c, M[11], 3174756917, 10)),\n (c = fnI(c, d, a, b, M[2], 718787259, 15)),\n (b = fnI(b, c, d, a, M[9], 3951481745, 21)),\n (this._a = (this._a + a) | 0),\n (this._b = (this._b + b) | 0),\n (this._c = (this._c + c) | 0),\n (this._d = (this._d + d) | 0);\n };\n MD5.prototype._digest = function () {\n (this._block[this._blockOffset++] = 128),\n this._blockOffset > 56 && (this._block.fill(0, this._blockOffset, 64), this._update(), (this._blockOffset = 0)),\n this._block.fill(0, this._blockOffset, 56),\n this._block.writeUInt32LE(this._length[0], 56),\n this._block.writeUInt32LE(this._length[1], 60),\n this._update();\n var buffer = Buffer2.allocUnsafe(16);\n return (\n buffer.writeInt32LE(this._a, 0),\n buffer.writeInt32LE(this._b, 4),\n buffer.writeInt32LE(this._c, 8),\n buffer.writeInt32LE(this._d, 12),\n buffer\n );\n };\n function rotl(x, n) {\n return (x << n) | (x >>> (32 - n));\n }\n function fnF(a, b, c, d, m, k, s) {\n return (rotl((a + ((b & c) | (~b & d)) + m + k) | 0, s) + b) | 0;\n }\n function fnG(a, b, c, d, m, k, s) {\n return (rotl((a + ((b & d) | (c & ~d)) + m + k) | 0, s) + b) | 0;\n }\n function fnH(a, b, c, d, m, k, s) {\n return (rotl((a + (b ^ c ^ d) + m + k) | 0, s) + b) | 0;\n }\n function fnI(a, b, c, d, m, k, s) {\n return (rotl((a + (c ^ (b | ~d)) + m + k) | 0, s) + b) | 0;\n }\n module.exports = MD5;\n },\n});\n\n// node_modules/ripemd160/index.js\nvar require_ripemd160 = __commonJS({\n \"node_modules/ripemd160/index.js\"(exports, module) {\n \"use strict\";\n var Buffer2 = __require(\"buffer\").Buffer,\n inherits = require_inherits_browser(),\n HashBase = require_hash_base(),\n ARRAY16 = new Array(16),\n zl = [\n 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 7, 4, 13, 1, 10, 6, 15, 3, 12, 0, 9, 5, 2, 14, 11, 8, 3,\n 10, 14, 4, 9, 15, 8, 1, 2, 7, 0, 6, 13, 11, 5, 12, 1, 9, 11, 10, 0, 8, 12, 4, 13, 3, 7, 15, 14, 5, 6, 2, 4, 0,\n 5, 9, 7, 12, 2, 10, 14, 1, 3, 8, 11, 6, 15, 13,\n ],\n zr = [\n 5, 14, 7, 0, 9, 2, 11, 4, 13, 6, 15, 8, 1, 10, 3, 12, 6, 11, 3, 7, 0, 13, 5, 10, 14, 15, 8, 12, 4, 9, 1, 2, 15,\n 5, 1, 3, 7, 14, 6, 9, 11, 8, 12, 2, 10, 0, 4, 13, 8, 6, 4, 1, 3, 11, 15, 0, 5, 12, 2, 13, 9, 7, 10, 14, 12, 15,\n 10, 4, 1, 5, 8, 7, 6, 2, 13, 14, 0, 3, 9, 11,\n ],\n sl = [\n 11, 14, 15, 12, 5, 8, 7, 9, 11, 13, 14, 15, 6, 7, 9, 8, 7, 6, 8, 13, 11, 9, 7, 15, 7, 12, 15, 9, 11, 7, 13, 12,\n 11, 13, 6, 7, 14, 9, 13, 15, 14, 8, 13, 6, 5, 12, 7, 5, 11, 12, 14, 15, 14, 15, 9, 8, 9, 14, 5, 6, 8, 6, 5, 12,\n 9, 15, 5, 11, 6, 8, 13, 12, 5, 12, 13, 14, 11, 8, 5, 6,\n ],\n sr = [\n 8, 9, 9, 11, 13, 15, 15, 5, 7, 7, 8, 11, 14, 14, 12, 6, 9, 13, 15, 7, 12, 8, 9, 11, 7, 7, 12, 7, 6, 15, 13, 11,\n 9, 7, 15, 11, 8, 6, 6, 14, 12, 13, 5, 14, 13, 13, 7, 5, 15, 5, 8, 11, 14, 14, 6, 14, 6, 9, 12, 9, 12, 5, 15, 8,\n 8, 5, 12, 9, 12, 5, 14, 6, 8, 13, 6, 5, 15, 13, 11, 11,\n ],\n hl = [0, 1518500249, 1859775393, 2400959708, 2840853838],\n hr = [1352829926, 1548603684, 1836072691, 2053994217, 0];\n function RIPEMD160() {\n HashBase.call(this, 64),\n (this._a = 1732584193),\n (this._b = 4023233417),\n (this._c = 2562383102),\n (this._d = 271733878),\n (this._e = 3285377520);\n }\n inherits(RIPEMD160, HashBase);\n RIPEMD160.prototype._update = function () {\n for (var words = ARRAY16, j = 0; j < 16; ++j) words[j] = this._block.readInt32LE(j * 4);\n for (\n var al = this._a | 0,\n bl = this._b | 0,\n cl = this._c | 0,\n dl = this._d | 0,\n el = this._e | 0,\n ar = this._a | 0,\n br = this._b | 0,\n cr = this._c | 0,\n dr = this._d | 0,\n er = this._e | 0,\n i = 0;\n i < 80;\n i += 1\n ) {\n var tl, tr;\n i < 16\n ? ((tl = fn1(al, bl, cl, dl, el, words[zl[i]], hl[0], sl[i])),\n (tr = fn5(ar, br, cr, dr, er, words[zr[i]], hr[0], sr[i])))\n : i < 32\n ? ((tl = fn2(al, bl, cl, dl, el, words[zl[i]], hl[1], sl[i])),\n (tr = fn4(ar, br, cr, dr, er, words[zr[i]], hr[1], sr[i])))\n : i < 48\n ? ((tl = fn3(al, bl, cl, dl, el, words[zl[i]], hl[2], sl[i])),\n (tr = fn3(ar, br, cr, dr, er, words[zr[i]], hr[2], sr[i])))\n : i < 64\n ? ((tl = fn4(al, bl, cl, dl, el, words[zl[i]], hl[3], sl[i])),\n (tr = fn2(ar, br, cr, dr, er, words[zr[i]], hr[3], sr[i])))\n : ((tl = fn5(al, bl, cl, dl, el, words[zl[i]], hl[4], sl[i])),\n (tr = fn1(ar, br, cr, dr, er, words[zr[i]], hr[4], sr[i]))),\n (al = el),\n (el = dl),\n (dl = rotl(cl, 10)),\n (cl = bl),\n (bl = tl),\n (ar = er),\n (er = dr),\n (dr = rotl(cr, 10)),\n (cr = br),\n (br = tr);\n }\n var t = (this._b + cl + dr) | 0;\n (this._b = (this._c + dl + er) | 0),\n (this._c = (this._d + el + ar) | 0),\n (this._d = (this._e + al + br) | 0),\n (this._e = (this._a + bl + cr) | 0),\n (this._a = t);\n };\n RIPEMD160.prototype._digest = function () {\n (this._block[this._blockOffset++] = 128),\n this._blockOffset > 56 && (this._block.fill(0, this._blockOffset, 64), this._update(), (this._blockOffset = 0)),\n this._block.fill(0, this._blockOffset, 56),\n this._block.writeUInt32LE(this._length[0], 56),\n this._block.writeUInt32LE(this._length[1], 60),\n this._update();\n var buffer = Buffer2.alloc ? Buffer2.alloc(20) : new Buffer2(20);\n return (\n buffer.writeInt32LE(this._a, 0),\n buffer.writeInt32LE(this._b, 4),\n buffer.writeInt32LE(this._c, 8),\n buffer.writeInt32LE(this._d, 12),\n buffer.writeInt32LE(this._e, 16),\n buffer\n );\n };\n function rotl(x, n) {\n return (x << n) | (x >>> (32 - n));\n }\n function fn1(a, b, c, d, e, m, k, s) {\n return (rotl((a + (b ^ c ^ d) + m + k) | 0, s) + e) | 0;\n }\n function fn2(a, b, c, d, e, m, k, s) {\n return (rotl((a + ((b & c) | (~b & d)) + m + k) | 0, s) + e) | 0;\n }\n function fn3(a, b, c, d, e, m, k, s) {\n return (rotl((a + ((b | ~c) ^ d) + m + k) | 0, s) + e) | 0;\n }\n function fn4(a, b, c, d, e, m, k, s) {\n return (rotl((a + ((b & d) | (c & ~d)) + m + k) | 0, s) + e) | 0;\n }\n function fn5(a, b, c, d, e, m, k, s) {\n return (rotl((a + (b ^ (c | ~d)) + m + k) | 0, s) + e) | 0;\n }\n module.exports = RIPEMD160;\n },\n});\n\n// node_modules/sha.js/hash.js\nvar require_hash = __commonJS({\n \"node_modules/sha.js/hash.js\"(exports, module) {\n var Buffer2 = require_safe_buffer().Buffer;\n function Hash(blockSize, finalSize) {\n (this._block = Buffer2.alloc(blockSize)),\n (this._finalSize = finalSize),\n (this._blockSize = blockSize),\n (this._len = 0);\n }\n Hash.prototype.update = function (data, enc) {\n typeof data == \"string\" && ((enc = enc || \"utf8\"), (data = Buffer2.from(data, enc)));\n for (\n var block = this._block, blockSize = this._blockSize, length = data.length, accum = this._len, offset = 0;\n offset < length;\n\n ) {\n for (\n var assigned = accum % blockSize, remainder = Math.min(length - offset, blockSize - assigned), i = 0;\n i < remainder;\n i++\n )\n block[assigned + i] = data[offset + i];\n (accum += remainder), (offset += remainder), accum % blockSize === 0 && this._update(block);\n }\n return (this._len += length), this;\n };\n Hash.prototype.digest = function (enc) {\n var rem = this._len % this._blockSize;\n (this._block[rem] = 128),\n this._block.fill(0, rem + 1),\n rem >= this._finalSize && (this._update(this._block), this._block.fill(0));\n var bits = this._len * 8;\n if (bits <= 4294967295) this._block.writeUInt32BE(bits, this._blockSize - 4);\n else {\n var lowBits = (bits & 4294967295) >>> 0,\n highBits = (bits - lowBits) / 4294967296;\n this._block.writeUInt32BE(highBits, this._blockSize - 8),\n this._block.writeUInt32BE(lowBits, this._blockSize - 4);\n }\n this._update(this._block);\n var hash = this._hash();\n return enc ? hash.toString(enc) : hash;\n };\n Hash.prototype._update = function () {\n throw new Error(\"_update must be implemented by subclass\");\n };\n module.exports = Hash;\n },\n});\n\n// node_modules/sha.js/sha.js\nvar require_sha = __commonJS({\n \"node_modules/sha.js/sha.js\"(exports, module) {\n var inherits = require_inherits_browser(),\n Hash = require_hash(),\n Buffer2 = require_safe_buffer().Buffer,\n K = [1518500249, 1859775393, -1894007588, -899497514],\n W = new Array(80);\n function Sha() {\n this.init(), (this._w = W), Hash.call(this, 64, 56);\n }\n inherits(Sha, Hash);\n Sha.prototype.init = function () {\n return (\n (this._a = 1732584193),\n (this._b = 4023233417),\n (this._c = 2562383102),\n (this._d = 271733878),\n (this._e = 3285377520),\n this\n );\n };\n function rotl5(num) {\n return (num << 5) | (num >>> 27);\n }\n function rotl30(num) {\n return (num << 30) | (num >>> 2);\n }\n function ft(s, b, c, d) {\n return s === 0 ? (b & c) | (~b & d) : s === 2 ? (b & c) | (b & d) | (c & d) : b ^ c ^ d;\n }\n Sha.prototype._update = function (M) {\n for (\n var W2 = this._w, a = this._a | 0, b = this._b | 0, c = this._c | 0, d = this._d | 0, e = this._e | 0, i = 0;\n i < 16;\n ++i\n )\n W2[i] = M.readInt32BE(i * 4);\n for (; i < 80; ++i) W2[i] = W2[i - 3] ^ W2[i - 8] ^ W2[i - 14] ^ W2[i - 16];\n for (var j = 0; j < 80; ++j) {\n var s = ~~(j / 20),\n t = (rotl5(a) + ft(s, b, c, d) + e + W2[j] + K[s]) | 0;\n (e = d), (d = c), (c = rotl30(b)), (b = a), (a = t);\n }\n (this._a = (a + this._a) | 0),\n (this._b = (b + this._b) | 0),\n (this._c = (c + this._c) | 0),\n (this._d = (d + this._d) | 0),\n (this._e = (e + this._e) | 0);\n };\n Sha.prototype._hash = function () {\n var H = Buffer2.allocUnsafe(20);\n return (\n H.writeInt32BE(this._a | 0, 0),\n H.writeInt32BE(this._b | 0, 4),\n H.writeInt32BE(this._c | 0, 8),\n H.writeInt32BE(this._d | 0, 12),\n H.writeInt32BE(this._e | 0, 16),\n H\n );\n };\n module.exports = Sha;\n },\n});\n\n// node_modules/sha.js/sha1.js\nvar require_sha1 = __commonJS({\n \"node_modules/sha.js/sha1.js\"(exports, module) {\n var inherits = require_inherits_browser(),\n Hash = require_hash(),\n Buffer2 = require_safe_buffer().Buffer,\n K = [1518500249, 1859775393, -1894007588, -899497514],\n W = new Array(80);\n function Sha1() {\n this.init(), (this._w = W), Hash.call(this, 64, 56);\n }\n inherits(Sha1, Hash);\n Sha1.prototype.init = function () {\n return (\n (this._a = 1732584193),\n (this._b = 4023233417),\n (this._c = 2562383102),\n (this._d = 271733878),\n (this._e = 3285377520),\n this\n );\n };\n function rotl1(num) {\n return (num << 1) | (num >>> 31);\n }\n function rotl5(num) {\n return (num << 5) | (num >>> 27);\n }\n function rotl30(num) {\n return (num << 30) | (num >>> 2);\n }\n function ft(s, b, c, d) {\n return s === 0 ? (b & c) | (~b & d) : s === 2 ? (b & c) | (b & d) | (c & d) : b ^ c ^ d;\n }\n Sha1.prototype._update = function (M) {\n for (\n var W2 = this._w, a = this._a | 0, b = this._b | 0, c = this._c | 0, d = this._d | 0, e = this._e | 0, i = 0;\n i < 16;\n ++i\n )\n W2[i] = M.readInt32BE(i * 4);\n for (; i < 80; ++i) W2[i] = rotl1(W2[i - 3] ^ W2[i - 8] ^ W2[i - 14] ^ W2[i - 16]);\n for (var j = 0; j < 80; ++j) {\n var s = ~~(j / 20),\n t = (rotl5(a) + ft(s, b, c, d) + e + W2[j] + K[s]) | 0;\n (e = d), (d = c), (c = rotl30(b)), (b = a), (a = t);\n }\n (this._a = (a + this._a) | 0),\n (this._b = (b + this._b) | 0),\n (this._c = (c + this._c) | 0),\n (this._d = (d + this._d) | 0),\n (this._e = (e + this._e) | 0);\n };\n Sha1.prototype._hash = function () {\n var H = Buffer2.allocUnsafe(20);\n return (\n H.writeInt32BE(this._a | 0, 0),\n H.writeInt32BE(this._b | 0, 4),\n H.writeInt32BE(this._c | 0, 8),\n H.writeInt32BE(this._d | 0, 12),\n H.writeInt32BE(this._e | 0, 16),\n H\n );\n };\n module.exports = Sha1;\n },\n});\n\n// node_modules/sha.js/sha256.js\nvar require_sha256 = __commonJS({\n \"node_modules/sha.js/sha256.js\"(exports, module) {\n var inherits = require_inherits_browser(),\n Hash = require_hash(),\n Buffer2 = require_safe_buffer().Buffer,\n K = [\n 1116352408, 1899447441, 3049323471, 3921009573, 961987163, 1508970993, 2453635748, 2870763221, 3624381080,\n 310598401, 607225278, 1426881987, 1925078388, 2162078206, 2614888103, 3248222580, 3835390401, 4022224774,\n 264347078, 604807628, 770255983, 1249150122, 1555081692, 1996064986, 2554220882, 2821834349, 2952996808,\n 3210313671, 3336571891, 3584528711, 113926993, 338241895, 666307205, 773529912, 1294757372, 1396182291,\n 1695183700, 1986661051, 2177026350, 2456956037, 2730485921, 2820302411, 3259730800, 3345764771, 3516065817,\n 3600352804, 4094571909, 275423344, 430227734, 506948616, 659060556, 883997877, 958139571, 1322822218,\n 1537002063, 1747873779, 1955562222, 2024104815, 2227730452, 2361852424, 2428436474, 2756734187, 3204031479,\n 3329325298,\n ],\n W = new Array(64);\n function Sha256() {\n this.init(), (this._w = W), Hash.call(this, 64, 56);\n }\n inherits(Sha256, Hash);\n Sha256.prototype.init = function () {\n return (\n (this._a = 1779033703),\n (this._b = 3144134277),\n (this._c = 1013904242),\n (this._d = 2773480762),\n (this._e = 1359893119),\n (this._f = 2600822924),\n (this._g = 528734635),\n (this._h = 1541459225),\n this\n );\n };\n function ch(x, y, z) {\n return z ^ (x & (y ^ z));\n }\n function maj(x, y, z) {\n return (x & y) | (z & (x | y));\n }\n function sigma0(x) {\n return ((x >>> 2) | (x << 30)) ^ ((x >>> 13) | (x << 19)) ^ ((x >>> 22) | (x << 10));\n }\n function sigma1(x) {\n return ((x >>> 6) | (x << 26)) ^ ((x >>> 11) | (x << 21)) ^ ((x >>> 25) | (x << 7));\n }\n function gamma0(x) {\n return ((x >>> 7) | (x << 25)) ^ ((x >>> 18) | (x << 14)) ^ (x >>> 3);\n }\n function gamma1(x) {\n return ((x >>> 17) | (x << 15)) ^ ((x >>> 19) | (x << 13)) ^ (x >>> 10);\n }\n Sha256.prototype._update = function (M) {\n for (\n var W2 = this._w,\n a = this._a | 0,\n b = this._b | 0,\n c = this._c | 0,\n d = this._d | 0,\n e = this._e | 0,\n f = this._f | 0,\n g = this._g | 0,\n h = this._h | 0,\n i = 0;\n i < 16;\n ++i\n )\n W2[i] = M.readInt32BE(i * 4);\n for (; i < 64; ++i) W2[i] = (gamma1(W2[i - 2]) + W2[i - 7] + gamma0(W2[i - 15]) + W2[i - 16]) | 0;\n for (var j = 0; j < 64; ++j) {\n var T1 = (h + sigma1(e) + ch(e, f, g) + K[j] + W2[j]) | 0,\n T2 = (sigma0(a) + maj(a, b, c)) | 0;\n (h = g), (g = f), (f = e), (e = (d + T1) | 0), (d = c), (c = b), (b = a), (a = (T1 + T2) | 0);\n }\n (this._a = (a + this._a) | 0),\n (this._b = (b + this._b) | 0),\n (this._c = (c + this._c) | 0),\n (this._d = (d + this._d) | 0),\n (this._e = (e + this._e) | 0),\n (this._f = (f + this._f) | 0),\n (this._g = (g + this._g) | 0),\n (this._h = (h + this._h) | 0);\n };\n Sha256.prototype._hash = function () {\n var H = Buffer2.allocUnsafe(32);\n return (\n H.writeInt32BE(this._a, 0),\n H.writeInt32BE(this._b, 4),\n H.writeInt32BE(this._c, 8),\n H.writeInt32BE(this._d, 12),\n H.writeInt32BE(this._e, 16),\n H.writeInt32BE(this._f, 20),\n H.writeInt32BE(this._g, 24),\n H.writeInt32BE(this._h, 28),\n H\n );\n };\n module.exports = Sha256;\n },\n});\n\n// node_modules/sha.js/sha224.js\nvar require_sha224 = __commonJS({\n \"node_modules/sha.js/sha224.js\"(exports, module) {\n var inherits = require_inherits_browser(),\n Sha256 = require_sha256(),\n Hash = require_hash(),\n Buffer2 = require_safe_buffer().Buffer,\n W = new Array(64);\n function Sha224() {\n this.init(), (this._w = W), Hash.call(this, 64, 56);\n }\n inherits(Sha224, Sha256);\n Sha224.prototype.init = function () {\n return (\n (this._a = 3238371032),\n (this._b = 914150663),\n (this._c = 812702999),\n (this._d = 4144912697),\n (this._e = 4290775857),\n (this._f = 1750603025),\n (this._g = 1694076839),\n (this._h = 3204075428),\n this\n );\n };\n Sha224.prototype._hash = function () {\n var H = Buffer2.allocUnsafe(28);\n return (\n H.writeInt32BE(this._a, 0),\n H.writeInt32BE(this._b, 4),\n H.writeInt32BE(this._c, 8),\n H.writeInt32BE(this._d, 12),\n H.writeInt32BE(this._e, 16),\n H.writeInt32BE(this._f, 20),\n H.writeInt32BE(this._g, 24),\n H\n );\n };\n module.exports = Sha224;\n },\n});\n\n// node_modules/sha.js/sha512.js\nvar require_sha512 = __commonJS({\n \"node_modules/sha.js/sha512.js\"(exports, module) {\n var inherits = require_inherits_browser(),\n Hash = require_hash(),\n Buffer2 = require_safe_buffer().Buffer,\n K = [\n 1116352408, 3609767458, 1899447441, 602891725, 3049323471, 3964484399, 3921009573, 2173295548, 961987163,\n 4081628472, 1508970993, 3053834265, 2453635748, 2937671579, 2870763221, 3664609560, 3624381080, 2734883394,\n 310598401, 1164996542, 607225278, 1323610764, 1426881987, 3590304994, 1925078388, 4068182383, 2162078206,\n 991336113, 2614888103, 633803317, 3248222580, 3479774868, 3835390401, 2666613458, 4022224774, 944711139,\n 264347078, 2341262773, 604807628, 2007800933, 770255983, 1495990901, 1249150122, 1856431235, 1555081692,\n 3175218132, 1996064986, 2198950837, 2554220882, 3999719339, 2821834349, 766784016, 2952996808, 2566594879,\n 3210313671, 3203337956, 3336571891, 1034457026, 3584528711, 2466948901, 113926993, 3758326383, 338241895,\n 168717936, 666307205, 1188179964, 773529912, 1546045734, 1294757372, 1522805485, 1396182291, 2643833823,\n 1695183700, 2343527390, 1986661051, 1014477480, 2177026350, 1206759142, 2456956037, 344077627, 2730485921,\n 1290863460, 2820302411, 3158454273, 3259730800, 3505952657, 3345764771, 106217008, 3516065817, 3606008344,\n 3600352804, 1432725776, 4094571909, 1467031594, 275423344, 851169720, 430227734, 3100823752, 506948616,\n 1363258195, 659060556, 3750685593, 883997877, 3785050280, 958139571, 3318307427, 1322822218, 3812723403,\n 1537002063, 2003034995, 1747873779, 3602036899, 1955562222, 1575990012, 2024104815, 1125592928, 2227730452,\n 2716904306, 2361852424, 442776044, 2428436474, 593698344, 2756734187, 3733110249, 3204031479, 2999351573,\n 3329325298, 3815920427, 3391569614, 3928383900, 3515267271, 566280711, 3940187606, 3454069534, 4118630271,\n 4000239992, 116418474, 1914138554, 174292421, 2731055270, 289380356, 3203993006, 460393269, 320620315,\n 685471733, 587496836, 852142971, 1086792851, 1017036298, 365543100, 1126000580, 2618297676, 1288033470,\n 3409855158, 1501505948, 4234509866, 1607167915, 987167468, 1816402316, 1246189591,\n ],\n W = new Array(160);\n function Sha512() {\n this.init(), (this._w = W), Hash.call(this, 128, 112);\n }\n inherits(Sha512, Hash);\n Sha512.prototype.init = function () {\n return (\n (this._ah = 1779033703),\n (this._bh = 3144134277),\n (this._ch = 1013904242),\n (this._dh = 2773480762),\n (this._eh = 1359893119),\n (this._fh = 2600822924),\n (this._gh = 528734635),\n (this._hh = 1541459225),\n (this._al = 4089235720),\n (this._bl = 2227873595),\n (this._cl = 4271175723),\n (this._dl = 1595750129),\n (this._el = 2917565137),\n (this._fl = 725511199),\n (this._gl = 4215389547),\n (this._hl = 327033209),\n this\n );\n };\n function Ch(x, y, z) {\n return z ^ (x & (y ^ z));\n }\n function maj(x, y, z) {\n return (x & y) | (z & (x | y));\n }\n function sigma0(x, xl) {\n return ((x >>> 28) | (xl << 4)) ^ ((xl >>> 2) | (x << 30)) ^ ((xl >>> 7) | (x << 25));\n }\n function sigma1(x, xl) {\n return ((x >>> 14) | (xl << 18)) ^ ((x >>> 18) | (xl << 14)) ^ ((xl >>> 9) | (x << 23));\n }\n function Gamma0(x, xl) {\n return ((x >>> 1) | (xl << 31)) ^ ((x >>> 8) | (xl << 24)) ^ (x >>> 7);\n }\n function Gamma0l(x, xl) {\n return ((x >>> 1) | (xl << 31)) ^ ((x >>> 8) | (xl << 24)) ^ ((x >>> 7) | (xl << 25));\n }\n function Gamma1(x, xl) {\n return ((x >>> 19) | (xl << 13)) ^ ((xl >>> 29) | (x << 3)) ^ (x >>> 6);\n }\n function Gamma1l(x, xl) {\n return ((x >>> 19) | (xl << 13)) ^ ((xl >>> 29) | (x << 3)) ^ ((x >>> 6) | (xl << 26));\n }\n function getCarry(a, b) {\n return a >>> 0 < b >>> 0 ? 1 : 0;\n }\n Sha512.prototype._update = function (M) {\n for (\n var W2 = this._w,\n ah = this._ah | 0,\n bh = this._bh | 0,\n ch = this._ch | 0,\n dh = this._dh | 0,\n eh = this._eh | 0,\n fh = this._fh | 0,\n gh = this._gh | 0,\n hh = this._hh | 0,\n al = this._al | 0,\n bl = this._bl | 0,\n cl = this._cl | 0,\n dl = this._dl | 0,\n el = this._el | 0,\n fl = this._fl | 0,\n gl = this._gl | 0,\n hl = this._hl | 0,\n i = 0;\n i < 32;\n i += 2\n )\n (W2[i] = M.readInt32BE(i * 4)), (W2[i + 1] = M.readInt32BE(i * 4 + 4));\n for (; i < 160; i += 2) {\n var xh = W2[i - 30],\n xl = W2[i - 15 * 2 + 1],\n gamma0 = Gamma0(xh, xl),\n gamma0l = Gamma0l(xl, xh);\n (xh = W2[i - 2 * 2]), (xl = W2[i - 2 * 2 + 1]);\n var gamma1 = Gamma1(xh, xl),\n gamma1l = Gamma1l(xl, xh),\n Wi7h = W2[i - 7 * 2],\n Wi7l = W2[i - 7 * 2 + 1],\n Wi16h = W2[i - 16 * 2],\n Wi16l = W2[i - 16 * 2 + 1],\n Wil = (gamma0l + Wi7l) | 0,\n 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 (W2[i] = Wih),\n (W2[i + 1] = Wil);\n }\n for (var j = 0; j < 160; j += 2) {\n (Wih = W2[j]), (Wil = W2[j + 1]);\n var majh = maj(ah, bh, ch),\n majl = maj(al, bl, cl),\n sigma0h = sigma0(ah, al),\n sigma0l = sigma0(al, ah),\n sigma1h = sigma1(eh, el),\n sigma1l = sigma1(el, eh),\n Kih = K[j],\n Kil = K[j + 1],\n chh = Ch(eh, fh, gh),\n chl = Ch(el, fl, gl),\n t1l = (hl + sigma1l) | 0,\n 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 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 (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 Sha512.prototype._hash = function () {\n var H = Buffer2.allocUnsafe(64);\n function writeInt64BE(h, l, offset) {\n H.writeInt32BE(h, offset), H.writeInt32BE(l, offset + 4);\n }\n return (\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 H\n );\n };\n module.exports = Sha512;\n },\n});\n\n// node_modules/sha.js/sha384.js\nvar require_sha384 = __commonJS({\n \"node_modules/sha.js/sha384.js\"(exports, module) {\n var inherits = require_inherits_browser(),\n SHA512 = require_sha512(),\n Hash = require_hash(),\n Buffer2 = require_safe_buffer().Buffer,\n W = new Array(160);\n function Sha384() {\n this.init(), (this._w = W), Hash.call(this, 128, 112);\n }\n inherits(Sha384, SHA512);\n Sha384.prototype.init = function () {\n return (\n (this._ah = 3418070365),\n (this._bh = 1654270250),\n (this._ch = 2438529370),\n (this._dh = 355462360),\n (this._eh = 1731405415),\n (this._fh = 2394180231),\n (this._gh = 3675008525),\n (this._hh = 1203062813),\n (this._al = 3238371032),\n (this._bl = 914150663),\n (this._cl = 812702999),\n (this._dl = 4144912697),\n (this._el = 4290775857),\n (this._fl = 1750603025),\n (this._gl = 1694076839),\n (this._hl = 3204075428),\n this\n );\n };\n Sha384.prototype._hash = function () {\n var H = Buffer2.allocUnsafe(48);\n function writeInt64BE(h, l, offset) {\n H.writeInt32BE(h, offset), H.writeInt32BE(l, offset + 4);\n }\n return (\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 H\n );\n };\n module.exports = Sha384;\n },\n});\n\n// node_modules/sha.js/index.js\nvar require_sha2 = __commonJS({\n \"node_modules/sha.js/index.js\"(exports, module) {\n var exports = (module.exports = function (algorithm) {\n algorithm = algorithm.toLowerCase();\n var Algorithm = exports[algorithm];\n if (!Algorithm) throw new Error(algorithm + \" is not supported (we accept pull requests)\");\n return new Algorithm();\n });\n exports.sha = require_sha();\n exports.sha1 = require_sha1();\n exports.sha224 = require_sha224();\n exports.sha256 = require_sha256();\n exports.sha384 = require_sha384();\n exports.sha512 = require_sha512();\n },\n});\n\n// stream.js\nvar stream_exports = import.meta.require(\"node:stream\");\n\n// node_modules/cipher-base/index.js\nvar require_cipher_base = __commonJS({\n \"node_modules/cipher-base/index.js\"(exports, module) {\n var Buffer2 = require_safe_buffer().Buffer,\n Transform = stream_exports.Transform,\n StringDecoder = __require(\"string_decoder\").StringDecoder,\n inherits = require_inherits_browser();\n function CipherBase(hashMode) {\n Transform.call(this),\n (this.hashMode = typeof hashMode == \"string\"),\n this.hashMode ? (this[hashMode] = this._finalOrDigest) : (this.final = this._finalOrDigest),\n this._final && ((this.__final = this._final), (this._final = null)),\n (this._decoder = null),\n (this._encoding = null);\n }\n inherits(CipherBase, Transform);\n CipherBase.prototype.update = function (data, inputEnc, outputEnc) {\n typeof data == \"string\" && (data = Buffer2.from(data, inputEnc));\n var outData = this._update(data);\n return this.hashMode ? this : (outputEnc && (outData = this._toString(outData, outputEnc)), outData);\n };\n CipherBase.prototype.setAutoPadding = function () {};\n CipherBase.prototype.getAuthTag = function () {\n throw new Error(\"trying to get auth tag in unsupported state\");\n };\n CipherBase.prototype.setAuthTag = function () {\n throw new Error(\"trying to set auth tag in unsupported state\");\n };\n CipherBase.prototype.setAAD = function () {\n throw new Error(\"trying to set aad in unsupported state\");\n };\n CipherBase.prototype._transform = function (data, _, next) {\n var err;\n try {\n this.hashMode ? this._update(data) : this.push(this._update(data));\n } catch (e) {\n err = e;\n } finally {\n next(err);\n }\n };\n CipherBase.prototype._flush = function (done) {\n var err;\n try {\n this.push(this.__final());\n } catch (e) {\n err = e;\n }\n done(err);\n };\n CipherBase.prototype._finalOrDigest = function (outputEnc) {\n var outData = this.__final() || Buffer2.alloc(0);\n return outputEnc && (outData = this._toString(outData, outputEnc, !0)), outData;\n };\n CipherBase.prototype._toString = function (value, enc, fin) {\n if ((this._decoder || ((this._decoder = new StringDecoder(enc)), (this._encoding = enc)), this._encoding !== enc))\n throw new Error(\"can't switch encodings\");\n var out = this._decoder.write(value);\n return fin && (out += this._decoder.end()), out;\n };\n module.exports = CipherBase;\n },\n});\n\n// node_modules/create-hash/browser.js\nvar require_browser2 = __commonJS({\n \"node_modules/create-hash/browser.js\"(exports, module) {\n (\"use strict\");\n const { Transform } = stream_exports;\n\n // does not become a node stream unless you create it into one\n const LazyHash = function Hash(algorithm, options) {\n this._options = options;\n this._hasher = new CryptoHasher(algorithm, options);\n this._finalized = false;\n };\n LazyHash.prototype = Object.create(Transform.prototype);\n LazyHash.prototype.update = function update(data, encoding) {\n this._checkFinalized();\n this._hasher.update(data, encoding);\n return this;\n };\n LazyHash.prototype.digest = function update(data, encoding) {\n this._checkFinalized();\n this._finalized = true;\n return this._hasher.digest(data, encoding);\n };\n LazyHash.prototype._checkFinalized = function _checkFinalized() {\n if (this._finalized) {\n var err = new Error(\"Digest already called\");\n err.code = \"ERR_CRYPTO_HASH_FINALIZED\";\n throw err;\n }\n };\n LazyHash.prototype.copy = function copy() {\n const copy = Object.create(LazyHash.prototype);\n copy._options = this._options;\n copy._hasher = this._hasher.copy();\n copy._finalized = this._finalized;\n return copy;\n };\n\n const lazyHashFullInitProto = {\n __proto__: Transform.prototype,\n ...LazyHash.prototype,\n _transform(data, encoding, callback) {\n this.update(data, encoding);\n callback && callback();\n },\n _flush(callback) {\n this.push(this.digest());\n callback();\n },\n };\n\n const triggerMethods = [\n \"_events\",\n \"_eventsCount\",\n \"_final\",\n \"_maxListeners\",\n \"_maxListeners\",\n \"_read\",\n \"_undestroy\",\n \"_writableState\",\n \"_write\",\n \"_writev\",\n \"addListener\",\n \"asIndexedPairs\",\n \"closed\",\n \"compose\",\n \"constructor\",\n \"cork\",\n \"destroy\",\n \"destroyed\",\n \"drop\",\n \"emit\",\n \"end\",\n \"errored\",\n \"eventNames\",\n \"every\",\n \"filter\",\n \"find\",\n \"flatMap\",\n \"forEach\",\n \"getMaxListeners\",\n \"hasOwnProperty\",\n \"isPaused\",\n \"isPrototypeOf\",\n \"iterator\",\n \"listenerCount\",\n \"listeners\",\n \"map\",\n \"off\",\n \"on\",\n \"once\",\n \"pause\",\n \"pipe\",\n \"prependListener\",\n \"prependOnceListener\",\n \"propertyIsEnumerable\",\n \"push\",\n \"rawListeners\",\n \"read\",\n \"readable\",\n \"readableAborted\",\n \"readableBuffer\",\n \"readableDidRead\",\n \"readableEncoding\",\n \"readableEnded\",\n \"readableFlowing\",\n \"readableHighWaterMark\",\n \"readableLength\",\n \"readableObjectMode\",\n \"reduce\",\n \"removeAllListeners\",\n \"removeListener\",\n \"resume\",\n \"setDefaultEncoding\",\n \"setEncoding\",\n \"setMaxListeners\",\n \"some\",\n \"take\",\n \"toArray\",\n \"toLocaleString\",\n \"toString\",\n \"uncork\",\n \"unpipe\",\n \"unshift\",\n \"valueOf\",\n \"wrap\",\n \"writable\",\n \"writableBuffer\",\n \"writableCorked\",\n \"writableEnded\",\n \"writableFinished\",\n \"writableHighWaterMark\",\n \"writableLength\",\n \"writableNeedDrain\",\n \"writableObjectMode\",\n \"write\",\n ];\n for (const method of triggerMethods) {\n Object.defineProperty(LazyHash.prototype, method, {\n get() {\n Object.setPrototypeOf(this, lazyHashFullInitProto);\n Transform.call(this, this._options);\n return this[method];\n },\n enumerable: false,\n configurable: true,\n });\n }\n\n module.exports = function createHash(algorithm) {\n return new LazyHash(algorithm);\n };\n\n module.exports.createHash = module.exports;\n module.exports.Hash = LazyHash;\n },\n});\n\n// node_modules/create-hmac/legacy.js\nvar require_legacy = __commonJS({\n \"node_modules/create-hmac/legacy.js\"(exports, module) {\n \"use strict\";\n var inherits = require_inherits_browser(),\n Buffer2 = require_safe_buffer().Buffer,\n Base = require_cipher_base(),\n ZEROS = Buffer2.alloc(128),\n blocksize = 64;\n function Hmac(alg, key) {\n Base.call(this, \"digest\"),\n typeof key == \"string\" && (key = Buffer2.from(key)),\n (this._alg = alg),\n (this._key = key),\n key.length > blocksize\n ? (key = alg(key))\n : key.length < blocksize && (key = Buffer2.concat([key, ZEROS], blocksize));\n for (\n var ipad = (this._ipad = Buffer2.allocUnsafe(blocksize)),\n opad = (this._opad = Buffer2.allocUnsafe(blocksize)),\n i = 0;\n i < blocksize;\n i++\n )\n (ipad[i] = key[i] ^ 54), (opad[i] = key[i] ^ 92);\n this._hash = [ipad];\n }\n inherits(Hmac, Base);\n Hmac.prototype._update = function (data) {\n this._hash.push(data);\n };\n Hmac.prototype._final = function () {\n var h = this._alg(Buffer2.concat(this._hash));\n return this._alg(Buffer2.concat([this._opad, h]));\n };\n module.exports = Hmac;\n },\n});\n\n// node_modules/create-hash/md5.js\nvar require_md52 = __commonJS({\n \"node_modules/create-hash/md5.js\"(exports, module) {\n var MD5 = require_md5();\n module.exports = function (buffer) {\n return new MD5().update(buffer).digest();\n };\n },\n});\n\n// node_modules/create-hmac/browser.js\nvar require_browser3 = __commonJS({\n \"node_modules/create-hmac/browser.js\"(exports, module) {\n \"use strict\";\n var inherits = require_inherits_browser(),\n Legacy = require_legacy(),\n Base = require_cipher_base(),\n Buffer2 = require_safe_buffer().Buffer,\n md5 = require_md52(),\n RIPEMD160 = require_ripemd160(),\n sha = require_sha2(),\n ZEROS = Buffer2.alloc(128);\n function Hmac(alg, key) {\n Base.call(this, \"digest\"), typeof key == \"string\" && (key = Buffer2.from(key));\n var blocksize = alg === \"sha512\" || alg === \"sha384\" ? 128 : 64;\n if (((this._alg = alg), (this._key = key), key.length > blocksize)) {\n var hash = alg === \"rmd160\" ? new RIPEMD160() : sha(alg);\n key = hash.update(key).digest();\n } else key.length < blocksize && (key = Buffer2.concat([key, ZEROS], blocksize));\n for (\n var ipad = (this._ipad = Buffer2.allocUnsafe(blocksize)),\n opad = (this._opad = Buffer2.allocUnsafe(blocksize)),\n i = 0;\n i < blocksize;\n i++\n )\n (ipad[i] = key[i] ^ 54), (opad[i] = key[i] ^ 92);\n (this._hash = alg === \"rmd160\" ? new RIPEMD160() : sha(alg)), this._hash.update(ipad);\n }\n inherits(Hmac, Base);\n Hmac.prototype._update = function (data) {\n this._hash.update(data);\n };\n Hmac.prototype._final = function () {\n var h = this._hash.digest(),\n hash = this._alg === \"rmd160\" ? new RIPEMD160() : sha(this._alg);\n return hash.update(this._opad).update(h).digest();\n };\n module.exports = function (alg, key) {\n return (\n (alg = alg.toLowerCase()),\n alg === \"rmd160\" || alg === \"ripemd160\"\n ? new Hmac(\"rmd160\", key)\n : alg === \"md5\"\n ? new Legacy(md5, key)\n : new Hmac(alg, key)\n );\n };\n },\n});\n\n// node_modules/browserify-sign/browser/algorithms.json\nvar require_algorithms = __commonJS({\n \"node_modules/browserify-sign/browser/algorithms.json\"(exports, module) {\n module.exports = {\n sha224WithRSAEncryption: {\n sign: \"rsa\",\n hash: \"sha224\",\n id: \"302d300d06096086480165030402040500041c\",\n },\n \"RSA-SHA224\": {\n sign: \"ecdsa/rsa\",\n hash: \"sha224\",\n id: \"302d300d06096086480165030402040500041c\",\n },\n sha256WithRSAEncryption: {\n sign: \"rsa\",\n hash: \"sha256\",\n id: \"3031300d060960864801650304020105000420\",\n },\n \"RSA-SHA256\": {\n sign: \"ecdsa/rsa\",\n hash: \"sha256\",\n id: \"3031300d060960864801650304020105000420\",\n },\n sha384WithRSAEncryption: {\n sign: \"rsa\",\n hash: \"sha384\",\n id: \"3041300d060960864801650304020205000430\",\n },\n \"RSA-SHA384\": {\n sign: \"ecdsa/rsa\",\n hash: \"sha384\",\n id: \"3041300d060960864801650304020205000430\",\n },\n sha512WithRSAEncryption: {\n sign: \"rsa\",\n hash: \"sha512\",\n id: \"3051300d060960864801650304020305000440\",\n },\n \"RSA-SHA512\": {\n sign: \"ecdsa/rsa\",\n hash: \"sha512\",\n id: \"3051300d060960864801650304020305000440\",\n },\n \"RSA-SHA1\": {\n sign: \"rsa\",\n hash: \"sha1\",\n id: \"3021300906052b0e03021a05000414\",\n },\n \"ecdsa-with-SHA1\": {\n sign: \"ecdsa\",\n hash: \"sha1\",\n id: \"\",\n },\n sha256: {\n sign: \"ecdsa\",\n hash: \"sha256\",\n id: \"\",\n },\n sha224: {\n sign: \"ecdsa\",\n hash: \"sha224\",\n id: \"\",\n },\n sha384: {\n sign: \"ecdsa\",\n hash: \"sha384\",\n id: \"\",\n },\n sha512: {\n sign: \"ecdsa\",\n hash: \"sha512\",\n id: \"\",\n },\n \"DSA-SHA\": {\n sign: \"dsa\",\n hash: \"sha1\",\n id: \"\",\n },\n \"DSA-SHA1\": {\n sign: \"dsa\",\n hash: \"sha1\",\n id: \"\",\n },\n DSA: {\n sign: \"dsa\",\n hash: \"sha1\",\n id: \"\",\n },\n \"DSA-WITH-SHA224\": {\n sign: \"dsa\",\n hash: \"sha224\",\n id: \"\",\n },\n \"DSA-SHA224\": {\n sign: \"dsa\",\n hash: \"sha224\",\n id: \"\",\n },\n \"DSA-WITH-SHA256\": {\n sign: \"dsa\",\n hash: \"sha256\",\n id: \"\",\n },\n \"DSA-SHA256\": {\n sign: \"dsa\",\n hash: \"sha256\",\n id: \"\",\n },\n \"DSA-WITH-SHA384\": {\n sign: \"dsa\",\n hash: \"sha384\",\n id: \"\",\n },\n \"DSA-SHA384\": {\n sign: \"dsa\",\n hash: \"sha384\",\n id: \"\",\n },\n \"DSA-WITH-SHA512\": {\n sign: \"dsa\",\n hash: \"sha512\",\n id: \"\",\n },\n \"DSA-SHA512\": {\n sign: \"dsa\",\n hash: \"sha512\",\n id: \"\",\n },\n \"DSA-RIPEMD160\": {\n sign: \"dsa\",\n hash: \"rmd160\",\n id: \"\",\n },\n ripemd160WithRSA: {\n sign: \"rsa\",\n hash: \"rmd160\",\n id: \"3021300906052b2403020105000414\",\n },\n \"RSA-RIPEMD160\": {\n sign: \"rsa\",\n hash: \"rmd160\",\n id: \"3021300906052b2403020105000414\",\n },\n md5WithRSAEncryption: {\n sign: \"rsa\",\n hash: \"md5\",\n id: \"3020300c06082a864886f70d020505000410\",\n },\n \"RSA-MD5\": {\n sign: \"rsa\",\n hash: \"md5\",\n id: \"3020300c06082a864886f70d020505000410\",\n },\n };\n },\n});\n\n// node_modules/browserify-sign/algos.js\nvar require_algos = __commonJS({\n \"node_modules/browserify-sign/algos.js\"(exports, module) {\n module.exports = require_algorithms();\n },\n});\n\n// node_modules/pbkdf2/lib/precondition.js\nvar require_precondition = __commonJS({\n \"node_modules/pbkdf2/lib/precondition.js\"(exports, module) {\n var MAX_ALLOC = Math.pow(2, 30) - 1;\n module.exports = function (iterations, keylen) {\n if (typeof iterations != \"number\") throw new TypeError(\"Iterations not a number\");\n if (iterations < 0) throw new TypeError(\"Bad iterations\");\n if (typeof keylen != \"number\") throw new TypeError(\"Key length not a number\");\n if (keylen < 0 || keylen > MAX_ALLOC || keylen !== keylen) throw new TypeError(\"Bad key length\");\n };\n },\n});\n\n// node_modules/pbkdf2/lib/default-encoding.js\nvar require_default_encoding = __commonJS({\n \"node_modules/pbkdf2/lib/default-encoding.js\"(exports, module) {\n var defaultEncoding;\n global.process && global.process.browser\n ? (defaultEncoding = \"utf-8\")\n : global.process && global.process.version\n ? ((pVersionMajor = parseInt(process.version.split(\".\")[0].slice(1), 10)),\n (defaultEncoding = pVersionMajor >= 6 ? \"utf-8\" : \"binary\"))\n : (defaultEncoding = \"utf-8\");\n var pVersionMajor;\n module.exports = defaultEncoding;\n },\n});\n\n// node_modules/pbkdf2/lib/to-buffer.js\nvar require_to_buffer = __commonJS({\n \"node_modules/pbkdf2/lib/to-buffer.js\"(exports, module) {\n var Buffer2 = require_safe_buffer().Buffer;\n module.exports = function (thing, encoding, name) {\n if (Buffer2.isBuffer(thing)) return thing;\n if (typeof thing == \"string\") return Buffer2.from(thing, encoding);\n if (ArrayBuffer.isView(thing)) return Buffer2.from(thing.buffer);\n throw new TypeError(name + \" must be a string, a Buffer, a typed array or a DataView\");\n };\n },\n});\n\n// node_modules/pbkdf2/lib/sync-browser.js\nvar require_sync_browser = __commonJS({\n \"node_modules/pbkdf2/lib/sync-browser.js\"(exports, module) {\n var md5 = require_md52(),\n RIPEMD160 = require_ripemd160(),\n sha = require_sha2(),\n Buffer2 = require_safe_buffer().Buffer,\n checkParameters = require_precondition(),\n defaultEncoding = require_default_encoding(),\n toBuffer = require_to_buffer(),\n ZEROS = Buffer2.alloc(128),\n sizes = {\n md5: 16,\n sha1: 20,\n sha224: 28,\n sha256: 32,\n sha384: 48,\n sha512: 64,\n rmd160: 20,\n ripemd160: 20,\n };\n function Hmac(alg, key, saltLen) {\n var hash = getDigest(alg),\n blocksize = alg === \"sha512\" || alg === \"sha384\" ? 128 : 64;\n key.length > blocksize\n ? (key = hash(key))\n : key.length < blocksize && (key = Buffer2.concat([key, ZEROS], blocksize));\n for (\n var ipad = Buffer2.allocUnsafe(blocksize + sizes[alg]),\n opad = Buffer2.allocUnsafe(blocksize + sizes[alg]),\n i = 0;\n i < blocksize;\n i++\n )\n (ipad[i] = key[i] ^ 54), (opad[i] = key[i] ^ 92);\n var ipad1 = Buffer2.allocUnsafe(blocksize + saltLen + 4);\n ipad.copy(ipad1, 0, 0, blocksize),\n (this.ipad1 = ipad1),\n (this.ipad2 = ipad),\n (this.opad = opad),\n (this.alg = alg),\n (this.blocksize = blocksize),\n (this.hash = hash),\n (this.size = sizes[alg]);\n }\n Hmac.prototype.run = function (data, ipad) {\n data.copy(ipad, this.blocksize);\n var h = this.hash(ipad);\n return h.copy(this.opad, this.blocksize), this.hash(this.opad);\n };\n function getDigest(alg) {\n function shaFunc(data) {\n return sha(alg).update(data).digest();\n }\n function rmd160Func(data) {\n return new RIPEMD160().update(data).digest();\n }\n return alg === \"rmd160\" || alg === \"ripemd160\" ? rmd160Func : alg === \"md5\" ? md5 : shaFunc;\n }\n function pbkdf2(password, salt, iterations, keylen, digest) {\n checkParameters(iterations, keylen),\n (password = toBuffer(password, defaultEncoding, \"Password\")),\n (salt = toBuffer(salt, defaultEncoding, \"Salt\")),\n (digest = digest || \"sha1\");\n var hmac = new Hmac(digest, password, salt.length),\n DK = Buffer2.allocUnsafe(keylen),\n block1 = Buffer2.allocUnsafe(salt.length + 4);\n salt.copy(block1, 0, 0, salt.length);\n for (var destPos = 0, hLen = sizes[digest], l = Math.ceil(keylen / hLen), i = 1; i <= l; i++) {\n block1.writeUInt32BE(i, salt.length);\n for (var T = hmac.run(block1, hmac.ipad1), U = T, j = 1; j < iterations; j++) {\n U = hmac.run(U, hmac.ipad2);\n for (var k = 0; k < hLen; k++) T[k] ^= U[k];\n }\n T.copy(DK, destPos), (destPos += hLen);\n }\n return DK;\n }\n module.exports = pbkdf2;\n },\n});\n\n// node_modules/pbkdf2/lib/async.js\nvar require_async = __commonJS({\n \"node_modules/pbkdf2/lib/async.js\"(exports, module) {\n var Buffer2 = require_safe_buffer().Buffer,\n checkParameters = require_precondition(),\n defaultEncoding = require_default_encoding(),\n sync = require_sync_browser(),\n toBuffer = require_to_buffer(),\n ZERO_BUF,\n subtle = globalCrypto.subtle,\n toBrowser = {\n sha: \"SHA-1\",\n \"sha-1\": \"SHA-1\",\n sha1: \"SHA-1\",\n sha256: \"SHA-256\",\n \"sha-256\": \"SHA-256\",\n sha384: \"SHA-384\",\n \"sha-384\": \"SHA-384\",\n \"sha-512\": \"SHA-512\",\n sha512: \"SHA-512\",\n },\n checks = [];\n function checkNative(algo) {\n if ((global.process && !global.process.browser) || !subtle || !subtle.importKey || !subtle.deriveBits)\n return Promise.resolve(!1);\n if (checks[algo] !== void 0) return checks[algo];\n ZERO_BUF = ZERO_BUF || Buffer2.alloc(8);\n var prom = browserPbkdf2(ZERO_BUF, ZERO_BUF, 10, 128, algo)\n .then(function () {\n return !0;\n })\n .catch(function () {\n return !1;\n });\n return (checks[algo] = prom), prom;\n }\n var nextTick;\n function getNextTick() {\n return (\n nextTick ||\n (global.process && global.process.nextTick\n ? (nextTick = global.process.nextTick)\n : global.queueMicrotask\n ? (nextTick = global.queueMicrotask)\n : global.setImmediate\n ? (nextTick = global.setImmediate)\n : (nextTick = global.setTimeout),\n nextTick)\n );\n }\n function browserPbkdf2(password, salt, iterations, length, algo) {\n return subtle\n .importKey(\"raw\", password, { name: \"PBKDF2\" }, !1, [\"deriveBits\"])\n .then(function (key) {\n return subtle.deriveBits(\n {\n name: \"PBKDF2\",\n salt,\n iterations,\n hash: {\n name: algo,\n },\n },\n key,\n length << 3,\n );\n })\n .then(function (res) {\n return Buffer2.from(res);\n });\n }\n function resolvePromise(promise, callback) {\n promise.then(\n function (out) {\n getNextTick()(function () {\n callback(null, out);\n });\n },\n function (e) {\n getNextTick()(function () {\n callback(e);\n });\n },\n );\n }\n module.exports = function (password, salt, iterations, keylen, digest, callback) {\n typeof digest == \"function\" && ((callback = digest), (digest = void 0)), (digest = digest || \"sha1\");\n var algo = toBrowser[digest.toLowerCase()];\n if (!algo || typeof global.Promise != \"function\") {\n getNextTick()(function () {\n var out;\n try {\n out = sync(password, salt, iterations, keylen, digest);\n } catch (e) {\n return callback(e);\n }\n callback(null, out);\n });\n return;\n }\n if (\n (checkParameters(iterations, keylen),\n (password = toBuffer(password, defaultEncoding, \"Password\")),\n (salt = toBuffer(salt, defaultEncoding, \"Salt\")),\n typeof callback != \"function\")\n )\n throw new Error(\"No callback provided to pbkdf2\");\n resolvePromise(\n checkNative(algo).then(function (resp) {\n return resp\n ? browserPbkdf2(password, salt, iterations, keylen, algo)\n : sync(password, salt, iterations, keylen, digest);\n }),\n callback,\n );\n };\n },\n});\n\n// node_modules/pbkdf2/browser.js\nvar require_browser4 = __commonJS({\n \"node_modules/pbkdf2/browser.js\"(exports) {\n exports.pbkdf2 = require_async();\n exports.pbkdf2Sync = require_sync_browser();\n },\n});\n\n// node_modules/des.js/lib/des/utils.js\nvar require_utils = __commonJS({\n \"node_modules/des.js/lib/des/utils.js\"(exports) {\n \"use strict\";\n exports.readUInt32BE = function (bytes, off) {\n var res = (bytes[0 + off] << 24) | (bytes[1 + off] << 16) | (bytes[2 + off] << 8) | bytes[3 + off];\n return res >>> 0;\n };\n exports.writeUInt32BE = function (bytes, value, off) {\n (bytes[0 + off] = value >>> 24),\n (bytes[1 + off] = (value >>> 16) & 255),\n (bytes[2 + off] = (value >>> 8) & 255),\n (bytes[3 + off] = value & 255);\n };\n exports.ip = function (inL, inR, out, off) {\n for (var outL = 0, outR = 0, i = 6; i >= 0; i -= 2) {\n for (var j = 0; j <= 24; j += 8) (outL <<= 1), (outL |= (inR >>> (j + i)) & 1);\n for (var j = 0; j <= 24; j += 8) (outL <<= 1), (outL |= (inL >>> (j + i)) & 1);\n }\n for (var i = 6; i >= 0; i -= 2) {\n for (var j = 1; j <= 25; j += 8) (outR <<= 1), (outR |= (inR >>> (j + i)) & 1);\n for (var j = 1; j <= 25; j += 8) (outR <<= 1), (outR |= (inL >>> (j + i)) & 1);\n }\n (out[off + 0] = outL >>> 0), (out[off + 1] = outR >>> 0);\n };\n exports.rip = function (inL, inR, out, off) {\n for (var outL = 0, outR = 0, i = 0; i < 4; i++)\n for (var j = 24; j >= 0; j -= 8)\n (outL <<= 1), (outL |= (inR >>> (j + i)) & 1), (outL <<= 1), (outL |= (inL >>> (j + i)) & 1);\n for (var i = 4; i < 8; i++)\n for (var j = 24; j >= 0; j -= 8)\n (outR <<= 1), (outR |= (inR >>> (j + i)) & 1), (outR <<= 1), (outR |= (inL >>> (j + i)) & 1);\n (out[off + 0] = outL >>> 0), (out[off + 1] = outR >>> 0);\n };\n exports.pc1 = function (inL, inR, out, off) {\n for (var outL = 0, outR = 0, i = 7; i >= 5; i--) {\n for (var j = 0; j <= 24; j += 8) (outL <<= 1), (outL |= (inR >> (j + i)) & 1);\n for (var j = 0; j <= 24; j += 8) (outL <<= 1), (outL |= (inL >> (j + i)) & 1);\n }\n for (var j = 0; j <= 24; j += 8) (outL <<= 1), (outL |= (inR >> (j + i)) & 1);\n for (var i = 1; i <= 3; i++) {\n for (var j = 0; j <= 24; j += 8) (outR <<= 1), (outR |= (inR >> (j + i)) & 1);\n for (var j = 0; j <= 24; j += 8) (outR <<= 1), (outR |= (inL >> (j + i)) & 1);\n }\n for (var j = 0; j <= 24; j += 8) (outR <<= 1), (outR |= (inL >> (j + i)) & 1);\n (out[off + 0] = outL >>> 0), (out[off + 1] = outR >>> 0);\n };\n exports.r28shl = function (num, shift) {\n return ((num << shift) & 268435455) | (num >>> (28 - shift));\n };\n var pc2table = [\n 14, 11, 17, 4, 27, 23, 25, 0, 13, 22, 7, 18, 5, 9, 16, 24, 2, 20, 12, 21, 1, 8, 15, 26, 15, 4, 25, 19, 9, 1, 26,\n 16, 5, 11, 23, 8, 12, 7, 17, 0, 22, 3, 10, 14, 6, 20, 27, 24,\n ];\n exports.pc2 = function (inL, inR, out, off) {\n for (var outL = 0, outR = 0, len = pc2table.length >>> 1, i = 0; i < len; i++)\n (outL <<= 1), (outL |= (inL >>> pc2table[i]) & 1);\n for (var i = len; i < pc2table.length; i++) (outR <<= 1), (outR |= (inR >>> pc2table[i]) & 1);\n (out[off + 0] = outL >>> 0), (out[off + 1] = outR >>> 0);\n };\n exports.expand = function (r, out, off) {\n var outL = 0,\n outR = 0;\n outL = ((r & 1) << 5) | (r >>> 27);\n for (var i = 23; i >= 15; i -= 4) (outL <<= 6), (outL |= (r >>> i) & 63);\n for (var i = 11; i >= 3; i -= 4) (outR |= (r >>> i) & 63), (outR <<= 6);\n (outR |= ((r & 31) << 1) | (r >>> 31)), (out[off + 0] = outL >>> 0), (out[off + 1] = outR >>> 0);\n };\n var sTable = [\n 14, 0, 4, 15, 13, 7, 1, 4, 2, 14, 15, 2, 11, 13, 8, 1, 3, 10, 10, 6, 6, 12, 12, 11, 5, 9, 9, 5, 0, 3, 7, 8, 4, 15,\n 1, 12, 14, 8, 8, 2, 13, 4, 6, 9, 2, 1, 11, 7, 15, 5, 12, 11, 9, 3, 7, 14, 3, 10, 10, 0, 5, 6, 0, 13, 15, 3, 1, 13,\n 8, 4, 14, 7, 6, 15, 11, 2, 3, 8, 4, 14, 9, 12, 7, 0, 2, 1, 13, 10, 12, 6, 0, 9, 5, 11, 10, 5, 0, 13, 14, 8, 7, 10,\n 11, 1, 10, 3, 4, 15, 13, 4, 1, 2, 5, 11, 8, 6, 12, 7, 6, 12, 9, 0, 3, 5, 2, 14, 15, 9, 10, 13, 0, 7, 9, 0, 14, 9,\n 6, 3, 3, 4, 15, 6, 5, 10, 1, 2, 13, 8, 12, 5, 7, 14, 11, 12, 4, 11, 2, 15, 8, 1, 13, 1, 6, 10, 4, 13, 9, 0, 8, 6,\n 15, 9, 3, 8, 0, 7, 11, 4, 1, 15, 2, 14, 12, 3, 5, 11, 10, 5, 14, 2, 7, 12, 7, 13, 13, 8, 14, 11, 3, 5, 0, 6, 6,\n 15, 9, 0, 10, 3, 1, 4, 2, 7, 8, 2, 5, 12, 11, 1, 12, 10, 4, 14, 15, 9, 10, 3, 6, 15, 9, 0, 0, 6, 12, 10, 11, 1, 7,\n 13, 13, 8, 15, 9, 1, 4, 3, 5, 14, 11, 5, 12, 2, 7, 8, 2, 4, 14, 2, 14, 12, 11, 4, 2, 1, 12, 7, 4, 10, 7, 11, 13,\n 6, 1, 8, 5, 5, 0, 3, 15, 15, 10, 13, 3, 0, 9, 14, 8, 9, 6, 4, 11, 2, 8, 1, 12, 11, 7, 10, 1, 13, 14, 7, 2, 8, 13,\n 15, 6, 9, 15, 12, 0, 5, 9, 6, 10, 3, 4, 0, 5, 14, 3, 12, 10, 1, 15, 10, 4, 15, 2, 9, 7, 2, 12, 6, 9, 8, 5, 0, 6,\n 13, 1, 3, 13, 4, 14, 14, 0, 7, 11, 5, 3, 11, 8, 9, 4, 14, 3, 15, 2, 5, 12, 2, 9, 8, 5, 12, 15, 3, 10, 7, 11, 0,\n 14, 4, 1, 10, 7, 1, 6, 13, 0, 11, 8, 6, 13, 4, 13, 11, 0, 2, 11, 14, 7, 15, 4, 0, 9, 8, 1, 13, 10, 3, 14, 12, 3,\n 9, 5, 7, 12, 5, 2, 10, 15, 6, 8, 1, 6, 1, 6, 4, 11, 11, 13, 13, 8, 12, 1, 3, 4, 7, 10, 14, 7, 10, 9, 15, 5, 6, 0,\n 8, 15, 0, 14, 5, 2, 9, 3, 2, 12, 13, 1, 2, 15, 8, 13, 4, 8, 6, 10, 15, 3, 11, 7, 1, 4, 10, 12, 9, 5, 3, 6, 14, 11,\n 5, 0, 0, 14, 12, 9, 7, 2, 7, 2, 11, 1, 4, 14, 1, 7, 9, 4, 12, 10, 14, 8, 2, 13, 0, 15, 6, 12, 10, 9, 13, 0, 15, 3,\n 3, 5, 5, 6, 8, 11,\n ];\n exports.substitute = function (inL, inR) {\n for (var out = 0, i = 0; i < 4; i++) {\n var b = (inL >>> (18 - i * 6)) & 63,\n sb = sTable[i * 64 + b];\n (out <<= 4), (out |= sb);\n }\n for (var i = 0; i < 4; i++) {\n var b = (inR >>> (18 - i * 6)) & 63,\n sb = sTable[4 * 64 + i * 64 + b];\n (out <<= 4), (out |= sb);\n }\n return out >>> 0;\n };\n var permuteTable = [\n 16, 25, 12, 11, 3, 20, 4, 15, 31, 17, 9, 6, 27, 14, 1, 22, 30, 24, 8, 18, 0, 5, 29, 23, 13, 19, 2, 26, 10, 21, 28,\n 7,\n ];\n exports.permute = function (num) {\n for (var out = 0, i = 0; i < permuteTable.length; i++) (out <<= 1), (out |= (num >>> permuteTable[i]) & 1);\n return out >>> 0;\n };\n exports.padSplit = function (num, size, group) {\n for (var str = num.toString(2); str.length < size; ) str = \"0\" + str;\n for (var out = [], i = 0; i < size; i += group) out.push(str.slice(i, i + group));\n return out.join(\" \");\n };\n },\n});\n\n// node_modules/minimalistic-assert/index.js\nvar require_minimalistic_assert = __commonJS({\n \"node_modules/minimalistic-assert/index.js\"(exports, module) {\n module.exports = assert;\n function assert(val, msg) {\n if (!val) throw new Error(msg || \"Assertion failed\");\n }\n assert.equal = function (l, r, msg) {\n if (l != r) throw new Error(msg || \"Assertion failed: \" + l + \" != \" + r);\n };\n },\n});\n\n// node_modules/des.js/lib/des/cipher.js\nvar require_cipher = __commonJS({\n \"node_modules/des.js/lib/des/cipher.js\"(exports, module) {\n \"use strict\";\n var assert = require_minimalistic_assert();\n function Cipher(options) {\n (this.options = options),\n (this.type = this.options.type),\n (this.blockSize = 8),\n this._init(),\n (this.buffer = new Array(this.blockSize)),\n (this.bufferOff = 0);\n }\n module.exports = Cipher;\n Cipher.prototype._init = function () {};\n Cipher.prototype.update = function (data) {\n return data.length === 0 ? [] : this.type === \"decrypt\" ? this._updateDecrypt(data) : this._updateEncrypt(data);\n };\n Cipher.prototype._buffer = function (data, off) {\n for (var min = Math.min(this.buffer.length - this.bufferOff, data.length - off), i = 0; i < min; i++)\n this.buffer[this.bufferOff + i] = data[off + i];\n return (this.bufferOff += min), min;\n };\n Cipher.prototype._flushBuffer = function (out, off) {\n return this._update(this.buffer, 0, out, off), (this.bufferOff = 0), this.blockSize;\n };\n Cipher.prototype._updateEncrypt = function (data) {\n var inputOff = 0,\n outputOff = 0,\n count = ((this.bufferOff + data.length) / this.blockSize) | 0,\n out = new Array(count * this.blockSize);\n this.bufferOff !== 0 &&\n ((inputOff += this._buffer(data, inputOff)),\n this.bufferOff === this.buffer.length && (outputOff += this._flushBuffer(out, outputOff)));\n for (\n var max = data.length - ((data.length - inputOff) % this.blockSize);\n inputOff < max;\n inputOff += this.blockSize\n )\n this._update(data, inputOff, out, outputOff), (outputOff += this.blockSize);\n for (; inputOff < data.length; inputOff++, this.bufferOff++) this.buffer[this.bufferOff] = data[inputOff];\n return out;\n };\n Cipher.prototype._updateDecrypt = function (data) {\n for (\n var inputOff = 0,\n outputOff = 0,\n count = Math.ceil((this.bufferOff + data.length) / this.blockSize) - 1,\n out = new Array(count * this.blockSize);\n count > 0;\n count--\n )\n (inputOff += this._buffer(data, inputOff)), (outputOff += this._flushBuffer(out, outputOff));\n return (inputOff += this._buffer(data, inputOff)), out;\n };\n Cipher.prototype.final = function (buffer) {\n var first;\n buffer && (first = this.update(buffer));\n var last;\n return (\n this.type === \"encrypt\" ? (last = this._finalEncrypt()) : (last = this._finalDecrypt()),\n first ? first.concat(last) : last\n );\n };\n Cipher.prototype._pad = function (buffer, off) {\n if (off === 0) return !1;\n for (; off < buffer.length; ) buffer[off++] = 0;\n return !0;\n };\n Cipher.prototype._finalEncrypt = function () {\n if (!this._pad(this.buffer, this.bufferOff)) return [];\n var out = new Array(this.blockSize);\n return this._update(this.buffer, 0, out, 0), out;\n };\n Cipher.prototype._unpad = function (buffer) {\n return buffer;\n };\n Cipher.prototype._finalDecrypt = function () {\n assert.equal(this.bufferOff, this.blockSize, \"Not enough data to decrypt\");\n var out = new Array(this.blockSize);\n return this._flushBuffer(out, 0), this._unpad(out);\n };\n },\n});\n\n// node_modules/des.js/lib/des/des.js\nvar require_des = __commonJS({\n \"node_modules/des.js/lib/des/des.js\"(exports, module) {\n \"use strict\";\n var assert = require_minimalistic_assert(),\n inherits = require_inherits_browser(),\n utils = require_utils(),\n Cipher = require_cipher();\n function DESState() {\n (this.tmp = new Array(2)), (this.keys = null);\n }\n function DES(options) {\n Cipher.call(this, options);\n var state = new DESState();\n (this._desState = state), this.deriveKeys(state, options.key);\n }\n inherits(DES, Cipher);\n module.exports = DES;\n DES.create = function (options) {\n return new DES(options);\n };\n var shiftTable = [1, 1, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 1];\n DES.prototype.deriveKeys = function (state, key) {\n (state.keys = new Array(16 * 2)), assert.equal(key.length, this.blockSize, \"Invalid key length\");\n var kL = utils.readUInt32BE(key, 0),\n kR = utils.readUInt32BE(key, 4);\n utils.pc1(kL, kR, state.tmp, 0), (kL = state.tmp[0]), (kR = state.tmp[1]);\n for (var i = 0; i < state.keys.length; i += 2) {\n var shift = shiftTable[i >>> 1];\n (kL = utils.r28shl(kL, shift)), (kR = utils.r28shl(kR, shift)), utils.pc2(kL, kR, state.keys, i);\n }\n };\n DES.prototype._update = function (inp, inOff, out, outOff) {\n var state = this._desState,\n l = utils.readUInt32BE(inp, inOff),\n r = utils.readUInt32BE(inp, inOff + 4);\n utils.ip(l, r, state.tmp, 0),\n (l = state.tmp[0]),\n (r = state.tmp[1]),\n this.type === \"encrypt\" ? this._encrypt(state, l, r, state.tmp, 0) : this._decrypt(state, l, r, state.tmp, 0),\n (l = state.tmp[0]),\n (r = state.tmp[1]),\n utils.writeUInt32BE(out, l, outOff),\n utils.writeUInt32BE(out, r, outOff + 4);\n };\n DES.prototype._pad = function (buffer, off) {\n for (var value = buffer.length - off, i = off; i < buffer.length; i++) buffer[i] = value;\n return !0;\n };\n DES.prototype._unpad = function (buffer) {\n for (var pad = buffer[buffer.length - 1], i = buffer.length - pad; i < buffer.length; i++)\n assert.equal(buffer[i], pad);\n return buffer.slice(0, buffer.length - pad);\n };\n DES.prototype._encrypt = function (state, lStart, rStart, out, off) {\n for (var l = lStart, r = rStart, i = 0; i < state.keys.length; i += 2) {\n var keyL = state.keys[i],\n keyR = state.keys[i + 1];\n utils.expand(r, state.tmp, 0), (keyL ^= state.tmp[0]), (keyR ^= state.tmp[1]);\n var s = utils.substitute(keyL, keyR),\n f = utils.permute(s),\n t = r;\n (r = (l ^ f) >>> 0), (l = t);\n }\n utils.rip(r, l, out, off);\n };\n DES.prototype._decrypt = function (state, lStart, rStart, out, off) {\n for (var l = rStart, r = lStart, i = state.keys.length - 2; i >= 0; i -= 2) {\n var keyL = state.keys[i],\n keyR = state.keys[i + 1];\n utils.expand(l, state.tmp, 0), (keyL ^= state.tmp[0]), (keyR ^= state.tmp[1]);\n var s = utils.substitute(keyL, keyR),\n f = utils.permute(s),\n t = l;\n (l = (r ^ f) >>> 0), (r = t);\n }\n utils.rip(l, r, out, off);\n };\n },\n});\n\n// node_modules/des.js/lib/des/cbc.js\nvar require_cbc = __commonJS({\n \"node_modules/des.js/lib/des/cbc.js\"(exports) {\n \"use strict\";\n var assert = require_minimalistic_assert(),\n inherits = require_inherits_browser(),\n proto = {};\n function CBCState(iv) {\n assert.equal(iv.length, 8, \"Invalid IV length\"), (this.iv = new Array(8));\n for (var i = 0; i < this.iv.length; i++) this.iv[i] = iv[i];\n }\n function instantiate(Base) {\n function CBC(options) {\n Base.call(this, options), this._cbcInit();\n }\n inherits(CBC, Base);\n for (var keys = Object.keys(proto), i = 0; i < keys.length; i++) {\n var key = keys[i];\n CBC.prototype[key] = proto[key];\n }\n return (\n (CBC.create = function (options) {\n return new CBC(options);\n }),\n CBC\n );\n }\n exports.instantiate = instantiate;\n proto._cbcInit = function () {\n var state = new CBCState(this.options.iv);\n this._cbcState = state;\n };\n proto._update = function (inp, inOff, out, outOff) {\n var state = this._cbcState,\n superProto = this.constructor.super_.prototype,\n iv = state.iv;\n if (this.type === \"encrypt\") {\n for (var i = 0; i < this.blockSize; i++) iv[i] ^= inp[inOff + i];\n superProto._update.call(this, iv, 0, out, outOff);\n for (var i = 0; i < this.blockSize; i++) iv[i] = out[outOff + i];\n } else {\n superProto._update.call(this, inp, inOff, out, outOff);\n for (var i = 0; i < this.blockSize; i++) out[outOff + i] ^= iv[i];\n for (var i = 0; i < this.blockSize; i++) iv[i] = inp[inOff + i];\n }\n };\n },\n});\n\n// node_modules/des.js/lib/des/ede.js\nvar require_ede = __commonJS({\n \"node_modules/des.js/lib/des/ede.js\"(exports, module) {\n \"use strict\";\n var assert = require_minimalistic_assert(),\n inherits = require_inherits_browser(),\n Cipher = require_cipher(),\n DES = require_des();\n function EDEState(type, key) {\n assert.equal(key.length, 24, \"Invalid key length\");\n var k1 = key.slice(0, 8),\n k2 = key.slice(8, 16),\n k3 = key.slice(16, 24);\n type === \"encrypt\"\n ? (this.ciphers = [\n DES.create({ type: \"encrypt\", key: k1 }),\n DES.create({ type: \"decrypt\", key: k2 }),\n DES.create({ type: \"encrypt\", key: k3 }),\n ])\n : (this.ciphers = [\n DES.create({ type: \"decrypt\", key: k3 }),\n DES.create({ type: \"encrypt\", key: k2 }),\n DES.create({ type: \"decrypt\", key: k1 }),\n ]);\n }\n function EDE(options) {\n Cipher.call(this, options);\n var state = new EDEState(this.type, this.options.key);\n this._edeState = state;\n }\n inherits(EDE, Cipher);\n module.exports = EDE;\n EDE.create = function (options) {\n return new EDE(options);\n };\n EDE.prototype._update = function (inp, inOff, out, outOff) {\n var state = this._edeState;\n state.ciphers[0]._update(inp, inOff, out, outOff),\n state.ciphers[1]._update(out, outOff, out, outOff),\n state.ciphers[2]._update(out, outOff, out, outOff);\n };\n EDE.prototype._pad = DES.prototype._pad;\n EDE.prototype._unpad = DES.prototype._unpad;\n },\n});\n\n// node_modules/des.js/lib/des.js\nvar require_des2 = __commonJS({\n \"node_modules/des.js/lib/des.js\"(exports) {\n \"use strict\";\n exports.utils = require_utils();\n exports.Cipher = require_cipher();\n exports.DES = require_des();\n exports.CBC = require_cbc();\n exports.EDE = require_ede();\n },\n});\n\n// node_modules/browserify-des/index.js\nvar require_browserify_des = __commonJS({\n \"node_modules/browserify-des/index.js\"(exports, module) {\n var CipherBase = require_cipher_base(),\n des = require_des2(),\n inherits = require_inherits_browser(),\n Buffer2 = require_safe_buffer().Buffer,\n modes = {\n \"des-ede3-cbc\": des.CBC.instantiate(des.EDE),\n \"des-ede3\": des.EDE,\n \"des-ede-cbc\": des.CBC.instantiate(des.EDE),\n \"des-ede\": des.EDE,\n \"des-cbc\": des.CBC.instantiate(des.DES),\n \"des-ecb\": des.DES,\n };\n modes.des = modes[\"des-cbc\"];\n modes.des3 = modes[\"des-ede3-cbc\"];\n module.exports = DES;\n inherits(DES, CipherBase);\n function DES(opts) {\n CipherBase.call(this);\n var modeName = opts.mode.toLowerCase(),\n mode = modes[modeName],\n type;\n opts.decrypt ? (type = \"decrypt\") : (type = \"encrypt\");\n var key = opts.key;\n Buffer2.isBuffer(key) || (key = Buffer2.from(key)),\n (modeName === \"des-ede\" || modeName === \"des-ede-cbc\") && (key = Buffer2.concat([key, key.slice(0, 8)]));\n var iv = opts.iv;\n Buffer2.isBuffer(iv) || (iv = Buffer2.from(iv)),\n (this._des = mode.create({\n key,\n iv,\n type,\n }));\n }\n DES.prototype._update = function (data) {\n return Buffer2.from(this._des.update(data));\n };\n DES.prototype._final = function () {\n return Buffer2.from(this._des.final());\n };\n },\n});\n\n// node_modules/browserify-aes/modes/ecb.js\nvar require_ecb = __commonJS({\n \"node_modules/browserify-aes/modes/ecb.js\"(exports) {\n exports.encrypt = function (self2, block) {\n return self2._cipher.encryptBlock(block);\n };\n exports.decrypt = function (self2, block) {\n return self2._cipher.decryptBlock(block);\n };\n },\n});\n\n// node_modules/buffer-xor/index.js\nvar require_buffer_xor = __commonJS({\n \"node_modules/buffer-xor/index.js\"(exports, module) {\n module.exports = function (a, b) {\n for (var length = Math.min(a.length, b.length), buffer = new Buffer(length), i = 0; i < length; ++i)\n buffer[i] = a[i] ^ b[i];\n return buffer;\n };\n },\n});\n\n// node_modules/browserify-aes/modes/cbc.js\nvar require_cbc2 = __commonJS({\n \"node_modules/browserify-aes/modes/cbc.js\"(exports) {\n var xor = require_buffer_xor();\n exports.encrypt = function (self2, block) {\n var data = xor(block, self2._prev);\n return (self2._prev = self2._cipher.encryptBlock(data)), self2._prev;\n };\n exports.decrypt = function (self2, block) {\n var pad = self2._prev;\n self2._prev = block;\n var out = self2._cipher.decryptBlock(block);\n return xor(out, pad);\n };\n },\n});\n\n// node_modules/browserify-aes/modes/cfb.js\nvar require_cfb = __commonJS({\n \"node_modules/browserify-aes/modes/cfb.js\"(exports) {\n var Buffer2 = require_safe_buffer().Buffer,\n xor = require_buffer_xor();\n function encryptStart(self2, data, decrypt) {\n var len = data.length,\n out = xor(data, self2._cache);\n return (\n (self2._cache = self2._cache.slice(len)),\n (self2._prev = Buffer2.concat([self2._prev, decrypt ? data : out])),\n out\n );\n }\n exports.encrypt = function (self2, data, decrypt) {\n for (var out = Buffer2.allocUnsafe(0), len; data.length; )\n if (\n (self2._cache.length === 0 &&\n ((self2._cache = self2._cipher.encryptBlock(self2._prev)), (self2._prev = Buffer2.allocUnsafe(0))),\n self2._cache.length <= data.length)\n )\n (len = self2._cache.length),\n (out = Buffer2.concat([out, encryptStart(self2, data.slice(0, len), decrypt)])),\n (data = data.slice(len));\n else {\n out = Buffer2.concat([out, encryptStart(self2, data, decrypt)]);\n break;\n }\n return out;\n };\n },\n});\n\n// node_modules/browserify-aes/modes/cfb8.js\nvar require_cfb8 = __commonJS({\n \"node_modules/browserify-aes/modes/cfb8.js\"(exports) {\n var Buffer2 = require_safe_buffer().Buffer;\n function encryptByte(self2, byteParam, decrypt) {\n var pad = self2._cipher.encryptBlock(self2._prev),\n out = pad[0] ^ byteParam;\n return (self2._prev = Buffer2.concat([self2._prev.slice(1), Buffer2.from([decrypt ? byteParam : out])])), out;\n }\n exports.encrypt = function (self2, chunk, decrypt) {\n for (var len = chunk.length, out = Buffer2.allocUnsafe(len), i = -1; ++i < len; )\n out[i] = encryptByte(self2, chunk[i], decrypt);\n return out;\n };\n },\n});\n\n// node_modules/browserify-aes/modes/cfb1.js\nvar require_cfb1 = __commonJS({\n \"node_modules/browserify-aes/modes/cfb1.js\"(exports) {\n var Buffer2 = require_safe_buffer().Buffer;\n function encryptByte(self2, byteParam, decrypt) {\n for (var pad, i = -1, len = 8, out = 0, bit, value; ++i < len; )\n (pad = self2._cipher.encryptBlock(self2._prev)),\n (bit = byteParam & (1 << (7 - i)) ? 128 : 0),\n (value = pad[0] ^ bit),\n (out += (value & 128) >> i % 8),\n (self2._prev = shiftIn(self2._prev, decrypt ? bit : value));\n return out;\n }\n function shiftIn(buffer, value) {\n var len = buffer.length,\n i = -1,\n out = Buffer2.allocUnsafe(buffer.length);\n for (buffer = Buffer2.concat([buffer, Buffer2.from([value])]); ++i < len; )\n out[i] = (buffer[i] << 1) | (buffer[i + 1] >> 7);\n return out;\n }\n exports.encrypt = function (self2, chunk, decrypt) {\n for (var len = chunk.length, out = Buffer2.allocUnsafe(len), i = -1; ++i < len; )\n out[i] = encryptByte(self2, chunk[i], decrypt);\n return out;\n };\n },\n});\n\n// node_modules/browserify-aes/modes/ofb.js\nvar require_ofb = __commonJS({\n \"node_modules/browserify-aes/modes/ofb.js\"(exports) {\n var xor = require_buffer_xor();\n function getBlock(self2) {\n return (self2._prev = self2._cipher.encryptBlock(self2._prev)), self2._prev;\n }\n exports.encrypt = function (self2, chunk) {\n for (; self2._cache.length < chunk.length; ) self2._cache = Buffer.concat([self2._cache, getBlock(self2)]);\n var pad = self2._cache.slice(0, chunk.length);\n return (self2._cache = self2._cache.slice(chunk.length)), xor(chunk, pad);\n };\n },\n});\n\n// node_modules/browserify-aes/incr32.js\nvar require_incr32 = __commonJS({\n \"node_modules/browserify-aes/incr32.js\"(exports, module) {\n function incr32(iv) {\n for (var len = iv.length, item; len--; )\n if (((item = iv.readUInt8(len)), item === 255)) iv.writeUInt8(0, len);\n else {\n item++, iv.writeUInt8(item, len);\n break;\n }\n }\n module.exports = incr32;\n },\n});\n\n// node_modules/browserify-aes/modes/ctr.js\nvar require_ctr = __commonJS({\n \"node_modules/browserify-aes/modes/ctr.js\"(exports) {\n var xor = require_buffer_xor(),\n Buffer2 = require_safe_buffer().Buffer,\n incr32 = require_incr32();\n function getBlock(self2) {\n var out = self2._cipher.encryptBlockRaw(self2._prev);\n return incr32(self2._prev), out;\n }\n var blockSize = 16;\n exports.encrypt = function (self2, chunk) {\n var chunkNum = Math.ceil(chunk.length / blockSize),\n start = self2._cache.length;\n self2._cache = Buffer2.concat([self2._cache, Buffer2.allocUnsafe(chunkNum * blockSize)]);\n for (var i = 0; i < chunkNum; i++) {\n var out = getBlock(self2),\n offset = start + i * blockSize;\n self2._cache.writeUInt32BE(out[0], offset + 0),\n self2._cache.writeUInt32BE(out[1], offset + 4),\n self2._cache.writeUInt32BE(out[2], offset + 8),\n self2._cache.writeUInt32BE(out[3], offset + 12);\n }\n var pad = self2._cache.slice(0, chunk.length);\n return (self2._cache = self2._cache.slice(chunk.length)), xor(chunk, pad);\n };\n },\n});\n\n// node_modules/browserify-aes/modes/list.json\nvar require_list = __commonJS({\n \"node_modules/browserify-aes/modes/list.json\"(exports, module) {\n module.exports = {\n \"aes-128-ecb\": {\n cipher: \"AES\",\n key: 128,\n iv: 0,\n mode: \"ECB\",\n type: \"block\",\n },\n \"aes-192-ecb\": {\n cipher: \"AES\",\n key: 192,\n iv: 0,\n mode: \"ECB\",\n type: \"block\",\n },\n \"aes-256-ecb\": {\n cipher: \"AES\",\n key: 256,\n iv: 0,\n mode: \"ECB\",\n type: \"block\",\n },\n \"aes-128-cbc\": {\n cipher: \"AES\",\n key: 128,\n iv: 16,\n mode: \"CBC\",\n type: \"block\",\n },\n \"aes-192-cbc\": {\n cipher: \"AES\",\n key: 192,\n iv: 16,\n mode: \"CBC\",\n type: \"block\",\n },\n \"aes-256-cbc\": {\n cipher: \"AES\",\n key: 256,\n iv: 16,\n mode: \"CBC\",\n type: \"block\",\n },\n aes128: {\n cipher: \"AES\",\n key: 128,\n iv: 16,\n mode: \"CBC\",\n type: \"block\",\n },\n aes192: {\n cipher: \"AES\",\n key: 192,\n iv: 16,\n mode: \"CBC\",\n type: \"block\",\n },\n aes256: {\n cipher: \"AES\",\n key: 256,\n iv: 16,\n mode: \"CBC\",\n type: \"block\",\n },\n \"aes-128-cfb\": {\n cipher: \"AES\",\n key: 128,\n iv: 16,\n mode: \"CFB\",\n type: \"stream\",\n },\n \"aes-192-cfb\": {\n cipher: \"AES\",\n key: 192,\n iv: 16,\n mode: \"CFB\",\n type: \"stream\",\n },\n \"aes-256-cfb\": {\n cipher: \"AES\",\n key: 256,\n iv: 16,\n mode: \"CFB\",\n type: \"stream\",\n },\n \"aes-128-cfb8\": {\n cipher: \"AES\",\n key: 128,\n iv: 16,\n mode: \"CFB8\",\n type: \"stream\",\n },\n \"aes-192-cfb8\": {\n cipher: \"AES\",\n key: 192,\n iv: 16,\n mode: \"CFB8\",\n type: \"stream\",\n },\n \"aes-256-cfb8\": {\n cipher: \"AES\",\n key: 256,\n iv: 16,\n mode: \"CFB8\",\n type: \"stream\",\n },\n \"aes-128-cfb1\": {\n cipher: \"AES\",\n key: 128,\n iv: 16,\n mode: \"CFB1\",\n type: \"stream\",\n },\n \"aes-192-cfb1\": {\n cipher: \"AES\",\n key: 192,\n iv: 16,\n mode: \"CFB1\",\n type: \"stream\",\n },\n \"aes-256-cfb1\": {\n cipher: \"AES\",\n key: 256,\n iv: 16,\n mode: \"CFB1\",\n type: \"stream\",\n },\n \"aes-128-ofb\": {\n cipher: \"AES\",\n key: 128,\n iv: 16,\n mode: \"OFB\",\n type: \"stream\",\n },\n \"aes-192-ofb\": {\n cipher: \"AES\",\n key: 192,\n iv: 16,\n mode: \"OFB\",\n type: \"stream\",\n },\n \"aes-256-ofb\": {\n cipher: \"AES\",\n key: 256,\n iv: 16,\n mode: \"OFB\",\n type: \"stream\",\n },\n \"aes-128-ctr\": {\n cipher: \"AES\",\n key: 128,\n iv: 16,\n mode: \"CTR\",\n type: \"stream\",\n },\n \"aes-192-ctr\": {\n cipher: \"AES\",\n key: 192,\n iv: 16,\n mode: \"CTR\",\n type: \"stream\",\n },\n \"aes-256-ctr\": {\n cipher: \"AES\",\n key: 256,\n iv: 16,\n mode: \"CTR\",\n type: \"stream\",\n },\n \"aes-128-gcm\": {\n cipher: \"AES\",\n key: 128,\n iv: 12,\n mode: \"GCM\",\n type: \"auth\",\n },\n \"aes-192-gcm\": {\n cipher: \"AES\",\n key: 192,\n iv: 12,\n mode: \"GCM\",\n type: \"auth\",\n },\n \"aes-256-gcm\": {\n cipher: \"AES\",\n key: 256,\n iv: 12,\n mode: \"GCM\",\n type: \"auth\",\n },\n };\n },\n});\n\n// node_modules/browserify-aes/modes/index.js\nvar require_modes = __commonJS({\n \"node_modules/browserify-aes/modes/index.js\"(exports, module) {\n var modeModules = {\n ECB: require_ecb(),\n CBC: require_cbc2(),\n CFB: require_cfb(),\n CFB8: require_cfb8(),\n CFB1: require_cfb1(),\n OFB: require_ofb(),\n CTR: require_ctr(),\n GCM: require_ctr(),\n },\n modes = require_list();\n for (key in modes) modes[key].module = modeModules[modes[key].mode];\n var key;\n module.exports = modes;\n },\n});\n\n// node_modules/browserify-aes/aes.js\nvar require_aes = __commonJS({\n \"node_modules/browserify-aes/aes.js\"(exports, module) {\n var Buffer2 = require_safe_buffer().Buffer;\n function asUInt32Array(buf) {\n Buffer2.isBuffer(buf) || (buf = Buffer2.from(buf));\n for (var len = (buf.length / 4) | 0, out = new Array(len), i = 0; i < len; i++) out[i] = buf.readUInt32BE(i * 4);\n return out;\n }\n function scrubVec(v) {\n for (var i = 0; i < v.length; v++) v[i] = 0;\n }\n function cryptBlock(M, keySchedule, SUB_MIX, SBOX, nRounds) {\n for (\n var SUB_MIX0 = SUB_MIX[0],\n SUB_MIX1 = SUB_MIX[1],\n SUB_MIX2 = SUB_MIX[2],\n SUB_MIX3 = SUB_MIX[3],\n s0 = M[0] ^ keySchedule[0],\n s1 = M[1] ^ keySchedule[1],\n s2 = M[2] ^ keySchedule[2],\n s3 = M[3] ^ keySchedule[3],\n t0,\n t1,\n t2,\n t3,\n ksRow = 4,\n round = 1;\n round < nRounds;\n round++\n )\n (t0 =\n SUB_MIX0[s0 >>> 24] ^\n SUB_MIX1[(s1 >>> 16) & 255] ^\n SUB_MIX2[(s2 >>> 8) & 255] ^\n SUB_MIX3[s3 & 255] ^\n keySchedule[ksRow++]),\n (t1 =\n SUB_MIX0[s1 >>> 24] ^\n SUB_MIX1[(s2 >>> 16) & 255] ^\n SUB_MIX2[(s3 >>> 8) & 255] ^\n SUB_MIX3[s0 & 255] ^\n keySchedule[ksRow++]),\n (t2 =\n SUB_MIX0[s2 >>> 24] ^\n SUB_MIX1[(s3 >>> 16) & 255] ^\n SUB_MIX2[(s0 >>> 8) & 255] ^\n SUB_MIX3[s1 & 255] ^\n keySchedule[ksRow++]),\n (t3 =\n SUB_MIX0[s3 >>> 24] ^\n SUB_MIX1[(s0 >>> 16) & 255] ^\n SUB_MIX2[(s1 >>> 8) & 255] ^\n SUB_MIX3[s2 & 255] ^\n keySchedule[ksRow++]),\n (s0 = t0),\n (s1 = t1),\n (s2 = t2),\n (s3 = t3);\n return (\n (t0 =\n ((SBOX[s0 >>> 24] << 24) | (SBOX[(s1 >>> 16) & 255] << 16) | (SBOX[(s2 >>> 8) & 255] << 8) | SBOX[s3 & 255]) ^\n keySchedule[ksRow++]),\n (t1 =\n ((SBOX[s1 >>> 24] << 24) | (SBOX[(s2 >>> 16) & 255] << 16) | (SBOX[(s3 >>> 8) & 255] << 8) | SBOX[s0 & 255]) ^\n keySchedule[ksRow++]),\n (t2 =\n ((SBOX[s2 >>> 24] << 24) | (SBOX[(s3 >>> 16) & 255] << 16) | (SBOX[(s0 >>> 8) & 255] << 8) | SBOX[s1 & 255]) ^\n keySchedule[ksRow++]),\n (t3 =\n ((SBOX[s3 >>> 24] << 24) | (SBOX[(s0 >>> 16) & 255] << 16) | (SBOX[(s1 >>> 8) & 255] << 8) | SBOX[s2 & 255]) ^\n keySchedule[ksRow++]),\n (t0 = t0 >>> 0),\n (t1 = t1 >>> 0),\n (t2 = t2 >>> 0),\n (t3 = t3 >>> 0),\n [t0, t1, t2, t3]\n );\n }\n var RCON = [0, 1, 2, 4, 8, 16, 32, 64, 128, 27, 54],\n G = (function () {\n for (var d = new Array(256), j = 0; j < 256; j++) j < 128 ? (d[j] = j << 1) : (d[j] = (j << 1) ^ 283);\n for (\n var SBOX = [],\n INV_SBOX = [],\n SUB_MIX = [[], [], [], []],\n INV_SUB_MIX = [[], [], [], []],\n x = 0,\n xi = 0,\n i = 0;\n i < 256;\n ++i\n ) {\n var sx = xi ^ (xi << 1) ^ (xi << 2) ^ (xi << 3) ^ (xi << 4);\n (sx = (sx >>> 8) ^ (sx & 255) ^ 99), (SBOX[x] = sx), (INV_SBOX[sx] = x);\n var x2 = d[x],\n x4 = d[x2],\n x8 = d[x4],\n t = (d[sx] * 257) ^ (sx * 16843008);\n (SUB_MIX[0][x] = (t << 24) | (t >>> 8)),\n (SUB_MIX[1][x] = (t << 16) | (t >>> 16)),\n (SUB_MIX[2][x] = (t << 8) | (t >>> 24)),\n (SUB_MIX[3][x] = t),\n (t = (x8 * 16843009) ^ (x4 * 65537) ^ (x2 * 257) ^ (x * 16843008)),\n (INV_SUB_MIX[0][sx] = (t << 24) | (t >>> 8)),\n (INV_SUB_MIX[1][sx] = (t << 16) | (t >>> 16)),\n (INV_SUB_MIX[2][sx] = (t << 8) | (t >>> 24)),\n (INV_SUB_MIX[3][sx] = t),\n x === 0 ? (x = xi = 1) : ((x = x2 ^ d[d[d[x8 ^ x2]]]), (xi ^= d[d[xi]]));\n }\n return {\n SBOX,\n INV_SBOX,\n SUB_MIX,\n INV_SUB_MIX,\n };\n })();\n function AES(key) {\n (this._key = asUInt32Array(key)), this._reset();\n }\n AES.blockSize = 4 * 4;\n AES.keySize = 256 / 8;\n AES.prototype.blockSize = AES.blockSize;\n AES.prototype.keySize = AES.keySize;\n AES.prototype._reset = function () {\n for (\n var keyWords = this._key,\n keySize = keyWords.length,\n nRounds = keySize + 6,\n ksRows = (nRounds + 1) * 4,\n keySchedule = [],\n k = 0;\n k < keySize;\n k++\n )\n keySchedule[k] = keyWords[k];\n for (k = keySize; k < ksRows; k++) {\n var t = keySchedule[k - 1];\n k % keySize === 0\n ? ((t = (t << 8) | (t >>> 24)),\n (t =\n (G.SBOX[t >>> 24] << 24) |\n (G.SBOX[(t >>> 16) & 255] << 16) |\n (G.SBOX[(t >>> 8) & 255] << 8) |\n G.SBOX[t & 255]),\n (t ^= RCON[(k / keySize) | 0] << 24))\n : keySize > 6 &&\n k % keySize === 4 &&\n (t =\n (G.SBOX[t >>> 24] << 24) |\n (G.SBOX[(t >>> 16) & 255] << 16) |\n (G.SBOX[(t >>> 8) & 255] << 8) |\n G.SBOX[t & 255]),\n (keySchedule[k] = keySchedule[k - keySize] ^ t);\n }\n for (var invKeySchedule = [], ik = 0; ik < ksRows; ik++) {\n var ksR = ksRows - ik,\n tt = keySchedule[ksR - (ik % 4 ? 0 : 4)];\n ik < 4 || ksR <= 4\n ? (invKeySchedule[ik] = tt)\n : (invKeySchedule[ik] =\n G.INV_SUB_MIX[0][G.SBOX[tt >>> 24]] ^\n G.INV_SUB_MIX[1][G.SBOX[(tt >>> 16) & 255]] ^\n G.INV_SUB_MIX[2][G.SBOX[(tt >>> 8) & 255]] ^\n G.INV_SUB_MIX[3][G.SBOX[tt & 255]]);\n }\n (this._nRounds = nRounds), (this._keySchedule = keySchedule), (this._invKeySchedule = invKeySchedule);\n };\n AES.prototype.encryptBlockRaw = function (M) {\n return (M = asUInt32Array(M)), cryptBlock(M, this._keySchedule, G.SUB_MIX, G.SBOX, this._nRounds);\n };\n AES.prototype.encryptBlock = function (M) {\n var out = this.encryptBlockRaw(M),\n buf = Buffer2.allocUnsafe(16);\n return (\n buf.writeUInt32BE(out[0], 0),\n buf.writeUInt32BE(out[1], 4),\n buf.writeUInt32BE(out[2], 8),\n buf.writeUInt32BE(out[3], 12),\n buf\n );\n };\n AES.prototype.decryptBlock = function (M) {\n M = asUInt32Array(M);\n var m1 = M[1];\n (M[1] = M[3]), (M[3] = m1);\n var out = cryptBlock(M, this._invKeySchedule, G.INV_SUB_MIX, G.INV_SBOX, this._nRounds),\n buf = Buffer2.allocUnsafe(16);\n return (\n buf.writeUInt32BE(out[0], 0),\n buf.writeUInt32BE(out[3], 4),\n buf.writeUInt32BE(out[2], 8),\n buf.writeUInt32BE(out[1], 12),\n buf\n );\n };\n AES.prototype.scrub = function () {\n scrubVec(this._keySchedule), scrubVec(this._invKeySchedule), scrubVec(this._key);\n };\n module.exports.AES = AES;\n },\n});\n\n// node_modules/browserify-aes/ghash.js\nvar require_ghash = __commonJS({\n \"node_modules/browserify-aes/ghash.js\"(exports, module) {\n var Buffer2 = require_safe_buffer().Buffer,\n ZEROES = Buffer2.alloc(16, 0);\n function toArray(buf) {\n return [buf.readUInt32BE(0), buf.readUInt32BE(4), buf.readUInt32BE(8), buf.readUInt32BE(12)];\n }\n function fromArray(out) {\n var buf = Buffer2.allocUnsafe(16);\n return (\n buf.writeUInt32BE(out[0] >>> 0, 0),\n buf.writeUInt32BE(out[1] >>> 0, 4),\n buf.writeUInt32BE(out[2] >>> 0, 8),\n buf.writeUInt32BE(out[3] >>> 0, 12),\n buf\n );\n }\n function GHASH(key) {\n (this.h = key), (this.state = Buffer2.alloc(16, 0)), (this.cache = Buffer2.allocUnsafe(0));\n }\n GHASH.prototype.ghash = function (block) {\n for (var i = -1; ++i < block.length; ) this.state[i] ^= block[i];\n this._multiply();\n };\n GHASH.prototype._multiply = function () {\n for (var Vi = toArray(this.h), Zi = [0, 0, 0, 0], j, xi, lsbVi, i = -1; ++i < 128; ) {\n for (\n xi = (this.state[~~(i / 8)] & (1 << (7 - (i % 8)))) !== 0,\n xi && ((Zi[0] ^= Vi[0]), (Zi[1] ^= Vi[1]), (Zi[2] ^= Vi[2]), (Zi[3] ^= Vi[3])),\n lsbVi = (Vi[3] & 1) !== 0,\n j = 3;\n j > 0;\n j--\n )\n Vi[j] = (Vi[j] >>> 1) | ((Vi[j - 1] & 1) << 31);\n (Vi[0] = Vi[0] >>> 1), lsbVi && (Vi[0] = Vi[0] ^ (225 << 24));\n }\n this.state = fromArray(Zi);\n };\n GHASH.prototype.update = function (buf) {\n this.cache = Buffer2.concat([this.cache, buf]);\n for (var chunk; this.cache.length >= 16; )\n (chunk = this.cache.slice(0, 16)), (this.cache = this.cache.slice(16)), this.ghash(chunk);\n };\n GHASH.prototype.final = function (abl, bl) {\n return (\n this.cache.length && this.ghash(Buffer2.concat([this.cache, ZEROES], 16)),\n this.ghash(fromArray([0, abl, 0, bl])),\n this.state\n );\n };\n module.exports = GHASH;\n },\n});\n\n// node_modules/browserify-aes/authCipher.js\nvar require_authCipher = __commonJS({\n \"node_modules/browserify-aes/authCipher.js\"(exports, module) {\n var aes = require_aes(),\n Buffer2 = require_safe_buffer().Buffer,\n Transform = require_cipher_base(),\n inherits = require_inherits_browser(),\n GHASH = require_ghash(),\n xor = require_buffer_xor(),\n incr32 = require_incr32();\n function xorTest(a, b) {\n var out = 0;\n a.length !== b.length && out++;\n for (var len = Math.min(a.length, b.length), i = 0; i < len; ++i) out += a[i] ^ b[i];\n return out;\n }\n function calcIv(self2, iv, ck) {\n if (iv.length === 12)\n return (\n (self2._finID = Buffer2.concat([iv, Buffer2.from([0, 0, 0, 1])])),\n Buffer2.concat([iv, Buffer2.from([0, 0, 0, 2])])\n );\n var ghash = new GHASH(ck),\n len = iv.length,\n toPad = len % 16;\n ghash.update(iv),\n toPad && ((toPad = 16 - toPad), ghash.update(Buffer2.alloc(toPad, 0))),\n ghash.update(Buffer2.alloc(8, 0));\n var ivBits = len * 8,\n tail = Buffer2.alloc(8);\n tail.writeUIntBE(ivBits, 0, 8), ghash.update(tail), (self2._finID = ghash.state);\n var out = Buffer2.from(self2._finID);\n return incr32(out), out;\n }\n function StreamCipher(mode, key, iv, decrypt) {\n Transform.call(this);\n var h = Buffer2.alloc(4, 0);\n this._cipher = new aes.AES(key);\n var ck = this._cipher.encryptBlock(h);\n (this._ghash = new GHASH(ck)),\n (iv = calcIv(this, iv, ck)),\n (this._prev = Buffer2.from(iv)),\n (this._cache = Buffer2.allocUnsafe(0)),\n (this._secCache = Buffer2.allocUnsafe(0)),\n (this._decrypt = decrypt),\n (this._alen = 0),\n (this._len = 0),\n (this._mode = mode),\n (this._authTag = null),\n (this._called = !1);\n }\n inherits(StreamCipher, Transform);\n StreamCipher.prototype._update = function (chunk) {\n if (!this._called && this._alen) {\n var rump = 16 - (this._alen % 16);\n rump < 16 && ((rump = Buffer2.alloc(rump, 0)), this._ghash.update(rump));\n }\n this._called = !0;\n var out = this._mode.encrypt(this, chunk);\n return this._decrypt ? this._ghash.update(chunk) : this._ghash.update(out), (this._len += chunk.length), out;\n };\n StreamCipher.prototype._final = function () {\n if (this._decrypt && !this._authTag) throw new Error(\"Unsupported state or unable to authenticate data\");\n var tag = xor(this._ghash.final(this._alen * 8, this._len * 8), this._cipher.encryptBlock(this._finID));\n if (this._decrypt && xorTest(tag, this._authTag))\n throw new Error(\"Unsupported state or unable to authenticate data\");\n (this._authTag = tag), this._cipher.scrub();\n };\n StreamCipher.prototype.getAuthTag = function () {\n if (this._decrypt || !Buffer2.isBuffer(this._authTag))\n throw new Error(\"Attempting to get auth tag in unsupported state\");\n return this._authTag;\n };\n StreamCipher.prototype.setAuthTag = function (tag) {\n if (!this._decrypt) throw new Error(\"Attempting to set auth tag in unsupported state\");\n this._authTag = tag;\n };\n StreamCipher.prototype.setAAD = function (buf) {\n if (this._called) throw new Error(\"Attempting to set AAD in unsupported state\");\n this._ghash.update(buf), (this._alen += buf.length);\n };\n module.exports = StreamCipher;\n },\n});\n\n// node_modules/browserify-aes/streamCipher.js\nvar require_streamCipher = __commonJS({\n \"node_modules/browserify-aes/streamCipher.js\"(exports, module) {\n var aes = require_aes(),\n Buffer2 = require_safe_buffer().Buffer,\n Transform = require_cipher_base(),\n inherits = require_inherits_browser();\n function StreamCipher(mode, key, iv, decrypt) {\n Transform.call(this),\n (this._cipher = new aes.AES(key)),\n (this._prev = Buffer2.from(iv)),\n (this._cache = Buffer2.allocUnsafe(0)),\n (this._secCache = Buffer2.allocUnsafe(0)),\n (this._decrypt = decrypt),\n (this._mode = mode);\n }\n inherits(StreamCipher, Transform);\n StreamCipher.prototype._update = function (chunk) {\n return this._mode.encrypt(this, chunk, this._decrypt);\n };\n StreamCipher.prototype._final = function () {\n this._cipher.scrub();\n };\n module.exports = StreamCipher;\n },\n});\n\n// node_modules/evp_bytestokey/index.js\nvar require_evp_bytestokey = __commonJS({\n \"node_modules/evp_bytestokey/index.js\"(exports, module) {\n var Buffer2 = require_safe_buffer().Buffer,\n MD5 = require_md5();\n function EVP_BytesToKey(password, salt, keyBits, ivLen) {\n if (\n (Buffer2.isBuffer(password) || (password = Buffer2.from(password, \"binary\")),\n salt && (Buffer2.isBuffer(salt) || (salt = Buffer2.from(salt, \"binary\")), salt.length !== 8))\n )\n throw new RangeError(\"salt should be Buffer with 8 byte length\");\n for (\n var keyLen = keyBits / 8, key = Buffer2.alloc(keyLen), iv = Buffer2.alloc(ivLen || 0), tmp = Buffer2.alloc(0);\n keyLen > 0 || ivLen > 0;\n\n ) {\n var hash = new MD5();\n hash.update(tmp), hash.update(password), salt && hash.update(salt), (tmp = hash.digest());\n var used = 0;\n if (keyLen > 0) {\n var keyStart = key.length - keyLen;\n (used = Math.min(keyLen, tmp.length)), tmp.copy(key, keyStart, 0, used), (keyLen -= used);\n }\n if (used < tmp.length && ivLen > 0) {\n var ivStart = iv.length - ivLen,\n length = Math.min(ivLen, tmp.length - used);\n tmp.copy(iv, ivStart, used, used + length), (ivLen -= length);\n }\n }\n return tmp.fill(0), { key, iv };\n }\n module.exports = EVP_BytesToKey;\n },\n});\n\n// node_modules/browserify-aes/encrypter.js\nvar require_encrypter = __commonJS({\n \"node_modules/browserify-aes/encrypter.js\"(exports) {\n var MODES = require_modes(),\n AuthCipher = require_authCipher(),\n Buffer2 = require_safe_buffer().Buffer,\n StreamCipher = require_streamCipher(),\n Transform = require_cipher_base(),\n aes = require_aes(),\n ebtk = require_evp_bytestokey(),\n inherits = require_inherits_browser();\n function Cipher(mode, key, iv) {\n Transform.call(this),\n (this._cache = new Splitter()),\n (this._cipher = new aes.AES(key)),\n (this._prev = Buffer2.from(iv)),\n (this._mode = mode),\n (this._autopadding = !0);\n }\n inherits(Cipher, Transform);\n Cipher.prototype._update = function (data) {\n this._cache.add(data);\n for (var chunk, thing, out = []; (chunk = this._cache.get()); )\n (thing = this._mode.encrypt(this, chunk)), out.push(thing);\n return Buffer2.concat(out);\n };\n var PADDING = Buffer2.alloc(16, 16);\n Cipher.prototype._final = function () {\n var chunk = this._cache.flush();\n if (this._autopadding) return (chunk = this._mode.encrypt(this, chunk)), this._cipher.scrub(), chunk;\n if (!chunk.equals(PADDING)) throw (this._cipher.scrub(), new Error(\"data not multiple of block length\"));\n };\n Cipher.prototype.setAutoPadding = function (setTo) {\n return (this._autopadding = !!setTo), this;\n };\n function Splitter() {\n this.cache = Buffer2.allocUnsafe(0);\n }\n Splitter.prototype.add = function (data) {\n this.cache = Buffer2.concat([this.cache, data]);\n };\n Splitter.prototype.get = function () {\n if (this.cache.length > 15) {\n var out = this.cache.slice(0, 16);\n return (this.cache = this.cache.slice(16)), out;\n }\n return null;\n };\n Splitter.prototype.flush = function () {\n for (var len = 16 - this.cache.length, padBuff = Buffer2.allocUnsafe(len), i = -1; ++i < len; )\n padBuff.writeUInt8(len, i);\n return Buffer2.concat([this.cache, padBuff]);\n };\n function createCipheriv(suite, password, iv) {\n var config = MODES[suite.toLowerCase()];\n if (!config) throw new TypeError(\"invalid suite type\");\n if ((typeof password == \"string\" && (password = Buffer2.from(password)), password.length !== config.key / 8))\n throw new TypeError(\"invalid key length \" + password.length);\n if ((typeof iv == \"string\" && (iv = Buffer2.from(iv)), config.mode !== \"GCM\" && iv.length !== config.iv))\n throw new TypeError(\"invalid iv length \" + iv.length);\n return config.type === \"stream\"\n ? new StreamCipher(config.module, password, iv)\n : config.type === \"auth\"\n ? new AuthCipher(config.module, password, iv)\n : new Cipher(config.module, password, iv);\n }\n function createCipher(suite, password) {\n var config = MODES[suite.toLowerCase()];\n if (!config) throw new TypeError(\"invalid suite type\");\n var keys = ebtk(password, !1, config.key, config.iv);\n return createCipheriv(suite, keys.key, keys.iv);\n }\n exports.createCipheriv = createCipheriv;\n exports.createCipher = createCipher;\n },\n});\n\n// node_modules/browserify-aes/decrypter.js\nvar require_decrypter = __commonJS({\n \"node_modules/browserify-aes/decrypter.js\"(exports) {\n var AuthCipher = require_authCipher(),\n Buffer2 = require_safe_buffer().Buffer,\n MODES = require_modes(),\n StreamCipher = require_streamCipher(),\n Transform = require_cipher_base(),\n aes = require_aes(),\n ebtk = require_evp_bytestokey(),\n inherits = require_inherits_browser();\n function Decipher(mode, key, iv) {\n Transform.call(this),\n (this._cache = new Splitter()),\n (this._last = void 0),\n (this._cipher = new aes.AES(key)),\n (this._prev = Buffer2.from(iv)),\n (this._mode = mode),\n (this._autopadding = !0);\n }\n inherits(Decipher, Transform);\n Decipher.prototype._update = function (data) {\n this._cache.add(data);\n for (var chunk, thing, out = []; (chunk = this._cache.get(this._autopadding)); )\n (thing = this._mode.decrypt(this, chunk)), out.push(thing);\n return Buffer2.concat(out);\n };\n Decipher.prototype._final = function () {\n var chunk = this._cache.flush();\n if (this._autopadding) return unpad(this._mode.decrypt(this, chunk));\n if (chunk) throw new Error(\"data not multiple of block length\");\n };\n Decipher.prototype.setAutoPadding = function (setTo) {\n return (this._autopadding = !!setTo), this;\n };\n function Splitter() {\n this.cache = Buffer2.allocUnsafe(0);\n }\n Splitter.prototype.add = function (data) {\n this.cache = Buffer2.concat([this.cache, data]);\n };\n Splitter.prototype.get = function (autoPadding) {\n var out;\n if (autoPadding) {\n if (this.cache.length > 16) return (out = this.cache.slice(0, 16)), (this.cache = this.cache.slice(16)), out;\n } else if (this.cache.length >= 16)\n return (out = this.cache.slice(0, 16)), (this.cache = this.cache.slice(16)), out;\n return null;\n };\n Splitter.prototype.flush = function () {\n if (this.cache.length) return this.cache;\n };\n function unpad(last) {\n var padded = last[15];\n if (padded < 1 || padded > 16) throw new Error(\"unable to decrypt data\");\n for (var i = -1; ++i < padded; )\n if (last[i + (16 - padded)] !== padded) throw new Error(\"unable to decrypt data\");\n if (padded !== 16) return last.slice(0, 16 - padded);\n }\n function createDecipheriv(suite, password, iv) {\n var config = MODES[suite.toLowerCase()];\n if (!config) throw new TypeError(\"invalid suite type\");\n if ((typeof iv == \"string\" && (iv = Buffer2.from(iv)), config.mode !== \"GCM\" && iv.length !== config.iv))\n throw new TypeError(\"invalid iv length \" + iv.length);\n if ((typeof password == \"string\" && (password = Buffer2.from(password)), password.length !== config.key / 8))\n throw new TypeError(\"invalid key length \" + password.length);\n return config.type === \"stream\"\n ? new StreamCipher(config.module, password, iv, !0)\n : config.type === \"auth\"\n ? new AuthCipher(config.module, password, iv, !0)\n : new Decipher(config.module, password, iv);\n }\n function createDecipher(suite, password) {\n var config = MODES[suite.toLowerCase()];\n if (!config) throw new TypeError(\"invalid suite type\");\n var keys = ebtk(password, !1, config.key, config.iv);\n return createDecipheriv(suite, keys.key, keys.iv);\n }\n exports.createDecipher = createDecipher;\n exports.createDecipheriv = createDecipheriv;\n },\n});\n\n// node_modules/browserify-aes/browser.js\nvar require_browser5 = __commonJS({\n \"node_modules/browserify-aes/browser.js\"(exports) {\n var ciphers = require_encrypter(),\n deciphers = require_decrypter(),\n modes = require_list();\n function getCiphers() {\n return Object.keys(modes);\n }\n exports.createCipher = exports.Cipher = ciphers.createCipher;\n exports.createCipheriv = exports.Cipheriv = ciphers.createCipheriv;\n exports.createDecipher = exports.Decipher = deciphers.createDecipher;\n exports.createDecipheriv = exports.Decipheriv = deciphers.createDecipheriv;\n exports.listCiphers = exports.getCiphers = getCiphers;\n },\n});\n\n// node_modules/browserify-des/modes.js\nvar require_modes2 = __commonJS({\n \"node_modules/browserify-des/modes.js\"(exports) {\n exports[\"des-ecb\"] = {\n key: 8,\n iv: 0,\n };\n exports[\"des-cbc\"] = exports.des = {\n key: 8,\n iv: 8,\n };\n exports[\"des-ede3-cbc\"] = exports.des3 = {\n key: 24,\n iv: 8,\n };\n exports[\"des-ede3\"] = {\n key: 24,\n iv: 0,\n };\n exports[\"des-ede-cbc\"] = {\n key: 16,\n iv: 8,\n };\n exports[\"des-ede\"] = {\n key: 16,\n iv: 0,\n };\n },\n});\n\n// node_modules/browserify-cipher/browser.js\nvar require_browser6 = __commonJS({\n \"node_modules/browserify-cipher/browser.js\"(exports) {\n var DES = require_browserify_des(),\n aes = require_browser5(),\n aesModes = require_modes(),\n desModes = require_modes2(),\n ebtk = require_evp_bytestokey();\n function createCipher(suite, password) {\n suite = suite.toLowerCase();\n var keyLen, ivLen;\n if (aesModes[suite]) (keyLen = aesModes[suite].key), (ivLen = aesModes[suite].iv);\n else if (desModes[suite]) (keyLen = desModes[suite].key * 8), (ivLen = desModes[suite].iv);\n else throw new TypeError(\"invalid suite type\");\n var keys = ebtk(password, !1, keyLen, ivLen);\n return createCipheriv(suite, keys.key, keys.iv);\n }\n function createDecipher(suite, password) {\n suite = suite.toLowerCase();\n var keyLen, ivLen;\n if (aesModes[suite]) (keyLen = aesModes[suite].key), (ivLen = aesModes[suite].iv);\n else if (desModes[suite]) (keyLen = desModes[suite].key * 8), (ivLen = desModes[suite].iv);\n else throw new TypeError(\"invalid suite type\");\n var keys = ebtk(password, !1, keyLen, ivLen);\n return createDecipheriv(suite, keys.key, keys.iv);\n }\n function createCipheriv(suite, key, iv) {\n if (((suite = suite.toLowerCase()), aesModes[suite])) return aes.createCipheriv(suite, key, iv);\n if (desModes[suite]) return new DES({ key, iv, mode: suite });\n throw new TypeError(\"invalid suite type\");\n }\n function createDecipheriv(suite, key, iv) {\n if (((suite = suite.toLowerCase()), aesModes[suite])) return aes.createDecipheriv(suite, key, iv);\n if (desModes[suite]) return new DES({ key, iv, mode: suite, decrypt: !0 });\n throw new TypeError(\"invalid suite type\");\n }\n function getCiphers() {\n return Object.keys(desModes).concat(aes.getCiphers());\n }\n exports.createCipher = exports.Cipher = createCipher;\n exports.createCipheriv = exports.Cipheriv = createCipheriv;\n exports.createDecipher = exports.Decipher = createDecipher;\n exports.createDecipheriv = exports.Decipheriv = createDecipheriv;\n exports.listCiphers = exports.getCiphers = getCiphers;\n },\n});\n\n// node_modules/diffie-hellman/node_modules/bn.js/lib/bn.js\nvar require_bn = __commonJS({\n \"node_modules/diffie-hellman/node_modules/bn.js/lib/bn.js\"(exports, module) {\n (function (module2, exports2) {\n \"use strict\";\n function assert(val, msg) {\n if (!val) throw new Error(msg || \"Assertion failed\");\n }\n function inherits(ctor, superCtor) {\n ctor.super_ = superCtor;\n var TempCtor = function () {};\n (TempCtor.prototype = superCtor.prototype),\n (ctor.prototype = new TempCtor()),\n (ctor.prototype.constructor = ctor);\n }\n function BN(number, base, endian) {\n if (BN.isBN(number)) return number;\n (this.negative = 0),\n (this.words = null),\n (this.length = 0),\n (this.red = null),\n number !== null &&\n ((base === \"le\" || base === \"be\") && ((endian = base), (base = 10)),\n this._init(number || 0, base || 10, endian || \"be\"));\n }\n typeof module2 == \"object\" ? (module2.exports = BN) : (exports2.BN = BN), (BN.BN = BN), (BN.wordSize = 26);\n var Buffer2;\n try {\n typeof window < \"u\" && typeof window.Buffer < \"u\"\n ? (Buffer2 = window.Buffer)\n : (Buffer2 = __require(\"buffer\").Buffer);\n } catch {}\n (BN.isBN = function (num) {\n return num instanceof BN\n ? !0\n : num !== null &&\n typeof num == \"object\" &&\n num.constructor.wordSize === BN.wordSize &&\n Array.isArray(num.words);\n }),\n (BN.max = function (left, right) {\n return left.cmp(right) > 0 ? left : right;\n }),\n (BN.min = function (left, right) {\n return left.cmp(right) < 0 ? left : right;\n }),\n (BN.prototype._init = function (number, base, endian) {\n if (typeof number == \"number\") return this._initNumber(number, base, endian);\n if (typeof number == \"object\") return this._initArray(number, base, endian);\n base === \"hex\" && (base = 16),\n assert(base === (base | 0) && base >= 2 && base <= 36),\n (number = number.toString().replace(/\\s+/g, \"\"));\n var start = 0;\n number[0] === \"-\" && (start++, (this.negative = 1)),\n start < number.length &&\n (base === 16\n ? this._parseHex(number, start, endian)\n : (this._parseBase(number, base, start),\n endian === \"le\" && this._initArray(this.toArray(), base, endian)));\n }),\n (BN.prototype._initNumber = function (number, base, endian) {\n number < 0 && ((this.negative = 1), (number = -number)),\n number < 67108864\n ? ((this.words = [number & 67108863]), (this.length = 1))\n : number < 4503599627370496\n ? ((this.words = [number & 67108863, (number / 67108864) & 67108863]), (this.length = 2))\n : (assert(number < 9007199254740992),\n (this.words = [number & 67108863, (number / 67108864) & 67108863, 1]),\n (this.length = 3)),\n endian === \"le\" && this._initArray(this.toArray(), base, endian);\n }),\n (BN.prototype._initArray = function (number, base, endian) {\n if ((assert(typeof number.length == \"number\"), number.length <= 0))\n return (this.words = [0]), (this.length = 1), this;\n (this.length = Math.ceil(number.length / 3)), (this.words = new Array(this.length));\n for (var i = 0; i < this.length; i++) this.words[i] = 0;\n var j,\n w,\n off = 0;\n if (endian === \"be\")\n for (i = number.length - 1, j = 0; i >= 0; i -= 3)\n (w = number[i] | (number[i - 1] << 8) | (number[i - 2] << 16)),\n (this.words[j] |= (w << off) & 67108863),\n (this.words[j + 1] = (w >>> (26 - off)) & 67108863),\n (off += 24),\n off >= 26 && ((off -= 26), j++);\n else if (endian === \"le\")\n for (i = 0, j = 0; i < number.length; i += 3)\n (w = number[i] | (number[i + 1] << 8) | (number[i + 2] << 16)),\n (this.words[j] |= (w << off) & 67108863),\n (this.words[j + 1] = (w >>> (26 - off)) & 67108863),\n (off += 24),\n off >= 26 && ((off -= 26), j++);\n return this.strip();\n });\n function parseHex4Bits(string, index) {\n var c = string.charCodeAt(index);\n return c >= 65 && c <= 70 ? c - 55 : c >= 97 && c <= 102 ? c - 87 : (c - 48) & 15;\n }\n function parseHexByte(string, lowerBound, index) {\n var r = parseHex4Bits(string, index);\n return index - 1 >= lowerBound && (r |= parseHex4Bits(string, index - 1) << 4), r;\n }\n BN.prototype._parseHex = function (number, start, endian) {\n (this.length = Math.ceil((number.length - start) / 6)), (this.words = new Array(this.length));\n for (var i = 0; i < this.length; i++) this.words[i] = 0;\n var off = 0,\n j = 0,\n w;\n if (endian === \"be\")\n for (i = number.length - 1; i >= start; i -= 2)\n (w = parseHexByte(number, start, i) << off),\n (this.words[j] |= w & 67108863),\n off >= 18 ? ((off -= 18), (j += 1), (this.words[j] |= w >>> 26)) : (off += 8);\n else {\n var parseLength = number.length - start;\n for (i = parseLength % 2 === 0 ? start + 1 : start; i < number.length; i += 2)\n (w = parseHexByte(number, start, i) << off),\n (this.words[j] |= w & 67108863),\n off >= 18 ? ((off -= 18), (j += 1), (this.words[j] |= w >>> 26)) : (off += 8);\n }\n this.strip();\n };\n function parseBase(str, start, end, mul) {\n for (var r = 0, len = Math.min(str.length, end), i = start; i < len; i++) {\n var c = str.charCodeAt(i) - 48;\n (r *= mul), c >= 49 ? (r += c - 49 + 10) : c >= 17 ? (r += c - 17 + 10) : (r += c);\n }\n return r;\n }\n (BN.prototype._parseBase = function (number, base, start) {\n (this.words = [0]), (this.length = 1);\n for (var limbLen = 0, limbPow = 1; limbPow <= 67108863; limbPow *= base) limbLen++;\n limbLen--, (limbPow = (limbPow / base) | 0);\n for (\n var total = number.length - start,\n mod = total % limbLen,\n end = Math.min(total, total - mod) + start,\n word = 0,\n i = start;\n i < end;\n i += limbLen\n )\n (word = parseBase(number, i, i + limbLen, base)),\n this.imuln(limbPow),\n this.words[0] + word < 67108864 ? (this.words[0] += word) : this._iaddn(word);\n if (mod !== 0) {\n var pow = 1;\n for (word = parseBase(number, i, number.length, base), i = 0; i < mod; i++) pow *= base;\n this.imuln(pow), this.words[0] + word < 67108864 ? (this.words[0] += word) : this._iaddn(word);\n }\n this.strip();\n }),\n (BN.prototype.copy = function (dest) {\n dest.words = new Array(this.length);\n for (var i = 0; i < this.length; i++) dest.words[i] = this.words[i];\n (dest.length = this.length), (dest.negative = this.negative), (dest.red = this.red);\n }),\n (BN.prototype.clone = function () {\n var r = new BN(null);\n return this.copy(r), r;\n }),\n (BN.prototype._expand = function (size) {\n for (; this.length < size; ) this.words[this.length++] = 0;\n return this;\n }),\n (BN.prototype.strip = function () {\n for (; this.length > 1 && this.words[this.length - 1] === 0; ) this.length--;\n return this._normSign();\n }),\n (BN.prototype._normSign = function () {\n return this.length === 1 && this.words[0] === 0 && (this.negative = 0), this;\n }),\n (BN.prototype.inspect = function () {\n return (this.red ? \"<BN-R: \" : \"<BN: \") + this.toString(16) + \">\";\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 groupSizes = [\n 0, 0, 25, 16, 12, 11, 10, 9, 8, 8, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5,\n 5, 5,\n ],\n groupBases = [\n 0, 0, 33554432, 43046721, 16777216, 48828125, 60466176, 40353607, 16777216, 43046721, 1e7, 19487171, 35831808,\n 62748517, 7529536, 11390625, 16777216, 24137569, 34012224, 47045881, 64e6, 4084101, 5153632, 6436343, 7962624,\n 9765625, 11881376, 14348907, 17210368, 20511149, 243e5, 28629151, 33554432, 39135393, 45435424, 52521875,\n 60466176,\n ];\n (BN.prototype.toString = function (base, padding) {\n (base = base || 10), (padding = padding | 0 || 1);\n var out;\n if (base === 16 || base === \"hex\") {\n out = \"\";\n for (var off = 0, carry = 0, i = 0; i < this.length; i++) {\n var w = this.words[i],\n word = (((w << off) | carry) & 16777215).toString(16);\n (carry = (w >>> (24 - off)) & 16777215),\n carry !== 0 || i !== this.length - 1 ? (out = zeros[6 - word.length] + word + out) : (out = word + out),\n (off += 2),\n off >= 26 && ((off -= 26), i--);\n }\n for (carry !== 0 && (out = carry.toString(16) + out); out.length % padding !== 0; ) out = \"0\" + out;\n return this.negative !== 0 && (out = \"-\" + out), out;\n }\n if (base === (base | 0) && base >= 2 && base <= 36) {\n var groupSize = groupSizes[base],\n groupBase = groupBases[base];\n out = \"\";\n var c = this.clone();\n for (c.negative = 0; !c.isZero(); ) {\n var r = c.modn(groupBase).toString(base);\n (c = c.idivn(groupBase)), c.isZero() ? (out = r + out) : (out = zeros[groupSize - r.length] + r + out);\n }\n for (this.isZero() && (out = \"0\" + out); out.length % padding !== 0; ) out = \"0\" + out;\n return this.negative !== 0 && (out = \"-\" + out), out;\n }\n assert(!1, \"Base should be between 2 and 36\");\n }),\n (BN.prototype.toNumber = function () {\n var ret = this.words[0];\n return (\n this.length === 2\n ? (ret += this.words[1] * 67108864)\n : this.length === 3 && this.words[2] === 1\n ? (ret += 4503599627370496 + this.words[1] * 67108864)\n : this.length > 2 && assert(!1, \"Number can only safely store up to 53 bits\"),\n this.negative !== 0 ? -ret : ret\n );\n }),\n (BN.prototype.toJSON = function () {\n return this.toString(16);\n }),\n (BN.prototype.toBuffer = function (endian, length) {\n return assert(typeof Buffer2 < \"u\"), this.toArrayLike(Buffer2, endian, length);\n }),\n (BN.prototype.toArray = function (endian, length) {\n return this.toArrayLike(Array, endian, length);\n }),\n (BN.prototype.toArrayLike = function (ArrayType, endian, length) {\n var byteLength = this.byteLength(),\n 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 this.strip();\n var littleEndian = endian === \"le\",\n res = new ArrayType(reqLength),\n b,\n i,\n q = this.clone();\n if (littleEndian) {\n for (i = 0; !q.isZero(); i++) (b = q.andln(255)), q.iushrn(8), (res[i] = b);\n for (; i < reqLength; i++) res[i] = 0;\n } else {\n for (i = 0; i < reqLength - byteLength; i++) res[i] = 0;\n for (i = 0; !q.isZero(); i++) (b = q.andln(255)), q.iushrn(8), (res[reqLength - i - 1] = b);\n }\n return res;\n }),\n Math.clz32\n ? (BN.prototype._countBits = function (w) {\n return 32 - Math.clz32(w);\n })\n : (BN.prototype._countBits = function (w) {\n var t = w,\n r = 0;\n return (\n t >= 4096 && ((r += 13), (t >>>= 13)),\n t >= 64 && ((r += 7), (t >>>= 7)),\n t >= 8 && ((r += 4), (t >>>= 4)),\n t >= 2 && ((r += 2), (t >>>= 2)),\n r + t\n );\n }),\n (BN.prototype._zeroBits = function (w) {\n if (w === 0) return 26;\n var t = w,\n r = 0;\n return (\n (t & 8191) === 0 && ((r += 13), (t >>>= 13)),\n (t & 127) === 0 && ((r += 7), (t >>>= 7)),\n (t & 15) === 0 && ((r += 4), (t >>>= 4)),\n (t & 3) === 0 && ((r += 2), (t >>>= 2)),\n (t & 1) === 0 && r++,\n r\n );\n }),\n (BN.prototype.bitLength = function () {\n var w = this.words[this.length - 1],\n hi = this._countBits(w);\n return (this.length - 1) * 26 + hi;\n });\n function toBitArray(num) {\n for (var w = new Array(num.bitLength()), bit = 0; bit < w.length; bit++) {\n var off = (bit / 26) | 0,\n wbit = bit % 26;\n w[bit] = (num.words[off] & (1 << wbit)) >>> wbit;\n }\n return w;\n }\n (BN.prototype.zeroBits = function () {\n if (this.isZero()) return 0;\n for (var r = 0, i = 0; i < this.length; i++) {\n var b = this._zeroBits(this.words[i]);\n if (((r += b), b !== 26)) break;\n }\n return r;\n }),\n (BN.prototype.byteLength = function () {\n return Math.ceil(this.bitLength() / 8);\n }),\n (BN.prototype.toTwos = function (width) {\n return this.negative !== 0 ? this.abs().inotn(width).iaddn(1) : this.clone();\n }),\n (BN.prototype.fromTwos = function (width) {\n return this.testn(width - 1) ? this.notn(width).iaddn(1).ineg() : this.clone();\n }),\n (BN.prototype.isNeg = function () {\n return this.negative !== 0;\n }),\n (BN.prototype.neg = function () {\n return this.clone().ineg();\n }),\n (BN.prototype.ineg = function () {\n return this.isZero() || (this.negative ^= 1), this;\n }),\n (BN.prototype.iuor = function (num) {\n for (; this.length < num.length; ) this.words[this.length++] = 0;\n for (var i = 0; i < num.length; i++) this.words[i] = this.words[i] | num.words[i];\n return this.strip();\n }),\n (BN.prototype.ior = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuor(num);\n }),\n (BN.prototype.or = function (num) {\n return this.length > num.length ? this.clone().ior(num) : num.clone().ior(this);\n }),\n (BN.prototype.uor = function (num) {\n return this.length > num.length ? this.clone().iuor(num) : num.clone().iuor(this);\n }),\n (BN.prototype.iuand = function (num) {\n var b;\n this.length > num.length ? (b = num) : (b = this);\n for (var i = 0; i < b.length; i++) this.words[i] = this.words[i] & num.words[i];\n return (this.length = b.length), this.strip();\n }),\n (BN.prototype.iand = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuand(num);\n }),\n (BN.prototype.and = function (num) {\n return this.length > num.length ? this.clone().iand(num) : num.clone().iand(this);\n }),\n (BN.prototype.uand = function (num) {\n return this.length > num.length ? this.clone().iuand(num) : num.clone().iuand(this);\n }),\n (BN.prototype.iuxor = function (num) {\n var a, b;\n this.length > num.length ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var i = 0; i < b.length; i++) this.words[i] = a.words[i] ^ b.words[i];\n if (this !== a) for (; i < a.length; i++) this.words[i] = a.words[i];\n return (this.length = a.length), this.strip();\n }),\n (BN.prototype.ixor = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuxor(num);\n }),\n (BN.prototype.xor = function (num) {\n return this.length > num.length ? this.clone().ixor(num) : num.clone().ixor(this);\n }),\n (BN.prototype.uxor = function (num) {\n return this.length > num.length ? this.clone().iuxor(num) : num.clone().iuxor(this);\n }),\n (BN.prototype.inotn = function (width) {\n assert(typeof width == \"number\" && width >= 0);\n var bytesNeeded = Math.ceil(width / 26) | 0,\n bitsLeft = width % 26;\n this._expand(bytesNeeded), bitsLeft > 0 && bytesNeeded--;\n for (var i = 0; i < bytesNeeded; i++) this.words[i] = ~this.words[i] & 67108863;\n return bitsLeft > 0 && (this.words[i] = ~this.words[i] & (67108863 >> (26 - bitsLeft))), this.strip();\n }),\n (BN.prototype.notn = function (width) {\n return this.clone().inotn(width);\n }),\n (BN.prototype.setn = function (bit, val) {\n assert(typeof bit == \"number\" && bit >= 0);\n var off = (bit / 26) | 0,\n wbit = bit % 26;\n return (\n this._expand(off + 1),\n val\n ? (this.words[off] = this.words[off] | (1 << wbit))\n : (this.words[off] = this.words[off] & ~(1 << wbit)),\n this.strip()\n );\n }),\n (BN.prototype.iadd = function (num) {\n var r;\n if (this.negative !== 0 && num.negative === 0)\n return (this.negative = 0), (r = this.isub(num)), (this.negative ^= 1), this._normSign();\n if (this.negative === 0 && num.negative !== 0)\n return (num.negative = 0), (r = this.isub(num)), (num.negative = 1), r._normSign();\n var a, b;\n this.length > num.length ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var carry = 0, i = 0; i < b.length; i++)\n (r = (a.words[i] | 0) + (b.words[i] | 0) + carry), (this.words[i] = r & 67108863), (carry = r >>> 26);\n for (; carry !== 0 && i < a.length; i++)\n (r = (a.words[i] | 0) + carry), (this.words[i] = r & 67108863), (carry = r >>> 26);\n if (((this.length = a.length), carry !== 0)) (this.words[this.length] = carry), this.length++;\n else if (a !== this) for (; i < a.length; i++) this.words[i] = a.words[i];\n return this;\n }),\n (BN.prototype.add = function (num) {\n var res;\n return num.negative !== 0 && this.negative === 0\n ? ((num.negative = 0), (res = this.sub(num)), (num.negative ^= 1), res)\n : num.negative === 0 && this.negative !== 0\n ? ((this.negative = 0), (res = num.sub(this)), (this.negative = 1), res)\n : this.length > num.length\n ? this.clone().iadd(num)\n : num.clone().iadd(this);\n }),\n (BN.prototype.isub = function (num) {\n if (num.negative !== 0) {\n num.negative = 0;\n var r = this.iadd(num);\n return (num.negative = 1), r._normSign();\n } else if (this.negative !== 0)\n return (this.negative = 0), this.iadd(num), (this.negative = 1), this._normSign();\n var cmp = this.cmp(num);\n if (cmp === 0) return (this.negative = 0), (this.length = 1), (this.words[0] = 0), this;\n var a, b;\n cmp > 0 ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var carry = 0, i = 0; i < b.length; i++)\n (r = (a.words[i] | 0) - (b.words[i] | 0) + carry), (carry = r >> 26), (this.words[i] = r & 67108863);\n for (; carry !== 0 && i < a.length; i++)\n (r = (a.words[i] | 0) + carry), (carry = r >> 26), (this.words[i] = r & 67108863);\n if (carry === 0 && i < a.length && a !== this) for (; i < a.length; i++) this.words[i] = a.words[i];\n return (this.length = Math.max(this.length, i)), a !== this && (this.negative = 1), this.strip();\n }),\n (BN.prototype.sub = function (num) {\n return this.clone().isub(num);\n });\n function smallMulTo(self2, num, out) {\n out.negative = num.negative ^ self2.negative;\n var len = (self2.length + num.length) | 0;\n (out.length = len), (len = (len - 1) | 0);\n var a = self2.words[0] | 0,\n b = num.words[0] | 0,\n r = a * b,\n lo = r & 67108863,\n carry = (r / 67108864) | 0;\n out.words[0] = lo;\n for (var k = 1; k < len; k++) {\n for (\n var ncarry = carry >>> 26,\n rword = carry & 67108863,\n maxJ = Math.min(k, num.length - 1),\n j = Math.max(0, k - self2.length + 1);\n j <= maxJ;\n j++\n ) {\n var i = (k - j) | 0;\n (a = self2.words[i] | 0),\n (b = num.words[j] | 0),\n (r = a * b + rword),\n (ncarry += (r / 67108864) | 0),\n (rword = r & 67108863);\n }\n (out.words[k] = rword | 0), (carry = ncarry | 0);\n }\n return carry !== 0 ? (out.words[k] = carry | 0) : out.length--, out.strip();\n }\n var comb10MulTo = function (self2, num, out) {\n var a = self2.words,\n b = num.words,\n o = out.words,\n c = 0,\n lo,\n mid,\n hi,\n a0 = a[0] | 0,\n al0 = a0 & 8191,\n ah0 = a0 >>> 13,\n a1 = a[1] | 0,\n al1 = a1 & 8191,\n ah1 = a1 >>> 13,\n a2 = a[2] | 0,\n al2 = a2 & 8191,\n ah2 = a2 >>> 13,\n a3 = a[3] | 0,\n al3 = a3 & 8191,\n ah3 = a3 >>> 13,\n a4 = a[4] | 0,\n al4 = a4 & 8191,\n ah4 = a4 >>> 13,\n a5 = a[5] | 0,\n al5 = a5 & 8191,\n ah5 = a5 >>> 13,\n a6 = a[6] | 0,\n al6 = a6 & 8191,\n ah6 = a6 >>> 13,\n a7 = a[7] | 0,\n al7 = a7 & 8191,\n ah7 = a7 >>> 13,\n a8 = a[8] | 0,\n al8 = a8 & 8191,\n ah8 = a8 >>> 13,\n a9 = a[9] | 0,\n al9 = a9 & 8191,\n ah9 = a9 >>> 13,\n b0 = b[0] | 0,\n bl0 = b0 & 8191,\n bh0 = b0 >>> 13,\n b1 = b[1] | 0,\n bl1 = b1 & 8191,\n bh1 = b1 >>> 13,\n b2 = b[2] | 0,\n bl2 = b2 & 8191,\n bh2 = b2 >>> 13,\n b3 = b[3] | 0,\n bl3 = b3 & 8191,\n bh3 = b3 >>> 13,\n b4 = b[4] | 0,\n bl4 = b4 & 8191,\n bh4 = b4 >>> 13,\n b5 = b[5] | 0,\n bl5 = b5 & 8191,\n bh5 = b5 >>> 13,\n b6 = b[6] | 0,\n bl6 = b6 & 8191,\n bh6 = b6 >>> 13,\n b7 = b[7] | 0,\n bl7 = b7 & 8191,\n bh7 = b7 >>> 13,\n b8 = b[8] | 0,\n bl8 = b8 & 8191,\n bh8 = b8 >>> 13,\n b9 = b[9] | 0,\n bl9 = b9 & 8191,\n bh9 = b9 >>> 13;\n (out.negative = self2.negative ^ num.negative),\n (out.length = 19),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w0 >>> 26)) | 0),\n (w0 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w1 >>> 26)) | 0),\n (w1 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w2 >>> 26)) | 0),\n (w2 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w3 >>> 26)) | 0),\n (w3 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w4 >>> 26)) | 0),\n (w4 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w5 >>> 26)) | 0),\n (w5 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w6 >>> 26)) | 0),\n (w6 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w7 >>> 26)) | 0),\n (w7 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w8 >>> 26)) | 0),\n (w8 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w9 >>> 26)) | 0),\n (w9 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w10 >>> 26)) | 0),\n (w10 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w11 >>> 26)) | 0),\n (w11 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w12 >>> 26)) | 0),\n (w12 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w13 >>> 26)) | 0),\n (w13 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w14 >>> 26)) | 0),\n (w14 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w15 >>> 26)) | 0),\n (w15 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w16 >>> 26)) | 0),\n (w16 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w17 >>> 26)) | 0),\n (w17 &= 67108863),\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 & 8191) << 13)) | 0;\n return (\n (c = (((hi + (mid >>> 13)) | 0) + (w18 >>> 26)) | 0),\n (w18 &= 67108863),\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 c !== 0 && ((o[19] = c), out.length++),\n out\n );\n };\n Math.imul || (comb10MulTo = smallMulTo);\n function bigMulTo(self2, num, out) {\n (out.negative = num.negative ^ self2.negative), (out.length = self2.length + num.length);\n for (var carry = 0, hncarry = 0, k = 0; k < out.length - 1; k++) {\n var ncarry = hncarry;\n hncarry = 0;\n for (\n var rword = carry & 67108863, maxJ = Math.min(k, num.length - 1), j = Math.max(0, k - self2.length + 1);\n j <= maxJ;\n j++\n ) {\n var i = k - j,\n a = self2.words[i] | 0,\n b = num.words[j] | 0,\n r = a * b,\n lo = r & 67108863;\n (ncarry = (ncarry + ((r / 67108864) | 0)) | 0),\n (lo = (lo + rword) | 0),\n (rword = lo & 67108863),\n (ncarry = (ncarry + (lo >>> 26)) | 0),\n (hncarry += ncarry >>> 26),\n (ncarry &= 67108863);\n }\n (out.words[k] = rword), (carry = ncarry), (ncarry = hncarry);\n }\n return carry !== 0 ? (out.words[k] = carry) : out.length--, out.strip();\n }\n function jumboMulTo(self2, num, out) {\n var fftm = new FFTM();\n return fftm.mulp(self2, num, out);\n }\n BN.prototype.mulTo = function (num, out) {\n var res,\n len = this.length + num.length;\n return (\n this.length === 10 && num.length === 10\n ? (res = comb10MulTo(this, num, out))\n : len < 63\n ? (res = smallMulTo(this, num, out))\n : len < 1024\n ? (res = bigMulTo(this, num, out))\n : (res = jumboMulTo(this, num, out)),\n res\n );\n };\n function FFTM(x, y) {\n (this.x = x), (this.y = y);\n }\n (FFTM.prototype.makeRBT = function (N) {\n for (var t = new Array(N), l = BN.prototype._countBits(N) - 1, i = 0; i < N; i++) t[i] = this.revBin(i, l, N);\n return t;\n }),\n (FFTM.prototype.revBin = function (x, l, N) {\n if (x === 0 || x === N - 1) return x;\n for (var rb = 0, i = 0; i < l; i++) (rb |= (x & 1) << (l - i - 1)), (x >>= 1);\n return rb;\n }),\n (FFTM.prototype.permute = function (rbt, rws, iws, rtws, itws, N) {\n for (var i = 0; i < N; i++) (rtws[i] = rws[rbt[i]]), (itws[i] = iws[rbt[i]]);\n }),\n (FFTM.prototype.transform = function (rws, iws, rtws, itws, N, rbt) {\n this.permute(rbt, rws, iws, rtws, itws, N);\n for (var s = 1; s < N; s <<= 1)\n for (\n var l = s << 1, rtwdf = Math.cos((2 * Math.PI) / l), itwdf = Math.sin((2 * Math.PI) / l), p = 0;\n p < N;\n p += l\n )\n for (var rtwdf_ = rtwdf, itwdf_ = itwdf, j = 0; j < s; j++) {\n var re = rtws[p + j],\n ie = itws[p + j],\n ro = rtws[p + j + s],\n io = itws[p + j + s],\n rx = rtwdf_ * ro - itwdf_ * io;\n (io = rtwdf_ * io + itwdf_ * ro),\n (ro = rx),\n (rtws[p + j] = re + ro),\n (itws[p + j] = ie + io),\n (rtws[p + j + s] = re - ro),\n (itws[p + j + s] = ie - io),\n j !== l &&\n ((rx = rtwdf * rtwdf_ - itwdf * itwdf_), (itwdf_ = rtwdf * itwdf_ + itwdf * rtwdf_), (rtwdf_ = rx));\n }\n }),\n (FFTM.prototype.guessLen13b = function (n, m) {\n var N = Math.max(m, n) | 1,\n odd = N & 1,\n i = 0;\n for (N = (N / 2) | 0; N; N = N >>> 1) i++;\n return 1 << (i + 1 + odd);\n }),\n (FFTM.prototype.conjugate = function (rws, iws, N) {\n if (!(N <= 1))\n for (var i = 0; i < N / 2; i++) {\n var t = rws[i];\n (rws[i] = rws[N - i - 1]),\n (rws[N - i - 1] = t),\n (t = iws[i]),\n (iws[i] = -iws[N - i - 1]),\n (iws[N - i - 1] = -t);\n }\n }),\n (FFTM.prototype.normalize13b = function (ws, N) {\n for (var carry = 0, i = 0; i < N / 2; i++) {\n var w = Math.round(ws[2 * i + 1] / N) * 8192 + Math.round(ws[2 * i] / N) + carry;\n (ws[i] = w & 67108863), w < 67108864 ? (carry = 0) : (carry = (w / 67108864) | 0);\n }\n return ws;\n }),\n (FFTM.prototype.convert13b = function (ws, len, rws, N) {\n for (var carry = 0, i = 0; i < len; i++)\n (carry = carry + (ws[i] | 0)),\n (rws[2 * i] = carry & 8191),\n (carry = carry >>> 13),\n (rws[2 * i + 1] = carry & 8191),\n (carry = carry >>> 13);\n for (i = 2 * len; i < N; ++i) rws[i] = 0;\n assert(carry === 0), assert((carry & -8192) === 0);\n }),\n (FFTM.prototype.stub = function (N) {\n for (var ph = new Array(N), i = 0; i < N; i++) ph[i] = 0;\n return ph;\n }),\n (FFTM.prototype.mulp = function (x, y, out) {\n var N = 2 * this.guessLen13b(x.length, y.length),\n rbt = this.makeRBT(N),\n _ = this.stub(N),\n rws = new Array(N),\n rwst = new Array(N),\n iwst = new Array(N),\n nrws = new Array(N),\n nrwst = new Array(N),\n niwst = new Array(N),\n rmws = out.words;\n (rmws.length = N),\n this.convert13b(x.words, x.length, rws, N),\n this.convert13b(y.words, y.length, nrws, N),\n this.transform(rws, _, rwst, iwst, N, rbt),\n this.transform(nrws, _, nrwst, niwst, N, rbt);\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]), (rwst[i] = rx);\n }\n return (\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 (out.negative = x.negative ^ y.negative),\n (out.length = x.length + y.length),\n out.strip()\n );\n }),\n (BN.prototype.mul = function (num) {\n var out = new BN(null);\n return (out.words = new Array(this.length + num.length)), this.mulTo(num, out);\n }),\n (BN.prototype.mulf = function (num) {\n var out = new BN(null);\n return (out.words = new Array(this.length + num.length)), jumboMulTo(this, num, out);\n }),\n (BN.prototype.imul = function (num) {\n return this.clone().mulTo(num, this);\n }),\n (BN.prototype.imuln = function (num) {\n assert(typeof num == \"number\"), assert(num < 67108864);\n for (var carry = 0, i = 0; i < this.length; i++) {\n var w = (this.words[i] | 0) * num,\n lo = (w & 67108863) + (carry & 67108863);\n (carry >>= 26), (carry += (w / 67108864) | 0), (carry += lo >>> 26), (this.words[i] = lo & 67108863);\n }\n return carry !== 0 && ((this.words[i] = carry), this.length++), this;\n }),\n (BN.prototype.muln = function (num) {\n return this.clone().imuln(num);\n }),\n (BN.prototype.sqr = function () {\n return this.mul(this);\n }),\n (BN.prototype.isqr = function () {\n return this.imul(this.clone());\n }),\n (BN.prototype.pow = function (num) {\n var w = toBitArray(num);\n if (w.length === 0) return new BN(1);\n for (var res = this, i = 0; i < w.length && w[i] === 0; i++, res = res.sqr());\n if (++i < w.length) for (var q = res.sqr(); i < w.length; i++, q = q.sqr()) w[i] !== 0 && (res = res.mul(q));\n return res;\n }),\n (BN.prototype.iushln = function (bits) {\n assert(typeof bits == \"number\" && bits >= 0);\n var r = bits % 26,\n s = (bits - r) / 26,\n carryMask = (67108863 >>> (26 - r)) << (26 - r),\n i;\n if (r !== 0) {\n var carry = 0;\n for (i = 0; i < this.length; i++) {\n var newCarry = this.words[i] & carryMask,\n c = ((this.words[i] | 0) - newCarry) << r;\n (this.words[i] = c | carry), (carry = newCarry >>> (26 - r));\n }\n carry && ((this.words[i] = carry), this.length++);\n }\n if (s !== 0) {\n for (i = this.length - 1; i >= 0; i--) this.words[i + s] = this.words[i];\n for (i = 0; i < s; i++) this.words[i] = 0;\n this.length += s;\n }\n return this.strip();\n }),\n (BN.prototype.ishln = function (bits) {\n return assert(this.negative === 0), this.iushln(bits);\n }),\n (BN.prototype.iushrn = function (bits, hint, extended) {\n assert(typeof bits == \"number\" && bits >= 0);\n var h;\n hint ? (h = (hint - (hint % 26)) / 26) : (h = 0);\n var r = bits % 26,\n s = Math.min((bits - r) / 26, this.length),\n mask = 67108863 ^ ((67108863 >>> r) << r),\n maskedWords = extended;\n if (((h -= s), (h = Math.max(0, h)), maskedWords)) {\n for (var i = 0; i < s; i++) maskedWords.words[i] = this.words[i];\n maskedWords.length = s;\n }\n if (s !== 0)\n if (this.length > s) for (this.length -= s, i = 0; i < this.length; i++) this.words[i] = this.words[i + s];\n else (this.words[0] = 0), (this.length = 1);\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)), (carry = word & mask);\n }\n return (\n maskedWords && carry !== 0 && (maskedWords.words[maskedWords.length++] = carry),\n this.length === 0 && ((this.words[0] = 0), (this.length = 1)),\n this.strip()\n );\n }),\n (BN.prototype.ishrn = function (bits, hint, extended) {\n return assert(this.negative === 0), this.iushrn(bits, hint, extended);\n }),\n (BN.prototype.shln = function (bits) {\n return this.clone().ishln(bits);\n }),\n (BN.prototype.ushln = function (bits) {\n return this.clone().iushln(bits);\n }),\n (BN.prototype.shrn = function (bits) {\n return this.clone().ishrn(bits);\n }),\n (BN.prototype.ushrn = function (bits) {\n return this.clone().iushrn(bits);\n }),\n (BN.prototype.testn = function (bit) {\n assert(typeof bit == \"number\" && bit >= 0);\n var r = bit % 26,\n s = (bit - r) / 26,\n q = 1 << r;\n if (this.length <= s) return !1;\n var w = this.words[s];\n return !!(w & q);\n }),\n (BN.prototype.imaskn = function (bits) {\n assert(typeof bits == \"number\" && bits >= 0);\n var r = bits % 26,\n s = (bits - r) / 26;\n if ((assert(this.negative === 0, \"imaskn works only with positive numbers\"), this.length <= s)) return this;\n if ((r !== 0 && s++, (this.length = Math.min(s, this.length)), r !== 0)) {\n var mask = 67108863 ^ ((67108863 >>> r) << r);\n this.words[this.length - 1] &= mask;\n }\n return this.strip();\n }),\n (BN.prototype.maskn = function (bits) {\n return this.clone().imaskn(bits);\n }),\n (BN.prototype.iaddn = function (num) {\n return (\n assert(typeof num == \"number\"),\n assert(num < 67108864),\n num < 0\n ? this.isubn(-num)\n : this.negative !== 0\n ? this.length === 1 && (this.words[0] | 0) < num\n ? ((this.words[0] = num - (this.words[0] | 0)), (this.negative = 0), this)\n : ((this.negative = 0), this.isubn(num), (this.negative = 1), this)\n : this._iaddn(num)\n );\n }),\n (BN.prototype._iaddn = function (num) {\n this.words[0] += num;\n for (var i = 0; i < this.length && this.words[i] >= 67108864; i++)\n (this.words[i] -= 67108864), i === this.length - 1 ? (this.words[i + 1] = 1) : this.words[i + 1]++;\n return (this.length = Math.max(this.length, i + 1)), this;\n }),\n (BN.prototype.isubn = function (num) {\n if ((assert(typeof num == \"number\"), assert(num < 67108864), num < 0)) return this.iaddn(-num);\n if (this.negative !== 0) return (this.negative = 0), this.iaddn(num), (this.negative = 1), this;\n if (((this.words[0] -= num), this.length === 1 && this.words[0] < 0))\n (this.words[0] = -this.words[0]), (this.negative = 1);\n else\n for (var i = 0; i < this.length && this.words[i] < 0; i++)\n (this.words[i] += 67108864), (this.words[i + 1] -= 1);\n return this.strip();\n }),\n (BN.prototype.addn = function (num) {\n return this.clone().iaddn(num);\n }),\n (BN.prototype.subn = function (num) {\n return this.clone().isubn(num);\n }),\n (BN.prototype.iabs = function () {\n return (this.negative = 0), this;\n }),\n (BN.prototype.abs = function () {\n return this.clone().iabs();\n }),\n (BN.prototype._ishlnsubmul = function (num, mul, shift) {\n var len = num.length + shift,\n i;\n this._expand(len);\n var w,\n 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 & 67108863),\n (carry = (w >> 26) - ((right / 67108864) | 0)),\n (this.words[i + shift] = w & 67108863);\n }\n for (; i < this.length - shift; i++)\n (w = (this.words[i + shift] | 0) + carry), (carry = w >> 26), (this.words[i + shift] = w & 67108863);\n if (carry === 0) return this.strip();\n for (assert(carry === -1), carry = 0, i = 0; i < this.length; i++)\n (w = -(this.words[i] | 0) + carry), (carry = w >> 26), (this.words[i] = w & 67108863);\n return (this.negative = 1), this.strip();\n }),\n (BN.prototype._wordDiv = function (num, mode) {\n var shift = this.length - num.length,\n a = this.clone(),\n b = num,\n bhi = b.words[b.length - 1] | 0,\n bhiBits = this._countBits(bhi);\n (shift = 26 - bhiBits),\n shift !== 0 && ((b = b.ushln(shift)), a.iushln(shift), (bhi = b.words[b.length - 1] | 0));\n var m = a.length - b.length,\n q;\n if (mode !== \"mod\") {\n (q = new BN(null)), (q.length = m + 1), (q.words = new Array(q.length));\n for (var i = 0; i < q.length; i++) q.words[i] = 0;\n }\n var diff = a.clone()._ishlnsubmul(b, 1, m);\n diff.negative === 0 && ((a = diff), q && (q.words[m] = 1));\n for (var j = m - 1; j >= 0; j--) {\n var qj = (a.words[b.length + j] | 0) * 67108864 + (a.words[b.length + j - 1] | 0);\n for (qj = Math.min((qj / bhi) | 0, 67108863), a._ishlnsubmul(b, qj, j); a.negative !== 0; )\n qj--, (a.negative = 0), a._ishlnsubmul(b, 1, j), a.isZero() || (a.negative ^= 1);\n q && (q.words[j] = qj);\n }\n return (\n q && q.strip(),\n a.strip(),\n mode !== \"div\" && shift !== 0 && a.iushrn(shift),\n {\n div: q || null,\n mod: a,\n }\n );\n }),\n (BN.prototype.divmod = function (num, mode, positive) {\n if ((assert(!num.isZero()), this.isZero()))\n return {\n div: new BN(0),\n mod: new BN(0),\n };\n var div, mod, res;\n return this.negative !== 0 && num.negative === 0\n ? ((res = this.neg().divmod(num, mode)),\n mode !== \"mod\" && (div = res.div.neg()),\n mode !== \"div\" && ((mod = res.mod.neg()), positive && mod.negative !== 0 && mod.iadd(num)),\n {\n div,\n mod,\n })\n : this.negative === 0 && num.negative !== 0\n ? ((res = this.divmod(num.neg(), mode)),\n mode !== \"mod\" && (div = res.div.neg()),\n {\n div,\n mod: res.mod,\n })\n : (this.negative & num.negative) !== 0\n ? ((res = this.neg().divmod(num.neg(), mode)),\n mode !== \"div\" && ((mod = res.mod.neg()), positive && mod.negative !== 0 && mod.isub(num)),\n {\n div: res.div,\n mod,\n })\n : num.length > this.length || this.cmp(num) < 0\n ? {\n div: new BN(0),\n mod: this,\n }\n : num.length === 1\n ? mode === \"div\"\n ? {\n div: this.divn(num.words[0]),\n mod: null,\n }\n : mode === \"mod\"\n ? {\n div: null,\n mod: new BN(this.modn(num.words[0])),\n }\n : {\n div: this.divn(num.words[0]),\n mod: new BN(this.modn(num.words[0])),\n }\n : this._wordDiv(num, mode);\n }),\n (BN.prototype.div = function (num) {\n return this.divmod(num, \"div\", !1).div;\n }),\n (BN.prototype.mod = function (num) {\n return this.divmod(num, \"mod\", !1).mod;\n }),\n (BN.prototype.umod = function (num) {\n return this.divmod(num, \"mod\", !0).mod;\n }),\n (BN.prototype.divRound = function (num) {\n var dm = this.divmod(num);\n if (dm.mod.isZero()) return dm.div;\n var mod = dm.div.negative !== 0 ? dm.mod.isub(num) : dm.mod,\n half = num.ushrn(1),\n r2 = num.andln(1),\n cmp = mod.cmp(half);\n return cmp < 0 || (r2 === 1 && cmp === 0)\n ? dm.div\n : dm.div.negative !== 0\n ? dm.div.isubn(1)\n : dm.div.iaddn(1);\n }),\n (BN.prototype.modn = function (num) {\n assert(num <= 67108863);\n for (var p = (1 << 26) % num, acc = 0, i = this.length - 1; i >= 0; i--)\n acc = (p * acc + (this.words[i] | 0)) % num;\n return acc;\n }),\n (BN.prototype.idivn = function (num) {\n assert(num <= 67108863);\n for (var carry = 0, i = this.length - 1; i >= 0; i--) {\n var w = (this.words[i] | 0) + carry * 67108864;\n (this.words[i] = (w / num) | 0), (carry = w % num);\n }\n return this.strip();\n }),\n (BN.prototype.divn = function (num) {\n return this.clone().idivn(num);\n }),\n (BN.prototype.egcd = function (p) {\n assert(p.negative === 0), assert(!p.isZero());\n var x = this,\n y = p.clone();\n x.negative !== 0 ? (x = x.umod(p)) : (x = x.clone());\n for (var A = new BN(1), B = new BN(0), C = new BN(0), D = new BN(1), g = 0; x.isEven() && y.isEven(); )\n x.iushrn(1), y.iushrn(1), ++g;\n for (var yp = y.clone(), xp = x.clone(); !x.isZero(); ) {\n for (var i = 0, im = 1; (x.words[0] & im) === 0 && i < 26; ++i, im <<= 1);\n if (i > 0)\n for (x.iushrn(i); i-- > 0; )\n (A.isOdd() || B.isOdd()) && (A.iadd(yp), B.isub(xp)), A.iushrn(1), B.iushrn(1);\n for (var j = 0, jm = 1; (y.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n if (j > 0)\n for (y.iushrn(j); j-- > 0; )\n (C.isOdd() || D.isOdd()) && (C.iadd(yp), D.isub(xp)), C.iushrn(1), D.iushrn(1);\n x.cmp(y) >= 0 ? (x.isub(y), A.isub(C), B.isub(D)) : (y.isub(x), C.isub(A), D.isub(B));\n }\n return {\n a: C,\n b: D,\n gcd: y.iushln(g),\n };\n }),\n (BN.prototype._invmp = function (p) {\n assert(p.negative === 0), assert(!p.isZero());\n var a = this,\n b = p.clone();\n a.negative !== 0 ? (a = a.umod(p)) : (a = a.clone());\n for (var x1 = new BN(1), x2 = new BN(0), delta = b.clone(); 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) for (a.iushrn(i); i-- > 0; ) x1.isOdd() && x1.iadd(delta), x1.iushrn(1);\n for (var j = 0, jm = 1; (b.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n if (j > 0) for (b.iushrn(j); j-- > 0; ) x2.isOdd() && x2.iadd(delta), x2.iushrn(1);\n a.cmp(b) >= 0 ? (a.isub(b), x1.isub(x2)) : (b.isub(a), x2.isub(x1));\n }\n var res;\n return a.cmpn(1) === 0 ? (res = x1) : (res = x2), res.cmpn(0) < 0 && res.iadd(p), res;\n }),\n (BN.prototype.gcd = function (num) {\n if (this.isZero()) return num.abs();\n if (num.isZero()) return this.abs();\n var a = this.clone(),\n b = num.clone();\n (a.negative = 0), (b.negative = 0);\n for (var shift = 0; a.isEven() && b.isEven(); shift++) a.iushrn(1), b.iushrn(1);\n do {\n for (; a.isEven(); ) a.iushrn(1);\n for (; b.isEven(); ) b.iushrn(1);\n var r = a.cmp(b);\n if (r < 0) {\n var t = a;\n (a = b), (b = t);\n } else if (r === 0 || b.cmpn(1) === 0) break;\n a.isub(b);\n } while (!0);\n return b.iushln(shift);\n }),\n (BN.prototype.invm = function (num) {\n return this.egcd(num).a.umod(num);\n }),\n (BN.prototype.isEven = function () {\n return (this.words[0] & 1) === 0;\n }),\n (BN.prototype.isOdd = function () {\n return (this.words[0] & 1) === 1;\n }),\n (BN.prototype.andln = function (num) {\n return this.words[0] & num;\n }),\n (BN.prototype.bincn = function (bit) {\n assert(typeof bit == \"number\");\n var r = bit % 26,\n s = (bit - r) / 26,\n q = 1 << r;\n if (this.length <= s) return this._expand(s + 1), (this.words[s] |= q), this;\n for (var carry = q, i = s; carry !== 0 && i < this.length; i++) {\n var w = this.words[i] | 0;\n (w += carry), (carry = w >>> 26), (w &= 67108863), (this.words[i] = w);\n }\n return carry !== 0 && ((this.words[i] = carry), this.length++), this;\n }),\n (BN.prototype.isZero = function () {\n return this.length === 1 && this.words[0] === 0;\n }),\n (BN.prototype.cmpn = function (num) {\n var negative = num < 0;\n if (this.negative !== 0 && !negative) return -1;\n if (this.negative === 0 && negative) return 1;\n this.strip();\n var res;\n if (this.length > 1) res = 1;\n else {\n negative && (num = -num), assert(num <= 67108863, \"Number is too big\");\n var w = this.words[0] | 0;\n res = w === num ? 0 : w < num ? -1 : 1;\n }\n return this.negative !== 0 ? -res | 0 : res;\n }),\n (BN.prototype.cmp = function (num) {\n if (this.negative !== 0 && num.negative === 0) return -1;\n if (this.negative === 0 && num.negative !== 0) return 1;\n var res = this.ucmp(num);\n return this.negative !== 0 ? -res | 0 : res;\n }),\n (BN.prototype.ucmp = function (num) {\n if (this.length > num.length) return 1;\n if (this.length < num.length) return -1;\n for (var res = 0, i = this.length - 1; i >= 0; i--) {\n var a = this.words[i] | 0,\n b = num.words[i] | 0;\n if (a !== b) {\n a < b ? (res = -1) : a > b && (res = 1);\n break;\n }\n }\n return res;\n }),\n (BN.prototype.gtn = function (num) {\n return this.cmpn(num) === 1;\n }),\n (BN.prototype.gt = function (num) {\n return this.cmp(num) === 1;\n }),\n (BN.prototype.gten = function (num) {\n return this.cmpn(num) >= 0;\n }),\n (BN.prototype.gte = function (num) {\n return this.cmp(num) >= 0;\n }),\n (BN.prototype.ltn = function (num) {\n return this.cmpn(num) === -1;\n }),\n (BN.prototype.lt = function (num) {\n return this.cmp(num) === -1;\n }),\n (BN.prototype.lten = function (num) {\n return this.cmpn(num) <= 0;\n }),\n (BN.prototype.lte = function (num) {\n return this.cmp(num) <= 0;\n }),\n (BN.prototype.eqn = function (num) {\n return this.cmpn(num) === 0;\n }),\n (BN.prototype.eq = function (num) {\n return this.cmp(num) === 0;\n }),\n (BN.red = function (num) {\n return new Red(num);\n }),\n (BN.prototype.toRed = function (ctx) {\n return (\n assert(!this.red, \"Already a number in reduction context\"),\n assert(this.negative === 0, \"red works only with positives\"),\n ctx.convertTo(this)._forceRed(ctx)\n );\n }),\n (BN.prototype.fromRed = function () {\n return assert(this.red, \"fromRed works only with numbers in reduction context\"), this.red.convertFrom(this);\n }),\n (BN.prototype._forceRed = function (ctx) {\n return (this.red = ctx), this;\n }),\n (BN.prototype.forceRed = function (ctx) {\n return assert(!this.red, \"Already a number in reduction context\"), this._forceRed(ctx);\n }),\n (BN.prototype.redAdd = function (num) {\n return assert(this.red, \"redAdd works only with red numbers\"), this.red.add(this, num);\n }),\n (BN.prototype.redIAdd = function (num) {\n return assert(this.red, \"redIAdd works only with red numbers\"), this.red.iadd(this, num);\n }),\n (BN.prototype.redSub = function (num) {\n return assert(this.red, \"redSub works only with red numbers\"), this.red.sub(this, num);\n }),\n (BN.prototype.redISub = function (num) {\n return assert(this.red, \"redISub works only with red numbers\"), this.red.isub(this, num);\n }),\n (BN.prototype.redShl = function (num) {\n return assert(this.red, \"redShl works only with red numbers\"), this.red.shl(this, num);\n }),\n (BN.prototype.redMul = function (num) {\n return (\n assert(this.red, \"redMul works only with red numbers\"),\n this.red._verify2(this, num),\n this.red.mul(this, num)\n );\n }),\n (BN.prototype.redIMul = function (num) {\n return (\n assert(this.red, \"redMul works only with red numbers\"),\n this.red._verify2(this, num),\n this.red.imul(this, num)\n );\n }),\n (BN.prototype.redSqr = function () {\n return assert(this.red, \"redSqr works only with red numbers\"), this.red._verify1(this), this.red.sqr(this);\n }),\n (BN.prototype.redISqr = function () {\n return assert(this.red, \"redISqr works only with red numbers\"), this.red._verify1(this), this.red.isqr(this);\n }),\n (BN.prototype.redSqrt = function () {\n return assert(this.red, \"redSqrt works only with red numbers\"), this.red._verify1(this), this.red.sqrt(this);\n }),\n (BN.prototype.redInvm = function () {\n return assert(this.red, \"redInvm works only with red numbers\"), this.red._verify1(this), this.red.invm(this);\n }),\n (BN.prototype.redNeg = function () {\n return assert(this.red, \"redNeg works only with red numbers\"), this.red._verify1(this), this.red.neg(this);\n }),\n (BN.prototype.redPow = function (num) {\n return assert(this.red && !num.red, \"redPow(normalNum)\"), this.red._verify1(this), this.red.pow(this, num);\n });\n var primes = {\n k256: null,\n p224: null,\n p192: null,\n p25519: null,\n };\n function MPrime(name, p) {\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 (this.tmp = this._tmp());\n }\n (MPrime.prototype._tmp = function () {\n var tmp = new BN(null);\n return (tmp.words = new Array(Math.ceil(this.n / 13))), tmp;\n }),\n (MPrime.prototype.ireduce = function (num) {\n var r = num,\n rlen;\n do this.split(r, this.tmp), (r = this.imulK(r)), (r = r.iadd(this.tmp)), (rlen = r.bitLength());\n while (rlen > this.n);\n var cmp = rlen < this.n ? -1 : r.ucmp(this.p);\n return (\n cmp === 0\n ? ((r.words[0] = 0), (r.length = 1))\n : cmp > 0\n ? r.isub(this.p)\n : r.strip !== void 0\n ? r.strip()\n : r._strip(),\n r\n );\n }),\n (MPrime.prototype.split = function (input, out) {\n input.iushrn(this.n, 0, out);\n }),\n (MPrime.prototype.imulK = function (num) {\n return num.imul(this.k);\n });\n function K256() {\n MPrime.call(this, \"k256\", \"ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f\");\n }\n inherits(K256, MPrime),\n (K256.prototype.split = function (input, output) {\n for (var mask = 4194303, outLen = Math.min(input.length, 9), i = 0; i < outLen; i++)\n output.words[i] = input.words[i];\n if (((output.length = outLen), input.length <= 9)) {\n (input.words[0] = 0), (input.length = 1);\n return;\n }\n var prev = input.words[9];\n for (output.words[output.length++] = prev & mask, i = 10; i < input.length; i++) {\n var next = input.words[i] | 0;\n (input.words[i - 10] = ((next & mask) << 4) | (prev >>> 22)), (prev = next);\n }\n (prev >>>= 22),\n (input.words[i - 10] = prev),\n prev === 0 && input.length > 10 ? (input.length -= 10) : (input.length -= 9);\n }),\n (K256.prototype.imulK = function (num) {\n (num.words[num.length] = 0), (num.words[num.length + 1] = 0), (num.length += 2);\n for (var lo = 0, i = 0; i < num.length; i++) {\n var w = num.words[i] | 0;\n (lo += w * 977), (num.words[i] = lo & 67108863), (lo = w * 64 + ((lo / 67108864) | 0));\n }\n return (\n num.words[num.length - 1] === 0 && (num.length--, num.words[num.length - 1] === 0 && num.length--), num\n );\n });\n function P224() {\n MPrime.call(this, \"p224\", \"ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001\");\n }\n inherits(P224, MPrime);\n function P192() {\n MPrime.call(this, \"p192\", \"ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff\");\n }\n inherits(P192, MPrime);\n function P25519() {\n MPrime.call(this, \"25519\", \"7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed\");\n }\n inherits(P25519, MPrime),\n (P25519.prototype.imulK = function (num) {\n for (var carry = 0, i = 0; i < num.length; i++) {\n var hi = (num.words[i] | 0) * 19 + carry,\n lo = hi & 67108863;\n (hi >>>= 26), (num.words[i] = lo), (carry = hi);\n }\n return carry !== 0 && (num.words[num.length++] = carry), num;\n }),\n (BN._prime = function (name) {\n if (primes[name]) return primes[name];\n var prime2;\n if (name === \"k256\") prime2 = new K256();\n else if (name === \"p224\") prime2 = new P224();\n else if (name === \"p192\") prime2 = new P192();\n else if (name === \"p25519\") prime2 = new P25519();\n else throw new Error(\"Unknown prime \" + name);\n return (primes[name] = prime2), prime2;\n });\n function Red(m) {\n if (typeof m == \"string\") {\n var prime = BN._prime(m);\n (this.m = prime.p), (this.prime = prime);\n } else assert(m.gtn(1), \"modulus must be greater than 1\"), (this.m = m), (this.prime = null);\n }\n (Red.prototype._verify1 = function (a) {\n assert(a.negative === 0, \"red works only with positives\"), assert(a.red, \"red works only with red numbers\");\n }),\n (Red.prototype._verify2 = function (a, b) {\n assert((a.negative | b.negative) === 0, \"red works only with positives\"),\n assert(a.red && a.red === b.red, \"red works only with red numbers\");\n }),\n (Red.prototype.imod = function (a) {\n return this.prime ? this.prime.ireduce(a)._forceRed(this) : a.umod(this.m)._forceRed(this);\n }),\n (Red.prototype.neg = function (a) {\n return a.isZero() ? a.clone() : this.m.sub(a)._forceRed(this);\n }),\n (Red.prototype.add = function (a, b) {\n this._verify2(a, b);\n var res = a.add(b);\n return res.cmp(this.m) >= 0 && res.isub(this.m), res._forceRed(this);\n }),\n (Red.prototype.iadd = function (a, b) {\n this._verify2(a, b);\n var res = a.iadd(b);\n return res.cmp(this.m) >= 0 && res.isub(this.m), res;\n }),\n (Red.prototype.sub = function (a, b) {\n this._verify2(a, b);\n var res = a.sub(b);\n return res.cmpn(0) < 0 && res.iadd(this.m), res._forceRed(this);\n }),\n (Red.prototype.isub = function (a, b) {\n this._verify2(a, b);\n var res = a.isub(b);\n return res.cmpn(0) < 0 && res.iadd(this.m), res;\n }),\n (Red.prototype.shl = function (a, num) {\n return this._verify1(a), this.imod(a.ushln(num));\n }),\n (Red.prototype.imul = function (a, b) {\n return this._verify2(a, b), this.imod(a.imul(b));\n }),\n (Red.prototype.mul = function (a, b) {\n return this._verify2(a, b), this.imod(a.mul(b));\n }),\n (Red.prototype.isqr = function (a) {\n return this.imul(a, a.clone());\n }),\n (Red.prototype.sqr = function (a) {\n return this.mul(a, a);\n }),\n (Red.prototype.sqrt = function (a) {\n if (a.isZero()) return a.clone();\n var mod3 = this.m.andln(3);\n if ((assert(mod3 % 2 === 1), mod3 === 3)) {\n var pow = this.m.add(new BN(1)).iushrn(2);\n return this.pow(a, pow);\n }\n for (var q = this.m.subn(1), s = 0; !q.isZero() && q.andln(1) === 0; ) s++, q.iushrn(1);\n assert(!q.isZero());\n var one = new BN(1).toRed(this),\n nOne = one.redNeg(),\n lpow = this.m.subn(1).iushrn(1),\n z = this.m.bitLength();\n for (z = new BN(2 * z * z).toRed(this); this.pow(z, lpow).cmp(nOne) !== 0; ) z.redIAdd(nOne);\n for (\n var c = this.pow(z, q), r = this.pow(a, q.addn(1).iushrn(1)), t = this.pow(a, q), m = s;\n t.cmp(one) !== 0;\n\n ) {\n for (var tmp = t, i = 0; tmp.cmp(one) !== 0; i++) tmp = tmp.redSqr();\n assert(i < m);\n var b = this.pow(c, new BN(1).iushln(m - i - 1));\n (r = r.redMul(b)), (c = b.redSqr()), (t = t.redMul(c)), (m = i);\n }\n return r;\n }),\n (Red.prototype.invm = function (a) {\n var inv = a._invmp(this.m);\n return inv.negative !== 0 ? ((inv.negative = 0), this.imod(inv).redNeg()) : this.imod(inv);\n }),\n (Red.prototype.pow = function (a, num) {\n if (num.isZero()) return new BN(1).toRed(this);\n if (num.cmpn(1) === 0) return a.clone();\n var windowSize = 4,\n wnd = new Array(1 << windowSize);\n (wnd[0] = new BN(1).toRed(this)), (wnd[1] = a);\n for (var i = 2; i < wnd.length; i++) wnd[i] = this.mul(wnd[i - 1], a);\n var res = wnd[0],\n current = 0,\n currentLen = 0,\n start = num.bitLength() % 26;\n for (start === 0 && (start = 26), i = num.length - 1; i >= 0; i--) {\n for (var word = num.words[i], j = start - 1; j >= 0; j--) {\n var bit = (word >> j) & 1;\n if ((res !== wnd[0] && (res = this.sqr(res)), bit === 0 && current === 0)) {\n currentLen = 0;\n continue;\n }\n (current <<= 1),\n (current |= bit),\n currentLen++,\n !(currentLen !== windowSize && (i !== 0 || j !== 0)) &&\n ((res = this.mul(res, wnd[current])), (currentLen = 0), (current = 0));\n }\n start = 26;\n }\n return res;\n }),\n (Red.prototype.convertTo = function (num) {\n var r = num.umod(this.m);\n return r === num ? r.clone() : r;\n }),\n (Red.prototype.convertFrom = function (num) {\n var res = num.clone();\n return (res.red = null), res;\n }),\n (BN.mont = function (num) {\n return new Mont(num);\n });\n function Mont(m) {\n Red.call(this, m),\n (this.shift = this.m.bitLength()),\n this.shift % 26 !== 0 && (this.shift += 26 - (this.shift % 26)),\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 (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 (Mont.prototype.convertTo = function (num) {\n return this.imod(num.ushln(this.shift));\n }),\n (Mont.prototype.convertFrom = function (num) {\n var r = this.imod(num.mul(this.rinv));\n return (r.red = null), r;\n }),\n (Mont.prototype.imul = function (a, b) {\n if (a.isZero() || b.isZero()) return (a.words[0] = 0), (a.length = 1), a;\n var t = a.imul(b),\n c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m),\n u = t.isub(c).iushrn(this.shift),\n res = u;\n return (\n u.cmp(this.m) >= 0 ? (res = u.isub(this.m)) : u.cmpn(0) < 0 && (res = u.iadd(this.m)), res._forceRed(this)\n );\n }),\n (Mont.prototype.mul = function (a, b) {\n if (a.isZero() || b.isZero()) return new BN(0)._forceRed(this);\n var t = a.mul(b),\n c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m),\n u = t.isub(c).iushrn(this.shift),\n res = u;\n return (\n u.cmp(this.m) >= 0 ? (res = u.isub(this.m)) : u.cmpn(0) < 0 && (res = u.iadd(this.m)), res._forceRed(this)\n );\n }),\n (Mont.prototype.invm = function (a) {\n var res = this.imod(a._invmp(this.m).mul(this.r2));\n return res._forceRed(this);\n });\n })(typeof module > \"u\" || module, exports);\n },\n});\n\n// node_modules/miller-rabin/node_modules/bn.js/lib/bn.js\nvar require_bn2 = __commonJS({\n \"node_modules/miller-rabin/node_modules/bn.js/lib/bn.js\"(exports, module) {\n (function (module2, exports2) {\n \"use strict\";\n function assert(val, msg) {\n if (!val) throw new Error(msg || \"Assertion failed\");\n }\n function inherits(ctor, superCtor) {\n ctor.super_ = superCtor;\n var TempCtor = function () {};\n (TempCtor.prototype = superCtor.prototype),\n (ctor.prototype = new TempCtor()),\n (ctor.prototype.constructor = ctor);\n }\n function BN(number, base, endian) {\n if (BN.isBN(number)) return number;\n (this.negative = 0),\n (this.words = null),\n (this.length = 0),\n (this.red = null),\n number !== null &&\n ((base === \"le\" || base === \"be\") && ((endian = base), (base = 10)),\n this._init(number || 0, base || 10, endian || \"be\"));\n }\n typeof module2 == \"object\" ? (module2.exports = BN) : (exports2.BN = BN), (BN.BN = BN), (BN.wordSize = 26);\n var Buffer2;\n try {\n typeof window < \"u\" && typeof window.Buffer < \"u\"\n ? (Buffer2 = window.Buffer)\n : (Buffer2 = __require(\"buffer\").Buffer);\n } catch {}\n (BN.isBN = function (num) {\n return num instanceof BN\n ? !0\n : num !== null &&\n typeof num == \"object\" &&\n num.constructor.wordSize === BN.wordSize &&\n Array.isArray(num.words);\n }),\n (BN.max = function (left, right) {\n return left.cmp(right) > 0 ? left : right;\n }),\n (BN.min = function (left, right) {\n return left.cmp(right) < 0 ? left : right;\n }),\n (BN.prototype._init = function (number, base, endian) {\n if (typeof number == \"number\") return this._initNumber(number, base, endian);\n if (typeof number == \"object\") return this._initArray(number, base, endian);\n base === \"hex\" && (base = 16),\n assert(base === (base | 0) && base >= 2 && base <= 36),\n (number = number.toString().replace(/\\s+/g, \"\"));\n var start = 0;\n number[0] === \"-\" && (start++, (this.negative = 1)),\n start < number.length &&\n (base === 16\n ? this._parseHex(number, start, endian)\n : (this._parseBase(number, base, start),\n endian === \"le\" && this._initArray(this.toArray(), base, endian)));\n }),\n (BN.prototype._initNumber = function (number, base, endian) {\n number < 0 && ((this.negative = 1), (number = -number)),\n number < 67108864\n ? ((this.words = [number & 67108863]), (this.length = 1))\n : number < 4503599627370496\n ? ((this.words = [number & 67108863, (number / 67108864) & 67108863]), (this.length = 2))\n : (assert(number < 9007199254740992),\n (this.words = [number & 67108863, (number / 67108864) & 67108863, 1]),\n (this.length = 3)),\n endian === \"le\" && this._initArray(this.toArray(), base, endian);\n }),\n (BN.prototype._initArray = function (number, base, endian) {\n if ((assert(typeof number.length == \"number\"), number.length <= 0))\n return (this.words = [0]), (this.length = 1), this;\n (this.length = Math.ceil(number.length / 3)), (this.words = new Array(this.length));\n for (var i = 0; i < this.length; i++) this.words[i] = 0;\n var j,\n w,\n off = 0;\n if (endian === \"be\")\n for (i = number.length - 1, j = 0; i >= 0; i -= 3)\n (w = number[i] | (number[i - 1] << 8) | (number[i - 2] << 16)),\n (this.words[j] |= (w << off) & 67108863),\n (this.words[j + 1] = (w >>> (26 - off)) & 67108863),\n (off += 24),\n off >= 26 && ((off -= 26), j++);\n else if (endian === \"le\")\n for (i = 0, j = 0; i < number.length; i += 3)\n (w = number[i] | (number[i + 1] << 8) | (number[i + 2] << 16)),\n (this.words[j] |= (w << off) & 67108863),\n (this.words[j + 1] = (w >>> (26 - off)) & 67108863),\n (off += 24),\n off >= 26 && ((off -= 26), j++);\n return this.strip();\n });\n function parseHex4Bits(string, index) {\n var c = string.charCodeAt(index);\n return c >= 65 && c <= 70 ? c - 55 : c >= 97 && c <= 102 ? c - 87 : (c - 48) & 15;\n }\n function parseHexByte(string, lowerBound, index) {\n var r = parseHex4Bits(string, index);\n return index - 1 >= lowerBound && (r |= parseHex4Bits(string, index - 1) << 4), r;\n }\n BN.prototype._parseHex = function (number, start, endian) {\n (this.length = Math.ceil((number.length - start) / 6)), (this.words = new Array(this.length));\n for (var i = 0; i < this.length; i++) this.words[i] = 0;\n var off = 0,\n j = 0,\n w;\n if (endian === \"be\")\n for (i = number.length - 1; i >= start; i -= 2)\n (w = parseHexByte(number, start, i) << off),\n (this.words[j] |= w & 67108863),\n off >= 18 ? ((off -= 18), (j += 1), (this.words[j] |= w >>> 26)) : (off += 8);\n else {\n var parseLength = number.length - start;\n for (i = parseLength % 2 === 0 ? start + 1 : start; i < number.length; i += 2)\n (w = parseHexByte(number, start, i) << off),\n (this.words[j] |= w & 67108863),\n off >= 18 ? ((off -= 18), (j += 1), (this.words[j] |= w >>> 26)) : (off += 8);\n }\n this.strip();\n };\n function parseBase(str, start, end, mul) {\n for (var r = 0, len = Math.min(str.length, end), i = start; i < len; i++) {\n var c = str.charCodeAt(i) - 48;\n (r *= mul), c >= 49 ? (r += c - 49 + 10) : c >= 17 ? (r += c - 17 + 10) : (r += c);\n }\n return r;\n }\n (BN.prototype._parseBase = function (number, base, start) {\n (this.words = [0]), (this.length = 1);\n for (var limbLen = 0, limbPow = 1; limbPow <= 67108863; limbPow *= base) limbLen++;\n limbLen--, (limbPow = (limbPow / base) | 0);\n for (\n var total = number.length - start,\n mod = total % limbLen,\n end = Math.min(total, total - mod) + start,\n word = 0,\n i = start;\n i < end;\n i += limbLen\n )\n (word = parseBase(number, i, i + limbLen, base)),\n this.imuln(limbPow),\n this.words[0] + word < 67108864 ? (this.words[0] += word) : this._iaddn(word);\n if (mod !== 0) {\n var pow = 1;\n for (word = parseBase(number, i, number.length, base), i = 0; i < mod; i++) pow *= base;\n this.imuln(pow), this.words[0] + word < 67108864 ? (this.words[0] += word) : this._iaddn(word);\n }\n this.strip();\n }),\n (BN.prototype.copy = function (dest) {\n dest.words = new Array(this.length);\n for (var i = 0; i < this.length; i++) dest.words[i] = this.words[i];\n (dest.length = this.length), (dest.negative = this.negative), (dest.red = this.red);\n }),\n (BN.prototype.clone = function () {\n var r = new BN(null);\n return this.copy(r), r;\n }),\n (BN.prototype._expand = function (size) {\n for (; this.length < size; ) this.words[this.length++] = 0;\n return this;\n }),\n (BN.prototype.strip = function () {\n for (; this.length > 1 && this.words[this.length - 1] === 0; ) this.length--;\n return this._normSign();\n }),\n (BN.prototype._normSign = function () {\n return this.length === 1 && this.words[0] === 0 && (this.negative = 0), this;\n }),\n (BN.prototype.inspect = function () {\n return (this.red ? \"<BN-R: \" : \"<BN: \") + this.toString(16) + \">\";\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 groupSizes = [\n 0, 0, 25, 16, 12, 11, 10, 9, 8, 8, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5,\n 5, 5,\n ],\n groupBases = [\n 0, 0, 33554432, 43046721, 16777216, 48828125, 60466176, 40353607, 16777216, 43046721, 1e7, 19487171, 35831808,\n 62748517, 7529536, 11390625, 16777216, 24137569, 34012224, 47045881, 64e6, 4084101, 5153632, 6436343, 7962624,\n 9765625, 11881376, 14348907, 17210368, 20511149, 243e5, 28629151, 33554432, 39135393, 45435424, 52521875,\n 60466176,\n ];\n (BN.prototype.toString = function (base, padding) {\n (base = base || 10), (padding = padding | 0 || 1);\n var out;\n if (base === 16 || base === \"hex\") {\n out = \"\";\n for (var off = 0, carry = 0, i = 0; i < this.length; i++) {\n var w = this.words[i],\n word = (((w << off) | carry) & 16777215).toString(16);\n (carry = (w >>> (24 - off)) & 16777215),\n carry !== 0 || i !== this.length - 1 ? (out = zeros[6 - word.length] + word + out) : (out = word + out),\n (off += 2),\n off >= 26 && ((off -= 26), i--);\n }\n for (carry !== 0 && (out = carry.toString(16) + out); out.length % padding !== 0; ) out = \"0\" + out;\n return this.negative !== 0 && (out = \"-\" + out), out;\n }\n if (base === (base | 0) && base >= 2 && base <= 36) {\n var groupSize = groupSizes[base],\n groupBase = groupBases[base];\n out = \"\";\n var c = this.clone();\n for (c.negative = 0; !c.isZero(); ) {\n var r = c.modn(groupBase).toString(base);\n (c = c.idivn(groupBase)), c.isZero() ? (out = r + out) : (out = zeros[groupSize - r.length] + r + out);\n }\n for (this.isZero() && (out = \"0\" + out); out.length % padding !== 0; ) out = \"0\" + out;\n return this.negative !== 0 && (out = \"-\" + out), out;\n }\n assert(!1, \"Base should be between 2 and 36\");\n }),\n (BN.prototype.toNumber = function () {\n var ret = this.words[0];\n return (\n this.length === 2\n ? (ret += this.words[1] * 67108864)\n : this.length === 3 && this.words[2] === 1\n ? (ret += 4503599627370496 + this.words[1] * 67108864)\n : this.length > 2 && assert(!1, \"Number can only safely store up to 53 bits\"),\n this.negative !== 0 ? -ret : ret\n );\n }),\n (BN.prototype.toJSON = function () {\n return this.toString(16);\n }),\n (BN.prototype.toBuffer = function (endian, length) {\n return assert(typeof Buffer2 < \"u\"), this.toArrayLike(Buffer2, endian, length);\n }),\n (BN.prototype.toArray = function (endian, length) {\n return this.toArrayLike(Array, endian, length);\n }),\n (BN.prototype.toArrayLike = function (ArrayType, endian, length) {\n var byteLength = this.byteLength(),\n 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 this.strip();\n var littleEndian = endian === \"le\",\n res = new ArrayType(reqLength),\n b,\n i,\n q = this.clone();\n if (littleEndian) {\n for (i = 0; !q.isZero(); i++) (b = q.andln(255)), q.iushrn(8), (res[i] = b);\n for (; i < reqLength; i++) res[i] = 0;\n } else {\n for (i = 0; i < reqLength - byteLength; i++) res[i] = 0;\n for (i = 0; !q.isZero(); i++) (b = q.andln(255)), q.iushrn(8), (res[reqLength - i - 1] = b);\n }\n return res;\n }),\n Math.clz32\n ? (BN.prototype._countBits = function (w) {\n return 32 - Math.clz32(w);\n })\n : (BN.prototype._countBits = function (w) {\n var t = w,\n r = 0;\n return (\n t >= 4096 && ((r += 13), (t >>>= 13)),\n t >= 64 && ((r += 7), (t >>>= 7)),\n t >= 8 && ((r += 4), (t >>>= 4)),\n t >= 2 && ((r += 2), (t >>>= 2)),\n r + t\n );\n }),\n (BN.prototype._zeroBits = function (w) {\n if (w === 0) return 26;\n var t = w,\n r = 0;\n return (\n (t & 8191) === 0 && ((r += 13), (t >>>= 13)),\n (t & 127) === 0 && ((r += 7), (t >>>= 7)),\n (t & 15) === 0 && ((r += 4), (t >>>= 4)),\n (t & 3) === 0 && ((r += 2), (t >>>= 2)),\n (t & 1) === 0 && r++,\n r\n );\n }),\n (BN.prototype.bitLength = function () {\n var w = this.words[this.length - 1],\n hi = this._countBits(w);\n return (this.length - 1) * 26 + hi;\n });\n function toBitArray(num) {\n for (var w = new Array(num.bitLength()), bit = 0; bit < w.length; bit++) {\n var off = (bit / 26) | 0,\n wbit = bit % 26;\n w[bit] = (num.words[off] & (1 << wbit)) >>> wbit;\n }\n return w;\n }\n (BN.prototype.zeroBits = function () {\n if (this.isZero()) return 0;\n for (var r = 0, i = 0; i < this.length; i++) {\n var b = this._zeroBits(this.words[i]);\n if (((r += b), b !== 26)) break;\n }\n return r;\n }),\n (BN.prototype.byteLength = function () {\n return Math.ceil(this.bitLength() / 8);\n }),\n (BN.prototype.toTwos = function (width) {\n return this.negative !== 0 ? this.abs().inotn(width).iaddn(1) : this.clone();\n }),\n (BN.prototype.fromTwos = function (width) {\n return this.testn(width - 1) ? this.notn(width).iaddn(1).ineg() : this.clone();\n }),\n (BN.prototype.isNeg = function () {\n return this.negative !== 0;\n }),\n (BN.prototype.neg = function () {\n return this.clone().ineg();\n }),\n (BN.prototype.ineg = function () {\n return this.isZero() || (this.negative ^= 1), this;\n }),\n (BN.prototype.iuor = function (num) {\n for (; this.length < num.length; ) this.words[this.length++] = 0;\n for (var i = 0; i < num.length; i++) this.words[i] = this.words[i] | num.words[i];\n return this.strip();\n }),\n (BN.prototype.ior = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuor(num);\n }),\n (BN.prototype.or = function (num) {\n return this.length > num.length ? this.clone().ior(num) : num.clone().ior(this);\n }),\n (BN.prototype.uor = function (num) {\n return this.length > num.length ? this.clone().iuor(num) : num.clone().iuor(this);\n }),\n (BN.prototype.iuand = function (num) {\n var b;\n this.length > num.length ? (b = num) : (b = this);\n for (var i = 0; i < b.length; i++) this.words[i] = this.words[i] & num.words[i];\n return (this.length = b.length), this.strip();\n }),\n (BN.prototype.iand = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuand(num);\n }),\n (BN.prototype.and = function (num) {\n return this.length > num.length ? this.clone().iand(num) : num.clone().iand(this);\n }),\n (BN.prototype.uand = function (num) {\n return this.length > num.length ? this.clone().iuand(num) : num.clone().iuand(this);\n }),\n (BN.prototype.iuxor = function (num) {\n var a, b;\n this.length > num.length ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var i = 0; i < b.length; i++) this.words[i] = a.words[i] ^ b.words[i];\n if (this !== a) for (; i < a.length; i++) this.words[i] = a.words[i];\n return (this.length = a.length), this.strip();\n }),\n (BN.prototype.ixor = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuxor(num);\n }),\n (BN.prototype.xor = function (num) {\n return this.length > num.length ? this.clone().ixor(num) : num.clone().ixor(this);\n }),\n (BN.prototype.uxor = function (num) {\n return this.length > num.length ? this.clone().iuxor(num) : num.clone().iuxor(this);\n }),\n (BN.prototype.inotn = function (width) {\n assert(typeof width == \"number\" && width >= 0);\n var bytesNeeded = Math.ceil(width / 26) | 0,\n bitsLeft = width % 26;\n this._expand(bytesNeeded), bitsLeft > 0 && bytesNeeded--;\n for (var i = 0; i < bytesNeeded; i++) this.words[i] = ~this.words[i] & 67108863;\n return bitsLeft > 0 && (this.words[i] = ~this.words[i] & (67108863 >> (26 - bitsLeft))), this.strip();\n }),\n (BN.prototype.notn = function (width) {\n return this.clone().inotn(width);\n }),\n (BN.prototype.setn = function (bit, val) {\n assert(typeof bit == \"number\" && bit >= 0);\n var off = (bit / 26) | 0,\n wbit = bit % 26;\n return (\n this._expand(off + 1),\n val\n ? (this.words[off] = this.words[off] | (1 << wbit))\n : (this.words[off] = this.words[off] & ~(1 << wbit)),\n this.strip()\n );\n }),\n (BN.prototype.iadd = function (num) {\n var r;\n if (this.negative !== 0 && num.negative === 0)\n return (this.negative = 0), (r = this.isub(num)), (this.negative ^= 1), this._normSign();\n if (this.negative === 0 && num.negative !== 0)\n return (num.negative = 0), (r = this.isub(num)), (num.negative = 1), r._normSign();\n var a, b;\n this.length > num.length ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var carry = 0, i = 0; i < b.length; i++)\n (r = (a.words[i] | 0) + (b.words[i] | 0) + carry), (this.words[i] = r & 67108863), (carry = r >>> 26);\n for (; carry !== 0 && i < a.length; i++)\n (r = (a.words[i] | 0) + carry), (this.words[i] = r & 67108863), (carry = r >>> 26);\n if (((this.length = a.length), carry !== 0)) (this.words[this.length] = carry), this.length++;\n else if (a !== this) for (; i < a.length; i++) this.words[i] = a.words[i];\n return this;\n }),\n (BN.prototype.add = function (num) {\n var res;\n return num.negative !== 0 && this.negative === 0\n ? ((num.negative = 0), (res = this.sub(num)), (num.negative ^= 1), res)\n : num.negative === 0 && this.negative !== 0\n ? ((this.negative = 0), (res = num.sub(this)), (this.negative = 1), res)\n : this.length > num.length\n ? this.clone().iadd(num)\n : num.clone().iadd(this);\n }),\n (BN.prototype.isub = function (num) {\n if (num.negative !== 0) {\n num.negative = 0;\n var r = this.iadd(num);\n return (num.negative = 1), r._normSign();\n } else if (this.negative !== 0)\n return (this.negative = 0), this.iadd(num), (this.negative = 1), this._normSign();\n var cmp = this.cmp(num);\n if (cmp === 0) return (this.negative = 0), (this.length = 1), (this.words[0] = 0), this;\n var a, b;\n cmp > 0 ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var carry = 0, i = 0; i < b.length; i++)\n (r = (a.words[i] | 0) - (b.words[i] | 0) + carry), (carry = r >> 26), (this.words[i] = r & 67108863);\n for (; carry !== 0 && i < a.length; i++)\n (r = (a.words[i] | 0) + carry), (carry = r >> 26), (this.words[i] = r & 67108863);\n if (carry === 0 && i < a.length && a !== this) for (; i < a.length; i++) this.words[i] = a.words[i];\n return (this.length = Math.max(this.length, i)), a !== this && (this.negative = 1), this.strip();\n }),\n (BN.prototype.sub = function (num) {\n return this.clone().isub(num);\n });\n function smallMulTo(self2, num, out) {\n out.negative = num.negative ^ self2.negative;\n var len = (self2.length + num.length) | 0;\n (out.length = len), (len = (len - 1) | 0);\n var a = self2.words[0] | 0,\n b = num.words[0] | 0,\n r = a * b,\n lo = r & 67108863,\n carry = (r / 67108864) | 0;\n out.words[0] = lo;\n for (var k = 1; k < len; k++) {\n for (\n var ncarry = carry >>> 26,\n rword = carry & 67108863,\n maxJ = Math.min(k, num.length - 1),\n j = Math.max(0, k - self2.length + 1);\n j <= maxJ;\n j++\n ) {\n var i = (k - j) | 0;\n (a = self2.words[i] | 0),\n (b = num.words[j] | 0),\n (r = a * b + rword),\n (ncarry += (r / 67108864) | 0),\n (rword = r & 67108863);\n }\n (out.words[k] = rword | 0), (carry = ncarry | 0);\n }\n return carry !== 0 ? (out.words[k] = carry | 0) : out.length--, out.strip();\n }\n var comb10MulTo = function (self2, num, out) {\n var a = self2.words,\n b = num.words,\n o = out.words,\n c = 0,\n lo,\n mid,\n hi,\n a0 = a[0] | 0,\n al0 = a0 & 8191,\n ah0 = a0 >>> 13,\n a1 = a[1] | 0,\n al1 = a1 & 8191,\n ah1 = a1 >>> 13,\n a2 = a[2] | 0,\n al2 = a2 & 8191,\n ah2 = a2 >>> 13,\n a3 = a[3] | 0,\n al3 = a3 & 8191,\n ah3 = a3 >>> 13,\n a4 = a[4] | 0,\n al4 = a4 & 8191,\n ah4 = a4 >>> 13,\n a5 = a[5] | 0,\n al5 = a5 & 8191,\n ah5 = a5 >>> 13,\n a6 = a[6] | 0,\n al6 = a6 & 8191,\n ah6 = a6 >>> 13,\n a7 = a[7] | 0,\n al7 = a7 & 8191,\n ah7 = a7 >>> 13,\n a8 = a[8] | 0,\n al8 = a8 & 8191,\n ah8 = a8 >>> 13,\n a9 = a[9] | 0,\n al9 = a9 & 8191,\n ah9 = a9 >>> 13,\n b0 = b[0] | 0,\n bl0 = b0 & 8191,\n bh0 = b0 >>> 13,\n b1 = b[1] | 0,\n bl1 = b1 & 8191,\n bh1 = b1 >>> 13,\n b2 = b[2] | 0,\n bl2 = b2 & 8191,\n bh2 = b2 >>> 13,\n b3 = b[3] | 0,\n bl3 = b3 & 8191,\n bh3 = b3 >>> 13,\n b4 = b[4] | 0,\n bl4 = b4 & 8191,\n bh4 = b4 >>> 13,\n b5 = b[5] | 0,\n bl5 = b5 & 8191,\n bh5 = b5 >>> 13,\n b6 = b[6] | 0,\n bl6 = b6 & 8191,\n bh6 = b6 >>> 13,\n b7 = b[7] | 0,\n bl7 = b7 & 8191,\n bh7 = b7 >>> 13,\n b8 = b[8] | 0,\n bl8 = b8 & 8191,\n bh8 = b8 >>> 13,\n b9 = b[9] | 0,\n bl9 = b9 & 8191,\n bh9 = b9 >>> 13;\n (out.negative = self2.negative ^ num.negative),\n (out.length = 19),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w0 >>> 26)) | 0),\n (w0 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w1 >>> 26)) | 0),\n (w1 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w2 >>> 26)) | 0),\n (w2 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w3 >>> 26)) | 0),\n (w3 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w4 >>> 26)) | 0),\n (w4 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w5 >>> 26)) | 0),\n (w5 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w6 >>> 26)) | 0),\n (w6 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w7 >>> 26)) | 0),\n (w7 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w8 >>> 26)) | 0),\n (w8 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w9 >>> 26)) | 0),\n (w9 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w10 >>> 26)) | 0),\n (w10 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w11 >>> 26)) | 0),\n (w11 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w12 >>> 26)) | 0),\n (w12 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w13 >>> 26)) | 0),\n (w13 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w14 >>> 26)) | 0),\n (w14 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w15 >>> 26)) | 0),\n (w15 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w16 >>> 26)) | 0),\n (w16 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w17 >>> 26)) | 0),\n (w17 &= 67108863),\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 & 8191) << 13)) | 0;\n return (\n (c = (((hi + (mid >>> 13)) | 0) + (w18 >>> 26)) | 0),\n (w18 &= 67108863),\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 c !== 0 && ((o[19] = c), out.length++),\n out\n );\n };\n Math.imul || (comb10MulTo = smallMulTo);\n function bigMulTo(self2, num, out) {\n (out.negative = num.negative ^ self2.negative), (out.length = self2.length + num.length);\n for (var carry = 0, hncarry = 0, k = 0; k < out.length - 1; k++) {\n var ncarry = hncarry;\n hncarry = 0;\n for (\n var rword = carry & 67108863, maxJ = Math.min(k, num.length - 1), j = Math.max(0, k - self2.length + 1);\n j <= maxJ;\n j++\n ) {\n var i = k - j,\n a = self2.words[i] | 0,\n b = num.words[j] | 0,\n r = a * b,\n lo = r & 67108863;\n (ncarry = (ncarry + ((r / 67108864) | 0)) | 0),\n (lo = (lo + rword) | 0),\n (rword = lo & 67108863),\n (ncarry = (ncarry + (lo >>> 26)) | 0),\n (hncarry += ncarry >>> 26),\n (ncarry &= 67108863);\n }\n (out.words[k] = rword), (carry = ncarry), (ncarry = hncarry);\n }\n return carry !== 0 ? (out.words[k] = carry) : out.length--, out.strip();\n }\n function jumboMulTo(self2, num, out) {\n var fftm = new FFTM();\n return fftm.mulp(self2, num, out);\n }\n BN.prototype.mulTo = function (num, out) {\n var res,\n len = this.length + num.length;\n return (\n this.length === 10 && num.length === 10\n ? (res = comb10MulTo(this, num, out))\n : len < 63\n ? (res = smallMulTo(this, num, out))\n : len < 1024\n ? (res = bigMulTo(this, num, out))\n : (res = jumboMulTo(this, num, out)),\n res\n );\n };\n function FFTM(x, y) {\n (this.x = x), (this.y = y);\n }\n (FFTM.prototype.makeRBT = function (N) {\n for (var t = new Array(N), l = BN.prototype._countBits(N) - 1, i = 0; i < N; i++) t[i] = this.revBin(i, l, N);\n return t;\n }),\n (FFTM.prototype.revBin = function (x, l, N) {\n if (x === 0 || x === N - 1) return x;\n for (var rb = 0, i = 0; i < l; i++) (rb |= (x & 1) << (l - i - 1)), (x >>= 1);\n return rb;\n }),\n (FFTM.prototype.permute = function (rbt, rws, iws, rtws, itws, N) {\n for (var i = 0; i < N; i++) (rtws[i] = rws[rbt[i]]), (itws[i] = iws[rbt[i]]);\n }),\n (FFTM.prototype.transform = function (rws, iws, rtws, itws, N, rbt) {\n this.permute(rbt, rws, iws, rtws, itws, N);\n for (var s = 1; s < N; s <<= 1)\n for (\n var l = s << 1, rtwdf = Math.cos((2 * Math.PI) / l), itwdf = Math.sin((2 * Math.PI) / l), p = 0;\n p < N;\n p += l\n )\n for (var rtwdf_ = rtwdf, itwdf_ = itwdf, j = 0; j < s; j++) {\n var re = rtws[p + j],\n ie = itws[p + j],\n ro = rtws[p + j + s],\n io = itws[p + j + s],\n rx = rtwdf_ * ro - itwdf_ * io;\n (io = rtwdf_ * io + itwdf_ * ro),\n (ro = rx),\n (rtws[p + j] = re + ro),\n (itws[p + j] = ie + io),\n (rtws[p + j + s] = re - ro),\n (itws[p + j + s] = ie - io),\n j !== l &&\n ((rx = rtwdf * rtwdf_ - itwdf * itwdf_), (itwdf_ = rtwdf * itwdf_ + itwdf * rtwdf_), (rtwdf_ = rx));\n }\n }),\n (FFTM.prototype.guessLen13b = function (n, m) {\n var N = Math.max(m, n) | 1,\n odd = N & 1,\n i = 0;\n for (N = (N / 2) | 0; N; N = N >>> 1) i++;\n return 1 << (i + 1 + odd);\n }),\n (FFTM.prototype.conjugate = function (rws, iws, N) {\n if (!(N <= 1))\n for (var i = 0; i < N / 2; i++) {\n var t = rws[i];\n (rws[i] = rws[N - i - 1]),\n (rws[N - i - 1] = t),\n (t = iws[i]),\n (iws[i] = -iws[N - i - 1]),\n (iws[N - i - 1] = -t);\n }\n }),\n (FFTM.prototype.normalize13b = function (ws, N) {\n for (var carry = 0, i = 0; i < N / 2; i++) {\n var w = Math.round(ws[2 * i + 1] / N) * 8192 + Math.round(ws[2 * i] / N) + carry;\n (ws[i] = w & 67108863), w < 67108864 ? (carry = 0) : (carry = (w / 67108864) | 0);\n }\n return ws;\n }),\n (FFTM.prototype.convert13b = function (ws, len, rws, N) {\n for (var carry = 0, i = 0; i < len; i++)\n (carry = carry + (ws[i] | 0)),\n (rws[2 * i] = carry & 8191),\n (carry = carry >>> 13),\n (rws[2 * i + 1] = carry & 8191),\n (carry = carry >>> 13);\n for (i = 2 * len; i < N; ++i) rws[i] = 0;\n assert(carry === 0), assert((carry & -8192) === 0);\n }),\n (FFTM.prototype.stub = function (N) {\n for (var ph = new Array(N), i = 0; i < N; i++) ph[i] = 0;\n return ph;\n }),\n (FFTM.prototype.mulp = function (x, y, out) {\n var N = 2 * this.guessLen13b(x.length, y.length),\n rbt = this.makeRBT(N),\n _ = this.stub(N),\n rws = new Array(N),\n rwst = new Array(N),\n iwst = new Array(N),\n nrws = new Array(N),\n nrwst = new Array(N),\n niwst = new Array(N),\n rmws = out.words;\n (rmws.length = N),\n this.convert13b(x.words, x.length, rws, N),\n this.convert13b(y.words, y.length, nrws, N),\n this.transform(rws, _, rwst, iwst, N, rbt),\n this.transform(nrws, _, nrwst, niwst, N, rbt);\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]), (rwst[i] = rx);\n }\n return (\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 (out.negative = x.negative ^ y.negative),\n (out.length = x.length + y.length),\n out.strip()\n );\n }),\n (BN.prototype.mul = function (num) {\n var out = new BN(null);\n return (out.words = new Array(this.length + num.length)), this.mulTo(num, out);\n }),\n (BN.prototype.mulf = function (num) {\n var out = new BN(null);\n return (out.words = new Array(this.length + num.length)), jumboMulTo(this, num, out);\n }),\n (BN.prototype.imul = function (num) {\n return this.clone().mulTo(num, this);\n }),\n (BN.prototype.imuln = function (num) {\n assert(typeof num == \"number\"), assert(num < 67108864);\n for (var carry = 0, i = 0; i < this.length; i++) {\n var w = (this.words[i] | 0) * num,\n lo = (w & 67108863) + (carry & 67108863);\n (carry >>= 26), (carry += (w / 67108864) | 0), (carry += lo >>> 26), (this.words[i] = lo & 67108863);\n }\n return carry !== 0 && ((this.words[i] = carry), this.length++), this;\n }),\n (BN.prototype.muln = function (num) {\n return this.clone().imuln(num);\n }),\n (BN.prototype.sqr = function () {\n return this.mul(this);\n }),\n (BN.prototype.isqr = function () {\n return this.imul(this.clone());\n }),\n (BN.prototype.pow = function (num) {\n var w = toBitArray(num);\n if (w.length === 0) return new BN(1);\n for (var res = this, i = 0; i < w.length && w[i] === 0; i++, res = res.sqr());\n if (++i < w.length) for (var q = res.sqr(); i < w.length; i++, q = q.sqr()) w[i] !== 0 && (res = res.mul(q));\n return res;\n }),\n (BN.prototype.iushln = function (bits) {\n assert(typeof bits == \"number\" && bits >= 0);\n var r = bits % 26,\n s = (bits - r) / 26,\n carryMask = (67108863 >>> (26 - r)) << (26 - r),\n i;\n if (r !== 0) {\n var carry = 0;\n for (i = 0; i < this.length; i++) {\n var newCarry = this.words[i] & carryMask,\n c = ((this.words[i] | 0) - newCarry) << r;\n (this.words[i] = c | carry), (carry = newCarry >>> (26 - r));\n }\n carry && ((this.words[i] = carry), this.length++);\n }\n if (s !== 0) {\n for (i = this.length - 1; i >= 0; i--) this.words[i + s] = this.words[i];\n for (i = 0; i < s; i++) this.words[i] = 0;\n this.length += s;\n }\n return this.strip();\n }),\n (BN.prototype.ishln = function (bits) {\n return assert(this.negative === 0), this.iushln(bits);\n }),\n (BN.prototype.iushrn = function (bits, hint, extended) {\n assert(typeof bits == \"number\" && bits >= 0);\n var h;\n hint ? (h = (hint - (hint % 26)) / 26) : (h = 0);\n var r = bits % 26,\n s = Math.min((bits - r) / 26, this.length),\n mask = 67108863 ^ ((67108863 >>> r) << r),\n maskedWords = extended;\n if (((h -= s), (h = Math.max(0, h)), maskedWords)) {\n for (var i = 0; i < s; i++) maskedWords.words[i] = this.words[i];\n maskedWords.length = s;\n }\n if (s !== 0)\n if (this.length > s) for (this.length -= s, i = 0; i < this.length; i++) this.words[i] = this.words[i + s];\n else (this.words[0] = 0), (this.length = 1);\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)), (carry = word & mask);\n }\n return (\n maskedWords && carry !== 0 && (maskedWords.words[maskedWords.length++] = carry),\n this.length === 0 && ((this.words[0] = 0), (this.length = 1)),\n this.strip()\n );\n }),\n (BN.prototype.ishrn = function (bits, hint, extended) {\n return assert(this.negative === 0), this.iushrn(bits, hint, extended);\n }),\n (BN.prototype.shln = function (bits) {\n return this.clone().ishln(bits);\n }),\n (BN.prototype.ushln = function (bits) {\n return this.clone().iushln(bits);\n }),\n (BN.prototype.shrn = function (bits) {\n return this.clone().ishrn(bits);\n }),\n (BN.prototype.ushrn = function (bits) {\n return this.clone().iushrn(bits);\n }),\n (BN.prototype.testn = function (bit) {\n assert(typeof bit == \"number\" && bit >= 0);\n var r = bit % 26,\n s = (bit - r) / 26,\n q = 1 << r;\n if (this.length <= s) return !1;\n var w = this.words[s];\n return !!(w & q);\n }),\n (BN.prototype.imaskn = function (bits) {\n assert(typeof bits == \"number\" && bits >= 0);\n var r = bits % 26,\n s = (bits - r) / 26;\n if ((assert(this.negative === 0, \"imaskn works only with positive numbers\"), this.length <= s)) return this;\n if ((r !== 0 && s++, (this.length = Math.min(s, this.length)), r !== 0)) {\n var mask = 67108863 ^ ((67108863 >>> r) << r);\n this.words[this.length - 1] &= mask;\n }\n return this.strip();\n }),\n (BN.prototype.maskn = function (bits) {\n return this.clone().imaskn(bits);\n }),\n (BN.prototype.iaddn = function (num) {\n return (\n assert(typeof num == \"number\"),\n assert(num < 67108864),\n num < 0\n ? this.isubn(-num)\n : this.negative !== 0\n ? this.length === 1 && (this.words[0] | 0) < num\n ? ((this.words[0] = num - (this.words[0] | 0)), (this.negative = 0), this)\n : ((this.negative = 0), this.isubn(num), (this.negative = 1), this)\n : this._iaddn(num)\n );\n }),\n (BN.prototype._iaddn = function (num) {\n this.words[0] += num;\n for (var i = 0; i < this.length && this.words[i] >= 67108864; i++)\n (this.words[i] -= 67108864), i === this.length - 1 ? (this.words[i + 1] = 1) : this.words[i + 1]++;\n return (this.length = Math.max(this.length, i + 1)), this;\n }),\n (BN.prototype.isubn = function (num) {\n if ((assert(typeof num == \"number\"), assert(num < 67108864), num < 0)) return this.iaddn(-num);\n if (this.negative !== 0) return (this.negative = 0), this.iaddn(num), (this.negative = 1), this;\n if (((this.words[0] -= num), this.length === 1 && this.words[0] < 0))\n (this.words[0] = -this.words[0]), (this.negative = 1);\n else\n for (var i = 0; i < this.length && this.words[i] < 0; i++)\n (this.words[i] += 67108864), (this.words[i + 1] -= 1);\n return this.strip();\n }),\n (BN.prototype.addn = function (num) {\n return this.clone().iaddn(num);\n }),\n (BN.prototype.subn = function (num) {\n return this.clone().isubn(num);\n }),\n (BN.prototype.iabs = function () {\n return (this.negative = 0), this;\n }),\n (BN.prototype.abs = function () {\n return this.clone().iabs();\n }),\n (BN.prototype._ishlnsubmul = function (num, mul, shift) {\n var len = num.length + shift,\n i;\n this._expand(len);\n var w,\n 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 & 67108863),\n (carry = (w >> 26) - ((right / 67108864) | 0)),\n (this.words[i + shift] = w & 67108863);\n }\n for (; i < this.length - shift; i++)\n (w = (this.words[i + shift] | 0) + carry), (carry = w >> 26), (this.words[i + shift] = w & 67108863);\n if (carry === 0) return this.strip();\n for (assert(carry === -1), carry = 0, i = 0; i < this.length; i++)\n (w = -(this.words[i] | 0) + carry), (carry = w >> 26), (this.words[i] = w & 67108863);\n return (this.negative = 1), this.strip();\n }),\n (BN.prototype._wordDiv = function (num, mode) {\n var shift = this.length - num.length,\n a = this.clone(),\n b = num,\n bhi = b.words[b.length - 1] | 0,\n bhiBits = this._countBits(bhi);\n (shift = 26 - bhiBits),\n shift !== 0 && ((b = b.ushln(shift)), a.iushln(shift), (bhi = b.words[b.length - 1] | 0));\n var m = a.length - b.length,\n q;\n if (mode !== \"mod\") {\n (q = new BN(null)), (q.length = m + 1), (q.words = new Array(q.length));\n for (var i = 0; i < q.length; i++) q.words[i] = 0;\n }\n var diff = a.clone()._ishlnsubmul(b, 1, m);\n diff.negative === 0 && ((a = diff), q && (q.words[m] = 1));\n for (var j = m - 1; j >= 0; j--) {\n var qj = (a.words[b.length + j] | 0) * 67108864 + (a.words[b.length + j - 1] | 0);\n for (qj = Math.min((qj / bhi) | 0, 67108863), a._ishlnsubmul(b, qj, j); a.negative !== 0; )\n qj--, (a.negative = 0), a._ishlnsubmul(b, 1, j), a.isZero() || (a.negative ^= 1);\n q && (q.words[j] = qj);\n }\n return (\n q && q.strip(),\n a.strip(),\n mode !== \"div\" && shift !== 0 && a.iushrn(shift),\n {\n div: q || null,\n mod: a,\n }\n );\n }),\n (BN.prototype.divmod = function (num, mode, positive) {\n if ((assert(!num.isZero()), this.isZero()))\n return {\n div: new BN(0),\n mod: new BN(0),\n };\n var div, mod, res;\n return this.negative !== 0 && num.negative === 0\n ? ((res = this.neg().divmod(num, mode)),\n mode !== \"mod\" && (div = res.div.neg()),\n mode !== \"div\" && ((mod = res.mod.neg()), positive && mod.negative !== 0 && mod.iadd(num)),\n {\n div,\n mod,\n })\n : this.negative === 0 && num.negative !== 0\n ? ((res = this.divmod(num.neg(), mode)),\n mode !== \"mod\" && (div = res.div.neg()),\n {\n div,\n mod: res.mod,\n })\n : (this.negative & num.negative) !== 0\n ? ((res = this.neg().divmod(num.neg(), mode)),\n mode !== \"div\" && ((mod = res.mod.neg()), positive && mod.negative !== 0 && mod.isub(num)),\n {\n div: res.div,\n mod,\n })\n : num.length > this.length || this.cmp(num) < 0\n ? {\n div: new BN(0),\n mod: this,\n }\n : num.length === 1\n ? mode === \"div\"\n ? {\n div: this.divn(num.words[0]),\n mod: null,\n }\n : mode === \"mod\"\n ? {\n div: null,\n mod: new BN(this.modn(num.words[0])),\n }\n : {\n div: this.divn(num.words[0]),\n mod: new BN(this.modn(num.words[0])),\n }\n : this._wordDiv(num, mode);\n }),\n (BN.prototype.div = function (num) {\n return this.divmod(num, \"div\", !1).div;\n }),\n (BN.prototype.mod = function (num) {\n return this.divmod(num, \"mod\", !1).mod;\n }),\n (BN.prototype.umod = function (num) {\n return this.divmod(num, \"mod\", !0).mod;\n }),\n (BN.prototype.divRound = function (num) {\n var dm = this.divmod(num);\n if (dm.mod.isZero()) return dm.div;\n var mod = dm.div.negative !== 0 ? dm.mod.isub(num) : dm.mod,\n half = num.ushrn(1),\n r2 = num.andln(1),\n cmp = mod.cmp(half);\n return cmp < 0 || (r2 === 1 && cmp === 0)\n ? dm.div\n : dm.div.negative !== 0\n ? dm.div.isubn(1)\n : dm.div.iaddn(1);\n }),\n (BN.prototype.modn = function (num) {\n assert(num <= 67108863);\n for (var p = (1 << 26) % num, acc = 0, i = this.length - 1; i >= 0; i--)\n acc = (p * acc + (this.words[i] | 0)) % num;\n return acc;\n }),\n (BN.prototype.idivn = function (num) {\n assert(num <= 67108863);\n for (var carry = 0, i = this.length - 1; i >= 0; i--) {\n var w = (this.words[i] | 0) + carry * 67108864;\n (this.words[i] = (w / num) | 0), (carry = w % num);\n }\n return this.strip();\n }),\n (BN.prototype.divn = function (num) {\n return this.clone().idivn(num);\n }),\n (BN.prototype.egcd = function (p) {\n assert(p.negative === 0), assert(!p.isZero());\n var x = this,\n y = p.clone();\n x.negative !== 0 ? (x = x.umod(p)) : (x = x.clone());\n for (var A = new BN(1), B = new BN(0), C = new BN(0), D = new BN(1), g = 0; x.isEven() && y.isEven(); )\n x.iushrn(1), y.iushrn(1), ++g;\n for (var yp = y.clone(), xp = x.clone(); !x.isZero(); ) {\n for (var i = 0, im = 1; (x.words[0] & im) === 0 && i < 26; ++i, im <<= 1);\n if (i > 0)\n for (x.iushrn(i); i-- > 0; )\n (A.isOdd() || B.isOdd()) && (A.iadd(yp), B.isub(xp)), A.iushrn(1), B.iushrn(1);\n for (var j = 0, jm = 1; (y.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n if (j > 0)\n for (y.iushrn(j); j-- > 0; )\n (C.isOdd() || D.isOdd()) && (C.iadd(yp), D.isub(xp)), C.iushrn(1), D.iushrn(1);\n x.cmp(y) >= 0 ? (x.isub(y), A.isub(C), B.isub(D)) : (y.isub(x), C.isub(A), D.isub(B));\n }\n return {\n a: C,\n b: D,\n gcd: y.iushln(g),\n };\n }),\n (BN.prototype._invmp = function (p) {\n assert(p.negative === 0), assert(!p.isZero());\n var a = this,\n b = p.clone();\n a.negative !== 0 ? (a = a.umod(p)) : (a = a.clone());\n for (var x1 = new BN(1), x2 = new BN(0), delta = b.clone(); 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) for (a.iushrn(i); i-- > 0; ) x1.isOdd() && x1.iadd(delta), x1.iushrn(1);\n for (var j = 0, jm = 1; (b.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n if (j > 0) for (b.iushrn(j); j-- > 0; ) x2.isOdd() && x2.iadd(delta), x2.iushrn(1);\n a.cmp(b) >= 0 ? (a.isub(b), x1.isub(x2)) : (b.isub(a), x2.isub(x1));\n }\n var res;\n return a.cmpn(1) === 0 ? (res = x1) : (res = x2), res.cmpn(0) < 0 && res.iadd(p), res;\n }),\n (BN.prototype.gcd = function (num) {\n if (this.isZero()) return num.abs();\n if (num.isZero()) return this.abs();\n var a = this.clone(),\n b = num.clone();\n (a.negative = 0), (b.negative = 0);\n for (var shift = 0; a.isEven() && b.isEven(); shift++) a.iushrn(1), b.iushrn(1);\n do {\n for (; a.isEven(); ) a.iushrn(1);\n for (; b.isEven(); ) b.iushrn(1);\n var r = a.cmp(b);\n if (r < 0) {\n var t = a;\n (a = b), (b = t);\n } else if (r === 0 || b.cmpn(1) === 0) break;\n a.isub(b);\n } while (!0);\n return b.iushln(shift);\n }),\n (BN.prototype.invm = function (num) {\n return this.egcd(num).a.umod(num);\n }),\n (BN.prototype.isEven = function () {\n return (this.words[0] & 1) === 0;\n }),\n (BN.prototype.isOdd = function () {\n return (this.words[0] & 1) === 1;\n }),\n (BN.prototype.andln = function (num) {\n return this.words[0] & num;\n }),\n (BN.prototype.bincn = function (bit) {\n assert(typeof bit == \"number\");\n var r = bit % 26,\n s = (bit - r) / 26,\n q = 1 << r;\n if (this.length <= s) return this._expand(s + 1), (this.words[s] |= q), this;\n for (var carry = q, i = s; carry !== 0 && i < this.length; i++) {\n var w = this.words[i] | 0;\n (w += carry), (carry = w >>> 26), (w &= 67108863), (this.words[i] = w);\n }\n return carry !== 0 && ((this.words[i] = carry), this.length++), this;\n }),\n (BN.prototype.isZero = function () {\n return this.length === 1 && this.words[0] === 0;\n }),\n (BN.prototype.cmpn = function (num) {\n var negative = num < 0;\n if (this.negative !== 0 && !negative) return -1;\n if (this.negative === 0 && negative) return 1;\n this.strip();\n var res;\n if (this.length > 1) res = 1;\n else {\n negative && (num = -num), assert(num <= 67108863, \"Number is too big\");\n var w = this.words[0] | 0;\n res = w === num ? 0 : w < num ? -1 : 1;\n }\n return this.negative !== 0 ? -res | 0 : res;\n }),\n (BN.prototype.cmp = function (num) {\n if (this.negative !== 0 && num.negative === 0) return -1;\n if (this.negative === 0 && num.negative !== 0) return 1;\n var res = this.ucmp(num);\n return this.negative !== 0 ? -res | 0 : res;\n }),\n (BN.prototype.ucmp = function (num) {\n if (this.length > num.length) return 1;\n if (this.length < num.length) return -1;\n for (var res = 0, i = this.length - 1; i >= 0; i--) {\n var a = this.words[i] | 0,\n b = num.words[i] | 0;\n if (a !== b) {\n a < b ? (res = -1) : a > b && (res = 1);\n break;\n }\n }\n return res;\n }),\n (BN.prototype.gtn = function (num) {\n return this.cmpn(num) === 1;\n }),\n (BN.prototype.gt = function (num) {\n return this.cmp(num) === 1;\n }),\n (BN.prototype.gten = function (num) {\n return this.cmpn(num) >= 0;\n }),\n (BN.prototype.gte = function (num) {\n return this.cmp(num) >= 0;\n }),\n (BN.prototype.ltn = function (num) {\n return this.cmpn(num) === -1;\n }),\n (BN.prototype.lt = function (num) {\n return this.cmp(num) === -1;\n }),\n (BN.prototype.lten = function (num) {\n return this.cmpn(num) <= 0;\n }),\n (BN.prototype.lte = function (num) {\n return this.cmp(num) <= 0;\n }),\n (BN.prototype.eqn = function (num) {\n return this.cmpn(num) === 0;\n }),\n (BN.prototype.eq = function (num) {\n return this.cmp(num) === 0;\n }),\n (BN.red = function (num) {\n return new Red(num);\n }),\n (BN.prototype.toRed = function (ctx) {\n return (\n assert(!this.red, \"Already a number in reduction context\"),\n assert(this.negative === 0, \"red works only with positives\"),\n ctx.convertTo(this)._forceRed(ctx)\n );\n }),\n (BN.prototype.fromRed = function () {\n return assert(this.red, \"fromRed works only with numbers in reduction context\"), this.red.convertFrom(this);\n }),\n (BN.prototype._forceRed = function (ctx) {\n return (this.red = ctx), this;\n }),\n (BN.prototype.forceRed = function (ctx) {\n return assert(!this.red, \"Already a number in reduction context\"), this._forceRed(ctx);\n }),\n (BN.prototype.redAdd = function (num) {\n return assert(this.red, \"redAdd works only with red numbers\"), this.red.add(this, num);\n }),\n (BN.prototype.redIAdd = function (num) {\n return assert(this.red, \"redIAdd works only with red numbers\"), this.red.iadd(this, num);\n }),\n (BN.prototype.redSub = function (num) {\n return assert(this.red, \"redSub works only with red numbers\"), this.red.sub(this, num);\n }),\n (BN.prototype.redISub = function (num) {\n return assert(this.red, \"redISub works only with red numbers\"), this.red.isub(this, num);\n }),\n (BN.prototype.redShl = function (num) {\n return assert(this.red, \"redShl works only with red numbers\"), this.red.shl(this, num);\n }),\n (BN.prototype.redMul = function (num) {\n return (\n assert(this.red, \"redMul works only with red numbers\"),\n this.red._verify2(this, num),\n this.red.mul(this, num)\n );\n }),\n (BN.prototype.redIMul = function (num) {\n return (\n assert(this.red, \"redMul works only with red numbers\"),\n this.red._verify2(this, num),\n this.red.imul(this, num)\n );\n }),\n (BN.prototype.redSqr = function () {\n return assert(this.red, \"redSqr works only with red numbers\"), this.red._verify1(this), this.red.sqr(this);\n }),\n (BN.prototype.redISqr = function () {\n return assert(this.red, \"redISqr works only with red numbers\"), this.red._verify1(this), this.red.isqr(this);\n }),\n (BN.prototype.redSqrt = function () {\n return assert(this.red, \"redSqrt works only with red numbers\"), this.red._verify1(this), this.red.sqrt(this);\n }),\n (BN.prototype.redInvm = function () {\n return assert(this.red, \"redInvm works only with red numbers\"), this.red._verify1(this), this.red.invm(this);\n }),\n (BN.prototype.redNeg = function () {\n return assert(this.red, \"redNeg works only with red numbers\"), this.red._verify1(this), this.red.neg(this);\n }),\n (BN.prototype.redPow = function (num) {\n return assert(this.red && !num.red, \"redPow(normalNum)\"), this.red._verify1(this), this.red.pow(this, num);\n });\n var primes = {\n k256: null,\n p224: null,\n p192: null,\n p25519: null,\n };\n function MPrime(name, p) {\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 (this.tmp = this._tmp());\n }\n (MPrime.prototype._tmp = function () {\n var tmp = new BN(null);\n return (tmp.words = new Array(Math.ceil(this.n / 13))), tmp;\n }),\n (MPrime.prototype.ireduce = function (num) {\n var r = num,\n rlen;\n do this.split(r, this.tmp), (r = this.imulK(r)), (r = r.iadd(this.tmp)), (rlen = r.bitLength());\n while (rlen > this.n);\n var cmp = rlen < this.n ? -1 : r.ucmp(this.p);\n return (\n cmp === 0\n ? ((r.words[0] = 0), (r.length = 1))\n : cmp > 0\n ? r.isub(this.p)\n : r.strip !== void 0\n ? r.strip()\n : r._strip(),\n r\n );\n }),\n (MPrime.prototype.split = function (input, out) {\n input.iushrn(this.n, 0, out);\n }),\n (MPrime.prototype.imulK = function (num) {\n return num.imul(this.k);\n });\n function K256() {\n MPrime.call(this, \"k256\", \"ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f\");\n }\n inherits(K256, MPrime),\n (K256.prototype.split = function (input, output) {\n for (var mask = 4194303, outLen = Math.min(input.length, 9), i = 0; i < outLen; i++)\n output.words[i] = input.words[i];\n if (((output.length = outLen), input.length <= 9)) {\n (input.words[0] = 0), (input.length = 1);\n return;\n }\n var prev = input.words[9];\n for (output.words[output.length++] = prev & mask, i = 10; i < input.length; i++) {\n var next = input.words[i] | 0;\n (input.words[i - 10] = ((next & mask) << 4) | (prev >>> 22)), (prev = next);\n }\n (prev >>>= 22),\n (input.words[i - 10] = prev),\n prev === 0 && input.length > 10 ? (input.length -= 10) : (input.length -= 9);\n }),\n (K256.prototype.imulK = function (num) {\n (num.words[num.length] = 0), (num.words[num.length + 1] = 0), (num.length += 2);\n for (var lo = 0, i = 0; i < num.length; i++) {\n var w = num.words[i] | 0;\n (lo += w * 977), (num.words[i] = lo & 67108863), (lo = w * 64 + ((lo / 67108864) | 0));\n }\n return (\n num.words[num.length - 1] === 0 && (num.length--, num.words[num.length - 1] === 0 && num.length--), num\n );\n });\n function P224() {\n MPrime.call(this, \"p224\", \"ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001\");\n }\n inherits(P224, MPrime);\n function P192() {\n MPrime.call(this, \"p192\", \"ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff\");\n }\n inherits(P192, MPrime);\n function P25519() {\n MPrime.call(this, \"25519\", \"7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed\");\n }\n inherits(P25519, MPrime),\n (P25519.prototype.imulK = function (num) {\n for (var carry = 0, i = 0; i < num.length; i++) {\n var hi = (num.words[i] | 0) * 19 + carry,\n lo = hi & 67108863;\n (hi >>>= 26), (num.words[i] = lo), (carry = hi);\n }\n return carry !== 0 && (num.words[num.length++] = carry), num;\n }),\n (BN._prime = function (name) {\n if (primes[name]) return primes[name];\n var prime2;\n if (name === \"k256\") prime2 = new K256();\n else if (name === \"p224\") prime2 = new P224();\n else if (name === \"p192\") prime2 = new P192();\n else if (name === \"p25519\") prime2 = new P25519();\n else throw new Error(\"Unknown prime \" + name);\n return (primes[name] = prime2), prime2;\n });\n function Red(m) {\n if (typeof m == \"string\") {\n var prime = BN._prime(m);\n (this.m = prime.p), (this.prime = prime);\n } else assert(m.gtn(1), \"modulus must be greater than 1\"), (this.m = m), (this.prime = null);\n }\n (Red.prototype._verify1 = function (a) {\n assert(a.negative === 0, \"red works only with positives\"), assert(a.red, \"red works only with red numbers\");\n }),\n (Red.prototype._verify2 = function (a, b) {\n assert((a.negative | b.negative) === 0, \"red works only with positives\"),\n assert(a.red && a.red === b.red, \"red works only with red numbers\");\n }),\n (Red.prototype.imod = function (a) {\n return this.prime ? this.prime.ireduce(a)._forceRed(this) : a.umod(this.m)._forceRed(this);\n }),\n (Red.prototype.neg = function (a) {\n return a.isZero() ? a.clone() : this.m.sub(a)._forceRed(this);\n }),\n (Red.prototype.add = function (a, b) {\n this._verify2(a, b);\n var res = a.add(b);\n return res.cmp(this.m) >= 0 && res.isub(this.m), res._forceRed(this);\n }),\n (Red.prototype.iadd = function (a, b) {\n this._verify2(a, b);\n var res = a.iadd(b);\n return res.cmp(this.m) >= 0 && res.isub(this.m), res;\n }),\n (Red.prototype.sub = function (a, b) {\n this._verify2(a, b);\n var res = a.sub(b);\n return res.cmpn(0) < 0 && res.iadd(this.m), res._forceRed(this);\n }),\n (Red.prototype.isub = function (a, b) {\n this._verify2(a, b);\n var res = a.isub(b);\n return res.cmpn(0) < 0 && res.iadd(this.m), res;\n }),\n (Red.prototype.shl = function (a, num) {\n return this._verify1(a), this.imod(a.ushln(num));\n }),\n (Red.prototype.imul = function (a, b) {\n return this._verify2(a, b), this.imod(a.imul(b));\n }),\n (Red.prototype.mul = function (a, b) {\n return this._verify2(a, b), this.imod(a.mul(b));\n }),\n (Red.prototype.isqr = function (a) {\n return this.imul(a, a.clone());\n }),\n (Red.prototype.sqr = function (a) {\n return this.mul(a, a);\n }),\n (Red.prototype.sqrt = function (a) {\n if (a.isZero()) return a.clone();\n var mod3 = this.m.andln(3);\n if ((assert(mod3 % 2 === 1), mod3 === 3)) {\n var pow = this.m.add(new BN(1)).iushrn(2);\n return this.pow(a, pow);\n }\n for (var q = this.m.subn(1), s = 0; !q.isZero() && q.andln(1) === 0; ) s++, q.iushrn(1);\n assert(!q.isZero());\n var one = new BN(1).toRed(this),\n nOne = one.redNeg(),\n lpow = this.m.subn(1).iushrn(1),\n z = this.m.bitLength();\n for (z = new BN(2 * z * z).toRed(this); this.pow(z, lpow).cmp(nOne) !== 0; ) z.redIAdd(nOne);\n for (\n var c = this.pow(z, q), r = this.pow(a, q.addn(1).iushrn(1)), t = this.pow(a, q), m = s;\n t.cmp(one) !== 0;\n\n ) {\n for (var tmp = t, i = 0; tmp.cmp(one) !== 0; i++) tmp = tmp.redSqr();\n assert(i < m);\n var b = this.pow(c, new BN(1).iushln(m - i - 1));\n (r = r.redMul(b)), (c = b.redSqr()), (t = t.redMul(c)), (m = i);\n }\n return r;\n }),\n (Red.prototype.invm = function (a) {\n var inv = a._invmp(this.m);\n return inv.negative !== 0 ? ((inv.negative = 0), this.imod(inv).redNeg()) : this.imod(inv);\n }),\n (Red.prototype.pow = function (a, num) {\n if (num.isZero()) return new BN(1).toRed(this);\n if (num.cmpn(1) === 0) return a.clone();\n var windowSize = 4,\n wnd = new Array(1 << windowSize);\n (wnd[0] = new BN(1).toRed(this)), (wnd[1] = a);\n for (var i = 2; i < wnd.length; i++) wnd[i] = this.mul(wnd[i - 1], a);\n var res = wnd[0],\n current = 0,\n currentLen = 0,\n start = num.bitLength() % 26;\n for (start === 0 && (start = 26), i = num.length - 1; i >= 0; i--) {\n for (var word = num.words[i], j = start - 1; j >= 0; j--) {\n var bit = (word >> j) & 1;\n if ((res !== wnd[0] && (res = this.sqr(res)), bit === 0 && current === 0)) {\n currentLen = 0;\n continue;\n }\n (current <<= 1),\n (current |= bit),\n currentLen++,\n !(currentLen !== windowSize && (i !== 0 || j !== 0)) &&\n ((res = this.mul(res, wnd[current])), (currentLen = 0), (current = 0));\n }\n start = 26;\n }\n return res;\n }),\n (Red.prototype.convertTo = function (num) {\n var r = num.umod(this.m);\n return r === num ? r.clone() : r;\n }),\n (Red.prototype.convertFrom = function (num) {\n var res = num.clone();\n return (res.red = null), res;\n }),\n (BN.mont = function (num) {\n return new Mont(num);\n });\n function Mont(m) {\n Red.call(this, m),\n (this.shift = this.m.bitLength()),\n this.shift % 26 !== 0 && (this.shift += 26 - (this.shift % 26)),\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 (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 (Mont.prototype.convertTo = function (num) {\n return this.imod(num.ushln(this.shift));\n }),\n (Mont.prototype.convertFrom = function (num) {\n var r = this.imod(num.mul(this.rinv));\n return (r.red = null), r;\n }),\n (Mont.prototype.imul = function (a, b) {\n if (a.isZero() || b.isZero()) return (a.words[0] = 0), (a.length = 1), a;\n var t = a.imul(b),\n c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m),\n u = t.isub(c).iushrn(this.shift),\n res = u;\n return (\n u.cmp(this.m) >= 0 ? (res = u.isub(this.m)) : u.cmpn(0) < 0 && (res = u.iadd(this.m)), res._forceRed(this)\n );\n }),\n (Mont.prototype.mul = function (a, b) {\n if (a.isZero() || b.isZero()) return new BN(0)._forceRed(this);\n var t = a.mul(b),\n c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m),\n u = t.isub(c).iushrn(this.shift),\n res = u;\n return (\n u.cmp(this.m) >= 0 ? (res = u.isub(this.m)) : u.cmpn(0) < 0 && (res = u.iadd(this.m)), res._forceRed(this)\n );\n }),\n (Mont.prototype.invm = function (a) {\n var res = this.imod(a._invmp(this.m).mul(this.r2));\n return res._forceRed(this);\n });\n })(typeof module > \"u\" || module, exports);\n },\n});\n\n// (disabled):node_modules/crypto-browserify/index.js\nvar require_crypto_browserify = __commonJS({\n \"(disabled):node_modules/crypto-browserify/index.js\"() {},\n});\n\n// node_modules/brorand/index.js\nvar require_brorand = __commonJS({\n \"node_modules/brorand/index.js\"(exports, module) {\n var r;\n module.exports = function (len) {\n return r || (r = new Rand(null)), r.generate(len);\n };\n function Rand(rand) {\n this.rand = rand;\n }\n module.exports.Rand = Rand;\n Rand.prototype.generate = function (len) {\n return this._rand(len);\n };\n Rand.prototype._rand = function (n) {\n var out = new Buffer(n);\n crypto.getRandomValues(out);\n return out;\n };\n },\n});\n\n// node_modules/miller-rabin/lib/mr.js\nvar require_mr = __commonJS({\n \"node_modules/miller-rabin/lib/mr.js\"(exports, module) {\n var bn = require_bn2(),\n brorand = require_brorand();\n function MillerRabin(rand) {\n this.rand = rand || new brorand.Rand();\n }\n module.exports = MillerRabin;\n MillerRabin.create = function (rand) {\n return new MillerRabin(rand);\n };\n MillerRabin.prototype._randbelow = function (n) {\n var len = n.bitLength(),\n min_bytes = Math.ceil(len / 8);\n do var a = new bn(this.rand.generate(min_bytes));\n while (a.cmp(n) >= 0);\n return a;\n };\n MillerRabin.prototype._randrange = function (start, stop) {\n var size = stop.sub(start);\n return start.add(this._randbelow(size));\n };\n MillerRabin.prototype.test = function (n, k, cb) {\n var len = n.bitLength(),\n red = bn.mont(n),\n rone = new bn(1).toRed(red);\n k || (k = Math.max(1, (len / 48) | 0));\n for (var n1 = n.subn(1), s = 0; !n1.testn(s); s++);\n for (var d = n.shrn(s), rn1 = n1.toRed(red), prime = !0; k > 0; k--) {\n var a = this._randrange(new bn(2), n1);\n cb && cb(a);\n var x = a.toRed(red).redPow(d);\n if (!(x.cmp(rone) === 0 || x.cmp(rn1) === 0)) {\n for (var i = 1; i < s; i++) {\n if (((x = x.redSqr()), x.cmp(rone) === 0)) return !1;\n if (x.cmp(rn1) === 0) break;\n }\n if (i === s) return !1;\n }\n }\n return prime;\n };\n MillerRabin.prototype.getDivisor = function (n, k) {\n var len = n.bitLength(),\n red = bn.mont(n),\n rone = new bn(1).toRed(red);\n k || (k = Math.max(1, (len / 48) | 0));\n for (var n1 = n.subn(1), s = 0; !n1.testn(s); s++);\n for (var d = n.shrn(s), rn1 = n1.toRed(red); k > 0; k--) {\n var a = this._randrange(new bn(2), n1),\n g = n.gcd(a);\n if (g.cmpn(1) !== 0) return g;\n var x = a.toRed(red).redPow(d);\n if (!(x.cmp(rone) === 0 || x.cmp(rn1) === 0)) {\n for (var i = 1; i < s; i++) {\n if (((x = x.redSqr()), x.cmp(rone) === 0)) return x.fromRed().subn(1).gcd(n);\n if (x.cmp(rn1) === 0) break;\n }\n if (i === s) return (x = x.redSqr()), x.fromRed().subn(1).gcd(n);\n }\n }\n return !1;\n };\n },\n});\n\n// node_modules/diffie-hellman/lib/generatePrime.js\nvar require_generatePrime = __commonJS({\n \"node_modules/diffie-hellman/lib/generatePrime.js\"(exports, module) {\n var randomBytes = require_browser();\n module.exports = findPrime;\n findPrime.simpleSieve = simpleSieve;\n findPrime.fermatTest = fermatTest;\n var BN = require_bn(),\n TWENTYFOUR = new BN(24),\n MillerRabin = require_mr(),\n millerRabin = new MillerRabin(),\n ONE = new BN(1),\n TWO = new BN(2),\n FIVE = new BN(5),\n SIXTEEN = new BN(16),\n EIGHT = new BN(8),\n TEN = new BN(10),\n THREE = new BN(3),\n SEVEN = new BN(7),\n ELEVEN = new BN(11),\n FOUR = new BN(4),\n TWELVE = new BN(12),\n primes = null;\n function _getPrimes() {\n if (primes !== null) return primes;\n var limit = 1048576,\n res = [];\n res[0] = 2;\n for (var i = 1, k = 3; k < limit; k += 2) {\n for (var sqrt = Math.ceil(Math.sqrt(k)), j = 0; j < i && res[j] <= sqrt && k % res[j] !== 0; j++);\n (i !== j && res[j] <= sqrt) || (res[i++] = k);\n }\n return (primes = res), res;\n }\n function simpleSieve(p) {\n for (var primes2 = _getPrimes(), i = 0; i < primes2.length; i++)\n if (p.modn(primes2[i]) === 0) return p.cmpn(primes2[i]) === 0;\n return !0;\n }\n function fermatTest(p) {\n var red = BN.mont(p);\n return TWO.toRed(red).redPow(p.subn(1)).fromRed().cmpn(1) === 0;\n }\n function findPrime(bits, gen) {\n if (bits < 16) return gen === 2 || gen === 5 ? new BN([140, 123]) : new BN([140, 39]);\n gen = new BN(gen);\n for (var num, n2; ; ) {\n for (num = new BN(randomBytes(Math.ceil(bits / 8))); num.bitLength() > bits; ) num.ishrn(1);\n if ((num.isEven() && num.iadd(ONE), num.testn(1) || num.iadd(TWO), gen.cmp(TWO))) {\n if (!gen.cmp(FIVE)) for (; num.mod(TEN).cmp(THREE); ) num.iadd(FOUR);\n } else for (; num.mod(TWENTYFOUR).cmp(ELEVEN); ) num.iadd(FOUR);\n if (\n ((n2 = num.shrn(1)),\n simpleSieve(n2) &&\n simpleSieve(num) &&\n fermatTest(n2) &&\n fermatTest(num) &&\n millerRabin.test(n2) &&\n millerRabin.test(num))\n )\n return num;\n }\n }\n },\n});\n\n// node_modules/diffie-hellman/lib/primes.json\nvar require_primes = __commonJS({\n \"node_modules/diffie-hellman/lib/primes.json\"(exports, module) {\n module.exports = {\n modp1: {\n gen: \"02\",\n prime:\n \"ffffffffffffffffc90fdaa22168c234c4c6628b80dc1cd129024e088a67cc74020bbea63b139b22514a08798e3404ddef9519b3cd3a431b302b0a6df25f14374fe1356d6d51c245e485b576625e7ec6f44c42e9a63a3620ffffffffffffffff\",\n },\n modp2: {\n gen: \"02\",\n prime:\n \"ffffffffffffffffc90fdaa22168c234c4c6628b80dc1cd129024e088a67cc74020bbea63b139b22514a08798e3404ddef9519b3cd3a431b302b0a6df25f14374fe1356d6d51c245e485b576625e7ec6f44c42e9a637ed6b0bff5cb6f406b7edee386bfb5a899fa5ae9f24117c4b1fe649286651ece65381ffffffffffffffff\",\n },\n modp5: {\n gen: \"02\",\n prime:\n \"ffffffffffffffffc90fdaa22168c234c4c6628b80dc1cd129024e088a67cc74020bbea63b139b22514a08798e3404ddef9519b3cd3a431b302b0a6df25f14374fe1356d6d51c245e485b576625e7ec6f44c42e9a637ed6b0bff5cb6f406b7edee386bfb5a899fa5ae9f24117c4b1fe649286651ece45b3dc2007cb8a163bf0598da48361c55d39a69163fa8fd24cf5f83655d23dca3ad961c62f356208552bb9ed529077096966d670c354e4abc9804f1746c08ca237327ffffffffffffffff\",\n },\n modp14: {\n gen: \"02\",\n prime:\n \"ffffffffffffffffc90fdaa22168c234c4c6628b80dc1cd129024e088a67cc74020bbea63b139b22514a08798e3404ddef9519b3cd3a431b302b0a6df25f14374fe1356d6d51c245e485b576625e7ec6f44c42e9a637ed6b0bff5cb6f406b7edee386bfb5a899fa5ae9f24117c4b1fe649286651ece45b3dc2007cb8a163bf0598da48361c55d39a69163fa8fd24cf5f83655d23dca3ad961c62f356208552bb9ed529077096966d670c354e4abc9804f1746c08ca18217c32905e462e36ce3be39e772c180e86039b2783a2ec07a28fb5c55df06f4c52c9de2bcbf6955817183995497cea956ae515d2261898fa051015728e5a8aacaa68ffffffffffffffff\",\n },\n modp15: {\n gen: \"02\",\n prime:\n \"ffffffffffffffffc90fdaa22168c234c4c6628b80dc1cd129024e088a67cc74020bbea63b139b22514a08798e3404ddef9519b3cd3a431b302b0a6df25f14374fe1356d6d51c245e485b576625e7ec6f44c42e9a637ed6b0bff5cb6f406b7edee386bfb5a899fa5ae9f24117c4b1fe649286651ece45b3dc2007cb8a163bf0598da48361c55d39a69163fa8fd24cf5f83655d23dca3ad961c62f356208552bb9ed529077096966d670c354e4abc9804f1746c08ca18217c32905e462e36ce3be39e772c180e86039b2783a2ec07a28fb5c55df06f4c52c9de2bcbf6955817183995497cea956ae515d2261898fa051015728e5a8aaac42dad33170d04507a33a85521abdf1cba64ecfb850458dbef0a8aea71575d060c7db3970f85a6e1e4c7abf5ae8cdb0933d71e8c94e04a25619dcee3d2261ad2ee6bf12ffa06d98a0864d87602733ec86a64521f2b18177b200cbbe117577a615d6c770988c0bad946e208e24fa074e5ab3143db5bfce0fd108e4b82d120a93ad2caffffffffffffffff\",\n },\n modp16: {\n gen: \"02\",\n prime:\n \"ffffffffffffffffc90fdaa22168c234c4c6628b80dc1cd129024e088a67cc74020bbea63b139b22514a08798e3404ddef9519b3cd3a431b302b0a6df25f14374fe1356d6d51c245e485b576625e7ec6f44c42e9a637ed6b0bff5cb6f406b7edee386bfb5a899fa5ae9f24117c4b1fe649286651ece45b3dc2007cb8a163bf0598da48361c55d39a69163fa8fd24cf5f83655d23dca3ad961c62f356208552bb9ed529077096966d670c354e4abc9804f1746c08ca18217c32905e462e36ce3be39e772c180e86039b2783a2ec07a28fb5c55df06f4c52c9de2bcbf6955817183995497cea956ae515d2261898fa051015728e5a8aaac42dad33170d04507a33a85521abdf1cba64ecfb850458dbef0a8aea71575d060c7db3970f85a6e1e4c7abf5ae8cdb0933d71e8c94e04a25619dcee3d2261ad2ee6bf12ffa06d98a0864d87602733ec86a64521f2b18177b200cbbe117577a615d6c770988c0bad946e208e24fa074e5ab3143db5bfce0fd108e4b82d120a92108011a723c12a787e6d788719a10bdba5b2699c327186af4e23c1a946834b6150bda2583e9ca2ad44ce8dbbbc2db04de8ef92e8efc141fbecaa6287c59474e6bc05d99b2964fa090c3a2233ba186515be7ed1f612970cee2d7afb81bdd762170481cd0069127d5b05aa993b4ea988d8fddc186ffb7dc90a6c08f4df435c934063199ffffffffffffffff\",\n },\n modp17: {\n gen: \"02\",\n prime:\n \"ffffffffffffffffc90fdaa22168c234c4c6628b80dc1cd129024e088a67cc74020bbea63b139b22514a08798e3404ddef9519b3cd3a431b302b0a6df25f14374fe1356d6d51c245e485b576625e7ec6f44c42e9a637ed6b0bff5cb6f406b7edee386bfb5a899fa5ae9f24117c4b1fe649286651ece45b3dc2007cb8a163bf0598da48361c55d39a69163fa8fd24cf5f83655d23dca3ad961c62f356208552bb9ed529077096966d670c354e4abc9804f1746c08ca18217c32905e462e36ce3be39e772c180e86039b2783a2ec07a28fb5c55df06f4c52c9de2bcbf6955817183995497cea956ae515d2261898fa051015728e5a8aaac42dad33170d04507a33a85521abdf1cba64ecfb850458dbef0a8aea71575d060c7db3970f85a6e1e4c7abf5ae8cdb0933d71e8c94e04a25619dcee3d2261ad2ee6bf12ffa06d98a0864d87602733ec86a64521f2b18177b200cbbe117577a615d6c770988c0bad946e208e24fa074e5ab3143db5bfce0fd108e4b82d120a92108011a723c12a787e6d788719a10bdba5b2699c327186af4e23c1a946834b6150bda2583e9ca2ad44ce8dbbbc2db04de8ef92e8efc141fbecaa6287c59474e6bc05d99b2964fa090c3a2233ba186515be7ed1f612970cee2d7afb81bdd762170481cd0069127d5b05aa993b4ea988d8fddc186ffb7dc90a6c08f4df435c93402849236c3fab4d27c7026c1d4dcb2602646dec9751e763dba37bdf8ff9406ad9e530ee5db382f413001aeb06a53ed9027d831179727b0865a8918da3edbebcf9b14ed44ce6cbaced4bb1bdb7f1447e6cc254b332051512bd7af426fb8f401378cd2bf5983ca01c64b92ecf032ea15d1721d03f482d7ce6e74fef6d55e702f46980c82b5a84031900b1c9e59e7c97fbec7e8f323a97a7e36cc88be0f1d45b7ff585ac54bd407b22b4154aacc8f6d7ebf48e1d814cc5ed20f8037e0a79715eef29be32806a1d58bb7c5da76f550aa3d8a1fbff0eb19ccb1a313d55cda56c9ec2ef29632387fe8d76e3c0468043e8f663f4860ee12bf2d5b0b7474d6e694f91e6dcc4024ffffffffffffffff\",\n },\n modp18: {\n gen: \"02\",\n prime:\n \"ffffffffffffffffc90fdaa22168c234c4c6628b80dc1cd129024e088a67cc74020bbea63b139b22514a08798e3404ddef9519b3cd3a431b302b0a6df25f14374fe1356d6d51c245e485b576625e7ec6f44c42e9a637ed6b0bff5cb6f406b7edee386bfb5a899fa5ae9f24117c4b1fe649286651ece45b3dc2007cb8a163bf0598da48361c55d39a69163fa8fd24cf5f83655d23dca3ad961c62f356208552bb9ed529077096966d670c354e4abc9804f1746c08ca18217c32905e462e36ce3be39e772c180e86039b2783a2ec07a28fb5c55df06f4c52c9de2bcbf6955817183995497cea956ae515d2261898fa051015728e5a8aaac42dad33170d04507a33a85521abdf1cba64ecfb850458dbef0a8aea71575d060c7db3970f85a6e1e4c7abf5ae8cdb0933d71e8c94e04a25619dcee3d2261ad2ee6bf12ffa06d98a0864d87602733ec86a64521f2b18177b200cbbe117577a615d6c770988c0bad946e208e24fa074e5ab3143db5bfce0fd108e4b82d120a92108011a723c12a787e6d788719a10bdba5b2699c327186af4e23c1a946834b6150bda2583e9ca2ad44ce8dbbbc2db04de8ef92e8efc141fbecaa6287c59474e6bc05d99b2964fa090c3a2233ba186515be7ed1f612970cee2d7afb81bdd762170481cd0069127d5b05aa993b4ea988d8fddc186ffb7dc90a6c08f4df435c93402849236c3fab4d27c7026c1d4dcb2602646dec9751e763dba37bdf8ff9406ad9e530ee5db382f413001aeb06a53ed9027d831179727b0865a8918da3edbebcf9b14ed44ce6cbaced4bb1bdb7f1447e6cc254b332051512bd7af426fb8f401378cd2bf5983ca01c64b92ecf032ea15d1721d03f482d7ce6e74fef6d55e702f46980c82b5a84031900b1c9e59e7c97fbec7e8f323a97a7e36cc88be0f1d45b7ff585ac54bd407b22b4154aacc8f6d7ebf48e1d814cc5ed20f8037e0a79715eef29be32806a1d58bb7c5da76f550aa3d8a1fbff0eb19ccb1a313d55cda56c9ec2ef29632387fe8d76e3c0468043e8f663f4860ee12bf2d5b0b7474d6e694f91e6dbe115974a3926f12fee5e438777cb6a932df8cd8bec4d073b931ba3bc832b68d9dd300741fa7bf8afc47ed2576f6936ba424663aab639c5ae4f5683423b4742bf1c978238f16cbe39d652de3fdb8befc848ad922222e04a4037c0713eb57a81a23f0c73473fc646cea306b4bcbc8862f8385ddfa9d4b7fa2c087e879683303ed5bdd3a062b3cf5b3a278a66d2a13f83f44f82ddf310ee074ab6a364597e899a0255dc164f31cc50846851df9ab48195ded7ea1b1d510bd7ee74d73faf36bc31ecfa268359046f4eb879f924009438b481c6cd7889a002ed5ee382bc9190da6fc026e479558e4475677e9aa9e3050e2765694dfc81f56e880b96e7160c980dd98edd3dfffffffffffffffff\",\n },\n };\n },\n});\n\n// node_modules/diffie-hellman/lib/dh.js\nvar require_dh = __commonJS({\n \"node_modules/diffie-hellman/lib/dh.js\"(exports, module) {\n var BN = require_bn(),\n MillerRabin = require_mr(),\n millerRabin = new MillerRabin(),\n TWENTYFOUR = new BN(24),\n ELEVEN = new BN(11),\n TEN = new BN(10),\n THREE = new BN(3),\n SEVEN = new BN(7),\n primes = require_generatePrime(),\n randomBytes = require_browser();\n module.exports = DH;\n function setPublicKey(pub, enc) {\n return (\n (enc = enc || \"utf8\"), Buffer.isBuffer(pub) || (pub = new Buffer(pub, enc)), (this._pub = new BN(pub)), this\n );\n }\n function setPrivateKey(priv, enc) {\n return (\n (enc = enc || \"utf8\"),\n Buffer.isBuffer(priv) || (priv = new Buffer(priv, enc)),\n (this._priv = new BN(priv)),\n this\n );\n }\n var primeCache = {};\n function checkPrime(prime, generator) {\n var gen = generator.toString(\"hex\"),\n hex = [gen, prime.toString(16)].join(\"_\");\n if (hex in primeCache) return primeCache[hex];\n var error = 0;\n if (prime.isEven() || !primes.simpleSieve || !primes.fermatTest(prime) || !millerRabin.test(prime))\n return (\n (error += 1), gen === \"02\" || gen === \"05\" ? (error += 8) : (error += 4), (primeCache[hex] = error), error\n );\n millerRabin.test(prime.shrn(1)) || (error += 2);\n var rem;\n switch (gen) {\n case \"02\":\n prime.mod(TWENTYFOUR).cmp(ELEVEN) && (error += 8);\n break;\n case \"05\":\n (rem = prime.mod(TEN)), rem.cmp(THREE) && rem.cmp(SEVEN) && (error += 8);\n break;\n default:\n error += 4;\n }\n return (primeCache[hex] = error), error;\n }\n function DH(prime, generator, malleable) {\n this.setGenerator(generator),\n (this.__prime = new BN(prime)),\n (this._prime = BN.mont(this.__prime)),\n (this._primeLen = prime.length),\n (this._pub = void 0),\n (this._priv = void 0),\n (this._primeCode = void 0),\n malleable ? ((this.setPublicKey = setPublicKey), (this.setPrivateKey = setPrivateKey)) : (this._primeCode = 8);\n }\n Object.defineProperty(DH.prototype, \"verifyError\", {\n enumerable: !0,\n get: function () {\n return (\n typeof this._primeCode != \"number\" && (this._primeCode = checkPrime(this.__prime, this.__gen)),\n this._primeCode\n );\n },\n });\n DH.prototype.generateKeys = function () {\n return (\n this._priv || (this._priv = new BN(randomBytes(this._primeLen))),\n (this._pub = this._gen.toRed(this._prime).redPow(this._priv).fromRed()),\n this.getPublicKey()\n );\n };\n DH.prototype.computeSecret = function (other) {\n (other = new BN(other)), (other = other.toRed(this._prime));\n var secret = other.redPow(this._priv).fromRed(),\n out = new Buffer(secret.toArray()),\n prime = this.getPrime();\n if (out.length < prime.length) {\n var front = new Buffer(prime.length - out.length);\n front.fill(0), (out = Buffer.concat([front, out]));\n }\n return out;\n };\n DH.prototype.getPublicKey = function (enc) {\n return formatReturnValue(this._pub, enc);\n };\n DH.prototype.getPrivateKey = function (enc) {\n return formatReturnValue(this._priv, enc);\n };\n DH.prototype.getPrime = function (enc) {\n return formatReturnValue(this.__prime, enc);\n };\n DH.prototype.getGenerator = function (enc) {\n return formatReturnValue(this._gen, enc);\n };\n DH.prototype.setGenerator = function (gen, enc) {\n return (\n (enc = enc || \"utf8\"),\n Buffer.isBuffer(gen) || (gen = new Buffer(gen, enc)),\n (this.__gen = gen),\n (this._gen = new BN(gen)),\n this\n );\n };\n function formatReturnValue(bn, enc) {\n var buf = new Buffer(bn.toArray());\n return enc ? buf.toString(enc) : buf;\n }\n },\n});\n\n// node_modules/diffie-hellman/browser.js\nvar require_browser7 = __commonJS({\n \"node_modules/diffie-hellman/browser.js\"(exports) {\n var generatePrime = require_generatePrime(),\n primes = require_primes(),\n DH = require_dh();\n function getDiffieHellman(mod) {\n var prime = new Buffer(primes[mod].prime, \"hex\"),\n gen = new Buffer(primes[mod].gen, \"hex\");\n return new DH(prime, gen);\n }\n var ENCODINGS = {\n binary: !0,\n hex: !0,\n base64: !0,\n };\n function createDiffieHellman(prime, enc, generator, genc) {\n return Buffer.isBuffer(enc) || ENCODINGS[enc] === void 0\n ? createDiffieHellman(prime, \"binary\", enc, generator)\n : ((enc = enc || \"binary\"),\n (genc = genc || \"binary\"),\n (generator = generator || new Buffer([2])),\n Buffer.isBuffer(generator) || (generator = new Buffer(generator, genc)),\n typeof prime == \"number\"\n ? new DH(generatePrime(prime, generator), generator, !0)\n : (Buffer.isBuffer(prime) || (prime = new Buffer(prime, enc)), new DH(prime, generator, !0)));\n }\n exports.DiffieHellmanGroup = exports.createDiffieHellmanGroup = exports.getDiffieHellman = getDiffieHellman;\n exports.createDiffieHellman = exports.DiffieHellman = createDiffieHellman;\n },\n});\n\n// node_modules/bn.js/lib/bn.js\nvar require_bn3 = __commonJS({\n \"node_modules/bn.js/lib/bn.js\"(exports, module) {\n (function (module2, exports2) {\n \"use strict\";\n function assert(val, msg) {\n if (!val) throw new Error(msg || \"Assertion failed\");\n }\n function inherits(ctor, superCtor) {\n ctor.super_ = superCtor;\n var TempCtor = function () {};\n (TempCtor.prototype = superCtor.prototype),\n (ctor.prototype = new TempCtor()),\n (ctor.prototype.constructor = ctor);\n }\n function BN(number, base, endian) {\n if (BN.isBN(number)) return number;\n (this.negative = 0),\n (this.words = null),\n (this.length = 0),\n (this.red = null),\n number !== null &&\n ((base === \"le\" || base === \"be\") && ((endian = base), (base = 10)),\n this._init(number || 0, base || 10, endian || \"be\"));\n }\n typeof module2 == \"object\" ? (module2.exports = BN) : (exports2.BN = BN), (BN.BN = BN), (BN.wordSize = 26);\n var Buffer2;\n try {\n typeof window < \"u\" && typeof window.Buffer < \"u\"\n ? (Buffer2 = window.Buffer)\n : (Buffer2 = __require(\"buffer\").Buffer);\n } catch {}\n (BN.isBN = function (num) {\n return num instanceof BN\n ? !0\n : num !== null &&\n typeof num == \"object\" &&\n num.constructor.wordSize === BN.wordSize &&\n Array.isArray(num.words);\n }),\n (BN.max = function (left, right) {\n return left.cmp(right) > 0 ? left : right;\n }),\n (BN.min = function (left, right) {\n return left.cmp(right) < 0 ? left : right;\n }),\n (BN.prototype._init = function (number, base, endian) {\n if (typeof number == \"number\") return this._initNumber(number, base, endian);\n if (typeof number == \"object\") return this._initArray(number, base, endian);\n base === \"hex\" && (base = 16),\n assert(base === (base | 0) && base >= 2 && base <= 36),\n (number = number.toString().replace(/\\s+/g, \"\"));\n var start = 0;\n number[0] === \"-\" && (start++, (this.negative = 1)),\n start < number.length &&\n (base === 16\n ? this._parseHex(number, start, endian)\n : (this._parseBase(number, base, start),\n endian === \"le\" && this._initArray(this.toArray(), base, endian)));\n }),\n (BN.prototype._initNumber = function (number, base, endian) {\n number < 0 && ((this.negative = 1), (number = -number)),\n number < 67108864\n ? ((this.words = [number & 67108863]), (this.length = 1))\n : number < 4503599627370496\n ? ((this.words = [number & 67108863, (number / 67108864) & 67108863]), (this.length = 2))\n : (assert(number < 9007199254740992),\n (this.words = [number & 67108863, (number / 67108864) & 67108863, 1]),\n (this.length = 3)),\n endian === \"le\" && this._initArray(this.toArray(), base, endian);\n }),\n (BN.prototype._initArray = function (number, base, endian) {\n if ((assert(typeof number.length == \"number\"), number.length <= 0))\n return (this.words = [0]), (this.length = 1), this;\n (this.length = Math.ceil(number.length / 3)), (this.words = new Array(this.length));\n for (var i = 0; i < this.length; i++) this.words[i] = 0;\n var j,\n w,\n off = 0;\n if (endian === \"be\")\n for (i = number.length - 1, j = 0; i >= 0; i -= 3)\n (w = number[i] | (number[i - 1] << 8) | (number[i - 2] << 16)),\n (this.words[j] |= (w << off) & 67108863),\n (this.words[j + 1] = (w >>> (26 - off)) & 67108863),\n (off += 24),\n off >= 26 && ((off -= 26), j++);\n else if (endian === \"le\")\n for (i = 0, j = 0; i < number.length; i += 3)\n (w = number[i] | (number[i + 1] << 8) | (number[i + 2] << 16)),\n (this.words[j] |= (w << off) & 67108863),\n (this.words[j + 1] = (w >>> (26 - off)) & 67108863),\n (off += 24),\n off >= 26 && ((off -= 26), j++);\n return this._strip();\n });\n function parseHex4Bits(string, index) {\n var c = string.charCodeAt(index);\n if (c >= 48 && c <= 57) return c - 48;\n if (c >= 65 && c <= 70) return c - 55;\n if (c >= 97 && c <= 102) return c - 87;\n assert(!1, \"Invalid character in \" + string);\n }\n function parseHexByte(string, lowerBound, index) {\n var r = parseHex4Bits(string, index);\n return index - 1 >= lowerBound && (r |= parseHex4Bits(string, index - 1) << 4), r;\n }\n BN.prototype._parseHex = function (number, start, endian) {\n (this.length = Math.ceil((number.length - start) / 6)), (this.words = new Array(this.length));\n for (var i = 0; i < this.length; i++) this.words[i] = 0;\n var off = 0,\n j = 0,\n w;\n if (endian === \"be\")\n for (i = number.length - 1; i >= start; i -= 2)\n (w = parseHexByte(number, start, i) << off),\n (this.words[j] |= w & 67108863),\n off >= 18 ? ((off -= 18), (j += 1), (this.words[j] |= w >>> 26)) : (off += 8);\n else {\n var parseLength = number.length - start;\n for (i = parseLength % 2 === 0 ? start + 1 : start; i < number.length; i += 2)\n (w = parseHexByte(number, start, i) << off),\n (this.words[j] |= w & 67108863),\n off >= 18 ? ((off -= 18), (j += 1), (this.words[j] |= w >>> 26)) : (off += 8);\n }\n this._strip();\n };\n function parseBase(str, start, end, mul) {\n for (var r = 0, b = 0, len = Math.min(str.length, end), i = start; i < len; i++) {\n var c = str.charCodeAt(i) - 48;\n (r *= mul),\n c >= 49 ? (b = c - 49 + 10) : c >= 17 ? (b = c - 17 + 10) : (b = c),\n assert(c >= 0 && b < mul, \"Invalid character\"),\n (r += b);\n }\n return r;\n }\n (BN.prototype._parseBase = function (number, base, start) {\n (this.words = [0]), (this.length = 1);\n for (var limbLen = 0, limbPow = 1; limbPow <= 67108863; limbPow *= base) limbLen++;\n limbLen--, (limbPow = (limbPow / base) | 0);\n for (\n var total = number.length - start,\n mod = total % limbLen,\n end = Math.min(total, total - mod) + start,\n word = 0,\n i = start;\n i < end;\n i += limbLen\n )\n (word = parseBase(number, i, i + limbLen, base)),\n this.imuln(limbPow),\n this.words[0] + word < 67108864 ? (this.words[0] += word) : this._iaddn(word);\n if (mod !== 0) {\n var pow = 1;\n for (word = parseBase(number, i, number.length, base), i = 0; i < mod; i++) pow *= base;\n this.imuln(pow), this.words[0] + word < 67108864 ? (this.words[0] += word) : this._iaddn(word);\n }\n this._strip();\n }),\n (BN.prototype.copy = function (dest) {\n dest.words = new Array(this.length);\n for (var i = 0; i < this.length; i++) dest.words[i] = this.words[i];\n (dest.length = this.length), (dest.negative = this.negative), (dest.red = this.red);\n });\n function move(dest, src) {\n (dest.words = src.words), (dest.length = src.length), (dest.negative = src.negative), (dest.red = src.red);\n }\n if (\n ((BN.prototype._move = function (dest) {\n move(dest, this);\n }),\n (BN.prototype.clone = function () {\n var r = new BN(null);\n return this.copy(r), r;\n }),\n (BN.prototype._expand = function (size) {\n for (; this.length < size; ) this.words[this.length++] = 0;\n return this;\n }),\n (BN.prototype._strip = function () {\n for (; this.length > 1 && this.words[this.length - 1] === 0; ) this.length--;\n return this._normSign();\n }),\n (BN.prototype._normSign = function () {\n return this.length === 1 && this.words[0] === 0 && (this.negative = 0), this;\n }),\n typeof Symbol < \"u\" && typeof Symbol.for == \"function\")\n )\n try {\n BN.prototype[Symbol.for(\"nodejs.util.inspect.custom\")] = inspect;\n } catch {\n BN.prototype.inspect = inspect;\n }\n else BN.prototype.inspect = inspect;\n function inspect() {\n return (this.red ? \"<BN-R: \" : \"<BN: \") + this.toString(16) + \">\";\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 groupSizes = [\n 0, 0, 25, 16, 12, 11, 10, 9, 8, 8, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5,\n 5, 5,\n ],\n groupBases = [\n 0, 0, 33554432, 43046721, 16777216, 48828125, 60466176, 40353607, 16777216, 43046721, 1e7, 19487171, 35831808,\n 62748517, 7529536, 11390625, 16777216, 24137569, 34012224, 47045881, 64e6, 4084101, 5153632, 6436343, 7962624,\n 9765625, 11881376, 14348907, 17210368, 20511149, 243e5, 28629151, 33554432, 39135393, 45435424, 52521875,\n 60466176,\n ];\n (BN.prototype.toString = function (base, padding) {\n (base = base || 10), (padding = padding | 0 || 1);\n var out;\n if (base === 16 || base === \"hex\") {\n out = \"\";\n for (var off = 0, carry = 0, i = 0; i < this.length; i++) {\n var w = this.words[i],\n word = (((w << off) | carry) & 16777215).toString(16);\n (carry = (w >>> (24 - off)) & 16777215),\n (off += 2),\n off >= 26 && ((off -= 26), i--),\n carry !== 0 || i !== this.length - 1 ? (out = zeros[6 - word.length] + word + out) : (out = word + out);\n }\n for (carry !== 0 && (out = carry.toString(16) + out); out.length % padding !== 0; ) out = \"0\" + out;\n return this.negative !== 0 && (out = \"-\" + out), out;\n }\n if (base === (base | 0) && base >= 2 && base <= 36) {\n var groupSize = groupSizes[base],\n groupBase = groupBases[base];\n out = \"\";\n var c = this.clone();\n for (c.negative = 0; !c.isZero(); ) {\n var r = c.modrn(groupBase).toString(base);\n (c = c.idivn(groupBase)), c.isZero() ? (out = r + out) : (out = zeros[groupSize - r.length] + r + out);\n }\n for (this.isZero() && (out = \"0\" + out); out.length % padding !== 0; ) out = \"0\" + out;\n return this.negative !== 0 && (out = \"-\" + out), out;\n }\n assert(!1, \"Base should be between 2 and 36\");\n }),\n (BN.prototype.toNumber = function () {\n var ret = this.words[0];\n return (\n this.length === 2\n ? (ret += this.words[1] * 67108864)\n : this.length === 3 && this.words[2] === 1\n ? (ret += 4503599627370496 + this.words[1] * 67108864)\n : this.length > 2 && assert(!1, \"Number can only safely store up to 53 bits\"),\n this.negative !== 0 ? -ret : ret\n );\n }),\n (BN.prototype.toJSON = function () {\n return this.toString(16, 2);\n }),\n Buffer2 &&\n (BN.prototype.toBuffer = function (endian, length) {\n return this.toArrayLike(Buffer2, endian, length);\n }),\n (BN.prototype.toArray = function (endian, length) {\n return this.toArrayLike(Array, endian, length);\n });\n var allocate = function (ArrayType, size) {\n return ArrayType.allocUnsafe ? ArrayType.allocUnsafe(size) : new ArrayType(size);\n };\n (BN.prototype.toArrayLike = function (ArrayType, endian, length) {\n this._strip();\n var byteLength = this.byteLength(),\n 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 var res = allocate(ArrayType, reqLength),\n postfix = endian === \"le\" ? \"LE\" : \"BE\";\n return this[\"_toArrayLike\" + postfix](res, byteLength), res;\n }),\n (BN.prototype._toArrayLikeLE = function (res, byteLength) {\n for (var position = 0, carry = 0, i = 0, shift = 0; i < this.length; i++) {\n var word = (this.words[i] << shift) | carry;\n (res[position++] = word & 255),\n position < res.length && (res[position++] = (word >> 8) & 255),\n position < res.length && (res[position++] = (word >> 16) & 255),\n shift === 6\n ? (position < res.length && (res[position++] = (word >> 24) & 255), (carry = 0), (shift = 0))\n : ((carry = word >>> 24), (shift += 2));\n }\n if (position < res.length) for (res[position++] = carry; position < res.length; ) res[position++] = 0;\n }),\n (BN.prototype._toArrayLikeBE = function (res, byteLength) {\n for (var position = res.length - 1, carry = 0, i = 0, shift = 0; i < this.length; i++) {\n var word = (this.words[i] << shift) | carry;\n (res[position--] = word & 255),\n position >= 0 && (res[position--] = (word >> 8) & 255),\n position >= 0 && (res[position--] = (word >> 16) & 255),\n shift === 6\n ? (position >= 0 && (res[position--] = (word >> 24) & 255), (carry = 0), (shift = 0))\n : ((carry = word >>> 24), (shift += 2));\n }\n if (position >= 0) for (res[position--] = carry; position >= 0; ) res[position--] = 0;\n }),\n Math.clz32\n ? (BN.prototype._countBits = function (w) {\n return 32 - Math.clz32(w);\n })\n : (BN.prototype._countBits = function (w) {\n var t = w,\n r = 0;\n return (\n t >= 4096 && ((r += 13), (t >>>= 13)),\n t >= 64 && ((r += 7), (t >>>= 7)),\n t >= 8 && ((r += 4), (t >>>= 4)),\n t >= 2 && ((r += 2), (t >>>= 2)),\n r + t\n );\n }),\n (BN.prototype._zeroBits = function (w) {\n if (w === 0) return 26;\n var t = w,\n r = 0;\n return (\n (t & 8191) === 0 && ((r += 13), (t >>>= 13)),\n (t & 127) === 0 && ((r += 7), (t >>>= 7)),\n (t & 15) === 0 && ((r += 4), (t >>>= 4)),\n (t & 3) === 0 && ((r += 2), (t >>>= 2)),\n (t & 1) === 0 && r++,\n r\n );\n }),\n (BN.prototype.bitLength = function () {\n var w = this.words[this.length - 1],\n hi = this._countBits(w);\n return (this.length - 1) * 26 + hi;\n });\n function toBitArray(num) {\n for (var w = new Array(num.bitLength()), bit = 0; bit < w.length; bit++) {\n var off = (bit / 26) | 0,\n wbit = bit % 26;\n w[bit] = (num.words[off] >>> wbit) & 1;\n }\n return w;\n }\n (BN.prototype.zeroBits = function () {\n if (this.isZero()) return 0;\n for (var r = 0, i = 0; i < this.length; i++) {\n var b = this._zeroBits(this.words[i]);\n if (((r += b), b !== 26)) break;\n }\n return r;\n }),\n (BN.prototype.byteLength = function () {\n return Math.ceil(this.bitLength() / 8);\n }),\n (BN.prototype.toTwos = function (width) {\n return this.negative !== 0 ? this.abs().inotn(width).iaddn(1) : this.clone();\n }),\n (BN.prototype.fromTwos = function (width) {\n return this.testn(width - 1) ? this.notn(width).iaddn(1).ineg() : this.clone();\n }),\n (BN.prototype.isNeg = function () {\n return this.negative !== 0;\n }),\n (BN.prototype.neg = function () {\n return this.clone().ineg();\n }),\n (BN.prototype.ineg = function () {\n return this.isZero() || (this.negative ^= 1), this;\n }),\n (BN.prototype.iuor = function (num) {\n for (; this.length < num.length; ) this.words[this.length++] = 0;\n for (var i = 0; i < num.length; i++) this.words[i] = this.words[i] | num.words[i];\n return this._strip();\n }),\n (BN.prototype.ior = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuor(num);\n }),\n (BN.prototype.or = function (num) {\n return this.length > num.length ? this.clone().ior(num) : num.clone().ior(this);\n }),\n (BN.prototype.uor = function (num) {\n return this.length > num.length ? this.clone().iuor(num) : num.clone().iuor(this);\n }),\n (BN.prototype.iuand = function (num) {\n var b;\n this.length > num.length ? (b = num) : (b = this);\n for (var i = 0; i < b.length; i++) this.words[i] = this.words[i] & num.words[i];\n return (this.length = b.length), this._strip();\n }),\n (BN.prototype.iand = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuand(num);\n }),\n (BN.prototype.and = function (num) {\n return this.length > num.length ? this.clone().iand(num) : num.clone().iand(this);\n }),\n (BN.prototype.uand = function (num) {\n return this.length > num.length ? this.clone().iuand(num) : num.clone().iuand(this);\n }),\n (BN.prototype.iuxor = function (num) {\n var a, b;\n this.length > num.length ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var i = 0; i < b.length; i++) this.words[i] = a.words[i] ^ b.words[i];\n if (this !== a) for (; i < a.length; i++) this.words[i] = a.words[i];\n return (this.length = a.length), this._strip();\n }),\n (BN.prototype.ixor = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuxor(num);\n }),\n (BN.prototype.xor = function (num) {\n return this.length > num.length ? this.clone().ixor(num) : num.clone().ixor(this);\n }),\n (BN.prototype.uxor = function (num) {\n return this.length > num.length ? this.clone().iuxor(num) : num.clone().iuxor(this);\n }),\n (BN.prototype.inotn = function (width) {\n assert(typeof width == \"number\" && width >= 0);\n var bytesNeeded = Math.ceil(width / 26) | 0,\n bitsLeft = width % 26;\n this._expand(bytesNeeded), bitsLeft > 0 && bytesNeeded--;\n for (var i = 0; i < bytesNeeded; i++) this.words[i] = ~this.words[i] & 67108863;\n return bitsLeft > 0 && (this.words[i] = ~this.words[i] & (67108863 >> (26 - bitsLeft))), this._strip();\n }),\n (BN.prototype.notn = function (width) {\n return this.clone().inotn(width);\n }),\n (BN.prototype.setn = function (bit, val) {\n assert(typeof bit == \"number\" && bit >= 0);\n var off = (bit / 26) | 0,\n wbit = bit % 26;\n return (\n this._expand(off + 1),\n val\n ? (this.words[off] = this.words[off] | (1 << wbit))\n : (this.words[off] = this.words[off] & ~(1 << wbit)),\n this._strip()\n );\n }),\n (BN.prototype.iadd = function (num) {\n var r;\n if (this.negative !== 0 && num.negative === 0)\n return (this.negative = 0), (r = this.isub(num)), (this.negative ^= 1), this._normSign();\n if (this.negative === 0 && num.negative !== 0)\n return (num.negative = 0), (r = this.isub(num)), (num.negative = 1), r._normSign();\n var a, b;\n this.length > num.length ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var carry = 0, i = 0; i < b.length; i++)\n (r = (a.words[i] | 0) + (b.words[i] | 0) + carry), (this.words[i] = r & 67108863), (carry = r >>> 26);\n for (; carry !== 0 && i < a.length; i++)\n (r = (a.words[i] | 0) + carry), (this.words[i] = r & 67108863), (carry = r >>> 26);\n if (((this.length = a.length), carry !== 0)) (this.words[this.length] = carry), this.length++;\n else if (a !== this) for (; i < a.length; i++) this.words[i] = a.words[i];\n return this;\n }),\n (BN.prototype.add = function (num) {\n var res;\n return num.negative !== 0 && this.negative === 0\n ? ((num.negative = 0), (res = this.sub(num)), (num.negative ^= 1), res)\n : num.negative === 0 && this.negative !== 0\n ? ((this.negative = 0), (res = num.sub(this)), (this.negative = 1), res)\n : this.length > num.length\n ? this.clone().iadd(num)\n : num.clone().iadd(this);\n }),\n (BN.prototype.isub = function (num) {\n if (num.negative !== 0) {\n num.negative = 0;\n var r = this.iadd(num);\n return (num.negative = 1), r._normSign();\n } else if (this.negative !== 0)\n return (this.negative = 0), this.iadd(num), (this.negative = 1), this._normSign();\n var cmp = this.cmp(num);\n if (cmp === 0) return (this.negative = 0), (this.length = 1), (this.words[0] = 0), this;\n var a, b;\n cmp > 0 ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var carry = 0, i = 0; i < b.length; i++)\n (r = (a.words[i] | 0) - (b.words[i] | 0) + carry), (carry = r >> 26), (this.words[i] = r & 67108863);\n for (; carry !== 0 && i < a.length; i++)\n (r = (a.words[i] | 0) + carry), (carry = r >> 26), (this.words[i] = r & 67108863);\n if (carry === 0 && i < a.length && a !== this) for (; i < a.length; i++) this.words[i] = a.words[i];\n return (this.length = Math.max(this.length, i)), a !== this && (this.negative = 1), this._strip();\n }),\n (BN.prototype.sub = function (num) {\n return this.clone().isub(num);\n });\n function smallMulTo(self2, num, out) {\n out.negative = num.negative ^ self2.negative;\n var len = (self2.length + num.length) | 0;\n (out.length = len), (len = (len - 1) | 0);\n var a = self2.words[0] | 0,\n b = num.words[0] | 0,\n r = a * b,\n lo = r & 67108863,\n carry = (r / 67108864) | 0;\n out.words[0] = lo;\n for (var k = 1; k < len; k++) {\n for (\n var ncarry = carry >>> 26,\n rword = carry & 67108863,\n maxJ = Math.min(k, num.length - 1),\n j = Math.max(0, k - self2.length + 1);\n j <= maxJ;\n j++\n ) {\n var i = (k - j) | 0;\n (a = self2.words[i] | 0),\n (b = num.words[j] | 0),\n (r = a * b + rword),\n (ncarry += (r / 67108864) | 0),\n (rword = r & 67108863);\n }\n (out.words[k] = rword | 0), (carry = ncarry | 0);\n }\n return carry !== 0 ? (out.words[k] = carry | 0) : out.length--, out._strip();\n }\n var comb10MulTo = function (self2, num, out) {\n var a = self2.words,\n b = num.words,\n o = out.words,\n c = 0,\n lo,\n mid,\n hi,\n a0 = a[0] | 0,\n al0 = a0 & 8191,\n ah0 = a0 >>> 13,\n a1 = a[1] | 0,\n al1 = a1 & 8191,\n ah1 = a1 >>> 13,\n a2 = a[2] | 0,\n al2 = a2 & 8191,\n ah2 = a2 >>> 13,\n a3 = a[3] | 0,\n al3 = a3 & 8191,\n ah3 = a3 >>> 13,\n a4 = a[4] | 0,\n al4 = a4 & 8191,\n ah4 = a4 >>> 13,\n a5 = a[5] | 0,\n al5 = a5 & 8191,\n ah5 = a5 >>> 13,\n a6 = a[6] | 0,\n al6 = a6 & 8191,\n ah6 = a6 >>> 13,\n a7 = a[7] | 0,\n al7 = a7 & 8191,\n ah7 = a7 >>> 13,\n a8 = a[8] | 0,\n al8 = a8 & 8191,\n ah8 = a8 >>> 13,\n a9 = a[9] | 0,\n al9 = a9 & 8191,\n ah9 = a9 >>> 13,\n b0 = b[0] | 0,\n bl0 = b0 & 8191,\n bh0 = b0 >>> 13,\n b1 = b[1] | 0,\n bl1 = b1 & 8191,\n bh1 = b1 >>> 13,\n b2 = b[2] | 0,\n bl2 = b2 & 8191,\n bh2 = b2 >>> 13,\n b3 = b[3] | 0,\n bl3 = b3 & 8191,\n bh3 = b3 >>> 13,\n b4 = b[4] | 0,\n bl4 = b4 & 8191,\n bh4 = b4 >>> 13,\n b5 = b[5] | 0,\n bl5 = b5 & 8191,\n bh5 = b5 >>> 13,\n b6 = b[6] | 0,\n bl6 = b6 & 8191,\n bh6 = b6 >>> 13,\n b7 = b[7] | 0,\n bl7 = b7 & 8191,\n bh7 = b7 >>> 13,\n b8 = b[8] | 0,\n bl8 = b8 & 8191,\n bh8 = b8 >>> 13,\n b9 = b[9] | 0,\n bl9 = b9 & 8191,\n bh9 = b9 >>> 13;\n (out.negative = self2.negative ^ num.negative),\n (out.length = 19),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w0 >>> 26)) | 0),\n (w0 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w1 >>> 26)) | 0),\n (w1 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w2 >>> 26)) | 0),\n (w2 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w3 >>> 26)) | 0),\n (w3 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w4 >>> 26)) | 0),\n (w4 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w5 >>> 26)) | 0),\n (w5 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w6 >>> 26)) | 0),\n (w6 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w7 >>> 26)) | 0),\n (w7 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w8 >>> 26)) | 0),\n (w8 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w9 >>> 26)) | 0),\n (w9 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w10 >>> 26)) | 0),\n (w10 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w11 >>> 26)) | 0),\n (w11 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w12 >>> 26)) | 0),\n (w12 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w13 >>> 26)) | 0),\n (w13 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w14 >>> 26)) | 0),\n (w14 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w15 >>> 26)) | 0),\n (w15 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w16 >>> 26)) | 0),\n (w16 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w17 >>> 26)) | 0),\n (w17 &= 67108863),\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 & 8191) << 13)) | 0;\n return (\n (c = (((hi + (mid >>> 13)) | 0) + (w18 >>> 26)) | 0),\n (w18 &= 67108863),\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 c !== 0 && ((o[19] = c), out.length++),\n out\n );\n };\n Math.imul || (comb10MulTo = smallMulTo);\n function bigMulTo(self2, num, out) {\n (out.negative = num.negative ^ self2.negative), (out.length = self2.length + num.length);\n for (var carry = 0, hncarry = 0, k = 0; k < out.length - 1; k++) {\n var ncarry = hncarry;\n hncarry = 0;\n for (\n var rword = carry & 67108863, maxJ = Math.min(k, num.length - 1), j = Math.max(0, k - self2.length + 1);\n j <= maxJ;\n j++\n ) {\n var i = k - j,\n a = self2.words[i] | 0,\n b = num.words[j] | 0,\n r = a * b,\n lo = r & 67108863;\n (ncarry = (ncarry + ((r / 67108864) | 0)) | 0),\n (lo = (lo + rword) | 0),\n (rword = lo & 67108863),\n (ncarry = (ncarry + (lo >>> 26)) | 0),\n (hncarry += ncarry >>> 26),\n (ncarry &= 67108863);\n }\n (out.words[k] = rword), (carry = ncarry), (ncarry = hncarry);\n }\n return carry !== 0 ? (out.words[k] = carry) : out.length--, out._strip();\n }\n function jumboMulTo(self2, num, out) {\n return bigMulTo(self2, num, out);\n }\n BN.prototype.mulTo = function (num, out) {\n var res,\n len = this.length + num.length;\n return (\n this.length === 10 && num.length === 10\n ? (res = comb10MulTo(this, num, out))\n : len < 63\n ? (res = smallMulTo(this, num, out))\n : len < 1024\n ? (res = bigMulTo(this, num, out))\n : (res = jumboMulTo(this, num, out)),\n res\n );\n };\n function FFTM(x, y) {\n (this.x = x), (this.y = y);\n }\n (FFTM.prototype.makeRBT = function (N) {\n for (var t = new Array(N), l = BN.prototype._countBits(N) - 1, i = 0; i < N; i++) t[i] = this.revBin(i, l, N);\n return t;\n }),\n (FFTM.prototype.revBin = function (x, l, N) {\n if (x === 0 || x === N - 1) return x;\n for (var rb = 0, i = 0; i < l; i++) (rb |= (x & 1) << (l - i - 1)), (x >>= 1);\n return rb;\n }),\n (FFTM.prototype.permute = function (rbt, rws, iws, rtws, itws, N) {\n for (var i = 0; i < N; i++) (rtws[i] = rws[rbt[i]]), (itws[i] = iws[rbt[i]]);\n }),\n (FFTM.prototype.transform = function (rws, iws, rtws, itws, N, rbt) {\n this.permute(rbt, rws, iws, rtws, itws, N);\n for (var s = 1; s < N; s <<= 1)\n for (\n var l = s << 1, rtwdf = Math.cos((2 * Math.PI) / l), itwdf = Math.sin((2 * Math.PI) / l), p = 0;\n p < N;\n p += l\n )\n for (var rtwdf_ = rtwdf, itwdf_ = itwdf, j = 0; j < s; j++) {\n var re = rtws[p + j],\n ie = itws[p + j],\n ro = rtws[p + j + s],\n io = itws[p + j + s],\n rx = rtwdf_ * ro - itwdf_ * io;\n (io = rtwdf_ * io + itwdf_ * ro),\n (ro = rx),\n (rtws[p + j] = re + ro),\n (itws[p + j] = ie + io),\n (rtws[p + j + s] = re - ro),\n (itws[p + j + s] = ie - io),\n j !== l &&\n ((rx = rtwdf * rtwdf_ - itwdf * itwdf_), (itwdf_ = rtwdf * itwdf_ + itwdf * rtwdf_), (rtwdf_ = rx));\n }\n }),\n (FFTM.prototype.guessLen13b = function (n, m) {\n var N = Math.max(m, n) | 1,\n odd = N & 1,\n i = 0;\n for (N = (N / 2) | 0; N; N = N >>> 1) i++;\n return 1 << (i + 1 + odd);\n }),\n (FFTM.prototype.conjugate = function (rws, iws, N) {\n if (!(N <= 1))\n for (var i = 0; i < N / 2; i++) {\n var t = rws[i];\n (rws[i] = rws[N - i - 1]),\n (rws[N - i - 1] = t),\n (t = iws[i]),\n (iws[i] = -iws[N - i - 1]),\n (iws[N - i - 1] = -t);\n }\n }),\n (FFTM.prototype.normalize13b = function (ws, N) {\n for (var carry = 0, i = 0; i < N / 2; i++) {\n var w = Math.round(ws[2 * i + 1] / N) * 8192 + Math.round(ws[2 * i] / N) + carry;\n (ws[i] = w & 67108863), w < 67108864 ? (carry = 0) : (carry = (w / 67108864) | 0);\n }\n return ws;\n }),\n (FFTM.prototype.convert13b = function (ws, len, rws, N) {\n for (var carry = 0, i = 0; i < len; i++)\n (carry = carry + (ws[i] | 0)),\n (rws[2 * i] = carry & 8191),\n (carry = carry >>> 13),\n (rws[2 * i + 1] = carry & 8191),\n (carry = carry >>> 13);\n for (i = 2 * len; i < N; ++i) rws[i] = 0;\n assert(carry === 0), assert((carry & -8192) === 0);\n }),\n (FFTM.prototype.stub = function (N) {\n for (var ph = new Array(N), i = 0; i < N; i++) ph[i] = 0;\n return ph;\n }),\n (FFTM.prototype.mulp = function (x, y, out) {\n var N = 2 * this.guessLen13b(x.length, y.length),\n rbt = this.makeRBT(N),\n _ = this.stub(N),\n rws = new Array(N),\n rwst = new Array(N),\n iwst = new Array(N),\n nrws = new Array(N),\n nrwst = new Array(N),\n niwst = new Array(N),\n rmws = out.words;\n (rmws.length = N),\n this.convert13b(x.words, x.length, rws, N),\n this.convert13b(y.words, y.length, nrws, N),\n this.transform(rws, _, rwst, iwst, N, rbt),\n this.transform(nrws, _, nrwst, niwst, N, rbt);\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]), (rwst[i] = rx);\n }\n return (\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 (out.negative = x.negative ^ y.negative),\n (out.length = x.length + y.length),\n out._strip()\n );\n }),\n (BN.prototype.mul = function (num) {\n var out = new BN(null);\n return (out.words = new Array(this.length + num.length)), this.mulTo(num, out);\n }),\n (BN.prototype.mulf = function (num) {\n var out = new BN(null);\n return (out.words = new Array(this.length + num.length)), jumboMulTo(this, num, out);\n }),\n (BN.prototype.imul = function (num) {\n return this.clone().mulTo(num, this);\n }),\n (BN.prototype.imuln = function (num) {\n var isNegNum = num < 0;\n isNegNum && (num = -num), assert(typeof num == \"number\"), assert(num < 67108864);\n for (var carry = 0, i = 0; i < this.length; i++) {\n var w = (this.words[i] | 0) * num,\n lo = (w & 67108863) + (carry & 67108863);\n (carry >>= 26), (carry += (w / 67108864) | 0), (carry += lo >>> 26), (this.words[i] = lo & 67108863);\n }\n return carry !== 0 && ((this.words[i] = carry), this.length++), isNegNum ? this.ineg() : this;\n }),\n (BN.prototype.muln = function (num) {\n return this.clone().imuln(num);\n }),\n (BN.prototype.sqr = function () {\n return this.mul(this);\n }),\n (BN.prototype.isqr = function () {\n return this.imul(this.clone());\n }),\n (BN.prototype.pow = function (num) {\n var w = toBitArray(num);\n if (w.length === 0) return new BN(1);\n for (var res = this, i = 0; i < w.length && w[i] === 0; i++, res = res.sqr());\n if (++i < w.length) for (var q = res.sqr(); i < w.length; i++, q = q.sqr()) w[i] !== 0 && (res = res.mul(q));\n return res;\n }),\n (BN.prototype.iushln = function (bits) {\n assert(typeof bits == \"number\" && bits >= 0);\n var r = bits % 26,\n s = (bits - r) / 26,\n carryMask = (67108863 >>> (26 - r)) << (26 - r),\n i;\n if (r !== 0) {\n var carry = 0;\n for (i = 0; i < this.length; i++) {\n var newCarry = this.words[i] & carryMask,\n c = ((this.words[i] | 0) - newCarry) << r;\n (this.words[i] = c | carry), (carry = newCarry >>> (26 - r));\n }\n carry && ((this.words[i] = carry), this.length++);\n }\n if (s !== 0) {\n for (i = this.length - 1; i >= 0; i--) this.words[i + s] = this.words[i];\n for (i = 0; i < s; i++) this.words[i] = 0;\n this.length += s;\n }\n return this._strip();\n }),\n (BN.prototype.ishln = function (bits) {\n return assert(this.negative === 0), this.iushln(bits);\n }),\n (BN.prototype.iushrn = function (bits, hint, extended) {\n assert(typeof bits == \"number\" && bits >= 0);\n var h;\n hint ? (h = (hint - (hint % 26)) / 26) : (h = 0);\n var r = bits % 26,\n s = Math.min((bits - r) / 26, this.length),\n mask = 67108863 ^ ((67108863 >>> r) << r),\n maskedWords = extended;\n if (((h -= s), (h = Math.max(0, h)), maskedWords)) {\n for (var i = 0; i < s; i++) maskedWords.words[i] = this.words[i];\n maskedWords.length = s;\n }\n if (s !== 0)\n if (this.length > s) for (this.length -= s, i = 0; i < this.length; i++) this.words[i] = this.words[i + s];\n else (this.words[0] = 0), (this.length = 1);\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)), (carry = word & mask);\n }\n return (\n maskedWords && carry !== 0 && (maskedWords.words[maskedWords.length++] = carry),\n this.length === 0 && ((this.words[0] = 0), (this.length = 1)),\n this._strip()\n );\n }),\n (BN.prototype.ishrn = function (bits, hint, extended) {\n return assert(this.negative === 0), this.iushrn(bits, hint, extended);\n }),\n (BN.prototype.shln = function (bits) {\n return this.clone().ishln(bits);\n }),\n (BN.prototype.ushln = function (bits) {\n return this.clone().iushln(bits);\n }),\n (BN.prototype.shrn = function (bits) {\n return this.clone().ishrn(bits);\n }),\n (BN.prototype.ushrn = function (bits) {\n return this.clone().iushrn(bits);\n }),\n (BN.prototype.testn = function (bit) {\n assert(typeof bit == \"number\" && bit >= 0);\n var r = bit % 26,\n s = (bit - r) / 26,\n q = 1 << r;\n if (this.length <= s) return !1;\n var w = this.words[s];\n return !!(w & q);\n }),\n (BN.prototype.imaskn = function (bits) {\n assert(typeof bits == \"number\" && bits >= 0);\n var r = bits % 26,\n s = (bits - r) / 26;\n if ((assert(this.negative === 0, \"imaskn works only with positive numbers\"), this.length <= s)) return this;\n if ((r !== 0 && s++, (this.length = Math.min(s, this.length)), r !== 0)) {\n var mask = 67108863 ^ ((67108863 >>> r) << r);\n this.words[this.length - 1] &= mask;\n }\n return this._strip();\n }),\n (BN.prototype.maskn = function (bits) {\n return this.clone().imaskn(bits);\n }),\n (BN.prototype.iaddn = function (num) {\n return (\n assert(typeof num == \"number\"),\n assert(num < 67108864),\n num < 0\n ? this.isubn(-num)\n : this.negative !== 0\n ? this.length === 1 && (this.words[0] | 0) <= num\n ? ((this.words[0] = num - (this.words[0] | 0)), (this.negative = 0), this)\n : ((this.negative = 0), this.isubn(num), (this.negative = 1), this)\n : this._iaddn(num)\n );\n }),\n (BN.prototype._iaddn = function (num) {\n this.words[0] += num;\n for (var i = 0; i < this.length && this.words[i] >= 67108864; i++)\n (this.words[i] -= 67108864), i === this.length - 1 ? (this.words[i + 1] = 1) : this.words[i + 1]++;\n return (this.length = Math.max(this.length, i + 1)), this;\n }),\n (BN.prototype.isubn = function (num) {\n if ((assert(typeof num == \"number\"), assert(num < 67108864), num < 0)) return this.iaddn(-num);\n if (this.negative !== 0) return (this.negative = 0), this.iaddn(num), (this.negative = 1), this;\n if (((this.words[0] -= num), this.length === 1 && this.words[0] < 0))\n (this.words[0] = -this.words[0]), (this.negative = 1);\n else\n for (var i = 0; i < this.length && this.words[i] < 0; i++)\n (this.words[i] += 67108864), (this.words[i + 1] -= 1);\n return this._strip();\n }),\n (BN.prototype.addn = function (num) {\n return this.clone().iaddn(num);\n }),\n (BN.prototype.subn = function (num) {\n return this.clone().isubn(num);\n }),\n (BN.prototype.iabs = function () {\n return (this.negative = 0), this;\n }),\n (BN.prototype.abs = function () {\n return this.clone().iabs();\n }),\n (BN.prototype._ishlnsubmul = function (num, mul, shift) {\n var len = num.length + shift,\n i;\n this._expand(len);\n var w,\n 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 & 67108863),\n (carry = (w >> 26) - ((right / 67108864) | 0)),\n (this.words[i + shift] = w & 67108863);\n }\n for (; i < this.length - shift; i++)\n (w = (this.words[i + shift] | 0) + carry), (carry = w >> 26), (this.words[i + shift] = w & 67108863);\n if (carry === 0) return this._strip();\n for (assert(carry === -1), carry = 0, i = 0; i < this.length; i++)\n (w = -(this.words[i] | 0) + carry), (carry = w >> 26), (this.words[i] = w & 67108863);\n return (this.negative = 1), this._strip();\n }),\n (BN.prototype._wordDiv = function (num, mode) {\n var shift = this.length - num.length,\n a = this.clone(),\n b = num,\n bhi = b.words[b.length - 1] | 0,\n bhiBits = this._countBits(bhi);\n (shift = 26 - bhiBits),\n shift !== 0 && ((b = b.ushln(shift)), a.iushln(shift), (bhi = b.words[b.length - 1] | 0));\n var m = a.length - b.length,\n q;\n if (mode !== \"mod\") {\n (q = new BN(null)), (q.length = m + 1), (q.words = new Array(q.length));\n for (var i = 0; i < q.length; i++) q.words[i] = 0;\n }\n var diff = a.clone()._ishlnsubmul(b, 1, m);\n diff.negative === 0 && ((a = diff), q && (q.words[m] = 1));\n for (var j = m - 1; j >= 0; j--) {\n var qj = (a.words[b.length + j] | 0) * 67108864 + (a.words[b.length + j - 1] | 0);\n for (qj = Math.min((qj / bhi) | 0, 67108863), a._ishlnsubmul(b, qj, j); a.negative !== 0; )\n qj--, (a.negative = 0), a._ishlnsubmul(b, 1, j), a.isZero() || (a.negative ^= 1);\n q && (q.words[j] = qj);\n }\n return (\n q && q._strip(),\n a._strip(),\n mode !== \"div\" && shift !== 0 && a.iushrn(shift),\n {\n div: q || null,\n mod: a,\n }\n );\n }),\n (BN.prototype.divmod = function (num, mode, positive) {\n if ((assert(!num.isZero()), this.isZero()))\n return {\n div: new BN(0),\n mod: new BN(0),\n };\n var div, mod, res;\n return this.negative !== 0 && num.negative === 0\n ? ((res = this.neg().divmod(num, mode)),\n mode !== \"mod\" && (div = res.div.neg()),\n mode !== \"div\" && ((mod = res.mod.neg()), positive && mod.negative !== 0 && mod.iadd(num)),\n {\n div,\n mod,\n })\n : this.negative === 0 && num.negative !== 0\n ? ((res = this.divmod(num.neg(), mode)),\n mode !== \"mod\" && (div = res.div.neg()),\n {\n div,\n mod: res.mod,\n })\n : (this.negative & num.negative) !== 0\n ? ((res = this.neg().divmod(num.neg(), mode)),\n mode !== \"div\" && ((mod = res.mod.neg()), positive && mod.negative !== 0 && mod.isub(num)),\n {\n div: res.div,\n mod,\n })\n : num.length > this.length || this.cmp(num) < 0\n ? {\n div: new BN(0),\n mod: this,\n }\n : num.length === 1\n ? mode === \"div\"\n ? {\n div: this.divn(num.words[0]),\n mod: null,\n }\n : mode === \"mod\"\n ? {\n div: null,\n mod: new BN(this.modrn(num.words[0])),\n }\n : {\n div: this.divn(num.words[0]),\n mod: new BN(this.modrn(num.words[0])),\n }\n : this._wordDiv(num, mode);\n }),\n (BN.prototype.div = function (num) {\n return this.divmod(num, \"div\", !1).div;\n }),\n (BN.prototype.mod = function (num) {\n return this.divmod(num, \"mod\", !1).mod;\n }),\n (BN.prototype.umod = function (num) {\n return this.divmod(num, \"mod\", !0).mod;\n }),\n (BN.prototype.divRound = function (num) {\n var dm = this.divmod(num);\n if (dm.mod.isZero()) return dm.div;\n var mod = dm.div.negative !== 0 ? dm.mod.isub(num) : dm.mod,\n half = num.ushrn(1),\n r2 = num.andln(1),\n cmp = mod.cmp(half);\n return cmp < 0 || (r2 === 1 && cmp === 0)\n ? dm.div\n : dm.div.negative !== 0\n ? dm.div.isubn(1)\n : dm.div.iaddn(1);\n }),\n (BN.prototype.modrn = function (num) {\n var isNegNum = num < 0;\n isNegNum && (num = -num), assert(num <= 67108863);\n for (var p = (1 << 26) % num, acc = 0, i = this.length - 1; i >= 0; i--)\n acc = (p * acc + (this.words[i] | 0)) % num;\n return isNegNum ? -acc : acc;\n }),\n (BN.prototype.modn = function (num) {\n return this.modrn(num);\n }),\n (BN.prototype.idivn = function (num) {\n var isNegNum = num < 0;\n isNegNum && (num = -num), assert(num <= 67108863);\n for (var carry = 0, i = this.length - 1; i >= 0; i--) {\n var w = (this.words[i] | 0) + carry * 67108864;\n (this.words[i] = (w / num) | 0), (carry = w % num);\n }\n return this._strip(), isNegNum ? this.ineg() : this;\n }),\n (BN.prototype.divn = function (num) {\n return this.clone().idivn(num);\n }),\n (BN.prototype.egcd = function (p) {\n assert(p.negative === 0), assert(!p.isZero());\n var x = this,\n y = p.clone();\n x.negative !== 0 ? (x = x.umod(p)) : (x = x.clone());\n for (var A = new BN(1), B = new BN(0), C = new BN(0), D = new BN(1), g = 0; x.isEven() && y.isEven(); )\n x.iushrn(1), y.iushrn(1), ++g;\n for (var yp = y.clone(), xp = x.clone(); !x.isZero(); ) {\n for (var i = 0, im = 1; (x.words[0] & im) === 0 && i < 26; ++i, im <<= 1);\n if (i > 0)\n for (x.iushrn(i); i-- > 0; )\n (A.isOdd() || B.isOdd()) && (A.iadd(yp), B.isub(xp)), A.iushrn(1), B.iushrn(1);\n for (var j = 0, jm = 1; (y.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n if (j > 0)\n for (y.iushrn(j); j-- > 0; )\n (C.isOdd() || D.isOdd()) && (C.iadd(yp), D.isub(xp)), C.iushrn(1), D.iushrn(1);\n x.cmp(y) >= 0 ? (x.isub(y), A.isub(C), B.isub(D)) : (y.isub(x), C.isub(A), D.isub(B));\n }\n return {\n a: C,\n b: D,\n gcd: y.iushln(g),\n };\n }),\n (BN.prototype._invmp = function (p) {\n assert(p.negative === 0), assert(!p.isZero());\n var a = this,\n b = p.clone();\n a.negative !== 0 ? (a = a.umod(p)) : (a = a.clone());\n for (var x1 = new BN(1), x2 = new BN(0), delta = b.clone(); 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) for (a.iushrn(i); i-- > 0; ) x1.isOdd() && x1.iadd(delta), x1.iushrn(1);\n for (var j = 0, jm = 1; (b.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n if (j > 0) for (b.iushrn(j); j-- > 0; ) x2.isOdd() && x2.iadd(delta), x2.iushrn(1);\n a.cmp(b) >= 0 ? (a.isub(b), x1.isub(x2)) : (b.isub(a), x2.isub(x1));\n }\n var res;\n return a.cmpn(1) === 0 ? (res = x1) : (res = x2), res.cmpn(0) < 0 && res.iadd(p), res;\n }),\n (BN.prototype.gcd = function (num) {\n if (this.isZero()) return num.abs();\n if (num.isZero()) return this.abs();\n var a = this.clone(),\n b = num.clone();\n (a.negative = 0), (b.negative = 0);\n for (var shift = 0; a.isEven() && b.isEven(); shift++) a.iushrn(1), b.iushrn(1);\n do {\n for (; a.isEven(); ) a.iushrn(1);\n for (; b.isEven(); ) b.iushrn(1);\n var r = a.cmp(b);\n if (r < 0) {\n var t = a;\n (a = b), (b = t);\n } else if (r === 0 || b.cmpn(1) === 0) break;\n a.isub(b);\n } while (!0);\n return b.iushln(shift);\n }),\n (BN.prototype.invm = function (num) {\n return this.egcd(num).a.umod(num);\n }),\n (BN.prototype.isEven = function () {\n return (this.words[0] & 1) === 0;\n }),\n (BN.prototype.isOdd = function () {\n return (this.words[0] & 1) === 1;\n }),\n (BN.prototype.andln = function (num) {\n return this.words[0] & num;\n }),\n (BN.prototype.bincn = function (bit) {\n assert(typeof bit == \"number\");\n var r = bit % 26,\n s = (bit - r) / 26,\n q = 1 << r;\n if (this.length <= s) return this._expand(s + 1), (this.words[s] |= q), this;\n for (var carry = q, i = s; carry !== 0 && i < this.length; i++) {\n var w = this.words[i] | 0;\n (w += carry), (carry = w >>> 26), (w &= 67108863), (this.words[i] = w);\n }\n return carry !== 0 && ((this.words[i] = carry), this.length++), this;\n }),\n (BN.prototype.isZero = function () {\n return this.length === 1 && this.words[0] === 0;\n }),\n (BN.prototype.cmpn = function (num) {\n var negative = num < 0;\n if (this.negative !== 0 && !negative) return -1;\n if (this.negative === 0 && negative) return 1;\n this._strip();\n var res;\n if (this.length > 1) res = 1;\n else {\n negative && (num = -num), assert(num <= 67108863, \"Number is too big\");\n var w = this.words[0] | 0;\n res = w === num ? 0 : w < num ? -1 : 1;\n }\n return this.negative !== 0 ? -res | 0 : res;\n }),\n (BN.prototype.cmp = function (num) {\n if (this.negative !== 0 && num.negative === 0) return -1;\n if (this.negative === 0 && num.negative !== 0) return 1;\n var res = this.ucmp(num);\n return this.negative !== 0 ? -res | 0 : res;\n }),\n (BN.prototype.ucmp = function (num) {\n if (this.length > num.length) return 1;\n if (this.length < num.length) return -1;\n for (var res = 0, i = this.length - 1; i >= 0; i--) {\n var a = this.words[i] | 0,\n b = num.words[i] | 0;\n if (a !== b) {\n a < b ? (res = -1) : a > b && (res = 1);\n break;\n }\n }\n return res;\n }),\n (BN.prototype.gtn = function (num) {\n return this.cmpn(num) === 1;\n }),\n (BN.prototype.gt = function (num) {\n return this.cmp(num) === 1;\n }),\n (BN.prototype.gten = function (num) {\n return this.cmpn(num) >= 0;\n }),\n (BN.prototype.gte = function (num) {\n return this.cmp(num) >= 0;\n }),\n (BN.prototype.ltn = function (num) {\n return this.cmpn(num) === -1;\n }),\n (BN.prototype.lt = function (num) {\n return this.cmp(num) === -1;\n }),\n (BN.prototype.lten = function (num) {\n return this.cmpn(num) <= 0;\n }),\n (BN.prototype.lte = function (num) {\n return this.cmp(num) <= 0;\n }),\n (BN.prototype.eqn = function (num) {\n return this.cmpn(num) === 0;\n }),\n (BN.prototype.eq = function (num) {\n return this.cmp(num) === 0;\n }),\n (BN.red = function (num) {\n return new Red(num);\n }),\n (BN.prototype.toRed = function (ctx) {\n return (\n assert(!this.red, \"Already a number in reduction context\"),\n assert(this.negative === 0, \"red works only with positives\"),\n ctx.convertTo(this)._forceRed(ctx)\n );\n }),\n (BN.prototype.fromRed = function () {\n return assert(this.red, \"fromRed works only with numbers in reduction context\"), this.red.convertFrom(this);\n }),\n (BN.prototype._forceRed = function (ctx) {\n return (this.red = ctx), this;\n }),\n (BN.prototype.forceRed = function (ctx) {\n return assert(!this.red, \"Already a number in reduction context\"), this._forceRed(ctx);\n }),\n (BN.prototype.redAdd = function (num) {\n return assert(this.red, \"redAdd works only with red numbers\"), this.red.add(this, num);\n }),\n (BN.prototype.redIAdd = function (num) {\n return assert(this.red, \"redIAdd works only with red numbers\"), this.red.iadd(this, num);\n }),\n (BN.prototype.redSub = function (num) {\n return assert(this.red, \"redSub works only with red numbers\"), this.red.sub(this, num);\n }),\n (BN.prototype.redISub = function (num) {\n return assert(this.red, \"redISub works only with red numbers\"), this.red.isub(this, num);\n }),\n (BN.prototype.redShl = function (num) {\n return assert(this.red, \"redShl works only with red numbers\"), this.red.shl(this, num);\n }),\n (BN.prototype.redMul = function (num) {\n return (\n assert(this.red, \"redMul works only with red numbers\"),\n this.red._verify2(this, num),\n this.red.mul(this, num)\n );\n }),\n (BN.prototype.redIMul = function (num) {\n return (\n assert(this.red, \"redMul works only with red numbers\"),\n this.red._verify2(this, num),\n this.red.imul(this, num)\n );\n }),\n (BN.prototype.redSqr = function () {\n return assert(this.red, \"redSqr works only with red numbers\"), this.red._verify1(this), this.red.sqr(this);\n }),\n (BN.prototype.redISqr = function () {\n return assert(this.red, \"redISqr works only with red numbers\"), this.red._verify1(this), this.red.isqr(this);\n }),\n (BN.prototype.redSqrt = function () {\n return assert(this.red, \"redSqrt works only with red numbers\"), this.red._verify1(this), this.red.sqrt(this);\n }),\n (BN.prototype.redInvm = function () {\n return assert(this.red, \"redInvm works only with red numbers\"), this.red._verify1(this), this.red.invm(this);\n }),\n (BN.prototype.redNeg = function () {\n return assert(this.red, \"redNeg works only with red numbers\"), this.red._verify1(this), this.red.neg(this);\n }),\n (BN.prototype.redPow = function (num) {\n return assert(this.red && !num.red, \"redPow(normalNum)\"), this.red._verify1(this), this.red.pow(this, num);\n });\n var primes = {\n k256: null,\n p224: null,\n p192: null,\n p25519: null,\n };\n function MPrime(name, p) {\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 (this.tmp = this._tmp());\n }\n (MPrime.prototype._tmp = function () {\n var tmp = new BN(null);\n return (tmp.words = new Array(Math.ceil(this.n / 13))), tmp;\n }),\n (MPrime.prototype.ireduce = function (num) {\n var r = num,\n rlen;\n do this.split(r, this.tmp), (r = this.imulK(r)), (r = r.iadd(this.tmp)), (rlen = r.bitLength());\n while (rlen > this.n);\n var cmp = rlen < this.n ? -1 : r.ucmp(this.p);\n return (\n cmp === 0\n ? ((r.words[0] = 0), (r.length = 1))\n : cmp > 0\n ? r.isub(this.p)\n : r.strip !== void 0\n ? r.strip()\n : r._strip(),\n r\n );\n }),\n (MPrime.prototype.split = function (input, out) {\n input.iushrn(this.n, 0, out);\n }),\n (MPrime.prototype.imulK = function (num) {\n return num.imul(this.k);\n });\n function K256() {\n MPrime.call(this, \"k256\", \"ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f\");\n }\n inherits(K256, MPrime),\n (K256.prototype.split = function (input, output) {\n for (var mask = 4194303, outLen = Math.min(input.length, 9), i = 0; i < outLen; i++)\n output.words[i] = input.words[i];\n if (((output.length = outLen), input.length <= 9)) {\n (input.words[0] = 0), (input.length = 1);\n return;\n }\n var prev = input.words[9];\n for (output.words[output.length++] = prev & mask, i = 10; i < input.length; i++) {\n var next = input.words[i] | 0;\n (input.words[i - 10] = ((next & mask) << 4) | (prev >>> 22)), (prev = next);\n }\n (prev >>>= 22),\n (input.words[i - 10] = prev),\n prev === 0 && input.length > 10 ? (input.length -= 10) : (input.length -= 9);\n }),\n (K256.prototype.imulK = function (num) {\n (num.words[num.length] = 0), (num.words[num.length + 1] = 0), (num.length += 2);\n for (var lo = 0, i = 0; i < num.length; i++) {\n var w = num.words[i] | 0;\n (lo += w * 977), (num.words[i] = lo & 67108863), (lo = w * 64 + ((lo / 67108864) | 0));\n }\n return (\n num.words[num.length - 1] === 0 && (num.length--, num.words[num.length - 1] === 0 && num.length--), num\n );\n });\n function P224() {\n MPrime.call(this, \"p224\", \"ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001\");\n }\n inherits(P224, MPrime);\n function P192() {\n MPrime.call(this, \"p192\", \"ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff\");\n }\n inherits(P192, MPrime);\n function P25519() {\n MPrime.call(this, \"25519\", \"7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed\");\n }\n inherits(P25519, MPrime),\n (P25519.prototype.imulK = function (num) {\n for (var carry = 0, i = 0; i < num.length; i++) {\n var hi = (num.words[i] | 0) * 19 + carry,\n lo = hi & 67108863;\n (hi >>>= 26), (num.words[i] = lo), (carry = hi);\n }\n return carry !== 0 && (num.words[num.length++] = carry), num;\n }),\n (BN._prime = function (name) {\n if (primes[name]) return primes[name];\n var prime2;\n if (name === \"k256\") prime2 = new K256();\n else if (name === \"p224\") prime2 = new P224();\n else if (name === \"p192\") prime2 = new P192();\n else if (name === \"p25519\") prime2 = new P25519();\n else throw new Error(\"Unknown prime \" + name);\n return (primes[name] = prime2), prime2;\n });\n function Red(m) {\n if (typeof m == \"string\") {\n var prime = BN._prime(m);\n (this.m = prime.p), (this.prime = prime);\n } else assert(m.gtn(1), \"modulus must be greater than 1\"), (this.m = m), (this.prime = null);\n }\n (Red.prototype._verify1 = function (a) {\n assert(a.negative === 0, \"red works only with positives\"), assert(a.red, \"red works only with red numbers\");\n }),\n (Red.prototype._verify2 = function (a, b) {\n assert((a.negative | b.negative) === 0, \"red works only with positives\"),\n assert(a.red && a.red === b.red, \"red works only with red numbers\");\n }),\n (Red.prototype.imod = function (a) {\n return this.prime ? this.prime.ireduce(a)._forceRed(this) : (move(a, a.umod(this.m)._forceRed(this)), a);\n }),\n (Red.prototype.neg = function (a) {\n return a.isZero() ? a.clone() : this.m.sub(a)._forceRed(this);\n }),\n (Red.prototype.add = function (a, b) {\n this._verify2(a, b);\n var res = a.add(b);\n return res.cmp(this.m) >= 0 && res.isub(this.m), res._forceRed(this);\n }),\n (Red.prototype.iadd = function (a, b) {\n this._verify2(a, b);\n var res = a.iadd(b);\n return res.cmp(this.m) >= 0 && res.isub(this.m), res;\n }),\n (Red.prototype.sub = function (a, b) {\n this._verify2(a, b);\n var res = a.sub(b);\n return res.cmpn(0) < 0 && res.iadd(this.m), res._forceRed(this);\n }),\n (Red.prototype.isub = function (a, b) {\n this._verify2(a, b);\n var res = a.isub(b);\n return res.cmpn(0) < 0 && res.iadd(this.m), res;\n }),\n (Red.prototype.shl = function (a, num) {\n return this._verify1(a), this.imod(a.ushln(num));\n }),\n (Red.prototype.imul = function (a, b) {\n return this._verify2(a, b), this.imod(a.imul(b));\n }),\n (Red.prototype.mul = function (a, b) {\n return this._verify2(a, b), this.imod(a.mul(b));\n }),\n (Red.prototype.isqr = function (a) {\n return this.imul(a, a.clone());\n }),\n (Red.prototype.sqr = function (a) {\n return this.mul(a, a);\n }),\n (Red.prototype.sqrt = function (a) {\n if (a.isZero()) return a.clone();\n var mod3 = this.m.andln(3);\n if ((assert(mod3 % 2 === 1), mod3 === 3)) {\n var pow = this.m.add(new BN(1)).iushrn(2);\n return this.pow(a, pow);\n }\n for (var q = this.m.subn(1), s = 0; !q.isZero() && q.andln(1) === 0; ) s++, q.iushrn(1);\n assert(!q.isZero());\n var one = new BN(1).toRed(this),\n nOne = one.redNeg(),\n lpow = this.m.subn(1).iushrn(1),\n z = this.m.bitLength();\n for (z = new BN(2 * z * z).toRed(this); this.pow(z, lpow).cmp(nOne) !== 0; ) z.redIAdd(nOne);\n for (\n var c = this.pow(z, q), r = this.pow(a, q.addn(1).iushrn(1)), t = this.pow(a, q), m = s;\n t.cmp(one) !== 0;\n\n ) {\n for (var tmp = t, i = 0; tmp.cmp(one) !== 0; i++) tmp = tmp.redSqr();\n assert(i < m);\n var b = this.pow(c, new BN(1).iushln(m - i - 1));\n (r = r.redMul(b)), (c = b.redSqr()), (t = t.redMul(c)), (m = i);\n }\n return r;\n }),\n (Red.prototype.invm = function (a) {\n var inv = a._invmp(this.m);\n return inv.negative !== 0 ? ((inv.negative = 0), this.imod(inv).redNeg()) : this.imod(inv);\n }),\n (Red.prototype.pow = function (a, num) {\n if (num.isZero()) return new BN(1).toRed(this);\n if (num.cmpn(1) === 0) return a.clone();\n var windowSize = 4,\n wnd = new Array(1 << windowSize);\n (wnd[0] = new BN(1).toRed(this)), (wnd[1] = a);\n for (var i = 2; i < wnd.length; i++) wnd[i] = this.mul(wnd[i - 1], a);\n var res = wnd[0],\n current = 0,\n currentLen = 0,\n start = num.bitLength() % 26;\n for (start === 0 && (start = 26), i = num.length - 1; i >= 0; i--) {\n for (var word = num.words[i], j = start - 1; j >= 0; j--) {\n var bit = (word >> j) & 1;\n if ((res !== wnd[0] && (res = this.sqr(res)), bit === 0 && current === 0)) {\n currentLen = 0;\n continue;\n }\n (current <<= 1),\n (current |= bit),\n currentLen++,\n !(currentLen !== windowSize && (i !== 0 || j !== 0)) &&\n ((res = this.mul(res, wnd[current])), (currentLen = 0), (current = 0));\n }\n start = 26;\n }\n return res;\n }),\n (Red.prototype.convertTo = function (num) {\n var r = num.umod(this.m);\n return r === num ? r.clone() : r;\n }),\n (Red.prototype.convertFrom = function (num) {\n var res = num.clone();\n return (res.red = null), res;\n }),\n (BN.mont = function (num) {\n return new Mont(num);\n });\n function Mont(m) {\n Red.call(this, m),\n (this.shift = this.m.bitLength()),\n this.shift % 26 !== 0 && (this.shift += 26 - (this.shift % 26)),\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 (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 (Mont.prototype.convertTo = function (num) {\n return this.imod(num.ushln(this.shift));\n }),\n (Mont.prototype.convertFrom = function (num) {\n var r = this.imod(num.mul(this.rinv));\n return (r.red = null), r;\n }),\n (Mont.prototype.imul = function (a, b) {\n if (a.isZero() || b.isZero()) return (a.words[0] = 0), (a.length = 1), a;\n var t = a.imul(b),\n c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m),\n u = t.isub(c).iushrn(this.shift),\n res = u;\n return (\n u.cmp(this.m) >= 0 ? (res = u.isub(this.m)) : u.cmpn(0) < 0 && (res = u.iadd(this.m)), res._forceRed(this)\n );\n }),\n (Mont.prototype.mul = function (a, b) {\n if (a.isZero() || b.isZero()) return new BN(0)._forceRed(this);\n var t = a.mul(b),\n c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m),\n u = t.isub(c).iushrn(this.shift),\n res = u;\n return (\n u.cmp(this.m) >= 0 ? (res = u.isub(this.m)) : u.cmpn(0) < 0 && (res = u.iadd(this.m)), res._forceRed(this)\n );\n }),\n (Mont.prototype.invm = function (a) {\n var res = this.imod(a._invmp(this.m).mul(this.r2));\n return res._forceRed(this);\n });\n })(typeof module > \"u\" || module, exports);\n },\n});\n\n// node_modules/browserify-rsa/index.js\nvar require_browserify_rsa = __commonJS({\n \"node_modules/browserify-rsa/index.js\"(exports, module) {\n var BN = require_bn3(),\n randomBytes = require_browser();\n function blind(priv) {\n var r = getr(priv),\n blinder = r.toRed(BN.mont(priv.modulus)).redPow(new BN(priv.publicExponent)).fromRed();\n return { blinder, unblinder: r.invm(priv.modulus) };\n }\n function getr(priv) {\n var len = priv.modulus.byteLength(),\n r;\n do r = new BN(randomBytes(len));\n while (r.cmp(priv.modulus) >= 0 || !r.umod(priv.prime1) || !r.umod(priv.prime2));\n return r;\n }\n function crt(msg, priv) {\n var blinds = blind(priv),\n len = priv.modulus.byteLength(),\n blinded = new BN(msg).mul(blinds.blinder).umod(priv.modulus),\n c1 = blinded.toRed(BN.mont(priv.prime1)),\n c2 = blinded.toRed(BN.mont(priv.prime2)),\n qinv = priv.coefficient,\n p = priv.prime1,\n q = priv.prime2,\n m1 = c1.redPow(priv.exponent1).fromRed(),\n m2 = c2.redPow(priv.exponent2).fromRed(),\n h = m1.isub(m2).imul(qinv).umod(p).imul(q);\n return m2.iadd(h).imul(blinds.unblinder).umod(priv.modulus).toArrayLike(Buffer, \"be\", len);\n }\n crt.getr = getr;\n module.exports = crt;\n },\n});\n\n// node_modules/elliptic/package.json\nvar require_package = __commonJS({\n \"node_modules/elliptic/package.json\"(exports, module) {\n module.exports = {\n name: \"elliptic\",\n version: \"6.5.4\",\n description: \"EC cryptography\",\n main: \"lib/elliptic.js\",\n files: [\"lib\"],\n scripts: {\n lint: \"eslint lib test\",\n \"lint:fix\": \"npm run lint -- --fix\",\n unit: \"istanbul test _mocha --reporter=spec test/index.js\",\n test: \"npm run lint && npm run unit\",\n version: \"grunt dist && git add dist/\",\n },\n repository: {\n type: \"git\",\n url: \"git@github.com:indutny/elliptic\",\n },\n keywords: [\"EC\", \"Elliptic\", \"curve\", \"Cryptography\"],\n author: \"Fedor Indutny <fedor@indutny.com>\",\n license: \"MIT\",\n bugs: {\n url: \"https://github.com/indutny/elliptic/issues\",\n },\n homepage: \"https://github.com/indutny/elliptic\",\n devDependencies: {\n brfs: \"^2.0.2\",\n coveralls: \"^3.1.0\",\n eslint: \"^7.6.0\",\n grunt: \"^1.2.1\",\n \"grunt-browserify\": \"^5.3.0\",\n \"grunt-cli\": \"^1.3.2\",\n \"grunt-contrib-connect\": \"^3.0.0\",\n \"grunt-contrib-copy\": \"^1.0.0\",\n \"grunt-contrib-uglify\": \"^5.0.0\",\n \"grunt-mocha-istanbul\": \"^5.0.2\",\n \"grunt-saucelabs\": \"^9.0.1\",\n istanbul: \"^0.4.5\",\n mocha: \"^8.0.1\",\n },\n dependencies: {\n \"bn.js\": \"^4.11.9\",\n brorand: \"^1.1.0\",\n \"hash.js\": \"^1.0.0\",\n \"hmac-drbg\": \"^1.0.1\",\n inherits: \"^2.0.4\",\n \"minimalistic-assert\": \"^1.0.1\",\n \"minimalistic-crypto-utils\": \"^1.0.1\",\n },\n };\n },\n});\n\n// node_modules/elliptic/node_modules/bn.js/lib/bn.js\nvar require_bn4 = __commonJS({\n \"node_modules/elliptic/node_modules/bn.js/lib/bn.js\"(exports, module) {\n (function (module2, exports2) {\n \"use strict\";\n function assert(val, msg) {\n if (!val) throw new Error(msg || \"Assertion failed\");\n }\n function inherits(ctor, superCtor) {\n ctor.super_ = superCtor;\n var TempCtor = function () {};\n (TempCtor.prototype = superCtor.prototype),\n (ctor.prototype = new TempCtor()),\n (ctor.prototype.constructor = ctor);\n }\n function BN(number, base, endian) {\n if (BN.isBN(number)) return number;\n (this.negative = 0),\n (this.words = null),\n (this.length = 0),\n (this.red = null),\n number !== null &&\n ((base === \"le\" || base === \"be\") && ((endian = base), (base = 10)),\n this._init(number || 0, base || 10, endian || \"be\"));\n }\n typeof module2 == \"object\" ? (module2.exports = BN) : (exports2.BN = BN), (BN.BN = BN), (BN.wordSize = 26);\n var Buffer2;\n try {\n typeof window < \"u\" && typeof window.Buffer < \"u\"\n ? (Buffer2 = window.Buffer)\n : (Buffer2 = __require(\"buffer\").Buffer);\n } catch {}\n (BN.isBN = function (num) {\n return num instanceof BN\n ? !0\n : num !== null &&\n typeof num == \"object\" &&\n num.constructor.wordSize === BN.wordSize &&\n Array.isArray(num.words);\n }),\n (BN.max = function (left, right) {\n return left.cmp(right) > 0 ? left : right;\n }),\n (BN.min = function (left, right) {\n return left.cmp(right) < 0 ? left : right;\n }),\n (BN.prototype._init = function (number, base, endian) {\n if (typeof number == \"number\") return this._initNumber(number, base, endian);\n if (typeof number == \"object\") return this._initArray(number, base, endian);\n base === \"hex\" && (base = 16),\n assert(base === (base | 0) && base >= 2 && base <= 36),\n (number = number.toString().replace(/\\s+/g, \"\"));\n var start = 0;\n number[0] === \"-\" && (start++, (this.negative = 1)),\n start < number.length &&\n (base === 16\n ? this._parseHex(number, start, endian)\n : (this._parseBase(number, base, start),\n endian === \"le\" && this._initArray(this.toArray(), base, endian)));\n }),\n (BN.prototype._initNumber = function (number, base, endian) {\n number < 0 && ((this.negative = 1), (number = -number)),\n number < 67108864\n ? ((this.words = [number & 67108863]), (this.length = 1))\n : number < 4503599627370496\n ? ((this.words = [number & 67108863, (number / 67108864) & 67108863]), (this.length = 2))\n : (assert(number < 9007199254740992),\n (this.words = [number & 67108863, (number / 67108864) & 67108863, 1]),\n (this.length = 3)),\n endian === \"le\" && this._initArray(this.toArray(), base, endian);\n }),\n (BN.prototype._initArray = function (number, base, endian) {\n if ((assert(typeof number.length == \"number\"), number.length <= 0))\n return (this.words = [0]), (this.length = 1), this;\n (this.length = Math.ceil(number.length / 3)), (this.words = new Array(this.length));\n for (var i = 0; i < this.length; i++) this.words[i] = 0;\n var j,\n w,\n off = 0;\n if (endian === \"be\")\n for (i = number.length - 1, j = 0; i >= 0; i -= 3)\n (w = number[i] | (number[i - 1] << 8) | (number[i - 2] << 16)),\n (this.words[j] |= (w << off) & 67108863),\n (this.words[j + 1] = (w >>> (26 - off)) & 67108863),\n (off += 24),\n off >= 26 && ((off -= 26), j++);\n else if (endian === \"le\")\n for (i = 0, j = 0; i < number.length; i += 3)\n (w = number[i] | (number[i + 1] << 8) | (number[i + 2] << 16)),\n (this.words[j] |= (w << off) & 67108863),\n (this.words[j + 1] = (w >>> (26 - off)) & 67108863),\n (off += 24),\n off >= 26 && ((off -= 26), j++);\n return this.strip();\n });\n function parseHex4Bits(string, index) {\n var c = string.charCodeAt(index);\n return c >= 65 && c <= 70 ? c - 55 : c >= 97 && c <= 102 ? c - 87 : (c - 48) & 15;\n }\n function parseHexByte(string, lowerBound, index) {\n var r = parseHex4Bits(string, index);\n return index - 1 >= lowerBound && (r |= parseHex4Bits(string, index - 1) << 4), r;\n }\n BN.prototype._parseHex = function (number, start, endian) {\n (this.length = Math.ceil((number.length - start) / 6)), (this.words = new Array(this.length));\n for (var i = 0; i < this.length; i++) this.words[i] = 0;\n var off = 0,\n j = 0,\n w;\n if (endian === \"be\")\n for (i = number.length - 1; i >= start; i -= 2)\n (w = parseHexByte(number, start, i) << off),\n (this.words[j] |= w & 67108863),\n off >= 18 ? ((off -= 18), (j += 1), (this.words[j] |= w >>> 26)) : (off += 8);\n else {\n var parseLength = number.length - start;\n for (i = parseLength % 2 === 0 ? start + 1 : start; i < number.length; i += 2)\n (w = parseHexByte(number, start, i) << off),\n (this.words[j] |= w & 67108863),\n off >= 18 ? ((off -= 18), (j += 1), (this.words[j] |= w >>> 26)) : (off += 8);\n }\n this.strip();\n };\n function parseBase(str, start, end, mul) {\n for (var r = 0, len = Math.min(str.length, end), i = start; i < len; i++) {\n var c = str.charCodeAt(i) - 48;\n (r *= mul), c >= 49 ? (r += c - 49 + 10) : c >= 17 ? (r += c - 17 + 10) : (r += c);\n }\n return r;\n }\n (BN.prototype._parseBase = function (number, base, start) {\n (this.words = [0]), (this.length = 1);\n for (var limbLen = 0, limbPow = 1; limbPow <= 67108863; limbPow *= base) limbLen++;\n limbLen--, (limbPow = (limbPow / base) | 0);\n for (\n var total = number.length - start,\n mod = total % limbLen,\n end = Math.min(total, total - mod) + start,\n word = 0,\n i = start;\n i < end;\n i += limbLen\n )\n (word = parseBase(number, i, i + limbLen, base)),\n this.imuln(limbPow),\n this.words[0] + word < 67108864 ? (this.words[0] += word) : this._iaddn(word);\n if (mod !== 0) {\n var pow = 1;\n for (word = parseBase(number, i, number.length, base), i = 0; i < mod; i++) pow *= base;\n this.imuln(pow), this.words[0] + word < 67108864 ? (this.words[0] += word) : this._iaddn(word);\n }\n this.strip();\n }),\n (BN.prototype.copy = function (dest) {\n dest.words = new Array(this.length);\n for (var i = 0; i < this.length; i++) dest.words[i] = this.words[i];\n (dest.length = this.length), (dest.negative = this.negative), (dest.red = this.red);\n }),\n (BN.prototype.clone = function () {\n var r = new BN(null);\n return this.copy(r), r;\n }),\n (BN.prototype._expand = function (size) {\n for (; this.length < size; ) this.words[this.length++] = 0;\n return this;\n }),\n (BN.prototype.strip = function () {\n for (; this.length > 1 && this.words[this.length - 1] === 0; ) this.length--;\n return this._normSign();\n }),\n (BN.prototype._normSign = function () {\n return this.length === 1 && this.words[0] === 0 && (this.negative = 0), this;\n }),\n (BN.prototype.inspect = function () {\n return (this.red ? \"<BN-R: \" : \"<BN: \") + this.toString(16) + \">\";\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 groupSizes = [\n 0, 0, 25, 16, 12, 11, 10, 9, 8, 8, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5,\n 5, 5,\n ],\n groupBases = [\n 0, 0, 33554432, 43046721, 16777216, 48828125, 60466176, 40353607, 16777216, 43046721, 1e7, 19487171, 35831808,\n 62748517, 7529536, 11390625, 16777216, 24137569, 34012224, 47045881, 64e6, 4084101, 5153632, 6436343, 7962624,\n 9765625, 11881376, 14348907, 17210368, 20511149, 243e5, 28629151, 33554432, 39135393, 45435424, 52521875,\n 60466176,\n ];\n (BN.prototype.toString = function (base, padding) {\n (base = base || 10), (padding = padding | 0 || 1);\n var out;\n if (base === 16 || base === \"hex\") {\n out = \"\";\n for (var off = 0, carry = 0, i = 0; i < this.length; i++) {\n var w = this.words[i],\n word = (((w << off) | carry) & 16777215).toString(16);\n (carry = (w >>> (24 - off)) & 16777215),\n carry !== 0 || i !== this.length - 1 ? (out = zeros[6 - word.length] + word + out) : (out = word + out),\n (off += 2),\n off >= 26 && ((off -= 26), i--);\n }\n for (carry !== 0 && (out = carry.toString(16) + out); out.length % padding !== 0; ) out = \"0\" + out;\n return this.negative !== 0 && (out = \"-\" + out), out;\n }\n if (base === (base | 0) && base >= 2 && base <= 36) {\n var groupSize = groupSizes[base],\n groupBase = groupBases[base];\n out = \"\";\n var c = this.clone();\n for (c.negative = 0; !c.isZero(); ) {\n var r = c.modn(groupBase).toString(base);\n (c = c.idivn(groupBase)), c.isZero() ? (out = r + out) : (out = zeros[groupSize - r.length] + r + out);\n }\n for (this.isZero() && (out = \"0\" + out); out.length % padding !== 0; ) out = \"0\" + out;\n return this.negative !== 0 && (out = \"-\" + out), out;\n }\n assert(!1, \"Base should be between 2 and 36\");\n }),\n (BN.prototype.toNumber = function () {\n var ret = this.words[0];\n return (\n this.length === 2\n ? (ret += this.words[1] * 67108864)\n : this.length === 3 && this.words[2] === 1\n ? (ret += 4503599627370496 + this.words[1] * 67108864)\n : this.length > 2 && assert(!1, \"Number can only safely store up to 53 bits\"),\n this.negative !== 0 ? -ret : ret\n );\n }),\n (BN.prototype.toJSON = function () {\n return this.toString(16);\n }),\n (BN.prototype.toBuffer = function (endian, length) {\n return assert(typeof Buffer2 < \"u\"), this.toArrayLike(Buffer2, endian, length);\n }),\n (BN.prototype.toArray = function (endian, length) {\n return this.toArrayLike(Array, endian, length);\n }),\n (BN.prototype.toArrayLike = function (ArrayType, endian, length) {\n var byteLength = this.byteLength(),\n 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 this.strip();\n var littleEndian = endian === \"le\",\n res = new ArrayType(reqLength),\n b,\n i,\n q = this.clone();\n if (littleEndian) {\n for (i = 0; !q.isZero(); i++) (b = q.andln(255)), q.iushrn(8), (res[i] = b);\n for (; i < reqLength; i++) res[i] = 0;\n } else {\n for (i = 0; i < reqLength - byteLength; i++) res[i] = 0;\n for (i = 0; !q.isZero(); i++) (b = q.andln(255)), q.iushrn(8), (res[reqLength - i - 1] = b);\n }\n return res;\n }),\n Math.clz32\n ? (BN.prototype._countBits = function (w) {\n return 32 - Math.clz32(w);\n })\n : (BN.prototype._countBits = function (w) {\n var t = w,\n r = 0;\n return (\n t >= 4096 && ((r += 13), (t >>>= 13)),\n t >= 64 && ((r += 7), (t >>>= 7)),\n t >= 8 && ((r += 4), (t >>>= 4)),\n t >= 2 && ((r += 2), (t >>>= 2)),\n r + t\n );\n }),\n (BN.prototype._zeroBits = function (w) {\n if (w === 0) return 26;\n var t = w,\n r = 0;\n return (\n (t & 8191) === 0 && ((r += 13), (t >>>= 13)),\n (t & 127) === 0 && ((r += 7), (t >>>= 7)),\n (t & 15) === 0 && ((r += 4), (t >>>= 4)),\n (t & 3) === 0 && ((r += 2), (t >>>= 2)),\n (t & 1) === 0 && r++,\n r\n );\n }),\n (BN.prototype.bitLength = function () {\n var w = this.words[this.length - 1],\n hi = this._countBits(w);\n return (this.length - 1) * 26 + hi;\n });\n function toBitArray(num) {\n for (var w = new Array(num.bitLength()), bit = 0; bit < w.length; bit++) {\n var off = (bit / 26) | 0,\n wbit = bit % 26;\n w[bit] = (num.words[off] & (1 << wbit)) >>> wbit;\n }\n return w;\n }\n (BN.prototype.zeroBits = function () {\n if (this.isZero()) return 0;\n for (var r = 0, i = 0; i < this.length; i++) {\n var b = this._zeroBits(this.words[i]);\n if (((r += b), b !== 26)) break;\n }\n return r;\n }),\n (BN.prototype.byteLength = function () {\n return Math.ceil(this.bitLength() / 8);\n }),\n (BN.prototype.toTwos = function (width) {\n return this.negative !== 0 ? this.abs().inotn(width).iaddn(1) : this.clone();\n }),\n (BN.prototype.fromTwos = function (width) {\n return this.testn(width - 1) ? this.notn(width).iaddn(1).ineg() : this.clone();\n }),\n (BN.prototype.isNeg = function () {\n return this.negative !== 0;\n }),\n (BN.prototype.neg = function () {\n return this.clone().ineg();\n }),\n (BN.prototype.ineg = function () {\n return this.isZero() || (this.negative ^= 1), this;\n }),\n (BN.prototype.iuor = function (num) {\n for (; this.length < num.length; ) this.words[this.length++] = 0;\n for (var i = 0; i < num.length; i++) this.words[i] = this.words[i] | num.words[i];\n return this.strip();\n }),\n (BN.prototype.ior = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuor(num);\n }),\n (BN.prototype.or = function (num) {\n return this.length > num.length ? this.clone().ior(num) : num.clone().ior(this);\n }),\n (BN.prototype.uor = function (num) {\n return this.length > num.length ? this.clone().iuor(num) : num.clone().iuor(this);\n }),\n (BN.prototype.iuand = function (num) {\n var b;\n this.length > num.length ? (b = num) : (b = this);\n for (var i = 0; i < b.length; i++) this.words[i] = this.words[i] & num.words[i];\n return (this.length = b.length), this.strip();\n }),\n (BN.prototype.iand = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuand(num);\n }),\n (BN.prototype.and = function (num) {\n return this.length > num.length ? this.clone().iand(num) : num.clone().iand(this);\n }),\n (BN.prototype.uand = function (num) {\n return this.length > num.length ? this.clone().iuand(num) : num.clone().iuand(this);\n }),\n (BN.prototype.iuxor = function (num) {\n var a, b;\n this.length > num.length ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var i = 0; i < b.length; i++) this.words[i] = a.words[i] ^ b.words[i];\n if (this !== a) for (; i < a.length; i++) this.words[i] = a.words[i];\n return (this.length = a.length), this.strip();\n }),\n (BN.prototype.ixor = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuxor(num);\n }),\n (BN.prototype.xor = function (num) {\n return this.length > num.length ? this.clone().ixor(num) : num.clone().ixor(this);\n }),\n (BN.prototype.uxor = function (num) {\n return this.length > num.length ? this.clone().iuxor(num) : num.clone().iuxor(this);\n }),\n (BN.prototype.inotn = function (width) {\n assert(typeof width == \"number\" && width >= 0);\n var bytesNeeded = Math.ceil(width / 26) | 0,\n bitsLeft = width % 26;\n this._expand(bytesNeeded), bitsLeft > 0 && bytesNeeded--;\n for (var i = 0; i < bytesNeeded; i++) this.words[i] = ~this.words[i] & 67108863;\n return bitsLeft > 0 && (this.words[i] = ~this.words[i] & (67108863 >> (26 - bitsLeft))), this.strip();\n }),\n (BN.prototype.notn = function (width) {\n return this.clone().inotn(width);\n }),\n (BN.prototype.setn = function (bit, val) {\n assert(typeof bit == \"number\" && bit >= 0);\n var off = (bit / 26) | 0,\n wbit = bit % 26;\n return (\n this._expand(off + 1),\n val\n ? (this.words[off] = this.words[off] | (1 << wbit))\n : (this.words[off] = this.words[off] & ~(1 << wbit)),\n this.strip()\n );\n }),\n (BN.prototype.iadd = function (num) {\n var r;\n if (this.negative !== 0 && num.negative === 0)\n return (this.negative = 0), (r = this.isub(num)), (this.negative ^= 1), this._normSign();\n if (this.negative === 0 && num.negative !== 0)\n return (num.negative = 0), (r = this.isub(num)), (num.negative = 1), r._normSign();\n var a, b;\n this.length > num.length ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var carry = 0, i = 0; i < b.length; i++)\n (r = (a.words[i] | 0) + (b.words[i] | 0) + carry), (this.words[i] = r & 67108863), (carry = r >>> 26);\n for (; carry !== 0 && i < a.length; i++)\n (r = (a.words[i] | 0) + carry), (this.words[i] = r & 67108863), (carry = r >>> 26);\n if (((this.length = a.length), carry !== 0)) (this.words[this.length] = carry), this.length++;\n else if (a !== this) for (; i < a.length; i++) this.words[i] = a.words[i];\n return this;\n }),\n (BN.prototype.add = function (num) {\n var res;\n return num.negative !== 0 && this.negative === 0\n ? ((num.negative = 0), (res = this.sub(num)), (num.negative ^= 1), res)\n : num.negative === 0 && this.negative !== 0\n ? ((this.negative = 0), (res = num.sub(this)), (this.negative = 1), res)\n : this.length > num.length\n ? this.clone().iadd(num)\n : num.clone().iadd(this);\n }),\n (BN.prototype.isub = function (num) {\n if (num.negative !== 0) {\n num.negative = 0;\n var r = this.iadd(num);\n return (num.negative = 1), r._normSign();\n } else if (this.negative !== 0)\n return (this.negative = 0), this.iadd(num), (this.negative = 1), this._normSign();\n var cmp = this.cmp(num);\n if (cmp === 0) return (this.negative = 0), (this.length = 1), (this.words[0] = 0), this;\n var a, b;\n cmp > 0 ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var carry = 0, i = 0; i < b.length; i++)\n (r = (a.words[i] | 0) - (b.words[i] | 0) + carry), (carry = r >> 26), (this.words[i] = r & 67108863);\n for (; carry !== 0 && i < a.length; i++)\n (r = (a.words[i] | 0) + carry), (carry = r >> 26), (this.words[i] = r & 67108863);\n if (carry === 0 && i < a.length && a !== this) for (; i < a.length; i++) this.words[i] = a.words[i];\n return (this.length = Math.max(this.length, i)), a !== this && (this.negative = 1), this.strip();\n }),\n (BN.prototype.sub = function (num) {\n return this.clone().isub(num);\n });\n function smallMulTo(self2, num, out) {\n out.negative = num.negative ^ self2.negative;\n var len = (self2.length + num.length) | 0;\n (out.length = len), (len = (len - 1) | 0);\n var a = self2.words[0] | 0,\n b = num.words[0] | 0,\n r = a * b,\n lo = r & 67108863,\n carry = (r / 67108864) | 0;\n out.words[0] = lo;\n for (var k = 1; k < len; k++) {\n for (\n var ncarry = carry >>> 26,\n rword = carry & 67108863,\n maxJ = Math.min(k, num.length - 1),\n j = Math.max(0, k - self2.length + 1);\n j <= maxJ;\n j++\n ) {\n var i = (k - j) | 0;\n (a = self2.words[i] | 0),\n (b = num.words[j] | 0),\n (r = a * b + rword),\n (ncarry += (r / 67108864) | 0),\n (rword = r & 67108863);\n }\n (out.words[k] = rword | 0), (carry = ncarry | 0);\n }\n return carry !== 0 ? (out.words[k] = carry | 0) : out.length--, out.strip();\n }\n var comb10MulTo = function (self2, num, out) {\n var a = self2.words,\n b = num.words,\n o = out.words,\n c = 0,\n lo,\n mid,\n hi,\n a0 = a[0] | 0,\n al0 = a0 & 8191,\n ah0 = a0 >>> 13,\n a1 = a[1] | 0,\n al1 = a1 & 8191,\n ah1 = a1 >>> 13,\n a2 = a[2] | 0,\n al2 = a2 & 8191,\n ah2 = a2 >>> 13,\n a3 = a[3] | 0,\n al3 = a3 & 8191,\n ah3 = a3 >>> 13,\n a4 = a[4] | 0,\n al4 = a4 & 8191,\n ah4 = a4 >>> 13,\n a5 = a[5] | 0,\n al5 = a5 & 8191,\n ah5 = a5 >>> 13,\n a6 = a[6] | 0,\n al6 = a6 & 8191,\n ah6 = a6 >>> 13,\n a7 = a[7] | 0,\n al7 = a7 & 8191,\n ah7 = a7 >>> 13,\n a8 = a[8] | 0,\n al8 = a8 & 8191,\n ah8 = a8 >>> 13,\n a9 = a[9] | 0,\n al9 = a9 & 8191,\n ah9 = a9 >>> 13,\n b0 = b[0] | 0,\n bl0 = b0 & 8191,\n bh0 = b0 >>> 13,\n b1 = b[1] | 0,\n bl1 = b1 & 8191,\n bh1 = b1 >>> 13,\n b2 = b[2] | 0,\n bl2 = b2 & 8191,\n bh2 = b2 >>> 13,\n b3 = b[3] | 0,\n bl3 = b3 & 8191,\n bh3 = b3 >>> 13,\n b4 = b[4] | 0,\n bl4 = b4 & 8191,\n bh4 = b4 >>> 13,\n b5 = b[5] | 0,\n bl5 = b5 & 8191,\n bh5 = b5 >>> 13,\n b6 = b[6] | 0,\n bl6 = b6 & 8191,\n bh6 = b6 >>> 13,\n b7 = b[7] | 0,\n bl7 = b7 & 8191,\n bh7 = b7 >>> 13,\n b8 = b[8] | 0,\n bl8 = b8 & 8191,\n bh8 = b8 >>> 13,\n b9 = b[9] | 0,\n bl9 = b9 & 8191,\n bh9 = b9 >>> 13;\n (out.negative = self2.negative ^ num.negative),\n (out.length = 19),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w0 >>> 26)) | 0),\n (w0 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w1 >>> 26)) | 0),\n (w1 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w2 >>> 26)) | 0),\n (w2 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w3 >>> 26)) | 0),\n (w3 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w4 >>> 26)) | 0),\n (w4 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w5 >>> 26)) | 0),\n (w5 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w6 >>> 26)) | 0),\n (w6 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w7 >>> 26)) | 0),\n (w7 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w8 >>> 26)) | 0),\n (w8 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w9 >>> 26)) | 0),\n (w9 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w10 >>> 26)) | 0),\n (w10 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w11 >>> 26)) | 0),\n (w11 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w12 >>> 26)) | 0),\n (w12 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w13 >>> 26)) | 0),\n (w13 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w14 >>> 26)) | 0),\n (w14 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w15 >>> 26)) | 0),\n (w15 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w16 >>> 26)) | 0),\n (w16 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w17 >>> 26)) | 0),\n (w17 &= 67108863),\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 & 8191) << 13)) | 0;\n return (\n (c = (((hi + (mid >>> 13)) | 0) + (w18 >>> 26)) | 0),\n (w18 &= 67108863),\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 c !== 0 && ((o[19] = c), out.length++),\n out\n );\n };\n Math.imul || (comb10MulTo = smallMulTo);\n function bigMulTo(self2, num, out) {\n (out.negative = num.negative ^ self2.negative), (out.length = self2.length + num.length);\n for (var carry = 0, hncarry = 0, k = 0; k < out.length - 1; k++) {\n var ncarry = hncarry;\n hncarry = 0;\n for (\n var rword = carry & 67108863, maxJ = Math.min(k, num.length - 1), j = Math.max(0, k - self2.length + 1);\n j <= maxJ;\n j++\n ) {\n var i = k - j,\n a = self2.words[i] | 0,\n b = num.words[j] | 0,\n r = a * b,\n lo = r & 67108863;\n (ncarry = (ncarry + ((r / 67108864) | 0)) | 0),\n (lo = (lo + rword) | 0),\n (rword = lo & 67108863),\n (ncarry = (ncarry + (lo >>> 26)) | 0),\n (hncarry += ncarry >>> 26),\n (ncarry &= 67108863);\n }\n (out.words[k] = rword), (carry = ncarry), (ncarry = hncarry);\n }\n return carry !== 0 ? (out.words[k] = carry) : out.length--, out.strip();\n }\n function jumboMulTo(self2, num, out) {\n var fftm = new FFTM();\n return fftm.mulp(self2, num, out);\n }\n BN.prototype.mulTo = function (num, out) {\n var res,\n len = this.length + num.length;\n return (\n this.length === 10 && num.length === 10\n ? (res = comb10MulTo(this, num, out))\n : len < 63\n ? (res = smallMulTo(this, num, out))\n : len < 1024\n ? (res = bigMulTo(this, num, out))\n : (res = jumboMulTo(this, num, out)),\n res\n );\n };\n function FFTM(x, y) {\n (this.x = x), (this.y = y);\n }\n (FFTM.prototype.makeRBT = function (N) {\n for (var t = new Array(N), l = BN.prototype._countBits(N) - 1, i = 0; i < N; i++) t[i] = this.revBin(i, l, N);\n return t;\n }),\n (FFTM.prototype.revBin = function (x, l, N) {\n if (x === 0 || x === N - 1) return x;\n for (var rb = 0, i = 0; i < l; i++) (rb |= (x & 1) << (l - i - 1)), (x >>= 1);\n return rb;\n }),\n (FFTM.prototype.permute = function (rbt, rws, iws, rtws, itws, N) {\n for (var i = 0; i < N; i++) (rtws[i] = rws[rbt[i]]), (itws[i] = iws[rbt[i]]);\n }),\n (FFTM.prototype.transform = function (rws, iws, rtws, itws, N, rbt) {\n this.permute(rbt, rws, iws, rtws, itws, N);\n for (var s = 1; s < N; s <<= 1)\n for (\n var l = s << 1, rtwdf = Math.cos((2 * Math.PI) / l), itwdf = Math.sin((2 * Math.PI) / l), p = 0;\n p < N;\n p += l\n )\n for (var rtwdf_ = rtwdf, itwdf_ = itwdf, j = 0; j < s; j++) {\n var re = rtws[p + j],\n ie = itws[p + j],\n ro = rtws[p + j + s],\n io = itws[p + j + s],\n rx = rtwdf_ * ro - itwdf_ * io;\n (io = rtwdf_ * io + itwdf_ * ro),\n (ro = rx),\n (rtws[p + j] = re + ro),\n (itws[p + j] = ie + io),\n (rtws[p + j + s] = re - ro),\n (itws[p + j + s] = ie - io),\n j !== l &&\n ((rx = rtwdf * rtwdf_ - itwdf * itwdf_), (itwdf_ = rtwdf * itwdf_ + itwdf * rtwdf_), (rtwdf_ = rx));\n }\n }),\n (FFTM.prototype.guessLen13b = function (n, m) {\n var N = Math.max(m, n) | 1,\n odd = N & 1,\n i = 0;\n for (N = (N / 2) | 0; N; N = N >>> 1) i++;\n return 1 << (i + 1 + odd);\n }),\n (FFTM.prototype.conjugate = function (rws, iws, N) {\n if (!(N <= 1))\n for (var i = 0; i < N / 2; i++) {\n var t = rws[i];\n (rws[i] = rws[N - i - 1]),\n (rws[N - i - 1] = t),\n (t = iws[i]),\n (iws[i] = -iws[N - i - 1]),\n (iws[N - i - 1] = -t);\n }\n }),\n (FFTM.prototype.normalize13b = function (ws, N) {\n for (var carry = 0, i = 0; i < N / 2; i++) {\n var w = Math.round(ws[2 * i + 1] / N) * 8192 + Math.round(ws[2 * i] / N) + carry;\n (ws[i] = w & 67108863), w < 67108864 ? (carry = 0) : (carry = (w / 67108864) | 0);\n }\n return ws;\n }),\n (FFTM.prototype.convert13b = function (ws, len, rws, N) {\n for (var carry = 0, i = 0; i < len; i++)\n (carry = carry + (ws[i] | 0)),\n (rws[2 * i] = carry & 8191),\n (carry = carry >>> 13),\n (rws[2 * i + 1] = carry & 8191),\n (carry = carry >>> 13);\n for (i = 2 * len; i < N; ++i) rws[i] = 0;\n assert(carry === 0), assert((carry & -8192) === 0);\n }),\n (FFTM.prototype.stub = function (N) {\n for (var ph = new Array(N), i = 0; i < N; i++) ph[i] = 0;\n return ph;\n }),\n (FFTM.prototype.mulp = function (x, y, out) {\n var N = 2 * this.guessLen13b(x.length, y.length),\n rbt = this.makeRBT(N),\n _ = this.stub(N),\n rws = new Array(N),\n rwst = new Array(N),\n iwst = new Array(N),\n nrws = new Array(N),\n nrwst = new Array(N),\n niwst = new Array(N),\n rmws = out.words;\n (rmws.length = N),\n this.convert13b(x.words, x.length, rws, N),\n this.convert13b(y.words, y.length, nrws, N),\n this.transform(rws, _, rwst, iwst, N, rbt),\n this.transform(nrws, _, nrwst, niwst, N, rbt);\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]), (rwst[i] = rx);\n }\n return (\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 (out.negative = x.negative ^ y.negative),\n (out.length = x.length + y.length),\n out.strip()\n );\n }),\n (BN.prototype.mul = function (num) {\n var out = new BN(null);\n return (out.words = new Array(this.length + num.length)), this.mulTo(num, out);\n }),\n (BN.prototype.mulf = function (num) {\n var out = new BN(null);\n return (out.words = new Array(this.length + num.length)), jumboMulTo(this, num, out);\n }),\n (BN.prototype.imul = function (num) {\n return this.clone().mulTo(num, this);\n }),\n (BN.prototype.imuln = function (num) {\n assert(typeof num == \"number\"), assert(num < 67108864);\n for (var carry = 0, i = 0; i < this.length; i++) {\n var w = (this.words[i] | 0) * num,\n lo = (w & 67108863) + (carry & 67108863);\n (carry >>= 26), (carry += (w / 67108864) | 0), (carry += lo >>> 26), (this.words[i] = lo & 67108863);\n }\n return carry !== 0 && ((this.words[i] = carry), this.length++), this;\n }),\n (BN.prototype.muln = function (num) {\n return this.clone().imuln(num);\n }),\n (BN.prototype.sqr = function () {\n return this.mul(this);\n }),\n (BN.prototype.isqr = function () {\n return this.imul(this.clone());\n }),\n (BN.prototype.pow = function (num) {\n var w = toBitArray(num);\n if (w.length === 0) return new BN(1);\n for (var res = this, i = 0; i < w.length && w[i] === 0; i++, res = res.sqr());\n if (++i < w.length) for (var q = res.sqr(); i < w.length; i++, q = q.sqr()) w[i] !== 0 && (res = res.mul(q));\n return res;\n }),\n (BN.prototype.iushln = function (bits) {\n assert(typeof bits == \"number\" && bits >= 0);\n var r = bits % 26,\n s = (bits - r) / 26,\n carryMask = (67108863 >>> (26 - r)) << (26 - r),\n i;\n if (r !== 0) {\n var carry = 0;\n for (i = 0; i < this.length; i++) {\n var newCarry = this.words[i] & carryMask,\n c = ((this.words[i] | 0) - newCarry) << r;\n (this.words[i] = c | carry), (carry = newCarry >>> (26 - r));\n }\n carry && ((this.words[i] = carry), this.length++);\n }\n if (s !== 0) {\n for (i = this.length - 1; i >= 0; i--) this.words[i + s] = this.words[i];\n for (i = 0; i < s; i++) this.words[i] = 0;\n this.length += s;\n }\n return this.strip();\n }),\n (BN.prototype.ishln = function (bits) {\n return assert(this.negative === 0), this.iushln(bits);\n }),\n (BN.prototype.iushrn = function (bits, hint, extended) {\n assert(typeof bits == \"number\" && bits >= 0);\n var h;\n hint ? (h = (hint - (hint % 26)) / 26) : (h = 0);\n var r = bits % 26,\n s = Math.min((bits - r) / 26, this.length),\n mask = 67108863 ^ ((67108863 >>> r) << r),\n maskedWords = extended;\n if (((h -= s), (h = Math.max(0, h)), maskedWords)) {\n for (var i = 0; i < s; i++) maskedWords.words[i] = this.words[i];\n maskedWords.length = s;\n }\n if (s !== 0)\n if (this.length > s) for (this.length -= s, i = 0; i < this.length; i++) this.words[i] = this.words[i + s];\n else (this.words[0] = 0), (this.length = 1);\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)), (carry = word & mask);\n }\n return (\n maskedWords && carry !== 0 && (maskedWords.words[maskedWords.length++] = carry),\n this.length === 0 && ((this.words[0] = 0), (this.length = 1)),\n this.strip()\n );\n }),\n (BN.prototype.ishrn = function (bits, hint, extended) {\n return assert(this.negative === 0), this.iushrn(bits, hint, extended);\n }),\n (BN.prototype.shln = function (bits) {\n return this.clone().ishln(bits);\n }),\n (BN.prototype.ushln = function (bits) {\n return this.clone().iushln(bits);\n }),\n (BN.prototype.shrn = function (bits) {\n return this.clone().ishrn(bits);\n }),\n (BN.prototype.ushrn = function (bits) {\n return this.clone().iushrn(bits);\n }),\n (BN.prototype.testn = function (bit) {\n assert(typeof bit == \"number\" && bit >= 0);\n var r = bit % 26,\n s = (bit - r) / 26,\n q = 1 << r;\n if (this.length <= s) return !1;\n var w = this.words[s];\n return !!(w & q);\n }),\n (BN.prototype.imaskn = function (bits) {\n assert(typeof bits == \"number\" && bits >= 0);\n var r = bits % 26,\n s = (bits - r) / 26;\n if ((assert(this.negative === 0, \"imaskn works only with positive numbers\"), this.length <= s)) return this;\n if ((r !== 0 && s++, (this.length = Math.min(s, this.length)), r !== 0)) {\n var mask = 67108863 ^ ((67108863 >>> r) << r);\n this.words[this.length - 1] &= mask;\n }\n return this.strip();\n }),\n (BN.prototype.maskn = function (bits) {\n return this.clone().imaskn(bits);\n }),\n (BN.prototype.iaddn = function (num) {\n return (\n assert(typeof num == \"number\"),\n assert(num < 67108864),\n num < 0\n ? this.isubn(-num)\n : this.negative !== 0\n ? this.length === 1 && (this.words[0] | 0) < num\n ? ((this.words[0] = num - (this.words[0] | 0)), (this.negative = 0), this)\n : ((this.negative = 0), this.isubn(num), (this.negative = 1), this)\n : this._iaddn(num)\n );\n }),\n (BN.prototype._iaddn = function (num) {\n this.words[0] += num;\n for (var i = 0; i < this.length && this.words[i] >= 67108864; i++)\n (this.words[i] -= 67108864), i === this.length - 1 ? (this.words[i + 1] = 1) : this.words[i + 1]++;\n return (this.length = Math.max(this.length, i + 1)), this;\n }),\n (BN.prototype.isubn = function (num) {\n if ((assert(typeof num == \"number\"), assert(num < 67108864), num < 0)) return this.iaddn(-num);\n if (this.negative !== 0) return (this.negative = 0), this.iaddn(num), (this.negative = 1), this;\n if (((this.words[0] -= num), this.length === 1 && this.words[0] < 0))\n (this.words[0] = -this.words[0]), (this.negative = 1);\n else\n for (var i = 0; i < this.length && this.words[i] < 0; i++)\n (this.words[i] += 67108864), (this.words[i + 1] -= 1);\n return this.strip();\n }),\n (BN.prototype.addn = function (num) {\n return this.clone().iaddn(num);\n }),\n (BN.prototype.subn = function (num) {\n return this.clone().isubn(num);\n }),\n (BN.prototype.iabs = function () {\n return (this.negative = 0), this;\n }),\n (BN.prototype.abs = function () {\n return this.clone().iabs();\n }),\n (BN.prototype._ishlnsubmul = function (num, mul, shift) {\n var len = num.length + shift,\n i;\n this._expand(len);\n var w,\n 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 & 67108863),\n (carry = (w >> 26) - ((right / 67108864) | 0)),\n (this.words[i + shift] = w & 67108863);\n }\n for (; i < this.length - shift; i++)\n (w = (this.words[i + shift] | 0) + carry), (carry = w >> 26), (this.words[i + shift] = w & 67108863);\n if (carry === 0) return this.strip();\n for (assert(carry === -1), carry = 0, i = 0; i < this.length; i++)\n (w = -(this.words[i] | 0) + carry), (carry = w >> 26), (this.words[i] = w & 67108863);\n return (this.negative = 1), this.strip();\n }),\n (BN.prototype._wordDiv = function (num, mode) {\n var shift = this.length - num.length,\n a = this.clone(),\n b = num,\n bhi = b.words[b.length - 1] | 0,\n bhiBits = this._countBits(bhi);\n (shift = 26 - bhiBits),\n shift !== 0 && ((b = b.ushln(shift)), a.iushln(shift), (bhi = b.words[b.length - 1] | 0));\n var m = a.length - b.length,\n q;\n if (mode !== \"mod\") {\n (q = new BN(null)), (q.length = m + 1), (q.words = new Array(q.length));\n for (var i = 0; i < q.length; i++) q.words[i] = 0;\n }\n var diff = a.clone()._ishlnsubmul(b, 1, m);\n diff.negative === 0 && ((a = diff), q && (q.words[m] = 1));\n for (var j = m - 1; j >= 0; j--) {\n var qj = (a.words[b.length + j] | 0) * 67108864 + (a.words[b.length + j - 1] | 0);\n for (qj = Math.min((qj / bhi) | 0, 67108863), a._ishlnsubmul(b, qj, j); a.negative !== 0; )\n qj--, (a.negative = 0), a._ishlnsubmul(b, 1, j), a.isZero() || (a.negative ^= 1);\n q && (q.words[j] = qj);\n }\n return (\n q && q.strip(),\n a.strip(),\n mode !== \"div\" && shift !== 0 && a.iushrn(shift),\n {\n div: q || null,\n mod: a,\n }\n );\n }),\n (BN.prototype.divmod = function (num, mode, positive) {\n if ((assert(!num.isZero()), this.isZero()))\n return {\n div: new BN(0),\n mod: new BN(0),\n };\n var div, mod, res;\n return this.negative !== 0 && num.negative === 0\n ? ((res = this.neg().divmod(num, mode)),\n mode !== \"mod\" && (div = res.div.neg()),\n mode !== \"div\" && ((mod = res.mod.neg()), positive && mod.negative !== 0 && mod.iadd(num)),\n {\n div,\n mod,\n })\n : this.negative === 0 && num.negative !== 0\n ? ((res = this.divmod(num.neg(), mode)),\n mode !== \"mod\" && (div = res.div.neg()),\n {\n div,\n mod: res.mod,\n })\n : (this.negative & num.negative) !== 0\n ? ((res = this.neg().divmod(num.neg(), mode)),\n mode !== \"div\" && ((mod = res.mod.neg()), positive && mod.negative !== 0 && mod.isub(num)),\n {\n div: res.div,\n mod,\n })\n : num.length > this.length || this.cmp(num) < 0\n ? {\n div: new BN(0),\n mod: this,\n }\n : num.length === 1\n ? mode === \"div\"\n ? {\n div: this.divn(num.words[0]),\n mod: null,\n }\n : mode === \"mod\"\n ? {\n div: null,\n mod: new BN(this.modn(num.words[0])),\n }\n : {\n div: this.divn(num.words[0]),\n mod: new BN(this.modn(num.words[0])),\n }\n : this._wordDiv(num, mode);\n }),\n (BN.prototype.div = function (num) {\n return this.divmod(num, \"div\", !1).div;\n }),\n (BN.prototype.mod = function (num) {\n return this.divmod(num, \"mod\", !1).mod;\n }),\n (BN.prototype.umod = function (num) {\n return this.divmod(num, \"mod\", !0).mod;\n }),\n (BN.prototype.divRound = function (num) {\n var dm = this.divmod(num);\n if (dm.mod.isZero()) return dm.div;\n var mod = dm.div.negative !== 0 ? dm.mod.isub(num) : dm.mod,\n half = num.ushrn(1),\n r2 = num.andln(1),\n cmp = mod.cmp(half);\n return cmp < 0 || (r2 === 1 && cmp === 0)\n ? dm.div\n : dm.div.negative !== 0\n ? dm.div.isubn(1)\n : dm.div.iaddn(1);\n }),\n (BN.prototype.modn = function (num) {\n assert(num <= 67108863);\n for (var p = (1 << 26) % num, acc = 0, i = this.length - 1; i >= 0; i--)\n acc = (p * acc + (this.words[i] | 0)) % num;\n return acc;\n }),\n (BN.prototype.idivn = function (num) {\n assert(num <= 67108863);\n for (var carry = 0, i = this.length - 1; i >= 0; i--) {\n var w = (this.words[i] | 0) + carry * 67108864;\n (this.words[i] = (w / num) | 0), (carry = w % num);\n }\n return this.strip();\n }),\n (BN.prototype.divn = function (num) {\n return this.clone().idivn(num);\n }),\n (BN.prototype.egcd = function (p) {\n assert(p.negative === 0), assert(!p.isZero());\n var x = this,\n y = p.clone();\n x.negative !== 0 ? (x = x.umod(p)) : (x = x.clone());\n for (var A = new BN(1), B = new BN(0), C = new BN(0), D = new BN(1), g = 0; x.isEven() && y.isEven(); )\n x.iushrn(1), y.iushrn(1), ++g;\n for (var yp = y.clone(), xp = x.clone(); !x.isZero(); ) {\n for (var i = 0, im = 1; (x.words[0] & im) === 0 && i < 26; ++i, im <<= 1);\n if (i > 0)\n for (x.iushrn(i); i-- > 0; )\n (A.isOdd() || B.isOdd()) && (A.iadd(yp), B.isub(xp)), A.iushrn(1), B.iushrn(1);\n for (var j = 0, jm = 1; (y.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n if (j > 0)\n for (y.iushrn(j); j-- > 0; )\n (C.isOdd() || D.isOdd()) && (C.iadd(yp), D.isub(xp)), C.iushrn(1), D.iushrn(1);\n x.cmp(y) >= 0 ? (x.isub(y), A.isub(C), B.isub(D)) : (y.isub(x), C.isub(A), D.isub(B));\n }\n return {\n a: C,\n b: D,\n gcd: y.iushln(g),\n };\n }),\n (BN.prototype._invmp = function (p) {\n assert(p.negative === 0), assert(!p.isZero());\n var a = this,\n b = p.clone();\n a.negative !== 0 ? (a = a.umod(p)) : (a = a.clone());\n for (var x1 = new BN(1), x2 = new BN(0), delta = b.clone(); 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) for (a.iushrn(i); i-- > 0; ) x1.isOdd() && x1.iadd(delta), x1.iushrn(1);\n for (var j = 0, jm = 1; (b.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n if (j > 0) for (b.iushrn(j); j-- > 0; ) x2.isOdd() && x2.iadd(delta), x2.iushrn(1);\n a.cmp(b) >= 0 ? (a.isub(b), x1.isub(x2)) : (b.isub(a), x2.isub(x1));\n }\n var res;\n return a.cmpn(1) === 0 ? (res = x1) : (res = x2), res.cmpn(0) < 0 && res.iadd(p), res;\n }),\n (BN.prototype.gcd = function (num) {\n if (this.isZero()) return num.abs();\n if (num.isZero()) return this.abs();\n var a = this.clone(),\n b = num.clone();\n (a.negative = 0), (b.negative = 0);\n for (var shift = 0; a.isEven() && b.isEven(); shift++) a.iushrn(1), b.iushrn(1);\n do {\n for (; a.isEven(); ) a.iushrn(1);\n for (; b.isEven(); ) b.iushrn(1);\n var r = a.cmp(b);\n if (r < 0) {\n var t = a;\n (a = b), (b = t);\n } else if (r === 0 || b.cmpn(1) === 0) break;\n a.isub(b);\n } while (!0);\n return b.iushln(shift);\n }),\n (BN.prototype.invm = function (num) {\n return this.egcd(num).a.umod(num);\n }),\n (BN.prototype.isEven = function () {\n return (this.words[0] & 1) === 0;\n }),\n (BN.prototype.isOdd = function () {\n return (this.words[0] & 1) === 1;\n }),\n (BN.prototype.andln = function (num) {\n return this.words[0] & num;\n }),\n (BN.prototype.bincn = function (bit) {\n assert(typeof bit == \"number\");\n var r = bit % 26,\n s = (bit - r) / 26,\n q = 1 << r;\n if (this.length <= s) return this._expand(s + 1), (this.words[s] |= q), this;\n for (var carry = q, i = s; carry !== 0 && i < this.length; i++) {\n var w = this.words[i] | 0;\n (w += carry), (carry = w >>> 26), (w &= 67108863), (this.words[i] = w);\n }\n return carry !== 0 && ((this.words[i] = carry), this.length++), this;\n }),\n (BN.prototype.isZero = function () {\n return this.length === 1 && this.words[0] === 0;\n }),\n (BN.prototype.cmpn = function (num) {\n var negative = num < 0;\n if (this.negative !== 0 && !negative) return -1;\n if (this.negative === 0 && negative) return 1;\n this.strip();\n var res;\n if (this.length > 1) res = 1;\n else {\n negative && (num = -num), assert(num <= 67108863, \"Number is too big\");\n var w = this.words[0] | 0;\n res = w === num ? 0 : w < num ? -1 : 1;\n }\n return this.negative !== 0 ? -res | 0 : res;\n }),\n (BN.prototype.cmp = function (num) {\n if (this.negative !== 0 && num.negative === 0) return -1;\n if (this.negative === 0 && num.negative !== 0) return 1;\n var res = this.ucmp(num);\n return this.negative !== 0 ? -res | 0 : res;\n }),\n (BN.prototype.ucmp = function (num) {\n if (this.length > num.length) return 1;\n if (this.length < num.length) return -1;\n for (var res = 0, i = this.length - 1; i >= 0; i--) {\n var a = this.words[i] | 0,\n b = num.words[i] | 0;\n if (a !== b) {\n a < b ? (res = -1) : a > b && (res = 1);\n break;\n }\n }\n return res;\n }),\n (BN.prototype.gtn = function (num) {\n return this.cmpn(num) === 1;\n }),\n (BN.prototype.gt = function (num) {\n return this.cmp(num) === 1;\n }),\n (BN.prototype.gten = function (num) {\n return this.cmpn(num) >= 0;\n }),\n (BN.prototype.gte = function (num) {\n return this.cmp(num) >= 0;\n }),\n (BN.prototype.ltn = function (num) {\n return this.cmpn(num) === -1;\n }),\n (BN.prototype.lt = function (num) {\n return this.cmp(num) === -1;\n }),\n (BN.prototype.lten = function (num) {\n return this.cmpn(num) <= 0;\n }),\n (BN.prototype.lte = function (num) {\n return this.cmp(num) <= 0;\n }),\n (BN.prototype.eqn = function (num) {\n return this.cmpn(num) === 0;\n }),\n (BN.prototype.eq = function (num) {\n return this.cmp(num) === 0;\n }),\n (BN.red = function (num) {\n return new Red(num);\n }),\n (BN.prototype.toRed = function (ctx) {\n return (\n assert(!this.red, \"Already a number in reduction context\"),\n assert(this.negative === 0, \"red works only with positives\"),\n ctx.convertTo(this)._forceRed(ctx)\n );\n }),\n (BN.prototype.fromRed = function () {\n return assert(this.red, \"fromRed works only with numbers in reduction context\"), this.red.convertFrom(this);\n }),\n (BN.prototype._forceRed = function (ctx) {\n return (this.red = ctx), this;\n }),\n (BN.prototype.forceRed = function (ctx) {\n return assert(!this.red, \"Already a number in reduction context\"), this._forceRed(ctx);\n }),\n (BN.prototype.redAdd = function (num) {\n return assert(this.red, \"redAdd works only with red numbers\"), this.red.add(this, num);\n }),\n (BN.prototype.redIAdd = function (num) {\n return assert(this.red, \"redIAdd works only with red numbers\"), this.red.iadd(this, num);\n }),\n (BN.prototype.redSub = function (num) {\n return assert(this.red, \"redSub works only with red numbers\"), this.red.sub(this, num);\n }),\n (BN.prototype.redISub = function (num) {\n return assert(this.red, \"redISub works only with red numbers\"), this.red.isub(this, num);\n }),\n (BN.prototype.redShl = function (num) {\n return assert(this.red, \"redShl works only with red numbers\"), this.red.shl(this, num);\n }),\n (BN.prototype.redMul = function (num) {\n return (\n assert(this.red, \"redMul works only with red numbers\"),\n this.red._verify2(this, num),\n this.red.mul(this, num)\n );\n }),\n (BN.prototype.redIMul = function (num) {\n return (\n assert(this.red, \"redMul works only with red numbers\"),\n this.red._verify2(this, num),\n this.red.imul(this, num)\n );\n }),\n (BN.prototype.redSqr = function () {\n return assert(this.red, \"redSqr works only with red numbers\"), this.red._verify1(this), this.red.sqr(this);\n }),\n (BN.prototype.redISqr = function () {\n return assert(this.red, \"redISqr works only with red numbers\"), this.red._verify1(this), this.red.isqr(this);\n }),\n (BN.prototype.redSqrt = function () {\n return assert(this.red, \"redSqrt works only with red numbers\"), this.red._verify1(this), this.red.sqrt(this);\n }),\n (BN.prototype.redInvm = function () {\n return assert(this.red, \"redInvm works only with red numbers\"), this.red._verify1(this), this.red.invm(this);\n }),\n (BN.prototype.redNeg = function () {\n return assert(this.red, \"redNeg works only with red numbers\"), this.red._verify1(this), this.red.neg(this);\n }),\n (BN.prototype.redPow = function (num) {\n return assert(this.red && !num.red, \"redPow(normalNum)\"), this.red._verify1(this), this.red.pow(this, num);\n });\n var primes = {\n k256: null,\n p224: null,\n p192: null,\n p25519: null,\n };\n function MPrime(name, p) {\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 (this.tmp = this._tmp());\n }\n (MPrime.prototype._tmp = function () {\n var tmp = new BN(null);\n return (tmp.words = new Array(Math.ceil(this.n / 13))), tmp;\n }),\n (MPrime.prototype.ireduce = function (num) {\n var r = num,\n rlen;\n do this.split(r, this.tmp), (r = this.imulK(r)), (r = r.iadd(this.tmp)), (rlen = r.bitLength());\n while (rlen > this.n);\n var cmp = rlen < this.n ? -1 : r.ucmp(this.p);\n return (\n cmp === 0\n ? ((r.words[0] = 0), (r.length = 1))\n : cmp > 0\n ? r.isub(this.p)\n : r.strip !== void 0\n ? r.strip()\n : r._strip(),\n r\n );\n }),\n (MPrime.prototype.split = function (input, out) {\n input.iushrn(this.n, 0, out);\n }),\n (MPrime.prototype.imulK = function (num) {\n return num.imul(this.k);\n });\n function K256() {\n MPrime.call(this, \"k256\", \"ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f\");\n }\n inherits(K256, MPrime),\n (K256.prototype.split = function (input, output) {\n for (var mask = 4194303, outLen = Math.min(input.length, 9), i = 0; i < outLen; i++)\n output.words[i] = input.words[i];\n if (((output.length = outLen), input.length <= 9)) {\n (input.words[0] = 0), (input.length = 1);\n return;\n }\n var prev = input.words[9];\n for (output.words[output.length++] = prev & mask, i = 10; i < input.length; i++) {\n var next = input.words[i] | 0;\n (input.words[i - 10] = ((next & mask) << 4) | (prev >>> 22)), (prev = next);\n }\n (prev >>>= 22),\n (input.words[i - 10] = prev),\n prev === 0 && input.length > 10 ? (input.length -= 10) : (input.length -= 9);\n }),\n (K256.prototype.imulK = function (num) {\n (num.words[num.length] = 0), (num.words[num.length + 1] = 0), (num.length += 2);\n for (var lo = 0, i = 0; i < num.length; i++) {\n var w = num.words[i] | 0;\n (lo += w * 977), (num.words[i] = lo & 67108863), (lo = w * 64 + ((lo / 67108864) | 0));\n }\n return (\n num.words[num.length - 1] === 0 && (num.length--, num.words[num.length - 1] === 0 && num.length--), num\n );\n });\n function P224() {\n MPrime.call(this, \"p224\", \"ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001\");\n }\n inherits(P224, MPrime);\n function P192() {\n MPrime.call(this, \"p192\", \"ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff\");\n }\n inherits(P192, MPrime);\n function P25519() {\n MPrime.call(this, \"25519\", \"7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed\");\n }\n inherits(P25519, MPrime),\n (P25519.prototype.imulK = function (num) {\n for (var carry = 0, i = 0; i < num.length; i++) {\n var hi = (num.words[i] | 0) * 19 + carry,\n lo = hi & 67108863;\n (hi >>>= 26), (num.words[i] = lo), (carry = hi);\n }\n return carry !== 0 && (num.words[num.length++] = carry), num;\n }),\n (BN._prime = function (name) {\n if (primes[name]) return primes[name];\n var prime2;\n if (name === \"k256\") prime2 = new K256();\n else if (name === \"p224\") prime2 = new P224();\n else if (name === \"p192\") prime2 = new P192();\n else if (name === \"p25519\") prime2 = new P25519();\n else throw new Error(\"Unknown prime \" + name);\n return (primes[name] = prime2), prime2;\n });\n function Red(m) {\n if (typeof m == \"string\") {\n var prime = BN._prime(m);\n (this.m = prime.p), (this.prime = prime);\n } else assert(m.gtn(1), \"modulus must be greater than 1\"), (this.m = m), (this.prime = null);\n }\n (Red.prototype._verify1 = function (a) {\n assert(a.negative === 0, \"red works only with positives\"), assert(a.red, \"red works only with red numbers\");\n }),\n (Red.prototype._verify2 = function (a, b) {\n assert((a.negative | b.negative) === 0, \"red works only with positives\"),\n assert(a.red && a.red === b.red, \"red works only with red numbers\");\n }),\n (Red.prototype.imod = function (a) {\n return this.prime ? this.prime.ireduce(a)._forceRed(this) : a.umod(this.m)._forceRed(this);\n }),\n (Red.prototype.neg = function (a) {\n return a.isZero() ? a.clone() : this.m.sub(a)._forceRed(this);\n }),\n (Red.prototype.add = function (a, b) {\n this._verify2(a, b);\n var res = a.add(b);\n return res.cmp(this.m) >= 0 && res.isub(this.m), res._forceRed(this);\n }),\n (Red.prototype.iadd = function (a, b) {\n this._verify2(a, b);\n var res = a.iadd(b);\n return res.cmp(this.m) >= 0 && res.isub(this.m), res;\n }),\n (Red.prototype.sub = function (a, b) {\n this._verify2(a, b);\n var res = a.sub(b);\n return res.cmpn(0) < 0 && res.iadd(this.m), res._forceRed(this);\n }),\n (Red.prototype.isub = function (a, b) {\n this._verify2(a, b);\n var res = a.isub(b);\n return res.cmpn(0) < 0 && res.iadd(this.m), res;\n }),\n (Red.prototype.shl = function (a, num) {\n return this._verify1(a), this.imod(a.ushln(num));\n }),\n (Red.prototype.imul = function (a, b) {\n return this._verify2(a, b), this.imod(a.imul(b));\n }),\n (Red.prototype.mul = function (a, b) {\n return this._verify2(a, b), this.imod(a.mul(b));\n }),\n (Red.prototype.isqr = function (a) {\n return this.imul(a, a.clone());\n }),\n (Red.prototype.sqr = function (a) {\n return this.mul(a, a);\n }),\n (Red.prototype.sqrt = function (a) {\n if (a.isZero()) return a.clone();\n var mod3 = this.m.andln(3);\n if ((assert(mod3 % 2 === 1), mod3 === 3)) {\n var pow = this.m.add(new BN(1)).iushrn(2);\n return this.pow(a, pow);\n }\n for (var q = this.m.subn(1), s = 0; !q.isZero() && q.andln(1) === 0; ) s++, q.iushrn(1);\n assert(!q.isZero());\n var one = new BN(1).toRed(this),\n nOne = one.redNeg(),\n lpow = this.m.subn(1).iushrn(1),\n z = this.m.bitLength();\n for (z = new BN(2 * z * z).toRed(this); this.pow(z, lpow).cmp(nOne) !== 0; ) z.redIAdd(nOne);\n for (\n var c = this.pow(z, q), r = this.pow(a, q.addn(1).iushrn(1)), t = this.pow(a, q), m = s;\n t.cmp(one) !== 0;\n\n ) {\n for (var tmp = t, i = 0; tmp.cmp(one) !== 0; i++) tmp = tmp.redSqr();\n assert(i < m);\n var b = this.pow(c, new BN(1).iushln(m - i - 1));\n (r = r.redMul(b)), (c = b.redSqr()), (t = t.redMul(c)), (m = i);\n }\n return r;\n }),\n (Red.prototype.invm = function (a) {\n var inv = a._invmp(this.m);\n return inv.negative !== 0 ? ((inv.negative = 0), this.imod(inv).redNeg()) : this.imod(inv);\n }),\n (Red.prototype.pow = function (a, num) {\n if (num.isZero()) return new BN(1).toRed(this);\n if (num.cmpn(1) === 0) return a.clone();\n var windowSize = 4,\n wnd = new Array(1 << windowSize);\n (wnd[0] = new BN(1).toRed(this)), (wnd[1] = a);\n for (var i = 2; i < wnd.length; i++) wnd[i] = this.mul(wnd[i - 1], a);\n var res = wnd[0],\n current = 0,\n currentLen = 0,\n start = num.bitLength() % 26;\n for (start === 0 && (start = 26), i = num.length - 1; i >= 0; i--) {\n for (var word = num.words[i], j = start - 1; j >= 0; j--) {\n var bit = (word >> j) & 1;\n if ((res !== wnd[0] && (res = this.sqr(res)), bit === 0 && current === 0)) {\n currentLen = 0;\n continue;\n }\n (current <<= 1),\n (current |= bit),\n currentLen++,\n !(currentLen !== windowSize && (i !== 0 || j !== 0)) &&\n ((res = this.mul(res, wnd[current])), (currentLen = 0), (current = 0));\n }\n start = 26;\n }\n return res;\n }),\n (Red.prototype.convertTo = function (num) {\n var r = num.umod(this.m);\n return r === num ? r.clone() : r;\n }),\n (Red.prototype.convertFrom = function (num) {\n var res = num.clone();\n return (res.red = null), res;\n }),\n (BN.mont = function (num) {\n return new Mont(num);\n });\n function Mont(m) {\n Red.call(this, m),\n (this.shift = this.m.bitLength()),\n this.shift % 26 !== 0 && (this.shift += 26 - (this.shift % 26)),\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 (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 (Mont.prototype.convertTo = function (num) {\n return this.imod(num.ushln(this.shift));\n }),\n (Mont.prototype.convertFrom = function (num) {\n var r = this.imod(num.mul(this.rinv));\n return (r.red = null), r;\n }),\n (Mont.prototype.imul = function (a, b) {\n if (a.isZero() || b.isZero()) return (a.words[0] = 0), (a.length = 1), a;\n var t = a.imul(b),\n c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m),\n u = t.isub(c).iushrn(this.shift),\n res = u;\n return (\n u.cmp(this.m) >= 0 ? (res = u.isub(this.m)) : u.cmpn(0) < 0 && (res = u.iadd(this.m)), res._forceRed(this)\n );\n }),\n (Mont.prototype.mul = function (a, b) {\n if (a.isZero() || b.isZero()) return new BN(0)._forceRed(this);\n var t = a.mul(b),\n c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m),\n u = t.isub(c).iushrn(this.shift),\n res = u;\n return (\n u.cmp(this.m) >= 0 ? (res = u.isub(this.m)) : u.cmpn(0) < 0 && (res = u.iadd(this.m)), res._forceRed(this)\n );\n }),\n (Mont.prototype.invm = function (a) {\n var res = this.imod(a._invmp(this.m).mul(this.r2));\n return res._forceRed(this);\n });\n })(typeof module > \"u\" || module, exports);\n },\n});\n\n// node_modules/minimalistic-crypto-utils/lib/utils.js\nvar require_utils2 = __commonJS({\n \"node_modules/minimalistic-crypto-utils/lib/utils.js\"(exports) {\n \"use strict\";\n var utils = exports;\n function toArray(msg, enc) {\n if (Array.isArray(msg)) return msg.slice();\n if (!msg) return [];\n var res = [];\n if (typeof msg != \"string\") {\n for (var i = 0; i < msg.length; i++) res[i] = msg[i] | 0;\n return res;\n }\n if (enc === \"hex\") {\n (msg = msg.replace(/[^a-z0-9]+/gi, \"\")), msg.length % 2 !== 0 && (msg = \"0\" + msg);\n for (var i = 0; i < msg.length; i += 2) res.push(parseInt(msg[i] + msg[i + 1], 16));\n } else\n for (var i = 0; i < msg.length; i++) {\n var c = msg.charCodeAt(i),\n hi = c >> 8,\n lo = c & 255;\n hi ? res.push(hi, lo) : res.push(lo);\n }\n return res;\n }\n utils.toArray = toArray;\n function zero2(word) {\n return word.length === 1 ? \"0\" + word : word;\n }\n utils.zero2 = zero2;\n function toHex(msg) {\n for (var res = \"\", i = 0; i < msg.length; i++) res += zero2(msg[i].toString(16));\n return res;\n }\n utils.toHex = toHex;\n utils.encode = function (arr, enc) {\n return enc === \"hex\" ? toHex(arr) : arr;\n };\n },\n});\n\n// node_modules/elliptic/lib/elliptic/utils.js\nvar require_utils3 = __commonJS({\n \"node_modules/elliptic/lib/elliptic/utils.js\"(exports) {\n \"use strict\";\n var utils = exports,\n BN = require_bn4(),\n minAssert = require_minimalistic_assert(),\n minUtils = require_utils2();\n utils.assert = minAssert;\n utils.toArray = minUtils.toArray;\n utils.zero2 = minUtils.zero2;\n utils.toHex = minUtils.toHex;\n utils.encode = minUtils.encode;\n function getNAF(num, w, bits) {\n var naf = new Array(Math.max(num.bitLength(), bits) + 1);\n naf.fill(0);\n for (var ws = 1 << (w + 1), k = num.clone(), i = 0; i < naf.length; i++) {\n var z,\n mod = k.andln(ws - 1);\n k.isOdd() ? (mod > (ws >> 1) - 1 ? (z = (ws >> 1) - mod) : (z = mod), k.isubn(z)) : (z = 0),\n (naf[i] = z),\n k.iushrn(1);\n }\n return naf;\n }\n utils.getNAF = getNAF;\n function getJSF(k1, k2) {\n var jsf = [[], []];\n (k1 = k1.clone()), (k2 = k2.clone());\n for (var d1 = 0, d2 = 0, m8; k1.cmpn(-d1) > 0 || k2.cmpn(-d2) > 0; ) {\n var m14 = (k1.andln(3) + d1) & 3,\n m24 = (k2.andln(3) + d2) & 3;\n m14 === 3 && (m14 = -1), m24 === 3 && (m24 = -1);\n var u1;\n (m14 & 1) === 0\n ? (u1 = 0)\n : ((m8 = (k1.andln(7) + d1) & 7), (m8 === 3 || m8 === 5) && m24 === 2 ? (u1 = -m14) : (u1 = m14)),\n jsf[0].push(u1);\n var u2;\n (m24 & 1) === 0\n ? (u2 = 0)\n : ((m8 = (k2.andln(7) + d2) & 7), (m8 === 3 || m8 === 5) && m14 === 2 ? (u2 = -m24) : (u2 = m24)),\n jsf[1].push(u2),\n 2 * d1 === u1 + 1 && (d1 = 1 - d1),\n 2 * d2 === u2 + 1 && (d2 = 1 - d2),\n k1.iushrn(1),\n k2.iushrn(1);\n }\n return jsf;\n }\n utils.getJSF = getJSF;\n function cachedProperty(obj, name, computer) {\n var key = \"_\" + name;\n obj.prototype[name] = function () {\n return this[key] !== void 0 ? this[key] : (this[key] = computer.call(this));\n };\n }\n utils.cachedProperty = cachedProperty;\n function parseBytes(bytes) {\n return typeof bytes == \"string\" ? utils.toArray(bytes, \"hex\") : bytes;\n }\n utils.parseBytes = parseBytes;\n function intFromLE(bytes) {\n return new BN(bytes, \"hex\", \"le\");\n }\n utils.intFromLE = intFromLE;\n },\n});\n\n// node_modules/elliptic/lib/elliptic/curve/base.js\nvar require_base = __commonJS({\n \"node_modules/elliptic/lib/elliptic/curve/base.js\"(exports, module) {\n \"use strict\";\n var BN = require_bn4(),\n utils = require_utils3(),\n getNAF = utils.getNAF,\n getJSF = utils.getJSF,\n assert = utils.assert;\n function BaseCurve(type, conf) {\n (this.type = type),\n (this.p = new BN(conf.p, 16)),\n (this.red = conf.prime ? BN.red(conf.prime) : BN.mont(this.p)),\n (this.zero = new BN(0).toRed(this.red)),\n (this.one = new BN(1).toRed(this.red)),\n (this.two = new BN(2).toRed(this.red)),\n (this.n = conf.n && new BN(conf.n, 16)),\n (this.g = conf.g && this.pointFromJSON(conf.g, conf.gRed)),\n (this._wnafT1 = new Array(4)),\n (this._wnafT2 = new Array(4)),\n (this._wnafT3 = new Array(4)),\n (this._wnafT4 = new Array(4)),\n (this._bitLength = this.n ? this.n.bitLength() : 0);\n var adjustCount = this.n && this.p.div(this.n);\n !adjustCount || adjustCount.cmpn(100) > 0\n ? (this.redN = null)\n : ((this._maxwellTrick = !0), (this.redN = this.n.toRed(this.red)));\n }\n module.exports = BaseCurve;\n BaseCurve.prototype.point = function () {\n throw new Error(\"Not implemented\");\n };\n BaseCurve.prototype.validate = function () {\n throw new Error(\"Not implemented\");\n };\n BaseCurve.prototype._fixedNafMul = function (p, k) {\n assert(p.precomputed);\n var doubles = p._getDoubles(),\n naf = getNAF(k, 1, this._bitLength),\n I = (1 << (doubles.step + 1)) - (doubles.step % 2 === 0 ? 2 : 1);\n I /= 3;\n var repr = [],\n j,\n nafW;\n for (j = 0; j < naf.length; j += doubles.step) {\n nafW = 0;\n for (var l = j + doubles.step - 1; l >= j; l--) nafW = (nafW << 1) + naf[l];\n repr.push(nafW);\n }\n for (var a = this.jpoint(null, null, null), b = this.jpoint(null, null, null), i = I; i > 0; i--) {\n for (j = 0; j < repr.length; j++)\n (nafW = repr[j]),\n nafW === i ? (b = b.mixedAdd(doubles.points[j])) : nafW === -i && (b = b.mixedAdd(doubles.points[j].neg()));\n a = a.add(b);\n }\n return a.toP();\n };\n BaseCurve.prototype._wnafMul = function (p, k) {\n var w = 4,\n nafPoints = p._getNAFPoints(w);\n w = nafPoints.wnd;\n for (\n var wnd = nafPoints.points,\n naf = getNAF(k, w, this._bitLength),\n acc = this.jpoint(null, null, null),\n i = naf.length - 1;\n i >= 0;\n i--\n ) {\n for (var l = 0; i >= 0 && naf[i] === 0; i--) l++;\n if ((i >= 0 && l++, (acc = acc.dblp(l)), i < 0)) break;\n var z = naf[i];\n assert(z !== 0),\n p.type === \"affine\"\n ? z > 0\n ? (acc = acc.mixedAdd(wnd[(z - 1) >> 1]))\n : (acc = acc.mixedAdd(wnd[(-z - 1) >> 1].neg()))\n : z > 0\n ? (acc = acc.add(wnd[(z - 1) >> 1]))\n : (acc = acc.add(wnd[(-z - 1) >> 1].neg()));\n }\n return p.type === \"affine\" ? acc.toP() : acc;\n };\n BaseCurve.prototype._wnafMulAdd = function (defW, points, coeffs, len, jacobianResult) {\n var wndWidth = this._wnafT1,\n wnd = this._wnafT2,\n naf = this._wnafT3,\n max = 0,\n i,\n j,\n p;\n for (i = 0; i < len; i++) {\n p = points[i];\n var nafPoints = p._getNAFPoints(defW);\n (wndWidth[i] = nafPoints.wnd), (wnd[i] = nafPoints.points);\n }\n for (i = len - 1; i >= 1; i -= 2) {\n var a = i - 1,\n b = i;\n if (wndWidth[a] !== 1 || wndWidth[b] !== 1) {\n (naf[a] = getNAF(coeffs[a], wndWidth[a], this._bitLength)),\n (naf[b] = getNAF(coeffs[b], wndWidth[b], this._bitLength)),\n (max = Math.max(naf[a].length, max)),\n (max = Math.max(naf[b].length, max));\n continue;\n }\n var comb = [points[a], null, null, points[b]];\n points[a].y.cmp(points[b].y) === 0\n ? ((comb[1] = points[a].add(points[b])), (comb[2] = points[a].toJ().mixedAdd(points[b].neg())))\n : points[a].y.cmp(points[b].y.redNeg()) === 0\n ? ((comb[1] = points[a].toJ().mixedAdd(points[b])), (comb[2] = points[a].add(points[b].neg())))\n : ((comb[1] = points[a].toJ().mixedAdd(points[b])), (comb[2] = points[a].toJ().mixedAdd(points[b].neg())));\n var index = [-3, -1, -5, -7, 0, 7, 5, 1, 3],\n jsf = getJSF(coeffs[a], coeffs[b]);\n for (\n max = Math.max(jsf[0].length, max), naf[a] = new Array(max), naf[b] = new Array(max), j = 0;\n j < max;\n j++\n ) {\n var ja = jsf[0][j] | 0,\n jb = jsf[1][j] | 0;\n (naf[a][j] = index[(ja + 1) * 3 + (jb + 1)]), (naf[b][j] = 0), (wnd[a] = comb);\n }\n }\n var acc = this.jpoint(null, null, null),\n tmp = this._wnafT4;\n for (i = max; i >= 0; i--) {\n for (var k = 0; i >= 0; ) {\n var zero = !0;\n for (j = 0; j < len; j++) (tmp[j] = naf[j][i] | 0), tmp[j] !== 0 && (zero = !1);\n if (!zero) break;\n k++, i--;\n }\n if ((i >= 0 && k++, (acc = acc.dblp(k)), i < 0)) break;\n for (j = 0; j < len; j++) {\n var z = tmp[j];\n z !== 0 &&\n (z > 0 ? (p = wnd[j][(z - 1) >> 1]) : z < 0 && (p = wnd[j][(-z - 1) >> 1].neg()),\n p.type === \"affine\" ? (acc = acc.mixedAdd(p)) : (acc = acc.add(p)));\n }\n }\n for (i = 0; i < len; i++) wnd[i] = null;\n return jacobianResult ? acc : acc.toP();\n };\n function BasePoint(curve, type) {\n (this.curve = curve), (this.type = type), (this.precomputed = null);\n }\n BaseCurve.BasePoint = BasePoint;\n BasePoint.prototype.eq = function () {\n throw new Error(\"Not implemented\");\n };\n BasePoint.prototype.validate = function () {\n return this.curve.validate(this);\n };\n BaseCurve.prototype.decodePoint = function (bytes, enc) {\n bytes = utils.toArray(bytes, enc);\n var len = this.p.byteLength();\n if ((bytes[0] === 4 || bytes[0] === 6 || bytes[0] === 7) && bytes.length - 1 === 2 * len) {\n bytes[0] === 6\n ? assert(bytes[bytes.length - 1] % 2 === 0)\n : bytes[0] === 7 && assert(bytes[bytes.length - 1] % 2 === 1);\n var res = this.point(bytes.slice(1, 1 + len), bytes.slice(1 + len, 1 + 2 * len));\n return res;\n } else if ((bytes[0] === 2 || bytes[0] === 3) && bytes.length - 1 === len)\n return this.pointFromX(bytes.slice(1, 1 + len), bytes[0] === 3);\n throw new Error(\"Unknown point format\");\n };\n BasePoint.prototype.encodeCompressed = function (enc) {\n return this.encode(enc, !0);\n };\n BasePoint.prototype._encode = function (compact) {\n var len = this.curve.p.byteLength(),\n x = this.getX().toArray(\"be\", len);\n return compact ? [this.getY().isEven() ? 2 : 3].concat(x) : [4].concat(x, this.getY().toArray(\"be\", len));\n };\n BasePoint.prototype.encode = function (enc, compact) {\n return utils.encode(this._encode(compact), enc);\n };\n BasePoint.prototype.precompute = function (power) {\n if (this.precomputed) return this;\n var precomputed = {\n doubles: null,\n naf: null,\n beta: null,\n };\n return (\n (precomputed.naf = this._getNAFPoints(8)),\n (precomputed.doubles = this._getDoubles(4, power)),\n (precomputed.beta = this._getBeta()),\n (this.precomputed = precomputed),\n this\n );\n };\n BasePoint.prototype._hasDoubles = function (k) {\n if (!this.precomputed) return !1;\n var doubles = this.precomputed.doubles;\n return doubles ? doubles.points.length >= Math.ceil((k.bitLength() + 1) / doubles.step) : !1;\n };\n BasePoint.prototype._getDoubles = function (step, power) {\n if (this.precomputed && this.precomputed.doubles) return this.precomputed.doubles;\n for (var doubles = [this], acc = this, i = 0; i < power; i += step) {\n for (var j = 0; j < step; j++) acc = acc.dbl();\n doubles.push(acc);\n }\n return {\n step,\n points: doubles,\n };\n };\n BasePoint.prototype._getNAFPoints = function (wnd) {\n if (this.precomputed && this.precomputed.naf) return this.precomputed.naf;\n for (var res = [this], max = (1 << wnd) - 1, dbl = max === 1 ? null : this.dbl(), i = 1; i < max; i++)\n res[i] = res[i - 1].add(dbl);\n return {\n wnd,\n points: res,\n };\n };\n BasePoint.prototype._getBeta = function () {\n return null;\n };\n BasePoint.prototype.dblp = function (k) {\n for (var r = this, i = 0; i < k; i++) r = r.dbl();\n return r;\n };\n },\n});\n\n// node_modules/elliptic/lib/elliptic/curve/short.js\nvar require_short = __commonJS({\n \"node_modules/elliptic/lib/elliptic/curve/short.js\"(exports, module) {\n \"use strict\";\n var utils = require_utils3(),\n BN = require_bn4(),\n inherits = require_inherits_browser(),\n Base = require_base(),\n assert = utils.assert;\n function ShortCurve(conf) {\n Base.call(this, \"short\", conf),\n (this.a = new BN(conf.a, 16).toRed(this.red)),\n (this.b = new BN(conf.b, 16).toRed(this.red)),\n (this.tinv = this.two.redInvm()),\n (this.zeroA = this.a.fromRed().cmpn(0) === 0),\n (this.threeA = this.a.fromRed().sub(this.p).cmpn(-3) === 0),\n (this.endo = this._getEndomorphism(conf)),\n (this._endoWnafT1 = new Array(4)),\n (this._endoWnafT2 = new Array(4));\n }\n inherits(ShortCurve, Base);\n module.exports = ShortCurve;\n ShortCurve.prototype._getEndomorphism = function (conf) {\n if (!(!this.zeroA || !this.g || !this.n || this.p.modn(3) !== 1)) {\n var beta, lambda;\n if (conf.beta) beta = new BN(conf.beta, 16).toRed(this.red);\n else {\n var betas = this._getEndoRoots(this.p);\n (beta = betas[0].cmp(betas[1]) < 0 ? betas[0] : betas[1]), (beta = beta.toRed(this.red));\n }\n if (conf.lambda) lambda = new BN(conf.lambda, 16);\n else {\n var lambdas = this._getEndoRoots(this.n);\n this.g.mul(lambdas[0]).x.cmp(this.g.x.redMul(beta)) === 0\n ? (lambda = lambdas[0])\n : ((lambda = lambdas[1]), assert(this.g.mul(lambda).x.cmp(this.g.x.redMul(beta)) === 0));\n }\n var basis;\n return (\n conf.basis\n ? (basis = conf.basis.map(function (vec) {\n return {\n a: new BN(vec.a, 16),\n b: new BN(vec.b, 16),\n };\n }))\n : (basis = this._getEndoBasis(lambda)),\n {\n beta,\n lambda,\n basis,\n }\n );\n }\n };\n ShortCurve.prototype._getEndoRoots = function (num) {\n var red = num === this.p ? this.red : BN.mont(num),\n tinv = new BN(2).toRed(red).redInvm(),\n ntinv = tinv.redNeg(),\n s = new BN(3).toRed(red).redNeg().redSqrt().redMul(tinv),\n l1 = ntinv.redAdd(s).fromRed(),\n l2 = ntinv.redSub(s).fromRed();\n return [l1, l2];\n };\n ShortCurve.prototype._getEndoBasis = function (lambda) {\n for (\n var aprxSqrt = this.n.ushrn(Math.floor(this.n.bitLength() / 2)),\n u = lambda,\n v = this.n.clone(),\n x1 = new BN(1),\n y1 = new BN(0),\n x2 = new BN(0),\n y2 = new BN(1),\n a0,\n b0,\n a1,\n b1,\n a2,\n b2,\n prevR,\n i = 0,\n r,\n x;\n u.cmpn(0) !== 0;\n\n ) {\n var q = v.div(u);\n (r = v.sub(q.mul(u))), (x = x2.sub(q.mul(x1)));\n var y = y2.sub(q.mul(y1));\n if (!a1 && r.cmp(aprxSqrt) < 0) (a0 = prevR.neg()), (b0 = x1), (a1 = r.neg()), (b1 = x);\n else if (a1 && ++i === 2) break;\n (prevR = r), (v = u), (u = r), (x2 = x1), (x1 = x), (y2 = y1), (y1 = y);\n }\n (a2 = r.neg()), (b2 = x);\n var len1 = a1.sqr().add(b1.sqr()),\n len2 = a2.sqr().add(b2.sqr());\n return (\n len2.cmp(len1) >= 0 && ((a2 = a0), (b2 = b0)),\n a1.negative && ((a1 = a1.neg()), (b1 = b1.neg())),\n a2.negative && ((a2 = a2.neg()), (b2 = b2.neg())),\n [\n { a: a1, b: b1 },\n { a: a2, b: b2 },\n ]\n );\n };\n ShortCurve.prototype._endoSplit = function (k) {\n var basis = this.endo.basis,\n v1 = basis[0],\n v2 = basis[1],\n c1 = v2.b.mul(k).divRound(this.n),\n c2 = v1.b.neg().mul(k).divRound(this.n),\n p1 = c1.mul(v1.a),\n p2 = c2.mul(v2.a),\n q1 = c1.mul(v1.b),\n q2 = c2.mul(v2.b),\n k1 = k.sub(p1).sub(p2),\n k2 = q1.add(q2).neg();\n return { k1, k2 };\n };\n ShortCurve.prototype.pointFromX = function (x, odd) {\n (x = new BN(x, 16)), x.red || (x = x.toRed(this.red));\n var y2 = x.redSqr().redMul(x).redIAdd(x.redMul(this.a)).redIAdd(this.b),\n y = y2.redSqrt();\n if (y.redSqr().redSub(y2).cmp(this.zero) !== 0) throw new Error(\"invalid point\");\n var isOdd = y.fromRed().isOdd();\n return ((odd && !isOdd) || (!odd && isOdd)) && (y = y.redNeg()), this.point(x, y);\n };\n ShortCurve.prototype.validate = function (point) {\n if (point.inf) return !0;\n var x = point.x,\n y = point.y,\n ax = this.a.redMul(x),\n rhs = x.redSqr().redMul(x).redIAdd(ax).redIAdd(this.b);\n return y.redSqr().redISub(rhs).cmpn(0) === 0;\n };\n ShortCurve.prototype._endoWnafMulAdd = function (points, coeffs, jacobianResult) {\n for (var npoints = this._endoWnafT1, ncoeffs = this._endoWnafT2, i = 0; i < points.length; i++) {\n var split = this._endoSplit(coeffs[i]),\n p = points[i],\n beta = p._getBeta();\n split.k1.negative && (split.k1.ineg(), (p = p.neg(!0))),\n split.k2.negative && (split.k2.ineg(), (beta = beta.neg(!0))),\n (npoints[i * 2] = p),\n (npoints[i * 2 + 1] = beta),\n (ncoeffs[i * 2] = split.k1),\n (ncoeffs[i * 2 + 1] = split.k2);\n }\n for (var res = this._wnafMulAdd(1, npoints, ncoeffs, i * 2, jacobianResult), j = 0; j < i * 2; j++)\n (npoints[j] = null), (ncoeffs[j] = null);\n return res;\n };\n function Point(curve, x, y, isRed) {\n Base.BasePoint.call(this, curve, \"affine\"),\n x === null && y === null\n ? ((this.x = null), (this.y = null), (this.inf = !0))\n : ((this.x = new BN(x, 16)),\n (this.y = new BN(y, 16)),\n isRed && (this.x.forceRed(this.curve.red), this.y.forceRed(this.curve.red)),\n this.x.red || (this.x = this.x.toRed(this.curve.red)),\n this.y.red || (this.y = this.y.toRed(this.curve.red)),\n (this.inf = !1));\n }\n inherits(Point, Base.BasePoint);\n ShortCurve.prototype.point = function (x, y, isRed) {\n return new Point(this, x, y, isRed);\n };\n ShortCurve.prototype.pointFromJSON = function (obj, red) {\n return Point.fromJSON(this, obj, red);\n };\n Point.prototype._getBeta = function () {\n if (!!this.curve.endo) {\n var pre = this.precomputed;\n if (pre && pre.beta) return pre.beta;\n var beta = this.curve.point(this.x.redMul(this.curve.endo.beta), this.y);\n if (pre) {\n var curve = this.curve,\n endoMul = function (p) {\n return curve.point(p.x.redMul(curve.endo.beta), p.y);\n };\n (pre.beta = beta),\n (beta.precomputed = {\n beta: null,\n naf: pre.naf && {\n wnd: pre.naf.wnd,\n points: pre.naf.points.map(endoMul),\n },\n doubles: pre.doubles && {\n step: pre.doubles.step,\n points: pre.doubles.points.map(endoMul),\n },\n });\n }\n return beta;\n }\n };\n Point.prototype.toJSON = function () {\n return this.precomputed\n ? [\n this.x,\n this.y,\n this.precomputed && {\n doubles: this.precomputed.doubles && {\n step: this.precomputed.doubles.step,\n points: this.precomputed.doubles.points.slice(1),\n },\n naf: this.precomputed.naf && {\n wnd: this.precomputed.naf.wnd,\n points: this.precomputed.naf.points.slice(1),\n },\n },\n ]\n : [this.x, this.y];\n };\n Point.fromJSON = function (curve, obj, red) {\n typeof obj == \"string\" && (obj = JSON.parse(obj));\n var res = curve.point(obj[0], obj[1], red);\n if (!obj[2]) return res;\n function obj2point(obj2) {\n return curve.point(obj2[0], obj2[1], red);\n }\n var pre = obj[2];\n return (\n (res.precomputed = {\n beta: null,\n doubles: pre.doubles && {\n step: pre.doubles.step,\n points: [res].concat(pre.doubles.points.map(obj2point)),\n },\n naf: pre.naf && {\n wnd: pre.naf.wnd,\n points: [res].concat(pre.naf.points.map(obj2point)),\n },\n }),\n res\n );\n };\n Point.prototype.inspect = function () {\n return this.isInfinity()\n ? \"<EC Point Infinity>\"\n : \"<EC Point x: \" + this.x.fromRed().toString(16, 2) + \" y: \" + this.y.fromRed().toString(16, 2) + \">\";\n };\n Point.prototype.isInfinity = function () {\n return this.inf;\n };\n Point.prototype.add = function (p) {\n if (this.inf) return p;\n if (p.inf) return this;\n if (this.eq(p)) return this.dbl();\n if (this.neg().eq(p)) return this.curve.point(null, null);\n if (this.x.cmp(p.x) === 0) return this.curve.point(null, null);\n var c = this.y.redSub(p.y);\n c.cmpn(0) !== 0 && (c = c.redMul(this.x.redSub(p.x).redInvm()));\n var nx = c.redSqr().redISub(this.x).redISub(p.x),\n ny = c.redMul(this.x.redSub(nx)).redISub(this.y);\n return this.curve.point(nx, ny);\n };\n Point.prototype.dbl = function () {\n if (this.inf) return this;\n var ys1 = this.y.redAdd(this.y);\n if (ys1.cmpn(0) === 0) return this.curve.point(null, null);\n var a = this.curve.a,\n x2 = this.x.redSqr(),\n dyinv = ys1.redInvm(),\n c = x2.redAdd(x2).redIAdd(x2).redIAdd(a).redMul(dyinv),\n nx = c.redSqr().redISub(this.x.redAdd(this.x)),\n ny = c.redMul(this.x.redSub(nx)).redISub(this.y);\n return this.curve.point(nx, ny);\n };\n Point.prototype.getX = function () {\n return this.x.fromRed();\n };\n Point.prototype.getY = function () {\n return this.y.fromRed();\n };\n Point.prototype.mul = function (k) {\n return (\n (k = new BN(k, 16)),\n this.isInfinity()\n ? this\n : this._hasDoubles(k)\n ? this.curve._fixedNafMul(this, k)\n : this.curve.endo\n ? this.curve._endoWnafMulAdd([this], [k])\n : this.curve._wnafMul(this, k)\n );\n };\n Point.prototype.mulAdd = function (k1, p2, k2) {\n var points = [this, p2],\n coeffs = [k1, k2];\n return this.curve.endo\n ? this.curve._endoWnafMulAdd(points, coeffs)\n : this.curve._wnafMulAdd(1, points, coeffs, 2);\n };\n Point.prototype.jmulAdd = function (k1, p2, k2) {\n var points = [this, p2],\n coeffs = [k1, k2];\n return this.curve.endo\n ? this.curve._endoWnafMulAdd(points, coeffs, !0)\n : this.curve._wnafMulAdd(1, points, coeffs, 2, !0);\n };\n Point.prototype.eq = function (p) {\n return this === p || (this.inf === p.inf && (this.inf || (this.x.cmp(p.x) === 0 && this.y.cmp(p.y) === 0)));\n };\n Point.prototype.neg = function (_precompute) {\n if (this.inf) return this;\n var res = this.curve.point(this.x, this.y.redNeg());\n if (_precompute && this.precomputed) {\n var pre = this.precomputed,\n negate = function (p) {\n return p.neg();\n };\n res.precomputed = {\n naf: pre.naf && {\n wnd: pre.naf.wnd,\n points: pre.naf.points.map(negate),\n },\n doubles: pre.doubles && {\n step: pre.doubles.step,\n points: pre.doubles.points.map(negate),\n },\n };\n }\n return res;\n };\n Point.prototype.toJ = function () {\n if (this.inf) return this.curve.jpoint(null, null, null);\n var res = this.curve.jpoint(this.x, this.y, this.curve.one);\n return res;\n };\n function JPoint(curve, x, y, z) {\n Base.BasePoint.call(this, curve, \"jacobian\"),\n x === null && y === null && z === null\n ? ((this.x = this.curve.one), (this.y = this.curve.one), (this.z = new BN(0)))\n : ((this.x = new BN(x, 16)), (this.y = new BN(y, 16)), (this.z = new BN(z, 16))),\n this.x.red || (this.x = this.x.toRed(this.curve.red)),\n this.y.red || (this.y = this.y.toRed(this.curve.red)),\n this.z.red || (this.z = this.z.toRed(this.curve.red)),\n (this.zOne = this.z === this.curve.one);\n }\n inherits(JPoint, Base.BasePoint);\n ShortCurve.prototype.jpoint = function (x, y, z) {\n return new JPoint(this, x, y, z);\n };\n JPoint.prototype.toP = function () {\n if (this.isInfinity()) return this.curve.point(null, null);\n var zinv = this.z.redInvm(),\n zinv2 = zinv.redSqr(),\n ax = this.x.redMul(zinv2),\n ay = this.y.redMul(zinv2).redMul(zinv);\n return this.curve.point(ax, ay);\n };\n JPoint.prototype.neg = function () {\n return this.curve.jpoint(this.x, this.y.redNeg(), this.z);\n };\n JPoint.prototype.add = function (p) {\n if (this.isInfinity()) return p;\n if (p.isInfinity()) return this;\n var pz2 = p.z.redSqr(),\n z2 = this.z.redSqr(),\n u1 = this.x.redMul(pz2),\n u2 = p.x.redMul(z2),\n s1 = this.y.redMul(pz2.redMul(p.z)),\n s2 = p.y.redMul(z2.redMul(this.z)),\n h = u1.redSub(u2),\n r = s1.redSub(s2);\n if (h.cmpn(0) === 0) return r.cmpn(0) !== 0 ? this.curve.jpoint(null, null, null) : this.dbl();\n var h2 = h.redSqr(),\n h3 = h2.redMul(h),\n v = u1.redMul(h2),\n nx = r.redSqr().redIAdd(h3).redISub(v).redISub(v),\n ny = r.redMul(v.redISub(nx)).redISub(s1.redMul(h3)),\n nz = this.z.redMul(p.z).redMul(h);\n return this.curve.jpoint(nx, ny, nz);\n };\n JPoint.prototype.mixedAdd = function (p) {\n if (this.isInfinity()) return p.toJ();\n if (p.isInfinity()) return this;\n var z2 = this.z.redSqr(),\n u1 = this.x,\n u2 = p.x.redMul(z2),\n s1 = this.y,\n s2 = p.y.redMul(z2).redMul(this.z),\n h = u1.redSub(u2),\n r = s1.redSub(s2);\n if (h.cmpn(0) === 0) return r.cmpn(0) !== 0 ? this.curve.jpoint(null, null, null) : this.dbl();\n var h2 = h.redSqr(),\n h3 = h2.redMul(h),\n v = u1.redMul(h2),\n nx = r.redSqr().redIAdd(h3).redISub(v).redISub(v),\n ny = r.redMul(v.redISub(nx)).redISub(s1.redMul(h3)),\n nz = this.z.redMul(h);\n return this.curve.jpoint(nx, ny, nz);\n };\n JPoint.prototype.dblp = function (pow) {\n if (pow === 0) return this;\n if (this.isInfinity()) return this;\n if (!pow) return this.dbl();\n var i;\n if (this.curve.zeroA || this.curve.threeA) {\n var r = this;\n for (i = 0; i < pow; i++) r = r.dbl();\n return r;\n }\n var a = this.curve.a,\n tinv = this.curve.tinv,\n jx = this.x,\n jy = this.y,\n jz = this.z,\n jz4 = jz.redSqr().redSqr(),\n jyd = jy.redAdd(jy);\n for (i = 0; i < pow; i++) {\n var jx2 = jx.redSqr(),\n jyd2 = jyd.redSqr(),\n jyd4 = jyd2.redSqr(),\n c = jx2.redAdd(jx2).redIAdd(jx2).redIAdd(a.redMul(jz4)),\n t1 = jx.redMul(jyd2),\n nx = c.redSqr().redISub(t1.redAdd(t1)),\n t2 = t1.redISub(nx),\n dny = c.redMul(t2);\n dny = dny.redIAdd(dny).redISub(jyd4);\n var nz = jyd.redMul(jz);\n i + 1 < pow && (jz4 = jz4.redMul(jyd4)), (jx = nx), (jz = nz), (jyd = dny);\n }\n return this.curve.jpoint(jx, jyd.redMul(tinv), jz);\n };\n JPoint.prototype.dbl = function () {\n return this.isInfinity()\n ? this\n : this.curve.zeroA\n ? this._zeroDbl()\n : this.curve.threeA\n ? this._threeDbl()\n : this._dbl();\n };\n JPoint.prototype._zeroDbl = function () {\n var nx, ny, nz;\n if (this.zOne) {\n var xx = this.x.redSqr(),\n yy = this.y.redSqr(),\n yyyy = yy.redSqr(),\n s = this.x.redAdd(yy).redSqr().redISub(xx).redISub(yyyy);\n s = s.redIAdd(s);\n var m = xx.redAdd(xx).redIAdd(xx),\n t = m.redSqr().redISub(s).redISub(s),\n yyyy8 = yyyy.redIAdd(yyyy);\n (yyyy8 = yyyy8.redIAdd(yyyy8)),\n (yyyy8 = yyyy8.redIAdd(yyyy8)),\n (nx = t),\n (ny = m.redMul(s.redISub(t)).redISub(yyyy8)),\n (nz = this.y.redAdd(this.y));\n } else {\n var a = this.x.redSqr(),\n b = this.y.redSqr(),\n c = b.redSqr(),\n d = this.x.redAdd(b).redSqr().redISub(a).redISub(c);\n d = d.redIAdd(d);\n var e = a.redAdd(a).redIAdd(a),\n f = e.redSqr(),\n c8 = c.redIAdd(c);\n (c8 = c8.redIAdd(c8)),\n (c8 = c8.redIAdd(c8)),\n (nx = f.redISub(d).redISub(d)),\n (ny = e.redMul(d.redISub(nx)).redISub(c8)),\n (nz = this.y.redMul(this.z)),\n (nz = nz.redIAdd(nz));\n }\n return this.curve.jpoint(nx, ny, nz);\n };\n JPoint.prototype._threeDbl = function () {\n var nx, ny, nz;\n if (this.zOne) {\n var xx = this.x.redSqr(),\n yy = this.y.redSqr(),\n yyyy = yy.redSqr(),\n s = this.x.redAdd(yy).redSqr().redISub(xx).redISub(yyyy);\n s = s.redIAdd(s);\n var m = xx.redAdd(xx).redIAdd(xx).redIAdd(this.curve.a),\n t = m.redSqr().redISub(s).redISub(s);\n nx = t;\n var yyyy8 = yyyy.redIAdd(yyyy);\n (yyyy8 = yyyy8.redIAdd(yyyy8)),\n (yyyy8 = yyyy8.redIAdd(yyyy8)),\n (ny = m.redMul(s.redISub(t)).redISub(yyyy8)),\n (nz = this.y.redAdd(this.y));\n } else {\n var delta = this.z.redSqr(),\n gamma = this.y.redSqr(),\n beta = this.x.redMul(gamma),\n alpha = this.x.redSub(delta).redMul(this.x.redAdd(delta));\n alpha = alpha.redAdd(alpha).redIAdd(alpha);\n var beta4 = beta.redIAdd(beta);\n beta4 = beta4.redIAdd(beta4);\n var beta8 = beta4.redAdd(beta4);\n (nx = alpha.redSqr().redISub(beta8)), (nz = this.y.redAdd(this.z).redSqr().redISub(gamma).redISub(delta));\n var ggamma8 = gamma.redSqr();\n (ggamma8 = ggamma8.redIAdd(ggamma8)),\n (ggamma8 = ggamma8.redIAdd(ggamma8)),\n (ggamma8 = ggamma8.redIAdd(ggamma8)),\n (ny = alpha.redMul(beta4.redISub(nx)).redISub(ggamma8));\n }\n return this.curve.jpoint(nx, ny, nz);\n };\n JPoint.prototype._dbl = function () {\n var a = this.curve.a,\n jx = this.x,\n jy = this.y,\n jz = this.z,\n jz4 = jz.redSqr().redSqr(),\n jx2 = jx.redSqr(),\n jy2 = jy.redSqr(),\n c = jx2.redAdd(jx2).redIAdd(jx2).redIAdd(a.redMul(jz4)),\n jxd4 = jx.redAdd(jx);\n jxd4 = jxd4.redIAdd(jxd4);\n var t1 = jxd4.redMul(jy2),\n nx = c.redSqr().redISub(t1.redAdd(t1)),\n t2 = t1.redISub(nx),\n jyd8 = jy2.redSqr();\n (jyd8 = jyd8.redIAdd(jyd8)), (jyd8 = jyd8.redIAdd(jyd8)), (jyd8 = jyd8.redIAdd(jyd8));\n var ny = c.redMul(t2).redISub(jyd8),\n nz = jy.redAdd(jy).redMul(jz);\n return this.curve.jpoint(nx, ny, nz);\n };\n JPoint.prototype.trpl = function () {\n if (!this.curve.zeroA) return this.dbl().add(this);\n var xx = this.x.redSqr(),\n yy = this.y.redSqr(),\n zz = this.z.redSqr(),\n yyyy = yy.redSqr(),\n m = xx.redAdd(xx).redIAdd(xx),\n mm = m.redSqr(),\n e = this.x.redAdd(yy).redSqr().redISub(xx).redISub(yyyy);\n (e = e.redIAdd(e)), (e = e.redAdd(e).redIAdd(e)), (e = e.redISub(mm));\n var ee = e.redSqr(),\n t = yyyy.redIAdd(yyyy);\n (t = t.redIAdd(t)), (t = t.redIAdd(t)), (t = t.redIAdd(t));\n var u = m.redIAdd(e).redSqr().redISub(mm).redISub(ee).redISub(t),\n yyu4 = yy.redMul(u);\n (yyu4 = yyu4.redIAdd(yyu4)), (yyu4 = yyu4.redIAdd(yyu4));\n var nx = this.x.redMul(ee).redISub(yyu4);\n (nx = nx.redIAdd(nx)), (nx = nx.redIAdd(nx));\n var ny = this.y.redMul(u.redMul(t.redISub(u)).redISub(e.redMul(ee)));\n (ny = ny.redIAdd(ny)), (ny = ny.redIAdd(ny)), (ny = ny.redIAdd(ny));\n var nz = this.z.redAdd(e).redSqr().redISub(zz).redISub(ee);\n return this.curve.jpoint(nx, ny, nz);\n };\n JPoint.prototype.mul = function (k, kbase) {\n return (k = new BN(k, kbase)), this.curve._wnafMul(this, k);\n };\n JPoint.prototype.eq = function (p) {\n if (p.type === \"affine\") return this.eq(p.toJ());\n if (this === p) return !0;\n var z2 = this.z.redSqr(),\n pz2 = p.z.redSqr();\n if (this.x.redMul(pz2).redISub(p.x.redMul(z2)).cmpn(0) !== 0) return !1;\n var z3 = z2.redMul(this.z),\n pz3 = pz2.redMul(p.z);\n return this.y.redMul(pz3).redISub(p.y.redMul(z3)).cmpn(0) === 0;\n };\n JPoint.prototype.eqXToP = function (x) {\n var zs = this.z.redSqr(),\n rx = x.toRed(this.curve.red).redMul(zs);\n if (this.x.cmp(rx) === 0) return !0;\n for (var xc = x.clone(), t = this.curve.redN.redMul(zs); ; ) {\n if ((xc.iadd(this.curve.n), xc.cmp(this.curve.p) >= 0)) return !1;\n if ((rx.redIAdd(t), this.x.cmp(rx) === 0)) return !0;\n }\n };\n JPoint.prototype.inspect = function () {\n return this.isInfinity()\n ? \"<EC JPoint Infinity>\"\n : \"<EC JPoint x: \" +\n this.x.toString(16, 2) +\n \" y: \" +\n this.y.toString(16, 2) +\n \" z: \" +\n this.z.toString(16, 2) +\n \">\";\n };\n JPoint.prototype.isInfinity = function () {\n return this.z.cmpn(0) === 0;\n };\n },\n});\n\n// node_modules/elliptic/lib/elliptic/curve/mont.js\nvar require_mont = __commonJS({\n \"node_modules/elliptic/lib/elliptic/curve/mont.js\"(exports, module) {\n \"use strict\";\n var BN = require_bn4(),\n inherits = require_inherits_browser(),\n Base = require_base(),\n utils = require_utils3();\n function MontCurve(conf) {\n Base.call(this, \"mont\", conf),\n (this.a = new BN(conf.a, 16).toRed(this.red)),\n (this.b = new BN(conf.b, 16).toRed(this.red)),\n (this.i4 = new BN(4).toRed(this.red).redInvm()),\n (this.two = new BN(2).toRed(this.red)),\n (this.a24 = this.i4.redMul(this.a.redAdd(this.two)));\n }\n inherits(MontCurve, Base);\n module.exports = MontCurve;\n MontCurve.prototype.validate = function (point) {\n var x = point.normalize().x,\n x2 = x.redSqr(),\n rhs = x2.redMul(x).redAdd(x2.redMul(this.a)).redAdd(x),\n y = rhs.redSqrt();\n return y.redSqr().cmp(rhs) === 0;\n };\n function Point(curve, x, z) {\n Base.BasePoint.call(this, curve, \"projective\"),\n x === null && z === null\n ? ((this.x = this.curve.one), (this.z = this.curve.zero))\n : ((this.x = new BN(x, 16)),\n (this.z = new BN(z, 16)),\n this.x.red || (this.x = this.x.toRed(this.curve.red)),\n this.z.red || (this.z = this.z.toRed(this.curve.red)));\n }\n inherits(Point, Base.BasePoint);\n MontCurve.prototype.decodePoint = function (bytes, enc) {\n return this.point(utils.toArray(bytes, enc), 1);\n };\n MontCurve.prototype.point = function (x, z) {\n return new Point(this, x, z);\n };\n MontCurve.prototype.pointFromJSON = function (obj) {\n return Point.fromJSON(this, obj);\n };\n Point.prototype.precompute = function () {};\n Point.prototype._encode = function () {\n return this.getX().toArray(\"be\", this.curve.p.byteLength());\n };\n Point.fromJSON = function (curve, obj) {\n return new Point(curve, obj[0], obj[1] || curve.one);\n };\n Point.prototype.inspect = function () {\n return this.isInfinity()\n ? \"<EC Point Infinity>\"\n : \"<EC Point x: \" + this.x.fromRed().toString(16, 2) + \" z: \" + this.z.fromRed().toString(16, 2) + \">\";\n };\n Point.prototype.isInfinity = function () {\n return this.z.cmpn(0) === 0;\n };\n Point.prototype.dbl = function () {\n var a = this.x.redAdd(this.z),\n aa = a.redSqr(),\n b = this.x.redSub(this.z),\n bb = b.redSqr(),\n c = aa.redSub(bb),\n nx = aa.redMul(bb),\n nz = c.redMul(bb.redAdd(this.curve.a24.redMul(c)));\n return this.curve.point(nx, nz);\n };\n Point.prototype.add = function () {\n throw new Error(\"Not supported on Montgomery curve\");\n };\n Point.prototype.diffAdd = function (p, diff) {\n var a = this.x.redAdd(this.z),\n b = this.x.redSub(this.z),\n c = p.x.redAdd(p.z),\n d = p.x.redSub(p.z),\n da = d.redMul(a),\n cb = c.redMul(b),\n nx = diff.z.redMul(da.redAdd(cb).redSqr()),\n nz = diff.x.redMul(da.redISub(cb).redSqr());\n return this.curve.point(nx, nz);\n };\n Point.prototype.mul = function (k) {\n for (\n var t = k.clone(), a = this, b = this.curve.point(null, null), c = this, bits = [];\n t.cmpn(0) !== 0;\n t.iushrn(1)\n )\n bits.push(t.andln(1));\n for (var i = bits.length - 1; i >= 0; i--)\n bits[i] === 0 ? ((a = a.diffAdd(b, c)), (b = b.dbl())) : ((b = a.diffAdd(b, c)), (a = a.dbl()));\n return b;\n };\n Point.prototype.mulAdd = function () {\n throw new Error(\"Not supported on Montgomery curve\");\n };\n Point.prototype.jumlAdd = function () {\n throw new Error(\"Not supported on Montgomery curve\");\n };\n Point.prototype.eq = function (other) {\n return this.getX().cmp(other.getX()) === 0;\n };\n Point.prototype.normalize = function () {\n return (this.x = this.x.redMul(this.z.redInvm())), (this.z = this.curve.one), this;\n };\n Point.prototype.getX = function () {\n return this.normalize(), this.x.fromRed();\n };\n },\n});\n\n// node_modules/elliptic/lib/elliptic/curve/edwards.js\nvar require_edwards = __commonJS({\n \"node_modules/elliptic/lib/elliptic/curve/edwards.js\"(exports, module) {\n \"use strict\";\n var utils = require_utils3(),\n BN = require_bn4(),\n inherits = require_inherits_browser(),\n Base = require_base(),\n assert = utils.assert;\n function EdwardsCurve(conf) {\n (this.twisted = (conf.a | 0) !== 1),\n (this.mOneA = this.twisted && (conf.a | 0) === -1),\n (this.extended = this.mOneA),\n Base.call(this, \"edwards\", conf),\n (this.a = new BN(conf.a, 16).umod(this.red.m)),\n (this.a = this.a.toRed(this.red)),\n (this.c = new BN(conf.c, 16).toRed(this.red)),\n (this.c2 = this.c.redSqr()),\n (this.d = new BN(conf.d, 16).toRed(this.red)),\n (this.dd = this.d.redAdd(this.d)),\n assert(!this.twisted || this.c.fromRed().cmpn(1) === 0),\n (this.oneC = (conf.c | 0) === 1);\n }\n inherits(EdwardsCurve, Base);\n module.exports = EdwardsCurve;\n EdwardsCurve.prototype._mulA = function (num) {\n return this.mOneA ? num.redNeg() : this.a.redMul(num);\n };\n EdwardsCurve.prototype._mulC = function (num) {\n return this.oneC ? num : this.c.redMul(num);\n };\n EdwardsCurve.prototype.jpoint = function (x, y, z, t) {\n return this.point(x, y, z, t);\n };\n EdwardsCurve.prototype.pointFromX = function (x, odd) {\n (x = new BN(x, 16)), x.red || (x = x.toRed(this.red));\n var x2 = x.redSqr(),\n rhs = this.c2.redSub(this.a.redMul(x2)),\n lhs = this.one.redSub(this.c2.redMul(this.d).redMul(x2)),\n y2 = rhs.redMul(lhs.redInvm()),\n y = y2.redSqrt();\n if (y.redSqr().redSub(y2).cmp(this.zero) !== 0) throw new Error(\"invalid point\");\n var isOdd = y.fromRed().isOdd();\n return ((odd && !isOdd) || (!odd && isOdd)) && (y = y.redNeg()), this.point(x, y);\n };\n EdwardsCurve.prototype.pointFromY = function (y, odd) {\n (y = new BN(y, 16)), y.red || (y = y.toRed(this.red));\n var y2 = y.redSqr(),\n lhs = y2.redSub(this.c2),\n rhs = y2.redMul(this.d).redMul(this.c2).redSub(this.a),\n x2 = lhs.redMul(rhs.redInvm());\n if (x2.cmp(this.zero) === 0) {\n if (odd) throw new Error(\"invalid point\");\n return this.point(this.zero, y);\n }\n var x = x2.redSqrt();\n if (x.redSqr().redSub(x2).cmp(this.zero) !== 0) throw new Error(\"invalid point\");\n return x.fromRed().isOdd() !== odd && (x = x.redNeg()), this.point(x, y);\n };\n EdwardsCurve.prototype.validate = function (point) {\n if (point.isInfinity()) return !0;\n point.normalize();\n var x2 = point.x.redSqr(),\n y2 = point.y.redSqr(),\n lhs = x2.redMul(this.a).redAdd(y2),\n rhs = this.c2.redMul(this.one.redAdd(this.d.redMul(x2).redMul(y2)));\n return lhs.cmp(rhs) === 0;\n };\n function Point(curve, x, y, z, t) {\n Base.BasePoint.call(this, curve, \"projective\"),\n x === null && y === null && z === null\n ? ((this.x = this.curve.zero),\n (this.y = this.curve.one),\n (this.z = this.curve.one),\n (this.t = this.curve.zero),\n (this.zOne = !0))\n : ((this.x = new BN(x, 16)),\n (this.y = new BN(y, 16)),\n (this.z = z ? new BN(z, 16) : this.curve.one),\n (this.t = t && new BN(t, 16)),\n this.x.red || (this.x = this.x.toRed(this.curve.red)),\n this.y.red || (this.y = this.y.toRed(this.curve.red)),\n this.z.red || (this.z = this.z.toRed(this.curve.red)),\n this.t && !this.t.red && (this.t = this.t.toRed(this.curve.red)),\n (this.zOne = this.z === this.curve.one),\n this.curve.extended &&\n !this.t &&\n ((this.t = this.x.redMul(this.y)), this.zOne || (this.t = this.t.redMul(this.z.redInvm()))));\n }\n inherits(Point, Base.BasePoint);\n EdwardsCurve.prototype.pointFromJSON = function (obj) {\n return Point.fromJSON(this, obj);\n };\n EdwardsCurve.prototype.point = function (x, y, z, t) {\n return new Point(this, x, y, z, t);\n };\n Point.fromJSON = function (curve, obj) {\n return new Point(curve, obj[0], obj[1], obj[2]);\n };\n Point.prototype.inspect = function () {\n return this.isInfinity()\n ? \"<EC Point Infinity>\"\n : \"<EC Point x: \" +\n this.x.fromRed().toString(16, 2) +\n \" y: \" +\n this.y.fromRed().toString(16, 2) +\n \" z: \" +\n this.z.fromRed().toString(16, 2) +\n \">\";\n };\n Point.prototype.isInfinity = function () {\n return this.x.cmpn(0) === 0 && (this.y.cmp(this.z) === 0 || (this.zOne && this.y.cmp(this.curve.c) === 0));\n };\n Point.prototype._extDbl = function () {\n var a = this.x.redSqr(),\n b = this.y.redSqr(),\n c = this.z.redSqr();\n c = c.redIAdd(c);\n var d = this.curve._mulA(a),\n e = this.x.redAdd(this.y).redSqr().redISub(a).redISub(b),\n g = d.redAdd(b),\n f = g.redSub(c),\n h = d.redSub(b),\n nx = e.redMul(f),\n ny = g.redMul(h),\n nt = e.redMul(h),\n nz = f.redMul(g);\n return this.curve.point(nx, ny, nz, nt);\n };\n Point.prototype._projDbl = function () {\n var b = this.x.redAdd(this.y).redSqr(),\n c = this.x.redSqr(),\n d = this.y.redSqr(),\n nx,\n ny,\n nz,\n e,\n h,\n j;\n if (this.curve.twisted) {\n e = this.curve._mulA(c);\n var f = e.redAdd(d);\n this.zOne\n ? ((nx = b.redSub(c).redSub(d).redMul(f.redSub(this.curve.two))),\n (ny = f.redMul(e.redSub(d))),\n (nz = f.redSqr().redSub(f).redSub(f)))\n : ((h = this.z.redSqr()),\n (j = f.redSub(h).redISub(h)),\n (nx = b.redSub(c).redISub(d).redMul(j)),\n (ny = f.redMul(e.redSub(d))),\n (nz = f.redMul(j)));\n } else\n (e = c.redAdd(d)),\n (h = this.curve._mulC(this.z).redSqr()),\n (j = e.redSub(h).redSub(h)),\n (nx = this.curve._mulC(b.redISub(e)).redMul(j)),\n (ny = this.curve._mulC(e).redMul(c.redISub(d))),\n (nz = e.redMul(j));\n return this.curve.point(nx, ny, nz);\n };\n Point.prototype.dbl = function () {\n return this.isInfinity() ? this : this.curve.extended ? this._extDbl() : this._projDbl();\n };\n Point.prototype._extAdd = function (p) {\n var a = this.y.redSub(this.x).redMul(p.y.redSub(p.x)),\n b = this.y.redAdd(this.x).redMul(p.y.redAdd(p.x)),\n c = this.t.redMul(this.curve.dd).redMul(p.t),\n d = this.z.redMul(p.z.redAdd(p.z)),\n e = b.redSub(a),\n f = d.redSub(c),\n g = d.redAdd(c),\n h = b.redAdd(a),\n nx = e.redMul(f),\n ny = g.redMul(h),\n nt = e.redMul(h),\n nz = f.redMul(g);\n return this.curve.point(nx, ny, nz, nt);\n };\n Point.prototype._projAdd = function (p) {\n var a = this.z.redMul(p.z),\n b = a.redSqr(),\n c = this.x.redMul(p.x),\n d = this.y.redMul(p.y),\n e = this.curve.d.redMul(c).redMul(d),\n f = b.redSub(e),\n g = b.redAdd(e),\n tmp = this.x.redAdd(this.y).redMul(p.x.redAdd(p.y)).redISub(c).redISub(d),\n nx = a.redMul(f).redMul(tmp),\n ny,\n nz;\n return (\n this.curve.twisted\n ? ((ny = a.redMul(g).redMul(d.redSub(this.curve._mulA(c)))), (nz = f.redMul(g)))\n : ((ny = a.redMul(g).redMul(d.redSub(c))), (nz = this.curve._mulC(f).redMul(g))),\n this.curve.point(nx, ny, nz)\n );\n };\n Point.prototype.add = function (p) {\n return this.isInfinity() ? p : p.isInfinity() ? this : this.curve.extended ? this._extAdd(p) : this._projAdd(p);\n };\n Point.prototype.mul = function (k) {\n return this._hasDoubles(k) ? this.curve._fixedNafMul(this, k) : this.curve._wnafMul(this, k);\n };\n Point.prototype.mulAdd = function (k1, p, k2) {\n return this.curve._wnafMulAdd(1, [this, p], [k1, k2], 2, !1);\n };\n Point.prototype.jmulAdd = function (k1, p, k2) {\n return this.curve._wnafMulAdd(1, [this, p], [k1, k2], 2, !0);\n };\n Point.prototype.normalize = function () {\n if (this.zOne) return this;\n var zi = this.z.redInvm();\n return (\n (this.x = this.x.redMul(zi)),\n (this.y = this.y.redMul(zi)),\n this.t && (this.t = this.t.redMul(zi)),\n (this.z = this.curve.one),\n (this.zOne = !0),\n this\n );\n };\n Point.prototype.neg = function () {\n return this.curve.point(this.x.redNeg(), this.y, this.z, this.t && this.t.redNeg());\n };\n Point.prototype.getX = function () {\n return this.normalize(), this.x.fromRed();\n };\n Point.prototype.getY = function () {\n return this.normalize(), this.y.fromRed();\n };\n Point.prototype.eq = function (other) {\n return this === other || (this.getX().cmp(other.getX()) === 0 && this.getY().cmp(other.getY()) === 0);\n };\n Point.prototype.eqXToP = function (x) {\n var rx = x.toRed(this.curve.red).redMul(this.z);\n if (this.x.cmp(rx) === 0) return !0;\n for (var xc = x.clone(), t = this.curve.redN.redMul(this.z); ; ) {\n if ((xc.iadd(this.curve.n), xc.cmp(this.curve.p) >= 0)) return !1;\n if ((rx.redIAdd(t), this.x.cmp(rx) === 0)) return !0;\n }\n };\n Point.prototype.toP = Point.prototype.normalize;\n Point.prototype.mixedAdd = Point.prototype.add;\n },\n});\n\n// node_modules/elliptic/lib/elliptic/curve/index.js\nvar require_curve = __commonJS({\n \"node_modules/elliptic/lib/elliptic/curve/index.js\"(exports) {\n \"use strict\";\n var curve = exports;\n curve.base = require_base();\n curve.short = require_short();\n curve.mont = require_mont();\n curve.edwards = require_edwards();\n },\n});\n\n// node_modules/hash.js/lib/hash/utils.js\nvar require_utils4 = __commonJS({\n \"node_modules/hash.js/lib/hash/utils.js\"(exports) {\n \"use strict\";\n var assert = require_minimalistic_assert(),\n inherits = require_inherits_browser();\n exports.inherits = inherits;\n function isSurrogatePair(msg, i) {\n return (msg.charCodeAt(i) & 64512) !== 55296 || i < 0 || i + 1 >= msg.length\n ? !1\n : (msg.charCodeAt(i + 1) & 64512) === 56320;\n }\n function toArray(msg, enc) {\n if (Array.isArray(msg)) return msg.slice();\n if (!msg) return [];\n var res = [];\n if (typeof msg == \"string\")\n if (enc) {\n if (enc === \"hex\")\n for (\n msg = msg.replace(/[^a-z0-9]+/gi, \"\"), msg.length % 2 !== 0 && (msg = \"0\" + msg), i = 0;\n i < msg.length;\n i += 2\n )\n res.push(parseInt(msg[i] + msg[i + 1], 16));\n } else\n for (var p = 0, i = 0; i < msg.length; i++) {\n var c = msg.charCodeAt(i);\n c < 128\n ? (res[p++] = c)\n : c < 2048\n ? ((res[p++] = (c >> 6) | 192), (res[p++] = (c & 63) | 128))\n : isSurrogatePair(msg, i)\n ? ((c = 65536 + ((c & 1023) << 10) + (msg.charCodeAt(++i) & 1023)),\n (res[p++] = (c >> 18) | 240),\n (res[p++] = ((c >> 12) & 63) | 128),\n (res[p++] = ((c >> 6) & 63) | 128),\n (res[p++] = (c & 63) | 128))\n : ((res[p++] = (c >> 12) | 224), (res[p++] = ((c >> 6) & 63) | 128), (res[p++] = (c & 63) | 128));\n }\n else for (i = 0; i < msg.length; i++) res[i] = msg[i] | 0;\n return res;\n }\n exports.toArray = toArray;\n function toHex(msg) {\n for (var res = \"\", i = 0; i < msg.length; i++) res += zero2(msg[i].toString(16));\n return res;\n }\n exports.toHex = toHex;\n function htonl(w) {\n var res = (w >>> 24) | ((w >>> 8) & 65280) | ((w << 8) & 16711680) | ((w & 255) << 24);\n return res >>> 0;\n }\n exports.htonl = htonl;\n function toHex32(msg, endian) {\n for (var res = \"\", i = 0; i < msg.length; i++) {\n var w = msg[i];\n endian === \"little\" && (w = htonl(w)), (res += zero8(w.toString(16)));\n }\n return res;\n }\n exports.toHex32 = toHex32;\n function zero2(word) {\n return word.length === 1 ? \"0\" + word : word;\n }\n exports.zero2 = zero2;\n function zero8(word) {\n return word.length === 7\n ? \"0\" + word\n : word.length === 6\n ? \"00\" + word\n : word.length === 5\n ? \"000\" + word\n : word.length === 4\n ? \"0000\" + word\n : word.length === 3\n ? \"00000\" + word\n : word.length === 2\n ? \"000000\" + word\n : word.length === 1\n ? \"0000000\" + word\n : word;\n }\n exports.zero8 = zero8;\n function join32(msg, start, end, endian) {\n var len = end - start;\n assert(len % 4 === 0);\n for (var res = new Array(len / 4), i = 0, k = start; i < res.length; i++, k += 4) {\n var w;\n endian === \"big\"\n ? (w = (msg[k] << 24) | (msg[k + 1] << 16) | (msg[k + 2] << 8) | msg[k + 3])\n : (w = (msg[k + 3] << 24) | (msg[k + 2] << 16) | (msg[k + 1] << 8) | msg[k]),\n (res[i] = w >>> 0);\n }\n return res;\n }\n exports.join32 = join32;\n function split32(msg, endian) {\n for (var res = new Array(msg.length * 4), i = 0, k = 0; i < msg.length; i++, k += 4) {\n var m = msg[i];\n endian === \"big\"\n ? ((res[k] = m >>> 24),\n (res[k + 1] = (m >>> 16) & 255),\n (res[k + 2] = (m >>> 8) & 255),\n (res[k + 3] = m & 255))\n : ((res[k + 3] = m >>> 24),\n (res[k + 2] = (m >>> 16) & 255),\n (res[k + 1] = (m >>> 8) & 255),\n (res[k] = m & 255));\n }\n return res;\n }\n exports.split32 = split32;\n function rotr32(w, b) {\n return (w >>> b) | (w << (32 - b));\n }\n exports.rotr32 = rotr32;\n function rotl32(w, b) {\n return (w << b) | (w >>> (32 - b));\n }\n exports.rotl32 = rotl32;\n function sum32(a, b) {\n return (a + b) >>> 0;\n }\n exports.sum32 = sum32;\n function sum32_3(a, b, c) {\n return (a + b + c) >>> 0;\n }\n exports.sum32_3 = sum32_3;\n function sum32_4(a, b, c, d) {\n return (a + b + c + d) >>> 0;\n }\n exports.sum32_4 = sum32_4;\n function sum32_5(a, b, c, d, e) {\n return (a + b + c + d + e) >>> 0;\n }\n exports.sum32_5 = sum32_5;\n function sum64(buf, pos, ah, al) {\n var bh = buf[pos],\n bl = buf[pos + 1],\n lo = (al + bl) >>> 0,\n hi = (lo < al ? 1 : 0) + ah + bh;\n (buf[pos] = hi >>> 0), (buf[pos + 1] = lo);\n }\n exports.sum64 = sum64;\n function sum64_hi(ah, al, bh, bl) {\n var lo = (al + bl) >>> 0,\n hi = (lo < al ? 1 : 0) + ah + bh;\n return hi >>> 0;\n }\n exports.sum64_hi = sum64_hi;\n function sum64_lo(ah, al, bh, bl) {\n var lo = al + bl;\n return lo >>> 0;\n }\n exports.sum64_lo = sum64_lo;\n function sum64_4_hi(ah, al, bh, bl, ch, cl, dh, dl) {\n var carry = 0,\n lo = al;\n (lo = (lo + bl) >>> 0),\n (carry += lo < al ? 1 : 0),\n (lo = (lo + cl) >>> 0),\n (carry += lo < cl ? 1 : 0),\n (lo = (lo + dl) >>> 0),\n (carry += lo < dl ? 1 : 0);\n var hi = ah + bh + ch + dh + carry;\n return hi >>> 0;\n }\n exports.sum64_4_hi = sum64_4_hi;\n function sum64_4_lo(ah, al, bh, bl, ch, cl, dh, dl) {\n var lo = al + bl + cl + dl;\n return lo >>> 0;\n }\n exports.sum64_4_lo = sum64_4_lo;\n function sum64_5_hi(ah, al, bh, bl, ch, cl, dh, dl, eh, el) {\n var carry = 0,\n lo = al;\n (lo = (lo + bl) >>> 0),\n (carry += lo < al ? 1 : 0),\n (lo = (lo + cl) >>> 0),\n (carry += lo < cl ? 1 : 0),\n (lo = (lo + dl) >>> 0),\n (carry += lo < dl ? 1 : 0),\n (lo = (lo + el) >>> 0),\n (carry += lo < el ? 1 : 0);\n var hi = ah + bh + ch + dh + eh + carry;\n return hi >>> 0;\n }\n exports.sum64_5_hi = sum64_5_hi;\n function sum64_5_lo(ah, al, bh, bl, ch, cl, dh, dl, eh, el) {\n var lo = al + bl + cl + dl + el;\n return lo >>> 0;\n }\n exports.sum64_5_lo = sum64_5_lo;\n function rotr64_hi(ah, al, num) {\n var r = (al << (32 - num)) | (ah >>> num);\n return r >>> 0;\n }\n exports.rotr64_hi = rotr64_hi;\n function rotr64_lo(ah, al, num) {\n var r = (ah << (32 - num)) | (al >>> num);\n return r >>> 0;\n }\n exports.rotr64_lo = rotr64_lo;\n function shr64_hi(ah, al, num) {\n return ah >>> num;\n }\n exports.shr64_hi = shr64_hi;\n function shr64_lo(ah, al, num) {\n var r = (ah << (32 - num)) | (al >>> num);\n return r >>> 0;\n }\n exports.shr64_lo = shr64_lo;\n },\n});\n\n// node_modules/hash.js/lib/hash/common.js\nvar require_common = __commonJS({\n \"node_modules/hash.js/lib/hash/common.js\"(exports) {\n \"use strict\";\n var utils = require_utils4(),\n assert = require_minimalistic_assert();\n function BlockHash() {\n (this.pending = null),\n (this.pendingTotal = 0),\n (this.blockSize = this.constructor.blockSize),\n (this.outSize = this.constructor.outSize),\n (this.hmacStrength = this.constructor.hmacStrength),\n (this.padLength = this.constructor.padLength / 8),\n (this.endian = \"big\"),\n (this._delta8 = this.blockSize / 8),\n (this._delta32 = this.blockSize / 32);\n }\n exports.BlockHash = BlockHash;\n BlockHash.prototype.update = function (msg, enc) {\n if (\n ((msg = utils.toArray(msg, enc)),\n this.pending ? (this.pending = this.pending.concat(msg)) : (this.pending = msg),\n (this.pendingTotal += msg.length),\n this.pending.length >= this._delta8)\n ) {\n msg = this.pending;\n var r = msg.length % this._delta8;\n (this.pending = msg.slice(msg.length - r, msg.length)),\n this.pending.length === 0 && (this.pending = null),\n (msg = utils.join32(msg, 0, msg.length - r, this.endian));\n for (var i = 0; i < msg.length; i += this._delta32) this._update(msg, i, i + this._delta32);\n }\n return this;\n };\n BlockHash.prototype.digest = function (enc) {\n return this.update(this._pad()), assert(this.pending === null), this._digest(enc);\n };\n BlockHash.prototype._pad = function () {\n var len = this.pendingTotal,\n bytes = this._delta8,\n k = bytes - ((len + this.padLength) % bytes),\n res = new Array(k + this.padLength);\n res[0] = 128;\n for (var i = 1; i < k; i++) res[i] = 0;\n if (((len <<= 3), this.endian === \"big\")) {\n for (var t = 8; t < this.padLength; t++) res[i++] = 0;\n (res[i++] = 0),\n (res[i++] = 0),\n (res[i++] = 0),\n (res[i++] = 0),\n (res[i++] = (len >>> 24) & 255),\n (res[i++] = (len >>> 16) & 255),\n (res[i++] = (len >>> 8) & 255),\n (res[i++] = len & 255);\n } else\n for (\n res[i++] = len & 255,\n res[i++] = (len >>> 8) & 255,\n res[i++] = (len >>> 16) & 255,\n res[i++] = (len >>> 24) & 255,\n res[i++] = 0,\n res[i++] = 0,\n res[i++] = 0,\n res[i++] = 0,\n t = 8;\n t < this.padLength;\n t++\n )\n res[i++] = 0;\n return res;\n };\n },\n});\n\n// node_modules/hash.js/lib/hash/sha/common.js\nvar require_common2 = __commonJS({\n \"node_modules/hash.js/lib/hash/sha/common.js\"(exports) {\n \"use strict\";\n var utils = require_utils4(),\n rotr32 = utils.rotr32;\n function ft_1(s, x, y, z) {\n if (s === 0) return ch32(x, y, z);\n if (s === 1 || s === 3) return p32(x, y, z);\n if (s === 2) return maj32(x, y, z);\n }\n exports.ft_1 = ft_1;\n function ch32(x, y, z) {\n return (x & y) ^ (~x & z);\n }\n exports.ch32 = ch32;\n function maj32(x, y, z) {\n return (x & y) ^ (x & z) ^ (y & z);\n }\n exports.maj32 = maj32;\n function p32(x, y, z) {\n return x ^ y ^ z;\n }\n exports.p32 = p32;\n function s0_256(x) {\n return rotr32(x, 2) ^ rotr32(x, 13) ^ rotr32(x, 22);\n }\n exports.s0_256 = s0_256;\n function s1_256(x) {\n return rotr32(x, 6) ^ rotr32(x, 11) ^ rotr32(x, 25);\n }\n exports.s1_256 = s1_256;\n function g0_256(x) {\n return rotr32(x, 7) ^ rotr32(x, 18) ^ (x >>> 3);\n }\n exports.g0_256 = g0_256;\n function g1_256(x) {\n return rotr32(x, 17) ^ rotr32(x, 19) ^ (x >>> 10);\n }\n exports.g1_256 = g1_256;\n },\n});\n\n// node_modules/hash.js/lib/hash/sha/1.js\nvar require__ = __commonJS({\n \"node_modules/hash.js/lib/hash/sha/1.js\"(exports, module) {\n \"use strict\";\n var utils = require_utils4(),\n common = require_common(),\n shaCommon = require_common2(),\n rotl32 = utils.rotl32,\n sum32 = utils.sum32,\n sum32_5 = utils.sum32_5,\n ft_1 = shaCommon.ft_1,\n BlockHash = common.BlockHash,\n sha1_K = [1518500249, 1859775393, 2400959708, 3395469782];\n function SHA1() {\n if (!(this instanceof SHA1)) return new SHA1();\n BlockHash.call(this),\n (this.h = [1732584193, 4023233417, 2562383102, 271733878, 3285377520]),\n (this.W = new Array(80));\n }\n utils.inherits(SHA1, BlockHash);\n module.exports = SHA1;\n SHA1.blockSize = 512;\n SHA1.outSize = 160;\n SHA1.hmacStrength = 80;\n SHA1.padLength = 64;\n SHA1.prototype._update = function (msg, start) {\n for (var W = this.W, i = 0; i < 16; i++) W[i] = msg[start + i];\n for (; i < W.length; i++) W[i] = rotl32(W[i - 3] ^ W[i - 8] ^ W[i - 14] ^ W[i - 16], 1);\n var a = this.h[0],\n b = this.h[1],\n c = this.h[2],\n d = this.h[3],\n e = this.h[4];\n for (i = 0; i < W.length; i++) {\n var s = ~~(i / 20),\n t = sum32_5(rotl32(a, 5), ft_1(s, b, c, d), e, W[i], sha1_K[s]);\n (e = d), (d = c), (c = rotl32(b, 30)), (b = a), (a = t);\n }\n (this.h[0] = sum32(this.h[0], a)),\n (this.h[1] = sum32(this.h[1], b)),\n (this.h[2] = sum32(this.h[2], c)),\n (this.h[3] = sum32(this.h[3], d)),\n (this.h[4] = sum32(this.h[4], e));\n };\n SHA1.prototype._digest = function (enc) {\n return enc === \"hex\" ? utils.toHex32(this.h, \"big\") : utils.split32(this.h, \"big\");\n };\n },\n});\n\n// node_modules/hash.js/lib/hash/sha/256.js\nvar require__2 = __commonJS({\n \"node_modules/hash.js/lib/hash/sha/256.js\"(exports, module) {\n \"use strict\";\n var utils = require_utils4(),\n common = require_common(),\n shaCommon = require_common2(),\n assert = require_minimalistic_assert(),\n sum32 = utils.sum32,\n sum32_4 = utils.sum32_4,\n sum32_5 = utils.sum32_5,\n ch32 = shaCommon.ch32,\n maj32 = shaCommon.maj32,\n s0_256 = shaCommon.s0_256,\n s1_256 = shaCommon.s1_256,\n g0_256 = shaCommon.g0_256,\n g1_256 = shaCommon.g1_256,\n BlockHash = common.BlockHash,\n sha256_K = [\n 1116352408, 1899447441, 3049323471, 3921009573, 961987163, 1508970993, 2453635748, 2870763221, 3624381080,\n 310598401, 607225278, 1426881987, 1925078388, 2162078206, 2614888103, 3248222580, 3835390401, 4022224774,\n 264347078, 604807628, 770255983, 1249150122, 1555081692, 1996064986, 2554220882, 2821834349, 2952996808,\n 3210313671, 3336571891, 3584528711, 113926993, 338241895, 666307205, 773529912, 1294757372, 1396182291,\n 1695183700, 1986661051, 2177026350, 2456956037, 2730485921, 2820302411, 3259730800, 3345764771, 3516065817,\n 3600352804, 4094571909, 275423344, 430227734, 506948616, 659060556, 883997877, 958139571, 1322822218,\n 1537002063, 1747873779, 1955562222, 2024104815, 2227730452, 2361852424, 2428436474, 2756734187, 3204031479,\n 3329325298,\n ];\n function SHA256() {\n if (!(this instanceof SHA256)) return new SHA256();\n BlockHash.call(this),\n (this.h = [1779033703, 3144134277, 1013904242, 2773480762, 1359893119, 2600822924, 528734635, 1541459225]),\n (this.k = sha256_K),\n (this.W = new Array(64));\n }\n utils.inherits(SHA256, BlockHash);\n module.exports = SHA256;\n SHA256.blockSize = 512;\n SHA256.outSize = 256;\n SHA256.hmacStrength = 192;\n SHA256.padLength = 64;\n SHA256.prototype._update = function (msg, start) {\n for (var W = this.W, i = 0; i < 16; i++) W[i] = msg[start + i];\n for (; i < W.length; i++) W[i] = sum32_4(g1_256(W[i - 2]), W[i - 7], g0_256(W[i - 15]), W[i - 16]);\n var a = this.h[0],\n b = this.h[1],\n c = this.h[2],\n d = this.h[3],\n e = this.h[4],\n f = this.h[5],\n g = this.h[6],\n h = this.h[7];\n for (assert(this.k.length === W.length), i = 0; i < W.length; i++) {\n var T1 = sum32_5(h, s1_256(e), ch32(e, f, g), this.k[i], W[i]),\n T2 = sum32(s0_256(a), maj32(a, b, c));\n (h = g), (g = f), (f = e), (e = sum32(d, T1)), (d = c), (c = b), (b = a), (a = sum32(T1, T2));\n }\n (this.h[0] = sum32(this.h[0], a)),\n (this.h[1] = sum32(this.h[1], b)),\n (this.h[2] = sum32(this.h[2], c)),\n (this.h[3] = sum32(this.h[3], d)),\n (this.h[4] = sum32(this.h[4], e)),\n (this.h[5] = sum32(this.h[5], f)),\n (this.h[6] = sum32(this.h[6], g)),\n (this.h[7] = sum32(this.h[7], h));\n };\n SHA256.prototype._digest = function (enc) {\n return enc === \"hex\" ? utils.toHex32(this.h, \"big\") : utils.split32(this.h, \"big\");\n };\n },\n});\n\n// node_modules/hash.js/lib/hash/sha/224.js\nvar require__3 = __commonJS({\n \"node_modules/hash.js/lib/hash/sha/224.js\"(exports, module) {\n \"use strict\";\n var utils = require_utils4(),\n SHA256 = require__2();\n function SHA224() {\n if (!(this instanceof SHA224)) return new SHA224();\n SHA256.call(this),\n (this.h = [3238371032, 914150663, 812702999, 4144912697, 4290775857, 1750603025, 1694076839, 3204075428]);\n }\n utils.inherits(SHA224, SHA256);\n module.exports = SHA224;\n SHA224.blockSize = 512;\n SHA224.outSize = 224;\n SHA224.hmacStrength = 192;\n SHA224.padLength = 64;\n SHA224.prototype._digest = function (enc) {\n return enc === \"hex\" ? utils.toHex32(this.h.slice(0, 7), \"big\") : utils.split32(this.h.slice(0, 7), \"big\");\n };\n },\n});\n\n// node_modules/hash.js/lib/hash/sha/512.js\nvar require__4 = __commonJS({\n \"node_modules/hash.js/lib/hash/sha/512.js\"(exports, module) {\n \"use strict\";\n var utils = require_utils4(),\n common = require_common(),\n assert = require_minimalistic_assert(),\n rotr64_hi = utils.rotr64_hi,\n rotr64_lo = utils.rotr64_lo,\n shr64_hi = utils.shr64_hi,\n shr64_lo = utils.shr64_lo,\n sum64 = utils.sum64,\n sum64_hi = utils.sum64_hi,\n sum64_lo = utils.sum64_lo,\n sum64_4_hi = utils.sum64_4_hi,\n sum64_4_lo = utils.sum64_4_lo,\n sum64_5_hi = utils.sum64_5_hi,\n sum64_5_lo = utils.sum64_5_lo,\n BlockHash = common.BlockHash,\n sha512_K = [\n 1116352408, 3609767458, 1899447441, 602891725, 3049323471, 3964484399, 3921009573, 2173295548, 961987163,\n 4081628472, 1508970993, 3053834265, 2453635748, 2937671579, 2870763221, 3664609560, 3624381080, 2734883394,\n 310598401, 1164996542, 607225278, 1323610764, 1426881987, 3590304994, 1925078388, 4068182383, 2162078206,\n 991336113, 2614888103, 633803317, 3248222580, 3479774868, 3835390401, 2666613458, 4022224774, 944711139,\n 264347078, 2341262773, 604807628, 2007800933, 770255983, 1495990901, 1249150122, 1856431235, 1555081692,\n 3175218132, 1996064986, 2198950837, 2554220882, 3999719339, 2821834349, 766784016, 2952996808, 2566594879,\n 3210313671, 3203337956, 3336571891, 1034457026, 3584528711, 2466948901, 113926993, 3758326383, 338241895,\n 168717936, 666307205, 1188179964, 773529912, 1546045734, 1294757372, 1522805485, 1396182291, 2643833823,\n 1695183700, 2343527390, 1986661051, 1014477480, 2177026350, 1206759142, 2456956037, 344077627, 2730485921,\n 1290863460, 2820302411, 3158454273, 3259730800, 3505952657, 3345764771, 106217008, 3516065817, 3606008344,\n 3600352804, 1432725776, 4094571909, 1467031594, 275423344, 851169720, 430227734, 3100823752, 506948616,\n 1363258195, 659060556, 3750685593, 883997877, 3785050280, 958139571, 3318307427, 1322822218, 3812723403,\n 1537002063, 2003034995, 1747873779, 3602036899, 1955562222, 1575990012, 2024104815, 1125592928, 2227730452,\n 2716904306, 2361852424, 442776044, 2428436474, 593698344, 2756734187, 3733110249, 3204031479, 2999351573,\n 3329325298, 3815920427, 3391569614, 3928383900, 3515267271, 566280711, 3940187606, 3454069534, 4118630271,\n 4000239992, 116418474, 1914138554, 174292421, 2731055270, 289380356, 3203993006, 460393269, 320620315,\n 685471733, 587496836, 852142971, 1086792851, 1017036298, 365543100, 1126000580, 2618297676, 1288033470,\n 3409855158, 1501505948, 4234509866, 1607167915, 987167468, 1816402316, 1246189591,\n ];\n function SHA512() {\n if (!(this instanceof SHA512)) return new SHA512();\n BlockHash.call(this),\n (this.h = [\n 1779033703, 4089235720, 3144134277, 2227873595, 1013904242, 4271175723, 2773480762, 1595750129, 1359893119,\n 2917565137, 2600822924, 725511199, 528734635, 4215389547, 1541459225, 327033209,\n ]),\n (this.k = sha512_K),\n (this.W = new Array(160));\n }\n utils.inherits(SHA512, BlockHash);\n module.exports = SHA512;\n SHA512.blockSize = 1024;\n SHA512.outSize = 512;\n SHA512.hmacStrength = 192;\n SHA512.padLength = 128;\n SHA512.prototype._prepareBlock = function (msg, start) {\n for (var W = this.W, i = 0; i < 32; i++) W[i] = msg[start + i];\n for (; i < W.length; i += 2) {\n var c0_hi = g1_512_hi(W[i - 4], W[i - 3]),\n c0_lo = g1_512_lo(W[i - 4], W[i - 3]),\n c1_hi = W[i - 14],\n c1_lo = W[i - 13],\n c2_hi = g0_512_hi(W[i - 30], W[i - 29]),\n c2_lo = g0_512_lo(W[i - 30], W[i - 29]),\n c3_hi = W[i - 32],\n c3_lo = W[i - 31];\n (W[i] = sum64_4_hi(c0_hi, c0_lo, c1_hi, c1_lo, c2_hi, c2_lo, c3_hi, c3_lo)),\n (W[i + 1] = sum64_4_lo(c0_hi, c0_lo, c1_hi, c1_lo, c2_hi, c2_lo, c3_hi, c3_lo));\n }\n };\n SHA512.prototype._update = function (msg, start) {\n this._prepareBlock(msg, start);\n var W = this.W,\n ah = this.h[0],\n al = this.h[1],\n bh = this.h[2],\n bl = this.h[3],\n ch = this.h[4],\n cl = this.h[5],\n dh = this.h[6],\n dl = this.h[7],\n eh = this.h[8],\n el = this.h[9],\n fh = this.h[10],\n fl = this.h[11],\n gh = this.h[12],\n gl = this.h[13],\n hh = this.h[14],\n hl = this.h[15];\n assert(this.k.length === W.length);\n for (var i = 0; i < W.length; i += 2) {\n var c0_hi = hh,\n c0_lo = hl,\n c1_hi = s1_512_hi(eh, el),\n c1_lo = s1_512_lo(eh, el),\n c2_hi = ch64_hi(eh, el, fh, fl, gh, gl),\n c2_lo = ch64_lo(eh, el, fh, fl, gh, gl),\n c3_hi = this.k[i],\n c3_lo = this.k[i + 1],\n c4_hi = W[i],\n c4_lo = W[i + 1],\n T1_hi = sum64_5_hi(c0_hi, c0_lo, c1_hi, c1_lo, c2_hi, c2_lo, c3_hi, c3_lo, c4_hi, c4_lo),\n T1_lo = sum64_5_lo(c0_hi, c0_lo, c1_hi, c1_lo, c2_hi, c2_lo, c3_hi, c3_lo, c4_hi, c4_lo);\n (c0_hi = s0_512_hi(ah, al)),\n (c0_lo = s0_512_lo(ah, al)),\n (c1_hi = maj64_hi(ah, al, bh, bl, ch, cl)),\n (c1_lo = maj64_lo(ah, al, bh, bl, ch, cl));\n var T2_hi = sum64_hi(c0_hi, c0_lo, c1_hi, c1_lo),\n T2_lo = sum64_lo(c0_hi, c0_lo, c1_hi, c1_lo);\n (hh = gh),\n (hl = gl),\n (gh = fh),\n (gl = fl),\n (fh = eh),\n (fl = el),\n (eh = sum64_hi(dh, dl, T1_hi, T1_lo)),\n (el = sum64_lo(dl, dl, T1_hi, T1_lo)),\n (dh = ch),\n (dl = cl),\n (ch = bh),\n (cl = bl),\n (bh = ah),\n (bl = al),\n (ah = sum64_hi(T1_hi, T1_lo, T2_hi, T2_lo)),\n (al = sum64_lo(T1_hi, T1_lo, T2_hi, T2_lo));\n }\n sum64(this.h, 0, ah, al),\n sum64(this.h, 2, bh, bl),\n sum64(this.h, 4, ch, cl),\n sum64(this.h, 6, dh, dl),\n sum64(this.h, 8, eh, el),\n sum64(this.h, 10, fh, fl),\n sum64(this.h, 12, gh, gl),\n sum64(this.h, 14, hh, hl);\n };\n SHA512.prototype._digest = function (enc) {\n return enc === \"hex\" ? utils.toHex32(this.h, \"big\") : utils.split32(this.h, \"big\");\n };\n function ch64_hi(xh, xl, yh, yl, zh) {\n var r = (xh & yh) ^ (~xh & zh);\n return r < 0 && (r += 4294967296), r;\n }\n function ch64_lo(xh, xl, yh, yl, zh, zl) {\n var r = (xl & yl) ^ (~xl & zl);\n return r < 0 && (r += 4294967296), r;\n }\n function maj64_hi(xh, xl, yh, yl, zh) {\n var r = (xh & yh) ^ (xh & zh) ^ (yh & zh);\n return r < 0 && (r += 4294967296), r;\n }\n function maj64_lo(xh, xl, yh, yl, zh, zl) {\n var r = (xl & yl) ^ (xl & zl) ^ (yl & zl);\n return r < 0 && (r += 4294967296), r;\n }\n function s0_512_hi(xh, xl) {\n var c0_hi = rotr64_hi(xh, xl, 28),\n c1_hi = rotr64_hi(xl, xh, 2),\n c2_hi = rotr64_hi(xl, xh, 7),\n r = c0_hi ^ c1_hi ^ c2_hi;\n return r < 0 && (r += 4294967296), r;\n }\n function s0_512_lo(xh, xl) {\n var c0_lo = rotr64_lo(xh, xl, 28),\n c1_lo = rotr64_lo(xl, xh, 2),\n c2_lo = rotr64_lo(xl, xh, 7),\n r = c0_lo ^ c1_lo ^ c2_lo;\n return r < 0 && (r += 4294967296), r;\n }\n function s1_512_hi(xh, xl) {\n var c0_hi = rotr64_hi(xh, xl, 14),\n c1_hi = rotr64_hi(xh, xl, 18),\n c2_hi = rotr64_hi(xl, xh, 9),\n r = c0_hi ^ c1_hi ^ c2_hi;\n return r < 0 && (r += 4294967296), r;\n }\n function s1_512_lo(xh, xl) {\n var c0_lo = rotr64_lo(xh, xl, 14),\n c1_lo = rotr64_lo(xh, xl, 18),\n c2_lo = rotr64_lo(xl, xh, 9),\n r = c0_lo ^ c1_lo ^ c2_lo;\n return r < 0 && (r += 4294967296), r;\n }\n function g0_512_hi(xh, xl) {\n var c0_hi = rotr64_hi(xh, xl, 1),\n c1_hi = rotr64_hi(xh, xl, 8),\n c2_hi = shr64_hi(xh, xl, 7),\n r = c0_hi ^ c1_hi ^ c2_hi;\n return r < 0 && (r += 4294967296), r;\n }\n function g0_512_lo(xh, xl) {\n var c0_lo = rotr64_lo(xh, xl, 1),\n c1_lo = rotr64_lo(xh, xl, 8),\n c2_lo = shr64_lo(xh, xl, 7),\n r = c0_lo ^ c1_lo ^ c2_lo;\n return r < 0 && (r += 4294967296), r;\n }\n function g1_512_hi(xh, xl) {\n var c0_hi = rotr64_hi(xh, xl, 19),\n c1_hi = rotr64_hi(xl, xh, 29),\n c2_hi = shr64_hi(xh, xl, 6),\n r = c0_hi ^ c1_hi ^ c2_hi;\n return r < 0 && (r += 4294967296), r;\n }\n function g1_512_lo(xh, xl) {\n var c0_lo = rotr64_lo(xh, xl, 19),\n c1_lo = rotr64_lo(xl, xh, 29),\n c2_lo = shr64_lo(xh, xl, 6),\n r = c0_lo ^ c1_lo ^ c2_lo;\n return r < 0 && (r += 4294967296), r;\n }\n },\n});\n\n// node_modules/hash.js/lib/hash/sha/384.js\nvar require__5 = __commonJS({\n \"node_modules/hash.js/lib/hash/sha/384.js\"(exports, module) {\n \"use strict\";\n var utils = require_utils4(),\n SHA512 = require__4();\n function SHA384() {\n if (!(this instanceof SHA384)) return new SHA384();\n SHA512.call(this),\n (this.h = [\n 3418070365, 3238371032, 1654270250, 914150663, 2438529370, 812702999, 355462360, 4144912697, 1731405415,\n 4290775857, 2394180231, 1750603025, 3675008525, 1694076839, 1203062813, 3204075428,\n ]);\n }\n utils.inherits(SHA384, SHA512);\n module.exports = SHA384;\n SHA384.blockSize = 1024;\n SHA384.outSize = 384;\n SHA384.hmacStrength = 192;\n SHA384.padLength = 128;\n SHA384.prototype._digest = function (enc) {\n return enc === \"hex\" ? utils.toHex32(this.h.slice(0, 12), \"big\") : utils.split32(this.h.slice(0, 12), \"big\");\n };\n },\n});\n\n// node_modules/hash.js/lib/hash/sha.js\nvar require_sha3 = __commonJS({\n \"node_modules/hash.js/lib/hash/sha.js\"(exports) {\n \"use strict\";\n exports.sha1 = require__();\n exports.sha224 = require__3();\n exports.sha256 = require__2();\n exports.sha384 = require__5();\n exports.sha512 = require__4();\n },\n});\n\n// node_modules/hash.js/lib/hash/ripemd.js\nvar require_ripemd = __commonJS({\n \"node_modules/hash.js/lib/hash/ripemd.js\"(exports) {\n \"use strict\";\n var utils = require_utils4(),\n common = require_common(),\n rotl32 = utils.rotl32,\n sum32 = utils.sum32,\n sum32_3 = utils.sum32_3,\n sum32_4 = utils.sum32_4,\n BlockHash = common.BlockHash;\n function RIPEMD160() {\n if (!(this instanceof RIPEMD160)) return new RIPEMD160();\n BlockHash.call(this),\n (this.h = [1732584193, 4023233417, 2562383102, 271733878, 3285377520]),\n (this.endian = \"little\");\n }\n utils.inherits(RIPEMD160, BlockHash);\n exports.ripemd160 = RIPEMD160;\n RIPEMD160.blockSize = 512;\n RIPEMD160.outSize = 160;\n RIPEMD160.hmacStrength = 192;\n RIPEMD160.padLength = 64;\n RIPEMD160.prototype._update = function (msg, start) {\n for (\n var A = this.h[0],\n B = this.h[1],\n C = this.h[2],\n D = this.h[3],\n E = this.h[4],\n Ah = A,\n Bh = B,\n Ch = C,\n Dh = D,\n Eh = E,\n j = 0;\n j < 80;\n j++\n ) {\n var T = sum32(rotl32(sum32_4(A, f(j, B, C, D), msg[r[j] + start], K(j)), s[j]), E);\n (A = E),\n (E = D),\n (D = rotl32(C, 10)),\n (C = B),\n (B = T),\n (T = sum32(rotl32(sum32_4(Ah, f(79 - j, Bh, Ch, Dh), msg[rh[j] + start], Kh(j)), sh[j]), Eh)),\n (Ah = Eh),\n (Eh = Dh),\n (Dh = rotl32(Ch, 10)),\n (Ch = Bh),\n (Bh = T);\n }\n (T = sum32_3(this.h[1], C, Dh)),\n (this.h[1] = sum32_3(this.h[2], D, Eh)),\n (this.h[2] = sum32_3(this.h[3], E, Ah)),\n (this.h[3] = sum32_3(this.h[4], A, Bh)),\n (this.h[4] = sum32_3(this.h[0], B, Ch)),\n (this.h[0] = T);\n };\n RIPEMD160.prototype._digest = function (enc) {\n return enc === \"hex\" ? utils.toHex32(this.h, \"little\") : utils.split32(this.h, \"little\");\n };\n function f(j, x, y, z) {\n return j <= 15\n ? x ^ y ^ z\n : j <= 31\n ? (x & y) | (~x & z)\n : j <= 47\n ? (x | ~y) ^ z\n : j <= 63\n ? (x & z) | (y & ~z)\n : x ^ (y | ~z);\n }\n function K(j) {\n return j <= 15 ? 0 : j <= 31 ? 1518500249 : j <= 47 ? 1859775393 : j <= 63 ? 2400959708 : 2840853838;\n }\n function Kh(j) {\n return j <= 15 ? 1352829926 : j <= 31 ? 1548603684 : j <= 47 ? 1836072691 : j <= 63 ? 2053994217 : 0;\n }\n var r = [\n 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 7, 4, 13, 1, 10, 6, 15, 3, 12, 0, 9, 5, 2, 14, 11, 8, 3,\n 10, 14, 4, 9, 15, 8, 1, 2, 7, 0, 6, 13, 11, 5, 12, 1, 9, 11, 10, 0, 8, 12, 4, 13, 3, 7, 15, 14, 5, 6, 2, 4, 0,\n 5, 9, 7, 12, 2, 10, 14, 1, 3, 8, 11, 6, 15, 13,\n ],\n rh = [\n 5, 14, 7, 0, 9, 2, 11, 4, 13, 6, 15, 8, 1, 10, 3, 12, 6, 11, 3, 7, 0, 13, 5, 10, 14, 15, 8, 12, 4, 9, 1, 2, 15,\n 5, 1, 3, 7, 14, 6, 9, 11, 8, 12, 2, 10, 0, 4, 13, 8, 6, 4, 1, 3, 11, 15, 0, 5, 12, 2, 13, 9, 7, 10, 14, 12, 15,\n 10, 4, 1, 5, 8, 7, 6, 2, 13, 14, 0, 3, 9, 11,\n ],\n s = [\n 11, 14, 15, 12, 5, 8, 7, 9, 11, 13, 14, 15, 6, 7, 9, 8, 7, 6, 8, 13, 11, 9, 7, 15, 7, 12, 15, 9, 11, 7, 13, 12,\n 11, 13, 6, 7, 14, 9, 13, 15, 14, 8, 13, 6, 5, 12, 7, 5, 11, 12, 14, 15, 14, 15, 9, 8, 9, 14, 5, 6, 8, 6, 5, 12,\n 9, 15, 5, 11, 6, 8, 13, 12, 5, 12, 13, 14, 11, 8, 5, 6,\n ],\n sh = [\n 8, 9, 9, 11, 13, 15, 15, 5, 7, 7, 8, 11, 14, 14, 12, 6, 9, 13, 15, 7, 12, 8, 9, 11, 7, 7, 12, 7, 6, 15, 13, 11,\n 9, 7, 15, 11, 8, 6, 6, 14, 12, 13, 5, 14, 13, 13, 7, 5, 15, 5, 8, 11, 14, 14, 6, 14, 6, 9, 12, 9, 12, 5, 15, 8,\n 8, 5, 12, 9, 12, 5, 14, 6, 8, 13, 6, 5, 15, 13, 11, 11,\n ];\n },\n});\n\n// node_modules/hash.js/lib/hash/hmac.js\nvar require_hmac = __commonJS({\n \"node_modules/hash.js/lib/hash/hmac.js\"(exports, module) {\n \"use strict\";\n var utils = require_utils4(),\n assert = require_minimalistic_assert();\n function Hmac(hash, key, enc) {\n if (!(this instanceof Hmac)) return new Hmac(hash, key, enc);\n (this.Hash = hash),\n (this.blockSize = hash.blockSize / 8),\n (this.outSize = hash.outSize / 8),\n (this.inner = null),\n (this.outer = null),\n this._init(utils.toArray(key, enc));\n }\n module.exports = Hmac;\n Hmac.prototype._init = function (key) {\n key.length > this.blockSize && (key = new this.Hash().update(key).digest()), assert(key.length <= this.blockSize);\n for (var i = key.length; i < this.blockSize; i++) key.push(0);\n for (i = 0; i < key.length; i++) key[i] ^= 54;\n for (this.inner = new this.Hash().update(key), i = 0; i < key.length; i++) key[i] ^= 106;\n this.outer = new this.Hash().update(key);\n };\n Hmac.prototype.update = function (msg, enc) {\n return this.inner.update(msg, enc), this;\n };\n Hmac.prototype.digest = function (enc) {\n return this.outer.update(this.inner.digest()), this.outer.digest(enc);\n };\n },\n});\n\n// node_modules/hash.js/lib/hash.js\nvar require_hash2 = __commonJS({\n \"node_modules/hash.js/lib/hash.js\"(exports) {\n var hash = exports;\n hash.utils = require_utils4();\n hash.common = require_common();\n hash.sha = require_sha3();\n hash.ripemd = require_ripemd();\n hash.hmac = require_hmac();\n hash.sha1 = hash.sha.sha1;\n hash.sha256 = hash.sha.sha256;\n hash.sha224 = hash.sha.sha224;\n hash.sha384 = hash.sha.sha384;\n hash.sha512 = hash.sha.sha512;\n hash.ripemd160 = hash.ripemd.ripemd160;\n },\n});\n\n// node_modules/elliptic/lib/elliptic/precomputed/secp256k1.js\nvar require_secp256k1 = __commonJS({\n \"node_modules/elliptic/lib/elliptic/precomputed/secp256k1.js\"(exports, module) {\n module.exports = {\n doubles: {\n step: 4,\n points: [\n [\n \"e60fce93b59e9ec53011aabc21c23e97b2a31369b87a5ae9c44ee89e2a6dec0a\",\n \"f7e3507399e595929db99f34f57937101296891e44d23f0be1f32cce69616821\",\n ],\n [\n \"8282263212c609d9ea2a6e3e172de238d8c39cabd5ac1ca10646e23fd5f51508\",\n \"11f8a8098557dfe45e8256e830b60ace62d613ac2f7b17bed31b6eaff6e26caf\",\n ],\n [\n \"175e159f728b865a72f99cc6c6fc846de0b93833fd2222ed73fce5b551e5b739\",\n \"d3506e0d9e3c79eba4ef97a51ff71f5eacb5955add24345c6efa6ffee9fed695\",\n ],\n [\n \"363d90d447b00c9c99ceac05b6262ee053441c7e55552ffe526bad8f83ff4640\",\n \"4e273adfc732221953b445397f3363145b9a89008199ecb62003c7f3bee9de9\",\n ],\n [\n \"8b4b5f165df3c2be8c6244b5b745638843e4a781a15bcd1b69f79a55dffdf80c\",\n \"4aad0a6f68d308b4b3fbd7813ab0da04f9e336546162ee56b3eff0c65fd4fd36\",\n ],\n [\n \"723cbaa6e5db996d6bf771c00bd548c7b700dbffa6c0e77bcb6115925232fcda\",\n \"96e867b5595cc498a921137488824d6e2660a0653779494801dc069d9eb39f5f\",\n ],\n [\n \"eebfa4d493bebf98ba5feec812c2d3b50947961237a919839a533eca0e7dd7fa\",\n \"5d9a8ca3970ef0f269ee7edaf178089d9ae4cdc3a711f712ddfd4fdae1de8999\",\n ],\n [\n \"100f44da696e71672791d0a09b7bde459f1215a29b3c03bfefd7835b39a48db0\",\n \"cdd9e13192a00b772ec8f3300c090666b7ff4a18ff5195ac0fbd5cd62bc65a09\",\n ],\n [\n \"e1031be262c7ed1b1dc9227a4a04c017a77f8d4464f3b3852c8acde6e534fd2d\",\n \"9d7061928940405e6bb6a4176597535af292dd419e1ced79a44f18f29456a00d\",\n ],\n [\n \"feea6cae46d55b530ac2839f143bd7ec5cf8b266a41d6af52d5e688d9094696d\",\n \"e57c6b6c97dce1bab06e4e12bf3ecd5c981c8957cc41442d3155debf18090088\",\n ],\n [\n \"da67a91d91049cdcb367be4be6ffca3cfeed657d808583de33fa978bc1ec6cb1\",\n \"9bacaa35481642bc41f463f7ec9780e5dec7adc508f740a17e9ea8e27a68be1d\",\n ],\n [\n \"53904faa0b334cdda6e000935ef22151ec08d0f7bb11069f57545ccc1a37b7c0\",\n \"5bc087d0bc80106d88c9eccac20d3c1c13999981e14434699dcb096b022771c8\",\n ],\n [\n \"8e7bcd0bd35983a7719cca7764ca906779b53a043a9b8bcaeff959f43ad86047\",\n \"10b7770b2a3da4b3940310420ca9514579e88e2e47fd68b3ea10047e8460372a\",\n ],\n [\n \"385eed34c1cdff21e6d0818689b81bde71a7f4f18397e6690a841e1599c43862\",\n \"283bebc3e8ea23f56701de19e9ebf4576b304eec2086dc8cc0458fe5542e5453\",\n ],\n [\n \"6f9d9b803ecf191637c73a4413dfa180fddf84a5947fbc9c606ed86c3fac3a7\",\n \"7c80c68e603059ba69b8e2a30e45c4d47ea4dd2f5c281002d86890603a842160\",\n ],\n [\n \"3322d401243c4e2582a2147c104d6ecbf774d163db0f5e5313b7e0e742d0e6bd\",\n \"56e70797e9664ef5bfb019bc4ddaf9b72805f63ea2873af624f3a2e96c28b2a0\",\n ],\n [\n \"85672c7d2de0b7da2bd1770d89665868741b3f9af7643397721d74d28134ab83\",\n \"7c481b9b5b43b2eb6374049bfa62c2e5e77f17fcc5298f44c8e3094f790313a6\",\n ],\n [\n \"948bf809b1988a46b06c9f1919413b10f9226c60f668832ffd959af60c82a0a\",\n \"53a562856dcb6646dc6b74c5d1c3418c6d4dff08c97cd2bed4cb7f88d8c8e589\",\n ],\n [\n \"6260ce7f461801c34f067ce0f02873a8f1b0e44dfc69752accecd819f38fd8e8\",\n \"bc2da82b6fa5b571a7f09049776a1ef7ecd292238051c198c1a84e95b2b4ae17\",\n ],\n [\n \"e5037de0afc1d8d43d8348414bbf4103043ec8f575bfdc432953cc8d2037fa2d\",\n \"4571534baa94d3b5f9f98d09fb990bddbd5f5b03ec481f10e0e5dc841d755bda\",\n ],\n [\n \"e06372b0f4a207adf5ea905e8f1771b4e7e8dbd1c6a6c5b725866a0ae4fce725\",\n \"7a908974bce18cfe12a27bb2ad5a488cd7484a7787104870b27034f94eee31dd\",\n ],\n [\n \"213c7a715cd5d45358d0bbf9dc0ce02204b10bdde2a3f58540ad6908d0559754\",\n \"4b6dad0b5ae462507013ad06245ba190bb4850f5f36a7eeddff2c27534b458f2\",\n ],\n [\n \"4e7c272a7af4b34e8dbb9352a5419a87e2838c70adc62cddf0cc3a3b08fbd53c\",\n \"17749c766c9d0b18e16fd09f6def681b530b9614bff7dd33e0b3941817dcaae6\",\n ],\n [\n \"fea74e3dbe778b1b10f238ad61686aa5c76e3db2be43057632427e2840fb27b6\",\n \"6e0568db9b0b13297cf674deccb6af93126b596b973f7b77701d3db7f23cb96f\",\n ],\n [\n \"76e64113f677cf0e10a2570d599968d31544e179b760432952c02a4417bdde39\",\n \"c90ddf8dee4e95cf577066d70681f0d35e2a33d2b56d2032b4b1752d1901ac01\",\n ],\n [\n \"c738c56b03b2abe1e8281baa743f8f9a8f7cc643df26cbee3ab150242bcbb891\",\n \"893fb578951ad2537f718f2eacbfbbbb82314eef7880cfe917e735d9699a84c3\",\n ],\n [\n \"d895626548b65b81e264c7637c972877d1d72e5f3a925014372e9f6588f6c14b\",\n \"febfaa38f2bc7eae728ec60818c340eb03428d632bb067e179363ed75d7d991f\",\n ],\n [\n \"b8da94032a957518eb0f6433571e8761ceffc73693e84edd49150a564f676e03\",\n \"2804dfa44805a1e4d7c99cc9762808b092cc584d95ff3b511488e4e74efdf6e7\",\n ],\n [\n \"e80fea14441fb33a7d8adab9475d7fab2019effb5156a792f1a11778e3c0df5d\",\n \"eed1de7f638e00771e89768ca3ca94472d155e80af322ea9fcb4291b6ac9ec78\",\n ],\n [\n \"a301697bdfcd704313ba48e51d567543f2a182031efd6915ddc07bbcc4e16070\",\n \"7370f91cfb67e4f5081809fa25d40f9b1735dbf7c0a11a130c0d1a041e177ea1\",\n ],\n [\n \"90ad85b389d6b936463f9d0512678de208cc330b11307fffab7ac63e3fb04ed4\",\n \"e507a3620a38261affdcbd9427222b839aefabe1582894d991d4d48cb6ef150\",\n ],\n [\n \"8f68b9d2f63b5f339239c1ad981f162ee88c5678723ea3351b7b444c9ec4c0da\",\n \"662a9f2dba063986de1d90c2b6be215dbbea2cfe95510bfdf23cbf79501fff82\",\n ],\n [\n \"e4f3fb0176af85d65ff99ff9198c36091f48e86503681e3e6686fd5053231e11\",\n \"1e63633ad0ef4f1c1661a6d0ea02b7286cc7e74ec951d1c9822c38576feb73bc\",\n ],\n [\n \"8c00fa9b18ebf331eb961537a45a4266c7034f2f0d4e1d0716fb6eae20eae29e\",\n \"efa47267fea521a1a9dc343a3736c974c2fadafa81e36c54e7d2a4c66702414b\",\n ],\n [\n \"e7a26ce69dd4829f3e10cec0a9e98ed3143d084f308b92c0997fddfc60cb3e41\",\n \"2a758e300fa7984b471b006a1aafbb18d0a6b2c0420e83e20e8a9421cf2cfd51\",\n ],\n [\n \"b6459e0ee3662ec8d23540c223bcbdc571cbcb967d79424f3cf29eb3de6b80ef\",\n \"67c876d06f3e06de1dadf16e5661db3c4b3ae6d48e35b2ff30bf0b61a71ba45\",\n ],\n [\n \"d68a80c8280bb840793234aa118f06231d6f1fc67e73c5a5deda0f5b496943e8\",\n \"db8ba9fff4b586d00c4b1f9177b0e28b5b0e7b8f7845295a294c84266b133120\",\n ],\n [\n \"324aed7df65c804252dc0270907a30b09612aeb973449cea4095980fc28d3d5d\",\n \"648a365774b61f2ff130c0c35aec1f4f19213b0c7e332843967224af96ab7c84\",\n ],\n [\n \"4df9c14919cde61f6d51dfdbe5fee5dceec4143ba8d1ca888e8bd373fd054c96\",\n \"35ec51092d8728050974c23a1d85d4b5d506cdc288490192ebac06cad10d5d\",\n ],\n [\n \"9c3919a84a474870faed8a9c1cc66021523489054d7f0308cbfc99c8ac1f98cd\",\n \"ddb84f0f4a4ddd57584f044bf260e641905326f76c64c8e6be7e5e03d4fc599d\",\n ],\n [\n \"6057170b1dd12fdf8de05f281d8e06bb91e1493a8b91d4cc5a21382120a959e5\",\n \"9a1af0b26a6a4807add9a2daf71df262465152bc3ee24c65e899be932385a2a8\",\n ],\n [\n \"a576df8e23a08411421439a4518da31880cef0fba7d4df12b1a6973eecb94266\",\n \"40a6bf20e76640b2c92b97afe58cd82c432e10a7f514d9f3ee8be11ae1b28ec8\",\n ],\n [\n \"7778a78c28dec3e30a05fe9629de8c38bb30d1f5cf9a3a208f763889be58ad71\",\n \"34626d9ab5a5b22ff7098e12f2ff580087b38411ff24ac563b513fc1fd9f43ac\",\n ],\n [\n \"928955ee637a84463729fd30e7afd2ed5f96274e5ad7e5cb09eda9c06d903ac\",\n \"c25621003d3f42a827b78a13093a95eeac3d26efa8a8d83fc5180e935bcd091f\",\n ],\n [\n \"85d0fef3ec6db109399064f3a0e3b2855645b4a907ad354527aae75163d82751\",\n \"1f03648413a38c0be29d496e582cf5663e8751e96877331582c237a24eb1f962\",\n ],\n [\n \"ff2b0dce97eece97c1c9b6041798b85dfdfb6d8882da20308f5404824526087e\",\n \"493d13fef524ba188af4c4dc54d07936c7b7ed6fb90e2ceb2c951e01f0c29907\",\n ],\n [\n \"827fbbe4b1e880ea9ed2b2e6301b212b57f1ee148cd6dd28780e5e2cf856e241\",\n \"c60f9c923c727b0b71bef2c67d1d12687ff7a63186903166d605b68baec293ec\",\n ],\n [\n \"eaa649f21f51bdbae7be4ae34ce6e5217a58fdce7f47f9aa7f3b58fa2120e2b3\",\n \"be3279ed5bbbb03ac69a80f89879aa5a01a6b965f13f7e59d47a5305ba5ad93d\",\n ],\n [\n \"e4a42d43c5cf169d9391df6decf42ee541b6d8f0c9a137401e23632dda34d24f\",\n \"4d9f92e716d1c73526fc99ccfb8ad34ce886eedfa8d8e4f13a7f7131deba9414\",\n ],\n [\n \"1ec80fef360cbdd954160fadab352b6b92b53576a88fea4947173b9d4300bf19\",\n \"aeefe93756b5340d2f3a4958a7abbf5e0146e77f6295a07b671cdc1cc107cefd\",\n ],\n [\n \"146a778c04670c2f91b00af4680dfa8bce3490717d58ba889ddb5928366642be\",\n \"b318e0ec3354028add669827f9d4b2870aaa971d2f7e5ed1d0b297483d83efd0\",\n ],\n [\n \"fa50c0f61d22e5f07e3acebb1aa07b128d0012209a28b9776d76a8793180eef9\",\n \"6b84c6922397eba9b72cd2872281a68a5e683293a57a213b38cd8d7d3f4f2811\",\n ],\n [\n \"da1d61d0ca721a11b1a5bf6b7d88e8421a288ab5d5bba5220e53d32b5f067ec2\",\n \"8157f55a7c99306c79c0766161c91e2966a73899d279b48a655fba0f1ad836f1\",\n ],\n [\n \"a8e282ff0c9706907215ff98e8fd416615311de0446f1e062a73b0610d064e13\",\n \"7f97355b8db81c09abfb7f3c5b2515888b679a3e50dd6bd6cef7c73111f4cc0c\",\n ],\n [\n \"174a53b9c9a285872d39e56e6913cab15d59b1fa512508c022f382de8319497c\",\n \"ccc9dc37abfc9c1657b4155f2c47f9e6646b3a1d8cb9854383da13ac079afa73\",\n ],\n [\n \"959396981943785c3d3e57edf5018cdbe039e730e4918b3d884fdff09475b7ba\",\n \"2e7e552888c331dd8ba0386a4b9cd6849c653f64c8709385e9b8abf87524f2fd\",\n ],\n [\n \"d2a63a50ae401e56d645a1153b109a8fcca0a43d561fba2dbb51340c9d82b151\",\n \"e82d86fb6443fcb7565aee58b2948220a70f750af484ca52d4142174dcf89405\",\n ],\n [\n \"64587e2335471eb890ee7896d7cfdc866bacbdbd3839317b3436f9b45617e073\",\n \"d99fcdd5bf6902e2ae96dd6447c299a185b90a39133aeab358299e5e9faf6589\",\n ],\n [\n \"8481bde0e4e4d885b3a546d3e549de042f0aa6cea250e7fd358d6c86dd45e458\",\n \"38ee7b8cba5404dd84a25bf39cecb2ca900a79c42b262e556d64b1b59779057e\",\n ],\n [\n \"13464a57a78102aa62b6979ae817f4637ffcfed3c4b1ce30bcd6303f6caf666b\",\n \"69be159004614580ef7e433453ccb0ca48f300a81d0942e13f495a907f6ecc27\",\n ],\n [\n \"bc4a9df5b713fe2e9aef430bcc1dc97a0cd9ccede2f28588cada3a0d2d83f366\",\n \"d3a81ca6e785c06383937adf4b798caa6e8a9fbfa547b16d758d666581f33c1\",\n ],\n [\n \"8c28a97bf8298bc0d23d8c749452a32e694b65e30a9472a3954ab30fe5324caa\",\n \"40a30463a3305193378fedf31f7cc0eb7ae784f0451cb9459e71dc73cbef9482\",\n ],\n [\n \"8ea9666139527a8c1dd94ce4f071fd23c8b350c5a4bb33748c4ba111faccae0\",\n \"620efabbc8ee2782e24e7c0cfb95c5d735b783be9cf0f8e955af34a30e62b945\",\n ],\n [\n \"dd3625faef5ba06074669716bbd3788d89bdde815959968092f76cc4eb9a9787\",\n \"7a188fa3520e30d461da2501045731ca941461982883395937f68d00c644a573\",\n ],\n [\n \"f710d79d9eb962297e4f6232b40e8f7feb2bc63814614d692c12de752408221e\",\n \"ea98e67232d3b3295d3b535532115ccac8612c721851617526ae47a9c77bfc82\",\n ],\n ],\n },\n naf: {\n wnd: 7,\n points: [\n [\n \"f9308a019258c31049344f85f89d5229b531c845836f99b08601f113bce036f9\",\n \"388f7b0f632de8140fe337e62a37f3566500a99934c2231b6cb9fd7584b8e672\",\n ],\n [\n \"2f8bde4d1a07209355b4a7250a5c5128e88b84bddc619ab7cba8d569b240efe4\",\n \"d8ac222636e5e3d6d4dba9dda6c9c426f788271bab0d6840dca87d3aa6ac62d6\",\n ],\n [\n \"5cbdf0646e5db4eaa398f365f2ea7a0e3d419b7e0330e39ce92bddedcac4f9bc\",\n \"6aebca40ba255960a3178d6d861a54dba813d0b813fde7b5a5082628087264da\",\n ],\n [\n \"acd484e2f0c7f65309ad178a9f559abde09796974c57e714c35f110dfc27ccbe\",\n \"cc338921b0a7d9fd64380971763b61e9add888a4375f8e0f05cc262ac64f9c37\",\n ],\n [\n \"774ae7f858a9411e5ef4246b70c65aac5649980be5c17891bbec17895da008cb\",\n \"d984a032eb6b5e190243dd56d7b7b365372db1e2dff9d6a8301d74c9c953c61b\",\n ],\n [\n \"f28773c2d975288bc7d1d205c3748651b075fbc6610e58cddeeddf8f19405aa8\",\n \"ab0902e8d880a89758212eb65cdaf473a1a06da521fa91f29b5cb52db03ed81\",\n ],\n [\n \"d7924d4f7d43ea965a465ae3095ff41131e5946f3c85f79e44adbcf8e27e080e\",\n \"581e2872a86c72a683842ec228cc6defea40af2bd896d3a5c504dc9ff6a26b58\",\n ],\n [\n \"defdea4cdb677750a420fee807eacf21eb9898ae79b9768766e4faa04a2d4a34\",\n \"4211ab0694635168e997b0ead2a93daeced1f4a04a95c0f6cfb199f69e56eb77\",\n ],\n [\n \"2b4ea0a797a443d293ef5cff444f4979f06acfebd7e86d277475656138385b6c\",\n \"85e89bc037945d93b343083b5a1c86131a01f60c50269763b570c854e5c09b7a\",\n ],\n [\n \"352bbf4a4cdd12564f93fa332ce333301d9ad40271f8107181340aef25be59d5\",\n \"321eb4075348f534d59c18259dda3e1f4a1b3b2e71b1039c67bd3d8bcf81998c\",\n ],\n [\n \"2fa2104d6b38d11b0230010559879124e42ab8dfeff5ff29dc9cdadd4ecacc3f\",\n \"2de1068295dd865b64569335bd5dd80181d70ecfc882648423ba76b532b7d67\",\n ],\n [\n \"9248279b09b4d68dab21a9b066edda83263c3d84e09572e269ca0cd7f5453714\",\n \"73016f7bf234aade5d1aa71bdea2b1ff3fc0de2a887912ffe54a32ce97cb3402\",\n ],\n [\n \"daed4f2be3a8bf278e70132fb0beb7522f570e144bf615c07e996d443dee8729\",\n \"a69dce4a7d6c98e8d4a1aca87ef8d7003f83c230f3afa726ab40e52290be1c55\",\n ],\n [\n \"c44d12c7065d812e8acf28d7cbb19f9011ecd9e9fdf281b0e6a3b5e87d22e7db\",\n \"2119a460ce326cdc76c45926c982fdac0e106e861edf61c5a039063f0e0e6482\",\n ],\n [\n \"6a245bf6dc698504c89a20cfded60853152b695336c28063b61c65cbd269e6b4\",\n \"e022cf42c2bd4a708b3f5126f16a24ad8b33ba48d0423b6efd5e6348100d8a82\",\n ],\n [\n \"1697ffa6fd9de627c077e3d2fe541084ce13300b0bec1146f95ae57f0d0bd6a5\",\n \"b9c398f186806f5d27561506e4557433a2cf15009e498ae7adee9d63d01b2396\",\n ],\n [\n \"605bdb019981718b986d0f07e834cb0d9deb8360ffb7f61df982345ef27a7479\",\n \"2972d2de4f8d20681a78d93ec96fe23c26bfae84fb14db43b01e1e9056b8c49\",\n ],\n [\n \"62d14dab4150bf497402fdc45a215e10dcb01c354959b10cfe31c7e9d87ff33d\",\n \"80fc06bd8cc5b01098088a1950eed0db01aa132967ab472235f5642483b25eaf\",\n ],\n [\n \"80c60ad0040f27dade5b4b06c408e56b2c50e9f56b9b8b425e555c2f86308b6f\",\n \"1c38303f1cc5c30f26e66bad7fe72f70a65eed4cbe7024eb1aa01f56430bd57a\",\n ],\n [\n \"7a9375ad6167ad54aa74c6348cc54d344cc5dc9487d847049d5eabb0fa03c8fb\",\n \"d0e3fa9eca8726909559e0d79269046bdc59ea10c70ce2b02d499ec224dc7f7\",\n ],\n [\n \"d528ecd9b696b54c907a9ed045447a79bb408ec39b68df504bb51f459bc3ffc9\",\n \"eecf41253136e5f99966f21881fd656ebc4345405c520dbc063465b521409933\",\n ],\n [\n \"49370a4b5f43412ea25f514e8ecdad05266115e4a7ecb1387231808f8b45963\",\n \"758f3f41afd6ed428b3081b0512fd62a54c3f3afbb5b6764b653052a12949c9a\",\n ],\n [\n \"77f230936ee88cbbd73df930d64702ef881d811e0e1498e2f1c13eb1fc345d74\",\n \"958ef42a7886b6400a08266e9ba1b37896c95330d97077cbbe8eb3c7671c60d6\",\n ],\n [\n \"f2dac991cc4ce4b9ea44887e5c7c0bce58c80074ab9d4dbaeb28531b7739f530\",\n \"e0dedc9b3b2f8dad4da1f32dec2531df9eb5fbeb0598e4fd1a117dba703a3c37\",\n ],\n [\n \"463b3d9f662621fb1b4be8fbbe2520125a216cdfc9dae3debcba4850c690d45b\",\n \"5ed430d78c296c3543114306dd8622d7c622e27c970a1de31cb377b01af7307e\",\n ],\n [\n \"f16f804244e46e2a09232d4aff3b59976b98fac14328a2d1a32496b49998f247\",\n \"cedabd9b82203f7e13d206fcdf4e33d92a6c53c26e5cce26d6579962c4e31df6\",\n ],\n [\n \"caf754272dc84563b0352b7a14311af55d245315ace27c65369e15f7151d41d1\",\n \"cb474660ef35f5f2a41b643fa5e460575f4fa9b7962232a5c32f908318a04476\",\n ],\n [\n \"2600ca4b282cb986f85d0f1709979d8b44a09c07cb86d7c124497bc86f082120\",\n \"4119b88753c15bd6a693b03fcddbb45d5ac6be74ab5f0ef44b0be9475a7e4b40\",\n ],\n [\n \"7635ca72d7e8432c338ec53cd12220bc01c48685e24f7dc8c602a7746998e435\",\n \"91b649609489d613d1d5e590f78e6d74ecfc061d57048bad9e76f302c5b9c61\",\n ],\n [\n \"754e3239f325570cdbbf4a87deee8a66b7f2b33479d468fbc1a50743bf56cc18\",\n \"673fb86e5bda30fb3cd0ed304ea49a023ee33d0197a695d0c5d98093c536683\",\n ],\n [\n \"e3e6bd1071a1e96aff57859c82d570f0330800661d1c952f9fe2694691d9b9e8\",\n \"59c9e0bba394e76f40c0aa58379a3cb6a5a2283993e90c4167002af4920e37f5\",\n ],\n [\n \"186b483d056a033826ae73d88f732985c4ccb1f32ba35f4b4cc47fdcf04aa6eb\",\n \"3b952d32c67cf77e2e17446e204180ab21fb8090895138b4a4a797f86e80888b\",\n ],\n [\n \"df9d70a6b9876ce544c98561f4be4f725442e6d2b737d9c91a8321724ce0963f\",\n \"55eb2dafd84d6ccd5f862b785dc39d4ab157222720ef9da217b8c45cf2ba2417\",\n ],\n [\n \"5edd5cc23c51e87a497ca815d5dce0f8ab52554f849ed8995de64c5f34ce7143\",\n \"efae9c8dbc14130661e8cec030c89ad0c13c66c0d17a2905cdc706ab7399a868\",\n ],\n [\n \"290798c2b6476830da12fe02287e9e777aa3fba1c355b17a722d362f84614fba\",\n \"e38da76dcd440621988d00bcf79af25d5b29c094db2a23146d003afd41943e7a\",\n ],\n [\n \"af3c423a95d9f5b3054754efa150ac39cd29552fe360257362dfdecef4053b45\",\n \"f98a3fd831eb2b749a93b0e6f35cfb40c8cd5aa667a15581bc2feded498fd9c6\",\n ],\n [\n \"766dbb24d134e745cccaa28c99bf274906bb66b26dcf98df8d2fed50d884249a\",\n \"744b1152eacbe5e38dcc887980da38b897584a65fa06cedd2c924f97cbac5996\",\n ],\n [\n \"59dbf46f8c94759ba21277c33784f41645f7b44f6c596a58ce92e666191abe3e\",\n \"c534ad44175fbc300f4ea6ce648309a042ce739a7919798cd85e216c4a307f6e\",\n ],\n [\n \"f13ada95103c4537305e691e74e9a4a8dd647e711a95e73cb62dc6018cfd87b8\",\n \"e13817b44ee14de663bf4bc808341f326949e21a6a75c2570778419bdaf5733d\",\n ],\n [\n \"7754b4fa0e8aced06d4167a2c59cca4cda1869c06ebadfb6488550015a88522c\",\n \"30e93e864e669d82224b967c3020b8fa8d1e4e350b6cbcc537a48b57841163a2\",\n ],\n [\n \"948dcadf5990e048aa3874d46abef9d701858f95de8041d2a6828c99e2262519\",\n \"e491a42537f6e597d5d28a3224b1bc25df9154efbd2ef1d2cbba2cae5347d57e\",\n ],\n [\n \"7962414450c76c1689c7b48f8202ec37fb224cf5ac0bfa1570328a8a3d7c77ab\",\n \"100b610ec4ffb4760d5c1fc133ef6f6b12507a051f04ac5760afa5b29db83437\",\n ],\n [\n \"3514087834964b54b15b160644d915485a16977225b8847bb0dd085137ec47ca\",\n \"ef0afbb2056205448e1652c48e8127fc6039e77c15c2378b7e7d15a0de293311\",\n ],\n [\n \"d3cc30ad6b483e4bc79ce2c9dd8bc54993e947eb8df787b442943d3f7b527eaf\",\n \"8b378a22d827278d89c5e9be8f9508ae3c2ad46290358630afb34db04eede0a4\",\n ],\n [\n \"1624d84780732860ce1c78fcbfefe08b2b29823db913f6493975ba0ff4847610\",\n \"68651cf9b6da903e0914448c6cd9d4ca896878f5282be4c8cc06e2a404078575\",\n ],\n [\n \"733ce80da955a8a26902c95633e62a985192474b5af207da6df7b4fd5fc61cd4\",\n \"f5435a2bd2badf7d485a4d8b8db9fcce3e1ef8e0201e4578c54673bc1dc5ea1d\",\n ],\n [\n \"15d9441254945064cf1a1c33bbd3b49f8966c5092171e699ef258dfab81c045c\",\n \"d56eb30b69463e7234f5137b73b84177434800bacebfc685fc37bbe9efe4070d\",\n ],\n [\n \"a1d0fcf2ec9de675b612136e5ce70d271c21417c9d2b8aaaac138599d0717940\",\n \"edd77f50bcb5a3cab2e90737309667f2641462a54070f3d519212d39c197a629\",\n ],\n [\n \"e22fbe15c0af8ccc5780c0735f84dbe9a790badee8245c06c7ca37331cb36980\",\n \"a855babad5cd60c88b430a69f53a1a7a38289154964799be43d06d77d31da06\",\n ],\n [\n \"311091dd9860e8e20ee13473c1155f5f69635e394704eaa74009452246cfa9b3\",\n \"66db656f87d1f04fffd1f04788c06830871ec5a64feee685bd80f0b1286d8374\",\n ],\n [\n \"34c1fd04d301be89b31c0442d3e6ac24883928b45a9340781867d4232ec2dbdf\",\n \"9414685e97b1b5954bd46f730174136d57f1ceeb487443dc5321857ba73abee\",\n ],\n [\n \"f219ea5d6b54701c1c14de5b557eb42a8d13f3abbcd08affcc2a5e6b049b8d63\",\n \"4cb95957e83d40b0f73af4544cccf6b1f4b08d3c07b27fb8d8c2962a400766d1\",\n ],\n [\n \"d7b8740f74a8fbaab1f683db8f45de26543a5490bca627087236912469a0b448\",\n \"fa77968128d9c92ee1010f337ad4717eff15db5ed3c049b3411e0315eaa4593b\",\n ],\n [\n \"32d31c222f8f6f0ef86f7c98d3a3335ead5bcd32abdd94289fe4d3091aa824bf\",\n \"5f3032f5892156e39ccd3d7915b9e1da2e6dac9e6f26e961118d14b8462e1661\",\n ],\n [\n \"7461f371914ab32671045a155d9831ea8793d77cd59592c4340f86cbc18347b5\",\n \"8ec0ba238b96bec0cbdddcae0aa442542eee1ff50c986ea6b39847b3cc092ff6\",\n ],\n [\n \"ee079adb1df1860074356a25aa38206a6d716b2c3e67453d287698bad7b2b2d6\",\n \"8dc2412aafe3be5c4c5f37e0ecc5f9f6a446989af04c4e25ebaac479ec1c8c1e\",\n ],\n [\n \"16ec93e447ec83f0467b18302ee620f7e65de331874c9dc72bfd8616ba9da6b5\",\n \"5e4631150e62fb40d0e8c2a7ca5804a39d58186a50e497139626778e25b0674d\",\n ],\n [\n \"eaa5f980c245f6f038978290afa70b6bd8855897f98b6aa485b96065d537bd99\",\n \"f65f5d3e292c2e0819a528391c994624d784869d7e6ea67fb18041024edc07dc\",\n ],\n [\n \"78c9407544ac132692ee1910a02439958ae04877151342ea96c4b6b35a49f51\",\n \"f3e0319169eb9b85d5404795539a5e68fa1fbd583c064d2462b675f194a3ddb4\",\n ],\n [\n \"494f4be219a1a77016dcd838431aea0001cdc8ae7a6fc688726578d9702857a5\",\n \"42242a969283a5f339ba7f075e36ba2af925ce30d767ed6e55f4b031880d562c\",\n ],\n [\n \"a598a8030da6d86c6bc7f2f5144ea549d28211ea58faa70ebf4c1e665c1fe9b5\",\n \"204b5d6f84822c307e4b4a7140737aec23fc63b65b35f86a10026dbd2d864e6b\",\n ],\n [\n \"c41916365abb2b5d09192f5f2dbeafec208f020f12570a184dbadc3e58595997\",\n \"4f14351d0087efa49d245b328984989d5caf9450f34bfc0ed16e96b58fa9913\",\n ],\n [\n \"841d6063a586fa475a724604da03bc5b92a2e0d2e0a36acfe4c73a5514742881\",\n \"73867f59c0659e81904f9a1c7543698e62562d6744c169ce7a36de01a8d6154\",\n ],\n [\n \"5e95bb399a6971d376026947f89bde2f282b33810928be4ded112ac4d70e20d5\",\n \"39f23f366809085beebfc71181313775a99c9aed7d8ba38b161384c746012865\",\n ],\n [\n \"36e4641a53948fd476c39f8a99fd974e5ec07564b5315d8bf99471bca0ef2f66\",\n \"d2424b1b1abe4eb8164227b085c9aa9456ea13493fd563e06fd51cf5694c78fc\",\n ],\n [\n \"336581ea7bfbbb290c191a2f507a41cf5643842170e914faeab27c2c579f726\",\n \"ead12168595fe1be99252129b6e56b3391f7ab1410cd1e0ef3dcdcabd2fda224\",\n ],\n [\n \"8ab89816dadfd6b6a1f2634fcf00ec8403781025ed6890c4849742706bd43ede\",\n \"6fdcef09f2f6d0a044e654aef624136f503d459c3e89845858a47a9129cdd24e\",\n ],\n [\n \"1e33f1a746c9c5778133344d9299fcaa20b0938e8acff2544bb40284b8c5fb94\",\n \"60660257dd11b3aa9c8ed618d24edff2306d320f1d03010e33a7d2057f3b3b6\",\n ],\n [\n \"85b7c1dcb3cec1b7ee7f30ded79dd20a0ed1f4cc18cbcfcfa410361fd8f08f31\",\n \"3d98a9cdd026dd43f39048f25a8847f4fcafad1895d7a633c6fed3c35e999511\",\n ],\n [\n \"29df9fbd8d9e46509275f4b125d6d45d7fbe9a3b878a7af872a2800661ac5f51\",\n \"b4c4fe99c775a606e2d8862179139ffda61dc861c019e55cd2876eb2a27d84b\",\n ],\n [\n \"a0b1cae06b0a847a3fea6e671aaf8adfdfe58ca2f768105c8082b2e449fce252\",\n \"ae434102edde0958ec4b19d917a6a28e6b72da1834aff0e650f049503a296cf2\",\n ],\n [\n \"4e8ceafb9b3e9a136dc7ff67e840295b499dfb3b2133e4ba113f2e4c0e121e5\",\n \"cf2174118c8b6d7a4b48f6d534ce5c79422c086a63460502b827ce62a326683c\",\n ],\n [\n \"d24a44e047e19b6f5afb81c7ca2f69080a5076689a010919f42725c2b789a33b\",\n \"6fb8d5591b466f8fc63db50f1c0f1c69013f996887b8244d2cdec417afea8fa3\",\n ],\n [\n \"ea01606a7a6c9cdd249fdfcfacb99584001edd28abbab77b5104e98e8e3b35d4\",\n \"322af4908c7312b0cfbfe369f7a7b3cdb7d4494bc2823700cfd652188a3ea98d\",\n ],\n [\n \"af8addbf2b661c8a6c6328655eb96651252007d8c5ea31be4ad196de8ce2131f\",\n \"6749e67c029b85f52a034eafd096836b2520818680e26ac8f3dfbcdb71749700\",\n ],\n [\n \"e3ae1974566ca06cc516d47e0fb165a674a3dabcfca15e722f0e3450f45889\",\n \"2aeabe7e4531510116217f07bf4d07300de97e4874f81f533420a72eeb0bd6a4\",\n ],\n [\n \"591ee355313d99721cf6993ffed1e3e301993ff3ed258802075ea8ced397e246\",\n \"b0ea558a113c30bea60fc4775460c7901ff0b053d25ca2bdeee98f1a4be5d196\",\n ],\n [\n \"11396d55fda54c49f19aa97318d8da61fa8584e47b084945077cf03255b52984\",\n \"998c74a8cd45ac01289d5833a7beb4744ff536b01b257be4c5767bea93ea57a4\",\n ],\n [\n \"3c5d2a1ba39c5a1790000738c9e0c40b8dcdfd5468754b6405540157e017aa7a\",\n \"b2284279995a34e2f9d4de7396fc18b80f9b8b9fdd270f6661f79ca4c81bd257\",\n ],\n [\n \"cc8704b8a60a0defa3a99a7299f2e9c3fbc395afb04ac078425ef8a1793cc030\",\n \"bdd46039feed17881d1e0862db347f8cf395b74fc4bcdc4e940b74e3ac1f1b13\",\n ],\n [\n \"c533e4f7ea8555aacd9777ac5cad29b97dd4defccc53ee7ea204119b2889b197\",\n \"6f0a256bc5efdf429a2fb6242f1a43a2d9b925bb4a4b3a26bb8e0f45eb596096\",\n ],\n [\n \"c14f8f2ccb27d6f109f6d08d03cc96a69ba8c34eec07bbcf566d48e33da6593\",\n \"c359d6923bb398f7fd4473e16fe1c28475b740dd098075e6c0e8649113dc3a38\",\n ],\n [\n \"a6cbc3046bc6a450bac24789fa17115a4c9739ed75f8f21ce441f72e0b90e6ef\",\n \"21ae7f4680e889bb130619e2c0f95a360ceb573c70603139862afd617fa9b9f\",\n ],\n [\n \"347d6d9a02c48927ebfb86c1359b1caf130a3c0267d11ce6344b39f99d43cc38\",\n \"60ea7f61a353524d1c987f6ecec92f086d565ab687870cb12689ff1e31c74448\",\n ],\n [\n \"da6545d2181db8d983f7dcb375ef5866d47c67b1bf31c8cf855ef7437b72656a\",\n \"49b96715ab6878a79e78f07ce5680c5d6673051b4935bd897fea824b77dc208a\",\n ],\n [\n \"c40747cc9d012cb1a13b8148309c6de7ec25d6945d657146b9d5994b8feb1111\",\n \"5ca560753be2a12fc6de6caf2cb489565db936156b9514e1bb5e83037e0fa2d4\",\n ],\n [\n \"4e42c8ec82c99798ccf3a610be870e78338c7f713348bd34c8203ef4037f3502\",\n \"7571d74ee5e0fb92a7a8b33a07783341a5492144cc54bcc40a94473693606437\",\n ],\n [\n \"3775ab7089bc6af823aba2e1af70b236d251cadb0c86743287522a1b3b0dedea\",\n \"be52d107bcfa09d8bcb9736a828cfa7fac8db17bf7a76a2c42ad961409018cf7\",\n ],\n [\n \"cee31cbf7e34ec379d94fb814d3d775ad954595d1314ba8846959e3e82f74e26\",\n \"8fd64a14c06b589c26b947ae2bcf6bfa0149ef0be14ed4d80f448a01c43b1c6d\",\n ],\n [\n \"b4f9eaea09b6917619f6ea6a4eb5464efddb58fd45b1ebefcdc1a01d08b47986\",\n \"39e5c9925b5a54b07433a4f18c61726f8bb131c012ca542eb24a8ac07200682a\",\n ],\n [\n \"d4263dfc3d2df923a0179a48966d30ce84e2515afc3dccc1b77907792ebcc60e\",\n \"62dfaf07a0f78feb30e30d6295853ce189e127760ad6cf7fae164e122a208d54\",\n ],\n [\n \"48457524820fa65a4f8d35eb6930857c0032acc0a4a2de422233eeda897612c4\",\n \"25a748ab367979d98733c38a1fa1c2e7dc6cc07db2d60a9ae7a76aaa49bd0f77\",\n ],\n [\n \"dfeeef1881101f2cb11644f3a2afdfc2045e19919152923f367a1767c11cceda\",\n \"ecfb7056cf1de042f9420bab396793c0c390bde74b4bbdff16a83ae09a9a7517\",\n ],\n [\n \"6d7ef6b17543f8373c573f44e1f389835d89bcbc6062ced36c82df83b8fae859\",\n \"cd450ec335438986dfefa10c57fea9bcc521a0959b2d80bbf74b190dca712d10\",\n ],\n [\n \"e75605d59102a5a2684500d3b991f2e3f3c88b93225547035af25af66e04541f\",\n \"f5c54754a8f71ee540b9b48728473e314f729ac5308b06938360990e2bfad125\",\n ],\n [\n \"eb98660f4c4dfaa06a2be453d5020bc99a0c2e60abe388457dd43fefb1ed620c\",\n \"6cb9a8876d9cb8520609af3add26cd20a0a7cd8a9411131ce85f44100099223e\",\n ],\n [\n \"13e87b027d8514d35939f2e6892b19922154596941888336dc3563e3b8dba942\",\n \"fef5a3c68059a6dec5d624114bf1e91aac2b9da568d6abeb2570d55646b8adf1\",\n ],\n [\n \"ee163026e9fd6fe017c38f06a5be6fc125424b371ce2708e7bf4491691e5764a\",\n \"1acb250f255dd61c43d94ccc670d0f58f49ae3fa15b96623e5430da0ad6c62b2\",\n ],\n [\n \"b268f5ef9ad51e4d78de3a750c2dc89b1e626d43505867999932e5db33af3d80\",\n \"5f310d4b3c99b9ebb19f77d41c1dee018cf0d34fd4191614003e945a1216e423\",\n ],\n [\n \"ff07f3118a9df035e9fad85eb6c7bfe42b02f01ca99ceea3bf7ffdba93c4750d\",\n \"438136d603e858a3a5c440c38eccbaddc1d2942114e2eddd4740d098ced1f0d8\",\n ],\n [\n \"8d8b9855c7c052a34146fd20ffb658bea4b9f69e0d825ebec16e8c3ce2b526a1\",\n \"cdb559eedc2d79f926baf44fb84ea4d44bcf50fee51d7ceb30e2e7f463036758\",\n ],\n [\n \"52db0b5384dfbf05bfa9d472d7ae26dfe4b851ceca91b1eba54263180da32b63\",\n \"c3b997d050ee5d423ebaf66a6db9f57b3180c902875679de924b69d84a7b375\",\n ],\n [\n \"e62f9490d3d51da6395efd24e80919cc7d0f29c3f3fa48c6fff543becbd43352\",\n \"6d89ad7ba4876b0b22c2ca280c682862f342c8591f1daf5170e07bfd9ccafa7d\",\n ],\n [\n \"7f30ea2476b399b4957509c88f77d0191afa2ff5cb7b14fd6d8e7d65aaab1193\",\n \"ca5ef7d4b231c94c3b15389a5f6311e9daff7bb67b103e9880ef4bff637acaec\",\n ],\n [\n \"5098ff1e1d9f14fb46a210fada6c903fef0fb7b4a1dd1d9ac60a0361800b7a00\",\n \"9731141d81fc8f8084d37c6e7542006b3ee1b40d60dfe5362a5b132fd17ddc0\",\n ],\n [\n \"32b78c7de9ee512a72895be6b9cbefa6e2f3c4ccce445c96b9f2c81e2778ad58\",\n \"ee1849f513df71e32efc3896ee28260c73bb80547ae2275ba497237794c8753c\",\n ],\n [\n \"e2cb74fddc8e9fbcd076eef2a7c72b0ce37d50f08269dfc074b581550547a4f7\",\n \"d3aa2ed71c9dd2247a62df062736eb0baddea9e36122d2be8641abcb005cc4a4\",\n ],\n [\n \"8438447566d4d7bedadc299496ab357426009a35f235cb141be0d99cd10ae3a8\",\n \"c4e1020916980a4da5d01ac5e6ad330734ef0d7906631c4f2390426b2edd791f\",\n ],\n [\n \"4162d488b89402039b584c6fc6c308870587d9c46f660b878ab65c82c711d67e\",\n \"67163e903236289f776f22c25fb8a3afc1732f2b84b4e95dbda47ae5a0852649\",\n ],\n [\n \"3fad3fa84caf0f34f0f89bfd2dcf54fc175d767aec3e50684f3ba4a4bf5f683d\",\n \"cd1bc7cb6cc407bb2f0ca647c718a730cf71872e7d0d2a53fa20efcdfe61826\",\n ],\n [\n \"674f2600a3007a00568c1a7ce05d0816c1fb84bf1370798f1c69532faeb1a86b\",\n \"299d21f9413f33b3edf43b257004580b70db57da0b182259e09eecc69e0d38a5\",\n ],\n [\n \"d32f4da54ade74abb81b815ad1fb3b263d82d6c692714bcff87d29bd5ee9f08f\",\n \"f9429e738b8e53b968e99016c059707782e14f4535359d582fc416910b3eea87\",\n ],\n [\n \"30e4e670435385556e593657135845d36fbb6931f72b08cb1ed954f1e3ce3ff6\",\n \"462f9bce619898638499350113bbc9b10a878d35da70740dc695a559eb88db7b\",\n ],\n [\n \"be2062003c51cc3004682904330e4dee7f3dcd10b01e580bf1971b04d4cad297\",\n \"62188bc49d61e5428573d48a74e1c655b1c61090905682a0d5558ed72dccb9bc\",\n ],\n [\n \"93144423ace3451ed29e0fb9ac2af211cb6e84a601df5993c419859fff5df04a\",\n \"7c10dfb164c3425f5c71a3f9d7992038f1065224f72bb9d1d902a6d13037b47c\",\n ],\n [\n \"b015f8044f5fcbdcf21ca26d6c34fb8197829205c7b7d2a7cb66418c157b112c\",\n \"ab8c1e086d04e813744a655b2df8d5f83b3cdc6faa3088c1d3aea1454e3a1d5f\",\n ],\n [\n \"d5e9e1da649d97d89e4868117a465a3a4f8a18de57a140d36b3f2af341a21b52\",\n \"4cb04437f391ed73111a13cc1d4dd0db1693465c2240480d8955e8592f27447a\",\n ],\n [\n \"d3ae41047dd7ca065dbf8ed77b992439983005cd72e16d6f996a5316d36966bb\",\n \"bd1aeb21ad22ebb22a10f0303417c6d964f8cdd7df0aca614b10dc14d125ac46\",\n ],\n [\n \"463e2763d885f958fc66cdd22800f0a487197d0a82e377b49f80af87c897b065\",\n \"bfefacdb0e5d0fd7df3a311a94de062b26b80c61fbc97508b79992671ef7ca7f\",\n ],\n [\n \"7985fdfd127c0567c6f53ec1bb63ec3158e597c40bfe747c83cddfc910641917\",\n \"603c12daf3d9862ef2b25fe1de289aed24ed291e0ec6708703a5bd567f32ed03\",\n ],\n [\n \"74a1ad6b5f76e39db2dd249410eac7f99e74c59cb83d2d0ed5ff1543da7703e9\",\n \"cc6157ef18c9c63cd6193d83631bbea0093e0968942e8c33d5737fd790e0db08\",\n ],\n [\n \"30682a50703375f602d416664ba19b7fc9bab42c72747463a71d0896b22f6da3\",\n \"553e04f6b018b4fa6c8f39e7f311d3176290d0e0f19ca73f17714d9977a22ff8\",\n ],\n [\n \"9e2158f0d7c0d5f26c3791efefa79597654e7a2b2464f52b1ee6c1347769ef57\",\n \"712fcdd1b9053f09003a3481fa7762e9ffd7c8ef35a38509e2fbf2629008373\",\n ],\n [\n \"176e26989a43c9cfeba4029c202538c28172e566e3c4fce7322857f3be327d66\",\n \"ed8cc9d04b29eb877d270b4878dc43c19aefd31f4eee09ee7b47834c1fa4b1c3\",\n ],\n [\n \"75d46efea3771e6e68abb89a13ad747ecf1892393dfc4f1b7004788c50374da8\",\n \"9852390a99507679fd0b86fd2b39a868d7efc22151346e1a3ca4726586a6bed8\",\n ],\n [\n \"809a20c67d64900ffb698c4c825f6d5f2310fb0451c869345b7319f645605721\",\n \"9e994980d9917e22b76b061927fa04143d096ccc54963e6a5ebfa5f3f8e286c1\",\n ],\n [\n \"1b38903a43f7f114ed4500b4eac7083fdefece1cf29c63528d563446f972c180\",\n \"4036edc931a60ae889353f77fd53de4a2708b26b6f5da72ad3394119daf408f9\",\n ],\n ],\n },\n };\n },\n});\n\n// node_modules/elliptic/lib/elliptic/curves.js\nvar require_curves = __commonJS({\n \"node_modules/elliptic/lib/elliptic/curves.js\"(exports) {\n \"use strict\";\n var curves = exports,\n hash = require_hash2(),\n curve = require_curve(),\n utils = require_utils3(),\n assert = utils.assert;\n function PresetCurve(options) {\n options.type === \"short\"\n ? (this.curve = new curve.short(options))\n : options.type === \"edwards\"\n ? (this.curve = new curve.edwards(options))\n : (this.curve = new curve.mont(options)),\n (this.g = this.curve.g),\n (this.n = this.curve.n),\n (this.hash = options.hash),\n assert(this.g.validate(), \"Invalid curve\"),\n assert(this.g.mul(this.n).isInfinity(), \"Invalid curve, G*N != O\");\n }\n curves.PresetCurve = PresetCurve;\n function defineCurve(name, options) {\n Object.defineProperty(curves, name, {\n configurable: !0,\n enumerable: !0,\n get: function () {\n var curve2 = new PresetCurve(options);\n return (\n Object.defineProperty(curves, name, {\n configurable: !0,\n enumerable: !0,\n value: curve2,\n }),\n curve2\n );\n },\n });\n }\n defineCurve(\"p192\", {\n type: \"short\",\n prime: \"p192\",\n p: \"ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff\",\n a: \"ffffffff ffffffff ffffffff fffffffe ffffffff fffffffc\",\n b: \"64210519 e59c80e7 0fa7e9ab 72243049 feb8deec c146b9b1\",\n n: \"ffffffff ffffffff ffffffff 99def836 146bc9b1 b4d22831\",\n hash: hash.sha256,\n gRed: !1,\n g: [\n \"188da80e b03090f6 7cbf20eb 43a18800 f4ff0afd 82ff1012\",\n \"07192b95 ffc8da78 631011ed 6b24cdd5 73f977a1 1e794811\",\n ],\n });\n defineCurve(\"p224\", {\n type: \"short\",\n prime: \"p224\",\n p: \"ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001\",\n a: \"ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff fffffffe\",\n b: \"b4050a85 0c04b3ab f5413256 5044b0b7 d7bfd8ba 270b3943 2355ffb4\",\n n: \"ffffffff ffffffff ffffffff ffff16a2 e0b8f03e 13dd2945 5c5c2a3d\",\n hash: hash.sha256,\n gRed: !1,\n g: [\n \"b70e0cbd 6bb4bf7f 321390b9 4a03c1d3 56c21122 343280d6 115c1d21\",\n \"bd376388 b5f723fb 4c22dfe6 cd4375a0 5a074764 44d58199 85007e34\",\n ],\n });\n defineCurve(\"p256\", {\n type: \"short\",\n prime: null,\n p: \"ffffffff 00000001 00000000 00000000 00000000 ffffffff ffffffff ffffffff\",\n a: \"ffffffff 00000001 00000000 00000000 00000000 ffffffff ffffffff fffffffc\",\n b: \"5ac635d8 aa3a93e7 b3ebbd55 769886bc 651d06b0 cc53b0f6 3bce3c3e 27d2604b\",\n n: \"ffffffff 00000000 ffffffff ffffffff bce6faad a7179e84 f3b9cac2 fc632551\",\n hash: hash.sha256,\n gRed: !1,\n g: [\n \"6b17d1f2 e12c4247 f8bce6e5 63a440f2 77037d81 2deb33a0 f4a13945 d898c296\",\n \"4fe342e2 fe1a7f9b 8ee7eb4a 7c0f9e16 2bce3357 6b315ece cbb64068 37bf51f5\",\n ],\n });\n defineCurve(\"p384\", {\n type: \"short\",\n prime: null,\n p: \"ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe ffffffff 00000000 00000000 ffffffff\",\n a: \"ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe ffffffff 00000000 00000000 fffffffc\",\n b: \"b3312fa7 e23ee7e4 988e056b e3f82d19 181d9c6e fe814112 0314088f 5013875a c656398d 8a2ed19d 2a85c8ed d3ec2aef\",\n n: \"ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff c7634d81 f4372ddf 581a0db2 48b0a77a ecec196a ccc52973\",\n hash: hash.sha384,\n gRed: !1,\n g: [\n \"aa87ca22 be8b0537 8eb1c71e f320ad74 6e1d3b62 8ba79b98 59f741e0 82542a38 5502f25d bf55296c 3a545e38 72760ab7\",\n \"3617de4a 96262c6f 5d9e98bf 9292dc29 f8f41dbd 289a147c e9da3113 b5f0b8c0 0a60b1ce 1d7e819d 7a431d7c 90ea0e5f\",\n ],\n });\n defineCurve(\"p521\", {\n type: \"short\",\n prime: null,\n p: \"000001ff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff\",\n a: \"000001ff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffc\",\n b: \"00000051 953eb961 8e1c9a1f 929a21a0 b68540ee a2da725b 99b315f3 b8b48991 8ef109e1 56193951 ec7e937b 1652c0bd 3bb1bf07 3573df88 3d2c34f1 ef451fd4 6b503f00\",\n n: \"000001ff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffa 51868783 bf2f966b 7fcc0148 f709a5d0 3bb5c9b8 899c47ae bb6fb71e 91386409\",\n hash: hash.sha512,\n gRed: !1,\n g: [\n \"000000c6 858e06b7 0404e9cd 9e3ecb66 2395b442 9c648139 053fb521 f828af60 6b4d3dba a14b5e77 efe75928 fe1dc127 a2ffa8de 3348b3c1 856a429b f97e7e31 c2e5bd66\",\n \"00000118 39296a78 9a3bc004 5c8a5fb4 2c7d1bd9 98f54449 579b4468 17afbd17 273e662c 97ee7299 5ef42640 c550b901 3fad0761 353c7086 a272c240 88be9476 9fd16650\",\n ],\n });\n defineCurve(\"curve25519\", {\n type: \"mont\",\n prime: \"p25519\",\n p: \"7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed\",\n a: \"76d06\",\n b: \"1\",\n n: \"1000000000000000 0000000000000000 14def9dea2f79cd6 5812631a5cf5d3ed\",\n hash: hash.sha256,\n gRed: !1,\n g: [\"9\"],\n });\n defineCurve(\"ed25519\", {\n type: \"edwards\",\n prime: \"p25519\",\n p: \"7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed\",\n a: \"-1\",\n c: \"1\",\n d: \"52036cee2b6ffe73 8cc740797779e898 00700a4d4141d8ab 75eb4dca135978a3\",\n n: \"1000000000000000 0000000000000000 14def9dea2f79cd6 5812631a5cf5d3ed\",\n hash: hash.sha256,\n gRed: !1,\n g: [\n \"216936d3cd6e53fec0a4e231fdd6dc5c692cc7609525a7b2c9562d608f25d51a\",\n \"6666666666666666666666666666666666666666666666666666666666666658\",\n ],\n });\n var pre;\n try {\n pre = require_secp256k1();\n } catch {\n pre = void 0;\n }\n defineCurve(\"secp256k1\", {\n type: \"short\",\n prime: \"k256\",\n p: \"ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f\",\n a: \"0\",\n b: \"7\",\n n: \"ffffffff ffffffff ffffffff fffffffe baaedce6 af48a03b bfd25e8c d0364141\",\n h: \"1\",\n hash: hash.sha256,\n beta: \"7ae96a2b657c07106e64479eac3434e99cf0497512f58995c1396c28719501ee\",\n lambda: \"5363ad4cc05c30e0a5261c028812645a122e22ea20816678df02967c1b23bd72\",\n basis: [\n {\n a: \"3086d221a7d46bcde86c90e49284eb15\",\n b: \"-e4437ed6010e88286f547fa90abfe4c3\",\n },\n {\n a: \"114ca50f7a8e2f3f657c1108d9d44cfd8\",\n b: \"3086d221a7d46bcde86c90e49284eb15\",\n },\n ],\n gRed: !1,\n g: [\n \"79be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798\",\n \"483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8\",\n pre,\n ],\n });\n },\n});\n\n// node_modules/hmac-drbg/lib/hmac-drbg.js\nvar require_hmac_drbg = __commonJS({\n \"node_modules/hmac-drbg/lib/hmac-drbg.js\"(exports, module) {\n \"use strict\";\n var hash = require_hash2(),\n utils = require_utils2(),\n assert = require_minimalistic_assert();\n function HmacDRBG(options) {\n if (!(this instanceof HmacDRBG)) return new HmacDRBG(options);\n (this.hash = options.hash),\n (this.predResist = !!options.predResist),\n (this.outLen = this.hash.outSize),\n (this.minEntropy = options.minEntropy || this.hash.hmacStrength),\n (this._reseed = null),\n (this.reseedInterval = null),\n (this.K = null),\n (this.V = null);\n var entropy = utils.toArray(options.entropy, options.entropyEnc || \"hex\"),\n nonce = utils.toArray(options.nonce, options.nonceEnc || \"hex\"),\n pers = utils.toArray(options.pers, options.persEnc || \"hex\");\n assert(entropy.length >= this.minEntropy / 8, \"Not enough entropy. Minimum is: \" + this.minEntropy + \" bits\"),\n this._init(entropy, nonce, pers);\n }\n module.exports = HmacDRBG;\n HmacDRBG.prototype._init = function (entropy, nonce, pers) {\n var seed = entropy.concat(nonce).concat(pers);\n (this.K = new Array(this.outLen / 8)), (this.V = new Array(this.outLen / 8));\n for (var i = 0; i < this.V.length; i++) (this.K[i] = 0), (this.V[i] = 1);\n this._update(seed), (this._reseed = 1), (this.reseedInterval = 281474976710656);\n };\n HmacDRBG.prototype._hmac = function () {\n return new hash.hmac(this.hash, this.K);\n };\n HmacDRBG.prototype._update = function (seed) {\n var kmac = this._hmac().update(this.V).update([0]);\n seed && (kmac = kmac.update(seed)),\n (this.K = kmac.digest()),\n (this.V = this._hmac().update(this.V).digest()),\n seed &&\n ((this.K = this._hmac().update(this.V).update([1]).update(seed).digest()),\n (this.V = this._hmac().update(this.V).digest()));\n };\n HmacDRBG.prototype.reseed = function (entropy, entropyEnc, add, addEnc) {\n typeof entropyEnc != \"string\" && ((addEnc = add), (add = entropyEnc), (entropyEnc = null)),\n (entropy = utils.toArray(entropy, entropyEnc)),\n (add = utils.toArray(add, addEnc)),\n assert(entropy.length >= this.minEntropy / 8, \"Not enough entropy. Minimum is: \" + this.minEntropy + \" bits\"),\n this._update(entropy.concat(add || [])),\n (this._reseed = 1);\n };\n HmacDRBG.prototype.generate = function (len, enc, add, addEnc) {\n if (this._reseed > this.reseedInterval) throw new Error(\"Reseed is required\");\n typeof enc != \"string\" && ((addEnc = add), (add = enc), (enc = null)),\n add && ((add = utils.toArray(add, addEnc || \"hex\")), this._update(add));\n for (var temp = []; temp.length < len; )\n (this.V = this._hmac().update(this.V).digest()), (temp = temp.concat(this.V));\n var res = temp.slice(0, len);\n return this._update(add), this._reseed++, utils.encode(res, enc);\n };\n },\n});\n\n// node_modules/elliptic/lib/elliptic/ec/key.js\nvar require_key = __commonJS({\n \"node_modules/elliptic/lib/elliptic/ec/key.js\"(exports, module) {\n \"use strict\";\n var BN = require_bn4(),\n utils = require_utils3(),\n assert = utils.assert;\n function KeyPair(ec, options) {\n (this.ec = ec),\n (this.priv = null),\n (this.pub = null),\n options.priv && this._importPrivate(options.priv, options.privEnc),\n options.pub && this._importPublic(options.pub, options.pubEnc);\n }\n module.exports = KeyPair;\n KeyPair.fromPublic = function (ec, pub, enc) {\n return pub instanceof KeyPair\n ? pub\n : new KeyPair(ec, {\n pub,\n pubEnc: enc,\n });\n };\n KeyPair.fromPrivate = function (ec, priv, enc) {\n return priv instanceof KeyPair\n ? priv\n : new KeyPair(ec, {\n priv,\n privEnc: enc,\n });\n };\n KeyPair.prototype.validate = function () {\n var pub = this.getPublic();\n return pub.isInfinity()\n ? { result: !1, reason: \"Invalid public key\" }\n : pub.validate()\n ? pub.mul(this.ec.curve.n).isInfinity()\n ? { result: !0, reason: null }\n : { result: !1, reason: \"Public key * N != O\" }\n : { result: !1, reason: \"Public key is not a point\" };\n };\n KeyPair.prototype.getPublic = function (compact, enc) {\n return (\n typeof compact == \"string\" && ((enc = compact), (compact = null)),\n this.pub || (this.pub = this.ec.g.mul(this.priv)),\n enc ? this.pub.encode(enc, compact) : this.pub\n );\n };\n KeyPair.prototype.getPrivate = function (enc) {\n return enc === \"hex\" ? this.priv.toString(16, 2) : this.priv;\n };\n KeyPair.prototype._importPrivate = function (key, enc) {\n (this.priv = new BN(key, enc || 16)), (this.priv = this.priv.umod(this.ec.curve.n));\n };\n KeyPair.prototype._importPublic = function (key, enc) {\n if (key.x || key.y) {\n this.ec.curve.type === \"mont\"\n ? assert(key.x, \"Need x coordinate\")\n : (this.ec.curve.type === \"short\" || this.ec.curve.type === \"edwards\") &&\n assert(key.x && key.y, \"Need both x and y coordinate\"),\n (this.pub = this.ec.curve.point(key.x, key.y));\n return;\n }\n this.pub = this.ec.curve.decodePoint(key, enc);\n };\n KeyPair.prototype.derive = function (pub) {\n return pub.validate() || assert(pub.validate(), \"public point not validated\"), pub.mul(this.priv).getX();\n };\n KeyPair.prototype.sign = function (msg, enc, options) {\n return this.ec.sign(msg, this, enc, options);\n };\n KeyPair.prototype.verify = function (msg, signature) {\n return this.ec.verify(msg, signature, this);\n };\n KeyPair.prototype.inspect = function () {\n return (\n \"<Key priv: \" + (this.priv && this.priv.toString(16, 2)) + \" pub: \" + (this.pub && this.pub.inspect()) + \" >\"\n );\n };\n },\n});\n\n// node_modules/elliptic/lib/elliptic/ec/signature.js\nvar require_signature = __commonJS({\n \"node_modules/elliptic/lib/elliptic/ec/signature.js\"(exports, module) {\n \"use strict\";\n var BN = require_bn4(),\n utils = require_utils3(),\n assert = utils.assert;\n function Signature(options, enc) {\n if (options instanceof Signature) return options;\n this._importDER(options, enc) ||\n (assert(options.r && options.s, \"Signature without r or s\"),\n (this.r = new BN(options.r, 16)),\n (this.s = new BN(options.s, 16)),\n options.recoveryParam === void 0 ? (this.recoveryParam = null) : (this.recoveryParam = options.recoveryParam));\n }\n module.exports = Signature;\n function Position() {\n this.place = 0;\n }\n function getLength(buf, p) {\n var initial = buf[p.place++];\n if (!(initial & 128)) return initial;\n var octetLen = initial & 15;\n if (octetLen === 0 || octetLen > 4) return !1;\n for (var val = 0, i = 0, off = p.place; i < octetLen; i++, off++) (val <<= 8), (val |= buf[off]), (val >>>= 0);\n return val <= 127 ? !1 : ((p.place = off), val);\n }\n function rmPadding(buf) {\n for (var i = 0, len = buf.length - 1; !buf[i] && !(buf[i + 1] & 128) && i < len; ) i++;\n return i === 0 ? buf : buf.slice(i);\n }\n Signature.prototype._importDER = function (data, enc) {\n data = utils.toArray(data, enc);\n var p = new Position();\n if (data[p.place++] !== 48) return !1;\n var len = getLength(data, p);\n if (len === !1 || len + p.place !== data.length || data[p.place++] !== 2) return !1;\n var rlen = getLength(data, p);\n if (rlen === !1) return !1;\n var r = data.slice(p.place, rlen + p.place);\n if (((p.place += rlen), data[p.place++] !== 2)) return !1;\n var slen = getLength(data, p);\n if (slen === !1 || data.length !== slen + p.place) return !1;\n var s = data.slice(p.place, slen + p.place);\n if (r[0] === 0)\n if (r[1] & 128) r = r.slice(1);\n else return !1;\n if (s[0] === 0)\n if (s[1] & 128) s = s.slice(1);\n else return !1;\n return (this.r = new BN(r)), (this.s = new BN(s)), (this.recoveryParam = null), !0;\n };\n function constructLength(arr, len) {\n if (len < 128) {\n arr.push(len);\n return;\n }\n var octets = 1 + ((Math.log(len) / Math.LN2) >>> 3);\n for (arr.push(octets | 128); --octets; ) arr.push((len >>> (octets << 3)) & 255);\n arr.push(len);\n }\n Signature.prototype.toDER = function (enc) {\n var r = this.r.toArray(),\n s = this.s.toArray();\n for (\n r[0] & 128 && (r = [0].concat(r)), s[0] & 128 && (s = [0].concat(s)), r = rmPadding(r), s = rmPadding(s);\n !s[0] && !(s[1] & 128);\n\n )\n s = s.slice(1);\n var arr = [2];\n constructLength(arr, r.length), (arr = arr.concat(r)), arr.push(2), constructLength(arr, s.length);\n var backHalf = arr.concat(s),\n res = [48];\n return constructLength(res, backHalf.length), (res = res.concat(backHalf)), utils.encode(res, enc);\n };\n },\n});\n\n// node_modules/elliptic/lib/elliptic/ec/index.js\nvar require_ec = __commonJS({\n \"node_modules/elliptic/lib/elliptic/ec/index.js\"(exports, module) {\n \"use strict\";\n var BN = require_bn4(),\n HmacDRBG = require_hmac_drbg(),\n utils = require_utils3(),\n curves = require_curves(),\n rand = require_brorand(),\n assert = utils.assert,\n KeyPair = require_key(),\n Signature = require_signature();\n function EC(options) {\n if (!(this instanceof EC)) return new EC(options);\n typeof options == \"string\" &&\n (assert(Object.prototype.hasOwnProperty.call(curves, options), \"Unknown curve \" + options),\n (options = curves[options])),\n options instanceof curves.PresetCurve && (options = { curve: options }),\n (this.curve = options.curve.curve),\n (this.n = this.curve.n),\n (this.nh = this.n.ushrn(1)),\n (this.g = this.curve.g),\n (this.g = options.curve.g),\n this.g.precompute(options.curve.n.bitLength() + 1),\n (this.hash = options.hash || options.curve.hash);\n }\n module.exports = EC;\n EC.prototype.keyPair = function (options) {\n return new KeyPair(this, options);\n };\n EC.prototype.keyFromPrivate = function (priv, enc) {\n return KeyPair.fromPrivate(this, priv, enc);\n };\n EC.prototype.keyFromPublic = function (pub, enc) {\n return KeyPair.fromPublic(this, pub, enc);\n };\n EC.prototype.genKeyPair = function (options) {\n options || (options = {});\n for (\n var drbg = new HmacDRBG({\n hash: this.hash,\n pers: options.pers,\n persEnc: options.persEnc || \"utf8\",\n entropy: options.entropy || rand(this.hash.hmacStrength),\n entropyEnc: (options.entropy && options.entropyEnc) || \"utf8\",\n nonce: this.n.toArray(),\n }),\n bytes = this.n.byteLength(),\n ns2 = this.n.sub(new BN(2));\n ;\n\n ) {\n var priv = new BN(drbg.generate(bytes));\n if (!(priv.cmp(ns2) > 0)) return priv.iaddn(1), this.keyFromPrivate(priv);\n }\n };\n EC.prototype._truncateToN = function (msg, truncOnly) {\n var delta = msg.byteLength() * 8 - this.n.bitLength();\n return delta > 0 && (msg = msg.ushrn(delta)), !truncOnly && msg.cmp(this.n) >= 0 ? msg.sub(this.n) : msg;\n };\n EC.prototype.sign = function (msg, key, enc, options) {\n typeof enc == \"object\" && ((options = enc), (enc = null)),\n options || (options = {}),\n (key = this.keyFromPrivate(key, enc)),\n (msg = this._truncateToN(new BN(msg, 16)));\n for (\n var bytes = this.n.byteLength(),\n bkey = key.getPrivate().toArray(\"be\", bytes),\n nonce = msg.toArray(\"be\", bytes),\n drbg = new HmacDRBG({\n hash: this.hash,\n entropy: bkey,\n nonce,\n pers: options.pers,\n persEnc: options.persEnc || \"utf8\",\n }),\n ns1 = this.n.sub(new BN(1)),\n iter = 0;\n ;\n iter++\n ) {\n var k = options.k ? options.k(iter) : new BN(drbg.generate(this.n.byteLength()));\n if (((k = this._truncateToN(k, !0)), !(k.cmpn(1) <= 0 || k.cmp(ns1) >= 0))) {\n var kp = this.g.mul(k);\n if (!kp.isInfinity()) {\n var kpX = kp.getX(),\n r = kpX.umod(this.n);\n if (r.cmpn(0) !== 0) {\n var s = k.invm(this.n).mul(r.mul(key.getPrivate()).iadd(msg));\n if (((s = s.umod(this.n)), s.cmpn(0) !== 0)) {\n var recoveryParam = (kp.getY().isOdd() ? 1 : 0) | (kpX.cmp(r) !== 0 ? 2 : 0);\n return (\n options.canonical && s.cmp(this.nh) > 0 && ((s = this.n.sub(s)), (recoveryParam ^= 1)),\n new Signature({ r, s, recoveryParam })\n );\n }\n }\n }\n }\n }\n };\n EC.prototype.verify = function (msg, signature, key, enc) {\n (msg = this._truncateToN(new BN(msg, 16))),\n (key = this.keyFromPublic(key, enc)),\n (signature = new Signature(signature, \"hex\"));\n var r = signature.r,\n s = signature.s;\n if (r.cmpn(1) < 0 || r.cmp(this.n) >= 0 || s.cmpn(1) < 0 || s.cmp(this.n) >= 0) return !1;\n var sinv = s.invm(this.n),\n u1 = sinv.mul(msg).umod(this.n),\n u2 = sinv.mul(r).umod(this.n),\n p;\n return this.curve._maxwellTrick\n ? ((p = this.g.jmulAdd(u1, key.getPublic(), u2)), p.isInfinity() ? !1 : p.eqXToP(r))\n : ((p = this.g.mulAdd(u1, key.getPublic(), u2)), p.isInfinity() ? !1 : p.getX().umod(this.n).cmp(r) === 0);\n };\n EC.prototype.recoverPubKey = function (msg, signature, j, enc) {\n assert((3 & j) === j, \"The recovery param is more than two bits\"), (signature = new Signature(signature, enc));\n var n = this.n,\n e = new BN(msg),\n r = signature.r,\n s = signature.s,\n isYOdd = j & 1,\n isSecondKey = j >> 1;\n if (r.cmp(this.curve.p.umod(this.curve.n)) >= 0 && isSecondKey)\n throw new Error(\"Unable to find sencond key candinate\");\n isSecondKey ? (r = this.curve.pointFromX(r.add(this.curve.n), isYOdd)) : (r = this.curve.pointFromX(r, isYOdd));\n var rInv = signature.r.invm(n),\n s1 = n.sub(e).mul(rInv).umod(n),\n s2 = s.mul(rInv).umod(n);\n return this.g.mulAdd(s1, r, s2);\n };\n EC.prototype.getKeyRecoveryParam = function (e, signature, Q, enc) {\n if (((signature = new Signature(signature, enc)), signature.recoveryParam !== null))\n return signature.recoveryParam;\n for (var i = 0; i < 4; i++) {\n var Qprime;\n try {\n Qprime = this.recoverPubKey(e, signature, i);\n } catch {\n continue;\n }\n if (Qprime.eq(Q)) return i;\n }\n throw new Error(\"Unable to find valid recovery factor\");\n };\n },\n});\n\n// node_modules/elliptic/lib/elliptic/eddsa/key.js\nvar require_key2 = __commonJS({\n \"node_modules/elliptic/lib/elliptic/eddsa/key.js\"(exports, module) {\n \"use strict\";\n var utils = require_utils3(),\n assert = utils.assert,\n parseBytes = utils.parseBytes,\n cachedProperty = utils.cachedProperty;\n function KeyPair(eddsa, params) {\n (this.eddsa = eddsa),\n (this._secret = parseBytes(params.secret)),\n eddsa.isPoint(params.pub) ? (this._pub = params.pub) : (this._pubBytes = parseBytes(params.pub));\n }\n KeyPair.fromPublic = function (eddsa, pub) {\n return pub instanceof KeyPair ? pub : new KeyPair(eddsa, { pub });\n };\n KeyPair.fromSecret = function (eddsa, secret) {\n return secret instanceof KeyPair ? secret : new KeyPair(eddsa, { secret });\n };\n KeyPair.prototype.secret = function () {\n return this._secret;\n };\n cachedProperty(KeyPair, \"pubBytes\", function () {\n return this.eddsa.encodePoint(this.pub());\n });\n cachedProperty(KeyPair, \"pub\", function () {\n return this._pubBytes ? this.eddsa.decodePoint(this._pubBytes) : this.eddsa.g.mul(this.priv());\n });\n cachedProperty(KeyPair, \"privBytes\", function () {\n var eddsa = this.eddsa,\n hash = this.hash(),\n lastIx = eddsa.encodingLength - 1,\n a = hash.slice(0, eddsa.encodingLength);\n return (a[0] &= 248), (a[lastIx] &= 127), (a[lastIx] |= 64), a;\n });\n cachedProperty(KeyPair, \"priv\", function () {\n return this.eddsa.decodeInt(this.privBytes());\n });\n cachedProperty(KeyPair, \"hash\", function () {\n return this.eddsa.hash().update(this.secret()).digest();\n });\n cachedProperty(KeyPair, \"messagePrefix\", function () {\n return this.hash().slice(this.eddsa.encodingLength);\n });\n KeyPair.prototype.sign = function (message) {\n return assert(this._secret, \"KeyPair can only verify\"), this.eddsa.sign(message, this);\n };\n KeyPair.prototype.verify = function (message, sig) {\n return this.eddsa.verify(message, sig, this);\n };\n KeyPair.prototype.getSecret = function (enc) {\n return assert(this._secret, \"KeyPair is public only\"), utils.encode(this.secret(), enc);\n };\n KeyPair.prototype.getPublic = function (enc) {\n return utils.encode(this.pubBytes(), enc);\n };\n module.exports = KeyPair;\n },\n});\n\n// node_modules/elliptic/lib/elliptic/eddsa/signature.js\nvar require_signature2 = __commonJS({\n \"node_modules/elliptic/lib/elliptic/eddsa/signature.js\"(exports, module) {\n \"use strict\";\n var BN = require_bn4(),\n utils = require_utils3(),\n assert = utils.assert,\n cachedProperty = utils.cachedProperty,\n parseBytes = utils.parseBytes;\n function Signature(eddsa, sig) {\n (this.eddsa = eddsa),\n typeof sig != \"object\" && (sig = parseBytes(sig)),\n Array.isArray(sig) &&\n (sig = {\n R: sig.slice(0, eddsa.encodingLength),\n S: sig.slice(eddsa.encodingLength),\n }),\n assert(sig.R && sig.S, \"Signature without R or S\"),\n eddsa.isPoint(sig.R) && (this._R = sig.R),\n sig.S instanceof BN && (this._S = sig.S),\n (this._Rencoded = Array.isArray(sig.R) ? sig.R : sig.Rencoded),\n (this._Sencoded = Array.isArray(sig.S) ? sig.S : sig.Sencoded);\n }\n cachedProperty(Signature, \"S\", function () {\n return this.eddsa.decodeInt(this.Sencoded());\n });\n cachedProperty(Signature, \"R\", function () {\n return this.eddsa.decodePoint(this.Rencoded());\n });\n cachedProperty(Signature, \"Rencoded\", function () {\n return this.eddsa.encodePoint(this.R());\n });\n cachedProperty(Signature, \"Sencoded\", function () {\n return this.eddsa.encodeInt(this.S());\n });\n Signature.prototype.toBytes = function () {\n return this.Rencoded().concat(this.Sencoded());\n };\n Signature.prototype.toHex = function () {\n return utils.encode(this.toBytes(), \"hex\").toUpperCase();\n };\n module.exports = Signature;\n },\n});\n\n// node_modules/elliptic/lib/elliptic/eddsa/index.js\nvar require_eddsa = __commonJS({\n \"node_modules/elliptic/lib/elliptic/eddsa/index.js\"(exports, module) {\n \"use strict\";\n var hash = require_hash2(),\n curves = require_curves(),\n utils = require_utils3(),\n assert = utils.assert,\n parseBytes = utils.parseBytes,\n KeyPair = require_key2(),\n Signature = require_signature2();\n function EDDSA(curve) {\n if ((assert(curve === \"ed25519\", \"only tested with ed25519 so far\"), !(this instanceof EDDSA)))\n return new EDDSA(curve);\n (curve = curves[curve].curve),\n (this.curve = curve),\n (this.g = curve.g),\n this.g.precompute(curve.n.bitLength() + 1),\n (this.pointClass = curve.point().constructor),\n (this.encodingLength = Math.ceil(curve.n.bitLength() / 8)),\n (this.hash = hash.sha512);\n }\n module.exports = EDDSA;\n EDDSA.prototype.sign = function (message, secret) {\n message = parseBytes(message);\n var key = this.keyFromSecret(secret),\n r = this.hashInt(key.messagePrefix(), message),\n R = this.g.mul(r),\n Rencoded = this.encodePoint(R),\n s_ = this.hashInt(Rencoded, key.pubBytes(), message).mul(key.priv()),\n S = r.add(s_).umod(this.curve.n);\n return this.makeSignature({ R, S, Rencoded });\n };\n EDDSA.prototype.verify = function (message, sig, pub) {\n (message = parseBytes(message)), (sig = this.makeSignature(sig));\n var key = this.keyFromPublic(pub),\n h = this.hashInt(sig.Rencoded(), key.pubBytes(), message),\n SG = this.g.mul(sig.S()),\n RplusAh = sig.R().add(key.pub().mul(h));\n return RplusAh.eq(SG);\n };\n EDDSA.prototype.hashInt = function () {\n for (var hash2 = this.hash(), i = 0; i < arguments.length; i++) hash2.update(arguments[i]);\n return utils.intFromLE(hash2.digest()).umod(this.curve.n);\n };\n EDDSA.prototype.keyFromPublic = function (pub) {\n return KeyPair.fromPublic(this, pub);\n };\n EDDSA.prototype.keyFromSecret = function (secret) {\n return KeyPair.fromSecret(this, secret);\n };\n EDDSA.prototype.makeSignature = function (sig) {\n return sig instanceof Signature ? sig : new Signature(this, sig);\n };\n EDDSA.prototype.encodePoint = function (point) {\n var enc = point.getY().toArray(\"le\", this.encodingLength);\n return (enc[this.encodingLength - 1] |= point.getX().isOdd() ? 128 : 0), enc;\n };\n EDDSA.prototype.decodePoint = function (bytes) {\n bytes = utils.parseBytes(bytes);\n var lastIx = bytes.length - 1,\n normed = bytes.slice(0, lastIx).concat(bytes[lastIx] & -129),\n xIsOdd = (bytes[lastIx] & 128) !== 0,\n y = utils.intFromLE(normed);\n return this.curve.pointFromY(y, xIsOdd);\n };\n EDDSA.prototype.encodeInt = function (num) {\n return num.toArray(\"le\", this.encodingLength);\n };\n EDDSA.prototype.decodeInt = function (bytes) {\n return utils.intFromLE(bytes);\n };\n EDDSA.prototype.isPoint = function (val) {\n return val instanceof this.pointClass;\n };\n },\n});\n\n// node_modules/elliptic/lib/elliptic.js\nvar require_elliptic = __commonJS({\n \"node_modules/elliptic/lib/elliptic.js\"(exports) {\n \"use strict\";\n var elliptic = exports;\n elliptic.version = require_package().version;\n elliptic.utils = require_utils3();\n elliptic.rand = require_brorand();\n elliptic.curve = require_curve();\n elliptic.curves = require_curves();\n elliptic.ec = require_ec();\n elliptic.eddsa = require_eddsa();\n },\n});\n\n// node_modules/asn1.js/node_modules/bn.js/lib/bn.js\nvar require_bn5 = __commonJS({\n \"node_modules/asn1.js/node_modules/bn.js/lib/bn.js\"(exports, module) {\n (function (module2, exports2) {\n \"use strict\";\n function assert(val, msg) {\n if (!val) throw new Error(msg || \"Assertion failed\");\n }\n function inherits(ctor, superCtor) {\n ctor.super_ = superCtor;\n var TempCtor = function () {};\n (TempCtor.prototype = superCtor.prototype),\n (ctor.prototype = new TempCtor()),\n (ctor.prototype.constructor = ctor);\n }\n function BN(number, base, endian) {\n if (BN.isBN(number)) return number;\n (this.negative = 0),\n (this.words = null),\n (this.length = 0),\n (this.red = null),\n number !== null &&\n ((base === \"le\" || base === \"be\") && ((endian = base), (base = 10)),\n this._init(number || 0, base || 10, endian || \"be\"));\n }\n typeof module2 == \"object\" ? (module2.exports = BN) : (exports2.BN = BN), (BN.BN = BN), (BN.wordSize = 26);\n var Buffer2;\n try {\n typeof window < \"u\" && typeof window.Buffer < \"u\"\n ? (Buffer2 = window.Buffer)\n : (Buffer2 = __require(\"buffer\").Buffer);\n } catch {}\n (BN.isBN = function (num) {\n return num instanceof BN\n ? !0\n : num !== null &&\n typeof num == \"object\" &&\n num.constructor.wordSize === BN.wordSize &&\n Array.isArray(num.words);\n }),\n (BN.max = function (left, right) {\n return left.cmp(right) > 0 ? left : right;\n }),\n (BN.min = function (left, right) {\n return left.cmp(right) < 0 ? left : right;\n }),\n (BN.prototype._init = function (number, base, endian) {\n if (typeof number == \"number\") return this._initNumber(number, base, endian);\n if (typeof number == \"object\") return this._initArray(number, base, endian);\n base === \"hex\" && (base = 16),\n assert(base === (base | 0) && base >= 2 && base <= 36),\n (number = number.toString().replace(/\\s+/g, \"\"));\n var start = 0;\n number[0] === \"-\" && (start++, (this.negative = 1)),\n start < number.length &&\n (base === 16\n ? this._parseHex(number, start, endian)\n : (this._parseBase(number, base, start),\n endian === \"le\" && this._initArray(this.toArray(), base, endian)));\n }),\n (BN.prototype._initNumber = function (number, base, endian) {\n number < 0 && ((this.negative = 1), (number = -number)),\n number < 67108864\n ? ((this.words = [number & 67108863]), (this.length = 1))\n : number < 4503599627370496\n ? ((this.words = [number & 67108863, (number / 67108864) & 67108863]), (this.length = 2))\n : (assert(number < 9007199254740992),\n (this.words = [number & 67108863, (number / 67108864) & 67108863, 1]),\n (this.length = 3)),\n endian === \"le\" && this._initArray(this.toArray(), base, endian);\n }),\n (BN.prototype._initArray = function (number, base, endian) {\n if ((assert(typeof number.length == \"number\"), number.length <= 0))\n return (this.words = [0]), (this.length = 1), this;\n (this.length = Math.ceil(number.length / 3)), (this.words = new Array(this.length));\n for (var i = 0; i < this.length; i++) this.words[i] = 0;\n var j,\n w,\n off = 0;\n if (endian === \"be\")\n for (i = number.length - 1, j = 0; i >= 0; i -= 3)\n (w = number[i] | (number[i - 1] << 8) | (number[i - 2] << 16)),\n (this.words[j] |= (w << off) & 67108863),\n (this.words[j + 1] = (w >>> (26 - off)) & 67108863),\n (off += 24),\n off >= 26 && ((off -= 26), j++);\n else if (endian === \"le\")\n for (i = 0, j = 0; i < number.length; i += 3)\n (w = number[i] | (number[i + 1] << 8) | (number[i + 2] << 16)),\n (this.words[j] |= (w << off) & 67108863),\n (this.words[j + 1] = (w >>> (26 - off)) & 67108863),\n (off += 24),\n off >= 26 && ((off -= 26), j++);\n return this.strip();\n });\n function parseHex4Bits(string, index) {\n var c = string.charCodeAt(index);\n return c >= 65 && c <= 70 ? c - 55 : c >= 97 && c <= 102 ? c - 87 : (c - 48) & 15;\n }\n function parseHexByte(string, lowerBound, index) {\n var r = parseHex4Bits(string, index);\n return index - 1 >= lowerBound && (r |= parseHex4Bits(string, index - 1) << 4), r;\n }\n BN.prototype._parseHex = function (number, start, endian) {\n (this.length = Math.ceil((number.length - start) / 6)), (this.words = new Array(this.length));\n for (var i = 0; i < this.length; i++) this.words[i] = 0;\n var off = 0,\n j = 0,\n w;\n if (endian === \"be\")\n for (i = number.length - 1; i >= start; i -= 2)\n (w = parseHexByte(number, start, i) << off),\n (this.words[j] |= w & 67108863),\n off >= 18 ? ((off -= 18), (j += 1), (this.words[j] |= w >>> 26)) : (off += 8);\n else {\n var parseLength = number.length - start;\n for (i = parseLength % 2 === 0 ? start + 1 : start; i < number.length; i += 2)\n (w = parseHexByte(number, start, i) << off),\n (this.words[j] |= w & 67108863),\n off >= 18 ? ((off -= 18), (j += 1), (this.words[j] |= w >>> 26)) : (off += 8);\n }\n this.strip();\n };\n function parseBase(str, start, end, mul) {\n for (var r = 0, len = Math.min(str.length, end), i = start; i < len; i++) {\n var c = str.charCodeAt(i) - 48;\n (r *= mul), c >= 49 ? (r += c - 49 + 10) : c >= 17 ? (r += c - 17 + 10) : (r += c);\n }\n return r;\n }\n (BN.prototype._parseBase = function (number, base, start) {\n (this.words = [0]), (this.length = 1);\n for (var limbLen = 0, limbPow = 1; limbPow <= 67108863; limbPow *= base) limbLen++;\n limbLen--, (limbPow = (limbPow / base) | 0);\n for (\n var total = number.length - start,\n mod = total % limbLen,\n end = Math.min(total, total - mod) + start,\n word = 0,\n i = start;\n i < end;\n i += limbLen\n )\n (word = parseBase(number, i, i + limbLen, base)),\n this.imuln(limbPow),\n this.words[0] + word < 67108864 ? (this.words[0] += word) : this._iaddn(word);\n if (mod !== 0) {\n var pow = 1;\n for (word = parseBase(number, i, number.length, base), i = 0; i < mod; i++) pow *= base;\n this.imuln(pow), this.words[0] + word < 67108864 ? (this.words[0] += word) : this._iaddn(word);\n }\n this.strip();\n }),\n (BN.prototype.copy = function (dest) {\n dest.words = new Array(this.length);\n for (var i = 0; i < this.length; i++) dest.words[i] = this.words[i];\n (dest.length = this.length), (dest.negative = this.negative), (dest.red = this.red);\n }),\n (BN.prototype.clone = function () {\n var r = new BN(null);\n return this.copy(r), r;\n }),\n (BN.prototype._expand = function (size) {\n for (; this.length < size; ) this.words[this.length++] = 0;\n return this;\n }),\n (BN.prototype.strip = function () {\n for (; this.length > 1 && this.words[this.length - 1] === 0; ) this.length--;\n return this._normSign();\n }),\n (BN.prototype._normSign = function () {\n return this.length === 1 && this.words[0] === 0 && (this.negative = 0), this;\n }),\n (BN.prototype.inspect = function () {\n return (this.red ? \"<BN-R: \" : \"<BN: \") + this.toString(16) + \">\";\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 groupSizes = [\n 0, 0, 25, 16, 12, 11, 10, 9, 8, 8, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5,\n 5, 5,\n ],\n groupBases = [\n 0, 0, 33554432, 43046721, 16777216, 48828125, 60466176, 40353607, 16777216, 43046721, 1e7, 19487171, 35831808,\n 62748517, 7529536, 11390625, 16777216, 24137569, 34012224, 47045881, 64e6, 4084101, 5153632, 6436343, 7962624,\n 9765625, 11881376, 14348907, 17210368, 20511149, 243e5, 28629151, 33554432, 39135393, 45435424, 52521875,\n 60466176,\n ];\n (BN.prototype.toString = function (base, padding) {\n (base = base || 10), (padding = padding | 0 || 1);\n var out;\n if (base === 16 || base === \"hex\") {\n out = \"\";\n for (var off = 0, carry = 0, i = 0; i < this.length; i++) {\n var w = this.words[i],\n word = (((w << off) | carry) & 16777215).toString(16);\n (carry = (w >>> (24 - off)) & 16777215),\n carry !== 0 || i !== this.length - 1 ? (out = zeros[6 - word.length] + word + out) : (out = word + out),\n (off += 2),\n off >= 26 && ((off -= 26), i--);\n }\n for (carry !== 0 && (out = carry.toString(16) + out); out.length % padding !== 0; ) out = \"0\" + out;\n return this.negative !== 0 && (out = \"-\" + out), out;\n }\n if (base === (base | 0) && base >= 2 && base <= 36) {\n var groupSize = groupSizes[base],\n groupBase = groupBases[base];\n out = \"\";\n var c = this.clone();\n for (c.negative = 0; !c.isZero(); ) {\n var r = c.modn(groupBase).toString(base);\n (c = c.idivn(groupBase)), c.isZero() ? (out = r + out) : (out = zeros[groupSize - r.length] + r + out);\n }\n for (this.isZero() && (out = \"0\" + out); out.length % padding !== 0; ) out = \"0\" + out;\n return this.negative !== 0 && (out = \"-\" + out), out;\n }\n assert(!1, \"Base should be between 2 and 36\");\n }),\n (BN.prototype.toNumber = function () {\n var ret = this.words[0];\n return (\n this.length === 2\n ? (ret += this.words[1] * 67108864)\n : this.length === 3 && this.words[2] === 1\n ? (ret += 4503599627370496 + this.words[1] * 67108864)\n : this.length > 2 && assert(!1, \"Number can only safely store up to 53 bits\"),\n this.negative !== 0 ? -ret : ret\n );\n }),\n (BN.prototype.toJSON = function () {\n return this.toString(16);\n }),\n (BN.prototype.toBuffer = function (endian, length) {\n return assert(typeof Buffer2 < \"u\"), this.toArrayLike(Buffer2, endian, length);\n }),\n (BN.prototype.toArray = function (endian, length) {\n return this.toArrayLike(Array, endian, length);\n }),\n (BN.prototype.toArrayLike = function (ArrayType, endian, length) {\n var byteLength = this.byteLength(),\n 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 this.strip();\n var littleEndian = endian === \"le\",\n res = new ArrayType(reqLength),\n b,\n i,\n q = this.clone();\n if (littleEndian) {\n for (i = 0; !q.isZero(); i++) (b = q.andln(255)), q.iushrn(8), (res[i] = b);\n for (; i < reqLength; i++) res[i] = 0;\n } else {\n for (i = 0; i < reqLength - byteLength; i++) res[i] = 0;\n for (i = 0; !q.isZero(); i++) (b = q.andln(255)), q.iushrn(8), (res[reqLength - i - 1] = b);\n }\n return res;\n }),\n Math.clz32\n ? (BN.prototype._countBits = function (w) {\n return 32 - Math.clz32(w);\n })\n : (BN.prototype._countBits = function (w) {\n var t = w,\n r = 0;\n return (\n t >= 4096 && ((r += 13), (t >>>= 13)),\n t >= 64 && ((r += 7), (t >>>= 7)),\n t >= 8 && ((r += 4), (t >>>= 4)),\n t >= 2 && ((r += 2), (t >>>= 2)),\n r + t\n );\n }),\n (BN.prototype._zeroBits = function (w) {\n if (w === 0) return 26;\n var t = w,\n r = 0;\n return (\n (t & 8191) === 0 && ((r += 13), (t >>>= 13)),\n (t & 127) === 0 && ((r += 7), (t >>>= 7)),\n (t & 15) === 0 && ((r += 4), (t >>>= 4)),\n (t & 3) === 0 && ((r += 2), (t >>>= 2)),\n (t & 1) === 0 && r++,\n r\n );\n }),\n (BN.prototype.bitLength = function () {\n var w = this.words[this.length - 1],\n hi = this._countBits(w);\n return (this.length - 1) * 26 + hi;\n });\n function toBitArray(num) {\n for (var w = new Array(num.bitLength()), bit = 0; bit < w.length; bit++) {\n var off = (bit / 26) | 0,\n wbit = bit % 26;\n w[bit] = (num.words[off] & (1 << wbit)) >>> wbit;\n }\n return w;\n }\n (BN.prototype.zeroBits = function () {\n if (this.isZero()) return 0;\n for (var r = 0, i = 0; i < this.length; i++) {\n var b = this._zeroBits(this.words[i]);\n if (((r += b), b !== 26)) break;\n }\n return r;\n }),\n (BN.prototype.byteLength = function () {\n return Math.ceil(this.bitLength() / 8);\n }),\n (BN.prototype.toTwos = function (width) {\n return this.negative !== 0 ? this.abs().inotn(width).iaddn(1) : this.clone();\n }),\n (BN.prototype.fromTwos = function (width) {\n return this.testn(width - 1) ? this.notn(width).iaddn(1).ineg() : this.clone();\n }),\n (BN.prototype.isNeg = function () {\n return this.negative !== 0;\n }),\n (BN.prototype.neg = function () {\n return this.clone().ineg();\n }),\n (BN.prototype.ineg = function () {\n return this.isZero() || (this.negative ^= 1), this;\n }),\n (BN.prototype.iuor = function (num) {\n for (; this.length < num.length; ) this.words[this.length++] = 0;\n for (var i = 0; i < num.length; i++) this.words[i] = this.words[i] | num.words[i];\n return this.strip();\n }),\n (BN.prototype.ior = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuor(num);\n }),\n (BN.prototype.or = function (num) {\n return this.length > num.length ? this.clone().ior(num) : num.clone().ior(this);\n }),\n (BN.prototype.uor = function (num) {\n return this.length > num.length ? this.clone().iuor(num) : num.clone().iuor(this);\n }),\n (BN.prototype.iuand = function (num) {\n var b;\n this.length > num.length ? (b = num) : (b = this);\n for (var i = 0; i < b.length; i++) this.words[i] = this.words[i] & num.words[i];\n return (this.length = b.length), this.strip();\n }),\n (BN.prototype.iand = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuand(num);\n }),\n (BN.prototype.and = function (num) {\n return this.length > num.length ? this.clone().iand(num) : num.clone().iand(this);\n }),\n (BN.prototype.uand = function (num) {\n return this.length > num.length ? this.clone().iuand(num) : num.clone().iuand(this);\n }),\n (BN.prototype.iuxor = function (num) {\n var a, b;\n this.length > num.length ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var i = 0; i < b.length; i++) this.words[i] = a.words[i] ^ b.words[i];\n if (this !== a) for (; i < a.length; i++) this.words[i] = a.words[i];\n return (this.length = a.length), this.strip();\n }),\n (BN.prototype.ixor = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuxor(num);\n }),\n (BN.prototype.xor = function (num) {\n return this.length > num.length ? this.clone().ixor(num) : num.clone().ixor(this);\n }),\n (BN.prototype.uxor = function (num) {\n return this.length > num.length ? this.clone().iuxor(num) : num.clone().iuxor(this);\n }),\n (BN.prototype.inotn = function (width) {\n assert(typeof width == \"number\" && width >= 0);\n var bytesNeeded = Math.ceil(width / 26) | 0,\n bitsLeft = width % 26;\n this._expand(bytesNeeded), bitsLeft > 0 && bytesNeeded--;\n for (var i = 0; i < bytesNeeded; i++) this.words[i] = ~this.words[i] & 67108863;\n return bitsLeft > 0 && (this.words[i] = ~this.words[i] & (67108863 >> (26 - bitsLeft))), this.strip();\n }),\n (BN.prototype.notn = function (width) {\n return this.clone().inotn(width);\n }),\n (BN.prototype.setn = function (bit, val) {\n assert(typeof bit == \"number\" && bit >= 0);\n var off = (bit / 26) | 0,\n wbit = bit % 26;\n return (\n this._expand(off + 1),\n val\n ? (this.words[off] = this.words[off] | (1 << wbit))\n : (this.words[off] = this.words[off] & ~(1 << wbit)),\n this.strip()\n );\n }),\n (BN.prototype.iadd = function (num) {\n var r;\n if (this.negative !== 0 && num.negative === 0)\n return (this.negative = 0), (r = this.isub(num)), (this.negative ^= 1), this._normSign();\n if (this.negative === 0 && num.negative !== 0)\n return (num.negative = 0), (r = this.isub(num)), (num.negative = 1), r._normSign();\n var a, b;\n this.length > num.length ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var carry = 0, i = 0; i < b.length; i++)\n (r = (a.words[i] | 0) + (b.words[i] | 0) + carry), (this.words[i] = r & 67108863), (carry = r >>> 26);\n for (; carry !== 0 && i < a.length; i++)\n (r = (a.words[i] | 0) + carry), (this.words[i] = r & 67108863), (carry = r >>> 26);\n if (((this.length = a.length), carry !== 0)) (this.words[this.length] = carry), this.length++;\n else if (a !== this) for (; i < a.length; i++) this.words[i] = a.words[i];\n return this;\n }),\n (BN.prototype.add = function (num) {\n var res;\n return num.negative !== 0 && this.negative === 0\n ? ((num.negative = 0), (res = this.sub(num)), (num.negative ^= 1), res)\n : num.negative === 0 && this.negative !== 0\n ? ((this.negative = 0), (res = num.sub(this)), (this.negative = 1), res)\n : this.length > num.length\n ? this.clone().iadd(num)\n : num.clone().iadd(this);\n }),\n (BN.prototype.isub = function (num) {\n if (num.negative !== 0) {\n num.negative = 0;\n var r = this.iadd(num);\n return (num.negative = 1), r._normSign();\n } else if (this.negative !== 0)\n return (this.negative = 0), this.iadd(num), (this.negative = 1), this._normSign();\n var cmp = this.cmp(num);\n if (cmp === 0) return (this.negative = 0), (this.length = 1), (this.words[0] = 0), this;\n var a, b;\n cmp > 0 ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var carry = 0, i = 0; i < b.length; i++)\n (r = (a.words[i] | 0) - (b.words[i] | 0) + carry), (carry = r >> 26), (this.words[i] = r & 67108863);\n for (; carry !== 0 && i < a.length; i++)\n (r = (a.words[i] | 0) + carry), (carry = r >> 26), (this.words[i] = r & 67108863);\n if (carry === 0 && i < a.length && a !== this) for (; i < a.length; i++) this.words[i] = a.words[i];\n return (this.length = Math.max(this.length, i)), a !== this && (this.negative = 1), this.strip();\n }),\n (BN.prototype.sub = function (num) {\n return this.clone().isub(num);\n });\n function smallMulTo(self2, num, out) {\n out.negative = num.negative ^ self2.negative;\n var len = (self2.length + num.length) | 0;\n (out.length = len), (len = (len - 1) | 0);\n var a = self2.words[0] | 0,\n b = num.words[0] | 0,\n r = a * b,\n lo = r & 67108863,\n carry = (r / 67108864) | 0;\n out.words[0] = lo;\n for (var k = 1; k < len; k++) {\n for (\n var ncarry = carry >>> 26,\n rword = carry & 67108863,\n maxJ = Math.min(k, num.length - 1),\n j = Math.max(0, k - self2.length + 1);\n j <= maxJ;\n j++\n ) {\n var i = (k - j) | 0;\n (a = self2.words[i] | 0),\n (b = num.words[j] | 0),\n (r = a * b + rword),\n (ncarry += (r / 67108864) | 0),\n (rword = r & 67108863);\n }\n (out.words[k] = rword | 0), (carry = ncarry | 0);\n }\n return carry !== 0 ? (out.words[k] = carry | 0) : out.length--, out.strip();\n }\n var comb10MulTo = function (self2, num, out) {\n var a = self2.words,\n b = num.words,\n o = out.words,\n c = 0,\n lo,\n mid,\n hi,\n a0 = a[0] | 0,\n al0 = a0 & 8191,\n ah0 = a0 >>> 13,\n a1 = a[1] | 0,\n al1 = a1 & 8191,\n ah1 = a1 >>> 13,\n a2 = a[2] | 0,\n al2 = a2 & 8191,\n ah2 = a2 >>> 13,\n a3 = a[3] | 0,\n al3 = a3 & 8191,\n ah3 = a3 >>> 13,\n a4 = a[4] | 0,\n al4 = a4 & 8191,\n ah4 = a4 >>> 13,\n a5 = a[5] | 0,\n al5 = a5 & 8191,\n ah5 = a5 >>> 13,\n a6 = a[6] | 0,\n al6 = a6 & 8191,\n ah6 = a6 >>> 13,\n a7 = a[7] | 0,\n al7 = a7 & 8191,\n ah7 = a7 >>> 13,\n a8 = a[8] | 0,\n al8 = a8 & 8191,\n ah8 = a8 >>> 13,\n a9 = a[9] | 0,\n al9 = a9 & 8191,\n ah9 = a9 >>> 13,\n b0 = b[0] | 0,\n bl0 = b0 & 8191,\n bh0 = b0 >>> 13,\n b1 = b[1] | 0,\n bl1 = b1 & 8191,\n bh1 = b1 >>> 13,\n b2 = b[2] | 0,\n bl2 = b2 & 8191,\n bh2 = b2 >>> 13,\n b3 = b[3] | 0,\n bl3 = b3 & 8191,\n bh3 = b3 >>> 13,\n b4 = b[4] | 0,\n bl4 = b4 & 8191,\n bh4 = b4 >>> 13,\n b5 = b[5] | 0,\n bl5 = b5 & 8191,\n bh5 = b5 >>> 13,\n b6 = b[6] | 0,\n bl6 = b6 & 8191,\n bh6 = b6 >>> 13,\n b7 = b[7] | 0,\n bl7 = b7 & 8191,\n bh7 = b7 >>> 13,\n b8 = b[8] | 0,\n bl8 = b8 & 8191,\n bh8 = b8 >>> 13,\n b9 = b[9] | 0,\n bl9 = b9 & 8191,\n bh9 = b9 >>> 13;\n (out.negative = self2.negative ^ num.negative),\n (out.length = 19),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w0 >>> 26)) | 0),\n (w0 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w1 >>> 26)) | 0),\n (w1 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w2 >>> 26)) | 0),\n (w2 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w3 >>> 26)) | 0),\n (w3 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w4 >>> 26)) | 0),\n (w4 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w5 >>> 26)) | 0),\n (w5 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w6 >>> 26)) | 0),\n (w6 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w7 >>> 26)) | 0),\n (w7 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w8 >>> 26)) | 0),\n (w8 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w9 >>> 26)) | 0),\n (w9 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w10 >>> 26)) | 0),\n (w10 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w11 >>> 26)) | 0),\n (w11 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w12 >>> 26)) | 0),\n (w12 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w13 >>> 26)) | 0),\n (w13 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w14 >>> 26)) | 0),\n (w14 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w15 >>> 26)) | 0),\n (w15 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w16 >>> 26)) | 0),\n (w16 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w17 >>> 26)) | 0),\n (w17 &= 67108863),\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 & 8191) << 13)) | 0;\n return (\n (c = (((hi + (mid >>> 13)) | 0) + (w18 >>> 26)) | 0),\n (w18 &= 67108863),\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 c !== 0 && ((o[19] = c), out.length++),\n out\n );\n };\n Math.imul || (comb10MulTo = smallMulTo);\n function bigMulTo(self2, num, out) {\n (out.negative = num.negative ^ self2.negative), (out.length = self2.length + num.length);\n for (var carry = 0, hncarry = 0, k = 0; k < out.length - 1; k++) {\n var ncarry = hncarry;\n hncarry = 0;\n for (\n var rword = carry & 67108863, maxJ = Math.min(k, num.length - 1), j = Math.max(0, k - self2.length + 1);\n j <= maxJ;\n j++\n ) {\n var i = k - j,\n a = self2.words[i] | 0,\n b = num.words[j] | 0,\n r = a * b,\n lo = r & 67108863;\n (ncarry = (ncarry + ((r / 67108864) | 0)) | 0),\n (lo = (lo + rword) | 0),\n (rword = lo & 67108863),\n (ncarry = (ncarry + (lo >>> 26)) | 0),\n (hncarry += ncarry >>> 26),\n (ncarry &= 67108863);\n }\n (out.words[k] = rword), (carry = ncarry), (ncarry = hncarry);\n }\n return carry !== 0 ? (out.words[k] = carry) : out.length--, out.strip();\n }\n function jumboMulTo(self2, num, out) {\n var fftm = new FFTM();\n return fftm.mulp(self2, num, out);\n }\n BN.prototype.mulTo = function (num, out) {\n var res,\n len = this.length + num.length;\n return (\n this.length === 10 && num.length === 10\n ? (res = comb10MulTo(this, num, out))\n : len < 63\n ? (res = smallMulTo(this, num, out))\n : len < 1024\n ? (res = bigMulTo(this, num, out))\n : (res = jumboMulTo(this, num, out)),\n res\n );\n };\n function FFTM(x, y) {\n (this.x = x), (this.y = y);\n }\n (FFTM.prototype.makeRBT = function (N) {\n for (var t = new Array(N), l = BN.prototype._countBits(N) - 1, i = 0; i < N; i++) t[i] = this.revBin(i, l, N);\n return t;\n }),\n (FFTM.prototype.revBin = function (x, l, N) {\n if (x === 0 || x === N - 1) return x;\n for (var rb = 0, i = 0; i < l; i++) (rb |= (x & 1) << (l - i - 1)), (x >>= 1);\n return rb;\n }),\n (FFTM.prototype.permute = function (rbt, rws, iws, rtws, itws, N) {\n for (var i = 0; i < N; i++) (rtws[i] = rws[rbt[i]]), (itws[i] = iws[rbt[i]]);\n }),\n (FFTM.prototype.transform = function (rws, iws, rtws, itws, N, rbt) {\n this.permute(rbt, rws, iws, rtws, itws, N);\n for (var s = 1; s < N; s <<= 1)\n for (\n var l = s << 1, rtwdf = Math.cos((2 * Math.PI) / l), itwdf = Math.sin((2 * Math.PI) / l), p = 0;\n p < N;\n p += l\n )\n for (var rtwdf_ = rtwdf, itwdf_ = itwdf, j = 0; j < s; j++) {\n var re = rtws[p + j],\n ie = itws[p + j],\n ro = rtws[p + j + s],\n io = itws[p + j + s],\n rx = rtwdf_ * ro - itwdf_ * io;\n (io = rtwdf_ * io + itwdf_ * ro),\n (ro = rx),\n (rtws[p + j] = re + ro),\n (itws[p + j] = ie + io),\n (rtws[p + j + s] = re - ro),\n (itws[p + j + s] = ie - io),\n j !== l &&\n ((rx = rtwdf * rtwdf_ - itwdf * itwdf_), (itwdf_ = rtwdf * itwdf_ + itwdf * rtwdf_), (rtwdf_ = rx));\n }\n }),\n (FFTM.prototype.guessLen13b = function (n, m) {\n var N = Math.max(m, n) | 1,\n odd = N & 1,\n i = 0;\n for (N = (N / 2) | 0; N; N = N >>> 1) i++;\n return 1 << (i + 1 + odd);\n }),\n (FFTM.prototype.conjugate = function (rws, iws, N) {\n if (!(N <= 1))\n for (var i = 0; i < N / 2; i++) {\n var t = rws[i];\n (rws[i] = rws[N - i - 1]),\n (rws[N - i - 1] = t),\n (t = iws[i]),\n (iws[i] = -iws[N - i - 1]),\n (iws[N - i - 1] = -t);\n }\n }),\n (FFTM.prototype.normalize13b = function (ws, N) {\n for (var carry = 0, i = 0; i < N / 2; i++) {\n var w = Math.round(ws[2 * i + 1] / N) * 8192 + Math.round(ws[2 * i] / N) + carry;\n (ws[i] = w & 67108863), w < 67108864 ? (carry = 0) : (carry = (w / 67108864) | 0);\n }\n return ws;\n }),\n (FFTM.prototype.convert13b = function (ws, len, rws, N) {\n for (var carry = 0, i = 0; i < len; i++)\n (carry = carry + (ws[i] | 0)),\n (rws[2 * i] = carry & 8191),\n (carry = carry >>> 13),\n (rws[2 * i + 1] = carry & 8191),\n (carry = carry >>> 13);\n for (i = 2 * len; i < N; ++i) rws[i] = 0;\n assert(carry === 0), assert((carry & -8192) === 0);\n }),\n (FFTM.prototype.stub = function (N) {\n for (var ph = new Array(N), i = 0; i < N; i++) ph[i] = 0;\n return ph;\n }),\n (FFTM.prototype.mulp = function (x, y, out) {\n var N = 2 * this.guessLen13b(x.length, y.length),\n rbt = this.makeRBT(N),\n _ = this.stub(N),\n rws = new Array(N),\n rwst = new Array(N),\n iwst = new Array(N),\n nrws = new Array(N),\n nrwst = new Array(N),\n niwst = new Array(N),\n rmws = out.words;\n (rmws.length = N),\n this.convert13b(x.words, x.length, rws, N),\n this.convert13b(y.words, y.length, nrws, N),\n this.transform(rws, _, rwst, iwst, N, rbt),\n this.transform(nrws, _, nrwst, niwst, N, rbt);\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]), (rwst[i] = rx);\n }\n return (\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 (out.negative = x.negative ^ y.negative),\n (out.length = x.length + y.length),\n out.strip()\n );\n }),\n (BN.prototype.mul = function (num) {\n var out = new BN(null);\n return (out.words = new Array(this.length + num.length)), this.mulTo(num, out);\n }),\n (BN.prototype.mulf = function (num) {\n var out = new BN(null);\n return (out.words = new Array(this.length + num.length)), jumboMulTo(this, num, out);\n }),\n (BN.prototype.imul = function (num) {\n return this.clone().mulTo(num, this);\n }),\n (BN.prototype.imuln = function (num) {\n assert(typeof num == \"number\"), assert(num < 67108864);\n for (var carry = 0, i = 0; i < this.length; i++) {\n var w = (this.words[i] | 0) * num,\n lo = (w & 67108863) + (carry & 67108863);\n (carry >>= 26), (carry += (w / 67108864) | 0), (carry += lo >>> 26), (this.words[i] = lo & 67108863);\n }\n return carry !== 0 && ((this.words[i] = carry), this.length++), this;\n }),\n (BN.prototype.muln = function (num) {\n return this.clone().imuln(num);\n }),\n (BN.prototype.sqr = function () {\n return this.mul(this);\n }),\n (BN.prototype.isqr = function () {\n return this.imul(this.clone());\n }),\n (BN.prototype.pow = function (num) {\n var w = toBitArray(num);\n if (w.length === 0) return new BN(1);\n for (var res = this, i = 0; i < w.length && w[i] === 0; i++, res = res.sqr());\n if (++i < w.length) for (var q = res.sqr(); i < w.length; i++, q = q.sqr()) w[i] !== 0 && (res = res.mul(q));\n return res;\n }),\n (BN.prototype.iushln = function (bits) {\n assert(typeof bits == \"number\" && bits >= 0);\n var r = bits % 26,\n s = (bits - r) / 26,\n carryMask = (67108863 >>> (26 - r)) << (26 - r),\n i;\n if (r !== 0) {\n var carry = 0;\n for (i = 0; i < this.length; i++) {\n var newCarry = this.words[i] & carryMask,\n c = ((this.words[i] | 0) - newCarry) << r;\n (this.words[i] = c | carry), (carry = newCarry >>> (26 - r));\n }\n carry && ((this.words[i] = carry), this.length++);\n }\n if (s !== 0) {\n for (i = this.length - 1; i >= 0; i--) this.words[i + s] = this.words[i];\n for (i = 0; i < s; i++) this.words[i] = 0;\n this.length += s;\n }\n return this.strip();\n }),\n (BN.prototype.ishln = function (bits) {\n return assert(this.negative === 0), this.iushln(bits);\n }),\n (BN.prototype.iushrn = function (bits, hint, extended) {\n assert(typeof bits == \"number\" && bits >= 0);\n var h;\n hint ? (h = (hint - (hint % 26)) / 26) : (h = 0);\n var r = bits % 26,\n s = Math.min((bits - r) / 26, this.length),\n mask = 67108863 ^ ((67108863 >>> r) << r),\n maskedWords = extended;\n if (((h -= s), (h = Math.max(0, h)), maskedWords)) {\n for (var i = 0; i < s; i++) maskedWords.words[i] = this.words[i];\n maskedWords.length = s;\n }\n if (s !== 0)\n if (this.length > s) for (this.length -= s, i = 0; i < this.length; i++) this.words[i] = this.words[i + s];\n else (this.words[0] = 0), (this.length = 1);\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)), (carry = word & mask);\n }\n return (\n maskedWords && carry !== 0 && (maskedWords.words[maskedWords.length++] = carry),\n this.length === 0 && ((this.words[0] = 0), (this.length = 1)),\n this.strip()\n );\n }),\n (BN.prototype.ishrn = function (bits, hint, extended) {\n return assert(this.negative === 0), this.iushrn(bits, hint, extended);\n }),\n (BN.prototype.shln = function (bits) {\n return this.clone().ishln(bits);\n }),\n (BN.prototype.ushln = function (bits) {\n return this.clone().iushln(bits);\n }),\n (BN.prototype.shrn = function (bits) {\n return this.clone().ishrn(bits);\n }),\n (BN.prototype.ushrn = function (bits) {\n return this.clone().iushrn(bits);\n }),\n (BN.prototype.testn = function (bit) {\n assert(typeof bit == \"number\" && bit >= 0);\n var r = bit % 26,\n s = (bit - r) / 26,\n q = 1 << r;\n if (this.length <= s) return !1;\n var w = this.words[s];\n return !!(w & q);\n }),\n (BN.prototype.imaskn = function (bits) {\n assert(typeof bits == \"number\" && bits >= 0);\n var r = bits % 26,\n s = (bits - r) / 26;\n if ((assert(this.negative === 0, \"imaskn works only with positive numbers\"), this.length <= s)) return this;\n if ((r !== 0 && s++, (this.length = Math.min(s, this.length)), r !== 0)) {\n var mask = 67108863 ^ ((67108863 >>> r) << r);\n this.words[this.length - 1] &= mask;\n }\n return this.strip();\n }),\n (BN.prototype.maskn = function (bits) {\n return this.clone().imaskn(bits);\n }),\n (BN.prototype.iaddn = function (num) {\n return (\n assert(typeof num == \"number\"),\n assert(num < 67108864),\n num < 0\n ? this.isubn(-num)\n : this.negative !== 0\n ? this.length === 1 && (this.words[0] | 0) < num\n ? ((this.words[0] = num - (this.words[0] | 0)), (this.negative = 0), this)\n : ((this.negative = 0), this.isubn(num), (this.negative = 1), this)\n : this._iaddn(num)\n );\n }),\n (BN.prototype._iaddn = function (num) {\n this.words[0] += num;\n for (var i = 0; i < this.length && this.words[i] >= 67108864; i++)\n (this.words[i] -= 67108864), i === this.length - 1 ? (this.words[i + 1] = 1) : this.words[i + 1]++;\n return (this.length = Math.max(this.length, i + 1)), this;\n }),\n (BN.prototype.isubn = function (num) {\n if ((assert(typeof num == \"number\"), assert(num < 67108864), num < 0)) return this.iaddn(-num);\n if (this.negative !== 0) return (this.negative = 0), this.iaddn(num), (this.negative = 1), this;\n if (((this.words[0] -= num), this.length === 1 && this.words[0] < 0))\n (this.words[0] = -this.words[0]), (this.negative = 1);\n else\n for (var i = 0; i < this.length && this.words[i] < 0; i++)\n (this.words[i] += 67108864), (this.words[i + 1] -= 1);\n return this.strip();\n }),\n (BN.prototype.addn = function (num) {\n return this.clone().iaddn(num);\n }),\n (BN.prototype.subn = function (num) {\n return this.clone().isubn(num);\n }),\n (BN.prototype.iabs = function () {\n return (this.negative = 0), this;\n }),\n (BN.prototype.abs = function () {\n return this.clone().iabs();\n }),\n (BN.prototype._ishlnsubmul = function (num, mul, shift) {\n var len = num.length + shift,\n i;\n this._expand(len);\n var w,\n 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 & 67108863),\n (carry = (w >> 26) - ((right / 67108864) | 0)),\n (this.words[i + shift] = w & 67108863);\n }\n for (; i < this.length - shift; i++)\n (w = (this.words[i + shift] | 0) + carry), (carry = w >> 26), (this.words[i + shift] = w & 67108863);\n if (carry === 0) return this.strip();\n for (assert(carry === -1), carry = 0, i = 0; i < this.length; i++)\n (w = -(this.words[i] | 0) + carry), (carry = w >> 26), (this.words[i] = w & 67108863);\n return (this.negative = 1), this.strip();\n }),\n (BN.prototype._wordDiv = function (num, mode) {\n var shift = this.length - num.length,\n a = this.clone(),\n b = num,\n bhi = b.words[b.length - 1] | 0,\n bhiBits = this._countBits(bhi);\n (shift = 26 - bhiBits),\n shift !== 0 && ((b = b.ushln(shift)), a.iushln(shift), (bhi = b.words[b.length - 1] | 0));\n var m = a.length - b.length,\n q;\n if (mode !== \"mod\") {\n (q = new BN(null)), (q.length = m + 1), (q.words = new Array(q.length));\n for (var i = 0; i < q.length; i++) q.words[i] = 0;\n }\n var diff = a.clone()._ishlnsubmul(b, 1, m);\n diff.negative === 0 && ((a = diff), q && (q.words[m] = 1));\n for (var j = m - 1; j >= 0; j--) {\n var qj = (a.words[b.length + j] | 0) * 67108864 + (a.words[b.length + j - 1] | 0);\n for (qj = Math.min((qj / bhi) | 0, 67108863), a._ishlnsubmul(b, qj, j); a.negative !== 0; )\n qj--, (a.negative = 0), a._ishlnsubmul(b, 1, j), a.isZero() || (a.negative ^= 1);\n q && (q.words[j] = qj);\n }\n return (\n q && q.strip(),\n a.strip(),\n mode !== \"div\" && shift !== 0 && a.iushrn(shift),\n {\n div: q || null,\n mod: a,\n }\n );\n }),\n (BN.prototype.divmod = function (num, mode, positive) {\n if ((assert(!num.isZero()), this.isZero()))\n return {\n div: new BN(0),\n mod: new BN(0),\n };\n var div, mod, res;\n return this.negative !== 0 && num.negative === 0\n ? ((res = this.neg().divmod(num, mode)),\n mode !== \"mod\" && (div = res.div.neg()),\n mode !== \"div\" && ((mod = res.mod.neg()), positive && mod.negative !== 0 && mod.iadd(num)),\n {\n div,\n mod,\n })\n : this.negative === 0 && num.negative !== 0\n ? ((res = this.divmod(num.neg(), mode)),\n mode !== \"mod\" && (div = res.div.neg()),\n {\n div,\n mod: res.mod,\n })\n : (this.negative & num.negative) !== 0\n ? ((res = this.neg().divmod(num.neg(), mode)),\n mode !== \"div\" && ((mod = res.mod.neg()), positive && mod.negative !== 0 && mod.isub(num)),\n {\n div: res.div,\n mod,\n })\n : num.length > this.length || this.cmp(num) < 0\n ? {\n div: new BN(0),\n mod: this,\n }\n : num.length === 1\n ? mode === \"div\"\n ? {\n div: this.divn(num.words[0]),\n mod: null,\n }\n : mode === \"mod\"\n ? {\n div: null,\n mod: new BN(this.modn(num.words[0])),\n }\n : {\n div: this.divn(num.words[0]),\n mod: new BN(this.modn(num.words[0])),\n }\n : this._wordDiv(num, mode);\n }),\n (BN.prototype.div = function (num) {\n return this.divmod(num, \"div\", !1).div;\n }),\n (BN.prototype.mod = function (num) {\n return this.divmod(num, \"mod\", !1).mod;\n }),\n (BN.prototype.umod = function (num) {\n return this.divmod(num, \"mod\", !0).mod;\n }),\n (BN.prototype.divRound = function (num) {\n var dm = this.divmod(num);\n if (dm.mod.isZero()) return dm.div;\n var mod = dm.div.negative !== 0 ? dm.mod.isub(num) : dm.mod,\n half = num.ushrn(1),\n r2 = num.andln(1),\n cmp = mod.cmp(half);\n return cmp < 0 || (r2 === 1 && cmp === 0)\n ? dm.div\n : dm.div.negative !== 0\n ? dm.div.isubn(1)\n : dm.div.iaddn(1);\n }),\n (BN.prototype.modn = function (num) {\n assert(num <= 67108863);\n for (var p = (1 << 26) % num, acc = 0, i = this.length - 1; i >= 0; i--)\n acc = (p * acc + (this.words[i] | 0)) % num;\n return acc;\n }),\n (BN.prototype.idivn = function (num) {\n assert(num <= 67108863);\n for (var carry = 0, i = this.length - 1; i >= 0; i--) {\n var w = (this.words[i] | 0) + carry * 67108864;\n (this.words[i] = (w / num) | 0), (carry = w % num);\n }\n return this.strip();\n }),\n (BN.prototype.divn = function (num) {\n return this.clone().idivn(num);\n }),\n (BN.prototype.egcd = function (p) {\n assert(p.negative === 0), assert(!p.isZero());\n var x = this,\n y = p.clone();\n x.negative !== 0 ? (x = x.umod(p)) : (x = x.clone());\n for (var A = new BN(1), B = new BN(0), C = new BN(0), D = new BN(1), g = 0; x.isEven() && y.isEven(); )\n x.iushrn(1), y.iushrn(1), ++g;\n for (var yp = y.clone(), xp = x.clone(); !x.isZero(); ) {\n for (var i = 0, im = 1; (x.words[0] & im) === 0 && i < 26; ++i, im <<= 1);\n if (i > 0)\n for (x.iushrn(i); i-- > 0; )\n (A.isOdd() || B.isOdd()) && (A.iadd(yp), B.isub(xp)), A.iushrn(1), B.iushrn(1);\n for (var j = 0, jm = 1; (y.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n if (j > 0)\n for (y.iushrn(j); j-- > 0; )\n (C.isOdd() || D.isOdd()) && (C.iadd(yp), D.isub(xp)), C.iushrn(1), D.iushrn(1);\n x.cmp(y) >= 0 ? (x.isub(y), A.isub(C), B.isub(D)) : (y.isub(x), C.isub(A), D.isub(B));\n }\n return {\n a: C,\n b: D,\n gcd: y.iushln(g),\n };\n }),\n (BN.prototype._invmp = function (p) {\n assert(p.negative === 0), assert(!p.isZero());\n var a = this,\n b = p.clone();\n a.negative !== 0 ? (a = a.umod(p)) : (a = a.clone());\n for (var x1 = new BN(1), x2 = new BN(0), delta = b.clone(); 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) for (a.iushrn(i); i-- > 0; ) x1.isOdd() && x1.iadd(delta), x1.iushrn(1);\n for (var j = 0, jm = 1; (b.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n if (j > 0) for (b.iushrn(j); j-- > 0; ) x2.isOdd() && x2.iadd(delta), x2.iushrn(1);\n a.cmp(b) >= 0 ? (a.isub(b), x1.isub(x2)) : (b.isub(a), x2.isub(x1));\n }\n var res;\n return a.cmpn(1) === 0 ? (res = x1) : (res = x2), res.cmpn(0) < 0 && res.iadd(p), res;\n }),\n (BN.prototype.gcd = function (num) {\n if (this.isZero()) return num.abs();\n if (num.isZero()) return this.abs();\n var a = this.clone(),\n b = num.clone();\n (a.negative = 0), (b.negative = 0);\n for (var shift = 0; a.isEven() && b.isEven(); shift++) a.iushrn(1), b.iushrn(1);\n do {\n for (; a.isEven(); ) a.iushrn(1);\n for (; b.isEven(); ) b.iushrn(1);\n var r = a.cmp(b);\n if (r < 0) {\n var t = a;\n (a = b), (b = t);\n } else if (r === 0 || b.cmpn(1) === 0) break;\n a.isub(b);\n } while (!0);\n return b.iushln(shift);\n }),\n (BN.prototype.invm = function (num) {\n return this.egcd(num).a.umod(num);\n }),\n (BN.prototype.isEven = function () {\n return (this.words[0] & 1) === 0;\n }),\n (BN.prototype.isOdd = function () {\n return (this.words[0] & 1) === 1;\n }),\n (BN.prototype.andln = function (num) {\n return this.words[0] & num;\n }),\n (BN.prototype.bincn = function (bit) {\n assert(typeof bit == \"number\");\n var r = bit % 26,\n s = (bit - r) / 26,\n q = 1 << r;\n if (this.length <= s) return this._expand(s + 1), (this.words[s] |= q), this;\n for (var carry = q, i = s; carry !== 0 && i < this.length; i++) {\n var w = this.words[i] | 0;\n (w += carry), (carry = w >>> 26), (w &= 67108863), (this.words[i] = w);\n }\n return carry !== 0 && ((this.words[i] = carry), this.length++), this;\n }),\n (BN.prototype.isZero = function () {\n return this.length === 1 && this.words[0] === 0;\n }),\n (BN.prototype.cmpn = function (num) {\n var negative = num < 0;\n if (this.negative !== 0 && !negative) return -1;\n if (this.negative === 0 && negative) return 1;\n this.strip();\n var res;\n if (this.length > 1) res = 1;\n else {\n negative && (num = -num), assert(num <= 67108863, \"Number is too big\");\n var w = this.words[0] | 0;\n res = w === num ? 0 : w < num ? -1 : 1;\n }\n return this.negative !== 0 ? -res | 0 : res;\n }),\n (BN.prototype.cmp = function (num) {\n if (this.negative !== 0 && num.negative === 0) return -1;\n if (this.negative === 0 && num.negative !== 0) return 1;\n var res = this.ucmp(num);\n return this.negative !== 0 ? -res | 0 : res;\n }),\n (BN.prototype.ucmp = function (num) {\n if (this.length > num.length) return 1;\n if (this.length < num.length) return -1;\n for (var res = 0, i = this.length - 1; i >= 0; i--) {\n var a = this.words[i] | 0,\n b = num.words[i] | 0;\n if (a !== b) {\n a < b ? (res = -1) : a > b && (res = 1);\n break;\n }\n }\n return res;\n }),\n (BN.prototype.gtn = function (num) {\n return this.cmpn(num) === 1;\n }),\n (BN.prototype.gt = function (num) {\n return this.cmp(num) === 1;\n }),\n (BN.prototype.gten = function (num) {\n return this.cmpn(num) >= 0;\n }),\n (BN.prototype.gte = function (num) {\n return this.cmp(num) >= 0;\n }),\n (BN.prototype.ltn = function (num) {\n return this.cmpn(num) === -1;\n }),\n (BN.prototype.lt = function (num) {\n return this.cmp(num) === -1;\n }),\n (BN.prototype.lten = function (num) {\n return this.cmpn(num) <= 0;\n }),\n (BN.prototype.lte = function (num) {\n return this.cmp(num) <= 0;\n }),\n (BN.prototype.eqn = function (num) {\n return this.cmpn(num) === 0;\n }),\n (BN.prototype.eq = function (num) {\n return this.cmp(num) === 0;\n }),\n (BN.red = function (num) {\n return new Red(num);\n }),\n (BN.prototype.toRed = function (ctx) {\n return (\n assert(!this.red, \"Already a number in reduction context\"),\n assert(this.negative === 0, \"red works only with positives\"),\n ctx.convertTo(this)._forceRed(ctx)\n );\n }),\n (BN.prototype.fromRed = function () {\n return assert(this.red, \"fromRed works only with numbers in reduction context\"), this.red.convertFrom(this);\n }),\n (BN.prototype._forceRed = function (ctx) {\n return (this.red = ctx), this;\n }),\n (BN.prototype.forceRed = function (ctx) {\n return assert(!this.red, \"Already a number in reduction context\"), this._forceRed(ctx);\n }),\n (BN.prototype.redAdd = function (num) {\n return assert(this.red, \"redAdd works only with red numbers\"), this.red.add(this, num);\n }),\n (BN.prototype.redIAdd = function (num) {\n return assert(this.red, \"redIAdd works only with red numbers\"), this.red.iadd(this, num);\n }),\n (BN.prototype.redSub = function (num) {\n return assert(this.red, \"redSub works only with red numbers\"), this.red.sub(this, num);\n }),\n (BN.prototype.redISub = function (num) {\n return assert(this.red, \"redISub works only with red numbers\"), this.red.isub(this, num);\n }),\n (BN.prototype.redShl = function (num) {\n return assert(this.red, \"redShl works only with red numbers\"), this.red.shl(this, num);\n }),\n (BN.prototype.redMul = function (num) {\n return (\n assert(this.red, \"redMul works only with red numbers\"),\n this.red._verify2(this, num),\n this.red.mul(this, num)\n );\n }),\n (BN.prototype.redIMul = function (num) {\n return (\n assert(this.red, \"redMul works only with red numbers\"),\n this.red._verify2(this, num),\n this.red.imul(this, num)\n );\n }),\n (BN.prototype.redSqr = function () {\n return assert(this.red, \"redSqr works only with red numbers\"), this.red._verify1(this), this.red.sqr(this);\n }),\n (BN.prototype.redISqr = function () {\n return assert(this.red, \"redISqr works only with red numbers\"), this.red._verify1(this), this.red.isqr(this);\n }),\n (BN.prototype.redSqrt = function () {\n return assert(this.red, \"redSqrt works only with red numbers\"), this.red._verify1(this), this.red.sqrt(this);\n }),\n (BN.prototype.redInvm = function () {\n return assert(this.red, \"redInvm works only with red numbers\"), this.red._verify1(this), this.red.invm(this);\n }),\n (BN.prototype.redNeg = function () {\n return assert(this.red, \"redNeg works only with red numbers\"), this.red._verify1(this), this.red.neg(this);\n }),\n (BN.prototype.redPow = function (num) {\n return assert(this.red && !num.red, \"redPow(normalNum)\"), this.red._verify1(this), this.red.pow(this, num);\n });\n var primes = {\n k256: null,\n p224: null,\n p192: null,\n p25519: null,\n };\n function MPrime(name, p) {\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 (this.tmp = this._tmp());\n }\n (MPrime.prototype._tmp = function () {\n var tmp = new BN(null);\n return (tmp.words = new Array(Math.ceil(this.n / 13))), tmp;\n }),\n (MPrime.prototype.ireduce = function (num) {\n var r = num,\n rlen;\n do this.split(r, this.tmp), (r = this.imulK(r)), (r = r.iadd(this.tmp)), (rlen = r.bitLength());\n while (rlen > this.n);\n var cmp = rlen < this.n ? -1 : r.ucmp(this.p);\n return (\n cmp === 0\n ? ((r.words[0] = 0), (r.length = 1))\n : cmp > 0\n ? r.isub(this.p)\n : r.strip !== void 0\n ? r.strip()\n : r._strip(),\n r\n );\n }),\n (MPrime.prototype.split = function (input, out) {\n input.iushrn(this.n, 0, out);\n }),\n (MPrime.prototype.imulK = function (num) {\n return num.imul(this.k);\n });\n function K256() {\n MPrime.call(this, \"k256\", \"ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f\");\n }\n inherits(K256, MPrime),\n (K256.prototype.split = function (input, output) {\n for (var mask = 4194303, outLen = Math.min(input.length, 9), i = 0; i < outLen; i++)\n output.words[i] = input.words[i];\n if (((output.length = outLen), input.length <= 9)) {\n (input.words[0] = 0), (input.length = 1);\n return;\n }\n var prev = input.words[9];\n for (output.words[output.length++] = prev & mask, i = 10; i < input.length; i++) {\n var next = input.words[i] | 0;\n (input.words[i - 10] = ((next & mask) << 4) | (prev >>> 22)), (prev = next);\n }\n (prev >>>= 22),\n (input.words[i - 10] = prev),\n prev === 0 && input.length > 10 ? (input.length -= 10) : (input.length -= 9);\n }),\n (K256.prototype.imulK = function (num) {\n (num.words[num.length] = 0), (num.words[num.length + 1] = 0), (num.length += 2);\n for (var lo = 0, i = 0; i < num.length; i++) {\n var w = num.words[i] | 0;\n (lo += w * 977), (num.words[i] = lo & 67108863), (lo = w * 64 + ((lo / 67108864) | 0));\n }\n return (\n num.words[num.length - 1] === 0 && (num.length--, num.words[num.length - 1] === 0 && num.length--), num\n );\n });\n function P224() {\n MPrime.call(this, \"p224\", \"ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001\");\n }\n inherits(P224, MPrime);\n function P192() {\n MPrime.call(this, \"p192\", \"ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff\");\n }\n inherits(P192, MPrime);\n function P25519() {\n MPrime.call(this, \"25519\", \"7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed\");\n }\n inherits(P25519, MPrime),\n (P25519.prototype.imulK = function (num) {\n for (var carry = 0, i = 0; i < num.length; i++) {\n var hi = (num.words[i] | 0) * 19 + carry,\n lo = hi & 67108863;\n (hi >>>= 26), (num.words[i] = lo), (carry = hi);\n }\n return carry !== 0 && (num.words[num.length++] = carry), num;\n }),\n (BN._prime = function (name) {\n if (primes[name]) return primes[name];\n var prime2;\n if (name === \"k256\") prime2 = new K256();\n else if (name === \"p224\") prime2 = new P224();\n else if (name === \"p192\") prime2 = new P192();\n else if (name === \"p25519\") prime2 = new P25519();\n else throw new Error(\"Unknown prime \" + name);\n return (primes[name] = prime2), prime2;\n });\n function Red(m) {\n if (typeof m == \"string\") {\n var prime = BN._prime(m);\n (this.m = prime.p), (this.prime = prime);\n } else assert(m.gtn(1), \"modulus must be greater than 1\"), (this.m = m), (this.prime = null);\n }\n (Red.prototype._verify1 = function (a) {\n assert(a.negative === 0, \"red works only with positives\"), assert(a.red, \"red works only with red numbers\");\n }),\n (Red.prototype._verify2 = function (a, b) {\n assert((a.negative | b.negative) === 0, \"red works only with positives\"),\n assert(a.red && a.red === b.red, \"red works only with red numbers\");\n }),\n (Red.prototype.imod = function (a) {\n return this.prime ? this.prime.ireduce(a)._forceRed(this) : a.umod(this.m)._forceRed(this);\n }),\n (Red.prototype.neg = function (a) {\n return a.isZero() ? a.clone() : this.m.sub(a)._forceRed(this);\n }),\n (Red.prototype.add = function (a, b) {\n this._verify2(a, b);\n var res = a.add(b);\n return res.cmp(this.m) >= 0 && res.isub(this.m), res._forceRed(this);\n }),\n (Red.prototype.iadd = function (a, b) {\n this._verify2(a, b);\n var res = a.iadd(b);\n return res.cmp(this.m) >= 0 && res.isub(this.m), res;\n }),\n (Red.prototype.sub = function (a, b) {\n this._verify2(a, b);\n var res = a.sub(b);\n return res.cmpn(0) < 0 && res.iadd(this.m), res._forceRed(this);\n }),\n (Red.prototype.isub = function (a, b) {\n this._verify2(a, b);\n var res = a.isub(b);\n return res.cmpn(0) < 0 && res.iadd(this.m), res;\n }),\n (Red.prototype.shl = function (a, num) {\n return this._verify1(a), this.imod(a.ushln(num));\n }),\n (Red.prototype.imul = function (a, b) {\n return this._verify2(a, b), this.imod(a.imul(b));\n }),\n (Red.prototype.mul = function (a, b) {\n return this._verify2(a, b), this.imod(a.mul(b));\n }),\n (Red.prototype.isqr = function (a) {\n return this.imul(a, a.clone());\n }),\n (Red.prototype.sqr = function (a) {\n return this.mul(a, a);\n }),\n (Red.prototype.sqrt = function (a) {\n if (a.isZero()) return a.clone();\n var mod3 = this.m.andln(3);\n if ((assert(mod3 % 2 === 1), mod3 === 3)) {\n var pow = this.m.add(new BN(1)).iushrn(2);\n return this.pow(a, pow);\n }\n for (var q = this.m.subn(1), s = 0; !q.isZero() && q.andln(1) === 0; ) s++, q.iushrn(1);\n assert(!q.isZero());\n var one = new BN(1).toRed(this),\n nOne = one.redNeg(),\n lpow = this.m.subn(1).iushrn(1),\n z = this.m.bitLength();\n for (z = new BN(2 * z * z).toRed(this); this.pow(z, lpow).cmp(nOne) !== 0; ) z.redIAdd(nOne);\n for (\n var c = this.pow(z, q), r = this.pow(a, q.addn(1).iushrn(1)), t = this.pow(a, q), m = s;\n t.cmp(one) !== 0;\n\n ) {\n for (var tmp = t, i = 0; tmp.cmp(one) !== 0; i++) tmp = tmp.redSqr();\n assert(i < m);\n var b = this.pow(c, new BN(1).iushln(m - i - 1));\n (r = r.redMul(b)), (c = b.redSqr()), (t = t.redMul(c)), (m = i);\n }\n return r;\n }),\n (Red.prototype.invm = function (a) {\n var inv = a._invmp(this.m);\n return inv.negative !== 0 ? ((inv.negative = 0), this.imod(inv).redNeg()) : this.imod(inv);\n }),\n (Red.prototype.pow = function (a, num) {\n if (num.isZero()) return new BN(1).toRed(this);\n if (num.cmpn(1) === 0) return a.clone();\n var windowSize = 4,\n wnd = new Array(1 << windowSize);\n (wnd[0] = new BN(1).toRed(this)), (wnd[1] = a);\n for (var i = 2; i < wnd.length; i++) wnd[i] = this.mul(wnd[i - 1], a);\n var res = wnd[0],\n current = 0,\n currentLen = 0,\n start = num.bitLength() % 26;\n for (start === 0 && (start = 26), i = num.length - 1; i >= 0; i--) {\n for (var word = num.words[i], j = start - 1; j >= 0; j--) {\n var bit = (word >> j) & 1;\n if ((res !== wnd[0] && (res = this.sqr(res)), bit === 0 && current === 0)) {\n currentLen = 0;\n continue;\n }\n (current <<= 1),\n (current |= bit),\n currentLen++,\n !(currentLen !== windowSize && (i !== 0 || j !== 0)) &&\n ((res = this.mul(res, wnd[current])), (currentLen = 0), (current = 0));\n }\n start = 26;\n }\n return res;\n }),\n (Red.prototype.convertTo = function (num) {\n var r = num.umod(this.m);\n return r === num ? r.clone() : r;\n }),\n (Red.prototype.convertFrom = function (num) {\n var res = num.clone();\n return (res.red = null), res;\n }),\n (BN.mont = function (num) {\n return new Mont(num);\n });\n function Mont(m) {\n Red.call(this, m),\n (this.shift = this.m.bitLength()),\n this.shift % 26 !== 0 && (this.shift += 26 - (this.shift % 26)),\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 (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 (Mont.prototype.convertTo = function (num) {\n return this.imod(num.ushln(this.shift));\n }),\n (Mont.prototype.convertFrom = function (num) {\n var r = this.imod(num.mul(this.rinv));\n return (r.red = null), r;\n }),\n (Mont.prototype.imul = function (a, b) {\n if (a.isZero() || b.isZero()) return (a.words[0] = 0), (a.length = 1), a;\n var t = a.imul(b),\n c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m),\n u = t.isub(c).iushrn(this.shift),\n res = u;\n return (\n u.cmp(this.m) >= 0 ? (res = u.isub(this.m)) : u.cmpn(0) < 0 && (res = u.iadd(this.m)), res._forceRed(this)\n );\n }),\n (Mont.prototype.mul = function (a, b) {\n if (a.isZero() || b.isZero()) return new BN(0)._forceRed(this);\n var t = a.mul(b),\n c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m),\n u = t.isub(c).iushrn(this.shift),\n res = u;\n return (\n u.cmp(this.m) >= 0 ? (res = u.isub(this.m)) : u.cmpn(0) < 0 && (res = u.iadd(this.m)), res._forceRed(this)\n );\n }),\n (Mont.prototype.invm = function (a) {\n var res = this.imod(a._invmp(this.m).mul(this.r2));\n return res._forceRed(this);\n });\n })(typeof module > \"u\" || module, exports);\n },\n});\n\n// node_modules/safer-buffer/safer.js\nvar require_safer = __commonJS({\n \"node_modules/safer-buffer/safer.js\"(exports, module) {\n \"use strict\";\n var buffer = __require(\"buffer\"),\n Buffer2 = buffer.Buffer,\n safer = {},\n key;\n for (key in buffer)\n !buffer.hasOwnProperty(key) || key === \"SlowBuffer\" || key === \"Buffer\" || (safer[key] = buffer[key]);\n var Safer = (safer.Buffer = {});\n for (key in Buffer2)\n !Buffer2.hasOwnProperty(key) || key === \"allocUnsafe\" || key === \"allocUnsafeSlow\" || (Safer[key] = Buffer2[key]);\n safer.Buffer.prototype = Buffer2.prototype;\n (!Safer.from || Safer.from === Uint8Array.from) &&\n (Safer.from = function (value, encodingOrOffset, length) {\n if (typeof value == \"number\")\n throw new TypeError('The \"value\" argument must not be of type number. Received type ' + typeof value);\n if (value && typeof value.length > \"u\")\n throw new TypeError(\n \"The first argument must be one of type string, Buffer, ArrayBuffer, Array, or Array-like Object. Received type \" +\n typeof value,\n );\n return Buffer2(value, encodingOrOffset, length);\n });\n Safer.alloc ||\n (Safer.alloc = function (size, fill, encoding) {\n if (typeof size != \"number\")\n throw new TypeError('The \"size\" argument must be of type number. Received type ' + typeof size);\n if (size < 0 || size >= 2 * (1 << 30))\n throw new RangeError('The value \"' + size + '\" is invalid for option \"size\"');\n var buf = Buffer2(size);\n return (\n !fill || fill.length === 0\n ? buf.fill(0)\n : typeof encoding == \"string\"\n ? buf.fill(fill, encoding)\n : buf.fill(fill),\n buf\n );\n });\n if (!safer.kStringMaxLength)\n try {\n safer.kStringMaxLength = MAX_STRING_LENGTH;\n } catch {}\n safer.constants ||\n ((safer.constants = {\n MAX_LENGTH: safer.kMaxLength,\n }),\n safer.kStringMaxLength && (safer.constants.MAX_STRING_LENGTH = safer.kStringMaxLength));\n module.exports = safer;\n },\n});\n\n// node_modules/asn1.js/lib/asn1/base/reporter.js\nvar require_reporter = __commonJS({\n \"node_modules/asn1.js/lib/asn1/base/reporter.js\"(exports) {\n \"use strict\";\n var inherits = require_inherits_browser();\n function Reporter(options) {\n this._reporterState = {\n obj: null,\n path: [],\n options: options || {},\n errors: [],\n };\n }\n exports.Reporter = Reporter;\n Reporter.prototype.isError = function (obj) {\n return obj instanceof ReporterError;\n };\n Reporter.prototype.save = function () {\n let state = this._reporterState;\n return { obj: state.obj, pathLen: state.path.length };\n };\n Reporter.prototype.restore = function (data) {\n let state = this._reporterState;\n (state.obj = data.obj), (state.path = state.path.slice(0, data.pathLen));\n };\n Reporter.prototype.enterKey = function (key) {\n return this._reporterState.path.push(key);\n };\n Reporter.prototype.exitKey = function (index) {\n let state = this._reporterState;\n state.path = state.path.slice(0, index - 1);\n };\n Reporter.prototype.leaveKey = function (index, key, value) {\n let state = this._reporterState;\n this.exitKey(index), state.obj !== null && (state.obj[key] = value);\n };\n Reporter.prototype.path = function () {\n return this._reporterState.path.join(\"/\");\n };\n Reporter.prototype.enterObject = function () {\n let state = this._reporterState,\n prev = state.obj;\n return (state.obj = {}), prev;\n };\n Reporter.prototype.leaveObject = function (prev) {\n let state = this._reporterState,\n now = state.obj;\n return (state.obj = prev), now;\n };\n Reporter.prototype.error = function (msg) {\n let err,\n state = this._reporterState,\n inherited = msg instanceof ReporterError;\n if (\n (inherited\n ? (err = msg)\n : (err = new ReporterError(\n state.path\n .map(function (elem) {\n return \"[\" + JSON.stringify(elem) + \"]\";\n })\n .join(\"\"),\n msg.message || msg,\n msg.stack,\n )),\n !state.options.partial)\n )\n throw err;\n return inherited || state.errors.push(err), err;\n };\n Reporter.prototype.wrapResult = function (result) {\n let state = this._reporterState;\n return state.options.partial\n ? {\n result: this.isError(result) ? null : result,\n errors: state.errors,\n }\n : result;\n };\n function ReporterError(path, msg) {\n (this.path = path), this.rethrow(msg);\n }\n inherits(ReporterError, Error);\n ReporterError.prototype.rethrow = function (msg) {\n if (\n ((this.message = msg + \" at: \" + (this.path || \"(shallow)\")),\n Error.captureStackTrace && Error.captureStackTrace(this, ReporterError),\n !this.stack)\n )\n try {\n throw new Error(this.message);\n } catch (e) {\n this.stack = e.stack;\n }\n return this;\n };\n },\n});\n\n// node_modules/asn1.js/lib/asn1/base/buffer.js\nvar require_buffer = __commonJS({\n \"node_modules/asn1.js/lib/asn1/base/buffer.js\"(exports) {\n \"use strict\";\n var inherits = require_inherits_browser(),\n Reporter = require_reporter().Reporter,\n Buffer2 = require_safer().Buffer;\n function DecoderBuffer(base, options) {\n if ((Reporter.call(this, options), !Buffer2.isBuffer(base))) {\n this.error(\"Input not Buffer\");\n return;\n }\n (this.base = base), (this.offset = 0), (this.length = base.length);\n }\n inherits(DecoderBuffer, Reporter);\n exports.DecoderBuffer = DecoderBuffer;\n DecoderBuffer.isDecoderBuffer = function (data) {\n return data instanceof DecoderBuffer\n ? !0\n : typeof data == \"object\" &&\n Buffer2.isBuffer(data.base) &&\n data.constructor.name === \"DecoderBuffer\" &&\n typeof data.offset == \"number\" &&\n typeof data.length == \"number\" &&\n typeof data.save == \"function\" &&\n typeof data.restore == \"function\" &&\n typeof data.isEmpty == \"function\" &&\n typeof data.readUInt8 == \"function\" &&\n typeof data.skip == \"function\" &&\n typeof data.raw == \"function\";\n };\n DecoderBuffer.prototype.save = function () {\n return {\n offset: this.offset,\n reporter: Reporter.prototype.save.call(this),\n };\n };\n DecoderBuffer.prototype.restore = function (save) {\n let res = new DecoderBuffer(this.base);\n return (\n (res.offset = save.offset),\n (res.length = this.offset),\n (this.offset = save.offset),\n Reporter.prototype.restore.call(this, save.reporter),\n res\n );\n };\n DecoderBuffer.prototype.isEmpty = function () {\n return this.offset === this.length;\n };\n DecoderBuffer.prototype.readUInt8 = function (fail) {\n return this.offset + 1 <= this.length\n ? this.base.readUInt8(this.offset++, !0)\n : this.error(fail || \"DecoderBuffer overrun\");\n };\n DecoderBuffer.prototype.skip = function (bytes, fail) {\n if (!(this.offset + bytes <= this.length)) return this.error(fail || \"DecoderBuffer overrun\");\n let res = new DecoderBuffer(this.base);\n return (\n (res._reporterState = this._reporterState),\n (res.offset = this.offset),\n (res.length = this.offset + bytes),\n (this.offset += bytes),\n res\n );\n };\n DecoderBuffer.prototype.raw = function (save) {\n return this.base.slice(save ? save.offset : this.offset, this.length);\n };\n function EncoderBuffer(value, reporter) {\n if (Array.isArray(value))\n (this.length = 0),\n (this.value = value.map(function (item) {\n return (\n EncoderBuffer.isEncoderBuffer(item) || (item = new EncoderBuffer(item, reporter)),\n (this.length += item.length),\n item\n );\n }, this));\n else if (typeof value == \"number\") {\n if (!(0 <= value && value <= 255)) return reporter.error(\"non-byte EncoderBuffer value\");\n (this.value = value), (this.length = 1);\n } else if (typeof value == \"string\") (this.value = value), (this.length = Buffer2.byteLength(value));\n else if (Buffer2.isBuffer(value)) (this.value = value), (this.length = value.length);\n else return reporter.error(\"Unsupported type: \" + typeof value);\n }\n exports.EncoderBuffer = EncoderBuffer;\n EncoderBuffer.isEncoderBuffer = function (data) {\n return data instanceof EncoderBuffer\n ? !0\n : typeof data == \"object\" &&\n data.constructor.name === \"EncoderBuffer\" &&\n typeof data.length == \"number\" &&\n typeof data.join == \"function\";\n };\n EncoderBuffer.prototype.join = function (out, offset) {\n return (\n out || (out = Buffer2.alloc(this.length)),\n offset || (offset = 0),\n this.length === 0 ||\n (Array.isArray(this.value)\n ? this.value.forEach(function (item) {\n item.join(out, offset), (offset += item.length);\n })\n : (typeof this.value == \"number\"\n ? (out[offset] = this.value)\n : typeof this.value == \"string\"\n ? out.write(this.value, offset)\n : Buffer2.isBuffer(this.value) && this.value.copy(out, offset),\n (offset += this.length))),\n out\n );\n };\n },\n});\n\n// node_modules/asn1.js/lib/asn1/base/node.js\nvar require_node = __commonJS({\n \"node_modules/asn1.js/lib/asn1/base/node.js\"(exports, module) {\n \"use strict\";\n var Reporter = require_reporter().Reporter,\n EncoderBuffer = require_buffer().EncoderBuffer,\n DecoderBuffer = require_buffer().DecoderBuffer,\n assert = require_minimalistic_assert(),\n tags = [\n \"seq\",\n \"seqof\",\n \"set\",\n \"setof\",\n \"objid\",\n \"bool\",\n \"gentime\",\n \"utctime\",\n \"null_\",\n \"enum\",\n \"int\",\n \"objDesc\",\n \"bitstr\",\n \"bmpstr\",\n \"charstr\",\n \"genstr\",\n \"graphstr\",\n \"ia5str\",\n \"iso646str\",\n \"numstr\",\n \"octstr\",\n \"printstr\",\n \"t61str\",\n \"unistr\",\n \"utf8str\",\n \"videostr\",\n ],\n methods = [\"key\", \"obj\", \"use\", \"optional\", \"explicit\", \"implicit\", \"def\", \"choice\", \"any\", \"contains\"].concat(\n tags,\n ),\n overrided = [\n \"_peekTag\",\n \"_decodeTag\",\n \"_use\",\n \"_decodeStr\",\n \"_decodeObjid\",\n \"_decodeTime\",\n \"_decodeNull\",\n \"_decodeInt\",\n \"_decodeBool\",\n \"_decodeList\",\n \"_encodeComposite\",\n \"_encodeStr\",\n \"_encodeObjid\",\n \"_encodeTime\",\n \"_encodeNull\",\n \"_encodeInt\",\n \"_encodeBool\",\n ];\n function Node(enc, parent, name) {\n let state = {};\n (this._baseState = state),\n (state.name = name),\n (state.enc = enc),\n (state.parent = parent || null),\n (state.children = null),\n (state.tag = null),\n (state.args = null),\n (state.reverseArgs = null),\n (state.choice = null),\n (state.optional = !1),\n (state.any = !1),\n (state.obj = !1),\n (state.use = null),\n (state.useDecoder = null),\n (state.key = null),\n (state.default = null),\n (state.explicit = null),\n (state.implicit = null),\n (state.contains = null),\n state.parent || ((state.children = []), this._wrap());\n }\n module.exports = Node;\n var stateProps = [\n \"enc\",\n \"parent\",\n \"children\",\n \"tag\",\n \"args\",\n \"reverseArgs\",\n \"choice\",\n \"optional\",\n \"any\",\n \"obj\",\n \"use\",\n \"alteredUse\",\n \"key\",\n \"default\",\n \"explicit\",\n \"implicit\",\n \"contains\",\n ];\n Node.prototype.clone = function () {\n let state = this._baseState,\n cstate = {};\n stateProps.forEach(function (prop) {\n cstate[prop] = state[prop];\n });\n let res = new this.constructor(cstate.parent);\n return (res._baseState = cstate), res;\n };\n Node.prototype._wrap = function () {\n let state = this._baseState;\n methods.forEach(function (method) {\n this[method] = function () {\n let clone = new this.constructor(this);\n return state.children.push(clone), clone[method].apply(clone, arguments);\n };\n }, this);\n };\n Node.prototype._init = function (body) {\n let state = this._baseState;\n assert(state.parent === null),\n body.call(this),\n (state.children = state.children.filter(function (child) {\n return child._baseState.parent === this;\n }, this)),\n assert.equal(state.children.length, 1, \"Root node can have only one child\");\n };\n Node.prototype._useArgs = function (args) {\n let state = this._baseState,\n children = args.filter(function (arg) {\n return arg instanceof this.constructor;\n }, this);\n (args = args.filter(function (arg) {\n return !(arg instanceof this.constructor);\n }, this)),\n children.length !== 0 &&\n (assert(state.children === null),\n (state.children = children),\n children.forEach(function (child) {\n child._baseState.parent = this;\n }, this)),\n args.length !== 0 &&\n (assert(state.args === null),\n (state.args = args),\n (state.reverseArgs = args.map(function (arg) {\n if (typeof arg != \"object\" || arg.constructor !== Object) return arg;\n let res = {};\n return (\n Object.keys(arg).forEach(function (key) {\n key == (key | 0) && (key |= 0);\n let value = arg[key];\n res[value] = key;\n }),\n res\n );\n })));\n };\n overrided.forEach(function (method) {\n Node.prototype[method] = function () {\n let state = this._baseState;\n throw new Error(method + \" not implemented for encoding: \" + state.enc);\n };\n });\n tags.forEach(function (tag) {\n Node.prototype[tag] = function () {\n let state = this._baseState,\n args = Array.prototype.slice.call(arguments);\n return assert(state.tag === null), (state.tag = tag), this._useArgs(args), this;\n };\n });\n Node.prototype.use = function (item) {\n assert(item);\n let state = this._baseState;\n return assert(state.use === null), (state.use = item), this;\n };\n Node.prototype.optional = function () {\n let state = this._baseState;\n return (state.optional = !0), this;\n };\n Node.prototype.def = function (val) {\n let state = this._baseState;\n return assert(state.default === null), (state.default = val), (state.optional = !0), this;\n };\n Node.prototype.explicit = function (num) {\n let state = this._baseState;\n return assert(state.explicit === null && state.implicit === null), (state.explicit = num), this;\n };\n Node.prototype.implicit = function (num) {\n let state = this._baseState;\n return assert(state.explicit === null && state.implicit === null), (state.implicit = num), this;\n };\n Node.prototype.obj = function () {\n let state = this._baseState,\n args = Array.prototype.slice.call(arguments);\n return (state.obj = !0), args.length !== 0 && this._useArgs(args), this;\n };\n Node.prototype.key = function (newKey) {\n let state = this._baseState;\n return assert(state.key === null), (state.key = newKey), this;\n };\n Node.prototype.any = function () {\n let state = this._baseState;\n return (state.any = !0), this;\n };\n Node.prototype.choice = function (obj) {\n let state = this._baseState;\n return (\n assert(state.choice === null),\n (state.choice = obj),\n this._useArgs(\n Object.keys(obj).map(function (key) {\n return obj[key];\n }),\n ),\n this\n );\n };\n Node.prototype.contains = function (item) {\n let state = this._baseState;\n return assert(state.use === null), (state.contains = item), this;\n };\n Node.prototype._decode = function (input, options) {\n let state = this._baseState;\n if (state.parent === null) return input.wrapResult(state.children[0]._decode(input, options));\n let result = state.default,\n present = !0,\n prevKey = null;\n if ((state.key !== null && (prevKey = input.enterKey(state.key)), state.optional)) {\n let tag = null;\n if (\n (state.explicit !== null\n ? (tag = state.explicit)\n : state.implicit !== null\n ? (tag = state.implicit)\n : state.tag !== null && (tag = state.tag),\n tag === null && !state.any)\n ) {\n let save = input.save();\n try {\n state.choice === null ? this._decodeGeneric(state.tag, input, options) : this._decodeChoice(input, options),\n (present = !0);\n } catch {\n present = !1;\n }\n input.restore(save);\n } else if (((present = this._peekTag(input, tag, state.any)), input.isError(present))) return present;\n }\n let prevObj;\n if ((state.obj && present && (prevObj = input.enterObject()), present)) {\n if (state.explicit !== null) {\n let explicit = this._decodeTag(input, state.explicit);\n if (input.isError(explicit)) return explicit;\n input = explicit;\n }\n let start = input.offset;\n if (state.use === null && state.choice === null) {\n let save;\n state.any && (save = input.save());\n let body = this._decodeTag(input, state.implicit !== null ? state.implicit : state.tag, state.any);\n if (input.isError(body)) return body;\n state.any ? (result = input.raw(save)) : (input = body);\n }\n if (\n (options && options.track && state.tag !== null && options.track(input.path(), start, input.length, \"tagged\"),\n options &&\n options.track &&\n state.tag !== null &&\n options.track(input.path(), input.offset, input.length, \"content\"),\n state.any ||\n (state.choice === null\n ? (result = this._decodeGeneric(state.tag, input, options))\n : (result = this._decodeChoice(input, options))),\n input.isError(result))\n )\n return result;\n if (\n (!state.any &&\n state.choice === null &&\n state.children !== null &&\n state.children.forEach(function (child) {\n child._decode(input, options);\n }),\n state.contains && (state.tag === \"octstr\" || state.tag === \"bitstr\"))\n ) {\n let data = new DecoderBuffer(result);\n result = this._getUse(state.contains, input._reporterState.obj)._decode(data, options);\n }\n }\n return (\n state.obj && present && (result = input.leaveObject(prevObj)),\n state.key !== null && (result !== null || present === !0)\n ? input.leaveKey(prevKey, state.key, result)\n : prevKey !== null && input.exitKey(prevKey),\n result\n );\n };\n Node.prototype._decodeGeneric = function (tag, input, options) {\n let state = this._baseState;\n return tag === \"seq\" || tag === \"set\"\n ? null\n : tag === \"seqof\" || tag === \"setof\"\n ? this._decodeList(input, tag, state.args[0], options)\n : /str$/.test(tag)\n ? this._decodeStr(input, tag, options)\n : tag === \"objid\" && state.args\n ? this._decodeObjid(input, state.args[0], state.args[1], options)\n : tag === \"objid\"\n ? this._decodeObjid(input, null, null, options)\n : tag === \"gentime\" || tag === \"utctime\"\n ? this._decodeTime(input, tag, options)\n : tag === \"null_\"\n ? this._decodeNull(input, options)\n : tag === \"bool\"\n ? this._decodeBool(input, options)\n : tag === \"objDesc\"\n ? this._decodeStr(input, tag, options)\n : tag === \"int\" || tag === \"enum\"\n ? this._decodeInt(input, state.args && state.args[0], options)\n : state.use !== null\n ? this._getUse(state.use, input._reporterState.obj)._decode(input, options)\n : input.error(\"unknown tag: \" + tag);\n };\n Node.prototype._getUse = function (entity, obj) {\n let state = this._baseState;\n return (\n (state.useDecoder = this._use(entity, obj)),\n assert(state.useDecoder._baseState.parent === null),\n (state.useDecoder = state.useDecoder._baseState.children[0]),\n state.implicit !== state.useDecoder._baseState.implicit &&\n ((state.useDecoder = state.useDecoder.clone()), (state.useDecoder._baseState.implicit = state.implicit)),\n state.useDecoder\n );\n };\n Node.prototype._decodeChoice = function (input, options) {\n let state = this._baseState,\n result = null,\n match = !1;\n return (\n Object.keys(state.choice).some(function (key) {\n let save = input.save(),\n node = state.choice[key];\n try {\n let value = node._decode(input, options);\n if (input.isError(value)) return !1;\n (result = { type: key, value }), (match = !0);\n } catch {\n return input.restore(save), !1;\n }\n return !0;\n }, this),\n match ? result : input.error(\"Choice not matched\")\n );\n };\n Node.prototype._createEncoderBuffer = function (data) {\n return new EncoderBuffer(data, this.reporter);\n };\n Node.prototype._encode = function (data, reporter, parent) {\n let state = this._baseState;\n if (state.default !== null && state.default === data) return;\n let result = this._encodeValue(data, reporter, parent);\n if (result !== void 0 && !this._skipDefault(result, reporter, parent)) return result;\n };\n Node.prototype._encodeValue = function (data, reporter, parent) {\n let state = this._baseState;\n if (state.parent === null) return state.children[0]._encode(data, reporter || new Reporter());\n let result = null;\n if (((this.reporter = reporter), state.optional && data === void 0))\n if (state.default !== null) data = state.default;\n else return;\n let content = null,\n primitive = !1;\n if (state.any) result = this._createEncoderBuffer(data);\n else if (state.choice) result = this._encodeChoice(data, reporter);\n else if (state.contains)\n (content = this._getUse(state.contains, parent)._encode(data, reporter)), (primitive = !0);\n else if (state.children)\n (content = state.children\n .map(function (child) {\n if (child._baseState.tag === \"null_\") return child._encode(null, reporter, data);\n if (child._baseState.key === null) return reporter.error(\"Child should have a key\");\n let prevKey = reporter.enterKey(child._baseState.key);\n if (typeof data != \"object\") return reporter.error(\"Child expected, but input is not object\");\n let res = child._encode(data[child._baseState.key], reporter, data);\n return reporter.leaveKey(prevKey), res;\n }, this)\n .filter(function (child) {\n return child;\n })),\n (content = this._createEncoderBuffer(content));\n else if (state.tag === \"seqof\" || state.tag === \"setof\") {\n if (!(state.args && state.args.length === 1)) return reporter.error(\"Too many args for : \" + state.tag);\n if (!Array.isArray(data)) return reporter.error(\"seqof/setof, but data is not Array\");\n let child = this.clone();\n (child._baseState.implicit = null),\n (content = this._createEncoderBuffer(\n data.map(function (item) {\n let state2 = this._baseState;\n return this._getUse(state2.args[0], data)._encode(item, reporter);\n }, child),\n ));\n } else\n state.use !== null\n ? (result = this._getUse(state.use, parent)._encode(data, reporter))\n : ((content = this._encodePrimitive(state.tag, data)), (primitive = !0));\n if (!state.any && state.choice === null) {\n let tag = state.implicit !== null ? state.implicit : state.tag,\n cls = state.implicit === null ? \"universal\" : \"context\";\n tag === null\n ? state.use === null && reporter.error(\"Tag could be omitted only for .use()\")\n : state.use === null && (result = this._encodeComposite(tag, primitive, cls, content));\n }\n return state.explicit !== null && (result = this._encodeComposite(state.explicit, !1, \"context\", result)), result;\n };\n Node.prototype._encodeChoice = function (data, reporter) {\n let state = this._baseState,\n node = state.choice[data.type];\n return (\n node || assert(!1, data.type + \" not found in \" + JSON.stringify(Object.keys(state.choice))),\n node._encode(data.value, reporter)\n );\n };\n Node.prototype._encodePrimitive = function (tag, data) {\n let state = this._baseState;\n if (/str$/.test(tag)) return this._encodeStr(data, tag);\n if (tag === \"objid\" && state.args) return this._encodeObjid(data, state.reverseArgs[0], state.args[1]);\n if (tag === \"objid\") return this._encodeObjid(data, null, null);\n if (tag === \"gentime\" || tag === \"utctime\") return this._encodeTime(data, tag);\n if (tag === \"null_\") return this._encodeNull();\n if (tag === \"int\" || tag === \"enum\") return this._encodeInt(data, state.args && state.reverseArgs[0]);\n if (tag === \"bool\") return this._encodeBool(data);\n if (tag === \"objDesc\") return this._encodeStr(data, tag);\n throw new Error(\"Unsupported tag: \" + tag);\n };\n Node.prototype._isNumstr = function (str) {\n return /^[0-9 ]*$/.test(str);\n };\n Node.prototype._isPrintstr = function (str) {\n return /^[A-Za-z0-9 '()+,-./:=?]*$/.test(str);\n };\n },\n});\n\n// node_modules/asn1.js/lib/asn1/constants/der.js\nvar require_der = __commonJS({\n \"node_modules/asn1.js/lib/asn1/constants/der.js\"(exports) {\n \"use strict\";\n function reverse(map) {\n let res = {};\n return (\n Object.keys(map).forEach(function (key) {\n (key | 0) == key && (key = key | 0);\n let value = map[key];\n res[value] = key;\n }),\n res\n );\n }\n exports.tagClass = {\n 0: \"universal\",\n 1: \"application\",\n 2: \"context\",\n 3: \"private\",\n };\n exports.tagClassByName = reverse(exports.tagClass);\n exports.tag = {\n 0: \"end\",\n 1: \"bool\",\n 2: \"int\",\n 3: \"bitstr\",\n 4: \"octstr\",\n 5: \"null_\",\n 6: \"objid\",\n 7: \"objDesc\",\n 8: \"external\",\n 9: \"real\",\n 10: \"enum\",\n 11: \"embed\",\n 12: \"utf8str\",\n 13: \"relativeOid\",\n 16: \"seq\",\n 17: \"set\",\n 18: \"numstr\",\n 19: \"printstr\",\n 20: \"t61str\",\n 21: \"videostr\",\n 22: \"ia5str\",\n 23: \"utctime\",\n 24: \"gentime\",\n 25: \"graphstr\",\n 26: \"iso646str\",\n 27: \"genstr\",\n 28: \"unistr\",\n 29: \"charstr\",\n 30: \"bmpstr\",\n };\n exports.tagByName = reverse(exports.tag);\n },\n});\n\n// node_modules/asn1.js/lib/asn1/encoders/der.js\nvar require_der2 = __commonJS({\n \"node_modules/asn1.js/lib/asn1/encoders/der.js\"(exports, module) {\n \"use strict\";\n var inherits = require_inherits_browser(),\n Buffer2 = require_safer().Buffer,\n Node = require_node(),\n der = require_der();\n function DEREncoder(entity) {\n (this.enc = \"der\"),\n (this.name = entity.name),\n (this.entity = entity),\n (this.tree = new DERNode()),\n this.tree._init(entity.body);\n }\n module.exports = DEREncoder;\n DEREncoder.prototype.encode = function (data, reporter) {\n return this.tree._encode(data, reporter).join();\n };\n function DERNode(parent) {\n Node.call(this, \"der\", parent);\n }\n inherits(DERNode, Node);\n DERNode.prototype._encodeComposite = function (tag, primitive, cls, content) {\n let encodedTag = encodeTag(tag, primitive, cls, this.reporter);\n if (content.length < 128) {\n let header2 = Buffer2.alloc(2);\n return (header2[0] = encodedTag), (header2[1] = content.length), this._createEncoderBuffer([header2, content]);\n }\n let lenOctets = 1;\n for (let i = content.length; i >= 256; i >>= 8) lenOctets++;\n let header = Buffer2.alloc(1 + 1 + lenOctets);\n (header[0] = encodedTag), (header[1] = 128 | lenOctets);\n for (let i = 1 + lenOctets, j = content.length; j > 0; i--, j >>= 8) header[i] = j & 255;\n return this._createEncoderBuffer([header, content]);\n };\n DERNode.prototype._encodeStr = function (str, tag) {\n if (tag === \"bitstr\") return this._createEncoderBuffer([str.unused | 0, str.data]);\n if (tag === \"bmpstr\") {\n let buf = Buffer2.alloc(str.length * 2);\n for (let i = 0; i < str.length; i++) buf.writeUInt16BE(str.charCodeAt(i), i * 2);\n return this._createEncoderBuffer(buf);\n } else\n return tag === \"numstr\"\n ? this._isNumstr(str)\n ? this._createEncoderBuffer(str)\n : this.reporter.error(\"Encoding of string type: numstr supports only digits and space\")\n : tag === \"printstr\"\n ? this._isPrintstr(str)\n ? this._createEncoderBuffer(str)\n : this.reporter.error(\n \"Encoding of string type: printstr supports only latin upper and lower case letters, digits, space, apostrophe, left and rigth parenthesis, plus sign, comma, hyphen, dot, slash, colon, equal sign, question mark\",\n )\n : /str$/.test(tag)\n ? this._createEncoderBuffer(str)\n : tag === \"objDesc\"\n ? this._createEncoderBuffer(str)\n : this.reporter.error(\"Encoding of string type: \" + tag + \" unsupported\");\n };\n DERNode.prototype._encodeObjid = function (id, values, relative) {\n if (typeof id == \"string\") {\n if (!values) return this.reporter.error(\"string objid given, but no values map found\");\n if (!values.hasOwnProperty(id)) return this.reporter.error(\"objid not found in values map\");\n id = values[id].split(/[\\s.]+/g);\n for (let i = 0; i < id.length; i++) id[i] |= 0;\n } else if (Array.isArray(id)) {\n id = id.slice();\n for (let i = 0; i < id.length; i++) id[i] |= 0;\n }\n if (!Array.isArray(id))\n return this.reporter.error(\"objid() should be either array or string, got: \" + JSON.stringify(id));\n if (!relative) {\n if (id[1] >= 40) return this.reporter.error(\"Second objid identifier OOB\");\n id.splice(0, 2, id[0] * 40 + id[1]);\n }\n let size = 0;\n for (let i = 0; i < id.length; i++) {\n let ident = id[i];\n for (size++; ident >= 128; ident >>= 7) size++;\n }\n let objid = Buffer2.alloc(size),\n offset = objid.length - 1;\n for (let i = id.length - 1; i >= 0; i--) {\n let ident = id[i];\n for (objid[offset--] = ident & 127; (ident >>= 7) > 0; ) objid[offset--] = 128 | (ident & 127);\n }\n return this._createEncoderBuffer(objid);\n };\n function two(num) {\n return num < 10 ? \"0\" + num : num;\n }\n DERNode.prototype._encodeTime = function (time, tag) {\n let str,\n date = new Date(time);\n return (\n tag === \"gentime\"\n ? (str = [\n two(date.getUTCFullYear()),\n two(date.getUTCMonth() + 1),\n two(date.getUTCDate()),\n two(date.getUTCHours()),\n two(date.getUTCMinutes()),\n two(date.getUTCSeconds()),\n \"Z\",\n ].join(\"\"))\n : tag === \"utctime\"\n ? (str = [\n two(date.getUTCFullYear() % 100),\n two(date.getUTCMonth() + 1),\n two(date.getUTCDate()),\n two(date.getUTCHours()),\n two(date.getUTCMinutes()),\n two(date.getUTCSeconds()),\n \"Z\",\n ].join(\"\"))\n : this.reporter.error(\"Encoding \" + tag + \" time is not supported yet\"),\n this._encodeStr(str, \"octstr\")\n );\n };\n DERNode.prototype._encodeNull = function () {\n return this._createEncoderBuffer(\"\");\n };\n DERNode.prototype._encodeInt = function (num, values) {\n if (typeof num == \"string\") {\n if (!values) return this.reporter.error(\"String int or enum given, but no values map\");\n if (!values.hasOwnProperty(num))\n return this.reporter.error(\"Values map doesn't contain: \" + JSON.stringify(num));\n num = values[num];\n }\n if (typeof num != \"number\" && !Buffer2.isBuffer(num)) {\n let numArray = num.toArray();\n !num.sign && numArray[0] & 128 && numArray.unshift(0), (num = Buffer2.from(numArray));\n }\n if (Buffer2.isBuffer(num)) {\n let size2 = num.length;\n num.length === 0 && size2++;\n let out2 = Buffer2.alloc(size2);\n return num.copy(out2), num.length === 0 && (out2[0] = 0), this._createEncoderBuffer(out2);\n }\n if (num < 128) return this._createEncoderBuffer(num);\n if (num < 256) return this._createEncoderBuffer([0, num]);\n let size = 1;\n for (let i = num; i >= 256; i >>= 8) size++;\n let out = new Array(size);\n for (let i = out.length - 1; i >= 0; i--) (out[i] = num & 255), (num >>= 8);\n return out[0] & 128 && out.unshift(0), this._createEncoderBuffer(Buffer2.from(out));\n };\n DERNode.prototype._encodeBool = function (value) {\n return this._createEncoderBuffer(value ? 255 : 0);\n };\n DERNode.prototype._use = function (entity, obj) {\n return typeof entity == \"function\" && (entity = entity(obj)), entity._getEncoder(\"der\").tree;\n };\n DERNode.prototype._skipDefault = function (dataBuffer, reporter, parent) {\n let state = this._baseState,\n i;\n if (state.default === null) return !1;\n let data = dataBuffer.join();\n if (\n (state.defaultBuffer === void 0 &&\n (state.defaultBuffer = this._encodeValue(state.default, reporter, parent).join()),\n data.length !== state.defaultBuffer.length)\n )\n return !1;\n for (i = 0; i < data.length; i++) if (data[i] !== state.defaultBuffer[i]) return !1;\n return !0;\n };\n function encodeTag(tag, primitive, cls, reporter) {\n let res;\n if ((tag === \"seqof\" ? (tag = \"seq\") : tag === \"setof\" && (tag = \"set\"), der.tagByName.hasOwnProperty(tag)))\n res = der.tagByName[tag];\n else if (typeof tag == \"number\" && (tag | 0) === tag) res = tag;\n else return reporter.error(\"Unknown tag: \" + tag);\n return res >= 31\n ? reporter.error(\"Multi-octet tag encoding unsupported\")\n : (primitive || (res |= 32), (res |= der.tagClassByName[cls || \"universal\"] << 6), res);\n }\n },\n});\n\n// node_modules/asn1.js/lib/asn1/encoders/pem.js\nvar require_pem = __commonJS({\n \"node_modules/asn1.js/lib/asn1/encoders/pem.js\"(exports, module) {\n \"use strict\";\n var inherits = require_inherits_browser(),\n DEREncoder = require_der2();\n function PEMEncoder(entity) {\n DEREncoder.call(this, entity), (this.enc = \"pem\");\n }\n inherits(PEMEncoder, DEREncoder);\n module.exports = PEMEncoder;\n PEMEncoder.prototype.encode = function (data, options) {\n let p = DEREncoder.prototype.encode.call(this, data).toString(\"base64\"),\n out = [\"-----BEGIN \" + options.label + \"-----\"];\n for (let i = 0; i < p.length; i += 64) out.push(p.slice(i, i + 64));\n return (\n out.push(\"-----END \" + options.label + \"-----\"),\n out.join(`\n`)\n );\n };\n },\n});\n\n// node_modules/asn1.js/lib/asn1/encoders/index.js\nvar require_encoders = __commonJS({\n \"node_modules/asn1.js/lib/asn1/encoders/index.js\"(exports) {\n \"use strict\";\n var encoders = exports;\n encoders.der = require_der2();\n encoders.pem = require_pem();\n },\n});\n\n// node_modules/asn1.js/lib/asn1/decoders/der.js\nvar require_der3 = __commonJS({\n \"node_modules/asn1.js/lib/asn1/decoders/der.js\"(exports, module) {\n \"use strict\";\n var inherits = require_inherits_browser(),\n bignum = require_bn5(),\n DecoderBuffer = require_buffer().DecoderBuffer,\n Node = require_node(),\n der = require_der();\n function DERDecoder(entity) {\n (this.enc = \"der\"),\n (this.name = entity.name),\n (this.entity = entity),\n (this.tree = new DERNode()),\n this.tree._init(entity.body);\n }\n module.exports = DERDecoder;\n DERDecoder.prototype.decode = function (data, options) {\n return (\n DecoderBuffer.isDecoderBuffer(data) || (data = new DecoderBuffer(data, options)),\n this.tree._decode(data, options)\n );\n };\n function DERNode(parent) {\n Node.call(this, \"der\", parent);\n }\n inherits(DERNode, Node);\n DERNode.prototype._peekTag = function (buffer, tag, any) {\n if (buffer.isEmpty()) return !1;\n let state = buffer.save(),\n decodedTag = derDecodeTag(buffer, 'Failed to peek tag: \"' + tag + '\"');\n return buffer.isError(decodedTag)\n ? decodedTag\n : (buffer.restore(state),\n decodedTag.tag === tag || decodedTag.tagStr === tag || decodedTag.tagStr + \"of\" === tag || any);\n };\n DERNode.prototype._decodeTag = function (buffer, tag, any) {\n let decodedTag = derDecodeTag(buffer, 'Failed to decode tag of \"' + tag + '\"');\n if (buffer.isError(decodedTag)) return decodedTag;\n let len = derDecodeLen(buffer, decodedTag.primitive, 'Failed to get length of \"' + tag + '\"');\n if (buffer.isError(len)) return len;\n if (!any && decodedTag.tag !== tag && decodedTag.tagStr !== tag && decodedTag.tagStr + \"of\" !== tag)\n return buffer.error('Failed to match tag: \"' + tag + '\"');\n if (decodedTag.primitive || len !== null) return buffer.skip(len, 'Failed to match body of: \"' + tag + '\"');\n let state = buffer.save(),\n res = this._skipUntilEnd(buffer, 'Failed to skip indefinite length body: \"' + this.tag + '\"');\n return buffer.isError(res)\n ? res\n : ((len = buffer.offset - state.offset),\n buffer.restore(state),\n buffer.skip(len, 'Failed to match body of: \"' + tag + '\"'));\n };\n DERNode.prototype._skipUntilEnd = function (buffer, fail) {\n for (;;) {\n let tag = derDecodeTag(buffer, fail);\n if (buffer.isError(tag)) return tag;\n let len = derDecodeLen(buffer, tag.primitive, fail);\n if (buffer.isError(len)) return len;\n let res;\n if (\n (tag.primitive || len !== null ? (res = buffer.skip(len)) : (res = this._skipUntilEnd(buffer, fail)),\n buffer.isError(res))\n )\n return res;\n if (tag.tagStr === \"end\") break;\n }\n };\n DERNode.prototype._decodeList = function (buffer, tag, decoder, options) {\n let result = [];\n for (; !buffer.isEmpty(); ) {\n let possibleEnd = this._peekTag(buffer, \"end\");\n if (buffer.isError(possibleEnd)) return possibleEnd;\n let res = decoder.decode(buffer, \"der\", options);\n if (buffer.isError(res) && possibleEnd) break;\n result.push(res);\n }\n return result;\n };\n DERNode.prototype._decodeStr = function (buffer, tag) {\n if (tag === \"bitstr\") {\n let unused = buffer.readUInt8();\n return buffer.isError(unused) ? unused : { unused, data: buffer.raw() };\n } else if (tag === \"bmpstr\") {\n let raw = buffer.raw();\n if (raw.length % 2 === 1) return buffer.error(\"Decoding of string type: bmpstr length mismatch\");\n let str = \"\";\n for (let i = 0; i < raw.length / 2; i++) str += String.fromCharCode(raw.readUInt16BE(i * 2));\n return str;\n } else if (tag === \"numstr\") {\n let numstr = buffer.raw().toString(\"ascii\");\n return this._isNumstr(numstr) ? numstr : buffer.error(\"Decoding of string type: numstr unsupported characters\");\n } else {\n if (tag === \"octstr\") return buffer.raw();\n if (tag === \"objDesc\") return buffer.raw();\n if (tag === \"printstr\") {\n let printstr = buffer.raw().toString(\"ascii\");\n return this._isPrintstr(printstr)\n ? printstr\n : buffer.error(\"Decoding of string type: printstr unsupported characters\");\n } else\n return /str$/.test(tag)\n ? buffer.raw().toString()\n : buffer.error(\"Decoding of string type: \" + tag + \" unsupported\");\n }\n };\n DERNode.prototype._decodeObjid = function (buffer, values, relative) {\n let result,\n identifiers = [],\n ident = 0,\n subident = 0;\n for (; !buffer.isEmpty(); )\n (subident = buffer.readUInt8()),\n (ident <<= 7),\n (ident |= subident & 127),\n (subident & 128) === 0 && (identifiers.push(ident), (ident = 0));\n subident & 128 && identifiers.push(ident);\n let first = (identifiers[0] / 40) | 0,\n second = identifiers[0] % 40;\n if ((relative ? (result = identifiers) : (result = [first, second].concat(identifiers.slice(1))), values)) {\n let tmp = values[result.join(\" \")];\n tmp === void 0 && (tmp = values[result.join(\".\")]), tmp !== void 0 && (result = tmp);\n }\n return result;\n };\n DERNode.prototype._decodeTime = function (buffer, tag) {\n let str = buffer.raw().toString(),\n year,\n mon,\n day,\n hour,\n min,\n sec;\n if (tag === \"gentime\")\n (year = str.slice(0, 4) | 0),\n (mon = str.slice(4, 6) | 0),\n (day = str.slice(6, 8) | 0),\n (hour = str.slice(8, 10) | 0),\n (min = str.slice(10, 12) | 0),\n (sec = str.slice(12, 14) | 0);\n else if (tag === \"utctime\")\n (year = str.slice(0, 2) | 0),\n (mon = str.slice(2, 4) | 0),\n (day = str.slice(4, 6) | 0),\n (hour = str.slice(6, 8) | 0),\n (min = str.slice(8, 10) | 0),\n (sec = str.slice(10, 12) | 0),\n year < 70 ? (year = 2e3 + year) : (year = 1900 + year);\n else return buffer.error(\"Decoding \" + tag + \" time is not supported yet\");\n return Date.UTC(year, mon - 1, day, hour, min, sec, 0);\n };\n DERNode.prototype._decodeNull = function () {\n return null;\n };\n DERNode.prototype._decodeBool = function (buffer) {\n let res = buffer.readUInt8();\n return buffer.isError(res) ? res : res !== 0;\n };\n DERNode.prototype._decodeInt = function (buffer, values) {\n let raw = buffer.raw(),\n res = new bignum(raw);\n return values && (res = values[res.toString(10)] || res), res;\n };\n DERNode.prototype._use = function (entity, obj) {\n return typeof entity == \"function\" && (entity = entity(obj)), entity._getDecoder(\"der\").tree;\n };\n function derDecodeTag(buf, fail) {\n let tag = buf.readUInt8(fail);\n if (buf.isError(tag)) return tag;\n let cls = der.tagClass[tag >> 6],\n primitive = (tag & 32) === 0;\n if ((tag & 31) === 31) {\n let oct = tag;\n for (tag = 0; (oct & 128) === 128; ) {\n if (((oct = buf.readUInt8(fail)), buf.isError(oct))) return oct;\n (tag <<= 7), (tag |= oct & 127);\n }\n } else tag &= 31;\n let tagStr = der.tag[tag];\n return {\n cls,\n primitive,\n tag,\n tagStr,\n };\n }\n function derDecodeLen(buf, primitive, fail) {\n let len = buf.readUInt8(fail);\n if (buf.isError(len)) return len;\n if (!primitive && len === 128) return null;\n if ((len & 128) === 0) return len;\n let num = len & 127;\n if (num > 4) return buf.error(\"length octect is too long\");\n len = 0;\n for (let i = 0; i < num; i++) {\n len <<= 8;\n let j = buf.readUInt8(fail);\n if (buf.isError(j)) return j;\n len |= j;\n }\n return len;\n }\n },\n});\n\n// node_modules/asn1.js/lib/asn1/decoders/pem.js\nvar require_pem2 = __commonJS({\n \"node_modules/asn1.js/lib/asn1/decoders/pem.js\"(exports, module) {\n \"use strict\";\n var inherits = require_inherits_browser(),\n Buffer2 = require_safer().Buffer,\n DERDecoder = require_der3();\n function PEMDecoder(entity) {\n DERDecoder.call(this, entity), (this.enc = \"pem\");\n }\n inherits(PEMDecoder, DERDecoder);\n module.exports = PEMDecoder;\n PEMDecoder.prototype.decode = function (data, options) {\n let lines = data.toString().split(/[\\r\\n]+/g),\n label = options.label.toUpperCase(),\n re = /^-----(BEGIN|END) ([^-]+)-----$/,\n start = -1,\n end = -1;\n for (let i = 0; i < lines.length; i++) {\n let match = lines[i].match(re);\n if (match !== null && match[2] === label)\n if (start === -1) {\n if (match[1] !== \"BEGIN\") break;\n start = i;\n } else {\n if (match[1] !== \"END\") break;\n end = i;\n break;\n }\n }\n if (start === -1 || end === -1) throw new Error(\"PEM section not found for: \" + label);\n let base64 = lines.slice(start + 1, end).join(\"\");\n base64.replace(/[^a-z0-9+/=]+/gi, \"\");\n let input = Buffer2.from(base64, \"base64\");\n return DERDecoder.prototype.decode.call(this, input, options);\n };\n },\n});\n\n// node_modules/asn1.js/lib/asn1/decoders/index.js\nvar require_decoders = __commonJS({\n \"node_modules/asn1.js/lib/asn1/decoders/index.js\"(exports) {\n \"use strict\";\n var decoders = exports;\n decoders.der = require_der3();\n decoders.pem = require_pem2();\n },\n});\n\n// node_modules/asn1.js/lib/asn1/api.js\nvar require_api = __commonJS({\n \"node_modules/asn1.js/lib/asn1/api.js\"(exports) {\n \"use strict\";\n var encoders = require_encoders(),\n decoders = require_decoders(),\n inherits = require_inherits_browser(),\n api = exports;\n api.define = function (name, body) {\n return new Entity(name, body);\n };\n function Entity(name, body) {\n (this.name = name), (this.body = body), (this.decoders = {}), (this.encoders = {});\n }\n Entity.prototype._createNamed = function (Base) {\n let name = this.name;\n function Generated(entity) {\n this._initNamed(entity, name);\n }\n return (\n inherits(Generated, Base),\n (Generated.prototype._initNamed = function (entity, name2) {\n Base.call(this, entity, name2);\n }),\n new Generated(this)\n );\n };\n Entity.prototype._getDecoder = function (enc) {\n return (\n (enc = enc || \"der\"),\n this.decoders.hasOwnProperty(enc) || (this.decoders[enc] = this._createNamed(decoders[enc])),\n this.decoders[enc]\n );\n };\n Entity.prototype.decode = function (data, enc, options) {\n return this._getDecoder(enc).decode(data, options);\n };\n Entity.prototype._getEncoder = function (enc) {\n return (\n (enc = enc || \"der\"),\n this.encoders.hasOwnProperty(enc) || (this.encoders[enc] = this._createNamed(encoders[enc])),\n this.encoders[enc]\n );\n };\n Entity.prototype.encode = function (data, enc, reporter) {\n return this._getEncoder(enc).encode(data, reporter);\n };\n },\n});\n\n// node_modules/asn1.js/lib/asn1/base/index.js\nvar require_base2 = __commonJS({\n \"node_modules/asn1.js/lib/asn1/base/index.js\"(exports) {\n \"use strict\";\n var base = exports;\n base.Reporter = require_reporter().Reporter;\n base.DecoderBuffer = require_buffer().DecoderBuffer;\n base.EncoderBuffer = require_buffer().EncoderBuffer;\n base.Node = require_node();\n },\n});\n\n// node_modules/asn1.js/lib/asn1/constants/index.js\nvar require_constants = __commonJS({\n \"node_modules/asn1.js/lib/asn1/constants/index.js\"(exports) {\n \"use strict\";\n var constants = exports;\n constants._reverse = function (map) {\n let res = {};\n return (\n Object.keys(map).forEach(function (key) {\n (key | 0) == key && (key = key | 0);\n let value = map[key];\n res[value] = key;\n }),\n res\n );\n };\n constants.der = require_der();\n },\n});\n\n// node_modules/asn1.js/lib/asn1.js\nvar require_asn1 = __commonJS({\n \"node_modules/asn1.js/lib/asn1.js\"(exports) {\n \"use strict\";\n var asn1 = exports;\n asn1.bignum = require_bn5();\n asn1.define = require_api().define;\n asn1.base = require_base2();\n asn1.constants = require_constants();\n asn1.decoders = require_decoders();\n asn1.encoders = require_encoders();\n },\n});\n\n// node_modules/parse-asn1/certificate.js\nvar require_certificate = __commonJS({\n \"node_modules/parse-asn1/certificate.js\"(exports, module) {\n \"use strict\";\n var asn = require_asn1(),\n Time = asn.define(\"Time\", function () {\n this.choice({\n utcTime: this.utctime(),\n generalTime: this.gentime(),\n });\n }),\n AttributeTypeValue = asn.define(\"AttributeTypeValue\", function () {\n this.seq().obj(this.key(\"type\").objid(), this.key(\"value\").any());\n }),\n AlgorithmIdentifier = asn.define(\"AlgorithmIdentifier\", function () {\n this.seq().obj(\n this.key(\"algorithm\").objid(),\n this.key(\"parameters\").optional(),\n this.key(\"curve\").objid().optional(),\n );\n }),\n SubjectPublicKeyInfo = asn.define(\"SubjectPublicKeyInfo\", function () {\n this.seq().obj(this.key(\"algorithm\").use(AlgorithmIdentifier), this.key(\"subjectPublicKey\").bitstr());\n }),\n RelativeDistinguishedName = asn.define(\"RelativeDistinguishedName\", function () {\n this.setof(AttributeTypeValue);\n }),\n RDNSequence = asn.define(\"RDNSequence\", function () {\n this.seqof(RelativeDistinguishedName);\n }),\n Name = asn.define(\"Name\", function () {\n this.choice({\n rdnSequence: this.use(RDNSequence),\n });\n }),\n Validity = asn.define(\"Validity\", function () {\n this.seq().obj(this.key(\"notBefore\").use(Time), this.key(\"notAfter\").use(Time));\n }),\n Extension = asn.define(\"Extension\", function () {\n this.seq().obj(this.key(\"extnID\").objid(), this.key(\"critical\").bool().def(!1), this.key(\"extnValue\").octstr());\n }),\n TBSCertificate = asn.define(\"TBSCertificate\", function () {\n this.seq().obj(\n this.key(\"version\").explicit(0).int().optional(),\n this.key(\"serialNumber\").int(),\n this.key(\"signature\").use(AlgorithmIdentifier),\n this.key(\"issuer\").use(Name),\n this.key(\"validity\").use(Validity),\n this.key(\"subject\").use(Name),\n this.key(\"subjectPublicKeyInfo\").use(SubjectPublicKeyInfo),\n this.key(\"issuerUniqueID\").implicit(1).bitstr().optional(),\n this.key(\"subjectUniqueID\").implicit(2).bitstr().optional(),\n this.key(\"extensions\").explicit(3).seqof(Extension).optional(),\n );\n }),\n X509Certificate = asn.define(\"X509Certificate\", function () {\n this.seq().obj(\n this.key(\"tbsCertificate\").use(TBSCertificate),\n this.key(\"signatureAlgorithm\").use(AlgorithmIdentifier),\n this.key(\"signatureValue\").bitstr(),\n );\n });\n module.exports = X509Certificate;\n },\n});\n\n// node_modules/parse-asn1/asn1.js\nvar require_asn12 = __commonJS({\n \"node_modules/parse-asn1/asn1.js\"(exports) {\n \"use strict\";\n var asn1 = require_asn1();\n exports.certificate = require_certificate();\n var RSAPrivateKey = asn1.define(\"RSAPrivateKey\", function () {\n this.seq().obj(\n this.key(\"version\").int(),\n this.key(\"modulus\").int(),\n this.key(\"publicExponent\").int(),\n this.key(\"privateExponent\").int(),\n this.key(\"prime1\").int(),\n this.key(\"prime2\").int(),\n this.key(\"exponent1\").int(),\n this.key(\"exponent2\").int(),\n this.key(\"coefficient\").int(),\n );\n });\n exports.RSAPrivateKey = RSAPrivateKey;\n var RSAPublicKey = asn1.define(\"RSAPublicKey\", function () {\n this.seq().obj(this.key(\"modulus\").int(), this.key(\"publicExponent\").int());\n });\n exports.RSAPublicKey = RSAPublicKey;\n var PublicKey = asn1.define(\"SubjectPublicKeyInfo\", function () {\n this.seq().obj(this.key(\"algorithm\").use(AlgorithmIdentifier), this.key(\"subjectPublicKey\").bitstr());\n });\n exports.PublicKey = PublicKey;\n var AlgorithmIdentifier = asn1.define(\"AlgorithmIdentifier\", function () {\n this.seq().obj(\n this.key(\"algorithm\").objid(),\n this.key(\"none\").null_().optional(),\n this.key(\"curve\").objid().optional(),\n this.key(\"params\").seq().obj(this.key(\"p\").int(), this.key(\"q\").int(), this.key(\"g\").int()).optional(),\n );\n }),\n PrivateKeyInfo = asn1.define(\"PrivateKeyInfo\", function () {\n this.seq().obj(\n this.key(\"version\").int(),\n this.key(\"algorithm\").use(AlgorithmIdentifier),\n this.key(\"subjectPrivateKey\").octstr(),\n );\n });\n exports.PrivateKey = PrivateKeyInfo;\n var EncryptedPrivateKeyInfo = asn1.define(\"EncryptedPrivateKeyInfo\", function () {\n this.seq().obj(\n this.key(\"algorithm\")\n .seq()\n .obj(\n this.key(\"id\").objid(),\n this.key(\"decrypt\")\n .seq()\n .obj(\n this.key(\"kde\")\n .seq()\n .obj(\n this.key(\"id\").objid(),\n this.key(\"kdeparams\").seq().obj(this.key(\"salt\").octstr(), this.key(\"iters\").int()),\n ),\n this.key(\"cipher\").seq().obj(this.key(\"algo\").objid(), this.key(\"iv\").octstr()),\n ),\n ),\n this.key(\"subjectPrivateKey\").octstr(),\n );\n });\n exports.EncryptedPrivateKey = EncryptedPrivateKeyInfo;\n var DSAPrivateKey = asn1.define(\"DSAPrivateKey\", function () {\n this.seq().obj(\n this.key(\"version\").int(),\n this.key(\"p\").int(),\n this.key(\"q\").int(),\n this.key(\"g\").int(),\n this.key(\"pub_key\").int(),\n this.key(\"priv_key\").int(),\n );\n });\n exports.DSAPrivateKey = DSAPrivateKey;\n exports.DSAparam = asn1.define(\"DSAparam\", function () {\n this.int();\n });\n var ECPrivateKey = asn1.define(\"ECPrivateKey\", function () {\n this.seq().obj(\n this.key(\"version\").int(),\n this.key(\"privateKey\").octstr(),\n this.key(\"parameters\").optional().explicit(0).use(ECParameters),\n this.key(\"publicKey\").optional().explicit(1).bitstr(),\n );\n });\n exports.ECPrivateKey = ECPrivateKey;\n var ECParameters = asn1.define(\"ECParameters\", function () {\n this.choice({\n namedCurve: this.objid(),\n });\n });\n exports.signature = asn1.define(\"signature\", function () {\n this.seq().obj(this.key(\"r\").int(), this.key(\"s\").int());\n });\n },\n});\n\n// node_modules/parse-asn1/aesid.json\nvar require_aesid = __commonJS({\n \"node_modules/parse-asn1/aesid.json\"(exports, module) {\n module.exports = {\n \"2.16.840.1.101.3.4.1.1\": \"aes-128-ecb\",\n \"2.16.840.1.101.3.4.1.2\": \"aes-128-cbc\",\n \"2.16.840.1.101.3.4.1.3\": \"aes-128-ofb\",\n \"2.16.840.1.101.3.4.1.4\": \"aes-128-cfb\",\n \"2.16.840.1.101.3.4.1.21\": \"aes-192-ecb\",\n \"2.16.840.1.101.3.4.1.22\": \"aes-192-cbc\",\n \"2.16.840.1.101.3.4.1.23\": \"aes-192-ofb\",\n \"2.16.840.1.101.3.4.1.24\": \"aes-192-cfb\",\n \"2.16.840.1.101.3.4.1.41\": \"aes-256-ecb\",\n \"2.16.840.1.101.3.4.1.42\": \"aes-256-cbc\",\n \"2.16.840.1.101.3.4.1.43\": \"aes-256-ofb\",\n \"2.16.840.1.101.3.4.1.44\": \"aes-256-cfb\",\n };\n },\n});\n\n// node_modules/parse-asn1/fixProc.js\nvar require_fixProc = __commonJS({\n \"node_modules/parse-asn1/fixProc.js\"(exports, module) {\n var findProc =\n /Proc-Type: 4,ENCRYPTED[\\n\\r]+DEK-Info: AES-((?:128)|(?:192)|(?:256))-CBC,([0-9A-H]+)[\\n\\r]+([0-9A-z\\n\\r+/=]+)[\\n\\r]+/m,\n startRegex = /^-----BEGIN ((?:.*? KEY)|CERTIFICATE)-----/m,\n fullRegex = /^-----BEGIN ((?:.*? KEY)|CERTIFICATE)-----([0-9A-z\\n\\r+/=]+)-----END \\1-----$/m,\n evp = require_evp_bytestokey(),\n ciphers = require_browser5(),\n Buffer2 = require_safe_buffer().Buffer;\n module.exports = function (okey, password) {\n var key = okey.toString(),\n match = key.match(findProc),\n decrypted;\n if (match) {\n var suite = \"aes\" + match[1],\n iv = Buffer2.from(match[2], \"hex\"),\n cipherText = Buffer2.from(match[3].replace(/[\\r\\n]/g, \"\"), \"base64\"),\n cipherKey = evp(password, iv.slice(0, 8), parseInt(match[1], 10)).key,\n out = [],\n cipher = ciphers.createDecipheriv(suite, cipherKey, iv);\n out.push(cipher.update(cipherText)), out.push(cipher.final()), (decrypted = Buffer2.concat(out));\n } else {\n var match2 = key.match(fullRegex);\n decrypted = Buffer2.from(match2[2].replace(/[\\r\\n]/g, \"\"), \"base64\");\n }\n var tag = key.match(startRegex)[1];\n return {\n tag,\n data: decrypted,\n };\n };\n },\n});\n\n// node_modules/parse-asn1/index.js\nvar require_parse_asn1 = __commonJS({\n \"node_modules/parse-asn1/index.js\"(exports, module) {\n var asn1 = require_asn12(),\n aesid = require_aesid(),\n fixProc = require_fixProc(),\n ciphers = require_browser5(),\n compat = require_browser4(),\n Buffer2 = require_safe_buffer().Buffer;\n module.exports = parseKeys;\n function parseKeys(buffer) {\n var password;\n typeof buffer == \"object\" && !Buffer2.isBuffer(buffer) && ((password = buffer.passphrase), (buffer = buffer.key)),\n typeof buffer == \"string\" && (buffer = Buffer2.from(buffer));\n var stripped = fixProc(buffer, password),\n type = stripped.tag,\n data = stripped.data,\n subtype,\n ndata;\n switch (type) {\n case \"CERTIFICATE\":\n ndata = asn1.certificate.decode(data, \"der\").tbsCertificate.subjectPublicKeyInfo;\n case \"PUBLIC KEY\":\n switch (\n (ndata || (ndata = asn1.PublicKey.decode(data, \"der\")),\n (subtype = ndata.algorithm.algorithm.join(\".\")),\n subtype)\n ) {\n case \"1.2.840.113549.1.1.1\":\n return asn1.RSAPublicKey.decode(ndata.subjectPublicKey.data, \"der\");\n case \"1.2.840.10045.2.1\":\n return (\n (ndata.subjectPrivateKey = ndata.subjectPublicKey),\n {\n type: \"ec\",\n data: ndata,\n }\n );\n case \"1.2.840.10040.4.1\":\n return (\n (ndata.algorithm.params.pub_key = asn1.DSAparam.decode(ndata.subjectPublicKey.data, \"der\")),\n {\n type: \"dsa\",\n data: ndata.algorithm.params,\n }\n );\n default:\n throw new Error(\"unknown key id \" + subtype);\n }\n case \"ENCRYPTED PRIVATE KEY\":\n (data = asn1.EncryptedPrivateKey.decode(data, \"der\")), (data = decrypt(data, password));\n case \"PRIVATE KEY\":\n switch (\n ((ndata = asn1.PrivateKey.decode(data, \"der\")), (subtype = ndata.algorithm.algorithm.join(\".\")), subtype)\n ) {\n case \"1.2.840.113549.1.1.1\":\n return asn1.RSAPrivateKey.decode(ndata.subjectPrivateKey, \"der\");\n case \"1.2.840.10045.2.1\":\n return {\n curve: ndata.algorithm.curve,\n privateKey: asn1.ECPrivateKey.decode(ndata.subjectPrivateKey, \"der\").privateKey,\n };\n case \"1.2.840.10040.4.1\":\n return (\n (ndata.algorithm.params.priv_key = asn1.DSAparam.decode(ndata.subjectPrivateKey, \"der\")),\n {\n type: \"dsa\",\n params: ndata.algorithm.params,\n }\n );\n default:\n throw new Error(\"unknown key id \" + subtype);\n }\n case \"RSA PUBLIC KEY\":\n return asn1.RSAPublicKey.decode(data, \"der\");\n case \"RSA PRIVATE KEY\":\n return asn1.RSAPrivateKey.decode(data, \"der\");\n case \"DSA PRIVATE KEY\":\n return {\n type: \"dsa\",\n params: asn1.DSAPrivateKey.decode(data, \"der\"),\n };\n case \"EC PRIVATE KEY\":\n return (\n (data = asn1.ECPrivateKey.decode(data, \"der\")),\n {\n curve: data.parameters.value,\n privateKey: data.privateKey,\n }\n );\n default:\n throw new Error(\"unknown key type \" + type);\n }\n }\n parseKeys.signature = asn1.signature;\n function decrypt(data, password) {\n var salt = data.algorithm.decrypt.kde.kdeparams.salt,\n iters = parseInt(data.algorithm.decrypt.kde.kdeparams.iters.toString(), 10),\n algo = aesid[data.algorithm.decrypt.cipher.algo.join(\".\")],\n iv = data.algorithm.decrypt.cipher.iv,\n cipherText = data.subjectPrivateKey,\n keylen = parseInt(algo.split(\"-\")[1], 10) / 8,\n key = compat.pbkdf2Sync(password, salt, iters, keylen, \"sha1\"),\n cipher = ciphers.createDecipheriv(algo, key, iv),\n out = [];\n return out.push(cipher.update(cipherText)), out.push(cipher.final()), Buffer2.concat(out);\n }\n },\n});\n\n// node_modules/browserify-sign/browser/curves.json\nvar require_curves2 = __commonJS({\n \"node_modules/browserify-sign/browser/curves.json\"(exports, module) {\n module.exports = {\n \"1.3.132.0.10\": \"secp256k1\",\n \"1.3.132.0.33\": \"p224\",\n \"1.2.840.10045.3.1.1\": \"p192\",\n \"1.2.840.10045.3.1.7\": \"p256\",\n \"1.3.132.0.34\": \"p384\",\n \"1.3.132.0.35\": \"p521\",\n };\n },\n});\n\n// node_modules/browserify-sign/browser/sign.js\nvar require_sign = __commonJS({\n \"node_modules/browserify-sign/browser/sign.js\"(exports, module) {\n var Buffer2 = require_safe_buffer().Buffer,\n createHmac = require_browser3(),\n crt = require_browserify_rsa(),\n EC = require_elliptic().ec,\n BN = require_bn3(),\n parseKeys = require_parse_asn1(),\n curves = require_curves2();\n function sign(hash, key, hashType, signType, tag) {\n var priv = parseKeys(key);\n if (priv.curve) {\n if (signType !== \"ecdsa\" && signType !== \"ecdsa/rsa\") throw new Error(\"wrong private key type\");\n return ecSign(hash, priv);\n } else if (priv.type === \"dsa\") {\n if (signType !== \"dsa\") throw new Error(\"wrong private key type\");\n return dsaSign(hash, priv, hashType);\n } else if (signType !== \"rsa\" && signType !== \"ecdsa/rsa\") throw new Error(\"wrong private key type\");\n hash = Buffer2.concat([tag, hash]);\n for (var len = priv.modulus.byteLength(), pad = [0, 1]; hash.length + pad.length + 1 < len; ) pad.push(255);\n pad.push(0);\n for (var i = -1; ++i < hash.length; ) pad.push(hash[i]);\n var out = crt(pad, priv);\n return out;\n }\n function ecSign(hash, priv) {\n var curveId = curves[priv.curve.join(\".\")];\n if (!curveId) throw new Error(\"unknown curve \" + priv.curve.join(\".\"));\n var curve = new EC(curveId),\n key = curve.keyFromPrivate(priv.privateKey),\n out = key.sign(hash);\n return Buffer2.from(out.toDER());\n }\n function dsaSign(hash, priv, algo) {\n for (\n var x = priv.params.priv_key,\n p = priv.params.p,\n q = priv.params.q,\n g = priv.params.g,\n r = new BN(0),\n k,\n H = bits2int(hash, q).mod(q),\n s = !1,\n kv = getKey(x, q, hash, algo);\n s === !1;\n\n )\n (k = makeKey(q, kv, algo)),\n (r = makeR(g, k, p, q)),\n (s = k\n .invm(q)\n .imul(H.add(x.mul(r)))\n .mod(q)),\n s.cmpn(0) === 0 && ((s = !1), (r = new BN(0)));\n return toDER(r, s);\n }\n function toDER(r, s) {\n (r = r.toArray()), (s = s.toArray()), r[0] & 128 && (r = [0].concat(r)), s[0] & 128 && (s = [0].concat(s));\n var total = r.length + s.length + 4,\n res = [48, total, 2, r.length];\n return (res = res.concat(r, [2, s.length], s)), Buffer2.from(res);\n }\n function getKey(x, q, hash, algo) {\n if (((x = Buffer2.from(x.toArray())), x.length < q.byteLength())) {\n var zeros = Buffer2.alloc(q.byteLength() - x.length);\n x = Buffer2.concat([zeros, x]);\n }\n var hlen = hash.length,\n hbits = bits2octets(hash, q),\n v = Buffer2.alloc(hlen);\n v.fill(1);\n var k = Buffer2.alloc(hlen);\n return (\n (k = createHmac(algo, k)\n .update(v)\n .update(Buffer2.from([0]))\n .update(x)\n .update(hbits)\n .digest()),\n (v = createHmac(algo, k).update(v).digest()),\n (k = createHmac(algo, k)\n .update(v)\n .update(Buffer2.from([1]))\n .update(x)\n .update(hbits)\n .digest()),\n (v = createHmac(algo, k).update(v).digest()),\n { k, v }\n );\n }\n function bits2int(obits, q) {\n var bits = new BN(obits),\n shift = (obits.length << 3) - q.bitLength();\n return shift > 0 && bits.ishrn(shift), bits;\n }\n function bits2octets(bits, q) {\n (bits = bits2int(bits, q)), (bits = bits.mod(q));\n var out = Buffer2.from(bits.toArray());\n if (out.length < q.byteLength()) {\n var zeros = Buffer2.alloc(q.byteLength() - out.length);\n out = Buffer2.concat([zeros, out]);\n }\n return out;\n }\n function makeKey(q, kv, algo) {\n var t, k;\n do {\n for (t = Buffer2.alloc(0); t.length * 8 < q.bitLength(); )\n (kv.v = createHmac(algo, kv.k).update(kv.v).digest()), (t = Buffer2.concat([t, kv.v]));\n (k = bits2int(t, q)),\n (kv.k = createHmac(algo, kv.k)\n .update(kv.v)\n .update(Buffer2.from([0]))\n .digest()),\n (kv.v = createHmac(algo, kv.k).update(kv.v).digest());\n } while (k.cmp(q) !== -1);\n return k;\n }\n function makeR(g, k, p, q) {\n return g.toRed(BN.mont(p)).redPow(k).fromRed().mod(q);\n }\n module.exports = sign;\n module.exports.getKey = getKey;\n module.exports.makeKey = makeKey;\n },\n});\n\n// node_modules/browserify-sign/browser/verify.js\nvar require_verify = __commonJS({\n \"node_modules/browserify-sign/browser/verify.js\"(exports, module) {\n var Buffer2 = require_safe_buffer().Buffer,\n BN = require_bn3(),\n EC = require_elliptic().ec,\n parseKeys = require_parse_asn1(),\n curves = require_curves2();\n function verify(sig, hash, key, signType, tag) {\n var pub = parseKeys(key);\n if (pub.type === \"ec\") {\n if (signType !== \"ecdsa\" && signType !== \"ecdsa/rsa\") throw new Error(\"wrong public key type\");\n return ecVerify(sig, hash, pub);\n } else if (pub.type === \"dsa\") {\n if (signType !== \"dsa\") throw new Error(\"wrong public key type\");\n return dsaVerify(sig, hash, pub);\n } else if (signType !== \"rsa\" && signType !== \"ecdsa/rsa\") throw new Error(\"wrong public key type\");\n hash = Buffer2.concat([tag, hash]);\n for (var len = pub.modulus.byteLength(), pad = [1], padNum = 0; hash.length + pad.length + 2 < len; )\n pad.push(255), padNum++;\n pad.push(0);\n for (var i = -1; ++i < hash.length; ) pad.push(hash[i]);\n pad = Buffer2.from(pad);\n var red = BN.mont(pub.modulus);\n (sig = new BN(sig).toRed(red)),\n (sig = sig.redPow(new BN(pub.publicExponent))),\n (sig = Buffer2.from(sig.fromRed().toArray()));\n var out = padNum < 8 ? 1 : 0;\n for (len = Math.min(sig.length, pad.length), sig.length !== pad.length && (out = 1), i = -1; ++i < len; )\n out |= sig[i] ^ pad[i];\n return out === 0;\n }\n function ecVerify(sig, hash, pub) {\n var curveId = curves[pub.data.algorithm.curve.join(\".\")];\n if (!curveId) throw new Error(\"unknown curve \" + pub.data.algorithm.curve.join(\".\"));\n var curve = new EC(curveId),\n pubkey = pub.data.subjectPrivateKey.data;\n return curve.verify(hash, sig, pubkey);\n }\n function dsaVerify(sig, hash, pub) {\n var p = pub.data.p,\n q = pub.data.q,\n g = pub.data.g,\n y = pub.data.pub_key,\n unpacked = parseKeys.signature.decode(sig, \"der\"),\n s = unpacked.s,\n r = unpacked.r;\n checkValue(s, q), checkValue(r, q);\n var montp = BN.mont(p),\n w = s.invm(q),\n v = g\n .toRed(montp)\n .redPow(new BN(hash).mul(w).mod(q))\n .fromRed()\n .mul(y.toRed(montp).redPow(r.mul(w).mod(q)).fromRed())\n .mod(p)\n .mod(q);\n return v.cmp(r) === 0;\n }\n function checkValue(b, q) {\n if (b.cmpn(0) <= 0) throw new Error(\"invalid sig\");\n if (b.cmp(q) >= q) throw new Error(\"invalid sig\");\n }\n module.exports = verify;\n },\n});\n\n// node_modules/browserify-sign/browser/index.js\nvar require_browser8 = __commonJS({\n \"node_modules/browserify-sign/browser/index.js\"(exports, module) {\n var Buffer2 = require_safe_buffer().Buffer,\n createHash = require_browser2(),\n stream = __require(\"readable-stream\"),\n inherits = require_inherits_browser(),\n sign = require_sign(),\n verify = require_verify(),\n algorithms = require_algorithms();\n Object.keys(algorithms).forEach(function (key) {\n (algorithms[key].id = Buffer2.from(algorithms[key].id, \"hex\")), (algorithms[key.toLowerCase()] = algorithms[key]);\n });\n function Sign(algorithm) {\n stream.Writable.call(this);\n var data = algorithms[algorithm];\n if (!data) throw new Error(\"Unknown message digest\");\n (this._hashType = data.hash),\n (this._hash = createHash(data.hash)),\n (this._tag = data.id),\n (this._signType = data.sign);\n }\n inherits(Sign, stream.Writable);\n Sign.prototype._write = function (data, _, done) {\n this._hash.update(data), done();\n };\n Sign.prototype.update = function (data, enc) {\n return typeof data == \"string\" && (data = Buffer2.from(data, enc)), this._hash.update(data), this;\n };\n Sign.prototype.sign = function (key, enc) {\n this.end();\n var hash = this._hash.digest(),\n sig = sign(hash, key, this._hashType, this._signType, this._tag);\n return enc ? sig.toString(enc) : sig;\n };\n function Verify(algorithm) {\n stream.Writable.call(this);\n var data = algorithms[algorithm];\n if (!data) throw new Error(\"Unknown message digest\");\n (this._hash = createHash(data.hash)), (this._tag = data.id), (this._signType = data.sign);\n }\n inherits(Verify, stream.Writable);\n Verify.prototype._write = function (data, _, done) {\n this._hash.update(data), done();\n };\n Verify.prototype.update = function (data, enc) {\n return typeof data == \"string\" && (data = Buffer2.from(data, enc)), this._hash.update(data), this;\n };\n Verify.prototype.verify = function (key, sig, enc) {\n typeof sig == \"string\" && (sig = Buffer2.from(sig, enc)), this.end();\n var hash = this._hash.digest();\n return verify(sig, hash, key, this._signType, this._tag);\n };\n function createSign(algorithm) {\n return new Sign(algorithm);\n }\n function createVerify(algorithm) {\n return new Verify(algorithm);\n }\n module.exports = {\n Sign: createSign,\n Verify: createVerify,\n createSign,\n createVerify,\n };\n },\n});\n\n// node_modules/create-ecdh/node_modules/bn.js/lib/bn.js\nvar require_bn6 = __commonJS({\n \"node_modules/create-ecdh/node_modules/bn.js/lib/bn.js\"(exports, module) {\n (function (module2, exports2) {\n \"use strict\";\n function assert(val, msg) {\n if (!val) throw new Error(msg || \"Assertion failed\");\n }\n function inherits(ctor, superCtor) {\n ctor.super_ = superCtor;\n var TempCtor = function () {};\n (TempCtor.prototype = superCtor.prototype),\n (ctor.prototype = new TempCtor()),\n (ctor.prototype.constructor = ctor);\n }\n function BN(number, base, endian) {\n if (BN.isBN(number)) return number;\n (this.negative = 0),\n (this.words = null),\n (this.length = 0),\n (this.red = null),\n number !== null &&\n ((base === \"le\" || base === \"be\") && ((endian = base), (base = 10)),\n this._init(number || 0, base || 10, endian || \"be\"));\n }\n typeof module2 == \"object\" ? (module2.exports = BN) : (exports2.BN = BN), (BN.BN = BN), (BN.wordSize = 26);\n var Buffer2;\n try {\n typeof window < \"u\" && typeof window.Buffer < \"u\"\n ? (Buffer2 = window.Buffer)\n : (Buffer2 = __require(\"buffer\").Buffer);\n } catch {}\n (BN.isBN = function (num) {\n return num instanceof BN\n ? !0\n : num !== null &&\n typeof num == \"object\" &&\n num.constructor.wordSize === BN.wordSize &&\n Array.isArray(num.words);\n }),\n (BN.max = function (left, right) {\n return left.cmp(right) > 0 ? left : right;\n }),\n (BN.min = function (left, right) {\n return left.cmp(right) < 0 ? left : right;\n }),\n (BN.prototype._init = function (number, base, endian) {\n if (typeof number == \"number\") return this._initNumber(number, base, endian);\n if (typeof number == \"object\") return this._initArray(number, base, endian);\n base === \"hex\" && (base = 16),\n assert(base === (base | 0) && base >= 2 && base <= 36),\n (number = number.toString().replace(/\\s+/g, \"\"));\n var start = 0;\n number[0] === \"-\" && (start++, (this.negative = 1)),\n start < number.length &&\n (base === 16\n ? this._parseHex(number, start, endian)\n : (this._parseBase(number, base, start),\n endian === \"le\" && this._initArray(this.toArray(), base, endian)));\n }),\n (BN.prototype._initNumber = function (number, base, endian) {\n number < 0 && ((this.negative = 1), (number = -number)),\n number < 67108864\n ? ((this.words = [number & 67108863]), (this.length = 1))\n : number < 4503599627370496\n ? ((this.words = [number & 67108863, (number / 67108864) & 67108863]), (this.length = 2))\n : (assert(number < 9007199254740992),\n (this.words = [number & 67108863, (number / 67108864) & 67108863, 1]),\n (this.length = 3)),\n endian === \"le\" && this._initArray(this.toArray(), base, endian);\n }),\n (BN.prototype._initArray = function (number, base, endian) {\n if ((assert(typeof number.length == \"number\"), number.length <= 0))\n return (this.words = [0]), (this.length = 1), this;\n (this.length = Math.ceil(number.length / 3)), (this.words = new Array(this.length));\n for (var i = 0; i < this.length; i++) this.words[i] = 0;\n var j,\n w,\n off = 0;\n if (endian === \"be\")\n for (i = number.length - 1, j = 0; i >= 0; i -= 3)\n (w = number[i] | (number[i - 1] << 8) | (number[i - 2] << 16)),\n (this.words[j] |= (w << off) & 67108863),\n (this.words[j + 1] = (w >>> (26 - off)) & 67108863),\n (off += 24),\n off >= 26 && ((off -= 26), j++);\n else if (endian === \"le\")\n for (i = 0, j = 0; i < number.length; i += 3)\n (w = number[i] | (number[i + 1] << 8) | (number[i + 2] << 16)),\n (this.words[j] |= (w << off) & 67108863),\n (this.words[j + 1] = (w >>> (26 - off)) & 67108863),\n (off += 24),\n off >= 26 && ((off -= 26), j++);\n return this.strip();\n });\n function parseHex4Bits(string, index) {\n var c = string.charCodeAt(index);\n return c >= 65 && c <= 70 ? c - 55 : c >= 97 && c <= 102 ? c - 87 : (c - 48) & 15;\n }\n function parseHexByte(string, lowerBound, index) {\n var r = parseHex4Bits(string, index);\n return index - 1 >= lowerBound && (r |= parseHex4Bits(string, index - 1) << 4), r;\n }\n BN.prototype._parseHex = function (number, start, endian) {\n (this.length = Math.ceil((number.length - start) / 6)), (this.words = new Array(this.length));\n for (var i = 0; i < this.length; i++) this.words[i] = 0;\n var off = 0,\n j = 0,\n w;\n if (endian === \"be\")\n for (i = number.length - 1; i >= start; i -= 2)\n (w = parseHexByte(number, start, i) << off),\n (this.words[j] |= w & 67108863),\n off >= 18 ? ((off -= 18), (j += 1), (this.words[j] |= w >>> 26)) : (off += 8);\n else {\n var parseLength = number.length - start;\n for (i = parseLength % 2 === 0 ? start + 1 : start; i < number.length; i += 2)\n (w = parseHexByte(number, start, i) << off),\n (this.words[j] |= w & 67108863),\n off >= 18 ? ((off -= 18), (j += 1), (this.words[j] |= w >>> 26)) : (off += 8);\n }\n this.strip();\n };\n function parseBase(str, start, end, mul) {\n for (var r = 0, len = Math.min(str.length, end), i = start; i < len; i++) {\n var c = str.charCodeAt(i) - 48;\n (r *= mul), c >= 49 ? (r += c - 49 + 10) : c >= 17 ? (r += c - 17 + 10) : (r += c);\n }\n return r;\n }\n (BN.prototype._parseBase = function (number, base, start) {\n (this.words = [0]), (this.length = 1);\n for (var limbLen = 0, limbPow = 1; limbPow <= 67108863; limbPow *= base) limbLen++;\n limbLen--, (limbPow = (limbPow / base) | 0);\n for (\n var total = number.length - start,\n mod = total % limbLen,\n end = Math.min(total, total - mod) + start,\n word = 0,\n i = start;\n i < end;\n i += limbLen\n )\n (word = parseBase(number, i, i + limbLen, base)),\n this.imuln(limbPow),\n this.words[0] + word < 67108864 ? (this.words[0] += word) : this._iaddn(word);\n if (mod !== 0) {\n var pow = 1;\n for (word = parseBase(number, i, number.length, base), i = 0; i < mod; i++) pow *= base;\n this.imuln(pow), this.words[0] + word < 67108864 ? (this.words[0] += word) : this._iaddn(word);\n }\n this.strip();\n }),\n (BN.prototype.copy = function (dest) {\n dest.words = new Array(this.length);\n for (var i = 0; i < this.length; i++) dest.words[i] = this.words[i];\n (dest.length = this.length), (dest.negative = this.negative), (dest.red = this.red);\n }),\n (BN.prototype.clone = function () {\n var r = new BN(null);\n return this.copy(r), r;\n }),\n (BN.prototype._expand = function (size) {\n for (; this.length < size; ) this.words[this.length++] = 0;\n return this;\n }),\n (BN.prototype.strip = function () {\n for (; this.length > 1 && this.words[this.length - 1] === 0; ) this.length--;\n return this._normSign();\n }),\n (BN.prototype._normSign = function () {\n return this.length === 1 && this.words[0] === 0 && (this.negative = 0), this;\n }),\n (BN.prototype.inspect = function () {\n return (this.red ? \"<BN-R: \" : \"<BN: \") + this.toString(16) + \">\";\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 groupSizes = [\n 0, 0, 25, 16, 12, 11, 10, 9, 8, 8, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5,\n 5, 5,\n ],\n groupBases = [\n 0, 0, 33554432, 43046721, 16777216, 48828125, 60466176, 40353607, 16777216, 43046721, 1e7, 19487171, 35831808,\n 62748517, 7529536, 11390625, 16777216, 24137569, 34012224, 47045881, 64e6, 4084101, 5153632, 6436343, 7962624,\n 9765625, 11881376, 14348907, 17210368, 20511149, 243e5, 28629151, 33554432, 39135393, 45435424, 52521875,\n 60466176,\n ];\n (BN.prototype.toString = function (base, padding) {\n (base = base || 10), (padding = padding | 0 || 1);\n var out;\n if (base === 16 || base === \"hex\") {\n out = \"\";\n for (var off = 0, carry = 0, i = 0; i < this.length; i++) {\n var w = this.words[i],\n word = (((w << off) | carry) & 16777215).toString(16);\n (carry = (w >>> (24 - off)) & 16777215),\n carry !== 0 || i !== this.length - 1 ? (out = zeros[6 - word.length] + word + out) : (out = word + out),\n (off += 2),\n off >= 26 && ((off -= 26), i--);\n }\n for (carry !== 0 && (out = carry.toString(16) + out); out.length % padding !== 0; ) out = \"0\" + out;\n return this.negative !== 0 && (out = \"-\" + out), out;\n }\n if (base === (base | 0) && base >= 2 && base <= 36) {\n var groupSize = groupSizes[base],\n groupBase = groupBases[base];\n out = \"\";\n var c = this.clone();\n for (c.negative = 0; !c.isZero(); ) {\n var r = c.modn(groupBase).toString(base);\n (c = c.idivn(groupBase)), c.isZero() ? (out = r + out) : (out = zeros[groupSize - r.length] + r + out);\n }\n for (this.isZero() && (out = \"0\" + out); out.length % padding !== 0; ) out = \"0\" + out;\n return this.negative !== 0 && (out = \"-\" + out), out;\n }\n assert(!1, \"Base should be between 2 and 36\");\n }),\n (BN.prototype.toNumber = function () {\n var ret = this.words[0];\n return (\n this.length === 2\n ? (ret += this.words[1] * 67108864)\n : this.length === 3 && this.words[2] === 1\n ? (ret += 4503599627370496 + this.words[1] * 67108864)\n : this.length > 2 && assert(!1, \"Number can only safely store up to 53 bits\"),\n this.negative !== 0 ? -ret : ret\n );\n }),\n (BN.prototype.toJSON = function () {\n return this.toString(16);\n }),\n (BN.prototype.toBuffer = function (endian, length) {\n return assert(typeof Buffer2 < \"u\"), this.toArrayLike(Buffer2, endian, length);\n }),\n (BN.prototype.toArray = function (endian, length) {\n return this.toArrayLike(Array, endian, length);\n }),\n (BN.prototype.toArrayLike = function (ArrayType, endian, length) {\n var byteLength = this.byteLength(),\n 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 this.strip();\n var littleEndian = endian === \"le\",\n res = new ArrayType(reqLength),\n b,\n i,\n q = this.clone();\n if (littleEndian) {\n for (i = 0; !q.isZero(); i++) (b = q.andln(255)), q.iushrn(8), (res[i] = b);\n for (; i < reqLength; i++) res[i] = 0;\n } else {\n for (i = 0; i < reqLength - byteLength; i++) res[i] = 0;\n for (i = 0; !q.isZero(); i++) (b = q.andln(255)), q.iushrn(8), (res[reqLength - i - 1] = b);\n }\n return res;\n }),\n Math.clz32\n ? (BN.prototype._countBits = function (w) {\n return 32 - Math.clz32(w);\n })\n : (BN.prototype._countBits = function (w) {\n var t = w,\n r = 0;\n return (\n t >= 4096 && ((r += 13), (t >>>= 13)),\n t >= 64 && ((r += 7), (t >>>= 7)),\n t >= 8 && ((r += 4), (t >>>= 4)),\n t >= 2 && ((r += 2), (t >>>= 2)),\n r + t\n );\n }),\n (BN.prototype._zeroBits = function (w) {\n if (w === 0) return 26;\n var t = w,\n r = 0;\n return (\n (t & 8191) === 0 && ((r += 13), (t >>>= 13)),\n (t & 127) === 0 && ((r += 7), (t >>>= 7)),\n (t & 15) === 0 && ((r += 4), (t >>>= 4)),\n (t & 3) === 0 && ((r += 2), (t >>>= 2)),\n (t & 1) === 0 && r++,\n r\n );\n }),\n (BN.prototype.bitLength = function () {\n var w = this.words[this.length - 1],\n hi = this._countBits(w);\n return (this.length - 1) * 26 + hi;\n });\n function toBitArray(num) {\n for (var w = new Array(num.bitLength()), bit = 0; bit < w.length; bit++) {\n var off = (bit / 26) | 0,\n wbit = bit % 26;\n w[bit] = (num.words[off] & (1 << wbit)) >>> wbit;\n }\n return w;\n }\n (BN.prototype.zeroBits = function () {\n if (this.isZero()) return 0;\n for (var r = 0, i = 0; i < this.length; i++) {\n var b = this._zeroBits(this.words[i]);\n if (((r += b), b !== 26)) break;\n }\n return r;\n }),\n (BN.prototype.byteLength = function () {\n return Math.ceil(this.bitLength() / 8);\n }),\n (BN.prototype.toTwos = function (width) {\n return this.negative !== 0 ? this.abs().inotn(width).iaddn(1) : this.clone();\n }),\n (BN.prototype.fromTwos = function (width) {\n return this.testn(width - 1) ? this.notn(width).iaddn(1).ineg() : this.clone();\n }),\n (BN.prototype.isNeg = function () {\n return this.negative !== 0;\n }),\n (BN.prototype.neg = function () {\n return this.clone().ineg();\n }),\n (BN.prototype.ineg = function () {\n return this.isZero() || (this.negative ^= 1), this;\n }),\n (BN.prototype.iuor = function (num) {\n for (; this.length < num.length; ) this.words[this.length++] = 0;\n for (var i = 0; i < num.length; i++) this.words[i] = this.words[i] | num.words[i];\n return this.strip();\n }),\n (BN.prototype.ior = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuor(num);\n }),\n (BN.prototype.or = function (num) {\n return this.length > num.length ? this.clone().ior(num) : num.clone().ior(this);\n }),\n (BN.prototype.uor = function (num) {\n return this.length > num.length ? this.clone().iuor(num) : num.clone().iuor(this);\n }),\n (BN.prototype.iuand = function (num) {\n var b;\n this.length > num.length ? (b = num) : (b = this);\n for (var i = 0; i < b.length; i++) this.words[i] = this.words[i] & num.words[i];\n return (this.length = b.length), this.strip();\n }),\n (BN.prototype.iand = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuand(num);\n }),\n (BN.prototype.and = function (num) {\n return this.length > num.length ? this.clone().iand(num) : num.clone().iand(this);\n }),\n (BN.prototype.uand = function (num) {\n return this.length > num.length ? this.clone().iuand(num) : num.clone().iuand(this);\n }),\n (BN.prototype.iuxor = function (num) {\n var a, b;\n this.length > num.length ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var i = 0; i < b.length; i++) this.words[i] = a.words[i] ^ b.words[i];\n if (this !== a) for (; i < a.length; i++) this.words[i] = a.words[i];\n return (this.length = a.length), this.strip();\n }),\n (BN.prototype.ixor = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuxor(num);\n }),\n (BN.prototype.xor = function (num) {\n return this.length > num.length ? this.clone().ixor(num) : num.clone().ixor(this);\n }),\n (BN.prototype.uxor = function (num) {\n return this.length > num.length ? this.clone().iuxor(num) : num.clone().iuxor(this);\n }),\n (BN.prototype.inotn = function (width) {\n assert(typeof width == \"number\" && width >= 0);\n var bytesNeeded = Math.ceil(width / 26) | 0,\n bitsLeft = width % 26;\n this._expand(bytesNeeded), bitsLeft > 0 && bytesNeeded--;\n for (var i = 0; i < bytesNeeded; i++) this.words[i] = ~this.words[i] & 67108863;\n return bitsLeft > 0 && (this.words[i] = ~this.words[i] & (67108863 >> (26 - bitsLeft))), this.strip();\n }),\n (BN.prototype.notn = function (width) {\n return this.clone().inotn(width);\n }),\n (BN.prototype.setn = function (bit, val) {\n assert(typeof bit == \"number\" && bit >= 0);\n var off = (bit / 26) | 0,\n wbit = bit % 26;\n return (\n this._expand(off + 1),\n val\n ? (this.words[off] = this.words[off] | (1 << wbit))\n : (this.words[off] = this.words[off] & ~(1 << wbit)),\n this.strip()\n );\n }),\n (BN.prototype.iadd = function (num) {\n var r;\n if (this.negative !== 0 && num.negative === 0)\n return (this.negative = 0), (r = this.isub(num)), (this.negative ^= 1), this._normSign();\n if (this.negative === 0 && num.negative !== 0)\n return (num.negative = 0), (r = this.isub(num)), (num.negative = 1), r._normSign();\n var a, b;\n this.length > num.length ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var carry = 0, i = 0; i < b.length; i++)\n (r = (a.words[i] | 0) + (b.words[i] | 0) + carry), (this.words[i] = r & 67108863), (carry = r >>> 26);\n for (; carry !== 0 && i < a.length; i++)\n (r = (a.words[i] | 0) + carry), (this.words[i] = r & 67108863), (carry = r >>> 26);\n if (((this.length = a.length), carry !== 0)) (this.words[this.length] = carry), this.length++;\n else if (a !== this) for (; i < a.length; i++) this.words[i] = a.words[i];\n return this;\n }),\n (BN.prototype.add = function (num) {\n var res;\n return num.negative !== 0 && this.negative === 0\n ? ((num.negative = 0), (res = this.sub(num)), (num.negative ^= 1), res)\n : num.negative === 0 && this.negative !== 0\n ? ((this.negative = 0), (res = num.sub(this)), (this.negative = 1), res)\n : this.length > num.length\n ? this.clone().iadd(num)\n : num.clone().iadd(this);\n }),\n (BN.prototype.isub = function (num) {\n if (num.negative !== 0) {\n num.negative = 0;\n var r = this.iadd(num);\n return (num.negative = 1), r._normSign();\n } else if (this.negative !== 0)\n return (this.negative = 0), this.iadd(num), (this.negative = 1), this._normSign();\n var cmp = this.cmp(num);\n if (cmp === 0) return (this.negative = 0), (this.length = 1), (this.words[0] = 0), this;\n var a, b;\n cmp > 0 ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var carry = 0, i = 0; i < b.length; i++)\n (r = (a.words[i] | 0) - (b.words[i] | 0) + carry), (carry = r >> 26), (this.words[i] = r & 67108863);\n for (; carry !== 0 && i < a.length; i++)\n (r = (a.words[i] | 0) + carry), (carry = r >> 26), (this.words[i] = r & 67108863);\n if (carry === 0 && i < a.length && a !== this) for (; i < a.length; i++) this.words[i] = a.words[i];\n return (this.length = Math.max(this.length, i)), a !== this && (this.negative = 1), this.strip();\n }),\n (BN.prototype.sub = function (num) {\n return this.clone().isub(num);\n });\n function smallMulTo(self2, num, out) {\n out.negative = num.negative ^ self2.negative;\n var len = (self2.length + num.length) | 0;\n (out.length = len), (len = (len - 1) | 0);\n var a = self2.words[0] | 0,\n b = num.words[0] | 0,\n r = a * b,\n lo = r & 67108863,\n carry = (r / 67108864) | 0;\n out.words[0] = lo;\n for (var k = 1; k < len; k++) {\n for (\n var ncarry = carry >>> 26,\n rword = carry & 67108863,\n maxJ = Math.min(k, num.length - 1),\n j = Math.max(0, k - self2.length + 1);\n j <= maxJ;\n j++\n ) {\n var i = (k - j) | 0;\n (a = self2.words[i] | 0),\n (b = num.words[j] | 0),\n (r = a * b + rword),\n (ncarry += (r / 67108864) | 0),\n (rword = r & 67108863);\n }\n (out.words[k] = rword | 0), (carry = ncarry | 0);\n }\n return carry !== 0 ? (out.words[k] = carry | 0) : out.length--, out.strip();\n }\n var comb10MulTo = function (self2, num, out) {\n var a = self2.words,\n b = num.words,\n o = out.words,\n c = 0,\n lo,\n mid,\n hi,\n a0 = a[0] | 0,\n al0 = a0 & 8191,\n ah0 = a0 >>> 13,\n a1 = a[1] | 0,\n al1 = a1 & 8191,\n ah1 = a1 >>> 13,\n a2 = a[2] | 0,\n al2 = a2 & 8191,\n ah2 = a2 >>> 13,\n a3 = a[3] | 0,\n al3 = a3 & 8191,\n ah3 = a3 >>> 13,\n a4 = a[4] | 0,\n al4 = a4 & 8191,\n ah4 = a4 >>> 13,\n a5 = a[5] | 0,\n al5 = a5 & 8191,\n ah5 = a5 >>> 13,\n a6 = a[6] | 0,\n al6 = a6 & 8191,\n ah6 = a6 >>> 13,\n a7 = a[7] | 0,\n al7 = a7 & 8191,\n ah7 = a7 >>> 13,\n a8 = a[8] | 0,\n al8 = a8 & 8191,\n ah8 = a8 >>> 13,\n a9 = a[9] | 0,\n al9 = a9 & 8191,\n ah9 = a9 >>> 13,\n b0 = b[0] | 0,\n bl0 = b0 & 8191,\n bh0 = b0 >>> 13,\n b1 = b[1] | 0,\n bl1 = b1 & 8191,\n bh1 = b1 >>> 13,\n b2 = b[2] | 0,\n bl2 = b2 & 8191,\n bh2 = b2 >>> 13,\n b3 = b[3] | 0,\n bl3 = b3 & 8191,\n bh3 = b3 >>> 13,\n b4 = b[4] | 0,\n bl4 = b4 & 8191,\n bh4 = b4 >>> 13,\n b5 = b[5] | 0,\n bl5 = b5 & 8191,\n bh5 = b5 >>> 13,\n b6 = b[6] | 0,\n bl6 = b6 & 8191,\n bh6 = b6 >>> 13,\n b7 = b[7] | 0,\n bl7 = b7 & 8191,\n bh7 = b7 >>> 13,\n b8 = b[8] | 0,\n bl8 = b8 & 8191,\n bh8 = b8 >>> 13,\n b9 = b[9] | 0,\n bl9 = b9 & 8191,\n bh9 = b9 >>> 13;\n (out.negative = self2.negative ^ num.negative),\n (out.length = 19),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w0 >>> 26)) | 0),\n (w0 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w1 >>> 26)) | 0),\n (w1 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w2 >>> 26)) | 0),\n (w2 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w3 >>> 26)) | 0),\n (w3 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w4 >>> 26)) | 0),\n (w4 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w5 >>> 26)) | 0),\n (w5 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w6 >>> 26)) | 0),\n (w6 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w7 >>> 26)) | 0),\n (w7 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w8 >>> 26)) | 0),\n (w8 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w9 >>> 26)) | 0),\n (w9 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w10 >>> 26)) | 0),\n (w10 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w11 >>> 26)) | 0),\n (w11 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w12 >>> 26)) | 0),\n (w12 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w13 >>> 26)) | 0),\n (w13 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w14 >>> 26)) | 0),\n (w14 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w15 >>> 26)) | 0),\n (w15 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w16 >>> 26)) | 0),\n (w16 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w17 >>> 26)) | 0),\n (w17 &= 67108863),\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 & 8191) << 13)) | 0;\n return (\n (c = (((hi + (mid >>> 13)) | 0) + (w18 >>> 26)) | 0),\n (w18 &= 67108863),\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 c !== 0 && ((o[19] = c), out.length++),\n out\n );\n };\n Math.imul || (comb10MulTo = smallMulTo);\n function bigMulTo(self2, num, out) {\n (out.negative = num.negative ^ self2.negative), (out.length = self2.length + num.length);\n for (var carry = 0, hncarry = 0, k = 0; k < out.length - 1; k++) {\n var ncarry = hncarry;\n hncarry = 0;\n for (\n var rword = carry & 67108863, maxJ = Math.min(k, num.length - 1), j = Math.max(0, k - self2.length + 1);\n j <= maxJ;\n j++\n ) {\n var i = k - j,\n a = self2.words[i] | 0,\n b = num.words[j] | 0,\n r = a * b,\n lo = r & 67108863;\n (ncarry = (ncarry + ((r / 67108864) | 0)) | 0),\n (lo = (lo + rword) | 0),\n (rword = lo & 67108863),\n (ncarry = (ncarry + (lo >>> 26)) | 0),\n (hncarry += ncarry >>> 26),\n (ncarry &= 67108863);\n }\n (out.words[k] = rword), (carry = ncarry), (ncarry = hncarry);\n }\n return carry !== 0 ? (out.words[k] = carry) : out.length--, out.strip();\n }\n function jumboMulTo(self2, num, out) {\n var fftm = new FFTM();\n return fftm.mulp(self2, num, out);\n }\n BN.prototype.mulTo = function (num, out) {\n var res,\n len = this.length + num.length;\n return (\n this.length === 10 && num.length === 10\n ? (res = comb10MulTo(this, num, out))\n : len < 63\n ? (res = smallMulTo(this, num, out))\n : len < 1024\n ? (res = bigMulTo(this, num, out))\n : (res = jumboMulTo(this, num, out)),\n res\n );\n };\n function FFTM(x, y) {\n (this.x = x), (this.y = y);\n }\n (FFTM.prototype.makeRBT = function (N) {\n for (var t = new Array(N), l = BN.prototype._countBits(N) - 1, i = 0; i < N; i++) t[i] = this.revBin(i, l, N);\n return t;\n }),\n (FFTM.prototype.revBin = function (x, l, N) {\n if (x === 0 || x === N - 1) return x;\n for (var rb = 0, i = 0; i < l; i++) (rb |= (x & 1) << (l - i - 1)), (x >>= 1);\n return rb;\n }),\n (FFTM.prototype.permute = function (rbt, rws, iws, rtws, itws, N) {\n for (var i = 0; i < N; i++) (rtws[i] = rws[rbt[i]]), (itws[i] = iws[rbt[i]]);\n }),\n (FFTM.prototype.transform = function (rws, iws, rtws, itws, N, rbt) {\n this.permute(rbt, rws, iws, rtws, itws, N);\n for (var s = 1; s < N; s <<= 1)\n for (\n var l = s << 1, rtwdf = Math.cos((2 * Math.PI) / l), itwdf = Math.sin((2 * Math.PI) / l), p = 0;\n p < N;\n p += l\n )\n for (var rtwdf_ = rtwdf, itwdf_ = itwdf, j = 0; j < s; j++) {\n var re = rtws[p + j],\n ie = itws[p + j],\n ro = rtws[p + j + s],\n io = itws[p + j + s],\n rx = rtwdf_ * ro - itwdf_ * io;\n (io = rtwdf_ * io + itwdf_ * ro),\n (ro = rx),\n (rtws[p + j] = re + ro),\n (itws[p + j] = ie + io),\n (rtws[p + j + s] = re - ro),\n (itws[p + j + s] = ie - io),\n j !== l &&\n ((rx = rtwdf * rtwdf_ - itwdf * itwdf_), (itwdf_ = rtwdf * itwdf_ + itwdf * rtwdf_), (rtwdf_ = rx));\n }\n }),\n (FFTM.prototype.guessLen13b = function (n, m) {\n var N = Math.max(m, n) | 1,\n odd = N & 1,\n i = 0;\n for (N = (N / 2) | 0; N; N = N >>> 1) i++;\n return 1 << (i + 1 + odd);\n }),\n (FFTM.prototype.conjugate = function (rws, iws, N) {\n if (!(N <= 1))\n for (var i = 0; i < N / 2; i++) {\n var t = rws[i];\n (rws[i] = rws[N - i - 1]),\n (rws[N - i - 1] = t),\n (t = iws[i]),\n (iws[i] = -iws[N - i - 1]),\n (iws[N - i - 1] = -t);\n }\n }),\n (FFTM.prototype.normalize13b = function (ws, N) {\n for (var carry = 0, i = 0; i < N / 2; i++) {\n var w = Math.round(ws[2 * i + 1] / N) * 8192 + Math.round(ws[2 * i] / N) + carry;\n (ws[i] = w & 67108863), w < 67108864 ? (carry = 0) : (carry = (w / 67108864) | 0);\n }\n return ws;\n }),\n (FFTM.prototype.convert13b = function (ws, len, rws, N) {\n for (var carry = 0, i = 0; i < len; i++)\n (carry = carry + (ws[i] | 0)),\n (rws[2 * i] = carry & 8191),\n (carry = carry >>> 13),\n (rws[2 * i + 1] = carry & 8191),\n (carry = carry >>> 13);\n for (i = 2 * len; i < N; ++i) rws[i] = 0;\n assert(carry === 0), assert((carry & -8192) === 0);\n }),\n (FFTM.prototype.stub = function (N) {\n for (var ph = new Array(N), i = 0; i < N; i++) ph[i] = 0;\n return ph;\n }),\n (FFTM.prototype.mulp = function (x, y, out) {\n var N = 2 * this.guessLen13b(x.length, y.length),\n rbt = this.makeRBT(N),\n _ = this.stub(N),\n rws = new Array(N),\n rwst = new Array(N),\n iwst = new Array(N),\n nrws = new Array(N),\n nrwst = new Array(N),\n niwst = new Array(N),\n rmws = out.words;\n (rmws.length = N),\n this.convert13b(x.words, x.length, rws, N),\n this.convert13b(y.words, y.length, nrws, N),\n this.transform(rws, _, rwst, iwst, N, rbt),\n this.transform(nrws, _, nrwst, niwst, N, rbt);\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]), (rwst[i] = rx);\n }\n return (\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 (out.negative = x.negative ^ y.negative),\n (out.length = x.length + y.length),\n out.strip()\n );\n }),\n (BN.prototype.mul = function (num) {\n var out = new BN(null);\n return (out.words = new Array(this.length + num.length)), this.mulTo(num, out);\n }),\n (BN.prototype.mulf = function (num) {\n var out = new BN(null);\n return (out.words = new Array(this.length + num.length)), jumboMulTo(this, num, out);\n }),\n (BN.prototype.imul = function (num) {\n return this.clone().mulTo(num, this);\n }),\n (BN.prototype.imuln = function (num) {\n assert(typeof num == \"number\"), assert(num < 67108864);\n for (var carry = 0, i = 0; i < this.length; i++) {\n var w = (this.words[i] | 0) * num,\n lo = (w & 67108863) + (carry & 67108863);\n (carry >>= 26), (carry += (w / 67108864) | 0), (carry += lo >>> 26), (this.words[i] = lo & 67108863);\n }\n return carry !== 0 && ((this.words[i] = carry), this.length++), this;\n }),\n (BN.prototype.muln = function (num) {\n return this.clone().imuln(num);\n }),\n (BN.prototype.sqr = function () {\n return this.mul(this);\n }),\n (BN.prototype.isqr = function () {\n return this.imul(this.clone());\n }),\n (BN.prototype.pow = function (num) {\n var w = toBitArray(num);\n if (w.length === 0) return new BN(1);\n for (var res = this, i = 0; i < w.length && w[i] === 0; i++, res = res.sqr());\n if (++i < w.length) for (var q = res.sqr(); i < w.length; i++, q = q.sqr()) w[i] !== 0 && (res = res.mul(q));\n return res;\n }),\n (BN.prototype.iushln = function (bits) {\n assert(typeof bits == \"number\" && bits >= 0);\n var r = bits % 26,\n s = (bits - r) / 26,\n carryMask = (67108863 >>> (26 - r)) << (26 - r),\n i;\n if (r !== 0) {\n var carry = 0;\n for (i = 0; i < this.length; i++) {\n var newCarry = this.words[i] & carryMask,\n c = ((this.words[i] | 0) - newCarry) << r;\n (this.words[i] = c | carry), (carry = newCarry >>> (26 - r));\n }\n carry && ((this.words[i] = carry), this.length++);\n }\n if (s !== 0) {\n for (i = this.length - 1; i >= 0; i--) this.words[i + s] = this.words[i];\n for (i = 0; i < s; i++) this.words[i] = 0;\n this.length += s;\n }\n return this.strip();\n }),\n (BN.prototype.ishln = function (bits) {\n return assert(this.negative === 0), this.iushln(bits);\n }),\n (BN.prototype.iushrn = function (bits, hint, extended) {\n assert(typeof bits == \"number\" && bits >= 0);\n var h;\n hint ? (h = (hint - (hint % 26)) / 26) : (h = 0);\n var r = bits % 26,\n s = Math.min((bits - r) / 26, this.length),\n mask = 67108863 ^ ((67108863 >>> r) << r),\n maskedWords = extended;\n if (((h -= s), (h = Math.max(0, h)), maskedWords)) {\n for (var i = 0; i < s; i++) maskedWords.words[i] = this.words[i];\n maskedWords.length = s;\n }\n if (s !== 0)\n if (this.length > s) for (this.length -= s, i = 0; i < this.length; i++) this.words[i] = this.words[i + s];\n else (this.words[0] = 0), (this.length = 1);\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)), (carry = word & mask);\n }\n return (\n maskedWords && carry !== 0 && (maskedWords.words[maskedWords.length++] = carry),\n this.length === 0 && ((this.words[0] = 0), (this.length = 1)),\n this.strip()\n );\n }),\n (BN.prototype.ishrn = function (bits, hint, extended) {\n return assert(this.negative === 0), this.iushrn(bits, hint, extended);\n }),\n (BN.prototype.shln = function (bits) {\n return this.clone().ishln(bits);\n }),\n (BN.prototype.ushln = function (bits) {\n return this.clone().iushln(bits);\n }),\n (BN.prototype.shrn = function (bits) {\n return this.clone().ishrn(bits);\n }),\n (BN.prototype.ushrn = function (bits) {\n return this.clone().iushrn(bits);\n }),\n (BN.prototype.testn = function (bit) {\n assert(typeof bit == \"number\" && bit >= 0);\n var r = bit % 26,\n s = (bit - r) / 26,\n q = 1 << r;\n if (this.length <= s) return !1;\n var w = this.words[s];\n return !!(w & q);\n }),\n (BN.prototype.imaskn = function (bits) {\n assert(typeof bits == \"number\" && bits >= 0);\n var r = bits % 26,\n s = (bits - r) / 26;\n if ((assert(this.negative === 0, \"imaskn works only with positive numbers\"), this.length <= s)) return this;\n if ((r !== 0 && s++, (this.length = Math.min(s, this.length)), r !== 0)) {\n var mask = 67108863 ^ ((67108863 >>> r) << r);\n this.words[this.length - 1] &= mask;\n }\n return this.strip();\n }),\n (BN.prototype.maskn = function (bits) {\n return this.clone().imaskn(bits);\n }),\n (BN.prototype.iaddn = function (num) {\n return (\n assert(typeof num == \"number\"),\n assert(num < 67108864),\n num < 0\n ? this.isubn(-num)\n : this.negative !== 0\n ? this.length === 1 && (this.words[0] | 0) < num\n ? ((this.words[0] = num - (this.words[0] | 0)), (this.negative = 0), this)\n : ((this.negative = 0), this.isubn(num), (this.negative = 1), this)\n : this._iaddn(num)\n );\n }),\n (BN.prototype._iaddn = function (num) {\n this.words[0] += num;\n for (var i = 0; i < this.length && this.words[i] >= 67108864; i++)\n (this.words[i] -= 67108864), i === this.length - 1 ? (this.words[i + 1] = 1) : this.words[i + 1]++;\n return (this.length = Math.max(this.length, i + 1)), this;\n }),\n (BN.prototype.isubn = function (num) {\n if ((assert(typeof num == \"number\"), assert(num < 67108864), num < 0)) return this.iaddn(-num);\n if (this.negative !== 0) return (this.negative = 0), this.iaddn(num), (this.negative = 1), this;\n if (((this.words[0] -= num), this.length === 1 && this.words[0] < 0))\n (this.words[0] = -this.words[0]), (this.negative = 1);\n else\n for (var i = 0; i < this.length && this.words[i] < 0; i++)\n (this.words[i] += 67108864), (this.words[i + 1] -= 1);\n return this.strip();\n }),\n (BN.prototype.addn = function (num) {\n return this.clone().iaddn(num);\n }),\n (BN.prototype.subn = function (num) {\n return this.clone().isubn(num);\n }),\n (BN.prototype.iabs = function () {\n return (this.negative = 0), this;\n }),\n (BN.prototype.abs = function () {\n return this.clone().iabs();\n }),\n (BN.prototype._ishlnsubmul = function (num, mul, shift) {\n var len = num.length + shift,\n i;\n this._expand(len);\n var w,\n 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 & 67108863),\n (carry = (w >> 26) - ((right / 67108864) | 0)),\n (this.words[i + shift] = w & 67108863);\n }\n for (; i < this.length - shift; i++)\n (w = (this.words[i + shift] | 0) + carry), (carry = w >> 26), (this.words[i + shift] = w & 67108863);\n if (carry === 0) return this.strip();\n for (assert(carry === -1), carry = 0, i = 0; i < this.length; i++)\n (w = -(this.words[i] | 0) + carry), (carry = w >> 26), (this.words[i] = w & 67108863);\n return (this.negative = 1), this.strip();\n }),\n (BN.prototype._wordDiv = function (num, mode) {\n var shift = this.length - num.length,\n a = this.clone(),\n b = num,\n bhi = b.words[b.length - 1] | 0,\n bhiBits = this._countBits(bhi);\n (shift = 26 - bhiBits),\n shift !== 0 && ((b = b.ushln(shift)), a.iushln(shift), (bhi = b.words[b.length - 1] | 0));\n var m = a.length - b.length,\n q;\n if (mode !== \"mod\") {\n (q = new BN(null)), (q.length = m + 1), (q.words = new Array(q.length));\n for (var i = 0; i < q.length; i++) q.words[i] = 0;\n }\n var diff = a.clone()._ishlnsubmul(b, 1, m);\n diff.negative === 0 && ((a = diff), q && (q.words[m] = 1));\n for (var j = m - 1; j >= 0; j--) {\n var qj = (a.words[b.length + j] | 0) * 67108864 + (a.words[b.length + j - 1] | 0);\n for (qj = Math.min((qj / bhi) | 0, 67108863), a._ishlnsubmul(b, qj, j); a.negative !== 0; )\n qj--, (a.negative = 0), a._ishlnsubmul(b, 1, j), a.isZero() || (a.negative ^= 1);\n q && (q.words[j] = qj);\n }\n return (\n q && q.strip(),\n a.strip(),\n mode !== \"div\" && shift !== 0 && a.iushrn(shift),\n {\n div: q || null,\n mod: a,\n }\n );\n }),\n (BN.prototype.divmod = function (num, mode, positive) {\n if ((assert(!num.isZero()), this.isZero()))\n return {\n div: new BN(0),\n mod: new BN(0),\n };\n var div, mod, res;\n return this.negative !== 0 && num.negative === 0\n ? ((res = this.neg().divmod(num, mode)),\n mode !== \"mod\" && (div = res.div.neg()),\n mode !== \"div\" && ((mod = res.mod.neg()), positive && mod.negative !== 0 && mod.iadd(num)),\n {\n div,\n mod,\n })\n : this.negative === 0 && num.negative !== 0\n ? ((res = this.divmod(num.neg(), mode)),\n mode !== \"mod\" && (div = res.div.neg()),\n {\n div,\n mod: res.mod,\n })\n : (this.negative & num.negative) !== 0\n ? ((res = this.neg().divmod(num.neg(), mode)),\n mode !== \"div\" && ((mod = res.mod.neg()), positive && mod.negative !== 0 && mod.isub(num)),\n {\n div: res.div,\n mod,\n })\n : num.length > this.length || this.cmp(num) < 0\n ? {\n div: new BN(0),\n mod: this,\n }\n : num.length === 1\n ? mode === \"div\"\n ? {\n div: this.divn(num.words[0]),\n mod: null,\n }\n : mode === \"mod\"\n ? {\n div: null,\n mod: new BN(this.modn(num.words[0])),\n }\n : {\n div: this.divn(num.words[0]),\n mod: new BN(this.modn(num.words[0])),\n }\n : this._wordDiv(num, mode);\n }),\n (BN.prototype.div = function (num) {\n return this.divmod(num, \"div\", !1).div;\n }),\n (BN.prototype.mod = function (num) {\n return this.divmod(num, \"mod\", !1).mod;\n }),\n (BN.prototype.umod = function (num) {\n return this.divmod(num, \"mod\", !0).mod;\n }),\n (BN.prototype.divRound = function (num) {\n var dm = this.divmod(num);\n if (dm.mod.isZero()) return dm.div;\n var mod = dm.div.negative !== 0 ? dm.mod.isub(num) : dm.mod,\n half = num.ushrn(1),\n r2 = num.andln(1),\n cmp = mod.cmp(half);\n return cmp < 0 || (r2 === 1 && cmp === 0)\n ? dm.div\n : dm.div.negative !== 0\n ? dm.div.isubn(1)\n : dm.div.iaddn(1);\n }),\n (BN.prototype.modn = function (num) {\n assert(num <= 67108863);\n for (var p = (1 << 26) % num, acc = 0, i = this.length - 1; i >= 0; i--)\n acc = (p * acc + (this.words[i] | 0)) % num;\n return acc;\n }),\n (BN.prototype.idivn = function (num) {\n assert(num <= 67108863);\n for (var carry = 0, i = this.length - 1; i >= 0; i--) {\n var w = (this.words[i] | 0) + carry * 67108864;\n (this.words[i] = (w / num) | 0), (carry = w % num);\n }\n return this.strip();\n }),\n (BN.prototype.divn = function (num) {\n return this.clone().idivn(num);\n }),\n (BN.prototype.egcd = function (p) {\n assert(p.negative === 0), assert(!p.isZero());\n var x = this,\n y = p.clone();\n x.negative !== 0 ? (x = x.umod(p)) : (x = x.clone());\n for (var A = new BN(1), B = new BN(0), C = new BN(0), D = new BN(1), g = 0; x.isEven() && y.isEven(); )\n x.iushrn(1), y.iushrn(1), ++g;\n for (var yp = y.clone(), xp = x.clone(); !x.isZero(); ) {\n for (var i = 0, im = 1; (x.words[0] & im) === 0 && i < 26; ++i, im <<= 1);\n if (i > 0)\n for (x.iushrn(i); i-- > 0; )\n (A.isOdd() || B.isOdd()) && (A.iadd(yp), B.isub(xp)), A.iushrn(1), B.iushrn(1);\n for (var j = 0, jm = 1; (y.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n if (j > 0)\n for (y.iushrn(j); j-- > 0; )\n (C.isOdd() || D.isOdd()) && (C.iadd(yp), D.isub(xp)), C.iushrn(1), D.iushrn(1);\n x.cmp(y) >= 0 ? (x.isub(y), A.isub(C), B.isub(D)) : (y.isub(x), C.isub(A), D.isub(B));\n }\n return {\n a: C,\n b: D,\n gcd: y.iushln(g),\n };\n }),\n (BN.prototype._invmp = function (p) {\n assert(p.negative === 0), assert(!p.isZero());\n var a = this,\n b = p.clone();\n a.negative !== 0 ? (a = a.umod(p)) : (a = a.clone());\n for (var x1 = new BN(1), x2 = new BN(0), delta = b.clone(); 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) for (a.iushrn(i); i-- > 0; ) x1.isOdd() && x1.iadd(delta), x1.iushrn(1);\n for (var j = 0, jm = 1; (b.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n if (j > 0) for (b.iushrn(j); j-- > 0; ) x2.isOdd() && x2.iadd(delta), x2.iushrn(1);\n a.cmp(b) >= 0 ? (a.isub(b), x1.isub(x2)) : (b.isub(a), x2.isub(x1));\n }\n var res;\n return a.cmpn(1) === 0 ? (res = x1) : (res = x2), res.cmpn(0) < 0 && res.iadd(p), res;\n }),\n (BN.prototype.gcd = function (num) {\n if (this.isZero()) return num.abs();\n if (num.isZero()) return this.abs();\n var a = this.clone(),\n b = num.clone();\n (a.negative = 0), (b.negative = 0);\n for (var shift = 0; a.isEven() && b.isEven(); shift++) a.iushrn(1), b.iushrn(1);\n do {\n for (; a.isEven(); ) a.iushrn(1);\n for (; b.isEven(); ) b.iushrn(1);\n var r = a.cmp(b);\n if (r < 0) {\n var t = a;\n (a = b), (b = t);\n } else if (r === 0 || b.cmpn(1) === 0) break;\n a.isub(b);\n } while (!0);\n return b.iushln(shift);\n }),\n (BN.prototype.invm = function (num) {\n return this.egcd(num).a.umod(num);\n }),\n (BN.prototype.isEven = function () {\n return (this.words[0] & 1) === 0;\n }),\n (BN.prototype.isOdd = function () {\n return (this.words[0] & 1) === 1;\n }),\n (BN.prototype.andln = function (num) {\n return this.words[0] & num;\n }),\n (BN.prototype.bincn = function (bit) {\n assert(typeof bit == \"number\");\n var r = bit % 26,\n s = (bit - r) / 26,\n q = 1 << r;\n if (this.length <= s) return this._expand(s + 1), (this.words[s] |= q), this;\n for (var carry = q, i = s; carry !== 0 && i < this.length; i++) {\n var w = this.words[i] | 0;\n (w += carry), (carry = w >>> 26), (w &= 67108863), (this.words[i] = w);\n }\n return carry !== 0 && ((this.words[i] = carry), this.length++), this;\n }),\n (BN.prototype.isZero = function () {\n return this.length === 1 && this.words[0] === 0;\n }),\n (BN.prototype.cmpn = function (num) {\n var negative = num < 0;\n if (this.negative !== 0 && !negative) return -1;\n if (this.negative === 0 && negative) return 1;\n this.strip();\n var res;\n if (this.length > 1) res = 1;\n else {\n negative && (num = -num), assert(num <= 67108863, \"Number is too big\");\n var w = this.words[0] | 0;\n res = w === num ? 0 : w < num ? -1 : 1;\n }\n return this.negative !== 0 ? -res | 0 : res;\n }),\n (BN.prototype.cmp = function (num) {\n if (this.negative !== 0 && num.negative === 0) return -1;\n if (this.negative === 0 && num.negative !== 0) return 1;\n var res = this.ucmp(num);\n return this.negative !== 0 ? -res | 0 : res;\n }),\n (BN.prototype.ucmp = function (num) {\n if (this.length > num.length) return 1;\n if (this.length < num.length) return -1;\n for (var res = 0, i = this.length - 1; i >= 0; i--) {\n var a = this.words[i] | 0,\n b = num.words[i] | 0;\n if (a !== b) {\n a < b ? (res = -1) : a > b && (res = 1);\n break;\n }\n }\n return res;\n }),\n (BN.prototype.gtn = function (num) {\n return this.cmpn(num) === 1;\n }),\n (BN.prototype.gt = function (num) {\n return this.cmp(num) === 1;\n }),\n (BN.prototype.gten = function (num) {\n return this.cmpn(num) >= 0;\n }),\n (BN.prototype.gte = function (num) {\n return this.cmp(num) >= 0;\n }),\n (BN.prototype.ltn = function (num) {\n return this.cmpn(num) === -1;\n }),\n (BN.prototype.lt = function (num) {\n return this.cmp(num) === -1;\n }),\n (BN.prototype.lten = function (num) {\n return this.cmpn(num) <= 0;\n }),\n (BN.prototype.lte = function (num) {\n return this.cmp(num) <= 0;\n }),\n (BN.prototype.eqn = function (num) {\n return this.cmpn(num) === 0;\n }),\n (BN.prototype.eq = function (num) {\n return this.cmp(num) === 0;\n }),\n (BN.red = function (num) {\n return new Red(num);\n }),\n (BN.prototype.toRed = function (ctx) {\n return (\n assert(!this.red, \"Already a number in reduction context\"),\n assert(this.negative === 0, \"red works only with positives\"),\n ctx.convertTo(this)._forceRed(ctx)\n );\n }),\n (BN.prototype.fromRed = function () {\n return assert(this.red, \"fromRed works only with numbers in reduction context\"), this.red.convertFrom(this);\n }),\n (BN.prototype._forceRed = function (ctx) {\n return (this.red = ctx), this;\n }),\n (BN.prototype.forceRed = function (ctx) {\n return assert(!this.red, \"Already a number in reduction context\"), this._forceRed(ctx);\n }),\n (BN.prototype.redAdd = function (num) {\n return assert(this.red, \"redAdd works only with red numbers\"), this.red.add(this, num);\n }),\n (BN.prototype.redIAdd = function (num) {\n return assert(this.red, \"redIAdd works only with red numbers\"), this.red.iadd(this, num);\n }),\n (BN.prototype.redSub = function (num) {\n return assert(this.red, \"redSub works only with red numbers\"), this.red.sub(this, num);\n }),\n (BN.prototype.redISub = function (num) {\n return assert(this.red, \"redISub works only with red numbers\"), this.red.isub(this, num);\n }),\n (BN.prototype.redShl = function (num) {\n return assert(this.red, \"redShl works only with red numbers\"), this.red.shl(this, num);\n }),\n (BN.prototype.redMul = function (num) {\n return (\n assert(this.red, \"redMul works only with red numbers\"),\n this.red._verify2(this, num),\n this.red.mul(this, num)\n );\n }),\n (BN.prototype.redIMul = function (num) {\n return (\n assert(this.red, \"redMul works only with red numbers\"),\n this.red._verify2(this, num),\n this.red.imul(this, num)\n );\n }),\n (BN.prototype.redSqr = function () {\n return assert(this.red, \"redSqr works only with red numbers\"), this.red._verify1(this), this.red.sqr(this);\n }),\n (BN.prototype.redISqr = function () {\n return assert(this.red, \"redISqr works only with red numbers\"), this.red._verify1(this), this.red.isqr(this);\n }),\n (BN.prototype.redSqrt = function () {\n return assert(this.red, \"redSqrt works only with red numbers\"), this.red._verify1(this), this.red.sqrt(this);\n }),\n (BN.prototype.redInvm = function () {\n return assert(this.red, \"redInvm works only with red numbers\"), this.red._verify1(this), this.red.invm(this);\n }),\n (BN.prototype.redNeg = function () {\n return assert(this.red, \"redNeg works only with red numbers\"), this.red._verify1(this), this.red.neg(this);\n }),\n (BN.prototype.redPow = function (num) {\n return assert(this.red && !num.red, \"redPow(normalNum)\"), this.red._verify1(this), this.red.pow(this, num);\n });\n var primes = {\n k256: null,\n p224: null,\n p192: null,\n p25519: null,\n };\n function MPrime(name, p) {\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 (this.tmp = this._tmp());\n }\n (MPrime.prototype._tmp = function () {\n var tmp = new BN(null);\n return (tmp.words = new Array(Math.ceil(this.n / 13))), tmp;\n }),\n (MPrime.prototype.ireduce = function (num) {\n var r = num,\n rlen;\n do this.split(r, this.tmp), (r = this.imulK(r)), (r = r.iadd(this.tmp)), (rlen = r.bitLength());\n while (rlen > this.n);\n var cmp = rlen < this.n ? -1 : r.ucmp(this.p);\n return (\n cmp === 0\n ? ((r.words[0] = 0), (r.length = 1))\n : cmp > 0\n ? r.isub(this.p)\n : r.strip !== void 0\n ? r.strip()\n : r._strip(),\n r\n );\n }),\n (MPrime.prototype.split = function (input, out) {\n input.iushrn(this.n, 0, out);\n }),\n (MPrime.prototype.imulK = function (num) {\n return num.imul(this.k);\n });\n function K256() {\n MPrime.call(this, \"k256\", \"ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f\");\n }\n inherits(K256, MPrime),\n (K256.prototype.split = function (input, output) {\n for (var mask = 4194303, outLen = Math.min(input.length, 9), i = 0; i < outLen; i++)\n output.words[i] = input.words[i];\n if (((output.length = outLen), input.length <= 9)) {\n (input.words[0] = 0), (input.length = 1);\n return;\n }\n var prev = input.words[9];\n for (output.words[output.length++] = prev & mask, i = 10; i < input.length; i++) {\n var next = input.words[i] | 0;\n (input.words[i - 10] = ((next & mask) << 4) | (prev >>> 22)), (prev = next);\n }\n (prev >>>= 22),\n (input.words[i - 10] = prev),\n prev === 0 && input.length > 10 ? (input.length -= 10) : (input.length -= 9);\n }),\n (K256.prototype.imulK = function (num) {\n (num.words[num.length] = 0), (num.words[num.length + 1] = 0), (num.length += 2);\n for (var lo = 0, i = 0; i < num.length; i++) {\n var w = num.words[i] | 0;\n (lo += w * 977), (num.words[i] = lo & 67108863), (lo = w * 64 + ((lo / 67108864) | 0));\n }\n return (\n num.words[num.length - 1] === 0 && (num.length--, num.words[num.length - 1] === 0 && num.length--), num\n );\n });\n function P224() {\n MPrime.call(this, \"p224\", \"ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001\");\n }\n inherits(P224, MPrime);\n function P192() {\n MPrime.call(this, \"p192\", \"ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff\");\n }\n inherits(P192, MPrime);\n function P25519() {\n MPrime.call(this, \"25519\", \"7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed\");\n }\n inherits(P25519, MPrime),\n (P25519.prototype.imulK = function (num) {\n for (var carry = 0, i = 0; i < num.length; i++) {\n var hi = (num.words[i] | 0) * 19 + carry,\n lo = hi & 67108863;\n (hi >>>= 26), (num.words[i] = lo), (carry = hi);\n }\n return carry !== 0 && (num.words[num.length++] = carry), num;\n }),\n (BN._prime = function (name) {\n if (primes[name]) return primes[name];\n var prime2;\n if (name === \"k256\") prime2 = new K256();\n else if (name === \"p224\") prime2 = new P224();\n else if (name === \"p192\") prime2 = new P192();\n else if (name === \"p25519\") prime2 = new P25519();\n else throw new Error(\"Unknown prime \" + name);\n return (primes[name] = prime2), prime2;\n });\n function Red(m) {\n if (typeof m == \"string\") {\n var prime = BN._prime(m);\n (this.m = prime.p), (this.prime = prime);\n } else assert(m.gtn(1), \"modulus must be greater than 1\"), (this.m = m), (this.prime = null);\n }\n (Red.prototype._verify1 = function (a) {\n assert(a.negative === 0, \"red works only with positives\"), assert(a.red, \"red works only with red numbers\");\n }),\n (Red.prototype._verify2 = function (a, b) {\n assert((a.negative | b.negative) === 0, \"red works only with positives\"),\n assert(a.red && a.red === b.red, \"red works only with red numbers\");\n }),\n (Red.prototype.imod = function (a) {\n return this.prime ? this.prime.ireduce(a)._forceRed(this) : a.umod(this.m)._forceRed(this);\n }),\n (Red.prototype.neg = function (a) {\n return a.isZero() ? a.clone() : this.m.sub(a)._forceRed(this);\n }),\n (Red.prototype.add = function (a, b) {\n this._verify2(a, b);\n var res = a.add(b);\n return res.cmp(this.m) >= 0 && res.isub(this.m), res._forceRed(this);\n }),\n (Red.prototype.iadd = function (a, b) {\n this._verify2(a, b);\n var res = a.iadd(b);\n return res.cmp(this.m) >= 0 && res.isub(this.m), res;\n }),\n (Red.prototype.sub = function (a, b) {\n this._verify2(a, b);\n var res = a.sub(b);\n return res.cmpn(0) < 0 && res.iadd(this.m), res._forceRed(this);\n }),\n (Red.prototype.isub = function (a, b) {\n this._verify2(a, b);\n var res = a.isub(b);\n return res.cmpn(0) < 0 && res.iadd(this.m), res;\n }),\n (Red.prototype.shl = function (a, num) {\n return this._verify1(a), this.imod(a.ushln(num));\n }),\n (Red.prototype.imul = function (a, b) {\n return this._verify2(a, b), this.imod(a.imul(b));\n }),\n (Red.prototype.mul = function (a, b) {\n return this._verify2(a, b), this.imod(a.mul(b));\n }),\n (Red.prototype.isqr = function (a) {\n return this.imul(a, a.clone());\n }),\n (Red.prototype.sqr = function (a) {\n return this.mul(a, a);\n }),\n (Red.prototype.sqrt = function (a) {\n if (a.isZero()) return a.clone();\n var mod3 = this.m.andln(3);\n if ((assert(mod3 % 2 === 1), mod3 === 3)) {\n var pow = this.m.add(new BN(1)).iushrn(2);\n return this.pow(a, pow);\n }\n for (var q = this.m.subn(1), s = 0; !q.isZero() && q.andln(1) === 0; ) s++, q.iushrn(1);\n assert(!q.isZero());\n var one = new BN(1).toRed(this),\n nOne = one.redNeg(),\n lpow = this.m.subn(1).iushrn(1),\n z = this.m.bitLength();\n for (z = new BN(2 * z * z).toRed(this); this.pow(z, lpow).cmp(nOne) !== 0; ) z.redIAdd(nOne);\n for (\n var c = this.pow(z, q), r = this.pow(a, q.addn(1).iushrn(1)), t = this.pow(a, q), m = s;\n t.cmp(one) !== 0;\n\n ) {\n for (var tmp = t, i = 0; tmp.cmp(one) !== 0; i++) tmp = tmp.redSqr();\n assert(i < m);\n var b = this.pow(c, new BN(1).iushln(m - i - 1));\n (r = r.redMul(b)), (c = b.redSqr()), (t = t.redMul(c)), (m = i);\n }\n return r;\n }),\n (Red.prototype.invm = function (a) {\n var inv = a._invmp(this.m);\n return inv.negative !== 0 ? ((inv.negative = 0), this.imod(inv).redNeg()) : this.imod(inv);\n }),\n (Red.prototype.pow = function (a, num) {\n if (num.isZero()) return new BN(1).toRed(this);\n if (num.cmpn(1) === 0) return a.clone();\n var windowSize = 4,\n wnd = new Array(1 << windowSize);\n (wnd[0] = new BN(1).toRed(this)), (wnd[1] = a);\n for (var i = 2; i < wnd.length; i++) wnd[i] = this.mul(wnd[i - 1], a);\n var res = wnd[0],\n current = 0,\n currentLen = 0,\n start = num.bitLength() % 26;\n for (start === 0 && (start = 26), i = num.length - 1; i >= 0; i--) {\n for (var word = num.words[i], j = start - 1; j >= 0; j--) {\n var bit = (word >> j) & 1;\n if ((res !== wnd[0] && (res = this.sqr(res)), bit === 0 && current === 0)) {\n currentLen = 0;\n continue;\n }\n (current <<= 1),\n (current |= bit),\n currentLen++,\n !(currentLen !== windowSize && (i !== 0 || j !== 0)) &&\n ((res = this.mul(res, wnd[current])), (currentLen = 0), (current = 0));\n }\n start = 26;\n }\n return res;\n }),\n (Red.prototype.convertTo = function (num) {\n var r = num.umod(this.m);\n return r === num ? r.clone() : r;\n }),\n (Red.prototype.convertFrom = function (num) {\n var res = num.clone();\n return (res.red = null), res;\n }),\n (BN.mont = function (num) {\n return new Mont(num);\n });\n function Mont(m) {\n Red.call(this, m),\n (this.shift = this.m.bitLength()),\n this.shift % 26 !== 0 && (this.shift += 26 - (this.shift % 26)),\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 (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 (Mont.prototype.convertTo = function (num) {\n return this.imod(num.ushln(this.shift));\n }),\n (Mont.prototype.convertFrom = function (num) {\n var r = this.imod(num.mul(this.rinv));\n return (r.red = null), r;\n }),\n (Mont.prototype.imul = function (a, b) {\n if (a.isZero() || b.isZero()) return (a.words[0] = 0), (a.length = 1), a;\n var t = a.imul(b),\n c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m),\n u = t.isub(c).iushrn(this.shift),\n res = u;\n return (\n u.cmp(this.m) >= 0 ? (res = u.isub(this.m)) : u.cmpn(0) < 0 && (res = u.iadd(this.m)), res._forceRed(this)\n );\n }),\n (Mont.prototype.mul = function (a, b) {\n if (a.isZero() || b.isZero()) return new BN(0)._forceRed(this);\n var t = a.mul(b),\n c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m),\n u = t.isub(c).iushrn(this.shift),\n res = u;\n return (\n u.cmp(this.m) >= 0 ? (res = u.isub(this.m)) : u.cmpn(0) < 0 && (res = u.iadd(this.m)), res._forceRed(this)\n );\n }),\n (Mont.prototype.invm = function (a) {\n var res = this.imod(a._invmp(this.m).mul(this.r2));\n return res._forceRed(this);\n });\n })(typeof module > \"u\" || module, exports);\n },\n});\n\n// node_modules/create-ecdh/browser.js\nvar require_browser9 = __commonJS({\n \"node_modules/create-ecdh/browser.js\"(exports, module) {\n var elliptic = require_elliptic(),\n BN = require_bn6();\n module.exports = function (curve) {\n return new ECDH(curve);\n };\n var aliases = {\n secp256k1: {\n name: \"secp256k1\",\n byteLength: 32,\n },\n secp224r1: {\n name: \"p224\",\n byteLength: 28,\n },\n prime256v1: {\n name: \"p256\",\n byteLength: 32,\n },\n prime192v1: {\n name: \"p192\",\n byteLength: 24,\n },\n ed25519: {\n name: \"ed25519\",\n byteLength: 32,\n },\n secp384r1: {\n name: \"p384\",\n byteLength: 48,\n },\n secp521r1: {\n name: \"p521\",\n byteLength: 66,\n },\n };\n aliases.p224 = aliases.secp224r1;\n aliases.p256 = aliases.secp256r1 = aliases.prime256v1;\n aliases.p192 = aliases.secp192r1 = aliases.prime192v1;\n aliases.p384 = aliases.secp384r1;\n aliases.p521 = aliases.secp521r1;\n function ECDH(curve) {\n (this.curveType = aliases[curve]),\n this.curveType ||\n (this.curveType = {\n name: curve,\n }),\n (this.curve = new elliptic.ec(this.curveType.name)),\n (this.keys = void 0);\n }\n ECDH.prototype.generateKeys = function (enc, format) {\n return (this.keys = this.curve.genKeyPair()), this.getPublicKey(enc, format);\n };\n ECDH.prototype.computeSecret = function (other, inenc, enc) {\n (inenc = inenc || \"utf8\"), Buffer.isBuffer(other) || (other = new Buffer(other, inenc));\n var otherPub = this.curve.keyFromPublic(other).getPublic(),\n out = otherPub.mul(this.keys.getPrivate()).getX();\n return formatReturnValue(out, enc, this.curveType.byteLength);\n };\n ECDH.prototype.getPublicKey = function (enc, format) {\n var key = this.keys.getPublic(format === \"compressed\", !0);\n return (\n format === \"hybrid\" && (key[key.length - 1] % 2 ? (key[0] = 7) : (key[0] = 6)), formatReturnValue(key, enc)\n );\n };\n ECDH.prototype.getPrivateKey = function (enc) {\n return formatReturnValue(this.keys.getPrivate(), enc);\n };\n ECDH.prototype.setPublicKey = function (pub, enc) {\n return (\n (enc = enc || \"utf8\"), Buffer.isBuffer(pub) || (pub = new Buffer(pub, enc)), this.keys._importPublic(pub), this\n );\n };\n ECDH.prototype.setPrivateKey = function (priv, enc) {\n (enc = enc || \"utf8\"), Buffer.isBuffer(priv) || (priv = new Buffer(priv, enc));\n var _priv = new BN(priv);\n return (_priv = _priv.toString(16)), (this.keys = this.curve.genKeyPair()), this.keys._importPrivate(_priv), this;\n };\n function formatReturnValue(bn, enc, len) {\n Array.isArray(bn) || (bn = bn.toArray());\n var buf = new Buffer(bn);\n if (len && buf.length < len) {\n var zeros = new Buffer(len - buf.length);\n zeros.fill(0), (buf = Buffer.concat([zeros, buf]));\n }\n return enc ? buf.toString(enc) : buf;\n }\n },\n});\n\n// node_modules/public-encrypt/mgf.js\nvar require_mgf = __commonJS({\n \"node_modules/public-encrypt/mgf.js\"(exports, module) {\n var createHash = require_browser2(),\n Buffer2 = require_safe_buffer().Buffer;\n module.exports = function (seed, len) {\n for (var t = Buffer2.alloc(0), i = 0, c; t.length < len; )\n (c = i2ops(i++)), (t = Buffer2.concat([t, createHash(\"sha1\").update(seed).update(c).digest()]));\n return t.slice(0, len);\n };\n function i2ops(c) {\n var out = Buffer2.allocUnsafe(4);\n return out.writeUInt32BE(c, 0), out;\n }\n },\n});\n\n// node_modules/public-encrypt/xor.js\nvar require_xor = __commonJS({\n \"node_modules/public-encrypt/xor.js\"(exports, module) {\n module.exports = function (a, b) {\n for (var len = a.length, i = -1; ++i < len; ) a[i] ^= b[i];\n return a;\n };\n },\n});\n\n// node_modules/public-encrypt/node_modules/bn.js/lib/bn.js\nvar require_bn7 = __commonJS({\n \"node_modules/public-encrypt/node_modules/bn.js/lib/bn.js\"(exports, module) {\n (function (module2, exports2) {\n \"use strict\";\n function assert(val, msg) {\n if (!val) throw new Error(msg || \"Assertion failed\");\n }\n function inherits(ctor, superCtor) {\n ctor.super_ = superCtor;\n var TempCtor = function () {};\n (TempCtor.prototype = superCtor.prototype),\n (ctor.prototype = new TempCtor()),\n (ctor.prototype.constructor = ctor);\n }\n function BN(number, base, endian) {\n if (BN.isBN(number)) return number;\n (this.negative = 0),\n (this.words = null),\n (this.length = 0),\n (this.red = null),\n number !== null &&\n ((base === \"le\" || base === \"be\") && ((endian = base), (base = 10)),\n this._init(number || 0, base || 10, endian || \"be\"));\n }\n typeof module2 == \"object\" ? (module2.exports = BN) : (exports2.BN = BN), (BN.BN = BN), (BN.wordSize = 26);\n var Buffer2 = globalThis.Buffer;\n (BN.isBN = function (num) {\n return num instanceof BN\n ? !0\n : num !== null &&\n typeof num == \"object\" &&\n num.constructor.wordSize === BN.wordSize &&\n Array.isArray(num.words);\n }),\n (BN.max = function (left, right) {\n return left.cmp(right) > 0 ? left : right;\n }),\n (BN.min = function (left, right) {\n return left.cmp(right) < 0 ? left : right;\n }),\n (BN.prototype._init = function (number, base, endian) {\n if (typeof number == \"number\") return this._initNumber(number, base, endian);\n if (typeof number == \"object\") return this._initArray(number, base, endian);\n base === \"hex\" && (base = 16),\n assert(base === (base | 0) && base >= 2 && base <= 36),\n (number = number.toString().replace(/\\s+/g, \"\"));\n var start = 0;\n number[0] === \"-\" && (start++, (this.negative = 1)),\n start < number.length &&\n (base === 16\n ? this._parseHex(number, start, endian)\n : (this._parseBase(number, base, start),\n endian === \"le\" && this._initArray(this.toArray(), base, endian)));\n }),\n (BN.prototype._initNumber = function (number, base, endian) {\n number < 0 && ((this.negative = 1), (number = -number)),\n number < 67108864\n ? ((this.words = [number & 67108863]), (this.length = 1))\n : number < 4503599627370496\n ? ((this.words = [number & 67108863, (number / 67108864) & 67108863]), (this.length = 2))\n : (assert(number < 9007199254740992),\n (this.words = [number & 67108863, (number / 67108864) & 67108863, 1]),\n (this.length = 3)),\n endian === \"le\" && this._initArray(this.toArray(), base, endian);\n }),\n (BN.prototype._initArray = function (number, base, endian) {\n if ((assert(typeof number.length == \"number\"), number.length <= 0))\n return (this.words = [0]), (this.length = 1), this;\n (this.length = Math.ceil(number.length / 3)), (this.words = new Array(this.length));\n for (var i = 0; i < this.length; i++) this.words[i] = 0;\n var j,\n w,\n off = 0;\n if (endian === \"be\")\n for (i = number.length - 1, j = 0; i >= 0; i -= 3)\n (w = number[i] | (number[i - 1] << 8) | (number[i - 2] << 16)),\n (this.words[j] |= (w << off) & 67108863),\n (this.words[j + 1] = (w >>> (26 - off)) & 67108863),\n (off += 24),\n off >= 26 && ((off -= 26), j++);\n else if (endian === \"le\")\n for (i = 0, j = 0; i < number.length; i += 3)\n (w = number[i] | (number[i + 1] << 8) | (number[i + 2] << 16)),\n (this.words[j] |= (w << off) & 67108863),\n (this.words[j + 1] = (w >>> (26 - off)) & 67108863),\n (off += 24),\n off >= 26 && ((off -= 26), j++);\n return this.strip();\n });\n function parseHex4Bits(string, index) {\n var c = string.charCodeAt(index);\n return c >= 65 && c <= 70 ? c - 55 : c >= 97 && c <= 102 ? c - 87 : (c - 48) & 15;\n }\n function parseHexByte(string, lowerBound, index) {\n var r = parseHex4Bits(string, index);\n return index - 1 >= lowerBound && (r |= parseHex4Bits(string, index - 1) << 4), r;\n }\n BN.prototype._parseHex = function (number, start, endian) {\n (this.length = Math.ceil((number.length - start) / 6)), (this.words = new Array(this.length));\n for (var i = 0; i < this.length; i++) this.words[i] = 0;\n var off = 0,\n j = 0,\n w;\n if (endian === \"be\")\n for (i = number.length - 1; i >= start; i -= 2)\n (w = parseHexByte(number, start, i) << off),\n (this.words[j] |= w & 67108863),\n off >= 18 ? ((off -= 18), (j += 1), (this.words[j] |= w >>> 26)) : (off += 8);\n else {\n var parseLength = number.length - start;\n for (i = parseLength % 2 === 0 ? start + 1 : start; i < number.length; i += 2)\n (w = parseHexByte(number, start, i) << off),\n (this.words[j] |= w & 67108863),\n off >= 18 ? ((off -= 18), (j += 1), (this.words[j] |= w >>> 26)) : (off += 8);\n }\n this.strip();\n };\n function parseBase(str, start, end, mul) {\n for (var r = 0, len = Math.min(str.length, end), i = start; i < len; i++) {\n var c = str.charCodeAt(i) - 48;\n (r *= mul), c >= 49 ? (r += c - 49 + 10) : c >= 17 ? (r += c - 17 + 10) : (r += c);\n }\n return r;\n }\n (BN.prototype._parseBase = function (number, base, start) {\n (this.words = [0]), (this.length = 1);\n for (var limbLen = 0, limbPow = 1; limbPow <= 67108863; limbPow *= base) limbLen++;\n limbLen--, (limbPow = (limbPow / base) | 0);\n for (\n var total = number.length - start,\n mod = total % limbLen,\n end = Math.min(total, total - mod) + start,\n word = 0,\n i = start;\n i < end;\n i += limbLen\n )\n (word = parseBase(number, i, i + limbLen, base)),\n this.imuln(limbPow),\n this.words[0] + word < 67108864 ? (this.words[0] += word) : this._iaddn(word);\n if (mod !== 0) {\n var pow = 1;\n for (word = parseBase(number, i, number.length, base), i = 0; i < mod; i++) pow *= base;\n this.imuln(pow), this.words[0] + word < 67108864 ? (this.words[0] += word) : this._iaddn(word);\n }\n this.strip();\n }),\n (BN.prototype.copy = function (dest) {\n dest.words = new Array(this.length);\n for (var i = 0; i < this.length; i++) dest.words[i] = this.words[i];\n (dest.length = this.length), (dest.negative = this.negative), (dest.red = this.red);\n }),\n (BN.prototype.clone = function () {\n var r = new BN(null);\n return this.copy(r), r;\n }),\n (BN.prototype._expand = function (size) {\n for (; this.length < size; ) this.words[this.length++] = 0;\n return this;\n }),\n (BN.prototype.strip = function () {\n for (; this.length > 1 && this.words[this.length - 1] === 0; ) this.length--;\n return this._normSign();\n }),\n (BN.prototype._normSign = function () {\n return this.length === 1 && this.words[0] === 0 && (this.negative = 0), this;\n }),\n (BN.prototype.inspect = function () {\n return (this.red ? \"<BN-R: \" : \"<BN: \") + this.toString(16) + \">\";\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 groupSizes = [\n 0, 0, 25, 16, 12, 11, 10, 9, 8, 8, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5,\n 5, 5,\n ],\n groupBases = [\n 0, 0, 33554432, 43046721, 16777216, 48828125, 60466176, 40353607, 16777216, 43046721, 1e7, 19487171, 35831808,\n 62748517, 7529536, 11390625, 16777216, 24137569, 34012224, 47045881, 64e6, 4084101, 5153632, 6436343, 7962624,\n 9765625, 11881376, 14348907, 17210368, 20511149, 243e5, 28629151, 33554432, 39135393, 45435424, 52521875,\n 60466176,\n ];\n (BN.prototype.toString = function (base, padding) {\n (base = base || 10), (padding = padding | 0 || 1);\n var out;\n if (base === 16 || base === \"hex\") {\n out = \"\";\n for (var off = 0, carry = 0, i = 0; i < this.length; i++) {\n var w = this.words[i],\n word = (((w << off) | carry) & 16777215).toString(16);\n (carry = (w >>> (24 - off)) & 16777215),\n carry !== 0 || i !== this.length - 1 ? (out = zeros[6 - word.length] + word + out) : (out = word + out),\n (off += 2),\n off >= 26 && ((off -= 26), i--);\n }\n for (carry !== 0 && (out = carry.toString(16) + out); out.length % padding !== 0; ) out = \"0\" + out;\n return this.negative !== 0 && (out = \"-\" + out), out;\n }\n if (base === (base | 0) && base >= 2 && base <= 36) {\n var groupSize = groupSizes[base],\n groupBase = groupBases[base];\n out = \"\";\n var c = this.clone();\n for (c.negative = 0; !c.isZero(); ) {\n var r = c.modn(groupBase).toString(base);\n (c = c.idivn(groupBase)), c.isZero() ? (out = r + out) : (out = zeros[groupSize - r.length] + r + out);\n }\n for (this.isZero() && (out = \"0\" + out); out.length % padding !== 0; ) out = \"0\" + out;\n return this.negative !== 0 && (out = \"-\" + out), out;\n }\n assert(!1, \"Base should be between 2 and 36\");\n }),\n (BN.prototype.toNumber = function () {\n var ret = this.words[0];\n return (\n this.length === 2\n ? (ret += this.words[1] * 67108864)\n : this.length === 3 && this.words[2] === 1\n ? (ret += 4503599627370496 + this.words[1] * 67108864)\n : this.length > 2 && assert(!1, \"Number can only safely store up to 53 bits\"),\n this.negative !== 0 ? -ret : ret\n );\n }),\n (BN.prototype.toJSON = function () {\n return this.toString(16);\n }),\n (BN.prototype.toBuffer = function (endian, length) {\n return assert(typeof Buffer2 < \"u\"), this.toArrayLike(Buffer2, endian, length);\n }),\n (BN.prototype.toArray = function (endian, length) {\n return this.toArrayLike(Array, endian, length);\n }),\n (BN.prototype.toArrayLike = function (ArrayType, endian, length) {\n var byteLength = this.byteLength(),\n 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 this.strip();\n var littleEndian = endian === \"le\",\n res = new ArrayType(reqLength),\n b,\n i,\n q = this.clone();\n if (littleEndian) {\n for (i = 0; !q.isZero(); i++) (b = q.andln(255)), q.iushrn(8), (res[i] = b);\n for (; i < reqLength; i++) res[i] = 0;\n } else {\n for (i = 0; i < reqLength - byteLength; i++) res[i] = 0;\n for (i = 0; !q.isZero(); i++) (b = q.andln(255)), q.iushrn(8), (res[reqLength - i - 1] = b);\n }\n return res;\n }),\n Math.clz32\n ? (BN.prototype._countBits = function (w) {\n return 32 - Math.clz32(w);\n })\n : (BN.prototype._countBits = function (w) {\n var t = w,\n r = 0;\n return (\n t >= 4096 && ((r += 13), (t >>>= 13)),\n t >= 64 && ((r += 7), (t >>>= 7)),\n t >= 8 && ((r += 4), (t >>>= 4)),\n t >= 2 && ((r += 2), (t >>>= 2)),\n r + t\n );\n }),\n (BN.prototype._zeroBits = function (w) {\n if (w === 0) return 26;\n var t = w,\n r = 0;\n return (\n (t & 8191) === 0 && ((r += 13), (t >>>= 13)),\n (t & 127) === 0 && ((r += 7), (t >>>= 7)),\n (t & 15) === 0 && ((r += 4), (t >>>= 4)),\n (t & 3) === 0 && ((r += 2), (t >>>= 2)),\n (t & 1) === 0 && r++,\n r\n );\n }),\n (BN.prototype.bitLength = function () {\n var w = this.words[this.length - 1],\n hi = this._countBits(w);\n return (this.length - 1) * 26 + hi;\n });\n function toBitArray(num) {\n for (var w = new Array(num.bitLength()), bit = 0; bit < w.length; bit++) {\n var off = (bit / 26) | 0,\n wbit = bit % 26;\n w[bit] = (num.words[off] & (1 << wbit)) >>> wbit;\n }\n return w;\n }\n (BN.prototype.zeroBits = function () {\n if (this.isZero()) return 0;\n for (var r = 0, i = 0; i < this.length; i++) {\n var b = this._zeroBits(this.words[i]);\n if (((r += b), b !== 26)) break;\n }\n return r;\n }),\n (BN.prototype.byteLength = function () {\n return Math.ceil(this.bitLength() / 8);\n }),\n (BN.prototype.toTwos = function (width) {\n return this.negative !== 0 ? this.abs().inotn(width).iaddn(1) : this.clone();\n }),\n (BN.prototype.fromTwos = function (width) {\n return this.testn(width - 1) ? this.notn(width).iaddn(1).ineg() : this.clone();\n }),\n (BN.prototype.isNeg = function () {\n return this.negative !== 0;\n }),\n (BN.prototype.neg = function () {\n return this.clone().ineg();\n }),\n (BN.prototype.ineg = function () {\n return this.isZero() || (this.negative ^= 1), this;\n }),\n (BN.prototype.iuor = function (num) {\n for (; this.length < num.length; ) this.words[this.length++] = 0;\n for (var i = 0; i < num.length; i++) this.words[i] = this.words[i] | num.words[i];\n return this.strip();\n }),\n (BN.prototype.ior = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuor(num);\n }),\n (BN.prototype.or = function (num) {\n return this.length > num.length ? this.clone().ior(num) : num.clone().ior(this);\n }),\n (BN.prototype.uor = function (num) {\n return this.length > num.length ? this.clone().iuor(num) : num.clone().iuor(this);\n }),\n (BN.prototype.iuand = function (num) {\n var b;\n this.length > num.length ? (b = num) : (b = this);\n for (var i = 0; i < b.length; i++) this.words[i] = this.words[i] & num.words[i];\n return (this.length = b.length), this.strip();\n }),\n (BN.prototype.iand = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuand(num);\n }),\n (BN.prototype.and = function (num) {\n return this.length > num.length ? this.clone().iand(num) : num.clone().iand(this);\n }),\n (BN.prototype.uand = function (num) {\n return this.length > num.length ? this.clone().iuand(num) : num.clone().iuand(this);\n }),\n (BN.prototype.iuxor = function (num) {\n var a, b;\n this.length > num.length ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var i = 0; i < b.length; i++) this.words[i] = a.words[i] ^ b.words[i];\n if (this !== a) for (; i < a.length; i++) this.words[i] = a.words[i];\n return (this.length = a.length), this.strip();\n }),\n (BN.prototype.ixor = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuxor(num);\n }),\n (BN.prototype.xor = function (num) {\n return this.length > num.length ? this.clone().ixor(num) : num.clone().ixor(this);\n }),\n (BN.prototype.uxor = function (num) {\n return this.length > num.length ? this.clone().iuxor(num) : num.clone().iuxor(this);\n }),\n (BN.prototype.inotn = function (width) {\n assert(typeof width == \"number\" && width >= 0);\n var bytesNeeded = Math.ceil(width / 26) | 0,\n bitsLeft = width % 26;\n this._expand(bytesNeeded), bitsLeft > 0 && bytesNeeded--;\n for (var i = 0; i < bytesNeeded; i++) this.words[i] = ~this.words[i] & 67108863;\n return bitsLeft > 0 && (this.words[i] = ~this.words[i] & (67108863 >> (26 - bitsLeft))), this.strip();\n }),\n (BN.prototype.notn = function (width) {\n return this.clone().inotn(width);\n }),\n (BN.prototype.setn = function (bit, val) {\n assert(typeof bit == \"number\" && bit >= 0);\n var off = (bit / 26) | 0,\n wbit = bit % 26;\n return (\n this._expand(off + 1),\n val\n ? (this.words[off] = this.words[off] | (1 << wbit))\n : (this.words[off] = this.words[off] & ~(1 << wbit)),\n this.strip()\n );\n }),\n (BN.prototype.iadd = function (num) {\n var r;\n if (this.negative !== 0 && num.negative === 0)\n return (this.negative = 0), (r = this.isub(num)), (this.negative ^= 1), this._normSign();\n if (this.negative === 0 && num.negative !== 0)\n return (num.negative = 0), (r = this.isub(num)), (num.negative = 1), r._normSign();\n var a, b;\n this.length > num.length ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var carry = 0, i = 0; i < b.length; i++)\n (r = (a.words[i] | 0) + (b.words[i] | 0) + carry), (this.words[i] = r & 67108863), (carry = r >>> 26);\n for (; carry !== 0 && i < a.length; i++)\n (r = (a.words[i] | 0) + carry), (this.words[i] = r & 67108863), (carry = r >>> 26);\n if (((this.length = a.length), carry !== 0)) (this.words[this.length] = carry), this.length++;\n else if (a !== this) for (; i < a.length; i++) this.words[i] = a.words[i];\n return this;\n }),\n (BN.prototype.add = function (num) {\n var res;\n return num.negative !== 0 && this.negative === 0\n ? ((num.negative = 0), (res = this.sub(num)), (num.negative ^= 1), res)\n : num.negative === 0 && this.negative !== 0\n ? ((this.negative = 0), (res = num.sub(this)), (this.negative = 1), res)\n : this.length > num.length\n ? this.clone().iadd(num)\n : num.clone().iadd(this);\n }),\n (BN.prototype.isub = function (num) {\n if (num.negative !== 0) {\n num.negative = 0;\n var r = this.iadd(num);\n return (num.negative = 1), r._normSign();\n } else if (this.negative !== 0)\n return (this.negative = 0), this.iadd(num), (this.negative = 1), this._normSign();\n var cmp = this.cmp(num);\n if (cmp === 0) return (this.negative = 0), (this.length = 1), (this.words[0] = 0), this;\n var a, b;\n cmp > 0 ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var carry = 0, i = 0; i < b.length; i++)\n (r = (a.words[i] | 0) - (b.words[i] | 0) + carry), (carry = r >> 26), (this.words[i] = r & 67108863);\n for (; carry !== 0 && i < a.length; i++)\n (r = (a.words[i] | 0) + carry), (carry = r >> 26), (this.words[i] = r & 67108863);\n if (carry === 0 && i < a.length && a !== this) for (; i < a.length; i++) this.words[i] = a.words[i];\n return (this.length = Math.max(this.length, i)), a !== this && (this.negative = 1), this.strip();\n }),\n (BN.prototype.sub = function (num) {\n return this.clone().isub(num);\n });\n function smallMulTo(self2, num, out) {\n out.negative = num.negative ^ self2.negative;\n var len = (self2.length + num.length) | 0;\n (out.length = len), (len = (len - 1) | 0);\n var a = self2.words[0] | 0,\n b = num.words[0] | 0,\n r = a * b,\n lo = r & 67108863,\n carry = (r / 67108864) | 0;\n out.words[0] = lo;\n for (var k = 1; k < len; k++) {\n for (\n var ncarry = carry >>> 26,\n rword = carry & 67108863,\n maxJ = Math.min(k, num.length - 1),\n j = Math.max(0, k - self2.length + 1);\n j <= maxJ;\n j++\n ) {\n var i = (k - j) | 0;\n (a = self2.words[i] | 0),\n (b = num.words[j] | 0),\n (r = a * b + rword),\n (ncarry += (r / 67108864) | 0),\n (rword = r & 67108863);\n }\n (out.words[k] = rword | 0), (carry = ncarry | 0);\n }\n return carry !== 0 ? (out.words[k] = carry | 0) : out.length--, out.strip();\n }\n var comb10MulTo = function (self2, num, out) {\n var a = self2.words,\n b = num.words,\n o = out.words,\n c = 0,\n lo,\n mid,\n hi,\n a0 = a[0] | 0,\n al0 = a0 & 8191,\n ah0 = a0 >>> 13,\n a1 = a[1] | 0,\n al1 = a1 & 8191,\n ah1 = a1 >>> 13,\n a2 = a[2] | 0,\n al2 = a2 & 8191,\n ah2 = a2 >>> 13,\n a3 = a[3] | 0,\n al3 = a3 & 8191,\n ah3 = a3 >>> 13,\n a4 = a[4] | 0,\n al4 = a4 & 8191,\n ah4 = a4 >>> 13,\n a5 = a[5] | 0,\n al5 = a5 & 8191,\n ah5 = a5 >>> 13,\n a6 = a[6] | 0,\n al6 = a6 & 8191,\n ah6 = a6 >>> 13,\n a7 = a[7] | 0,\n al7 = a7 & 8191,\n ah7 = a7 >>> 13,\n a8 = a[8] | 0,\n al8 = a8 & 8191,\n ah8 = a8 >>> 13,\n a9 = a[9] | 0,\n al9 = a9 & 8191,\n ah9 = a9 >>> 13,\n b0 = b[0] | 0,\n bl0 = b0 & 8191,\n bh0 = b0 >>> 13,\n b1 = b[1] | 0,\n bl1 = b1 & 8191,\n bh1 = b1 >>> 13,\n b2 = b[2] | 0,\n bl2 = b2 & 8191,\n bh2 = b2 >>> 13,\n b3 = b[3] | 0,\n bl3 = b3 & 8191,\n bh3 = b3 >>> 13,\n b4 = b[4] | 0,\n bl4 = b4 & 8191,\n bh4 = b4 >>> 13,\n b5 = b[5] | 0,\n bl5 = b5 & 8191,\n bh5 = b5 >>> 13,\n b6 = b[6] | 0,\n bl6 = b6 & 8191,\n bh6 = b6 >>> 13,\n b7 = b[7] | 0,\n bl7 = b7 & 8191,\n bh7 = b7 >>> 13,\n b8 = b[8] | 0,\n bl8 = b8 & 8191,\n bh8 = b8 >>> 13,\n b9 = b[9] | 0,\n bl9 = b9 & 8191,\n bh9 = b9 >>> 13;\n (out.negative = self2.negative ^ num.negative),\n (out.length = 19),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w0 >>> 26)) | 0),\n (w0 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w1 >>> 26)) | 0),\n (w1 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w2 >>> 26)) | 0),\n (w2 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w3 >>> 26)) | 0),\n (w3 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w4 >>> 26)) | 0),\n (w4 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w5 >>> 26)) | 0),\n (w5 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w6 >>> 26)) | 0),\n (w6 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w7 >>> 26)) | 0),\n (w7 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w8 >>> 26)) | 0),\n (w8 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w9 >>> 26)) | 0),\n (w9 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w10 >>> 26)) | 0),\n (w10 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w11 >>> 26)) | 0),\n (w11 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w12 >>> 26)) | 0),\n (w12 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w13 >>> 26)) | 0),\n (w13 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w14 >>> 26)) | 0),\n (w14 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w15 >>> 26)) | 0),\n (w15 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w16 >>> 26)) | 0),\n (w16 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w17 >>> 26)) | 0),\n (w17 &= 67108863),\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 & 8191) << 13)) | 0;\n return (\n (c = (((hi + (mid >>> 13)) | 0) + (w18 >>> 26)) | 0),\n (w18 &= 67108863),\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 c !== 0 && ((o[19] = c), out.length++),\n out\n );\n };\n Math.imul || (comb10MulTo = smallMulTo);\n function bigMulTo(self2, num, out) {\n (out.negative = num.negative ^ self2.negative), (out.length = self2.length + num.length);\n for (var carry = 0, hncarry = 0, k = 0; k < out.length - 1; k++) {\n var ncarry = hncarry;\n hncarry = 0;\n for (\n var rword = carry & 67108863, maxJ = Math.min(k, num.length - 1), j = Math.max(0, k - self2.length + 1);\n j <= maxJ;\n j++\n ) {\n var i = k - j,\n a = self2.words[i] | 0,\n b = num.words[j] | 0,\n r = a * b,\n lo = r & 67108863;\n (ncarry = (ncarry + ((r / 67108864) | 0)) | 0),\n (lo = (lo + rword) | 0),\n (rword = lo & 67108863),\n (ncarry = (ncarry + (lo >>> 26)) | 0),\n (hncarry += ncarry >>> 26),\n (ncarry &= 67108863);\n }\n (out.words[k] = rword), (carry = ncarry), (ncarry = hncarry);\n }\n return carry !== 0 ? (out.words[k] = carry) : out.length--, out.strip();\n }\n function jumboMulTo(self2, num, out) {\n var fftm = new FFTM();\n return fftm.mulp(self2, num, out);\n }\n BN.prototype.mulTo = function (num, out) {\n var res,\n len = this.length + num.length;\n return (\n this.length === 10 && num.length === 10\n ? (res = comb10MulTo(this, num, out))\n : len < 63\n ? (res = smallMulTo(this, num, out))\n : len < 1024\n ? (res = bigMulTo(this, num, out))\n : (res = jumboMulTo(this, num, out)),\n res\n );\n };\n function FFTM(x, y) {\n (this.x = x), (this.y = y);\n }\n (FFTM.prototype.makeRBT = function (N) {\n for (var t = new Array(N), l = BN.prototype._countBits(N) - 1, i = 0; i < N; i++) t[i] = this.revBin(i, l, N);\n return t;\n }),\n (FFTM.prototype.revBin = function (x, l, N) {\n if (x === 0 || x === N - 1) return x;\n for (var rb = 0, i = 0; i < l; i++) (rb |= (x & 1) << (l - i - 1)), (x >>= 1);\n return rb;\n }),\n (FFTM.prototype.permute = function (rbt, rws, iws, rtws, itws, N) {\n for (var i = 0; i < N; i++) (rtws[i] = rws[rbt[i]]), (itws[i] = iws[rbt[i]]);\n }),\n (FFTM.prototype.transform = function (rws, iws, rtws, itws, N, rbt) {\n this.permute(rbt, rws, iws, rtws, itws, N);\n for (var s = 1; s < N; s <<= 1)\n for (\n var l = s << 1, rtwdf = Math.cos((2 * Math.PI) / l), itwdf = Math.sin((2 * Math.PI) / l), p = 0;\n p < N;\n p += l\n )\n for (var rtwdf_ = rtwdf, itwdf_ = itwdf, j = 0; j < s; j++) {\n var re = rtws[p + j],\n ie = itws[p + j],\n ro = rtws[p + j + s],\n io = itws[p + j + s],\n rx = rtwdf_ * ro - itwdf_ * io;\n (io = rtwdf_ * io + itwdf_ * ro),\n (ro = rx),\n (rtws[p + j] = re + ro),\n (itws[p + j] = ie + io),\n (rtws[p + j + s] = re - ro),\n (itws[p + j + s] = ie - io),\n j !== l &&\n ((rx = rtwdf * rtwdf_ - itwdf * itwdf_), (itwdf_ = rtwdf * itwdf_ + itwdf * rtwdf_), (rtwdf_ = rx));\n }\n }),\n (FFTM.prototype.guessLen13b = function (n, m) {\n var N = Math.max(m, n) | 1,\n odd = N & 1,\n i = 0;\n for (N = (N / 2) | 0; N; N = N >>> 1) i++;\n return 1 << (i + 1 + odd);\n }),\n (FFTM.prototype.conjugate = function (rws, iws, N) {\n if (!(N <= 1))\n for (var i = 0; i < N / 2; i++) {\n var t = rws[i];\n (rws[i] = rws[N - i - 1]),\n (rws[N - i - 1] = t),\n (t = iws[i]),\n (iws[i] = -iws[N - i - 1]),\n (iws[N - i - 1] = -t);\n }\n }),\n (FFTM.prototype.normalize13b = function (ws, N) {\n for (var carry = 0, i = 0; i < N / 2; i++) {\n var w = Math.round(ws[2 * i + 1] / N) * 8192 + Math.round(ws[2 * i] / N) + carry;\n (ws[i] = w & 67108863), w < 67108864 ? (carry = 0) : (carry = (w / 67108864) | 0);\n }\n return ws;\n }),\n (FFTM.prototype.convert13b = function (ws, len, rws, N) {\n for (var carry = 0, i = 0; i < len; i++)\n (carry = carry + (ws[i] | 0)),\n (rws[2 * i] = carry & 8191),\n (carry = carry >>> 13),\n (rws[2 * i + 1] = carry & 8191),\n (carry = carry >>> 13);\n for (i = 2 * len; i < N; ++i) rws[i] = 0;\n assert(carry === 0), assert((carry & -8192) === 0);\n }),\n (FFTM.prototype.stub = function (N) {\n for (var ph = new Array(N), i = 0; i < N; i++) ph[i] = 0;\n return ph;\n }),\n (FFTM.prototype.mulp = function (x, y, out) {\n var N = 2 * this.guessLen13b(x.length, y.length),\n rbt = this.makeRBT(N),\n _ = this.stub(N),\n rws = new Array(N),\n rwst = new Array(N),\n iwst = new Array(N),\n nrws = new Array(N),\n nrwst = new Array(N),\n niwst = new Array(N),\n rmws = out.words;\n (rmws.length = N),\n this.convert13b(x.words, x.length, rws, N),\n this.convert13b(y.words, y.length, nrws, N),\n this.transform(rws, _, rwst, iwst, N, rbt),\n this.transform(nrws, _, nrwst, niwst, N, rbt);\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]), (rwst[i] = rx);\n }\n return (\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 (out.negative = x.negative ^ y.negative),\n (out.length = x.length + y.length),\n out.strip()\n );\n }),\n (BN.prototype.mul = function (num) {\n var out = new BN(null);\n return (out.words = new Array(this.length + num.length)), this.mulTo(num, out);\n }),\n (BN.prototype.mulf = function (num) {\n var out = new BN(null);\n return (out.words = new Array(this.length + num.length)), jumboMulTo(this, num, out);\n }),\n (BN.prototype.imul = function (num) {\n return this.clone().mulTo(num, this);\n }),\n (BN.prototype.imuln = function (num) {\n assert(typeof num == \"number\"), assert(num < 67108864);\n for (var carry = 0, i = 0; i < this.length; i++) {\n var w = (this.words[i] | 0) * num,\n lo = (w & 67108863) + (carry & 67108863);\n (carry >>= 26), (carry += (w / 67108864) | 0), (carry += lo >>> 26), (this.words[i] = lo & 67108863);\n }\n return carry !== 0 && ((this.words[i] = carry), this.length++), this;\n }),\n (BN.prototype.muln = function (num) {\n return this.clone().imuln(num);\n }),\n (BN.prototype.sqr = function () {\n return this.mul(this);\n }),\n (BN.prototype.isqr = function () {\n return this.imul(this.clone());\n }),\n (BN.prototype.pow = function (num) {\n var w = toBitArray(num);\n if (w.length === 0) return new BN(1);\n for (var res = this, i = 0; i < w.length && w[i] === 0; i++, res = res.sqr());\n if (++i < w.length) for (var q = res.sqr(); i < w.length; i++, q = q.sqr()) w[i] !== 0 && (res = res.mul(q));\n return res;\n }),\n (BN.prototype.iushln = function (bits) {\n assert(typeof bits == \"number\" && bits >= 0);\n var r = bits % 26,\n s = (bits - r) / 26,\n carryMask = (67108863 >>> (26 - r)) << (26 - r),\n i;\n if (r !== 0) {\n var carry = 0;\n for (i = 0; i < this.length; i++) {\n var newCarry = this.words[i] & carryMask,\n c = ((this.words[i] | 0) - newCarry) << r;\n (this.words[i] = c | carry), (carry = newCarry >>> (26 - r));\n }\n carry && ((this.words[i] = carry), this.length++);\n }\n if (s !== 0) {\n for (i = this.length - 1; i >= 0; i--) this.words[i + s] = this.words[i];\n for (i = 0; i < s; i++) this.words[i] = 0;\n this.length += s;\n }\n return this.strip();\n }),\n (BN.prototype.ishln = function (bits) {\n return assert(this.negative === 0), this.iushln(bits);\n }),\n (BN.prototype.iushrn = function (bits, hint, extended) {\n assert(typeof bits == \"number\" && bits >= 0);\n var h;\n hint ? (h = (hint - (hint % 26)) / 26) : (h = 0);\n var r = bits % 26,\n s = Math.min((bits - r) / 26, this.length),\n mask = 67108863 ^ ((67108863 >>> r) << r),\n maskedWords = extended;\n if (((h -= s), (h = Math.max(0, h)), maskedWords)) {\n for (var i = 0; i < s; i++) maskedWords.words[i] = this.words[i];\n maskedWords.length = s;\n }\n if (s !== 0)\n if (this.length > s) for (this.length -= s, i = 0; i < this.length; i++) this.words[i] = this.words[i + s];\n else (this.words[0] = 0), (this.length = 1);\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)), (carry = word & mask);\n }\n return (\n maskedWords && carry !== 0 && (maskedWords.words[maskedWords.length++] = carry),\n this.length === 0 && ((this.words[0] = 0), (this.length = 1)),\n this.strip()\n );\n }),\n (BN.prototype.ishrn = function (bits, hint, extended) {\n return assert(this.negative === 0), this.iushrn(bits, hint, extended);\n }),\n (BN.prototype.shln = function (bits) {\n return this.clone().ishln(bits);\n }),\n (BN.prototype.ushln = function (bits) {\n return this.clone().iushln(bits);\n }),\n (BN.prototype.shrn = function (bits) {\n return this.clone().ishrn(bits);\n }),\n (BN.prototype.ushrn = function (bits) {\n return this.clone().iushrn(bits);\n }),\n (BN.prototype.testn = function (bit) {\n assert(typeof bit == \"number\" && bit >= 0);\n var r = bit % 26,\n s = (bit - r) / 26,\n q = 1 << r;\n if (this.length <= s) return !1;\n var w = this.words[s];\n return !!(w & q);\n }),\n (BN.prototype.imaskn = function (bits) {\n assert(typeof bits == \"number\" && bits >= 0);\n var r = bits % 26,\n s = (bits - r) / 26;\n if ((assert(this.negative === 0, \"imaskn works only with positive numbers\"), this.length <= s)) return this;\n if ((r !== 0 && s++, (this.length = Math.min(s, this.length)), r !== 0)) {\n var mask = 67108863 ^ ((67108863 >>> r) << r);\n this.words[this.length - 1] &= mask;\n }\n return this.strip();\n }),\n (BN.prototype.maskn = function (bits) {\n return this.clone().imaskn(bits);\n }),\n (BN.prototype.iaddn = function (num) {\n return (\n assert(typeof num == \"number\"),\n assert(num < 67108864),\n num < 0\n ? this.isubn(-num)\n : this.negative !== 0\n ? this.length === 1 && (this.words[0] | 0) < num\n ? ((this.words[0] = num - (this.words[0] | 0)), (this.negative = 0), this)\n : ((this.negative = 0), this.isubn(num), (this.negative = 1), this)\n : this._iaddn(num)\n );\n }),\n (BN.prototype._iaddn = function (num) {\n this.words[0] += num;\n for (var i = 0; i < this.length && this.words[i] >= 67108864; i++)\n (this.words[i] -= 67108864), i === this.length - 1 ? (this.words[i + 1] = 1) : this.words[i + 1]++;\n return (this.length = Math.max(this.length, i + 1)), this;\n }),\n (BN.prototype.isubn = function (num) {\n if ((assert(typeof num == \"number\"), assert(num < 67108864), num < 0)) return this.iaddn(-num);\n if (this.negative !== 0) return (this.negative = 0), this.iaddn(num), (this.negative = 1), this;\n if (((this.words[0] -= num), this.length === 1 && this.words[0] < 0))\n (this.words[0] = -this.words[0]), (this.negative = 1);\n else\n for (var i = 0; i < this.length && this.words[i] < 0; i++)\n (this.words[i] += 67108864), (this.words[i + 1] -= 1);\n return this.strip();\n }),\n (BN.prototype.addn = function (num) {\n return this.clone().iaddn(num);\n }),\n (BN.prototype.subn = function (num) {\n return this.clone().isubn(num);\n }),\n (BN.prototype.iabs = function () {\n return (this.negative = 0), this;\n }),\n (BN.prototype.abs = function () {\n return this.clone().iabs();\n }),\n (BN.prototype._ishlnsubmul = function (num, mul, shift) {\n var len = num.length + shift,\n i;\n this._expand(len);\n var w,\n 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 & 67108863),\n (carry = (w >> 26) - ((right / 67108864) | 0)),\n (this.words[i + shift] = w & 67108863);\n }\n for (; i < this.length - shift; i++)\n (w = (this.words[i + shift] | 0) + carry), (carry = w >> 26), (this.words[i + shift] = w & 67108863);\n if (carry === 0) return this.strip();\n for (assert(carry === -1), carry = 0, i = 0; i < this.length; i++)\n (w = -(this.words[i] | 0) + carry), (carry = w >> 26), (this.words[i] = w & 67108863);\n return (this.negative = 1), this.strip();\n }),\n (BN.prototype._wordDiv = function (num, mode) {\n var shift = this.length - num.length,\n a = this.clone(),\n b = num,\n bhi = b.words[b.length - 1] | 0,\n bhiBits = this._countBits(bhi);\n (shift = 26 - bhiBits),\n shift !== 0 && ((b = b.ushln(shift)), a.iushln(shift), (bhi = b.words[b.length - 1] | 0));\n var m = a.length - b.length,\n q;\n if (mode !== \"mod\") {\n (q = new BN(null)), (q.length = m + 1), (q.words = new Array(q.length));\n for (var i = 0; i < q.length; i++) q.words[i] = 0;\n }\n var diff = a.clone()._ishlnsubmul(b, 1, m);\n diff.negative === 0 && ((a = diff), q && (q.words[m] = 1));\n for (var j = m - 1; j >= 0; j--) {\n var qj = (a.words[b.length + j] | 0) * 67108864 + (a.words[b.length + j - 1] | 0);\n for (qj = Math.min((qj / bhi) | 0, 67108863), a._ishlnsubmul(b, qj, j); a.negative !== 0; )\n qj--, (a.negative = 0), a._ishlnsubmul(b, 1, j), a.isZero() || (a.negative ^= 1);\n q && (q.words[j] = qj);\n }\n return (\n q && q.strip(),\n a.strip(),\n mode !== \"div\" && shift !== 0 && a.iushrn(shift),\n {\n div: q || null,\n mod: a,\n }\n );\n }),\n (BN.prototype.divmod = function (num, mode, positive) {\n if ((assert(!num.isZero()), this.isZero()))\n return {\n div: new BN(0),\n mod: new BN(0),\n };\n var div, mod, res;\n return this.negative !== 0 && num.negative === 0\n ? ((res = this.neg().divmod(num, mode)),\n mode !== \"mod\" && (div = res.div.neg()),\n mode !== \"div\" && ((mod = res.mod.neg()), positive && mod.negative !== 0 && mod.iadd(num)),\n {\n div,\n mod,\n })\n : this.negative === 0 && num.negative !== 0\n ? ((res = this.divmod(num.neg(), mode)),\n mode !== \"mod\" && (div = res.div.neg()),\n {\n div,\n mod: res.mod,\n })\n : (this.negative & num.negative) !== 0\n ? ((res = this.neg().divmod(num.neg(), mode)),\n mode !== \"div\" && ((mod = res.mod.neg()), positive && mod.negative !== 0 && mod.isub(num)),\n {\n div: res.div,\n mod,\n })\n : num.length > this.length || this.cmp(num) < 0\n ? {\n div: new BN(0),\n mod: this,\n }\n : num.length === 1\n ? mode === \"div\"\n ? {\n div: this.divn(num.words[0]),\n mod: null,\n }\n : mode === \"mod\"\n ? {\n div: null,\n mod: new BN(this.modn(num.words[0])),\n }\n : {\n div: this.divn(num.words[0]),\n mod: new BN(this.modn(num.words[0])),\n }\n : this._wordDiv(num, mode);\n }),\n (BN.prototype.div = function (num) {\n return this.divmod(num, \"div\", !1).div;\n }),\n (BN.prototype.mod = function (num) {\n return this.divmod(num, \"mod\", !1).mod;\n }),\n (BN.prototype.umod = function (num) {\n return this.divmod(num, \"mod\", !0).mod;\n }),\n (BN.prototype.divRound = function (num) {\n var dm = this.divmod(num);\n if (dm.mod.isZero()) return dm.div;\n var mod = dm.div.negative !== 0 ? dm.mod.isub(num) : dm.mod,\n half = num.ushrn(1),\n r2 = num.andln(1),\n cmp = mod.cmp(half);\n return cmp < 0 || (r2 === 1 && cmp === 0)\n ? dm.div\n : dm.div.negative !== 0\n ? dm.div.isubn(1)\n : dm.div.iaddn(1);\n }),\n (BN.prototype.modn = function (num) {\n assert(num <= 67108863);\n for (var p = (1 << 26) % num, acc = 0, i = this.length - 1; i >= 0; i--)\n acc = (p * acc + (this.words[i] | 0)) % num;\n return acc;\n }),\n (BN.prototype.idivn = function (num) {\n assert(num <= 67108863);\n for (var carry = 0, i = this.length - 1; i >= 0; i--) {\n var w = (this.words[i] | 0) + carry * 67108864;\n (this.words[i] = (w / num) | 0), (carry = w % num);\n }\n return this.strip();\n }),\n (BN.prototype.divn = function (num) {\n return this.clone().idivn(num);\n }),\n (BN.prototype.egcd = function (p) {\n assert(p.negative === 0), assert(!p.isZero());\n var x = this,\n y = p.clone();\n x.negative !== 0 ? (x = x.umod(p)) : (x = x.clone());\n for (var A = new BN(1), B = new BN(0), C = new BN(0), D = new BN(1), g = 0; x.isEven() && y.isEven(); )\n x.iushrn(1), y.iushrn(1), ++g;\n for (var yp = y.clone(), xp = x.clone(); !x.isZero(); ) {\n for (var i = 0, im = 1; (x.words[0] & im) === 0 && i < 26; ++i, im <<= 1);\n if (i > 0)\n for (x.iushrn(i); i-- > 0; )\n (A.isOdd() || B.isOdd()) && (A.iadd(yp), B.isub(xp)), A.iushrn(1), B.iushrn(1);\n for (var j = 0, jm = 1; (y.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n if (j > 0)\n for (y.iushrn(j); j-- > 0; )\n (C.isOdd() || D.isOdd()) && (C.iadd(yp), D.isub(xp)), C.iushrn(1), D.iushrn(1);\n x.cmp(y) >= 0 ? (x.isub(y), A.isub(C), B.isub(D)) : (y.isub(x), C.isub(A), D.isub(B));\n }\n return {\n a: C,\n b: D,\n gcd: y.iushln(g),\n };\n }),\n (BN.prototype._invmp = function (p) {\n assert(p.negative === 0), assert(!p.isZero());\n var a = this,\n b = p.clone();\n a.negative !== 0 ? (a = a.umod(p)) : (a = a.clone());\n for (var x1 = new BN(1), x2 = new BN(0), delta = b.clone(); 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) for (a.iushrn(i); i-- > 0; ) x1.isOdd() && x1.iadd(delta), x1.iushrn(1);\n for (var j = 0, jm = 1; (b.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n if (j > 0) for (b.iushrn(j); j-- > 0; ) x2.isOdd() && x2.iadd(delta), x2.iushrn(1);\n a.cmp(b) >= 0 ? (a.isub(b), x1.isub(x2)) : (b.isub(a), x2.isub(x1));\n }\n var res;\n return a.cmpn(1) === 0 ? (res = x1) : (res = x2), res.cmpn(0) < 0 && res.iadd(p), res;\n }),\n (BN.prototype.gcd = function (num) {\n if (this.isZero()) return num.abs();\n if (num.isZero()) return this.abs();\n var a = this.clone(),\n b = num.clone();\n (a.negative = 0), (b.negative = 0);\n for (var shift = 0; a.isEven() && b.isEven(); shift++) a.iushrn(1), b.iushrn(1);\n do {\n for (; a.isEven(); ) a.iushrn(1);\n for (; b.isEven(); ) b.iushrn(1);\n var r = a.cmp(b);\n if (r < 0) {\n var t = a;\n (a = b), (b = t);\n } else if (r === 0 || b.cmpn(1) === 0) break;\n a.isub(b);\n } while (!0);\n return b.iushln(shift);\n }),\n (BN.prototype.invm = function (num) {\n return this.egcd(num).a.umod(num);\n }),\n (BN.prototype.isEven = function () {\n return (this.words[0] & 1) === 0;\n }),\n (BN.prototype.isOdd = function () {\n return (this.words[0] & 1) === 1;\n }),\n (BN.prototype.andln = function (num) {\n return this.words[0] & num;\n }),\n (BN.prototype.bincn = function (bit) {\n assert(typeof bit == \"number\");\n var r = bit % 26,\n s = (bit - r) / 26,\n q = 1 << r;\n if (this.length <= s) return this._expand(s + 1), (this.words[s] |= q), this;\n for (var carry = q, i = s; carry !== 0 && i < this.length; i++) {\n var w = this.words[i] | 0;\n (w += carry), (carry = w >>> 26), (w &= 67108863), (this.words[i] = w);\n }\n return carry !== 0 && ((this.words[i] = carry), this.length++), this;\n }),\n (BN.prototype.isZero = function () {\n return this.length === 1 && this.words[0] === 0;\n }),\n (BN.prototype.cmpn = function (num) {\n var negative = num < 0;\n if (this.negative !== 0 && !negative) return -1;\n if (this.negative === 0 && negative) return 1;\n this.strip();\n var res;\n if (this.length > 1) res = 1;\n else {\n negative && (num = -num), assert(num <= 67108863, \"Number is too big\");\n var w = this.words[0] | 0;\n res = w === num ? 0 : w < num ? -1 : 1;\n }\n return this.negative !== 0 ? -res | 0 : res;\n }),\n (BN.prototype.cmp = function (num) {\n if (this.negative !== 0 && num.negative === 0) return -1;\n if (this.negative === 0 && num.negative !== 0) return 1;\n var res = this.ucmp(num);\n return this.negative !== 0 ? -res | 0 : res;\n }),\n (BN.prototype.ucmp = function (num) {\n if (this.length > num.length) return 1;\n if (this.length < num.length) return -1;\n for (var res = 0, i = this.length - 1; i >= 0; i--) {\n var a = this.words[i] | 0,\n b = num.words[i] | 0;\n if (a !== b) {\n a < b ? (res = -1) : a > b && (res = 1);\n break;\n }\n }\n return res;\n }),\n (BN.prototype.gtn = function (num) {\n return this.cmpn(num) === 1;\n }),\n (BN.prototype.gt = function (num) {\n return this.cmp(num) === 1;\n }),\n (BN.prototype.gten = function (num) {\n return this.cmpn(num) >= 0;\n }),\n (BN.prototype.gte = function (num) {\n return this.cmp(num) >= 0;\n }),\n (BN.prototype.ltn = function (num) {\n return this.cmpn(num) === -1;\n }),\n (BN.prototype.lt = function (num) {\n return this.cmp(num) === -1;\n }),\n (BN.prototype.lten = function (num) {\n return this.cmpn(num) <= 0;\n }),\n (BN.prototype.lte = function (num) {\n return this.cmp(num) <= 0;\n }),\n (BN.prototype.eqn = function (num) {\n return this.cmpn(num) === 0;\n }),\n (BN.prototype.eq = function (num) {\n return this.cmp(num) === 0;\n }),\n (BN.red = function (num) {\n return new Red(num);\n }),\n (BN.prototype.toRed = function (ctx) {\n return (\n assert(!this.red, \"Already a number in reduction context\"),\n assert(this.negative === 0, \"red works only with positives\"),\n ctx.convertTo(this)._forceRed(ctx)\n );\n }),\n (BN.prototype.fromRed = function () {\n return assert(this.red, \"fromRed works only with numbers in reduction context\"), this.red.convertFrom(this);\n }),\n (BN.prototype._forceRed = function (ctx) {\n return (this.red = ctx), this;\n }),\n (BN.prototype.forceRed = function (ctx) {\n return assert(!this.red, \"Already a number in reduction context\"), this._forceRed(ctx);\n }),\n (BN.prototype.redAdd = function (num) {\n return assert(this.red, \"redAdd works only with red numbers\"), this.red.add(this, num);\n }),\n (BN.prototype.redIAdd = function (num) {\n return assert(this.red, \"redIAdd works only with red numbers\"), this.red.iadd(this, num);\n }),\n (BN.prototype.redSub = function (num) {\n return assert(this.red, \"redSub works only with red numbers\"), this.red.sub(this, num);\n }),\n (BN.prototype.redISub = function (num) {\n return assert(this.red, \"redISub works only with red numbers\"), this.red.isub(this, num);\n }),\n (BN.prototype.redShl = function (num) {\n return assert(this.red, \"redShl works only with red numbers\"), this.red.shl(this, num);\n }),\n (BN.prototype.redMul = function (num) {\n return (\n assert(this.red, \"redMul works only with red numbers\"),\n this.red._verify2(this, num),\n this.red.mul(this, num)\n );\n }),\n (BN.prototype.redIMul = function (num) {\n return (\n assert(this.red, \"redMul works only with red numbers\"),\n this.red._verify2(this, num),\n this.red.imul(this, num)\n );\n }),\n (BN.prototype.redSqr = function () {\n return assert(this.red, \"redSqr works only with red numbers\"), this.red._verify1(this), this.red.sqr(this);\n }),\n (BN.prototype.redISqr = function () {\n return assert(this.red, \"redISqr works only with red numbers\"), this.red._verify1(this), this.red.isqr(this);\n }),\n (BN.prototype.redSqrt = function () {\n return assert(this.red, \"redSqrt works only with red numbers\"), this.red._verify1(this), this.red.sqrt(this);\n }),\n (BN.prototype.redInvm = function () {\n return assert(this.red, \"redInvm works only with red numbers\"), this.red._verify1(this), this.red.invm(this);\n }),\n (BN.prototype.redNeg = function () {\n return assert(this.red, \"redNeg works only with red numbers\"), this.red._verify1(this), this.red.neg(this);\n }),\n (BN.prototype.redPow = function (num) {\n return assert(this.red && !num.red, \"redPow(normalNum)\"), this.red._verify1(this), this.red.pow(this, num);\n });\n var primes = {\n k256: null,\n p224: null,\n p192: null,\n p25519: null,\n };\n function MPrime(name, p) {\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 (this.tmp = this._tmp());\n }\n (MPrime.prototype._tmp = function () {\n var tmp = new BN(null);\n return (tmp.words = new Array(Math.ceil(this.n / 13))), tmp;\n }),\n (MPrime.prototype.ireduce = function (num) {\n var r = num,\n rlen;\n do this.split(r, this.tmp), (r = this.imulK(r)), (r = r.iadd(this.tmp)), (rlen = r.bitLength());\n while (rlen > this.n);\n var cmp = rlen < this.n ? -1 : r.ucmp(this.p);\n return (\n cmp === 0\n ? ((r.words[0] = 0), (r.length = 1))\n : cmp > 0\n ? r.isub(this.p)\n : r.strip !== void 0\n ? r.strip()\n : r._strip(),\n r\n );\n }),\n (MPrime.prototype.split = function (input, out) {\n input.iushrn(this.n, 0, out);\n }),\n (MPrime.prototype.imulK = function (num) {\n return num.imul(this.k);\n });\n function K256() {\n MPrime.call(this, \"k256\", \"ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f\");\n }\n inherits(K256, MPrime),\n (K256.prototype.split = function (input, output) {\n for (var mask = 4194303, outLen = Math.min(input.length, 9), i = 0; i < outLen; i++)\n output.words[i] = input.words[i];\n if (((output.length = outLen), input.length <= 9)) {\n (input.words[0] = 0), (input.length = 1);\n return;\n }\n var prev = input.words[9];\n for (output.words[output.length++] = prev & mask, i = 10; i < input.length; i++) {\n var next = input.words[i] | 0;\n (input.words[i - 10] = ((next & mask) << 4) | (prev >>> 22)), (prev = next);\n }\n (prev >>>= 22),\n (input.words[i - 10] = prev),\n prev === 0 && input.length > 10 ? (input.length -= 10) : (input.length -= 9);\n }),\n (K256.prototype.imulK = function (num) {\n (num.words[num.length] = 0), (num.words[num.length + 1] = 0), (num.length += 2);\n for (var lo = 0, i = 0; i < num.length; i++) {\n var w = num.words[i] | 0;\n (lo += w * 977), (num.words[i] = lo & 67108863), (lo = w * 64 + ((lo / 67108864) | 0));\n }\n return (\n num.words[num.length - 1] === 0 && (num.length--, num.words[num.length - 1] === 0 && num.length--), num\n );\n });\n function P224() {\n MPrime.call(this, \"p224\", \"ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001\");\n }\n inherits(P224, MPrime);\n function P192() {\n MPrime.call(this, \"p192\", \"ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff\");\n }\n inherits(P192, MPrime);\n function P25519() {\n MPrime.call(this, \"25519\", \"7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed\");\n }\n inherits(P25519, MPrime),\n (P25519.prototype.imulK = function (num) {\n for (var carry = 0, i = 0; i < num.length; i++) {\n var hi = (num.words[i] | 0) * 19 + carry,\n lo = hi & 67108863;\n (hi >>>= 26), (num.words[i] = lo), (carry = hi);\n }\n return carry !== 0 && (num.words[num.length++] = carry), num;\n }),\n (BN._prime = function (name) {\n if (primes[name]) return primes[name];\n var prime2;\n if (name === \"k256\") prime2 = new K256();\n else if (name === \"p224\") prime2 = new P224();\n else if (name === \"p192\") prime2 = new P192();\n else if (name === \"p25519\") prime2 = new P25519();\n else throw new Error(\"Unknown prime \" + name);\n return (primes[name] = prime2), prime2;\n });\n function Red(m) {\n if (typeof m == \"string\") {\n var prime = BN._prime(m);\n (this.m = prime.p), (this.prime = prime);\n } else assert(m.gtn(1), \"modulus must be greater than 1\"), (this.m = m), (this.prime = null);\n }\n (Red.prototype._verify1 = function (a) {\n assert(a.negative === 0, \"red works only with positives\"), assert(a.red, \"red works only with red numbers\");\n }),\n (Red.prototype._verify2 = function (a, b) {\n assert((a.negative | b.negative) === 0, \"red works only with positives\"),\n assert(a.red && a.red === b.red, \"red works only with red numbers\");\n }),\n (Red.prototype.imod = function (a) {\n return this.prime ? this.prime.ireduce(a)._forceRed(this) : a.umod(this.m)._forceRed(this);\n }),\n (Red.prototype.neg = function (a) {\n return a.isZero() ? a.clone() : this.m.sub(a)._forceRed(this);\n }),\n (Red.prototype.add = function (a, b) {\n this._verify2(a, b);\n var res = a.add(b);\n return res.cmp(this.m) >= 0 && res.isub(this.m), res._forceRed(this);\n }),\n (Red.prototype.iadd = function (a, b) {\n this._verify2(a, b);\n var res = a.iadd(b);\n return res.cmp(this.m) >= 0 && res.isub(this.m), res;\n }),\n (Red.prototype.sub = function (a, b) {\n this._verify2(a, b);\n var res = a.sub(b);\n return res.cmpn(0) < 0 && res.iadd(this.m), res._forceRed(this);\n }),\n (Red.prototype.isub = function (a, b) {\n this._verify2(a, b);\n var res = a.isub(b);\n return res.cmpn(0) < 0 && res.iadd(this.m), res;\n }),\n (Red.prototype.shl = function (a, num) {\n return this._verify1(a), this.imod(a.ushln(num));\n }),\n (Red.prototype.imul = function (a, b) {\n return this._verify2(a, b), this.imod(a.imul(b));\n }),\n (Red.prototype.mul = function (a, b) {\n return this._verify2(a, b), this.imod(a.mul(b));\n }),\n (Red.prototype.isqr = function (a) {\n return this.imul(a, a.clone());\n }),\n (Red.prototype.sqr = function (a) {\n return this.mul(a, a);\n }),\n (Red.prototype.sqrt = function (a) {\n if (a.isZero()) return a.clone();\n var mod3 = this.m.andln(3);\n if ((assert(mod3 % 2 === 1), mod3 === 3)) {\n var pow = this.m.add(new BN(1)).iushrn(2);\n return this.pow(a, pow);\n }\n for (var q = this.m.subn(1), s = 0; !q.isZero() && q.andln(1) === 0; ) s++, q.iushrn(1);\n assert(!q.isZero());\n var one = new BN(1).toRed(this),\n nOne = one.redNeg(),\n lpow = this.m.subn(1).iushrn(1),\n z = this.m.bitLength();\n for (z = new BN(2 * z * z).toRed(this); this.pow(z, lpow).cmp(nOne) !== 0; ) z.redIAdd(nOne);\n for (\n var c = this.pow(z, q), r = this.pow(a, q.addn(1).iushrn(1)), t = this.pow(a, q), m = s;\n t.cmp(one) !== 0;\n\n ) {\n for (var tmp = t, i = 0; tmp.cmp(one) !== 0; i++) tmp = tmp.redSqr();\n assert(i < m);\n var b = this.pow(c, new BN(1).iushln(m - i - 1));\n (r = r.redMul(b)), (c = b.redSqr()), (t = t.redMul(c)), (m = i);\n }\n return r;\n }),\n (Red.prototype.invm = function (a) {\n var inv = a._invmp(this.m);\n return inv.negative !== 0 ? ((inv.negative = 0), this.imod(inv).redNeg()) : this.imod(inv);\n }),\n (Red.prototype.pow = function (a, num) {\n if (num.isZero()) return new BN(1).toRed(this);\n if (num.cmpn(1) === 0) return a.clone();\n var windowSize = 4,\n wnd = new Array(1 << windowSize);\n (wnd[0] = new BN(1).toRed(this)), (wnd[1] = a);\n for (var i = 2; i < wnd.length; i++) wnd[i] = this.mul(wnd[i - 1], a);\n var res = wnd[0],\n current = 0,\n currentLen = 0,\n start = num.bitLength() % 26;\n for (start === 0 && (start = 26), i = num.length - 1; i >= 0; i--) {\n for (var word = num.words[i], j = start - 1; j >= 0; j--) {\n var bit = (word >> j) & 1;\n if ((res !== wnd[0] && (res = this.sqr(res)), bit === 0 && current === 0)) {\n currentLen = 0;\n continue;\n }\n (current <<= 1),\n (current |= bit),\n currentLen++,\n !(currentLen !== windowSize && (i !== 0 || j !== 0)) &&\n ((res = this.mul(res, wnd[current])), (currentLen = 0), (current = 0));\n }\n start = 26;\n }\n return res;\n }),\n (Red.prototype.convertTo = function (num) {\n var r = num.umod(this.m);\n return r === num ? r.clone() : r;\n }),\n (Red.prototype.convertFrom = function (num) {\n var res = num.clone();\n return (res.red = null), res;\n }),\n (BN.mont = function (num) {\n return new Mont(num);\n });\n function Mont(m) {\n Red.call(this, m),\n (this.shift = this.m.bitLength()),\n this.shift % 26 !== 0 && (this.shift += 26 - (this.shift % 26)),\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 (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 (Mont.prototype.convertTo = function (num) {\n return this.imod(num.ushln(this.shift));\n }),\n (Mont.prototype.convertFrom = function (num) {\n var r = this.imod(num.mul(this.rinv));\n return (r.red = null), r;\n }),\n (Mont.prototype.imul = function (a, b) {\n if (a.isZero() || b.isZero()) return (a.words[0] = 0), (a.length = 1), a;\n var t = a.imul(b),\n c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m),\n u = t.isub(c).iushrn(this.shift),\n res = u;\n return (\n u.cmp(this.m) >= 0 ? (res = u.isub(this.m)) : u.cmpn(0) < 0 && (res = u.iadd(this.m)), res._forceRed(this)\n );\n }),\n (Mont.prototype.mul = function (a, b) {\n if (a.isZero() || b.isZero()) return new BN(0)._forceRed(this);\n var t = a.mul(b),\n c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m),\n u = t.isub(c).iushrn(this.shift),\n res = u;\n return (\n u.cmp(this.m) >= 0 ? (res = u.isub(this.m)) : u.cmpn(0) < 0 && (res = u.iadd(this.m)), res._forceRed(this)\n );\n }),\n (Mont.prototype.invm = function (a) {\n var res = this.imod(a._invmp(this.m).mul(this.r2));\n return res._forceRed(this);\n });\n })(typeof module > \"u\" || module, exports);\n },\n});\n\nconst { CryptoHasher } = globalThis.Bun;\n\n// node_modules/public-encrypt/withPublic.js\nvar require_withPublic = __commonJS({\n \"node_modules/public-encrypt/withPublic.js\"(exports, module) {\n var BN = require_bn7(),\n Buffer2 = require_safe_buffer().Buffer;\n function withPublic(paddedMsg, key) {\n return Buffer2.from(paddedMsg.toRed(BN.mont(key.modulus)).redPow(new BN(key.publicExponent)).fromRed().toArray());\n }\n module.exports = withPublic;\n },\n});\n\n// node_modules/public-encrypt/publicEncrypt.js\nvar require_publicEncrypt = __commonJS({\n \"node_modules/public-encrypt/publicEncrypt.js\"(exports, module) {\n var parseKeys = require_parse_asn1(),\n randomBytes = require_browser(),\n createHash = require_browser2(),\n mgf = require_mgf(),\n xor = require_xor(),\n BN = require_bn7(),\n withPublic = require_withPublic(),\n crt = require_browserify_rsa(),\n Buffer2 = require_safe_buffer().Buffer;\n module.exports = function (publicKey, msg, reverse) {\n var padding;\n publicKey.padding ? (padding = publicKey.padding) : reverse ? (padding = 1) : (padding = 4);\n var key = parseKeys(publicKey),\n paddedMsg;\n if (padding === 4) paddedMsg = oaep(key, msg);\n else if (padding === 1) paddedMsg = pkcs1(key, msg, reverse);\n else if (padding === 3) {\n if (((paddedMsg = new BN(msg)), paddedMsg.cmp(key.modulus) >= 0)) throw new Error(\"data too long for modulus\");\n } else throw new Error(\"unknown padding\");\n return reverse ? crt(paddedMsg, key) : withPublic(paddedMsg, key);\n };\n function oaep(key, msg) {\n var k = key.modulus.byteLength(),\n mLen = msg.length,\n iHash = createHash(\"sha1\").update(Buffer2.alloc(0)).digest(),\n hLen = iHash.length,\n hLen2 = 2 * hLen;\n if (mLen > k - hLen2 - 2) throw new Error(\"message too long\");\n var ps = Buffer2.alloc(k - mLen - hLen2 - 2),\n dblen = k - hLen - 1,\n seed = randomBytes(hLen),\n maskedDb = xor(Buffer2.concat([iHash, ps, Buffer2.alloc(1, 1), msg], dblen), mgf(seed, dblen)),\n maskedSeed = xor(seed, mgf(maskedDb, hLen));\n return new BN(Buffer2.concat([Buffer2.alloc(1), maskedSeed, maskedDb], k));\n }\n function pkcs1(key, msg, reverse) {\n var mLen = msg.length,\n k = key.modulus.byteLength();\n if (mLen > k - 11) throw new Error(\"message too long\");\n var ps;\n return (\n reverse ? (ps = Buffer2.alloc(k - mLen - 3, 255)) : (ps = nonZero(k - mLen - 3)),\n new BN(Buffer2.concat([Buffer2.from([0, reverse ? 1 : 2]), ps, Buffer2.alloc(1), msg], k))\n );\n }\n function nonZero(len) {\n for (var out = Buffer2.allocUnsafe(len), i = 0, cache = randomBytes(len * 2), cur = 0, num; i < len; )\n cur === cache.length && ((cache = randomBytes(len * 2)), (cur = 0)),\n (num = cache[cur++]),\n num && (out[i++] = num);\n return out;\n }\n },\n});\n\n// node_modules/public-encrypt/privateDecrypt.js\nvar require_privateDecrypt = __commonJS({\n \"node_modules/public-encrypt/privateDecrypt.js\"(exports, module) {\n var parseKeys = require_parse_asn1(),\n mgf = require_mgf(),\n xor = require_xor(),\n BN = require_bn7(),\n crt = require_browserify_rsa(),\n createHash = require_browser2(),\n withPublic = require_withPublic(),\n Buffer2 = require_safe_buffer().Buffer;\n module.exports = function (privateKey, enc, reverse) {\n var padding;\n privateKey.padding ? (padding = privateKey.padding) : reverse ? (padding = 1) : (padding = 4);\n var key = parseKeys(privateKey),\n k = key.modulus.byteLength();\n if (enc.length > k || new BN(enc).cmp(key.modulus) >= 0) throw new Error(\"decryption error\");\n var msg;\n reverse ? (msg = withPublic(new BN(enc), key)) : (msg = crt(enc, key));\n var zBuffer = Buffer2.alloc(k - msg.length);\n if (((msg = Buffer2.concat([zBuffer, msg], k)), padding === 4)) return oaep(key, msg);\n if (padding === 1) return pkcs1(key, msg, reverse);\n if (padding === 3) return msg;\n throw new Error(\"unknown padding\");\n };\n function oaep(key, msg) {\n var k = key.modulus.byteLength(),\n iHash = createHash(\"sha1\").update(Buffer2.alloc(0)).digest(),\n hLen = iHash.length;\n if (msg[0] !== 0) throw new Error(\"decryption error\");\n var maskedSeed = msg.slice(1, hLen + 1),\n maskedDb = msg.slice(hLen + 1),\n seed = xor(maskedSeed, mgf(maskedDb, hLen)),\n db = xor(maskedDb, mgf(seed, k - hLen - 1));\n if (compare(iHash, db.slice(0, hLen))) throw new Error(\"decryption error\");\n for (var i = hLen; db[i] === 0; ) i++;\n if (db[i++] !== 1) throw new Error(\"decryption error\");\n return db.slice(i);\n }\n function pkcs1(key, msg, reverse) {\n for (var p1 = msg.slice(0, 2), i = 2, status = 0; msg[i++] !== 0; )\n if (i >= msg.length) {\n status++;\n break;\n }\n var ps = msg.slice(2, i - 1);\n if (\n (((p1.toString(\"hex\") !== \"0002\" && !reverse) || (p1.toString(\"hex\") !== \"0001\" && reverse)) && status++,\n ps.length < 8 && status++,\n status)\n )\n throw new Error(\"decryption error\");\n return msg.slice(i);\n }\n function compare(a, b) {\n (a = Buffer2.from(a)), (b = Buffer2.from(b));\n var dif = 0,\n len = a.length;\n a.length !== b.length && (dif++, (len = Math.min(a.length, b.length)));\n for (var i = -1; ++i < len; ) dif += a[i] ^ b[i];\n return dif;\n }\n },\n});\n\n// node_modules/public-encrypt/browser.js\nvar require_browser10 = __commonJS({\n \"node_modules/public-encrypt/browser.js\"(exports) {\n exports.publicEncrypt = require_publicEncrypt();\n exports.privateDecrypt = require_privateDecrypt();\n exports.privateEncrypt = function (key, buf) {\n return exports.publicEncrypt(key, buf, !0);\n };\n exports.publicDecrypt = function (key, buf) {\n return exports.privateDecrypt(key, buf, !0);\n };\n },\n});\n\n// node_modules/randomfill/browser.js\nvar require_browser11 = __commonJS({\n \"node_modules/randomfill/browser.js\"(exports) {\n \"use strict\";\n var safeBuffer = require_safe_buffer(),\n randombytes = require_browser(),\n Buffer2 = safeBuffer.Buffer,\n kBufferMaxLength = safeBuffer.kMaxLength,\n kMaxUint32 = Math.pow(2, 32) - 1;\n function assertOffset(offset, length) {\n if (typeof offset != \"number\" || offset !== offset) throw new TypeError(\"offset must be a number\");\n if (offset > kMaxUint32 || offset < 0) throw new TypeError(\"offset must be a uint32\");\n if (offset > kBufferMaxLength || offset > length) throw new RangeError(\"offset out of range\");\n }\n function assertSize(size, offset, length) {\n if (typeof size != \"number\" || size !== size) throw new TypeError(\"size must be a number\");\n if (size > kMaxUint32 || size < 0) throw new TypeError(\"size must be a uint32\");\n if (size + offset > length || size > kBufferMaxLength) throw new RangeError(\"buffer too small\");\n }\n\n exports.randomFill = randomFill;\n exports.randomFillSync = randomFillSync;\n\n function randomFill(buf, offset, size, cb) {\n if (!Buffer2.isBuffer(buf) && !(buf instanceof global.Uint8Array))\n throw new TypeError('\"buf\" argument must be a Buffer or Uint8Array');\n if (typeof offset == \"function\") (cb = offset), (offset = 0), (size = buf.length);\n else if (typeof size == \"function\") (cb = size), (size = buf.length - offset);\n else if (typeof cb != \"function\") throw new TypeError('\"cb\" argument must be a function');\n return assertOffset(offset, buf.length), assertSize(size, offset, buf.length), actualFill(buf, offset, size, cb);\n }\n function actualFill(buf, offset, size, cb) {\n if (cb) {\n randombytes(size, function (err, bytes2) {\n if (err) return cb(err);\n bytes2.copy(buf, offset), cb(null, buf);\n });\n return;\n }\n var bytes = randombytes(size);\n return bytes.copy(buf, offset), buf;\n }\n function randomFillSync(buf, offset, size) {\n if ((typeof offset > \"u\" && (offset = 0), !Buffer2.isBuffer(buf) && !(buf instanceof global.Uint8Array)))\n throw new TypeError('\"buf\" argument must be a Buffer or Uint8Array');\n return (\n assertOffset(offset, buf.length),\n size === void 0 && (size = buf.length - offset),\n assertSize(size, offset, buf.length),\n actualFill(buf, offset, size)\n );\n }\n },\n});\n\n// node_modules/crypto-browserify/index.js\nvar require_crypto_browserify2 = __commonJS({\n \"node_modules/crypto-browserify/index.js\"(exports) {\n \"use strict\";\n exports.randomBytes = exports.rng = exports.pseudoRandomBytes = exports.prng = require_browser();\n exports.createHash = require_browser2();\n exports.Hash = exports.createHash.Hash;\n exports.createHmac = exports.Hmac = require_browser3();\n var algos = require_algos(),\n algoKeys = Object.keys(algos),\n hashes = [\"sha1\", \"sha224\", \"sha256\", \"sha384\", \"sha512\", \"md5\", \"rmd160\"].concat(algoKeys);\n exports.getHashes = function () {\n return hashes;\n };\n var p = require_browser4();\n exports.pbkdf2 = p.pbkdf2;\n exports.pbkdf2Sync = p.pbkdf2Sync;\n var aes = require_browser6();\n exports.Cipher = aes.Cipher;\n exports.createCipher = aes.createCipher;\n exports.Cipheriv = aes.Cipheriv;\n exports.createCipheriv = aes.createCipheriv;\n exports.Decipher = aes.Decipher;\n exports.createDecipher = aes.createDecipher;\n exports.Decipheriv = aes.Decipheriv;\n exports.createDecipheriv = aes.createDecipheriv;\n exports.getCiphers = aes.getCiphers;\n exports.listCiphers = aes.listCiphers;\n var dh = require_browser7();\n exports.DiffieHellmanGroup = dh.DiffieHellmanGroup;\n exports.createDiffieHellmanGroup = dh.createDiffieHellmanGroup;\n exports.getDiffieHellman = dh.getDiffieHellman;\n exports.createDiffieHellman = dh.createDiffieHellman;\n exports.DiffieHellman = dh.DiffieHellman;\n var sign = require_browser8();\n exports.createSign = sign.createSign;\n exports.Sign = sign.Sign;\n exports.createVerify = sign.createVerify;\n exports.Verify = sign.Verify;\n exports.createECDH = require_browser9();\n var publicEncrypt = require_browser10();\n exports.publicEncrypt = publicEncrypt.publicEncrypt;\n exports.privateEncrypt = publicEncrypt.privateEncrypt;\n exports.publicDecrypt = publicEncrypt.publicDecrypt;\n exports.privateDecrypt = publicEncrypt.privateDecrypt;\n exports.getRandomValues = values => crypto.getRandomValues(values);\n var rf = require_browser11();\n exports.randomFill = rf.randomFill;\n exports.randomFillSync = rf.randomFillSync;\n exports.createCredentials = function () {\n throw new Error(\n [\n \"sorry, createCredentials is not implemented yet\",\n \"we accept pull requests\",\n \"https://github.com/crypto-browserify/crypto-browserify\",\n ].join(`\n`),\n );\n };\n exports.constants = {\n DH_CHECK_P_NOT_SAFE_PRIME: 2,\n DH_CHECK_P_NOT_PRIME: 1,\n DH_UNABLE_TO_CHECK_GENERATOR: 4,\n DH_NOT_SUITABLE_GENERATOR: 8,\n NPN_ENABLED: 1,\n ALPN_ENABLED: 1,\n RSA_PKCS1_PADDING: 1,\n RSA_SSLV23_PADDING: 2,\n RSA_NO_PADDING: 3,\n RSA_PKCS1_OAEP_PADDING: 4,\n RSA_X931_PADDING: 5,\n RSA_PKCS1_PSS_PADDING: 6,\n POINT_CONVERSION_COMPRESSED: 2,\n POINT_CONVERSION_UNCOMPRESSED: 4,\n POINT_CONVERSION_HYBRID: 6,\n };\n },\n});\n\n// crypto.js\nvar crypto_exports = {\n ...require_crypto_browserify2(),\n [Symbol.for(\"CommonJS\")]: 0,\n};\nvar DEFAULT_ENCODING = \"buffer\",\n getRandomValues = array => crypto.getRandomValues(array),\n randomUUID = () => crypto.randomUUID(),\n timingSafeEqual =\n \"timingSafeEqual\" in crypto\n ? (a, b) => {\n let { byteLength: byteLengthA } = a,\n { byteLength: byteLengthB } = b;\n if (typeof byteLengthA != \"number\" || typeof byteLengthB != \"number\")\n throw new TypeError(\"Input must be an array buffer view\");\n if (byteLengthA !== byteLengthB) throw new RangeError(\"Input buffers must have the same length\");\n return crypto.timingSafeEqual(a, b);\n }\n : void 0,\n scryptSync =\n \"scryptSync\" in crypto\n ? (password, salt, keylen, options) => {\n let res = crypto.scryptSync(password, salt, keylen, options);\n return DEFAULT_ENCODING !== \"buffer\" ? new Buffer(res).toString(DEFAULT_ENCODING) : new Buffer(res);\n }\n : void 0,\n scrypt =\n \"scryptSync\" in crypto\n ? function (password, salt, keylen, options, callback) {\n if (\n (typeof options == \"function\" && ((callback = options), (options = void 0)), typeof callback != \"function\")\n ) {\n var err = new TypeError(\"callback must be a function\");\n throw ((err.code = \"ERR_INVALID_CALLBACK\"), err);\n }\n try {\n let result = crypto.scryptSync(password, salt, keylen, options);\n process.nextTick(\n callback,\n null,\n DEFAULT_ENCODING !== \"buffer\" ? new Buffer(result).toString(DEFAULT_ENCODING) : new Buffer(result),\n );\n } catch (err2) {\n throw err2;\n }\n }\n : void 0;\ntimingSafeEqual &&\n (Object.defineProperty(timingSafeEqual, \"name\", {\n value: \"::bunternal::\",\n }),\n Object.defineProperty(scrypt, \"name\", {\n value: \"::bunternal::\",\n }),\n Object.defineProperty(scryptSync, \"name\", {\n value: \"::bunternal::\",\n }));\nvar webcrypto = crypto;\n__export(crypto_exports, {\n DEFAULT_ENCODING: () => DEFAULT_ENCODING,\n getRandomValues: () => getRandomValues,\n randomUUID: () => randomUUID,\n scrypt: () => scrypt,\n scryptSync: () => scryptSync,\n timingSafeEqual: () => timingSafeEqual,\n webcrypto: () => webcrypto,\n subtle: () => webcrypto.subtle,\n});\n\nexport const {\n randomBytes,\n rng,\n pseudoRandomBytes,\n prng,\n Hash,\n createHash,\n createHmac,\n Hmac,\n getHashes,\n pbkdf2,\n pbkdf2Sync,\n Cipher,\n createCipher,\n Cipheriv,\n createCipheriv,\n Decipher,\n createDecipher,\n Decipheriv,\n createDecipheriv,\n getCiphers,\n listCiphers,\n DiffieHellmanGroup,\n createDiffieHellmanGroup,\n getDiffieHellman,\n createDiffieHellman,\n DiffieHellman,\n createSign,\n Sign,\n createVerify,\n Verify,\n createECDH,\n publicEncrypt,\n privateEncrypt,\n publicDecrypt,\n privateDecrypt,\n randomFill,\n randomFillSync,\n createCredentials,\n constants,\n} = crypto_exports;\nexport { DEFAULT_ENCODING, getRandomValues, randomUUID, scrypt, scryptSync, timingSafeEqual, webcrypto };\nexport default crypto_exports;\n/*! safe-buffer. MIT License. Feross Aboukhadijeh <https://feross.org/opensource> */\n", - "// Hardcoded module \"node:crypto\"\nvar __create = Object.create;\nvar __defProp = Object.defineProperty;\nvar __getOwnPropDesc = Object.getOwnPropertyDescriptor;\nvar __getOwnPropNames = Object.getOwnPropertyNames;\nvar __getProtoOf = Object.getPrototypeOf,\n __hasOwnProp = Object.prototype.hasOwnProperty;\n\nconst MAX_STRING_LENGTH = 536870888;\n\nvar __require = id => import.meta.require(id);\nconst crypto = globalThis.crypto;\nconst globalCrypto = crypto;\n\nvar __esm = (fn, res) =>\n function () {\n return fn && (res = (0, fn[__getOwnPropNames(fn)[0]])((fn = 0))), res;\n };\nvar __commonJS = (cb, mod) =>\n function () {\n return mod || (0, cb[__getOwnPropNames(cb)[0]])((mod = { exports: {} }).exports, mod), mod.exports;\n };\nvar __export = (target, all) => {\n for (var name in all) __defProp(target, name, { get: all[name], enumerable: !0 });\n },\n __copyProps = (to, from, except, desc) => {\n if ((from && typeof from == \"object\") || typeof from == \"function\")\n for (let key of __getOwnPropNames(from))\n !__hasOwnProp.call(to, key) &&\n key !== except &&\n __defProp(to, key, {\n get: () => from[key],\n enumerable: !(desc = __getOwnPropDesc(from, key)) || desc.enumerable,\n });\n return to;\n },\n __reExport = (target, mod, secondTarget) => (\n __copyProps(target, mod, \"default\"), secondTarget && __copyProps(secondTarget, mod, \"default\")\n ),\n __toESM = (mod, isNodeMode, target) => (\n (target = mod != null ? __create(__getProtoOf(mod)) : {}),\n __copyProps(\n isNodeMode || !mod || !mod.__esModule ? __defProp(target, \"default\", { value: mod, enumerable: !0 }) : target,\n mod,\n )\n );\n\n// node_modules/safe-buffer/index.js\nvar require_safe_buffer = __commonJS({\n \"node_modules/safe-buffer/index.js\"(exports, module) {\n var buffer = __require(\"buffer\"),\n Buffer2 = buffer.Buffer;\n function copyProps(src, dst) {\n for (var key in src) dst[key] = src[key];\n }\n Buffer2.from && Buffer2.alloc && Buffer2.allocUnsafe && Buffer2.allocUnsafeSlow\n ? (module.exports = buffer)\n : (copyProps(buffer, exports), (exports.Buffer = SafeBuffer));\n function SafeBuffer(arg, encodingOrOffset, length) {\n return Buffer2(arg, encodingOrOffset, length);\n }\n SafeBuffer.prototype = Object.create(Buffer2.prototype);\n copyProps(Buffer2, SafeBuffer);\n SafeBuffer.from = function (arg, encodingOrOffset, length) {\n if (typeof arg == \"number\") throw new TypeError(\"Argument must not be a number\");\n return Buffer2(arg, encodingOrOffset, length);\n };\n SafeBuffer.alloc = function (size, fill, encoding) {\n if (typeof size != \"number\") throw new TypeError(\"Argument must be a number\");\n var buf = Buffer2(size);\n return (\n fill !== void 0 ? (typeof encoding == \"string\" ? buf.fill(fill, encoding) : buf.fill(fill)) : buf.fill(0), buf\n );\n };\n SafeBuffer.allocUnsafe = function (size) {\n if (typeof size != \"number\") throw new TypeError(\"Argument must be a number\");\n return Buffer2(size);\n };\n SafeBuffer.allocUnsafeSlow = function (size) {\n if (typeof size != \"number\") throw new TypeError(\"Argument must be a number\");\n return buffer.SlowBuffer(size);\n };\n },\n});\n\n// node_modules/randombytes/browser.js\nvar require_browser = __commonJS({\n \"node_modules/randombytes/browser.js\"(exports, module) {\n \"use strict\";\n var MAX_BYTES = 65536,\n MAX_UINT32 = 4294967295;\n function oldBrowser() {\n throw new Error(`Secure random number generation is not supported by this browser.\nUse Chrome, Firefox or Internet Explorer 11`);\n }\n var Buffer2 = require_safe_buffer().Buffer,\n crypto2 = globalCrypto;\n crypto2 && crypto2.getRandomValues ? (module.exports = randomBytes) : (module.exports = oldBrowser);\n function randomBytes(size, cb) {\n if (size > MAX_UINT32) throw new RangeError(\"requested too many random bytes\");\n var bytes = Buffer2.allocUnsafe(size);\n if (size > 0)\n if (size > MAX_BYTES)\n for (var generated = 0; generated < size; generated += MAX_BYTES)\n crypto2.getRandomValues(bytes.slice(generated, generated + MAX_BYTES));\n else crypto2.getRandomValues(bytes);\n return typeof cb == \"function\"\n ? process.nextTick(function () {\n cb(null, bytes);\n })\n : bytes;\n }\n },\n});\n\n// node_modules/inherits/inherits_browser.js\nvar require_inherits_browser = __commonJS({\n \"node_modules/inherits/inherits_browser.js\"(exports, module) {\n typeof Object.create == \"function\"\n ? (module.exports = function (ctor, superCtor) {\n superCtor &&\n ((ctor.super_ = superCtor),\n (ctor.prototype = Object.create(superCtor.prototype, {\n constructor: {\n value: ctor,\n enumerable: !1,\n writable: !0,\n configurable: !0,\n },\n })));\n })\n : (module.exports = function (ctor, superCtor) {\n if (superCtor) {\n ctor.super_ = superCtor;\n var TempCtor = function () {};\n (TempCtor.prototype = superCtor.prototype),\n (ctor.prototype = new TempCtor()),\n (ctor.prototype.constructor = ctor);\n }\n });\n },\n});\n\n// node_modules/hash-base/index.js\nvar require_hash_base = __commonJS({\n \"node_modules/hash-base/index.js\"(exports, module) {\n \"use strict\";\n var Buffer2 = require_safe_buffer().Buffer,\n Transform = __require(\"readable-stream\").Transform,\n inherits = require_inherits_browser();\n function throwIfNotStringOrBuffer(val, prefix) {\n if (!Buffer2.isBuffer(val) && typeof val != \"string\")\n throw new TypeError(prefix + \" must be a string or a buffer\");\n }\n function HashBase(blockSize) {\n Transform.call(this),\n (this._block = Buffer2.allocUnsafe(blockSize)),\n (this._blockSize = blockSize),\n (this._blockOffset = 0),\n (this._length = [0, 0, 0, 0]),\n (this._finalized = !1);\n }\n inherits(HashBase, Transform);\n HashBase.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 callback(error);\n };\n HashBase.prototype._flush = function (callback) {\n var error = null;\n try {\n this.push(this.digest());\n } catch (err) {\n error = err;\n }\n callback(error);\n };\n HashBase.prototype.update = function (data, encoding) {\n if ((throwIfNotStringOrBuffer(data, \"Data\"), this._finalized)) throw new Error(\"Digest already called\");\n Buffer2.isBuffer(data) || (data = Buffer2.from(data, encoding));\n for (var block = this._block, offset = 0; this._blockOffset + data.length - offset >= this._blockSize; ) {\n for (var i = this._blockOffset; i < this._blockSize; ) block[i++] = data[offset++];\n this._update(), (this._blockOffset = 0);\n }\n for (; offset < data.length; ) block[this._blockOffset++] = data[offset++];\n for (var j = 0, carry = data.length * 8; carry > 0; ++j)\n (this._length[j] += carry),\n (carry = (this._length[j] / 4294967296) | 0),\n carry > 0 && (this._length[j] -= 4294967296 * carry);\n return this;\n };\n HashBase.prototype._update = function () {\n throw new Error(\"_update is not implemented\");\n };\n HashBase.prototype.digest = function (encoding) {\n if (this._finalized) throw new Error(\"Digest already called\");\n this._finalized = !0;\n var digest = this._digest();\n encoding !== void 0 && (digest = digest.toString(encoding)), this._block.fill(0), (this._blockOffset = 0);\n for (var i = 0; i < 4; ++i) this._length[i] = 0;\n return digest;\n };\n HashBase.prototype._digest = function () {\n throw new Error(\"_digest is not implemented\");\n };\n module.exports = HashBase;\n },\n});\n\n// node_modules/md5.js/index.js\nvar require_md5 = __commonJS({\n \"node_modules/md5.js/index.js\"(exports, module) {\n \"use strict\";\n var inherits = require_inherits_browser(),\n HashBase = require_hash_base(),\n Buffer2 = require_safe_buffer().Buffer,\n ARRAY16 = new Array(16);\n function MD5() {\n HashBase.call(this, 64),\n (this._a = 1732584193),\n (this._b = 4023233417),\n (this._c = 2562383102),\n (this._d = 271733878);\n }\n inherits(MD5, HashBase);\n MD5.prototype._update = function () {\n for (var M = ARRAY16, i = 0; i < 16; ++i) M[i] = this._block.readInt32LE(i * 4);\n var a = this._a,\n b = this._b,\n c = this._c,\n d = this._d;\n (a = fnF(a, b, c, d, M[0], 3614090360, 7)),\n (d = fnF(d, a, b, c, M[1], 3905402710, 12)),\n (c = fnF(c, d, a, b, M[2], 606105819, 17)),\n (b = fnF(b, c, d, a, M[3], 3250441966, 22)),\n (a = fnF(a, b, c, d, M[4], 4118548399, 7)),\n (d = fnF(d, a, b, c, M[5], 1200080426, 12)),\n (c = fnF(c, d, a, b, M[6], 2821735955, 17)),\n (b = fnF(b, c, d, a, M[7], 4249261313, 22)),\n (a = fnF(a, b, c, d, M[8], 1770035416, 7)),\n (d = fnF(d, a, b, c, M[9], 2336552879, 12)),\n (c = fnF(c, d, a, b, M[10], 4294925233, 17)),\n (b = fnF(b, c, d, a, M[11], 2304563134, 22)),\n (a = fnF(a, b, c, d, M[12], 1804603682, 7)),\n (d = fnF(d, a, b, c, M[13], 4254626195, 12)),\n (c = fnF(c, d, a, b, M[14], 2792965006, 17)),\n (b = fnF(b, c, d, a, M[15], 1236535329, 22)),\n (a = fnG(a, b, c, d, M[1], 4129170786, 5)),\n (d = fnG(d, a, b, c, M[6], 3225465664, 9)),\n (c = fnG(c, d, a, b, M[11], 643717713, 14)),\n (b = fnG(b, c, d, a, M[0], 3921069994, 20)),\n (a = fnG(a, b, c, d, M[5], 3593408605, 5)),\n (d = fnG(d, a, b, c, M[10], 38016083, 9)),\n (c = fnG(c, d, a, b, M[15], 3634488961, 14)),\n (b = fnG(b, c, d, a, M[4], 3889429448, 20)),\n (a = fnG(a, b, c, d, M[9], 568446438, 5)),\n (d = fnG(d, a, b, c, M[14], 3275163606, 9)),\n (c = fnG(c, d, a, b, M[3], 4107603335, 14)),\n (b = fnG(b, c, d, a, M[8], 1163531501, 20)),\n (a = fnG(a, b, c, d, M[13], 2850285829, 5)),\n (d = fnG(d, a, b, c, M[2], 4243563512, 9)),\n (c = fnG(c, d, a, b, M[7], 1735328473, 14)),\n (b = fnG(b, c, d, a, M[12], 2368359562, 20)),\n (a = fnH(a, b, c, d, M[5], 4294588738, 4)),\n (d = fnH(d, a, b, c, M[8], 2272392833, 11)),\n (c = fnH(c, d, a, b, M[11], 1839030562, 16)),\n (b = fnH(b, c, d, a, M[14], 4259657740, 23)),\n (a = fnH(a, b, c, d, M[1], 2763975236, 4)),\n (d = fnH(d, a, b, c, M[4], 1272893353, 11)),\n (c = fnH(c, d, a, b, M[7], 4139469664, 16)),\n (b = fnH(b, c, d, a, M[10], 3200236656, 23)),\n (a = fnH(a, b, c, d, M[13], 681279174, 4)),\n (d = fnH(d, a, b, c, M[0], 3936430074, 11)),\n (c = fnH(c, d, a, b, M[3], 3572445317, 16)),\n (b = fnH(b, c, d, a, M[6], 76029189, 23)),\n (a = fnH(a, b, c, d, M[9], 3654602809, 4)),\n (d = fnH(d, a, b, c, M[12], 3873151461, 11)),\n (c = fnH(c, d, a, b, M[15], 530742520, 16)),\n (b = fnH(b, c, d, a, M[2], 3299628645, 23)),\n (a = fnI(a, b, c, d, M[0], 4096336452, 6)),\n (d = fnI(d, a, b, c, M[7], 1126891415, 10)),\n (c = fnI(c, d, a, b, M[14], 2878612391, 15)),\n (b = fnI(b, c, d, a, M[5], 4237533241, 21)),\n (a = fnI(a, b, c, d, M[12], 1700485571, 6)),\n (d = fnI(d, a, b, c, M[3], 2399980690, 10)),\n (c = fnI(c, d, a, b, M[10], 4293915773, 15)),\n (b = fnI(b, c, d, a, M[1], 2240044497, 21)),\n (a = fnI(a, b, c, d, M[8], 1873313359, 6)),\n (d = fnI(d, a, b, c, M[15], 4264355552, 10)),\n (c = fnI(c, d, a, b, M[6], 2734768916, 15)),\n (b = fnI(b, c, d, a, M[13], 1309151649, 21)),\n (a = fnI(a, b, c, d, M[4], 4149444226, 6)),\n (d = fnI(d, a, b, c, M[11], 3174756917, 10)),\n (c = fnI(c, d, a, b, M[2], 718787259, 15)),\n (b = fnI(b, c, d, a, M[9], 3951481745, 21)),\n (this._a = (this._a + a) | 0),\n (this._b = (this._b + b) | 0),\n (this._c = (this._c + c) | 0),\n (this._d = (this._d + d) | 0);\n };\n MD5.prototype._digest = function () {\n (this._block[this._blockOffset++] = 128),\n this._blockOffset > 56 && (this._block.fill(0, this._blockOffset, 64), this._update(), (this._blockOffset = 0)),\n this._block.fill(0, this._blockOffset, 56),\n this._block.writeUInt32LE(this._length[0], 56),\n this._block.writeUInt32LE(this._length[1], 60),\n this._update();\n var buffer = Buffer2.allocUnsafe(16);\n return (\n buffer.writeInt32LE(this._a, 0),\n buffer.writeInt32LE(this._b, 4),\n buffer.writeInt32LE(this._c, 8),\n buffer.writeInt32LE(this._d, 12),\n buffer\n );\n };\n function rotl(x, n) {\n return (x << n) | (x >>> (32 - n));\n }\n function fnF(a, b, c, d, m, k, s) {\n return (rotl((a + ((b & c) | (~b & d)) + m + k) | 0, s) + b) | 0;\n }\n function fnG(a, b, c, d, m, k, s) {\n return (rotl((a + ((b & d) | (c & ~d)) + m + k) | 0, s) + b) | 0;\n }\n function fnH(a, b, c, d, m, k, s) {\n return (rotl((a + (b ^ c ^ d) + m + k) | 0, s) + b) | 0;\n }\n function fnI(a, b, c, d, m, k, s) {\n return (rotl((a + (c ^ (b | ~d)) + m + k) | 0, s) + b) | 0;\n }\n module.exports = MD5;\n },\n});\n\n// node_modules/ripemd160/index.js\nvar require_ripemd160 = __commonJS({\n \"node_modules/ripemd160/index.js\"(exports, module) {\n \"use strict\";\n var Buffer2 = __require(\"buffer\").Buffer,\n inherits = require_inherits_browser(),\n HashBase = require_hash_base(),\n ARRAY16 = new Array(16),\n zl = [\n 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 7, 4, 13, 1, 10, 6, 15, 3, 12, 0, 9, 5, 2, 14, 11, 8, 3,\n 10, 14, 4, 9, 15, 8, 1, 2, 7, 0, 6, 13, 11, 5, 12, 1, 9, 11, 10, 0, 8, 12, 4, 13, 3, 7, 15, 14, 5, 6, 2, 4, 0,\n 5, 9, 7, 12, 2, 10, 14, 1, 3, 8, 11, 6, 15, 13,\n ],\n zr = [\n 5, 14, 7, 0, 9, 2, 11, 4, 13, 6, 15, 8, 1, 10, 3, 12, 6, 11, 3, 7, 0, 13, 5, 10, 14, 15, 8, 12, 4, 9, 1, 2, 15,\n 5, 1, 3, 7, 14, 6, 9, 11, 8, 12, 2, 10, 0, 4, 13, 8, 6, 4, 1, 3, 11, 15, 0, 5, 12, 2, 13, 9, 7, 10, 14, 12, 15,\n 10, 4, 1, 5, 8, 7, 6, 2, 13, 14, 0, 3, 9, 11,\n ],\n sl = [\n 11, 14, 15, 12, 5, 8, 7, 9, 11, 13, 14, 15, 6, 7, 9, 8, 7, 6, 8, 13, 11, 9, 7, 15, 7, 12, 15, 9, 11, 7, 13, 12,\n 11, 13, 6, 7, 14, 9, 13, 15, 14, 8, 13, 6, 5, 12, 7, 5, 11, 12, 14, 15, 14, 15, 9, 8, 9, 14, 5, 6, 8, 6, 5, 12,\n 9, 15, 5, 11, 6, 8, 13, 12, 5, 12, 13, 14, 11, 8, 5, 6,\n ],\n sr = [\n 8, 9, 9, 11, 13, 15, 15, 5, 7, 7, 8, 11, 14, 14, 12, 6, 9, 13, 15, 7, 12, 8, 9, 11, 7, 7, 12, 7, 6, 15, 13, 11,\n 9, 7, 15, 11, 8, 6, 6, 14, 12, 13, 5, 14, 13, 13, 7, 5, 15, 5, 8, 11, 14, 14, 6, 14, 6, 9, 12, 9, 12, 5, 15, 8,\n 8, 5, 12, 9, 12, 5, 14, 6, 8, 13, 6, 5, 15, 13, 11, 11,\n ],\n hl = [0, 1518500249, 1859775393, 2400959708, 2840853838],\n hr = [1352829926, 1548603684, 1836072691, 2053994217, 0];\n function RIPEMD160() {\n HashBase.call(this, 64),\n (this._a = 1732584193),\n (this._b = 4023233417),\n (this._c = 2562383102),\n (this._d = 271733878),\n (this._e = 3285377520);\n }\n inherits(RIPEMD160, HashBase);\n RIPEMD160.prototype._update = function () {\n for (var words = ARRAY16, j = 0; j < 16; ++j) words[j] = this._block.readInt32LE(j * 4);\n for (\n var al = this._a | 0,\n bl = this._b | 0,\n cl = this._c | 0,\n dl = this._d | 0,\n el = this._e | 0,\n ar = this._a | 0,\n br = this._b | 0,\n cr = this._c | 0,\n dr = this._d | 0,\n er = this._e | 0,\n i = 0;\n i < 80;\n i += 1\n ) {\n var tl, tr;\n i < 16\n ? ((tl = fn1(al, bl, cl, dl, el, words[zl[i]], hl[0], sl[i])),\n (tr = fn5(ar, br, cr, dr, er, words[zr[i]], hr[0], sr[i])))\n : i < 32\n ? ((tl = fn2(al, bl, cl, dl, el, words[zl[i]], hl[1], sl[i])),\n (tr = fn4(ar, br, cr, dr, er, words[zr[i]], hr[1], sr[i])))\n : i < 48\n ? ((tl = fn3(al, bl, cl, dl, el, words[zl[i]], hl[2], sl[i])),\n (tr = fn3(ar, br, cr, dr, er, words[zr[i]], hr[2], sr[i])))\n : i < 64\n ? ((tl = fn4(al, bl, cl, dl, el, words[zl[i]], hl[3], sl[i])),\n (tr = fn2(ar, br, cr, dr, er, words[zr[i]], hr[3], sr[i])))\n : ((tl = fn5(al, bl, cl, dl, el, words[zl[i]], hl[4], sl[i])),\n (tr = fn1(ar, br, cr, dr, er, words[zr[i]], hr[4], sr[i]))),\n (al = el),\n (el = dl),\n (dl = rotl(cl, 10)),\n (cl = bl),\n (bl = tl),\n (ar = er),\n (er = dr),\n (dr = rotl(cr, 10)),\n (cr = br),\n (br = tr);\n }\n var t = (this._b + cl + dr) | 0;\n (this._b = (this._c + dl + er) | 0),\n (this._c = (this._d + el + ar) | 0),\n (this._d = (this._e + al + br) | 0),\n (this._e = (this._a + bl + cr) | 0),\n (this._a = t);\n };\n RIPEMD160.prototype._digest = function () {\n (this._block[this._blockOffset++] = 128),\n this._blockOffset > 56 && (this._block.fill(0, this._blockOffset, 64), this._update(), (this._blockOffset = 0)),\n this._block.fill(0, this._blockOffset, 56),\n this._block.writeUInt32LE(this._length[0], 56),\n this._block.writeUInt32LE(this._length[1], 60),\n this._update();\n var buffer = Buffer2.alloc ? Buffer2.alloc(20) : new Buffer2(20);\n return (\n buffer.writeInt32LE(this._a, 0),\n buffer.writeInt32LE(this._b, 4),\n buffer.writeInt32LE(this._c, 8),\n buffer.writeInt32LE(this._d, 12),\n buffer.writeInt32LE(this._e, 16),\n buffer\n );\n };\n function rotl(x, n) {\n return (x << n) | (x >>> (32 - n));\n }\n function fn1(a, b, c, d, e, m, k, s) {\n return (rotl((a + (b ^ c ^ d) + m + k) | 0, s) + e) | 0;\n }\n function fn2(a, b, c, d, e, m, k, s) {\n return (rotl((a + ((b & c) | (~b & d)) + m + k) | 0, s) + e) | 0;\n }\n function fn3(a, b, c, d, e, m, k, s) {\n return (rotl((a + ((b | ~c) ^ d) + m + k) | 0, s) + e) | 0;\n }\n function fn4(a, b, c, d, e, m, k, s) {\n return (rotl((a + ((b & d) | (c & ~d)) + m + k) | 0, s) + e) | 0;\n }\n function fn5(a, b, c, d, e, m, k, s) {\n return (rotl((a + (b ^ (c | ~d)) + m + k) | 0, s) + e) | 0;\n }\n module.exports = RIPEMD160;\n },\n});\n\n// node_modules/sha.js/hash.js\nvar require_hash = __commonJS({\n \"node_modules/sha.js/hash.js\"(exports, module) {\n var Buffer2 = require_safe_buffer().Buffer;\n function Hash(blockSize, finalSize) {\n (this._block = Buffer2.alloc(blockSize)),\n (this._finalSize = finalSize),\n (this._blockSize = blockSize),\n (this._len = 0);\n }\n Hash.prototype.update = function (data, enc) {\n typeof data == \"string\" && ((enc = enc || \"utf8\"), (data = Buffer2.from(data, enc)));\n for (\n var block = this._block, blockSize = this._blockSize, length = data.length, accum = this._len, offset = 0;\n offset < length;\n\n ) {\n for (\n var assigned = accum % blockSize, remainder = Math.min(length - offset, blockSize - assigned), i = 0;\n i < remainder;\n i++\n )\n block[assigned + i] = data[offset + i];\n (accum += remainder), (offset += remainder), accum % blockSize === 0 && this._update(block);\n }\n return (this._len += length), this;\n };\n Hash.prototype.digest = function (enc) {\n var rem = this._len % this._blockSize;\n (this._block[rem] = 128),\n this._block.fill(0, rem + 1),\n rem >= this._finalSize && (this._update(this._block), this._block.fill(0));\n var bits = this._len * 8;\n if (bits <= 4294967295) this._block.writeUInt32BE(bits, this._blockSize - 4);\n else {\n var lowBits = (bits & 4294967295) >>> 0,\n highBits = (bits - lowBits) / 4294967296;\n this._block.writeUInt32BE(highBits, this._blockSize - 8),\n this._block.writeUInt32BE(lowBits, this._blockSize - 4);\n }\n this._update(this._block);\n var hash = this._hash();\n return enc ? hash.toString(enc) : hash;\n };\n Hash.prototype._update = function () {\n throw new Error(\"_update must be implemented by subclass\");\n };\n module.exports = Hash;\n },\n});\n\n// node_modules/sha.js/sha.js\nvar require_sha = __commonJS({\n \"node_modules/sha.js/sha.js\"(exports, module) {\n var inherits = require_inherits_browser(),\n Hash = require_hash(),\n Buffer2 = require_safe_buffer().Buffer,\n K = [1518500249, 1859775393, -1894007588, -899497514],\n W = new Array(80);\n function Sha() {\n this.init(), (this._w = W), Hash.call(this, 64, 56);\n }\n inherits(Sha, Hash);\n Sha.prototype.init = function () {\n return (\n (this._a = 1732584193),\n (this._b = 4023233417),\n (this._c = 2562383102),\n (this._d = 271733878),\n (this._e = 3285377520),\n this\n );\n };\n function rotl5(num) {\n return (num << 5) | (num >>> 27);\n }\n function rotl30(num) {\n return (num << 30) | (num >>> 2);\n }\n function ft(s, b, c, d) {\n return s === 0 ? (b & c) | (~b & d) : s === 2 ? (b & c) | (b & d) | (c & d) : b ^ c ^ d;\n }\n Sha.prototype._update = function (M) {\n for (\n var W2 = this._w, a = this._a | 0, b = this._b | 0, c = this._c | 0, d = this._d | 0, e = this._e | 0, i = 0;\n i < 16;\n ++i\n )\n W2[i] = M.readInt32BE(i * 4);\n for (; i < 80; ++i) W2[i] = W2[i - 3] ^ W2[i - 8] ^ W2[i - 14] ^ W2[i - 16];\n for (var j = 0; j < 80; ++j) {\n var s = ~~(j / 20),\n t = (rotl5(a) + ft(s, b, c, d) + e + W2[j] + K[s]) | 0;\n (e = d), (d = c), (c = rotl30(b)), (b = a), (a = t);\n }\n (this._a = (a + this._a) | 0),\n (this._b = (b + this._b) | 0),\n (this._c = (c + this._c) | 0),\n (this._d = (d + this._d) | 0),\n (this._e = (e + this._e) | 0);\n };\n Sha.prototype._hash = function () {\n var H = Buffer2.allocUnsafe(20);\n return (\n H.writeInt32BE(this._a | 0, 0),\n H.writeInt32BE(this._b | 0, 4),\n H.writeInt32BE(this._c | 0, 8),\n H.writeInt32BE(this._d | 0, 12),\n H.writeInt32BE(this._e | 0, 16),\n H\n );\n };\n module.exports = Sha;\n },\n});\n\n// node_modules/sha.js/sha1.js\nvar require_sha1 = __commonJS({\n \"node_modules/sha.js/sha1.js\"(exports, module) {\n var inherits = require_inherits_browser(),\n Hash = require_hash(),\n Buffer2 = require_safe_buffer().Buffer,\n K = [1518500249, 1859775393, -1894007588, -899497514],\n W = new Array(80);\n function Sha1() {\n this.init(), (this._w = W), Hash.call(this, 64, 56);\n }\n inherits(Sha1, Hash);\n Sha1.prototype.init = function () {\n return (\n (this._a = 1732584193),\n (this._b = 4023233417),\n (this._c = 2562383102),\n (this._d = 271733878),\n (this._e = 3285377520),\n this\n );\n };\n function rotl1(num) {\n return (num << 1) | (num >>> 31);\n }\n function rotl5(num) {\n return (num << 5) | (num >>> 27);\n }\n function rotl30(num) {\n return (num << 30) | (num >>> 2);\n }\n function ft(s, b, c, d) {\n return s === 0 ? (b & c) | (~b & d) : s === 2 ? (b & c) | (b & d) | (c & d) : b ^ c ^ d;\n }\n Sha1.prototype._update = function (M) {\n for (\n var W2 = this._w, a = this._a | 0, b = this._b | 0, c = this._c | 0, d = this._d | 0, e = this._e | 0, i = 0;\n i < 16;\n ++i\n )\n W2[i] = M.readInt32BE(i * 4);\n for (; i < 80; ++i) W2[i] = rotl1(W2[i - 3] ^ W2[i - 8] ^ W2[i - 14] ^ W2[i - 16]);\n for (var j = 0; j < 80; ++j) {\n var s = ~~(j / 20),\n t = (rotl5(a) + ft(s, b, c, d) + e + W2[j] + K[s]) | 0;\n (e = d), (d = c), (c = rotl30(b)), (b = a), (a = t);\n }\n (this._a = (a + this._a) | 0),\n (this._b = (b + this._b) | 0),\n (this._c = (c + this._c) | 0),\n (this._d = (d + this._d) | 0),\n (this._e = (e + this._e) | 0);\n };\n Sha1.prototype._hash = function () {\n var H = Buffer2.allocUnsafe(20);\n return (\n H.writeInt32BE(this._a | 0, 0),\n H.writeInt32BE(this._b | 0, 4),\n H.writeInt32BE(this._c | 0, 8),\n H.writeInt32BE(this._d | 0, 12),\n H.writeInt32BE(this._e | 0, 16),\n H\n );\n };\n module.exports = Sha1;\n },\n});\n\n// node_modules/sha.js/sha256.js\nvar require_sha256 = __commonJS({\n \"node_modules/sha.js/sha256.js\"(exports, module) {\n var inherits = require_inherits_browser(),\n Hash = require_hash(),\n Buffer2 = require_safe_buffer().Buffer,\n K = [\n 1116352408, 1899447441, 3049323471, 3921009573, 961987163, 1508970993, 2453635748, 2870763221, 3624381080,\n 310598401, 607225278, 1426881987, 1925078388, 2162078206, 2614888103, 3248222580, 3835390401, 4022224774,\n 264347078, 604807628, 770255983, 1249150122, 1555081692, 1996064986, 2554220882, 2821834349, 2952996808,\n 3210313671, 3336571891, 3584528711, 113926993, 338241895, 666307205, 773529912, 1294757372, 1396182291,\n 1695183700, 1986661051, 2177026350, 2456956037, 2730485921, 2820302411, 3259730800, 3345764771, 3516065817,\n 3600352804, 4094571909, 275423344, 430227734, 506948616, 659060556, 883997877, 958139571, 1322822218,\n 1537002063, 1747873779, 1955562222, 2024104815, 2227730452, 2361852424, 2428436474, 2756734187, 3204031479,\n 3329325298,\n ],\n W = new Array(64);\n function Sha256() {\n this.init(), (this._w = W), Hash.call(this, 64, 56);\n }\n inherits(Sha256, Hash);\n Sha256.prototype.init = function () {\n return (\n (this._a = 1779033703),\n (this._b = 3144134277),\n (this._c = 1013904242),\n (this._d = 2773480762),\n (this._e = 1359893119),\n (this._f = 2600822924),\n (this._g = 528734635),\n (this._h = 1541459225),\n this\n );\n };\n function ch(x, y, z) {\n return z ^ (x & (y ^ z));\n }\n function maj(x, y, z) {\n return (x & y) | (z & (x | y));\n }\n function sigma0(x) {\n return ((x >>> 2) | (x << 30)) ^ ((x >>> 13) | (x << 19)) ^ ((x >>> 22) | (x << 10));\n }\n function sigma1(x) {\n return ((x >>> 6) | (x << 26)) ^ ((x >>> 11) | (x << 21)) ^ ((x >>> 25) | (x << 7));\n }\n function gamma0(x) {\n return ((x >>> 7) | (x << 25)) ^ ((x >>> 18) | (x << 14)) ^ (x >>> 3);\n }\n function gamma1(x) {\n return ((x >>> 17) | (x << 15)) ^ ((x >>> 19) | (x << 13)) ^ (x >>> 10);\n }\n Sha256.prototype._update = function (M) {\n for (\n var W2 = this._w,\n a = this._a | 0,\n b = this._b | 0,\n c = this._c | 0,\n d = this._d | 0,\n e = this._e | 0,\n f = this._f | 0,\n g = this._g | 0,\n h = this._h | 0,\n i = 0;\n i < 16;\n ++i\n )\n W2[i] = M.readInt32BE(i * 4);\n for (; i < 64; ++i) W2[i] = (gamma1(W2[i - 2]) + W2[i - 7] + gamma0(W2[i - 15]) + W2[i - 16]) | 0;\n for (var j = 0; j < 64; ++j) {\n var T1 = (h + sigma1(e) + ch(e, f, g) + K[j] + W2[j]) | 0,\n T2 = (sigma0(a) + maj(a, b, c)) | 0;\n (h = g), (g = f), (f = e), (e = (d + T1) | 0), (d = c), (c = b), (b = a), (a = (T1 + T2) | 0);\n }\n (this._a = (a + this._a) | 0),\n (this._b = (b + this._b) | 0),\n (this._c = (c + this._c) | 0),\n (this._d = (d + this._d) | 0),\n (this._e = (e + this._e) | 0),\n (this._f = (f + this._f) | 0),\n (this._g = (g + this._g) | 0),\n (this._h = (h + this._h) | 0);\n };\n Sha256.prototype._hash = function () {\n var H = Buffer2.allocUnsafe(32);\n return (\n H.writeInt32BE(this._a, 0),\n H.writeInt32BE(this._b, 4),\n H.writeInt32BE(this._c, 8),\n H.writeInt32BE(this._d, 12),\n H.writeInt32BE(this._e, 16),\n H.writeInt32BE(this._f, 20),\n H.writeInt32BE(this._g, 24),\n H.writeInt32BE(this._h, 28),\n H\n );\n };\n module.exports = Sha256;\n },\n});\n\n// node_modules/sha.js/sha224.js\nvar require_sha224 = __commonJS({\n \"node_modules/sha.js/sha224.js\"(exports, module) {\n var inherits = require_inherits_browser(),\n Sha256 = require_sha256(),\n Hash = require_hash(),\n Buffer2 = require_safe_buffer().Buffer,\n W = new Array(64);\n function Sha224() {\n this.init(), (this._w = W), Hash.call(this, 64, 56);\n }\n inherits(Sha224, Sha256);\n Sha224.prototype.init = function () {\n return (\n (this._a = 3238371032),\n (this._b = 914150663),\n (this._c = 812702999),\n (this._d = 4144912697),\n (this._e = 4290775857),\n (this._f = 1750603025),\n (this._g = 1694076839),\n (this._h = 3204075428),\n this\n );\n };\n Sha224.prototype._hash = function () {\n var H = Buffer2.allocUnsafe(28);\n return (\n H.writeInt32BE(this._a, 0),\n H.writeInt32BE(this._b, 4),\n H.writeInt32BE(this._c, 8),\n H.writeInt32BE(this._d, 12),\n H.writeInt32BE(this._e, 16),\n H.writeInt32BE(this._f, 20),\n H.writeInt32BE(this._g, 24),\n H\n );\n };\n module.exports = Sha224;\n },\n});\n\n// node_modules/sha.js/sha512.js\nvar require_sha512 = __commonJS({\n \"node_modules/sha.js/sha512.js\"(exports, module) {\n var inherits = require_inherits_browser(),\n Hash = require_hash(),\n Buffer2 = require_safe_buffer().Buffer,\n K = [\n 1116352408, 3609767458, 1899447441, 602891725, 3049323471, 3964484399, 3921009573, 2173295548, 961987163,\n 4081628472, 1508970993, 3053834265, 2453635748, 2937671579, 2870763221, 3664609560, 3624381080, 2734883394,\n 310598401, 1164996542, 607225278, 1323610764, 1426881987, 3590304994, 1925078388, 4068182383, 2162078206,\n 991336113, 2614888103, 633803317, 3248222580, 3479774868, 3835390401, 2666613458, 4022224774, 944711139,\n 264347078, 2341262773, 604807628, 2007800933, 770255983, 1495990901, 1249150122, 1856431235, 1555081692,\n 3175218132, 1996064986, 2198950837, 2554220882, 3999719339, 2821834349, 766784016, 2952996808, 2566594879,\n 3210313671, 3203337956, 3336571891, 1034457026, 3584528711, 2466948901, 113926993, 3758326383, 338241895,\n 168717936, 666307205, 1188179964, 773529912, 1546045734, 1294757372, 1522805485, 1396182291, 2643833823,\n 1695183700, 2343527390, 1986661051, 1014477480, 2177026350, 1206759142, 2456956037, 344077627, 2730485921,\n 1290863460, 2820302411, 3158454273, 3259730800, 3505952657, 3345764771, 106217008, 3516065817, 3606008344,\n 3600352804, 1432725776, 4094571909, 1467031594, 275423344, 851169720, 430227734, 3100823752, 506948616,\n 1363258195, 659060556, 3750685593, 883997877, 3785050280, 958139571, 3318307427, 1322822218, 3812723403,\n 1537002063, 2003034995, 1747873779, 3602036899, 1955562222, 1575990012, 2024104815, 1125592928, 2227730452,\n 2716904306, 2361852424, 442776044, 2428436474, 593698344, 2756734187, 3733110249, 3204031479, 2999351573,\n 3329325298, 3815920427, 3391569614, 3928383900, 3515267271, 566280711, 3940187606, 3454069534, 4118630271,\n 4000239992, 116418474, 1914138554, 174292421, 2731055270, 289380356, 3203993006, 460393269, 320620315,\n 685471733, 587496836, 852142971, 1086792851, 1017036298, 365543100, 1126000580, 2618297676, 1288033470,\n 3409855158, 1501505948, 4234509866, 1607167915, 987167468, 1816402316, 1246189591,\n ],\n W = new Array(160);\n function Sha512() {\n this.init(), (this._w = W), Hash.call(this, 128, 112);\n }\n inherits(Sha512, Hash);\n Sha512.prototype.init = function () {\n return (\n (this._ah = 1779033703),\n (this._bh = 3144134277),\n (this._ch = 1013904242),\n (this._dh = 2773480762),\n (this._eh = 1359893119),\n (this._fh = 2600822924),\n (this._gh = 528734635),\n (this._hh = 1541459225),\n (this._al = 4089235720),\n (this._bl = 2227873595),\n (this._cl = 4271175723),\n (this._dl = 1595750129),\n (this._el = 2917565137),\n (this._fl = 725511199),\n (this._gl = 4215389547),\n (this._hl = 327033209),\n this\n );\n };\n function Ch(x, y, z) {\n return z ^ (x & (y ^ z));\n }\n function maj(x, y, z) {\n return (x & y) | (z & (x | y));\n }\n function sigma0(x, xl) {\n return ((x >>> 28) | (xl << 4)) ^ ((xl >>> 2) | (x << 30)) ^ ((xl >>> 7) | (x << 25));\n }\n function sigma1(x, xl) {\n return ((x >>> 14) | (xl << 18)) ^ ((x >>> 18) | (xl << 14)) ^ ((xl >>> 9) | (x << 23));\n }\n function Gamma0(x, xl) {\n return ((x >>> 1) | (xl << 31)) ^ ((x >>> 8) | (xl << 24)) ^ (x >>> 7);\n }\n function Gamma0l(x, xl) {\n return ((x >>> 1) | (xl << 31)) ^ ((x >>> 8) | (xl << 24)) ^ ((x >>> 7) | (xl << 25));\n }\n function Gamma1(x, xl) {\n return ((x >>> 19) | (xl << 13)) ^ ((xl >>> 29) | (x << 3)) ^ (x >>> 6);\n }\n function Gamma1l(x, xl) {\n return ((x >>> 19) | (xl << 13)) ^ ((xl >>> 29) | (x << 3)) ^ ((x >>> 6) | (xl << 26));\n }\n function getCarry(a, b) {\n return a >>> 0 < b >>> 0 ? 1 : 0;\n }\n Sha512.prototype._update = function (M) {\n for (\n var W2 = this._w,\n ah = this._ah | 0,\n bh = this._bh | 0,\n ch = this._ch | 0,\n dh = this._dh | 0,\n eh = this._eh | 0,\n fh = this._fh | 0,\n gh = this._gh | 0,\n hh = this._hh | 0,\n al = this._al | 0,\n bl = this._bl | 0,\n cl = this._cl | 0,\n dl = this._dl | 0,\n el = this._el | 0,\n fl = this._fl | 0,\n gl = this._gl | 0,\n hl = this._hl | 0,\n i = 0;\n i < 32;\n i += 2\n )\n (W2[i] = M.readInt32BE(i * 4)), (W2[i + 1] = M.readInt32BE(i * 4 + 4));\n for (; i < 160; i += 2) {\n var xh = W2[i - 30],\n xl = W2[i - 15 * 2 + 1],\n gamma0 = Gamma0(xh, xl),\n gamma0l = Gamma0l(xl, xh);\n (xh = W2[i - 2 * 2]), (xl = W2[i - 2 * 2 + 1]);\n var gamma1 = Gamma1(xh, xl),\n gamma1l = Gamma1l(xl, xh),\n Wi7h = W2[i - 7 * 2],\n Wi7l = W2[i - 7 * 2 + 1],\n Wi16h = W2[i - 16 * 2],\n Wi16l = W2[i - 16 * 2 + 1],\n Wil = (gamma0l + Wi7l) | 0,\n 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 (W2[i] = Wih),\n (W2[i + 1] = Wil);\n }\n for (var j = 0; j < 160; j += 2) {\n (Wih = W2[j]), (Wil = W2[j + 1]);\n var majh = maj(ah, bh, ch),\n majl = maj(al, bl, cl),\n sigma0h = sigma0(ah, al),\n sigma0l = sigma0(al, ah),\n sigma1h = sigma1(eh, el),\n sigma1l = sigma1(el, eh),\n Kih = K[j],\n Kil = K[j + 1],\n chh = Ch(eh, fh, gh),\n chl = Ch(el, fl, gl),\n t1l = (hl + sigma1l) | 0,\n 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 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 (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 Sha512.prototype._hash = function () {\n var H = Buffer2.allocUnsafe(64);\n function writeInt64BE(h, l, offset) {\n H.writeInt32BE(h, offset), H.writeInt32BE(l, offset + 4);\n }\n return (\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 H\n );\n };\n module.exports = Sha512;\n },\n});\n\n// node_modules/sha.js/sha384.js\nvar require_sha384 = __commonJS({\n \"node_modules/sha.js/sha384.js\"(exports, module) {\n var inherits = require_inherits_browser(),\n SHA512 = require_sha512(),\n Hash = require_hash(),\n Buffer2 = require_safe_buffer().Buffer,\n W = new Array(160);\n function Sha384() {\n this.init(), (this._w = W), Hash.call(this, 128, 112);\n }\n inherits(Sha384, SHA512);\n Sha384.prototype.init = function () {\n return (\n (this._ah = 3418070365),\n (this._bh = 1654270250),\n (this._ch = 2438529370),\n (this._dh = 355462360),\n (this._eh = 1731405415),\n (this._fh = 2394180231),\n (this._gh = 3675008525),\n (this._hh = 1203062813),\n (this._al = 3238371032),\n (this._bl = 914150663),\n (this._cl = 812702999),\n (this._dl = 4144912697),\n (this._el = 4290775857),\n (this._fl = 1750603025),\n (this._gl = 1694076839),\n (this._hl = 3204075428),\n this\n );\n };\n Sha384.prototype._hash = function () {\n var H = Buffer2.allocUnsafe(48);\n function writeInt64BE(h, l, offset) {\n H.writeInt32BE(h, offset), H.writeInt32BE(l, offset + 4);\n }\n return (\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 H\n );\n };\n module.exports = Sha384;\n },\n});\n\n// node_modules/sha.js/index.js\nvar require_sha2 = __commonJS({\n \"node_modules/sha.js/index.js\"(exports, module) {\n var exports = (module.exports = function (algorithm) {\n algorithm = algorithm.toLowerCase();\n var Algorithm = exports[algorithm];\n if (!Algorithm) throw new Error(algorithm + \" is not supported (we accept pull requests)\");\n return new Algorithm();\n });\n exports.sha = require_sha();\n exports.sha1 = require_sha1();\n exports.sha224 = require_sha224();\n exports.sha256 = require_sha256();\n exports.sha384 = require_sha384();\n exports.sha512 = require_sha512();\n },\n});\n\n// stream.js\nvar stream_exports = import.meta.require(\"node:stream\");\n\n// node_modules/cipher-base/index.js\nvar require_cipher_base = __commonJS({\n \"node_modules/cipher-base/index.js\"(exports, module) {\n var Buffer2 = require_safe_buffer().Buffer,\n Transform = stream_exports.Transform,\n StringDecoder = __require(\"string_decoder\").StringDecoder,\n inherits = require_inherits_browser();\n function CipherBase(hashMode) {\n Transform.call(this),\n (this.hashMode = typeof hashMode == \"string\"),\n this.hashMode ? (this[hashMode] = this._finalOrDigest) : (this.final = this._finalOrDigest),\n this._final && ((this.__final = this._final), (this._final = null)),\n (this._decoder = null),\n (this._encoding = null);\n }\n inherits(CipherBase, Transform);\n CipherBase.prototype.update = function (data, inputEnc, outputEnc) {\n typeof data == \"string\" && (data = Buffer2.from(data, inputEnc));\n var outData = this._update(data);\n return this.hashMode ? this : (outputEnc && (outData = this._toString(outData, outputEnc)), outData);\n };\n CipherBase.prototype.setAutoPadding = function () {};\n CipherBase.prototype.getAuthTag = function () {\n throw new Error(\"trying to get auth tag in unsupported state\");\n };\n CipherBase.prototype.setAuthTag = function () {\n throw new Error(\"trying to set auth tag in unsupported state\");\n };\n CipherBase.prototype.setAAD = function () {\n throw new Error(\"trying to set aad in unsupported state\");\n };\n CipherBase.prototype._transform = function (data, _, next) {\n var err;\n try {\n this.hashMode ? this._update(data) : this.push(this._update(data));\n } catch (e) {\n err = e;\n } finally {\n next(err);\n }\n };\n CipherBase.prototype._flush = function (done) {\n var err;\n try {\n this.push(this.__final());\n } catch (e) {\n err = e;\n }\n done(err);\n };\n CipherBase.prototype._finalOrDigest = function (outputEnc) {\n var outData = this.__final() || Buffer2.alloc(0);\n return outputEnc && (outData = this._toString(outData, outputEnc, !0)), outData;\n };\n CipherBase.prototype._toString = function (value, enc, fin) {\n if ((this._decoder || ((this._decoder = new StringDecoder(enc)), (this._encoding = enc)), this._encoding !== enc))\n throw new Error(\"can't switch encodings\");\n var out = this._decoder.write(value);\n return fin && (out += this._decoder.end()), out;\n };\n module.exports = CipherBase;\n },\n});\n\n// node_modules/create-hash/browser.js\nvar require_browser2 = __commonJS({\n \"node_modules/create-hash/browser.js\"(exports, module) {\n (\"use strict\");\n const { Transform } = stream_exports;\n\n // does not become a node stream unless you create it into one\n const LazyHash = function Hash(algorithm, options) {\n this._options = options;\n this._hasher = new CryptoHasher(algorithm, options);\n this._finalized = false;\n };\n LazyHash.prototype = Object.create(Transform.prototype);\n LazyHash.prototype.update = function update(data, encoding) {\n this._checkFinalized();\n this._hasher.update(data, encoding);\n return this;\n };\n LazyHash.prototype.digest = function update(data, encoding) {\n this._checkFinalized();\n this._finalized = true;\n return this._hasher.digest(data, encoding);\n };\n LazyHash.prototype._checkFinalized = function _checkFinalized() {\n if (this._finalized) {\n var err = new Error(\"Digest already called\");\n err.code = \"ERR_CRYPTO_HASH_FINALIZED\";\n throw err;\n }\n };\n LazyHash.prototype.copy = function copy() {\n const copy = Object.create(LazyHash.prototype);\n copy._options = this._options;\n copy._hasher = this._hasher.copy();\n copy._finalized = this._finalized;\n return copy;\n };\n\n const lazyHashFullInitProto = {\n __proto__: Transform.prototype,\n ...LazyHash.prototype,\n _transform(data, encoding, callback) {\n this.update(data, encoding);\n callback && callback();\n },\n _flush(callback) {\n this.push(this.digest());\n callback();\n },\n };\n\n const triggerMethods = [\n \"_events\",\n \"_eventsCount\",\n \"_final\",\n \"_maxListeners\",\n \"_maxListeners\",\n \"_read\",\n \"_undestroy\",\n \"_writableState\",\n \"_write\",\n \"_writev\",\n \"addListener\",\n \"asIndexedPairs\",\n \"closed\",\n \"compose\",\n \"constructor\",\n \"cork\",\n \"destroy\",\n \"destroyed\",\n \"drop\",\n \"emit\",\n \"end\",\n \"errored\",\n \"eventNames\",\n \"every\",\n \"filter\",\n \"find\",\n \"flatMap\",\n \"forEach\",\n \"getMaxListeners\",\n \"hasOwnProperty\",\n \"isPaused\",\n \"isPrototypeOf\",\n \"iterator\",\n \"listenerCount\",\n \"listeners\",\n \"map\",\n \"off\",\n \"on\",\n \"once\",\n \"pause\",\n \"pipe\",\n \"prependListener\",\n \"prependOnceListener\",\n \"propertyIsEnumerable\",\n \"push\",\n \"rawListeners\",\n \"read\",\n \"readable\",\n \"readableAborted\",\n \"readableBuffer\",\n \"readableDidRead\",\n \"readableEncoding\",\n \"readableEnded\",\n \"readableFlowing\",\n \"readableHighWaterMark\",\n \"readableLength\",\n \"readableObjectMode\",\n \"reduce\",\n \"removeAllListeners\",\n \"removeListener\",\n \"resume\",\n \"setDefaultEncoding\",\n \"setEncoding\",\n \"setMaxListeners\",\n \"some\",\n \"take\",\n \"toArray\",\n \"toLocaleString\",\n \"toString\",\n \"uncork\",\n \"unpipe\",\n \"unshift\",\n \"valueOf\",\n \"wrap\",\n \"writable\",\n \"writableBuffer\",\n \"writableCorked\",\n \"writableEnded\",\n \"writableFinished\",\n \"writableHighWaterMark\",\n \"writableLength\",\n \"writableNeedDrain\",\n \"writableObjectMode\",\n \"write\",\n ];\n for (const method of triggerMethods) {\n Object.defineProperty(LazyHash.prototype, method, {\n get() {\n Object.setPrototypeOf(this, lazyHashFullInitProto);\n Transform.call(this, this._options);\n return this[method];\n },\n enumerable: false,\n configurable: true,\n });\n }\n\n module.exports = function createHash(algorithm) {\n return new LazyHash(algorithm);\n };\n\n module.exports.createHash = module.exports;\n module.exports.Hash = LazyHash;\n },\n});\n\n// node_modules/create-hmac/legacy.js\nvar require_legacy = __commonJS({\n \"node_modules/create-hmac/legacy.js\"(exports, module) {\n \"use strict\";\n var inherits = require_inherits_browser(),\n Buffer2 = require_safe_buffer().Buffer,\n Base = require_cipher_base(),\n ZEROS = Buffer2.alloc(128),\n blocksize = 64;\n function Hmac(alg, key) {\n Base.call(this, \"digest\"),\n typeof key == \"string\" && (key = Buffer2.from(key)),\n (this._alg = alg),\n (this._key = key),\n key.length > blocksize\n ? (key = alg(key))\n : key.length < blocksize && (key = Buffer2.concat([key, ZEROS], blocksize));\n for (\n var ipad = (this._ipad = Buffer2.allocUnsafe(blocksize)),\n opad = (this._opad = Buffer2.allocUnsafe(blocksize)),\n i = 0;\n i < blocksize;\n i++\n )\n (ipad[i] = key[i] ^ 54), (opad[i] = key[i] ^ 92);\n this._hash = [ipad];\n }\n inherits(Hmac, Base);\n Hmac.prototype._update = function (data) {\n this._hash.push(data);\n };\n Hmac.prototype._final = function () {\n var h = this._alg(Buffer2.concat(this._hash));\n return this._alg(Buffer2.concat([this._opad, h]));\n };\n module.exports = Hmac;\n },\n});\n\n// node_modules/create-hash/md5.js\nvar require_md52 = __commonJS({\n \"node_modules/create-hash/md5.js\"(exports, module) {\n var MD5 = require_md5();\n module.exports = function (buffer) {\n return new MD5().update(buffer).digest();\n };\n },\n});\n\n// node_modules/create-hmac/browser.js\nvar require_browser3 = __commonJS({\n \"node_modules/create-hmac/browser.js\"(exports, module) {\n \"use strict\";\n var inherits = require_inherits_browser(),\n Legacy = require_legacy(),\n Base = require_cipher_base(),\n Buffer2 = require_safe_buffer().Buffer,\n md5 = require_md52(),\n RIPEMD160 = require_ripemd160(),\n sha = require_sha2(),\n ZEROS = Buffer2.alloc(128);\n function Hmac(alg, key) {\n Base.call(this, \"digest\"), typeof key == \"string\" && (key = Buffer2.from(key));\n var blocksize = alg === \"sha512\" || alg === \"sha384\" ? 128 : 64;\n if (((this._alg = alg), (this._key = key), key.length > blocksize)) {\n var hash = alg === \"rmd160\" ? new RIPEMD160() : sha(alg);\n key = hash.update(key).digest();\n } else key.length < blocksize && (key = Buffer2.concat([key, ZEROS], blocksize));\n for (\n var ipad = (this._ipad = Buffer2.allocUnsafe(blocksize)),\n opad = (this._opad = Buffer2.allocUnsafe(blocksize)),\n i = 0;\n i < blocksize;\n i++\n )\n (ipad[i] = key[i] ^ 54), (opad[i] = key[i] ^ 92);\n (this._hash = alg === \"rmd160\" ? new RIPEMD160() : sha(alg)), this._hash.update(ipad);\n }\n inherits(Hmac, Base);\n Hmac.prototype._update = function (data) {\n this._hash.update(data);\n };\n Hmac.prototype._final = function () {\n var h = this._hash.digest(),\n hash = this._alg === \"rmd160\" ? new RIPEMD160() : sha(this._alg);\n return hash.update(this._opad).update(h).digest();\n };\n module.exports = function (alg, key) {\n return (\n (alg = alg.toLowerCase()),\n alg === \"rmd160\" || alg === \"ripemd160\"\n ? new Hmac(\"rmd160\", key)\n : alg === \"md5\"\n ? new Legacy(md5, key)\n : new Hmac(alg, key)\n );\n };\n },\n});\n\n// node_modules/browserify-sign/browser/algorithms.json\nvar require_algorithms = __commonJS({\n \"node_modules/browserify-sign/browser/algorithms.json\"(exports, module) {\n module.exports = {\n sha224WithRSAEncryption: {\n sign: \"rsa\",\n hash: \"sha224\",\n id: \"302d300d06096086480165030402040500041c\",\n },\n \"RSA-SHA224\": {\n sign: \"ecdsa/rsa\",\n hash: \"sha224\",\n id: \"302d300d06096086480165030402040500041c\",\n },\n sha256WithRSAEncryption: {\n sign: \"rsa\",\n hash: \"sha256\",\n id: \"3031300d060960864801650304020105000420\",\n },\n \"RSA-SHA256\": {\n sign: \"ecdsa/rsa\",\n hash: \"sha256\",\n id: \"3031300d060960864801650304020105000420\",\n },\n sha384WithRSAEncryption: {\n sign: \"rsa\",\n hash: \"sha384\",\n id: \"3041300d060960864801650304020205000430\",\n },\n \"RSA-SHA384\": {\n sign: \"ecdsa/rsa\",\n hash: \"sha384\",\n id: \"3041300d060960864801650304020205000430\",\n },\n sha512WithRSAEncryption: {\n sign: \"rsa\",\n hash: \"sha512\",\n id: \"3051300d060960864801650304020305000440\",\n },\n \"RSA-SHA512\": {\n sign: \"ecdsa/rsa\",\n hash: \"sha512\",\n id: \"3051300d060960864801650304020305000440\",\n },\n \"RSA-SHA1\": {\n sign: \"rsa\",\n hash: \"sha1\",\n id: \"3021300906052b0e03021a05000414\",\n },\n \"ecdsa-with-SHA1\": {\n sign: \"ecdsa\",\n hash: \"sha1\",\n id: \"\",\n },\n sha256: {\n sign: \"ecdsa\",\n hash: \"sha256\",\n id: \"\",\n },\n sha224: {\n sign: \"ecdsa\",\n hash: \"sha224\",\n id: \"\",\n },\n sha384: {\n sign: \"ecdsa\",\n hash: \"sha384\",\n id: \"\",\n },\n sha512: {\n sign: \"ecdsa\",\n hash: \"sha512\",\n id: \"\",\n },\n \"DSA-SHA\": {\n sign: \"dsa\",\n hash: \"sha1\",\n id: \"\",\n },\n \"DSA-SHA1\": {\n sign: \"dsa\",\n hash: \"sha1\",\n id: \"\",\n },\n DSA: {\n sign: \"dsa\",\n hash: \"sha1\",\n id: \"\",\n },\n \"DSA-WITH-SHA224\": {\n sign: \"dsa\",\n hash: \"sha224\",\n id: \"\",\n },\n \"DSA-SHA224\": {\n sign: \"dsa\",\n hash: \"sha224\",\n id: \"\",\n },\n \"DSA-WITH-SHA256\": {\n sign: \"dsa\",\n hash: \"sha256\",\n id: \"\",\n },\n \"DSA-SHA256\": {\n sign: \"dsa\",\n hash: \"sha256\",\n id: \"\",\n },\n \"DSA-WITH-SHA384\": {\n sign: \"dsa\",\n hash: \"sha384\",\n id: \"\",\n },\n \"DSA-SHA384\": {\n sign: \"dsa\",\n hash: \"sha384\",\n id: \"\",\n },\n \"DSA-WITH-SHA512\": {\n sign: \"dsa\",\n hash: \"sha512\",\n id: \"\",\n },\n \"DSA-SHA512\": {\n sign: \"dsa\",\n hash: \"sha512\",\n id: \"\",\n },\n \"DSA-RIPEMD160\": {\n sign: \"dsa\",\n hash: \"rmd160\",\n id: \"\",\n },\n ripemd160WithRSA: {\n sign: \"rsa\",\n hash: \"rmd160\",\n id: \"3021300906052b2403020105000414\",\n },\n \"RSA-RIPEMD160\": {\n sign: \"rsa\",\n hash: \"rmd160\",\n id: \"3021300906052b2403020105000414\",\n },\n md5WithRSAEncryption: {\n sign: \"rsa\",\n hash: \"md5\",\n id: \"3020300c06082a864886f70d020505000410\",\n },\n \"RSA-MD5\": {\n sign: \"rsa\",\n hash: \"md5\",\n id: \"3020300c06082a864886f70d020505000410\",\n },\n };\n },\n});\n\n// node_modules/browserify-sign/algos.js\nvar require_algos = __commonJS({\n \"node_modules/browserify-sign/algos.js\"(exports, module) {\n module.exports = require_algorithms();\n },\n});\n\n// node_modules/pbkdf2/lib/precondition.js\nvar require_precondition = __commonJS({\n \"node_modules/pbkdf2/lib/precondition.js\"(exports, module) {\n var MAX_ALLOC = Math.pow(2, 30) - 1;\n module.exports = function (iterations, keylen) {\n if (typeof iterations != \"number\") throw new TypeError(\"Iterations not a number\");\n if (iterations < 0) throw new TypeError(\"Bad iterations\");\n if (typeof keylen != \"number\") throw new TypeError(\"Key length not a number\");\n if (keylen < 0 || keylen > MAX_ALLOC || keylen !== keylen) throw new TypeError(\"Bad key length\");\n };\n },\n});\n\n// node_modules/pbkdf2/lib/default-encoding.js\nvar require_default_encoding = __commonJS({\n \"node_modules/pbkdf2/lib/default-encoding.js\"(exports, module) {\n var defaultEncoding;\n global.process && global.process.browser\n ? (defaultEncoding = \"utf-8\")\n : global.process && global.process.version\n ? ((pVersionMajor = parseInt(process.version.split(\".\")[0].slice(1), 10)),\n (defaultEncoding = pVersionMajor >= 6 ? \"utf-8\" : \"binary\"))\n : (defaultEncoding = \"utf-8\");\n var pVersionMajor;\n module.exports = defaultEncoding;\n },\n});\n\n// node_modules/pbkdf2/lib/to-buffer.js\nvar require_to_buffer = __commonJS({\n \"node_modules/pbkdf2/lib/to-buffer.js\"(exports, module) {\n var Buffer2 = require_safe_buffer().Buffer;\n module.exports = function (thing, encoding, name) {\n if (Buffer2.isBuffer(thing)) return thing;\n if (typeof thing == \"string\") return Buffer2.from(thing, encoding);\n if (ArrayBuffer.isView(thing)) return Buffer2.from(thing.buffer);\n throw new TypeError(name + \" must be a string, a Buffer, a typed array or a DataView\");\n };\n },\n});\n\n// node_modules/pbkdf2/lib/sync-browser.js\nvar require_sync_browser = __commonJS({\n \"node_modules/pbkdf2/lib/sync-browser.js\"(exports, module) {\n var md5 = require_md52(),\n RIPEMD160 = require_ripemd160(),\n sha = require_sha2(),\n Buffer2 = require_safe_buffer().Buffer,\n checkParameters = require_precondition(),\n defaultEncoding = require_default_encoding(),\n toBuffer = require_to_buffer(),\n ZEROS = Buffer2.alloc(128),\n sizes = {\n md5: 16,\n sha1: 20,\n sha224: 28,\n sha256: 32,\n sha384: 48,\n sha512: 64,\n rmd160: 20,\n ripemd160: 20,\n };\n function Hmac(alg, key, saltLen) {\n var hash = getDigest(alg),\n blocksize = alg === \"sha512\" || alg === \"sha384\" ? 128 : 64;\n key.length > blocksize\n ? (key = hash(key))\n : key.length < blocksize && (key = Buffer2.concat([key, ZEROS], blocksize));\n for (\n var ipad = Buffer2.allocUnsafe(blocksize + sizes[alg]),\n opad = Buffer2.allocUnsafe(blocksize + sizes[alg]),\n i = 0;\n i < blocksize;\n i++\n )\n (ipad[i] = key[i] ^ 54), (opad[i] = key[i] ^ 92);\n var ipad1 = Buffer2.allocUnsafe(blocksize + saltLen + 4);\n ipad.copy(ipad1, 0, 0, blocksize),\n (this.ipad1 = ipad1),\n (this.ipad2 = ipad),\n (this.opad = opad),\n (this.alg = alg),\n (this.blocksize = blocksize),\n (this.hash = hash),\n (this.size = sizes[alg]);\n }\n Hmac.prototype.run = function (data, ipad) {\n data.copy(ipad, this.blocksize);\n var h = this.hash(ipad);\n return h.copy(this.opad, this.blocksize), this.hash(this.opad);\n };\n function getDigest(alg) {\n function shaFunc(data) {\n return sha(alg).update(data).digest();\n }\n function rmd160Func(data) {\n return new RIPEMD160().update(data).digest();\n }\n return alg === \"rmd160\" || alg === \"ripemd160\" ? rmd160Func : alg === \"md5\" ? md5 : shaFunc;\n }\n function pbkdf2(password, salt, iterations, keylen, digest) {\n checkParameters(iterations, keylen),\n (password = toBuffer(password, defaultEncoding, \"Password\")),\n (salt = toBuffer(salt, defaultEncoding, \"Salt\")),\n (digest = digest || \"sha1\");\n var hmac = new Hmac(digest, password, salt.length),\n DK = Buffer2.allocUnsafe(keylen),\n block1 = Buffer2.allocUnsafe(salt.length + 4);\n salt.copy(block1, 0, 0, salt.length);\n for (var destPos = 0, hLen = sizes[digest], l = Math.ceil(keylen / hLen), i = 1; i <= l; i++) {\n block1.writeUInt32BE(i, salt.length);\n for (var T = hmac.run(block1, hmac.ipad1), U = T, j = 1; j < iterations; j++) {\n U = hmac.run(U, hmac.ipad2);\n for (var k = 0; k < hLen; k++) T[k] ^= U[k];\n }\n T.copy(DK, destPos), (destPos += hLen);\n }\n return DK;\n }\n module.exports = pbkdf2;\n },\n});\n\n// node_modules/pbkdf2/lib/async.js\nvar require_async = __commonJS({\n \"node_modules/pbkdf2/lib/async.js\"(exports, module) {\n var Buffer2 = require_safe_buffer().Buffer,\n checkParameters = require_precondition(),\n defaultEncoding = require_default_encoding(),\n sync = require_sync_browser(),\n toBuffer = require_to_buffer(),\n ZERO_BUF,\n subtle = globalCrypto.subtle,\n toBrowser = {\n sha: \"SHA-1\",\n \"sha-1\": \"SHA-1\",\n sha1: \"SHA-1\",\n sha256: \"SHA-256\",\n \"sha-256\": \"SHA-256\",\n sha384: \"SHA-384\",\n \"sha-384\": \"SHA-384\",\n \"sha-512\": \"SHA-512\",\n sha512: \"SHA-512\",\n },\n checks = [];\n function checkNative(algo) {\n if ((global.process && !global.process.browser) || !subtle || !subtle.importKey || !subtle.deriveBits)\n return Promise.resolve(!1);\n if (checks[algo] !== void 0) return checks[algo];\n ZERO_BUF = ZERO_BUF || Buffer2.alloc(8);\n var prom = browserPbkdf2(ZERO_BUF, ZERO_BUF, 10, 128, algo)\n .then(function () {\n return !0;\n })\n .catch(function () {\n return !1;\n });\n return (checks[algo] = prom), prom;\n }\n var nextTick;\n function getNextTick() {\n return (\n nextTick ||\n (global.process && global.process.nextTick\n ? (nextTick = global.process.nextTick)\n : global.queueMicrotask\n ? (nextTick = global.queueMicrotask)\n : global.setImmediate\n ? (nextTick = global.setImmediate)\n : (nextTick = global.setTimeout),\n nextTick)\n );\n }\n function browserPbkdf2(password, salt, iterations, length, algo) {\n return subtle\n .importKey(\"raw\", password, { name: \"PBKDF2\" }, !1, [\"deriveBits\"])\n .then(function (key) {\n return subtle.deriveBits(\n {\n name: \"PBKDF2\",\n salt,\n iterations,\n hash: {\n name: algo,\n },\n },\n key,\n length << 3,\n );\n })\n .then(function (res) {\n return Buffer2.from(res);\n });\n }\n function resolvePromise(promise, callback) {\n promise.then(\n function (out) {\n getNextTick()(function () {\n callback(null, out);\n });\n },\n function (e) {\n getNextTick()(function () {\n callback(e);\n });\n },\n );\n }\n module.exports = function (password, salt, iterations, keylen, digest, callback) {\n typeof digest == \"function\" && ((callback = digest), (digest = void 0)), (digest = digest || \"sha1\");\n var algo = toBrowser[digest.toLowerCase()];\n if (!algo || typeof global.Promise != \"function\") {\n getNextTick()(function () {\n var out;\n try {\n out = sync(password, salt, iterations, keylen, digest);\n } catch (e) {\n return callback(e);\n }\n callback(null, out);\n });\n return;\n }\n if (\n (checkParameters(iterations, keylen),\n (password = toBuffer(password, defaultEncoding, \"Password\")),\n (salt = toBuffer(salt, defaultEncoding, \"Salt\")),\n typeof callback != \"function\")\n )\n throw new Error(\"No callback provided to pbkdf2\");\n resolvePromise(\n checkNative(algo).then(function (resp) {\n return resp\n ? browserPbkdf2(password, salt, iterations, keylen, algo)\n : sync(password, salt, iterations, keylen, digest);\n }),\n callback,\n );\n };\n },\n});\n\n// node_modules/pbkdf2/browser.js\nvar require_browser4 = __commonJS({\n \"node_modules/pbkdf2/browser.js\"(exports) {\n exports.pbkdf2 = require_async();\n exports.pbkdf2Sync = require_sync_browser();\n },\n});\n\n// node_modules/des.js/lib/des/utils.js\nvar require_utils = __commonJS({\n \"node_modules/des.js/lib/des/utils.js\"(exports) {\n \"use strict\";\n exports.readUInt32BE = function (bytes, off) {\n var res = (bytes[0 + off] << 24) | (bytes[1 + off] << 16) | (bytes[2 + off] << 8) | bytes[3 + off];\n return res >>> 0;\n };\n exports.writeUInt32BE = function (bytes, value, off) {\n (bytes[0 + off] = value >>> 24),\n (bytes[1 + off] = (value >>> 16) & 255),\n (bytes[2 + off] = (value >>> 8) & 255),\n (bytes[3 + off] = value & 255);\n };\n exports.ip = function (inL, inR, out, off) {\n for (var outL = 0, outR = 0, i = 6; i >= 0; i -= 2) {\n for (var j = 0; j <= 24; j += 8) (outL <<= 1), (outL |= (inR >>> (j + i)) & 1);\n for (var j = 0; j <= 24; j += 8) (outL <<= 1), (outL |= (inL >>> (j + i)) & 1);\n }\n for (var i = 6; i >= 0; i -= 2) {\n for (var j = 1; j <= 25; j += 8) (outR <<= 1), (outR |= (inR >>> (j + i)) & 1);\n for (var j = 1; j <= 25; j += 8) (outR <<= 1), (outR |= (inL >>> (j + i)) & 1);\n }\n (out[off + 0] = outL >>> 0), (out[off + 1] = outR >>> 0);\n };\n exports.rip = function (inL, inR, out, off) {\n for (var outL = 0, outR = 0, i = 0; i < 4; i++)\n for (var j = 24; j >= 0; j -= 8)\n (outL <<= 1), (outL |= (inR >>> (j + i)) & 1), (outL <<= 1), (outL |= (inL >>> (j + i)) & 1);\n for (var i = 4; i < 8; i++)\n for (var j = 24; j >= 0; j -= 8)\n (outR <<= 1), (outR |= (inR >>> (j + i)) & 1), (outR <<= 1), (outR |= (inL >>> (j + i)) & 1);\n (out[off + 0] = outL >>> 0), (out[off + 1] = outR >>> 0);\n };\n exports.pc1 = function (inL, inR, out, off) {\n for (var outL = 0, outR = 0, i = 7; i >= 5; i--) {\n for (var j = 0; j <= 24; j += 8) (outL <<= 1), (outL |= (inR >> (j + i)) & 1);\n for (var j = 0; j <= 24; j += 8) (outL <<= 1), (outL |= (inL >> (j + i)) & 1);\n }\n for (var j = 0; j <= 24; j += 8) (outL <<= 1), (outL |= (inR >> (j + i)) & 1);\n for (var i = 1; i <= 3; i++) {\n for (var j = 0; j <= 24; j += 8) (outR <<= 1), (outR |= (inR >> (j + i)) & 1);\n for (var j = 0; j <= 24; j += 8) (outR <<= 1), (outR |= (inL >> (j + i)) & 1);\n }\n for (var j = 0; j <= 24; j += 8) (outR <<= 1), (outR |= (inL >> (j + i)) & 1);\n (out[off + 0] = outL >>> 0), (out[off + 1] = outR >>> 0);\n };\n exports.r28shl = function (num, shift) {\n return ((num << shift) & 268435455) | (num >>> (28 - shift));\n };\n var pc2table = [\n 14, 11, 17, 4, 27, 23, 25, 0, 13, 22, 7, 18, 5, 9, 16, 24, 2, 20, 12, 21, 1, 8, 15, 26, 15, 4, 25, 19, 9, 1, 26,\n 16, 5, 11, 23, 8, 12, 7, 17, 0, 22, 3, 10, 14, 6, 20, 27, 24,\n ];\n exports.pc2 = function (inL, inR, out, off) {\n for (var outL = 0, outR = 0, len = pc2table.length >>> 1, i = 0; i < len; i++)\n (outL <<= 1), (outL |= (inL >>> pc2table[i]) & 1);\n for (var i = len; i < pc2table.length; i++) (outR <<= 1), (outR |= (inR >>> pc2table[i]) & 1);\n (out[off + 0] = outL >>> 0), (out[off + 1] = outR >>> 0);\n };\n exports.expand = function (r, out, off) {\n var outL = 0,\n outR = 0;\n outL = ((r & 1) << 5) | (r >>> 27);\n for (var i = 23; i >= 15; i -= 4) (outL <<= 6), (outL |= (r >>> i) & 63);\n for (var i = 11; i >= 3; i -= 4) (outR |= (r >>> i) & 63), (outR <<= 6);\n (outR |= ((r & 31) << 1) | (r >>> 31)), (out[off + 0] = outL >>> 0), (out[off + 1] = outR >>> 0);\n };\n var sTable = [\n 14, 0, 4, 15, 13, 7, 1, 4, 2, 14, 15, 2, 11, 13, 8, 1, 3, 10, 10, 6, 6, 12, 12, 11, 5, 9, 9, 5, 0, 3, 7, 8, 4, 15,\n 1, 12, 14, 8, 8, 2, 13, 4, 6, 9, 2, 1, 11, 7, 15, 5, 12, 11, 9, 3, 7, 14, 3, 10, 10, 0, 5, 6, 0, 13, 15, 3, 1, 13,\n 8, 4, 14, 7, 6, 15, 11, 2, 3, 8, 4, 14, 9, 12, 7, 0, 2, 1, 13, 10, 12, 6, 0, 9, 5, 11, 10, 5, 0, 13, 14, 8, 7, 10,\n 11, 1, 10, 3, 4, 15, 13, 4, 1, 2, 5, 11, 8, 6, 12, 7, 6, 12, 9, 0, 3, 5, 2, 14, 15, 9, 10, 13, 0, 7, 9, 0, 14, 9,\n 6, 3, 3, 4, 15, 6, 5, 10, 1, 2, 13, 8, 12, 5, 7, 14, 11, 12, 4, 11, 2, 15, 8, 1, 13, 1, 6, 10, 4, 13, 9, 0, 8, 6,\n 15, 9, 3, 8, 0, 7, 11, 4, 1, 15, 2, 14, 12, 3, 5, 11, 10, 5, 14, 2, 7, 12, 7, 13, 13, 8, 14, 11, 3, 5, 0, 6, 6,\n 15, 9, 0, 10, 3, 1, 4, 2, 7, 8, 2, 5, 12, 11, 1, 12, 10, 4, 14, 15, 9, 10, 3, 6, 15, 9, 0, 0, 6, 12, 10, 11, 1, 7,\n 13, 13, 8, 15, 9, 1, 4, 3, 5, 14, 11, 5, 12, 2, 7, 8, 2, 4, 14, 2, 14, 12, 11, 4, 2, 1, 12, 7, 4, 10, 7, 11, 13,\n 6, 1, 8, 5, 5, 0, 3, 15, 15, 10, 13, 3, 0, 9, 14, 8, 9, 6, 4, 11, 2, 8, 1, 12, 11, 7, 10, 1, 13, 14, 7, 2, 8, 13,\n 15, 6, 9, 15, 12, 0, 5, 9, 6, 10, 3, 4, 0, 5, 14, 3, 12, 10, 1, 15, 10, 4, 15, 2, 9, 7, 2, 12, 6, 9, 8, 5, 0, 6,\n 13, 1, 3, 13, 4, 14, 14, 0, 7, 11, 5, 3, 11, 8, 9, 4, 14, 3, 15, 2, 5, 12, 2, 9, 8, 5, 12, 15, 3, 10, 7, 11, 0,\n 14, 4, 1, 10, 7, 1, 6, 13, 0, 11, 8, 6, 13, 4, 13, 11, 0, 2, 11, 14, 7, 15, 4, 0, 9, 8, 1, 13, 10, 3, 14, 12, 3,\n 9, 5, 7, 12, 5, 2, 10, 15, 6, 8, 1, 6, 1, 6, 4, 11, 11, 13, 13, 8, 12, 1, 3, 4, 7, 10, 14, 7, 10, 9, 15, 5, 6, 0,\n 8, 15, 0, 14, 5, 2, 9, 3, 2, 12, 13, 1, 2, 15, 8, 13, 4, 8, 6, 10, 15, 3, 11, 7, 1, 4, 10, 12, 9, 5, 3, 6, 14, 11,\n 5, 0, 0, 14, 12, 9, 7, 2, 7, 2, 11, 1, 4, 14, 1, 7, 9, 4, 12, 10, 14, 8, 2, 13, 0, 15, 6, 12, 10, 9, 13, 0, 15, 3,\n 3, 5, 5, 6, 8, 11,\n ];\n exports.substitute = function (inL, inR) {\n for (var out = 0, i = 0; i < 4; i++) {\n var b = (inL >>> (18 - i * 6)) & 63,\n sb = sTable[i * 64 + b];\n (out <<= 4), (out |= sb);\n }\n for (var i = 0; i < 4; i++) {\n var b = (inR >>> (18 - i * 6)) & 63,\n sb = sTable[4 * 64 + i * 64 + b];\n (out <<= 4), (out |= sb);\n }\n return out >>> 0;\n };\n var permuteTable = [\n 16, 25, 12, 11, 3, 20, 4, 15, 31, 17, 9, 6, 27, 14, 1, 22, 30, 24, 8, 18, 0, 5, 29, 23, 13, 19, 2, 26, 10, 21, 28,\n 7,\n ];\n exports.permute = function (num) {\n for (var out = 0, i = 0; i < permuteTable.length; i++) (out <<= 1), (out |= (num >>> permuteTable[i]) & 1);\n return out >>> 0;\n };\n exports.padSplit = function (num, size, group) {\n for (var str = num.toString(2); str.length < size; ) str = \"0\" + str;\n for (var out = [], i = 0; i < size; i += group) out.push(str.slice(i, i + group));\n return out.join(\" \");\n };\n },\n});\n\n// node_modules/minimalistic-assert/index.js\nvar require_minimalistic_assert = __commonJS({\n \"node_modules/minimalistic-assert/index.js\"(exports, module) {\n module.exports = assert;\n function assert(val, msg) {\n if (!val) throw new Error(msg || \"Assertion failed\");\n }\n assert.equal = function (l, r, msg) {\n if (l != r) throw new Error(msg || \"Assertion failed: \" + l + \" != \" + r);\n };\n },\n});\n\n// node_modules/des.js/lib/des/cipher.js\nvar require_cipher = __commonJS({\n \"node_modules/des.js/lib/des/cipher.js\"(exports, module) {\n \"use strict\";\n var assert = require_minimalistic_assert();\n function Cipher(options) {\n (this.options = options),\n (this.type = this.options.type),\n (this.blockSize = 8),\n this._init(),\n (this.buffer = new Array(this.blockSize)),\n (this.bufferOff = 0);\n }\n module.exports = Cipher;\n Cipher.prototype._init = function () {};\n Cipher.prototype.update = function (data) {\n return data.length === 0 ? [] : this.type === \"decrypt\" ? this._updateDecrypt(data) : this._updateEncrypt(data);\n };\n Cipher.prototype._buffer = function (data, off) {\n for (var min = Math.min(this.buffer.length - this.bufferOff, data.length - off), i = 0; i < min; i++)\n this.buffer[this.bufferOff + i] = data[off + i];\n return (this.bufferOff += min), min;\n };\n Cipher.prototype._flushBuffer = function (out, off) {\n return this._update(this.buffer, 0, out, off), (this.bufferOff = 0), this.blockSize;\n };\n Cipher.prototype._updateEncrypt = function (data) {\n var inputOff = 0,\n outputOff = 0,\n count = ((this.bufferOff + data.length) / this.blockSize) | 0,\n out = new Array(count * this.blockSize);\n this.bufferOff !== 0 &&\n ((inputOff += this._buffer(data, inputOff)),\n this.bufferOff === this.buffer.length && (outputOff += this._flushBuffer(out, outputOff)));\n for (\n var max = data.length - ((data.length - inputOff) % this.blockSize);\n inputOff < max;\n inputOff += this.blockSize\n )\n this._update(data, inputOff, out, outputOff), (outputOff += this.blockSize);\n for (; inputOff < data.length; inputOff++, this.bufferOff++) this.buffer[this.bufferOff] = data[inputOff];\n return out;\n };\n Cipher.prototype._updateDecrypt = function (data) {\n for (\n var inputOff = 0,\n outputOff = 0,\n count = Math.ceil((this.bufferOff + data.length) / this.blockSize) - 1,\n out = new Array(count * this.blockSize);\n count > 0;\n count--\n )\n (inputOff += this._buffer(data, inputOff)), (outputOff += this._flushBuffer(out, outputOff));\n return (inputOff += this._buffer(data, inputOff)), out;\n };\n Cipher.prototype.final = function (buffer) {\n var first;\n buffer && (first = this.update(buffer));\n var last;\n return (\n this.type === \"encrypt\" ? (last = this._finalEncrypt()) : (last = this._finalDecrypt()),\n first ? first.concat(last) : last\n );\n };\n Cipher.prototype._pad = function (buffer, off) {\n if (off === 0) return !1;\n for (; off < buffer.length; ) buffer[off++] = 0;\n return !0;\n };\n Cipher.prototype._finalEncrypt = function () {\n if (!this._pad(this.buffer, this.bufferOff)) return [];\n var out = new Array(this.blockSize);\n return this._update(this.buffer, 0, out, 0), out;\n };\n Cipher.prototype._unpad = function (buffer) {\n return buffer;\n };\n Cipher.prototype._finalDecrypt = function () {\n assert.equal(this.bufferOff, this.blockSize, \"Not enough data to decrypt\");\n var out = new Array(this.blockSize);\n return this._flushBuffer(out, 0), this._unpad(out);\n };\n },\n});\n\n// node_modules/des.js/lib/des/des.js\nvar require_des = __commonJS({\n \"node_modules/des.js/lib/des/des.js\"(exports, module) {\n \"use strict\";\n var assert = require_minimalistic_assert(),\n inherits = require_inherits_browser(),\n utils = require_utils(),\n Cipher = require_cipher();\n function DESState() {\n (this.tmp = new Array(2)), (this.keys = null);\n }\n function DES(options) {\n Cipher.call(this, options);\n var state = new DESState();\n (this._desState = state), this.deriveKeys(state, options.key);\n }\n inherits(DES, Cipher);\n module.exports = DES;\n DES.create = function (options) {\n return new DES(options);\n };\n var shiftTable = [1, 1, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 1];\n DES.prototype.deriveKeys = function (state, key) {\n (state.keys = new Array(16 * 2)), assert.equal(key.length, this.blockSize, \"Invalid key length\");\n var kL = utils.readUInt32BE(key, 0),\n kR = utils.readUInt32BE(key, 4);\n utils.pc1(kL, kR, state.tmp, 0), (kL = state.tmp[0]), (kR = state.tmp[1]);\n for (var i = 0; i < state.keys.length; i += 2) {\n var shift = shiftTable[i >>> 1];\n (kL = utils.r28shl(kL, shift)), (kR = utils.r28shl(kR, shift)), utils.pc2(kL, kR, state.keys, i);\n }\n };\n DES.prototype._update = function (inp, inOff, out, outOff) {\n var state = this._desState,\n l = utils.readUInt32BE(inp, inOff),\n r = utils.readUInt32BE(inp, inOff + 4);\n utils.ip(l, r, state.tmp, 0),\n (l = state.tmp[0]),\n (r = state.tmp[1]),\n this.type === \"encrypt\" ? this._encrypt(state, l, r, state.tmp, 0) : this._decrypt(state, l, r, state.tmp, 0),\n (l = state.tmp[0]),\n (r = state.tmp[1]),\n utils.writeUInt32BE(out, l, outOff),\n utils.writeUInt32BE(out, r, outOff + 4);\n };\n DES.prototype._pad = function (buffer, off) {\n for (var value = buffer.length - off, i = off; i < buffer.length; i++) buffer[i] = value;\n return !0;\n };\n DES.prototype._unpad = function (buffer) {\n for (var pad = buffer[buffer.length - 1], i = buffer.length - pad; i < buffer.length; i++)\n assert.equal(buffer[i], pad);\n return buffer.slice(0, buffer.length - pad);\n };\n DES.prototype._encrypt = function (state, lStart, rStart, out, off) {\n for (var l = lStart, r = rStart, i = 0; i < state.keys.length; i += 2) {\n var keyL = state.keys[i],\n keyR = state.keys[i + 1];\n utils.expand(r, state.tmp, 0), (keyL ^= state.tmp[0]), (keyR ^= state.tmp[1]);\n var s = utils.substitute(keyL, keyR),\n f = utils.permute(s),\n t = r;\n (r = (l ^ f) >>> 0), (l = t);\n }\n utils.rip(r, l, out, off);\n };\n DES.prototype._decrypt = function (state, lStart, rStart, out, off) {\n for (var l = rStart, r = lStart, i = state.keys.length - 2; i >= 0; i -= 2) {\n var keyL = state.keys[i],\n keyR = state.keys[i + 1];\n utils.expand(l, state.tmp, 0), (keyL ^= state.tmp[0]), (keyR ^= state.tmp[1]);\n var s = utils.substitute(keyL, keyR),\n f = utils.permute(s),\n t = l;\n (l = (r ^ f) >>> 0), (r = t);\n }\n utils.rip(l, r, out, off);\n };\n },\n});\n\n// node_modules/des.js/lib/des/cbc.js\nvar require_cbc = __commonJS({\n \"node_modules/des.js/lib/des/cbc.js\"(exports) {\n \"use strict\";\n var assert = require_minimalistic_assert(),\n inherits = require_inherits_browser(),\n proto = {};\n function CBCState(iv) {\n assert.equal(iv.length, 8, \"Invalid IV length\"), (this.iv = new Array(8));\n for (var i = 0; i < this.iv.length; i++) this.iv[i] = iv[i];\n }\n function instantiate(Base) {\n function CBC(options) {\n Base.call(this, options), this._cbcInit();\n }\n inherits(CBC, Base);\n for (var keys = Object.keys(proto), i = 0; i < keys.length; i++) {\n var key = keys[i];\n CBC.prototype[key] = proto[key];\n }\n return (\n (CBC.create = function (options) {\n return new CBC(options);\n }),\n CBC\n );\n }\n exports.instantiate = instantiate;\n proto._cbcInit = function () {\n var state = new CBCState(this.options.iv);\n this._cbcState = state;\n };\n proto._update = function (inp, inOff, out, outOff) {\n var state = this._cbcState,\n superProto = this.constructor.super_.prototype,\n iv = state.iv;\n if (this.type === \"encrypt\") {\n for (var i = 0; i < this.blockSize; i++) iv[i] ^= inp[inOff + i];\n superProto._update.call(this, iv, 0, out, outOff);\n for (var i = 0; i < this.blockSize; i++) iv[i] = out[outOff + i];\n } else {\n superProto._update.call(this, inp, inOff, out, outOff);\n for (var i = 0; i < this.blockSize; i++) out[outOff + i] ^= iv[i];\n for (var i = 0; i < this.blockSize; i++) iv[i] = inp[inOff + i];\n }\n };\n },\n});\n\n// node_modules/des.js/lib/des/ede.js\nvar require_ede = __commonJS({\n \"node_modules/des.js/lib/des/ede.js\"(exports, module) {\n \"use strict\";\n var assert = require_minimalistic_assert(),\n inherits = require_inherits_browser(),\n Cipher = require_cipher(),\n DES = require_des();\n function EDEState(type, key) {\n assert.equal(key.length, 24, \"Invalid key length\");\n var k1 = key.slice(0, 8),\n k2 = key.slice(8, 16),\n k3 = key.slice(16, 24);\n type === \"encrypt\"\n ? (this.ciphers = [\n DES.create({ type: \"encrypt\", key: k1 }),\n DES.create({ type: \"decrypt\", key: k2 }),\n DES.create({ type: \"encrypt\", key: k3 }),\n ])\n : (this.ciphers = [\n DES.create({ type: \"decrypt\", key: k3 }),\n DES.create({ type: \"encrypt\", key: k2 }),\n DES.create({ type: \"decrypt\", key: k1 }),\n ]);\n }\n function EDE(options) {\n Cipher.call(this, options);\n var state = new EDEState(this.type, this.options.key);\n this._edeState = state;\n }\n inherits(EDE, Cipher);\n module.exports = EDE;\n EDE.create = function (options) {\n return new EDE(options);\n };\n EDE.prototype._update = function (inp, inOff, out, outOff) {\n var state = this._edeState;\n state.ciphers[0]._update(inp, inOff, out, outOff),\n state.ciphers[1]._update(out, outOff, out, outOff),\n state.ciphers[2]._update(out, outOff, out, outOff);\n };\n EDE.prototype._pad = DES.prototype._pad;\n EDE.prototype._unpad = DES.prototype._unpad;\n },\n});\n\n// node_modules/des.js/lib/des.js\nvar require_des2 = __commonJS({\n \"node_modules/des.js/lib/des.js\"(exports) {\n \"use strict\";\n exports.utils = require_utils();\n exports.Cipher = require_cipher();\n exports.DES = require_des();\n exports.CBC = require_cbc();\n exports.EDE = require_ede();\n },\n});\n\n// node_modules/browserify-des/index.js\nvar require_browserify_des = __commonJS({\n \"node_modules/browserify-des/index.js\"(exports, module) {\n var CipherBase = require_cipher_base(),\n des = require_des2(),\n inherits = require_inherits_browser(),\n Buffer2 = require_safe_buffer().Buffer,\n modes = {\n \"des-ede3-cbc\": des.CBC.instantiate(des.EDE),\n \"des-ede3\": des.EDE,\n \"des-ede-cbc\": des.CBC.instantiate(des.EDE),\n \"des-ede\": des.EDE,\n \"des-cbc\": des.CBC.instantiate(des.DES),\n \"des-ecb\": des.DES,\n };\n modes.des = modes[\"des-cbc\"];\n modes.des3 = modes[\"des-ede3-cbc\"];\n module.exports = DES;\n inherits(DES, CipherBase);\n function DES(opts) {\n CipherBase.call(this);\n var modeName = opts.mode.toLowerCase(),\n mode = modes[modeName],\n type;\n opts.decrypt ? (type = \"decrypt\") : (type = \"encrypt\");\n var key = opts.key;\n Buffer2.isBuffer(key) || (key = Buffer2.from(key)),\n (modeName === \"des-ede\" || modeName === \"des-ede-cbc\") && (key = Buffer2.concat([key, key.slice(0, 8)]));\n var iv = opts.iv;\n Buffer2.isBuffer(iv) || (iv = Buffer2.from(iv)),\n (this._des = mode.create({\n key,\n iv,\n type,\n }));\n }\n DES.prototype._update = function (data) {\n return Buffer2.from(this._des.update(data));\n };\n DES.prototype._final = function () {\n return Buffer2.from(this._des.final());\n };\n },\n});\n\n// node_modules/browserify-aes/modes/ecb.js\nvar require_ecb = __commonJS({\n \"node_modules/browserify-aes/modes/ecb.js\"(exports) {\n exports.encrypt = function (self2, block) {\n return self2._cipher.encryptBlock(block);\n };\n exports.decrypt = function (self2, block) {\n return self2._cipher.decryptBlock(block);\n };\n },\n});\n\n// node_modules/buffer-xor/index.js\nvar require_buffer_xor = __commonJS({\n \"node_modules/buffer-xor/index.js\"(exports, module) {\n module.exports = function (a, b) {\n for (var length = Math.min(a.length, b.length), buffer = new Buffer(length), i = 0; i < length; ++i)\n buffer[i] = a[i] ^ b[i];\n return buffer;\n };\n },\n});\n\n// node_modules/browserify-aes/modes/cbc.js\nvar require_cbc2 = __commonJS({\n \"node_modules/browserify-aes/modes/cbc.js\"(exports) {\n var xor = require_buffer_xor();\n exports.encrypt = function (self2, block) {\n var data = xor(block, self2._prev);\n return (self2._prev = self2._cipher.encryptBlock(data)), self2._prev;\n };\n exports.decrypt = function (self2, block) {\n var pad = self2._prev;\n self2._prev = block;\n var out = self2._cipher.decryptBlock(block);\n return xor(out, pad);\n };\n },\n});\n\n// node_modules/browserify-aes/modes/cfb.js\nvar require_cfb = __commonJS({\n \"node_modules/browserify-aes/modes/cfb.js\"(exports) {\n var Buffer2 = require_safe_buffer().Buffer,\n xor = require_buffer_xor();\n function encryptStart(self2, data, decrypt) {\n var len = data.length,\n out = xor(data, self2._cache);\n return (\n (self2._cache = self2._cache.slice(len)),\n (self2._prev = Buffer2.concat([self2._prev, decrypt ? data : out])),\n out\n );\n }\n exports.encrypt = function (self2, data, decrypt) {\n for (var out = Buffer2.allocUnsafe(0), len; data.length; )\n if (\n (self2._cache.length === 0 &&\n ((self2._cache = self2._cipher.encryptBlock(self2._prev)), (self2._prev = Buffer2.allocUnsafe(0))),\n self2._cache.length <= data.length)\n )\n (len = self2._cache.length),\n (out = Buffer2.concat([out, encryptStart(self2, data.slice(0, len), decrypt)])),\n (data = data.slice(len));\n else {\n out = Buffer2.concat([out, encryptStart(self2, data, decrypt)]);\n break;\n }\n return out;\n };\n },\n});\n\n// node_modules/browserify-aes/modes/cfb8.js\nvar require_cfb8 = __commonJS({\n \"node_modules/browserify-aes/modes/cfb8.js\"(exports) {\n var Buffer2 = require_safe_buffer().Buffer;\n function encryptByte(self2, byteParam, decrypt) {\n var pad = self2._cipher.encryptBlock(self2._prev),\n out = pad[0] ^ byteParam;\n return (self2._prev = Buffer2.concat([self2._prev.slice(1), Buffer2.from([decrypt ? byteParam : out])])), out;\n }\n exports.encrypt = function (self2, chunk, decrypt) {\n for (var len = chunk.length, out = Buffer2.allocUnsafe(len), i = -1; ++i < len; )\n out[i] = encryptByte(self2, chunk[i], decrypt);\n return out;\n };\n },\n});\n\n// node_modules/browserify-aes/modes/cfb1.js\nvar require_cfb1 = __commonJS({\n \"node_modules/browserify-aes/modes/cfb1.js\"(exports) {\n var Buffer2 = require_safe_buffer().Buffer;\n function encryptByte(self2, byteParam, decrypt) {\n for (var pad, i = -1, len = 8, out = 0, bit, value; ++i < len; )\n (pad = self2._cipher.encryptBlock(self2._prev)),\n (bit = byteParam & (1 << (7 - i)) ? 128 : 0),\n (value = pad[0] ^ bit),\n (out += (value & 128) >> i % 8),\n (self2._prev = shiftIn(self2._prev, decrypt ? bit : value));\n return out;\n }\n function shiftIn(buffer, value) {\n var len = buffer.length,\n i = -1,\n out = Buffer2.allocUnsafe(buffer.length);\n for (buffer = Buffer2.concat([buffer, Buffer2.from([value])]); ++i < len; )\n out[i] = (buffer[i] << 1) | (buffer[i + 1] >> 7);\n return out;\n }\n exports.encrypt = function (self2, chunk, decrypt) {\n for (var len = chunk.length, out = Buffer2.allocUnsafe(len), i = -1; ++i < len; )\n out[i] = encryptByte(self2, chunk[i], decrypt);\n return out;\n };\n },\n});\n\n// node_modules/browserify-aes/modes/ofb.js\nvar require_ofb = __commonJS({\n \"node_modules/browserify-aes/modes/ofb.js\"(exports) {\n var xor = require_buffer_xor();\n function getBlock(self2) {\n return (self2._prev = self2._cipher.encryptBlock(self2._prev)), self2._prev;\n }\n exports.encrypt = function (self2, chunk) {\n for (; self2._cache.length < chunk.length; ) self2._cache = Buffer.concat([self2._cache, getBlock(self2)]);\n var pad = self2._cache.slice(0, chunk.length);\n return (self2._cache = self2._cache.slice(chunk.length)), xor(chunk, pad);\n };\n },\n});\n\n// node_modules/browserify-aes/incr32.js\nvar require_incr32 = __commonJS({\n \"node_modules/browserify-aes/incr32.js\"(exports, module) {\n function incr32(iv) {\n for (var len = iv.length, item; len--; )\n if (((item = iv.readUInt8(len)), item === 255)) iv.writeUInt8(0, len);\n else {\n item++, iv.writeUInt8(item, len);\n break;\n }\n }\n module.exports = incr32;\n },\n});\n\n// node_modules/browserify-aes/modes/ctr.js\nvar require_ctr = __commonJS({\n \"node_modules/browserify-aes/modes/ctr.js\"(exports) {\n var xor = require_buffer_xor(),\n Buffer2 = require_safe_buffer().Buffer,\n incr32 = require_incr32();\n function getBlock(self2) {\n var out = self2._cipher.encryptBlockRaw(self2._prev);\n return incr32(self2._prev), out;\n }\n var blockSize = 16;\n exports.encrypt = function (self2, chunk) {\n var chunkNum = Math.ceil(chunk.length / blockSize),\n start = self2._cache.length;\n self2._cache = Buffer2.concat([self2._cache, Buffer2.allocUnsafe(chunkNum * blockSize)]);\n for (var i = 0; i < chunkNum; i++) {\n var out = getBlock(self2),\n offset = start + i * blockSize;\n self2._cache.writeUInt32BE(out[0], offset + 0),\n self2._cache.writeUInt32BE(out[1], offset + 4),\n self2._cache.writeUInt32BE(out[2], offset + 8),\n self2._cache.writeUInt32BE(out[3], offset + 12);\n }\n var pad = self2._cache.slice(0, chunk.length);\n return (self2._cache = self2._cache.slice(chunk.length)), xor(chunk, pad);\n };\n },\n});\n\n// node_modules/browserify-aes/modes/list.json\nvar require_list = __commonJS({\n \"node_modules/browserify-aes/modes/list.json\"(exports, module) {\n module.exports = {\n \"aes-128-ecb\": {\n cipher: \"AES\",\n key: 128,\n iv: 0,\n mode: \"ECB\",\n type: \"block\",\n },\n \"aes-192-ecb\": {\n cipher: \"AES\",\n key: 192,\n iv: 0,\n mode: \"ECB\",\n type: \"block\",\n },\n \"aes-256-ecb\": {\n cipher: \"AES\",\n key: 256,\n iv: 0,\n mode: \"ECB\",\n type: \"block\",\n },\n \"aes-128-cbc\": {\n cipher: \"AES\",\n key: 128,\n iv: 16,\n mode: \"CBC\",\n type: \"block\",\n },\n \"aes-192-cbc\": {\n cipher: \"AES\",\n key: 192,\n iv: 16,\n mode: \"CBC\",\n type: \"block\",\n },\n \"aes-256-cbc\": {\n cipher: \"AES\",\n key: 256,\n iv: 16,\n mode: \"CBC\",\n type: \"block\",\n },\n aes128: {\n cipher: \"AES\",\n key: 128,\n iv: 16,\n mode: \"CBC\",\n type: \"block\",\n },\n aes192: {\n cipher: \"AES\",\n key: 192,\n iv: 16,\n mode: \"CBC\",\n type: \"block\",\n },\n aes256: {\n cipher: \"AES\",\n key: 256,\n iv: 16,\n mode: \"CBC\",\n type: \"block\",\n },\n \"aes-128-cfb\": {\n cipher: \"AES\",\n key: 128,\n iv: 16,\n mode: \"CFB\",\n type: \"stream\",\n },\n \"aes-192-cfb\": {\n cipher: \"AES\",\n key: 192,\n iv: 16,\n mode: \"CFB\",\n type: \"stream\",\n },\n \"aes-256-cfb\": {\n cipher: \"AES\",\n key: 256,\n iv: 16,\n mode: \"CFB\",\n type: \"stream\",\n },\n \"aes-128-cfb8\": {\n cipher: \"AES\",\n key: 128,\n iv: 16,\n mode: \"CFB8\",\n type: \"stream\",\n },\n \"aes-192-cfb8\": {\n cipher: \"AES\",\n key: 192,\n iv: 16,\n mode: \"CFB8\",\n type: \"stream\",\n },\n \"aes-256-cfb8\": {\n cipher: \"AES\",\n key: 256,\n iv: 16,\n mode: \"CFB8\",\n type: \"stream\",\n },\n \"aes-128-cfb1\": {\n cipher: \"AES\",\n key: 128,\n iv: 16,\n mode: \"CFB1\",\n type: \"stream\",\n },\n \"aes-192-cfb1\": {\n cipher: \"AES\",\n key: 192,\n iv: 16,\n mode: \"CFB1\",\n type: \"stream\",\n },\n \"aes-256-cfb1\": {\n cipher: \"AES\",\n key: 256,\n iv: 16,\n mode: \"CFB1\",\n type: \"stream\",\n },\n \"aes-128-ofb\": {\n cipher: \"AES\",\n key: 128,\n iv: 16,\n mode: \"OFB\",\n type: \"stream\",\n },\n \"aes-192-ofb\": {\n cipher: \"AES\",\n key: 192,\n iv: 16,\n mode: \"OFB\",\n type: \"stream\",\n },\n \"aes-256-ofb\": {\n cipher: \"AES\",\n key: 256,\n iv: 16,\n mode: \"OFB\",\n type: \"stream\",\n },\n \"aes-128-ctr\": {\n cipher: \"AES\",\n key: 128,\n iv: 16,\n mode: \"CTR\",\n type: \"stream\",\n },\n \"aes-192-ctr\": {\n cipher: \"AES\",\n key: 192,\n iv: 16,\n mode: \"CTR\",\n type: \"stream\",\n },\n \"aes-256-ctr\": {\n cipher: \"AES\",\n key: 256,\n iv: 16,\n mode: \"CTR\",\n type: \"stream\",\n },\n \"aes-128-gcm\": {\n cipher: \"AES\",\n key: 128,\n iv: 12,\n mode: \"GCM\",\n type: \"auth\",\n },\n \"aes-192-gcm\": {\n cipher: \"AES\",\n key: 192,\n iv: 12,\n mode: \"GCM\",\n type: \"auth\",\n },\n \"aes-256-gcm\": {\n cipher: \"AES\",\n key: 256,\n iv: 12,\n mode: \"GCM\",\n type: \"auth\",\n },\n };\n },\n});\n\n// node_modules/browserify-aes/modes/index.js\nvar require_modes = __commonJS({\n \"node_modules/browserify-aes/modes/index.js\"(exports, module) {\n var modeModules = {\n ECB: require_ecb(),\n CBC: require_cbc2(),\n CFB: require_cfb(),\n CFB8: require_cfb8(),\n CFB1: require_cfb1(),\n OFB: require_ofb(),\n CTR: require_ctr(),\n GCM: require_ctr(),\n },\n modes = require_list();\n for (key in modes) modes[key].module = modeModules[modes[key].mode];\n var key;\n module.exports = modes;\n },\n});\n\n// node_modules/browserify-aes/aes.js\nvar require_aes = __commonJS({\n \"node_modules/browserify-aes/aes.js\"(exports, module) {\n var Buffer2 = require_safe_buffer().Buffer;\n function asUInt32Array(buf) {\n Buffer2.isBuffer(buf) || (buf = Buffer2.from(buf));\n for (var len = (buf.length / 4) | 0, out = new Array(len), i = 0; i < len; i++) out[i] = buf.readUInt32BE(i * 4);\n return out;\n }\n function scrubVec(v) {\n for (var i = 0; i < v.length; v++) v[i] = 0;\n }\n function cryptBlock(M, keySchedule, SUB_MIX, SBOX, nRounds) {\n for (\n var SUB_MIX0 = SUB_MIX[0],\n SUB_MIX1 = SUB_MIX[1],\n SUB_MIX2 = SUB_MIX[2],\n SUB_MIX3 = SUB_MIX[3],\n s0 = M[0] ^ keySchedule[0],\n s1 = M[1] ^ keySchedule[1],\n s2 = M[2] ^ keySchedule[2],\n s3 = M[3] ^ keySchedule[3],\n t0,\n t1,\n t2,\n t3,\n ksRow = 4,\n round = 1;\n round < nRounds;\n round++\n )\n (t0 =\n SUB_MIX0[s0 >>> 24] ^\n SUB_MIX1[(s1 >>> 16) & 255] ^\n SUB_MIX2[(s2 >>> 8) & 255] ^\n SUB_MIX3[s3 & 255] ^\n keySchedule[ksRow++]),\n (t1 =\n SUB_MIX0[s1 >>> 24] ^\n SUB_MIX1[(s2 >>> 16) & 255] ^\n SUB_MIX2[(s3 >>> 8) & 255] ^\n SUB_MIX3[s0 & 255] ^\n keySchedule[ksRow++]),\n (t2 =\n SUB_MIX0[s2 >>> 24] ^\n SUB_MIX1[(s3 >>> 16) & 255] ^\n SUB_MIX2[(s0 >>> 8) & 255] ^\n SUB_MIX3[s1 & 255] ^\n keySchedule[ksRow++]),\n (t3 =\n SUB_MIX0[s3 >>> 24] ^\n SUB_MIX1[(s0 >>> 16) & 255] ^\n SUB_MIX2[(s1 >>> 8) & 255] ^\n SUB_MIX3[s2 & 255] ^\n keySchedule[ksRow++]),\n (s0 = t0),\n (s1 = t1),\n (s2 = t2),\n (s3 = t3);\n return (\n (t0 =\n ((SBOX[s0 >>> 24] << 24) | (SBOX[(s1 >>> 16) & 255] << 16) | (SBOX[(s2 >>> 8) & 255] << 8) | SBOX[s3 & 255]) ^\n keySchedule[ksRow++]),\n (t1 =\n ((SBOX[s1 >>> 24] << 24) | (SBOX[(s2 >>> 16) & 255] << 16) | (SBOX[(s3 >>> 8) & 255] << 8) | SBOX[s0 & 255]) ^\n keySchedule[ksRow++]),\n (t2 =\n ((SBOX[s2 >>> 24] << 24) | (SBOX[(s3 >>> 16) & 255] << 16) | (SBOX[(s0 >>> 8) & 255] << 8) | SBOX[s1 & 255]) ^\n keySchedule[ksRow++]),\n (t3 =\n ((SBOX[s3 >>> 24] << 24) | (SBOX[(s0 >>> 16) & 255] << 16) | (SBOX[(s1 >>> 8) & 255] << 8) | SBOX[s2 & 255]) ^\n keySchedule[ksRow++]),\n (t0 = t0 >>> 0),\n (t1 = t1 >>> 0),\n (t2 = t2 >>> 0),\n (t3 = t3 >>> 0),\n [t0, t1, t2, t3]\n );\n }\n var RCON = [0, 1, 2, 4, 8, 16, 32, 64, 128, 27, 54],\n G = (function () {\n for (var d = new Array(256), j = 0; j < 256; j++) j < 128 ? (d[j] = j << 1) : (d[j] = (j << 1) ^ 283);\n for (\n var SBOX = [],\n INV_SBOX = [],\n SUB_MIX = [[], [], [], []],\n INV_SUB_MIX = [[], [], [], []],\n x = 0,\n xi = 0,\n i = 0;\n i < 256;\n ++i\n ) {\n var sx = xi ^ (xi << 1) ^ (xi << 2) ^ (xi << 3) ^ (xi << 4);\n (sx = (sx >>> 8) ^ (sx & 255) ^ 99), (SBOX[x] = sx), (INV_SBOX[sx] = x);\n var x2 = d[x],\n x4 = d[x2],\n x8 = d[x4],\n t = (d[sx] * 257) ^ (sx * 16843008);\n (SUB_MIX[0][x] = (t << 24) | (t >>> 8)),\n (SUB_MIX[1][x] = (t << 16) | (t >>> 16)),\n (SUB_MIX[2][x] = (t << 8) | (t >>> 24)),\n (SUB_MIX[3][x] = t),\n (t = (x8 * 16843009) ^ (x4 * 65537) ^ (x2 * 257) ^ (x * 16843008)),\n (INV_SUB_MIX[0][sx] = (t << 24) | (t >>> 8)),\n (INV_SUB_MIX[1][sx] = (t << 16) | (t >>> 16)),\n (INV_SUB_MIX[2][sx] = (t << 8) | (t >>> 24)),\n (INV_SUB_MIX[3][sx] = t),\n x === 0 ? (x = xi = 1) : ((x = x2 ^ d[d[d[x8 ^ x2]]]), (xi ^= d[d[xi]]));\n }\n return {\n SBOX,\n INV_SBOX,\n SUB_MIX,\n INV_SUB_MIX,\n };\n })();\n function AES(key) {\n (this._key = asUInt32Array(key)), this._reset();\n }\n AES.blockSize = 4 * 4;\n AES.keySize = 256 / 8;\n AES.prototype.blockSize = AES.blockSize;\n AES.prototype.keySize = AES.keySize;\n AES.prototype._reset = function () {\n for (\n var keyWords = this._key,\n keySize = keyWords.length,\n nRounds = keySize + 6,\n ksRows = (nRounds + 1) * 4,\n keySchedule = [],\n k = 0;\n k < keySize;\n k++\n )\n keySchedule[k] = keyWords[k];\n for (k = keySize; k < ksRows; k++) {\n var t = keySchedule[k - 1];\n k % keySize === 0\n ? ((t = (t << 8) | (t >>> 24)),\n (t =\n (G.SBOX[t >>> 24] << 24) |\n (G.SBOX[(t >>> 16) & 255] << 16) |\n (G.SBOX[(t >>> 8) & 255] << 8) |\n G.SBOX[t & 255]),\n (t ^= RCON[(k / keySize) | 0] << 24))\n : keySize > 6 &&\n k % keySize === 4 &&\n (t =\n (G.SBOX[t >>> 24] << 24) |\n (G.SBOX[(t >>> 16) & 255] << 16) |\n (G.SBOX[(t >>> 8) & 255] << 8) |\n G.SBOX[t & 255]),\n (keySchedule[k] = keySchedule[k - keySize] ^ t);\n }\n for (var invKeySchedule = [], ik = 0; ik < ksRows; ik++) {\n var ksR = ksRows - ik,\n tt = keySchedule[ksR - (ik % 4 ? 0 : 4)];\n ik < 4 || ksR <= 4\n ? (invKeySchedule[ik] = tt)\n : (invKeySchedule[ik] =\n G.INV_SUB_MIX[0][G.SBOX[tt >>> 24]] ^\n G.INV_SUB_MIX[1][G.SBOX[(tt >>> 16) & 255]] ^\n G.INV_SUB_MIX[2][G.SBOX[(tt >>> 8) & 255]] ^\n G.INV_SUB_MIX[3][G.SBOX[tt & 255]]);\n }\n (this._nRounds = nRounds), (this._keySchedule = keySchedule), (this._invKeySchedule = invKeySchedule);\n };\n AES.prototype.encryptBlockRaw = function (M) {\n return (M = asUInt32Array(M)), cryptBlock(M, this._keySchedule, G.SUB_MIX, G.SBOX, this._nRounds);\n };\n AES.prototype.encryptBlock = function (M) {\n var out = this.encryptBlockRaw(M),\n buf = Buffer2.allocUnsafe(16);\n return (\n buf.writeUInt32BE(out[0], 0),\n buf.writeUInt32BE(out[1], 4),\n buf.writeUInt32BE(out[2], 8),\n buf.writeUInt32BE(out[3], 12),\n buf\n );\n };\n AES.prototype.decryptBlock = function (M) {\n M = asUInt32Array(M);\n var m1 = M[1];\n (M[1] = M[3]), (M[3] = m1);\n var out = cryptBlock(M, this._invKeySchedule, G.INV_SUB_MIX, G.INV_SBOX, this._nRounds),\n buf = Buffer2.allocUnsafe(16);\n return (\n buf.writeUInt32BE(out[0], 0),\n buf.writeUInt32BE(out[3], 4),\n buf.writeUInt32BE(out[2], 8),\n buf.writeUInt32BE(out[1], 12),\n buf\n );\n };\n AES.prototype.scrub = function () {\n scrubVec(this._keySchedule), scrubVec(this._invKeySchedule), scrubVec(this._key);\n };\n module.exports.AES = AES;\n },\n});\n\n// node_modules/browserify-aes/ghash.js\nvar require_ghash = __commonJS({\n \"node_modules/browserify-aes/ghash.js\"(exports, module) {\n var Buffer2 = require_safe_buffer().Buffer,\n ZEROES = Buffer2.alloc(16, 0);\n function toArray(buf) {\n return [buf.readUInt32BE(0), buf.readUInt32BE(4), buf.readUInt32BE(8), buf.readUInt32BE(12)];\n }\n function fromArray(out) {\n var buf = Buffer2.allocUnsafe(16);\n return (\n buf.writeUInt32BE(out[0] >>> 0, 0),\n buf.writeUInt32BE(out[1] >>> 0, 4),\n buf.writeUInt32BE(out[2] >>> 0, 8),\n buf.writeUInt32BE(out[3] >>> 0, 12),\n buf\n );\n }\n function GHASH(key) {\n (this.h = key), (this.state = Buffer2.alloc(16, 0)), (this.cache = Buffer2.allocUnsafe(0));\n }\n GHASH.prototype.ghash = function (block) {\n for (var i = -1; ++i < block.length; ) this.state[i] ^= block[i];\n this._multiply();\n };\n GHASH.prototype._multiply = function () {\n for (var Vi = toArray(this.h), Zi = [0, 0, 0, 0], j, xi, lsbVi, i = -1; ++i < 128; ) {\n for (\n xi = (this.state[~~(i / 8)] & (1 << (7 - (i % 8)))) !== 0,\n xi && ((Zi[0] ^= Vi[0]), (Zi[1] ^= Vi[1]), (Zi[2] ^= Vi[2]), (Zi[3] ^= Vi[3])),\n lsbVi = (Vi[3] & 1) !== 0,\n j = 3;\n j > 0;\n j--\n )\n Vi[j] = (Vi[j] >>> 1) | ((Vi[j - 1] & 1) << 31);\n (Vi[0] = Vi[0] >>> 1), lsbVi && (Vi[0] = Vi[0] ^ (225 << 24));\n }\n this.state = fromArray(Zi);\n };\n GHASH.prototype.update = function (buf) {\n this.cache = Buffer2.concat([this.cache, buf]);\n for (var chunk; this.cache.length >= 16; )\n (chunk = this.cache.slice(0, 16)), (this.cache = this.cache.slice(16)), this.ghash(chunk);\n };\n GHASH.prototype.final = function (abl, bl) {\n return (\n this.cache.length && this.ghash(Buffer2.concat([this.cache, ZEROES], 16)),\n this.ghash(fromArray([0, abl, 0, bl])),\n this.state\n );\n };\n module.exports = GHASH;\n },\n});\n\n// node_modules/browserify-aes/authCipher.js\nvar require_authCipher = __commonJS({\n \"node_modules/browserify-aes/authCipher.js\"(exports, module) {\n var aes = require_aes(),\n Buffer2 = require_safe_buffer().Buffer,\n Transform = require_cipher_base(),\n inherits = require_inherits_browser(),\n GHASH = require_ghash(),\n xor = require_buffer_xor(),\n incr32 = require_incr32();\n function xorTest(a, b) {\n var out = 0;\n a.length !== b.length && out++;\n for (var len = Math.min(a.length, b.length), i = 0; i < len; ++i) out += a[i] ^ b[i];\n return out;\n }\n function calcIv(self2, iv, ck) {\n if (iv.length === 12)\n return (\n (self2._finID = Buffer2.concat([iv, Buffer2.from([0, 0, 0, 1])])),\n Buffer2.concat([iv, Buffer2.from([0, 0, 0, 2])])\n );\n var ghash = new GHASH(ck),\n len = iv.length,\n toPad = len % 16;\n ghash.update(iv),\n toPad && ((toPad = 16 - toPad), ghash.update(Buffer2.alloc(toPad, 0))),\n ghash.update(Buffer2.alloc(8, 0));\n var ivBits = len * 8,\n tail = Buffer2.alloc(8);\n tail.writeUIntBE(ivBits, 0, 8), ghash.update(tail), (self2._finID = ghash.state);\n var out = Buffer2.from(self2._finID);\n return incr32(out), out;\n }\n function StreamCipher(mode, key, iv, decrypt) {\n Transform.call(this);\n var h = Buffer2.alloc(4, 0);\n this._cipher = new aes.AES(key);\n var ck = this._cipher.encryptBlock(h);\n (this._ghash = new GHASH(ck)),\n (iv = calcIv(this, iv, ck)),\n (this._prev = Buffer2.from(iv)),\n (this._cache = Buffer2.allocUnsafe(0)),\n (this._secCache = Buffer2.allocUnsafe(0)),\n (this._decrypt = decrypt),\n (this._alen = 0),\n (this._len = 0),\n (this._mode = mode),\n (this._authTag = null),\n (this._called = !1);\n }\n inherits(StreamCipher, Transform);\n StreamCipher.prototype._update = function (chunk) {\n if (!this._called && this._alen) {\n var rump = 16 - (this._alen % 16);\n rump < 16 && ((rump = Buffer2.alloc(rump, 0)), this._ghash.update(rump));\n }\n this._called = !0;\n var out = this._mode.encrypt(this, chunk);\n return this._decrypt ? this._ghash.update(chunk) : this._ghash.update(out), (this._len += chunk.length), out;\n };\n StreamCipher.prototype._final = function () {\n if (this._decrypt && !this._authTag) throw new Error(\"Unsupported state or unable to authenticate data\");\n var tag = xor(this._ghash.final(this._alen * 8, this._len * 8), this._cipher.encryptBlock(this._finID));\n if (this._decrypt && xorTest(tag, this._authTag))\n throw new Error(\"Unsupported state or unable to authenticate data\");\n (this._authTag = tag), this._cipher.scrub();\n };\n StreamCipher.prototype.getAuthTag = function () {\n if (this._decrypt || !Buffer2.isBuffer(this._authTag))\n throw new Error(\"Attempting to get auth tag in unsupported state\");\n return this._authTag;\n };\n StreamCipher.prototype.setAuthTag = function (tag) {\n if (!this._decrypt) throw new Error(\"Attempting to set auth tag in unsupported state\");\n this._authTag = tag;\n };\n StreamCipher.prototype.setAAD = function (buf) {\n if (this._called) throw new Error(\"Attempting to set AAD in unsupported state\");\n this._ghash.update(buf), (this._alen += buf.length);\n };\n module.exports = StreamCipher;\n },\n});\n\n// node_modules/browserify-aes/streamCipher.js\nvar require_streamCipher = __commonJS({\n \"node_modules/browserify-aes/streamCipher.js\"(exports, module) {\n var aes = require_aes(),\n Buffer2 = require_safe_buffer().Buffer,\n Transform = require_cipher_base(),\n inherits = require_inherits_browser();\n function StreamCipher(mode, key, iv, decrypt) {\n Transform.call(this),\n (this._cipher = new aes.AES(key)),\n (this._prev = Buffer2.from(iv)),\n (this._cache = Buffer2.allocUnsafe(0)),\n (this._secCache = Buffer2.allocUnsafe(0)),\n (this._decrypt = decrypt),\n (this._mode = mode);\n }\n inherits(StreamCipher, Transform);\n StreamCipher.prototype._update = function (chunk) {\n return this._mode.encrypt(this, chunk, this._decrypt);\n };\n StreamCipher.prototype._final = function () {\n this._cipher.scrub();\n };\n module.exports = StreamCipher;\n },\n});\n\n// node_modules/evp_bytestokey/index.js\nvar require_evp_bytestokey = __commonJS({\n \"node_modules/evp_bytestokey/index.js\"(exports, module) {\n var Buffer2 = require_safe_buffer().Buffer,\n MD5 = require_md5();\n function EVP_BytesToKey(password, salt, keyBits, ivLen) {\n if (\n (Buffer2.isBuffer(password) || (password = Buffer2.from(password, \"binary\")),\n salt && (Buffer2.isBuffer(salt) || (salt = Buffer2.from(salt, \"binary\")), salt.length !== 8))\n )\n throw new RangeError(\"salt should be Buffer with 8 byte length\");\n for (\n var keyLen = keyBits / 8, key = Buffer2.alloc(keyLen), iv = Buffer2.alloc(ivLen || 0), tmp = Buffer2.alloc(0);\n keyLen > 0 || ivLen > 0;\n\n ) {\n var hash = new MD5();\n hash.update(tmp), hash.update(password), salt && hash.update(salt), (tmp = hash.digest());\n var used = 0;\n if (keyLen > 0) {\n var keyStart = key.length - keyLen;\n (used = Math.min(keyLen, tmp.length)), tmp.copy(key, keyStart, 0, used), (keyLen -= used);\n }\n if (used < tmp.length && ivLen > 0) {\n var ivStart = iv.length - ivLen,\n length = Math.min(ivLen, tmp.length - used);\n tmp.copy(iv, ivStart, used, used + length), (ivLen -= length);\n }\n }\n return tmp.fill(0), { key, iv };\n }\n module.exports = EVP_BytesToKey;\n },\n});\n\n// node_modules/browserify-aes/encrypter.js\nvar require_encrypter = __commonJS({\n \"node_modules/browserify-aes/encrypter.js\"(exports) {\n var MODES = require_modes(),\n AuthCipher = require_authCipher(),\n Buffer2 = require_safe_buffer().Buffer,\n StreamCipher = require_streamCipher(),\n Transform = require_cipher_base(),\n aes = require_aes(),\n ebtk = require_evp_bytestokey(),\n inherits = require_inherits_browser();\n function Cipher(mode, key, iv) {\n Transform.call(this),\n (this._cache = new Splitter()),\n (this._cipher = new aes.AES(key)),\n (this._prev = Buffer2.from(iv)),\n (this._mode = mode),\n (this._autopadding = !0);\n }\n inherits(Cipher, Transform);\n Cipher.prototype._update = function (data) {\n this._cache.add(data);\n for (var chunk, thing, out = []; (chunk = this._cache.get()); )\n (thing = this._mode.encrypt(this, chunk)), out.push(thing);\n return Buffer2.concat(out);\n };\n var PADDING = Buffer2.alloc(16, 16);\n Cipher.prototype._final = function () {\n var chunk = this._cache.flush();\n if (this._autopadding) return (chunk = this._mode.encrypt(this, chunk)), this._cipher.scrub(), chunk;\n if (!chunk.equals(PADDING)) throw (this._cipher.scrub(), new Error(\"data not multiple of block length\"));\n };\n Cipher.prototype.setAutoPadding = function (setTo) {\n return (this._autopadding = !!setTo), this;\n };\n function Splitter() {\n this.cache = Buffer2.allocUnsafe(0);\n }\n Splitter.prototype.add = function (data) {\n this.cache = Buffer2.concat([this.cache, data]);\n };\n Splitter.prototype.get = function () {\n if (this.cache.length > 15) {\n var out = this.cache.slice(0, 16);\n return (this.cache = this.cache.slice(16)), out;\n }\n return null;\n };\n Splitter.prototype.flush = function () {\n for (var len = 16 - this.cache.length, padBuff = Buffer2.allocUnsafe(len), i = -1; ++i < len; )\n padBuff.writeUInt8(len, i);\n return Buffer2.concat([this.cache, padBuff]);\n };\n function createCipheriv(suite, password, iv) {\n var config = MODES[suite.toLowerCase()];\n if (!config) throw new TypeError(\"invalid suite type\");\n if ((typeof password == \"string\" && (password = Buffer2.from(password)), password.length !== config.key / 8))\n throw new TypeError(\"invalid key length \" + password.length);\n if ((typeof iv == \"string\" && (iv = Buffer2.from(iv)), config.mode !== \"GCM\" && iv.length !== config.iv))\n throw new TypeError(\"invalid iv length \" + iv.length);\n return config.type === \"stream\"\n ? new StreamCipher(config.module, password, iv)\n : config.type === \"auth\"\n ? new AuthCipher(config.module, password, iv)\n : new Cipher(config.module, password, iv);\n }\n function createCipher(suite, password) {\n var config = MODES[suite.toLowerCase()];\n if (!config) throw new TypeError(\"invalid suite type\");\n var keys = ebtk(password, !1, config.key, config.iv);\n return createCipheriv(suite, keys.key, keys.iv);\n }\n exports.createCipheriv = createCipheriv;\n exports.createCipher = createCipher;\n },\n});\n\n// node_modules/browserify-aes/decrypter.js\nvar require_decrypter = __commonJS({\n \"node_modules/browserify-aes/decrypter.js\"(exports) {\n var AuthCipher = require_authCipher(),\n Buffer2 = require_safe_buffer().Buffer,\n MODES = require_modes(),\n StreamCipher = require_streamCipher(),\n Transform = require_cipher_base(),\n aes = require_aes(),\n ebtk = require_evp_bytestokey(),\n inherits = require_inherits_browser();\n function Decipher(mode, key, iv) {\n Transform.call(this),\n (this._cache = new Splitter()),\n (this._last = void 0),\n (this._cipher = new aes.AES(key)),\n (this._prev = Buffer2.from(iv)),\n (this._mode = mode),\n (this._autopadding = !0);\n }\n inherits(Decipher, Transform);\n Decipher.prototype._update = function (data) {\n this._cache.add(data);\n for (var chunk, thing, out = []; (chunk = this._cache.get(this._autopadding)); )\n (thing = this._mode.decrypt(this, chunk)), out.push(thing);\n return Buffer2.concat(out);\n };\n Decipher.prototype._final = function () {\n var chunk = this._cache.flush();\n if (this._autopadding) return unpad(this._mode.decrypt(this, chunk));\n if (chunk) throw new Error(\"data not multiple of block length\");\n };\n Decipher.prototype.setAutoPadding = function (setTo) {\n return (this._autopadding = !!setTo), this;\n };\n function Splitter() {\n this.cache = Buffer2.allocUnsafe(0);\n }\n Splitter.prototype.add = function (data) {\n this.cache = Buffer2.concat([this.cache, data]);\n };\n Splitter.prototype.get = function (autoPadding) {\n var out;\n if (autoPadding) {\n if (this.cache.length > 16) return (out = this.cache.slice(0, 16)), (this.cache = this.cache.slice(16)), out;\n } else if (this.cache.length >= 16)\n return (out = this.cache.slice(0, 16)), (this.cache = this.cache.slice(16)), out;\n return null;\n };\n Splitter.prototype.flush = function () {\n if (this.cache.length) return this.cache;\n };\n function unpad(last) {\n var padded = last[15];\n if (padded < 1 || padded > 16) throw new Error(\"unable to decrypt data\");\n for (var i = -1; ++i < padded; )\n if (last[i + (16 - padded)] !== padded) throw new Error(\"unable to decrypt data\");\n if (padded !== 16) return last.slice(0, 16 - padded);\n }\n function createDecipheriv(suite, password, iv) {\n var config = MODES[suite.toLowerCase()];\n if (!config) throw new TypeError(\"invalid suite type\");\n if ((typeof iv == \"string\" && (iv = Buffer2.from(iv)), config.mode !== \"GCM\" && iv.length !== config.iv))\n throw new TypeError(\"invalid iv length \" + iv.length);\n if ((typeof password == \"string\" && (password = Buffer2.from(password)), password.length !== config.key / 8))\n throw new TypeError(\"invalid key length \" + password.length);\n return config.type === \"stream\"\n ? new StreamCipher(config.module, password, iv, !0)\n : config.type === \"auth\"\n ? new AuthCipher(config.module, password, iv, !0)\n : new Decipher(config.module, password, iv);\n }\n function createDecipher(suite, password) {\n var config = MODES[suite.toLowerCase()];\n if (!config) throw new TypeError(\"invalid suite type\");\n var keys = ebtk(password, !1, config.key, config.iv);\n return createDecipheriv(suite, keys.key, keys.iv);\n }\n exports.createDecipher = createDecipher;\n exports.createDecipheriv = createDecipheriv;\n },\n});\n\n// node_modules/browserify-aes/browser.js\nvar require_browser5 = __commonJS({\n \"node_modules/browserify-aes/browser.js\"(exports) {\n var ciphers = require_encrypter(),\n deciphers = require_decrypter(),\n modes = require_list();\n function getCiphers() {\n return Object.keys(modes);\n }\n exports.createCipher = exports.Cipher = ciphers.createCipher;\n exports.createCipheriv = exports.Cipheriv = ciphers.createCipheriv;\n exports.createDecipher = exports.Decipher = deciphers.createDecipher;\n exports.createDecipheriv = exports.Decipheriv = deciphers.createDecipheriv;\n exports.listCiphers = exports.getCiphers = getCiphers;\n },\n});\n\n// node_modules/browserify-des/modes.js\nvar require_modes2 = __commonJS({\n \"node_modules/browserify-des/modes.js\"(exports) {\n exports[\"des-ecb\"] = {\n key: 8,\n iv: 0,\n };\n exports[\"des-cbc\"] = exports.des = {\n key: 8,\n iv: 8,\n };\n exports[\"des-ede3-cbc\"] = exports.des3 = {\n key: 24,\n iv: 8,\n };\n exports[\"des-ede3\"] = {\n key: 24,\n iv: 0,\n };\n exports[\"des-ede-cbc\"] = {\n key: 16,\n iv: 8,\n };\n exports[\"des-ede\"] = {\n key: 16,\n iv: 0,\n };\n },\n});\n\n// node_modules/browserify-cipher/browser.js\nvar require_browser6 = __commonJS({\n \"node_modules/browserify-cipher/browser.js\"(exports) {\n var DES = require_browserify_des(),\n aes = require_browser5(),\n aesModes = require_modes(),\n desModes = require_modes2(),\n ebtk = require_evp_bytestokey();\n function createCipher(suite, password) {\n suite = suite.toLowerCase();\n var keyLen, ivLen;\n if (aesModes[suite]) (keyLen = aesModes[suite].key), (ivLen = aesModes[suite].iv);\n else if (desModes[suite]) (keyLen = desModes[suite].key * 8), (ivLen = desModes[suite].iv);\n else throw new TypeError(\"invalid suite type\");\n var keys = ebtk(password, !1, keyLen, ivLen);\n return createCipheriv(suite, keys.key, keys.iv);\n }\n function createDecipher(suite, password) {\n suite = suite.toLowerCase();\n var keyLen, ivLen;\n if (aesModes[suite]) (keyLen = aesModes[suite].key), (ivLen = aesModes[suite].iv);\n else if (desModes[suite]) (keyLen = desModes[suite].key * 8), (ivLen = desModes[suite].iv);\n else throw new TypeError(\"invalid suite type\");\n var keys = ebtk(password, !1, keyLen, ivLen);\n return createDecipheriv(suite, keys.key, keys.iv);\n }\n function createCipheriv(suite, key, iv) {\n if (((suite = suite.toLowerCase()), aesModes[suite])) return aes.createCipheriv(suite, key, iv);\n if (desModes[suite]) return new DES({ key, iv, mode: suite });\n throw new TypeError(\"invalid suite type\");\n }\n function createDecipheriv(suite, key, iv) {\n if (((suite = suite.toLowerCase()), aesModes[suite])) return aes.createDecipheriv(suite, key, iv);\n if (desModes[suite]) return new DES({ key, iv, mode: suite, decrypt: !0 });\n throw new TypeError(\"invalid suite type\");\n }\n function getCiphers() {\n return Object.keys(desModes).concat(aes.getCiphers());\n }\n exports.createCipher = exports.Cipher = createCipher;\n exports.createCipheriv = exports.Cipheriv = createCipheriv;\n exports.createDecipher = exports.Decipher = createDecipher;\n exports.createDecipheriv = exports.Decipheriv = createDecipheriv;\n exports.listCiphers = exports.getCiphers = getCiphers;\n },\n});\n\n// node_modules/diffie-hellman/node_modules/bn.js/lib/bn.js\nvar require_bn = __commonJS({\n \"node_modules/diffie-hellman/node_modules/bn.js/lib/bn.js\"(exports, module) {\n (function (module2, exports2) {\n \"use strict\";\n function assert(val, msg) {\n if (!val) throw new Error(msg || \"Assertion failed\");\n }\n function inherits(ctor, superCtor) {\n ctor.super_ = superCtor;\n var TempCtor = function () {};\n (TempCtor.prototype = superCtor.prototype),\n (ctor.prototype = new TempCtor()),\n (ctor.prototype.constructor = ctor);\n }\n function BN(number, base, endian) {\n if (BN.isBN(number)) return number;\n (this.negative = 0),\n (this.words = null),\n (this.length = 0),\n (this.red = null),\n number !== null &&\n ((base === \"le\" || base === \"be\") && ((endian = base), (base = 10)),\n this._init(number || 0, base || 10, endian || \"be\"));\n }\n typeof module2 == \"object\" ? (module2.exports = BN) : (exports2.BN = BN), (BN.BN = BN), (BN.wordSize = 26);\n var Buffer2;\n try {\n typeof window < \"u\" && typeof window.Buffer < \"u\"\n ? (Buffer2 = window.Buffer)\n : (Buffer2 = __require(\"buffer\").Buffer);\n } catch {}\n (BN.isBN = function (num) {\n return num instanceof BN\n ? !0\n : num !== null &&\n typeof num == \"object\" &&\n num.constructor.wordSize === BN.wordSize &&\n Array.isArray(num.words);\n }),\n (BN.max = function (left, right) {\n return left.cmp(right) > 0 ? left : right;\n }),\n (BN.min = function (left, right) {\n return left.cmp(right) < 0 ? left : right;\n }),\n (BN.prototype._init = function (number, base, endian) {\n if (typeof number == \"number\") return this._initNumber(number, base, endian);\n if (typeof number == \"object\") return this._initArray(number, base, endian);\n base === \"hex\" && (base = 16),\n assert(base === (base | 0) && base >= 2 && base <= 36),\n (number = number.toString().replace(/\\s+/g, \"\"));\n var start = 0;\n number[0] === \"-\" && (start++, (this.negative = 1)),\n start < number.length &&\n (base === 16\n ? this._parseHex(number, start, endian)\n : (this._parseBase(number, base, start),\n endian === \"le\" && this._initArray(this.toArray(), base, endian)));\n }),\n (BN.prototype._initNumber = function (number, base, endian) {\n number < 0 && ((this.negative = 1), (number = -number)),\n number < 67108864\n ? ((this.words = [number & 67108863]), (this.length = 1))\n : number < 4503599627370496\n ? ((this.words = [number & 67108863, (number / 67108864) & 67108863]), (this.length = 2))\n : (assert(number < 9007199254740992),\n (this.words = [number & 67108863, (number / 67108864) & 67108863, 1]),\n (this.length = 3)),\n endian === \"le\" && this._initArray(this.toArray(), base, endian);\n }),\n (BN.prototype._initArray = function (number, base, endian) {\n if ((assert(typeof number.length == \"number\"), number.length <= 0))\n return (this.words = [0]), (this.length = 1), this;\n (this.length = Math.ceil(number.length / 3)), (this.words = new Array(this.length));\n for (var i = 0; i < this.length; i++) this.words[i] = 0;\n var j,\n w,\n off = 0;\n if (endian === \"be\")\n for (i = number.length - 1, j = 0; i >= 0; i -= 3)\n (w = number[i] | (number[i - 1] << 8) | (number[i - 2] << 16)),\n (this.words[j] |= (w << off) & 67108863),\n (this.words[j + 1] = (w >>> (26 - off)) & 67108863),\n (off += 24),\n off >= 26 && ((off -= 26), j++);\n else if (endian === \"le\")\n for (i = 0, j = 0; i < number.length; i += 3)\n (w = number[i] | (number[i + 1] << 8) | (number[i + 2] << 16)),\n (this.words[j] |= (w << off) & 67108863),\n (this.words[j + 1] = (w >>> (26 - off)) & 67108863),\n (off += 24),\n off >= 26 && ((off -= 26), j++);\n return this.strip();\n });\n function parseHex4Bits(string, index) {\n var c = string.charCodeAt(index);\n return c >= 65 && c <= 70 ? c - 55 : c >= 97 && c <= 102 ? c - 87 : (c - 48) & 15;\n }\n function parseHexByte(string, lowerBound, index) {\n var r = parseHex4Bits(string, index);\n return index - 1 >= lowerBound && (r |= parseHex4Bits(string, index - 1) << 4), r;\n }\n BN.prototype._parseHex = function (number, start, endian) {\n (this.length = Math.ceil((number.length - start) / 6)), (this.words = new Array(this.length));\n for (var i = 0; i < this.length; i++) this.words[i] = 0;\n var off = 0,\n j = 0,\n w;\n if (endian === \"be\")\n for (i = number.length - 1; i >= start; i -= 2)\n (w = parseHexByte(number, start, i) << off),\n (this.words[j] |= w & 67108863),\n off >= 18 ? ((off -= 18), (j += 1), (this.words[j] |= w >>> 26)) : (off += 8);\n else {\n var parseLength = number.length - start;\n for (i = parseLength % 2 === 0 ? start + 1 : start; i < number.length; i += 2)\n (w = parseHexByte(number, start, i) << off),\n (this.words[j] |= w & 67108863),\n off >= 18 ? ((off -= 18), (j += 1), (this.words[j] |= w >>> 26)) : (off += 8);\n }\n this.strip();\n };\n function parseBase(str, start, end, mul) {\n for (var r = 0, len = Math.min(str.length, end), i = start; i < len; i++) {\n var c = str.charCodeAt(i) - 48;\n (r *= mul), c >= 49 ? (r += c - 49 + 10) : c >= 17 ? (r += c - 17 + 10) : (r += c);\n }\n return r;\n }\n (BN.prototype._parseBase = function (number, base, start) {\n (this.words = [0]), (this.length = 1);\n for (var limbLen = 0, limbPow = 1; limbPow <= 67108863; limbPow *= base) limbLen++;\n limbLen--, (limbPow = (limbPow / base) | 0);\n for (\n var total = number.length - start,\n mod = total % limbLen,\n end = Math.min(total, total - mod) + start,\n word = 0,\n i = start;\n i < end;\n i += limbLen\n )\n (word = parseBase(number, i, i + limbLen, base)),\n this.imuln(limbPow),\n this.words[0] + word < 67108864 ? (this.words[0] += word) : this._iaddn(word);\n if (mod !== 0) {\n var pow = 1;\n for (word = parseBase(number, i, number.length, base), i = 0; i < mod; i++) pow *= base;\n this.imuln(pow), this.words[0] + word < 67108864 ? (this.words[0] += word) : this._iaddn(word);\n }\n this.strip();\n }),\n (BN.prototype.copy = function (dest) {\n dest.words = new Array(this.length);\n for (var i = 0; i < this.length; i++) dest.words[i] = this.words[i];\n (dest.length = this.length), (dest.negative = this.negative), (dest.red = this.red);\n }),\n (BN.prototype.clone = function () {\n var r = new BN(null);\n return this.copy(r), r;\n }),\n (BN.prototype._expand = function (size) {\n for (; this.length < size; ) this.words[this.length++] = 0;\n return this;\n }),\n (BN.prototype.strip = function () {\n for (; this.length > 1 && this.words[this.length - 1] === 0; ) this.length--;\n return this._normSign();\n }),\n (BN.prototype._normSign = function () {\n return this.length === 1 && this.words[0] === 0 && (this.negative = 0), this;\n }),\n (BN.prototype.inspect = function () {\n return (this.red ? \"<BN-R: \" : \"<BN: \") + this.toString(16) + \">\";\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 groupSizes = [\n 0, 0, 25, 16, 12, 11, 10, 9, 8, 8, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5,\n 5, 5,\n ],\n groupBases = [\n 0, 0, 33554432, 43046721, 16777216, 48828125, 60466176, 40353607, 16777216, 43046721, 1e7, 19487171, 35831808,\n 62748517, 7529536, 11390625, 16777216, 24137569, 34012224, 47045881, 64e6, 4084101, 5153632, 6436343, 7962624,\n 9765625, 11881376, 14348907, 17210368, 20511149, 243e5, 28629151, 33554432, 39135393, 45435424, 52521875,\n 60466176,\n ];\n (BN.prototype.toString = function (base, padding) {\n (base = base || 10), (padding = padding | 0 || 1);\n var out;\n if (base === 16 || base === \"hex\") {\n out = \"\";\n for (var off = 0, carry = 0, i = 0; i < this.length; i++) {\n var w = this.words[i],\n word = (((w << off) | carry) & 16777215).toString(16);\n (carry = (w >>> (24 - off)) & 16777215),\n carry !== 0 || i !== this.length - 1 ? (out = zeros[6 - word.length] + word + out) : (out = word + out),\n (off += 2),\n off >= 26 && ((off -= 26), i--);\n }\n for (carry !== 0 && (out = carry.toString(16) + out); out.length % padding !== 0; ) out = \"0\" + out;\n return this.negative !== 0 && (out = \"-\" + out), out;\n }\n if (base === (base | 0) && base >= 2 && base <= 36) {\n var groupSize = groupSizes[base],\n groupBase = groupBases[base];\n out = \"\";\n var c = this.clone();\n for (c.negative = 0; !c.isZero(); ) {\n var r = c.modn(groupBase).toString(base);\n (c = c.idivn(groupBase)), c.isZero() ? (out = r + out) : (out = zeros[groupSize - r.length] + r + out);\n }\n for (this.isZero() && (out = \"0\" + out); out.length % padding !== 0; ) out = \"0\" + out;\n return this.negative !== 0 && (out = \"-\" + out), out;\n }\n assert(!1, \"Base should be between 2 and 36\");\n }),\n (BN.prototype.toNumber = function () {\n var ret = this.words[0];\n return (\n this.length === 2\n ? (ret += this.words[1] * 67108864)\n : this.length === 3 && this.words[2] === 1\n ? (ret += 4503599627370496 + this.words[1] * 67108864)\n : this.length > 2 && assert(!1, \"Number can only safely store up to 53 bits\"),\n this.negative !== 0 ? -ret : ret\n );\n }),\n (BN.prototype.toJSON = function () {\n return this.toString(16);\n }),\n (BN.prototype.toBuffer = function (endian, length) {\n return assert(typeof Buffer2 < \"u\"), this.toArrayLike(Buffer2, endian, length);\n }),\n (BN.prototype.toArray = function (endian, length) {\n return this.toArrayLike(Array, endian, length);\n }),\n (BN.prototype.toArrayLike = function (ArrayType, endian, length) {\n var byteLength = this.byteLength(),\n 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 this.strip();\n var littleEndian = endian === \"le\",\n res = new ArrayType(reqLength),\n b,\n i,\n q = this.clone();\n if (littleEndian) {\n for (i = 0; !q.isZero(); i++) (b = q.andln(255)), q.iushrn(8), (res[i] = b);\n for (; i < reqLength; i++) res[i] = 0;\n } else {\n for (i = 0; i < reqLength - byteLength; i++) res[i] = 0;\n for (i = 0; !q.isZero(); i++) (b = q.andln(255)), q.iushrn(8), (res[reqLength - i - 1] = b);\n }\n return res;\n }),\n Math.clz32\n ? (BN.prototype._countBits = function (w) {\n return 32 - Math.clz32(w);\n })\n : (BN.prototype._countBits = function (w) {\n var t = w,\n r = 0;\n return (\n t >= 4096 && ((r += 13), (t >>>= 13)),\n t >= 64 && ((r += 7), (t >>>= 7)),\n t >= 8 && ((r += 4), (t >>>= 4)),\n t >= 2 && ((r += 2), (t >>>= 2)),\n r + t\n );\n }),\n (BN.prototype._zeroBits = function (w) {\n if (w === 0) return 26;\n var t = w,\n r = 0;\n return (\n (t & 8191) === 0 && ((r += 13), (t >>>= 13)),\n (t & 127) === 0 && ((r += 7), (t >>>= 7)),\n (t & 15) === 0 && ((r += 4), (t >>>= 4)),\n (t & 3) === 0 && ((r += 2), (t >>>= 2)),\n (t & 1) === 0 && r++,\n r\n );\n }),\n (BN.prototype.bitLength = function () {\n var w = this.words[this.length - 1],\n hi = this._countBits(w);\n return (this.length - 1) * 26 + hi;\n });\n function toBitArray(num) {\n for (var w = new Array(num.bitLength()), bit = 0; bit < w.length; bit++) {\n var off = (bit / 26) | 0,\n wbit = bit % 26;\n w[bit] = (num.words[off] & (1 << wbit)) >>> wbit;\n }\n return w;\n }\n (BN.prototype.zeroBits = function () {\n if (this.isZero()) return 0;\n for (var r = 0, i = 0; i < this.length; i++) {\n var b = this._zeroBits(this.words[i]);\n if (((r += b), b !== 26)) break;\n }\n return r;\n }),\n (BN.prototype.byteLength = function () {\n return Math.ceil(this.bitLength() / 8);\n }),\n (BN.prototype.toTwos = function (width) {\n return this.negative !== 0 ? this.abs().inotn(width).iaddn(1) : this.clone();\n }),\n (BN.prototype.fromTwos = function (width) {\n return this.testn(width - 1) ? this.notn(width).iaddn(1).ineg() : this.clone();\n }),\n (BN.prototype.isNeg = function () {\n return this.negative !== 0;\n }),\n (BN.prototype.neg = function () {\n return this.clone().ineg();\n }),\n (BN.prototype.ineg = function () {\n return this.isZero() || (this.negative ^= 1), this;\n }),\n (BN.prototype.iuor = function (num) {\n for (; this.length < num.length; ) this.words[this.length++] = 0;\n for (var i = 0; i < num.length; i++) this.words[i] = this.words[i] | num.words[i];\n return this.strip();\n }),\n (BN.prototype.ior = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuor(num);\n }),\n (BN.prototype.or = function (num) {\n return this.length > num.length ? this.clone().ior(num) : num.clone().ior(this);\n }),\n (BN.prototype.uor = function (num) {\n return this.length > num.length ? this.clone().iuor(num) : num.clone().iuor(this);\n }),\n (BN.prototype.iuand = function (num) {\n var b;\n this.length > num.length ? (b = num) : (b = this);\n for (var i = 0; i < b.length; i++) this.words[i] = this.words[i] & num.words[i];\n return (this.length = b.length), this.strip();\n }),\n (BN.prototype.iand = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuand(num);\n }),\n (BN.prototype.and = function (num) {\n return this.length > num.length ? this.clone().iand(num) : num.clone().iand(this);\n }),\n (BN.prototype.uand = function (num) {\n return this.length > num.length ? this.clone().iuand(num) : num.clone().iuand(this);\n }),\n (BN.prototype.iuxor = function (num) {\n var a, b;\n this.length > num.length ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var i = 0; i < b.length; i++) this.words[i] = a.words[i] ^ b.words[i];\n if (this !== a) for (; i < a.length; i++) this.words[i] = a.words[i];\n return (this.length = a.length), this.strip();\n }),\n (BN.prototype.ixor = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuxor(num);\n }),\n (BN.prototype.xor = function (num) {\n return this.length > num.length ? this.clone().ixor(num) : num.clone().ixor(this);\n }),\n (BN.prototype.uxor = function (num) {\n return this.length > num.length ? this.clone().iuxor(num) : num.clone().iuxor(this);\n }),\n (BN.prototype.inotn = function (width) {\n assert(typeof width == \"number\" && width >= 0);\n var bytesNeeded = Math.ceil(width / 26) | 0,\n bitsLeft = width % 26;\n this._expand(bytesNeeded), bitsLeft > 0 && bytesNeeded--;\n for (var i = 0; i < bytesNeeded; i++) this.words[i] = ~this.words[i] & 67108863;\n return bitsLeft > 0 && (this.words[i] = ~this.words[i] & (67108863 >> (26 - bitsLeft))), this.strip();\n }),\n (BN.prototype.notn = function (width) {\n return this.clone().inotn(width);\n }),\n (BN.prototype.setn = function (bit, val) {\n assert(typeof bit == \"number\" && bit >= 0);\n var off = (bit / 26) | 0,\n wbit = bit % 26;\n return (\n this._expand(off + 1),\n val\n ? (this.words[off] = this.words[off] | (1 << wbit))\n : (this.words[off] = this.words[off] & ~(1 << wbit)),\n this.strip()\n );\n }),\n (BN.prototype.iadd = function (num) {\n var r;\n if (this.negative !== 0 && num.negative === 0)\n return (this.negative = 0), (r = this.isub(num)), (this.negative ^= 1), this._normSign();\n if (this.negative === 0 && num.negative !== 0)\n return (num.negative = 0), (r = this.isub(num)), (num.negative = 1), r._normSign();\n var a, b;\n this.length > num.length ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var carry = 0, i = 0; i < b.length; i++)\n (r = (a.words[i] | 0) + (b.words[i] | 0) + carry), (this.words[i] = r & 67108863), (carry = r >>> 26);\n for (; carry !== 0 && i < a.length; i++)\n (r = (a.words[i] | 0) + carry), (this.words[i] = r & 67108863), (carry = r >>> 26);\n if (((this.length = a.length), carry !== 0)) (this.words[this.length] = carry), this.length++;\n else if (a !== this) for (; i < a.length; i++) this.words[i] = a.words[i];\n return this;\n }),\n (BN.prototype.add = function (num) {\n var res;\n return num.negative !== 0 && this.negative === 0\n ? ((num.negative = 0), (res = this.sub(num)), (num.negative ^= 1), res)\n : num.negative === 0 && this.negative !== 0\n ? ((this.negative = 0), (res = num.sub(this)), (this.negative = 1), res)\n : this.length > num.length\n ? this.clone().iadd(num)\n : num.clone().iadd(this);\n }),\n (BN.prototype.isub = function (num) {\n if (num.negative !== 0) {\n num.negative = 0;\n var r = this.iadd(num);\n return (num.negative = 1), r._normSign();\n } else if (this.negative !== 0)\n return (this.negative = 0), this.iadd(num), (this.negative = 1), this._normSign();\n var cmp = this.cmp(num);\n if (cmp === 0) return (this.negative = 0), (this.length = 1), (this.words[0] = 0), this;\n var a, b;\n cmp > 0 ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var carry = 0, i = 0; i < b.length; i++)\n (r = (a.words[i] | 0) - (b.words[i] | 0) + carry), (carry = r >> 26), (this.words[i] = r & 67108863);\n for (; carry !== 0 && i < a.length; i++)\n (r = (a.words[i] | 0) + carry), (carry = r >> 26), (this.words[i] = r & 67108863);\n if (carry === 0 && i < a.length && a !== this) for (; i < a.length; i++) this.words[i] = a.words[i];\n return (this.length = Math.max(this.length, i)), a !== this && (this.negative = 1), this.strip();\n }),\n (BN.prototype.sub = function (num) {\n return this.clone().isub(num);\n });\n function smallMulTo(self2, num, out) {\n out.negative = num.negative ^ self2.negative;\n var len = (self2.length + num.length) | 0;\n (out.length = len), (len = (len - 1) | 0);\n var a = self2.words[0] | 0,\n b = num.words[0] | 0,\n r = a * b,\n lo = r & 67108863,\n carry = (r / 67108864) | 0;\n out.words[0] = lo;\n for (var k = 1; k < len; k++) {\n for (\n var ncarry = carry >>> 26,\n rword = carry & 67108863,\n maxJ = Math.min(k, num.length - 1),\n j = Math.max(0, k - self2.length + 1);\n j <= maxJ;\n j++\n ) {\n var i = (k - j) | 0;\n (a = self2.words[i] | 0),\n (b = num.words[j] | 0),\n (r = a * b + rword),\n (ncarry += (r / 67108864) | 0),\n (rword = r & 67108863);\n }\n (out.words[k] = rword | 0), (carry = ncarry | 0);\n }\n return carry !== 0 ? (out.words[k] = carry | 0) : out.length--, out.strip();\n }\n var comb10MulTo = function (self2, num, out) {\n var a = self2.words,\n b = num.words,\n o = out.words,\n c = 0,\n lo,\n mid,\n hi,\n a0 = a[0] | 0,\n al0 = a0 & 8191,\n ah0 = a0 >>> 13,\n a1 = a[1] | 0,\n al1 = a1 & 8191,\n ah1 = a1 >>> 13,\n a2 = a[2] | 0,\n al2 = a2 & 8191,\n ah2 = a2 >>> 13,\n a3 = a[3] | 0,\n al3 = a3 & 8191,\n ah3 = a3 >>> 13,\n a4 = a[4] | 0,\n al4 = a4 & 8191,\n ah4 = a4 >>> 13,\n a5 = a[5] | 0,\n al5 = a5 & 8191,\n ah5 = a5 >>> 13,\n a6 = a[6] | 0,\n al6 = a6 & 8191,\n ah6 = a6 >>> 13,\n a7 = a[7] | 0,\n al7 = a7 & 8191,\n ah7 = a7 >>> 13,\n a8 = a[8] | 0,\n al8 = a8 & 8191,\n ah8 = a8 >>> 13,\n a9 = a[9] | 0,\n al9 = a9 & 8191,\n ah9 = a9 >>> 13,\n b0 = b[0] | 0,\n bl0 = b0 & 8191,\n bh0 = b0 >>> 13,\n b1 = b[1] | 0,\n bl1 = b1 & 8191,\n bh1 = b1 >>> 13,\n b2 = b[2] | 0,\n bl2 = b2 & 8191,\n bh2 = b2 >>> 13,\n b3 = b[3] | 0,\n bl3 = b3 & 8191,\n bh3 = b3 >>> 13,\n b4 = b[4] | 0,\n bl4 = b4 & 8191,\n bh4 = b4 >>> 13,\n b5 = b[5] | 0,\n bl5 = b5 & 8191,\n bh5 = b5 >>> 13,\n b6 = b[6] | 0,\n bl6 = b6 & 8191,\n bh6 = b6 >>> 13,\n b7 = b[7] | 0,\n bl7 = b7 & 8191,\n bh7 = b7 >>> 13,\n b8 = b[8] | 0,\n bl8 = b8 & 8191,\n bh8 = b8 >>> 13,\n b9 = b[9] | 0,\n bl9 = b9 & 8191,\n bh9 = b9 >>> 13;\n (out.negative = self2.negative ^ num.negative),\n (out.length = 19),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w0 >>> 26)) | 0),\n (w0 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w1 >>> 26)) | 0),\n (w1 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w2 >>> 26)) | 0),\n (w2 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w3 >>> 26)) | 0),\n (w3 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w4 >>> 26)) | 0),\n (w4 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w5 >>> 26)) | 0),\n (w5 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w6 >>> 26)) | 0),\n (w6 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w7 >>> 26)) | 0),\n (w7 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w8 >>> 26)) | 0),\n (w8 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w9 >>> 26)) | 0),\n (w9 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w10 >>> 26)) | 0),\n (w10 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w11 >>> 26)) | 0),\n (w11 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w12 >>> 26)) | 0),\n (w12 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w13 >>> 26)) | 0),\n (w13 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w14 >>> 26)) | 0),\n (w14 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w15 >>> 26)) | 0),\n (w15 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w16 >>> 26)) | 0),\n (w16 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w17 >>> 26)) | 0),\n (w17 &= 67108863),\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 & 8191) << 13)) | 0;\n return (\n (c = (((hi + (mid >>> 13)) | 0) + (w18 >>> 26)) | 0),\n (w18 &= 67108863),\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 c !== 0 && ((o[19] = c), out.length++),\n out\n );\n };\n Math.imul || (comb10MulTo = smallMulTo);\n function bigMulTo(self2, num, out) {\n (out.negative = num.negative ^ self2.negative), (out.length = self2.length + num.length);\n for (var carry = 0, hncarry = 0, k = 0; k < out.length - 1; k++) {\n var ncarry = hncarry;\n hncarry = 0;\n for (\n var rword = carry & 67108863, maxJ = Math.min(k, num.length - 1), j = Math.max(0, k - self2.length + 1);\n j <= maxJ;\n j++\n ) {\n var i = k - j,\n a = self2.words[i] | 0,\n b = num.words[j] | 0,\n r = a * b,\n lo = r & 67108863;\n (ncarry = (ncarry + ((r / 67108864) | 0)) | 0),\n (lo = (lo + rword) | 0),\n (rword = lo & 67108863),\n (ncarry = (ncarry + (lo >>> 26)) | 0),\n (hncarry += ncarry >>> 26),\n (ncarry &= 67108863);\n }\n (out.words[k] = rword), (carry = ncarry), (ncarry = hncarry);\n }\n return carry !== 0 ? (out.words[k] = carry) : out.length--, out.strip();\n }\n function jumboMulTo(self2, num, out) {\n var fftm = new FFTM();\n return fftm.mulp(self2, num, out);\n }\n BN.prototype.mulTo = function (num, out) {\n var res,\n len = this.length + num.length;\n return (\n this.length === 10 && num.length === 10\n ? (res = comb10MulTo(this, num, out))\n : len < 63\n ? (res = smallMulTo(this, num, out))\n : len < 1024\n ? (res = bigMulTo(this, num, out))\n : (res = jumboMulTo(this, num, out)),\n res\n );\n };\n function FFTM(x, y) {\n (this.x = x), (this.y = y);\n }\n (FFTM.prototype.makeRBT = function (N) {\n for (var t = new Array(N), l = BN.prototype._countBits(N) - 1, i = 0; i < N; i++) t[i] = this.revBin(i, l, N);\n return t;\n }),\n (FFTM.prototype.revBin = function (x, l, N) {\n if (x === 0 || x === N - 1) return x;\n for (var rb = 0, i = 0; i < l; i++) (rb |= (x & 1) << (l - i - 1)), (x >>= 1);\n return rb;\n }),\n (FFTM.prototype.permute = function (rbt, rws, iws, rtws, itws, N) {\n for (var i = 0; i < N; i++) (rtws[i] = rws[rbt[i]]), (itws[i] = iws[rbt[i]]);\n }),\n (FFTM.prototype.transform = function (rws, iws, rtws, itws, N, rbt) {\n this.permute(rbt, rws, iws, rtws, itws, N);\n for (var s = 1; s < N; s <<= 1)\n for (\n var l = s << 1, rtwdf = Math.cos((2 * Math.PI) / l), itwdf = Math.sin((2 * Math.PI) / l), p = 0;\n p < N;\n p += l\n )\n for (var rtwdf_ = rtwdf, itwdf_ = itwdf, j = 0; j < s; j++) {\n var re = rtws[p + j],\n ie = itws[p + j],\n ro = rtws[p + j + s],\n io = itws[p + j + s],\n rx = rtwdf_ * ro - itwdf_ * io;\n (io = rtwdf_ * io + itwdf_ * ro),\n (ro = rx),\n (rtws[p + j] = re + ro),\n (itws[p + j] = ie + io),\n (rtws[p + j + s] = re - ro),\n (itws[p + j + s] = ie - io),\n j !== l &&\n ((rx = rtwdf * rtwdf_ - itwdf * itwdf_), (itwdf_ = rtwdf * itwdf_ + itwdf * rtwdf_), (rtwdf_ = rx));\n }\n }),\n (FFTM.prototype.guessLen13b = function (n, m) {\n var N = Math.max(m, n) | 1,\n odd = N & 1,\n i = 0;\n for (N = (N / 2) | 0; N; N = N >>> 1) i++;\n return 1 << (i + 1 + odd);\n }),\n (FFTM.prototype.conjugate = function (rws, iws, N) {\n if (!(N <= 1))\n for (var i = 0; i < N / 2; i++) {\n var t = rws[i];\n (rws[i] = rws[N - i - 1]),\n (rws[N - i - 1] = t),\n (t = iws[i]),\n (iws[i] = -iws[N - i - 1]),\n (iws[N - i - 1] = -t);\n }\n }),\n (FFTM.prototype.normalize13b = function (ws, N) {\n for (var carry = 0, i = 0; i < N / 2; i++) {\n var w = Math.round(ws[2 * i + 1] / N) * 8192 + Math.round(ws[2 * i] / N) + carry;\n (ws[i] = w & 67108863), w < 67108864 ? (carry = 0) : (carry = (w / 67108864) | 0);\n }\n return ws;\n }),\n (FFTM.prototype.convert13b = function (ws, len, rws, N) {\n for (var carry = 0, i = 0; i < len; i++)\n (carry = carry + (ws[i] | 0)),\n (rws[2 * i] = carry & 8191),\n (carry = carry >>> 13),\n (rws[2 * i + 1] = carry & 8191),\n (carry = carry >>> 13);\n for (i = 2 * len; i < N; ++i) rws[i] = 0;\n assert(carry === 0), assert((carry & -8192) === 0);\n }),\n (FFTM.prototype.stub = function (N) {\n for (var ph = new Array(N), i = 0; i < N; i++) ph[i] = 0;\n return ph;\n }),\n (FFTM.prototype.mulp = function (x, y, out) {\n var N = 2 * this.guessLen13b(x.length, y.length),\n rbt = this.makeRBT(N),\n _ = this.stub(N),\n rws = new Array(N),\n rwst = new Array(N),\n iwst = new Array(N),\n nrws = new Array(N),\n nrwst = new Array(N),\n niwst = new Array(N),\n rmws = out.words;\n (rmws.length = N),\n this.convert13b(x.words, x.length, rws, N),\n this.convert13b(y.words, y.length, nrws, N),\n this.transform(rws, _, rwst, iwst, N, rbt),\n this.transform(nrws, _, nrwst, niwst, N, rbt);\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]), (rwst[i] = rx);\n }\n return (\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 (out.negative = x.negative ^ y.negative),\n (out.length = x.length + y.length),\n out.strip()\n );\n }),\n (BN.prototype.mul = function (num) {\n var out = new BN(null);\n return (out.words = new Array(this.length + num.length)), this.mulTo(num, out);\n }),\n (BN.prototype.mulf = function (num) {\n var out = new BN(null);\n return (out.words = new Array(this.length + num.length)), jumboMulTo(this, num, out);\n }),\n (BN.prototype.imul = function (num) {\n return this.clone().mulTo(num, this);\n }),\n (BN.prototype.imuln = function (num) {\n assert(typeof num == \"number\"), assert(num < 67108864);\n for (var carry = 0, i = 0; i < this.length; i++) {\n var w = (this.words[i] | 0) * num,\n lo = (w & 67108863) + (carry & 67108863);\n (carry >>= 26), (carry += (w / 67108864) | 0), (carry += lo >>> 26), (this.words[i] = lo & 67108863);\n }\n return carry !== 0 && ((this.words[i] = carry), this.length++), this;\n }),\n (BN.prototype.muln = function (num) {\n return this.clone().imuln(num);\n }),\n (BN.prototype.sqr = function () {\n return this.mul(this);\n }),\n (BN.prototype.isqr = function () {\n return this.imul(this.clone());\n }),\n (BN.prototype.pow = function (num) {\n var w = toBitArray(num);\n if (w.length === 0) return new BN(1);\n for (var res = this, i = 0; i < w.length && w[i] === 0; i++, res = res.sqr());\n if (++i < w.length) for (var q = res.sqr(); i < w.length; i++, q = q.sqr()) w[i] !== 0 && (res = res.mul(q));\n return res;\n }),\n (BN.prototype.iushln = function (bits) {\n assert(typeof bits == \"number\" && bits >= 0);\n var r = bits % 26,\n s = (bits - r) / 26,\n carryMask = (67108863 >>> (26 - r)) << (26 - r),\n i;\n if (r !== 0) {\n var carry = 0;\n for (i = 0; i < this.length; i++) {\n var newCarry = this.words[i] & carryMask,\n c = ((this.words[i] | 0) - newCarry) << r;\n (this.words[i] = c | carry), (carry = newCarry >>> (26 - r));\n }\n carry && ((this.words[i] = carry), this.length++);\n }\n if (s !== 0) {\n for (i = this.length - 1; i >= 0; i--) this.words[i + s] = this.words[i];\n for (i = 0; i < s; i++) this.words[i] = 0;\n this.length += s;\n }\n return this.strip();\n }),\n (BN.prototype.ishln = function (bits) {\n return assert(this.negative === 0), this.iushln(bits);\n }),\n (BN.prototype.iushrn = function (bits, hint, extended) {\n assert(typeof bits == \"number\" && bits >= 0);\n var h;\n hint ? (h = (hint - (hint % 26)) / 26) : (h = 0);\n var r = bits % 26,\n s = Math.min((bits - r) / 26, this.length),\n mask = 67108863 ^ ((67108863 >>> r) << r),\n maskedWords = extended;\n if (((h -= s), (h = Math.max(0, h)), maskedWords)) {\n for (var i = 0; i < s; i++) maskedWords.words[i] = this.words[i];\n maskedWords.length = s;\n }\n if (s !== 0)\n if (this.length > s) for (this.length -= s, i = 0; i < this.length; i++) this.words[i] = this.words[i + s];\n else (this.words[0] = 0), (this.length = 1);\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)), (carry = word & mask);\n }\n return (\n maskedWords && carry !== 0 && (maskedWords.words[maskedWords.length++] = carry),\n this.length === 0 && ((this.words[0] = 0), (this.length = 1)),\n this.strip()\n );\n }),\n (BN.prototype.ishrn = function (bits, hint, extended) {\n return assert(this.negative === 0), this.iushrn(bits, hint, extended);\n }),\n (BN.prototype.shln = function (bits) {\n return this.clone().ishln(bits);\n }),\n (BN.prototype.ushln = function (bits) {\n return this.clone().iushln(bits);\n }),\n (BN.prototype.shrn = function (bits) {\n return this.clone().ishrn(bits);\n }),\n (BN.prototype.ushrn = function (bits) {\n return this.clone().iushrn(bits);\n }),\n (BN.prototype.testn = function (bit) {\n assert(typeof bit == \"number\" && bit >= 0);\n var r = bit % 26,\n s = (bit - r) / 26,\n q = 1 << r;\n if (this.length <= s) return !1;\n var w = this.words[s];\n return !!(w & q);\n }),\n (BN.prototype.imaskn = function (bits) {\n assert(typeof bits == \"number\" && bits >= 0);\n var r = bits % 26,\n s = (bits - r) / 26;\n if ((assert(this.negative === 0, \"imaskn works only with positive numbers\"), this.length <= s)) return this;\n if ((r !== 0 && s++, (this.length = Math.min(s, this.length)), r !== 0)) {\n var mask = 67108863 ^ ((67108863 >>> r) << r);\n this.words[this.length - 1] &= mask;\n }\n return this.strip();\n }),\n (BN.prototype.maskn = function (bits) {\n return this.clone().imaskn(bits);\n }),\n (BN.prototype.iaddn = function (num) {\n return (\n assert(typeof num == \"number\"),\n assert(num < 67108864),\n num < 0\n ? this.isubn(-num)\n : this.negative !== 0\n ? this.length === 1 && (this.words[0] | 0) < num\n ? ((this.words[0] = num - (this.words[0] | 0)), (this.negative = 0), this)\n : ((this.negative = 0), this.isubn(num), (this.negative = 1), this)\n : this._iaddn(num)\n );\n }),\n (BN.prototype._iaddn = function (num) {\n this.words[0] += num;\n for (var i = 0; i < this.length && this.words[i] >= 67108864; i++)\n (this.words[i] -= 67108864), i === this.length - 1 ? (this.words[i + 1] = 1) : this.words[i + 1]++;\n return (this.length = Math.max(this.length, i + 1)), this;\n }),\n (BN.prototype.isubn = function (num) {\n if ((assert(typeof num == \"number\"), assert(num < 67108864), num < 0)) return this.iaddn(-num);\n if (this.negative !== 0) return (this.negative = 0), this.iaddn(num), (this.negative = 1), this;\n if (((this.words[0] -= num), this.length === 1 && this.words[0] < 0))\n (this.words[0] = -this.words[0]), (this.negative = 1);\n else\n for (var i = 0; i < this.length && this.words[i] < 0; i++)\n (this.words[i] += 67108864), (this.words[i + 1] -= 1);\n return this.strip();\n }),\n (BN.prototype.addn = function (num) {\n return this.clone().iaddn(num);\n }),\n (BN.prototype.subn = function (num) {\n return this.clone().isubn(num);\n }),\n (BN.prototype.iabs = function () {\n return (this.negative = 0), this;\n }),\n (BN.prototype.abs = function () {\n return this.clone().iabs();\n }),\n (BN.prototype._ishlnsubmul = function (num, mul, shift) {\n var len = num.length + shift,\n i;\n this._expand(len);\n var w,\n 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 & 67108863),\n (carry = (w >> 26) - ((right / 67108864) | 0)),\n (this.words[i + shift] = w & 67108863);\n }\n for (; i < this.length - shift; i++)\n (w = (this.words[i + shift] | 0) + carry), (carry = w >> 26), (this.words[i + shift] = w & 67108863);\n if (carry === 0) return this.strip();\n for (assert(carry === -1), carry = 0, i = 0; i < this.length; i++)\n (w = -(this.words[i] | 0) + carry), (carry = w >> 26), (this.words[i] = w & 67108863);\n return (this.negative = 1), this.strip();\n }),\n (BN.prototype._wordDiv = function (num, mode) {\n var shift = this.length - num.length,\n a = this.clone(),\n b = num,\n bhi = b.words[b.length - 1] | 0,\n bhiBits = this._countBits(bhi);\n (shift = 26 - bhiBits),\n shift !== 0 && ((b = b.ushln(shift)), a.iushln(shift), (bhi = b.words[b.length - 1] | 0));\n var m = a.length - b.length,\n q;\n if (mode !== \"mod\") {\n (q = new BN(null)), (q.length = m + 1), (q.words = new Array(q.length));\n for (var i = 0; i < q.length; i++) q.words[i] = 0;\n }\n var diff = a.clone()._ishlnsubmul(b, 1, m);\n diff.negative === 0 && ((a = diff), q && (q.words[m] = 1));\n for (var j = m - 1; j >= 0; j--) {\n var qj = (a.words[b.length + j] | 0) * 67108864 + (a.words[b.length + j - 1] | 0);\n for (qj = Math.min((qj / bhi) | 0, 67108863), a._ishlnsubmul(b, qj, j); a.negative !== 0; )\n qj--, (a.negative = 0), a._ishlnsubmul(b, 1, j), a.isZero() || (a.negative ^= 1);\n q && (q.words[j] = qj);\n }\n return (\n q && q.strip(),\n a.strip(),\n mode !== \"div\" && shift !== 0 && a.iushrn(shift),\n {\n div: q || null,\n mod: a,\n }\n );\n }),\n (BN.prototype.divmod = function (num, mode, positive) {\n if ((assert(!num.isZero()), this.isZero()))\n return {\n div: new BN(0),\n mod: new BN(0),\n };\n var div, mod, res;\n return this.negative !== 0 && num.negative === 0\n ? ((res = this.neg().divmod(num, mode)),\n mode !== \"mod\" && (div = res.div.neg()),\n mode !== \"div\" && ((mod = res.mod.neg()), positive && mod.negative !== 0 && mod.iadd(num)),\n {\n div,\n mod,\n })\n : this.negative === 0 && num.negative !== 0\n ? ((res = this.divmod(num.neg(), mode)),\n mode !== \"mod\" && (div = res.div.neg()),\n {\n div,\n mod: res.mod,\n })\n : (this.negative & num.negative) !== 0\n ? ((res = this.neg().divmod(num.neg(), mode)),\n mode !== \"div\" && ((mod = res.mod.neg()), positive && mod.negative !== 0 && mod.isub(num)),\n {\n div: res.div,\n mod,\n })\n : num.length > this.length || this.cmp(num) < 0\n ? {\n div: new BN(0),\n mod: this,\n }\n : num.length === 1\n ? mode === \"div\"\n ? {\n div: this.divn(num.words[0]),\n mod: null,\n }\n : mode === \"mod\"\n ? {\n div: null,\n mod: new BN(this.modn(num.words[0])),\n }\n : {\n div: this.divn(num.words[0]),\n mod: new BN(this.modn(num.words[0])),\n }\n : this._wordDiv(num, mode);\n }),\n (BN.prototype.div = function (num) {\n return this.divmod(num, \"div\", !1).div;\n }),\n (BN.prototype.mod = function (num) {\n return this.divmod(num, \"mod\", !1).mod;\n }),\n (BN.prototype.umod = function (num) {\n return this.divmod(num, \"mod\", !0).mod;\n }),\n (BN.prototype.divRound = function (num) {\n var dm = this.divmod(num);\n if (dm.mod.isZero()) return dm.div;\n var mod = dm.div.negative !== 0 ? dm.mod.isub(num) : dm.mod,\n half = num.ushrn(1),\n r2 = num.andln(1),\n cmp = mod.cmp(half);\n return cmp < 0 || (r2 === 1 && cmp === 0)\n ? dm.div\n : dm.div.negative !== 0\n ? dm.div.isubn(1)\n : dm.div.iaddn(1);\n }),\n (BN.prototype.modn = function (num) {\n assert(num <= 67108863);\n for (var p = (1 << 26) % num, acc = 0, i = this.length - 1; i >= 0; i--)\n acc = (p * acc + (this.words[i] | 0)) % num;\n return acc;\n }),\n (BN.prototype.idivn = function (num) {\n assert(num <= 67108863);\n for (var carry = 0, i = this.length - 1; i >= 0; i--) {\n var w = (this.words[i] | 0) + carry * 67108864;\n (this.words[i] = (w / num) | 0), (carry = w % num);\n }\n return this.strip();\n }),\n (BN.prototype.divn = function (num) {\n return this.clone().idivn(num);\n }),\n (BN.prototype.egcd = function (p) {\n assert(p.negative === 0), assert(!p.isZero());\n var x = this,\n y = p.clone();\n x.negative !== 0 ? (x = x.umod(p)) : (x = x.clone());\n for (var A = new BN(1), B = new BN(0), C = new BN(0), D = new BN(1), g = 0; x.isEven() && y.isEven(); )\n x.iushrn(1), y.iushrn(1), ++g;\n for (var yp = y.clone(), xp = x.clone(); !x.isZero(); ) {\n for (var i = 0, im = 1; (x.words[0] & im) === 0 && i < 26; ++i, im <<= 1);\n if (i > 0)\n for (x.iushrn(i); i-- > 0; )\n (A.isOdd() || B.isOdd()) && (A.iadd(yp), B.isub(xp)), A.iushrn(1), B.iushrn(1);\n for (var j = 0, jm = 1; (y.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n if (j > 0)\n for (y.iushrn(j); j-- > 0; )\n (C.isOdd() || D.isOdd()) && (C.iadd(yp), D.isub(xp)), C.iushrn(1), D.iushrn(1);\n x.cmp(y) >= 0 ? (x.isub(y), A.isub(C), B.isub(D)) : (y.isub(x), C.isub(A), D.isub(B));\n }\n return {\n a: C,\n b: D,\n gcd: y.iushln(g),\n };\n }),\n (BN.prototype._invmp = function (p) {\n assert(p.negative === 0), assert(!p.isZero());\n var a = this,\n b = p.clone();\n a.negative !== 0 ? (a = a.umod(p)) : (a = a.clone());\n for (var x1 = new BN(1), x2 = new BN(0), delta = b.clone(); 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) for (a.iushrn(i); i-- > 0; ) x1.isOdd() && x1.iadd(delta), x1.iushrn(1);\n for (var j = 0, jm = 1; (b.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n if (j > 0) for (b.iushrn(j); j-- > 0; ) x2.isOdd() && x2.iadd(delta), x2.iushrn(1);\n a.cmp(b) >= 0 ? (a.isub(b), x1.isub(x2)) : (b.isub(a), x2.isub(x1));\n }\n var res;\n return a.cmpn(1) === 0 ? (res = x1) : (res = x2), res.cmpn(0) < 0 && res.iadd(p), res;\n }),\n (BN.prototype.gcd = function (num) {\n if (this.isZero()) return num.abs();\n if (num.isZero()) return this.abs();\n var a = this.clone(),\n b = num.clone();\n (a.negative = 0), (b.negative = 0);\n for (var shift = 0; a.isEven() && b.isEven(); shift++) a.iushrn(1), b.iushrn(1);\n do {\n for (; a.isEven(); ) a.iushrn(1);\n for (; b.isEven(); ) b.iushrn(1);\n var r = a.cmp(b);\n if (r < 0) {\n var t = a;\n (a = b), (b = t);\n } else if (r === 0 || b.cmpn(1) === 0) break;\n a.isub(b);\n } while (!0);\n return b.iushln(shift);\n }),\n (BN.prototype.invm = function (num) {\n return this.egcd(num).a.umod(num);\n }),\n (BN.prototype.isEven = function () {\n return (this.words[0] & 1) === 0;\n }),\n (BN.prototype.isOdd = function () {\n return (this.words[0] & 1) === 1;\n }),\n (BN.prototype.andln = function (num) {\n return this.words[0] & num;\n }),\n (BN.prototype.bincn = function (bit) {\n assert(typeof bit == \"number\");\n var r = bit % 26,\n s = (bit - r) / 26,\n q = 1 << r;\n if (this.length <= s) return this._expand(s + 1), (this.words[s] |= q), this;\n for (var carry = q, i = s; carry !== 0 && i < this.length; i++) {\n var w = this.words[i] | 0;\n (w += carry), (carry = w >>> 26), (w &= 67108863), (this.words[i] = w);\n }\n return carry !== 0 && ((this.words[i] = carry), this.length++), this;\n }),\n (BN.prototype.isZero = function () {\n return this.length === 1 && this.words[0] === 0;\n }),\n (BN.prototype.cmpn = function (num) {\n var negative = num < 0;\n if (this.negative !== 0 && !negative) return -1;\n if (this.negative === 0 && negative) return 1;\n this.strip();\n var res;\n if (this.length > 1) res = 1;\n else {\n negative && (num = -num), assert(num <= 67108863, \"Number is too big\");\n var w = this.words[0] | 0;\n res = w === num ? 0 : w < num ? -1 : 1;\n }\n return this.negative !== 0 ? -res | 0 : res;\n }),\n (BN.prototype.cmp = function (num) {\n if (this.negative !== 0 && num.negative === 0) return -1;\n if (this.negative === 0 && num.negative !== 0) return 1;\n var res = this.ucmp(num);\n return this.negative !== 0 ? -res | 0 : res;\n }),\n (BN.prototype.ucmp = function (num) {\n if (this.length > num.length) return 1;\n if (this.length < num.length) return -1;\n for (var res = 0, i = this.length - 1; i >= 0; i--) {\n var a = this.words[i] | 0,\n b = num.words[i] | 0;\n if (a !== b) {\n a < b ? (res = -1) : a > b && (res = 1);\n break;\n }\n }\n return res;\n }),\n (BN.prototype.gtn = function (num) {\n return this.cmpn(num) === 1;\n }),\n (BN.prototype.gt = function (num) {\n return this.cmp(num) === 1;\n }),\n (BN.prototype.gten = function (num) {\n return this.cmpn(num) >= 0;\n }),\n (BN.prototype.gte = function (num) {\n return this.cmp(num) >= 0;\n }),\n (BN.prototype.ltn = function (num) {\n return this.cmpn(num) === -1;\n }),\n (BN.prototype.lt = function (num) {\n return this.cmp(num) === -1;\n }),\n (BN.prototype.lten = function (num) {\n return this.cmpn(num) <= 0;\n }),\n (BN.prototype.lte = function (num) {\n return this.cmp(num) <= 0;\n }),\n (BN.prototype.eqn = function (num) {\n return this.cmpn(num) === 0;\n }),\n (BN.prototype.eq = function (num) {\n return this.cmp(num) === 0;\n }),\n (BN.red = function (num) {\n return new Red(num);\n }),\n (BN.prototype.toRed = function (ctx) {\n return (\n assert(!this.red, \"Already a number in reduction context\"),\n assert(this.negative === 0, \"red works only with positives\"),\n ctx.convertTo(this)._forceRed(ctx)\n );\n }),\n (BN.prototype.fromRed = function () {\n return assert(this.red, \"fromRed works only with numbers in reduction context\"), this.red.convertFrom(this);\n }),\n (BN.prototype._forceRed = function (ctx) {\n return (this.red = ctx), this;\n }),\n (BN.prototype.forceRed = function (ctx) {\n return assert(!this.red, \"Already a number in reduction context\"), this._forceRed(ctx);\n }),\n (BN.prototype.redAdd = function (num) {\n return assert(this.red, \"redAdd works only with red numbers\"), this.red.add(this, num);\n }),\n (BN.prototype.redIAdd = function (num) {\n return assert(this.red, \"redIAdd works only with red numbers\"), this.red.iadd(this, num);\n }),\n (BN.prototype.redSub = function (num) {\n return assert(this.red, \"redSub works only with red numbers\"), this.red.sub(this, num);\n }),\n (BN.prototype.redISub = function (num) {\n return assert(this.red, \"redISub works only with red numbers\"), this.red.isub(this, num);\n }),\n (BN.prototype.redShl = function (num) {\n return assert(this.red, \"redShl works only with red numbers\"), this.red.shl(this, num);\n }),\n (BN.prototype.redMul = function (num) {\n return (\n assert(this.red, \"redMul works only with red numbers\"),\n this.red._verify2(this, num),\n this.red.mul(this, num)\n );\n }),\n (BN.prototype.redIMul = function (num) {\n return (\n assert(this.red, \"redMul works only with red numbers\"),\n this.red._verify2(this, num),\n this.red.imul(this, num)\n );\n }),\n (BN.prototype.redSqr = function () {\n return assert(this.red, \"redSqr works only with red numbers\"), this.red._verify1(this), this.red.sqr(this);\n }),\n (BN.prototype.redISqr = function () {\n return assert(this.red, \"redISqr works only with red numbers\"), this.red._verify1(this), this.red.isqr(this);\n }),\n (BN.prototype.redSqrt = function () {\n return assert(this.red, \"redSqrt works only with red numbers\"), this.red._verify1(this), this.red.sqrt(this);\n }),\n (BN.prototype.redInvm = function () {\n return assert(this.red, \"redInvm works only with red numbers\"), this.red._verify1(this), this.red.invm(this);\n }),\n (BN.prototype.redNeg = function () {\n return assert(this.red, \"redNeg works only with red numbers\"), this.red._verify1(this), this.red.neg(this);\n }),\n (BN.prototype.redPow = function (num) {\n return assert(this.red && !num.red, \"redPow(normalNum)\"), this.red._verify1(this), this.red.pow(this, num);\n });\n var primes = {\n k256: null,\n p224: null,\n p192: null,\n p25519: null,\n };\n function MPrime(name, p) {\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 (this.tmp = this._tmp());\n }\n (MPrime.prototype._tmp = function () {\n var tmp = new BN(null);\n return (tmp.words = new Array(Math.ceil(this.n / 13))), tmp;\n }),\n (MPrime.prototype.ireduce = function (num) {\n var r = num,\n rlen;\n do this.split(r, this.tmp), (r = this.imulK(r)), (r = r.iadd(this.tmp)), (rlen = r.bitLength());\n while (rlen > this.n);\n var cmp = rlen < this.n ? -1 : r.ucmp(this.p);\n return (\n cmp === 0\n ? ((r.words[0] = 0), (r.length = 1))\n : cmp > 0\n ? r.isub(this.p)\n : r.strip !== void 0\n ? r.strip()\n : r._strip(),\n r\n );\n }),\n (MPrime.prototype.split = function (input, out) {\n input.iushrn(this.n, 0, out);\n }),\n (MPrime.prototype.imulK = function (num) {\n return num.imul(this.k);\n });\n function K256() {\n MPrime.call(this, \"k256\", \"ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f\");\n }\n inherits(K256, MPrime),\n (K256.prototype.split = function (input, output) {\n for (var mask = 4194303, outLen = Math.min(input.length, 9), i = 0; i < outLen; i++)\n output.words[i] = input.words[i];\n if (((output.length = outLen), input.length <= 9)) {\n (input.words[0] = 0), (input.length = 1);\n return;\n }\n var prev = input.words[9];\n for (output.words[output.length++] = prev & mask, i = 10; i < input.length; i++) {\n var next = input.words[i] | 0;\n (input.words[i - 10] = ((next & mask) << 4) | (prev >>> 22)), (prev = next);\n }\n (prev >>>= 22),\n (input.words[i - 10] = prev),\n prev === 0 && input.length > 10 ? (input.length -= 10) : (input.length -= 9);\n }),\n (K256.prototype.imulK = function (num) {\n (num.words[num.length] = 0), (num.words[num.length + 1] = 0), (num.length += 2);\n for (var lo = 0, i = 0; i < num.length; i++) {\n var w = num.words[i] | 0;\n (lo += w * 977), (num.words[i] = lo & 67108863), (lo = w * 64 + ((lo / 67108864) | 0));\n }\n return (\n num.words[num.length - 1] === 0 && (num.length--, num.words[num.length - 1] === 0 && num.length--), num\n );\n });\n function P224() {\n MPrime.call(this, \"p224\", \"ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001\");\n }\n inherits(P224, MPrime);\n function P192() {\n MPrime.call(this, \"p192\", \"ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff\");\n }\n inherits(P192, MPrime);\n function P25519() {\n MPrime.call(this, \"25519\", \"7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed\");\n }\n inherits(P25519, MPrime),\n (P25519.prototype.imulK = function (num) {\n for (var carry = 0, i = 0; i < num.length; i++) {\n var hi = (num.words[i] | 0) * 19 + carry,\n lo = hi & 67108863;\n (hi >>>= 26), (num.words[i] = lo), (carry = hi);\n }\n return carry !== 0 && (num.words[num.length++] = carry), num;\n }),\n (BN._prime = function (name) {\n if (primes[name]) return primes[name];\n var prime2;\n if (name === \"k256\") prime2 = new K256();\n else if (name === \"p224\") prime2 = new P224();\n else if (name === \"p192\") prime2 = new P192();\n else if (name === \"p25519\") prime2 = new P25519();\n else throw new Error(\"Unknown prime \" + name);\n return (primes[name] = prime2), prime2;\n });\n function Red(m) {\n if (typeof m == \"string\") {\n var prime = BN._prime(m);\n (this.m = prime.p), (this.prime = prime);\n } else assert(m.gtn(1), \"modulus must be greater than 1\"), (this.m = m), (this.prime = null);\n }\n (Red.prototype._verify1 = function (a) {\n assert(a.negative === 0, \"red works only with positives\"), assert(a.red, \"red works only with red numbers\");\n }),\n (Red.prototype._verify2 = function (a, b) {\n assert((a.negative | b.negative) === 0, \"red works only with positives\"),\n assert(a.red && a.red === b.red, \"red works only with red numbers\");\n }),\n (Red.prototype.imod = function (a) {\n return this.prime ? this.prime.ireduce(a)._forceRed(this) : a.umod(this.m)._forceRed(this);\n }),\n (Red.prototype.neg = function (a) {\n return a.isZero() ? a.clone() : this.m.sub(a)._forceRed(this);\n }),\n (Red.prototype.add = function (a, b) {\n this._verify2(a, b);\n var res = a.add(b);\n return res.cmp(this.m) >= 0 && res.isub(this.m), res._forceRed(this);\n }),\n (Red.prototype.iadd = function (a, b) {\n this._verify2(a, b);\n var res = a.iadd(b);\n return res.cmp(this.m) >= 0 && res.isub(this.m), res;\n }),\n (Red.prototype.sub = function (a, b) {\n this._verify2(a, b);\n var res = a.sub(b);\n return res.cmpn(0) < 0 && res.iadd(this.m), res._forceRed(this);\n }),\n (Red.prototype.isub = function (a, b) {\n this._verify2(a, b);\n var res = a.isub(b);\n return res.cmpn(0) < 0 && res.iadd(this.m), res;\n }),\n (Red.prototype.shl = function (a, num) {\n return this._verify1(a), this.imod(a.ushln(num));\n }),\n (Red.prototype.imul = function (a, b) {\n return this._verify2(a, b), this.imod(a.imul(b));\n }),\n (Red.prototype.mul = function (a, b) {\n return this._verify2(a, b), this.imod(a.mul(b));\n }),\n (Red.prototype.isqr = function (a) {\n return this.imul(a, a.clone());\n }),\n (Red.prototype.sqr = function (a) {\n return this.mul(a, a);\n }),\n (Red.prototype.sqrt = function (a) {\n if (a.isZero()) return a.clone();\n var mod3 = this.m.andln(3);\n if ((assert(mod3 % 2 === 1), mod3 === 3)) {\n var pow = this.m.add(new BN(1)).iushrn(2);\n return this.pow(a, pow);\n }\n for (var q = this.m.subn(1), s = 0; !q.isZero() && q.andln(1) === 0; ) s++, q.iushrn(1);\n assert(!q.isZero());\n var one = new BN(1).toRed(this),\n nOne = one.redNeg(),\n lpow = this.m.subn(1).iushrn(1),\n z = this.m.bitLength();\n for (z = new BN(2 * z * z).toRed(this); this.pow(z, lpow).cmp(nOne) !== 0; ) z.redIAdd(nOne);\n for (\n var c = this.pow(z, q), r = this.pow(a, q.addn(1).iushrn(1)), t = this.pow(a, q), m = s;\n t.cmp(one) !== 0;\n\n ) {\n for (var tmp = t, i = 0; tmp.cmp(one) !== 0; i++) tmp = tmp.redSqr();\n assert(i < m);\n var b = this.pow(c, new BN(1).iushln(m - i - 1));\n (r = r.redMul(b)), (c = b.redSqr()), (t = t.redMul(c)), (m = i);\n }\n return r;\n }),\n (Red.prototype.invm = function (a) {\n var inv = a._invmp(this.m);\n return inv.negative !== 0 ? ((inv.negative = 0), this.imod(inv).redNeg()) : this.imod(inv);\n }),\n (Red.prototype.pow = function (a, num) {\n if (num.isZero()) return new BN(1).toRed(this);\n if (num.cmpn(1) === 0) return a.clone();\n var windowSize = 4,\n wnd = new Array(1 << windowSize);\n (wnd[0] = new BN(1).toRed(this)), (wnd[1] = a);\n for (var i = 2; i < wnd.length; i++) wnd[i] = this.mul(wnd[i - 1], a);\n var res = wnd[0],\n current = 0,\n currentLen = 0,\n start = num.bitLength() % 26;\n for (start === 0 && (start = 26), i = num.length - 1; i >= 0; i--) {\n for (var word = num.words[i], j = start - 1; j >= 0; j--) {\n var bit = (word >> j) & 1;\n if ((res !== wnd[0] && (res = this.sqr(res)), bit === 0 && current === 0)) {\n currentLen = 0;\n continue;\n }\n (current <<= 1),\n (current |= bit),\n currentLen++,\n !(currentLen !== windowSize && (i !== 0 || j !== 0)) &&\n ((res = this.mul(res, wnd[current])), (currentLen = 0), (current = 0));\n }\n start = 26;\n }\n return res;\n }),\n (Red.prototype.convertTo = function (num) {\n var r = num.umod(this.m);\n return r === num ? r.clone() : r;\n }),\n (Red.prototype.convertFrom = function (num) {\n var res = num.clone();\n return (res.red = null), res;\n }),\n (BN.mont = function (num) {\n return new Mont(num);\n });\n function Mont(m) {\n Red.call(this, m),\n (this.shift = this.m.bitLength()),\n this.shift % 26 !== 0 && (this.shift += 26 - (this.shift % 26)),\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 (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 (Mont.prototype.convertTo = function (num) {\n return this.imod(num.ushln(this.shift));\n }),\n (Mont.prototype.convertFrom = function (num) {\n var r = this.imod(num.mul(this.rinv));\n return (r.red = null), r;\n }),\n (Mont.prototype.imul = function (a, b) {\n if (a.isZero() || b.isZero()) return (a.words[0] = 0), (a.length = 1), a;\n var t = a.imul(b),\n c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m),\n u = t.isub(c).iushrn(this.shift),\n res = u;\n return (\n u.cmp(this.m) >= 0 ? (res = u.isub(this.m)) : u.cmpn(0) < 0 && (res = u.iadd(this.m)), res._forceRed(this)\n );\n }),\n (Mont.prototype.mul = function (a, b) {\n if (a.isZero() || b.isZero()) return new BN(0)._forceRed(this);\n var t = a.mul(b),\n c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m),\n u = t.isub(c).iushrn(this.shift),\n res = u;\n return (\n u.cmp(this.m) >= 0 ? (res = u.isub(this.m)) : u.cmpn(0) < 0 && (res = u.iadd(this.m)), res._forceRed(this)\n );\n }),\n (Mont.prototype.invm = function (a) {\n var res = this.imod(a._invmp(this.m).mul(this.r2));\n return res._forceRed(this);\n });\n })(typeof module > \"u\" || module, exports);\n },\n});\n\n// node_modules/miller-rabin/node_modules/bn.js/lib/bn.js\nvar require_bn2 = __commonJS({\n \"node_modules/miller-rabin/node_modules/bn.js/lib/bn.js\"(exports, module) {\n (function (module2, exports2) {\n \"use strict\";\n function assert(val, msg) {\n if (!val) throw new Error(msg || \"Assertion failed\");\n }\n function inherits(ctor, superCtor) {\n ctor.super_ = superCtor;\n var TempCtor = function () {};\n (TempCtor.prototype = superCtor.prototype),\n (ctor.prototype = new TempCtor()),\n (ctor.prototype.constructor = ctor);\n }\n function BN(number, base, endian) {\n if (BN.isBN(number)) return number;\n (this.negative = 0),\n (this.words = null),\n (this.length = 0),\n (this.red = null),\n number !== null &&\n ((base === \"le\" || base === \"be\") && ((endian = base), (base = 10)),\n this._init(number || 0, base || 10, endian || \"be\"));\n }\n typeof module2 == \"object\" ? (module2.exports = BN) : (exports2.BN = BN), (BN.BN = BN), (BN.wordSize = 26);\n var Buffer2;\n try {\n typeof window < \"u\" && typeof window.Buffer < \"u\"\n ? (Buffer2 = window.Buffer)\n : (Buffer2 = __require(\"buffer\").Buffer);\n } catch {}\n (BN.isBN = function (num) {\n return num instanceof BN\n ? !0\n : num !== null &&\n typeof num == \"object\" &&\n num.constructor.wordSize === BN.wordSize &&\n Array.isArray(num.words);\n }),\n (BN.max = function (left, right) {\n return left.cmp(right) > 0 ? left : right;\n }),\n (BN.min = function (left, right) {\n return left.cmp(right) < 0 ? left : right;\n }),\n (BN.prototype._init = function (number, base, endian) {\n if (typeof number == \"number\") return this._initNumber(number, base, endian);\n if (typeof number == \"object\") return this._initArray(number, base, endian);\n base === \"hex\" && (base = 16),\n assert(base === (base | 0) && base >= 2 && base <= 36),\n (number = number.toString().replace(/\\s+/g, \"\"));\n var start = 0;\n number[0] === \"-\" && (start++, (this.negative = 1)),\n start < number.length &&\n (base === 16\n ? this._parseHex(number, start, endian)\n : (this._parseBase(number, base, start),\n endian === \"le\" && this._initArray(this.toArray(), base, endian)));\n }),\n (BN.prototype._initNumber = function (number, base, endian) {\n number < 0 && ((this.negative = 1), (number = -number)),\n number < 67108864\n ? ((this.words = [number & 67108863]), (this.length = 1))\n : number < 4503599627370496\n ? ((this.words = [number & 67108863, (number / 67108864) & 67108863]), (this.length = 2))\n : (assert(number < 9007199254740992),\n (this.words = [number & 67108863, (number / 67108864) & 67108863, 1]),\n (this.length = 3)),\n endian === \"le\" && this._initArray(this.toArray(), base, endian);\n }),\n (BN.prototype._initArray = function (number, base, endian) {\n if ((assert(typeof number.length == \"number\"), number.length <= 0))\n return (this.words = [0]), (this.length = 1), this;\n (this.length = Math.ceil(number.length / 3)), (this.words = new Array(this.length));\n for (var i = 0; i < this.length; i++) this.words[i] = 0;\n var j,\n w,\n off = 0;\n if (endian === \"be\")\n for (i = number.length - 1, j = 0; i >= 0; i -= 3)\n (w = number[i] | (number[i - 1] << 8) | (number[i - 2] << 16)),\n (this.words[j] |= (w << off) & 67108863),\n (this.words[j + 1] = (w >>> (26 - off)) & 67108863),\n (off += 24),\n off >= 26 && ((off -= 26), j++);\n else if (endian === \"le\")\n for (i = 0, j = 0; i < number.length; i += 3)\n (w = number[i] | (number[i + 1] << 8) | (number[i + 2] << 16)),\n (this.words[j] |= (w << off) & 67108863),\n (this.words[j + 1] = (w >>> (26 - off)) & 67108863),\n (off += 24),\n off >= 26 && ((off -= 26), j++);\n return this.strip();\n });\n function parseHex4Bits(string, index) {\n var c = string.charCodeAt(index);\n return c >= 65 && c <= 70 ? c - 55 : c >= 97 && c <= 102 ? c - 87 : (c - 48) & 15;\n }\n function parseHexByte(string, lowerBound, index) {\n var r = parseHex4Bits(string, index);\n return index - 1 >= lowerBound && (r |= parseHex4Bits(string, index - 1) << 4), r;\n }\n BN.prototype._parseHex = function (number, start, endian) {\n (this.length = Math.ceil((number.length - start) / 6)), (this.words = new Array(this.length));\n for (var i = 0; i < this.length; i++) this.words[i] = 0;\n var off = 0,\n j = 0,\n w;\n if (endian === \"be\")\n for (i = number.length - 1; i >= start; i -= 2)\n (w = parseHexByte(number, start, i) << off),\n (this.words[j] |= w & 67108863),\n off >= 18 ? ((off -= 18), (j += 1), (this.words[j] |= w >>> 26)) : (off += 8);\n else {\n var parseLength = number.length - start;\n for (i = parseLength % 2 === 0 ? start + 1 : start; i < number.length; i += 2)\n (w = parseHexByte(number, start, i) << off),\n (this.words[j] |= w & 67108863),\n off >= 18 ? ((off -= 18), (j += 1), (this.words[j] |= w >>> 26)) : (off += 8);\n }\n this.strip();\n };\n function parseBase(str, start, end, mul) {\n for (var r = 0, len = Math.min(str.length, end), i = start; i < len; i++) {\n var c = str.charCodeAt(i) - 48;\n (r *= mul), c >= 49 ? (r += c - 49 + 10) : c >= 17 ? (r += c - 17 + 10) : (r += c);\n }\n return r;\n }\n (BN.prototype._parseBase = function (number, base, start) {\n (this.words = [0]), (this.length = 1);\n for (var limbLen = 0, limbPow = 1; limbPow <= 67108863; limbPow *= base) limbLen++;\n limbLen--, (limbPow = (limbPow / base) | 0);\n for (\n var total = number.length - start,\n mod = total % limbLen,\n end = Math.min(total, total - mod) + start,\n word = 0,\n i = start;\n i < end;\n i += limbLen\n )\n (word = parseBase(number, i, i + limbLen, base)),\n this.imuln(limbPow),\n this.words[0] + word < 67108864 ? (this.words[0] += word) : this._iaddn(word);\n if (mod !== 0) {\n var pow = 1;\n for (word = parseBase(number, i, number.length, base), i = 0; i < mod; i++) pow *= base;\n this.imuln(pow), this.words[0] + word < 67108864 ? (this.words[0] += word) : this._iaddn(word);\n }\n this.strip();\n }),\n (BN.prototype.copy = function (dest) {\n dest.words = new Array(this.length);\n for (var i = 0; i < this.length; i++) dest.words[i] = this.words[i];\n (dest.length = this.length), (dest.negative = this.negative), (dest.red = this.red);\n }),\n (BN.prototype.clone = function () {\n var r = new BN(null);\n return this.copy(r), r;\n }),\n (BN.prototype._expand = function (size) {\n for (; this.length < size; ) this.words[this.length++] = 0;\n return this;\n }),\n (BN.prototype.strip = function () {\n for (; this.length > 1 && this.words[this.length - 1] === 0; ) this.length--;\n return this._normSign();\n }),\n (BN.prototype._normSign = function () {\n return this.length === 1 && this.words[0] === 0 && (this.negative = 0), this;\n }),\n (BN.prototype.inspect = function () {\n return (this.red ? \"<BN-R: \" : \"<BN: \") + this.toString(16) + \">\";\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 groupSizes = [\n 0, 0, 25, 16, 12, 11, 10, 9, 8, 8, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5,\n 5, 5,\n ],\n groupBases = [\n 0, 0, 33554432, 43046721, 16777216, 48828125, 60466176, 40353607, 16777216, 43046721, 1e7, 19487171, 35831808,\n 62748517, 7529536, 11390625, 16777216, 24137569, 34012224, 47045881, 64e6, 4084101, 5153632, 6436343, 7962624,\n 9765625, 11881376, 14348907, 17210368, 20511149, 243e5, 28629151, 33554432, 39135393, 45435424, 52521875,\n 60466176,\n ];\n (BN.prototype.toString = function (base, padding) {\n (base = base || 10), (padding = padding | 0 || 1);\n var out;\n if (base === 16 || base === \"hex\") {\n out = \"\";\n for (var off = 0, carry = 0, i = 0; i < this.length; i++) {\n var w = this.words[i],\n word = (((w << off) | carry) & 16777215).toString(16);\n (carry = (w >>> (24 - off)) & 16777215),\n carry !== 0 || i !== this.length - 1 ? (out = zeros[6 - word.length] + word + out) : (out = word + out),\n (off += 2),\n off >= 26 && ((off -= 26), i--);\n }\n for (carry !== 0 && (out = carry.toString(16) + out); out.length % padding !== 0; ) out = \"0\" + out;\n return this.negative !== 0 && (out = \"-\" + out), out;\n }\n if (base === (base | 0) && base >= 2 && base <= 36) {\n var groupSize = groupSizes[base],\n groupBase = groupBases[base];\n out = \"\";\n var c = this.clone();\n for (c.negative = 0; !c.isZero(); ) {\n var r = c.modn(groupBase).toString(base);\n (c = c.idivn(groupBase)), c.isZero() ? (out = r + out) : (out = zeros[groupSize - r.length] + r + out);\n }\n for (this.isZero() && (out = \"0\" + out); out.length % padding !== 0; ) out = \"0\" + out;\n return this.negative !== 0 && (out = \"-\" + out), out;\n }\n assert(!1, \"Base should be between 2 and 36\");\n }),\n (BN.prototype.toNumber = function () {\n var ret = this.words[0];\n return (\n this.length === 2\n ? (ret += this.words[1] * 67108864)\n : this.length === 3 && this.words[2] === 1\n ? (ret += 4503599627370496 + this.words[1] * 67108864)\n : this.length > 2 && assert(!1, \"Number can only safely store up to 53 bits\"),\n this.negative !== 0 ? -ret : ret\n );\n }),\n (BN.prototype.toJSON = function () {\n return this.toString(16);\n }),\n (BN.prototype.toBuffer = function (endian, length) {\n return assert(typeof Buffer2 < \"u\"), this.toArrayLike(Buffer2, endian, length);\n }),\n (BN.prototype.toArray = function (endian, length) {\n return this.toArrayLike(Array, endian, length);\n }),\n (BN.prototype.toArrayLike = function (ArrayType, endian, length) {\n var byteLength = this.byteLength(),\n 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 this.strip();\n var littleEndian = endian === \"le\",\n res = new ArrayType(reqLength),\n b,\n i,\n q = this.clone();\n if (littleEndian) {\n for (i = 0; !q.isZero(); i++) (b = q.andln(255)), q.iushrn(8), (res[i] = b);\n for (; i < reqLength; i++) res[i] = 0;\n } else {\n for (i = 0; i < reqLength - byteLength; i++) res[i] = 0;\n for (i = 0; !q.isZero(); i++) (b = q.andln(255)), q.iushrn(8), (res[reqLength - i - 1] = b);\n }\n return res;\n }),\n Math.clz32\n ? (BN.prototype._countBits = function (w) {\n return 32 - Math.clz32(w);\n })\n : (BN.prototype._countBits = function (w) {\n var t = w,\n r = 0;\n return (\n t >= 4096 && ((r += 13), (t >>>= 13)),\n t >= 64 && ((r += 7), (t >>>= 7)),\n t >= 8 && ((r += 4), (t >>>= 4)),\n t >= 2 && ((r += 2), (t >>>= 2)),\n r + t\n );\n }),\n (BN.prototype._zeroBits = function (w) {\n if (w === 0) return 26;\n var t = w,\n r = 0;\n return (\n (t & 8191) === 0 && ((r += 13), (t >>>= 13)),\n (t & 127) === 0 && ((r += 7), (t >>>= 7)),\n (t & 15) === 0 && ((r += 4), (t >>>= 4)),\n (t & 3) === 0 && ((r += 2), (t >>>= 2)),\n (t & 1) === 0 && r++,\n r\n );\n }),\n (BN.prototype.bitLength = function () {\n var w = this.words[this.length - 1],\n hi = this._countBits(w);\n return (this.length - 1) * 26 + hi;\n });\n function toBitArray(num) {\n for (var w = new Array(num.bitLength()), bit = 0; bit < w.length; bit++) {\n var off = (bit / 26) | 0,\n wbit = bit % 26;\n w[bit] = (num.words[off] & (1 << wbit)) >>> wbit;\n }\n return w;\n }\n (BN.prototype.zeroBits = function () {\n if (this.isZero()) return 0;\n for (var r = 0, i = 0; i < this.length; i++) {\n var b = this._zeroBits(this.words[i]);\n if (((r += b), b !== 26)) break;\n }\n return r;\n }),\n (BN.prototype.byteLength = function () {\n return Math.ceil(this.bitLength() / 8);\n }),\n (BN.prototype.toTwos = function (width) {\n return this.negative !== 0 ? this.abs().inotn(width).iaddn(1) : this.clone();\n }),\n (BN.prototype.fromTwos = function (width) {\n return this.testn(width - 1) ? this.notn(width).iaddn(1).ineg() : this.clone();\n }),\n (BN.prototype.isNeg = function () {\n return this.negative !== 0;\n }),\n (BN.prototype.neg = function () {\n return this.clone().ineg();\n }),\n (BN.prototype.ineg = function () {\n return this.isZero() || (this.negative ^= 1), this;\n }),\n (BN.prototype.iuor = function (num) {\n for (; this.length < num.length; ) this.words[this.length++] = 0;\n for (var i = 0; i < num.length; i++) this.words[i] = this.words[i] | num.words[i];\n return this.strip();\n }),\n (BN.prototype.ior = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuor(num);\n }),\n (BN.prototype.or = function (num) {\n return this.length > num.length ? this.clone().ior(num) : num.clone().ior(this);\n }),\n (BN.prototype.uor = function (num) {\n return this.length > num.length ? this.clone().iuor(num) : num.clone().iuor(this);\n }),\n (BN.prototype.iuand = function (num) {\n var b;\n this.length > num.length ? (b = num) : (b = this);\n for (var i = 0; i < b.length; i++) this.words[i] = this.words[i] & num.words[i];\n return (this.length = b.length), this.strip();\n }),\n (BN.prototype.iand = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuand(num);\n }),\n (BN.prototype.and = function (num) {\n return this.length > num.length ? this.clone().iand(num) : num.clone().iand(this);\n }),\n (BN.prototype.uand = function (num) {\n return this.length > num.length ? this.clone().iuand(num) : num.clone().iuand(this);\n }),\n (BN.prototype.iuxor = function (num) {\n var a, b;\n this.length > num.length ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var i = 0; i < b.length; i++) this.words[i] = a.words[i] ^ b.words[i];\n if (this !== a) for (; i < a.length; i++) this.words[i] = a.words[i];\n return (this.length = a.length), this.strip();\n }),\n (BN.prototype.ixor = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuxor(num);\n }),\n (BN.prototype.xor = function (num) {\n return this.length > num.length ? this.clone().ixor(num) : num.clone().ixor(this);\n }),\n (BN.prototype.uxor = function (num) {\n return this.length > num.length ? this.clone().iuxor(num) : num.clone().iuxor(this);\n }),\n (BN.prototype.inotn = function (width) {\n assert(typeof width == \"number\" && width >= 0);\n var bytesNeeded = Math.ceil(width / 26) | 0,\n bitsLeft = width % 26;\n this._expand(bytesNeeded), bitsLeft > 0 && bytesNeeded--;\n for (var i = 0; i < bytesNeeded; i++) this.words[i] = ~this.words[i] & 67108863;\n return bitsLeft > 0 && (this.words[i] = ~this.words[i] & (67108863 >> (26 - bitsLeft))), this.strip();\n }),\n (BN.prototype.notn = function (width) {\n return this.clone().inotn(width);\n }),\n (BN.prototype.setn = function (bit, val) {\n assert(typeof bit == \"number\" && bit >= 0);\n var off = (bit / 26) | 0,\n wbit = bit % 26;\n return (\n this._expand(off + 1),\n val\n ? (this.words[off] = this.words[off] | (1 << wbit))\n : (this.words[off] = this.words[off] & ~(1 << wbit)),\n this.strip()\n );\n }),\n (BN.prototype.iadd = function (num) {\n var r;\n if (this.negative !== 0 && num.negative === 0)\n return (this.negative = 0), (r = this.isub(num)), (this.negative ^= 1), this._normSign();\n if (this.negative === 0 && num.negative !== 0)\n return (num.negative = 0), (r = this.isub(num)), (num.negative = 1), r._normSign();\n var a, b;\n this.length > num.length ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var carry = 0, i = 0; i < b.length; i++)\n (r = (a.words[i] | 0) + (b.words[i] | 0) + carry), (this.words[i] = r & 67108863), (carry = r >>> 26);\n for (; carry !== 0 && i < a.length; i++)\n (r = (a.words[i] | 0) + carry), (this.words[i] = r & 67108863), (carry = r >>> 26);\n if (((this.length = a.length), carry !== 0)) (this.words[this.length] = carry), this.length++;\n else if (a !== this) for (; i < a.length; i++) this.words[i] = a.words[i];\n return this;\n }),\n (BN.prototype.add = function (num) {\n var res;\n return num.negative !== 0 && this.negative === 0\n ? ((num.negative = 0), (res = this.sub(num)), (num.negative ^= 1), res)\n : num.negative === 0 && this.negative !== 0\n ? ((this.negative = 0), (res = num.sub(this)), (this.negative = 1), res)\n : this.length > num.length\n ? this.clone().iadd(num)\n : num.clone().iadd(this);\n }),\n (BN.prototype.isub = function (num) {\n if (num.negative !== 0) {\n num.negative = 0;\n var r = this.iadd(num);\n return (num.negative = 1), r._normSign();\n } else if (this.negative !== 0)\n return (this.negative = 0), this.iadd(num), (this.negative = 1), this._normSign();\n var cmp = this.cmp(num);\n if (cmp === 0) return (this.negative = 0), (this.length = 1), (this.words[0] = 0), this;\n var a, b;\n cmp > 0 ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var carry = 0, i = 0; i < b.length; i++)\n (r = (a.words[i] | 0) - (b.words[i] | 0) + carry), (carry = r >> 26), (this.words[i] = r & 67108863);\n for (; carry !== 0 && i < a.length; i++)\n (r = (a.words[i] | 0) + carry), (carry = r >> 26), (this.words[i] = r & 67108863);\n if (carry === 0 && i < a.length && a !== this) for (; i < a.length; i++) this.words[i] = a.words[i];\n return (this.length = Math.max(this.length, i)), a !== this && (this.negative = 1), this.strip();\n }),\n (BN.prototype.sub = function (num) {\n return this.clone().isub(num);\n });\n function smallMulTo(self2, num, out) {\n out.negative = num.negative ^ self2.negative;\n var len = (self2.length + num.length) | 0;\n (out.length = len), (len = (len - 1) | 0);\n var a = self2.words[0] | 0,\n b = num.words[0] | 0,\n r = a * b,\n lo = r & 67108863,\n carry = (r / 67108864) | 0;\n out.words[0] = lo;\n for (var k = 1; k < len; k++) {\n for (\n var ncarry = carry >>> 26,\n rword = carry & 67108863,\n maxJ = Math.min(k, num.length - 1),\n j = Math.max(0, k - self2.length + 1);\n j <= maxJ;\n j++\n ) {\n var i = (k - j) | 0;\n (a = self2.words[i] | 0),\n (b = num.words[j] | 0),\n (r = a * b + rword),\n (ncarry += (r / 67108864) | 0),\n (rword = r & 67108863);\n }\n (out.words[k] = rword | 0), (carry = ncarry | 0);\n }\n return carry !== 0 ? (out.words[k] = carry | 0) : out.length--, out.strip();\n }\n var comb10MulTo = function (self2, num, out) {\n var a = self2.words,\n b = num.words,\n o = out.words,\n c = 0,\n lo,\n mid,\n hi,\n a0 = a[0] | 0,\n al0 = a0 & 8191,\n ah0 = a0 >>> 13,\n a1 = a[1] | 0,\n al1 = a1 & 8191,\n ah1 = a1 >>> 13,\n a2 = a[2] | 0,\n al2 = a2 & 8191,\n ah2 = a2 >>> 13,\n a3 = a[3] | 0,\n al3 = a3 & 8191,\n ah3 = a3 >>> 13,\n a4 = a[4] | 0,\n al4 = a4 & 8191,\n ah4 = a4 >>> 13,\n a5 = a[5] | 0,\n al5 = a5 & 8191,\n ah5 = a5 >>> 13,\n a6 = a[6] | 0,\n al6 = a6 & 8191,\n ah6 = a6 >>> 13,\n a7 = a[7] | 0,\n al7 = a7 & 8191,\n ah7 = a7 >>> 13,\n a8 = a[8] | 0,\n al8 = a8 & 8191,\n ah8 = a8 >>> 13,\n a9 = a[9] | 0,\n al9 = a9 & 8191,\n ah9 = a9 >>> 13,\n b0 = b[0] | 0,\n bl0 = b0 & 8191,\n bh0 = b0 >>> 13,\n b1 = b[1] | 0,\n bl1 = b1 & 8191,\n bh1 = b1 >>> 13,\n b2 = b[2] | 0,\n bl2 = b2 & 8191,\n bh2 = b2 >>> 13,\n b3 = b[3] | 0,\n bl3 = b3 & 8191,\n bh3 = b3 >>> 13,\n b4 = b[4] | 0,\n bl4 = b4 & 8191,\n bh4 = b4 >>> 13,\n b5 = b[5] | 0,\n bl5 = b5 & 8191,\n bh5 = b5 >>> 13,\n b6 = b[6] | 0,\n bl6 = b6 & 8191,\n bh6 = b6 >>> 13,\n b7 = b[7] | 0,\n bl7 = b7 & 8191,\n bh7 = b7 >>> 13,\n b8 = b[8] | 0,\n bl8 = b8 & 8191,\n bh8 = b8 >>> 13,\n b9 = b[9] | 0,\n bl9 = b9 & 8191,\n bh9 = b9 >>> 13;\n (out.negative = self2.negative ^ num.negative),\n (out.length = 19),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w0 >>> 26)) | 0),\n (w0 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w1 >>> 26)) | 0),\n (w1 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w2 >>> 26)) | 0),\n (w2 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w3 >>> 26)) | 0),\n (w3 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w4 >>> 26)) | 0),\n (w4 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w5 >>> 26)) | 0),\n (w5 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w6 >>> 26)) | 0),\n (w6 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w7 >>> 26)) | 0),\n (w7 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w8 >>> 26)) | 0),\n (w8 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w9 >>> 26)) | 0),\n (w9 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w10 >>> 26)) | 0),\n (w10 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w11 >>> 26)) | 0),\n (w11 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w12 >>> 26)) | 0),\n (w12 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w13 >>> 26)) | 0),\n (w13 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w14 >>> 26)) | 0),\n (w14 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w15 >>> 26)) | 0),\n (w15 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w16 >>> 26)) | 0),\n (w16 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w17 >>> 26)) | 0),\n (w17 &= 67108863),\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 & 8191) << 13)) | 0;\n return (\n (c = (((hi + (mid >>> 13)) | 0) + (w18 >>> 26)) | 0),\n (w18 &= 67108863),\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 c !== 0 && ((o[19] = c), out.length++),\n out\n );\n };\n Math.imul || (comb10MulTo = smallMulTo);\n function bigMulTo(self2, num, out) {\n (out.negative = num.negative ^ self2.negative), (out.length = self2.length + num.length);\n for (var carry = 0, hncarry = 0, k = 0; k < out.length - 1; k++) {\n var ncarry = hncarry;\n hncarry = 0;\n for (\n var rword = carry & 67108863, maxJ = Math.min(k, num.length - 1), j = Math.max(0, k - self2.length + 1);\n j <= maxJ;\n j++\n ) {\n var i = k - j,\n a = self2.words[i] | 0,\n b = num.words[j] | 0,\n r = a * b,\n lo = r & 67108863;\n (ncarry = (ncarry + ((r / 67108864) | 0)) | 0),\n (lo = (lo + rword) | 0),\n (rword = lo & 67108863),\n (ncarry = (ncarry + (lo >>> 26)) | 0),\n (hncarry += ncarry >>> 26),\n (ncarry &= 67108863);\n }\n (out.words[k] = rword), (carry = ncarry), (ncarry = hncarry);\n }\n return carry !== 0 ? (out.words[k] = carry) : out.length--, out.strip();\n }\n function jumboMulTo(self2, num, out) {\n var fftm = new FFTM();\n return fftm.mulp(self2, num, out);\n }\n BN.prototype.mulTo = function (num, out) {\n var res,\n len = this.length + num.length;\n return (\n this.length === 10 && num.length === 10\n ? (res = comb10MulTo(this, num, out))\n : len < 63\n ? (res = smallMulTo(this, num, out))\n : len < 1024\n ? (res = bigMulTo(this, num, out))\n : (res = jumboMulTo(this, num, out)),\n res\n );\n };\n function FFTM(x, y) {\n (this.x = x), (this.y = y);\n }\n (FFTM.prototype.makeRBT = function (N) {\n for (var t = new Array(N), l = BN.prototype._countBits(N) - 1, i = 0; i < N; i++) t[i] = this.revBin(i, l, N);\n return t;\n }),\n (FFTM.prototype.revBin = function (x, l, N) {\n if (x === 0 || x === N - 1) return x;\n for (var rb = 0, i = 0; i < l; i++) (rb |= (x & 1) << (l - i - 1)), (x >>= 1);\n return rb;\n }),\n (FFTM.prototype.permute = function (rbt, rws, iws, rtws, itws, N) {\n for (var i = 0; i < N; i++) (rtws[i] = rws[rbt[i]]), (itws[i] = iws[rbt[i]]);\n }),\n (FFTM.prototype.transform = function (rws, iws, rtws, itws, N, rbt) {\n this.permute(rbt, rws, iws, rtws, itws, N);\n for (var s = 1; s < N; s <<= 1)\n for (\n var l = s << 1, rtwdf = Math.cos((2 * Math.PI) / l), itwdf = Math.sin((2 * Math.PI) / l), p = 0;\n p < N;\n p += l\n )\n for (var rtwdf_ = rtwdf, itwdf_ = itwdf, j = 0; j < s; j++) {\n var re = rtws[p + j],\n ie = itws[p + j],\n ro = rtws[p + j + s],\n io = itws[p + j + s],\n rx = rtwdf_ * ro - itwdf_ * io;\n (io = rtwdf_ * io + itwdf_ * ro),\n (ro = rx),\n (rtws[p + j] = re + ro),\n (itws[p + j] = ie + io),\n (rtws[p + j + s] = re - ro),\n (itws[p + j + s] = ie - io),\n j !== l &&\n ((rx = rtwdf * rtwdf_ - itwdf * itwdf_), (itwdf_ = rtwdf * itwdf_ + itwdf * rtwdf_), (rtwdf_ = rx));\n }\n }),\n (FFTM.prototype.guessLen13b = function (n, m) {\n var N = Math.max(m, n) | 1,\n odd = N & 1,\n i = 0;\n for (N = (N / 2) | 0; N; N = N >>> 1) i++;\n return 1 << (i + 1 + odd);\n }),\n (FFTM.prototype.conjugate = function (rws, iws, N) {\n if (!(N <= 1))\n for (var i = 0; i < N / 2; i++) {\n var t = rws[i];\n (rws[i] = rws[N - i - 1]),\n (rws[N - i - 1] = t),\n (t = iws[i]),\n (iws[i] = -iws[N - i - 1]),\n (iws[N - i - 1] = -t);\n }\n }),\n (FFTM.prototype.normalize13b = function (ws, N) {\n for (var carry = 0, i = 0; i < N / 2; i++) {\n var w = Math.round(ws[2 * i + 1] / N) * 8192 + Math.round(ws[2 * i] / N) + carry;\n (ws[i] = w & 67108863), w < 67108864 ? (carry = 0) : (carry = (w / 67108864) | 0);\n }\n return ws;\n }),\n (FFTM.prototype.convert13b = function (ws, len, rws, N) {\n for (var carry = 0, i = 0; i < len; i++)\n (carry = carry + (ws[i] | 0)),\n (rws[2 * i] = carry & 8191),\n (carry = carry >>> 13),\n (rws[2 * i + 1] = carry & 8191),\n (carry = carry >>> 13);\n for (i = 2 * len; i < N; ++i) rws[i] = 0;\n assert(carry === 0), assert((carry & -8192) === 0);\n }),\n (FFTM.prototype.stub = function (N) {\n for (var ph = new Array(N), i = 0; i < N; i++) ph[i] = 0;\n return ph;\n }),\n (FFTM.prototype.mulp = function (x, y, out) {\n var N = 2 * this.guessLen13b(x.length, y.length),\n rbt = this.makeRBT(N),\n _ = this.stub(N),\n rws = new Array(N),\n rwst = new Array(N),\n iwst = new Array(N),\n nrws = new Array(N),\n nrwst = new Array(N),\n niwst = new Array(N),\n rmws = out.words;\n (rmws.length = N),\n this.convert13b(x.words, x.length, rws, N),\n this.convert13b(y.words, y.length, nrws, N),\n this.transform(rws, _, rwst, iwst, N, rbt),\n this.transform(nrws, _, nrwst, niwst, N, rbt);\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]), (rwst[i] = rx);\n }\n return (\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 (out.negative = x.negative ^ y.negative),\n (out.length = x.length + y.length),\n out.strip()\n );\n }),\n (BN.prototype.mul = function (num) {\n var out = new BN(null);\n return (out.words = new Array(this.length + num.length)), this.mulTo(num, out);\n }),\n (BN.prototype.mulf = function (num) {\n var out = new BN(null);\n return (out.words = new Array(this.length + num.length)), jumboMulTo(this, num, out);\n }),\n (BN.prototype.imul = function (num) {\n return this.clone().mulTo(num, this);\n }),\n (BN.prototype.imuln = function (num) {\n assert(typeof num == \"number\"), assert(num < 67108864);\n for (var carry = 0, i = 0; i < this.length; i++) {\n var w = (this.words[i] | 0) * num,\n lo = (w & 67108863) + (carry & 67108863);\n (carry >>= 26), (carry += (w / 67108864) | 0), (carry += lo >>> 26), (this.words[i] = lo & 67108863);\n }\n return carry !== 0 && ((this.words[i] = carry), this.length++), this;\n }),\n (BN.prototype.muln = function (num) {\n return this.clone().imuln(num);\n }),\n (BN.prototype.sqr = function () {\n return this.mul(this);\n }),\n (BN.prototype.isqr = function () {\n return this.imul(this.clone());\n }),\n (BN.prototype.pow = function (num) {\n var w = toBitArray(num);\n if (w.length === 0) return new BN(1);\n for (var res = this, i = 0; i < w.length && w[i] === 0; i++, res = res.sqr());\n if (++i < w.length) for (var q = res.sqr(); i < w.length; i++, q = q.sqr()) w[i] !== 0 && (res = res.mul(q));\n return res;\n }),\n (BN.prototype.iushln = function (bits) {\n assert(typeof bits == \"number\" && bits >= 0);\n var r = bits % 26,\n s = (bits - r) / 26,\n carryMask = (67108863 >>> (26 - r)) << (26 - r),\n i;\n if (r !== 0) {\n var carry = 0;\n for (i = 0; i < this.length; i++) {\n var newCarry = this.words[i] & carryMask,\n c = ((this.words[i] | 0) - newCarry) << r;\n (this.words[i] = c | carry), (carry = newCarry >>> (26 - r));\n }\n carry && ((this.words[i] = carry), this.length++);\n }\n if (s !== 0) {\n for (i = this.length - 1; i >= 0; i--) this.words[i + s] = this.words[i];\n for (i = 0; i < s; i++) this.words[i] = 0;\n this.length += s;\n }\n return this.strip();\n }),\n (BN.prototype.ishln = function (bits) {\n return assert(this.negative === 0), this.iushln(bits);\n }),\n (BN.prototype.iushrn = function (bits, hint, extended) {\n assert(typeof bits == \"number\" && bits >= 0);\n var h;\n hint ? (h = (hint - (hint % 26)) / 26) : (h = 0);\n var r = bits % 26,\n s = Math.min((bits - r) / 26, this.length),\n mask = 67108863 ^ ((67108863 >>> r) << r),\n maskedWords = extended;\n if (((h -= s), (h = Math.max(0, h)), maskedWords)) {\n for (var i = 0; i < s; i++) maskedWords.words[i] = this.words[i];\n maskedWords.length = s;\n }\n if (s !== 0)\n if (this.length > s) for (this.length -= s, i = 0; i < this.length; i++) this.words[i] = this.words[i + s];\n else (this.words[0] = 0), (this.length = 1);\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)), (carry = word & mask);\n }\n return (\n maskedWords && carry !== 0 && (maskedWords.words[maskedWords.length++] = carry),\n this.length === 0 && ((this.words[0] = 0), (this.length = 1)),\n this.strip()\n );\n }),\n (BN.prototype.ishrn = function (bits, hint, extended) {\n return assert(this.negative === 0), this.iushrn(bits, hint, extended);\n }),\n (BN.prototype.shln = function (bits) {\n return this.clone().ishln(bits);\n }),\n (BN.prototype.ushln = function (bits) {\n return this.clone().iushln(bits);\n }),\n (BN.prototype.shrn = function (bits) {\n return this.clone().ishrn(bits);\n }),\n (BN.prototype.ushrn = function (bits) {\n return this.clone().iushrn(bits);\n }),\n (BN.prototype.testn = function (bit) {\n assert(typeof bit == \"number\" && bit >= 0);\n var r = bit % 26,\n s = (bit - r) / 26,\n q = 1 << r;\n if (this.length <= s) return !1;\n var w = this.words[s];\n return !!(w & q);\n }),\n (BN.prototype.imaskn = function (bits) {\n assert(typeof bits == \"number\" && bits >= 0);\n var r = bits % 26,\n s = (bits - r) / 26;\n if ((assert(this.negative === 0, \"imaskn works only with positive numbers\"), this.length <= s)) return this;\n if ((r !== 0 && s++, (this.length = Math.min(s, this.length)), r !== 0)) {\n var mask = 67108863 ^ ((67108863 >>> r) << r);\n this.words[this.length - 1] &= mask;\n }\n return this.strip();\n }),\n (BN.prototype.maskn = function (bits) {\n return this.clone().imaskn(bits);\n }),\n (BN.prototype.iaddn = function (num) {\n return (\n assert(typeof num == \"number\"),\n assert(num < 67108864),\n num < 0\n ? this.isubn(-num)\n : this.negative !== 0\n ? this.length === 1 && (this.words[0] | 0) < num\n ? ((this.words[0] = num - (this.words[0] | 0)), (this.negative = 0), this)\n : ((this.negative = 0), this.isubn(num), (this.negative = 1), this)\n : this._iaddn(num)\n );\n }),\n (BN.prototype._iaddn = function (num) {\n this.words[0] += num;\n for (var i = 0; i < this.length && this.words[i] >= 67108864; i++)\n (this.words[i] -= 67108864), i === this.length - 1 ? (this.words[i + 1] = 1) : this.words[i + 1]++;\n return (this.length = Math.max(this.length, i + 1)), this;\n }),\n (BN.prototype.isubn = function (num) {\n if ((assert(typeof num == \"number\"), assert(num < 67108864), num < 0)) return this.iaddn(-num);\n if (this.negative !== 0) return (this.negative = 0), this.iaddn(num), (this.negative = 1), this;\n if (((this.words[0] -= num), this.length === 1 && this.words[0] < 0))\n (this.words[0] = -this.words[0]), (this.negative = 1);\n else\n for (var i = 0; i < this.length && this.words[i] < 0; i++)\n (this.words[i] += 67108864), (this.words[i + 1] -= 1);\n return this.strip();\n }),\n (BN.prototype.addn = function (num) {\n return this.clone().iaddn(num);\n }),\n (BN.prototype.subn = function (num) {\n return this.clone().isubn(num);\n }),\n (BN.prototype.iabs = function () {\n return (this.negative = 0), this;\n }),\n (BN.prototype.abs = function () {\n return this.clone().iabs();\n }),\n (BN.prototype._ishlnsubmul = function (num, mul, shift) {\n var len = num.length + shift,\n i;\n this._expand(len);\n var w,\n 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 & 67108863),\n (carry = (w >> 26) - ((right / 67108864) | 0)),\n (this.words[i + shift] = w & 67108863);\n }\n for (; i < this.length - shift; i++)\n (w = (this.words[i + shift] | 0) + carry), (carry = w >> 26), (this.words[i + shift] = w & 67108863);\n if (carry === 0) return this.strip();\n for (assert(carry === -1), carry = 0, i = 0; i < this.length; i++)\n (w = -(this.words[i] | 0) + carry), (carry = w >> 26), (this.words[i] = w & 67108863);\n return (this.negative = 1), this.strip();\n }),\n (BN.prototype._wordDiv = function (num, mode) {\n var shift = this.length - num.length,\n a = this.clone(),\n b = num,\n bhi = b.words[b.length - 1] | 0,\n bhiBits = this._countBits(bhi);\n (shift = 26 - bhiBits),\n shift !== 0 && ((b = b.ushln(shift)), a.iushln(shift), (bhi = b.words[b.length - 1] | 0));\n var m = a.length - b.length,\n q;\n if (mode !== \"mod\") {\n (q = new BN(null)), (q.length = m + 1), (q.words = new Array(q.length));\n for (var i = 0; i < q.length; i++) q.words[i] = 0;\n }\n var diff = a.clone()._ishlnsubmul(b, 1, m);\n diff.negative === 0 && ((a = diff), q && (q.words[m] = 1));\n for (var j = m - 1; j >= 0; j--) {\n var qj = (a.words[b.length + j] | 0) * 67108864 + (a.words[b.length + j - 1] | 0);\n for (qj = Math.min((qj / bhi) | 0, 67108863), a._ishlnsubmul(b, qj, j); a.negative !== 0; )\n qj--, (a.negative = 0), a._ishlnsubmul(b, 1, j), a.isZero() || (a.negative ^= 1);\n q && (q.words[j] = qj);\n }\n return (\n q && q.strip(),\n a.strip(),\n mode !== \"div\" && shift !== 0 && a.iushrn(shift),\n {\n div: q || null,\n mod: a,\n }\n );\n }),\n (BN.prototype.divmod = function (num, mode, positive) {\n if ((assert(!num.isZero()), this.isZero()))\n return {\n div: new BN(0),\n mod: new BN(0),\n };\n var div, mod, res;\n return this.negative !== 0 && num.negative === 0\n ? ((res = this.neg().divmod(num, mode)),\n mode !== \"mod\" && (div = res.div.neg()),\n mode !== \"div\" && ((mod = res.mod.neg()), positive && mod.negative !== 0 && mod.iadd(num)),\n {\n div,\n mod,\n })\n : this.negative === 0 && num.negative !== 0\n ? ((res = this.divmod(num.neg(), mode)),\n mode !== \"mod\" && (div = res.div.neg()),\n {\n div,\n mod: res.mod,\n })\n : (this.negative & num.negative) !== 0\n ? ((res = this.neg().divmod(num.neg(), mode)),\n mode !== \"div\" && ((mod = res.mod.neg()), positive && mod.negative !== 0 && mod.isub(num)),\n {\n div: res.div,\n mod,\n })\n : num.length > this.length || this.cmp(num) < 0\n ? {\n div: new BN(0),\n mod: this,\n }\n : num.length === 1\n ? mode === \"div\"\n ? {\n div: this.divn(num.words[0]),\n mod: null,\n }\n : mode === \"mod\"\n ? {\n div: null,\n mod: new BN(this.modn(num.words[0])),\n }\n : {\n div: this.divn(num.words[0]),\n mod: new BN(this.modn(num.words[0])),\n }\n : this._wordDiv(num, mode);\n }),\n (BN.prototype.div = function (num) {\n return this.divmod(num, \"div\", !1).div;\n }),\n (BN.prototype.mod = function (num) {\n return this.divmod(num, \"mod\", !1).mod;\n }),\n (BN.prototype.umod = function (num) {\n return this.divmod(num, \"mod\", !0).mod;\n }),\n (BN.prototype.divRound = function (num) {\n var dm = this.divmod(num);\n if (dm.mod.isZero()) return dm.div;\n var mod = dm.div.negative !== 0 ? dm.mod.isub(num) : dm.mod,\n half = num.ushrn(1),\n r2 = num.andln(1),\n cmp = mod.cmp(half);\n return cmp < 0 || (r2 === 1 && cmp === 0)\n ? dm.div\n : dm.div.negative !== 0\n ? dm.div.isubn(1)\n : dm.div.iaddn(1);\n }),\n (BN.prototype.modn = function (num) {\n assert(num <= 67108863);\n for (var p = (1 << 26) % num, acc = 0, i = this.length - 1; i >= 0; i--)\n acc = (p * acc + (this.words[i] | 0)) % num;\n return acc;\n }),\n (BN.prototype.idivn = function (num) {\n assert(num <= 67108863);\n for (var carry = 0, i = this.length - 1; i >= 0; i--) {\n var w = (this.words[i] | 0) + carry * 67108864;\n (this.words[i] = (w / num) | 0), (carry = w % num);\n }\n return this.strip();\n }),\n (BN.prototype.divn = function (num) {\n return this.clone().idivn(num);\n }),\n (BN.prototype.egcd = function (p) {\n assert(p.negative === 0), assert(!p.isZero());\n var x = this,\n y = p.clone();\n x.negative !== 0 ? (x = x.umod(p)) : (x = x.clone());\n for (var A = new BN(1), B = new BN(0), C = new BN(0), D = new BN(1), g = 0; x.isEven() && y.isEven(); )\n x.iushrn(1), y.iushrn(1), ++g;\n for (var yp = y.clone(), xp = x.clone(); !x.isZero(); ) {\n for (var i = 0, im = 1; (x.words[0] & im) === 0 && i < 26; ++i, im <<= 1);\n if (i > 0)\n for (x.iushrn(i); i-- > 0; )\n (A.isOdd() || B.isOdd()) && (A.iadd(yp), B.isub(xp)), A.iushrn(1), B.iushrn(1);\n for (var j = 0, jm = 1; (y.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n if (j > 0)\n for (y.iushrn(j); j-- > 0; )\n (C.isOdd() || D.isOdd()) && (C.iadd(yp), D.isub(xp)), C.iushrn(1), D.iushrn(1);\n x.cmp(y) >= 0 ? (x.isub(y), A.isub(C), B.isub(D)) : (y.isub(x), C.isub(A), D.isub(B));\n }\n return {\n a: C,\n b: D,\n gcd: y.iushln(g),\n };\n }),\n (BN.prototype._invmp = function (p) {\n assert(p.negative === 0), assert(!p.isZero());\n var a = this,\n b = p.clone();\n a.negative !== 0 ? (a = a.umod(p)) : (a = a.clone());\n for (var x1 = new BN(1), x2 = new BN(0), delta = b.clone(); 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) for (a.iushrn(i); i-- > 0; ) x1.isOdd() && x1.iadd(delta), x1.iushrn(1);\n for (var j = 0, jm = 1; (b.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n if (j > 0) for (b.iushrn(j); j-- > 0; ) x2.isOdd() && x2.iadd(delta), x2.iushrn(1);\n a.cmp(b) >= 0 ? (a.isub(b), x1.isub(x2)) : (b.isub(a), x2.isub(x1));\n }\n var res;\n return a.cmpn(1) === 0 ? (res = x1) : (res = x2), res.cmpn(0) < 0 && res.iadd(p), res;\n }),\n (BN.prototype.gcd = function (num) {\n if (this.isZero()) return num.abs();\n if (num.isZero()) return this.abs();\n var a = this.clone(),\n b = num.clone();\n (a.negative = 0), (b.negative = 0);\n for (var shift = 0; a.isEven() && b.isEven(); shift++) a.iushrn(1), b.iushrn(1);\n do {\n for (; a.isEven(); ) a.iushrn(1);\n for (; b.isEven(); ) b.iushrn(1);\n var r = a.cmp(b);\n if (r < 0) {\n var t = a;\n (a = b), (b = t);\n } else if (r === 0 || b.cmpn(1) === 0) break;\n a.isub(b);\n } while (!0);\n return b.iushln(shift);\n }),\n (BN.prototype.invm = function (num) {\n return this.egcd(num).a.umod(num);\n }),\n (BN.prototype.isEven = function () {\n return (this.words[0] & 1) === 0;\n }),\n (BN.prototype.isOdd = function () {\n return (this.words[0] & 1) === 1;\n }),\n (BN.prototype.andln = function (num) {\n return this.words[0] & num;\n }),\n (BN.prototype.bincn = function (bit) {\n assert(typeof bit == \"number\");\n var r = bit % 26,\n s = (bit - r) / 26,\n q = 1 << r;\n if (this.length <= s) return this._expand(s + 1), (this.words[s] |= q), this;\n for (var carry = q, i = s; carry !== 0 && i < this.length; i++) {\n var w = this.words[i] | 0;\n (w += carry), (carry = w >>> 26), (w &= 67108863), (this.words[i] = w);\n }\n return carry !== 0 && ((this.words[i] = carry), this.length++), this;\n }),\n (BN.prototype.isZero = function () {\n return this.length === 1 && this.words[0] === 0;\n }),\n (BN.prototype.cmpn = function (num) {\n var negative = num < 0;\n if (this.negative !== 0 && !negative) return -1;\n if (this.negative === 0 && negative) return 1;\n this.strip();\n var res;\n if (this.length > 1) res = 1;\n else {\n negative && (num = -num), assert(num <= 67108863, \"Number is too big\");\n var w = this.words[0] | 0;\n res = w === num ? 0 : w < num ? -1 : 1;\n }\n return this.negative !== 0 ? -res | 0 : res;\n }),\n (BN.prototype.cmp = function (num) {\n if (this.negative !== 0 && num.negative === 0) return -1;\n if (this.negative === 0 && num.negative !== 0) return 1;\n var res = this.ucmp(num);\n return this.negative !== 0 ? -res | 0 : res;\n }),\n (BN.prototype.ucmp = function (num) {\n if (this.length > num.length) return 1;\n if (this.length < num.length) return -1;\n for (var res = 0, i = this.length - 1; i >= 0; i--) {\n var a = this.words[i] | 0,\n b = num.words[i] | 0;\n if (a !== b) {\n a < b ? (res = -1) : a > b && (res = 1);\n break;\n }\n }\n return res;\n }),\n (BN.prototype.gtn = function (num) {\n return this.cmpn(num) === 1;\n }),\n (BN.prototype.gt = function (num) {\n return this.cmp(num) === 1;\n }),\n (BN.prototype.gten = function (num) {\n return this.cmpn(num) >= 0;\n }),\n (BN.prototype.gte = function (num) {\n return this.cmp(num) >= 0;\n }),\n (BN.prototype.ltn = function (num) {\n return this.cmpn(num) === -1;\n }),\n (BN.prototype.lt = function (num) {\n return this.cmp(num) === -1;\n }),\n (BN.prototype.lten = function (num) {\n return this.cmpn(num) <= 0;\n }),\n (BN.prototype.lte = function (num) {\n return this.cmp(num) <= 0;\n }),\n (BN.prototype.eqn = function (num) {\n return this.cmpn(num) === 0;\n }),\n (BN.prototype.eq = function (num) {\n return this.cmp(num) === 0;\n }),\n (BN.red = function (num) {\n return new Red(num);\n }),\n (BN.prototype.toRed = function (ctx) {\n return (\n assert(!this.red, \"Already a number in reduction context\"),\n assert(this.negative === 0, \"red works only with positives\"),\n ctx.convertTo(this)._forceRed(ctx)\n );\n }),\n (BN.prototype.fromRed = function () {\n return assert(this.red, \"fromRed works only with numbers in reduction context\"), this.red.convertFrom(this);\n }),\n (BN.prototype._forceRed = function (ctx) {\n return (this.red = ctx), this;\n }),\n (BN.prototype.forceRed = function (ctx) {\n return assert(!this.red, \"Already a number in reduction context\"), this._forceRed(ctx);\n }),\n (BN.prototype.redAdd = function (num) {\n return assert(this.red, \"redAdd works only with red numbers\"), this.red.add(this, num);\n }),\n (BN.prototype.redIAdd = function (num) {\n return assert(this.red, \"redIAdd works only with red numbers\"), this.red.iadd(this, num);\n }),\n (BN.prototype.redSub = function (num) {\n return assert(this.red, \"redSub works only with red numbers\"), this.red.sub(this, num);\n }),\n (BN.prototype.redISub = function (num) {\n return assert(this.red, \"redISub works only with red numbers\"), this.red.isub(this, num);\n }),\n (BN.prototype.redShl = function (num) {\n return assert(this.red, \"redShl works only with red numbers\"), this.red.shl(this, num);\n }),\n (BN.prototype.redMul = function (num) {\n return (\n assert(this.red, \"redMul works only with red numbers\"),\n this.red._verify2(this, num),\n this.red.mul(this, num)\n );\n }),\n (BN.prototype.redIMul = function (num) {\n return (\n assert(this.red, \"redMul works only with red numbers\"),\n this.red._verify2(this, num),\n this.red.imul(this, num)\n );\n }),\n (BN.prototype.redSqr = function () {\n return assert(this.red, \"redSqr works only with red numbers\"), this.red._verify1(this), this.red.sqr(this);\n }),\n (BN.prototype.redISqr = function () {\n return assert(this.red, \"redISqr works only with red numbers\"), this.red._verify1(this), this.red.isqr(this);\n }),\n (BN.prototype.redSqrt = function () {\n return assert(this.red, \"redSqrt works only with red numbers\"), this.red._verify1(this), this.red.sqrt(this);\n }),\n (BN.prototype.redInvm = function () {\n return assert(this.red, \"redInvm works only with red numbers\"), this.red._verify1(this), this.red.invm(this);\n }),\n (BN.prototype.redNeg = function () {\n return assert(this.red, \"redNeg works only with red numbers\"), this.red._verify1(this), this.red.neg(this);\n }),\n (BN.prototype.redPow = function (num) {\n return assert(this.red && !num.red, \"redPow(normalNum)\"), this.red._verify1(this), this.red.pow(this, num);\n });\n var primes = {\n k256: null,\n p224: null,\n p192: null,\n p25519: null,\n };\n function MPrime(name, p) {\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 (this.tmp = this._tmp());\n }\n (MPrime.prototype._tmp = function () {\n var tmp = new BN(null);\n return (tmp.words = new Array(Math.ceil(this.n / 13))), tmp;\n }),\n (MPrime.prototype.ireduce = function (num) {\n var r = num,\n rlen;\n do this.split(r, this.tmp), (r = this.imulK(r)), (r = r.iadd(this.tmp)), (rlen = r.bitLength());\n while (rlen > this.n);\n var cmp = rlen < this.n ? -1 : r.ucmp(this.p);\n return (\n cmp === 0\n ? ((r.words[0] = 0), (r.length = 1))\n : cmp > 0\n ? r.isub(this.p)\n : r.strip !== void 0\n ? r.strip()\n : r._strip(),\n r\n );\n }),\n (MPrime.prototype.split = function (input, out) {\n input.iushrn(this.n, 0, out);\n }),\n (MPrime.prototype.imulK = function (num) {\n return num.imul(this.k);\n });\n function K256() {\n MPrime.call(this, \"k256\", \"ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f\");\n }\n inherits(K256, MPrime),\n (K256.prototype.split = function (input, output) {\n for (var mask = 4194303, outLen = Math.min(input.length, 9), i = 0; i < outLen; i++)\n output.words[i] = input.words[i];\n if (((output.length = outLen), input.length <= 9)) {\n (input.words[0] = 0), (input.length = 1);\n return;\n }\n var prev = input.words[9];\n for (output.words[output.length++] = prev & mask, i = 10; i < input.length; i++) {\n var next = input.words[i] | 0;\n (input.words[i - 10] = ((next & mask) << 4) | (prev >>> 22)), (prev = next);\n }\n (prev >>>= 22),\n (input.words[i - 10] = prev),\n prev === 0 && input.length > 10 ? (input.length -= 10) : (input.length -= 9);\n }),\n (K256.prototype.imulK = function (num) {\n (num.words[num.length] = 0), (num.words[num.length + 1] = 0), (num.length += 2);\n for (var lo = 0, i = 0; i < num.length; i++) {\n var w = num.words[i] | 0;\n (lo += w * 977), (num.words[i] = lo & 67108863), (lo = w * 64 + ((lo / 67108864) | 0));\n }\n return (\n num.words[num.length - 1] === 0 && (num.length--, num.words[num.length - 1] === 0 && num.length--), num\n );\n });\n function P224() {\n MPrime.call(this, \"p224\", \"ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001\");\n }\n inherits(P224, MPrime);\n function P192() {\n MPrime.call(this, \"p192\", \"ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff\");\n }\n inherits(P192, MPrime);\n function P25519() {\n MPrime.call(this, \"25519\", \"7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed\");\n }\n inherits(P25519, MPrime),\n (P25519.prototype.imulK = function (num) {\n for (var carry = 0, i = 0; i < num.length; i++) {\n var hi = (num.words[i] | 0) * 19 + carry,\n lo = hi & 67108863;\n (hi >>>= 26), (num.words[i] = lo), (carry = hi);\n }\n return carry !== 0 && (num.words[num.length++] = carry), num;\n }),\n (BN._prime = function (name) {\n if (primes[name]) return primes[name];\n var prime2;\n if (name === \"k256\") prime2 = new K256();\n else if (name === \"p224\") prime2 = new P224();\n else if (name === \"p192\") prime2 = new P192();\n else if (name === \"p25519\") prime2 = new P25519();\n else throw new Error(\"Unknown prime \" + name);\n return (primes[name] = prime2), prime2;\n });\n function Red(m) {\n if (typeof m == \"string\") {\n var prime = BN._prime(m);\n (this.m = prime.p), (this.prime = prime);\n } else assert(m.gtn(1), \"modulus must be greater than 1\"), (this.m = m), (this.prime = null);\n }\n (Red.prototype._verify1 = function (a) {\n assert(a.negative === 0, \"red works only with positives\"), assert(a.red, \"red works only with red numbers\");\n }),\n (Red.prototype._verify2 = function (a, b) {\n assert((a.negative | b.negative) === 0, \"red works only with positives\"),\n assert(a.red && a.red === b.red, \"red works only with red numbers\");\n }),\n (Red.prototype.imod = function (a) {\n return this.prime ? this.prime.ireduce(a)._forceRed(this) : a.umod(this.m)._forceRed(this);\n }),\n (Red.prototype.neg = function (a) {\n return a.isZero() ? a.clone() : this.m.sub(a)._forceRed(this);\n }),\n (Red.prototype.add = function (a, b) {\n this._verify2(a, b);\n var res = a.add(b);\n return res.cmp(this.m) >= 0 && res.isub(this.m), res._forceRed(this);\n }),\n (Red.prototype.iadd = function (a, b) {\n this._verify2(a, b);\n var res = a.iadd(b);\n return res.cmp(this.m) >= 0 && res.isub(this.m), res;\n }),\n (Red.prototype.sub = function (a, b) {\n this._verify2(a, b);\n var res = a.sub(b);\n return res.cmpn(0) < 0 && res.iadd(this.m), res._forceRed(this);\n }),\n (Red.prototype.isub = function (a, b) {\n this._verify2(a, b);\n var res = a.isub(b);\n return res.cmpn(0) < 0 && res.iadd(this.m), res;\n }),\n (Red.prototype.shl = function (a, num) {\n return this._verify1(a), this.imod(a.ushln(num));\n }),\n (Red.prototype.imul = function (a, b) {\n return this._verify2(a, b), this.imod(a.imul(b));\n }),\n (Red.prototype.mul = function (a, b) {\n return this._verify2(a, b), this.imod(a.mul(b));\n }),\n (Red.prototype.isqr = function (a) {\n return this.imul(a, a.clone());\n }),\n (Red.prototype.sqr = function (a) {\n return this.mul(a, a);\n }),\n (Red.prototype.sqrt = function (a) {\n if (a.isZero()) return a.clone();\n var mod3 = this.m.andln(3);\n if ((assert(mod3 % 2 === 1), mod3 === 3)) {\n var pow = this.m.add(new BN(1)).iushrn(2);\n return this.pow(a, pow);\n }\n for (var q = this.m.subn(1), s = 0; !q.isZero() && q.andln(1) === 0; ) s++, q.iushrn(1);\n assert(!q.isZero());\n var one = new BN(1).toRed(this),\n nOne = one.redNeg(),\n lpow = this.m.subn(1).iushrn(1),\n z = this.m.bitLength();\n for (z = new BN(2 * z * z).toRed(this); this.pow(z, lpow).cmp(nOne) !== 0; ) z.redIAdd(nOne);\n for (\n var c = this.pow(z, q), r = this.pow(a, q.addn(1).iushrn(1)), t = this.pow(a, q), m = s;\n t.cmp(one) !== 0;\n\n ) {\n for (var tmp = t, i = 0; tmp.cmp(one) !== 0; i++) tmp = tmp.redSqr();\n assert(i < m);\n var b = this.pow(c, new BN(1).iushln(m - i - 1));\n (r = r.redMul(b)), (c = b.redSqr()), (t = t.redMul(c)), (m = i);\n }\n return r;\n }),\n (Red.prototype.invm = function (a) {\n var inv = a._invmp(this.m);\n return inv.negative !== 0 ? ((inv.negative = 0), this.imod(inv).redNeg()) : this.imod(inv);\n }),\n (Red.prototype.pow = function (a, num) {\n if (num.isZero()) return new BN(1).toRed(this);\n if (num.cmpn(1) === 0) return a.clone();\n var windowSize = 4,\n wnd = new Array(1 << windowSize);\n (wnd[0] = new BN(1).toRed(this)), (wnd[1] = a);\n for (var i = 2; i < wnd.length; i++) wnd[i] = this.mul(wnd[i - 1], a);\n var res = wnd[0],\n current = 0,\n currentLen = 0,\n start = num.bitLength() % 26;\n for (start === 0 && (start = 26), i = num.length - 1; i >= 0; i--) {\n for (var word = num.words[i], j = start - 1; j >= 0; j--) {\n var bit = (word >> j) & 1;\n if ((res !== wnd[0] && (res = this.sqr(res)), bit === 0 && current === 0)) {\n currentLen = 0;\n continue;\n }\n (current <<= 1),\n (current |= bit),\n currentLen++,\n !(currentLen !== windowSize && (i !== 0 || j !== 0)) &&\n ((res = this.mul(res, wnd[current])), (currentLen = 0), (current = 0));\n }\n start = 26;\n }\n return res;\n }),\n (Red.prototype.convertTo = function (num) {\n var r = num.umod(this.m);\n return r === num ? r.clone() : r;\n }),\n (Red.prototype.convertFrom = function (num) {\n var res = num.clone();\n return (res.red = null), res;\n }),\n (BN.mont = function (num) {\n return new Mont(num);\n });\n function Mont(m) {\n Red.call(this, m),\n (this.shift = this.m.bitLength()),\n this.shift % 26 !== 0 && (this.shift += 26 - (this.shift % 26)),\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 (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 (Mont.prototype.convertTo = function (num) {\n return this.imod(num.ushln(this.shift));\n }),\n (Mont.prototype.convertFrom = function (num) {\n var r = this.imod(num.mul(this.rinv));\n return (r.red = null), r;\n }),\n (Mont.prototype.imul = function (a, b) {\n if (a.isZero() || b.isZero()) return (a.words[0] = 0), (a.length = 1), a;\n var t = a.imul(b),\n c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m),\n u = t.isub(c).iushrn(this.shift),\n res = u;\n return (\n u.cmp(this.m) >= 0 ? (res = u.isub(this.m)) : u.cmpn(0) < 0 && (res = u.iadd(this.m)), res._forceRed(this)\n );\n }),\n (Mont.prototype.mul = function (a, b) {\n if (a.isZero() || b.isZero()) return new BN(0)._forceRed(this);\n var t = a.mul(b),\n c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m),\n u = t.isub(c).iushrn(this.shift),\n res = u;\n return (\n u.cmp(this.m) >= 0 ? (res = u.isub(this.m)) : u.cmpn(0) < 0 && (res = u.iadd(this.m)), res._forceRed(this)\n );\n }),\n (Mont.prototype.invm = function (a) {\n var res = this.imod(a._invmp(this.m).mul(this.r2));\n return res._forceRed(this);\n });\n })(typeof module > \"u\" || module, exports);\n },\n});\n\n// (disabled):node_modules/crypto-browserify/index.js\nvar require_crypto_browserify = __commonJS({\n \"(disabled):node_modules/crypto-browserify/index.js\"() {},\n});\n\n// node_modules/brorand/index.js\nvar require_brorand = __commonJS({\n \"node_modules/brorand/index.js\"(exports, module) {\n var r;\n module.exports = function (len) {\n return r || (r = new Rand(null)), r.generate(len);\n };\n function Rand(rand) {\n this.rand = rand;\n }\n module.exports.Rand = Rand;\n Rand.prototype.generate = function (len) {\n return this._rand(len);\n };\n Rand.prototype._rand = function (n) {\n var out = new Buffer(n);\n crypto.getRandomValues(out);\n return out;\n };\n },\n});\n\n// node_modules/miller-rabin/lib/mr.js\nvar require_mr = __commonJS({\n \"node_modules/miller-rabin/lib/mr.js\"(exports, module) {\n var bn = require_bn2(),\n brorand = require_brorand();\n function MillerRabin(rand) {\n this.rand = rand || new brorand.Rand();\n }\n module.exports = MillerRabin;\n MillerRabin.create = function (rand) {\n return new MillerRabin(rand);\n };\n MillerRabin.prototype._randbelow = function (n) {\n var len = n.bitLength(),\n min_bytes = Math.ceil(len / 8);\n do var a = new bn(this.rand.generate(min_bytes));\n while (a.cmp(n) >= 0);\n return a;\n };\n MillerRabin.prototype._randrange = function (start, stop) {\n var size = stop.sub(start);\n return start.add(this._randbelow(size));\n };\n MillerRabin.prototype.test = function (n, k, cb) {\n var len = n.bitLength(),\n red = bn.mont(n),\n rone = new bn(1).toRed(red);\n k || (k = Math.max(1, (len / 48) | 0));\n for (var n1 = n.subn(1), s = 0; !n1.testn(s); s++);\n for (var d = n.shrn(s), rn1 = n1.toRed(red), prime = !0; k > 0; k--) {\n var a = this._randrange(new bn(2), n1);\n cb && cb(a);\n var x = a.toRed(red).redPow(d);\n if (!(x.cmp(rone) === 0 || x.cmp(rn1) === 0)) {\n for (var i = 1; i < s; i++) {\n if (((x = x.redSqr()), x.cmp(rone) === 0)) return !1;\n if (x.cmp(rn1) === 0) break;\n }\n if (i === s) return !1;\n }\n }\n return prime;\n };\n MillerRabin.prototype.getDivisor = function (n, k) {\n var len = n.bitLength(),\n red = bn.mont(n),\n rone = new bn(1).toRed(red);\n k || (k = Math.max(1, (len / 48) | 0));\n for (var n1 = n.subn(1), s = 0; !n1.testn(s); s++);\n for (var d = n.shrn(s), rn1 = n1.toRed(red); k > 0; k--) {\n var a = this._randrange(new bn(2), n1),\n g = n.gcd(a);\n if (g.cmpn(1) !== 0) return g;\n var x = a.toRed(red).redPow(d);\n if (!(x.cmp(rone) === 0 || x.cmp(rn1) === 0)) {\n for (var i = 1; i < s; i++) {\n if (((x = x.redSqr()), x.cmp(rone) === 0)) return x.fromRed().subn(1).gcd(n);\n if (x.cmp(rn1) === 0) break;\n }\n if (i === s) return (x = x.redSqr()), x.fromRed().subn(1).gcd(n);\n }\n }\n return !1;\n };\n },\n});\n\n// node_modules/diffie-hellman/lib/generatePrime.js\nvar require_generatePrime = __commonJS({\n \"node_modules/diffie-hellman/lib/generatePrime.js\"(exports, module) {\n var randomBytes = require_browser();\n module.exports = findPrime;\n findPrime.simpleSieve = simpleSieve;\n findPrime.fermatTest = fermatTest;\n var BN = require_bn(),\n TWENTYFOUR = new BN(24),\n MillerRabin = require_mr(),\n millerRabin = new MillerRabin(),\n ONE = new BN(1),\n TWO = new BN(2),\n FIVE = new BN(5),\n SIXTEEN = new BN(16),\n EIGHT = new BN(8),\n TEN = new BN(10),\n THREE = new BN(3),\n SEVEN = new BN(7),\n ELEVEN = new BN(11),\n FOUR = new BN(4),\n TWELVE = new BN(12),\n primes = null;\n function _getPrimes() {\n if (primes !== null) return primes;\n var limit = 1048576,\n res = [];\n res[0] = 2;\n for (var i = 1, k = 3; k < limit; k += 2) {\n for (var sqrt = Math.ceil(Math.sqrt(k)), j = 0; j < i && res[j] <= sqrt && k % res[j] !== 0; j++);\n (i !== j && res[j] <= sqrt) || (res[i++] = k);\n }\n return (primes = res), res;\n }\n function simpleSieve(p) {\n for (var primes2 = _getPrimes(), i = 0; i < primes2.length; i++)\n if (p.modn(primes2[i]) === 0) return p.cmpn(primes2[i]) === 0;\n return !0;\n }\n function fermatTest(p) {\n var red = BN.mont(p);\n return TWO.toRed(red).redPow(p.subn(1)).fromRed().cmpn(1) === 0;\n }\n function findPrime(bits, gen) {\n if (bits < 16) return gen === 2 || gen === 5 ? new BN([140, 123]) : new BN([140, 39]);\n gen = new BN(gen);\n for (var num, n2; ; ) {\n for (num = new BN(randomBytes(Math.ceil(bits / 8))); num.bitLength() > bits; ) num.ishrn(1);\n if ((num.isEven() && num.iadd(ONE), num.testn(1) || num.iadd(TWO), gen.cmp(TWO))) {\n if (!gen.cmp(FIVE)) for (; num.mod(TEN).cmp(THREE); ) num.iadd(FOUR);\n } else for (; num.mod(TWENTYFOUR).cmp(ELEVEN); ) num.iadd(FOUR);\n if (\n ((n2 = num.shrn(1)),\n simpleSieve(n2) &&\n simpleSieve(num) &&\n fermatTest(n2) &&\n fermatTest(num) &&\n millerRabin.test(n2) &&\n millerRabin.test(num))\n )\n return num;\n }\n }\n },\n});\n\n// node_modules/diffie-hellman/lib/primes.json\nvar require_primes = __commonJS({\n \"node_modules/diffie-hellman/lib/primes.json\"(exports, module) {\n module.exports = {\n modp1: {\n gen: \"02\",\n prime:\n \"ffffffffffffffffc90fdaa22168c234c4c6628b80dc1cd129024e088a67cc74020bbea63b139b22514a08798e3404ddef9519b3cd3a431b302b0a6df25f14374fe1356d6d51c245e485b576625e7ec6f44c42e9a63a3620ffffffffffffffff\",\n },\n modp2: {\n gen: \"02\",\n prime:\n \"ffffffffffffffffc90fdaa22168c234c4c6628b80dc1cd129024e088a67cc74020bbea63b139b22514a08798e3404ddef9519b3cd3a431b302b0a6df25f14374fe1356d6d51c245e485b576625e7ec6f44c42e9a637ed6b0bff5cb6f406b7edee386bfb5a899fa5ae9f24117c4b1fe649286651ece65381ffffffffffffffff\",\n },\n modp5: {\n gen: \"02\",\n prime:\n \"ffffffffffffffffc90fdaa22168c234c4c6628b80dc1cd129024e088a67cc74020bbea63b139b22514a08798e3404ddef9519b3cd3a431b302b0a6df25f14374fe1356d6d51c245e485b576625e7ec6f44c42e9a637ed6b0bff5cb6f406b7edee386bfb5a899fa5ae9f24117c4b1fe649286651ece45b3dc2007cb8a163bf0598da48361c55d39a69163fa8fd24cf5f83655d23dca3ad961c62f356208552bb9ed529077096966d670c354e4abc9804f1746c08ca237327ffffffffffffffff\",\n },\n modp14: {\n gen: \"02\",\n prime:\n \"ffffffffffffffffc90fdaa22168c234c4c6628b80dc1cd129024e088a67cc74020bbea63b139b22514a08798e3404ddef9519b3cd3a431b302b0a6df25f14374fe1356d6d51c245e485b576625e7ec6f44c42e9a637ed6b0bff5cb6f406b7edee386bfb5a899fa5ae9f24117c4b1fe649286651ece45b3dc2007cb8a163bf0598da48361c55d39a69163fa8fd24cf5f83655d23dca3ad961c62f356208552bb9ed529077096966d670c354e4abc9804f1746c08ca18217c32905e462e36ce3be39e772c180e86039b2783a2ec07a28fb5c55df06f4c52c9de2bcbf6955817183995497cea956ae515d2261898fa051015728e5a8aacaa68ffffffffffffffff\",\n },\n modp15: {\n gen: \"02\",\n prime:\n \"ffffffffffffffffc90fdaa22168c234c4c6628b80dc1cd129024e088a67cc74020bbea63b139b22514a08798e3404ddef9519b3cd3a431b302b0a6df25f14374fe1356d6d51c245e485b576625e7ec6f44c42e9a637ed6b0bff5cb6f406b7edee386bfb5a899fa5ae9f24117c4b1fe649286651ece45b3dc2007cb8a163bf0598da48361c55d39a69163fa8fd24cf5f83655d23dca3ad961c62f356208552bb9ed529077096966d670c354e4abc9804f1746c08ca18217c32905e462e36ce3be39e772c180e86039b2783a2ec07a28fb5c55df06f4c52c9de2bcbf6955817183995497cea956ae515d2261898fa051015728e5a8aaac42dad33170d04507a33a85521abdf1cba64ecfb850458dbef0a8aea71575d060c7db3970f85a6e1e4c7abf5ae8cdb0933d71e8c94e04a25619dcee3d2261ad2ee6bf12ffa06d98a0864d87602733ec86a64521f2b18177b200cbbe117577a615d6c770988c0bad946e208e24fa074e5ab3143db5bfce0fd108e4b82d120a93ad2caffffffffffffffff\",\n },\n modp16: {\n gen: \"02\",\n prime:\n \"ffffffffffffffffc90fdaa22168c234c4c6628b80dc1cd129024e088a67cc74020bbea63b139b22514a08798e3404ddef9519b3cd3a431b302b0a6df25f14374fe1356d6d51c245e485b576625e7ec6f44c42e9a637ed6b0bff5cb6f406b7edee386bfb5a899fa5ae9f24117c4b1fe649286651ece45b3dc2007cb8a163bf0598da48361c55d39a69163fa8fd24cf5f83655d23dca3ad961c62f356208552bb9ed529077096966d670c354e4abc9804f1746c08ca18217c32905e462e36ce3be39e772c180e86039b2783a2ec07a28fb5c55df06f4c52c9de2bcbf6955817183995497cea956ae515d2261898fa051015728e5a8aaac42dad33170d04507a33a85521abdf1cba64ecfb850458dbef0a8aea71575d060c7db3970f85a6e1e4c7abf5ae8cdb0933d71e8c94e04a25619dcee3d2261ad2ee6bf12ffa06d98a0864d87602733ec86a64521f2b18177b200cbbe117577a615d6c770988c0bad946e208e24fa074e5ab3143db5bfce0fd108e4b82d120a92108011a723c12a787e6d788719a10bdba5b2699c327186af4e23c1a946834b6150bda2583e9ca2ad44ce8dbbbc2db04de8ef92e8efc141fbecaa6287c59474e6bc05d99b2964fa090c3a2233ba186515be7ed1f612970cee2d7afb81bdd762170481cd0069127d5b05aa993b4ea988d8fddc186ffb7dc90a6c08f4df435c934063199ffffffffffffffff\",\n },\n modp17: {\n gen: \"02\",\n prime:\n \"ffffffffffffffffc90fdaa22168c234c4c6628b80dc1cd129024e088a67cc74020bbea63b139b22514a08798e3404ddef9519b3cd3a431b302b0a6df25f14374fe1356d6d51c245e485b576625e7ec6f44c42e9a637ed6b0bff5cb6f406b7edee386bfb5a899fa5ae9f24117c4b1fe649286651ece45b3dc2007cb8a163bf0598da48361c55d39a69163fa8fd24cf5f83655d23dca3ad961c62f356208552bb9ed529077096966d670c354e4abc9804f1746c08ca18217c32905e462e36ce3be39e772c180e86039b2783a2ec07a28fb5c55df06f4c52c9de2bcbf6955817183995497cea956ae515d2261898fa051015728e5a8aaac42dad33170d04507a33a85521abdf1cba64ecfb850458dbef0a8aea71575d060c7db3970f85a6e1e4c7abf5ae8cdb0933d71e8c94e04a25619dcee3d2261ad2ee6bf12ffa06d98a0864d87602733ec86a64521f2b18177b200cbbe117577a615d6c770988c0bad946e208e24fa074e5ab3143db5bfce0fd108e4b82d120a92108011a723c12a787e6d788719a10bdba5b2699c327186af4e23c1a946834b6150bda2583e9ca2ad44ce8dbbbc2db04de8ef92e8efc141fbecaa6287c59474e6bc05d99b2964fa090c3a2233ba186515be7ed1f612970cee2d7afb81bdd762170481cd0069127d5b05aa993b4ea988d8fddc186ffb7dc90a6c08f4df435c93402849236c3fab4d27c7026c1d4dcb2602646dec9751e763dba37bdf8ff9406ad9e530ee5db382f413001aeb06a53ed9027d831179727b0865a8918da3edbebcf9b14ed44ce6cbaced4bb1bdb7f1447e6cc254b332051512bd7af426fb8f401378cd2bf5983ca01c64b92ecf032ea15d1721d03f482d7ce6e74fef6d55e702f46980c82b5a84031900b1c9e59e7c97fbec7e8f323a97a7e36cc88be0f1d45b7ff585ac54bd407b22b4154aacc8f6d7ebf48e1d814cc5ed20f8037e0a79715eef29be32806a1d58bb7c5da76f550aa3d8a1fbff0eb19ccb1a313d55cda56c9ec2ef29632387fe8d76e3c0468043e8f663f4860ee12bf2d5b0b7474d6e694f91e6dcc4024ffffffffffffffff\",\n },\n modp18: {\n gen: \"02\",\n prime:\n \"ffffffffffffffffc90fdaa22168c234c4c6628b80dc1cd129024e088a67cc74020bbea63b139b22514a08798e3404ddef9519b3cd3a431b302b0a6df25f14374fe1356d6d51c245e485b576625e7ec6f44c42e9a637ed6b0bff5cb6f406b7edee386bfb5a899fa5ae9f24117c4b1fe649286651ece45b3dc2007cb8a163bf0598da48361c55d39a69163fa8fd24cf5f83655d23dca3ad961c62f356208552bb9ed529077096966d670c354e4abc9804f1746c08ca18217c32905e462e36ce3be39e772c180e86039b2783a2ec07a28fb5c55df06f4c52c9de2bcbf6955817183995497cea956ae515d2261898fa051015728e5a8aaac42dad33170d04507a33a85521abdf1cba64ecfb850458dbef0a8aea71575d060c7db3970f85a6e1e4c7abf5ae8cdb0933d71e8c94e04a25619dcee3d2261ad2ee6bf12ffa06d98a0864d87602733ec86a64521f2b18177b200cbbe117577a615d6c770988c0bad946e208e24fa074e5ab3143db5bfce0fd108e4b82d120a92108011a723c12a787e6d788719a10bdba5b2699c327186af4e23c1a946834b6150bda2583e9ca2ad44ce8dbbbc2db04de8ef92e8efc141fbecaa6287c59474e6bc05d99b2964fa090c3a2233ba186515be7ed1f612970cee2d7afb81bdd762170481cd0069127d5b05aa993b4ea988d8fddc186ffb7dc90a6c08f4df435c93402849236c3fab4d27c7026c1d4dcb2602646dec9751e763dba37bdf8ff9406ad9e530ee5db382f413001aeb06a53ed9027d831179727b0865a8918da3edbebcf9b14ed44ce6cbaced4bb1bdb7f1447e6cc254b332051512bd7af426fb8f401378cd2bf5983ca01c64b92ecf032ea15d1721d03f482d7ce6e74fef6d55e702f46980c82b5a84031900b1c9e59e7c97fbec7e8f323a97a7e36cc88be0f1d45b7ff585ac54bd407b22b4154aacc8f6d7ebf48e1d814cc5ed20f8037e0a79715eef29be32806a1d58bb7c5da76f550aa3d8a1fbff0eb19ccb1a313d55cda56c9ec2ef29632387fe8d76e3c0468043e8f663f4860ee12bf2d5b0b7474d6e694f91e6dbe115974a3926f12fee5e438777cb6a932df8cd8bec4d073b931ba3bc832b68d9dd300741fa7bf8afc47ed2576f6936ba424663aab639c5ae4f5683423b4742bf1c978238f16cbe39d652de3fdb8befc848ad922222e04a4037c0713eb57a81a23f0c73473fc646cea306b4bcbc8862f8385ddfa9d4b7fa2c087e879683303ed5bdd3a062b3cf5b3a278a66d2a13f83f44f82ddf310ee074ab6a364597e899a0255dc164f31cc50846851df9ab48195ded7ea1b1d510bd7ee74d73faf36bc31ecfa268359046f4eb879f924009438b481c6cd7889a002ed5ee382bc9190da6fc026e479558e4475677e9aa9e3050e2765694dfc81f56e880b96e7160c980dd98edd3dfffffffffffffffff\",\n },\n };\n },\n});\n\n// node_modules/diffie-hellman/lib/dh.js\nvar require_dh = __commonJS({\n \"node_modules/diffie-hellman/lib/dh.js\"(exports, module) {\n var BN = require_bn(),\n MillerRabin = require_mr(),\n millerRabin = new MillerRabin(),\n TWENTYFOUR = new BN(24),\n ELEVEN = new BN(11),\n TEN = new BN(10),\n THREE = new BN(3),\n SEVEN = new BN(7),\n primes = require_generatePrime(),\n randomBytes = require_browser();\n module.exports = DH;\n function setPublicKey(pub, enc) {\n return (\n (enc = enc || \"utf8\"), Buffer.isBuffer(pub) || (pub = new Buffer(pub, enc)), (this._pub = new BN(pub)), this\n );\n }\n function setPrivateKey(priv, enc) {\n return (\n (enc = enc || \"utf8\"),\n Buffer.isBuffer(priv) || (priv = new Buffer(priv, enc)),\n (this._priv = new BN(priv)),\n this\n );\n }\n var primeCache = {};\n function checkPrime(prime, generator) {\n var gen = generator.toString(\"hex\"),\n hex = [gen, prime.toString(16)].join(\"_\");\n if (hex in primeCache) return primeCache[hex];\n var error = 0;\n if (prime.isEven() || !primes.simpleSieve || !primes.fermatTest(prime) || !millerRabin.test(prime))\n return (\n (error += 1), gen === \"02\" || gen === \"05\" ? (error += 8) : (error += 4), (primeCache[hex] = error), error\n );\n millerRabin.test(prime.shrn(1)) || (error += 2);\n var rem;\n switch (gen) {\n case \"02\":\n prime.mod(TWENTYFOUR).cmp(ELEVEN) && (error += 8);\n break;\n case \"05\":\n (rem = prime.mod(TEN)), rem.cmp(THREE) && rem.cmp(SEVEN) && (error += 8);\n break;\n default:\n error += 4;\n }\n return (primeCache[hex] = error), error;\n }\n function DH(prime, generator, malleable) {\n this.setGenerator(generator),\n (this.__prime = new BN(prime)),\n (this._prime = BN.mont(this.__prime)),\n (this._primeLen = prime.length),\n (this._pub = void 0),\n (this._priv = void 0),\n (this._primeCode = void 0),\n malleable ? ((this.setPublicKey = setPublicKey), (this.setPrivateKey = setPrivateKey)) : (this._primeCode = 8);\n }\n Object.defineProperty(DH.prototype, \"verifyError\", {\n enumerable: !0,\n get: function () {\n return (\n typeof this._primeCode != \"number\" && (this._primeCode = checkPrime(this.__prime, this.__gen)),\n this._primeCode\n );\n },\n });\n DH.prototype.generateKeys = function () {\n return (\n this._priv || (this._priv = new BN(randomBytes(this._primeLen))),\n (this._pub = this._gen.toRed(this._prime).redPow(this._priv).fromRed()),\n this.getPublicKey()\n );\n };\n DH.prototype.computeSecret = function (other) {\n (other = new BN(other)), (other = other.toRed(this._prime));\n var secret = other.redPow(this._priv).fromRed(),\n out = new Buffer(secret.toArray()),\n prime = this.getPrime();\n if (out.length < prime.length) {\n var front = new Buffer(prime.length - out.length);\n front.fill(0), (out = Buffer.concat([front, out]));\n }\n return out;\n };\n DH.prototype.getPublicKey = function (enc) {\n return formatReturnValue(this._pub, enc);\n };\n DH.prototype.getPrivateKey = function (enc) {\n return formatReturnValue(this._priv, enc);\n };\n DH.prototype.getPrime = function (enc) {\n return formatReturnValue(this.__prime, enc);\n };\n DH.prototype.getGenerator = function (enc) {\n return formatReturnValue(this._gen, enc);\n };\n DH.prototype.setGenerator = function (gen, enc) {\n return (\n (enc = enc || \"utf8\"),\n Buffer.isBuffer(gen) || (gen = new Buffer(gen, enc)),\n (this.__gen = gen),\n (this._gen = new BN(gen)),\n this\n );\n };\n function formatReturnValue(bn, enc) {\n var buf = new Buffer(bn.toArray());\n return enc ? buf.toString(enc) : buf;\n }\n },\n});\n\n// node_modules/diffie-hellman/browser.js\nvar require_browser7 = __commonJS({\n \"node_modules/diffie-hellman/browser.js\"(exports) {\n var generatePrime = require_generatePrime(),\n primes = require_primes(),\n DH = require_dh();\n function getDiffieHellman(mod) {\n var prime = new Buffer(primes[mod].prime, \"hex\"),\n gen = new Buffer(primes[mod].gen, \"hex\");\n return new DH(prime, gen);\n }\n var ENCODINGS = {\n binary: !0,\n hex: !0,\n base64: !0,\n };\n function createDiffieHellman(prime, enc, generator, genc) {\n return Buffer.isBuffer(enc) || ENCODINGS[enc] === void 0\n ? createDiffieHellman(prime, \"binary\", enc, generator)\n : ((enc = enc || \"binary\"),\n (genc = genc || \"binary\"),\n (generator = generator || new Buffer([2])),\n Buffer.isBuffer(generator) || (generator = new Buffer(generator, genc)),\n typeof prime == \"number\"\n ? new DH(generatePrime(prime, generator), generator, !0)\n : (Buffer.isBuffer(prime) || (prime = new Buffer(prime, enc)), new DH(prime, generator, !0)));\n }\n exports.DiffieHellmanGroup = exports.createDiffieHellmanGroup = exports.getDiffieHellman = getDiffieHellman;\n exports.createDiffieHellman = exports.DiffieHellman = createDiffieHellman;\n },\n});\n\n// node_modules/bn.js/lib/bn.js\nvar require_bn3 = __commonJS({\n \"node_modules/bn.js/lib/bn.js\"(exports, module) {\n (function (module2, exports2) {\n \"use strict\";\n function assert(val, msg) {\n if (!val) throw new Error(msg || \"Assertion failed\");\n }\n function inherits(ctor, superCtor) {\n ctor.super_ = superCtor;\n var TempCtor = function () {};\n (TempCtor.prototype = superCtor.prototype),\n (ctor.prototype = new TempCtor()),\n (ctor.prototype.constructor = ctor);\n }\n function BN(number, base, endian) {\n if (BN.isBN(number)) return number;\n (this.negative = 0),\n (this.words = null),\n (this.length = 0),\n (this.red = null),\n number !== null &&\n ((base === \"le\" || base === \"be\") && ((endian = base), (base = 10)),\n this._init(number || 0, base || 10, endian || \"be\"));\n }\n typeof module2 == \"object\" ? (module2.exports = BN) : (exports2.BN = BN), (BN.BN = BN), (BN.wordSize = 26);\n var Buffer2;\n try {\n typeof window < \"u\" && typeof window.Buffer < \"u\"\n ? (Buffer2 = window.Buffer)\n : (Buffer2 = __require(\"buffer\").Buffer);\n } catch {}\n (BN.isBN = function (num) {\n return num instanceof BN\n ? !0\n : num !== null &&\n typeof num == \"object\" &&\n num.constructor.wordSize === BN.wordSize &&\n Array.isArray(num.words);\n }),\n (BN.max = function (left, right) {\n return left.cmp(right) > 0 ? left : right;\n }),\n (BN.min = function (left, right) {\n return left.cmp(right) < 0 ? left : right;\n }),\n (BN.prototype._init = function (number, base, endian) {\n if (typeof number == \"number\") return this._initNumber(number, base, endian);\n if (typeof number == \"object\") return this._initArray(number, base, endian);\n base === \"hex\" && (base = 16),\n assert(base === (base | 0) && base >= 2 && base <= 36),\n (number = number.toString().replace(/\\s+/g, \"\"));\n var start = 0;\n number[0] === \"-\" && (start++, (this.negative = 1)),\n start < number.length &&\n (base === 16\n ? this._parseHex(number, start, endian)\n : (this._parseBase(number, base, start),\n endian === \"le\" && this._initArray(this.toArray(), base, endian)));\n }),\n (BN.prototype._initNumber = function (number, base, endian) {\n number < 0 && ((this.negative = 1), (number = -number)),\n number < 67108864\n ? ((this.words = [number & 67108863]), (this.length = 1))\n : number < 4503599627370496\n ? ((this.words = [number & 67108863, (number / 67108864) & 67108863]), (this.length = 2))\n : (assert(number < 9007199254740992),\n (this.words = [number & 67108863, (number / 67108864) & 67108863, 1]),\n (this.length = 3)),\n endian === \"le\" && this._initArray(this.toArray(), base, endian);\n }),\n (BN.prototype._initArray = function (number, base, endian) {\n if ((assert(typeof number.length == \"number\"), number.length <= 0))\n return (this.words = [0]), (this.length = 1), this;\n (this.length = Math.ceil(number.length / 3)), (this.words = new Array(this.length));\n for (var i = 0; i < this.length; i++) this.words[i] = 0;\n var j,\n w,\n off = 0;\n if (endian === \"be\")\n for (i = number.length - 1, j = 0; i >= 0; i -= 3)\n (w = number[i] | (number[i - 1] << 8) | (number[i - 2] << 16)),\n (this.words[j] |= (w << off) & 67108863),\n (this.words[j + 1] = (w >>> (26 - off)) & 67108863),\n (off += 24),\n off >= 26 && ((off -= 26), j++);\n else if (endian === \"le\")\n for (i = 0, j = 0; i < number.length; i += 3)\n (w = number[i] | (number[i + 1] << 8) | (number[i + 2] << 16)),\n (this.words[j] |= (w << off) & 67108863),\n (this.words[j + 1] = (w >>> (26 - off)) & 67108863),\n (off += 24),\n off >= 26 && ((off -= 26), j++);\n return this._strip();\n });\n function parseHex4Bits(string, index) {\n var c = string.charCodeAt(index);\n if (c >= 48 && c <= 57) return c - 48;\n if (c >= 65 && c <= 70) return c - 55;\n if (c >= 97 && c <= 102) return c - 87;\n assert(!1, \"Invalid character in \" + string);\n }\n function parseHexByte(string, lowerBound, index) {\n var r = parseHex4Bits(string, index);\n return index - 1 >= lowerBound && (r |= parseHex4Bits(string, index - 1) << 4), r;\n }\n BN.prototype._parseHex = function (number, start, endian) {\n (this.length = Math.ceil((number.length - start) / 6)), (this.words = new Array(this.length));\n for (var i = 0; i < this.length; i++) this.words[i] = 0;\n var off = 0,\n j = 0,\n w;\n if (endian === \"be\")\n for (i = number.length - 1; i >= start; i -= 2)\n (w = parseHexByte(number, start, i) << off),\n (this.words[j] |= w & 67108863),\n off >= 18 ? ((off -= 18), (j += 1), (this.words[j] |= w >>> 26)) : (off += 8);\n else {\n var parseLength = number.length - start;\n for (i = parseLength % 2 === 0 ? start + 1 : start; i < number.length; i += 2)\n (w = parseHexByte(number, start, i) << off),\n (this.words[j] |= w & 67108863),\n off >= 18 ? ((off -= 18), (j += 1), (this.words[j] |= w >>> 26)) : (off += 8);\n }\n this._strip();\n };\n function parseBase(str, start, end, mul) {\n for (var r = 0, b = 0, len = Math.min(str.length, end), i = start; i < len; i++) {\n var c = str.charCodeAt(i) - 48;\n (r *= mul),\n c >= 49 ? (b = c - 49 + 10) : c >= 17 ? (b = c - 17 + 10) : (b = c),\n assert(c >= 0 && b < mul, \"Invalid character\"),\n (r += b);\n }\n return r;\n }\n (BN.prototype._parseBase = function (number, base, start) {\n (this.words = [0]), (this.length = 1);\n for (var limbLen = 0, limbPow = 1; limbPow <= 67108863; limbPow *= base) limbLen++;\n limbLen--, (limbPow = (limbPow / base) | 0);\n for (\n var total = number.length - start,\n mod = total % limbLen,\n end = Math.min(total, total - mod) + start,\n word = 0,\n i = start;\n i < end;\n i += limbLen\n )\n (word = parseBase(number, i, i + limbLen, base)),\n this.imuln(limbPow),\n this.words[0] + word < 67108864 ? (this.words[0] += word) : this._iaddn(word);\n if (mod !== 0) {\n var pow = 1;\n for (word = parseBase(number, i, number.length, base), i = 0; i < mod; i++) pow *= base;\n this.imuln(pow), this.words[0] + word < 67108864 ? (this.words[0] += word) : this._iaddn(word);\n }\n this._strip();\n }),\n (BN.prototype.copy = function (dest) {\n dest.words = new Array(this.length);\n for (var i = 0; i < this.length; i++) dest.words[i] = this.words[i];\n (dest.length = this.length), (dest.negative = this.negative), (dest.red = this.red);\n });\n function move(dest, src) {\n (dest.words = src.words), (dest.length = src.length), (dest.negative = src.negative), (dest.red = src.red);\n }\n if (\n ((BN.prototype._move = function (dest) {\n move(dest, this);\n }),\n (BN.prototype.clone = function () {\n var r = new BN(null);\n return this.copy(r), r;\n }),\n (BN.prototype._expand = function (size) {\n for (; this.length < size; ) this.words[this.length++] = 0;\n return this;\n }),\n (BN.prototype._strip = function () {\n for (; this.length > 1 && this.words[this.length - 1] === 0; ) this.length--;\n return this._normSign();\n }),\n (BN.prototype._normSign = function () {\n return this.length === 1 && this.words[0] === 0 && (this.negative = 0), this;\n }),\n typeof Symbol < \"u\" && typeof Symbol.for == \"function\")\n )\n try {\n BN.prototype[Symbol.for(\"nodejs.util.inspect.custom\")] = inspect;\n } catch {\n BN.prototype.inspect = inspect;\n }\n else BN.prototype.inspect = inspect;\n function inspect() {\n return (this.red ? \"<BN-R: \" : \"<BN: \") + this.toString(16) + \">\";\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 groupSizes = [\n 0, 0, 25, 16, 12, 11, 10, 9, 8, 8, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5,\n 5, 5,\n ],\n groupBases = [\n 0, 0, 33554432, 43046721, 16777216, 48828125, 60466176, 40353607, 16777216, 43046721, 1e7, 19487171, 35831808,\n 62748517, 7529536, 11390625, 16777216, 24137569, 34012224, 47045881, 64e6, 4084101, 5153632, 6436343, 7962624,\n 9765625, 11881376, 14348907, 17210368, 20511149, 243e5, 28629151, 33554432, 39135393, 45435424, 52521875,\n 60466176,\n ];\n (BN.prototype.toString = function (base, padding) {\n (base = base || 10), (padding = padding | 0 || 1);\n var out;\n if (base === 16 || base === \"hex\") {\n out = \"\";\n for (var off = 0, carry = 0, i = 0; i < this.length; i++) {\n var w = this.words[i],\n word = (((w << off) | carry) & 16777215).toString(16);\n (carry = (w >>> (24 - off)) & 16777215),\n (off += 2),\n off >= 26 && ((off -= 26), i--),\n carry !== 0 || i !== this.length - 1 ? (out = zeros[6 - word.length] + word + out) : (out = word + out);\n }\n for (carry !== 0 && (out = carry.toString(16) + out); out.length % padding !== 0; ) out = \"0\" + out;\n return this.negative !== 0 && (out = \"-\" + out), out;\n }\n if (base === (base | 0) && base >= 2 && base <= 36) {\n var groupSize = groupSizes[base],\n groupBase = groupBases[base];\n out = \"\";\n var c = this.clone();\n for (c.negative = 0; !c.isZero(); ) {\n var r = c.modrn(groupBase).toString(base);\n (c = c.idivn(groupBase)), c.isZero() ? (out = r + out) : (out = zeros[groupSize - r.length] + r + out);\n }\n for (this.isZero() && (out = \"0\" + out); out.length % padding !== 0; ) out = \"0\" + out;\n return this.negative !== 0 && (out = \"-\" + out), out;\n }\n assert(!1, \"Base should be between 2 and 36\");\n }),\n (BN.prototype.toNumber = function () {\n var ret = this.words[0];\n return (\n this.length === 2\n ? (ret += this.words[1] * 67108864)\n : this.length === 3 && this.words[2] === 1\n ? (ret += 4503599627370496 + this.words[1] * 67108864)\n : this.length > 2 && assert(!1, \"Number can only safely store up to 53 bits\"),\n this.negative !== 0 ? -ret : ret\n );\n }),\n (BN.prototype.toJSON = function () {\n return this.toString(16, 2);\n }),\n Buffer2 &&\n (BN.prototype.toBuffer = function (endian, length) {\n return this.toArrayLike(Buffer2, endian, length);\n }),\n (BN.prototype.toArray = function (endian, length) {\n return this.toArrayLike(Array, endian, length);\n });\n var allocate = function (ArrayType, size) {\n return ArrayType.allocUnsafe ? ArrayType.allocUnsafe(size) : new ArrayType(size);\n };\n (BN.prototype.toArrayLike = function (ArrayType, endian, length) {\n this._strip();\n var byteLength = this.byteLength(),\n 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 var res = allocate(ArrayType, reqLength),\n postfix = endian === \"le\" ? \"LE\" : \"BE\";\n return this[\"_toArrayLike\" + postfix](res, byteLength), res;\n }),\n (BN.prototype._toArrayLikeLE = function (res, byteLength) {\n for (var position = 0, carry = 0, i = 0, shift = 0; i < this.length; i++) {\n var word = (this.words[i] << shift) | carry;\n (res[position++] = word & 255),\n position < res.length && (res[position++] = (word >> 8) & 255),\n position < res.length && (res[position++] = (word >> 16) & 255),\n shift === 6\n ? (position < res.length && (res[position++] = (word >> 24) & 255), (carry = 0), (shift = 0))\n : ((carry = word >>> 24), (shift += 2));\n }\n if (position < res.length) for (res[position++] = carry; position < res.length; ) res[position++] = 0;\n }),\n (BN.prototype._toArrayLikeBE = function (res, byteLength) {\n for (var position = res.length - 1, carry = 0, i = 0, shift = 0; i < this.length; i++) {\n var word = (this.words[i] << shift) | carry;\n (res[position--] = word & 255),\n position >= 0 && (res[position--] = (word >> 8) & 255),\n position >= 0 && (res[position--] = (word >> 16) & 255),\n shift === 6\n ? (position >= 0 && (res[position--] = (word >> 24) & 255), (carry = 0), (shift = 0))\n : ((carry = word >>> 24), (shift += 2));\n }\n if (position >= 0) for (res[position--] = carry; position >= 0; ) res[position--] = 0;\n }),\n Math.clz32\n ? (BN.prototype._countBits = function (w) {\n return 32 - Math.clz32(w);\n })\n : (BN.prototype._countBits = function (w) {\n var t = w,\n r = 0;\n return (\n t >= 4096 && ((r += 13), (t >>>= 13)),\n t >= 64 && ((r += 7), (t >>>= 7)),\n t >= 8 && ((r += 4), (t >>>= 4)),\n t >= 2 && ((r += 2), (t >>>= 2)),\n r + t\n );\n }),\n (BN.prototype._zeroBits = function (w) {\n if (w === 0) return 26;\n var t = w,\n r = 0;\n return (\n (t & 8191) === 0 && ((r += 13), (t >>>= 13)),\n (t & 127) === 0 && ((r += 7), (t >>>= 7)),\n (t & 15) === 0 && ((r += 4), (t >>>= 4)),\n (t & 3) === 0 && ((r += 2), (t >>>= 2)),\n (t & 1) === 0 && r++,\n r\n );\n }),\n (BN.prototype.bitLength = function () {\n var w = this.words[this.length - 1],\n hi = this._countBits(w);\n return (this.length - 1) * 26 + hi;\n });\n function toBitArray(num) {\n for (var w = new Array(num.bitLength()), bit = 0; bit < w.length; bit++) {\n var off = (bit / 26) | 0,\n wbit = bit % 26;\n w[bit] = (num.words[off] >>> wbit) & 1;\n }\n return w;\n }\n (BN.prototype.zeroBits = function () {\n if (this.isZero()) return 0;\n for (var r = 0, i = 0; i < this.length; i++) {\n var b = this._zeroBits(this.words[i]);\n if (((r += b), b !== 26)) break;\n }\n return r;\n }),\n (BN.prototype.byteLength = function () {\n return Math.ceil(this.bitLength() / 8);\n }),\n (BN.prototype.toTwos = function (width) {\n return this.negative !== 0 ? this.abs().inotn(width).iaddn(1) : this.clone();\n }),\n (BN.prototype.fromTwos = function (width) {\n return this.testn(width - 1) ? this.notn(width).iaddn(1).ineg() : this.clone();\n }),\n (BN.prototype.isNeg = function () {\n return this.negative !== 0;\n }),\n (BN.prototype.neg = function () {\n return this.clone().ineg();\n }),\n (BN.prototype.ineg = function () {\n return this.isZero() || (this.negative ^= 1), this;\n }),\n (BN.prototype.iuor = function (num) {\n for (; this.length < num.length; ) this.words[this.length++] = 0;\n for (var i = 0; i < num.length; i++) this.words[i] = this.words[i] | num.words[i];\n return this._strip();\n }),\n (BN.prototype.ior = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuor(num);\n }),\n (BN.prototype.or = function (num) {\n return this.length > num.length ? this.clone().ior(num) : num.clone().ior(this);\n }),\n (BN.prototype.uor = function (num) {\n return this.length > num.length ? this.clone().iuor(num) : num.clone().iuor(this);\n }),\n (BN.prototype.iuand = function (num) {\n var b;\n this.length > num.length ? (b = num) : (b = this);\n for (var i = 0; i < b.length; i++) this.words[i] = this.words[i] & num.words[i];\n return (this.length = b.length), this._strip();\n }),\n (BN.prototype.iand = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuand(num);\n }),\n (BN.prototype.and = function (num) {\n return this.length > num.length ? this.clone().iand(num) : num.clone().iand(this);\n }),\n (BN.prototype.uand = function (num) {\n return this.length > num.length ? this.clone().iuand(num) : num.clone().iuand(this);\n }),\n (BN.prototype.iuxor = function (num) {\n var a, b;\n this.length > num.length ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var i = 0; i < b.length; i++) this.words[i] = a.words[i] ^ b.words[i];\n if (this !== a) for (; i < a.length; i++) this.words[i] = a.words[i];\n return (this.length = a.length), this._strip();\n }),\n (BN.prototype.ixor = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuxor(num);\n }),\n (BN.prototype.xor = function (num) {\n return this.length > num.length ? this.clone().ixor(num) : num.clone().ixor(this);\n }),\n (BN.prototype.uxor = function (num) {\n return this.length > num.length ? this.clone().iuxor(num) : num.clone().iuxor(this);\n }),\n (BN.prototype.inotn = function (width) {\n assert(typeof width == \"number\" && width >= 0);\n var bytesNeeded = Math.ceil(width / 26) | 0,\n bitsLeft = width % 26;\n this._expand(bytesNeeded), bitsLeft > 0 && bytesNeeded--;\n for (var i = 0; i < bytesNeeded; i++) this.words[i] = ~this.words[i] & 67108863;\n return bitsLeft > 0 && (this.words[i] = ~this.words[i] & (67108863 >> (26 - bitsLeft))), this._strip();\n }),\n (BN.prototype.notn = function (width) {\n return this.clone().inotn(width);\n }),\n (BN.prototype.setn = function (bit, val) {\n assert(typeof bit == \"number\" && bit >= 0);\n var off = (bit / 26) | 0,\n wbit = bit % 26;\n return (\n this._expand(off + 1),\n val\n ? (this.words[off] = this.words[off] | (1 << wbit))\n : (this.words[off] = this.words[off] & ~(1 << wbit)),\n this._strip()\n );\n }),\n (BN.prototype.iadd = function (num) {\n var r;\n if (this.negative !== 0 && num.negative === 0)\n return (this.negative = 0), (r = this.isub(num)), (this.negative ^= 1), this._normSign();\n if (this.negative === 0 && num.negative !== 0)\n return (num.negative = 0), (r = this.isub(num)), (num.negative = 1), r._normSign();\n var a, b;\n this.length > num.length ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var carry = 0, i = 0; i < b.length; i++)\n (r = (a.words[i] | 0) + (b.words[i] | 0) + carry), (this.words[i] = r & 67108863), (carry = r >>> 26);\n for (; carry !== 0 && i < a.length; i++)\n (r = (a.words[i] | 0) + carry), (this.words[i] = r & 67108863), (carry = r >>> 26);\n if (((this.length = a.length), carry !== 0)) (this.words[this.length] = carry), this.length++;\n else if (a !== this) for (; i < a.length; i++) this.words[i] = a.words[i];\n return this;\n }),\n (BN.prototype.add = function (num) {\n var res;\n return num.negative !== 0 && this.negative === 0\n ? ((num.negative = 0), (res = this.sub(num)), (num.negative ^= 1), res)\n : num.negative === 0 && this.negative !== 0\n ? ((this.negative = 0), (res = num.sub(this)), (this.negative = 1), res)\n : this.length > num.length\n ? this.clone().iadd(num)\n : num.clone().iadd(this);\n }),\n (BN.prototype.isub = function (num) {\n if (num.negative !== 0) {\n num.negative = 0;\n var r = this.iadd(num);\n return (num.negative = 1), r._normSign();\n } else if (this.negative !== 0)\n return (this.negative = 0), this.iadd(num), (this.negative = 1), this._normSign();\n var cmp = this.cmp(num);\n if (cmp === 0) return (this.negative = 0), (this.length = 1), (this.words[0] = 0), this;\n var a, b;\n cmp > 0 ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var carry = 0, i = 0; i < b.length; i++)\n (r = (a.words[i] | 0) - (b.words[i] | 0) + carry), (carry = r >> 26), (this.words[i] = r & 67108863);\n for (; carry !== 0 && i < a.length; i++)\n (r = (a.words[i] | 0) + carry), (carry = r >> 26), (this.words[i] = r & 67108863);\n if (carry === 0 && i < a.length && a !== this) for (; i < a.length; i++) this.words[i] = a.words[i];\n return (this.length = Math.max(this.length, i)), a !== this && (this.negative = 1), this._strip();\n }),\n (BN.prototype.sub = function (num) {\n return this.clone().isub(num);\n });\n function smallMulTo(self2, num, out) {\n out.negative = num.negative ^ self2.negative;\n var len = (self2.length + num.length) | 0;\n (out.length = len), (len = (len - 1) | 0);\n var a = self2.words[0] | 0,\n b = num.words[0] | 0,\n r = a * b,\n lo = r & 67108863,\n carry = (r / 67108864) | 0;\n out.words[0] = lo;\n for (var k = 1; k < len; k++) {\n for (\n var ncarry = carry >>> 26,\n rword = carry & 67108863,\n maxJ = Math.min(k, num.length - 1),\n j = Math.max(0, k - self2.length + 1);\n j <= maxJ;\n j++\n ) {\n var i = (k - j) | 0;\n (a = self2.words[i] | 0),\n (b = num.words[j] | 0),\n (r = a * b + rword),\n (ncarry += (r / 67108864) | 0),\n (rword = r & 67108863);\n }\n (out.words[k] = rword | 0), (carry = ncarry | 0);\n }\n return carry !== 0 ? (out.words[k] = carry | 0) : out.length--, out._strip();\n }\n var comb10MulTo = function (self2, num, out) {\n var a = self2.words,\n b = num.words,\n o = out.words,\n c = 0,\n lo,\n mid,\n hi,\n a0 = a[0] | 0,\n al0 = a0 & 8191,\n ah0 = a0 >>> 13,\n a1 = a[1] | 0,\n al1 = a1 & 8191,\n ah1 = a1 >>> 13,\n a2 = a[2] | 0,\n al2 = a2 & 8191,\n ah2 = a2 >>> 13,\n a3 = a[3] | 0,\n al3 = a3 & 8191,\n ah3 = a3 >>> 13,\n a4 = a[4] | 0,\n al4 = a4 & 8191,\n ah4 = a4 >>> 13,\n a5 = a[5] | 0,\n al5 = a5 & 8191,\n ah5 = a5 >>> 13,\n a6 = a[6] | 0,\n al6 = a6 & 8191,\n ah6 = a6 >>> 13,\n a7 = a[7] | 0,\n al7 = a7 & 8191,\n ah7 = a7 >>> 13,\n a8 = a[8] | 0,\n al8 = a8 & 8191,\n ah8 = a8 >>> 13,\n a9 = a[9] | 0,\n al9 = a9 & 8191,\n ah9 = a9 >>> 13,\n b0 = b[0] | 0,\n bl0 = b0 & 8191,\n bh0 = b0 >>> 13,\n b1 = b[1] | 0,\n bl1 = b1 & 8191,\n bh1 = b1 >>> 13,\n b2 = b[2] | 0,\n bl2 = b2 & 8191,\n bh2 = b2 >>> 13,\n b3 = b[3] | 0,\n bl3 = b3 & 8191,\n bh3 = b3 >>> 13,\n b4 = b[4] | 0,\n bl4 = b4 & 8191,\n bh4 = b4 >>> 13,\n b5 = b[5] | 0,\n bl5 = b5 & 8191,\n bh5 = b5 >>> 13,\n b6 = b[6] | 0,\n bl6 = b6 & 8191,\n bh6 = b6 >>> 13,\n b7 = b[7] | 0,\n bl7 = b7 & 8191,\n bh7 = b7 >>> 13,\n b8 = b[8] | 0,\n bl8 = b8 & 8191,\n bh8 = b8 >>> 13,\n b9 = b[9] | 0,\n bl9 = b9 & 8191,\n bh9 = b9 >>> 13;\n (out.negative = self2.negative ^ num.negative),\n (out.length = 19),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w0 >>> 26)) | 0),\n (w0 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w1 >>> 26)) | 0),\n (w1 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w2 >>> 26)) | 0),\n (w2 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w3 >>> 26)) | 0),\n (w3 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w4 >>> 26)) | 0),\n (w4 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w5 >>> 26)) | 0),\n (w5 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w6 >>> 26)) | 0),\n (w6 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w7 >>> 26)) | 0),\n (w7 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w8 >>> 26)) | 0),\n (w8 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w9 >>> 26)) | 0),\n (w9 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w10 >>> 26)) | 0),\n (w10 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w11 >>> 26)) | 0),\n (w11 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w12 >>> 26)) | 0),\n (w12 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w13 >>> 26)) | 0),\n (w13 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w14 >>> 26)) | 0),\n (w14 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w15 >>> 26)) | 0),\n (w15 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w16 >>> 26)) | 0),\n (w16 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w17 >>> 26)) | 0),\n (w17 &= 67108863),\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 & 8191) << 13)) | 0;\n return (\n (c = (((hi + (mid >>> 13)) | 0) + (w18 >>> 26)) | 0),\n (w18 &= 67108863),\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 c !== 0 && ((o[19] = c), out.length++),\n out\n );\n };\n Math.imul || (comb10MulTo = smallMulTo);\n function bigMulTo(self2, num, out) {\n (out.negative = num.negative ^ self2.negative), (out.length = self2.length + num.length);\n for (var carry = 0, hncarry = 0, k = 0; k < out.length - 1; k++) {\n var ncarry = hncarry;\n hncarry = 0;\n for (\n var rword = carry & 67108863, maxJ = Math.min(k, num.length - 1), j = Math.max(0, k - self2.length + 1);\n j <= maxJ;\n j++\n ) {\n var i = k - j,\n a = self2.words[i] | 0,\n b = num.words[j] | 0,\n r = a * b,\n lo = r & 67108863;\n (ncarry = (ncarry + ((r / 67108864) | 0)) | 0),\n (lo = (lo + rword) | 0),\n (rword = lo & 67108863),\n (ncarry = (ncarry + (lo >>> 26)) | 0),\n (hncarry += ncarry >>> 26),\n (ncarry &= 67108863);\n }\n (out.words[k] = rword), (carry = ncarry), (ncarry = hncarry);\n }\n return carry !== 0 ? (out.words[k] = carry) : out.length--, out._strip();\n }\n function jumboMulTo(self2, num, out) {\n return bigMulTo(self2, num, out);\n }\n BN.prototype.mulTo = function (num, out) {\n var res,\n len = this.length + num.length;\n return (\n this.length === 10 && num.length === 10\n ? (res = comb10MulTo(this, num, out))\n : len < 63\n ? (res = smallMulTo(this, num, out))\n : len < 1024\n ? (res = bigMulTo(this, num, out))\n : (res = jumboMulTo(this, num, out)),\n res\n );\n };\n function FFTM(x, y) {\n (this.x = x), (this.y = y);\n }\n (FFTM.prototype.makeRBT = function (N) {\n for (var t = new Array(N), l = BN.prototype._countBits(N) - 1, i = 0; i < N; i++) t[i] = this.revBin(i, l, N);\n return t;\n }),\n (FFTM.prototype.revBin = function (x, l, N) {\n if (x === 0 || x === N - 1) return x;\n for (var rb = 0, i = 0; i < l; i++) (rb |= (x & 1) << (l - i - 1)), (x >>= 1);\n return rb;\n }),\n (FFTM.prototype.permute = function (rbt, rws, iws, rtws, itws, N) {\n for (var i = 0; i < N; i++) (rtws[i] = rws[rbt[i]]), (itws[i] = iws[rbt[i]]);\n }),\n (FFTM.prototype.transform = function (rws, iws, rtws, itws, N, rbt) {\n this.permute(rbt, rws, iws, rtws, itws, N);\n for (var s = 1; s < N; s <<= 1)\n for (\n var l = s << 1, rtwdf = Math.cos((2 * Math.PI) / l), itwdf = Math.sin((2 * Math.PI) / l), p = 0;\n p < N;\n p += l\n )\n for (var rtwdf_ = rtwdf, itwdf_ = itwdf, j = 0; j < s; j++) {\n var re = rtws[p + j],\n ie = itws[p + j],\n ro = rtws[p + j + s],\n io = itws[p + j + s],\n rx = rtwdf_ * ro - itwdf_ * io;\n (io = rtwdf_ * io + itwdf_ * ro),\n (ro = rx),\n (rtws[p + j] = re + ro),\n (itws[p + j] = ie + io),\n (rtws[p + j + s] = re - ro),\n (itws[p + j + s] = ie - io),\n j !== l &&\n ((rx = rtwdf * rtwdf_ - itwdf * itwdf_), (itwdf_ = rtwdf * itwdf_ + itwdf * rtwdf_), (rtwdf_ = rx));\n }\n }),\n (FFTM.prototype.guessLen13b = function (n, m) {\n var N = Math.max(m, n) | 1,\n odd = N & 1,\n i = 0;\n for (N = (N / 2) | 0; N; N = N >>> 1) i++;\n return 1 << (i + 1 + odd);\n }),\n (FFTM.prototype.conjugate = function (rws, iws, N) {\n if (!(N <= 1))\n for (var i = 0; i < N / 2; i++) {\n var t = rws[i];\n (rws[i] = rws[N - i - 1]),\n (rws[N - i - 1] = t),\n (t = iws[i]),\n (iws[i] = -iws[N - i - 1]),\n (iws[N - i - 1] = -t);\n }\n }),\n (FFTM.prototype.normalize13b = function (ws, N) {\n for (var carry = 0, i = 0; i < N / 2; i++) {\n var w = Math.round(ws[2 * i + 1] / N) * 8192 + Math.round(ws[2 * i] / N) + carry;\n (ws[i] = w & 67108863), w < 67108864 ? (carry = 0) : (carry = (w / 67108864) | 0);\n }\n return ws;\n }),\n (FFTM.prototype.convert13b = function (ws, len, rws, N) {\n for (var carry = 0, i = 0; i < len; i++)\n (carry = carry + (ws[i] | 0)),\n (rws[2 * i] = carry & 8191),\n (carry = carry >>> 13),\n (rws[2 * i + 1] = carry & 8191),\n (carry = carry >>> 13);\n for (i = 2 * len; i < N; ++i) rws[i] = 0;\n assert(carry === 0), assert((carry & -8192) === 0);\n }),\n (FFTM.prototype.stub = function (N) {\n for (var ph = new Array(N), i = 0; i < N; i++) ph[i] = 0;\n return ph;\n }),\n (FFTM.prototype.mulp = function (x, y, out) {\n var N = 2 * this.guessLen13b(x.length, y.length),\n rbt = this.makeRBT(N),\n _ = this.stub(N),\n rws = new Array(N),\n rwst = new Array(N),\n iwst = new Array(N),\n nrws = new Array(N),\n nrwst = new Array(N),\n niwst = new Array(N),\n rmws = out.words;\n (rmws.length = N),\n this.convert13b(x.words, x.length, rws, N),\n this.convert13b(y.words, y.length, nrws, N),\n this.transform(rws, _, rwst, iwst, N, rbt),\n this.transform(nrws, _, nrwst, niwst, N, rbt);\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]), (rwst[i] = rx);\n }\n return (\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 (out.negative = x.negative ^ y.negative),\n (out.length = x.length + y.length),\n out._strip()\n );\n }),\n (BN.prototype.mul = function (num) {\n var out = new BN(null);\n return (out.words = new Array(this.length + num.length)), this.mulTo(num, out);\n }),\n (BN.prototype.mulf = function (num) {\n var out = new BN(null);\n return (out.words = new Array(this.length + num.length)), jumboMulTo(this, num, out);\n }),\n (BN.prototype.imul = function (num) {\n return this.clone().mulTo(num, this);\n }),\n (BN.prototype.imuln = function (num) {\n var isNegNum = num < 0;\n isNegNum && (num = -num), assert(typeof num == \"number\"), assert(num < 67108864);\n for (var carry = 0, i = 0; i < this.length; i++) {\n var w = (this.words[i] | 0) * num,\n lo = (w & 67108863) + (carry & 67108863);\n (carry >>= 26), (carry += (w / 67108864) | 0), (carry += lo >>> 26), (this.words[i] = lo & 67108863);\n }\n return carry !== 0 && ((this.words[i] = carry), this.length++), isNegNum ? this.ineg() : this;\n }),\n (BN.prototype.muln = function (num) {\n return this.clone().imuln(num);\n }),\n (BN.prototype.sqr = function () {\n return this.mul(this);\n }),\n (BN.prototype.isqr = function () {\n return this.imul(this.clone());\n }),\n (BN.prototype.pow = function (num) {\n var w = toBitArray(num);\n if (w.length === 0) return new BN(1);\n for (var res = this, i = 0; i < w.length && w[i] === 0; i++, res = res.sqr());\n if (++i < w.length) for (var q = res.sqr(); i < w.length; i++, q = q.sqr()) w[i] !== 0 && (res = res.mul(q));\n return res;\n }),\n (BN.prototype.iushln = function (bits) {\n assert(typeof bits == \"number\" && bits >= 0);\n var r = bits % 26,\n s = (bits - r) / 26,\n carryMask = (67108863 >>> (26 - r)) << (26 - r),\n i;\n if (r !== 0) {\n var carry = 0;\n for (i = 0; i < this.length; i++) {\n var newCarry = this.words[i] & carryMask,\n c = ((this.words[i] | 0) - newCarry) << r;\n (this.words[i] = c | carry), (carry = newCarry >>> (26 - r));\n }\n carry && ((this.words[i] = carry), this.length++);\n }\n if (s !== 0) {\n for (i = this.length - 1; i >= 0; i--) this.words[i + s] = this.words[i];\n for (i = 0; i < s; i++) this.words[i] = 0;\n this.length += s;\n }\n return this._strip();\n }),\n (BN.prototype.ishln = function (bits) {\n return assert(this.negative === 0), this.iushln(bits);\n }),\n (BN.prototype.iushrn = function (bits, hint, extended) {\n assert(typeof bits == \"number\" && bits >= 0);\n var h;\n hint ? (h = (hint - (hint % 26)) / 26) : (h = 0);\n var r = bits % 26,\n s = Math.min((bits - r) / 26, this.length),\n mask = 67108863 ^ ((67108863 >>> r) << r),\n maskedWords = extended;\n if (((h -= s), (h = Math.max(0, h)), maskedWords)) {\n for (var i = 0; i < s; i++) maskedWords.words[i] = this.words[i];\n maskedWords.length = s;\n }\n if (s !== 0)\n if (this.length > s) for (this.length -= s, i = 0; i < this.length; i++) this.words[i] = this.words[i + s];\n else (this.words[0] = 0), (this.length = 1);\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)), (carry = word & mask);\n }\n return (\n maskedWords && carry !== 0 && (maskedWords.words[maskedWords.length++] = carry),\n this.length === 0 && ((this.words[0] = 0), (this.length = 1)),\n this._strip()\n );\n }),\n (BN.prototype.ishrn = function (bits, hint, extended) {\n return assert(this.negative === 0), this.iushrn(bits, hint, extended);\n }),\n (BN.prototype.shln = function (bits) {\n return this.clone().ishln(bits);\n }),\n (BN.prototype.ushln = function (bits) {\n return this.clone().iushln(bits);\n }),\n (BN.prototype.shrn = function (bits) {\n return this.clone().ishrn(bits);\n }),\n (BN.prototype.ushrn = function (bits) {\n return this.clone().iushrn(bits);\n }),\n (BN.prototype.testn = function (bit) {\n assert(typeof bit == \"number\" && bit >= 0);\n var r = bit % 26,\n s = (bit - r) / 26,\n q = 1 << r;\n if (this.length <= s) return !1;\n var w = this.words[s];\n return !!(w & q);\n }),\n (BN.prototype.imaskn = function (bits) {\n assert(typeof bits == \"number\" && bits >= 0);\n var r = bits % 26,\n s = (bits - r) / 26;\n if ((assert(this.negative === 0, \"imaskn works only with positive numbers\"), this.length <= s)) return this;\n if ((r !== 0 && s++, (this.length = Math.min(s, this.length)), r !== 0)) {\n var mask = 67108863 ^ ((67108863 >>> r) << r);\n this.words[this.length - 1] &= mask;\n }\n return this._strip();\n }),\n (BN.prototype.maskn = function (bits) {\n return this.clone().imaskn(bits);\n }),\n (BN.prototype.iaddn = function (num) {\n return (\n assert(typeof num == \"number\"),\n assert(num < 67108864),\n num < 0\n ? this.isubn(-num)\n : this.negative !== 0\n ? this.length === 1 && (this.words[0] | 0) <= num\n ? ((this.words[0] = num - (this.words[0] | 0)), (this.negative = 0), this)\n : ((this.negative = 0), this.isubn(num), (this.negative = 1), this)\n : this._iaddn(num)\n );\n }),\n (BN.prototype._iaddn = function (num) {\n this.words[0] += num;\n for (var i = 0; i < this.length && this.words[i] >= 67108864; i++)\n (this.words[i] -= 67108864), i === this.length - 1 ? (this.words[i + 1] = 1) : this.words[i + 1]++;\n return (this.length = Math.max(this.length, i + 1)), this;\n }),\n (BN.prototype.isubn = function (num) {\n if ((assert(typeof num == \"number\"), assert(num < 67108864), num < 0)) return this.iaddn(-num);\n if (this.negative !== 0) return (this.negative = 0), this.iaddn(num), (this.negative = 1), this;\n if (((this.words[0] -= num), this.length === 1 && this.words[0] < 0))\n (this.words[0] = -this.words[0]), (this.negative = 1);\n else\n for (var i = 0; i < this.length && this.words[i] < 0; i++)\n (this.words[i] += 67108864), (this.words[i + 1] -= 1);\n return this._strip();\n }),\n (BN.prototype.addn = function (num) {\n return this.clone().iaddn(num);\n }),\n (BN.prototype.subn = function (num) {\n return this.clone().isubn(num);\n }),\n (BN.prototype.iabs = function () {\n return (this.negative = 0), this;\n }),\n (BN.prototype.abs = function () {\n return this.clone().iabs();\n }),\n (BN.prototype._ishlnsubmul = function (num, mul, shift) {\n var len = num.length + shift,\n i;\n this._expand(len);\n var w,\n 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 & 67108863),\n (carry = (w >> 26) - ((right / 67108864) | 0)),\n (this.words[i + shift] = w & 67108863);\n }\n for (; i < this.length - shift; i++)\n (w = (this.words[i + shift] | 0) + carry), (carry = w >> 26), (this.words[i + shift] = w & 67108863);\n if (carry === 0) return this._strip();\n for (assert(carry === -1), carry = 0, i = 0; i < this.length; i++)\n (w = -(this.words[i] | 0) + carry), (carry = w >> 26), (this.words[i] = w & 67108863);\n return (this.negative = 1), this._strip();\n }),\n (BN.prototype._wordDiv = function (num, mode) {\n var shift = this.length - num.length,\n a = this.clone(),\n b = num,\n bhi = b.words[b.length - 1] | 0,\n bhiBits = this._countBits(bhi);\n (shift = 26 - bhiBits),\n shift !== 0 && ((b = b.ushln(shift)), a.iushln(shift), (bhi = b.words[b.length - 1] | 0));\n var m = a.length - b.length,\n q;\n if (mode !== \"mod\") {\n (q = new BN(null)), (q.length = m + 1), (q.words = new Array(q.length));\n for (var i = 0; i < q.length; i++) q.words[i] = 0;\n }\n var diff = a.clone()._ishlnsubmul(b, 1, m);\n diff.negative === 0 && ((a = diff), q && (q.words[m] = 1));\n for (var j = m - 1; j >= 0; j--) {\n var qj = (a.words[b.length + j] | 0) * 67108864 + (a.words[b.length + j - 1] | 0);\n for (qj = Math.min((qj / bhi) | 0, 67108863), a._ishlnsubmul(b, qj, j); a.negative !== 0; )\n qj--, (a.negative = 0), a._ishlnsubmul(b, 1, j), a.isZero() || (a.negative ^= 1);\n q && (q.words[j] = qj);\n }\n return (\n q && q._strip(),\n a._strip(),\n mode !== \"div\" && shift !== 0 && a.iushrn(shift),\n {\n div: q || null,\n mod: a,\n }\n );\n }),\n (BN.prototype.divmod = function (num, mode, positive) {\n if ((assert(!num.isZero()), this.isZero()))\n return {\n div: new BN(0),\n mod: new BN(0),\n };\n var div, mod, res;\n return this.negative !== 0 && num.negative === 0\n ? ((res = this.neg().divmod(num, mode)),\n mode !== \"mod\" && (div = res.div.neg()),\n mode !== \"div\" && ((mod = res.mod.neg()), positive && mod.negative !== 0 && mod.iadd(num)),\n {\n div,\n mod,\n })\n : this.negative === 0 && num.negative !== 0\n ? ((res = this.divmod(num.neg(), mode)),\n mode !== \"mod\" && (div = res.div.neg()),\n {\n div,\n mod: res.mod,\n })\n : (this.negative & num.negative) !== 0\n ? ((res = this.neg().divmod(num.neg(), mode)),\n mode !== \"div\" && ((mod = res.mod.neg()), positive && mod.negative !== 0 && mod.isub(num)),\n {\n div: res.div,\n mod,\n })\n : num.length > this.length || this.cmp(num) < 0\n ? {\n div: new BN(0),\n mod: this,\n }\n : num.length === 1\n ? mode === \"div\"\n ? {\n div: this.divn(num.words[0]),\n mod: null,\n }\n : mode === \"mod\"\n ? {\n div: null,\n mod: new BN(this.modrn(num.words[0])),\n }\n : {\n div: this.divn(num.words[0]),\n mod: new BN(this.modrn(num.words[0])),\n }\n : this._wordDiv(num, mode);\n }),\n (BN.prototype.div = function (num) {\n return this.divmod(num, \"div\", !1).div;\n }),\n (BN.prototype.mod = function (num) {\n return this.divmod(num, \"mod\", !1).mod;\n }),\n (BN.prototype.umod = function (num) {\n return this.divmod(num, \"mod\", !0).mod;\n }),\n (BN.prototype.divRound = function (num) {\n var dm = this.divmod(num);\n if (dm.mod.isZero()) return dm.div;\n var mod = dm.div.negative !== 0 ? dm.mod.isub(num) : dm.mod,\n half = num.ushrn(1),\n r2 = num.andln(1),\n cmp = mod.cmp(half);\n return cmp < 0 || (r2 === 1 && cmp === 0)\n ? dm.div\n : dm.div.negative !== 0\n ? dm.div.isubn(1)\n : dm.div.iaddn(1);\n }),\n (BN.prototype.modrn = function (num) {\n var isNegNum = num < 0;\n isNegNum && (num = -num), assert(num <= 67108863);\n for (var p = (1 << 26) % num, acc = 0, i = this.length - 1; i >= 0; i--)\n acc = (p * acc + (this.words[i] | 0)) % num;\n return isNegNum ? -acc : acc;\n }),\n (BN.prototype.modn = function (num) {\n return this.modrn(num);\n }),\n (BN.prototype.idivn = function (num) {\n var isNegNum = num < 0;\n isNegNum && (num = -num), assert(num <= 67108863);\n for (var carry = 0, i = this.length - 1; i >= 0; i--) {\n var w = (this.words[i] | 0) + carry * 67108864;\n (this.words[i] = (w / num) | 0), (carry = w % num);\n }\n return this._strip(), isNegNum ? this.ineg() : this;\n }),\n (BN.prototype.divn = function (num) {\n return this.clone().idivn(num);\n }),\n (BN.prototype.egcd = function (p) {\n assert(p.negative === 0), assert(!p.isZero());\n var x = this,\n y = p.clone();\n x.negative !== 0 ? (x = x.umod(p)) : (x = x.clone());\n for (var A = new BN(1), B = new BN(0), C = new BN(0), D = new BN(1), g = 0; x.isEven() && y.isEven(); )\n x.iushrn(1), y.iushrn(1), ++g;\n for (var yp = y.clone(), xp = x.clone(); !x.isZero(); ) {\n for (var i = 0, im = 1; (x.words[0] & im) === 0 && i < 26; ++i, im <<= 1);\n if (i > 0)\n for (x.iushrn(i); i-- > 0; )\n (A.isOdd() || B.isOdd()) && (A.iadd(yp), B.isub(xp)), A.iushrn(1), B.iushrn(1);\n for (var j = 0, jm = 1; (y.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n if (j > 0)\n for (y.iushrn(j); j-- > 0; )\n (C.isOdd() || D.isOdd()) && (C.iadd(yp), D.isub(xp)), C.iushrn(1), D.iushrn(1);\n x.cmp(y) >= 0 ? (x.isub(y), A.isub(C), B.isub(D)) : (y.isub(x), C.isub(A), D.isub(B));\n }\n return {\n a: C,\n b: D,\n gcd: y.iushln(g),\n };\n }),\n (BN.prototype._invmp = function (p) {\n assert(p.negative === 0), assert(!p.isZero());\n var a = this,\n b = p.clone();\n a.negative !== 0 ? (a = a.umod(p)) : (a = a.clone());\n for (var x1 = new BN(1), x2 = new BN(0), delta = b.clone(); 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) for (a.iushrn(i); i-- > 0; ) x1.isOdd() && x1.iadd(delta), x1.iushrn(1);\n for (var j = 0, jm = 1; (b.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n if (j > 0) for (b.iushrn(j); j-- > 0; ) x2.isOdd() && x2.iadd(delta), x2.iushrn(1);\n a.cmp(b) >= 0 ? (a.isub(b), x1.isub(x2)) : (b.isub(a), x2.isub(x1));\n }\n var res;\n return a.cmpn(1) === 0 ? (res = x1) : (res = x2), res.cmpn(0) < 0 && res.iadd(p), res;\n }),\n (BN.prototype.gcd = function (num) {\n if (this.isZero()) return num.abs();\n if (num.isZero()) return this.abs();\n var a = this.clone(),\n b = num.clone();\n (a.negative = 0), (b.negative = 0);\n for (var shift = 0; a.isEven() && b.isEven(); shift++) a.iushrn(1), b.iushrn(1);\n do {\n for (; a.isEven(); ) a.iushrn(1);\n for (; b.isEven(); ) b.iushrn(1);\n var r = a.cmp(b);\n if (r < 0) {\n var t = a;\n (a = b), (b = t);\n } else if (r === 0 || b.cmpn(1) === 0) break;\n a.isub(b);\n } while (!0);\n return b.iushln(shift);\n }),\n (BN.prototype.invm = function (num) {\n return this.egcd(num).a.umod(num);\n }),\n (BN.prototype.isEven = function () {\n return (this.words[0] & 1) === 0;\n }),\n (BN.prototype.isOdd = function () {\n return (this.words[0] & 1) === 1;\n }),\n (BN.prototype.andln = function (num) {\n return this.words[0] & num;\n }),\n (BN.prototype.bincn = function (bit) {\n assert(typeof bit == \"number\");\n var r = bit % 26,\n s = (bit - r) / 26,\n q = 1 << r;\n if (this.length <= s) return this._expand(s + 1), (this.words[s] |= q), this;\n for (var carry = q, i = s; carry !== 0 && i < this.length; i++) {\n var w = this.words[i] | 0;\n (w += carry), (carry = w >>> 26), (w &= 67108863), (this.words[i] = w);\n }\n return carry !== 0 && ((this.words[i] = carry), this.length++), this;\n }),\n (BN.prototype.isZero = function () {\n return this.length === 1 && this.words[0] === 0;\n }),\n (BN.prototype.cmpn = function (num) {\n var negative = num < 0;\n if (this.negative !== 0 && !negative) return -1;\n if (this.negative === 0 && negative) return 1;\n this._strip();\n var res;\n if (this.length > 1) res = 1;\n else {\n negative && (num = -num), assert(num <= 67108863, \"Number is too big\");\n var w = this.words[0] | 0;\n res = w === num ? 0 : w < num ? -1 : 1;\n }\n return this.negative !== 0 ? -res | 0 : res;\n }),\n (BN.prototype.cmp = function (num) {\n if (this.negative !== 0 && num.negative === 0) return -1;\n if (this.negative === 0 && num.negative !== 0) return 1;\n var res = this.ucmp(num);\n return this.negative !== 0 ? -res | 0 : res;\n }),\n (BN.prototype.ucmp = function (num) {\n if (this.length > num.length) return 1;\n if (this.length < num.length) return -1;\n for (var res = 0, i = this.length - 1; i >= 0; i--) {\n var a = this.words[i] | 0,\n b = num.words[i] | 0;\n if (a !== b) {\n a < b ? (res = -1) : a > b && (res = 1);\n break;\n }\n }\n return res;\n }),\n (BN.prototype.gtn = function (num) {\n return this.cmpn(num) === 1;\n }),\n (BN.prototype.gt = function (num) {\n return this.cmp(num) === 1;\n }),\n (BN.prototype.gten = function (num) {\n return this.cmpn(num) >= 0;\n }),\n (BN.prototype.gte = function (num) {\n return this.cmp(num) >= 0;\n }),\n (BN.prototype.ltn = function (num) {\n return this.cmpn(num) === -1;\n }),\n (BN.prototype.lt = function (num) {\n return this.cmp(num) === -1;\n }),\n (BN.prototype.lten = function (num) {\n return this.cmpn(num) <= 0;\n }),\n (BN.prototype.lte = function (num) {\n return this.cmp(num) <= 0;\n }),\n (BN.prototype.eqn = function (num) {\n return this.cmpn(num) === 0;\n }),\n (BN.prototype.eq = function (num) {\n return this.cmp(num) === 0;\n }),\n (BN.red = function (num) {\n return new Red(num);\n }),\n (BN.prototype.toRed = function (ctx) {\n return (\n assert(!this.red, \"Already a number in reduction context\"),\n assert(this.negative === 0, \"red works only with positives\"),\n ctx.convertTo(this)._forceRed(ctx)\n );\n }),\n (BN.prototype.fromRed = function () {\n return assert(this.red, \"fromRed works only with numbers in reduction context\"), this.red.convertFrom(this);\n }),\n (BN.prototype._forceRed = function (ctx) {\n return (this.red = ctx), this;\n }),\n (BN.prototype.forceRed = function (ctx) {\n return assert(!this.red, \"Already a number in reduction context\"), this._forceRed(ctx);\n }),\n (BN.prototype.redAdd = function (num) {\n return assert(this.red, \"redAdd works only with red numbers\"), this.red.add(this, num);\n }),\n (BN.prototype.redIAdd = function (num) {\n return assert(this.red, \"redIAdd works only with red numbers\"), this.red.iadd(this, num);\n }),\n (BN.prototype.redSub = function (num) {\n return assert(this.red, \"redSub works only with red numbers\"), this.red.sub(this, num);\n }),\n (BN.prototype.redISub = function (num) {\n return assert(this.red, \"redISub works only with red numbers\"), this.red.isub(this, num);\n }),\n (BN.prototype.redShl = function (num) {\n return assert(this.red, \"redShl works only with red numbers\"), this.red.shl(this, num);\n }),\n (BN.prototype.redMul = function (num) {\n return (\n assert(this.red, \"redMul works only with red numbers\"),\n this.red._verify2(this, num),\n this.red.mul(this, num)\n );\n }),\n (BN.prototype.redIMul = function (num) {\n return (\n assert(this.red, \"redMul works only with red numbers\"),\n this.red._verify2(this, num),\n this.red.imul(this, num)\n );\n }),\n (BN.prototype.redSqr = function () {\n return assert(this.red, \"redSqr works only with red numbers\"), this.red._verify1(this), this.red.sqr(this);\n }),\n (BN.prototype.redISqr = function () {\n return assert(this.red, \"redISqr works only with red numbers\"), this.red._verify1(this), this.red.isqr(this);\n }),\n (BN.prototype.redSqrt = function () {\n return assert(this.red, \"redSqrt works only with red numbers\"), this.red._verify1(this), this.red.sqrt(this);\n }),\n (BN.prototype.redInvm = function () {\n return assert(this.red, \"redInvm works only with red numbers\"), this.red._verify1(this), this.red.invm(this);\n }),\n (BN.prototype.redNeg = function () {\n return assert(this.red, \"redNeg works only with red numbers\"), this.red._verify1(this), this.red.neg(this);\n }),\n (BN.prototype.redPow = function (num) {\n return assert(this.red && !num.red, \"redPow(normalNum)\"), this.red._verify1(this), this.red.pow(this, num);\n });\n var primes = {\n k256: null,\n p224: null,\n p192: null,\n p25519: null,\n };\n function MPrime(name, p) {\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 (this.tmp = this._tmp());\n }\n (MPrime.prototype._tmp = function () {\n var tmp = new BN(null);\n return (tmp.words = new Array(Math.ceil(this.n / 13))), tmp;\n }),\n (MPrime.prototype.ireduce = function (num) {\n var r = num,\n rlen;\n do this.split(r, this.tmp), (r = this.imulK(r)), (r = r.iadd(this.tmp)), (rlen = r.bitLength());\n while (rlen > this.n);\n var cmp = rlen < this.n ? -1 : r.ucmp(this.p);\n return (\n cmp === 0\n ? ((r.words[0] = 0), (r.length = 1))\n : cmp > 0\n ? r.isub(this.p)\n : r.strip !== void 0\n ? r.strip()\n : r._strip(),\n r\n );\n }),\n (MPrime.prototype.split = function (input, out) {\n input.iushrn(this.n, 0, out);\n }),\n (MPrime.prototype.imulK = function (num) {\n return num.imul(this.k);\n });\n function K256() {\n MPrime.call(this, \"k256\", \"ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f\");\n }\n inherits(K256, MPrime),\n (K256.prototype.split = function (input, output) {\n for (var mask = 4194303, outLen = Math.min(input.length, 9), i = 0; i < outLen; i++)\n output.words[i] = input.words[i];\n if (((output.length = outLen), input.length <= 9)) {\n (input.words[0] = 0), (input.length = 1);\n return;\n }\n var prev = input.words[9];\n for (output.words[output.length++] = prev & mask, i = 10; i < input.length; i++) {\n var next = input.words[i] | 0;\n (input.words[i - 10] = ((next & mask) << 4) | (prev >>> 22)), (prev = next);\n }\n (prev >>>= 22),\n (input.words[i - 10] = prev),\n prev === 0 && input.length > 10 ? (input.length -= 10) : (input.length -= 9);\n }),\n (K256.prototype.imulK = function (num) {\n (num.words[num.length] = 0), (num.words[num.length + 1] = 0), (num.length += 2);\n for (var lo = 0, i = 0; i < num.length; i++) {\n var w = num.words[i] | 0;\n (lo += w * 977), (num.words[i] = lo & 67108863), (lo = w * 64 + ((lo / 67108864) | 0));\n }\n return (\n num.words[num.length - 1] === 0 && (num.length--, num.words[num.length - 1] === 0 && num.length--), num\n );\n });\n function P224() {\n MPrime.call(this, \"p224\", \"ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001\");\n }\n inherits(P224, MPrime);\n function P192() {\n MPrime.call(this, \"p192\", \"ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff\");\n }\n inherits(P192, MPrime);\n function P25519() {\n MPrime.call(this, \"25519\", \"7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed\");\n }\n inherits(P25519, MPrime),\n (P25519.prototype.imulK = function (num) {\n for (var carry = 0, i = 0; i < num.length; i++) {\n var hi = (num.words[i] | 0) * 19 + carry,\n lo = hi & 67108863;\n (hi >>>= 26), (num.words[i] = lo), (carry = hi);\n }\n return carry !== 0 && (num.words[num.length++] = carry), num;\n }),\n (BN._prime = function (name) {\n if (primes[name]) return primes[name];\n var prime2;\n if (name === \"k256\") prime2 = new K256();\n else if (name === \"p224\") prime2 = new P224();\n else if (name === \"p192\") prime2 = new P192();\n else if (name === \"p25519\") prime2 = new P25519();\n else throw new Error(\"Unknown prime \" + name);\n return (primes[name] = prime2), prime2;\n });\n function Red(m) {\n if (typeof m == \"string\") {\n var prime = BN._prime(m);\n (this.m = prime.p), (this.prime = prime);\n } else assert(m.gtn(1), \"modulus must be greater than 1\"), (this.m = m), (this.prime = null);\n }\n (Red.prototype._verify1 = function (a) {\n assert(a.negative === 0, \"red works only with positives\"), assert(a.red, \"red works only with red numbers\");\n }),\n (Red.prototype._verify2 = function (a, b) {\n assert((a.negative | b.negative) === 0, \"red works only with positives\"),\n assert(a.red && a.red === b.red, \"red works only with red numbers\");\n }),\n (Red.prototype.imod = function (a) {\n return this.prime ? this.prime.ireduce(a)._forceRed(this) : (move(a, a.umod(this.m)._forceRed(this)), a);\n }),\n (Red.prototype.neg = function (a) {\n return a.isZero() ? a.clone() : this.m.sub(a)._forceRed(this);\n }),\n (Red.prototype.add = function (a, b) {\n this._verify2(a, b);\n var res = a.add(b);\n return res.cmp(this.m) >= 0 && res.isub(this.m), res._forceRed(this);\n }),\n (Red.prototype.iadd = function (a, b) {\n this._verify2(a, b);\n var res = a.iadd(b);\n return res.cmp(this.m) >= 0 && res.isub(this.m), res;\n }),\n (Red.prototype.sub = function (a, b) {\n this._verify2(a, b);\n var res = a.sub(b);\n return res.cmpn(0) < 0 && res.iadd(this.m), res._forceRed(this);\n }),\n (Red.prototype.isub = function (a, b) {\n this._verify2(a, b);\n var res = a.isub(b);\n return res.cmpn(0) < 0 && res.iadd(this.m), res;\n }),\n (Red.prototype.shl = function (a, num) {\n return this._verify1(a), this.imod(a.ushln(num));\n }),\n (Red.prototype.imul = function (a, b) {\n return this._verify2(a, b), this.imod(a.imul(b));\n }),\n (Red.prototype.mul = function (a, b) {\n return this._verify2(a, b), this.imod(a.mul(b));\n }),\n (Red.prototype.isqr = function (a) {\n return this.imul(a, a.clone());\n }),\n (Red.prototype.sqr = function (a) {\n return this.mul(a, a);\n }),\n (Red.prototype.sqrt = function (a) {\n if (a.isZero()) return a.clone();\n var mod3 = this.m.andln(3);\n if ((assert(mod3 % 2 === 1), mod3 === 3)) {\n var pow = this.m.add(new BN(1)).iushrn(2);\n return this.pow(a, pow);\n }\n for (var q = this.m.subn(1), s = 0; !q.isZero() && q.andln(1) === 0; ) s++, q.iushrn(1);\n assert(!q.isZero());\n var one = new BN(1).toRed(this),\n nOne = one.redNeg(),\n lpow = this.m.subn(1).iushrn(1),\n z = this.m.bitLength();\n for (z = new BN(2 * z * z).toRed(this); this.pow(z, lpow).cmp(nOne) !== 0; ) z.redIAdd(nOne);\n for (\n var c = this.pow(z, q), r = this.pow(a, q.addn(1).iushrn(1)), t = this.pow(a, q), m = s;\n t.cmp(one) !== 0;\n\n ) {\n for (var tmp = t, i = 0; tmp.cmp(one) !== 0; i++) tmp = tmp.redSqr();\n assert(i < m);\n var b = this.pow(c, new BN(1).iushln(m - i - 1));\n (r = r.redMul(b)), (c = b.redSqr()), (t = t.redMul(c)), (m = i);\n }\n return r;\n }),\n (Red.prototype.invm = function (a) {\n var inv = a._invmp(this.m);\n return inv.negative !== 0 ? ((inv.negative = 0), this.imod(inv).redNeg()) : this.imod(inv);\n }),\n (Red.prototype.pow = function (a, num) {\n if (num.isZero()) return new BN(1).toRed(this);\n if (num.cmpn(1) === 0) return a.clone();\n var windowSize = 4,\n wnd = new Array(1 << windowSize);\n (wnd[0] = new BN(1).toRed(this)), (wnd[1] = a);\n for (var i = 2; i < wnd.length; i++) wnd[i] = this.mul(wnd[i - 1], a);\n var res = wnd[0],\n current = 0,\n currentLen = 0,\n start = num.bitLength() % 26;\n for (start === 0 && (start = 26), i = num.length - 1; i >= 0; i--) {\n for (var word = num.words[i], j = start - 1; j >= 0; j--) {\n var bit = (word >> j) & 1;\n if ((res !== wnd[0] && (res = this.sqr(res)), bit === 0 && current === 0)) {\n currentLen = 0;\n continue;\n }\n (current <<= 1),\n (current |= bit),\n currentLen++,\n !(currentLen !== windowSize && (i !== 0 || j !== 0)) &&\n ((res = this.mul(res, wnd[current])), (currentLen = 0), (current = 0));\n }\n start = 26;\n }\n return res;\n }),\n (Red.prototype.convertTo = function (num) {\n var r = num.umod(this.m);\n return r === num ? r.clone() : r;\n }),\n (Red.prototype.convertFrom = function (num) {\n var res = num.clone();\n return (res.red = null), res;\n }),\n (BN.mont = function (num) {\n return new Mont(num);\n });\n function Mont(m) {\n Red.call(this, m),\n (this.shift = this.m.bitLength()),\n this.shift % 26 !== 0 && (this.shift += 26 - (this.shift % 26)),\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 (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 (Mont.prototype.convertTo = function (num) {\n return this.imod(num.ushln(this.shift));\n }),\n (Mont.prototype.convertFrom = function (num) {\n var r = this.imod(num.mul(this.rinv));\n return (r.red = null), r;\n }),\n (Mont.prototype.imul = function (a, b) {\n if (a.isZero() || b.isZero()) return (a.words[0] = 0), (a.length = 1), a;\n var t = a.imul(b),\n c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m),\n u = t.isub(c).iushrn(this.shift),\n res = u;\n return (\n u.cmp(this.m) >= 0 ? (res = u.isub(this.m)) : u.cmpn(0) < 0 && (res = u.iadd(this.m)), res._forceRed(this)\n );\n }),\n (Mont.prototype.mul = function (a, b) {\n if (a.isZero() || b.isZero()) return new BN(0)._forceRed(this);\n var t = a.mul(b),\n c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m),\n u = t.isub(c).iushrn(this.shift),\n res = u;\n return (\n u.cmp(this.m) >= 0 ? (res = u.isub(this.m)) : u.cmpn(0) < 0 && (res = u.iadd(this.m)), res._forceRed(this)\n );\n }),\n (Mont.prototype.invm = function (a) {\n var res = this.imod(a._invmp(this.m).mul(this.r2));\n return res._forceRed(this);\n });\n })(typeof module > \"u\" || module, exports);\n },\n});\n\n// node_modules/browserify-rsa/index.js\nvar require_browserify_rsa = __commonJS({\n \"node_modules/browserify-rsa/index.js\"(exports, module) {\n var BN = require_bn3(),\n randomBytes = require_browser();\n function blind(priv) {\n var r = getr(priv),\n blinder = r.toRed(BN.mont(priv.modulus)).redPow(new BN(priv.publicExponent)).fromRed();\n return { blinder, unblinder: r.invm(priv.modulus) };\n }\n function getr(priv) {\n var len = priv.modulus.byteLength(),\n r;\n do r = new BN(randomBytes(len));\n while (r.cmp(priv.modulus) >= 0 || !r.umod(priv.prime1) || !r.umod(priv.prime2));\n return r;\n }\n function crt(msg, priv) {\n var blinds = blind(priv),\n len = priv.modulus.byteLength(),\n blinded = new BN(msg).mul(blinds.blinder).umod(priv.modulus),\n c1 = blinded.toRed(BN.mont(priv.prime1)),\n c2 = blinded.toRed(BN.mont(priv.prime2)),\n qinv = priv.coefficient,\n p = priv.prime1,\n q = priv.prime2,\n m1 = c1.redPow(priv.exponent1).fromRed(),\n m2 = c2.redPow(priv.exponent2).fromRed(),\n h = m1.isub(m2).imul(qinv).umod(p).imul(q);\n return m2.iadd(h).imul(blinds.unblinder).umod(priv.modulus).toArrayLike(Buffer, \"be\", len);\n }\n crt.getr = getr;\n module.exports = crt;\n },\n});\n\n// node_modules/elliptic/package.json\nvar require_package = __commonJS({\n \"node_modules/elliptic/package.json\"(exports, module) {\n module.exports = {\n name: \"elliptic\",\n version: \"6.5.4\",\n description: \"EC cryptography\",\n main: \"lib/elliptic.js\",\n files: [\"lib\"],\n scripts: {\n lint: \"eslint lib test\",\n \"lint:fix\": \"npm run lint -- --fix\",\n unit: \"istanbul test _mocha --reporter=spec test/index.js\",\n test: \"npm run lint && npm run unit\",\n version: \"grunt dist && git add dist/\",\n },\n repository: {\n type: \"git\",\n url: \"git@github.com:indutny/elliptic\",\n },\n keywords: [\"EC\", \"Elliptic\", \"curve\", \"Cryptography\"],\n author: \"Fedor Indutny <fedor@indutny.com>\",\n license: \"MIT\",\n bugs: {\n url: \"https://github.com/indutny/elliptic/issues\",\n },\n homepage: \"https://github.com/indutny/elliptic\",\n devDependencies: {\n brfs: \"^2.0.2\",\n coveralls: \"^3.1.0\",\n eslint: \"^7.6.0\",\n grunt: \"^1.2.1\",\n \"grunt-browserify\": \"^5.3.0\",\n \"grunt-cli\": \"^1.3.2\",\n \"grunt-contrib-connect\": \"^3.0.0\",\n \"grunt-contrib-copy\": \"^1.0.0\",\n \"grunt-contrib-uglify\": \"^5.0.0\",\n \"grunt-mocha-istanbul\": \"^5.0.2\",\n \"grunt-saucelabs\": \"^9.0.1\",\n istanbul: \"^0.4.5\",\n mocha: \"^8.0.1\",\n },\n dependencies: {\n \"bn.js\": \"^4.11.9\",\n brorand: \"^1.1.0\",\n \"hash.js\": \"^1.0.0\",\n \"hmac-drbg\": \"^1.0.1\",\n inherits: \"^2.0.4\",\n \"minimalistic-assert\": \"^1.0.1\",\n \"minimalistic-crypto-utils\": \"^1.0.1\",\n },\n };\n },\n});\n\n// node_modules/elliptic/node_modules/bn.js/lib/bn.js\nvar require_bn4 = __commonJS({\n \"node_modules/elliptic/node_modules/bn.js/lib/bn.js\"(exports, module) {\n (function (module2, exports2) {\n \"use strict\";\n function assert(val, msg) {\n if (!val) throw new Error(msg || \"Assertion failed\");\n }\n function inherits(ctor, superCtor) {\n ctor.super_ = superCtor;\n var TempCtor = function () {};\n (TempCtor.prototype = superCtor.prototype),\n (ctor.prototype = new TempCtor()),\n (ctor.prototype.constructor = ctor);\n }\n function BN(number, base, endian) {\n if (BN.isBN(number)) return number;\n (this.negative = 0),\n (this.words = null),\n (this.length = 0),\n (this.red = null),\n number !== null &&\n ((base === \"le\" || base === \"be\") && ((endian = base), (base = 10)),\n this._init(number || 0, base || 10, endian || \"be\"));\n }\n typeof module2 == \"object\" ? (module2.exports = BN) : (exports2.BN = BN), (BN.BN = BN), (BN.wordSize = 26);\n var Buffer2;\n try {\n typeof window < \"u\" && typeof window.Buffer < \"u\"\n ? (Buffer2 = window.Buffer)\n : (Buffer2 = __require(\"buffer\").Buffer);\n } catch {}\n (BN.isBN = function (num) {\n return num instanceof BN\n ? !0\n : num !== null &&\n typeof num == \"object\" &&\n num.constructor.wordSize === BN.wordSize &&\n Array.isArray(num.words);\n }),\n (BN.max = function (left, right) {\n return left.cmp(right) > 0 ? left : right;\n }),\n (BN.min = function (left, right) {\n return left.cmp(right) < 0 ? left : right;\n }),\n (BN.prototype._init = function (number, base, endian) {\n if (typeof number == \"number\") return this._initNumber(number, base, endian);\n if (typeof number == \"object\") return this._initArray(number, base, endian);\n base === \"hex\" && (base = 16),\n assert(base === (base | 0) && base >= 2 && base <= 36),\n (number = number.toString().replace(/\\s+/g, \"\"));\n var start = 0;\n number[0] === \"-\" && (start++, (this.negative = 1)),\n start < number.length &&\n (base === 16\n ? this._parseHex(number, start, endian)\n : (this._parseBase(number, base, start),\n endian === \"le\" && this._initArray(this.toArray(), base, endian)));\n }),\n (BN.prototype._initNumber = function (number, base, endian) {\n number < 0 && ((this.negative = 1), (number = -number)),\n number < 67108864\n ? ((this.words = [number & 67108863]), (this.length = 1))\n : number < 4503599627370496\n ? ((this.words = [number & 67108863, (number / 67108864) & 67108863]), (this.length = 2))\n : (assert(number < 9007199254740992),\n (this.words = [number & 67108863, (number / 67108864) & 67108863, 1]),\n (this.length = 3)),\n endian === \"le\" && this._initArray(this.toArray(), base, endian);\n }),\n (BN.prototype._initArray = function (number, base, endian) {\n if ((assert(typeof number.length == \"number\"), number.length <= 0))\n return (this.words = [0]), (this.length = 1), this;\n (this.length = Math.ceil(number.length / 3)), (this.words = new Array(this.length));\n for (var i = 0; i < this.length; i++) this.words[i] = 0;\n var j,\n w,\n off = 0;\n if (endian === \"be\")\n for (i = number.length - 1, j = 0; i >= 0; i -= 3)\n (w = number[i] | (number[i - 1] << 8) | (number[i - 2] << 16)),\n (this.words[j] |= (w << off) & 67108863),\n (this.words[j + 1] = (w >>> (26 - off)) & 67108863),\n (off += 24),\n off >= 26 && ((off -= 26), j++);\n else if (endian === \"le\")\n for (i = 0, j = 0; i < number.length; i += 3)\n (w = number[i] | (number[i + 1] << 8) | (number[i + 2] << 16)),\n (this.words[j] |= (w << off) & 67108863),\n (this.words[j + 1] = (w >>> (26 - off)) & 67108863),\n (off += 24),\n off >= 26 && ((off -= 26), j++);\n return this.strip();\n });\n function parseHex4Bits(string, index) {\n var c = string.charCodeAt(index);\n return c >= 65 && c <= 70 ? c - 55 : c >= 97 && c <= 102 ? c - 87 : (c - 48) & 15;\n }\n function parseHexByte(string, lowerBound, index) {\n var r = parseHex4Bits(string, index);\n return index - 1 >= lowerBound && (r |= parseHex4Bits(string, index - 1) << 4), r;\n }\n BN.prototype._parseHex = function (number, start, endian) {\n (this.length = Math.ceil((number.length - start) / 6)), (this.words = new Array(this.length));\n for (var i = 0; i < this.length; i++) this.words[i] = 0;\n var off = 0,\n j = 0,\n w;\n if (endian === \"be\")\n for (i = number.length - 1; i >= start; i -= 2)\n (w = parseHexByte(number, start, i) << off),\n (this.words[j] |= w & 67108863),\n off >= 18 ? ((off -= 18), (j += 1), (this.words[j] |= w >>> 26)) : (off += 8);\n else {\n var parseLength = number.length - start;\n for (i = parseLength % 2 === 0 ? start + 1 : start; i < number.length; i += 2)\n (w = parseHexByte(number, start, i) << off),\n (this.words[j] |= w & 67108863),\n off >= 18 ? ((off -= 18), (j += 1), (this.words[j] |= w >>> 26)) : (off += 8);\n }\n this.strip();\n };\n function parseBase(str, start, end, mul) {\n for (var r = 0, len = Math.min(str.length, end), i = start; i < len; i++) {\n var c = str.charCodeAt(i) - 48;\n (r *= mul), c >= 49 ? (r += c - 49 + 10) : c >= 17 ? (r += c - 17 + 10) : (r += c);\n }\n return r;\n }\n (BN.prototype._parseBase = function (number, base, start) {\n (this.words = [0]), (this.length = 1);\n for (var limbLen = 0, limbPow = 1; limbPow <= 67108863; limbPow *= base) limbLen++;\n limbLen--, (limbPow = (limbPow / base) | 0);\n for (\n var total = number.length - start,\n mod = total % limbLen,\n end = Math.min(total, total - mod) + start,\n word = 0,\n i = start;\n i < end;\n i += limbLen\n )\n (word = parseBase(number, i, i + limbLen, base)),\n this.imuln(limbPow),\n this.words[0] + word < 67108864 ? (this.words[0] += word) : this._iaddn(word);\n if (mod !== 0) {\n var pow = 1;\n for (word = parseBase(number, i, number.length, base), i = 0; i < mod; i++) pow *= base;\n this.imuln(pow), this.words[0] + word < 67108864 ? (this.words[0] += word) : this._iaddn(word);\n }\n this.strip();\n }),\n (BN.prototype.copy = function (dest) {\n dest.words = new Array(this.length);\n for (var i = 0; i < this.length; i++) dest.words[i] = this.words[i];\n (dest.length = this.length), (dest.negative = this.negative), (dest.red = this.red);\n }),\n (BN.prototype.clone = function () {\n var r = new BN(null);\n return this.copy(r), r;\n }),\n (BN.prototype._expand = function (size) {\n for (; this.length < size; ) this.words[this.length++] = 0;\n return this;\n }),\n (BN.prototype.strip = function () {\n for (; this.length > 1 && this.words[this.length - 1] === 0; ) this.length--;\n return this._normSign();\n }),\n (BN.prototype._normSign = function () {\n return this.length === 1 && this.words[0] === 0 && (this.negative = 0), this;\n }),\n (BN.prototype.inspect = function () {\n return (this.red ? \"<BN-R: \" : \"<BN: \") + this.toString(16) + \">\";\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 groupSizes = [\n 0, 0, 25, 16, 12, 11, 10, 9, 8, 8, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5,\n 5, 5,\n ],\n groupBases = [\n 0, 0, 33554432, 43046721, 16777216, 48828125, 60466176, 40353607, 16777216, 43046721, 1e7, 19487171, 35831808,\n 62748517, 7529536, 11390625, 16777216, 24137569, 34012224, 47045881, 64e6, 4084101, 5153632, 6436343, 7962624,\n 9765625, 11881376, 14348907, 17210368, 20511149, 243e5, 28629151, 33554432, 39135393, 45435424, 52521875,\n 60466176,\n ];\n (BN.prototype.toString = function (base, padding) {\n (base = base || 10), (padding = padding | 0 || 1);\n var out;\n if (base === 16 || base === \"hex\") {\n out = \"\";\n for (var off = 0, carry = 0, i = 0; i < this.length; i++) {\n var w = this.words[i],\n word = (((w << off) | carry) & 16777215).toString(16);\n (carry = (w >>> (24 - off)) & 16777215),\n carry !== 0 || i !== this.length - 1 ? (out = zeros[6 - word.length] + word + out) : (out = word + out),\n (off += 2),\n off >= 26 && ((off -= 26), i--);\n }\n for (carry !== 0 && (out = carry.toString(16) + out); out.length % padding !== 0; ) out = \"0\" + out;\n return this.negative !== 0 && (out = \"-\" + out), out;\n }\n if (base === (base | 0) && base >= 2 && base <= 36) {\n var groupSize = groupSizes[base],\n groupBase = groupBases[base];\n out = \"\";\n var c = this.clone();\n for (c.negative = 0; !c.isZero(); ) {\n var r = c.modn(groupBase).toString(base);\n (c = c.idivn(groupBase)), c.isZero() ? (out = r + out) : (out = zeros[groupSize - r.length] + r + out);\n }\n for (this.isZero() && (out = \"0\" + out); out.length % padding !== 0; ) out = \"0\" + out;\n return this.negative !== 0 && (out = \"-\" + out), out;\n }\n assert(!1, \"Base should be between 2 and 36\");\n }),\n (BN.prototype.toNumber = function () {\n var ret = this.words[0];\n return (\n this.length === 2\n ? (ret += this.words[1] * 67108864)\n : this.length === 3 && this.words[2] === 1\n ? (ret += 4503599627370496 + this.words[1] * 67108864)\n : this.length > 2 && assert(!1, \"Number can only safely store up to 53 bits\"),\n this.negative !== 0 ? -ret : ret\n );\n }),\n (BN.prototype.toJSON = function () {\n return this.toString(16);\n }),\n (BN.prototype.toBuffer = function (endian, length) {\n return assert(typeof Buffer2 < \"u\"), this.toArrayLike(Buffer2, endian, length);\n }),\n (BN.prototype.toArray = function (endian, length) {\n return this.toArrayLike(Array, endian, length);\n }),\n (BN.prototype.toArrayLike = function (ArrayType, endian, length) {\n var byteLength = this.byteLength(),\n 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 this.strip();\n var littleEndian = endian === \"le\",\n res = new ArrayType(reqLength),\n b,\n i,\n q = this.clone();\n if (littleEndian) {\n for (i = 0; !q.isZero(); i++) (b = q.andln(255)), q.iushrn(8), (res[i] = b);\n for (; i < reqLength; i++) res[i] = 0;\n } else {\n for (i = 0; i < reqLength - byteLength; i++) res[i] = 0;\n for (i = 0; !q.isZero(); i++) (b = q.andln(255)), q.iushrn(8), (res[reqLength - i - 1] = b);\n }\n return res;\n }),\n Math.clz32\n ? (BN.prototype._countBits = function (w) {\n return 32 - Math.clz32(w);\n })\n : (BN.prototype._countBits = function (w) {\n var t = w,\n r = 0;\n return (\n t >= 4096 && ((r += 13), (t >>>= 13)),\n t >= 64 && ((r += 7), (t >>>= 7)),\n t >= 8 && ((r += 4), (t >>>= 4)),\n t >= 2 && ((r += 2), (t >>>= 2)),\n r + t\n );\n }),\n (BN.prototype._zeroBits = function (w) {\n if (w === 0) return 26;\n var t = w,\n r = 0;\n return (\n (t & 8191) === 0 && ((r += 13), (t >>>= 13)),\n (t & 127) === 0 && ((r += 7), (t >>>= 7)),\n (t & 15) === 0 && ((r += 4), (t >>>= 4)),\n (t & 3) === 0 && ((r += 2), (t >>>= 2)),\n (t & 1) === 0 && r++,\n r\n );\n }),\n (BN.prototype.bitLength = function () {\n var w = this.words[this.length - 1],\n hi = this._countBits(w);\n return (this.length - 1) * 26 + hi;\n });\n function toBitArray(num) {\n for (var w = new Array(num.bitLength()), bit = 0; bit < w.length; bit++) {\n var off = (bit / 26) | 0,\n wbit = bit % 26;\n w[bit] = (num.words[off] & (1 << wbit)) >>> wbit;\n }\n return w;\n }\n (BN.prototype.zeroBits = function () {\n if (this.isZero()) return 0;\n for (var r = 0, i = 0; i < this.length; i++) {\n var b = this._zeroBits(this.words[i]);\n if (((r += b), b !== 26)) break;\n }\n return r;\n }),\n (BN.prototype.byteLength = function () {\n return Math.ceil(this.bitLength() / 8);\n }),\n (BN.prototype.toTwos = function (width) {\n return this.negative !== 0 ? this.abs().inotn(width).iaddn(1) : this.clone();\n }),\n (BN.prototype.fromTwos = function (width) {\n return this.testn(width - 1) ? this.notn(width).iaddn(1).ineg() : this.clone();\n }),\n (BN.prototype.isNeg = function () {\n return this.negative !== 0;\n }),\n (BN.prototype.neg = function () {\n return this.clone().ineg();\n }),\n (BN.prototype.ineg = function () {\n return this.isZero() || (this.negative ^= 1), this;\n }),\n (BN.prototype.iuor = function (num) {\n for (; this.length < num.length; ) this.words[this.length++] = 0;\n for (var i = 0; i < num.length; i++) this.words[i] = this.words[i] | num.words[i];\n return this.strip();\n }),\n (BN.prototype.ior = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuor(num);\n }),\n (BN.prototype.or = function (num) {\n return this.length > num.length ? this.clone().ior(num) : num.clone().ior(this);\n }),\n (BN.prototype.uor = function (num) {\n return this.length > num.length ? this.clone().iuor(num) : num.clone().iuor(this);\n }),\n (BN.prototype.iuand = function (num) {\n var b;\n this.length > num.length ? (b = num) : (b = this);\n for (var i = 0; i < b.length; i++) this.words[i] = this.words[i] & num.words[i];\n return (this.length = b.length), this.strip();\n }),\n (BN.prototype.iand = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuand(num);\n }),\n (BN.prototype.and = function (num) {\n return this.length > num.length ? this.clone().iand(num) : num.clone().iand(this);\n }),\n (BN.prototype.uand = function (num) {\n return this.length > num.length ? this.clone().iuand(num) : num.clone().iuand(this);\n }),\n (BN.prototype.iuxor = function (num) {\n var a, b;\n this.length > num.length ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var i = 0; i < b.length; i++) this.words[i] = a.words[i] ^ b.words[i];\n if (this !== a) for (; i < a.length; i++) this.words[i] = a.words[i];\n return (this.length = a.length), this.strip();\n }),\n (BN.prototype.ixor = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuxor(num);\n }),\n (BN.prototype.xor = function (num) {\n return this.length > num.length ? this.clone().ixor(num) : num.clone().ixor(this);\n }),\n (BN.prototype.uxor = function (num) {\n return this.length > num.length ? this.clone().iuxor(num) : num.clone().iuxor(this);\n }),\n (BN.prototype.inotn = function (width) {\n assert(typeof width == \"number\" && width >= 0);\n var bytesNeeded = Math.ceil(width / 26) | 0,\n bitsLeft = width % 26;\n this._expand(bytesNeeded), bitsLeft > 0 && bytesNeeded--;\n for (var i = 0; i < bytesNeeded; i++) this.words[i] = ~this.words[i] & 67108863;\n return bitsLeft > 0 && (this.words[i] = ~this.words[i] & (67108863 >> (26 - bitsLeft))), this.strip();\n }),\n (BN.prototype.notn = function (width) {\n return this.clone().inotn(width);\n }),\n (BN.prototype.setn = function (bit, val) {\n assert(typeof bit == \"number\" && bit >= 0);\n var off = (bit / 26) | 0,\n wbit = bit % 26;\n return (\n this._expand(off + 1),\n val\n ? (this.words[off] = this.words[off] | (1 << wbit))\n : (this.words[off] = this.words[off] & ~(1 << wbit)),\n this.strip()\n );\n }),\n (BN.prototype.iadd = function (num) {\n var r;\n if (this.negative !== 0 && num.negative === 0)\n return (this.negative = 0), (r = this.isub(num)), (this.negative ^= 1), this._normSign();\n if (this.negative === 0 && num.negative !== 0)\n return (num.negative = 0), (r = this.isub(num)), (num.negative = 1), r._normSign();\n var a, b;\n this.length > num.length ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var carry = 0, i = 0; i < b.length; i++)\n (r = (a.words[i] | 0) + (b.words[i] | 0) + carry), (this.words[i] = r & 67108863), (carry = r >>> 26);\n for (; carry !== 0 && i < a.length; i++)\n (r = (a.words[i] | 0) + carry), (this.words[i] = r & 67108863), (carry = r >>> 26);\n if (((this.length = a.length), carry !== 0)) (this.words[this.length] = carry), this.length++;\n else if (a !== this) for (; i < a.length; i++) this.words[i] = a.words[i];\n return this;\n }),\n (BN.prototype.add = function (num) {\n var res;\n return num.negative !== 0 && this.negative === 0\n ? ((num.negative = 0), (res = this.sub(num)), (num.negative ^= 1), res)\n : num.negative === 0 && this.negative !== 0\n ? ((this.negative = 0), (res = num.sub(this)), (this.negative = 1), res)\n : this.length > num.length\n ? this.clone().iadd(num)\n : num.clone().iadd(this);\n }),\n (BN.prototype.isub = function (num) {\n if (num.negative !== 0) {\n num.negative = 0;\n var r = this.iadd(num);\n return (num.negative = 1), r._normSign();\n } else if (this.negative !== 0)\n return (this.negative = 0), this.iadd(num), (this.negative = 1), this._normSign();\n var cmp = this.cmp(num);\n if (cmp === 0) return (this.negative = 0), (this.length = 1), (this.words[0] = 0), this;\n var a, b;\n cmp > 0 ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var carry = 0, i = 0; i < b.length; i++)\n (r = (a.words[i] | 0) - (b.words[i] | 0) + carry), (carry = r >> 26), (this.words[i] = r & 67108863);\n for (; carry !== 0 && i < a.length; i++)\n (r = (a.words[i] | 0) + carry), (carry = r >> 26), (this.words[i] = r & 67108863);\n if (carry === 0 && i < a.length && a !== this) for (; i < a.length; i++) this.words[i] = a.words[i];\n return (this.length = Math.max(this.length, i)), a !== this && (this.negative = 1), this.strip();\n }),\n (BN.prototype.sub = function (num) {\n return this.clone().isub(num);\n });\n function smallMulTo(self2, num, out) {\n out.negative = num.negative ^ self2.negative;\n var len = (self2.length + num.length) | 0;\n (out.length = len), (len = (len - 1) | 0);\n var a = self2.words[0] | 0,\n b = num.words[0] | 0,\n r = a * b,\n lo = r & 67108863,\n carry = (r / 67108864) | 0;\n out.words[0] = lo;\n for (var k = 1; k < len; k++) {\n for (\n var ncarry = carry >>> 26,\n rword = carry & 67108863,\n maxJ = Math.min(k, num.length - 1),\n j = Math.max(0, k - self2.length + 1);\n j <= maxJ;\n j++\n ) {\n var i = (k - j) | 0;\n (a = self2.words[i] | 0),\n (b = num.words[j] | 0),\n (r = a * b + rword),\n (ncarry += (r / 67108864) | 0),\n (rword = r & 67108863);\n }\n (out.words[k] = rword | 0), (carry = ncarry | 0);\n }\n return carry !== 0 ? (out.words[k] = carry | 0) : out.length--, out.strip();\n }\n var comb10MulTo = function (self2, num, out) {\n var a = self2.words,\n b = num.words,\n o = out.words,\n c = 0,\n lo,\n mid,\n hi,\n a0 = a[0] | 0,\n al0 = a0 & 8191,\n ah0 = a0 >>> 13,\n a1 = a[1] | 0,\n al1 = a1 & 8191,\n ah1 = a1 >>> 13,\n a2 = a[2] | 0,\n al2 = a2 & 8191,\n ah2 = a2 >>> 13,\n a3 = a[3] | 0,\n al3 = a3 & 8191,\n ah3 = a3 >>> 13,\n a4 = a[4] | 0,\n al4 = a4 & 8191,\n ah4 = a4 >>> 13,\n a5 = a[5] | 0,\n al5 = a5 & 8191,\n ah5 = a5 >>> 13,\n a6 = a[6] | 0,\n al6 = a6 & 8191,\n ah6 = a6 >>> 13,\n a7 = a[7] | 0,\n al7 = a7 & 8191,\n ah7 = a7 >>> 13,\n a8 = a[8] | 0,\n al8 = a8 & 8191,\n ah8 = a8 >>> 13,\n a9 = a[9] | 0,\n al9 = a9 & 8191,\n ah9 = a9 >>> 13,\n b0 = b[0] | 0,\n bl0 = b0 & 8191,\n bh0 = b0 >>> 13,\n b1 = b[1] | 0,\n bl1 = b1 & 8191,\n bh1 = b1 >>> 13,\n b2 = b[2] | 0,\n bl2 = b2 & 8191,\n bh2 = b2 >>> 13,\n b3 = b[3] | 0,\n bl3 = b3 & 8191,\n bh3 = b3 >>> 13,\n b4 = b[4] | 0,\n bl4 = b4 & 8191,\n bh4 = b4 >>> 13,\n b5 = b[5] | 0,\n bl5 = b5 & 8191,\n bh5 = b5 >>> 13,\n b6 = b[6] | 0,\n bl6 = b6 & 8191,\n bh6 = b6 >>> 13,\n b7 = b[7] | 0,\n bl7 = b7 & 8191,\n bh7 = b7 >>> 13,\n b8 = b[8] | 0,\n bl8 = b8 & 8191,\n bh8 = b8 >>> 13,\n b9 = b[9] | 0,\n bl9 = b9 & 8191,\n bh9 = b9 >>> 13;\n (out.negative = self2.negative ^ num.negative),\n (out.length = 19),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w0 >>> 26)) | 0),\n (w0 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w1 >>> 26)) | 0),\n (w1 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w2 >>> 26)) | 0),\n (w2 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w3 >>> 26)) | 0),\n (w3 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w4 >>> 26)) | 0),\n (w4 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w5 >>> 26)) | 0),\n (w5 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w6 >>> 26)) | 0),\n (w6 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w7 >>> 26)) | 0),\n (w7 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w8 >>> 26)) | 0),\n (w8 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w9 >>> 26)) | 0),\n (w9 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w10 >>> 26)) | 0),\n (w10 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w11 >>> 26)) | 0),\n (w11 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w12 >>> 26)) | 0),\n (w12 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w13 >>> 26)) | 0),\n (w13 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w14 >>> 26)) | 0),\n (w14 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w15 >>> 26)) | 0),\n (w15 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w16 >>> 26)) | 0),\n (w16 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w17 >>> 26)) | 0),\n (w17 &= 67108863),\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 & 8191) << 13)) | 0;\n return (\n (c = (((hi + (mid >>> 13)) | 0) + (w18 >>> 26)) | 0),\n (w18 &= 67108863),\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 c !== 0 && ((o[19] = c), out.length++),\n out\n );\n };\n Math.imul || (comb10MulTo = smallMulTo);\n function bigMulTo(self2, num, out) {\n (out.negative = num.negative ^ self2.negative), (out.length = self2.length + num.length);\n for (var carry = 0, hncarry = 0, k = 0; k < out.length - 1; k++) {\n var ncarry = hncarry;\n hncarry = 0;\n for (\n var rword = carry & 67108863, maxJ = Math.min(k, num.length - 1), j = Math.max(0, k - self2.length + 1);\n j <= maxJ;\n j++\n ) {\n var i = k - j,\n a = self2.words[i] | 0,\n b = num.words[j] | 0,\n r = a * b,\n lo = r & 67108863;\n (ncarry = (ncarry + ((r / 67108864) | 0)) | 0),\n (lo = (lo + rword) | 0),\n (rword = lo & 67108863),\n (ncarry = (ncarry + (lo >>> 26)) | 0),\n (hncarry += ncarry >>> 26),\n (ncarry &= 67108863);\n }\n (out.words[k] = rword), (carry = ncarry), (ncarry = hncarry);\n }\n return carry !== 0 ? (out.words[k] = carry) : out.length--, out.strip();\n }\n function jumboMulTo(self2, num, out) {\n var fftm = new FFTM();\n return fftm.mulp(self2, num, out);\n }\n BN.prototype.mulTo = function (num, out) {\n var res,\n len = this.length + num.length;\n return (\n this.length === 10 && num.length === 10\n ? (res = comb10MulTo(this, num, out))\n : len < 63\n ? (res = smallMulTo(this, num, out))\n : len < 1024\n ? (res = bigMulTo(this, num, out))\n : (res = jumboMulTo(this, num, out)),\n res\n );\n };\n function FFTM(x, y) {\n (this.x = x), (this.y = y);\n }\n (FFTM.prototype.makeRBT = function (N) {\n for (var t = new Array(N), l = BN.prototype._countBits(N) - 1, i = 0; i < N; i++) t[i] = this.revBin(i, l, N);\n return t;\n }),\n (FFTM.prototype.revBin = function (x, l, N) {\n if (x === 0 || x === N - 1) return x;\n for (var rb = 0, i = 0; i < l; i++) (rb |= (x & 1) << (l - i - 1)), (x >>= 1);\n return rb;\n }),\n (FFTM.prototype.permute = function (rbt, rws, iws, rtws, itws, N) {\n for (var i = 0; i < N; i++) (rtws[i] = rws[rbt[i]]), (itws[i] = iws[rbt[i]]);\n }),\n (FFTM.prototype.transform = function (rws, iws, rtws, itws, N, rbt) {\n this.permute(rbt, rws, iws, rtws, itws, N);\n for (var s = 1; s < N; s <<= 1)\n for (\n var l = s << 1, rtwdf = Math.cos((2 * Math.PI) / l), itwdf = Math.sin((2 * Math.PI) / l), p = 0;\n p < N;\n p += l\n )\n for (var rtwdf_ = rtwdf, itwdf_ = itwdf, j = 0; j < s; j++) {\n var re = rtws[p + j],\n ie = itws[p + j],\n ro = rtws[p + j + s],\n io = itws[p + j + s],\n rx = rtwdf_ * ro - itwdf_ * io;\n (io = rtwdf_ * io + itwdf_ * ro),\n (ro = rx),\n (rtws[p + j] = re + ro),\n (itws[p + j] = ie + io),\n (rtws[p + j + s] = re - ro),\n (itws[p + j + s] = ie - io),\n j !== l &&\n ((rx = rtwdf * rtwdf_ - itwdf * itwdf_), (itwdf_ = rtwdf * itwdf_ + itwdf * rtwdf_), (rtwdf_ = rx));\n }\n }),\n (FFTM.prototype.guessLen13b = function (n, m) {\n var N = Math.max(m, n) | 1,\n odd = N & 1,\n i = 0;\n for (N = (N / 2) | 0; N; N = N >>> 1) i++;\n return 1 << (i + 1 + odd);\n }),\n (FFTM.prototype.conjugate = function (rws, iws, N) {\n if (!(N <= 1))\n for (var i = 0; i < N / 2; i++) {\n var t = rws[i];\n (rws[i] = rws[N - i - 1]),\n (rws[N - i - 1] = t),\n (t = iws[i]),\n (iws[i] = -iws[N - i - 1]),\n (iws[N - i - 1] = -t);\n }\n }),\n (FFTM.prototype.normalize13b = function (ws, N) {\n for (var carry = 0, i = 0; i < N / 2; i++) {\n var w = Math.round(ws[2 * i + 1] / N) * 8192 + Math.round(ws[2 * i] / N) + carry;\n (ws[i] = w & 67108863), w < 67108864 ? (carry = 0) : (carry = (w / 67108864) | 0);\n }\n return ws;\n }),\n (FFTM.prototype.convert13b = function (ws, len, rws, N) {\n for (var carry = 0, i = 0; i < len; i++)\n (carry = carry + (ws[i] | 0)),\n (rws[2 * i] = carry & 8191),\n (carry = carry >>> 13),\n (rws[2 * i + 1] = carry & 8191),\n (carry = carry >>> 13);\n for (i = 2 * len; i < N; ++i) rws[i] = 0;\n assert(carry === 0), assert((carry & -8192) === 0);\n }),\n (FFTM.prototype.stub = function (N) {\n for (var ph = new Array(N), i = 0; i < N; i++) ph[i] = 0;\n return ph;\n }),\n (FFTM.prototype.mulp = function (x, y, out) {\n var N = 2 * this.guessLen13b(x.length, y.length),\n rbt = this.makeRBT(N),\n _ = this.stub(N),\n rws = new Array(N),\n rwst = new Array(N),\n iwst = new Array(N),\n nrws = new Array(N),\n nrwst = new Array(N),\n niwst = new Array(N),\n rmws = out.words;\n (rmws.length = N),\n this.convert13b(x.words, x.length, rws, N),\n this.convert13b(y.words, y.length, nrws, N),\n this.transform(rws, _, rwst, iwst, N, rbt),\n this.transform(nrws, _, nrwst, niwst, N, rbt);\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]), (rwst[i] = rx);\n }\n return (\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 (out.negative = x.negative ^ y.negative),\n (out.length = x.length + y.length),\n out.strip()\n );\n }),\n (BN.prototype.mul = function (num) {\n var out = new BN(null);\n return (out.words = new Array(this.length + num.length)), this.mulTo(num, out);\n }),\n (BN.prototype.mulf = function (num) {\n var out = new BN(null);\n return (out.words = new Array(this.length + num.length)), jumboMulTo(this, num, out);\n }),\n (BN.prototype.imul = function (num) {\n return this.clone().mulTo(num, this);\n }),\n (BN.prototype.imuln = function (num) {\n assert(typeof num == \"number\"), assert(num < 67108864);\n for (var carry = 0, i = 0; i < this.length; i++) {\n var w = (this.words[i] | 0) * num,\n lo = (w & 67108863) + (carry & 67108863);\n (carry >>= 26), (carry += (w / 67108864) | 0), (carry += lo >>> 26), (this.words[i] = lo & 67108863);\n }\n return carry !== 0 && ((this.words[i] = carry), this.length++), this;\n }),\n (BN.prototype.muln = function (num) {\n return this.clone().imuln(num);\n }),\n (BN.prototype.sqr = function () {\n return this.mul(this);\n }),\n (BN.prototype.isqr = function () {\n return this.imul(this.clone());\n }),\n (BN.prototype.pow = function (num) {\n var w = toBitArray(num);\n if (w.length === 0) return new BN(1);\n for (var res = this, i = 0; i < w.length && w[i] === 0; i++, res = res.sqr());\n if (++i < w.length) for (var q = res.sqr(); i < w.length; i++, q = q.sqr()) w[i] !== 0 && (res = res.mul(q));\n return res;\n }),\n (BN.prototype.iushln = function (bits) {\n assert(typeof bits == \"number\" && bits >= 0);\n var r = bits % 26,\n s = (bits - r) / 26,\n carryMask = (67108863 >>> (26 - r)) << (26 - r),\n i;\n if (r !== 0) {\n var carry = 0;\n for (i = 0; i < this.length; i++) {\n var newCarry = this.words[i] & carryMask,\n c = ((this.words[i] | 0) - newCarry) << r;\n (this.words[i] = c | carry), (carry = newCarry >>> (26 - r));\n }\n carry && ((this.words[i] = carry), this.length++);\n }\n if (s !== 0) {\n for (i = this.length - 1; i >= 0; i--) this.words[i + s] = this.words[i];\n for (i = 0; i < s; i++) this.words[i] = 0;\n this.length += s;\n }\n return this.strip();\n }),\n (BN.prototype.ishln = function (bits) {\n return assert(this.negative === 0), this.iushln(bits);\n }),\n (BN.prototype.iushrn = function (bits, hint, extended) {\n assert(typeof bits == \"number\" && bits >= 0);\n var h;\n hint ? (h = (hint - (hint % 26)) / 26) : (h = 0);\n var r = bits % 26,\n s = Math.min((bits - r) / 26, this.length),\n mask = 67108863 ^ ((67108863 >>> r) << r),\n maskedWords = extended;\n if (((h -= s), (h = Math.max(0, h)), maskedWords)) {\n for (var i = 0; i < s; i++) maskedWords.words[i] = this.words[i];\n maskedWords.length = s;\n }\n if (s !== 0)\n if (this.length > s) for (this.length -= s, i = 0; i < this.length; i++) this.words[i] = this.words[i + s];\n else (this.words[0] = 0), (this.length = 1);\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)), (carry = word & mask);\n }\n return (\n maskedWords && carry !== 0 && (maskedWords.words[maskedWords.length++] = carry),\n this.length === 0 && ((this.words[0] = 0), (this.length = 1)),\n this.strip()\n );\n }),\n (BN.prototype.ishrn = function (bits, hint, extended) {\n return assert(this.negative === 0), this.iushrn(bits, hint, extended);\n }),\n (BN.prototype.shln = function (bits) {\n return this.clone().ishln(bits);\n }),\n (BN.prototype.ushln = function (bits) {\n return this.clone().iushln(bits);\n }),\n (BN.prototype.shrn = function (bits) {\n return this.clone().ishrn(bits);\n }),\n (BN.prototype.ushrn = function (bits) {\n return this.clone().iushrn(bits);\n }),\n (BN.prototype.testn = function (bit) {\n assert(typeof bit == \"number\" && bit >= 0);\n var r = bit % 26,\n s = (bit - r) / 26,\n q = 1 << r;\n if (this.length <= s) return !1;\n var w = this.words[s];\n return !!(w & q);\n }),\n (BN.prototype.imaskn = function (bits) {\n assert(typeof bits == \"number\" && bits >= 0);\n var r = bits % 26,\n s = (bits - r) / 26;\n if ((assert(this.negative === 0, \"imaskn works only with positive numbers\"), this.length <= s)) return this;\n if ((r !== 0 && s++, (this.length = Math.min(s, this.length)), r !== 0)) {\n var mask = 67108863 ^ ((67108863 >>> r) << r);\n this.words[this.length - 1] &= mask;\n }\n return this.strip();\n }),\n (BN.prototype.maskn = function (bits) {\n return this.clone().imaskn(bits);\n }),\n (BN.prototype.iaddn = function (num) {\n return (\n assert(typeof num == \"number\"),\n assert(num < 67108864),\n num < 0\n ? this.isubn(-num)\n : this.negative !== 0\n ? this.length === 1 && (this.words[0] | 0) < num\n ? ((this.words[0] = num - (this.words[0] | 0)), (this.negative = 0), this)\n : ((this.negative = 0), this.isubn(num), (this.negative = 1), this)\n : this._iaddn(num)\n );\n }),\n (BN.prototype._iaddn = function (num) {\n this.words[0] += num;\n for (var i = 0; i < this.length && this.words[i] >= 67108864; i++)\n (this.words[i] -= 67108864), i === this.length - 1 ? (this.words[i + 1] = 1) : this.words[i + 1]++;\n return (this.length = Math.max(this.length, i + 1)), this;\n }),\n (BN.prototype.isubn = function (num) {\n if ((assert(typeof num == \"number\"), assert(num < 67108864), num < 0)) return this.iaddn(-num);\n if (this.negative !== 0) return (this.negative = 0), this.iaddn(num), (this.negative = 1), this;\n if (((this.words[0] -= num), this.length === 1 && this.words[0] < 0))\n (this.words[0] = -this.words[0]), (this.negative = 1);\n else\n for (var i = 0; i < this.length && this.words[i] < 0; i++)\n (this.words[i] += 67108864), (this.words[i + 1] -= 1);\n return this.strip();\n }),\n (BN.prototype.addn = function (num) {\n return this.clone().iaddn(num);\n }),\n (BN.prototype.subn = function (num) {\n return this.clone().isubn(num);\n }),\n (BN.prototype.iabs = function () {\n return (this.negative = 0), this;\n }),\n (BN.prototype.abs = function () {\n return this.clone().iabs();\n }),\n (BN.prototype._ishlnsubmul = function (num, mul, shift) {\n var len = num.length + shift,\n i;\n this._expand(len);\n var w,\n 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 & 67108863),\n (carry = (w >> 26) - ((right / 67108864) | 0)),\n (this.words[i + shift] = w & 67108863);\n }\n for (; i < this.length - shift; i++)\n (w = (this.words[i + shift] | 0) + carry), (carry = w >> 26), (this.words[i + shift] = w & 67108863);\n if (carry === 0) return this.strip();\n for (assert(carry === -1), carry = 0, i = 0; i < this.length; i++)\n (w = -(this.words[i] | 0) + carry), (carry = w >> 26), (this.words[i] = w & 67108863);\n return (this.negative = 1), this.strip();\n }),\n (BN.prototype._wordDiv = function (num, mode) {\n var shift = this.length - num.length,\n a = this.clone(),\n b = num,\n bhi = b.words[b.length - 1] | 0,\n bhiBits = this._countBits(bhi);\n (shift = 26 - bhiBits),\n shift !== 0 && ((b = b.ushln(shift)), a.iushln(shift), (bhi = b.words[b.length - 1] | 0));\n var m = a.length - b.length,\n q;\n if (mode !== \"mod\") {\n (q = new BN(null)), (q.length = m + 1), (q.words = new Array(q.length));\n for (var i = 0; i < q.length; i++) q.words[i] = 0;\n }\n var diff = a.clone()._ishlnsubmul(b, 1, m);\n diff.negative === 0 && ((a = diff), q && (q.words[m] = 1));\n for (var j = m - 1; j >= 0; j--) {\n var qj = (a.words[b.length + j] | 0) * 67108864 + (a.words[b.length + j - 1] | 0);\n for (qj = Math.min((qj / bhi) | 0, 67108863), a._ishlnsubmul(b, qj, j); a.negative !== 0; )\n qj--, (a.negative = 0), a._ishlnsubmul(b, 1, j), a.isZero() || (a.negative ^= 1);\n q && (q.words[j] = qj);\n }\n return (\n q && q.strip(),\n a.strip(),\n mode !== \"div\" && shift !== 0 && a.iushrn(shift),\n {\n div: q || null,\n mod: a,\n }\n );\n }),\n (BN.prototype.divmod = function (num, mode, positive) {\n if ((assert(!num.isZero()), this.isZero()))\n return {\n div: new BN(0),\n mod: new BN(0),\n };\n var div, mod, res;\n return this.negative !== 0 && num.negative === 0\n ? ((res = this.neg().divmod(num, mode)),\n mode !== \"mod\" && (div = res.div.neg()),\n mode !== \"div\" && ((mod = res.mod.neg()), positive && mod.negative !== 0 && mod.iadd(num)),\n {\n div,\n mod,\n })\n : this.negative === 0 && num.negative !== 0\n ? ((res = this.divmod(num.neg(), mode)),\n mode !== \"mod\" && (div = res.div.neg()),\n {\n div,\n mod: res.mod,\n })\n : (this.negative & num.negative) !== 0\n ? ((res = this.neg().divmod(num.neg(), mode)),\n mode !== \"div\" && ((mod = res.mod.neg()), positive && mod.negative !== 0 && mod.isub(num)),\n {\n div: res.div,\n mod,\n })\n : num.length > this.length || this.cmp(num) < 0\n ? {\n div: new BN(0),\n mod: this,\n }\n : num.length === 1\n ? mode === \"div\"\n ? {\n div: this.divn(num.words[0]),\n mod: null,\n }\n : mode === \"mod\"\n ? {\n div: null,\n mod: new BN(this.modn(num.words[0])),\n }\n : {\n div: this.divn(num.words[0]),\n mod: new BN(this.modn(num.words[0])),\n }\n : this._wordDiv(num, mode);\n }),\n (BN.prototype.div = function (num) {\n return this.divmod(num, \"div\", !1).div;\n }),\n (BN.prototype.mod = function (num) {\n return this.divmod(num, \"mod\", !1).mod;\n }),\n (BN.prototype.umod = function (num) {\n return this.divmod(num, \"mod\", !0).mod;\n }),\n (BN.prototype.divRound = function (num) {\n var dm = this.divmod(num);\n if (dm.mod.isZero()) return dm.div;\n var mod = dm.div.negative !== 0 ? dm.mod.isub(num) : dm.mod,\n half = num.ushrn(1),\n r2 = num.andln(1),\n cmp = mod.cmp(half);\n return cmp < 0 || (r2 === 1 && cmp === 0)\n ? dm.div\n : dm.div.negative !== 0\n ? dm.div.isubn(1)\n : dm.div.iaddn(1);\n }),\n (BN.prototype.modn = function (num) {\n assert(num <= 67108863);\n for (var p = (1 << 26) % num, acc = 0, i = this.length - 1; i >= 0; i--)\n acc = (p * acc + (this.words[i] | 0)) % num;\n return acc;\n }),\n (BN.prototype.idivn = function (num) {\n assert(num <= 67108863);\n for (var carry = 0, i = this.length - 1; i >= 0; i--) {\n var w = (this.words[i] | 0) + carry * 67108864;\n (this.words[i] = (w / num) | 0), (carry = w % num);\n }\n return this.strip();\n }),\n (BN.prototype.divn = function (num) {\n return this.clone().idivn(num);\n }),\n (BN.prototype.egcd = function (p) {\n assert(p.negative === 0), assert(!p.isZero());\n var x = this,\n y = p.clone();\n x.negative !== 0 ? (x = x.umod(p)) : (x = x.clone());\n for (var A = new BN(1), B = new BN(0), C = new BN(0), D = new BN(1), g = 0; x.isEven() && y.isEven(); )\n x.iushrn(1), y.iushrn(1), ++g;\n for (var yp = y.clone(), xp = x.clone(); !x.isZero(); ) {\n for (var i = 0, im = 1; (x.words[0] & im) === 0 && i < 26; ++i, im <<= 1);\n if (i > 0)\n for (x.iushrn(i); i-- > 0; )\n (A.isOdd() || B.isOdd()) && (A.iadd(yp), B.isub(xp)), A.iushrn(1), B.iushrn(1);\n for (var j = 0, jm = 1; (y.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n if (j > 0)\n for (y.iushrn(j); j-- > 0; )\n (C.isOdd() || D.isOdd()) && (C.iadd(yp), D.isub(xp)), C.iushrn(1), D.iushrn(1);\n x.cmp(y) >= 0 ? (x.isub(y), A.isub(C), B.isub(D)) : (y.isub(x), C.isub(A), D.isub(B));\n }\n return {\n a: C,\n b: D,\n gcd: y.iushln(g),\n };\n }),\n (BN.prototype._invmp = function (p) {\n assert(p.negative === 0), assert(!p.isZero());\n var a = this,\n b = p.clone();\n a.negative !== 0 ? (a = a.umod(p)) : (a = a.clone());\n for (var x1 = new BN(1), x2 = new BN(0), delta = b.clone(); 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) for (a.iushrn(i); i-- > 0; ) x1.isOdd() && x1.iadd(delta), x1.iushrn(1);\n for (var j = 0, jm = 1; (b.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n if (j > 0) for (b.iushrn(j); j-- > 0; ) x2.isOdd() && x2.iadd(delta), x2.iushrn(1);\n a.cmp(b) >= 0 ? (a.isub(b), x1.isub(x2)) : (b.isub(a), x2.isub(x1));\n }\n var res;\n return a.cmpn(1) === 0 ? (res = x1) : (res = x2), res.cmpn(0) < 0 && res.iadd(p), res;\n }),\n (BN.prototype.gcd = function (num) {\n if (this.isZero()) return num.abs();\n if (num.isZero()) return this.abs();\n var a = this.clone(),\n b = num.clone();\n (a.negative = 0), (b.negative = 0);\n for (var shift = 0; a.isEven() && b.isEven(); shift++) a.iushrn(1), b.iushrn(1);\n do {\n for (; a.isEven(); ) a.iushrn(1);\n for (; b.isEven(); ) b.iushrn(1);\n var r = a.cmp(b);\n if (r < 0) {\n var t = a;\n (a = b), (b = t);\n } else if (r === 0 || b.cmpn(1) === 0) break;\n a.isub(b);\n } while (!0);\n return b.iushln(shift);\n }),\n (BN.prototype.invm = function (num) {\n return this.egcd(num).a.umod(num);\n }),\n (BN.prototype.isEven = function () {\n return (this.words[0] & 1) === 0;\n }),\n (BN.prototype.isOdd = function () {\n return (this.words[0] & 1) === 1;\n }),\n (BN.prototype.andln = function (num) {\n return this.words[0] & num;\n }),\n (BN.prototype.bincn = function (bit) {\n assert(typeof bit == \"number\");\n var r = bit % 26,\n s = (bit - r) / 26,\n q = 1 << r;\n if (this.length <= s) return this._expand(s + 1), (this.words[s] |= q), this;\n for (var carry = q, i = s; carry !== 0 && i < this.length; i++) {\n var w = this.words[i] | 0;\n (w += carry), (carry = w >>> 26), (w &= 67108863), (this.words[i] = w);\n }\n return carry !== 0 && ((this.words[i] = carry), this.length++), this;\n }),\n (BN.prototype.isZero = function () {\n return this.length === 1 && this.words[0] === 0;\n }),\n (BN.prototype.cmpn = function (num) {\n var negative = num < 0;\n if (this.negative !== 0 && !negative) return -1;\n if (this.negative === 0 && negative) return 1;\n this.strip();\n var res;\n if (this.length > 1) res = 1;\n else {\n negative && (num = -num), assert(num <= 67108863, \"Number is too big\");\n var w = this.words[0] | 0;\n res = w === num ? 0 : w < num ? -1 : 1;\n }\n return this.negative !== 0 ? -res | 0 : res;\n }),\n (BN.prototype.cmp = function (num) {\n if (this.negative !== 0 && num.negative === 0) return -1;\n if (this.negative === 0 && num.negative !== 0) return 1;\n var res = this.ucmp(num);\n return this.negative !== 0 ? -res | 0 : res;\n }),\n (BN.prototype.ucmp = function (num) {\n if (this.length > num.length) return 1;\n if (this.length < num.length) return -1;\n for (var res = 0, i = this.length - 1; i >= 0; i--) {\n var a = this.words[i] | 0,\n b = num.words[i] | 0;\n if (a !== b) {\n a < b ? (res = -1) : a > b && (res = 1);\n break;\n }\n }\n return res;\n }),\n (BN.prototype.gtn = function (num) {\n return this.cmpn(num) === 1;\n }),\n (BN.prototype.gt = function (num) {\n return this.cmp(num) === 1;\n }),\n (BN.prototype.gten = function (num) {\n return this.cmpn(num) >= 0;\n }),\n (BN.prototype.gte = function (num) {\n return this.cmp(num) >= 0;\n }),\n (BN.prototype.ltn = function (num) {\n return this.cmpn(num) === -1;\n }),\n (BN.prototype.lt = function (num) {\n return this.cmp(num) === -1;\n }),\n (BN.prototype.lten = function (num) {\n return this.cmpn(num) <= 0;\n }),\n (BN.prototype.lte = function (num) {\n return this.cmp(num) <= 0;\n }),\n (BN.prototype.eqn = function (num) {\n return this.cmpn(num) === 0;\n }),\n (BN.prototype.eq = function (num) {\n return this.cmp(num) === 0;\n }),\n (BN.red = function (num) {\n return new Red(num);\n }),\n (BN.prototype.toRed = function (ctx) {\n return (\n assert(!this.red, \"Already a number in reduction context\"),\n assert(this.negative === 0, \"red works only with positives\"),\n ctx.convertTo(this)._forceRed(ctx)\n );\n }),\n (BN.prototype.fromRed = function () {\n return assert(this.red, \"fromRed works only with numbers in reduction context\"), this.red.convertFrom(this);\n }),\n (BN.prototype._forceRed = function (ctx) {\n return (this.red = ctx), this;\n }),\n (BN.prototype.forceRed = function (ctx) {\n return assert(!this.red, \"Already a number in reduction context\"), this._forceRed(ctx);\n }),\n (BN.prototype.redAdd = function (num) {\n return assert(this.red, \"redAdd works only with red numbers\"), this.red.add(this, num);\n }),\n (BN.prototype.redIAdd = function (num) {\n return assert(this.red, \"redIAdd works only with red numbers\"), this.red.iadd(this, num);\n }),\n (BN.prototype.redSub = function (num) {\n return assert(this.red, \"redSub works only with red numbers\"), this.red.sub(this, num);\n }),\n (BN.prototype.redISub = function (num) {\n return assert(this.red, \"redISub works only with red numbers\"), this.red.isub(this, num);\n }),\n (BN.prototype.redShl = function (num) {\n return assert(this.red, \"redShl works only with red numbers\"), this.red.shl(this, num);\n }),\n (BN.prototype.redMul = function (num) {\n return (\n assert(this.red, \"redMul works only with red numbers\"),\n this.red._verify2(this, num),\n this.red.mul(this, num)\n );\n }),\n (BN.prototype.redIMul = function (num) {\n return (\n assert(this.red, \"redMul works only with red numbers\"),\n this.red._verify2(this, num),\n this.red.imul(this, num)\n );\n }),\n (BN.prototype.redSqr = function () {\n return assert(this.red, \"redSqr works only with red numbers\"), this.red._verify1(this), this.red.sqr(this);\n }),\n (BN.prototype.redISqr = function () {\n return assert(this.red, \"redISqr works only with red numbers\"), this.red._verify1(this), this.red.isqr(this);\n }),\n (BN.prototype.redSqrt = function () {\n return assert(this.red, \"redSqrt works only with red numbers\"), this.red._verify1(this), this.red.sqrt(this);\n }),\n (BN.prototype.redInvm = function () {\n return assert(this.red, \"redInvm works only with red numbers\"), this.red._verify1(this), this.red.invm(this);\n }),\n (BN.prototype.redNeg = function () {\n return assert(this.red, \"redNeg works only with red numbers\"), this.red._verify1(this), this.red.neg(this);\n }),\n (BN.prototype.redPow = function (num) {\n return assert(this.red && !num.red, \"redPow(normalNum)\"), this.red._verify1(this), this.red.pow(this, num);\n });\n var primes = {\n k256: null,\n p224: null,\n p192: null,\n p25519: null,\n };\n function MPrime(name, p) {\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 (this.tmp = this._tmp());\n }\n (MPrime.prototype._tmp = function () {\n var tmp = new BN(null);\n return (tmp.words = new Array(Math.ceil(this.n / 13))), tmp;\n }),\n (MPrime.prototype.ireduce = function (num) {\n var r = num,\n rlen;\n do this.split(r, this.tmp), (r = this.imulK(r)), (r = r.iadd(this.tmp)), (rlen = r.bitLength());\n while (rlen > this.n);\n var cmp = rlen < this.n ? -1 : r.ucmp(this.p);\n return (\n cmp === 0\n ? ((r.words[0] = 0), (r.length = 1))\n : cmp > 0\n ? r.isub(this.p)\n : r.strip !== void 0\n ? r.strip()\n : r._strip(),\n r\n );\n }),\n (MPrime.prototype.split = function (input, out) {\n input.iushrn(this.n, 0, out);\n }),\n (MPrime.prototype.imulK = function (num) {\n return num.imul(this.k);\n });\n function K256() {\n MPrime.call(this, \"k256\", \"ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f\");\n }\n inherits(K256, MPrime),\n (K256.prototype.split = function (input, output) {\n for (var mask = 4194303, outLen = Math.min(input.length, 9), i = 0; i < outLen; i++)\n output.words[i] = input.words[i];\n if (((output.length = outLen), input.length <= 9)) {\n (input.words[0] = 0), (input.length = 1);\n return;\n }\n var prev = input.words[9];\n for (output.words[output.length++] = prev & mask, i = 10; i < input.length; i++) {\n var next = input.words[i] | 0;\n (input.words[i - 10] = ((next & mask) << 4) | (prev >>> 22)), (prev = next);\n }\n (prev >>>= 22),\n (input.words[i - 10] = prev),\n prev === 0 && input.length > 10 ? (input.length -= 10) : (input.length -= 9);\n }),\n (K256.prototype.imulK = function (num) {\n (num.words[num.length] = 0), (num.words[num.length + 1] = 0), (num.length += 2);\n for (var lo = 0, i = 0; i < num.length; i++) {\n var w = num.words[i] | 0;\n (lo += w * 977), (num.words[i] = lo & 67108863), (lo = w * 64 + ((lo / 67108864) | 0));\n }\n return (\n num.words[num.length - 1] === 0 && (num.length--, num.words[num.length - 1] === 0 && num.length--), num\n );\n });\n function P224() {\n MPrime.call(this, \"p224\", \"ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001\");\n }\n inherits(P224, MPrime);\n function P192() {\n MPrime.call(this, \"p192\", \"ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff\");\n }\n inherits(P192, MPrime);\n function P25519() {\n MPrime.call(this, \"25519\", \"7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed\");\n }\n inherits(P25519, MPrime),\n (P25519.prototype.imulK = function (num) {\n for (var carry = 0, i = 0; i < num.length; i++) {\n var hi = (num.words[i] | 0) * 19 + carry,\n lo = hi & 67108863;\n (hi >>>= 26), (num.words[i] = lo), (carry = hi);\n }\n return carry !== 0 && (num.words[num.length++] = carry), num;\n }),\n (BN._prime = function (name) {\n if (primes[name]) return primes[name];\n var prime2;\n if (name === \"k256\") prime2 = new K256();\n else if (name === \"p224\") prime2 = new P224();\n else if (name === \"p192\") prime2 = new P192();\n else if (name === \"p25519\") prime2 = new P25519();\n else throw new Error(\"Unknown prime \" + name);\n return (primes[name] = prime2), prime2;\n });\n function Red(m) {\n if (typeof m == \"string\") {\n var prime = BN._prime(m);\n (this.m = prime.p), (this.prime = prime);\n } else assert(m.gtn(1), \"modulus must be greater than 1\"), (this.m = m), (this.prime = null);\n }\n (Red.prototype._verify1 = function (a) {\n assert(a.negative === 0, \"red works only with positives\"), assert(a.red, \"red works only with red numbers\");\n }),\n (Red.prototype._verify2 = function (a, b) {\n assert((a.negative | b.negative) === 0, \"red works only with positives\"),\n assert(a.red && a.red === b.red, \"red works only with red numbers\");\n }),\n (Red.prototype.imod = function (a) {\n return this.prime ? this.prime.ireduce(a)._forceRed(this) : a.umod(this.m)._forceRed(this);\n }),\n (Red.prototype.neg = function (a) {\n return a.isZero() ? a.clone() : this.m.sub(a)._forceRed(this);\n }),\n (Red.prototype.add = function (a, b) {\n this._verify2(a, b);\n var res = a.add(b);\n return res.cmp(this.m) >= 0 && res.isub(this.m), res._forceRed(this);\n }),\n (Red.prototype.iadd = function (a, b) {\n this._verify2(a, b);\n var res = a.iadd(b);\n return res.cmp(this.m) >= 0 && res.isub(this.m), res;\n }),\n (Red.prototype.sub = function (a, b) {\n this._verify2(a, b);\n var res = a.sub(b);\n return res.cmpn(0) < 0 && res.iadd(this.m), res._forceRed(this);\n }),\n (Red.prototype.isub = function (a, b) {\n this._verify2(a, b);\n var res = a.isub(b);\n return res.cmpn(0) < 0 && res.iadd(this.m), res;\n }),\n (Red.prototype.shl = function (a, num) {\n return this._verify1(a), this.imod(a.ushln(num));\n }),\n (Red.prototype.imul = function (a, b) {\n return this._verify2(a, b), this.imod(a.imul(b));\n }),\n (Red.prototype.mul = function (a, b) {\n return this._verify2(a, b), this.imod(a.mul(b));\n }),\n (Red.prototype.isqr = function (a) {\n return this.imul(a, a.clone());\n }),\n (Red.prototype.sqr = function (a) {\n return this.mul(a, a);\n }),\n (Red.prototype.sqrt = function (a) {\n if (a.isZero()) return a.clone();\n var mod3 = this.m.andln(3);\n if ((assert(mod3 % 2 === 1), mod3 === 3)) {\n var pow = this.m.add(new BN(1)).iushrn(2);\n return this.pow(a, pow);\n }\n for (var q = this.m.subn(1), s = 0; !q.isZero() && q.andln(1) === 0; ) s++, q.iushrn(1);\n assert(!q.isZero());\n var one = new BN(1).toRed(this),\n nOne = one.redNeg(),\n lpow = this.m.subn(1).iushrn(1),\n z = this.m.bitLength();\n for (z = new BN(2 * z * z).toRed(this); this.pow(z, lpow).cmp(nOne) !== 0; ) z.redIAdd(nOne);\n for (\n var c = this.pow(z, q), r = this.pow(a, q.addn(1).iushrn(1)), t = this.pow(a, q), m = s;\n t.cmp(one) !== 0;\n\n ) {\n for (var tmp = t, i = 0; tmp.cmp(one) !== 0; i++) tmp = tmp.redSqr();\n assert(i < m);\n var b = this.pow(c, new BN(1).iushln(m - i - 1));\n (r = r.redMul(b)), (c = b.redSqr()), (t = t.redMul(c)), (m = i);\n }\n return r;\n }),\n (Red.prototype.invm = function (a) {\n var inv = a._invmp(this.m);\n return inv.negative !== 0 ? ((inv.negative = 0), this.imod(inv).redNeg()) : this.imod(inv);\n }),\n (Red.prototype.pow = function (a, num) {\n if (num.isZero()) return new BN(1).toRed(this);\n if (num.cmpn(1) === 0) return a.clone();\n var windowSize = 4,\n wnd = new Array(1 << windowSize);\n (wnd[0] = new BN(1).toRed(this)), (wnd[1] = a);\n for (var i = 2; i < wnd.length; i++) wnd[i] = this.mul(wnd[i - 1], a);\n var res = wnd[0],\n current = 0,\n currentLen = 0,\n start = num.bitLength() % 26;\n for (start === 0 && (start = 26), i = num.length - 1; i >= 0; i--) {\n for (var word = num.words[i], j = start - 1; j >= 0; j--) {\n var bit = (word >> j) & 1;\n if ((res !== wnd[0] && (res = this.sqr(res)), bit === 0 && current === 0)) {\n currentLen = 0;\n continue;\n }\n (current <<= 1),\n (current |= bit),\n currentLen++,\n !(currentLen !== windowSize && (i !== 0 || j !== 0)) &&\n ((res = this.mul(res, wnd[current])), (currentLen = 0), (current = 0));\n }\n start = 26;\n }\n return res;\n }),\n (Red.prototype.convertTo = function (num) {\n var r = num.umod(this.m);\n return r === num ? r.clone() : r;\n }),\n (Red.prototype.convertFrom = function (num) {\n var res = num.clone();\n return (res.red = null), res;\n }),\n (BN.mont = function (num) {\n return new Mont(num);\n });\n function Mont(m) {\n Red.call(this, m),\n (this.shift = this.m.bitLength()),\n this.shift % 26 !== 0 && (this.shift += 26 - (this.shift % 26)),\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 (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 (Mont.prototype.convertTo = function (num) {\n return this.imod(num.ushln(this.shift));\n }),\n (Mont.prototype.convertFrom = function (num) {\n var r = this.imod(num.mul(this.rinv));\n return (r.red = null), r;\n }),\n (Mont.prototype.imul = function (a, b) {\n if (a.isZero() || b.isZero()) return (a.words[0] = 0), (a.length = 1), a;\n var t = a.imul(b),\n c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m),\n u = t.isub(c).iushrn(this.shift),\n res = u;\n return (\n u.cmp(this.m) >= 0 ? (res = u.isub(this.m)) : u.cmpn(0) < 0 && (res = u.iadd(this.m)), res._forceRed(this)\n );\n }),\n (Mont.prototype.mul = function (a, b) {\n if (a.isZero() || b.isZero()) return new BN(0)._forceRed(this);\n var t = a.mul(b),\n c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m),\n u = t.isub(c).iushrn(this.shift),\n res = u;\n return (\n u.cmp(this.m) >= 0 ? (res = u.isub(this.m)) : u.cmpn(0) < 0 && (res = u.iadd(this.m)), res._forceRed(this)\n );\n }),\n (Mont.prototype.invm = function (a) {\n var res = this.imod(a._invmp(this.m).mul(this.r2));\n return res._forceRed(this);\n });\n })(typeof module > \"u\" || module, exports);\n },\n});\n\n// node_modules/minimalistic-crypto-utils/lib/utils.js\nvar require_utils2 = __commonJS({\n \"node_modules/minimalistic-crypto-utils/lib/utils.js\"(exports) {\n \"use strict\";\n var utils = exports;\n function toArray(msg, enc) {\n if (Array.isArray(msg)) return msg.slice();\n if (!msg) return [];\n var res = [];\n if (typeof msg != \"string\") {\n for (var i = 0; i < msg.length; i++) res[i] = msg[i] | 0;\n return res;\n }\n if (enc === \"hex\") {\n (msg = msg.replace(/[^a-z0-9]+/gi, \"\")), msg.length % 2 !== 0 && (msg = \"0\" + msg);\n for (var i = 0; i < msg.length; i += 2) res.push(parseInt(msg[i] + msg[i + 1], 16));\n } else\n for (var i = 0; i < msg.length; i++) {\n var c = msg.charCodeAt(i),\n hi = c >> 8,\n lo = c & 255;\n hi ? res.push(hi, lo) : res.push(lo);\n }\n return res;\n }\n utils.toArray = toArray;\n function zero2(word) {\n return word.length === 1 ? \"0\" + word : word;\n }\n utils.zero2 = zero2;\n function toHex(msg) {\n for (var res = \"\", i = 0; i < msg.length; i++) res += zero2(msg[i].toString(16));\n return res;\n }\n utils.toHex = toHex;\n utils.encode = function (arr, enc) {\n return enc === \"hex\" ? toHex(arr) : arr;\n };\n },\n});\n\n// node_modules/elliptic/lib/elliptic/utils.js\nvar require_utils3 = __commonJS({\n \"node_modules/elliptic/lib/elliptic/utils.js\"(exports) {\n \"use strict\";\n var utils = exports,\n BN = require_bn4(),\n minAssert = require_minimalistic_assert(),\n minUtils = require_utils2();\n utils.assert = minAssert;\n utils.toArray = minUtils.toArray;\n utils.zero2 = minUtils.zero2;\n utils.toHex = minUtils.toHex;\n utils.encode = minUtils.encode;\n function getNAF(num, w, bits) {\n var naf = new Array(Math.max(num.bitLength(), bits) + 1);\n naf.fill(0);\n for (var ws = 1 << (w + 1), k = num.clone(), i = 0; i < naf.length; i++) {\n var z,\n mod = k.andln(ws - 1);\n k.isOdd() ? (mod > (ws >> 1) - 1 ? (z = (ws >> 1) - mod) : (z = mod), k.isubn(z)) : (z = 0),\n (naf[i] = z),\n k.iushrn(1);\n }\n return naf;\n }\n utils.getNAF = getNAF;\n function getJSF(k1, k2) {\n var jsf = [[], []];\n (k1 = k1.clone()), (k2 = k2.clone());\n for (var d1 = 0, d2 = 0, m8; k1.cmpn(-d1) > 0 || k2.cmpn(-d2) > 0; ) {\n var m14 = (k1.andln(3) + d1) & 3,\n m24 = (k2.andln(3) + d2) & 3;\n m14 === 3 && (m14 = -1), m24 === 3 && (m24 = -1);\n var u1;\n (m14 & 1) === 0\n ? (u1 = 0)\n : ((m8 = (k1.andln(7) + d1) & 7), (m8 === 3 || m8 === 5) && m24 === 2 ? (u1 = -m14) : (u1 = m14)),\n jsf[0].push(u1);\n var u2;\n (m24 & 1) === 0\n ? (u2 = 0)\n : ((m8 = (k2.andln(7) + d2) & 7), (m8 === 3 || m8 === 5) && m14 === 2 ? (u2 = -m24) : (u2 = m24)),\n jsf[1].push(u2),\n 2 * d1 === u1 + 1 && (d1 = 1 - d1),\n 2 * d2 === u2 + 1 && (d2 = 1 - d2),\n k1.iushrn(1),\n k2.iushrn(1);\n }\n return jsf;\n }\n utils.getJSF = getJSF;\n function cachedProperty(obj, name, computer) {\n var key = \"_\" + name;\n obj.prototype[name] = function () {\n return this[key] !== void 0 ? this[key] : (this[key] = computer.call(this));\n };\n }\n utils.cachedProperty = cachedProperty;\n function parseBytes(bytes) {\n return typeof bytes == \"string\" ? utils.toArray(bytes, \"hex\") : bytes;\n }\n utils.parseBytes = parseBytes;\n function intFromLE(bytes) {\n return new BN(bytes, \"hex\", \"le\");\n }\n utils.intFromLE = intFromLE;\n },\n});\n\n// node_modules/elliptic/lib/elliptic/curve/base.js\nvar require_base = __commonJS({\n \"node_modules/elliptic/lib/elliptic/curve/base.js\"(exports, module) {\n \"use strict\";\n var BN = require_bn4(),\n utils = require_utils3(),\n getNAF = utils.getNAF,\n getJSF = utils.getJSF,\n assert = utils.assert;\n function BaseCurve(type, conf) {\n (this.type = type),\n (this.p = new BN(conf.p, 16)),\n (this.red = conf.prime ? BN.red(conf.prime) : BN.mont(this.p)),\n (this.zero = new BN(0).toRed(this.red)),\n (this.one = new BN(1).toRed(this.red)),\n (this.two = new BN(2).toRed(this.red)),\n (this.n = conf.n && new BN(conf.n, 16)),\n (this.g = conf.g && this.pointFromJSON(conf.g, conf.gRed)),\n (this._wnafT1 = new Array(4)),\n (this._wnafT2 = new Array(4)),\n (this._wnafT3 = new Array(4)),\n (this._wnafT4 = new Array(4)),\n (this._bitLength = this.n ? this.n.bitLength() : 0);\n var adjustCount = this.n && this.p.div(this.n);\n !adjustCount || adjustCount.cmpn(100) > 0\n ? (this.redN = null)\n : ((this._maxwellTrick = !0), (this.redN = this.n.toRed(this.red)));\n }\n module.exports = BaseCurve;\n BaseCurve.prototype.point = function () {\n throw new Error(\"Not implemented\");\n };\n BaseCurve.prototype.validate = function () {\n throw new Error(\"Not implemented\");\n };\n BaseCurve.prototype._fixedNafMul = function (p, k) {\n assert(p.precomputed);\n var doubles = p._getDoubles(),\n naf = getNAF(k, 1, this._bitLength),\n I = (1 << (doubles.step + 1)) - (doubles.step % 2 === 0 ? 2 : 1);\n I /= 3;\n var repr = [],\n j,\n nafW;\n for (j = 0; j < naf.length; j += doubles.step) {\n nafW = 0;\n for (var l = j + doubles.step - 1; l >= j; l--) nafW = (nafW << 1) + naf[l];\n repr.push(nafW);\n }\n for (var a = this.jpoint(null, null, null), b = this.jpoint(null, null, null), i = I; i > 0; i--) {\n for (j = 0; j < repr.length; j++)\n (nafW = repr[j]),\n nafW === i ? (b = b.mixedAdd(doubles.points[j])) : nafW === -i && (b = b.mixedAdd(doubles.points[j].neg()));\n a = a.add(b);\n }\n return a.toP();\n };\n BaseCurve.prototype._wnafMul = function (p, k) {\n var w = 4,\n nafPoints = p._getNAFPoints(w);\n w = nafPoints.wnd;\n for (\n var wnd = nafPoints.points,\n naf = getNAF(k, w, this._bitLength),\n acc = this.jpoint(null, null, null),\n i = naf.length - 1;\n i >= 0;\n i--\n ) {\n for (var l = 0; i >= 0 && naf[i] === 0; i--) l++;\n if ((i >= 0 && l++, (acc = acc.dblp(l)), i < 0)) break;\n var z = naf[i];\n assert(z !== 0),\n p.type === \"affine\"\n ? z > 0\n ? (acc = acc.mixedAdd(wnd[(z - 1) >> 1]))\n : (acc = acc.mixedAdd(wnd[(-z - 1) >> 1].neg()))\n : z > 0\n ? (acc = acc.add(wnd[(z - 1) >> 1]))\n : (acc = acc.add(wnd[(-z - 1) >> 1].neg()));\n }\n return p.type === \"affine\" ? acc.toP() : acc;\n };\n BaseCurve.prototype._wnafMulAdd = function (defW, points, coeffs, len, jacobianResult) {\n var wndWidth = this._wnafT1,\n wnd = this._wnafT2,\n naf = this._wnafT3,\n max = 0,\n i,\n j,\n p;\n for (i = 0; i < len; i++) {\n p = points[i];\n var nafPoints = p._getNAFPoints(defW);\n (wndWidth[i] = nafPoints.wnd), (wnd[i] = nafPoints.points);\n }\n for (i = len - 1; i >= 1; i -= 2) {\n var a = i - 1,\n b = i;\n if (wndWidth[a] !== 1 || wndWidth[b] !== 1) {\n (naf[a] = getNAF(coeffs[a], wndWidth[a], this._bitLength)),\n (naf[b] = getNAF(coeffs[b], wndWidth[b], this._bitLength)),\n (max = Math.max(naf[a].length, max)),\n (max = Math.max(naf[b].length, max));\n continue;\n }\n var comb = [points[a], null, null, points[b]];\n points[a].y.cmp(points[b].y) === 0\n ? ((comb[1] = points[a].add(points[b])), (comb[2] = points[a].toJ().mixedAdd(points[b].neg())))\n : points[a].y.cmp(points[b].y.redNeg()) === 0\n ? ((comb[1] = points[a].toJ().mixedAdd(points[b])), (comb[2] = points[a].add(points[b].neg())))\n : ((comb[1] = points[a].toJ().mixedAdd(points[b])), (comb[2] = points[a].toJ().mixedAdd(points[b].neg())));\n var index = [-3, -1, -5, -7, 0, 7, 5, 1, 3],\n jsf = getJSF(coeffs[a], coeffs[b]);\n for (\n max = Math.max(jsf[0].length, max), naf[a] = new Array(max), naf[b] = new Array(max), j = 0;\n j < max;\n j++\n ) {\n var ja = jsf[0][j] | 0,\n jb = jsf[1][j] | 0;\n (naf[a][j] = index[(ja + 1) * 3 + (jb + 1)]), (naf[b][j] = 0), (wnd[a] = comb);\n }\n }\n var acc = this.jpoint(null, null, null),\n tmp = this._wnafT4;\n for (i = max; i >= 0; i--) {\n for (var k = 0; i >= 0; ) {\n var zero = !0;\n for (j = 0; j < len; j++) (tmp[j] = naf[j][i] | 0), tmp[j] !== 0 && (zero = !1);\n if (!zero) break;\n k++, i--;\n }\n if ((i >= 0 && k++, (acc = acc.dblp(k)), i < 0)) break;\n for (j = 0; j < len; j++) {\n var z = tmp[j];\n z !== 0 &&\n (z > 0 ? (p = wnd[j][(z - 1) >> 1]) : z < 0 && (p = wnd[j][(-z - 1) >> 1].neg()),\n p.type === \"affine\" ? (acc = acc.mixedAdd(p)) : (acc = acc.add(p)));\n }\n }\n for (i = 0; i < len; i++) wnd[i] = null;\n return jacobianResult ? acc : acc.toP();\n };\n function BasePoint(curve, type) {\n (this.curve = curve), (this.type = type), (this.precomputed = null);\n }\n BaseCurve.BasePoint = BasePoint;\n BasePoint.prototype.eq = function () {\n throw new Error(\"Not implemented\");\n };\n BasePoint.prototype.validate = function () {\n return this.curve.validate(this);\n };\n BaseCurve.prototype.decodePoint = function (bytes, enc) {\n bytes = utils.toArray(bytes, enc);\n var len = this.p.byteLength();\n if ((bytes[0] === 4 || bytes[0] === 6 || bytes[0] === 7) && bytes.length - 1 === 2 * len) {\n bytes[0] === 6\n ? assert(bytes[bytes.length - 1] % 2 === 0)\n : bytes[0] === 7 && assert(bytes[bytes.length - 1] % 2 === 1);\n var res = this.point(bytes.slice(1, 1 + len), bytes.slice(1 + len, 1 + 2 * len));\n return res;\n } else if ((bytes[0] === 2 || bytes[0] === 3) && bytes.length - 1 === len)\n return this.pointFromX(bytes.slice(1, 1 + len), bytes[0] === 3);\n throw new Error(\"Unknown point format\");\n };\n BasePoint.prototype.encodeCompressed = function (enc) {\n return this.encode(enc, !0);\n };\n BasePoint.prototype._encode = function (compact) {\n var len = this.curve.p.byteLength(),\n x = this.getX().toArray(\"be\", len);\n return compact ? [this.getY().isEven() ? 2 : 3].concat(x) : [4].concat(x, this.getY().toArray(\"be\", len));\n };\n BasePoint.prototype.encode = function (enc, compact) {\n return utils.encode(this._encode(compact), enc);\n };\n BasePoint.prototype.precompute = function (power) {\n if (this.precomputed) return this;\n var precomputed = {\n doubles: null,\n naf: null,\n beta: null,\n };\n return (\n (precomputed.naf = this._getNAFPoints(8)),\n (precomputed.doubles = this._getDoubles(4, power)),\n (precomputed.beta = this._getBeta()),\n (this.precomputed = precomputed),\n this\n );\n };\n BasePoint.prototype._hasDoubles = function (k) {\n if (!this.precomputed) return !1;\n var doubles = this.precomputed.doubles;\n return doubles ? doubles.points.length >= Math.ceil((k.bitLength() + 1) / doubles.step) : !1;\n };\n BasePoint.prototype._getDoubles = function (step, power) {\n if (this.precomputed && this.precomputed.doubles) return this.precomputed.doubles;\n for (var doubles = [this], acc = this, i = 0; i < power; i += step) {\n for (var j = 0; j < step; j++) acc = acc.dbl();\n doubles.push(acc);\n }\n return {\n step,\n points: doubles,\n };\n };\n BasePoint.prototype._getNAFPoints = function (wnd) {\n if (this.precomputed && this.precomputed.naf) return this.precomputed.naf;\n for (var res = [this], max = (1 << wnd) - 1, dbl = max === 1 ? null : this.dbl(), i = 1; i < max; i++)\n res[i] = res[i - 1].add(dbl);\n return {\n wnd,\n points: res,\n };\n };\n BasePoint.prototype._getBeta = function () {\n return null;\n };\n BasePoint.prototype.dblp = function (k) {\n for (var r = this, i = 0; i < k; i++) r = r.dbl();\n return r;\n };\n },\n});\n\n// node_modules/elliptic/lib/elliptic/curve/short.js\nvar require_short = __commonJS({\n \"node_modules/elliptic/lib/elliptic/curve/short.js\"(exports, module) {\n \"use strict\";\n var utils = require_utils3(),\n BN = require_bn4(),\n inherits = require_inherits_browser(),\n Base = require_base(),\n assert = utils.assert;\n function ShortCurve(conf) {\n Base.call(this, \"short\", conf),\n (this.a = new BN(conf.a, 16).toRed(this.red)),\n (this.b = new BN(conf.b, 16).toRed(this.red)),\n (this.tinv = this.two.redInvm()),\n (this.zeroA = this.a.fromRed().cmpn(0) === 0),\n (this.threeA = this.a.fromRed().sub(this.p).cmpn(-3) === 0),\n (this.endo = this._getEndomorphism(conf)),\n (this._endoWnafT1 = new Array(4)),\n (this._endoWnafT2 = new Array(4));\n }\n inherits(ShortCurve, Base);\n module.exports = ShortCurve;\n ShortCurve.prototype._getEndomorphism = function (conf) {\n if (!(!this.zeroA || !this.g || !this.n || this.p.modn(3) !== 1)) {\n var beta, lambda;\n if (conf.beta) beta = new BN(conf.beta, 16).toRed(this.red);\n else {\n var betas = this._getEndoRoots(this.p);\n (beta = betas[0].cmp(betas[1]) < 0 ? betas[0] : betas[1]), (beta = beta.toRed(this.red));\n }\n if (conf.lambda) lambda = new BN(conf.lambda, 16);\n else {\n var lambdas = this._getEndoRoots(this.n);\n this.g.mul(lambdas[0]).x.cmp(this.g.x.redMul(beta)) === 0\n ? (lambda = lambdas[0])\n : ((lambda = lambdas[1]), assert(this.g.mul(lambda).x.cmp(this.g.x.redMul(beta)) === 0));\n }\n var basis;\n return (\n conf.basis\n ? (basis = conf.basis.map(function (vec) {\n return {\n a: new BN(vec.a, 16),\n b: new BN(vec.b, 16),\n };\n }))\n : (basis = this._getEndoBasis(lambda)),\n {\n beta,\n lambda,\n basis,\n }\n );\n }\n };\n ShortCurve.prototype._getEndoRoots = function (num) {\n var red = num === this.p ? this.red : BN.mont(num),\n tinv = new BN(2).toRed(red).redInvm(),\n ntinv = tinv.redNeg(),\n s = new BN(3).toRed(red).redNeg().redSqrt().redMul(tinv),\n l1 = ntinv.redAdd(s).fromRed(),\n l2 = ntinv.redSub(s).fromRed();\n return [l1, l2];\n };\n ShortCurve.prototype._getEndoBasis = function (lambda) {\n for (\n var aprxSqrt = this.n.ushrn(Math.floor(this.n.bitLength() / 2)),\n u = lambda,\n v = this.n.clone(),\n x1 = new BN(1),\n y1 = new BN(0),\n x2 = new BN(0),\n y2 = new BN(1),\n a0,\n b0,\n a1,\n b1,\n a2,\n b2,\n prevR,\n i = 0,\n r,\n x;\n u.cmpn(0) !== 0;\n\n ) {\n var q = v.div(u);\n (r = v.sub(q.mul(u))), (x = x2.sub(q.mul(x1)));\n var y = y2.sub(q.mul(y1));\n if (!a1 && r.cmp(aprxSqrt) < 0) (a0 = prevR.neg()), (b0 = x1), (a1 = r.neg()), (b1 = x);\n else if (a1 && ++i === 2) break;\n (prevR = r), (v = u), (u = r), (x2 = x1), (x1 = x), (y2 = y1), (y1 = y);\n }\n (a2 = r.neg()), (b2 = x);\n var len1 = a1.sqr().add(b1.sqr()),\n len2 = a2.sqr().add(b2.sqr());\n return (\n len2.cmp(len1) >= 0 && ((a2 = a0), (b2 = b0)),\n a1.negative && ((a1 = a1.neg()), (b1 = b1.neg())),\n a2.negative && ((a2 = a2.neg()), (b2 = b2.neg())),\n [\n { a: a1, b: b1 },\n { a: a2, b: b2 },\n ]\n );\n };\n ShortCurve.prototype._endoSplit = function (k) {\n var basis = this.endo.basis,\n v1 = basis[0],\n v2 = basis[1],\n c1 = v2.b.mul(k).divRound(this.n),\n c2 = v1.b.neg().mul(k).divRound(this.n),\n p1 = c1.mul(v1.a),\n p2 = c2.mul(v2.a),\n q1 = c1.mul(v1.b),\n q2 = c2.mul(v2.b),\n k1 = k.sub(p1).sub(p2),\n k2 = q1.add(q2).neg();\n return { k1, k2 };\n };\n ShortCurve.prototype.pointFromX = function (x, odd) {\n (x = new BN(x, 16)), x.red || (x = x.toRed(this.red));\n var y2 = x.redSqr().redMul(x).redIAdd(x.redMul(this.a)).redIAdd(this.b),\n y = y2.redSqrt();\n if (y.redSqr().redSub(y2).cmp(this.zero) !== 0) throw new Error(\"invalid point\");\n var isOdd = y.fromRed().isOdd();\n return ((odd && !isOdd) || (!odd && isOdd)) && (y = y.redNeg()), this.point(x, y);\n };\n ShortCurve.prototype.validate = function (point) {\n if (point.inf) return !0;\n var x = point.x,\n y = point.y,\n ax = this.a.redMul(x),\n rhs = x.redSqr().redMul(x).redIAdd(ax).redIAdd(this.b);\n return y.redSqr().redISub(rhs).cmpn(0) === 0;\n };\n ShortCurve.prototype._endoWnafMulAdd = function (points, coeffs, jacobianResult) {\n for (var npoints = this._endoWnafT1, ncoeffs = this._endoWnafT2, i = 0; i < points.length; i++) {\n var split = this._endoSplit(coeffs[i]),\n p = points[i],\n beta = p._getBeta();\n split.k1.negative && (split.k1.ineg(), (p = p.neg(!0))),\n split.k2.negative && (split.k2.ineg(), (beta = beta.neg(!0))),\n (npoints[i * 2] = p),\n (npoints[i * 2 + 1] = beta),\n (ncoeffs[i * 2] = split.k1),\n (ncoeffs[i * 2 + 1] = split.k2);\n }\n for (var res = this._wnafMulAdd(1, npoints, ncoeffs, i * 2, jacobianResult), j = 0; j < i * 2; j++)\n (npoints[j] = null), (ncoeffs[j] = null);\n return res;\n };\n function Point(curve, x, y, isRed) {\n Base.BasePoint.call(this, curve, \"affine\"),\n x === null && y === null\n ? ((this.x = null), (this.y = null), (this.inf = !0))\n : ((this.x = new BN(x, 16)),\n (this.y = new BN(y, 16)),\n isRed && (this.x.forceRed(this.curve.red), this.y.forceRed(this.curve.red)),\n this.x.red || (this.x = this.x.toRed(this.curve.red)),\n this.y.red || (this.y = this.y.toRed(this.curve.red)),\n (this.inf = !1));\n }\n inherits(Point, Base.BasePoint);\n ShortCurve.prototype.point = function (x, y, isRed) {\n return new Point(this, x, y, isRed);\n };\n ShortCurve.prototype.pointFromJSON = function (obj, red) {\n return Point.fromJSON(this, obj, red);\n };\n Point.prototype._getBeta = function () {\n if (!!this.curve.endo) {\n var pre = this.precomputed;\n if (pre && pre.beta) return pre.beta;\n var beta = this.curve.point(this.x.redMul(this.curve.endo.beta), this.y);\n if (pre) {\n var curve = this.curve,\n endoMul = function (p) {\n return curve.point(p.x.redMul(curve.endo.beta), p.y);\n };\n (pre.beta = beta),\n (beta.precomputed = {\n beta: null,\n naf: pre.naf && {\n wnd: pre.naf.wnd,\n points: pre.naf.points.map(endoMul),\n },\n doubles: pre.doubles && {\n step: pre.doubles.step,\n points: pre.doubles.points.map(endoMul),\n },\n });\n }\n return beta;\n }\n };\n Point.prototype.toJSON = function () {\n return this.precomputed\n ? [\n this.x,\n this.y,\n this.precomputed && {\n doubles: this.precomputed.doubles && {\n step: this.precomputed.doubles.step,\n points: this.precomputed.doubles.points.slice(1),\n },\n naf: this.precomputed.naf && {\n wnd: this.precomputed.naf.wnd,\n points: this.precomputed.naf.points.slice(1),\n },\n },\n ]\n : [this.x, this.y];\n };\n Point.fromJSON = function (curve, obj, red) {\n typeof obj == \"string\" && (obj = JSON.parse(obj));\n var res = curve.point(obj[0], obj[1], red);\n if (!obj[2]) return res;\n function obj2point(obj2) {\n return curve.point(obj2[0], obj2[1], red);\n }\n var pre = obj[2];\n return (\n (res.precomputed = {\n beta: null,\n doubles: pre.doubles && {\n step: pre.doubles.step,\n points: [res].concat(pre.doubles.points.map(obj2point)),\n },\n naf: pre.naf && {\n wnd: pre.naf.wnd,\n points: [res].concat(pre.naf.points.map(obj2point)),\n },\n }),\n res\n );\n };\n Point.prototype.inspect = function () {\n return this.isInfinity()\n ? \"<EC Point Infinity>\"\n : \"<EC Point x: \" + this.x.fromRed().toString(16, 2) + \" y: \" + this.y.fromRed().toString(16, 2) + \">\";\n };\n Point.prototype.isInfinity = function () {\n return this.inf;\n };\n Point.prototype.add = function (p) {\n if (this.inf) return p;\n if (p.inf) return this;\n if (this.eq(p)) return this.dbl();\n if (this.neg().eq(p)) return this.curve.point(null, null);\n if (this.x.cmp(p.x) === 0) return this.curve.point(null, null);\n var c = this.y.redSub(p.y);\n c.cmpn(0) !== 0 && (c = c.redMul(this.x.redSub(p.x).redInvm()));\n var nx = c.redSqr().redISub(this.x).redISub(p.x),\n ny = c.redMul(this.x.redSub(nx)).redISub(this.y);\n return this.curve.point(nx, ny);\n };\n Point.prototype.dbl = function () {\n if (this.inf) return this;\n var ys1 = this.y.redAdd(this.y);\n if (ys1.cmpn(0) === 0) return this.curve.point(null, null);\n var a = this.curve.a,\n x2 = this.x.redSqr(),\n dyinv = ys1.redInvm(),\n c = x2.redAdd(x2).redIAdd(x2).redIAdd(a).redMul(dyinv),\n nx = c.redSqr().redISub(this.x.redAdd(this.x)),\n ny = c.redMul(this.x.redSub(nx)).redISub(this.y);\n return this.curve.point(nx, ny);\n };\n Point.prototype.getX = function () {\n return this.x.fromRed();\n };\n Point.prototype.getY = function () {\n return this.y.fromRed();\n };\n Point.prototype.mul = function (k) {\n return (\n (k = new BN(k, 16)),\n this.isInfinity()\n ? this\n : this._hasDoubles(k)\n ? this.curve._fixedNafMul(this, k)\n : this.curve.endo\n ? this.curve._endoWnafMulAdd([this], [k])\n : this.curve._wnafMul(this, k)\n );\n };\n Point.prototype.mulAdd = function (k1, p2, k2) {\n var points = [this, p2],\n coeffs = [k1, k2];\n return this.curve.endo\n ? this.curve._endoWnafMulAdd(points, coeffs)\n : this.curve._wnafMulAdd(1, points, coeffs, 2);\n };\n Point.prototype.jmulAdd = function (k1, p2, k2) {\n var points = [this, p2],\n coeffs = [k1, k2];\n return this.curve.endo\n ? this.curve._endoWnafMulAdd(points, coeffs, !0)\n : this.curve._wnafMulAdd(1, points, coeffs, 2, !0);\n };\n Point.prototype.eq = function (p) {\n return this === p || (this.inf === p.inf && (this.inf || (this.x.cmp(p.x) === 0 && this.y.cmp(p.y) === 0)));\n };\n Point.prototype.neg = function (_precompute) {\n if (this.inf) return this;\n var res = this.curve.point(this.x, this.y.redNeg());\n if (_precompute && this.precomputed) {\n var pre = this.precomputed,\n negate = function (p) {\n return p.neg();\n };\n res.precomputed = {\n naf: pre.naf && {\n wnd: pre.naf.wnd,\n points: pre.naf.points.map(negate),\n },\n doubles: pre.doubles && {\n step: pre.doubles.step,\n points: pre.doubles.points.map(negate),\n },\n };\n }\n return res;\n };\n Point.prototype.toJ = function () {\n if (this.inf) return this.curve.jpoint(null, null, null);\n var res = this.curve.jpoint(this.x, this.y, this.curve.one);\n return res;\n };\n function JPoint(curve, x, y, z) {\n Base.BasePoint.call(this, curve, \"jacobian\"),\n x === null && y === null && z === null\n ? ((this.x = this.curve.one), (this.y = this.curve.one), (this.z = new BN(0)))\n : ((this.x = new BN(x, 16)), (this.y = new BN(y, 16)), (this.z = new BN(z, 16))),\n this.x.red || (this.x = this.x.toRed(this.curve.red)),\n this.y.red || (this.y = this.y.toRed(this.curve.red)),\n this.z.red || (this.z = this.z.toRed(this.curve.red)),\n (this.zOne = this.z === this.curve.one);\n }\n inherits(JPoint, Base.BasePoint);\n ShortCurve.prototype.jpoint = function (x, y, z) {\n return new JPoint(this, x, y, z);\n };\n JPoint.prototype.toP = function () {\n if (this.isInfinity()) return this.curve.point(null, null);\n var zinv = this.z.redInvm(),\n zinv2 = zinv.redSqr(),\n ax = this.x.redMul(zinv2),\n ay = this.y.redMul(zinv2).redMul(zinv);\n return this.curve.point(ax, ay);\n };\n JPoint.prototype.neg = function () {\n return this.curve.jpoint(this.x, this.y.redNeg(), this.z);\n };\n JPoint.prototype.add = function (p) {\n if (this.isInfinity()) return p;\n if (p.isInfinity()) return this;\n var pz2 = p.z.redSqr(),\n z2 = this.z.redSqr(),\n u1 = this.x.redMul(pz2),\n u2 = p.x.redMul(z2),\n s1 = this.y.redMul(pz2.redMul(p.z)),\n s2 = p.y.redMul(z2.redMul(this.z)),\n h = u1.redSub(u2),\n r = s1.redSub(s2);\n if (h.cmpn(0) === 0) return r.cmpn(0) !== 0 ? this.curve.jpoint(null, null, null) : this.dbl();\n var h2 = h.redSqr(),\n h3 = h2.redMul(h),\n v = u1.redMul(h2),\n nx = r.redSqr().redIAdd(h3).redISub(v).redISub(v),\n ny = r.redMul(v.redISub(nx)).redISub(s1.redMul(h3)),\n nz = this.z.redMul(p.z).redMul(h);\n return this.curve.jpoint(nx, ny, nz);\n };\n JPoint.prototype.mixedAdd = function (p) {\n if (this.isInfinity()) return p.toJ();\n if (p.isInfinity()) return this;\n var z2 = this.z.redSqr(),\n u1 = this.x,\n u2 = p.x.redMul(z2),\n s1 = this.y,\n s2 = p.y.redMul(z2).redMul(this.z),\n h = u1.redSub(u2),\n r = s1.redSub(s2);\n if (h.cmpn(0) === 0) return r.cmpn(0) !== 0 ? this.curve.jpoint(null, null, null) : this.dbl();\n var h2 = h.redSqr(),\n h3 = h2.redMul(h),\n v = u1.redMul(h2),\n nx = r.redSqr().redIAdd(h3).redISub(v).redISub(v),\n ny = r.redMul(v.redISub(nx)).redISub(s1.redMul(h3)),\n nz = this.z.redMul(h);\n return this.curve.jpoint(nx, ny, nz);\n };\n JPoint.prototype.dblp = function (pow) {\n if (pow === 0) return this;\n if (this.isInfinity()) return this;\n if (!pow) return this.dbl();\n var i;\n if (this.curve.zeroA || this.curve.threeA) {\n var r = this;\n for (i = 0; i < pow; i++) r = r.dbl();\n return r;\n }\n var a = this.curve.a,\n tinv = this.curve.tinv,\n jx = this.x,\n jy = this.y,\n jz = this.z,\n jz4 = jz.redSqr().redSqr(),\n jyd = jy.redAdd(jy);\n for (i = 0; i < pow; i++) {\n var jx2 = jx.redSqr(),\n jyd2 = jyd.redSqr(),\n jyd4 = jyd2.redSqr(),\n c = jx2.redAdd(jx2).redIAdd(jx2).redIAdd(a.redMul(jz4)),\n t1 = jx.redMul(jyd2),\n nx = c.redSqr().redISub(t1.redAdd(t1)),\n t2 = t1.redISub(nx),\n dny = c.redMul(t2);\n dny = dny.redIAdd(dny).redISub(jyd4);\n var nz = jyd.redMul(jz);\n i + 1 < pow && (jz4 = jz4.redMul(jyd4)), (jx = nx), (jz = nz), (jyd = dny);\n }\n return this.curve.jpoint(jx, jyd.redMul(tinv), jz);\n };\n JPoint.prototype.dbl = function () {\n return this.isInfinity()\n ? this\n : this.curve.zeroA\n ? this._zeroDbl()\n : this.curve.threeA\n ? this._threeDbl()\n : this._dbl();\n };\n JPoint.prototype._zeroDbl = function () {\n var nx, ny, nz;\n if (this.zOne) {\n var xx = this.x.redSqr(),\n yy = this.y.redSqr(),\n yyyy = yy.redSqr(),\n s = this.x.redAdd(yy).redSqr().redISub(xx).redISub(yyyy);\n s = s.redIAdd(s);\n var m = xx.redAdd(xx).redIAdd(xx),\n t = m.redSqr().redISub(s).redISub(s),\n yyyy8 = yyyy.redIAdd(yyyy);\n (yyyy8 = yyyy8.redIAdd(yyyy8)),\n (yyyy8 = yyyy8.redIAdd(yyyy8)),\n (nx = t),\n (ny = m.redMul(s.redISub(t)).redISub(yyyy8)),\n (nz = this.y.redAdd(this.y));\n } else {\n var a = this.x.redSqr(),\n b = this.y.redSqr(),\n c = b.redSqr(),\n d = this.x.redAdd(b).redSqr().redISub(a).redISub(c);\n d = d.redIAdd(d);\n var e = a.redAdd(a).redIAdd(a),\n f = e.redSqr(),\n c8 = c.redIAdd(c);\n (c8 = c8.redIAdd(c8)),\n (c8 = c8.redIAdd(c8)),\n (nx = f.redISub(d).redISub(d)),\n (ny = e.redMul(d.redISub(nx)).redISub(c8)),\n (nz = this.y.redMul(this.z)),\n (nz = nz.redIAdd(nz));\n }\n return this.curve.jpoint(nx, ny, nz);\n };\n JPoint.prototype._threeDbl = function () {\n var nx, ny, nz;\n if (this.zOne) {\n var xx = this.x.redSqr(),\n yy = this.y.redSqr(),\n yyyy = yy.redSqr(),\n s = this.x.redAdd(yy).redSqr().redISub(xx).redISub(yyyy);\n s = s.redIAdd(s);\n var m = xx.redAdd(xx).redIAdd(xx).redIAdd(this.curve.a),\n t = m.redSqr().redISub(s).redISub(s);\n nx = t;\n var yyyy8 = yyyy.redIAdd(yyyy);\n (yyyy8 = yyyy8.redIAdd(yyyy8)),\n (yyyy8 = yyyy8.redIAdd(yyyy8)),\n (ny = m.redMul(s.redISub(t)).redISub(yyyy8)),\n (nz = this.y.redAdd(this.y));\n } else {\n var delta = this.z.redSqr(),\n gamma = this.y.redSqr(),\n beta = this.x.redMul(gamma),\n alpha = this.x.redSub(delta).redMul(this.x.redAdd(delta));\n alpha = alpha.redAdd(alpha).redIAdd(alpha);\n var beta4 = beta.redIAdd(beta);\n beta4 = beta4.redIAdd(beta4);\n var beta8 = beta4.redAdd(beta4);\n (nx = alpha.redSqr().redISub(beta8)), (nz = this.y.redAdd(this.z).redSqr().redISub(gamma).redISub(delta));\n var ggamma8 = gamma.redSqr();\n (ggamma8 = ggamma8.redIAdd(ggamma8)),\n (ggamma8 = ggamma8.redIAdd(ggamma8)),\n (ggamma8 = ggamma8.redIAdd(ggamma8)),\n (ny = alpha.redMul(beta4.redISub(nx)).redISub(ggamma8));\n }\n return this.curve.jpoint(nx, ny, nz);\n };\n JPoint.prototype._dbl = function () {\n var a = this.curve.a,\n jx = this.x,\n jy = this.y,\n jz = this.z,\n jz4 = jz.redSqr().redSqr(),\n jx2 = jx.redSqr(),\n jy2 = jy.redSqr(),\n c = jx2.redAdd(jx2).redIAdd(jx2).redIAdd(a.redMul(jz4)),\n jxd4 = jx.redAdd(jx);\n jxd4 = jxd4.redIAdd(jxd4);\n var t1 = jxd4.redMul(jy2),\n nx = c.redSqr().redISub(t1.redAdd(t1)),\n t2 = t1.redISub(nx),\n jyd8 = jy2.redSqr();\n (jyd8 = jyd8.redIAdd(jyd8)), (jyd8 = jyd8.redIAdd(jyd8)), (jyd8 = jyd8.redIAdd(jyd8));\n var ny = c.redMul(t2).redISub(jyd8),\n nz = jy.redAdd(jy).redMul(jz);\n return this.curve.jpoint(nx, ny, nz);\n };\n JPoint.prototype.trpl = function () {\n if (!this.curve.zeroA) return this.dbl().add(this);\n var xx = this.x.redSqr(),\n yy = this.y.redSqr(),\n zz = this.z.redSqr(),\n yyyy = yy.redSqr(),\n m = xx.redAdd(xx).redIAdd(xx),\n mm = m.redSqr(),\n e = this.x.redAdd(yy).redSqr().redISub(xx).redISub(yyyy);\n (e = e.redIAdd(e)), (e = e.redAdd(e).redIAdd(e)), (e = e.redISub(mm));\n var ee = e.redSqr(),\n t = yyyy.redIAdd(yyyy);\n (t = t.redIAdd(t)), (t = t.redIAdd(t)), (t = t.redIAdd(t));\n var u = m.redIAdd(e).redSqr().redISub(mm).redISub(ee).redISub(t),\n yyu4 = yy.redMul(u);\n (yyu4 = yyu4.redIAdd(yyu4)), (yyu4 = yyu4.redIAdd(yyu4));\n var nx = this.x.redMul(ee).redISub(yyu4);\n (nx = nx.redIAdd(nx)), (nx = nx.redIAdd(nx));\n var ny = this.y.redMul(u.redMul(t.redISub(u)).redISub(e.redMul(ee)));\n (ny = ny.redIAdd(ny)), (ny = ny.redIAdd(ny)), (ny = ny.redIAdd(ny));\n var nz = this.z.redAdd(e).redSqr().redISub(zz).redISub(ee);\n return this.curve.jpoint(nx, ny, nz);\n };\n JPoint.prototype.mul = function (k, kbase) {\n return (k = new BN(k, kbase)), this.curve._wnafMul(this, k);\n };\n JPoint.prototype.eq = function (p) {\n if (p.type === \"affine\") return this.eq(p.toJ());\n if (this === p) return !0;\n var z2 = this.z.redSqr(),\n pz2 = p.z.redSqr();\n if (this.x.redMul(pz2).redISub(p.x.redMul(z2)).cmpn(0) !== 0) return !1;\n var z3 = z2.redMul(this.z),\n pz3 = pz2.redMul(p.z);\n return this.y.redMul(pz3).redISub(p.y.redMul(z3)).cmpn(0) === 0;\n };\n JPoint.prototype.eqXToP = function (x) {\n var zs = this.z.redSqr(),\n rx = x.toRed(this.curve.red).redMul(zs);\n if (this.x.cmp(rx) === 0) return !0;\n for (var xc = x.clone(), t = this.curve.redN.redMul(zs); ; ) {\n if ((xc.iadd(this.curve.n), xc.cmp(this.curve.p) >= 0)) return !1;\n if ((rx.redIAdd(t), this.x.cmp(rx) === 0)) return !0;\n }\n };\n JPoint.prototype.inspect = function () {\n return this.isInfinity()\n ? \"<EC JPoint Infinity>\"\n : \"<EC JPoint x: \" +\n this.x.toString(16, 2) +\n \" y: \" +\n this.y.toString(16, 2) +\n \" z: \" +\n this.z.toString(16, 2) +\n \">\";\n };\n JPoint.prototype.isInfinity = function () {\n return this.z.cmpn(0) === 0;\n };\n },\n});\n\n// node_modules/elliptic/lib/elliptic/curve/mont.js\nvar require_mont = __commonJS({\n \"node_modules/elliptic/lib/elliptic/curve/mont.js\"(exports, module) {\n \"use strict\";\n var BN = require_bn4(),\n inherits = require_inherits_browser(),\n Base = require_base(),\n utils = require_utils3();\n function MontCurve(conf) {\n Base.call(this, \"mont\", conf),\n (this.a = new BN(conf.a, 16).toRed(this.red)),\n (this.b = new BN(conf.b, 16).toRed(this.red)),\n (this.i4 = new BN(4).toRed(this.red).redInvm()),\n (this.two = new BN(2).toRed(this.red)),\n (this.a24 = this.i4.redMul(this.a.redAdd(this.two)));\n }\n inherits(MontCurve, Base);\n module.exports = MontCurve;\n MontCurve.prototype.validate = function (point) {\n var x = point.normalize().x,\n x2 = x.redSqr(),\n rhs = x2.redMul(x).redAdd(x2.redMul(this.a)).redAdd(x),\n y = rhs.redSqrt();\n return y.redSqr().cmp(rhs) === 0;\n };\n function Point(curve, x, z) {\n Base.BasePoint.call(this, curve, \"projective\"),\n x === null && z === null\n ? ((this.x = this.curve.one), (this.z = this.curve.zero))\n : ((this.x = new BN(x, 16)),\n (this.z = new BN(z, 16)),\n this.x.red || (this.x = this.x.toRed(this.curve.red)),\n this.z.red || (this.z = this.z.toRed(this.curve.red)));\n }\n inherits(Point, Base.BasePoint);\n MontCurve.prototype.decodePoint = function (bytes, enc) {\n return this.point(utils.toArray(bytes, enc), 1);\n };\n MontCurve.prototype.point = function (x, z) {\n return new Point(this, x, z);\n };\n MontCurve.prototype.pointFromJSON = function (obj) {\n return Point.fromJSON(this, obj);\n };\n Point.prototype.precompute = function () {};\n Point.prototype._encode = function () {\n return this.getX().toArray(\"be\", this.curve.p.byteLength());\n };\n Point.fromJSON = function (curve, obj) {\n return new Point(curve, obj[0], obj[1] || curve.one);\n };\n Point.prototype.inspect = function () {\n return this.isInfinity()\n ? \"<EC Point Infinity>\"\n : \"<EC Point x: \" + this.x.fromRed().toString(16, 2) + \" z: \" + this.z.fromRed().toString(16, 2) + \">\";\n };\n Point.prototype.isInfinity = function () {\n return this.z.cmpn(0) === 0;\n };\n Point.prototype.dbl = function () {\n var a = this.x.redAdd(this.z),\n aa = a.redSqr(),\n b = this.x.redSub(this.z),\n bb = b.redSqr(),\n c = aa.redSub(bb),\n nx = aa.redMul(bb),\n nz = c.redMul(bb.redAdd(this.curve.a24.redMul(c)));\n return this.curve.point(nx, nz);\n };\n Point.prototype.add = function () {\n throw new Error(\"Not supported on Montgomery curve\");\n };\n Point.prototype.diffAdd = function (p, diff) {\n var a = this.x.redAdd(this.z),\n b = this.x.redSub(this.z),\n c = p.x.redAdd(p.z),\n d = p.x.redSub(p.z),\n da = d.redMul(a),\n cb = c.redMul(b),\n nx = diff.z.redMul(da.redAdd(cb).redSqr()),\n nz = diff.x.redMul(da.redISub(cb).redSqr());\n return this.curve.point(nx, nz);\n };\n Point.prototype.mul = function (k) {\n for (\n var t = k.clone(), a = this, b = this.curve.point(null, null), c = this, bits = [];\n t.cmpn(0) !== 0;\n t.iushrn(1)\n )\n bits.push(t.andln(1));\n for (var i = bits.length - 1; i >= 0; i--)\n bits[i] === 0 ? ((a = a.diffAdd(b, c)), (b = b.dbl())) : ((b = a.diffAdd(b, c)), (a = a.dbl()));\n return b;\n };\n Point.prototype.mulAdd = function () {\n throw new Error(\"Not supported on Montgomery curve\");\n };\n Point.prototype.jumlAdd = function () {\n throw new Error(\"Not supported on Montgomery curve\");\n };\n Point.prototype.eq = function (other) {\n return this.getX().cmp(other.getX()) === 0;\n };\n Point.prototype.normalize = function () {\n return (this.x = this.x.redMul(this.z.redInvm())), (this.z = this.curve.one), this;\n };\n Point.prototype.getX = function () {\n return this.normalize(), this.x.fromRed();\n };\n },\n});\n\n// node_modules/elliptic/lib/elliptic/curve/edwards.js\nvar require_edwards = __commonJS({\n \"node_modules/elliptic/lib/elliptic/curve/edwards.js\"(exports, module) {\n \"use strict\";\n var utils = require_utils3(),\n BN = require_bn4(),\n inherits = require_inherits_browser(),\n Base = require_base(),\n assert = utils.assert;\n function EdwardsCurve(conf) {\n (this.twisted = (conf.a | 0) !== 1),\n (this.mOneA = this.twisted && (conf.a | 0) === -1),\n (this.extended = this.mOneA),\n Base.call(this, \"edwards\", conf),\n (this.a = new BN(conf.a, 16).umod(this.red.m)),\n (this.a = this.a.toRed(this.red)),\n (this.c = new BN(conf.c, 16).toRed(this.red)),\n (this.c2 = this.c.redSqr()),\n (this.d = new BN(conf.d, 16).toRed(this.red)),\n (this.dd = this.d.redAdd(this.d)),\n assert(!this.twisted || this.c.fromRed().cmpn(1) === 0),\n (this.oneC = (conf.c | 0) === 1);\n }\n inherits(EdwardsCurve, Base);\n module.exports = EdwardsCurve;\n EdwardsCurve.prototype._mulA = function (num) {\n return this.mOneA ? num.redNeg() : this.a.redMul(num);\n };\n EdwardsCurve.prototype._mulC = function (num) {\n return this.oneC ? num : this.c.redMul(num);\n };\n EdwardsCurve.prototype.jpoint = function (x, y, z, t) {\n return this.point(x, y, z, t);\n };\n EdwardsCurve.prototype.pointFromX = function (x, odd) {\n (x = new BN(x, 16)), x.red || (x = x.toRed(this.red));\n var x2 = x.redSqr(),\n rhs = this.c2.redSub(this.a.redMul(x2)),\n lhs = this.one.redSub(this.c2.redMul(this.d).redMul(x2)),\n y2 = rhs.redMul(lhs.redInvm()),\n y = y2.redSqrt();\n if (y.redSqr().redSub(y2).cmp(this.zero) !== 0) throw new Error(\"invalid point\");\n var isOdd = y.fromRed().isOdd();\n return ((odd && !isOdd) || (!odd && isOdd)) && (y = y.redNeg()), this.point(x, y);\n };\n EdwardsCurve.prototype.pointFromY = function (y, odd) {\n (y = new BN(y, 16)), y.red || (y = y.toRed(this.red));\n var y2 = y.redSqr(),\n lhs = y2.redSub(this.c2),\n rhs = y2.redMul(this.d).redMul(this.c2).redSub(this.a),\n x2 = lhs.redMul(rhs.redInvm());\n if (x2.cmp(this.zero) === 0) {\n if (odd) throw new Error(\"invalid point\");\n return this.point(this.zero, y);\n }\n var x = x2.redSqrt();\n if (x.redSqr().redSub(x2).cmp(this.zero) !== 0) throw new Error(\"invalid point\");\n return x.fromRed().isOdd() !== odd && (x = x.redNeg()), this.point(x, y);\n };\n EdwardsCurve.prototype.validate = function (point) {\n if (point.isInfinity()) return !0;\n point.normalize();\n var x2 = point.x.redSqr(),\n y2 = point.y.redSqr(),\n lhs = x2.redMul(this.a).redAdd(y2),\n rhs = this.c2.redMul(this.one.redAdd(this.d.redMul(x2).redMul(y2)));\n return lhs.cmp(rhs) === 0;\n };\n function Point(curve, x, y, z, t) {\n Base.BasePoint.call(this, curve, \"projective\"),\n x === null && y === null && z === null\n ? ((this.x = this.curve.zero),\n (this.y = this.curve.one),\n (this.z = this.curve.one),\n (this.t = this.curve.zero),\n (this.zOne = !0))\n : ((this.x = new BN(x, 16)),\n (this.y = new BN(y, 16)),\n (this.z = z ? new BN(z, 16) : this.curve.one),\n (this.t = t && new BN(t, 16)),\n this.x.red || (this.x = this.x.toRed(this.curve.red)),\n this.y.red || (this.y = this.y.toRed(this.curve.red)),\n this.z.red || (this.z = this.z.toRed(this.curve.red)),\n this.t && !this.t.red && (this.t = this.t.toRed(this.curve.red)),\n (this.zOne = this.z === this.curve.one),\n this.curve.extended &&\n !this.t &&\n ((this.t = this.x.redMul(this.y)), this.zOne || (this.t = this.t.redMul(this.z.redInvm()))));\n }\n inherits(Point, Base.BasePoint);\n EdwardsCurve.prototype.pointFromJSON = function (obj) {\n return Point.fromJSON(this, obj);\n };\n EdwardsCurve.prototype.point = function (x, y, z, t) {\n return new Point(this, x, y, z, t);\n };\n Point.fromJSON = function (curve, obj) {\n return new Point(curve, obj[0], obj[1], obj[2]);\n };\n Point.prototype.inspect = function () {\n return this.isInfinity()\n ? \"<EC Point Infinity>\"\n : \"<EC Point x: \" +\n this.x.fromRed().toString(16, 2) +\n \" y: \" +\n this.y.fromRed().toString(16, 2) +\n \" z: \" +\n this.z.fromRed().toString(16, 2) +\n \">\";\n };\n Point.prototype.isInfinity = function () {\n return this.x.cmpn(0) === 0 && (this.y.cmp(this.z) === 0 || (this.zOne && this.y.cmp(this.curve.c) === 0));\n };\n Point.prototype._extDbl = function () {\n var a = this.x.redSqr(),\n b = this.y.redSqr(),\n c = this.z.redSqr();\n c = c.redIAdd(c);\n var d = this.curve._mulA(a),\n e = this.x.redAdd(this.y).redSqr().redISub(a).redISub(b),\n g = d.redAdd(b),\n f = g.redSub(c),\n h = d.redSub(b),\n nx = e.redMul(f),\n ny = g.redMul(h),\n nt = e.redMul(h),\n nz = f.redMul(g);\n return this.curve.point(nx, ny, nz, nt);\n };\n Point.prototype._projDbl = function () {\n var b = this.x.redAdd(this.y).redSqr(),\n c = this.x.redSqr(),\n d = this.y.redSqr(),\n nx,\n ny,\n nz,\n e,\n h,\n j;\n if (this.curve.twisted) {\n e = this.curve._mulA(c);\n var f = e.redAdd(d);\n this.zOne\n ? ((nx = b.redSub(c).redSub(d).redMul(f.redSub(this.curve.two))),\n (ny = f.redMul(e.redSub(d))),\n (nz = f.redSqr().redSub(f).redSub(f)))\n : ((h = this.z.redSqr()),\n (j = f.redSub(h).redISub(h)),\n (nx = b.redSub(c).redISub(d).redMul(j)),\n (ny = f.redMul(e.redSub(d))),\n (nz = f.redMul(j)));\n } else\n (e = c.redAdd(d)),\n (h = this.curve._mulC(this.z).redSqr()),\n (j = e.redSub(h).redSub(h)),\n (nx = this.curve._mulC(b.redISub(e)).redMul(j)),\n (ny = this.curve._mulC(e).redMul(c.redISub(d))),\n (nz = e.redMul(j));\n return this.curve.point(nx, ny, nz);\n };\n Point.prototype.dbl = function () {\n return this.isInfinity() ? this : this.curve.extended ? this._extDbl() : this._projDbl();\n };\n Point.prototype._extAdd = function (p) {\n var a = this.y.redSub(this.x).redMul(p.y.redSub(p.x)),\n b = this.y.redAdd(this.x).redMul(p.y.redAdd(p.x)),\n c = this.t.redMul(this.curve.dd).redMul(p.t),\n d = this.z.redMul(p.z.redAdd(p.z)),\n e = b.redSub(a),\n f = d.redSub(c),\n g = d.redAdd(c),\n h = b.redAdd(a),\n nx = e.redMul(f),\n ny = g.redMul(h),\n nt = e.redMul(h),\n nz = f.redMul(g);\n return this.curve.point(nx, ny, nz, nt);\n };\n Point.prototype._projAdd = function (p) {\n var a = this.z.redMul(p.z),\n b = a.redSqr(),\n c = this.x.redMul(p.x),\n d = this.y.redMul(p.y),\n e = this.curve.d.redMul(c).redMul(d),\n f = b.redSub(e),\n g = b.redAdd(e),\n tmp = this.x.redAdd(this.y).redMul(p.x.redAdd(p.y)).redISub(c).redISub(d),\n nx = a.redMul(f).redMul(tmp),\n ny,\n nz;\n return (\n this.curve.twisted\n ? ((ny = a.redMul(g).redMul(d.redSub(this.curve._mulA(c)))), (nz = f.redMul(g)))\n : ((ny = a.redMul(g).redMul(d.redSub(c))), (nz = this.curve._mulC(f).redMul(g))),\n this.curve.point(nx, ny, nz)\n );\n };\n Point.prototype.add = function (p) {\n return this.isInfinity() ? p : p.isInfinity() ? this : this.curve.extended ? this._extAdd(p) : this._projAdd(p);\n };\n Point.prototype.mul = function (k) {\n return this._hasDoubles(k) ? this.curve._fixedNafMul(this, k) : this.curve._wnafMul(this, k);\n };\n Point.prototype.mulAdd = function (k1, p, k2) {\n return this.curve._wnafMulAdd(1, [this, p], [k1, k2], 2, !1);\n };\n Point.prototype.jmulAdd = function (k1, p, k2) {\n return this.curve._wnafMulAdd(1, [this, p], [k1, k2], 2, !0);\n };\n Point.prototype.normalize = function () {\n if (this.zOne) return this;\n var zi = this.z.redInvm();\n return (\n (this.x = this.x.redMul(zi)),\n (this.y = this.y.redMul(zi)),\n this.t && (this.t = this.t.redMul(zi)),\n (this.z = this.curve.one),\n (this.zOne = !0),\n this\n );\n };\n Point.prototype.neg = function () {\n return this.curve.point(this.x.redNeg(), this.y, this.z, this.t && this.t.redNeg());\n };\n Point.prototype.getX = function () {\n return this.normalize(), this.x.fromRed();\n };\n Point.prototype.getY = function () {\n return this.normalize(), this.y.fromRed();\n };\n Point.prototype.eq = function (other) {\n return this === other || (this.getX().cmp(other.getX()) === 0 && this.getY().cmp(other.getY()) === 0);\n };\n Point.prototype.eqXToP = function (x) {\n var rx = x.toRed(this.curve.red).redMul(this.z);\n if (this.x.cmp(rx) === 0) return !0;\n for (var xc = x.clone(), t = this.curve.redN.redMul(this.z); ; ) {\n if ((xc.iadd(this.curve.n), xc.cmp(this.curve.p) >= 0)) return !1;\n if ((rx.redIAdd(t), this.x.cmp(rx) === 0)) return !0;\n }\n };\n Point.prototype.toP = Point.prototype.normalize;\n Point.prototype.mixedAdd = Point.prototype.add;\n },\n});\n\n// node_modules/elliptic/lib/elliptic/curve/index.js\nvar require_curve = __commonJS({\n \"node_modules/elliptic/lib/elliptic/curve/index.js\"(exports) {\n \"use strict\";\n var curve = exports;\n curve.base = require_base();\n curve.short = require_short();\n curve.mont = require_mont();\n curve.edwards = require_edwards();\n },\n});\n\n// node_modules/hash.js/lib/hash/utils.js\nvar require_utils4 = __commonJS({\n \"node_modules/hash.js/lib/hash/utils.js\"(exports) {\n \"use strict\";\n var assert = require_minimalistic_assert(),\n inherits = require_inherits_browser();\n exports.inherits = inherits;\n function isSurrogatePair(msg, i) {\n return (msg.charCodeAt(i) & 64512) !== 55296 || i < 0 || i + 1 >= msg.length\n ? !1\n : (msg.charCodeAt(i + 1) & 64512) === 56320;\n }\n function toArray(msg, enc) {\n if (Array.isArray(msg)) return msg.slice();\n if (!msg) return [];\n var res = [];\n if (typeof msg == \"string\")\n if (enc) {\n if (enc === \"hex\")\n for (\n msg = msg.replace(/[^a-z0-9]+/gi, \"\"), msg.length % 2 !== 0 && (msg = \"0\" + msg), i = 0;\n i < msg.length;\n i += 2\n )\n res.push(parseInt(msg[i] + msg[i + 1], 16));\n } else\n for (var p = 0, i = 0; i < msg.length; i++) {\n var c = msg.charCodeAt(i);\n c < 128\n ? (res[p++] = c)\n : c < 2048\n ? ((res[p++] = (c >> 6) | 192), (res[p++] = (c & 63) | 128))\n : isSurrogatePair(msg, i)\n ? ((c = 65536 + ((c & 1023) << 10) + (msg.charCodeAt(++i) & 1023)),\n (res[p++] = (c >> 18) | 240),\n (res[p++] = ((c >> 12) & 63) | 128),\n (res[p++] = ((c >> 6) & 63) | 128),\n (res[p++] = (c & 63) | 128))\n : ((res[p++] = (c >> 12) | 224), (res[p++] = ((c >> 6) & 63) | 128), (res[p++] = (c & 63) | 128));\n }\n else for (i = 0; i < msg.length; i++) res[i] = msg[i] | 0;\n return res;\n }\n exports.toArray = toArray;\n function toHex(msg) {\n for (var res = \"\", i = 0; i < msg.length; i++) res += zero2(msg[i].toString(16));\n return res;\n }\n exports.toHex = toHex;\n function htonl(w) {\n var res = (w >>> 24) | ((w >>> 8) & 65280) | ((w << 8) & 16711680) | ((w & 255) << 24);\n return res >>> 0;\n }\n exports.htonl = htonl;\n function toHex32(msg, endian) {\n for (var res = \"\", i = 0; i < msg.length; i++) {\n var w = msg[i];\n endian === \"little\" && (w = htonl(w)), (res += zero8(w.toString(16)));\n }\n return res;\n }\n exports.toHex32 = toHex32;\n function zero2(word) {\n return word.length === 1 ? \"0\" + word : word;\n }\n exports.zero2 = zero2;\n function zero8(word) {\n return word.length === 7\n ? \"0\" + word\n : word.length === 6\n ? \"00\" + word\n : word.length === 5\n ? \"000\" + word\n : word.length === 4\n ? \"0000\" + word\n : word.length === 3\n ? \"00000\" + word\n : word.length === 2\n ? \"000000\" + word\n : word.length === 1\n ? \"0000000\" + word\n : word;\n }\n exports.zero8 = zero8;\n function join32(msg, start, end, endian) {\n var len = end - start;\n assert(len % 4 === 0);\n for (var res = new Array(len / 4), i = 0, k = start; i < res.length; i++, k += 4) {\n var w;\n endian === \"big\"\n ? (w = (msg[k] << 24) | (msg[k + 1] << 16) | (msg[k + 2] << 8) | msg[k + 3])\n : (w = (msg[k + 3] << 24) | (msg[k + 2] << 16) | (msg[k + 1] << 8) | msg[k]),\n (res[i] = w >>> 0);\n }\n return res;\n }\n exports.join32 = join32;\n function split32(msg, endian) {\n for (var res = new Array(msg.length * 4), i = 0, k = 0; i < msg.length; i++, k += 4) {\n var m = msg[i];\n endian === \"big\"\n ? ((res[k] = m >>> 24),\n (res[k + 1] = (m >>> 16) & 255),\n (res[k + 2] = (m >>> 8) & 255),\n (res[k + 3] = m & 255))\n : ((res[k + 3] = m >>> 24),\n (res[k + 2] = (m >>> 16) & 255),\n (res[k + 1] = (m >>> 8) & 255),\n (res[k] = m & 255));\n }\n return res;\n }\n exports.split32 = split32;\n function rotr32(w, b) {\n return (w >>> b) | (w << (32 - b));\n }\n exports.rotr32 = rotr32;\n function rotl32(w, b) {\n return (w << b) | (w >>> (32 - b));\n }\n exports.rotl32 = rotl32;\n function sum32(a, b) {\n return (a + b) >>> 0;\n }\n exports.sum32 = sum32;\n function sum32_3(a, b, c) {\n return (a + b + c) >>> 0;\n }\n exports.sum32_3 = sum32_3;\n function sum32_4(a, b, c, d) {\n return (a + b + c + d) >>> 0;\n }\n exports.sum32_4 = sum32_4;\n function sum32_5(a, b, c, d, e) {\n return (a + b + c + d + e) >>> 0;\n }\n exports.sum32_5 = sum32_5;\n function sum64(buf, pos, ah, al) {\n var bh = buf[pos],\n bl = buf[pos + 1],\n lo = (al + bl) >>> 0,\n hi = (lo < al ? 1 : 0) + ah + bh;\n (buf[pos] = hi >>> 0), (buf[pos + 1] = lo);\n }\n exports.sum64 = sum64;\n function sum64_hi(ah, al, bh, bl) {\n var lo = (al + bl) >>> 0,\n hi = (lo < al ? 1 : 0) + ah + bh;\n return hi >>> 0;\n }\n exports.sum64_hi = sum64_hi;\n function sum64_lo(ah, al, bh, bl) {\n var lo = al + bl;\n return lo >>> 0;\n }\n exports.sum64_lo = sum64_lo;\n function sum64_4_hi(ah, al, bh, bl, ch, cl, dh, dl) {\n var carry = 0,\n lo = al;\n (lo = (lo + bl) >>> 0),\n (carry += lo < al ? 1 : 0),\n (lo = (lo + cl) >>> 0),\n (carry += lo < cl ? 1 : 0),\n (lo = (lo + dl) >>> 0),\n (carry += lo < dl ? 1 : 0);\n var hi = ah + bh + ch + dh + carry;\n return hi >>> 0;\n }\n exports.sum64_4_hi = sum64_4_hi;\n function sum64_4_lo(ah, al, bh, bl, ch, cl, dh, dl) {\n var lo = al + bl + cl + dl;\n return lo >>> 0;\n }\n exports.sum64_4_lo = sum64_4_lo;\n function sum64_5_hi(ah, al, bh, bl, ch, cl, dh, dl, eh, el) {\n var carry = 0,\n lo = al;\n (lo = (lo + bl) >>> 0),\n (carry += lo < al ? 1 : 0),\n (lo = (lo + cl) >>> 0),\n (carry += lo < cl ? 1 : 0),\n (lo = (lo + dl) >>> 0),\n (carry += lo < dl ? 1 : 0),\n (lo = (lo + el) >>> 0),\n (carry += lo < el ? 1 : 0);\n var hi = ah + bh + ch + dh + eh + carry;\n return hi >>> 0;\n }\n exports.sum64_5_hi = sum64_5_hi;\n function sum64_5_lo(ah, al, bh, bl, ch, cl, dh, dl, eh, el) {\n var lo = al + bl + cl + dl + el;\n return lo >>> 0;\n }\n exports.sum64_5_lo = sum64_5_lo;\n function rotr64_hi(ah, al, num) {\n var r = (al << (32 - num)) | (ah >>> num);\n return r >>> 0;\n }\n exports.rotr64_hi = rotr64_hi;\n function rotr64_lo(ah, al, num) {\n var r = (ah << (32 - num)) | (al >>> num);\n return r >>> 0;\n }\n exports.rotr64_lo = rotr64_lo;\n function shr64_hi(ah, al, num) {\n return ah >>> num;\n }\n exports.shr64_hi = shr64_hi;\n function shr64_lo(ah, al, num) {\n var r = (ah << (32 - num)) | (al >>> num);\n return r >>> 0;\n }\n exports.shr64_lo = shr64_lo;\n },\n});\n\n// node_modules/hash.js/lib/hash/common.js\nvar require_common = __commonJS({\n \"node_modules/hash.js/lib/hash/common.js\"(exports) {\n \"use strict\";\n var utils = require_utils4(),\n assert = require_minimalistic_assert();\n function BlockHash() {\n (this.pending = null),\n (this.pendingTotal = 0),\n (this.blockSize = this.constructor.blockSize),\n (this.outSize = this.constructor.outSize),\n (this.hmacStrength = this.constructor.hmacStrength),\n (this.padLength = this.constructor.padLength / 8),\n (this.endian = \"big\"),\n (this._delta8 = this.blockSize / 8),\n (this._delta32 = this.blockSize / 32);\n }\n exports.BlockHash = BlockHash;\n BlockHash.prototype.update = function (msg, enc) {\n if (\n ((msg = utils.toArray(msg, enc)),\n this.pending ? (this.pending = this.pending.concat(msg)) : (this.pending = msg),\n (this.pendingTotal += msg.length),\n this.pending.length >= this._delta8)\n ) {\n msg = this.pending;\n var r = msg.length % this._delta8;\n (this.pending = msg.slice(msg.length - r, msg.length)),\n this.pending.length === 0 && (this.pending = null),\n (msg = utils.join32(msg, 0, msg.length - r, this.endian));\n for (var i = 0; i < msg.length; i += this._delta32) this._update(msg, i, i + this._delta32);\n }\n return this;\n };\n BlockHash.prototype.digest = function (enc) {\n return this.update(this._pad()), assert(this.pending === null), this._digest(enc);\n };\n BlockHash.prototype._pad = function () {\n var len = this.pendingTotal,\n bytes = this._delta8,\n k = bytes - ((len + this.padLength) % bytes),\n res = new Array(k + this.padLength);\n res[0] = 128;\n for (var i = 1; i < k; i++) res[i] = 0;\n if (((len <<= 3), this.endian === \"big\")) {\n for (var t = 8; t < this.padLength; t++) res[i++] = 0;\n (res[i++] = 0),\n (res[i++] = 0),\n (res[i++] = 0),\n (res[i++] = 0),\n (res[i++] = (len >>> 24) & 255),\n (res[i++] = (len >>> 16) & 255),\n (res[i++] = (len >>> 8) & 255),\n (res[i++] = len & 255);\n } else\n for (\n res[i++] = len & 255,\n res[i++] = (len >>> 8) & 255,\n res[i++] = (len >>> 16) & 255,\n res[i++] = (len >>> 24) & 255,\n res[i++] = 0,\n res[i++] = 0,\n res[i++] = 0,\n res[i++] = 0,\n t = 8;\n t < this.padLength;\n t++\n )\n res[i++] = 0;\n return res;\n };\n },\n});\n\n// node_modules/hash.js/lib/hash/sha/common.js\nvar require_common2 = __commonJS({\n \"node_modules/hash.js/lib/hash/sha/common.js\"(exports) {\n \"use strict\";\n var utils = require_utils4(),\n rotr32 = utils.rotr32;\n function ft_1(s, x, y, z) {\n if (s === 0) return ch32(x, y, z);\n if (s === 1 || s === 3) return p32(x, y, z);\n if (s === 2) return maj32(x, y, z);\n }\n exports.ft_1 = ft_1;\n function ch32(x, y, z) {\n return (x & y) ^ (~x & z);\n }\n exports.ch32 = ch32;\n function maj32(x, y, z) {\n return (x & y) ^ (x & z) ^ (y & z);\n }\n exports.maj32 = maj32;\n function p32(x, y, z) {\n return x ^ y ^ z;\n }\n exports.p32 = p32;\n function s0_256(x) {\n return rotr32(x, 2) ^ rotr32(x, 13) ^ rotr32(x, 22);\n }\n exports.s0_256 = s0_256;\n function s1_256(x) {\n return rotr32(x, 6) ^ rotr32(x, 11) ^ rotr32(x, 25);\n }\n exports.s1_256 = s1_256;\n function g0_256(x) {\n return rotr32(x, 7) ^ rotr32(x, 18) ^ (x >>> 3);\n }\n exports.g0_256 = g0_256;\n function g1_256(x) {\n return rotr32(x, 17) ^ rotr32(x, 19) ^ (x >>> 10);\n }\n exports.g1_256 = g1_256;\n },\n});\n\n// node_modules/hash.js/lib/hash/sha/1.js\nvar require__ = __commonJS({\n \"node_modules/hash.js/lib/hash/sha/1.js\"(exports, module) {\n \"use strict\";\n var utils = require_utils4(),\n common = require_common(),\n shaCommon = require_common2(),\n rotl32 = utils.rotl32,\n sum32 = utils.sum32,\n sum32_5 = utils.sum32_5,\n ft_1 = shaCommon.ft_1,\n BlockHash = common.BlockHash,\n sha1_K = [1518500249, 1859775393, 2400959708, 3395469782];\n function SHA1() {\n if (!(this instanceof SHA1)) return new SHA1();\n BlockHash.call(this),\n (this.h = [1732584193, 4023233417, 2562383102, 271733878, 3285377520]),\n (this.W = new Array(80));\n }\n utils.inherits(SHA1, BlockHash);\n module.exports = SHA1;\n SHA1.blockSize = 512;\n SHA1.outSize = 160;\n SHA1.hmacStrength = 80;\n SHA1.padLength = 64;\n SHA1.prototype._update = function (msg, start) {\n for (var W = this.W, i = 0; i < 16; i++) W[i] = msg[start + i];\n for (; i < W.length; i++) W[i] = rotl32(W[i - 3] ^ W[i - 8] ^ W[i - 14] ^ W[i - 16], 1);\n var a = this.h[0],\n b = this.h[1],\n c = this.h[2],\n d = this.h[3],\n e = this.h[4];\n for (i = 0; i < W.length; i++) {\n var s = ~~(i / 20),\n t = sum32_5(rotl32(a, 5), ft_1(s, b, c, d), e, W[i], sha1_K[s]);\n (e = d), (d = c), (c = rotl32(b, 30)), (b = a), (a = t);\n }\n (this.h[0] = sum32(this.h[0], a)),\n (this.h[1] = sum32(this.h[1], b)),\n (this.h[2] = sum32(this.h[2], c)),\n (this.h[3] = sum32(this.h[3], d)),\n (this.h[4] = sum32(this.h[4], e));\n };\n SHA1.prototype._digest = function (enc) {\n return enc === \"hex\" ? utils.toHex32(this.h, \"big\") : utils.split32(this.h, \"big\");\n };\n },\n});\n\n// node_modules/hash.js/lib/hash/sha/256.js\nvar require__2 = __commonJS({\n \"node_modules/hash.js/lib/hash/sha/256.js\"(exports, module) {\n \"use strict\";\n var utils = require_utils4(),\n common = require_common(),\n shaCommon = require_common2(),\n assert = require_minimalistic_assert(),\n sum32 = utils.sum32,\n sum32_4 = utils.sum32_4,\n sum32_5 = utils.sum32_5,\n ch32 = shaCommon.ch32,\n maj32 = shaCommon.maj32,\n s0_256 = shaCommon.s0_256,\n s1_256 = shaCommon.s1_256,\n g0_256 = shaCommon.g0_256,\n g1_256 = shaCommon.g1_256,\n BlockHash = common.BlockHash,\n sha256_K = [\n 1116352408, 1899447441, 3049323471, 3921009573, 961987163, 1508970993, 2453635748, 2870763221, 3624381080,\n 310598401, 607225278, 1426881987, 1925078388, 2162078206, 2614888103, 3248222580, 3835390401, 4022224774,\n 264347078, 604807628, 770255983, 1249150122, 1555081692, 1996064986, 2554220882, 2821834349, 2952996808,\n 3210313671, 3336571891, 3584528711, 113926993, 338241895, 666307205, 773529912, 1294757372, 1396182291,\n 1695183700, 1986661051, 2177026350, 2456956037, 2730485921, 2820302411, 3259730800, 3345764771, 3516065817,\n 3600352804, 4094571909, 275423344, 430227734, 506948616, 659060556, 883997877, 958139571, 1322822218,\n 1537002063, 1747873779, 1955562222, 2024104815, 2227730452, 2361852424, 2428436474, 2756734187, 3204031479,\n 3329325298,\n ];\n function SHA256() {\n if (!(this instanceof SHA256)) return new SHA256();\n BlockHash.call(this),\n (this.h = [1779033703, 3144134277, 1013904242, 2773480762, 1359893119, 2600822924, 528734635, 1541459225]),\n (this.k = sha256_K),\n (this.W = new Array(64));\n }\n utils.inherits(SHA256, BlockHash);\n module.exports = SHA256;\n SHA256.blockSize = 512;\n SHA256.outSize = 256;\n SHA256.hmacStrength = 192;\n SHA256.padLength = 64;\n SHA256.prototype._update = function (msg, start) {\n for (var W = this.W, i = 0; i < 16; i++) W[i] = msg[start + i];\n for (; i < W.length; i++) W[i] = sum32_4(g1_256(W[i - 2]), W[i - 7], g0_256(W[i - 15]), W[i - 16]);\n var a = this.h[0],\n b = this.h[1],\n c = this.h[2],\n d = this.h[3],\n e = this.h[4],\n f = this.h[5],\n g = this.h[6],\n h = this.h[7];\n for (assert(this.k.length === W.length), i = 0; i < W.length; i++) {\n var T1 = sum32_5(h, s1_256(e), ch32(e, f, g), this.k[i], W[i]),\n T2 = sum32(s0_256(a), maj32(a, b, c));\n (h = g), (g = f), (f = e), (e = sum32(d, T1)), (d = c), (c = b), (b = a), (a = sum32(T1, T2));\n }\n (this.h[0] = sum32(this.h[0], a)),\n (this.h[1] = sum32(this.h[1], b)),\n (this.h[2] = sum32(this.h[2], c)),\n (this.h[3] = sum32(this.h[3], d)),\n (this.h[4] = sum32(this.h[4], e)),\n (this.h[5] = sum32(this.h[5], f)),\n (this.h[6] = sum32(this.h[6], g)),\n (this.h[7] = sum32(this.h[7], h));\n };\n SHA256.prototype._digest = function (enc) {\n return enc === \"hex\" ? utils.toHex32(this.h, \"big\") : utils.split32(this.h, \"big\");\n };\n },\n});\n\n// node_modules/hash.js/lib/hash/sha/224.js\nvar require__3 = __commonJS({\n \"node_modules/hash.js/lib/hash/sha/224.js\"(exports, module) {\n \"use strict\";\n var utils = require_utils4(),\n SHA256 = require__2();\n function SHA224() {\n if (!(this instanceof SHA224)) return new SHA224();\n SHA256.call(this),\n (this.h = [3238371032, 914150663, 812702999, 4144912697, 4290775857, 1750603025, 1694076839, 3204075428]);\n }\n utils.inherits(SHA224, SHA256);\n module.exports = SHA224;\n SHA224.blockSize = 512;\n SHA224.outSize = 224;\n SHA224.hmacStrength = 192;\n SHA224.padLength = 64;\n SHA224.prototype._digest = function (enc) {\n return enc === \"hex\" ? utils.toHex32(this.h.slice(0, 7), \"big\") : utils.split32(this.h.slice(0, 7), \"big\");\n };\n },\n});\n\n// node_modules/hash.js/lib/hash/sha/512.js\nvar require__4 = __commonJS({\n \"node_modules/hash.js/lib/hash/sha/512.js\"(exports, module) {\n \"use strict\";\n var utils = require_utils4(),\n common = require_common(),\n assert = require_minimalistic_assert(),\n rotr64_hi = utils.rotr64_hi,\n rotr64_lo = utils.rotr64_lo,\n shr64_hi = utils.shr64_hi,\n shr64_lo = utils.shr64_lo,\n sum64 = utils.sum64,\n sum64_hi = utils.sum64_hi,\n sum64_lo = utils.sum64_lo,\n sum64_4_hi = utils.sum64_4_hi,\n sum64_4_lo = utils.sum64_4_lo,\n sum64_5_hi = utils.sum64_5_hi,\n sum64_5_lo = utils.sum64_5_lo,\n BlockHash = common.BlockHash,\n sha512_K = [\n 1116352408, 3609767458, 1899447441, 602891725, 3049323471, 3964484399, 3921009573, 2173295548, 961987163,\n 4081628472, 1508970993, 3053834265, 2453635748, 2937671579, 2870763221, 3664609560, 3624381080, 2734883394,\n 310598401, 1164996542, 607225278, 1323610764, 1426881987, 3590304994, 1925078388, 4068182383, 2162078206,\n 991336113, 2614888103, 633803317, 3248222580, 3479774868, 3835390401, 2666613458, 4022224774, 944711139,\n 264347078, 2341262773, 604807628, 2007800933, 770255983, 1495990901, 1249150122, 1856431235, 1555081692,\n 3175218132, 1996064986, 2198950837, 2554220882, 3999719339, 2821834349, 766784016, 2952996808, 2566594879,\n 3210313671, 3203337956, 3336571891, 1034457026, 3584528711, 2466948901, 113926993, 3758326383, 338241895,\n 168717936, 666307205, 1188179964, 773529912, 1546045734, 1294757372, 1522805485, 1396182291, 2643833823,\n 1695183700, 2343527390, 1986661051, 1014477480, 2177026350, 1206759142, 2456956037, 344077627, 2730485921,\n 1290863460, 2820302411, 3158454273, 3259730800, 3505952657, 3345764771, 106217008, 3516065817, 3606008344,\n 3600352804, 1432725776, 4094571909, 1467031594, 275423344, 851169720, 430227734, 3100823752, 506948616,\n 1363258195, 659060556, 3750685593, 883997877, 3785050280, 958139571, 3318307427, 1322822218, 3812723403,\n 1537002063, 2003034995, 1747873779, 3602036899, 1955562222, 1575990012, 2024104815, 1125592928, 2227730452,\n 2716904306, 2361852424, 442776044, 2428436474, 593698344, 2756734187, 3733110249, 3204031479, 2999351573,\n 3329325298, 3815920427, 3391569614, 3928383900, 3515267271, 566280711, 3940187606, 3454069534, 4118630271,\n 4000239992, 116418474, 1914138554, 174292421, 2731055270, 289380356, 3203993006, 460393269, 320620315,\n 685471733, 587496836, 852142971, 1086792851, 1017036298, 365543100, 1126000580, 2618297676, 1288033470,\n 3409855158, 1501505948, 4234509866, 1607167915, 987167468, 1816402316, 1246189591,\n ];\n function SHA512() {\n if (!(this instanceof SHA512)) return new SHA512();\n BlockHash.call(this),\n (this.h = [\n 1779033703, 4089235720, 3144134277, 2227873595, 1013904242, 4271175723, 2773480762, 1595750129, 1359893119,\n 2917565137, 2600822924, 725511199, 528734635, 4215389547, 1541459225, 327033209,\n ]),\n (this.k = sha512_K),\n (this.W = new Array(160));\n }\n utils.inherits(SHA512, BlockHash);\n module.exports = SHA512;\n SHA512.blockSize = 1024;\n SHA512.outSize = 512;\n SHA512.hmacStrength = 192;\n SHA512.padLength = 128;\n SHA512.prototype._prepareBlock = function (msg, start) {\n for (var W = this.W, i = 0; i < 32; i++) W[i] = msg[start + i];\n for (; i < W.length; i += 2) {\n var c0_hi = g1_512_hi(W[i - 4], W[i - 3]),\n c0_lo = g1_512_lo(W[i - 4], W[i - 3]),\n c1_hi = W[i - 14],\n c1_lo = W[i - 13],\n c2_hi = g0_512_hi(W[i - 30], W[i - 29]),\n c2_lo = g0_512_lo(W[i - 30], W[i - 29]),\n c3_hi = W[i - 32],\n c3_lo = W[i - 31];\n (W[i] = sum64_4_hi(c0_hi, c0_lo, c1_hi, c1_lo, c2_hi, c2_lo, c3_hi, c3_lo)),\n (W[i + 1] = sum64_4_lo(c0_hi, c0_lo, c1_hi, c1_lo, c2_hi, c2_lo, c3_hi, c3_lo));\n }\n };\n SHA512.prototype._update = function (msg, start) {\n this._prepareBlock(msg, start);\n var W = this.W,\n ah = this.h[0],\n al = this.h[1],\n bh = this.h[2],\n bl = this.h[3],\n ch = this.h[4],\n cl = this.h[5],\n dh = this.h[6],\n dl = this.h[7],\n eh = this.h[8],\n el = this.h[9],\n fh = this.h[10],\n fl = this.h[11],\n gh = this.h[12],\n gl = this.h[13],\n hh = this.h[14],\n hl = this.h[15];\n assert(this.k.length === W.length);\n for (var i = 0; i < W.length; i += 2) {\n var c0_hi = hh,\n c0_lo = hl,\n c1_hi = s1_512_hi(eh, el),\n c1_lo = s1_512_lo(eh, el),\n c2_hi = ch64_hi(eh, el, fh, fl, gh, gl),\n c2_lo = ch64_lo(eh, el, fh, fl, gh, gl),\n c3_hi = this.k[i],\n c3_lo = this.k[i + 1],\n c4_hi = W[i],\n c4_lo = W[i + 1],\n T1_hi = sum64_5_hi(c0_hi, c0_lo, c1_hi, c1_lo, c2_hi, c2_lo, c3_hi, c3_lo, c4_hi, c4_lo),\n T1_lo = sum64_5_lo(c0_hi, c0_lo, c1_hi, c1_lo, c2_hi, c2_lo, c3_hi, c3_lo, c4_hi, c4_lo);\n (c0_hi = s0_512_hi(ah, al)),\n (c0_lo = s0_512_lo(ah, al)),\n (c1_hi = maj64_hi(ah, al, bh, bl, ch, cl)),\n (c1_lo = maj64_lo(ah, al, bh, bl, ch, cl));\n var T2_hi = sum64_hi(c0_hi, c0_lo, c1_hi, c1_lo),\n T2_lo = sum64_lo(c0_hi, c0_lo, c1_hi, c1_lo);\n (hh = gh),\n (hl = gl),\n (gh = fh),\n (gl = fl),\n (fh = eh),\n (fl = el),\n (eh = sum64_hi(dh, dl, T1_hi, T1_lo)),\n (el = sum64_lo(dl, dl, T1_hi, T1_lo)),\n (dh = ch),\n (dl = cl),\n (ch = bh),\n (cl = bl),\n (bh = ah),\n (bl = al),\n (ah = sum64_hi(T1_hi, T1_lo, T2_hi, T2_lo)),\n (al = sum64_lo(T1_hi, T1_lo, T2_hi, T2_lo));\n }\n sum64(this.h, 0, ah, al),\n sum64(this.h, 2, bh, bl),\n sum64(this.h, 4, ch, cl),\n sum64(this.h, 6, dh, dl),\n sum64(this.h, 8, eh, el),\n sum64(this.h, 10, fh, fl),\n sum64(this.h, 12, gh, gl),\n sum64(this.h, 14, hh, hl);\n };\n SHA512.prototype._digest = function (enc) {\n return enc === \"hex\" ? utils.toHex32(this.h, \"big\") : utils.split32(this.h, \"big\");\n };\n function ch64_hi(xh, xl, yh, yl, zh) {\n var r = (xh & yh) ^ (~xh & zh);\n return r < 0 && (r += 4294967296), r;\n }\n function ch64_lo(xh, xl, yh, yl, zh, zl) {\n var r = (xl & yl) ^ (~xl & zl);\n return r < 0 && (r += 4294967296), r;\n }\n function maj64_hi(xh, xl, yh, yl, zh) {\n var r = (xh & yh) ^ (xh & zh) ^ (yh & zh);\n return r < 0 && (r += 4294967296), r;\n }\n function maj64_lo(xh, xl, yh, yl, zh, zl) {\n var r = (xl & yl) ^ (xl & zl) ^ (yl & zl);\n return r < 0 && (r += 4294967296), r;\n }\n function s0_512_hi(xh, xl) {\n var c0_hi = rotr64_hi(xh, xl, 28),\n c1_hi = rotr64_hi(xl, xh, 2),\n c2_hi = rotr64_hi(xl, xh, 7),\n r = c0_hi ^ c1_hi ^ c2_hi;\n return r < 0 && (r += 4294967296), r;\n }\n function s0_512_lo(xh, xl) {\n var c0_lo = rotr64_lo(xh, xl, 28),\n c1_lo = rotr64_lo(xl, xh, 2),\n c2_lo = rotr64_lo(xl, xh, 7),\n r = c0_lo ^ c1_lo ^ c2_lo;\n return r < 0 && (r += 4294967296), r;\n }\n function s1_512_hi(xh, xl) {\n var c0_hi = rotr64_hi(xh, xl, 14),\n c1_hi = rotr64_hi(xh, xl, 18),\n c2_hi = rotr64_hi(xl, xh, 9),\n r = c0_hi ^ c1_hi ^ c2_hi;\n return r < 0 && (r += 4294967296), r;\n }\n function s1_512_lo(xh, xl) {\n var c0_lo = rotr64_lo(xh, xl, 14),\n c1_lo = rotr64_lo(xh, xl, 18),\n c2_lo = rotr64_lo(xl, xh, 9),\n r = c0_lo ^ c1_lo ^ c2_lo;\n return r < 0 && (r += 4294967296), r;\n }\n function g0_512_hi(xh, xl) {\n var c0_hi = rotr64_hi(xh, xl, 1),\n c1_hi = rotr64_hi(xh, xl, 8),\n c2_hi = shr64_hi(xh, xl, 7),\n r = c0_hi ^ c1_hi ^ c2_hi;\n return r < 0 && (r += 4294967296), r;\n }\n function g0_512_lo(xh, xl) {\n var c0_lo = rotr64_lo(xh, xl, 1),\n c1_lo = rotr64_lo(xh, xl, 8),\n c2_lo = shr64_lo(xh, xl, 7),\n r = c0_lo ^ c1_lo ^ c2_lo;\n return r < 0 && (r += 4294967296), r;\n }\n function g1_512_hi(xh, xl) {\n var c0_hi = rotr64_hi(xh, xl, 19),\n c1_hi = rotr64_hi(xl, xh, 29),\n c2_hi = shr64_hi(xh, xl, 6),\n r = c0_hi ^ c1_hi ^ c2_hi;\n return r < 0 && (r += 4294967296), r;\n }\n function g1_512_lo(xh, xl) {\n var c0_lo = rotr64_lo(xh, xl, 19),\n c1_lo = rotr64_lo(xl, xh, 29),\n c2_lo = shr64_lo(xh, xl, 6),\n r = c0_lo ^ c1_lo ^ c2_lo;\n return r < 0 && (r += 4294967296), r;\n }\n },\n});\n\n// node_modules/hash.js/lib/hash/sha/384.js\nvar require__5 = __commonJS({\n \"node_modules/hash.js/lib/hash/sha/384.js\"(exports, module) {\n \"use strict\";\n var utils = require_utils4(),\n SHA512 = require__4();\n function SHA384() {\n if (!(this instanceof SHA384)) return new SHA384();\n SHA512.call(this),\n (this.h = [\n 3418070365, 3238371032, 1654270250, 914150663, 2438529370, 812702999, 355462360, 4144912697, 1731405415,\n 4290775857, 2394180231, 1750603025, 3675008525, 1694076839, 1203062813, 3204075428,\n ]);\n }\n utils.inherits(SHA384, SHA512);\n module.exports = SHA384;\n SHA384.blockSize = 1024;\n SHA384.outSize = 384;\n SHA384.hmacStrength = 192;\n SHA384.padLength = 128;\n SHA384.prototype._digest = function (enc) {\n return enc === \"hex\" ? utils.toHex32(this.h.slice(0, 12), \"big\") : utils.split32(this.h.slice(0, 12), \"big\");\n };\n },\n});\n\n// node_modules/hash.js/lib/hash/sha.js\nvar require_sha3 = __commonJS({\n \"node_modules/hash.js/lib/hash/sha.js\"(exports) {\n \"use strict\";\n exports.sha1 = require__();\n exports.sha224 = require__3();\n exports.sha256 = require__2();\n exports.sha384 = require__5();\n exports.sha512 = require__4();\n },\n});\n\n// node_modules/hash.js/lib/hash/ripemd.js\nvar require_ripemd = __commonJS({\n \"node_modules/hash.js/lib/hash/ripemd.js\"(exports) {\n \"use strict\";\n var utils = require_utils4(),\n common = require_common(),\n rotl32 = utils.rotl32,\n sum32 = utils.sum32,\n sum32_3 = utils.sum32_3,\n sum32_4 = utils.sum32_4,\n BlockHash = common.BlockHash;\n function RIPEMD160() {\n if (!(this instanceof RIPEMD160)) return new RIPEMD160();\n BlockHash.call(this),\n (this.h = [1732584193, 4023233417, 2562383102, 271733878, 3285377520]),\n (this.endian = \"little\");\n }\n utils.inherits(RIPEMD160, BlockHash);\n exports.ripemd160 = RIPEMD160;\n RIPEMD160.blockSize = 512;\n RIPEMD160.outSize = 160;\n RIPEMD160.hmacStrength = 192;\n RIPEMD160.padLength = 64;\n RIPEMD160.prototype._update = function (msg, start) {\n for (\n var A = this.h[0],\n B = this.h[1],\n C = this.h[2],\n D = this.h[3],\n E = this.h[4],\n Ah = A,\n Bh = B,\n Ch = C,\n Dh = D,\n Eh = E,\n j = 0;\n j < 80;\n j++\n ) {\n var T = sum32(rotl32(sum32_4(A, f(j, B, C, D), msg[r[j] + start], K(j)), s[j]), E);\n (A = E),\n (E = D),\n (D = rotl32(C, 10)),\n (C = B),\n (B = T),\n (T = sum32(rotl32(sum32_4(Ah, f(79 - j, Bh, Ch, Dh), msg[rh[j] + start], Kh(j)), sh[j]), Eh)),\n (Ah = Eh),\n (Eh = Dh),\n (Dh = rotl32(Ch, 10)),\n (Ch = Bh),\n (Bh = T);\n }\n (T = sum32_3(this.h[1], C, Dh)),\n (this.h[1] = sum32_3(this.h[2], D, Eh)),\n (this.h[2] = sum32_3(this.h[3], E, Ah)),\n (this.h[3] = sum32_3(this.h[4], A, Bh)),\n (this.h[4] = sum32_3(this.h[0], B, Ch)),\n (this.h[0] = T);\n };\n RIPEMD160.prototype._digest = function (enc) {\n return enc === \"hex\" ? utils.toHex32(this.h, \"little\") : utils.split32(this.h, \"little\");\n };\n function f(j, x, y, z) {\n return j <= 15\n ? x ^ y ^ z\n : j <= 31\n ? (x & y) | (~x & z)\n : j <= 47\n ? (x | ~y) ^ z\n : j <= 63\n ? (x & z) | (y & ~z)\n : x ^ (y | ~z);\n }\n function K(j) {\n return j <= 15 ? 0 : j <= 31 ? 1518500249 : j <= 47 ? 1859775393 : j <= 63 ? 2400959708 : 2840853838;\n }\n function Kh(j) {\n return j <= 15 ? 1352829926 : j <= 31 ? 1548603684 : j <= 47 ? 1836072691 : j <= 63 ? 2053994217 : 0;\n }\n var r = [\n 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 7, 4, 13, 1, 10, 6, 15, 3, 12, 0, 9, 5, 2, 14, 11, 8, 3,\n 10, 14, 4, 9, 15, 8, 1, 2, 7, 0, 6, 13, 11, 5, 12, 1, 9, 11, 10, 0, 8, 12, 4, 13, 3, 7, 15, 14, 5, 6, 2, 4, 0,\n 5, 9, 7, 12, 2, 10, 14, 1, 3, 8, 11, 6, 15, 13,\n ],\n rh = [\n 5, 14, 7, 0, 9, 2, 11, 4, 13, 6, 15, 8, 1, 10, 3, 12, 6, 11, 3, 7, 0, 13, 5, 10, 14, 15, 8, 12, 4, 9, 1, 2, 15,\n 5, 1, 3, 7, 14, 6, 9, 11, 8, 12, 2, 10, 0, 4, 13, 8, 6, 4, 1, 3, 11, 15, 0, 5, 12, 2, 13, 9, 7, 10, 14, 12, 15,\n 10, 4, 1, 5, 8, 7, 6, 2, 13, 14, 0, 3, 9, 11,\n ],\n s = [\n 11, 14, 15, 12, 5, 8, 7, 9, 11, 13, 14, 15, 6, 7, 9, 8, 7, 6, 8, 13, 11, 9, 7, 15, 7, 12, 15, 9, 11, 7, 13, 12,\n 11, 13, 6, 7, 14, 9, 13, 15, 14, 8, 13, 6, 5, 12, 7, 5, 11, 12, 14, 15, 14, 15, 9, 8, 9, 14, 5, 6, 8, 6, 5, 12,\n 9, 15, 5, 11, 6, 8, 13, 12, 5, 12, 13, 14, 11, 8, 5, 6,\n ],\n sh = [\n 8, 9, 9, 11, 13, 15, 15, 5, 7, 7, 8, 11, 14, 14, 12, 6, 9, 13, 15, 7, 12, 8, 9, 11, 7, 7, 12, 7, 6, 15, 13, 11,\n 9, 7, 15, 11, 8, 6, 6, 14, 12, 13, 5, 14, 13, 13, 7, 5, 15, 5, 8, 11, 14, 14, 6, 14, 6, 9, 12, 9, 12, 5, 15, 8,\n 8, 5, 12, 9, 12, 5, 14, 6, 8, 13, 6, 5, 15, 13, 11, 11,\n ];\n },\n});\n\n// node_modules/hash.js/lib/hash/hmac.js\nvar require_hmac = __commonJS({\n \"node_modules/hash.js/lib/hash/hmac.js\"(exports, module) {\n \"use strict\";\n var utils = require_utils4(),\n assert = require_minimalistic_assert();\n function Hmac(hash, key, enc) {\n if (!(this instanceof Hmac)) return new Hmac(hash, key, enc);\n (this.Hash = hash),\n (this.blockSize = hash.blockSize / 8),\n (this.outSize = hash.outSize / 8),\n (this.inner = null),\n (this.outer = null),\n this._init(utils.toArray(key, enc));\n }\n module.exports = Hmac;\n Hmac.prototype._init = function (key) {\n key.length > this.blockSize && (key = new this.Hash().update(key).digest()), assert(key.length <= this.blockSize);\n for (var i = key.length; i < this.blockSize; i++) key.push(0);\n for (i = 0; i < key.length; i++) key[i] ^= 54;\n for (this.inner = new this.Hash().update(key), i = 0; i < key.length; i++) key[i] ^= 106;\n this.outer = new this.Hash().update(key);\n };\n Hmac.prototype.update = function (msg, enc) {\n return this.inner.update(msg, enc), this;\n };\n Hmac.prototype.digest = function (enc) {\n return this.outer.update(this.inner.digest()), this.outer.digest(enc);\n };\n },\n});\n\n// node_modules/hash.js/lib/hash.js\nvar require_hash2 = __commonJS({\n \"node_modules/hash.js/lib/hash.js\"(exports) {\n var hash = exports;\n hash.utils = require_utils4();\n hash.common = require_common();\n hash.sha = require_sha3();\n hash.ripemd = require_ripemd();\n hash.hmac = require_hmac();\n hash.sha1 = hash.sha.sha1;\n hash.sha256 = hash.sha.sha256;\n hash.sha224 = hash.sha.sha224;\n hash.sha384 = hash.sha.sha384;\n hash.sha512 = hash.sha.sha512;\n hash.ripemd160 = hash.ripemd.ripemd160;\n },\n});\n\n// node_modules/elliptic/lib/elliptic/precomputed/secp256k1.js\nvar require_secp256k1 = __commonJS({\n \"node_modules/elliptic/lib/elliptic/precomputed/secp256k1.js\"(exports, module) {\n module.exports = {\n doubles: {\n step: 4,\n points: [\n [\n \"e60fce93b59e9ec53011aabc21c23e97b2a31369b87a5ae9c44ee89e2a6dec0a\",\n \"f7e3507399e595929db99f34f57937101296891e44d23f0be1f32cce69616821\",\n ],\n [\n \"8282263212c609d9ea2a6e3e172de238d8c39cabd5ac1ca10646e23fd5f51508\",\n \"11f8a8098557dfe45e8256e830b60ace62d613ac2f7b17bed31b6eaff6e26caf\",\n ],\n [\n \"175e159f728b865a72f99cc6c6fc846de0b93833fd2222ed73fce5b551e5b739\",\n \"d3506e0d9e3c79eba4ef97a51ff71f5eacb5955add24345c6efa6ffee9fed695\",\n ],\n [\n \"363d90d447b00c9c99ceac05b6262ee053441c7e55552ffe526bad8f83ff4640\",\n \"4e273adfc732221953b445397f3363145b9a89008199ecb62003c7f3bee9de9\",\n ],\n [\n \"8b4b5f165df3c2be8c6244b5b745638843e4a781a15bcd1b69f79a55dffdf80c\",\n \"4aad0a6f68d308b4b3fbd7813ab0da04f9e336546162ee56b3eff0c65fd4fd36\",\n ],\n [\n \"723cbaa6e5db996d6bf771c00bd548c7b700dbffa6c0e77bcb6115925232fcda\",\n \"96e867b5595cc498a921137488824d6e2660a0653779494801dc069d9eb39f5f\",\n ],\n [\n \"eebfa4d493bebf98ba5feec812c2d3b50947961237a919839a533eca0e7dd7fa\",\n \"5d9a8ca3970ef0f269ee7edaf178089d9ae4cdc3a711f712ddfd4fdae1de8999\",\n ],\n [\n \"100f44da696e71672791d0a09b7bde459f1215a29b3c03bfefd7835b39a48db0\",\n \"cdd9e13192a00b772ec8f3300c090666b7ff4a18ff5195ac0fbd5cd62bc65a09\",\n ],\n [\n \"e1031be262c7ed1b1dc9227a4a04c017a77f8d4464f3b3852c8acde6e534fd2d\",\n \"9d7061928940405e6bb6a4176597535af292dd419e1ced79a44f18f29456a00d\",\n ],\n [\n \"feea6cae46d55b530ac2839f143bd7ec5cf8b266a41d6af52d5e688d9094696d\",\n \"e57c6b6c97dce1bab06e4e12bf3ecd5c981c8957cc41442d3155debf18090088\",\n ],\n [\n \"da67a91d91049cdcb367be4be6ffca3cfeed657d808583de33fa978bc1ec6cb1\",\n \"9bacaa35481642bc41f463f7ec9780e5dec7adc508f740a17e9ea8e27a68be1d\",\n ],\n [\n \"53904faa0b334cdda6e000935ef22151ec08d0f7bb11069f57545ccc1a37b7c0\",\n \"5bc087d0bc80106d88c9eccac20d3c1c13999981e14434699dcb096b022771c8\",\n ],\n [\n \"8e7bcd0bd35983a7719cca7764ca906779b53a043a9b8bcaeff959f43ad86047\",\n \"10b7770b2a3da4b3940310420ca9514579e88e2e47fd68b3ea10047e8460372a\",\n ],\n [\n \"385eed34c1cdff21e6d0818689b81bde71a7f4f18397e6690a841e1599c43862\",\n \"283bebc3e8ea23f56701de19e9ebf4576b304eec2086dc8cc0458fe5542e5453\",\n ],\n [\n \"6f9d9b803ecf191637c73a4413dfa180fddf84a5947fbc9c606ed86c3fac3a7\",\n \"7c80c68e603059ba69b8e2a30e45c4d47ea4dd2f5c281002d86890603a842160\",\n ],\n [\n \"3322d401243c4e2582a2147c104d6ecbf774d163db0f5e5313b7e0e742d0e6bd\",\n \"56e70797e9664ef5bfb019bc4ddaf9b72805f63ea2873af624f3a2e96c28b2a0\",\n ],\n [\n \"85672c7d2de0b7da2bd1770d89665868741b3f9af7643397721d74d28134ab83\",\n \"7c481b9b5b43b2eb6374049bfa62c2e5e77f17fcc5298f44c8e3094f790313a6\",\n ],\n [\n \"948bf809b1988a46b06c9f1919413b10f9226c60f668832ffd959af60c82a0a\",\n \"53a562856dcb6646dc6b74c5d1c3418c6d4dff08c97cd2bed4cb7f88d8c8e589\",\n ],\n [\n \"6260ce7f461801c34f067ce0f02873a8f1b0e44dfc69752accecd819f38fd8e8\",\n \"bc2da82b6fa5b571a7f09049776a1ef7ecd292238051c198c1a84e95b2b4ae17\",\n ],\n [\n \"e5037de0afc1d8d43d8348414bbf4103043ec8f575bfdc432953cc8d2037fa2d\",\n \"4571534baa94d3b5f9f98d09fb990bddbd5f5b03ec481f10e0e5dc841d755bda\",\n ],\n [\n \"e06372b0f4a207adf5ea905e8f1771b4e7e8dbd1c6a6c5b725866a0ae4fce725\",\n \"7a908974bce18cfe12a27bb2ad5a488cd7484a7787104870b27034f94eee31dd\",\n ],\n [\n \"213c7a715cd5d45358d0bbf9dc0ce02204b10bdde2a3f58540ad6908d0559754\",\n \"4b6dad0b5ae462507013ad06245ba190bb4850f5f36a7eeddff2c27534b458f2\",\n ],\n [\n \"4e7c272a7af4b34e8dbb9352a5419a87e2838c70adc62cddf0cc3a3b08fbd53c\",\n \"17749c766c9d0b18e16fd09f6def681b530b9614bff7dd33e0b3941817dcaae6\",\n ],\n [\n \"fea74e3dbe778b1b10f238ad61686aa5c76e3db2be43057632427e2840fb27b6\",\n \"6e0568db9b0b13297cf674deccb6af93126b596b973f7b77701d3db7f23cb96f\",\n ],\n [\n \"76e64113f677cf0e10a2570d599968d31544e179b760432952c02a4417bdde39\",\n \"c90ddf8dee4e95cf577066d70681f0d35e2a33d2b56d2032b4b1752d1901ac01\",\n ],\n [\n \"c738c56b03b2abe1e8281baa743f8f9a8f7cc643df26cbee3ab150242bcbb891\",\n \"893fb578951ad2537f718f2eacbfbbbb82314eef7880cfe917e735d9699a84c3\",\n ],\n [\n \"d895626548b65b81e264c7637c972877d1d72e5f3a925014372e9f6588f6c14b\",\n \"febfaa38f2bc7eae728ec60818c340eb03428d632bb067e179363ed75d7d991f\",\n ],\n [\n \"b8da94032a957518eb0f6433571e8761ceffc73693e84edd49150a564f676e03\",\n \"2804dfa44805a1e4d7c99cc9762808b092cc584d95ff3b511488e4e74efdf6e7\",\n ],\n [\n \"e80fea14441fb33a7d8adab9475d7fab2019effb5156a792f1a11778e3c0df5d\",\n \"eed1de7f638e00771e89768ca3ca94472d155e80af322ea9fcb4291b6ac9ec78\",\n ],\n [\n \"a301697bdfcd704313ba48e51d567543f2a182031efd6915ddc07bbcc4e16070\",\n \"7370f91cfb67e4f5081809fa25d40f9b1735dbf7c0a11a130c0d1a041e177ea1\",\n ],\n [\n \"90ad85b389d6b936463f9d0512678de208cc330b11307fffab7ac63e3fb04ed4\",\n \"e507a3620a38261affdcbd9427222b839aefabe1582894d991d4d48cb6ef150\",\n ],\n [\n \"8f68b9d2f63b5f339239c1ad981f162ee88c5678723ea3351b7b444c9ec4c0da\",\n \"662a9f2dba063986de1d90c2b6be215dbbea2cfe95510bfdf23cbf79501fff82\",\n ],\n [\n \"e4f3fb0176af85d65ff99ff9198c36091f48e86503681e3e6686fd5053231e11\",\n \"1e63633ad0ef4f1c1661a6d0ea02b7286cc7e74ec951d1c9822c38576feb73bc\",\n ],\n [\n \"8c00fa9b18ebf331eb961537a45a4266c7034f2f0d4e1d0716fb6eae20eae29e\",\n \"efa47267fea521a1a9dc343a3736c974c2fadafa81e36c54e7d2a4c66702414b\",\n ],\n [\n \"e7a26ce69dd4829f3e10cec0a9e98ed3143d084f308b92c0997fddfc60cb3e41\",\n \"2a758e300fa7984b471b006a1aafbb18d0a6b2c0420e83e20e8a9421cf2cfd51\",\n ],\n [\n \"b6459e0ee3662ec8d23540c223bcbdc571cbcb967d79424f3cf29eb3de6b80ef\",\n \"67c876d06f3e06de1dadf16e5661db3c4b3ae6d48e35b2ff30bf0b61a71ba45\",\n ],\n [\n \"d68a80c8280bb840793234aa118f06231d6f1fc67e73c5a5deda0f5b496943e8\",\n \"db8ba9fff4b586d00c4b1f9177b0e28b5b0e7b8f7845295a294c84266b133120\",\n ],\n [\n \"324aed7df65c804252dc0270907a30b09612aeb973449cea4095980fc28d3d5d\",\n \"648a365774b61f2ff130c0c35aec1f4f19213b0c7e332843967224af96ab7c84\",\n ],\n [\n \"4df9c14919cde61f6d51dfdbe5fee5dceec4143ba8d1ca888e8bd373fd054c96\",\n \"35ec51092d8728050974c23a1d85d4b5d506cdc288490192ebac06cad10d5d\",\n ],\n [\n \"9c3919a84a474870faed8a9c1cc66021523489054d7f0308cbfc99c8ac1f98cd\",\n \"ddb84f0f4a4ddd57584f044bf260e641905326f76c64c8e6be7e5e03d4fc599d\",\n ],\n [\n \"6057170b1dd12fdf8de05f281d8e06bb91e1493a8b91d4cc5a21382120a959e5\",\n \"9a1af0b26a6a4807add9a2daf71df262465152bc3ee24c65e899be932385a2a8\",\n ],\n [\n \"a576df8e23a08411421439a4518da31880cef0fba7d4df12b1a6973eecb94266\",\n \"40a6bf20e76640b2c92b97afe58cd82c432e10a7f514d9f3ee8be11ae1b28ec8\",\n ],\n [\n \"7778a78c28dec3e30a05fe9629de8c38bb30d1f5cf9a3a208f763889be58ad71\",\n \"34626d9ab5a5b22ff7098e12f2ff580087b38411ff24ac563b513fc1fd9f43ac\",\n ],\n [\n \"928955ee637a84463729fd30e7afd2ed5f96274e5ad7e5cb09eda9c06d903ac\",\n \"c25621003d3f42a827b78a13093a95eeac3d26efa8a8d83fc5180e935bcd091f\",\n ],\n [\n \"85d0fef3ec6db109399064f3a0e3b2855645b4a907ad354527aae75163d82751\",\n \"1f03648413a38c0be29d496e582cf5663e8751e96877331582c237a24eb1f962\",\n ],\n [\n \"ff2b0dce97eece97c1c9b6041798b85dfdfb6d8882da20308f5404824526087e\",\n \"493d13fef524ba188af4c4dc54d07936c7b7ed6fb90e2ceb2c951e01f0c29907\",\n ],\n [\n \"827fbbe4b1e880ea9ed2b2e6301b212b57f1ee148cd6dd28780e5e2cf856e241\",\n \"c60f9c923c727b0b71bef2c67d1d12687ff7a63186903166d605b68baec293ec\",\n ],\n [\n \"eaa649f21f51bdbae7be4ae34ce6e5217a58fdce7f47f9aa7f3b58fa2120e2b3\",\n \"be3279ed5bbbb03ac69a80f89879aa5a01a6b965f13f7e59d47a5305ba5ad93d\",\n ],\n [\n \"e4a42d43c5cf169d9391df6decf42ee541b6d8f0c9a137401e23632dda34d24f\",\n \"4d9f92e716d1c73526fc99ccfb8ad34ce886eedfa8d8e4f13a7f7131deba9414\",\n ],\n [\n \"1ec80fef360cbdd954160fadab352b6b92b53576a88fea4947173b9d4300bf19\",\n \"aeefe93756b5340d2f3a4958a7abbf5e0146e77f6295a07b671cdc1cc107cefd\",\n ],\n [\n \"146a778c04670c2f91b00af4680dfa8bce3490717d58ba889ddb5928366642be\",\n \"b318e0ec3354028add669827f9d4b2870aaa971d2f7e5ed1d0b297483d83efd0\",\n ],\n [\n \"fa50c0f61d22e5f07e3acebb1aa07b128d0012209a28b9776d76a8793180eef9\",\n \"6b84c6922397eba9b72cd2872281a68a5e683293a57a213b38cd8d7d3f4f2811\",\n ],\n [\n \"da1d61d0ca721a11b1a5bf6b7d88e8421a288ab5d5bba5220e53d32b5f067ec2\",\n \"8157f55a7c99306c79c0766161c91e2966a73899d279b48a655fba0f1ad836f1\",\n ],\n [\n \"a8e282ff0c9706907215ff98e8fd416615311de0446f1e062a73b0610d064e13\",\n \"7f97355b8db81c09abfb7f3c5b2515888b679a3e50dd6bd6cef7c73111f4cc0c\",\n ],\n [\n \"174a53b9c9a285872d39e56e6913cab15d59b1fa512508c022f382de8319497c\",\n \"ccc9dc37abfc9c1657b4155f2c47f9e6646b3a1d8cb9854383da13ac079afa73\",\n ],\n [\n \"959396981943785c3d3e57edf5018cdbe039e730e4918b3d884fdff09475b7ba\",\n \"2e7e552888c331dd8ba0386a4b9cd6849c653f64c8709385e9b8abf87524f2fd\",\n ],\n [\n \"d2a63a50ae401e56d645a1153b109a8fcca0a43d561fba2dbb51340c9d82b151\",\n \"e82d86fb6443fcb7565aee58b2948220a70f750af484ca52d4142174dcf89405\",\n ],\n [\n \"64587e2335471eb890ee7896d7cfdc866bacbdbd3839317b3436f9b45617e073\",\n \"d99fcdd5bf6902e2ae96dd6447c299a185b90a39133aeab358299e5e9faf6589\",\n ],\n [\n \"8481bde0e4e4d885b3a546d3e549de042f0aa6cea250e7fd358d6c86dd45e458\",\n \"38ee7b8cba5404dd84a25bf39cecb2ca900a79c42b262e556d64b1b59779057e\",\n ],\n [\n \"13464a57a78102aa62b6979ae817f4637ffcfed3c4b1ce30bcd6303f6caf666b\",\n \"69be159004614580ef7e433453ccb0ca48f300a81d0942e13f495a907f6ecc27\",\n ],\n [\n \"bc4a9df5b713fe2e9aef430bcc1dc97a0cd9ccede2f28588cada3a0d2d83f366\",\n \"d3a81ca6e785c06383937adf4b798caa6e8a9fbfa547b16d758d666581f33c1\",\n ],\n [\n \"8c28a97bf8298bc0d23d8c749452a32e694b65e30a9472a3954ab30fe5324caa\",\n \"40a30463a3305193378fedf31f7cc0eb7ae784f0451cb9459e71dc73cbef9482\",\n ],\n [\n \"8ea9666139527a8c1dd94ce4f071fd23c8b350c5a4bb33748c4ba111faccae0\",\n \"620efabbc8ee2782e24e7c0cfb95c5d735b783be9cf0f8e955af34a30e62b945\",\n ],\n [\n \"dd3625faef5ba06074669716bbd3788d89bdde815959968092f76cc4eb9a9787\",\n \"7a188fa3520e30d461da2501045731ca941461982883395937f68d00c644a573\",\n ],\n [\n \"f710d79d9eb962297e4f6232b40e8f7feb2bc63814614d692c12de752408221e\",\n \"ea98e67232d3b3295d3b535532115ccac8612c721851617526ae47a9c77bfc82\",\n ],\n ],\n },\n naf: {\n wnd: 7,\n points: [\n [\n \"f9308a019258c31049344f85f89d5229b531c845836f99b08601f113bce036f9\",\n \"388f7b0f632de8140fe337e62a37f3566500a99934c2231b6cb9fd7584b8e672\",\n ],\n [\n \"2f8bde4d1a07209355b4a7250a5c5128e88b84bddc619ab7cba8d569b240efe4\",\n \"d8ac222636e5e3d6d4dba9dda6c9c426f788271bab0d6840dca87d3aa6ac62d6\",\n ],\n [\n \"5cbdf0646e5db4eaa398f365f2ea7a0e3d419b7e0330e39ce92bddedcac4f9bc\",\n \"6aebca40ba255960a3178d6d861a54dba813d0b813fde7b5a5082628087264da\",\n ],\n [\n \"acd484e2f0c7f65309ad178a9f559abde09796974c57e714c35f110dfc27ccbe\",\n \"cc338921b0a7d9fd64380971763b61e9add888a4375f8e0f05cc262ac64f9c37\",\n ],\n [\n \"774ae7f858a9411e5ef4246b70c65aac5649980be5c17891bbec17895da008cb\",\n \"d984a032eb6b5e190243dd56d7b7b365372db1e2dff9d6a8301d74c9c953c61b\",\n ],\n [\n \"f28773c2d975288bc7d1d205c3748651b075fbc6610e58cddeeddf8f19405aa8\",\n \"ab0902e8d880a89758212eb65cdaf473a1a06da521fa91f29b5cb52db03ed81\",\n ],\n [\n \"d7924d4f7d43ea965a465ae3095ff41131e5946f3c85f79e44adbcf8e27e080e\",\n \"581e2872a86c72a683842ec228cc6defea40af2bd896d3a5c504dc9ff6a26b58\",\n ],\n [\n \"defdea4cdb677750a420fee807eacf21eb9898ae79b9768766e4faa04a2d4a34\",\n \"4211ab0694635168e997b0ead2a93daeced1f4a04a95c0f6cfb199f69e56eb77\",\n ],\n [\n \"2b4ea0a797a443d293ef5cff444f4979f06acfebd7e86d277475656138385b6c\",\n \"85e89bc037945d93b343083b5a1c86131a01f60c50269763b570c854e5c09b7a\",\n ],\n [\n \"352bbf4a4cdd12564f93fa332ce333301d9ad40271f8107181340aef25be59d5\",\n \"321eb4075348f534d59c18259dda3e1f4a1b3b2e71b1039c67bd3d8bcf81998c\",\n ],\n [\n \"2fa2104d6b38d11b0230010559879124e42ab8dfeff5ff29dc9cdadd4ecacc3f\",\n \"2de1068295dd865b64569335bd5dd80181d70ecfc882648423ba76b532b7d67\",\n ],\n [\n \"9248279b09b4d68dab21a9b066edda83263c3d84e09572e269ca0cd7f5453714\",\n \"73016f7bf234aade5d1aa71bdea2b1ff3fc0de2a887912ffe54a32ce97cb3402\",\n ],\n [\n \"daed4f2be3a8bf278e70132fb0beb7522f570e144bf615c07e996d443dee8729\",\n \"a69dce4a7d6c98e8d4a1aca87ef8d7003f83c230f3afa726ab40e52290be1c55\",\n ],\n [\n \"c44d12c7065d812e8acf28d7cbb19f9011ecd9e9fdf281b0e6a3b5e87d22e7db\",\n \"2119a460ce326cdc76c45926c982fdac0e106e861edf61c5a039063f0e0e6482\",\n ],\n [\n \"6a245bf6dc698504c89a20cfded60853152b695336c28063b61c65cbd269e6b4\",\n \"e022cf42c2bd4a708b3f5126f16a24ad8b33ba48d0423b6efd5e6348100d8a82\",\n ],\n [\n \"1697ffa6fd9de627c077e3d2fe541084ce13300b0bec1146f95ae57f0d0bd6a5\",\n \"b9c398f186806f5d27561506e4557433a2cf15009e498ae7adee9d63d01b2396\",\n ],\n [\n \"605bdb019981718b986d0f07e834cb0d9deb8360ffb7f61df982345ef27a7479\",\n \"2972d2de4f8d20681a78d93ec96fe23c26bfae84fb14db43b01e1e9056b8c49\",\n ],\n [\n \"62d14dab4150bf497402fdc45a215e10dcb01c354959b10cfe31c7e9d87ff33d\",\n \"80fc06bd8cc5b01098088a1950eed0db01aa132967ab472235f5642483b25eaf\",\n ],\n [\n \"80c60ad0040f27dade5b4b06c408e56b2c50e9f56b9b8b425e555c2f86308b6f\",\n \"1c38303f1cc5c30f26e66bad7fe72f70a65eed4cbe7024eb1aa01f56430bd57a\",\n ],\n [\n \"7a9375ad6167ad54aa74c6348cc54d344cc5dc9487d847049d5eabb0fa03c8fb\",\n \"d0e3fa9eca8726909559e0d79269046bdc59ea10c70ce2b02d499ec224dc7f7\",\n ],\n [\n \"d528ecd9b696b54c907a9ed045447a79bb408ec39b68df504bb51f459bc3ffc9\",\n \"eecf41253136e5f99966f21881fd656ebc4345405c520dbc063465b521409933\",\n ],\n [\n \"49370a4b5f43412ea25f514e8ecdad05266115e4a7ecb1387231808f8b45963\",\n \"758f3f41afd6ed428b3081b0512fd62a54c3f3afbb5b6764b653052a12949c9a\",\n ],\n [\n \"77f230936ee88cbbd73df930d64702ef881d811e0e1498e2f1c13eb1fc345d74\",\n \"958ef42a7886b6400a08266e9ba1b37896c95330d97077cbbe8eb3c7671c60d6\",\n ],\n [\n \"f2dac991cc4ce4b9ea44887e5c7c0bce58c80074ab9d4dbaeb28531b7739f530\",\n \"e0dedc9b3b2f8dad4da1f32dec2531df9eb5fbeb0598e4fd1a117dba703a3c37\",\n ],\n [\n \"463b3d9f662621fb1b4be8fbbe2520125a216cdfc9dae3debcba4850c690d45b\",\n \"5ed430d78c296c3543114306dd8622d7c622e27c970a1de31cb377b01af7307e\",\n ],\n [\n \"f16f804244e46e2a09232d4aff3b59976b98fac14328a2d1a32496b49998f247\",\n \"cedabd9b82203f7e13d206fcdf4e33d92a6c53c26e5cce26d6579962c4e31df6\",\n ],\n [\n \"caf754272dc84563b0352b7a14311af55d245315ace27c65369e15f7151d41d1\",\n \"cb474660ef35f5f2a41b643fa5e460575f4fa9b7962232a5c32f908318a04476\",\n ],\n [\n \"2600ca4b282cb986f85d0f1709979d8b44a09c07cb86d7c124497bc86f082120\",\n \"4119b88753c15bd6a693b03fcddbb45d5ac6be74ab5f0ef44b0be9475a7e4b40\",\n ],\n [\n \"7635ca72d7e8432c338ec53cd12220bc01c48685e24f7dc8c602a7746998e435\",\n \"91b649609489d613d1d5e590f78e6d74ecfc061d57048bad9e76f302c5b9c61\",\n ],\n [\n \"754e3239f325570cdbbf4a87deee8a66b7f2b33479d468fbc1a50743bf56cc18\",\n \"673fb86e5bda30fb3cd0ed304ea49a023ee33d0197a695d0c5d98093c536683\",\n ],\n [\n \"e3e6bd1071a1e96aff57859c82d570f0330800661d1c952f9fe2694691d9b9e8\",\n \"59c9e0bba394e76f40c0aa58379a3cb6a5a2283993e90c4167002af4920e37f5\",\n ],\n [\n \"186b483d056a033826ae73d88f732985c4ccb1f32ba35f4b4cc47fdcf04aa6eb\",\n \"3b952d32c67cf77e2e17446e204180ab21fb8090895138b4a4a797f86e80888b\",\n ],\n [\n \"df9d70a6b9876ce544c98561f4be4f725442e6d2b737d9c91a8321724ce0963f\",\n \"55eb2dafd84d6ccd5f862b785dc39d4ab157222720ef9da217b8c45cf2ba2417\",\n ],\n [\n \"5edd5cc23c51e87a497ca815d5dce0f8ab52554f849ed8995de64c5f34ce7143\",\n \"efae9c8dbc14130661e8cec030c89ad0c13c66c0d17a2905cdc706ab7399a868\",\n ],\n [\n \"290798c2b6476830da12fe02287e9e777aa3fba1c355b17a722d362f84614fba\",\n \"e38da76dcd440621988d00bcf79af25d5b29c094db2a23146d003afd41943e7a\",\n ],\n [\n \"af3c423a95d9f5b3054754efa150ac39cd29552fe360257362dfdecef4053b45\",\n \"f98a3fd831eb2b749a93b0e6f35cfb40c8cd5aa667a15581bc2feded498fd9c6\",\n ],\n [\n \"766dbb24d134e745cccaa28c99bf274906bb66b26dcf98df8d2fed50d884249a\",\n \"744b1152eacbe5e38dcc887980da38b897584a65fa06cedd2c924f97cbac5996\",\n ],\n [\n \"59dbf46f8c94759ba21277c33784f41645f7b44f6c596a58ce92e666191abe3e\",\n \"c534ad44175fbc300f4ea6ce648309a042ce739a7919798cd85e216c4a307f6e\",\n ],\n [\n \"f13ada95103c4537305e691e74e9a4a8dd647e711a95e73cb62dc6018cfd87b8\",\n \"e13817b44ee14de663bf4bc808341f326949e21a6a75c2570778419bdaf5733d\",\n ],\n [\n \"7754b4fa0e8aced06d4167a2c59cca4cda1869c06ebadfb6488550015a88522c\",\n \"30e93e864e669d82224b967c3020b8fa8d1e4e350b6cbcc537a48b57841163a2\",\n ],\n [\n \"948dcadf5990e048aa3874d46abef9d701858f95de8041d2a6828c99e2262519\",\n \"e491a42537f6e597d5d28a3224b1bc25df9154efbd2ef1d2cbba2cae5347d57e\",\n ],\n [\n \"7962414450c76c1689c7b48f8202ec37fb224cf5ac0bfa1570328a8a3d7c77ab\",\n \"100b610ec4ffb4760d5c1fc133ef6f6b12507a051f04ac5760afa5b29db83437\",\n ],\n [\n \"3514087834964b54b15b160644d915485a16977225b8847bb0dd085137ec47ca\",\n \"ef0afbb2056205448e1652c48e8127fc6039e77c15c2378b7e7d15a0de293311\",\n ],\n [\n \"d3cc30ad6b483e4bc79ce2c9dd8bc54993e947eb8df787b442943d3f7b527eaf\",\n \"8b378a22d827278d89c5e9be8f9508ae3c2ad46290358630afb34db04eede0a4\",\n ],\n [\n \"1624d84780732860ce1c78fcbfefe08b2b29823db913f6493975ba0ff4847610\",\n \"68651cf9b6da903e0914448c6cd9d4ca896878f5282be4c8cc06e2a404078575\",\n ],\n [\n \"733ce80da955a8a26902c95633e62a985192474b5af207da6df7b4fd5fc61cd4\",\n \"f5435a2bd2badf7d485a4d8b8db9fcce3e1ef8e0201e4578c54673bc1dc5ea1d\",\n ],\n [\n \"15d9441254945064cf1a1c33bbd3b49f8966c5092171e699ef258dfab81c045c\",\n \"d56eb30b69463e7234f5137b73b84177434800bacebfc685fc37bbe9efe4070d\",\n ],\n [\n \"a1d0fcf2ec9de675b612136e5ce70d271c21417c9d2b8aaaac138599d0717940\",\n \"edd77f50bcb5a3cab2e90737309667f2641462a54070f3d519212d39c197a629\",\n ],\n [\n \"e22fbe15c0af8ccc5780c0735f84dbe9a790badee8245c06c7ca37331cb36980\",\n \"a855babad5cd60c88b430a69f53a1a7a38289154964799be43d06d77d31da06\",\n ],\n [\n \"311091dd9860e8e20ee13473c1155f5f69635e394704eaa74009452246cfa9b3\",\n \"66db656f87d1f04fffd1f04788c06830871ec5a64feee685bd80f0b1286d8374\",\n ],\n [\n \"34c1fd04d301be89b31c0442d3e6ac24883928b45a9340781867d4232ec2dbdf\",\n \"9414685e97b1b5954bd46f730174136d57f1ceeb487443dc5321857ba73abee\",\n ],\n [\n \"f219ea5d6b54701c1c14de5b557eb42a8d13f3abbcd08affcc2a5e6b049b8d63\",\n \"4cb95957e83d40b0f73af4544cccf6b1f4b08d3c07b27fb8d8c2962a400766d1\",\n ],\n [\n \"d7b8740f74a8fbaab1f683db8f45de26543a5490bca627087236912469a0b448\",\n \"fa77968128d9c92ee1010f337ad4717eff15db5ed3c049b3411e0315eaa4593b\",\n ],\n [\n \"32d31c222f8f6f0ef86f7c98d3a3335ead5bcd32abdd94289fe4d3091aa824bf\",\n \"5f3032f5892156e39ccd3d7915b9e1da2e6dac9e6f26e961118d14b8462e1661\",\n ],\n [\n \"7461f371914ab32671045a155d9831ea8793d77cd59592c4340f86cbc18347b5\",\n \"8ec0ba238b96bec0cbdddcae0aa442542eee1ff50c986ea6b39847b3cc092ff6\",\n ],\n [\n \"ee079adb1df1860074356a25aa38206a6d716b2c3e67453d287698bad7b2b2d6\",\n \"8dc2412aafe3be5c4c5f37e0ecc5f9f6a446989af04c4e25ebaac479ec1c8c1e\",\n ],\n [\n \"16ec93e447ec83f0467b18302ee620f7e65de331874c9dc72bfd8616ba9da6b5\",\n \"5e4631150e62fb40d0e8c2a7ca5804a39d58186a50e497139626778e25b0674d\",\n ],\n [\n \"eaa5f980c245f6f038978290afa70b6bd8855897f98b6aa485b96065d537bd99\",\n \"f65f5d3e292c2e0819a528391c994624d784869d7e6ea67fb18041024edc07dc\",\n ],\n [\n \"78c9407544ac132692ee1910a02439958ae04877151342ea96c4b6b35a49f51\",\n \"f3e0319169eb9b85d5404795539a5e68fa1fbd583c064d2462b675f194a3ddb4\",\n ],\n [\n \"494f4be219a1a77016dcd838431aea0001cdc8ae7a6fc688726578d9702857a5\",\n \"42242a969283a5f339ba7f075e36ba2af925ce30d767ed6e55f4b031880d562c\",\n ],\n [\n \"a598a8030da6d86c6bc7f2f5144ea549d28211ea58faa70ebf4c1e665c1fe9b5\",\n \"204b5d6f84822c307e4b4a7140737aec23fc63b65b35f86a10026dbd2d864e6b\",\n ],\n [\n \"c41916365abb2b5d09192f5f2dbeafec208f020f12570a184dbadc3e58595997\",\n \"4f14351d0087efa49d245b328984989d5caf9450f34bfc0ed16e96b58fa9913\",\n ],\n [\n \"841d6063a586fa475a724604da03bc5b92a2e0d2e0a36acfe4c73a5514742881\",\n \"73867f59c0659e81904f9a1c7543698e62562d6744c169ce7a36de01a8d6154\",\n ],\n [\n \"5e95bb399a6971d376026947f89bde2f282b33810928be4ded112ac4d70e20d5\",\n \"39f23f366809085beebfc71181313775a99c9aed7d8ba38b161384c746012865\",\n ],\n [\n \"36e4641a53948fd476c39f8a99fd974e5ec07564b5315d8bf99471bca0ef2f66\",\n \"d2424b1b1abe4eb8164227b085c9aa9456ea13493fd563e06fd51cf5694c78fc\",\n ],\n [\n \"336581ea7bfbbb290c191a2f507a41cf5643842170e914faeab27c2c579f726\",\n \"ead12168595fe1be99252129b6e56b3391f7ab1410cd1e0ef3dcdcabd2fda224\",\n ],\n [\n \"8ab89816dadfd6b6a1f2634fcf00ec8403781025ed6890c4849742706bd43ede\",\n \"6fdcef09f2f6d0a044e654aef624136f503d459c3e89845858a47a9129cdd24e\",\n ],\n [\n \"1e33f1a746c9c5778133344d9299fcaa20b0938e8acff2544bb40284b8c5fb94\",\n \"60660257dd11b3aa9c8ed618d24edff2306d320f1d03010e33a7d2057f3b3b6\",\n ],\n [\n \"85b7c1dcb3cec1b7ee7f30ded79dd20a0ed1f4cc18cbcfcfa410361fd8f08f31\",\n \"3d98a9cdd026dd43f39048f25a8847f4fcafad1895d7a633c6fed3c35e999511\",\n ],\n [\n \"29df9fbd8d9e46509275f4b125d6d45d7fbe9a3b878a7af872a2800661ac5f51\",\n \"b4c4fe99c775a606e2d8862179139ffda61dc861c019e55cd2876eb2a27d84b\",\n ],\n [\n \"a0b1cae06b0a847a3fea6e671aaf8adfdfe58ca2f768105c8082b2e449fce252\",\n \"ae434102edde0958ec4b19d917a6a28e6b72da1834aff0e650f049503a296cf2\",\n ],\n [\n \"4e8ceafb9b3e9a136dc7ff67e840295b499dfb3b2133e4ba113f2e4c0e121e5\",\n \"cf2174118c8b6d7a4b48f6d534ce5c79422c086a63460502b827ce62a326683c\",\n ],\n [\n \"d24a44e047e19b6f5afb81c7ca2f69080a5076689a010919f42725c2b789a33b\",\n \"6fb8d5591b466f8fc63db50f1c0f1c69013f996887b8244d2cdec417afea8fa3\",\n ],\n [\n \"ea01606a7a6c9cdd249fdfcfacb99584001edd28abbab77b5104e98e8e3b35d4\",\n \"322af4908c7312b0cfbfe369f7a7b3cdb7d4494bc2823700cfd652188a3ea98d\",\n ],\n [\n \"af8addbf2b661c8a6c6328655eb96651252007d8c5ea31be4ad196de8ce2131f\",\n \"6749e67c029b85f52a034eafd096836b2520818680e26ac8f3dfbcdb71749700\",\n ],\n [\n \"e3ae1974566ca06cc516d47e0fb165a674a3dabcfca15e722f0e3450f45889\",\n \"2aeabe7e4531510116217f07bf4d07300de97e4874f81f533420a72eeb0bd6a4\",\n ],\n [\n \"591ee355313d99721cf6993ffed1e3e301993ff3ed258802075ea8ced397e246\",\n \"b0ea558a113c30bea60fc4775460c7901ff0b053d25ca2bdeee98f1a4be5d196\",\n ],\n [\n \"11396d55fda54c49f19aa97318d8da61fa8584e47b084945077cf03255b52984\",\n \"998c74a8cd45ac01289d5833a7beb4744ff536b01b257be4c5767bea93ea57a4\",\n ],\n [\n \"3c5d2a1ba39c5a1790000738c9e0c40b8dcdfd5468754b6405540157e017aa7a\",\n \"b2284279995a34e2f9d4de7396fc18b80f9b8b9fdd270f6661f79ca4c81bd257\",\n ],\n [\n \"cc8704b8a60a0defa3a99a7299f2e9c3fbc395afb04ac078425ef8a1793cc030\",\n \"bdd46039feed17881d1e0862db347f8cf395b74fc4bcdc4e940b74e3ac1f1b13\",\n ],\n [\n \"c533e4f7ea8555aacd9777ac5cad29b97dd4defccc53ee7ea204119b2889b197\",\n \"6f0a256bc5efdf429a2fb6242f1a43a2d9b925bb4a4b3a26bb8e0f45eb596096\",\n ],\n [\n \"c14f8f2ccb27d6f109f6d08d03cc96a69ba8c34eec07bbcf566d48e33da6593\",\n \"c359d6923bb398f7fd4473e16fe1c28475b740dd098075e6c0e8649113dc3a38\",\n ],\n [\n \"a6cbc3046bc6a450bac24789fa17115a4c9739ed75f8f21ce441f72e0b90e6ef\",\n \"21ae7f4680e889bb130619e2c0f95a360ceb573c70603139862afd617fa9b9f\",\n ],\n [\n \"347d6d9a02c48927ebfb86c1359b1caf130a3c0267d11ce6344b39f99d43cc38\",\n \"60ea7f61a353524d1c987f6ecec92f086d565ab687870cb12689ff1e31c74448\",\n ],\n [\n \"da6545d2181db8d983f7dcb375ef5866d47c67b1bf31c8cf855ef7437b72656a\",\n \"49b96715ab6878a79e78f07ce5680c5d6673051b4935bd897fea824b77dc208a\",\n ],\n [\n \"c40747cc9d012cb1a13b8148309c6de7ec25d6945d657146b9d5994b8feb1111\",\n \"5ca560753be2a12fc6de6caf2cb489565db936156b9514e1bb5e83037e0fa2d4\",\n ],\n [\n \"4e42c8ec82c99798ccf3a610be870e78338c7f713348bd34c8203ef4037f3502\",\n \"7571d74ee5e0fb92a7a8b33a07783341a5492144cc54bcc40a94473693606437\",\n ],\n [\n \"3775ab7089bc6af823aba2e1af70b236d251cadb0c86743287522a1b3b0dedea\",\n \"be52d107bcfa09d8bcb9736a828cfa7fac8db17bf7a76a2c42ad961409018cf7\",\n ],\n [\n \"cee31cbf7e34ec379d94fb814d3d775ad954595d1314ba8846959e3e82f74e26\",\n \"8fd64a14c06b589c26b947ae2bcf6bfa0149ef0be14ed4d80f448a01c43b1c6d\",\n ],\n [\n \"b4f9eaea09b6917619f6ea6a4eb5464efddb58fd45b1ebefcdc1a01d08b47986\",\n \"39e5c9925b5a54b07433a4f18c61726f8bb131c012ca542eb24a8ac07200682a\",\n ],\n [\n \"d4263dfc3d2df923a0179a48966d30ce84e2515afc3dccc1b77907792ebcc60e\",\n \"62dfaf07a0f78feb30e30d6295853ce189e127760ad6cf7fae164e122a208d54\",\n ],\n [\n \"48457524820fa65a4f8d35eb6930857c0032acc0a4a2de422233eeda897612c4\",\n \"25a748ab367979d98733c38a1fa1c2e7dc6cc07db2d60a9ae7a76aaa49bd0f77\",\n ],\n [\n \"dfeeef1881101f2cb11644f3a2afdfc2045e19919152923f367a1767c11cceda\",\n \"ecfb7056cf1de042f9420bab396793c0c390bde74b4bbdff16a83ae09a9a7517\",\n ],\n [\n \"6d7ef6b17543f8373c573f44e1f389835d89bcbc6062ced36c82df83b8fae859\",\n \"cd450ec335438986dfefa10c57fea9bcc521a0959b2d80bbf74b190dca712d10\",\n ],\n [\n \"e75605d59102a5a2684500d3b991f2e3f3c88b93225547035af25af66e04541f\",\n \"f5c54754a8f71ee540b9b48728473e314f729ac5308b06938360990e2bfad125\",\n ],\n [\n \"eb98660f4c4dfaa06a2be453d5020bc99a0c2e60abe388457dd43fefb1ed620c\",\n \"6cb9a8876d9cb8520609af3add26cd20a0a7cd8a9411131ce85f44100099223e\",\n ],\n [\n \"13e87b027d8514d35939f2e6892b19922154596941888336dc3563e3b8dba942\",\n \"fef5a3c68059a6dec5d624114bf1e91aac2b9da568d6abeb2570d55646b8adf1\",\n ],\n [\n \"ee163026e9fd6fe017c38f06a5be6fc125424b371ce2708e7bf4491691e5764a\",\n \"1acb250f255dd61c43d94ccc670d0f58f49ae3fa15b96623e5430da0ad6c62b2\",\n ],\n [\n \"b268f5ef9ad51e4d78de3a750c2dc89b1e626d43505867999932e5db33af3d80\",\n \"5f310d4b3c99b9ebb19f77d41c1dee018cf0d34fd4191614003e945a1216e423\",\n ],\n [\n \"ff07f3118a9df035e9fad85eb6c7bfe42b02f01ca99ceea3bf7ffdba93c4750d\",\n \"438136d603e858a3a5c440c38eccbaddc1d2942114e2eddd4740d098ced1f0d8\",\n ],\n [\n \"8d8b9855c7c052a34146fd20ffb658bea4b9f69e0d825ebec16e8c3ce2b526a1\",\n \"cdb559eedc2d79f926baf44fb84ea4d44bcf50fee51d7ceb30e2e7f463036758\",\n ],\n [\n \"52db0b5384dfbf05bfa9d472d7ae26dfe4b851ceca91b1eba54263180da32b63\",\n \"c3b997d050ee5d423ebaf66a6db9f57b3180c902875679de924b69d84a7b375\",\n ],\n [\n \"e62f9490d3d51da6395efd24e80919cc7d0f29c3f3fa48c6fff543becbd43352\",\n \"6d89ad7ba4876b0b22c2ca280c682862f342c8591f1daf5170e07bfd9ccafa7d\",\n ],\n [\n \"7f30ea2476b399b4957509c88f77d0191afa2ff5cb7b14fd6d8e7d65aaab1193\",\n \"ca5ef7d4b231c94c3b15389a5f6311e9daff7bb67b103e9880ef4bff637acaec\",\n ],\n [\n \"5098ff1e1d9f14fb46a210fada6c903fef0fb7b4a1dd1d9ac60a0361800b7a00\",\n \"9731141d81fc8f8084d37c6e7542006b3ee1b40d60dfe5362a5b132fd17ddc0\",\n ],\n [\n \"32b78c7de9ee512a72895be6b9cbefa6e2f3c4ccce445c96b9f2c81e2778ad58\",\n \"ee1849f513df71e32efc3896ee28260c73bb80547ae2275ba497237794c8753c\",\n ],\n [\n \"e2cb74fddc8e9fbcd076eef2a7c72b0ce37d50f08269dfc074b581550547a4f7\",\n \"d3aa2ed71c9dd2247a62df062736eb0baddea9e36122d2be8641abcb005cc4a4\",\n ],\n [\n \"8438447566d4d7bedadc299496ab357426009a35f235cb141be0d99cd10ae3a8\",\n \"c4e1020916980a4da5d01ac5e6ad330734ef0d7906631c4f2390426b2edd791f\",\n ],\n [\n \"4162d488b89402039b584c6fc6c308870587d9c46f660b878ab65c82c711d67e\",\n \"67163e903236289f776f22c25fb8a3afc1732f2b84b4e95dbda47ae5a0852649\",\n ],\n [\n \"3fad3fa84caf0f34f0f89bfd2dcf54fc175d767aec3e50684f3ba4a4bf5f683d\",\n \"cd1bc7cb6cc407bb2f0ca647c718a730cf71872e7d0d2a53fa20efcdfe61826\",\n ],\n [\n \"674f2600a3007a00568c1a7ce05d0816c1fb84bf1370798f1c69532faeb1a86b\",\n \"299d21f9413f33b3edf43b257004580b70db57da0b182259e09eecc69e0d38a5\",\n ],\n [\n \"d32f4da54ade74abb81b815ad1fb3b263d82d6c692714bcff87d29bd5ee9f08f\",\n \"f9429e738b8e53b968e99016c059707782e14f4535359d582fc416910b3eea87\",\n ],\n [\n \"30e4e670435385556e593657135845d36fbb6931f72b08cb1ed954f1e3ce3ff6\",\n \"462f9bce619898638499350113bbc9b10a878d35da70740dc695a559eb88db7b\",\n ],\n [\n \"be2062003c51cc3004682904330e4dee7f3dcd10b01e580bf1971b04d4cad297\",\n \"62188bc49d61e5428573d48a74e1c655b1c61090905682a0d5558ed72dccb9bc\",\n ],\n [\n \"93144423ace3451ed29e0fb9ac2af211cb6e84a601df5993c419859fff5df04a\",\n \"7c10dfb164c3425f5c71a3f9d7992038f1065224f72bb9d1d902a6d13037b47c\",\n ],\n [\n \"b015f8044f5fcbdcf21ca26d6c34fb8197829205c7b7d2a7cb66418c157b112c\",\n \"ab8c1e086d04e813744a655b2df8d5f83b3cdc6faa3088c1d3aea1454e3a1d5f\",\n ],\n [\n \"d5e9e1da649d97d89e4868117a465a3a4f8a18de57a140d36b3f2af341a21b52\",\n \"4cb04437f391ed73111a13cc1d4dd0db1693465c2240480d8955e8592f27447a\",\n ],\n [\n \"d3ae41047dd7ca065dbf8ed77b992439983005cd72e16d6f996a5316d36966bb\",\n \"bd1aeb21ad22ebb22a10f0303417c6d964f8cdd7df0aca614b10dc14d125ac46\",\n ],\n [\n \"463e2763d885f958fc66cdd22800f0a487197d0a82e377b49f80af87c897b065\",\n \"bfefacdb0e5d0fd7df3a311a94de062b26b80c61fbc97508b79992671ef7ca7f\",\n ],\n [\n \"7985fdfd127c0567c6f53ec1bb63ec3158e597c40bfe747c83cddfc910641917\",\n \"603c12daf3d9862ef2b25fe1de289aed24ed291e0ec6708703a5bd567f32ed03\",\n ],\n [\n \"74a1ad6b5f76e39db2dd249410eac7f99e74c59cb83d2d0ed5ff1543da7703e9\",\n \"cc6157ef18c9c63cd6193d83631bbea0093e0968942e8c33d5737fd790e0db08\",\n ],\n [\n \"30682a50703375f602d416664ba19b7fc9bab42c72747463a71d0896b22f6da3\",\n \"553e04f6b018b4fa6c8f39e7f311d3176290d0e0f19ca73f17714d9977a22ff8\",\n ],\n [\n \"9e2158f0d7c0d5f26c3791efefa79597654e7a2b2464f52b1ee6c1347769ef57\",\n \"712fcdd1b9053f09003a3481fa7762e9ffd7c8ef35a38509e2fbf2629008373\",\n ],\n [\n \"176e26989a43c9cfeba4029c202538c28172e566e3c4fce7322857f3be327d66\",\n \"ed8cc9d04b29eb877d270b4878dc43c19aefd31f4eee09ee7b47834c1fa4b1c3\",\n ],\n [\n \"75d46efea3771e6e68abb89a13ad747ecf1892393dfc4f1b7004788c50374da8\",\n \"9852390a99507679fd0b86fd2b39a868d7efc22151346e1a3ca4726586a6bed8\",\n ],\n [\n \"809a20c67d64900ffb698c4c825f6d5f2310fb0451c869345b7319f645605721\",\n \"9e994980d9917e22b76b061927fa04143d096ccc54963e6a5ebfa5f3f8e286c1\",\n ],\n [\n \"1b38903a43f7f114ed4500b4eac7083fdefece1cf29c63528d563446f972c180\",\n \"4036edc931a60ae889353f77fd53de4a2708b26b6f5da72ad3394119daf408f9\",\n ],\n ],\n },\n };\n },\n});\n\n// node_modules/elliptic/lib/elliptic/curves.js\nvar require_curves = __commonJS({\n \"node_modules/elliptic/lib/elliptic/curves.js\"(exports) {\n \"use strict\";\n var curves = exports,\n hash = require_hash2(),\n curve = require_curve(),\n utils = require_utils3(),\n assert = utils.assert;\n function PresetCurve(options) {\n options.type === \"short\"\n ? (this.curve = new curve.short(options))\n : options.type === \"edwards\"\n ? (this.curve = new curve.edwards(options))\n : (this.curve = new curve.mont(options)),\n (this.g = this.curve.g),\n (this.n = this.curve.n),\n (this.hash = options.hash),\n assert(this.g.validate(), \"Invalid curve\"),\n assert(this.g.mul(this.n).isInfinity(), \"Invalid curve, G*N != O\");\n }\n curves.PresetCurve = PresetCurve;\n function defineCurve(name, options) {\n Object.defineProperty(curves, name, {\n configurable: !0,\n enumerable: !0,\n get: function () {\n var curve2 = new PresetCurve(options);\n return (\n Object.defineProperty(curves, name, {\n configurable: !0,\n enumerable: !0,\n value: curve2,\n }),\n curve2\n );\n },\n });\n }\n defineCurve(\"p192\", {\n type: \"short\",\n prime: \"p192\",\n p: \"ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff\",\n a: \"ffffffff ffffffff ffffffff fffffffe ffffffff fffffffc\",\n b: \"64210519 e59c80e7 0fa7e9ab 72243049 feb8deec c146b9b1\",\n n: \"ffffffff ffffffff ffffffff 99def836 146bc9b1 b4d22831\",\n hash: hash.sha256,\n gRed: !1,\n g: [\n \"188da80e b03090f6 7cbf20eb 43a18800 f4ff0afd 82ff1012\",\n \"07192b95 ffc8da78 631011ed 6b24cdd5 73f977a1 1e794811\",\n ],\n });\n defineCurve(\"p224\", {\n type: \"short\",\n prime: \"p224\",\n p: \"ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001\",\n a: \"ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff fffffffe\",\n b: \"b4050a85 0c04b3ab f5413256 5044b0b7 d7bfd8ba 270b3943 2355ffb4\",\n n: \"ffffffff ffffffff ffffffff ffff16a2 e0b8f03e 13dd2945 5c5c2a3d\",\n hash: hash.sha256,\n gRed: !1,\n g: [\n \"b70e0cbd 6bb4bf7f 321390b9 4a03c1d3 56c21122 343280d6 115c1d21\",\n \"bd376388 b5f723fb 4c22dfe6 cd4375a0 5a074764 44d58199 85007e34\",\n ],\n });\n defineCurve(\"p256\", {\n type: \"short\",\n prime: null,\n p: \"ffffffff 00000001 00000000 00000000 00000000 ffffffff ffffffff ffffffff\",\n a: \"ffffffff 00000001 00000000 00000000 00000000 ffffffff ffffffff fffffffc\",\n b: \"5ac635d8 aa3a93e7 b3ebbd55 769886bc 651d06b0 cc53b0f6 3bce3c3e 27d2604b\",\n n: \"ffffffff 00000000 ffffffff ffffffff bce6faad a7179e84 f3b9cac2 fc632551\",\n hash: hash.sha256,\n gRed: !1,\n g: [\n \"6b17d1f2 e12c4247 f8bce6e5 63a440f2 77037d81 2deb33a0 f4a13945 d898c296\",\n \"4fe342e2 fe1a7f9b 8ee7eb4a 7c0f9e16 2bce3357 6b315ece cbb64068 37bf51f5\",\n ],\n });\n defineCurve(\"p384\", {\n type: \"short\",\n prime: null,\n p: \"ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe ffffffff 00000000 00000000 ffffffff\",\n a: \"ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe ffffffff 00000000 00000000 fffffffc\",\n b: \"b3312fa7 e23ee7e4 988e056b e3f82d19 181d9c6e fe814112 0314088f 5013875a c656398d 8a2ed19d 2a85c8ed d3ec2aef\",\n n: \"ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff c7634d81 f4372ddf 581a0db2 48b0a77a ecec196a ccc52973\",\n hash: hash.sha384,\n gRed: !1,\n g: [\n \"aa87ca22 be8b0537 8eb1c71e f320ad74 6e1d3b62 8ba79b98 59f741e0 82542a38 5502f25d bf55296c 3a545e38 72760ab7\",\n \"3617de4a 96262c6f 5d9e98bf 9292dc29 f8f41dbd 289a147c e9da3113 b5f0b8c0 0a60b1ce 1d7e819d 7a431d7c 90ea0e5f\",\n ],\n });\n defineCurve(\"p521\", {\n type: \"short\",\n prime: null,\n p: \"000001ff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff\",\n a: \"000001ff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffc\",\n b: \"00000051 953eb961 8e1c9a1f 929a21a0 b68540ee a2da725b 99b315f3 b8b48991 8ef109e1 56193951 ec7e937b 1652c0bd 3bb1bf07 3573df88 3d2c34f1 ef451fd4 6b503f00\",\n n: \"000001ff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffa 51868783 bf2f966b 7fcc0148 f709a5d0 3bb5c9b8 899c47ae bb6fb71e 91386409\",\n hash: hash.sha512,\n gRed: !1,\n g: [\n \"000000c6 858e06b7 0404e9cd 9e3ecb66 2395b442 9c648139 053fb521 f828af60 6b4d3dba a14b5e77 efe75928 fe1dc127 a2ffa8de 3348b3c1 856a429b f97e7e31 c2e5bd66\",\n \"00000118 39296a78 9a3bc004 5c8a5fb4 2c7d1bd9 98f54449 579b4468 17afbd17 273e662c 97ee7299 5ef42640 c550b901 3fad0761 353c7086 a272c240 88be9476 9fd16650\",\n ],\n });\n defineCurve(\"curve25519\", {\n type: \"mont\",\n prime: \"p25519\",\n p: \"7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed\",\n a: \"76d06\",\n b: \"1\",\n n: \"1000000000000000 0000000000000000 14def9dea2f79cd6 5812631a5cf5d3ed\",\n hash: hash.sha256,\n gRed: !1,\n g: [\"9\"],\n });\n defineCurve(\"ed25519\", {\n type: \"edwards\",\n prime: \"p25519\",\n p: \"7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed\",\n a: \"-1\",\n c: \"1\",\n d: \"52036cee2b6ffe73 8cc740797779e898 00700a4d4141d8ab 75eb4dca135978a3\",\n n: \"1000000000000000 0000000000000000 14def9dea2f79cd6 5812631a5cf5d3ed\",\n hash: hash.sha256,\n gRed: !1,\n g: [\n \"216936d3cd6e53fec0a4e231fdd6dc5c692cc7609525a7b2c9562d608f25d51a\",\n \"6666666666666666666666666666666666666666666666666666666666666658\",\n ],\n });\n var pre;\n try {\n pre = require_secp256k1();\n } catch {\n pre = void 0;\n }\n defineCurve(\"secp256k1\", {\n type: \"short\",\n prime: \"k256\",\n p: \"ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f\",\n a: \"0\",\n b: \"7\",\n n: \"ffffffff ffffffff ffffffff fffffffe baaedce6 af48a03b bfd25e8c d0364141\",\n h: \"1\",\n hash: hash.sha256,\n beta: \"7ae96a2b657c07106e64479eac3434e99cf0497512f58995c1396c28719501ee\",\n lambda: \"5363ad4cc05c30e0a5261c028812645a122e22ea20816678df02967c1b23bd72\",\n basis: [\n {\n a: \"3086d221a7d46bcde86c90e49284eb15\",\n b: \"-e4437ed6010e88286f547fa90abfe4c3\",\n },\n {\n a: \"114ca50f7a8e2f3f657c1108d9d44cfd8\",\n b: \"3086d221a7d46bcde86c90e49284eb15\",\n },\n ],\n gRed: !1,\n g: [\n \"79be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798\",\n \"483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8\",\n pre,\n ],\n });\n },\n});\n\n// node_modules/hmac-drbg/lib/hmac-drbg.js\nvar require_hmac_drbg = __commonJS({\n \"node_modules/hmac-drbg/lib/hmac-drbg.js\"(exports, module) {\n \"use strict\";\n var hash = require_hash2(),\n utils = require_utils2(),\n assert = require_minimalistic_assert();\n function HmacDRBG(options) {\n if (!(this instanceof HmacDRBG)) return new HmacDRBG(options);\n (this.hash = options.hash),\n (this.predResist = !!options.predResist),\n (this.outLen = this.hash.outSize),\n (this.minEntropy = options.minEntropy || this.hash.hmacStrength),\n (this._reseed = null),\n (this.reseedInterval = null),\n (this.K = null),\n (this.V = null);\n var entropy = utils.toArray(options.entropy, options.entropyEnc || \"hex\"),\n nonce = utils.toArray(options.nonce, options.nonceEnc || \"hex\"),\n pers = utils.toArray(options.pers, options.persEnc || \"hex\");\n assert(entropy.length >= this.minEntropy / 8, \"Not enough entropy. Minimum is: \" + this.minEntropy + \" bits\"),\n this._init(entropy, nonce, pers);\n }\n module.exports = HmacDRBG;\n HmacDRBG.prototype._init = function (entropy, nonce, pers) {\n var seed = entropy.concat(nonce).concat(pers);\n (this.K = new Array(this.outLen / 8)), (this.V = new Array(this.outLen / 8));\n for (var i = 0; i < this.V.length; i++) (this.K[i] = 0), (this.V[i] = 1);\n this._update(seed), (this._reseed = 1), (this.reseedInterval = 281474976710656);\n };\n HmacDRBG.prototype._hmac = function () {\n return new hash.hmac(this.hash, this.K);\n };\n HmacDRBG.prototype._update = function (seed) {\n var kmac = this._hmac().update(this.V).update([0]);\n seed && (kmac = kmac.update(seed)),\n (this.K = kmac.digest()),\n (this.V = this._hmac().update(this.V).digest()),\n seed &&\n ((this.K = this._hmac().update(this.V).update([1]).update(seed).digest()),\n (this.V = this._hmac().update(this.V).digest()));\n };\n HmacDRBG.prototype.reseed = function (entropy, entropyEnc, add, addEnc) {\n typeof entropyEnc != \"string\" && ((addEnc = add), (add = entropyEnc), (entropyEnc = null)),\n (entropy = utils.toArray(entropy, entropyEnc)),\n (add = utils.toArray(add, addEnc)),\n assert(entropy.length >= this.minEntropy / 8, \"Not enough entropy. Minimum is: \" + this.minEntropy + \" bits\"),\n this._update(entropy.concat(add || [])),\n (this._reseed = 1);\n };\n HmacDRBG.prototype.generate = function (len, enc, add, addEnc) {\n if (this._reseed > this.reseedInterval) throw new Error(\"Reseed is required\");\n typeof enc != \"string\" && ((addEnc = add), (add = enc), (enc = null)),\n add && ((add = utils.toArray(add, addEnc || \"hex\")), this._update(add));\n for (var temp = []; temp.length < len; )\n (this.V = this._hmac().update(this.V).digest()), (temp = temp.concat(this.V));\n var res = temp.slice(0, len);\n return this._update(add), this._reseed++, utils.encode(res, enc);\n };\n },\n});\n\n// node_modules/elliptic/lib/elliptic/ec/key.js\nvar require_key = __commonJS({\n \"node_modules/elliptic/lib/elliptic/ec/key.js\"(exports, module) {\n \"use strict\";\n var BN = require_bn4(),\n utils = require_utils3(),\n assert = utils.assert;\n function KeyPair(ec, options) {\n (this.ec = ec),\n (this.priv = null),\n (this.pub = null),\n options.priv && this._importPrivate(options.priv, options.privEnc),\n options.pub && this._importPublic(options.pub, options.pubEnc);\n }\n module.exports = KeyPair;\n KeyPair.fromPublic = function (ec, pub, enc) {\n return pub instanceof KeyPair\n ? pub\n : new KeyPair(ec, {\n pub,\n pubEnc: enc,\n });\n };\n KeyPair.fromPrivate = function (ec, priv, enc) {\n return priv instanceof KeyPair\n ? priv\n : new KeyPair(ec, {\n priv,\n privEnc: enc,\n });\n };\n KeyPair.prototype.validate = function () {\n var pub = this.getPublic();\n return pub.isInfinity()\n ? { result: !1, reason: \"Invalid public key\" }\n : pub.validate()\n ? pub.mul(this.ec.curve.n).isInfinity()\n ? { result: !0, reason: null }\n : { result: !1, reason: \"Public key * N != O\" }\n : { result: !1, reason: \"Public key is not a point\" };\n };\n KeyPair.prototype.getPublic = function (compact, enc) {\n return (\n typeof compact == \"string\" && ((enc = compact), (compact = null)),\n this.pub || (this.pub = this.ec.g.mul(this.priv)),\n enc ? this.pub.encode(enc, compact) : this.pub\n );\n };\n KeyPair.prototype.getPrivate = function (enc) {\n return enc === \"hex\" ? this.priv.toString(16, 2) : this.priv;\n };\n KeyPair.prototype._importPrivate = function (key, enc) {\n (this.priv = new BN(key, enc || 16)), (this.priv = this.priv.umod(this.ec.curve.n));\n };\n KeyPair.prototype._importPublic = function (key, enc) {\n if (key.x || key.y) {\n this.ec.curve.type === \"mont\"\n ? assert(key.x, \"Need x coordinate\")\n : (this.ec.curve.type === \"short\" || this.ec.curve.type === \"edwards\") &&\n assert(key.x && key.y, \"Need both x and y coordinate\"),\n (this.pub = this.ec.curve.point(key.x, key.y));\n return;\n }\n this.pub = this.ec.curve.decodePoint(key, enc);\n };\n KeyPair.prototype.derive = function (pub) {\n return pub.validate() || assert(pub.validate(), \"public point not validated\"), pub.mul(this.priv).getX();\n };\n KeyPair.prototype.sign = function (msg, enc, options) {\n return this.ec.sign(msg, this, enc, options);\n };\n KeyPair.prototype.verify = function (msg, signature) {\n return this.ec.verify(msg, signature, this);\n };\n KeyPair.prototype.inspect = function () {\n return (\n \"<Key priv: \" + (this.priv && this.priv.toString(16, 2)) + \" pub: \" + (this.pub && this.pub.inspect()) + \" >\"\n );\n };\n },\n});\n\n// node_modules/elliptic/lib/elliptic/ec/signature.js\nvar require_signature = __commonJS({\n \"node_modules/elliptic/lib/elliptic/ec/signature.js\"(exports, module) {\n \"use strict\";\n var BN = require_bn4(),\n utils = require_utils3(),\n assert = utils.assert;\n function Signature(options, enc) {\n if (options instanceof Signature) return options;\n this._importDER(options, enc) ||\n (assert(options.r && options.s, \"Signature without r or s\"),\n (this.r = new BN(options.r, 16)),\n (this.s = new BN(options.s, 16)),\n options.recoveryParam === void 0 ? (this.recoveryParam = null) : (this.recoveryParam = options.recoveryParam));\n }\n module.exports = Signature;\n function Position() {\n this.place = 0;\n }\n function getLength(buf, p) {\n var initial = buf[p.place++];\n if (!(initial & 128)) return initial;\n var octetLen = initial & 15;\n if (octetLen === 0 || octetLen > 4) return !1;\n for (var val = 0, i = 0, off = p.place; i < octetLen; i++, off++) (val <<= 8), (val |= buf[off]), (val >>>= 0);\n return val <= 127 ? !1 : ((p.place = off), val);\n }\n function rmPadding(buf) {\n for (var i = 0, len = buf.length - 1; !buf[i] && !(buf[i + 1] & 128) && i < len; ) i++;\n return i === 0 ? buf : buf.slice(i);\n }\n Signature.prototype._importDER = function (data, enc) {\n data = utils.toArray(data, enc);\n var p = new Position();\n if (data[p.place++] !== 48) return !1;\n var len = getLength(data, p);\n if (len === !1 || len + p.place !== data.length || data[p.place++] !== 2) return !1;\n var rlen = getLength(data, p);\n if (rlen === !1) return !1;\n var r = data.slice(p.place, rlen + p.place);\n if (((p.place += rlen), data[p.place++] !== 2)) return !1;\n var slen = getLength(data, p);\n if (slen === !1 || data.length !== slen + p.place) return !1;\n var s = data.slice(p.place, slen + p.place);\n if (r[0] === 0)\n if (r[1] & 128) r = r.slice(1);\n else return !1;\n if (s[0] === 0)\n if (s[1] & 128) s = s.slice(1);\n else return !1;\n return (this.r = new BN(r)), (this.s = new BN(s)), (this.recoveryParam = null), !0;\n };\n function constructLength(arr, len) {\n if (len < 128) {\n arr.push(len);\n return;\n }\n var octets = 1 + ((Math.log(len) / Math.LN2) >>> 3);\n for (arr.push(octets | 128); --octets; ) arr.push((len >>> (octets << 3)) & 255);\n arr.push(len);\n }\n Signature.prototype.toDER = function (enc) {\n var r = this.r.toArray(),\n s = this.s.toArray();\n for (\n r[0] & 128 && (r = [0].concat(r)), s[0] & 128 && (s = [0].concat(s)), r = rmPadding(r), s = rmPadding(s);\n !s[0] && !(s[1] & 128);\n\n )\n s = s.slice(1);\n var arr = [2];\n constructLength(arr, r.length), (arr = arr.concat(r)), arr.push(2), constructLength(arr, s.length);\n var backHalf = arr.concat(s),\n res = [48];\n return constructLength(res, backHalf.length), (res = res.concat(backHalf)), utils.encode(res, enc);\n };\n },\n});\n\n// node_modules/elliptic/lib/elliptic/ec/index.js\nvar require_ec = __commonJS({\n \"node_modules/elliptic/lib/elliptic/ec/index.js\"(exports, module) {\n \"use strict\";\n var BN = require_bn4(),\n HmacDRBG = require_hmac_drbg(),\n utils = require_utils3(),\n curves = require_curves(),\n rand = require_brorand(),\n assert = utils.assert,\n KeyPair = require_key(),\n Signature = require_signature();\n function EC(options) {\n if (!(this instanceof EC)) return new EC(options);\n typeof options == \"string\" &&\n (assert(Object.prototype.hasOwnProperty.call(curves, options), \"Unknown curve \" + options),\n (options = curves[options])),\n options instanceof curves.PresetCurve && (options = { curve: options }),\n (this.curve = options.curve.curve),\n (this.n = this.curve.n),\n (this.nh = this.n.ushrn(1)),\n (this.g = this.curve.g),\n (this.g = options.curve.g),\n this.g.precompute(options.curve.n.bitLength() + 1),\n (this.hash = options.hash || options.curve.hash);\n }\n module.exports = EC;\n EC.prototype.keyPair = function (options) {\n return new KeyPair(this, options);\n };\n EC.prototype.keyFromPrivate = function (priv, enc) {\n return KeyPair.fromPrivate(this, priv, enc);\n };\n EC.prototype.keyFromPublic = function (pub, enc) {\n return KeyPair.fromPublic(this, pub, enc);\n };\n EC.prototype.genKeyPair = function (options) {\n options || (options = {});\n for (\n var drbg = new HmacDRBG({\n hash: this.hash,\n pers: options.pers,\n persEnc: options.persEnc || \"utf8\",\n entropy: options.entropy || rand(this.hash.hmacStrength),\n entropyEnc: (options.entropy && options.entropyEnc) || \"utf8\",\n nonce: this.n.toArray(),\n }),\n bytes = this.n.byteLength(),\n ns2 = this.n.sub(new BN(2));\n ;\n\n ) {\n var priv = new BN(drbg.generate(bytes));\n if (!(priv.cmp(ns2) > 0)) return priv.iaddn(1), this.keyFromPrivate(priv);\n }\n };\n EC.prototype._truncateToN = function (msg, truncOnly) {\n var delta = msg.byteLength() * 8 - this.n.bitLength();\n return delta > 0 && (msg = msg.ushrn(delta)), !truncOnly && msg.cmp(this.n) >= 0 ? msg.sub(this.n) : msg;\n };\n EC.prototype.sign = function (msg, key, enc, options) {\n typeof enc == \"object\" && ((options = enc), (enc = null)),\n options || (options = {}),\n (key = this.keyFromPrivate(key, enc)),\n (msg = this._truncateToN(new BN(msg, 16)));\n for (\n var bytes = this.n.byteLength(),\n bkey = key.getPrivate().toArray(\"be\", bytes),\n nonce = msg.toArray(\"be\", bytes),\n drbg = new HmacDRBG({\n hash: this.hash,\n entropy: bkey,\n nonce,\n pers: options.pers,\n persEnc: options.persEnc || \"utf8\",\n }),\n ns1 = this.n.sub(new BN(1)),\n iter = 0;\n ;\n iter++\n ) {\n var k = options.k ? options.k(iter) : new BN(drbg.generate(this.n.byteLength()));\n if (((k = this._truncateToN(k, !0)), !(k.cmpn(1) <= 0 || k.cmp(ns1) >= 0))) {\n var kp = this.g.mul(k);\n if (!kp.isInfinity()) {\n var kpX = kp.getX(),\n r = kpX.umod(this.n);\n if (r.cmpn(0) !== 0) {\n var s = k.invm(this.n).mul(r.mul(key.getPrivate()).iadd(msg));\n if (((s = s.umod(this.n)), s.cmpn(0) !== 0)) {\n var recoveryParam = (kp.getY().isOdd() ? 1 : 0) | (kpX.cmp(r) !== 0 ? 2 : 0);\n return (\n options.canonical && s.cmp(this.nh) > 0 && ((s = this.n.sub(s)), (recoveryParam ^= 1)),\n new Signature({ r, s, recoveryParam })\n );\n }\n }\n }\n }\n }\n };\n EC.prototype.verify = function (msg, signature, key, enc) {\n (msg = this._truncateToN(new BN(msg, 16))),\n (key = this.keyFromPublic(key, enc)),\n (signature = new Signature(signature, \"hex\"));\n var r = signature.r,\n s = signature.s;\n if (r.cmpn(1) < 0 || r.cmp(this.n) >= 0 || s.cmpn(1) < 0 || s.cmp(this.n) >= 0) return !1;\n var sinv = s.invm(this.n),\n u1 = sinv.mul(msg).umod(this.n),\n u2 = sinv.mul(r).umod(this.n),\n p;\n return this.curve._maxwellTrick\n ? ((p = this.g.jmulAdd(u1, key.getPublic(), u2)), p.isInfinity() ? !1 : p.eqXToP(r))\n : ((p = this.g.mulAdd(u1, key.getPublic(), u2)), p.isInfinity() ? !1 : p.getX().umod(this.n).cmp(r) === 0);\n };\n EC.prototype.recoverPubKey = function (msg, signature, j, enc) {\n assert((3 & j) === j, \"The recovery param is more than two bits\"), (signature = new Signature(signature, enc));\n var n = this.n,\n e = new BN(msg),\n r = signature.r,\n s = signature.s,\n isYOdd = j & 1,\n isSecondKey = j >> 1;\n if (r.cmp(this.curve.p.umod(this.curve.n)) >= 0 && isSecondKey)\n throw new Error(\"Unable to find sencond key candinate\");\n isSecondKey ? (r = this.curve.pointFromX(r.add(this.curve.n), isYOdd)) : (r = this.curve.pointFromX(r, isYOdd));\n var rInv = signature.r.invm(n),\n s1 = n.sub(e).mul(rInv).umod(n),\n s2 = s.mul(rInv).umod(n);\n return this.g.mulAdd(s1, r, s2);\n };\n EC.prototype.getKeyRecoveryParam = function (e, signature, Q, enc) {\n if (((signature = new Signature(signature, enc)), signature.recoveryParam !== null))\n return signature.recoveryParam;\n for (var i = 0; i < 4; i++) {\n var Qprime;\n try {\n Qprime = this.recoverPubKey(e, signature, i);\n } catch {\n continue;\n }\n if (Qprime.eq(Q)) return i;\n }\n throw new Error(\"Unable to find valid recovery factor\");\n };\n },\n});\n\n// node_modules/elliptic/lib/elliptic/eddsa/key.js\nvar require_key2 = __commonJS({\n \"node_modules/elliptic/lib/elliptic/eddsa/key.js\"(exports, module) {\n \"use strict\";\n var utils = require_utils3(),\n assert = utils.assert,\n parseBytes = utils.parseBytes,\n cachedProperty = utils.cachedProperty;\n function KeyPair(eddsa, params) {\n (this.eddsa = eddsa),\n (this._secret = parseBytes(params.secret)),\n eddsa.isPoint(params.pub) ? (this._pub = params.pub) : (this._pubBytes = parseBytes(params.pub));\n }\n KeyPair.fromPublic = function (eddsa, pub) {\n return pub instanceof KeyPair ? pub : new KeyPair(eddsa, { pub });\n };\n KeyPair.fromSecret = function (eddsa, secret) {\n return secret instanceof KeyPair ? secret : new KeyPair(eddsa, { secret });\n };\n KeyPair.prototype.secret = function () {\n return this._secret;\n };\n cachedProperty(KeyPair, \"pubBytes\", function () {\n return this.eddsa.encodePoint(this.pub());\n });\n cachedProperty(KeyPair, \"pub\", function () {\n return this._pubBytes ? this.eddsa.decodePoint(this._pubBytes) : this.eddsa.g.mul(this.priv());\n });\n cachedProperty(KeyPair, \"privBytes\", function () {\n var eddsa = this.eddsa,\n hash = this.hash(),\n lastIx = eddsa.encodingLength - 1,\n a = hash.slice(0, eddsa.encodingLength);\n return (a[0] &= 248), (a[lastIx] &= 127), (a[lastIx] |= 64), a;\n });\n cachedProperty(KeyPair, \"priv\", function () {\n return this.eddsa.decodeInt(this.privBytes());\n });\n cachedProperty(KeyPair, \"hash\", function () {\n return this.eddsa.hash().update(this.secret()).digest();\n });\n cachedProperty(KeyPair, \"messagePrefix\", function () {\n return this.hash().slice(this.eddsa.encodingLength);\n });\n KeyPair.prototype.sign = function (message) {\n return assert(this._secret, \"KeyPair can only verify\"), this.eddsa.sign(message, this);\n };\n KeyPair.prototype.verify = function (message, sig) {\n return this.eddsa.verify(message, sig, this);\n };\n KeyPair.prototype.getSecret = function (enc) {\n return assert(this._secret, \"KeyPair is public only\"), utils.encode(this.secret(), enc);\n };\n KeyPair.prototype.getPublic = function (enc) {\n return utils.encode(this.pubBytes(), enc);\n };\n module.exports = KeyPair;\n },\n});\n\n// node_modules/elliptic/lib/elliptic/eddsa/signature.js\nvar require_signature2 = __commonJS({\n \"node_modules/elliptic/lib/elliptic/eddsa/signature.js\"(exports, module) {\n \"use strict\";\n var BN = require_bn4(),\n utils = require_utils3(),\n assert = utils.assert,\n cachedProperty = utils.cachedProperty,\n parseBytes = utils.parseBytes;\n function Signature(eddsa, sig) {\n (this.eddsa = eddsa),\n typeof sig != \"object\" && (sig = parseBytes(sig)),\n Array.isArray(sig) &&\n (sig = {\n R: sig.slice(0, eddsa.encodingLength),\n S: sig.slice(eddsa.encodingLength),\n }),\n assert(sig.R && sig.S, \"Signature without R or S\"),\n eddsa.isPoint(sig.R) && (this._R = sig.R),\n sig.S instanceof BN && (this._S = sig.S),\n (this._Rencoded = Array.isArray(sig.R) ? sig.R : sig.Rencoded),\n (this._Sencoded = Array.isArray(sig.S) ? sig.S : sig.Sencoded);\n }\n cachedProperty(Signature, \"S\", function () {\n return this.eddsa.decodeInt(this.Sencoded());\n });\n cachedProperty(Signature, \"R\", function () {\n return this.eddsa.decodePoint(this.Rencoded());\n });\n cachedProperty(Signature, \"Rencoded\", function () {\n return this.eddsa.encodePoint(this.R());\n });\n cachedProperty(Signature, \"Sencoded\", function () {\n return this.eddsa.encodeInt(this.S());\n });\n Signature.prototype.toBytes = function () {\n return this.Rencoded().concat(this.Sencoded());\n };\n Signature.prototype.toHex = function () {\n return utils.encode(this.toBytes(), \"hex\").toUpperCase();\n };\n module.exports = Signature;\n },\n});\n\n// node_modules/elliptic/lib/elliptic/eddsa/index.js\nvar require_eddsa = __commonJS({\n \"node_modules/elliptic/lib/elliptic/eddsa/index.js\"(exports, module) {\n \"use strict\";\n var hash = require_hash2(),\n curves = require_curves(),\n utils = require_utils3(),\n assert = utils.assert,\n parseBytes = utils.parseBytes,\n KeyPair = require_key2(),\n Signature = require_signature2();\n function EDDSA(curve) {\n if ((assert(curve === \"ed25519\", \"only tested with ed25519 so far\"), !(this instanceof EDDSA)))\n return new EDDSA(curve);\n (curve = curves[curve].curve),\n (this.curve = curve),\n (this.g = curve.g),\n this.g.precompute(curve.n.bitLength() + 1),\n (this.pointClass = curve.point().constructor),\n (this.encodingLength = Math.ceil(curve.n.bitLength() / 8)),\n (this.hash = hash.sha512);\n }\n module.exports = EDDSA;\n EDDSA.prototype.sign = function (message, secret) {\n message = parseBytes(message);\n var key = this.keyFromSecret(secret),\n r = this.hashInt(key.messagePrefix(), message),\n R = this.g.mul(r),\n Rencoded = this.encodePoint(R),\n s_ = this.hashInt(Rencoded, key.pubBytes(), message).mul(key.priv()),\n S = r.add(s_).umod(this.curve.n);\n return this.makeSignature({ R, S, Rencoded });\n };\n EDDSA.prototype.verify = function (message, sig, pub) {\n (message = parseBytes(message)), (sig = this.makeSignature(sig));\n var key = this.keyFromPublic(pub),\n h = this.hashInt(sig.Rencoded(), key.pubBytes(), message),\n SG = this.g.mul(sig.S()),\n RplusAh = sig.R().add(key.pub().mul(h));\n return RplusAh.eq(SG);\n };\n EDDSA.prototype.hashInt = function () {\n for (var hash2 = this.hash(), i = 0; i < arguments.length; i++) hash2.update(arguments[i]);\n return utils.intFromLE(hash2.digest()).umod(this.curve.n);\n };\n EDDSA.prototype.keyFromPublic = function (pub) {\n return KeyPair.fromPublic(this, pub);\n };\n EDDSA.prototype.keyFromSecret = function (secret) {\n return KeyPair.fromSecret(this, secret);\n };\n EDDSA.prototype.makeSignature = function (sig) {\n return sig instanceof Signature ? sig : new Signature(this, sig);\n };\n EDDSA.prototype.encodePoint = function (point) {\n var enc = point.getY().toArray(\"le\", this.encodingLength);\n return (enc[this.encodingLength - 1] |= point.getX().isOdd() ? 128 : 0), enc;\n };\n EDDSA.prototype.decodePoint = function (bytes) {\n bytes = utils.parseBytes(bytes);\n var lastIx = bytes.length - 1,\n normed = bytes.slice(0, lastIx).concat(bytes[lastIx] & -129),\n xIsOdd = (bytes[lastIx] & 128) !== 0,\n y = utils.intFromLE(normed);\n return this.curve.pointFromY(y, xIsOdd);\n };\n EDDSA.prototype.encodeInt = function (num) {\n return num.toArray(\"le\", this.encodingLength);\n };\n EDDSA.prototype.decodeInt = function (bytes) {\n return utils.intFromLE(bytes);\n };\n EDDSA.prototype.isPoint = function (val) {\n return val instanceof this.pointClass;\n };\n },\n});\n\n// node_modules/elliptic/lib/elliptic.js\nvar require_elliptic = __commonJS({\n \"node_modules/elliptic/lib/elliptic.js\"(exports) {\n \"use strict\";\n var elliptic = exports;\n elliptic.version = require_package().version;\n elliptic.utils = require_utils3();\n elliptic.rand = require_brorand();\n elliptic.curve = require_curve();\n elliptic.curves = require_curves();\n elliptic.ec = require_ec();\n elliptic.eddsa = require_eddsa();\n },\n});\n\n// node_modules/asn1.js/node_modules/bn.js/lib/bn.js\nvar require_bn5 = __commonJS({\n \"node_modules/asn1.js/node_modules/bn.js/lib/bn.js\"(exports, module) {\n (function (module2, exports2) {\n \"use strict\";\n function assert(val, msg) {\n if (!val) throw new Error(msg || \"Assertion failed\");\n }\n function inherits(ctor, superCtor) {\n ctor.super_ = superCtor;\n var TempCtor = function () {};\n (TempCtor.prototype = superCtor.prototype),\n (ctor.prototype = new TempCtor()),\n (ctor.prototype.constructor = ctor);\n }\n function BN(number, base, endian) {\n if (BN.isBN(number)) return number;\n (this.negative = 0),\n (this.words = null),\n (this.length = 0),\n (this.red = null),\n number !== null &&\n ((base === \"le\" || base === \"be\") && ((endian = base), (base = 10)),\n this._init(number || 0, base || 10, endian || \"be\"));\n }\n typeof module2 == \"object\" ? (module2.exports = BN) : (exports2.BN = BN), (BN.BN = BN), (BN.wordSize = 26);\n var Buffer2;\n try {\n typeof window < \"u\" && typeof window.Buffer < \"u\"\n ? (Buffer2 = window.Buffer)\n : (Buffer2 = __require(\"buffer\").Buffer);\n } catch {}\n (BN.isBN = function (num) {\n return num instanceof BN\n ? !0\n : num !== null &&\n typeof num == \"object\" &&\n num.constructor.wordSize === BN.wordSize &&\n Array.isArray(num.words);\n }),\n (BN.max = function (left, right) {\n return left.cmp(right) > 0 ? left : right;\n }),\n (BN.min = function (left, right) {\n return left.cmp(right) < 0 ? left : right;\n }),\n (BN.prototype._init = function (number, base, endian) {\n if (typeof number == \"number\") return this._initNumber(number, base, endian);\n if (typeof number == \"object\") return this._initArray(number, base, endian);\n base === \"hex\" && (base = 16),\n assert(base === (base | 0) && base >= 2 && base <= 36),\n (number = number.toString().replace(/\\s+/g, \"\"));\n var start = 0;\n number[0] === \"-\" && (start++, (this.negative = 1)),\n start < number.length &&\n (base === 16\n ? this._parseHex(number, start, endian)\n : (this._parseBase(number, base, start),\n endian === \"le\" && this._initArray(this.toArray(), base, endian)));\n }),\n (BN.prototype._initNumber = function (number, base, endian) {\n number < 0 && ((this.negative = 1), (number = -number)),\n number < 67108864\n ? ((this.words = [number & 67108863]), (this.length = 1))\n : number < 4503599627370496\n ? ((this.words = [number & 67108863, (number / 67108864) & 67108863]), (this.length = 2))\n : (assert(number < 9007199254740992),\n (this.words = [number & 67108863, (number / 67108864) & 67108863, 1]),\n (this.length = 3)),\n endian === \"le\" && this._initArray(this.toArray(), base, endian);\n }),\n (BN.prototype._initArray = function (number, base, endian) {\n if ((assert(typeof number.length == \"number\"), number.length <= 0))\n return (this.words = [0]), (this.length = 1), this;\n (this.length = Math.ceil(number.length / 3)), (this.words = new Array(this.length));\n for (var i = 0; i < this.length; i++) this.words[i] = 0;\n var j,\n w,\n off = 0;\n if (endian === \"be\")\n for (i = number.length - 1, j = 0; i >= 0; i -= 3)\n (w = number[i] | (number[i - 1] << 8) | (number[i - 2] << 16)),\n (this.words[j] |= (w << off) & 67108863),\n (this.words[j + 1] = (w >>> (26 - off)) & 67108863),\n (off += 24),\n off >= 26 && ((off -= 26), j++);\n else if (endian === \"le\")\n for (i = 0, j = 0; i < number.length; i += 3)\n (w = number[i] | (number[i + 1] << 8) | (number[i + 2] << 16)),\n (this.words[j] |= (w << off) & 67108863),\n (this.words[j + 1] = (w >>> (26 - off)) & 67108863),\n (off += 24),\n off >= 26 && ((off -= 26), j++);\n return this.strip();\n });\n function parseHex4Bits(string, index) {\n var c = string.charCodeAt(index);\n return c >= 65 && c <= 70 ? c - 55 : c >= 97 && c <= 102 ? c - 87 : (c - 48) & 15;\n }\n function parseHexByte(string, lowerBound, index) {\n var r = parseHex4Bits(string, index);\n return index - 1 >= lowerBound && (r |= parseHex4Bits(string, index - 1) << 4), r;\n }\n BN.prototype._parseHex = function (number, start, endian) {\n (this.length = Math.ceil((number.length - start) / 6)), (this.words = new Array(this.length));\n for (var i = 0; i < this.length; i++) this.words[i] = 0;\n var off = 0,\n j = 0,\n w;\n if (endian === \"be\")\n for (i = number.length - 1; i >= start; i -= 2)\n (w = parseHexByte(number, start, i) << off),\n (this.words[j] |= w & 67108863),\n off >= 18 ? ((off -= 18), (j += 1), (this.words[j] |= w >>> 26)) : (off += 8);\n else {\n var parseLength = number.length - start;\n for (i = parseLength % 2 === 0 ? start + 1 : start; i < number.length; i += 2)\n (w = parseHexByte(number, start, i) << off),\n (this.words[j] |= w & 67108863),\n off >= 18 ? ((off -= 18), (j += 1), (this.words[j] |= w >>> 26)) : (off += 8);\n }\n this.strip();\n };\n function parseBase(str, start, end, mul) {\n for (var r = 0, len = Math.min(str.length, end), i = start; i < len; i++) {\n var c = str.charCodeAt(i) - 48;\n (r *= mul), c >= 49 ? (r += c - 49 + 10) : c >= 17 ? (r += c - 17 + 10) : (r += c);\n }\n return r;\n }\n (BN.prototype._parseBase = function (number, base, start) {\n (this.words = [0]), (this.length = 1);\n for (var limbLen = 0, limbPow = 1; limbPow <= 67108863; limbPow *= base) limbLen++;\n limbLen--, (limbPow = (limbPow / base) | 0);\n for (\n var total = number.length - start,\n mod = total % limbLen,\n end = Math.min(total, total - mod) + start,\n word = 0,\n i = start;\n i < end;\n i += limbLen\n )\n (word = parseBase(number, i, i + limbLen, base)),\n this.imuln(limbPow),\n this.words[0] + word < 67108864 ? (this.words[0] += word) : this._iaddn(word);\n if (mod !== 0) {\n var pow = 1;\n for (word = parseBase(number, i, number.length, base), i = 0; i < mod; i++) pow *= base;\n this.imuln(pow), this.words[0] + word < 67108864 ? (this.words[0] += word) : this._iaddn(word);\n }\n this.strip();\n }),\n (BN.prototype.copy = function (dest) {\n dest.words = new Array(this.length);\n for (var i = 0; i < this.length; i++) dest.words[i] = this.words[i];\n (dest.length = this.length), (dest.negative = this.negative), (dest.red = this.red);\n }),\n (BN.prototype.clone = function () {\n var r = new BN(null);\n return this.copy(r), r;\n }),\n (BN.prototype._expand = function (size) {\n for (; this.length < size; ) this.words[this.length++] = 0;\n return this;\n }),\n (BN.prototype.strip = function () {\n for (; this.length > 1 && this.words[this.length - 1] === 0; ) this.length--;\n return this._normSign();\n }),\n (BN.prototype._normSign = function () {\n return this.length === 1 && this.words[0] === 0 && (this.negative = 0), this;\n }),\n (BN.prototype.inspect = function () {\n return (this.red ? \"<BN-R: \" : \"<BN: \") + this.toString(16) + \">\";\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 groupSizes = [\n 0, 0, 25, 16, 12, 11, 10, 9, 8, 8, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5,\n 5, 5,\n ],\n groupBases = [\n 0, 0, 33554432, 43046721, 16777216, 48828125, 60466176, 40353607, 16777216, 43046721, 1e7, 19487171, 35831808,\n 62748517, 7529536, 11390625, 16777216, 24137569, 34012224, 47045881, 64e6, 4084101, 5153632, 6436343, 7962624,\n 9765625, 11881376, 14348907, 17210368, 20511149, 243e5, 28629151, 33554432, 39135393, 45435424, 52521875,\n 60466176,\n ];\n (BN.prototype.toString = function (base, padding) {\n (base = base || 10), (padding = padding | 0 || 1);\n var out;\n if (base === 16 || base === \"hex\") {\n out = \"\";\n for (var off = 0, carry = 0, i = 0; i < this.length; i++) {\n var w = this.words[i],\n word = (((w << off) | carry) & 16777215).toString(16);\n (carry = (w >>> (24 - off)) & 16777215),\n carry !== 0 || i !== this.length - 1 ? (out = zeros[6 - word.length] + word + out) : (out = word + out),\n (off += 2),\n off >= 26 && ((off -= 26), i--);\n }\n for (carry !== 0 && (out = carry.toString(16) + out); out.length % padding !== 0; ) out = \"0\" + out;\n return this.negative !== 0 && (out = \"-\" + out), out;\n }\n if (base === (base | 0) && base >= 2 && base <= 36) {\n var groupSize = groupSizes[base],\n groupBase = groupBases[base];\n out = \"\";\n var c = this.clone();\n for (c.negative = 0; !c.isZero(); ) {\n var r = c.modn(groupBase).toString(base);\n (c = c.idivn(groupBase)), c.isZero() ? (out = r + out) : (out = zeros[groupSize - r.length] + r + out);\n }\n for (this.isZero() && (out = \"0\" + out); out.length % padding !== 0; ) out = \"0\" + out;\n return this.negative !== 0 && (out = \"-\" + out), out;\n }\n assert(!1, \"Base should be between 2 and 36\");\n }),\n (BN.prototype.toNumber = function () {\n var ret = this.words[0];\n return (\n this.length === 2\n ? (ret += this.words[1] * 67108864)\n : this.length === 3 && this.words[2] === 1\n ? (ret += 4503599627370496 + this.words[1] * 67108864)\n : this.length > 2 && assert(!1, \"Number can only safely store up to 53 bits\"),\n this.negative !== 0 ? -ret : ret\n );\n }),\n (BN.prototype.toJSON = function () {\n return this.toString(16);\n }),\n (BN.prototype.toBuffer = function (endian, length) {\n return assert(typeof Buffer2 < \"u\"), this.toArrayLike(Buffer2, endian, length);\n }),\n (BN.prototype.toArray = function (endian, length) {\n return this.toArrayLike(Array, endian, length);\n }),\n (BN.prototype.toArrayLike = function (ArrayType, endian, length) {\n var byteLength = this.byteLength(),\n 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 this.strip();\n var littleEndian = endian === \"le\",\n res = new ArrayType(reqLength),\n b,\n i,\n q = this.clone();\n if (littleEndian) {\n for (i = 0; !q.isZero(); i++) (b = q.andln(255)), q.iushrn(8), (res[i] = b);\n for (; i < reqLength; i++) res[i] = 0;\n } else {\n for (i = 0; i < reqLength - byteLength; i++) res[i] = 0;\n for (i = 0; !q.isZero(); i++) (b = q.andln(255)), q.iushrn(8), (res[reqLength - i - 1] = b);\n }\n return res;\n }),\n Math.clz32\n ? (BN.prototype._countBits = function (w) {\n return 32 - Math.clz32(w);\n })\n : (BN.prototype._countBits = function (w) {\n var t = w,\n r = 0;\n return (\n t >= 4096 && ((r += 13), (t >>>= 13)),\n t >= 64 && ((r += 7), (t >>>= 7)),\n t >= 8 && ((r += 4), (t >>>= 4)),\n t >= 2 && ((r += 2), (t >>>= 2)),\n r + t\n );\n }),\n (BN.prototype._zeroBits = function (w) {\n if (w === 0) return 26;\n var t = w,\n r = 0;\n return (\n (t & 8191) === 0 && ((r += 13), (t >>>= 13)),\n (t & 127) === 0 && ((r += 7), (t >>>= 7)),\n (t & 15) === 0 && ((r += 4), (t >>>= 4)),\n (t & 3) === 0 && ((r += 2), (t >>>= 2)),\n (t & 1) === 0 && r++,\n r\n );\n }),\n (BN.prototype.bitLength = function () {\n var w = this.words[this.length - 1],\n hi = this._countBits(w);\n return (this.length - 1) * 26 + hi;\n });\n function toBitArray(num) {\n for (var w = new Array(num.bitLength()), bit = 0; bit < w.length; bit++) {\n var off = (bit / 26) | 0,\n wbit = bit % 26;\n w[bit] = (num.words[off] & (1 << wbit)) >>> wbit;\n }\n return w;\n }\n (BN.prototype.zeroBits = function () {\n if (this.isZero()) return 0;\n for (var r = 0, i = 0; i < this.length; i++) {\n var b = this._zeroBits(this.words[i]);\n if (((r += b), b !== 26)) break;\n }\n return r;\n }),\n (BN.prototype.byteLength = function () {\n return Math.ceil(this.bitLength() / 8);\n }),\n (BN.prototype.toTwos = function (width) {\n return this.negative !== 0 ? this.abs().inotn(width).iaddn(1) : this.clone();\n }),\n (BN.prototype.fromTwos = function (width) {\n return this.testn(width - 1) ? this.notn(width).iaddn(1).ineg() : this.clone();\n }),\n (BN.prototype.isNeg = function () {\n return this.negative !== 0;\n }),\n (BN.prototype.neg = function () {\n return this.clone().ineg();\n }),\n (BN.prototype.ineg = function () {\n return this.isZero() || (this.negative ^= 1), this;\n }),\n (BN.prototype.iuor = function (num) {\n for (; this.length < num.length; ) this.words[this.length++] = 0;\n for (var i = 0; i < num.length; i++) this.words[i] = this.words[i] | num.words[i];\n return this.strip();\n }),\n (BN.prototype.ior = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuor(num);\n }),\n (BN.prototype.or = function (num) {\n return this.length > num.length ? this.clone().ior(num) : num.clone().ior(this);\n }),\n (BN.prototype.uor = function (num) {\n return this.length > num.length ? this.clone().iuor(num) : num.clone().iuor(this);\n }),\n (BN.prototype.iuand = function (num) {\n var b;\n this.length > num.length ? (b = num) : (b = this);\n for (var i = 0; i < b.length; i++) this.words[i] = this.words[i] & num.words[i];\n return (this.length = b.length), this.strip();\n }),\n (BN.prototype.iand = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuand(num);\n }),\n (BN.prototype.and = function (num) {\n return this.length > num.length ? this.clone().iand(num) : num.clone().iand(this);\n }),\n (BN.prototype.uand = function (num) {\n return this.length > num.length ? this.clone().iuand(num) : num.clone().iuand(this);\n }),\n (BN.prototype.iuxor = function (num) {\n var a, b;\n this.length > num.length ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var i = 0; i < b.length; i++) this.words[i] = a.words[i] ^ b.words[i];\n if (this !== a) for (; i < a.length; i++) this.words[i] = a.words[i];\n return (this.length = a.length), this.strip();\n }),\n (BN.prototype.ixor = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuxor(num);\n }),\n (BN.prototype.xor = function (num) {\n return this.length > num.length ? this.clone().ixor(num) : num.clone().ixor(this);\n }),\n (BN.prototype.uxor = function (num) {\n return this.length > num.length ? this.clone().iuxor(num) : num.clone().iuxor(this);\n }),\n (BN.prototype.inotn = function (width) {\n assert(typeof width == \"number\" && width >= 0);\n var bytesNeeded = Math.ceil(width / 26) | 0,\n bitsLeft = width % 26;\n this._expand(bytesNeeded), bitsLeft > 0 && bytesNeeded--;\n for (var i = 0; i < bytesNeeded; i++) this.words[i] = ~this.words[i] & 67108863;\n return bitsLeft > 0 && (this.words[i] = ~this.words[i] & (67108863 >> (26 - bitsLeft))), this.strip();\n }),\n (BN.prototype.notn = function (width) {\n return this.clone().inotn(width);\n }),\n (BN.prototype.setn = function (bit, val) {\n assert(typeof bit == \"number\" && bit >= 0);\n var off = (bit / 26) | 0,\n wbit = bit % 26;\n return (\n this._expand(off + 1),\n val\n ? (this.words[off] = this.words[off] | (1 << wbit))\n : (this.words[off] = this.words[off] & ~(1 << wbit)),\n this.strip()\n );\n }),\n (BN.prototype.iadd = function (num) {\n var r;\n if (this.negative !== 0 && num.negative === 0)\n return (this.negative = 0), (r = this.isub(num)), (this.negative ^= 1), this._normSign();\n if (this.negative === 0 && num.negative !== 0)\n return (num.negative = 0), (r = this.isub(num)), (num.negative = 1), r._normSign();\n var a, b;\n this.length > num.length ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var carry = 0, i = 0; i < b.length; i++)\n (r = (a.words[i] | 0) + (b.words[i] | 0) + carry), (this.words[i] = r & 67108863), (carry = r >>> 26);\n for (; carry !== 0 && i < a.length; i++)\n (r = (a.words[i] | 0) + carry), (this.words[i] = r & 67108863), (carry = r >>> 26);\n if (((this.length = a.length), carry !== 0)) (this.words[this.length] = carry), this.length++;\n else if (a !== this) for (; i < a.length; i++) this.words[i] = a.words[i];\n return this;\n }),\n (BN.prototype.add = function (num) {\n var res;\n return num.negative !== 0 && this.negative === 0\n ? ((num.negative = 0), (res = this.sub(num)), (num.negative ^= 1), res)\n : num.negative === 0 && this.negative !== 0\n ? ((this.negative = 0), (res = num.sub(this)), (this.negative = 1), res)\n : this.length > num.length\n ? this.clone().iadd(num)\n : num.clone().iadd(this);\n }),\n (BN.prototype.isub = function (num) {\n if (num.negative !== 0) {\n num.negative = 0;\n var r = this.iadd(num);\n return (num.negative = 1), r._normSign();\n } else if (this.negative !== 0)\n return (this.negative = 0), this.iadd(num), (this.negative = 1), this._normSign();\n var cmp = this.cmp(num);\n if (cmp === 0) return (this.negative = 0), (this.length = 1), (this.words[0] = 0), this;\n var a, b;\n cmp > 0 ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var carry = 0, i = 0; i < b.length; i++)\n (r = (a.words[i] | 0) - (b.words[i] | 0) + carry), (carry = r >> 26), (this.words[i] = r & 67108863);\n for (; carry !== 0 && i < a.length; i++)\n (r = (a.words[i] | 0) + carry), (carry = r >> 26), (this.words[i] = r & 67108863);\n if (carry === 0 && i < a.length && a !== this) for (; i < a.length; i++) this.words[i] = a.words[i];\n return (this.length = Math.max(this.length, i)), a !== this && (this.negative = 1), this.strip();\n }),\n (BN.prototype.sub = function (num) {\n return this.clone().isub(num);\n });\n function smallMulTo(self2, num, out) {\n out.negative = num.negative ^ self2.negative;\n var len = (self2.length + num.length) | 0;\n (out.length = len), (len = (len - 1) | 0);\n var a = self2.words[0] | 0,\n b = num.words[0] | 0,\n r = a * b,\n lo = r & 67108863,\n carry = (r / 67108864) | 0;\n out.words[0] = lo;\n for (var k = 1; k < len; k++) {\n for (\n var ncarry = carry >>> 26,\n rword = carry & 67108863,\n maxJ = Math.min(k, num.length - 1),\n j = Math.max(0, k - self2.length + 1);\n j <= maxJ;\n j++\n ) {\n var i = (k - j) | 0;\n (a = self2.words[i] | 0),\n (b = num.words[j] | 0),\n (r = a * b + rword),\n (ncarry += (r / 67108864) | 0),\n (rword = r & 67108863);\n }\n (out.words[k] = rword | 0), (carry = ncarry | 0);\n }\n return carry !== 0 ? (out.words[k] = carry | 0) : out.length--, out.strip();\n }\n var comb10MulTo = function (self2, num, out) {\n var a = self2.words,\n b = num.words,\n o = out.words,\n c = 0,\n lo,\n mid,\n hi,\n a0 = a[0] | 0,\n al0 = a0 & 8191,\n ah0 = a0 >>> 13,\n a1 = a[1] | 0,\n al1 = a1 & 8191,\n ah1 = a1 >>> 13,\n a2 = a[2] | 0,\n al2 = a2 & 8191,\n ah2 = a2 >>> 13,\n a3 = a[3] | 0,\n al3 = a3 & 8191,\n ah3 = a3 >>> 13,\n a4 = a[4] | 0,\n al4 = a4 & 8191,\n ah4 = a4 >>> 13,\n a5 = a[5] | 0,\n al5 = a5 & 8191,\n ah5 = a5 >>> 13,\n a6 = a[6] | 0,\n al6 = a6 & 8191,\n ah6 = a6 >>> 13,\n a7 = a[7] | 0,\n al7 = a7 & 8191,\n ah7 = a7 >>> 13,\n a8 = a[8] | 0,\n al8 = a8 & 8191,\n ah8 = a8 >>> 13,\n a9 = a[9] | 0,\n al9 = a9 & 8191,\n ah9 = a9 >>> 13,\n b0 = b[0] | 0,\n bl0 = b0 & 8191,\n bh0 = b0 >>> 13,\n b1 = b[1] | 0,\n bl1 = b1 & 8191,\n bh1 = b1 >>> 13,\n b2 = b[2] | 0,\n bl2 = b2 & 8191,\n bh2 = b2 >>> 13,\n b3 = b[3] | 0,\n bl3 = b3 & 8191,\n bh3 = b3 >>> 13,\n b4 = b[4] | 0,\n bl4 = b4 & 8191,\n bh4 = b4 >>> 13,\n b5 = b[5] | 0,\n bl5 = b5 & 8191,\n bh5 = b5 >>> 13,\n b6 = b[6] | 0,\n bl6 = b6 & 8191,\n bh6 = b6 >>> 13,\n b7 = b[7] | 0,\n bl7 = b7 & 8191,\n bh7 = b7 >>> 13,\n b8 = b[8] | 0,\n bl8 = b8 & 8191,\n bh8 = b8 >>> 13,\n b9 = b[9] | 0,\n bl9 = b9 & 8191,\n bh9 = b9 >>> 13;\n (out.negative = self2.negative ^ num.negative),\n (out.length = 19),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w0 >>> 26)) | 0),\n (w0 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w1 >>> 26)) | 0),\n (w1 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w2 >>> 26)) | 0),\n (w2 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w3 >>> 26)) | 0),\n (w3 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w4 >>> 26)) | 0),\n (w4 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w5 >>> 26)) | 0),\n (w5 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w6 >>> 26)) | 0),\n (w6 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w7 >>> 26)) | 0),\n (w7 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w8 >>> 26)) | 0),\n (w8 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w9 >>> 26)) | 0),\n (w9 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w10 >>> 26)) | 0),\n (w10 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w11 >>> 26)) | 0),\n (w11 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w12 >>> 26)) | 0),\n (w12 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w13 >>> 26)) | 0),\n (w13 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w14 >>> 26)) | 0),\n (w14 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w15 >>> 26)) | 0),\n (w15 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w16 >>> 26)) | 0),\n (w16 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w17 >>> 26)) | 0),\n (w17 &= 67108863),\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 & 8191) << 13)) | 0;\n return (\n (c = (((hi + (mid >>> 13)) | 0) + (w18 >>> 26)) | 0),\n (w18 &= 67108863),\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 c !== 0 && ((o[19] = c), out.length++),\n out\n );\n };\n Math.imul || (comb10MulTo = smallMulTo);\n function bigMulTo(self2, num, out) {\n (out.negative = num.negative ^ self2.negative), (out.length = self2.length + num.length);\n for (var carry = 0, hncarry = 0, k = 0; k < out.length - 1; k++) {\n var ncarry = hncarry;\n hncarry = 0;\n for (\n var rword = carry & 67108863, maxJ = Math.min(k, num.length - 1), j = Math.max(0, k - self2.length + 1);\n j <= maxJ;\n j++\n ) {\n var i = k - j,\n a = self2.words[i] | 0,\n b = num.words[j] | 0,\n r = a * b,\n lo = r & 67108863;\n (ncarry = (ncarry + ((r / 67108864) | 0)) | 0),\n (lo = (lo + rword) | 0),\n (rword = lo & 67108863),\n (ncarry = (ncarry + (lo >>> 26)) | 0),\n (hncarry += ncarry >>> 26),\n (ncarry &= 67108863);\n }\n (out.words[k] = rword), (carry = ncarry), (ncarry = hncarry);\n }\n return carry !== 0 ? (out.words[k] = carry) : out.length--, out.strip();\n }\n function jumboMulTo(self2, num, out) {\n var fftm = new FFTM();\n return fftm.mulp(self2, num, out);\n }\n BN.prototype.mulTo = function (num, out) {\n var res,\n len = this.length + num.length;\n return (\n this.length === 10 && num.length === 10\n ? (res = comb10MulTo(this, num, out))\n : len < 63\n ? (res = smallMulTo(this, num, out))\n : len < 1024\n ? (res = bigMulTo(this, num, out))\n : (res = jumboMulTo(this, num, out)),\n res\n );\n };\n function FFTM(x, y) {\n (this.x = x), (this.y = y);\n }\n (FFTM.prototype.makeRBT = function (N) {\n for (var t = new Array(N), l = BN.prototype._countBits(N) - 1, i = 0; i < N; i++) t[i] = this.revBin(i, l, N);\n return t;\n }),\n (FFTM.prototype.revBin = function (x, l, N) {\n if (x === 0 || x === N - 1) return x;\n for (var rb = 0, i = 0; i < l; i++) (rb |= (x & 1) << (l - i - 1)), (x >>= 1);\n return rb;\n }),\n (FFTM.prototype.permute = function (rbt, rws, iws, rtws, itws, N) {\n for (var i = 0; i < N; i++) (rtws[i] = rws[rbt[i]]), (itws[i] = iws[rbt[i]]);\n }),\n (FFTM.prototype.transform = function (rws, iws, rtws, itws, N, rbt) {\n this.permute(rbt, rws, iws, rtws, itws, N);\n for (var s = 1; s < N; s <<= 1)\n for (\n var l = s << 1, rtwdf = Math.cos((2 * Math.PI) / l), itwdf = Math.sin((2 * Math.PI) / l), p = 0;\n p < N;\n p += l\n )\n for (var rtwdf_ = rtwdf, itwdf_ = itwdf, j = 0; j < s; j++) {\n var re = rtws[p + j],\n ie = itws[p + j],\n ro = rtws[p + j + s],\n io = itws[p + j + s],\n rx = rtwdf_ * ro - itwdf_ * io;\n (io = rtwdf_ * io + itwdf_ * ro),\n (ro = rx),\n (rtws[p + j] = re + ro),\n (itws[p + j] = ie + io),\n (rtws[p + j + s] = re - ro),\n (itws[p + j + s] = ie - io),\n j !== l &&\n ((rx = rtwdf * rtwdf_ - itwdf * itwdf_), (itwdf_ = rtwdf * itwdf_ + itwdf * rtwdf_), (rtwdf_ = rx));\n }\n }),\n (FFTM.prototype.guessLen13b = function (n, m) {\n var N = Math.max(m, n) | 1,\n odd = N & 1,\n i = 0;\n for (N = (N / 2) | 0; N; N = N >>> 1) i++;\n return 1 << (i + 1 + odd);\n }),\n (FFTM.prototype.conjugate = function (rws, iws, N) {\n if (!(N <= 1))\n for (var i = 0; i < N / 2; i++) {\n var t = rws[i];\n (rws[i] = rws[N - i - 1]),\n (rws[N - i - 1] = t),\n (t = iws[i]),\n (iws[i] = -iws[N - i - 1]),\n (iws[N - i - 1] = -t);\n }\n }),\n (FFTM.prototype.normalize13b = function (ws, N) {\n for (var carry = 0, i = 0; i < N / 2; i++) {\n var w = Math.round(ws[2 * i + 1] / N) * 8192 + Math.round(ws[2 * i] / N) + carry;\n (ws[i] = w & 67108863), w < 67108864 ? (carry = 0) : (carry = (w / 67108864) | 0);\n }\n return ws;\n }),\n (FFTM.prototype.convert13b = function (ws, len, rws, N) {\n for (var carry = 0, i = 0; i < len; i++)\n (carry = carry + (ws[i] | 0)),\n (rws[2 * i] = carry & 8191),\n (carry = carry >>> 13),\n (rws[2 * i + 1] = carry & 8191),\n (carry = carry >>> 13);\n for (i = 2 * len; i < N; ++i) rws[i] = 0;\n assert(carry === 0), assert((carry & -8192) === 0);\n }),\n (FFTM.prototype.stub = function (N) {\n for (var ph = new Array(N), i = 0; i < N; i++) ph[i] = 0;\n return ph;\n }),\n (FFTM.prototype.mulp = function (x, y, out) {\n var N = 2 * this.guessLen13b(x.length, y.length),\n rbt = this.makeRBT(N),\n _ = this.stub(N),\n rws = new Array(N),\n rwst = new Array(N),\n iwst = new Array(N),\n nrws = new Array(N),\n nrwst = new Array(N),\n niwst = new Array(N),\n rmws = out.words;\n (rmws.length = N),\n this.convert13b(x.words, x.length, rws, N),\n this.convert13b(y.words, y.length, nrws, N),\n this.transform(rws, _, rwst, iwst, N, rbt),\n this.transform(nrws, _, nrwst, niwst, N, rbt);\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]), (rwst[i] = rx);\n }\n return (\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 (out.negative = x.negative ^ y.negative),\n (out.length = x.length + y.length),\n out.strip()\n );\n }),\n (BN.prototype.mul = function (num) {\n var out = new BN(null);\n return (out.words = new Array(this.length + num.length)), this.mulTo(num, out);\n }),\n (BN.prototype.mulf = function (num) {\n var out = new BN(null);\n return (out.words = new Array(this.length + num.length)), jumboMulTo(this, num, out);\n }),\n (BN.prototype.imul = function (num) {\n return this.clone().mulTo(num, this);\n }),\n (BN.prototype.imuln = function (num) {\n assert(typeof num == \"number\"), assert(num < 67108864);\n for (var carry = 0, i = 0; i < this.length; i++) {\n var w = (this.words[i] | 0) * num,\n lo = (w & 67108863) + (carry & 67108863);\n (carry >>= 26), (carry += (w / 67108864) | 0), (carry += lo >>> 26), (this.words[i] = lo & 67108863);\n }\n return carry !== 0 && ((this.words[i] = carry), this.length++), this;\n }),\n (BN.prototype.muln = function (num) {\n return this.clone().imuln(num);\n }),\n (BN.prototype.sqr = function () {\n return this.mul(this);\n }),\n (BN.prototype.isqr = function () {\n return this.imul(this.clone());\n }),\n (BN.prototype.pow = function (num) {\n var w = toBitArray(num);\n if (w.length === 0) return new BN(1);\n for (var res = this, i = 0; i < w.length && w[i] === 0; i++, res = res.sqr());\n if (++i < w.length) for (var q = res.sqr(); i < w.length; i++, q = q.sqr()) w[i] !== 0 && (res = res.mul(q));\n return res;\n }),\n (BN.prototype.iushln = function (bits) {\n assert(typeof bits == \"number\" && bits >= 0);\n var r = bits % 26,\n s = (bits - r) / 26,\n carryMask = (67108863 >>> (26 - r)) << (26 - r),\n i;\n if (r !== 0) {\n var carry = 0;\n for (i = 0; i < this.length; i++) {\n var newCarry = this.words[i] & carryMask,\n c = ((this.words[i] | 0) - newCarry) << r;\n (this.words[i] = c | carry), (carry = newCarry >>> (26 - r));\n }\n carry && ((this.words[i] = carry), this.length++);\n }\n if (s !== 0) {\n for (i = this.length - 1; i >= 0; i--) this.words[i + s] = this.words[i];\n for (i = 0; i < s; i++) this.words[i] = 0;\n this.length += s;\n }\n return this.strip();\n }),\n (BN.prototype.ishln = function (bits) {\n return assert(this.negative === 0), this.iushln(bits);\n }),\n (BN.prototype.iushrn = function (bits, hint, extended) {\n assert(typeof bits == \"number\" && bits >= 0);\n var h;\n hint ? (h = (hint - (hint % 26)) / 26) : (h = 0);\n var r = bits % 26,\n s = Math.min((bits - r) / 26, this.length),\n mask = 67108863 ^ ((67108863 >>> r) << r),\n maskedWords = extended;\n if (((h -= s), (h = Math.max(0, h)), maskedWords)) {\n for (var i = 0; i < s; i++) maskedWords.words[i] = this.words[i];\n maskedWords.length = s;\n }\n if (s !== 0)\n if (this.length > s) for (this.length -= s, i = 0; i < this.length; i++) this.words[i] = this.words[i + s];\n else (this.words[0] = 0), (this.length = 1);\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)), (carry = word & mask);\n }\n return (\n maskedWords && carry !== 0 && (maskedWords.words[maskedWords.length++] = carry),\n this.length === 0 && ((this.words[0] = 0), (this.length = 1)),\n this.strip()\n );\n }),\n (BN.prototype.ishrn = function (bits, hint, extended) {\n return assert(this.negative === 0), this.iushrn(bits, hint, extended);\n }),\n (BN.prototype.shln = function (bits) {\n return this.clone().ishln(bits);\n }),\n (BN.prototype.ushln = function (bits) {\n return this.clone().iushln(bits);\n }),\n (BN.prototype.shrn = function (bits) {\n return this.clone().ishrn(bits);\n }),\n (BN.prototype.ushrn = function (bits) {\n return this.clone().iushrn(bits);\n }),\n (BN.prototype.testn = function (bit) {\n assert(typeof bit == \"number\" && bit >= 0);\n var r = bit % 26,\n s = (bit - r) / 26,\n q = 1 << r;\n if (this.length <= s) return !1;\n var w = this.words[s];\n return !!(w & q);\n }),\n (BN.prototype.imaskn = function (bits) {\n assert(typeof bits == \"number\" && bits >= 0);\n var r = bits % 26,\n s = (bits - r) / 26;\n if ((assert(this.negative === 0, \"imaskn works only with positive numbers\"), this.length <= s)) return this;\n if ((r !== 0 && s++, (this.length = Math.min(s, this.length)), r !== 0)) {\n var mask = 67108863 ^ ((67108863 >>> r) << r);\n this.words[this.length - 1] &= mask;\n }\n return this.strip();\n }),\n (BN.prototype.maskn = function (bits) {\n return this.clone().imaskn(bits);\n }),\n (BN.prototype.iaddn = function (num) {\n return (\n assert(typeof num == \"number\"),\n assert(num < 67108864),\n num < 0\n ? this.isubn(-num)\n : this.negative !== 0\n ? this.length === 1 && (this.words[0] | 0) < num\n ? ((this.words[0] = num - (this.words[0] | 0)), (this.negative = 0), this)\n : ((this.negative = 0), this.isubn(num), (this.negative = 1), this)\n : this._iaddn(num)\n );\n }),\n (BN.prototype._iaddn = function (num) {\n this.words[0] += num;\n for (var i = 0; i < this.length && this.words[i] >= 67108864; i++)\n (this.words[i] -= 67108864), i === this.length - 1 ? (this.words[i + 1] = 1) : this.words[i + 1]++;\n return (this.length = Math.max(this.length, i + 1)), this;\n }),\n (BN.prototype.isubn = function (num) {\n if ((assert(typeof num == \"number\"), assert(num < 67108864), num < 0)) return this.iaddn(-num);\n if (this.negative !== 0) return (this.negative = 0), this.iaddn(num), (this.negative = 1), this;\n if (((this.words[0] -= num), this.length === 1 && this.words[0] < 0))\n (this.words[0] = -this.words[0]), (this.negative = 1);\n else\n for (var i = 0; i < this.length && this.words[i] < 0; i++)\n (this.words[i] += 67108864), (this.words[i + 1] -= 1);\n return this.strip();\n }),\n (BN.prototype.addn = function (num) {\n return this.clone().iaddn(num);\n }),\n (BN.prototype.subn = function (num) {\n return this.clone().isubn(num);\n }),\n (BN.prototype.iabs = function () {\n return (this.negative = 0), this;\n }),\n (BN.prototype.abs = function () {\n return this.clone().iabs();\n }),\n (BN.prototype._ishlnsubmul = function (num, mul, shift) {\n var len = num.length + shift,\n i;\n this._expand(len);\n var w,\n 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 & 67108863),\n (carry = (w >> 26) - ((right / 67108864) | 0)),\n (this.words[i + shift] = w & 67108863);\n }\n for (; i < this.length - shift; i++)\n (w = (this.words[i + shift] | 0) + carry), (carry = w >> 26), (this.words[i + shift] = w & 67108863);\n if (carry === 0) return this.strip();\n for (assert(carry === -1), carry = 0, i = 0; i < this.length; i++)\n (w = -(this.words[i] | 0) + carry), (carry = w >> 26), (this.words[i] = w & 67108863);\n return (this.negative = 1), this.strip();\n }),\n (BN.prototype._wordDiv = function (num, mode) {\n var shift = this.length - num.length,\n a = this.clone(),\n b = num,\n bhi = b.words[b.length - 1] | 0,\n bhiBits = this._countBits(bhi);\n (shift = 26 - bhiBits),\n shift !== 0 && ((b = b.ushln(shift)), a.iushln(shift), (bhi = b.words[b.length - 1] | 0));\n var m = a.length - b.length,\n q;\n if (mode !== \"mod\") {\n (q = new BN(null)), (q.length = m + 1), (q.words = new Array(q.length));\n for (var i = 0; i < q.length; i++) q.words[i] = 0;\n }\n var diff = a.clone()._ishlnsubmul(b, 1, m);\n diff.negative === 0 && ((a = diff), q && (q.words[m] = 1));\n for (var j = m - 1; j >= 0; j--) {\n var qj = (a.words[b.length + j] | 0) * 67108864 + (a.words[b.length + j - 1] | 0);\n for (qj = Math.min((qj / bhi) | 0, 67108863), a._ishlnsubmul(b, qj, j); a.negative !== 0; )\n qj--, (a.negative = 0), a._ishlnsubmul(b, 1, j), a.isZero() || (a.negative ^= 1);\n q && (q.words[j] = qj);\n }\n return (\n q && q.strip(),\n a.strip(),\n mode !== \"div\" && shift !== 0 && a.iushrn(shift),\n {\n div: q || null,\n mod: a,\n }\n );\n }),\n (BN.prototype.divmod = function (num, mode, positive) {\n if ((assert(!num.isZero()), this.isZero()))\n return {\n div: new BN(0),\n mod: new BN(0),\n };\n var div, mod, res;\n return this.negative !== 0 && num.negative === 0\n ? ((res = this.neg().divmod(num, mode)),\n mode !== \"mod\" && (div = res.div.neg()),\n mode !== \"div\" && ((mod = res.mod.neg()), positive && mod.negative !== 0 && mod.iadd(num)),\n {\n div,\n mod,\n })\n : this.negative === 0 && num.negative !== 0\n ? ((res = this.divmod(num.neg(), mode)),\n mode !== \"mod\" && (div = res.div.neg()),\n {\n div,\n mod: res.mod,\n })\n : (this.negative & num.negative) !== 0\n ? ((res = this.neg().divmod(num.neg(), mode)),\n mode !== \"div\" && ((mod = res.mod.neg()), positive && mod.negative !== 0 && mod.isub(num)),\n {\n div: res.div,\n mod,\n })\n : num.length > this.length || this.cmp(num) < 0\n ? {\n div: new BN(0),\n mod: this,\n }\n : num.length === 1\n ? mode === \"div\"\n ? {\n div: this.divn(num.words[0]),\n mod: null,\n }\n : mode === \"mod\"\n ? {\n div: null,\n mod: new BN(this.modn(num.words[0])),\n }\n : {\n div: this.divn(num.words[0]),\n mod: new BN(this.modn(num.words[0])),\n }\n : this._wordDiv(num, mode);\n }),\n (BN.prototype.div = function (num) {\n return this.divmod(num, \"div\", !1).div;\n }),\n (BN.prototype.mod = function (num) {\n return this.divmod(num, \"mod\", !1).mod;\n }),\n (BN.prototype.umod = function (num) {\n return this.divmod(num, \"mod\", !0).mod;\n }),\n (BN.prototype.divRound = function (num) {\n var dm = this.divmod(num);\n if (dm.mod.isZero()) return dm.div;\n var mod = dm.div.negative !== 0 ? dm.mod.isub(num) : dm.mod,\n half = num.ushrn(1),\n r2 = num.andln(1),\n cmp = mod.cmp(half);\n return cmp < 0 || (r2 === 1 && cmp === 0)\n ? dm.div\n : dm.div.negative !== 0\n ? dm.div.isubn(1)\n : dm.div.iaddn(1);\n }),\n (BN.prototype.modn = function (num) {\n assert(num <= 67108863);\n for (var p = (1 << 26) % num, acc = 0, i = this.length - 1; i >= 0; i--)\n acc = (p * acc + (this.words[i] | 0)) % num;\n return acc;\n }),\n (BN.prototype.idivn = function (num) {\n assert(num <= 67108863);\n for (var carry = 0, i = this.length - 1; i >= 0; i--) {\n var w = (this.words[i] | 0) + carry * 67108864;\n (this.words[i] = (w / num) | 0), (carry = w % num);\n }\n return this.strip();\n }),\n (BN.prototype.divn = function (num) {\n return this.clone().idivn(num);\n }),\n (BN.prototype.egcd = function (p) {\n assert(p.negative === 0), assert(!p.isZero());\n var x = this,\n y = p.clone();\n x.negative !== 0 ? (x = x.umod(p)) : (x = x.clone());\n for (var A = new BN(1), B = new BN(0), C = new BN(0), D = new BN(1), g = 0; x.isEven() && y.isEven(); )\n x.iushrn(1), y.iushrn(1), ++g;\n for (var yp = y.clone(), xp = x.clone(); !x.isZero(); ) {\n for (var i = 0, im = 1; (x.words[0] & im) === 0 && i < 26; ++i, im <<= 1);\n if (i > 0)\n for (x.iushrn(i); i-- > 0; )\n (A.isOdd() || B.isOdd()) && (A.iadd(yp), B.isub(xp)), A.iushrn(1), B.iushrn(1);\n for (var j = 0, jm = 1; (y.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n if (j > 0)\n for (y.iushrn(j); j-- > 0; )\n (C.isOdd() || D.isOdd()) && (C.iadd(yp), D.isub(xp)), C.iushrn(1), D.iushrn(1);\n x.cmp(y) >= 0 ? (x.isub(y), A.isub(C), B.isub(D)) : (y.isub(x), C.isub(A), D.isub(B));\n }\n return {\n a: C,\n b: D,\n gcd: y.iushln(g),\n };\n }),\n (BN.prototype._invmp = function (p) {\n assert(p.negative === 0), assert(!p.isZero());\n var a = this,\n b = p.clone();\n a.negative !== 0 ? (a = a.umod(p)) : (a = a.clone());\n for (var x1 = new BN(1), x2 = new BN(0), delta = b.clone(); 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) for (a.iushrn(i); i-- > 0; ) x1.isOdd() && x1.iadd(delta), x1.iushrn(1);\n for (var j = 0, jm = 1; (b.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n if (j > 0) for (b.iushrn(j); j-- > 0; ) x2.isOdd() && x2.iadd(delta), x2.iushrn(1);\n a.cmp(b) >= 0 ? (a.isub(b), x1.isub(x2)) : (b.isub(a), x2.isub(x1));\n }\n var res;\n return a.cmpn(1) === 0 ? (res = x1) : (res = x2), res.cmpn(0) < 0 && res.iadd(p), res;\n }),\n (BN.prototype.gcd = function (num) {\n if (this.isZero()) return num.abs();\n if (num.isZero()) return this.abs();\n var a = this.clone(),\n b = num.clone();\n (a.negative = 0), (b.negative = 0);\n for (var shift = 0; a.isEven() && b.isEven(); shift++) a.iushrn(1), b.iushrn(1);\n do {\n for (; a.isEven(); ) a.iushrn(1);\n for (; b.isEven(); ) b.iushrn(1);\n var r = a.cmp(b);\n if (r < 0) {\n var t = a;\n (a = b), (b = t);\n } else if (r === 0 || b.cmpn(1) === 0) break;\n a.isub(b);\n } while (!0);\n return b.iushln(shift);\n }),\n (BN.prototype.invm = function (num) {\n return this.egcd(num).a.umod(num);\n }),\n (BN.prototype.isEven = function () {\n return (this.words[0] & 1) === 0;\n }),\n (BN.prototype.isOdd = function () {\n return (this.words[0] & 1) === 1;\n }),\n (BN.prototype.andln = function (num) {\n return this.words[0] & num;\n }),\n (BN.prototype.bincn = function (bit) {\n assert(typeof bit == \"number\");\n var r = bit % 26,\n s = (bit - r) / 26,\n q = 1 << r;\n if (this.length <= s) return this._expand(s + 1), (this.words[s] |= q), this;\n for (var carry = q, i = s; carry !== 0 && i < this.length; i++) {\n var w = this.words[i] | 0;\n (w += carry), (carry = w >>> 26), (w &= 67108863), (this.words[i] = w);\n }\n return carry !== 0 && ((this.words[i] = carry), this.length++), this;\n }),\n (BN.prototype.isZero = function () {\n return this.length === 1 && this.words[0] === 0;\n }),\n (BN.prototype.cmpn = function (num) {\n var negative = num < 0;\n if (this.negative !== 0 && !negative) return -1;\n if (this.negative === 0 && negative) return 1;\n this.strip();\n var res;\n if (this.length > 1) res = 1;\n else {\n negative && (num = -num), assert(num <= 67108863, \"Number is too big\");\n var w = this.words[0] | 0;\n res = w === num ? 0 : w < num ? -1 : 1;\n }\n return this.negative !== 0 ? -res | 0 : res;\n }),\n (BN.prototype.cmp = function (num) {\n if (this.negative !== 0 && num.negative === 0) return -1;\n if (this.negative === 0 && num.negative !== 0) return 1;\n var res = this.ucmp(num);\n return this.negative !== 0 ? -res | 0 : res;\n }),\n (BN.prototype.ucmp = function (num) {\n if (this.length > num.length) return 1;\n if (this.length < num.length) return -1;\n for (var res = 0, i = this.length - 1; i >= 0; i--) {\n var a = this.words[i] | 0,\n b = num.words[i] | 0;\n if (a !== b) {\n a < b ? (res = -1) : a > b && (res = 1);\n break;\n }\n }\n return res;\n }),\n (BN.prototype.gtn = function (num) {\n return this.cmpn(num) === 1;\n }),\n (BN.prototype.gt = function (num) {\n return this.cmp(num) === 1;\n }),\n (BN.prototype.gten = function (num) {\n return this.cmpn(num) >= 0;\n }),\n (BN.prototype.gte = function (num) {\n return this.cmp(num) >= 0;\n }),\n (BN.prototype.ltn = function (num) {\n return this.cmpn(num) === -1;\n }),\n (BN.prototype.lt = function (num) {\n return this.cmp(num) === -1;\n }),\n (BN.prototype.lten = function (num) {\n return this.cmpn(num) <= 0;\n }),\n (BN.prototype.lte = function (num) {\n return this.cmp(num) <= 0;\n }),\n (BN.prototype.eqn = function (num) {\n return this.cmpn(num) === 0;\n }),\n (BN.prototype.eq = function (num) {\n return this.cmp(num) === 0;\n }),\n (BN.red = function (num) {\n return new Red(num);\n }),\n (BN.prototype.toRed = function (ctx) {\n return (\n assert(!this.red, \"Already a number in reduction context\"),\n assert(this.negative === 0, \"red works only with positives\"),\n ctx.convertTo(this)._forceRed(ctx)\n );\n }),\n (BN.prototype.fromRed = function () {\n return assert(this.red, \"fromRed works only with numbers in reduction context\"), this.red.convertFrom(this);\n }),\n (BN.prototype._forceRed = function (ctx) {\n return (this.red = ctx), this;\n }),\n (BN.prototype.forceRed = function (ctx) {\n return assert(!this.red, \"Already a number in reduction context\"), this._forceRed(ctx);\n }),\n (BN.prototype.redAdd = function (num) {\n return assert(this.red, \"redAdd works only with red numbers\"), this.red.add(this, num);\n }),\n (BN.prototype.redIAdd = function (num) {\n return assert(this.red, \"redIAdd works only with red numbers\"), this.red.iadd(this, num);\n }),\n (BN.prototype.redSub = function (num) {\n return assert(this.red, \"redSub works only with red numbers\"), this.red.sub(this, num);\n }),\n (BN.prototype.redISub = function (num) {\n return assert(this.red, \"redISub works only with red numbers\"), this.red.isub(this, num);\n }),\n (BN.prototype.redShl = function (num) {\n return assert(this.red, \"redShl works only with red numbers\"), this.red.shl(this, num);\n }),\n (BN.prototype.redMul = function (num) {\n return (\n assert(this.red, \"redMul works only with red numbers\"),\n this.red._verify2(this, num),\n this.red.mul(this, num)\n );\n }),\n (BN.prototype.redIMul = function (num) {\n return (\n assert(this.red, \"redMul works only with red numbers\"),\n this.red._verify2(this, num),\n this.red.imul(this, num)\n );\n }),\n (BN.prototype.redSqr = function () {\n return assert(this.red, \"redSqr works only with red numbers\"), this.red._verify1(this), this.red.sqr(this);\n }),\n (BN.prototype.redISqr = function () {\n return assert(this.red, \"redISqr works only with red numbers\"), this.red._verify1(this), this.red.isqr(this);\n }),\n (BN.prototype.redSqrt = function () {\n return assert(this.red, \"redSqrt works only with red numbers\"), this.red._verify1(this), this.red.sqrt(this);\n }),\n (BN.prototype.redInvm = function () {\n return assert(this.red, \"redInvm works only with red numbers\"), this.red._verify1(this), this.red.invm(this);\n }),\n (BN.prototype.redNeg = function () {\n return assert(this.red, \"redNeg works only with red numbers\"), this.red._verify1(this), this.red.neg(this);\n }),\n (BN.prototype.redPow = function (num) {\n return assert(this.red && !num.red, \"redPow(normalNum)\"), this.red._verify1(this), this.red.pow(this, num);\n });\n var primes = {\n k256: null,\n p224: null,\n p192: null,\n p25519: null,\n };\n function MPrime(name, p) {\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 (this.tmp = this._tmp());\n }\n (MPrime.prototype._tmp = function () {\n var tmp = new BN(null);\n return (tmp.words = new Array(Math.ceil(this.n / 13))), tmp;\n }),\n (MPrime.prototype.ireduce = function (num) {\n var r = num,\n rlen;\n do this.split(r, this.tmp), (r = this.imulK(r)), (r = r.iadd(this.tmp)), (rlen = r.bitLength());\n while (rlen > this.n);\n var cmp = rlen < this.n ? -1 : r.ucmp(this.p);\n return (\n cmp === 0\n ? ((r.words[0] = 0), (r.length = 1))\n : cmp > 0\n ? r.isub(this.p)\n : r.strip !== void 0\n ? r.strip()\n : r._strip(),\n r\n );\n }),\n (MPrime.prototype.split = function (input, out) {\n input.iushrn(this.n, 0, out);\n }),\n (MPrime.prototype.imulK = function (num) {\n return num.imul(this.k);\n });\n function K256() {\n MPrime.call(this, \"k256\", \"ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f\");\n }\n inherits(K256, MPrime),\n (K256.prototype.split = function (input, output) {\n for (var mask = 4194303, outLen = Math.min(input.length, 9), i = 0; i < outLen; i++)\n output.words[i] = input.words[i];\n if (((output.length = outLen), input.length <= 9)) {\n (input.words[0] = 0), (input.length = 1);\n return;\n }\n var prev = input.words[9];\n for (output.words[output.length++] = prev & mask, i = 10; i < input.length; i++) {\n var next = input.words[i] | 0;\n (input.words[i - 10] = ((next & mask) << 4) | (prev >>> 22)), (prev = next);\n }\n (prev >>>= 22),\n (input.words[i - 10] = prev),\n prev === 0 && input.length > 10 ? (input.length -= 10) : (input.length -= 9);\n }),\n (K256.prototype.imulK = function (num) {\n (num.words[num.length] = 0), (num.words[num.length + 1] = 0), (num.length += 2);\n for (var lo = 0, i = 0; i < num.length; i++) {\n var w = num.words[i] | 0;\n (lo += w * 977), (num.words[i] = lo & 67108863), (lo = w * 64 + ((lo / 67108864) | 0));\n }\n return (\n num.words[num.length - 1] === 0 && (num.length--, num.words[num.length - 1] === 0 && num.length--), num\n );\n });\n function P224() {\n MPrime.call(this, \"p224\", \"ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001\");\n }\n inherits(P224, MPrime);\n function P192() {\n MPrime.call(this, \"p192\", \"ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff\");\n }\n inherits(P192, MPrime);\n function P25519() {\n MPrime.call(this, \"25519\", \"7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed\");\n }\n inherits(P25519, MPrime),\n (P25519.prototype.imulK = function (num) {\n for (var carry = 0, i = 0; i < num.length; i++) {\n var hi = (num.words[i] | 0) * 19 + carry,\n lo = hi & 67108863;\n (hi >>>= 26), (num.words[i] = lo), (carry = hi);\n }\n return carry !== 0 && (num.words[num.length++] = carry), num;\n }),\n (BN._prime = function (name) {\n if (primes[name]) return primes[name];\n var prime2;\n if (name === \"k256\") prime2 = new K256();\n else if (name === \"p224\") prime2 = new P224();\n else if (name === \"p192\") prime2 = new P192();\n else if (name === \"p25519\") prime2 = new P25519();\n else throw new Error(\"Unknown prime \" + name);\n return (primes[name] = prime2), prime2;\n });\n function Red(m) {\n if (typeof m == \"string\") {\n var prime = BN._prime(m);\n (this.m = prime.p), (this.prime = prime);\n } else assert(m.gtn(1), \"modulus must be greater than 1\"), (this.m = m), (this.prime = null);\n }\n (Red.prototype._verify1 = function (a) {\n assert(a.negative === 0, \"red works only with positives\"), assert(a.red, \"red works only with red numbers\");\n }),\n (Red.prototype._verify2 = function (a, b) {\n assert((a.negative | b.negative) === 0, \"red works only with positives\"),\n assert(a.red && a.red === b.red, \"red works only with red numbers\");\n }),\n (Red.prototype.imod = function (a) {\n return this.prime ? this.prime.ireduce(a)._forceRed(this) : a.umod(this.m)._forceRed(this);\n }),\n (Red.prototype.neg = function (a) {\n return a.isZero() ? a.clone() : this.m.sub(a)._forceRed(this);\n }),\n (Red.prototype.add = function (a, b) {\n this._verify2(a, b);\n var res = a.add(b);\n return res.cmp(this.m) >= 0 && res.isub(this.m), res._forceRed(this);\n }),\n (Red.prototype.iadd = function (a, b) {\n this._verify2(a, b);\n var res = a.iadd(b);\n return res.cmp(this.m) >= 0 && res.isub(this.m), res;\n }),\n (Red.prototype.sub = function (a, b) {\n this._verify2(a, b);\n var res = a.sub(b);\n return res.cmpn(0) < 0 && res.iadd(this.m), res._forceRed(this);\n }),\n (Red.prototype.isub = function (a, b) {\n this._verify2(a, b);\n var res = a.isub(b);\n return res.cmpn(0) < 0 && res.iadd(this.m), res;\n }),\n (Red.prototype.shl = function (a, num) {\n return this._verify1(a), this.imod(a.ushln(num));\n }),\n (Red.prototype.imul = function (a, b) {\n return this._verify2(a, b), this.imod(a.imul(b));\n }),\n (Red.prototype.mul = function (a, b) {\n return this._verify2(a, b), this.imod(a.mul(b));\n }),\n (Red.prototype.isqr = function (a) {\n return this.imul(a, a.clone());\n }),\n (Red.prototype.sqr = function (a) {\n return this.mul(a, a);\n }),\n (Red.prototype.sqrt = function (a) {\n if (a.isZero()) return a.clone();\n var mod3 = this.m.andln(3);\n if ((assert(mod3 % 2 === 1), mod3 === 3)) {\n var pow = this.m.add(new BN(1)).iushrn(2);\n return this.pow(a, pow);\n }\n for (var q = this.m.subn(1), s = 0; !q.isZero() && q.andln(1) === 0; ) s++, q.iushrn(1);\n assert(!q.isZero());\n var one = new BN(1).toRed(this),\n nOne = one.redNeg(),\n lpow = this.m.subn(1).iushrn(1),\n z = this.m.bitLength();\n for (z = new BN(2 * z * z).toRed(this); this.pow(z, lpow).cmp(nOne) !== 0; ) z.redIAdd(nOne);\n for (\n var c = this.pow(z, q), r = this.pow(a, q.addn(1).iushrn(1)), t = this.pow(a, q), m = s;\n t.cmp(one) !== 0;\n\n ) {\n for (var tmp = t, i = 0; tmp.cmp(one) !== 0; i++) tmp = tmp.redSqr();\n assert(i < m);\n var b = this.pow(c, new BN(1).iushln(m - i - 1));\n (r = r.redMul(b)), (c = b.redSqr()), (t = t.redMul(c)), (m = i);\n }\n return r;\n }),\n (Red.prototype.invm = function (a) {\n var inv = a._invmp(this.m);\n return inv.negative !== 0 ? ((inv.negative = 0), this.imod(inv).redNeg()) : this.imod(inv);\n }),\n (Red.prototype.pow = function (a, num) {\n if (num.isZero()) return new BN(1).toRed(this);\n if (num.cmpn(1) === 0) return a.clone();\n var windowSize = 4,\n wnd = new Array(1 << windowSize);\n (wnd[0] = new BN(1).toRed(this)), (wnd[1] = a);\n for (var i = 2; i < wnd.length; i++) wnd[i] = this.mul(wnd[i - 1], a);\n var res = wnd[0],\n current = 0,\n currentLen = 0,\n start = num.bitLength() % 26;\n for (start === 0 && (start = 26), i = num.length - 1; i >= 0; i--) {\n for (var word = num.words[i], j = start - 1; j >= 0; j--) {\n var bit = (word >> j) & 1;\n if ((res !== wnd[0] && (res = this.sqr(res)), bit === 0 && current === 0)) {\n currentLen = 0;\n continue;\n }\n (current <<= 1),\n (current |= bit),\n currentLen++,\n !(currentLen !== windowSize && (i !== 0 || j !== 0)) &&\n ((res = this.mul(res, wnd[current])), (currentLen = 0), (current = 0));\n }\n start = 26;\n }\n return res;\n }),\n (Red.prototype.convertTo = function (num) {\n var r = num.umod(this.m);\n return r === num ? r.clone() : r;\n }),\n (Red.prototype.convertFrom = function (num) {\n var res = num.clone();\n return (res.red = null), res;\n }),\n (BN.mont = function (num) {\n return new Mont(num);\n });\n function Mont(m) {\n Red.call(this, m),\n (this.shift = this.m.bitLength()),\n this.shift % 26 !== 0 && (this.shift += 26 - (this.shift % 26)),\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 (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 (Mont.prototype.convertTo = function (num) {\n return this.imod(num.ushln(this.shift));\n }),\n (Mont.prototype.convertFrom = function (num) {\n var r = this.imod(num.mul(this.rinv));\n return (r.red = null), r;\n }),\n (Mont.prototype.imul = function (a, b) {\n if (a.isZero() || b.isZero()) return (a.words[0] = 0), (a.length = 1), a;\n var t = a.imul(b),\n c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m),\n u = t.isub(c).iushrn(this.shift),\n res = u;\n return (\n u.cmp(this.m) >= 0 ? (res = u.isub(this.m)) : u.cmpn(0) < 0 && (res = u.iadd(this.m)), res._forceRed(this)\n );\n }),\n (Mont.prototype.mul = function (a, b) {\n if (a.isZero() || b.isZero()) return new BN(0)._forceRed(this);\n var t = a.mul(b),\n c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m),\n u = t.isub(c).iushrn(this.shift),\n res = u;\n return (\n u.cmp(this.m) >= 0 ? (res = u.isub(this.m)) : u.cmpn(0) < 0 && (res = u.iadd(this.m)), res._forceRed(this)\n );\n }),\n (Mont.prototype.invm = function (a) {\n var res = this.imod(a._invmp(this.m).mul(this.r2));\n return res._forceRed(this);\n });\n })(typeof module > \"u\" || module, exports);\n },\n});\n\n// node_modules/safer-buffer/safer.js\nvar require_safer = __commonJS({\n \"node_modules/safer-buffer/safer.js\"(exports, module) {\n \"use strict\";\n var buffer = __require(\"buffer\"),\n Buffer2 = buffer.Buffer,\n safer = {},\n key;\n for (key in buffer)\n !buffer.hasOwnProperty(key) || key === \"SlowBuffer\" || key === \"Buffer\" || (safer[key] = buffer[key]);\n var Safer = (safer.Buffer = {});\n for (key in Buffer2)\n !Buffer2.hasOwnProperty(key) || key === \"allocUnsafe\" || key === \"allocUnsafeSlow\" || (Safer[key] = Buffer2[key]);\n safer.Buffer.prototype = Buffer2.prototype;\n (!Safer.from || Safer.from === Uint8Array.from) &&\n (Safer.from = function (value, encodingOrOffset, length) {\n if (typeof value == \"number\")\n throw new TypeError('The \"value\" argument must not be of type number. Received type ' + typeof value);\n if (value && typeof value.length > \"u\")\n throw new TypeError(\n \"The first argument must be one of type string, Buffer, ArrayBuffer, Array, or Array-like Object. Received type \" +\n typeof value,\n );\n return Buffer2(value, encodingOrOffset, length);\n });\n Safer.alloc ||\n (Safer.alloc = function (size, fill, encoding) {\n if (typeof size != \"number\")\n throw new TypeError('The \"size\" argument must be of type number. Received type ' + typeof size);\n if (size < 0 || size >= 2 * (1 << 30))\n throw new RangeError('The value \"' + size + '\" is invalid for option \"size\"');\n var buf = Buffer2(size);\n return (\n !fill || fill.length === 0\n ? buf.fill(0)\n : typeof encoding == \"string\"\n ? buf.fill(fill, encoding)\n : buf.fill(fill),\n buf\n );\n });\n if (!safer.kStringMaxLength)\n try {\n safer.kStringMaxLength = MAX_STRING_LENGTH;\n } catch {}\n safer.constants ||\n ((safer.constants = {\n MAX_LENGTH: safer.kMaxLength,\n }),\n safer.kStringMaxLength && (safer.constants.MAX_STRING_LENGTH = safer.kStringMaxLength));\n module.exports = safer;\n },\n});\n\n// node_modules/asn1.js/lib/asn1/base/reporter.js\nvar require_reporter = __commonJS({\n \"node_modules/asn1.js/lib/asn1/base/reporter.js\"(exports) {\n \"use strict\";\n var inherits = require_inherits_browser();\n function Reporter(options) {\n this._reporterState = {\n obj: null,\n path: [],\n options: options || {},\n errors: [],\n };\n }\n exports.Reporter = Reporter;\n Reporter.prototype.isError = function (obj) {\n return obj instanceof ReporterError;\n };\n Reporter.prototype.save = function () {\n let state = this._reporterState;\n return { obj: state.obj, pathLen: state.path.length };\n };\n Reporter.prototype.restore = function (data) {\n let state = this._reporterState;\n (state.obj = data.obj), (state.path = state.path.slice(0, data.pathLen));\n };\n Reporter.prototype.enterKey = function (key) {\n return this._reporterState.path.push(key);\n };\n Reporter.prototype.exitKey = function (index) {\n let state = this._reporterState;\n state.path = state.path.slice(0, index - 1);\n };\n Reporter.prototype.leaveKey = function (index, key, value) {\n let state = this._reporterState;\n this.exitKey(index), state.obj !== null && (state.obj[key] = value);\n };\n Reporter.prototype.path = function () {\n return this._reporterState.path.join(\"/\");\n };\n Reporter.prototype.enterObject = function () {\n let state = this._reporterState,\n prev = state.obj;\n return (state.obj = {}), prev;\n };\n Reporter.prototype.leaveObject = function (prev) {\n let state = this._reporterState,\n now = state.obj;\n return (state.obj = prev), now;\n };\n Reporter.prototype.error = function (msg) {\n let err,\n state = this._reporterState,\n inherited = msg instanceof ReporterError;\n if (\n (inherited\n ? (err = msg)\n : (err = new ReporterError(\n state.path\n .map(function (elem) {\n return \"[\" + JSON.stringify(elem) + \"]\";\n })\n .join(\"\"),\n msg.message || msg,\n msg.stack,\n )),\n !state.options.partial)\n )\n throw err;\n return inherited || state.errors.push(err), err;\n };\n Reporter.prototype.wrapResult = function (result) {\n let state = this._reporterState;\n return state.options.partial\n ? {\n result: this.isError(result) ? null : result,\n errors: state.errors,\n }\n : result;\n };\n function ReporterError(path, msg) {\n (this.path = path), this.rethrow(msg);\n }\n inherits(ReporterError, Error);\n ReporterError.prototype.rethrow = function (msg) {\n if (\n ((this.message = msg + \" at: \" + (this.path || \"(shallow)\")),\n Error.captureStackTrace && Error.captureStackTrace(this, ReporterError),\n !this.stack)\n )\n try {\n throw new Error(this.message);\n } catch (e) {\n this.stack = e.stack;\n }\n return this;\n };\n },\n});\n\n// node_modules/asn1.js/lib/asn1/base/buffer.js\nvar require_buffer = __commonJS({\n \"node_modules/asn1.js/lib/asn1/base/buffer.js\"(exports) {\n \"use strict\";\n var inherits = require_inherits_browser(),\n Reporter = require_reporter().Reporter,\n Buffer2 = require_safer().Buffer;\n function DecoderBuffer(base, options) {\n if ((Reporter.call(this, options), !Buffer2.isBuffer(base))) {\n this.error(\"Input not Buffer\");\n return;\n }\n (this.base = base), (this.offset = 0), (this.length = base.length);\n }\n inherits(DecoderBuffer, Reporter);\n exports.DecoderBuffer = DecoderBuffer;\n DecoderBuffer.isDecoderBuffer = function (data) {\n return data instanceof DecoderBuffer\n ? !0\n : typeof data == \"object\" &&\n Buffer2.isBuffer(data.base) &&\n data.constructor.name === \"DecoderBuffer\" &&\n typeof data.offset == \"number\" &&\n typeof data.length == \"number\" &&\n typeof data.save == \"function\" &&\n typeof data.restore == \"function\" &&\n typeof data.isEmpty == \"function\" &&\n typeof data.readUInt8 == \"function\" &&\n typeof data.skip == \"function\" &&\n typeof data.raw == \"function\";\n };\n DecoderBuffer.prototype.save = function () {\n return {\n offset: this.offset,\n reporter: Reporter.prototype.save.call(this),\n };\n };\n DecoderBuffer.prototype.restore = function (save) {\n let res = new DecoderBuffer(this.base);\n return (\n (res.offset = save.offset),\n (res.length = this.offset),\n (this.offset = save.offset),\n Reporter.prototype.restore.call(this, save.reporter),\n res\n );\n };\n DecoderBuffer.prototype.isEmpty = function () {\n return this.offset === this.length;\n };\n DecoderBuffer.prototype.readUInt8 = function (fail) {\n return this.offset + 1 <= this.length\n ? this.base.readUInt8(this.offset++, !0)\n : this.error(fail || \"DecoderBuffer overrun\");\n };\n DecoderBuffer.prototype.skip = function (bytes, fail) {\n if (!(this.offset + bytes <= this.length)) return this.error(fail || \"DecoderBuffer overrun\");\n let res = new DecoderBuffer(this.base);\n return (\n (res._reporterState = this._reporterState),\n (res.offset = this.offset),\n (res.length = this.offset + bytes),\n (this.offset += bytes),\n res\n );\n };\n DecoderBuffer.prototype.raw = function (save) {\n return this.base.slice(save ? save.offset : this.offset, this.length);\n };\n function EncoderBuffer(value, reporter) {\n if (Array.isArray(value))\n (this.length = 0),\n (this.value = value.map(function (item) {\n return (\n EncoderBuffer.isEncoderBuffer(item) || (item = new EncoderBuffer(item, reporter)),\n (this.length += item.length),\n item\n );\n }, this));\n else if (typeof value == \"number\") {\n if (!(0 <= value && value <= 255)) return reporter.error(\"non-byte EncoderBuffer value\");\n (this.value = value), (this.length = 1);\n } else if (typeof value == \"string\") (this.value = value), (this.length = Buffer2.byteLength(value));\n else if (Buffer2.isBuffer(value)) (this.value = value), (this.length = value.length);\n else return reporter.error(\"Unsupported type: \" + typeof value);\n }\n exports.EncoderBuffer = EncoderBuffer;\n EncoderBuffer.isEncoderBuffer = function (data) {\n return data instanceof EncoderBuffer\n ? !0\n : typeof data == \"object\" &&\n data.constructor.name === \"EncoderBuffer\" &&\n typeof data.length == \"number\" &&\n typeof data.join == \"function\";\n };\n EncoderBuffer.prototype.join = function (out, offset) {\n return (\n out || (out = Buffer2.alloc(this.length)),\n offset || (offset = 0),\n this.length === 0 ||\n (Array.isArray(this.value)\n ? this.value.forEach(function (item) {\n item.join(out, offset), (offset += item.length);\n })\n : (typeof this.value == \"number\"\n ? (out[offset] = this.value)\n : typeof this.value == \"string\"\n ? out.write(this.value, offset)\n : Buffer2.isBuffer(this.value) && this.value.copy(out, offset),\n (offset += this.length))),\n out\n );\n };\n },\n});\n\n// node_modules/asn1.js/lib/asn1/base/node.js\nvar require_node = __commonJS({\n \"node_modules/asn1.js/lib/asn1/base/node.js\"(exports, module) {\n \"use strict\";\n var Reporter = require_reporter().Reporter,\n EncoderBuffer = require_buffer().EncoderBuffer,\n DecoderBuffer = require_buffer().DecoderBuffer,\n assert = require_minimalistic_assert(),\n tags = [\n \"seq\",\n \"seqof\",\n \"set\",\n \"setof\",\n \"objid\",\n \"bool\",\n \"gentime\",\n \"utctime\",\n \"null_\",\n \"enum\",\n \"int\",\n \"objDesc\",\n \"bitstr\",\n \"bmpstr\",\n \"charstr\",\n \"genstr\",\n \"graphstr\",\n \"ia5str\",\n \"iso646str\",\n \"numstr\",\n \"octstr\",\n \"printstr\",\n \"t61str\",\n \"unistr\",\n \"utf8str\",\n \"videostr\",\n ],\n methods = [\"key\", \"obj\", \"use\", \"optional\", \"explicit\", \"implicit\", \"def\", \"choice\", \"any\", \"contains\"].concat(\n tags,\n ),\n overrided = [\n \"_peekTag\",\n \"_decodeTag\",\n \"_use\",\n \"_decodeStr\",\n \"_decodeObjid\",\n \"_decodeTime\",\n \"_decodeNull\",\n \"_decodeInt\",\n \"_decodeBool\",\n \"_decodeList\",\n \"_encodeComposite\",\n \"_encodeStr\",\n \"_encodeObjid\",\n \"_encodeTime\",\n \"_encodeNull\",\n \"_encodeInt\",\n \"_encodeBool\",\n ];\n function Node(enc, parent, name) {\n let state = {};\n (this._baseState = state),\n (state.name = name),\n (state.enc = enc),\n (state.parent = parent || null),\n (state.children = null),\n (state.tag = null),\n (state.args = null),\n (state.reverseArgs = null),\n (state.choice = null),\n (state.optional = !1),\n (state.any = !1),\n (state.obj = !1),\n (state.use = null),\n (state.useDecoder = null),\n (state.key = null),\n (state.default = null),\n (state.explicit = null),\n (state.implicit = null),\n (state.contains = null),\n state.parent || ((state.children = []), this._wrap());\n }\n module.exports = Node;\n var stateProps = [\n \"enc\",\n \"parent\",\n \"children\",\n \"tag\",\n \"args\",\n \"reverseArgs\",\n \"choice\",\n \"optional\",\n \"any\",\n \"obj\",\n \"use\",\n \"alteredUse\",\n \"key\",\n \"default\",\n \"explicit\",\n \"implicit\",\n \"contains\",\n ];\n Node.prototype.clone = function () {\n let state = this._baseState,\n cstate = {};\n stateProps.forEach(function (prop) {\n cstate[prop] = state[prop];\n });\n let res = new this.constructor(cstate.parent);\n return (res._baseState = cstate), res;\n };\n Node.prototype._wrap = function () {\n let state = this._baseState;\n methods.forEach(function (method) {\n this[method] = function () {\n let clone = new this.constructor(this);\n return state.children.push(clone), clone[method].apply(clone, arguments);\n };\n }, this);\n };\n Node.prototype._init = function (body) {\n let state = this._baseState;\n assert(state.parent === null),\n body.call(this),\n (state.children = state.children.filter(function (child) {\n return child._baseState.parent === this;\n }, this)),\n assert.equal(state.children.length, 1, \"Root node can have only one child\");\n };\n Node.prototype._useArgs = function (args) {\n let state = this._baseState,\n children = args.filter(function (arg) {\n return arg instanceof this.constructor;\n }, this);\n (args = args.filter(function (arg) {\n return !(arg instanceof this.constructor);\n }, this)),\n children.length !== 0 &&\n (assert(state.children === null),\n (state.children = children),\n children.forEach(function (child) {\n child._baseState.parent = this;\n }, this)),\n args.length !== 0 &&\n (assert(state.args === null),\n (state.args = args),\n (state.reverseArgs = args.map(function (arg) {\n if (typeof arg != \"object\" || arg.constructor !== Object) return arg;\n let res = {};\n return (\n Object.keys(arg).forEach(function (key) {\n key == (key | 0) && (key |= 0);\n let value = arg[key];\n res[value] = key;\n }),\n res\n );\n })));\n };\n overrided.forEach(function (method) {\n Node.prototype[method] = function () {\n let state = this._baseState;\n throw new Error(method + \" not implemented for encoding: \" + state.enc);\n };\n });\n tags.forEach(function (tag) {\n Node.prototype[tag] = function () {\n let state = this._baseState,\n args = Array.prototype.slice.call(arguments);\n return assert(state.tag === null), (state.tag = tag), this._useArgs(args), this;\n };\n });\n Node.prototype.use = function (item) {\n assert(item);\n let state = this._baseState;\n return assert(state.use === null), (state.use = item), this;\n };\n Node.prototype.optional = function () {\n let state = this._baseState;\n return (state.optional = !0), this;\n };\n Node.prototype.def = function (val) {\n let state = this._baseState;\n return assert(state.default === null), (state.default = val), (state.optional = !0), this;\n };\n Node.prototype.explicit = function (num) {\n let state = this._baseState;\n return assert(state.explicit === null && state.implicit === null), (state.explicit = num), this;\n };\n Node.prototype.implicit = function (num) {\n let state = this._baseState;\n return assert(state.explicit === null && state.implicit === null), (state.implicit = num), this;\n };\n Node.prototype.obj = function () {\n let state = this._baseState,\n args = Array.prototype.slice.call(arguments);\n return (state.obj = !0), args.length !== 0 && this._useArgs(args), this;\n };\n Node.prototype.key = function (newKey) {\n let state = this._baseState;\n return assert(state.key === null), (state.key = newKey), this;\n };\n Node.prototype.any = function () {\n let state = this._baseState;\n return (state.any = !0), this;\n };\n Node.prototype.choice = function (obj) {\n let state = this._baseState;\n return (\n assert(state.choice === null),\n (state.choice = obj),\n this._useArgs(\n Object.keys(obj).map(function (key) {\n return obj[key];\n }),\n ),\n this\n );\n };\n Node.prototype.contains = function (item) {\n let state = this._baseState;\n return assert(state.use === null), (state.contains = item), this;\n };\n Node.prototype._decode = function (input, options) {\n let state = this._baseState;\n if (state.parent === null) return input.wrapResult(state.children[0]._decode(input, options));\n let result = state.default,\n present = !0,\n prevKey = null;\n if ((state.key !== null && (prevKey = input.enterKey(state.key)), state.optional)) {\n let tag = null;\n if (\n (state.explicit !== null\n ? (tag = state.explicit)\n : state.implicit !== null\n ? (tag = state.implicit)\n : state.tag !== null && (tag = state.tag),\n tag === null && !state.any)\n ) {\n let save = input.save();\n try {\n state.choice === null ? this._decodeGeneric(state.tag, input, options) : this._decodeChoice(input, options),\n (present = !0);\n } catch {\n present = !1;\n }\n input.restore(save);\n } else if (((present = this._peekTag(input, tag, state.any)), input.isError(present))) return present;\n }\n let prevObj;\n if ((state.obj && present && (prevObj = input.enterObject()), present)) {\n if (state.explicit !== null) {\n let explicit = this._decodeTag(input, state.explicit);\n if (input.isError(explicit)) return explicit;\n input = explicit;\n }\n let start = input.offset;\n if (state.use === null && state.choice === null) {\n let save;\n state.any && (save = input.save());\n let body = this._decodeTag(input, state.implicit !== null ? state.implicit : state.tag, state.any);\n if (input.isError(body)) return body;\n state.any ? (result = input.raw(save)) : (input = body);\n }\n if (\n (options && options.track && state.tag !== null && options.track(input.path(), start, input.length, \"tagged\"),\n options &&\n options.track &&\n state.tag !== null &&\n options.track(input.path(), input.offset, input.length, \"content\"),\n state.any ||\n (state.choice === null\n ? (result = this._decodeGeneric(state.tag, input, options))\n : (result = this._decodeChoice(input, options))),\n input.isError(result))\n )\n return result;\n if (\n (!state.any &&\n state.choice === null &&\n state.children !== null &&\n state.children.forEach(function (child) {\n child._decode(input, options);\n }),\n state.contains && (state.tag === \"octstr\" || state.tag === \"bitstr\"))\n ) {\n let data = new DecoderBuffer(result);\n result = this._getUse(state.contains, input._reporterState.obj)._decode(data, options);\n }\n }\n return (\n state.obj && present && (result = input.leaveObject(prevObj)),\n state.key !== null && (result !== null || present === !0)\n ? input.leaveKey(prevKey, state.key, result)\n : prevKey !== null && input.exitKey(prevKey),\n result\n );\n };\n Node.prototype._decodeGeneric = function (tag, input, options) {\n let state = this._baseState;\n return tag === \"seq\" || tag === \"set\"\n ? null\n : tag === \"seqof\" || tag === \"setof\"\n ? this._decodeList(input, tag, state.args[0], options)\n : /str$/.test(tag)\n ? this._decodeStr(input, tag, options)\n : tag === \"objid\" && state.args\n ? this._decodeObjid(input, state.args[0], state.args[1], options)\n : tag === \"objid\"\n ? this._decodeObjid(input, null, null, options)\n : tag === \"gentime\" || tag === \"utctime\"\n ? this._decodeTime(input, tag, options)\n : tag === \"null_\"\n ? this._decodeNull(input, options)\n : tag === \"bool\"\n ? this._decodeBool(input, options)\n : tag === \"objDesc\"\n ? this._decodeStr(input, tag, options)\n : tag === \"int\" || tag === \"enum\"\n ? this._decodeInt(input, state.args && state.args[0], options)\n : state.use !== null\n ? this._getUse(state.use, input._reporterState.obj)._decode(input, options)\n : input.error(\"unknown tag: \" + tag);\n };\n Node.prototype._getUse = function (entity, obj) {\n let state = this._baseState;\n return (\n (state.useDecoder = this._use(entity, obj)),\n assert(state.useDecoder._baseState.parent === null),\n (state.useDecoder = state.useDecoder._baseState.children[0]),\n state.implicit !== state.useDecoder._baseState.implicit &&\n ((state.useDecoder = state.useDecoder.clone()), (state.useDecoder._baseState.implicit = state.implicit)),\n state.useDecoder\n );\n };\n Node.prototype._decodeChoice = function (input, options) {\n let state = this._baseState,\n result = null,\n match = !1;\n return (\n Object.keys(state.choice).some(function (key) {\n let save = input.save(),\n node = state.choice[key];\n try {\n let value = node._decode(input, options);\n if (input.isError(value)) return !1;\n (result = { type: key, value }), (match = !0);\n } catch {\n return input.restore(save), !1;\n }\n return !0;\n }, this),\n match ? result : input.error(\"Choice not matched\")\n );\n };\n Node.prototype._createEncoderBuffer = function (data) {\n return new EncoderBuffer(data, this.reporter);\n };\n Node.prototype._encode = function (data, reporter, parent) {\n let state = this._baseState;\n if (state.default !== null && state.default === data) return;\n let result = this._encodeValue(data, reporter, parent);\n if (result !== void 0 && !this._skipDefault(result, reporter, parent)) return result;\n };\n Node.prototype._encodeValue = function (data, reporter, parent) {\n let state = this._baseState;\n if (state.parent === null) return state.children[0]._encode(data, reporter || new Reporter());\n let result = null;\n if (((this.reporter = reporter), state.optional && data === void 0))\n if (state.default !== null) data = state.default;\n else return;\n let content = null,\n primitive = !1;\n if (state.any) result = this._createEncoderBuffer(data);\n else if (state.choice) result = this._encodeChoice(data, reporter);\n else if (state.contains)\n (content = this._getUse(state.contains, parent)._encode(data, reporter)), (primitive = !0);\n else if (state.children)\n (content = state.children\n .map(function (child) {\n if (child._baseState.tag === \"null_\") return child._encode(null, reporter, data);\n if (child._baseState.key === null) return reporter.error(\"Child should have a key\");\n let prevKey = reporter.enterKey(child._baseState.key);\n if (typeof data != \"object\") return reporter.error(\"Child expected, but input is not object\");\n let res = child._encode(data[child._baseState.key], reporter, data);\n return reporter.leaveKey(prevKey), res;\n }, this)\n .filter(function (child) {\n return child;\n })),\n (content = this._createEncoderBuffer(content));\n else if (state.tag === \"seqof\" || state.tag === \"setof\") {\n if (!(state.args && state.args.length === 1)) return reporter.error(\"Too many args for : \" + state.tag);\n if (!Array.isArray(data)) return reporter.error(\"seqof/setof, but data is not Array\");\n let child = this.clone();\n (child._baseState.implicit = null),\n (content = this._createEncoderBuffer(\n data.map(function (item) {\n let state2 = this._baseState;\n return this._getUse(state2.args[0], data)._encode(item, reporter);\n }, child),\n ));\n } else\n state.use !== null\n ? (result = this._getUse(state.use, parent)._encode(data, reporter))\n : ((content = this._encodePrimitive(state.tag, data)), (primitive = !0));\n if (!state.any && state.choice === null) {\n let tag = state.implicit !== null ? state.implicit : state.tag,\n cls = state.implicit === null ? \"universal\" : \"context\";\n tag === null\n ? state.use === null && reporter.error(\"Tag could be omitted only for .use()\")\n : state.use === null && (result = this._encodeComposite(tag, primitive, cls, content));\n }\n return state.explicit !== null && (result = this._encodeComposite(state.explicit, !1, \"context\", result)), result;\n };\n Node.prototype._encodeChoice = function (data, reporter) {\n let state = this._baseState,\n node = state.choice[data.type];\n return (\n node || assert(!1, data.type + \" not found in \" + JSON.stringify(Object.keys(state.choice))),\n node._encode(data.value, reporter)\n );\n };\n Node.prototype._encodePrimitive = function (tag, data) {\n let state = this._baseState;\n if (/str$/.test(tag)) return this._encodeStr(data, tag);\n if (tag === \"objid\" && state.args) return this._encodeObjid(data, state.reverseArgs[0], state.args[1]);\n if (tag === \"objid\") return this._encodeObjid(data, null, null);\n if (tag === \"gentime\" || tag === \"utctime\") return this._encodeTime(data, tag);\n if (tag === \"null_\") return this._encodeNull();\n if (tag === \"int\" || tag === \"enum\") return this._encodeInt(data, state.args && state.reverseArgs[0]);\n if (tag === \"bool\") return this._encodeBool(data);\n if (tag === \"objDesc\") return this._encodeStr(data, tag);\n throw new Error(\"Unsupported tag: \" + tag);\n };\n Node.prototype._isNumstr = function (str) {\n return /^[0-9 ]*$/.test(str);\n };\n Node.prototype._isPrintstr = function (str) {\n return /^[A-Za-z0-9 '()+,-./:=?]*$/.test(str);\n };\n },\n});\n\n// node_modules/asn1.js/lib/asn1/constants/der.js\nvar require_der = __commonJS({\n \"node_modules/asn1.js/lib/asn1/constants/der.js\"(exports) {\n \"use strict\";\n function reverse(map) {\n let res = {};\n return (\n Object.keys(map).forEach(function (key) {\n (key | 0) == key && (key = key | 0);\n let value = map[key];\n res[value] = key;\n }),\n res\n );\n }\n exports.tagClass = {\n 0: \"universal\",\n 1: \"application\",\n 2: \"context\",\n 3: \"private\",\n };\n exports.tagClassByName = reverse(exports.tagClass);\n exports.tag = {\n 0: \"end\",\n 1: \"bool\",\n 2: \"int\",\n 3: \"bitstr\",\n 4: \"octstr\",\n 5: \"null_\",\n 6: \"objid\",\n 7: \"objDesc\",\n 8: \"external\",\n 9: \"real\",\n 10: \"enum\",\n 11: \"embed\",\n 12: \"utf8str\",\n 13: \"relativeOid\",\n 16: \"seq\",\n 17: \"set\",\n 18: \"numstr\",\n 19: \"printstr\",\n 20: \"t61str\",\n 21: \"videostr\",\n 22: \"ia5str\",\n 23: \"utctime\",\n 24: \"gentime\",\n 25: \"graphstr\",\n 26: \"iso646str\",\n 27: \"genstr\",\n 28: \"unistr\",\n 29: \"charstr\",\n 30: \"bmpstr\",\n };\n exports.tagByName = reverse(exports.tag);\n },\n});\n\n// node_modules/asn1.js/lib/asn1/encoders/der.js\nvar require_der2 = __commonJS({\n \"node_modules/asn1.js/lib/asn1/encoders/der.js\"(exports, module) {\n \"use strict\";\n var inherits = require_inherits_browser(),\n Buffer2 = require_safer().Buffer,\n Node = require_node(),\n der = require_der();\n function DEREncoder(entity) {\n (this.enc = \"der\"),\n (this.name = entity.name),\n (this.entity = entity),\n (this.tree = new DERNode()),\n this.tree._init(entity.body);\n }\n module.exports = DEREncoder;\n DEREncoder.prototype.encode = function (data, reporter) {\n return this.tree._encode(data, reporter).join();\n };\n function DERNode(parent) {\n Node.call(this, \"der\", parent);\n }\n inherits(DERNode, Node);\n DERNode.prototype._encodeComposite = function (tag, primitive, cls, content) {\n let encodedTag = encodeTag(tag, primitive, cls, this.reporter);\n if (content.length < 128) {\n let header2 = Buffer2.alloc(2);\n return (header2[0] = encodedTag), (header2[1] = content.length), this._createEncoderBuffer([header2, content]);\n }\n let lenOctets = 1;\n for (let i = content.length; i >= 256; i >>= 8) lenOctets++;\n let header = Buffer2.alloc(1 + 1 + lenOctets);\n (header[0] = encodedTag), (header[1] = 128 | lenOctets);\n for (let i = 1 + lenOctets, j = content.length; j > 0; i--, j >>= 8) header[i] = j & 255;\n return this._createEncoderBuffer([header, content]);\n };\n DERNode.prototype._encodeStr = function (str, tag) {\n if (tag === \"bitstr\") return this._createEncoderBuffer([str.unused | 0, str.data]);\n if (tag === \"bmpstr\") {\n let buf = Buffer2.alloc(str.length * 2);\n for (let i = 0; i < str.length; i++) buf.writeUInt16BE(str.charCodeAt(i), i * 2);\n return this._createEncoderBuffer(buf);\n } else\n return tag === \"numstr\"\n ? this._isNumstr(str)\n ? this._createEncoderBuffer(str)\n : this.reporter.error(\"Encoding of string type: numstr supports only digits and space\")\n : tag === \"printstr\"\n ? this._isPrintstr(str)\n ? this._createEncoderBuffer(str)\n : this.reporter.error(\n \"Encoding of string type: printstr supports only latin upper and lower case letters, digits, space, apostrophe, left and rigth parenthesis, plus sign, comma, hyphen, dot, slash, colon, equal sign, question mark\",\n )\n : /str$/.test(tag)\n ? this._createEncoderBuffer(str)\n : tag === \"objDesc\"\n ? this._createEncoderBuffer(str)\n : this.reporter.error(\"Encoding of string type: \" + tag + \" unsupported\");\n };\n DERNode.prototype._encodeObjid = function (id, values, relative) {\n if (typeof id == \"string\") {\n if (!values) return this.reporter.error(\"string objid given, but no values map found\");\n if (!values.hasOwnProperty(id)) return this.reporter.error(\"objid not found in values map\");\n id = values[id].split(/[\\s.]+/g);\n for (let i = 0; i < id.length; i++) id[i] |= 0;\n } else if (Array.isArray(id)) {\n id = id.slice();\n for (let i = 0; i < id.length; i++) id[i] |= 0;\n }\n if (!Array.isArray(id))\n return this.reporter.error(\"objid() should be either array or string, got: \" + JSON.stringify(id));\n if (!relative) {\n if (id[1] >= 40) return this.reporter.error(\"Second objid identifier OOB\");\n id.splice(0, 2, id[0] * 40 + id[1]);\n }\n let size = 0;\n for (let i = 0; i < id.length; i++) {\n let ident = id[i];\n for (size++; ident >= 128; ident >>= 7) size++;\n }\n let objid = Buffer2.alloc(size),\n offset = objid.length - 1;\n for (let i = id.length - 1; i >= 0; i--) {\n let ident = id[i];\n for (objid[offset--] = ident & 127; (ident >>= 7) > 0; ) objid[offset--] = 128 | (ident & 127);\n }\n return this._createEncoderBuffer(objid);\n };\n function two(num) {\n return num < 10 ? \"0\" + num : num;\n }\n DERNode.prototype._encodeTime = function (time, tag) {\n let str,\n date = new Date(time);\n return (\n tag === \"gentime\"\n ? (str = [\n two(date.getUTCFullYear()),\n two(date.getUTCMonth() + 1),\n two(date.getUTCDate()),\n two(date.getUTCHours()),\n two(date.getUTCMinutes()),\n two(date.getUTCSeconds()),\n \"Z\",\n ].join(\"\"))\n : tag === \"utctime\"\n ? (str = [\n two(date.getUTCFullYear() % 100),\n two(date.getUTCMonth() + 1),\n two(date.getUTCDate()),\n two(date.getUTCHours()),\n two(date.getUTCMinutes()),\n two(date.getUTCSeconds()),\n \"Z\",\n ].join(\"\"))\n : this.reporter.error(\"Encoding \" + tag + \" time is not supported yet\"),\n this._encodeStr(str, \"octstr\")\n );\n };\n DERNode.prototype._encodeNull = function () {\n return this._createEncoderBuffer(\"\");\n };\n DERNode.prototype._encodeInt = function (num, values) {\n if (typeof num == \"string\") {\n if (!values) return this.reporter.error(\"String int or enum given, but no values map\");\n if (!values.hasOwnProperty(num))\n return this.reporter.error(\"Values map doesn't contain: \" + JSON.stringify(num));\n num = values[num];\n }\n if (typeof num != \"number\" && !Buffer2.isBuffer(num)) {\n let numArray = num.toArray();\n !num.sign && numArray[0] & 128 && numArray.unshift(0), (num = Buffer2.from(numArray));\n }\n if (Buffer2.isBuffer(num)) {\n let size2 = num.length;\n num.length === 0 && size2++;\n let out2 = Buffer2.alloc(size2);\n return num.copy(out2), num.length === 0 && (out2[0] = 0), this._createEncoderBuffer(out2);\n }\n if (num < 128) return this._createEncoderBuffer(num);\n if (num < 256) return this._createEncoderBuffer([0, num]);\n let size = 1;\n for (let i = num; i >= 256; i >>= 8) size++;\n let out = new Array(size);\n for (let i = out.length - 1; i >= 0; i--) (out[i] = num & 255), (num >>= 8);\n return out[0] & 128 && out.unshift(0), this._createEncoderBuffer(Buffer2.from(out));\n };\n DERNode.prototype._encodeBool = function (value) {\n return this._createEncoderBuffer(value ? 255 : 0);\n };\n DERNode.prototype._use = function (entity, obj) {\n return typeof entity == \"function\" && (entity = entity(obj)), entity._getEncoder(\"der\").tree;\n };\n DERNode.prototype._skipDefault = function (dataBuffer, reporter, parent) {\n let state = this._baseState,\n i;\n if (state.default === null) return !1;\n let data = dataBuffer.join();\n if (\n (state.defaultBuffer === void 0 &&\n (state.defaultBuffer = this._encodeValue(state.default, reporter, parent).join()),\n data.length !== state.defaultBuffer.length)\n )\n return !1;\n for (i = 0; i < data.length; i++) if (data[i] !== state.defaultBuffer[i]) return !1;\n return !0;\n };\n function encodeTag(tag, primitive, cls, reporter) {\n let res;\n if ((tag === \"seqof\" ? (tag = \"seq\") : tag === \"setof\" && (tag = \"set\"), der.tagByName.hasOwnProperty(tag)))\n res = der.tagByName[tag];\n else if (typeof tag == \"number\" && (tag | 0) === tag) res = tag;\n else return reporter.error(\"Unknown tag: \" + tag);\n return res >= 31\n ? reporter.error(\"Multi-octet tag encoding unsupported\")\n : (primitive || (res |= 32), (res |= der.tagClassByName[cls || \"universal\"] << 6), res);\n }\n },\n});\n\n// node_modules/asn1.js/lib/asn1/encoders/pem.js\nvar require_pem = __commonJS({\n \"node_modules/asn1.js/lib/asn1/encoders/pem.js\"(exports, module) {\n \"use strict\";\n var inherits = require_inherits_browser(),\n DEREncoder = require_der2();\n function PEMEncoder(entity) {\n DEREncoder.call(this, entity), (this.enc = \"pem\");\n }\n inherits(PEMEncoder, DEREncoder);\n module.exports = PEMEncoder;\n PEMEncoder.prototype.encode = function (data, options) {\n let p = DEREncoder.prototype.encode.call(this, data).toString(\"base64\"),\n out = [\"-----BEGIN \" + options.label + \"-----\"];\n for (let i = 0; i < p.length; i += 64) out.push(p.slice(i, i + 64));\n return (\n out.push(\"-----END \" + options.label + \"-----\"),\n out.join(`\n`)\n );\n };\n },\n});\n\n// node_modules/asn1.js/lib/asn1/encoders/index.js\nvar require_encoders = __commonJS({\n \"node_modules/asn1.js/lib/asn1/encoders/index.js\"(exports) {\n \"use strict\";\n var encoders = exports;\n encoders.der = require_der2();\n encoders.pem = require_pem();\n },\n});\n\n// node_modules/asn1.js/lib/asn1/decoders/der.js\nvar require_der3 = __commonJS({\n \"node_modules/asn1.js/lib/asn1/decoders/der.js\"(exports, module) {\n \"use strict\";\n var inherits = require_inherits_browser(),\n bignum = require_bn5(),\n DecoderBuffer = require_buffer().DecoderBuffer,\n Node = require_node(),\n der = require_der();\n function DERDecoder(entity) {\n (this.enc = \"der\"),\n (this.name = entity.name),\n (this.entity = entity),\n (this.tree = new DERNode()),\n this.tree._init(entity.body);\n }\n module.exports = DERDecoder;\n DERDecoder.prototype.decode = function (data, options) {\n return (\n DecoderBuffer.isDecoderBuffer(data) || (data = new DecoderBuffer(data, options)),\n this.tree._decode(data, options)\n );\n };\n function DERNode(parent) {\n Node.call(this, \"der\", parent);\n }\n inherits(DERNode, Node);\n DERNode.prototype._peekTag = function (buffer, tag, any) {\n if (buffer.isEmpty()) return !1;\n let state = buffer.save(),\n decodedTag = derDecodeTag(buffer, 'Failed to peek tag: \"' + tag + '\"');\n return buffer.isError(decodedTag)\n ? decodedTag\n : (buffer.restore(state),\n decodedTag.tag === tag || decodedTag.tagStr === tag || decodedTag.tagStr + \"of\" === tag || any);\n };\n DERNode.prototype._decodeTag = function (buffer, tag, any) {\n let decodedTag = derDecodeTag(buffer, 'Failed to decode tag of \"' + tag + '\"');\n if (buffer.isError(decodedTag)) return decodedTag;\n let len = derDecodeLen(buffer, decodedTag.primitive, 'Failed to get length of \"' + tag + '\"');\n if (buffer.isError(len)) return len;\n if (!any && decodedTag.tag !== tag && decodedTag.tagStr !== tag && decodedTag.tagStr + \"of\" !== tag)\n return buffer.error('Failed to match tag: \"' + tag + '\"');\n if (decodedTag.primitive || len !== null) return buffer.skip(len, 'Failed to match body of: \"' + tag + '\"');\n let state = buffer.save(),\n res = this._skipUntilEnd(buffer, 'Failed to skip indefinite length body: \"' + this.tag + '\"');\n return buffer.isError(res)\n ? res\n : ((len = buffer.offset - state.offset),\n buffer.restore(state),\n buffer.skip(len, 'Failed to match body of: \"' + tag + '\"'));\n };\n DERNode.prototype._skipUntilEnd = function (buffer, fail) {\n for (;;) {\n let tag = derDecodeTag(buffer, fail);\n if (buffer.isError(tag)) return tag;\n let len = derDecodeLen(buffer, tag.primitive, fail);\n if (buffer.isError(len)) return len;\n let res;\n if (\n (tag.primitive || len !== null ? (res = buffer.skip(len)) : (res = this._skipUntilEnd(buffer, fail)),\n buffer.isError(res))\n )\n return res;\n if (tag.tagStr === \"end\") break;\n }\n };\n DERNode.prototype._decodeList = function (buffer, tag, decoder, options) {\n let result = [];\n for (; !buffer.isEmpty(); ) {\n let possibleEnd = this._peekTag(buffer, \"end\");\n if (buffer.isError(possibleEnd)) return possibleEnd;\n let res = decoder.decode(buffer, \"der\", options);\n if (buffer.isError(res) && possibleEnd) break;\n result.push(res);\n }\n return result;\n };\n DERNode.prototype._decodeStr = function (buffer, tag) {\n if (tag === \"bitstr\") {\n let unused = buffer.readUInt8();\n return buffer.isError(unused) ? unused : { unused, data: buffer.raw() };\n } else if (tag === \"bmpstr\") {\n let raw = buffer.raw();\n if (raw.length % 2 === 1) return buffer.error(\"Decoding of string type: bmpstr length mismatch\");\n let str = \"\";\n for (let i = 0; i < raw.length / 2; i++) str += String.fromCharCode(raw.readUInt16BE(i * 2));\n return str;\n } else if (tag === \"numstr\") {\n let numstr = buffer.raw().toString(\"ascii\");\n return this._isNumstr(numstr) ? numstr : buffer.error(\"Decoding of string type: numstr unsupported characters\");\n } else {\n if (tag === \"octstr\") return buffer.raw();\n if (tag === \"objDesc\") return buffer.raw();\n if (tag === \"printstr\") {\n let printstr = buffer.raw().toString(\"ascii\");\n return this._isPrintstr(printstr)\n ? printstr\n : buffer.error(\"Decoding of string type: printstr unsupported characters\");\n } else\n return /str$/.test(tag)\n ? buffer.raw().toString()\n : buffer.error(\"Decoding of string type: \" + tag + \" unsupported\");\n }\n };\n DERNode.prototype._decodeObjid = function (buffer, values, relative) {\n let result,\n identifiers = [],\n ident = 0,\n subident = 0;\n for (; !buffer.isEmpty(); )\n (subident = buffer.readUInt8()),\n (ident <<= 7),\n (ident |= subident & 127),\n (subident & 128) === 0 && (identifiers.push(ident), (ident = 0));\n subident & 128 && identifiers.push(ident);\n let first = (identifiers[0] / 40) | 0,\n second = identifiers[0] % 40;\n if ((relative ? (result = identifiers) : (result = [first, second].concat(identifiers.slice(1))), values)) {\n let tmp = values[result.join(\" \")];\n tmp === void 0 && (tmp = values[result.join(\".\")]), tmp !== void 0 && (result = tmp);\n }\n return result;\n };\n DERNode.prototype._decodeTime = function (buffer, tag) {\n let str = buffer.raw().toString(),\n year,\n mon,\n day,\n hour,\n min,\n sec;\n if (tag === \"gentime\")\n (year = str.slice(0, 4) | 0),\n (mon = str.slice(4, 6) | 0),\n (day = str.slice(6, 8) | 0),\n (hour = str.slice(8, 10) | 0),\n (min = str.slice(10, 12) | 0),\n (sec = str.slice(12, 14) | 0);\n else if (tag === \"utctime\")\n (year = str.slice(0, 2) | 0),\n (mon = str.slice(2, 4) | 0),\n (day = str.slice(4, 6) | 0),\n (hour = str.slice(6, 8) | 0),\n (min = str.slice(8, 10) | 0),\n (sec = str.slice(10, 12) | 0),\n year < 70 ? (year = 2e3 + year) : (year = 1900 + year);\n else return buffer.error(\"Decoding \" + tag + \" time is not supported yet\");\n return Date.UTC(year, mon - 1, day, hour, min, sec, 0);\n };\n DERNode.prototype._decodeNull = function () {\n return null;\n };\n DERNode.prototype._decodeBool = function (buffer) {\n let res = buffer.readUInt8();\n return buffer.isError(res) ? res : res !== 0;\n };\n DERNode.prototype._decodeInt = function (buffer, values) {\n let raw = buffer.raw(),\n res = new bignum(raw);\n return values && (res = values[res.toString(10)] || res), res;\n };\n DERNode.prototype._use = function (entity, obj) {\n return typeof entity == \"function\" && (entity = entity(obj)), entity._getDecoder(\"der\").tree;\n };\n function derDecodeTag(buf, fail) {\n let tag = buf.readUInt8(fail);\n if (buf.isError(tag)) return tag;\n let cls = der.tagClass[tag >> 6],\n primitive = (tag & 32) === 0;\n if ((tag & 31) === 31) {\n let oct = tag;\n for (tag = 0; (oct & 128) === 128; ) {\n if (((oct = buf.readUInt8(fail)), buf.isError(oct))) return oct;\n (tag <<= 7), (tag |= oct & 127);\n }\n } else tag &= 31;\n let tagStr = der.tag[tag];\n return {\n cls,\n primitive,\n tag,\n tagStr,\n };\n }\n function derDecodeLen(buf, primitive, fail) {\n let len = buf.readUInt8(fail);\n if (buf.isError(len)) return len;\n if (!primitive && len === 128) return null;\n if ((len & 128) === 0) return len;\n let num = len & 127;\n if (num > 4) return buf.error(\"length octect is too long\");\n len = 0;\n for (let i = 0; i < num; i++) {\n len <<= 8;\n let j = buf.readUInt8(fail);\n if (buf.isError(j)) return j;\n len |= j;\n }\n return len;\n }\n },\n});\n\n// node_modules/asn1.js/lib/asn1/decoders/pem.js\nvar require_pem2 = __commonJS({\n \"node_modules/asn1.js/lib/asn1/decoders/pem.js\"(exports, module) {\n \"use strict\";\n var inherits = require_inherits_browser(),\n Buffer2 = require_safer().Buffer,\n DERDecoder = require_der3();\n function PEMDecoder(entity) {\n DERDecoder.call(this, entity), (this.enc = \"pem\");\n }\n inherits(PEMDecoder, DERDecoder);\n module.exports = PEMDecoder;\n PEMDecoder.prototype.decode = function (data, options) {\n let lines = data.toString().split(/[\\r\\n]+/g),\n label = options.label.toUpperCase(),\n re = /^-----(BEGIN|END) ([^-]+)-----$/,\n start = -1,\n end = -1;\n for (let i = 0; i < lines.length; i++) {\n let match = lines[i].match(re);\n if (match !== null && match[2] === label)\n if (start === -1) {\n if (match[1] !== \"BEGIN\") break;\n start = i;\n } else {\n if (match[1] !== \"END\") break;\n end = i;\n break;\n }\n }\n if (start === -1 || end === -1) throw new Error(\"PEM section not found for: \" + label);\n let base64 = lines.slice(start + 1, end).join(\"\");\n base64.replace(/[^a-z0-9+/=]+/gi, \"\");\n let input = Buffer2.from(base64, \"base64\");\n return DERDecoder.prototype.decode.call(this, input, options);\n };\n },\n});\n\n// node_modules/asn1.js/lib/asn1/decoders/index.js\nvar require_decoders = __commonJS({\n \"node_modules/asn1.js/lib/asn1/decoders/index.js\"(exports) {\n \"use strict\";\n var decoders = exports;\n decoders.der = require_der3();\n decoders.pem = require_pem2();\n },\n});\n\n// node_modules/asn1.js/lib/asn1/api.js\nvar require_api = __commonJS({\n \"node_modules/asn1.js/lib/asn1/api.js\"(exports) {\n \"use strict\";\n var encoders = require_encoders(),\n decoders = require_decoders(),\n inherits = require_inherits_browser(),\n api = exports;\n api.define = function (name, body) {\n return new Entity(name, body);\n };\n function Entity(name, body) {\n (this.name = name), (this.body = body), (this.decoders = {}), (this.encoders = {});\n }\n Entity.prototype._createNamed = function (Base) {\n let name = this.name;\n function Generated(entity) {\n this._initNamed(entity, name);\n }\n return (\n inherits(Generated, Base),\n (Generated.prototype._initNamed = function (entity, name2) {\n Base.call(this, entity, name2);\n }),\n new Generated(this)\n );\n };\n Entity.prototype._getDecoder = function (enc) {\n return (\n (enc = enc || \"der\"),\n this.decoders.hasOwnProperty(enc) || (this.decoders[enc] = this._createNamed(decoders[enc])),\n this.decoders[enc]\n );\n };\n Entity.prototype.decode = function (data, enc, options) {\n return this._getDecoder(enc).decode(data, options);\n };\n Entity.prototype._getEncoder = function (enc) {\n return (\n (enc = enc || \"der\"),\n this.encoders.hasOwnProperty(enc) || (this.encoders[enc] = this._createNamed(encoders[enc])),\n this.encoders[enc]\n );\n };\n Entity.prototype.encode = function (data, enc, reporter) {\n return this._getEncoder(enc).encode(data, reporter);\n };\n },\n});\n\n// node_modules/asn1.js/lib/asn1/base/index.js\nvar require_base2 = __commonJS({\n \"node_modules/asn1.js/lib/asn1/base/index.js\"(exports) {\n \"use strict\";\n var base = exports;\n base.Reporter = require_reporter().Reporter;\n base.DecoderBuffer = require_buffer().DecoderBuffer;\n base.EncoderBuffer = require_buffer().EncoderBuffer;\n base.Node = require_node();\n },\n});\n\n// node_modules/asn1.js/lib/asn1/constants/index.js\nvar require_constants = __commonJS({\n \"node_modules/asn1.js/lib/asn1/constants/index.js\"(exports) {\n \"use strict\";\n var constants = exports;\n constants._reverse = function (map) {\n let res = {};\n return (\n Object.keys(map).forEach(function (key) {\n (key | 0) == key && (key = key | 0);\n let value = map[key];\n res[value] = key;\n }),\n res\n );\n };\n constants.der = require_der();\n },\n});\n\n// node_modules/asn1.js/lib/asn1.js\nvar require_asn1 = __commonJS({\n \"node_modules/asn1.js/lib/asn1.js\"(exports) {\n \"use strict\";\n var asn1 = exports;\n asn1.bignum = require_bn5();\n asn1.define = require_api().define;\n asn1.base = require_base2();\n asn1.constants = require_constants();\n asn1.decoders = require_decoders();\n asn1.encoders = require_encoders();\n },\n});\n\n// node_modules/parse-asn1/certificate.js\nvar require_certificate = __commonJS({\n \"node_modules/parse-asn1/certificate.js\"(exports, module) {\n \"use strict\";\n var asn = require_asn1(),\n Time = asn.define(\"Time\", function () {\n this.choice({\n utcTime: this.utctime(),\n generalTime: this.gentime(),\n });\n }),\n AttributeTypeValue = asn.define(\"AttributeTypeValue\", function () {\n this.seq().obj(this.key(\"type\").objid(), this.key(\"value\").any());\n }),\n AlgorithmIdentifier = asn.define(\"AlgorithmIdentifier\", function () {\n this.seq().obj(\n this.key(\"algorithm\").objid(),\n this.key(\"parameters\").optional(),\n this.key(\"curve\").objid().optional(),\n );\n }),\n SubjectPublicKeyInfo = asn.define(\"SubjectPublicKeyInfo\", function () {\n this.seq().obj(this.key(\"algorithm\").use(AlgorithmIdentifier), this.key(\"subjectPublicKey\").bitstr());\n }),\n RelativeDistinguishedName = asn.define(\"RelativeDistinguishedName\", function () {\n this.setof(AttributeTypeValue);\n }),\n RDNSequence = asn.define(\"RDNSequence\", function () {\n this.seqof(RelativeDistinguishedName);\n }),\n Name = asn.define(\"Name\", function () {\n this.choice({\n rdnSequence: this.use(RDNSequence),\n });\n }),\n Validity = asn.define(\"Validity\", function () {\n this.seq().obj(this.key(\"notBefore\").use(Time), this.key(\"notAfter\").use(Time));\n }),\n Extension = asn.define(\"Extension\", function () {\n this.seq().obj(this.key(\"extnID\").objid(), this.key(\"critical\").bool().def(!1), this.key(\"extnValue\").octstr());\n }),\n TBSCertificate = asn.define(\"TBSCertificate\", function () {\n this.seq().obj(\n this.key(\"version\").explicit(0).int().optional(),\n this.key(\"serialNumber\").int(),\n this.key(\"signature\").use(AlgorithmIdentifier),\n this.key(\"issuer\").use(Name),\n this.key(\"validity\").use(Validity),\n this.key(\"subject\").use(Name),\n this.key(\"subjectPublicKeyInfo\").use(SubjectPublicKeyInfo),\n this.key(\"issuerUniqueID\").implicit(1).bitstr().optional(),\n this.key(\"subjectUniqueID\").implicit(2).bitstr().optional(),\n this.key(\"extensions\").explicit(3).seqof(Extension).optional(),\n );\n }),\n X509Certificate = asn.define(\"X509Certificate\", function () {\n this.seq().obj(\n this.key(\"tbsCertificate\").use(TBSCertificate),\n this.key(\"signatureAlgorithm\").use(AlgorithmIdentifier),\n this.key(\"signatureValue\").bitstr(),\n );\n });\n module.exports = X509Certificate;\n },\n});\n\n// node_modules/parse-asn1/asn1.js\nvar require_asn12 = __commonJS({\n \"node_modules/parse-asn1/asn1.js\"(exports) {\n \"use strict\";\n var asn1 = require_asn1();\n exports.certificate = require_certificate();\n var RSAPrivateKey = asn1.define(\"RSAPrivateKey\", function () {\n this.seq().obj(\n this.key(\"version\").int(),\n this.key(\"modulus\").int(),\n this.key(\"publicExponent\").int(),\n this.key(\"privateExponent\").int(),\n this.key(\"prime1\").int(),\n this.key(\"prime2\").int(),\n this.key(\"exponent1\").int(),\n this.key(\"exponent2\").int(),\n this.key(\"coefficient\").int(),\n );\n });\n exports.RSAPrivateKey = RSAPrivateKey;\n var RSAPublicKey = asn1.define(\"RSAPublicKey\", function () {\n this.seq().obj(this.key(\"modulus\").int(), this.key(\"publicExponent\").int());\n });\n exports.RSAPublicKey = RSAPublicKey;\n var PublicKey = asn1.define(\"SubjectPublicKeyInfo\", function () {\n this.seq().obj(this.key(\"algorithm\").use(AlgorithmIdentifier), this.key(\"subjectPublicKey\").bitstr());\n });\n exports.PublicKey = PublicKey;\n var AlgorithmIdentifier = asn1.define(\"AlgorithmIdentifier\", function () {\n this.seq().obj(\n this.key(\"algorithm\").objid(),\n this.key(\"none\").null_().optional(),\n this.key(\"curve\").objid().optional(),\n this.key(\"params\").seq().obj(this.key(\"p\").int(), this.key(\"q\").int(), this.key(\"g\").int()).optional(),\n );\n }),\n PrivateKeyInfo = asn1.define(\"PrivateKeyInfo\", function () {\n this.seq().obj(\n this.key(\"version\").int(),\n this.key(\"algorithm\").use(AlgorithmIdentifier),\n this.key(\"subjectPrivateKey\").octstr(),\n );\n });\n exports.PrivateKey = PrivateKeyInfo;\n var EncryptedPrivateKeyInfo = asn1.define(\"EncryptedPrivateKeyInfo\", function () {\n this.seq().obj(\n this.key(\"algorithm\")\n .seq()\n .obj(\n this.key(\"id\").objid(),\n this.key(\"decrypt\")\n .seq()\n .obj(\n this.key(\"kde\")\n .seq()\n .obj(\n this.key(\"id\").objid(),\n this.key(\"kdeparams\").seq().obj(this.key(\"salt\").octstr(), this.key(\"iters\").int()),\n ),\n this.key(\"cipher\").seq().obj(this.key(\"algo\").objid(), this.key(\"iv\").octstr()),\n ),\n ),\n this.key(\"subjectPrivateKey\").octstr(),\n );\n });\n exports.EncryptedPrivateKey = EncryptedPrivateKeyInfo;\n var DSAPrivateKey = asn1.define(\"DSAPrivateKey\", function () {\n this.seq().obj(\n this.key(\"version\").int(),\n this.key(\"p\").int(),\n this.key(\"q\").int(),\n this.key(\"g\").int(),\n this.key(\"pub_key\").int(),\n this.key(\"priv_key\").int(),\n );\n });\n exports.DSAPrivateKey = DSAPrivateKey;\n exports.DSAparam = asn1.define(\"DSAparam\", function () {\n this.int();\n });\n var ECPrivateKey = asn1.define(\"ECPrivateKey\", function () {\n this.seq().obj(\n this.key(\"version\").int(),\n this.key(\"privateKey\").octstr(),\n this.key(\"parameters\").optional().explicit(0).use(ECParameters),\n this.key(\"publicKey\").optional().explicit(1).bitstr(),\n );\n });\n exports.ECPrivateKey = ECPrivateKey;\n var ECParameters = asn1.define(\"ECParameters\", function () {\n this.choice({\n namedCurve: this.objid(),\n });\n });\n exports.signature = asn1.define(\"signature\", function () {\n this.seq().obj(this.key(\"r\").int(), this.key(\"s\").int());\n });\n },\n});\n\n// node_modules/parse-asn1/aesid.json\nvar require_aesid = __commonJS({\n \"node_modules/parse-asn1/aesid.json\"(exports, module) {\n module.exports = {\n \"2.16.840.1.101.3.4.1.1\": \"aes-128-ecb\",\n \"2.16.840.1.101.3.4.1.2\": \"aes-128-cbc\",\n \"2.16.840.1.101.3.4.1.3\": \"aes-128-ofb\",\n \"2.16.840.1.101.3.4.1.4\": \"aes-128-cfb\",\n \"2.16.840.1.101.3.4.1.21\": \"aes-192-ecb\",\n \"2.16.840.1.101.3.4.1.22\": \"aes-192-cbc\",\n \"2.16.840.1.101.3.4.1.23\": \"aes-192-ofb\",\n \"2.16.840.1.101.3.4.1.24\": \"aes-192-cfb\",\n \"2.16.840.1.101.3.4.1.41\": \"aes-256-ecb\",\n \"2.16.840.1.101.3.4.1.42\": \"aes-256-cbc\",\n \"2.16.840.1.101.3.4.1.43\": \"aes-256-ofb\",\n \"2.16.840.1.101.3.4.1.44\": \"aes-256-cfb\",\n };\n },\n});\n\n// node_modules/parse-asn1/fixProc.js\nvar require_fixProc = __commonJS({\n \"node_modules/parse-asn1/fixProc.js\"(exports, module) {\n var findProc =\n /Proc-Type: 4,ENCRYPTED[\\n\\r]+DEK-Info: AES-((?:128)|(?:192)|(?:256))-CBC,([0-9A-H]+)[\\n\\r]+([0-9A-z\\n\\r+/=]+)[\\n\\r]+/m,\n startRegex = /^-----BEGIN ((?:.*? KEY)|CERTIFICATE)-----/m,\n fullRegex = /^-----BEGIN ((?:.*? KEY)|CERTIFICATE)-----([0-9A-z\\n\\r+/=]+)-----END \\1-----$/m,\n evp = require_evp_bytestokey(),\n ciphers = require_browser5(),\n Buffer2 = require_safe_buffer().Buffer;\n module.exports = function (okey, password) {\n var key = okey.toString(),\n match = key.match(findProc),\n decrypted;\n if (match) {\n var suite = \"aes\" + match[1],\n iv = Buffer2.from(match[2], \"hex\"),\n cipherText = Buffer2.from(match[3].replace(/[\\r\\n]/g, \"\"), \"base64\"),\n cipherKey = evp(password, iv.slice(0, 8), parseInt(match[1], 10)).key,\n out = [],\n cipher = ciphers.createDecipheriv(suite, cipherKey, iv);\n out.push(cipher.update(cipherText)), out.push(cipher.final()), (decrypted = Buffer2.concat(out));\n } else {\n var match2 = key.match(fullRegex);\n decrypted = Buffer2.from(match2[2].replace(/[\\r\\n]/g, \"\"), \"base64\");\n }\n var tag = key.match(startRegex)[1];\n return {\n tag,\n data: decrypted,\n };\n };\n },\n});\n\n// node_modules/parse-asn1/index.js\nvar require_parse_asn1 = __commonJS({\n \"node_modules/parse-asn1/index.js\"(exports, module) {\n var asn1 = require_asn12(),\n aesid = require_aesid(),\n fixProc = require_fixProc(),\n ciphers = require_browser5(),\n compat = require_browser4(),\n Buffer2 = require_safe_buffer().Buffer;\n module.exports = parseKeys;\n function parseKeys(buffer) {\n var password;\n typeof buffer == \"object\" && !Buffer2.isBuffer(buffer) && ((password = buffer.passphrase), (buffer = buffer.key)),\n typeof buffer == \"string\" && (buffer = Buffer2.from(buffer));\n var stripped = fixProc(buffer, password),\n type = stripped.tag,\n data = stripped.data,\n subtype,\n ndata;\n switch (type) {\n case \"CERTIFICATE\":\n ndata = asn1.certificate.decode(data, \"der\").tbsCertificate.subjectPublicKeyInfo;\n case \"PUBLIC KEY\":\n switch (\n (ndata || (ndata = asn1.PublicKey.decode(data, \"der\")),\n (subtype = ndata.algorithm.algorithm.join(\".\")),\n subtype)\n ) {\n case \"1.2.840.113549.1.1.1\":\n return asn1.RSAPublicKey.decode(ndata.subjectPublicKey.data, \"der\");\n case \"1.2.840.10045.2.1\":\n return (\n (ndata.subjectPrivateKey = ndata.subjectPublicKey),\n {\n type: \"ec\",\n data: ndata,\n }\n );\n case \"1.2.840.10040.4.1\":\n return (\n (ndata.algorithm.params.pub_key = asn1.DSAparam.decode(ndata.subjectPublicKey.data, \"der\")),\n {\n type: \"dsa\",\n data: ndata.algorithm.params,\n }\n );\n default:\n throw new Error(\"unknown key id \" + subtype);\n }\n case \"ENCRYPTED PRIVATE KEY\":\n (data = asn1.EncryptedPrivateKey.decode(data, \"der\")), (data = decrypt(data, password));\n case \"PRIVATE KEY\":\n switch (\n ((ndata = asn1.PrivateKey.decode(data, \"der\")), (subtype = ndata.algorithm.algorithm.join(\".\")), subtype)\n ) {\n case \"1.2.840.113549.1.1.1\":\n return asn1.RSAPrivateKey.decode(ndata.subjectPrivateKey, \"der\");\n case \"1.2.840.10045.2.1\":\n return {\n curve: ndata.algorithm.curve,\n privateKey: asn1.ECPrivateKey.decode(ndata.subjectPrivateKey, \"der\").privateKey,\n };\n case \"1.2.840.10040.4.1\":\n return (\n (ndata.algorithm.params.priv_key = asn1.DSAparam.decode(ndata.subjectPrivateKey, \"der\")),\n {\n type: \"dsa\",\n params: ndata.algorithm.params,\n }\n );\n default:\n throw new Error(\"unknown key id \" + subtype);\n }\n case \"RSA PUBLIC KEY\":\n return asn1.RSAPublicKey.decode(data, \"der\");\n case \"RSA PRIVATE KEY\":\n return asn1.RSAPrivateKey.decode(data, \"der\");\n case \"DSA PRIVATE KEY\":\n return {\n type: \"dsa\",\n params: asn1.DSAPrivateKey.decode(data, \"der\"),\n };\n case \"EC PRIVATE KEY\":\n return (\n (data = asn1.ECPrivateKey.decode(data, \"der\")),\n {\n curve: data.parameters.value,\n privateKey: data.privateKey,\n }\n );\n default:\n throw new Error(\"unknown key type \" + type);\n }\n }\n parseKeys.signature = asn1.signature;\n function decrypt(data, password) {\n var salt = data.algorithm.decrypt.kde.kdeparams.salt,\n iters = parseInt(data.algorithm.decrypt.kde.kdeparams.iters.toString(), 10),\n algo = aesid[data.algorithm.decrypt.cipher.algo.join(\".\")],\n iv = data.algorithm.decrypt.cipher.iv,\n cipherText = data.subjectPrivateKey,\n keylen = parseInt(algo.split(\"-\")[1], 10) / 8,\n key = compat.pbkdf2Sync(password, salt, iters, keylen, \"sha1\"),\n cipher = ciphers.createDecipheriv(algo, key, iv),\n out = [];\n return out.push(cipher.update(cipherText)), out.push(cipher.final()), Buffer2.concat(out);\n }\n },\n});\n\n// node_modules/browserify-sign/browser/curves.json\nvar require_curves2 = __commonJS({\n \"node_modules/browserify-sign/browser/curves.json\"(exports, module) {\n module.exports = {\n \"1.3.132.0.10\": \"secp256k1\",\n \"1.3.132.0.33\": \"p224\",\n \"1.2.840.10045.3.1.1\": \"p192\",\n \"1.2.840.10045.3.1.7\": \"p256\",\n \"1.3.132.0.34\": \"p384\",\n \"1.3.132.0.35\": \"p521\",\n };\n },\n});\n\n// node_modules/browserify-sign/browser/sign.js\nvar require_sign = __commonJS({\n \"node_modules/browserify-sign/browser/sign.js\"(exports, module) {\n var Buffer2 = require_safe_buffer().Buffer,\n createHmac = require_browser3(),\n crt = require_browserify_rsa(),\n EC = require_elliptic().ec,\n BN = require_bn3(),\n parseKeys = require_parse_asn1(),\n curves = require_curves2();\n function sign(hash, key, hashType, signType, tag) {\n var priv = parseKeys(key);\n if (priv.curve) {\n if (signType !== \"ecdsa\" && signType !== \"ecdsa/rsa\") throw new Error(\"wrong private key type\");\n return ecSign(hash, priv);\n } else if (priv.type === \"dsa\") {\n if (signType !== \"dsa\") throw new Error(\"wrong private key type\");\n return dsaSign(hash, priv, hashType);\n } else if (signType !== \"rsa\" && signType !== \"ecdsa/rsa\") throw new Error(\"wrong private key type\");\n hash = Buffer2.concat([tag, hash]);\n for (var len = priv.modulus.byteLength(), pad = [0, 1]; hash.length + pad.length + 1 < len; ) pad.push(255);\n pad.push(0);\n for (var i = -1; ++i < hash.length; ) pad.push(hash[i]);\n var out = crt(pad, priv);\n return out;\n }\n function ecSign(hash, priv) {\n var curveId = curves[priv.curve.join(\".\")];\n if (!curveId) throw new Error(\"unknown curve \" + priv.curve.join(\".\"));\n var curve = new EC(curveId),\n key = curve.keyFromPrivate(priv.privateKey),\n out = key.sign(hash);\n return Buffer2.from(out.toDER());\n }\n function dsaSign(hash, priv, algo) {\n for (\n var x = priv.params.priv_key,\n p = priv.params.p,\n q = priv.params.q,\n g = priv.params.g,\n r = new BN(0),\n k,\n H = bits2int(hash, q).mod(q),\n s = !1,\n kv = getKey(x, q, hash, algo);\n s === !1;\n\n )\n (k = makeKey(q, kv, algo)),\n (r = makeR(g, k, p, q)),\n (s = k\n .invm(q)\n .imul(H.add(x.mul(r)))\n .mod(q)),\n s.cmpn(0) === 0 && ((s = !1), (r = new BN(0)));\n return toDER(r, s);\n }\n function toDER(r, s) {\n (r = r.toArray()), (s = s.toArray()), r[0] & 128 && (r = [0].concat(r)), s[0] & 128 && (s = [0].concat(s));\n var total = r.length + s.length + 4,\n res = [48, total, 2, r.length];\n return (res = res.concat(r, [2, s.length], s)), Buffer2.from(res);\n }\n function getKey(x, q, hash, algo) {\n if (((x = Buffer2.from(x.toArray())), x.length < q.byteLength())) {\n var zeros = Buffer2.alloc(q.byteLength() - x.length);\n x = Buffer2.concat([zeros, x]);\n }\n var hlen = hash.length,\n hbits = bits2octets(hash, q),\n v = Buffer2.alloc(hlen);\n v.fill(1);\n var k = Buffer2.alloc(hlen);\n return (\n (k = createHmac(algo, k)\n .update(v)\n .update(Buffer2.from([0]))\n .update(x)\n .update(hbits)\n .digest()),\n (v = createHmac(algo, k).update(v).digest()),\n (k = createHmac(algo, k)\n .update(v)\n .update(Buffer2.from([1]))\n .update(x)\n .update(hbits)\n .digest()),\n (v = createHmac(algo, k).update(v).digest()),\n { k, v }\n );\n }\n function bits2int(obits, q) {\n var bits = new BN(obits),\n shift = (obits.length << 3) - q.bitLength();\n return shift > 0 && bits.ishrn(shift), bits;\n }\n function bits2octets(bits, q) {\n (bits = bits2int(bits, q)), (bits = bits.mod(q));\n var out = Buffer2.from(bits.toArray());\n if (out.length < q.byteLength()) {\n var zeros = Buffer2.alloc(q.byteLength() - out.length);\n out = Buffer2.concat([zeros, out]);\n }\n return out;\n }\n function makeKey(q, kv, algo) {\n var t, k;\n do {\n for (t = Buffer2.alloc(0); t.length * 8 < q.bitLength(); )\n (kv.v = createHmac(algo, kv.k).update(kv.v).digest()), (t = Buffer2.concat([t, kv.v]));\n (k = bits2int(t, q)),\n (kv.k = createHmac(algo, kv.k)\n .update(kv.v)\n .update(Buffer2.from([0]))\n .digest()),\n (kv.v = createHmac(algo, kv.k).update(kv.v).digest());\n } while (k.cmp(q) !== -1);\n return k;\n }\n function makeR(g, k, p, q) {\n return g.toRed(BN.mont(p)).redPow(k).fromRed().mod(q);\n }\n module.exports = sign;\n module.exports.getKey = getKey;\n module.exports.makeKey = makeKey;\n },\n});\n\n// node_modules/browserify-sign/browser/verify.js\nvar require_verify = __commonJS({\n \"node_modules/browserify-sign/browser/verify.js\"(exports, module) {\n var Buffer2 = require_safe_buffer().Buffer,\n BN = require_bn3(),\n EC = require_elliptic().ec,\n parseKeys = require_parse_asn1(),\n curves = require_curves2();\n function verify(sig, hash, key, signType, tag) {\n var pub = parseKeys(key);\n if (pub.type === \"ec\") {\n if (signType !== \"ecdsa\" && signType !== \"ecdsa/rsa\") throw new Error(\"wrong public key type\");\n return ecVerify(sig, hash, pub);\n } else if (pub.type === \"dsa\") {\n if (signType !== \"dsa\") throw new Error(\"wrong public key type\");\n return dsaVerify(sig, hash, pub);\n } else if (signType !== \"rsa\" && signType !== \"ecdsa/rsa\") throw new Error(\"wrong public key type\");\n hash = Buffer2.concat([tag, hash]);\n for (var len = pub.modulus.byteLength(), pad = [1], padNum = 0; hash.length + pad.length + 2 < len; )\n pad.push(255), padNum++;\n pad.push(0);\n for (var i = -1; ++i < hash.length; ) pad.push(hash[i]);\n pad = Buffer2.from(pad);\n var red = BN.mont(pub.modulus);\n (sig = new BN(sig).toRed(red)),\n (sig = sig.redPow(new BN(pub.publicExponent))),\n (sig = Buffer2.from(sig.fromRed().toArray()));\n var out = padNum < 8 ? 1 : 0;\n for (len = Math.min(sig.length, pad.length), sig.length !== pad.length && (out = 1), i = -1; ++i < len; )\n out |= sig[i] ^ pad[i];\n return out === 0;\n }\n function ecVerify(sig, hash, pub) {\n var curveId = curves[pub.data.algorithm.curve.join(\".\")];\n if (!curveId) throw new Error(\"unknown curve \" + pub.data.algorithm.curve.join(\".\"));\n var curve = new EC(curveId),\n pubkey = pub.data.subjectPrivateKey.data;\n return curve.verify(hash, sig, pubkey);\n }\n function dsaVerify(sig, hash, pub) {\n var p = pub.data.p,\n q = pub.data.q,\n g = pub.data.g,\n y = pub.data.pub_key,\n unpacked = parseKeys.signature.decode(sig, \"der\"),\n s = unpacked.s,\n r = unpacked.r;\n checkValue(s, q), checkValue(r, q);\n var montp = BN.mont(p),\n w = s.invm(q),\n v = g\n .toRed(montp)\n .redPow(new BN(hash).mul(w).mod(q))\n .fromRed()\n .mul(y.toRed(montp).redPow(r.mul(w).mod(q)).fromRed())\n .mod(p)\n .mod(q);\n return v.cmp(r) === 0;\n }\n function checkValue(b, q) {\n if (b.cmpn(0) <= 0) throw new Error(\"invalid sig\");\n if (b.cmp(q) >= q) throw new Error(\"invalid sig\");\n }\n module.exports = verify;\n },\n});\n\n// node_modules/browserify-sign/browser/index.js\nvar require_browser8 = __commonJS({\n \"node_modules/browserify-sign/browser/index.js\"(exports, module) {\n var Buffer2 = require_safe_buffer().Buffer,\n createHash = require_browser2(),\n stream = __require(\"readable-stream\"),\n inherits = require_inherits_browser(),\n sign = require_sign(),\n verify = require_verify(),\n algorithms = require_algorithms();\n Object.keys(algorithms).forEach(function (key) {\n (algorithms[key].id = Buffer2.from(algorithms[key].id, \"hex\")), (algorithms[key.toLowerCase()] = algorithms[key]);\n });\n function Sign(algorithm) {\n stream.Writable.call(this);\n var data = algorithms[algorithm];\n if (!data) throw new Error(\"Unknown message digest\");\n (this._hashType = data.hash),\n (this._hash = createHash(data.hash)),\n (this._tag = data.id),\n (this._signType = data.sign);\n }\n inherits(Sign, stream.Writable);\n Sign.prototype._write = function (data, _, done) {\n this._hash.update(data), done();\n };\n Sign.prototype.update = function (data, enc) {\n return typeof data == \"string\" && (data = Buffer2.from(data, enc)), this._hash.update(data), this;\n };\n Sign.prototype.sign = function (key, enc) {\n this.end();\n var hash = this._hash.digest(),\n sig = sign(hash, key, this._hashType, this._signType, this._tag);\n return enc ? sig.toString(enc) : sig;\n };\n function Verify(algorithm) {\n stream.Writable.call(this);\n var data = algorithms[algorithm];\n if (!data) throw new Error(\"Unknown message digest\");\n (this._hash = createHash(data.hash)), (this._tag = data.id), (this._signType = data.sign);\n }\n inherits(Verify, stream.Writable);\n Verify.prototype._write = function (data, _, done) {\n this._hash.update(data), done();\n };\n Verify.prototype.update = function (data, enc) {\n return typeof data == \"string\" && (data = Buffer2.from(data, enc)), this._hash.update(data), this;\n };\n Verify.prototype.verify = function (key, sig, enc) {\n typeof sig == \"string\" && (sig = Buffer2.from(sig, enc)), this.end();\n var hash = this._hash.digest();\n return verify(sig, hash, key, this._signType, this._tag);\n };\n function createSign(algorithm) {\n return new Sign(algorithm);\n }\n function createVerify(algorithm) {\n return new Verify(algorithm);\n }\n module.exports = {\n Sign: createSign,\n Verify: createVerify,\n createSign,\n createVerify,\n };\n },\n});\n\n// node_modules/create-ecdh/node_modules/bn.js/lib/bn.js\nvar require_bn6 = __commonJS({\n \"node_modules/create-ecdh/node_modules/bn.js/lib/bn.js\"(exports, module) {\n (function (module2, exports2) {\n \"use strict\";\n function assert(val, msg) {\n if (!val) throw new Error(msg || \"Assertion failed\");\n }\n function inherits(ctor, superCtor) {\n ctor.super_ = superCtor;\n var TempCtor = function () {};\n (TempCtor.prototype = superCtor.prototype),\n (ctor.prototype = new TempCtor()),\n (ctor.prototype.constructor = ctor);\n }\n function BN(number, base, endian) {\n if (BN.isBN(number)) return number;\n (this.negative = 0),\n (this.words = null),\n (this.length = 0),\n (this.red = null),\n number !== null &&\n ((base === \"le\" || base === \"be\") && ((endian = base), (base = 10)),\n this._init(number || 0, base || 10, endian || \"be\"));\n }\n typeof module2 == \"object\" ? (module2.exports = BN) : (exports2.BN = BN), (BN.BN = BN), (BN.wordSize = 26);\n var Buffer2;\n try {\n typeof window < \"u\" && typeof window.Buffer < \"u\"\n ? (Buffer2 = window.Buffer)\n : (Buffer2 = __require(\"buffer\").Buffer);\n } catch {}\n (BN.isBN = function (num) {\n return num instanceof BN\n ? !0\n : num !== null &&\n typeof num == \"object\" &&\n num.constructor.wordSize === BN.wordSize &&\n Array.isArray(num.words);\n }),\n (BN.max = function (left, right) {\n return left.cmp(right) > 0 ? left : right;\n }),\n (BN.min = function (left, right) {\n return left.cmp(right) < 0 ? left : right;\n }),\n (BN.prototype._init = function (number, base, endian) {\n if (typeof number == \"number\") return this._initNumber(number, base, endian);\n if (typeof number == \"object\") return this._initArray(number, base, endian);\n base === \"hex\" && (base = 16),\n assert(base === (base | 0) && base >= 2 && base <= 36),\n (number = number.toString().replace(/\\s+/g, \"\"));\n var start = 0;\n number[0] === \"-\" && (start++, (this.negative = 1)),\n start < number.length &&\n (base === 16\n ? this._parseHex(number, start, endian)\n : (this._parseBase(number, base, start),\n endian === \"le\" && this._initArray(this.toArray(), base, endian)));\n }),\n (BN.prototype._initNumber = function (number, base, endian) {\n number < 0 && ((this.negative = 1), (number = -number)),\n number < 67108864\n ? ((this.words = [number & 67108863]), (this.length = 1))\n : number < 4503599627370496\n ? ((this.words = [number & 67108863, (number / 67108864) & 67108863]), (this.length = 2))\n : (assert(number < 9007199254740992),\n (this.words = [number & 67108863, (number / 67108864) & 67108863, 1]),\n (this.length = 3)),\n endian === \"le\" && this._initArray(this.toArray(), base, endian);\n }),\n (BN.prototype._initArray = function (number, base, endian) {\n if ((assert(typeof number.length == \"number\"), number.length <= 0))\n return (this.words = [0]), (this.length = 1), this;\n (this.length = Math.ceil(number.length / 3)), (this.words = new Array(this.length));\n for (var i = 0; i < this.length; i++) this.words[i] = 0;\n var j,\n w,\n off = 0;\n if (endian === \"be\")\n for (i = number.length - 1, j = 0; i >= 0; i -= 3)\n (w = number[i] | (number[i - 1] << 8) | (number[i - 2] << 16)),\n (this.words[j] |= (w << off) & 67108863),\n (this.words[j + 1] = (w >>> (26 - off)) & 67108863),\n (off += 24),\n off >= 26 && ((off -= 26), j++);\n else if (endian === \"le\")\n for (i = 0, j = 0; i < number.length; i += 3)\n (w = number[i] | (number[i + 1] << 8) | (number[i + 2] << 16)),\n (this.words[j] |= (w << off) & 67108863),\n (this.words[j + 1] = (w >>> (26 - off)) & 67108863),\n (off += 24),\n off >= 26 && ((off -= 26), j++);\n return this.strip();\n });\n function parseHex4Bits(string, index) {\n var c = string.charCodeAt(index);\n return c >= 65 && c <= 70 ? c - 55 : c >= 97 && c <= 102 ? c - 87 : (c - 48) & 15;\n }\n function parseHexByte(string, lowerBound, index) {\n var r = parseHex4Bits(string, index);\n return index - 1 >= lowerBound && (r |= parseHex4Bits(string, index - 1) << 4), r;\n }\n BN.prototype._parseHex = function (number, start, endian) {\n (this.length = Math.ceil((number.length - start) / 6)), (this.words = new Array(this.length));\n for (var i = 0; i < this.length; i++) this.words[i] = 0;\n var off = 0,\n j = 0,\n w;\n if (endian === \"be\")\n for (i = number.length - 1; i >= start; i -= 2)\n (w = parseHexByte(number, start, i) << off),\n (this.words[j] |= w & 67108863),\n off >= 18 ? ((off -= 18), (j += 1), (this.words[j] |= w >>> 26)) : (off += 8);\n else {\n var parseLength = number.length - start;\n for (i = parseLength % 2 === 0 ? start + 1 : start; i < number.length; i += 2)\n (w = parseHexByte(number, start, i) << off),\n (this.words[j] |= w & 67108863),\n off >= 18 ? ((off -= 18), (j += 1), (this.words[j] |= w >>> 26)) : (off += 8);\n }\n this.strip();\n };\n function parseBase(str, start, end, mul) {\n for (var r = 0, len = Math.min(str.length, end), i = start; i < len; i++) {\n var c = str.charCodeAt(i) - 48;\n (r *= mul), c >= 49 ? (r += c - 49 + 10) : c >= 17 ? (r += c - 17 + 10) : (r += c);\n }\n return r;\n }\n (BN.prototype._parseBase = function (number, base, start) {\n (this.words = [0]), (this.length = 1);\n for (var limbLen = 0, limbPow = 1; limbPow <= 67108863; limbPow *= base) limbLen++;\n limbLen--, (limbPow = (limbPow / base) | 0);\n for (\n var total = number.length - start,\n mod = total % limbLen,\n end = Math.min(total, total - mod) + start,\n word = 0,\n i = start;\n i < end;\n i += limbLen\n )\n (word = parseBase(number, i, i + limbLen, base)),\n this.imuln(limbPow),\n this.words[0] + word < 67108864 ? (this.words[0] += word) : this._iaddn(word);\n if (mod !== 0) {\n var pow = 1;\n for (word = parseBase(number, i, number.length, base), i = 0; i < mod; i++) pow *= base;\n this.imuln(pow), this.words[0] + word < 67108864 ? (this.words[0] += word) : this._iaddn(word);\n }\n this.strip();\n }),\n (BN.prototype.copy = function (dest) {\n dest.words = new Array(this.length);\n for (var i = 0; i < this.length; i++) dest.words[i] = this.words[i];\n (dest.length = this.length), (dest.negative = this.negative), (dest.red = this.red);\n }),\n (BN.prototype.clone = function () {\n var r = new BN(null);\n return this.copy(r), r;\n }),\n (BN.prototype._expand = function (size) {\n for (; this.length < size; ) this.words[this.length++] = 0;\n return this;\n }),\n (BN.prototype.strip = function () {\n for (; this.length > 1 && this.words[this.length - 1] === 0; ) this.length--;\n return this._normSign();\n }),\n (BN.prototype._normSign = function () {\n return this.length === 1 && this.words[0] === 0 && (this.negative = 0), this;\n }),\n (BN.prototype.inspect = function () {\n return (this.red ? \"<BN-R: \" : \"<BN: \") + this.toString(16) + \">\";\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 groupSizes = [\n 0, 0, 25, 16, 12, 11, 10, 9, 8, 8, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5,\n 5, 5,\n ],\n groupBases = [\n 0, 0, 33554432, 43046721, 16777216, 48828125, 60466176, 40353607, 16777216, 43046721, 1e7, 19487171, 35831808,\n 62748517, 7529536, 11390625, 16777216, 24137569, 34012224, 47045881, 64e6, 4084101, 5153632, 6436343, 7962624,\n 9765625, 11881376, 14348907, 17210368, 20511149, 243e5, 28629151, 33554432, 39135393, 45435424, 52521875,\n 60466176,\n ];\n (BN.prototype.toString = function (base, padding) {\n (base = base || 10), (padding = padding | 0 || 1);\n var out;\n if (base === 16 || base === \"hex\") {\n out = \"\";\n for (var off = 0, carry = 0, i = 0; i < this.length; i++) {\n var w = this.words[i],\n word = (((w << off) | carry) & 16777215).toString(16);\n (carry = (w >>> (24 - off)) & 16777215),\n carry !== 0 || i !== this.length - 1 ? (out = zeros[6 - word.length] + word + out) : (out = word + out),\n (off += 2),\n off >= 26 && ((off -= 26), i--);\n }\n for (carry !== 0 && (out = carry.toString(16) + out); out.length % padding !== 0; ) out = \"0\" + out;\n return this.negative !== 0 && (out = \"-\" + out), out;\n }\n if (base === (base | 0) && base >= 2 && base <= 36) {\n var groupSize = groupSizes[base],\n groupBase = groupBases[base];\n out = \"\";\n var c = this.clone();\n for (c.negative = 0; !c.isZero(); ) {\n var r = c.modn(groupBase).toString(base);\n (c = c.idivn(groupBase)), c.isZero() ? (out = r + out) : (out = zeros[groupSize - r.length] + r + out);\n }\n for (this.isZero() && (out = \"0\" + out); out.length % padding !== 0; ) out = \"0\" + out;\n return this.negative !== 0 && (out = \"-\" + out), out;\n }\n assert(!1, \"Base should be between 2 and 36\");\n }),\n (BN.prototype.toNumber = function () {\n var ret = this.words[0];\n return (\n this.length === 2\n ? (ret += this.words[1] * 67108864)\n : this.length === 3 && this.words[2] === 1\n ? (ret += 4503599627370496 + this.words[1] * 67108864)\n : this.length > 2 && assert(!1, \"Number can only safely store up to 53 bits\"),\n this.negative !== 0 ? -ret : ret\n );\n }),\n (BN.prototype.toJSON = function () {\n return this.toString(16);\n }),\n (BN.prototype.toBuffer = function (endian, length) {\n return assert(typeof Buffer2 < \"u\"), this.toArrayLike(Buffer2, endian, length);\n }),\n (BN.prototype.toArray = function (endian, length) {\n return this.toArrayLike(Array, endian, length);\n }),\n (BN.prototype.toArrayLike = function (ArrayType, endian, length) {\n var byteLength = this.byteLength(),\n 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 this.strip();\n var littleEndian = endian === \"le\",\n res = new ArrayType(reqLength),\n b,\n i,\n q = this.clone();\n if (littleEndian) {\n for (i = 0; !q.isZero(); i++) (b = q.andln(255)), q.iushrn(8), (res[i] = b);\n for (; i < reqLength; i++) res[i] = 0;\n } else {\n for (i = 0; i < reqLength - byteLength; i++) res[i] = 0;\n for (i = 0; !q.isZero(); i++) (b = q.andln(255)), q.iushrn(8), (res[reqLength - i - 1] = b);\n }\n return res;\n }),\n Math.clz32\n ? (BN.prototype._countBits = function (w) {\n return 32 - Math.clz32(w);\n })\n : (BN.prototype._countBits = function (w) {\n var t = w,\n r = 0;\n return (\n t >= 4096 && ((r += 13), (t >>>= 13)),\n t >= 64 && ((r += 7), (t >>>= 7)),\n t >= 8 && ((r += 4), (t >>>= 4)),\n t >= 2 && ((r += 2), (t >>>= 2)),\n r + t\n );\n }),\n (BN.prototype._zeroBits = function (w) {\n if (w === 0) return 26;\n var t = w,\n r = 0;\n return (\n (t & 8191) === 0 && ((r += 13), (t >>>= 13)),\n (t & 127) === 0 && ((r += 7), (t >>>= 7)),\n (t & 15) === 0 && ((r += 4), (t >>>= 4)),\n (t & 3) === 0 && ((r += 2), (t >>>= 2)),\n (t & 1) === 0 && r++,\n r\n );\n }),\n (BN.prototype.bitLength = function () {\n var w = this.words[this.length - 1],\n hi = this._countBits(w);\n return (this.length - 1) * 26 + hi;\n });\n function toBitArray(num) {\n for (var w = new Array(num.bitLength()), bit = 0; bit < w.length; bit++) {\n var off = (bit / 26) | 0,\n wbit = bit % 26;\n w[bit] = (num.words[off] & (1 << wbit)) >>> wbit;\n }\n return w;\n }\n (BN.prototype.zeroBits = function () {\n if (this.isZero()) return 0;\n for (var r = 0, i = 0; i < this.length; i++) {\n var b = this._zeroBits(this.words[i]);\n if (((r += b), b !== 26)) break;\n }\n return r;\n }),\n (BN.prototype.byteLength = function () {\n return Math.ceil(this.bitLength() / 8);\n }),\n (BN.prototype.toTwos = function (width) {\n return this.negative !== 0 ? this.abs().inotn(width).iaddn(1) : this.clone();\n }),\n (BN.prototype.fromTwos = function (width) {\n return this.testn(width - 1) ? this.notn(width).iaddn(1).ineg() : this.clone();\n }),\n (BN.prototype.isNeg = function () {\n return this.negative !== 0;\n }),\n (BN.prototype.neg = function () {\n return this.clone().ineg();\n }),\n (BN.prototype.ineg = function () {\n return this.isZero() || (this.negative ^= 1), this;\n }),\n (BN.prototype.iuor = function (num) {\n for (; this.length < num.length; ) this.words[this.length++] = 0;\n for (var i = 0; i < num.length; i++) this.words[i] = this.words[i] | num.words[i];\n return this.strip();\n }),\n (BN.prototype.ior = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuor(num);\n }),\n (BN.prototype.or = function (num) {\n return this.length > num.length ? this.clone().ior(num) : num.clone().ior(this);\n }),\n (BN.prototype.uor = function (num) {\n return this.length > num.length ? this.clone().iuor(num) : num.clone().iuor(this);\n }),\n (BN.prototype.iuand = function (num) {\n var b;\n this.length > num.length ? (b = num) : (b = this);\n for (var i = 0; i < b.length; i++) this.words[i] = this.words[i] & num.words[i];\n return (this.length = b.length), this.strip();\n }),\n (BN.prototype.iand = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuand(num);\n }),\n (BN.prototype.and = function (num) {\n return this.length > num.length ? this.clone().iand(num) : num.clone().iand(this);\n }),\n (BN.prototype.uand = function (num) {\n return this.length > num.length ? this.clone().iuand(num) : num.clone().iuand(this);\n }),\n (BN.prototype.iuxor = function (num) {\n var a, b;\n this.length > num.length ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var i = 0; i < b.length; i++) this.words[i] = a.words[i] ^ b.words[i];\n if (this !== a) for (; i < a.length; i++) this.words[i] = a.words[i];\n return (this.length = a.length), this.strip();\n }),\n (BN.prototype.ixor = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuxor(num);\n }),\n (BN.prototype.xor = function (num) {\n return this.length > num.length ? this.clone().ixor(num) : num.clone().ixor(this);\n }),\n (BN.prototype.uxor = function (num) {\n return this.length > num.length ? this.clone().iuxor(num) : num.clone().iuxor(this);\n }),\n (BN.prototype.inotn = function (width) {\n assert(typeof width == \"number\" && width >= 0);\n var bytesNeeded = Math.ceil(width / 26) | 0,\n bitsLeft = width % 26;\n this._expand(bytesNeeded), bitsLeft > 0 && bytesNeeded--;\n for (var i = 0; i < bytesNeeded; i++) this.words[i] = ~this.words[i] & 67108863;\n return bitsLeft > 0 && (this.words[i] = ~this.words[i] & (67108863 >> (26 - bitsLeft))), this.strip();\n }),\n (BN.prototype.notn = function (width) {\n return this.clone().inotn(width);\n }),\n (BN.prototype.setn = function (bit, val) {\n assert(typeof bit == \"number\" && bit >= 0);\n var off = (bit / 26) | 0,\n wbit = bit % 26;\n return (\n this._expand(off + 1),\n val\n ? (this.words[off] = this.words[off] | (1 << wbit))\n : (this.words[off] = this.words[off] & ~(1 << wbit)),\n this.strip()\n );\n }),\n (BN.prototype.iadd = function (num) {\n var r;\n if (this.negative !== 0 && num.negative === 0)\n return (this.negative = 0), (r = this.isub(num)), (this.negative ^= 1), this._normSign();\n if (this.negative === 0 && num.negative !== 0)\n return (num.negative = 0), (r = this.isub(num)), (num.negative = 1), r._normSign();\n var a, b;\n this.length > num.length ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var carry = 0, i = 0; i < b.length; i++)\n (r = (a.words[i] | 0) + (b.words[i] | 0) + carry), (this.words[i] = r & 67108863), (carry = r >>> 26);\n for (; carry !== 0 && i < a.length; i++)\n (r = (a.words[i] | 0) + carry), (this.words[i] = r & 67108863), (carry = r >>> 26);\n if (((this.length = a.length), carry !== 0)) (this.words[this.length] = carry), this.length++;\n else if (a !== this) for (; i < a.length; i++) this.words[i] = a.words[i];\n return this;\n }),\n (BN.prototype.add = function (num) {\n var res;\n return num.negative !== 0 && this.negative === 0\n ? ((num.negative = 0), (res = this.sub(num)), (num.negative ^= 1), res)\n : num.negative === 0 && this.negative !== 0\n ? ((this.negative = 0), (res = num.sub(this)), (this.negative = 1), res)\n : this.length > num.length\n ? this.clone().iadd(num)\n : num.clone().iadd(this);\n }),\n (BN.prototype.isub = function (num) {\n if (num.negative !== 0) {\n num.negative = 0;\n var r = this.iadd(num);\n return (num.negative = 1), r._normSign();\n } else if (this.negative !== 0)\n return (this.negative = 0), this.iadd(num), (this.negative = 1), this._normSign();\n var cmp = this.cmp(num);\n if (cmp === 0) return (this.negative = 0), (this.length = 1), (this.words[0] = 0), this;\n var a, b;\n cmp > 0 ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var carry = 0, i = 0; i < b.length; i++)\n (r = (a.words[i] | 0) - (b.words[i] | 0) + carry), (carry = r >> 26), (this.words[i] = r & 67108863);\n for (; carry !== 0 && i < a.length; i++)\n (r = (a.words[i] | 0) + carry), (carry = r >> 26), (this.words[i] = r & 67108863);\n if (carry === 0 && i < a.length && a !== this) for (; i < a.length; i++) this.words[i] = a.words[i];\n return (this.length = Math.max(this.length, i)), a !== this && (this.negative = 1), this.strip();\n }),\n (BN.prototype.sub = function (num) {\n return this.clone().isub(num);\n });\n function smallMulTo(self2, num, out) {\n out.negative = num.negative ^ self2.negative;\n var len = (self2.length + num.length) | 0;\n (out.length = len), (len = (len - 1) | 0);\n var a = self2.words[0] | 0,\n b = num.words[0] | 0,\n r = a * b,\n lo = r & 67108863,\n carry = (r / 67108864) | 0;\n out.words[0] = lo;\n for (var k = 1; k < len; k++) {\n for (\n var ncarry = carry >>> 26,\n rword = carry & 67108863,\n maxJ = Math.min(k, num.length - 1),\n j = Math.max(0, k - self2.length + 1);\n j <= maxJ;\n j++\n ) {\n var i = (k - j) | 0;\n (a = self2.words[i] | 0),\n (b = num.words[j] | 0),\n (r = a * b + rword),\n (ncarry += (r / 67108864) | 0),\n (rword = r & 67108863);\n }\n (out.words[k] = rword | 0), (carry = ncarry | 0);\n }\n return carry !== 0 ? (out.words[k] = carry | 0) : out.length--, out.strip();\n }\n var comb10MulTo = function (self2, num, out) {\n var a = self2.words,\n b = num.words,\n o = out.words,\n c = 0,\n lo,\n mid,\n hi,\n a0 = a[0] | 0,\n al0 = a0 & 8191,\n ah0 = a0 >>> 13,\n a1 = a[1] | 0,\n al1 = a1 & 8191,\n ah1 = a1 >>> 13,\n a2 = a[2] | 0,\n al2 = a2 & 8191,\n ah2 = a2 >>> 13,\n a3 = a[3] | 0,\n al3 = a3 & 8191,\n ah3 = a3 >>> 13,\n a4 = a[4] | 0,\n al4 = a4 & 8191,\n ah4 = a4 >>> 13,\n a5 = a[5] | 0,\n al5 = a5 & 8191,\n ah5 = a5 >>> 13,\n a6 = a[6] | 0,\n al6 = a6 & 8191,\n ah6 = a6 >>> 13,\n a7 = a[7] | 0,\n al7 = a7 & 8191,\n ah7 = a7 >>> 13,\n a8 = a[8] | 0,\n al8 = a8 & 8191,\n ah8 = a8 >>> 13,\n a9 = a[9] | 0,\n al9 = a9 & 8191,\n ah9 = a9 >>> 13,\n b0 = b[0] | 0,\n bl0 = b0 & 8191,\n bh0 = b0 >>> 13,\n b1 = b[1] | 0,\n bl1 = b1 & 8191,\n bh1 = b1 >>> 13,\n b2 = b[2] | 0,\n bl2 = b2 & 8191,\n bh2 = b2 >>> 13,\n b3 = b[3] | 0,\n bl3 = b3 & 8191,\n bh3 = b3 >>> 13,\n b4 = b[4] | 0,\n bl4 = b4 & 8191,\n bh4 = b4 >>> 13,\n b5 = b[5] | 0,\n bl5 = b5 & 8191,\n bh5 = b5 >>> 13,\n b6 = b[6] | 0,\n bl6 = b6 & 8191,\n bh6 = b6 >>> 13,\n b7 = b[7] | 0,\n bl7 = b7 & 8191,\n bh7 = b7 >>> 13,\n b8 = b[8] | 0,\n bl8 = b8 & 8191,\n bh8 = b8 >>> 13,\n b9 = b[9] | 0,\n bl9 = b9 & 8191,\n bh9 = b9 >>> 13;\n (out.negative = self2.negative ^ num.negative),\n (out.length = 19),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w0 >>> 26)) | 0),\n (w0 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w1 >>> 26)) | 0),\n (w1 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w2 >>> 26)) | 0),\n (w2 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w3 >>> 26)) | 0),\n (w3 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w4 >>> 26)) | 0),\n (w4 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w5 >>> 26)) | 0),\n (w5 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w6 >>> 26)) | 0),\n (w6 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w7 >>> 26)) | 0),\n (w7 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w8 >>> 26)) | 0),\n (w8 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w9 >>> 26)) | 0),\n (w9 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w10 >>> 26)) | 0),\n (w10 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w11 >>> 26)) | 0),\n (w11 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w12 >>> 26)) | 0),\n (w12 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w13 >>> 26)) | 0),\n (w13 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w14 >>> 26)) | 0),\n (w14 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w15 >>> 26)) | 0),\n (w15 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w16 >>> 26)) | 0),\n (w16 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w17 >>> 26)) | 0),\n (w17 &= 67108863),\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 & 8191) << 13)) | 0;\n return (\n (c = (((hi + (mid >>> 13)) | 0) + (w18 >>> 26)) | 0),\n (w18 &= 67108863),\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 c !== 0 && ((o[19] = c), out.length++),\n out\n );\n };\n Math.imul || (comb10MulTo = smallMulTo);\n function bigMulTo(self2, num, out) {\n (out.negative = num.negative ^ self2.negative), (out.length = self2.length + num.length);\n for (var carry = 0, hncarry = 0, k = 0; k < out.length - 1; k++) {\n var ncarry = hncarry;\n hncarry = 0;\n for (\n var rword = carry & 67108863, maxJ = Math.min(k, num.length - 1), j = Math.max(0, k - self2.length + 1);\n j <= maxJ;\n j++\n ) {\n var i = k - j,\n a = self2.words[i] | 0,\n b = num.words[j] | 0,\n r = a * b,\n lo = r & 67108863;\n (ncarry = (ncarry + ((r / 67108864) | 0)) | 0),\n (lo = (lo + rword) | 0),\n (rword = lo & 67108863),\n (ncarry = (ncarry + (lo >>> 26)) | 0),\n (hncarry += ncarry >>> 26),\n (ncarry &= 67108863);\n }\n (out.words[k] = rword), (carry = ncarry), (ncarry = hncarry);\n }\n return carry !== 0 ? (out.words[k] = carry) : out.length--, out.strip();\n }\n function jumboMulTo(self2, num, out) {\n var fftm = new FFTM();\n return fftm.mulp(self2, num, out);\n }\n BN.prototype.mulTo = function (num, out) {\n var res,\n len = this.length + num.length;\n return (\n this.length === 10 && num.length === 10\n ? (res = comb10MulTo(this, num, out))\n : len < 63\n ? (res = smallMulTo(this, num, out))\n : len < 1024\n ? (res = bigMulTo(this, num, out))\n : (res = jumboMulTo(this, num, out)),\n res\n );\n };\n function FFTM(x, y) {\n (this.x = x), (this.y = y);\n }\n (FFTM.prototype.makeRBT = function (N) {\n for (var t = new Array(N), l = BN.prototype._countBits(N) - 1, i = 0; i < N; i++) t[i] = this.revBin(i, l, N);\n return t;\n }),\n (FFTM.prototype.revBin = function (x, l, N) {\n if (x === 0 || x === N - 1) return x;\n for (var rb = 0, i = 0; i < l; i++) (rb |= (x & 1) << (l - i - 1)), (x >>= 1);\n return rb;\n }),\n (FFTM.prototype.permute = function (rbt, rws, iws, rtws, itws, N) {\n for (var i = 0; i < N; i++) (rtws[i] = rws[rbt[i]]), (itws[i] = iws[rbt[i]]);\n }),\n (FFTM.prototype.transform = function (rws, iws, rtws, itws, N, rbt) {\n this.permute(rbt, rws, iws, rtws, itws, N);\n for (var s = 1; s < N; s <<= 1)\n for (\n var l = s << 1, rtwdf = Math.cos((2 * Math.PI) / l), itwdf = Math.sin((2 * Math.PI) / l), p = 0;\n p < N;\n p += l\n )\n for (var rtwdf_ = rtwdf, itwdf_ = itwdf, j = 0; j < s; j++) {\n var re = rtws[p + j],\n ie = itws[p + j],\n ro = rtws[p + j + s],\n io = itws[p + j + s],\n rx = rtwdf_ * ro - itwdf_ * io;\n (io = rtwdf_ * io + itwdf_ * ro),\n (ro = rx),\n (rtws[p + j] = re + ro),\n (itws[p + j] = ie + io),\n (rtws[p + j + s] = re - ro),\n (itws[p + j + s] = ie - io),\n j !== l &&\n ((rx = rtwdf * rtwdf_ - itwdf * itwdf_), (itwdf_ = rtwdf * itwdf_ + itwdf * rtwdf_), (rtwdf_ = rx));\n }\n }),\n (FFTM.prototype.guessLen13b = function (n, m) {\n var N = Math.max(m, n) | 1,\n odd = N & 1,\n i = 0;\n for (N = (N / 2) | 0; N; N = N >>> 1) i++;\n return 1 << (i + 1 + odd);\n }),\n (FFTM.prototype.conjugate = function (rws, iws, N) {\n if (!(N <= 1))\n for (var i = 0; i < N / 2; i++) {\n var t = rws[i];\n (rws[i] = rws[N - i - 1]),\n (rws[N - i - 1] = t),\n (t = iws[i]),\n (iws[i] = -iws[N - i - 1]),\n (iws[N - i - 1] = -t);\n }\n }),\n (FFTM.prototype.normalize13b = function (ws, N) {\n for (var carry = 0, i = 0; i < N / 2; i++) {\n var w = Math.round(ws[2 * i + 1] / N) * 8192 + Math.round(ws[2 * i] / N) + carry;\n (ws[i] = w & 67108863), w < 67108864 ? (carry = 0) : (carry = (w / 67108864) | 0);\n }\n return ws;\n }),\n (FFTM.prototype.convert13b = function (ws, len, rws, N) {\n for (var carry = 0, i = 0; i < len; i++)\n (carry = carry + (ws[i] | 0)),\n (rws[2 * i] = carry & 8191),\n (carry = carry >>> 13),\n (rws[2 * i + 1] = carry & 8191),\n (carry = carry >>> 13);\n for (i = 2 * len; i < N; ++i) rws[i] = 0;\n assert(carry === 0), assert((carry & -8192) === 0);\n }),\n (FFTM.prototype.stub = function (N) {\n for (var ph = new Array(N), i = 0; i < N; i++) ph[i] = 0;\n return ph;\n }),\n (FFTM.prototype.mulp = function (x, y, out) {\n var N = 2 * this.guessLen13b(x.length, y.length),\n rbt = this.makeRBT(N),\n _ = this.stub(N),\n rws = new Array(N),\n rwst = new Array(N),\n iwst = new Array(N),\n nrws = new Array(N),\n nrwst = new Array(N),\n niwst = new Array(N),\n rmws = out.words;\n (rmws.length = N),\n this.convert13b(x.words, x.length, rws, N),\n this.convert13b(y.words, y.length, nrws, N),\n this.transform(rws, _, rwst, iwst, N, rbt),\n this.transform(nrws, _, nrwst, niwst, N, rbt);\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]), (rwst[i] = rx);\n }\n return (\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 (out.negative = x.negative ^ y.negative),\n (out.length = x.length + y.length),\n out.strip()\n );\n }),\n (BN.prototype.mul = function (num) {\n var out = new BN(null);\n return (out.words = new Array(this.length + num.length)), this.mulTo(num, out);\n }),\n (BN.prototype.mulf = function (num) {\n var out = new BN(null);\n return (out.words = new Array(this.length + num.length)), jumboMulTo(this, num, out);\n }),\n (BN.prototype.imul = function (num) {\n return this.clone().mulTo(num, this);\n }),\n (BN.prototype.imuln = function (num) {\n assert(typeof num == \"number\"), assert(num < 67108864);\n for (var carry = 0, i = 0; i < this.length; i++) {\n var w = (this.words[i] | 0) * num,\n lo = (w & 67108863) + (carry & 67108863);\n (carry >>= 26), (carry += (w / 67108864) | 0), (carry += lo >>> 26), (this.words[i] = lo & 67108863);\n }\n return carry !== 0 && ((this.words[i] = carry), this.length++), this;\n }),\n (BN.prototype.muln = function (num) {\n return this.clone().imuln(num);\n }),\n (BN.prototype.sqr = function () {\n return this.mul(this);\n }),\n (BN.prototype.isqr = function () {\n return this.imul(this.clone());\n }),\n (BN.prototype.pow = function (num) {\n var w = toBitArray(num);\n if (w.length === 0) return new BN(1);\n for (var res = this, i = 0; i < w.length && w[i] === 0; i++, res = res.sqr());\n if (++i < w.length) for (var q = res.sqr(); i < w.length; i++, q = q.sqr()) w[i] !== 0 && (res = res.mul(q));\n return res;\n }),\n (BN.prototype.iushln = function (bits) {\n assert(typeof bits == \"number\" && bits >= 0);\n var r = bits % 26,\n s = (bits - r) / 26,\n carryMask = (67108863 >>> (26 - r)) << (26 - r),\n i;\n if (r !== 0) {\n var carry = 0;\n for (i = 0; i < this.length; i++) {\n var newCarry = this.words[i] & carryMask,\n c = ((this.words[i] | 0) - newCarry) << r;\n (this.words[i] = c | carry), (carry = newCarry >>> (26 - r));\n }\n carry && ((this.words[i] = carry), this.length++);\n }\n if (s !== 0) {\n for (i = this.length - 1; i >= 0; i--) this.words[i + s] = this.words[i];\n for (i = 0; i < s; i++) this.words[i] = 0;\n this.length += s;\n }\n return this.strip();\n }),\n (BN.prototype.ishln = function (bits) {\n return assert(this.negative === 0), this.iushln(bits);\n }),\n (BN.prototype.iushrn = function (bits, hint, extended) {\n assert(typeof bits == \"number\" && bits >= 0);\n var h;\n hint ? (h = (hint - (hint % 26)) / 26) : (h = 0);\n var r = bits % 26,\n s = Math.min((bits - r) / 26, this.length),\n mask = 67108863 ^ ((67108863 >>> r) << r),\n maskedWords = extended;\n if (((h -= s), (h = Math.max(0, h)), maskedWords)) {\n for (var i = 0; i < s; i++) maskedWords.words[i] = this.words[i];\n maskedWords.length = s;\n }\n if (s !== 0)\n if (this.length > s) for (this.length -= s, i = 0; i < this.length; i++) this.words[i] = this.words[i + s];\n else (this.words[0] = 0), (this.length = 1);\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)), (carry = word & mask);\n }\n return (\n maskedWords && carry !== 0 && (maskedWords.words[maskedWords.length++] = carry),\n this.length === 0 && ((this.words[0] = 0), (this.length = 1)),\n this.strip()\n );\n }),\n (BN.prototype.ishrn = function (bits, hint, extended) {\n return assert(this.negative === 0), this.iushrn(bits, hint, extended);\n }),\n (BN.prototype.shln = function (bits) {\n return this.clone().ishln(bits);\n }),\n (BN.prototype.ushln = function (bits) {\n return this.clone().iushln(bits);\n }),\n (BN.prototype.shrn = function (bits) {\n return this.clone().ishrn(bits);\n }),\n (BN.prototype.ushrn = function (bits) {\n return this.clone().iushrn(bits);\n }),\n (BN.prototype.testn = function (bit) {\n assert(typeof bit == \"number\" && bit >= 0);\n var r = bit % 26,\n s = (bit - r) / 26,\n q = 1 << r;\n if (this.length <= s) return !1;\n var w = this.words[s];\n return !!(w & q);\n }),\n (BN.prototype.imaskn = function (bits) {\n assert(typeof bits == \"number\" && bits >= 0);\n var r = bits % 26,\n s = (bits - r) / 26;\n if ((assert(this.negative === 0, \"imaskn works only with positive numbers\"), this.length <= s)) return this;\n if ((r !== 0 && s++, (this.length = Math.min(s, this.length)), r !== 0)) {\n var mask = 67108863 ^ ((67108863 >>> r) << r);\n this.words[this.length - 1] &= mask;\n }\n return this.strip();\n }),\n (BN.prototype.maskn = function (bits) {\n return this.clone().imaskn(bits);\n }),\n (BN.prototype.iaddn = function (num) {\n return (\n assert(typeof num == \"number\"),\n assert(num < 67108864),\n num < 0\n ? this.isubn(-num)\n : this.negative !== 0\n ? this.length === 1 && (this.words[0] | 0) < num\n ? ((this.words[0] = num - (this.words[0] | 0)), (this.negative = 0), this)\n : ((this.negative = 0), this.isubn(num), (this.negative = 1), this)\n : this._iaddn(num)\n );\n }),\n (BN.prototype._iaddn = function (num) {\n this.words[0] += num;\n for (var i = 0; i < this.length && this.words[i] >= 67108864; i++)\n (this.words[i] -= 67108864), i === this.length - 1 ? (this.words[i + 1] = 1) : this.words[i + 1]++;\n return (this.length = Math.max(this.length, i + 1)), this;\n }),\n (BN.prototype.isubn = function (num) {\n if ((assert(typeof num == \"number\"), assert(num < 67108864), num < 0)) return this.iaddn(-num);\n if (this.negative !== 0) return (this.negative = 0), this.iaddn(num), (this.negative = 1), this;\n if (((this.words[0] -= num), this.length === 1 && this.words[0] < 0))\n (this.words[0] = -this.words[0]), (this.negative = 1);\n else\n for (var i = 0; i < this.length && this.words[i] < 0; i++)\n (this.words[i] += 67108864), (this.words[i + 1] -= 1);\n return this.strip();\n }),\n (BN.prototype.addn = function (num) {\n return this.clone().iaddn(num);\n }),\n (BN.prototype.subn = function (num) {\n return this.clone().isubn(num);\n }),\n (BN.prototype.iabs = function () {\n return (this.negative = 0), this;\n }),\n (BN.prototype.abs = function () {\n return this.clone().iabs();\n }),\n (BN.prototype._ishlnsubmul = function (num, mul, shift) {\n var len = num.length + shift,\n i;\n this._expand(len);\n var w,\n 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 & 67108863),\n (carry = (w >> 26) - ((right / 67108864) | 0)),\n (this.words[i + shift] = w & 67108863);\n }\n for (; i < this.length - shift; i++)\n (w = (this.words[i + shift] | 0) + carry), (carry = w >> 26), (this.words[i + shift] = w & 67108863);\n if (carry === 0) return this.strip();\n for (assert(carry === -1), carry = 0, i = 0; i < this.length; i++)\n (w = -(this.words[i] | 0) + carry), (carry = w >> 26), (this.words[i] = w & 67108863);\n return (this.negative = 1), this.strip();\n }),\n (BN.prototype._wordDiv = function (num, mode) {\n var shift = this.length - num.length,\n a = this.clone(),\n b = num,\n bhi = b.words[b.length - 1] | 0,\n bhiBits = this._countBits(bhi);\n (shift = 26 - bhiBits),\n shift !== 0 && ((b = b.ushln(shift)), a.iushln(shift), (bhi = b.words[b.length - 1] | 0));\n var m = a.length - b.length,\n q;\n if (mode !== \"mod\") {\n (q = new BN(null)), (q.length = m + 1), (q.words = new Array(q.length));\n for (var i = 0; i < q.length; i++) q.words[i] = 0;\n }\n var diff = a.clone()._ishlnsubmul(b, 1, m);\n diff.negative === 0 && ((a = diff), q && (q.words[m] = 1));\n for (var j = m - 1; j >= 0; j--) {\n var qj = (a.words[b.length + j] | 0) * 67108864 + (a.words[b.length + j - 1] | 0);\n for (qj = Math.min((qj / bhi) | 0, 67108863), a._ishlnsubmul(b, qj, j); a.negative !== 0; )\n qj--, (a.negative = 0), a._ishlnsubmul(b, 1, j), a.isZero() || (a.negative ^= 1);\n q && (q.words[j] = qj);\n }\n return (\n q && q.strip(),\n a.strip(),\n mode !== \"div\" && shift !== 0 && a.iushrn(shift),\n {\n div: q || null,\n mod: a,\n }\n );\n }),\n (BN.prototype.divmod = function (num, mode, positive) {\n if ((assert(!num.isZero()), this.isZero()))\n return {\n div: new BN(0),\n mod: new BN(0),\n };\n var div, mod, res;\n return this.negative !== 0 && num.negative === 0\n ? ((res = this.neg().divmod(num, mode)),\n mode !== \"mod\" && (div = res.div.neg()),\n mode !== \"div\" && ((mod = res.mod.neg()), positive && mod.negative !== 0 && mod.iadd(num)),\n {\n div,\n mod,\n })\n : this.negative === 0 && num.negative !== 0\n ? ((res = this.divmod(num.neg(), mode)),\n mode !== \"mod\" && (div = res.div.neg()),\n {\n div,\n mod: res.mod,\n })\n : (this.negative & num.negative) !== 0\n ? ((res = this.neg().divmod(num.neg(), mode)),\n mode !== \"div\" && ((mod = res.mod.neg()), positive && mod.negative !== 0 && mod.isub(num)),\n {\n div: res.div,\n mod,\n })\n : num.length > this.length || this.cmp(num) < 0\n ? {\n div: new BN(0),\n mod: this,\n }\n : num.length === 1\n ? mode === \"div\"\n ? {\n div: this.divn(num.words[0]),\n mod: null,\n }\n : mode === \"mod\"\n ? {\n div: null,\n mod: new BN(this.modn(num.words[0])),\n }\n : {\n div: this.divn(num.words[0]),\n mod: new BN(this.modn(num.words[0])),\n }\n : this._wordDiv(num, mode);\n }),\n (BN.prototype.div = function (num) {\n return this.divmod(num, \"div\", !1).div;\n }),\n (BN.prototype.mod = function (num) {\n return this.divmod(num, \"mod\", !1).mod;\n }),\n (BN.prototype.umod = function (num) {\n return this.divmod(num, \"mod\", !0).mod;\n }),\n (BN.prototype.divRound = function (num) {\n var dm = this.divmod(num);\n if (dm.mod.isZero()) return dm.div;\n var mod = dm.div.negative !== 0 ? dm.mod.isub(num) : dm.mod,\n half = num.ushrn(1),\n r2 = num.andln(1),\n cmp = mod.cmp(half);\n return cmp < 0 || (r2 === 1 && cmp === 0)\n ? dm.div\n : dm.div.negative !== 0\n ? dm.div.isubn(1)\n : dm.div.iaddn(1);\n }),\n (BN.prototype.modn = function (num) {\n assert(num <= 67108863);\n for (var p = (1 << 26) % num, acc = 0, i = this.length - 1; i >= 0; i--)\n acc = (p * acc + (this.words[i] | 0)) % num;\n return acc;\n }),\n (BN.prototype.idivn = function (num) {\n assert(num <= 67108863);\n for (var carry = 0, i = this.length - 1; i >= 0; i--) {\n var w = (this.words[i] | 0) + carry * 67108864;\n (this.words[i] = (w / num) | 0), (carry = w % num);\n }\n return this.strip();\n }),\n (BN.prototype.divn = function (num) {\n return this.clone().idivn(num);\n }),\n (BN.prototype.egcd = function (p) {\n assert(p.negative === 0), assert(!p.isZero());\n var x = this,\n y = p.clone();\n x.negative !== 0 ? (x = x.umod(p)) : (x = x.clone());\n for (var A = new BN(1), B = new BN(0), C = new BN(0), D = new BN(1), g = 0; x.isEven() && y.isEven(); )\n x.iushrn(1), y.iushrn(1), ++g;\n for (var yp = y.clone(), xp = x.clone(); !x.isZero(); ) {\n for (var i = 0, im = 1; (x.words[0] & im) === 0 && i < 26; ++i, im <<= 1);\n if (i > 0)\n for (x.iushrn(i); i-- > 0; )\n (A.isOdd() || B.isOdd()) && (A.iadd(yp), B.isub(xp)), A.iushrn(1), B.iushrn(1);\n for (var j = 0, jm = 1; (y.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n if (j > 0)\n for (y.iushrn(j); j-- > 0; )\n (C.isOdd() || D.isOdd()) && (C.iadd(yp), D.isub(xp)), C.iushrn(1), D.iushrn(1);\n x.cmp(y) >= 0 ? (x.isub(y), A.isub(C), B.isub(D)) : (y.isub(x), C.isub(A), D.isub(B));\n }\n return {\n a: C,\n b: D,\n gcd: y.iushln(g),\n };\n }),\n (BN.prototype._invmp = function (p) {\n assert(p.negative === 0), assert(!p.isZero());\n var a = this,\n b = p.clone();\n a.negative !== 0 ? (a = a.umod(p)) : (a = a.clone());\n for (var x1 = new BN(1), x2 = new BN(0), delta = b.clone(); 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) for (a.iushrn(i); i-- > 0; ) x1.isOdd() && x1.iadd(delta), x1.iushrn(1);\n for (var j = 0, jm = 1; (b.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n if (j > 0) for (b.iushrn(j); j-- > 0; ) x2.isOdd() && x2.iadd(delta), x2.iushrn(1);\n a.cmp(b) >= 0 ? (a.isub(b), x1.isub(x2)) : (b.isub(a), x2.isub(x1));\n }\n var res;\n return a.cmpn(1) === 0 ? (res = x1) : (res = x2), res.cmpn(0) < 0 && res.iadd(p), res;\n }),\n (BN.prototype.gcd = function (num) {\n if (this.isZero()) return num.abs();\n if (num.isZero()) return this.abs();\n var a = this.clone(),\n b = num.clone();\n (a.negative = 0), (b.negative = 0);\n for (var shift = 0; a.isEven() && b.isEven(); shift++) a.iushrn(1), b.iushrn(1);\n do {\n for (; a.isEven(); ) a.iushrn(1);\n for (; b.isEven(); ) b.iushrn(1);\n var r = a.cmp(b);\n if (r < 0) {\n var t = a;\n (a = b), (b = t);\n } else if (r === 0 || b.cmpn(1) === 0) break;\n a.isub(b);\n } while (!0);\n return b.iushln(shift);\n }),\n (BN.prototype.invm = function (num) {\n return this.egcd(num).a.umod(num);\n }),\n (BN.prototype.isEven = function () {\n return (this.words[0] & 1) === 0;\n }),\n (BN.prototype.isOdd = function () {\n return (this.words[0] & 1) === 1;\n }),\n (BN.prototype.andln = function (num) {\n return this.words[0] & num;\n }),\n (BN.prototype.bincn = function (bit) {\n assert(typeof bit == \"number\");\n var r = bit % 26,\n s = (bit - r) / 26,\n q = 1 << r;\n if (this.length <= s) return this._expand(s + 1), (this.words[s] |= q), this;\n for (var carry = q, i = s; carry !== 0 && i < this.length; i++) {\n var w = this.words[i] | 0;\n (w += carry), (carry = w >>> 26), (w &= 67108863), (this.words[i] = w);\n }\n return carry !== 0 && ((this.words[i] = carry), this.length++), this;\n }),\n (BN.prototype.isZero = function () {\n return this.length === 1 && this.words[0] === 0;\n }),\n (BN.prototype.cmpn = function (num) {\n var negative = num < 0;\n if (this.negative !== 0 && !negative) return -1;\n if (this.negative === 0 && negative) return 1;\n this.strip();\n var res;\n if (this.length > 1) res = 1;\n else {\n negative && (num = -num), assert(num <= 67108863, \"Number is too big\");\n var w = this.words[0] | 0;\n res = w === num ? 0 : w < num ? -1 : 1;\n }\n return this.negative !== 0 ? -res | 0 : res;\n }),\n (BN.prototype.cmp = function (num) {\n if (this.negative !== 0 && num.negative === 0) return -1;\n if (this.negative === 0 && num.negative !== 0) return 1;\n var res = this.ucmp(num);\n return this.negative !== 0 ? -res | 0 : res;\n }),\n (BN.prototype.ucmp = function (num) {\n if (this.length > num.length) return 1;\n if (this.length < num.length) return -1;\n for (var res = 0, i = this.length - 1; i >= 0; i--) {\n var a = this.words[i] | 0,\n b = num.words[i] | 0;\n if (a !== b) {\n a < b ? (res = -1) : a > b && (res = 1);\n break;\n }\n }\n return res;\n }),\n (BN.prototype.gtn = function (num) {\n return this.cmpn(num) === 1;\n }),\n (BN.prototype.gt = function (num) {\n return this.cmp(num) === 1;\n }),\n (BN.prototype.gten = function (num) {\n return this.cmpn(num) >= 0;\n }),\n (BN.prototype.gte = function (num) {\n return this.cmp(num) >= 0;\n }),\n (BN.prototype.ltn = function (num) {\n return this.cmpn(num) === -1;\n }),\n (BN.prototype.lt = function (num) {\n return this.cmp(num) === -1;\n }),\n (BN.prototype.lten = function (num) {\n return this.cmpn(num) <= 0;\n }),\n (BN.prototype.lte = function (num) {\n return this.cmp(num) <= 0;\n }),\n (BN.prototype.eqn = function (num) {\n return this.cmpn(num) === 0;\n }),\n (BN.prototype.eq = function (num) {\n return this.cmp(num) === 0;\n }),\n (BN.red = function (num) {\n return new Red(num);\n }),\n (BN.prototype.toRed = function (ctx) {\n return (\n assert(!this.red, \"Already a number in reduction context\"),\n assert(this.negative === 0, \"red works only with positives\"),\n ctx.convertTo(this)._forceRed(ctx)\n );\n }),\n (BN.prototype.fromRed = function () {\n return assert(this.red, \"fromRed works only with numbers in reduction context\"), this.red.convertFrom(this);\n }),\n (BN.prototype._forceRed = function (ctx) {\n return (this.red = ctx), this;\n }),\n (BN.prototype.forceRed = function (ctx) {\n return assert(!this.red, \"Already a number in reduction context\"), this._forceRed(ctx);\n }),\n (BN.prototype.redAdd = function (num) {\n return assert(this.red, \"redAdd works only with red numbers\"), this.red.add(this, num);\n }),\n (BN.prototype.redIAdd = function (num) {\n return assert(this.red, \"redIAdd works only with red numbers\"), this.red.iadd(this, num);\n }),\n (BN.prototype.redSub = function (num) {\n return assert(this.red, \"redSub works only with red numbers\"), this.red.sub(this, num);\n }),\n (BN.prototype.redISub = function (num) {\n return assert(this.red, \"redISub works only with red numbers\"), this.red.isub(this, num);\n }),\n (BN.prototype.redShl = function (num) {\n return assert(this.red, \"redShl works only with red numbers\"), this.red.shl(this, num);\n }),\n (BN.prototype.redMul = function (num) {\n return (\n assert(this.red, \"redMul works only with red numbers\"),\n this.red._verify2(this, num),\n this.red.mul(this, num)\n );\n }),\n (BN.prototype.redIMul = function (num) {\n return (\n assert(this.red, \"redMul works only with red numbers\"),\n this.red._verify2(this, num),\n this.red.imul(this, num)\n );\n }),\n (BN.prototype.redSqr = function () {\n return assert(this.red, \"redSqr works only with red numbers\"), this.red._verify1(this), this.red.sqr(this);\n }),\n (BN.prototype.redISqr = function () {\n return assert(this.red, \"redISqr works only with red numbers\"), this.red._verify1(this), this.red.isqr(this);\n }),\n (BN.prototype.redSqrt = function () {\n return assert(this.red, \"redSqrt works only with red numbers\"), this.red._verify1(this), this.red.sqrt(this);\n }),\n (BN.prototype.redInvm = function () {\n return assert(this.red, \"redInvm works only with red numbers\"), this.red._verify1(this), this.red.invm(this);\n }),\n (BN.prototype.redNeg = function () {\n return assert(this.red, \"redNeg works only with red numbers\"), this.red._verify1(this), this.red.neg(this);\n }),\n (BN.prototype.redPow = function (num) {\n return assert(this.red && !num.red, \"redPow(normalNum)\"), this.red._verify1(this), this.red.pow(this, num);\n });\n var primes = {\n k256: null,\n p224: null,\n p192: null,\n p25519: null,\n };\n function MPrime(name, p) {\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 (this.tmp = this._tmp());\n }\n (MPrime.prototype._tmp = function () {\n var tmp = new BN(null);\n return (tmp.words = new Array(Math.ceil(this.n / 13))), tmp;\n }),\n (MPrime.prototype.ireduce = function (num) {\n var r = num,\n rlen;\n do this.split(r, this.tmp), (r = this.imulK(r)), (r = r.iadd(this.tmp)), (rlen = r.bitLength());\n while (rlen > this.n);\n var cmp = rlen < this.n ? -1 : r.ucmp(this.p);\n return (\n cmp === 0\n ? ((r.words[0] = 0), (r.length = 1))\n : cmp > 0\n ? r.isub(this.p)\n : r.strip !== void 0\n ? r.strip()\n : r._strip(),\n r\n );\n }),\n (MPrime.prototype.split = function (input, out) {\n input.iushrn(this.n, 0, out);\n }),\n (MPrime.prototype.imulK = function (num) {\n return num.imul(this.k);\n });\n function K256() {\n MPrime.call(this, \"k256\", \"ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f\");\n }\n inherits(K256, MPrime),\n (K256.prototype.split = function (input, output) {\n for (var mask = 4194303, outLen = Math.min(input.length, 9), i = 0; i < outLen; i++)\n output.words[i] = input.words[i];\n if (((output.length = outLen), input.length <= 9)) {\n (input.words[0] = 0), (input.length = 1);\n return;\n }\n var prev = input.words[9];\n for (output.words[output.length++] = prev & mask, i = 10; i < input.length; i++) {\n var next = input.words[i] | 0;\n (input.words[i - 10] = ((next & mask) << 4) | (prev >>> 22)), (prev = next);\n }\n (prev >>>= 22),\n (input.words[i - 10] = prev),\n prev === 0 && input.length > 10 ? (input.length -= 10) : (input.length -= 9);\n }),\n (K256.prototype.imulK = function (num) {\n (num.words[num.length] = 0), (num.words[num.length + 1] = 0), (num.length += 2);\n for (var lo = 0, i = 0; i < num.length; i++) {\n var w = num.words[i] | 0;\n (lo += w * 977), (num.words[i] = lo & 67108863), (lo = w * 64 + ((lo / 67108864) | 0));\n }\n return (\n num.words[num.length - 1] === 0 && (num.length--, num.words[num.length - 1] === 0 && num.length--), num\n );\n });\n function P224() {\n MPrime.call(this, \"p224\", \"ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001\");\n }\n inherits(P224, MPrime);\n function P192() {\n MPrime.call(this, \"p192\", \"ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff\");\n }\n inherits(P192, MPrime);\n function P25519() {\n MPrime.call(this, \"25519\", \"7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed\");\n }\n inherits(P25519, MPrime),\n (P25519.prototype.imulK = function (num) {\n for (var carry = 0, i = 0; i < num.length; i++) {\n var hi = (num.words[i] | 0) * 19 + carry,\n lo = hi & 67108863;\n (hi >>>= 26), (num.words[i] = lo), (carry = hi);\n }\n return carry !== 0 && (num.words[num.length++] = carry), num;\n }),\n (BN._prime = function (name) {\n if (primes[name]) return primes[name];\n var prime2;\n if (name === \"k256\") prime2 = new K256();\n else if (name === \"p224\") prime2 = new P224();\n else if (name === \"p192\") prime2 = new P192();\n else if (name === \"p25519\") prime2 = new P25519();\n else throw new Error(\"Unknown prime \" + name);\n return (primes[name] = prime2), prime2;\n });\n function Red(m) {\n if (typeof m == \"string\") {\n var prime = BN._prime(m);\n (this.m = prime.p), (this.prime = prime);\n } else assert(m.gtn(1), \"modulus must be greater than 1\"), (this.m = m), (this.prime = null);\n }\n (Red.prototype._verify1 = function (a) {\n assert(a.negative === 0, \"red works only with positives\"), assert(a.red, \"red works only with red numbers\");\n }),\n (Red.prototype._verify2 = function (a, b) {\n assert((a.negative | b.negative) === 0, \"red works only with positives\"),\n assert(a.red && a.red === b.red, \"red works only with red numbers\");\n }),\n (Red.prototype.imod = function (a) {\n return this.prime ? this.prime.ireduce(a)._forceRed(this) : a.umod(this.m)._forceRed(this);\n }),\n (Red.prototype.neg = function (a) {\n return a.isZero() ? a.clone() : this.m.sub(a)._forceRed(this);\n }),\n (Red.prototype.add = function (a, b) {\n this._verify2(a, b);\n var res = a.add(b);\n return res.cmp(this.m) >= 0 && res.isub(this.m), res._forceRed(this);\n }),\n (Red.prototype.iadd = function (a, b) {\n this._verify2(a, b);\n var res = a.iadd(b);\n return res.cmp(this.m) >= 0 && res.isub(this.m), res;\n }),\n (Red.prototype.sub = function (a, b) {\n this._verify2(a, b);\n var res = a.sub(b);\n return res.cmpn(0) < 0 && res.iadd(this.m), res._forceRed(this);\n }),\n (Red.prototype.isub = function (a, b) {\n this._verify2(a, b);\n var res = a.isub(b);\n return res.cmpn(0) < 0 && res.iadd(this.m), res;\n }),\n (Red.prototype.shl = function (a, num) {\n return this._verify1(a), this.imod(a.ushln(num));\n }),\n (Red.prototype.imul = function (a, b) {\n return this._verify2(a, b), this.imod(a.imul(b));\n }),\n (Red.prototype.mul = function (a, b) {\n return this._verify2(a, b), this.imod(a.mul(b));\n }),\n (Red.prototype.isqr = function (a) {\n return this.imul(a, a.clone());\n }),\n (Red.prototype.sqr = function (a) {\n return this.mul(a, a);\n }),\n (Red.prototype.sqrt = function (a) {\n if (a.isZero()) return a.clone();\n var mod3 = this.m.andln(3);\n if ((assert(mod3 % 2 === 1), mod3 === 3)) {\n var pow = this.m.add(new BN(1)).iushrn(2);\n return this.pow(a, pow);\n }\n for (var q = this.m.subn(1), s = 0; !q.isZero() && q.andln(1) === 0; ) s++, q.iushrn(1);\n assert(!q.isZero());\n var one = new BN(1).toRed(this),\n nOne = one.redNeg(),\n lpow = this.m.subn(1).iushrn(1),\n z = this.m.bitLength();\n for (z = new BN(2 * z * z).toRed(this); this.pow(z, lpow).cmp(nOne) !== 0; ) z.redIAdd(nOne);\n for (\n var c = this.pow(z, q), r = this.pow(a, q.addn(1).iushrn(1)), t = this.pow(a, q), m = s;\n t.cmp(one) !== 0;\n\n ) {\n for (var tmp = t, i = 0; tmp.cmp(one) !== 0; i++) tmp = tmp.redSqr();\n assert(i < m);\n var b = this.pow(c, new BN(1).iushln(m - i - 1));\n (r = r.redMul(b)), (c = b.redSqr()), (t = t.redMul(c)), (m = i);\n }\n return r;\n }),\n (Red.prototype.invm = function (a) {\n var inv = a._invmp(this.m);\n return inv.negative !== 0 ? ((inv.negative = 0), this.imod(inv).redNeg()) : this.imod(inv);\n }),\n (Red.prototype.pow = function (a, num) {\n if (num.isZero()) return new BN(1).toRed(this);\n if (num.cmpn(1) === 0) return a.clone();\n var windowSize = 4,\n wnd = new Array(1 << windowSize);\n (wnd[0] = new BN(1).toRed(this)), (wnd[1] = a);\n for (var i = 2; i < wnd.length; i++) wnd[i] = this.mul(wnd[i - 1], a);\n var res = wnd[0],\n current = 0,\n currentLen = 0,\n start = num.bitLength() % 26;\n for (start === 0 && (start = 26), i = num.length - 1; i >= 0; i--) {\n for (var word = num.words[i], j = start - 1; j >= 0; j--) {\n var bit = (word >> j) & 1;\n if ((res !== wnd[0] && (res = this.sqr(res)), bit === 0 && current === 0)) {\n currentLen = 0;\n continue;\n }\n (current <<= 1),\n (current |= bit),\n currentLen++,\n !(currentLen !== windowSize && (i !== 0 || j !== 0)) &&\n ((res = this.mul(res, wnd[current])), (currentLen = 0), (current = 0));\n }\n start = 26;\n }\n return res;\n }),\n (Red.prototype.convertTo = function (num) {\n var r = num.umod(this.m);\n return r === num ? r.clone() : r;\n }),\n (Red.prototype.convertFrom = function (num) {\n var res = num.clone();\n return (res.red = null), res;\n }),\n (BN.mont = function (num) {\n return new Mont(num);\n });\n function Mont(m) {\n Red.call(this, m),\n (this.shift = this.m.bitLength()),\n this.shift % 26 !== 0 && (this.shift += 26 - (this.shift % 26)),\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 (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 (Mont.prototype.convertTo = function (num) {\n return this.imod(num.ushln(this.shift));\n }),\n (Mont.prototype.convertFrom = function (num) {\n var r = this.imod(num.mul(this.rinv));\n return (r.red = null), r;\n }),\n (Mont.prototype.imul = function (a, b) {\n if (a.isZero() || b.isZero()) return (a.words[0] = 0), (a.length = 1), a;\n var t = a.imul(b),\n c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m),\n u = t.isub(c).iushrn(this.shift),\n res = u;\n return (\n u.cmp(this.m) >= 0 ? (res = u.isub(this.m)) : u.cmpn(0) < 0 && (res = u.iadd(this.m)), res._forceRed(this)\n );\n }),\n (Mont.prototype.mul = function (a, b) {\n if (a.isZero() || b.isZero()) return new BN(0)._forceRed(this);\n var t = a.mul(b),\n c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m),\n u = t.isub(c).iushrn(this.shift),\n res = u;\n return (\n u.cmp(this.m) >= 0 ? (res = u.isub(this.m)) : u.cmpn(0) < 0 && (res = u.iadd(this.m)), res._forceRed(this)\n );\n }),\n (Mont.prototype.invm = function (a) {\n var res = this.imod(a._invmp(this.m).mul(this.r2));\n return res._forceRed(this);\n });\n })(typeof module > \"u\" || module, exports);\n },\n});\n\n// node_modules/create-ecdh/browser.js\nvar require_browser9 = __commonJS({\n \"node_modules/create-ecdh/browser.js\"(exports, module) {\n var elliptic = require_elliptic(),\n BN = require_bn6();\n module.exports = function (curve) {\n return new ECDH(curve);\n };\n var aliases = {\n secp256k1: {\n name: \"secp256k1\",\n byteLength: 32,\n },\n secp224r1: {\n name: \"p224\",\n byteLength: 28,\n },\n prime256v1: {\n name: \"p256\",\n byteLength: 32,\n },\n prime192v1: {\n name: \"p192\",\n byteLength: 24,\n },\n ed25519: {\n name: \"ed25519\",\n byteLength: 32,\n },\n secp384r1: {\n name: \"p384\",\n byteLength: 48,\n },\n secp521r1: {\n name: \"p521\",\n byteLength: 66,\n },\n };\n aliases.p224 = aliases.secp224r1;\n aliases.p256 = aliases.secp256r1 = aliases.prime256v1;\n aliases.p192 = aliases.secp192r1 = aliases.prime192v1;\n aliases.p384 = aliases.secp384r1;\n aliases.p521 = aliases.secp521r1;\n function ECDH(curve) {\n (this.curveType = aliases[curve]),\n this.curveType ||\n (this.curveType = {\n name: curve,\n }),\n (this.curve = new elliptic.ec(this.curveType.name)),\n (this.keys = void 0);\n }\n ECDH.prototype.generateKeys = function (enc, format) {\n return (this.keys = this.curve.genKeyPair()), this.getPublicKey(enc, format);\n };\n ECDH.prototype.computeSecret = function (other, inenc, enc) {\n (inenc = inenc || \"utf8\"), Buffer.isBuffer(other) || (other = new Buffer(other, inenc));\n var otherPub = this.curve.keyFromPublic(other).getPublic(),\n out = otherPub.mul(this.keys.getPrivate()).getX();\n return formatReturnValue(out, enc, this.curveType.byteLength);\n };\n ECDH.prototype.getPublicKey = function (enc, format) {\n var key = this.keys.getPublic(format === \"compressed\", !0);\n return (\n format === \"hybrid\" && (key[key.length - 1] % 2 ? (key[0] = 7) : (key[0] = 6)), formatReturnValue(key, enc)\n );\n };\n ECDH.prototype.getPrivateKey = function (enc) {\n return formatReturnValue(this.keys.getPrivate(), enc);\n };\n ECDH.prototype.setPublicKey = function (pub, enc) {\n return (\n (enc = enc || \"utf8\"), Buffer.isBuffer(pub) || (pub = new Buffer(pub, enc)), this.keys._importPublic(pub), this\n );\n };\n ECDH.prototype.setPrivateKey = function (priv, enc) {\n (enc = enc || \"utf8\"), Buffer.isBuffer(priv) || (priv = new Buffer(priv, enc));\n var _priv = new BN(priv);\n return (_priv = _priv.toString(16)), (this.keys = this.curve.genKeyPair()), this.keys._importPrivate(_priv), this;\n };\n function formatReturnValue(bn, enc, len) {\n Array.isArray(bn) || (bn = bn.toArray());\n var buf = new Buffer(bn);\n if (len && buf.length < len) {\n var zeros = new Buffer(len - buf.length);\n zeros.fill(0), (buf = Buffer.concat([zeros, buf]));\n }\n return enc ? buf.toString(enc) : buf;\n }\n },\n});\n\n// node_modules/public-encrypt/mgf.js\nvar require_mgf = __commonJS({\n \"node_modules/public-encrypt/mgf.js\"(exports, module) {\n var createHash = require_browser2(),\n Buffer2 = require_safe_buffer().Buffer;\n module.exports = function (seed, len) {\n for (var t = Buffer2.alloc(0), i = 0, c; t.length < len; )\n (c = i2ops(i++)), (t = Buffer2.concat([t, createHash(\"sha1\").update(seed).update(c).digest()]));\n return t.slice(0, len);\n };\n function i2ops(c) {\n var out = Buffer2.allocUnsafe(4);\n return out.writeUInt32BE(c, 0), out;\n }\n },\n});\n\n// node_modules/public-encrypt/xor.js\nvar require_xor = __commonJS({\n \"node_modules/public-encrypt/xor.js\"(exports, module) {\n module.exports = function (a, b) {\n for (var len = a.length, i = -1; ++i < len; ) a[i] ^= b[i];\n return a;\n };\n },\n});\n\n// node_modules/public-encrypt/node_modules/bn.js/lib/bn.js\nvar require_bn7 = __commonJS({\n \"node_modules/public-encrypt/node_modules/bn.js/lib/bn.js\"(exports, module) {\n (function (module2, exports2) {\n \"use strict\";\n function assert(val, msg) {\n if (!val) throw new Error(msg || \"Assertion failed\");\n }\n function inherits(ctor, superCtor) {\n ctor.super_ = superCtor;\n var TempCtor = function () {};\n (TempCtor.prototype = superCtor.prototype),\n (ctor.prototype = new TempCtor()),\n (ctor.prototype.constructor = ctor);\n }\n function BN(number, base, endian) {\n if (BN.isBN(number)) return number;\n (this.negative = 0),\n (this.words = null),\n (this.length = 0),\n (this.red = null),\n number !== null &&\n ((base === \"le\" || base === \"be\") && ((endian = base), (base = 10)),\n this._init(number || 0, base || 10, endian || \"be\"));\n }\n typeof module2 == \"object\" ? (module2.exports = BN) : (exports2.BN = BN), (BN.BN = BN), (BN.wordSize = 26);\n var Buffer2 = globalThis.Buffer;\n (BN.isBN = function (num) {\n return num instanceof BN\n ? !0\n : num !== null &&\n typeof num == \"object\" &&\n num.constructor.wordSize === BN.wordSize &&\n Array.isArray(num.words);\n }),\n (BN.max = function (left, right) {\n return left.cmp(right) > 0 ? left : right;\n }),\n (BN.min = function (left, right) {\n return left.cmp(right) < 0 ? left : right;\n }),\n (BN.prototype._init = function (number, base, endian) {\n if (typeof number == \"number\") return this._initNumber(number, base, endian);\n if (typeof number == \"object\") return this._initArray(number, base, endian);\n base === \"hex\" && (base = 16),\n assert(base === (base | 0) && base >= 2 && base <= 36),\n (number = number.toString().replace(/\\s+/g, \"\"));\n var start = 0;\n number[0] === \"-\" && (start++, (this.negative = 1)),\n start < number.length &&\n (base === 16\n ? this._parseHex(number, start, endian)\n : (this._parseBase(number, base, start),\n endian === \"le\" && this._initArray(this.toArray(), base, endian)));\n }),\n (BN.prototype._initNumber = function (number, base, endian) {\n number < 0 && ((this.negative = 1), (number = -number)),\n number < 67108864\n ? ((this.words = [number & 67108863]), (this.length = 1))\n : number < 4503599627370496\n ? ((this.words = [number & 67108863, (number / 67108864) & 67108863]), (this.length = 2))\n : (assert(number < 9007199254740992),\n (this.words = [number & 67108863, (number / 67108864) & 67108863, 1]),\n (this.length = 3)),\n endian === \"le\" && this._initArray(this.toArray(), base, endian);\n }),\n (BN.prototype._initArray = function (number, base, endian) {\n if ((assert(typeof number.length == \"number\"), number.length <= 0))\n return (this.words = [0]), (this.length = 1), this;\n (this.length = Math.ceil(number.length / 3)), (this.words = new Array(this.length));\n for (var i = 0; i < this.length; i++) this.words[i] = 0;\n var j,\n w,\n off = 0;\n if (endian === \"be\")\n for (i = number.length - 1, j = 0; i >= 0; i -= 3)\n (w = number[i] | (number[i - 1] << 8) | (number[i - 2] << 16)),\n (this.words[j] |= (w << off) & 67108863),\n (this.words[j + 1] = (w >>> (26 - off)) & 67108863),\n (off += 24),\n off >= 26 && ((off -= 26), j++);\n else if (endian === \"le\")\n for (i = 0, j = 0; i < number.length; i += 3)\n (w = number[i] | (number[i + 1] << 8) | (number[i + 2] << 16)),\n (this.words[j] |= (w << off) & 67108863),\n (this.words[j + 1] = (w >>> (26 - off)) & 67108863),\n (off += 24),\n off >= 26 && ((off -= 26), j++);\n return this.strip();\n });\n function parseHex4Bits(string, index) {\n var c = string.charCodeAt(index);\n return c >= 65 && c <= 70 ? c - 55 : c >= 97 && c <= 102 ? c - 87 : (c - 48) & 15;\n }\n function parseHexByte(string, lowerBound, index) {\n var r = parseHex4Bits(string, index);\n return index - 1 >= lowerBound && (r |= parseHex4Bits(string, index - 1) << 4), r;\n }\n BN.prototype._parseHex = function (number, start, endian) {\n (this.length = Math.ceil((number.length - start) / 6)), (this.words = new Array(this.length));\n for (var i = 0; i < this.length; i++) this.words[i] = 0;\n var off = 0,\n j = 0,\n w;\n if (endian === \"be\")\n for (i = number.length - 1; i >= start; i -= 2)\n (w = parseHexByte(number, start, i) << off),\n (this.words[j] |= w & 67108863),\n off >= 18 ? ((off -= 18), (j += 1), (this.words[j] |= w >>> 26)) : (off += 8);\n else {\n var parseLength = number.length - start;\n for (i = parseLength % 2 === 0 ? start + 1 : start; i < number.length; i += 2)\n (w = parseHexByte(number, start, i) << off),\n (this.words[j] |= w & 67108863),\n off >= 18 ? ((off -= 18), (j += 1), (this.words[j] |= w >>> 26)) : (off += 8);\n }\n this.strip();\n };\n function parseBase(str, start, end, mul) {\n for (var r = 0, len = Math.min(str.length, end), i = start; i < len; i++) {\n var c = str.charCodeAt(i) - 48;\n (r *= mul), c >= 49 ? (r += c - 49 + 10) : c >= 17 ? (r += c - 17 + 10) : (r += c);\n }\n return r;\n }\n (BN.prototype._parseBase = function (number, base, start) {\n (this.words = [0]), (this.length = 1);\n for (var limbLen = 0, limbPow = 1; limbPow <= 67108863; limbPow *= base) limbLen++;\n limbLen--, (limbPow = (limbPow / base) | 0);\n for (\n var total = number.length - start,\n mod = total % limbLen,\n end = Math.min(total, total - mod) + start,\n word = 0,\n i = start;\n i < end;\n i += limbLen\n )\n (word = parseBase(number, i, i + limbLen, base)),\n this.imuln(limbPow),\n this.words[0] + word < 67108864 ? (this.words[0] += word) : this._iaddn(word);\n if (mod !== 0) {\n var pow = 1;\n for (word = parseBase(number, i, number.length, base), i = 0; i < mod; i++) pow *= base;\n this.imuln(pow), this.words[0] + word < 67108864 ? (this.words[0] += word) : this._iaddn(word);\n }\n this.strip();\n }),\n (BN.prototype.copy = function (dest) {\n dest.words = new Array(this.length);\n for (var i = 0; i < this.length; i++) dest.words[i] = this.words[i];\n (dest.length = this.length), (dest.negative = this.negative), (dest.red = this.red);\n }),\n (BN.prototype.clone = function () {\n var r = new BN(null);\n return this.copy(r), r;\n }),\n (BN.prototype._expand = function (size) {\n for (; this.length < size; ) this.words[this.length++] = 0;\n return this;\n }),\n (BN.prototype.strip = function () {\n for (; this.length > 1 && this.words[this.length - 1] === 0; ) this.length--;\n return this._normSign();\n }),\n (BN.prototype._normSign = function () {\n return this.length === 1 && this.words[0] === 0 && (this.negative = 0), this;\n }),\n (BN.prototype.inspect = function () {\n return (this.red ? \"<BN-R: \" : \"<BN: \") + this.toString(16) + \">\";\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 groupSizes = [\n 0, 0, 25, 16, 12, 11, 10, 9, 8, 8, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5,\n 5, 5,\n ],\n groupBases = [\n 0, 0, 33554432, 43046721, 16777216, 48828125, 60466176, 40353607, 16777216, 43046721, 1e7, 19487171, 35831808,\n 62748517, 7529536, 11390625, 16777216, 24137569, 34012224, 47045881, 64e6, 4084101, 5153632, 6436343, 7962624,\n 9765625, 11881376, 14348907, 17210368, 20511149, 243e5, 28629151, 33554432, 39135393, 45435424, 52521875,\n 60466176,\n ];\n (BN.prototype.toString = function (base, padding) {\n (base = base || 10), (padding = padding | 0 || 1);\n var out;\n if (base === 16 || base === \"hex\") {\n out = \"\";\n for (var off = 0, carry = 0, i = 0; i < this.length; i++) {\n var w = this.words[i],\n word = (((w << off) | carry) & 16777215).toString(16);\n (carry = (w >>> (24 - off)) & 16777215),\n carry !== 0 || i !== this.length - 1 ? (out = zeros[6 - word.length] + word + out) : (out = word + out),\n (off += 2),\n off >= 26 && ((off -= 26), i--);\n }\n for (carry !== 0 && (out = carry.toString(16) + out); out.length % padding !== 0; ) out = \"0\" + out;\n return this.negative !== 0 && (out = \"-\" + out), out;\n }\n if (base === (base | 0) && base >= 2 && base <= 36) {\n var groupSize = groupSizes[base],\n groupBase = groupBases[base];\n out = \"\";\n var c = this.clone();\n for (c.negative = 0; !c.isZero(); ) {\n var r = c.modn(groupBase).toString(base);\n (c = c.idivn(groupBase)), c.isZero() ? (out = r + out) : (out = zeros[groupSize - r.length] + r + out);\n }\n for (this.isZero() && (out = \"0\" + out); out.length % padding !== 0; ) out = \"0\" + out;\n return this.negative !== 0 && (out = \"-\" + out), out;\n }\n assert(!1, \"Base should be between 2 and 36\");\n }),\n (BN.prototype.toNumber = function () {\n var ret = this.words[0];\n return (\n this.length === 2\n ? (ret += this.words[1] * 67108864)\n : this.length === 3 && this.words[2] === 1\n ? (ret += 4503599627370496 + this.words[1] * 67108864)\n : this.length > 2 && assert(!1, \"Number can only safely store up to 53 bits\"),\n this.negative !== 0 ? -ret : ret\n );\n }),\n (BN.prototype.toJSON = function () {\n return this.toString(16);\n }),\n (BN.prototype.toBuffer = function (endian, length) {\n return assert(typeof Buffer2 < \"u\"), this.toArrayLike(Buffer2, endian, length);\n }),\n (BN.prototype.toArray = function (endian, length) {\n return this.toArrayLike(Array, endian, length);\n }),\n (BN.prototype.toArrayLike = function (ArrayType, endian, length) {\n var byteLength = this.byteLength(),\n 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 this.strip();\n var littleEndian = endian === \"le\",\n res = new ArrayType(reqLength),\n b,\n i,\n q = this.clone();\n if (littleEndian) {\n for (i = 0; !q.isZero(); i++) (b = q.andln(255)), q.iushrn(8), (res[i] = b);\n for (; i < reqLength; i++) res[i] = 0;\n } else {\n for (i = 0; i < reqLength - byteLength; i++) res[i] = 0;\n for (i = 0; !q.isZero(); i++) (b = q.andln(255)), q.iushrn(8), (res[reqLength - i - 1] = b);\n }\n return res;\n }),\n Math.clz32\n ? (BN.prototype._countBits = function (w) {\n return 32 - Math.clz32(w);\n })\n : (BN.prototype._countBits = function (w) {\n var t = w,\n r = 0;\n return (\n t >= 4096 && ((r += 13), (t >>>= 13)),\n t >= 64 && ((r += 7), (t >>>= 7)),\n t >= 8 && ((r += 4), (t >>>= 4)),\n t >= 2 && ((r += 2), (t >>>= 2)),\n r + t\n );\n }),\n (BN.prototype._zeroBits = function (w) {\n if (w === 0) return 26;\n var t = w,\n r = 0;\n return (\n (t & 8191) === 0 && ((r += 13), (t >>>= 13)),\n (t & 127) === 0 && ((r += 7), (t >>>= 7)),\n (t & 15) === 0 && ((r += 4), (t >>>= 4)),\n (t & 3) === 0 && ((r += 2), (t >>>= 2)),\n (t & 1) === 0 && r++,\n r\n );\n }),\n (BN.prototype.bitLength = function () {\n var w = this.words[this.length - 1],\n hi = this._countBits(w);\n return (this.length - 1) * 26 + hi;\n });\n function toBitArray(num) {\n for (var w = new Array(num.bitLength()), bit = 0; bit < w.length; bit++) {\n var off = (bit / 26) | 0,\n wbit = bit % 26;\n w[bit] = (num.words[off] & (1 << wbit)) >>> wbit;\n }\n return w;\n }\n (BN.prototype.zeroBits = function () {\n if (this.isZero()) return 0;\n for (var r = 0, i = 0; i < this.length; i++) {\n var b = this._zeroBits(this.words[i]);\n if (((r += b), b !== 26)) break;\n }\n return r;\n }),\n (BN.prototype.byteLength = function () {\n return Math.ceil(this.bitLength() / 8);\n }),\n (BN.prototype.toTwos = function (width) {\n return this.negative !== 0 ? this.abs().inotn(width).iaddn(1) : this.clone();\n }),\n (BN.prototype.fromTwos = function (width) {\n return this.testn(width - 1) ? this.notn(width).iaddn(1).ineg() : this.clone();\n }),\n (BN.prototype.isNeg = function () {\n return this.negative !== 0;\n }),\n (BN.prototype.neg = function () {\n return this.clone().ineg();\n }),\n (BN.prototype.ineg = function () {\n return this.isZero() || (this.negative ^= 1), this;\n }),\n (BN.prototype.iuor = function (num) {\n for (; this.length < num.length; ) this.words[this.length++] = 0;\n for (var i = 0; i < num.length; i++) this.words[i] = this.words[i] | num.words[i];\n return this.strip();\n }),\n (BN.prototype.ior = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuor(num);\n }),\n (BN.prototype.or = function (num) {\n return this.length > num.length ? this.clone().ior(num) : num.clone().ior(this);\n }),\n (BN.prototype.uor = function (num) {\n return this.length > num.length ? this.clone().iuor(num) : num.clone().iuor(this);\n }),\n (BN.prototype.iuand = function (num) {\n var b;\n this.length > num.length ? (b = num) : (b = this);\n for (var i = 0; i < b.length; i++) this.words[i] = this.words[i] & num.words[i];\n return (this.length = b.length), this.strip();\n }),\n (BN.prototype.iand = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuand(num);\n }),\n (BN.prototype.and = function (num) {\n return this.length > num.length ? this.clone().iand(num) : num.clone().iand(this);\n }),\n (BN.prototype.uand = function (num) {\n return this.length > num.length ? this.clone().iuand(num) : num.clone().iuand(this);\n }),\n (BN.prototype.iuxor = function (num) {\n var a, b;\n this.length > num.length ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var i = 0; i < b.length; i++) this.words[i] = a.words[i] ^ b.words[i];\n if (this !== a) for (; i < a.length; i++) this.words[i] = a.words[i];\n return (this.length = a.length), this.strip();\n }),\n (BN.prototype.ixor = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuxor(num);\n }),\n (BN.prototype.xor = function (num) {\n return this.length > num.length ? this.clone().ixor(num) : num.clone().ixor(this);\n }),\n (BN.prototype.uxor = function (num) {\n return this.length > num.length ? this.clone().iuxor(num) : num.clone().iuxor(this);\n }),\n (BN.prototype.inotn = function (width) {\n assert(typeof width == \"number\" && width >= 0);\n var bytesNeeded = Math.ceil(width / 26) | 0,\n bitsLeft = width % 26;\n this._expand(bytesNeeded), bitsLeft > 0 && bytesNeeded--;\n for (var i = 0; i < bytesNeeded; i++) this.words[i] = ~this.words[i] & 67108863;\n return bitsLeft > 0 && (this.words[i] = ~this.words[i] & (67108863 >> (26 - bitsLeft))), this.strip();\n }),\n (BN.prototype.notn = function (width) {\n return this.clone().inotn(width);\n }),\n (BN.prototype.setn = function (bit, val) {\n assert(typeof bit == \"number\" && bit >= 0);\n var off = (bit / 26) | 0,\n wbit = bit % 26;\n return (\n this._expand(off + 1),\n val\n ? (this.words[off] = this.words[off] | (1 << wbit))\n : (this.words[off] = this.words[off] & ~(1 << wbit)),\n this.strip()\n );\n }),\n (BN.prototype.iadd = function (num) {\n var r;\n if (this.negative !== 0 && num.negative === 0)\n return (this.negative = 0), (r = this.isub(num)), (this.negative ^= 1), this._normSign();\n if (this.negative === 0 && num.negative !== 0)\n return (num.negative = 0), (r = this.isub(num)), (num.negative = 1), r._normSign();\n var a, b;\n this.length > num.length ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var carry = 0, i = 0; i < b.length; i++)\n (r = (a.words[i] | 0) + (b.words[i] | 0) + carry), (this.words[i] = r & 67108863), (carry = r >>> 26);\n for (; carry !== 0 && i < a.length; i++)\n (r = (a.words[i] | 0) + carry), (this.words[i] = r & 67108863), (carry = r >>> 26);\n if (((this.length = a.length), carry !== 0)) (this.words[this.length] = carry), this.length++;\n else if (a !== this) for (; i < a.length; i++) this.words[i] = a.words[i];\n return this;\n }),\n (BN.prototype.add = function (num) {\n var res;\n return num.negative !== 0 && this.negative === 0\n ? ((num.negative = 0), (res = this.sub(num)), (num.negative ^= 1), res)\n : num.negative === 0 && this.negative !== 0\n ? ((this.negative = 0), (res = num.sub(this)), (this.negative = 1), res)\n : this.length > num.length\n ? this.clone().iadd(num)\n : num.clone().iadd(this);\n }),\n (BN.prototype.isub = function (num) {\n if (num.negative !== 0) {\n num.negative = 0;\n var r = this.iadd(num);\n return (num.negative = 1), r._normSign();\n } else if (this.negative !== 0)\n return (this.negative = 0), this.iadd(num), (this.negative = 1), this._normSign();\n var cmp = this.cmp(num);\n if (cmp === 0) return (this.negative = 0), (this.length = 1), (this.words[0] = 0), this;\n var a, b;\n cmp > 0 ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var carry = 0, i = 0; i < b.length; i++)\n (r = (a.words[i] | 0) - (b.words[i] | 0) + carry), (carry = r >> 26), (this.words[i] = r & 67108863);\n for (; carry !== 0 && i < a.length; i++)\n (r = (a.words[i] | 0) + carry), (carry = r >> 26), (this.words[i] = r & 67108863);\n if (carry === 0 && i < a.length && a !== this) for (; i < a.length; i++) this.words[i] = a.words[i];\n return (this.length = Math.max(this.length, i)), a !== this && (this.negative = 1), this.strip();\n }),\n (BN.prototype.sub = function (num) {\n return this.clone().isub(num);\n });\n function smallMulTo(self2, num, out) {\n out.negative = num.negative ^ self2.negative;\n var len = (self2.length + num.length) | 0;\n (out.length = len), (len = (len - 1) | 0);\n var a = self2.words[0] | 0,\n b = num.words[0] | 0,\n r = a * b,\n lo = r & 67108863,\n carry = (r / 67108864) | 0;\n out.words[0] = lo;\n for (var k = 1; k < len; k++) {\n for (\n var ncarry = carry >>> 26,\n rword = carry & 67108863,\n maxJ = Math.min(k, num.length - 1),\n j = Math.max(0, k - self2.length + 1);\n j <= maxJ;\n j++\n ) {\n var i = (k - j) | 0;\n (a = self2.words[i] | 0),\n (b = num.words[j] | 0),\n (r = a * b + rword),\n (ncarry += (r / 67108864) | 0),\n (rword = r & 67108863);\n }\n (out.words[k] = rword | 0), (carry = ncarry | 0);\n }\n return carry !== 0 ? (out.words[k] = carry | 0) : out.length--, out.strip();\n }\n var comb10MulTo = function (self2, num, out) {\n var a = self2.words,\n b = num.words,\n o = out.words,\n c = 0,\n lo,\n mid,\n hi,\n a0 = a[0] | 0,\n al0 = a0 & 8191,\n ah0 = a0 >>> 13,\n a1 = a[1] | 0,\n al1 = a1 & 8191,\n ah1 = a1 >>> 13,\n a2 = a[2] | 0,\n al2 = a2 & 8191,\n ah2 = a2 >>> 13,\n a3 = a[3] | 0,\n al3 = a3 & 8191,\n ah3 = a3 >>> 13,\n a4 = a[4] | 0,\n al4 = a4 & 8191,\n ah4 = a4 >>> 13,\n a5 = a[5] | 0,\n al5 = a5 & 8191,\n ah5 = a5 >>> 13,\n a6 = a[6] | 0,\n al6 = a6 & 8191,\n ah6 = a6 >>> 13,\n a7 = a[7] | 0,\n al7 = a7 & 8191,\n ah7 = a7 >>> 13,\n a8 = a[8] | 0,\n al8 = a8 & 8191,\n ah8 = a8 >>> 13,\n a9 = a[9] | 0,\n al9 = a9 & 8191,\n ah9 = a9 >>> 13,\n b0 = b[0] | 0,\n bl0 = b0 & 8191,\n bh0 = b0 >>> 13,\n b1 = b[1] | 0,\n bl1 = b1 & 8191,\n bh1 = b1 >>> 13,\n b2 = b[2] | 0,\n bl2 = b2 & 8191,\n bh2 = b2 >>> 13,\n b3 = b[3] | 0,\n bl3 = b3 & 8191,\n bh3 = b3 >>> 13,\n b4 = b[4] | 0,\n bl4 = b4 & 8191,\n bh4 = b4 >>> 13,\n b5 = b[5] | 0,\n bl5 = b5 & 8191,\n bh5 = b5 >>> 13,\n b6 = b[6] | 0,\n bl6 = b6 & 8191,\n bh6 = b6 >>> 13,\n b7 = b[7] | 0,\n bl7 = b7 & 8191,\n bh7 = b7 >>> 13,\n b8 = b[8] | 0,\n bl8 = b8 & 8191,\n bh8 = b8 >>> 13,\n b9 = b[9] | 0,\n bl9 = b9 & 8191,\n bh9 = b9 >>> 13;\n (out.negative = self2.negative ^ num.negative),\n (out.length = 19),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w0 >>> 26)) | 0),\n (w0 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w1 >>> 26)) | 0),\n (w1 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w2 >>> 26)) | 0),\n (w2 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w3 >>> 26)) | 0),\n (w3 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w4 >>> 26)) | 0),\n (w4 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w5 >>> 26)) | 0),\n (w5 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w6 >>> 26)) | 0),\n (w6 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w7 >>> 26)) | 0),\n (w7 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w8 >>> 26)) | 0),\n (w8 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w9 >>> 26)) | 0),\n (w9 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w10 >>> 26)) | 0),\n (w10 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w11 >>> 26)) | 0),\n (w11 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w12 >>> 26)) | 0),\n (w12 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w13 >>> 26)) | 0),\n (w13 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w14 >>> 26)) | 0),\n (w14 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w15 >>> 26)) | 0),\n (w15 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w16 >>> 26)) | 0),\n (w16 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w17 >>> 26)) | 0),\n (w17 &= 67108863),\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 & 8191) << 13)) | 0;\n return (\n (c = (((hi + (mid >>> 13)) | 0) + (w18 >>> 26)) | 0),\n (w18 &= 67108863),\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 c !== 0 && ((o[19] = c), out.length++),\n out\n );\n };\n Math.imul || (comb10MulTo = smallMulTo);\n function bigMulTo(self2, num, out) {\n (out.negative = num.negative ^ self2.negative), (out.length = self2.length + num.length);\n for (var carry = 0, hncarry = 0, k = 0; k < out.length - 1; k++) {\n var ncarry = hncarry;\n hncarry = 0;\n for (\n var rword = carry & 67108863, maxJ = Math.min(k, num.length - 1), j = Math.max(0, k - self2.length + 1);\n j <= maxJ;\n j++\n ) {\n var i = k - j,\n a = self2.words[i] | 0,\n b = num.words[j] | 0,\n r = a * b,\n lo = r & 67108863;\n (ncarry = (ncarry + ((r / 67108864) | 0)) | 0),\n (lo = (lo + rword) | 0),\n (rword = lo & 67108863),\n (ncarry = (ncarry + (lo >>> 26)) | 0),\n (hncarry += ncarry >>> 26),\n (ncarry &= 67108863);\n }\n (out.words[k] = rword), (carry = ncarry), (ncarry = hncarry);\n }\n return carry !== 0 ? (out.words[k] = carry) : out.length--, out.strip();\n }\n function jumboMulTo(self2, num, out) {\n var fftm = new FFTM();\n return fftm.mulp(self2, num, out);\n }\n BN.prototype.mulTo = function (num, out) {\n var res,\n len = this.length + num.length;\n return (\n this.length === 10 && num.length === 10\n ? (res = comb10MulTo(this, num, out))\n : len < 63\n ? (res = smallMulTo(this, num, out))\n : len < 1024\n ? (res = bigMulTo(this, num, out))\n : (res = jumboMulTo(this, num, out)),\n res\n );\n };\n function FFTM(x, y) {\n (this.x = x), (this.y = y);\n }\n (FFTM.prototype.makeRBT = function (N) {\n for (var t = new Array(N), l = BN.prototype._countBits(N) - 1, i = 0; i < N; i++) t[i] = this.revBin(i, l, N);\n return t;\n }),\n (FFTM.prototype.revBin = function (x, l, N) {\n if (x === 0 || x === N - 1) return x;\n for (var rb = 0, i = 0; i < l; i++) (rb |= (x & 1) << (l - i - 1)), (x >>= 1);\n return rb;\n }),\n (FFTM.prototype.permute = function (rbt, rws, iws, rtws, itws, N) {\n for (var i = 0; i < N; i++) (rtws[i] = rws[rbt[i]]), (itws[i] = iws[rbt[i]]);\n }),\n (FFTM.prototype.transform = function (rws, iws, rtws, itws, N, rbt) {\n this.permute(rbt, rws, iws, rtws, itws, N);\n for (var s = 1; s < N; s <<= 1)\n for (\n var l = s << 1, rtwdf = Math.cos((2 * Math.PI) / l), itwdf = Math.sin((2 * Math.PI) / l), p = 0;\n p < N;\n p += l\n )\n for (var rtwdf_ = rtwdf, itwdf_ = itwdf, j = 0; j < s; j++) {\n var re = rtws[p + j],\n ie = itws[p + j],\n ro = rtws[p + j + s],\n io = itws[p + j + s],\n rx = rtwdf_ * ro - itwdf_ * io;\n (io = rtwdf_ * io + itwdf_ * ro),\n (ro = rx),\n (rtws[p + j] = re + ro),\n (itws[p + j] = ie + io),\n (rtws[p + j + s] = re - ro),\n (itws[p + j + s] = ie - io),\n j !== l &&\n ((rx = rtwdf * rtwdf_ - itwdf * itwdf_), (itwdf_ = rtwdf * itwdf_ + itwdf * rtwdf_), (rtwdf_ = rx));\n }\n }),\n (FFTM.prototype.guessLen13b = function (n, m) {\n var N = Math.max(m, n) | 1,\n odd = N & 1,\n i = 0;\n for (N = (N / 2) | 0; N; N = N >>> 1) i++;\n return 1 << (i + 1 + odd);\n }),\n (FFTM.prototype.conjugate = function (rws, iws, N) {\n if (!(N <= 1))\n for (var i = 0; i < N / 2; i++) {\n var t = rws[i];\n (rws[i] = rws[N - i - 1]),\n (rws[N - i - 1] = t),\n (t = iws[i]),\n (iws[i] = -iws[N - i - 1]),\n (iws[N - i - 1] = -t);\n }\n }),\n (FFTM.prototype.normalize13b = function (ws, N) {\n for (var carry = 0, i = 0; i < N / 2; i++) {\n var w = Math.round(ws[2 * i + 1] / N) * 8192 + Math.round(ws[2 * i] / N) + carry;\n (ws[i] = w & 67108863), w < 67108864 ? (carry = 0) : (carry = (w / 67108864) | 0);\n }\n return ws;\n }),\n (FFTM.prototype.convert13b = function (ws, len, rws, N) {\n for (var carry = 0, i = 0; i < len; i++)\n (carry = carry + (ws[i] | 0)),\n (rws[2 * i] = carry & 8191),\n (carry = carry >>> 13),\n (rws[2 * i + 1] = carry & 8191),\n (carry = carry >>> 13);\n for (i = 2 * len; i < N; ++i) rws[i] = 0;\n assert(carry === 0), assert((carry & -8192) === 0);\n }),\n (FFTM.prototype.stub = function (N) {\n for (var ph = new Array(N), i = 0; i < N; i++) ph[i] = 0;\n return ph;\n }),\n (FFTM.prototype.mulp = function (x, y, out) {\n var N = 2 * this.guessLen13b(x.length, y.length),\n rbt = this.makeRBT(N),\n _ = this.stub(N),\n rws = new Array(N),\n rwst = new Array(N),\n iwst = new Array(N),\n nrws = new Array(N),\n nrwst = new Array(N),\n niwst = new Array(N),\n rmws = out.words;\n (rmws.length = N),\n this.convert13b(x.words, x.length, rws, N),\n this.convert13b(y.words, y.length, nrws, N),\n this.transform(rws, _, rwst, iwst, N, rbt),\n this.transform(nrws, _, nrwst, niwst, N, rbt);\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]), (rwst[i] = rx);\n }\n return (\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 (out.negative = x.negative ^ y.negative),\n (out.length = x.length + y.length),\n out.strip()\n );\n }),\n (BN.prototype.mul = function (num) {\n var out = new BN(null);\n return (out.words = new Array(this.length + num.length)), this.mulTo(num, out);\n }),\n (BN.prototype.mulf = function (num) {\n var out = new BN(null);\n return (out.words = new Array(this.length + num.length)), jumboMulTo(this, num, out);\n }),\n (BN.prototype.imul = function (num) {\n return this.clone().mulTo(num, this);\n }),\n (BN.prototype.imuln = function (num) {\n assert(typeof num == \"number\"), assert(num < 67108864);\n for (var carry = 0, i = 0; i < this.length; i++) {\n var w = (this.words[i] | 0) * num,\n lo = (w & 67108863) + (carry & 67108863);\n (carry >>= 26), (carry += (w / 67108864) | 0), (carry += lo >>> 26), (this.words[i] = lo & 67108863);\n }\n return carry !== 0 && ((this.words[i] = carry), this.length++), this;\n }),\n (BN.prototype.muln = function (num) {\n return this.clone().imuln(num);\n }),\n (BN.prototype.sqr = function () {\n return this.mul(this);\n }),\n (BN.prototype.isqr = function () {\n return this.imul(this.clone());\n }),\n (BN.prototype.pow = function (num) {\n var w = toBitArray(num);\n if (w.length === 0) return new BN(1);\n for (var res = this, i = 0; i < w.length && w[i] === 0; i++, res = res.sqr());\n if (++i < w.length) for (var q = res.sqr(); i < w.length; i++, q = q.sqr()) w[i] !== 0 && (res = res.mul(q));\n return res;\n }),\n (BN.prototype.iushln = function (bits) {\n assert(typeof bits == \"number\" && bits >= 0);\n var r = bits % 26,\n s = (bits - r) / 26,\n carryMask = (67108863 >>> (26 - r)) << (26 - r),\n i;\n if (r !== 0) {\n var carry = 0;\n for (i = 0; i < this.length; i++) {\n var newCarry = this.words[i] & carryMask,\n c = ((this.words[i] | 0) - newCarry) << r;\n (this.words[i] = c | carry), (carry = newCarry >>> (26 - r));\n }\n carry && ((this.words[i] = carry), this.length++);\n }\n if (s !== 0) {\n for (i = this.length - 1; i >= 0; i--) this.words[i + s] = this.words[i];\n for (i = 0; i < s; i++) this.words[i] = 0;\n this.length += s;\n }\n return this.strip();\n }),\n (BN.prototype.ishln = function (bits) {\n return assert(this.negative === 0), this.iushln(bits);\n }),\n (BN.prototype.iushrn = function (bits, hint, extended) {\n assert(typeof bits == \"number\" && bits >= 0);\n var h;\n hint ? (h = (hint - (hint % 26)) / 26) : (h = 0);\n var r = bits % 26,\n s = Math.min((bits - r) / 26, this.length),\n mask = 67108863 ^ ((67108863 >>> r) << r),\n maskedWords = extended;\n if (((h -= s), (h = Math.max(0, h)), maskedWords)) {\n for (var i = 0; i < s; i++) maskedWords.words[i] = this.words[i];\n maskedWords.length = s;\n }\n if (s !== 0)\n if (this.length > s) for (this.length -= s, i = 0; i < this.length; i++) this.words[i] = this.words[i + s];\n else (this.words[0] = 0), (this.length = 1);\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)), (carry = word & mask);\n }\n return (\n maskedWords && carry !== 0 && (maskedWords.words[maskedWords.length++] = carry),\n this.length === 0 && ((this.words[0] = 0), (this.length = 1)),\n this.strip()\n );\n }),\n (BN.prototype.ishrn = function (bits, hint, extended) {\n return assert(this.negative === 0), this.iushrn(bits, hint, extended);\n }),\n (BN.prototype.shln = function (bits) {\n return this.clone().ishln(bits);\n }),\n (BN.prototype.ushln = function (bits) {\n return this.clone().iushln(bits);\n }),\n (BN.prototype.shrn = function (bits) {\n return this.clone().ishrn(bits);\n }),\n (BN.prototype.ushrn = function (bits) {\n return this.clone().iushrn(bits);\n }),\n (BN.prototype.testn = function (bit) {\n assert(typeof bit == \"number\" && bit >= 0);\n var r = bit % 26,\n s = (bit - r) / 26,\n q = 1 << r;\n if (this.length <= s) return !1;\n var w = this.words[s];\n return !!(w & q);\n }),\n (BN.prototype.imaskn = function (bits) {\n assert(typeof bits == \"number\" && bits >= 0);\n var r = bits % 26,\n s = (bits - r) / 26;\n if ((assert(this.negative === 0, \"imaskn works only with positive numbers\"), this.length <= s)) return this;\n if ((r !== 0 && s++, (this.length = Math.min(s, this.length)), r !== 0)) {\n var mask = 67108863 ^ ((67108863 >>> r) << r);\n this.words[this.length - 1] &= mask;\n }\n return this.strip();\n }),\n (BN.prototype.maskn = function (bits) {\n return this.clone().imaskn(bits);\n }),\n (BN.prototype.iaddn = function (num) {\n return (\n assert(typeof num == \"number\"),\n assert(num < 67108864),\n num < 0\n ? this.isubn(-num)\n : this.negative !== 0\n ? this.length === 1 && (this.words[0] | 0) < num\n ? ((this.words[0] = num - (this.words[0] | 0)), (this.negative = 0), this)\n : ((this.negative = 0), this.isubn(num), (this.negative = 1), this)\n : this._iaddn(num)\n );\n }),\n (BN.prototype._iaddn = function (num) {\n this.words[0] += num;\n for (var i = 0; i < this.length && this.words[i] >= 67108864; i++)\n (this.words[i] -= 67108864), i === this.length - 1 ? (this.words[i + 1] = 1) : this.words[i + 1]++;\n return (this.length = Math.max(this.length, i + 1)), this;\n }),\n (BN.prototype.isubn = function (num) {\n if ((assert(typeof num == \"number\"), assert(num < 67108864), num < 0)) return this.iaddn(-num);\n if (this.negative !== 0) return (this.negative = 0), this.iaddn(num), (this.negative = 1), this;\n if (((this.words[0] -= num), this.length === 1 && this.words[0] < 0))\n (this.words[0] = -this.words[0]), (this.negative = 1);\n else\n for (var i = 0; i < this.length && this.words[i] < 0; i++)\n (this.words[i] += 67108864), (this.words[i + 1] -= 1);\n return this.strip();\n }),\n (BN.prototype.addn = function (num) {\n return this.clone().iaddn(num);\n }),\n (BN.prototype.subn = function (num) {\n return this.clone().isubn(num);\n }),\n (BN.prototype.iabs = function () {\n return (this.negative = 0), this;\n }),\n (BN.prototype.abs = function () {\n return this.clone().iabs();\n }),\n (BN.prototype._ishlnsubmul = function (num, mul, shift) {\n var len = num.length + shift,\n i;\n this._expand(len);\n var w,\n 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 & 67108863),\n (carry = (w >> 26) - ((right / 67108864) | 0)),\n (this.words[i + shift] = w & 67108863);\n }\n for (; i < this.length - shift; i++)\n (w = (this.words[i + shift] | 0) + carry), (carry = w >> 26), (this.words[i + shift] = w & 67108863);\n if (carry === 0) return this.strip();\n for (assert(carry === -1), carry = 0, i = 0; i < this.length; i++)\n (w = -(this.words[i] | 0) + carry), (carry = w >> 26), (this.words[i] = w & 67108863);\n return (this.negative = 1), this.strip();\n }),\n (BN.prototype._wordDiv = function (num, mode) {\n var shift = this.length - num.length,\n a = this.clone(),\n b = num,\n bhi = b.words[b.length - 1] | 0,\n bhiBits = this._countBits(bhi);\n (shift = 26 - bhiBits),\n shift !== 0 && ((b = b.ushln(shift)), a.iushln(shift), (bhi = b.words[b.length - 1] | 0));\n var m = a.length - b.length,\n q;\n if (mode !== \"mod\") {\n (q = new BN(null)), (q.length = m + 1), (q.words = new Array(q.length));\n for (var i = 0; i < q.length; i++) q.words[i] = 0;\n }\n var diff = a.clone()._ishlnsubmul(b, 1, m);\n diff.negative === 0 && ((a = diff), q && (q.words[m] = 1));\n for (var j = m - 1; j >= 0; j--) {\n var qj = (a.words[b.length + j] | 0) * 67108864 + (a.words[b.length + j - 1] | 0);\n for (qj = Math.min((qj / bhi) | 0, 67108863), a._ishlnsubmul(b, qj, j); a.negative !== 0; )\n qj--, (a.negative = 0), a._ishlnsubmul(b, 1, j), a.isZero() || (a.negative ^= 1);\n q && (q.words[j] = qj);\n }\n return (\n q && q.strip(),\n a.strip(),\n mode !== \"div\" && shift !== 0 && a.iushrn(shift),\n {\n div: q || null,\n mod: a,\n }\n );\n }),\n (BN.prototype.divmod = function (num, mode, positive) {\n if ((assert(!num.isZero()), this.isZero()))\n return {\n div: new BN(0),\n mod: new BN(0),\n };\n var div, mod, res;\n return this.negative !== 0 && num.negative === 0\n ? ((res = this.neg().divmod(num, mode)),\n mode !== \"mod\" && (div = res.div.neg()),\n mode !== \"div\" && ((mod = res.mod.neg()), positive && mod.negative !== 0 && mod.iadd(num)),\n {\n div,\n mod,\n })\n : this.negative === 0 && num.negative !== 0\n ? ((res = this.divmod(num.neg(), mode)),\n mode !== \"mod\" && (div = res.div.neg()),\n {\n div,\n mod: res.mod,\n })\n : (this.negative & num.negative) !== 0\n ? ((res = this.neg().divmod(num.neg(), mode)),\n mode !== \"div\" && ((mod = res.mod.neg()), positive && mod.negative !== 0 && mod.isub(num)),\n {\n div: res.div,\n mod,\n })\n : num.length > this.length || this.cmp(num) < 0\n ? {\n div: new BN(0),\n mod: this,\n }\n : num.length === 1\n ? mode === \"div\"\n ? {\n div: this.divn(num.words[0]),\n mod: null,\n }\n : mode === \"mod\"\n ? {\n div: null,\n mod: new BN(this.modn(num.words[0])),\n }\n : {\n div: this.divn(num.words[0]),\n mod: new BN(this.modn(num.words[0])),\n }\n : this._wordDiv(num, mode);\n }),\n (BN.prototype.div = function (num) {\n return this.divmod(num, \"div\", !1).div;\n }),\n (BN.prototype.mod = function (num) {\n return this.divmod(num, \"mod\", !1).mod;\n }),\n (BN.prototype.umod = function (num) {\n return this.divmod(num, \"mod\", !0).mod;\n }),\n (BN.prototype.divRound = function (num) {\n var dm = this.divmod(num);\n if (dm.mod.isZero()) return dm.div;\n var mod = dm.div.negative !== 0 ? dm.mod.isub(num) : dm.mod,\n half = num.ushrn(1),\n r2 = num.andln(1),\n cmp = mod.cmp(half);\n return cmp < 0 || (r2 === 1 && cmp === 0)\n ? dm.div\n : dm.div.negative !== 0\n ? dm.div.isubn(1)\n : dm.div.iaddn(1);\n }),\n (BN.prototype.modn = function (num) {\n assert(num <= 67108863);\n for (var p = (1 << 26) % num, acc = 0, i = this.length - 1; i >= 0; i--)\n acc = (p * acc + (this.words[i] | 0)) % num;\n return acc;\n }),\n (BN.prototype.idivn = function (num) {\n assert(num <= 67108863);\n for (var carry = 0, i = this.length - 1; i >= 0; i--) {\n var w = (this.words[i] | 0) + carry * 67108864;\n (this.words[i] = (w / num) | 0), (carry = w % num);\n }\n return this.strip();\n }),\n (BN.prototype.divn = function (num) {\n return this.clone().idivn(num);\n }),\n (BN.prototype.egcd = function (p) {\n assert(p.negative === 0), assert(!p.isZero());\n var x = this,\n y = p.clone();\n x.negative !== 0 ? (x = x.umod(p)) : (x = x.clone());\n for (var A = new BN(1), B = new BN(0), C = new BN(0), D = new BN(1), g = 0; x.isEven() && y.isEven(); )\n x.iushrn(1), y.iushrn(1), ++g;\n for (var yp = y.clone(), xp = x.clone(); !x.isZero(); ) {\n for (var i = 0, im = 1; (x.words[0] & im) === 0 && i < 26; ++i, im <<= 1);\n if (i > 0)\n for (x.iushrn(i); i-- > 0; )\n (A.isOdd() || B.isOdd()) && (A.iadd(yp), B.isub(xp)), A.iushrn(1), B.iushrn(1);\n for (var j = 0, jm = 1; (y.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n if (j > 0)\n for (y.iushrn(j); j-- > 0; )\n (C.isOdd() || D.isOdd()) && (C.iadd(yp), D.isub(xp)), C.iushrn(1), D.iushrn(1);\n x.cmp(y) >= 0 ? (x.isub(y), A.isub(C), B.isub(D)) : (y.isub(x), C.isub(A), D.isub(B));\n }\n return {\n a: C,\n b: D,\n gcd: y.iushln(g),\n };\n }),\n (BN.prototype._invmp = function (p) {\n assert(p.negative === 0), assert(!p.isZero());\n var a = this,\n b = p.clone();\n a.negative !== 0 ? (a = a.umod(p)) : (a = a.clone());\n for (var x1 = new BN(1), x2 = new BN(0), delta = b.clone(); 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) for (a.iushrn(i); i-- > 0; ) x1.isOdd() && x1.iadd(delta), x1.iushrn(1);\n for (var j = 0, jm = 1; (b.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n if (j > 0) for (b.iushrn(j); j-- > 0; ) x2.isOdd() && x2.iadd(delta), x2.iushrn(1);\n a.cmp(b) >= 0 ? (a.isub(b), x1.isub(x2)) : (b.isub(a), x2.isub(x1));\n }\n var res;\n return a.cmpn(1) === 0 ? (res = x1) : (res = x2), res.cmpn(0) < 0 && res.iadd(p), res;\n }),\n (BN.prototype.gcd = function (num) {\n if (this.isZero()) return num.abs();\n if (num.isZero()) return this.abs();\n var a = this.clone(),\n b = num.clone();\n (a.negative = 0), (b.negative = 0);\n for (var shift = 0; a.isEven() && b.isEven(); shift++) a.iushrn(1), b.iushrn(1);\n do {\n for (; a.isEven(); ) a.iushrn(1);\n for (; b.isEven(); ) b.iushrn(1);\n var r = a.cmp(b);\n if (r < 0) {\n var t = a;\n (a = b), (b = t);\n } else if (r === 0 || b.cmpn(1) === 0) break;\n a.isub(b);\n } while (!0);\n return b.iushln(shift);\n }),\n (BN.prototype.invm = function (num) {\n return this.egcd(num).a.umod(num);\n }),\n (BN.prototype.isEven = function () {\n return (this.words[0] & 1) === 0;\n }),\n (BN.prototype.isOdd = function () {\n return (this.words[0] & 1) === 1;\n }),\n (BN.prototype.andln = function (num) {\n return this.words[0] & num;\n }),\n (BN.prototype.bincn = function (bit) {\n assert(typeof bit == \"number\");\n var r = bit % 26,\n s = (bit - r) / 26,\n q = 1 << r;\n if (this.length <= s) return this._expand(s + 1), (this.words[s] |= q), this;\n for (var carry = q, i = s; carry !== 0 && i < this.length; i++) {\n var w = this.words[i] | 0;\n (w += carry), (carry = w >>> 26), (w &= 67108863), (this.words[i] = w);\n }\n return carry !== 0 && ((this.words[i] = carry), this.length++), this;\n }),\n (BN.prototype.isZero = function () {\n return this.length === 1 && this.words[0] === 0;\n }),\n (BN.prototype.cmpn = function (num) {\n var negative = num < 0;\n if (this.negative !== 0 && !negative) return -1;\n if (this.negative === 0 && negative) return 1;\n this.strip();\n var res;\n if (this.length > 1) res = 1;\n else {\n negative && (num = -num), assert(num <= 67108863, \"Number is too big\");\n var w = this.words[0] | 0;\n res = w === num ? 0 : w < num ? -1 : 1;\n }\n return this.negative !== 0 ? -res | 0 : res;\n }),\n (BN.prototype.cmp = function (num) {\n if (this.negative !== 0 && num.negative === 0) return -1;\n if (this.negative === 0 && num.negative !== 0) return 1;\n var res = this.ucmp(num);\n return this.negative !== 0 ? -res | 0 : res;\n }),\n (BN.prototype.ucmp = function (num) {\n if (this.length > num.length) return 1;\n if (this.length < num.length) return -1;\n for (var res = 0, i = this.length - 1; i >= 0; i--) {\n var a = this.words[i] | 0,\n b = num.words[i] | 0;\n if (a !== b) {\n a < b ? (res = -1) : a > b && (res = 1);\n break;\n }\n }\n return res;\n }),\n (BN.prototype.gtn = function (num) {\n return this.cmpn(num) === 1;\n }),\n (BN.prototype.gt = function (num) {\n return this.cmp(num) === 1;\n }),\n (BN.prototype.gten = function (num) {\n return this.cmpn(num) >= 0;\n }),\n (BN.prototype.gte = function (num) {\n return this.cmp(num) >= 0;\n }),\n (BN.prototype.ltn = function (num) {\n return this.cmpn(num) === -1;\n }),\n (BN.prototype.lt = function (num) {\n return this.cmp(num) === -1;\n }),\n (BN.prototype.lten = function (num) {\n return this.cmpn(num) <= 0;\n }),\n (BN.prototype.lte = function (num) {\n return this.cmp(num) <= 0;\n }),\n (BN.prototype.eqn = function (num) {\n return this.cmpn(num) === 0;\n }),\n (BN.prototype.eq = function (num) {\n return this.cmp(num) === 0;\n }),\n (BN.red = function (num) {\n return new Red(num);\n }),\n (BN.prototype.toRed = function (ctx) {\n return (\n assert(!this.red, \"Already a number in reduction context\"),\n assert(this.negative === 0, \"red works only with positives\"),\n ctx.convertTo(this)._forceRed(ctx)\n );\n }),\n (BN.prototype.fromRed = function () {\n return assert(this.red, \"fromRed works only with numbers in reduction context\"), this.red.convertFrom(this);\n }),\n (BN.prototype._forceRed = function (ctx) {\n return (this.red = ctx), this;\n }),\n (BN.prototype.forceRed = function (ctx) {\n return assert(!this.red, \"Already a number in reduction context\"), this._forceRed(ctx);\n }),\n (BN.prototype.redAdd = function (num) {\n return assert(this.red, \"redAdd works only with red numbers\"), this.red.add(this, num);\n }),\n (BN.prototype.redIAdd = function (num) {\n return assert(this.red, \"redIAdd works only with red numbers\"), this.red.iadd(this, num);\n }),\n (BN.prototype.redSub = function (num) {\n return assert(this.red, \"redSub works only with red numbers\"), this.red.sub(this, num);\n }),\n (BN.prototype.redISub = function (num) {\n return assert(this.red, \"redISub works only with red numbers\"), this.red.isub(this, num);\n }),\n (BN.prototype.redShl = function (num) {\n return assert(this.red, \"redShl works only with red numbers\"), this.red.shl(this, num);\n }),\n (BN.prototype.redMul = function (num) {\n return (\n assert(this.red, \"redMul works only with red numbers\"),\n this.red._verify2(this, num),\n this.red.mul(this, num)\n );\n }),\n (BN.prototype.redIMul = function (num) {\n return (\n assert(this.red, \"redMul works only with red numbers\"),\n this.red._verify2(this, num),\n this.red.imul(this, num)\n );\n }),\n (BN.prototype.redSqr = function () {\n return assert(this.red, \"redSqr works only with red numbers\"), this.red._verify1(this), this.red.sqr(this);\n }),\n (BN.prototype.redISqr = function () {\n return assert(this.red, \"redISqr works only with red numbers\"), this.red._verify1(this), this.red.isqr(this);\n }),\n (BN.prototype.redSqrt = function () {\n return assert(this.red, \"redSqrt works only with red numbers\"), this.red._verify1(this), this.red.sqrt(this);\n }),\n (BN.prototype.redInvm = function () {\n return assert(this.red, \"redInvm works only with red numbers\"), this.red._verify1(this), this.red.invm(this);\n }),\n (BN.prototype.redNeg = function () {\n return assert(this.red, \"redNeg works only with red numbers\"), this.red._verify1(this), this.red.neg(this);\n }),\n (BN.prototype.redPow = function (num) {\n return assert(this.red && !num.red, \"redPow(normalNum)\"), this.red._verify1(this), this.red.pow(this, num);\n });\n var primes = {\n k256: null,\n p224: null,\n p192: null,\n p25519: null,\n };\n function MPrime(name, p) {\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 (this.tmp = this._tmp());\n }\n (MPrime.prototype._tmp = function () {\n var tmp = new BN(null);\n return (tmp.words = new Array(Math.ceil(this.n / 13))), tmp;\n }),\n (MPrime.prototype.ireduce = function (num) {\n var r = num,\n rlen;\n do this.split(r, this.tmp), (r = this.imulK(r)), (r = r.iadd(this.tmp)), (rlen = r.bitLength());\n while (rlen > this.n);\n var cmp = rlen < this.n ? -1 : r.ucmp(this.p);\n return (\n cmp === 0\n ? ((r.words[0] = 0), (r.length = 1))\n : cmp > 0\n ? r.isub(this.p)\n : r.strip !== void 0\n ? r.strip()\n : r._strip(),\n r\n );\n }),\n (MPrime.prototype.split = function (input, out) {\n input.iushrn(this.n, 0, out);\n }),\n (MPrime.prototype.imulK = function (num) {\n return num.imul(this.k);\n });\n function K256() {\n MPrime.call(this, \"k256\", \"ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f\");\n }\n inherits(K256, MPrime),\n (K256.prototype.split = function (input, output) {\n for (var mask = 4194303, outLen = Math.min(input.length, 9), i = 0; i < outLen; i++)\n output.words[i] = input.words[i];\n if (((output.length = outLen), input.length <= 9)) {\n (input.words[0] = 0), (input.length = 1);\n return;\n }\n var prev = input.words[9];\n for (output.words[output.length++] = prev & mask, i = 10; i < input.length; i++) {\n var next = input.words[i] | 0;\n (input.words[i - 10] = ((next & mask) << 4) | (prev >>> 22)), (prev = next);\n }\n (prev >>>= 22),\n (input.words[i - 10] = prev),\n prev === 0 && input.length > 10 ? (input.length -= 10) : (input.length -= 9);\n }),\n (K256.prototype.imulK = function (num) {\n (num.words[num.length] = 0), (num.words[num.length + 1] = 0), (num.length += 2);\n for (var lo = 0, i = 0; i < num.length; i++) {\n var w = num.words[i] | 0;\n (lo += w * 977), (num.words[i] = lo & 67108863), (lo = w * 64 + ((lo / 67108864) | 0));\n }\n return (\n num.words[num.length - 1] === 0 && (num.length--, num.words[num.length - 1] === 0 && num.length--), num\n );\n });\n function P224() {\n MPrime.call(this, \"p224\", \"ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001\");\n }\n inherits(P224, MPrime);\n function P192() {\n MPrime.call(this, \"p192\", \"ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff\");\n }\n inherits(P192, MPrime);\n function P25519() {\n MPrime.call(this, \"25519\", \"7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed\");\n }\n inherits(P25519, MPrime),\n (P25519.prototype.imulK = function (num) {\n for (var carry = 0, i = 0; i < num.length; i++) {\n var hi = (num.words[i] | 0) * 19 + carry,\n lo = hi & 67108863;\n (hi >>>= 26), (num.words[i] = lo), (carry = hi);\n }\n return carry !== 0 && (num.words[num.length++] = carry), num;\n }),\n (BN._prime = function (name) {\n if (primes[name]) return primes[name];\n var prime2;\n if (name === \"k256\") prime2 = new K256();\n else if (name === \"p224\") prime2 = new P224();\n else if (name === \"p192\") prime2 = new P192();\n else if (name === \"p25519\") prime2 = new P25519();\n else throw new Error(\"Unknown prime \" + name);\n return (primes[name] = prime2), prime2;\n });\n function Red(m) {\n if (typeof m == \"string\") {\n var prime = BN._prime(m);\n (this.m = prime.p), (this.prime = prime);\n } else assert(m.gtn(1), \"modulus must be greater than 1\"), (this.m = m), (this.prime = null);\n }\n (Red.prototype._verify1 = function (a) {\n assert(a.negative === 0, \"red works only with positives\"), assert(a.red, \"red works only with red numbers\");\n }),\n (Red.prototype._verify2 = function (a, b) {\n assert((a.negative | b.negative) === 0, \"red works only with positives\"),\n assert(a.red && a.red === b.red, \"red works only with red numbers\");\n }),\n (Red.prototype.imod = function (a) {\n return this.prime ? this.prime.ireduce(a)._forceRed(this) : a.umod(this.m)._forceRed(this);\n }),\n (Red.prototype.neg = function (a) {\n return a.isZero() ? a.clone() : this.m.sub(a)._forceRed(this);\n }),\n (Red.prototype.add = function (a, b) {\n this._verify2(a, b);\n var res = a.add(b);\n return res.cmp(this.m) >= 0 && res.isub(this.m), res._forceRed(this);\n }),\n (Red.prototype.iadd = function (a, b) {\n this._verify2(a, b);\n var res = a.iadd(b);\n return res.cmp(this.m) >= 0 && res.isub(this.m), res;\n }),\n (Red.prototype.sub = function (a, b) {\n this._verify2(a, b);\n var res = a.sub(b);\n return res.cmpn(0) < 0 && res.iadd(this.m), res._forceRed(this);\n }),\n (Red.prototype.isub = function (a, b) {\n this._verify2(a, b);\n var res = a.isub(b);\n return res.cmpn(0) < 0 && res.iadd(this.m), res;\n }),\n (Red.prototype.shl = function (a, num) {\n return this._verify1(a), this.imod(a.ushln(num));\n }),\n (Red.prototype.imul = function (a, b) {\n return this._verify2(a, b), this.imod(a.imul(b));\n }),\n (Red.prototype.mul = function (a, b) {\n return this._verify2(a, b), this.imod(a.mul(b));\n }),\n (Red.prototype.isqr = function (a) {\n return this.imul(a, a.clone());\n }),\n (Red.prototype.sqr = function (a) {\n return this.mul(a, a);\n }),\n (Red.prototype.sqrt = function (a) {\n if (a.isZero()) return a.clone();\n var mod3 = this.m.andln(3);\n if ((assert(mod3 % 2 === 1), mod3 === 3)) {\n var pow = this.m.add(new BN(1)).iushrn(2);\n return this.pow(a, pow);\n }\n for (var q = this.m.subn(1), s = 0; !q.isZero() && q.andln(1) === 0; ) s++, q.iushrn(1);\n assert(!q.isZero());\n var one = new BN(1).toRed(this),\n nOne = one.redNeg(),\n lpow = this.m.subn(1).iushrn(1),\n z = this.m.bitLength();\n for (z = new BN(2 * z * z).toRed(this); this.pow(z, lpow).cmp(nOne) !== 0; ) z.redIAdd(nOne);\n for (\n var c = this.pow(z, q), r = this.pow(a, q.addn(1).iushrn(1)), t = this.pow(a, q), m = s;\n t.cmp(one) !== 0;\n\n ) {\n for (var tmp = t, i = 0; tmp.cmp(one) !== 0; i++) tmp = tmp.redSqr();\n assert(i < m);\n var b = this.pow(c, new BN(1).iushln(m - i - 1));\n (r = r.redMul(b)), (c = b.redSqr()), (t = t.redMul(c)), (m = i);\n }\n return r;\n }),\n (Red.prototype.invm = function (a) {\n var inv = a._invmp(this.m);\n return inv.negative !== 0 ? ((inv.negative = 0), this.imod(inv).redNeg()) : this.imod(inv);\n }),\n (Red.prototype.pow = function (a, num) {\n if (num.isZero()) return new BN(1).toRed(this);\n if (num.cmpn(1) === 0) return a.clone();\n var windowSize = 4,\n wnd = new Array(1 << windowSize);\n (wnd[0] = new BN(1).toRed(this)), (wnd[1] = a);\n for (var i = 2; i < wnd.length; i++) wnd[i] = this.mul(wnd[i - 1], a);\n var res = wnd[0],\n current = 0,\n currentLen = 0,\n start = num.bitLength() % 26;\n for (start === 0 && (start = 26), i = num.length - 1; i >= 0; i--) {\n for (var word = num.words[i], j = start - 1; j >= 0; j--) {\n var bit = (word >> j) & 1;\n if ((res !== wnd[0] && (res = this.sqr(res)), bit === 0 && current === 0)) {\n currentLen = 0;\n continue;\n }\n (current <<= 1),\n (current |= bit),\n currentLen++,\n !(currentLen !== windowSize && (i !== 0 || j !== 0)) &&\n ((res = this.mul(res, wnd[current])), (currentLen = 0), (current = 0));\n }\n start = 26;\n }\n return res;\n }),\n (Red.prototype.convertTo = function (num) {\n var r = num.umod(this.m);\n return r === num ? r.clone() : r;\n }),\n (Red.prototype.convertFrom = function (num) {\n var res = num.clone();\n return (res.red = null), res;\n }),\n (BN.mont = function (num) {\n return new Mont(num);\n });\n function Mont(m) {\n Red.call(this, m),\n (this.shift = this.m.bitLength()),\n this.shift % 26 !== 0 && (this.shift += 26 - (this.shift % 26)),\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 (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 (Mont.prototype.convertTo = function (num) {\n return this.imod(num.ushln(this.shift));\n }),\n (Mont.prototype.convertFrom = function (num) {\n var r = this.imod(num.mul(this.rinv));\n return (r.red = null), r;\n }),\n (Mont.prototype.imul = function (a, b) {\n if (a.isZero() || b.isZero()) return (a.words[0] = 0), (a.length = 1), a;\n var t = a.imul(b),\n c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m),\n u = t.isub(c).iushrn(this.shift),\n res = u;\n return (\n u.cmp(this.m) >= 0 ? (res = u.isub(this.m)) : u.cmpn(0) < 0 && (res = u.iadd(this.m)), res._forceRed(this)\n );\n }),\n (Mont.prototype.mul = function (a, b) {\n if (a.isZero() || b.isZero()) return new BN(0)._forceRed(this);\n var t = a.mul(b),\n c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m),\n u = t.isub(c).iushrn(this.shift),\n res = u;\n return (\n u.cmp(this.m) >= 0 ? (res = u.isub(this.m)) : u.cmpn(0) < 0 && (res = u.iadd(this.m)), res._forceRed(this)\n );\n }),\n (Mont.prototype.invm = function (a) {\n var res = this.imod(a._invmp(this.m).mul(this.r2));\n return res._forceRed(this);\n });\n })(typeof module > \"u\" || module, exports);\n },\n});\n\nconst { CryptoHasher } = globalThis.Bun;\n\n// node_modules/public-encrypt/withPublic.js\nvar require_withPublic = __commonJS({\n \"node_modules/public-encrypt/withPublic.js\"(exports, module) {\n var BN = require_bn7(),\n Buffer2 = require_safe_buffer().Buffer;\n function withPublic(paddedMsg, key) {\n return Buffer2.from(paddedMsg.toRed(BN.mont(key.modulus)).redPow(new BN(key.publicExponent)).fromRed().toArray());\n }\n module.exports = withPublic;\n },\n});\n\n// node_modules/public-encrypt/publicEncrypt.js\nvar require_publicEncrypt = __commonJS({\n \"node_modules/public-encrypt/publicEncrypt.js\"(exports, module) {\n var parseKeys = require_parse_asn1(),\n randomBytes = require_browser(),\n createHash = require_browser2(),\n mgf = require_mgf(),\n xor = require_xor(),\n BN = require_bn7(),\n withPublic = require_withPublic(),\n crt = require_browserify_rsa(),\n Buffer2 = require_safe_buffer().Buffer;\n module.exports = function (publicKey, msg, reverse) {\n var padding;\n publicKey.padding ? (padding = publicKey.padding) : reverse ? (padding = 1) : (padding = 4);\n var key = parseKeys(publicKey),\n paddedMsg;\n if (padding === 4) paddedMsg = oaep(key, msg);\n else if (padding === 1) paddedMsg = pkcs1(key, msg, reverse);\n else if (padding === 3) {\n if (((paddedMsg = new BN(msg)), paddedMsg.cmp(key.modulus) >= 0)) throw new Error(\"data too long for modulus\");\n } else throw new Error(\"unknown padding\");\n return reverse ? crt(paddedMsg, key) : withPublic(paddedMsg, key);\n };\n function oaep(key, msg) {\n var k = key.modulus.byteLength(),\n mLen = msg.length,\n iHash = createHash(\"sha1\").update(Buffer2.alloc(0)).digest(),\n hLen = iHash.length,\n hLen2 = 2 * hLen;\n if (mLen > k - hLen2 - 2) throw new Error(\"message too long\");\n var ps = Buffer2.alloc(k - mLen - hLen2 - 2),\n dblen = k - hLen - 1,\n seed = randomBytes(hLen),\n maskedDb = xor(Buffer2.concat([iHash, ps, Buffer2.alloc(1, 1), msg], dblen), mgf(seed, dblen)),\n maskedSeed = xor(seed, mgf(maskedDb, hLen));\n return new BN(Buffer2.concat([Buffer2.alloc(1), maskedSeed, maskedDb], k));\n }\n function pkcs1(key, msg, reverse) {\n var mLen = msg.length,\n k = key.modulus.byteLength();\n if (mLen > k - 11) throw new Error(\"message too long\");\n var ps;\n return (\n reverse ? (ps = Buffer2.alloc(k - mLen - 3, 255)) : (ps = nonZero(k - mLen - 3)),\n new BN(Buffer2.concat([Buffer2.from([0, reverse ? 1 : 2]), ps, Buffer2.alloc(1), msg], k))\n );\n }\n function nonZero(len) {\n for (var out = Buffer2.allocUnsafe(len), i = 0, cache = randomBytes(len * 2), cur = 0, num; i < len; )\n cur === cache.length && ((cache = randomBytes(len * 2)), (cur = 0)),\n (num = cache[cur++]),\n num && (out[i++] = num);\n return out;\n }\n },\n});\n\n// node_modules/public-encrypt/privateDecrypt.js\nvar require_privateDecrypt = __commonJS({\n \"node_modules/public-encrypt/privateDecrypt.js\"(exports, module) {\n var parseKeys = require_parse_asn1(),\n mgf = require_mgf(),\n xor = require_xor(),\n BN = require_bn7(),\n crt = require_browserify_rsa(),\n createHash = require_browser2(),\n withPublic = require_withPublic(),\n Buffer2 = require_safe_buffer().Buffer;\n module.exports = function (privateKey, enc, reverse) {\n var padding;\n privateKey.padding ? (padding = privateKey.padding) : reverse ? (padding = 1) : (padding = 4);\n var key = parseKeys(privateKey),\n k = key.modulus.byteLength();\n if (enc.length > k || new BN(enc).cmp(key.modulus) >= 0) throw new Error(\"decryption error\");\n var msg;\n reverse ? (msg = withPublic(new BN(enc), key)) : (msg = crt(enc, key));\n var zBuffer = Buffer2.alloc(k - msg.length);\n if (((msg = Buffer2.concat([zBuffer, msg], k)), padding === 4)) return oaep(key, msg);\n if (padding === 1) return pkcs1(key, msg, reverse);\n if (padding === 3) return msg;\n throw new Error(\"unknown padding\");\n };\n function oaep(key, msg) {\n var k = key.modulus.byteLength(),\n iHash = createHash(\"sha1\").update(Buffer2.alloc(0)).digest(),\n hLen = iHash.length;\n if (msg[0] !== 0) throw new Error(\"decryption error\");\n var maskedSeed = msg.slice(1, hLen + 1),\n maskedDb = msg.slice(hLen + 1),\n seed = xor(maskedSeed, mgf(maskedDb, hLen)),\n db = xor(maskedDb, mgf(seed, k - hLen - 1));\n if (compare(iHash, db.slice(0, hLen))) throw new Error(\"decryption error\");\n for (var i = hLen; db[i] === 0; ) i++;\n if (db[i++] !== 1) throw new Error(\"decryption error\");\n return db.slice(i);\n }\n function pkcs1(key, msg, reverse) {\n for (var p1 = msg.slice(0, 2), i = 2, status = 0; msg[i++] !== 0; )\n if (i >= msg.length) {\n status++;\n break;\n }\n var ps = msg.slice(2, i - 1);\n if (\n (((p1.toString(\"hex\") !== \"0002\" && !reverse) || (p1.toString(\"hex\") !== \"0001\" && reverse)) && status++,\n ps.length < 8 && status++,\n status)\n )\n throw new Error(\"decryption error\");\n return msg.slice(i);\n }\n function compare(a, b) {\n (a = Buffer2.from(a)), (b = Buffer2.from(b));\n var dif = 0,\n len = a.length;\n a.length !== b.length && (dif++, (len = Math.min(a.length, b.length)));\n for (var i = -1; ++i < len; ) dif += a[i] ^ b[i];\n return dif;\n }\n },\n});\n\n// node_modules/public-encrypt/browser.js\nvar require_browser10 = __commonJS({\n \"node_modules/public-encrypt/browser.js\"(exports) {\n exports.publicEncrypt = require_publicEncrypt();\n exports.privateDecrypt = require_privateDecrypt();\n exports.privateEncrypt = function (key, buf) {\n return exports.publicEncrypt(key, buf, !0);\n };\n exports.publicDecrypt = function (key, buf) {\n return exports.privateDecrypt(key, buf, !0);\n };\n },\n});\n\n// node_modules/randomfill/browser.js\nvar require_browser11 = __commonJS({\n \"node_modules/randomfill/browser.js\"(exports) {\n \"use strict\";\n var safeBuffer = require_safe_buffer(),\n randombytes = require_browser(),\n Buffer2 = safeBuffer.Buffer,\n kBufferMaxLength = safeBuffer.kMaxLength,\n kMaxUint32 = Math.pow(2, 32) - 1;\n function assertOffset(offset, length) {\n if (typeof offset != \"number\" || offset !== offset) throw new TypeError(\"offset must be a number\");\n if (offset > kMaxUint32 || offset < 0) throw new TypeError(\"offset must be a uint32\");\n if (offset > kBufferMaxLength || offset > length) throw new RangeError(\"offset out of range\");\n }\n function assertSize(size, offset, length) {\n if (typeof size != \"number\" || size !== size) throw new TypeError(\"size must be a number\");\n if (size > kMaxUint32 || size < 0) throw new TypeError(\"size must be a uint32\");\n if (size + offset > length || size > kBufferMaxLength) throw new RangeError(\"buffer too small\");\n }\n\n exports.randomFill = randomFill;\n exports.randomFillSync = randomFillSync;\n\n function randomFill(buf, offset, size, cb) {\n if (!Buffer2.isBuffer(buf) && !(buf instanceof global.Uint8Array))\n throw new TypeError('\"buf\" argument must be a Buffer or Uint8Array');\n if (typeof offset == \"function\") (cb = offset), (offset = 0), (size = buf.length);\n else if (typeof size == \"function\") (cb = size), (size = buf.length - offset);\n else if (typeof cb != \"function\") throw new TypeError('\"cb\" argument must be a function');\n return assertOffset(offset, buf.length), assertSize(size, offset, buf.length), actualFill(buf, offset, size, cb);\n }\n function actualFill(buf, offset, size, cb) {\n if (cb) {\n randombytes(size, function (err, bytes2) {\n if (err) return cb(err);\n bytes2.copy(buf, offset), cb(null, buf);\n });\n return;\n }\n var bytes = randombytes(size);\n return bytes.copy(buf, offset), buf;\n }\n function randomFillSync(buf, offset, size) {\n if ((typeof offset > \"u\" && (offset = 0), !Buffer2.isBuffer(buf) && !(buf instanceof global.Uint8Array)))\n throw new TypeError('\"buf\" argument must be a Buffer or Uint8Array');\n return (\n assertOffset(offset, buf.length),\n size === void 0 && (size = buf.length - offset),\n assertSize(size, offset, buf.length),\n actualFill(buf, offset, size)\n );\n }\n },\n});\n\n// node_modules/crypto-browserify/index.js\nvar require_crypto_browserify2 = __commonJS({\n \"node_modules/crypto-browserify/index.js\"(exports) {\n \"use strict\";\n exports.randomBytes = exports.rng = exports.pseudoRandomBytes = exports.prng = require_browser();\n exports.createHash = require_browser2();\n exports.Hash = exports.createHash.Hash;\n exports.createHmac = exports.Hmac = require_browser3();\n var algos = require_algos(),\n algoKeys = Object.keys(algos),\n hashes = [\"sha1\", \"sha224\", \"sha256\", \"sha384\", \"sha512\", \"md5\", \"rmd160\"].concat(algoKeys);\n exports.getHashes = function () {\n return hashes;\n };\n var p = require_browser4();\n exports.pbkdf2 = p.pbkdf2;\n exports.pbkdf2Sync = p.pbkdf2Sync;\n var aes = require_browser6();\n exports.Cipher = aes.Cipher;\n exports.createCipher = aes.createCipher;\n exports.Cipheriv = aes.Cipheriv;\n exports.createCipheriv = aes.createCipheriv;\n exports.Decipher = aes.Decipher;\n exports.createDecipher = aes.createDecipher;\n exports.Decipheriv = aes.Decipheriv;\n exports.createDecipheriv = aes.createDecipheriv;\n exports.getCiphers = aes.getCiphers;\n exports.listCiphers = aes.listCiphers;\n var dh = require_browser7();\n exports.DiffieHellmanGroup = dh.DiffieHellmanGroup;\n exports.createDiffieHellmanGroup = dh.createDiffieHellmanGroup;\n exports.getDiffieHellman = dh.getDiffieHellman;\n exports.createDiffieHellman = dh.createDiffieHellman;\n exports.DiffieHellman = dh.DiffieHellman;\n var sign = require_browser8();\n exports.createSign = sign.createSign;\n exports.Sign = sign.Sign;\n exports.createVerify = sign.createVerify;\n exports.Verify = sign.Verify;\n exports.createECDH = require_browser9();\n var publicEncrypt = require_browser10();\n exports.publicEncrypt = publicEncrypt.publicEncrypt;\n exports.privateEncrypt = publicEncrypt.privateEncrypt;\n exports.publicDecrypt = publicEncrypt.publicDecrypt;\n exports.privateDecrypt = publicEncrypt.privateDecrypt;\n exports.getRandomValues = values => crypto.getRandomValues(values);\n var rf = require_browser11();\n exports.randomFill = rf.randomFill;\n exports.randomFillSync = rf.randomFillSync;\n exports.createCredentials = function () {\n throw new Error(\n [\n \"sorry, createCredentials is not implemented yet\",\n \"we accept pull requests\",\n \"https://github.com/crypto-browserify/crypto-browserify\",\n ].join(`\n`),\n );\n };\n exports.constants = {\n DH_CHECK_P_NOT_SAFE_PRIME: 2,\n DH_CHECK_P_NOT_PRIME: 1,\n DH_UNABLE_TO_CHECK_GENERATOR: 4,\n DH_NOT_SUITABLE_GENERATOR: 8,\n NPN_ENABLED: 1,\n ALPN_ENABLED: 1,\n RSA_PKCS1_PADDING: 1,\n RSA_SSLV23_PADDING: 2,\n RSA_NO_PADDING: 3,\n RSA_PKCS1_OAEP_PADDING: 4,\n RSA_X931_PADDING: 5,\n RSA_PKCS1_PSS_PADDING: 6,\n POINT_CONVERSION_COMPRESSED: 2,\n POINT_CONVERSION_UNCOMPRESSED: 4,\n POINT_CONVERSION_HYBRID: 6,\n };\n },\n});\n\n// crypto.js\nvar crypto_exports = {\n ...require_crypto_browserify2(),\n [Symbol.for(\"CommonJS\")]: 0,\n};\nvar DEFAULT_ENCODING = \"buffer\",\n getRandomValues = array => crypto.getRandomValues(array),\n randomUUID = () => crypto.randomUUID(),\n timingSafeEqual =\n \"timingSafeEqual\" in crypto\n ? (a, b) => {\n let { byteLength: byteLengthA } = a,\n { byteLength: byteLengthB } = b;\n if (typeof byteLengthA != \"number\" || typeof byteLengthB != \"number\")\n throw new TypeError(\"Input must be an array buffer view\");\n if (byteLengthA !== byteLengthB) throw new RangeError(\"Input buffers must have the same length\");\n return crypto.timingSafeEqual(a, b);\n }\n : void 0,\n scryptSync =\n \"scryptSync\" in crypto\n ? (password, salt, keylen, options) => {\n let res = crypto.scryptSync(password, salt, keylen, options);\n return DEFAULT_ENCODING !== \"buffer\" ? new Buffer(res).toString(DEFAULT_ENCODING) : new Buffer(res);\n }\n : void 0,\n scrypt =\n \"scryptSync\" in crypto\n ? function (password, salt, keylen, options, callback) {\n if (\n (typeof options == \"function\" && ((callback = options), (options = void 0)), typeof callback != \"function\")\n ) {\n var err = new TypeError(\"callback must be a function\");\n throw ((err.code = \"ERR_INVALID_CALLBACK\"), err);\n }\n try {\n let result = crypto.scryptSync(password, salt, keylen, options);\n process.nextTick(\n callback,\n null,\n DEFAULT_ENCODING !== \"buffer\" ? new Buffer(result).toString(DEFAULT_ENCODING) : new Buffer(result),\n );\n } catch (err2) {\n throw err2;\n }\n }\n : void 0;\ntimingSafeEqual &&\n (Object.defineProperty(timingSafeEqual, \"name\", {\n value: \"::bunternal::\",\n }),\n Object.defineProperty(scrypt, \"name\", {\n value: \"::bunternal::\",\n }),\n Object.defineProperty(scryptSync, \"name\", {\n value: \"::bunternal::\",\n }));\nvar webcrypto = crypto;\n__export(crypto_exports, {\n DEFAULT_ENCODING: () => DEFAULT_ENCODING,\n getRandomValues: () => getRandomValues,\n randomUUID: () => randomUUID,\n scrypt: () => scrypt,\n scryptSync: () => scryptSync,\n timingSafeEqual: () => timingSafeEqual,\n webcrypto: () => webcrypto,\n subtle: () => webcrypto.subtle,\n});\n\nexport const {\n randomBytes,\n rng,\n pseudoRandomBytes,\n prng,\n Hash,\n createHash,\n createHmac,\n Hmac,\n getHashes,\n pbkdf2,\n pbkdf2Sync,\n Cipher,\n createCipher,\n Cipheriv,\n createCipheriv,\n Decipher,\n createDecipher,\n Decipheriv,\n createDecipheriv,\n getCiphers,\n listCiphers,\n DiffieHellmanGroup,\n createDiffieHellmanGroup,\n getDiffieHellman,\n createDiffieHellman,\n DiffieHellman,\n createSign,\n Sign,\n createVerify,\n Verify,\n createECDH,\n publicEncrypt,\n privateEncrypt,\n publicDecrypt,\n privateDecrypt,\n randomFill,\n randomFillSync,\n createCredentials,\n constants,\n} = crypto_exports;\nexport { DEFAULT_ENCODING, getRandomValues, randomUUID, scrypt, scryptSync, timingSafeEqual, webcrypto };\nexport default crypto_exports;\n/*! safe-buffer. MIT License. Feross Aboukhadijeh <https://feross.org/opensource> */\n", - "// Hardcoded module \"node:crypto\"\nvar __create = Object.create;\nvar __defProp = Object.defineProperty;\nvar __getOwnPropDesc = Object.getOwnPropertyDescriptor;\nvar __getOwnPropNames = Object.getOwnPropertyNames;\nvar __getProtoOf = Object.getPrototypeOf,\n __hasOwnProp = Object.prototype.hasOwnProperty;\n\nconst MAX_STRING_LENGTH = 536870888;\n\nvar __require = id => import.meta.require(id);\nconst crypto = globalThis.crypto;\nconst globalCrypto = crypto;\n\nvar __esm = (fn, res) =>\n function () {\n return fn && (res = (0, fn[__getOwnPropNames(fn)[0]])((fn = 0))), res;\n };\nvar __commonJS = (cb, mod) =>\n function () {\n return mod || (0, cb[__getOwnPropNames(cb)[0]])((mod = { exports: {} }).exports, mod), mod.exports;\n };\nvar __export = (target, all) => {\n for (var name in all) __defProp(target, name, { get: all[name], enumerable: !0 });\n },\n __copyProps = (to, from, except, desc) => {\n if ((from && typeof from == \"object\") || typeof from == \"function\")\n for (let key of __getOwnPropNames(from))\n !__hasOwnProp.call(to, key) &&\n key !== except &&\n __defProp(to, key, {\n get: () => from[key],\n enumerable: !(desc = __getOwnPropDesc(from, key)) || desc.enumerable,\n });\n return to;\n },\n __reExport = (target, mod, secondTarget) => (\n __copyProps(target, mod, \"default\"), secondTarget && __copyProps(secondTarget, mod, \"default\")\n ),\n __toESM = (mod, isNodeMode, target) => (\n (target = mod != null ? __create(__getProtoOf(mod)) : {}),\n __copyProps(\n isNodeMode || !mod || !mod.__esModule ? __defProp(target, \"default\", { value: mod, enumerable: !0 }) : target,\n mod,\n )\n );\n\n// node_modules/safe-buffer/index.js\nvar require_safe_buffer = __commonJS({\n \"node_modules/safe-buffer/index.js\"(exports, module) {\n var buffer = __require(\"buffer\"),\n Buffer2 = buffer.Buffer;\n function copyProps(src, dst) {\n for (var key in src) dst[key] = src[key];\n }\n Buffer2.from && Buffer2.alloc && Buffer2.allocUnsafe && Buffer2.allocUnsafeSlow\n ? (module.exports = buffer)\n : (copyProps(buffer, exports), (exports.Buffer = SafeBuffer));\n function SafeBuffer(arg, encodingOrOffset, length) {\n return Buffer2(arg, encodingOrOffset, length);\n }\n SafeBuffer.prototype = Object.create(Buffer2.prototype);\n copyProps(Buffer2, SafeBuffer);\n SafeBuffer.from = function (arg, encodingOrOffset, length) {\n if (typeof arg == \"number\") throw new TypeError(\"Argument must not be a number\");\n return Buffer2(arg, encodingOrOffset, length);\n };\n SafeBuffer.alloc = function (size, fill, encoding) {\n if (typeof size != \"number\") throw new TypeError(\"Argument must be a number\");\n var buf = Buffer2(size);\n return (\n fill !== void 0 ? (typeof encoding == \"string\" ? buf.fill(fill, encoding) : buf.fill(fill)) : buf.fill(0), buf\n );\n };\n SafeBuffer.allocUnsafe = function (size) {\n if (typeof size != \"number\") throw new TypeError(\"Argument must be a number\");\n return Buffer2(size);\n };\n SafeBuffer.allocUnsafeSlow = function (size) {\n if (typeof size != \"number\") throw new TypeError(\"Argument must be a number\");\n return buffer.SlowBuffer(size);\n };\n },\n});\n\n// node_modules/randombytes/browser.js\nvar require_browser = __commonJS({\n \"node_modules/randombytes/browser.js\"(exports, module) {\n \"use strict\";\n var MAX_BYTES = 65536,\n MAX_UINT32 = 4294967295;\n function oldBrowser() {\n throw new Error(`Secure random number generation is not supported by this browser.\nUse Chrome, Firefox or Internet Explorer 11`);\n }\n var Buffer2 = require_safe_buffer().Buffer,\n crypto2 = globalCrypto;\n crypto2 && crypto2.getRandomValues ? (module.exports = randomBytes) : (module.exports = oldBrowser);\n function randomBytes(size, cb) {\n if (size > MAX_UINT32) throw new RangeError(\"requested too many random bytes\");\n var bytes = Buffer2.allocUnsafe(size);\n if (size > 0)\n if (size > MAX_BYTES)\n for (var generated = 0; generated < size; generated += MAX_BYTES)\n crypto2.getRandomValues(bytes.slice(generated, generated + MAX_BYTES));\n else crypto2.getRandomValues(bytes);\n return typeof cb == \"function\"\n ? process.nextTick(function () {\n cb(null, bytes);\n })\n : bytes;\n }\n },\n});\n\n// node_modules/inherits/inherits_browser.js\nvar require_inherits_browser = __commonJS({\n \"node_modules/inherits/inherits_browser.js\"(exports, module) {\n typeof Object.create == \"function\"\n ? (module.exports = function (ctor, superCtor) {\n superCtor &&\n ((ctor.super_ = superCtor),\n (ctor.prototype = Object.create(superCtor.prototype, {\n constructor: {\n value: ctor,\n enumerable: !1,\n writable: !0,\n configurable: !0,\n },\n })));\n })\n : (module.exports = function (ctor, superCtor) {\n if (superCtor) {\n ctor.super_ = superCtor;\n var TempCtor = function () {};\n (TempCtor.prototype = superCtor.prototype),\n (ctor.prototype = new TempCtor()),\n (ctor.prototype.constructor = ctor);\n }\n });\n },\n});\n\n// node_modules/hash-base/index.js\nvar require_hash_base = __commonJS({\n \"node_modules/hash-base/index.js\"(exports, module) {\n \"use strict\";\n var Buffer2 = require_safe_buffer().Buffer,\n Transform = __require(\"readable-stream\").Transform,\n inherits = require_inherits_browser();\n function throwIfNotStringOrBuffer(val, prefix) {\n if (!Buffer2.isBuffer(val) && typeof val != \"string\")\n throw new TypeError(prefix + \" must be a string or a buffer\");\n }\n function HashBase(blockSize) {\n Transform.call(this),\n (this._block = Buffer2.allocUnsafe(blockSize)),\n (this._blockSize = blockSize),\n (this._blockOffset = 0),\n (this._length = [0, 0, 0, 0]),\n (this._finalized = !1);\n }\n inherits(HashBase, Transform);\n HashBase.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 callback(error);\n };\n HashBase.prototype._flush = function (callback) {\n var error = null;\n try {\n this.push(this.digest());\n } catch (err) {\n error = err;\n }\n callback(error);\n };\n HashBase.prototype.update = function (data, encoding) {\n if ((throwIfNotStringOrBuffer(data, \"Data\"), this._finalized)) throw new Error(\"Digest already called\");\n Buffer2.isBuffer(data) || (data = Buffer2.from(data, encoding));\n for (var block = this._block, offset = 0; this._blockOffset + data.length - offset >= this._blockSize; ) {\n for (var i = this._blockOffset; i < this._blockSize; ) block[i++] = data[offset++];\n this._update(), (this._blockOffset = 0);\n }\n for (; offset < data.length; ) block[this._blockOffset++] = data[offset++];\n for (var j = 0, carry = data.length * 8; carry > 0; ++j)\n (this._length[j] += carry),\n (carry = (this._length[j] / 4294967296) | 0),\n carry > 0 && (this._length[j] -= 4294967296 * carry);\n return this;\n };\n HashBase.prototype._update = function () {\n throw new Error(\"_update is not implemented\");\n };\n HashBase.prototype.digest = function (encoding) {\n if (this._finalized) throw new Error(\"Digest already called\");\n this._finalized = !0;\n var digest = this._digest();\n encoding !== void 0 && (digest = digest.toString(encoding)), this._block.fill(0), (this._blockOffset = 0);\n for (var i = 0; i < 4; ++i) this._length[i] = 0;\n return digest;\n };\n HashBase.prototype._digest = function () {\n throw new Error(\"_digest is not implemented\");\n };\n module.exports = HashBase;\n },\n});\n\n// node_modules/md5.js/index.js\nvar require_md5 = __commonJS({\n \"node_modules/md5.js/index.js\"(exports, module) {\n \"use strict\";\n var inherits = require_inherits_browser(),\n HashBase = require_hash_base(),\n Buffer2 = require_safe_buffer().Buffer,\n ARRAY16 = new Array(16);\n function MD5() {\n HashBase.call(this, 64),\n (this._a = 1732584193),\n (this._b = 4023233417),\n (this._c = 2562383102),\n (this._d = 271733878);\n }\n inherits(MD5, HashBase);\n MD5.prototype._update = function () {\n for (var M = ARRAY16, i = 0; i < 16; ++i) M[i] = this._block.readInt32LE(i * 4);\n var a = this._a,\n b = this._b,\n c = this._c,\n d = this._d;\n (a = fnF(a, b, c, d, M[0], 3614090360, 7)),\n (d = fnF(d, a, b, c, M[1], 3905402710, 12)),\n (c = fnF(c, d, a, b, M[2], 606105819, 17)),\n (b = fnF(b, c, d, a, M[3], 3250441966, 22)),\n (a = fnF(a, b, c, d, M[4], 4118548399, 7)),\n (d = fnF(d, a, b, c, M[5], 1200080426, 12)),\n (c = fnF(c, d, a, b, M[6], 2821735955, 17)),\n (b = fnF(b, c, d, a, M[7], 4249261313, 22)),\n (a = fnF(a, b, c, d, M[8], 1770035416, 7)),\n (d = fnF(d, a, b, c, M[9], 2336552879, 12)),\n (c = fnF(c, d, a, b, M[10], 4294925233, 17)),\n (b = fnF(b, c, d, a, M[11], 2304563134, 22)),\n (a = fnF(a, b, c, d, M[12], 1804603682, 7)),\n (d = fnF(d, a, b, c, M[13], 4254626195, 12)),\n (c = fnF(c, d, a, b, M[14], 2792965006, 17)),\n (b = fnF(b, c, d, a, M[15], 1236535329, 22)),\n (a = fnG(a, b, c, d, M[1], 4129170786, 5)),\n (d = fnG(d, a, b, c, M[6], 3225465664, 9)),\n (c = fnG(c, d, a, b, M[11], 643717713, 14)),\n (b = fnG(b, c, d, a, M[0], 3921069994, 20)),\n (a = fnG(a, b, c, d, M[5], 3593408605, 5)),\n (d = fnG(d, a, b, c, M[10], 38016083, 9)),\n (c = fnG(c, d, a, b, M[15], 3634488961, 14)),\n (b = fnG(b, c, d, a, M[4], 3889429448, 20)),\n (a = fnG(a, b, c, d, M[9], 568446438, 5)),\n (d = fnG(d, a, b, c, M[14], 3275163606, 9)),\n (c = fnG(c, d, a, b, M[3], 4107603335, 14)),\n (b = fnG(b, c, d, a, M[8], 1163531501, 20)),\n (a = fnG(a, b, c, d, M[13], 2850285829, 5)),\n (d = fnG(d, a, b, c, M[2], 4243563512, 9)),\n (c = fnG(c, d, a, b, M[7], 1735328473, 14)),\n (b = fnG(b, c, d, a, M[12], 2368359562, 20)),\n (a = fnH(a, b, c, d, M[5], 4294588738, 4)),\n (d = fnH(d, a, b, c, M[8], 2272392833, 11)),\n (c = fnH(c, d, a, b, M[11], 1839030562, 16)),\n (b = fnH(b, c, d, a, M[14], 4259657740, 23)),\n (a = fnH(a, b, c, d, M[1], 2763975236, 4)),\n (d = fnH(d, a, b, c, M[4], 1272893353, 11)),\n (c = fnH(c, d, a, b, M[7], 4139469664, 16)),\n (b = fnH(b, c, d, a, M[10], 3200236656, 23)),\n (a = fnH(a, b, c, d, M[13], 681279174, 4)),\n (d = fnH(d, a, b, c, M[0], 3936430074, 11)),\n (c = fnH(c, d, a, b, M[3], 3572445317, 16)),\n (b = fnH(b, c, d, a, M[6], 76029189, 23)),\n (a = fnH(a, b, c, d, M[9], 3654602809, 4)),\n (d = fnH(d, a, b, c, M[12], 3873151461, 11)),\n (c = fnH(c, d, a, b, M[15], 530742520, 16)),\n (b = fnH(b, c, d, a, M[2], 3299628645, 23)),\n (a = fnI(a, b, c, d, M[0], 4096336452, 6)),\n (d = fnI(d, a, b, c, M[7], 1126891415, 10)),\n (c = fnI(c, d, a, b, M[14], 2878612391, 15)),\n (b = fnI(b, c, d, a, M[5], 4237533241, 21)),\n (a = fnI(a, b, c, d, M[12], 1700485571, 6)),\n (d = fnI(d, a, b, c, M[3], 2399980690, 10)),\n (c = fnI(c, d, a, b, M[10], 4293915773, 15)),\n (b = fnI(b, c, d, a, M[1], 2240044497, 21)),\n (a = fnI(a, b, c, d, M[8], 1873313359, 6)),\n (d = fnI(d, a, b, c, M[15], 4264355552, 10)),\n (c = fnI(c, d, a, b, M[6], 2734768916, 15)),\n (b = fnI(b, c, d, a, M[13], 1309151649, 21)),\n (a = fnI(a, b, c, d, M[4], 4149444226, 6)),\n (d = fnI(d, a, b, c, M[11], 3174756917, 10)),\n (c = fnI(c, d, a, b, M[2], 718787259, 15)),\n (b = fnI(b, c, d, a, M[9], 3951481745, 21)),\n (this._a = (this._a + a) | 0),\n (this._b = (this._b + b) | 0),\n (this._c = (this._c + c) | 0),\n (this._d = (this._d + d) | 0);\n };\n MD5.prototype._digest = function () {\n (this._block[this._blockOffset++] = 128),\n this._blockOffset > 56 && (this._block.fill(0, this._blockOffset, 64), this._update(), (this._blockOffset = 0)),\n this._block.fill(0, this._blockOffset, 56),\n this._block.writeUInt32LE(this._length[0], 56),\n this._block.writeUInt32LE(this._length[1], 60),\n this._update();\n var buffer = Buffer2.allocUnsafe(16);\n return (\n buffer.writeInt32LE(this._a, 0),\n buffer.writeInt32LE(this._b, 4),\n buffer.writeInt32LE(this._c, 8),\n buffer.writeInt32LE(this._d, 12),\n buffer\n );\n };\n function rotl(x, n) {\n return (x << n) | (x >>> (32 - n));\n }\n function fnF(a, b, c, d, m, k, s) {\n return (rotl((a + ((b & c) | (~b & d)) + m + k) | 0, s) + b) | 0;\n }\n function fnG(a, b, c, d, m, k, s) {\n return (rotl((a + ((b & d) | (c & ~d)) + m + k) | 0, s) + b) | 0;\n }\n function fnH(a, b, c, d, m, k, s) {\n return (rotl((a + (b ^ c ^ d) + m + k) | 0, s) + b) | 0;\n }\n function fnI(a, b, c, d, m, k, s) {\n return (rotl((a + (c ^ (b | ~d)) + m + k) | 0, s) + b) | 0;\n }\n module.exports = MD5;\n },\n});\n\n// node_modules/ripemd160/index.js\nvar require_ripemd160 = __commonJS({\n \"node_modules/ripemd160/index.js\"(exports, module) {\n \"use strict\";\n var Buffer2 = __require(\"buffer\").Buffer,\n inherits = require_inherits_browser(),\n HashBase = require_hash_base(),\n ARRAY16 = new Array(16),\n zl = [\n 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 7, 4, 13, 1, 10, 6, 15, 3, 12, 0, 9, 5, 2, 14, 11, 8, 3,\n 10, 14, 4, 9, 15, 8, 1, 2, 7, 0, 6, 13, 11, 5, 12, 1, 9, 11, 10, 0, 8, 12, 4, 13, 3, 7, 15, 14, 5, 6, 2, 4, 0,\n 5, 9, 7, 12, 2, 10, 14, 1, 3, 8, 11, 6, 15, 13,\n ],\n zr = [\n 5, 14, 7, 0, 9, 2, 11, 4, 13, 6, 15, 8, 1, 10, 3, 12, 6, 11, 3, 7, 0, 13, 5, 10, 14, 15, 8, 12, 4, 9, 1, 2, 15,\n 5, 1, 3, 7, 14, 6, 9, 11, 8, 12, 2, 10, 0, 4, 13, 8, 6, 4, 1, 3, 11, 15, 0, 5, 12, 2, 13, 9, 7, 10, 14, 12, 15,\n 10, 4, 1, 5, 8, 7, 6, 2, 13, 14, 0, 3, 9, 11,\n ],\n sl = [\n 11, 14, 15, 12, 5, 8, 7, 9, 11, 13, 14, 15, 6, 7, 9, 8, 7, 6, 8, 13, 11, 9, 7, 15, 7, 12, 15, 9, 11, 7, 13, 12,\n 11, 13, 6, 7, 14, 9, 13, 15, 14, 8, 13, 6, 5, 12, 7, 5, 11, 12, 14, 15, 14, 15, 9, 8, 9, 14, 5, 6, 8, 6, 5, 12,\n 9, 15, 5, 11, 6, 8, 13, 12, 5, 12, 13, 14, 11, 8, 5, 6,\n ],\n sr = [\n 8, 9, 9, 11, 13, 15, 15, 5, 7, 7, 8, 11, 14, 14, 12, 6, 9, 13, 15, 7, 12, 8, 9, 11, 7, 7, 12, 7, 6, 15, 13, 11,\n 9, 7, 15, 11, 8, 6, 6, 14, 12, 13, 5, 14, 13, 13, 7, 5, 15, 5, 8, 11, 14, 14, 6, 14, 6, 9, 12, 9, 12, 5, 15, 8,\n 8, 5, 12, 9, 12, 5, 14, 6, 8, 13, 6, 5, 15, 13, 11, 11,\n ],\n hl = [0, 1518500249, 1859775393, 2400959708, 2840853838],\n hr = [1352829926, 1548603684, 1836072691, 2053994217, 0];\n function RIPEMD160() {\n HashBase.call(this, 64),\n (this._a = 1732584193),\n (this._b = 4023233417),\n (this._c = 2562383102),\n (this._d = 271733878),\n (this._e = 3285377520);\n }\n inherits(RIPEMD160, HashBase);\n RIPEMD160.prototype._update = function () {\n for (var words = ARRAY16, j = 0; j < 16; ++j) words[j] = this._block.readInt32LE(j * 4);\n for (\n var al = this._a | 0,\n bl = this._b | 0,\n cl = this._c | 0,\n dl = this._d | 0,\n el = this._e | 0,\n ar = this._a | 0,\n br = this._b | 0,\n cr = this._c | 0,\n dr = this._d | 0,\n er = this._e | 0,\n i = 0;\n i < 80;\n i += 1\n ) {\n var tl, tr;\n i < 16\n ? ((tl = fn1(al, bl, cl, dl, el, words[zl[i]], hl[0], sl[i])),\n (tr = fn5(ar, br, cr, dr, er, words[zr[i]], hr[0], sr[i])))\n : i < 32\n ? ((tl = fn2(al, bl, cl, dl, el, words[zl[i]], hl[1], sl[i])),\n (tr = fn4(ar, br, cr, dr, er, words[zr[i]], hr[1], sr[i])))\n : i < 48\n ? ((tl = fn3(al, bl, cl, dl, el, words[zl[i]], hl[2], sl[i])),\n (tr = fn3(ar, br, cr, dr, er, words[zr[i]], hr[2], sr[i])))\n : i < 64\n ? ((tl = fn4(al, bl, cl, dl, el, words[zl[i]], hl[3], sl[i])),\n (tr = fn2(ar, br, cr, dr, er, words[zr[i]], hr[3], sr[i])))\n : ((tl = fn5(al, bl, cl, dl, el, words[zl[i]], hl[4], sl[i])),\n (tr = fn1(ar, br, cr, dr, er, words[zr[i]], hr[4], sr[i]))),\n (al = el),\n (el = dl),\n (dl = rotl(cl, 10)),\n (cl = bl),\n (bl = tl),\n (ar = er),\n (er = dr),\n (dr = rotl(cr, 10)),\n (cr = br),\n (br = tr);\n }\n var t = (this._b + cl + dr) | 0;\n (this._b = (this._c + dl + er) | 0),\n (this._c = (this._d + el + ar) | 0),\n (this._d = (this._e + al + br) | 0),\n (this._e = (this._a + bl + cr) | 0),\n (this._a = t);\n };\n RIPEMD160.prototype._digest = function () {\n (this._block[this._blockOffset++] = 128),\n this._blockOffset > 56 && (this._block.fill(0, this._blockOffset, 64), this._update(), (this._blockOffset = 0)),\n this._block.fill(0, this._blockOffset, 56),\n this._block.writeUInt32LE(this._length[0], 56),\n this._block.writeUInt32LE(this._length[1], 60),\n this._update();\n var buffer = Buffer2.alloc ? Buffer2.alloc(20) : new Buffer2(20);\n return (\n buffer.writeInt32LE(this._a, 0),\n buffer.writeInt32LE(this._b, 4),\n buffer.writeInt32LE(this._c, 8),\n buffer.writeInt32LE(this._d, 12),\n buffer.writeInt32LE(this._e, 16),\n buffer\n );\n };\n function rotl(x, n) {\n return (x << n) | (x >>> (32 - n));\n }\n function fn1(a, b, c, d, e, m, k, s) {\n return (rotl((a + (b ^ c ^ d) + m + k) | 0, s) + e) | 0;\n }\n function fn2(a, b, c, d, e, m, k, s) {\n return (rotl((a + ((b & c) | (~b & d)) + m + k) | 0, s) + e) | 0;\n }\n function fn3(a, b, c, d, e, m, k, s) {\n return (rotl((a + ((b | ~c) ^ d) + m + k) | 0, s) + e) | 0;\n }\n function fn4(a, b, c, d, e, m, k, s) {\n return (rotl((a + ((b & d) | (c & ~d)) + m + k) | 0, s) + e) | 0;\n }\n function fn5(a, b, c, d, e, m, k, s) {\n return (rotl((a + (b ^ (c | ~d)) + m + k) | 0, s) + e) | 0;\n }\n module.exports = RIPEMD160;\n },\n});\n\n// node_modules/sha.js/hash.js\nvar require_hash = __commonJS({\n \"node_modules/sha.js/hash.js\"(exports, module) {\n var Buffer2 = require_safe_buffer().Buffer;\n function Hash(blockSize, finalSize) {\n (this._block = Buffer2.alloc(blockSize)),\n (this._finalSize = finalSize),\n (this._blockSize = blockSize),\n (this._len = 0);\n }\n Hash.prototype.update = function (data, enc) {\n typeof data == \"string\" && ((enc = enc || \"utf8\"), (data = Buffer2.from(data, enc)));\n for (\n var block = this._block, blockSize = this._blockSize, length = data.length, accum = this._len, offset = 0;\n offset < length;\n\n ) {\n for (\n var assigned = accum % blockSize, remainder = Math.min(length - offset, blockSize - assigned), i = 0;\n i < remainder;\n i++\n )\n block[assigned + i] = data[offset + i];\n (accum += remainder), (offset += remainder), accum % blockSize === 0 && this._update(block);\n }\n return (this._len += length), this;\n };\n Hash.prototype.digest = function (enc) {\n var rem = this._len % this._blockSize;\n (this._block[rem] = 128),\n this._block.fill(0, rem + 1),\n rem >= this._finalSize && (this._update(this._block), this._block.fill(0));\n var bits = this._len * 8;\n if (bits <= 4294967295) this._block.writeUInt32BE(bits, this._blockSize - 4);\n else {\n var lowBits = (bits & 4294967295) >>> 0,\n highBits = (bits - lowBits) / 4294967296;\n this._block.writeUInt32BE(highBits, this._blockSize - 8),\n this._block.writeUInt32BE(lowBits, this._blockSize - 4);\n }\n this._update(this._block);\n var hash = this._hash();\n return enc ? hash.toString(enc) : hash;\n };\n Hash.prototype._update = function () {\n throw new Error(\"_update must be implemented by subclass\");\n };\n module.exports = Hash;\n },\n});\n\n// node_modules/sha.js/sha.js\nvar require_sha = __commonJS({\n \"node_modules/sha.js/sha.js\"(exports, module) {\n var inherits = require_inherits_browser(),\n Hash = require_hash(),\n Buffer2 = require_safe_buffer().Buffer,\n K = [1518500249, 1859775393, -1894007588, -899497514],\n W = new Array(80);\n function Sha() {\n this.init(), (this._w = W), Hash.call(this, 64, 56);\n }\n inherits(Sha, Hash);\n Sha.prototype.init = function () {\n return (\n (this._a = 1732584193),\n (this._b = 4023233417),\n (this._c = 2562383102),\n (this._d = 271733878),\n (this._e = 3285377520),\n this\n );\n };\n function rotl5(num) {\n return (num << 5) | (num >>> 27);\n }\n function rotl30(num) {\n return (num << 30) | (num >>> 2);\n }\n function ft(s, b, c, d) {\n return s === 0 ? (b & c) | (~b & d) : s === 2 ? (b & c) | (b & d) | (c & d) : b ^ c ^ d;\n }\n Sha.prototype._update = function (M) {\n for (\n var W2 = this._w, a = this._a | 0, b = this._b | 0, c = this._c | 0, d = this._d | 0, e = this._e | 0, i = 0;\n i < 16;\n ++i\n )\n W2[i] = M.readInt32BE(i * 4);\n for (; i < 80; ++i) W2[i] = W2[i - 3] ^ W2[i - 8] ^ W2[i - 14] ^ W2[i - 16];\n for (var j = 0; j < 80; ++j) {\n var s = ~~(j / 20),\n t = (rotl5(a) + ft(s, b, c, d) + e + W2[j] + K[s]) | 0;\n (e = d), (d = c), (c = rotl30(b)), (b = a), (a = t);\n }\n (this._a = (a + this._a) | 0),\n (this._b = (b + this._b) | 0),\n (this._c = (c + this._c) | 0),\n (this._d = (d + this._d) | 0),\n (this._e = (e + this._e) | 0);\n };\n Sha.prototype._hash = function () {\n var H = Buffer2.allocUnsafe(20);\n return (\n H.writeInt32BE(this._a | 0, 0),\n H.writeInt32BE(this._b | 0, 4),\n H.writeInt32BE(this._c | 0, 8),\n H.writeInt32BE(this._d | 0, 12),\n H.writeInt32BE(this._e | 0, 16),\n H\n );\n };\n module.exports = Sha;\n },\n});\n\n// node_modules/sha.js/sha1.js\nvar require_sha1 = __commonJS({\n \"node_modules/sha.js/sha1.js\"(exports, module) {\n var inherits = require_inherits_browser(),\n Hash = require_hash(),\n Buffer2 = require_safe_buffer().Buffer,\n K = [1518500249, 1859775393, -1894007588, -899497514],\n W = new Array(80);\n function Sha1() {\n this.init(), (this._w = W), Hash.call(this, 64, 56);\n }\n inherits(Sha1, Hash);\n Sha1.prototype.init = function () {\n return (\n (this._a = 1732584193),\n (this._b = 4023233417),\n (this._c = 2562383102),\n (this._d = 271733878),\n (this._e = 3285377520),\n this\n );\n };\n function rotl1(num) {\n return (num << 1) | (num >>> 31);\n }\n function rotl5(num) {\n return (num << 5) | (num >>> 27);\n }\n function rotl30(num) {\n return (num << 30) | (num >>> 2);\n }\n function ft(s, b, c, d) {\n return s === 0 ? (b & c) | (~b & d) : s === 2 ? (b & c) | (b & d) | (c & d) : b ^ c ^ d;\n }\n Sha1.prototype._update = function (M) {\n for (\n var W2 = this._w, a = this._a | 0, b = this._b | 0, c = this._c | 0, d = this._d | 0, e = this._e | 0, i = 0;\n i < 16;\n ++i\n )\n W2[i] = M.readInt32BE(i * 4);\n for (; i < 80; ++i) W2[i] = rotl1(W2[i - 3] ^ W2[i - 8] ^ W2[i - 14] ^ W2[i - 16]);\n for (var j = 0; j < 80; ++j) {\n var s = ~~(j / 20),\n t = (rotl5(a) + ft(s, b, c, d) + e + W2[j] + K[s]) | 0;\n (e = d), (d = c), (c = rotl30(b)), (b = a), (a = t);\n }\n (this._a = (a + this._a) | 0),\n (this._b = (b + this._b) | 0),\n (this._c = (c + this._c) | 0),\n (this._d = (d + this._d) | 0),\n (this._e = (e + this._e) | 0);\n };\n Sha1.prototype._hash = function () {\n var H = Buffer2.allocUnsafe(20);\n return (\n H.writeInt32BE(this._a | 0, 0),\n H.writeInt32BE(this._b | 0, 4),\n H.writeInt32BE(this._c | 0, 8),\n H.writeInt32BE(this._d | 0, 12),\n H.writeInt32BE(this._e | 0, 16),\n H\n );\n };\n module.exports = Sha1;\n },\n});\n\n// node_modules/sha.js/sha256.js\nvar require_sha256 = __commonJS({\n \"node_modules/sha.js/sha256.js\"(exports, module) {\n var inherits = require_inherits_browser(),\n Hash = require_hash(),\n Buffer2 = require_safe_buffer().Buffer,\n K = [\n 1116352408, 1899447441, 3049323471, 3921009573, 961987163, 1508970993, 2453635748, 2870763221, 3624381080,\n 310598401, 607225278, 1426881987, 1925078388, 2162078206, 2614888103, 3248222580, 3835390401, 4022224774,\n 264347078, 604807628, 770255983, 1249150122, 1555081692, 1996064986, 2554220882, 2821834349, 2952996808,\n 3210313671, 3336571891, 3584528711, 113926993, 338241895, 666307205, 773529912, 1294757372, 1396182291,\n 1695183700, 1986661051, 2177026350, 2456956037, 2730485921, 2820302411, 3259730800, 3345764771, 3516065817,\n 3600352804, 4094571909, 275423344, 430227734, 506948616, 659060556, 883997877, 958139571, 1322822218,\n 1537002063, 1747873779, 1955562222, 2024104815, 2227730452, 2361852424, 2428436474, 2756734187, 3204031479,\n 3329325298,\n ],\n W = new Array(64);\n function Sha256() {\n this.init(), (this._w = W), Hash.call(this, 64, 56);\n }\n inherits(Sha256, Hash);\n Sha256.prototype.init = function () {\n return (\n (this._a = 1779033703),\n (this._b = 3144134277),\n (this._c = 1013904242),\n (this._d = 2773480762),\n (this._e = 1359893119),\n (this._f = 2600822924),\n (this._g = 528734635),\n (this._h = 1541459225),\n this\n );\n };\n function ch(x, y, z) {\n return z ^ (x & (y ^ z));\n }\n function maj(x, y, z) {\n return (x & y) | (z & (x | y));\n }\n function sigma0(x) {\n return ((x >>> 2) | (x << 30)) ^ ((x >>> 13) | (x << 19)) ^ ((x >>> 22) | (x << 10));\n }\n function sigma1(x) {\n return ((x >>> 6) | (x << 26)) ^ ((x >>> 11) | (x << 21)) ^ ((x >>> 25) | (x << 7));\n }\n function gamma0(x) {\n return ((x >>> 7) | (x << 25)) ^ ((x >>> 18) | (x << 14)) ^ (x >>> 3);\n }\n function gamma1(x) {\n return ((x >>> 17) | (x << 15)) ^ ((x >>> 19) | (x << 13)) ^ (x >>> 10);\n }\n Sha256.prototype._update = function (M) {\n for (\n var W2 = this._w,\n a = this._a | 0,\n b = this._b | 0,\n c = this._c | 0,\n d = this._d | 0,\n e = this._e | 0,\n f = this._f | 0,\n g = this._g | 0,\n h = this._h | 0,\n i = 0;\n i < 16;\n ++i\n )\n W2[i] = M.readInt32BE(i * 4);\n for (; i < 64; ++i) W2[i] = (gamma1(W2[i - 2]) + W2[i - 7] + gamma0(W2[i - 15]) + W2[i - 16]) | 0;\n for (var j = 0; j < 64; ++j) {\n var T1 = (h + sigma1(e) + ch(e, f, g) + K[j] + W2[j]) | 0,\n T2 = (sigma0(a) + maj(a, b, c)) | 0;\n (h = g), (g = f), (f = e), (e = (d + T1) | 0), (d = c), (c = b), (b = a), (a = (T1 + T2) | 0);\n }\n (this._a = (a + this._a) | 0),\n (this._b = (b + this._b) | 0),\n (this._c = (c + this._c) | 0),\n (this._d = (d + this._d) | 0),\n (this._e = (e + this._e) | 0),\n (this._f = (f + this._f) | 0),\n (this._g = (g + this._g) | 0),\n (this._h = (h + this._h) | 0);\n };\n Sha256.prototype._hash = function () {\n var H = Buffer2.allocUnsafe(32);\n return (\n H.writeInt32BE(this._a, 0),\n H.writeInt32BE(this._b, 4),\n H.writeInt32BE(this._c, 8),\n H.writeInt32BE(this._d, 12),\n H.writeInt32BE(this._e, 16),\n H.writeInt32BE(this._f, 20),\n H.writeInt32BE(this._g, 24),\n H.writeInt32BE(this._h, 28),\n H\n );\n };\n module.exports = Sha256;\n },\n});\n\n// node_modules/sha.js/sha224.js\nvar require_sha224 = __commonJS({\n \"node_modules/sha.js/sha224.js\"(exports, module) {\n var inherits = require_inherits_browser(),\n Sha256 = require_sha256(),\n Hash = require_hash(),\n Buffer2 = require_safe_buffer().Buffer,\n W = new Array(64);\n function Sha224() {\n this.init(), (this._w = W), Hash.call(this, 64, 56);\n }\n inherits(Sha224, Sha256);\n Sha224.prototype.init = function () {\n return (\n (this._a = 3238371032),\n (this._b = 914150663),\n (this._c = 812702999),\n (this._d = 4144912697),\n (this._e = 4290775857),\n (this._f = 1750603025),\n (this._g = 1694076839),\n (this._h = 3204075428),\n this\n );\n };\n Sha224.prototype._hash = function () {\n var H = Buffer2.allocUnsafe(28);\n return (\n H.writeInt32BE(this._a, 0),\n H.writeInt32BE(this._b, 4),\n H.writeInt32BE(this._c, 8),\n H.writeInt32BE(this._d, 12),\n H.writeInt32BE(this._e, 16),\n H.writeInt32BE(this._f, 20),\n H.writeInt32BE(this._g, 24),\n H\n );\n };\n module.exports = Sha224;\n },\n});\n\n// node_modules/sha.js/sha512.js\nvar require_sha512 = __commonJS({\n \"node_modules/sha.js/sha512.js\"(exports, module) {\n var inherits = require_inherits_browser(),\n Hash = require_hash(),\n Buffer2 = require_safe_buffer().Buffer,\n K = [\n 1116352408, 3609767458, 1899447441, 602891725, 3049323471, 3964484399, 3921009573, 2173295548, 961987163,\n 4081628472, 1508970993, 3053834265, 2453635748, 2937671579, 2870763221, 3664609560, 3624381080, 2734883394,\n 310598401, 1164996542, 607225278, 1323610764, 1426881987, 3590304994, 1925078388, 4068182383, 2162078206,\n 991336113, 2614888103, 633803317, 3248222580, 3479774868, 3835390401, 2666613458, 4022224774, 944711139,\n 264347078, 2341262773, 604807628, 2007800933, 770255983, 1495990901, 1249150122, 1856431235, 1555081692,\n 3175218132, 1996064986, 2198950837, 2554220882, 3999719339, 2821834349, 766784016, 2952996808, 2566594879,\n 3210313671, 3203337956, 3336571891, 1034457026, 3584528711, 2466948901, 113926993, 3758326383, 338241895,\n 168717936, 666307205, 1188179964, 773529912, 1546045734, 1294757372, 1522805485, 1396182291, 2643833823,\n 1695183700, 2343527390, 1986661051, 1014477480, 2177026350, 1206759142, 2456956037, 344077627, 2730485921,\n 1290863460, 2820302411, 3158454273, 3259730800, 3505952657, 3345764771, 106217008, 3516065817, 3606008344,\n 3600352804, 1432725776, 4094571909, 1467031594, 275423344, 851169720, 430227734, 3100823752, 506948616,\n 1363258195, 659060556, 3750685593, 883997877, 3785050280, 958139571, 3318307427, 1322822218, 3812723403,\n 1537002063, 2003034995, 1747873779, 3602036899, 1955562222, 1575990012, 2024104815, 1125592928, 2227730452,\n 2716904306, 2361852424, 442776044, 2428436474, 593698344, 2756734187, 3733110249, 3204031479, 2999351573,\n 3329325298, 3815920427, 3391569614, 3928383900, 3515267271, 566280711, 3940187606, 3454069534, 4118630271,\n 4000239992, 116418474, 1914138554, 174292421, 2731055270, 289380356, 3203993006, 460393269, 320620315,\n 685471733, 587496836, 852142971, 1086792851, 1017036298, 365543100, 1126000580, 2618297676, 1288033470,\n 3409855158, 1501505948, 4234509866, 1607167915, 987167468, 1816402316, 1246189591,\n ],\n W = new Array(160);\n function Sha512() {\n this.init(), (this._w = W), Hash.call(this, 128, 112);\n }\n inherits(Sha512, Hash);\n Sha512.prototype.init = function () {\n return (\n (this._ah = 1779033703),\n (this._bh = 3144134277),\n (this._ch = 1013904242),\n (this._dh = 2773480762),\n (this._eh = 1359893119),\n (this._fh = 2600822924),\n (this._gh = 528734635),\n (this._hh = 1541459225),\n (this._al = 4089235720),\n (this._bl = 2227873595),\n (this._cl = 4271175723),\n (this._dl = 1595750129),\n (this._el = 2917565137),\n (this._fl = 725511199),\n (this._gl = 4215389547),\n (this._hl = 327033209),\n this\n );\n };\n function Ch(x, y, z) {\n return z ^ (x & (y ^ z));\n }\n function maj(x, y, z) {\n return (x & y) | (z & (x | y));\n }\n function sigma0(x, xl) {\n return ((x >>> 28) | (xl << 4)) ^ ((xl >>> 2) | (x << 30)) ^ ((xl >>> 7) | (x << 25));\n }\n function sigma1(x, xl) {\n return ((x >>> 14) | (xl << 18)) ^ ((x >>> 18) | (xl << 14)) ^ ((xl >>> 9) | (x << 23));\n }\n function Gamma0(x, xl) {\n return ((x >>> 1) | (xl << 31)) ^ ((x >>> 8) | (xl << 24)) ^ (x >>> 7);\n }\n function Gamma0l(x, xl) {\n return ((x >>> 1) | (xl << 31)) ^ ((x >>> 8) | (xl << 24)) ^ ((x >>> 7) | (xl << 25));\n }\n function Gamma1(x, xl) {\n return ((x >>> 19) | (xl << 13)) ^ ((xl >>> 29) | (x << 3)) ^ (x >>> 6);\n }\n function Gamma1l(x, xl) {\n return ((x >>> 19) | (xl << 13)) ^ ((xl >>> 29) | (x << 3)) ^ ((x >>> 6) | (xl << 26));\n }\n function getCarry(a, b) {\n return a >>> 0 < b >>> 0 ? 1 : 0;\n }\n Sha512.prototype._update = function (M) {\n for (\n var W2 = this._w,\n ah = this._ah | 0,\n bh = this._bh | 0,\n ch = this._ch | 0,\n dh = this._dh | 0,\n eh = this._eh | 0,\n fh = this._fh | 0,\n gh = this._gh | 0,\n hh = this._hh | 0,\n al = this._al | 0,\n bl = this._bl | 0,\n cl = this._cl | 0,\n dl = this._dl | 0,\n el = this._el | 0,\n fl = this._fl | 0,\n gl = this._gl | 0,\n hl = this._hl | 0,\n i = 0;\n i < 32;\n i += 2\n )\n (W2[i] = M.readInt32BE(i * 4)), (W2[i + 1] = M.readInt32BE(i * 4 + 4));\n for (; i < 160; i += 2) {\n var xh = W2[i - 30],\n xl = W2[i - 15 * 2 + 1],\n gamma0 = Gamma0(xh, xl),\n gamma0l = Gamma0l(xl, xh);\n (xh = W2[i - 2 * 2]), (xl = W2[i - 2 * 2 + 1]);\n var gamma1 = Gamma1(xh, xl),\n gamma1l = Gamma1l(xl, xh),\n Wi7h = W2[i - 7 * 2],\n Wi7l = W2[i - 7 * 2 + 1],\n Wi16h = W2[i - 16 * 2],\n Wi16l = W2[i - 16 * 2 + 1],\n Wil = (gamma0l + Wi7l) | 0,\n 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 (W2[i] = Wih),\n (W2[i + 1] = Wil);\n }\n for (var j = 0; j < 160; j += 2) {\n (Wih = W2[j]), (Wil = W2[j + 1]);\n var majh = maj(ah, bh, ch),\n majl = maj(al, bl, cl),\n sigma0h = sigma0(ah, al),\n sigma0l = sigma0(al, ah),\n sigma1h = sigma1(eh, el),\n sigma1l = sigma1(el, eh),\n Kih = K[j],\n Kil = K[j + 1],\n chh = Ch(eh, fh, gh),\n chl = Ch(el, fl, gl),\n t1l = (hl + sigma1l) | 0,\n 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 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 (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 Sha512.prototype._hash = function () {\n var H = Buffer2.allocUnsafe(64);\n function writeInt64BE(h, l, offset) {\n H.writeInt32BE(h, offset), H.writeInt32BE(l, offset + 4);\n }\n return (\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 H\n );\n };\n module.exports = Sha512;\n },\n});\n\n// node_modules/sha.js/sha384.js\nvar require_sha384 = __commonJS({\n \"node_modules/sha.js/sha384.js\"(exports, module) {\n var inherits = require_inherits_browser(),\n SHA512 = require_sha512(),\n Hash = require_hash(),\n Buffer2 = require_safe_buffer().Buffer,\n W = new Array(160);\n function Sha384() {\n this.init(), (this._w = W), Hash.call(this, 128, 112);\n }\n inherits(Sha384, SHA512);\n Sha384.prototype.init = function () {\n return (\n (this._ah = 3418070365),\n (this._bh = 1654270250),\n (this._ch = 2438529370),\n (this._dh = 355462360),\n (this._eh = 1731405415),\n (this._fh = 2394180231),\n (this._gh = 3675008525),\n (this._hh = 1203062813),\n (this._al = 3238371032),\n (this._bl = 914150663),\n (this._cl = 812702999),\n (this._dl = 4144912697),\n (this._el = 4290775857),\n (this._fl = 1750603025),\n (this._gl = 1694076839),\n (this._hl = 3204075428),\n this\n );\n };\n Sha384.prototype._hash = function () {\n var H = Buffer2.allocUnsafe(48);\n function writeInt64BE(h, l, offset) {\n H.writeInt32BE(h, offset), H.writeInt32BE(l, offset + 4);\n }\n return (\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 H\n );\n };\n module.exports = Sha384;\n },\n});\n\n// node_modules/sha.js/index.js\nvar require_sha2 = __commonJS({\n \"node_modules/sha.js/index.js\"(exports, module) {\n var exports = (module.exports = function (algorithm) {\n algorithm = algorithm.toLowerCase();\n var Algorithm = exports[algorithm];\n if (!Algorithm) throw new Error(algorithm + \" is not supported (we accept pull requests)\");\n return new Algorithm();\n });\n exports.sha = require_sha();\n exports.sha1 = require_sha1();\n exports.sha224 = require_sha224();\n exports.sha256 = require_sha256();\n exports.sha384 = require_sha384();\n exports.sha512 = require_sha512();\n },\n});\n\n// stream.js\nvar stream_exports = import.meta.require(\"node:stream\");\n\n// node_modules/cipher-base/index.js\nvar require_cipher_base = __commonJS({\n \"node_modules/cipher-base/index.js\"(exports, module) {\n var Buffer2 = require_safe_buffer().Buffer,\n Transform = stream_exports.Transform,\n StringDecoder = __require(\"string_decoder\").StringDecoder,\n inherits = require_inherits_browser();\n function CipherBase(hashMode) {\n Transform.call(this),\n (this.hashMode = typeof hashMode == \"string\"),\n this.hashMode ? (this[hashMode] = this._finalOrDigest) : (this.final = this._finalOrDigest),\n this._final && ((this.__final = this._final), (this._final = null)),\n (this._decoder = null),\n (this._encoding = null);\n }\n inherits(CipherBase, Transform);\n CipherBase.prototype.update = function (data, inputEnc, outputEnc) {\n typeof data == \"string\" && (data = Buffer2.from(data, inputEnc));\n var outData = this._update(data);\n return this.hashMode ? this : (outputEnc && (outData = this._toString(outData, outputEnc)), outData);\n };\n CipherBase.prototype.setAutoPadding = function () {};\n CipherBase.prototype.getAuthTag = function () {\n throw new Error(\"trying to get auth tag in unsupported state\");\n };\n CipherBase.prototype.setAuthTag = function () {\n throw new Error(\"trying to set auth tag in unsupported state\");\n };\n CipherBase.prototype.setAAD = function () {\n throw new Error(\"trying to set aad in unsupported state\");\n };\n CipherBase.prototype._transform = function (data, _, next) {\n var err;\n try {\n this.hashMode ? this._update(data) : this.push(this._update(data));\n } catch (e) {\n err = e;\n } finally {\n next(err);\n }\n };\n CipherBase.prototype._flush = function (done) {\n var err;\n try {\n this.push(this.__final());\n } catch (e) {\n err = e;\n }\n done(err);\n };\n CipherBase.prototype._finalOrDigest = function (outputEnc) {\n var outData = this.__final() || Buffer2.alloc(0);\n return outputEnc && (outData = this._toString(outData, outputEnc, !0)), outData;\n };\n CipherBase.prototype._toString = function (value, enc, fin) {\n if ((this._decoder || ((this._decoder = new StringDecoder(enc)), (this._encoding = enc)), this._encoding !== enc))\n throw new Error(\"can't switch encodings\");\n var out = this._decoder.write(value);\n return fin && (out += this._decoder.end()), out;\n };\n module.exports = CipherBase;\n },\n});\n\n// node_modules/create-hash/browser.js\nvar require_browser2 = __commonJS({\n \"node_modules/create-hash/browser.js\"(exports, module) {\n (\"use strict\");\n const { Transform } = stream_exports;\n\n // does not become a node stream unless you create it into one\n const LazyHash = function Hash(algorithm, options) {\n this._options = options;\n this._hasher = new CryptoHasher(algorithm, options);\n this._finalized = false;\n };\n LazyHash.prototype = Object.create(Transform.prototype);\n LazyHash.prototype.update = function update(data, encoding) {\n this._checkFinalized();\n this._hasher.update(data, encoding);\n return this;\n };\n LazyHash.prototype.digest = function update(data, encoding) {\n this._checkFinalized();\n this._finalized = true;\n return this._hasher.digest(data, encoding);\n };\n LazyHash.prototype._checkFinalized = function _checkFinalized() {\n if (this._finalized) {\n var err = new Error(\"Digest already called\");\n err.code = \"ERR_CRYPTO_HASH_FINALIZED\";\n throw err;\n }\n };\n LazyHash.prototype.copy = function copy() {\n const copy = Object.create(LazyHash.prototype);\n copy._options = this._options;\n copy._hasher = this._hasher.copy();\n copy._finalized = this._finalized;\n return copy;\n };\n\n const lazyHashFullInitProto = {\n __proto__: Transform.prototype,\n ...LazyHash.prototype,\n _transform(data, encoding, callback) {\n this.update(data, encoding);\n callback && callback();\n },\n _flush(callback) {\n this.push(this.digest());\n callback();\n },\n };\n\n const triggerMethods = [\n \"_events\",\n \"_eventsCount\",\n \"_final\",\n \"_maxListeners\",\n \"_maxListeners\",\n \"_read\",\n \"_undestroy\",\n \"_writableState\",\n \"_write\",\n \"_writev\",\n \"addListener\",\n \"asIndexedPairs\",\n \"closed\",\n \"compose\",\n \"constructor\",\n \"cork\",\n \"destroy\",\n \"destroyed\",\n \"drop\",\n \"emit\",\n \"end\",\n \"errored\",\n \"eventNames\",\n \"every\",\n \"filter\",\n \"find\",\n \"flatMap\",\n \"forEach\",\n \"getMaxListeners\",\n \"hasOwnProperty\",\n \"isPaused\",\n \"isPrototypeOf\",\n \"iterator\",\n \"listenerCount\",\n \"listeners\",\n \"map\",\n \"off\",\n \"on\",\n \"once\",\n \"pause\",\n \"pipe\",\n \"prependListener\",\n \"prependOnceListener\",\n \"propertyIsEnumerable\",\n \"push\",\n \"rawListeners\",\n \"read\",\n \"readable\",\n \"readableAborted\",\n \"readableBuffer\",\n \"readableDidRead\",\n \"readableEncoding\",\n \"readableEnded\",\n \"readableFlowing\",\n \"readableHighWaterMark\",\n \"readableLength\",\n \"readableObjectMode\",\n \"reduce\",\n \"removeAllListeners\",\n \"removeListener\",\n \"resume\",\n \"setDefaultEncoding\",\n \"setEncoding\",\n \"setMaxListeners\",\n \"some\",\n \"take\",\n \"toArray\",\n \"toLocaleString\",\n \"toString\",\n \"uncork\",\n \"unpipe\",\n \"unshift\",\n \"valueOf\",\n \"wrap\",\n \"writable\",\n \"writableBuffer\",\n \"writableCorked\",\n \"writableEnded\",\n \"writableFinished\",\n \"writableHighWaterMark\",\n \"writableLength\",\n \"writableNeedDrain\",\n \"writableObjectMode\",\n \"write\",\n ];\n for (const method of triggerMethods) {\n Object.defineProperty(LazyHash.prototype, method, {\n get() {\n Object.setPrototypeOf(this, lazyHashFullInitProto);\n Transform.call(this, this._options);\n return this[method];\n },\n enumerable: false,\n configurable: true,\n });\n }\n\n module.exports = function createHash(algorithm) {\n return new LazyHash(algorithm);\n };\n\n module.exports.createHash = module.exports;\n module.exports.Hash = LazyHash;\n },\n});\n\n// node_modules/create-hmac/legacy.js\nvar require_legacy = __commonJS({\n \"node_modules/create-hmac/legacy.js\"(exports, module) {\n \"use strict\";\n var inherits = require_inherits_browser(),\n Buffer2 = require_safe_buffer().Buffer,\n Base = require_cipher_base(),\n ZEROS = Buffer2.alloc(128),\n blocksize = 64;\n function Hmac(alg, key) {\n Base.call(this, \"digest\"),\n typeof key == \"string\" && (key = Buffer2.from(key)),\n (this._alg = alg),\n (this._key = key),\n key.length > blocksize\n ? (key = alg(key))\n : key.length < blocksize && (key = Buffer2.concat([key, ZEROS], blocksize));\n for (\n var ipad = (this._ipad = Buffer2.allocUnsafe(blocksize)),\n opad = (this._opad = Buffer2.allocUnsafe(blocksize)),\n i = 0;\n i < blocksize;\n i++\n )\n (ipad[i] = key[i] ^ 54), (opad[i] = key[i] ^ 92);\n this._hash = [ipad];\n }\n inherits(Hmac, Base);\n Hmac.prototype._update = function (data) {\n this._hash.push(data);\n };\n Hmac.prototype._final = function () {\n var h = this._alg(Buffer2.concat(this._hash));\n return this._alg(Buffer2.concat([this._opad, h]));\n };\n module.exports = Hmac;\n },\n});\n\n// node_modules/create-hash/md5.js\nvar require_md52 = __commonJS({\n \"node_modules/create-hash/md5.js\"(exports, module) {\n var MD5 = require_md5();\n module.exports = function (buffer) {\n return new MD5().update(buffer).digest();\n };\n },\n});\n\n// node_modules/create-hmac/browser.js\nvar require_browser3 = __commonJS({\n \"node_modules/create-hmac/browser.js\"(exports, module) {\n \"use strict\";\n var inherits = require_inherits_browser(),\n Legacy = require_legacy(),\n Base = require_cipher_base(),\n Buffer2 = require_safe_buffer().Buffer,\n md5 = require_md52(),\n RIPEMD160 = require_ripemd160(),\n sha = require_sha2(),\n ZEROS = Buffer2.alloc(128);\n function Hmac(alg, key) {\n Base.call(this, \"digest\"), typeof key == \"string\" && (key = Buffer2.from(key));\n var blocksize = alg === \"sha512\" || alg === \"sha384\" ? 128 : 64;\n if (((this._alg = alg), (this._key = key), key.length > blocksize)) {\n var hash = alg === \"rmd160\" ? new RIPEMD160() : sha(alg);\n key = hash.update(key).digest();\n } else key.length < blocksize && (key = Buffer2.concat([key, ZEROS], blocksize));\n for (\n var ipad = (this._ipad = Buffer2.allocUnsafe(blocksize)),\n opad = (this._opad = Buffer2.allocUnsafe(blocksize)),\n i = 0;\n i < blocksize;\n i++\n )\n (ipad[i] = key[i] ^ 54), (opad[i] = key[i] ^ 92);\n (this._hash = alg === \"rmd160\" ? new RIPEMD160() : sha(alg)), this._hash.update(ipad);\n }\n inherits(Hmac, Base);\n Hmac.prototype._update = function (data) {\n this._hash.update(data);\n };\n Hmac.prototype._final = function () {\n var h = this._hash.digest(),\n hash = this._alg === \"rmd160\" ? new RIPEMD160() : sha(this._alg);\n return hash.update(this._opad).update(h).digest();\n };\n module.exports = function (alg, key) {\n return (\n (alg = alg.toLowerCase()),\n alg === \"rmd160\" || alg === \"ripemd160\"\n ? new Hmac(\"rmd160\", key)\n : alg === \"md5\"\n ? new Legacy(md5, key)\n : new Hmac(alg, key)\n );\n };\n },\n});\n\n// node_modules/browserify-sign/browser/algorithms.json\nvar require_algorithms = __commonJS({\n \"node_modules/browserify-sign/browser/algorithms.json\"(exports, module) {\n module.exports = {\n sha224WithRSAEncryption: {\n sign: \"rsa\",\n hash: \"sha224\",\n id: \"302d300d06096086480165030402040500041c\",\n },\n \"RSA-SHA224\": {\n sign: \"ecdsa/rsa\",\n hash: \"sha224\",\n id: \"302d300d06096086480165030402040500041c\",\n },\n sha256WithRSAEncryption: {\n sign: \"rsa\",\n hash: \"sha256\",\n id: \"3031300d060960864801650304020105000420\",\n },\n \"RSA-SHA256\": {\n sign: \"ecdsa/rsa\",\n hash: \"sha256\",\n id: \"3031300d060960864801650304020105000420\",\n },\n sha384WithRSAEncryption: {\n sign: \"rsa\",\n hash: \"sha384\",\n id: \"3041300d060960864801650304020205000430\",\n },\n \"RSA-SHA384\": {\n sign: \"ecdsa/rsa\",\n hash: \"sha384\",\n id: \"3041300d060960864801650304020205000430\",\n },\n sha512WithRSAEncryption: {\n sign: \"rsa\",\n hash: \"sha512\",\n id: \"3051300d060960864801650304020305000440\",\n },\n \"RSA-SHA512\": {\n sign: \"ecdsa/rsa\",\n hash: \"sha512\",\n id: \"3051300d060960864801650304020305000440\",\n },\n \"RSA-SHA1\": {\n sign: \"rsa\",\n hash: \"sha1\",\n id: \"3021300906052b0e03021a05000414\",\n },\n \"ecdsa-with-SHA1\": {\n sign: \"ecdsa\",\n hash: \"sha1\",\n id: \"\",\n },\n sha256: {\n sign: \"ecdsa\",\n hash: \"sha256\",\n id: \"\",\n },\n sha224: {\n sign: \"ecdsa\",\n hash: \"sha224\",\n id: \"\",\n },\n sha384: {\n sign: \"ecdsa\",\n hash: \"sha384\",\n id: \"\",\n },\n sha512: {\n sign: \"ecdsa\",\n hash: \"sha512\",\n id: \"\",\n },\n \"DSA-SHA\": {\n sign: \"dsa\",\n hash: \"sha1\",\n id: \"\",\n },\n \"DSA-SHA1\": {\n sign: \"dsa\",\n hash: \"sha1\",\n id: \"\",\n },\n DSA: {\n sign: \"dsa\",\n hash: \"sha1\",\n id: \"\",\n },\n \"DSA-WITH-SHA224\": {\n sign: \"dsa\",\n hash: \"sha224\",\n id: \"\",\n },\n \"DSA-SHA224\": {\n sign: \"dsa\",\n hash: \"sha224\",\n id: \"\",\n },\n \"DSA-WITH-SHA256\": {\n sign: \"dsa\",\n hash: \"sha256\",\n id: \"\",\n },\n \"DSA-SHA256\": {\n sign: \"dsa\",\n hash: \"sha256\",\n id: \"\",\n },\n \"DSA-WITH-SHA384\": {\n sign: \"dsa\",\n hash: \"sha384\",\n id: \"\",\n },\n \"DSA-SHA384\": {\n sign: \"dsa\",\n hash: \"sha384\",\n id: \"\",\n },\n \"DSA-WITH-SHA512\": {\n sign: \"dsa\",\n hash: \"sha512\",\n id: \"\",\n },\n \"DSA-SHA512\": {\n sign: \"dsa\",\n hash: \"sha512\",\n id: \"\",\n },\n \"DSA-RIPEMD160\": {\n sign: \"dsa\",\n hash: \"rmd160\",\n id: \"\",\n },\n ripemd160WithRSA: {\n sign: \"rsa\",\n hash: \"rmd160\",\n id: \"3021300906052b2403020105000414\",\n },\n \"RSA-RIPEMD160\": {\n sign: \"rsa\",\n hash: \"rmd160\",\n id: \"3021300906052b2403020105000414\",\n },\n md5WithRSAEncryption: {\n sign: \"rsa\",\n hash: \"md5\",\n id: \"3020300c06082a864886f70d020505000410\",\n },\n \"RSA-MD5\": {\n sign: \"rsa\",\n hash: \"md5\",\n id: \"3020300c06082a864886f70d020505000410\",\n },\n };\n },\n});\n\n// node_modules/browserify-sign/algos.js\nvar require_algos = __commonJS({\n \"node_modules/browserify-sign/algos.js\"(exports, module) {\n module.exports = require_algorithms();\n },\n});\n\n// node_modules/pbkdf2/lib/precondition.js\nvar require_precondition = __commonJS({\n \"node_modules/pbkdf2/lib/precondition.js\"(exports, module) {\n var MAX_ALLOC = Math.pow(2, 30) - 1;\n module.exports = function (iterations, keylen) {\n if (typeof iterations != \"number\") throw new TypeError(\"Iterations not a number\");\n if (iterations < 0) throw new TypeError(\"Bad iterations\");\n if (typeof keylen != \"number\") throw new TypeError(\"Key length not a number\");\n if (keylen < 0 || keylen > MAX_ALLOC || keylen !== keylen) throw new TypeError(\"Bad key length\");\n };\n },\n});\n\n// node_modules/pbkdf2/lib/default-encoding.js\nvar require_default_encoding = __commonJS({\n \"node_modules/pbkdf2/lib/default-encoding.js\"(exports, module) {\n var defaultEncoding;\n global.process && global.process.browser\n ? (defaultEncoding = \"utf-8\")\n : global.process && global.process.version\n ? ((pVersionMajor = parseInt(process.version.split(\".\")[0].slice(1), 10)),\n (defaultEncoding = pVersionMajor >= 6 ? \"utf-8\" : \"binary\"))\n : (defaultEncoding = \"utf-8\");\n var pVersionMajor;\n module.exports = defaultEncoding;\n },\n});\n\n// node_modules/pbkdf2/lib/to-buffer.js\nvar require_to_buffer = __commonJS({\n \"node_modules/pbkdf2/lib/to-buffer.js\"(exports, module) {\n var Buffer2 = require_safe_buffer().Buffer;\n module.exports = function (thing, encoding, name) {\n if (Buffer2.isBuffer(thing)) return thing;\n if (typeof thing == \"string\") return Buffer2.from(thing, encoding);\n if (ArrayBuffer.isView(thing)) return Buffer2.from(thing.buffer);\n throw new TypeError(name + \" must be a string, a Buffer, a typed array or a DataView\");\n };\n },\n});\n\n// node_modules/pbkdf2/lib/sync-browser.js\nvar require_sync_browser = __commonJS({\n \"node_modules/pbkdf2/lib/sync-browser.js\"(exports, module) {\n var md5 = require_md52(),\n RIPEMD160 = require_ripemd160(),\n sha = require_sha2(),\n Buffer2 = require_safe_buffer().Buffer,\n checkParameters = require_precondition(),\n defaultEncoding = require_default_encoding(),\n toBuffer = require_to_buffer(),\n ZEROS = Buffer2.alloc(128),\n sizes = {\n md5: 16,\n sha1: 20,\n sha224: 28,\n sha256: 32,\n sha384: 48,\n sha512: 64,\n rmd160: 20,\n ripemd160: 20,\n };\n function Hmac(alg, key, saltLen) {\n var hash = getDigest(alg),\n blocksize = alg === \"sha512\" || alg === \"sha384\" ? 128 : 64;\n key.length > blocksize\n ? (key = hash(key))\n : key.length < blocksize && (key = Buffer2.concat([key, ZEROS], blocksize));\n for (\n var ipad = Buffer2.allocUnsafe(blocksize + sizes[alg]),\n opad = Buffer2.allocUnsafe(blocksize + sizes[alg]),\n i = 0;\n i < blocksize;\n i++\n )\n (ipad[i] = key[i] ^ 54), (opad[i] = key[i] ^ 92);\n var ipad1 = Buffer2.allocUnsafe(blocksize + saltLen + 4);\n ipad.copy(ipad1, 0, 0, blocksize),\n (this.ipad1 = ipad1),\n (this.ipad2 = ipad),\n (this.opad = opad),\n (this.alg = alg),\n (this.blocksize = blocksize),\n (this.hash = hash),\n (this.size = sizes[alg]);\n }\n Hmac.prototype.run = function (data, ipad) {\n data.copy(ipad, this.blocksize);\n var h = this.hash(ipad);\n return h.copy(this.opad, this.blocksize), this.hash(this.opad);\n };\n function getDigest(alg) {\n function shaFunc(data) {\n return sha(alg).update(data).digest();\n }\n function rmd160Func(data) {\n return new RIPEMD160().update(data).digest();\n }\n return alg === \"rmd160\" || alg === \"ripemd160\" ? rmd160Func : alg === \"md5\" ? md5 : shaFunc;\n }\n function pbkdf2(password, salt, iterations, keylen, digest) {\n checkParameters(iterations, keylen),\n (password = toBuffer(password, defaultEncoding, \"Password\")),\n (salt = toBuffer(salt, defaultEncoding, \"Salt\")),\n (digest = digest || \"sha1\");\n var hmac = new Hmac(digest, password, salt.length),\n DK = Buffer2.allocUnsafe(keylen),\n block1 = Buffer2.allocUnsafe(salt.length + 4);\n salt.copy(block1, 0, 0, salt.length);\n for (var destPos = 0, hLen = sizes[digest], l = Math.ceil(keylen / hLen), i = 1; i <= l; i++) {\n block1.writeUInt32BE(i, salt.length);\n for (var T = hmac.run(block1, hmac.ipad1), U = T, j = 1; j < iterations; j++) {\n U = hmac.run(U, hmac.ipad2);\n for (var k = 0; k < hLen; k++) T[k] ^= U[k];\n }\n T.copy(DK, destPos), (destPos += hLen);\n }\n return DK;\n }\n module.exports = pbkdf2;\n },\n});\n\n// node_modules/pbkdf2/lib/async.js\nvar require_async = __commonJS({\n \"node_modules/pbkdf2/lib/async.js\"(exports, module) {\n var Buffer2 = require_safe_buffer().Buffer,\n checkParameters = require_precondition(),\n defaultEncoding = require_default_encoding(),\n sync = require_sync_browser(),\n toBuffer = require_to_buffer(),\n ZERO_BUF,\n subtle = globalCrypto.subtle,\n toBrowser = {\n sha: \"SHA-1\",\n \"sha-1\": \"SHA-1\",\n sha1: \"SHA-1\",\n sha256: \"SHA-256\",\n \"sha-256\": \"SHA-256\",\n sha384: \"SHA-384\",\n \"sha-384\": \"SHA-384\",\n \"sha-512\": \"SHA-512\",\n sha512: \"SHA-512\",\n },\n checks = [];\n function checkNative(algo) {\n if ((global.process && !global.process.browser) || !subtle || !subtle.importKey || !subtle.deriveBits)\n return Promise.resolve(!1);\n if (checks[algo] !== void 0) return checks[algo];\n ZERO_BUF = ZERO_BUF || Buffer2.alloc(8);\n var prom = browserPbkdf2(ZERO_BUF, ZERO_BUF, 10, 128, algo)\n .then(function () {\n return !0;\n })\n .catch(function () {\n return !1;\n });\n return (checks[algo] = prom), prom;\n }\n var nextTick;\n function getNextTick() {\n return (\n nextTick ||\n (global.process && global.process.nextTick\n ? (nextTick = global.process.nextTick)\n : global.queueMicrotask\n ? (nextTick = global.queueMicrotask)\n : global.setImmediate\n ? (nextTick = global.setImmediate)\n : (nextTick = global.setTimeout),\n nextTick)\n );\n }\n function browserPbkdf2(password, salt, iterations, length, algo) {\n return subtle\n .importKey(\"raw\", password, { name: \"PBKDF2\" }, !1, [\"deriveBits\"])\n .then(function (key) {\n return subtle.deriveBits(\n {\n name: \"PBKDF2\",\n salt,\n iterations,\n hash: {\n name: algo,\n },\n },\n key,\n length << 3,\n );\n })\n .then(function (res) {\n return Buffer2.from(res);\n });\n }\n function resolvePromise(promise, callback) {\n promise.then(\n function (out) {\n getNextTick()(function () {\n callback(null, out);\n });\n },\n function (e) {\n getNextTick()(function () {\n callback(e);\n });\n },\n );\n }\n module.exports = function (password, salt, iterations, keylen, digest, callback) {\n typeof digest == \"function\" && ((callback = digest), (digest = void 0)), (digest = digest || \"sha1\");\n var algo = toBrowser[digest.toLowerCase()];\n if (!algo || typeof global.Promise != \"function\") {\n getNextTick()(function () {\n var out;\n try {\n out = sync(password, salt, iterations, keylen, digest);\n } catch (e) {\n return callback(e);\n }\n callback(null, out);\n });\n return;\n }\n if (\n (checkParameters(iterations, keylen),\n (password = toBuffer(password, defaultEncoding, \"Password\")),\n (salt = toBuffer(salt, defaultEncoding, \"Salt\")),\n typeof callback != \"function\")\n )\n throw new Error(\"No callback provided to pbkdf2\");\n resolvePromise(\n checkNative(algo).then(function (resp) {\n return resp\n ? browserPbkdf2(password, salt, iterations, keylen, algo)\n : sync(password, salt, iterations, keylen, digest);\n }),\n callback,\n );\n };\n },\n});\n\n// node_modules/pbkdf2/browser.js\nvar require_browser4 = __commonJS({\n \"node_modules/pbkdf2/browser.js\"(exports) {\n exports.pbkdf2 = require_async();\n exports.pbkdf2Sync = require_sync_browser();\n },\n});\n\n// node_modules/des.js/lib/des/utils.js\nvar require_utils = __commonJS({\n \"node_modules/des.js/lib/des/utils.js\"(exports) {\n \"use strict\";\n exports.readUInt32BE = function (bytes, off) {\n var res = (bytes[0 + off] << 24) | (bytes[1 + off] << 16) | (bytes[2 + off] << 8) | bytes[3 + off];\n return res >>> 0;\n };\n exports.writeUInt32BE = function (bytes, value, off) {\n (bytes[0 + off] = value >>> 24),\n (bytes[1 + off] = (value >>> 16) & 255),\n (bytes[2 + off] = (value >>> 8) & 255),\n (bytes[3 + off] = value & 255);\n };\n exports.ip = function (inL, inR, out, off) {\n for (var outL = 0, outR = 0, i = 6; i >= 0; i -= 2) {\n for (var j = 0; j <= 24; j += 8) (outL <<= 1), (outL |= (inR >>> (j + i)) & 1);\n for (var j = 0; j <= 24; j += 8) (outL <<= 1), (outL |= (inL >>> (j + i)) & 1);\n }\n for (var i = 6; i >= 0; i -= 2) {\n for (var j = 1; j <= 25; j += 8) (outR <<= 1), (outR |= (inR >>> (j + i)) & 1);\n for (var j = 1; j <= 25; j += 8) (outR <<= 1), (outR |= (inL >>> (j + i)) & 1);\n }\n (out[off + 0] = outL >>> 0), (out[off + 1] = outR >>> 0);\n };\n exports.rip = function (inL, inR, out, off) {\n for (var outL = 0, outR = 0, i = 0; i < 4; i++)\n for (var j = 24; j >= 0; j -= 8)\n (outL <<= 1), (outL |= (inR >>> (j + i)) & 1), (outL <<= 1), (outL |= (inL >>> (j + i)) & 1);\n for (var i = 4; i < 8; i++)\n for (var j = 24; j >= 0; j -= 8)\n (outR <<= 1), (outR |= (inR >>> (j + i)) & 1), (outR <<= 1), (outR |= (inL >>> (j + i)) & 1);\n (out[off + 0] = outL >>> 0), (out[off + 1] = outR >>> 0);\n };\n exports.pc1 = function (inL, inR, out, off) {\n for (var outL = 0, outR = 0, i = 7; i >= 5; i--) {\n for (var j = 0; j <= 24; j += 8) (outL <<= 1), (outL |= (inR >> (j + i)) & 1);\n for (var j = 0; j <= 24; j += 8) (outL <<= 1), (outL |= (inL >> (j + i)) & 1);\n }\n for (var j = 0; j <= 24; j += 8) (outL <<= 1), (outL |= (inR >> (j + i)) & 1);\n for (var i = 1; i <= 3; i++) {\n for (var j = 0; j <= 24; j += 8) (outR <<= 1), (outR |= (inR >> (j + i)) & 1);\n for (var j = 0; j <= 24; j += 8) (outR <<= 1), (outR |= (inL >> (j + i)) & 1);\n }\n for (var j = 0; j <= 24; j += 8) (outR <<= 1), (outR |= (inL >> (j + i)) & 1);\n (out[off + 0] = outL >>> 0), (out[off + 1] = outR >>> 0);\n };\n exports.r28shl = function (num, shift) {\n return ((num << shift) & 268435455) | (num >>> (28 - shift));\n };\n var pc2table = [\n 14, 11, 17, 4, 27, 23, 25, 0, 13, 22, 7, 18, 5, 9, 16, 24, 2, 20, 12, 21, 1, 8, 15, 26, 15, 4, 25, 19, 9, 1, 26,\n 16, 5, 11, 23, 8, 12, 7, 17, 0, 22, 3, 10, 14, 6, 20, 27, 24,\n ];\n exports.pc2 = function (inL, inR, out, off) {\n for (var outL = 0, outR = 0, len = pc2table.length >>> 1, i = 0; i < len; i++)\n (outL <<= 1), (outL |= (inL >>> pc2table[i]) & 1);\n for (var i = len; i < pc2table.length; i++) (outR <<= 1), (outR |= (inR >>> pc2table[i]) & 1);\n (out[off + 0] = outL >>> 0), (out[off + 1] = outR >>> 0);\n };\n exports.expand = function (r, out, off) {\n var outL = 0,\n outR = 0;\n outL = ((r & 1) << 5) | (r >>> 27);\n for (var i = 23; i >= 15; i -= 4) (outL <<= 6), (outL |= (r >>> i) & 63);\n for (var i = 11; i >= 3; i -= 4) (outR |= (r >>> i) & 63), (outR <<= 6);\n (outR |= ((r & 31) << 1) | (r >>> 31)), (out[off + 0] = outL >>> 0), (out[off + 1] = outR >>> 0);\n };\n var sTable = [\n 14, 0, 4, 15, 13, 7, 1, 4, 2, 14, 15, 2, 11, 13, 8, 1, 3, 10, 10, 6, 6, 12, 12, 11, 5, 9, 9, 5, 0, 3, 7, 8, 4, 15,\n 1, 12, 14, 8, 8, 2, 13, 4, 6, 9, 2, 1, 11, 7, 15, 5, 12, 11, 9, 3, 7, 14, 3, 10, 10, 0, 5, 6, 0, 13, 15, 3, 1, 13,\n 8, 4, 14, 7, 6, 15, 11, 2, 3, 8, 4, 14, 9, 12, 7, 0, 2, 1, 13, 10, 12, 6, 0, 9, 5, 11, 10, 5, 0, 13, 14, 8, 7, 10,\n 11, 1, 10, 3, 4, 15, 13, 4, 1, 2, 5, 11, 8, 6, 12, 7, 6, 12, 9, 0, 3, 5, 2, 14, 15, 9, 10, 13, 0, 7, 9, 0, 14, 9,\n 6, 3, 3, 4, 15, 6, 5, 10, 1, 2, 13, 8, 12, 5, 7, 14, 11, 12, 4, 11, 2, 15, 8, 1, 13, 1, 6, 10, 4, 13, 9, 0, 8, 6,\n 15, 9, 3, 8, 0, 7, 11, 4, 1, 15, 2, 14, 12, 3, 5, 11, 10, 5, 14, 2, 7, 12, 7, 13, 13, 8, 14, 11, 3, 5, 0, 6, 6,\n 15, 9, 0, 10, 3, 1, 4, 2, 7, 8, 2, 5, 12, 11, 1, 12, 10, 4, 14, 15, 9, 10, 3, 6, 15, 9, 0, 0, 6, 12, 10, 11, 1, 7,\n 13, 13, 8, 15, 9, 1, 4, 3, 5, 14, 11, 5, 12, 2, 7, 8, 2, 4, 14, 2, 14, 12, 11, 4, 2, 1, 12, 7, 4, 10, 7, 11, 13,\n 6, 1, 8, 5, 5, 0, 3, 15, 15, 10, 13, 3, 0, 9, 14, 8, 9, 6, 4, 11, 2, 8, 1, 12, 11, 7, 10, 1, 13, 14, 7, 2, 8, 13,\n 15, 6, 9, 15, 12, 0, 5, 9, 6, 10, 3, 4, 0, 5, 14, 3, 12, 10, 1, 15, 10, 4, 15, 2, 9, 7, 2, 12, 6, 9, 8, 5, 0, 6,\n 13, 1, 3, 13, 4, 14, 14, 0, 7, 11, 5, 3, 11, 8, 9, 4, 14, 3, 15, 2, 5, 12, 2, 9, 8, 5, 12, 15, 3, 10, 7, 11, 0,\n 14, 4, 1, 10, 7, 1, 6, 13, 0, 11, 8, 6, 13, 4, 13, 11, 0, 2, 11, 14, 7, 15, 4, 0, 9, 8, 1, 13, 10, 3, 14, 12, 3,\n 9, 5, 7, 12, 5, 2, 10, 15, 6, 8, 1, 6, 1, 6, 4, 11, 11, 13, 13, 8, 12, 1, 3, 4, 7, 10, 14, 7, 10, 9, 15, 5, 6, 0,\n 8, 15, 0, 14, 5, 2, 9, 3, 2, 12, 13, 1, 2, 15, 8, 13, 4, 8, 6, 10, 15, 3, 11, 7, 1, 4, 10, 12, 9, 5, 3, 6, 14, 11,\n 5, 0, 0, 14, 12, 9, 7, 2, 7, 2, 11, 1, 4, 14, 1, 7, 9, 4, 12, 10, 14, 8, 2, 13, 0, 15, 6, 12, 10, 9, 13, 0, 15, 3,\n 3, 5, 5, 6, 8, 11,\n ];\n exports.substitute = function (inL, inR) {\n for (var out = 0, i = 0; i < 4; i++) {\n var b = (inL >>> (18 - i * 6)) & 63,\n sb = sTable[i * 64 + b];\n (out <<= 4), (out |= sb);\n }\n for (var i = 0; i < 4; i++) {\n var b = (inR >>> (18 - i * 6)) & 63,\n sb = sTable[4 * 64 + i * 64 + b];\n (out <<= 4), (out |= sb);\n }\n return out >>> 0;\n };\n var permuteTable = [\n 16, 25, 12, 11, 3, 20, 4, 15, 31, 17, 9, 6, 27, 14, 1, 22, 30, 24, 8, 18, 0, 5, 29, 23, 13, 19, 2, 26, 10, 21, 28,\n 7,\n ];\n exports.permute = function (num) {\n for (var out = 0, i = 0; i < permuteTable.length; i++) (out <<= 1), (out |= (num >>> permuteTable[i]) & 1);\n return out >>> 0;\n };\n exports.padSplit = function (num, size, group) {\n for (var str = num.toString(2); str.length < size; ) str = \"0\" + str;\n for (var out = [], i = 0; i < size; i += group) out.push(str.slice(i, i + group));\n return out.join(\" \");\n };\n },\n});\n\n// node_modules/minimalistic-assert/index.js\nvar require_minimalistic_assert = __commonJS({\n \"node_modules/minimalistic-assert/index.js\"(exports, module) {\n module.exports = assert;\n function assert(val, msg) {\n if (!val) throw new Error(msg || \"Assertion failed\");\n }\n assert.equal = function (l, r, msg) {\n if (l != r) throw new Error(msg || \"Assertion failed: \" + l + \" != \" + r);\n };\n },\n});\n\n// node_modules/des.js/lib/des/cipher.js\nvar require_cipher = __commonJS({\n \"node_modules/des.js/lib/des/cipher.js\"(exports, module) {\n \"use strict\";\n var assert = require_minimalistic_assert();\n function Cipher(options) {\n (this.options = options),\n (this.type = this.options.type),\n (this.blockSize = 8),\n this._init(),\n (this.buffer = new Array(this.blockSize)),\n (this.bufferOff = 0);\n }\n module.exports = Cipher;\n Cipher.prototype._init = function () {};\n Cipher.prototype.update = function (data) {\n return data.length === 0 ? [] : this.type === \"decrypt\" ? this._updateDecrypt(data) : this._updateEncrypt(data);\n };\n Cipher.prototype._buffer = function (data, off) {\n for (var min = Math.min(this.buffer.length - this.bufferOff, data.length - off), i = 0; i < min; i++)\n this.buffer[this.bufferOff + i] = data[off + i];\n return (this.bufferOff += min), min;\n };\n Cipher.prototype._flushBuffer = function (out, off) {\n return this._update(this.buffer, 0, out, off), (this.bufferOff = 0), this.blockSize;\n };\n Cipher.prototype._updateEncrypt = function (data) {\n var inputOff = 0,\n outputOff = 0,\n count = ((this.bufferOff + data.length) / this.blockSize) | 0,\n out = new Array(count * this.blockSize);\n this.bufferOff !== 0 &&\n ((inputOff += this._buffer(data, inputOff)),\n this.bufferOff === this.buffer.length && (outputOff += this._flushBuffer(out, outputOff)));\n for (\n var max = data.length - ((data.length - inputOff) % this.blockSize);\n inputOff < max;\n inputOff += this.blockSize\n )\n this._update(data, inputOff, out, outputOff), (outputOff += this.blockSize);\n for (; inputOff < data.length; inputOff++, this.bufferOff++) this.buffer[this.bufferOff] = data[inputOff];\n return out;\n };\n Cipher.prototype._updateDecrypt = function (data) {\n for (\n var inputOff = 0,\n outputOff = 0,\n count = Math.ceil((this.bufferOff + data.length) / this.blockSize) - 1,\n out = new Array(count * this.blockSize);\n count > 0;\n count--\n )\n (inputOff += this._buffer(data, inputOff)), (outputOff += this._flushBuffer(out, outputOff));\n return (inputOff += this._buffer(data, inputOff)), out;\n };\n Cipher.prototype.final = function (buffer) {\n var first;\n buffer && (first = this.update(buffer));\n var last;\n return (\n this.type === \"encrypt\" ? (last = this._finalEncrypt()) : (last = this._finalDecrypt()),\n first ? first.concat(last) : last\n );\n };\n Cipher.prototype._pad = function (buffer, off) {\n if (off === 0) return !1;\n for (; off < buffer.length; ) buffer[off++] = 0;\n return !0;\n };\n Cipher.prototype._finalEncrypt = function () {\n if (!this._pad(this.buffer, this.bufferOff)) return [];\n var out = new Array(this.blockSize);\n return this._update(this.buffer, 0, out, 0), out;\n };\n Cipher.prototype._unpad = function (buffer) {\n return buffer;\n };\n Cipher.prototype._finalDecrypt = function () {\n assert.equal(this.bufferOff, this.blockSize, \"Not enough data to decrypt\");\n var out = new Array(this.blockSize);\n return this._flushBuffer(out, 0), this._unpad(out);\n };\n },\n});\n\n// node_modules/des.js/lib/des/des.js\nvar require_des = __commonJS({\n \"node_modules/des.js/lib/des/des.js\"(exports, module) {\n \"use strict\";\n var assert = require_minimalistic_assert(),\n inherits = require_inherits_browser(),\n utils = require_utils(),\n Cipher = require_cipher();\n function DESState() {\n (this.tmp = new Array(2)), (this.keys = null);\n }\n function DES(options) {\n Cipher.call(this, options);\n var state = new DESState();\n (this._desState = state), this.deriveKeys(state, options.key);\n }\n inherits(DES, Cipher);\n module.exports = DES;\n DES.create = function (options) {\n return new DES(options);\n };\n var shiftTable = [1, 1, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 1];\n DES.prototype.deriveKeys = function (state, key) {\n (state.keys = new Array(16 * 2)), assert.equal(key.length, this.blockSize, \"Invalid key length\");\n var kL = utils.readUInt32BE(key, 0),\n kR = utils.readUInt32BE(key, 4);\n utils.pc1(kL, kR, state.tmp, 0), (kL = state.tmp[0]), (kR = state.tmp[1]);\n for (var i = 0; i < state.keys.length; i += 2) {\n var shift = shiftTable[i >>> 1];\n (kL = utils.r28shl(kL, shift)), (kR = utils.r28shl(kR, shift)), utils.pc2(kL, kR, state.keys, i);\n }\n };\n DES.prototype._update = function (inp, inOff, out, outOff) {\n var state = this._desState,\n l = utils.readUInt32BE(inp, inOff),\n r = utils.readUInt32BE(inp, inOff + 4);\n utils.ip(l, r, state.tmp, 0),\n (l = state.tmp[0]),\n (r = state.tmp[1]),\n this.type === \"encrypt\" ? this._encrypt(state, l, r, state.tmp, 0) : this._decrypt(state, l, r, state.tmp, 0),\n (l = state.tmp[0]),\n (r = state.tmp[1]),\n utils.writeUInt32BE(out, l, outOff),\n utils.writeUInt32BE(out, r, outOff + 4);\n };\n DES.prototype._pad = function (buffer, off) {\n for (var value = buffer.length - off, i = off; i < buffer.length; i++) buffer[i] = value;\n return !0;\n };\n DES.prototype._unpad = function (buffer) {\n for (var pad = buffer[buffer.length - 1], i = buffer.length - pad; i < buffer.length; i++)\n assert.equal(buffer[i], pad);\n return buffer.slice(0, buffer.length - pad);\n };\n DES.prototype._encrypt = function (state, lStart, rStart, out, off) {\n for (var l = lStart, r = rStart, i = 0; i < state.keys.length; i += 2) {\n var keyL = state.keys[i],\n keyR = state.keys[i + 1];\n utils.expand(r, state.tmp, 0), (keyL ^= state.tmp[0]), (keyR ^= state.tmp[1]);\n var s = utils.substitute(keyL, keyR),\n f = utils.permute(s),\n t = r;\n (r = (l ^ f) >>> 0), (l = t);\n }\n utils.rip(r, l, out, off);\n };\n DES.prototype._decrypt = function (state, lStart, rStart, out, off) {\n for (var l = rStart, r = lStart, i = state.keys.length - 2; i >= 0; i -= 2) {\n var keyL = state.keys[i],\n keyR = state.keys[i + 1];\n utils.expand(l, state.tmp, 0), (keyL ^= state.tmp[0]), (keyR ^= state.tmp[1]);\n var s = utils.substitute(keyL, keyR),\n f = utils.permute(s),\n t = l;\n (l = (r ^ f) >>> 0), (r = t);\n }\n utils.rip(l, r, out, off);\n };\n },\n});\n\n// node_modules/des.js/lib/des/cbc.js\nvar require_cbc = __commonJS({\n \"node_modules/des.js/lib/des/cbc.js\"(exports) {\n \"use strict\";\n var assert = require_minimalistic_assert(),\n inherits = require_inherits_browser(),\n proto = {};\n function CBCState(iv) {\n assert.equal(iv.length, 8, \"Invalid IV length\"), (this.iv = new Array(8));\n for (var i = 0; i < this.iv.length; i++) this.iv[i] = iv[i];\n }\n function instantiate(Base) {\n function CBC(options) {\n Base.call(this, options), this._cbcInit();\n }\n inherits(CBC, Base);\n for (var keys = Object.keys(proto), i = 0; i < keys.length; i++) {\n var key = keys[i];\n CBC.prototype[key] = proto[key];\n }\n return (\n (CBC.create = function (options) {\n return new CBC(options);\n }),\n CBC\n );\n }\n exports.instantiate = instantiate;\n proto._cbcInit = function () {\n var state = new CBCState(this.options.iv);\n this._cbcState = state;\n };\n proto._update = function (inp, inOff, out, outOff) {\n var state = this._cbcState,\n superProto = this.constructor.super_.prototype,\n iv = state.iv;\n if (this.type === \"encrypt\") {\n for (var i = 0; i < this.blockSize; i++) iv[i] ^= inp[inOff + i];\n superProto._update.call(this, iv, 0, out, outOff);\n for (var i = 0; i < this.blockSize; i++) iv[i] = out[outOff + i];\n } else {\n superProto._update.call(this, inp, inOff, out, outOff);\n for (var i = 0; i < this.blockSize; i++) out[outOff + i] ^= iv[i];\n for (var i = 0; i < this.blockSize; i++) iv[i] = inp[inOff + i];\n }\n };\n },\n});\n\n// node_modules/des.js/lib/des/ede.js\nvar require_ede = __commonJS({\n \"node_modules/des.js/lib/des/ede.js\"(exports, module) {\n \"use strict\";\n var assert = require_minimalistic_assert(),\n inherits = require_inherits_browser(),\n Cipher = require_cipher(),\n DES = require_des();\n function EDEState(type, key) {\n assert.equal(key.length, 24, \"Invalid key length\");\n var k1 = key.slice(0, 8),\n k2 = key.slice(8, 16),\n k3 = key.slice(16, 24);\n type === \"encrypt\"\n ? (this.ciphers = [\n DES.create({ type: \"encrypt\", key: k1 }),\n DES.create({ type: \"decrypt\", key: k2 }),\n DES.create({ type: \"encrypt\", key: k3 }),\n ])\n : (this.ciphers = [\n DES.create({ type: \"decrypt\", key: k3 }),\n DES.create({ type: \"encrypt\", key: k2 }),\n DES.create({ type: \"decrypt\", key: k1 }),\n ]);\n }\n function EDE(options) {\n Cipher.call(this, options);\n var state = new EDEState(this.type, this.options.key);\n this._edeState = state;\n }\n inherits(EDE, Cipher);\n module.exports = EDE;\n EDE.create = function (options) {\n return new EDE(options);\n };\n EDE.prototype._update = function (inp, inOff, out, outOff) {\n var state = this._edeState;\n state.ciphers[0]._update(inp, inOff, out, outOff),\n state.ciphers[1]._update(out, outOff, out, outOff),\n state.ciphers[2]._update(out, outOff, out, outOff);\n };\n EDE.prototype._pad = DES.prototype._pad;\n EDE.prototype._unpad = DES.prototype._unpad;\n },\n});\n\n// node_modules/des.js/lib/des.js\nvar require_des2 = __commonJS({\n \"node_modules/des.js/lib/des.js\"(exports) {\n \"use strict\";\n exports.utils = require_utils();\n exports.Cipher = require_cipher();\n exports.DES = require_des();\n exports.CBC = require_cbc();\n exports.EDE = require_ede();\n },\n});\n\n// node_modules/browserify-des/index.js\nvar require_browserify_des = __commonJS({\n \"node_modules/browserify-des/index.js\"(exports, module) {\n var CipherBase = require_cipher_base(),\n des = require_des2(),\n inherits = require_inherits_browser(),\n Buffer2 = require_safe_buffer().Buffer,\n modes = {\n \"des-ede3-cbc\": des.CBC.instantiate(des.EDE),\n \"des-ede3\": des.EDE,\n \"des-ede-cbc\": des.CBC.instantiate(des.EDE),\n \"des-ede\": des.EDE,\n \"des-cbc\": des.CBC.instantiate(des.DES),\n \"des-ecb\": des.DES,\n };\n modes.des = modes[\"des-cbc\"];\n modes.des3 = modes[\"des-ede3-cbc\"];\n module.exports = DES;\n inherits(DES, CipherBase);\n function DES(opts) {\n CipherBase.call(this);\n var modeName = opts.mode.toLowerCase(),\n mode = modes[modeName],\n type;\n opts.decrypt ? (type = \"decrypt\") : (type = \"encrypt\");\n var key = opts.key;\n Buffer2.isBuffer(key) || (key = Buffer2.from(key)),\n (modeName === \"des-ede\" || modeName === \"des-ede-cbc\") && (key = Buffer2.concat([key, key.slice(0, 8)]));\n var iv = opts.iv;\n Buffer2.isBuffer(iv) || (iv = Buffer2.from(iv)),\n (this._des = mode.create({\n key,\n iv,\n type,\n }));\n }\n DES.prototype._update = function (data) {\n return Buffer2.from(this._des.update(data));\n };\n DES.prototype._final = function () {\n return Buffer2.from(this._des.final());\n };\n },\n});\n\n// node_modules/browserify-aes/modes/ecb.js\nvar require_ecb = __commonJS({\n \"node_modules/browserify-aes/modes/ecb.js\"(exports) {\n exports.encrypt = function (self2, block) {\n return self2._cipher.encryptBlock(block);\n };\n exports.decrypt = function (self2, block) {\n return self2._cipher.decryptBlock(block);\n };\n },\n});\n\n// node_modules/buffer-xor/index.js\nvar require_buffer_xor = __commonJS({\n \"node_modules/buffer-xor/index.js\"(exports, module) {\n module.exports = function (a, b) {\n for (var length = Math.min(a.length, b.length), buffer = new Buffer(length), i = 0; i < length; ++i)\n buffer[i] = a[i] ^ b[i];\n return buffer;\n };\n },\n});\n\n// node_modules/browserify-aes/modes/cbc.js\nvar require_cbc2 = __commonJS({\n \"node_modules/browserify-aes/modes/cbc.js\"(exports) {\n var xor = require_buffer_xor();\n exports.encrypt = function (self2, block) {\n var data = xor(block, self2._prev);\n return (self2._prev = self2._cipher.encryptBlock(data)), self2._prev;\n };\n exports.decrypt = function (self2, block) {\n var pad = self2._prev;\n self2._prev = block;\n var out = self2._cipher.decryptBlock(block);\n return xor(out, pad);\n };\n },\n});\n\n// node_modules/browserify-aes/modes/cfb.js\nvar require_cfb = __commonJS({\n \"node_modules/browserify-aes/modes/cfb.js\"(exports) {\n var Buffer2 = require_safe_buffer().Buffer,\n xor = require_buffer_xor();\n function encryptStart(self2, data, decrypt) {\n var len = data.length,\n out = xor(data, self2._cache);\n return (\n (self2._cache = self2._cache.slice(len)),\n (self2._prev = Buffer2.concat([self2._prev, decrypt ? data : out])),\n out\n );\n }\n exports.encrypt = function (self2, data, decrypt) {\n for (var out = Buffer2.allocUnsafe(0), len; data.length; )\n if (\n (self2._cache.length === 0 &&\n ((self2._cache = self2._cipher.encryptBlock(self2._prev)), (self2._prev = Buffer2.allocUnsafe(0))),\n self2._cache.length <= data.length)\n )\n (len = self2._cache.length),\n (out = Buffer2.concat([out, encryptStart(self2, data.slice(0, len), decrypt)])),\n (data = data.slice(len));\n else {\n out = Buffer2.concat([out, encryptStart(self2, data, decrypt)]);\n break;\n }\n return out;\n };\n },\n});\n\n// node_modules/browserify-aes/modes/cfb8.js\nvar require_cfb8 = __commonJS({\n \"node_modules/browserify-aes/modes/cfb8.js\"(exports) {\n var Buffer2 = require_safe_buffer().Buffer;\n function encryptByte(self2, byteParam, decrypt) {\n var pad = self2._cipher.encryptBlock(self2._prev),\n out = pad[0] ^ byteParam;\n return (self2._prev = Buffer2.concat([self2._prev.slice(1), Buffer2.from([decrypt ? byteParam : out])])), out;\n }\n exports.encrypt = function (self2, chunk, decrypt) {\n for (var len = chunk.length, out = Buffer2.allocUnsafe(len), i = -1; ++i < len; )\n out[i] = encryptByte(self2, chunk[i], decrypt);\n return out;\n };\n },\n});\n\n// node_modules/browserify-aes/modes/cfb1.js\nvar require_cfb1 = __commonJS({\n \"node_modules/browserify-aes/modes/cfb1.js\"(exports) {\n var Buffer2 = require_safe_buffer().Buffer;\n function encryptByte(self2, byteParam, decrypt) {\n for (var pad, i = -1, len = 8, out = 0, bit, value; ++i < len; )\n (pad = self2._cipher.encryptBlock(self2._prev)),\n (bit = byteParam & (1 << (7 - i)) ? 128 : 0),\n (value = pad[0] ^ bit),\n (out += (value & 128) >> i % 8),\n (self2._prev = shiftIn(self2._prev, decrypt ? bit : value));\n return out;\n }\n function shiftIn(buffer, value) {\n var len = buffer.length,\n i = -1,\n out = Buffer2.allocUnsafe(buffer.length);\n for (buffer = Buffer2.concat([buffer, Buffer2.from([value])]); ++i < len; )\n out[i] = (buffer[i] << 1) | (buffer[i + 1] >> 7);\n return out;\n }\n exports.encrypt = function (self2, chunk, decrypt) {\n for (var len = chunk.length, out = Buffer2.allocUnsafe(len), i = -1; ++i < len; )\n out[i] = encryptByte(self2, chunk[i], decrypt);\n return out;\n };\n },\n});\n\n// node_modules/browserify-aes/modes/ofb.js\nvar require_ofb = __commonJS({\n \"node_modules/browserify-aes/modes/ofb.js\"(exports) {\n var xor = require_buffer_xor();\n function getBlock(self2) {\n return (self2._prev = self2._cipher.encryptBlock(self2._prev)), self2._prev;\n }\n exports.encrypt = function (self2, chunk) {\n for (; self2._cache.length < chunk.length; ) self2._cache = Buffer.concat([self2._cache, getBlock(self2)]);\n var pad = self2._cache.slice(0, chunk.length);\n return (self2._cache = self2._cache.slice(chunk.length)), xor(chunk, pad);\n };\n },\n});\n\n// node_modules/browserify-aes/incr32.js\nvar require_incr32 = __commonJS({\n \"node_modules/browserify-aes/incr32.js\"(exports, module) {\n function incr32(iv) {\n for (var len = iv.length, item; len--; )\n if (((item = iv.readUInt8(len)), item === 255)) iv.writeUInt8(0, len);\n else {\n item++, iv.writeUInt8(item, len);\n break;\n }\n }\n module.exports = incr32;\n },\n});\n\n// node_modules/browserify-aes/modes/ctr.js\nvar require_ctr = __commonJS({\n \"node_modules/browserify-aes/modes/ctr.js\"(exports) {\n var xor = require_buffer_xor(),\n Buffer2 = require_safe_buffer().Buffer,\n incr32 = require_incr32();\n function getBlock(self2) {\n var out = self2._cipher.encryptBlockRaw(self2._prev);\n return incr32(self2._prev), out;\n }\n var blockSize = 16;\n exports.encrypt = function (self2, chunk) {\n var chunkNum = Math.ceil(chunk.length / blockSize),\n start = self2._cache.length;\n self2._cache = Buffer2.concat([self2._cache, Buffer2.allocUnsafe(chunkNum * blockSize)]);\n for (var i = 0; i < chunkNum; i++) {\n var out = getBlock(self2),\n offset = start + i * blockSize;\n self2._cache.writeUInt32BE(out[0], offset + 0),\n self2._cache.writeUInt32BE(out[1], offset + 4),\n self2._cache.writeUInt32BE(out[2], offset + 8),\n self2._cache.writeUInt32BE(out[3], offset + 12);\n }\n var pad = self2._cache.slice(0, chunk.length);\n return (self2._cache = self2._cache.slice(chunk.length)), xor(chunk, pad);\n };\n },\n});\n\n// node_modules/browserify-aes/modes/list.json\nvar require_list = __commonJS({\n \"node_modules/browserify-aes/modes/list.json\"(exports, module) {\n module.exports = {\n \"aes-128-ecb\": {\n cipher: \"AES\",\n key: 128,\n iv: 0,\n mode: \"ECB\",\n type: \"block\",\n },\n \"aes-192-ecb\": {\n cipher: \"AES\",\n key: 192,\n iv: 0,\n mode: \"ECB\",\n type: \"block\",\n },\n \"aes-256-ecb\": {\n cipher: \"AES\",\n key: 256,\n iv: 0,\n mode: \"ECB\",\n type: \"block\",\n },\n \"aes-128-cbc\": {\n cipher: \"AES\",\n key: 128,\n iv: 16,\n mode: \"CBC\",\n type: \"block\",\n },\n \"aes-192-cbc\": {\n cipher: \"AES\",\n key: 192,\n iv: 16,\n mode: \"CBC\",\n type: \"block\",\n },\n \"aes-256-cbc\": {\n cipher: \"AES\",\n key: 256,\n iv: 16,\n mode: \"CBC\",\n type: \"block\",\n },\n aes128: {\n cipher: \"AES\",\n key: 128,\n iv: 16,\n mode: \"CBC\",\n type: \"block\",\n },\n aes192: {\n cipher: \"AES\",\n key: 192,\n iv: 16,\n mode: \"CBC\",\n type: \"block\",\n },\n aes256: {\n cipher: \"AES\",\n key: 256,\n iv: 16,\n mode: \"CBC\",\n type: \"block\",\n },\n \"aes-128-cfb\": {\n cipher: \"AES\",\n key: 128,\n iv: 16,\n mode: \"CFB\",\n type: \"stream\",\n },\n \"aes-192-cfb\": {\n cipher: \"AES\",\n key: 192,\n iv: 16,\n mode: \"CFB\",\n type: \"stream\",\n },\n \"aes-256-cfb\": {\n cipher: \"AES\",\n key: 256,\n iv: 16,\n mode: \"CFB\",\n type: \"stream\",\n },\n \"aes-128-cfb8\": {\n cipher: \"AES\",\n key: 128,\n iv: 16,\n mode: \"CFB8\",\n type: \"stream\",\n },\n \"aes-192-cfb8\": {\n cipher: \"AES\",\n key: 192,\n iv: 16,\n mode: \"CFB8\",\n type: \"stream\",\n },\n \"aes-256-cfb8\": {\n cipher: \"AES\",\n key: 256,\n iv: 16,\n mode: \"CFB8\",\n type: \"stream\",\n },\n \"aes-128-cfb1\": {\n cipher: \"AES\",\n key: 128,\n iv: 16,\n mode: \"CFB1\",\n type: \"stream\",\n },\n \"aes-192-cfb1\": {\n cipher: \"AES\",\n key: 192,\n iv: 16,\n mode: \"CFB1\",\n type: \"stream\",\n },\n \"aes-256-cfb1\": {\n cipher: \"AES\",\n key: 256,\n iv: 16,\n mode: \"CFB1\",\n type: \"stream\",\n },\n \"aes-128-ofb\": {\n cipher: \"AES\",\n key: 128,\n iv: 16,\n mode: \"OFB\",\n type: \"stream\",\n },\n \"aes-192-ofb\": {\n cipher: \"AES\",\n key: 192,\n iv: 16,\n mode: \"OFB\",\n type: \"stream\",\n },\n \"aes-256-ofb\": {\n cipher: \"AES\",\n key: 256,\n iv: 16,\n mode: \"OFB\",\n type: \"stream\",\n },\n \"aes-128-ctr\": {\n cipher: \"AES\",\n key: 128,\n iv: 16,\n mode: \"CTR\",\n type: \"stream\",\n },\n \"aes-192-ctr\": {\n cipher: \"AES\",\n key: 192,\n iv: 16,\n mode: \"CTR\",\n type: \"stream\",\n },\n \"aes-256-ctr\": {\n cipher: \"AES\",\n key: 256,\n iv: 16,\n mode: \"CTR\",\n type: \"stream\",\n },\n \"aes-128-gcm\": {\n cipher: \"AES\",\n key: 128,\n iv: 12,\n mode: \"GCM\",\n type: \"auth\",\n },\n \"aes-192-gcm\": {\n cipher: \"AES\",\n key: 192,\n iv: 12,\n mode: \"GCM\",\n type: \"auth\",\n },\n \"aes-256-gcm\": {\n cipher: \"AES\",\n key: 256,\n iv: 12,\n mode: \"GCM\",\n type: \"auth\",\n },\n };\n },\n});\n\n// node_modules/browserify-aes/modes/index.js\nvar require_modes = __commonJS({\n \"node_modules/browserify-aes/modes/index.js\"(exports, module) {\n var modeModules = {\n ECB: require_ecb(),\n CBC: require_cbc2(),\n CFB: require_cfb(),\n CFB8: require_cfb8(),\n CFB1: require_cfb1(),\n OFB: require_ofb(),\n CTR: require_ctr(),\n GCM: require_ctr(),\n },\n modes = require_list();\n for (key in modes) modes[key].module = modeModules[modes[key].mode];\n var key;\n module.exports = modes;\n },\n});\n\n// node_modules/browserify-aes/aes.js\nvar require_aes = __commonJS({\n \"node_modules/browserify-aes/aes.js\"(exports, module) {\n var Buffer2 = require_safe_buffer().Buffer;\n function asUInt32Array(buf) {\n Buffer2.isBuffer(buf) || (buf = Buffer2.from(buf));\n for (var len = (buf.length / 4) | 0, out = new Array(len), i = 0; i < len; i++) out[i] = buf.readUInt32BE(i * 4);\n return out;\n }\n function scrubVec(v) {\n for (var i = 0; i < v.length; v++) v[i] = 0;\n }\n function cryptBlock(M, keySchedule, SUB_MIX, SBOX, nRounds) {\n for (\n var SUB_MIX0 = SUB_MIX[0],\n SUB_MIX1 = SUB_MIX[1],\n SUB_MIX2 = SUB_MIX[2],\n SUB_MIX3 = SUB_MIX[3],\n s0 = M[0] ^ keySchedule[0],\n s1 = M[1] ^ keySchedule[1],\n s2 = M[2] ^ keySchedule[2],\n s3 = M[3] ^ keySchedule[3],\n t0,\n t1,\n t2,\n t3,\n ksRow = 4,\n round = 1;\n round < nRounds;\n round++\n )\n (t0 =\n SUB_MIX0[s0 >>> 24] ^\n SUB_MIX1[(s1 >>> 16) & 255] ^\n SUB_MIX2[(s2 >>> 8) & 255] ^\n SUB_MIX3[s3 & 255] ^\n keySchedule[ksRow++]),\n (t1 =\n SUB_MIX0[s1 >>> 24] ^\n SUB_MIX1[(s2 >>> 16) & 255] ^\n SUB_MIX2[(s3 >>> 8) & 255] ^\n SUB_MIX3[s0 & 255] ^\n keySchedule[ksRow++]),\n (t2 =\n SUB_MIX0[s2 >>> 24] ^\n SUB_MIX1[(s3 >>> 16) & 255] ^\n SUB_MIX2[(s0 >>> 8) & 255] ^\n SUB_MIX3[s1 & 255] ^\n keySchedule[ksRow++]),\n (t3 =\n SUB_MIX0[s3 >>> 24] ^\n SUB_MIX1[(s0 >>> 16) & 255] ^\n SUB_MIX2[(s1 >>> 8) & 255] ^\n SUB_MIX3[s2 & 255] ^\n keySchedule[ksRow++]),\n (s0 = t0),\n (s1 = t1),\n (s2 = t2),\n (s3 = t3);\n return (\n (t0 =\n ((SBOX[s0 >>> 24] << 24) | (SBOX[(s1 >>> 16) & 255] << 16) | (SBOX[(s2 >>> 8) & 255] << 8) | SBOX[s3 & 255]) ^\n keySchedule[ksRow++]),\n (t1 =\n ((SBOX[s1 >>> 24] << 24) | (SBOX[(s2 >>> 16) & 255] << 16) | (SBOX[(s3 >>> 8) & 255] << 8) | SBOX[s0 & 255]) ^\n keySchedule[ksRow++]),\n (t2 =\n ((SBOX[s2 >>> 24] << 24) | (SBOX[(s3 >>> 16) & 255] << 16) | (SBOX[(s0 >>> 8) & 255] << 8) | SBOX[s1 & 255]) ^\n keySchedule[ksRow++]),\n (t3 =\n ((SBOX[s3 >>> 24] << 24) | (SBOX[(s0 >>> 16) & 255] << 16) | (SBOX[(s1 >>> 8) & 255] << 8) | SBOX[s2 & 255]) ^\n keySchedule[ksRow++]),\n (t0 = t0 >>> 0),\n (t1 = t1 >>> 0),\n (t2 = t2 >>> 0),\n (t3 = t3 >>> 0),\n [t0, t1, t2, t3]\n );\n }\n var RCON = [0, 1, 2, 4, 8, 16, 32, 64, 128, 27, 54],\n G = (function () {\n for (var d = new Array(256), j = 0; j < 256; j++) j < 128 ? (d[j] = j << 1) : (d[j] = (j << 1) ^ 283);\n for (\n var SBOX = [],\n INV_SBOX = [],\n SUB_MIX = [[], [], [], []],\n INV_SUB_MIX = [[], [], [], []],\n x = 0,\n xi = 0,\n i = 0;\n i < 256;\n ++i\n ) {\n var sx = xi ^ (xi << 1) ^ (xi << 2) ^ (xi << 3) ^ (xi << 4);\n (sx = (sx >>> 8) ^ (sx & 255) ^ 99), (SBOX[x] = sx), (INV_SBOX[sx] = x);\n var x2 = d[x],\n x4 = d[x2],\n x8 = d[x4],\n t = (d[sx] * 257) ^ (sx * 16843008);\n (SUB_MIX[0][x] = (t << 24) | (t >>> 8)),\n (SUB_MIX[1][x] = (t << 16) | (t >>> 16)),\n (SUB_MIX[2][x] = (t << 8) | (t >>> 24)),\n (SUB_MIX[3][x] = t),\n (t = (x8 * 16843009) ^ (x4 * 65537) ^ (x2 * 257) ^ (x * 16843008)),\n (INV_SUB_MIX[0][sx] = (t << 24) | (t >>> 8)),\n (INV_SUB_MIX[1][sx] = (t << 16) | (t >>> 16)),\n (INV_SUB_MIX[2][sx] = (t << 8) | (t >>> 24)),\n (INV_SUB_MIX[3][sx] = t),\n x === 0 ? (x = xi = 1) : ((x = x2 ^ d[d[d[x8 ^ x2]]]), (xi ^= d[d[xi]]));\n }\n return {\n SBOX,\n INV_SBOX,\n SUB_MIX,\n INV_SUB_MIX,\n };\n })();\n function AES(key) {\n (this._key = asUInt32Array(key)), this._reset();\n }\n AES.blockSize = 4 * 4;\n AES.keySize = 256 / 8;\n AES.prototype.blockSize = AES.blockSize;\n AES.prototype.keySize = AES.keySize;\n AES.prototype._reset = function () {\n for (\n var keyWords = this._key,\n keySize = keyWords.length,\n nRounds = keySize + 6,\n ksRows = (nRounds + 1) * 4,\n keySchedule = [],\n k = 0;\n k < keySize;\n k++\n )\n keySchedule[k] = keyWords[k];\n for (k = keySize; k < ksRows; k++) {\n var t = keySchedule[k - 1];\n k % keySize === 0\n ? ((t = (t << 8) | (t >>> 24)),\n (t =\n (G.SBOX[t >>> 24] << 24) |\n (G.SBOX[(t >>> 16) & 255] << 16) |\n (G.SBOX[(t >>> 8) & 255] << 8) |\n G.SBOX[t & 255]),\n (t ^= RCON[(k / keySize) | 0] << 24))\n : keySize > 6 &&\n k % keySize === 4 &&\n (t =\n (G.SBOX[t >>> 24] << 24) |\n (G.SBOX[(t >>> 16) & 255] << 16) |\n (G.SBOX[(t >>> 8) & 255] << 8) |\n G.SBOX[t & 255]),\n (keySchedule[k] = keySchedule[k - keySize] ^ t);\n }\n for (var invKeySchedule = [], ik = 0; ik < ksRows; ik++) {\n var ksR = ksRows - ik,\n tt = keySchedule[ksR - (ik % 4 ? 0 : 4)];\n ik < 4 || ksR <= 4\n ? (invKeySchedule[ik] = tt)\n : (invKeySchedule[ik] =\n G.INV_SUB_MIX[0][G.SBOX[tt >>> 24]] ^\n G.INV_SUB_MIX[1][G.SBOX[(tt >>> 16) & 255]] ^\n G.INV_SUB_MIX[2][G.SBOX[(tt >>> 8) & 255]] ^\n G.INV_SUB_MIX[3][G.SBOX[tt & 255]]);\n }\n (this._nRounds = nRounds), (this._keySchedule = keySchedule), (this._invKeySchedule = invKeySchedule);\n };\n AES.prototype.encryptBlockRaw = function (M) {\n return (M = asUInt32Array(M)), cryptBlock(M, this._keySchedule, G.SUB_MIX, G.SBOX, this._nRounds);\n };\n AES.prototype.encryptBlock = function (M) {\n var out = this.encryptBlockRaw(M),\n buf = Buffer2.allocUnsafe(16);\n return (\n buf.writeUInt32BE(out[0], 0),\n buf.writeUInt32BE(out[1], 4),\n buf.writeUInt32BE(out[2], 8),\n buf.writeUInt32BE(out[3], 12),\n buf\n );\n };\n AES.prototype.decryptBlock = function (M) {\n M = asUInt32Array(M);\n var m1 = M[1];\n (M[1] = M[3]), (M[3] = m1);\n var out = cryptBlock(M, this._invKeySchedule, G.INV_SUB_MIX, G.INV_SBOX, this._nRounds),\n buf = Buffer2.allocUnsafe(16);\n return (\n buf.writeUInt32BE(out[0], 0),\n buf.writeUInt32BE(out[3], 4),\n buf.writeUInt32BE(out[2], 8),\n buf.writeUInt32BE(out[1], 12),\n buf\n );\n };\n AES.prototype.scrub = function () {\n scrubVec(this._keySchedule), scrubVec(this._invKeySchedule), scrubVec(this._key);\n };\n module.exports.AES = AES;\n },\n});\n\n// node_modules/browserify-aes/ghash.js\nvar require_ghash = __commonJS({\n \"node_modules/browserify-aes/ghash.js\"(exports, module) {\n var Buffer2 = require_safe_buffer().Buffer,\n ZEROES = Buffer2.alloc(16, 0);\n function toArray(buf) {\n return [buf.readUInt32BE(0), buf.readUInt32BE(4), buf.readUInt32BE(8), buf.readUInt32BE(12)];\n }\n function fromArray(out) {\n var buf = Buffer2.allocUnsafe(16);\n return (\n buf.writeUInt32BE(out[0] >>> 0, 0),\n buf.writeUInt32BE(out[1] >>> 0, 4),\n buf.writeUInt32BE(out[2] >>> 0, 8),\n buf.writeUInt32BE(out[3] >>> 0, 12),\n buf\n );\n }\n function GHASH(key) {\n (this.h = key), (this.state = Buffer2.alloc(16, 0)), (this.cache = Buffer2.allocUnsafe(0));\n }\n GHASH.prototype.ghash = function (block) {\n for (var i = -1; ++i < block.length; ) this.state[i] ^= block[i];\n this._multiply();\n };\n GHASH.prototype._multiply = function () {\n for (var Vi = toArray(this.h), Zi = [0, 0, 0, 0], j, xi, lsbVi, i = -1; ++i < 128; ) {\n for (\n xi = (this.state[~~(i / 8)] & (1 << (7 - (i % 8)))) !== 0,\n xi && ((Zi[0] ^= Vi[0]), (Zi[1] ^= Vi[1]), (Zi[2] ^= Vi[2]), (Zi[3] ^= Vi[3])),\n lsbVi = (Vi[3] & 1) !== 0,\n j = 3;\n j > 0;\n j--\n )\n Vi[j] = (Vi[j] >>> 1) | ((Vi[j - 1] & 1) << 31);\n (Vi[0] = Vi[0] >>> 1), lsbVi && (Vi[0] = Vi[0] ^ (225 << 24));\n }\n this.state = fromArray(Zi);\n };\n GHASH.prototype.update = function (buf) {\n this.cache = Buffer2.concat([this.cache, buf]);\n for (var chunk; this.cache.length >= 16; )\n (chunk = this.cache.slice(0, 16)), (this.cache = this.cache.slice(16)), this.ghash(chunk);\n };\n GHASH.prototype.final = function (abl, bl) {\n return (\n this.cache.length && this.ghash(Buffer2.concat([this.cache, ZEROES], 16)),\n this.ghash(fromArray([0, abl, 0, bl])),\n this.state\n );\n };\n module.exports = GHASH;\n },\n});\n\n// node_modules/browserify-aes/authCipher.js\nvar require_authCipher = __commonJS({\n \"node_modules/browserify-aes/authCipher.js\"(exports, module) {\n var aes = require_aes(),\n Buffer2 = require_safe_buffer().Buffer,\n Transform = require_cipher_base(),\n inherits = require_inherits_browser(),\n GHASH = require_ghash(),\n xor = require_buffer_xor(),\n incr32 = require_incr32();\n function xorTest(a, b) {\n var out = 0;\n a.length !== b.length && out++;\n for (var len = Math.min(a.length, b.length), i = 0; i < len; ++i) out += a[i] ^ b[i];\n return out;\n }\n function calcIv(self2, iv, ck) {\n if (iv.length === 12)\n return (\n (self2._finID = Buffer2.concat([iv, Buffer2.from([0, 0, 0, 1])])),\n Buffer2.concat([iv, Buffer2.from([0, 0, 0, 2])])\n );\n var ghash = new GHASH(ck),\n len = iv.length,\n toPad = len % 16;\n ghash.update(iv),\n toPad && ((toPad = 16 - toPad), ghash.update(Buffer2.alloc(toPad, 0))),\n ghash.update(Buffer2.alloc(8, 0));\n var ivBits = len * 8,\n tail = Buffer2.alloc(8);\n tail.writeUIntBE(ivBits, 0, 8), ghash.update(tail), (self2._finID = ghash.state);\n var out = Buffer2.from(self2._finID);\n return incr32(out), out;\n }\n function StreamCipher(mode, key, iv, decrypt) {\n Transform.call(this);\n var h = Buffer2.alloc(4, 0);\n this._cipher = new aes.AES(key);\n var ck = this._cipher.encryptBlock(h);\n (this._ghash = new GHASH(ck)),\n (iv = calcIv(this, iv, ck)),\n (this._prev = Buffer2.from(iv)),\n (this._cache = Buffer2.allocUnsafe(0)),\n (this._secCache = Buffer2.allocUnsafe(0)),\n (this._decrypt = decrypt),\n (this._alen = 0),\n (this._len = 0),\n (this._mode = mode),\n (this._authTag = null),\n (this._called = !1);\n }\n inherits(StreamCipher, Transform);\n StreamCipher.prototype._update = function (chunk) {\n if (!this._called && this._alen) {\n var rump = 16 - (this._alen % 16);\n rump < 16 && ((rump = Buffer2.alloc(rump, 0)), this._ghash.update(rump));\n }\n this._called = !0;\n var out = this._mode.encrypt(this, chunk);\n return this._decrypt ? this._ghash.update(chunk) : this._ghash.update(out), (this._len += chunk.length), out;\n };\n StreamCipher.prototype._final = function () {\n if (this._decrypt && !this._authTag) throw new Error(\"Unsupported state or unable to authenticate data\");\n var tag = xor(this._ghash.final(this._alen * 8, this._len * 8), this._cipher.encryptBlock(this._finID));\n if (this._decrypt && xorTest(tag, this._authTag))\n throw new Error(\"Unsupported state or unable to authenticate data\");\n (this._authTag = tag), this._cipher.scrub();\n };\n StreamCipher.prototype.getAuthTag = function () {\n if (this._decrypt || !Buffer2.isBuffer(this._authTag))\n throw new Error(\"Attempting to get auth tag in unsupported state\");\n return this._authTag;\n };\n StreamCipher.prototype.setAuthTag = function (tag) {\n if (!this._decrypt) throw new Error(\"Attempting to set auth tag in unsupported state\");\n this._authTag = tag;\n };\n StreamCipher.prototype.setAAD = function (buf) {\n if (this._called) throw new Error(\"Attempting to set AAD in unsupported state\");\n this._ghash.update(buf), (this._alen += buf.length);\n };\n module.exports = StreamCipher;\n },\n});\n\n// node_modules/browserify-aes/streamCipher.js\nvar require_streamCipher = __commonJS({\n \"node_modules/browserify-aes/streamCipher.js\"(exports, module) {\n var aes = require_aes(),\n Buffer2 = require_safe_buffer().Buffer,\n Transform = require_cipher_base(),\n inherits = require_inherits_browser();\n function StreamCipher(mode, key, iv, decrypt) {\n Transform.call(this),\n (this._cipher = new aes.AES(key)),\n (this._prev = Buffer2.from(iv)),\n (this._cache = Buffer2.allocUnsafe(0)),\n (this._secCache = Buffer2.allocUnsafe(0)),\n (this._decrypt = decrypt),\n (this._mode = mode);\n }\n inherits(StreamCipher, Transform);\n StreamCipher.prototype._update = function (chunk) {\n return this._mode.encrypt(this, chunk, this._decrypt);\n };\n StreamCipher.prototype._final = function () {\n this._cipher.scrub();\n };\n module.exports = StreamCipher;\n },\n});\n\n// node_modules/evp_bytestokey/index.js\nvar require_evp_bytestokey = __commonJS({\n \"node_modules/evp_bytestokey/index.js\"(exports, module) {\n var Buffer2 = require_safe_buffer().Buffer,\n MD5 = require_md5();\n function EVP_BytesToKey(password, salt, keyBits, ivLen) {\n if (\n (Buffer2.isBuffer(password) || (password = Buffer2.from(password, \"binary\")),\n salt && (Buffer2.isBuffer(salt) || (salt = Buffer2.from(salt, \"binary\")), salt.length !== 8))\n )\n throw new RangeError(\"salt should be Buffer with 8 byte length\");\n for (\n var keyLen = keyBits / 8, key = Buffer2.alloc(keyLen), iv = Buffer2.alloc(ivLen || 0), tmp = Buffer2.alloc(0);\n keyLen > 0 || ivLen > 0;\n\n ) {\n var hash = new MD5();\n hash.update(tmp), hash.update(password), salt && hash.update(salt), (tmp = hash.digest());\n var used = 0;\n if (keyLen > 0) {\n var keyStart = key.length - keyLen;\n (used = Math.min(keyLen, tmp.length)), tmp.copy(key, keyStart, 0, used), (keyLen -= used);\n }\n if (used < tmp.length && ivLen > 0) {\n var ivStart = iv.length - ivLen,\n length = Math.min(ivLen, tmp.length - used);\n tmp.copy(iv, ivStart, used, used + length), (ivLen -= length);\n }\n }\n return tmp.fill(0), { key, iv };\n }\n module.exports = EVP_BytesToKey;\n },\n});\n\n// node_modules/browserify-aes/encrypter.js\nvar require_encrypter = __commonJS({\n \"node_modules/browserify-aes/encrypter.js\"(exports) {\n var MODES = require_modes(),\n AuthCipher = require_authCipher(),\n Buffer2 = require_safe_buffer().Buffer,\n StreamCipher = require_streamCipher(),\n Transform = require_cipher_base(),\n aes = require_aes(),\n ebtk = require_evp_bytestokey(),\n inherits = require_inherits_browser();\n function Cipher(mode, key, iv) {\n Transform.call(this),\n (this._cache = new Splitter()),\n (this._cipher = new aes.AES(key)),\n (this._prev = Buffer2.from(iv)),\n (this._mode = mode),\n (this._autopadding = !0);\n }\n inherits(Cipher, Transform);\n Cipher.prototype._update = function (data) {\n this._cache.add(data);\n for (var chunk, thing, out = []; (chunk = this._cache.get()); )\n (thing = this._mode.encrypt(this, chunk)), out.push(thing);\n return Buffer2.concat(out);\n };\n var PADDING = Buffer2.alloc(16, 16);\n Cipher.prototype._final = function () {\n var chunk = this._cache.flush();\n if (this._autopadding) return (chunk = this._mode.encrypt(this, chunk)), this._cipher.scrub(), chunk;\n if (!chunk.equals(PADDING)) throw (this._cipher.scrub(), new Error(\"data not multiple of block length\"));\n };\n Cipher.prototype.setAutoPadding = function (setTo) {\n return (this._autopadding = !!setTo), this;\n };\n function Splitter() {\n this.cache = Buffer2.allocUnsafe(0);\n }\n Splitter.prototype.add = function (data) {\n this.cache = Buffer2.concat([this.cache, data]);\n };\n Splitter.prototype.get = function () {\n if (this.cache.length > 15) {\n var out = this.cache.slice(0, 16);\n return (this.cache = this.cache.slice(16)), out;\n }\n return null;\n };\n Splitter.prototype.flush = function () {\n for (var len = 16 - this.cache.length, padBuff = Buffer2.allocUnsafe(len), i = -1; ++i < len; )\n padBuff.writeUInt8(len, i);\n return Buffer2.concat([this.cache, padBuff]);\n };\n function createCipheriv(suite, password, iv) {\n var config = MODES[suite.toLowerCase()];\n if (!config) throw new TypeError(\"invalid suite type\");\n if ((typeof password == \"string\" && (password = Buffer2.from(password)), password.length !== config.key / 8))\n throw new TypeError(\"invalid key length \" + password.length);\n if ((typeof iv == \"string\" && (iv = Buffer2.from(iv)), config.mode !== \"GCM\" && iv.length !== config.iv))\n throw new TypeError(\"invalid iv length \" + iv.length);\n return config.type === \"stream\"\n ? new StreamCipher(config.module, password, iv)\n : config.type === \"auth\"\n ? new AuthCipher(config.module, password, iv)\n : new Cipher(config.module, password, iv);\n }\n function createCipher(suite, password) {\n var config = MODES[suite.toLowerCase()];\n if (!config) throw new TypeError(\"invalid suite type\");\n var keys = ebtk(password, !1, config.key, config.iv);\n return createCipheriv(suite, keys.key, keys.iv);\n }\n exports.createCipheriv = createCipheriv;\n exports.createCipher = createCipher;\n },\n});\n\n// node_modules/browserify-aes/decrypter.js\nvar require_decrypter = __commonJS({\n \"node_modules/browserify-aes/decrypter.js\"(exports) {\n var AuthCipher = require_authCipher(),\n Buffer2 = require_safe_buffer().Buffer,\n MODES = require_modes(),\n StreamCipher = require_streamCipher(),\n Transform = require_cipher_base(),\n aes = require_aes(),\n ebtk = require_evp_bytestokey(),\n inherits = require_inherits_browser();\n function Decipher(mode, key, iv) {\n Transform.call(this),\n (this._cache = new Splitter()),\n (this._last = void 0),\n (this._cipher = new aes.AES(key)),\n (this._prev = Buffer2.from(iv)),\n (this._mode = mode),\n (this._autopadding = !0);\n }\n inherits(Decipher, Transform);\n Decipher.prototype._update = function (data) {\n this._cache.add(data);\n for (var chunk, thing, out = []; (chunk = this._cache.get(this._autopadding)); )\n (thing = this._mode.decrypt(this, chunk)), out.push(thing);\n return Buffer2.concat(out);\n };\n Decipher.prototype._final = function () {\n var chunk = this._cache.flush();\n if (this._autopadding) return unpad(this._mode.decrypt(this, chunk));\n if (chunk) throw new Error(\"data not multiple of block length\");\n };\n Decipher.prototype.setAutoPadding = function (setTo) {\n return (this._autopadding = !!setTo), this;\n };\n function Splitter() {\n this.cache = Buffer2.allocUnsafe(0);\n }\n Splitter.prototype.add = function (data) {\n this.cache = Buffer2.concat([this.cache, data]);\n };\n Splitter.prototype.get = function (autoPadding) {\n var out;\n if (autoPadding) {\n if (this.cache.length > 16) return (out = this.cache.slice(0, 16)), (this.cache = this.cache.slice(16)), out;\n } else if (this.cache.length >= 16)\n return (out = this.cache.slice(0, 16)), (this.cache = this.cache.slice(16)), out;\n return null;\n };\n Splitter.prototype.flush = function () {\n if (this.cache.length) return this.cache;\n };\n function unpad(last) {\n var padded = last[15];\n if (padded < 1 || padded > 16) throw new Error(\"unable to decrypt data\");\n for (var i = -1; ++i < padded; )\n if (last[i + (16 - padded)] !== padded) throw new Error(\"unable to decrypt data\");\n if (padded !== 16) return last.slice(0, 16 - padded);\n }\n function createDecipheriv(suite, password, iv) {\n var config = MODES[suite.toLowerCase()];\n if (!config) throw new TypeError(\"invalid suite type\");\n if ((typeof iv == \"string\" && (iv = Buffer2.from(iv)), config.mode !== \"GCM\" && iv.length !== config.iv))\n throw new TypeError(\"invalid iv length \" + iv.length);\n if ((typeof password == \"string\" && (password = Buffer2.from(password)), password.length !== config.key / 8))\n throw new TypeError(\"invalid key length \" + password.length);\n return config.type === \"stream\"\n ? new StreamCipher(config.module, password, iv, !0)\n : config.type === \"auth\"\n ? new AuthCipher(config.module, password, iv, !0)\n : new Decipher(config.module, password, iv);\n }\n function createDecipher(suite, password) {\n var config = MODES[suite.toLowerCase()];\n if (!config) throw new TypeError(\"invalid suite type\");\n var keys = ebtk(password, !1, config.key, config.iv);\n return createDecipheriv(suite, keys.key, keys.iv);\n }\n exports.createDecipher = createDecipher;\n exports.createDecipheriv = createDecipheriv;\n },\n});\n\n// node_modules/browserify-aes/browser.js\nvar require_browser5 = __commonJS({\n \"node_modules/browserify-aes/browser.js\"(exports) {\n var ciphers = require_encrypter(),\n deciphers = require_decrypter(),\n modes = require_list();\n function getCiphers() {\n return Object.keys(modes);\n }\n exports.createCipher = exports.Cipher = ciphers.createCipher;\n exports.createCipheriv = exports.Cipheriv = ciphers.createCipheriv;\n exports.createDecipher = exports.Decipher = deciphers.createDecipher;\n exports.createDecipheriv = exports.Decipheriv = deciphers.createDecipheriv;\n exports.listCiphers = exports.getCiphers = getCiphers;\n },\n});\n\n// node_modules/browserify-des/modes.js\nvar require_modes2 = __commonJS({\n \"node_modules/browserify-des/modes.js\"(exports) {\n exports[\"des-ecb\"] = {\n key: 8,\n iv: 0,\n };\n exports[\"des-cbc\"] = exports.des = {\n key: 8,\n iv: 8,\n };\n exports[\"des-ede3-cbc\"] = exports.des3 = {\n key: 24,\n iv: 8,\n };\n exports[\"des-ede3\"] = {\n key: 24,\n iv: 0,\n };\n exports[\"des-ede-cbc\"] = {\n key: 16,\n iv: 8,\n };\n exports[\"des-ede\"] = {\n key: 16,\n iv: 0,\n };\n },\n});\n\n// node_modules/browserify-cipher/browser.js\nvar require_browser6 = __commonJS({\n \"node_modules/browserify-cipher/browser.js\"(exports) {\n var DES = require_browserify_des(),\n aes = require_browser5(),\n aesModes = require_modes(),\n desModes = require_modes2(),\n ebtk = require_evp_bytestokey();\n function createCipher(suite, password) {\n suite = suite.toLowerCase();\n var keyLen, ivLen;\n if (aesModes[suite]) (keyLen = aesModes[suite].key), (ivLen = aesModes[suite].iv);\n else if (desModes[suite]) (keyLen = desModes[suite].key * 8), (ivLen = desModes[suite].iv);\n else throw new TypeError(\"invalid suite type\");\n var keys = ebtk(password, !1, keyLen, ivLen);\n return createCipheriv(suite, keys.key, keys.iv);\n }\n function createDecipher(suite, password) {\n suite = suite.toLowerCase();\n var keyLen, ivLen;\n if (aesModes[suite]) (keyLen = aesModes[suite].key), (ivLen = aesModes[suite].iv);\n else if (desModes[suite]) (keyLen = desModes[suite].key * 8), (ivLen = desModes[suite].iv);\n else throw new TypeError(\"invalid suite type\");\n var keys = ebtk(password, !1, keyLen, ivLen);\n return createDecipheriv(suite, keys.key, keys.iv);\n }\n function createCipheriv(suite, key, iv) {\n if (((suite = suite.toLowerCase()), aesModes[suite])) return aes.createCipheriv(suite, key, iv);\n if (desModes[suite]) return new DES({ key, iv, mode: suite });\n throw new TypeError(\"invalid suite type\");\n }\n function createDecipheriv(suite, key, iv) {\n if (((suite = suite.toLowerCase()), aesModes[suite])) return aes.createDecipheriv(suite, key, iv);\n if (desModes[suite]) return new DES({ key, iv, mode: suite, decrypt: !0 });\n throw new TypeError(\"invalid suite type\");\n }\n function getCiphers() {\n return Object.keys(desModes).concat(aes.getCiphers());\n }\n exports.createCipher = exports.Cipher = createCipher;\n exports.createCipheriv = exports.Cipheriv = createCipheriv;\n exports.createDecipher = exports.Decipher = createDecipher;\n exports.createDecipheriv = exports.Decipheriv = createDecipheriv;\n exports.listCiphers = exports.getCiphers = getCiphers;\n },\n});\n\n// node_modules/diffie-hellman/node_modules/bn.js/lib/bn.js\nvar require_bn = __commonJS({\n \"node_modules/diffie-hellman/node_modules/bn.js/lib/bn.js\"(exports, module) {\n (function (module2, exports2) {\n \"use strict\";\n function assert(val, msg) {\n if (!val) throw new Error(msg || \"Assertion failed\");\n }\n function inherits(ctor, superCtor) {\n ctor.super_ = superCtor;\n var TempCtor = function () {};\n (TempCtor.prototype = superCtor.prototype),\n (ctor.prototype = new TempCtor()),\n (ctor.prototype.constructor = ctor);\n }\n function BN(number, base, endian) {\n if (BN.isBN(number)) return number;\n (this.negative = 0),\n (this.words = null),\n (this.length = 0),\n (this.red = null),\n number !== null &&\n ((base === \"le\" || base === \"be\") && ((endian = base), (base = 10)),\n this._init(number || 0, base || 10, endian || \"be\"));\n }\n typeof module2 == \"object\" ? (module2.exports = BN) : (exports2.BN = BN), (BN.BN = BN), (BN.wordSize = 26);\n var Buffer2;\n try {\n typeof window < \"u\" && typeof window.Buffer < \"u\"\n ? (Buffer2 = window.Buffer)\n : (Buffer2 = __require(\"buffer\").Buffer);\n } catch {}\n (BN.isBN = function (num) {\n return num instanceof BN\n ? !0\n : num !== null &&\n typeof num == \"object\" &&\n num.constructor.wordSize === BN.wordSize &&\n Array.isArray(num.words);\n }),\n (BN.max = function (left, right) {\n return left.cmp(right) > 0 ? left : right;\n }),\n (BN.min = function (left, right) {\n return left.cmp(right) < 0 ? left : right;\n }),\n (BN.prototype._init = function (number, base, endian) {\n if (typeof number == \"number\") return this._initNumber(number, base, endian);\n if (typeof number == \"object\") return this._initArray(number, base, endian);\n base === \"hex\" && (base = 16),\n assert(base === (base | 0) && base >= 2 && base <= 36),\n (number = number.toString().replace(/\\s+/g, \"\"));\n var start = 0;\n number[0] === \"-\" && (start++, (this.negative = 1)),\n start < number.length &&\n (base === 16\n ? this._parseHex(number, start, endian)\n : (this._parseBase(number, base, start),\n endian === \"le\" && this._initArray(this.toArray(), base, endian)));\n }),\n (BN.prototype._initNumber = function (number, base, endian) {\n number < 0 && ((this.negative = 1), (number = -number)),\n number < 67108864\n ? ((this.words = [number & 67108863]), (this.length = 1))\n : number < 4503599627370496\n ? ((this.words = [number & 67108863, (number / 67108864) & 67108863]), (this.length = 2))\n : (assert(number < 9007199254740992),\n (this.words = [number & 67108863, (number / 67108864) & 67108863, 1]),\n (this.length = 3)),\n endian === \"le\" && this._initArray(this.toArray(), base, endian);\n }),\n (BN.prototype._initArray = function (number, base, endian) {\n if ((assert(typeof number.length == \"number\"), number.length <= 0))\n return (this.words = [0]), (this.length = 1), this;\n (this.length = Math.ceil(number.length / 3)), (this.words = new Array(this.length));\n for (var i = 0; i < this.length; i++) this.words[i] = 0;\n var j,\n w,\n off = 0;\n if (endian === \"be\")\n for (i = number.length - 1, j = 0; i >= 0; i -= 3)\n (w = number[i] | (number[i - 1] << 8) | (number[i - 2] << 16)),\n (this.words[j] |= (w << off) & 67108863),\n (this.words[j + 1] = (w >>> (26 - off)) & 67108863),\n (off += 24),\n off >= 26 && ((off -= 26), j++);\n else if (endian === \"le\")\n for (i = 0, j = 0; i < number.length; i += 3)\n (w = number[i] | (number[i + 1] << 8) | (number[i + 2] << 16)),\n (this.words[j] |= (w << off) & 67108863),\n (this.words[j + 1] = (w >>> (26 - off)) & 67108863),\n (off += 24),\n off >= 26 && ((off -= 26), j++);\n return this.strip();\n });\n function parseHex4Bits(string, index) {\n var c = string.charCodeAt(index);\n return c >= 65 && c <= 70 ? c - 55 : c >= 97 && c <= 102 ? c - 87 : (c - 48) & 15;\n }\n function parseHexByte(string, lowerBound, index) {\n var r = parseHex4Bits(string, index);\n return index - 1 >= lowerBound && (r |= parseHex4Bits(string, index - 1) << 4), r;\n }\n BN.prototype._parseHex = function (number, start, endian) {\n (this.length = Math.ceil((number.length - start) / 6)), (this.words = new Array(this.length));\n for (var i = 0; i < this.length; i++) this.words[i] = 0;\n var off = 0,\n j = 0,\n w;\n if (endian === \"be\")\n for (i = number.length - 1; i >= start; i -= 2)\n (w = parseHexByte(number, start, i) << off),\n (this.words[j] |= w & 67108863),\n off >= 18 ? ((off -= 18), (j += 1), (this.words[j] |= w >>> 26)) : (off += 8);\n else {\n var parseLength = number.length - start;\n for (i = parseLength % 2 === 0 ? start + 1 : start; i < number.length; i += 2)\n (w = parseHexByte(number, start, i) << off),\n (this.words[j] |= w & 67108863),\n off >= 18 ? ((off -= 18), (j += 1), (this.words[j] |= w >>> 26)) : (off += 8);\n }\n this.strip();\n };\n function parseBase(str, start, end, mul) {\n for (var r = 0, len = Math.min(str.length, end), i = start; i < len; i++) {\n var c = str.charCodeAt(i) - 48;\n (r *= mul), c >= 49 ? (r += c - 49 + 10) : c >= 17 ? (r += c - 17 + 10) : (r += c);\n }\n return r;\n }\n (BN.prototype._parseBase = function (number, base, start) {\n (this.words = [0]), (this.length = 1);\n for (var limbLen = 0, limbPow = 1; limbPow <= 67108863; limbPow *= base) limbLen++;\n limbLen--, (limbPow = (limbPow / base) | 0);\n for (\n var total = number.length - start,\n mod = total % limbLen,\n end = Math.min(total, total - mod) + start,\n word = 0,\n i = start;\n i < end;\n i += limbLen\n )\n (word = parseBase(number, i, i + limbLen, base)),\n this.imuln(limbPow),\n this.words[0] + word < 67108864 ? (this.words[0] += word) : this._iaddn(word);\n if (mod !== 0) {\n var pow = 1;\n for (word = parseBase(number, i, number.length, base), i = 0; i < mod; i++) pow *= base;\n this.imuln(pow), this.words[0] + word < 67108864 ? (this.words[0] += word) : this._iaddn(word);\n }\n this.strip();\n }),\n (BN.prototype.copy = function (dest) {\n dest.words = new Array(this.length);\n for (var i = 0; i < this.length; i++) dest.words[i] = this.words[i];\n (dest.length = this.length), (dest.negative = this.negative), (dest.red = this.red);\n }),\n (BN.prototype.clone = function () {\n var r = new BN(null);\n return this.copy(r), r;\n }),\n (BN.prototype._expand = function (size) {\n for (; this.length < size; ) this.words[this.length++] = 0;\n return this;\n }),\n (BN.prototype.strip = function () {\n for (; this.length > 1 && this.words[this.length - 1] === 0; ) this.length--;\n return this._normSign();\n }),\n (BN.prototype._normSign = function () {\n return this.length === 1 && this.words[0] === 0 && (this.negative = 0), this;\n }),\n (BN.prototype.inspect = function () {\n return (this.red ? \"<BN-R: \" : \"<BN: \") + this.toString(16) + \">\";\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 groupSizes = [\n 0, 0, 25, 16, 12, 11, 10, 9, 8, 8, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5,\n 5, 5,\n ],\n groupBases = [\n 0, 0, 33554432, 43046721, 16777216, 48828125, 60466176, 40353607, 16777216, 43046721, 1e7, 19487171, 35831808,\n 62748517, 7529536, 11390625, 16777216, 24137569, 34012224, 47045881, 64e6, 4084101, 5153632, 6436343, 7962624,\n 9765625, 11881376, 14348907, 17210368, 20511149, 243e5, 28629151, 33554432, 39135393, 45435424, 52521875,\n 60466176,\n ];\n (BN.prototype.toString = function (base, padding) {\n (base = base || 10), (padding = padding | 0 || 1);\n var out;\n if (base === 16 || base === \"hex\") {\n out = \"\";\n for (var off = 0, carry = 0, i = 0; i < this.length; i++) {\n var w = this.words[i],\n word = (((w << off) | carry) & 16777215).toString(16);\n (carry = (w >>> (24 - off)) & 16777215),\n carry !== 0 || i !== this.length - 1 ? (out = zeros[6 - word.length] + word + out) : (out = word + out),\n (off += 2),\n off >= 26 && ((off -= 26), i--);\n }\n for (carry !== 0 && (out = carry.toString(16) + out); out.length % padding !== 0; ) out = \"0\" + out;\n return this.negative !== 0 && (out = \"-\" + out), out;\n }\n if (base === (base | 0) && base >= 2 && base <= 36) {\n var groupSize = groupSizes[base],\n groupBase = groupBases[base];\n out = \"\";\n var c = this.clone();\n for (c.negative = 0; !c.isZero(); ) {\n var r = c.modn(groupBase).toString(base);\n (c = c.idivn(groupBase)), c.isZero() ? (out = r + out) : (out = zeros[groupSize - r.length] + r + out);\n }\n for (this.isZero() && (out = \"0\" + out); out.length % padding !== 0; ) out = \"0\" + out;\n return this.negative !== 0 && (out = \"-\" + out), out;\n }\n assert(!1, \"Base should be between 2 and 36\");\n }),\n (BN.prototype.toNumber = function () {\n var ret = this.words[0];\n return (\n this.length === 2\n ? (ret += this.words[1] * 67108864)\n : this.length === 3 && this.words[2] === 1\n ? (ret += 4503599627370496 + this.words[1] * 67108864)\n : this.length > 2 && assert(!1, \"Number can only safely store up to 53 bits\"),\n this.negative !== 0 ? -ret : ret\n );\n }),\n (BN.prototype.toJSON = function () {\n return this.toString(16);\n }),\n (BN.prototype.toBuffer = function (endian, length) {\n return assert(typeof Buffer2 < \"u\"), this.toArrayLike(Buffer2, endian, length);\n }),\n (BN.prototype.toArray = function (endian, length) {\n return this.toArrayLike(Array, endian, length);\n }),\n (BN.prototype.toArrayLike = function (ArrayType, endian, length) {\n var byteLength = this.byteLength(),\n 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 this.strip();\n var littleEndian = endian === \"le\",\n res = new ArrayType(reqLength),\n b,\n i,\n q = this.clone();\n if (littleEndian) {\n for (i = 0; !q.isZero(); i++) (b = q.andln(255)), q.iushrn(8), (res[i] = b);\n for (; i < reqLength; i++) res[i] = 0;\n } else {\n for (i = 0; i < reqLength - byteLength; i++) res[i] = 0;\n for (i = 0; !q.isZero(); i++) (b = q.andln(255)), q.iushrn(8), (res[reqLength - i - 1] = b);\n }\n return res;\n }),\n Math.clz32\n ? (BN.prototype._countBits = function (w) {\n return 32 - Math.clz32(w);\n })\n : (BN.prototype._countBits = function (w) {\n var t = w,\n r = 0;\n return (\n t >= 4096 && ((r += 13), (t >>>= 13)),\n t >= 64 && ((r += 7), (t >>>= 7)),\n t >= 8 && ((r += 4), (t >>>= 4)),\n t >= 2 && ((r += 2), (t >>>= 2)),\n r + t\n );\n }),\n (BN.prototype._zeroBits = function (w) {\n if (w === 0) return 26;\n var t = w,\n r = 0;\n return (\n (t & 8191) === 0 && ((r += 13), (t >>>= 13)),\n (t & 127) === 0 && ((r += 7), (t >>>= 7)),\n (t & 15) === 0 && ((r += 4), (t >>>= 4)),\n (t & 3) === 0 && ((r += 2), (t >>>= 2)),\n (t & 1) === 0 && r++,\n r\n );\n }),\n (BN.prototype.bitLength = function () {\n var w = this.words[this.length - 1],\n hi = this._countBits(w);\n return (this.length - 1) * 26 + hi;\n });\n function toBitArray(num) {\n for (var w = new Array(num.bitLength()), bit = 0; bit < w.length; bit++) {\n var off = (bit / 26) | 0,\n wbit = bit % 26;\n w[bit] = (num.words[off] & (1 << wbit)) >>> wbit;\n }\n return w;\n }\n (BN.prototype.zeroBits = function () {\n if (this.isZero()) return 0;\n for (var r = 0, i = 0; i < this.length; i++) {\n var b = this._zeroBits(this.words[i]);\n if (((r += b), b !== 26)) break;\n }\n return r;\n }),\n (BN.prototype.byteLength = function () {\n return Math.ceil(this.bitLength() / 8);\n }),\n (BN.prototype.toTwos = function (width) {\n return this.negative !== 0 ? this.abs().inotn(width).iaddn(1) : this.clone();\n }),\n (BN.prototype.fromTwos = function (width) {\n return this.testn(width - 1) ? this.notn(width).iaddn(1).ineg() : this.clone();\n }),\n (BN.prototype.isNeg = function () {\n return this.negative !== 0;\n }),\n (BN.prototype.neg = function () {\n return this.clone().ineg();\n }),\n (BN.prototype.ineg = function () {\n return this.isZero() || (this.negative ^= 1), this;\n }),\n (BN.prototype.iuor = function (num) {\n for (; this.length < num.length; ) this.words[this.length++] = 0;\n for (var i = 0; i < num.length; i++) this.words[i] = this.words[i] | num.words[i];\n return this.strip();\n }),\n (BN.prototype.ior = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuor(num);\n }),\n (BN.prototype.or = function (num) {\n return this.length > num.length ? this.clone().ior(num) : num.clone().ior(this);\n }),\n (BN.prototype.uor = function (num) {\n return this.length > num.length ? this.clone().iuor(num) : num.clone().iuor(this);\n }),\n (BN.prototype.iuand = function (num) {\n var b;\n this.length > num.length ? (b = num) : (b = this);\n for (var i = 0; i < b.length; i++) this.words[i] = this.words[i] & num.words[i];\n return (this.length = b.length), this.strip();\n }),\n (BN.prototype.iand = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuand(num);\n }),\n (BN.prototype.and = function (num) {\n return this.length > num.length ? this.clone().iand(num) : num.clone().iand(this);\n }),\n (BN.prototype.uand = function (num) {\n return this.length > num.length ? this.clone().iuand(num) : num.clone().iuand(this);\n }),\n (BN.prototype.iuxor = function (num) {\n var a, b;\n this.length > num.length ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var i = 0; i < b.length; i++) this.words[i] = a.words[i] ^ b.words[i];\n if (this !== a) for (; i < a.length; i++) this.words[i] = a.words[i];\n return (this.length = a.length), this.strip();\n }),\n (BN.prototype.ixor = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuxor(num);\n }),\n (BN.prototype.xor = function (num) {\n return this.length > num.length ? this.clone().ixor(num) : num.clone().ixor(this);\n }),\n (BN.prototype.uxor = function (num) {\n return this.length > num.length ? this.clone().iuxor(num) : num.clone().iuxor(this);\n }),\n (BN.prototype.inotn = function (width) {\n assert(typeof width == \"number\" && width >= 0);\n var bytesNeeded = Math.ceil(width / 26) | 0,\n bitsLeft = width % 26;\n this._expand(bytesNeeded), bitsLeft > 0 && bytesNeeded--;\n for (var i = 0; i < bytesNeeded; i++) this.words[i] = ~this.words[i] & 67108863;\n return bitsLeft > 0 && (this.words[i] = ~this.words[i] & (67108863 >> (26 - bitsLeft))), this.strip();\n }),\n (BN.prototype.notn = function (width) {\n return this.clone().inotn(width);\n }),\n (BN.prototype.setn = function (bit, val) {\n assert(typeof bit == \"number\" && bit >= 0);\n var off = (bit / 26) | 0,\n wbit = bit % 26;\n return (\n this._expand(off + 1),\n val\n ? (this.words[off] = this.words[off] | (1 << wbit))\n : (this.words[off] = this.words[off] & ~(1 << wbit)),\n this.strip()\n );\n }),\n (BN.prototype.iadd = function (num) {\n var r;\n if (this.negative !== 0 && num.negative === 0)\n return (this.negative = 0), (r = this.isub(num)), (this.negative ^= 1), this._normSign();\n if (this.negative === 0 && num.negative !== 0)\n return (num.negative = 0), (r = this.isub(num)), (num.negative = 1), r._normSign();\n var a, b;\n this.length > num.length ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var carry = 0, i = 0; i < b.length; i++)\n (r = (a.words[i] | 0) + (b.words[i] | 0) + carry), (this.words[i] = r & 67108863), (carry = r >>> 26);\n for (; carry !== 0 && i < a.length; i++)\n (r = (a.words[i] | 0) + carry), (this.words[i] = r & 67108863), (carry = r >>> 26);\n if (((this.length = a.length), carry !== 0)) (this.words[this.length] = carry), this.length++;\n else if (a !== this) for (; i < a.length; i++) this.words[i] = a.words[i];\n return this;\n }),\n (BN.prototype.add = function (num) {\n var res;\n return num.negative !== 0 && this.negative === 0\n ? ((num.negative = 0), (res = this.sub(num)), (num.negative ^= 1), res)\n : num.negative === 0 && this.negative !== 0\n ? ((this.negative = 0), (res = num.sub(this)), (this.negative = 1), res)\n : this.length > num.length\n ? this.clone().iadd(num)\n : num.clone().iadd(this);\n }),\n (BN.prototype.isub = function (num) {\n if (num.negative !== 0) {\n num.negative = 0;\n var r = this.iadd(num);\n return (num.negative = 1), r._normSign();\n } else if (this.negative !== 0)\n return (this.negative = 0), this.iadd(num), (this.negative = 1), this._normSign();\n var cmp = this.cmp(num);\n if (cmp === 0) return (this.negative = 0), (this.length = 1), (this.words[0] = 0), this;\n var a, b;\n cmp > 0 ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var carry = 0, i = 0; i < b.length; i++)\n (r = (a.words[i] | 0) - (b.words[i] | 0) + carry), (carry = r >> 26), (this.words[i] = r & 67108863);\n for (; carry !== 0 && i < a.length; i++)\n (r = (a.words[i] | 0) + carry), (carry = r >> 26), (this.words[i] = r & 67108863);\n if (carry === 0 && i < a.length && a !== this) for (; i < a.length; i++) this.words[i] = a.words[i];\n return (this.length = Math.max(this.length, i)), a !== this && (this.negative = 1), this.strip();\n }),\n (BN.prototype.sub = function (num) {\n return this.clone().isub(num);\n });\n function smallMulTo(self2, num, out) {\n out.negative = num.negative ^ self2.negative;\n var len = (self2.length + num.length) | 0;\n (out.length = len), (len = (len - 1) | 0);\n var a = self2.words[0] | 0,\n b = num.words[0] | 0,\n r = a * b,\n lo = r & 67108863,\n carry = (r / 67108864) | 0;\n out.words[0] = lo;\n for (var k = 1; k < len; k++) {\n for (\n var ncarry = carry >>> 26,\n rword = carry & 67108863,\n maxJ = Math.min(k, num.length - 1),\n j = Math.max(0, k - self2.length + 1);\n j <= maxJ;\n j++\n ) {\n var i = (k - j) | 0;\n (a = self2.words[i] | 0),\n (b = num.words[j] | 0),\n (r = a * b + rword),\n (ncarry += (r / 67108864) | 0),\n (rword = r & 67108863);\n }\n (out.words[k] = rword | 0), (carry = ncarry | 0);\n }\n return carry !== 0 ? (out.words[k] = carry | 0) : out.length--, out.strip();\n }\n var comb10MulTo = function (self2, num, out) {\n var a = self2.words,\n b = num.words,\n o = out.words,\n c = 0,\n lo,\n mid,\n hi,\n a0 = a[0] | 0,\n al0 = a0 & 8191,\n ah0 = a0 >>> 13,\n a1 = a[1] | 0,\n al1 = a1 & 8191,\n ah1 = a1 >>> 13,\n a2 = a[2] | 0,\n al2 = a2 & 8191,\n ah2 = a2 >>> 13,\n a3 = a[3] | 0,\n al3 = a3 & 8191,\n ah3 = a3 >>> 13,\n a4 = a[4] | 0,\n al4 = a4 & 8191,\n ah4 = a4 >>> 13,\n a5 = a[5] | 0,\n al5 = a5 & 8191,\n ah5 = a5 >>> 13,\n a6 = a[6] | 0,\n al6 = a6 & 8191,\n ah6 = a6 >>> 13,\n a7 = a[7] | 0,\n al7 = a7 & 8191,\n ah7 = a7 >>> 13,\n a8 = a[8] | 0,\n al8 = a8 & 8191,\n ah8 = a8 >>> 13,\n a9 = a[9] | 0,\n al9 = a9 & 8191,\n ah9 = a9 >>> 13,\n b0 = b[0] | 0,\n bl0 = b0 & 8191,\n bh0 = b0 >>> 13,\n b1 = b[1] | 0,\n bl1 = b1 & 8191,\n bh1 = b1 >>> 13,\n b2 = b[2] | 0,\n bl2 = b2 & 8191,\n bh2 = b2 >>> 13,\n b3 = b[3] | 0,\n bl3 = b3 & 8191,\n bh3 = b3 >>> 13,\n b4 = b[4] | 0,\n bl4 = b4 & 8191,\n bh4 = b4 >>> 13,\n b5 = b[5] | 0,\n bl5 = b5 & 8191,\n bh5 = b5 >>> 13,\n b6 = b[6] | 0,\n bl6 = b6 & 8191,\n bh6 = b6 >>> 13,\n b7 = b[7] | 0,\n bl7 = b7 & 8191,\n bh7 = b7 >>> 13,\n b8 = b[8] | 0,\n bl8 = b8 & 8191,\n bh8 = b8 >>> 13,\n b9 = b[9] | 0,\n bl9 = b9 & 8191,\n bh9 = b9 >>> 13;\n (out.negative = self2.negative ^ num.negative),\n (out.length = 19),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w0 >>> 26)) | 0),\n (w0 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w1 >>> 26)) | 0),\n (w1 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w2 >>> 26)) | 0),\n (w2 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w3 >>> 26)) | 0),\n (w3 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w4 >>> 26)) | 0),\n (w4 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w5 >>> 26)) | 0),\n (w5 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w6 >>> 26)) | 0),\n (w6 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w7 >>> 26)) | 0),\n (w7 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w8 >>> 26)) | 0),\n (w8 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w9 >>> 26)) | 0),\n (w9 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w10 >>> 26)) | 0),\n (w10 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w11 >>> 26)) | 0),\n (w11 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w12 >>> 26)) | 0),\n (w12 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w13 >>> 26)) | 0),\n (w13 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w14 >>> 26)) | 0),\n (w14 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w15 >>> 26)) | 0),\n (w15 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w16 >>> 26)) | 0),\n (w16 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w17 >>> 26)) | 0),\n (w17 &= 67108863),\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 & 8191) << 13)) | 0;\n return (\n (c = (((hi + (mid >>> 13)) | 0) + (w18 >>> 26)) | 0),\n (w18 &= 67108863),\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 c !== 0 && ((o[19] = c), out.length++),\n out\n );\n };\n Math.imul || (comb10MulTo = smallMulTo);\n function bigMulTo(self2, num, out) {\n (out.negative = num.negative ^ self2.negative), (out.length = self2.length + num.length);\n for (var carry = 0, hncarry = 0, k = 0; k < out.length - 1; k++) {\n var ncarry = hncarry;\n hncarry = 0;\n for (\n var rword = carry & 67108863, maxJ = Math.min(k, num.length - 1), j = Math.max(0, k - self2.length + 1);\n j <= maxJ;\n j++\n ) {\n var i = k - j,\n a = self2.words[i] | 0,\n b = num.words[j] | 0,\n r = a * b,\n lo = r & 67108863;\n (ncarry = (ncarry + ((r / 67108864) | 0)) | 0),\n (lo = (lo + rword) | 0),\n (rword = lo & 67108863),\n (ncarry = (ncarry + (lo >>> 26)) | 0),\n (hncarry += ncarry >>> 26),\n (ncarry &= 67108863);\n }\n (out.words[k] = rword), (carry = ncarry), (ncarry = hncarry);\n }\n return carry !== 0 ? (out.words[k] = carry) : out.length--, out.strip();\n }\n function jumboMulTo(self2, num, out) {\n var fftm = new FFTM();\n return fftm.mulp(self2, num, out);\n }\n BN.prototype.mulTo = function (num, out) {\n var res,\n len = this.length + num.length;\n return (\n this.length === 10 && num.length === 10\n ? (res = comb10MulTo(this, num, out))\n : len < 63\n ? (res = smallMulTo(this, num, out))\n : len < 1024\n ? (res = bigMulTo(this, num, out))\n : (res = jumboMulTo(this, num, out)),\n res\n );\n };\n function FFTM(x, y) {\n (this.x = x), (this.y = y);\n }\n (FFTM.prototype.makeRBT = function (N) {\n for (var t = new Array(N), l = BN.prototype._countBits(N) - 1, i = 0; i < N; i++) t[i] = this.revBin(i, l, N);\n return t;\n }),\n (FFTM.prototype.revBin = function (x, l, N) {\n if (x === 0 || x === N - 1) return x;\n for (var rb = 0, i = 0; i < l; i++) (rb |= (x & 1) << (l - i - 1)), (x >>= 1);\n return rb;\n }),\n (FFTM.prototype.permute = function (rbt, rws, iws, rtws, itws, N) {\n for (var i = 0; i < N; i++) (rtws[i] = rws[rbt[i]]), (itws[i] = iws[rbt[i]]);\n }),\n (FFTM.prototype.transform = function (rws, iws, rtws, itws, N, rbt) {\n this.permute(rbt, rws, iws, rtws, itws, N);\n for (var s = 1; s < N; s <<= 1)\n for (\n var l = s << 1, rtwdf = Math.cos((2 * Math.PI) / l), itwdf = Math.sin((2 * Math.PI) / l), p = 0;\n p < N;\n p += l\n )\n for (var rtwdf_ = rtwdf, itwdf_ = itwdf, j = 0; j < s; j++) {\n var re = rtws[p + j],\n ie = itws[p + j],\n ro = rtws[p + j + s],\n io = itws[p + j + s],\n rx = rtwdf_ * ro - itwdf_ * io;\n (io = rtwdf_ * io + itwdf_ * ro),\n (ro = rx),\n (rtws[p + j] = re + ro),\n (itws[p + j] = ie + io),\n (rtws[p + j + s] = re - ro),\n (itws[p + j + s] = ie - io),\n j !== l &&\n ((rx = rtwdf * rtwdf_ - itwdf * itwdf_), (itwdf_ = rtwdf * itwdf_ + itwdf * rtwdf_), (rtwdf_ = rx));\n }\n }),\n (FFTM.prototype.guessLen13b = function (n, m) {\n var N = Math.max(m, n) | 1,\n odd = N & 1,\n i = 0;\n for (N = (N / 2) | 0; N; N = N >>> 1) i++;\n return 1 << (i + 1 + odd);\n }),\n (FFTM.prototype.conjugate = function (rws, iws, N) {\n if (!(N <= 1))\n for (var i = 0; i < N / 2; i++) {\n var t = rws[i];\n (rws[i] = rws[N - i - 1]),\n (rws[N - i - 1] = t),\n (t = iws[i]),\n (iws[i] = -iws[N - i - 1]),\n (iws[N - i - 1] = -t);\n }\n }),\n (FFTM.prototype.normalize13b = function (ws, N) {\n for (var carry = 0, i = 0; i < N / 2; i++) {\n var w = Math.round(ws[2 * i + 1] / N) * 8192 + Math.round(ws[2 * i] / N) + carry;\n (ws[i] = w & 67108863), w < 67108864 ? (carry = 0) : (carry = (w / 67108864) | 0);\n }\n return ws;\n }),\n (FFTM.prototype.convert13b = function (ws, len, rws, N) {\n for (var carry = 0, i = 0; i < len; i++)\n (carry = carry + (ws[i] | 0)),\n (rws[2 * i] = carry & 8191),\n (carry = carry >>> 13),\n (rws[2 * i + 1] = carry & 8191),\n (carry = carry >>> 13);\n for (i = 2 * len; i < N; ++i) rws[i] = 0;\n assert(carry === 0), assert((carry & -8192) === 0);\n }),\n (FFTM.prototype.stub = function (N) {\n for (var ph = new Array(N), i = 0; i < N; i++) ph[i] = 0;\n return ph;\n }),\n (FFTM.prototype.mulp = function (x, y, out) {\n var N = 2 * this.guessLen13b(x.length, y.length),\n rbt = this.makeRBT(N),\n _ = this.stub(N),\n rws = new Array(N),\n rwst = new Array(N),\n iwst = new Array(N),\n nrws = new Array(N),\n nrwst = new Array(N),\n niwst = new Array(N),\n rmws = out.words;\n (rmws.length = N),\n this.convert13b(x.words, x.length, rws, N),\n this.convert13b(y.words, y.length, nrws, N),\n this.transform(rws, _, rwst, iwst, N, rbt),\n this.transform(nrws, _, nrwst, niwst, N, rbt);\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]), (rwst[i] = rx);\n }\n return (\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 (out.negative = x.negative ^ y.negative),\n (out.length = x.length + y.length),\n out.strip()\n );\n }),\n (BN.prototype.mul = function (num) {\n var out = new BN(null);\n return (out.words = new Array(this.length + num.length)), this.mulTo(num, out);\n }),\n (BN.prototype.mulf = function (num) {\n var out = new BN(null);\n return (out.words = new Array(this.length + num.length)), jumboMulTo(this, num, out);\n }),\n (BN.prototype.imul = function (num) {\n return this.clone().mulTo(num, this);\n }),\n (BN.prototype.imuln = function (num) {\n assert(typeof num == \"number\"), assert(num < 67108864);\n for (var carry = 0, i = 0; i < this.length; i++) {\n var w = (this.words[i] | 0) * num,\n lo = (w & 67108863) + (carry & 67108863);\n (carry >>= 26), (carry += (w / 67108864) | 0), (carry += lo >>> 26), (this.words[i] = lo & 67108863);\n }\n return carry !== 0 && ((this.words[i] = carry), this.length++), this;\n }),\n (BN.prototype.muln = function (num) {\n return this.clone().imuln(num);\n }),\n (BN.prototype.sqr = function () {\n return this.mul(this);\n }),\n (BN.prototype.isqr = function () {\n return this.imul(this.clone());\n }),\n (BN.prototype.pow = function (num) {\n var w = toBitArray(num);\n if (w.length === 0) return new BN(1);\n for (var res = this, i = 0; i < w.length && w[i] === 0; i++, res = res.sqr());\n if (++i < w.length) for (var q = res.sqr(); i < w.length; i++, q = q.sqr()) w[i] !== 0 && (res = res.mul(q));\n return res;\n }),\n (BN.prototype.iushln = function (bits) {\n assert(typeof bits == \"number\" && bits >= 0);\n var r = bits % 26,\n s = (bits - r) / 26,\n carryMask = (67108863 >>> (26 - r)) << (26 - r),\n i;\n if (r !== 0) {\n var carry = 0;\n for (i = 0; i < this.length; i++) {\n var newCarry = this.words[i] & carryMask,\n c = ((this.words[i] | 0) - newCarry) << r;\n (this.words[i] = c | carry), (carry = newCarry >>> (26 - r));\n }\n carry && ((this.words[i] = carry), this.length++);\n }\n if (s !== 0) {\n for (i = this.length - 1; i >= 0; i--) this.words[i + s] = this.words[i];\n for (i = 0; i < s; i++) this.words[i] = 0;\n this.length += s;\n }\n return this.strip();\n }),\n (BN.prototype.ishln = function (bits) {\n return assert(this.negative === 0), this.iushln(bits);\n }),\n (BN.prototype.iushrn = function (bits, hint, extended) {\n assert(typeof bits == \"number\" && bits >= 0);\n var h;\n hint ? (h = (hint - (hint % 26)) / 26) : (h = 0);\n var r = bits % 26,\n s = Math.min((bits - r) / 26, this.length),\n mask = 67108863 ^ ((67108863 >>> r) << r),\n maskedWords = extended;\n if (((h -= s), (h = Math.max(0, h)), maskedWords)) {\n for (var i = 0; i < s; i++) maskedWords.words[i] = this.words[i];\n maskedWords.length = s;\n }\n if (s !== 0)\n if (this.length > s) for (this.length -= s, i = 0; i < this.length; i++) this.words[i] = this.words[i + s];\n else (this.words[0] = 0), (this.length = 1);\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)), (carry = word & mask);\n }\n return (\n maskedWords && carry !== 0 && (maskedWords.words[maskedWords.length++] = carry),\n this.length === 0 && ((this.words[0] = 0), (this.length = 1)),\n this.strip()\n );\n }),\n (BN.prototype.ishrn = function (bits, hint, extended) {\n return assert(this.negative === 0), this.iushrn(bits, hint, extended);\n }),\n (BN.prototype.shln = function (bits) {\n return this.clone().ishln(bits);\n }),\n (BN.prototype.ushln = function (bits) {\n return this.clone().iushln(bits);\n }),\n (BN.prototype.shrn = function (bits) {\n return this.clone().ishrn(bits);\n }),\n (BN.prototype.ushrn = function (bits) {\n return this.clone().iushrn(bits);\n }),\n (BN.prototype.testn = function (bit) {\n assert(typeof bit == \"number\" && bit >= 0);\n var r = bit % 26,\n s = (bit - r) / 26,\n q = 1 << r;\n if (this.length <= s) return !1;\n var w = this.words[s];\n return !!(w & q);\n }),\n (BN.prototype.imaskn = function (bits) {\n assert(typeof bits == \"number\" && bits >= 0);\n var r = bits % 26,\n s = (bits - r) / 26;\n if ((assert(this.negative === 0, \"imaskn works only with positive numbers\"), this.length <= s)) return this;\n if ((r !== 0 && s++, (this.length = Math.min(s, this.length)), r !== 0)) {\n var mask = 67108863 ^ ((67108863 >>> r) << r);\n this.words[this.length - 1] &= mask;\n }\n return this.strip();\n }),\n (BN.prototype.maskn = function (bits) {\n return this.clone().imaskn(bits);\n }),\n (BN.prototype.iaddn = function (num) {\n return (\n assert(typeof num == \"number\"),\n assert(num < 67108864),\n num < 0\n ? this.isubn(-num)\n : this.negative !== 0\n ? this.length === 1 && (this.words[0] | 0) < num\n ? ((this.words[0] = num - (this.words[0] | 0)), (this.negative = 0), this)\n : ((this.negative = 0), this.isubn(num), (this.negative = 1), this)\n : this._iaddn(num)\n );\n }),\n (BN.prototype._iaddn = function (num) {\n this.words[0] += num;\n for (var i = 0; i < this.length && this.words[i] >= 67108864; i++)\n (this.words[i] -= 67108864), i === this.length - 1 ? (this.words[i + 1] = 1) : this.words[i + 1]++;\n return (this.length = Math.max(this.length, i + 1)), this;\n }),\n (BN.prototype.isubn = function (num) {\n if ((assert(typeof num == \"number\"), assert(num < 67108864), num < 0)) return this.iaddn(-num);\n if (this.negative !== 0) return (this.negative = 0), this.iaddn(num), (this.negative = 1), this;\n if (((this.words[0] -= num), this.length === 1 && this.words[0] < 0))\n (this.words[0] = -this.words[0]), (this.negative = 1);\n else\n for (var i = 0; i < this.length && this.words[i] < 0; i++)\n (this.words[i] += 67108864), (this.words[i + 1] -= 1);\n return this.strip();\n }),\n (BN.prototype.addn = function (num) {\n return this.clone().iaddn(num);\n }),\n (BN.prototype.subn = function (num) {\n return this.clone().isubn(num);\n }),\n (BN.prototype.iabs = function () {\n return (this.negative = 0), this;\n }),\n (BN.prototype.abs = function () {\n return this.clone().iabs();\n }),\n (BN.prototype._ishlnsubmul = function (num, mul, shift) {\n var len = num.length + shift,\n i;\n this._expand(len);\n var w,\n 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 & 67108863),\n (carry = (w >> 26) - ((right / 67108864) | 0)),\n (this.words[i + shift] = w & 67108863);\n }\n for (; i < this.length - shift; i++)\n (w = (this.words[i + shift] | 0) + carry), (carry = w >> 26), (this.words[i + shift] = w & 67108863);\n if (carry === 0) return this.strip();\n for (assert(carry === -1), carry = 0, i = 0; i < this.length; i++)\n (w = -(this.words[i] | 0) + carry), (carry = w >> 26), (this.words[i] = w & 67108863);\n return (this.negative = 1), this.strip();\n }),\n (BN.prototype._wordDiv = function (num, mode) {\n var shift = this.length - num.length,\n a = this.clone(),\n b = num,\n bhi = b.words[b.length - 1] | 0,\n bhiBits = this._countBits(bhi);\n (shift = 26 - bhiBits),\n shift !== 0 && ((b = b.ushln(shift)), a.iushln(shift), (bhi = b.words[b.length - 1] | 0));\n var m = a.length - b.length,\n q;\n if (mode !== \"mod\") {\n (q = new BN(null)), (q.length = m + 1), (q.words = new Array(q.length));\n for (var i = 0; i < q.length; i++) q.words[i] = 0;\n }\n var diff = a.clone()._ishlnsubmul(b, 1, m);\n diff.negative === 0 && ((a = diff), q && (q.words[m] = 1));\n for (var j = m - 1; j >= 0; j--) {\n var qj = (a.words[b.length + j] | 0) * 67108864 + (a.words[b.length + j - 1] | 0);\n for (qj = Math.min((qj / bhi) | 0, 67108863), a._ishlnsubmul(b, qj, j); a.negative !== 0; )\n qj--, (a.negative = 0), a._ishlnsubmul(b, 1, j), a.isZero() || (a.negative ^= 1);\n q && (q.words[j] = qj);\n }\n return (\n q && q.strip(),\n a.strip(),\n mode !== \"div\" && shift !== 0 && a.iushrn(shift),\n {\n div: q || null,\n mod: a,\n }\n );\n }),\n (BN.prototype.divmod = function (num, mode, positive) {\n if ((assert(!num.isZero()), this.isZero()))\n return {\n div: new BN(0),\n mod: new BN(0),\n };\n var div, mod, res;\n return this.negative !== 0 && num.negative === 0\n ? ((res = this.neg().divmod(num, mode)),\n mode !== \"mod\" && (div = res.div.neg()),\n mode !== \"div\" && ((mod = res.mod.neg()), positive && mod.negative !== 0 && mod.iadd(num)),\n {\n div,\n mod,\n })\n : this.negative === 0 && num.negative !== 0\n ? ((res = this.divmod(num.neg(), mode)),\n mode !== \"mod\" && (div = res.div.neg()),\n {\n div,\n mod: res.mod,\n })\n : (this.negative & num.negative) !== 0\n ? ((res = this.neg().divmod(num.neg(), mode)),\n mode !== \"div\" && ((mod = res.mod.neg()), positive && mod.negative !== 0 && mod.isub(num)),\n {\n div: res.div,\n mod,\n })\n : num.length > this.length || this.cmp(num) < 0\n ? {\n div: new BN(0),\n mod: this,\n }\n : num.length === 1\n ? mode === \"div\"\n ? {\n div: this.divn(num.words[0]),\n mod: null,\n }\n : mode === \"mod\"\n ? {\n div: null,\n mod: new BN(this.modn(num.words[0])),\n }\n : {\n div: this.divn(num.words[0]),\n mod: new BN(this.modn(num.words[0])),\n }\n : this._wordDiv(num, mode);\n }),\n (BN.prototype.div = function (num) {\n return this.divmod(num, \"div\", !1).div;\n }),\n (BN.prototype.mod = function (num) {\n return this.divmod(num, \"mod\", !1).mod;\n }),\n (BN.prototype.umod = function (num) {\n return this.divmod(num, \"mod\", !0).mod;\n }),\n (BN.prototype.divRound = function (num) {\n var dm = this.divmod(num);\n if (dm.mod.isZero()) return dm.div;\n var mod = dm.div.negative !== 0 ? dm.mod.isub(num) : dm.mod,\n half = num.ushrn(1),\n r2 = num.andln(1),\n cmp = mod.cmp(half);\n return cmp < 0 || (r2 === 1 && cmp === 0)\n ? dm.div\n : dm.div.negative !== 0\n ? dm.div.isubn(1)\n : dm.div.iaddn(1);\n }),\n (BN.prototype.modn = function (num) {\n assert(num <= 67108863);\n for (var p = (1 << 26) % num, acc = 0, i = this.length - 1; i >= 0; i--)\n acc = (p * acc + (this.words[i] | 0)) % num;\n return acc;\n }),\n (BN.prototype.idivn = function (num) {\n assert(num <= 67108863);\n for (var carry = 0, i = this.length - 1; i >= 0; i--) {\n var w = (this.words[i] | 0) + carry * 67108864;\n (this.words[i] = (w / num) | 0), (carry = w % num);\n }\n return this.strip();\n }),\n (BN.prototype.divn = function (num) {\n return this.clone().idivn(num);\n }),\n (BN.prototype.egcd = function (p) {\n assert(p.negative === 0), assert(!p.isZero());\n var x = this,\n y = p.clone();\n x.negative !== 0 ? (x = x.umod(p)) : (x = x.clone());\n for (var A = new BN(1), B = new BN(0), C = new BN(0), D = new BN(1), g = 0; x.isEven() && y.isEven(); )\n x.iushrn(1), y.iushrn(1), ++g;\n for (var yp = y.clone(), xp = x.clone(); !x.isZero(); ) {\n for (var i = 0, im = 1; (x.words[0] & im) === 0 && i < 26; ++i, im <<= 1);\n if (i > 0)\n for (x.iushrn(i); i-- > 0; )\n (A.isOdd() || B.isOdd()) && (A.iadd(yp), B.isub(xp)), A.iushrn(1), B.iushrn(1);\n for (var j = 0, jm = 1; (y.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n if (j > 0)\n for (y.iushrn(j); j-- > 0; )\n (C.isOdd() || D.isOdd()) && (C.iadd(yp), D.isub(xp)), C.iushrn(1), D.iushrn(1);\n x.cmp(y) >= 0 ? (x.isub(y), A.isub(C), B.isub(D)) : (y.isub(x), C.isub(A), D.isub(B));\n }\n return {\n a: C,\n b: D,\n gcd: y.iushln(g),\n };\n }),\n (BN.prototype._invmp = function (p) {\n assert(p.negative === 0), assert(!p.isZero());\n var a = this,\n b = p.clone();\n a.negative !== 0 ? (a = a.umod(p)) : (a = a.clone());\n for (var x1 = new BN(1), x2 = new BN(0), delta = b.clone(); 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) for (a.iushrn(i); i-- > 0; ) x1.isOdd() && x1.iadd(delta), x1.iushrn(1);\n for (var j = 0, jm = 1; (b.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n if (j > 0) for (b.iushrn(j); j-- > 0; ) x2.isOdd() && x2.iadd(delta), x2.iushrn(1);\n a.cmp(b) >= 0 ? (a.isub(b), x1.isub(x2)) : (b.isub(a), x2.isub(x1));\n }\n var res;\n return a.cmpn(1) === 0 ? (res = x1) : (res = x2), res.cmpn(0) < 0 && res.iadd(p), res;\n }),\n (BN.prototype.gcd = function (num) {\n if (this.isZero()) return num.abs();\n if (num.isZero()) return this.abs();\n var a = this.clone(),\n b = num.clone();\n (a.negative = 0), (b.negative = 0);\n for (var shift = 0; a.isEven() && b.isEven(); shift++) a.iushrn(1), b.iushrn(1);\n do {\n for (; a.isEven(); ) a.iushrn(1);\n for (; b.isEven(); ) b.iushrn(1);\n var r = a.cmp(b);\n if (r < 0) {\n var t = a;\n (a = b), (b = t);\n } else if (r === 0 || b.cmpn(1) === 0) break;\n a.isub(b);\n } while (!0);\n return b.iushln(shift);\n }),\n (BN.prototype.invm = function (num) {\n return this.egcd(num).a.umod(num);\n }),\n (BN.prototype.isEven = function () {\n return (this.words[0] & 1) === 0;\n }),\n (BN.prototype.isOdd = function () {\n return (this.words[0] & 1) === 1;\n }),\n (BN.prototype.andln = function (num) {\n return this.words[0] & num;\n }),\n (BN.prototype.bincn = function (bit) {\n assert(typeof bit == \"number\");\n var r = bit % 26,\n s = (bit - r) / 26,\n q = 1 << r;\n if (this.length <= s) return this._expand(s + 1), (this.words[s] |= q), this;\n for (var carry = q, i = s; carry !== 0 && i < this.length; i++) {\n var w = this.words[i] | 0;\n (w += carry), (carry = w >>> 26), (w &= 67108863), (this.words[i] = w);\n }\n return carry !== 0 && ((this.words[i] = carry), this.length++), this;\n }),\n (BN.prototype.isZero = function () {\n return this.length === 1 && this.words[0] === 0;\n }),\n (BN.prototype.cmpn = function (num) {\n var negative = num < 0;\n if (this.negative !== 0 && !negative) return -1;\n if (this.negative === 0 && negative) return 1;\n this.strip();\n var res;\n if (this.length > 1) res = 1;\n else {\n negative && (num = -num), assert(num <= 67108863, \"Number is too big\");\n var w = this.words[0] | 0;\n res = w === num ? 0 : w < num ? -1 : 1;\n }\n return this.negative !== 0 ? -res | 0 : res;\n }),\n (BN.prototype.cmp = function (num) {\n if (this.negative !== 0 && num.negative === 0) return -1;\n if (this.negative === 0 && num.negative !== 0) return 1;\n var res = this.ucmp(num);\n return this.negative !== 0 ? -res | 0 : res;\n }),\n (BN.prototype.ucmp = function (num) {\n if (this.length > num.length) return 1;\n if (this.length < num.length) return -1;\n for (var res = 0, i = this.length - 1; i >= 0; i--) {\n var a = this.words[i] | 0,\n b = num.words[i] | 0;\n if (a !== b) {\n a < b ? (res = -1) : a > b && (res = 1);\n break;\n }\n }\n return res;\n }),\n (BN.prototype.gtn = function (num) {\n return this.cmpn(num) === 1;\n }),\n (BN.prototype.gt = function (num) {\n return this.cmp(num) === 1;\n }),\n (BN.prototype.gten = function (num) {\n return this.cmpn(num) >= 0;\n }),\n (BN.prototype.gte = function (num) {\n return this.cmp(num) >= 0;\n }),\n (BN.prototype.ltn = function (num) {\n return this.cmpn(num) === -1;\n }),\n (BN.prototype.lt = function (num) {\n return this.cmp(num) === -1;\n }),\n (BN.prototype.lten = function (num) {\n return this.cmpn(num) <= 0;\n }),\n (BN.prototype.lte = function (num) {\n return this.cmp(num) <= 0;\n }),\n (BN.prototype.eqn = function (num) {\n return this.cmpn(num) === 0;\n }),\n (BN.prototype.eq = function (num) {\n return this.cmp(num) === 0;\n }),\n (BN.red = function (num) {\n return new Red(num);\n }),\n (BN.prototype.toRed = function (ctx) {\n return (\n assert(!this.red, \"Already a number in reduction context\"),\n assert(this.negative === 0, \"red works only with positives\"),\n ctx.convertTo(this)._forceRed(ctx)\n );\n }),\n (BN.prototype.fromRed = function () {\n return assert(this.red, \"fromRed works only with numbers in reduction context\"), this.red.convertFrom(this);\n }),\n (BN.prototype._forceRed = function (ctx) {\n return (this.red = ctx), this;\n }),\n (BN.prototype.forceRed = function (ctx) {\n return assert(!this.red, \"Already a number in reduction context\"), this._forceRed(ctx);\n }),\n (BN.prototype.redAdd = function (num) {\n return assert(this.red, \"redAdd works only with red numbers\"), this.red.add(this, num);\n }),\n (BN.prototype.redIAdd = function (num) {\n return assert(this.red, \"redIAdd works only with red numbers\"), this.red.iadd(this, num);\n }),\n (BN.prototype.redSub = function (num) {\n return assert(this.red, \"redSub works only with red numbers\"), this.red.sub(this, num);\n }),\n (BN.prototype.redISub = function (num) {\n return assert(this.red, \"redISub works only with red numbers\"), this.red.isub(this, num);\n }),\n (BN.prototype.redShl = function (num) {\n return assert(this.red, \"redShl works only with red numbers\"), this.red.shl(this, num);\n }),\n (BN.prototype.redMul = function (num) {\n return (\n assert(this.red, \"redMul works only with red numbers\"),\n this.red._verify2(this, num),\n this.red.mul(this, num)\n );\n }),\n (BN.prototype.redIMul = function (num) {\n return (\n assert(this.red, \"redMul works only with red numbers\"),\n this.red._verify2(this, num),\n this.red.imul(this, num)\n );\n }),\n (BN.prototype.redSqr = function () {\n return assert(this.red, \"redSqr works only with red numbers\"), this.red._verify1(this), this.red.sqr(this);\n }),\n (BN.prototype.redISqr = function () {\n return assert(this.red, \"redISqr works only with red numbers\"), this.red._verify1(this), this.red.isqr(this);\n }),\n (BN.prototype.redSqrt = function () {\n return assert(this.red, \"redSqrt works only with red numbers\"), this.red._verify1(this), this.red.sqrt(this);\n }),\n (BN.prototype.redInvm = function () {\n return assert(this.red, \"redInvm works only with red numbers\"), this.red._verify1(this), this.red.invm(this);\n }),\n (BN.prototype.redNeg = function () {\n return assert(this.red, \"redNeg works only with red numbers\"), this.red._verify1(this), this.red.neg(this);\n }),\n (BN.prototype.redPow = function (num) {\n return assert(this.red && !num.red, \"redPow(normalNum)\"), this.red._verify1(this), this.red.pow(this, num);\n });\n var primes = {\n k256: null,\n p224: null,\n p192: null,\n p25519: null,\n };\n function MPrime(name, p) {\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 (this.tmp = this._tmp());\n }\n (MPrime.prototype._tmp = function () {\n var tmp = new BN(null);\n return (tmp.words = new Array(Math.ceil(this.n / 13))), tmp;\n }),\n (MPrime.prototype.ireduce = function (num) {\n var r = num,\n rlen;\n do this.split(r, this.tmp), (r = this.imulK(r)), (r = r.iadd(this.tmp)), (rlen = r.bitLength());\n while (rlen > this.n);\n var cmp = rlen < this.n ? -1 : r.ucmp(this.p);\n return (\n cmp === 0\n ? ((r.words[0] = 0), (r.length = 1))\n : cmp > 0\n ? r.isub(this.p)\n : r.strip !== void 0\n ? r.strip()\n : r._strip(),\n r\n );\n }),\n (MPrime.prototype.split = function (input, out) {\n input.iushrn(this.n, 0, out);\n }),\n (MPrime.prototype.imulK = function (num) {\n return num.imul(this.k);\n });\n function K256() {\n MPrime.call(this, \"k256\", \"ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f\");\n }\n inherits(K256, MPrime),\n (K256.prototype.split = function (input, output) {\n for (var mask = 4194303, outLen = Math.min(input.length, 9), i = 0; i < outLen; i++)\n output.words[i] = input.words[i];\n if (((output.length = outLen), input.length <= 9)) {\n (input.words[0] = 0), (input.length = 1);\n return;\n }\n var prev = input.words[9];\n for (output.words[output.length++] = prev & mask, i = 10; i < input.length; i++) {\n var next = input.words[i] | 0;\n (input.words[i - 10] = ((next & mask) << 4) | (prev >>> 22)), (prev = next);\n }\n (prev >>>= 22),\n (input.words[i - 10] = prev),\n prev === 0 && input.length > 10 ? (input.length -= 10) : (input.length -= 9);\n }),\n (K256.prototype.imulK = function (num) {\n (num.words[num.length] = 0), (num.words[num.length + 1] = 0), (num.length += 2);\n for (var lo = 0, i = 0; i < num.length; i++) {\n var w = num.words[i] | 0;\n (lo += w * 977), (num.words[i] = lo & 67108863), (lo = w * 64 + ((lo / 67108864) | 0));\n }\n return (\n num.words[num.length - 1] === 0 && (num.length--, num.words[num.length - 1] === 0 && num.length--), num\n );\n });\n function P224() {\n MPrime.call(this, \"p224\", \"ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001\");\n }\n inherits(P224, MPrime);\n function P192() {\n MPrime.call(this, \"p192\", \"ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff\");\n }\n inherits(P192, MPrime);\n function P25519() {\n MPrime.call(this, \"25519\", \"7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed\");\n }\n inherits(P25519, MPrime),\n (P25519.prototype.imulK = function (num) {\n for (var carry = 0, i = 0; i < num.length; i++) {\n var hi = (num.words[i] | 0) * 19 + carry,\n lo = hi & 67108863;\n (hi >>>= 26), (num.words[i] = lo), (carry = hi);\n }\n return carry !== 0 && (num.words[num.length++] = carry), num;\n }),\n (BN._prime = function (name) {\n if (primes[name]) return primes[name];\n var prime2;\n if (name === \"k256\") prime2 = new K256();\n else if (name === \"p224\") prime2 = new P224();\n else if (name === \"p192\") prime2 = new P192();\n else if (name === \"p25519\") prime2 = new P25519();\n else throw new Error(\"Unknown prime \" + name);\n return (primes[name] = prime2), prime2;\n });\n function Red(m) {\n if (typeof m == \"string\") {\n var prime = BN._prime(m);\n (this.m = prime.p), (this.prime = prime);\n } else assert(m.gtn(1), \"modulus must be greater than 1\"), (this.m = m), (this.prime = null);\n }\n (Red.prototype._verify1 = function (a) {\n assert(a.negative === 0, \"red works only with positives\"), assert(a.red, \"red works only with red numbers\");\n }),\n (Red.prototype._verify2 = function (a, b) {\n assert((a.negative | b.negative) === 0, \"red works only with positives\"),\n assert(a.red && a.red === b.red, \"red works only with red numbers\");\n }),\n (Red.prototype.imod = function (a) {\n return this.prime ? this.prime.ireduce(a)._forceRed(this) : a.umod(this.m)._forceRed(this);\n }),\n (Red.prototype.neg = function (a) {\n return a.isZero() ? a.clone() : this.m.sub(a)._forceRed(this);\n }),\n (Red.prototype.add = function (a, b) {\n this._verify2(a, b);\n var res = a.add(b);\n return res.cmp(this.m) >= 0 && res.isub(this.m), res._forceRed(this);\n }),\n (Red.prototype.iadd = function (a, b) {\n this._verify2(a, b);\n var res = a.iadd(b);\n return res.cmp(this.m) >= 0 && res.isub(this.m), res;\n }),\n (Red.prototype.sub = function (a, b) {\n this._verify2(a, b);\n var res = a.sub(b);\n return res.cmpn(0) < 0 && res.iadd(this.m), res._forceRed(this);\n }),\n (Red.prototype.isub = function (a, b) {\n this._verify2(a, b);\n var res = a.isub(b);\n return res.cmpn(0) < 0 && res.iadd(this.m), res;\n }),\n (Red.prototype.shl = function (a, num) {\n return this._verify1(a), this.imod(a.ushln(num));\n }),\n (Red.prototype.imul = function (a, b) {\n return this._verify2(a, b), this.imod(a.imul(b));\n }),\n (Red.prototype.mul = function (a, b) {\n return this._verify2(a, b), this.imod(a.mul(b));\n }),\n (Red.prototype.isqr = function (a) {\n return this.imul(a, a.clone());\n }),\n (Red.prototype.sqr = function (a) {\n return this.mul(a, a);\n }),\n (Red.prototype.sqrt = function (a) {\n if (a.isZero()) return a.clone();\n var mod3 = this.m.andln(3);\n if ((assert(mod3 % 2 === 1), mod3 === 3)) {\n var pow = this.m.add(new BN(1)).iushrn(2);\n return this.pow(a, pow);\n }\n for (var q = this.m.subn(1), s = 0; !q.isZero() && q.andln(1) === 0; ) s++, q.iushrn(1);\n assert(!q.isZero());\n var one = new BN(1).toRed(this),\n nOne = one.redNeg(),\n lpow = this.m.subn(1).iushrn(1),\n z = this.m.bitLength();\n for (z = new BN(2 * z * z).toRed(this); this.pow(z, lpow).cmp(nOne) !== 0; ) z.redIAdd(nOne);\n for (\n var c = this.pow(z, q), r = this.pow(a, q.addn(1).iushrn(1)), t = this.pow(a, q), m = s;\n t.cmp(one) !== 0;\n\n ) {\n for (var tmp = t, i = 0; tmp.cmp(one) !== 0; i++) tmp = tmp.redSqr();\n assert(i < m);\n var b = this.pow(c, new BN(1).iushln(m - i - 1));\n (r = r.redMul(b)), (c = b.redSqr()), (t = t.redMul(c)), (m = i);\n }\n return r;\n }),\n (Red.prototype.invm = function (a) {\n var inv = a._invmp(this.m);\n return inv.negative !== 0 ? ((inv.negative = 0), this.imod(inv).redNeg()) : this.imod(inv);\n }),\n (Red.prototype.pow = function (a, num) {\n if (num.isZero()) return new BN(1).toRed(this);\n if (num.cmpn(1) === 0) return a.clone();\n var windowSize = 4,\n wnd = new Array(1 << windowSize);\n (wnd[0] = new BN(1).toRed(this)), (wnd[1] = a);\n for (var i = 2; i < wnd.length; i++) wnd[i] = this.mul(wnd[i - 1], a);\n var res = wnd[0],\n current = 0,\n currentLen = 0,\n start = num.bitLength() % 26;\n for (start === 0 && (start = 26), i = num.length - 1; i >= 0; i--) {\n for (var word = num.words[i], j = start - 1; j >= 0; j--) {\n var bit = (word >> j) & 1;\n if ((res !== wnd[0] && (res = this.sqr(res)), bit === 0 && current === 0)) {\n currentLen = 0;\n continue;\n }\n (current <<= 1),\n (current |= bit),\n currentLen++,\n !(currentLen !== windowSize && (i !== 0 || j !== 0)) &&\n ((res = this.mul(res, wnd[current])), (currentLen = 0), (current = 0));\n }\n start = 26;\n }\n return res;\n }),\n (Red.prototype.convertTo = function (num) {\n var r = num.umod(this.m);\n return r === num ? r.clone() : r;\n }),\n (Red.prototype.convertFrom = function (num) {\n var res = num.clone();\n return (res.red = null), res;\n }),\n (BN.mont = function (num) {\n return new Mont(num);\n });\n function Mont(m) {\n Red.call(this, m),\n (this.shift = this.m.bitLength()),\n this.shift % 26 !== 0 && (this.shift += 26 - (this.shift % 26)),\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 (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 (Mont.prototype.convertTo = function (num) {\n return this.imod(num.ushln(this.shift));\n }),\n (Mont.prototype.convertFrom = function (num) {\n var r = this.imod(num.mul(this.rinv));\n return (r.red = null), r;\n }),\n (Mont.prototype.imul = function (a, b) {\n if (a.isZero() || b.isZero()) return (a.words[0] = 0), (a.length = 1), a;\n var t = a.imul(b),\n c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m),\n u = t.isub(c).iushrn(this.shift),\n res = u;\n return (\n u.cmp(this.m) >= 0 ? (res = u.isub(this.m)) : u.cmpn(0) < 0 && (res = u.iadd(this.m)), res._forceRed(this)\n );\n }),\n (Mont.prototype.mul = function (a, b) {\n if (a.isZero() || b.isZero()) return new BN(0)._forceRed(this);\n var t = a.mul(b),\n c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m),\n u = t.isub(c).iushrn(this.shift),\n res = u;\n return (\n u.cmp(this.m) >= 0 ? (res = u.isub(this.m)) : u.cmpn(0) < 0 && (res = u.iadd(this.m)), res._forceRed(this)\n );\n }),\n (Mont.prototype.invm = function (a) {\n var res = this.imod(a._invmp(this.m).mul(this.r2));\n return res._forceRed(this);\n });\n })(typeof module > \"u\" || module, exports);\n },\n});\n\n// node_modules/miller-rabin/node_modules/bn.js/lib/bn.js\nvar require_bn2 = __commonJS({\n \"node_modules/miller-rabin/node_modules/bn.js/lib/bn.js\"(exports, module) {\n (function (module2, exports2) {\n \"use strict\";\n function assert(val, msg) {\n if (!val) throw new Error(msg || \"Assertion failed\");\n }\n function inherits(ctor, superCtor) {\n ctor.super_ = superCtor;\n var TempCtor = function () {};\n (TempCtor.prototype = superCtor.prototype),\n (ctor.prototype = new TempCtor()),\n (ctor.prototype.constructor = ctor);\n }\n function BN(number, base, endian) {\n if (BN.isBN(number)) return number;\n (this.negative = 0),\n (this.words = null),\n (this.length = 0),\n (this.red = null),\n number !== null &&\n ((base === \"le\" || base === \"be\") && ((endian = base), (base = 10)),\n this._init(number || 0, base || 10, endian || \"be\"));\n }\n typeof module2 == \"object\" ? (module2.exports = BN) : (exports2.BN = BN), (BN.BN = BN), (BN.wordSize = 26);\n var Buffer2;\n try {\n typeof window < \"u\" && typeof window.Buffer < \"u\"\n ? (Buffer2 = window.Buffer)\n : (Buffer2 = __require(\"buffer\").Buffer);\n } catch {}\n (BN.isBN = function (num) {\n return num instanceof BN\n ? !0\n : num !== null &&\n typeof num == \"object\" &&\n num.constructor.wordSize === BN.wordSize &&\n Array.isArray(num.words);\n }),\n (BN.max = function (left, right) {\n return left.cmp(right) > 0 ? left : right;\n }),\n (BN.min = function (left, right) {\n return left.cmp(right) < 0 ? left : right;\n }),\n (BN.prototype._init = function (number, base, endian) {\n if (typeof number == \"number\") return this._initNumber(number, base, endian);\n if (typeof number == \"object\") return this._initArray(number, base, endian);\n base === \"hex\" && (base = 16),\n assert(base === (base | 0) && base >= 2 && base <= 36),\n (number = number.toString().replace(/\\s+/g, \"\"));\n var start = 0;\n number[0] === \"-\" && (start++, (this.negative = 1)),\n start < number.length &&\n (base === 16\n ? this._parseHex(number, start, endian)\n : (this._parseBase(number, base, start),\n endian === \"le\" && this._initArray(this.toArray(), base, endian)));\n }),\n (BN.prototype._initNumber = function (number, base, endian) {\n number < 0 && ((this.negative = 1), (number = -number)),\n number < 67108864\n ? ((this.words = [number & 67108863]), (this.length = 1))\n : number < 4503599627370496\n ? ((this.words = [number & 67108863, (number / 67108864) & 67108863]), (this.length = 2))\n : (assert(number < 9007199254740992),\n (this.words = [number & 67108863, (number / 67108864) & 67108863, 1]),\n (this.length = 3)),\n endian === \"le\" && this._initArray(this.toArray(), base, endian);\n }),\n (BN.prototype._initArray = function (number, base, endian) {\n if ((assert(typeof number.length == \"number\"), number.length <= 0))\n return (this.words = [0]), (this.length = 1), this;\n (this.length = Math.ceil(number.length / 3)), (this.words = new Array(this.length));\n for (var i = 0; i < this.length; i++) this.words[i] = 0;\n var j,\n w,\n off = 0;\n if (endian === \"be\")\n for (i = number.length - 1, j = 0; i >= 0; i -= 3)\n (w = number[i] | (number[i - 1] << 8) | (number[i - 2] << 16)),\n (this.words[j] |= (w << off) & 67108863),\n (this.words[j + 1] = (w >>> (26 - off)) & 67108863),\n (off += 24),\n off >= 26 && ((off -= 26), j++);\n else if (endian === \"le\")\n for (i = 0, j = 0; i < number.length; i += 3)\n (w = number[i] | (number[i + 1] << 8) | (number[i + 2] << 16)),\n (this.words[j] |= (w << off) & 67108863),\n (this.words[j + 1] = (w >>> (26 - off)) & 67108863),\n (off += 24),\n off >= 26 && ((off -= 26), j++);\n return this.strip();\n });\n function parseHex4Bits(string, index) {\n var c = string.charCodeAt(index);\n return c >= 65 && c <= 70 ? c - 55 : c >= 97 && c <= 102 ? c - 87 : (c - 48) & 15;\n }\n function parseHexByte(string, lowerBound, index) {\n var r = parseHex4Bits(string, index);\n return index - 1 >= lowerBound && (r |= parseHex4Bits(string, index - 1) << 4), r;\n }\n BN.prototype._parseHex = function (number, start, endian) {\n (this.length = Math.ceil((number.length - start) / 6)), (this.words = new Array(this.length));\n for (var i = 0; i < this.length; i++) this.words[i] = 0;\n var off = 0,\n j = 0,\n w;\n if (endian === \"be\")\n for (i = number.length - 1; i >= start; i -= 2)\n (w = parseHexByte(number, start, i) << off),\n (this.words[j] |= w & 67108863),\n off >= 18 ? ((off -= 18), (j += 1), (this.words[j] |= w >>> 26)) : (off += 8);\n else {\n var parseLength = number.length - start;\n for (i = parseLength % 2 === 0 ? start + 1 : start; i < number.length; i += 2)\n (w = parseHexByte(number, start, i) << off),\n (this.words[j] |= w & 67108863),\n off >= 18 ? ((off -= 18), (j += 1), (this.words[j] |= w >>> 26)) : (off += 8);\n }\n this.strip();\n };\n function parseBase(str, start, end, mul) {\n for (var r = 0, len = Math.min(str.length, end), i = start; i < len; i++) {\n var c = str.charCodeAt(i) - 48;\n (r *= mul), c >= 49 ? (r += c - 49 + 10) : c >= 17 ? (r += c - 17 + 10) : (r += c);\n }\n return r;\n }\n (BN.prototype._parseBase = function (number, base, start) {\n (this.words = [0]), (this.length = 1);\n for (var limbLen = 0, limbPow = 1; limbPow <= 67108863; limbPow *= base) limbLen++;\n limbLen--, (limbPow = (limbPow / base) | 0);\n for (\n var total = number.length - start,\n mod = total % limbLen,\n end = Math.min(total, total - mod) + start,\n word = 0,\n i = start;\n i < end;\n i += limbLen\n )\n (word = parseBase(number, i, i + limbLen, base)),\n this.imuln(limbPow),\n this.words[0] + word < 67108864 ? (this.words[0] += word) : this._iaddn(word);\n if (mod !== 0) {\n var pow = 1;\n for (word = parseBase(number, i, number.length, base), i = 0; i < mod; i++) pow *= base;\n this.imuln(pow), this.words[0] + word < 67108864 ? (this.words[0] += word) : this._iaddn(word);\n }\n this.strip();\n }),\n (BN.prototype.copy = function (dest) {\n dest.words = new Array(this.length);\n for (var i = 0; i < this.length; i++) dest.words[i] = this.words[i];\n (dest.length = this.length), (dest.negative = this.negative), (dest.red = this.red);\n }),\n (BN.prototype.clone = function () {\n var r = new BN(null);\n return this.copy(r), r;\n }),\n (BN.prototype._expand = function (size) {\n for (; this.length < size; ) this.words[this.length++] = 0;\n return this;\n }),\n (BN.prototype.strip = function () {\n for (; this.length > 1 && this.words[this.length - 1] === 0; ) this.length--;\n return this._normSign();\n }),\n (BN.prototype._normSign = function () {\n return this.length === 1 && this.words[0] === 0 && (this.negative = 0), this;\n }),\n (BN.prototype.inspect = function () {\n return (this.red ? \"<BN-R: \" : \"<BN: \") + this.toString(16) + \">\";\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 groupSizes = [\n 0, 0, 25, 16, 12, 11, 10, 9, 8, 8, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5,\n 5, 5,\n ],\n groupBases = [\n 0, 0, 33554432, 43046721, 16777216, 48828125, 60466176, 40353607, 16777216, 43046721, 1e7, 19487171, 35831808,\n 62748517, 7529536, 11390625, 16777216, 24137569, 34012224, 47045881, 64e6, 4084101, 5153632, 6436343, 7962624,\n 9765625, 11881376, 14348907, 17210368, 20511149, 243e5, 28629151, 33554432, 39135393, 45435424, 52521875,\n 60466176,\n ];\n (BN.prototype.toString = function (base, padding) {\n (base = base || 10), (padding = padding | 0 || 1);\n var out;\n if (base === 16 || base === \"hex\") {\n out = \"\";\n for (var off = 0, carry = 0, i = 0; i < this.length; i++) {\n var w = this.words[i],\n word = (((w << off) | carry) & 16777215).toString(16);\n (carry = (w >>> (24 - off)) & 16777215),\n carry !== 0 || i !== this.length - 1 ? (out = zeros[6 - word.length] + word + out) : (out = word + out),\n (off += 2),\n off >= 26 && ((off -= 26), i--);\n }\n for (carry !== 0 && (out = carry.toString(16) + out); out.length % padding !== 0; ) out = \"0\" + out;\n return this.negative !== 0 && (out = \"-\" + out), out;\n }\n if (base === (base | 0) && base >= 2 && base <= 36) {\n var groupSize = groupSizes[base],\n groupBase = groupBases[base];\n out = \"\";\n var c = this.clone();\n for (c.negative = 0; !c.isZero(); ) {\n var r = c.modn(groupBase).toString(base);\n (c = c.idivn(groupBase)), c.isZero() ? (out = r + out) : (out = zeros[groupSize - r.length] + r + out);\n }\n for (this.isZero() && (out = \"0\" + out); out.length % padding !== 0; ) out = \"0\" + out;\n return this.negative !== 0 && (out = \"-\" + out), out;\n }\n assert(!1, \"Base should be between 2 and 36\");\n }),\n (BN.prototype.toNumber = function () {\n var ret = this.words[0];\n return (\n this.length === 2\n ? (ret += this.words[1] * 67108864)\n : this.length === 3 && this.words[2] === 1\n ? (ret += 4503599627370496 + this.words[1] * 67108864)\n : this.length > 2 && assert(!1, \"Number can only safely store up to 53 bits\"),\n this.negative !== 0 ? -ret : ret\n );\n }),\n (BN.prototype.toJSON = function () {\n return this.toString(16);\n }),\n (BN.prototype.toBuffer = function (endian, length) {\n return assert(typeof Buffer2 < \"u\"), this.toArrayLike(Buffer2, endian, length);\n }),\n (BN.prototype.toArray = function (endian, length) {\n return this.toArrayLike(Array, endian, length);\n }),\n (BN.prototype.toArrayLike = function (ArrayType, endian, length) {\n var byteLength = this.byteLength(),\n 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 this.strip();\n var littleEndian = endian === \"le\",\n res = new ArrayType(reqLength),\n b,\n i,\n q = this.clone();\n if (littleEndian) {\n for (i = 0; !q.isZero(); i++) (b = q.andln(255)), q.iushrn(8), (res[i] = b);\n for (; i < reqLength; i++) res[i] = 0;\n } else {\n for (i = 0; i < reqLength - byteLength; i++) res[i] = 0;\n for (i = 0; !q.isZero(); i++) (b = q.andln(255)), q.iushrn(8), (res[reqLength - i - 1] = b);\n }\n return res;\n }),\n Math.clz32\n ? (BN.prototype._countBits = function (w) {\n return 32 - Math.clz32(w);\n })\n : (BN.prototype._countBits = function (w) {\n var t = w,\n r = 0;\n return (\n t >= 4096 && ((r += 13), (t >>>= 13)),\n t >= 64 && ((r += 7), (t >>>= 7)),\n t >= 8 && ((r += 4), (t >>>= 4)),\n t >= 2 && ((r += 2), (t >>>= 2)),\n r + t\n );\n }),\n (BN.prototype._zeroBits = function (w) {\n if (w === 0) return 26;\n var t = w,\n r = 0;\n return (\n (t & 8191) === 0 && ((r += 13), (t >>>= 13)),\n (t & 127) === 0 && ((r += 7), (t >>>= 7)),\n (t & 15) === 0 && ((r += 4), (t >>>= 4)),\n (t & 3) === 0 && ((r += 2), (t >>>= 2)),\n (t & 1) === 0 && r++,\n r\n );\n }),\n (BN.prototype.bitLength = function () {\n var w = this.words[this.length - 1],\n hi = this._countBits(w);\n return (this.length - 1) * 26 + hi;\n });\n function toBitArray(num) {\n for (var w = new Array(num.bitLength()), bit = 0; bit < w.length; bit++) {\n var off = (bit / 26) | 0,\n wbit = bit % 26;\n w[bit] = (num.words[off] & (1 << wbit)) >>> wbit;\n }\n return w;\n }\n (BN.prototype.zeroBits = function () {\n if (this.isZero()) return 0;\n for (var r = 0, i = 0; i < this.length; i++) {\n var b = this._zeroBits(this.words[i]);\n if (((r += b), b !== 26)) break;\n }\n return r;\n }),\n (BN.prototype.byteLength = function () {\n return Math.ceil(this.bitLength() / 8);\n }),\n (BN.prototype.toTwos = function (width) {\n return this.negative !== 0 ? this.abs().inotn(width).iaddn(1) : this.clone();\n }),\n (BN.prototype.fromTwos = function (width) {\n return this.testn(width - 1) ? this.notn(width).iaddn(1).ineg() : this.clone();\n }),\n (BN.prototype.isNeg = function () {\n return this.negative !== 0;\n }),\n (BN.prototype.neg = function () {\n return this.clone().ineg();\n }),\n (BN.prototype.ineg = function () {\n return this.isZero() || (this.negative ^= 1), this;\n }),\n (BN.prototype.iuor = function (num) {\n for (; this.length < num.length; ) this.words[this.length++] = 0;\n for (var i = 0; i < num.length; i++) this.words[i] = this.words[i] | num.words[i];\n return this.strip();\n }),\n (BN.prototype.ior = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuor(num);\n }),\n (BN.prototype.or = function (num) {\n return this.length > num.length ? this.clone().ior(num) : num.clone().ior(this);\n }),\n (BN.prototype.uor = function (num) {\n return this.length > num.length ? this.clone().iuor(num) : num.clone().iuor(this);\n }),\n (BN.prototype.iuand = function (num) {\n var b;\n this.length > num.length ? (b = num) : (b = this);\n for (var i = 0; i < b.length; i++) this.words[i] = this.words[i] & num.words[i];\n return (this.length = b.length), this.strip();\n }),\n (BN.prototype.iand = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuand(num);\n }),\n (BN.prototype.and = function (num) {\n return this.length > num.length ? this.clone().iand(num) : num.clone().iand(this);\n }),\n (BN.prototype.uand = function (num) {\n return this.length > num.length ? this.clone().iuand(num) : num.clone().iuand(this);\n }),\n (BN.prototype.iuxor = function (num) {\n var a, b;\n this.length > num.length ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var i = 0; i < b.length; i++) this.words[i] = a.words[i] ^ b.words[i];\n if (this !== a) for (; i < a.length; i++) this.words[i] = a.words[i];\n return (this.length = a.length), this.strip();\n }),\n (BN.prototype.ixor = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuxor(num);\n }),\n (BN.prototype.xor = function (num) {\n return this.length > num.length ? this.clone().ixor(num) : num.clone().ixor(this);\n }),\n (BN.prototype.uxor = function (num) {\n return this.length > num.length ? this.clone().iuxor(num) : num.clone().iuxor(this);\n }),\n (BN.prototype.inotn = function (width) {\n assert(typeof width == \"number\" && width >= 0);\n var bytesNeeded = Math.ceil(width / 26) | 0,\n bitsLeft = width % 26;\n this._expand(bytesNeeded), bitsLeft > 0 && bytesNeeded--;\n for (var i = 0; i < bytesNeeded; i++) this.words[i] = ~this.words[i] & 67108863;\n return bitsLeft > 0 && (this.words[i] = ~this.words[i] & (67108863 >> (26 - bitsLeft))), this.strip();\n }),\n (BN.prototype.notn = function (width) {\n return this.clone().inotn(width);\n }),\n (BN.prototype.setn = function (bit, val) {\n assert(typeof bit == \"number\" && bit >= 0);\n var off = (bit / 26) | 0,\n wbit = bit % 26;\n return (\n this._expand(off + 1),\n val\n ? (this.words[off] = this.words[off] | (1 << wbit))\n : (this.words[off] = this.words[off] & ~(1 << wbit)),\n this.strip()\n );\n }),\n (BN.prototype.iadd = function (num) {\n var r;\n if (this.negative !== 0 && num.negative === 0)\n return (this.negative = 0), (r = this.isub(num)), (this.negative ^= 1), this._normSign();\n if (this.negative === 0 && num.negative !== 0)\n return (num.negative = 0), (r = this.isub(num)), (num.negative = 1), r._normSign();\n var a, b;\n this.length > num.length ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var carry = 0, i = 0; i < b.length; i++)\n (r = (a.words[i] | 0) + (b.words[i] | 0) + carry), (this.words[i] = r & 67108863), (carry = r >>> 26);\n for (; carry !== 0 && i < a.length; i++)\n (r = (a.words[i] | 0) + carry), (this.words[i] = r & 67108863), (carry = r >>> 26);\n if (((this.length = a.length), carry !== 0)) (this.words[this.length] = carry), this.length++;\n else if (a !== this) for (; i < a.length; i++) this.words[i] = a.words[i];\n return this;\n }),\n (BN.prototype.add = function (num) {\n var res;\n return num.negative !== 0 && this.negative === 0\n ? ((num.negative = 0), (res = this.sub(num)), (num.negative ^= 1), res)\n : num.negative === 0 && this.negative !== 0\n ? ((this.negative = 0), (res = num.sub(this)), (this.negative = 1), res)\n : this.length > num.length\n ? this.clone().iadd(num)\n : num.clone().iadd(this);\n }),\n (BN.prototype.isub = function (num) {\n if (num.negative !== 0) {\n num.negative = 0;\n var r = this.iadd(num);\n return (num.negative = 1), r._normSign();\n } else if (this.negative !== 0)\n return (this.negative = 0), this.iadd(num), (this.negative = 1), this._normSign();\n var cmp = this.cmp(num);\n if (cmp === 0) return (this.negative = 0), (this.length = 1), (this.words[0] = 0), this;\n var a, b;\n cmp > 0 ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var carry = 0, i = 0; i < b.length; i++)\n (r = (a.words[i] | 0) - (b.words[i] | 0) + carry), (carry = r >> 26), (this.words[i] = r & 67108863);\n for (; carry !== 0 && i < a.length; i++)\n (r = (a.words[i] | 0) + carry), (carry = r >> 26), (this.words[i] = r & 67108863);\n if (carry === 0 && i < a.length && a !== this) for (; i < a.length; i++) this.words[i] = a.words[i];\n return (this.length = Math.max(this.length, i)), a !== this && (this.negative = 1), this.strip();\n }),\n (BN.prototype.sub = function (num) {\n return this.clone().isub(num);\n });\n function smallMulTo(self2, num, out) {\n out.negative = num.negative ^ self2.negative;\n var len = (self2.length + num.length) | 0;\n (out.length = len), (len = (len - 1) | 0);\n var a = self2.words[0] | 0,\n b = num.words[0] | 0,\n r = a * b,\n lo = r & 67108863,\n carry = (r / 67108864) | 0;\n out.words[0] = lo;\n for (var k = 1; k < len; k++) {\n for (\n var ncarry = carry >>> 26,\n rword = carry & 67108863,\n maxJ = Math.min(k, num.length - 1),\n j = Math.max(0, k - self2.length + 1);\n j <= maxJ;\n j++\n ) {\n var i = (k - j) | 0;\n (a = self2.words[i] | 0),\n (b = num.words[j] | 0),\n (r = a * b + rword),\n (ncarry += (r / 67108864) | 0),\n (rword = r & 67108863);\n }\n (out.words[k] = rword | 0), (carry = ncarry | 0);\n }\n return carry !== 0 ? (out.words[k] = carry | 0) : out.length--, out.strip();\n }\n var comb10MulTo = function (self2, num, out) {\n var a = self2.words,\n b = num.words,\n o = out.words,\n c = 0,\n lo,\n mid,\n hi,\n a0 = a[0] | 0,\n al0 = a0 & 8191,\n ah0 = a0 >>> 13,\n a1 = a[1] | 0,\n al1 = a1 & 8191,\n ah1 = a1 >>> 13,\n a2 = a[2] | 0,\n al2 = a2 & 8191,\n ah2 = a2 >>> 13,\n a3 = a[3] | 0,\n al3 = a3 & 8191,\n ah3 = a3 >>> 13,\n a4 = a[4] | 0,\n al4 = a4 & 8191,\n ah4 = a4 >>> 13,\n a5 = a[5] | 0,\n al5 = a5 & 8191,\n ah5 = a5 >>> 13,\n a6 = a[6] | 0,\n al6 = a6 & 8191,\n ah6 = a6 >>> 13,\n a7 = a[7] | 0,\n al7 = a7 & 8191,\n ah7 = a7 >>> 13,\n a8 = a[8] | 0,\n al8 = a8 & 8191,\n ah8 = a8 >>> 13,\n a9 = a[9] | 0,\n al9 = a9 & 8191,\n ah9 = a9 >>> 13,\n b0 = b[0] | 0,\n bl0 = b0 & 8191,\n bh0 = b0 >>> 13,\n b1 = b[1] | 0,\n bl1 = b1 & 8191,\n bh1 = b1 >>> 13,\n b2 = b[2] | 0,\n bl2 = b2 & 8191,\n bh2 = b2 >>> 13,\n b3 = b[3] | 0,\n bl3 = b3 & 8191,\n bh3 = b3 >>> 13,\n b4 = b[4] | 0,\n bl4 = b4 & 8191,\n bh4 = b4 >>> 13,\n b5 = b[5] | 0,\n bl5 = b5 & 8191,\n bh5 = b5 >>> 13,\n b6 = b[6] | 0,\n bl6 = b6 & 8191,\n bh6 = b6 >>> 13,\n b7 = b[7] | 0,\n bl7 = b7 & 8191,\n bh7 = b7 >>> 13,\n b8 = b[8] | 0,\n bl8 = b8 & 8191,\n bh8 = b8 >>> 13,\n b9 = b[9] | 0,\n bl9 = b9 & 8191,\n bh9 = b9 >>> 13;\n (out.negative = self2.negative ^ num.negative),\n (out.length = 19),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w0 >>> 26)) | 0),\n (w0 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w1 >>> 26)) | 0),\n (w1 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w2 >>> 26)) | 0),\n (w2 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w3 >>> 26)) | 0),\n (w3 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w4 >>> 26)) | 0),\n (w4 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w5 >>> 26)) | 0),\n (w5 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w6 >>> 26)) | 0),\n (w6 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w7 >>> 26)) | 0),\n (w7 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w8 >>> 26)) | 0),\n (w8 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w9 >>> 26)) | 0),\n (w9 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w10 >>> 26)) | 0),\n (w10 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w11 >>> 26)) | 0),\n (w11 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w12 >>> 26)) | 0),\n (w12 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w13 >>> 26)) | 0),\n (w13 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w14 >>> 26)) | 0),\n (w14 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w15 >>> 26)) | 0),\n (w15 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w16 >>> 26)) | 0),\n (w16 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w17 >>> 26)) | 0),\n (w17 &= 67108863),\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 & 8191) << 13)) | 0;\n return (\n (c = (((hi + (mid >>> 13)) | 0) + (w18 >>> 26)) | 0),\n (w18 &= 67108863),\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 c !== 0 && ((o[19] = c), out.length++),\n out\n );\n };\n Math.imul || (comb10MulTo = smallMulTo);\n function bigMulTo(self2, num, out) {\n (out.negative = num.negative ^ self2.negative), (out.length = self2.length + num.length);\n for (var carry = 0, hncarry = 0, k = 0; k < out.length - 1; k++) {\n var ncarry = hncarry;\n hncarry = 0;\n for (\n var rword = carry & 67108863, maxJ = Math.min(k, num.length - 1), j = Math.max(0, k - self2.length + 1);\n j <= maxJ;\n j++\n ) {\n var i = k - j,\n a = self2.words[i] | 0,\n b = num.words[j] | 0,\n r = a * b,\n lo = r & 67108863;\n (ncarry = (ncarry + ((r / 67108864) | 0)) | 0),\n (lo = (lo + rword) | 0),\n (rword = lo & 67108863),\n (ncarry = (ncarry + (lo >>> 26)) | 0),\n (hncarry += ncarry >>> 26),\n (ncarry &= 67108863);\n }\n (out.words[k] = rword), (carry = ncarry), (ncarry = hncarry);\n }\n return carry !== 0 ? (out.words[k] = carry) : out.length--, out.strip();\n }\n function jumboMulTo(self2, num, out) {\n var fftm = new FFTM();\n return fftm.mulp(self2, num, out);\n }\n BN.prototype.mulTo = function (num, out) {\n var res,\n len = this.length + num.length;\n return (\n this.length === 10 && num.length === 10\n ? (res = comb10MulTo(this, num, out))\n : len < 63\n ? (res = smallMulTo(this, num, out))\n : len < 1024\n ? (res = bigMulTo(this, num, out))\n : (res = jumboMulTo(this, num, out)),\n res\n );\n };\n function FFTM(x, y) {\n (this.x = x), (this.y = y);\n }\n (FFTM.prototype.makeRBT = function (N) {\n for (var t = new Array(N), l = BN.prototype._countBits(N) - 1, i = 0; i < N; i++) t[i] = this.revBin(i, l, N);\n return t;\n }),\n (FFTM.prototype.revBin = function (x, l, N) {\n if (x === 0 || x === N - 1) return x;\n for (var rb = 0, i = 0; i < l; i++) (rb |= (x & 1) << (l - i - 1)), (x >>= 1);\n return rb;\n }),\n (FFTM.prototype.permute = function (rbt, rws, iws, rtws, itws, N) {\n for (var i = 0; i < N; i++) (rtws[i] = rws[rbt[i]]), (itws[i] = iws[rbt[i]]);\n }),\n (FFTM.prototype.transform = function (rws, iws, rtws, itws, N, rbt) {\n this.permute(rbt, rws, iws, rtws, itws, N);\n for (var s = 1; s < N; s <<= 1)\n for (\n var l = s << 1, rtwdf = Math.cos((2 * Math.PI) / l), itwdf = Math.sin((2 * Math.PI) / l), p = 0;\n p < N;\n p += l\n )\n for (var rtwdf_ = rtwdf, itwdf_ = itwdf, j = 0; j < s; j++) {\n var re = rtws[p + j],\n ie = itws[p + j],\n ro = rtws[p + j + s],\n io = itws[p + j + s],\n rx = rtwdf_ * ro - itwdf_ * io;\n (io = rtwdf_ * io + itwdf_ * ro),\n (ro = rx),\n (rtws[p + j] = re + ro),\n (itws[p + j] = ie + io),\n (rtws[p + j + s] = re - ro),\n (itws[p + j + s] = ie - io),\n j !== l &&\n ((rx = rtwdf * rtwdf_ - itwdf * itwdf_), (itwdf_ = rtwdf * itwdf_ + itwdf * rtwdf_), (rtwdf_ = rx));\n }\n }),\n (FFTM.prototype.guessLen13b = function (n, m) {\n var N = Math.max(m, n) | 1,\n odd = N & 1,\n i = 0;\n for (N = (N / 2) | 0; N; N = N >>> 1) i++;\n return 1 << (i + 1 + odd);\n }),\n (FFTM.prototype.conjugate = function (rws, iws, N) {\n if (!(N <= 1))\n for (var i = 0; i < N / 2; i++) {\n var t = rws[i];\n (rws[i] = rws[N - i - 1]),\n (rws[N - i - 1] = t),\n (t = iws[i]),\n (iws[i] = -iws[N - i - 1]),\n (iws[N - i - 1] = -t);\n }\n }),\n (FFTM.prototype.normalize13b = function (ws, N) {\n for (var carry = 0, i = 0; i < N / 2; i++) {\n var w = Math.round(ws[2 * i + 1] / N) * 8192 + Math.round(ws[2 * i] / N) + carry;\n (ws[i] = w & 67108863), w < 67108864 ? (carry = 0) : (carry = (w / 67108864) | 0);\n }\n return ws;\n }),\n (FFTM.prototype.convert13b = function (ws, len, rws, N) {\n for (var carry = 0, i = 0; i < len; i++)\n (carry = carry + (ws[i] | 0)),\n (rws[2 * i] = carry & 8191),\n (carry = carry >>> 13),\n (rws[2 * i + 1] = carry & 8191),\n (carry = carry >>> 13);\n for (i = 2 * len; i < N; ++i) rws[i] = 0;\n assert(carry === 0), assert((carry & -8192) === 0);\n }),\n (FFTM.prototype.stub = function (N) {\n for (var ph = new Array(N), i = 0; i < N; i++) ph[i] = 0;\n return ph;\n }),\n (FFTM.prototype.mulp = function (x, y, out) {\n var N = 2 * this.guessLen13b(x.length, y.length),\n rbt = this.makeRBT(N),\n _ = this.stub(N),\n rws = new Array(N),\n rwst = new Array(N),\n iwst = new Array(N),\n nrws = new Array(N),\n nrwst = new Array(N),\n niwst = new Array(N),\n rmws = out.words;\n (rmws.length = N),\n this.convert13b(x.words, x.length, rws, N),\n this.convert13b(y.words, y.length, nrws, N),\n this.transform(rws, _, rwst, iwst, N, rbt),\n this.transform(nrws, _, nrwst, niwst, N, rbt);\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]), (rwst[i] = rx);\n }\n return (\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 (out.negative = x.negative ^ y.negative),\n (out.length = x.length + y.length),\n out.strip()\n );\n }),\n (BN.prototype.mul = function (num) {\n var out = new BN(null);\n return (out.words = new Array(this.length + num.length)), this.mulTo(num, out);\n }),\n (BN.prototype.mulf = function (num) {\n var out = new BN(null);\n return (out.words = new Array(this.length + num.length)), jumboMulTo(this, num, out);\n }),\n (BN.prototype.imul = function (num) {\n return this.clone().mulTo(num, this);\n }),\n (BN.prototype.imuln = function (num) {\n assert(typeof num == \"number\"), assert(num < 67108864);\n for (var carry = 0, i = 0; i < this.length; i++) {\n var w = (this.words[i] | 0) * num,\n lo = (w & 67108863) + (carry & 67108863);\n (carry >>= 26), (carry += (w / 67108864) | 0), (carry += lo >>> 26), (this.words[i] = lo & 67108863);\n }\n return carry !== 0 && ((this.words[i] = carry), this.length++), this;\n }),\n (BN.prototype.muln = function (num) {\n return this.clone().imuln(num);\n }),\n (BN.prototype.sqr = function () {\n return this.mul(this);\n }),\n (BN.prototype.isqr = function () {\n return this.imul(this.clone());\n }),\n (BN.prototype.pow = function (num) {\n var w = toBitArray(num);\n if (w.length === 0) return new BN(1);\n for (var res = this, i = 0; i < w.length && w[i] === 0; i++, res = res.sqr());\n if (++i < w.length) for (var q = res.sqr(); i < w.length; i++, q = q.sqr()) w[i] !== 0 && (res = res.mul(q));\n return res;\n }),\n (BN.prototype.iushln = function (bits) {\n assert(typeof bits == \"number\" && bits >= 0);\n var r = bits % 26,\n s = (bits - r) / 26,\n carryMask = (67108863 >>> (26 - r)) << (26 - r),\n i;\n if (r !== 0) {\n var carry = 0;\n for (i = 0; i < this.length; i++) {\n var newCarry = this.words[i] & carryMask,\n c = ((this.words[i] | 0) - newCarry) << r;\n (this.words[i] = c | carry), (carry = newCarry >>> (26 - r));\n }\n carry && ((this.words[i] = carry), this.length++);\n }\n if (s !== 0) {\n for (i = this.length - 1; i >= 0; i--) this.words[i + s] = this.words[i];\n for (i = 0; i < s; i++) this.words[i] = 0;\n this.length += s;\n }\n return this.strip();\n }),\n (BN.prototype.ishln = function (bits) {\n return assert(this.negative === 0), this.iushln(bits);\n }),\n (BN.prototype.iushrn = function (bits, hint, extended) {\n assert(typeof bits == \"number\" && bits >= 0);\n var h;\n hint ? (h = (hint - (hint % 26)) / 26) : (h = 0);\n var r = bits % 26,\n s = Math.min((bits - r) / 26, this.length),\n mask = 67108863 ^ ((67108863 >>> r) << r),\n maskedWords = extended;\n if (((h -= s), (h = Math.max(0, h)), maskedWords)) {\n for (var i = 0; i < s; i++) maskedWords.words[i] = this.words[i];\n maskedWords.length = s;\n }\n if (s !== 0)\n if (this.length > s) for (this.length -= s, i = 0; i < this.length; i++) this.words[i] = this.words[i + s];\n else (this.words[0] = 0), (this.length = 1);\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)), (carry = word & mask);\n }\n return (\n maskedWords && carry !== 0 && (maskedWords.words[maskedWords.length++] = carry),\n this.length === 0 && ((this.words[0] = 0), (this.length = 1)),\n this.strip()\n );\n }),\n (BN.prototype.ishrn = function (bits, hint, extended) {\n return assert(this.negative === 0), this.iushrn(bits, hint, extended);\n }),\n (BN.prototype.shln = function (bits) {\n return this.clone().ishln(bits);\n }),\n (BN.prototype.ushln = function (bits) {\n return this.clone().iushln(bits);\n }),\n (BN.prototype.shrn = function (bits) {\n return this.clone().ishrn(bits);\n }),\n (BN.prototype.ushrn = function (bits) {\n return this.clone().iushrn(bits);\n }),\n (BN.prototype.testn = function (bit) {\n assert(typeof bit == \"number\" && bit >= 0);\n var r = bit % 26,\n s = (bit - r) / 26,\n q = 1 << r;\n if (this.length <= s) return !1;\n var w = this.words[s];\n return !!(w & q);\n }),\n (BN.prototype.imaskn = function (bits) {\n assert(typeof bits == \"number\" && bits >= 0);\n var r = bits % 26,\n s = (bits - r) / 26;\n if ((assert(this.negative === 0, \"imaskn works only with positive numbers\"), this.length <= s)) return this;\n if ((r !== 0 && s++, (this.length = Math.min(s, this.length)), r !== 0)) {\n var mask = 67108863 ^ ((67108863 >>> r) << r);\n this.words[this.length - 1] &= mask;\n }\n return this.strip();\n }),\n (BN.prototype.maskn = function (bits) {\n return this.clone().imaskn(bits);\n }),\n (BN.prototype.iaddn = function (num) {\n return (\n assert(typeof num == \"number\"),\n assert(num < 67108864),\n num < 0\n ? this.isubn(-num)\n : this.negative !== 0\n ? this.length === 1 && (this.words[0] | 0) < num\n ? ((this.words[0] = num - (this.words[0] | 0)), (this.negative = 0), this)\n : ((this.negative = 0), this.isubn(num), (this.negative = 1), this)\n : this._iaddn(num)\n );\n }),\n (BN.prototype._iaddn = function (num) {\n this.words[0] += num;\n for (var i = 0; i < this.length && this.words[i] >= 67108864; i++)\n (this.words[i] -= 67108864), i === this.length - 1 ? (this.words[i + 1] = 1) : this.words[i + 1]++;\n return (this.length = Math.max(this.length, i + 1)), this;\n }),\n (BN.prototype.isubn = function (num) {\n if ((assert(typeof num == \"number\"), assert(num < 67108864), num < 0)) return this.iaddn(-num);\n if (this.negative !== 0) return (this.negative = 0), this.iaddn(num), (this.negative = 1), this;\n if (((this.words[0] -= num), this.length === 1 && this.words[0] < 0))\n (this.words[0] = -this.words[0]), (this.negative = 1);\n else\n for (var i = 0; i < this.length && this.words[i] < 0; i++)\n (this.words[i] += 67108864), (this.words[i + 1] -= 1);\n return this.strip();\n }),\n (BN.prototype.addn = function (num) {\n return this.clone().iaddn(num);\n }),\n (BN.prototype.subn = function (num) {\n return this.clone().isubn(num);\n }),\n (BN.prototype.iabs = function () {\n return (this.negative = 0), this;\n }),\n (BN.prototype.abs = function () {\n return this.clone().iabs();\n }),\n (BN.prototype._ishlnsubmul = function (num, mul, shift) {\n var len = num.length + shift,\n i;\n this._expand(len);\n var w,\n 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 & 67108863),\n (carry = (w >> 26) - ((right / 67108864) | 0)),\n (this.words[i + shift] = w & 67108863);\n }\n for (; i < this.length - shift; i++)\n (w = (this.words[i + shift] | 0) + carry), (carry = w >> 26), (this.words[i + shift] = w & 67108863);\n if (carry === 0) return this.strip();\n for (assert(carry === -1), carry = 0, i = 0; i < this.length; i++)\n (w = -(this.words[i] | 0) + carry), (carry = w >> 26), (this.words[i] = w & 67108863);\n return (this.negative = 1), this.strip();\n }),\n (BN.prototype._wordDiv = function (num, mode) {\n var shift = this.length - num.length,\n a = this.clone(),\n b = num,\n bhi = b.words[b.length - 1] | 0,\n bhiBits = this._countBits(bhi);\n (shift = 26 - bhiBits),\n shift !== 0 && ((b = b.ushln(shift)), a.iushln(shift), (bhi = b.words[b.length - 1] | 0));\n var m = a.length - b.length,\n q;\n if (mode !== \"mod\") {\n (q = new BN(null)), (q.length = m + 1), (q.words = new Array(q.length));\n for (var i = 0; i < q.length; i++) q.words[i] = 0;\n }\n var diff = a.clone()._ishlnsubmul(b, 1, m);\n diff.negative === 0 && ((a = diff), q && (q.words[m] = 1));\n for (var j = m - 1; j >= 0; j--) {\n var qj = (a.words[b.length + j] | 0) * 67108864 + (a.words[b.length + j - 1] | 0);\n for (qj = Math.min((qj / bhi) | 0, 67108863), a._ishlnsubmul(b, qj, j); a.negative !== 0; )\n qj--, (a.negative = 0), a._ishlnsubmul(b, 1, j), a.isZero() || (a.negative ^= 1);\n q && (q.words[j] = qj);\n }\n return (\n q && q.strip(),\n a.strip(),\n mode !== \"div\" && shift !== 0 && a.iushrn(shift),\n {\n div: q || null,\n mod: a,\n }\n );\n }),\n (BN.prototype.divmod = function (num, mode, positive) {\n if ((assert(!num.isZero()), this.isZero()))\n return {\n div: new BN(0),\n mod: new BN(0),\n };\n var div, mod, res;\n return this.negative !== 0 && num.negative === 0\n ? ((res = this.neg().divmod(num, mode)),\n mode !== \"mod\" && (div = res.div.neg()),\n mode !== \"div\" && ((mod = res.mod.neg()), positive && mod.negative !== 0 && mod.iadd(num)),\n {\n div,\n mod,\n })\n : this.negative === 0 && num.negative !== 0\n ? ((res = this.divmod(num.neg(), mode)),\n mode !== \"mod\" && (div = res.div.neg()),\n {\n div,\n mod: res.mod,\n })\n : (this.negative & num.negative) !== 0\n ? ((res = this.neg().divmod(num.neg(), mode)),\n mode !== \"div\" && ((mod = res.mod.neg()), positive && mod.negative !== 0 && mod.isub(num)),\n {\n div: res.div,\n mod,\n })\n : num.length > this.length || this.cmp(num) < 0\n ? {\n div: new BN(0),\n mod: this,\n }\n : num.length === 1\n ? mode === \"div\"\n ? {\n div: this.divn(num.words[0]),\n mod: null,\n }\n : mode === \"mod\"\n ? {\n div: null,\n mod: new BN(this.modn(num.words[0])),\n }\n : {\n div: this.divn(num.words[0]),\n mod: new BN(this.modn(num.words[0])),\n }\n : this._wordDiv(num, mode);\n }),\n (BN.prototype.div = function (num) {\n return this.divmod(num, \"div\", !1).div;\n }),\n (BN.prototype.mod = function (num) {\n return this.divmod(num, \"mod\", !1).mod;\n }),\n (BN.prototype.umod = function (num) {\n return this.divmod(num, \"mod\", !0).mod;\n }),\n (BN.prototype.divRound = function (num) {\n var dm = this.divmod(num);\n if (dm.mod.isZero()) return dm.div;\n var mod = dm.div.negative !== 0 ? dm.mod.isub(num) : dm.mod,\n half = num.ushrn(1),\n r2 = num.andln(1),\n cmp = mod.cmp(half);\n return cmp < 0 || (r2 === 1 && cmp === 0)\n ? dm.div\n : dm.div.negative !== 0\n ? dm.div.isubn(1)\n : dm.div.iaddn(1);\n }),\n (BN.prototype.modn = function (num) {\n assert(num <= 67108863);\n for (var p = (1 << 26) % num, acc = 0, i = this.length - 1; i >= 0; i--)\n acc = (p * acc + (this.words[i] | 0)) % num;\n return acc;\n }),\n (BN.prototype.idivn = function (num) {\n assert(num <= 67108863);\n for (var carry = 0, i = this.length - 1; i >= 0; i--) {\n var w = (this.words[i] | 0) + carry * 67108864;\n (this.words[i] = (w / num) | 0), (carry = w % num);\n }\n return this.strip();\n }),\n (BN.prototype.divn = function (num) {\n return this.clone().idivn(num);\n }),\n (BN.prototype.egcd = function (p) {\n assert(p.negative === 0), assert(!p.isZero());\n var x = this,\n y = p.clone();\n x.negative !== 0 ? (x = x.umod(p)) : (x = x.clone());\n for (var A = new BN(1), B = new BN(0), C = new BN(0), D = new BN(1), g = 0; x.isEven() && y.isEven(); )\n x.iushrn(1), y.iushrn(1), ++g;\n for (var yp = y.clone(), xp = x.clone(); !x.isZero(); ) {\n for (var i = 0, im = 1; (x.words[0] & im) === 0 && i < 26; ++i, im <<= 1);\n if (i > 0)\n for (x.iushrn(i); i-- > 0; )\n (A.isOdd() || B.isOdd()) && (A.iadd(yp), B.isub(xp)), A.iushrn(1), B.iushrn(1);\n for (var j = 0, jm = 1; (y.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n if (j > 0)\n for (y.iushrn(j); j-- > 0; )\n (C.isOdd() || D.isOdd()) && (C.iadd(yp), D.isub(xp)), C.iushrn(1), D.iushrn(1);\n x.cmp(y) >= 0 ? (x.isub(y), A.isub(C), B.isub(D)) : (y.isub(x), C.isub(A), D.isub(B));\n }\n return {\n a: C,\n b: D,\n gcd: y.iushln(g),\n };\n }),\n (BN.prototype._invmp = function (p) {\n assert(p.negative === 0), assert(!p.isZero());\n var a = this,\n b = p.clone();\n a.negative !== 0 ? (a = a.umod(p)) : (a = a.clone());\n for (var x1 = new BN(1), x2 = new BN(0), delta = b.clone(); 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) for (a.iushrn(i); i-- > 0; ) x1.isOdd() && x1.iadd(delta), x1.iushrn(1);\n for (var j = 0, jm = 1; (b.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n if (j > 0) for (b.iushrn(j); j-- > 0; ) x2.isOdd() && x2.iadd(delta), x2.iushrn(1);\n a.cmp(b) >= 0 ? (a.isub(b), x1.isub(x2)) : (b.isub(a), x2.isub(x1));\n }\n var res;\n return a.cmpn(1) === 0 ? (res = x1) : (res = x2), res.cmpn(0) < 0 && res.iadd(p), res;\n }),\n (BN.prototype.gcd = function (num) {\n if (this.isZero()) return num.abs();\n if (num.isZero()) return this.abs();\n var a = this.clone(),\n b = num.clone();\n (a.negative = 0), (b.negative = 0);\n for (var shift = 0; a.isEven() && b.isEven(); shift++) a.iushrn(1), b.iushrn(1);\n do {\n for (; a.isEven(); ) a.iushrn(1);\n for (; b.isEven(); ) b.iushrn(1);\n var r = a.cmp(b);\n if (r < 0) {\n var t = a;\n (a = b), (b = t);\n } else if (r === 0 || b.cmpn(1) === 0) break;\n a.isub(b);\n } while (!0);\n return b.iushln(shift);\n }),\n (BN.prototype.invm = function (num) {\n return this.egcd(num).a.umod(num);\n }),\n (BN.prototype.isEven = function () {\n return (this.words[0] & 1) === 0;\n }),\n (BN.prototype.isOdd = function () {\n return (this.words[0] & 1) === 1;\n }),\n (BN.prototype.andln = function (num) {\n return this.words[0] & num;\n }),\n (BN.prototype.bincn = function (bit) {\n assert(typeof bit == \"number\");\n var r = bit % 26,\n s = (bit - r) / 26,\n q = 1 << r;\n if (this.length <= s) return this._expand(s + 1), (this.words[s] |= q), this;\n for (var carry = q, i = s; carry !== 0 && i < this.length; i++) {\n var w = this.words[i] | 0;\n (w += carry), (carry = w >>> 26), (w &= 67108863), (this.words[i] = w);\n }\n return carry !== 0 && ((this.words[i] = carry), this.length++), this;\n }),\n (BN.prototype.isZero = function () {\n return this.length === 1 && this.words[0] === 0;\n }),\n (BN.prototype.cmpn = function (num) {\n var negative = num < 0;\n if (this.negative !== 0 && !negative) return -1;\n if (this.negative === 0 && negative) return 1;\n this.strip();\n var res;\n if (this.length > 1) res = 1;\n else {\n negative && (num = -num), assert(num <= 67108863, \"Number is too big\");\n var w = this.words[0] | 0;\n res = w === num ? 0 : w < num ? -1 : 1;\n }\n return this.negative !== 0 ? -res | 0 : res;\n }),\n (BN.prototype.cmp = function (num) {\n if (this.negative !== 0 && num.negative === 0) return -1;\n if (this.negative === 0 && num.negative !== 0) return 1;\n var res = this.ucmp(num);\n return this.negative !== 0 ? -res | 0 : res;\n }),\n (BN.prototype.ucmp = function (num) {\n if (this.length > num.length) return 1;\n if (this.length < num.length) return -1;\n for (var res = 0, i = this.length - 1; i >= 0; i--) {\n var a = this.words[i] | 0,\n b = num.words[i] | 0;\n if (a !== b) {\n a < b ? (res = -1) : a > b && (res = 1);\n break;\n }\n }\n return res;\n }),\n (BN.prototype.gtn = function (num) {\n return this.cmpn(num) === 1;\n }),\n (BN.prototype.gt = function (num) {\n return this.cmp(num) === 1;\n }),\n (BN.prototype.gten = function (num) {\n return this.cmpn(num) >= 0;\n }),\n (BN.prototype.gte = function (num) {\n return this.cmp(num) >= 0;\n }),\n (BN.prototype.ltn = function (num) {\n return this.cmpn(num) === -1;\n }),\n (BN.prototype.lt = function (num) {\n return this.cmp(num) === -1;\n }),\n (BN.prototype.lten = function (num) {\n return this.cmpn(num) <= 0;\n }),\n (BN.prototype.lte = function (num) {\n return this.cmp(num) <= 0;\n }),\n (BN.prototype.eqn = function (num) {\n return this.cmpn(num) === 0;\n }),\n (BN.prototype.eq = function (num) {\n return this.cmp(num) === 0;\n }),\n (BN.red = function (num) {\n return new Red(num);\n }),\n (BN.prototype.toRed = function (ctx) {\n return (\n assert(!this.red, \"Already a number in reduction context\"),\n assert(this.negative === 0, \"red works only with positives\"),\n ctx.convertTo(this)._forceRed(ctx)\n );\n }),\n (BN.prototype.fromRed = function () {\n return assert(this.red, \"fromRed works only with numbers in reduction context\"), this.red.convertFrom(this);\n }),\n (BN.prototype._forceRed = function (ctx) {\n return (this.red = ctx), this;\n }),\n (BN.prototype.forceRed = function (ctx) {\n return assert(!this.red, \"Already a number in reduction context\"), this._forceRed(ctx);\n }),\n (BN.prototype.redAdd = function (num) {\n return assert(this.red, \"redAdd works only with red numbers\"), this.red.add(this, num);\n }),\n (BN.prototype.redIAdd = function (num) {\n return assert(this.red, \"redIAdd works only with red numbers\"), this.red.iadd(this, num);\n }),\n (BN.prototype.redSub = function (num) {\n return assert(this.red, \"redSub works only with red numbers\"), this.red.sub(this, num);\n }),\n (BN.prototype.redISub = function (num) {\n return assert(this.red, \"redISub works only with red numbers\"), this.red.isub(this, num);\n }),\n (BN.prototype.redShl = function (num) {\n return assert(this.red, \"redShl works only with red numbers\"), this.red.shl(this, num);\n }),\n (BN.prototype.redMul = function (num) {\n return (\n assert(this.red, \"redMul works only with red numbers\"),\n this.red._verify2(this, num),\n this.red.mul(this, num)\n );\n }),\n (BN.prototype.redIMul = function (num) {\n return (\n assert(this.red, \"redMul works only with red numbers\"),\n this.red._verify2(this, num),\n this.red.imul(this, num)\n );\n }),\n (BN.prototype.redSqr = function () {\n return assert(this.red, \"redSqr works only with red numbers\"), this.red._verify1(this), this.red.sqr(this);\n }),\n (BN.prototype.redISqr = function () {\n return assert(this.red, \"redISqr works only with red numbers\"), this.red._verify1(this), this.red.isqr(this);\n }),\n (BN.prototype.redSqrt = function () {\n return assert(this.red, \"redSqrt works only with red numbers\"), this.red._verify1(this), this.red.sqrt(this);\n }),\n (BN.prototype.redInvm = function () {\n return assert(this.red, \"redInvm works only with red numbers\"), this.red._verify1(this), this.red.invm(this);\n }),\n (BN.prototype.redNeg = function () {\n return assert(this.red, \"redNeg works only with red numbers\"), this.red._verify1(this), this.red.neg(this);\n }),\n (BN.prototype.redPow = function (num) {\n return assert(this.red && !num.red, \"redPow(normalNum)\"), this.red._verify1(this), this.red.pow(this, num);\n });\n var primes = {\n k256: null,\n p224: null,\n p192: null,\n p25519: null,\n };\n function MPrime(name, p) {\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 (this.tmp = this._tmp());\n }\n (MPrime.prototype._tmp = function () {\n var tmp = new BN(null);\n return (tmp.words = new Array(Math.ceil(this.n / 13))), tmp;\n }),\n (MPrime.prototype.ireduce = function (num) {\n var r = num,\n rlen;\n do this.split(r, this.tmp), (r = this.imulK(r)), (r = r.iadd(this.tmp)), (rlen = r.bitLength());\n while (rlen > this.n);\n var cmp = rlen < this.n ? -1 : r.ucmp(this.p);\n return (\n cmp === 0\n ? ((r.words[0] = 0), (r.length = 1))\n : cmp > 0\n ? r.isub(this.p)\n : r.strip !== void 0\n ? r.strip()\n : r._strip(),\n r\n );\n }),\n (MPrime.prototype.split = function (input, out) {\n input.iushrn(this.n, 0, out);\n }),\n (MPrime.prototype.imulK = function (num) {\n return num.imul(this.k);\n });\n function K256() {\n MPrime.call(this, \"k256\", \"ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f\");\n }\n inherits(K256, MPrime),\n (K256.prototype.split = function (input, output) {\n for (var mask = 4194303, outLen = Math.min(input.length, 9), i = 0; i < outLen; i++)\n output.words[i] = input.words[i];\n if (((output.length = outLen), input.length <= 9)) {\n (input.words[0] = 0), (input.length = 1);\n return;\n }\n var prev = input.words[9];\n for (output.words[output.length++] = prev & mask, i = 10; i < input.length; i++) {\n var next = input.words[i] | 0;\n (input.words[i - 10] = ((next & mask) << 4) | (prev >>> 22)), (prev = next);\n }\n (prev >>>= 22),\n (input.words[i - 10] = prev),\n prev === 0 && input.length > 10 ? (input.length -= 10) : (input.length -= 9);\n }),\n (K256.prototype.imulK = function (num) {\n (num.words[num.length] = 0), (num.words[num.length + 1] = 0), (num.length += 2);\n for (var lo = 0, i = 0; i < num.length; i++) {\n var w = num.words[i] | 0;\n (lo += w * 977), (num.words[i] = lo & 67108863), (lo = w * 64 + ((lo / 67108864) | 0));\n }\n return (\n num.words[num.length - 1] === 0 && (num.length--, num.words[num.length - 1] === 0 && num.length--), num\n );\n });\n function P224() {\n MPrime.call(this, \"p224\", \"ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001\");\n }\n inherits(P224, MPrime);\n function P192() {\n MPrime.call(this, \"p192\", \"ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff\");\n }\n inherits(P192, MPrime);\n function P25519() {\n MPrime.call(this, \"25519\", \"7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed\");\n }\n inherits(P25519, MPrime),\n (P25519.prototype.imulK = function (num) {\n for (var carry = 0, i = 0; i < num.length; i++) {\n var hi = (num.words[i] | 0) * 19 + carry,\n lo = hi & 67108863;\n (hi >>>= 26), (num.words[i] = lo), (carry = hi);\n }\n return carry !== 0 && (num.words[num.length++] = carry), num;\n }),\n (BN._prime = function (name) {\n if (primes[name]) return primes[name];\n var prime2;\n if (name === \"k256\") prime2 = new K256();\n else if (name === \"p224\") prime2 = new P224();\n else if (name === \"p192\") prime2 = new P192();\n else if (name === \"p25519\") prime2 = new P25519();\n else throw new Error(\"Unknown prime \" + name);\n return (primes[name] = prime2), prime2;\n });\n function Red(m) {\n if (typeof m == \"string\") {\n var prime = BN._prime(m);\n (this.m = prime.p), (this.prime = prime);\n } else assert(m.gtn(1), \"modulus must be greater than 1\"), (this.m = m), (this.prime = null);\n }\n (Red.prototype._verify1 = function (a) {\n assert(a.negative === 0, \"red works only with positives\"), assert(a.red, \"red works only with red numbers\");\n }),\n (Red.prototype._verify2 = function (a, b) {\n assert((a.negative | b.negative) === 0, \"red works only with positives\"),\n assert(a.red && a.red === b.red, \"red works only with red numbers\");\n }),\n (Red.prototype.imod = function (a) {\n return this.prime ? this.prime.ireduce(a)._forceRed(this) : a.umod(this.m)._forceRed(this);\n }),\n (Red.prototype.neg = function (a) {\n return a.isZero() ? a.clone() : this.m.sub(a)._forceRed(this);\n }),\n (Red.prototype.add = function (a, b) {\n this._verify2(a, b);\n var res = a.add(b);\n return res.cmp(this.m) >= 0 && res.isub(this.m), res._forceRed(this);\n }),\n (Red.prototype.iadd = function (a, b) {\n this._verify2(a, b);\n var res = a.iadd(b);\n return res.cmp(this.m) >= 0 && res.isub(this.m), res;\n }),\n (Red.prototype.sub = function (a, b) {\n this._verify2(a, b);\n var res = a.sub(b);\n return res.cmpn(0) < 0 && res.iadd(this.m), res._forceRed(this);\n }),\n (Red.prototype.isub = function (a, b) {\n this._verify2(a, b);\n var res = a.isub(b);\n return res.cmpn(0) < 0 && res.iadd(this.m), res;\n }),\n (Red.prototype.shl = function (a, num) {\n return this._verify1(a), this.imod(a.ushln(num));\n }),\n (Red.prototype.imul = function (a, b) {\n return this._verify2(a, b), this.imod(a.imul(b));\n }),\n (Red.prototype.mul = function (a, b) {\n return this._verify2(a, b), this.imod(a.mul(b));\n }),\n (Red.prototype.isqr = function (a) {\n return this.imul(a, a.clone());\n }),\n (Red.prototype.sqr = function (a) {\n return this.mul(a, a);\n }),\n (Red.prototype.sqrt = function (a) {\n if (a.isZero()) return a.clone();\n var mod3 = this.m.andln(3);\n if ((assert(mod3 % 2 === 1), mod3 === 3)) {\n var pow = this.m.add(new BN(1)).iushrn(2);\n return this.pow(a, pow);\n }\n for (var q = this.m.subn(1), s = 0; !q.isZero() && q.andln(1) === 0; ) s++, q.iushrn(1);\n assert(!q.isZero());\n var one = new BN(1).toRed(this),\n nOne = one.redNeg(),\n lpow = this.m.subn(1).iushrn(1),\n z = this.m.bitLength();\n for (z = new BN(2 * z * z).toRed(this); this.pow(z, lpow).cmp(nOne) !== 0; ) z.redIAdd(nOne);\n for (\n var c = this.pow(z, q), r = this.pow(a, q.addn(1).iushrn(1)), t = this.pow(a, q), m = s;\n t.cmp(one) !== 0;\n\n ) {\n for (var tmp = t, i = 0; tmp.cmp(one) !== 0; i++) tmp = tmp.redSqr();\n assert(i < m);\n var b = this.pow(c, new BN(1).iushln(m - i - 1));\n (r = r.redMul(b)), (c = b.redSqr()), (t = t.redMul(c)), (m = i);\n }\n return r;\n }),\n (Red.prototype.invm = function (a) {\n var inv = a._invmp(this.m);\n return inv.negative !== 0 ? ((inv.negative = 0), this.imod(inv).redNeg()) : this.imod(inv);\n }),\n (Red.prototype.pow = function (a, num) {\n if (num.isZero()) return new BN(1).toRed(this);\n if (num.cmpn(1) === 0) return a.clone();\n var windowSize = 4,\n wnd = new Array(1 << windowSize);\n (wnd[0] = new BN(1).toRed(this)), (wnd[1] = a);\n for (var i = 2; i < wnd.length; i++) wnd[i] = this.mul(wnd[i - 1], a);\n var res = wnd[0],\n current = 0,\n currentLen = 0,\n start = num.bitLength() % 26;\n for (start === 0 && (start = 26), i = num.length - 1; i >= 0; i--) {\n for (var word = num.words[i], j = start - 1; j >= 0; j--) {\n var bit = (word >> j) & 1;\n if ((res !== wnd[0] && (res = this.sqr(res)), bit === 0 && current === 0)) {\n currentLen = 0;\n continue;\n }\n (current <<= 1),\n (current |= bit),\n currentLen++,\n !(currentLen !== windowSize && (i !== 0 || j !== 0)) &&\n ((res = this.mul(res, wnd[current])), (currentLen = 0), (current = 0));\n }\n start = 26;\n }\n return res;\n }),\n (Red.prototype.convertTo = function (num) {\n var r = num.umod(this.m);\n return r === num ? r.clone() : r;\n }),\n (Red.prototype.convertFrom = function (num) {\n var res = num.clone();\n return (res.red = null), res;\n }),\n (BN.mont = function (num) {\n return new Mont(num);\n });\n function Mont(m) {\n Red.call(this, m),\n (this.shift = this.m.bitLength()),\n this.shift % 26 !== 0 && (this.shift += 26 - (this.shift % 26)),\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 (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 (Mont.prototype.convertTo = function (num) {\n return this.imod(num.ushln(this.shift));\n }),\n (Mont.prototype.convertFrom = function (num) {\n var r = this.imod(num.mul(this.rinv));\n return (r.red = null), r;\n }),\n (Mont.prototype.imul = function (a, b) {\n if (a.isZero() || b.isZero()) return (a.words[0] = 0), (a.length = 1), a;\n var t = a.imul(b),\n c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m),\n u = t.isub(c).iushrn(this.shift),\n res = u;\n return (\n u.cmp(this.m) >= 0 ? (res = u.isub(this.m)) : u.cmpn(0) < 0 && (res = u.iadd(this.m)), res._forceRed(this)\n );\n }),\n (Mont.prototype.mul = function (a, b) {\n if (a.isZero() || b.isZero()) return new BN(0)._forceRed(this);\n var t = a.mul(b),\n c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m),\n u = t.isub(c).iushrn(this.shift),\n res = u;\n return (\n u.cmp(this.m) >= 0 ? (res = u.isub(this.m)) : u.cmpn(0) < 0 && (res = u.iadd(this.m)), res._forceRed(this)\n );\n }),\n (Mont.prototype.invm = function (a) {\n var res = this.imod(a._invmp(this.m).mul(this.r2));\n return res._forceRed(this);\n });\n })(typeof module > \"u\" || module, exports);\n },\n});\n\n// (disabled):node_modules/crypto-browserify/index.js\nvar require_crypto_browserify = __commonJS({\n \"(disabled):node_modules/crypto-browserify/index.js\"() {},\n});\n\n// node_modules/brorand/index.js\nvar require_brorand = __commonJS({\n \"node_modules/brorand/index.js\"(exports, module) {\n var r;\n module.exports = function (len) {\n return r || (r = new Rand(null)), r.generate(len);\n };\n function Rand(rand) {\n this.rand = rand;\n }\n module.exports.Rand = Rand;\n Rand.prototype.generate = function (len) {\n return this._rand(len);\n };\n Rand.prototype._rand = function (n) {\n var out = new Buffer(n);\n crypto.getRandomValues(out);\n return out;\n };\n },\n});\n\n// node_modules/miller-rabin/lib/mr.js\nvar require_mr = __commonJS({\n \"node_modules/miller-rabin/lib/mr.js\"(exports, module) {\n var bn = require_bn2(),\n brorand = require_brorand();\n function MillerRabin(rand) {\n this.rand = rand || new brorand.Rand();\n }\n module.exports = MillerRabin;\n MillerRabin.create = function (rand) {\n return new MillerRabin(rand);\n };\n MillerRabin.prototype._randbelow = function (n) {\n var len = n.bitLength(),\n min_bytes = Math.ceil(len / 8);\n do var a = new bn(this.rand.generate(min_bytes));\n while (a.cmp(n) >= 0);\n return a;\n };\n MillerRabin.prototype._randrange = function (start, stop) {\n var size = stop.sub(start);\n return start.add(this._randbelow(size));\n };\n MillerRabin.prototype.test = function (n, k, cb) {\n var len = n.bitLength(),\n red = bn.mont(n),\n rone = new bn(1).toRed(red);\n k || (k = Math.max(1, (len / 48) | 0));\n for (var n1 = n.subn(1), s = 0; !n1.testn(s); s++);\n for (var d = n.shrn(s), rn1 = n1.toRed(red), prime = !0; k > 0; k--) {\n var a = this._randrange(new bn(2), n1);\n cb && cb(a);\n var x = a.toRed(red).redPow(d);\n if (!(x.cmp(rone) === 0 || x.cmp(rn1) === 0)) {\n for (var i = 1; i < s; i++) {\n if (((x = x.redSqr()), x.cmp(rone) === 0)) return !1;\n if (x.cmp(rn1) === 0) break;\n }\n if (i === s) return !1;\n }\n }\n return prime;\n };\n MillerRabin.prototype.getDivisor = function (n, k) {\n var len = n.bitLength(),\n red = bn.mont(n),\n rone = new bn(1).toRed(red);\n k || (k = Math.max(1, (len / 48) | 0));\n for (var n1 = n.subn(1), s = 0; !n1.testn(s); s++);\n for (var d = n.shrn(s), rn1 = n1.toRed(red); k > 0; k--) {\n var a = this._randrange(new bn(2), n1),\n g = n.gcd(a);\n if (g.cmpn(1) !== 0) return g;\n var x = a.toRed(red).redPow(d);\n if (!(x.cmp(rone) === 0 || x.cmp(rn1) === 0)) {\n for (var i = 1; i < s; i++) {\n if (((x = x.redSqr()), x.cmp(rone) === 0)) return x.fromRed().subn(1).gcd(n);\n if (x.cmp(rn1) === 0) break;\n }\n if (i === s) return (x = x.redSqr()), x.fromRed().subn(1).gcd(n);\n }\n }\n return !1;\n };\n },\n});\n\n// node_modules/diffie-hellman/lib/generatePrime.js\nvar require_generatePrime = __commonJS({\n \"node_modules/diffie-hellman/lib/generatePrime.js\"(exports, module) {\n var randomBytes = require_browser();\n module.exports = findPrime;\n findPrime.simpleSieve = simpleSieve;\n findPrime.fermatTest = fermatTest;\n var BN = require_bn(),\n TWENTYFOUR = new BN(24),\n MillerRabin = require_mr(),\n millerRabin = new MillerRabin(),\n ONE = new BN(1),\n TWO = new BN(2),\n FIVE = new BN(5),\n SIXTEEN = new BN(16),\n EIGHT = new BN(8),\n TEN = new BN(10),\n THREE = new BN(3),\n SEVEN = new BN(7),\n ELEVEN = new BN(11),\n FOUR = new BN(4),\n TWELVE = new BN(12),\n primes = null;\n function _getPrimes() {\n if (primes !== null) return primes;\n var limit = 1048576,\n res = [];\n res[0] = 2;\n for (var i = 1, k = 3; k < limit; k += 2) {\n for (var sqrt = Math.ceil(Math.sqrt(k)), j = 0; j < i && res[j] <= sqrt && k % res[j] !== 0; j++);\n (i !== j && res[j] <= sqrt) || (res[i++] = k);\n }\n return (primes = res), res;\n }\n function simpleSieve(p) {\n for (var primes2 = _getPrimes(), i = 0; i < primes2.length; i++)\n if (p.modn(primes2[i]) === 0) return p.cmpn(primes2[i]) === 0;\n return !0;\n }\n function fermatTest(p) {\n var red = BN.mont(p);\n return TWO.toRed(red).redPow(p.subn(1)).fromRed().cmpn(1) === 0;\n }\n function findPrime(bits, gen) {\n if (bits < 16) return gen === 2 || gen === 5 ? new BN([140, 123]) : new BN([140, 39]);\n gen = new BN(gen);\n for (var num, n2; ; ) {\n for (num = new BN(randomBytes(Math.ceil(bits / 8))); num.bitLength() > bits; ) num.ishrn(1);\n if ((num.isEven() && num.iadd(ONE), num.testn(1) || num.iadd(TWO), gen.cmp(TWO))) {\n if (!gen.cmp(FIVE)) for (; num.mod(TEN).cmp(THREE); ) num.iadd(FOUR);\n } else for (; num.mod(TWENTYFOUR).cmp(ELEVEN); ) num.iadd(FOUR);\n if (\n ((n2 = num.shrn(1)),\n simpleSieve(n2) &&\n simpleSieve(num) &&\n fermatTest(n2) &&\n fermatTest(num) &&\n millerRabin.test(n2) &&\n millerRabin.test(num))\n )\n return num;\n }\n }\n },\n});\n\n// node_modules/diffie-hellman/lib/primes.json\nvar require_primes = __commonJS({\n \"node_modules/diffie-hellman/lib/primes.json\"(exports, module) {\n module.exports = {\n modp1: {\n gen: \"02\",\n prime:\n \"ffffffffffffffffc90fdaa22168c234c4c6628b80dc1cd129024e088a67cc74020bbea63b139b22514a08798e3404ddef9519b3cd3a431b302b0a6df25f14374fe1356d6d51c245e485b576625e7ec6f44c42e9a63a3620ffffffffffffffff\",\n },\n modp2: {\n gen: \"02\",\n prime:\n \"ffffffffffffffffc90fdaa22168c234c4c6628b80dc1cd129024e088a67cc74020bbea63b139b22514a08798e3404ddef9519b3cd3a431b302b0a6df25f14374fe1356d6d51c245e485b576625e7ec6f44c42e9a637ed6b0bff5cb6f406b7edee386bfb5a899fa5ae9f24117c4b1fe649286651ece65381ffffffffffffffff\",\n },\n modp5: {\n gen: \"02\",\n prime:\n \"ffffffffffffffffc90fdaa22168c234c4c6628b80dc1cd129024e088a67cc74020bbea63b139b22514a08798e3404ddef9519b3cd3a431b302b0a6df25f14374fe1356d6d51c245e485b576625e7ec6f44c42e9a637ed6b0bff5cb6f406b7edee386bfb5a899fa5ae9f24117c4b1fe649286651ece45b3dc2007cb8a163bf0598da48361c55d39a69163fa8fd24cf5f83655d23dca3ad961c62f356208552bb9ed529077096966d670c354e4abc9804f1746c08ca237327ffffffffffffffff\",\n },\n modp14: {\n gen: \"02\",\n prime:\n \"ffffffffffffffffc90fdaa22168c234c4c6628b80dc1cd129024e088a67cc74020bbea63b139b22514a08798e3404ddef9519b3cd3a431b302b0a6df25f14374fe1356d6d51c245e485b576625e7ec6f44c42e9a637ed6b0bff5cb6f406b7edee386bfb5a899fa5ae9f24117c4b1fe649286651ece45b3dc2007cb8a163bf0598da48361c55d39a69163fa8fd24cf5f83655d23dca3ad961c62f356208552bb9ed529077096966d670c354e4abc9804f1746c08ca18217c32905e462e36ce3be39e772c180e86039b2783a2ec07a28fb5c55df06f4c52c9de2bcbf6955817183995497cea956ae515d2261898fa051015728e5a8aacaa68ffffffffffffffff\",\n },\n modp15: {\n gen: \"02\",\n prime:\n \"ffffffffffffffffc90fdaa22168c234c4c6628b80dc1cd129024e088a67cc74020bbea63b139b22514a08798e3404ddef9519b3cd3a431b302b0a6df25f14374fe1356d6d51c245e485b576625e7ec6f44c42e9a637ed6b0bff5cb6f406b7edee386bfb5a899fa5ae9f24117c4b1fe649286651ece45b3dc2007cb8a163bf0598da48361c55d39a69163fa8fd24cf5f83655d23dca3ad961c62f356208552bb9ed529077096966d670c354e4abc9804f1746c08ca18217c32905e462e36ce3be39e772c180e86039b2783a2ec07a28fb5c55df06f4c52c9de2bcbf6955817183995497cea956ae515d2261898fa051015728e5a8aaac42dad33170d04507a33a85521abdf1cba64ecfb850458dbef0a8aea71575d060c7db3970f85a6e1e4c7abf5ae8cdb0933d71e8c94e04a25619dcee3d2261ad2ee6bf12ffa06d98a0864d87602733ec86a64521f2b18177b200cbbe117577a615d6c770988c0bad946e208e24fa074e5ab3143db5bfce0fd108e4b82d120a93ad2caffffffffffffffff\",\n },\n modp16: {\n gen: \"02\",\n prime:\n \"ffffffffffffffffc90fdaa22168c234c4c6628b80dc1cd129024e088a67cc74020bbea63b139b22514a08798e3404ddef9519b3cd3a431b302b0a6df25f14374fe1356d6d51c245e485b576625e7ec6f44c42e9a637ed6b0bff5cb6f406b7edee386bfb5a899fa5ae9f24117c4b1fe649286651ece45b3dc2007cb8a163bf0598da48361c55d39a69163fa8fd24cf5f83655d23dca3ad961c62f356208552bb9ed529077096966d670c354e4abc9804f1746c08ca18217c32905e462e36ce3be39e772c180e86039b2783a2ec07a28fb5c55df06f4c52c9de2bcbf6955817183995497cea956ae515d2261898fa051015728e5a8aaac42dad33170d04507a33a85521abdf1cba64ecfb850458dbef0a8aea71575d060c7db3970f85a6e1e4c7abf5ae8cdb0933d71e8c94e04a25619dcee3d2261ad2ee6bf12ffa06d98a0864d87602733ec86a64521f2b18177b200cbbe117577a615d6c770988c0bad946e208e24fa074e5ab3143db5bfce0fd108e4b82d120a92108011a723c12a787e6d788719a10bdba5b2699c327186af4e23c1a946834b6150bda2583e9ca2ad44ce8dbbbc2db04de8ef92e8efc141fbecaa6287c59474e6bc05d99b2964fa090c3a2233ba186515be7ed1f612970cee2d7afb81bdd762170481cd0069127d5b05aa993b4ea988d8fddc186ffb7dc90a6c08f4df435c934063199ffffffffffffffff\",\n },\n modp17: {\n gen: \"02\",\n prime:\n \"ffffffffffffffffc90fdaa22168c234c4c6628b80dc1cd129024e088a67cc74020bbea63b139b22514a08798e3404ddef9519b3cd3a431b302b0a6df25f14374fe1356d6d51c245e485b576625e7ec6f44c42e9a637ed6b0bff5cb6f406b7edee386bfb5a899fa5ae9f24117c4b1fe649286651ece45b3dc2007cb8a163bf0598da48361c55d39a69163fa8fd24cf5f83655d23dca3ad961c62f356208552bb9ed529077096966d670c354e4abc9804f1746c08ca18217c32905e462e36ce3be39e772c180e86039b2783a2ec07a28fb5c55df06f4c52c9de2bcbf6955817183995497cea956ae515d2261898fa051015728e5a8aaac42dad33170d04507a33a85521abdf1cba64ecfb850458dbef0a8aea71575d060c7db3970f85a6e1e4c7abf5ae8cdb0933d71e8c94e04a25619dcee3d2261ad2ee6bf12ffa06d98a0864d87602733ec86a64521f2b18177b200cbbe117577a615d6c770988c0bad946e208e24fa074e5ab3143db5bfce0fd108e4b82d120a92108011a723c12a787e6d788719a10bdba5b2699c327186af4e23c1a946834b6150bda2583e9ca2ad44ce8dbbbc2db04de8ef92e8efc141fbecaa6287c59474e6bc05d99b2964fa090c3a2233ba186515be7ed1f612970cee2d7afb81bdd762170481cd0069127d5b05aa993b4ea988d8fddc186ffb7dc90a6c08f4df435c93402849236c3fab4d27c7026c1d4dcb2602646dec9751e763dba37bdf8ff9406ad9e530ee5db382f413001aeb06a53ed9027d831179727b0865a8918da3edbebcf9b14ed44ce6cbaced4bb1bdb7f1447e6cc254b332051512bd7af426fb8f401378cd2bf5983ca01c64b92ecf032ea15d1721d03f482d7ce6e74fef6d55e702f46980c82b5a84031900b1c9e59e7c97fbec7e8f323a97a7e36cc88be0f1d45b7ff585ac54bd407b22b4154aacc8f6d7ebf48e1d814cc5ed20f8037e0a79715eef29be32806a1d58bb7c5da76f550aa3d8a1fbff0eb19ccb1a313d55cda56c9ec2ef29632387fe8d76e3c0468043e8f663f4860ee12bf2d5b0b7474d6e694f91e6dcc4024ffffffffffffffff\",\n },\n modp18: {\n gen: \"02\",\n prime:\n \"ffffffffffffffffc90fdaa22168c234c4c6628b80dc1cd129024e088a67cc74020bbea63b139b22514a08798e3404ddef9519b3cd3a431b302b0a6df25f14374fe1356d6d51c245e485b576625e7ec6f44c42e9a637ed6b0bff5cb6f406b7edee386bfb5a899fa5ae9f24117c4b1fe649286651ece45b3dc2007cb8a163bf0598da48361c55d39a69163fa8fd24cf5f83655d23dca3ad961c62f356208552bb9ed529077096966d670c354e4abc9804f1746c08ca18217c32905e462e36ce3be39e772c180e86039b2783a2ec07a28fb5c55df06f4c52c9de2bcbf6955817183995497cea956ae515d2261898fa051015728e5a8aaac42dad33170d04507a33a85521abdf1cba64ecfb850458dbef0a8aea71575d060c7db3970f85a6e1e4c7abf5ae8cdb0933d71e8c94e04a25619dcee3d2261ad2ee6bf12ffa06d98a0864d87602733ec86a64521f2b18177b200cbbe117577a615d6c770988c0bad946e208e24fa074e5ab3143db5bfce0fd108e4b82d120a92108011a723c12a787e6d788719a10bdba5b2699c327186af4e23c1a946834b6150bda2583e9ca2ad44ce8dbbbc2db04de8ef92e8efc141fbecaa6287c59474e6bc05d99b2964fa090c3a2233ba186515be7ed1f612970cee2d7afb81bdd762170481cd0069127d5b05aa993b4ea988d8fddc186ffb7dc90a6c08f4df435c93402849236c3fab4d27c7026c1d4dcb2602646dec9751e763dba37bdf8ff9406ad9e530ee5db382f413001aeb06a53ed9027d831179727b0865a8918da3edbebcf9b14ed44ce6cbaced4bb1bdb7f1447e6cc254b332051512bd7af426fb8f401378cd2bf5983ca01c64b92ecf032ea15d1721d03f482d7ce6e74fef6d55e702f46980c82b5a84031900b1c9e59e7c97fbec7e8f323a97a7e36cc88be0f1d45b7ff585ac54bd407b22b4154aacc8f6d7ebf48e1d814cc5ed20f8037e0a79715eef29be32806a1d58bb7c5da76f550aa3d8a1fbff0eb19ccb1a313d55cda56c9ec2ef29632387fe8d76e3c0468043e8f663f4860ee12bf2d5b0b7474d6e694f91e6dbe115974a3926f12fee5e438777cb6a932df8cd8bec4d073b931ba3bc832b68d9dd300741fa7bf8afc47ed2576f6936ba424663aab639c5ae4f5683423b4742bf1c978238f16cbe39d652de3fdb8befc848ad922222e04a4037c0713eb57a81a23f0c73473fc646cea306b4bcbc8862f8385ddfa9d4b7fa2c087e879683303ed5bdd3a062b3cf5b3a278a66d2a13f83f44f82ddf310ee074ab6a364597e899a0255dc164f31cc50846851df9ab48195ded7ea1b1d510bd7ee74d73faf36bc31ecfa268359046f4eb879f924009438b481c6cd7889a002ed5ee382bc9190da6fc026e479558e4475677e9aa9e3050e2765694dfc81f56e880b96e7160c980dd98edd3dfffffffffffffffff\",\n },\n };\n },\n});\n\n// node_modules/diffie-hellman/lib/dh.js\nvar require_dh = __commonJS({\n \"node_modules/diffie-hellman/lib/dh.js\"(exports, module) {\n var BN = require_bn(),\n MillerRabin = require_mr(),\n millerRabin = new MillerRabin(),\n TWENTYFOUR = new BN(24),\n ELEVEN = new BN(11),\n TEN = new BN(10),\n THREE = new BN(3),\n SEVEN = new BN(7),\n primes = require_generatePrime(),\n randomBytes = require_browser();\n module.exports = DH;\n function setPublicKey(pub, enc) {\n return (\n (enc = enc || \"utf8\"), Buffer.isBuffer(pub) || (pub = new Buffer(pub, enc)), (this._pub = new BN(pub)), this\n );\n }\n function setPrivateKey(priv, enc) {\n return (\n (enc = enc || \"utf8\"),\n Buffer.isBuffer(priv) || (priv = new Buffer(priv, enc)),\n (this._priv = new BN(priv)),\n this\n );\n }\n var primeCache = {};\n function checkPrime(prime, generator) {\n var gen = generator.toString(\"hex\"),\n hex = [gen, prime.toString(16)].join(\"_\");\n if (hex in primeCache) return primeCache[hex];\n var error = 0;\n if (prime.isEven() || !primes.simpleSieve || !primes.fermatTest(prime) || !millerRabin.test(prime))\n return (\n (error += 1), gen === \"02\" || gen === \"05\" ? (error += 8) : (error += 4), (primeCache[hex] = error), error\n );\n millerRabin.test(prime.shrn(1)) || (error += 2);\n var rem;\n switch (gen) {\n case \"02\":\n prime.mod(TWENTYFOUR).cmp(ELEVEN) && (error += 8);\n break;\n case \"05\":\n (rem = prime.mod(TEN)), rem.cmp(THREE) && rem.cmp(SEVEN) && (error += 8);\n break;\n default:\n error += 4;\n }\n return (primeCache[hex] = error), error;\n }\n function DH(prime, generator, malleable) {\n this.setGenerator(generator),\n (this.__prime = new BN(prime)),\n (this._prime = BN.mont(this.__prime)),\n (this._primeLen = prime.length),\n (this._pub = void 0),\n (this._priv = void 0),\n (this._primeCode = void 0),\n malleable ? ((this.setPublicKey = setPublicKey), (this.setPrivateKey = setPrivateKey)) : (this._primeCode = 8);\n }\n Object.defineProperty(DH.prototype, \"verifyError\", {\n enumerable: !0,\n get: function () {\n return (\n typeof this._primeCode != \"number\" && (this._primeCode = checkPrime(this.__prime, this.__gen)),\n this._primeCode\n );\n },\n });\n DH.prototype.generateKeys = function () {\n return (\n this._priv || (this._priv = new BN(randomBytes(this._primeLen))),\n (this._pub = this._gen.toRed(this._prime).redPow(this._priv).fromRed()),\n this.getPublicKey()\n );\n };\n DH.prototype.computeSecret = function (other) {\n (other = new BN(other)), (other = other.toRed(this._prime));\n var secret = other.redPow(this._priv).fromRed(),\n out = new Buffer(secret.toArray()),\n prime = this.getPrime();\n if (out.length < prime.length) {\n var front = new Buffer(prime.length - out.length);\n front.fill(0), (out = Buffer.concat([front, out]));\n }\n return out;\n };\n DH.prototype.getPublicKey = function (enc) {\n return formatReturnValue(this._pub, enc);\n };\n DH.prototype.getPrivateKey = function (enc) {\n return formatReturnValue(this._priv, enc);\n };\n DH.prototype.getPrime = function (enc) {\n return formatReturnValue(this.__prime, enc);\n };\n DH.prototype.getGenerator = function (enc) {\n return formatReturnValue(this._gen, enc);\n };\n DH.prototype.setGenerator = function (gen, enc) {\n return (\n (enc = enc || \"utf8\"),\n Buffer.isBuffer(gen) || (gen = new Buffer(gen, enc)),\n (this.__gen = gen),\n (this._gen = new BN(gen)),\n this\n );\n };\n function formatReturnValue(bn, enc) {\n var buf = new Buffer(bn.toArray());\n return enc ? buf.toString(enc) : buf;\n }\n },\n});\n\n// node_modules/diffie-hellman/browser.js\nvar require_browser7 = __commonJS({\n \"node_modules/diffie-hellman/browser.js\"(exports) {\n var generatePrime = require_generatePrime(),\n primes = require_primes(),\n DH = require_dh();\n function getDiffieHellman(mod) {\n var prime = new Buffer(primes[mod].prime, \"hex\"),\n gen = new Buffer(primes[mod].gen, \"hex\");\n return new DH(prime, gen);\n }\n var ENCODINGS = {\n binary: !0,\n hex: !0,\n base64: !0,\n };\n function createDiffieHellman(prime, enc, generator, genc) {\n return Buffer.isBuffer(enc) || ENCODINGS[enc] === void 0\n ? createDiffieHellman(prime, \"binary\", enc, generator)\n : ((enc = enc || \"binary\"),\n (genc = genc || \"binary\"),\n (generator = generator || new Buffer([2])),\n Buffer.isBuffer(generator) || (generator = new Buffer(generator, genc)),\n typeof prime == \"number\"\n ? new DH(generatePrime(prime, generator), generator, !0)\n : (Buffer.isBuffer(prime) || (prime = new Buffer(prime, enc)), new DH(prime, generator, !0)));\n }\n exports.DiffieHellmanGroup = exports.createDiffieHellmanGroup = exports.getDiffieHellman = getDiffieHellman;\n exports.createDiffieHellman = exports.DiffieHellman = createDiffieHellman;\n },\n});\n\n// node_modules/bn.js/lib/bn.js\nvar require_bn3 = __commonJS({\n \"node_modules/bn.js/lib/bn.js\"(exports, module) {\n (function (module2, exports2) {\n \"use strict\";\n function assert(val, msg) {\n if (!val) throw new Error(msg || \"Assertion failed\");\n }\n function inherits(ctor, superCtor) {\n ctor.super_ = superCtor;\n var TempCtor = function () {};\n (TempCtor.prototype = superCtor.prototype),\n (ctor.prototype = new TempCtor()),\n (ctor.prototype.constructor = ctor);\n }\n function BN(number, base, endian) {\n if (BN.isBN(number)) return number;\n (this.negative = 0),\n (this.words = null),\n (this.length = 0),\n (this.red = null),\n number !== null &&\n ((base === \"le\" || base === \"be\") && ((endian = base), (base = 10)),\n this._init(number || 0, base || 10, endian || \"be\"));\n }\n typeof module2 == \"object\" ? (module2.exports = BN) : (exports2.BN = BN), (BN.BN = BN), (BN.wordSize = 26);\n var Buffer2;\n try {\n typeof window < \"u\" && typeof window.Buffer < \"u\"\n ? (Buffer2 = window.Buffer)\n : (Buffer2 = __require(\"buffer\").Buffer);\n } catch {}\n (BN.isBN = function (num) {\n return num instanceof BN\n ? !0\n : num !== null &&\n typeof num == \"object\" &&\n num.constructor.wordSize === BN.wordSize &&\n Array.isArray(num.words);\n }),\n (BN.max = function (left, right) {\n return left.cmp(right) > 0 ? left : right;\n }),\n (BN.min = function (left, right) {\n return left.cmp(right) < 0 ? left : right;\n }),\n (BN.prototype._init = function (number, base, endian) {\n if (typeof number == \"number\") return this._initNumber(number, base, endian);\n if (typeof number == \"object\") return this._initArray(number, base, endian);\n base === \"hex\" && (base = 16),\n assert(base === (base | 0) && base >= 2 && base <= 36),\n (number = number.toString().replace(/\\s+/g, \"\"));\n var start = 0;\n number[0] === \"-\" && (start++, (this.negative = 1)),\n start < number.length &&\n (base === 16\n ? this._parseHex(number, start, endian)\n : (this._parseBase(number, base, start),\n endian === \"le\" && this._initArray(this.toArray(), base, endian)));\n }),\n (BN.prototype._initNumber = function (number, base, endian) {\n number < 0 && ((this.negative = 1), (number = -number)),\n number < 67108864\n ? ((this.words = [number & 67108863]), (this.length = 1))\n : number < 4503599627370496\n ? ((this.words = [number & 67108863, (number / 67108864) & 67108863]), (this.length = 2))\n : (assert(number < 9007199254740992),\n (this.words = [number & 67108863, (number / 67108864) & 67108863, 1]),\n (this.length = 3)),\n endian === \"le\" && this._initArray(this.toArray(), base, endian);\n }),\n (BN.prototype._initArray = function (number, base, endian) {\n if ((assert(typeof number.length == \"number\"), number.length <= 0))\n return (this.words = [0]), (this.length = 1), this;\n (this.length = Math.ceil(number.length / 3)), (this.words = new Array(this.length));\n for (var i = 0; i < this.length; i++) this.words[i] = 0;\n var j,\n w,\n off = 0;\n if (endian === \"be\")\n for (i = number.length - 1, j = 0; i >= 0; i -= 3)\n (w = number[i] | (number[i - 1] << 8) | (number[i - 2] << 16)),\n (this.words[j] |= (w << off) & 67108863),\n (this.words[j + 1] = (w >>> (26 - off)) & 67108863),\n (off += 24),\n off >= 26 && ((off -= 26), j++);\n else if (endian === \"le\")\n for (i = 0, j = 0; i < number.length; i += 3)\n (w = number[i] | (number[i + 1] << 8) | (number[i + 2] << 16)),\n (this.words[j] |= (w << off) & 67108863),\n (this.words[j + 1] = (w >>> (26 - off)) & 67108863),\n (off += 24),\n off >= 26 && ((off -= 26), j++);\n return this._strip();\n });\n function parseHex4Bits(string, index) {\n var c = string.charCodeAt(index);\n if (c >= 48 && c <= 57) return c - 48;\n if (c >= 65 && c <= 70) return c - 55;\n if (c >= 97 && c <= 102) return c - 87;\n assert(!1, \"Invalid character in \" + string);\n }\n function parseHexByte(string, lowerBound, index) {\n var r = parseHex4Bits(string, index);\n return index - 1 >= lowerBound && (r |= parseHex4Bits(string, index - 1) << 4), r;\n }\n BN.prototype._parseHex = function (number, start, endian) {\n (this.length = Math.ceil((number.length - start) / 6)), (this.words = new Array(this.length));\n for (var i = 0; i < this.length; i++) this.words[i] = 0;\n var off = 0,\n j = 0,\n w;\n if (endian === \"be\")\n for (i = number.length - 1; i >= start; i -= 2)\n (w = parseHexByte(number, start, i) << off),\n (this.words[j] |= w & 67108863),\n off >= 18 ? ((off -= 18), (j += 1), (this.words[j] |= w >>> 26)) : (off += 8);\n else {\n var parseLength = number.length - start;\n for (i = parseLength % 2 === 0 ? start + 1 : start; i < number.length; i += 2)\n (w = parseHexByte(number, start, i) << off),\n (this.words[j] |= w & 67108863),\n off >= 18 ? ((off -= 18), (j += 1), (this.words[j] |= w >>> 26)) : (off += 8);\n }\n this._strip();\n };\n function parseBase(str, start, end, mul) {\n for (var r = 0, b = 0, len = Math.min(str.length, end), i = start; i < len; i++) {\n var c = str.charCodeAt(i) - 48;\n (r *= mul),\n c >= 49 ? (b = c - 49 + 10) : c >= 17 ? (b = c - 17 + 10) : (b = c),\n assert(c >= 0 && b < mul, \"Invalid character\"),\n (r += b);\n }\n return r;\n }\n (BN.prototype._parseBase = function (number, base, start) {\n (this.words = [0]), (this.length = 1);\n for (var limbLen = 0, limbPow = 1; limbPow <= 67108863; limbPow *= base) limbLen++;\n limbLen--, (limbPow = (limbPow / base) | 0);\n for (\n var total = number.length - start,\n mod = total % limbLen,\n end = Math.min(total, total - mod) + start,\n word = 0,\n i = start;\n i < end;\n i += limbLen\n )\n (word = parseBase(number, i, i + limbLen, base)),\n this.imuln(limbPow),\n this.words[0] + word < 67108864 ? (this.words[0] += word) : this._iaddn(word);\n if (mod !== 0) {\n var pow = 1;\n for (word = parseBase(number, i, number.length, base), i = 0; i < mod; i++) pow *= base;\n this.imuln(pow), this.words[0] + word < 67108864 ? (this.words[0] += word) : this._iaddn(word);\n }\n this._strip();\n }),\n (BN.prototype.copy = function (dest) {\n dest.words = new Array(this.length);\n for (var i = 0; i < this.length; i++) dest.words[i] = this.words[i];\n (dest.length = this.length), (dest.negative = this.negative), (dest.red = this.red);\n });\n function move(dest, src) {\n (dest.words = src.words), (dest.length = src.length), (dest.negative = src.negative), (dest.red = src.red);\n }\n if (\n ((BN.prototype._move = function (dest) {\n move(dest, this);\n }),\n (BN.prototype.clone = function () {\n var r = new BN(null);\n return this.copy(r), r;\n }),\n (BN.prototype._expand = function (size) {\n for (; this.length < size; ) this.words[this.length++] = 0;\n return this;\n }),\n (BN.prototype._strip = function () {\n for (; this.length > 1 && this.words[this.length - 1] === 0; ) this.length--;\n return this._normSign();\n }),\n (BN.prototype._normSign = function () {\n return this.length === 1 && this.words[0] === 0 && (this.negative = 0), this;\n }),\n typeof Symbol < \"u\" && typeof Symbol.for == \"function\")\n )\n try {\n BN.prototype[Symbol.for(\"nodejs.util.inspect.custom\")] = inspect;\n } catch {\n BN.prototype.inspect = inspect;\n }\n else BN.prototype.inspect = inspect;\n function inspect() {\n return (this.red ? \"<BN-R: \" : \"<BN: \") + this.toString(16) + \">\";\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 groupSizes = [\n 0, 0, 25, 16, 12, 11, 10, 9, 8, 8, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5,\n 5, 5,\n ],\n groupBases = [\n 0, 0, 33554432, 43046721, 16777216, 48828125, 60466176, 40353607, 16777216, 43046721, 1e7, 19487171, 35831808,\n 62748517, 7529536, 11390625, 16777216, 24137569, 34012224, 47045881, 64e6, 4084101, 5153632, 6436343, 7962624,\n 9765625, 11881376, 14348907, 17210368, 20511149, 243e5, 28629151, 33554432, 39135393, 45435424, 52521875,\n 60466176,\n ];\n (BN.prototype.toString = function (base, padding) {\n (base = base || 10), (padding = padding | 0 || 1);\n var out;\n if (base === 16 || base === \"hex\") {\n out = \"\";\n for (var off = 0, carry = 0, i = 0; i < this.length; i++) {\n var w = this.words[i],\n word = (((w << off) | carry) & 16777215).toString(16);\n (carry = (w >>> (24 - off)) & 16777215),\n (off += 2),\n off >= 26 && ((off -= 26), i--),\n carry !== 0 || i !== this.length - 1 ? (out = zeros[6 - word.length] + word + out) : (out = word + out);\n }\n for (carry !== 0 && (out = carry.toString(16) + out); out.length % padding !== 0; ) out = \"0\" + out;\n return this.negative !== 0 && (out = \"-\" + out), out;\n }\n if (base === (base | 0) && base >= 2 && base <= 36) {\n var groupSize = groupSizes[base],\n groupBase = groupBases[base];\n out = \"\";\n var c = this.clone();\n for (c.negative = 0; !c.isZero(); ) {\n var r = c.modrn(groupBase).toString(base);\n (c = c.idivn(groupBase)), c.isZero() ? (out = r + out) : (out = zeros[groupSize - r.length] + r + out);\n }\n for (this.isZero() && (out = \"0\" + out); out.length % padding !== 0; ) out = \"0\" + out;\n return this.negative !== 0 && (out = \"-\" + out), out;\n }\n assert(!1, \"Base should be between 2 and 36\");\n }),\n (BN.prototype.toNumber = function () {\n var ret = this.words[0];\n return (\n this.length === 2\n ? (ret += this.words[1] * 67108864)\n : this.length === 3 && this.words[2] === 1\n ? (ret += 4503599627370496 + this.words[1] * 67108864)\n : this.length > 2 && assert(!1, \"Number can only safely store up to 53 bits\"),\n this.negative !== 0 ? -ret : ret\n );\n }),\n (BN.prototype.toJSON = function () {\n return this.toString(16, 2);\n }),\n Buffer2 &&\n (BN.prototype.toBuffer = function (endian, length) {\n return this.toArrayLike(Buffer2, endian, length);\n }),\n (BN.prototype.toArray = function (endian, length) {\n return this.toArrayLike(Array, endian, length);\n });\n var allocate = function (ArrayType, size) {\n return ArrayType.allocUnsafe ? ArrayType.allocUnsafe(size) : new ArrayType(size);\n };\n (BN.prototype.toArrayLike = function (ArrayType, endian, length) {\n this._strip();\n var byteLength = this.byteLength(),\n 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 var res = allocate(ArrayType, reqLength),\n postfix = endian === \"le\" ? \"LE\" : \"BE\";\n return this[\"_toArrayLike\" + postfix](res, byteLength), res;\n }),\n (BN.prototype._toArrayLikeLE = function (res, byteLength) {\n for (var position = 0, carry = 0, i = 0, shift = 0; i < this.length; i++) {\n var word = (this.words[i] << shift) | carry;\n (res[position++] = word & 255),\n position < res.length && (res[position++] = (word >> 8) & 255),\n position < res.length && (res[position++] = (word >> 16) & 255),\n shift === 6\n ? (position < res.length && (res[position++] = (word >> 24) & 255), (carry = 0), (shift = 0))\n : ((carry = word >>> 24), (shift += 2));\n }\n if (position < res.length) for (res[position++] = carry; position < res.length; ) res[position++] = 0;\n }),\n (BN.prototype._toArrayLikeBE = function (res, byteLength) {\n for (var position = res.length - 1, carry = 0, i = 0, shift = 0; i < this.length; i++) {\n var word = (this.words[i] << shift) | carry;\n (res[position--] = word & 255),\n position >= 0 && (res[position--] = (word >> 8) & 255),\n position >= 0 && (res[position--] = (word >> 16) & 255),\n shift === 6\n ? (position >= 0 && (res[position--] = (word >> 24) & 255), (carry = 0), (shift = 0))\n : ((carry = word >>> 24), (shift += 2));\n }\n if (position >= 0) for (res[position--] = carry; position >= 0; ) res[position--] = 0;\n }),\n Math.clz32\n ? (BN.prototype._countBits = function (w) {\n return 32 - Math.clz32(w);\n })\n : (BN.prototype._countBits = function (w) {\n var t = w,\n r = 0;\n return (\n t >= 4096 && ((r += 13), (t >>>= 13)),\n t >= 64 && ((r += 7), (t >>>= 7)),\n t >= 8 && ((r += 4), (t >>>= 4)),\n t >= 2 && ((r += 2), (t >>>= 2)),\n r + t\n );\n }),\n (BN.prototype._zeroBits = function (w) {\n if (w === 0) return 26;\n var t = w,\n r = 0;\n return (\n (t & 8191) === 0 && ((r += 13), (t >>>= 13)),\n (t & 127) === 0 && ((r += 7), (t >>>= 7)),\n (t & 15) === 0 && ((r += 4), (t >>>= 4)),\n (t & 3) === 0 && ((r += 2), (t >>>= 2)),\n (t & 1) === 0 && r++,\n r\n );\n }),\n (BN.prototype.bitLength = function () {\n var w = this.words[this.length - 1],\n hi = this._countBits(w);\n return (this.length - 1) * 26 + hi;\n });\n function toBitArray(num) {\n for (var w = new Array(num.bitLength()), bit = 0; bit < w.length; bit++) {\n var off = (bit / 26) | 0,\n wbit = bit % 26;\n w[bit] = (num.words[off] >>> wbit) & 1;\n }\n return w;\n }\n (BN.prototype.zeroBits = function () {\n if (this.isZero()) return 0;\n for (var r = 0, i = 0; i < this.length; i++) {\n var b = this._zeroBits(this.words[i]);\n if (((r += b), b !== 26)) break;\n }\n return r;\n }),\n (BN.prototype.byteLength = function () {\n return Math.ceil(this.bitLength() / 8);\n }),\n (BN.prototype.toTwos = function (width) {\n return this.negative !== 0 ? this.abs().inotn(width).iaddn(1) : this.clone();\n }),\n (BN.prototype.fromTwos = function (width) {\n return this.testn(width - 1) ? this.notn(width).iaddn(1).ineg() : this.clone();\n }),\n (BN.prototype.isNeg = function () {\n return this.negative !== 0;\n }),\n (BN.prototype.neg = function () {\n return this.clone().ineg();\n }),\n (BN.prototype.ineg = function () {\n return this.isZero() || (this.negative ^= 1), this;\n }),\n (BN.prototype.iuor = function (num) {\n for (; this.length < num.length; ) this.words[this.length++] = 0;\n for (var i = 0; i < num.length; i++) this.words[i] = this.words[i] | num.words[i];\n return this._strip();\n }),\n (BN.prototype.ior = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuor(num);\n }),\n (BN.prototype.or = function (num) {\n return this.length > num.length ? this.clone().ior(num) : num.clone().ior(this);\n }),\n (BN.prototype.uor = function (num) {\n return this.length > num.length ? this.clone().iuor(num) : num.clone().iuor(this);\n }),\n (BN.prototype.iuand = function (num) {\n var b;\n this.length > num.length ? (b = num) : (b = this);\n for (var i = 0; i < b.length; i++) this.words[i] = this.words[i] & num.words[i];\n return (this.length = b.length), this._strip();\n }),\n (BN.prototype.iand = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuand(num);\n }),\n (BN.prototype.and = function (num) {\n return this.length > num.length ? this.clone().iand(num) : num.clone().iand(this);\n }),\n (BN.prototype.uand = function (num) {\n return this.length > num.length ? this.clone().iuand(num) : num.clone().iuand(this);\n }),\n (BN.prototype.iuxor = function (num) {\n var a, b;\n this.length > num.length ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var i = 0; i < b.length; i++) this.words[i] = a.words[i] ^ b.words[i];\n if (this !== a) for (; i < a.length; i++) this.words[i] = a.words[i];\n return (this.length = a.length), this._strip();\n }),\n (BN.prototype.ixor = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuxor(num);\n }),\n (BN.prototype.xor = function (num) {\n return this.length > num.length ? this.clone().ixor(num) : num.clone().ixor(this);\n }),\n (BN.prototype.uxor = function (num) {\n return this.length > num.length ? this.clone().iuxor(num) : num.clone().iuxor(this);\n }),\n (BN.prototype.inotn = function (width) {\n assert(typeof width == \"number\" && width >= 0);\n var bytesNeeded = Math.ceil(width / 26) | 0,\n bitsLeft = width % 26;\n this._expand(bytesNeeded), bitsLeft > 0 && bytesNeeded--;\n for (var i = 0; i < bytesNeeded; i++) this.words[i] = ~this.words[i] & 67108863;\n return bitsLeft > 0 && (this.words[i] = ~this.words[i] & (67108863 >> (26 - bitsLeft))), this._strip();\n }),\n (BN.prototype.notn = function (width) {\n return this.clone().inotn(width);\n }),\n (BN.prototype.setn = function (bit, val) {\n assert(typeof bit == \"number\" && bit >= 0);\n var off = (bit / 26) | 0,\n wbit = bit % 26;\n return (\n this._expand(off + 1),\n val\n ? (this.words[off] = this.words[off] | (1 << wbit))\n : (this.words[off] = this.words[off] & ~(1 << wbit)),\n this._strip()\n );\n }),\n (BN.prototype.iadd = function (num) {\n var r;\n if (this.negative !== 0 && num.negative === 0)\n return (this.negative = 0), (r = this.isub(num)), (this.negative ^= 1), this._normSign();\n if (this.negative === 0 && num.negative !== 0)\n return (num.negative = 0), (r = this.isub(num)), (num.negative = 1), r._normSign();\n var a, b;\n this.length > num.length ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var carry = 0, i = 0; i < b.length; i++)\n (r = (a.words[i] | 0) + (b.words[i] | 0) + carry), (this.words[i] = r & 67108863), (carry = r >>> 26);\n for (; carry !== 0 && i < a.length; i++)\n (r = (a.words[i] | 0) + carry), (this.words[i] = r & 67108863), (carry = r >>> 26);\n if (((this.length = a.length), carry !== 0)) (this.words[this.length] = carry), this.length++;\n else if (a !== this) for (; i < a.length; i++) this.words[i] = a.words[i];\n return this;\n }),\n (BN.prototype.add = function (num) {\n var res;\n return num.negative !== 0 && this.negative === 0\n ? ((num.negative = 0), (res = this.sub(num)), (num.negative ^= 1), res)\n : num.negative === 0 && this.negative !== 0\n ? ((this.negative = 0), (res = num.sub(this)), (this.negative = 1), res)\n : this.length > num.length\n ? this.clone().iadd(num)\n : num.clone().iadd(this);\n }),\n (BN.prototype.isub = function (num) {\n if (num.negative !== 0) {\n num.negative = 0;\n var r = this.iadd(num);\n return (num.negative = 1), r._normSign();\n } else if (this.negative !== 0)\n return (this.negative = 0), this.iadd(num), (this.negative = 1), this._normSign();\n var cmp = this.cmp(num);\n if (cmp === 0) return (this.negative = 0), (this.length = 1), (this.words[0] = 0), this;\n var a, b;\n cmp > 0 ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var carry = 0, i = 0; i < b.length; i++)\n (r = (a.words[i] | 0) - (b.words[i] | 0) + carry), (carry = r >> 26), (this.words[i] = r & 67108863);\n for (; carry !== 0 && i < a.length; i++)\n (r = (a.words[i] | 0) + carry), (carry = r >> 26), (this.words[i] = r & 67108863);\n if (carry === 0 && i < a.length && a !== this) for (; i < a.length; i++) this.words[i] = a.words[i];\n return (this.length = Math.max(this.length, i)), a !== this && (this.negative = 1), this._strip();\n }),\n (BN.prototype.sub = function (num) {\n return this.clone().isub(num);\n });\n function smallMulTo(self2, num, out) {\n out.negative = num.negative ^ self2.negative;\n var len = (self2.length + num.length) | 0;\n (out.length = len), (len = (len - 1) | 0);\n var a = self2.words[0] | 0,\n b = num.words[0] | 0,\n r = a * b,\n lo = r & 67108863,\n carry = (r / 67108864) | 0;\n out.words[0] = lo;\n for (var k = 1; k < len; k++) {\n for (\n var ncarry = carry >>> 26,\n rword = carry & 67108863,\n maxJ = Math.min(k, num.length - 1),\n j = Math.max(0, k - self2.length + 1);\n j <= maxJ;\n j++\n ) {\n var i = (k - j) | 0;\n (a = self2.words[i] | 0),\n (b = num.words[j] | 0),\n (r = a * b + rword),\n (ncarry += (r / 67108864) | 0),\n (rword = r & 67108863);\n }\n (out.words[k] = rword | 0), (carry = ncarry | 0);\n }\n return carry !== 0 ? (out.words[k] = carry | 0) : out.length--, out._strip();\n }\n var comb10MulTo = function (self2, num, out) {\n var a = self2.words,\n b = num.words,\n o = out.words,\n c = 0,\n lo,\n mid,\n hi,\n a0 = a[0] | 0,\n al0 = a0 & 8191,\n ah0 = a0 >>> 13,\n a1 = a[1] | 0,\n al1 = a1 & 8191,\n ah1 = a1 >>> 13,\n a2 = a[2] | 0,\n al2 = a2 & 8191,\n ah2 = a2 >>> 13,\n a3 = a[3] | 0,\n al3 = a3 & 8191,\n ah3 = a3 >>> 13,\n a4 = a[4] | 0,\n al4 = a4 & 8191,\n ah4 = a4 >>> 13,\n a5 = a[5] | 0,\n al5 = a5 & 8191,\n ah5 = a5 >>> 13,\n a6 = a[6] | 0,\n al6 = a6 & 8191,\n ah6 = a6 >>> 13,\n a7 = a[7] | 0,\n al7 = a7 & 8191,\n ah7 = a7 >>> 13,\n a8 = a[8] | 0,\n al8 = a8 & 8191,\n ah8 = a8 >>> 13,\n a9 = a[9] | 0,\n al9 = a9 & 8191,\n ah9 = a9 >>> 13,\n b0 = b[0] | 0,\n bl0 = b0 & 8191,\n bh0 = b0 >>> 13,\n b1 = b[1] | 0,\n bl1 = b1 & 8191,\n bh1 = b1 >>> 13,\n b2 = b[2] | 0,\n bl2 = b2 & 8191,\n bh2 = b2 >>> 13,\n b3 = b[3] | 0,\n bl3 = b3 & 8191,\n bh3 = b3 >>> 13,\n b4 = b[4] | 0,\n bl4 = b4 & 8191,\n bh4 = b4 >>> 13,\n b5 = b[5] | 0,\n bl5 = b5 & 8191,\n bh5 = b5 >>> 13,\n b6 = b[6] | 0,\n bl6 = b6 & 8191,\n bh6 = b6 >>> 13,\n b7 = b[7] | 0,\n bl7 = b7 & 8191,\n bh7 = b7 >>> 13,\n b8 = b[8] | 0,\n bl8 = b8 & 8191,\n bh8 = b8 >>> 13,\n b9 = b[9] | 0,\n bl9 = b9 & 8191,\n bh9 = b9 >>> 13;\n (out.negative = self2.negative ^ num.negative),\n (out.length = 19),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w0 >>> 26)) | 0),\n (w0 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w1 >>> 26)) | 0),\n (w1 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w2 >>> 26)) | 0),\n (w2 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w3 >>> 26)) | 0),\n (w3 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w4 >>> 26)) | 0),\n (w4 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w5 >>> 26)) | 0),\n (w5 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w6 >>> 26)) | 0),\n (w6 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w7 >>> 26)) | 0),\n (w7 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w8 >>> 26)) | 0),\n (w8 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w9 >>> 26)) | 0),\n (w9 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w10 >>> 26)) | 0),\n (w10 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w11 >>> 26)) | 0),\n (w11 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w12 >>> 26)) | 0),\n (w12 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w13 >>> 26)) | 0),\n (w13 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w14 >>> 26)) | 0),\n (w14 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w15 >>> 26)) | 0),\n (w15 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w16 >>> 26)) | 0),\n (w16 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w17 >>> 26)) | 0),\n (w17 &= 67108863),\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 & 8191) << 13)) | 0;\n return (\n (c = (((hi + (mid >>> 13)) | 0) + (w18 >>> 26)) | 0),\n (w18 &= 67108863),\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 c !== 0 && ((o[19] = c), out.length++),\n out\n );\n };\n Math.imul || (comb10MulTo = smallMulTo);\n function bigMulTo(self2, num, out) {\n (out.negative = num.negative ^ self2.negative), (out.length = self2.length + num.length);\n for (var carry = 0, hncarry = 0, k = 0; k < out.length - 1; k++) {\n var ncarry = hncarry;\n hncarry = 0;\n for (\n var rword = carry & 67108863, maxJ = Math.min(k, num.length - 1), j = Math.max(0, k - self2.length + 1);\n j <= maxJ;\n j++\n ) {\n var i = k - j,\n a = self2.words[i] | 0,\n b = num.words[j] | 0,\n r = a * b,\n lo = r & 67108863;\n (ncarry = (ncarry + ((r / 67108864) | 0)) | 0),\n (lo = (lo + rword) | 0),\n (rword = lo & 67108863),\n (ncarry = (ncarry + (lo >>> 26)) | 0),\n (hncarry += ncarry >>> 26),\n (ncarry &= 67108863);\n }\n (out.words[k] = rword), (carry = ncarry), (ncarry = hncarry);\n }\n return carry !== 0 ? (out.words[k] = carry) : out.length--, out._strip();\n }\n function jumboMulTo(self2, num, out) {\n return bigMulTo(self2, num, out);\n }\n BN.prototype.mulTo = function (num, out) {\n var res,\n len = this.length + num.length;\n return (\n this.length === 10 && num.length === 10\n ? (res = comb10MulTo(this, num, out))\n : len < 63\n ? (res = smallMulTo(this, num, out))\n : len < 1024\n ? (res = bigMulTo(this, num, out))\n : (res = jumboMulTo(this, num, out)),\n res\n );\n };\n function FFTM(x, y) {\n (this.x = x), (this.y = y);\n }\n (FFTM.prototype.makeRBT = function (N) {\n for (var t = new Array(N), l = BN.prototype._countBits(N) - 1, i = 0; i < N; i++) t[i] = this.revBin(i, l, N);\n return t;\n }),\n (FFTM.prototype.revBin = function (x, l, N) {\n if (x === 0 || x === N - 1) return x;\n for (var rb = 0, i = 0; i < l; i++) (rb |= (x & 1) << (l - i - 1)), (x >>= 1);\n return rb;\n }),\n (FFTM.prototype.permute = function (rbt, rws, iws, rtws, itws, N) {\n for (var i = 0; i < N; i++) (rtws[i] = rws[rbt[i]]), (itws[i] = iws[rbt[i]]);\n }),\n (FFTM.prototype.transform = function (rws, iws, rtws, itws, N, rbt) {\n this.permute(rbt, rws, iws, rtws, itws, N);\n for (var s = 1; s < N; s <<= 1)\n for (\n var l = s << 1, rtwdf = Math.cos((2 * Math.PI) / l), itwdf = Math.sin((2 * Math.PI) / l), p = 0;\n p < N;\n p += l\n )\n for (var rtwdf_ = rtwdf, itwdf_ = itwdf, j = 0; j < s; j++) {\n var re = rtws[p + j],\n ie = itws[p + j],\n ro = rtws[p + j + s],\n io = itws[p + j + s],\n rx = rtwdf_ * ro - itwdf_ * io;\n (io = rtwdf_ * io + itwdf_ * ro),\n (ro = rx),\n (rtws[p + j] = re + ro),\n (itws[p + j] = ie + io),\n (rtws[p + j + s] = re - ro),\n (itws[p + j + s] = ie - io),\n j !== l &&\n ((rx = rtwdf * rtwdf_ - itwdf * itwdf_), (itwdf_ = rtwdf * itwdf_ + itwdf * rtwdf_), (rtwdf_ = rx));\n }\n }),\n (FFTM.prototype.guessLen13b = function (n, m) {\n var N = Math.max(m, n) | 1,\n odd = N & 1,\n i = 0;\n for (N = (N / 2) | 0; N; N = N >>> 1) i++;\n return 1 << (i + 1 + odd);\n }),\n (FFTM.prototype.conjugate = function (rws, iws, N) {\n if (!(N <= 1))\n for (var i = 0; i < N / 2; i++) {\n var t = rws[i];\n (rws[i] = rws[N - i - 1]),\n (rws[N - i - 1] = t),\n (t = iws[i]),\n (iws[i] = -iws[N - i - 1]),\n (iws[N - i - 1] = -t);\n }\n }),\n (FFTM.prototype.normalize13b = function (ws, N) {\n for (var carry = 0, i = 0; i < N / 2; i++) {\n var w = Math.round(ws[2 * i + 1] / N) * 8192 + Math.round(ws[2 * i] / N) + carry;\n (ws[i] = w & 67108863), w < 67108864 ? (carry = 0) : (carry = (w / 67108864) | 0);\n }\n return ws;\n }),\n (FFTM.prototype.convert13b = function (ws, len, rws, N) {\n for (var carry = 0, i = 0; i < len; i++)\n (carry = carry + (ws[i] | 0)),\n (rws[2 * i] = carry & 8191),\n (carry = carry >>> 13),\n (rws[2 * i + 1] = carry & 8191),\n (carry = carry >>> 13);\n for (i = 2 * len; i < N; ++i) rws[i] = 0;\n assert(carry === 0), assert((carry & -8192) === 0);\n }),\n (FFTM.prototype.stub = function (N) {\n for (var ph = new Array(N), i = 0; i < N; i++) ph[i] = 0;\n return ph;\n }),\n (FFTM.prototype.mulp = function (x, y, out) {\n var N = 2 * this.guessLen13b(x.length, y.length),\n rbt = this.makeRBT(N),\n _ = this.stub(N),\n rws = new Array(N),\n rwst = new Array(N),\n iwst = new Array(N),\n nrws = new Array(N),\n nrwst = new Array(N),\n niwst = new Array(N),\n rmws = out.words;\n (rmws.length = N),\n this.convert13b(x.words, x.length, rws, N),\n this.convert13b(y.words, y.length, nrws, N),\n this.transform(rws, _, rwst, iwst, N, rbt),\n this.transform(nrws, _, nrwst, niwst, N, rbt);\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]), (rwst[i] = rx);\n }\n return (\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 (out.negative = x.negative ^ y.negative),\n (out.length = x.length + y.length),\n out._strip()\n );\n }),\n (BN.prototype.mul = function (num) {\n var out = new BN(null);\n return (out.words = new Array(this.length + num.length)), this.mulTo(num, out);\n }),\n (BN.prototype.mulf = function (num) {\n var out = new BN(null);\n return (out.words = new Array(this.length + num.length)), jumboMulTo(this, num, out);\n }),\n (BN.prototype.imul = function (num) {\n return this.clone().mulTo(num, this);\n }),\n (BN.prototype.imuln = function (num) {\n var isNegNum = num < 0;\n isNegNum && (num = -num), assert(typeof num == \"number\"), assert(num < 67108864);\n for (var carry = 0, i = 0; i < this.length; i++) {\n var w = (this.words[i] | 0) * num,\n lo = (w & 67108863) + (carry & 67108863);\n (carry >>= 26), (carry += (w / 67108864) | 0), (carry += lo >>> 26), (this.words[i] = lo & 67108863);\n }\n return carry !== 0 && ((this.words[i] = carry), this.length++), isNegNum ? this.ineg() : this;\n }),\n (BN.prototype.muln = function (num) {\n return this.clone().imuln(num);\n }),\n (BN.prototype.sqr = function () {\n return this.mul(this);\n }),\n (BN.prototype.isqr = function () {\n return this.imul(this.clone());\n }),\n (BN.prototype.pow = function (num) {\n var w = toBitArray(num);\n if (w.length === 0) return new BN(1);\n for (var res = this, i = 0; i < w.length && w[i] === 0; i++, res = res.sqr());\n if (++i < w.length) for (var q = res.sqr(); i < w.length; i++, q = q.sqr()) w[i] !== 0 && (res = res.mul(q));\n return res;\n }),\n (BN.prototype.iushln = function (bits) {\n assert(typeof bits == \"number\" && bits >= 0);\n var r = bits % 26,\n s = (bits - r) / 26,\n carryMask = (67108863 >>> (26 - r)) << (26 - r),\n i;\n if (r !== 0) {\n var carry = 0;\n for (i = 0; i < this.length; i++) {\n var newCarry = this.words[i] & carryMask,\n c = ((this.words[i] | 0) - newCarry) << r;\n (this.words[i] = c | carry), (carry = newCarry >>> (26 - r));\n }\n carry && ((this.words[i] = carry), this.length++);\n }\n if (s !== 0) {\n for (i = this.length - 1; i >= 0; i--) this.words[i + s] = this.words[i];\n for (i = 0; i < s; i++) this.words[i] = 0;\n this.length += s;\n }\n return this._strip();\n }),\n (BN.prototype.ishln = function (bits) {\n return assert(this.negative === 0), this.iushln(bits);\n }),\n (BN.prototype.iushrn = function (bits, hint, extended) {\n assert(typeof bits == \"number\" && bits >= 0);\n var h;\n hint ? (h = (hint - (hint % 26)) / 26) : (h = 0);\n var r = bits % 26,\n s = Math.min((bits - r) / 26, this.length),\n mask = 67108863 ^ ((67108863 >>> r) << r),\n maskedWords = extended;\n if (((h -= s), (h = Math.max(0, h)), maskedWords)) {\n for (var i = 0; i < s; i++) maskedWords.words[i] = this.words[i];\n maskedWords.length = s;\n }\n if (s !== 0)\n if (this.length > s) for (this.length -= s, i = 0; i < this.length; i++) this.words[i] = this.words[i + s];\n else (this.words[0] = 0), (this.length = 1);\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)), (carry = word & mask);\n }\n return (\n maskedWords && carry !== 0 && (maskedWords.words[maskedWords.length++] = carry),\n this.length === 0 && ((this.words[0] = 0), (this.length = 1)),\n this._strip()\n );\n }),\n (BN.prototype.ishrn = function (bits, hint, extended) {\n return assert(this.negative === 0), this.iushrn(bits, hint, extended);\n }),\n (BN.prototype.shln = function (bits) {\n return this.clone().ishln(bits);\n }),\n (BN.prototype.ushln = function (bits) {\n return this.clone().iushln(bits);\n }),\n (BN.prototype.shrn = function (bits) {\n return this.clone().ishrn(bits);\n }),\n (BN.prototype.ushrn = function (bits) {\n return this.clone().iushrn(bits);\n }),\n (BN.prototype.testn = function (bit) {\n assert(typeof bit == \"number\" && bit >= 0);\n var r = bit % 26,\n s = (bit - r) / 26,\n q = 1 << r;\n if (this.length <= s) return !1;\n var w = this.words[s];\n return !!(w & q);\n }),\n (BN.prototype.imaskn = function (bits) {\n assert(typeof bits == \"number\" && bits >= 0);\n var r = bits % 26,\n s = (bits - r) / 26;\n if ((assert(this.negative === 0, \"imaskn works only with positive numbers\"), this.length <= s)) return this;\n if ((r !== 0 && s++, (this.length = Math.min(s, this.length)), r !== 0)) {\n var mask = 67108863 ^ ((67108863 >>> r) << r);\n this.words[this.length - 1] &= mask;\n }\n return this._strip();\n }),\n (BN.prototype.maskn = function (bits) {\n return this.clone().imaskn(bits);\n }),\n (BN.prototype.iaddn = function (num) {\n return (\n assert(typeof num == \"number\"),\n assert(num < 67108864),\n num < 0\n ? this.isubn(-num)\n : this.negative !== 0\n ? this.length === 1 && (this.words[0] | 0) <= num\n ? ((this.words[0] = num - (this.words[0] | 0)), (this.negative = 0), this)\n : ((this.negative = 0), this.isubn(num), (this.negative = 1), this)\n : this._iaddn(num)\n );\n }),\n (BN.prototype._iaddn = function (num) {\n this.words[0] += num;\n for (var i = 0; i < this.length && this.words[i] >= 67108864; i++)\n (this.words[i] -= 67108864), i === this.length - 1 ? (this.words[i + 1] = 1) : this.words[i + 1]++;\n return (this.length = Math.max(this.length, i + 1)), this;\n }),\n (BN.prototype.isubn = function (num) {\n if ((assert(typeof num == \"number\"), assert(num < 67108864), num < 0)) return this.iaddn(-num);\n if (this.negative !== 0) return (this.negative = 0), this.iaddn(num), (this.negative = 1), this;\n if (((this.words[0] -= num), this.length === 1 && this.words[0] < 0))\n (this.words[0] = -this.words[0]), (this.negative = 1);\n else\n for (var i = 0; i < this.length && this.words[i] < 0; i++)\n (this.words[i] += 67108864), (this.words[i + 1] -= 1);\n return this._strip();\n }),\n (BN.prototype.addn = function (num) {\n return this.clone().iaddn(num);\n }),\n (BN.prototype.subn = function (num) {\n return this.clone().isubn(num);\n }),\n (BN.prototype.iabs = function () {\n return (this.negative = 0), this;\n }),\n (BN.prototype.abs = function () {\n return this.clone().iabs();\n }),\n (BN.prototype._ishlnsubmul = function (num, mul, shift) {\n var len = num.length + shift,\n i;\n this._expand(len);\n var w,\n 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 & 67108863),\n (carry = (w >> 26) - ((right / 67108864) | 0)),\n (this.words[i + shift] = w & 67108863);\n }\n for (; i < this.length - shift; i++)\n (w = (this.words[i + shift] | 0) + carry), (carry = w >> 26), (this.words[i + shift] = w & 67108863);\n if (carry === 0) return this._strip();\n for (assert(carry === -1), carry = 0, i = 0; i < this.length; i++)\n (w = -(this.words[i] | 0) + carry), (carry = w >> 26), (this.words[i] = w & 67108863);\n return (this.negative = 1), this._strip();\n }),\n (BN.prototype._wordDiv = function (num, mode) {\n var shift = this.length - num.length,\n a = this.clone(),\n b = num,\n bhi = b.words[b.length - 1] | 0,\n bhiBits = this._countBits(bhi);\n (shift = 26 - bhiBits),\n shift !== 0 && ((b = b.ushln(shift)), a.iushln(shift), (bhi = b.words[b.length - 1] | 0));\n var m = a.length - b.length,\n q;\n if (mode !== \"mod\") {\n (q = new BN(null)), (q.length = m + 1), (q.words = new Array(q.length));\n for (var i = 0; i < q.length; i++) q.words[i] = 0;\n }\n var diff = a.clone()._ishlnsubmul(b, 1, m);\n diff.negative === 0 && ((a = diff), q && (q.words[m] = 1));\n for (var j = m - 1; j >= 0; j--) {\n var qj = (a.words[b.length + j] | 0) * 67108864 + (a.words[b.length + j - 1] | 0);\n for (qj = Math.min((qj / bhi) | 0, 67108863), a._ishlnsubmul(b, qj, j); a.negative !== 0; )\n qj--, (a.negative = 0), a._ishlnsubmul(b, 1, j), a.isZero() || (a.negative ^= 1);\n q && (q.words[j] = qj);\n }\n return (\n q && q._strip(),\n a._strip(),\n mode !== \"div\" && shift !== 0 && a.iushrn(shift),\n {\n div: q || null,\n mod: a,\n }\n );\n }),\n (BN.prototype.divmod = function (num, mode, positive) {\n if ((assert(!num.isZero()), this.isZero()))\n return {\n div: new BN(0),\n mod: new BN(0),\n };\n var div, mod, res;\n return this.negative !== 0 && num.negative === 0\n ? ((res = this.neg().divmod(num, mode)),\n mode !== \"mod\" && (div = res.div.neg()),\n mode !== \"div\" && ((mod = res.mod.neg()), positive && mod.negative !== 0 && mod.iadd(num)),\n {\n div,\n mod,\n })\n : this.negative === 0 && num.negative !== 0\n ? ((res = this.divmod(num.neg(), mode)),\n mode !== \"mod\" && (div = res.div.neg()),\n {\n div,\n mod: res.mod,\n })\n : (this.negative & num.negative) !== 0\n ? ((res = this.neg().divmod(num.neg(), mode)),\n mode !== \"div\" && ((mod = res.mod.neg()), positive && mod.negative !== 0 && mod.isub(num)),\n {\n div: res.div,\n mod,\n })\n : num.length > this.length || this.cmp(num) < 0\n ? {\n div: new BN(0),\n mod: this,\n }\n : num.length === 1\n ? mode === \"div\"\n ? {\n div: this.divn(num.words[0]),\n mod: null,\n }\n : mode === \"mod\"\n ? {\n div: null,\n mod: new BN(this.modrn(num.words[0])),\n }\n : {\n div: this.divn(num.words[0]),\n mod: new BN(this.modrn(num.words[0])),\n }\n : this._wordDiv(num, mode);\n }),\n (BN.prototype.div = function (num) {\n return this.divmod(num, \"div\", !1).div;\n }),\n (BN.prototype.mod = function (num) {\n return this.divmod(num, \"mod\", !1).mod;\n }),\n (BN.prototype.umod = function (num) {\n return this.divmod(num, \"mod\", !0).mod;\n }),\n (BN.prototype.divRound = function (num) {\n var dm = this.divmod(num);\n if (dm.mod.isZero()) return dm.div;\n var mod = dm.div.negative !== 0 ? dm.mod.isub(num) : dm.mod,\n half = num.ushrn(1),\n r2 = num.andln(1),\n cmp = mod.cmp(half);\n return cmp < 0 || (r2 === 1 && cmp === 0)\n ? dm.div\n : dm.div.negative !== 0\n ? dm.div.isubn(1)\n : dm.div.iaddn(1);\n }),\n (BN.prototype.modrn = function (num) {\n var isNegNum = num < 0;\n isNegNum && (num = -num), assert(num <= 67108863);\n for (var p = (1 << 26) % num, acc = 0, i = this.length - 1; i >= 0; i--)\n acc = (p * acc + (this.words[i] | 0)) % num;\n return isNegNum ? -acc : acc;\n }),\n (BN.prototype.modn = function (num) {\n return this.modrn(num);\n }),\n (BN.prototype.idivn = function (num) {\n var isNegNum = num < 0;\n isNegNum && (num = -num), assert(num <= 67108863);\n for (var carry = 0, i = this.length - 1; i >= 0; i--) {\n var w = (this.words[i] | 0) + carry * 67108864;\n (this.words[i] = (w / num) | 0), (carry = w % num);\n }\n return this._strip(), isNegNum ? this.ineg() : this;\n }),\n (BN.prototype.divn = function (num) {\n return this.clone().idivn(num);\n }),\n (BN.prototype.egcd = function (p) {\n assert(p.negative === 0), assert(!p.isZero());\n var x = this,\n y = p.clone();\n x.negative !== 0 ? (x = x.umod(p)) : (x = x.clone());\n for (var A = new BN(1), B = new BN(0), C = new BN(0), D = new BN(1), g = 0; x.isEven() && y.isEven(); )\n x.iushrn(1), y.iushrn(1), ++g;\n for (var yp = y.clone(), xp = x.clone(); !x.isZero(); ) {\n for (var i = 0, im = 1; (x.words[0] & im) === 0 && i < 26; ++i, im <<= 1);\n if (i > 0)\n for (x.iushrn(i); i-- > 0; )\n (A.isOdd() || B.isOdd()) && (A.iadd(yp), B.isub(xp)), A.iushrn(1), B.iushrn(1);\n for (var j = 0, jm = 1; (y.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n if (j > 0)\n for (y.iushrn(j); j-- > 0; )\n (C.isOdd() || D.isOdd()) && (C.iadd(yp), D.isub(xp)), C.iushrn(1), D.iushrn(1);\n x.cmp(y) >= 0 ? (x.isub(y), A.isub(C), B.isub(D)) : (y.isub(x), C.isub(A), D.isub(B));\n }\n return {\n a: C,\n b: D,\n gcd: y.iushln(g),\n };\n }),\n (BN.prototype._invmp = function (p) {\n assert(p.negative === 0), assert(!p.isZero());\n var a = this,\n b = p.clone();\n a.negative !== 0 ? (a = a.umod(p)) : (a = a.clone());\n for (var x1 = new BN(1), x2 = new BN(0), delta = b.clone(); 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) for (a.iushrn(i); i-- > 0; ) x1.isOdd() && x1.iadd(delta), x1.iushrn(1);\n for (var j = 0, jm = 1; (b.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n if (j > 0) for (b.iushrn(j); j-- > 0; ) x2.isOdd() && x2.iadd(delta), x2.iushrn(1);\n a.cmp(b) >= 0 ? (a.isub(b), x1.isub(x2)) : (b.isub(a), x2.isub(x1));\n }\n var res;\n return a.cmpn(1) === 0 ? (res = x1) : (res = x2), res.cmpn(0) < 0 && res.iadd(p), res;\n }),\n (BN.prototype.gcd = function (num) {\n if (this.isZero()) return num.abs();\n if (num.isZero()) return this.abs();\n var a = this.clone(),\n b = num.clone();\n (a.negative = 0), (b.negative = 0);\n for (var shift = 0; a.isEven() && b.isEven(); shift++) a.iushrn(1), b.iushrn(1);\n do {\n for (; a.isEven(); ) a.iushrn(1);\n for (; b.isEven(); ) b.iushrn(1);\n var r = a.cmp(b);\n if (r < 0) {\n var t = a;\n (a = b), (b = t);\n } else if (r === 0 || b.cmpn(1) === 0) break;\n a.isub(b);\n } while (!0);\n return b.iushln(shift);\n }),\n (BN.prototype.invm = function (num) {\n return this.egcd(num).a.umod(num);\n }),\n (BN.prototype.isEven = function () {\n return (this.words[0] & 1) === 0;\n }),\n (BN.prototype.isOdd = function () {\n return (this.words[0] & 1) === 1;\n }),\n (BN.prototype.andln = function (num) {\n return this.words[0] & num;\n }),\n (BN.prototype.bincn = function (bit) {\n assert(typeof bit == \"number\");\n var r = bit % 26,\n s = (bit - r) / 26,\n q = 1 << r;\n if (this.length <= s) return this._expand(s + 1), (this.words[s] |= q), this;\n for (var carry = q, i = s; carry !== 0 && i < this.length; i++) {\n var w = this.words[i] | 0;\n (w += carry), (carry = w >>> 26), (w &= 67108863), (this.words[i] = w);\n }\n return carry !== 0 && ((this.words[i] = carry), this.length++), this;\n }),\n (BN.prototype.isZero = function () {\n return this.length === 1 && this.words[0] === 0;\n }),\n (BN.prototype.cmpn = function (num) {\n var negative = num < 0;\n if (this.negative !== 0 && !negative) return -1;\n if (this.negative === 0 && negative) return 1;\n this._strip();\n var res;\n if (this.length > 1) res = 1;\n else {\n negative && (num = -num), assert(num <= 67108863, \"Number is too big\");\n var w = this.words[0] | 0;\n res = w === num ? 0 : w < num ? -1 : 1;\n }\n return this.negative !== 0 ? -res | 0 : res;\n }),\n (BN.prototype.cmp = function (num) {\n if (this.negative !== 0 && num.negative === 0) return -1;\n if (this.negative === 0 && num.negative !== 0) return 1;\n var res = this.ucmp(num);\n return this.negative !== 0 ? -res | 0 : res;\n }),\n (BN.prototype.ucmp = function (num) {\n if (this.length > num.length) return 1;\n if (this.length < num.length) return -1;\n for (var res = 0, i = this.length - 1; i >= 0; i--) {\n var a = this.words[i] | 0,\n b = num.words[i] | 0;\n if (a !== b) {\n a < b ? (res = -1) : a > b && (res = 1);\n break;\n }\n }\n return res;\n }),\n (BN.prototype.gtn = function (num) {\n return this.cmpn(num) === 1;\n }),\n (BN.prototype.gt = function (num) {\n return this.cmp(num) === 1;\n }),\n (BN.prototype.gten = function (num) {\n return this.cmpn(num) >= 0;\n }),\n (BN.prototype.gte = function (num) {\n return this.cmp(num) >= 0;\n }),\n (BN.prototype.ltn = function (num) {\n return this.cmpn(num) === -1;\n }),\n (BN.prototype.lt = function (num) {\n return this.cmp(num) === -1;\n }),\n (BN.prototype.lten = function (num) {\n return this.cmpn(num) <= 0;\n }),\n (BN.prototype.lte = function (num) {\n return this.cmp(num) <= 0;\n }),\n (BN.prototype.eqn = function (num) {\n return this.cmpn(num) === 0;\n }),\n (BN.prototype.eq = function (num) {\n return this.cmp(num) === 0;\n }),\n (BN.red = function (num) {\n return new Red(num);\n }),\n (BN.prototype.toRed = function (ctx) {\n return (\n assert(!this.red, \"Already a number in reduction context\"),\n assert(this.negative === 0, \"red works only with positives\"),\n ctx.convertTo(this)._forceRed(ctx)\n );\n }),\n (BN.prototype.fromRed = function () {\n return assert(this.red, \"fromRed works only with numbers in reduction context\"), this.red.convertFrom(this);\n }),\n (BN.prototype._forceRed = function (ctx) {\n return (this.red = ctx), this;\n }),\n (BN.prototype.forceRed = function (ctx) {\n return assert(!this.red, \"Already a number in reduction context\"), this._forceRed(ctx);\n }),\n (BN.prototype.redAdd = function (num) {\n return assert(this.red, \"redAdd works only with red numbers\"), this.red.add(this, num);\n }),\n (BN.prototype.redIAdd = function (num) {\n return assert(this.red, \"redIAdd works only with red numbers\"), this.red.iadd(this, num);\n }),\n (BN.prototype.redSub = function (num) {\n return assert(this.red, \"redSub works only with red numbers\"), this.red.sub(this, num);\n }),\n (BN.prototype.redISub = function (num) {\n return assert(this.red, \"redISub works only with red numbers\"), this.red.isub(this, num);\n }),\n (BN.prototype.redShl = function (num) {\n return assert(this.red, \"redShl works only with red numbers\"), this.red.shl(this, num);\n }),\n (BN.prototype.redMul = function (num) {\n return (\n assert(this.red, \"redMul works only with red numbers\"),\n this.red._verify2(this, num),\n this.red.mul(this, num)\n );\n }),\n (BN.prototype.redIMul = function (num) {\n return (\n assert(this.red, \"redMul works only with red numbers\"),\n this.red._verify2(this, num),\n this.red.imul(this, num)\n );\n }),\n (BN.prototype.redSqr = function () {\n return assert(this.red, \"redSqr works only with red numbers\"), this.red._verify1(this), this.red.sqr(this);\n }),\n (BN.prototype.redISqr = function () {\n return assert(this.red, \"redISqr works only with red numbers\"), this.red._verify1(this), this.red.isqr(this);\n }),\n (BN.prototype.redSqrt = function () {\n return assert(this.red, \"redSqrt works only with red numbers\"), this.red._verify1(this), this.red.sqrt(this);\n }),\n (BN.prototype.redInvm = function () {\n return assert(this.red, \"redInvm works only with red numbers\"), this.red._verify1(this), this.red.invm(this);\n }),\n (BN.prototype.redNeg = function () {\n return assert(this.red, \"redNeg works only with red numbers\"), this.red._verify1(this), this.red.neg(this);\n }),\n (BN.prototype.redPow = function (num) {\n return assert(this.red && !num.red, \"redPow(normalNum)\"), this.red._verify1(this), this.red.pow(this, num);\n });\n var primes = {\n k256: null,\n p224: null,\n p192: null,\n p25519: null,\n };\n function MPrime(name, p) {\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 (this.tmp = this._tmp());\n }\n (MPrime.prototype._tmp = function () {\n var tmp = new BN(null);\n return (tmp.words = new Array(Math.ceil(this.n / 13))), tmp;\n }),\n (MPrime.prototype.ireduce = function (num) {\n var r = num,\n rlen;\n do this.split(r, this.tmp), (r = this.imulK(r)), (r = r.iadd(this.tmp)), (rlen = r.bitLength());\n while (rlen > this.n);\n var cmp = rlen < this.n ? -1 : r.ucmp(this.p);\n return (\n cmp === 0\n ? ((r.words[0] = 0), (r.length = 1))\n : cmp > 0\n ? r.isub(this.p)\n : r.strip !== void 0\n ? r.strip()\n : r._strip(),\n r\n );\n }),\n (MPrime.prototype.split = function (input, out) {\n input.iushrn(this.n, 0, out);\n }),\n (MPrime.prototype.imulK = function (num) {\n return num.imul(this.k);\n });\n function K256() {\n MPrime.call(this, \"k256\", \"ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f\");\n }\n inherits(K256, MPrime),\n (K256.prototype.split = function (input, output) {\n for (var mask = 4194303, outLen = Math.min(input.length, 9), i = 0; i < outLen; i++)\n output.words[i] = input.words[i];\n if (((output.length = outLen), input.length <= 9)) {\n (input.words[0] = 0), (input.length = 1);\n return;\n }\n var prev = input.words[9];\n for (output.words[output.length++] = prev & mask, i = 10; i < input.length; i++) {\n var next = input.words[i] | 0;\n (input.words[i - 10] = ((next & mask) << 4) | (prev >>> 22)), (prev = next);\n }\n (prev >>>= 22),\n (input.words[i - 10] = prev),\n prev === 0 && input.length > 10 ? (input.length -= 10) : (input.length -= 9);\n }),\n (K256.prototype.imulK = function (num) {\n (num.words[num.length] = 0), (num.words[num.length + 1] = 0), (num.length += 2);\n for (var lo = 0, i = 0; i < num.length; i++) {\n var w = num.words[i] | 0;\n (lo += w * 977), (num.words[i] = lo & 67108863), (lo = w * 64 + ((lo / 67108864) | 0));\n }\n return (\n num.words[num.length - 1] === 0 && (num.length--, num.words[num.length - 1] === 0 && num.length--), num\n );\n });\n function P224() {\n MPrime.call(this, \"p224\", \"ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001\");\n }\n inherits(P224, MPrime);\n function P192() {\n MPrime.call(this, \"p192\", \"ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff\");\n }\n inherits(P192, MPrime);\n function P25519() {\n MPrime.call(this, \"25519\", \"7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed\");\n }\n inherits(P25519, MPrime),\n (P25519.prototype.imulK = function (num) {\n for (var carry = 0, i = 0; i < num.length; i++) {\n var hi = (num.words[i] | 0) * 19 + carry,\n lo = hi & 67108863;\n (hi >>>= 26), (num.words[i] = lo), (carry = hi);\n }\n return carry !== 0 && (num.words[num.length++] = carry), num;\n }),\n (BN._prime = function (name) {\n if (primes[name]) return primes[name];\n var prime2;\n if (name === \"k256\") prime2 = new K256();\n else if (name === \"p224\") prime2 = new P224();\n else if (name === \"p192\") prime2 = new P192();\n else if (name === \"p25519\") prime2 = new P25519();\n else throw new Error(\"Unknown prime \" + name);\n return (primes[name] = prime2), prime2;\n });\n function Red(m) {\n if (typeof m == \"string\") {\n var prime = BN._prime(m);\n (this.m = prime.p), (this.prime = prime);\n } else assert(m.gtn(1), \"modulus must be greater than 1\"), (this.m = m), (this.prime = null);\n }\n (Red.prototype._verify1 = function (a) {\n assert(a.negative === 0, \"red works only with positives\"), assert(a.red, \"red works only with red numbers\");\n }),\n (Red.prototype._verify2 = function (a, b) {\n assert((a.negative | b.negative) === 0, \"red works only with positives\"),\n assert(a.red && a.red === b.red, \"red works only with red numbers\");\n }),\n (Red.prototype.imod = function (a) {\n return this.prime ? this.prime.ireduce(a)._forceRed(this) : (move(a, a.umod(this.m)._forceRed(this)), a);\n }),\n (Red.prototype.neg = function (a) {\n return a.isZero() ? a.clone() : this.m.sub(a)._forceRed(this);\n }),\n (Red.prototype.add = function (a, b) {\n this._verify2(a, b);\n var res = a.add(b);\n return res.cmp(this.m) >= 0 && res.isub(this.m), res._forceRed(this);\n }),\n (Red.prototype.iadd = function (a, b) {\n this._verify2(a, b);\n var res = a.iadd(b);\n return res.cmp(this.m) >= 0 && res.isub(this.m), res;\n }),\n (Red.prototype.sub = function (a, b) {\n this._verify2(a, b);\n var res = a.sub(b);\n return res.cmpn(0) < 0 && res.iadd(this.m), res._forceRed(this);\n }),\n (Red.prototype.isub = function (a, b) {\n this._verify2(a, b);\n var res = a.isub(b);\n return res.cmpn(0) < 0 && res.iadd(this.m), res;\n }),\n (Red.prototype.shl = function (a, num) {\n return this._verify1(a), this.imod(a.ushln(num));\n }),\n (Red.prototype.imul = function (a, b) {\n return this._verify2(a, b), this.imod(a.imul(b));\n }),\n (Red.prototype.mul = function (a, b) {\n return this._verify2(a, b), this.imod(a.mul(b));\n }),\n (Red.prototype.isqr = function (a) {\n return this.imul(a, a.clone());\n }),\n (Red.prototype.sqr = function (a) {\n return this.mul(a, a);\n }),\n (Red.prototype.sqrt = function (a) {\n if (a.isZero()) return a.clone();\n var mod3 = this.m.andln(3);\n if ((assert(mod3 % 2 === 1), mod3 === 3)) {\n var pow = this.m.add(new BN(1)).iushrn(2);\n return this.pow(a, pow);\n }\n for (var q = this.m.subn(1), s = 0; !q.isZero() && q.andln(1) === 0; ) s++, q.iushrn(1);\n assert(!q.isZero());\n var one = new BN(1).toRed(this),\n nOne = one.redNeg(),\n lpow = this.m.subn(1).iushrn(1),\n z = this.m.bitLength();\n for (z = new BN(2 * z * z).toRed(this); this.pow(z, lpow).cmp(nOne) !== 0; ) z.redIAdd(nOne);\n for (\n var c = this.pow(z, q), r = this.pow(a, q.addn(1).iushrn(1)), t = this.pow(a, q), m = s;\n t.cmp(one) !== 0;\n\n ) {\n for (var tmp = t, i = 0; tmp.cmp(one) !== 0; i++) tmp = tmp.redSqr();\n assert(i < m);\n var b = this.pow(c, new BN(1).iushln(m - i - 1));\n (r = r.redMul(b)), (c = b.redSqr()), (t = t.redMul(c)), (m = i);\n }\n return r;\n }),\n (Red.prototype.invm = function (a) {\n var inv = a._invmp(this.m);\n return inv.negative !== 0 ? ((inv.negative = 0), this.imod(inv).redNeg()) : this.imod(inv);\n }),\n (Red.prototype.pow = function (a, num) {\n if (num.isZero()) return new BN(1).toRed(this);\n if (num.cmpn(1) === 0) return a.clone();\n var windowSize = 4,\n wnd = new Array(1 << windowSize);\n (wnd[0] = new BN(1).toRed(this)), (wnd[1] = a);\n for (var i = 2; i < wnd.length; i++) wnd[i] = this.mul(wnd[i - 1], a);\n var res = wnd[0],\n current = 0,\n currentLen = 0,\n start = num.bitLength() % 26;\n for (start === 0 && (start = 26), i = num.length - 1; i >= 0; i--) {\n for (var word = num.words[i], j = start - 1; j >= 0; j--) {\n var bit = (word >> j) & 1;\n if ((res !== wnd[0] && (res = this.sqr(res)), bit === 0 && current === 0)) {\n currentLen = 0;\n continue;\n }\n (current <<= 1),\n (current |= bit),\n currentLen++,\n !(currentLen !== windowSize && (i !== 0 || j !== 0)) &&\n ((res = this.mul(res, wnd[current])), (currentLen = 0), (current = 0));\n }\n start = 26;\n }\n return res;\n }),\n (Red.prototype.convertTo = function (num) {\n var r = num.umod(this.m);\n return r === num ? r.clone() : r;\n }),\n (Red.prototype.convertFrom = function (num) {\n var res = num.clone();\n return (res.red = null), res;\n }),\n (BN.mont = function (num) {\n return new Mont(num);\n });\n function Mont(m) {\n Red.call(this, m),\n (this.shift = this.m.bitLength()),\n this.shift % 26 !== 0 && (this.shift += 26 - (this.shift % 26)),\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 (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 (Mont.prototype.convertTo = function (num) {\n return this.imod(num.ushln(this.shift));\n }),\n (Mont.prototype.convertFrom = function (num) {\n var r = this.imod(num.mul(this.rinv));\n return (r.red = null), r;\n }),\n (Mont.prototype.imul = function (a, b) {\n if (a.isZero() || b.isZero()) return (a.words[0] = 0), (a.length = 1), a;\n var t = a.imul(b),\n c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m),\n u = t.isub(c).iushrn(this.shift),\n res = u;\n return (\n u.cmp(this.m) >= 0 ? (res = u.isub(this.m)) : u.cmpn(0) < 0 && (res = u.iadd(this.m)), res._forceRed(this)\n );\n }),\n (Mont.prototype.mul = function (a, b) {\n if (a.isZero() || b.isZero()) return new BN(0)._forceRed(this);\n var t = a.mul(b),\n c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m),\n u = t.isub(c).iushrn(this.shift),\n res = u;\n return (\n u.cmp(this.m) >= 0 ? (res = u.isub(this.m)) : u.cmpn(0) < 0 && (res = u.iadd(this.m)), res._forceRed(this)\n );\n }),\n (Mont.prototype.invm = function (a) {\n var res = this.imod(a._invmp(this.m).mul(this.r2));\n return res._forceRed(this);\n });\n })(typeof module > \"u\" || module, exports);\n },\n});\n\n// node_modules/browserify-rsa/index.js\nvar require_browserify_rsa = __commonJS({\n \"node_modules/browserify-rsa/index.js\"(exports, module) {\n var BN = require_bn3(),\n randomBytes = require_browser();\n function blind(priv) {\n var r = getr(priv),\n blinder = r.toRed(BN.mont(priv.modulus)).redPow(new BN(priv.publicExponent)).fromRed();\n return { blinder, unblinder: r.invm(priv.modulus) };\n }\n function getr(priv) {\n var len = priv.modulus.byteLength(),\n r;\n do r = new BN(randomBytes(len));\n while (r.cmp(priv.modulus) >= 0 || !r.umod(priv.prime1) || !r.umod(priv.prime2));\n return r;\n }\n function crt(msg, priv) {\n var blinds = blind(priv),\n len = priv.modulus.byteLength(),\n blinded = new BN(msg).mul(blinds.blinder).umod(priv.modulus),\n c1 = blinded.toRed(BN.mont(priv.prime1)),\n c2 = blinded.toRed(BN.mont(priv.prime2)),\n qinv = priv.coefficient,\n p = priv.prime1,\n q = priv.prime2,\n m1 = c1.redPow(priv.exponent1).fromRed(),\n m2 = c2.redPow(priv.exponent2).fromRed(),\n h = m1.isub(m2).imul(qinv).umod(p).imul(q);\n return m2.iadd(h).imul(blinds.unblinder).umod(priv.modulus).toArrayLike(Buffer, \"be\", len);\n }\n crt.getr = getr;\n module.exports = crt;\n },\n});\n\n// node_modules/elliptic/package.json\nvar require_package = __commonJS({\n \"node_modules/elliptic/package.json\"(exports, module) {\n module.exports = {\n name: \"elliptic\",\n version: \"6.5.4\",\n description: \"EC cryptography\",\n main: \"lib/elliptic.js\",\n files: [\"lib\"],\n scripts: {\n lint: \"eslint lib test\",\n \"lint:fix\": \"npm run lint -- --fix\",\n unit: \"istanbul test _mocha --reporter=spec test/index.js\",\n test: \"npm run lint && npm run unit\",\n version: \"grunt dist && git add dist/\",\n },\n repository: {\n type: \"git\",\n url: \"git@github.com:indutny/elliptic\",\n },\n keywords: [\"EC\", \"Elliptic\", \"curve\", \"Cryptography\"],\n author: \"Fedor Indutny <fedor@indutny.com>\",\n license: \"MIT\",\n bugs: {\n url: \"https://github.com/indutny/elliptic/issues\",\n },\n homepage: \"https://github.com/indutny/elliptic\",\n devDependencies: {\n brfs: \"^2.0.2\",\n coveralls: \"^3.1.0\",\n eslint: \"^7.6.0\",\n grunt: \"^1.2.1\",\n \"grunt-browserify\": \"^5.3.0\",\n \"grunt-cli\": \"^1.3.2\",\n \"grunt-contrib-connect\": \"^3.0.0\",\n \"grunt-contrib-copy\": \"^1.0.0\",\n \"grunt-contrib-uglify\": \"^5.0.0\",\n \"grunt-mocha-istanbul\": \"^5.0.2\",\n \"grunt-saucelabs\": \"^9.0.1\",\n istanbul: \"^0.4.5\",\n mocha: \"^8.0.1\",\n },\n dependencies: {\n \"bn.js\": \"^4.11.9\",\n brorand: \"^1.1.0\",\n \"hash.js\": \"^1.0.0\",\n \"hmac-drbg\": \"^1.0.1\",\n inherits: \"^2.0.4\",\n \"minimalistic-assert\": \"^1.0.1\",\n \"minimalistic-crypto-utils\": \"^1.0.1\",\n },\n };\n },\n});\n\n// node_modules/elliptic/node_modules/bn.js/lib/bn.js\nvar require_bn4 = __commonJS({\n \"node_modules/elliptic/node_modules/bn.js/lib/bn.js\"(exports, module) {\n (function (module2, exports2) {\n \"use strict\";\n function assert(val, msg) {\n if (!val) throw new Error(msg || \"Assertion failed\");\n }\n function inherits(ctor, superCtor) {\n ctor.super_ = superCtor;\n var TempCtor = function () {};\n (TempCtor.prototype = superCtor.prototype),\n (ctor.prototype = new TempCtor()),\n (ctor.prototype.constructor = ctor);\n }\n function BN(number, base, endian) {\n if (BN.isBN(number)) return number;\n (this.negative = 0),\n (this.words = null),\n (this.length = 0),\n (this.red = null),\n number !== null &&\n ((base === \"le\" || base === \"be\") && ((endian = base), (base = 10)),\n this._init(number || 0, base || 10, endian || \"be\"));\n }\n typeof module2 == \"object\" ? (module2.exports = BN) : (exports2.BN = BN), (BN.BN = BN), (BN.wordSize = 26);\n var Buffer2;\n try {\n typeof window < \"u\" && typeof window.Buffer < \"u\"\n ? (Buffer2 = window.Buffer)\n : (Buffer2 = __require(\"buffer\").Buffer);\n } catch {}\n (BN.isBN = function (num) {\n return num instanceof BN\n ? !0\n : num !== null &&\n typeof num == \"object\" &&\n num.constructor.wordSize === BN.wordSize &&\n Array.isArray(num.words);\n }),\n (BN.max = function (left, right) {\n return left.cmp(right) > 0 ? left : right;\n }),\n (BN.min = function (left, right) {\n return left.cmp(right) < 0 ? left : right;\n }),\n (BN.prototype._init = function (number, base, endian) {\n if (typeof number == \"number\") return this._initNumber(number, base, endian);\n if (typeof number == \"object\") return this._initArray(number, base, endian);\n base === \"hex\" && (base = 16),\n assert(base === (base | 0) && base >= 2 && base <= 36),\n (number = number.toString().replace(/\\s+/g, \"\"));\n var start = 0;\n number[0] === \"-\" && (start++, (this.negative = 1)),\n start < number.length &&\n (base === 16\n ? this._parseHex(number, start, endian)\n : (this._parseBase(number, base, start),\n endian === \"le\" && this._initArray(this.toArray(), base, endian)));\n }),\n (BN.prototype._initNumber = function (number, base, endian) {\n number < 0 && ((this.negative = 1), (number = -number)),\n number < 67108864\n ? ((this.words = [number & 67108863]), (this.length = 1))\n : number < 4503599627370496\n ? ((this.words = [number & 67108863, (number / 67108864) & 67108863]), (this.length = 2))\n : (assert(number < 9007199254740992),\n (this.words = [number & 67108863, (number / 67108864) & 67108863, 1]),\n (this.length = 3)),\n endian === \"le\" && this._initArray(this.toArray(), base, endian);\n }),\n (BN.prototype._initArray = function (number, base, endian) {\n if ((assert(typeof number.length == \"number\"), number.length <= 0))\n return (this.words = [0]), (this.length = 1), this;\n (this.length = Math.ceil(number.length / 3)), (this.words = new Array(this.length));\n for (var i = 0; i < this.length; i++) this.words[i] = 0;\n var j,\n w,\n off = 0;\n if (endian === \"be\")\n for (i = number.length - 1, j = 0; i >= 0; i -= 3)\n (w = number[i] | (number[i - 1] << 8) | (number[i - 2] << 16)),\n (this.words[j] |= (w << off) & 67108863),\n (this.words[j + 1] = (w >>> (26 - off)) & 67108863),\n (off += 24),\n off >= 26 && ((off -= 26), j++);\n else if (endian === \"le\")\n for (i = 0, j = 0; i < number.length; i += 3)\n (w = number[i] | (number[i + 1] << 8) | (number[i + 2] << 16)),\n (this.words[j] |= (w << off) & 67108863),\n (this.words[j + 1] = (w >>> (26 - off)) & 67108863),\n (off += 24),\n off >= 26 && ((off -= 26), j++);\n return this.strip();\n });\n function parseHex4Bits(string, index) {\n var c = string.charCodeAt(index);\n return c >= 65 && c <= 70 ? c - 55 : c >= 97 && c <= 102 ? c - 87 : (c - 48) & 15;\n }\n function parseHexByte(string, lowerBound, index) {\n var r = parseHex4Bits(string, index);\n return index - 1 >= lowerBound && (r |= parseHex4Bits(string, index - 1) << 4), r;\n }\n BN.prototype._parseHex = function (number, start, endian) {\n (this.length = Math.ceil((number.length - start) / 6)), (this.words = new Array(this.length));\n for (var i = 0; i < this.length; i++) this.words[i] = 0;\n var off = 0,\n j = 0,\n w;\n if (endian === \"be\")\n for (i = number.length - 1; i >= start; i -= 2)\n (w = parseHexByte(number, start, i) << off),\n (this.words[j] |= w & 67108863),\n off >= 18 ? ((off -= 18), (j += 1), (this.words[j] |= w >>> 26)) : (off += 8);\n else {\n var parseLength = number.length - start;\n for (i = parseLength % 2 === 0 ? start + 1 : start; i < number.length; i += 2)\n (w = parseHexByte(number, start, i) << off),\n (this.words[j] |= w & 67108863),\n off >= 18 ? ((off -= 18), (j += 1), (this.words[j] |= w >>> 26)) : (off += 8);\n }\n this.strip();\n };\n function parseBase(str, start, end, mul) {\n for (var r = 0, len = Math.min(str.length, end), i = start; i < len; i++) {\n var c = str.charCodeAt(i) - 48;\n (r *= mul), c >= 49 ? (r += c - 49 + 10) : c >= 17 ? (r += c - 17 + 10) : (r += c);\n }\n return r;\n }\n (BN.prototype._parseBase = function (number, base, start) {\n (this.words = [0]), (this.length = 1);\n for (var limbLen = 0, limbPow = 1; limbPow <= 67108863; limbPow *= base) limbLen++;\n limbLen--, (limbPow = (limbPow / base) | 0);\n for (\n var total = number.length - start,\n mod = total % limbLen,\n end = Math.min(total, total - mod) + start,\n word = 0,\n i = start;\n i < end;\n i += limbLen\n )\n (word = parseBase(number, i, i + limbLen, base)),\n this.imuln(limbPow),\n this.words[0] + word < 67108864 ? (this.words[0] += word) : this._iaddn(word);\n if (mod !== 0) {\n var pow = 1;\n for (word = parseBase(number, i, number.length, base), i = 0; i < mod; i++) pow *= base;\n this.imuln(pow), this.words[0] + word < 67108864 ? (this.words[0] += word) : this._iaddn(word);\n }\n this.strip();\n }),\n (BN.prototype.copy = function (dest) {\n dest.words = new Array(this.length);\n for (var i = 0; i < this.length; i++) dest.words[i] = this.words[i];\n (dest.length = this.length), (dest.negative = this.negative), (dest.red = this.red);\n }),\n (BN.prototype.clone = function () {\n var r = new BN(null);\n return this.copy(r), r;\n }),\n (BN.prototype._expand = function (size) {\n for (; this.length < size; ) this.words[this.length++] = 0;\n return this;\n }),\n (BN.prototype.strip = function () {\n for (; this.length > 1 && this.words[this.length - 1] === 0; ) this.length--;\n return this._normSign();\n }),\n (BN.prototype._normSign = function () {\n return this.length === 1 && this.words[0] === 0 && (this.negative = 0), this;\n }),\n (BN.prototype.inspect = function () {\n return (this.red ? \"<BN-R: \" : \"<BN: \") + this.toString(16) + \">\";\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 groupSizes = [\n 0, 0, 25, 16, 12, 11, 10, 9, 8, 8, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5,\n 5, 5,\n ],\n groupBases = [\n 0, 0, 33554432, 43046721, 16777216, 48828125, 60466176, 40353607, 16777216, 43046721, 1e7, 19487171, 35831808,\n 62748517, 7529536, 11390625, 16777216, 24137569, 34012224, 47045881, 64e6, 4084101, 5153632, 6436343, 7962624,\n 9765625, 11881376, 14348907, 17210368, 20511149, 243e5, 28629151, 33554432, 39135393, 45435424, 52521875,\n 60466176,\n ];\n (BN.prototype.toString = function (base, padding) {\n (base = base || 10), (padding = padding | 0 || 1);\n var out;\n if (base === 16 || base === \"hex\") {\n out = \"\";\n for (var off = 0, carry = 0, i = 0; i < this.length; i++) {\n var w = this.words[i],\n word = (((w << off) | carry) & 16777215).toString(16);\n (carry = (w >>> (24 - off)) & 16777215),\n carry !== 0 || i !== this.length - 1 ? (out = zeros[6 - word.length] + word + out) : (out = word + out),\n (off += 2),\n off >= 26 && ((off -= 26), i--);\n }\n for (carry !== 0 && (out = carry.toString(16) + out); out.length % padding !== 0; ) out = \"0\" + out;\n return this.negative !== 0 && (out = \"-\" + out), out;\n }\n if (base === (base | 0) && base >= 2 && base <= 36) {\n var groupSize = groupSizes[base],\n groupBase = groupBases[base];\n out = \"\";\n var c = this.clone();\n for (c.negative = 0; !c.isZero(); ) {\n var r = c.modn(groupBase).toString(base);\n (c = c.idivn(groupBase)), c.isZero() ? (out = r + out) : (out = zeros[groupSize - r.length] + r + out);\n }\n for (this.isZero() && (out = \"0\" + out); out.length % padding !== 0; ) out = \"0\" + out;\n return this.negative !== 0 && (out = \"-\" + out), out;\n }\n assert(!1, \"Base should be between 2 and 36\");\n }),\n (BN.prototype.toNumber = function () {\n var ret = this.words[0];\n return (\n this.length === 2\n ? (ret += this.words[1] * 67108864)\n : this.length === 3 && this.words[2] === 1\n ? (ret += 4503599627370496 + this.words[1] * 67108864)\n : this.length > 2 && assert(!1, \"Number can only safely store up to 53 bits\"),\n this.negative !== 0 ? -ret : ret\n );\n }),\n (BN.prototype.toJSON = function () {\n return this.toString(16);\n }),\n (BN.prototype.toBuffer = function (endian, length) {\n return assert(typeof Buffer2 < \"u\"), this.toArrayLike(Buffer2, endian, length);\n }),\n (BN.prototype.toArray = function (endian, length) {\n return this.toArrayLike(Array, endian, length);\n }),\n (BN.prototype.toArrayLike = function (ArrayType, endian, length) {\n var byteLength = this.byteLength(),\n 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 this.strip();\n var littleEndian = endian === \"le\",\n res = new ArrayType(reqLength),\n b,\n i,\n q = this.clone();\n if (littleEndian) {\n for (i = 0; !q.isZero(); i++) (b = q.andln(255)), q.iushrn(8), (res[i] = b);\n for (; i < reqLength; i++) res[i] = 0;\n } else {\n for (i = 0; i < reqLength - byteLength; i++) res[i] = 0;\n for (i = 0; !q.isZero(); i++) (b = q.andln(255)), q.iushrn(8), (res[reqLength - i - 1] = b);\n }\n return res;\n }),\n Math.clz32\n ? (BN.prototype._countBits = function (w) {\n return 32 - Math.clz32(w);\n })\n : (BN.prototype._countBits = function (w) {\n var t = w,\n r = 0;\n return (\n t >= 4096 && ((r += 13), (t >>>= 13)),\n t >= 64 && ((r += 7), (t >>>= 7)),\n t >= 8 && ((r += 4), (t >>>= 4)),\n t >= 2 && ((r += 2), (t >>>= 2)),\n r + t\n );\n }),\n (BN.prototype._zeroBits = function (w) {\n if (w === 0) return 26;\n var t = w,\n r = 0;\n return (\n (t & 8191) === 0 && ((r += 13), (t >>>= 13)),\n (t & 127) === 0 && ((r += 7), (t >>>= 7)),\n (t & 15) === 0 && ((r += 4), (t >>>= 4)),\n (t & 3) === 0 && ((r += 2), (t >>>= 2)),\n (t & 1) === 0 && r++,\n r\n );\n }),\n (BN.prototype.bitLength = function () {\n var w = this.words[this.length - 1],\n hi = this._countBits(w);\n return (this.length - 1) * 26 + hi;\n });\n function toBitArray(num) {\n for (var w = new Array(num.bitLength()), bit = 0; bit < w.length; bit++) {\n var off = (bit / 26) | 0,\n wbit = bit % 26;\n w[bit] = (num.words[off] & (1 << wbit)) >>> wbit;\n }\n return w;\n }\n (BN.prototype.zeroBits = function () {\n if (this.isZero()) return 0;\n for (var r = 0, i = 0; i < this.length; i++) {\n var b = this._zeroBits(this.words[i]);\n if (((r += b), b !== 26)) break;\n }\n return r;\n }),\n (BN.prototype.byteLength = function () {\n return Math.ceil(this.bitLength() / 8);\n }),\n (BN.prototype.toTwos = function (width) {\n return this.negative !== 0 ? this.abs().inotn(width).iaddn(1) : this.clone();\n }),\n (BN.prototype.fromTwos = function (width) {\n return this.testn(width - 1) ? this.notn(width).iaddn(1).ineg() : this.clone();\n }),\n (BN.prototype.isNeg = function () {\n return this.negative !== 0;\n }),\n (BN.prototype.neg = function () {\n return this.clone().ineg();\n }),\n (BN.prototype.ineg = function () {\n return this.isZero() || (this.negative ^= 1), this;\n }),\n (BN.prototype.iuor = function (num) {\n for (; this.length < num.length; ) this.words[this.length++] = 0;\n for (var i = 0; i < num.length; i++) this.words[i] = this.words[i] | num.words[i];\n return this.strip();\n }),\n (BN.prototype.ior = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuor(num);\n }),\n (BN.prototype.or = function (num) {\n return this.length > num.length ? this.clone().ior(num) : num.clone().ior(this);\n }),\n (BN.prototype.uor = function (num) {\n return this.length > num.length ? this.clone().iuor(num) : num.clone().iuor(this);\n }),\n (BN.prototype.iuand = function (num) {\n var b;\n this.length > num.length ? (b = num) : (b = this);\n for (var i = 0; i < b.length; i++) this.words[i] = this.words[i] & num.words[i];\n return (this.length = b.length), this.strip();\n }),\n (BN.prototype.iand = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuand(num);\n }),\n (BN.prototype.and = function (num) {\n return this.length > num.length ? this.clone().iand(num) : num.clone().iand(this);\n }),\n (BN.prototype.uand = function (num) {\n return this.length > num.length ? this.clone().iuand(num) : num.clone().iuand(this);\n }),\n (BN.prototype.iuxor = function (num) {\n var a, b;\n this.length > num.length ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var i = 0; i < b.length; i++) this.words[i] = a.words[i] ^ b.words[i];\n if (this !== a) for (; i < a.length; i++) this.words[i] = a.words[i];\n return (this.length = a.length), this.strip();\n }),\n (BN.prototype.ixor = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuxor(num);\n }),\n (BN.prototype.xor = function (num) {\n return this.length > num.length ? this.clone().ixor(num) : num.clone().ixor(this);\n }),\n (BN.prototype.uxor = function (num) {\n return this.length > num.length ? this.clone().iuxor(num) : num.clone().iuxor(this);\n }),\n (BN.prototype.inotn = function (width) {\n assert(typeof width == \"number\" && width >= 0);\n var bytesNeeded = Math.ceil(width / 26) | 0,\n bitsLeft = width % 26;\n this._expand(bytesNeeded), bitsLeft > 0 && bytesNeeded--;\n for (var i = 0; i < bytesNeeded; i++) this.words[i] = ~this.words[i] & 67108863;\n return bitsLeft > 0 && (this.words[i] = ~this.words[i] & (67108863 >> (26 - bitsLeft))), this.strip();\n }),\n (BN.prototype.notn = function (width) {\n return this.clone().inotn(width);\n }),\n (BN.prototype.setn = function (bit, val) {\n assert(typeof bit == \"number\" && bit >= 0);\n var off = (bit / 26) | 0,\n wbit = bit % 26;\n return (\n this._expand(off + 1),\n val\n ? (this.words[off] = this.words[off] | (1 << wbit))\n : (this.words[off] = this.words[off] & ~(1 << wbit)),\n this.strip()\n );\n }),\n (BN.prototype.iadd = function (num) {\n var r;\n if (this.negative !== 0 && num.negative === 0)\n return (this.negative = 0), (r = this.isub(num)), (this.negative ^= 1), this._normSign();\n if (this.negative === 0 && num.negative !== 0)\n return (num.negative = 0), (r = this.isub(num)), (num.negative = 1), r._normSign();\n var a, b;\n this.length > num.length ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var carry = 0, i = 0; i < b.length; i++)\n (r = (a.words[i] | 0) + (b.words[i] | 0) + carry), (this.words[i] = r & 67108863), (carry = r >>> 26);\n for (; carry !== 0 && i < a.length; i++)\n (r = (a.words[i] | 0) + carry), (this.words[i] = r & 67108863), (carry = r >>> 26);\n if (((this.length = a.length), carry !== 0)) (this.words[this.length] = carry), this.length++;\n else if (a !== this) for (; i < a.length; i++) this.words[i] = a.words[i];\n return this;\n }),\n (BN.prototype.add = function (num) {\n var res;\n return num.negative !== 0 && this.negative === 0\n ? ((num.negative = 0), (res = this.sub(num)), (num.negative ^= 1), res)\n : num.negative === 0 && this.negative !== 0\n ? ((this.negative = 0), (res = num.sub(this)), (this.negative = 1), res)\n : this.length > num.length\n ? this.clone().iadd(num)\n : num.clone().iadd(this);\n }),\n (BN.prototype.isub = function (num) {\n if (num.negative !== 0) {\n num.negative = 0;\n var r = this.iadd(num);\n return (num.negative = 1), r._normSign();\n } else if (this.negative !== 0)\n return (this.negative = 0), this.iadd(num), (this.negative = 1), this._normSign();\n var cmp = this.cmp(num);\n if (cmp === 0) return (this.negative = 0), (this.length = 1), (this.words[0] = 0), this;\n var a, b;\n cmp > 0 ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var carry = 0, i = 0; i < b.length; i++)\n (r = (a.words[i] | 0) - (b.words[i] | 0) + carry), (carry = r >> 26), (this.words[i] = r & 67108863);\n for (; carry !== 0 && i < a.length; i++)\n (r = (a.words[i] | 0) + carry), (carry = r >> 26), (this.words[i] = r & 67108863);\n if (carry === 0 && i < a.length && a !== this) for (; i < a.length; i++) this.words[i] = a.words[i];\n return (this.length = Math.max(this.length, i)), a !== this && (this.negative = 1), this.strip();\n }),\n (BN.prototype.sub = function (num) {\n return this.clone().isub(num);\n });\n function smallMulTo(self2, num, out) {\n out.negative = num.negative ^ self2.negative;\n var len = (self2.length + num.length) | 0;\n (out.length = len), (len = (len - 1) | 0);\n var a = self2.words[0] | 0,\n b = num.words[0] | 0,\n r = a * b,\n lo = r & 67108863,\n carry = (r / 67108864) | 0;\n out.words[0] = lo;\n for (var k = 1; k < len; k++) {\n for (\n var ncarry = carry >>> 26,\n rword = carry & 67108863,\n maxJ = Math.min(k, num.length - 1),\n j = Math.max(0, k - self2.length + 1);\n j <= maxJ;\n j++\n ) {\n var i = (k - j) | 0;\n (a = self2.words[i] | 0),\n (b = num.words[j] | 0),\n (r = a * b + rword),\n (ncarry += (r / 67108864) | 0),\n (rword = r & 67108863);\n }\n (out.words[k] = rword | 0), (carry = ncarry | 0);\n }\n return carry !== 0 ? (out.words[k] = carry | 0) : out.length--, out.strip();\n }\n var comb10MulTo = function (self2, num, out) {\n var a = self2.words,\n b = num.words,\n o = out.words,\n c = 0,\n lo,\n mid,\n hi,\n a0 = a[0] | 0,\n al0 = a0 & 8191,\n ah0 = a0 >>> 13,\n a1 = a[1] | 0,\n al1 = a1 & 8191,\n ah1 = a1 >>> 13,\n a2 = a[2] | 0,\n al2 = a2 & 8191,\n ah2 = a2 >>> 13,\n a3 = a[3] | 0,\n al3 = a3 & 8191,\n ah3 = a3 >>> 13,\n a4 = a[4] | 0,\n al4 = a4 & 8191,\n ah4 = a4 >>> 13,\n a5 = a[5] | 0,\n al5 = a5 & 8191,\n ah5 = a5 >>> 13,\n a6 = a[6] | 0,\n al6 = a6 & 8191,\n ah6 = a6 >>> 13,\n a7 = a[7] | 0,\n al7 = a7 & 8191,\n ah7 = a7 >>> 13,\n a8 = a[8] | 0,\n al8 = a8 & 8191,\n ah8 = a8 >>> 13,\n a9 = a[9] | 0,\n al9 = a9 & 8191,\n ah9 = a9 >>> 13,\n b0 = b[0] | 0,\n bl0 = b0 & 8191,\n bh0 = b0 >>> 13,\n b1 = b[1] | 0,\n bl1 = b1 & 8191,\n bh1 = b1 >>> 13,\n b2 = b[2] | 0,\n bl2 = b2 & 8191,\n bh2 = b2 >>> 13,\n b3 = b[3] | 0,\n bl3 = b3 & 8191,\n bh3 = b3 >>> 13,\n b4 = b[4] | 0,\n bl4 = b4 & 8191,\n bh4 = b4 >>> 13,\n b5 = b[5] | 0,\n bl5 = b5 & 8191,\n bh5 = b5 >>> 13,\n b6 = b[6] | 0,\n bl6 = b6 & 8191,\n bh6 = b6 >>> 13,\n b7 = b[7] | 0,\n bl7 = b7 & 8191,\n bh7 = b7 >>> 13,\n b8 = b[8] | 0,\n bl8 = b8 & 8191,\n bh8 = b8 >>> 13,\n b9 = b[9] | 0,\n bl9 = b9 & 8191,\n bh9 = b9 >>> 13;\n (out.negative = self2.negative ^ num.negative),\n (out.length = 19),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w0 >>> 26)) | 0),\n (w0 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w1 >>> 26)) | 0),\n (w1 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w2 >>> 26)) | 0),\n (w2 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w3 >>> 26)) | 0),\n (w3 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w4 >>> 26)) | 0),\n (w4 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w5 >>> 26)) | 0),\n (w5 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w6 >>> 26)) | 0),\n (w6 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w7 >>> 26)) | 0),\n (w7 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w8 >>> 26)) | 0),\n (w8 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w9 >>> 26)) | 0),\n (w9 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w10 >>> 26)) | 0),\n (w10 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w11 >>> 26)) | 0),\n (w11 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w12 >>> 26)) | 0),\n (w12 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w13 >>> 26)) | 0),\n (w13 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w14 >>> 26)) | 0),\n (w14 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w15 >>> 26)) | 0),\n (w15 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w16 >>> 26)) | 0),\n (w16 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w17 >>> 26)) | 0),\n (w17 &= 67108863),\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 & 8191) << 13)) | 0;\n return (\n (c = (((hi + (mid >>> 13)) | 0) + (w18 >>> 26)) | 0),\n (w18 &= 67108863),\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 c !== 0 && ((o[19] = c), out.length++),\n out\n );\n };\n Math.imul || (comb10MulTo = smallMulTo);\n function bigMulTo(self2, num, out) {\n (out.negative = num.negative ^ self2.negative), (out.length = self2.length + num.length);\n for (var carry = 0, hncarry = 0, k = 0; k < out.length - 1; k++) {\n var ncarry = hncarry;\n hncarry = 0;\n for (\n var rword = carry & 67108863, maxJ = Math.min(k, num.length - 1), j = Math.max(0, k - self2.length + 1);\n j <= maxJ;\n j++\n ) {\n var i = k - j,\n a = self2.words[i] | 0,\n b = num.words[j] | 0,\n r = a * b,\n lo = r & 67108863;\n (ncarry = (ncarry + ((r / 67108864) | 0)) | 0),\n (lo = (lo + rword) | 0),\n (rword = lo & 67108863),\n (ncarry = (ncarry + (lo >>> 26)) | 0),\n (hncarry += ncarry >>> 26),\n (ncarry &= 67108863);\n }\n (out.words[k] = rword), (carry = ncarry), (ncarry = hncarry);\n }\n return carry !== 0 ? (out.words[k] = carry) : out.length--, out.strip();\n }\n function jumboMulTo(self2, num, out) {\n var fftm = new FFTM();\n return fftm.mulp(self2, num, out);\n }\n BN.prototype.mulTo = function (num, out) {\n var res,\n len = this.length + num.length;\n return (\n this.length === 10 && num.length === 10\n ? (res = comb10MulTo(this, num, out))\n : len < 63\n ? (res = smallMulTo(this, num, out))\n : len < 1024\n ? (res = bigMulTo(this, num, out))\n : (res = jumboMulTo(this, num, out)),\n res\n );\n };\n function FFTM(x, y) {\n (this.x = x), (this.y = y);\n }\n (FFTM.prototype.makeRBT = function (N) {\n for (var t = new Array(N), l = BN.prototype._countBits(N) - 1, i = 0; i < N; i++) t[i] = this.revBin(i, l, N);\n return t;\n }),\n (FFTM.prototype.revBin = function (x, l, N) {\n if (x === 0 || x === N - 1) return x;\n for (var rb = 0, i = 0; i < l; i++) (rb |= (x & 1) << (l - i - 1)), (x >>= 1);\n return rb;\n }),\n (FFTM.prototype.permute = function (rbt, rws, iws, rtws, itws, N) {\n for (var i = 0; i < N; i++) (rtws[i] = rws[rbt[i]]), (itws[i] = iws[rbt[i]]);\n }),\n (FFTM.prototype.transform = function (rws, iws, rtws, itws, N, rbt) {\n this.permute(rbt, rws, iws, rtws, itws, N);\n for (var s = 1; s < N; s <<= 1)\n for (\n var l = s << 1, rtwdf = Math.cos((2 * Math.PI) / l), itwdf = Math.sin((2 * Math.PI) / l), p = 0;\n p < N;\n p += l\n )\n for (var rtwdf_ = rtwdf, itwdf_ = itwdf, j = 0; j < s; j++) {\n var re = rtws[p + j],\n ie = itws[p + j],\n ro = rtws[p + j + s],\n io = itws[p + j + s],\n rx = rtwdf_ * ro - itwdf_ * io;\n (io = rtwdf_ * io + itwdf_ * ro),\n (ro = rx),\n (rtws[p + j] = re + ro),\n (itws[p + j] = ie + io),\n (rtws[p + j + s] = re - ro),\n (itws[p + j + s] = ie - io),\n j !== l &&\n ((rx = rtwdf * rtwdf_ - itwdf * itwdf_), (itwdf_ = rtwdf * itwdf_ + itwdf * rtwdf_), (rtwdf_ = rx));\n }\n }),\n (FFTM.prototype.guessLen13b = function (n, m) {\n var N = Math.max(m, n) | 1,\n odd = N & 1,\n i = 0;\n for (N = (N / 2) | 0; N; N = N >>> 1) i++;\n return 1 << (i + 1 + odd);\n }),\n (FFTM.prototype.conjugate = function (rws, iws, N) {\n if (!(N <= 1))\n for (var i = 0; i < N / 2; i++) {\n var t = rws[i];\n (rws[i] = rws[N - i - 1]),\n (rws[N - i - 1] = t),\n (t = iws[i]),\n (iws[i] = -iws[N - i - 1]),\n (iws[N - i - 1] = -t);\n }\n }),\n (FFTM.prototype.normalize13b = function (ws, N) {\n for (var carry = 0, i = 0; i < N / 2; i++) {\n var w = Math.round(ws[2 * i + 1] / N) * 8192 + Math.round(ws[2 * i] / N) + carry;\n (ws[i] = w & 67108863), w < 67108864 ? (carry = 0) : (carry = (w / 67108864) | 0);\n }\n return ws;\n }),\n (FFTM.prototype.convert13b = function (ws, len, rws, N) {\n for (var carry = 0, i = 0; i < len; i++)\n (carry = carry + (ws[i] | 0)),\n (rws[2 * i] = carry & 8191),\n (carry = carry >>> 13),\n (rws[2 * i + 1] = carry & 8191),\n (carry = carry >>> 13);\n for (i = 2 * len; i < N; ++i) rws[i] = 0;\n assert(carry === 0), assert((carry & -8192) === 0);\n }),\n (FFTM.prototype.stub = function (N) {\n for (var ph = new Array(N), i = 0; i < N; i++) ph[i] = 0;\n return ph;\n }),\n (FFTM.prototype.mulp = function (x, y, out) {\n var N = 2 * this.guessLen13b(x.length, y.length),\n rbt = this.makeRBT(N),\n _ = this.stub(N),\n rws = new Array(N),\n rwst = new Array(N),\n iwst = new Array(N),\n nrws = new Array(N),\n nrwst = new Array(N),\n niwst = new Array(N),\n rmws = out.words;\n (rmws.length = N),\n this.convert13b(x.words, x.length, rws, N),\n this.convert13b(y.words, y.length, nrws, N),\n this.transform(rws, _, rwst, iwst, N, rbt),\n this.transform(nrws, _, nrwst, niwst, N, rbt);\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]), (rwst[i] = rx);\n }\n return (\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 (out.negative = x.negative ^ y.negative),\n (out.length = x.length + y.length),\n out.strip()\n );\n }),\n (BN.prototype.mul = function (num) {\n var out = new BN(null);\n return (out.words = new Array(this.length + num.length)), this.mulTo(num, out);\n }),\n (BN.prototype.mulf = function (num) {\n var out = new BN(null);\n return (out.words = new Array(this.length + num.length)), jumboMulTo(this, num, out);\n }),\n (BN.prototype.imul = function (num) {\n return this.clone().mulTo(num, this);\n }),\n (BN.prototype.imuln = function (num) {\n assert(typeof num == \"number\"), assert(num < 67108864);\n for (var carry = 0, i = 0; i < this.length; i++) {\n var w = (this.words[i] | 0) * num,\n lo = (w & 67108863) + (carry & 67108863);\n (carry >>= 26), (carry += (w / 67108864) | 0), (carry += lo >>> 26), (this.words[i] = lo & 67108863);\n }\n return carry !== 0 && ((this.words[i] = carry), this.length++), this;\n }),\n (BN.prototype.muln = function (num) {\n return this.clone().imuln(num);\n }),\n (BN.prototype.sqr = function () {\n return this.mul(this);\n }),\n (BN.prototype.isqr = function () {\n return this.imul(this.clone());\n }),\n (BN.prototype.pow = function (num) {\n var w = toBitArray(num);\n if (w.length === 0) return new BN(1);\n for (var res = this, i = 0; i < w.length && w[i] === 0; i++, res = res.sqr());\n if (++i < w.length) for (var q = res.sqr(); i < w.length; i++, q = q.sqr()) w[i] !== 0 && (res = res.mul(q));\n return res;\n }),\n (BN.prototype.iushln = function (bits) {\n assert(typeof bits == \"number\" && bits >= 0);\n var r = bits % 26,\n s = (bits - r) / 26,\n carryMask = (67108863 >>> (26 - r)) << (26 - r),\n i;\n if (r !== 0) {\n var carry = 0;\n for (i = 0; i < this.length; i++) {\n var newCarry = this.words[i] & carryMask,\n c = ((this.words[i] | 0) - newCarry) << r;\n (this.words[i] = c | carry), (carry = newCarry >>> (26 - r));\n }\n carry && ((this.words[i] = carry), this.length++);\n }\n if (s !== 0) {\n for (i = this.length - 1; i >= 0; i--) this.words[i + s] = this.words[i];\n for (i = 0; i < s; i++) this.words[i] = 0;\n this.length += s;\n }\n return this.strip();\n }),\n (BN.prototype.ishln = function (bits) {\n return assert(this.negative === 0), this.iushln(bits);\n }),\n (BN.prototype.iushrn = function (bits, hint, extended) {\n assert(typeof bits == \"number\" && bits >= 0);\n var h;\n hint ? (h = (hint - (hint % 26)) / 26) : (h = 0);\n var r = bits % 26,\n s = Math.min((bits - r) / 26, this.length),\n mask = 67108863 ^ ((67108863 >>> r) << r),\n maskedWords = extended;\n if (((h -= s), (h = Math.max(0, h)), maskedWords)) {\n for (var i = 0; i < s; i++) maskedWords.words[i] = this.words[i];\n maskedWords.length = s;\n }\n if (s !== 0)\n if (this.length > s) for (this.length -= s, i = 0; i < this.length; i++) this.words[i] = this.words[i + s];\n else (this.words[0] = 0), (this.length = 1);\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)), (carry = word & mask);\n }\n return (\n maskedWords && carry !== 0 && (maskedWords.words[maskedWords.length++] = carry),\n this.length === 0 && ((this.words[0] = 0), (this.length = 1)),\n this.strip()\n );\n }),\n (BN.prototype.ishrn = function (bits, hint, extended) {\n return assert(this.negative === 0), this.iushrn(bits, hint, extended);\n }),\n (BN.prototype.shln = function (bits) {\n return this.clone().ishln(bits);\n }),\n (BN.prototype.ushln = function (bits) {\n return this.clone().iushln(bits);\n }),\n (BN.prototype.shrn = function (bits) {\n return this.clone().ishrn(bits);\n }),\n (BN.prototype.ushrn = function (bits) {\n return this.clone().iushrn(bits);\n }),\n (BN.prototype.testn = function (bit) {\n assert(typeof bit == \"number\" && bit >= 0);\n var r = bit % 26,\n s = (bit - r) / 26,\n q = 1 << r;\n if (this.length <= s) return !1;\n var w = this.words[s];\n return !!(w & q);\n }),\n (BN.prototype.imaskn = function (bits) {\n assert(typeof bits == \"number\" && bits >= 0);\n var r = bits % 26,\n s = (bits - r) / 26;\n if ((assert(this.negative === 0, \"imaskn works only with positive numbers\"), this.length <= s)) return this;\n if ((r !== 0 && s++, (this.length = Math.min(s, this.length)), r !== 0)) {\n var mask = 67108863 ^ ((67108863 >>> r) << r);\n this.words[this.length - 1] &= mask;\n }\n return this.strip();\n }),\n (BN.prototype.maskn = function (bits) {\n return this.clone().imaskn(bits);\n }),\n (BN.prototype.iaddn = function (num) {\n return (\n assert(typeof num == \"number\"),\n assert(num < 67108864),\n num < 0\n ? this.isubn(-num)\n : this.negative !== 0\n ? this.length === 1 && (this.words[0] | 0) < num\n ? ((this.words[0] = num - (this.words[0] | 0)), (this.negative = 0), this)\n : ((this.negative = 0), this.isubn(num), (this.negative = 1), this)\n : this._iaddn(num)\n );\n }),\n (BN.prototype._iaddn = function (num) {\n this.words[0] += num;\n for (var i = 0; i < this.length && this.words[i] >= 67108864; i++)\n (this.words[i] -= 67108864), i === this.length - 1 ? (this.words[i + 1] = 1) : this.words[i + 1]++;\n return (this.length = Math.max(this.length, i + 1)), this;\n }),\n (BN.prototype.isubn = function (num) {\n if ((assert(typeof num == \"number\"), assert(num < 67108864), num < 0)) return this.iaddn(-num);\n if (this.negative !== 0) return (this.negative = 0), this.iaddn(num), (this.negative = 1), this;\n if (((this.words[0] -= num), this.length === 1 && this.words[0] < 0))\n (this.words[0] = -this.words[0]), (this.negative = 1);\n else\n for (var i = 0; i < this.length && this.words[i] < 0; i++)\n (this.words[i] += 67108864), (this.words[i + 1] -= 1);\n return this.strip();\n }),\n (BN.prototype.addn = function (num) {\n return this.clone().iaddn(num);\n }),\n (BN.prototype.subn = function (num) {\n return this.clone().isubn(num);\n }),\n (BN.prototype.iabs = function () {\n return (this.negative = 0), this;\n }),\n (BN.prototype.abs = function () {\n return this.clone().iabs();\n }),\n (BN.prototype._ishlnsubmul = function (num, mul, shift) {\n var len = num.length + shift,\n i;\n this._expand(len);\n var w,\n 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 & 67108863),\n (carry = (w >> 26) - ((right / 67108864) | 0)),\n (this.words[i + shift] = w & 67108863);\n }\n for (; i < this.length - shift; i++)\n (w = (this.words[i + shift] | 0) + carry), (carry = w >> 26), (this.words[i + shift] = w & 67108863);\n if (carry === 0) return this.strip();\n for (assert(carry === -1), carry = 0, i = 0; i < this.length; i++)\n (w = -(this.words[i] | 0) + carry), (carry = w >> 26), (this.words[i] = w & 67108863);\n return (this.negative = 1), this.strip();\n }),\n (BN.prototype._wordDiv = function (num, mode) {\n var shift = this.length - num.length,\n a = this.clone(),\n b = num,\n bhi = b.words[b.length - 1] | 0,\n bhiBits = this._countBits(bhi);\n (shift = 26 - bhiBits),\n shift !== 0 && ((b = b.ushln(shift)), a.iushln(shift), (bhi = b.words[b.length - 1] | 0));\n var m = a.length - b.length,\n q;\n if (mode !== \"mod\") {\n (q = new BN(null)), (q.length = m + 1), (q.words = new Array(q.length));\n for (var i = 0; i < q.length; i++) q.words[i] = 0;\n }\n var diff = a.clone()._ishlnsubmul(b, 1, m);\n diff.negative === 0 && ((a = diff), q && (q.words[m] = 1));\n for (var j = m - 1; j >= 0; j--) {\n var qj = (a.words[b.length + j] | 0) * 67108864 + (a.words[b.length + j - 1] | 0);\n for (qj = Math.min((qj / bhi) | 0, 67108863), a._ishlnsubmul(b, qj, j); a.negative !== 0; )\n qj--, (a.negative = 0), a._ishlnsubmul(b, 1, j), a.isZero() || (a.negative ^= 1);\n q && (q.words[j] = qj);\n }\n return (\n q && q.strip(),\n a.strip(),\n mode !== \"div\" && shift !== 0 && a.iushrn(shift),\n {\n div: q || null,\n mod: a,\n }\n );\n }),\n (BN.prototype.divmod = function (num, mode, positive) {\n if ((assert(!num.isZero()), this.isZero()))\n return {\n div: new BN(0),\n mod: new BN(0),\n };\n var div, mod, res;\n return this.negative !== 0 && num.negative === 0\n ? ((res = this.neg().divmod(num, mode)),\n mode !== \"mod\" && (div = res.div.neg()),\n mode !== \"div\" && ((mod = res.mod.neg()), positive && mod.negative !== 0 && mod.iadd(num)),\n {\n div,\n mod,\n })\n : this.negative === 0 && num.negative !== 0\n ? ((res = this.divmod(num.neg(), mode)),\n mode !== \"mod\" && (div = res.div.neg()),\n {\n div,\n mod: res.mod,\n })\n : (this.negative & num.negative) !== 0\n ? ((res = this.neg().divmod(num.neg(), mode)),\n mode !== \"div\" && ((mod = res.mod.neg()), positive && mod.negative !== 0 && mod.isub(num)),\n {\n div: res.div,\n mod,\n })\n : num.length > this.length || this.cmp(num) < 0\n ? {\n div: new BN(0),\n mod: this,\n }\n : num.length === 1\n ? mode === \"div\"\n ? {\n div: this.divn(num.words[0]),\n mod: null,\n }\n : mode === \"mod\"\n ? {\n div: null,\n mod: new BN(this.modn(num.words[0])),\n }\n : {\n div: this.divn(num.words[0]),\n mod: new BN(this.modn(num.words[0])),\n }\n : this._wordDiv(num, mode);\n }),\n (BN.prototype.div = function (num) {\n return this.divmod(num, \"div\", !1).div;\n }),\n (BN.prototype.mod = function (num) {\n return this.divmod(num, \"mod\", !1).mod;\n }),\n (BN.prototype.umod = function (num) {\n return this.divmod(num, \"mod\", !0).mod;\n }),\n (BN.prototype.divRound = function (num) {\n var dm = this.divmod(num);\n if (dm.mod.isZero()) return dm.div;\n var mod = dm.div.negative !== 0 ? dm.mod.isub(num) : dm.mod,\n half = num.ushrn(1),\n r2 = num.andln(1),\n cmp = mod.cmp(half);\n return cmp < 0 || (r2 === 1 && cmp === 0)\n ? dm.div\n : dm.div.negative !== 0\n ? dm.div.isubn(1)\n : dm.div.iaddn(1);\n }),\n (BN.prototype.modn = function (num) {\n assert(num <= 67108863);\n for (var p = (1 << 26) % num, acc = 0, i = this.length - 1; i >= 0; i--)\n acc = (p * acc + (this.words[i] | 0)) % num;\n return acc;\n }),\n (BN.prototype.idivn = function (num) {\n assert(num <= 67108863);\n for (var carry = 0, i = this.length - 1; i >= 0; i--) {\n var w = (this.words[i] | 0) + carry * 67108864;\n (this.words[i] = (w / num) | 0), (carry = w % num);\n }\n return this.strip();\n }),\n (BN.prototype.divn = function (num) {\n return this.clone().idivn(num);\n }),\n (BN.prototype.egcd = function (p) {\n assert(p.negative === 0), assert(!p.isZero());\n var x = this,\n y = p.clone();\n x.negative !== 0 ? (x = x.umod(p)) : (x = x.clone());\n for (var A = new BN(1), B = new BN(0), C = new BN(0), D = new BN(1), g = 0; x.isEven() && y.isEven(); )\n x.iushrn(1), y.iushrn(1), ++g;\n for (var yp = y.clone(), xp = x.clone(); !x.isZero(); ) {\n for (var i = 0, im = 1; (x.words[0] & im) === 0 && i < 26; ++i, im <<= 1);\n if (i > 0)\n for (x.iushrn(i); i-- > 0; )\n (A.isOdd() || B.isOdd()) && (A.iadd(yp), B.isub(xp)), A.iushrn(1), B.iushrn(1);\n for (var j = 0, jm = 1; (y.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n if (j > 0)\n for (y.iushrn(j); j-- > 0; )\n (C.isOdd() || D.isOdd()) && (C.iadd(yp), D.isub(xp)), C.iushrn(1), D.iushrn(1);\n x.cmp(y) >= 0 ? (x.isub(y), A.isub(C), B.isub(D)) : (y.isub(x), C.isub(A), D.isub(B));\n }\n return {\n a: C,\n b: D,\n gcd: y.iushln(g),\n };\n }),\n (BN.prototype._invmp = function (p) {\n assert(p.negative === 0), assert(!p.isZero());\n var a = this,\n b = p.clone();\n a.negative !== 0 ? (a = a.umod(p)) : (a = a.clone());\n for (var x1 = new BN(1), x2 = new BN(0), delta = b.clone(); 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) for (a.iushrn(i); i-- > 0; ) x1.isOdd() && x1.iadd(delta), x1.iushrn(1);\n for (var j = 0, jm = 1; (b.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n if (j > 0) for (b.iushrn(j); j-- > 0; ) x2.isOdd() && x2.iadd(delta), x2.iushrn(1);\n a.cmp(b) >= 0 ? (a.isub(b), x1.isub(x2)) : (b.isub(a), x2.isub(x1));\n }\n var res;\n return a.cmpn(1) === 0 ? (res = x1) : (res = x2), res.cmpn(0) < 0 && res.iadd(p), res;\n }),\n (BN.prototype.gcd = function (num) {\n if (this.isZero()) return num.abs();\n if (num.isZero()) return this.abs();\n var a = this.clone(),\n b = num.clone();\n (a.negative = 0), (b.negative = 0);\n for (var shift = 0; a.isEven() && b.isEven(); shift++) a.iushrn(1), b.iushrn(1);\n do {\n for (; a.isEven(); ) a.iushrn(1);\n for (; b.isEven(); ) b.iushrn(1);\n var r = a.cmp(b);\n if (r < 0) {\n var t = a;\n (a = b), (b = t);\n } else if (r === 0 || b.cmpn(1) === 0) break;\n a.isub(b);\n } while (!0);\n return b.iushln(shift);\n }),\n (BN.prototype.invm = function (num) {\n return this.egcd(num).a.umod(num);\n }),\n (BN.prototype.isEven = function () {\n return (this.words[0] & 1) === 0;\n }),\n (BN.prototype.isOdd = function () {\n return (this.words[0] & 1) === 1;\n }),\n (BN.prototype.andln = function (num) {\n return this.words[0] & num;\n }),\n (BN.prototype.bincn = function (bit) {\n assert(typeof bit == \"number\");\n var r = bit % 26,\n s = (bit - r) / 26,\n q = 1 << r;\n if (this.length <= s) return this._expand(s + 1), (this.words[s] |= q), this;\n for (var carry = q, i = s; carry !== 0 && i < this.length; i++) {\n var w = this.words[i] | 0;\n (w += carry), (carry = w >>> 26), (w &= 67108863), (this.words[i] = w);\n }\n return carry !== 0 && ((this.words[i] = carry), this.length++), this;\n }),\n (BN.prototype.isZero = function () {\n return this.length === 1 && this.words[0] === 0;\n }),\n (BN.prototype.cmpn = function (num) {\n var negative = num < 0;\n if (this.negative !== 0 && !negative) return -1;\n if (this.negative === 0 && negative) return 1;\n this.strip();\n var res;\n if (this.length > 1) res = 1;\n else {\n negative && (num = -num), assert(num <= 67108863, \"Number is too big\");\n var w = this.words[0] | 0;\n res = w === num ? 0 : w < num ? -1 : 1;\n }\n return this.negative !== 0 ? -res | 0 : res;\n }),\n (BN.prototype.cmp = function (num) {\n if (this.negative !== 0 && num.negative === 0) return -1;\n if (this.negative === 0 && num.negative !== 0) return 1;\n var res = this.ucmp(num);\n return this.negative !== 0 ? -res | 0 : res;\n }),\n (BN.prototype.ucmp = function (num) {\n if (this.length > num.length) return 1;\n if (this.length < num.length) return -1;\n for (var res = 0, i = this.length - 1; i >= 0; i--) {\n var a = this.words[i] | 0,\n b = num.words[i] | 0;\n if (a !== b) {\n a < b ? (res = -1) : a > b && (res = 1);\n break;\n }\n }\n return res;\n }),\n (BN.prototype.gtn = function (num) {\n return this.cmpn(num) === 1;\n }),\n (BN.prototype.gt = function (num) {\n return this.cmp(num) === 1;\n }),\n (BN.prototype.gten = function (num) {\n return this.cmpn(num) >= 0;\n }),\n (BN.prototype.gte = function (num) {\n return this.cmp(num) >= 0;\n }),\n (BN.prototype.ltn = function (num) {\n return this.cmpn(num) === -1;\n }),\n (BN.prototype.lt = function (num) {\n return this.cmp(num) === -1;\n }),\n (BN.prototype.lten = function (num) {\n return this.cmpn(num) <= 0;\n }),\n (BN.prototype.lte = function (num) {\n return this.cmp(num) <= 0;\n }),\n (BN.prototype.eqn = function (num) {\n return this.cmpn(num) === 0;\n }),\n (BN.prototype.eq = function (num) {\n return this.cmp(num) === 0;\n }),\n (BN.red = function (num) {\n return new Red(num);\n }),\n (BN.prototype.toRed = function (ctx) {\n return (\n assert(!this.red, \"Already a number in reduction context\"),\n assert(this.negative === 0, \"red works only with positives\"),\n ctx.convertTo(this)._forceRed(ctx)\n );\n }),\n (BN.prototype.fromRed = function () {\n return assert(this.red, \"fromRed works only with numbers in reduction context\"), this.red.convertFrom(this);\n }),\n (BN.prototype._forceRed = function (ctx) {\n return (this.red = ctx), this;\n }),\n (BN.prototype.forceRed = function (ctx) {\n return assert(!this.red, \"Already a number in reduction context\"), this._forceRed(ctx);\n }),\n (BN.prototype.redAdd = function (num) {\n return assert(this.red, \"redAdd works only with red numbers\"), this.red.add(this, num);\n }),\n (BN.prototype.redIAdd = function (num) {\n return assert(this.red, \"redIAdd works only with red numbers\"), this.red.iadd(this, num);\n }),\n (BN.prototype.redSub = function (num) {\n return assert(this.red, \"redSub works only with red numbers\"), this.red.sub(this, num);\n }),\n (BN.prototype.redISub = function (num) {\n return assert(this.red, \"redISub works only with red numbers\"), this.red.isub(this, num);\n }),\n (BN.prototype.redShl = function (num) {\n return assert(this.red, \"redShl works only with red numbers\"), this.red.shl(this, num);\n }),\n (BN.prototype.redMul = function (num) {\n return (\n assert(this.red, \"redMul works only with red numbers\"),\n this.red._verify2(this, num),\n this.red.mul(this, num)\n );\n }),\n (BN.prototype.redIMul = function (num) {\n return (\n assert(this.red, \"redMul works only with red numbers\"),\n this.red._verify2(this, num),\n this.red.imul(this, num)\n );\n }),\n (BN.prototype.redSqr = function () {\n return assert(this.red, \"redSqr works only with red numbers\"), this.red._verify1(this), this.red.sqr(this);\n }),\n (BN.prototype.redISqr = function () {\n return assert(this.red, \"redISqr works only with red numbers\"), this.red._verify1(this), this.red.isqr(this);\n }),\n (BN.prototype.redSqrt = function () {\n return assert(this.red, \"redSqrt works only with red numbers\"), this.red._verify1(this), this.red.sqrt(this);\n }),\n (BN.prototype.redInvm = function () {\n return assert(this.red, \"redInvm works only with red numbers\"), this.red._verify1(this), this.red.invm(this);\n }),\n (BN.prototype.redNeg = function () {\n return assert(this.red, \"redNeg works only with red numbers\"), this.red._verify1(this), this.red.neg(this);\n }),\n (BN.prototype.redPow = function (num) {\n return assert(this.red && !num.red, \"redPow(normalNum)\"), this.red._verify1(this), this.red.pow(this, num);\n });\n var primes = {\n k256: null,\n p224: null,\n p192: null,\n p25519: null,\n };\n function MPrime(name, p) {\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 (this.tmp = this._tmp());\n }\n (MPrime.prototype._tmp = function () {\n var tmp = new BN(null);\n return (tmp.words = new Array(Math.ceil(this.n / 13))), tmp;\n }),\n (MPrime.prototype.ireduce = function (num) {\n var r = num,\n rlen;\n do this.split(r, this.tmp), (r = this.imulK(r)), (r = r.iadd(this.tmp)), (rlen = r.bitLength());\n while (rlen > this.n);\n var cmp = rlen < this.n ? -1 : r.ucmp(this.p);\n return (\n cmp === 0\n ? ((r.words[0] = 0), (r.length = 1))\n : cmp > 0\n ? r.isub(this.p)\n : r.strip !== void 0\n ? r.strip()\n : r._strip(),\n r\n );\n }),\n (MPrime.prototype.split = function (input, out) {\n input.iushrn(this.n, 0, out);\n }),\n (MPrime.prototype.imulK = function (num) {\n return num.imul(this.k);\n });\n function K256() {\n MPrime.call(this, \"k256\", \"ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f\");\n }\n inherits(K256, MPrime),\n (K256.prototype.split = function (input, output) {\n for (var mask = 4194303, outLen = Math.min(input.length, 9), i = 0; i < outLen; i++)\n output.words[i] = input.words[i];\n if (((output.length = outLen), input.length <= 9)) {\n (input.words[0] = 0), (input.length = 1);\n return;\n }\n var prev = input.words[9];\n for (output.words[output.length++] = prev & mask, i = 10; i < input.length; i++) {\n var next = input.words[i] | 0;\n (input.words[i - 10] = ((next & mask) << 4) | (prev >>> 22)), (prev = next);\n }\n (prev >>>= 22),\n (input.words[i - 10] = prev),\n prev === 0 && input.length > 10 ? (input.length -= 10) : (input.length -= 9);\n }),\n (K256.prototype.imulK = function (num) {\n (num.words[num.length] = 0), (num.words[num.length + 1] = 0), (num.length += 2);\n for (var lo = 0, i = 0; i < num.length; i++) {\n var w = num.words[i] | 0;\n (lo += w * 977), (num.words[i] = lo & 67108863), (lo = w * 64 + ((lo / 67108864) | 0));\n }\n return (\n num.words[num.length - 1] === 0 && (num.length--, num.words[num.length - 1] === 0 && num.length--), num\n );\n });\n function P224() {\n MPrime.call(this, \"p224\", \"ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001\");\n }\n inherits(P224, MPrime);\n function P192() {\n MPrime.call(this, \"p192\", \"ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff\");\n }\n inherits(P192, MPrime);\n function P25519() {\n MPrime.call(this, \"25519\", \"7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed\");\n }\n inherits(P25519, MPrime),\n (P25519.prototype.imulK = function (num) {\n for (var carry = 0, i = 0; i < num.length; i++) {\n var hi = (num.words[i] | 0) * 19 + carry,\n lo = hi & 67108863;\n (hi >>>= 26), (num.words[i] = lo), (carry = hi);\n }\n return carry !== 0 && (num.words[num.length++] = carry), num;\n }),\n (BN._prime = function (name) {\n if (primes[name]) return primes[name];\n var prime2;\n if (name === \"k256\") prime2 = new K256();\n else if (name === \"p224\") prime2 = new P224();\n else if (name === \"p192\") prime2 = new P192();\n else if (name === \"p25519\") prime2 = new P25519();\n else throw new Error(\"Unknown prime \" + name);\n return (primes[name] = prime2), prime2;\n });\n function Red(m) {\n if (typeof m == \"string\") {\n var prime = BN._prime(m);\n (this.m = prime.p), (this.prime = prime);\n } else assert(m.gtn(1), \"modulus must be greater than 1\"), (this.m = m), (this.prime = null);\n }\n (Red.prototype._verify1 = function (a) {\n assert(a.negative === 0, \"red works only with positives\"), assert(a.red, \"red works only with red numbers\");\n }),\n (Red.prototype._verify2 = function (a, b) {\n assert((a.negative | b.negative) === 0, \"red works only with positives\"),\n assert(a.red && a.red === b.red, \"red works only with red numbers\");\n }),\n (Red.prototype.imod = function (a) {\n return this.prime ? this.prime.ireduce(a)._forceRed(this) : a.umod(this.m)._forceRed(this);\n }),\n (Red.prototype.neg = function (a) {\n return a.isZero() ? a.clone() : this.m.sub(a)._forceRed(this);\n }),\n (Red.prototype.add = function (a, b) {\n this._verify2(a, b);\n var res = a.add(b);\n return res.cmp(this.m) >= 0 && res.isub(this.m), res._forceRed(this);\n }),\n (Red.prototype.iadd = function (a, b) {\n this._verify2(a, b);\n var res = a.iadd(b);\n return res.cmp(this.m) >= 0 && res.isub(this.m), res;\n }),\n (Red.prototype.sub = function (a, b) {\n this._verify2(a, b);\n var res = a.sub(b);\n return res.cmpn(0) < 0 && res.iadd(this.m), res._forceRed(this);\n }),\n (Red.prototype.isub = function (a, b) {\n this._verify2(a, b);\n var res = a.isub(b);\n return res.cmpn(0) < 0 && res.iadd(this.m), res;\n }),\n (Red.prototype.shl = function (a, num) {\n return this._verify1(a), this.imod(a.ushln(num));\n }),\n (Red.prototype.imul = function (a, b) {\n return this._verify2(a, b), this.imod(a.imul(b));\n }),\n (Red.prototype.mul = function (a, b) {\n return this._verify2(a, b), this.imod(a.mul(b));\n }),\n (Red.prototype.isqr = function (a) {\n return this.imul(a, a.clone());\n }),\n (Red.prototype.sqr = function (a) {\n return this.mul(a, a);\n }),\n (Red.prototype.sqrt = function (a) {\n if (a.isZero()) return a.clone();\n var mod3 = this.m.andln(3);\n if ((assert(mod3 % 2 === 1), mod3 === 3)) {\n var pow = this.m.add(new BN(1)).iushrn(2);\n return this.pow(a, pow);\n }\n for (var q = this.m.subn(1), s = 0; !q.isZero() && q.andln(1) === 0; ) s++, q.iushrn(1);\n assert(!q.isZero());\n var one = new BN(1).toRed(this),\n nOne = one.redNeg(),\n lpow = this.m.subn(1).iushrn(1),\n z = this.m.bitLength();\n for (z = new BN(2 * z * z).toRed(this); this.pow(z, lpow).cmp(nOne) !== 0; ) z.redIAdd(nOne);\n for (\n var c = this.pow(z, q), r = this.pow(a, q.addn(1).iushrn(1)), t = this.pow(a, q), m = s;\n t.cmp(one) !== 0;\n\n ) {\n for (var tmp = t, i = 0; tmp.cmp(one) !== 0; i++) tmp = tmp.redSqr();\n assert(i < m);\n var b = this.pow(c, new BN(1).iushln(m - i - 1));\n (r = r.redMul(b)), (c = b.redSqr()), (t = t.redMul(c)), (m = i);\n }\n return r;\n }),\n (Red.prototype.invm = function (a) {\n var inv = a._invmp(this.m);\n return inv.negative !== 0 ? ((inv.negative = 0), this.imod(inv).redNeg()) : this.imod(inv);\n }),\n (Red.prototype.pow = function (a, num) {\n if (num.isZero()) return new BN(1).toRed(this);\n if (num.cmpn(1) === 0) return a.clone();\n var windowSize = 4,\n wnd = new Array(1 << windowSize);\n (wnd[0] = new BN(1).toRed(this)), (wnd[1] = a);\n for (var i = 2; i < wnd.length; i++) wnd[i] = this.mul(wnd[i - 1], a);\n var res = wnd[0],\n current = 0,\n currentLen = 0,\n start = num.bitLength() % 26;\n for (start === 0 && (start = 26), i = num.length - 1; i >= 0; i--) {\n for (var word = num.words[i], j = start - 1; j >= 0; j--) {\n var bit = (word >> j) & 1;\n if ((res !== wnd[0] && (res = this.sqr(res)), bit === 0 && current === 0)) {\n currentLen = 0;\n continue;\n }\n (current <<= 1),\n (current |= bit),\n currentLen++,\n !(currentLen !== windowSize && (i !== 0 || j !== 0)) &&\n ((res = this.mul(res, wnd[current])), (currentLen = 0), (current = 0));\n }\n start = 26;\n }\n return res;\n }),\n (Red.prototype.convertTo = function (num) {\n var r = num.umod(this.m);\n return r === num ? r.clone() : r;\n }),\n (Red.prototype.convertFrom = function (num) {\n var res = num.clone();\n return (res.red = null), res;\n }),\n (BN.mont = function (num) {\n return new Mont(num);\n });\n function Mont(m) {\n Red.call(this, m),\n (this.shift = this.m.bitLength()),\n this.shift % 26 !== 0 && (this.shift += 26 - (this.shift % 26)),\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 (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 (Mont.prototype.convertTo = function (num) {\n return this.imod(num.ushln(this.shift));\n }),\n (Mont.prototype.convertFrom = function (num) {\n var r = this.imod(num.mul(this.rinv));\n return (r.red = null), r;\n }),\n (Mont.prototype.imul = function (a, b) {\n if (a.isZero() || b.isZero()) return (a.words[0] = 0), (a.length = 1), a;\n var t = a.imul(b),\n c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m),\n u = t.isub(c).iushrn(this.shift),\n res = u;\n return (\n u.cmp(this.m) >= 0 ? (res = u.isub(this.m)) : u.cmpn(0) < 0 && (res = u.iadd(this.m)), res._forceRed(this)\n );\n }),\n (Mont.prototype.mul = function (a, b) {\n if (a.isZero() || b.isZero()) return new BN(0)._forceRed(this);\n var t = a.mul(b),\n c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m),\n u = t.isub(c).iushrn(this.shift),\n res = u;\n return (\n u.cmp(this.m) >= 0 ? (res = u.isub(this.m)) : u.cmpn(0) < 0 && (res = u.iadd(this.m)), res._forceRed(this)\n );\n }),\n (Mont.prototype.invm = function (a) {\n var res = this.imod(a._invmp(this.m).mul(this.r2));\n return res._forceRed(this);\n });\n })(typeof module > \"u\" || module, exports);\n },\n});\n\n// node_modules/minimalistic-crypto-utils/lib/utils.js\nvar require_utils2 = __commonJS({\n \"node_modules/minimalistic-crypto-utils/lib/utils.js\"(exports) {\n \"use strict\";\n var utils = exports;\n function toArray(msg, enc) {\n if (Array.isArray(msg)) return msg.slice();\n if (!msg) return [];\n var res = [];\n if (typeof msg != \"string\") {\n for (var i = 0; i < msg.length; i++) res[i] = msg[i] | 0;\n return res;\n }\n if (enc === \"hex\") {\n (msg = msg.replace(/[^a-z0-9]+/gi, \"\")), msg.length % 2 !== 0 && (msg = \"0\" + msg);\n for (var i = 0; i < msg.length; i += 2) res.push(parseInt(msg[i] + msg[i + 1], 16));\n } else\n for (var i = 0; i < msg.length; i++) {\n var c = msg.charCodeAt(i),\n hi = c >> 8,\n lo = c & 255;\n hi ? res.push(hi, lo) : res.push(lo);\n }\n return res;\n }\n utils.toArray = toArray;\n function zero2(word) {\n return word.length === 1 ? \"0\" + word : word;\n }\n utils.zero2 = zero2;\n function toHex(msg) {\n for (var res = \"\", i = 0; i < msg.length; i++) res += zero2(msg[i].toString(16));\n return res;\n }\n utils.toHex = toHex;\n utils.encode = function (arr, enc) {\n return enc === \"hex\" ? toHex(arr) : arr;\n };\n },\n});\n\n// node_modules/elliptic/lib/elliptic/utils.js\nvar require_utils3 = __commonJS({\n \"node_modules/elliptic/lib/elliptic/utils.js\"(exports) {\n \"use strict\";\n var utils = exports,\n BN = require_bn4(),\n minAssert = require_minimalistic_assert(),\n minUtils = require_utils2();\n utils.assert = minAssert;\n utils.toArray = minUtils.toArray;\n utils.zero2 = minUtils.zero2;\n utils.toHex = minUtils.toHex;\n utils.encode = minUtils.encode;\n function getNAF(num, w, bits) {\n var naf = new Array(Math.max(num.bitLength(), bits) + 1);\n naf.fill(0);\n for (var ws = 1 << (w + 1), k = num.clone(), i = 0; i < naf.length; i++) {\n var z,\n mod = k.andln(ws - 1);\n k.isOdd() ? (mod > (ws >> 1) - 1 ? (z = (ws >> 1) - mod) : (z = mod), k.isubn(z)) : (z = 0),\n (naf[i] = z),\n k.iushrn(1);\n }\n return naf;\n }\n utils.getNAF = getNAF;\n function getJSF(k1, k2) {\n var jsf = [[], []];\n (k1 = k1.clone()), (k2 = k2.clone());\n for (var d1 = 0, d2 = 0, m8; k1.cmpn(-d1) > 0 || k2.cmpn(-d2) > 0; ) {\n var m14 = (k1.andln(3) + d1) & 3,\n m24 = (k2.andln(3) + d2) & 3;\n m14 === 3 && (m14 = -1), m24 === 3 && (m24 = -1);\n var u1;\n (m14 & 1) === 0\n ? (u1 = 0)\n : ((m8 = (k1.andln(7) + d1) & 7), (m8 === 3 || m8 === 5) && m24 === 2 ? (u1 = -m14) : (u1 = m14)),\n jsf[0].push(u1);\n var u2;\n (m24 & 1) === 0\n ? (u2 = 0)\n : ((m8 = (k2.andln(7) + d2) & 7), (m8 === 3 || m8 === 5) && m14 === 2 ? (u2 = -m24) : (u2 = m24)),\n jsf[1].push(u2),\n 2 * d1 === u1 + 1 && (d1 = 1 - d1),\n 2 * d2 === u2 + 1 && (d2 = 1 - d2),\n k1.iushrn(1),\n k2.iushrn(1);\n }\n return jsf;\n }\n utils.getJSF = getJSF;\n function cachedProperty(obj, name, computer) {\n var key = \"_\" + name;\n obj.prototype[name] = function () {\n return this[key] !== void 0 ? this[key] : (this[key] = computer.call(this));\n };\n }\n utils.cachedProperty = cachedProperty;\n function parseBytes(bytes) {\n return typeof bytes == \"string\" ? utils.toArray(bytes, \"hex\") : bytes;\n }\n utils.parseBytes = parseBytes;\n function intFromLE(bytes) {\n return new BN(bytes, \"hex\", \"le\");\n }\n utils.intFromLE = intFromLE;\n },\n});\n\n// node_modules/elliptic/lib/elliptic/curve/base.js\nvar require_base = __commonJS({\n \"node_modules/elliptic/lib/elliptic/curve/base.js\"(exports, module) {\n \"use strict\";\n var BN = require_bn4(),\n utils = require_utils3(),\n getNAF = utils.getNAF,\n getJSF = utils.getJSF,\n assert = utils.assert;\n function BaseCurve(type, conf) {\n (this.type = type),\n (this.p = new BN(conf.p, 16)),\n (this.red = conf.prime ? BN.red(conf.prime) : BN.mont(this.p)),\n (this.zero = new BN(0).toRed(this.red)),\n (this.one = new BN(1).toRed(this.red)),\n (this.two = new BN(2).toRed(this.red)),\n (this.n = conf.n && new BN(conf.n, 16)),\n (this.g = conf.g && this.pointFromJSON(conf.g, conf.gRed)),\n (this._wnafT1 = new Array(4)),\n (this._wnafT2 = new Array(4)),\n (this._wnafT3 = new Array(4)),\n (this._wnafT4 = new Array(4)),\n (this._bitLength = this.n ? this.n.bitLength() : 0);\n var adjustCount = this.n && this.p.div(this.n);\n !adjustCount || adjustCount.cmpn(100) > 0\n ? (this.redN = null)\n : ((this._maxwellTrick = !0), (this.redN = this.n.toRed(this.red)));\n }\n module.exports = BaseCurve;\n BaseCurve.prototype.point = function () {\n throw new Error(\"Not implemented\");\n };\n BaseCurve.prototype.validate = function () {\n throw new Error(\"Not implemented\");\n };\n BaseCurve.prototype._fixedNafMul = function (p, k) {\n assert(p.precomputed);\n var doubles = p._getDoubles(),\n naf = getNAF(k, 1, this._bitLength),\n I = (1 << (doubles.step + 1)) - (doubles.step % 2 === 0 ? 2 : 1);\n I /= 3;\n var repr = [],\n j,\n nafW;\n for (j = 0; j < naf.length; j += doubles.step) {\n nafW = 0;\n for (var l = j + doubles.step - 1; l >= j; l--) nafW = (nafW << 1) + naf[l];\n repr.push(nafW);\n }\n for (var a = this.jpoint(null, null, null), b = this.jpoint(null, null, null), i = I; i > 0; i--) {\n for (j = 0; j < repr.length; j++)\n (nafW = repr[j]),\n nafW === i ? (b = b.mixedAdd(doubles.points[j])) : nafW === -i && (b = b.mixedAdd(doubles.points[j].neg()));\n a = a.add(b);\n }\n return a.toP();\n };\n BaseCurve.prototype._wnafMul = function (p, k) {\n var w = 4,\n nafPoints = p._getNAFPoints(w);\n w = nafPoints.wnd;\n for (\n var wnd = nafPoints.points,\n naf = getNAF(k, w, this._bitLength),\n acc = this.jpoint(null, null, null),\n i = naf.length - 1;\n i >= 0;\n i--\n ) {\n for (var l = 0; i >= 0 && naf[i] === 0; i--) l++;\n if ((i >= 0 && l++, (acc = acc.dblp(l)), i < 0)) break;\n var z = naf[i];\n assert(z !== 0),\n p.type === \"affine\"\n ? z > 0\n ? (acc = acc.mixedAdd(wnd[(z - 1) >> 1]))\n : (acc = acc.mixedAdd(wnd[(-z - 1) >> 1].neg()))\n : z > 0\n ? (acc = acc.add(wnd[(z - 1) >> 1]))\n : (acc = acc.add(wnd[(-z - 1) >> 1].neg()));\n }\n return p.type === \"affine\" ? acc.toP() : acc;\n };\n BaseCurve.prototype._wnafMulAdd = function (defW, points, coeffs, len, jacobianResult) {\n var wndWidth = this._wnafT1,\n wnd = this._wnafT2,\n naf = this._wnafT3,\n max = 0,\n i,\n j,\n p;\n for (i = 0; i < len; i++) {\n p = points[i];\n var nafPoints = p._getNAFPoints(defW);\n (wndWidth[i] = nafPoints.wnd), (wnd[i] = nafPoints.points);\n }\n for (i = len - 1; i >= 1; i -= 2) {\n var a = i - 1,\n b = i;\n if (wndWidth[a] !== 1 || wndWidth[b] !== 1) {\n (naf[a] = getNAF(coeffs[a], wndWidth[a], this._bitLength)),\n (naf[b] = getNAF(coeffs[b], wndWidth[b], this._bitLength)),\n (max = Math.max(naf[a].length, max)),\n (max = Math.max(naf[b].length, max));\n continue;\n }\n var comb = [points[a], null, null, points[b]];\n points[a].y.cmp(points[b].y) === 0\n ? ((comb[1] = points[a].add(points[b])), (comb[2] = points[a].toJ().mixedAdd(points[b].neg())))\n : points[a].y.cmp(points[b].y.redNeg()) === 0\n ? ((comb[1] = points[a].toJ().mixedAdd(points[b])), (comb[2] = points[a].add(points[b].neg())))\n : ((comb[1] = points[a].toJ().mixedAdd(points[b])), (comb[2] = points[a].toJ().mixedAdd(points[b].neg())));\n var index = [-3, -1, -5, -7, 0, 7, 5, 1, 3],\n jsf = getJSF(coeffs[a], coeffs[b]);\n for (\n max = Math.max(jsf[0].length, max), naf[a] = new Array(max), naf[b] = new Array(max), j = 0;\n j < max;\n j++\n ) {\n var ja = jsf[0][j] | 0,\n jb = jsf[1][j] | 0;\n (naf[a][j] = index[(ja + 1) * 3 + (jb + 1)]), (naf[b][j] = 0), (wnd[a] = comb);\n }\n }\n var acc = this.jpoint(null, null, null),\n tmp = this._wnafT4;\n for (i = max; i >= 0; i--) {\n for (var k = 0; i >= 0; ) {\n var zero = !0;\n for (j = 0; j < len; j++) (tmp[j] = naf[j][i] | 0), tmp[j] !== 0 && (zero = !1);\n if (!zero) break;\n k++, i--;\n }\n if ((i >= 0 && k++, (acc = acc.dblp(k)), i < 0)) break;\n for (j = 0; j < len; j++) {\n var z = tmp[j];\n z !== 0 &&\n (z > 0 ? (p = wnd[j][(z - 1) >> 1]) : z < 0 && (p = wnd[j][(-z - 1) >> 1].neg()),\n p.type === \"affine\" ? (acc = acc.mixedAdd(p)) : (acc = acc.add(p)));\n }\n }\n for (i = 0; i < len; i++) wnd[i] = null;\n return jacobianResult ? acc : acc.toP();\n };\n function BasePoint(curve, type) {\n (this.curve = curve), (this.type = type), (this.precomputed = null);\n }\n BaseCurve.BasePoint = BasePoint;\n BasePoint.prototype.eq = function () {\n throw new Error(\"Not implemented\");\n };\n BasePoint.prototype.validate = function () {\n return this.curve.validate(this);\n };\n BaseCurve.prototype.decodePoint = function (bytes, enc) {\n bytes = utils.toArray(bytes, enc);\n var len = this.p.byteLength();\n if ((bytes[0] === 4 || bytes[0] === 6 || bytes[0] === 7) && bytes.length - 1 === 2 * len) {\n bytes[0] === 6\n ? assert(bytes[bytes.length - 1] % 2 === 0)\n : bytes[0] === 7 && assert(bytes[bytes.length - 1] % 2 === 1);\n var res = this.point(bytes.slice(1, 1 + len), bytes.slice(1 + len, 1 + 2 * len));\n return res;\n } else if ((bytes[0] === 2 || bytes[0] === 3) && bytes.length - 1 === len)\n return this.pointFromX(bytes.slice(1, 1 + len), bytes[0] === 3);\n throw new Error(\"Unknown point format\");\n };\n BasePoint.prototype.encodeCompressed = function (enc) {\n return this.encode(enc, !0);\n };\n BasePoint.prototype._encode = function (compact) {\n var len = this.curve.p.byteLength(),\n x = this.getX().toArray(\"be\", len);\n return compact ? [this.getY().isEven() ? 2 : 3].concat(x) : [4].concat(x, this.getY().toArray(\"be\", len));\n };\n BasePoint.prototype.encode = function (enc, compact) {\n return utils.encode(this._encode(compact), enc);\n };\n BasePoint.prototype.precompute = function (power) {\n if (this.precomputed) return this;\n var precomputed = {\n doubles: null,\n naf: null,\n beta: null,\n };\n return (\n (precomputed.naf = this._getNAFPoints(8)),\n (precomputed.doubles = this._getDoubles(4, power)),\n (precomputed.beta = this._getBeta()),\n (this.precomputed = precomputed),\n this\n );\n };\n BasePoint.prototype._hasDoubles = function (k) {\n if (!this.precomputed) return !1;\n var doubles = this.precomputed.doubles;\n return doubles ? doubles.points.length >= Math.ceil((k.bitLength() + 1) / doubles.step) : !1;\n };\n BasePoint.prototype._getDoubles = function (step, power) {\n if (this.precomputed && this.precomputed.doubles) return this.precomputed.doubles;\n for (var doubles = [this], acc = this, i = 0; i < power; i += step) {\n for (var j = 0; j < step; j++) acc = acc.dbl();\n doubles.push(acc);\n }\n return {\n step,\n points: doubles,\n };\n };\n BasePoint.prototype._getNAFPoints = function (wnd) {\n if (this.precomputed && this.precomputed.naf) return this.precomputed.naf;\n for (var res = [this], max = (1 << wnd) - 1, dbl = max === 1 ? null : this.dbl(), i = 1; i < max; i++)\n res[i] = res[i - 1].add(dbl);\n return {\n wnd,\n points: res,\n };\n };\n BasePoint.prototype._getBeta = function () {\n return null;\n };\n BasePoint.prototype.dblp = function (k) {\n for (var r = this, i = 0; i < k; i++) r = r.dbl();\n return r;\n };\n },\n});\n\n// node_modules/elliptic/lib/elliptic/curve/short.js\nvar require_short = __commonJS({\n \"node_modules/elliptic/lib/elliptic/curve/short.js\"(exports, module) {\n \"use strict\";\n var utils = require_utils3(),\n BN = require_bn4(),\n inherits = require_inherits_browser(),\n Base = require_base(),\n assert = utils.assert;\n function ShortCurve(conf) {\n Base.call(this, \"short\", conf),\n (this.a = new BN(conf.a, 16).toRed(this.red)),\n (this.b = new BN(conf.b, 16).toRed(this.red)),\n (this.tinv = this.two.redInvm()),\n (this.zeroA = this.a.fromRed().cmpn(0) === 0),\n (this.threeA = this.a.fromRed().sub(this.p).cmpn(-3) === 0),\n (this.endo = this._getEndomorphism(conf)),\n (this._endoWnafT1 = new Array(4)),\n (this._endoWnafT2 = new Array(4));\n }\n inherits(ShortCurve, Base);\n module.exports = ShortCurve;\n ShortCurve.prototype._getEndomorphism = function (conf) {\n if (!(!this.zeroA || !this.g || !this.n || this.p.modn(3) !== 1)) {\n var beta, lambda;\n if (conf.beta) beta = new BN(conf.beta, 16).toRed(this.red);\n else {\n var betas = this._getEndoRoots(this.p);\n (beta = betas[0].cmp(betas[1]) < 0 ? betas[0] : betas[1]), (beta = beta.toRed(this.red));\n }\n if (conf.lambda) lambda = new BN(conf.lambda, 16);\n else {\n var lambdas = this._getEndoRoots(this.n);\n this.g.mul(lambdas[0]).x.cmp(this.g.x.redMul(beta)) === 0\n ? (lambda = lambdas[0])\n : ((lambda = lambdas[1]), assert(this.g.mul(lambda).x.cmp(this.g.x.redMul(beta)) === 0));\n }\n var basis;\n return (\n conf.basis\n ? (basis = conf.basis.map(function (vec) {\n return {\n a: new BN(vec.a, 16),\n b: new BN(vec.b, 16),\n };\n }))\n : (basis = this._getEndoBasis(lambda)),\n {\n beta,\n lambda,\n basis,\n }\n );\n }\n };\n ShortCurve.prototype._getEndoRoots = function (num) {\n var red = num === this.p ? this.red : BN.mont(num),\n tinv = new BN(2).toRed(red).redInvm(),\n ntinv = tinv.redNeg(),\n s = new BN(3).toRed(red).redNeg().redSqrt().redMul(tinv),\n l1 = ntinv.redAdd(s).fromRed(),\n l2 = ntinv.redSub(s).fromRed();\n return [l1, l2];\n };\n ShortCurve.prototype._getEndoBasis = function (lambda) {\n for (\n var aprxSqrt = this.n.ushrn(Math.floor(this.n.bitLength() / 2)),\n u = lambda,\n v = this.n.clone(),\n x1 = new BN(1),\n y1 = new BN(0),\n x2 = new BN(0),\n y2 = new BN(1),\n a0,\n b0,\n a1,\n b1,\n a2,\n b2,\n prevR,\n i = 0,\n r,\n x;\n u.cmpn(0) !== 0;\n\n ) {\n var q = v.div(u);\n (r = v.sub(q.mul(u))), (x = x2.sub(q.mul(x1)));\n var y = y2.sub(q.mul(y1));\n if (!a1 && r.cmp(aprxSqrt) < 0) (a0 = prevR.neg()), (b0 = x1), (a1 = r.neg()), (b1 = x);\n else if (a1 && ++i === 2) break;\n (prevR = r), (v = u), (u = r), (x2 = x1), (x1 = x), (y2 = y1), (y1 = y);\n }\n (a2 = r.neg()), (b2 = x);\n var len1 = a1.sqr().add(b1.sqr()),\n len2 = a2.sqr().add(b2.sqr());\n return (\n len2.cmp(len1) >= 0 && ((a2 = a0), (b2 = b0)),\n a1.negative && ((a1 = a1.neg()), (b1 = b1.neg())),\n a2.negative && ((a2 = a2.neg()), (b2 = b2.neg())),\n [\n { a: a1, b: b1 },\n { a: a2, b: b2 },\n ]\n );\n };\n ShortCurve.prototype._endoSplit = function (k) {\n var basis = this.endo.basis,\n v1 = basis[0],\n v2 = basis[1],\n c1 = v2.b.mul(k).divRound(this.n),\n c2 = v1.b.neg().mul(k).divRound(this.n),\n p1 = c1.mul(v1.a),\n p2 = c2.mul(v2.a),\n q1 = c1.mul(v1.b),\n q2 = c2.mul(v2.b),\n k1 = k.sub(p1).sub(p2),\n k2 = q1.add(q2).neg();\n return { k1, k2 };\n };\n ShortCurve.prototype.pointFromX = function (x, odd) {\n (x = new BN(x, 16)), x.red || (x = x.toRed(this.red));\n var y2 = x.redSqr().redMul(x).redIAdd(x.redMul(this.a)).redIAdd(this.b),\n y = y2.redSqrt();\n if (y.redSqr().redSub(y2).cmp(this.zero) !== 0) throw new Error(\"invalid point\");\n var isOdd = y.fromRed().isOdd();\n return ((odd && !isOdd) || (!odd && isOdd)) && (y = y.redNeg()), this.point(x, y);\n };\n ShortCurve.prototype.validate = function (point) {\n if (point.inf) return !0;\n var x = point.x,\n y = point.y,\n ax = this.a.redMul(x),\n rhs = x.redSqr().redMul(x).redIAdd(ax).redIAdd(this.b);\n return y.redSqr().redISub(rhs).cmpn(0) === 0;\n };\n ShortCurve.prototype._endoWnafMulAdd = function (points, coeffs, jacobianResult) {\n for (var npoints = this._endoWnafT1, ncoeffs = this._endoWnafT2, i = 0; i < points.length; i++) {\n var split = this._endoSplit(coeffs[i]),\n p = points[i],\n beta = p._getBeta();\n split.k1.negative && (split.k1.ineg(), (p = p.neg(!0))),\n split.k2.negative && (split.k2.ineg(), (beta = beta.neg(!0))),\n (npoints[i * 2] = p),\n (npoints[i * 2 + 1] = beta),\n (ncoeffs[i * 2] = split.k1),\n (ncoeffs[i * 2 + 1] = split.k2);\n }\n for (var res = this._wnafMulAdd(1, npoints, ncoeffs, i * 2, jacobianResult), j = 0; j < i * 2; j++)\n (npoints[j] = null), (ncoeffs[j] = null);\n return res;\n };\n function Point(curve, x, y, isRed) {\n Base.BasePoint.call(this, curve, \"affine\"),\n x === null && y === null\n ? ((this.x = null), (this.y = null), (this.inf = !0))\n : ((this.x = new BN(x, 16)),\n (this.y = new BN(y, 16)),\n isRed && (this.x.forceRed(this.curve.red), this.y.forceRed(this.curve.red)),\n this.x.red || (this.x = this.x.toRed(this.curve.red)),\n this.y.red || (this.y = this.y.toRed(this.curve.red)),\n (this.inf = !1));\n }\n inherits(Point, Base.BasePoint);\n ShortCurve.prototype.point = function (x, y, isRed) {\n return new Point(this, x, y, isRed);\n };\n ShortCurve.prototype.pointFromJSON = function (obj, red) {\n return Point.fromJSON(this, obj, red);\n };\n Point.prototype._getBeta = function () {\n if (!!this.curve.endo) {\n var pre = this.precomputed;\n if (pre && pre.beta) return pre.beta;\n var beta = this.curve.point(this.x.redMul(this.curve.endo.beta), this.y);\n if (pre) {\n var curve = this.curve,\n endoMul = function (p) {\n return curve.point(p.x.redMul(curve.endo.beta), p.y);\n };\n (pre.beta = beta),\n (beta.precomputed = {\n beta: null,\n naf: pre.naf && {\n wnd: pre.naf.wnd,\n points: pre.naf.points.map(endoMul),\n },\n doubles: pre.doubles && {\n step: pre.doubles.step,\n points: pre.doubles.points.map(endoMul),\n },\n });\n }\n return beta;\n }\n };\n Point.prototype.toJSON = function () {\n return this.precomputed\n ? [\n this.x,\n this.y,\n this.precomputed && {\n doubles: this.precomputed.doubles && {\n step: this.precomputed.doubles.step,\n points: this.precomputed.doubles.points.slice(1),\n },\n naf: this.precomputed.naf && {\n wnd: this.precomputed.naf.wnd,\n points: this.precomputed.naf.points.slice(1),\n },\n },\n ]\n : [this.x, this.y];\n };\n Point.fromJSON = function (curve, obj, red) {\n typeof obj == \"string\" && (obj = JSON.parse(obj));\n var res = curve.point(obj[0], obj[1], red);\n if (!obj[2]) return res;\n function obj2point(obj2) {\n return curve.point(obj2[0], obj2[1], red);\n }\n var pre = obj[2];\n return (\n (res.precomputed = {\n beta: null,\n doubles: pre.doubles && {\n step: pre.doubles.step,\n points: [res].concat(pre.doubles.points.map(obj2point)),\n },\n naf: pre.naf && {\n wnd: pre.naf.wnd,\n points: [res].concat(pre.naf.points.map(obj2point)),\n },\n }),\n res\n );\n };\n Point.prototype.inspect = function () {\n return this.isInfinity()\n ? \"<EC Point Infinity>\"\n : \"<EC Point x: \" + this.x.fromRed().toString(16, 2) + \" y: \" + this.y.fromRed().toString(16, 2) + \">\";\n };\n Point.prototype.isInfinity = function () {\n return this.inf;\n };\n Point.prototype.add = function (p) {\n if (this.inf) return p;\n if (p.inf) return this;\n if (this.eq(p)) return this.dbl();\n if (this.neg().eq(p)) return this.curve.point(null, null);\n if (this.x.cmp(p.x) === 0) return this.curve.point(null, null);\n var c = this.y.redSub(p.y);\n c.cmpn(0) !== 0 && (c = c.redMul(this.x.redSub(p.x).redInvm()));\n var nx = c.redSqr().redISub(this.x).redISub(p.x),\n ny = c.redMul(this.x.redSub(nx)).redISub(this.y);\n return this.curve.point(nx, ny);\n };\n Point.prototype.dbl = function () {\n if (this.inf) return this;\n var ys1 = this.y.redAdd(this.y);\n if (ys1.cmpn(0) === 0) return this.curve.point(null, null);\n var a = this.curve.a,\n x2 = this.x.redSqr(),\n dyinv = ys1.redInvm(),\n c = x2.redAdd(x2).redIAdd(x2).redIAdd(a).redMul(dyinv),\n nx = c.redSqr().redISub(this.x.redAdd(this.x)),\n ny = c.redMul(this.x.redSub(nx)).redISub(this.y);\n return this.curve.point(nx, ny);\n };\n Point.prototype.getX = function () {\n return this.x.fromRed();\n };\n Point.prototype.getY = function () {\n return this.y.fromRed();\n };\n Point.prototype.mul = function (k) {\n return (\n (k = new BN(k, 16)),\n this.isInfinity()\n ? this\n : this._hasDoubles(k)\n ? this.curve._fixedNafMul(this, k)\n : this.curve.endo\n ? this.curve._endoWnafMulAdd([this], [k])\n : this.curve._wnafMul(this, k)\n );\n };\n Point.prototype.mulAdd = function (k1, p2, k2) {\n var points = [this, p2],\n coeffs = [k1, k2];\n return this.curve.endo\n ? this.curve._endoWnafMulAdd(points, coeffs)\n : this.curve._wnafMulAdd(1, points, coeffs, 2);\n };\n Point.prototype.jmulAdd = function (k1, p2, k2) {\n var points = [this, p2],\n coeffs = [k1, k2];\n return this.curve.endo\n ? this.curve._endoWnafMulAdd(points, coeffs, !0)\n : this.curve._wnafMulAdd(1, points, coeffs, 2, !0);\n };\n Point.prototype.eq = function (p) {\n return this === p || (this.inf === p.inf && (this.inf || (this.x.cmp(p.x) === 0 && this.y.cmp(p.y) === 0)));\n };\n Point.prototype.neg = function (_precompute) {\n if (this.inf) return this;\n var res = this.curve.point(this.x, this.y.redNeg());\n if (_precompute && this.precomputed) {\n var pre = this.precomputed,\n negate = function (p) {\n return p.neg();\n };\n res.precomputed = {\n naf: pre.naf && {\n wnd: pre.naf.wnd,\n points: pre.naf.points.map(negate),\n },\n doubles: pre.doubles && {\n step: pre.doubles.step,\n points: pre.doubles.points.map(negate),\n },\n };\n }\n return res;\n };\n Point.prototype.toJ = function () {\n if (this.inf) return this.curve.jpoint(null, null, null);\n var res = this.curve.jpoint(this.x, this.y, this.curve.one);\n return res;\n };\n function JPoint(curve, x, y, z) {\n Base.BasePoint.call(this, curve, \"jacobian\"),\n x === null && y === null && z === null\n ? ((this.x = this.curve.one), (this.y = this.curve.one), (this.z = new BN(0)))\n : ((this.x = new BN(x, 16)), (this.y = new BN(y, 16)), (this.z = new BN(z, 16))),\n this.x.red || (this.x = this.x.toRed(this.curve.red)),\n this.y.red || (this.y = this.y.toRed(this.curve.red)),\n this.z.red || (this.z = this.z.toRed(this.curve.red)),\n (this.zOne = this.z === this.curve.one);\n }\n inherits(JPoint, Base.BasePoint);\n ShortCurve.prototype.jpoint = function (x, y, z) {\n return new JPoint(this, x, y, z);\n };\n JPoint.prototype.toP = function () {\n if (this.isInfinity()) return this.curve.point(null, null);\n var zinv = this.z.redInvm(),\n zinv2 = zinv.redSqr(),\n ax = this.x.redMul(zinv2),\n ay = this.y.redMul(zinv2).redMul(zinv);\n return this.curve.point(ax, ay);\n };\n JPoint.prototype.neg = function () {\n return this.curve.jpoint(this.x, this.y.redNeg(), this.z);\n };\n JPoint.prototype.add = function (p) {\n if (this.isInfinity()) return p;\n if (p.isInfinity()) return this;\n var pz2 = p.z.redSqr(),\n z2 = this.z.redSqr(),\n u1 = this.x.redMul(pz2),\n u2 = p.x.redMul(z2),\n s1 = this.y.redMul(pz2.redMul(p.z)),\n s2 = p.y.redMul(z2.redMul(this.z)),\n h = u1.redSub(u2),\n r = s1.redSub(s2);\n if (h.cmpn(0) === 0) return r.cmpn(0) !== 0 ? this.curve.jpoint(null, null, null) : this.dbl();\n var h2 = h.redSqr(),\n h3 = h2.redMul(h),\n v = u1.redMul(h2),\n nx = r.redSqr().redIAdd(h3).redISub(v).redISub(v),\n ny = r.redMul(v.redISub(nx)).redISub(s1.redMul(h3)),\n nz = this.z.redMul(p.z).redMul(h);\n return this.curve.jpoint(nx, ny, nz);\n };\n JPoint.prototype.mixedAdd = function (p) {\n if (this.isInfinity()) return p.toJ();\n if (p.isInfinity()) return this;\n var z2 = this.z.redSqr(),\n u1 = this.x,\n u2 = p.x.redMul(z2),\n s1 = this.y,\n s2 = p.y.redMul(z2).redMul(this.z),\n h = u1.redSub(u2),\n r = s1.redSub(s2);\n if (h.cmpn(0) === 0) return r.cmpn(0) !== 0 ? this.curve.jpoint(null, null, null) : this.dbl();\n var h2 = h.redSqr(),\n h3 = h2.redMul(h),\n v = u1.redMul(h2),\n nx = r.redSqr().redIAdd(h3).redISub(v).redISub(v),\n ny = r.redMul(v.redISub(nx)).redISub(s1.redMul(h3)),\n nz = this.z.redMul(h);\n return this.curve.jpoint(nx, ny, nz);\n };\n JPoint.prototype.dblp = function (pow) {\n if (pow === 0) return this;\n if (this.isInfinity()) return this;\n if (!pow) return this.dbl();\n var i;\n if (this.curve.zeroA || this.curve.threeA) {\n var r = this;\n for (i = 0; i < pow; i++) r = r.dbl();\n return r;\n }\n var a = this.curve.a,\n tinv = this.curve.tinv,\n jx = this.x,\n jy = this.y,\n jz = this.z,\n jz4 = jz.redSqr().redSqr(),\n jyd = jy.redAdd(jy);\n for (i = 0; i < pow; i++) {\n var jx2 = jx.redSqr(),\n jyd2 = jyd.redSqr(),\n jyd4 = jyd2.redSqr(),\n c = jx2.redAdd(jx2).redIAdd(jx2).redIAdd(a.redMul(jz4)),\n t1 = jx.redMul(jyd2),\n nx = c.redSqr().redISub(t1.redAdd(t1)),\n t2 = t1.redISub(nx),\n dny = c.redMul(t2);\n dny = dny.redIAdd(dny).redISub(jyd4);\n var nz = jyd.redMul(jz);\n i + 1 < pow && (jz4 = jz4.redMul(jyd4)), (jx = nx), (jz = nz), (jyd = dny);\n }\n return this.curve.jpoint(jx, jyd.redMul(tinv), jz);\n };\n JPoint.prototype.dbl = function () {\n return this.isInfinity()\n ? this\n : this.curve.zeroA\n ? this._zeroDbl()\n : this.curve.threeA\n ? this._threeDbl()\n : this._dbl();\n };\n JPoint.prototype._zeroDbl = function () {\n var nx, ny, nz;\n if (this.zOne) {\n var xx = this.x.redSqr(),\n yy = this.y.redSqr(),\n yyyy = yy.redSqr(),\n s = this.x.redAdd(yy).redSqr().redISub(xx).redISub(yyyy);\n s = s.redIAdd(s);\n var m = xx.redAdd(xx).redIAdd(xx),\n t = m.redSqr().redISub(s).redISub(s),\n yyyy8 = yyyy.redIAdd(yyyy);\n (yyyy8 = yyyy8.redIAdd(yyyy8)),\n (yyyy8 = yyyy8.redIAdd(yyyy8)),\n (nx = t),\n (ny = m.redMul(s.redISub(t)).redISub(yyyy8)),\n (nz = this.y.redAdd(this.y));\n } else {\n var a = this.x.redSqr(),\n b = this.y.redSqr(),\n c = b.redSqr(),\n d = this.x.redAdd(b).redSqr().redISub(a).redISub(c);\n d = d.redIAdd(d);\n var e = a.redAdd(a).redIAdd(a),\n f = e.redSqr(),\n c8 = c.redIAdd(c);\n (c8 = c8.redIAdd(c8)),\n (c8 = c8.redIAdd(c8)),\n (nx = f.redISub(d).redISub(d)),\n (ny = e.redMul(d.redISub(nx)).redISub(c8)),\n (nz = this.y.redMul(this.z)),\n (nz = nz.redIAdd(nz));\n }\n return this.curve.jpoint(nx, ny, nz);\n };\n JPoint.prototype._threeDbl = function () {\n var nx, ny, nz;\n if (this.zOne) {\n var xx = this.x.redSqr(),\n yy = this.y.redSqr(),\n yyyy = yy.redSqr(),\n s = this.x.redAdd(yy).redSqr().redISub(xx).redISub(yyyy);\n s = s.redIAdd(s);\n var m = xx.redAdd(xx).redIAdd(xx).redIAdd(this.curve.a),\n t = m.redSqr().redISub(s).redISub(s);\n nx = t;\n var yyyy8 = yyyy.redIAdd(yyyy);\n (yyyy8 = yyyy8.redIAdd(yyyy8)),\n (yyyy8 = yyyy8.redIAdd(yyyy8)),\n (ny = m.redMul(s.redISub(t)).redISub(yyyy8)),\n (nz = this.y.redAdd(this.y));\n } else {\n var delta = this.z.redSqr(),\n gamma = this.y.redSqr(),\n beta = this.x.redMul(gamma),\n alpha = this.x.redSub(delta).redMul(this.x.redAdd(delta));\n alpha = alpha.redAdd(alpha).redIAdd(alpha);\n var beta4 = beta.redIAdd(beta);\n beta4 = beta4.redIAdd(beta4);\n var beta8 = beta4.redAdd(beta4);\n (nx = alpha.redSqr().redISub(beta8)), (nz = this.y.redAdd(this.z).redSqr().redISub(gamma).redISub(delta));\n var ggamma8 = gamma.redSqr();\n (ggamma8 = ggamma8.redIAdd(ggamma8)),\n (ggamma8 = ggamma8.redIAdd(ggamma8)),\n (ggamma8 = ggamma8.redIAdd(ggamma8)),\n (ny = alpha.redMul(beta4.redISub(nx)).redISub(ggamma8));\n }\n return this.curve.jpoint(nx, ny, nz);\n };\n JPoint.prototype._dbl = function () {\n var a = this.curve.a,\n jx = this.x,\n jy = this.y,\n jz = this.z,\n jz4 = jz.redSqr().redSqr(),\n jx2 = jx.redSqr(),\n jy2 = jy.redSqr(),\n c = jx2.redAdd(jx2).redIAdd(jx2).redIAdd(a.redMul(jz4)),\n jxd4 = jx.redAdd(jx);\n jxd4 = jxd4.redIAdd(jxd4);\n var t1 = jxd4.redMul(jy2),\n nx = c.redSqr().redISub(t1.redAdd(t1)),\n t2 = t1.redISub(nx),\n jyd8 = jy2.redSqr();\n (jyd8 = jyd8.redIAdd(jyd8)), (jyd8 = jyd8.redIAdd(jyd8)), (jyd8 = jyd8.redIAdd(jyd8));\n var ny = c.redMul(t2).redISub(jyd8),\n nz = jy.redAdd(jy).redMul(jz);\n return this.curve.jpoint(nx, ny, nz);\n };\n JPoint.prototype.trpl = function () {\n if (!this.curve.zeroA) return this.dbl().add(this);\n var xx = this.x.redSqr(),\n yy = this.y.redSqr(),\n zz = this.z.redSqr(),\n yyyy = yy.redSqr(),\n m = xx.redAdd(xx).redIAdd(xx),\n mm = m.redSqr(),\n e = this.x.redAdd(yy).redSqr().redISub(xx).redISub(yyyy);\n (e = e.redIAdd(e)), (e = e.redAdd(e).redIAdd(e)), (e = e.redISub(mm));\n var ee = e.redSqr(),\n t = yyyy.redIAdd(yyyy);\n (t = t.redIAdd(t)), (t = t.redIAdd(t)), (t = t.redIAdd(t));\n var u = m.redIAdd(e).redSqr().redISub(mm).redISub(ee).redISub(t),\n yyu4 = yy.redMul(u);\n (yyu4 = yyu4.redIAdd(yyu4)), (yyu4 = yyu4.redIAdd(yyu4));\n var nx = this.x.redMul(ee).redISub(yyu4);\n (nx = nx.redIAdd(nx)), (nx = nx.redIAdd(nx));\n var ny = this.y.redMul(u.redMul(t.redISub(u)).redISub(e.redMul(ee)));\n (ny = ny.redIAdd(ny)), (ny = ny.redIAdd(ny)), (ny = ny.redIAdd(ny));\n var nz = this.z.redAdd(e).redSqr().redISub(zz).redISub(ee);\n return this.curve.jpoint(nx, ny, nz);\n };\n JPoint.prototype.mul = function (k, kbase) {\n return (k = new BN(k, kbase)), this.curve._wnafMul(this, k);\n };\n JPoint.prototype.eq = function (p) {\n if (p.type === \"affine\") return this.eq(p.toJ());\n if (this === p) return !0;\n var z2 = this.z.redSqr(),\n pz2 = p.z.redSqr();\n if (this.x.redMul(pz2).redISub(p.x.redMul(z2)).cmpn(0) !== 0) return !1;\n var z3 = z2.redMul(this.z),\n pz3 = pz2.redMul(p.z);\n return this.y.redMul(pz3).redISub(p.y.redMul(z3)).cmpn(0) === 0;\n };\n JPoint.prototype.eqXToP = function (x) {\n var zs = this.z.redSqr(),\n rx = x.toRed(this.curve.red).redMul(zs);\n if (this.x.cmp(rx) === 0) return !0;\n for (var xc = x.clone(), t = this.curve.redN.redMul(zs); ; ) {\n if ((xc.iadd(this.curve.n), xc.cmp(this.curve.p) >= 0)) return !1;\n if ((rx.redIAdd(t), this.x.cmp(rx) === 0)) return !0;\n }\n };\n JPoint.prototype.inspect = function () {\n return this.isInfinity()\n ? \"<EC JPoint Infinity>\"\n : \"<EC JPoint x: \" +\n this.x.toString(16, 2) +\n \" y: \" +\n this.y.toString(16, 2) +\n \" z: \" +\n this.z.toString(16, 2) +\n \">\";\n };\n JPoint.prototype.isInfinity = function () {\n return this.z.cmpn(0) === 0;\n };\n },\n});\n\n// node_modules/elliptic/lib/elliptic/curve/mont.js\nvar require_mont = __commonJS({\n \"node_modules/elliptic/lib/elliptic/curve/mont.js\"(exports, module) {\n \"use strict\";\n var BN = require_bn4(),\n inherits = require_inherits_browser(),\n Base = require_base(),\n utils = require_utils3();\n function MontCurve(conf) {\n Base.call(this, \"mont\", conf),\n (this.a = new BN(conf.a, 16).toRed(this.red)),\n (this.b = new BN(conf.b, 16).toRed(this.red)),\n (this.i4 = new BN(4).toRed(this.red).redInvm()),\n (this.two = new BN(2).toRed(this.red)),\n (this.a24 = this.i4.redMul(this.a.redAdd(this.two)));\n }\n inherits(MontCurve, Base);\n module.exports = MontCurve;\n MontCurve.prototype.validate = function (point) {\n var x = point.normalize().x,\n x2 = x.redSqr(),\n rhs = x2.redMul(x).redAdd(x2.redMul(this.a)).redAdd(x),\n y = rhs.redSqrt();\n return y.redSqr().cmp(rhs) === 0;\n };\n function Point(curve, x, z) {\n Base.BasePoint.call(this, curve, \"projective\"),\n x === null && z === null\n ? ((this.x = this.curve.one), (this.z = this.curve.zero))\n : ((this.x = new BN(x, 16)),\n (this.z = new BN(z, 16)),\n this.x.red || (this.x = this.x.toRed(this.curve.red)),\n this.z.red || (this.z = this.z.toRed(this.curve.red)));\n }\n inherits(Point, Base.BasePoint);\n MontCurve.prototype.decodePoint = function (bytes, enc) {\n return this.point(utils.toArray(bytes, enc), 1);\n };\n MontCurve.prototype.point = function (x, z) {\n return new Point(this, x, z);\n };\n MontCurve.prototype.pointFromJSON = function (obj) {\n return Point.fromJSON(this, obj);\n };\n Point.prototype.precompute = function () {};\n Point.prototype._encode = function () {\n return this.getX().toArray(\"be\", this.curve.p.byteLength());\n };\n Point.fromJSON = function (curve, obj) {\n return new Point(curve, obj[0], obj[1] || curve.one);\n };\n Point.prototype.inspect = function () {\n return this.isInfinity()\n ? \"<EC Point Infinity>\"\n : \"<EC Point x: \" + this.x.fromRed().toString(16, 2) + \" z: \" + this.z.fromRed().toString(16, 2) + \">\";\n };\n Point.prototype.isInfinity = function () {\n return this.z.cmpn(0) === 0;\n };\n Point.prototype.dbl = function () {\n var a = this.x.redAdd(this.z),\n aa = a.redSqr(),\n b = this.x.redSub(this.z),\n bb = b.redSqr(),\n c = aa.redSub(bb),\n nx = aa.redMul(bb),\n nz = c.redMul(bb.redAdd(this.curve.a24.redMul(c)));\n return this.curve.point(nx, nz);\n };\n Point.prototype.add = function () {\n throw new Error(\"Not supported on Montgomery curve\");\n };\n Point.prototype.diffAdd = function (p, diff) {\n var a = this.x.redAdd(this.z),\n b = this.x.redSub(this.z),\n c = p.x.redAdd(p.z),\n d = p.x.redSub(p.z),\n da = d.redMul(a),\n cb = c.redMul(b),\n nx = diff.z.redMul(da.redAdd(cb).redSqr()),\n nz = diff.x.redMul(da.redISub(cb).redSqr());\n return this.curve.point(nx, nz);\n };\n Point.prototype.mul = function (k) {\n for (\n var t = k.clone(), a = this, b = this.curve.point(null, null), c = this, bits = [];\n t.cmpn(0) !== 0;\n t.iushrn(1)\n )\n bits.push(t.andln(1));\n for (var i = bits.length - 1; i >= 0; i--)\n bits[i] === 0 ? ((a = a.diffAdd(b, c)), (b = b.dbl())) : ((b = a.diffAdd(b, c)), (a = a.dbl()));\n return b;\n };\n Point.prototype.mulAdd = function () {\n throw new Error(\"Not supported on Montgomery curve\");\n };\n Point.prototype.jumlAdd = function () {\n throw new Error(\"Not supported on Montgomery curve\");\n };\n Point.prototype.eq = function (other) {\n return this.getX().cmp(other.getX()) === 0;\n };\n Point.prototype.normalize = function () {\n return (this.x = this.x.redMul(this.z.redInvm())), (this.z = this.curve.one), this;\n };\n Point.prototype.getX = function () {\n return this.normalize(), this.x.fromRed();\n };\n },\n});\n\n// node_modules/elliptic/lib/elliptic/curve/edwards.js\nvar require_edwards = __commonJS({\n \"node_modules/elliptic/lib/elliptic/curve/edwards.js\"(exports, module) {\n \"use strict\";\n var utils = require_utils3(),\n BN = require_bn4(),\n inherits = require_inherits_browser(),\n Base = require_base(),\n assert = utils.assert;\n function EdwardsCurve(conf) {\n (this.twisted = (conf.a | 0) !== 1),\n (this.mOneA = this.twisted && (conf.a | 0) === -1),\n (this.extended = this.mOneA),\n Base.call(this, \"edwards\", conf),\n (this.a = new BN(conf.a, 16).umod(this.red.m)),\n (this.a = this.a.toRed(this.red)),\n (this.c = new BN(conf.c, 16).toRed(this.red)),\n (this.c2 = this.c.redSqr()),\n (this.d = new BN(conf.d, 16).toRed(this.red)),\n (this.dd = this.d.redAdd(this.d)),\n assert(!this.twisted || this.c.fromRed().cmpn(1) === 0),\n (this.oneC = (conf.c | 0) === 1);\n }\n inherits(EdwardsCurve, Base);\n module.exports = EdwardsCurve;\n EdwardsCurve.prototype._mulA = function (num) {\n return this.mOneA ? num.redNeg() : this.a.redMul(num);\n };\n EdwardsCurve.prototype._mulC = function (num) {\n return this.oneC ? num : this.c.redMul(num);\n };\n EdwardsCurve.prototype.jpoint = function (x, y, z, t) {\n return this.point(x, y, z, t);\n };\n EdwardsCurve.prototype.pointFromX = function (x, odd) {\n (x = new BN(x, 16)), x.red || (x = x.toRed(this.red));\n var x2 = x.redSqr(),\n rhs = this.c2.redSub(this.a.redMul(x2)),\n lhs = this.one.redSub(this.c2.redMul(this.d).redMul(x2)),\n y2 = rhs.redMul(lhs.redInvm()),\n y = y2.redSqrt();\n if (y.redSqr().redSub(y2).cmp(this.zero) !== 0) throw new Error(\"invalid point\");\n var isOdd = y.fromRed().isOdd();\n return ((odd && !isOdd) || (!odd && isOdd)) && (y = y.redNeg()), this.point(x, y);\n };\n EdwardsCurve.prototype.pointFromY = function (y, odd) {\n (y = new BN(y, 16)), y.red || (y = y.toRed(this.red));\n var y2 = y.redSqr(),\n lhs = y2.redSub(this.c2),\n rhs = y2.redMul(this.d).redMul(this.c2).redSub(this.a),\n x2 = lhs.redMul(rhs.redInvm());\n if (x2.cmp(this.zero) === 0) {\n if (odd) throw new Error(\"invalid point\");\n return this.point(this.zero, y);\n }\n var x = x2.redSqrt();\n if (x.redSqr().redSub(x2).cmp(this.zero) !== 0) throw new Error(\"invalid point\");\n return x.fromRed().isOdd() !== odd && (x = x.redNeg()), this.point(x, y);\n };\n EdwardsCurve.prototype.validate = function (point) {\n if (point.isInfinity()) return !0;\n point.normalize();\n var x2 = point.x.redSqr(),\n y2 = point.y.redSqr(),\n lhs = x2.redMul(this.a).redAdd(y2),\n rhs = this.c2.redMul(this.one.redAdd(this.d.redMul(x2).redMul(y2)));\n return lhs.cmp(rhs) === 0;\n };\n function Point(curve, x, y, z, t) {\n Base.BasePoint.call(this, curve, \"projective\"),\n x === null && y === null && z === null\n ? ((this.x = this.curve.zero),\n (this.y = this.curve.one),\n (this.z = this.curve.one),\n (this.t = this.curve.zero),\n (this.zOne = !0))\n : ((this.x = new BN(x, 16)),\n (this.y = new BN(y, 16)),\n (this.z = z ? new BN(z, 16) : this.curve.one),\n (this.t = t && new BN(t, 16)),\n this.x.red || (this.x = this.x.toRed(this.curve.red)),\n this.y.red || (this.y = this.y.toRed(this.curve.red)),\n this.z.red || (this.z = this.z.toRed(this.curve.red)),\n this.t && !this.t.red && (this.t = this.t.toRed(this.curve.red)),\n (this.zOne = this.z === this.curve.one),\n this.curve.extended &&\n !this.t &&\n ((this.t = this.x.redMul(this.y)), this.zOne || (this.t = this.t.redMul(this.z.redInvm()))));\n }\n inherits(Point, Base.BasePoint);\n EdwardsCurve.prototype.pointFromJSON = function (obj) {\n return Point.fromJSON(this, obj);\n };\n EdwardsCurve.prototype.point = function (x, y, z, t) {\n return new Point(this, x, y, z, t);\n };\n Point.fromJSON = function (curve, obj) {\n return new Point(curve, obj[0], obj[1], obj[2]);\n };\n Point.prototype.inspect = function () {\n return this.isInfinity()\n ? \"<EC Point Infinity>\"\n : \"<EC Point x: \" +\n this.x.fromRed().toString(16, 2) +\n \" y: \" +\n this.y.fromRed().toString(16, 2) +\n \" z: \" +\n this.z.fromRed().toString(16, 2) +\n \">\";\n };\n Point.prototype.isInfinity = function () {\n return this.x.cmpn(0) === 0 && (this.y.cmp(this.z) === 0 || (this.zOne && this.y.cmp(this.curve.c) === 0));\n };\n Point.prototype._extDbl = function () {\n var a = this.x.redSqr(),\n b = this.y.redSqr(),\n c = this.z.redSqr();\n c = c.redIAdd(c);\n var d = this.curve._mulA(a),\n e = this.x.redAdd(this.y).redSqr().redISub(a).redISub(b),\n g = d.redAdd(b),\n f = g.redSub(c),\n h = d.redSub(b),\n nx = e.redMul(f),\n ny = g.redMul(h),\n nt = e.redMul(h),\n nz = f.redMul(g);\n return this.curve.point(nx, ny, nz, nt);\n };\n Point.prototype._projDbl = function () {\n var b = this.x.redAdd(this.y).redSqr(),\n c = this.x.redSqr(),\n d = this.y.redSqr(),\n nx,\n ny,\n nz,\n e,\n h,\n j;\n if (this.curve.twisted) {\n e = this.curve._mulA(c);\n var f = e.redAdd(d);\n this.zOne\n ? ((nx = b.redSub(c).redSub(d).redMul(f.redSub(this.curve.two))),\n (ny = f.redMul(e.redSub(d))),\n (nz = f.redSqr().redSub(f).redSub(f)))\n : ((h = this.z.redSqr()),\n (j = f.redSub(h).redISub(h)),\n (nx = b.redSub(c).redISub(d).redMul(j)),\n (ny = f.redMul(e.redSub(d))),\n (nz = f.redMul(j)));\n } else\n (e = c.redAdd(d)),\n (h = this.curve._mulC(this.z).redSqr()),\n (j = e.redSub(h).redSub(h)),\n (nx = this.curve._mulC(b.redISub(e)).redMul(j)),\n (ny = this.curve._mulC(e).redMul(c.redISub(d))),\n (nz = e.redMul(j));\n return this.curve.point(nx, ny, nz);\n };\n Point.prototype.dbl = function () {\n return this.isInfinity() ? this : this.curve.extended ? this._extDbl() : this._projDbl();\n };\n Point.prototype._extAdd = function (p) {\n var a = this.y.redSub(this.x).redMul(p.y.redSub(p.x)),\n b = this.y.redAdd(this.x).redMul(p.y.redAdd(p.x)),\n c = this.t.redMul(this.curve.dd).redMul(p.t),\n d = this.z.redMul(p.z.redAdd(p.z)),\n e = b.redSub(a),\n f = d.redSub(c),\n g = d.redAdd(c),\n h = b.redAdd(a),\n nx = e.redMul(f),\n ny = g.redMul(h),\n nt = e.redMul(h),\n nz = f.redMul(g);\n return this.curve.point(nx, ny, nz, nt);\n };\n Point.prototype._projAdd = function (p) {\n var a = this.z.redMul(p.z),\n b = a.redSqr(),\n c = this.x.redMul(p.x),\n d = this.y.redMul(p.y),\n e = this.curve.d.redMul(c).redMul(d),\n f = b.redSub(e),\n g = b.redAdd(e),\n tmp = this.x.redAdd(this.y).redMul(p.x.redAdd(p.y)).redISub(c).redISub(d),\n nx = a.redMul(f).redMul(tmp),\n ny,\n nz;\n return (\n this.curve.twisted\n ? ((ny = a.redMul(g).redMul(d.redSub(this.curve._mulA(c)))), (nz = f.redMul(g)))\n : ((ny = a.redMul(g).redMul(d.redSub(c))), (nz = this.curve._mulC(f).redMul(g))),\n this.curve.point(nx, ny, nz)\n );\n };\n Point.prototype.add = function (p) {\n return this.isInfinity() ? p : p.isInfinity() ? this : this.curve.extended ? this._extAdd(p) : this._projAdd(p);\n };\n Point.prototype.mul = function (k) {\n return this._hasDoubles(k) ? this.curve._fixedNafMul(this, k) : this.curve._wnafMul(this, k);\n };\n Point.prototype.mulAdd = function (k1, p, k2) {\n return this.curve._wnafMulAdd(1, [this, p], [k1, k2], 2, !1);\n };\n Point.prototype.jmulAdd = function (k1, p, k2) {\n return this.curve._wnafMulAdd(1, [this, p], [k1, k2], 2, !0);\n };\n Point.prototype.normalize = function () {\n if (this.zOne) return this;\n var zi = this.z.redInvm();\n return (\n (this.x = this.x.redMul(zi)),\n (this.y = this.y.redMul(zi)),\n this.t && (this.t = this.t.redMul(zi)),\n (this.z = this.curve.one),\n (this.zOne = !0),\n this\n );\n };\n Point.prototype.neg = function () {\n return this.curve.point(this.x.redNeg(), this.y, this.z, this.t && this.t.redNeg());\n };\n Point.prototype.getX = function () {\n return this.normalize(), this.x.fromRed();\n };\n Point.prototype.getY = function () {\n return this.normalize(), this.y.fromRed();\n };\n Point.prototype.eq = function (other) {\n return this === other || (this.getX().cmp(other.getX()) === 0 && this.getY().cmp(other.getY()) === 0);\n };\n Point.prototype.eqXToP = function (x) {\n var rx = x.toRed(this.curve.red).redMul(this.z);\n if (this.x.cmp(rx) === 0) return !0;\n for (var xc = x.clone(), t = this.curve.redN.redMul(this.z); ; ) {\n if ((xc.iadd(this.curve.n), xc.cmp(this.curve.p) >= 0)) return !1;\n if ((rx.redIAdd(t), this.x.cmp(rx) === 0)) return !0;\n }\n };\n Point.prototype.toP = Point.prototype.normalize;\n Point.prototype.mixedAdd = Point.prototype.add;\n },\n});\n\n// node_modules/elliptic/lib/elliptic/curve/index.js\nvar require_curve = __commonJS({\n \"node_modules/elliptic/lib/elliptic/curve/index.js\"(exports) {\n \"use strict\";\n var curve = exports;\n curve.base = require_base();\n curve.short = require_short();\n curve.mont = require_mont();\n curve.edwards = require_edwards();\n },\n});\n\n// node_modules/hash.js/lib/hash/utils.js\nvar require_utils4 = __commonJS({\n \"node_modules/hash.js/lib/hash/utils.js\"(exports) {\n \"use strict\";\n var assert = require_minimalistic_assert(),\n inherits = require_inherits_browser();\n exports.inherits = inherits;\n function isSurrogatePair(msg, i) {\n return (msg.charCodeAt(i) & 64512) !== 55296 || i < 0 || i + 1 >= msg.length\n ? !1\n : (msg.charCodeAt(i + 1) & 64512) === 56320;\n }\n function toArray(msg, enc) {\n if (Array.isArray(msg)) return msg.slice();\n if (!msg) return [];\n var res = [];\n if (typeof msg == \"string\")\n if (enc) {\n if (enc === \"hex\")\n for (\n msg = msg.replace(/[^a-z0-9]+/gi, \"\"), msg.length % 2 !== 0 && (msg = \"0\" + msg), i = 0;\n i < msg.length;\n i += 2\n )\n res.push(parseInt(msg[i] + msg[i + 1], 16));\n } else\n for (var p = 0, i = 0; i < msg.length; i++) {\n var c = msg.charCodeAt(i);\n c < 128\n ? (res[p++] = c)\n : c < 2048\n ? ((res[p++] = (c >> 6) | 192), (res[p++] = (c & 63) | 128))\n : isSurrogatePair(msg, i)\n ? ((c = 65536 + ((c & 1023) << 10) + (msg.charCodeAt(++i) & 1023)),\n (res[p++] = (c >> 18) | 240),\n (res[p++] = ((c >> 12) & 63) | 128),\n (res[p++] = ((c >> 6) & 63) | 128),\n (res[p++] = (c & 63) | 128))\n : ((res[p++] = (c >> 12) | 224), (res[p++] = ((c >> 6) & 63) | 128), (res[p++] = (c & 63) | 128));\n }\n else for (i = 0; i < msg.length; i++) res[i] = msg[i] | 0;\n return res;\n }\n exports.toArray = toArray;\n function toHex(msg) {\n for (var res = \"\", i = 0; i < msg.length; i++) res += zero2(msg[i].toString(16));\n return res;\n }\n exports.toHex = toHex;\n function htonl(w) {\n var res = (w >>> 24) | ((w >>> 8) & 65280) | ((w << 8) & 16711680) | ((w & 255) << 24);\n return res >>> 0;\n }\n exports.htonl = htonl;\n function toHex32(msg, endian) {\n for (var res = \"\", i = 0; i < msg.length; i++) {\n var w = msg[i];\n endian === \"little\" && (w = htonl(w)), (res += zero8(w.toString(16)));\n }\n return res;\n }\n exports.toHex32 = toHex32;\n function zero2(word) {\n return word.length === 1 ? \"0\" + word : word;\n }\n exports.zero2 = zero2;\n function zero8(word) {\n return word.length === 7\n ? \"0\" + word\n : word.length === 6\n ? \"00\" + word\n : word.length === 5\n ? \"000\" + word\n : word.length === 4\n ? \"0000\" + word\n : word.length === 3\n ? \"00000\" + word\n : word.length === 2\n ? \"000000\" + word\n : word.length === 1\n ? \"0000000\" + word\n : word;\n }\n exports.zero8 = zero8;\n function join32(msg, start, end, endian) {\n var len = end - start;\n assert(len % 4 === 0);\n for (var res = new Array(len / 4), i = 0, k = start; i < res.length; i++, k += 4) {\n var w;\n endian === \"big\"\n ? (w = (msg[k] << 24) | (msg[k + 1] << 16) | (msg[k + 2] << 8) | msg[k + 3])\n : (w = (msg[k + 3] << 24) | (msg[k + 2] << 16) | (msg[k + 1] << 8) | msg[k]),\n (res[i] = w >>> 0);\n }\n return res;\n }\n exports.join32 = join32;\n function split32(msg, endian) {\n for (var res = new Array(msg.length * 4), i = 0, k = 0; i < msg.length; i++, k += 4) {\n var m = msg[i];\n endian === \"big\"\n ? ((res[k] = m >>> 24),\n (res[k + 1] = (m >>> 16) & 255),\n (res[k + 2] = (m >>> 8) & 255),\n (res[k + 3] = m & 255))\n : ((res[k + 3] = m >>> 24),\n (res[k + 2] = (m >>> 16) & 255),\n (res[k + 1] = (m >>> 8) & 255),\n (res[k] = m & 255));\n }\n return res;\n }\n exports.split32 = split32;\n function rotr32(w, b) {\n return (w >>> b) | (w << (32 - b));\n }\n exports.rotr32 = rotr32;\n function rotl32(w, b) {\n return (w << b) | (w >>> (32 - b));\n }\n exports.rotl32 = rotl32;\n function sum32(a, b) {\n return (a + b) >>> 0;\n }\n exports.sum32 = sum32;\n function sum32_3(a, b, c) {\n return (a + b + c) >>> 0;\n }\n exports.sum32_3 = sum32_3;\n function sum32_4(a, b, c, d) {\n return (a + b + c + d) >>> 0;\n }\n exports.sum32_4 = sum32_4;\n function sum32_5(a, b, c, d, e) {\n return (a + b + c + d + e) >>> 0;\n }\n exports.sum32_5 = sum32_5;\n function sum64(buf, pos, ah, al) {\n var bh = buf[pos],\n bl = buf[pos + 1],\n lo = (al + bl) >>> 0,\n hi = (lo < al ? 1 : 0) + ah + bh;\n (buf[pos] = hi >>> 0), (buf[pos + 1] = lo);\n }\n exports.sum64 = sum64;\n function sum64_hi(ah, al, bh, bl) {\n var lo = (al + bl) >>> 0,\n hi = (lo < al ? 1 : 0) + ah + bh;\n return hi >>> 0;\n }\n exports.sum64_hi = sum64_hi;\n function sum64_lo(ah, al, bh, bl) {\n var lo = al + bl;\n return lo >>> 0;\n }\n exports.sum64_lo = sum64_lo;\n function sum64_4_hi(ah, al, bh, bl, ch, cl, dh, dl) {\n var carry = 0,\n lo = al;\n (lo = (lo + bl) >>> 0),\n (carry += lo < al ? 1 : 0),\n (lo = (lo + cl) >>> 0),\n (carry += lo < cl ? 1 : 0),\n (lo = (lo + dl) >>> 0),\n (carry += lo < dl ? 1 : 0);\n var hi = ah + bh + ch + dh + carry;\n return hi >>> 0;\n }\n exports.sum64_4_hi = sum64_4_hi;\n function sum64_4_lo(ah, al, bh, bl, ch, cl, dh, dl) {\n var lo = al + bl + cl + dl;\n return lo >>> 0;\n }\n exports.sum64_4_lo = sum64_4_lo;\n function sum64_5_hi(ah, al, bh, bl, ch, cl, dh, dl, eh, el) {\n var carry = 0,\n lo = al;\n (lo = (lo + bl) >>> 0),\n (carry += lo < al ? 1 : 0),\n (lo = (lo + cl) >>> 0),\n (carry += lo < cl ? 1 : 0),\n (lo = (lo + dl) >>> 0),\n (carry += lo < dl ? 1 : 0),\n (lo = (lo + el) >>> 0),\n (carry += lo < el ? 1 : 0);\n var hi = ah + bh + ch + dh + eh + carry;\n return hi >>> 0;\n }\n exports.sum64_5_hi = sum64_5_hi;\n function sum64_5_lo(ah, al, bh, bl, ch, cl, dh, dl, eh, el) {\n var lo = al + bl + cl + dl + el;\n return lo >>> 0;\n }\n exports.sum64_5_lo = sum64_5_lo;\n function rotr64_hi(ah, al, num) {\n var r = (al << (32 - num)) | (ah >>> num);\n return r >>> 0;\n }\n exports.rotr64_hi = rotr64_hi;\n function rotr64_lo(ah, al, num) {\n var r = (ah << (32 - num)) | (al >>> num);\n return r >>> 0;\n }\n exports.rotr64_lo = rotr64_lo;\n function shr64_hi(ah, al, num) {\n return ah >>> num;\n }\n exports.shr64_hi = shr64_hi;\n function shr64_lo(ah, al, num) {\n var r = (ah << (32 - num)) | (al >>> num);\n return r >>> 0;\n }\n exports.shr64_lo = shr64_lo;\n },\n});\n\n// node_modules/hash.js/lib/hash/common.js\nvar require_common = __commonJS({\n \"node_modules/hash.js/lib/hash/common.js\"(exports) {\n \"use strict\";\n var utils = require_utils4(),\n assert = require_minimalistic_assert();\n function BlockHash() {\n (this.pending = null),\n (this.pendingTotal = 0),\n (this.blockSize = this.constructor.blockSize),\n (this.outSize = this.constructor.outSize),\n (this.hmacStrength = this.constructor.hmacStrength),\n (this.padLength = this.constructor.padLength / 8),\n (this.endian = \"big\"),\n (this._delta8 = this.blockSize / 8),\n (this._delta32 = this.blockSize / 32);\n }\n exports.BlockHash = BlockHash;\n BlockHash.prototype.update = function (msg, enc) {\n if (\n ((msg = utils.toArray(msg, enc)),\n this.pending ? (this.pending = this.pending.concat(msg)) : (this.pending = msg),\n (this.pendingTotal += msg.length),\n this.pending.length >= this._delta8)\n ) {\n msg = this.pending;\n var r = msg.length % this._delta8;\n (this.pending = msg.slice(msg.length - r, msg.length)),\n this.pending.length === 0 && (this.pending = null),\n (msg = utils.join32(msg, 0, msg.length - r, this.endian));\n for (var i = 0; i < msg.length; i += this._delta32) this._update(msg, i, i + this._delta32);\n }\n return this;\n };\n BlockHash.prototype.digest = function (enc) {\n return this.update(this._pad()), assert(this.pending === null), this._digest(enc);\n };\n BlockHash.prototype._pad = function () {\n var len = this.pendingTotal,\n bytes = this._delta8,\n k = bytes - ((len + this.padLength) % bytes),\n res = new Array(k + this.padLength);\n res[0] = 128;\n for (var i = 1; i < k; i++) res[i] = 0;\n if (((len <<= 3), this.endian === \"big\")) {\n for (var t = 8; t < this.padLength; t++) res[i++] = 0;\n (res[i++] = 0),\n (res[i++] = 0),\n (res[i++] = 0),\n (res[i++] = 0),\n (res[i++] = (len >>> 24) & 255),\n (res[i++] = (len >>> 16) & 255),\n (res[i++] = (len >>> 8) & 255),\n (res[i++] = len & 255);\n } else\n for (\n res[i++] = len & 255,\n res[i++] = (len >>> 8) & 255,\n res[i++] = (len >>> 16) & 255,\n res[i++] = (len >>> 24) & 255,\n res[i++] = 0,\n res[i++] = 0,\n res[i++] = 0,\n res[i++] = 0,\n t = 8;\n t < this.padLength;\n t++\n )\n res[i++] = 0;\n return res;\n };\n },\n});\n\n// node_modules/hash.js/lib/hash/sha/common.js\nvar require_common2 = __commonJS({\n \"node_modules/hash.js/lib/hash/sha/common.js\"(exports) {\n \"use strict\";\n var utils = require_utils4(),\n rotr32 = utils.rotr32;\n function ft_1(s, x, y, z) {\n if (s === 0) return ch32(x, y, z);\n if (s === 1 || s === 3) return p32(x, y, z);\n if (s === 2) return maj32(x, y, z);\n }\n exports.ft_1 = ft_1;\n function ch32(x, y, z) {\n return (x & y) ^ (~x & z);\n }\n exports.ch32 = ch32;\n function maj32(x, y, z) {\n return (x & y) ^ (x & z) ^ (y & z);\n }\n exports.maj32 = maj32;\n function p32(x, y, z) {\n return x ^ y ^ z;\n }\n exports.p32 = p32;\n function s0_256(x) {\n return rotr32(x, 2) ^ rotr32(x, 13) ^ rotr32(x, 22);\n }\n exports.s0_256 = s0_256;\n function s1_256(x) {\n return rotr32(x, 6) ^ rotr32(x, 11) ^ rotr32(x, 25);\n }\n exports.s1_256 = s1_256;\n function g0_256(x) {\n return rotr32(x, 7) ^ rotr32(x, 18) ^ (x >>> 3);\n }\n exports.g0_256 = g0_256;\n function g1_256(x) {\n return rotr32(x, 17) ^ rotr32(x, 19) ^ (x >>> 10);\n }\n exports.g1_256 = g1_256;\n },\n});\n\n// node_modules/hash.js/lib/hash/sha/1.js\nvar require__ = __commonJS({\n \"node_modules/hash.js/lib/hash/sha/1.js\"(exports, module) {\n \"use strict\";\n var utils = require_utils4(),\n common = require_common(),\n shaCommon = require_common2(),\n rotl32 = utils.rotl32,\n sum32 = utils.sum32,\n sum32_5 = utils.sum32_5,\n ft_1 = shaCommon.ft_1,\n BlockHash = common.BlockHash,\n sha1_K = [1518500249, 1859775393, 2400959708, 3395469782];\n function SHA1() {\n if (!(this instanceof SHA1)) return new SHA1();\n BlockHash.call(this),\n (this.h = [1732584193, 4023233417, 2562383102, 271733878, 3285377520]),\n (this.W = new Array(80));\n }\n utils.inherits(SHA1, BlockHash);\n module.exports = SHA1;\n SHA1.blockSize = 512;\n SHA1.outSize = 160;\n SHA1.hmacStrength = 80;\n SHA1.padLength = 64;\n SHA1.prototype._update = function (msg, start) {\n for (var W = this.W, i = 0; i < 16; i++) W[i] = msg[start + i];\n for (; i < W.length; i++) W[i] = rotl32(W[i - 3] ^ W[i - 8] ^ W[i - 14] ^ W[i - 16], 1);\n var a = this.h[0],\n b = this.h[1],\n c = this.h[2],\n d = this.h[3],\n e = this.h[4];\n for (i = 0; i < W.length; i++) {\n var s = ~~(i / 20),\n t = sum32_5(rotl32(a, 5), ft_1(s, b, c, d), e, W[i], sha1_K[s]);\n (e = d), (d = c), (c = rotl32(b, 30)), (b = a), (a = t);\n }\n (this.h[0] = sum32(this.h[0], a)),\n (this.h[1] = sum32(this.h[1], b)),\n (this.h[2] = sum32(this.h[2], c)),\n (this.h[3] = sum32(this.h[3], d)),\n (this.h[4] = sum32(this.h[4], e));\n };\n SHA1.prototype._digest = function (enc) {\n return enc === \"hex\" ? utils.toHex32(this.h, \"big\") : utils.split32(this.h, \"big\");\n };\n },\n});\n\n// node_modules/hash.js/lib/hash/sha/256.js\nvar require__2 = __commonJS({\n \"node_modules/hash.js/lib/hash/sha/256.js\"(exports, module) {\n \"use strict\";\n var utils = require_utils4(),\n common = require_common(),\n shaCommon = require_common2(),\n assert = require_minimalistic_assert(),\n sum32 = utils.sum32,\n sum32_4 = utils.sum32_4,\n sum32_5 = utils.sum32_5,\n ch32 = shaCommon.ch32,\n maj32 = shaCommon.maj32,\n s0_256 = shaCommon.s0_256,\n s1_256 = shaCommon.s1_256,\n g0_256 = shaCommon.g0_256,\n g1_256 = shaCommon.g1_256,\n BlockHash = common.BlockHash,\n sha256_K = [\n 1116352408, 1899447441, 3049323471, 3921009573, 961987163, 1508970993, 2453635748, 2870763221, 3624381080,\n 310598401, 607225278, 1426881987, 1925078388, 2162078206, 2614888103, 3248222580, 3835390401, 4022224774,\n 264347078, 604807628, 770255983, 1249150122, 1555081692, 1996064986, 2554220882, 2821834349, 2952996808,\n 3210313671, 3336571891, 3584528711, 113926993, 338241895, 666307205, 773529912, 1294757372, 1396182291,\n 1695183700, 1986661051, 2177026350, 2456956037, 2730485921, 2820302411, 3259730800, 3345764771, 3516065817,\n 3600352804, 4094571909, 275423344, 430227734, 506948616, 659060556, 883997877, 958139571, 1322822218,\n 1537002063, 1747873779, 1955562222, 2024104815, 2227730452, 2361852424, 2428436474, 2756734187, 3204031479,\n 3329325298,\n ];\n function SHA256() {\n if (!(this instanceof SHA256)) return new SHA256();\n BlockHash.call(this),\n (this.h = [1779033703, 3144134277, 1013904242, 2773480762, 1359893119, 2600822924, 528734635, 1541459225]),\n (this.k = sha256_K),\n (this.W = new Array(64));\n }\n utils.inherits(SHA256, BlockHash);\n module.exports = SHA256;\n SHA256.blockSize = 512;\n SHA256.outSize = 256;\n SHA256.hmacStrength = 192;\n SHA256.padLength = 64;\n SHA256.prototype._update = function (msg, start) {\n for (var W = this.W, i = 0; i < 16; i++) W[i] = msg[start + i];\n for (; i < W.length; i++) W[i] = sum32_4(g1_256(W[i - 2]), W[i - 7], g0_256(W[i - 15]), W[i - 16]);\n var a = this.h[0],\n b = this.h[1],\n c = this.h[2],\n d = this.h[3],\n e = this.h[4],\n f = this.h[5],\n g = this.h[6],\n h = this.h[7];\n for (assert(this.k.length === W.length), i = 0; i < W.length; i++) {\n var T1 = sum32_5(h, s1_256(e), ch32(e, f, g), this.k[i], W[i]),\n T2 = sum32(s0_256(a), maj32(a, b, c));\n (h = g), (g = f), (f = e), (e = sum32(d, T1)), (d = c), (c = b), (b = a), (a = sum32(T1, T2));\n }\n (this.h[0] = sum32(this.h[0], a)),\n (this.h[1] = sum32(this.h[1], b)),\n (this.h[2] = sum32(this.h[2], c)),\n (this.h[3] = sum32(this.h[3], d)),\n (this.h[4] = sum32(this.h[4], e)),\n (this.h[5] = sum32(this.h[5], f)),\n (this.h[6] = sum32(this.h[6], g)),\n (this.h[7] = sum32(this.h[7], h));\n };\n SHA256.prototype._digest = function (enc) {\n return enc === \"hex\" ? utils.toHex32(this.h, \"big\") : utils.split32(this.h, \"big\");\n };\n },\n});\n\n// node_modules/hash.js/lib/hash/sha/224.js\nvar require__3 = __commonJS({\n \"node_modules/hash.js/lib/hash/sha/224.js\"(exports, module) {\n \"use strict\";\n var utils = require_utils4(),\n SHA256 = require__2();\n function SHA224() {\n if (!(this instanceof SHA224)) return new SHA224();\n SHA256.call(this),\n (this.h = [3238371032, 914150663, 812702999, 4144912697, 4290775857, 1750603025, 1694076839, 3204075428]);\n }\n utils.inherits(SHA224, SHA256);\n module.exports = SHA224;\n SHA224.blockSize = 512;\n SHA224.outSize = 224;\n SHA224.hmacStrength = 192;\n SHA224.padLength = 64;\n SHA224.prototype._digest = function (enc) {\n return enc === \"hex\" ? utils.toHex32(this.h.slice(0, 7), \"big\") : utils.split32(this.h.slice(0, 7), \"big\");\n };\n },\n});\n\n// node_modules/hash.js/lib/hash/sha/512.js\nvar require__4 = __commonJS({\n \"node_modules/hash.js/lib/hash/sha/512.js\"(exports, module) {\n \"use strict\";\n var utils = require_utils4(),\n common = require_common(),\n assert = require_minimalistic_assert(),\n rotr64_hi = utils.rotr64_hi,\n rotr64_lo = utils.rotr64_lo,\n shr64_hi = utils.shr64_hi,\n shr64_lo = utils.shr64_lo,\n sum64 = utils.sum64,\n sum64_hi = utils.sum64_hi,\n sum64_lo = utils.sum64_lo,\n sum64_4_hi = utils.sum64_4_hi,\n sum64_4_lo = utils.sum64_4_lo,\n sum64_5_hi = utils.sum64_5_hi,\n sum64_5_lo = utils.sum64_5_lo,\n BlockHash = common.BlockHash,\n sha512_K = [\n 1116352408, 3609767458, 1899447441, 602891725, 3049323471, 3964484399, 3921009573, 2173295548, 961987163,\n 4081628472, 1508970993, 3053834265, 2453635748, 2937671579, 2870763221, 3664609560, 3624381080, 2734883394,\n 310598401, 1164996542, 607225278, 1323610764, 1426881987, 3590304994, 1925078388, 4068182383, 2162078206,\n 991336113, 2614888103, 633803317, 3248222580, 3479774868, 3835390401, 2666613458, 4022224774, 944711139,\n 264347078, 2341262773, 604807628, 2007800933, 770255983, 1495990901, 1249150122, 1856431235, 1555081692,\n 3175218132, 1996064986, 2198950837, 2554220882, 3999719339, 2821834349, 766784016, 2952996808, 2566594879,\n 3210313671, 3203337956, 3336571891, 1034457026, 3584528711, 2466948901, 113926993, 3758326383, 338241895,\n 168717936, 666307205, 1188179964, 773529912, 1546045734, 1294757372, 1522805485, 1396182291, 2643833823,\n 1695183700, 2343527390, 1986661051, 1014477480, 2177026350, 1206759142, 2456956037, 344077627, 2730485921,\n 1290863460, 2820302411, 3158454273, 3259730800, 3505952657, 3345764771, 106217008, 3516065817, 3606008344,\n 3600352804, 1432725776, 4094571909, 1467031594, 275423344, 851169720, 430227734, 3100823752, 506948616,\n 1363258195, 659060556, 3750685593, 883997877, 3785050280, 958139571, 3318307427, 1322822218, 3812723403,\n 1537002063, 2003034995, 1747873779, 3602036899, 1955562222, 1575990012, 2024104815, 1125592928, 2227730452,\n 2716904306, 2361852424, 442776044, 2428436474, 593698344, 2756734187, 3733110249, 3204031479, 2999351573,\n 3329325298, 3815920427, 3391569614, 3928383900, 3515267271, 566280711, 3940187606, 3454069534, 4118630271,\n 4000239992, 116418474, 1914138554, 174292421, 2731055270, 289380356, 3203993006, 460393269, 320620315,\n 685471733, 587496836, 852142971, 1086792851, 1017036298, 365543100, 1126000580, 2618297676, 1288033470,\n 3409855158, 1501505948, 4234509866, 1607167915, 987167468, 1816402316, 1246189591,\n ];\n function SHA512() {\n if (!(this instanceof SHA512)) return new SHA512();\n BlockHash.call(this),\n (this.h = [\n 1779033703, 4089235720, 3144134277, 2227873595, 1013904242, 4271175723, 2773480762, 1595750129, 1359893119,\n 2917565137, 2600822924, 725511199, 528734635, 4215389547, 1541459225, 327033209,\n ]),\n (this.k = sha512_K),\n (this.W = new Array(160));\n }\n utils.inherits(SHA512, BlockHash);\n module.exports = SHA512;\n SHA512.blockSize = 1024;\n SHA512.outSize = 512;\n SHA512.hmacStrength = 192;\n SHA512.padLength = 128;\n SHA512.prototype._prepareBlock = function (msg, start) {\n for (var W = this.W, i = 0; i < 32; i++) W[i] = msg[start + i];\n for (; i < W.length; i += 2) {\n var c0_hi = g1_512_hi(W[i - 4], W[i - 3]),\n c0_lo = g1_512_lo(W[i - 4], W[i - 3]),\n c1_hi = W[i - 14],\n c1_lo = W[i - 13],\n c2_hi = g0_512_hi(W[i - 30], W[i - 29]),\n c2_lo = g0_512_lo(W[i - 30], W[i - 29]),\n c3_hi = W[i - 32],\n c3_lo = W[i - 31];\n (W[i] = sum64_4_hi(c0_hi, c0_lo, c1_hi, c1_lo, c2_hi, c2_lo, c3_hi, c3_lo)),\n (W[i + 1] = sum64_4_lo(c0_hi, c0_lo, c1_hi, c1_lo, c2_hi, c2_lo, c3_hi, c3_lo));\n }\n };\n SHA512.prototype._update = function (msg, start) {\n this._prepareBlock(msg, start);\n var W = this.W,\n ah = this.h[0],\n al = this.h[1],\n bh = this.h[2],\n bl = this.h[3],\n ch = this.h[4],\n cl = this.h[5],\n dh = this.h[6],\n dl = this.h[7],\n eh = this.h[8],\n el = this.h[9],\n fh = this.h[10],\n fl = this.h[11],\n gh = this.h[12],\n gl = this.h[13],\n hh = this.h[14],\n hl = this.h[15];\n assert(this.k.length === W.length);\n for (var i = 0; i < W.length; i += 2) {\n var c0_hi = hh,\n c0_lo = hl,\n c1_hi = s1_512_hi(eh, el),\n c1_lo = s1_512_lo(eh, el),\n c2_hi = ch64_hi(eh, el, fh, fl, gh, gl),\n c2_lo = ch64_lo(eh, el, fh, fl, gh, gl),\n c3_hi = this.k[i],\n c3_lo = this.k[i + 1],\n c4_hi = W[i],\n c4_lo = W[i + 1],\n T1_hi = sum64_5_hi(c0_hi, c0_lo, c1_hi, c1_lo, c2_hi, c2_lo, c3_hi, c3_lo, c4_hi, c4_lo),\n T1_lo = sum64_5_lo(c0_hi, c0_lo, c1_hi, c1_lo, c2_hi, c2_lo, c3_hi, c3_lo, c4_hi, c4_lo);\n (c0_hi = s0_512_hi(ah, al)),\n (c0_lo = s0_512_lo(ah, al)),\n (c1_hi = maj64_hi(ah, al, bh, bl, ch, cl)),\n (c1_lo = maj64_lo(ah, al, bh, bl, ch, cl));\n var T2_hi = sum64_hi(c0_hi, c0_lo, c1_hi, c1_lo),\n T2_lo = sum64_lo(c0_hi, c0_lo, c1_hi, c1_lo);\n (hh = gh),\n (hl = gl),\n (gh = fh),\n (gl = fl),\n (fh = eh),\n (fl = el),\n (eh = sum64_hi(dh, dl, T1_hi, T1_lo)),\n (el = sum64_lo(dl, dl, T1_hi, T1_lo)),\n (dh = ch),\n (dl = cl),\n (ch = bh),\n (cl = bl),\n (bh = ah),\n (bl = al),\n (ah = sum64_hi(T1_hi, T1_lo, T2_hi, T2_lo)),\n (al = sum64_lo(T1_hi, T1_lo, T2_hi, T2_lo));\n }\n sum64(this.h, 0, ah, al),\n sum64(this.h, 2, bh, bl),\n sum64(this.h, 4, ch, cl),\n sum64(this.h, 6, dh, dl),\n sum64(this.h, 8, eh, el),\n sum64(this.h, 10, fh, fl),\n sum64(this.h, 12, gh, gl),\n sum64(this.h, 14, hh, hl);\n };\n SHA512.prototype._digest = function (enc) {\n return enc === \"hex\" ? utils.toHex32(this.h, \"big\") : utils.split32(this.h, \"big\");\n };\n function ch64_hi(xh, xl, yh, yl, zh) {\n var r = (xh & yh) ^ (~xh & zh);\n return r < 0 && (r += 4294967296), r;\n }\n function ch64_lo(xh, xl, yh, yl, zh, zl) {\n var r = (xl & yl) ^ (~xl & zl);\n return r < 0 && (r += 4294967296), r;\n }\n function maj64_hi(xh, xl, yh, yl, zh) {\n var r = (xh & yh) ^ (xh & zh) ^ (yh & zh);\n return r < 0 && (r += 4294967296), r;\n }\n function maj64_lo(xh, xl, yh, yl, zh, zl) {\n var r = (xl & yl) ^ (xl & zl) ^ (yl & zl);\n return r < 0 && (r += 4294967296), r;\n }\n function s0_512_hi(xh, xl) {\n var c0_hi = rotr64_hi(xh, xl, 28),\n c1_hi = rotr64_hi(xl, xh, 2),\n c2_hi = rotr64_hi(xl, xh, 7),\n r = c0_hi ^ c1_hi ^ c2_hi;\n return r < 0 && (r += 4294967296), r;\n }\n function s0_512_lo(xh, xl) {\n var c0_lo = rotr64_lo(xh, xl, 28),\n c1_lo = rotr64_lo(xl, xh, 2),\n c2_lo = rotr64_lo(xl, xh, 7),\n r = c0_lo ^ c1_lo ^ c2_lo;\n return r < 0 && (r += 4294967296), r;\n }\n function s1_512_hi(xh, xl) {\n var c0_hi = rotr64_hi(xh, xl, 14),\n c1_hi = rotr64_hi(xh, xl, 18),\n c2_hi = rotr64_hi(xl, xh, 9),\n r = c0_hi ^ c1_hi ^ c2_hi;\n return r < 0 && (r += 4294967296), r;\n }\n function s1_512_lo(xh, xl) {\n var c0_lo = rotr64_lo(xh, xl, 14),\n c1_lo = rotr64_lo(xh, xl, 18),\n c2_lo = rotr64_lo(xl, xh, 9),\n r = c0_lo ^ c1_lo ^ c2_lo;\n return r < 0 && (r += 4294967296), r;\n }\n function g0_512_hi(xh, xl) {\n var c0_hi = rotr64_hi(xh, xl, 1),\n c1_hi = rotr64_hi(xh, xl, 8),\n c2_hi = shr64_hi(xh, xl, 7),\n r = c0_hi ^ c1_hi ^ c2_hi;\n return r < 0 && (r += 4294967296), r;\n }\n function g0_512_lo(xh, xl) {\n var c0_lo = rotr64_lo(xh, xl, 1),\n c1_lo = rotr64_lo(xh, xl, 8),\n c2_lo = shr64_lo(xh, xl, 7),\n r = c0_lo ^ c1_lo ^ c2_lo;\n return r < 0 && (r += 4294967296), r;\n }\n function g1_512_hi(xh, xl) {\n var c0_hi = rotr64_hi(xh, xl, 19),\n c1_hi = rotr64_hi(xl, xh, 29),\n c2_hi = shr64_hi(xh, xl, 6),\n r = c0_hi ^ c1_hi ^ c2_hi;\n return r < 0 && (r += 4294967296), r;\n }\n function g1_512_lo(xh, xl) {\n var c0_lo = rotr64_lo(xh, xl, 19),\n c1_lo = rotr64_lo(xl, xh, 29),\n c2_lo = shr64_lo(xh, xl, 6),\n r = c0_lo ^ c1_lo ^ c2_lo;\n return r < 0 && (r += 4294967296), r;\n }\n },\n});\n\n// node_modules/hash.js/lib/hash/sha/384.js\nvar require__5 = __commonJS({\n \"node_modules/hash.js/lib/hash/sha/384.js\"(exports, module) {\n \"use strict\";\n var utils = require_utils4(),\n SHA512 = require__4();\n function SHA384() {\n if (!(this instanceof SHA384)) return new SHA384();\n SHA512.call(this),\n (this.h = [\n 3418070365, 3238371032, 1654270250, 914150663, 2438529370, 812702999, 355462360, 4144912697, 1731405415,\n 4290775857, 2394180231, 1750603025, 3675008525, 1694076839, 1203062813, 3204075428,\n ]);\n }\n utils.inherits(SHA384, SHA512);\n module.exports = SHA384;\n SHA384.blockSize = 1024;\n SHA384.outSize = 384;\n SHA384.hmacStrength = 192;\n SHA384.padLength = 128;\n SHA384.prototype._digest = function (enc) {\n return enc === \"hex\" ? utils.toHex32(this.h.slice(0, 12), \"big\") : utils.split32(this.h.slice(0, 12), \"big\");\n };\n },\n});\n\n// node_modules/hash.js/lib/hash/sha.js\nvar require_sha3 = __commonJS({\n \"node_modules/hash.js/lib/hash/sha.js\"(exports) {\n \"use strict\";\n exports.sha1 = require__();\n exports.sha224 = require__3();\n exports.sha256 = require__2();\n exports.sha384 = require__5();\n exports.sha512 = require__4();\n },\n});\n\n// node_modules/hash.js/lib/hash/ripemd.js\nvar require_ripemd = __commonJS({\n \"node_modules/hash.js/lib/hash/ripemd.js\"(exports) {\n \"use strict\";\n var utils = require_utils4(),\n common = require_common(),\n rotl32 = utils.rotl32,\n sum32 = utils.sum32,\n sum32_3 = utils.sum32_3,\n sum32_4 = utils.sum32_4,\n BlockHash = common.BlockHash;\n function RIPEMD160() {\n if (!(this instanceof RIPEMD160)) return new RIPEMD160();\n BlockHash.call(this),\n (this.h = [1732584193, 4023233417, 2562383102, 271733878, 3285377520]),\n (this.endian = \"little\");\n }\n utils.inherits(RIPEMD160, BlockHash);\n exports.ripemd160 = RIPEMD160;\n RIPEMD160.blockSize = 512;\n RIPEMD160.outSize = 160;\n RIPEMD160.hmacStrength = 192;\n RIPEMD160.padLength = 64;\n RIPEMD160.prototype._update = function (msg, start) {\n for (\n var A = this.h[0],\n B = this.h[1],\n C = this.h[2],\n D = this.h[3],\n E = this.h[4],\n Ah = A,\n Bh = B,\n Ch = C,\n Dh = D,\n Eh = E,\n j = 0;\n j < 80;\n j++\n ) {\n var T = sum32(rotl32(sum32_4(A, f(j, B, C, D), msg[r[j] + start], K(j)), s[j]), E);\n (A = E),\n (E = D),\n (D = rotl32(C, 10)),\n (C = B),\n (B = T),\n (T = sum32(rotl32(sum32_4(Ah, f(79 - j, Bh, Ch, Dh), msg[rh[j] + start], Kh(j)), sh[j]), Eh)),\n (Ah = Eh),\n (Eh = Dh),\n (Dh = rotl32(Ch, 10)),\n (Ch = Bh),\n (Bh = T);\n }\n (T = sum32_3(this.h[1], C, Dh)),\n (this.h[1] = sum32_3(this.h[2], D, Eh)),\n (this.h[2] = sum32_3(this.h[3], E, Ah)),\n (this.h[3] = sum32_3(this.h[4], A, Bh)),\n (this.h[4] = sum32_3(this.h[0], B, Ch)),\n (this.h[0] = T);\n };\n RIPEMD160.prototype._digest = function (enc) {\n return enc === \"hex\" ? utils.toHex32(this.h, \"little\") : utils.split32(this.h, \"little\");\n };\n function f(j, x, y, z) {\n return j <= 15\n ? x ^ y ^ z\n : j <= 31\n ? (x & y) | (~x & z)\n : j <= 47\n ? (x | ~y) ^ z\n : j <= 63\n ? (x & z) | (y & ~z)\n : x ^ (y | ~z);\n }\n function K(j) {\n return j <= 15 ? 0 : j <= 31 ? 1518500249 : j <= 47 ? 1859775393 : j <= 63 ? 2400959708 : 2840853838;\n }\n function Kh(j) {\n return j <= 15 ? 1352829926 : j <= 31 ? 1548603684 : j <= 47 ? 1836072691 : j <= 63 ? 2053994217 : 0;\n }\n var r = [\n 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 7, 4, 13, 1, 10, 6, 15, 3, 12, 0, 9, 5, 2, 14, 11, 8, 3,\n 10, 14, 4, 9, 15, 8, 1, 2, 7, 0, 6, 13, 11, 5, 12, 1, 9, 11, 10, 0, 8, 12, 4, 13, 3, 7, 15, 14, 5, 6, 2, 4, 0,\n 5, 9, 7, 12, 2, 10, 14, 1, 3, 8, 11, 6, 15, 13,\n ],\n rh = [\n 5, 14, 7, 0, 9, 2, 11, 4, 13, 6, 15, 8, 1, 10, 3, 12, 6, 11, 3, 7, 0, 13, 5, 10, 14, 15, 8, 12, 4, 9, 1, 2, 15,\n 5, 1, 3, 7, 14, 6, 9, 11, 8, 12, 2, 10, 0, 4, 13, 8, 6, 4, 1, 3, 11, 15, 0, 5, 12, 2, 13, 9, 7, 10, 14, 12, 15,\n 10, 4, 1, 5, 8, 7, 6, 2, 13, 14, 0, 3, 9, 11,\n ],\n s = [\n 11, 14, 15, 12, 5, 8, 7, 9, 11, 13, 14, 15, 6, 7, 9, 8, 7, 6, 8, 13, 11, 9, 7, 15, 7, 12, 15, 9, 11, 7, 13, 12,\n 11, 13, 6, 7, 14, 9, 13, 15, 14, 8, 13, 6, 5, 12, 7, 5, 11, 12, 14, 15, 14, 15, 9, 8, 9, 14, 5, 6, 8, 6, 5, 12,\n 9, 15, 5, 11, 6, 8, 13, 12, 5, 12, 13, 14, 11, 8, 5, 6,\n ],\n sh = [\n 8, 9, 9, 11, 13, 15, 15, 5, 7, 7, 8, 11, 14, 14, 12, 6, 9, 13, 15, 7, 12, 8, 9, 11, 7, 7, 12, 7, 6, 15, 13, 11,\n 9, 7, 15, 11, 8, 6, 6, 14, 12, 13, 5, 14, 13, 13, 7, 5, 15, 5, 8, 11, 14, 14, 6, 14, 6, 9, 12, 9, 12, 5, 15, 8,\n 8, 5, 12, 9, 12, 5, 14, 6, 8, 13, 6, 5, 15, 13, 11, 11,\n ];\n },\n});\n\n// node_modules/hash.js/lib/hash/hmac.js\nvar require_hmac = __commonJS({\n \"node_modules/hash.js/lib/hash/hmac.js\"(exports, module) {\n \"use strict\";\n var utils = require_utils4(),\n assert = require_minimalistic_assert();\n function Hmac(hash, key, enc) {\n if (!(this instanceof Hmac)) return new Hmac(hash, key, enc);\n (this.Hash = hash),\n (this.blockSize = hash.blockSize / 8),\n (this.outSize = hash.outSize / 8),\n (this.inner = null),\n (this.outer = null),\n this._init(utils.toArray(key, enc));\n }\n module.exports = Hmac;\n Hmac.prototype._init = function (key) {\n key.length > this.blockSize && (key = new this.Hash().update(key).digest()), assert(key.length <= this.blockSize);\n for (var i = key.length; i < this.blockSize; i++) key.push(0);\n for (i = 0; i < key.length; i++) key[i] ^= 54;\n for (this.inner = new this.Hash().update(key), i = 0; i < key.length; i++) key[i] ^= 106;\n this.outer = new this.Hash().update(key);\n };\n Hmac.prototype.update = function (msg, enc) {\n return this.inner.update(msg, enc), this;\n };\n Hmac.prototype.digest = function (enc) {\n return this.outer.update(this.inner.digest()), this.outer.digest(enc);\n };\n },\n});\n\n// node_modules/hash.js/lib/hash.js\nvar require_hash2 = __commonJS({\n \"node_modules/hash.js/lib/hash.js\"(exports) {\n var hash = exports;\n hash.utils = require_utils4();\n hash.common = require_common();\n hash.sha = require_sha3();\n hash.ripemd = require_ripemd();\n hash.hmac = require_hmac();\n hash.sha1 = hash.sha.sha1;\n hash.sha256 = hash.sha.sha256;\n hash.sha224 = hash.sha.sha224;\n hash.sha384 = hash.sha.sha384;\n hash.sha512 = hash.sha.sha512;\n hash.ripemd160 = hash.ripemd.ripemd160;\n },\n});\n\n// node_modules/elliptic/lib/elliptic/precomputed/secp256k1.js\nvar require_secp256k1 = __commonJS({\n \"node_modules/elliptic/lib/elliptic/precomputed/secp256k1.js\"(exports, module) {\n module.exports = {\n doubles: {\n step: 4,\n points: [\n [\n \"e60fce93b59e9ec53011aabc21c23e97b2a31369b87a5ae9c44ee89e2a6dec0a\",\n \"f7e3507399e595929db99f34f57937101296891e44d23f0be1f32cce69616821\",\n ],\n [\n \"8282263212c609d9ea2a6e3e172de238d8c39cabd5ac1ca10646e23fd5f51508\",\n \"11f8a8098557dfe45e8256e830b60ace62d613ac2f7b17bed31b6eaff6e26caf\",\n ],\n [\n \"175e159f728b865a72f99cc6c6fc846de0b93833fd2222ed73fce5b551e5b739\",\n \"d3506e0d9e3c79eba4ef97a51ff71f5eacb5955add24345c6efa6ffee9fed695\",\n ],\n [\n \"363d90d447b00c9c99ceac05b6262ee053441c7e55552ffe526bad8f83ff4640\",\n \"4e273adfc732221953b445397f3363145b9a89008199ecb62003c7f3bee9de9\",\n ],\n [\n \"8b4b5f165df3c2be8c6244b5b745638843e4a781a15bcd1b69f79a55dffdf80c\",\n \"4aad0a6f68d308b4b3fbd7813ab0da04f9e336546162ee56b3eff0c65fd4fd36\",\n ],\n [\n \"723cbaa6e5db996d6bf771c00bd548c7b700dbffa6c0e77bcb6115925232fcda\",\n \"96e867b5595cc498a921137488824d6e2660a0653779494801dc069d9eb39f5f\",\n ],\n [\n \"eebfa4d493bebf98ba5feec812c2d3b50947961237a919839a533eca0e7dd7fa\",\n \"5d9a8ca3970ef0f269ee7edaf178089d9ae4cdc3a711f712ddfd4fdae1de8999\",\n ],\n [\n \"100f44da696e71672791d0a09b7bde459f1215a29b3c03bfefd7835b39a48db0\",\n \"cdd9e13192a00b772ec8f3300c090666b7ff4a18ff5195ac0fbd5cd62bc65a09\",\n ],\n [\n \"e1031be262c7ed1b1dc9227a4a04c017a77f8d4464f3b3852c8acde6e534fd2d\",\n \"9d7061928940405e6bb6a4176597535af292dd419e1ced79a44f18f29456a00d\",\n ],\n [\n \"feea6cae46d55b530ac2839f143bd7ec5cf8b266a41d6af52d5e688d9094696d\",\n \"e57c6b6c97dce1bab06e4e12bf3ecd5c981c8957cc41442d3155debf18090088\",\n ],\n [\n \"da67a91d91049cdcb367be4be6ffca3cfeed657d808583de33fa978bc1ec6cb1\",\n \"9bacaa35481642bc41f463f7ec9780e5dec7adc508f740a17e9ea8e27a68be1d\",\n ],\n [\n \"53904faa0b334cdda6e000935ef22151ec08d0f7bb11069f57545ccc1a37b7c0\",\n \"5bc087d0bc80106d88c9eccac20d3c1c13999981e14434699dcb096b022771c8\",\n ],\n [\n \"8e7bcd0bd35983a7719cca7764ca906779b53a043a9b8bcaeff959f43ad86047\",\n \"10b7770b2a3da4b3940310420ca9514579e88e2e47fd68b3ea10047e8460372a\",\n ],\n [\n \"385eed34c1cdff21e6d0818689b81bde71a7f4f18397e6690a841e1599c43862\",\n \"283bebc3e8ea23f56701de19e9ebf4576b304eec2086dc8cc0458fe5542e5453\",\n ],\n [\n \"6f9d9b803ecf191637c73a4413dfa180fddf84a5947fbc9c606ed86c3fac3a7\",\n \"7c80c68e603059ba69b8e2a30e45c4d47ea4dd2f5c281002d86890603a842160\",\n ],\n [\n \"3322d401243c4e2582a2147c104d6ecbf774d163db0f5e5313b7e0e742d0e6bd\",\n \"56e70797e9664ef5bfb019bc4ddaf9b72805f63ea2873af624f3a2e96c28b2a0\",\n ],\n [\n \"85672c7d2de0b7da2bd1770d89665868741b3f9af7643397721d74d28134ab83\",\n \"7c481b9b5b43b2eb6374049bfa62c2e5e77f17fcc5298f44c8e3094f790313a6\",\n ],\n [\n \"948bf809b1988a46b06c9f1919413b10f9226c60f668832ffd959af60c82a0a\",\n \"53a562856dcb6646dc6b74c5d1c3418c6d4dff08c97cd2bed4cb7f88d8c8e589\",\n ],\n [\n \"6260ce7f461801c34f067ce0f02873a8f1b0e44dfc69752accecd819f38fd8e8\",\n \"bc2da82b6fa5b571a7f09049776a1ef7ecd292238051c198c1a84e95b2b4ae17\",\n ],\n [\n \"e5037de0afc1d8d43d8348414bbf4103043ec8f575bfdc432953cc8d2037fa2d\",\n \"4571534baa94d3b5f9f98d09fb990bddbd5f5b03ec481f10e0e5dc841d755bda\",\n ],\n [\n \"e06372b0f4a207adf5ea905e8f1771b4e7e8dbd1c6a6c5b725866a0ae4fce725\",\n \"7a908974bce18cfe12a27bb2ad5a488cd7484a7787104870b27034f94eee31dd\",\n ],\n [\n \"213c7a715cd5d45358d0bbf9dc0ce02204b10bdde2a3f58540ad6908d0559754\",\n \"4b6dad0b5ae462507013ad06245ba190bb4850f5f36a7eeddff2c27534b458f2\",\n ],\n [\n \"4e7c272a7af4b34e8dbb9352a5419a87e2838c70adc62cddf0cc3a3b08fbd53c\",\n \"17749c766c9d0b18e16fd09f6def681b530b9614bff7dd33e0b3941817dcaae6\",\n ],\n [\n \"fea74e3dbe778b1b10f238ad61686aa5c76e3db2be43057632427e2840fb27b6\",\n \"6e0568db9b0b13297cf674deccb6af93126b596b973f7b77701d3db7f23cb96f\",\n ],\n [\n \"76e64113f677cf0e10a2570d599968d31544e179b760432952c02a4417bdde39\",\n \"c90ddf8dee4e95cf577066d70681f0d35e2a33d2b56d2032b4b1752d1901ac01\",\n ],\n [\n \"c738c56b03b2abe1e8281baa743f8f9a8f7cc643df26cbee3ab150242bcbb891\",\n \"893fb578951ad2537f718f2eacbfbbbb82314eef7880cfe917e735d9699a84c3\",\n ],\n [\n \"d895626548b65b81e264c7637c972877d1d72e5f3a925014372e9f6588f6c14b\",\n \"febfaa38f2bc7eae728ec60818c340eb03428d632bb067e179363ed75d7d991f\",\n ],\n [\n \"b8da94032a957518eb0f6433571e8761ceffc73693e84edd49150a564f676e03\",\n \"2804dfa44805a1e4d7c99cc9762808b092cc584d95ff3b511488e4e74efdf6e7\",\n ],\n [\n \"e80fea14441fb33a7d8adab9475d7fab2019effb5156a792f1a11778e3c0df5d\",\n \"eed1de7f638e00771e89768ca3ca94472d155e80af322ea9fcb4291b6ac9ec78\",\n ],\n [\n \"a301697bdfcd704313ba48e51d567543f2a182031efd6915ddc07bbcc4e16070\",\n \"7370f91cfb67e4f5081809fa25d40f9b1735dbf7c0a11a130c0d1a041e177ea1\",\n ],\n [\n \"90ad85b389d6b936463f9d0512678de208cc330b11307fffab7ac63e3fb04ed4\",\n \"e507a3620a38261affdcbd9427222b839aefabe1582894d991d4d48cb6ef150\",\n ],\n [\n \"8f68b9d2f63b5f339239c1ad981f162ee88c5678723ea3351b7b444c9ec4c0da\",\n \"662a9f2dba063986de1d90c2b6be215dbbea2cfe95510bfdf23cbf79501fff82\",\n ],\n [\n \"e4f3fb0176af85d65ff99ff9198c36091f48e86503681e3e6686fd5053231e11\",\n \"1e63633ad0ef4f1c1661a6d0ea02b7286cc7e74ec951d1c9822c38576feb73bc\",\n ],\n [\n \"8c00fa9b18ebf331eb961537a45a4266c7034f2f0d4e1d0716fb6eae20eae29e\",\n \"efa47267fea521a1a9dc343a3736c974c2fadafa81e36c54e7d2a4c66702414b\",\n ],\n [\n \"e7a26ce69dd4829f3e10cec0a9e98ed3143d084f308b92c0997fddfc60cb3e41\",\n \"2a758e300fa7984b471b006a1aafbb18d0a6b2c0420e83e20e8a9421cf2cfd51\",\n ],\n [\n \"b6459e0ee3662ec8d23540c223bcbdc571cbcb967d79424f3cf29eb3de6b80ef\",\n \"67c876d06f3e06de1dadf16e5661db3c4b3ae6d48e35b2ff30bf0b61a71ba45\",\n ],\n [\n \"d68a80c8280bb840793234aa118f06231d6f1fc67e73c5a5deda0f5b496943e8\",\n \"db8ba9fff4b586d00c4b1f9177b0e28b5b0e7b8f7845295a294c84266b133120\",\n ],\n [\n \"324aed7df65c804252dc0270907a30b09612aeb973449cea4095980fc28d3d5d\",\n \"648a365774b61f2ff130c0c35aec1f4f19213b0c7e332843967224af96ab7c84\",\n ],\n [\n \"4df9c14919cde61f6d51dfdbe5fee5dceec4143ba8d1ca888e8bd373fd054c96\",\n \"35ec51092d8728050974c23a1d85d4b5d506cdc288490192ebac06cad10d5d\",\n ],\n [\n \"9c3919a84a474870faed8a9c1cc66021523489054d7f0308cbfc99c8ac1f98cd\",\n \"ddb84f0f4a4ddd57584f044bf260e641905326f76c64c8e6be7e5e03d4fc599d\",\n ],\n [\n \"6057170b1dd12fdf8de05f281d8e06bb91e1493a8b91d4cc5a21382120a959e5\",\n \"9a1af0b26a6a4807add9a2daf71df262465152bc3ee24c65e899be932385a2a8\",\n ],\n [\n \"a576df8e23a08411421439a4518da31880cef0fba7d4df12b1a6973eecb94266\",\n \"40a6bf20e76640b2c92b97afe58cd82c432e10a7f514d9f3ee8be11ae1b28ec8\",\n ],\n [\n \"7778a78c28dec3e30a05fe9629de8c38bb30d1f5cf9a3a208f763889be58ad71\",\n \"34626d9ab5a5b22ff7098e12f2ff580087b38411ff24ac563b513fc1fd9f43ac\",\n ],\n [\n \"928955ee637a84463729fd30e7afd2ed5f96274e5ad7e5cb09eda9c06d903ac\",\n \"c25621003d3f42a827b78a13093a95eeac3d26efa8a8d83fc5180e935bcd091f\",\n ],\n [\n \"85d0fef3ec6db109399064f3a0e3b2855645b4a907ad354527aae75163d82751\",\n \"1f03648413a38c0be29d496e582cf5663e8751e96877331582c237a24eb1f962\",\n ],\n [\n \"ff2b0dce97eece97c1c9b6041798b85dfdfb6d8882da20308f5404824526087e\",\n \"493d13fef524ba188af4c4dc54d07936c7b7ed6fb90e2ceb2c951e01f0c29907\",\n ],\n [\n \"827fbbe4b1e880ea9ed2b2e6301b212b57f1ee148cd6dd28780e5e2cf856e241\",\n \"c60f9c923c727b0b71bef2c67d1d12687ff7a63186903166d605b68baec293ec\",\n ],\n [\n \"eaa649f21f51bdbae7be4ae34ce6e5217a58fdce7f47f9aa7f3b58fa2120e2b3\",\n \"be3279ed5bbbb03ac69a80f89879aa5a01a6b965f13f7e59d47a5305ba5ad93d\",\n ],\n [\n \"e4a42d43c5cf169d9391df6decf42ee541b6d8f0c9a137401e23632dda34d24f\",\n \"4d9f92e716d1c73526fc99ccfb8ad34ce886eedfa8d8e4f13a7f7131deba9414\",\n ],\n [\n \"1ec80fef360cbdd954160fadab352b6b92b53576a88fea4947173b9d4300bf19\",\n \"aeefe93756b5340d2f3a4958a7abbf5e0146e77f6295a07b671cdc1cc107cefd\",\n ],\n [\n \"146a778c04670c2f91b00af4680dfa8bce3490717d58ba889ddb5928366642be\",\n \"b318e0ec3354028add669827f9d4b2870aaa971d2f7e5ed1d0b297483d83efd0\",\n ],\n [\n \"fa50c0f61d22e5f07e3acebb1aa07b128d0012209a28b9776d76a8793180eef9\",\n \"6b84c6922397eba9b72cd2872281a68a5e683293a57a213b38cd8d7d3f4f2811\",\n ],\n [\n \"da1d61d0ca721a11b1a5bf6b7d88e8421a288ab5d5bba5220e53d32b5f067ec2\",\n \"8157f55a7c99306c79c0766161c91e2966a73899d279b48a655fba0f1ad836f1\",\n ],\n [\n \"a8e282ff0c9706907215ff98e8fd416615311de0446f1e062a73b0610d064e13\",\n \"7f97355b8db81c09abfb7f3c5b2515888b679a3e50dd6bd6cef7c73111f4cc0c\",\n ],\n [\n \"174a53b9c9a285872d39e56e6913cab15d59b1fa512508c022f382de8319497c\",\n \"ccc9dc37abfc9c1657b4155f2c47f9e6646b3a1d8cb9854383da13ac079afa73\",\n ],\n [\n \"959396981943785c3d3e57edf5018cdbe039e730e4918b3d884fdff09475b7ba\",\n \"2e7e552888c331dd8ba0386a4b9cd6849c653f64c8709385e9b8abf87524f2fd\",\n ],\n [\n \"d2a63a50ae401e56d645a1153b109a8fcca0a43d561fba2dbb51340c9d82b151\",\n \"e82d86fb6443fcb7565aee58b2948220a70f750af484ca52d4142174dcf89405\",\n ],\n [\n \"64587e2335471eb890ee7896d7cfdc866bacbdbd3839317b3436f9b45617e073\",\n \"d99fcdd5bf6902e2ae96dd6447c299a185b90a39133aeab358299e5e9faf6589\",\n ],\n [\n \"8481bde0e4e4d885b3a546d3e549de042f0aa6cea250e7fd358d6c86dd45e458\",\n \"38ee7b8cba5404dd84a25bf39cecb2ca900a79c42b262e556d64b1b59779057e\",\n ],\n [\n \"13464a57a78102aa62b6979ae817f4637ffcfed3c4b1ce30bcd6303f6caf666b\",\n \"69be159004614580ef7e433453ccb0ca48f300a81d0942e13f495a907f6ecc27\",\n ],\n [\n \"bc4a9df5b713fe2e9aef430bcc1dc97a0cd9ccede2f28588cada3a0d2d83f366\",\n \"d3a81ca6e785c06383937adf4b798caa6e8a9fbfa547b16d758d666581f33c1\",\n ],\n [\n \"8c28a97bf8298bc0d23d8c749452a32e694b65e30a9472a3954ab30fe5324caa\",\n \"40a30463a3305193378fedf31f7cc0eb7ae784f0451cb9459e71dc73cbef9482\",\n ],\n [\n \"8ea9666139527a8c1dd94ce4f071fd23c8b350c5a4bb33748c4ba111faccae0\",\n \"620efabbc8ee2782e24e7c0cfb95c5d735b783be9cf0f8e955af34a30e62b945\",\n ],\n [\n \"dd3625faef5ba06074669716bbd3788d89bdde815959968092f76cc4eb9a9787\",\n \"7a188fa3520e30d461da2501045731ca941461982883395937f68d00c644a573\",\n ],\n [\n \"f710d79d9eb962297e4f6232b40e8f7feb2bc63814614d692c12de752408221e\",\n \"ea98e67232d3b3295d3b535532115ccac8612c721851617526ae47a9c77bfc82\",\n ],\n ],\n },\n naf: {\n wnd: 7,\n points: [\n [\n \"f9308a019258c31049344f85f89d5229b531c845836f99b08601f113bce036f9\",\n \"388f7b0f632de8140fe337e62a37f3566500a99934c2231b6cb9fd7584b8e672\",\n ],\n [\n \"2f8bde4d1a07209355b4a7250a5c5128e88b84bddc619ab7cba8d569b240efe4\",\n \"d8ac222636e5e3d6d4dba9dda6c9c426f788271bab0d6840dca87d3aa6ac62d6\",\n ],\n [\n \"5cbdf0646e5db4eaa398f365f2ea7a0e3d419b7e0330e39ce92bddedcac4f9bc\",\n \"6aebca40ba255960a3178d6d861a54dba813d0b813fde7b5a5082628087264da\",\n ],\n [\n \"acd484e2f0c7f65309ad178a9f559abde09796974c57e714c35f110dfc27ccbe\",\n \"cc338921b0a7d9fd64380971763b61e9add888a4375f8e0f05cc262ac64f9c37\",\n ],\n [\n \"774ae7f858a9411e5ef4246b70c65aac5649980be5c17891bbec17895da008cb\",\n \"d984a032eb6b5e190243dd56d7b7b365372db1e2dff9d6a8301d74c9c953c61b\",\n ],\n [\n \"f28773c2d975288bc7d1d205c3748651b075fbc6610e58cddeeddf8f19405aa8\",\n \"ab0902e8d880a89758212eb65cdaf473a1a06da521fa91f29b5cb52db03ed81\",\n ],\n [\n \"d7924d4f7d43ea965a465ae3095ff41131e5946f3c85f79e44adbcf8e27e080e\",\n \"581e2872a86c72a683842ec228cc6defea40af2bd896d3a5c504dc9ff6a26b58\",\n ],\n [\n \"defdea4cdb677750a420fee807eacf21eb9898ae79b9768766e4faa04a2d4a34\",\n \"4211ab0694635168e997b0ead2a93daeced1f4a04a95c0f6cfb199f69e56eb77\",\n ],\n [\n \"2b4ea0a797a443d293ef5cff444f4979f06acfebd7e86d277475656138385b6c\",\n \"85e89bc037945d93b343083b5a1c86131a01f60c50269763b570c854e5c09b7a\",\n ],\n [\n \"352bbf4a4cdd12564f93fa332ce333301d9ad40271f8107181340aef25be59d5\",\n \"321eb4075348f534d59c18259dda3e1f4a1b3b2e71b1039c67bd3d8bcf81998c\",\n ],\n [\n \"2fa2104d6b38d11b0230010559879124e42ab8dfeff5ff29dc9cdadd4ecacc3f\",\n \"2de1068295dd865b64569335bd5dd80181d70ecfc882648423ba76b532b7d67\",\n ],\n [\n \"9248279b09b4d68dab21a9b066edda83263c3d84e09572e269ca0cd7f5453714\",\n \"73016f7bf234aade5d1aa71bdea2b1ff3fc0de2a887912ffe54a32ce97cb3402\",\n ],\n [\n \"daed4f2be3a8bf278e70132fb0beb7522f570e144bf615c07e996d443dee8729\",\n \"a69dce4a7d6c98e8d4a1aca87ef8d7003f83c230f3afa726ab40e52290be1c55\",\n ],\n [\n \"c44d12c7065d812e8acf28d7cbb19f9011ecd9e9fdf281b0e6a3b5e87d22e7db\",\n \"2119a460ce326cdc76c45926c982fdac0e106e861edf61c5a039063f0e0e6482\",\n ],\n [\n \"6a245bf6dc698504c89a20cfded60853152b695336c28063b61c65cbd269e6b4\",\n \"e022cf42c2bd4a708b3f5126f16a24ad8b33ba48d0423b6efd5e6348100d8a82\",\n ],\n [\n \"1697ffa6fd9de627c077e3d2fe541084ce13300b0bec1146f95ae57f0d0bd6a5\",\n \"b9c398f186806f5d27561506e4557433a2cf15009e498ae7adee9d63d01b2396\",\n ],\n [\n \"605bdb019981718b986d0f07e834cb0d9deb8360ffb7f61df982345ef27a7479\",\n \"2972d2de4f8d20681a78d93ec96fe23c26bfae84fb14db43b01e1e9056b8c49\",\n ],\n [\n \"62d14dab4150bf497402fdc45a215e10dcb01c354959b10cfe31c7e9d87ff33d\",\n \"80fc06bd8cc5b01098088a1950eed0db01aa132967ab472235f5642483b25eaf\",\n ],\n [\n \"80c60ad0040f27dade5b4b06c408e56b2c50e9f56b9b8b425e555c2f86308b6f\",\n \"1c38303f1cc5c30f26e66bad7fe72f70a65eed4cbe7024eb1aa01f56430bd57a\",\n ],\n [\n \"7a9375ad6167ad54aa74c6348cc54d344cc5dc9487d847049d5eabb0fa03c8fb\",\n \"d0e3fa9eca8726909559e0d79269046bdc59ea10c70ce2b02d499ec224dc7f7\",\n ],\n [\n \"d528ecd9b696b54c907a9ed045447a79bb408ec39b68df504bb51f459bc3ffc9\",\n \"eecf41253136e5f99966f21881fd656ebc4345405c520dbc063465b521409933\",\n ],\n [\n \"49370a4b5f43412ea25f514e8ecdad05266115e4a7ecb1387231808f8b45963\",\n \"758f3f41afd6ed428b3081b0512fd62a54c3f3afbb5b6764b653052a12949c9a\",\n ],\n [\n \"77f230936ee88cbbd73df930d64702ef881d811e0e1498e2f1c13eb1fc345d74\",\n \"958ef42a7886b6400a08266e9ba1b37896c95330d97077cbbe8eb3c7671c60d6\",\n ],\n [\n \"f2dac991cc4ce4b9ea44887e5c7c0bce58c80074ab9d4dbaeb28531b7739f530\",\n \"e0dedc9b3b2f8dad4da1f32dec2531df9eb5fbeb0598e4fd1a117dba703a3c37\",\n ],\n [\n \"463b3d9f662621fb1b4be8fbbe2520125a216cdfc9dae3debcba4850c690d45b\",\n \"5ed430d78c296c3543114306dd8622d7c622e27c970a1de31cb377b01af7307e\",\n ],\n [\n \"f16f804244e46e2a09232d4aff3b59976b98fac14328a2d1a32496b49998f247\",\n \"cedabd9b82203f7e13d206fcdf4e33d92a6c53c26e5cce26d6579962c4e31df6\",\n ],\n [\n \"caf754272dc84563b0352b7a14311af55d245315ace27c65369e15f7151d41d1\",\n \"cb474660ef35f5f2a41b643fa5e460575f4fa9b7962232a5c32f908318a04476\",\n ],\n [\n \"2600ca4b282cb986f85d0f1709979d8b44a09c07cb86d7c124497bc86f082120\",\n \"4119b88753c15bd6a693b03fcddbb45d5ac6be74ab5f0ef44b0be9475a7e4b40\",\n ],\n [\n \"7635ca72d7e8432c338ec53cd12220bc01c48685e24f7dc8c602a7746998e435\",\n \"91b649609489d613d1d5e590f78e6d74ecfc061d57048bad9e76f302c5b9c61\",\n ],\n [\n \"754e3239f325570cdbbf4a87deee8a66b7f2b33479d468fbc1a50743bf56cc18\",\n \"673fb86e5bda30fb3cd0ed304ea49a023ee33d0197a695d0c5d98093c536683\",\n ],\n [\n \"e3e6bd1071a1e96aff57859c82d570f0330800661d1c952f9fe2694691d9b9e8\",\n \"59c9e0bba394e76f40c0aa58379a3cb6a5a2283993e90c4167002af4920e37f5\",\n ],\n [\n \"186b483d056a033826ae73d88f732985c4ccb1f32ba35f4b4cc47fdcf04aa6eb\",\n \"3b952d32c67cf77e2e17446e204180ab21fb8090895138b4a4a797f86e80888b\",\n ],\n [\n \"df9d70a6b9876ce544c98561f4be4f725442e6d2b737d9c91a8321724ce0963f\",\n \"55eb2dafd84d6ccd5f862b785dc39d4ab157222720ef9da217b8c45cf2ba2417\",\n ],\n [\n \"5edd5cc23c51e87a497ca815d5dce0f8ab52554f849ed8995de64c5f34ce7143\",\n \"efae9c8dbc14130661e8cec030c89ad0c13c66c0d17a2905cdc706ab7399a868\",\n ],\n [\n \"290798c2b6476830da12fe02287e9e777aa3fba1c355b17a722d362f84614fba\",\n \"e38da76dcd440621988d00bcf79af25d5b29c094db2a23146d003afd41943e7a\",\n ],\n [\n \"af3c423a95d9f5b3054754efa150ac39cd29552fe360257362dfdecef4053b45\",\n \"f98a3fd831eb2b749a93b0e6f35cfb40c8cd5aa667a15581bc2feded498fd9c6\",\n ],\n [\n \"766dbb24d134e745cccaa28c99bf274906bb66b26dcf98df8d2fed50d884249a\",\n \"744b1152eacbe5e38dcc887980da38b897584a65fa06cedd2c924f97cbac5996\",\n ],\n [\n \"59dbf46f8c94759ba21277c33784f41645f7b44f6c596a58ce92e666191abe3e\",\n \"c534ad44175fbc300f4ea6ce648309a042ce739a7919798cd85e216c4a307f6e\",\n ],\n [\n \"f13ada95103c4537305e691e74e9a4a8dd647e711a95e73cb62dc6018cfd87b8\",\n \"e13817b44ee14de663bf4bc808341f326949e21a6a75c2570778419bdaf5733d\",\n ],\n [\n \"7754b4fa0e8aced06d4167a2c59cca4cda1869c06ebadfb6488550015a88522c\",\n \"30e93e864e669d82224b967c3020b8fa8d1e4e350b6cbcc537a48b57841163a2\",\n ],\n [\n \"948dcadf5990e048aa3874d46abef9d701858f95de8041d2a6828c99e2262519\",\n \"e491a42537f6e597d5d28a3224b1bc25df9154efbd2ef1d2cbba2cae5347d57e\",\n ],\n [\n \"7962414450c76c1689c7b48f8202ec37fb224cf5ac0bfa1570328a8a3d7c77ab\",\n \"100b610ec4ffb4760d5c1fc133ef6f6b12507a051f04ac5760afa5b29db83437\",\n ],\n [\n \"3514087834964b54b15b160644d915485a16977225b8847bb0dd085137ec47ca\",\n \"ef0afbb2056205448e1652c48e8127fc6039e77c15c2378b7e7d15a0de293311\",\n ],\n [\n \"d3cc30ad6b483e4bc79ce2c9dd8bc54993e947eb8df787b442943d3f7b527eaf\",\n \"8b378a22d827278d89c5e9be8f9508ae3c2ad46290358630afb34db04eede0a4\",\n ],\n [\n \"1624d84780732860ce1c78fcbfefe08b2b29823db913f6493975ba0ff4847610\",\n \"68651cf9b6da903e0914448c6cd9d4ca896878f5282be4c8cc06e2a404078575\",\n ],\n [\n \"733ce80da955a8a26902c95633e62a985192474b5af207da6df7b4fd5fc61cd4\",\n \"f5435a2bd2badf7d485a4d8b8db9fcce3e1ef8e0201e4578c54673bc1dc5ea1d\",\n ],\n [\n \"15d9441254945064cf1a1c33bbd3b49f8966c5092171e699ef258dfab81c045c\",\n \"d56eb30b69463e7234f5137b73b84177434800bacebfc685fc37bbe9efe4070d\",\n ],\n [\n \"a1d0fcf2ec9de675b612136e5ce70d271c21417c9d2b8aaaac138599d0717940\",\n \"edd77f50bcb5a3cab2e90737309667f2641462a54070f3d519212d39c197a629\",\n ],\n [\n \"e22fbe15c0af8ccc5780c0735f84dbe9a790badee8245c06c7ca37331cb36980\",\n \"a855babad5cd60c88b430a69f53a1a7a38289154964799be43d06d77d31da06\",\n ],\n [\n \"311091dd9860e8e20ee13473c1155f5f69635e394704eaa74009452246cfa9b3\",\n \"66db656f87d1f04fffd1f04788c06830871ec5a64feee685bd80f0b1286d8374\",\n ],\n [\n \"34c1fd04d301be89b31c0442d3e6ac24883928b45a9340781867d4232ec2dbdf\",\n \"9414685e97b1b5954bd46f730174136d57f1ceeb487443dc5321857ba73abee\",\n ],\n [\n \"f219ea5d6b54701c1c14de5b557eb42a8d13f3abbcd08affcc2a5e6b049b8d63\",\n \"4cb95957e83d40b0f73af4544cccf6b1f4b08d3c07b27fb8d8c2962a400766d1\",\n ],\n [\n \"d7b8740f74a8fbaab1f683db8f45de26543a5490bca627087236912469a0b448\",\n \"fa77968128d9c92ee1010f337ad4717eff15db5ed3c049b3411e0315eaa4593b\",\n ],\n [\n \"32d31c222f8f6f0ef86f7c98d3a3335ead5bcd32abdd94289fe4d3091aa824bf\",\n \"5f3032f5892156e39ccd3d7915b9e1da2e6dac9e6f26e961118d14b8462e1661\",\n ],\n [\n \"7461f371914ab32671045a155d9831ea8793d77cd59592c4340f86cbc18347b5\",\n \"8ec0ba238b96bec0cbdddcae0aa442542eee1ff50c986ea6b39847b3cc092ff6\",\n ],\n [\n \"ee079adb1df1860074356a25aa38206a6d716b2c3e67453d287698bad7b2b2d6\",\n \"8dc2412aafe3be5c4c5f37e0ecc5f9f6a446989af04c4e25ebaac479ec1c8c1e\",\n ],\n [\n \"16ec93e447ec83f0467b18302ee620f7e65de331874c9dc72bfd8616ba9da6b5\",\n \"5e4631150e62fb40d0e8c2a7ca5804a39d58186a50e497139626778e25b0674d\",\n ],\n [\n \"eaa5f980c245f6f038978290afa70b6bd8855897f98b6aa485b96065d537bd99\",\n \"f65f5d3e292c2e0819a528391c994624d784869d7e6ea67fb18041024edc07dc\",\n ],\n [\n \"78c9407544ac132692ee1910a02439958ae04877151342ea96c4b6b35a49f51\",\n \"f3e0319169eb9b85d5404795539a5e68fa1fbd583c064d2462b675f194a3ddb4\",\n ],\n [\n \"494f4be219a1a77016dcd838431aea0001cdc8ae7a6fc688726578d9702857a5\",\n \"42242a969283a5f339ba7f075e36ba2af925ce30d767ed6e55f4b031880d562c\",\n ],\n [\n \"a598a8030da6d86c6bc7f2f5144ea549d28211ea58faa70ebf4c1e665c1fe9b5\",\n \"204b5d6f84822c307e4b4a7140737aec23fc63b65b35f86a10026dbd2d864e6b\",\n ],\n [\n \"c41916365abb2b5d09192f5f2dbeafec208f020f12570a184dbadc3e58595997\",\n \"4f14351d0087efa49d245b328984989d5caf9450f34bfc0ed16e96b58fa9913\",\n ],\n [\n \"841d6063a586fa475a724604da03bc5b92a2e0d2e0a36acfe4c73a5514742881\",\n \"73867f59c0659e81904f9a1c7543698e62562d6744c169ce7a36de01a8d6154\",\n ],\n [\n \"5e95bb399a6971d376026947f89bde2f282b33810928be4ded112ac4d70e20d5\",\n \"39f23f366809085beebfc71181313775a99c9aed7d8ba38b161384c746012865\",\n ],\n [\n \"36e4641a53948fd476c39f8a99fd974e5ec07564b5315d8bf99471bca0ef2f66\",\n \"d2424b1b1abe4eb8164227b085c9aa9456ea13493fd563e06fd51cf5694c78fc\",\n ],\n [\n \"336581ea7bfbbb290c191a2f507a41cf5643842170e914faeab27c2c579f726\",\n \"ead12168595fe1be99252129b6e56b3391f7ab1410cd1e0ef3dcdcabd2fda224\",\n ],\n [\n \"8ab89816dadfd6b6a1f2634fcf00ec8403781025ed6890c4849742706bd43ede\",\n \"6fdcef09f2f6d0a044e654aef624136f503d459c3e89845858a47a9129cdd24e\",\n ],\n [\n \"1e33f1a746c9c5778133344d9299fcaa20b0938e8acff2544bb40284b8c5fb94\",\n \"60660257dd11b3aa9c8ed618d24edff2306d320f1d03010e33a7d2057f3b3b6\",\n ],\n [\n \"85b7c1dcb3cec1b7ee7f30ded79dd20a0ed1f4cc18cbcfcfa410361fd8f08f31\",\n \"3d98a9cdd026dd43f39048f25a8847f4fcafad1895d7a633c6fed3c35e999511\",\n ],\n [\n \"29df9fbd8d9e46509275f4b125d6d45d7fbe9a3b878a7af872a2800661ac5f51\",\n \"b4c4fe99c775a606e2d8862179139ffda61dc861c019e55cd2876eb2a27d84b\",\n ],\n [\n \"a0b1cae06b0a847a3fea6e671aaf8adfdfe58ca2f768105c8082b2e449fce252\",\n \"ae434102edde0958ec4b19d917a6a28e6b72da1834aff0e650f049503a296cf2\",\n ],\n [\n \"4e8ceafb9b3e9a136dc7ff67e840295b499dfb3b2133e4ba113f2e4c0e121e5\",\n \"cf2174118c8b6d7a4b48f6d534ce5c79422c086a63460502b827ce62a326683c\",\n ],\n [\n \"d24a44e047e19b6f5afb81c7ca2f69080a5076689a010919f42725c2b789a33b\",\n \"6fb8d5591b466f8fc63db50f1c0f1c69013f996887b8244d2cdec417afea8fa3\",\n ],\n [\n \"ea01606a7a6c9cdd249fdfcfacb99584001edd28abbab77b5104e98e8e3b35d4\",\n \"322af4908c7312b0cfbfe369f7a7b3cdb7d4494bc2823700cfd652188a3ea98d\",\n ],\n [\n \"af8addbf2b661c8a6c6328655eb96651252007d8c5ea31be4ad196de8ce2131f\",\n \"6749e67c029b85f52a034eafd096836b2520818680e26ac8f3dfbcdb71749700\",\n ],\n [\n \"e3ae1974566ca06cc516d47e0fb165a674a3dabcfca15e722f0e3450f45889\",\n \"2aeabe7e4531510116217f07bf4d07300de97e4874f81f533420a72eeb0bd6a4\",\n ],\n [\n \"591ee355313d99721cf6993ffed1e3e301993ff3ed258802075ea8ced397e246\",\n \"b0ea558a113c30bea60fc4775460c7901ff0b053d25ca2bdeee98f1a4be5d196\",\n ],\n [\n \"11396d55fda54c49f19aa97318d8da61fa8584e47b084945077cf03255b52984\",\n \"998c74a8cd45ac01289d5833a7beb4744ff536b01b257be4c5767bea93ea57a4\",\n ],\n [\n \"3c5d2a1ba39c5a1790000738c9e0c40b8dcdfd5468754b6405540157e017aa7a\",\n \"b2284279995a34e2f9d4de7396fc18b80f9b8b9fdd270f6661f79ca4c81bd257\",\n ],\n [\n \"cc8704b8a60a0defa3a99a7299f2e9c3fbc395afb04ac078425ef8a1793cc030\",\n \"bdd46039feed17881d1e0862db347f8cf395b74fc4bcdc4e940b74e3ac1f1b13\",\n ],\n [\n \"c533e4f7ea8555aacd9777ac5cad29b97dd4defccc53ee7ea204119b2889b197\",\n \"6f0a256bc5efdf429a2fb6242f1a43a2d9b925bb4a4b3a26bb8e0f45eb596096\",\n ],\n [\n \"c14f8f2ccb27d6f109f6d08d03cc96a69ba8c34eec07bbcf566d48e33da6593\",\n \"c359d6923bb398f7fd4473e16fe1c28475b740dd098075e6c0e8649113dc3a38\",\n ],\n [\n \"a6cbc3046bc6a450bac24789fa17115a4c9739ed75f8f21ce441f72e0b90e6ef\",\n \"21ae7f4680e889bb130619e2c0f95a360ceb573c70603139862afd617fa9b9f\",\n ],\n [\n \"347d6d9a02c48927ebfb86c1359b1caf130a3c0267d11ce6344b39f99d43cc38\",\n \"60ea7f61a353524d1c987f6ecec92f086d565ab687870cb12689ff1e31c74448\",\n ],\n [\n \"da6545d2181db8d983f7dcb375ef5866d47c67b1bf31c8cf855ef7437b72656a\",\n \"49b96715ab6878a79e78f07ce5680c5d6673051b4935bd897fea824b77dc208a\",\n ],\n [\n \"c40747cc9d012cb1a13b8148309c6de7ec25d6945d657146b9d5994b8feb1111\",\n \"5ca560753be2a12fc6de6caf2cb489565db936156b9514e1bb5e83037e0fa2d4\",\n ],\n [\n \"4e42c8ec82c99798ccf3a610be870e78338c7f713348bd34c8203ef4037f3502\",\n \"7571d74ee5e0fb92a7a8b33a07783341a5492144cc54bcc40a94473693606437\",\n ],\n [\n \"3775ab7089bc6af823aba2e1af70b236d251cadb0c86743287522a1b3b0dedea\",\n \"be52d107bcfa09d8bcb9736a828cfa7fac8db17bf7a76a2c42ad961409018cf7\",\n ],\n [\n \"cee31cbf7e34ec379d94fb814d3d775ad954595d1314ba8846959e3e82f74e26\",\n \"8fd64a14c06b589c26b947ae2bcf6bfa0149ef0be14ed4d80f448a01c43b1c6d\",\n ],\n [\n \"b4f9eaea09b6917619f6ea6a4eb5464efddb58fd45b1ebefcdc1a01d08b47986\",\n \"39e5c9925b5a54b07433a4f18c61726f8bb131c012ca542eb24a8ac07200682a\",\n ],\n [\n \"d4263dfc3d2df923a0179a48966d30ce84e2515afc3dccc1b77907792ebcc60e\",\n \"62dfaf07a0f78feb30e30d6295853ce189e127760ad6cf7fae164e122a208d54\",\n ],\n [\n \"48457524820fa65a4f8d35eb6930857c0032acc0a4a2de422233eeda897612c4\",\n \"25a748ab367979d98733c38a1fa1c2e7dc6cc07db2d60a9ae7a76aaa49bd0f77\",\n ],\n [\n \"dfeeef1881101f2cb11644f3a2afdfc2045e19919152923f367a1767c11cceda\",\n \"ecfb7056cf1de042f9420bab396793c0c390bde74b4bbdff16a83ae09a9a7517\",\n ],\n [\n \"6d7ef6b17543f8373c573f44e1f389835d89bcbc6062ced36c82df83b8fae859\",\n \"cd450ec335438986dfefa10c57fea9bcc521a0959b2d80bbf74b190dca712d10\",\n ],\n [\n \"e75605d59102a5a2684500d3b991f2e3f3c88b93225547035af25af66e04541f\",\n \"f5c54754a8f71ee540b9b48728473e314f729ac5308b06938360990e2bfad125\",\n ],\n [\n \"eb98660f4c4dfaa06a2be453d5020bc99a0c2e60abe388457dd43fefb1ed620c\",\n \"6cb9a8876d9cb8520609af3add26cd20a0a7cd8a9411131ce85f44100099223e\",\n ],\n [\n \"13e87b027d8514d35939f2e6892b19922154596941888336dc3563e3b8dba942\",\n \"fef5a3c68059a6dec5d624114bf1e91aac2b9da568d6abeb2570d55646b8adf1\",\n ],\n [\n \"ee163026e9fd6fe017c38f06a5be6fc125424b371ce2708e7bf4491691e5764a\",\n \"1acb250f255dd61c43d94ccc670d0f58f49ae3fa15b96623e5430da0ad6c62b2\",\n ],\n [\n \"b268f5ef9ad51e4d78de3a750c2dc89b1e626d43505867999932e5db33af3d80\",\n \"5f310d4b3c99b9ebb19f77d41c1dee018cf0d34fd4191614003e945a1216e423\",\n ],\n [\n \"ff07f3118a9df035e9fad85eb6c7bfe42b02f01ca99ceea3bf7ffdba93c4750d\",\n \"438136d603e858a3a5c440c38eccbaddc1d2942114e2eddd4740d098ced1f0d8\",\n ],\n [\n \"8d8b9855c7c052a34146fd20ffb658bea4b9f69e0d825ebec16e8c3ce2b526a1\",\n \"cdb559eedc2d79f926baf44fb84ea4d44bcf50fee51d7ceb30e2e7f463036758\",\n ],\n [\n \"52db0b5384dfbf05bfa9d472d7ae26dfe4b851ceca91b1eba54263180da32b63\",\n \"c3b997d050ee5d423ebaf66a6db9f57b3180c902875679de924b69d84a7b375\",\n ],\n [\n \"e62f9490d3d51da6395efd24e80919cc7d0f29c3f3fa48c6fff543becbd43352\",\n \"6d89ad7ba4876b0b22c2ca280c682862f342c8591f1daf5170e07bfd9ccafa7d\",\n ],\n [\n \"7f30ea2476b399b4957509c88f77d0191afa2ff5cb7b14fd6d8e7d65aaab1193\",\n \"ca5ef7d4b231c94c3b15389a5f6311e9daff7bb67b103e9880ef4bff637acaec\",\n ],\n [\n \"5098ff1e1d9f14fb46a210fada6c903fef0fb7b4a1dd1d9ac60a0361800b7a00\",\n \"9731141d81fc8f8084d37c6e7542006b3ee1b40d60dfe5362a5b132fd17ddc0\",\n ],\n [\n \"32b78c7de9ee512a72895be6b9cbefa6e2f3c4ccce445c96b9f2c81e2778ad58\",\n \"ee1849f513df71e32efc3896ee28260c73bb80547ae2275ba497237794c8753c\",\n ],\n [\n \"e2cb74fddc8e9fbcd076eef2a7c72b0ce37d50f08269dfc074b581550547a4f7\",\n \"d3aa2ed71c9dd2247a62df062736eb0baddea9e36122d2be8641abcb005cc4a4\",\n ],\n [\n \"8438447566d4d7bedadc299496ab357426009a35f235cb141be0d99cd10ae3a8\",\n \"c4e1020916980a4da5d01ac5e6ad330734ef0d7906631c4f2390426b2edd791f\",\n ],\n [\n \"4162d488b89402039b584c6fc6c308870587d9c46f660b878ab65c82c711d67e\",\n \"67163e903236289f776f22c25fb8a3afc1732f2b84b4e95dbda47ae5a0852649\",\n ],\n [\n \"3fad3fa84caf0f34f0f89bfd2dcf54fc175d767aec3e50684f3ba4a4bf5f683d\",\n \"cd1bc7cb6cc407bb2f0ca647c718a730cf71872e7d0d2a53fa20efcdfe61826\",\n ],\n [\n \"674f2600a3007a00568c1a7ce05d0816c1fb84bf1370798f1c69532faeb1a86b\",\n \"299d21f9413f33b3edf43b257004580b70db57da0b182259e09eecc69e0d38a5\",\n ],\n [\n \"d32f4da54ade74abb81b815ad1fb3b263d82d6c692714bcff87d29bd5ee9f08f\",\n \"f9429e738b8e53b968e99016c059707782e14f4535359d582fc416910b3eea87\",\n ],\n [\n \"30e4e670435385556e593657135845d36fbb6931f72b08cb1ed954f1e3ce3ff6\",\n \"462f9bce619898638499350113bbc9b10a878d35da70740dc695a559eb88db7b\",\n ],\n [\n \"be2062003c51cc3004682904330e4dee7f3dcd10b01e580bf1971b04d4cad297\",\n \"62188bc49d61e5428573d48a74e1c655b1c61090905682a0d5558ed72dccb9bc\",\n ],\n [\n \"93144423ace3451ed29e0fb9ac2af211cb6e84a601df5993c419859fff5df04a\",\n \"7c10dfb164c3425f5c71a3f9d7992038f1065224f72bb9d1d902a6d13037b47c\",\n ],\n [\n \"b015f8044f5fcbdcf21ca26d6c34fb8197829205c7b7d2a7cb66418c157b112c\",\n \"ab8c1e086d04e813744a655b2df8d5f83b3cdc6faa3088c1d3aea1454e3a1d5f\",\n ],\n [\n \"d5e9e1da649d97d89e4868117a465a3a4f8a18de57a140d36b3f2af341a21b52\",\n \"4cb04437f391ed73111a13cc1d4dd0db1693465c2240480d8955e8592f27447a\",\n ],\n [\n \"d3ae41047dd7ca065dbf8ed77b992439983005cd72e16d6f996a5316d36966bb\",\n \"bd1aeb21ad22ebb22a10f0303417c6d964f8cdd7df0aca614b10dc14d125ac46\",\n ],\n [\n \"463e2763d885f958fc66cdd22800f0a487197d0a82e377b49f80af87c897b065\",\n \"bfefacdb0e5d0fd7df3a311a94de062b26b80c61fbc97508b79992671ef7ca7f\",\n ],\n [\n \"7985fdfd127c0567c6f53ec1bb63ec3158e597c40bfe747c83cddfc910641917\",\n \"603c12daf3d9862ef2b25fe1de289aed24ed291e0ec6708703a5bd567f32ed03\",\n ],\n [\n \"74a1ad6b5f76e39db2dd249410eac7f99e74c59cb83d2d0ed5ff1543da7703e9\",\n \"cc6157ef18c9c63cd6193d83631bbea0093e0968942e8c33d5737fd790e0db08\",\n ],\n [\n \"30682a50703375f602d416664ba19b7fc9bab42c72747463a71d0896b22f6da3\",\n \"553e04f6b018b4fa6c8f39e7f311d3176290d0e0f19ca73f17714d9977a22ff8\",\n ],\n [\n \"9e2158f0d7c0d5f26c3791efefa79597654e7a2b2464f52b1ee6c1347769ef57\",\n \"712fcdd1b9053f09003a3481fa7762e9ffd7c8ef35a38509e2fbf2629008373\",\n ],\n [\n \"176e26989a43c9cfeba4029c202538c28172e566e3c4fce7322857f3be327d66\",\n \"ed8cc9d04b29eb877d270b4878dc43c19aefd31f4eee09ee7b47834c1fa4b1c3\",\n ],\n [\n \"75d46efea3771e6e68abb89a13ad747ecf1892393dfc4f1b7004788c50374da8\",\n \"9852390a99507679fd0b86fd2b39a868d7efc22151346e1a3ca4726586a6bed8\",\n ],\n [\n \"809a20c67d64900ffb698c4c825f6d5f2310fb0451c869345b7319f645605721\",\n \"9e994980d9917e22b76b061927fa04143d096ccc54963e6a5ebfa5f3f8e286c1\",\n ],\n [\n \"1b38903a43f7f114ed4500b4eac7083fdefece1cf29c63528d563446f972c180\",\n \"4036edc931a60ae889353f77fd53de4a2708b26b6f5da72ad3394119daf408f9\",\n ],\n ],\n },\n };\n },\n});\n\n// node_modules/elliptic/lib/elliptic/curves.js\nvar require_curves = __commonJS({\n \"node_modules/elliptic/lib/elliptic/curves.js\"(exports) {\n \"use strict\";\n var curves = exports,\n hash = require_hash2(),\n curve = require_curve(),\n utils = require_utils3(),\n assert = utils.assert;\n function PresetCurve(options) {\n options.type === \"short\"\n ? (this.curve = new curve.short(options))\n : options.type === \"edwards\"\n ? (this.curve = new curve.edwards(options))\n : (this.curve = new curve.mont(options)),\n (this.g = this.curve.g),\n (this.n = this.curve.n),\n (this.hash = options.hash),\n assert(this.g.validate(), \"Invalid curve\"),\n assert(this.g.mul(this.n).isInfinity(), \"Invalid curve, G*N != O\");\n }\n curves.PresetCurve = PresetCurve;\n function defineCurve(name, options) {\n Object.defineProperty(curves, name, {\n configurable: !0,\n enumerable: !0,\n get: function () {\n var curve2 = new PresetCurve(options);\n return (\n Object.defineProperty(curves, name, {\n configurable: !0,\n enumerable: !0,\n value: curve2,\n }),\n curve2\n );\n },\n });\n }\n defineCurve(\"p192\", {\n type: \"short\",\n prime: \"p192\",\n p: \"ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff\",\n a: \"ffffffff ffffffff ffffffff fffffffe ffffffff fffffffc\",\n b: \"64210519 e59c80e7 0fa7e9ab 72243049 feb8deec c146b9b1\",\n n: \"ffffffff ffffffff ffffffff 99def836 146bc9b1 b4d22831\",\n hash: hash.sha256,\n gRed: !1,\n g: [\n \"188da80e b03090f6 7cbf20eb 43a18800 f4ff0afd 82ff1012\",\n \"07192b95 ffc8da78 631011ed 6b24cdd5 73f977a1 1e794811\",\n ],\n });\n defineCurve(\"p224\", {\n type: \"short\",\n prime: \"p224\",\n p: \"ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001\",\n a: \"ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff fffffffe\",\n b: \"b4050a85 0c04b3ab f5413256 5044b0b7 d7bfd8ba 270b3943 2355ffb4\",\n n: \"ffffffff ffffffff ffffffff ffff16a2 e0b8f03e 13dd2945 5c5c2a3d\",\n hash: hash.sha256,\n gRed: !1,\n g: [\n \"b70e0cbd 6bb4bf7f 321390b9 4a03c1d3 56c21122 343280d6 115c1d21\",\n \"bd376388 b5f723fb 4c22dfe6 cd4375a0 5a074764 44d58199 85007e34\",\n ],\n });\n defineCurve(\"p256\", {\n type: \"short\",\n prime: null,\n p: \"ffffffff 00000001 00000000 00000000 00000000 ffffffff ffffffff ffffffff\",\n a: \"ffffffff 00000001 00000000 00000000 00000000 ffffffff ffffffff fffffffc\",\n b: \"5ac635d8 aa3a93e7 b3ebbd55 769886bc 651d06b0 cc53b0f6 3bce3c3e 27d2604b\",\n n: \"ffffffff 00000000 ffffffff ffffffff bce6faad a7179e84 f3b9cac2 fc632551\",\n hash: hash.sha256,\n gRed: !1,\n g: [\n \"6b17d1f2 e12c4247 f8bce6e5 63a440f2 77037d81 2deb33a0 f4a13945 d898c296\",\n \"4fe342e2 fe1a7f9b 8ee7eb4a 7c0f9e16 2bce3357 6b315ece cbb64068 37bf51f5\",\n ],\n });\n defineCurve(\"p384\", {\n type: \"short\",\n prime: null,\n p: \"ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe ffffffff 00000000 00000000 ffffffff\",\n a: \"ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe ffffffff 00000000 00000000 fffffffc\",\n b: \"b3312fa7 e23ee7e4 988e056b e3f82d19 181d9c6e fe814112 0314088f 5013875a c656398d 8a2ed19d 2a85c8ed d3ec2aef\",\n n: \"ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff c7634d81 f4372ddf 581a0db2 48b0a77a ecec196a ccc52973\",\n hash: hash.sha384,\n gRed: !1,\n g: [\n \"aa87ca22 be8b0537 8eb1c71e f320ad74 6e1d3b62 8ba79b98 59f741e0 82542a38 5502f25d bf55296c 3a545e38 72760ab7\",\n \"3617de4a 96262c6f 5d9e98bf 9292dc29 f8f41dbd 289a147c e9da3113 b5f0b8c0 0a60b1ce 1d7e819d 7a431d7c 90ea0e5f\",\n ],\n });\n defineCurve(\"p521\", {\n type: \"short\",\n prime: null,\n p: \"000001ff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff\",\n a: \"000001ff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffc\",\n b: \"00000051 953eb961 8e1c9a1f 929a21a0 b68540ee a2da725b 99b315f3 b8b48991 8ef109e1 56193951 ec7e937b 1652c0bd 3bb1bf07 3573df88 3d2c34f1 ef451fd4 6b503f00\",\n n: \"000001ff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffa 51868783 bf2f966b 7fcc0148 f709a5d0 3bb5c9b8 899c47ae bb6fb71e 91386409\",\n hash: hash.sha512,\n gRed: !1,\n g: [\n \"000000c6 858e06b7 0404e9cd 9e3ecb66 2395b442 9c648139 053fb521 f828af60 6b4d3dba a14b5e77 efe75928 fe1dc127 a2ffa8de 3348b3c1 856a429b f97e7e31 c2e5bd66\",\n \"00000118 39296a78 9a3bc004 5c8a5fb4 2c7d1bd9 98f54449 579b4468 17afbd17 273e662c 97ee7299 5ef42640 c550b901 3fad0761 353c7086 a272c240 88be9476 9fd16650\",\n ],\n });\n defineCurve(\"curve25519\", {\n type: \"mont\",\n prime: \"p25519\",\n p: \"7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed\",\n a: \"76d06\",\n b: \"1\",\n n: \"1000000000000000 0000000000000000 14def9dea2f79cd6 5812631a5cf5d3ed\",\n hash: hash.sha256,\n gRed: !1,\n g: [\"9\"],\n });\n defineCurve(\"ed25519\", {\n type: \"edwards\",\n prime: \"p25519\",\n p: \"7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed\",\n a: \"-1\",\n c: \"1\",\n d: \"52036cee2b6ffe73 8cc740797779e898 00700a4d4141d8ab 75eb4dca135978a3\",\n n: \"1000000000000000 0000000000000000 14def9dea2f79cd6 5812631a5cf5d3ed\",\n hash: hash.sha256,\n gRed: !1,\n g: [\n \"216936d3cd6e53fec0a4e231fdd6dc5c692cc7609525a7b2c9562d608f25d51a\",\n \"6666666666666666666666666666666666666666666666666666666666666658\",\n ],\n });\n var pre;\n try {\n pre = require_secp256k1();\n } catch {\n pre = void 0;\n }\n defineCurve(\"secp256k1\", {\n type: \"short\",\n prime: \"k256\",\n p: \"ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f\",\n a: \"0\",\n b: \"7\",\n n: \"ffffffff ffffffff ffffffff fffffffe baaedce6 af48a03b bfd25e8c d0364141\",\n h: \"1\",\n hash: hash.sha256,\n beta: \"7ae96a2b657c07106e64479eac3434e99cf0497512f58995c1396c28719501ee\",\n lambda: \"5363ad4cc05c30e0a5261c028812645a122e22ea20816678df02967c1b23bd72\",\n basis: [\n {\n a: \"3086d221a7d46bcde86c90e49284eb15\",\n b: \"-e4437ed6010e88286f547fa90abfe4c3\",\n },\n {\n a: \"114ca50f7a8e2f3f657c1108d9d44cfd8\",\n b: \"3086d221a7d46bcde86c90e49284eb15\",\n },\n ],\n gRed: !1,\n g: [\n \"79be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798\",\n \"483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8\",\n pre,\n ],\n });\n },\n});\n\n// node_modules/hmac-drbg/lib/hmac-drbg.js\nvar require_hmac_drbg = __commonJS({\n \"node_modules/hmac-drbg/lib/hmac-drbg.js\"(exports, module) {\n \"use strict\";\n var hash = require_hash2(),\n utils = require_utils2(),\n assert = require_minimalistic_assert();\n function HmacDRBG(options) {\n if (!(this instanceof HmacDRBG)) return new HmacDRBG(options);\n (this.hash = options.hash),\n (this.predResist = !!options.predResist),\n (this.outLen = this.hash.outSize),\n (this.minEntropy = options.minEntropy || this.hash.hmacStrength),\n (this._reseed = null),\n (this.reseedInterval = null),\n (this.K = null),\n (this.V = null);\n var entropy = utils.toArray(options.entropy, options.entropyEnc || \"hex\"),\n nonce = utils.toArray(options.nonce, options.nonceEnc || \"hex\"),\n pers = utils.toArray(options.pers, options.persEnc || \"hex\");\n assert(entropy.length >= this.minEntropy / 8, \"Not enough entropy. Minimum is: \" + this.minEntropy + \" bits\"),\n this._init(entropy, nonce, pers);\n }\n module.exports = HmacDRBG;\n HmacDRBG.prototype._init = function (entropy, nonce, pers) {\n var seed = entropy.concat(nonce).concat(pers);\n (this.K = new Array(this.outLen / 8)), (this.V = new Array(this.outLen / 8));\n for (var i = 0; i < this.V.length; i++) (this.K[i] = 0), (this.V[i] = 1);\n this._update(seed), (this._reseed = 1), (this.reseedInterval = 281474976710656);\n };\n HmacDRBG.prototype._hmac = function () {\n return new hash.hmac(this.hash, this.K);\n };\n HmacDRBG.prototype._update = function (seed) {\n var kmac = this._hmac().update(this.V).update([0]);\n seed && (kmac = kmac.update(seed)),\n (this.K = kmac.digest()),\n (this.V = this._hmac().update(this.V).digest()),\n seed &&\n ((this.K = this._hmac().update(this.V).update([1]).update(seed).digest()),\n (this.V = this._hmac().update(this.V).digest()));\n };\n HmacDRBG.prototype.reseed = function (entropy, entropyEnc, add, addEnc) {\n typeof entropyEnc != \"string\" && ((addEnc = add), (add = entropyEnc), (entropyEnc = null)),\n (entropy = utils.toArray(entropy, entropyEnc)),\n (add = utils.toArray(add, addEnc)),\n assert(entropy.length >= this.minEntropy / 8, \"Not enough entropy. Minimum is: \" + this.minEntropy + \" bits\"),\n this._update(entropy.concat(add || [])),\n (this._reseed = 1);\n };\n HmacDRBG.prototype.generate = function (len, enc, add, addEnc) {\n if (this._reseed > this.reseedInterval) throw new Error(\"Reseed is required\");\n typeof enc != \"string\" && ((addEnc = add), (add = enc), (enc = null)),\n add && ((add = utils.toArray(add, addEnc || \"hex\")), this._update(add));\n for (var temp = []; temp.length < len; )\n (this.V = this._hmac().update(this.V).digest()), (temp = temp.concat(this.V));\n var res = temp.slice(0, len);\n return this._update(add), this._reseed++, utils.encode(res, enc);\n };\n },\n});\n\n// node_modules/elliptic/lib/elliptic/ec/key.js\nvar require_key = __commonJS({\n \"node_modules/elliptic/lib/elliptic/ec/key.js\"(exports, module) {\n \"use strict\";\n var BN = require_bn4(),\n utils = require_utils3(),\n assert = utils.assert;\n function KeyPair(ec, options) {\n (this.ec = ec),\n (this.priv = null),\n (this.pub = null),\n options.priv && this._importPrivate(options.priv, options.privEnc),\n options.pub && this._importPublic(options.pub, options.pubEnc);\n }\n module.exports = KeyPair;\n KeyPair.fromPublic = function (ec, pub, enc) {\n return pub instanceof KeyPair\n ? pub\n : new KeyPair(ec, {\n pub,\n pubEnc: enc,\n });\n };\n KeyPair.fromPrivate = function (ec, priv, enc) {\n return priv instanceof KeyPair\n ? priv\n : new KeyPair(ec, {\n priv,\n privEnc: enc,\n });\n };\n KeyPair.prototype.validate = function () {\n var pub = this.getPublic();\n return pub.isInfinity()\n ? { result: !1, reason: \"Invalid public key\" }\n : pub.validate()\n ? pub.mul(this.ec.curve.n).isInfinity()\n ? { result: !0, reason: null }\n : { result: !1, reason: \"Public key * N != O\" }\n : { result: !1, reason: \"Public key is not a point\" };\n };\n KeyPair.prototype.getPublic = function (compact, enc) {\n return (\n typeof compact == \"string\" && ((enc = compact), (compact = null)),\n this.pub || (this.pub = this.ec.g.mul(this.priv)),\n enc ? this.pub.encode(enc, compact) : this.pub\n );\n };\n KeyPair.prototype.getPrivate = function (enc) {\n return enc === \"hex\" ? this.priv.toString(16, 2) : this.priv;\n };\n KeyPair.prototype._importPrivate = function (key, enc) {\n (this.priv = new BN(key, enc || 16)), (this.priv = this.priv.umod(this.ec.curve.n));\n };\n KeyPair.prototype._importPublic = function (key, enc) {\n if (key.x || key.y) {\n this.ec.curve.type === \"mont\"\n ? assert(key.x, \"Need x coordinate\")\n : (this.ec.curve.type === \"short\" || this.ec.curve.type === \"edwards\") &&\n assert(key.x && key.y, \"Need both x and y coordinate\"),\n (this.pub = this.ec.curve.point(key.x, key.y));\n return;\n }\n this.pub = this.ec.curve.decodePoint(key, enc);\n };\n KeyPair.prototype.derive = function (pub) {\n return pub.validate() || assert(pub.validate(), \"public point not validated\"), pub.mul(this.priv).getX();\n };\n KeyPair.prototype.sign = function (msg, enc, options) {\n return this.ec.sign(msg, this, enc, options);\n };\n KeyPair.prototype.verify = function (msg, signature) {\n return this.ec.verify(msg, signature, this);\n };\n KeyPair.prototype.inspect = function () {\n return (\n \"<Key priv: \" + (this.priv && this.priv.toString(16, 2)) + \" pub: \" + (this.pub && this.pub.inspect()) + \" >\"\n );\n };\n },\n});\n\n// node_modules/elliptic/lib/elliptic/ec/signature.js\nvar require_signature = __commonJS({\n \"node_modules/elliptic/lib/elliptic/ec/signature.js\"(exports, module) {\n \"use strict\";\n var BN = require_bn4(),\n utils = require_utils3(),\n assert = utils.assert;\n function Signature(options, enc) {\n if (options instanceof Signature) return options;\n this._importDER(options, enc) ||\n (assert(options.r && options.s, \"Signature without r or s\"),\n (this.r = new BN(options.r, 16)),\n (this.s = new BN(options.s, 16)),\n options.recoveryParam === void 0 ? (this.recoveryParam = null) : (this.recoveryParam = options.recoveryParam));\n }\n module.exports = Signature;\n function Position() {\n this.place = 0;\n }\n function getLength(buf, p) {\n var initial = buf[p.place++];\n if (!(initial & 128)) return initial;\n var octetLen = initial & 15;\n if (octetLen === 0 || octetLen > 4) return !1;\n for (var val = 0, i = 0, off = p.place; i < octetLen; i++, off++) (val <<= 8), (val |= buf[off]), (val >>>= 0);\n return val <= 127 ? !1 : ((p.place = off), val);\n }\n function rmPadding(buf) {\n for (var i = 0, len = buf.length - 1; !buf[i] && !(buf[i + 1] & 128) && i < len; ) i++;\n return i === 0 ? buf : buf.slice(i);\n }\n Signature.prototype._importDER = function (data, enc) {\n data = utils.toArray(data, enc);\n var p = new Position();\n if (data[p.place++] !== 48) return !1;\n var len = getLength(data, p);\n if (len === !1 || len + p.place !== data.length || data[p.place++] !== 2) return !1;\n var rlen = getLength(data, p);\n if (rlen === !1) return !1;\n var r = data.slice(p.place, rlen + p.place);\n if (((p.place += rlen), data[p.place++] !== 2)) return !1;\n var slen = getLength(data, p);\n if (slen === !1 || data.length !== slen + p.place) return !1;\n var s = data.slice(p.place, slen + p.place);\n if (r[0] === 0)\n if (r[1] & 128) r = r.slice(1);\n else return !1;\n if (s[0] === 0)\n if (s[1] & 128) s = s.slice(1);\n else return !1;\n return (this.r = new BN(r)), (this.s = new BN(s)), (this.recoveryParam = null), !0;\n };\n function constructLength(arr, len) {\n if (len < 128) {\n arr.push(len);\n return;\n }\n var octets = 1 + ((Math.log(len) / Math.LN2) >>> 3);\n for (arr.push(octets | 128); --octets; ) arr.push((len >>> (octets << 3)) & 255);\n arr.push(len);\n }\n Signature.prototype.toDER = function (enc) {\n var r = this.r.toArray(),\n s = this.s.toArray();\n for (\n r[0] & 128 && (r = [0].concat(r)), s[0] & 128 && (s = [0].concat(s)), r = rmPadding(r), s = rmPadding(s);\n !s[0] && !(s[1] & 128);\n\n )\n s = s.slice(1);\n var arr = [2];\n constructLength(arr, r.length), (arr = arr.concat(r)), arr.push(2), constructLength(arr, s.length);\n var backHalf = arr.concat(s),\n res = [48];\n return constructLength(res, backHalf.length), (res = res.concat(backHalf)), utils.encode(res, enc);\n };\n },\n});\n\n// node_modules/elliptic/lib/elliptic/ec/index.js\nvar require_ec = __commonJS({\n \"node_modules/elliptic/lib/elliptic/ec/index.js\"(exports, module) {\n \"use strict\";\n var BN = require_bn4(),\n HmacDRBG = require_hmac_drbg(),\n utils = require_utils3(),\n curves = require_curves(),\n rand = require_brorand(),\n assert = utils.assert,\n KeyPair = require_key(),\n Signature = require_signature();\n function EC(options) {\n if (!(this instanceof EC)) return new EC(options);\n typeof options == \"string\" &&\n (assert(Object.prototype.hasOwnProperty.call(curves, options), \"Unknown curve \" + options),\n (options = curves[options])),\n options instanceof curves.PresetCurve && (options = { curve: options }),\n (this.curve = options.curve.curve),\n (this.n = this.curve.n),\n (this.nh = this.n.ushrn(1)),\n (this.g = this.curve.g),\n (this.g = options.curve.g),\n this.g.precompute(options.curve.n.bitLength() + 1),\n (this.hash = options.hash || options.curve.hash);\n }\n module.exports = EC;\n EC.prototype.keyPair = function (options) {\n return new KeyPair(this, options);\n };\n EC.prototype.keyFromPrivate = function (priv, enc) {\n return KeyPair.fromPrivate(this, priv, enc);\n };\n EC.prototype.keyFromPublic = function (pub, enc) {\n return KeyPair.fromPublic(this, pub, enc);\n };\n EC.prototype.genKeyPair = function (options) {\n options || (options = {});\n for (\n var drbg = new HmacDRBG({\n hash: this.hash,\n pers: options.pers,\n persEnc: options.persEnc || \"utf8\",\n entropy: options.entropy || rand(this.hash.hmacStrength),\n entropyEnc: (options.entropy && options.entropyEnc) || \"utf8\",\n nonce: this.n.toArray(),\n }),\n bytes = this.n.byteLength(),\n ns2 = this.n.sub(new BN(2));\n ;\n\n ) {\n var priv = new BN(drbg.generate(bytes));\n if (!(priv.cmp(ns2) > 0)) return priv.iaddn(1), this.keyFromPrivate(priv);\n }\n };\n EC.prototype._truncateToN = function (msg, truncOnly) {\n var delta = msg.byteLength() * 8 - this.n.bitLength();\n return delta > 0 && (msg = msg.ushrn(delta)), !truncOnly && msg.cmp(this.n) >= 0 ? msg.sub(this.n) : msg;\n };\n EC.prototype.sign = function (msg, key, enc, options) {\n typeof enc == \"object\" && ((options = enc), (enc = null)),\n options || (options = {}),\n (key = this.keyFromPrivate(key, enc)),\n (msg = this._truncateToN(new BN(msg, 16)));\n for (\n var bytes = this.n.byteLength(),\n bkey = key.getPrivate().toArray(\"be\", bytes),\n nonce = msg.toArray(\"be\", bytes),\n drbg = new HmacDRBG({\n hash: this.hash,\n entropy: bkey,\n nonce,\n pers: options.pers,\n persEnc: options.persEnc || \"utf8\",\n }),\n ns1 = this.n.sub(new BN(1)),\n iter = 0;\n ;\n iter++\n ) {\n var k = options.k ? options.k(iter) : new BN(drbg.generate(this.n.byteLength()));\n if (((k = this._truncateToN(k, !0)), !(k.cmpn(1) <= 0 || k.cmp(ns1) >= 0))) {\n var kp = this.g.mul(k);\n if (!kp.isInfinity()) {\n var kpX = kp.getX(),\n r = kpX.umod(this.n);\n if (r.cmpn(0) !== 0) {\n var s = k.invm(this.n).mul(r.mul(key.getPrivate()).iadd(msg));\n if (((s = s.umod(this.n)), s.cmpn(0) !== 0)) {\n var recoveryParam = (kp.getY().isOdd() ? 1 : 0) | (kpX.cmp(r) !== 0 ? 2 : 0);\n return (\n options.canonical && s.cmp(this.nh) > 0 && ((s = this.n.sub(s)), (recoveryParam ^= 1)),\n new Signature({ r, s, recoveryParam })\n );\n }\n }\n }\n }\n }\n };\n EC.prototype.verify = function (msg, signature, key, enc) {\n (msg = this._truncateToN(new BN(msg, 16))),\n (key = this.keyFromPublic(key, enc)),\n (signature = new Signature(signature, \"hex\"));\n var r = signature.r,\n s = signature.s;\n if (r.cmpn(1) < 0 || r.cmp(this.n) >= 0 || s.cmpn(1) < 0 || s.cmp(this.n) >= 0) return !1;\n var sinv = s.invm(this.n),\n u1 = sinv.mul(msg).umod(this.n),\n u2 = sinv.mul(r).umod(this.n),\n p;\n return this.curve._maxwellTrick\n ? ((p = this.g.jmulAdd(u1, key.getPublic(), u2)), p.isInfinity() ? !1 : p.eqXToP(r))\n : ((p = this.g.mulAdd(u1, key.getPublic(), u2)), p.isInfinity() ? !1 : p.getX().umod(this.n).cmp(r) === 0);\n };\n EC.prototype.recoverPubKey = function (msg, signature, j, enc) {\n assert((3 & j) === j, \"The recovery param is more than two bits\"), (signature = new Signature(signature, enc));\n var n = this.n,\n e = new BN(msg),\n r = signature.r,\n s = signature.s,\n isYOdd = j & 1,\n isSecondKey = j >> 1;\n if (r.cmp(this.curve.p.umod(this.curve.n)) >= 0 && isSecondKey)\n throw new Error(\"Unable to find sencond key candinate\");\n isSecondKey ? (r = this.curve.pointFromX(r.add(this.curve.n), isYOdd)) : (r = this.curve.pointFromX(r, isYOdd));\n var rInv = signature.r.invm(n),\n s1 = n.sub(e).mul(rInv).umod(n),\n s2 = s.mul(rInv).umod(n);\n return this.g.mulAdd(s1, r, s2);\n };\n EC.prototype.getKeyRecoveryParam = function (e, signature, Q, enc) {\n if (((signature = new Signature(signature, enc)), signature.recoveryParam !== null))\n return signature.recoveryParam;\n for (var i = 0; i < 4; i++) {\n var Qprime;\n try {\n Qprime = this.recoverPubKey(e, signature, i);\n } catch {\n continue;\n }\n if (Qprime.eq(Q)) return i;\n }\n throw new Error(\"Unable to find valid recovery factor\");\n };\n },\n});\n\n// node_modules/elliptic/lib/elliptic/eddsa/key.js\nvar require_key2 = __commonJS({\n \"node_modules/elliptic/lib/elliptic/eddsa/key.js\"(exports, module) {\n \"use strict\";\n var utils = require_utils3(),\n assert = utils.assert,\n parseBytes = utils.parseBytes,\n cachedProperty = utils.cachedProperty;\n function KeyPair(eddsa, params) {\n (this.eddsa = eddsa),\n (this._secret = parseBytes(params.secret)),\n eddsa.isPoint(params.pub) ? (this._pub = params.pub) : (this._pubBytes = parseBytes(params.pub));\n }\n KeyPair.fromPublic = function (eddsa, pub) {\n return pub instanceof KeyPair ? pub : new KeyPair(eddsa, { pub });\n };\n KeyPair.fromSecret = function (eddsa, secret) {\n return secret instanceof KeyPair ? secret : new KeyPair(eddsa, { secret });\n };\n KeyPair.prototype.secret = function () {\n return this._secret;\n };\n cachedProperty(KeyPair, \"pubBytes\", function () {\n return this.eddsa.encodePoint(this.pub());\n });\n cachedProperty(KeyPair, \"pub\", function () {\n return this._pubBytes ? this.eddsa.decodePoint(this._pubBytes) : this.eddsa.g.mul(this.priv());\n });\n cachedProperty(KeyPair, \"privBytes\", function () {\n var eddsa = this.eddsa,\n hash = this.hash(),\n lastIx = eddsa.encodingLength - 1,\n a = hash.slice(0, eddsa.encodingLength);\n return (a[0] &= 248), (a[lastIx] &= 127), (a[lastIx] |= 64), a;\n });\n cachedProperty(KeyPair, \"priv\", function () {\n return this.eddsa.decodeInt(this.privBytes());\n });\n cachedProperty(KeyPair, \"hash\", function () {\n return this.eddsa.hash().update(this.secret()).digest();\n });\n cachedProperty(KeyPair, \"messagePrefix\", function () {\n return this.hash().slice(this.eddsa.encodingLength);\n });\n KeyPair.prototype.sign = function (message) {\n return assert(this._secret, \"KeyPair can only verify\"), this.eddsa.sign(message, this);\n };\n KeyPair.prototype.verify = function (message, sig) {\n return this.eddsa.verify(message, sig, this);\n };\n KeyPair.prototype.getSecret = function (enc) {\n return assert(this._secret, \"KeyPair is public only\"), utils.encode(this.secret(), enc);\n };\n KeyPair.prototype.getPublic = function (enc) {\n return utils.encode(this.pubBytes(), enc);\n };\n module.exports = KeyPair;\n },\n});\n\n// node_modules/elliptic/lib/elliptic/eddsa/signature.js\nvar require_signature2 = __commonJS({\n \"node_modules/elliptic/lib/elliptic/eddsa/signature.js\"(exports, module) {\n \"use strict\";\n var BN = require_bn4(),\n utils = require_utils3(),\n assert = utils.assert,\n cachedProperty = utils.cachedProperty,\n parseBytes = utils.parseBytes;\n function Signature(eddsa, sig) {\n (this.eddsa = eddsa),\n typeof sig != \"object\" && (sig = parseBytes(sig)),\n Array.isArray(sig) &&\n (sig = {\n R: sig.slice(0, eddsa.encodingLength),\n S: sig.slice(eddsa.encodingLength),\n }),\n assert(sig.R && sig.S, \"Signature without R or S\"),\n eddsa.isPoint(sig.R) && (this._R = sig.R),\n sig.S instanceof BN && (this._S = sig.S),\n (this._Rencoded = Array.isArray(sig.R) ? sig.R : sig.Rencoded),\n (this._Sencoded = Array.isArray(sig.S) ? sig.S : sig.Sencoded);\n }\n cachedProperty(Signature, \"S\", function () {\n return this.eddsa.decodeInt(this.Sencoded());\n });\n cachedProperty(Signature, \"R\", function () {\n return this.eddsa.decodePoint(this.Rencoded());\n });\n cachedProperty(Signature, \"Rencoded\", function () {\n return this.eddsa.encodePoint(this.R());\n });\n cachedProperty(Signature, \"Sencoded\", function () {\n return this.eddsa.encodeInt(this.S());\n });\n Signature.prototype.toBytes = function () {\n return this.Rencoded().concat(this.Sencoded());\n };\n Signature.prototype.toHex = function () {\n return utils.encode(this.toBytes(), \"hex\").toUpperCase();\n };\n module.exports = Signature;\n },\n});\n\n// node_modules/elliptic/lib/elliptic/eddsa/index.js\nvar require_eddsa = __commonJS({\n \"node_modules/elliptic/lib/elliptic/eddsa/index.js\"(exports, module) {\n \"use strict\";\n var hash = require_hash2(),\n curves = require_curves(),\n utils = require_utils3(),\n assert = utils.assert,\n parseBytes = utils.parseBytes,\n KeyPair = require_key2(),\n Signature = require_signature2();\n function EDDSA(curve) {\n if ((assert(curve === \"ed25519\", \"only tested with ed25519 so far\"), !(this instanceof EDDSA)))\n return new EDDSA(curve);\n (curve = curves[curve].curve),\n (this.curve = curve),\n (this.g = curve.g),\n this.g.precompute(curve.n.bitLength() + 1),\n (this.pointClass = curve.point().constructor),\n (this.encodingLength = Math.ceil(curve.n.bitLength() / 8)),\n (this.hash = hash.sha512);\n }\n module.exports = EDDSA;\n EDDSA.prototype.sign = function (message, secret) {\n message = parseBytes(message);\n var key = this.keyFromSecret(secret),\n r = this.hashInt(key.messagePrefix(), message),\n R = this.g.mul(r),\n Rencoded = this.encodePoint(R),\n s_ = this.hashInt(Rencoded, key.pubBytes(), message).mul(key.priv()),\n S = r.add(s_).umod(this.curve.n);\n return this.makeSignature({ R, S, Rencoded });\n };\n EDDSA.prototype.verify = function (message, sig, pub) {\n (message = parseBytes(message)), (sig = this.makeSignature(sig));\n var key = this.keyFromPublic(pub),\n h = this.hashInt(sig.Rencoded(), key.pubBytes(), message),\n SG = this.g.mul(sig.S()),\n RplusAh = sig.R().add(key.pub().mul(h));\n return RplusAh.eq(SG);\n };\n EDDSA.prototype.hashInt = function () {\n for (var hash2 = this.hash(), i = 0; i < arguments.length; i++) hash2.update(arguments[i]);\n return utils.intFromLE(hash2.digest()).umod(this.curve.n);\n };\n EDDSA.prototype.keyFromPublic = function (pub) {\n return KeyPair.fromPublic(this, pub);\n };\n EDDSA.prototype.keyFromSecret = function (secret) {\n return KeyPair.fromSecret(this, secret);\n };\n EDDSA.prototype.makeSignature = function (sig) {\n return sig instanceof Signature ? sig : new Signature(this, sig);\n };\n EDDSA.prototype.encodePoint = function (point) {\n var enc = point.getY().toArray(\"le\", this.encodingLength);\n return (enc[this.encodingLength - 1] |= point.getX().isOdd() ? 128 : 0), enc;\n };\n EDDSA.prototype.decodePoint = function (bytes) {\n bytes = utils.parseBytes(bytes);\n var lastIx = bytes.length - 1,\n normed = bytes.slice(0, lastIx).concat(bytes[lastIx] & -129),\n xIsOdd = (bytes[lastIx] & 128) !== 0,\n y = utils.intFromLE(normed);\n return this.curve.pointFromY(y, xIsOdd);\n };\n EDDSA.prototype.encodeInt = function (num) {\n return num.toArray(\"le\", this.encodingLength);\n };\n EDDSA.prototype.decodeInt = function (bytes) {\n return utils.intFromLE(bytes);\n };\n EDDSA.prototype.isPoint = function (val) {\n return val instanceof this.pointClass;\n };\n },\n});\n\n// node_modules/elliptic/lib/elliptic.js\nvar require_elliptic = __commonJS({\n \"node_modules/elliptic/lib/elliptic.js\"(exports) {\n \"use strict\";\n var elliptic = exports;\n elliptic.version = require_package().version;\n elliptic.utils = require_utils3();\n elliptic.rand = require_brorand();\n elliptic.curve = require_curve();\n elliptic.curves = require_curves();\n elliptic.ec = require_ec();\n elliptic.eddsa = require_eddsa();\n },\n});\n\n// node_modules/asn1.js/node_modules/bn.js/lib/bn.js\nvar require_bn5 = __commonJS({\n \"node_modules/asn1.js/node_modules/bn.js/lib/bn.js\"(exports, module) {\n (function (module2, exports2) {\n \"use strict\";\n function assert(val, msg) {\n if (!val) throw new Error(msg || \"Assertion failed\");\n }\n function inherits(ctor, superCtor) {\n ctor.super_ = superCtor;\n var TempCtor = function () {};\n (TempCtor.prototype = superCtor.prototype),\n (ctor.prototype = new TempCtor()),\n (ctor.prototype.constructor = ctor);\n }\n function BN(number, base, endian) {\n if (BN.isBN(number)) return number;\n (this.negative = 0),\n (this.words = null),\n (this.length = 0),\n (this.red = null),\n number !== null &&\n ((base === \"le\" || base === \"be\") && ((endian = base), (base = 10)),\n this._init(number || 0, base || 10, endian || \"be\"));\n }\n typeof module2 == \"object\" ? (module2.exports = BN) : (exports2.BN = BN), (BN.BN = BN), (BN.wordSize = 26);\n var Buffer2;\n try {\n typeof window < \"u\" && typeof window.Buffer < \"u\"\n ? (Buffer2 = window.Buffer)\n : (Buffer2 = __require(\"buffer\").Buffer);\n } catch {}\n (BN.isBN = function (num) {\n return num instanceof BN\n ? !0\n : num !== null &&\n typeof num == \"object\" &&\n num.constructor.wordSize === BN.wordSize &&\n Array.isArray(num.words);\n }),\n (BN.max = function (left, right) {\n return left.cmp(right) > 0 ? left : right;\n }),\n (BN.min = function (left, right) {\n return left.cmp(right) < 0 ? left : right;\n }),\n (BN.prototype._init = function (number, base, endian) {\n if (typeof number == \"number\") return this._initNumber(number, base, endian);\n if (typeof number == \"object\") return this._initArray(number, base, endian);\n base === \"hex\" && (base = 16),\n assert(base === (base | 0) && base >= 2 && base <= 36),\n (number = number.toString().replace(/\\s+/g, \"\"));\n var start = 0;\n number[0] === \"-\" && (start++, (this.negative = 1)),\n start < number.length &&\n (base === 16\n ? this._parseHex(number, start, endian)\n : (this._parseBase(number, base, start),\n endian === \"le\" && this._initArray(this.toArray(), base, endian)));\n }),\n (BN.prototype._initNumber = function (number, base, endian) {\n number < 0 && ((this.negative = 1), (number = -number)),\n number < 67108864\n ? ((this.words = [number & 67108863]), (this.length = 1))\n : number < 4503599627370496\n ? ((this.words = [number & 67108863, (number / 67108864) & 67108863]), (this.length = 2))\n : (assert(number < 9007199254740992),\n (this.words = [number & 67108863, (number / 67108864) & 67108863, 1]),\n (this.length = 3)),\n endian === \"le\" && this._initArray(this.toArray(), base, endian);\n }),\n (BN.prototype._initArray = function (number, base, endian) {\n if ((assert(typeof number.length == \"number\"), number.length <= 0))\n return (this.words = [0]), (this.length = 1), this;\n (this.length = Math.ceil(number.length / 3)), (this.words = new Array(this.length));\n for (var i = 0; i < this.length; i++) this.words[i] = 0;\n var j,\n w,\n off = 0;\n if (endian === \"be\")\n for (i = number.length - 1, j = 0; i >= 0; i -= 3)\n (w = number[i] | (number[i - 1] << 8) | (number[i - 2] << 16)),\n (this.words[j] |= (w << off) & 67108863),\n (this.words[j + 1] = (w >>> (26 - off)) & 67108863),\n (off += 24),\n off >= 26 && ((off -= 26), j++);\n else if (endian === \"le\")\n for (i = 0, j = 0; i < number.length; i += 3)\n (w = number[i] | (number[i + 1] << 8) | (number[i + 2] << 16)),\n (this.words[j] |= (w << off) & 67108863),\n (this.words[j + 1] = (w >>> (26 - off)) & 67108863),\n (off += 24),\n off >= 26 && ((off -= 26), j++);\n return this.strip();\n });\n function parseHex4Bits(string, index) {\n var c = string.charCodeAt(index);\n return c >= 65 && c <= 70 ? c - 55 : c >= 97 && c <= 102 ? c - 87 : (c - 48) & 15;\n }\n function parseHexByte(string, lowerBound, index) {\n var r = parseHex4Bits(string, index);\n return index - 1 >= lowerBound && (r |= parseHex4Bits(string, index - 1) << 4), r;\n }\n BN.prototype._parseHex = function (number, start, endian) {\n (this.length = Math.ceil((number.length - start) / 6)), (this.words = new Array(this.length));\n for (var i = 0; i < this.length; i++) this.words[i] = 0;\n var off = 0,\n j = 0,\n w;\n if (endian === \"be\")\n for (i = number.length - 1; i >= start; i -= 2)\n (w = parseHexByte(number, start, i) << off),\n (this.words[j] |= w & 67108863),\n off >= 18 ? ((off -= 18), (j += 1), (this.words[j] |= w >>> 26)) : (off += 8);\n else {\n var parseLength = number.length - start;\n for (i = parseLength % 2 === 0 ? start + 1 : start; i < number.length; i += 2)\n (w = parseHexByte(number, start, i) << off),\n (this.words[j] |= w & 67108863),\n off >= 18 ? ((off -= 18), (j += 1), (this.words[j] |= w >>> 26)) : (off += 8);\n }\n this.strip();\n };\n function parseBase(str, start, end, mul) {\n for (var r = 0, len = Math.min(str.length, end), i = start; i < len; i++) {\n var c = str.charCodeAt(i) - 48;\n (r *= mul), c >= 49 ? (r += c - 49 + 10) : c >= 17 ? (r += c - 17 + 10) : (r += c);\n }\n return r;\n }\n (BN.prototype._parseBase = function (number, base, start) {\n (this.words = [0]), (this.length = 1);\n for (var limbLen = 0, limbPow = 1; limbPow <= 67108863; limbPow *= base) limbLen++;\n limbLen--, (limbPow = (limbPow / base) | 0);\n for (\n var total = number.length - start,\n mod = total % limbLen,\n end = Math.min(total, total - mod) + start,\n word = 0,\n i = start;\n i < end;\n i += limbLen\n )\n (word = parseBase(number, i, i + limbLen, base)),\n this.imuln(limbPow),\n this.words[0] + word < 67108864 ? (this.words[0] += word) : this._iaddn(word);\n if (mod !== 0) {\n var pow = 1;\n for (word = parseBase(number, i, number.length, base), i = 0; i < mod; i++) pow *= base;\n this.imuln(pow), this.words[0] + word < 67108864 ? (this.words[0] += word) : this._iaddn(word);\n }\n this.strip();\n }),\n (BN.prototype.copy = function (dest) {\n dest.words = new Array(this.length);\n for (var i = 0; i < this.length; i++) dest.words[i] = this.words[i];\n (dest.length = this.length), (dest.negative = this.negative), (dest.red = this.red);\n }),\n (BN.prototype.clone = function () {\n var r = new BN(null);\n return this.copy(r), r;\n }),\n (BN.prototype._expand = function (size) {\n for (; this.length < size; ) this.words[this.length++] = 0;\n return this;\n }),\n (BN.prototype.strip = function () {\n for (; this.length > 1 && this.words[this.length - 1] === 0; ) this.length--;\n return this._normSign();\n }),\n (BN.prototype._normSign = function () {\n return this.length === 1 && this.words[0] === 0 && (this.negative = 0), this;\n }),\n (BN.prototype.inspect = function () {\n return (this.red ? \"<BN-R: \" : \"<BN: \") + this.toString(16) + \">\";\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 groupSizes = [\n 0, 0, 25, 16, 12, 11, 10, 9, 8, 8, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5,\n 5, 5,\n ],\n groupBases = [\n 0, 0, 33554432, 43046721, 16777216, 48828125, 60466176, 40353607, 16777216, 43046721, 1e7, 19487171, 35831808,\n 62748517, 7529536, 11390625, 16777216, 24137569, 34012224, 47045881, 64e6, 4084101, 5153632, 6436343, 7962624,\n 9765625, 11881376, 14348907, 17210368, 20511149, 243e5, 28629151, 33554432, 39135393, 45435424, 52521875,\n 60466176,\n ];\n (BN.prototype.toString = function (base, padding) {\n (base = base || 10), (padding = padding | 0 || 1);\n var out;\n if (base === 16 || base === \"hex\") {\n out = \"\";\n for (var off = 0, carry = 0, i = 0; i < this.length; i++) {\n var w = this.words[i],\n word = (((w << off) | carry) & 16777215).toString(16);\n (carry = (w >>> (24 - off)) & 16777215),\n carry !== 0 || i !== this.length - 1 ? (out = zeros[6 - word.length] + word + out) : (out = word + out),\n (off += 2),\n off >= 26 && ((off -= 26), i--);\n }\n for (carry !== 0 && (out = carry.toString(16) + out); out.length % padding !== 0; ) out = \"0\" + out;\n return this.negative !== 0 && (out = \"-\" + out), out;\n }\n if (base === (base | 0) && base >= 2 && base <= 36) {\n var groupSize = groupSizes[base],\n groupBase = groupBases[base];\n out = \"\";\n var c = this.clone();\n for (c.negative = 0; !c.isZero(); ) {\n var r = c.modn(groupBase).toString(base);\n (c = c.idivn(groupBase)), c.isZero() ? (out = r + out) : (out = zeros[groupSize - r.length] + r + out);\n }\n for (this.isZero() && (out = \"0\" + out); out.length % padding !== 0; ) out = \"0\" + out;\n return this.negative !== 0 && (out = \"-\" + out), out;\n }\n assert(!1, \"Base should be between 2 and 36\");\n }),\n (BN.prototype.toNumber = function () {\n var ret = this.words[0];\n return (\n this.length === 2\n ? (ret += this.words[1] * 67108864)\n : this.length === 3 && this.words[2] === 1\n ? (ret += 4503599627370496 + this.words[1] * 67108864)\n : this.length > 2 && assert(!1, \"Number can only safely store up to 53 bits\"),\n this.negative !== 0 ? -ret : ret\n );\n }),\n (BN.prototype.toJSON = function () {\n return this.toString(16);\n }),\n (BN.prototype.toBuffer = function (endian, length) {\n return assert(typeof Buffer2 < \"u\"), this.toArrayLike(Buffer2, endian, length);\n }),\n (BN.prototype.toArray = function (endian, length) {\n return this.toArrayLike(Array, endian, length);\n }),\n (BN.prototype.toArrayLike = function (ArrayType, endian, length) {\n var byteLength = this.byteLength(),\n 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 this.strip();\n var littleEndian = endian === \"le\",\n res = new ArrayType(reqLength),\n b,\n i,\n q = this.clone();\n if (littleEndian) {\n for (i = 0; !q.isZero(); i++) (b = q.andln(255)), q.iushrn(8), (res[i] = b);\n for (; i < reqLength; i++) res[i] = 0;\n } else {\n for (i = 0; i < reqLength - byteLength; i++) res[i] = 0;\n for (i = 0; !q.isZero(); i++) (b = q.andln(255)), q.iushrn(8), (res[reqLength - i - 1] = b);\n }\n return res;\n }),\n Math.clz32\n ? (BN.prototype._countBits = function (w) {\n return 32 - Math.clz32(w);\n })\n : (BN.prototype._countBits = function (w) {\n var t = w,\n r = 0;\n return (\n t >= 4096 && ((r += 13), (t >>>= 13)),\n t >= 64 && ((r += 7), (t >>>= 7)),\n t >= 8 && ((r += 4), (t >>>= 4)),\n t >= 2 && ((r += 2), (t >>>= 2)),\n r + t\n );\n }),\n (BN.prototype._zeroBits = function (w) {\n if (w === 0) return 26;\n var t = w,\n r = 0;\n return (\n (t & 8191) === 0 && ((r += 13), (t >>>= 13)),\n (t & 127) === 0 && ((r += 7), (t >>>= 7)),\n (t & 15) === 0 && ((r += 4), (t >>>= 4)),\n (t & 3) === 0 && ((r += 2), (t >>>= 2)),\n (t & 1) === 0 && r++,\n r\n );\n }),\n (BN.prototype.bitLength = function () {\n var w = this.words[this.length - 1],\n hi = this._countBits(w);\n return (this.length - 1) * 26 + hi;\n });\n function toBitArray(num) {\n for (var w = new Array(num.bitLength()), bit = 0; bit < w.length; bit++) {\n var off = (bit / 26) | 0,\n wbit = bit % 26;\n w[bit] = (num.words[off] & (1 << wbit)) >>> wbit;\n }\n return w;\n }\n (BN.prototype.zeroBits = function () {\n if (this.isZero()) return 0;\n for (var r = 0, i = 0; i < this.length; i++) {\n var b = this._zeroBits(this.words[i]);\n if (((r += b), b !== 26)) break;\n }\n return r;\n }),\n (BN.prototype.byteLength = function () {\n return Math.ceil(this.bitLength() / 8);\n }),\n (BN.prototype.toTwos = function (width) {\n return this.negative !== 0 ? this.abs().inotn(width).iaddn(1) : this.clone();\n }),\n (BN.prototype.fromTwos = function (width) {\n return this.testn(width - 1) ? this.notn(width).iaddn(1).ineg() : this.clone();\n }),\n (BN.prototype.isNeg = function () {\n return this.negative !== 0;\n }),\n (BN.prototype.neg = function () {\n return this.clone().ineg();\n }),\n (BN.prototype.ineg = function () {\n return this.isZero() || (this.negative ^= 1), this;\n }),\n (BN.prototype.iuor = function (num) {\n for (; this.length < num.length; ) this.words[this.length++] = 0;\n for (var i = 0; i < num.length; i++) this.words[i] = this.words[i] | num.words[i];\n return this.strip();\n }),\n (BN.prototype.ior = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuor(num);\n }),\n (BN.prototype.or = function (num) {\n return this.length > num.length ? this.clone().ior(num) : num.clone().ior(this);\n }),\n (BN.prototype.uor = function (num) {\n return this.length > num.length ? this.clone().iuor(num) : num.clone().iuor(this);\n }),\n (BN.prototype.iuand = function (num) {\n var b;\n this.length > num.length ? (b = num) : (b = this);\n for (var i = 0; i < b.length; i++) this.words[i] = this.words[i] & num.words[i];\n return (this.length = b.length), this.strip();\n }),\n (BN.prototype.iand = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuand(num);\n }),\n (BN.prototype.and = function (num) {\n return this.length > num.length ? this.clone().iand(num) : num.clone().iand(this);\n }),\n (BN.prototype.uand = function (num) {\n return this.length > num.length ? this.clone().iuand(num) : num.clone().iuand(this);\n }),\n (BN.prototype.iuxor = function (num) {\n var a, b;\n this.length > num.length ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var i = 0; i < b.length; i++) this.words[i] = a.words[i] ^ b.words[i];\n if (this !== a) for (; i < a.length; i++) this.words[i] = a.words[i];\n return (this.length = a.length), this.strip();\n }),\n (BN.prototype.ixor = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuxor(num);\n }),\n (BN.prototype.xor = function (num) {\n return this.length > num.length ? this.clone().ixor(num) : num.clone().ixor(this);\n }),\n (BN.prototype.uxor = function (num) {\n return this.length > num.length ? this.clone().iuxor(num) : num.clone().iuxor(this);\n }),\n (BN.prototype.inotn = function (width) {\n assert(typeof width == \"number\" && width >= 0);\n var bytesNeeded = Math.ceil(width / 26) | 0,\n bitsLeft = width % 26;\n this._expand(bytesNeeded), bitsLeft > 0 && bytesNeeded--;\n for (var i = 0; i < bytesNeeded; i++) this.words[i] = ~this.words[i] & 67108863;\n return bitsLeft > 0 && (this.words[i] = ~this.words[i] & (67108863 >> (26 - bitsLeft))), this.strip();\n }),\n (BN.prototype.notn = function (width) {\n return this.clone().inotn(width);\n }),\n (BN.prototype.setn = function (bit, val) {\n assert(typeof bit == \"number\" && bit >= 0);\n var off = (bit / 26) | 0,\n wbit = bit % 26;\n return (\n this._expand(off + 1),\n val\n ? (this.words[off] = this.words[off] | (1 << wbit))\n : (this.words[off] = this.words[off] & ~(1 << wbit)),\n this.strip()\n );\n }),\n (BN.prototype.iadd = function (num) {\n var r;\n if (this.negative !== 0 && num.negative === 0)\n return (this.negative = 0), (r = this.isub(num)), (this.negative ^= 1), this._normSign();\n if (this.negative === 0 && num.negative !== 0)\n return (num.negative = 0), (r = this.isub(num)), (num.negative = 1), r._normSign();\n var a, b;\n this.length > num.length ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var carry = 0, i = 0; i < b.length; i++)\n (r = (a.words[i] | 0) + (b.words[i] | 0) + carry), (this.words[i] = r & 67108863), (carry = r >>> 26);\n for (; carry !== 0 && i < a.length; i++)\n (r = (a.words[i] | 0) + carry), (this.words[i] = r & 67108863), (carry = r >>> 26);\n if (((this.length = a.length), carry !== 0)) (this.words[this.length] = carry), this.length++;\n else if (a !== this) for (; i < a.length; i++) this.words[i] = a.words[i];\n return this;\n }),\n (BN.prototype.add = function (num) {\n var res;\n return num.negative !== 0 && this.negative === 0\n ? ((num.negative = 0), (res = this.sub(num)), (num.negative ^= 1), res)\n : num.negative === 0 && this.negative !== 0\n ? ((this.negative = 0), (res = num.sub(this)), (this.negative = 1), res)\n : this.length > num.length\n ? this.clone().iadd(num)\n : num.clone().iadd(this);\n }),\n (BN.prototype.isub = function (num) {\n if (num.negative !== 0) {\n num.negative = 0;\n var r = this.iadd(num);\n return (num.negative = 1), r._normSign();\n } else if (this.negative !== 0)\n return (this.negative = 0), this.iadd(num), (this.negative = 1), this._normSign();\n var cmp = this.cmp(num);\n if (cmp === 0) return (this.negative = 0), (this.length = 1), (this.words[0] = 0), this;\n var a, b;\n cmp > 0 ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var carry = 0, i = 0; i < b.length; i++)\n (r = (a.words[i] | 0) - (b.words[i] | 0) + carry), (carry = r >> 26), (this.words[i] = r & 67108863);\n for (; carry !== 0 && i < a.length; i++)\n (r = (a.words[i] | 0) + carry), (carry = r >> 26), (this.words[i] = r & 67108863);\n if (carry === 0 && i < a.length && a !== this) for (; i < a.length; i++) this.words[i] = a.words[i];\n return (this.length = Math.max(this.length, i)), a !== this && (this.negative = 1), this.strip();\n }),\n (BN.prototype.sub = function (num) {\n return this.clone().isub(num);\n });\n function smallMulTo(self2, num, out) {\n out.negative = num.negative ^ self2.negative;\n var len = (self2.length + num.length) | 0;\n (out.length = len), (len = (len - 1) | 0);\n var a = self2.words[0] | 0,\n b = num.words[0] | 0,\n r = a * b,\n lo = r & 67108863,\n carry = (r / 67108864) | 0;\n out.words[0] = lo;\n for (var k = 1; k < len; k++) {\n for (\n var ncarry = carry >>> 26,\n rword = carry & 67108863,\n maxJ = Math.min(k, num.length - 1),\n j = Math.max(0, k - self2.length + 1);\n j <= maxJ;\n j++\n ) {\n var i = (k - j) | 0;\n (a = self2.words[i] | 0),\n (b = num.words[j] | 0),\n (r = a * b + rword),\n (ncarry += (r / 67108864) | 0),\n (rword = r & 67108863);\n }\n (out.words[k] = rword | 0), (carry = ncarry | 0);\n }\n return carry !== 0 ? (out.words[k] = carry | 0) : out.length--, out.strip();\n }\n var comb10MulTo = function (self2, num, out) {\n var a = self2.words,\n b = num.words,\n o = out.words,\n c = 0,\n lo,\n mid,\n hi,\n a0 = a[0] | 0,\n al0 = a0 & 8191,\n ah0 = a0 >>> 13,\n a1 = a[1] | 0,\n al1 = a1 & 8191,\n ah1 = a1 >>> 13,\n a2 = a[2] | 0,\n al2 = a2 & 8191,\n ah2 = a2 >>> 13,\n a3 = a[3] | 0,\n al3 = a3 & 8191,\n ah3 = a3 >>> 13,\n a4 = a[4] | 0,\n al4 = a4 & 8191,\n ah4 = a4 >>> 13,\n a5 = a[5] | 0,\n al5 = a5 & 8191,\n ah5 = a5 >>> 13,\n a6 = a[6] | 0,\n al6 = a6 & 8191,\n ah6 = a6 >>> 13,\n a7 = a[7] | 0,\n al7 = a7 & 8191,\n ah7 = a7 >>> 13,\n a8 = a[8] | 0,\n al8 = a8 & 8191,\n ah8 = a8 >>> 13,\n a9 = a[9] | 0,\n al9 = a9 & 8191,\n ah9 = a9 >>> 13,\n b0 = b[0] | 0,\n bl0 = b0 & 8191,\n bh0 = b0 >>> 13,\n b1 = b[1] | 0,\n bl1 = b1 & 8191,\n bh1 = b1 >>> 13,\n b2 = b[2] | 0,\n bl2 = b2 & 8191,\n bh2 = b2 >>> 13,\n b3 = b[3] | 0,\n bl3 = b3 & 8191,\n bh3 = b3 >>> 13,\n b4 = b[4] | 0,\n bl4 = b4 & 8191,\n bh4 = b4 >>> 13,\n b5 = b[5] | 0,\n bl5 = b5 & 8191,\n bh5 = b5 >>> 13,\n b6 = b[6] | 0,\n bl6 = b6 & 8191,\n bh6 = b6 >>> 13,\n b7 = b[7] | 0,\n bl7 = b7 & 8191,\n bh7 = b7 >>> 13,\n b8 = b[8] | 0,\n bl8 = b8 & 8191,\n bh8 = b8 >>> 13,\n b9 = b[9] | 0,\n bl9 = b9 & 8191,\n bh9 = b9 >>> 13;\n (out.negative = self2.negative ^ num.negative),\n (out.length = 19),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w0 >>> 26)) | 0),\n (w0 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w1 >>> 26)) | 0),\n (w1 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w2 >>> 26)) | 0),\n (w2 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w3 >>> 26)) | 0),\n (w3 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w4 >>> 26)) | 0),\n (w4 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w5 >>> 26)) | 0),\n (w5 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w6 >>> 26)) | 0),\n (w6 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w7 >>> 26)) | 0),\n (w7 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w8 >>> 26)) | 0),\n (w8 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w9 >>> 26)) | 0),\n (w9 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w10 >>> 26)) | 0),\n (w10 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w11 >>> 26)) | 0),\n (w11 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w12 >>> 26)) | 0),\n (w12 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w13 >>> 26)) | 0),\n (w13 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w14 >>> 26)) | 0),\n (w14 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w15 >>> 26)) | 0),\n (w15 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w16 >>> 26)) | 0),\n (w16 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w17 >>> 26)) | 0),\n (w17 &= 67108863),\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 & 8191) << 13)) | 0;\n return (\n (c = (((hi + (mid >>> 13)) | 0) + (w18 >>> 26)) | 0),\n (w18 &= 67108863),\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 c !== 0 && ((o[19] = c), out.length++),\n out\n );\n };\n Math.imul || (comb10MulTo = smallMulTo);\n function bigMulTo(self2, num, out) {\n (out.negative = num.negative ^ self2.negative), (out.length = self2.length + num.length);\n for (var carry = 0, hncarry = 0, k = 0; k < out.length - 1; k++) {\n var ncarry = hncarry;\n hncarry = 0;\n for (\n var rword = carry & 67108863, maxJ = Math.min(k, num.length - 1), j = Math.max(0, k - self2.length + 1);\n j <= maxJ;\n j++\n ) {\n var i = k - j,\n a = self2.words[i] | 0,\n b = num.words[j] | 0,\n r = a * b,\n lo = r & 67108863;\n (ncarry = (ncarry + ((r / 67108864) | 0)) | 0),\n (lo = (lo + rword) | 0),\n (rword = lo & 67108863),\n (ncarry = (ncarry + (lo >>> 26)) | 0),\n (hncarry += ncarry >>> 26),\n (ncarry &= 67108863);\n }\n (out.words[k] = rword), (carry = ncarry), (ncarry = hncarry);\n }\n return carry !== 0 ? (out.words[k] = carry) : out.length--, out.strip();\n }\n function jumboMulTo(self2, num, out) {\n var fftm = new FFTM();\n return fftm.mulp(self2, num, out);\n }\n BN.prototype.mulTo = function (num, out) {\n var res,\n len = this.length + num.length;\n return (\n this.length === 10 && num.length === 10\n ? (res = comb10MulTo(this, num, out))\n : len < 63\n ? (res = smallMulTo(this, num, out))\n : len < 1024\n ? (res = bigMulTo(this, num, out))\n : (res = jumboMulTo(this, num, out)),\n res\n );\n };\n function FFTM(x, y) {\n (this.x = x), (this.y = y);\n }\n (FFTM.prototype.makeRBT = function (N) {\n for (var t = new Array(N), l = BN.prototype._countBits(N) - 1, i = 0; i < N; i++) t[i] = this.revBin(i, l, N);\n return t;\n }),\n (FFTM.prototype.revBin = function (x, l, N) {\n if (x === 0 || x === N - 1) return x;\n for (var rb = 0, i = 0; i < l; i++) (rb |= (x & 1) << (l - i - 1)), (x >>= 1);\n return rb;\n }),\n (FFTM.prototype.permute = function (rbt, rws, iws, rtws, itws, N) {\n for (var i = 0; i < N; i++) (rtws[i] = rws[rbt[i]]), (itws[i] = iws[rbt[i]]);\n }),\n (FFTM.prototype.transform = function (rws, iws, rtws, itws, N, rbt) {\n this.permute(rbt, rws, iws, rtws, itws, N);\n for (var s = 1; s < N; s <<= 1)\n for (\n var l = s << 1, rtwdf = Math.cos((2 * Math.PI) / l), itwdf = Math.sin((2 * Math.PI) / l), p = 0;\n p < N;\n p += l\n )\n for (var rtwdf_ = rtwdf, itwdf_ = itwdf, j = 0; j < s; j++) {\n var re = rtws[p + j],\n ie = itws[p + j],\n ro = rtws[p + j + s],\n io = itws[p + j + s],\n rx = rtwdf_ * ro - itwdf_ * io;\n (io = rtwdf_ * io + itwdf_ * ro),\n (ro = rx),\n (rtws[p + j] = re + ro),\n (itws[p + j] = ie + io),\n (rtws[p + j + s] = re - ro),\n (itws[p + j + s] = ie - io),\n j !== l &&\n ((rx = rtwdf * rtwdf_ - itwdf * itwdf_), (itwdf_ = rtwdf * itwdf_ + itwdf * rtwdf_), (rtwdf_ = rx));\n }\n }),\n (FFTM.prototype.guessLen13b = function (n, m) {\n var N = Math.max(m, n) | 1,\n odd = N & 1,\n i = 0;\n for (N = (N / 2) | 0; N; N = N >>> 1) i++;\n return 1 << (i + 1 + odd);\n }),\n (FFTM.prototype.conjugate = function (rws, iws, N) {\n if (!(N <= 1))\n for (var i = 0; i < N / 2; i++) {\n var t = rws[i];\n (rws[i] = rws[N - i - 1]),\n (rws[N - i - 1] = t),\n (t = iws[i]),\n (iws[i] = -iws[N - i - 1]),\n (iws[N - i - 1] = -t);\n }\n }),\n (FFTM.prototype.normalize13b = function (ws, N) {\n for (var carry = 0, i = 0; i < N / 2; i++) {\n var w = Math.round(ws[2 * i + 1] / N) * 8192 + Math.round(ws[2 * i] / N) + carry;\n (ws[i] = w & 67108863), w < 67108864 ? (carry = 0) : (carry = (w / 67108864) | 0);\n }\n return ws;\n }),\n (FFTM.prototype.convert13b = function (ws, len, rws, N) {\n for (var carry = 0, i = 0; i < len; i++)\n (carry = carry + (ws[i] | 0)),\n (rws[2 * i] = carry & 8191),\n (carry = carry >>> 13),\n (rws[2 * i + 1] = carry & 8191),\n (carry = carry >>> 13);\n for (i = 2 * len; i < N; ++i) rws[i] = 0;\n assert(carry === 0), assert((carry & -8192) === 0);\n }),\n (FFTM.prototype.stub = function (N) {\n for (var ph = new Array(N), i = 0; i < N; i++) ph[i] = 0;\n return ph;\n }),\n (FFTM.prototype.mulp = function (x, y, out) {\n var N = 2 * this.guessLen13b(x.length, y.length),\n rbt = this.makeRBT(N),\n _ = this.stub(N),\n rws = new Array(N),\n rwst = new Array(N),\n iwst = new Array(N),\n nrws = new Array(N),\n nrwst = new Array(N),\n niwst = new Array(N),\n rmws = out.words;\n (rmws.length = N),\n this.convert13b(x.words, x.length, rws, N),\n this.convert13b(y.words, y.length, nrws, N),\n this.transform(rws, _, rwst, iwst, N, rbt),\n this.transform(nrws, _, nrwst, niwst, N, rbt);\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]), (rwst[i] = rx);\n }\n return (\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 (out.negative = x.negative ^ y.negative),\n (out.length = x.length + y.length),\n out.strip()\n );\n }),\n (BN.prototype.mul = function (num) {\n var out = new BN(null);\n return (out.words = new Array(this.length + num.length)), this.mulTo(num, out);\n }),\n (BN.prototype.mulf = function (num) {\n var out = new BN(null);\n return (out.words = new Array(this.length + num.length)), jumboMulTo(this, num, out);\n }),\n (BN.prototype.imul = function (num) {\n return this.clone().mulTo(num, this);\n }),\n (BN.prototype.imuln = function (num) {\n assert(typeof num == \"number\"), assert(num < 67108864);\n for (var carry = 0, i = 0; i < this.length; i++) {\n var w = (this.words[i] | 0) * num,\n lo = (w & 67108863) + (carry & 67108863);\n (carry >>= 26), (carry += (w / 67108864) | 0), (carry += lo >>> 26), (this.words[i] = lo & 67108863);\n }\n return carry !== 0 && ((this.words[i] = carry), this.length++), this;\n }),\n (BN.prototype.muln = function (num) {\n return this.clone().imuln(num);\n }),\n (BN.prototype.sqr = function () {\n return this.mul(this);\n }),\n (BN.prototype.isqr = function () {\n return this.imul(this.clone());\n }),\n (BN.prototype.pow = function (num) {\n var w = toBitArray(num);\n if (w.length === 0) return new BN(1);\n for (var res = this, i = 0; i < w.length && w[i] === 0; i++, res = res.sqr());\n if (++i < w.length) for (var q = res.sqr(); i < w.length; i++, q = q.sqr()) w[i] !== 0 && (res = res.mul(q));\n return res;\n }),\n (BN.prototype.iushln = function (bits) {\n assert(typeof bits == \"number\" && bits >= 0);\n var r = bits % 26,\n s = (bits - r) / 26,\n carryMask = (67108863 >>> (26 - r)) << (26 - r),\n i;\n if (r !== 0) {\n var carry = 0;\n for (i = 0; i < this.length; i++) {\n var newCarry = this.words[i] & carryMask,\n c = ((this.words[i] | 0) - newCarry) << r;\n (this.words[i] = c | carry), (carry = newCarry >>> (26 - r));\n }\n carry && ((this.words[i] = carry), this.length++);\n }\n if (s !== 0) {\n for (i = this.length - 1; i >= 0; i--) this.words[i + s] = this.words[i];\n for (i = 0; i < s; i++) this.words[i] = 0;\n this.length += s;\n }\n return this.strip();\n }),\n (BN.prototype.ishln = function (bits) {\n return assert(this.negative === 0), this.iushln(bits);\n }),\n (BN.prototype.iushrn = function (bits, hint, extended) {\n assert(typeof bits == \"number\" && bits >= 0);\n var h;\n hint ? (h = (hint - (hint % 26)) / 26) : (h = 0);\n var r = bits % 26,\n s = Math.min((bits - r) / 26, this.length),\n mask = 67108863 ^ ((67108863 >>> r) << r),\n maskedWords = extended;\n if (((h -= s), (h = Math.max(0, h)), maskedWords)) {\n for (var i = 0; i < s; i++) maskedWords.words[i] = this.words[i];\n maskedWords.length = s;\n }\n if (s !== 0)\n if (this.length > s) for (this.length -= s, i = 0; i < this.length; i++) this.words[i] = this.words[i + s];\n else (this.words[0] = 0), (this.length = 1);\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)), (carry = word & mask);\n }\n return (\n maskedWords && carry !== 0 && (maskedWords.words[maskedWords.length++] = carry),\n this.length === 0 && ((this.words[0] = 0), (this.length = 1)),\n this.strip()\n );\n }),\n (BN.prototype.ishrn = function (bits, hint, extended) {\n return assert(this.negative === 0), this.iushrn(bits, hint, extended);\n }),\n (BN.prototype.shln = function (bits) {\n return this.clone().ishln(bits);\n }),\n (BN.prototype.ushln = function (bits) {\n return this.clone().iushln(bits);\n }),\n (BN.prototype.shrn = function (bits) {\n return this.clone().ishrn(bits);\n }),\n (BN.prototype.ushrn = function (bits) {\n return this.clone().iushrn(bits);\n }),\n (BN.prototype.testn = function (bit) {\n assert(typeof bit == \"number\" && bit >= 0);\n var r = bit % 26,\n s = (bit - r) / 26,\n q = 1 << r;\n if (this.length <= s) return !1;\n var w = this.words[s];\n return !!(w & q);\n }),\n (BN.prototype.imaskn = function (bits) {\n assert(typeof bits == \"number\" && bits >= 0);\n var r = bits % 26,\n s = (bits - r) / 26;\n if ((assert(this.negative === 0, \"imaskn works only with positive numbers\"), this.length <= s)) return this;\n if ((r !== 0 && s++, (this.length = Math.min(s, this.length)), r !== 0)) {\n var mask = 67108863 ^ ((67108863 >>> r) << r);\n this.words[this.length - 1] &= mask;\n }\n return this.strip();\n }),\n (BN.prototype.maskn = function (bits) {\n return this.clone().imaskn(bits);\n }),\n (BN.prototype.iaddn = function (num) {\n return (\n assert(typeof num == \"number\"),\n assert(num < 67108864),\n num < 0\n ? this.isubn(-num)\n : this.negative !== 0\n ? this.length === 1 && (this.words[0] | 0) < num\n ? ((this.words[0] = num - (this.words[0] | 0)), (this.negative = 0), this)\n : ((this.negative = 0), this.isubn(num), (this.negative = 1), this)\n : this._iaddn(num)\n );\n }),\n (BN.prototype._iaddn = function (num) {\n this.words[0] += num;\n for (var i = 0; i < this.length && this.words[i] >= 67108864; i++)\n (this.words[i] -= 67108864), i === this.length - 1 ? (this.words[i + 1] = 1) : this.words[i + 1]++;\n return (this.length = Math.max(this.length, i + 1)), this;\n }),\n (BN.prototype.isubn = function (num) {\n if ((assert(typeof num == \"number\"), assert(num < 67108864), num < 0)) return this.iaddn(-num);\n if (this.negative !== 0) return (this.negative = 0), this.iaddn(num), (this.negative = 1), this;\n if (((this.words[0] -= num), this.length === 1 && this.words[0] < 0))\n (this.words[0] = -this.words[0]), (this.negative = 1);\n else\n for (var i = 0; i < this.length && this.words[i] < 0; i++)\n (this.words[i] += 67108864), (this.words[i + 1] -= 1);\n return this.strip();\n }),\n (BN.prototype.addn = function (num) {\n return this.clone().iaddn(num);\n }),\n (BN.prototype.subn = function (num) {\n return this.clone().isubn(num);\n }),\n (BN.prototype.iabs = function () {\n return (this.negative = 0), this;\n }),\n (BN.prototype.abs = function () {\n return this.clone().iabs();\n }),\n (BN.prototype._ishlnsubmul = function (num, mul, shift) {\n var len = num.length + shift,\n i;\n this._expand(len);\n var w,\n 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 & 67108863),\n (carry = (w >> 26) - ((right / 67108864) | 0)),\n (this.words[i + shift] = w & 67108863);\n }\n for (; i < this.length - shift; i++)\n (w = (this.words[i + shift] | 0) + carry), (carry = w >> 26), (this.words[i + shift] = w & 67108863);\n if (carry === 0) return this.strip();\n for (assert(carry === -1), carry = 0, i = 0; i < this.length; i++)\n (w = -(this.words[i] | 0) + carry), (carry = w >> 26), (this.words[i] = w & 67108863);\n return (this.negative = 1), this.strip();\n }),\n (BN.prototype._wordDiv = function (num, mode) {\n var shift = this.length - num.length,\n a = this.clone(),\n b = num,\n bhi = b.words[b.length - 1] | 0,\n bhiBits = this._countBits(bhi);\n (shift = 26 - bhiBits),\n shift !== 0 && ((b = b.ushln(shift)), a.iushln(shift), (bhi = b.words[b.length - 1] | 0));\n var m = a.length - b.length,\n q;\n if (mode !== \"mod\") {\n (q = new BN(null)), (q.length = m + 1), (q.words = new Array(q.length));\n for (var i = 0; i < q.length; i++) q.words[i] = 0;\n }\n var diff = a.clone()._ishlnsubmul(b, 1, m);\n diff.negative === 0 && ((a = diff), q && (q.words[m] = 1));\n for (var j = m - 1; j >= 0; j--) {\n var qj = (a.words[b.length + j] | 0) * 67108864 + (a.words[b.length + j - 1] | 0);\n for (qj = Math.min((qj / bhi) | 0, 67108863), a._ishlnsubmul(b, qj, j); a.negative !== 0; )\n qj--, (a.negative = 0), a._ishlnsubmul(b, 1, j), a.isZero() || (a.negative ^= 1);\n q && (q.words[j] = qj);\n }\n return (\n q && q.strip(),\n a.strip(),\n mode !== \"div\" && shift !== 0 && a.iushrn(shift),\n {\n div: q || null,\n mod: a,\n }\n );\n }),\n (BN.prototype.divmod = function (num, mode, positive) {\n if ((assert(!num.isZero()), this.isZero()))\n return {\n div: new BN(0),\n mod: new BN(0),\n };\n var div, mod, res;\n return this.negative !== 0 && num.negative === 0\n ? ((res = this.neg().divmod(num, mode)),\n mode !== \"mod\" && (div = res.div.neg()),\n mode !== \"div\" && ((mod = res.mod.neg()), positive && mod.negative !== 0 && mod.iadd(num)),\n {\n div,\n mod,\n })\n : this.negative === 0 && num.negative !== 0\n ? ((res = this.divmod(num.neg(), mode)),\n mode !== \"mod\" && (div = res.div.neg()),\n {\n div,\n mod: res.mod,\n })\n : (this.negative & num.negative) !== 0\n ? ((res = this.neg().divmod(num.neg(), mode)),\n mode !== \"div\" && ((mod = res.mod.neg()), positive && mod.negative !== 0 && mod.isub(num)),\n {\n div: res.div,\n mod,\n })\n : num.length > this.length || this.cmp(num) < 0\n ? {\n div: new BN(0),\n mod: this,\n }\n : num.length === 1\n ? mode === \"div\"\n ? {\n div: this.divn(num.words[0]),\n mod: null,\n }\n : mode === \"mod\"\n ? {\n div: null,\n mod: new BN(this.modn(num.words[0])),\n }\n : {\n div: this.divn(num.words[0]),\n mod: new BN(this.modn(num.words[0])),\n }\n : this._wordDiv(num, mode);\n }),\n (BN.prototype.div = function (num) {\n return this.divmod(num, \"div\", !1).div;\n }),\n (BN.prototype.mod = function (num) {\n return this.divmod(num, \"mod\", !1).mod;\n }),\n (BN.prototype.umod = function (num) {\n return this.divmod(num, \"mod\", !0).mod;\n }),\n (BN.prototype.divRound = function (num) {\n var dm = this.divmod(num);\n if (dm.mod.isZero()) return dm.div;\n var mod = dm.div.negative !== 0 ? dm.mod.isub(num) : dm.mod,\n half = num.ushrn(1),\n r2 = num.andln(1),\n cmp = mod.cmp(half);\n return cmp < 0 || (r2 === 1 && cmp === 0)\n ? dm.div\n : dm.div.negative !== 0\n ? dm.div.isubn(1)\n : dm.div.iaddn(1);\n }),\n (BN.prototype.modn = function (num) {\n assert(num <= 67108863);\n for (var p = (1 << 26) % num, acc = 0, i = this.length - 1; i >= 0; i--)\n acc = (p * acc + (this.words[i] | 0)) % num;\n return acc;\n }),\n (BN.prototype.idivn = function (num) {\n assert(num <= 67108863);\n for (var carry = 0, i = this.length - 1; i >= 0; i--) {\n var w = (this.words[i] | 0) + carry * 67108864;\n (this.words[i] = (w / num) | 0), (carry = w % num);\n }\n return this.strip();\n }),\n (BN.prototype.divn = function (num) {\n return this.clone().idivn(num);\n }),\n (BN.prototype.egcd = function (p) {\n assert(p.negative === 0), assert(!p.isZero());\n var x = this,\n y = p.clone();\n x.negative !== 0 ? (x = x.umod(p)) : (x = x.clone());\n for (var A = new BN(1), B = new BN(0), C = new BN(0), D = new BN(1), g = 0; x.isEven() && y.isEven(); )\n x.iushrn(1), y.iushrn(1), ++g;\n for (var yp = y.clone(), xp = x.clone(); !x.isZero(); ) {\n for (var i = 0, im = 1; (x.words[0] & im) === 0 && i < 26; ++i, im <<= 1);\n if (i > 0)\n for (x.iushrn(i); i-- > 0; )\n (A.isOdd() || B.isOdd()) && (A.iadd(yp), B.isub(xp)), A.iushrn(1), B.iushrn(1);\n for (var j = 0, jm = 1; (y.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n if (j > 0)\n for (y.iushrn(j); j-- > 0; )\n (C.isOdd() || D.isOdd()) && (C.iadd(yp), D.isub(xp)), C.iushrn(1), D.iushrn(1);\n x.cmp(y) >= 0 ? (x.isub(y), A.isub(C), B.isub(D)) : (y.isub(x), C.isub(A), D.isub(B));\n }\n return {\n a: C,\n b: D,\n gcd: y.iushln(g),\n };\n }),\n (BN.prototype._invmp = function (p) {\n assert(p.negative === 0), assert(!p.isZero());\n var a = this,\n b = p.clone();\n a.negative !== 0 ? (a = a.umod(p)) : (a = a.clone());\n for (var x1 = new BN(1), x2 = new BN(0), delta = b.clone(); 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) for (a.iushrn(i); i-- > 0; ) x1.isOdd() && x1.iadd(delta), x1.iushrn(1);\n for (var j = 0, jm = 1; (b.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n if (j > 0) for (b.iushrn(j); j-- > 0; ) x2.isOdd() && x2.iadd(delta), x2.iushrn(1);\n a.cmp(b) >= 0 ? (a.isub(b), x1.isub(x2)) : (b.isub(a), x2.isub(x1));\n }\n var res;\n return a.cmpn(1) === 0 ? (res = x1) : (res = x2), res.cmpn(0) < 0 && res.iadd(p), res;\n }),\n (BN.prototype.gcd = function (num) {\n if (this.isZero()) return num.abs();\n if (num.isZero()) return this.abs();\n var a = this.clone(),\n b = num.clone();\n (a.negative = 0), (b.negative = 0);\n for (var shift = 0; a.isEven() && b.isEven(); shift++) a.iushrn(1), b.iushrn(1);\n do {\n for (; a.isEven(); ) a.iushrn(1);\n for (; b.isEven(); ) b.iushrn(1);\n var r = a.cmp(b);\n if (r < 0) {\n var t = a;\n (a = b), (b = t);\n } else if (r === 0 || b.cmpn(1) === 0) break;\n a.isub(b);\n } while (!0);\n return b.iushln(shift);\n }),\n (BN.prototype.invm = function (num) {\n return this.egcd(num).a.umod(num);\n }),\n (BN.prototype.isEven = function () {\n return (this.words[0] & 1) === 0;\n }),\n (BN.prototype.isOdd = function () {\n return (this.words[0] & 1) === 1;\n }),\n (BN.prototype.andln = function (num) {\n return this.words[0] & num;\n }),\n (BN.prototype.bincn = function (bit) {\n assert(typeof bit == \"number\");\n var r = bit % 26,\n s = (bit - r) / 26,\n q = 1 << r;\n if (this.length <= s) return this._expand(s + 1), (this.words[s] |= q), this;\n for (var carry = q, i = s; carry !== 0 && i < this.length; i++) {\n var w = this.words[i] | 0;\n (w += carry), (carry = w >>> 26), (w &= 67108863), (this.words[i] = w);\n }\n return carry !== 0 && ((this.words[i] = carry), this.length++), this;\n }),\n (BN.prototype.isZero = function () {\n return this.length === 1 && this.words[0] === 0;\n }),\n (BN.prototype.cmpn = function (num) {\n var negative = num < 0;\n if (this.negative !== 0 && !negative) return -1;\n if (this.negative === 0 && negative) return 1;\n this.strip();\n var res;\n if (this.length > 1) res = 1;\n else {\n negative && (num = -num), assert(num <= 67108863, \"Number is too big\");\n var w = this.words[0] | 0;\n res = w === num ? 0 : w < num ? -1 : 1;\n }\n return this.negative !== 0 ? -res | 0 : res;\n }),\n (BN.prototype.cmp = function (num) {\n if (this.negative !== 0 && num.negative === 0) return -1;\n if (this.negative === 0 && num.negative !== 0) return 1;\n var res = this.ucmp(num);\n return this.negative !== 0 ? -res | 0 : res;\n }),\n (BN.prototype.ucmp = function (num) {\n if (this.length > num.length) return 1;\n if (this.length < num.length) return -1;\n for (var res = 0, i = this.length - 1; i >= 0; i--) {\n var a = this.words[i] | 0,\n b = num.words[i] | 0;\n if (a !== b) {\n a < b ? (res = -1) : a > b && (res = 1);\n break;\n }\n }\n return res;\n }),\n (BN.prototype.gtn = function (num) {\n return this.cmpn(num) === 1;\n }),\n (BN.prototype.gt = function (num) {\n return this.cmp(num) === 1;\n }),\n (BN.prototype.gten = function (num) {\n return this.cmpn(num) >= 0;\n }),\n (BN.prototype.gte = function (num) {\n return this.cmp(num) >= 0;\n }),\n (BN.prototype.ltn = function (num) {\n return this.cmpn(num) === -1;\n }),\n (BN.prototype.lt = function (num) {\n return this.cmp(num) === -1;\n }),\n (BN.prototype.lten = function (num) {\n return this.cmpn(num) <= 0;\n }),\n (BN.prototype.lte = function (num) {\n return this.cmp(num) <= 0;\n }),\n (BN.prototype.eqn = function (num) {\n return this.cmpn(num) === 0;\n }),\n (BN.prototype.eq = function (num) {\n return this.cmp(num) === 0;\n }),\n (BN.red = function (num) {\n return new Red(num);\n }),\n (BN.prototype.toRed = function (ctx) {\n return (\n assert(!this.red, \"Already a number in reduction context\"),\n assert(this.negative === 0, \"red works only with positives\"),\n ctx.convertTo(this)._forceRed(ctx)\n );\n }),\n (BN.prototype.fromRed = function () {\n return assert(this.red, \"fromRed works only with numbers in reduction context\"), this.red.convertFrom(this);\n }),\n (BN.prototype._forceRed = function (ctx) {\n return (this.red = ctx), this;\n }),\n (BN.prototype.forceRed = function (ctx) {\n return assert(!this.red, \"Already a number in reduction context\"), this._forceRed(ctx);\n }),\n (BN.prototype.redAdd = function (num) {\n return assert(this.red, \"redAdd works only with red numbers\"), this.red.add(this, num);\n }),\n (BN.prototype.redIAdd = function (num) {\n return assert(this.red, \"redIAdd works only with red numbers\"), this.red.iadd(this, num);\n }),\n (BN.prototype.redSub = function (num) {\n return assert(this.red, \"redSub works only with red numbers\"), this.red.sub(this, num);\n }),\n (BN.prototype.redISub = function (num) {\n return assert(this.red, \"redISub works only with red numbers\"), this.red.isub(this, num);\n }),\n (BN.prototype.redShl = function (num) {\n return assert(this.red, \"redShl works only with red numbers\"), this.red.shl(this, num);\n }),\n (BN.prototype.redMul = function (num) {\n return (\n assert(this.red, \"redMul works only with red numbers\"),\n this.red._verify2(this, num),\n this.red.mul(this, num)\n );\n }),\n (BN.prototype.redIMul = function (num) {\n return (\n assert(this.red, \"redMul works only with red numbers\"),\n this.red._verify2(this, num),\n this.red.imul(this, num)\n );\n }),\n (BN.prototype.redSqr = function () {\n return assert(this.red, \"redSqr works only with red numbers\"), this.red._verify1(this), this.red.sqr(this);\n }),\n (BN.prototype.redISqr = function () {\n return assert(this.red, \"redISqr works only with red numbers\"), this.red._verify1(this), this.red.isqr(this);\n }),\n (BN.prototype.redSqrt = function () {\n return assert(this.red, \"redSqrt works only with red numbers\"), this.red._verify1(this), this.red.sqrt(this);\n }),\n (BN.prototype.redInvm = function () {\n return assert(this.red, \"redInvm works only with red numbers\"), this.red._verify1(this), this.red.invm(this);\n }),\n (BN.prototype.redNeg = function () {\n return assert(this.red, \"redNeg works only with red numbers\"), this.red._verify1(this), this.red.neg(this);\n }),\n (BN.prototype.redPow = function (num) {\n return assert(this.red && !num.red, \"redPow(normalNum)\"), this.red._verify1(this), this.red.pow(this, num);\n });\n var primes = {\n k256: null,\n p224: null,\n p192: null,\n p25519: null,\n };\n function MPrime(name, p) {\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 (this.tmp = this._tmp());\n }\n (MPrime.prototype._tmp = function () {\n var tmp = new BN(null);\n return (tmp.words = new Array(Math.ceil(this.n / 13))), tmp;\n }),\n (MPrime.prototype.ireduce = function (num) {\n var r = num,\n rlen;\n do this.split(r, this.tmp), (r = this.imulK(r)), (r = r.iadd(this.tmp)), (rlen = r.bitLength());\n while (rlen > this.n);\n var cmp = rlen < this.n ? -1 : r.ucmp(this.p);\n return (\n cmp === 0\n ? ((r.words[0] = 0), (r.length = 1))\n : cmp > 0\n ? r.isub(this.p)\n : r.strip !== void 0\n ? r.strip()\n : r._strip(),\n r\n );\n }),\n (MPrime.prototype.split = function (input, out) {\n input.iushrn(this.n, 0, out);\n }),\n (MPrime.prototype.imulK = function (num) {\n return num.imul(this.k);\n });\n function K256() {\n MPrime.call(this, \"k256\", \"ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f\");\n }\n inherits(K256, MPrime),\n (K256.prototype.split = function (input, output) {\n for (var mask = 4194303, outLen = Math.min(input.length, 9), i = 0; i < outLen; i++)\n output.words[i] = input.words[i];\n if (((output.length = outLen), input.length <= 9)) {\n (input.words[0] = 0), (input.length = 1);\n return;\n }\n var prev = input.words[9];\n for (output.words[output.length++] = prev & mask, i = 10; i < input.length; i++) {\n var next = input.words[i] | 0;\n (input.words[i - 10] = ((next & mask) << 4) | (prev >>> 22)), (prev = next);\n }\n (prev >>>= 22),\n (input.words[i - 10] = prev),\n prev === 0 && input.length > 10 ? (input.length -= 10) : (input.length -= 9);\n }),\n (K256.prototype.imulK = function (num) {\n (num.words[num.length] = 0), (num.words[num.length + 1] = 0), (num.length += 2);\n for (var lo = 0, i = 0; i < num.length; i++) {\n var w = num.words[i] | 0;\n (lo += w * 977), (num.words[i] = lo & 67108863), (lo = w * 64 + ((lo / 67108864) | 0));\n }\n return (\n num.words[num.length - 1] === 0 && (num.length--, num.words[num.length - 1] === 0 && num.length--), num\n );\n });\n function P224() {\n MPrime.call(this, \"p224\", \"ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001\");\n }\n inherits(P224, MPrime);\n function P192() {\n MPrime.call(this, \"p192\", \"ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff\");\n }\n inherits(P192, MPrime);\n function P25519() {\n MPrime.call(this, \"25519\", \"7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed\");\n }\n inherits(P25519, MPrime),\n (P25519.prototype.imulK = function (num) {\n for (var carry = 0, i = 0; i < num.length; i++) {\n var hi = (num.words[i] | 0) * 19 + carry,\n lo = hi & 67108863;\n (hi >>>= 26), (num.words[i] = lo), (carry = hi);\n }\n return carry !== 0 && (num.words[num.length++] = carry), num;\n }),\n (BN._prime = function (name) {\n if (primes[name]) return primes[name];\n var prime2;\n if (name === \"k256\") prime2 = new K256();\n else if (name === \"p224\") prime2 = new P224();\n else if (name === \"p192\") prime2 = new P192();\n else if (name === \"p25519\") prime2 = new P25519();\n else throw new Error(\"Unknown prime \" + name);\n return (primes[name] = prime2), prime2;\n });\n function Red(m) {\n if (typeof m == \"string\") {\n var prime = BN._prime(m);\n (this.m = prime.p), (this.prime = prime);\n } else assert(m.gtn(1), \"modulus must be greater than 1\"), (this.m = m), (this.prime = null);\n }\n (Red.prototype._verify1 = function (a) {\n assert(a.negative === 0, \"red works only with positives\"), assert(a.red, \"red works only with red numbers\");\n }),\n (Red.prototype._verify2 = function (a, b) {\n assert((a.negative | b.negative) === 0, \"red works only with positives\"),\n assert(a.red && a.red === b.red, \"red works only with red numbers\");\n }),\n (Red.prototype.imod = function (a) {\n return this.prime ? this.prime.ireduce(a)._forceRed(this) : a.umod(this.m)._forceRed(this);\n }),\n (Red.prototype.neg = function (a) {\n return a.isZero() ? a.clone() : this.m.sub(a)._forceRed(this);\n }),\n (Red.prototype.add = function (a, b) {\n this._verify2(a, b);\n var res = a.add(b);\n return res.cmp(this.m) >= 0 && res.isub(this.m), res._forceRed(this);\n }),\n (Red.prototype.iadd = function (a, b) {\n this._verify2(a, b);\n var res = a.iadd(b);\n return res.cmp(this.m) >= 0 && res.isub(this.m), res;\n }),\n (Red.prototype.sub = function (a, b) {\n this._verify2(a, b);\n var res = a.sub(b);\n return res.cmpn(0) < 0 && res.iadd(this.m), res._forceRed(this);\n }),\n (Red.prototype.isub = function (a, b) {\n this._verify2(a, b);\n var res = a.isub(b);\n return res.cmpn(0) < 0 && res.iadd(this.m), res;\n }),\n (Red.prototype.shl = function (a, num) {\n return this._verify1(a), this.imod(a.ushln(num));\n }),\n (Red.prototype.imul = function (a, b) {\n return this._verify2(a, b), this.imod(a.imul(b));\n }),\n (Red.prototype.mul = function (a, b) {\n return this._verify2(a, b), this.imod(a.mul(b));\n }),\n (Red.prototype.isqr = function (a) {\n return this.imul(a, a.clone());\n }),\n (Red.prototype.sqr = function (a) {\n return this.mul(a, a);\n }),\n (Red.prototype.sqrt = function (a) {\n if (a.isZero()) return a.clone();\n var mod3 = this.m.andln(3);\n if ((assert(mod3 % 2 === 1), mod3 === 3)) {\n var pow = this.m.add(new BN(1)).iushrn(2);\n return this.pow(a, pow);\n }\n for (var q = this.m.subn(1), s = 0; !q.isZero() && q.andln(1) === 0; ) s++, q.iushrn(1);\n assert(!q.isZero());\n var one = new BN(1).toRed(this),\n nOne = one.redNeg(),\n lpow = this.m.subn(1).iushrn(1),\n z = this.m.bitLength();\n for (z = new BN(2 * z * z).toRed(this); this.pow(z, lpow).cmp(nOne) !== 0; ) z.redIAdd(nOne);\n for (\n var c = this.pow(z, q), r = this.pow(a, q.addn(1).iushrn(1)), t = this.pow(a, q), m = s;\n t.cmp(one) !== 0;\n\n ) {\n for (var tmp = t, i = 0; tmp.cmp(one) !== 0; i++) tmp = tmp.redSqr();\n assert(i < m);\n var b = this.pow(c, new BN(1).iushln(m - i - 1));\n (r = r.redMul(b)), (c = b.redSqr()), (t = t.redMul(c)), (m = i);\n }\n return r;\n }),\n (Red.prototype.invm = function (a) {\n var inv = a._invmp(this.m);\n return inv.negative !== 0 ? ((inv.negative = 0), this.imod(inv).redNeg()) : this.imod(inv);\n }),\n (Red.prototype.pow = function (a, num) {\n if (num.isZero()) return new BN(1).toRed(this);\n if (num.cmpn(1) === 0) return a.clone();\n var windowSize = 4,\n wnd = new Array(1 << windowSize);\n (wnd[0] = new BN(1).toRed(this)), (wnd[1] = a);\n for (var i = 2; i < wnd.length; i++) wnd[i] = this.mul(wnd[i - 1], a);\n var res = wnd[0],\n current = 0,\n currentLen = 0,\n start = num.bitLength() % 26;\n for (start === 0 && (start = 26), i = num.length - 1; i >= 0; i--) {\n for (var word = num.words[i], j = start - 1; j >= 0; j--) {\n var bit = (word >> j) & 1;\n if ((res !== wnd[0] && (res = this.sqr(res)), bit === 0 && current === 0)) {\n currentLen = 0;\n continue;\n }\n (current <<= 1),\n (current |= bit),\n currentLen++,\n !(currentLen !== windowSize && (i !== 0 || j !== 0)) &&\n ((res = this.mul(res, wnd[current])), (currentLen = 0), (current = 0));\n }\n start = 26;\n }\n return res;\n }),\n (Red.prototype.convertTo = function (num) {\n var r = num.umod(this.m);\n return r === num ? r.clone() : r;\n }),\n (Red.prototype.convertFrom = function (num) {\n var res = num.clone();\n return (res.red = null), res;\n }),\n (BN.mont = function (num) {\n return new Mont(num);\n });\n function Mont(m) {\n Red.call(this, m),\n (this.shift = this.m.bitLength()),\n this.shift % 26 !== 0 && (this.shift += 26 - (this.shift % 26)),\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 (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 (Mont.prototype.convertTo = function (num) {\n return this.imod(num.ushln(this.shift));\n }),\n (Mont.prototype.convertFrom = function (num) {\n var r = this.imod(num.mul(this.rinv));\n return (r.red = null), r;\n }),\n (Mont.prototype.imul = function (a, b) {\n if (a.isZero() || b.isZero()) return (a.words[0] = 0), (a.length = 1), a;\n var t = a.imul(b),\n c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m),\n u = t.isub(c).iushrn(this.shift),\n res = u;\n return (\n u.cmp(this.m) >= 0 ? (res = u.isub(this.m)) : u.cmpn(0) < 0 && (res = u.iadd(this.m)), res._forceRed(this)\n );\n }),\n (Mont.prototype.mul = function (a, b) {\n if (a.isZero() || b.isZero()) return new BN(0)._forceRed(this);\n var t = a.mul(b),\n c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m),\n u = t.isub(c).iushrn(this.shift),\n res = u;\n return (\n u.cmp(this.m) >= 0 ? (res = u.isub(this.m)) : u.cmpn(0) < 0 && (res = u.iadd(this.m)), res._forceRed(this)\n );\n }),\n (Mont.prototype.invm = function (a) {\n var res = this.imod(a._invmp(this.m).mul(this.r2));\n return res._forceRed(this);\n });\n })(typeof module > \"u\" || module, exports);\n },\n});\n\n// node_modules/safer-buffer/safer.js\nvar require_safer = __commonJS({\n \"node_modules/safer-buffer/safer.js\"(exports, module) {\n \"use strict\";\n var buffer = __require(\"buffer\"),\n Buffer2 = buffer.Buffer,\n safer = {},\n key;\n for (key in buffer)\n !buffer.hasOwnProperty(key) || key === \"SlowBuffer\" || key === \"Buffer\" || (safer[key] = buffer[key]);\n var Safer = (safer.Buffer = {});\n for (key in Buffer2)\n !Buffer2.hasOwnProperty(key) || key === \"allocUnsafe\" || key === \"allocUnsafeSlow\" || (Safer[key] = Buffer2[key]);\n safer.Buffer.prototype = Buffer2.prototype;\n (!Safer.from || Safer.from === Uint8Array.from) &&\n (Safer.from = function (value, encodingOrOffset, length) {\n if (typeof value == \"number\")\n throw new TypeError('The \"value\" argument must not be of type number. Received type ' + typeof value);\n if (value && typeof value.length > \"u\")\n throw new TypeError(\n \"The first argument must be one of type string, Buffer, ArrayBuffer, Array, or Array-like Object. Received type \" +\n typeof value,\n );\n return Buffer2(value, encodingOrOffset, length);\n });\n Safer.alloc ||\n (Safer.alloc = function (size, fill, encoding) {\n if (typeof size != \"number\")\n throw new TypeError('The \"size\" argument must be of type number. Received type ' + typeof size);\n if (size < 0 || size >= 2 * (1 << 30))\n throw new RangeError('The value \"' + size + '\" is invalid for option \"size\"');\n var buf = Buffer2(size);\n return (\n !fill || fill.length === 0\n ? buf.fill(0)\n : typeof encoding == \"string\"\n ? buf.fill(fill, encoding)\n : buf.fill(fill),\n buf\n );\n });\n if (!safer.kStringMaxLength)\n try {\n safer.kStringMaxLength = MAX_STRING_LENGTH;\n } catch {}\n safer.constants ||\n ((safer.constants = {\n MAX_LENGTH: safer.kMaxLength,\n }),\n safer.kStringMaxLength && (safer.constants.MAX_STRING_LENGTH = safer.kStringMaxLength));\n module.exports = safer;\n },\n});\n\n// node_modules/asn1.js/lib/asn1/base/reporter.js\nvar require_reporter = __commonJS({\n \"node_modules/asn1.js/lib/asn1/base/reporter.js\"(exports) {\n \"use strict\";\n var inherits = require_inherits_browser();\n function Reporter(options) {\n this._reporterState = {\n obj: null,\n path: [],\n options: options || {},\n errors: [],\n };\n }\n exports.Reporter = Reporter;\n Reporter.prototype.isError = function (obj) {\n return obj instanceof ReporterError;\n };\n Reporter.prototype.save = function () {\n let state = this._reporterState;\n return { obj: state.obj, pathLen: state.path.length };\n };\n Reporter.prototype.restore = function (data) {\n let state = this._reporterState;\n (state.obj = data.obj), (state.path = state.path.slice(0, data.pathLen));\n };\n Reporter.prototype.enterKey = function (key) {\n return this._reporterState.path.push(key);\n };\n Reporter.prototype.exitKey = function (index) {\n let state = this._reporterState;\n state.path = state.path.slice(0, index - 1);\n };\n Reporter.prototype.leaveKey = function (index, key, value) {\n let state = this._reporterState;\n this.exitKey(index), state.obj !== null && (state.obj[key] = value);\n };\n Reporter.prototype.path = function () {\n return this._reporterState.path.join(\"/\");\n };\n Reporter.prototype.enterObject = function () {\n let state = this._reporterState,\n prev = state.obj;\n return (state.obj = {}), prev;\n };\n Reporter.prototype.leaveObject = function (prev) {\n let state = this._reporterState,\n now = state.obj;\n return (state.obj = prev), now;\n };\n Reporter.prototype.error = function (msg) {\n let err,\n state = this._reporterState,\n inherited = msg instanceof ReporterError;\n if (\n (inherited\n ? (err = msg)\n : (err = new ReporterError(\n state.path\n .map(function (elem) {\n return \"[\" + JSON.stringify(elem) + \"]\";\n })\n .join(\"\"),\n msg.message || msg,\n msg.stack,\n )),\n !state.options.partial)\n )\n throw err;\n return inherited || state.errors.push(err), err;\n };\n Reporter.prototype.wrapResult = function (result) {\n let state = this._reporterState;\n return state.options.partial\n ? {\n result: this.isError(result) ? null : result,\n errors: state.errors,\n }\n : result;\n };\n function ReporterError(path, msg) {\n (this.path = path), this.rethrow(msg);\n }\n inherits(ReporterError, Error);\n ReporterError.prototype.rethrow = function (msg) {\n if (\n ((this.message = msg + \" at: \" + (this.path || \"(shallow)\")),\n Error.captureStackTrace && Error.captureStackTrace(this, ReporterError),\n !this.stack)\n )\n try {\n throw new Error(this.message);\n } catch (e) {\n this.stack = e.stack;\n }\n return this;\n };\n },\n});\n\n// node_modules/asn1.js/lib/asn1/base/buffer.js\nvar require_buffer = __commonJS({\n \"node_modules/asn1.js/lib/asn1/base/buffer.js\"(exports) {\n \"use strict\";\n var inherits = require_inherits_browser(),\n Reporter = require_reporter().Reporter,\n Buffer2 = require_safer().Buffer;\n function DecoderBuffer(base, options) {\n if ((Reporter.call(this, options), !Buffer2.isBuffer(base))) {\n this.error(\"Input not Buffer\");\n return;\n }\n (this.base = base), (this.offset = 0), (this.length = base.length);\n }\n inherits(DecoderBuffer, Reporter);\n exports.DecoderBuffer = DecoderBuffer;\n DecoderBuffer.isDecoderBuffer = function (data) {\n return data instanceof DecoderBuffer\n ? !0\n : typeof data == \"object\" &&\n Buffer2.isBuffer(data.base) &&\n data.constructor.name === \"DecoderBuffer\" &&\n typeof data.offset == \"number\" &&\n typeof data.length == \"number\" &&\n typeof data.save == \"function\" &&\n typeof data.restore == \"function\" &&\n typeof data.isEmpty == \"function\" &&\n typeof data.readUInt8 == \"function\" &&\n typeof data.skip == \"function\" &&\n typeof data.raw == \"function\";\n };\n DecoderBuffer.prototype.save = function () {\n return {\n offset: this.offset,\n reporter: Reporter.prototype.save.call(this),\n };\n };\n DecoderBuffer.prototype.restore = function (save) {\n let res = new DecoderBuffer(this.base);\n return (\n (res.offset = save.offset),\n (res.length = this.offset),\n (this.offset = save.offset),\n Reporter.prototype.restore.call(this, save.reporter),\n res\n );\n };\n DecoderBuffer.prototype.isEmpty = function () {\n return this.offset === this.length;\n };\n DecoderBuffer.prototype.readUInt8 = function (fail) {\n return this.offset + 1 <= this.length\n ? this.base.readUInt8(this.offset++, !0)\n : this.error(fail || \"DecoderBuffer overrun\");\n };\n DecoderBuffer.prototype.skip = function (bytes, fail) {\n if (!(this.offset + bytes <= this.length)) return this.error(fail || \"DecoderBuffer overrun\");\n let res = new DecoderBuffer(this.base);\n return (\n (res._reporterState = this._reporterState),\n (res.offset = this.offset),\n (res.length = this.offset + bytes),\n (this.offset += bytes),\n res\n );\n };\n DecoderBuffer.prototype.raw = function (save) {\n return this.base.slice(save ? save.offset : this.offset, this.length);\n };\n function EncoderBuffer(value, reporter) {\n if (Array.isArray(value))\n (this.length = 0),\n (this.value = value.map(function (item) {\n return (\n EncoderBuffer.isEncoderBuffer(item) || (item = new EncoderBuffer(item, reporter)),\n (this.length += item.length),\n item\n );\n }, this));\n else if (typeof value == \"number\") {\n if (!(0 <= value && value <= 255)) return reporter.error(\"non-byte EncoderBuffer value\");\n (this.value = value), (this.length = 1);\n } else if (typeof value == \"string\") (this.value = value), (this.length = Buffer2.byteLength(value));\n else if (Buffer2.isBuffer(value)) (this.value = value), (this.length = value.length);\n else return reporter.error(\"Unsupported type: \" + typeof value);\n }\n exports.EncoderBuffer = EncoderBuffer;\n EncoderBuffer.isEncoderBuffer = function (data) {\n return data instanceof EncoderBuffer\n ? !0\n : typeof data == \"object\" &&\n data.constructor.name === \"EncoderBuffer\" &&\n typeof data.length == \"number\" &&\n typeof data.join == \"function\";\n };\n EncoderBuffer.prototype.join = function (out, offset) {\n return (\n out || (out = Buffer2.alloc(this.length)),\n offset || (offset = 0),\n this.length === 0 ||\n (Array.isArray(this.value)\n ? this.value.forEach(function (item) {\n item.join(out, offset), (offset += item.length);\n })\n : (typeof this.value == \"number\"\n ? (out[offset] = this.value)\n : typeof this.value == \"string\"\n ? out.write(this.value, offset)\n : Buffer2.isBuffer(this.value) && this.value.copy(out, offset),\n (offset += this.length))),\n out\n );\n };\n },\n});\n\n// node_modules/asn1.js/lib/asn1/base/node.js\nvar require_node = __commonJS({\n \"node_modules/asn1.js/lib/asn1/base/node.js\"(exports, module) {\n \"use strict\";\n var Reporter = require_reporter().Reporter,\n EncoderBuffer = require_buffer().EncoderBuffer,\n DecoderBuffer = require_buffer().DecoderBuffer,\n assert = require_minimalistic_assert(),\n tags = [\n \"seq\",\n \"seqof\",\n \"set\",\n \"setof\",\n \"objid\",\n \"bool\",\n \"gentime\",\n \"utctime\",\n \"null_\",\n \"enum\",\n \"int\",\n \"objDesc\",\n \"bitstr\",\n \"bmpstr\",\n \"charstr\",\n \"genstr\",\n \"graphstr\",\n \"ia5str\",\n \"iso646str\",\n \"numstr\",\n \"octstr\",\n \"printstr\",\n \"t61str\",\n \"unistr\",\n \"utf8str\",\n \"videostr\",\n ],\n methods = [\"key\", \"obj\", \"use\", \"optional\", \"explicit\", \"implicit\", \"def\", \"choice\", \"any\", \"contains\"].concat(\n tags,\n ),\n overrided = [\n \"_peekTag\",\n \"_decodeTag\",\n \"_use\",\n \"_decodeStr\",\n \"_decodeObjid\",\n \"_decodeTime\",\n \"_decodeNull\",\n \"_decodeInt\",\n \"_decodeBool\",\n \"_decodeList\",\n \"_encodeComposite\",\n \"_encodeStr\",\n \"_encodeObjid\",\n \"_encodeTime\",\n \"_encodeNull\",\n \"_encodeInt\",\n \"_encodeBool\",\n ];\n function Node(enc, parent, name) {\n let state = {};\n (this._baseState = state),\n (state.name = name),\n (state.enc = enc),\n (state.parent = parent || null),\n (state.children = null),\n (state.tag = null),\n (state.args = null),\n (state.reverseArgs = null),\n (state.choice = null),\n (state.optional = !1),\n (state.any = !1),\n (state.obj = !1),\n (state.use = null),\n (state.useDecoder = null),\n (state.key = null),\n (state.default = null),\n (state.explicit = null),\n (state.implicit = null),\n (state.contains = null),\n state.parent || ((state.children = []), this._wrap());\n }\n module.exports = Node;\n var stateProps = [\n \"enc\",\n \"parent\",\n \"children\",\n \"tag\",\n \"args\",\n \"reverseArgs\",\n \"choice\",\n \"optional\",\n \"any\",\n \"obj\",\n \"use\",\n \"alteredUse\",\n \"key\",\n \"default\",\n \"explicit\",\n \"implicit\",\n \"contains\",\n ];\n Node.prototype.clone = function () {\n let state = this._baseState,\n cstate = {};\n stateProps.forEach(function (prop) {\n cstate[prop] = state[prop];\n });\n let res = new this.constructor(cstate.parent);\n return (res._baseState = cstate), res;\n };\n Node.prototype._wrap = function () {\n let state = this._baseState;\n methods.forEach(function (method) {\n this[method] = function () {\n let clone = new this.constructor(this);\n return state.children.push(clone), clone[method].apply(clone, arguments);\n };\n }, this);\n };\n Node.prototype._init = function (body) {\n let state = this._baseState;\n assert(state.parent === null),\n body.call(this),\n (state.children = state.children.filter(function (child) {\n return child._baseState.parent === this;\n }, this)),\n assert.equal(state.children.length, 1, \"Root node can have only one child\");\n };\n Node.prototype._useArgs = function (args) {\n let state = this._baseState,\n children = args.filter(function (arg) {\n return arg instanceof this.constructor;\n }, this);\n (args = args.filter(function (arg) {\n return !(arg instanceof this.constructor);\n }, this)),\n children.length !== 0 &&\n (assert(state.children === null),\n (state.children = children),\n children.forEach(function (child) {\n child._baseState.parent = this;\n }, this)),\n args.length !== 0 &&\n (assert(state.args === null),\n (state.args = args),\n (state.reverseArgs = args.map(function (arg) {\n if (typeof arg != \"object\" || arg.constructor !== Object) return arg;\n let res = {};\n return (\n Object.keys(arg).forEach(function (key) {\n key == (key | 0) && (key |= 0);\n let value = arg[key];\n res[value] = key;\n }),\n res\n );\n })));\n };\n overrided.forEach(function (method) {\n Node.prototype[method] = function () {\n let state = this._baseState;\n throw new Error(method + \" not implemented for encoding: \" + state.enc);\n };\n });\n tags.forEach(function (tag) {\n Node.prototype[tag] = function () {\n let state = this._baseState,\n args = Array.prototype.slice.call(arguments);\n return assert(state.tag === null), (state.tag = tag), this._useArgs(args), this;\n };\n });\n Node.prototype.use = function (item) {\n assert(item);\n let state = this._baseState;\n return assert(state.use === null), (state.use = item), this;\n };\n Node.prototype.optional = function () {\n let state = this._baseState;\n return (state.optional = !0), this;\n };\n Node.prototype.def = function (val) {\n let state = this._baseState;\n return assert(state.default === null), (state.default = val), (state.optional = !0), this;\n };\n Node.prototype.explicit = function (num) {\n let state = this._baseState;\n return assert(state.explicit === null && state.implicit === null), (state.explicit = num), this;\n };\n Node.prototype.implicit = function (num) {\n let state = this._baseState;\n return assert(state.explicit === null && state.implicit === null), (state.implicit = num), this;\n };\n Node.prototype.obj = function () {\n let state = this._baseState,\n args = Array.prototype.slice.call(arguments);\n return (state.obj = !0), args.length !== 0 && this._useArgs(args), this;\n };\n Node.prototype.key = function (newKey) {\n let state = this._baseState;\n return assert(state.key === null), (state.key = newKey), this;\n };\n Node.prototype.any = function () {\n let state = this._baseState;\n return (state.any = !0), this;\n };\n Node.prototype.choice = function (obj) {\n let state = this._baseState;\n return (\n assert(state.choice === null),\n (state.choice = obj),\n this._useArgs(\n Object.keys(obj).map(function (key) {\n return obj[key];\n }),\n ),\n this\n );\n };\n Node.prototype.contains = function (item) {\n let state = this._baseState;\n return assert(state.use === null), (state.contains = item), this;\n };\n Node.prototype._decode = function (input, options) {\n let state = this._baseState;\n if (state.parent === null) return input.wrapResult(state.children[0]._decode(input, options));\n let result = state.default,\n present = !0,\n prevKey = null;\n if ((state.key !== null && (prevKey = input.enterKey(state.key)), state.optional)) {\n let tag = null;\n if (\n (state.explicit !== null\n ? (tag = state.explicit)\n : state.implicit !== null\n ? (tag = state.implicit)\n : state.tag !== null && (tag = state.tag),\n tag === null && !state.any)\n ) {\n let save = input.save();\n try {\n state.choice === null ? this._decodeGeneric(state.tag, input, options) : this._decodeChoice(input, options),\n (present = !0);\n } catch {\n present = !1;\n }\n input.restore(save);\n } else if (((present = this._peekTag(input, tag, state.any)), input.isError(present))) return present;\n }\n let prevObj;\n if ((state.obj && present && (prevObj = input.enterObject()), present)) {\n if (state.explicit !== null) {\n let explicit = this._decodeTag(input, state.explicit);\n if (input.isError(explicit)) return explicit;\n input = explicit;\n }\n let start = input.offset;\n if (state.use === null && state.choice === null) {\n let save;\n state.any && (save = input.save());\n let body = this._decodeTag(input, state.implicit !== null ? state.implicit : state.tag, state.any);\n if (input.isError(body)) return body;\n state.any ? (result = input.raw(save)) : (input = body);\n }\n if (\n (options && options.track && state.tag !== null && options.track(input.path(), start, input.length, \"tagged\"),\n options &&\n options.track &&\n state.tag !== null &&\n options.track(input.path(), input.offset, input.length, \"content\"),\n state.any ||\n (state.choice === null\n ? (result = this._decodeGeneric(state.tag, input, options))\n : (result = this._decodeChoice(input, options))),\n input.isError(result))\n )\n return result;\n if (\n (!state.any &&\n state.choice === null &&\n state.children !== null &&\n state.children.forEach(function (child) {\n child._decode(input, options);\n }),\n state.contains && (state.tag === \"octstr\" || state.tag === \"bitstr\"))\n ) {\n let data = new DecoderBuffer(result);\n result = this._getUse(state.contains, input._reporterState.obj)._decode(data, options);\n }\n }\n return (\n state.obj && present && (result = input.leaveObject(prevObj)),\n state.key !== null && (result !== null || present === !0)\n ? input.leaveKey(prevKey, state.key, result)\n : prevKey !== null && input.exitKey(prevKey),\n result\n );\n };\n Node.prototype._decodeGeneric = function (tag, input, options) {\n let state = this._baseState;\n return tag === \"seq\" || tag === \"set\"\n ? null\n : tag === \"seqof\" || tag === \"setof\"\n ? this._decodeList(input, tag, state.args[0], options)\n : /str$/.test(tag)\n ? this._decodeStr(input, tag, options)\n : tag === \"objid\" && state.args\n ? this._decodeObjid(input, state.args[0], state.args[1], options)\n : tag === \"objid\"\n ? this._decodeObjid(input, null, null, options)\n : tag === \"gentime\" || tag === \"utctime\"\n ? this._decodeTime(input, tag, options)\n : tag === \"null_\"\n ? this._decodeNull(input, options)\n : tag === \"bool\"\n ? this._decodeBool(input, options)\n : tag === \"objDesc\"\n ? this._decodeStr(input, tag, options)\n : tag === \"int\" || tag === \"enum\"\n ? this._decodeInt(input, state.args && state.args[0], options)\n : state.use !== null\n ? this._getUse(state.use, input._reporterState.obj)._decode(input, options)\n : input.error(\"unknown tag: \" + tag);\n };\n Node.prototype._getUse = function (entity, obj) {\n let state = this._baseState;\n return (\n (state.useDecoder = this._use(entity, obj)),\n assert(state.useDecoder._baseState.parent === null),\n (state.useDecoder = state.useDecoder._baseState.children[0]),\n state.implicit !== state.useDecoder._baseState.implicit &&\n ((state.useDecoder = state.useDecoder.clone()), (state.useDecoder._baseState.implicit = state.implicit)),\n state.useDecoder\n );\n };\n Node.prototype._decodeChoice = function (input, options) {\n let state = this._baseState,\n result = null,\n match = !1;\n return (\n Object.keys(state.choice).some(function (key) {\n let save = input.save(),\n node = state.choice[key];\n try {\n let value = node._decode(input, options);\n if (input.isError(value)) return !1;\n (result = { type: key, value }), (match = !0);\n } catch {\n return input.restore(save), !1;\n }\n return !0;\n }, this),\n match ? result : input.error(\"Choice not matched\")\n );\n };\n Node.prototype._createEncoderBuffer = function (data) {\n return new EncoderBuffer(data, this.reporter);\n };\n Node.prototype._encode = function (data, reporter, parent) {\n let state = this._baseState;\n if (state.default !== null && state.default === data) return;\n let result = this._encodeValue(data, reporter, parent);\n if (result !== void 0 && !this._skipDefault(result, reporter, parent)) return result;\n };\n Node.prototype._encodeValue = function (data, reporter, parent) {\n let state = this._baseState;\n if (state.parent === null) return state.children[0]._encode(data, reporter || new Reporter());\n let result = null;\n if (((this.reporter = reporter), state.optional && data === void 0))\n if (state.default !== null) data = state.default;\n else return;\n let content = null,\n primitive = !1;\n if (state.any) result = this._createEncoderBuffer(data);\n else if (state.choice) result = this._encodeChoice(data, reporter);\n else if (state.contains)\n (content = this._getUse(state.contains, parent)._encode(data, reporter)), (primitive = !0);\n else if (state.children)\n (content = state.children\n .map(function (child) {\n if (child._baseState.tag === \"null_\") return child._encode(null, reporter, data);\n if (child._baseState.key === null) return reporter.error(\"Child should have a key\");\n let prevKey = reporter.enterKey(child._baseState.key);\n if (typeof data != \"object\") return reporter.error(\"Child expected, but input is not object\");\n let res = child._encode(data[child._baseState.key], reporter, data);\n return reporter.leaveKey(prevKey), res;\n }, this)\n .filter(function (child) {\n return child;\n })),\n (content = this._createEncoderBuffer(content));\n else if (state.tag === \"seqof\" || state.tag === \"setof\") {\n if (!(state.args && state.args.length === 1)) return reporter.error(\"Too many args for : \" + state.tag);\n if (!Array.isArray(data)) return reporter.error(\"seqof/setof, but data is not Array\");\n let child = this.clone();\n (child._baseState.implicit = null),\n (content = this._createEncoderBuffer(\n data.map(function (item) {\n let state2 = this._baseState;\n return this._getUse(state2.args[0], data)._encode(item, reporter);\n }, child),\n ));\n } else\n state.use !== null\n ? (result = this._getUse(state.use, parent)._encode(data, reporter))\n : ((content = this._encodePrimitive(state.tag, data)), (primitive = !0));\n if (!state.any && state.choice === null) {\n let tag = state.implicit !== null ? state.implicit : state.tag,\n cls = state.implicit === null ? \"universal\" : \"context\";\n tag === null\n ? state.use === null && reporter.error(\"Tag could be omitted only for .use()\")\n : state.use === null && (result = this._encodeComposite(tag, primitive, cls, content));\n }\n return state.explicit !== null && (result = this._encodeComposite(state.explicit, !1, \"context\", result)), result;\n };\n Node.prototype._encodeChoice = function (data, reporter) {\n let state = this._baseState,\n node = state.choice[data.type];\n return (\n node || assert(!1, data.type + \" not found in \" + JSON.stringify(Object.keys(state.choice))),\n node._encode(data.value, reporter)\n );\n };\n Node.prototype._encodePrimitive = function (tag, data) {\n let state = this._baseState;\n if (/str$/.test(tag)) return this._encodeStr(data, tag);\n if (tag === \"objid\" && state.args) return this._encodeObjid(data, state.reverseArgs[0], state.args[1]);\n if (tag === \"objid\") return this._encodeObjid(data, null, null);\n if (tag === \"gentime\" || tag === \"utctime\") return this._encodeTime(data, tag);\n if (tag === \"null_\") return this._encodeNull();\n if (tag === \"int\" || tag === \"enum\") return this._encodeInt(data, state.args && state.reverseArgs[0]);\n if (tag === \"bool\") return this._encodeBool(data);\n if (tag === \"objDesc\") return this._encodeStr(data, tag);\n throw new Error(\"Unsupported tag: \" + tag);\n };\n Node.prototype._isNumstr = function (str) {\n return /^[0-9 ]*$/.test(str);\n };\n Node.prototype._isPrintstr = function (str) {\n return /^[A-Za-z0-9 '()+,-./:=?]*$/.test(str);\n };\n },\n});\n\n// node_modules/asn1.js/lib/asn1/constants/der.js\nvar require_der = __commonJS({\n \"node_modules/asn1.js/lib/asn1/constants/der.js\"(exports) {\n \"use strict\";\n function reverse(map) {\n let res = {};\n return (\n Object.keys(map).forEach(function (key) {\n (key | 0) == key && (key = key | 0);\n let value = map[key];\n res[value] = key;\n }),\n res\n );\n }\n exports.tagClass = {\n 0: \"universal\",\n 1: \"application\",\n 2: \"context\",\n 3: \"private\",\n };\n exports.tagClassByName = reverse(exports.tagClass);\n exports.tag = {\n 0: \"end\",\n 1: \"bool\",\n 2: \"int\",\n 3: \"bitstr\",\n 4: \"octstr\",\n 5: \"null_\",\n 6: \"objid\",\n 7: \"objDesc\",\n 8: \"external\",\n 9: \"real\",\n 10: \"enum\",\n 11: \"embed\",\n 12: \"utf8str\",\n 13: \"relativeOid\",\n 16: \"seq\",\n 17: \"set\",\n 18: \"numstr\",\n 19: \"printstr\",\n 20: \"t61str\",\n 21: \"videostr\",\n 22: \"ia5str\",\n 23: \"utctime\",\n 24: \"gentime\",\n 25: \"graphstr\",\n 26: \"iso646str\",\n 27: \"genstr\",\n 28: \"unistr\",\n 29: \"charstr\",\n 30: \"bmpstr\",\n };\n exports.tagByName = reverse(exports.tag);\n },\n});\n\n// node_modules/asn1.js/lib/asn1/encoders/der.js\nvar require_der2 = __commonJS({\n \"node_modules/asn1.js/lib/asn1/encoders/der.js\"(exports, module) {\n \"use strict\";\n var inherits = require_inherits_browser(),\n Buffer2 = require_safer().Buffer,\n Node = require_node(),\n der = require_der();\n function DEREncoder(entity) {\n (this.enc = \"der\"),\n (this.name = entity.name),\n (this.entity = entity),\n (this.tree = new DERNode()),\n this.tree._init(entity.body);\n }\n module.exports = DEREncoder;\n DEREncoder.prototype.encode = function (data, reporter) {\n return this.tree._encode(data, reporter).join();\n };\n function DERNode(parent) {\n Node.call(this, \"der\", parent);\n }\n inherits(DERNode, Node);\n DERNode.prototype._encodeComposite = function (tag, primitive, cls, content) {\n let encodedTag = encodeTag(tag, primitive, cls, this.reporter);\n if (content.length < 128) {\n let header2 = Buffer2.alloc(2);\n return (header2[0] = encodedTag), (header2[1] = content.length), this._createEncoderBuffer([header2, content]);\n }\n let lenOctets = 1;\n for (let i = content.length; i >= 256; i >>= 8) lenOctets++;\n let header = Buffer2.alloc(1 + 1 + lenOctets);\n (header[0] = encodedTag), (header[1] = 128 | lenOctets);\n for (let i = 1 + lenOctets, j = content.length; j > 0; i--, j >>= 8) header[i] = j & 255;\n return this._createEncoderBuffer([header, content]);\n };\n DERNode.prototype._encodeStr = function (str, tag) {\n if (tag === \"bitstr\") return this._createEncoderBuffer([str.unused | 0, str.data]);\n if (tag === \"bmpstr\") {\n let buf = Buffer2.alloc(str.length * 2);\n for (let i = 0; i < str.length; i++) buf.writeUInt16BE(str.charCodeAt(i), i * 2);\n return this._createEncoderBuffer(buf);\n } else\n return tag === \"numstr\"\n ? this._isNumstr(str)\n ? this._createEncoderBuffer(str)\n : this.reporter.error(\"Encoding of string type: numstr supports only digits and space\")\n : tag === \"printstr\"\n ? this._isPrintstr(str)\n ? this._createEncoderBuffer(str)\n : this.reporter.error(\n \"Encoding of string type: printstr supports only latin upper and lower case letters, digits, space, apostrophe, left and rigth parenthesis, plus sign, comma, hyphen, dot, slash, colon, equal sign, question mark\",\n )\n : /str$/.test(tag)\n ? this._createEncoderBuffer(str)\n : tag === \"objDesc\"\n ? this._createEncoderBuffer(str)\n : this.reporter.error(\"Encoding of string type: \" + tag + \" unsupported\");\n };\n DERNode.prototype._encodeObjid = function (id, values, relative) {\n if (typeof id == \"string\") {\n if (!values) return this.reporter.error(\"string objid given, but no values map found\");\n if (!values.hasOwnProperty(id)) return this.reporter.error(\"objid not found in values map\");\n id = values[id].split(/[\\s.]+/g);\n for (let i = 0; i < id.length; i++) id[i] |= 0;\n } else if (Array.isArray(id)) {\n id = id.slice();\n for (let i = 0; i < id.length; i++) id[i] |= 0;\n }\n if (!Array.isArray(id))\n return this.reporter.error(\"objid() should be either array or string, got: \" + JSON.stringify(id));\n if (!relative) {\n if (id[1] >= 40) return this.reporter.error(\"Second objid identifier OOB\");\n id.splice(0, 2, id[0] * 40 + id[1]);\n }\n let size = 0;\n for (let i = 0; i < id.length; i++) {\n let ident = id[i];\n for (size++; ident >= 128; ident >>= 7) size++;\n }\n let objid = Buffer2.alloc(size),\n offset = objid.length - 1;\n for (let i = id.length - 1; i >= 0; i--) {\n let ident = id[i];\n for (objid[offset--] = ident & 127; (ident >>= 7) > 0; ) objid[offset--] = 128 | (ident & 127);\n }\n return this._createEncoderBuffer(objid);\n };\n function two(num) {\n return num < 10 ? \"0\" + num : num;\n }\n DERNode.prototype._encodeTime = function (time, tag) {\n let str,\n date = new Date(time);\n return (\n tag === \"gentime\"\n ? (str = [\n two(date.getUTCFullYear()),\n two(date.getUTCMonth() + 1),\n two(date.getUTCDate()),\n two(date.getUTCHours()),\n two(date.getUTCMinutes()),\n two(date.getUTCSeconds()),\n \"Z\",\n ].join(\"\"))\n : tag === \"utctime\"\n ? (str = [\n two(date.getUTCFullYear() % 100),\n two(date.getUTCMonth() + 1),\n two(date.getUTCDate()),\n two(date.getUTCHours()),\n two(date.getUTCMinutes()),\n two(date.getUTCSeconds()),\n \"Z\",\n ].join(\"\"))\n : this.reporter.error(\"Encoding \" + tag + \" time is not supported yet\"),\n this._encodeStr(str, \"octstr\")\n );\n };\n DERNode.prototype._encodeNull = function () {\n return this._createEncoderBuffer(\"\");\n };\n DERNode.prototype._encodeInt = function (num, values) {\n if (typeof num == \"string\") {\n if (!values) return this.reporter.error(\"String int or enum given, but no values map\");\n if (!values.hasOwnProperty(num))\n return this.reporter.error(\"Values map doesn't contain: \" + JSON.stringify(num));\n num = values[num];\n }\n if (typeof num != \"number\" && !Buffer2.isBuffer(num)) {\n let numArray = num.toArray();\n !num.sign && numArray[0] & 128 && numArray.unshift(0), (num = Buffer2.from(numArray));\n }\n if (Buffer2.isBuffer(num)) {\n let size2 = num.length;\n num.length === 0 && size2++;\n let out2 = Buffer2.alloc(size2);\n return num.copy(out2), num.length === 0 && (out2[0] = 0), this._createEncoderBuffer(out2);\n }\n if (num < 128) return this._createEncoderBuffer(num);\n if (num < 256) return this._createEncoderBuffer([0, num]);\n let size = 1;\n for (let i = num; i >= 256; i >>= 8) size++;\n let out = new Array(size);\n for (let i = out.length - 1; i >= 0; i--) (out[i] = num & 255), (num >>= 8);\n return out[0] & 128 && out.unshift(0), this._createEncoderBuffer(Buffer2.from(out));\n };\n DERNode.prototype._encodeBool = function (value) {\n return this._createEncoderBuffer(value ? 255 : 0);\n };\n DERNode.prototype._use = function (entity, obj) {\n return typeof entity == \"function\" && (entity = entity(obj)), entity._getEncoder(\"der\").tree;\n };\n DERNode.prototype._skipDefault = function (dataBuffer, reporter, parent) {\n let state = this._baseState,\n i;\n if (state.default === null) return !1;\n let data = dataBuffer.join();\n if (\n (state.defaultBuffer === void 0 &&\n (state.defaultBuffer = this._encodeValue(state.default, reporter, parent).join()),\n data.length !== state.defaultBuffer.length)\n )\n return !1;\n for (i = 0; i < data.length; i++) if (data[i] !== state.defaultBuffer[i]) return !1;\n return !0;\n };\n function encodeTag(tag, primitive, cls, reporter) {\n let res;\n if ((tag === \"seqof\" ? (tag = \"seq\") : tag === \"setof\" && (tag = \"set\"), der.tagByName.hasOwnProperty(tag)))\n res = der.tagByName[tag];\n else if (typeof tag == \"number\" && (tag | 0) === tag) res = tag;\n else return reporter.error(\"Unknown tag: \" + tag);\n return res >= 31\n ? reporter.error(\"Multi-octet tag encoding unsupported\")\n : (primitive || (res |= 32), (res |= der.tagClassByName[cls || \"universal\"] << 6), res);\n }\n },\n});\n\n// node_modules/asn1.js/lib/asn1/encoders/pem.js\nvar require_pem = __commonJS({\n \"node_modules/asn1.js/lib/asn1/encoders/pem.js\"(exports, module) {\n \"use strict\";\n var inherits = require_inherits_browser(),\n DEREncoder = require_der2();\n function PEMEncoder(entity) {\n DEREncoder.call(this, entity), (this.enc = \"pem\");\n }\n inherits(PEMEncoder, DEREncoder);\n module.exports = PEMEncoder;\n PEMEncoder.prototype.encode = function (data, options) {\n let p = DEREncoder.prototype.encode.call(this, data).toString(\"base64\"),\n out = [\"-----BEGIN \" + options.label + \"-----\"];\n for (let i = 0; i < p.length; i += 64) out.push(p.slice(i, i + 64));\n return (\n out.push(\"-----END \" + options.label + \"-----\"),\n out.join(`\n`)\n );\n };\n },\n});\n\n// node_modules/asn1.js/lib/asn1/encoders/index.js\nvar require_encoders = __commonJS({\n \"node_modules/asn1.js/lib/asn1/encoders/index.js\"(exports) {\n \"use strict\";\n var encoders = exports;\n encoders.der = require_der2();\n encoders.pem = require_pem();\n },\n});\n\n// node_modules/asn1.js/lib/asn1/decoders/der.js\nvar require_der3 = __commonJS({\n \"node_modules/asn1.js/lib/asn1/decoders/der.js\"(exports, module) {\n \"use strict\";\n var inherits = require_inherits_browser(),\n bignum = require_bn5(),\n DecoderBuffer = require_buffer().DecoderBuffer,\n Node = require_node(),\n der = require_der();\n function DERDecoder(entity) {\n (this.enc = \"der\"),\n (this.name = entity.name),\n (this.entity = entity),\n (this.tree = new DERNode()),\n this.tree._init(entity.body);\n }\n module.exports = DERDecoder;\n DERDecoder.prototype.decode = function (data, options) {\n return (\n DecoderBuffer.isDecoderBuffer(data) || (data = new DecoderBuffer(data, options)),\n this.tree._decode(data, options)\n );\n };\n function DERNode(parent) {\n Node.call(this, \"der\", parent);\n }\n inherits(DERNode, Node);\n DERNode.prototype._peekTag = function (buffer, tag, any) {\n if (buffer.isEmpty()) return !1;\n let state = buffer.save(),\n decodedTag = derDecodeTag(buffer, 'Failed to peek tag: \"' + tag + '\"');\n return buffer.isError(decodedTag)\n ? decodedTag\n : (buffer.restore(state),\n decodedTag.tag === tag || decodedTag.tagStr === tag || decodedTag.tagStr + \"of\" === tag || any);\n };\n DERNode.prototype._decodeTag = function (buffer, tag, any) {\n let decodedTag = derDecodeTag(buffer, 'Failed to decode tag of \"' + tag + '\"');\n if (buffer.isError(decodedTag)) return decodedTag;\n let len = derDecodeLen(buffer, decodedTag.primitive, 'Failed to get length of \"' + tag + '\"');\n if (buffer.isError(len)) return len;\n if (!any && decodedTag.tag !== tag && decodedTag.tagStr !== tag && decodedTag.tagStr + \"of\" !== tag)\n return buffer.error('Failed to match tag: \"' + tag + '\"');\n if (decodedTag.primitive || len !== null) return buffer.skip(len, 'Failed to match body of: \"' + tag + '\"');\n let state = buffer.save(),\n res = this._skipUntilEnd(buffer, 'Failed to skip indefinite length body: \"' + this.tag + '\"');\n return buffer.isError(res)\n ? res\n : ((len = buffer.offset - state.offset),\n buffer.restore(state),\n buffer.skip(len, 'Failed to match body of: \"' + tag + '\"'));\n };\n DERNode.prototype._skipUntilEnd = function (buffer, fail) {\n for (;;) {\n let tag = derDecodeTag(buffer, fail);\n if (buffer.isError(tag)) return tag;\n let len = derDecodeLen(buffer, tag.primitive, fail);\n if (buffer.isError(len)) return len;\n let res;\n if (\n (tag.primitive || len !== null ? (res = buffer.skip(len)) : (res = this._skipUntilEnd(buffer, fail)),\n buffer.isError(res))\n )\n return res;\n if (tag.tagStr === \"end\") break;\n }\n };\n DERNode.prototype._decodeList = function (buffer, tag, decoder, options) {\n let result = [];\n for (; !buffer.isEmpty(); ) {\n let possibleEnd = this._peekTag(buffer, \"end\");\n if (buffer.isError(possibleEnd)) return possibleEnd;\n let res = decoder.decode(buffer, \"der\", options);\n if (buffer.isError(res) && possibleEnd) break;\n result.push(res);\n }\n return result;\n };\n DERNode.prototype._decodeStr = function (buffer, tag) {\n if (tag === \"bitstr\") {\n let unused = buffer.readUInt8();\n return buffer.isError(unused) ? unused : { unused, data: buffer.raw() };\n } else if (tag === \"bmpstr\") {\n let raw = buffer.raw();\n if (raw.length % 2 === 1) return buffer.error(\"Decoding of string type: bmpstr length mismatch\");\n let str = \"\";\n for (let i = 0; i < raw.length / 2; i++) str += String.fromCharCode(raw.readUInt16BE(i * 2));\n return str;\n } else if (tag === \"numstr\") {\n let numstr = buffer.raw().toString(\"ascii\");\n return this._isNumstr(numstr) ? numstr : buffer.error(\"Decoding of string type: numstr unsupported characters\");\n } else {\n if (tag === \"octstr\") return buffer.raw();\n if (tag === \"objDesc\") return buffer.raw();\n if (tag === \"printstr\") {\n let printstr = buffer.raw().toString(\"ascii\");\n return this._isPrintstr(printstr)\n ? printstr\n : buffer.error(\"Decoding of string type: printstr unsupported characters\");\n } else\n return /str$/.test(tag)\n ? buffer.raw().toString()\n : buffer.error(\"Decoding of string type: \" + tag + \" unsupported\");\n }\n };\n DERNode.prototype._decodeObjid = function (buffer, values, relative) {\n let result,\n identifiers = [],\n ident = 0,\n subident = 0;\n for (; !buffer.isEmpty(); )\n (subident = buffer.readUInt8()),\n (ident <<= 7),\n (ident |= subident & 127),\n (subident & 128) === 0 && (identifiers.push(ident), (ident = 0));\n subident & 128 && identifiers.push(ident);\n let first = (identifiers[0] / 40) | 0,\n second = identifiers[0] % 40;\n if ((relative ? (result = identifiers) : (result = [first, second].concat(identifiers.slice(1))), values)) {\n let tmp = values[result.join(\" \")];\n tmp === void 0 && (tmp = values[result.join(\".\")]), tmp !== void 0 && (result = tmp);\n }\n return result;\n };\n DERNode.prototype._decodeTime = function (buffer, tag) {\n let str = buffer.raw().toString(),\n year,\n mon,\n day,\n hour,\n min,\n sec;\n if (tag === \"gentime\")\n (year = str.slice(0, 4) | 0),\n (mon = str.slice(4, 6) | 0),\n (day = str.slice(6, 8) | 0),\n (hour = str.slice(8, 10) | 0),\n (min = str.slice(10, 12) | 0),\n (sec = str.slice(12, 14) | 0);\n else if (tag === \"utctime\")\n (year = str.slice(0, 2) | 0),\n (mon = str.slice(2, 4) | 0),\n (day = str.slice(4, 6) | 0),\n (hour = str.slice(6, 8) | 0),\n (min = str.slice(8, 10) | 0),\n (sec = str.slice(10, 12) | 0),\n year < 70 ? (year = 2e3 + year) : (year = 1900 + year);\n else return buffer.error(\"Decoding \" + tag + \" time is not supported yet\");\n return Date.UTC(year, mon - 1, day, hour, min, sec, 0);\n };\n DERNode.prototype._decodeNull = function () {\n return null;\n };\n DERNode.prototype._decodeBool = function (buffer) {\n let res = buffer.readUInt8();\n return buffer.isError(res) ? res : res !== 0;\n };\n DERNode.prototype._decodeInt = function (buffer, values) {\n let raw = buffer.raw(),\n res = new bignum(raw);\n return values && (res = values[res.toString(10)] || res), res;\n };\n DERNode.prototype._use = function (entity, obj) {\n return typeof entity == \"function\" && (entity = entity(obj)), entity._getDecoder(\"der\").tree;\n };\n function derDecodeTag(buf, fail) {\n let tag = buf.readUInt8(fail);\n if (buf.isError(tag)) return tag;\n let cls = der.tagClass[tag >> 6],\n primitive = (tag & 32) === 0;\n if ((tag & 31) === 31) {\n let oct = tag;\n for (tag = 0; (oct & 128) === 128; ) {\n if (((oct = buf.readUInt8(fail)), buf.isError(oct))) return oct;\n (tag <<= 7), (tag |= oct & 127);\n }\n } else tag &= 31;\n let tagStr = der.tag[tag];\n return {\n cls,\n primitive,\n tag,\n tagStr,\n };\n }\n function derDecodeLen(buf, primitive, fail) {\n let len = buf.readUInt8(fail);\n if (buf.isError(len)) return len;\n if (!primitive && len === 128) return null;\n if ((len & 128) === 0) return len;\n let num = len & 127;\n if (num > 4) return buf.error(\"length octect is too long\");\n len = 0;\n for (let i = 0; i < num; i++) {\n len <<= 8;\n let j = buf.readUInt8(fail);\n if (buf.isError(j)) return j;\n len |= j;\n }\n return len;\n }\n },\n});\n\n// node_modules/asn1.js/lib/asn1/decoders/pem.js\nvar require_pem2 = __commonJS({\n \"node_modules/asn1.js/lib/asn1/decoders/pem.js\"(exports, module) {\n \"use strict\";\n var inherits = require_inherits_browser(),\n Buffer2 = require_safer().Buffer,\n DERDecoder = require_der3();\n function PEMDecoder(entity) {\n DERDecoder.call(this, entity), (this.enc = \"pem\");\n }\n inherits(PEMDecoder, DERDecoder);\n module.exports = PEMDecoder;\n PEMDecoder.prototype.decode = function (data, options) {\n let lines = data.toString().split(/[\\r\\n]+/g),\n label = options.label.toUpperCase(),\n re = /^-----(BEGIN|END) ([^-]+)-----$/,\n start = -1,\n end = -1;\n for (let i = 0; i < lines.length; i++) {\n let match = lines[i].match(re);\n if (match !== null && match[2] === label)\n if (start === -1) {\n if (match[1] !== \"BEGIN\") break;\n start = i;\n } else {\n if (match[1] !== \"END\") break;\n end = i;\n break;\n }\n }\n if (start === -1 || end === -1) throw new Error(\"PEM section not found for: \" + label);\n let base64 = lines.slice(start + 1, end).join(\"\");\n base64.replace(/[^a-z0-9+/=]+/gi, \"\");\n let input = Buffer2.from(base64, \"base64\");\n return DERDecoder.prototype.decode.call(this, input, options);\n };\n },\n});\n\n// node_modules/asn1.js/lib/asn1/decoders/index.js\nvar require_decoders = __commonJS({\n \"node_modules/asn1.js/lib/asn1/decoders/index.js\"(exports) {\n \"use strict\";\n var decoders = exports;\n decoders.der = require_der3();\n decoders.pem = require_pem2();\n },\n});\n\n// node_modules/asn1.js/lib/asn1/api.js\nvar require_api = __commonJS({\n \"node_modules/asn1.js/lib/asn1/api.js\"(exports) {\n \"use strict\";\n var encoders = require_encoders(),\n decoders = require_decoders(),\n inherits = require_inherits_browser(),\n api = exports;\n api.define = function (name, body) {\n return new Entity(name, body);\n };\n function Entity(name, body) {\n (this.name = name), (this.body = body), (this.decoders = {}), (this.encoders = {});\n }\n Entity.prototype._createNamed = function (Base) {\n let name = this.name;\n function Generated(entity) {\n this._initNamed(entity, name);\n }\n return (\n inherits(Generated, Base),\n (Generated.prototype._initNamed = function (entity, name2) {\n Base.call(this, entity, name2);\n }),\n new Generated(this)\n );\n };\n Entity.prototype._getDecoder = function (enc) {\n return (\n (enc = enc || \"der\"),\n this.decoders.hasOwnProperty(enc) || (this.decoders[enc] = this._createNamed(decoders[enc])),\n this.decoders[enc]\n );\n };\n Entity.prototype.decode = function (data, enc, options) {\n return this._getDecoder(enc).decode(data, options);\n };\n Entity.prototype._getEncoder = function (enc) {\n return (\n (enc = enc || \"der\"),\n this.encoders.hasOwnProperty(enc) || (this.encoders[enc] = this._createNamed(encoders[enc])),\n this.encoders[enc]\n );\n };\n Entity.prototype.encode = function (data, enc, reporter) {\n return this._getEncoder(enc).encode(data, reporter);\n };\n },\n});\n\n// node_modules/asn1.js/lib/asn1/base/index.js\nvar require_base2 = __commonJS({\n \"node_modules/asn1.js/lib/asn1/base/index.js\"(exports) {\n \"use strict\";\n var base = exports;\n base.Reporter = require_reporter().Reporter;\n base.DecoderBuffer = require_buffer().DecoderBuffer;\n base.EncoderBuffer = require_buffer().EncoderBuffer;\n base.Node = require_node();\n },\n});\n\n// node_modules/asn1.js/lib/asn1/constants/index.js\nvar require_constants = __commonJS({\n \"node_modules/asn1.js/lib/asn1/constants/index.js\"(exports) {\n \"use strict\";\n var constants = exports;\n constants._reverse = function (map) {\n let res = {};\n return (\n Object.keys(map).forEach(function (key) {\n (key | 0) == key && (key = key | 0);\n let value = map[key];\n res[value] = key;\n }),\n res\n );\n };\n constants.der = require_der();\n },\n});\n\n// node_modules/asn1.js/lib/asn1.js\nvar require_asn1 = __commonJS({\n \"node_modules/asn1.js/lib/asn1.js\"(exports) {\n \"use strict\";\n var asn1 = exports;\n asn1.bignum = require_bn5();\n asn1.define = require_api().define;\n asn1.base = require_base2();\n asn1.constants = require_constants();\n asn1.decoders = require_decoders();\n asn1.encoders = require_encoders();\n },\n});\n\n// node_modules/parse-asn1/certificate.js\nvar require_certificate = __commonJS({\n \"node_modules/parse-asn1/certificate.js\"(exports, module) {\n \"use strict\";\n var asn = require_asn1(),\n Time = asn.define(\"Time\", function () {\n this.choice({\n utcTime: this.utctime(),\n generalTime: this.gentime(),\n });\n }),\n AttributeTypeValue = asn.define(\"AttributeTypeValue\", function () {\n this.seq().obj(this.key(\"type\").objid(), this.key(\"value\").any());\n }),\n AlgorithmIdentifier = asn.define(\"AlgorithmIdentifier\", function () {\n this.seq().obj(\n this.key(\"algorithm\").objid(),\n this.key(\"parameters\").optional(),\n this.key(\"curve\").objid().optional(),\n );\n }),\n SubjectPublicKeyInfo = asn.define(\"SubjectPublicKeyInfo\", function () {\n this.seq().obj(this.key(\"algorithm\").use(AlgorithmIdentifier), this.key(\"subjectPublicKey\").bitstr());\n }),\n RelativeDistinguishedName = asn.define(\"RelativeDistinguishedName\", function () {\n this.setof(AttributeTypeValue);\n }),\n RDNSequence = asn.define(\"RDNSequence\", function () {\n this.seqof(RelativeDistinguishedName);\n }),\n Name = asn.define(\"Name\", function () {\n this.choice({\n rdnSequence: this.use(RDNSequence),\n });\n }),\n Validity = asn.define(\"Validity\", function () {\n this.seq().obj(this.key(\"notBefore\").use(Time), this.key(\"notAfter\").use(Time));\n }),\n Extension = asn.define(\"Extension\", function () {\n this.seq().obj(this.key(\"extnID\").objid(), this.key(\"critical\").bool().def(!1), this.key(\"extnValue\").octstr());\n }),\n TBSCertificate = asn.define(\"TBSCertificate\", function () {\n this.seq().obj(\n this.key(\"version\").explicit(0).int().optional(),\n this.key(\"serialNumber\").int(),\n this.key(\"signature\").use(AlgorithmIdentifier),\n this.key(\"issuer\").use(Name),\n this.key(\"validity\").use(Validity),\n this.key(\"subject\").use(Name),\n this.key(\"subjectPublicKeyInfo\").use(SubjectPublicKeyInfo),\n this.key(\"issuerUniqueID\").implicit(1).bitstr().optional(),\n this.key(\"subjectUniqueID\").implicit(2).bitstr().optional(),\n this.key(\"extensions\").explicit(3).seqof(Extension).optional(),\n );\n }),\n X509Certificate = asn.define(\"X509Certificate\", function () {\n this.seq().obj(\n this.key(\"tbsCertificate\").use(TBSCertificate),\n this.key(\"signatureAlgorithm\").use(AlgorithmIdentifier),\n this.key(\"signatureValue\").bitstr(),\n );\n });\n module.exports = X509Certificate;\n },\n});\n\n// node_modules/parse-asn1/asn1.js\nvar require_asn12 = __commonJS({\n \"node_modules/parse-asn1/asn1.js\"(exports) {\n \"use strict\";\n var asn1 = require_asn1();\n exports.certificate = require_certificate();\n var RSAPrivateKey = asn1.define(\"RSAPrivateKey\", function () {\n this.seq().obj(\n this.key(\"version\").int(),\n this.key(\"modulus\").int(),\n this.key(\"publicExponent\").int(),\n this.key(\"privateExponent\").int(),\n this.key(\"prime1\").int(),\n this.key(\"prime2\").int(),\n this.key(\"exponent1\").int(),\n this.key(\"exponent2\").int(),\n this.key(\"coefficient\").int(),\n );\n });\n exports.RSAPrivateKey = RSAPrivateKey;\n var RSAPublicKey = asn1.define(\"RSAPublicKey\", function () {\n this.seq().obj(this.key(\"modulus\").int(), this.key(\"publicExponent\").int());\n });\n exports.RSAPublicKey = RSAPublicKey;\n var PublicKey = asn1.define(\"SubjectPublicKeyInfo\", function () {\n this.seq().obj(this.key(\"algorithm\").use(AlgorithmIdentifier), this.key(\"subjectPublicKey\").bitstr());\n });\n exports.PublicKey = PublicKey;\n var AlgorithmIdentifier = asn1.define(\"AlgorithmIdentifier\", function () {\n this.seq().obj(\n this.key(\"algorithm\").objid(),\n this.key(\"none\").null_().optional(),\n this.key(\"curve\").objid().optional(),\n this.key(\"params\").seq().obj(this.key(\"p\").int(), this.key(\"q\").int(), this.key(\"g\").int()).optional(),\n );\n }),\n PrivateKeyInfo = asn1.define(\"PrivateKeyInfo\", function () {\n this.seq().obj(\n this.key(\"version\").int(),\n this.key(\"algorithm\").use(AlgorithmIdentifier),\n this.key(\"subjectPrivateKey\").octstr(),\n );\n });\n exports.PrivateKey = PrivateKeyInfo;\n var EncryptedPrivateKeyInfo = asn1.define(\"EncryptedPrivateKeyInfo\", function () {\n this.seq().obj(\n this.key(\"algorithm\")\n .seq()\n .obj(\n this.key(\"id\").objid(),\n this.key(\"decrypt\")\n .seq()\n .obj(\n this.key(\"kde\")\n .seq()\n .obj(\n this.key(\"id\").objid(),\n this.key(\"kdeparams\").seq().obj(this.key(\"salt\").octstr(), this.key(\"iters\").int()),\n ),\n this.key(\"cipher\").seq().obj(this.key(\"algo\").objid(), this.key(\"iv\").octstr()),\n ),\n ),\n this.key(\"subjectPrivateKey\").octstr(),\n );\n });\n exports.EncryptedPrivateKey = EncryptedPrivateKeyInfo;\n var DSAPrivateKey = asn1.define(\"DSAPrivateKey\", function () {\n this.seq().obj(\n this.key(\"version\").int(),\n this.key(\"p\").int(),\n this.key(\"q\").int(),\n this.key(\"g\").int(),\n this.key(\"pub_key\").int(),\n this.key(\"priv_key\").int(),\n );\n });\n exports.DSAPrivateKey = DSAPrivateKey;\n exports.DSAparam = asn1.define(\"DSAparam\", function () {\n this.int();\n });\n var ECPrivateKey = asn1.define(\"ECPrivateKey\", function () {\n this.seq().obj(\n this.key(\"version\").int(),\n this.key(\"privateKey\").octstr(),\n this.key(\"parameters\").optional().explicit(0).use(ECParameters),\n this.key(\"publicKey\").optional().explicit(1).bitstr(),\n );\n });\n exports.ECPrivateKey = ECPrivateKey;\n var ECParameters = asn1.define(\"ECParameters\", function () {\n this.choice({\n namedCurve: this.objid(),\n });\n });\n exports.signature = asn1.define(\"signature\", function () {\n this.seq().obj(this.key(\"r\").int(), this.key(\"s\").int());\n });\n },\n});\n\n// node_modules/parse-asn1/aesid.json\nvar require_aesid = __commonJS({\n \"node_modules/parse-asn1/aesid.json\"(exports, module) {\n module.exports = {\n \"2.16.840.1.101.3.4.1.1\": \"aes-128-ecb\",\n \"2.16.840.1.101.3.4.1.2\": \"aes-128-cbc\",\n \"2.16.840.1.101.3.4.1.3\": \"aes-128-ofb\",\n \"2.16.840.1.101.3.4.1.4\": \"aes-128-cfb\",\n \"2.16.840.1.101.3.4.1.21\": \"aes-192-ecb\",\n \"2.16.840.1.101.3.4.1.22\": \"aes-192-cbc\",\n \"2.16.840.1.101.3.4.1.23\": \"aes-192-ofb\",\n \"2.16.840.1.101.3.4.1.24\": \"aes-192-cfb\",\n \"2.16.840.1.101.3.4.1.41\": \"aes-256-ecb\",\n \"2.16.840.1.101.3.4.1.42\": \"aes-256-cbc\",\n \"2.16.840.1.101.3.4.1.43\": \"aes-256-ofb\",\n \"2.16.840.1.101.3.4.1.44\": \"aes-256-cfb\",\n };\n },\n});\n\n// node_modules/parse-asn1/fixProc.js\nvar require_fixProc = __commonJS({\n \"node_modules/parse-asn1/fixProc.js\"(exports, module) {\n var findProc =\n /Proc-Type: 4,ENCRYPTED[\\n\\r]+DEK-Info: AES-((?:128)|(?:192)|(?:256))-CBC,([0-9A-H]+)[\\n\\r]+([0-9A-z\\n\\r+/=]+)[\\n\\r]+/m,\n startRegex = /^-----BEGIN ((?:.*? KEY)|CERTIFICATE)-----/m,\n fullRegex = /^-----BEGIN ((?:.*? KEY)|CERTIFICATE)-----([0-9A-z\\n\\r+/=]+)-----END \\1-----$/m,\n evp = require_evp_bytestokey(),\n ciphers = require_browser5(),\n Buffer2 = require_safe_buffer().Buffer;\n module.exports = function (okey, password) {\n var key = okey.toString(),\n match = key.match(findProc),\n decrypted;\n if (match) {\n var suite = \"aes\" + match[1],\n iv = Buffer2.from(match[2], \"hex\"),\n cipherText = Buffer2.from(match[3].replace(/[\\r\\n]/g, \"\"), \"base64\"),\n cipherKey = evp(password, iv.slice(0, 8), parseInt(match[1], 10)).key,\n out = [],\n cipher = ciphers.createDecipheriv(suite, cipherKey, iv);\n out.push(cipher.update(cipherText)), out.push(cipher.final()), (decrypted = Buffer2.concat(out));\n } else {\n var match2 = key.match(fullRegex);\n decrypted = Buffer2.from(match2[2].replace(/[\\r\\n]/g, \"\"), \"base64\");\n }\n var tag = key.match(startRegex)[1];\n return {\n tag,\n data: decrypted,\n };\n };\n },\n});\n\n// node_modules/parse-asn1/index.js\nvar require_parse_asn1 = __commonJS({\n \"node_modules/parse-asn1/index.js\"(exports, module) {\n var asn1 = require_asn12(),\n aesid = require_aesid(),\n fixProc = require_fixProc(),\n ciphers = require_browser5(),\n compat = require_browser4(),\n Buffer2 = require_safe_buffer().Buffer;\n module.exports = parseKeys;\n function parseKeys(buffer) {\n var password;\n typeof buffer == \"object\" && !Buffer2.isBuffer(buffer) && ((password = buffer.passphrase), (buffer = buffer.key)),\n typeof buffer == \"string\" && (buffer = Buffer2.from(buffer));\n var stripped = fixProc(buffer, password),\n type = stripped.tag,\n data = stripped.data,\n subtype,\n ndata;\n switch (type) {\n case \"CERTIFICATE\":\n ndata = asn1.certificate.decode(data, \"der\").tbsCertificate.subjectPublicKeyInfo;\n case \"PUBLIC KEY\":\n switch (\n (ndata || (ndata = asn1.PublicKey.decode(data, \"der\")),\n (subtype = ndata.algorithm.algorithm.join(\".\")),\n subtype)\n ) {\n case \"1.2.840.113549.1.1.1\":\n return asn1.RSAPublicKey.decode(ndata.subjectPublicKey.data, \"der\");\n case \"1.2.840.10045.2.1\":\n return (\n (ndata.subjectPrivateKey = ndata.subjectPublicKey),\n {\n type: \"ec\",\n data: ndata,\n }\n );\n case \"1.2.840.10040.4.1\":\n return (\n (ndata.algorithm.params.pub_key = asn1.DSAparam.decode(ndata.subjectPublicKey.data, \"der\")),\n {\n type: \"dsa\",\n data: ndata.algorithm.params,\n }\n );\n default:\n throw new Error(\"unknown key id \" + subtype);\n }\n case \"ENCRYPTED PRIVATE KEY\":\n (data = asn1.EncryptedPrivateKey.decode(data, \"der\")), (data = decrypt(data, password));\n case \"PRIVATE KEY\":\n switch (\n ((ndata = asn1.PrivateKey.decode(data, \"der\")), (subtype = ndata.algorithm.algorithm.join(\".\")), subtype)\n ) {\n case \"1.2.840.113549.1.1.1\":\n return asn1.RSAPrivateKey.decode(ndata.subjectPrivateKey, \"der\");\n case \"1.2.840.10045.2.1\":\n return {\n curve: ndata.algorithm.curve,\n privateKey: asn1.ECPrivateKey.decode(ndata.subjectPrivateKey, \"der\").privateKey,\n };\n case \"1.2.840.10040.4.1\":\n return (\n (ndata.algorithm.params.priv_key = asn1.DSAparam.decode(ndata.subjectPrivateKey, \"der\")),\n {\n type: \"dsa\",\n params: ndata.algorithm.params,\n }\n );\n default:\n throw new Error(\"unknown key id \" + subtype);\n }\n case \"RSA PUBLIC KEY\":\n return asn1.RSAPublicKey.decode(data, \"der\");\n case \"RSA PRIVATE KEY\":\n return asn1.RSAPrivateKey.decode(data, \"der\");\n case \"DSA PRIVATE KEY\":\n return {\n type: \"dsa\",\n params: asn1.DSAPrivateKey.decode(data, \"der\"),\n };\n case \"EC PRIVATE KEY\":\n return (\n (data = asn1.ECPrivateKey.decode(data, \"der\")),\n {\n curve: data.parameters.value,\n privateKey: data.privateKey,\n }\n );\n default:\n throw new Error(\"unknown key type \" + type);\n }\n }\n parseKeys.signature = asn1.signature;\n function decrypt(data, password) {\n var salt = data.algorithm.decrypt.kde.kdeparams.salt,\n iters = parseInt(data.algorithm.decrypt.kde.kdeparams.iters.toString(), 10),\n algo = aesid[data.algorithm.decrypt.cipher.algo.join(\".\")],\n iv = data.algorithm.decrypt.cipher.iv,\n cipherText = data.subjectPrivateKey,\n keylen = parseInt(algo.split(\"-\")[1], 10) / 8,\n key = compat.pbkdf2Sync(password, salt, iters, keylen, \"sha1\"),\n cipher = ciphers.createDecipheriv(algo, key, iv),\n out = [];\n return out.push(cipher.update(cipherText)), out.push(cipher.final()), Buffer2.concat(out);\n }\n },\n});\n\n// node_modules/browserify-sign/browser/curves.json\nvar require_curves2 = __commonJS({\n \"node_modules/browserify-sign/browser/curves.json\"(exports, module) {\n module.exports = {\n \"1.3.132.0.10\": \"secp256k1\",\n \"1.3.132.0.33\": \"p224\",\n \"1.2.840.10045.3.1.1\": \"p192\",\n \"1.2.840.10045.3.1.7\": \"p256\",\n \"1.3.132.0.34\": \"p384\",\n \"1.3.132.0.35\": \"p521\",\n };\n },\n});\n\n// node_modules/browserify-sign/browser/sign.js\nvar require_sign = __commonJS({\n \"node_modules/browserify-sign/browser/sign.js\"(exports, module) {\n var Buffer2 = require_safe_buffer().Buffer,\n createHmac = require_browser3(),\n crt = require_browserify_rsa(),\n EC = require_elliptic().ec,\n BN = require_bn3(),\n parseKeys = require_parse_asn1(),\n curves = require_curves2();\n function sign(hash, key, hashType, signType, tag) {\n var priv = parseKeys(key);\n if (priv.curve) {\n if (signType !== \"ecdsa\" && signType !== \"ecdsa/rsa\") throw new Error(\"wrong private key type\");\n return ecSign(hash, priv);\n } else if (priv.type === \"dsa\") {\n if (signType !== \"dsa\") throw new Error(\"wrong private key type\");\n return dsaSign(hash, priv, hashType);\n } else if (signType !== \"rsa\" && signType !== \"ecdsa/rsa\") throw new Error(\"wrong private key type\");\n hash = Buffer2.concat([tag, hash]);\n for (var len = priv.modulus.byteLength(), pad = [0, 1]; hash.length + pad.length + 1 < len; ) pad.push(255);\n pad.push(0);\n for (var i = -1; ++i < hash.length; ) pad.push(hash[i]);\n var out = crt(pad, priv);\n return out;\n }\n function ecSign(hash, priv) {\n var curveId = curves[priv.curve.join(\".\")];\n if (!curveId) throw new Error(\"unknown curve \" + priv.curve.join(\".\"));\n var curve = new EC(curveId),\n key = curve.keyFromPrivate(priv.privateKey),\n out = key.sign(hash);\n return Buffer2.from(out.toDER());\n }\n function dsaSign(hash, priv, algo) {\n for (\n var x = priv.params.priv_key,\n p = priv.params.p,\n q = priv.params.q,\n g = priv.params.g,\n r = new BN(0),\n k,\n H = bits2int(hash, q).mod(q),\n s = !1,\n kv = getKey(x, q, hash, algo);\n s === !1;\n\n )\n (k = makeKey(q, kv, algo)),\n (r = makeR(g, k, p, q)),\n (s = k\n .invm(q)\n .imul(H.add(x.mul(r)))\n .mod(q)),\n s.cmpn(0) === 0 && ((s = !1), (r = new BN(0)));\n return toDER(r, s);\n }\n function toDER(r, s) {\n (r = r.toArray()), (s = s.toArray()), r[0] & 128 && (r = [0].concat(r)), s[0] & 128 && (s = [0].concat(s));\n var total = r.length + s.length + 4,\n res = [48, total, 2, r.length];\n return (res = res.concat(r, [2, s.length], s)), Buffer2.from(res);\n }\n function getKey(x, q, hash, algo) {\n if (((x = Buffer2.from(x.toArray())), x.length < q.byteLength())) {\n var zeros = Buffer2.alloc(q.byteLength() - x.length);\n x = Buffer2.concat([zeros, x]);\n }\n var hlen = hash.length,\n hbits = bits2octets(hash, q),\n v = Buffer2.alloc(hlen);\n v.fill(1);\n var k = Buffer2.alloc(hlen);\n return (\n (k = createHmac(algo, k)\n .update(v)\n .update(Buffer2.from([0]))\n .update(x)\n .update(hbits)\n .digest()),\n (v = createHmac(algo, k).update(v).digest()),\n (k = createHmac(algo, k)\n .update(v)\n .update(Buffer2.from([1]))\n .update(x)\n .update(hbits)\n .digest()),\n (v = createHmac(algo, k).update(v).digest()),\n { k, v }\n );\n }\n function bits2int(obits, q) {\n var bits = new BN(obits),\n shift = (obits.length << 3) - q.bitLength();\n return shift > 0 && bits.ishrn(shift), bits;\n }\n function bits2octets(bits, q) {\n (bits = bits2int(bits, q)), (bits = bits.mod(q));\n var out = Buffer2.from(bits.toArray());\n if (out.length < q.byteLength()) {\n var zeros = Buffer2.alloc(q.byteLength() - out.length);\n out = Buffer2.concat([zeros, out]);\n }\n return out;\n }\n function makeKey(q, kv, algo) {\n var t, k;\n do {\n for (t = Buffer2.alloc(0); t.length * 8 < q.bitLength(); )\n (kv.v = createHmac(algo, kv.k).update(kv.v).digest()), (t = Buffer2.concat([t, kv.v]));\n (k = bits2int(t, q)),\n (kv.k = createHmac(algo, kv.k)\n .update(kv.v)\n .update(Buffer2.from([0]))\n .digest()),\n (kv.v = createHmac(algo, kv.k).update(kv.v).digest());\n } while (k.cmp(q) !== -1);\n return k;\n }\n function makeR(g, k, p, q) {\n return g.toRed(BN.mont(p)).redPow(k).fromRed().mod(q);\n }\n module.exports = sign;\n module.exports.getKey = getKey;\n module.exports.makeKey = makeKey;\n },\n});\n\n// node_modules/browserify-sign/browser/verify.js\nvar require_verify = __commonJS({\n \"node_modules/browserify-sign/browser/verify.js\"(exports, module) {\n var Buffer2 = require_safe_buffer().Buffer,\n BN = require_bn3(),\n EC = require_elliptic().ec,\n parseKeys = require_parse_asn1(),\n curves = require_curves2();\n function verify(sig, hash, key, signType, tag) {\n var pub = parseKeys(key);\n if (pub.type === \"ec\") {\n if (signType !== \"ecdsa\" && signType !== \"ecdsa/rsa\") throw new Error(\"wrong public key type\");\n return ecVerify(sig, hash, pub);\n } else if (pub.type === \"dsa\") {\n if (signType !== \"dsa\") throw new Error(\"wrong public key type\");\n return dsaVerify(sig, hash, pub);\n } else if (signType !== \"rsa\" && signType !== \"ecdsa/rsa\") throw new Error(\"wrong public key type\");\n hash = Buffer2.concat([tag, hash]);\n for (var len = pub.modulus.byteLength(), pad = [1], padNum = 0; hash.length + pad.length + 2 < len; )\n pad.push(255), padNum++;\n pad.push(0);\n for (var i = -1; ++i < hash.length; ) pad.push(hash[i]);\n pad = Buffer2.from(pad);\n var red = BN.mont(pub.modulus);\n (sig = new BN(sig).toRed(red)),\n (sig = sig.redPow(new BN(pub.publicExponent))),\n (sig = Buffer2.from(sig.fromRed().toArray()));\n var out = padNum < 8 ? 1 : 0;\n for (len = Math.min(sig.length, pad.length), sig.length !== pad.length && (out = 1), i = -1; ++i < len; )\n out |= sig[i] ^ pad[i];\n return out === 0;\n }\n function ecVerify(sig, hash, pub) {\n var curveId = curves[pub.data.algorithm.curve.join(\".\")];\n if (!curveId) throw new Error(\"unknown curve \" + pub.data.algorithm.curve.join(\".\"));\n var curve = new EC(curveId),\n pubkey = pub.data.subjectPrivateKey.data;\n return curve.verify(hash, sig, pubkey);\n }\n function dsaVerify(sig, hash, pub) {\n var p = pub.data.p,\n q = pub.data.q,\n g = pub.data.g,\n y = pub.data.pub_key,\n unpacked = parseKeys.signature.decode(sig, \"der\"),\n s = unpacked.s,\n r = unpacked.r;\n checkValue(s, q), checkValue(r, q);\n var montp = BN.mont(p),\n w = s.invm(q),\n v = g\n .toRed(montp)\n .redPow(new BN(hash).mul(w).mod(q))\n .fromRed()\n .mul(y.toRed(montp).redPow(r.mul(w).mod(q)).fromRed())\n .mod(p)\n .mod(q);\n return v.cmp(r) === 0;\n }\n function checkValue(b, q) {\n if (b.cmpn(0) <= 0) throw new Error(\"invalid sig\");\n if (b.cmp(q) >= q) throw new Error(\"invalid sig\");\n }\n module.exports = verify;\n },\n});\n\n// node_modules/browserify-sign/browser/index.js\nvar require_browser8 = __commonJS({\n \"node_modules/browserify-sign/browser/index.js\"(exports, module) {\n var Buffer2 = require_safe_buffer().Buffer,\n createHash = require_browser2(),\n stream = __require(\"readable-stream\"),\n inherits = require_inherits_browser(),\n sign = require_sign(),\n verify = require_verify(),\n algorithms = require_algorithms();\n Object.keys(algorithms).forEach(function (key) {\n (algorithms[key].id = Buffer2.from(algorithms[key].id, \"hex\")), (algorithms[key.toLowerCase()] = algorithms[key]);\n });\n function Sign(algorithm) {\n stream.Writable.call(this);\n var data = algorithms[algorithm];\n if (!data) throw new Error(\"Unknown message digest\");\n (this._hashType = data.hash),\n (this._hash = createHash(data.hash)),\n (this._tag = data.id),\n (this._signType = data.sign);\n }\n inherits(Sign, stream.Writable);\n Sign.prototype._write = function (data, _, done) {\n this._hash.update(data), done();\n };\n Sign.prototype.update = function (data, enc) {\n return typeof data == \"string\" && (data = Buffer2.from(data, enc)), this._hash.update(data), this;\n };\n Sign.prototype.sign = function (key, enc) {\n this.end();\n var hash = this._hash.digest(),\n sig = sign(hash, key, this._hashType, this._signType, this._tag);\n return enc ? sig.toString(enc) : sig;\n };\n function Verify(algorithm) {\n stream.Writable.call(this);\n var data = algorithms[algorithm];\n if (!data) throw new Error(\"Unknown message digest\");\n (this._hash = createHash(data.hash)), (this._tag = data.id), (this._signType = data.sign);\n }\n inherits(Verify, stream.Writable);\n Verify.prototype._write = function (data, _, done) {\n this._hash.update(data), done();\n };\n Verify.prototype.update = function (data, enc) {\n return typeof data == \"string\" && (data = Buffer2.from(data, enc)), this._hash.update(data), this;\n };\n Verify.prototype.verify = function (key, sig, enc) {\n typeof sig == \"string\" && (sig = Buffer2.from(sig, enc)), this.end();\n var hash = this._hash.digest();\n return verify(sig, hash, key, this._signType, this._tag);\n };\n function createSign(algorithm) {\n return new Sign(algorithm);\n }\n function createVerify(algorithm) {\n return new Verify(algorithm);\n }\n module.exports = {\n Sign: createSign,\n Verify: createVerify,\n createSign,\n createVerify,\n };\n },\n});\n\n// node_modules/create-ecdh/node_modules/bn.js/lib/bn.js\nvar require_bn6 = __commonJS({\n \"node_modules/create-ecdh/node_modules/bn.js/lib/bn.js\"(exports, module) {\n (function (module2, exports2) {\n \"use strict\";\n function assert(val, msg) {\n if (!val) throw new Error(msg || \"Assertion failed\");\n }\n function inherits(ctor, superCtor) {\n ctor.super_ = superCtor;\n var TempCtor = function () {};\n (TempCtor.prototype = superCtor.prototype),\n (ctor.prototype = new TempCtor()),\n (ctor.prototype.constructor = ctor);\n }\n function BN(number, base, endian) {\n if (BN.isBN(number)) return number;\n (this.negative = 0),\n (this.words = null),\n (this.length = 0),\n (this.red = null),\n number !== null &&\n ((base === \"le\" || base === \"be\") && ((endian = base), (base = 10)),\n this._init(number || 0, base || 10, endian || \"be\"));\n }\n typeof module2 == \"object\" ? (module2.exports = BN) : (exports2.BN = BN), (BN.BN = BN), (BN.wordSize = 26);\n var Buffer2;\n try {\n typeof window < \"u\" && typeof window.Buffer < \"u\"\n ? (Buffer2 = window.Buffer)\n : (Buffer2 = __require(\"buffer\").Buffer);\n } catch {}\n (BN.isBN = function (num) {\n return num instanceof BN\n ? !0\n : num !== null &&\n typeof num == \"object\" &&\n num.constructor.wordSize === BN.wordSize &&\n Array.isArray(num.words);\n }),\n (BN.max = function (left, right) {\n return left.cmp(right) > 0 ? left : right;\n }),\n (BN.min = function (left, right) {\n return left.cmp(right) < 0 ? left : right;\n }),\n (BN.prototype._init = function (number, base, endian) {\n if (typeof number == \"number\") return this._initNumber(number, base, endian);\n if (typeof number == \"object\") return this._initArray(number, base, endian);\n base === \"hex\" && (base = 16),\n assert(base === (base | 0) && base >= 2 && base <= 36),\n (number = number.toString().replace(/\\s+/g, \"\"));\n var start = 0;\n number[0] === \"-\" && (start++, (this.negative = 1)),\n start < number.length &&\n (base === 16\n ? this._parseHex(number, start, endian)\n : (this._parseBase(number, base, start),\n endian === \"le\" && this._initArray(this.toArray(), base, endian)));\n }),\n (BN.prototype._initNumber = function (number, base, endian) {\n number < 0 && ((this.negative = 1), (number = -number)),\n number < 67108864\n ? ((this.words = [number & 67108863]), (this.length = 1))\n : number < 4503599627370496\n ? ((this.words = [number & 67108863, (number / 67108864) & 67108863]), (this.length = 2))\n : (assert(number < 9007199254740992),\n (this.words = [number & 67108863, (number / 67108864) & 67108863, 1]),\n (this.length = 3)),\n endian === \"le\" && this._initArray(this.toArray(), base, endian);\n }),\n (BN.prototype._initArray = function (number, base, endian) {\n if ((assert(typeof number.length == \"number\"), number.length <= 0))\n return (this.words = [0]), (this.length = 1), this;\n (this.length = Math.ceil(number.length / 3)), (this.words = new Array(this.length));\n for (var i = 0; i < this.length; i++) this.words[i] = 0;\n var j,\n w,\n off = 0;\n if (endian === \"be\")\n for (i = number.length - 1, j = 0; i >= 0; i -= 3)\n (w = number[i] | (number[i - 1] << 8) | (number[i - 2] << 16)),\n (this.words[j] |= (w << off) & 67108863),\n (this.words[j + 1] = (w >>> (26 - off)) & 67108863),\n (off += 24),\n off >= 26 && ((off -= 26), j++);\n else if (endian === \"le\")\n for (i = 0, j = 0; i < number.length; i += 3)\n (w = number[i] | (number[i + 1] << 8) | (number[i + 2] << 16)),\n (this.words[j] |= (w << off) & 67108863),\n (this.words[j + 1] = (w >>> (26 - off)) & 67108863),\n (off += 24),\n off >= 26 && ((off -= 26), j++);\n return this.strip();\n });\n function parseHex4Bits(string, index) {\n var c = string.charCodeAt(index);\n return c >= 65 && c <= 70 ? c - 55 : c >= 97 && c <= 102 ? c - 87 : (c - 48) & 15;\n }\n function parseHexByte(string, lowerBound, index) {\n var r = parseHex4Bits(string, index);\n return index - 1 >= lowerBound && (r |= parseHex4Bits(string, index - 1) << 4), r;\n }\n BN.prototype._parseHex = function (number, start, endian) {\n (this.length = Math.ceil((number.length - start) / 6)), (this.words = new Array(this.length));\n for (var i = 0; i < this.length; i++) this.words[i] = 0;\n var off = 0,\n j = 0,\n w;\n if (endian === \"be\")\n for (i = number.length - 1; i >= start; i -= 2)\n (w = parseHexByte(number, start, i) << off),\n (this.words[j] |= w & 67108863),\n off >= 18 ? ((off -= 18), (j += 1), (this.words[j] |= w >>> 26)) : (off += 8);\n else {\n var parseLength = number.length - start;\n for (i = parseLength % 2 === 0 ? start + 1 : start; i < number.length; i += 2)\n (w = parseHexByte(number, start, i) << off),\n (this.words[j] |= w & 67108863),\n off >= 18 ? ((off -= 18), (j += 1), (this.words[j] |= w >>> 26)) : (off += 8);\n }\n this.strip();\n };\n function parseBase(str, start, end, mul) {\n for (var r = 0, len = Math.min(str.length, end), i = start; i < len; i++) {\n var c = str.charCodeAt(i) - 48;\n (r *= mul), c >= 49 ? (r += c - 49 + 10) : c >= 17 ? (r += c - 17 + 10) : (r += c);\n }\n return r;\n }\n (BN.prototype._parseBase = function (number, base, start) {\n (this.words = [0]), (this.length = 1);\n for (var limbLen = 0, limbPow = 1; limbPow <= 67108863; limbPow *= base) limbLen++;\n limbLen--, (limbPow = (limbPow / base) | 0);\n for (\n var total = number.length - start,\n mod = total % limbLen,\n end = Math.min(total, total - mod) + start,\n word = 0,\n i = start;\n i < end;\n i += limbLen\n )\n (word = parseBase(number, i, i + limbLen, base)),\n this.imuln(limbPow),\n this.words[0] + word < 67108864 ? (this.words[0] += word) : this._iaddn(word);\n if (mod !== 0) {\n var pow = 1;\n for (word = parseBase(number, i, number.length, base), i = 0; i < mod; i++) pow *= base;\n this.imuln(pow), this.words[0] + word < 67108864 ? (this.words[0] += word) : this._iaddn(word);\n }\n this.strip();\n }),\n (BN.prototype.copy = function (dest) {\n dest.words = new Array(this.length);\n for (var i = 0; i < this.length; i++) dest.words[i] = this.words[i];\n (dest.length = this.length), (dest.negative = this.negative), (dest.red = this.red);\n }),\n (BN.prototype.clone = function () {\n var r = new BN(null);\n return this.copy(r), r;\n }),\n (BN.prototype._expand = function (size) {\n for (; this.length < size; ) this.words[this.length++] = 0;\n return this;\n }),\n (BN.prototype.strip = function () {\n for (; this.length > 1 && this.words[this.length - 1] === 0; ) this.length--;\n return this._normSign();\n }),\n (BN.prototype._normSign = function () {\n return this.length === 1 && this.words[0] === 0 && (this.negative = 0), this;\n }),\n (BN.prototype.inspect = function () {\n return (this.red ? \"<BN-R: \" : \"<BN: \") + this.toString(16) + \">\";\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 groupSizes = [\n 0, 0, 25, 16, 12, 11, 10, 9, 8, 8, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5,\n 5, 5,\n ],\n groupBases = [\n 0, 0, 33554432, 43046721, 16777216, 48828125, 60466176, 40353607, 16777216, 43046721, 1e7, 19487171, 35831808,\n 62748517, 7529536, 11390625, 16777216, 24137569, 34012224, 47045881, 64e6, 4084101, 5153632, 6436343, 7962624,\n 9765625, 11881376, 14348907, 17210368, 20511149, 243e5, 28629151, 33554432, 39135393, 45435424, 52521875,\n 60466176,\n ];\n (BN.prototype.toString = function (base, padding) {\n (base = base || 10), (padding = padding | 0 || 1);\n var out;\n if (base === 16 || base === \"hex\") {\n out = \"\";\n for (var off = 0, carry = 0, i = 0; i < this.length; i++) {\n var w = this.words[i],\n word = (((w << off) | carry) & 16777215).toString(16);\n (carry = (w >>> (24 - off)) & 16777215),\n carry !== 0 || i !== this.length - 1 ? (out = zeros[6 - word.length] + word + out) : (out = word + out),\n (off += 2),\n off >= 26 && ((off -= 26), i--);\n }\n for (carry !== 0 && (out = carry.toString(16) + out); out.length % padding !== 0; ) out = \"0\" + out;\n return this.negative !== 0 && (out = \"-\" + out), out;\n }\n if (base === (base | 0) && base >= 2 && base <= 36) {\n var groupSize = groupSizes[base],\n groupBase = groupBases[base];\n out = \"\";\n var c = this.clone();\n for (c.negative = 0; !c.isZero(); ) {\n var r = c.modn(groupBase).toString(base);\n (c = c.idivn(groupBase)), c.isZero() ? (out = r + out) : (out = zeros[groupSize - r.length] + r + out);\n }\n for (this.isZero() && (out = \"0\" + out); out.length % padding !== 0; ) out = \"0\" + out;\n return this.negative !== 0 && (out = \"-\" + out), out;\n }\n assert(!1, \"Base should be between 2 and 36\");\n }),\n (BN.prototype.toNumber = function () {\n var ret = this.words[0];\n return (\n this.length === 2\n ? (ret += this.words[1] * 67108864)\n : this.length === 3 && this.words[2] === 1\n ? (ret += 4503599627370496 + this.words[1] * 67108864)\n : this.length > 2 && assert(!1, \"Number can only safely store up to 53 bits\"),\n this.negative !== 0 ? -ret : ret\n );\n }),\n (BN.prototype.toJSON = function () {\n return this.toString(16);\n }),\n (BN.prototype.toBuffer = function (endian, length) {\n return assert(typeof Buffer2 < \"u\"), this.toArrayLike(Buffer2, endian, length);\n }),\n (BN.prototype.toArray = function (endian, length) {\n return this.toArrayLike(Array, endian, length);\n }),\n (BN.prototype.toArrayLike = function (ArrayType, endian, length) {\n var byteLength = this.byteLength(),\n 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 this.strip();\n var littleEndian = endian === \"le\",\n res = new ArrayType(reqLength),\n b,\n i,\n q = this.clone();\n if (littleEndian) {\n for (i = 0; !q.isZero(); i++) (b = q.andln(255)), q.iushrn(8), (res[i] = b);\n for (; i < reqLength; i++) res[i] = 0;\n } else {\n for (i = 0; i < reqLength - byteLength; i++) res[i] = 0;\n for (i = 0; !q.isZero(); i++) (b = q.andln(255)), q.iushrn(8), (res[reqLength - i - 1] = b);\n }\n return res;\n }),\n Math.clz32\n ? (BN.prototype._countBits = function (w) {\n return 32 - Math.clz32(w);\n })\n : (BN.prototype._countBits = function (w) {\n var t = w,\n r = 0;\n return (\n t >= 4096 && ((r += 13), (t >>>= 13)),\n t >= 64 && ((r += 7), (t >>>= 7)),\n t >= 8 && ((r += 4), (t >>>= 4)),\n t >= 2 && ((r += 2), (t >>>= 2)),\n r + t\n );\n }),\n (BN.prototype._zeroBits = function (w) {\n if (w === 0) return 26;\n var t = w,\n r = 0;\n return (\n (t & 8191) === 0 && ((r += 13), (t >>>= 13)),\n (t & 127) === 0 && ((r += 7), (t >>>= 7)),\n (t & 15) === 0 && ((r += 4), (t >>>= 4)),\n (t & 3) === 0 && ((r += 2), (t >>>= 2)),\n (t & 1) === 0 && r++,\n r\n );\n }),\n (BN.prototype.bitLength = function () {\n var w = this.words[this.length - 1],\n hi = this._countBits(w);\n return (this.length - 1) * 26 + hi;\n });\n function toBitArray(num) {\n for (var w = new Array(num.bitLength()), bit = 0; bit < w.length; bit++) {\n var off = (bit / 26) | 0,\n wbit = bit % 26;\n w[bit] = (num.words[off] & (1 << wbit)) >>> wbit;\n }\n return w;\n }\n (BN.prototype.zeroBits = function () {\n if (this.isZero()) return 0;\n for (var r = 0, i = 0; i < this.length; i++) {\n var b = this._zeroBits(this.words[i]);\n if (((r += b), b !== 26)) break;\n }\n return r;\n }),\n (BN.prototype.byteLength = function () {\n return Math.ceil(this.bitLength() / 8);\n }),\n (BN.prototype.toTwos = function (width) {\n return this.negative !== 0 ? this.abs().inotn(width).iaddn(1) : this.clone();\n }),\n (BN.prototype.fromTwos = function (width) {\n return this.testn(width - 1) ? this.notn(width).iaddn(1).ineg() : this.clone();\n }),\n (BN.prototype.isNeg = function () {\n return this.negative !== 0;\n }),\n (BN.prototype.neg = function () {\n return this.clone().ineg();\n }),\n (BN.prototype.ineg = function () {\n return this.isZero() || (this.negative ^= 1), this;\n }),\n (BN.prototype.iuor = function (num) {\n for (; this.length < num.length; ) this.words[this.length++] = 0;\n for (var i = 0; i < num.length; i++) this.words[i] = this.words[i] | num.words[i];\n return this.strip();\n }),\n (BN.prototype.ior = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuor(num);\n }),\n (BN.prototype.or = function (num) {\n return this.length > num.length ? this.clone().ior(num) : num.clone().ior(this);\n }),\n (BN.prototype.uor = function (num) {\n return this.length > num.length ? this.clone().iuor(num) : num.clone().iuor(this);\n }),\n (BN.prototype.iuand = function (num) {\n var b;\n this.length > num.length ? (b = num) : (b = this);\n for (var i = 0; i < b.length; i++) this.words[i] = this.words[i] & num.words[i];\n return (this.length = b.length), this.strip();\n }),\n (BN.prototype.iand = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuand(num);\n }),\n (BN.prototype.and = function (num) {\n return this.length > num.length ? this.clone().iand(num) : num.clone().iand(this);\n }),\n (BN.prototype.uand = function (num) {\n return this.length > num.length ? this.clone().iuand(num) : num.clone().iuand(this);\n }),\n (BN.prototype.iuxor = function (num) {\n var a, b;\n this.length > num.length ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var i = 0; i < b.length; i++) this.words[i] = a.words[i] ^ b.words[i];\n if (this !== a) for (; i < a.length; i++) this.words[i] = a.words[i];\n return (this.length = a.length), this.strip();\n }),\n (BN.prototype.ixor = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuxor(num);\n }),\n (BN.prototype.xor = function (num) {\n return this.length > num.length ? this.clone().ixor(num) : num.clone().ixor(this);\n }),\n (BN.prototype.uxor = function (num) {\n return this.length > num.length ? this.clone().iuxor(num) : num.clone().iuxor(this);\n }),\n (BN.prototype.inotn = function (width) {\n assert(typeof width == \"number\" && width >= 0);\n var bytesNeeded = Math.ceil(width / 26) | 0,\n bitsLeft = width % 26;\n this._expand(bytesNeeded), bitsLeft > 0 && bytesNeeded--;\n for (var i = 0; i < bytesNeeded; i++) this.words[i] = ~this.words[i] & 67108863;\n return bitsLeft > 0 && (this.words[i] = ~this.words[i] & (67108863 >> (26 - bitsLeft))), this.strip();\n }),\n (BN.prototype.notn = function (width) {\n return this.clone().inotn(width);\n }),\n (BN.prototype.setn = function (bit, val) {\n assert(typeof bit == \"number\" && bit >= 0);\n var off = (bit / 26) | 0,\n wbit = bit % 26;\n return (\n this._expand(off + 1),\n val\n ? (this.words[off] = this.words[off] | (1 << wbit))\n : (this.words[off] = this.words[off] & ~(1 << wbit)),\n this.strip()\n );\n }),\n (BN.prototype.iadd = function (num) {\n var r;\n if (this.negative !== 0 && num.negative === 0)\n return (this.negative = 0), (r = this.isub(num)), (this.negative ^= 1), this._normSign();\n if (this.negative === 0 && num.negative !== 0)\n return (num.negative = 0), (r = this.isub(num)), (num.negative = 1), r._normSign();\n var a, b;\n this.length > num.length ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var carry = 0, i = 0; i < b.length; i++)\n (r = (a.words[i] | 0) + (b.words[i] | 0) + carry), (this.words[i] = r & 67108863), (carry = r >>> 26);\n for (; carry !== 0 && i < a.length; i++)\n (r = (a.words[i] | 0) + carry), (this.words[i] = r & 67108863), (carry = r >>> 26);\n if (((this.length = a.length), carry !== 0)) (this.words[this.length] = carry), this.length++;\n else if (a !== this) for (; i < a.length; i++) this.words[i] = a.words[i];\n return this;\n }),\n (BN.prototype.add = function (num) {\n var res;\n return num.negative !== 0 && this.negative === 0\n ? ((num.negative = 0), (res = this.sub(num)), (num.negative ^= 1), res)\n : num.negative === 0 && this.negative !== 0\n ? ((this.negative = 0), (res = num.sub(this)), (this.negative = 1), res)\n : this.length > num.length\n ? this.clone().iadd(num)\n : num.clone().iadd(this);\n }),\n (BN.prototype.isub = function (num) {\n if (num.negative !== 0) {\n num.negative = 0;\n var r = this.iadd(num);\n return (num.negative = 1), r._normSign();\n } else if (this.negative !== 0)\n return (this.negative = 0), this.iadd(num), (this.negative = 1), this._normSign();\n var cmp = this.cmp(num);\n if (cmp === 0) return (this.negative = 0), (this.length = 1), (this.words[0] = 0), this;\n var a, b;\n cmp > 0 ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var carry = 0, i = 0; i < b.length; i++)\n (r = (a.words[i] | 0) - (b.words[i] | 0) + carry), (carry = r >> 26), (this.words[i] = r & 67108863);\n for (; carry !== 0 && i < a.length; i++)\n (r = (a.words[i] | 0) + carry), (carry = r >> 26), (this.words[i] = r & 67108863);\n if (carry === 0 && i < a.length && a !== this) for (; i < a.length; i++) this.words[i] = a.words[i];\n return (this.length = Math.max(this.length, i)), a !== this && (this.negative = 1), this.strip();\n }),\n (BN.prototype.sub = function (num) {\n return this.clone().isub(num);\n });\n function smallMulTo(self2, num, out) {\n out.negative = num.negative ^ self2.negative;\n var len = (self2.length + num.length) | 0;\n (out.length = len), (len = (len - 1) | 0);\n var a = self2.words[0] | 0,\n b = num.words[0] | 0,\n r = a * b,\n lo = r & 67108863,\n carry = (r / 67108864) | 0;\n out.words[0] = lo;\n for (var k = 1; k < len; k++) {\n for (\n var ncarry = carry >>> 26,\n rword = carry & 67108863,\n maxJ = Math.min(k, num.length - 1),\n j = Math.max(0, k - self2.length + 1);\n j <= maxJ;\n j++\n ) {\n var i = (k - j) | 0;\n (a = self2.words[i] | 0),\n (b = num.words[j] | 0),\n (r = a * b + rword),\n (ncarry += (r / 67108864) | 0),\n (rword = r & 67108863);\n }\n (out.words[k] = rword | 0), (carry = ncarry | 0);\n }\n return carry !== 0 ? (out.words[k] = carry | 0) : out.length--, out.strip();\n }\n var comb10MulTo = function (self2, num, out) {\n var a = self2.words,\n b = num.words,\n o = out.words,\n c = 0,\n lo,\n mid,\n hi,\n a0 = a[0] | 0,\n al0 = a0 & 8191,\n ah0 = a0 >>> 13,\n a1 = a[1] | 0,\n al1 = a1 & 8191,\n ah1 = a1 >>> 13,\n a2 = a[2] | 0,\n al2 = a2 & 8191,\n ah2 = a2 >>> 13,\n a3 = a[3] | 0,\n al3 = a3 & 8191,\n ah3 = a3 >>> 13,\n a4 = a[4] | 0,\n al4 = a4 & 8191,\n ah4 = a4 >>> 13,\n a5 = a[5] | 0,\n al5 = a5 & 8191,\n ah5 = a5 >>> 13,\n a6 = a[6] | 0,\n al6 = a6 & 8191,\n ah6 = a6 >>> 13,\n a7 = a[7] | 0,\n al7 = a7 & 8191,\n ah7 = a7 >>> 13,\n a8 = a[8] | 0,\n al8 = a8 & 8191,\n ah8 = a8 >>> 13,\n a9 = a[9] | 0,\n al9 = a9 & 8191,\n ah9 = a9 >>> 13,\n b0 = b[0] | 0,\n bl0 = b0 & 8191,\n bh0 = b0 >>> 13,\n b1 = b[1] | 0,\n bl1 = b1 & 8191,\n bh1 = b1 >>> 13,\n b2 = b[2] | 0,\n bl2 = b2 & 8191,\n bh2 = b2 >>> 13,\n b3 = b[3] | 0,\n bl3 = b3 & 8191,\n bh3 = b3 >>> 13,\n b4 = b[4] | 0,\n bl4 = b4 & 8191,\n bh4 = b4 >>> 13,\n b5 = b[5] | 0,\n bl5 = b5 & 8191,\n bh5 = b5 >>> 13,\n b6 = b[6] | 0,\n bl6 = b6 & 8191,\n bh6 = b6 >>> 13,\n b7 = b[7] | 0,\n bl7 = b7 & 8191,\n bh7 = b7 >>> 13,\n b8 = b[8] | 0,\n bl8 = b8 & 8191,\n bh8 = b8 >>> 13,\n b9 = b[9] | 0,\n bl9 = b9 & 8191,\n bh9 = b9 >>> 13;\n (out.negative = self2.negative ^ num.negative),\n (out.length = 19),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w0 >>> 26)) | 0),\n (w0 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w1 >>> 26)) | 0),\n (w1 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w2 >>> 26)) | 0),\n (w2 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w3 >>> 26)) | 0),\n (w3 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w4 >>> 26)) | 0),\n (w4 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w5 >>> 26)) | 0),\n (w5 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w6 >>> 26)) | 0),\n (w6 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w7 >>> 26)) | 0),\n (w7 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w8 >>> 26)) | 0),\n (w8 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w9 >>> 26)) | 0),\n (w9 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w10 >>> 26)) | 0),\n (w10 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w11 >>> 26)) | 0),\n (w11 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w12 >>> 26)) | 0),\n (w12 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w13 >>> 26)) | 0),\n (w13 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w14 >>> 26)) | 0),\n (w14 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w15 >>> 26)) | 0),\n (w15 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w16 >>> 26)) | 0),\n (w16 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w17 >>> 26)) | 0),\n (w17 &= 67108863),\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 & 8191) << 13)) | 0;\n return (\n (c = (((hi + (mid >>> 13)) | 0) + (w18 >>> 26)) | 0),\n (w18 &= 67108863),\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 c !== 0 && ((o[19] = c), out.length++),\n out\n );\n };\n Math.imul || (comb10MulTo = smallMulTo);\n function bigMulTo(self2, num, out) {\n (out.negative = num.negative ^ self2.negative), (out.length = self2.length + num.length);\n for (var carry = 0, hncarry = 0, k = 0; k < out.length - 1; k++) {\n var ncarry = hncarry;\n hncarry = 0;\n for (\n var rword = carry & 67108863, maxJ = Math.min(k, num.length - 1), j = Math.max(0, k - self2.length + 1);\n j <= maxJ;\n j++\n ) {\n var i = k - j,\n a = self2.words[i] | 0,\n b = num.words[j] | 0,\n r = a * b,\n lo = r & 67108863;\n (ncarry = (ncarry + ((r / 67108864) | 0)) | 0),\n (lo = (lo + rword) | 0),\n (rword = lo & 67108863),\n (ncarry = (ncarry + (lo >>> 26)) | 0),\n (hncarry += ncarry >>> 26),\n (ncarry &= 67108863);\n }\n (out.words[k] = rword), (carry = ncarry), (ncarry = hncarry);\n }\n return carry !== 0 ? (out.words[k] = carry) : out.length--, out.strip();\n }\n function jumboMulTo(self2, num, out) {\n var fftm = new FFTM();\n return fftm.mulp(self2, num, out);\n }\n BN.prototype.mulTo = function (num, out) {\n var res,\n len = this.length + num.length;\n return (\n this.length === 10 && num.length === 10\n ? (res = comb10MulTo(this, num, out))\n : len < 63\n ? (res = smallMulTo(this, num, out))\n : len < 1024\n ? (res = bigMulTo(this, num, out))\n : (res = jumboMulTo(this, num, out)),\n res\n );\n };\n function FFTM(x, y) {\n (this.x = x), (this.y = y);\n }\n (FFTM.prototype.makeRBT = function (N) {\n for (var t = new Array(N), l = BN.prototype._countBits(N) - 1, i = 0; i < N; i++) t[i] = this.revBin(i, l, N);\n return t;\n }),\n (FFTM.prototype.revBin = function (x, l, N) {\n if (x === 0 || x === N - 1) return x;\n for (var rb = 0, i = 0; i < l; i++) (rb |= (x & 1) << (l - i - 1)), (x >>= 1);\n return rb;\n }),\n (FFTM.prototype.permute = function (rbt, rws, iws, rtws, itws, N) {\n for (var i = 0; i < N; i++) (rtws[i] = rws[rbt[i]]), (itws[i] = iws[rbt[i]]);\n }),\n (FFTM.prototype.transform = function (rws, iws, rtws, itws, N, rbt) {\n this.permute(rbt, rws, iws, rtws, itws, N);\n for (var s = 1; s < N; s <<= 1)\n for (\n var l = s << 1, rtwdf = Math.cos((2 * Math.PI) / l), itwdf = Math.sin((2 * Math.PI) / l), p = 0;\n p < N;\n p += l\n )\n for (var rtwdf_ = rtwdf, itwdf_ = itwdf, j = 0; j < s; j++) {\n var re = rtws[p + j],\n ie = itws[p + j],\n ro = rtws[p + j + s],\n io = itws[p + j + s],\n rx = rtwdf_ * ro - itwdf_ * io;\n (io = rtwdf_ * io + itwdf_ * ro),\n (ro = rx),\n (rtws[p + j] = re + ro),\n (itws[p + j] = ie + io),\n (rtws[p + j + s] = re - ro),\n (itws[p + j + s] = ie - io),\n j !== l &&\n ((rx = rtwdf * rtwdf_ - itwdf * itwdf_), (itwdf_ = rtwdf * itwdf_ + itwdf * rtwdf_), (rtwdf_ = rx));\n }\n }),\n (FFTM.prototype.guessLen13b = function (n, m) {\n var N = Math.max(m, n) | 1,\n odd = N & 1,\n i = 0;\n for (N = (N / 2) | 0; N; N = N >>> 1) i++;\n return 1 << (i + 1 + odd);\n }),\n (FFTM.prototype.conjugate = function (rws, iws, N) {\n if (!(N <= 1))\n for (var i = 0; i < N / 2; i++) {\n var t = rws[i];\n (rws[i] = rws[N - i - 1]),\n (rws[N - i - 1] = t),\n (t = iws[i]),\n (iws[i] = -iws[N - i - 1]),\n (iws[N - i - 1] = -t);\n }\n }),\n (FFTM.prototype.normalize13b = function (ws, N) {\n for (var carry = 0, i = 0; i < N / 2; i++) {\n var w = Math.round(ws[2 * i + 1] / N) * 8192 + Math.round(ws[2 * i] / N) + carry;\n (ws[i] = w & 67108863), w < 67108864 ? (carry = 0) : (carry = (w / 67108864) | 0);\n }\n return ws;\n }),\n (FFTM.prototype.convert13b = function (ws, len, rws, N) {\n for (var carry = 0, i = 0; i < len; i++)\n (carry = carry + (ws[i] | 0)),\n (rws[2 * i] = carry & 8191),\n (carry = carry >>> 13),\n (rws[2 * i + 1] = carry & 8191),\n (carry = carry >>> 13);\n for (i = 2 * len; i < N; ++i) rws[i] = 0;\n assert(carry === 0), assert((carry & -8192) === 0);\n }),\n (FFTM.prototype.stub = function (N) {\n for (var ph = new Array(N), i = 0; i < N; i++) ph[i] = 0;\n return ph;\n }),\n (FFTM.prototype.mulp = function (x, y, out) {\n var N = 2 * this.guessLen13b(x.length, y.length),\n rbt = this.makeRBT(N),\n _ = this.stub(N),\n rws = new Array(N),\n rwst = new Array(N),\n iwst = new Array(N),\n nrws = new Array(N),\n nrwst = new Array(N),\n niwst = new Array(N),\n rmws = out.words;\n (rmws.length = N),\n this.convert13b(x.words, x.length, rws, N),\n this.convert13b(y.words, y.length, nrws, N),\n this.transform(rws, _, rwst, iwst, N, rbt),\n this.transform(nrws, _, nrwst, niwst, N, rbt);\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]), (rwst[i] = rx);\n }\n return (\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 (out.negative = x.negative ^ y.negative),\n (out.length = x.length + y.length),\n out.strip()\n );\n }),\n (BN.prototype.mul = function (num) {\n var out = new BN(null);\n return (out.words = new Array(this.length + num.length)), this.mulTo(num, out);\n }),\n (BN.prototype.mulf = function (num) {\n var out = new BN(null);\n return (out.words = new Array(this.length + num.length)), jumboMulTo(this, num, out);\n }),\n (BN.prototype.imul = function (num) {\n return this.clone().mulTo(num, this);\n }),\n (BN.prototype.imuln = function (num) {\n assert(typeof num == \"number\"), assert(num < 67108864);\n for (var carry = 0, i = 0; i < this.length; i++) {\n var w = (this.words[i] | 0) * num,\n lo = (w & 67108863) + (carry & 67108863);\n (carry >>= 26), (carry += (w / 67108864) | 0), (carry += lo >>> 26), (this.words[i] = lo & 67108863);\n }\n return carry !== 0 && ((this.words[i] = carry), this.length++), this;\n }),\n (BN.prototype.muln = function (num) {\n return this.clone().imuln(num);\n }),\n (BN.prototype.sqr = function () {\n return this.mul(this);\n }),\n (BN.prototype.isqr = function () {\n return this.imul(this.clone());\n }),\n (BN.prototype.pow = function (num) {\n var w = toBitArray(num);\n if (w.length === 0) return new BN(1);\n for (var res = this, i = 0; i < w.length && w[i] === 0; i++, res = res.sqr());\n if (++i < w.length) for (var q = res.sqr(); i < w.length; i++, q = q.sqr()) w[i] !== 0 && (res = res.mul(q));\n return res;\n }),\n (BN.prototype.iushln = function (bits) {\n assert(typeof bits == \"number\" && bits >= 0);\n var r = bits % 26,\n s = (bits - r) / 26,\n carryMask = (67108863 >>> (26 - r)) << (26 - r),\n i;\n if (r !== 0) {\n var carry = 0;\n for (i = 0; i < this.length; i++) {\n var newCarry = this.words[i] & carryMask,\n c = ((this.words[i] | 0) - newCarry) << r;\n (this.words[i] = c | carry), (carry = newCarry >>> (26 - r));\n }\n carry && ((this.words[i] = carry), this.length++);\n }\n if (s !== 0) {\n for (i = this.length - 1; i >= 0; i--) this.words[i + s] = this.words[i];\n for (i = 0; i < s; i++) this.words[i] = 0;\n this.length += s;\n }\n return this.strip();\n }),\n (BN.prototype.ishln = function (bits) {\n return assert(this.negative === 0), this.iushln(bits);\n }),\n (BN.prototype.iushrn = function (bits, hint, extended) {\n assert(typeof bits == \"number\" && bits >= 0);\n var h;\n hint ? (h = (hint - (hint % 26)) / 26) : (h = 0);\n var r = bits % 26,\n s = Math.min((bits - r) / 26, this.length),\n mask = 67108863 ^ ((67108863 >>> r) << r),\n maskedWords = extended;\n if (((h -= s), (h = Math.max(0, h)), maskedWords)) {\n for (var i = 0; i < s; i++) maskedWords.words[i] = this.words[i];\n maskedWords.length = s;\n }\n if (s !== 0)\n if (this.length > s) for (this.length -= s, i = 0; i < this.length; i++) this.words[i] = this.words[i + s];\n else (this.words[0] = 0), (this.length = 1);\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)), (carry = word & mask);\n }\n return (\n maskedWords && carry !== 0 && (maskedWords.words[maskedWords.length++] = carry),\n this.length === 0 && ((this.words[0] = 0), (this.length = 1)),\n this.strip()\n );\n }),\n (BN.prototype.ishrn = function (bits, hint, extended) {\n return assert(this.negative === 0), this.iushrn(bits, hint, extended);\n }),\n (BN.prototype.shln = function (bits) {\n return this.clone().ishln(bits);\n }),\n (BN.prototype.ushln = function (bits) {\n return this.clone().iushln(bits);\n }),\n (BN.prototype.shrn = function (bits) {\n return this.clone().ishrn(bits);\n }),\n (BN.prototype.ushrn = function (bits) {\n return this.clone().iushrn(bits);\n }),\n (BN.prototype.testn = function (bit) {\n assert(typeof bit == \"number\" && bit >= 0);\n var r = bit % 26,\n s = (bit - r) / 26,\n q = 1 << r;\n if (this.length <= s) return !1;\n var w = this.words[s];\n return !!(w & q);\n }),\n (BN.prototype.imaskn = function (bits) {\n assert(typeof bits == \"number\" && bits >= 0);\n var r = bits % 26,\n s = (bits - r) / 26;\n if ((assert(this.negative === 0, \"imaskn works only with positive numbers\"), this.length <= s)) return this;\n if ((r !== 0 && s++, (this.length = Math.min(s, this.length)), r !== 0)) {\n var mask = 67108863 ^ ((67108863 >>> r) << r);\n this.words[this.length - 1] &= mask;\n }\n return this.strip();\n }),\n (BN.prototype.maskn = function (bits) {\n return this.clone().imaskn(bits);\n }),\n (BN.prototype.iaddn = function (num) {\n return (\n assert(typeof num == \"number\"),\n assert(num < 67108864),\n num < 0\n ? this.isubn(-num)\n : this.negative !== 0\n ? this.length === 1 && (this.words[0] | 0) < num\n ? ((this.words[0] = num - (this.words[0] | 0)), (this.negative = 0), this)\n : ((this.negative = 0), this.isubn(num), (this.negative = 1), this)\n : this._iaddn(num)\n );\n }),\n (BN.prototype._iaddn = function (num) {\n this.words[0] += num;\n for (var i = 0; i < this.length && this.words[i] >= 67108864; i++)\n (this.words[i] -= 67108864), i === this.length - 1 ? (this.words[i + 1] = 1) : this.words[i + 1]++;\n return (this.length = Math.max(this.length, i + 1)), this;\n }),\n (BN.prototype.isubn = function (num) {\n if ((assert(typeof num == \"number\"), assert(num < 67108864), num < 0)) return this.iaddn(-num);\n if (this.negative !== 0) return (this.negative = 0), this.iaddn(num), (this.negative = 1), this;\n if (((this.words[0] -= num), this.length === 1 && this.words[0] < 0))\n (this.words[0] = -this.words[0]), (this.negative = 1);\n else\n for (var i = 0; i < this.length && this.words[i] < 0; i++)\n (this.words[i] += 67108864), (this.words[i + 1] -= 1);\n return this.strip();\n }),\n (BN.prototype.addn = function (num) {\n return this.clone().iaddn(num);\n }),\n (BN.prototype.subn = function (num) {\n return this.clone().isubn(num);\n }),\n (BN.prototype.iabs = function () {\n return (this.negative = 0), this;\n }),\n (BN.prototype.abs = function () {\n return this.clone().iabs();\n }),\n (BN.prototype._ishlnsubmul = function (num, mul, shift) {\n var len = num.length + shift,\n i;\n this._expand(len);\n var w,\n 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 & 67108863),\n (carry = (w >> 26) - ((right / 67108864) | 0)),\n (this.words[i + shift] = w & 67108863);\n }\n for (; i < this.length - shift; i++)\n (w = (this.words[i + shift] | 0) + carry), (carry = w >> 26), (this.words[i + shift] = w & 67108863);\n if (carry === 0) return this.strip();\n for (assert(carry === -1), carry = 0, i = 0; i < this.length; i++)\n (w = -(this.words[i] | 0) + carry), (carry = w >> 26), (this.words[i] = w & 67108863);\n return (this.negative = 1), this.strip();\n }),\n (BN.prototype._wordDiv = function (num, mode) {\n var shift = this.length - num.length,\n a = this.clone(),\n b = num,\n bhi = b.words[b.length - 1] | 0,\n bhiBits = this._countBits(bhi);\n (shift = 26 - bhiBits),\n shift !== 0 && ((b = b.ushln(shift)), a.iushln(shift), (bhi = b.words[b.length - 1] | 0));\n var m = a.length - b.length,\n q;\n if (mode !== \"mod\") {\n (q = new BN(null)), (q.length = m + 1), (q.words = new Array(q.length));\n for (var i = 0; i < q.length; i++) q.words[i] = 0;\n }\n var diff = a.clone()._ishlnsubmul(b, 1, m);\n diff.negative === 0 && ((a = diff), q && (q.words[m] = 1));\n for (var j = m - 1; j >= 0; j--) {\n var qj = (a.words[b.length + j] | 0) * 67108864 + (a.words[b.length + j - 1] | 0);\n for (qj = Math.min((qj / bhi) | 0, 67108863), a._ishlnsubmul(b, qj, j); a.negative !== 0; )\n qj--, (a.negative = 0), a._ishlnsubmul(b, 1, j), a.isZero() || (a.negative ^= 1);\n q && (q.words[j] = qj);\n }\n return (\n q && q.strip(),\n a.strip(),\n mode !== \"div\" && shift !== 0 && a.iushrn(shift),\n {\n div: q || null,\n mod: a,\n }\n );\n }),\n (BN.prototype.divmod = function (num, mode, positive) {\n if ((assert(!num.isZero()), this.isZero()))\n return {\n div: new BN(0),\n mod: new BN(0),\n };\n var div, mod, res;\n return this.negative !== 0 && num.negative === 0\n ? ((res = this.neg().divmod(num, mode)),\n mode !== \"mod\" && (div = res.div.neg()),\n mode !== \"div\" && ((mod = res.mod.neg()), positive && mod.negative !== 0 && mod.iadd(num)),\n {\n div,\n mod,\n })\n : this.negative === 0 && num.negative !== 0\n ? ((res = this.divmod(num.neg(), mode)),\n mode !== \"mod\" && (div = res.div.neg()),\n {\n div,\n mod: res.mod,\n })\n : (this.negative & num.negative) !== 0\n ? ((res = this.neg().divmod(num.neg(), mode)),\n mode !== \"div\" && ((mod = res.mod.neg()), positive && mod.negative !== 0 && mod.isub(num)),\n {\n div: res.div,\n mod,\n })\n : num.length > this.length || this.cmp(num) < 0\n ? {\n div: new BN(0),\n mod: this,\n }\n : num.length === 1\n ? mode === \"div\"\n ? {\n div: this.divn(num.words[0]),\n mod: null,\n }\n : mode === \"mod\"\n ? {\n div: null,\n mod: new BN(this.modn(num.words[0])),\n }\n : {\n div: this.divn(num.words[0]),\n mod: new BN(this.modn(num.words[0])),\n }\n : this._wordDiv(num, mode);\n }),\n (BN.prototype.div = function (num) {\n return this.divmod(num, \"div\", !1).div;\n }),\n (BN.prototype.mod = function (num) {\n return this.divmod(num, \"mod\", !1).mod;\n }),\n (BN.prototype.umod = function (num) {\n return this.divmod(num, \"mod\", !0).mod;\n }),\n (BN.prototype.divRound = function (num) {\n var dm = this.divmod(num);\n if (dm.mod.isZero()) return dm.div;\n var mod = dm.div.negative !== 0 ? dm.mod.isub(num) : dm.mod,\n half = num.ushrn(1),\n r2 = num.andln(1),\n cmp = mod.cmp(half);\n return cmp < 0 || (r2 === 1 && cmp === 0)\n ? dm.div\n : dm.div.negative !== 0\n ? dm.div.isubn(1)\n : dm.div.iaddn(1);\n }),\n (BN.prototype.modn = function (num) {\n assert(num <= 67108863);\n for (var p = (1 << 26) % num, acc = 0, i = this.length - 1; i >= 0; i--)\n acc = (p * acc + (this.words[i] | 0)) % num;\n return acc;\n }),\n (BN.prototype.idivn = function (num) {\n assert(num <= 67108863);\n for (var carry = 0, i = this.length - 1; i >= 0; i--) {\n var w = (this.words[i] | 0) + carry * 67108864;\n (this.words[i] = (w / num) | 0), (carry = w % num);\n }\n return this.strip();\n }),\n (BN.prototype.divn = function (num) {\n return this.clone().idivn(num);\n }),\n (BN.prototype.egcd = function (p) {\n assert(p.negative === 0), assert(!p.isZero());\n var x = this,\n y = p.clone();\n x.negative !== 0 ? (x = x.umod(p)) : (x = x.clone());\n for (var A = new BN(1), B = new BN(0), C = new BN(0), D = new BN(1), g = 0; x.isEven() && y.isEven(); )\n x.iushrn(1), y.iushrn(1), ++g;\n for (var yp = y.clone(), xp = x.clone(); !x.isZero(); ) {\n for (var i = 0, im = 1; (x.words[0] & im) === 0 && i < 26; ++i, im <<= 1);\n if (i > 0)\n for (x.iushrn(i); i-- > 0; )\n (A.isOdd() || B.isOdd()) && (A.iadd(yp), B.isub(xp)), A.iushrn(1), B.iushrn(1);\n for (var j = 0, jm = 1; (y.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n if (j > 0)\n for (y.iushrn(j); j-- > 0; )\n (C.isOdd() || D.isOdd()) && (C.iadd(yp), D.isub(xp)), C.iushrn(1), D.iushrn(1);\n x.cmp(y) >= 0 ? (x.isub(y), A.isub(C), B.isub(D)) : (y.isub(x), C.isub(A), D.isub(B));\n }\n return {\n a: C,\n b: D,\n gcd: y.iushln(g),\n };\n }),\n (BN.prototype._invmp = function (p) {\n assert(p.negative === 0), assert(!p.isZero());\n var a = this,\n b = p.clone();\n a.negative !== 0 ? (a = a.umod(p)) : (a = a.clone());\n for (var x1 = new BN(1), x2 = new BN(0), delta = b.clone(); 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) for (a.iushrn(i); i-- > 0; ) x1.isOdd() && x1.iadd(delta), x1.iushrn(1);\n for (var j = 0, jm = 1; (b.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n if (j > 0) for (b.iushrn(j); j-- > 0; ) x2.isOdd() && x2.iadd(delta), x2.iushrn(1);\n a.cmp(b) >= 0 ? (a.isub(b), x1.isub(x2)) : (b.isub(a), x2.isub(x1));\n }\n var res;\n return a.cmpn(1) === 0 ? (res = x1) : (res = x2), res.cmpn(0) < 0 && res.iadd(p), res;\n }),\n (BN.prototype.gcd = function (num) {\n if (this.isZero()) return num.abs();\n if (num.isZero()) return this.abs();\n var a = this.clone(),\n b = num.clone();\n (a.negative = 0), (b.negative = 0);\n for (var shift = 0; a.isEven() && b.isEven(); shift++) a.iushrn(1), b.iushrn(1);\n do {\n for (; a.isEven(); ) a.iushrn(1);\n for (; b.isEven(); ) b.iushrn(1);\n var r = a.cmp(b);\n if (r < 0) {\n var t = a;\n (a = b), (b = t);\n } else if (r === 0 || b.cmpn(1) === 0) break;\n a.isub(b);\n } while (!0);\n return b.iushln(shift);\n }),\n (BN.prototype.invm = function (num) {\n return this.egcd(num).a.umod(num);\n }),\n (BN.prototype.isEven = function () {\n return (this.words[0] & 1) === 0;\n }),\n (BN.prototype.isOdd = function () {\n return (this.words[0] & 1) === 1;\n }),\n (BN.prototype.andln = function (num) {\n return this.words[0] & num;\n }),\n (BN.prototype.bincn = function (bit) {\n assert(typeof bit == \"number\");\n var r = bit % 26,\n s = (bit - r) / 26,\n q = 1 << r;\n if (this.length <= s) return this._expand(s + 1), (this.words[s] |= q), this;\n for (var carry = q, i = s; carry !== 0 && i < this.length; i++) {\n var w = this.words[i] | 0;\n (w += carry), (carry = w >>> 26), (w &= 67108863), (this.words[i] = w);\n }\n return carry !== 0 && ((this.words[i] = carry), this.length++), this;\n }),\n (BN.prototype.isZero = function () {\n return this.length === 1 && this.words[0] === 0;\n }),\n (BN.prototype.cmpn = function (num) {\n var negative = num < 0;\n if (this.negative !== 0 && !negative) return -1;\n if (this.negative === 0 && negative) return 1;\n this.strip();\n var res;\n if (this.length > 1) res = 1;\n else {\n negative && (num = -num), assert(num <= 67108863, \"Number is too big\");\n var w = this.words[0] | 0;\n res = w === num ? 0 : w < num ? -1 : 1;\n }\n return this.negative !== 0 ? -res | 0 : res;\n }),\n (BN.prototype.cmp = function (num) {\n if (this.negative !== 0 && num.negative === 0) return -1;\n if (this.negative === 0 && num.negative !== 0) return 1;\n var res = this.ucmp(num);\n return this.negative !== 0 ? -res | 0 : res;\n }),\n (BN.prototype.ucmp = function (num) {\n if (this.length > num.length) return 1;\n if (this.length < num.length) return -1;\n for (var res = 0, i = this.length - 1; i >= 0; i--) {\n var a = this.words[i] | 0,\n b = num.words[i] | 0;\n if (a !== b) {\n a < b ? (res = -1) : a > b && (res = 1);\n break;\n }\n }\n return res;\n }),\n (BN.prototype.gtn = function (num) {\n return this.cmpn(num) === 1;\n }),\n (BN.prototype.gt = function (num) {\n return this.cmp(num) === 1;\n }),\n (BN.prototype.gten = function (num) {\n return this.cmpn(num) >= 0;\n }),\n (BN.prototype.gte = function (num) {\n return this.cmp(num) >= 0;\n }),\n (BN.prototype.ltn = function (num) {\n return this.cmpn(num) === -1;\n }),\n (BN.prototype.lt = function (num) {\n return this.cmp(num) === -1;\n }),\n (BN.prototype.lten = function (num) {\n return this.cmpn(num) <= 0;\n }),\n (BN.prototype.lte = function (num) {\n return this.cmp(num) <= 0;\n }),\n (BN.prototype.eqn = function (num) {\n return this.cmpn(num) === 0;\n }),\n (BN.prototype.eq = function (num) {\n return this.cmp(num) === 0;\n }),\n (BN.red = function (num) {\n return new Red(num);\n }),\n (BN.prototype.toRed = function (ctx) {\n return (\n assert(!this.red, \"Already a number in reduction context\"),\n assert(this.negative === 0, \"red works only with positives\"),\n ctx.convertTo(this)._forceRed(ctx)\n );\n }),\n (BN.prototype.fromRed = function () {\n return assert(this.red, \"fromRed works only with numbers in reduction context\"), this.red.convertFrom(this);\n }),\n (BN.prototype._forceRed = function (ctx) {\n return (this.red = ctx), this;\n }),\n (BN.prototype.forceRed = function (ctx) {\n return assert(!this.red, \"Already a number in reduction context\"), this._forceRed(ctx);\n }),\n (BN.prototype.redAdd = function (num) {\n return assert(this.red, \"redAdd works only with red numbers\"), this.red.add(this, num);\n }),\n (BN.prototype.redIAdd = function (num) {\n return assert(this.red, \"redIAdd works only with red numbers\"), this.red.iadd(this, num);\n }),\n (BN.prototype.redSub = function (num) {\n return assert(this.red, \"redSub works only with red numbers\"), this.red.sub(this, num);\n }),\n (BN.prototype.redISub = function (num) {\n return assert(this.red, \"redISub works only with red numbers\"), this.red.isub(this, num);\n }),\n (BN.prototype.redShl = function (num) {\n return assert(this.red, \"redShl works only with red numbers\"), this.red.shl(this, num);\n }),\n (BN.prototype.redMul = function (num) {\n return (\n assert(this.red, \"redMul works only with red numbers\"),\n this.red._verify2(this, num),\n this.red.mul(this, num)\n );\n }),\n (BN.prototype.redIMul = function (num) {\n return (\n assert(this.red, \"redMul works only with red numbers\"),\n this.red._verify2(this, num),\n this.red.imul(this, num)\n );\n }),\n (BN.prototype.redSqr = function () {\n return assert(this.red, \"redSqr works only with red numbers\"), this.red._verify1(this), this.red.sqr(this);\n }),\n (BN.prototype.redISqr = function () {\n return assert(this.red, \"redISqr works only with red numbers\"), this.red._verify1(this), this.red.isqr(this);\n }),\n (BN.prototype.redSqrt = function () {\n return assert(this.red, \"redSqrt works only with red numbers\"), this.red._verify1(this), this.red.sqrt(this);\n }),\n (BN.prototype.redInvm = function () {\n return assert(this.red, \"redInvm works only with red numbers\"), this.red._verify1(this), this.red.invm(this);\n }),\n (BN.prototype.redNeg = function () {\n return assert(this.red, \"redNeg works only with red numbers\"), this.red._verify1(this), this.red.neg(this);\n }),\n (BN.prototype.redPow = function (num) {\n return assert(this.red && !num.red, \"redPow(normalNum)\"), this.red._verify1(this), this.red.pow(this, num);\n });\n var primes = {\n k256: null,\n p224: null,\n p192: null,\n p25519: null,\n };\n function MPrime(name, p) {\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 (this.tmp = this._tmp());\n }\n (MPrime.prototype._tmp = function () {\n var tmp = new BN(null);\n return (tmp.words = new Array(Math.ceil(this.n / 13))), tmp;\n }),\n (MPrime.prototype.ireduce = function (num) {\n var r = num,\n rlen;\n do this.split(r, this.tmp), (r = this.imulK(r)), (r = r.iadd(this.tmp)), (rlen = r.bitLength());\n while (rlen > this.n);\n var cmp = rlen < this.n ? -1 : r.ucmp(this.p);\n return (\n cmp === 0\n ? ((r.words[0] = 0), (r.length = 1))\n : cmp > 0\n ? r.isub(this.p)\n : r.strip !== void 0\n ? r.strip()\n : r._strip(),\n r\n );\n }),\n (MPrime.prototype.split = function (input, out) {\n input.iushrn(this.n, 0, out);\n }),\n (MPrime.prototype.imulK = function (num) {\n return num.imul(this.k);\n });\n function K256() {\n MPrime.call(this, \"k256\", \"ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f\");\n }\n inherits(K256, MPrime),\n (K256.prototype.split = function (input, output) {\n for (var mask = 4194303, outLen = Math.min(input.length, 9), i = 0; i < outLen; i++)\n output.words[i] = input.words[i];\n if (((output.length = outLen), input.length <= 9)) {\n (input.words[0] = 0), (input.length = 1);\n return;\n }\n var prev = input.words[9];\n for (output.words[output.length++] = prev & mask, i = 10; i < input.length; i++) {\n var next = input.words[i] | 0;\n (input.words[i - 10] = ((next & mask) << 4) | (prev >>> 22)), (prev = next);\n }\n (prev >>>= 22),\n (input.words[i - 10] = prev),\n prev === 0 && input.length > 10 ? (input.length -= 10) : (input.length -= 9);\n }),\n (K256.prototype.imulK = function (num) {\n (num.words[num.length] = 0), (num.words[num.length + 1] = 0), (num.length += 2);\n for (var lo = 0, i = 0; i < num.length; i++) {\n var w = num.words[i] | 0;\n (lo += w * 977), (num.words[i] = lo & 67108863), (lo = w * 64 + ((lo / 67108864) | 0));\n }\n return (\n num.words[num.length - 1] === 0 && (num.length--, num.words[num.length - 1] === 0 && num.length--), num\n );\n });\n function P224() {\n MPrime.call(this, \"p224\", \"ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001\");\n }\n inherits(P224, MPrime);\n function P192() {\n MPrime.call(this, \"p192\", \"ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff\");\n }\n inherits(P192, MPrime);\n function P25519() {\n MPrime.call(this, \"25519\", \"7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed\");\n }\n inherits(P25519, MPrime),\n (P25519.prototype.imulK = function (num) {\n for (var carry = 0, i = 0; i < num.length; i++) {\n var hi = (num.words[i] | 0) * 19 + carry,\n lo = hi & 67108863;\n (hi >>>= 26), (num.words[i] = lo), (carry = hi);\n }\n return carry !== 0 && (num.words[num.length++] = carry), num;\n }),\n (BN._prime = function (name) {\n if (primes[name]) return primes[name];\n var prime2;\n if (name === \"k256\") prime2 = new K256();\n else if (name === \"p224\") prime2 = new P224();\n else if (name === \"p192\") prime2 = new P192();\n else if (name === \"p25519\") prime2 = new P25519();\n else throw new Error(\"Unknown prime \" + name);\n return (primes[name] = prime2), prime2;\n });\n function Red(m) {\n if (typeof m == \"string\") {\n var prime = BN._prime(m);\n (this.m = prime.p), (this.prime = prime);\n } else assert(m.gtn(1), \"modulus must be greater than 1\"), (this.m = m), (this.prime = null);\n }\n (Red.prototype._verify1 = function (a) {\n assert(a.negative === 0, \"red works only with positives\"), assert(a.red, \"red works only with red numbers\");\n }),\n (Red.prototype._verify2 = function (a, b) {\n assert((a.negative | b.negative) === 0, \"red works only with positives\"),\n assert(a.red && a.red === b.red, \"red works only with red numbers\");\n }),\n (Red.prototype.imod = function (a) {\n return this.prime ? this.prime.ireduce(a)._forceRed(this) : a.umod(this.m)._forceRed(this);\n }),\n (Red.prototype.neg = function (a) {\n return a.isZero() ? a.clone() : this.m.sub(a)._forceRed(this);\n }),\n (Red.prototype.add = function (a, b) {\n this._verify2(a, b);\n var res = a.add(b);\n return res.cmp(this.m) >= 0 && res.isub(this.m), res._forceRed(this);\n }),\n (Red.prototype.iadd = function (a, b) {\n this._verify2(a, b);\n var res = a.iadd(b);\n return res.cmp(this.m) >= 0 && res.isub(this.m), res;\n }),\n (Red.prototype.sub = function (a, b) {\n this._verify2(a, b);\n var res = a.sub(b);\n return res.cmpn(0) < 0 && res.iadd(this.m), res._forceRed(this);\n }),\n (Red.prototype.isub = function (a, b) {\n this._verify2(a, b);\n var res = a.isub(b);\n return res.cmpn(0) < 0 && res.iadd(this.m), res;\n }),\n (Red.prototype.shl = function (a, num) {\n return this._verify1(a), this.imod(a.ushln(num));\n }),\n (Red.prototype.imul = function (a, b) {\n return this._verify2(a, b), this.imod(a.imul(b));\n }),\n (Red.prototype.mul = function (a, b) {\n return this._verify2(a, b), this.imod(a.mul(b));\n }),\n (Red.prototype.isqr = function (a) {\n return this.imul(a, a.clone());\n }),\n (Red.prototype.sqr = function (a) {\n return this.mul(a, a);\n }),\n (Red.prototype.sqrt = function (a) {\n if (a.isZero()) return a.clone();\n var mod3 = this.m.andln(3);\n if ((assert(mod3 % 2 === 1), mod3 === 3)) {\n var pow = this.m.add(new BN(1)).iushrn(2);\n return this.pow(a, pow);\n }\n for (var q = this.m.subn(1), s = 0; !q.isZero() && q.andln(1) === 0; ) s++, q.iushrn(1);\n assert(!q.isZero());\n var one = new BN(1).toRed(this),\n nOne = one.redNeg(),\n lpow = this.m.subn(1).iushrn(1),\n z = this.m.bitLength();\n for (z = new BN(2 * z * z).toRed(this); this.pow(z, lpow).cmp(nOne) !== 0; ) z.redIAdd(nOne);\n for (\n var c = this.pow(z, q), r = this.pow(a, q.addn(1).iushrn(1)), t = this.pow(a, q), m = s;\n t.cmp(one) !== 0;\n\n ) {\n for (var tmp = t, i = 0; tmp.cmp(one) !== 0; i++) tmp = tmp.redSqr();\n assert(i < m);\n var b = this.pow(c, new BN(1).iushln(m - i - 1));\n (r = r.redMul(b)), (c = b.redSqr()), (t = t.redMul(c)), (m = i);\n }\n return r;\n }),\n (Red.prototype.invm = function (a) {\n var inv = a._invmp(this.m);\n return inv.negative !== 0 ? ((inv.negative = 0), this.imod(inv).redNeg()) : this.imod(inv);\n }),\n (Red.prototype.pow = function (a, num) {\n if (num.isZero()) return new BN(1).toRed(this);\n if (num.cmpn(1) === 0) return a.clone();\n var windowSize = 4,\n wnd = new Array(1 << windowSize);\n (wnd[0] = new BN(1).toRed(this)), (wnd[1] = a);\n for (var i = 2; i < wnd.length; i++) wnd[i] = this.mul(wnd[i - 1], a);\n var res = wnd[0],\n current = 0,\n currentLen = 0,\n start = num.bitLength() % 26;\n for (start === 0 && (start = 26), i = num.length - 1; i >= 0; i--) {\n for (var word = num.words[i], j = start - 1; j >= 0; j--) {\n var bit = (word >> j) & 1;\n if ((res !== wnd[0] && (res = this.sqr(res)), bit === 0 && current === 0)) {\n currentLen = 0;\n continue;\n }\n (current <<= 1),\n (current |= bit),\n currentLen++,\n !(currentLen !== windowSize && (i !== 0 || j !== 0)) &&\n ((res = this.mul(res, wnd[current])), (currentLen = 0), (current = 0));\n }\n start = 26;\n }\n return res;\n }),\n (Red.prototype.convertTo = function (num) {\n var r = num.umod(this.m);\n return r === num ? r.clone() : r;\n }),\n (Red.prototype.convertFrom = function (num) {\n var res = num.clone();\n return (res.red = null), res;\n }),\n (BN.mont = function (num) {\n return new Mont(num);\n });\n function Mont(m) {\n Red.call(this, m),\n (this.shift = this.m.bitLength()),\n this.shift % 26 !== 0 && (this.shift += 26 - (this.shift % 26)),\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 (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 (Mont.prototype.convertTo = function (num) {\n return this.imod(num.ushln(this.shift));\n }),\n (Mont.prototype.convertFrom = function (num) {\n var r = this.imod(num.mul(this.rinv));\n return (r.red = null), r;\n }),\n (Mont.prototype.imul = function (a, b) {\n if (a.isZero() || b.isZero()) return (a.words[0] = 0), (a.length = 1), a;\n var t = a.imul(b),\n c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m),\n u = t.isub(c).iushrn(this.shift),\n res = u;\n return (\n u.cmp(this.m) >= 0 ? (res = u.isub(this.m)) : u.cmpn(0) < 0 && (res = u.iadd(this.m)), res._forceRed(this)\n );\n }),\n (Mont.prototype.mul = function (a, b) {\n if (a.isZero() || b.isZero()) return new BN(0)._forceRed(this);\n var t = a.mul(b),\n c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m),\n u = t.isub(c).iushrn(this.shift),\n res = u;\n return (\n u.cmp(this.m) >= 0 ? (res = u.isub(this.m)) : u.cmpn(0) < 0 && (res = u.iadd(this.m)), res._forceRed(this)\n );\n }),\n (Mont.prototype.invm = function (a) {\n var res = this.imod(a._invmp(this.m).mul(this.r2));\n return res._forceRed(this);\n });\n })(typeof module > \"u\" || module, exports);\n },\n});\n\n// node_modules/create-ecdh/browser.js\nvar require_browser9 = __commonJS({\n \"node_modules/create-ecdh/browser.js\"(exports, module) {\n var elliptic = require_elliptic(),\n BN = require_bn6();\n module.exports = function (curve) {\n return new ECDH(curve);\n };\n var aliases = {\n secp256k1: {\n name: \"secp256k1\",\n byteLength: 32,\n },\n secp224r1: {\n name: \"p224\",\n byteLength: 28,\n },\n prime256v1: {\n name: \"p256\",\n byteLength: 32,\n },\n prime192v1: {\n name: \"p192\",\n byteLength: 24,\n },\n ed25519: {\n name: \"ed25519\",\n byteLength: 32,\n },\n secp384r1: {\n name: \"p384\",\n byteLength: 48,\n },\n secp521r1: {\n name: \"p521\",\n byteLength: 66,\n },\n };\n aliases.p224 = aliases.secp224r1;\n aliases.p256 = aliases.secp256r1 = aliases.prime256v1;\n aliases.p192 = aliases.secp192r1 = aliases.prime192v1;\n aliases.p384 = aliases.secp384r1;\n aliases.p521 = aliases.secp521r1;\n function ECDH(curve) {\n (this.curveType = aliases[curve]),\n this.curveType ||\n (this.curveType = {\n name: curve,\n }),\n (this.curve = new elliptic.ec(this.curveType.name)),\n (this.keys = void 0);\n }\n ECDH.prototype.generateKeys = function (enc, format) {\n return (this.keys = this.curve.genKeyPair()), this.getPublicKey(enc, format);\n };\n ECDH.prototype.computeSecret = function (other, inenc, enc) {\n (inenc = inenc || \"utf8\"), Buffer.isBuffer(other) || (other = new Buffer(other, inenc));\n var otherPub = this.curve.keyFromPublic(other).getPublic(),\n out = otherPub.mul(this.keys.getPrivate()).getX();\n return formatReturnValue(out, enc, this.curveType.byteLength);\n };\n ECDH.prototype.getPublicKey = function (enc, format) {\n var key = this.keys.getPublic(format === \"compressed\", !0);\n return (\n format === \"hybrid\" && (key[key.length - 1] % 2 ? (key[0] = 7) : (key[0] = 6)), formatReturnValue(key, enc)\n );\n };\n ECDH.prototype.getPrivateKey = function (enc) {\n return formatReturnValue(this.keys.getPrivate(), enc);\n };\n ECDH.prototype.setPublicKey = function (pub, enc) {\n return (\n (enc = enc || \"utf8\"), Buffer.isBuffer(pub) || (pub = new Buffer(pub, enc)), this.keys._importPublic(pub), this\n );\n };\n ECDH.prototype.setPrivateKey = function (priv, enc) {\n (enc = enc || \"utf8\"), Buffer.isBuffer(priv) || (priv = new Buffer(priv, enc));\n var _priv = new BN(priv);\n return (_priv = _priv.toString(16)), (this.keys = this.curve.genKeyPair()), this.keys._importPrivate(_priv), this;\n };\n function formatReturnValue(bn, enc, len) {\n Array.isArray(bn) || (bn = bn.toArray());\n var buf = new Buffer(bn);\n if (len && buf.length < len) {\n var zeros = new Buffer(len - buf.length);\n zeros.fill(0), (buf = Buffer.concat([zeros, buf]));\n }\n return enc ? buf.toString(enc) : buf;\n }\n },\n});\n\n// node_modules/public-encrypt/mgf.js\nvar require_mgf = __commonJS({\n \"node_modules/public-encrypt/mgf.js\"(exports, module) {\n var createHash = require_browser2(),\n Buffer2 = require_safe_buffer().Buffer;\n module.exports = function (seed, len) {\n for (var t = Buffer2.alloc(0), i = 0, c; t.length < len; )\n (c = i2ops(i++)), (t = Buffer2.concat([t, createHash(\"sha1\").update(seed).update(c).digest()]));\n return t.slice(0, len);\n };\n function i2ops(c) {\n var out = Buffer2.allocUnsafe(4);\n return out.writeUInt32BE(c, 0), out;\n }\n },\n});\n\n// node_modules/public-encrypt/xor.js\nvar require_xor = __commonJS({\n \"node_modules/public-encrypt/xor.js\"(exports, module) {\n module.exports = function (a, b) {\n for (var len = a.length, i = -1; ++i < len; ) a[i] ^= b[i];\n return a;\n };\n },\n});\n\n// node_modules/public-encrypt/node_modules/bn.js/lib/bn.js\nvar require_bn7 = __commonJS({\n \"node_modules/public-encrypt/node_modules/bn.js/lib/bn.js\"(exports, module) {\n (function (module2, exports2) {\n \"use strict\";\n function assert(val, msg) {\n if (!val) throw new Error(msg || \"Assertion failed\");\n }\n function inherits(ctor, superCtor) {\n ctor.super_ = superCtor;\n var TempCtor = function () {};\n (TempCtor.prototype = superCtor.prototype),\n (ctor.prototype = new TempCtor()),\n (ctor.prototype.constructor = ctor);\n }\n function BN(number, base, endian) {\n if (BN.isBN(number)) return number;\n (this.negative = 0),\n (this.words = null),\n (this.length = 0),\n (this.red = null),\n number !== null &&\n ((base === \"le\" || base === \"be\") && ((endian = base), (base = 10)),\n this._init(number || 0, base || 10, endian || \"be\"));\n }\n typeof module2 == \"object\" ? (module2.exports = BN) : (exports2.BN = BN), (BN.BN = BN), (BN.wordSize = 26);\n var Buffer2 = globalThis.Buffer;\n (BN.isBN = function (num) {\n return num instanceof BN\n ? !0\n : num !== null &&\n typeof num == \"object\" &&\n num.constructor.wordSize === BN.wordSize &&\n Array.isArray(num.words);\n }),\n (BN.max = function (left, right) {\n return left.cmp(right) > 0 ? left : right;\n }),\n (BN.min = function (left, right) {\n return left.cmp(right) < 0 ? left : right;\n }),\n (BN.prototype._init = function (number, base, endian) {\n if (typeof number == \"number\") return this._initNumber(number, base, endian);\n if (typeof number == \"object\") return this._initArray(number, base, endian);\n base === \"hex\" && (base = 16),\n assert(base === (base | 0) && base >= 2 && base <= 36),\n (number = number.toString().replace(/\\s+/g, \"\"));\n var start = 0;\n number[0] === \"-\" && (start++, (this.negative = 1)),\n start < number.length &&\n (base === 16\n ? this._parseHex(number, start, endian)\n : (this._parseBase(number, base, start),\n endian === \"le\" && this._initArray(this.toArray(), base, endian)));\n }),\n (BN.prototype._initNumber = function (number, base, endian) {\n number < 0 && ((this.negative = 1), (number = -number)),\n number < 67108864\n ? ((this.words = [number & 67108863]), (this.length = 1))\n : number < 4503599627370496\n ? ((this.words = [number & 67108863, (number / 67108864) & 67108863]), (this.length = 2))\n : (assert(number < 9007199254740992),\n (this.words = [number & 67108863, (number / 67108864) & 67108863, 1]),\n (this.length = 3)),\n endian === \"le\" && this._initArray(this.toArray(), base, endian);\n }),\n (BN.prototype._initArray = function (number, base, endian) {\n if ((assert(typeof number.length == \"number\"), number.length <= 0))\n return (this.words = [0]), (this.length = 1), this;\n (this.length = Math.ceil(number.length / 3)), (this.words = new Array(this.length));\n for (var i = 0; i < this.length; i++) this.words[i] = 0;\n var j,\n w,\n off = 0;\n if (endian === \"be\")\n for (i = number.length - 1, j = 0; i >= 0; i -= 3)\n (w = number[i] | (number[i - 1] << 8) | (number[i - 2] << 16)),\n (this.words[j] |= (w << off) & 67108863),\n (this.words[j + 1] = (w >>> (26 - off)) & 67108863),\n (off += 24),\n off >= 26 && ((off -= 26), j++);\n else if (endian === \"le\")\n for (i = 0, j = 0; i < number.length; i += 3)\n (w = number[i] | (number[i + 1] << 8) | (number[i + 2] << 16)),\n (this.words[j] |= (w << off) & 67108863),\n (this.words[j + 1] = (w >>> (26 - off)) & 67108863),\n (off += 24),\n off >= 26 && ((off -= 26), j++);\n return this.strip();\n });\n function parseHex4Bits(string, index) {\n var c = string.charCodeAt(index);\n return c >= 65 && c <= 70 ? c - 55 : c >= 97 && c <= 102 ? c - 87 : (c - 48) & 15;\n }\n function parseHexByte(string, lowerBound, index) {\n var r = parseHex4Bits(string, index);\n return index - 1 >= lowerBound && (r |= parseHex4Bits(string, index - 1) << 4), r;\n }\n BN.prototype._parseHex = function (number, start, endian) {\n (this.length = Math.ceil((number.length - start) / 6)), (this.words = new Array(this.length));\n for (var i = 0; i < this.length; i++) this.words[i] = 0;\n var off = 0,\n j = 0,\n w;\n if (endian === \"be\")\n for (i = number.length - 1; i >= start; i -= 2)\n (w = parseHexByte(number, start, i) << off),\n (this.words[j] |= w & 67108863),\n off >= 18 ? ((off -= 18), (j += 1), (this.words[j] |= w >>> 26)) : (off += 8);\n else {\n var parseLength = number.length - start;\n for (i = parseLength % 2 === 0 ? start + 1 : start; i < number.length; i += 2)\n (w = parseHexByte(number, start, i) << off),\n (this.words[j] |= w & 67108863),\n off >= 18 ? ((off -= 18), (j += 1), (this.words[j] |= w >>> 26)) : (off += 8);\n }\n this.strip();\n };\n function parseBase(str, start, end, mul) {\n for (var r = 0, len = Math.min(str.length, end), i = start; i < len; i++) {\n var c = str.charCodeAt(i) - 48;\n (r *= mul), c >= 49 ? (r += c - 49 + 10) : c >= 17 ? (r += c - 17 + 10) : (r += c);\n }\n return r;\n }\n (BN.prototype._parseBase = function (number, base, start) {\n (this.words = [0]), (this.length = 1);\n for (var limbLen = 0, limbPow = 1; limbPow <= 67108863; limbPow *= base) limbLen++;\n limbLen--, (limbPow = (limbPow / base) | 0);\n for (\n var total = number.length - start,\n mod = total % limbLen,\n end = Math.min(total, total - mod) + start,\n word = 0,\n i = start;\n i < end;\n i += limbLen\n )\n (word = parseBase(number, i, i + limbLen, base)),\n this.imuln(limbPow),\n this.words[0] + word < 67108864 ? (this.words[0] += word) : this._iaddn(word);\n if (mod !== 0) {\n var pow = 1;\n for (word = parseBase(number, i, number.length, base), i = 0; i < mod; i++) pow *= base;\n this.imuln(pow), this.words[0] + word < 67108864 ? (this.words[0] += word) : this._iaddn(word);\n }\n this.strip();\n }),\n (BN.prototype.copy = function (dest) {\n dest.words = new Array(this.length);\n for (var i = 0; i < this.length; i++) dest.words[i] = this.words[i];\n (dest.length = this.length), (dest.negative = this.negative), (dest.red = this.red);\n }),\n (BN.prototype.clone = function () {\n var r = new BN(null);\n return this.copy(r), r;\n }),\n (BN.prototype._expand = function (size) {\n for (; this.length < size; ) this.words[this.length++] = 0;\n return this;\n }),\n (BN.prototype.strip = function () {\n for (; this.length > 1 && this.words[this.length - 1] === 0; ) this.length--;\n return this._normSign();\n }),\n (BN.prototype._normSign = function () {\n return this.length === 1 && this.words[0] === 0 && (this.negative = 0), this;\n }),\n (BN.prototype.inspect = function () {\n return (this.red ? \"<BN-R: \" : \"<BN: \") + this.toString(16) + \">\";\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 groupSizes = [\n 0, 0, 25, 16, 12, 11, 10, 9, 8, 8, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5,\n 5, 5,\n ],\n groupBases = [\n 0, 0, 33554432, 43046721, 16777216, 48828125, 60466176, 40353607, 16777216, 43046721, 1e7, 19487171, 35831808,\n 62748517, 7529536, 11390625, 16777216, 24137569, 34012224, 47045881, 64e6, 4084101, 5153632, 6436343, 7962624,\n 9765625, 11881376, 14348907, 17210368, 20511149, 243e5, 28629151, 33554432, 39135393, 45435424, 52521875,\n 60466176,\n ];\n (BN.prototype.toString = function (base, padding) {\n (base = base || 10), (padding = padding | 0 || 1);\n var out;\n if (base === 16 || base === \"hex\") {\n out = \"\";\n for (var off = 0, carry = 0, i = 0; i < this.length; i++) {\n var w = this.words[i],\n word = (((w << off) | carry) & 16777215).toString(16);\n (carry = (w >>> (24 - off)) & 16777215),\n carry !== 0 || i !== this.length - 1 ? (out = zeros[6 - word.length] + word + out) : (out = word + out),\n (off += 2),\n off >= 26 && ((off -= 26), i--);\n }\n for (carry !== 0 && (out = carry.toString(16) + out); out.length % padding !== 0; ) out = \"0\" + out;\n return this.negative !== 0 && (out = \"-\" + out), out;\n }\n if (base === (base | 0) && base >= 2 && base <= 36) {\n var groupSize = groupSizes[base],\n groupBase = groupBases[base];\n out = \"\";\n var c = this.clone();\n for (c.negative = 0; !c.isZero(); ) {\n var r = c.modn(groupBase).toString(base);\n (c = c.idivn(groupBase)), c.isZero() ? (out = r + out) : (out = zeros[groupSize - r.length] + r + out);\n }\n for (this.isZero() && (out = \"0\" + out); out.length % padding !== 0; ) out = \"0\" + out;\n return this.negative !== 0 && (out = \"-\" + out), out;\n }\n assert(!1, \"Base should be between 2 and 36\");\n }),\n (BN.prototype.toNumber = function () {\n var ret = this.words[0];\n return (\n this.length === 2\n ? (ret += this.words[1] * 67108864)\n : this.length === 3 && this.words[2] === 1\n ? (ret += 4503599627370496 + this.words[1] * 67108864)\n : this.length > 2 && assert(!1, \"Number can only safely store up to 53 bits\"),\n this.negative !== 0 ? -ret : ret\n );\n }),\n (BN.prototype.toJSON = function () {\n return this.toString(16);\n }),\n (BN.prototype.toBuffer = function (endian, length) {\n return assert(typeof Buffer2 < \"u\"), this.toArrayLike(Buffer2, endian, length);\n }),\n (BN.prototype.toArray = function (endian, length) {\n return this.toArrayLike(Array, endian, length);\n }),\n (BN.prototype.toArrayLike = function (ArrayType, endian, length) {\n var byteLength = this.byteLength(),\n 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 this.strip();\n var littleEndian = endian === \"le\",\n res = new ArrayType(reqLength),\n b,\n i,\n q = this.clone();\n if (littleEndian) {\n for (i = 0; !q.isZero(); i++) (b = q.andln(255)), q.iushrn(8), (res[i] = b);\n for (; i < reqLength; i++) res[i] = 0;\n } else {\n for (i = 0; i < reqLength - byteLength; i++) res[i] = 0;\n for (i = 0; !q.isZero(); i++) (b = q.andln(255)), q.iushrn(8), (res[reqLength - i - 1] = b);\n }\n return res;\n }),\n Math.clz32\n ? (BN.prototype._countBits = function (w) {\n return 32 - Math.clz32(w);\n })\n : (BN.prototype._countBits = function (w) {\n var t = w,\n r = 0;\n return (\n t >= 4096 && ((r += 13), (t >>>= 13)),\n t >= 64 && ((r += 7), (t >>>= 7)),\n t >= 8 && ((r += 4), (t >>>= 4)),\n t >= 2 && ((r += 2), (t >>>= 2)),\n r + t\n );\n }),\n (BN.prototype._zeroBits = function (w) {\n if (w === 0) return 26;\n var t = w,\n r = 0;\n return (\n (t & 8191) === 0 && ((r += 13), (t >>>= 13)),\n (t & 127) === 0 && ((r += 7), (t >>>= 7)),\n (t & 15) === 0 && ((r += 4), (t >>>= 4)),\n (t & 3) === 0 && ((r += 2), (t >>>= 2)),\n (t & 1) === 0 && r++,\n r\n );\n }),\n (BN.prototype.bitLength = function () {\n var w = this.words[this.length - 1],\n hi = this._countBits(w);\n return (this.length - 1) * 26 + hi;\n });\n function toBitArray(num) {\n for (var w = new Array(num.bitLength()), bit = 0; bit < w.length; bit++) {\n var off = (bit / 26) | 0,\n wbit = bit % 26;\n w[bit] = (num.words[off] & (1 << wbit)) >>> wbit;\n }\n return w;\n }\n (BN.prototype.zeroBits = function () {\n if (this.isZero()) return 0;\n for (var r = 0, i = 0; i < this.length; i++) {\n var b = this._zeroBits(this.words[i]);\n if (((r += b), b !== 26)) break;\n }\n return r;\n }),\n (BN.prototype.byteLength = function () {\n return Math.ceil(this.bitLength() / 8);\n }),\n (BN.prototype.toTwos = function (width) {\n return this.negative !== 0 ? this.abs().inotn(width).iaddn(1) : this.clone();\n }),\n (BN.prototype.fromTwos = function (width) {\n return this.testn(width - 1) ? this.notn(width).iaddn(1).ineg() : this.clone();\n }),\n (BN.prototype.isNeg = function () {\n return this.negative !== 0;\n }),\n (BN.prototype.neg = function () {\n return this.clone().ineg();\n }),\n (BN.prototype.ineg = function () {\n return this.isZero() || (this.negative ^= 1), this;\n }),\n (BN.prototype.iuor = function (num) {\n for (; this.length < num.length; ) this.words[this.length++] = 0;\n for (var i = 0; i < num.length; i++) this.words[i] = this.words[i] | num.words[i];\n return this.strip();\n }),\n (BN.prototype.ior = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuor(num);\n }),\n (BN.prototype.or = function (num) {\n return this.length > num.length ? this.clone().ior(num) : num.clone().ior(this);\n }),\n (BN.prototype.uor = function (num) {\n return this.length > num.length ? this.clone().iuor(num) : num.clone().iuor(this);\n }),\n (BN.prototype.iuand = function (num) {\n var b;\n this.length > num.length ? (b = num) : (b = this);\n for (var i = 0; i < b.length; i++) this.words[i] = this.words[i] & num.words[i];\n return (this.length = b.length), this.strip();\n }),\n (BN.prototype.iand = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuand(num);\n }),\n (BN.prototype.and = function (num) {\n return this.length > num.length ? this.clone().iand(num) : num.clone().iand(this);\n }),\n (BN.prototype.uand = function (num) {\n return this.length > num.length ? this.clone().iuand(num) : num.clone().iuand(this);\n }),\n (BN.prototype.iuxor = function (num) {\n var a, b;\n this.length > num.length ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var i = 0; i < b.length; i++) this.words[i] = a.words[i] ^ b.words[i];\n if (this !== a) for (; i < a.length; i++) this.words[i] = a.words[i];\n return (this.length = a.length), this.strip();\n }),\n (BN.prototype.ixor = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuxor(num);\n }),\n (BN.prototype.xor = function (num) {\n return this.length > num.length ? this.clone().ixor(num) : num.clone().ixor(this);\n }),\n (BN.prototype.uxor = function (num) {\n return this.length > num.length ? this.clone().iuxor(num) : num.clone().iuxor(this);\n }),\n (BN.prototype.inotn = function (width) {\n assert(typeof width == \"number\" && width >= 0);\n var bytesNeeded = Math.ceil(width / 26) | 0,\n bitsLeft = width % 26;\n this._expand(bytesNeeded), bitsLeft > 0 && bytesNeeded--;\n for (var i = 0; i < bytesNeeded; i++) this.words[i] = ~this.words[i] & 67108863;\n return bitsLeft > 0 && (this.words[i] = ~this.words[i] & (67108863 >> (26 - bitsLeft))), this.strip();\n }),\n (BN.prototype.notn = function (width) {\n return this.clone().inotn(width);\n }),\n (BN.prototype.setn = function (bit, val) {\n assert(typeof bit == \"number\" && bit >= 0);\n var off = (bit / 26) | 0,\n wbit = bit % 26;\n return (\n this._expand(off + 1),\n val\n ? (this.words[off] = this.words[off] | (1 << wbit))\n : (this.words[off] = this.words[off] & ~(1 << wbit)),\n this.strip()\n );\n }),\n (BN.prototype.iadd = function (num) {\n var r;\n if (this.negative !== 0 && num.negative === 0)\n return (this.negative = 0), (r = this.isub(num)), (this.negative ^= 1), this._normSign();\n if (this.negative === 0 && num.negative !== 0)\n return (num.negative = 0), (r = this.isub(num)), (num.negative = 1), r._normSign();\n var a, b;\n this.length > num.length ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var carry = 0, i = 0; i < b.length; i++)\n (r = (a.words[i] | 0) + (b.words[i] | 0) + carry), (this.words[i] = r & 67108863), (carry = r >>> 26);\n for (; carry !== 0 && i < a.length; i++)\n (r = (a.words[i] | 0) + carry), (this.words[i] = r & 67108863), (carry = r >>> 26);\n if (((this.length = a.length), carry !== 0)) (this.words[this.length] = carry), this.length++;\n else if (a !== this) for (; i < a.length; i++) this.words[i] = a.words[i];\n return this;\n }),\n (BN.prototype.add = function (num) {\n var res;\n return num.negative !== 0 && this.negative === 0\n ? ((num.negative = 0), (res = this.sub(num)), (num.negative ^= 1), res)\n : num.negative === 0 && this.negative !== 0\n ? ((this.negative = 0), (res = num.sub(this)), (this.negative = 1), res)\n : this.length > num.length\n ? this.clone().iadd(num)\n : num.clone().iadd(this);\n }),\n (BN.prototype.isub = function (num) {\n if (num.negative !== 0) {\n num.negative = 0;\n var r = this.iadd(num);\n return (num.negative = 1), r._normSign();\n } else if (this.negative !== 0)\n return (this.negative = 0), this.iadd(num), (this.negative = 1), this._normSign();\n var cmp = this.cmp(num);\n if (cmp === 0) return (this.negative = 0), (this.length = 1), (this.words[0] = 0), this;\n var a, b;\n cmp > 0 ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var carry = 0, i = 0; i < b.length; i++)\n (r = (a.words[i] | 0) - (b.words[i] | 0) + carry), (carry = r >> 26), (this.words[i] = r & 67108863);\n for (; carry !== 0 && i < a.length; i++)\n (r = (a.words[i] | 0) + carry), (carry = r >> 26), (this.words[i] = r & 67108863);\n if (carry === 0 && i < a.length && a !== this) for (; i < a.length; i++) this.words[i] = a.words[i];\n return (this.length = Math.max(this.length, i)), a !== this && (this.negative = 1), this.strip();\n }),\n (BN.prototype.sub = function (num) {\n return this.clone().isub(num);\n });\n function smallMulTo(self2, num, out) {\n out.negative = num.negative ^ self2.negative;\n var len = (self2.length + num.length) | 0;\n (out.length = len), (len = (len - 1) | 0);\n var a = self2.words[0] | 0,\n b = num.words[0] | 0,\n r = a * b,\n lo = r & 67108863,\n carry = (r / 67108864) | 0;\n out.words[0] = lo;\n for (var k = 1; k < len; k++) {\n for (\n var ncarry = carry >>> 26,\n rword = carry & 67108863,\n maxJ = Math.min(k, num.length - 1),\n j = Math.max(0, k - self2.length + 1);\n j <= maxJ;\n j++\n ) {\n var i = (k - j) | 0;\n (a = self2.words[i] | 0),\n (b = num.words[j] | 0),\n (r = a * b + rword),\n (ncarry += (r / 67108864) | 0),\n (rword = r & 67108863);\n }\n (out.words[k] = rword | 0), (carry = ncarry | 0);\n }\n return carry !== 0 ? (out.words[k] = carry | 0) : out.length--, out.strip();\n }\n var comb10MulTo = function (self2, num, out) {\n var a = self2.words,\n b = num.words,\n o = out.words,\n c = 0,\n lo,\n mid,\n hi,\n a0 = a[0] | 0,\n al0 = a0 & 8191,\n ah0 = a0 >>> 13,\n a1 = a[1] | 0,\n al1 = a1 & 8191,\n ah1 = a1 >>> 13,\n a2 = a[2] | 0,\n al2 = a2 & 8191,\n ah2 = a2 >>> 13,\n a3 = a[3] | 0,\n al3 = a3 & 8191,\n ah3 = a3 >>> 13,\n a4 = a[4] | 0,\n al4 = a4 & 8191,\n ah4 = a4 >>> 13,\n a5 = a[5] | 0,\n al5 = a5 & 8191,\n ah5 = a5 >>> 13,\n a6 = a[6] | 0,\n al6 = a6 & 8191,\n ah6 = a6 >>> 13,\n a7 = a[7] | 0,\n al7 = a7 & 8191,\n ah7 = a7 >>> 13,\n a8 = a[8] | 0,\n al8 = a8 & 8191,\n ah8 = a8 >>> 13,\n a9 = a[9] | 0,\n al9 = a9 & 8191,\n ah9 = a9 >>> 13,\n b0 = b[0] | 0,\n bl0 = b0 & 8191,\n bh0 = b0 >>> 13,\n b1 = b[1] | 0,\n bl1 = b1 & 8191,\n bh1 = b1 >>> 13,\n b2 = b[2] | 0,\n bl2 = b2 & 8191,\n bh2 = b2 >>> 13,\n b3 = b[3] | 0,\n bl3 = b3 & 8191,\n bh3 = b3 >>> 13,\n b4 = b[4] | 0,\n bl4 = b4 & 8191,\n bh4 = b4 >>> 13,\n b5 = b[5] | 0,\n bl5 = b5 & 8191,\n bh5 = b5 >>> 13,\n b6 = b[6] | 0,\n bl6 = b6 & 8191,\n bh6 = b6 >>> 13,\n b7 = b[7] | 0,\n bl7 = b7 & 8191,\n bh7 = b7 >>> 13,\n b8 = b[8] | 0,\n bl8 = b8 & 8191,\n bh8 = b8 >>> 13,\n b9 = b[9] | 0,\n bl9 = b9 & 8191,\n bh9 = b9 >>> 13;\n (out.negative = self2.negative ^ num.negative),\n (out.length = 19),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w0 >>> 26)) | 0),\n (w0 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w1 >>> 26)) | 0),\n (w1 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w2 >>> 26)) | 0),\n (w2 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w3 >>> 26)) | 0),\n (w3 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w4 >>> 26)) | 0),\n (w4 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w5 >>> 26)) | 0),\n (w5 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w6 >>> 26)) | 0),\n (w6 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w7 >>> 26)) | 0),\n (w7 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w8 >>> 26)) | 0),\n (w8 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w9 >>> 26)) | 0),\n (w9 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w10 >>> 26)) | 0),\n (w10 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w11 >>> 26)) | 0),\n (w11 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w12 >>> 26)) | 0),\n (w12 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w13 >>> 26)) | 0),\n (w13 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w14 >>> 26)) | 0),\n (w14 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w15 >>> 26)) | 0),\n (w15 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w16 >>> 26)) | 0),\n (w16 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w17 >>> 26)) | 0),\n (w17 &= 67108863),\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 & 8191) << 13)) | 0;\n return (\n (c = (((hi + (mid >>> 13)) | 0) + (w18 >>> 26)) | 0),\n (w18 &= 67108863),\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 c !== 0 && ((o[19] = c), out.length++),\n out\n );\n };\n Math.imul || (comb10MulTo = smallMulTo);\n function bigMulTo(self2, num, out) {\n (out.negative = num.negative ^ self2.negative), (out.length = self2.length + num.length);\n for (var carry = 0, hncarry = 0, k = 0; k < out.length - 1; k++) {\n var ncarry = hncarry;\n hncarry = 0;\n for (\n var rword = carry & 67108863, maxJ = Math.min(k, num.length - 1), j = Math.max(0, k - self2.length + 1);\n j <= maxJ;\n j++\n ) {\n var i = k - j,\n a = self2.words[i] | 0,\n b = num.words[j] | 0,\n r = a * b,\n lo = r & 67108863;\n (ncarry = (ncarry + ((r / 67108864) | 0)) | 0),\n (lo = (lo + rword) | 0),\n (rword = lo & 67108863),\n (ncarry = (ncarry + (lo >>> 26)) | 0),\n (hncarry += ncarry >>> 26),\n (ncarry &= 67108863);\n }\n (out.words[k] = rword), (carry = ncarry), (ncarry = hncarry);\n }\n return carry !== 0 ? (out.words[k] = carry) : out.length--, out.strip();\n }\n function jumboMulTo(self2, num, out) {\n var fftm = new FFTM();\n return fftm.mulp(self2, num, out);\n }\n BN.prototype.mulTo = function (num, out) {\n var res,\n len = this.length + num.length;\n return (\n this.length === 10 && num.length === 10\n ? (res = comb10MulTo(this, num, out))\n : len < 63\n ? (res = smallMulTo(this, num, out))\n : len < 1024\n ? (res = bigMulTo(this, num, out))\n : (res = jumboMulTo(this, num, out)),\n res\n );\n };\n function FFTM(x, y) {\n (this.x = x), (this.y = y);\n }\n (FFTM.prototype.makeRBT = function (N) {\n for (var t = new Array(N), l = BN.prototype._countBits(N) - 1, i = 0; i < N; i++) t[i] = this.revBin(i, l, N);\n return t;\n }),\n (FFTM.prototype.revBin = function (x, l, N) {\n if (x === 0 || x === N - 1) return x;\n for (var rb = 0, i = 0; i < l; i++) (rb |= (x & 1) << (l - i - 1)), (x >>= 1);\n return rb;\n }),\n (FFTM.prototype.permute = function (rbt, rws, iws, rtws, itws, N) {\n for (var i = 0; i < N; i++) (rtws[i] = rws[rbt[i]]), (itws[i] = iws[rbt[i]]);\n }),\n (FFTM.prototype.transform = function (rws, iws, rtws, itws, N, rbt) {\n this.permute(rbt, rws, iws, rtws, itws, N);\n for (var s = 1; s < N; s <<= 1)\n for (\n var l = s << 1, rtwdf = Math.cos((2 * Math.PI) / l), itwdf = Math.sin((2 * Math.PI) / l), p = 0;\n p < N;\n p += l\n )\n for (var rtwdf_ = rtwdf, itwdf_ = itwdf, j = 0; j < s; j++) {\n var re = rtws[p + j],\n ie = itws[p + j],\n ro = rtws[p + j + s],\n io = itws[p + j + s],\n rx = rtwdf_ * ro - itwdf_ * io;\n (io = rtwdf_ * io + itwdf_ * ro),\n (ro = rx),\n (rtws[p + j] = re + ro),\n (itws[p + j] = ie + io),\n (rtws[p + j + s] = re - ro),\n (itws[p + j + s] = ie - io),\n j !== l &&\n ((rx = rtwdf * rtwdf_ - itwdf * itwdf_), (itwdf_ = rtwdf * itwdf_ + itwdf * rtwdf_), (rtwdf_ = rx));\n }\n }),\n (FFTM.prototype.guessLen13b = function (n, m) {\n var N = Math.max(m, n) | 1,\n odd = N & 1,\n i = 0;\n for (N = (N / 2) | 0; N; N = N >>> 1) i++;\n return 1 << (i + 1 + odd);\n }),\n (FFTM.prototype.conjugate = function (rws, iws, N) {\n if (!(N <= 1))\n for (var i = 0; i < N / 2; i++) {\n var t = rws[i];\n (rws[i] = rws[N - i - 1]),\n (rws[N - i - 1] = t),\n (t = iws[i]),\n (iws[i] = -iws[N - i - 1]),\n (iws[N - i - 1] = -t);\n }\n }),\n (FFTM.prototype.normalize13b = function (ws, N) {\n for (var carry = 0, i = 0; i < N / 2; i++) {\n var w = Math.round(ws[2 * i + 1] / N) * 8192 + Math.round(ws[2 * i] / N) + carry;\n (ws[i] = w & 67108863), w < 67108864 ? (carry = 0) : (carry = (w / 67108864) | 0);\n }\n return ws;\n }),\n (FFTM.prototype.convert13b = function (ws, len, rws, N) {\n for (var carry = 0, i = 0; i < len; i++)\n (carry = carry + (ws[i] | 0)),\n (rws[2 * i] = carry & 8191),\n (carry = carry >>> 13),\n (rws[2 * i + 1] = carry & 8191),\n (carry = carry >>> 13);\n for (i = 2 * len; i < N; ++i) rws[i] = 0;\n assert(carry === 0), assert((carry & -8192) === 0);\n }),\n (FFTM.prototype.stub = function (N) {\n for (var ph = new Array(N), i = 0; i < N; i++) ph[i] = 0;\n return ph;\n }),\n (FFTM.prototype.mulp = function (x, y, out) {\n var N = 2 * this.guessLen13b(x.length, y.length),\n rbt = this.makeRBT(N),\n _ = this.stub(N),\n rws = new Array(N),\n rwst = new Array(N),\n iwst = new Array(N),\n nrws = new Array(N),\n nrwst = new Array(N),\n niwst = new Array(N),\n rmws = out.words;\n (rmws.length = N),\n this.convert13b(x.words, x.length, rws, N),\n this.convert13b(y.words, y.length, nrws, N),\n this.transform(rws, _, rwst, iwst, N, rbt),\n this.transform(nrws, _, nrwst, niwst, N, rbt);\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]), (rwst[i] = rx);\n }\n return (\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 (out.negative = x.negative ^ y.negative),\n (out.length = x.length + y.length),\n out.strip()\n );\n }),\n (BN.prototype.mul = function (num) {\n var out = new BN(null);\n return (out.words = new Array(this.length + num.length)), this.mulTo(num, out);\n }),\n (BN.prototype.mulf = function (num) {\n var out = new BN(null);\n return (out.words = new Array(this.length + num.length)), jumboMulTo(this, num, out);\n }),\n (BN.prototype.imul = function (num) {\n return this.clone().mulTo(num, this);\n }),\n (BN.prototype.imuln = function (num) {\n assert(typeof num == \"number\"), assert(num < 67108864);\n for (var carry = 0, i = 0; i < this.length; i++) {\n var w = (this.words[i] | 0) * num,\n lo = (w & 67108863) + (carry & 67108863);\n (carry >>= 26), (carry += (w / 67108864) | 0), (carry += lo >>> 26), (this.words[i] = lo & 67108863);\n }\n return carry !== 0 && ((this.words[i] = carry), this.length++), this;\n }),\n (BN.prototype.muln = function (num) {\n return this.clone().imuln(num);\n }),\n (BN.prototype.sqr = function () {\n return this.mul(this);\n }),\n (BN.prototype.isqr = function () {\n return this.imul(this.clone());\n }),\n (BN.prototype.pow = function (num) {\n var w = toBitArray(num);\n if (w.length === 0) return new BN(1);\n for (var res = this, i = 0; i < w.length && w[i] === 0; i++, res = res.sqr());\n if (++i < w.length) for (var q = res.sqr(); i < w.length; i++, q = q.sqr()) w[i] !== 0 && (res = res.mul(q));\n return res;\n }),\n (BN.prototype.iushln = function (bits) {\n assert(typeof bits == \"number\" && bits >= 0);\n var r = bits % 26,\n s = (bits - r) / 26,\n carryMask = (67108863 >>> (26 - r)) << (26 - r),\n i;\n if (r !== 0) {\n var carry = 0;\n for (i = 0; i < this.length; i++) {\n var newCarry = this.words[i] & carryMask,\n c = ((this.words[i] | 0) - newCarry) << r;\n (this.words[i] = c | carry), (carry = newCarry >>> (26 - r));\n }\n carry && ((this.words[i] = carry), this.length++);\n }\n if (s !== 0) {\n for (i = this.length - 1; i >= 0; i--) this.words[i + s] = this.words[i];\n for (i = 0; i < s; i++) this.words[i] = 0;\n this.length += s;\n }\n return this.strip();\n }),\n (BN.prototype.ishln = function (bits) {\n return assert(this.negative === 0), this.iushln(bits);\n }),\n (BN.prototype.iushrn = function (bits, hint, extended) {\n assert(typeof bits == \"number\" && bits >= 0);\n var h;\n hint ? (h = (hint - (hint % 26)) / 26) : (h = 0);\n var r = bits % 26,\n s = Math.min((bits - r) / 26, this.length),\n mask = 67108863 ^ ((67108863 >>> r) << r),\n maskedWords = extended;\n if (((h -= s), (h = Math.max(0, h)), maskedWords)) {\n for (var i = 0; i < s; i++) maskedWords.words[i] = this.words[i];\n maskedWords.length = s;\n }\n if (s !== 0)\n if (this.length > s) for (this.length -= s, i = 0; i < this.length; i++) this.words[i] = this.words[i + s];\n else (this.words[0] = 0), (this.length = 1);\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)), (carry = word & mask);\n }\n return (\n maskedWords && carry !== 0 && (maskedWords.words[maskedWords.length++] = carry),\n this.length === 0 && ((this.words[0] = 0), (this.length = 1)),\n this.strip()\n );\n }),\n (BN.prototype.ishrn = function (bits, hint, extended) {\n return assert(this.negative === 0), this.iushrn(bits, hint, extended);\n }),\n (BN.prototype.shln = function (bits) {\n return this.clone().ishln(bits);\n }),\n (BN.prototype.ushln = function (bits) {\n return this.clone().iushln(bits);\n }),\n (BN.prototype.shrn = function (bits) {\n return this.clone().ishrn(bits);\n }),\n (BN.prototype.ushrn = function (bits) {\n return this.clone().iushrn(bits);\n }),\n (BN.prototype.testn = function (bit) {\n assert(typeof bit == \"number\" && bit >= 0);\n var r = bit % 26,\n s = (bit - r) / 26,\n q = 1 << r;\n if (this.length <= s) return !1;\n var w = this.words[s];\n return !!(w & q);\n }),\n (BN.prototype.imaskn = function (bits) {\n assert(typeof bits == \"number\" && bits >= 0);\n var r = bits % 26,\n s = (bits - r) / 26;\n if ((assert(this.negative === 0, \"imaskn works only with positive numbers\"), this.length <= s)) return this;\n if ((r !== 0 && s++, (this.length = Math.min(s, this.length)), r !== 0)) {\n var mask = 67108863 ^ ((67108863 >>> r) << r);\n this.words[this.length - 1] &= mask;\n }\n return this.strip();\n }),\n (BN.prototype.maskn = function (bits) {\n return this.clone().imaskn(bits);\n }),\n (BN.prototype.iaddn = function (num) {\n return (\n assert(typeof num == \"number\"),\n assert(num < 67108864),\n num < 0\n ? this.isubn(-num)\n : this.negative !== 0\n ? this.length === 1 && (this.words[0] | 0) < num\n ? ((this.words[0] = num - (this.words[0] | 0)), (this.negative = 0), this)\n : ((this.negative = 0), this.isubn(num), (this.negative = 1), this)\n : this._iaddn(num)\n );\n }),\n (BN.prototype._iaddn = function (num) {\n this.words[0] += num;\n for (var i = 0; i < this.length && this.words[i] >= 67108864; i++)\n (this.words[i] -= 67108864), i === this.length - 1 ? (this.words[i + 1] = 1) : this.words[i + 1]++;\n return (this.length = Math.max(this.length, i + 1)), this;\n }),\n (BN.prototype.isubn = function (num) {\n if ((assert(typeof num == \"number\"), assert(num < 67108864), num < 0)) return this.iaddn(-num);\n if (this.negative !== 0) return (this.negative = 0), this.iaddn(num), (this.negative = 1), this;\n if (((this.words[0] -= num), this.length === 1 && this.words[0] < 0))\n (this.words[0] = -this.words[0]), (this.negative = 1);\n else\n for (var i = 0; i < this.length && this.words[i] < 0; i++)\n (this.words[i] += 67108864), (this.words[i + 1] -= 1);\n return this.strip();\n }),\n (BN.prototype.addn = function (num) {\n return this.clone().iaddn(num);\n }),\n (BN.prototype.subn = function (num) {\n return this.clone().isubn(num);\n }),\n (BN.prototype.iabs = function () {\n return (this.negative = 0), this;\n }),\n (BN.prototype.abs = function () {\n return this.clone().iabs();\n }),\n (BN.prototype._ishlnsubmul = function (num, mul, shift) {\n var len = num.length + shift,\n i;\n this._expand(len);\n var w,\n 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 & 67108863),\n (carry = (w >> 26) - ((right / 67108864) | 0)),\n (this.words[i + shift] = w & 67108863);\n }\n for (; i < this.length - shift; i++)\n (w = (this.words[i + shift] | 0) + carry), (carry = w >> 26), (this.words[i + shift] = w & 67108863);\n if (carry === 0) return this.strip();\n for (assert(carry === -1), carry = 0, i = 0; i < this.length; i++)\n (w = -(this.words[i] | 0) + carry), (carry = w >> 26), (this.words[i] = w & 67108863);\n return (this.negative = 1), this.strip();\n }),\n (BN.prototype._wordDiv = function (num, mode) {\n var shift = this.length - num.length,\n a = this.clone(),\n b = num,\n bhi = b.words[b.length - 1] | 0,\n bhiBits = this._countBits(bhi);\n (shift = 26 - bhiBits),\n shift !== 0 && ((b = b.ushln(shift)), a.iushln(shift), (bhi = b.words[b.length - 1] | 0));\n var m = a.length - b.length,\n q;\n if (mode !== \"mod\") {\n (q = new BN(null)), (q.length = m + 1), (q.words = new Array(q.length));\n for (var i = 0; i < q.length; i++) q.words[i] = 0;\n }\n var diff = a.clone()._ishlnsubmul(b, 1, m);\n diff.negative === 0 && ((a = diff), q && (q.words[m] = 1));\n for (var j = m - 1; j >= 0; j--) {\n var qj = (a.words[b.length + j] | 0) * 67108864 + (a.words[b.length + j - 1] | 0);\n for (qj = Math.min((qj / bhi) | 0, 67108863), a._ishlnsubmul(b, qj, j); a.negative !== 0; )\n qj--, (a.negative = 0), a._ishlnsubmul(b, 1, j), a.isZero() || (a.negative ^= 1);\n q && (q.words[j] = qj);\n }\n return (\n q && q.strip(),\n a.strip(),\n mode !== \"div\" && shift !== 0 && a.iushrn(shift),\n {\n div: q || null,\n mod: a,\n }\n );\n }),\n (BN.prototype.divmod = function (num, mode, positive) {\n if ((assert(!num.isZero()), this.isZero()))\n return {\n div: new BN(0),\n mod: new BN(0),\n };\n var div, mod, res;\n return this.negative !== 0 && num.negative === 0\n ? ((res = this.neg().divmod(num, mode)),\n mode !== \"mod\" && (div = res.div.neg()),\n mode !== \"div\" && ((mod = res.mod.neg()), positive && mod.negative !== 0 && mod.iadd(num)),\n {\n div,\n mod,\n })\n : this.negative === 0 && num.negative !== 0\n ? ((res = this.divmod(num.neg(), mode)),\n mode !== \"mod\" && (div = res.div.neg()),\n {\n div,\n mod: res.mod,\n })\n : (this.negative & num.negative) !== 0\n ? ((res = this.neg().divmod(num.neg(), mode)),\n mode !== \"div\" && ((mod = res.mod.neg()), positive && mod.negative !== 0 && mod.isub(num)),\n {\n div: res.div,\n mod,\n })\n : num.length > this.length || this.cmp(num) < 0\n ? {\n div: new BN(0),\n mod: this,\n }\n : num.length === 1\n ? mode === \"div\"\n ? {\n div: this.divn(num.words[0]),\n mod: null,\n }\n : mode === \"mod\"\n ? {\n div: null,\n mod: new BN(this.modn(num.words[0])),\n }\n : {\n div: this.divn(num.words[0]),\n mod: new BN(this.modn(num.words[0])),\n }\n : this._wordDiv(num, mode);\n }),\n (BN.prototype.div = function (num) {\n return this.divmod(num, \"div\", !1).div;\n }),\n (BN.prototype.mod = function (num) {\n return this.divmod(num, \"mod\", !1).mod;\n }),\n (BN.prototype.umod = function (num) {\n return this.divmod(num, \"mod\", !0).mod;\n }),\n (BN.prototype.divRound = function (num) {\n var dm = this.divmod(num);\n if (dm.mod.isZero()) return dm.div;\n var mod = dm.div.negative !== 0 ? dm.mod.isub(num) : dm.mod,\n half = num.ushrn(1),\n r2 = num.andln(1),\n cmp = mod.cmp(half);\n return cmp < 0 || (r2 === 1 && cmp === 0)\n ? dm.div\n : dm.div.negative !== 0\n ? dm.div.isubn(1)\n : dm.div.iaddn(1);\n }),\n (BN.prototype.modn = function (num) {\n assert(num <= 67108863);\n for (var p = (1 << 26) % num, acc = 0, i = this.length - 1; i >= 0; i--)\n acc = (p * acc + (this.words[i] | 0)) % num;\n return acc;\n }),\n (BN.prototype.idivn = function (num) {\n assert(num <= 67108863);\n for (var carry = 0, i = this.length - 1; i >= 0; i--) {\n var w = (this.words[i] | 0) + carry * 67108864;\n (this.words[i] = (w / num) | 0), (carry = w % num);\n }\n return this.strip();\n }),\n (BN.prototype.divn = function (num) {\n return this.clone().idivn(num);\n }),\n (BN.prototype.egcd = function (p) {\n assert(p.negative === 0), assert(!p.isZero());\n var x = this,\n y = p.clone();\n x.negative !== 0 ? (x = x.umod(p)) : (x = x.clone());\n for (var A = new BN(1), B = new BN(0), C = new BN(0), D = new BN(1), g = 0; x.isEven() && y.isEven(); )\n x.iushrn(1), y.iushrn(1), ++g;\n for (var yp = y.clone(), xp = x.clone(); !x.isZero(); ) {\n for (var i = 0, im = 1; (x.words[0] & im) === 0 && i < 26; ++i, im <<= 1);\n if (i > 0)\n for (x.iushrn(i); i-- > 0; )\n (A.isOdd() || B.isOdd()) && (A.iadd(yp), B.isub(xp)), A.iushrn(1), B.iushrn(1);\n for (var j = 0, jm = 1; (y.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n if (j > 0)\n for (y.iushrn(j); j-- > 0; )\n (C.isOdd() || D.isOdd()) && (C.iadd(yp), D.isub(xp)), C.iushrn(1), D.iushrn(1);\n x.cmp(y) >= 0 ? (x.isub(y), A.isub(C), B.isub(D)) : (y.isub(x), C.isub(A), D.isub(B));\n }\n return {\n a: C,\n b: D,\n gcd: y.iushln(g),\n };\n }),\n (BN.prototype._invmp = function (p) {\n assert(p.negative === 0), assert(!p.isZero());\n var a = this,\n b = p.clone();\n a.negative !== 0 ? (a = a.umod(p)) : (a = a.clone());\n for (var x1 = new BN(1), x2 = new BN(0), delta = b.clone(); 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) for (a.iushrn(i); i-- > 0; ) x1.isOdd() && x1.iadd(delta), x1.iushrn(1);\n for (var j = 0, jm = 1; (b.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n if (j > 0) for (b.iushrn(j); j-- > 0; ) x2.isOdd() && x2.iadd(delta), x2.iushrn(1);\n a.cmp(b) >= 0 ? (a.isub(b), x1.isub(x2)) : (b.isub(a), x2.isub(x1));\n }\n var res;\n return a.cmpn(1) === 0 ? (res = x1) : (res = x2), res.cmpn(0) < 0 && res.iadd(p), res;\n }),\n (BN.prototype.gcd = function (num) {\n if (this.isZero()) return num.abs();\n if (num.isZero()) return this.abs();\n var a = this.clone(),\n b = num.clone();\n (a.negative = 0), (b.negative = 0);\n for (var shift = 0; a.isEven() && b.isEven(); shift++) a.iushrn(1), b.iushrn(1);\n do {\n for (; a.isEven(); ) a.iushrn(1);\n for (; b.isEven(); ) b.iushrn(1);\n var r = a.cmp(b);\n if (r < 0) {\n var t = a;\n (a = b), (b = t);\n } else if (r === 0 || b.cmpn(1) === 0) break;\n a.isub(b);\n } while (!0);\n return b.iushln(shift);\n }),\n (BN.prototype.invm = function (num) {\n return this.egcd(num).a.umod(num);\n }),\n (BN.prototype.isEven = function () {\n return (this.words[0] & 1) === 0;\n }),\n (BN.prototype.isOdd = function () {\n return (this.words[0] & 1) === 1;\n }),\n (BN.prototype.andln = function (num) {\n return this.words[0] & num;\n }),\n (BN.prototype.bincn = function (bit) {\n assert(typeof bit == \"number\");\n var r = bit % 26,\n s = (bit - r) / 26,\n q = 1 << r;\n if (this.length <= s) return this._expand(s + 1), (this.words[s] |= q), this;\n for (var carry = q, i = s; carry !== 0 && i < this.length; i++) {\n var w = this.words[i] | 0;\n (w += carry), (carry = w >>> 26), (w &= 67108863), (this.words[i] = w);\n }\n return carry !== 0 && ((this.words[i] = carry), this.length++), this;\n }),\n (BN.prototype.isZero = function () {\n return this.length === 1 && this.words[0] === 0;\n }),\n (BN.prototype.cmpn = function (num) {\n var negative = num < 0;\n if (this.negative !== 0 && !negative) return -1;\n if (this.negative === 0 && negative) return 1;\n this.strip();\n var res;\n if (this.length > 1) res = 1;\n else {\n negative && (num = -num), assert(num <= 67108863, \"Number is too big\");\n var w = this.words[0] | 0;\n res = w === num ? 0 : w < num ? -1 : 1;\n }\n return this.negative !== 0 ? -res | 0 : res;\n }),\n (BN.prototype.cmp = function (num) {\n if (this.negative !== 0 && num.negative === 0) return -1;\n if (this.negative === 0 && num.negative !== 0) return 1;\n var res = this.ucmp(num);\n return this.negative !== 0 ? -res | 0 : res;\n }),\n (BN.prototype.ucmp = function (num) {\n if (this.length > num.length) return 1;\n if (this.length < num.length) return -1;\n for (var res = 0, i = this.length - 1; i >= 0; i--) {\n var a = this.words[i] | 0,\n b = num.words[i] | 0;\n if (a !== b) {\n a < b ? (res = -1) : a > b && (res = 1);\n break;\n }\n }\n return res;\n }),\n (BN.prototype.gtn = function (num) {\n return this.cmpn(num) === 1;\n }),\n (BN.prototype.gt = function (num) {\n return this.cmp(num) === 1;\n }),\n (BN.prototype.gten = function (num) {\n return this.cmpn(num) >= 0;\n }),\n (BN.prototype.gte = function (num) {\n return this.cmp(num) >= 0;\n }),\n (BN.prototype.ltn = function (num) {\n return this.cmpn(num) === -1;\n }),\n (BN.prototype.lt = function (num) {\n return this.cmp(num) === -1;\n }),\n (BN.prototype.lten = function (num) {\n return this.cmpn(num) <= 0;\n }),\n (BN.prototype.lte = function (num) {\n return this.cmp(num) <= 0;\n }),\n (BN.prototype.eqn = function (num) {\n return this.cmpn(num) === 0;\n }),\n (BN.prototype.eq = function (num) {\n return this.cmp(num) === 0;\n }),\n (BN.red = function (num) {\n return new Red(num);\n }),\n (BN.prototype.toRed = function (ctx) {\n return (\n assert(!this.red, \"Already a number in reduction context\"),\n assert(this.negative === 0, \"red works only with positives\"),\n ctx.convertTo(this)._forceRed(ctx)\n );\n }),\n (BN.prototype.fromRed = function () {\n return assert(this.red, \"fromRed works only with numbers in reduction context\"), this.red.convertFrom(this);\n }),\n (BN.prototype._forceRed = function (ctx) {\n return (this.red = ctx), this;\n }),\n (BN.prototype.forceRed = function (ctx) {\n return assert(!this.red, \"Already a number in reduction context\"), this._forceRed(ctx);\n }),\n (BN.prototype.redAdd = function (num) {\n return assert(this.red, \"redAdd works only with red numbers\"), this.red.add(this, num);\n }),\n (BN.prototype.redIAdd = function (num) {\n return assert(this.red, \"redIAdd works only with red numbers\"), this.red.iadd(this, num);\n }),\n (BN.prototype.redSub = function (num) {\n return assert(this.red, \"redSub works only with red numbers\"), this.red.sub(this, num);\n }),\n (BN.prototype.redISub = function (num) {\n return assert(this.red, \"redISub works only with red numbers\"), this.red.isub(this, num);\n }),\n (BN.prototype.redShl = function (num) {\n return assert(this.red, \"redShl works only with red numbers\"), this.red.shl(this, num);\n }),\n (BN.prototype.redMul = function (num) {\n return (\n assert(this.red, \"redMul works only with red numbers\"),\n this.red._verify2(this, num),\n this.red.mul(this, num)\n );\n }),\n (BN.prototype.redIMul = function (num) {\n return (\n assert(this.red, \"redMul works only with red numbers\"),\n this.red._verify2(this, num),\n this.red.imul(this, num)\n );\n }),\n (BN.prototype.redSqr = function () {\n return assert(this.red, \"redSqr works only with red numbers\"), this.red._verify1(this), this.red.sqr(this);\n }),\n (BN.prototype.redISqr = function () {\n return assert(this.red, \"redISqr works only with red numbers\"), this.red._verify1(this), this.red.isqr(this);\n }),\n (BN.prototype.redSqrt = function () {\n return assert(this.red, \"redSqrt works only with red numbers\"), this.red._verify1(this), this.red.sqrt(this);\n }),\n (BN.prototype.redInvm = function () {\n return assert(this.red, \"redInvm works only with red numbers\"), this.red._verify1(this), this.red.invm(this);\n }),\n (BN.prototype.redNeg = function () {\n return assert(this.red, \"redNeg works only with red numbers\"), this.red._verify1(this), this.red.neg(this);\n }),\n (BN.prototype.redPow = function (num) {\n return assert(this.red && !num.red, \"redPow(normalNum)\"), this.red._verify1(this), this.red.pow(this, num);\n });\n var primes = {\n k256: null,\n p224: null,\n p192: null,\n p25519: null,\n };\n function MPrime(name, p) {\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 (this.tmp = this._tmp());\n }\n (MPrime.prototype._tmp = function () {\n var tmp = new BN(null);\n return (tmp.words = new Array(Math.ceil(this.n / 13))), tmp;\n }),\n (MPrime.prototype.ireduce = function (num) {\n var r = num,\n rlen;\n do this.split(r, this.tmp), (r = this.imulK(r)), (r = r.iadd(this.tmp)), (rlen = r.bitLength());\n while (rlen > this.n);\n var cmp = rlen < this.n ? -1 : r.ucmp(this.p);\n return (\n cmp === 0\n ? ((r.words[0] = 0), (r.length = 1))\n : cmp > 0\n ? r.isub(this.p)\n : r.strip !== void 0\n ? r.strip()\n : r._strip(),\n r\n );\n }),\n (MPrime.prototype.split = function (input, out) {\n input.iushrn(this.n, 0, out);\n }),\n (MPrime.prototype.imulK = function (num) {\n return num.imul(this.k);\n });\n function K256() {\n MPrime.call(this, \"k256\", \"ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f\");\n }\n inherits(K256, MPrime),\n (K256.prototype.split = function (input, output) {\n for (var mask = 4194303, outLen = Math.min(input.length, 9), i = 0; i < outLen; i++)\n output.words[i] = input.words[i];\n if (((output.length = outLen), input.length <= 9)) {\n (input.words[0] = 0), (input.length = 1);\n return;\n }\n var prev = input.words[9];\n for (output.words[output.length++] = prev & mask, i = 10; i < input.length; i++) {\n var next = input.words[i] | 0;\n (input.words[i - 10] = ((next & mask) << 4) | (prev >>> 22)), (prev = next);\n }\n (prev >>>= 22),\n (input.words[i - 10] = prev),\n prev === 0 && input.length > 10 ? (input.length -= 10) : (input.length -= 9);\n }),\n (K256.prototype.imulK = function (num) {\n (num.words[num.length] = 0), (num.words[num.length + 1] = 0), (num.length += 2);\n for (var lo = 0, i = 0; i < num.length; i++) {\n var w = num.words[i] | 0;\n (lo += w * 977), (num.words[i] = lo & 67108863), (lo = w * 64 + ((lo / 67108864) | 0));\n }\n return (\n num.words[num.length - 1] === 0 && (num.length--, num.words[num.length - 1] === 0 && num.length--), num\n );\n });\n function P224() {\n MPrime.call(this, \"p224\", \"ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001\");\n }\n inherits(P224, MPrime);\n function P192() {\n MPrime.call(this, \"p192\", \"ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff\");\n }\n inherits(P192, MPrime);\n function P25519() {\n MPrime.call(this, \"25519\", \"7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed\");\n }\n inherits(P25519, MPrime),\n (P25519.prototype.imulK = function (num) {\n for (var carry = 0, i = 0; i < num.length; i++) {\n var hi = (num.words[i] | 0) * 19 + carry,\n lo = hi & 67108863;\n (hi >>>= 26), (num.words[i] = lo), (carry = hi);\n }\n return carry !== 0 && (num.words[num.length++] = carry), num;\n }),\n (BN._prime = function (name) {\n if (primes[name]) return primes[name];\n var prime2;\n if (name === \"k256\") prime2 = new K256();\n else if (name === \"p224\") prime2 = new P224();\n else if (name === \"p192\") prime2 = new P192();\n else if (name === \"p25519\") prime2 = new P25519();\n else throw new Error(\"Unknown prime \" + name);\n return (primes[name] = prime2), prime2;\n });\n function Red(m) {\n if (typeof m == \"string\") {\n var prime = BN._prime(m);\n (this.m = prime.p), (this.prime = prime);\n } else assert(m.gtn(1), \"modulus must be greater than 1\"), (this.m = m), (this.prime = null);\n }\n (Red.prototype._verify1 = function (a) {\n assert(a.negative === 0, \"red works only with positives\"), assert(a.red, \"red works only with red numbers\");\n }),\n (Red.prototype._verify2 = function (a, b) {\n assert((a.negative | b.negative) === 0, \"red works only with positives\"),\n assert(a.red && a.red === b.red, \"red works only with red numbers\");\n }),\n (Red.prototype.imod = function (a) {\n return this.prime ? this.prime.ireduce(a)._forceRed(this) : a.umod(this.m)._forceRed(this);\n }),\n (Red.prototype.neg = function (a) {\n return a.isZero() ? a.clone() : this.m.sub(a)._forceRed(this);\n }),\n (Red.prototype.add = function (a, b) {\n this._verify2(a, b);\n var res = a.add(b);\n return res.cmp(this.m) >= 0 && res.isub(this.m), res._forceRed(this);\n }),\n (Red.prototype.iadd = function (a, b) {\n this._verify2(a, b);\n var res = a.iadd(b);\n return res.cmp(this.m) >= 0 && res.isub(this.m), res;\n }),\n (Red.prototype.sub = function (a, b) {\n this._verify2(a, b);\n var res = a.sub(b);\n return res.cmpn(0) < 0 && res.iadd(this.m), res._forceRed(this);\n }),\n (Red.prototype.isub = function (a, b) {\n this._verify2(a, b);\n var res = a.isub(b);\n return res.cmpn(0) < 0 && res.iadd(this.m), res;\n }),\n (Red.prototype.shl = function (a, num) {\n return this._verify1(a), this.imod(a.ushln(num));\n }),\n (Red.prototype.imul = function (a, b) {\n return this._verify2(a, b), this.imod(a.imul(b));\n }),\n (Red.prototype.mul = function (a, b) {\n return this._verify2(a, b), this.imod(a.mul(b));\n }),\n (Red.prototype.isqr = function (a) {\n return this.imul(a, a.clone());\n }),\n (Red.prototype.sqr = function (a) {\n return this.mul(a, a);\n }),\n (Red.prototype.sqrt = function (a) {\n if (a.isZero()) return a.clone();\n var mod3 = this.m.andln(3);\n if ((assert(mod3 % 2 === 1), mod3 === 3)) {\n var pow = this.m.add(new BN(1)).iushrn(2);\n return this.pow(a, pow);\n }\n for (var q = this.m.subn(1), s = 0; !q.isZero() && q.andln(1) === 0; ) s++, q.iushrn(1);\n assert(!q.isZero());\n var one = new BN(1).toRed(this),\n nOne = one.redNeg(),\n lpow = this.m.subn(1).iushrn(1),\n z = this.m.bitLength();\n for (z = new BN(2 * z * z).toRed(this); this.pow(z, lpow).cmp(nOne) !== 0; ) z.redIAdd(nOne);\n for (\n var c = this.pow(z, q), r = this.pow(a, q.addn(1).iushrn(1)), t = this.pow(a, q), m = s;\n t.cmp(one) !== 0;\n\n ) {\n for (var tmp = t, i = 0; tmp.cmp(one) !== 0; i++) tmp = tmp.redSqr();\n assert(i < m);\n var b = this.pow(c, new BN(1).iushln(m - i - 1));\n (r = r.redMul(b)), (c = b.redSqr()), (t = t.redMul(c)), (m = i);\n }\n return r;\n }),\n (Red.prototype.invm = function (a) {\n var inv = a._invmp(this.m);\n return inv.negative !== 0 ? ((inv.negative = 0), this.imod(inv).redNeg()) : this.imod(inv);\n }),\n (Red.prototype.pow = function (a, num) {\n if (num.isZero()) return new BN(1).toRed(this);\n if (num.cmpn(1) === 0) return a.clone();\n var windowSize = 4,\n wnd = new Array(1 << windowSize);\n (wnd[0] = new BN(1).toRed(this)), (wnd[1] = a);\n for (var i = 2; i < wnd.length; i++) wnd[i] = this.mul(wnd[i - 1], a);\n var res = wnd[0],\n current = 0,\n currentLen = 0,\n start = num.bitLength() % 26;\n for (start === 0 && (start = 26), i = num.length - 1; i >= 0; i--) {\n for (var word = num.words[i], j = start - 1; j >= 0; j--) {\n var bit = (word >> j) & 1;\n if ((res !== wnd[0] && (res = this.sqr(res)), bit === 0 && current === 0)) {\n currentLen = 0;\n continue;\n }\n (current <<= 1),\n (current |= bit),\n currentLen++,\n !(currentLen !== windowSize && (i !== 0 || j !== 0)) &&\n ((res = this.mul(res, wnd[current])), (currentLen = 0), (current = 0));\n }\n start = 26;\n }\n return res;\n }),\n (Red.prototype.convertTo = function (num) {\n var r = num.umod(this.m);\n return r === num ? r.clone() : r;\n }),\n (Red.prototype.convertFrom = function (num) {\n var res = num.clone();\n return (res.red = null), res;\n }),\n (BN.mont = function (num) {\n return new Mont(num);\n });\n function Mont(m) {\n Red.call(this, m),\n (this.shift = this.m.bitLength()),\n this.shift % 26 !== 0 && (this.shift += 26 - (this.shift % 26)),\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 (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 (Mont.prototype.convertTo = function (num) {\n return this.imod(num.ushln(this.shift));\n }),\n (Mont.prototype.convertFrom = function (num) {\n var r = this.imod(num.mul(this.rinv));\n return (r.red = null), r;\n }),\n (Mont.prototype.imul = function (a, b) {\n if (a.isZero() || b.isZero()) return (a.words[0] = 0), (a.length = 1), a;\n var t = a.imul(b),\n c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m),\n u = t.isub(c).iushrn(this.shift),\n res = u;\n return (\n u.cmp(this.m) >= 0 ? (res = u.isub(this.m)) : u.cmpn(0) < 0 && (res = u.iadd(this.m)), res._forceRed(this)\n );\n }),\n (Mont.prototype.mul = function (a, b) {\n if (a.isZero() || b.isZero()) return new BN(0)._forceRed(this);\n var t = a.mul(b),\n c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m),\n u = t.isub(c).iushrn(this.shift),\n res = u;\n return (\n u.cmp(this.m) >= 0 ? (res = u.isub(this.m)) : u.cmpn(0) < 0 && (res = u.iadd(this.m)), res._forceRed(this)\n );\n }),\n (Mont.prototype.invm = function (a) {\n var res = this.imod(a._invmp(this.m).mul(this.r2));\n return res._forceRed(this);\n });\n })(typeof module > \"u\" || module, exports);\n },\n});\n\nconst { CryptoHasher } = globalThis.Bun;\n\n// node_modules/public-encrypt/withPublic.js\nvar require_withPublic = __commonJS({\n \"node_modules/public-encrypt/withPublic.js\"(exports, module) {\n var BN = require_bn7(),\n Buffer2 = require_safe_buffer().Buffer;\n function withPublic(paddedMsg, key) {\n return Buffer2.from(paddedMsg.toRed(BN.mont(key.modulus)).redPow(new BN(key.publicExponent)).fromRed().toArray());\n }\n module.exports = withPublic;\n },\n});\n\n// node_modules/public-encrypt/publicEncrypt.js\nvar require_publicEncrypt = __commonJS({\n \"node_modules/public-encrypt/publicEncrypt.js\"(exports, module) {\n var parseKeys = require_parse_asn1(),\n randomBytes = require_browser(),\n createHash = require_browser2(),\n mgf = require_mgf(),\n xor = require_xor(),\n BN = require_bn7(),\n withPublic = require_withPublic(),\n crt = require_browserify_rsa(),\n Buffer2 = require_safe_buffer().Buffer;\n module.exports = function (publicKey, msg, reverse) {\n var padding;\n publicKey.padding ? (padding = publicKey.padding) : reverse ? (padding = 1) : (padding = 4);\n var key = parseKeys(publicKey),\n paddedMsg;\n if (padding === 4) paddedMsg = oaep(key, msg);\n else if (padding === 1) paddedMsg = pkcs1(key, msg, reverse);\n else if (padding === 3) {\n if (((paddedMsg = new BN(msg)), paddedMsg.cmp(key.modulus) >= 0)) throw new Error(\"data too long for modulus\");\n } else throw new Error(\"unknown padding\");\n return reverse ? crt(paddedMsg, key) : withPublic(paddedMsg, key);\n };\n function oaep(key, msg) {\n var k = key.modulus.byteLength(),\n mLen = msg.length,\n iHash = createHash(\"sha1\").update(Buffer2.alloc(0)).digest(),\n hLen = iHash.length,\n hLen2 = 2 * hLen;\n if (mLen > k - hLen2 - 2) throw new Error(\"message too long\");\n var ps = Buffer2.alloc(k - mLen - hLen2 - 2),\n dblen = k - hLen - 1,\n seed = randomBytes(hLen),\n maskedDb = xor(Buffer2.concat([iHash, ps, Buffer2.alloc(1, 1), msg], dblen), mgf(seed, dblen)),\n maskedSeed = xor(seed, mgf(maskedDb, hLen));\n return new BN(Buffer2.concat([Buffer2.alloc(1), maskedSeed, maskedDb], k));\n }\n function pkcs1(key, msg, reverse) {\n var mLen = msg.length,\n k = key.modulus.byteLength();\n if (mLen > k - 11) throw new Error(\"message too long\");\n var ps;\n return (\n reverse ? (ps = Buffer2.alloc(k - mLen - 3, 255)) : (ps = nonZero(k - mLen - 3)),\n new BN(Buffer2.concat([Buffer2.from([0, reverse ? 1 : 2]), ps, Buffer2.alloc(1), msg], k))\n );\n }\n function nonZero(len) {\n for (var out = Buffer2.allocUnsafe(len), i = 0, cache = randomBytes(len * 2), cur = 0, num; i < len; )\n cur === cache.length && ((cache = randomBytes(len * 2)), (cur = 0)),\n (num = cache[cur++]),\n num && (out[i++] = num);\n return out;\n }\n },\n});\n\n// node_modules/public-encrypt/privateDecrypt.js\nvar require_privateDecrypt = __commonJS({\n \"node_modules/public-encrypt/privateDecrypt.js\"(exports, module) {\n var parseKeys = require_parse_asn1(),\n mgf = require_mgf(),\n xor = require_xor(),\n BN = require_bn7(),\n crt = require_browserify_rsa(),\n createHash = require_browser2(),\n withPublic = require_withPublic(),\n Buffer2 = require_safe_buffer().Buffer;\n module.exports = function (privateKey, enc, reverse) {\n var padding;\n privateKey.padding ? (padding = privateKey.padding) : reverse ? (padding = 1) : (padding = 4);\n var key = parseKeys(privateKey),\n k = key.modulus.byteLength();\n if (enc.length > k || new BN(enc).cmp(key.modulus) >= 0) throw new Error(\"decryption error\");\n var msg;\n reverse ? (msg = withPublic(new BN(enc), key)) : (msg = crt(enc, key));\n var zBuffer = Buffer2.alloc(k - msg.length);\n if (((msg = Buffer2.concat([zBuffer, msg], k)), padding === 4)) return oaep(key, msg);\n if (padding === 1) return pkcs1(key, msg, reverse);\n if (padding === 3) return msg;\n throw new Error(\"unknown padding\");\n };\n function oaep(key, msg) {\n var k = key.modulus.byteLength(),\n iHash = createHash(\"sha1\").update(Buffer2.alloc(0)).digest(),\n hLen = iHash.length;\n if (msg[0] !== 0) throw new Error(\"decryption error\");\n var maskedSeed = msg.slice(1, hLen + 1),\n maskedDb = msg.slice(hLen + 1),\n seed = xor(maskedSeed, mgf(maskedDb, hLen)),\n db = xor(maskedDb, mgf(seed, k - hLen - 1));\n if (compare(iHash, db.slice(0, hLen))) throw new Error(\"decryption error\");\n for (var i = hLen; db[i] === 0; ) i++;\n if (db[i++] !== 1) throw new Error(\"decryption error\");\n return db.slice(i);\n }\n function pkcs1(key, msg, reverse) {\n for (var p1 = msg.slice(0, 2), i = 2, status = 0; msg[i++] !== 0; )\n if (i >= msg.length) {\n status++;\n break;\n }\n var ps = msg.slice(2, i - 1);\n if (\n (((p1.toString(\"hex\") !== \"0002\" && !reverse) || (p1.toString(\"hex\") !== \"0001\" && reverse)) && status++,\n ps.length < 8 && status++,\n status)\n )\n throw new Error(\"decryption error\");\n return msg.slice(i);\n }\n function compare(a, b) {\n (a = Buffer2.from(a)), (b = Buffer2.from(b));\n var dif = 0,\n len = a.length;\n a.length !== b.length && (dif++, (len = Math.min(a.length, b.length)));\n for (var i = -1; ++i < len; ) dif += a[i] ^ b[i];\n return dif;\n }\n },\n});\n\n// node_modules/public-encrypt/browser.js\nvar require_browser10 = __commonJS({\n \"node_modules/public-encrypt/browser.js\"(exports) {\n exports.publicEncrypt = require_publicEncrypt();\n exports.privateDecrypt = require_privateDecrypt();\n exports.privateEncrypt = function (key, buf) {\n return exports.publicEncrypt(key, buf, !0);\n };\n exports.publicDecrypt = function (key, buf) {\n return exports.privateDecrypt(key, buf, !0);\n };\n },\n});\n\n// node_modules/randomfill/browser.js\nvar require_browser11 = __commonJS({\n \"node_modules/randomfill/browser.js\"(exports) {\n \"use strict\";\n var safeBuffer = require_safe_buffer(),\n randombytes = require_browser(),\n Buffer2 = safeBuffer.Buffer,\n kBufferMaxLength = safeBuffer.kMaxLength,\n kMaxUint32 = Math.pow(2, 32) - 1;\n function assertOffset(offset, length) {\n if (typeof offset != \"number\" || offset !== offset) throw new TypeError(\"offset must be a number\");\n if (offset > kMaxUint32 || offset < 0) throw new TypeError(\"offset must be a uint32\");\n if (offset > kBufferMaxLength || offset > length) throw new RangeError(\"offset out of range\");\n }\n function assertSize(size, offset, length) {\n if (typeof size != \"number\" || size !== size) throw new TypeError(\"size must be a number\");\n if (size > kMaxUint32 || size < 0) throw new TypeError(\"size must be a uint32\");\n if (size + offset > length || size > kBufferMaxLength) throw new RangeError(\"buffer too small\");\n }\n\n exports.randomFill = randomFill;\n exports.randomFillSync = randomFillSync;\n\n function randomFill(buf, offset, size, cb) {\n if (!Buffer2.isBuffer(buf) && !(buf instanceof global.Uint8Array))\n throw new TypeError('\"buf\" argument must be a Buffer or Uint8Array');\n if (typeof offset == \"function\") (cb = offset), (offset = 0), (size = buf.length);\n else if (typeof size == \"function\") (cb = size), (size = buf.length - offset);\n else if (typeof cb != \"function\") throw new TypeError('\"cb\" argument must be a function');\n return assertOffset(offset, buf.length), assertSize(size, offset, buf.length), actualFill(buf, offset, size, cb);\n }\n function actualFill(buf, offset, size, cb) {\n if (cb) {\n randombytes(size, function (err, bytes2) {\n if (err) return cb(err);\n bytes2.copy(buf, offset), cb(null, buf);\n });\n return;\n }\n var bytes = randombytes(size);\n return bytes.copy(buf, offset), buf;\n }\n function randomFillSync(buf, offset, size) {\n if ((typeof offset > \"u\" && (offset = 0), !Buffer2.isBuffer(buf) && !(buf instanceof global.Uint8Array)))\n throw new TypeError('\"buf\" argument must be a Buffer or Uint8Array');\n return (\n assertOffset(offset, buf.length),\n size === void 0 && (size = buf.length - offset),\n assertSize(size, offset, buf.length),\n actualFill(buf, offset, size)\n );\n }\n },\n});\n\n// node_modules/crypto-browserify/index.js\nvar require_crypto_browserify2 = __commonJS({\n \"node_modules/crypto-browserify/index.js\"(exports) {\n \"use strict\";\n exports.randomBytes = exports.rng = exports.pseudoRandomBytes = exports.prng = require_browser();\n exports.createHash = require_browser2();\n exports.Hash = exports.createHash.Hash;\n exports.createHmac = exports.Hmac = require_browser3();\n var algos = require_algos(),\n algoKeys = Object.keys(algos),\n hashes = [\"sha1\", \"sha224\", \"sha256\", \"sha384\", \"sha512\", \"md5\", \"rmd160\"].concat(algoKeys);\n exports.getHashes = function () {\n return hashes;\n };\n var p = require_browser4();\n exports.pbkdf2 = p.pbkdf2;\n exports.pbkdf2Sync = p.pbkdf2Sync;\n var aes = require_browser6();\n exports.Cipher = aes.Cipher;\n exports.createCipher = aes.createCipher;\n exports.Cipheriv = aes.Cipheriv;\n exports.createCipheriv = aes.createCipheriv;\n exports.Decipher = aes.Decipher;\n exports.createDecipher = aes.createDecipher;\n exports.Decipheriv = aes.Decipheriv;\n exports.createDecipheriv = aes.createDecipheriv;\n exports.getCiphers = aes.getCiphers;\n exports.listCiphers = aes.listCiphers;\n var dh = require_browser7();\n exports.DiffieHellmanGroup = dh.DiffieHellmanGroup;\n exports.createDiffieHellmanGroup = dh.createDiffieHellmanGroup;\n exports.getDiffieHellman = dh.getDiffieHellman;\n exports.createDiffieHellman = dh.createDiffieHellman;\n exports.DiffieHellman = dh.DiffieHellman;\n var sign = require_browser8();\n exports.createSign = sign.createSign;\n exports.Sign = sign.Sign;\n exports.createVerify = sign.createVerify;\n exports.Verify = sign.Verify;\n exports.createECDH = require_browser9();\n var publicEncrypt = require_browser10();\n exports.publicEncrypt = publicEncrypt.publicEncrypt;\n exports.privateEncrypt = publicEncrypt.privateEncrypt;\n exports.publicDecrypt = publicEncrypt.publicDecrypt;\n exports.privateDecrypt = publicEncrypt.privateDecrypt;\n exports.getRandomValues = values => crypto.getRandomValues(values);\n var rf = require_browser11();\n exports.randomFill = rf.randomFill;\n exports.randomFillSync = rf.randomFillSync;\n exports.createCredentials = function () {\n throw new Error(\n [\n \"sorry, createCredentials is not implemented yet\",\n \"we accept pull requests\",\n \"https://github.com/crypto-browserify/crypto-browserify\",\n ].join(`\n`),\n );\n };\n exports.constants = {\n DH_CHECK_P_NOT_SAFE_PRIME: 2,\n DH_CHECK_P_NOT_PRIME: 1,\n DH_UNABLE_TO_CHECK_GENERATOR: 4,\n DH_NOT_SUITABLE_GENERATOR: 8,\n NPN_ENABLED: 1,\n ALPN_ENABLED: 1,\n RSA_PKCS1_PADDING: 1,\n RSA_SSLV23_PADDING: 2,\n RSA_NO_PADDING: 3,\n RSA_PKCS1_OAEP_PADDING: 4,\n RSA_X931_PADDING: 5,\n RSA_PKCS1_PSS_PADDING: 6,\n POINT_CONVERSION_COMPRESSED: 2,\n POINT_CONVERSION_UNCOMPRESSED: 4,\n POINT_CONVERSION_HYBRID: 6,\n };\n },\n});\n\n// crypto.js\nvar crypto_exports = {\n ...require_crypto_browserify2(),\n [Symbol.for(\"CommonJS\")]: 0,\n};\nvar DEFAULT_ENCODING = \"buffer\",\n getRandomValues = array => crypto.getRandomValues(array),\n randomUUID = () => crypto.randomUUID(),\n timingSafeEqual =\n \"timingSafeEqual\" in crypto\n ? (a, b) => {\n let { byteLength: byteLengthA } = a,\n { byteLength: byteLengthB } = b;\n if (typeof byteLengthA != \"number\" || typeof byteLengthB != \"number\")\n throw new TypeError(\"Input must be an array buffer view\");\n if (byteLengthA !== byteLengthB) throw new RangeError(\"Input buffers must have the same length\");\n return crypto.timingSafeEqual(a, b);\n }\n : void 0,\n scryptSync =\n \"scryptSync\" in crypto\n ? (password, salt, keylen, options) => {\n let res = crypto.scryptSync(password, salt, keylen, options);\n return DEFAULT_ENCODING !== \"buffer\" ? new Buffer(res).toString(DEFAULT_ENCODING) : new Buffer(res);\n }\n : void 0,\n scrypt =\n \"scryptSync\" in crypto\n ? function (password, salt, keylen, options, callback) {\n if (\n (typeof options == \"function\" && ((callback = options), (options = void 0)), typeof callback != \"function\")\n ) {\n var err = new TypeError(\"callback must be a function\");\n throw ((err.code = \"ERR_INVALID_CALLBACK\"), err);\n }\n try {\n let result = crypto.scryptSync(password, salt, keylen, options);\n process.nextTick(\n callback,\n null,\n DEFAULT_ENCODING !== \"buffer\" ? new Buffer(result).toString(DEFAULT_ENCODING) : new Buffer(result),\n );\n } catch (err2) {\n throw err2;\n }\n }\n : void 0;\ntimingSafeEqual &&\n (Object.defineProperty(timingSafeEqual, \"name\", {\n value: \"::bunternal::\",\n }),\n Object.defineProperty(scrypt, \"name\", {\n value: \"::bunternal::\",\n }),\n Object.defineProperty(scryptSync, \"name\", {\n value: \"::bunternal::\",\n }));\nvar webcrypto = crypto;\n__export(crypto_exports, {\n DEFAULT_ENCODING: () => DEFAULT_ENCODING,\n getRandomValues: () => getRandomValues,\n randomUUID: () => randomUUID,\n scrypt: () => scrypt,\n scryptSync: () => scryptSync,\n timingSafeEqual: () => timingSafeEqual,\n webcrypto: () => webcrypto,\n subtle: () => webcrypto.subtle,\n});\n\nexport const {\n randomBytes,\n rng,\n pseudoRandomBytes,\n prng,\n Hash,\n createHash,\n createHmac,\n Hmac,\n getHashes,\n pbkdf2,\n pbkdf2Sync,\n Cipher,\n createCipher,\n Cipheriv,\n createCipheriv,\n Decipher,\n createDecipher,\n Decipheriv,\n createDecipheriv,\n getCiphers,\n listCiphers,\n DiffieHellmanGroup,\n createDiffieHellmanGroup,\n getDiffieHellman,\n createDiffieHellman,\n DiffieHellman,\n createSign,\n Sign,\n createVerify,\n Verify,\n createECDH,\n publicEncrypt,\n privateEncrypt,\n publicDecrypt,\n privateDecrypt,\n randomFill,\n randomFillSync,\n createCredentials,\n constants,\n} = crypto_exports;\nexport { DEFAULT_ENCODING, getRandomValues, randomUUID, scrypt, scryptSync, timingSafeEqual, webcrypto };\nexport default crypto_exports;\n/*! safe-buffer. MIT License. Feross Aboukhadijeh <https://feross.org/opensource> */\n", - "// Hardcoded module \"node:crypto\"\nvar __create = Object.create;\nvar __defProp = Object.defineProperty;\nvar __getOwnPropDesc = Object.getOwnPropertyDescriptor;\nvar __getOwnPropNames = Object.getOwnPropertyNames;\nvar __getProtoOf = Object.getPrototypeOf,\n __hasOwnProp = Object.prototype.hasOwnProperty;\n\nconst MAX_STRING_LENGTH = 536870888;\n\nvar __require = id => import.meta.require(id);\nconst crypto = globalThis.crypto;\nconst globalCrypto = crypto;\n\nvar __esm = (fn, res) =>\n function () {\n return fn && (res = (0, fn[__getOwnPropNames(fn)[0]])((fn = 0))), res;\n };\nvar __commonJS = (cb, mod) =>\n function () {\n return mod || (0, cb[__getOwnPropNames(cb)[0]])((mod = { exports: {} }).exports, mod), mod.exports;\n };\nvar __export = (target, all) => {\n for (var name in all) __defProp(target, name, { get: all[name], enumerable: !0 });\n },\n __copyProps = (to, from, except, desc) => {\n if ((from && typeof from == \"object\") || typeof from == \"function\")\n for (let key of __getOwnPropNames(from))\n !__hasOwnProp.call(to, key) &&\n key !== except &&\n __defProp(to, key, {\n get: () => from[key],\n enumerable: !(desc = __getOwnPropDesc(from, key)) || desc.enumerable,\n });\n return to;\n },\n __reExport = (target, mod, secondTarget) => (\n __copyProps(target, mod, \"default\"), secondTarget && __copyProps(secondTarget, mod, \"default\")\n ),\n __toESM = (mod, isNodeMode, target) => (\n (target = mod != null ? __create(__getProtoOf(mod)) : {}),\n __copyProps(\n isNodeMode || !mod || !mod.__esModule ? __defProp(target, \"default\", { value: mod, enumerable: !0 }) : target,\n mod,\n )\n );\n\n// node_modules/safe-buffer/index.js\nvar require_safe_buffer = __commonJS({\n \"node_modules/safe-buffer/index.js\"(exports, module) {\n var buffer = __require(\"buffer\"),\n Buffer2 = buffer.Buffer;\n function copyProps(src, dst) {\n for (var key in src) dst[key] = src[key];\n }\n Buffer2.from && Buffer2.alloc && Buffer2.allocUnsafe && Buffer2.allocUnsafeSlow\n ? (module.exports = buffer)\n : (copyProps(buffer, exports), (exports.Buffer = SafeBuffer));\n function SafeBuffer(arg, encodingOrOffset, length) {\n return Buffer2(arg, encodingOrOffset, length);\n }\n SafeBuffer.prototype = Object.create(Buffer2.prototype);\n copyProps(Buffer2, SafeBuffer);\n SafeBuffer.from = function (arg, encodingOrOffset, length) {\n if (typeof arg == \"number\") throw new TypeError(\"Argument must not be a number\");\n return Buffer2(arg, encodingOrOffset, length);\n };\n SafeBuffer.alloc = function (size, fill, encoding) {\n if (typeof size != \"number\") throw new TypeError(\"Argument must be a number\");\n var buf = Buffer2(size);\n return (\n fill !== void 0 ? (typeof encoding == \"string\" ? buf.fill(fill, encoding) : buf.fill(fill)) : buf.fill(0), buf\n );\n };\n SafeBuffer.allocUnsafe = function (size) {\n if (typeof size != \"number\") throw new TypeError(\"Argument must be a number\");\n return Buffer2(size);\n };\n SafeBuffer.allocUnsafeSlow = function (size) {\n if (typeof size != \"number\") throw new TypeError(\"Argument must be a number\");\n return buffer.SlowBuffer(size);\n };\n },\n});\n\n// node_modules/randombytes/browser.js\nvar require_browser = __commonJS({\n \"node_modules/randombytes/browser.js\"(exports, module) {\n \"use strict\";\n var MAX_BYTES = 65536,\n MAX_UINT32 = 4294967295;\n function oldBrowser() {\n throw new Error(`Secure random number generation is not supported by this browser.\nUse Chrome, Firefox or Internet Explorer 11`);\n }\n var Buffer2 = require_safe_buffer().Buffer,\n crypto2 = globalCrypto;\n crypto2 && crypto2.getRandomValues ? (module.exports = randomBytes) : (module.exports = oldBrowser);\n function randomBytes(size, cb) {\n if (size > MAX_UINT32) throw new RangeError(\"requested too many random bytes\");\n var bytes = Buffer2.allocUnsafe(size);\n if (size > 0)\n if (size > MAX_BYTES)\n for (var generated = 0; generated < size; generated += MAX_BYTES)\n crypto2.getRandomValues(bytes.slice(generated, generated + MAX_BYTES));\n else crypto2.getRandomValues(bytes);\n return typeof cb == \"function\"\n ? process.nextTick(function () {\n cb(null, bytes);\n })\n : bytes;\n }\n },\n});\n\n// node_modules/inherits/inherits_browser.js\nvar require_inherits_browser = __commonJS({\n \"node_modules/inherits/inherits_browser.js\"(exports, module) {\n typeof Object.create == \"function\"\n ? (module.exports = function (ctor, superCtor) {\n superCtor &&\n ((ctor.super_ = superCtor),\n (ctor.prototype = Object.create(superCtor.prototype, {\n constructor: {\n value: ctor,\n enumerable: !1,\n writable: !0,\n configurable: !0,\n },\n })));\n })\n : (module.exports = function (ctor, superCtor) {\n if (superCtor) {\n ctor.super_ = superCtor;\n var TempCtor = function () {};\n (TempCtor.prototype = superCtor.prototype),\n (ctor.prototype = new TempCtor()),\n (ctor.prototype.constructor = ctor);\n }\n });\n },\n});\n\n// node_modules/hash-base/index.js\nvar require_hash_base = __commonJS({\n \"node_modules/hash-base/index.js\"(exports, module) {\n \"use strict\";\n var Buffer2 = require_safe_buffer().Buffer,\n Transform = __require(\"readable-stream\").Transform,\n inherits = require_inherits_browser();\n function throwIfNotStringOrBuffer(val, prefix) {\n if (!Buffer2.isBuffer(val) && typeof val != \"string\")\n throw new TypeError(prefix + \" must be a string or a buffer\");\n }\n function HashBase(blockSize) {\n Transform.call(this),\n (this._block = Buffer2.allocUnsafe(blockSize)),\n (this._blockSize = blockSize),\n (this._blockOffset = 0),\n (this._length = [0, 0, 0, 0]),\n (this._finalized = !1);\n }\n inherits(HashBase, Transform);\n HashBase.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 callback(error);\n };\n HashBase.prototype._flush = function (callback) {\n var error = null;\n try {\n this.push(this.digest());\n } catch (err) {\n error = err;\n }\n callback(error);\n };\n HashBase.prototype.update = function (data, encoding) {\n if ((throwIfNotStringOrBuffer(data, \"Data\"), this._finalized)) throw new Error(\"Digest already called\");\n Buffer2.isBuffer(data) || (data = Buffer2.from(data, encoding));\n for (var block = this._block, offset = 0; this._blockOffset + data.length - offset >= this._blockSize; ) {\n for (var i = this._blockOffset; i < this._blockSize; ) block[i++] = data[offset++];\n this._update(), (this._blockOffset = 0);\n }\n for (; offset < data.length; ) block[this._blockOffset++] = data[offset++];\n for (var j = 0, carry = data.length * 8; carry > 0; ++j)\n (this._length[j] += carry),\n (carry = (this._length[j] / 4294967296) | 0),\n carry > 0 && (this._length[j] -= 4294967296 * carry);\n return this;\n };\n HashBase.prototype._update = function () {\n throw new Error(\"_update is not implemented\");\n };\n HashBase.prototype.digest = function (encoding) {\n if (this._finalized) throw new Error(\"Digest already called\");\n this._finalized = !0;\n var digest = this._digest();\n encoding !== void 0 && (digest = digest.toString(encoding)), this._block.fill(0), (this._blockOffset = 0);\n for (var i = 0; i < 4; ++i) this._length[i] = 0;\n return digest;\n };\n HashBase.prototype._digest = function () {\n throw new Error(\"_digest is not implemented\");\n };\n module.exports = HashBase;\n },\n});\n\n// node_modules/md5.js/index.js\nvar require_md5 = __commonJS({\n \"node_modules/md5.js/index.js\"(exports, module) {\n \"use strict\";\n var inherits = require_inherits_browser(),\n HashBase = require_hash_base(),\n Buffer2 = require_safe_buffer().Buffer,\n ARRAY16 = new Array(16);\n function MD5() {\n HashBase.call(this, 64),\n (this._a = 1732584193),\n (this._b = 4023233417),\n (this._c = 2562383102),\n (this._d = 271733878);\n }\n inherits(MD5, HashBase);\n MD5.prototype._update = function () {\n for (var M = ARRAY16, i = 0; i < 16; ++i) M[i] = this._block.readInt32LE(i * 4);\n var a = this._a,\n b = this._b,\n c = this._c,\n d = this._d;\n (a = fnF(a, b, c, d, M[0], 3614090360, 7)),\n (d = fnF(d, a, b, c, M[1], 3905402710, 12)),\n (c = fnF(c, d, a, b, M[2], 606105819, 17)),\n (b = fnF(b, c, d, a, M[3], 3250441966, 22)),\n (a = fnF(a, b, c, d, M[4], 4118548399, 7)),\n (d = fnF(d, a, b, c, M[5], 1200080426, 12)),\n (c = fnF(c, d, a, b, M[6], 2821735955, 17)),\n (b = fnF(b, c, d, a, M[7], 4249261313, 22)),\n (a = fnF(a, b, c, d, M[8], 1770035416, 7)),\n (d = fnF(d, a, b, c, M[9], 2336552879, 12)),\n (c = fnF(c, d, a, b, M[10], 4294925233, 17)),\n (b = fnF(b, c, d, a, M[11], 2304563134, 22)),\n (a = fnF(a, b, c, d, M[12], 1804603682, 7)),\n (d = fnF(d, a, b, c, M[13], 4254626195, 12)),\n (c = fnF(c, d, a, b, M[14], 2792965006, 17)),\n (b = fnF(b, c, d, a, M[15], 1236535329, 22)),\n (a = fnG(a, b, c, d, M[1], 4129170786, 5)),\n (d = fnG(d, a, b, c, M[6], 3225465664, 9)),\n (c = fnG(c, d, a, b, M[11], 643717713, 14)),\n (b = fnG(b, c, d, a, M[0], 3921069994, 20)),\n (a = fnG(a, b, c, d, M[5], 3593408605, 5)),\n (d = fnG(d, a, b, c, M[10], 38016083, 9)),\n (c = fnG(c, d, a, b, M[15], 3634488961, 14)),\n (b = fnG(b, c, d, a, M[4], 3889429448, 20)),\n (a = fnG(a, b, c, d, M[9], 568446438, 5)),\n (d = fnG(d, a, b, c, M[14], 3275163606, 9)),\n (c = fnG(c, d, a, b, M[3], 4107603335, 14)),\n (b = fnG(b, c, d, a, M[8], 1163531501, 20)),\n (a = fnG(a, b, c, d, M[13], 2850285829, 5)),\n (d = fnG(d, a, b, c, M[2], 4243563512, 9)),\n (c = fnG(c, d, a, b, M[7], 1735328473, 14)),\n (b = fnG(b, c, d, a, M[12], 2368359562, 20)),\n (a = fnH(a, b, c, d, M[5], 4294588738, 4)),\n (d = fnH(d, a, b, c, M[8], 2272392833, 11)),\n (c = fnH(c, d, a, b, M[11], 1839030562, 16)),\n (b = fnH(b, c, d, a, M[14], 4259657740, 23)),\n (a = fnH(a, b, c, d, M[1], 2763975236, 4)),\n (d = fnH(d, a, b, c, M[4], 1272893353, 11)),\n (c = fnH(c, d, a, b, M[7], 4139469664, 16)),\n (b = fnH(b, c, d, a, M[10], 3200236656, 23)),\n (a = fnH(a, b, c, d, M[13], 681279174, 4)),\n (d = fnH(d, a, b, c, M[0], 3936430074, 11)),\n (c = fnH(c, d, a, b, M[3], 3572445317, 16)),\n (b = fnH(b, c, d, a, M[6], 76029189, 23)),\n (a = fnH(a, b, c, d, M[9], 3654602809, 4)),\n (d = fnH(d, a, b, c, M[12], 3873151461, 11)),\n (c = fnH(c, d, a, b, M[15], 530742520, 16)),\n (b = fnH(b, c, d, a, M[2], 3299628645, 23)),\n (a = fnI(a, b, c, d, M[0], 4096336452, 6)),\n (d = fnI(d, a, b, c, M[7], 1126891415, 10)),\n (c = fnI(c, d, a, b, M[14], 2878612391, 15)),\n (b = fnI(b, c, d, a, M[5], 4237533241, 21)),\n (a = fnI(a, b, c, d, M[12], 1700485571, 6)),\n (d = fnI(d, a, b, c, M[3], 2399980690, 10)),\n (c = fnI(c, d, a, b, M[10], 4293915773, 15)),\n (b = fnI(b, c, d, a, M[1], 2240044497, 21)),\n (a = fnI(a, b, c, d, M[8], 1873313359, 6)),\n (d = fnI(d, a, b, c, M[15], 4264355552, 10)),\n (c = fnI(c, d, a, b, M[6], 2734768916, 15)),\n (b = fnI(b, c, d, a, M[13], 1309151649, 21)),\n (a = fnI(a, b, c, d, M[4], 4149444226, 6)),\n (d = fnI(d, a, b, c, M[11], 3174756917, 10)),\n (c = fnI(c, d, a, b, M[2], 718787259, 15)),\n (b = fnI(b, c, d, a, M[9], 3951481745, 21)),\n (this._a = (this._a + a) | 0),\n (this._b = (this._b + b) | 0),\n (this._c = (this._c + c) | 0),\n (this._d = (this._d + d) | 0);\n };\n MD5.prototype._digest = function () {\n (this._block[this._blockOffset++] = 128),\n this._blockOffset > 56 && (this._block.fill(0, this._blockOffset, 64), this._update(), (this._blockOffset = 0)),\n this._block.fill(0, this._blockOffset, 56),\n this._block.writeUInt32LE(this._length[0], 56),\n this._block.writeUInt32LE(this._length[1], 60),\n this._update();\n var buffer = Buffer2.allocUnsafe(16);\n return (\n buffer.writeInt32LE(this._a, 0),\n buffer.writeInt32LE(this._b, 4),\n buffer.writeInt32LE(this._c, 8),\n buffer.writeInt32LE(this._d, 12),\n buffer\n );\n };\n function rotl(x, n) {\n return (x << n) | (x >>> (32 - n));\n }\n function fnF(a, b, c, d, m, k, s) {\n return (rotl((a + ((b & c) | (~b & d)) + m + k) | 0, s) + b) | 0;\n }\n function fnG(a, b, c, d, m, k, s) {\n return (rotl((a + ((b & d) | (c & ~d)) + m + k) | 0, s) + b) | 0;\n }\n function fnH(a, b, c, d, m, k, s) {\n return (rotl((a + (b ^ c ^ d) + m + k) | 0, s) + b) | 0;\n }\n function fnI(a, b, c, d, m, k, s) {\n return (rotl((a + (c ^ (b | ~d)) + m + k) | 0, s) + b) | 0;\n }\n module.exports = MD5;\n },\n});\n\n// node_modules/ripemd160/index.js\nvar require_ripemd160 = __commonJS({\n \"node_modules/ripemd160/index.js\"(exports, module) {\n \"use strict\";\n var Buffer2 = __require(\"buffer\").Buffer,\n inherits = require_inherits_browser(),\n HashBase = require_hash_base(),\n ARRAY16 = new Array(16),\n zl = [\n 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 7, 4, 13, 1, 10, 6, 15, 3, 12, 0, 9, 5, 2, 14, 11, 8, 3,\n 10, 14, 4, 9, 15, 8, 1, 2, 7, 0, 6, 13, 11, 5, 12, 1, 9, 11, 10, 0, 8, 12, 4, 13, 3, 7, 15, 14, 5, 6, 2, 4, 0,\n 5, 9, 7, 12, 2, 10, 14, 1, 3, 8, 11, 6, 15, 13,\n ],\n zr = [\n 5, 14, 7, 0, 9, 2, 11, 4, 13, 6, 15, 8, 1, 10, 3, 12, 6, 11, 3, 7, 0, 13, 5, 10, 14, 15, 8, 12, 4, 9, 1, 2, 15,\n 5, 1, 3, 7, 14, 6, 9, 11, 8, 12, 2, 10, 0, 4, 13, 8, 6, 4, 1, 3, 11, 15, 0, 5, 12, 2, 13, 9, 7, 10, 14, 12, 15,\n 10, 4, 1, 5, 8, 7, 6, 2, 13, 14, 0, 3, 9, 11,\n ],\n sl = [\n 11, 14, 15, 12, 5, 8, 7, 9, 11, 13, 14, 15, 6, 7, 9, 8, 7, 6, 8, 13, 11, 9, 7, 15, 7, 12, 15, 9, 11, 7, 13, 12,\n 11, 13, 6, 7, 14, 9, 13, 15, 14, 8, 13, 6, 5, 12, 7, 5, 11, 12, 14, 15, 14, 15, 9, 8, 9, 14, 5, 6, 8, 6, 5, 12,\n 9, 15, 5, 11, 6, 8, 13, 12, 5, 12, 13, 14, 11, 8, 5, 6,\n ],\n sr = [\n 8, 9, 9, 11, 13, 15, 15, 5, 7, 7, 8, 11, 14, 14, 12, 6, 9, 13, 15, 7, 12, 8, 9, 11, 7, 7, 12, 7, 6, 15, 13, 11,\n 9, 7, 15, 11, 8, 6, 6, 14, 12, 13, 5, 14, 13, 13, 7, 5, 15, 5, 8, 11, 14, 14, 6, 14, 6, 9, 12, 9, 12, 5, 15, 8,\n 8, 5, 12, 9, 12, 5, 14, 6, 8, 13, 6, 5, 15, 13, 11, 11,\n ],\n hl = [0, 1518500249, 1859775393, 2400959708, 2840853838],\n hr = [1352829926, 1548603684, 1836072691, 2053994217, 0];\n function RIPEMD160() {\n HashBase.call(this, 64),\n (this._a = 1732584193),\n (this._b = 4023233417),\n (this._c = 2562383102),\n (this._d = 271733878),\n (this._e = 3285377520);\n }\n inherits(RIPEMD160, HashBase);\n RIPEMD160.prototype._update = function () {\n for (var words = ARRAY16, j = 0; j < 16; ++j) words[j] = this._block.readInt32LE(j * 4);\n for (\n var al = this._a | 0,\n bl = this._b | 0,\n cl = this._c | 0,\n dl = this._d | 0,\n el = this._e | 0,\n ar = this._a | 0,\n br = this._b | 0,\n cr = this._c | 0,\n dr = this._d | 0,\n er = this._e | 0,\n i = 0;\n i < 80;\n i += 1\n ) {\n var tl, tr;\n i < 16\n ? ((tl = fn1(al, bl, cl, dl, el, words[zl[i]], hl[0], sl[i])),\n (tr = fn5(ar, br, cr, dr, er, words[zr[i]], hr[0], sr[i])))\n : i < 32\n ? ((tl = fn2(al, bl, cl, dl, el, words[zl[i]], hl[1], sl[i])),\n (tr = fn4(ar, br, cr, dr, er, words[zr[i]], hr[1], sr[i])))\n : i < 48\n ? ((tl = fn3(al, bl, cl, dl, el, words[zl[i]], hl[2], sl[i])),\n (tr = fn3(ar, br, cr, dr, er, words[zr[i]], hr[2], sr[i])))\n : i < 64\n ? ((tl = fn4(al, bl, cl, dl, el, words[zl[i]], hl[3], sl[i])),\n (tr = fn2(ar, br, cr, dr, er, words[zr[i]], hr[3], sr[i])))\n : ((tl = fn5(al, bl, cl, dl, el, words[zl[i]], hl[4], sl[i])),\n (tr = fn1(ar, br, cr, dr, er, words[zr[i]], hr[4], sr[i]))),\n (al = el),\n (el = dl),\n (dl = rotl(cl, 10)),\n (cl = bl),\n (bl = tl),\n (ar = er),\n (er = dr),\n (dr = rotl(cr, 10)),\n (cr = br),\n (br = tr);\n }\n var t = (this._b + cl + dr) | 0;\n (this._b = (this._c + dl + er) | 0),\n (this._c = (this._d + el + ar) | 0),\n (this._d = (this._e + al + br) | 0),\n (this._e = (this._a + bl + cr) | 0),\n (this._a = t);\n };\n RIPEMD160.prototype._digest = function () {\n (this._block[this._blockOffset++] = 128),\n this._blockOffset > 56 && (this._block.fill(0, this._blockOffset, 64), this._update(), (this._blockOffset = 0)),\n this._block.fill(0, this._blockOffset, 56),\n this._block.writeUInt32LE(this._length[0], 56),\n this._block.writeUInt32LE(this._length[1], 60),\n this._update();\n var buffer = Buffer2.alloc ? Buffer2.alloc(20) : new Buffer2(20);\n return (\n buffer.writeInt32LE(this._a, 0),\n buffer.writeInt32LE(this._b, 4),\n buffer.writeInt32LE(this._c, 8),\n buffer.writeInt32LE(this._d, 12),\n buffer.writeInt32LE(this._e, 16),\n buffer\n );\n };\n function rotl(x, n) {\n return (x << n) | (x >>> (32 - n));\n }\n function fn1(a, b, c, d, e, m, k, s) {\n return (rotl((a + (b ^ c ^ d) + m + k) | 0, s) + e) | 0;\n }\n function fn2(a, b, c, d, e, m, k, s) {\n return (rotl((a + ((b & c) | (~b & d)) + m + k) | 0, s) + e) | 0;\n }\n function fn3(a, b, c, d, e, m, k, s) {\n return (rotl((a + ((b | ~c) ^ d) + m + k) | 0, s) + e) | 0;\n }\n function fn4(a, b, c, d, e, m, k, s) {\n return (rotl((a + ((b & d) | (c & ~d)) + m + k) | 0, s) + e) | 0;\n }\n function fn5(a, b, c, d, e, m, k, s) {\n return (rotl((a + (b ^ (c | ~d)) + m + k) | 0, s) + e) | 0;\n }\n module.exports = RIPEMD160;\n },\n});\n\n// node_modules/sha.js/hash.js\nvar require_hash = __commonJS({\n \"node_modules/sha.js/hash.js\"(exports, module) {\n var Buffer2 = require_safe_buffer().Buffer;\n function Hash(blockSize, finalSize) {\n (this._block = Buffer2.alloc(blockSize)),\n (this._finalSize = finalSize),\n (this._blockSize = blockSize),\n (this._len = 0);\n }\n Hash.prototype.update = function (data, enc) {\n typeof data == \"string\" && ((enc = enc || \"utf8\"), (data = Buffer2.from(data, enc)));\n for (\n var block = this._block, blockSize = this._blockSize, length = data.length, accum = this._len, offset = 0;\n offset < length;\n\n ) {\n for (\n var assigned = accum % blockSize, remainder = Math.min(length - offset, blockSize - assigned), i = 0;\n i < remainder;\n i++\n )\n block[assigned + i] = data[offset + i];\n (accum += remainder), (offset += remainder), accum % blockSize === 0 && this._update(block);\n }\n return (this._len += length), this;\n };\n Hash.prototype.digest = function (enc) {\n var rem = this._len % this._blockSize;\n (this._block[rem] = 128),\n this._block.fill(0, rem + 1),\n rem >= this._finalSize && (this._update(this._block), this._block.fill(0));\n var bits = this._len * 8;\n if (bits <= 4294967295) this._block.writeUInt32BE(bits, this._blockSize - 4);\n else {\n var lowBits = (bits & 4294967295) >>> 0,\n highBits = (bits - lowBits) / 4294967296;\n this._block.writeUInt32BE(highBits, this._blockSize - 8),\n this._block.writeUInt32BE(lowBits, this._blockSize - 4);\n }\n this._update(this._block);\n var hash = this._hash();\n return enc ? hash.toString(enc) : hash;\n };\n Hash.prototype._update = function () {\n throw new Error(\"_update must be implemented by subclass\");\n };\n module.exports = Hash;\n },\n});\n\n// node_modules/sha.js/sha.js\nvar require_sha = __commonJS({\n \"node_modules/sha.js/sha.js\"(exports, module) {\n var inherits = require_inherits_browser(),\n Hash = require_hash(),\n Buffer2 = require_safe_buffer().Buffer,\n K = [1518500249, 1859775393, -1894007588, -899497514],\n W = new Array(80);\n function Sha() {\n this.init(), (this._w = W), Hash.call(this, 64, 56);\n }\n inherits(Sha, Hash);\n Sha.prototype.init = function () {\n return (\n (this._a = 1732584193),\n (this._b = 4023233417),\n (this._c = 2562383102),\n (this._d = 271733878),\n (this._e = 3285377520),\n this\n );\n };\n function rotl5(num) {\n return (num << 5) | (num >>> 27);\n }\n function rotl30(num) {\n return (num << 30) | (num >>> 2);\n }\n function ft(s, b, c, d) {\n return s === 0 ? (b & c) | (~b & d) : s === 2 ? (b & c) | (b & d) | (c & d) : b ^ c ^ d;\n }\n Sha.prototype._update = function (M) {\n for (\n var W2 = this._w, a = this._a | 0, b = this._b | 0, c = this._c | 0, d = this._d | 0, e = this._e | 0, i = 0;\n i < 16;\n ++i\n )\n W2[i] = M.readInt32BE(i * 4);\n for (; i < 80; ++i) W2[i] = W2[i - 3] ^ W2[i - 8] ^ W2[i - 14] ^ W2[i - 16];\n for (var j = 0; j < 80; ++j) {\n var s = ~~(j / 20),\n t = (rotl5(a) + ft(s, b, c, d) + e + W2[j] + K[s]) | 0;\n (e = d), (d = c), (c = rotl30(b)), (b = a), (a = t);\n }\n (this._a = (a + this._a) | 0),\n (this._b = (b + this._b) | 0),\n (this._c = (c + this._c) | 0),\n (this._d = (d + this._d) | 0),\n (this._e = (e + this._e) | 0);\n };\n Sha.prototype._hash = function () {\n var H = Buffer2.allocUnsafe(20);\n return (\n H.writeInt32BE(this._a | 0, 0),\n H.writeInt32BE(this._b | 0, 4),\n H.writeInt32BE(this._c | 0, 8),\n H.writeInt32BE(this._d | 0, 12),\n H.writeInt32BE(this._e | 0, 16),\n H\n );\n };\n module.exports = Sha;\n },\n});\n\n// node_modules/sha.js/sha1.js\nvar require_sha1 = __commonJS({\n \"node_modules/sha.js/sha1.js\"(exports, module) {\n var inherits = require_inherits_browser(),\n Hash = require_hash(),\n Buffer2 = require_safe_buffer().Buffer,\n K = [1518500249, 1859775393, -1894007588, -899497514],\n W = new Array(80);\n function Sha1() {\n this.init(), (this._w = W), Hash.call(this, 64, 56);\n }\n inherits(Sha1, Hash);\n Sha1.prototype.init = function () {\n return (\n (this._a = 1732584193),\n (this._b = 4023233417),\n (this._c = 2562383102),\n (this._d = 271733878),\n (this._e = 3285377520),\n this\n );\n };\n function rotl1(num) {\n return (num << 1) | (num >>> 31);\n }\n function rotl5(num) {\n return (num << 5) | (num >>> 27);\n }\n function rotl30(num) {\n return (num << 30) | (num >>> 2);\n }\n function ft(s, b, c, d) {\n return s === 0 ? (b & c) | (~b & d) : s === 2 ? (b & c) | (b & d) | (c & d) : b ^ c ^ d;\n }\n Sha1.prototype._update = function (M) {\n for (\n var W2 = this._w, a = this._a | 0, b = this._b | 0, c = this._c | 0, d = this._d | 0, e = this._e | 0, i = 0;\n i < 16;\n ++i\n )\n W2[i] = M.readInt32BE(i * 4);\n for (; i < 80; ++i) W2[i] = rotl1(W2[i - 3] ^ W2[i - 8] ^ W2[i - 14] ^ W2[i - 16]);\n for (var j = 0; j < 80; ++j) {\n var s = ~~(j / 20),\n t = (rotl5(a) + ft(s, b, c, d) + e + W2[j] + K[s]) | 0;\n (e = d), (d = c), (c = rotl30(b)), (b = a), (a = t);\n }\n (this._a = (a + this._a) | 0),\n (this._b = (b + this._b) | 0),\n (this._c = (c + this._c) | 0),\n (this._d = (d + this._d) | 0),\n (this._e = (e + this._e) | 0);\n };\n Sha1.prototype._hash = function () {\n var H = Buffer2.allocUnsafe(20);\n return (\n H.writeInt32BE(this._a | 0, 0),\n H.writeInt32BE(this._b | 0, 4),\n H.writeInt32BE(this._c | 0, 8),\n H.writeInt32BE(this._d | 0, 12),\n H.writeInt32BE(this._e | 0, 16),\n H\n );\n };\n module.exports = Sha1;\n },\n});\n\n// node_modules/sha.js/sha256.js\nvar require_sha256 = __commonJS({\n \"node_modules/sha.js/sha256.js\"(exports, module) {\n var inherits = require_inherits_browser(),\n Hash = require_hash(),\n Buffer2 = require_safe_buffer().Buffer,\n K = [\n 1116352408, 1899447441, 3049323471, 3921009573, 961987163, 1508970993, 2453635748, 2870763221, 3624381080,\n 310598401, 607225278, 1426881987, 1925078388, 2162078206, 2614888103, 3248222580, 3835390401, 4022224774,\n 264347078, 604807628, 770255983, 1249150122, 1555081692, 1996064986, 2554220882, 2821834349, 2952996808,\n 3210313671, 3336571891, 3584528711, 113926993, 338241895, 666307205, 773529912, 1294757372, 1396182291,\n 1695183700, 1986661051, 2177026350, 2456956037, 2730485921, 2820302411, 3259730800, 3345764771, 3516065817,\n 3600352804, 4094571909, 275423344, 430227734, 506948616, 659060556, 883997877, 958139571, 1322822218,\n 1537002063, 1747873779, 1955562222, 2024104815, 2227730452, 2361852424, 2428436474, 2756734187, 3204031479,\n 3329325298,\n ],\n W = new Array(64);\n function Sha256() {\n this.init(), (this._w = W), Hash.call(this, 64, 56);\n }\n inherits(Sha256, Hash);\n Sha256.prototype.init = function () {\n return (\n (this._a = 1779033703),\n (this._b = 3144134277),\n (this._c = 1013904242),\n (this._d = 2773480762),\n (this._e = 1359893119),\n (this._f = 2600822924),\n (this._g = 528734635),\n (this._h = 1541459225),\n this\n );\n };\n function ch(x, y, z) {\n return z ^ (x & (y ^ z));\n }\n function maj(x, y, z) {\n return (x & y) | (z & (x | y));\n }\n function sigma0(x) {\n return ((x >>> 2) | (x << 30)) ^ ((x >>> 13) | (x << 19)) ^ ((x >>> 22) | (x << 10));\n }\n function sigma1(x) {\n return ((x >>> 6) | (x << 26)) ^ ((x >>> 11) | (x << 21)) ^ ((x >>> 25) | (x << 7));\n }\n function gamma0(x) {\n return ((x >>> 7) | (x << 25)) ^ ((x >>> 18) | (x << 14)) ^ (x >>> 3);\n }\n function gamma1(x) {\n return ((x >>> 17) | (x << 15)) ^ ((x >>> 19) | (x << 13)) ^ (x >>> 10);\n }\n Sha256.prototype._update = function (M) {\n for (\n var W2 = this._w,\n a = this._a | 0,\n b = this._b | 0,\n c = this._c | 0,\n d = this._d | 0,\n e = this._e | 0,\n f = this._f | 0,\n g = this._g | 0,\n h = this._h | 0,\n i = 0;\n i < 16;\n ++i\n )\n W2[i] = M.readInt32BE(i * 4);\n for (; i < 64; ++i) W2[i] = (gamma1(W2[i - 2]) + W2[i - 7] + gamma0(W2[i - 15]) + W2[i - 16]) | 0;\n for (var j = 0; j < 64; ++j) {\n var T1 = (h + sigma1(e) + ch(e, f, g) + K[j] + W2[j]) | 0,\n T2 = (sigma0(a) + maj(a, b, c)) | 0;\n (h = g), (g = f), (f = e), (e = (d + T1) | 0), (d = c), (c = b), (b = a), (a = (T1 + T2) | 0);\n }\n (this._a = (a + this._a) | 0),\n (this._b = (b + this._b) | 0),\n (this._c = (c + this._c) | 0),\n (this._d = (d + this._d) | 0),\n (this._e = (e + this._e) | 0),\n (this._f = (f + this._f) | 0),\n (this._g = (g + this._g) | 0),\n (this._h = (h + this._h) | 0);\n };\n Sha256.prototype._hash = function () {\n var H = Buffer2.allocUnsafe(32);\n return (\n H.writeInt32BE(this._a, 0),\n H.writeInt32BE(this._b, 4),\n H.writeInt32BE(this._c, 8),\n H.writeInt32BE(this._d, 12),\n H.writeInt32BE(this._e, 16),\n H.writeInt32BE(this._f, 20),\n H.writeInt32BE(this._g, 24),\n H.writeInt32BE(this._h, 28),\n H\n );\n };\n module.exports = Sha256;\n },\n});\n\n// node_modules/sha.js/sha224.js\nvar require_sha224 = __commonJS({\n \"node_modules/sha.js/sha224.js\"(exports, module) {\n var inherits = require_inherits_browser(),\n Sha256 = require_sha256(),\n Hash = require_hash(),\n Buffer2 = require_safe_buffer().Buffer,\n W = new Array(64);\n function Sha224() {\n this.init(), (this._w = W), Hash.call(this, 64, 56);\n }\n inherits(Sha224, Sha256);\n Sha224.prototype.init = function () {\n return (\n (this._a = 3238371032),\n (this._b = 914150663),\n (this._c = 812702999),\n (this._d = 4144912697),\n (this._e = 4290775857),\n (this._f = 1750603025),\n (this._g = 1694076839),\n (this._h = 3204075428),\n this\n );\n };\n Sha224.prototype._hash = function () {\n var H = Buffer2.allocUnsafe(28);\n return (\n H.writeInt32BE(this._a, 0),\n H.writeInt32BE(this._b, 4),\n H.writeInt32BE(this._c, 8),\n H.writeInt32BE(this._d, 12),\n H.writeInt32BE(this._e, 16),\n H.writeInt32BE(this._f, 20),\n H.writeInt32BE(this._g, 24),\n H\n );\n };\n module.exports = Sha224;\n },\n});\n\n// node_modules/sha.js/sha512.js\nvar require_sha512 = __commonJS({\n \"node_modules/sha.js/sha512.js\"(exports, module) {\n var inherits = require_inherits_browser(),\n Hash = require_hash(),\n Buffer2 = require_safe_buffer().Buffer,\n K = [\n 1116352408, 3609767458, 1899447441, 602891725, 3049323471, 3964484399, 3921009573, 2173295548, 961987163,\n 4081628472, 1508970993, 3053834265, 2453635748, 2937671579, 2870763221, 3664609560, 3624381080, 2734883394,\n 310598401, 1164996542, 607225278, 1323610764, 1426881987, 3590304994, 1925078388, 4068182383, 2162078206,\n 991336113, 2614888103, 633803317, 3248222580, 3479774868, 3835390401, 2666613458, 4022224774, 944711139,\n 264347078, 2341262773, 604807628, 2007800933, 770255983, 1495990901, 1249150122, 1856431235, 1555081692,\n 3175218132, 1996064986, 2198950837, 2554220882, 3999719339, 2821834349, 766784016, 2952996808, 2566594879,\n 3210313671, 3203337956, 3336571891, 1034457026, 3584528711, 2466948901, 113926993, 3758326383, 338241895,\n 168717936, 666307205, 1188179964, 773529912, 1546045734, 1294757372, 1522805485, 1396182291, 2643833823,\n 1695183700, 2343527390, 1986661051, 1014477480, 2177026350, 1206759142, 2456956037, 344077627, 2730485921,\n 1290863460, 2820302411, 3158454273, 3259730800, 3505952657, 3345764771, 106217008, 3516065817, 3606008344,\n 3600352804, 1432725776, 4094571909, 1467031594, 275423344, 851169720, 430227734, 3100823752, 506948616,\n 1363258195, 659060556, 3750685593, 883997877, 3785050280, 958139571, 3318307427, 1322822218, 3812723403,\n 1537002063, 2003034995, 1747873779, 3602036899, 1955562222, 1575990012, 2024104815, 1125592928, 2227730452,\n 2716904306, 2361852424, 442776044, 2428436474, 593698344, 2756734187, 3733110249, 3204031479, 2999351573,\n 3329325298, 3815920427, 3391569614, 3928383900, 3515267271, 566280711, 3940187606, 3454069534, 4118630271,\n 4000239992, 116418474, 1914138554, 174292421, 2731055270, 289380356, 3203993006, 460393269, 320620315,\n 685471733, 587496836, 852142971, 1086792851, 1017036298, 365543100, 1126000580, 2618297676, 1288033470,\n 3409855158, 1501505948, 4234509866, 1607167915, 987167468, 1816402316, 1246189591,\n ],\n W = new Array(160);\n function Sha512() {\n this.init(), (this._w = W), Hash.call(this, 128, 112);\n }\n inherits(Sha512, Hash);\n Sha512.prototype.init = function () {\n return (\n (this._ah = 1779033703),\n (this._bh = 3144134277),\n (this._ch = 1013904242),\n (this._dh = 2773480762),\n (this._eh = 1359893119),\n (this._fh = 2600822924),\n (this._gh = 528734635),\n (this._hh = 1541459225),\n (this._al = 4089235720),\n (this._bl = 2227873595),\n (this._cl = 4271175723),\n (this._dl = 1595750129),\n (this._el = 2917565137),\n (this._fl = 725511199),\n (this._gl = 4215389547),\n (this._hl = 327033209),\n this\n );\n };\n function Ch(x, y, z) {\n return z ^ (x & (y ^ z));\n }\n function maj(x, y, z) {\n return (x & y) | (z & (x | y));\n }\n function sigma0(x, xl) {\n return ((x >>> 28) | (xl << 4)) ^ ((xl >>> 2) | (x << 30)) ^ ((xl >>> 7) | (x << 25));\n }\n function sigma1(x, xl) {\n return ((x >>> 14) | (xl << 18)) ^ ((x >>> 18) | (xl << 14)) ^ ((xl >>> 9) | (x << 23));\n }\n function Gamma0(x, xl) {\n return ((x >>> 1) | (xl << 31)) ^ ((x >>> 8) | (xl << 24)) ^ (x >>> 7);\n }\n function Gamma0l(x, xl) {\n return ((x >>> 1) | (xl << 31)) ^ ((x >>> 8) | (xl << 24)) ^ ((x >>> 7) | (xl << 25));\n }\n function Gamma1(x, xl) {\n return ((x >>> 19) | (xl << 13)) ^ ((xl >>> 29) | (x << 3)) ^ (x >>> 6);\n }\n function Gamma1l(x, xl) {\n return ((x >>> 19) | (xl << 13)) ^ ((xl >>> 29) | (x << 3)) ^ ((x >>> 6) | (xl << 26));\n }\n function getCarry(a, b) {\n return a >>> 0 < b >>> 0 ? 1 : 0;\n }\n Sha512.prototype._update = function (M) {\n for (\n var W2 = this._w,\n ah = this._ah | 0,\n bh = this._bh | 0,\n ch = this._ch | 0,\n dh = this._dh | 0,\n eh = this._eh | 0,\n fh = this._fh | 0,\n gh = this._gh | 0,\n hh = this._hh | 0,\n al = this._al | 0,\n bl = this._bl | 0,\n cl = this._cl | 0,\n dl = this._dl | 0,\n el = this._el | 0,\n fl = this._fl | 0,\n gl = this._gl | 0,\n hl = this._hl | 0,\n i = 0;\n i < 32;\n i += 2\n )\n (W2[i] = M.readInt32BE(i * 4)), (W2[i + 1] = M.readInt32BE(i * 4 + 4));\n for (; i < 160; i += 2) {\n var xh = W2[i - 30],\n xl = W2[i - 15 * 2 + 1],\n gamma0 = Gamma0(xh, xl),\n gamma0l = Gamma0l(xl, xh);\n (xh = W2[i - 2 * 2]), (xl = W2[i - 2 * 2 + 1]);\n var gamma1 = Gamma1(xh, xl),\n gamma1l = Gamma1l(xl, xh),\n Wi7h = W2[i - 7 * 2],\n Wi7l = W2[i - 7 * 2 + 1],\n Wi16h = W2[i - 16 * 2],\n Wi16l = W2[i - 16 * 2 + 1],\n Wil = (gamma0l + Wi7l) | 0,\n 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 (W2[i] = Wih),\n (W2[i + 1] = Wil);\n }\n for (var j = 0; j < 160; j += 2) {\n (Wih = W2[j]), (Wil = W2[j + 1]);\n var majh = maj(ah, bh, ch),\n majl = maj(al, bl, cl),\n sigma0h = sigma0(ah, al),\n sigma0l = sigma0(al, ah),\n sigma1h = sigma1(eh, el),\n sigma1l = sigma1(el, eh),\n Kih = K[j],\n Kil = K[j + 1],\n chh = Ch(eh, fh, gh),\n chl = Ch(el, fl, gl),\n t1l = (hl + sigma1l) | 0,\n 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 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 (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 Sha512.prototype._hash = function () {\n var H = Buffer2.allocUnsafe(64);\n function writeInt64BE(h, l, offset) {\n H.writeInt32BE(h, offset), H.writeInt32BE(l, offset + 4);\n }\n return (\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 H\n );\n };\n module.exports = Sha512;\n },\n});\n\n// node_modules/sha.js/sha384.js\nvar require_sha384 = __commonJS({\n \"node_modules/sha.js/sha384.js\"(exports, module) {\n var inherits = require_inherits_browser(),\n SHA512 = require_sha512(),\n Hash = require_hash(),\n Buffer2 = require_safe_buffer().Buffer,\n W = new Array(160);\n function Sha384() {\n this.init(), (this._w = W), Hash.call(this, 128, 112);\n }\n inherits(Sha384, SHA512);\n Sha384.prototype.init = function () {\n return (\n (this._ah = 3418070365),\n (this._bh = 1654270250),\n (this._ch = 2438529370),\n (this._dh = 355462360),\n (this._eh = 1731405415),\n (this._fh = 2394180231),\n (this._gh = 3675008525),\n (this._hh = 1203062813),\n (this._al = 3238371032),\n (this._bl = 914150663),\n (this._cl = 812702999),\n (this._dl = 4144912697),\n (this._el = 4290775857),\n (this._fl = 1750603025),\n (this._gl = 1694076839),\n (this._hl = 3204075428),\n this\n );\n };\n Sha384.prototype._hash = function () {\n var H = Buffer2.allocUnsafe(48);\n function writeInt64BE(h, l, offset) {\n H.writeInt32BE(h, offset), H.writeInt32BE(l, offset + 4);\n }\n return (\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 H\n );\n };\n module.exports = Sha384;\n },\n});\n\n// node_modules/sha.js/index.js\nvar require_sha2 = __commonJS({\n \"node_modules/sha.js/index.js\"(exports, module) {\n var exports = (module.exports = function (algorithm) {\n algorithm = algorithm.toLowerCase();\n var Algorithm = exports[algorithm];\n if (!Algorithm) throw new Error(algorithm + \" is not supported (we accept pull requests)\");\n return new Algorithm();\n });\n exports.sha = require_sha();\n exports.sha1 = require_sha1();\n exports.sha224 = require_sha224();\n exports.sha256 = require_sha256();\n exports.sha384 = require_sha384();\n exports.sha512 = require_sha512();\n },\n});\n\n// stream.js\nvar stream_exports = import.meta.require(\"node:stream\");\n\n// node_modules/cipher-base/index.js\nvar require_cipher_base = __commonJS({\n \"node_modules/cipher-base/index.js\"(exports, module) {\n var Buffer2 = require_safe_buffer().Buffer,\n Transform = stream_exports.Transform,\n StringDecoder = __require(\"string_decoder\").StringDecoder,\n inherits = require_inherits_browser();\n function CipherBase(hashMode) {\n Transform.call(this),\n (this.hashMode = typeof hashMode == \"string\"),\n this.hashMode ? (this[hashMode] = this._finalOrDigest) : (this.final = this._finalOrDigest),\n this._final && ((this.__final = this._final), (this._final = null)),\n (this._decoder = null),\n (this._encoding = null);\n }\n inherits(CipherBase, Transform);\n CipherBase.prototype.update = function (data, inputEnc, outputEnc) {\n typeof data == \"string\" && (data = Buffer2.from(data, inputEnc));\n var outData = this._update(data);\n return this.hashMode ? this : (outputEnc && (outData = this._toString(outData, outputEnc)), outData);\n };\n CipherBase.prototype.setAutoPadding = function () {};\n CipherBase.prototype.getAuthTag = function () {\n throw new Error(\"trying to get auth tag in unsupported state\");\n };\n CipherBase.prototype.setAuthTag = function () {\n throw new Error(\"trying to set auth tag in unsupported state\");\n };\n CipherBase.prototype.setAAD = function () {\n throw new Error(\"trying to set aad in unsupported state\");\n };\n CipherBase.prototype._transform = function (data, _, next) {\n var err;\n try {\n this.hashMode ? this._update(data) : this.push(this._update(data));\n } catch (e) {\n err = e;\n } finally {\n next(err);\n }\n };\n CipherBase.prototype._flush = function (done) {\n var err;\n try {\n this.push(this.__final());\n } catch (e) {\n err = e;\n }\n done(err);\n };\n CipherBase.prototype._finalOrDigest = function (outputEnc) {\n var outData = this.__final() || Buffer2.alloc(0);\n return outputEnc && (outData = this._toString(outData, outputEnc, !0)), outData;\n };\n CipherBase.prototype._toString = function (value, enc, fin) {\n if ((this._decoder || ((this._decoder = new StringDecoder(enc)), (this._encoding = enc)), this._encoding !== enc))\n throw new Error(\"can't switch encodings\");\n var out = this._decoder.write(value);\n return fin && (out += this._decoder.end()), out;\n };\n module.exports = CipherBase;\n },\n});\n\n// node_modules/create-hash/browser.js\nvar require_browser2 = __commonJS({\n \"node_modules/create-hash/browser.js\"(exports, module) {\n (\"use strict\");\n const { Transform } = stream_exports;\n\n // does not become a node stream unless you create it into one\n const LazyHash = function Hash(algorithm, options) {\n this._options = options;\n this._hasher = new CryptoHasher(algorithm, options);\n this._finalized = false;\n };\n LazyHash.prototype = Object.create(Transform.prototype);\n LazyHash.prototype.update = function update(data, encoding) {\n this._checkFinalized();\n this._hasher.update(data, encoding);\n return this;\n };\n LazyHash.prototype.digest = function update(data, encoding) {\n this._checkFinalized();\n this._finalized = true;\n return this._hasher.digest(data, encoding);\n };\n LazyHash.prototype._checkFinalized = function _checkFinalized() {\n if (this._finalized) {\n var err = new Error(\"Digest already called\");\n err.code = \"ERR_CRYPTO_HASH_FINALIZED\";\n throw err;\n }\n };\n LazyHash.prototype.copy = function copy() {\n const copy = Object.create(LazyHash.prototype);\n copy._options = this._options;\n copy._hasher = this._hasher.copy();\n copy._finalized = this._finalized;\n return copy;\n };\n\n const lazyHashFullInitProto = {\n __proto__: Transform.prototype,\n ...LazyHash.prototype,\n _transform(data, encoding, callback) {\n this.update(data, encoding);\n callback && callback();\n },\n _flush(callback) {\n this.push(this.digest());\n callback();\n },\n };\n\n const triggerMethods = [\n \"_events\",\n \"_eventsCount\",\n \"_final\",\n \"_maxListeners\",\n \"_maxListeners\",\n \"_read\",\n \"_undestroy\",\n \"_writableState\",\n \"_write\",\n \"_writev\",\n \"addListener\",\n \"asIndexedPairs\",\n \"closed\",\n \"compose\",\n \"constructor\",\n \"cork\",\n \"destroy\",\n \"destroyed\",\n \"drop\",\n \"emit\",\n \"end\",\n \"errored\",\n \"eventNames\",\n \"every\",\n \"filter\",\n \"find\",\n \"flatMap\",\n \"forEach\",\n \"getMaxListeners\",\n \"hasOwnProperty\",\n \"isPaused\",\n \"isPrototypeOf\",\n \"iterator\",\n \"listenerCount\",\n \"listeners\",\n \"map\",\n \"off\",\n \"on\",\n \"once\",\n \"pause\",\n \"pipe\",\n \"prependListener\",\n \"prependOnceListener\",\n \"propertyIsEnumerable\",\n \"push\",\n \"rawListeners\",\n \"read\",\n \"readable\",\n \"readableAborted\",\n \"readableBuffer\",\n \"readableDidRead\",\n \"readableEncoding\",\n \"readableEnded\",\n \"readableFlowing\",\n \"readableHighWaterMark\",\n \"readableLength\",\n \"readableObjectMode\",\n \"reduce\",\n \"removeAllListeners\",\n \"removeListener\",\n \"resume\",\n \"setDefaultEncoding\",\n \"setEncoding\",\n \"setMaxListeners\",\n \"some\",\n \"take\",\n \"toArray\",\n \"toLocaleString\",\n \"toString\",\n \"uncork\",\n \"unpipe\",\n \"unshift\",\n \"valueOf\",\n \"wrap\",\n \"writable\",\n \"writableBuffer\",\n \"writableCorked\",\n \"writableEnded\",\n \"writableFinished\",\n \"writableHighWaterMark\",\n \"writableLength\",\n \"writableNeedDrain\",\n \"writableObjectMode\",\n \"write\",\n ];\n for (const method of triggerMethods) {\n Object.defineProperty(LazyHash.prototype, method, {\n get() {\n Object.setPrototypeOf(this, lazyHashFullInitProto);\n Transform.call(this, this._options);\n return this[method];\n },\n enumerable: false,\n configurable: true,\n });\n }\n\n module.exports = function createHash(algorithm) {\n return new LazyHash(algorithm);\n };\n\n module.exports.createHash = module.exports;\n module.exports.Hash = LazyHash;\n },\n});\n\n// node_modules/create-hmac/legacy.js\nvar require_legacy = __commonJS({\n \"node_modules/create-hmac/legacy.js\"(exports, module) {\n \"use strict\";\n var inherits = require_inherits_browser(),\n Buffer2 = require_safe_buffer().Buffer,\n Base = require_cipher_base(),\n ZEROS = Buffer2.alloc(128),\n blocksize = 64;\n function Hmac(alg, key) {\n Base.call(this, \"digest\"),\n typeof key == \"string\" && (key = Buffer2.from(key)),\n (this._alg = alg),\n (this._key = key),\n key.length > blocksize\n ? (key = alg(key))\n : key.length < blocksize && (key = Buffer2.concat([key, ZEROS], blocksize));\n for (\n var ipad = (this._ipad = Buffer2.allocUnsafe(blocksize)),\n opad = (this._opad = Buffer2.allocUnsafe(blocksize)),\n i = 0;\n i < blocksize;\n i++\n )\n (ipad[i] = key[i] ^ 54), (opad[i] = key[i] ^ 92);\n this._hash = [ipad];\n }\n inherits(Hmac, Base);\n Hmac.prototype._update = function (data) {\n this._hash.push(data);\n };\n Hmac.prototype._final = function () {\n var h = this._alg(Buffer2.concat(this._hash));\n return this._alg(Buffer2.concat([this._opad, h]));\n };\n module.exports = Hmac;\n },\n});\n\n// node_modules/create-hash/md5.js\nvar require_md52 = __commonJS({\n \"node_modules/create-hash/md5.js\"(exports, module) {\n var MD5 = require_md5();\n module.exports = function (buffer) {\n return new MD5().update(buffer).digest();\n };\n },\n});\n\n// node_modules/create-hmac/browser.js\nvar require_browser3 = __commonJS({\n \"node_modules/create-hmac/browser.js\"(exports, module) {\n \"use strict\";\n var inherits = require_inherits_browser(),\n Legacy = require_legacy(),\n Base = require_cipher_base(),\n Buffer2 = require_safe_buffer().Buffer,\n md5 = require_md52(),\n RIPEMD160 = require_ripemd160(),\n sha = require_sha2(),\n ZEROS = Buffer2.alloc(128);\n function Hmac(alg, key) {\n Base.call(this, \"digest\"), typeof key == \"string\" && (key = Buffer2.from(key));\n var blocksize = alg === \"sha512\" || alg === \"sha384\" ? 128 : 64;\n if (((this._alg = alg), (this._key = key), key.length > blocksize)) {\n var hash = alg === \"rmd160\" ? new RIPEMD160() : sha(alg);\n key = hash.update(key).digest();\n } else key.length < blocksize && (key = Buffer2.concat([key, ZEROS], blocksize));\n for (\n var ipad = (this._ipad = Buffer2.allocUnsafe(blocksize)),\n opad = (this._opad = Buffer2.allocUnsafe(blocksize)),\n i = 0;\n i < blocksize;\n i++\n )\n (ipad[i] = key[i] ^ 54), (opad[i] = key[i] ^ 92);\n (this._hash = alg === \"rmd160\" ? new RIPEMD160() : sha(alg)), this._hash.update(ipad);\n }\n inherits(Hmac, Base);\n Hmac.prototype._update = function (data) {\n this._hash.update(data);\n };\n Hmac.prototype._final = function () {\n var h = this._hash.digest(),\n hash = this._alg === \"rmd160\" ? new RIPEMD160() : sha(this._alg);\n return hash.update(this._opad).update(h).digest();\n };\n module.exports = function (alg, key) {\n return (\n (alg = alg.toLowerCase()),\n alg === \"rmd160\" || alg === \"ripemd160\"\n ? new Hmac(\"rmd160\", key)\n : alg === \"md5\"\n ? new Legacy(md5, key)\n : new Hmac(alg, key)\n );\n };\n },\n});\n\n// node_modules/browserify-sign/browser/algorithms.json\nvar require_algorithms = __commonJS({\n \"node_modules/browserify-sign/browser/algorithms.json\"(exports, module) {\n module.exports = {\n sha224WithRSAEncryption: {\n sign: \"rsa\",\n hash: \"sha224\",\n id: \"302d300d06096086480165030402040500041c\",\n },\n \"RSA-SHA224\": {\n sign: \"ecdsa/rsa\",\n hash: \"sha224\",\n id: \"302d300d06096086480165030402040500041c\",\n },\n sha256WithRSAEncryption: {\n sign: \"rsa\",\n hash: \"sha256\",\n id: \"3031300d060960864801650304020105000420\",\n },\n \"RSA-SHA256\": {\n sign: \"ecdsa/rsa\",\n hash: \"sha256\",\n id: \"3031300d060960864801650304020105000420\",\n },\n sha384WithRSAEncryption: {\n sign: \"rsa\",\n hash: \"sha384\",\n id: \"3041300d060960864801650304020205000430\",\n },\n \"RSA-SHA384\": {\n sign: \"ecdsa/rsa\",\n hash: \"sha384\",\n id: \"3041300d060960864801650304020205000430\",\n },\n sha512WithRSAEncryption: {\n sign: \"rsa\",\n hash: \"sha512\",\n id: \"3051300d060960864801650304020305000440\",\n },\n \"RSA-SHA512\": {\n sign: \"ecdsa/rsa\",\n hash: \"sha512\",\n id: \"3051300d060960864801650304020305000440\",\n },\n \"RSA-SHA1\": {\n sign: \"rsa\",\n hash: \"sha1\",\n id: \"3021300906052b0e03021a05000414\",\n },\n \"ecdsa-with-SHA1\": {\n sign: \"ecdsa\",\n hash: \"sha1\",\n id: \"\",\n },\n sha256: {\n sign: \"ecdsa\",\n hash: \"sha256\",\n id: \"\",\n },\n sha224: {\n sign: \"ecdsa\",\n hash: \"sha224\",\n id: \"\",\n },\n sha384: {\n sign: \"ecdsa\",\n hash: \"sha384\",\n id: \"\",\n },\n sha512: {\n sign: \"ecdsa\",\n hash: \"sha512\",\n id: \"\",\n },\n \"DSA-SHA\": {\n sign: \"dsa\",\n hash: \"sha1\",\n id: \"\",\n },\n \"DSA-SHA1\": {\n sign: \"dsa\",\n hash: \"sha1\",\n id: \"\",\n },\n DSA: {\n sign: \"dsa\",\n hash: \"sha1\",\n id: \"\",\n },\n \"DSA-WITH-SHA224\": {\n sign: \"dsa\",\n hash: \"sha224\",\n id: \"\",\n },\n \"DSA-SHA224\": {\n sign: \"dsa\",\n hash: \"sha224\",\n id: \"\",\n },\n \"DSA-WITH-SHA256\": {\n sign: \"dsa\",\n hash: \"sha256\",\n id: \"\",\n },\n \"DSA-SHA256\": {\n sign: \"dsa\",\n hash: \"sha256\",\n id: \"\",\n },\n \"DSA-WITH-SHA384\": {\n sign: \"dsa\",\n hash: \"sha384\",\n id: \"\",\n },\n \"DSA-SHA384\": {\n sign: \"dsa\",\n hash: \"sha384\",\n id: \"\",\n },\n \"DSA-WITH-SHA512\": {\n sign: \"dsa\",\n hash: \"sha512\",\n id: \"\",\n },\n \"DSA-SHA512\": {\n sign: \"dsa\",\n hash: \"sha512\",\n id: \"\",\n },\n \"DSA-RIPEMD160\": {\n sign: \"dsa\",\n hash: \"rmd160\",\n id: \"\",\n },\n ripemd160WithRSA: {\n sign: \"rsa\",\n hash: \"rmd160\",\n id: \"3021300906052b2403020105000414\",\n },\n \"RSA-RIPEMD160\": {\n sign: \"rsa\",\n hash: \"rmd160\",\n id: \"3021300906052b2403020105000414\",\n },\n md5WithRSAEncryption: {\n sign: \"rsa\",\n hash: \"md5\",\n id: \"3020300c06082a864886f70d020505000410\",\n },\n \"RSA-MD5\": {\n sign: \"rsa\",\n hash: \"md5\",\n id: \"3020300c06082a864886f70d020505000410\",\n },\n };\n },\n});\n\n// node_modules/browserify-sign/algos.js\nvar require_algos = __commonJS({\n \"node_modules/browserify-sign/algos.js\"(exports, module) {\n module.exports = require_algorithms();\n },\n});\n\n// node_modules/pbkdf2/lib/precondition.js\nvar require_precondition = __commonJS({\n \"node_modules/pbkdf2/lib/precondition.js\"(exports, module) {\n var MAX_ALLOC = Math.pow(2, 30) - 1;\n module.exports = function (iterations, keylen) {\n if (typeof iterations != \"number\") throw new TypeError(\"Iterations not a number\");\n if (iterations < 0) throw new TypeError(\"Bad iterations\");\n if (typeof keylen != \"number\") throw new TypeError(\"Key length not a number\");\n if (keylen < 0 || keylen > MAX_ALLOC || keylen !== keylen) throw new TypeError(\"Bad key length\");\n };\n },\n});\n\n// node_modules/pbkdf2/lib/default-encoding.js\nvar require_default_encoding = __commonJS({\n \"node_modules/pbkdf2/lib/default-encoding.js\"(exports, module) {\n var defaultEncoding;\n global.process && global.process.browser\n ? (defaultEncoding = \"utf-8\")\n : global.process && global.process.version\n ? ((pVersionMajor = parseInt(process.version.split(\".\")[0].slice(1), 10)),\n (defaultEncoding = pVersionMajor >= 6 ? \"utf-8\" : \"binary\"))\n : (defaultEncoding = \"utf-8\");\n var pVersionMajor;\n module.exports = defaultEncoding;\n },\n});\n\n// node_modules/pbkdf2/lib/to-buffer.js\nvar require_to_buffer = __commonJS({\n \"node_modules/pbkdf2/lib/to-buffer.js\"(exports, module) {\n var Buffer2 = require_safe_buffer().Buffer;\n module.exports = function (thing, encoding, name) {\n if (Buffer2.isBuffer(thing)) return thing;\n if (typeof thing == \"string\") return Buffer2.from(thing, encoding);\n if (ArrayBuffer.isView(thing)) return Buffer2.from(thing.buffer);\n throw new TypeError(name + \" must be a string, a Buffer, a typed array or a DataView\");\n };\n },\n});\n\n// node_modules/pbkdf2/lib/sync-browser.js\nvar require_sync_browser = __commonJS({\n \"node_modules/pbkdf2/lib/sync-browser.js\"(exports, module) {\n var md5 = require_md52(),\n RIPEMD160 = require_ripemd160(),\n sha = require_sha2(),\n Buffer2 = require_safe_buffer().Buffer,\n checkParameters = require_precondition(),\n defaultEncoding = require_default_encoding(),\n toBuffer = require_to_buffer(),\n ZEROS = Buffer2.alloc(128),\n sizes = {\n md5: 16,\n sha1: 20,\n sha224: 28,\n sha256: 32,\n sha384: 48,\n sha512: 64,\n rmd160: 20,\n ripemd160: 20,\n };\n function Hmac(alg, key, saltLen) {\n var hash = getDigest(alg),\n blocksize = alg === \"sha512\" || alg === \"sha384\" ? 128 : 64;\n key.length > blocksize\n ? (key = hash(key))\n : key.length < blocksize && (key = Buffer2.concat([key, ZEROS], blocksize));\n for (\n var ipad = Buffer2.allocUnsafe(blocksize + sizes[alg]),\n opad = Buffer2.allocUnsafe(blocksize + sizes[alg]),\n i = 0;\n i < blocksize;\n i++\n )\n (ipad[i] = key[i] ^ 54), (opad[i] = key[i] ^ 92);\n var ipad1 = Buffer2.allocUnsafe(blocksize + saltLen + 4);\n ipad.copy(ipad1, 0, 0, blocksize),\n (this.ipad1 = ipad1),\n (this.ipad2 = ipad),\n (this.opad = opad),\n (this.alg = alg),\n (this.blocksize = blocksize),\n (this.hash = hash),\n (this.size = sizes[alg]);\n }\n Hmac.prototype.run = function (data, ipad) {\n data.copy(ipad, this.blocksize);\n var h = this.hash(ipad);\n return h.copy(this.opad, this.blocksize), this.hash(this.opad);\n };\n function getDigest(alg) {\n function shaFunc(data) {\n return sha(alg).update(data).digest();\n }\n function rmd160Func(data) {\n return new RIPEMD160().update(data).digest();\n }\n return alg === \"rmd160\" || alg === \"ripemd160\" ? rmd160Func : alg === \"md5\" ? md5 : shaFunc;\n }\n function pbkdf2(password, salt, iterations, keylen, digest) {\n checkParameters(iterations, keylen),\n (password = toBuffer(password, defaultEncoding, \"Password\")),\n (salt = toBuffer(salt, defaultEncoding, \"Salt\")),\n (digest = digest || \"sha1\");\n var hmac = new Hmac(digest, password, salt.length),\n DK = Buffer2.allocUnsafe(keylen),\n block1 = Buffer2.allocUnsafe(salt.length + 4);\n salt.copy(block1, 0, 0, salt.length);\n for (var destPos = 0, hLen = sizes[digest], l = Math.ceil(keylen / hLen), i = 1; i <= l; i++) {\n block1.writeUInt32BE(i, salt.length);\n for (var T = hmac.run(block1, hmac.ipad1), U = T, j = 1; j < iterations; j++) {\n U = hmac.run(U, hmac.ipad2);\n for (var k = 0; k < hLen; k++) T[k] ^= U[k];\n }\n T.copy(DK, destPos), (destPos += hLen);\n }\n return DK;\n }\n module.exports = pbkdf2;\n },\n});\n\n// node_modules/pbkdf2/lib/async.js\nvar require_async = __commonJS({\n \"node_modules/pbkdf2/lib/async.js\"(exports, module) {\n var Buffer2 = require_safe_buffer().Buffer,\n checkParameters = require_precondition(),\n defaultEncoding = require_default_encoding(),\n sync = require_sync_browser(),\n toBuffer = require_to_buffer(),\n ZERO_BUF,\n subtle = globalCrypto.subtle,\n toBrowser = {\n sha: \"SHA-1\",\n \"sha-1\": \"SHA-1\",\n sha1: \"SHA-1\",\n sha256: \"SHA-256\",\n \"sha-256\": \"SHA-256\",\n sha384: \"SHA-384\",\n \"sha-384\": \"SHA-384\",\n \"sha-512\": \"SHA-512\",\n sha512: \"SHA-512\",\n },\n checks = [];\n function checkNative(algo) {\n if ((global.process && !global.process.browser) || !subtle || !subtle.importKey || !subtle.deriveBits)\n return Promise.resolve(!1);\n if (checks[algo] !== void 0) return checks[algo];\n ZERO_BUF = ZERO_BUF || Buffer2.alloc(8);\n var prom = browserPbkdf2(ZERO_BUF, ZERO_BUF, 10, 128, algo)\n .then(function () {\n return !0;\n })\n .catch(function () {\n return !1;\n });\n return (checks[algo] = prom), prom;\n }\n var nextTick;\n function getNextTick() {\n return (\n nextTick ||\n (global.process && global.process.nextTick\n ? (nextTick = global.process.nextTick)\n : global.queueMicrotask\n ? (nextTick = global.queueMicrotask)\n : global.setImmediate\n ? (nextTick = global.setImmediate)\n : (nextTick = global.setTimeout),\n nextTick)\n );\n }\n function browserPbkdf2(password, salt, iterations, length, algo) {\n return subtle\n .importKey(\"raw\", password, { name: \"PBKDF2\" }, !1, [\"deriveBits\"])\n .then(function (key) {\n return subtle.deriveBits(\n {\n name: \"PBKDF2\",\n salt,\n iterations,\n hash: {\n name: algo,\n },\n },\n key,\n length << 3,\n );\n })\n .then(function (res) {\n return Buffer2.from(res);\n });\n }\n function resolvePromise(promise, callback) {\n promise.then(\n function (out) {\n getNextTick()(function () {\n callback(null, out);\n });\n },\n function (e) {\n getNextTick()(function () {\n callback(e);\n });\n },\n );\n }\n module.exports = function (password, salt, iterations, keylen, digest, callback) {\n typeof digest == \"function\" && ((callback = digest), (digest = void 0)), (digest = digest || \"sha1\");\n var algo = toBrowser[digest.toLowerCase()];\n if (!algo || typeof global.Promise != \"function\") {\n getNextTick()(function () {\n var out;\n try {\n out = sync(password, salt, iterations, keylen, digest);\n } catch (e) {\n return callback(e);\n }\n callback(null, out);\n });\n return;\n }\n if (\n (checkParameters(iterations, keylen),\n (password = toBuffer(password, defaultEncoding, \"Password\")),\n (salt = toBuffer(salt, defaultEncoding, \"Salt\")),\n typeof callback != \"function\")\n )\n throw new Error(\"No callback provided to pbkdf2\");\n resolvePromise(\n checkNative(algo).then(function (resp) {\n return resp\n ? browserPbkdf2(password, salt, iterations, keylen, algo)\n : sync(password, salt, iterations, keylen, digest);\n }),\n callback,\n );\n };\n },\n});\n\n// node_modules/pbkdf2/browser.js\nvar require_browser4 = __commonJS({\n \"node_modules/pbkdf2/browser.js\"(exports) {\n exports.pbkdf2 = require_async();\n exports.pbkdf2Sync = require_sync_browser();\n },\n});\n\n// node_modules/des.js/lib/des/utils.js\nvar require_utils = __commonJS({\n \"node_modules/des.js/lib/des/utils.js\"(exports) {\n \"use strict\";\n exports.readUInt32BE = function (bytes, off) {\n var res = (bytes[0 + off] << 24) | (bytes[1 + off] << 16) | (bytes[2 + off] << 8) | bytes[3 + off];\n return res >>> 0;\n };\n exports.writeUInt32BE = function (bytes, value, off) {\n (bytes[0 + off] = value >>> 24),\n (bytes[1 + off] = (value >>> 16) & 255),\n (bytes[2 + off] = (value >>> 8) & 255),\n (bytes[3 + off] = value & 255);\n };\n exports.ip = function (inL, inR, out, off) {\n for (var outL = 0, outR = 0, i = 6; i >= 0; i -= 2) {\n for (var j = 0; j <= 24; j += 8) (outL <<= 1), (outL |= (inR >>> (j + i)) & 1);\n for (var j = 0; j <= 24; j += 8) (outL <<= 1), (outL |= (inL >>> (j + i)) & 1);\n }\n for (var i = 6; i >= 0; i -= 2) {\n for (var j = 1; j <= 25; j += 8) (outR <<= 1), (outR |= (inR >>> (j + i)) & 1);\n for (var j = 1; j <= 25; j += 8) (outR <<= 1), (outR |= (inL >>> (j + i)) & 1);\n }\n (out[off + 0] = outL >>> 0), (out[off + 1] = outR >>> 0);\n };\n exports.rip = function (inL, inR, out, off) {\n for (var outL = 0, outR = 0, i = 0; i < 4; i++)\n for (var j = 24; j >= 0; j -= 8)\n (outL <<= 1), (outL |= (inR >>> (j + i)) & 1), (outL <<= 1), (outL |= (inL >>> (j + i)) & 1);\n for (var i = 4; i < 8; i++)\n for (var j = 24; j >= 0; j -= 8)\n (outR <<= 1), (outR |= (inR >>> (j + i)) & 1), (outR <<= 1), (outR |= (inL >>> (j + i)) & 1);\n (out[off + 0] = outL >>> 0), (out[off + 1] = outR >>> 0);\n };\n exports.pc1 = function (inL, inR, out, off) {\n for (var outL = 0, outR = 0, i = 7; i >= 5; i--) {\n for (var j = 0; j <= 24; j += 8) (outL <<= 1), (outL |= (inR >> (j + i)) & 1);\n for (var j = 0; j <= 24; j += 8) (outL <<= 1), (outL |= (inL >> (j + i)) & 1);\n }\n for (var j = 0; j <= 24; j += 8) (outL <<= 1), (outL |= (inR >> (j + i)) & 1);\n for (var i = 1; i <= 3; i++) {\n for (var j = 0; j <= 24; j += 8) (outR <<= 1), (outR |= (inR >> (j + i)) & 1);\n for (var j = 0; j <= 24; j += 8) (outR <<= 1), (outR |= (inL >> (j + i)) & 1);\n }\n for (var j = 0; j <= 24; j += 8) (outR <<= 1), (outR |= (inL >> (j + i)) & 1);\n (out[off + 0] = outL >>> 0), (out[off + 1] = outR >>> 0);\n };\n exports.r28shl = function (num, shift) {\n return ((num << shift) & 268435455) | (num >>> (28 - shift));\n };\n var pc2table = [\n 14, 11, 17, 4, 27, 23, 25, 0, 13, 22, 7, 18, 5, 9, 16, 24, 2, 20, 12, 21, 1, 8, 15, 26, 15, 4, 25, 19, 9, 1, 26,\n 16, 5, 11, 23, 8, 12, 7, 17, 0, 22, 3, 10, 14, 6, 20, 27, 24,\n ];\n exports.pc2 = function (inL, inR, out, off) {\n for (var outL = 0, outR = 0, len = pc2table.length >>> 1, i = 0; i < len; i++)\n (outL <<= 1), (outL |= (inL >>> pc2table[i]) & 1);\n for (var i = len; i < pc2table.length; i++) (outR <<= 1), (outR |= (inR >>> pc2table[i]) & 1);\n (out[off + 0] = outL >>> 0), (out[off + 1] = outR >>> 0);\n };\n exports.expand = function (r, out, off) {\n var outL = 0,\n outR = 0;\n outL = ((r & 1) << 5) | (r >>> 27);\n for (var i = 23; i >= 15; i -= 4) (outL <<= 6), (outL |= (r >>> i) & 63);\n for (var i = 11; i >= 3; i -= 4) (outR |= (r >>> i) & 63), (outR <<= 6);\n (outR |= ((r & 31) << 1) | (r >>> 31)), (out[off + 0] = outL >>> 0), (out[off + 1] = outR >>> 0);\n };\n var sTable = [\n 14, 0, 4, 15, 13, 7, 1, 4, 2, 14, 15, 2, 11, 13, 8, 1, 3, 10, 10, 6, 6, 12, 12, 11, 5, 9, 9, 5, 0, 3, 7, 8, 4, 15,\n 1, 12, 14, 8, 8, 2, 13, 4, 6, 9, 2, 1, 11, 7, 15, 5, 12, 11, 9, 3, 7, 14, 3, 10, 10, 0, 5, 6, 0, 13, 15, 3, 1, 13,\n 8, 4, 14, 7, 6, 15, 11, 2, 3, 8, 4, 14, 9, 12, 7, 0, 2, 1, 13, 10, 12, 6, 0, 9, 5, 11, 10, 5, 0, 13, 14, 8, 7, 10,\n 11, 1, 10, 3, 4, 15, 13, 4, 1, 2, 5, 11, 8, 6, 12, 7, 6, 12, 9, 0, 3, 5, 2, 14, 15, 9, 10, 13, 0, 7, 9, 0, 14, 9,\n 6, 3, 3, 4, 15, 6, 5, 10, 1, 2, 13, 8, 12, 5, 7, 14, 11, 12, 4, 11, 2, 15, 8, 1, 13, 1, 6, 10, 4, 13, 9, 0, 8, 6,\n 15, 9, 3, 8, 0, 7, 11, 4, 1, 15, 2, 14, 12, 3, 5, 11, 10, 5, 14, 2, 7, 12, 7, 13, 13, 8, 14, 11, 3, 5, 0, 6, 6,\n 15, 9, 0, 10, 3, 1, 4, 2, 7, 8, 2, 5, 12, 11, 1, 12, 10, 4, 14, 15, 9, 10, 3, 6, 15, 9, 0, 0, 6, 12, 10, 11, 1, 7,\n 13, 13, 8, 15, 9, 1, 4, 3, 5, 14, 11, 5, 12, 2, 7, 8, 2, 4, 14, 2, 14, 12, 11, 4, 2, 1, 12, 7, 4, 10, 7, 11, 13,\n 6, 1, 8, 5, 5, 0, 3, 15, 15, 10, 13, 3, 0, 9, 14, 8, 9, 6, 4, 11, 2, 8, 1, 12, 11, 7, 10, 1, 13, 14, 7, 2, 8, 13,\n 15, 6, 9, 15, 12, 0, 5, 9, 6, 10, 3, 4, 0, 5, 14, 3, 12, 10, 1, 15, 10, 4, 15, 2, 9, 7, 2, 12, 6, 9, 8, 5, 0, 6,\n 13, 1, 3, 13, 4, 14, 14, 0, 7, 11, 5, 3, 11, 8, 9, 4, 14, 3, 15, 2, 5, 12, 2, 9, 8, 5, 12, 15, 3, 10, 7, 11, 0,\n 14, 4, 1, 10, 7, 1, 6, 13, 0, 11, 8, 6, 13, 4, 13, 11, 0, 2, 11, 14, 7, 15, 4, 0, 9, 8, 1, 13, 10, 3, 14, 12, 3,\n 9, 5, 7, 12, 5, 2, 10, 15, 6, 8, 1, 6, 1, 6, 4, 11, 11, 13, 13, 8, 12, 1, 3, 4, 7, 10, 14, 7, 10, 9, 15, 5, 6, 0,\n 8, 15, 0, 14, 5, 2, 9, 3, 2, 12, 13, 1, 2, 15, 8, 13, 4, 8, 6, 10, 15, 3, 11, 7, 1, 4, 10, 12, 9, 5, 3, 6, 14, 11,\n 5, 0, 0, 14, 12, 9, 7, 2, 7, 2, 11, 1, 4, 14, 1, 7, 9, 4, 12, 10, 14, 8, 2, 13, 0, 15, 6, 12, 10, 9, 13, 0, 15, 3,\n 3, 5, 5, 6, 8, 11,\n ];\n exports.substitute = function (inL, inR) {\n for (var out = 0, i = 0; i < 4; i++) {\n var b = (inL >>> (18 - i * 6)) & 63,\n sb = sTable[i * 64 + b];\n (out <<= 4), (out |= sb);\n }\n for (var i = 0; i < 4; i++) {\n var b = (inR >>> (18 - i * 6)) & 63,\n sb = sTable[4 * 64 + i * 64 + b];\n (out <<= 4), (out |= sb);\n }\n return out >>> 0;\n };\n var permuteTable = [\n 16, 25, 12, 11, 3, 20, 4, 15, 31, 17, 9, 6, 27, 14, 1, 22, 30, 24, 8, 18, 0, 5, 29, 23, 13, 19, 2, 26, 10, 21, 28,\n 7,\n ];\n exports.permute = function (num) {\n for (var out = 0, i = 0; i < permuteTable.length; i++) (out <<= 1), (out |= (num >>> permuteTable[i]) & 1);\n return out >>> 0;\n };\n exports.padSplit = function (num, size, group) {\n for (var str = num.toString(2); str.length < size; ) str = \"0\" + str;\n for (var out = [], i = 0; i < size; i += group) out.push(str.slice(i, i + group));\n return out.join(\" \");\n };\n },\n});\n\n// node_modules/minimalistic-assert/index.js\nvar require_minimalistic_assert = __commonJS({\n \"node_modules/minimalistic-assert/index.js\"(exports, module) {\n module.exports = assert;\n function assert(val, msg) {\n if (!val) throw new Error(msg || \"Assertion failed\");\n }\n assert.equal = function (l, r, msg) {\n if (l != r) throw new Error(msg || \"Assertion failed: \" + l + \" != \" + r);\n };\n },\n});\n\n// node_modules/des.js/lib/des/cipher.js\nvar require_cipher = __commonJS({\n \"node_modules/des.js/lib/des/cipher.js\"(exports, module) {\n \"use strict\";\n var assert = require_minimalistic_assert();\n function Cipher(options) {\n (this.options = options),\n (this.type = this.options.type),\n (this.blockSize = 8),\n this._init(),\n (this.buffer = new Array(this.blockSize)),\n (this.bufferOff = 0);\n }\n module.exports = Cipher;\n Cipher.prototype._init = function () {};\n Cipher.prototype.update = function (data) {\n return data.length === 0 ? [] : this.type === \"decrypt\" ? this._updateDecrypt(data) : this._updateEncrypt(data);\n };\n Cipher.prototype._buffer = function (data, off) {\n for (var min = Math.min(this.buffer.length - this.bufferOff, data.length - off), i = 0; i < min; i++)\n this.buffer[this.bufferOff + i] = data[off + i];\n return (this.bufferOff += min), min;\n };\n Cipher.prototype._flushBuffer = function (out, off) {\n return this._update(this.buffer, 0, out, off), (this.bufferOff = 0), this.blockSize;\n };\n Cipher.prototype._updateEncrypt = function (data) {\n var inputOff = 0,\n outputOff = 0,\n count = ((this.bufferOff + data.length) / this.blockSize) | 0,\n out = new Array(count * this.blockSize);\n this.bufferOff !== 0 &&\n ((inputOff += this._buffer(data, inputOff)),\n this.bufferOff === this.buffer.length && (outputOff += this._flushBuffer(out, outputOff)));\n for (\n var max = data.length - ((data.length - inputOff) % this.blockSize);\n inputOff < max;\n inputOff += this.blockSize\n )\n this._update(data, inputOff, out, outputOff), (outputOff += this.blockSize);\n for (; inputOff < data.length; inputOff++, this.bufferOff++) this.buffer[this.bufferOff] = data[inputOff];\n return out;\n };\n Cipher.prototype._updateDecrypt = function (data) {\n for (\n var inputOff = 0,\n outputOff = 0,\n count = Math.ceil((this.bufferOff + data.length) / this.blockSize) - 1,\n out = new Array(count * this.blockSize);\n count > 0;\n count--\n )\n (inputOff += this._buffer(data, inputOff)), (outputOff += this._flushBuffer(out, outputOff));\n return (inputOff += this._buffer(data, inputOff)), out;\n };\n Cipher.prototype.final = function (buffer) {\n var first;\n buffer && (first = this.update(buffer));\n var last;\n return (\n this.type === \"encrypt\" ? (last = this._finalEncrypt()) : (last = this._finalDecrypt()),\n first ? first.concat(last) : last\n );\n };\n Cipher.prototype._pad = function (buffer, off) {\n if (off === 0) return !1;\n for (; off < buffer.length; ) buffer[off++] = 0;\n return !0;\n };\n Cipher.prototype._finalEncrypt = function () {\n if (!this._pad(this.buffer, this.bufferOff)) return [];\n var out = new Array(this.blockSize);\n return this._update(this.buffer, 0, out, 0), out;\n };\n Cipher.prototype._unpad = function (buffer) {\n return buffer;\n };\n Cipher.prototype._finalDecrypt = function () {\n assert.equal(this.bufferOff, this.blockSize, \"Not enough data to decrypt\");\n var out = new Array(this.blockSize);\n return this._flushBuffer(out, 0), this._unpad(out);\n };\n },\n});\n\n// node_modules/des.js/lib/des/des.js\nvar require_des = __commonJS({\n \"node_modules/des.js/lib/des/des.js\"(exports, module) {\n \"use strict\";\n var assert = require_minimalistic_assert(),\n inherits = require_inherits_browser(),\n utils = require_utils(),\n Cipher = require_cipher();\n function DESState() {\n (this.tmp = new Array(2)), (this.keys = null);\n }\n function DES(options) {\n Cipher.call(this, options);\n var state = new DESState();\n (this._desState = state), this.deriveKeys(state, options.key);\n }\n inherits(DES, Cipher);\n module.exports = DES;\n DES.create = function (options) {\n return new DES(options);\n };\n var shiftTable = [1, 1, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 1];\n DES.prototype.deriveKeys = function (state, key) {\n (state.keys = new Array(16 * 2)), assert.equal(key.length, this.blockSize, \"Invalid key length\");\n var kL = utils.readUInt32BE(key, 0),\n kR = utils.readUInt32BE(key, 4);\n utils.pc1(kL, kR, state.tmp, 0), (kL = state.tmp[0]), (kR = state.tmp[1]);\n for (var i = 0; i < state.keys.length; i += 2) {\n var shift = shiftTable[i >>> 1];\n (kL = utils.r28shl(kL, shift)), (kR = utils.r28shl(kR, shift)), utils.pc2(kL, kR, state.keys, i);\n }\n };\n DES.prototype._update = function (inp, inOff, out, outOff) {\n var state = this._desState,\n l = utils.readUInt32BE(inp, inOff),\n r = utils.readUInt32BE(inp, inOff + 4);\n utils.ip(l, r, state.tmp, 0),\n (l = state.tmp[0]),\n (r = state.tmp[1]),\n this.type === \"encrypt\" ? this._encrypt(state, l, r, state.tmp, 0) : this._decrypt(state, l, r, state.tmp, 0),\n (l = state.tmp[0]),\n (r = state.tmp[1]),\n utils.writeUInt32BE(out, l, outOff),\n utils.writeUInt32BE(out, r, outOff + 4);\n };\n DES.prototype._pad = function (buffer, off) {\n for (var value = buffer.length - off, i = off; i < buffer.length; i++) buffer[i] = value;\n return !0;\n };\n DES.prototype._unpad = function (buffer) {\n for (var pad = buffer[buffer.length - 1], i = buffer.length - pad; i < buffer.length; i++)\n assert.equal(buffer[i], pad);\n return buffer.slice(0, buffer.length - pad);\n };\n DES.prototype._encrypt = function (state, lStart, rStart, out, off) {\n for (var l = lStart, r = rStart, i = 0; i < state.keys.length; i += 2) {\n var keyL = state.keys[i],\n keyR = state.keys[i + 1];\n utils.expand(r, state.tmp, 0), (keyL ^= state.tmp[0]), (keyR ^= state.tmp[1]);\n var s = utils.substitute(keyL, keyR),\n f = utils.permute(s),\n t = r;\n (r = (l ^ f) >>> 0), (l = t);\n }\n utils.rip(r, l, out, off);\n };\n DES.prototype._decrypt = function (state, lStart, rStart, out, off) {\n for (var l = rStart, r = lStart, i = state.keys.length - 2; i >= 0; i -= 2) {\n var keyL = state.keys[i],\n keyR = state.keys[i + 1];\n utils.expand(l, state.tmp, 0), (keyL ^= state.tmp[0]), (keyR ^= state.tmp[1]);\n var s = utils.substitute(keyL, keyR),\n f = utils.permute(s),\n t = l;\n (l = (r ^ f) >>> 0), (r = t);\n }\n utils.rip(l, r, out, off);\n };\n },\n});\n\n// node_modules/des.js/lib/des/cbc.js\nvar require_cbc = __commonJS({\n \"node_modules/des.js/lib/des/cbc.js\"(exports) {\n \"use strict\";\n var assert = require_minimalistic_assert(),\n inherits = require_inherits_browser(),\n proto = {};\n function CBCState(iv) {\n assert.equal(iv.length, 8, \"Invalid IV length\"), (this.iv = new Array(8));\n for (var i = 0; i < this.iv.length; i++) this.iv[i] = iv[i];\n }\n function instantiate(Base) {\n function CBC(options) {\n Base.call(this, options), this._cbcInit();\n }\n inherits(CBC, Base);\n for (var keys = Object.keys(proto), i = 0; i < keys.length; i++) {\n var key = keys[i];\n CBC.prototype[key] = proto[key];\n }\n return (\n (CBC.create = function (options) {\n return new CBC(options);\n }),\n CBC\n );\n }\n exports.instantiate = instantiate;\n proto._cbcInit = function () {\n var state = new CBCState(this.options.iv);\n this._cbcState = state;\n };\n proto._update = function (inp, inOff, out, outOff) {\n var state = this._cbcState,\n superProto = this.constructor.super_.prototype,\n iv = state.iv;\n if (this.type === \"encrypt\") {\n for (var i = 0; i < this.blockSize; i++) iv[i] ^= inp[inOff + i];\n superProto._update.call(this, iv, 0, out, outOff);\n for (var i = 0; i < this.blockSize; i++) iv[i] = out[outOff + i];\n } else {\n superProto._update.call(this, inp, inOff, out, outOff);\n for (var i = 0; i < this.blockSize; i++) out[outOff + i] ^= iv[i];\n for (var i = 0; i < this.blockSize; i++) iv[i] = inp[inOff + i];\n }\n };\n },\n});\n\n// node_modules/des.js/lib/des/ede.js\nvar require_ede = __commonJS({\n \"node_modules/des.js/lib/des/ede.js\"(exports, module) {\n \"use strict\";\n var assert = require_minimalistic_assert(),\n inherits = require_inherits_browser(),\n Cipher = require_cipher(),\n DES = require_des();\n function EDEState(type, key) {\n assert.equal(key.length, 24, \"Invalid key length\");\n var k1 = key.slice(0, 8),\n k2 = key.slice(8, 16),\n k3 = key.slice(16, 24);\n type === \"encrypt\"\n ? (this.ciphers = [\n DES.create({ type: \"encrypt\", key: k1 }),\n DES.create({ type: \"decrypt\", key: k2 }),\n DES.create({ type: \"encrypt\", key: k3 }),\n ])\n : (this.ciphers = [\n DES.create({ type: \"decrypt\", key: k3 }),\n DES.create({ type: \"encrypt\", key: k2 }),\n DES.create({ type: \"decrypt\", key: k1 }),\n ]);\n }\n function EDE(options) {\n Cipher.call(this, options);\n var state = new EDEState(this.type, this.options.key);\n this._edeState = state;\n }\n inherits(EDE, Cipher);\n module.exports = EDE;\n EDE.create = function (options) {\n return new EDE(options);\n };\n EDE.prototype._update = function (inp, inOff, out, outOff) {\n var state = this._edeState;\n state.ciphers[0]._update(inp, inOff, out, outOff),\n state.ciphers[1]._update(out, outOff, out, outOff),\n state.ciphers[2]._update(out, outOff, out, outOff);\n };\n EDE.prototype._pad = DES.prototype._pad;\n EDE.prototype._unpad = DES.prototype._unpad;\n },\n});\n\n// node_modules/des.js/lib/des.js\nvar require_des2 = __commonJS({\n \"node_modules/des.js/lib/des.js\"(exports) {\n \"use strict\";\n exports.utils = require_utils();\n exports.Cipher = require_cipher();\n exports.DES = require_des();\n exports.CBC = require_cbc();\n exports.EDE = require_ede();\n },\n});\n\n// node_modules/browserify-des/index.js\nvar require_browserify_des = __commonJS({\n \"node_modules/browserify-des/index.js\"(exports, module) {\n var CipherBase = require_cipher_base(),\n des = require_des2(),\n inherits = require_inherits_browser(),\n Buffer2 = require_safe_buffer().Buffer,\n modes = {\n \"des-ede3-cbc\": des.CBC.instantiate(des.EDE),\n \"des-ede3\": des.EDE,\n \"des-ede-cbc\": des.CBC.instantiate(des.EDE),\n \"des-ede\": des.EDE,\n \"des-cbc\": des.CBC.instantiate(des.DES),\n \"des-ecb\": des.DES,\n };\n modes.des = modes[\"des-cbc\"];\n modes.des3 = modes[\"des-ede3-cbc\"];\n module.exports = DES;\n inherits(DES, CipherBase);\n function DES(opts) {\n CipherBase.call(this);\n var modeName = opts.mode.toLowerCase(),\n mode = modes[modeName],\n type;\n opts.decrypt ? (type = \"decrypt\") : (type = \"encrypt\");\n var key = opts.key;\n Buffer2.isBuffer(key) || (key = Buffer2.from(key)),\n (modeName === \"des-ede\" || modeName === \"des-ede-cbc\") && (key = Buffer2.concat([key, key.slice(0, 8)]));\n var iv = opts.iv;\n Buffer2.isBuffer(iv) || (iv = Buffer2.from(iv)),\n (this._des = mode.create({\n key,\n iv,\n type,\n }));\n }\n DES.prototype._update = function (data) {\n return Buffer2.from(this._des.update(data));\n };\n DES.prototype._final = function () {\n return Buffer2.from(this._des.final());\n };\n },\n});\n\n// node_modules/browserify-aes/modes/ecb.js\nvar require_ecb = __commonJS({\n \"node_modules/browserify-aes/modes/ecb.js\"(exports) {\n exports.encrypt = function (self2, block) {\n return self2._cipher.encryptBlock(block);\n };\n exports.decrypt = function (self2, block) {\n return self2._cipher.decryptBlock(block);\n };\n },\n});\n\n// node_modules/buffer-xor/index.js\nvar require_buffer_xor = __commonJS({\n \"node_modules/buffer-xor/index.js\"(exports, module) {\n module.exports = function (a, b) {\n for (var length = Math.min(a.length, b.length), buffer = new Buffer(length), i = 0; i < length; ++i)\n buffer[i] = a[i] ^ b[i];\n return buffer;\n };\n },\n});\n\n// node_modules/browserify-aes/modes/cbc.js\nvar require_cbc2 = __commonJS({\n \"node_modules/browserify-aes/modes/cbc.js\"(exports) {\n var xor = require_buffer_xor();\n exports.encrypt = function (self2, block) {\n var data = xor(block, self2._prev);\n return (self2._prev = self2._cipher.encryptBlock(data)), self2._prev;\n };\n exports.decrypt = function (self2, block) {\n var pad = self2._prev;\n self2._prev = block;\n var out = self2._cipher.decryptBlock(block);\n return xor(out, pad);\n };\n },\n});\n\n// node_modules/browserify-aes/modes/cfb.js\nvar require_cfb = __commonJS({\n \"node_modules/browserify-aes/modes/cfb.js\"(exports) {\n var Buffer2 = require_safe_buffer().Buffer,\n xor = require_buffer_xor();\n function encryptStart(self2, data, decrypt) {\n var len = data.length,\n out = xor(data, self2._cache);\n return (\n (self2._cache = self2._cache.slice(len)),\n (self2._prev = Buffer2.concat([self2._prev, decrypt ? data : out])),\n out\n );\n }\n exports.encrypt = function (self2, data, decrypt) {\n for (var out = Buffer2.allocUnsafe(0), len; data.length; )\n if (\n (self2._cache.length === 0 &&\n ((self2._cache = self2._cipher.encryptBlock(self2._prev)), (self2._prev = Buffer2.allocUnsafe(0))),\n self2._cache.length <= data.length)\n )\n (len = self2._cache.length),\n (out = Buffer2.concat([out, encryptStart(self2, data.slice(0, len), decrypt)])),\n (data = data.slice(len));\n else {\n out = Buffer2.concat([out, encryptStart(self2, data, decrypt)]);\n break;\n }\n return out;\n };\n },\n});\n\n// node_modules/browserify-aes/modes/cfb8.js\nvar require_cfb8 = __commonJS({\n \"node_modules/browserify-aes/modes/cfb8.js\"(exports) {\n var Buffer2 = require_safe_buffer().Buffer;\n function encryptByte(self2, byteParam, decrypt) {\n var pad = self2._cipher.encryptBlock(self2._prev),\n out = pad[0] ^ byteParam;\n return (self2._prev = Buffer2.concat([self2._prev.slice(1), Buffer2.from([decrypt ? byteParam : out])])), out;\n }\n exports.encrypt = function (self2, chunk, decrypt) {\n for (var len = chunk.length, out = Buffer2.allocUnsafe(len), i = -1; ++i < len; )\n out[i] = encryptByte(self2, chunk[i], decrypt);\n return out;\n };\n },\n});\n\n// node_modules/browserify-aes/modes/cfb1.js\nvar require_cfb1 = __commonJS({\n \"node_modules/browserify-aes/modes/cfb1.js\"(exports) {\n var Buffer2 = require_safe_buffer().Buffer;\n function encryptByte(self2, byteParam, decrypt) {\n for (var pad, i = -1, len = 8, out = 0, bit, value; ++i < len; )\n (pad = self2._cipher.encryptBlock(self2._prev)),\n (bit = byteParam & (1 << (7 - i)) ? 128 : 0),\n (value = pad[0] ^ bit),\n (out += (value & 128) >> i % 8),\n (self2._prev = shiftIn(self2._prev, decrypt ? bit : value));\n return out;\n }\n function shiftIn(buffer, value) {\n var len = buffer.length,\n i = -1,\n out = Buffer2.allocUnsafe(buffer.length);\n for (buffer = Buffer2.concat([buffer, Buffer2.from([value])]); ++i < len; )\n out[i] = (buffer[i] << 1) | (buffer[i + 1] >> 7);\n return out;\n }\n exports.encrypt = function (self2, chunk, decrypt) {\n for (var len = chunk.length, out = Buffer2.allocUnsafe(len), i = -1; ++i < len; )\n out[i] = encryptByte(self2, chunk[i], decrypt);\n return out;\n };\n },\n});\n\n// node_modules/browserify-aes/modes/ofb.js\nvar require_ofb = __commonJS({\n \"node_modules/browserify-aes/modes/ofb.js\"(exports) {\n var xor = require_buffer_xor();\n function getBlock(self2) {\n return (self2._prev = self2._cipher.encryptBlock(self2._prev)), self2._prev;\n }\n exports.encrypt = function (self2, chunk) {\n for (; self2._cache.length < chunk.length; ) self2._cache = Buffer.concat([self2._cache, getBlock(self2)]);\n var pad = self2._cache.slice(0, chunk.length);\n return (self2._cache = self2._cache.slice(chunk.length)), xor(chunk, pad);\n };\n },\n});\n\n// node_modules/browserify-aes/incr32.js\nvar require_incr32 = __commonJS({\n \"node_modules/browserify-aes/incr32.js\"(exports, module) {\n function incr32(iv) {\n for (var len = iv.length, item; len--; )\n if (((item = iv.readUInt8(len)), item === 255)) iv.writeUInt8(0, len);\n else {\n item++, iv.writeUInt8(item, len);\n break;\n }\n }\n module.exports = incr32;\n },\n});\n\n// node_modules/browserify-aes/modes/ctr.js\nvar require_ctr = __commonJS({\n \"node_modules/browserify-aes/modes/ctr.js\"(exports) {\n var xor = require_buffer_xor(),\n Buffer2 = require_safe_buffer().Buffer,\n incr32 = require_incr32();\n function getBlock(self2) {\n var out = self2._cipher.encryptBlockRaw(self2._prev);\n return incr32(self2._prev), out;\n }\n var blockSize = 16;\n exports.encrypt = function (self2, chunk) {\n var chunkNum = Math.ceil(chunk.length / blockSize),\n start = self2._cache.length;\n self2._cache = Buffer2.concat([self2._cache, Buffer2.allocUnsafe(chunkNum * blockSize)]);\n for (var i = 0; i < chunkNum; i++) {\n var out = getBlock(self2),\n offset = start + i * blockSize;\n self2._cache.writeUInt32BE(out[0], offset + 0),\n self2._cache.writeUInt32BE(out[1], offset + 4),\n self2._cache.writeUInt32BE(out[2], offset + 8),\n self2._cache.writeUInt32BE(out[3], offset + 12);\n }\n var pad = self2._cache.slice(0, chunk.length);\n return (self2._cache = self2._cache.slice(chunk.length)), xor(chunk, pad);\n };\n },\n});\n\n// node_modules/browserify-aes/modes/list.json\nvar require_list = __commonJS({\n \"node_modules/browserify-aes/modes/list.json\"(exports, module) {\n module.exports = {\n \"aes-128-ecb\": {\n cipher: \"AES\",\n key: 128,\n iv: 0,\n mode: \"ECB\",\n type: \"block\",\n },\n \"aes-192-ecb\": {\n cipher: \"AES\",\n key: 192,\n iv: 0,\n mode: \"ECB\",\n type: \"block\",\n },\n \"aes-256-ecb\": {\n cipher: \"AES\",\n key: 256,\n iv: 0,\n mode: \"ECB\",\n type: \"block\",\n },\n \"aes-128-cbc\": {\n cipher: \"AES\",\n key: 128,\n iv: 16,\n mode: \"CBC\",\n type: \"block\",\n },\n \"aes-192-cbc\": {\n cipher: \"AES\",\n key: 192,\n iv: 16,\n mode: \"CBC\",\n type: \"block\",\n },\n \"aes-256-cbc\": {\n cipher: \"AES\",\n key: 256,\n iv: 16,\n mode: \"CBC\",\n type: \"block\",\n },\n aes128: {\n cipher: \"AES\",\n key: 128,\n iv: 16,\n mode: \"CBC\",\n type: \"block\",\n },\n aes192: {\n cipher: \"AES\",\n key: 192,\n iv: 16,\n mode: \"CBC\",\n type: \"block\",\n },\n aes256: {\n cipher: \"AES\",\n key: 256,\n iv: 16,\n mode: \"CBC\",\n type: \"block\",\n },\n \"aes-128-cfb\": {\n cipher: \"AES\",\n key: 128,\n iv: 16,\n mode: \"CFB\",\n type: \"stream\",\n },\n \"aes-192-cfb\": {\n cipher: \"AES\",\n key: 192,\n iv: 16,\n mode: \"CFB\",\n type: \"stream\",\n },\n \"aes-256-cfb\": {\n cipher: \"AES\",\n key: 256,\n iv: 16,\n mode: \"CFB\",\n type: \"stream\",\n },\n \"aes-128-cfb8\": {\n cipher: \"AES\",\n key: 128,\n iv: 16,\n mode: \"CFB8\",\n type: \"stream\",\n },\n \"aes-192-cfb8\": {\n cipher: \"AES\",\n key: 192,\n iv: 16,\n mode: \"CFB8\",\n type: \"stream\",\n },\n \"aes-256-cfb8\": {\n cipher: \"AES\",\n key: 256,\n iv: 16,\n mode: \"CFB8\",\n type: \"stream\",\n },\n \"aes-128-cfb1\": {\n cipher: \"AES\",\n key: 128,\n iv: 16,\n mode: \"CFB1\",\n type: \"stream\",\n },\n \"aes-192-cfb1\": {\n cipher: \"AES\",\n key: 192,\n iv: 16,\n mode: \"CFB1\",\n type: \"stream\",\n },\n \"aes-256-cfb1\": {\n cipher: \"AES\",\n key: 256,\n iv: 16,\n mode: \"CFB1\",\n type: \"stream\",\n },\n \"aes-128-ofb\": {\n cipher: \"AES\",\n key: 128,\n iv: 16,\n mode: \"OFB\",\n type: \"stream\",\n },\n \"aes-192-ofb\": {\n cipher: \"AES\",\n key: 192,\n iv: 16,\n mode: \"OFB\",\n type: \"stream\",\n },\n \"aes-256-ofb\": {\n cipher: \"AES\",\n key: 256,\n iv: 16,\n mode: \"OFB\",\n type: \"stream\",\n },\n \"aes-128-ctr\": {\n cipher: \"AES\",\n key: 128,\n iv: 16,\n mode: \"CTR\",\n type: \"stream\",\n },\n \"aes-192-ctr\": {\n cipher: \"AES\",\n key: 192,\n iv: 16,\n mode: \"CTR\",\n type: \"stream\",\n },\n \"aes-256-ctr\": {\n cipher: \"AES\",\n key: 256,\n iv: 16,\n mode: \"CTR\",\n type: \"stream\",\n },\n \"aes-128-gcm\": {\n cipher: \"AES\",\n key: 128,\n iv: 12,\n mode: \"GCM\",\n type: \"auth\",\n },\n \"aes-192-gcm\": {\n cipher: \"AES\",\n key: 192,\n iv: 12,\n mode: \"GCM\",\n type: \"auth\",\n },\n \"aes-256-gcm\": {\n cipher: \"AES\",\n key: 256,\n iv: 12,\n mode: \"GCM\",\n type: \"auth\",\n },\n };\n },\n});\n\n// node_modules/browserify-aes/modes/index.js\nvar require_modes = __commonJS({\n \"node_modules/browserify-aes/modes/index.js\"(exports, module) {\n var modeModules = {\n ECB: require_ecb(),\n CBC: require_cbc2(),\n CFB: require_cfb(),\n CFB8: require_cfb8(),\n CFB1: require_cfb1(),\n OFB: require_ofb(),\n CTR: require_ctr(),\n GCM: require_ctr(),\n },\n modes = require_list();\n for (key in modes) modes[key].module = modeModules[modes[key].mode];\n var key;\n module.exports = modes;\n },\n});\n\n// node_modules/browserify-aes/aes.js\nvar require_aes = __commonJS({\n \"node_modules/browserify-aes/aes.js\"(exports, module) {\n var Buffer2 = require_safe_buffer().Buffer;\n function asUInt32Array(buf) {\n Buffer2.isBuffer(buf) || (buf = Buffer2.from(buf));\n for (var len = (buf.length / 4) | 0, out = new Array(len), i = 0; i < len; i++) out[i] = buf.readUInt32BE(i * 4);\n return out;\n }\n function scrubVec(v) {\n for (var i = 0; i < v.length; v++) v[i] = 0;\n }\n function cryptBlock(M, keySchedule, SUB_MIX, SBOX, nRounds) {\n for (\n var SUB_MIX0 = SUB_MIX[0],\n SUB_MIX1 = SUB_MIX[1],\n SUB_MIX2 = SUB_MIX[2],\n SUB_MIX3 = SUB_MIX[3],\n s0 = M[0] ^ keySchedule[0],\n s1 = M[1] ^ keySchedule[1],\n s2 = M[2] ^ keySchedule[2],\n s3 = M[3] ^ keySchedule[3],\n t0,\n t1,\n t2,\n t3,\n ksRow = 4,\n round = 1;\n round < nRounds;\n round++\n )\n (t0 =\n SUB_MIX0[s0 >>> 24] ^\n SUB_MIX1[(s1 >>> 16) & 255] ^\n SUB_MIX2[(s2 >>> 8) & 255] ^\n SUB_MIX3[s3 & 255] ^\n keySchedule[ksRow++]),\n (t1 =\n SUB_MIX0[s1 >>> 24] ^\n SUB_MIX1[(s2 >>> 16) & 255] ^\n SUB_MIX2[(s3 >>> 8) & 255] ^\n SUB_MIX3[s0 & 255] ^\n keySchedule[ksRow++]),\n (t2 =\n SUB_MIX0[s2 >>> 24] ^\n SUB_MIX1[(s3 >>> 16) & 255] ^\n SUB_MIX2[(s0 >>> 8) & 255] ^\n SUB_MIX3[s1 & 255] ^\n keySchedule[ksRow++]),\n (t3 =\n SUB_MIX0[s3 >>> 24] ^\n SUB_MIX1[(s0 >>> 16) & 255] ^\n SUB_MIX2[(s1 >>> 8) & 255] ^\n SUB_MIX3[s2 & 255] ^\n keySchedule[ksRow++]),\n (s0 = t0),\n (s1 = t1),\n (s2 = t2),\n (s3 = t3);\n return (\n (t0 =\n ((SBOX[s0 >>> 24] << 24) | (SBOX[(s1 >>> 16) & 255] << 16) | (SBOX[(s2 >>> 8) & 255] << 8) | SBOX[s3 & 255]) ^\n keySchedule[ksRow++]),\n (t1 =\n ((SBOX[s1 >>> 24] << 24) | (SBOX[(s2 >>> 16) & 255] << 16) | (SBOX[(s3 >>> 8) & 255] << 8) | SBOX[s0 & 255]) ^\n keySchedule[ksRow++]),\n (t2 =\n ((SBOX[s2 >>> 24] << 24) | (SBOX[(s3 >>> 16) & 255] << 16) | (SBOX[(s0 >>> 8) & 255] << 8) | SBOX[s1 & 255]) ^\n keySchedule[ksRow++]),\n (t3 =\n ((SBOX[s3 >>> 24] << 24) | (SBOX[(s0 >>> 16) & 255] << 16) | (SBOX[(s1 >>> 8) & 255] << 8) | SBOX[s2 & 255]) ^\n keySchedule[ksRow++]),\n (t0 = t0 >>> 0),\n (t1 = t1 >>> 0),\n (t2 = t2 >>> 0),\n (t3 = t3 >>> 0),\n [t0, t1, t2, t3]\n );\n }\n var RCON = [0, 1, 2, 4, 8, 16, 32, 64, 128, 27, 54],\n G = (function () {\n for (var d = new Array(256), j = 0; j < 256; j++) j < 128 ? (d[j] = j << 1) : (d[j] = (j << 1) ^ 283);\n for (\n var SBOX = [],\n INV_SBOX = [],\n SUB_MIX = [[], [], [], []],\n INV_SUB_MIX = [[], [], [], []],\n x = 0,\n xi = 0,\n i = 0;\n i < 256;\n ++i\n ) {\n var sx = xi ^ (xi << 1) ^ (xi << 2) ^ (xi << 3) ^ (xi << 4);\n (sx = (sx >>> 8) ^ (sx & 255) ^ 99), (SBOX[x] = sx), (INV_SBOX[sx] = x);\n var x2 = d[x],\n x4 = d[x2],\n x8 = d[x4],\n t = (d[sx] * 257) ^ (sx * 16843008);\n (SUB_MIX[0][x] = (t << 24) | (t >>> 8)),\n (SUB_MIX[1][x] = (t << 16) | (t >>> 16)),\n (SUB_MIX[2][x] = (t << 8) | (t >>> 24)),\n (SUB_MIX[3][x] = t),\n (t = (x8 * 16843009) ^ (x4 * 65537) ^ (x2 * 257) ^ (x * 16843008)),\n (INV_SUB_MIX[0][sx] = (t << 24) | (t >>> 8)),\n (INV_SUB_MIX[1][sx] = (t << 16) | (t >>> 16)),\n (INV_SUB_MIX[2][sx] = (t << 8) | (t >>> 24)),\n (INV_SUB_MIX[3][sx] = t),\n x === 0 ? (x = xi = 1) : ((x = x2 ^ d[d[d[x8 ^ x2]]]), (xi ^= d[d[xi]]));\n }\n return {\n SBOX,\n INV_SBOX,\n SUB_MIX,\n INV_SUB_MIX,\n };\n })();\n function AES(key) {\n (this._key = asUInt32Array(key)), this._reset();\n }\n AES.blockSize = 4 * 4;\n AES.keySize = 256 / 8;\n AES.prototype.blockSize = AES.blockSize;\n AES.prototype.keySize = AES.keySize;\n AES.prototype._reset = function () {\n for (\n var keyWords = this._key,\n keySize = keyWords.length,\n nRounds = keySize + 6,\n ksRows = (nRounds + 1) * 4,\n keySchedule = [],\n k = 0;\n k < keySize;\n k++\n )\n keySchedule[k] = keyWords[k];\n for (k = keySize; k < ksRows; k++) {\n var t = keySchedule[k - 1];\n k % keySize === 0\n ? ((t = (t << 8) | (t >>> 24)),\n (t =\n (G.SBOX[t >>> 24] << 24) |\n (G.SBOX[(t >>> 16) & 255] << 16) |\n (G.SBOX[(t >>> 8) & 255] << 8) |\n G.SBOX[t & 255]),\n (t ^= RCON[(k / keySize) | 0] << 24))\n : keySize > 6 &&\n k % keySize === 4 &&\n (t =\n (G.SBOX[t >>> 24] << 24) |\n (G.SBOX[(t >>> 16) & 255] << 16) |\n (G.SBOX[(t >>> 8) & 255] << 8) |\n G.SBOX[t & 255]),\n (keySchedule[k] = keySchedule[k - keySize] ^ t);\n }\n for (var invKeySchedule = [], ik = 0; ik < ksRows; ik++) {\n var ksR = ksRows - ik,\n tt = keySchedule[ksR - (ik % 4 ? 0 : 4)];\n ik < 4 || ksR <= 4\n ? (invKeySchedule[ik] = tt)\n : (invKeySchedule[ik] =\n G.INV_SUB_MIX[0][G.SBOX[tt >>> 24]] ^\n G.INV_SUB_MIX[1][G.SBOX[(tt >>> 16) & 255]] ^\n G.INV_SUB_MIX[2][G.SBOX[(tt >>> 8) & 255]] ^\n G.INV_SUB_MIX[3][G.SBOX[tt & 255]]);\n }\n (this._nRounds = nRounds), (this._keySchedule = keySchedule), (this._invKeySchedule = invKeySchedule);\n };\n AES.prototype.encryptBlockRaw = function (M) {\n return (M = asUInt32Array(M)), cryptBlock(M, this._keySchedule, G.SUB_MIX, G.SBOX, this._nRounds);\n };\n AES.prototype.encryptBlock = function (M) {\n var out = this.encryptBlockRaw(M),\n buf = Buffer2.allocUnsafe(16);\n return (\n buf.writeUInt32BE(out[0], 0),\n buf.writeUInt32BE(out[1], 4),\n buf.writeUInt32BE(out[2], 8),\n buf.writeUInt32BE(out[3], 12),\n buf\n );\n };\n AES.prototype.decryptBlock = function (M) {\n M = asUInt32Array(M);\n var m1 = M[1];\n (M[1] = M[3]), (M[3] = m1);\n var out = cryptBlock(M, this._invKeySchedule, G.INV_SUB_MIX, G.INV_SBOX, this._nRounds),\n buf = Buffer2.allocUnsafe(16);\n return (\n buf.writeUInt32BE(out[0], 0),\n buf.writeUInt32BE(out[3], 4),\n buf.writeUInt32BE(out[2], 8),\n buf.writeUInt32BE(out[1], 12),\n buf\n );\n };\n AES.prototype.scrub = function () {\n scrubVec(this._keySchedule), scrubVec(this._invKeySchedule), scrubVec(this._key);\n };\n module.exports.AES = AES;\n },\n});\n\n// node_modules/browserify-aes/ghash.js\nvar require_ghash = __commonJS({\n \"node_modules/browserify-aes/ghash.js\"(exports, module) {\n var Buffer2 = require_safe_buffer().Buffer,\n ZEROES = Buffer2.alloc(16, 0);\n function toArray(buf) {\n return [buf.readUInt32BE(0), buf.readUInt32BE(4), buf.readUInt32BE(8), buf.readUInt32BE(12)];\n }\n function fromArray(out) {\n var buf = Buffer2.allocUnsafe(16);\n return (\n buf.writeUInt32BE(out[0] >>> 0, 0),\n buf.writeUInt32BE(out[1] >>> 0, 4),\n buf.writeUInt32BE(out[2] >>> 0, 8),\n buf.writeUInt32BE(out[3] >>> 0, 12),\n buf\n );\n }\n function GHASH(key) {\n (this.h = key), (this.state = Buffer2.alloc(16, 0)), (this.cache = Buffer2.allocUnsafe(0));\n }\n GHASH.prototype.ghash = function (block) {\n for (var i = -1; ++i < block.length; ) this.state[i] ^= block[i];\n this._multiply();\n };\n GHASH.prototype._multiply = function () {\n for (var Vi = toArray(this.h), Zi = [0, 0, 0, 0], j, xi, lsbVi, i = -1; ++i < 128; ) {\n for (\n xi = (this.state[~~(i / 8)] & (1 << (7 - (i % 8)))) !== 0,\n xi && ((Zi[0] ^= Vi[0]), (Zi[1] ^= Vi[1]), (Zi[2] ^= Vi[2]), (Zi[3] ^= Vi[3])),\n lsbVi = (Vi[3] & 1) !== 0,\n j = 3;\n j > 0;\n j--\n )\n Vi[j] = (Vi[j] >>> 1) | ((Vi[j - 1] & 1) << 31);\n (Vi[0] = Vi[0] >>> 1), lsbVi && (Vi[0] = Vi[0] ^ (225 << 24));\n }\n this.state = fromArray(Zi);\n };\n GHASH.prototype.update = function (buf) {\n this.cache = Buffer2.concat([this.cache, buf]);\n for (var chunk; this.cache.length >= 16; )\n (chunk = this.cache.slice(0, 16)), (this.cache = this.cache.slice(16)), this.ghash(chunk);\n };\n GHASH.prototype.final = function (abl, bl) {\n return (\n this.cache.length && this.ghash(Buffer2.concat([this.cache, ZEROES], 16)),\n this.ghash(fromArray([0, abl, 0, bl])),\n this.state\n );\n };\n module.exports = GHASH;\n },\n});\n\n// node_modules/browserify-aes/authCipher.js\nvar require_authCipher = __commonJS({\n \"node_modules/browserify-aes/authCipher.js\"(exports, module) {\n var aes = require_aes(),\n Buffer2 = require_safe_buffer().Buffer,\n Transform = require_cipher_base(),\n inherits = require_inherits_browser(),\n GHASH = require_ghash(),\n xor = require_buffer_xor(),\n incr32 = require_incr32();\n function xorTest(a, b) {\n var out = 0;\n a.length !== b.length && out++;\n for (var len = Math.min(a.length, b.length), i = 0; i < len; ++i) out += a[i] ^ b[i];\n return out;\n }\n function calcIv(self2, iv, ck) {\n if (iv.length === 12)\n return (\n (self2._finID = Buffer2.concat([iv, Buffer2.from([0, 0, 0, 1])])),\n Buffer2.concat([iv, Buffer2.from([0, 0, 0, 2])])\n );\n var ghash = new GHASH(ck),\n len = iv.length,\n toPad = len % 16;\n ghash.update(iv),\n toPad && ((toPad = 16 - toPad), ghash.update(Buffer2.alloc(toPad, 0))),\n ghash.update(Buffer2.alloc(8, 0));\n var ivBits = len * 8,\n tail = Buffer2.alloc(8);\n tail.writeUIntBE(ivBits, 0, 8), ghash.update(tail), (self2._finID = ghash.state);\n var out = Buffer2.from(self2._finID);\n return incr32(out), out;\n }\n function StreamCipher(mode, key, iv, decrypt) {\n Transform.call(this);\n var h = Buffer2.alloc(4, 0);\n this._cipher = new aes.AES(key);\n var ck = this._cipher.encryptBlock(h);\n (this._ghash = new GHASH(ck)),\n (iv = calcIv(this, iv, ck)),\n (this._prev = Buffer2.from(iv)),\n (this._cache = Buffer2.allocUnsafe(0)),\n (this._secCache = Buffer2.allocUnsafe(0)),\n (this._decrypt = decrypt),\n (this._alen = 0),\n (this._len = 0),\n (this._mode = mode),\n (this._authTag = null),\n (this._called = !1);\n }\n inherits(StreamCipher, Transform);\n StreamCipher.prototype._update = function (chunk) {\n if (!this._called && this._alen) {\n var rump = 16 - (this._alen % 16);\n rump < 16 && ((rump = Buffer2.alloc(rump, 0)), this._ghash.update(rump));\n }\n this._called = !0;\n var out = this._mode.encrypt(this, chunk);\n return this._decrypt ? this._ghash.update(chunk) : this._ghash.update(out), (this._len += chunk.length), out;\n };\n StreamCipher.prototype._final = function () {\n if (this._decrypt && !this._authTag) throw new Error(\"Unsupported state or unable to authenticate data\");\n var tag = xor(this._ghash.final(this._alen * 8, this._len * 8), this._cipher.encryptBlock(this._finID));\n if (this._decrypt && xorTest(tag, this._authTag))\n throw new Error(\"Unsupported state or unable to authenticate data\");\n (this._authTag = tag), this._cipher.scrub();\n };\n StreamCipher.prototype.getAuthTag = function () {\n if (this._decrypt || !Buffer2.isBuffer(this._authTag))\n throw new Error(\"Attempting to get auth tag in unsupported state\");\n return this._authTag;\n };\n StreamCipher.prototype.setAuthTag = function (tag) {\n if (!this._decrypt) throw new Error(\"Attempting to set auth tag in unsupported state\");\n this._authTag = tag;\n };\n StreamCipher.prototype.setAAD = function (buf) {\n if (this._called) throw new Error(\"Attempting to set AAD in unsupported state\");\n this._ghash.update(buf), (this._alen += buf.length);\n };\n module.exports = StreamCipher;\n },\n});\n\n// node_modules/browserify-aes/streamCipher.js\nvar require_streamCipher = __commonJS({\n \"node_modules/browserify-aes/streamCipher.js\"(exports, module) {\n var aes = require_aes(),\n Buffer2 = require_safe_buffer().Buffer,\n Transform = require_cipher_base(),\n inherits = require_inherits_browser();\n function StreamCipher(mode, key, iv, decrypt) {\n Transform.call(this),\n (this._cipher = new aes.AES(key)),\n (this._prev = Buffer2.from(iv)),\n (this._cache = Buffer2.allocUnsafe(0)),\n (this._secCache = Buffer2.allocUnsafe(0)),\n (this._decrypt = decrypt),\n (this._mode = mode);\n }\n inherits(StreamCipher, Transform);\n StreamCipher.prototype._update = function (chunk) {\n return this._mode.encrypt(this, chunk, this._decrypt);\n };\n StreamCipher.prototype._final = function () {\n this._cipher.scrub();\n };\n module.exports = StreamCipher;\n },\n});\n\n// node_modules/evp_bytestokey/index.js\nvar require_evp_bytestokey = __commonJS({\n \"node_modules/evp_bytestokey/index.js\"(exports, module) {\n var Buffer2 = require_safe_buffer().Buffer,\n MD5 = require_md5();\n function EVP_BytesToKey(password, salt, keyBits, ivLen) {\n if (\n (Buffer2.isBuffer(password) || (password = Buffer2.from(password, \"binary\")),\n salt && (Buffer2.isBuffer(salt) || (salt = Buffer2.from(salt, \"binary\")), salt.length !== 8))\n )\n throw new RangeError(\"salt should be Buffer with 8 byte length\");\n for (\n var keyLen = keyBits / 8, key = Buffer2.alloc(keyLen), iv = Buffer2.alloc(ivLen || 0), tmp = Buffer2.alloc(0);\n keyLen > 0 || ivLen > 0;\n\n ) {\n var hash = new MD5();\n hash.update(tmp), hash.update(password), salt && hash.update(salt), (tmp = hash.digest());\n var used = 0;\n if (keyLen > 0) {\n var keyStart = key.length - keyLen;\n (used = Math.min(keyLen, tmp.length)), tmp.copy(key, keyStart, 0, used), (keyLen -= used);\n }\n if (used < tmp.length && ivLen > 0) {\n var ivStart = iv.length - ivLen,\n length = Math.min(ivLen, tmp.length - used);\n tmp.copy(iv, ivStart, used, used + length), (ivLen -= length);\n }\n }\n return tmp.fill(0), { key, iv };\n }\n module.exports = EVP_BytesToKey;\n },\n});\n\n// node_modules/browserify-aes/encrypter.js\nvar require_encrypter = __commonJS({\n \"node_modules/browserify-aes/encrypter.js\"(exports) {\n var MODES = require_modes(),\n AuthCipher = require_authCipher(),\n Buffer2 = require_safe_buffer().Buffer,\n StreamCipher = require_streamCipher(),\n Transform = require_cipher_base(),\n aes = require_aes(),\n ebtk = require_evp_bytestokey(),\n inherits = require_inherits_browser();\n function Cipher(mode, key, iv) {\n Transform.call(this),\n (this._cache = new Splitter()),\n (this._cipher = new aes.AES(key)),\n (this._prev = Buffer2.from(iv)),\n (this._mode = mode),\n (this._autopadding = !0);\n }\n inherits(Cipher, Transform);\n Cipher.prototype._update = function (data) {\n this._cache.add(data);\n for (var chunk, thing, out = []; (chunk = this._cache.get()); )\n (thing = this._mode.encrypt(this, chunk)), out.push(thing);\n return Buffer2.concat(out);\n };\n var PADDING = Buffer2.alloc(16, 16);\n Cipher.prototype._final = function () {\n var chunk = this._cache.flush();\n if (this._autopadding) return (chunk = this._mode.encrypt(this, chunk)), this._cipher.scrub(), chunk;\n if (!chunk.equals(PADDING)) throw (this._cipher.scrub(), new Error(\"data not multiple of block length\"));\n };\n Cipher.prototype.setAutoPadding = function (setTo) {\n return (this._autopadding = !!setTo), this;\n };\n function Splitter() {\n this.cache = Buffer2.allocUnsafe(0);\n }\n Splitter.prototype.add = function (data) {\n this.cache = Buffer2.concat([this.cache, data]);\n };\n Splitter.prototype.get = function () {\n if (this.cache.length > 15) {\n var out = this.cache.slice(0, 16);\n return (this.cache = this.cache.slice(16)), out;\n }\n return null;\n };\n Splitter.prototype.flush = function () {\n for (var len = 16 - this.cache.length, padBuff = Buffer2.allocUnsafe(len), i = -1; ++i < len; )\n padBuff.writeUInt8(len, i);\n return Buffer2.concat([this.cache, padBuff]);\n };\n function createCipheriv(suite, password, iv) {\n var config = MODES[suite.toLowerCase()];\n if (!config) throw new TypeError(\"invalid suite type\");\n if ((typeof password == \"string\" && (password = Buffer2.from(password)), password.length !== config.key / 8))\n throw new TypeError(\"invalid key length \" + password.length);\n if ((typeof iv == \"string\" && (iv = Buffer2.from(iv)), config.mode !== \"GCM\" && iv.length !== config.iv))\n throw new TypeError(\"invalid iv length \" + iv.length);\n return config.type === \"stream\"\n ? new StreamCipher(config.module, password, iv)\n : config.type === \"auth\"\n ? new AuthCipher(config.module, password, iv)\n : new Cipher(config.module, password, iv);\n }\n function createCipher(suite, password) {\n var config = MODES[suite.toLowerCase()];\n if (!config) throw new TypeError(\"invalid suite type\");\n var keys = ebtk(password, !1, config.key, config.iv);\n return createCipheriv(suite, keys.key, keys.iv);\n }\n exports.createCipheriv = createCipheriv;\n exports.createCipher = createCipher;\n },\n});\n\n// node_modules/browserify-aes/decrypter.js\nvar require_decrypter = __commonJS({\n \"node_modules/browserify-aes/decrypter.js\"(exports) {\n var AuthCipher = require_authCipher(),\n Buffer2 = require_safe_buffer().Buffer,\n MODES = require_modes(),\n StreamCipher = require_streamCipher(),\n Transform = require_cipher_base(),\n aes = require_aes(),\n ebtk = require_evp_bytestokey(),\n inherits = require_inherits_browser();\n function Decipher(mode, key, iv) {\n Transform.call(this),\n (this._cache = new Splitter()),\n (this._last = void 0),\n (this._cipher = new aes.AES(key)),\n (this._prev = Buffer2.from(iv)),\n (this._mode = mode),\n (this._autopadding = !0);\n }\n inherits(Decipher, Transform);\n Decipher.prototype._update = function (data) {\n this._cache.add(data);\n for (var chunk, thing, out = []; (chunk = this._cache.get(this._autopadding)); )\n (thing = this._mode.decrypt(this, chunk)), out.push(thing);\n return Buffer2.concat(out);\n };\n Decipher.prototype._final = function () {\n var chunk = this._cache.flush();\n if (this._autopadding) return unpad(this._mode.decrypt(this, chunk));\n if (chunk) throw new Error(\"data not multiple of block length\");\n };\n Decipher.prototype.setAutoPadding = function (setTo) {\n return (this._autopadding = !!setTo), this;\n };\n function Splitter() {\n this.cache = Buffer2.allocUnsafe(0);\n }\n Splitter.prototype.add = function (data) {\n this.cache = Buffer2.concat([this.cache, data]);\n };\n Splitter.prototype.get = function (autoPadding) {\n var out;\n if (autoPadding) {\n if (this.cache.length > 16) return (out = this.cache.slice(0, 16)), (this.cache = this.cache.slice(16)), out;\n } else if (this.cache.length >= 16)\n return (out = this.cache.slice(0, 16)), (this.cache = this.cache.slice(16)), out;\n return null;\n };\n Splitter.prototype.flush = function () {\n if (this.cache.length) return this.cache;\n };\n function unpad(last) {\n var padded = last[15];\n if (padded < 1 || padded > 16) throw new Error(\"unable to decrypt data\");\n for (var i = -1; ++i < padded; )\n if (last[i + (16 - padded)] !== padded) throw new Error(\"unable to decrypt data\");\n if (padded !== 16) return last.slice(0, 16 - padded);\n }\n function createDecipheriv(suite, password, iv) {\n var config = MODES[suite.toLowerCase()];\n if (!config) throw new TypeError(\"invalid suite type\");\n if ((typeof iv == \"string\" && (iv = Buffer2.from(iv)), config.mode !== \"GCM\" && iv.length !== config.iv))\n throw new TypeError(\"invalid iv length \" + iv.length);\n if ((typeof password == \"string\" && (password = Buffer2.from(password)), password.length !== config.key / 8))\n throw new TypeError(\"invalid key length \" + password.length);\n return config.type === \"stream\"\n ? new StreamCipher(config.module, password, iv, !0)\n : config.type === \"auth\"\n ? new AuthCipher(config.module, password, iv, !0)\n : new Decipher(config.module, password, iv);\n }\n function createDecipher(suite, password) {\n var config = MODES[suite.toLowerCase()];\n if (!config) throw new TypeError(\"invalid suite type\");\n var keys = ebtk(password, !1, config.key, config.iv);\n return createDecipheriv(suite, keys.key, keys.iv);\n }\n exports.createDecipher = createDecipher;\n exports.createDecipheriv = createDecipheriv;\n },\n});\n\n// node_modules/browserify-aes/browser.js\nvar require_browser5 = __commonJS({\n \"node_modules/browserify-aes/browser.js\"(exports) {\n var ciphers = require_encrypter(),\n deciphers = require_decrypter(),\n modes = require_list();\n function getCiphers() {\n return Object.keys(modes);\n }\n exports.createCipher = exports.Cipher = ciphers.createCipher;\n exports.createCipheriv = exports.Cipheriv = ciphers.createCipheriv;\n exports.createDecipher = exports.Decipher = deciphers.createDecipher;\n exports.createDecipheriv = exports.Decipheriv = deciphers.createDecipheriv;\n exports.listCiphers = exports.getCiphers = getCiphers;\n },\n});\n\n// node_modules/browserify-des/modes.js\nvar require_modes2 = __commonJS({\n \"node_modules/browserify-des/modes.js\"(exports) {\n exports[\"des-ecb\"] = {\n key: 8,\n iv: 0,\n };\n exports[\"des-cbc\"] = exports.des = {\n key: 8,\n iv: 8,\n };\n exports[\"des-ede3-cbc\"] = exports.des3 = {\n key: 24,\n iv: 8,\n };\n exports[\"des-ede3\"] = {\n key: 24,\n iv: 0,\n };\n exports[\"des-ede-cbc\"] = {\n key: 16,\n iv: 8,\n };\n exports[\"des-ede\"] = {\n key: 16,\n iv: 0,\n };\n },\n});\n\n// node_modules/browserify-cipher/browser.js\nvar require_browser6 = __commonJS({\n \"node_modules/browserify-cipher/browser.js\"(exports) {\n var DES = require_browserify_des(),\n aes = require_browser5(),\n aesModes = require_modes(),\n desModes = require_modes2(),\n ebtk = require_evp_bytestokey();\n function createCipher(suite, password) {\n suite = suite.toLowerCase();\n var keyLen, ivLen;\n if (aesModes[suite]) (keyLen = aesModes[suite].key), (ivLen = aesModes[suite].iv);\n else if (desModes[suite]) (keyLen = desModes[suite].key * 8), (ivLen = desModes[suite].iv);\n else throw new TypeError(\"invalid suite type\");\n var keys = ebtk(password, !1, keyLen, ivLen);\n return createCipheriv(suite, keys.key, keys.iv);\n }\n function createDecipher(suite, password) {\n suite = suite.toLowerCase();\n var keyLen, ivLen;\n if (aesModes[suite]) (keyLen = aesModes[suite].key), (ivLen = aesModes[suite].iv);\n else if (desModes[suite]) (keyLen = desModes[suite].key * 8), (ivLen = desModes[suite].iv);\n else throw new TypeError(\"invalid suite type\");\n var keys = ebtk(password, !1, keyLen, ivLen);\n return createDecipheriv(suite, keys.key, keys.iv);\n }\n function createCipheriv(suite, key, iv) {\n if (((suite = suite.toLowerCase()), aesModes[suite])) return aes.createCipheriv(suite, key, iv);\n if (desModes[suite]) return new DES({ key, iv, mode: suite });\n throw new TypeError(\"invalid suite type\");\n }\n function createDecipheriv(suite, key, iv) {\n if (((suite = suite.toLowerCase()), aesModes[suite])) return aes.createDecipheriv(suite, key, iv);\n if (desModes[suite]) return new DES({ key, iv, mode: suite, decrypt: !0 });\n throw new TypeError(\"invalid suite type\");\n }\n function getCiphers() {\n return Object.keys(desModes).concat(aes.getCiphers());\n }\n exports.createCipher = exports.Cipher = createCipher;\n exports.createCipheriv = exports.Cipheriv = createCipheriv;\n exports.createDecipher = exports.Decipher = createDecipher;\n exports.createDecipheriv = exports.Decipheriv = createDecipheriv;\n exports.listCiphers = exports.getCiphers = getCiphers;\n },\n});\n\n// node_modules/diffie-hellman/node_modules/bn.js/lib/bn.js\nvar require_bn = __commonJS({\n \"node_modules/diffie-hellman/node_modules/bn.js/lib/bn.js\"(exports, module) {\n (function (module2, exports2) {\n \"use strict\";\n function assert(val, msg) {\n if (!val) throw new Error(msg || \"Assertion failed\");\n }\n function inherits(ctor, superCtor) {\n ctor.super_ = superCtor;\n var TempCtor = function () {};\n (TempCtor.prototype = superCtor.prototype),\n (ctor.prototype = new TempCtor()),\n (ctor.prototype.constructor = ctor);\n }\n function BN(number, base, endian) {\n if (BN.isBN(number)) return number;\n (this.negative = 0),\n (this.words = null),\n (this.length = 0),\n (this.red = null),\n number !== null &&\n ((base === \"le\" || base === \"be\") && ((endian = base), (base = 10)),\n this._init(number || 0, base || 10, endian || \"be\"));\n }\n typeof module2 == \"object\" ? (module2.exports = BN) : (exports2.BN = BN), (BN.BN = BN), (BN.wordSize = 26);\n var Buffer2;\n try {\n typeof window < \"u\" && typeof window.Buffer < \"u\"\n ? (Buffer2 = window.Buffer)\n : (Buffer2 = __require(\"buffer\").Buffer);\n } catch {}\n (BN.isBN = function (num) {\n return num instanceof BN\n ? !0\n : num !== null &&\n typeof num == \"object\" &&\n num.constructor.wordSize === BN.wordSize &&\n Array.isArray(num.words);\n }),\n (BN.max = function (left, right) {\n return left.cmp(right) > 0 ? left : right;\n }),\n (BN.min = function (left, right) {\n return left.cmp(right) < 0 ? left : right;\n }),\n (BN.prototype._init = function (number, base, endian) {\n if (typeof number == \"number\") return this._initNumber(number, base, endian);\n if (typeof number == \"object\") return this._initArray(number, base, endian);\n base === \"hex\" && (base = 16),\n assert(base === (base | 0) && base >= 2 && base <= 36),\n (number = number.toString().replace(/\\s+/g, \"\"));\n var start = 0;\n number[0] === \"-\" && (start++, (this.negative = 1)),\n start < number.length &&\n (base === 16\n ? this._parseHex(number, start, endian)\n : (this._parseBase(number, base, start),\n endian === \"le\" && this._initArray(this.toArray(), base, endian)));\n }),\n (BN.prototype._initNumber = function (number, base, endian) {\n number < 0 && ((this.negative = 1), (number = -number)),\n number < 67108864\n ? ((this.words = [number & 67108863]), (this.length = 1))\n : number < 4503599627370496\n ? ((this.words = [number & 67108863, (number / 67108864) & 67108863]), (this.length = 2))\n : (assert(number < 9007199254740992),\n (this.words = [number & 67108863, (number / 67108864) & 67108863, 1]),\n (this.length = 3)),\n endian === \"le\" && this._initArray(this.toArray(), base, endian);\n }),\n (BN.prototype._initArray = function (number, base, endian) {\n if ((assert(typeof number.length == \"number\"), number.length <= 0))\n return (this.words = [0]), (this.length = 1), this;\n (this.length = Math.ceil(number.length / 3)), (this.words = new Array(this.length));\n for (var i = 0; i < this.length; i++) this.words[i] = 0;\n var j,\n w,\n off = 0;\n if (endian === \"be\")\n for (i = number.length - 1, j = 0; i >= 0; i -= 3)\n (w = number[i] | (number[i - 1] << 8) | (number[i - 2] << 16)),\n (this.words[j] |= (w << off) & 67108863),\n (this.words[j + 1] = (w >>> (26 - off)) & 67108863),\n (off += 24),\n off >= 26 && ((off -= 26), j++);\n else if (endian === \"le\")\n for (i = 0, j = 0; i < number.length; i += 3)\n (w = number[i] | (number[i + 1] << 8) | (number[i + 2] << 16)),\n (this.words[j] |= (w << off) & 67108863),\n (this.words[j + 1] = (w >>> (26 - off)) & 67108863),\n (off += 24),\n off >= 26 && ((off -= 26), j++);\n return this.strip();\n });\n function parseHex4Bits(string, index) {\n var c = string.charCodeAt(index);\n return c >= 65 && c <= 70 ? c - 55 : c >= 97 && c <= 102 ? c - 87 : (c - 48) & 15;\n }\n function parseHexByte(string, lowerBound, index) {\n var r = parseHex4Bits(string, index);\n return index - 1 >= lowerBound && (r |= parseHex4Bits(string, index - 1) << 4), r;\n }\n BN.prototype._parseHex = function (number, start, endian) {\n (this.length = Math.ceil((number.length - start) / 6)), (this.words = new Array(this.length));\n for (var i = 0; i < this.length; i++) this.words[i] = 0;\n var off = 0,\n j = 0,\n w;\n if (endian === \"be\")\n for (i = number.length - 1; i >= start; i -= 2)\n (w = parseHexByte(number, start, i) << off),\n (this.words[j] |= w & 67108863),\n off >= 18 ? ((off -= 18), (j += 1), (this.words[j] |= w >>> 26)) : (off += 8);\n else {\n var parseLength = number.length - start;\n for (i = parseLength % 2 === 0 ? start + 1 : start; i < number.length; i += 2)\n (w = parseHexByte(number, start, i) << off),\n (this.words[j] |= w & 67108863),\n off >= 18 ? ((off -= 18), (j += 1), (this.words[j] |= w >>> 26)) : (off += 8);\n }\n this.strip();\n };\n function parseBase(str, start, end, mul) {\n for (var r = 0, len = Math.min(str.length, end), i = start; i < len; i++) {\n var c = str.charCodeAt(i) - 48;\n (r *= mul), c >= 49 ? (r += c - 49 + 10) : c >= 17 ? (r += c - 17 + 10) : (r += c);\n }\n return r;\n }\n (BN.prototype._parseBase = function (number, base, start) {\n (this.words = [0]), (this.length = 1);\n for (var limbLen = 0, limbPow = 1; limbPow <= 67108863; limbPow *= base) limbLen++;\n limbLen--, (limbPow = (limbPow / base) | 0);\n for (\n var total = number.length - start,\n mod = total % limbLen,\n end = Math.min(total, total - mod) + start,\n word = 0,\n i = start;\n i < end;\n i += limbLen\n )\n (word = parseBase(number, i, i + limbLen, base)),\n this.imuln(limbPow),\n this.words[0] + word < 67108864 ? (this.words[0] += word) : this._iaddn(word);\n if (mod !== 0) {\n var pow = 1;\n for (word = parseBase(number, i, number.length, base), i = 0; i < mod; i++) pow *= base;\n this.imuln(pow), this.words[0] + word < 67108864 ? (this.words[0] += word) : this._iaddn(word);\n }\n this.strip();\n }),\n (BN.prototype.copy = function (dest) {\n dest.words = new Array(this.length);\n for (var i = 0; i < this.length; i++) dest.words[i] = this.words[i];\n (dest.length = this.length), (dest.negative = this.negative), (dest.red = this.red);\n }),\n (BN.prototype.clone = function () {\n var r = new BN(null);\n return this.copy(r), r;\n }),\n (BN.prototype._expand = function (size) {\n for (; this.length < size; ) this.words[this.length++] = 0;\n return this;\n }),\n (BN.prototype.strip = function () {\n for (; this.length > 1 && this.words[this.length - 1] === 0; ) this.length--;\n return this._normSign();\n }),\n (BN.prototype._normSign = function () {\n return this.length === 1 && this.words[0] === 0 && (this.negative = 0), this;\n }),\n (BN.prototype.inspect = function () {\n return (this.red ? \"<BN-R: \" : \"<BN: \") + this.toString(16) + \">\";\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 groupSizes = [\n 0, 0, 25, 16, 12, 11, 10, 9, 8, 8, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5,\n 5, 5,\n ],\n groupBases = [\n 0, 0, 33554432, 43046721, 16777216, 48828125, 60466176, 40353607, 16777216, 43046721, 1e7, 19487171, 35831808,\n 62748517, 7529536, 11390625, 16777216, 24137569, 34012224, 47045881, 64e6, 4084101, 5153632, 6436343, 7962624,\n 9765625, 11881376, 14348907, 17210368, 20511149, 243e5, 28629151, 33554432, 39135393, 45435424, 52521875,\n 60466176,\n ];\n (BN.prototype.toString = function (base, padding) {\n (base = base || 10), (padding = padding | 0 || 1);\n var out;\n if (base === 16 || base === \"hex\") {\n out = \"\";\n for (var off = 0, carry = 0, i = 0; i < this.length; i++) {\n var w = this.words[i],\n word = (((w << off) | carry) & 16777215).toString(16);\n (carry = (w >>> (24 - off)) & 16777215),\n carry !== 0 || i !== this.length - 1 ? (out = zeros[6 - word.length] + word + out) : (out = word + out),\n (off += 2),\n off >= 26 && ((off -= 26), i--);\n }\n for (carry !== 0 && (out = carry.toString(16) + out); out.length % padding !== 0; ) out = \"0\" + out;\n return this.negative !== 0 && (out = \"-\" + out), out;\n }\n if (base === (base | 0) && base >= 2 && base <= 36) {\n var groupSize = groupSizes[base],\n groupBase = groupBases[base];\n out = \"\";\n var c = this.clone();\n for (c.negative = 0; !c.isZero(); ) {\n var r = c.modn(groupBase).toString(base);\n (c = c.idivn(groupBase)), c.isZero() ? (out = r + out) : (out = zeros[groupSize - r.length] + r + out);\n }\n for (this.isZero() && (out = \"0\" + out); out.length % padding !== 0; ) out = \"0\" + out;\n return this.negative !== 0 && (out = \"-\" + out), out;\n }\n assert(!1, \"Base should be between 2 and 36\");\n }),\n (BN.prototype.toNumber = function () {\n var ret = this.words[0];\n return (\n this.length === 2\n ? (ret += this.words[1] * 67108864)\n : this.length === 3 && this.words[2] === 1\n ? (ret += 4503599627370496 + this.words[1] * 67108864)\n : this.length > 2 && assert(!1, \"Number can only safely store up to 53 bits\"),\n this.negative !== 0 ? -ret : ret\n );\n }),\n (BN.prototype.toJSON = function () {\n return this.toString(16);\n }),\n (BN.prototype.toBuffer = function (endian, length) {\n return assert(typeof Buffer2 < \"u\"), this.toArrayLike(Buffer2, endian, length);\n }),\n (BN.prototype.toArray = function (endian, length) {\n return this.toArrayLike(Array, endian, length);\n }),\n (BN.prototype.toArrayLike = function (ArrayType, endian, length) {\n var byteLength = this.byteLength(),\n 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 this.strip();\n var littleEndian = endian === \"le\",\n res = new ArrayType(reqLength),\n b,\n i,\n q = this.clone();\n if (littleEndian) {\n for (i = 0; !q.isZero(); i++) (b = q.andln(255)), q.iushrn(8), (res[i] = b);\n for (; i < reqLength; i++) res[i] = 0;\n } else {\n for (i = 0; i < reqLength - byteLength; i++) res[i] = 0;\n for (i = 0; !q.isZero(); i++) (b = q.andln(255)), q.iushrn(8), (res[reqLength - i - 1] = b);\n }\n return res;\n }),\n Math.clz32\n ? (BN.prototype._countBits = function (w) {\n return 32 - Math.clz32(w);\n })\n : (BN.prototype._countBits = function (w) {\n var t = w,\n r = 0;\n return (\n t >= 4096 && ((r += 13), (t >>>= 13)),\n t >= 64 && ((r += 7), (t >>>= 7)),\n t >= 8 && ((r += 4), (t >>>= 4)),\n t >= 2 && ((r += 2), (t >>>= 2)),\n r + t\n );\n }),\n (BN.prototype._zeroBits = function (w) {\n if (w === 0) return 26;\n var t = w,\n r = 0;\n return (\n (t & 8191) === 0 && ((r += 13), (t >>>= 13)),\n (t & 127) === 0 && ((r += 7), (t >>>= 7)),\n (t & 15) === 0 && ((r += 4), (t >>>= 4)),\n (t & 3) === 0 && ((r += 2), (t >>>= 2)),\n (t & 1) === 0 && r++,\n r\n );\n }),\n (BN.prototype.bitLength = function () {\n var w = this.words[this.length - 1],\n hi = this._countBits(w);\n return (this.length - 1) * 26 + hi;\n });\n function toBitArray(num) {\n for (var w = new Array(num.bitLength()), bit = 0; bit < w.length; bit++) {\n var off = (bit / 26) | 0,\n wbit = bit % 26;\n w[bit] = (num.words[off] & (1 << wbit)) >>> wbit;\n }\n return w;\n }\n (BN.prototype.zeroBits = function () {\n if (this.isZero()) return 0;\n for (var r = 0, i = 0; i < this.length; i++) {\n var b = this._zeroBits(this.words[i]);\n if (((r += b), b !== 26)) break;\n }\n return r;\n }),\n (BN.prototype.byteLength = function () {\n return Math.ceil(this.bitLength() / 8);\n }),\n (BN.prototype.toTwos = function (width) {\n return this.negative !== 0 ? this.abs().inotn(width).iaddn(1) : this.clone();\n }),\n (BN.prototype.fromTwos = function (width) {\n return this.testn(width - 1) ? this.notn(width).iaddn(1).ineg() : this.clone();\n }),\n (BN.prototype.isNeg = function () {\n return this.negative !== 0;\n }),\n (BN.prototype.neg = function () {\n return this.clone().ineg();\n }),\n (BN.prototype.ineg = function () {\n return this.isZero() || (this.negative ^= 1), this;\n }),\n (BN.prototype.iuor = function (num) {\n for (; this.length < num.length; ) this.words[this.length++] = 0;\n for (var i = 0; i < num.length; i++) this.words[i] = this.words[i] | num.words[i];\n return this.strip();\n }),\n (BN.prototype.ior = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuor(num);\n }),\n (BN.prototype.or = function (num) {\n return this.length > num.length ? this.clone().ior(num) : num.clone().ior(this);\n }),\n (BN.prototype.uor = function (num) {\n return this.length > num.length ? this.clone().iuor(num) : num.clone().iuor(this);\n }),\n (BN.prototype.iuand = function (num) {\n var b;\n this.length > num.length ? (b = num) : (b = this);\n for (var i = 0; i < b.length; i++) this.words[i] = this.words[i] & num.words[i];\n return (this.length = b.length), this.strip();\n }),\n (BN.prototype.iand = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuand(num);\n }),\n (BN.prototype.and = function (num) {\n return this.length > num.length ? this.clone().iand(num) : num.clone().iand(this);\n }),\n (BN.prototype.uand = function (num) {\n return this.length > num.length ? this.clone().iuand(num) : num.clone().iuand(this);\n }),\n (BN.prototype.iuxor = function (num) {\n var a, b;\n this.length > num.length ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var i = 0; i < b.length; i++) this.words[i] = a.words[i] ^ b.words[i];\n if (this !== a) for (; i < a.length; i++) this.words[i] = a.words[i];\n return (this.length = a.length), this.strip();\n }),\n (BN.prototype.ixor = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuxor(num);\n }),\n (BN.prototype.xor = function (num) {\n return this.length > num.length ? this.clone().ixor(num) : num.clone().ixor(this);\n }),\n (BN.prototype.uxor = function (num) {\n return this.length > num.length ? this.clone().iuxor(num) : num.clone().iuxor(this);\n }),\n (BN.prototype.inotn = function (width) {\n assert(typeof width == \"number\" && width >= 0);\n var bytesNeeded = Math.ceil(width / 26) | 0,\n bitsLeft = width % 26;\n this._expand(bytesNeeded), bitsLeft > 0 && bytesNeeded--;\n for (var i = 0; i < bytesNeeded; i++) this.words[i] = ~this.words[i] & 67108863;\n return bitsLeft > 0 && (this.words[i] = ~this.words[i] & (67108863 >> (26 - bitsLeft))), this.strip();\n }),\n (BN.prototype.notn = function (width) {\n return this.clone().inotn(width);\n }),\n (BN.prototype.setn = function (bit, val) {\n assert(typeof bit == \"number\" && bit >= 0);\n var off = (bit / 26) | 0,\n wbit = bit % 26;\n return (\n this._expand(off + 1),\n val\n ? (this.words[off] = this.words[off] | (1 << wbit))\n : (this.words[off] = this.words[off] & ~(1 << wbit)),\n this.strip()\n );\n }),\n (BN.prototype.iadd = function (num) {\n var r;\n if (this.negative !== 0 && num.negative === 0)\n return (this.negative = 0), (r = this.isub(num)), (this.negative ^= 1), this._normSign();\n if (this.negative === 0 && num.negative !== 0)\n return (num.negative = 0), (r = this.isub(num)), (num.negative = 1), r._normSign();\n var a, b;\n this.length > num.length ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var carry = 0, i = 0; i < b.length; i++)\n (r = (a.words[i] | 0) + (b.words[i] | 0) + carry), (this.words[i] = r & 67108863), (carry = r >>> 26);\n for (; carry !== 0 && i < a.length; i++)\n (r = (a.words[i] | 0) + carry), (this.words[i] = r & 67108863), (carry = r >>> 26);\n if (((this.length = a.length), carry !== 0)) (this.words[this.length] = carry), this.length++;\n else if (a !== this) for (; i < a.length; i++) this.words[i] = a.words[i];\n return this;\n }),\n (BN.prototype.add = function (num) {\n var res;\n return num.negative !== 0 && this.negative === 0\n ? ((num.negative = 0), (res = this.sub(num)), (num.negative ^= 1), res)\n : num.negative === 0 && this.negative !== 0\n ? ((this.negative = 0), (res = num.sub(this)), (this.negative = 1), res)\n : this.length > num.length\n ? this.clone().iadd(num)\n : num.clone().iadd(this);\n }),\n (BN.prototype.isub = function (num) {\n if (num.negative !== 0) {\n num.negative = 0;\n var r = this.iadd(num);\n return (num.negative = 1), r._normSign();\n } else if (this.negative !== 0)\n return (this.negative = 0), this.iadd(num), (this.negative = 1), this._normSign();\n var cmp = this.cmp(num);\n if (cmp === 0) return (this.negative = 0), (this.length = 1), (this.words[0] = 0), this;\n var a, b;\n cmp > 0 ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var carry = 0, i = 0; i < b.length; i++)\n (r = (a.words[i] | 0) - (b.words[i] | 0) + carry), (carry = r >> 26), (this.words[i] = r & 67108863);\n for (; carry !== 0 && i < a.length; i++)\n (r = (a.words[i] | 0) + carry), (carry = r >> 26), (this.words[i] = r & 67108863);\n if (carry === 0 && i < a.length && a !== this) for (; i < a.length; i++) this.words[i] = a.words[i];\n return (this.length = Math.max(this.length, i)), a !== this && (this.negative = 1), this.strip();\n }),\n (BN.prototype.sub = function (num) {\n return this.clone().isub(num);\n });\n function smallMulTo(self2, num, out) {\n out.negative = num.negative ^ self2.negative;\n var len = (self2.length + num.length) | 0;\n (out.length = len), (len = (len - 1) | 0);\n var a = self2.words[0] | 0,\n b = num.words[0] | 0,\n r = a * b,\n lo = r & 67108863,\n carry = (r / 67108864) | 0;\n out.words[0] = lo;\n for (var k = 1; k < len; k++) {\n for (\n var ncarry = carry >>> 26,\n rword = carry & 67108863,\n maxJ = Math.min(k, num.length - 1),\n j = Math.max(0, k - self2.length + 1);\n j <= maxJ;\n j++\n ) {\n var i = (k - j) | 0;\n (a = self2.words[i] | 0),\n (b = num.words[j] | 0),\n (r = a * b + rword),\n (ncarry += (r / 67108864) | 0),\n (rword = r & 67108863);\n }\n (out.words[k] = rword | 0), (carry = ncarry | 0);\n }\n return carry !== 0 ? (out.words[k] = carry | 0) : out.length--, out.strip();\n }\n var comb10MulTo = function (self2, num, out) {\n var a = self2.words,\n b = num.words,\n o = out.words,\n c = 0,\n lo,\n mid,\n hi,\n a0 = a[0] | 0,\n al0 = a0 & 8191,\n ah0 = a0 >>> 13,\n a1 = a[1] | 0,\n al1 = a1 & 8191,\n ah1 = a1 >>> 13,\n a2 = a[2] | 0,\n al2 = a2 & 8191,\n ah2 = a2 >>> 13,\n a3 = a[3] | 0,\n al3 = a3 & 8191,\n ah3 = a3 >>> 13,\n a4 = a[4] | 0,\n al4 = a4 & 8191,\n ah4 = a4 >>> 13,\n a5 = a[5] | 0,\n al5 = a5 & 8191,\n ah5 = a5 >>> 13,\n a6 = a[6] | 0,\n al6 = a6 & 8191,\n ah6 = a6 >>> 13,\n a7 = a[7] | 0,\n al7 = a7 & 8191,\n ah7 = a7 >>> 13,\n a8 = a[8] | 0,\n al8 = a8 & 8191,\n ah8 = a8 >>> 13,\n a9 = a[9] | 0,\n al9 = a9 & 8191,\n ah9 = a9 >>> 13,\n b0 = b[0] | 0,\n bl0 = b0 & 8191,\n bh0 = b0 >>> 13,\n b1 = b[1] | 0,\n bl1 = b1 & 8191,\n bh1 = b1 >>> 13,\n b2 = b[2] | 0,\n bl2 = b2 & 8191,\n bh2 = b2 >>> 13,\n b3 = b[3] | 0,\n bl3 = b3 & 8191,\n bh3 = b3 >>> 13,\n b4 = b[4] | 0,\n bl4 = b4 & 8191,\n bh4 = b4 >>> 13,\n b5 = b[5] | 0,\n bl5 = b5 & 8191,\n bh5 = b5 >>> 13,\n b6 = b[6] | 0,\n bl6 = b6 & 8191,\n bh6 = b6 >>> 13,\n b7 = b[7] | 0,\n bl7 = b7 & 8191,\n bh7 = b7 >>> 13,\n b8 = b[8] | 0,\n bl8 = b8 & 8191,\n bh8 = b8 >>> 13,\n b9 = b[9] | 0,\n bl9 = b9 & 8191,\n bh9 = b9 >>> 13;\n (out.negative = self2.negative ^ num.negative),\n (out.length = 19),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w0 >>> 26)) | 0),\n (w0 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w1 >>> 26)) | 0),\n (w1 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w2 >>> 26)) | 0),\n (w2 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w3 >>> 26)) | 0),\n (w3 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w4 >>> 26)) | 0),\n (w4 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w5 >>> 26)) | 0),\n (w5 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w6 >>> 26)) | 0),\n (w6 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w7 >>> 26)) | 0),\n (w7 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w8 >>> 26)) | 0),\n (w8 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w9 >>> 26)) | 0),\n (w9 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w10 >>> 26)) | 0),\n (w10 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w11 >>> 26)) | 0),\n (w11 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w12 >>> 26)) | 0),\n (w12 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w13 >>> 26)) | 0),\n (w13 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w14 >>> 26)) | 0),\n (w14 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w15 >>> 26)) | 0),\n (w15 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w16 >>> 26)) | 0),\n (w16 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w17 >>> 26)) | 0),\n (w17 &= 67108863),\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 & 8191) << 13)) | 0;\n return (\n (c = (((hi + (mid >>> 13)) | 0) + (w18 >>> 26)) | 0),\n (w18 &= 67108863),\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 c !== 0 && ((o[19] = c), out.length++),\n out\n );\n };\n Math.imul || (comb10MulTo = smallMulTo);\n function bigMulTo(self2, num, out) {\n (out.negative = num.negative ^ self2.negative), (out.length = self2.length + num.length);\n for (var carry = 0, hncarry = 0, k = 0; k < out.length - 1; k++) {\n var ncarry = hncarry;\n hncarry = 0;\n for (\n var rword = carry & 67108863, maxJ = Math.min(k, num.length - 1), j = Math.max(0, k - self2.length + 1);\n j <= maxJ;\n j++\n ) {\n var i = k - j,\n a = self2.words[i] | 0,\n b = num.words[j] | 0,\n r = a * b,\n lo = r & 67108863;\n (ncarry = (ncarry + ((r / 67108864) | 0)) | 0),\n (lo = (lo + rword) | 0),\n (rword = lo & 67108863),\n (ncarry = (ncarry + (lo >>> 26)) | 0),\n (hncarry += ncarry >>> 26),\n (ncarry &= 67108863);\n }\n (out.words[k] = rword), (carry = ncarry), (ncarry = hncarry);\n }\n return carry !== 0 ? (out.words[k] = carry) : out.length--, out.strip();\n }\n function jumboMulTo(self2, num, out) {\n var fftm = new FFTM();\n return fftm.mulp(self2, num, out);\n }\n BN.prototype.mulTo = function (num, out) {\n var res,\n len = this.length + num.length;\n return (\n this.length === 10 && num.length === 10\n ? (res = comb10MulTo(this, num, out))\n : len < 63\n ? (res = smallMulTo(this, num, out))\n : len < 1024\n ? (res = bigMulTo(this, num, out))\n : (res = jumboMulTo(this, num, out)),\n res\n );\n };\n function FFTM(x, y) {\n (this.x = x), (this.y = y);\n }\n (FFTM.prototype.makeRBT = function (N) {\n for (var t = new Array(N), l = BN.prototype._countBits(N) - 1, i = 0; i < N; i++) t[i] = this.revBin(i, l, N);\n return t;\n }),\n (FFTM.prototype.revBin = function (x, l, N) {\n if (x === 0 || x === N - 1) return x;\n for (var rb = 0, i = 0; i < l; i++) (rb |= (x & 1) << (l - i - 1)), (x >>= 1);\n return rb;\n }),\n (FFTM.prototype.permute = function (rbt, rws, iws, rtws, itws, N) {\n for (var i = 0; i < N; i++) (rtws[i] = rws[rbt[i]]), (itws[i] = iws[rbt[i]]);\n }),\n (FFTM.prototype.transform = function (rws, iws, rtws, itws, N, rbt) {\n this.permute(rbt, rws, iws, rtws, itws, N);\n for (var s = 1; s < N; s <<= 1)\n for (\n var l = s << 1, rtwdf = Math.cos((2 * Math.PI) / l), itwdf = Math.sin((2 * Math.PI) / l), p = 0;\n p < N;\n p += l\n )\n for (var rtwdf_ = rtwdf, itwdf_ = itwdf, j = 0; j < s; j++) {\n var re = rtws[p + j],\n ie = itws[p + j],\n ro = rtws[p + j + s],\n io = itws[p + j + s],\n rx = rtwdf_ * ro - itwdf_ * io;\n (io = rtwdf_ * io + itwdf_ * ro),\n (ro = rx),\n (rtws[p + j] = re + ro),\n (itws[p + j] = ie + io),\n (rtws[p + j + s] = re - ro),\n (itws[p + j + s] = ie - io),\n j !== l &&\n ((rx = rtwdf * rtwdf_ - itwdf * itwdf_), (itwdf_ = rtwdf * itwdf_ + itwdf * rtwdf_), (rtwdf_ = rx));\n }\n }),\n (FFTM.prototype.guessLen13b = function (n, m) {\n var N = Math.max(m, n) | 1,\n odd = N & 1,\n i = 0;\n for (N = (N / 2) | 0; N; N = N >>> 1) i++;\n return 1 << (i + 1 + odd);\n }),\n (FFTM.prototype.conjugate = function (rws, iws, N) {\n if (!(N <= 1))\n for (var i = 0; i < N / 2; i++) {\n var t = rws[i];\n (rws[i] = rws[N - i - 1]),\n (rws[N - i - 1] = t),\n (t = iws[i]),\n (iws[i] = -iws[N - i - 1]),\n (iws[N - i - 1] = -t);\n }\n }),\n (FFTM.prototype.normalize13b = function (ws, N) {\n for (var carry = 0, i = 0; i < N / 2; i++) {\n var w = Math.round(ws[2 * i + 1] / N) * 8192 + Math.round(ws[2 * i] / N) + carry;\n (ws[i] = w & 67108863), w < 67108864 ? (carry = 0) : (carry = (w / 67108864) | 0);\n }\n return ws;\n }),\n (FFTM.prototype.convert13b = function (ws, len, rws, N) {\n for (var carry = 0, i = 0; i < len; i++)\n (carry = carry + (ws[i] | 0)),\n (rws[2 * i] = carry & 8191),\n (carry = carry >>> 13),\n (rws[2 * i + 1] = carry & 8191),\n (carry = carry >>> 13);\n for (i = 2 * len; i < N; ++i) rws[i] = 0;\n assert(carry === 0), assert((carry & -8192) === 0);\n }),\n (FFTM.prototype.stub = function (N) {\n for (var ph = new Array(N), i = 0; i < N; i++) ph[i] = 0;\n return ph;\n }),\n (FFTM.prototype.mulp = function (x, y, out) {\n var N = 2 * this.guessLen13b(x.length, y.length),\n rbt = this.makeRBT(N),\n _ = this.stub(N),\n rws = new Array(N),\n rwst = new Array(N),\n iwst = new Array(N),\n nrws = new Array(N),\n nrwst = new Array(N),\n niwst = new Array(N),\n rmws = out.words;\n (rmws.length = N),\n this.convert13b(x.words, x.length, rws, N),\n this.convert13b(y.words, y.length, nrws, N),\n this.transform(rws, _, rwst, iwst, N, rbt),\n this.transform(nrws, _, nrwst, niwst, N, rbt);\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]), (rwst[i] = rx);\n }\n return (\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 (out.negative = x.negative ^ y.negative),\n (out.length = x.length + y.length),\n out.strip()\n );\n }),\n (BN.prototype.mul = function (num) {\n var out = new BN(null);\n return (out.words = new Array(this.length + num.length)), this.mulTo(num, out);\n }),\n (BN.prototype.mulf = function (num) {\n var out = new BN(null);\n return (out.words = new Array(this.length + num.length)), jumboMulTo(this, num, out);\n }),\n (BN.prototype.imul = function (num) {\n return this.clone().mulTo(num, this);\n }),\n (BN.prototype.imuln = function (num) {\n assert(typeof num == \"number\"), assert(num < 67108864);\n for (var carry = 0, i = 0; i < this.length; i++) {\n var w = (this.words[i] | 0) * num,\n lo = (w & 67108863) + (carry & 67108863);\n (carry >>= 26), (carry += (w / 67108864) | 0), (carry += lo >>> 26), (this.words[i] = lo & 67108863);\n }\n return carry !== 0 && ((this.words[i] = carry), this.length++), this;\n }),\n (BN.prototype.muln = function (num) {\n return this.clone().imuln(num);\n }),\n (BN.prototype.sqr = function () {\n return this.mul(this);\n }),\n (BN.prototype.isqr = function () {\n return this.imul(this.clone());\n }),\n (BN.prototype.pow = function (num) {\n var w = toBitArray(num);\n if (w.length === 0) return new BN(1);\n for (var res = this, i = 0; i < w.length && w[i] === 0; i++, res = res.sqr());\n if (++i < w.length) for (var q = res.sqr(); i < w.length; i++, q = q.sqr()) w[i] !== 0 && (res = res.mul(q));\n return res;\n }),\n (BN.prototype.iushln = function (bits) {\n assert(typeof bits == \"number\" && bits >= 0);\n var r = bits % 26,\n s = (bits - r) / 26,\n carryMask = (67108863 >>> (26 - r)) << (26 - r),\n i;\n if (r !== 0) {\n var carry = 0;\n for (i = 0; i < this.length; i++) {\n var newCarry = this.words[i] & carryMask,\n c = ((this.words[i] | 0) - newCarry) << r;\n (this.words[i] = c | carry), (carry = newCarry >>> (26 - r));\n }\n carry && ((this.words[i] = carry), this.length++);\n }\n if (s !== 0) {\n for (i = this.length - 1; i >= 0; i--) this.words[i + s] = this.words[i];\n for (i = 0; i < s; i++) this.words[i] = 0;\n this.length += s;\n }\n return this.strip();\n }),\n (BN.prototype.ishln = function (bits) {\n return assert(this.negative === 0), this.iushln(bits);\n }),\n (BN.prototype.iushrn = function (bits, hint, extended) {\n assert(typeof bits == \"number\" && bits >= 0);\n var h;\n hint ? (h = (hint - (hint % 26)) / 26) : (h = 0);\n var r = bits % 26,\n s = Math.min((bits - r) / 26, this.length),\n mask = 67108863 ^ ((67108863 >>> r) << r),\n maskedWords = extended;\n if (((h -= s), (h = Math.max(0, h)), maskedWords)) {\n for (var i = 0; i < s; i++) maskedWords.words[i] = this.words[i];\n maskedWords.length = s;\n }\n if (s !== 0)\n if (this.length > s) for (this.length -= s, i = 0; i < this.length; i++) this.words[i] = this.words[i + s];\n else (this.words[0] = 0), (this.length = 1);\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)), (carry = word & mask);\n }\n return (\n maskedWords && carry !== 0 && (maskedWords.words[maskedWords.length++] = carry),\n this.length === 0 && ((this.words[0] = 0), (this.length = 1)),\n this.strip()\n );\n }),\n (BN.prototype.ishrn = function (bits, hint, extended) {\n return assert(this.negative === 0), this.iushrn(bits, hint, extended);\n }),\n (BN.prototype.shln = function (bits) {\n return this.clone().ishln(bits);\n }),\n (BN.prototype.ushln = function (bits) {\n return this.clone().iushln(bits);\n }),\n (BN.prototype.shrn = function (bits) {\n return this.clone().ishrn(bits);\n }),\n (BN.prototype.ushrn = function (bits) {\n return this.clone().iushrn(bits);\n }),\n (BN.prototype.testn = function (bit) {\n assert(typeof bit == \"number\" && bit >= 0);\n var r = bit % 26,\n s = (bit - r) / 26,\n q = 1 << r;\n if (this.length <= s) return !1;\n var w = this.words[s];\n return !!(w & q);\n }),\n (BN.prototype.imaskn = function (bits) {\n assert(typeof bits == \"number\" && bits >= 0);\n var r = bits % 26,\n s = (bits - r) / 26;\n if ((assert(this.negative === 0, \"imaskn works only with positive numbers\"), this.length <= s)) return this;\n if ((r !== 0 && s++, (this.length = Math.min(s, this.length)), r !== 0)) {\n var mask = 67108863 ^ ((67108863 >>> r) << r);\n this.words[this.length - 1] &= mask;\n }\n return this.strip();\n }),\n (BN.prototype.maskn = function (bits) {\n return this.clone().imaskn(bits);\n }),\n (BN.prototype.iaddn = function (num) {\n return (\n assert(typeof num == \"number\"),\n assert(num < 67108864),\n num < 0\n ? this.isubn(-num)\n : this.negative !== 0\n ? this.length === 1 && (this.words[0] | 0) < num\n ? ((this.words[0] = num - (this.words[0] | 0)), (this.negative = 0), this)\n : ((this.negative = 0), this.isubn(num), (this.negative = 1), this)\n : this._iaddn(num)\n );\n }),\n (BN.prototype._iaddn = function (num) {\n this.words[0] += num;\n for (var i = 0; i < this.length && this.words[i] >= 67108864; i++)\n (this.words[i] -= 67108864), i === this.length - 1 ? (this.words[i + 1] = 1) : this.words[i + 1]++;\n return (this.length = Math.max(this.length, i + 1)), this;\n }),\n (BN.prototype.isubn = function (num) {\n if ((assert(typeof num == \"number\"), assert(num < 67108864), num < 0)) return this.iaddn(-num);\n if (this.negative !== 0) return (this.negative = 0), this.iaddn(num), (this.negative = 1), this;\n if (((this.words[0] -= num), this.length === 1 && this.words[0] < 0))\n (this.words[0] = -this.words[0]), (this.negative = 1);\n else\n for (var i = 0; i < this.length && this.words[i] < 0; i++)\n (this.words[i] += 67108864), (this.words[i + 1] -= 1);\n return this.strip();\n }),\n (BN.prototype.addn = function (num) {\n return this.clone().iaddn(num);\n }),\n (BN.prototype.subn = function (num) {\n return this.clone().isubn(num);\n }),\n (BN.prototype.iabs = function () {\n return (this.negative = 0), this;\n }),\n (BN.prototype.abs = function () {\n return this.clone().iabs();\n }),\n (BN.prototype._ishlnsubmul = function (num, mul, shift) {\n var len = num.length + shift,\n i;\n this._expand(len);\n var w,\n 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 & 67108863),\n (carry = (w >> 26) - ((right / 67108864) | 0)),\n (this.words[i + shift] = w & 67108863);\n }\n for (; i < this.length - shift; i++)\n (w = (this.words[i + shift] | 0) + carry), (carry = w >> 26), (this.words[i + shift] = w & 67108863);\n if (carry === 0) return this.strip();\n for (assert(carry === -1), carry = 0, i = 0; i < this.length; i++)\n (w = -(this.words[i] | 0) + carry), (carry = w >> 26), (this.words[i] = w & 67108863);\n return (this.negative = 1), this.strip();\n }),\n (BN.prototype._wordDiv = function (num, mode) {\n var shift = this.length - num.length,\n a = this.clone(),\n b = num,\n bhi = b.words[b.length - 1] | 0,\n bhiBits = this._countBits(bhi);\n (shift = 26 - bhiBits),\n shift !== 0 && ((b = b.ushln(shift)), a.iushln(shift), (bhi = b.words[b.length - 1] | 0));\n var m = a.length - b.length,\n q;\n if (mode !== \"mod\") {\n (q = new BN(null)), (q.length = m + 1), (q.words = new Array(q.length));\n for (var i = 0; i < q.length; i++) q.words[i] = 0;\n }\n var diff = a.clone()._ishlnsubmul(b, 1, m);\n diff.negative === 0 && ((a = diff), q && (q.words[m] = 1));\n for (var j = m - 1; j >= 0; j--) {\n var qj = (a.words[b.length + j] | 0) * 67108864 + (a.words[b.length + j - 1] | 0);\n for (qj = Math.min((qj / bhi) | 0, 67108863), a._ishlnsubmul(b, qj, j); a.negative !== 0; )\n qj--, (a.negative = 0), a._ishlnsubmul(b, 1, j), a.isZero() || (a.negative ^= 1);\n q && (q.words[j] = qj);\n }\n return (\n q && q.strip(),\n a.strip(),\n mode !== \"div\" && shift !== 0 && a.iushrn(shift),\n {\n div: q || null,\n mod: a,\n }\n );\n }),\n (BN.prototype.divmod = function (num, mode, positive) {\n if ((assert(!num.isZero()), this.isZero()))\n return {\n div: new BN(0),\n mod: new BN(0),\n };\n var div, mod, res;\n return this.negative !== 0 && num.negative === 0\n ? ((res = this.neg().divmod(num, mode)),\n mode !== \"mod\" && (div = res.div.neg()),\n mode !== \"div\" && ((mod = res.mod.neg()), positive && mod.negative !== 0 && mod.iadd(num)),\n {\n div,\n mod,\n })\n : this.negative === 0 && num.negative !== 0\n ? ((res = this.divmod(num.neg(), mode)),\n mode !== \"mod\" && (div = res.div.neg()),\n {\n div,\n mod: res.mod,\n })\n : (this.negative & num.negative) !== 0\n ? ((res = this.neg().divmod(num.neg(), mode)),\n mode !== \"div\" && ((mod = res.mod.neg()), positive && mod.negative !== 0 && mod.isub(num)),\n {\n div: res.div,\n mod,\n })\n : num.length > this.length || this.cmp(num) < 0\n ? {\n div: new BN(0),\n mod: this,\n }\n : num.length === 1\n ? mode === \"div\"\n ? {\n div: this.divn(num.words[0]),\n mod: null,\n }\n : mode === \"mod\"\n ? {\n div: null,\n mod: new BN(this.modn(num.words[0])),\n }\n : {\n div: this.divn(num.words[0]),\n mod: new BN(this.modn(num.words[0])),\n }\n : this._wordDiv(num, mode);\n }),\n (BN.prototype.div = function (num) {\n return this.divmod(num, \"div\", !1).div;\n }),\n (BN.prototype.mod = function (num) {\n return this.divmod(num, \"mod\", !1).mod;\n }),\n (BN.prototype.umod = function (num) {\n return this.divmod(num, \"mod\", !0).mod;\n }),\n (BN.prototype.divRound = function (num) {\n var dm = this.divmod(num);\n if (dm.mod.isZero()) return dm.div;\n var mod = dm.div.negative !== 0 ? dm.mod.isub(num) : dm.mod,\n half = num.ushrn(1),\n r2 = num.andln(1),\n cmp = mod.cmp(half);\n return cmp < 0 || (r2 === 1 && cmp === 0)\n ? dm.div\n : dm.div.negative !== 0\n ? dm.div.isubn(1)\n : dm.div.iaddn(1);\n }),\n (BN.prototype.modn = function (num) {\n assert(num <= 67108863);\n for (var p = (1 << 26) % num, acc = 0, i = this.length - 1; i >= 0; i--)\n acc = (p * acc + (this.words[i] | 0)) % num;\n return acc;\n }),\n (BN.prototype.idivn = function (num) {\n assert(num <= 67108863);\n for (var carry = 0, i = this.length - 1; i >= 0; i--) {\n var w = (this.words[i] | 0) + carry * 67108864;\n (this.words[i] = (w / num) | 0), (carry = w % num);\n }\n return this.strip();\n }),\n (BN.prototype.divn = function (num) {\n return this.clone().idivn(num);\n }),\n (BN.prototype.egcd = function (p) {\n assert(p.negative === 0), assert(!p.isZero());\n var x = this,\n y = p.clone();\n x.negative !== 0 ? (x = x.umod(p)) : (x = x.clone());\n for (var A = new BN(1), B = new BN(0), C = new BN(0), D = new BN(1), g = 0; x.isEven() && y.isEven(); )\n x.iushrn(1), y.iushrn(1), ++g;\n for (var yp = y.clone(), xp = x.clone(); !x.isZero(); ) {\n for (var i = 0, im = 1; (x.words[0] & im) === 0 && i < 26; ++i, im <<= 1);\n if (i > 0)\n for (x.iushrn(i); i-- > 0; )\n (A.isOdd() || B.isOdd()) && (A.iadd(yp), B.isub(xp)), A.iushrn(1), B.iushrn(1);\n for (var j = 0, jm = 1; (y.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n if (j > 0)\n for (y.iushrn(j); j-- > 0; )\n (C.isOdd() || D.isOdd()) && (C.iadd(yp), D.isub(xp)), C.iushrn(1), D.iushrn(1);\n x.cmp(y) >= 0 ? (x.isub(y), A.isub(C), B.isub(D)) : (y.isub(x), C.isub(A), D.isub(B));\n }\n return {\n a: C,\n b: D,\n gcd: y.iushln(g),\n };\n }),\n (BN.prototype._invmp = function (p) {\n assert(p.negative === 0), assert(!p.isZero());\n var a = this,\n b = p.clone();\n a.negative !== 0 ? (a = a.umod(p)) : (a = a.clone());\n for (var x1 = new BN(1), x2 = new BN(0), delta = b.clone(); 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) for (a.iushrn(i); i-- > 0; ) x1.isOdd() && x1.iadd(delta), x1.iushrn(1);\n for (var j = 0, jm = 1; (b.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n if (j > 0) for (b.iushrn(j); j-- > 0; ) x2.isOdd() && x2.iadd(delta), x2.iushrn(1);\n a.cmp(b) >= 0 ? (a.isub(b), x1.isub(x2)) : (b.isub(a), x2.isub(x1));\n }\n var res;\n return a.cmpn(1) === 0 ? (res = x1) : (res = x2), res.cmpn(0) < 0 && res.iadd(p), res;\n }),\n (BN.prototype.gcd = function (num) {\n if (this.isZero()) return num.abs();\n if (num.isZero()) return this.abs();\n var a = this.clone(),\n b = num.clone();\n (a.negative = 0), (b.negative = 0);\n for (var shift = 0; a.isEven() && b.isEven(); shift++) a.iushrn(1), b.iushrn(1);\n do {\n for (; a.isEven(); ) a.iushrn(1);\n for (; b.isEven(); ) b.iushrn(1);\n var r = a.cmp(b);\n if (r < 0) {\n var t = a;\n (a = b), (b = t);\n } else if (r === 0 || b.cmpn(1) === 0) break;\n a.isub(b);\n } while (!0);\n return b.iushln(shift);\n }),\n (BN.prototype.invm = function (num) {\n return this.egcd(num).a.umod(num);\n }),\n (BN.prototype.isEven = function () {\n return (this.words[0] & 1) === 0;\n }),\n (BN.prototype.isOdd = function () {\n return (this.words[0] & 1) === 1;\n }),\n (BN.prototype.andln = function (num) {\n return this.words[0] & num;\n }),\n (BN.prototype.bincn = function (bit) {\n assert(typeof bit == \"number\");\n var r = bit % 26,\n s = (bit - r) / 26,\n q = 1 << r;\n if (this.length <= s) return this._expand(s + 1), (this.words[s] |= q), this;\n for (var carry = q, i = s; carry !== 0 && i < this.length; i++) {\n var w = this.words[i] | 0;\n (w += carry), (carry = w >>> 26), (w &= 67108863), (this.words[i] = w);\n }\n return carry !== 0 && ((this.words[i] = carry), this.length++), this;\n }),\n (BN.prototype.isZero = function () {\n return this.length === 1 && this.words[0] === 0;\n }),\n (BN.prototype.cmpn = function (num) {\n var negative = num < 0;\n if (this.negative !== 0 && !negative) return -1;\n if (this.negative === 0 && negative) return 1;\n this.strip();\n var res;\n if (this.length > 1) res = 1;\n else {\n negative && (num = -num), assert(num <= 67108863, \"Number is too big\");\n var w = this.words[0] | 0;\n res = w === num ? 0 : w < num ? -1 : 1;\n }\n return this.negative !== 0 ? -res | 0 : res;\n }),\n (BN.prototype.cmp = function (num) {\n if (this.negative !== 0 && num.negative === 0) return -1;\n if (this.negative === 0 && num.negative !== 0) return 1;\n var res = this.ucmp(num);\n return this.negative !== 0 ? -res | 0 : res;\n }),\n (BN.prototype.ucmp = function (num) {\n if (this.length > num.length) return 1;\n if (this.length < num.length) return -1;\n for (var res = 0, i = this.length - 1; i >= 0; i--) {\n var a = this.words[i] | 0,\n b = num.words[i] | 0;\n if (a !== b) {\n a < b ? (res = -1) : a > b && (res = 1);\n break;\n }\n }\n return res;\n }),\n (BN.prototype.gtn = function (num) {\n return this.cmpn(num) === 1;\n }),\n (BN.prototype.gt = function (num) {\n return this.cmp(num) === 1;\n }),\n (BN.prototype.gten = function (num) {\n return this.cmpn(num) >= 0;\n }),\n (BN.prototype.gte = function (num) {\n return this.cmp(num) >= 0;\n }),\n (BN.prototype.ltn = function (num) {\n return this.cmpn(num) === -1;\n }),\n (BN.prototype.lt = function (num) {\n return this.cmp(num) === -1;\n }),\n (BN.prototype.lten = function (num) {\n return this.cmpn(num) <= 0;\n }),\n (BN.prototype.lte = function (num) {\n return this.cmp(num) <= 0;\n }),\n (BN.prototype.eqn = function (num) {\n return this.cmpn(num) === 0;\n }),\n (BN.prototype.eq = function (num) {\n return this.cmp(num) === 0;\n }),\n (BN.red = function (num) {\n return new Red(num);\n }),\n (BN.prototype.toRed = function (ctx) {\n return (\n assert(!this.red, \"Already a number in reduction context\"),\n assert(this.negative === 0, \"red works only with positives\"),\n ctx.convertTo(this)._forceRed(ctx)\n );\n }),\n (BN.prototype.fromRed = function () {\n return assert(this.red, \"fromRed works only with numbers in reduction context\"), this.red.convertFrom(this);\n }),\n (BN.prototype._forceRed = function (ctx) {\n return (this.red = ctx), this;\n }),\n (BN.prototype.forceRed = function (ctx) {\n return assert(!this.red, \"Already a number in reduction context\"), this._forceRed(ctx);\n }),\n (BN.prototype.redAdd = function (num) {\n return assert(this.red, \"redAdd works only with red numbers\"), this.red.add(this, num);\n }),\n (BN.prototype.redIAdd = function (num) {\n return assert(this.red, \"redIAdd works only with red numbers\"), this.red.iadd(this, num);\n }),\n (BN.prototype.redSub = function (num) {\n return assert(this.red, \"redSub works only with red numbers\"), this.red.sub(this, num);\n }),\n (BN.prototype.redISub = function (num) {\n return assert(this.red, \"redISub works only with red numbers\"), this.red.isub(this, num);\n }),\n (BN.prototype.redShl = function (num) {\n return assert(this.red, \"redShl works only with red numbers\"), this.red.shl(this, num);\n }),\n (BN.prototype.redMul = function (num) {\n return (\n assert(this.red, \"redMul works only with red numbers\"),\n this.red._verify2(this, num),\n this.red.mul(this, num)\n );\n }),\n (BN.prototype.redIMul = function (num) {\n return (\n assert(this.red, \"redMul works only with red numbers\"),\n this.red._verify2(this, num),\n this.red.imul(this, num)\n );\n }),\n (BN.prototype.redSqr = function () {\n return assert(this.red, \"redSqr works only with red numbers\"), this.red._verify1(this), this.red.sqr(this);\n }),\n (BN.prototype.redISqr = function () {\n return assert(this.red, \"redISqr works only with red numbers\"), this.red._verify1(this), this.red.isqr(this);\n }),\n (BN.prototype.redSqrt = function () {\n return assert(this.red, \"redSqrt works only with red numbers\"), this.red._verify1(this), this.red.sqrt(this);\n }),\n (BN.prototype.redInvm = function () {\n return assert(this.red, \"redInvm works only with red numbers\"), this.red._verify1(this), this.red.invm(this);\n }),\n (BN.prototype.redNeg = function () {\n return assert(this.red, \"redNeg works only with red numbers\"), this.red._verify1(this), this.red.neg(this);\n }),\n (BN.prototype.redPow = function (num) {\n return assert(this.red && !num.red, \"redPow(normalNum)\"), this.red._verify1(this), this.red.pow(this, num);\n });\n var primes = {\n k256: null,\n p224: null,\n p192: null,\n p25519: null,\n };\n function MPrime(name, p) {\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 (this.tmp = this._tmp());\n }\n (MPrime.prototype._tmp = function () {\n var tmp = new BN(null);\n return (tmp.words = new Array(Math.ceil(this.n / 13))), tmp;\n }),\n (MPrime.prototype.ireduce = function (num) {\n var r = num,\n rlen;\n do this.split(r, this.tmp), (r = this.imulK(r)), (r = r.iadd(this.tmp)), (rlen = r.bitLength());\n while (rlen > this.n);\n var cmp = rlen < this.n ? -1 : r.ucmp(this.p);\n return (\n cmp === 0\n ? ((r.words[0] = 0), (r.length = 1))\n : cmp > 0\n ? r.isub(this.p)\n : r.strip !== void 0\n ? r.strip()\n : r._strip(),\n r\n );\n }),\n (MPrime.prototype.split = function (input, out) {\n input.iushrn(this.n, 0, out);\n }),\n (MPrime.prototype.imulK = function (num) {\n return num.imul(this.k);\n });\n function K256() {\n MPrime.call(this, \"k256\", \"ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f\");\n }\n inherits(K256, MPrime),\n (K256.prototype.split = function (input, output) {\n for (var mask = 4194303, outLen = Math.min(input.length, 9), i = 0; i < outLen; i++)\n output.words[i] = input.words[i];\n if (((output.length = outLen), input.length <= 9)) {\n (input.words[0] = 0), (input.length = 1);\n return;\n }\n var prev = input.words[9];\n for (output.words[output.length++] = prev & mask, i = 10; i < input.length; i++) {\n var next = input.words[i] | 0;\n (input.words[i - 10] = ((next & mask) << 4) | (prev >>> 22)), (prev = next);\n }\n (prev >>>= 22),\n (input.words[i - 10] = prev),\n prev === 0 && input.length > 10 ? (input.length -= 10) : (input.length -= 9);\n }),\n (K256.prototype.imulK = function (num) {\n (num.words[num.length] = 0), (num.words[num.length + 1] = 0), (num.length += 2);\n for (var lo = 0, i = 0; i < num.length; i++) {\n var w = num.words[i] | 0;\n (lo += w * 977), (num.words[i] = lo & 67108863), (lo = w * 64 + ((lo / 67108864) | 0));\n }\n return (\n num.words[num.length - 1] === 0 && (num.length--, num.words[num.length - 1] === 0 && num.length--), num\n );\n });\n function P224() {\n MPrime.call(this, \"p224\", \"ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001\");\n }\n inherits(P224, MPrime);\n function P192() {\n MPrime.call(this, \"p192\", \"ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff\");\n }\n inherits(P192, MPrime);\n function P25519() {\n MPrime.call(this, \"25519\", \"7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed\");\n }\n inherits(P25519, MPrime),\n (P25519.prototype.imulK = function (num) {\n for (var carry = 0, i = 0; i < num.length; i++) {\n var hi = (num.words[i] | 0) * 19 + carry,\n lo = hi & 67108863;\n (hi >>>= 26), (num.words[i] = lo), (carry = hi);\n }\n return carry !== 0 && (num.words[num.length++] = carry), num;\n }),\n (BN._prime = function (name) {\n if (primes[name]) return primes[name];\n var prime2;\n if (name === \"k256\") prime2 = new K256();\n else if (name === \"p224\") prime2 = new P224();\n else if (name === \"p192\") prime2 = new P192();\n else if (name === \"p25519\") prime2 = new P25519();\n else throw new Error(\"Unknown prime \" + name);\n return (primes[name] = prime2), prime2;\n });\n function Red(m) {\n if (typeof m == \"string\") {\n var prime = BN._prime(m);\n (this.m = prime.p), (this.prime = prime);\n } else assert(m.gtn(1), \"modulus must be greater than 1\"), (this.m = m), (this.prime = null);\n }\n (Red.prototype._verify1 = function (a) {\n assert(a.negative === 0, \"red works only with positives\"), assert(a.red, \"red works only with red numbers\");\n }),\n (Red.prototype._verify2 = function (a, b) {\n assert((a.negative | b.negative) === 0, \"red works only with positives\"),\n assert(a.red && a.red === b.red, \"red works only with red numbers\");\n }),\n (Red.prototype.imod = function (a) {\n return this.prime ? this.prime.ireduce(a)._forceRed(this) : a.umod(this.m)._forceRed(this);\n }),\n (Red.prototype.neg = function (a) {\n return a.isZero() ? a.clone() : this.m.sub(a)._forceRed(this);\n }),\n (Red.prototype.add = function (a, b) {\n this._verify2(a, b);\n var res = a.add(b);\n return res.cmp(this.m) >= 0 && res.isub(this.m), res._forceRed(this);\n }),\n (Red.prototype.iadd = function (a, b) {\n this._verify2(a, b);\n var res = a.iadd(b);\n return res.cmp(this.m) >= 0 && res.isub(this.m), res;\n }),\n (Red.prototype.sub = function (a, b) {\n this._verify2(a, b);\n var res = a.sub(b);\n return res.cmpn(0) < 0 && res.iadd(this.m), res._forceRed(this);\n }),\n (Red.prototype.isub = function (a, b) {\n this._verify2(a, b);\n var res = a.isub(b);\n return res.cmpn(0) < 0 && res.iadd(this.m), res;\n }),\n (Red.prototype.shl = function (a, num) {\n return this._verify1(a), this.imod(a.ushln(num));\n }),\n (Red.prototype.imul = function (a, b) {\n return this._verify2(a, b), this.imod(a.imul(b));\n }),\n (Red.prototype.mul = function (a, b) {\n return this._verify2(a, b), this.imod(a.mul(b));\n }),\n (Red.prototype.isqr = function (a) {\n return this.imul(a, a.clone());\n }),\n (Red.prototype.sqr = function (a) {\n return this.mul(a, a);\n }),\n (Red.prototype.sqrt = function (a) {\n if (a.isZero()) return a.clone();\n var mod3 = this.m.andln(3);\n if ((assert(mod3 % 2 === 1), mod3 === 3)) {\n var pow = this.m.add(new BN(1)).iushrn(2);\n return this.pow(a, pow);\n }\n for (var q = this.m.subn(1), s = 0; !q.isZero() && q.andln(1) === 0; ) s++, q.iushrn(1);\n assert(!q.isZero());\n var one = new BN(1).toRed(this),\n nOne = one.redNeg(),\n lpow = this.m.subn(1).iushrn(1),\n z = this.m.bitLength();\n for (z = new BN(2 * z * z).toRed(this); this.pow(z, lpow).cmp(nOne) !== 0; ) z.redIAdd(nOne);\n for (\n var c = this.pow(z, q), r = this.pow(a, q.addn(1).iushrn(1)), t = this.pow(a, q), m = s;\n t.cmp(one) !== 0;\n\n ) {\n for (var tmp = t, i = 0; tmp.cmp(one) !== 0; i++) tmp = tmp.redSqr();\n assert(i < m);\n var b = this.pow(c, new BN(1).iushln(m - i - 1));\n (r = r.redMul(b)), (c = b.redSqr()), (t = t.redMul(c)), (m = i);\n }\n return r;\n }),\n (Red.prototype.invm = function (a) {\n var inv = a._invmp(this.m);\n return inv.negative !== 0 ? ((inv.negative = 0), this.imod(inv).redNeg()) : this.imod(inv);\n }),\n (Red.prototype.pow = function (a, num) {\n if (num.isZero()) return new BN(1).toRed(this);\n if (num.cmpn(1) === 0) return a.clone();\n var windowSize = 4,\n wnd = new Array(1 << windowSize);\n (wnd[0] = new BN(1).toRed(this)), (wnd[1] = a);\n for (var i = 2; i < wnd.length; i++) wnd[i] = this.mul(wnd[i - 1], a);\n var res = wnd[0],\n current = 0,\n currentLen = 0,\n start = num.bitLength() % 26;\n for (start === 0 && (start = 26), i = num.length - 1; i >= 0; i--) {\n for (var word = num.words[i], j = start - 1; j >= 0; j--) {\n var bit = (word >> j) & 1;\n if ((res !== wnd[0] && (res = this.sqr(res)), bit === 0 && current === 0)) {\n currentLen = 0;\n continue;\n }\n (current <<= 1),\n (current |= bit),\n currentLen++,\n !(currentLen !== windowSize && (i !== 0 || j !== 0)) &&\n ((res = this.mul(res, wnd[current])), (currentLen = 0), (current = 0));\n }\n start = 26;\n }\n return res;\n }),\n (Red.prototype.convertTo = function (num) {\n var r = num.umod(this.m);\n return r === num ? r.clone() : r;\n }),\n (Red.prototype.convertFrom = function (num) {\n var res = num.clone();\n return (res.red = null), res;\n }),\n (BN.mont = function (num) {\n return new Mont(num);\n });\n function Mont(m) {\n Red.call(this, m),\n (this.shift = this.m.bitLength()),\n this.shift % 26 !== 0 && (this.shift += 26 - (this.shift % 26)),\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 (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 (Mont.prototype.convertTo = function (num) {\n return this.imod(num.ushln(this.shift));\n }),\n (Mont.prototype.convertFrom = function (num) {\n var r = this.imod(num.mul(this.rinv));\n return (r.red = null), r;\n }),\n (Mont.prototype.imul = function (a, b) {\n if (a.isZero() || b.isZero()) return (a.words[0] = 0), (a.length = 1), a;\n var t = a.imul(b),\n c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m),\n u = t.isub(c).iushrn(this.shift),\n res = u;\n return (\n u.cmp(this.m) >= 0 ? (res = u.isub(this.m)) : u.cmpn(0) < 0 && (res = u.iadd(this.m)), res._forceRed(this)\n );\n }),\n (Mont.prototype.mul = function (a, b) {\n if (a.isZero() || b.isZero()) return new BN(0)._forceRed(this);\n var t = a.mul(b),\n c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m),\n u = t.isub(c).iushrn(this.shift),\n res = u;\n return (\n u.cmp(this.m) >= 0 ? (res = u.isub(this.m)) : u.cmpn(0) < 0 && (res = u.iadd(this.m)), res._forceRed(this)\n );\n }),\n (Mont.prototype.invm = function (a) {\n var res = this.imod(a._invmp(this.m).mul(this.r2));\n return res._forceRed(this);\n });\n })(typeof module > \"u\" || module, exports);\n },\n});\n\n// node_modules/miller-rabin/node_modules/bn.js/lib/bn.js\nvar require_bn2 = __commonJS({\n \"node_modules/miller-rabin/node_modules/bn.js/lib/bn.js\"(exports, module) {\n (function (module2, exports2) {\n \"use strict\";\n function assert(val, msg) {\n if (!val) throw new Error(msg || \"Assertion failed\");\n }\n function inherits(ctor, superCtor) {\n ctor.super_ = superCtor;\n var TempCtor = function () {};\n (TempCtor.prototype = superCtor.prototype),\n (ctor.prototype = new TempCtor()),\n (ctor.prototype.constructor = ctor);\n }\n function BN(number, base, endian) {\n if (BN.isBN(number)) return number;\n (this.negative = 0),\n (this.words = null),\n (this.length = 0),\n (this.red = null),\n number !== null &&\n ((base === \"le\" || base === \"be\") && ((endian = base), (base = 10)),\n this._init(number || 0, base || 10, endian || \"be\"));\n }\n typeof module2 == \"object\" ? (module2.exports = BN) : (exports2.BN = BN), (BN.BN = BN), (BN.wordSize = 26);\n var Buffer2;\n try {\n typeof window < \"u\" && typeof window.Buffer < \"u\"\n ? (Buffer2 = window.Buffer)\n : (Buffer2 = __require(\"buffer\").Buffer);\n } catch {}\n (BN.isBN = function (num) {\n return num instanceof BN\n ? !0\n : num !== null &&\n typeof num == \"object\" &&\n num.constructor.wordSize === BN.wordSize &&\n Array.isArray(num.words);\n }),\n (BN.max = function (left, right) {\n return left.cmp(right) > 0 ? left : right;\n }),\n (BN.min = function (left, right) {\n return left.cmp(right) < 0 ? left : right;\n }),\n (BN.prototype._init = function (number, base, endian) {\n if (typeof number == \"number\") return this._initNumber(number, base, endian);\n if (typeof number == \"object\") return this._initArray(number, base, endian);\n base === \"hex\" && (base = 16),\n assert(base === (base | 0) && base >= 2 && base <= 36),\n (number = number.toString().replace(/\\s+/g, \"\"));\n var start = 0;\n number[0] === \"-\" && (start++, (this.negative = 1)),\n start < number.length &&\n (base === 16\n ? this._parseHex(number, start, endian)\n : (this._parseBase(number, base, start),\n endian === \"le\" && this._initArray(this.toArray(), base, endian)));\n }),\n (BN.prototype._initNumber = function (number, base, endian) {\n number < 0 && ((this.negative = 1), (number = -number)),\n number < 67108864\n ? ((this.words = [number & 67108863]), (this.length = 1))\n : number < 4503599627370496\n ? ((this.words = [number & 67108863, (number / 67108864) & 67108863]), (this.length = 2))\n : (assert(number < 9007199254740992),\n (this.words = [number & 67108863, (number / 67108864) & 67108863, 1]),\n (this.length = 3)),\n endian === \"le\" && this._initArray(this.toArray(), base, endian);\n }),\n (BN.prototype._initArray = function (number, base, endian) {\n if ((assert(typeof number.length == \"number\"), number.length <= 0))\n return (this.words = [0]), (this.length = 1), this;\n (this.length = Math.ceil(number.length / 3)), (this.words = new Array(this.length));\n for (var i = 0; i < this.length; i++) this.words[i] = 0;\n var j,\n w,\n off = 0;\n if (endian === \"be\")\n for (i = number.length - 1, j = 0; i >= 0; i -= 3)\n (w = number[i] | (number[i - 1] << 8) | (number[i - 2] << 16)),\n (this.words[j] |= (w << off) & 67108863),\n (this.words[j + 1] = (w >>> (26 - off)) & 67108863),\n (off += 24),\n off >= 26 && ((off -= 26), j++);\n else if (endian === \"le\")\n for (i = 0, j = 0; i < number.length; i += 3)\n (w = number[i] | (number[i + 1] << 8) | (number[i + 2] << 16)),\n (this.words[j] |= (w << off) & 67108863),\n (this.words[j + 1] = (w >>> (26 - off)) & 67108863),\n (off += 24),\n off >= 26 && ((off -= 26), j++);\n return this.strip();\n });\n function parseHex4Bits(string, index) {\n var c = string.charCodeAt(index);\n return c >= 65 && c <= 70 ? c - 55 : c >= 97 && c <= 102 ? c - 87 : (c - 48) & 15;\n }\n function parseHexByte(string, lowerBound, index) {\n var r = parseHex4Bits(string, index);\n return index - 1 >= lowerBound && (r |= parseHex4Bits(string, index - 1) << 4), r;\n }\n BN.prototype._parseHex = function (number, start, endian) {\n (this.length = Math.ceil((number.length - start) / 6)), (this.words = new Array(this.length));\n for (var i = 0; i < this.length; i++) this.words[i] = 0;\n var off = 0,\n j = 0,\n w;\n if (endian === \"be\")\n for (i = number.length - 1; i >= start; i -= 2)\n (w = parseHexByte(number, start, i) << off),\n (this.words[j] |= w & 67108863),\n off >= 18 ? ((off -= 18), (j += 1), (this.words[j] |= w >>> 26)) : (off += 8);\n else {\n var parseLength = number.length - start;\n for (i = parseLength % 2 === 0 ? start + 1 : start; i < number.length; i += 2)\n (w = parseHexByte(number, start, i) << off),\n (this.words[j] |= w & 67108863),\n off >= 18 ? ((off -= 18), (j += 1), (this.words[j] |= w >>> 26)) : (off += 8);\n }\n this.strip();\n };\n function parseBase(str, start, end, mul) {\n for (var r = 0, len = Math.min(str.length, end), i = start; i < len; i++) {\n var c = str.charCodeAt(i) - 48;\n (r *= mul), c >= 49 ? (r += c - 49 + 10) : c >= 17 ? (r += c - 17 + 10) : (r += c);\n }\n return r;\n }\n (BN.prototype._parseBase = function (number, base, start) {\n (this.words = [0]), (this.length = 1);\n for (var limbLen = 0, limbPow = 1; limbPow <= 67108863; limbPow *= base) limbLen++;\n limbLen--, (limbPow = (limbPow / base) | 0);\n for (\n var total = number.length - start,\n mod = total % limbLen,\n end = Math.min(total, total - mod) + start,\n word = 0,\n i = start;\n i < end;\n i += limbLen\n )\n (word = parseBase(number, i, i + limbLen, base)),\n this.imuln(limbPow),\n this.words[0] + word < 67108864 ? (this.words[0] += word) : this._iaddn(word);\n if (mod !== 0) {\n var pow = 1;\n for (word = parseBase(number, i, number.length, base), i = 0; i < mod; i++) pow *= base;\n this.imuln(pow), this.words[0] + word < 67108864 ? (this.words[0] += word) : this._iaddn(word);\n }\n this.strip();\n }),\n (BN.prototype.copy = function (dest) {\n dest.words = new Array(this.length);\n for (var i = 0; i < this.length; i++) dest.words[i] = this.words[i];\n (dest.length = this.length), (dest.negative = this.negative), (dest.red = this.red);\n }),\n (BN.prototype.clone = function () {\n var r = new BN(null);\n return this.copy(r), r;\n }),\n (BN.prototype._expand = function (size) {\n for (; this.length < size; ) this.words[this.length++] = 0;\n return this;\n }),\n (BN.prototype.strip = function () {\n for (; this.length > 1 && this.words[this.length - 1] === 0; ) this.length--;\n return this._normSign();\n }),\n (BN.prototype._normSign = function () {\n return this.length === 1 && this.words[0] === 0 && (this.negative = 0), this;\n }),\n (BN.prototype.inspect = function () {\n return (this.red ? \"<BN-R: \" : \"<BN: \") + this.toString(16) + \">\";\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 groupSizes = [\n 0, 0, 25, 16, 12, 11, 10, 9, 8, 8, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5,\n 5, 5,\n ],\n groupBases = [\n 0, 0, 33554432, 43046721, 16777216, 48828125, 60466176, 40353607, 16777216, 43046721, 1e7, 19487171, 35831808,\n 62748517, 7529536, 11390625, 16777216, 24137569, 34012224, 47045881, 64e6, 4084101, 5153632, 6436343, 7962624,\n 9765625, 11881376, 14348907, 17210368, 20511149, 243e5, 28629151, 33554432, 39135393, 45435424, 52521875,\n 60466176,\n ];\n (BN.prototype.toString = function (base, padding) {\n (base = base || 10), (padding = padding | 0 || 1);\n var out;\n if (base === 16 || base === \"hex\") {\n out = \"\";\n for (var off = 0, carry = 0, i = 0; i < this.length; i++) {\n var w = this.words[i],\n word = (((w << off) | carry) & 16777215).toString(16);\n (carry = (w >>> (24 - off)) & 16777215),\n carry !== 0 || i !== this.length - 1 ? (out = zeros[6 - word.length] + word + out) : (out = word + out),\n (off += 2),\n off >= 26 && ((off -= 26), i--);\n }\n for (carry !== 0 && (out = carry.toString(16) + out); out.length % padding !== 0; ) out = \"0\" + out;\n return this.negative !== 0 && (out = \"-\" + out), out;\n }\n if (base === (base | 0) && base >= 2 && base <= 36) {\n var groupSize = groupSizes[base],\n groupBase = groupBases[base];\n out = \"\";\n var c = this.clone();\n for (c.negative = 0; !c.isZero(); ) {\n var r = c.modn(groupBase).toString(base);\n (c = c.idivn(groupBase)), c.isZero() ? (out = r + out) : (out = zeros[groupSize - r.length] + r + out);\n }\n for (this.isZero() && (out = \"0\" + out); out.length % padding !== 0; ) out = \"0\" + out;\n return this.negative !== 0 && (out = \"-\" + out), out;\n }\n assert(!1, \"Base should be between 2 and 36\");\n }),\n (BN.prototype.toNumber = function () {\n var ret = this.words[0];\n return (\n this.length === 2\n ? (ret += this.words[1] * 67108864)\n : this.length === 3 && this.words[2] === 1\n ? (ret += 4503599627370496 + this.words[1] * 67108864)\n : this.length > 2 && assert(!1, \"Number can only safely store up to 53 bits\"),\n this.negative !== 0 ? -ret : ret\n );\n }),\n (BN.prototype.toJSON = function () {\n return this.toString(16);\n }),\n (BN.prototype.toBuffer = function (endian, length) {\n return assert(typeof Buffer2 < \"u\"), this.toArrayLike(Buffer2, endian, length);\n }),\n (BN.prototype.toArray = function (endian, length) {\n return this.toArrayLike(Array, endian, length);\n }),\n (BN.prototype.toArrayLike = function (ArrayType, endian, length) {\n var byteLength = this.byteLength(),\n 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 this.strip();\n var littleEndian = endian === \"le\",\n res = new ArrayType(reqLength),\n b,\n i,\n q = this.clone();\n if (littleEndian) {\n for (i = 0; !q.isZero(); i++) (b = q.andln(255)), q.iushrn(8), (res[i] = b);\n for (; i < reqLength; i++) res[i] = 0;\n } else {\n for (i = 0; i < reqLength - byteLength; i++) res[i] = 0;\n for (i = 0; !q.isZero(); i++) (b = q.andln(255)), q.iushrn(8), (res[reqLength - i - 1] = b);\n }\n return res;\n }),\n Math.clz32\n ? (BN.prototype._countBits = function (w) {\n return 32 - Math.clz32(w);\n })\n : (BN.prototype._countBits = function (w) {\n var t = w,\n r = 0;\n return (\n t >= 4096 && ((r += 13), (t >>>= 13)),\n t >= 64 && ((r += 7), (t >>>= 7)),\n t >= 8 && ((r += 4), (t >>>= 4)),\n t >= 2 && ((r += 2), (t >>>= 2)),\n r + t\n );\n }),\n (BN.prototype._zeroBits = function (w) {\n if (w === 0) return 26;\n var t = w,\n r = 0;\n return (\n (t & 8191) === 0 && ((r += 13), (t >>>= 13)),\n (t & 127) === 0 && ((r += 7), (t >>>= 7)),\n (t & 15) === 0 && ((r += 4), (t >>>= 4)),\n (t & 3) === 0 && ((r += 2), (t >>>= 2)),\n (t & 1) === 0 && r++,\n r\n );\n }),\n (BN.prototype.bitLength = function () {\n var w = this.words[this.length - 1],\n hi = this._countBits(w);\n return (this.length - 1) * 26 + hi;\n });\n function toBitArray(num) {\n for (var w = new Array(num.bitLength()), bit = 0; bit < w.length; bit++) {\n var off = (bit / 26) | 0,\n wbit = bit % 26;\n w[bit] = (num.words[off] & (1 << wbit)) >>> wbit;\n }\n return w;\n }\n (BN.prototype.zeroBits = function () {\n if (this.isZero()) return 0;\n for (var r = 0, i = 0; i < this.length; i++) {\n var b = this._zeroBits(this.words[i]);\n if (((r += b), b !== 26)) break;\n }\n return r;\n }),\n (BN.prototype.byteLength = function () {\n return Math.ceil(this.bitLength() / 8);\n }),\n (BN.prototype.toTwos = function (width) {\n return this.negative !== 0 ? this.abs().inotn(width).iaddn(1) : this.clone();\n }),\n (BN.prototype.fromTwos = function (width) {\n return this.testn(width - 1) ? this.notn(width).iaddn(1).ineg() : this.clone();\n }),\n (BN.prototype.isNeg = function () {\n return this.negative !== 0;\n }),\n (BN.prototype.neg = function () {\n return this.clone().ineg();\n }),\n (BN.prototype.ineg = function () {\n return this.isZero() || (this.negative ^= 1), this;\n }),\n (BN.prototype.iuor = function (num) {\n for (; this.length < num.length; ) this.words[this.length++] = 0;\n for (var i = 0; i < num.length; i++) this.words[i] = this.words[i] | num.words[i];\n return this.strip();\n }),\n (BN.prototype.ior = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuor(num);\n }),\n (BN.prototype.or = function (num) {\n return this.length > num.length ? this.clone().ior(num) : num.clone().ior(this);\n }),\n (BN.prototype.uor = function (num) {\n return this.length > num.length ? this.clone().iuor(num) : num.clone().iuor(this);\n }),\n (BN.prototype.iuand = function (num) {\n var b;\n this.length > num.length ? (b = num) : (b = this);\n for (var i = 0; i < b.length; i++) this.words[i] = this.words[i] & num.words[i];\n return (this.length = b.length), this.strip();\n }),\n (BN.prototype.iand = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuand(num);\n }),\n (BN.prototype.and = function (num) {\n return this.length > num.length ? this.clone().iand(num) : num.clone().iand(this);\n }),\n (BN.prototype.uand = function (num) {\n return this.length > num.length ? this.clone().iuand(num) : num.clone().iuand(this);\n }),\n (BN.prototype.iuxor = function (num) {\n var a, b;\n this.length > num.length ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var i = 0; i < b.length; i++) this.words[i] = a.words[i] ^ b.words[i];\n if (this !== a) for (; i < a.length; i++) this.words[i] = a.words[i];\n return (this.length = a.length), this.strip();\n }),\n (BN.prototype.ixor = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuxor(num);\n }),\n (BN.prototype.xor = function (num) {\n return this.length > num.length ? this.clone().ixor(num) : num.clone().ixor(this);\n }),\n (BN.prototype.uxor = function (num) {\n return this.length > num.length ? this.clone().iuxor(num) : num.clone().iuxor(this);\n }),\n (BN.prototype.inotn = function (width) {\n assert(typeof width == \"number\" && width >= 0);\n var bytesNeeded = Math.ceil(width / 26) | 0,\n bitsLeft = width % 26;\n this._expand(bytesNeeded), bitsLeft > 0 && bytesNeeded--;\n for (var i = 0; i < bytesNeeded; i++) this.words[i] = ~this.words[i] & 67108863;\n return bitsLeft > 0 && (this.words[i] = ~this.words[i] & (67108863 >> (26 - bitsLeft))), this.strip();\n }),\n (BN.prototype.notn = function (width) {\n return this.clone().inotn(width);\n }),\n (BN.prototype.setn = function (bit, val) {\n assert(typeof bit == \"number\" && bit >= 0);\n var off = (bit / 26) | 0,\n wbit = bit % 26;\n return (\n this._expand(off + 1),\n val\n ? (this.words[off] = this.words[off] | (1 << wbit))\n : (this.words[off] = this.words[off] & ~(1 << wbit)),\n this.strip()\n );\n }),\n (BN.prototype.iadd = function (num) {\n var r;\n if (this.negative !== 0 && num.negative === 0)\n return (this.negative = 0), (r = this.isub(num)), (this.negative ^= 1), this._normSign();\n if (this.negative === 0 && num.negative !== 0)\n return (num.negative = 0), (r = this.isub(num)), (num.negative = 1), r._normSign();\n var a, b;\n this.length > num.length ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var carry = 0, i = 0; i < b.length; i++)\n (r = (a.words[i] | 0) + (b.words[i] | 0) + carry), (this.words[i] = r & 67108863), (carry = r >>> 26);\n for (; carry !== 0 && i < a.length; i++)\n (r = (a.words[i] | 0) + carry), (this.words[i] = r & 67108863), (carry = r >>> 26);\n if (((this.length = a.length), carry !== 0)) (this.words[this.length] = carry), this.length++;\n else if (a !== this) for (; i < a.length; i++) this.words[i] = a.words[i];\n return this;\n }),\n (BN.prototype.add = function (num) {\n var res;\n return num.negative !== 0 && this.negative === 0\n ? ((num.negative = 0), (res = this.sub(num)), (num.negative ^= 1), res)\n : num.negative === 0 && this.negative !== 0\n ? ((this.negative = 0), (res = num.sub(this)), (this.negative = 1), res)\n : this.length > num.length\n ? this.clone().iadd(num)\n : num.clone().iadd(this);\n }),\n (BN.prototype.isub = function (num) {\n if (num.negative !== 0) {\n num.negative = 0;\n var r = this.iadd(num);\n return (num.negative = 1), r._normSign();\n } else if (this.negative !== 0)\n return (this.negative = 0), this.iadd(num), (this.negative = 1), this._normSign();\n var cmp = this.cmp(num);\n if (cmp === 0) return (this.negative = 0), (this.length = 1), (this.words[0] = 0), this;\n var a, b;\n cmp > 0 ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var carry = 0, i = 0; i < b.length; i++)\n (r = (a.words[i] | 0) - (b.words[i] | 0) + carry), (carry = r >> 26), (this.words[i] = r & 67108863);\n for (; carry !== 0 && i < a.length; i++)\n (r = (a.words[i] | 0) + carry), (carry = r >> 26), (this.words[i] = r & 67108863);\n if (carry === 0 && i < a.length && a !== this) for (; i < a.length; i++) this.words[i] = a.words[i];\n return (this.length = Math.max(this.length, i)), a !== this && (this.negative = 1), this.strip();\n }),\n (BN.prototype.sub = function (num) {\n return this.clone().isub(num);\n });\n function smallMulTo(self2, num, out) {\n out.negative = num.negative ^ self2.negative;\n var len = (self2.length + num.length) | 0;\n (out.length = len), (len = (len - 1) | 0);\n var a = self2.words[0] | 0,\n b = num.words[0] | 0,\n r = a * b,\n lo = r & 67108863,\n carry = (r / 67108864) | 0;\n out.words[0] = lo;\n for (var k = 1; k < len; k++) {\n for (\n var ncarry = carry >>> 26,\n rword = carry & 67108863,\n maxJ = Math.min(k, num.length - 1),\n j = Math.max(0, k - self2.length + 1);\n j <= maxJ;\n j++\n ) {\n var i = (k - j) | 0;\n (a = self2.words[i] | 0),\n (b = num.words[j] | 0),\n (r = a * b + rword),\n (ncarry += (r / 67108864) | 0),\n (rword = r & 67108863);\n }\n (out.words[k] = rword | 0), (carry = ncarry | 0);\n }\n return carry !== 0 ? (out.words[k] = carry | 0) : out.length--, out.strip();\n }\n var comb10MulTo = function (self2, num, out) {\n var a = self2.words,\n b = num.words,\n o = out.words,\n c = 0,\n lo,\n mid,\n hi,\n a0 = a[0] | 0,\n al0 = a0 & 8191,\n ah0 = a0 >>> 13,\n a1 = a[1] | 0,\n al1 = a1 & 8191,\n ah1 = a1 >>> 13,\n a2 = a[2] | 0,\n al2 = a2 & 8191,\n ah2 = a2 >>> 13,\n a3 = a[3] | 0,\n al3 = a3 & 8191,\n ah3 = a3 >>> 13,\n a4 = a[4] | 0,\n al4 = a4 & 8191,\n ah4 = a4 >>> 13,\n a5 = a[5] | 0,\n al5 = a5 & 8191,\n ah5 = a5 >>> 13,\n a6 = a[6] | 0,\n al6 = a6 & 8191,\n ah6 = a6 >>> 13,\n a7 = a[7] | 0,\n al7 = a7 & 8191,\n ah7 = a7 >>> 13,\n a8 = a[8] | 0,\n al8 = a8 & 8191,\n ah8 = a8 >>> 13,\n a9 = a[9] | 0,\n al9 = a9 & 8191,\n ah9 = a9 >>> 13,\n b0 = b[0] | 0,\n bl0 = b0 & 8191,\n bh0 = b0 >>> 13,\n b1 = b[1] | 0,\n bl1 = b1 & 8191,\n bh1 = b1 >>> 13,\n b2 = b[2] | 0,\n bl2 = b2 & 8191,\n bh2 = b2 >>> 13,\n b3 = b[3] | 0,\n bl3 = b3 & 8191,\n bh3 = b3 >>> 13,\n b4 = b[4] | 0,\n bl4 = b4 & 8191,\n bh4 = b4 >>> 13,\n b5 = b[5] | 0,\n bl5 = b5 & 8191,\n bh5 = b5 >>> 13,\n b6 = b[6] | 0,\n bl6 = b6 & 8191,\n bh6 = b6 >>> 13,\n b7 = b[7] | 0,\n bl7 = b7 & 8191,\n bh7 = b7 >>> 13,\n b8 = b[8] | 0,\n bl8 = b8 & 8191,\n bh8 = b8 >>> 13,\n b9 = b[9] | 0,\n bl9 = b9 & 8191,\n bh9 = b9 >>> 13;\n (out.negative = self2.negative ^ num.negative),\n (out.length = 19),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w0 >>> 26)) | 0),\n (w0 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w1 >>> 26)) | 0),\n (w1 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w2 >>> 26)) | 0),\n (w2 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w3 >>> 26)) | 0),\n (w3 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w4 >>> 26)) | 0),\n (w4 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w5 >>> 26)) | 0),\n (w5 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w6 >>> 26)) | 0),\n (w6 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w7 >>> 26)) | 0),\n (w7 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w8 >>> 26)) | 0),\n (w8 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w9 >>> 26)) | 0),\n (w9 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w10 >>> 26)) | 0),\n (w10 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w11 >>> 26)) | 0),\n (w11 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w12 >>> 26)) | 0),\n (w12 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w13 >>> 26)) | 0),\n (w13 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w14 >>> 26)) | 0),\n (w14 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w15 >>> 26)) | 0),\n (w15 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w16 >>> 26)) | 0),\n (w16 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w17 >>> 26)) | 0),\n (w17 &= 67108863),\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 & 8191) << 13)) | 0;\n return (\n (c = (((hi + (mid >>> 13)) | 0) + (w18 >>> 26)) | 0),\n (w18 &= 67108863),\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 c !== 0 && ((o[19] = c), out.length++),\n out\n );\n };\n Math.imul || (comb10MulTo = smallMulTo);\n function bigMulTo(self2, num, out) {\n (out.negative = num.negative ^ self2.negative), (out.length = self2.length + num.length);\n for (var carry = 0, hncarry = 0, k = 0; k < out.length - 1; k++) {\n var ncarry = hncarry;\n hncarry = 0;\n for (\n var rword = carry & 67108863, maxJ = Math.min(k, num.length - 1), j = Math.max(0, k - self2.length + 1);\n j <= maxJ;\n j++\n ) {\n var i = k - j,\n a = self2.words[i] | 0,\n b = num.words[j] | 0,\n r = a * b,\n lo = r & 67108863;\n (ncarry = (ncarry + ((r / 67108864) | 0)) | 0),\n (lo = (lo + rword) | 0),\n (rword = lo & 67108863),\n (ncarry = (ncarry + (lo >>> 26)) | 0),\n (hncarry += ncarry >>> 26),\n (ncarry &= 67108863);\n }\n (out.words[k] = rword), (carry = ncarry), (ncarry = hncarry);\n }\n return carry !== 0 ? (out.words[k] = carry) : out.length--, out.strip();\n }\n function jumboMulTo(self2, num, out) {\n var fftm = new FFTM();\n return fftm.mulp(self2, num, out);\n }\n BN.prototype.mulTo = function (num, out) {\n var res,\n len = this.length + num.length;\n return (\n this.length === 10 && num.length === 10\n ? (res = comb10MulTo(this, num, out))\n : len < 63\n ? (res = smallMulTo(this, num, out))\n : len < 1024\n ? (res = bigMulTo(this, num, out))\n : (res = jumboMulTo(this, num, out)),\n res\n );\n };\n function FFTM(x, y) {\n (this.x = x), (this.y = y);\n }\n (FFTM.prototype.makeRBT = function (N) {\n for (var t = new Array(N), l = BN.prototype._countBits(N) - 1, i = 0; i < N; i++) t[i] = this.revBin(i, l, N);\n return t;\n }),\n (FFTM.prototype.revBin = function (x, l, N) {\n if (x === 0 || x === N - 1) return x;\n for (var rb = 0, i = 0; i < l; i++) (rb |= (x & 1) << (l - i - 1)), (x >>= 1);\n return rb;\n }),\n (FFTM.prototype.permute = function (rbt, rws, iws, rtws, itws, N) {\n for (var i = 0; i < N; i++) (rtws[i] = rws[rbt[i]]), (itws[i] = iws[rbt[i]]);\n }),\n (FFTM.prototype.transform = function (rws, iws, rtws, itws, N, rbt) {\n this.permute(rbt, rws, iws, rtws, itws, N);\n for (var s = 1; s < N; s <<= 1)\n for (\n var l = s << 1, rtwdf = Math.cos((2 * Math.PI) / l), itwdf = Math.sin((2 * Math.PI) / l), p = 0;\n p < N;\n p += l\n )\n for (var rtwdf_ = rtwdf, itwdf_ = itwdf, j = 0; j < s; j++) {\n var re = rtws[p + j],\n ie = itws[p + j],\n ro = rtws[p + j + s],\n io = itws[p + j + s],\n rx = rtwdf_ * ro - itwdf_ * io;\n (io = rtwdf_ * io + itwdf_ * ro),\n (ro = rx),\n (rtws[p + j] = re + ro),\n (itws[p + j] = ie + io),\n (rtws[p + j + s] = re - ro),\n (itws[p + j + s] = ie - io),\n j !== l &&\n ((rx = rtwdf * rtwdf_ - itwdf * itwdf_), (itwdf_ = rtwdf * itwdf_ + itwdf * rtwdf_), (rtwdf_ = rx));\n }\n }),\n (FFTM.prototype.guessLen13b = function (n, m) {\n var N = Math.max(m, n) | 1,\n odd = N & 1,\n i = 0;\n for (N = (N / 2) | 0; N; N = N >>> 1) i++;\n return 1 << (i + 1 + odd);\n }),\n (FFTM.prototype.conjugate = function (rws, iws, N) {\n if (!(N <= 1))\n for (var i = 0; i < N / 2; i++) {\n var t = rws[i];\n (rws[i] = rws[N - i - 1]),\n (rws[N - i - 1] = t),\n (t = iws[i]),\n (iws[i] = -iws[N - i - 1]),\n (iws[N - i - 1] = -t);\n }\n }),\n (FFTM.prototype.normalize13b = function (ws, N) {\n for (var carry = 0, i = 0; i < N / 2; i++) {\n var w = Math.round(ws[2 * i + 1] / N) * 8192 + Math.round(ws[2 * i] / N) + carry;\n (ws[i] = w & 67108863), w < 67108864 ? (carry = 0) : (carry = (w / 67108864) | 0);\n }\n return ws;\n }),\n (FFTM.prototype.convert13b = function (ws, len, rws, N) {\n for (var carry = 0, i = 0; i < len; i++)\n (carry = carry + (ws[i] | 0)),\n (rws[2 * i] = carry & 8191),\n (carry = carry >>> 13),\n (rws[2 * i + 1] = carry & 8191),\n (carry = carry >>> 13);\n for (i = 2 * len; i < N; ++i) rws[i] = 0;\n assert(carry === 0), assert((carry & -8192) === 0);\n }),\n (FFTM.prototype.stub = function (N) {\n for (var ph = new Array(N), i = 0; i < N; i++) ph[i] = 0;\n return ph;\n }),\n (FFTM.prototype.mulp = function (x, y, out) {\n var N = 2 * this.guessLen13b(x.length, y.length),\n rbt = this.makeRBT(N),\n _ = this.stub(N),\n rws = new Array(N),\n rwst = new Array(N),\n iwst = new Array(N),\n nrws = new Array(N),\n nrwst = new Array(N),\n niwst = new Array(N),\n rmws = out.words;\n (rmws.length = N),\n this.convert13b(x.words, x.length, rws, N),\n this.convert13b(y.words, y.length, nrws, N),\n this.transform(rws, _, rwst, iwst, N, rbt),\n this.transform(nrws, _, nrwst, niwst, N, rbt);\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]), (rwst[i] = rx);\n }\n return (\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 (out.negative = x.negative ^ y.negative),\n (out.length = x.length + y.length),\n out.strip()\n );\n }),\n (BN.prototype.mul = function (num) {\n var out = new BN(null);\n return (out.words = new Array(this.length + num.length)), this.mulTo(num, out);\n }),\n (BN.prototype.mulf = function (num) {\n var out = new BN(null);\n return (out.words = new Array(this.length + num.length)), jumboMulTo(this, num, out);\n }),\n (BN.prototype.imul = function (num) {\n return this.clone().mulTo(num, this);\n }),\n (BN.prototype.imuln = function (num) {\n assert(typeof num == \"number\"), assert(num < 67108864);\n for (var carry = 0, i = 0; i < this.length; i++) {\n var w = (this.words[i] | 0) * num,\n lo = (w & 67108863) + (carry & 67108863);\n (carry >>= 26), (carry += (w / 67108864) | 0), (carry += lo >>> 26), (this.words[i] = lo & 67108863);\n }\n return carry !== 0 && ((this.words[i] = carry), this.length++), this;\n }),\n (BN.prototype.muln = function (num) {\n return this.clone().imuln(num);\n }),\n (BN.prototype.sqr = function () {\n return this.mul(this);\n }),\n (BN.prototype.isqr = function () {\n return this.imul(this.clone());\n }),\n (BN.prototype.pow = function (num) {\n var w = toBitArray(num);\n if (w.length === 0) return new BN(1);\n for (var res = this, i = 0; i < w.length && w[i] === 0; i++, res = res.sqr());\n if (++i < w.length) for (var q = res.sqr(); i < w.length; i++, q = q.sqr()) w[i] !== 0 && (res = res.mul(q));\n return res;\n }),\n (BN.prototype.iushln = function (bits) {\n assert(typeof bits == \"number\" && bits >= 0);\n var r = bits % 26,\n s = (bits - r) / 26,\n carryMask = (67108863 >>> (26 - r)) << (26 - r),\n i;\n if (r !== 0) {\n var carry = 0;\n for (i = 0; i < this.length; i++) {\n var newCarry = this.words[i] & carryMask,\n c = ((this.words[i] | 0) - newCarry) << r;\n (this.words[i] = c | carry), (carry = newCarry >>> (26 - r));\n }\n carry && ((this.words[i] = carry), this.length++);\n }\n if (s !== 0) {\n for (i = this.length - 1; i >= 0; i--) this.words[i + s] = this.words[i];\n for (i = 0; i < s; i++) this.words[i] = 0;\n this.length += s;\n }\n return this.strip();\n }),\n (BN.prototype.ishln = function (bits) {\n return assert(this.negative === 0), this.iushln(bits);\n }),\n (BN.prototype.iushrn = function (bits, hint, extended) {\n assert(typeof bits == \"number\" && bits >= 0);\n var h;\n hint ? (h = (hint - (hint % 26)) / 26) : (h = 0);\n var r = bits % 26,\n s = Math.min((bits - r) / 26, this.length),\n mask = 67108863 ^ ((67108863 >>> r) << r),\n maskedWords = extended;\n if (((h -= s), (h = Math.max(0, h)), maskedWords)) {\n for (var i = 0; i < s; i++) maskedWords.words[i] = this.words[i];\n maskedWords.length = s;\n }\n if (s !== 0)\n if (this.length > s) for (this.length -= s, i = 0; i < this.length; i++) this.words[i] = this.words[i + s];\n else (this.words[0] = 0), (this.length = 1);\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)), (carry = word & mask);\n }\n return (\n maskedWords && carry !== 0 && (maskedWords.words[maskedWords.length++] = carry),\n this.length === 0 && ((this.words[0] = 0), (this.length = 1)),\n this.strip()\n );\n }),\n (BN.prototype.ishrn = function (bits, hint, extended) {\n return assert(this.negative === 0), this.iushrn(bits, hint, extended);\n }),\n (BN.prototype.shln = function (bits) {\n return this.clone().ishln(bits);\n }),\n (BN.prototype.ushln = function (bits) {\n return this.clone().iushln(bits);\n }),\n (BN.prototype.shrn = function (bits) {\n return this.clone().ishrn(bits);\n }),\n (BN.prototype.ushrn = function (bits) {\n return this.clone().iushrn(bits);\n }),\n (BN.prototype.testn = function (bit) {\n assert(typeof bit == \"number\" && bit >= 0);\n var r = bit % 26,\n s = (bit - r) / 26,\n q = 1 << r;\n if (this.length <= s) return !1;\n var w = this.words[s];\n return !!(w & q);\n }),\n (BN.prototype.imaskn = function (bits) {\n assert(typeof bits == \"number\" && bits >= 0);\n var r = bits % 26,\n s = (bits - r) / 26;\n if ((assert(this.negative === 0, \"imaskn works only with positive numbers\"), this.length <= s)) return this;\n if ((r !== 0 && s++, (this.length = Math.min(s, this.length)), r !== 0)) {\n var mask = 67108863 ^ ((67108863 >>> r) << r);\n this.words[this.length - 1] &= mask;\n }\n return this.strip();\n }),\n (BN.prototype.maskn = function (bits) {\n return this.clone().imaskn(bits);\n }),\n (BN.prototype.iaddn = function (num) {\n return (\n assert(typeof num == \"number\"),\n assert(num < 67108864),\n num < 0\n ? this.isubn(-num)\n : this.negative !== 0\n ? this.length === 1 && (this.words[0] | 0) < num\n ? ((this.words[0] = num - (this.words[0] | 0)), (this.negative = 0), this)\n : ((this.negative = 0), this.isubn(num), (this.negative = 1), this)\n : this._iaddn(num)\n );\n }),\n (BN.prototype._iaddn = function (num) {\n this.words[0] += num;\n for (var i = 0; i < this.length && this.words[i] >= 67108864; i++)\n (this.words[i] -= 67108864), i === this.length - 1 ? (this.words[i + 1] = 1) : this.words[i + 1]++;\n return (this.length = Math.max(this.length, i + 1)), this;\n }),\n (BN.prototype.isubn = function (num) {\n if ((assert(typeof num == \"number\"), assert(num < 67108864), num < 0)) return this.iaddn(-num);\n if (this.negative !== 0) return (this.negative = 0), this.iaddn(num), (this.negative = 1), this;\n if (((this.words[0] -= num), this.length === 1 && this.words[0] < 0))\n (this.words[0] = -this.words[0]), (this.negative = 1);\n else\n for (var i = 0; i < this.length && this.words[i] < 0; i++)\n (this.words[i] += 67108864), (this.words[i + 1] -= 1);\n return this.strip();\n }),\n (BN.prototype.addn = function (num) {\n return this.clone().iaddn(num);\n }),\n (BN.prototype.subn = function (num) {\n return this.clone().isubn(num);\n }),\n (BN.prototype.iabs = function () {\n return (this.negative = 0), this;\n }),\n (BN.prototype.abs = function () {\n return this.clone().iabs();\n }),\n (BN.prototype._ishlnsubmul = function (num, mul, shift) {\n var len = num.length + shift,\n i;\n this._expand(len);\n var w,\n 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 & 67108863),\n (carry = (w >> 26) - ((right / 67108864) | 0)),\n (this.words[i + shift] = w & 67108863);\n }\n for (; i < this.length - shift; i++)\n (w = (this.words[i + shift] | 0) + carry), (carry = w >> 26), (this.words[i + shift] = w & 67108863);\n if (carry === 0) return this.strip();\n for (assert(carry === -1), carry = 0, i = 0; i < this.length; i++)\n (w = -(this.words[i] | 0) + carry), (carry = w >> 26), (this.words[i] = w & 67108863);\n return (this.negative = 1), this.strip();\n }),\n (BN.prototype._wordDiv = function (num, mode) {\n var shift = this.length - num.length,\n a = this.clone(),\n b = num,\n bhi = b.words[b.length - 1] | 0,\n bhiBits = this._countBits(bhi);\n (shift = 26 - bhiBits),\n shift !== 0 && ((b = b.ushln(shift)), a.iushln(shift), (bhi = b.words[b.length - 1] | 0));\n var m = a.length - b.length,\n q;\n if (mode !== \"mod\") {\n (q = new BN(null)), (q.length = m + 1), (q.words = new Array(q.length));\n for (var i = 0; i < q.length; i++) q.words[i] = 0;\n }\n var diff = a.clone()._ishlnsubmul(b, 1, m);\n diff.negative === 0 && ((a = diff), q && (q.words[m] = 1));\n for (var j = m - 1; j >= 0; j--) {\n var qj = (a.words[b.length + j] | 0) * 67108864 + (a.words[b.length + j - 1] | 0);\n for (qj = Math.min((qj / bhi) | 0, 67108863), a._ishlnsubmul(b, qj, j); a.negative !== 0; )\n qj--, (a.negative = 0), a._ishlnsubmul(b, 1, j), a.isZero() || (a.negative ^= 1);\n q && (q.words[j] = qj);\n }\n return (\n q && q.strip(),\n a.strip(),\n mode !== \"div\" && shift !== 0 && a.iushrn(shift),\n {\n div: q || null,\n mod: a,\n }\n );\n }),\n (BN.prototype.divmod = function (num, mode, positive) {\n if ((assert(!num.isZero()), this.isZero()))\n return {\n div: new BN(0),\n mod: new BN(0),\n };\n var div, mod, res;\n return this.negative !== 0 && num.negative === 0\n ? ((res = this.neg().divmod(num, mode)),\n mode !== \"mod\" && (div = res.div.neg()),\n mode !== \"div\" && ((mod = res.mod.neg()), positive && mod.negative !== 0 && mod.iadd(num)),\n {\n div,\n mod,\n })\n : this.negative === 0 && num.negative !== 0\n ? ((res = this.divmod(num.neg(), mode)),\n mode !== \"mod\" && (div = res.div.neg()),\n {\n div,\n mod: res.mod,\n })\n : (this.negative & num.negative) !== 0\n ? ((res = this.neg().divmod(num.neg(), mode)),\n mode !== \"div\" && ((mod = res.mod.neg()), positive && mod.negative !== 0 && mod.isub(num)),\n {\n div: res.div,\n mod,\n })\n : num.length > this.length || this.cmp(num) < 0\n ? {\n div: new BN(0),\n mod: this,\n }\n : num.length === 1\n ? mode === \"div\"\n ? {\n div: this.divn(num.words[0]),\n mod: null,\n }\n : mode === \"mod\"\n ? {\n div: null,\n mod: new BN(this.modn(num.words[0])),\n }\n : {\n div: this.divn(num.words[0]),\n mod: new BN(this.modn(num.words[0])),\n }\n : this._wordDiv(num, mode);\n }),\n (BN.prototype.div = function (num) {\n return this.divmod(num, \"div\", !1).div;\n }),\n (BN.prototype.mod = function (num) {\n return this.divmod(num, \"mod\", !1).mod;\n }),\n (BN.prototype.umod = function (num) {\n return this.divmod(num, \"mod\", !0).mod;\n }),\n (BN.prototype.divRound = function (num) {\n var dm = this.divmod(num);\n if (dm.mod.isZero()) return dm.div;\n var mod = dm.div.negative !== 0 ? dm.mod.isub(num) : dm.mod,\n half = num.ushrn(1),\n r2 = num.andln(1),\n cmp = mod.cmp(half);\n return cmp < 0 || (r2 === 1 && cmp === 0)\n ? dm.div\n : dm.div.negative !== 0\n ? dm.div.isubn(1)\n : dm.div.iaddn(1);\n }),\n (BN.prototype.modn = function (num) {\n assert(num <= 67108863);\n for (var p = (1 << 26) % num, acc = 0, i = this.length - 1; i >= 0; i--)\n acc = (p * acc + (this.words[i] | 0)) % num;\n return acc;\n }),\n (BN.prototype.idivn = function (num) {\n assert(num <= 67108863);\n for (var carry = 0, i = this.length - 1; i >= 0; i--) {\n var w = (this.words[i] | 0) + carry * 67108864;\n (this.words[i] = (w / num) | 0), (carry = w % num);\n }\n return this.strip();\n }),\n (BN.prototype.divn = function (num) {\n return this.clone().idivn(num);\n }),\n (BN.prototype.egcd = function (p) {\n assert(p.negative === 0), assert(!p.isZero());\n var x = this,\n y = p.clone();\n x.negative !== 0 ? (x = x.umod(p)) : (x = x.clone());\n for (var A = new BN(1), B = new BN(0), C = new BN(0), D = new BN(1), g = 0; x.isEven() && y.isEven(); )\n x.iushrn(1), y.iushrn(1), ++g;\n for (var yp = y.clone(), xp = x.clone(); !x.isZero(); ) {\n for (var i = 0, im = 1; (x.words[0] & im) === 0 && i < 26; ++i, im <<= 1);\n if (i > 0)\n for (x.iushrn(i); i-- > 0; )\n (A.isOdd() || B.isOdd()) && (A.iadd(yp), B.isub(xp)), A.iushrn(1), B.iushrn(1);\n for (var j = 0, jm = 1; (y.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n if (j > 0)\n for (y.iushrn(j); j-- > 0; )\n (C.isOdd() || D.isOdd()) && (C.iadd(yp), D.isub(xp)), C.iushrn(1), D.iushrn(1);\n x.cmp(y) >= 0 ? (x.isub(y), A.isub(C), B.isub(D)) : (y.isub(x), C.isub(A), D.isub(B));\n }\n return {\n a: C,\n b: D,\n gcd: y.iushln(g),\n };\n }),\n (BN.prototype._invmp = function (p) {\n assert(p.negative === 0), assert(!p.isZero());\n var a = this,\n b = p.clone();\n a.negative !== 0 ? (a = a.umod(p)) : (a = a.clone());\n for (var x1 = new BN(1), x2 = new BN(0), delta = b.clone(); 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) for (a.iushrn(i); i-- > 0; ) x1.isOdd() && x1.iadd(delta), x1.iushrn(1);\n for (var j = 0, jm = 1; (b.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n if (j > 0) for (b.iushrn(j); j-- > 0; ) x2.isOdd() && x2.iadd(delta), x2.iushrn(1);\n a.cmp(b) >= 0 ? (a.isub(b), x1.isub(x2)) : (b.isub(a), x2.isub(x1));\n }\n var res;\n return a.cmpn(1) === 0 ? (res = x1) : (res = x2), res.cmpn(0) < 0 && res.iadd(p), res;\n }),\n (BN.prototype.gcd = function (num) {\n if (this.isZero()) return num.abs();\n if (num.isZero()) return this.abs();\n var a = this.clone(),\n b = num.clone();\n (a.negative = 0), (b.negative = 0);\n for (var shift = 0; a.isEven() && b.isEven(); shift++) a.iushrn(1), b.iushrn(1);\n do {\n for (; a.isEven(); ) a.iushrn(1);\n for (; b.isEven(); ) b.iushrn(1);\n var r = a.cmp(b);\n if (r < 0) {\n var t = a;\n (a = b), (b = t);\n } else if (r === 0 || b.cmpn(1) === 0) break;\n a.isub(b);\n } while (!0);\n return b.iushln(shift);\n }),\n (BN.prototype.invm = function (num) {\n return this.egcd(num).a.umod(num);\n }),\n (BN.prototype.isEven = function () {\n return (this.words[0] & 1) === 0;\n }),\n (BN.prototype.isOdd = function () {\n return (this.words[0] & 1) === 1;\n }),\n (BN.prototype.andln = function (num) {\n return this.words[0] & num;\n }),\n (BN.prototype.bincn = function (bit) {\n assert(typeof bit == \"number\");\n var r = bit % 26,\n s = (bit - r) / 26,\n q = 1 << r;\n if (this.length <= s) return this._expand(s + 1), (this.words[s] |= q), this;\n for (var carry = q, i = s; carry !== 0 && i < this.length; i++) {\n var w = this.words[i] | 0;\n (w += carry), (carry = w >>> 26), (w &= 67108863), (this.words[i] = w);\n }\n return carry !== 0 && ((this.words[i] = carry), this.length++), this;\n }),\n (BN.prototype.isZero = function () {\n return this.length === 1 && this.words[0] === 0;\n }),\n (BN.prototype.cmpn = function (num) {\n var negative = num < 0;\n if (this.negative !== 0 && !negative) return -1;\n if (this.negative === 0 && negative) return 1;\n this.strip();\n var res;\n if (this.length > 1) res = 1;\n else {\n negative && (num = -num), assert(num <= 67108863, \"Number is too big\");\n var w = this.words[0] | 0;\n res = w === num ? 0 : w < num ? -1 : 1;\n }\n return this.negative !== 0 ? -res | 0 : res;\n }),\n (BN.prototype.cmp = function (num) {\n if (this.negative !== 0 && num.negative === 0) return -1;\n if (this.negative === 0 && num.negative !== 0) return 1;\n var res = this.ucmp(num);\n return this.negative !== 0 ? -res | 0 : res;\n }),\n (BN.prototype.ucmp = function (num) {\n if (this.length > num.length) return 1;\n if (this.length < num.length) return -1;\n for (var res = 0, i = this.length - 1; i >= 0; i--) {\n var a = this.words[i] | 0,\n b = num.words[i] | 0;\n if (a !== b) {\n a < b ? (res = -1) : a > b && (res = 1);\n break;\n }\n }\n return res;\n }),\n (BN.prototype.gtn = function (num) {\n return this.cmpn(num) === 1;\n }),\n (BN.prototype.gt = function (num) {\n return this.cmp(num) === 1;\n }),\n (BN.prototype.gten = function (num) {\n return this.cmpn(num) >= 0;\n }),\n (BN.prototype.gte = function (num) {\n return this.cmp(num) >= 0;\n }),\n (BN.prototype.ltn = function (num) {\n return this.cmpn(num) === -1;\n }),\n (BN.prototype.lt = function (num) {\n return this.cmp(num) === -1;\n }),\n (BN.prototype.lten = function (num) {\n return this.cmpn(num) <= 0;\n }),\n (BN.prototype.lte = function (num) {\n return this.cmp(num) <= 0;\n }),\n (BN.prototype.eqn = function (num) {\n return this.cmpn(num) === 0;\n }),\n (BN.prototype.eq = function (num) {\n return this.cmp(num) === 0;\n }),\n (BN.red = function (num) {\n return new Red(num);\n }),\n (BN.prototype.toRed = function (ctx) {\n return (\n assert(!this.red, \"Already a number in reduction context\"),\n assert(this.negative === 0, \"red works only with positives\"),\n ctx.convertTo(this)._forceRed(ctx)\n );\n }),\n (BN.prototype.fromRed = function () {\n return assert(this.red, \"fromRed works only with numbers in reduction context\"), this.red.convertFrom(this);\n }),\n (BN.prototype._forceRed = function (ctx) {\n return (this.red = ctx), this;\n }),\n (BN.prototype.forceRed = function (ctx) {\n return assert(!this.red, \"Already a number in reduction context\"), this._forceRed(ctx);\n }),\n (BN.prototype.redAdd = function (num) {\n return assert(this.red, \"redAdd works only with red numbers\"), this.red.add(this, num);\n }),\n (BN.prototype.redIAdd = function (num) {\n return assert(this.red, \"redIAdd works only with red numbers\"), this.red.iadd(this, num);\n }),\n (BN.prototype.redSub = function (num) {\n return assert(this.red, \"redSub works only with red numbers\"), this.red.sub(this, num);\n }),\n (BN.prototype.redISub = function (num) {\n return assert(this.red, \"redISub works only with red numbers\"), this.red.isub(this, num);\n }),\n (BN.prototype.redShl = function (num) {\n return assert(this.red, \"redShl works only with red numbers\"), this.red.shl(this, num);\n }),\n (BN.prototype.redMul = function (num) {\n return (\n assert(this.red, \"redMul works only with red numbers\"),\n this.red._verify2(this, num),\n this.red.mul(this, num)\n );\n }),\n (BN.prototype.redIMul = function (num) {\n return (\n assert(this.red, \"redMul works only with red numbers\"),\n this.red._verify2(this, num),\n this.red.imul(this, num)\n );\n }),\n (BN.prototype.redSqr = function () {\n return assert(this.red, \"redSqr works only with red numbers\"), this.red._verify1(this), this.red.sqr(this);\n }),\n (BN.prototype.redISqr = function () {\n return assert(this.red, \"redISqr works only with red numbers\"), this.red._verify1(this), this.red.isqr(this);\n }),\n (BN.prototype.redSqrt = function () {\n return assert(this.red, \"redSqrt works only with red numbers\"), this.red._verify1(this), this.red.sqrt(this);\n }),\n (BN.prototype.redInvm = function () {\n return assert(this.red, \"redInvm works only with red numbers\"), this.red._verify1(this), this.red.invm(this);\n }),\n (BN.prototype.redNeg = function () {\n return assert(this.red, \"redNeg works only with red numbers\"), this.red._verify1(this), this.red.neg(this);\n }),\n (BN.prototype.redPow = function (num) {\n return assert(this.red && !num.red, \"redPow(normalNum)\"), this.red._verify1(this), this.red.pow(this, num);\n });\n var primes = {\n k256: null,\n p224: null,\n p192: null,\n p25519: null,\n };\n function MPrime(name, p) {\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 (this.tmp = this._tmp());\n }\n (MPrime.prototype._tmp = function () {\n var tmp = new BN(null);\n return (tmp.words = new Array(Math.ceil(this.n / 13))), tmp;\n }),\n (MPrime.prototype.ireduce = function (num) {\n var r = num,\n rlen;\n do this.split(r, this.tmp), (r = this.imulK(r)), (r = r.iadd(this.tmp)), (rlen = r.bitLength());\n while (rlen > this.n);\n var cmp = rlen < this.n ? -1 : r.ucmp(this.p);\n return (\n cmp === 0\n ? ((r.words[0] = 0), (r.length = 1))\n : cmp > 0\n ? r.isub(this.p)\n : r.strip !== void 0\n ? r.strip()\n : r._strip(),\n r\n );\n }),\n (MPrime.prototype.split = function (input, out) {\n input.iushrn(this.n, 0, out);\n }),\n (MPrime.prototype.imulK = function (num) {\n return num.imul(this.k);\n });\n function K256() {\n MPrime.call(this, \"k256\", \"ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f\");\n }\n inherits(K256, MPrime),\n (K256.prototype.split = function (input, output) {\n for (var mask = 4194303, outLen = Math.min(input.length, 9), i = 0; i < outLen; i++)\n output.words[i] = input.words[i];\n if (((output.length = outLen), input.length <= 9)) {\n (input.words[0] = 0), (input.length = 1);\n return;\n }\n var prev = input.words[9];\n for (output.words[output.length++] = prev & mask, i = 10; i < input.length; i++) {\n var next = input.words[i] | 0;\n (input.words[i - 10] = ((next & mask) << 4) | (prev >>> 22)), (prev = next);\n }\n (prev >>>= 22),\n (input.words[i - 10] = prev),\n prev === 0 && input.length > 10 ? (input.length -= 10) : (input.length -= 9);\n }),\n (K256.prototype.imulK = function (num) {\n (num.words[num.length] = 0), (num.words[num.length + 1] = 0), (num.length += 2);\n for (var lo = 0, i = 0; i < num.length; i++) {\n var w = num.words[i] | 0;\n (lo += w * 977), (num.words[i] = lo & 67108863), (lo = w * 64 + ((lo / 67108864) | 0));\n }\n return (\n num.words[num.length - 1] === 0 && (num.length--, num.words[num.length - 1] === 0 && num.length--), num\n );\n });\n function P224() {\n MPrime.call(this, \"p224\", \"ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001\");\n }\n inherits(P224, MPrime);\n function P192() {\n MPrime.call(this, \"p192\", \"ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff\");\n }\n inherits(P192, MPrime);\n function P25519() {\n MPrime.call(this, \"25519\", \"7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed\");\n }\n inherits(P25519, MPrime),\n (P25519.prototype.imulK = function (num) {\n for (var carry = 0, i = 0; i < num.length; i++) {\n var hi = (num.words[i] | 0) * 19 + carry,\n lo = hi & 67108863;\n (hi >>>= 26), (num.words[i] = lo), (carry = hi);\n }\n return carry !== 0 && (num.words[num.length++] = carry), num;\n }),\n (BN._prime = function (name) {\n if (primes[name]) return primes[name];\n var prime2;\n if (name === \"k256\") prime2 = new K256();\n else if (name === \"p224\") prime2 = new P224();\n else if (name === \"p192\") prime2 = new P192();\n else if (name === \"p25519\") prime2 = new P25519();\n else throw new Error(\"Unknown prime \" + name);\n return (primes[name] = prime2), prime2;\n });\n function Red(m) {\n if (typeof m == \"string\") {\n var prime = BN._prime(m);\n (this.m = prime.p), (this.prime = prime);\n } else assert(m.gtn(1), \"modulus must be greater than 1\"), (this.m = m), (this.prime = null);\n }\n (Red.prototype._verify1 = function (a) {\n assert(a.negative === 0, \"red works only with positives\"), assert(a.red, \"red works only with red numbers\");\n }),\n (Red.prototype._verify2 = function (a, b) {\n assert((a.negative | b.negative) === 0, \"red works only with positives\"),\n assert(a.red && a.red === b.red, \"red works only with red numbers\");\n }),\n (Red.prototype.imod = function (a) {\n return this.prime ? this.prime.ireduce(a)._forceRed(this) : a.umod(this.m)._forceRed(this);\n }),\n (Red.prototype.neg = function (a) {\n return a.isZero() ? a.clone() : this.m.sub(a)._forceRed(this);\n }),\n (Red.prototype.add = function (a, b) {\n this._verify2(a, b);\n var res = a.add(b);\n return res.cmp(this.m) >= 0 && res.isub(this.m), res._forceRed(this);\n }),\n (Red.prototype.iadd = function (a, b) {\n this._verify2(a, b);\n var res = a.iadd(b);\n return res.cmp(this.m) >= 0 && res.isub(this.m), res;\n }),\n (Red.prototype.sub = function (a, b) {\n this._verify2(a, b);\n var res = a.sub(b);\n return res.cmpn(0) < 0 && res.iadd(this.m), res._forceRed(this);\n }),\n (Red.prototype.isub = function (a, b) {\n this._verify2(a, b);\n var res = a.isub(b);\n return res.cmpn(0) < 0 && res.iadd(this.m), res;\n }),\n (Red.prototype.shl = function (a, num) {\n return this._verify1(a), this.imod(a.ushln(num));\n }),\n (Red.prototype.imul = function (a, b) {\n return this._verify2(a, b), this.imod(a.imul(b));\n }),\n (Red.prototype.mul = function (a, b) {\n return this._verify2(a, b), this.imod(a.mul(b));\n }),\n (Red.prototype.isqr = function (a) {\n return this.imul(a, a.clone());\n }),\n (Red.prototype.sqr = function (a) {\n return this.mul(a, a);\n }),\n (Red.prototype.sqrt = function (a) {\n if (a.isZero()) return a.clone();\n var mod3 = this.m.andln(3);\n if ((assert(mod3 % 2 === 1), mod3 === 3)) {\n var pow = this.m.add(new BN(1)).iushrn(2);\n return this.pow(a, pow);\n }\n for (var q = this.m.subn(1), s = 0; !q.isZero() && q.andln(1) === 0; ) s++, q.iushrn(1);\n assert(!q.isZero());\n var one = new BN(1).toRed(this),\n nOne = one.redNeg(),\n lpow = this.m.subn(1).iushrn(1),\n z = this.m.bitLength();\n for (z = new BN(2 * z * z).toRed(this); this.pow(z, lpow).cmp(nOne) !== 0; ) z.redIAdd(nOne);\n for (\n var c = this.pow(z, q), r = this.pow(a, q.addn(1).iushrn(1)), t = this.pow(a, q), m = s;\n t.cmp(one) !== 0;\n\n ) {\n for (var tmp = t, i = 0; tmp.cmp(one) !== 0; i++) tmp = tmp.redSqr();\n assert(i < m);\n var b = this.pow(c, new BN(1).iushln(m - i - 1));\n (r = r.redMul(b)), (c = b.redSqr()), (t = t.redMul(c)), (m = i);\n }\n return r;\n }),\n (Red.prototype.invm = function (a) {\n var inv = a._invmp(this.m);\n return inv.negative !== 0 ? ((inv.negative = 0), this.imod(inv).redNeg()) : this.imod(inv);\n }),\n (Red.prototype.pow = function (a, num) {\n if (num.isZero()) return new BN(1).toRed(this);\n if (num.cmpn(1) === 0) return a.clone();\n var windowSize = 4,\n wnd = new Array(1 << windowSize);\n (wnd[0] = new BN(1).toRed(this)), (wnd[1] = a);\n for (var i = 2; i < wnd.length; i++) wnd[i] = this.mul(wnd[i - 1], a);\n var res = wnd[0],\n current = 0,\n currentLen = 0,\n start = num.bitLength() % 26;\n for (start === 0 && (start = 26), i = num.length - 1; i >= 0; i--) {\n for (var word = num.words[i], j = start - 1; j >= 0; j--) {\n var bit = (word >> j) & 1;\n if ((res !== wnd[0] && (res = this.sqr(res)), bit === 0 && current === 0)) {\n currentLen = 0;\n continue;\n }\n (current <<= 1),\n (current |= bit),\n currentLen++,\n !(currentLen !== windowSize && (i !== 0 || j !== 0)) &&\n ((res = this.mul(res, wnd[current])), (currentLen = 0), (current = 0));\n }\n start = 26;\n }\n return res;\n }),\n (Red.prototype.convertTo = function (num) {\n var r = num.umod(this.m);\n return r === num ? r.clone() : r;\n }),\n (Red.prototype.convertFrom = function (num) {\n var res = num.clone();\n return (res.red = null), res;\n }),\n (BN.mont = function (num) {\n return new Mont(num);\n });\n function Mont(m) {\n Red.call(this, m),\n (this.shift = this.m.bitLength()),\n this.shift % 26 !== 0 && (this.shift += 26 - (this.shift % 26)),\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 (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 (Mont.prototype.convertTo = function (num) {\n return this.imod(num.ushln(this.shift));\n }),\n (Mont.prototype.convertFrom = function (num) {\n var r = this.imod(num.mul(this.rinv));\n return (r.red = null), r;\n }),\n (Mont.prototype.imul = function (a, b) {\n if (a.isZero() || b.isZero()) return (a.words[0] = 0), (a.length = 1), a;\n var t = a.imul(b),\n c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m),\n u = t.isub(c).iushrn(this.shift),\n res = u;\n return (\n u.cmp(this.m) >= 0 ? (res = u.isub(this.m)) : u.cmpn(0) < 0 && (res = u.iadd(this.m)), res._forceRed(this)\n );\n }),\n (Mont.prototype.mul = function (a, b) {\n if (a.isZero() || b.isZero()) return new BN(0)._forceRed(this);\n var t = a.mul(b),\n c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m),\n u = t.isub(c).iushrn(this.shift),\n res = u;\n return (\n u.cmp(this.m) >= 0 ? (res = u.isub(this.m)) : u.cmpn(0) < 0 && (res = u.iadd(this.m)), res._forceRed(this)\n );\n }),\n (Mont.prototype.invm = function (a) {\n var res = this.imod(a._invmp(this.m).mul(this.r2));\n return res._forceRed(this);\n });\n })(typeof module > \"u\" || module, exports);\n },\n});\n\n// (disabled):node_modules/crypto-browserify/index.js\nvar require_crypto_browserify = __commonJS({\n \"(disabled):node_modules/crypto-browserify/index.js\"() {},\n});\n\n// node_modules/brorand/index.js\nvar require_brorand = __commonJS({\n \"node_modules/brorand/index.js\"(exports, module) {\n var r;\n module.exports = function (len) {\n return r || (r = new Rand(null)), r.generate(len);\n };\n function Rand(rand) {\n this.rand = rand;\n }\n module.exports.Rand = Rand;\n Rand.prototype.generate = function (len) {\n return this._rand(len);\n };\n Rand.prototype._rand = function (n) {\n var out = new Buffer(n);\n crypto.getRandomValues(out);\n return out;\n };\n },\n});\n\n// node_modules/miller-rabin/lib/mr.js\nvar require_mr = __commonJS({\n \"node_modules/miller-rabin/lib/mr.js\"(exports, module) {\n var bn = require_bn2(),\n brorand = require_brorand();\n function MillerRabin(rand) {\n this.rand = rand || new brorand.Rand();\n }\n module.exports = MillerRabin;\n MillerRabin.create = function (rand) {\n return new MillerRabin(rand);\n };\n MillerRabin.prototype._randbelow = function (n) {\n var len = n.bitLength(),\n min_bytes = Math.ceil(len / 8);\n do var a = new bn(this.rand.generate(min_bytes));\n while (a.cmp(n) >= 0);\n return a;\n };\n MillerRabin.prototype._randrange = function (start, stop) {\n var size = stop.sub(start);\n return start.add(this._randbelow(size));\n };\n MillerRabin.prototype.test = function (n, k, cb) {\n var len = n.bitLength(),\n red = bn.mont(n),\n rone = new bn(1).toRed(red);\n k || (k = Math.max(1, (len / 48) | 0));\n for (var n1 = n.subn(1), s = 0; !n1.testn(s); s++);\n for (var d = n.shrn(s), rn1 = n1.toRed(red), prime = !0; k > 0; k--) {\n var a = this._randrange(new bn(2), n1);\n cb && cb(a);\n var x = a.toRed(red).redPow(d);\n if (!(x.cmp(rone) === 0 || x.cmp(rn1) === 0)) {\n for (var i = 1; i < s; i++) {\n if (((x = x.redSqr()), x.cmp(rone) === 0)) return !1;\n if (x.cmp(rn1) === 0) break;\n }\n if (i === s) return !1;\n }\n }\n return prime;\n };\n MillerRabin.prototype.getDivisor = function (n, k) {\n var len = n.bitLength(),\n red = bn.mont(n),\n rone = new bn(1).toRed(red);\n k || (k = Math.max(1, (len / 48) | 0));\n for (var n1 = n.subn(1), s = 0; !n1.testn(s); s++);\n for (var d = n.shrn(s), rn1 = n1.toRed(red); k > 0; k--) {\n var a = this._randrange(new bn(2), n1),\n g = n.gcd(a);\n if (g.cmpn(1) !== 0) return g;\n var x = a.toRed(red).redPow(d);\n if (!(x.cmp(rone) === 0 || x.cmp(rn1) === 0)) {\n for (var i = 1; i < s; i++) {\n if (((x = x.redSqr()), x.cmp(rone) === 0)) return x.fromRed().subn(1).gcd(n);\n if (x.cmp(rn1) === 0) break;\n }\n if (i === s) return (x = x.redSqr()), x.fromRed().subn(1).gcd(n);\n }\n }\n return !1;\n };\n },\n});\n\n// node_modules/diffie-hellman/lib/generatePrime.js\nvar require_generatePrime = __commonJS({\n \"node_modules/diffie-hellman/lib/generatePrime.js\"(exports, module) {\n var randomBytes = require_browser();\n module.exports = findPrime;\n findPrime.simpleSieve = simpleSieve;\n findPrime.fermatTest = fermatTest;\n var BN = require_bn(),\n TWENTYFOUR = new BN(24),\n MillerRabin = require_mr(),\n millerRabin = new MillerRabin(),\n ONE = new BN(1),\n TWO = new BN(2),\n FIVE = new BN(5),\n SIXTEEN = new BN(16),\n EIGHT = new BN(8),\n TEN = new BN(10),\n THREE = new BN(3),\n SEVEN = new BN(7),\n ELEVEN = new BN(11),\n FOUR = new BN(4),\n TWELVE = new BN(12),\n primes = null;\n function _getPrimes() {\n if (primes !== null) return primes;\n var limit = 1048576,\n res = [];\n res[0] = 2;\n for (var i = 1, k = 3; k < limit; k += 2) {\n for (var sqrt = Math.ceil(Math.sqrt(k)), j = 0; j < i && res[j] <= sqrt && k % res[j] !== 0; j++);\n (i !== j && res[j] <= sqrt) || (res[i++] = k);\n }\n return (primes = res), res;\n }\n function simpleSieve(p) {\n for (var primes2 = _getPrimes(), i = 0; i < primes2.length; i++)\n if (p.modn(primes2[i]) === 0) return p.cmpn(primes2[i]) === 0;\n return !0;\n }\n function fermatTest(p) {\n var red = BN.mont(p);\n return TWO.toRed(red).redPow(p.subn(1)).fromRed().cmpn(1) === 0;\n }\n function findPrime(bits, gen) {\n if (bits < 16) return gen === 2 || gen === 5 ? new BN([140, 123]) : new BN([140, 39]);\n gen = new BN(gen);\n for (var num, n2; ; ) {\n for (num = new BN(randomBytes(Math.ceil(bits / 8))); num.bitLength() > bits; ) num.ishrn(1);\n if ((num.isEven() && num.iadd(ONE), num.testn(1) || num.iadd(TWO), gen.cmp(TWO))) {\n if (!gen.cmp(FIVE)) for (; num.mod(TEN).cmp(THREE); ) num.iadd(FOUR);\n } else for (; num.mod(TWENTYFOUR).cmp(ELEVEN); ) num.iadd(FOUR);\n if (\n ((n2 = num.shrn(1)),\n simpleSieve(n2) &&\n simpleSieve(num) &&\n fermatTest(n2) &&\n fermatTest(num) &&\n millerRabin.test(n2) &&\n millerRabin.test(num))\n )\n return num;\n }\n }\n },\n});\n\n// node_modules/diffie-hellman/lib/primes.json\nvar require_primes = __commonJS({\n \"node_modules/diffie-hellman/lib/primes.json\"(exports, module) {\n module.exports = {\n modp1: {\n gen: \"02\",\n prime:\n \"ffffffffffffffffc90fdaa22168c234c4c6628b80dc1cd129024e088a67cc74020bbea63b139b22514a08798e3404ddef9519b3cd3a431b302b0a6df25f14374fe1356d6d51c245e485b576625e7ec6f44c42e9a63a3620ffffffffffffffff\",\n },\n modp2: {\n gen: \"02\",\n prime:\n \"ffffffffffffffffc90fdaa22168c234c4c6628b80dc1cd129024e088a67cc74020bbea63b139b22514a08798e3404ddef9519b3cd3a431b302b0a6df25f14374fe1356d6d51c245e485b576625e7ec6f44c42e9a637ed6b0bff5cb6f406b7edee386bfb5a899fa5ae9f24117c4b1fe649286651ece65381ffffffffffffffff\",\n },\n modp5: {\n gen: \"02\",\n prime:\n \"ffffffffffffffffc90fdaa22168c234c4c6628b80dc1cd129024e088a67cc74020bbea63b139b22514a08798e3404ddef9519b3cd3a431b302b0a6df25f14374fe1356d6d51c245e485b576625e7ec6f44c42e9a637ed6b0bff5cb6f406b7edee386bfb5a899fa5ae9f24117c4b1fe649286651ece45b3dc2007cb8a163bf0598da48361c55d39a69163fa8fd24cf5f83655d23dca3ad961c62f356208552bb9ed529077096966d670c354e4abc9804f1746c08ca237327ffffffffffffffff\",\n },\n modp14: {\n gen: \"02\",\n prime:\n \"ffffffffffffffffc90fdaa22168c234c4c6628b80dc1cd129024e088a67cc74020bbea63b139b22514a08798e3404ddef9519b3cd3a431b302b0a6df25f14374fe1356d6d51c245e485b576625e7ec6f44c42e9a637ed6b0bff5cb6f406b7edee386bfb5a899fa5ae9f24117c4b1fe649286651ece45b3dc2007cb8a163bf0598da48361c55d39a69163fa8fd24cf5f83655d23dca3ad961c62f356208552bb9ed529077096966d670c354e4abc9804f1746c08ca18217c32905e462e36ce3be39e772c180e86039b2783a2ec07a28fb5c55df06f4c52c9de2bcbf6955817183995497cea956ae515d2261898fa051015728e5a8aacaa68ffffffffffffffff\",\n },\n modp15: {\n gen: \"02\",\n prime:\n \"ffffffffffffffffc90fdaa22168c234c4c6628b80dc1cd129024e088a67cc74020bbea63b139b22514a08798e3404ddef9519b3cd3a431b302b0a6df25f14374fe1356d6d51c245e485b576625e7ec6f44c42e9a637ed6b0bff5cb6f406b7edee386bfb5a899fa5ae9f24117c4b1fe649286651ece45b3dc2007cb8a163bf0598da48361c55d39a69163fa8fd24cf5f83655d23dca3ad961c62f356208552bb9ed529077096966d670c354e4abc9804f1746c08ca18217c32905e462e36ce3be39e772c180e86039b2783a2ec07a28fb5c55df06f4c52c9de2bcbf6955817183995497cea956ae515d2261898fa051015728e5a8aaac42dad33170d04507a33a85521abdf1cba64ecfb850458dbef0a8aea71575d060c7db3970f85a6e1e4c7abf5ae8cdb0933d71e8c94e04a25619dcee3d2261ad2ee6bf12ffa06d98a0864d87602733ec86a64521f2b18177b200cbbe117577a615d6c770988c0bad946e208e24fa074e5ab3143db5bfce0fd108e4b82d120a93ad2caffffffffffffffff\",\n },\n modp16: {\n gen: \"02\",\n prime:\n \"ffffffffffffffffc90fdaa22168c234c4c6628b80dc1cd129024e088a67cc74020bbea63b139b22514a08798e3404ddef9519b3cd3a431b302b0a6df25f14374fe1356d6d51c245e485b576625e7ec6f44c42e9a637ed6b0bff5cb6f406b7edee386bfb5a899fa5ae9f24117c4b1fe649286651ece45b3dc2007cb8a163bf0598da48361c55d39a69163fa8fd24cf5f83655d23dca3ad961c62f356208552bb9ed529077096966d670c354e4abc9804f1746c08ca18217c32905e462e36ce3be39e772c180e86039b2783a2ec07a28fb5c55df06f4c52c9de2bcbf6955817183995497cea956ae515d2261898fa051015728e5a8aaac42dad33170d04507a33a85521abdf1cba64ecfb850458dbef0a8aea71575d060c7db3970f85a6e1e4c7abf5ae8cdb0933d71e8c94e04a25619dcee3d2261ad2ee6bf12ffa06d98a0864d87602733ec86a64521f2b18177b200cbbe117577a615d6c770988c0bad946e208e24fa074e5ab3143db5bfce0fd108e4b82d120a92108011a723c12a787e6d788719a10bdba5b2699c327186af4e23c1a946834b6150bda2583e9ca2ad44ce8dbbbc2db04de8ef92e8efc141fbecaa6287c59474e6bc05d99b2964fa090c3a2233ba186515be7ed1f612970cee2d7afb81bdd762170481cd0069127d5b05aa993b4ea988d8fddc186ffb7dc90a6c08f4df435c934063199ffffffffffffffff\",\n },\n modp17: {\n gen: \"02\",\n prime:\n \"ffffffffffffffffc90fdaa22168c234c4c6628b80dc1cd129024e088a67cc74020bbea63b139b22514a08798e3404ddef9519b3cd3a431b302b0a6df25f14374fe1356d6d51c245e485b576625e7ec6f44c42e9a637ed6b0bff5cb6f406b7edee386bfb5a899fa5ae9f24117c4b1fe649286651ece45b3dc2007cb8a163bf0598da48361c55d39a69163fa8fd24cf5f83655d23dca3ad961c62f356208552bb9ed529077096966d670c354e4abc9804f1746c08ca18217c32905e462e36ce3be39e772c180e86039b2783a2ec07a28fb5c55df06f4c52c9de2bcbf6955817183995497cea956ae515d2261898fa051015728e5a8aaac42dad33170d04507a33a85521abdf1cba64ecfb850458dbef0a8aea71575d060c7db3970f85a6e1e4c7abf5ae8cdb0933d71e8c94e04a25619dcee3d2261ad2ee6bf12ffa06d98a0864d87602733ec86a64521f2b18177b200cbbe117577a615d6c770988c0bad946e208e24fa074e5ab3143db5bfce0fd108e4b82d120a92108011a723c12a787e6d788719a10bdba5b2699c327186af4e23c1a946834b6150bda2583e9ca2ad44ce8dbbbc2db04de8ef92e8efc141fbecaa6287c59474e6bc05d99b2964fa090c3a2233ba186515be7ed1f612970cee2d7afb81bdd762170481cd0069127d5b05aa993b4ea988d8fddc186ffb7dc90a6c08f4df435c93402849236c3fab4d27c7026c1d4dcb2602646dec9751e763dba37bdf8ff9406ad9e530ee5db382f413001aeb06a53ed9027d831179727b0865a8918da3edbebcf9b14ed44ce6cbaced4bb1bdb7f1447e6cc254b332051512bd7af426fb8f401378cd2bf5983ca01c64b92ecf032ea15d1721d03f482d7ce6e74fef6d55e702f46980c82b5a84031900b1c9e59e7c97fbec7e8f323a97a7e36cc88be0f1d45b7ff585ac54bd407b22b4154aacc8f6d7ebf48e1d814cc5ed20f8037e0a79715eef29be32806a1d58bb7c5da76f550aa3d8a1fbff0eb19ccb1a313d55cda56c9ec2ef29632387fe8d76e3c0468043e8f663f4860ee12bf2d5b0b7474d6e694f91e6dcc4024ffffffffffffffff\",\n },\n modp18: {\n gen: \"02\",\n prime:\n \"ffffffffffffffffc90fdaa22168c234c4c6628b80dc1cd129024e088a67cc74020bbea63b139b22514a08798e3404ddef9519b3cd3a431b302b0a6df25f14374fe1356d6d51c245e485b576625e7ec6f44c42e9a637ed6b0bff5cb6f406b7edee386bfb5a899fa5ae9f24117c4b1fe649286651ece45b3dc2007cb8a163bf0598da48361c55d39a69163fa8fd24cf5f83655d23dca3ad961c62f356208552bb9ed529077096966d670c354e4abc9804f1746c08ca18217c32905e462e36ce3be39e772c180e86039b2783a2ec07a28fb5c55df06f4c52c9de2bcbf6955817183995497cea956ae515d2261898fa051015728e5a8aaac42dad33170d04507a33a85521abdf1cba64ecfb850458dbef0a8aea71575d060c7db3970f85a6e1e4c7abf5ae8cdb0933d71e8c94e04a25619dcee3d2261ad2ee6bf12ffa06d98a0864d87602733ec86a64521f2b18177b200cbbe117577a615d6c770988c0bad946e208e24fa074e5ab3143db5bfce0fd108e4b82d120a92108011a723c12a787e6d788719a10bdba5b2699c327186af4e23c1a946834b6150bda2583e9ca2ad44ce8dbbbc2db04de8ef92e8efc141fbecaa6287c59474e6bc05d99b2964fa090c3a2233ba186515be7ed1f612970cee2d7afb81bdd762170481cd0069127d5b05aa993b4ea988d8fddc186ffb7dc90a6c08f4df435c93402849236c3fab4d27c7026c1d4dcb2602646dec9751e763dba37bdf8ff9406ad9e530ee5db382f413001aeb06a53ed9027d831179727b0865a8918da3edbebcf9b14ed44ce6cbaced4bb1bdb7f1447e6cc254b332051512bd7af426fb8f401378cd2bf5983ca01c64b92ecf032ea15d1721d03f482d7ce6e74fef6d55e702f46980c82b5a84031900b1c9e59e7c97fbec7e8f323a97a7e36cc88be0f1d45b7ff585ac54bd407b22b4154aacc8f6d7ebf48e1d814cc5ed20f8037e0a79715eef29be32806a1d58bb7c5da76f550aa3d8a1fbff0eb19ccb1a313d55cda56c9ec2ef29632387fe8d76e3c0468043e8f663f4860ee12bf2d5b0b7474d6e694f91e6dbe115974a3926f12fee5e438777cb6a932df8cd8bec4d073b931ba3bc832b68d9dd300741fa7bf8afc47ed2576f6936ba424663aab639c5ae4f5683423b4742bf1c978238f16cbe39d652de3fdb8befc848ad922222e04a4037c0713eb57a81a23f0c73473fc646cea306b4bcbc8862f8385ddfa9d4b7fa2c087e879683303ed5bdd3a062b3cf5b3a278a66d2a13f83f44f82ddf310ee074ab6a364597e899a0255dc164f31cc50846851df9ab48195ded7ea1b1d510bd7ee74d73faf36bc31ecfa268359046f4eb879f924009438b481c6cd7889a002ed5ee382bc9190da6fc026e479558e4475677e9aa9e3050e2765694dfc81f56e880b96e7160c980dd98edd3dfffffffffffffffff\",\n },\n };\n },\n});\n\n// node_modules/diffie-hellman/lib/dh.js\nvar require_dh = __commonJS({\n \"node_modules/diffie-hellman/lib/dh.js\"(exports, module) {\n var BN = require_bn(),\n MillerRabin = require_mr(),\n millerRabin = new MillerRabin(),\n TWENTYFOUR = new BN(24),\n ELEVEN = new BN(11),\n TEN = new BN(10),\n THREE = new BN(3),\n SEVEN = new BN(7),\n primes = require_generatePrime(),\n randomBytes = require_browser();\n module.exports = DH;\n function setPublicKey(pub, enc) {\n return (\n (enc = enc || \"utf8\"), Buffer.isBuffer(pub) || (pub = new Buffer(pub, enc)), (this._pub = new BN(pub)), this\n );\n }\n function setPrivateKey(priv, enc) {\n return (\n (enc = enc || \"utf8\"),\n Buffer.isBuffer(priv) || (priv = new Buffer(priv, enc)),\n (this._priv = new BN(priv)),\n this\n );\n }\n var primeCache = {};\n function checkPrime(prime, generator) {\n var gen = generator.toString(\"hex\"),\n hex = [gen, prime.toString(16)].join(\"_\");\n if (hex in primeCache) return primeCache[hex];\n var error = 0;\n if (prime.isEven() || !primes.simpleSieve || !primes.fermatTest(prime) || !millerRabin.test(prime))\n return (\n (error += 1), gen === \"02\" || gen === \"05\" ? (error += 8) : (error += 4), (primeCache[hex] = error), error\n );\n millerRabin.test(prime.shrn(1)) || (error += 2);\n var rem;\n switch (gen) {\n case \"02\":\n prime.mod(TWENTYFOUR).cmp(ELEVEN) && (error += 8);\n break;\n case \"05\":\n (rem = prime.mod(TEN)), rem.cmp(THREE) && rem.cmp(SEVEN) && (error += 8);\n break;\n default:\n error += 4;\n }\n return (primeCache[hex] = error), error;\n }\n function DH(prime, generator, malleable) {\n this.setGenerator(generator),\n (this.__prime = new BN(prime)),\n (this._prime = BN.mont(this.__prime)),\n (this._primeLen = prime.length),\n (this._pub = void 0),\n (this._priv = void 0),\n (this._primeCode = void 0),\n malleable ? ((this.setPublicKey = setPublicKey), (this.setPrivateKey = setPrivateKey)) : (this._primeCode = 8);\n }\n Object.defineProperty(DH.prototype, \"verifyError\", {\n enumerable: !0,\n get: function () {\n return (\n typeof this._primeCode != \"number\" && (this._primeCode = checkPrime(this.__prime, this.__gen)),\n this._primeCode\n );\n },\n });\n DH.prototype.generateKeys = function () {\n return (\n this._priv || (this._priv = new BN(randomBytes(this._primeLen))),\n (this._pub = this._gen.toRed(this._prime).redPow(this._priv).fromRed()),\n this.getPublicKey()\n );\n };\n DH.prototype.computeSecret = function (other) {\n (other = new BN(other)), (other = other.toRed(this._prime));\n var secret = other.redPow(this._priv).fromRed(),\n out = new Buffer(secret.toArray()),\n prime = this.getPrime();\n if (out.length < prime.length) {\n var front = new Buffer(prime.length - out.length);\n front.fill(0), (out = Buffer.concat([front, out]));\n }\n return out;\n };\n DH.prototype.getPublicKey = function (enc) {\n return formatReturnValue(this._pub, enc);\n };\n DH.prototype.getPrivateKey = function (enc) {\n return formatReturnValue(this._priv, enc);\n };\n DH.prototype.getPrime = function (enc) {\n return formatReturnValue(this.__prime, enc);\n };\n DH.prototype.getGenerator = function (enc) {\n return formatReturnValue(this._gen, enc);\n };\n DH.prototype.setGenerator = function (gen, enc) {\n return (\n (enc = enc || \"utf8\"),\n Buffer.isBuffer(gen) || (gen = new Buffer(gen, enc)),\n (this.__gen = gen),\n (this._gen = new BN(gen)),\n this\n );\n };\n function formatReturnValue(bn, enc) {\n var buf = new Buffer(bn.toArray());\n return enc ? buf.toString(enc) : buf;\n }\n },\n});\n\n// node_modules/diffie-hellman/browser.js\nvar require_browser7 = __commonJS({\n \"node_modules/diffie-hellman/browser.js\"(exports) {\n var generatePrime = require_generatePrime(),\n primes = require_primes(),\n DH = require_dh();\n function getDiffieHellman(mod) {\n var prime = new Buffer(primes[mod].prime, \"hex\"),\n gen = new Buffer(primes[mod].gen, \"hex\");\n return new DH(prime, gen);\n }\n var ENCODINGS = {\n binary: !0,\n hex: !0,\n base64: !0,\n };\n function createDiffieHellman(prime, enc, generator, genc) {\n return Buffer.isBuffer(enc) || ENCODINGS[enc] === void 0\n ? createDiffieHellman(prime, \"binary\", enc, generator)\n : ((enc = enc || \"binary\"),\n (genc = genc || \"binary\"),\n (generator = generator || new Buffer([2])),\n Buffer.isBuffer(generator) || (generator = new Buffer(generator, genc)),\n typeof prime == \"number\"\n ? new DH(generatePrime(prime, generator), generator, !0)\n : (Buffer.isBuffer(prime) || (prime = new Buffer(prime, enc)), new DH(prime, generator, !0)));\n }\n exports.DiffieHellmanGroup = exports.createDiffieHellmanGroup = exports.getDiffieHellman = getDiffieHellman;\n exports.createDiffieHellman = exports.DiffieHellman = createDiffieHellman;\n },\n});\n\n// node_modules/bn.js/lib/bn.js\nvar require_bn3 = __commonJS({\n \"node_modules/bn.js/lib/bn.js\"(exports, module) {\n (function (module2, exports2) {\n \"use strict\";\n function assert(val, msg) {\n if (!val) throw new Error(msg || \"Assertion failed\");\n }\n function inherits(ctor, superCtor) {\n ctor.super_ = superCtor;\n var TempCtor = function () {};\n (TempCtor.prototype = superCtor.prototype),\n (ctor.prototype = new TempCtor()),\n (ctor.prototype.constructor = ctor);\n }\n function BN(number, base, endian) {\n if (BN.isBN(number)) return number;\n (this.negative = 0),\n (this.words = null),\n (this.length = 0),\n (this.red = null),\n number !== null &&\n ((base === \"le\" || base === \"be\") && ((endian = base), (base = 10)),\n this._init(number || 0, base || 10, endian || \"be\"));\n }\n typeof module2 == \"object\" ? (module2.exports = BN) : (exports2.BN = BN), (BN.BN = BN), (BN.wordSize = 26);\n var Buffer2;\n try {\n typeof window < \"u\" && typeof window.Buffer < \"u\"\n ? (Buffer2 = window.Buffer)\n : (Buffer2 = __require(\"buffer\").Buffer);\n } catch {}\n (BN.isBN = function (num) {\n return num instanceof BN\n ? !0\n : num !== null &&\n typeof num == \"object\" &&\n num.constructor.wordSize === BN.wordSize &&\n Array.isArray(num.words);\n }),\n (BN.max = function (left, right) {\n return left.cmp(right) > 0 ? left : right;\n }),\n (BN.min = function (left, right) {\n return left.cmp(right) < 0 ? left : right;\n }),\n (BN.prototype._init = function (number, base, endian) {\n if (typeof number == \"number\") return this._initNumber(number, base, endian);\n if (typeof number == \"object\") return this._initArray(number, base, endian);\n base === \"hex\" && (base = 16),\n assert(base === (base | 0) && base >= 2 && base <= 36),\n (number = number.toString().replace(/\\s+/g, \"\"));\n var start = 0;\n number[0] === \"-\" && (start++, (this.negative = 1)),\n start < number.length &&\n (base === 16\n ? this._parseHex(number, start, endian)\n : (this._parseBase(number, base, start),\n endian === \"le\" && this._initArray(this.toArray(), base, endian)));\n }),\n (BN.prototype._initNumber = function (number, base, endian) {\n number < 0 && ((this.negative = 1), (number = -number)),\n number < 67108864\n ? ((this.words = [number & 67108863]), (this.length = 1))\n : number < 4503599627370496\n ? ((this.words = [number & 67108863, (number / 67108864) & 67108863]), (this.length = 2))\n : (assert(number < 9007199254740992),\n (this.words = [number & 67108863, (number / 67108864) & 67108863, 1]),\n (this.length = 3)),\n endian === \"le\" && this._initArray(this.toArray(), base, endian);\n }),\n (BN.prototype._initArray = function (number, base, endian) {\n if ((assert(typeof number.length == \"number\"), number.length <= 0))\n return (this.words = [0]), (this.length = 1), this;\n (this.length = Math.ceil(number.length / 3)), (this.words = new Array(this.length));\n for (var i = 0; i < this.length; i++) this.words[i] = 0;\n var j,\n w,\n off = 0;\n if (endian === \"be\")\n for (i = number.length - 1, j = 0; i >= 0; i -= 3)\n (w = number[i] | (number[i - 1] << 8) | (number[i - 2] << 16)),\n (this.words[j] |= (w << off) & 67108863),\n (this.words[j + 1] = (w >>> (26 - off)) & 67108863),\n (off += 24),\n off >= 26 && ((off -= 26), j++);\n else if (endian === \"le\")\n for (i = 0, j = 0; i < number.length; i += 3)\n (w = number[i] | (number[i + 1] << 8) | (number[i + 2] << 16)),\n (this.words[j] |= (w << off) & 67108863),\n (this.words[j + 1] = (w >>> (26 - off)) & 67108863),\n (off += 24),\n off >= 26 && ((off -= 26), j++);\n return this._strip();\n });\n function parseHex4Bits(string, index) {\n var c = string.charCodeAt(index);\n if (c >= 48 && c <= 57) return c - 48;\n if (c >= 65 && c <= 70) return c - 55;\n if (c >= 97 && c <= 102) return c - 87;\n assert(!1, \"Invalid character in \" + string);\n }\n function parseHexByte(string, lowerBound, index) {\n var r = parseHex4Bits(string, index);\n return index - 1 >= lowerBound && (r |= parseHex4Bits(string, index - 1) << 4), r;\n }\n BN.prototype._parseHex = function (number, start, endian) {\n (this.length = Math.ceil((number.length - start) / 6)), (this.words = new Array(this.length));\n for (var i = 0; i < this.length; i++) this.words[i] = 0;\n var off = 0,\n j = 0,\n w;\n if (endian === \"be\")\n for (i = number.length - 1; i >= start; i -= 2)\n (w = parseHexByte(number, start, i) << off),\n (this.words[j] |= w & 67108863),\n off >= 18 ? ((off -= 18), (j += 1), (this.words[j] |= w >>> 26)) : (off += 8);\n else {\n var parseLength = number.length - start;\n for (i = parseLength % 2 === 0 ? start + 1 : start; i < number.length; i += 2)\n (w = parseHexByte(number, start, i) << off),\n (this.words[j] |= w & 67108863),\n off >= 18 ? ((off -= 18), (j += 1), (this.words[j] |= w >>> 26)) : (off += 8);\n }\n this._strip();\n };\n function parseBase(str, start, end, mul) {\n for (var r = 0, b = 0, len = Math.min(str.length, end), i = start; i < len; i++) {\n var c = str.charCodeAt(i) - 48;\n (r *= mul),\n c >= 49 ? (b = c - 49 + 10) : c >= 17 ? (b = c - 17 + 10) : (b = c),\n assert(c >= 0 && b < mul, \"Invalid character\"),\n (r += b);\n }\n return r;\n }\n (BN.prototype._parseBase = function (number, base, start) {\n (this.words = [0]), (this.length = 1);\n for (var limbLen = 0, limbPow = 1; limbPow <= 67108863; limbPow *= base) limbLen++;\n limbLen--, (limbPow = (limbPow / base) | 0);\n for (\n var total = number.length - start,\n mod = total % limbLen,\n end = Math.min(total, total - mod) + start,\n word = 0,\n i = start;\n i < end;\n i += limbLen\n )\n (word = parseBase(number, i, i + limbLen, base)),\n this.imuln(limbPow),\n this.words[0] + word < 67108864 ? (this.words[0] += word) : this._iaddn(word);\n if (mod !== 0) {\n var pow = 1;\n for (word = parseBase(number, i, number.length, base), i = 0; i < mod; i++) pow *= base;\n this.imuln(pow), this.words[0] + word < 67108864 ? (this.words[0] += word) : this._iaddn(word);\n }\n this._strip();\n }),\n (BN.prototype.copy = function (dest) {\n dest.words = new Array(this.length);\n for (var i = 0; i < this.length; i++) dest.words[i] = this.words[i];\n (dest.length = this.length), (dest.negative = this.negative), (dest.red = this.red);\n });\n function move(dest, src) {\n (dest.words = src.words), (dest.length = src.length), (dest.negative = src.negative), (dest.red = src.red);\n }\n if (\n ((BN.prototype._move = function (dest) {\n move(dest, this);\n }),\n (BN.prototype.clone = function () {\n var r = new BN(null);\n return this.copy(r), r;\n }),\n (BN.prototype._expand = function (size) {\n for (; this.length < size; ) this.words[this.length++] = 0;\n return this;\n }),\n (BN.prototype._strip = function () {\n for (; this.length > 1 && this.words[this.length - 1] === 0; ) this.length--;\n return this._normSign();\n }),\n (BN.prototype._normSign = function () {\n return this.length === 1 && this.words[0] === 0 && (this.negative = 0), this;\n }),\n typeof Symbol < \"u\" && typeof Symbol.for == \"function\")\n )\n try {\n BN.prototype[Symbol.for(\"nodejs.util.inspect.custom\")] = inspect;\n } catch {\n BN.prototype.inspect = inspect;\n }\n else BN.prototype.inspect = inspect;\n function inspect() {\n return (this.red ? \"<BN-R: \" : \"<BN: \") + this.toString(16) + \">\";\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 groupSizes = [\n 0, 0, 25, 16, 12, 11, 10, 9, 8, 8, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5,\n 5, 5,\n ],\n groupBases = [\n 0, 0, 33554432, 43046721, 16777216, 48828125, 60466176, 40353607, 16777216, 43046721, 1e7, 19487171, 35831808,\n 62748517, 7529536, 11390625, 16777216, 24137569, 34012224, 47045881, 64e6, 4084101, 5153632, 6436343, 7962624,\n 9765625, 11881376, 14348907, 17210368, 20511149, 243e5, 28629151, 33554432, 39135393, 45435424, 52521875,\n 60466176,\n ];\n (BN.prototype.toString = function (base, padding) {\n (base = base || 10), (padding = padding | 0 || 1);\n var out;\n if (base === 16 || base === \"hex\") {\n out = \"\";\n for (var off = 0, carry = 0, i = 0; i < this.length; i++) {\n var w = this.words[i],\n word = (((w << off) | carry) & 16777215).toString(16);\n (carry = (w >>> (24 - off)) & 16777215),\n (off += 2),\n off >= 26 && ((off -= 26), i--),\n carry !== 0 || i !== this.length - 1 ? (out = zeros[6 - word.length] + word + out) : (out = word + out);\n }\n for (carry !== 0 && (out = carry.toString(16) + out); out.length % padding !== 0; ) out = \"0\" + out;\n return this.negative !== 0 && (out = \"-\" + out), out;\n }\n if (base === (base | 0) && base >= 2 && base <= 36) {\n var groupSize = groupSizes[base],\n groupBase = groupBases[base];\n out = \"\";\n var c = this.clone();\n for (c.negative = 0; !c.isZero(); ) {\n var r = c.modrn(groupBase).toString(base);\n (c = c.idivn(groupBase)), c.isZero() ? (out = r + out) : (out = zeros[groupSize - r.length] + r + out);\n }\n for (this.isZero() && (out = \"0\" + out); out.length % padding !== 0; ) out = \"0\" + out;\n return this.negative !== 0 && (out = \"-\" + out), out;\n }\n assert(!1, \"Base should be between 2 and 36\");\n }),\n (BN.prototype.toNumber = function () {\n var ret = this.words[0];\n return (\n this.length === 2\n ? (ret += this.words[1] * 67108864)\n : this.length === 3 && this.words[2] === 1\n ? (ret += 4503599627370496 + this.words[1] * 67108864)\n : this.length > 2 && assert(!1, \"Number can only safely store up to 53 bits\"),\n this.negative !== 0 ? -ret : ret\n );\n }),\n (BN.prototype.toJSON = function () {\n return this.toString(16, 2);\n }),\n Buffer2 &&\n (BN.prototype.toBuffer = function (endian, length) {\n return this.toArrayLike(Buffer2, endian, length);\n }),\n (BN.prototype.toArray = function (endian, length) {\n return this.toArrayLike(Array, endian, length);\n });\n var allocate = function (ArrayType, size) {\n return ArrayType.allocUnsafe ? ArrayType.allocUnsafe(size) : new ArrayType(size);\n };\n (BN.prototype.toArrayLike = function (ArrayType, endian, length) {\n this._strip();\n var byteLength = this.byteLength(),\n 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 var res = allocate(ArrayType, reqLength),\n postfix = endian === \"le\" ? \"LE\" : \"BE\";\n return this[\"_toArrayLike\" + postfix](res, byteLength), res;\n }),\n (BN.prototype._toArrayLikeLE = function (res, byteLength) {\n for (var position = 0, carry = 0, i = 0, shift = 0; i < this.length; i++) {\n var word = (this.words[i] << shift) | carry;\n (res[position++] = word & 255),\n position < res.length && (res[position++] = (word >> 8) & 255),\n position < res.length && (res[position++] = (word >> 16) & 255),\n shift === 6\n ? (position < res.length && (res[position++] = (word >> 24) & 255), (carry = 0), (shift = 0))\n : ((carry = word >>> 24), (shift += 2));\n }\n if (position < res.length) for (res[position++] = carry; position < res.length; ) res[position++] = 0;\n }),\n (BN.prototype._toArrayLikeBE = function (res, byteLength) {\n for (var position = res.length - 1, carry = 0, i = 0, shift = 0; i < this.length; i++) {\n var word = (this.words[i] << shift) | carry;\n (res[position--] = word & 255),\n position >= 0 && (res[position--] = (word >> 8) & 255),\n position >= 0 && (res[position--] = (word >> 16) & 255),\n shift === 6\n ? (position >= 0 && (res[position--] = (word >> 24) & 255), (carry = 0), (shift = 0))\n : ((carry = word >>> 24), (shift += 2));\n }\n if (position >= 0) for (res[position--] = carry; position >= 0; ) res[position--] = 0;\n }),\n Math.clz32\n ? (BN.prototype._countBits = function (w) {\n return 32 - Math.clz32(w);\n })\n : (BN.prototype._countBits = function (w) {\n var t = w,\n r = 0;\n return (\n t >= 4096 && ((r += 13), (t >>>= 13)),\n t >= 64 && ((r += 7), (t >>>= 7)),\n t >= 8 && ((r += 4), (t >>>= 4)),\n t >= 2 && ((r += 2), (t >>>= 2)),\n r + t\n );\n }),\n (BN.prototype._zeroBits = function (w) {\n if (w === 0) return 26;\n var t = w,\n r = 0;\n return (\n (t & 8191) === 0 && ((r += 13), (t >>>= 13)),\n (t & 127) === 0 && ((r += 7), (t >>>= 7)),\n (t & 15) === 0 && ((r += 4), (t >>>= 4)),\n (t & 3) === 0 && ((r += 2), (t >>>= 2)),\n (t & 1) === 0 && r++,\n r\n );\n }),\n (BN.prototype.bitLength = function () {\n var w = this.words[this.length - 1],\n hi = this._countBits(w);\n return (this.length - 1) * 26 + hi;\n });\n function toBitArray(num) {\n for (var w = new Array(num.bitLength()), bit = 0; bit < w.length; bit++) {\n var off = (bit / 26) | 0,\n wbit = bit % 26;\n w[bit] = (num.words[off] >>> wbit) & 1;\n }\n return w;\n }\n (BN.prototype.zeroBits = function () {\n if (this.isZero()) return 0;\n for (var r = 0, i = 0; i < this.length; i++) {\n var b = this._zeroBits(this.words[i]);\n if (((r += b), b !== 26)) break;\n }\n return r;\n }),\n (BN.prototype.byteLength = function () {\n return Math.ceil(this.bitLength() / 8);\n }),\n (BN.prototype.toTwos = function (width) {\n return this.negative !== 0 ? this.abs().inotn(width).iaddn(1) : this.clone();\n }),\n (BN.prototype.fromTwos = function (width) {\n return this.testn(width - 1) ? this.notn(width).iaddn(1).ineg() : this.clone();\n }),\n (BN.prototype.isNeg = function () {\n return this.negative !== 0;\n }),\n (BN.prototype.neg = function () {\n return this.clone().ineg();\n }),\n (BN.prototype.ineg = function () {\n return this.isZero() || (this.negative ^= 1), this;\n }),\n (BN.prototype.iuor = function (num) {\n for (; this.length < num.length; ) this.words[this.length++] = 0;\n for (var i = 0; i < num.length; i++) this.words[i] = this.words[i] | num.words[i];\n return this._strip();\n }),\n (BN.prototype.ior = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuor(num);\n }),\n (BN.prototype.or = function (num) {\n return this.length > num.length ? this.clone().ior(num) : num.clone().ior(this);\n }),\n (BN.prototype.uor = function (num) {\n return this.length > num.length ? this.clone().iuor(num) : num.clone().iuor(this);\n }),\n (BN.prototype.iuand = function (num) {\n var b;\n this.length > num.length ? (b = num) : (b = this);\n for (var i = 0; i < b.length; i++) this.words[i] = this.words[i] & num.words[i];\n return (this.length = b.length), this._strip();\n }),\n (BN.prototype.iand = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuand(num);\n }),\n (BN.prototype.and = function (num) {\n return this.length > num.length ? this.clone().iand(num) : num.clone().iand(this);\n }),\n (BN.prototype.uand = function (num) {\n return this.length > num.length ? this.clone().iuand(num) : num.clone().iuand(this);\n }),\n (BN.prototype.iuxor = function (num) {\n var a, b;\n this.length > num.length ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var i = 0; i < b.length; i++) this.words[i] = a.words[i] ^ b.words[i];\n if (this !== a) for (; i < a.length; i++) this.words[i] = a.words[i];\n return (this.length = a.length), this._strip();\n }),\n (BN.prototype.ixor = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuxor(num);\n }),\n (BN.prototype.xor = function (num) {\n return this.length > num.length ? this.clone().ixor(num) : num.clone().ixor(this);\n }),\n (BN.prototype.uxor = function (num) {\n return this.length > num.length ? this.clone().iuxor(num) : num.clone().iuxor(this);\n }),\n (BN.prototype.inotn = function (width) {\n assert(typeof width == \"number\" && width >= 0);\n var bytesNeeded = Math.ceil(width / 26) | 0,\n bitsLeft = width % 26;\n this._expand(bytesNeeded), bitsLeft > 0 && bytesNeeded--;\n for (var i = 0; i < bytesNeeded; i++) this.words[i] = ~this.words[i] & 67108863;\n return bitsLeft > 0 && (this.words[i] = ~this.words[i] & (67108863 >> (26 - bitsLeft))), this._strip();\n }),\n (BN.prototype.notn = function (width) {\n return this.clone().inotn(width);\n }),\n (BN.prototype.setn = function (bit, val) {\n assert(typeof bit == \"number\" && bit >= 0);\n var off = (bit / 26) | 0,\n wbit = bit % 26;\n return (\n this._expand(off + 1),\n val\n ? (this.words[off] = this.words[off] | (1 << wbit))\n : (this.words[off] = this.words[off] & ~(1 << wbit)),\n this._strip()\n );\n }),\n (BN.prototype.iadd = function (num) {\n var r;\n if (this.negative !== 0 && num.negative === 0)\n return (this.negative = 0), (r = this.isub(num)), (this.negative ^= 1), this._normSign();\n if (this.negative === 0 && num.negative !== 0)\n return (num.negative = 0), (r = this.isub(num)), (num.negative = 1), r._normSign();\n var a, b;\n this.length > num.length ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var carry = 0, i = 0; i < b.length; i++)\n (r = (a.words[i] | 0) + (b.words[i] | 0) + carry), (this.words[i] = r & 67108863), (carry = r >>> 26);\n for (; carry !== 0 && i < a.length; i++)\n (r = (a.words[i] | 0) + carry), (this.words[i] = r & 67108863), (carry = r >>> 26);\n if (((this.length = a.length), carry !== 0)) (this.words[this.length] = carry), this.length++;\n else if (a !== this) for (; i < a.length; i++) this.words[i] = a.words[i];\n return this;\n }),\n (BN.prototype.add = function (num) {\n var res;\n return num.negative !== 0 && this.negative === 0\n ? ((num.negative = 0), (res = this.sub(num)), (num.negative ^= 1), res)\n : num.negative === 0 && this.negative !== 0\n ? ((this.negative = 0), (res = num.sub(this)), (this.negative = 1), res)\n : this.length > num.length\n ? this.clone().iadd(num)\n : num.clone().iadd(this);\n }),\n (BN.prototype.isub = function (num) {\n if (num.negative !== 0) {\n num.negative = 0;\n var r = this.iadd(num);\n return (num.negative = 1), r._normSign();\n } else if (this.negative !== 0)\n return (this.negative = 0), this.iadd(num), (this.negative = 1), this._normSign();\n var cmp = this.cmp(num);\n if (cmp === 0) return (this.negative = 0), (this.length = 1), (this.words[0] = 0), this;\n var a, b;\n cmp > 0 ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var carry = 0, i = 0; i < b.length; i++)\n (r = (a.words[i] | 0) - (b.words[i] | 0) + carry), (carry = r >> 26), (this.words[i] = r & 67108863);\n for (; carry !== 0 && i < a.length; i++)\n (r = (a.words[i] | 0) + carry), (carry = r >> 26), (this.words[i] = r & 67108863);\n if (carry === 0 && i < a.length && a !== this) for (; i < a.length; i++) this.words[i] = a.words[i];\n return (this.length = Math.max(this.length, i)), a !== this && (this.negative = 1), this._strip();\n }),\n (BN.prototype.sub = function (num) {\n return this.clone().isub(num);\n });\n function smallMulTo(self2, num, out) {\n out.negative = num.negative ^ self2.negative;\n var len = (self2.length + num.length) | 0;\n (out.length = len), (len = (len - 1) | 0);\n var a = self2.words[0] | 0,\n b = num.words[0] | 0,\n r = a * b,\n lo = r & 67108863,\n carry = (r / 67108864) | 0;\n out.words[0] = lo;\n for (var k = 1; k < len; k++) {\n for (\n var ncarry = carry >>> 26,\n rword = carry & 67108863,\n maxJ = Math.min(k, num.length - 1),\n j = Math.max(0, k - self2.length + 1);\n j <= maxJ;\n j++\n ) {\n var i = (k - j) | 0;\n (a = self2.words[i] | 0),\n (b = num.words[j] | 0),\n (r = a * b + rword),\n (ncarry += (r / 67108864) | 0),\n (rword = r & 67108863);\n }\n (out.words[k] = rword | 0), (carry = ncarry | 0);\n }\n return carry !== 0 ? (out.words[k] = carry | 0) : out.length--, out._strip();\n }\n var comb10MulTo = function (self2, num, out) {\n var a = self2.words,\n b = num.words,\n o = out.words,\n c = 0,\n lo,\n mid,\n hi,\n a0 = a[0] | 0,\n al0 = a0 & 8191,\n ah0 = a0 >>> 13,\n a1 = a[1] | 0,\n al1 = a1 & 8191,\n ah1 = a1 >>> 13,\n a2 = a[2] | 0,\n al2 = a2 & 8191,\n ah2 = a2 >>> 13,\n a3 = a[3] | 0,\n al3 = a3 & 8191,\n ah3 = a3 >>> 13,\n a4 = a[4] | 0,\n al4 = a4 & 8191,\n ah4 = a4 >>> 13,\n a5 = a[5] | 0,\n al5 = a5 & 8191,\n ah5 = a5 >>> 13,\n a6 = a[6] | 0,\n al6 = a6 & 8191,\n ah6 = a6 >>> 13,\n a7 = a[7] | 0,\n al7 = a7 & 8191,\n ah7 = a7 >>> 13,\n a8 = a[8] | 0,\n al8 = a8 & 8191,\n ah8 = a8 >>> 13,\n a9 = a[9] | 0,\n al9 = a9 & 8191,\n ah9 = a9 >>> 13,\n b0 = b[0] | 0,\n bl0 = b0 & 8191,\n bh0 = b0 >>> 13,\n b1 = b[1] | 0,\n bl1 = b1 & 8191,\n bh1 = b1 >>> 13,\n b2 = b[2] | 0,\n bl2 = b2 & 8191,\n bh2 = b2 >>> 13,\n b3 = b[3] | 0,\n bl3 = b3 & 8191,\n bh3 = b3 >>> 13,\n b4 = b[4] | 0,\n bl4 = b4 & 8191,\n bh4 = b4 >>> 13,\n b5 = b[5] | 0,\n bl5 = b5 & 8191,\n bh5 = b5 >>> 13,\n b6 = b[6] | 0,\n bl6 = b6 & 8191,\n bh6 = b6 >>> 13,\n b7 = b[7] | 0,\n bl7 = b7 & 8191,\n bh7 = b7 >>> 13,\n b8 = b[8] | 0,\n bl8 = b8 & 8191,\n bh8 = b8 >>> 13,\n b9 = b[9] | 0,\n bl9 = b9 & 8191,\n bh9 = b9 >>> 13;\n (out.negative = self2.negative ^ num.negative),\n (out.length = 19),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w0 >>> 26)) | 0),\n (w0 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w1 >>> 26)) | 0),\n (w1 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w2 >>> 26)) | 0),\n (w2 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w3 >>> 26)) | 0),\n (w3 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w4 >>> 26)) | 0),\n (w4 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w5 >>> 26)) | 0),\n (w5 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w6 >>> 26)) | 0),\n (w6 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w7 >>> 26)) | 0),\n (w7 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w8 >>> 26)) | 0),\n (w8 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w9 >>> 26)) | 0),\n (w9 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w10 >>> 26)) | 0),\n (w10 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w11 >>> 26)) | 0),\n (w11 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w12 >>> 26)) | 0),\n (w12 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w13 >>> 26)) | 0),\n (w13 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w14 >>> 26)) | 0),\n (w14 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w15 >>> 26)) | 0),\n (w15 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w16 >>> 26)) | 0),\n (w16 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w17 >>> 26)) | 0),\n (w17 &= 67108863),\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 & 8191) << 13)) | 0;\n return (\n (c = (((hi + (mid >>> 13)) | 0) + (w18 >>> 26)) | 0),\n (w18 &= 67108863),\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 c !== 0 && ((o[19] = c), out.length++),\n out\n );\n };\n Math.imul || (comb10MulTo = smallMulTo);\n function bigMulTo(self2, num, out) {\n (out.negative = num.negative ^ self2.negative), (out.length = self2.length + num.length);\n for (var carry = 0, hncarry = 0, k = 0; k < out.length - 1; k++) {\n var ncarry = hncarry;\n hncarry = 0;\n for (\n var rword = carry & 67108863, maxJ = Math.min(k, num.length - 1), j = Math.max(0, k - self2.length + 1);\n j <= maxJ;\n j++\n ) {\n var i = k - j,\n a = self2.words[i] | 0,\n b = num.words[j] | 0,\n r = a * b,\n lo = r & 67108863;\n (ncarry = (ncarry + ((r / 67108864) | 0)) | 0),\n (lo = (lo + rword) | 0),\n (rword = lo & 67108863),\n (ncarry = (ncarry + (lo >>> 26)) | 0),\n (hncarry += ncarry >>> 26),\n (ncarry &= 67108863);\n }\n (out.words[k] = rword), (carry = ncarry), (ncarry = hncarry);\n }\n return carry !== 0 ? (out.words[k] = carry) : out.length--, out._strip();\n }\n function jumboMulTo(self2, num, out) {\n return bigMulTo(self2, num, out);\n }\n BN.prototype.mulTo = function (num, out) {\n var res,\n len = this.length + num.length;\n return (\n this.length === 10 && num.length === 10\n ? (res = comb10MulTo(this, num, out))\n : len < 63\n ? (res = smallMulTo(this, num, out))\n : len < 1024\n ? (res = bigMulTo(this, num, out))\n : (res = jumboMulTo(this, num, out)),\n res\n );\n };\n function FFTM(x, y) {\n (this.x = x), (this.y = y);\n }\n (FFTM.prototype.makeRBT = function (N) {\n for (var t = new Array(N), l = BN.prototype._countBits(N) - 1, i = 0; i < N; i++) t[i] = this.revBin(i, l, N);\n return t;\n }),\n (FFTM.prototype.revBin = function (x, l, N) {\n if (x === 0 || x === N - 1) return x;\n for (var rb = 0, i = 0; i < l; i++) (rb |= (x & 1) << (l - i - 1)), (x >>= 1);\n return rb;\n }),\n (FFTM.prototype.permute = function (rbt, rws, iws, rtws, itws, N) {\n for (var i = 0; i < N; i++) (rtws[i] = rws[rbt[i]]), (itws[i] = iws[rbt[i]]);\n }),\n (FFTM.prototype.transform = function (rws, iws, rtws, itws, N, rbt) {\n this.permute(rbt, rws, iws, rtws, itws, N);\n for (var s = 1; s < N; s <<= 1)\n for (\n var l = s << 1, rtwdf = Math.cos((2 * Math.PI) / l), itwdf = Math.sin((2 * Math.PI) / l), p = 0;\n p < N;\n p += l\n )\n for (var rtwdf_ = rtwdf, itwdf_ = itwdf, j = 0; j < s; j++) {\n var re = rtws[p + j],\n ie = itws[p + j],\n ro = rtws[p + j + s],\n io = itws[p + j + s],\n rx = rtwdf_ * ro - itwdf_ * io;\n (io = rtwdf_ * io + itwdf_ * ro),\n (ro = rx),\n (rtws[p + j] = re + ro),\n (itws[p + j] = ie + io),\n (rtws[p + j + s] = re - ro),\n (itws[p + j + s] = ie - io),\n j !== l &&\n ((rx = rtwdf * rtwdf_ - itwdf * itwdf_), (itwdf_ = rtwdf * itwdf_ + itwdf * rtwdf_), (rtwdf_ = rx));\n }\n }),\n (FFTM.prototype.guessLen13b = function (n, m) {\n var N = Math.max(m, n) | 1,\n odd = N & 1,\n i = 0;\n for (N = (N / 2) | 0; N; N = N >>> 1) i++;\n return 1 << (i + 1 + odd);\n }),\n (FFTM.prototype.conjugate = function (rws, iws, N) {\n if (!(N <= 1))\n for (var i = 0; i < N / 2; i++) {\n var t = rws[i];\n (rws[i] = rws[N - i - 1]),\n (rws[N - i - 1] = t),\n (t = iws[i]),\n (iws[i] = -iws[N - i - 1]),\n (iws[N - i - 1] = -t);\n }\n }),\n (FFTM.prototype.normalize13b = function (ws, N) {\n for (var carry = 0, i = 0; i < N / 2; i++) {\n var w = Math.round(ws[2 * i + 1] / N) * 8192 + Math.round(ws[2 * i] / N) + carry;\n (ws[i] = w & 67108863), w < 67108864 ? (carry = 0) : (carry = (w / 67108864) | 0);\n }\n return ws;\n }),\n (FFTM.prototype.convert13b = function (ws, len, rws, N) {\n for (var carry = 0, i = 0; i < len; i++)\n (carry = carry + (ws[i] | 0)),\n (rws[2 * i] = carry & 8191),\n (carry = carry >>> 13),\n (rws[2 * i + 1] = carry & 8191),\n (carry = carry >>> 13);\n for (i = 2 * len; i < N; ++i) rws[i] = 0;\n assert(carry === 0), assert((carry & -8192) === 0);\n }),\n (FFTM.prototype.stub = function (N) {\n for (var ph = new Array(N), i = 0; i < N; i++) ph[i] = 0;\n return ph;\n }),\n (FFTM.prototype.mulp = function (x, y, out) {\n var N = 2 * this.guessLen13b(x.length, y.length),\n rbt = this.makeRBT(N),\n _ = this.stub(N),\n rws = new Array(N),\n rwst = new Array(N),\n iwst = new Array(N),\n nrws = new Array(N),\n nrwst = new Array(N),\n niwst = new Array(N),\n rmws = out.words;\n (rmws.length = N),\n this.convert13b(x.words, x.length, rws, N),\n this.convert13b(y.words, y.length, nrws, N),\n this.transform(rws, _, rwst, iwst, N, rbt),\n this.transform(nrws, _, nrwst, niwst, N, rbt);\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]), (rwst[i] = rx);\n }\n return (\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 (out.negative = x.negative ^ y.negative),\n (out.length = x.length + y.length),\n out._strip()\n );\n }),\n (BN.prototype.mul = function (num) {\n var out = new BN(null);\n return (out.words = new Array(this.length + num.length)), this.mulTo(num, out);\n }),\n (BN.prototype.mulf = function (num) {\n var out = new BN(null);\n return (out.words = new Array(this.length + num.length)), jumboMulTo(this, num, out);\n }),\n (BN.prototype.imul = function (num) {\n return this.clone().mulTo(num, this);\n }),\n (BN.prototype.imuln = function (num) {\n var isNegNum = num < 0;\n isNegNum && (num = -num), assert(typeof num == \"number\"), assert(num < 67108864);\n for (var carry = 0, i = 0; i < this.length; i++) {\n var w = (this.words[i] | 0) * num,\n lo = (w & 67108863) + (carry & 67108863);\n (carry >>= 26), (carry += (w / 67108864) | 0), (carry += lo >>> 26), (this.words[i] = lo & 67108863);\n }\n return carry !== 0 && ((this.words[i] = carry), this.length++), isNegNum ? this.ineg() : this;\n }),\n (BN.prototype.muln = function (num) {\n return this.clone().imuln(num);\n }),\n (BN.prototype.sqr = function () {\n return this.mul(this);\n }),\n (BN.prototype.isqr = function () {\n return this.imul(this.clone());\n }),\n (BN.prototype.pow = function (num) {\n var w = toBitArray(num);\n if (w.length === 0) return new BN(1);\n for (var res = this, i = 0; i < w.length && w[i] === 0; i++, res = res.sqr());\n if (++i < w.length) for (var q = res.sqr(); i < w.length; i++, q = q.sqr()) w[i] !== 0 && (res = res.mul(q));\n return res;\n }),\n (BN.prototype.iushln = function (bits) {\n assert(typeof bits == \"number\" && bits >= 0);\n var r = bits % 26,\n s = (bits - r) / 26,\n carryMask = (67108863 >>> (26 - r)) << (26 - r),\n i;\n if (r !== 0) {\n var carry = 0;\n for (i = 0; i < this.length; i++) {\n var newCarry = this.words[i] & carryMask,\n c = ((this.words[i] | 0) - newCarry) << r;\n (this.words[i] = c | carry), (carry = newCarry >>> (26 - r));\n }\n carry && ((this.words[i] = carry), this.length++);\n }\n if (s !== 0) {\n for (i = this.length - 1; i >= 0; i--) this.words[i + s] = this.words[i];\n for (i = 0; i < s; i++) this.words[i] = 0;\n this.length += s;\n }\n return this._strip();\n }),\n (BN.prototype.ishln = function (bits) {\n return assert(this.negative === 0), this.iushln(bits);\n }),\n (BN.prototype.iushrn = function (bits, hint, extended) {\n assert(typeof bits == \"number\" && bits >= 0);\n var h;\n hint ? (h = (hint - (hint % 26)) / 26) : (h = 0);\n var r = bits % 26,\n s = Math.min((bits - r) / 26, this.length),\n mask = 67108863 ^ ((67108863 >>> r) << r),\n maskedWords = extended;\n if (((h -= s), (h = Math.max(0, h)), maskedWords)) {\n for (var i = 0; i < s; i++) maskedWords.words[i] = this.words[i];\n maskedWords.length = s;\n }\n if (s !== 0)\n if (this.length > s) for (this.length -= s, i = 0; i < this.length; i++) this.words[i] = this.words[i + s];\n else (this.words[0] = 0), (this.length = 1);\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)), (carry = word & mask);\n }\n return (\n maskedWords && carry !== 0 && (maskedWords.words[maskedWords.length++] = carry),\n this.length === 0 && ((this.words[0] = 0), (this.length = 1)),\n this._strip()\n );\n }),\n (BN.prototype.ishrn = function (bits, hint, extended) {\n return assert(this.negative === 0), this.iushrn(bits, hint, extended);\n }),\n (BN.prototype.shln = function (bits) {\n return this.clone().ishln(bits);\n }),\n (BN.prototype.ushln = function (bits) {\n return this.clone().iushln(bits);\n }),\n (BN.prototype.shrn = function (bits) {\n return this.clone().ishrn(bits);\n }),\n (BN.prototype.ushrn = function (bits) {\n return this.clone().iushrn(bits);\n }),\n (BN.prototype.testn = function (bit) {\n assert(typeof bit == \"number\" && bit >= 0);\n var r = bit % 26,\n s = (bit - r) / 26,\n q = 1 << r;\n if (this.length <= s) return !1;\n var w = this.words[s];\n return !!(w & q);\n }),\n (BN.prototype.imaskn = function (bits) {\n assert(typeof bits == \"number\" && bits >= 0);\n var r = bits % 26,\n s = (bits - r) / 26;\n if ((assert(this.negative === 0, \"imaskn works only with positive numbers\"), this.length <= s)) return this;\n if ((r !== 0 && s++, (this.length = Math.min(s, this.length)), r !== 0)) {\n var mask = 67108863 ^ ((67108863 >>> r) << r);\n this.words[this.length - 1] &= mask;\n }\n return this._strip();\n }),\n (BN.prototype.maskn = function (bits) {\n return this.clone().imaskn(bits);\n }),\n (BN.prototype.iaddn = function (num) {\n return (\n assert(typeof num == \"number\"),\n assert(num < 67108864),\n num < 0\n ? this.isubn(-num)\n : this.negative !== 0\n ? this.length === 1 && (this.words[0] | 0) <= num\n ? ((this.words[0] = num - (this.words[0] | 0)), (this.negative = 0), this)\n : ((this.negative = 0), this.isubn(num), (this.negative = 1), this)\n : this._iaddn(num)\n );\n }),\n (BN.prototype._iaddn = function (num) {\n this.words[0] += num;\n for (var i = 0; i < this.length && this.words[i] >= 67108864; i++)\n (this.words[i] -= 67108864), i === this.length - 1 ? (this.words[i + 1] = 1) : this.words[i + 1]++;\n return (this.length = Math.max(this.length, i + 1)), this;\n }),\n (BN.prototype.isubn = function (num) {\n if ((assert(typeof num == \"number\"), assert(num < 67108864), num < 0)) return this.iaddn(-num);\n if (this.negative !== 0) return (this.negative = 0), this.iaddn(num), (this.negative = 1), this;\n if (((this.words[0] -= num), this.length === 1 && this.words[0] < 0))\n (this.words[0] = -this.words[0]), (this.negative = 1);\n else\n for (var i = 0; i < this.length && this.words[i] < 0; i++)\n (this.words[i] += 67108864), (this.words[i + 1] -= 1);\n return this._strip();\n }),\n (BN.prototype.addn = function (num) {\n return this.clone().iaddn(num);\n }),\n (BN.prototype.subn = function (num) {\n return this.clone().isubn(num);\n }),\n (BN.prototype.iabs = function () {\n return (this.negative = 0), this;\n }),\n (BN.prototype.abs = function () {\n return this.clone().iabs();\n }),\n (BN.prototype._ishlnsubmul = function (num, mul, shift) {\n var len = num.length + shift,\n i;\n this._expand(len);\n var w,\n 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 & 67108863),\n (carry = (w >> 26) - ((right / 67108864) | 0)),\n (this.words[i + shift] = w & 67108863);\n }\n for (; i < this.length - shift; i++)\n (w = (this.words[i + shift] | 0) + carry), (carry = w >> 26), (this.words[i + shift] = w & 67108863);\n if (carry === 0) return this._strip();\n for (assert(carry === -1), carry = 0, i = 0; i < this.length; i++)\n (w = -(this.words[i] | 0) + carry), (carry = w >> 26), (this.words[i] = w & 67108863);\n return (this.negative = 1), this._strip();\n }),\n (BN.prototype._wordDiv = function (num, mode) {\n var shift = this.length - num.length,\n a = this.clone(),\n b = num,\n bhi = b.words[b.length - 1] | 0,\n bhiBits = this._countBits(bhi);\n (shift = 26 - bhiBits),\n shift !== 0 && ((b = b.ushln(shift)), a.iushln(shift), (bhi = b.words[b.length - 1] | 0));\n var m = a.length - b.length,\n q;\n if (mode !== \"mod\") {\n (q = new BN(null)), (q.length = m + 1), (q.words = new Array(q.length));\n for (var i = 0; i < q.length; i++) q.words[i] = 0;\n }\n var diff = a.clone()._ishlnsubmul(b, 1, m);\n diff.negative === 0 && ((a = diff), q && (q.words[m] = 1));\n for (var j = m - 1; j >= 0; j--) {\n var qj = (a.words[b.length + j] | 0) * 67108864 + (a.words[b.length + j - 1] | 0);\n for (qj = Math.min((qj / bhi) | 0, 67108863), a._ishlnsubmul(b, qj, j); a.negative !== 0; )\n qj--, (a.negative = 0), a._ishlnsubmul(b, 1, j), a.isZero() || (a.negative ^= 1);\n q && (q.words[j] = qj);\n }\n return (\n q && q._strip(),\n a._strip(),\n mode !== \"div\" && shift !== 0 && a.iushrn(shift),\n {\n div: q || null,\n mod: a,\n }\n );\n }),\n (BN.prototype.divmod = function (num, mode, positive) {\n if ((assert(!num.isZero()), this.isZero()))\n return {\n div: new BN(0),\n mod: new BN(0),\n };\n var div, mod, res;\n return this.negative !== 0 && num.negative === 0\n ? ((res = this.neg().divmod(num, mode)),\n mode !== \"mod\" && (div = res.div.neg()),\n mode !== \"div\" && ((mod = res.mod.neg()), positive && mod.negative !== 0 && mod.iadd(num)),\n {\n div,\n mod,\n })\n : this.negative === 0 && num.negative !== 0\n ? ((res = this.divmod(num.neg(), mode)),\n mode !== \"mod\" && (div = res.div.neg()),\n {\n div,\n mod: res.mod,\n })\n : (this.negative & num.negative) !== 0\n ? ((res = this.neg().divmod(num.neg(), mode)),\n mode !== \"div\" && ((mod = res.mod.neg()), positive && mod.negative !== 0 && mod.isub(num)),\n {\n div: res.div,\n mod,\n })\n : num.length > this.length || this.cmp(num) < 0\n ? {\n div: new BN(0),\n mod: this,\n }\n : num.length === 1\n ? mode === \"div\"\n ? {\n div: this.divn(num.words[0]),\n mod: null,\n }\n : mode === \"mod\"\n ? {\n div: null,\n mod: new BN(this.modrn(num.words[0])),\n }\n : {\n div: this.divn(num.words[0]),\n mod: new BN(this.modrn(num.words[0])),\n }\n : this._wordDiv(num, mode);\n }),\n (BN.prototype.div = function (num) {\n return this.divmod(num, \"div\", !1).div;\n }),\n (BN.prototype.mod = function (num) {\n return this.divmod(num, \"mod\", !1).mod;\n }),\n (BN.prototype.umod = function (num) {\n return this.divmod(num, \"mod\", !0).mod;\n }),\n (BN.prototype.divRound = function (num) {\n var dm = this.divmod(num);\n if (dm.mod.isZero()) return dm.div;\n var mod = dm.div.negative !== 0 ? dm.mod.isub(num) : dm.mod,\n half = num.ushrn(1),\n r2 = num.andln(1),\n cmp = mod.cmp(half);\n return cmp < 0 || (r2 === 1 && cmp === 0)\n ? dm.div\n : dm.div.negative !== 0\n ? dm.div.isubn(1)\n : dm.div.iaddn(1);\n }),\n (BN.prototype.modrn = function (num) {\n var isNegNum = num < 0;\n isNegNum && (num = -num), assert(num <= 67108863);\n for (var p = (1 << 26) % num, acc = 0, i = this.length - 1; i >= 0; i--)\n acc = (p * acc + (this.words[i] | 0)) % num;\n return isNegNum ? -acc : acc;\n }),\n (BN.prototype.modn = function (num) {\n return this.modrn(num);\n }),\n (BN.prototype.idivn = function (num) {\n var isNegNum = num < 0;\n isNegNum && (num = -num), assert(num <= 67108863);\n for (var carry = 0, i = this.length - 1; i >= 0; i--) {\n var w = (this.words[i] | 0) + carry * 67108864;\n (this.words[i] = (w / num) | 0), (carry = w % num);\n }\n return this._strip(), isNegNum ? this.ineg() : this;\n }),\n (BN.prototype.divn = function (num) {\n return this.clone().idivn(num);\n }),\n (BN.prototype.egcd = function (p) {\n assert(p.negative === 0), assert(!p.isZero());\n var x = this,\n y = p.clone();\n x.negative !== 0 ? (x = x.umod(p)) : (x = x.clone());\n for (var A = new BN(1), B = new BN(0), C = new BN(0), D = new BN(1), g = 0; x.isEven() && y.isEven(); )\n x.iushrn(1), y.iushrn(1), ++g;\n for (var yp = y.clone(), xp = x.clone(); !x.isZero(); ) {\n for (var i = 0, im = 1; (x.words[0] & im) === 0 && i < 26; ++i, im <<= 1);\n if (i > 0)\n for (x.iushrn(i); i-- > 0; )\n (A.isOdd() || B.isOdd()) && (A.iadd(yp), B.isub(xp)), A.iushrn(1), B.iushrn(1);\n for (var j = 0, jm = 1; (y.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n if (j > 0)\n for (y.iushrn(j); j-- > 0; )\n (C.isOdd() || D.isOdd()) && (C.iadd(yp), D.isub(xp)), C.iushrn(1), D.iushrn(1);\n x.cmp(y) >= 0 ? (x.isub(y), A.isub(C), B.isub(D)) : (y.isub(x), C.isub(A), D.isub(B));\n }\n return {\n a: C,\n b: D,\n gcd: y.iushln(g),\n };\n }),\n (BN.prototype._invmp = function (p) {\n assert(p.negative === 0), assert(!p.isZero());\n var a = this,\n b = p.clone();\n a.negative !== 0 ? (a = a.umod(p)) : (a = a.clone());\n for (var x1 = new BN(1), x2 = new BN(0), delta = b.clone(); 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) for (a.iushrn(i); i-- > 0; ) x1.isOdd() && x1.iadd(delta), x1.iushrn(1);\n for (var j = 0, jm = 1; (b.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n if (j > 0) for (b.iushrn(j); j-- > 0; ) x2.isOdd() && x2.iadd(delta), x2.iushrn(1);\n a.cmp(b) >= 0 ? (a.isub(b), x1.isub(x2)) : (b.isub(a), x2.isub(x1));\n }\n var res;\n return a.cmpn(1) === 0 ? (res = x1) : (res = x2), res.cmpn(0) < 0 && res.iadd(p), res;\n }),\n (BN.prototype.gcd = function (num) {\n if (this.isZero()) return num.abs();\n if (num.isZero()) return this.abs();\n var a = this.clone(),\n b = num.clone();\n (a.negative = 0), (b.negative = 0);\n for (var shift = 0; a.isEven() && b.isEven(); shift++) a.iushrn(1), b.iushrn(1);\n do {\n for (; a.isEven(); ) a.iushrn(1);\n for (; b.isEven(); ) b.iushrn(1);\n var r = a.cmp(b);\n if (r < 0) {\n var t = a;\n (a = b), (b = t);\n } else if (r === 0 || b.cmpn(1) === 0) break;\n a.isub(b);\n } while (!0);\n return b.iushln(shift);\n }),\n (BN.prototype.invm = function (num) {\n return this.egcd(num).a.umod(num);\n }),\n (BN.prototype.isEven = function () {\n return (this.words[0] & 1) === 0;\n }),\n (BN.prototype.isOdd = function () {\n return (this.words[0] & 1) === 1;\n }),\n (BN.prototype.andln = function (num) {\n return this.words[0] & num;\n }),\n (BN.prototype.bincn = function (bit) {\n assert(typeof bit == \"number\");\n var r = bit % 26,\n s = (bit - r) / 26,\n q = 1 << r;\n if (this.length <= s) return this._expand(s + 1), (this.words[s] |= q), this;\n for (var carry = q, i = s; carry !== 0 && i < this.length; i++) {\n var w = this.words[i] | 0;\n (w += carry), (carry = w >>> 26), (w &= 67108863), (this.words[i] = w);\n }\n return carry !== 0 && ((this.words[i] = carry), this.length++), this;\n }),\n (BN.prototype.isZero = function () {\n return this.length === 1 && this.words[0] === 0;\n }),\n (BN.prototype.cmpn = function (num) {\n var negative = num < 0;\n if (this.negative !== 0 && !negative) return -1;\n if (this.negative === 0 && negative) return 1;\n this._strip();\n var res;\n if (this.length > 1) res = 1;\n else {\n negative && (num = -num), assert(num <= 67108863, \"Number is too big\");\n var w = this.words[0] | 0;\n res = w === num ? 0 : w < num ? -1 : 1;\n }\n return this.negative !== 0 ? -res | 0 : res;\n }),\n (BN.prototype.cmp = function (num) {\n if (this.negative !== 0 && num.negative === 0) return -1;\n if (this.negative === 0 && num.negative !== 0) return 1;\n var res = this.ucmp(num);\n return this.negative !== 0 ? -res | 0 : res;\n }),\n (BN.prototype.ucmp = function (num) {\n if (this.length > num.length) return 1;\n if (this.length < num.length) return -1;\n for (var res = 0, i = this.length - 1; i >= 0; i--) {\n var a = this.words[i] | 0,\n b = num.words[i] | 0;\n if (a !== b) {\n a < b ? (res = -1) : a > b && (res = 1);\n break;\n }\n }\n return res;\n }),\n (BN.prototype.gtn = function (num) {\n return this.cmpn(num) === 1;\n }),\n (BN.prototype.gt = function (num) {\n return this.cmp(num) === 1;\n }),\n (BN.prototype.gten = function (num) {\n return this.cmpn(num) >= 0;\n }),\n (BN.prototype.gte = function (num) {\n return this.cmp(num) >= 0;\n }),\n (BN.prototype.ltn = function (num) {\n return this.cmpn(num) === -1;\n }),\n (BN.prototype.lt = function (num) {\n return this.cmp(num) === -1;\n }),\n (BN.prototype.lten = function (num) {\n return this.cmpn(num) <= 0;\n }),\n (BN.prototype.lte = function (num) {\n return this.cmp(num) <= 0;\n }),\n (BN.prototype.eqn = function (num) {\n return this.cmpn(num) === 0;\n }),\n (BN.prototype.eq = function (num) {\n return this.cmp(num) === 0;\n }),\n (BN.red = function (num) {\n return new Red(num);\n }),\n (BN.prototype.toRed = function (ctx) {\n return (\n assert(!this.red, \"Already a number in reduction context\"),\n assert(this.negative === 0, \"red works only with positives\"),\n ctx.convertTo(this)._forceRed(ctx)\n );\n }),\n (BN.prototype.fromRed = function () {\n return assert(this.red, \"fromRed works only with numbers in reduction context\"), this.red.convertFrom(this);\n }),\n (BN.prototype._forceRed = function (ctx) {\n return (this.red = ctx), this;\n }),\n (BN.prototype.forceRed = function (ctx) {\n return assert(!this.red, \"Already a number in reduction context\"), this._forceRed(ctx);\n }),\n (BN.prototype.redAdd = function (num) {\n return assert(this.red, \"redAdd works only with red numbers\"), this.red.add(this, num);\n }),\n (BN.prototype.redIAdd = function (num) {\n return assert(this.red, \"redIAdd works only with red numbers\"), this.red.iadd(this, num);\n }),\n (BN.prototype.redSub = function (num) {\n return assert(this.red, \"redSub works only with red numbers\"), this.red.sub(this, num);\n }),\n (BN.prototype.redISub = function (num) {\n return assert(this.red, \"redISub works only with red numbers\"), this.red.isub(this, num);\n }),\n (BN.prototype.redShl = function (num) {\n return assert(this.red, \"redShl works only with red numbers\"), this.red.shl(this, num);\n }),\n (BN.prototype.redMul = function (num) {\n return (\n assert(this.red, \"redMul works only with red numbers\"),\n this.red._verify2(this, num),\n this.red.mul(this, num)\n );\n }),\n (BN.prototype.redIMul = function (num) {\n return (\n assert(this.red, \"redMul works only with red numbers\"),\n this.red._verify2(this, num),\n this.red.imul(this, num)\n );\n }),\n (BN.prototype.redSqr = function () {\n return assert(this.red, \"redSqr works only with red numbers\"), this.red._verify1(this), this.red.sqr(this);\n }),\n (BN.prototype.redISqr = function () {\n return assert(this.red, \"redISqr works only with red numbers\"), this.red._verify1(this), this.red.isqr(this);\n }),\n (BN.prototype.redSqrt = function () {\n return assert(this.red, \"redSqrt works only with red numbers\"), this.red._verify1(this), this.red.sqrt(this);\n }),\n (BN.prototype.redInvm = function () {\n return assert(this.red, \"redInvm works only with red numbers\"), this.red._verify1(this), this.red.invm(this);\n }),\n (BN.prototype.redNeg = function () {\n return assert(this.red, \"redNeg works only with red numbers\"), this.red._verify1(this), this.red.neg(this);\n }),\n (BN.prototype.redPow = function (num) {\n return assert(this.red && !num.red, \"redPow(normalNum)\"), this.red._verify1(this), this.red.pow(this, num);\n });\n var primes = {\n k256: null,\n p224: null,\n p192: null,\n p25519: null,\n };\n function MPrime(name, p) {\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 (this.tmp = this._tmp());\n }\n (MPrime.prototype._tmp = function () {\n var tmp = new BN(null);\n return (tmp.words = new Array(Math.ceil(this.n / 13))), tmp;\n }),\n (MPrime.prototype.ireduce = function (num) {\n var r = num,\n rlen;\n do this.split(r, this.tmp), (r = this.imulK(r)), (r = r.iadd(this.tmp)), (rlen = r.bitLength());\n while (rlen > this.n);\n var cmp = rlen < this.n ? -1 : r.ucmp(this.p);\n return (\n cmp === 0\n ? ((r.words[0] = 0), (r.length = 1))\n : cmp > 0\n ? r.isub(this.p)\n : r.strip !== void 0\n ? r.strip()\n : r._strip(),\n r\n );\n }),\n (MPrime.prototype.split = function (input, out) {\n input.iushrn(this.n, 0, out);\n }),\n (MPrime.prototype.imulK = function (num) {\n return num.imul(this.k);\n });\n function K256() {\n MPrime.call(this, \"k256\", \"ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f\");\n }\n inherits(K256, MPrime),\n (K256.prototype.split = function (input, output) {\n for (var mask = 4194303, outLen = Math.min(input.length, 9), i = 0; i < outLen; i++)\n output.words[i] = input.words[i];\n if (((output.length = outLen), input.length <= 9)) {\n (input.words[0] = 0), (input.length = 1);\n return;\n }\n var prev = input.words[9];\n for (output.words[output.length++] = prev & mask, i = 10; i < input.length; i++) {\n var next = input.words[i] | 0;\n (input.words[i - 10] = ((next & mask) << 4) | (prev >>> 22)), (prev = next);\n }\n (prev >>>= 22),\n (input.words[i - 10] = prev),\n prev === 0 && input.length > 10 ? (input.length -= 10) : (input.length -= 9);\n }),\n (K256.prototype.imulK = function (num) {\n (num.words[num.length] = 0), (num.words[num.length + 1] = 0), (num.length += 2);\n for (var lo = 0, i = 0; i < num.length; i++) {\n var w = num.words[i] | 0;\n (lo += w * 977), (num.words[i] = lo & 67108863), (lo = w * 64 + ((lo / 67108864) | 0));\n }\n return (\n num.words[num.length - 1] === 0 && (num.length--, num.words[num.length - 1] === 0 && num.length--), num\n );\n });\n function P224() {\n MPrime.call(this, \"p224\", \"ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001\");\n }\n inherits(P224, MPrime);\n function P192() {\n MPrime.call(this, \"p192\", \"ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff\");\n }\n inherits(P192, MPrime);\n function P25519() {\n MPrime.call(this, \"25519\", \"7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed\");\n }\n inherits(P25519, MPrime),\n (P25519.prototype.imulK = function (num) {\n for (var carry = 0, i = 0; i < num.length; i++) {\n var hi = (num.words[i] | 0) * 19 + carry,\n lo = hi & 67108863;\n (hi >>>= 26), (num.words[i] = lo), (carry = hi);\n }\n return carry !== 0 && (num.words[num.length++] = carry), num;\n }),\n (BN._prime = function (name) {\n if (primes[name]) return primes[name];\n var prime2;\n if (name === \"k256\") prime2 = new K256();\n else if (name === \"p224\") prime2 = new P224();\n else if (name === \"p192\") prime2 = new P192();\n else if (name === \"p25519\") prime2 = new P25519();\n else throw new Error(\"Unknown prime \" + name);\n return (primes[name] = prime2), prime2;\n });\n function Red(m) {\n if (typeof m == \"string\") {\n var prime = BN._prime(m);\n (this.m = prime.p), (this.prime = prime);\n } else assert(m.gtn(1), \"modulus must be greater than 1\"), (this.m = m), (this.prime = null);\n }\n (Red.prototype._verify1 = function (a) {\n assert(a.negative === 0, \"red works only with positives\"), assert(a.red, \"red works only with red numbers\");\n }),\n (Red.prototype._verify2 = function (a, b) {\n assert((a.negative | b.negative) === 0, \"red works only with positives\"),\n assert(a.red && a.red === b.red, \"red works only with red numbers\");\n }),\n (Red.prototype.imod = function (a) {\n return this.prime ? this.prime.ireduce(a)._forceRed(this) : (move(a, a.umod(this.m)._forceRed(this)), a);\n }),\n (Red.prototype.neg = function (a) {\n return a.isZero() ? a.clone() : this.m.sub(a)._forceRed(this);\n }),\n (Red.prototype.add = function (a, b) {\n this._verify2(a, b);\n var res = a.add(b);\n return res.cmp(this.m) >= 0 && res.isub(this.m), res._forceRed(this);\n }),\n (Red.prototype.iadd = function (a, b) {\n this._verify2(a, b);\n var res = a.iadd(b);\n return res.cmp(this.m) >= 0 && res.isub(this.m), res;\n }),\n (Red.prototype.sub = function (a, b) {\n this._verify2(a, b);\n var res = a.sub(b);\n return res.cmpn(0) < 0 && res.iadd(this.m), res._forceRed(this);\n }),\n (Red.prototype.isub = function (a, b) {\n this._verify2(a, b);\n var res = a.isub(b);\n return res.cmpn(0) < 0 && res.iadd(this.m), res;\n }),\n (Red.prototype.shl = function (a, num) {\n return this._verify1(a), this.imod(a.ushln(num));\n }),\n (Red.prototype.imul = function (a, b) {\n return this._verify2(a, b), this.imod(a.imul(b));\n }),\n (Red.prototype.mul = function (a, b) {\n return this._verify2(a, b), this.imod(a.mul(b));\n }),\n (Red.prototype.isqr = function (a) {\n return this.imul(a, a.clone());\n }),\n (Red.prototype.sqr = function (a) {\n return this.mul(a, a);\n }),\n (Red.prototype.sqrt = function (a) {\n if (a.isZero()) return a.clone();\n var mod3 = this.m.andln(3);\n if ((assert(mod3 % 2 === 1), mod3 === 3)) {\n var pow = this.m.add(new BN(1)).iushrn(2);\n return this.pow(a, pow);\n }\n for (var q = this.m.subn(1), s = 0; !q.isZero() && q.andln(1) === 0; ) s++, q.iushrn(1);\n assert(!q.isZero());\n var one = new BN(1).toRed(this),\n nOne = one.redNeg(),\n lpow = this.m.subn(1).iushrn(1),\n z = this.m.bitLength();\n for (z = new BN(2 * z * z).toRed(this); this.pow(z, lpow).cmp(nOne) !== 0; ) z.redIAdd(nOne);\n for (\n var c = this.pow(z, q), r = this.pow(a, q.addn(1).iushrn(1)), t = this.pow(a, q), m = s;\n t.cmp(one) !== 0;\n\n ) {\n for (var tmp = t, i = 0; tmp.cmp(one) !== 0; i++) tmp = tmp.redSqr();\n assert(i < m);\n var b = this.pow(c, new BN(1).iushln(m - i - 1));\n (r = r.redMul(b)), (c = b.redSqr()), (t = t.redMul(c)), (m = i);\n }\n return r;\n }),\n (Red.prototype.invm = function (a) {\n var inv = a._invmp(this.m);\n return inv.negative !== 0 ? ((inv.negative = 0), this.imod(inv).redNeg()) : this.imod(inv);\n }),\n (Red.prototype.pow = function (a, num) {\n if (num.isZero()) return new BN(1).toRed(this);\n if (num.cmpn(1) === 0) return a.clone();\n var windowSize = 4,\n wnd = new Array(1 << windowSize);\n (wnd[0] = new BN(1).toRed(this)), (wnd[1] = a);\n for (var i = 2; i < wnd.length; i++) wnd[i] = this.mul(wnd[i - 1], a);\n var res = wnd[0],\n current = 0,\n currentLen = 0,\n start = num.bitLength() % 26;\n for (start === 0 && (start = 26), i = num.length - 1; i >= 0; i--) {\n for (var word = num.words[i], j = start - 1; j >= 0; j--) {\n var bit = (word >> j) & 1;\n if ((res !== wnd[0] && (res = this.sqr(res)), bit === 0 && current === 0)) {\n currentLen = 0;\n continue;\n }\n (current <<= 1),\n (current |= bit),\n currentLen++,\n !(currentLen !== windowSize && (i !== 0 || j !== 0)) &&\n ((res = this.mul(res, wnd[current])), (currentLen = 0), (current = 0));\n }\n start = 26;\n }\n return res;\n }),\n (Red.prototype.convertTo = function (num) {\n var r = num.umod(this.m);\n return r === num ? r.clone() : r;\n }),\n (Red.prototype.convertFrom = function (num) {\n var res = num.clone();\n return (res.red = null), res;\n }),\n (BN.mont = function (num) {\n return new Mont(num);\n });\n function Mont(m) {\n Red.call(this, m),\n (this.shift = this.m.bitLength()),\n this.shift % 26 !== 0 && (this.shift += 26 - (this.shift % 26)),\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 (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 (Mont.prototype.convertTo = function (num) {\n return this.imod(num.ushln(this.shift));\n }),\n (Mont.prototype.convertFrom = function (num) {\n var r = this.imod(num.mul(this.rinv));\n return (r.red = null), r;\n }),\n (Mont.prototype.imul = function (a, b) {\n if (a.isZero() || b.isZero()) return (a.words[0] = 0), (a.length = 1), a;\n var t = a.imul(b),\n c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m),\n u = t.isub(c).iushrn(this.shift),\n res = u;\n return (\n u.cmp(this.m) >= 0 ? (res = u.isub(this.m)) : u.cmpn(0) < 0 && (res = u.iadd(this.m)), res._forceRed(this)\n );\n }),\n (Mont.prototype.mul = function (a, b) {\n if (a.isZero() || b.isZero()) return new BN(0)._forceRed(this);\n var t = a.mul(b),\n c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m),\n u = t.isub(c).iushrn(this.shift),\n res = u;\n return (\n u.cmp(this.m) >= 0 ? (res = u.isub(this.m)) : u.cmpn(0) < 0 && (res = u.iadd(this.m)), res._forceRed(this)\n );\n }),\n (Mont.prototype.invm = function (a) {\n var res = this.imod(a._invmp(this.m).mul(this.r2));\n return res._forceRed(this);\n });\n })(typeof module > \"u\" || module, exports);\n },\n});\n\n// node_modules/browserify-rsa/index.js\nvar require_browserify_rsa = __commonJS({\n \"node_modules/browserify-rsa/index.js\"(exports, module) {\n var BN = require_bn3(),\n randomBytes = require_browser();\n function blind(priv) {\n var r = getr(priv),\n blinder = r.toRed(BN.mont(priv.modulus)).redPow(new BN(priv.publicExponent)).fromRed();\n return { blinder, unblinder: r.invm(priv.modulus) };\n }\n function getr(priv) {\n var len = priv.modulus.byteLength(),\n r;\n do r = new BN(randomBytes(len));\n while (r.cmp(priv.modulus) >= 0 || !r.umod(priv.prime1) || !r.umod(priv.prime2));\n return r;\n }\n function crt(msg, priv) {\n var blinds = blind(priv),\n len = priv.modulus.byteLength(),\n blinded = new BN(msg).mul(blinds.blinder).umod(priv.modulus),\n c1 = blinded.toRed(BN.mont(priv.prime1)),\n c2 = blinded.toRed(BN.mont(priv.prime2)),\n qinv = priv.coefficient,\n p = priv.prime1,\n q = priv.prime2,\n m1 = c1.redPow(priv.exponent1).fromRed(),\n m2 = c2.redPow(priv.exponent2).fromRed(),\n h = m1.isub(m2).imul(qinv).umod(p).imul(q);\n return m2.iadd(h).imul(blinds.unblinder).umod(priv.modulus).toArrayLike(Buffer, \"be\", len);\n }\n crt.getr = getr;\n module.exports = crt;\n },\n});\n\n// node_modules/elliptic/package.json\nvar require_package = __commonJS({\n \"node_modules/elliptic/package.json\"(exports, module) {\n module.exports = {\n name: \"elliptic\",\n version: \"6.5.4\",\n description: \"EC cryptography\",\n main: \"lib/elliptic.js\",\n files: [\"lib\"],\n scripts: {\n lint: \"eslint lib test\",\n \"lint:fix\": \"npm run lint -- --fix\",\n unit: \"istanbul test _mocha --reporter=spec test/index.js\",\n test: \"npm run lint && npm run unit\",\n version: \"grunt dist && git add dist/\",\n },\n repository: {\n type: \"git\",\n url: \"git@github.com:indutny/elliptic\",\n },\n keywords: [\"EC\", \"Elliptic\", \"curve\", \"Cryptography\"],\n author: \"Fedor Indutny <fedor@indutny.com>\",\n license: \"MIT\",\n bugs: {\n url: \"https://github.com/indutny/elliptic/issues\",\n },\n homepage: \"https://github.com/indutny/elliptic\",\n devDependencies: {\n brfs: \"^2.0.2\",\n coveralls: \"^3.1.0\",\n eslint: \"^7.6.0\",\n grunt: \"^1.2.1\",\n \"grunt-browserify\": \"^5.3.0\",\n \"grunt-cli\": \"^1.3.2\",\n \"grunt-contrib-connect\": \"^3.0.0\",\n \"grunt-contrib-copy\": \"^1.0.0\",\n \"grunt-contrib-uglify\": \"^5.0.0\",\n \"grunt-mocha-istanbul\": \"^5.0.2\",\n \"grunt-saucelabs\": \"^9.0.1\",\n istanbul: \"^0.4.5\",\n mocha: \"^8.0.1\",\n },\n dependencies: {\n \"bn.js\": \"^4.11.9\",\n brorand: \"^1.1.0\",\n \"hash.js\": \"^1.0.0\",\n \"hmac-drbg\": \"^1.0.1\",\n inherits: \"^2.0.4\",\n \"minimalistic-assert\": \"^1.0.1\",\n \"minimalistic-crypto-utils\": \"^1.0.1\",\n },\n };\n },\n});\n\n// node_modules/elliptic/node_modules/bn.js/lib/bn.js\nvar require_bn4 = __commonJS({\n \"node_modules/elliptic/node_modules/bn.js/lib/bn.js\"(exports, module) {\n (function (module2, exports2) {\n \"use strict\";\n function assert(val, msg) {\n if (!val) throw new Error(msg || \"Assertion failed\");\n }\n function inherits(ctor, superCtor) {\n ctor.super_ = superCtor;\n var TempCtor = function () {};\n (TempCtor.prototype = superCtor.prototype),\n (ctor.prototype = new TempCtor()),\n (ctor.prototype.constructor = ctor);\n }\n function BN(number, base, endian) {\n if (BN.isBN(number)) return number;\n (this.negative = 0),\n (this.words = null),\n (this.length = 0),\n (this.red = null),\n number !== null &&\n ((base === \"le\" || base === \"be\") && ((endian = base), (base = 10)),\n this._init(number || 0, base || 10, endian || \"be\"));\n }\n typeof module2 == \"object\" ? (module2.exports = BN) : (exports2.BN = BN), (BN.BN = BN), (BN.wordSize = 26);\n var Buffer2;\n try {\n typeof window < \"u\" && typeof window.Buffer < \"u\"\n ? (Buffer2 = window.Buffer)\n : (Buffer2 = __require(\"buffer\").Buffer);\n } catch {}\n (BN.isBN = function (num) {\n return num instanceof BN\n ? !0\n : num !== null &&\n typeof num == \"object\" &&\n num.constructor.wordSize === BN.wordSize &&\n Array.isArray(num.words);\n }),\n (BN.max = function (left, right) {\n return left.cmp(right) > 0 ? left : right;\n }),\n (BN.min = function (left, right) {\n return left.cmp(right) < 0 ? left : right;\n }),\n (BN.prototype._init = function (number, base, endian) {\n if (typeof number == \"number\") return this._initNumber(number, base, endian);\n if (typeof number == \"object\") return this._initArray(number, base, endian);\n base === \"hex\" && (base = 16),\n assert(base === (base | 0) && base >= 2 && base <= 36),\n (number = number.toString().replace(/\\s+/g, \"\"));\n var start = 0;\n number[0] === \"-\" && (start++, (this.negative = 1)),\n start < number.length &&\n (base === 16\n ? this._parseHex(number, start, endian)\n : (this._parseBase(number, base, start),\n endian === \"le\" && this._initArray(this.toArray(), base, endian)));\n }),\n (BN.prototype._initNumber = function (number, base, endian) {\n number < 0 && ((this.negative = 1), (number = -number)),\n number < 67108864\n ? ((this.words = [number & 67108863]), (this.length = 1))\n : number < 4503599627370496\n ? ((this.words = [number & 67108863, (number / 67108864) & 67108863]), (this.length = 2))\n : (assert(number < 9007199254740992),\n (this.words = [number & 67108863, (number / 67108864) & 67108863, 1]),\n (this.length = 3)),\n endian === \"le\" && this._initArray(this.toArray(), base, endian);\n }),\n (BN.prototype._initArray = function (number, base, endian) {\n if ((assert(typeof number.length == \"number\"), number.length <= 0))\n return (this.words = [0]), (this.length = 1), this;\n (this.length = Math.ceil(number.length / 3)), (this.words = new Array(this.length));\n for (var i = 0; i < this.length; i++) this.words[i] = 0;\n var j,\n w,\n off = 0;\n if (endian === \"be\")\n for (i = number.length - 1, j = 0; i >= 0; i -= 3)\n (w = number[i] | (number[i - 1] << 8) | (number[i - 2] << 16)),\n (this.words[j] |= (w << off) & 67108863),\n (this.words[j + 1] = (w >>> (26 - off)) & 67108863),\n (off += 24),\n off >= 26 && ((off -= 26), j++);\n else if (endian === \"le\")\n for (i = 0, j = 0; i < number.length; i += 3)\n (w = number[i] | (number[i + 1] << 8) | (number[i + 2] << 16)),\n (this.words[j] |= (w << off) & 67108863),\n (this.words[j + 1] = (w >>> (26 - off)) & 67108863),\n (off += 24),\n off >= 26 && ((off -= 26), j++);\n return this.strip();\n });\n function parseHex4Bits(string, index) {\n var c = string.charCodeAt(index);\n return c >= 65 && c <= 70 ? c - 55 : c >= 97 && c <= 102 ? c - 87 : (c - 48) & 15;\n }\n function parseHexByte(string, lowerBound, index) {\n var r = parseHex4Bits(string, index);\n return index - 1 >= lowerBound && (r |= parseHex4Bits(string, index - 1) << 4), r;\n }\n BN.prototype._parseHex = function (number, start, endian) {\n (this.length = Math.ceil((number.length - start) / 6)), (this.words = new Array(this.length));\n for (var i = 0; i < this.length; i++) this.words[i] = 0;\n var off = 0,\n j = 0,\n w;\n if (endian === \"be\")\n for (i = number.length - 1; i >= start; i -= 2)\n (w = parseHexByte(number, start, i) << off),\n (this.words[j] |= w & 67108863),\n off >= 18 ? ((off -= 18), (j += 1), (this.words[j] |= w >>> 26)) : (off += 8);\n else {\n var parseLength = number.length - start;\n for (i = parseLength % 2 === 0 ? start + 1 : start; i < number.length; i += 2)\n (w = parseHexByte(number, start, i) << off),\n (this.words[j] |= w & 67108863),\n off >= 18 ? ((off -= 18), (j += 1), (this.words[j] |= w >>> 26)) : (off += 8);\n }\n this.strip();\n };\n function parseBase(str, start, end, mul) {\n for (var r = 0, len = Math.min(str.length, end), i = start; i < len; i++) {\n var c = str.charCodeAt(i) - 48;\n (r *= mul), c >= 49 ? (r += c - 49 + 10) : c >= 17 ? (r += c - 17 + 10) : (r += c);\n }\n return r;\n }\n (BN.prototype._parseBase = function (number, base, start) {\n (this.words = [0]), (this.length = 1);\n for (var limbLen = 0, limbPow = 1; limbPow <= 67108863; limbPow *= base) limbLen++;\n limbLen--, (limbPow = (limbPow / base) | 0);\n for (\n var total = number.length - start,\n mod = total % limbLen,\n end = Math.min(total, total - mod) + start,\n word = 0,\n i = start;\n i < end;\n i += limbLen\n )\n (word = parseBase(number, i, i + limbLen, base)),\n this.imuln(limbPow),\n this.words[0] + word < 67108864 ? (this.words[0] += word) : this._iaddn(word);\n if (mod !== 0) {\n var pow = 1;\n for (word = parseBase(number, i, number.length, base), i = 0; i < mod; i++) pow *= base;\n this.imuln(pow), this.words[0] + word < 67108864 ? (this.words[0] += word) : this._iaddn(word);\n }\n this.strip();\n }),\n (BN.prototype.copy = function (dest) {\n dest.words = new Array(this.length);\n for (var i = 0; i < this.length; i++) dest.words[i] = this.words[i];\n (dest.length = this.length), (dest.negative = this.negative), (dest.red = this.red);\n }),\n (BN.prototype.clone = function () {\n var r = new BN(null);\n return this.copy(r), r;\n }),\n (BN.prototype._expand = function (size) {\n for (; this.length < size; ) this.words[this.length++] = 0;\n return this;\n }),\n (BN.prototype.strip = function () {\n for (; this.length > 1 && this.words[this.length - 1] === 0; ) this.length--;\n return this._normSign();\n }),\n (BN.prototype._normSign = function () {\n return this.length === 1 && this.words[0] === 0 && (this.negative = 0), this;\n }),\n (BN.prototype.inspect = function () {\n return (this.red ? \"<BN-R: \" : \"<BN: \") + this.toString(16) + \">\";\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 groupSizes = [\n 0, 0, 25, 16, 12, 11, 10, 9, 8, 8, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5,\n 5, 5,\n ],\n groupBases = [\n 0, 0, 33554432, 43046721, 16777216, 48828125, 60466176, 40353607, 16777216, 43046721, 1e7, 19487171, 35831808,\n 62748517, 7529536, 11390625, 16777216, 24137569, 34012224, 47045881, 64e6, 4084101, 5153632, 6436343, 7962624,\n 9765625, 11881376, 14348907, 17210368, 20511149, 243e5, 28629151, 33554432, 39135393, 45435424, 52521875,\n 60466176,\n ];\n (BN.prototype.toString = function (base, padding) {\n (base = base || 10), (padding = padding | 0 || 1);\n var out;\n if (base === 16 || base === \"hex\") {\n out = \"\";\n for (var off = 0, carry = 0, i = 0; i < this.length; i++) {\n var w = this.words[i],\n word = (((w << off) | carry) & 16777215).toString(16);\n (carry = (w >>> (24 - off)) & 16777215),\n carry !== 0 || i !== this.length - 1 ? (out = zeros[6 - word.length] + word + out) : (out = word + out),\n (off += 2),\n off >= 26 && ((off -= 26), i--);\n }\n for (carry !== 0 && (out = carry.toString(16) + out); out.length % padding !== 0; ) out = \"0\" + out;\n return this.negative !== 0 && (out = \"-\" + out), out;\n }\n if (base === (base | 0) && base >= 2 && base <= 36) {\n var groupSize = groupSizes[base],\n groupBase = groupBases[base];\n out = \"\";\n var c = this.clone();\n for (c.negative = 0; !c.isZero(); ) {\n var r = c.modn(groupBase).toString(base);\n (c = c.idivn(groupBase)), c.isZero() ? (out = r + out) : (out = zeros[groupSize - r.length] + r + out);\n }\n for (this.isZero() && (out = \"0\" + out); out.length % padding !== 0; ) out = \"0\" + out;\n return this.negative !== 0 && (out = \"-\" + out), out;\n }\n assert(!1, \"Base should be between 2 and 36\");\n }),\n (BN.prototype.toNumber = function () {\n var ret = this.words[0];\n return (\n this.length === 2\n ? (ret += this.words[1] * 67108864)\n : this.length === 3 && this.words[2] === 1\n ? (ret += 4503599627370496 + this.words[1] * 67108864)\n : this.length > 2 && assert(!1, \"Number can only safely store up to 53 bits\"),\n this.negative !== 0 ? -ret : ret\n );\n }),\n (BN.prototype.toJSON = function () {\n return this.toString(16);\n }),\n (BN.prototype.toBuffer = function (endian, length) {\n return assert(typeof Buffer2 < \"u\"), this.toArrayLike(Buffer2, endian, length);\n }),\n (BN.prototype.toArray = function (endian, length) {\n return this.toArrayLike(Array, endian, length);\n }),\n (BN.prototype.toArrayLike = function (ArrayType, endian, length) {\n var byteLength = this.byteLength(),\n 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 this.strip();\n var littleEndian = endian === \"le\",\n res = new ArrayType(reqLength),\n b,\n i,\n q = this.clone();\n if (littleEndian) {\n for (i = 0; !q.isZero(); i++) (b = q.andln(255)), q.iushrn(8), (res[i] = b);\n for (; i < reqLength; i++) res[i] = 0;\n } else {\n for (i = 0; i < reqLength - byteLength; i++) res[i] = 0;\n for (i = 0; !q.isZero(); i++) (b = q.andln(255)), q.iushrn(8), (res[reqLength - i - 1] = b);\n }\n return res;\n }),\n Math.clz32\n ? (BN.prototype._countBits = function (w) {\n return 32 - Math.clz32(w);\n })\n : (BN.prototype._countBits = function (w) {\n var t = w,\n r = 0;\n return (\n t >= 4096 && ((r += 13), (t >>>= 13)),\n t >= 64 && ((r += 7), (t >>>= 7)),\n t >= 8 && ((r += 4), (t >>>= 4)),\n t >= 2 && ((r += 2), (t >>>= 2)),\n r + t\n );\n }),\n (BN.prototype._zeroBits = function (w) {\n if (w === 0) return 26;\n var t = w,\n r = 0;\n return (\n (t & 8191) === 0 && ((r += 13), (t >>>= 13)),\n (t & 127) === 0 && ((r += 7), (t >>>= 7)),\n (t & 15) === 0 && ((r += 4), (t >>>= 4)),\n (t & 3) === 0 && ((r += 2), (t >>>= 2)),\n (t & 1) === 0 && r++,\n r\n );\n }),\n (BN.prototype.bitLength = function () {\n var w = this.words[this.length - 1],\n hi = this._countBits(w);\n return (this.length - 1) * 26 + hi;\n });\n function toBitArray(num) {\n for (var w = new Array(num.bitLength()), bit = 0; bit < w.length; bit++) {\n var off = (bit / 26) | 0,\n wbit = bit % 26;\n w[bit] = (num.words[off] & (1 << wbit)) >>> wbit;\n }\n return w;\n }\n (BN.prototype.zeroBits = function () {\n if (this.isZero()) return 0;\n for (var r = 0, i = 0; i < this.length; i++) {\n var b = this._zeroBits(this.words[i]);\n if (((r += b), b !== 26)) break;\n }\n return r;\n }),\n (BN.prototype.byteLength = function () {\n return Math.ceil(this.bitLength() / 8);\n }),\n (BN.prototype.toTwos = function (width) {\n return this.negative !== 0 ? this.abs().inotn(width).iaddn(1) : this.clone();\n }),\n (BN.prototype.fromTwos = function (width) {\n return this.testn(width - 1) ? this.notn(width).iaddn(1).ineg() : this.clone();\n }),\n (BN.prototype.isNeg = function () {\n return this.negative !== 0;\n }),\n (BN.prototype.neg = function () {\n return this.clone().ineg();\n }),\n (BN.prototype.ineg = function () {\n return this.isZero() || (this.negative ^= 1), this;\n }),\n (BN.prototype.iuor = function (num) {\n for (; this.length < num.length; ) this.words[this.length++] = 0;\n for (var i = 0; i < num.length; i++) this.words[i] = this.words[i] | num.words[i];\n return this.strip();\n }),\n (BN.prototype.ior = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuor(num);\n }),\n (BN.prototype.or = function (num) {\n return this.length > num.length ? this.clone().ior(num) : num.clone().ior(this);\n }),\n (BN.prototype.uor = function (num) {\n return this.length > num.length ? this.clone().iuor(num) : num.clone().iuor(this);\n }),\n (BN.prototype.iuand = function (num) {\n var b;\n this.length > num.length ? (b = num) : (b = this);\n for (var i = 0; i < b.length; i++) this.words[i] = this.words[i] & num.words[i];\n return (this.length = b.length), this.strip();\n }),\n (BN.prototype.iand = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuand(num);\n }),\n (BN.prototype.and = function (num) {\n return this.length > num.length ? this.clone().iand(num) : num.clone().iand(this);\n }),\n (BN.prototype.uand = function (num) {\n return this.length > num.length ? this.clone().iuand(num) : num.clone().iuand(this);\n }),\n (BN.prototype.iuxor = function (num) {\n var a, b;\n this.length > num.length ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var i = 0; i < b.length; i++) this.words[i] = a.words[i] ^ b.words[i];\n if (this !== a) for (; i < a.length; i++) this.words[i] = a.words[i];\n return (this.length = a.length), this.strip();\n }),\n (BN.prototype.ixor = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuxor(num);\n }),\n (BN.prototype.xor = function (num) {\n return this.length > num.length ? this.clone().ixor(num) : num.clone().ixor(this);\n }),\n (BN.prototype.uxor = function (num) {\n return this.length > num.length ? this.clone().iuxor(num) : num.clone().iuxor(this);\n }),\n (BN.prototype.inotn = function (width) {\n assert(typeof width == \"number\" && width >= 0);\n var bytesNeeded = Math.ceil(width / 26) | 0,\n bitsLeft = width % 26;\n this._expand(bytesNeeded), bitsLeft > 0 && bytesNeeded--;\n for (var i = 0; i < bytesNeeded; i++) this.words[i] = ~this.words[i] & 67108863;\n return bitsLeft > 0 && (this.words[i] = ~this.words[i] & (67108863 >> (26 - bitsLeft))), this.strip();\n }),\n (BN.prototype.notn = function (width) {\n return this.clone().inotn(width);\n }),\n (BN.prototype.setn = function (bit, val) {\n assert(typeof bit == \"number\" && bit >= 0);\n var off = (bit / 26) | 0,\n wbit = bit % 26;\n return (\n this._expand(off + 1),\n val\n ? (this.words[off] = this.words[off] | (1 << wbit))\n : (this.words[off] = this.words[off] & ~(1 << wbit)),\n this.strip()\n );\n }),\n (BN.prototype.iadd = function (num) {\n var r;\n if (this.negative !== 0 && num.negative === 0)\n return (this.negative = 0), (r = this.isub(num)), (this.negative ^= 1), this._normSign();\n if (this.negative === 0 && num.negative !== 0)\n return (num.negative = 0), (r = this.isub(num)), (num.negative = 1), r._normSign();\n var a, b;\n this.length > num.length ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var carry = 0, i = 0; i < b.length; i++)\n (r = (a.words[i] | 0) + (b.words[i] | 0) + carry), (this.words[i] = r & 67108863), (carry = r >>> 26);\n for (; carry !== 0 && i < a.length; i++)\n (r = (a.words[i] | 0) + carry), (this.words[i] = r & 67108863), (carry = r >>> 26);\n if (((this.length = a.length), carry !== 0)) (this.words[this.length] = carry), this.length++;\n else if (a !== this) for (; i < a.length; i++) this.words[i] = a.words[i];\n return this;\n }),\n (BN.prototype.add = function (num) {\n var res;\n return num.negative !== 0 && this.negative === 0\n ? ((num.negative = 0), (res = this.sub(num)), (num.negative ^= 1), res)\n : num.negative === 0 && this.negative !== 0\n ? ((this.negative = 0), (res = num.sub(this)), (this.negative = 1), res)\n : this.length > num.length\n ? this.clone().iadd(num)\n : num.clone().iadd(this);\n }),\n (BN.prototype.isub = function (num) {\n if (num.negative !== 0) {\n num.negative = 0;\n var r = this.iadd(num);\n return (num.negative = 1), r._normSign();\n } else if (this.negative !== 0)\n return (this.negative = 0), this.iadd(num), (this.negative = 1), this._normSign();\n var cmp = this.cmp(num);\n if (cmp === 0) return (this.negative = 0), (this.length = 1), (this.words[0] = 0), this;\n var a, b;\n cmp > 0 ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var carry = 0, i = 0; i < b.length; i++)\n (r = (a.words[i] | 0) - (b.words[i] | 0) + carry), (carry = r >> 26), (this.words[i] = r & 67108863);\n for (; carry !== 0 && i < a.length; i++)\n (r = (a.words[i] | 0) + carry), (carry = r >> 26), (this.words[i] = r & 67108863);\n if (carry === 0 && i < a.length && a !== this) for (; i < a.length; i++) this.words[i] = a.words[i];\n return (this.length = Math.max(this.length, i)), a !== this && (this.negative = 1), this.strip();\n }),\n (BN.prototype.sub = function (num) {\n return this.clone().isub(num);\n });\n function smallMulTo(self2, num, out) {\n out.negative = num.negative ^ self2.negative;\n var len = (self2.length + num.length) | 0;\n (out.length = len), (len = (len - 1) | 0);\n var a = self2.words[0] | 0,\n b = num.words[0] | 0,\n r = a * b,\n lo = r & 67108863,\n carry = (r / 67108864) | 0;\n out.words[0] = lo;\n for (var k = 1; k < len; k++) {\n for (\n var ncarry = carry >>> 26,\n rword = carry & 67108863,\n maxJ = Math.min(k, num.length - 1),\n j = Math.max(0, k - self2.length + 1);\n j <= maxJ;\n j++\n ) {\n var i = (k - j) | 0;\n (a = self2.words[i] | 0),\n (b = num.words[j] | 0),\n (r = a * b + rword),\n (ncarry += (r / 67108864) | 0),\n (rword = r & 67108863);\n }\n (out.words[k] = rword | 0), (carry = ncarry | 0);\n }\n return carry !== 0 ? (out.words[k] = carry | 0) : out.length--, out.strip();\n }\n var comb10MulTo = function (self2, num, out) {\n var a = self2.words,\n b = num.words,\n o = out.words,\n c = 0,\n lo,\n mid,\n hi,\n a0 = a[0] | 0,\n al0 = a0 & 8191,\n ah0 = a0 >>> 13,\n a1 = a[1] | 0,\n al1 = a1 & 8191,\n ah1 = a1 >>> 13,\n a2 = a[2] | 0,\n al2 = a2 & 8191,\n ah2 = a2 >>> 13,\n a3 = a[3] | 0,\n al3 = a3 & 8191,\n ah3 = a3 >>> 13,\n a4 = a[4] | 0,\n al4 = a4 & 8191,\n ah4 = a4 >>> 13,\n a5 = a[5] | 0,\n al5 = a5 & 8191,\n ah5 = a5 >>> 13,\n a6 = a[6] | 0,\n al6 = a6 & 8191,\n ah6 = a6 >>> 13,\n a7 = a[7] | 0,\n al7 = a7 & 8191,\n ah7 = a7 >>> 13,\n a8 = a[8] | 0,\n al8 = a8 & 8191,\n ah8 = a8 >>> 13,\n a9 = a[9] | 0,\n al9 = a9 & 8191,\n ah9 = a9 >>> 13,\n b0 = b[0] | 0,\n bl0 = b0 & 8191,\n bh0 = b0 >>> 13,\n b1 = b[1] | 0,\n bl1 = b1 & 8191,\n bh1 = b1 >>> 13,\n b2 = b[2] | 0,\n bl2 = b2 & 8191,\n bh2 = b2 >>> 13,\n b3 = b[3] | 0,\n bl3 = b3 & 8191,\n bh3 = b3 >>> 13,\n b4 = b[4] | 0,\n bl4 = b4 & 8191,\n bh4 = b4 >>> 13,\n b5 = b[5] | 0,\n bl5 = b5 & 8191,\n bh5 = b5 >>> 13,\n b6 = b[6] | 0,\n bl6 = b6 & 8191,\n bh6 = b6 >>> 13,\n b7 = b[7] | 0,\n bl7 = b7 & 8191,\n bh7 = b7 >>> 13,\n b8 = b[8] | 0,\n bl8 = b8 & 8191,\n bh8 = b8 >>> 13,\n b9 = b[9] | 0,\n bl9 = b9 & 8191,\n bh9 = b9 >>> 13;\n (out.negative = self2.negative ^ num.negative),\n (out.length = 19),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w0 >>> 26)) | 0),\n (w0 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w1 >>> 26)) | 0),\n (w1 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w2 >>> 26)) | 0),\n (w2 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w3 >>> 26)) | 0),\n (w3 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w4 >>> 26)) | 0),\n (w4 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w5 >>> 26)) | 0),\n (w5 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w6 >>> 26)) | 0),\n (w6 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w7 >>> 26)) | 0),\n (w7 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w8 >>> 26)) | 0),\n (w8 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w9 >>> 26)) | 0),\n (w9 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w10 >>> 26)) | 0),\n (w10 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w11 >>> 26)) | 0),\n (w11 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w12 >>> 26)) | 0),\n (w12 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w13 >>> 26)) | 0),\n (w13 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w14 >>> 26)) | 0),\n (w14 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w15 >>> 26)) | 0),\n (w15 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w16 >>> 26)) | 0),\n (w16 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w17 >>> 26)) | 0),\n (w17 &= 67108863),\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 & 8191) << 13)) | 0;\n return (\n (c = (((hi + (mid >>> 13)) | 0) + (w18 >>> 26)) | 0),\n (w18 &= 67108863),\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 c !== 0 && ((o[19] = c), out.length++),\n out\n );\n };\n Math.imul || (comb10MulTo = smallMulTo);\n function bigMulTo(self2, num, out) {\n (out.negative = num.negative ^ self2.negative), (out.length = self2.length + num.length);\n for (var carry = 0, hncarry = 0, k = 0; k < out.length - 1; k++) {\n var ncarry = hncarry;\n hncarry = 0;\n for (\n var rword = carry & 67108863, maxJ = Math.min(k, num.length - 1), j = Math.max(0, k - self2.length + 1);\n j <= maxJ;\n j++\n ) {\n var i = k - j,\n a = self2.words[i] | 0,\n b = num.words[j] | 0,\n r = a * b,\n lo = r & 67108863;\n (ncarry = (ncarry + ((r / 67108864) | 0)) | 0),\n (lo = (lo + rword) | 0),\n (rword = lo & 67108863),\n (ncarry = (ncarry + (lo >>> 26)) | 0),\n (hncarry += ncarry >>> 26),\n (ncarry &= 67108863);\n }\n (out.words[k] = rword), (carry = ncarry), (ncarry = hncarry);\n }\n return carry !== 0 ? (out.words[k] = carry) : out.length--, out.strip();\n }\n function jumboMulTo(self2, num, out) {\n var fftm = new FFTM();\n return fftm.mulp(self2, num, out);\n }\n BN.prototype.mulTo = function (num, out) {\n var res,\n len = this.length + num.length;\n return (\n this.length === 10 && num.length === 10\n ? (res = comb10MulTo(this, num, out))\n : len < 63\n ? (res = smallMulTo(this, num, out))\n : len < 1024\n ? (res = bigMulTo(this, num, out))\n : (res = jumboMulTo(this, num, out)),\n res\n );\n };\n function FFTM(x, y) {\n (this.x = x), (this.y = y);\n }\n (FFTM.prototype.makeRBT = function (N) {\n for (var t = new Array(N), l = BN.prototype._countBits(N) - 1, i = 0; i < N; i++) t[i] = this.revBin(i, l, N);\n return t;\n }),\n (FFTM.prototype.revBin = function (x, l, N) {\n if (x === 0 || x === N - 1) return x;\n for (var rb = 0, i = 0; i < l; i++) (rb |= (x & 1) << (l - i - 1)), (x >>= 1);\n return rb;\n }),\n (FFTM.prototype.permute = function (rbt, rws, iws, rtws, itws, N) {\n for (var i = 0; i < N; i++) (rtws[i] = rws[rbt[i]]), (itws[i] = iws[rbt[i]]);\n }),\n (FFTM.prototype.transform = function (rws, iws, rtws, itws, N, rbt) {\n this.permute(rbt, rws, iws, rtws, itws, N);\n for (var s = 1; s < N; s <<= 1)\n for (\n var l = s << 1, rtwdf = Math.cos((2 * Math.PI) / l), itwdf = Math.sin((2 * Math.PI) / l), p = 0;\n p < N;\n p += l\n )\n for (var rtwdf_ = rtwdf, itwdf_ = itwdf, j = 0; j < s; j++) {\n var re = rtws[p + j],\n ie = itws[p + j],\n ro = rtws[p + j + s],\n io = itws[p + j + s],\n rx = rtwdf_ * ro - itwdf_ * io;\n (io = rtwdf_ * io + itwdf_ * ro),\n (ro = rx),\n (rtws[p + j] = re + ro),\n (itws[p + j] = ie + io),\n (rtws[p + j + s] = re - ro),\n (itws[p + j + s] = ie - io),\n j !== l &&\n ((rx = rtwdf * rtwdf_ - itwdf * itwdf_), (itwdf_ = rtwdf * itwdf_ + itwdf * rtwdf_), (rtwdf_ = rx));\n }\n }),\n (FFTM.prototype.guessLen13b = function (n, m) {\n var N = Math.max(m, n) | 1,\n odd = N & 1,\n i = 0;\n for (N = (N / 2) | 0; N; N = N >>> 1) i++;\n return 1 << (i + 1 + odd);\n }),\n (FFTM.prototype.conjugate = function (rws, iws, N) {\n if (!(N <= 1))\n for (var i = 0; i < N / 2; i++) {\n var t = rws[i];\n (rws[i] = rws[N - i - 1]),\n (rws[N - i - 1] = t),\n (t = iws[i]),\n (iws[i] = -iws[N - i - 1]),\n (iws[N - i - 1] = -t);\n }\n }),\n (FFTM.prototype.normalize13b = function (ws, N) {\n for (var carry = 0, i = 0; i < N / 2; i++) {\n var w = Math.round(ws[2 * i + 1] / N) * 8192 + Math.round(ws[2 * i] / N) + carry;\n (ws[i] = w & 67108863), w < 67108864 ? (carry = 0) : (carry = (w / 67108864) | 0);\n }\n return ws;\n }),\n (FFTM.prototype.convert13b = function (ws, len, rws, N) {\n for (var carry = 0, i = 0; i < len; i++)\n (carry = carry + (ws[i] | 0)),\n (rws[2 * i] = carry & 8191),\n (carry = carry >>> 13),\n (rws[2 * i + 1] = carry & 8191),\n (carry = carry >>> 13);\n for (i = 2 * len; i < N; ++i) rws[i] = 0;\n assert(carry === 0), assert((carry & -8192) === 0);\n }),\n (FFTM.prototype.stub = function (N) {\n for (var ph = new Array(N), i = 0; i < N; i++) ph[i] = 0;\n return ph;\n }),\n (FFTM.prototype.mulp = function (x, y, out) {\n var N = 2 * this.guessLen13b(x.length, y.length),\n rbt = this.makeRBT(N),\n _ = this.stub(N),\n rws = new Array(N),\n rwst = new Array(N),\n iwst = new Array(N),\n nrws = new Array(N),\n nrwst = new Array(N),\n niwst = new Array(N),\n rmws = out.words;\n (rmws.length = N),\n this.convert13b(x.words, x.length, rws, N),\n this.convert13b(y.words, y.length, nrws, N),\n this.transform(rws, _, rwst, iwst, N, rbt),\n this.transform(nrws, _, nrwst, niwst, N, rbt);\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]), (rwst[i] = rx);\n }\n return (\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 (out.negative = x.negative ^ y.negative),\n (out.length = x.length + y.length),\n out.strip()\n );\n }),\n (BN.prototype.mul = function (num) {\n var out = new BN(null);\n return (out.words = new Array(this.length + num.length)), this.mulTo(num, out);\n }),\n (BN.prototype.mulf = function (num) {\n var out = new BN(null);\n return (out.words = new Array(this.length + num.length)), jumboMulTo(this, num, out);\n }),\n (BN.prototype.imul = function (num) {\n return this.clone().mulTo(num, this);\n }),\n (BN.prototype.imuln = function (num) {\n assert(typeof num == \"number\"), assert(num < 67108864);\n for (var carry = 0, i = 0; i < this.length; i++) {\n var w = (this.words[i] | 0) * num,\n lo = (w & 67108863) + (carry & 67108863);\n (carry >>= 26), (carry += (w / 67108864) | 0), (carry += lo >>> 26), (this.words[i] = lo & 67108863);\n }\n return carry !== 0 && ((this.words[i] = carry), this.length++), this;\n }),\n (BN.prototype.muln = function (num) {\n return this.clone().imuln(num);\n }),\n (BN.prototype.sqr = function () {\n return this.mul(this);\n }),\n (BN.prototype.isqr = function () {\n return this.imul(this.clone());\n }),\n (BN.prototype.pow = function (num) {\n var w = toBitArray(num);\n if (w.length === 0) return new BN(1);\n for (var res = this, i = 0; i < w.length && w[i] === 0; i++, res = res.sqr());\n if (++i < w.length) for (var q = res.sqr(); i < w.length; i++, q = q.sqr()) w[i] !== 0 && (res = res.mul(q));\n return res;\n }),\n (BN.prototype.iushln = function (bits) {\n assert(typeof bits == \"number\" && bits >= 0);\n var r = bits % 26,\n s = (bits - r) / 26,\n carryMask = (67108863 >>> (26 - r)) << (26 - r),\n i;\n if (r !== 0) {\n var carry = 0;\n for (i = 0; i < this.length; i++) {\n var newCarry = this.words[i] & carryMask,\n c = ((this.words[i] | 0) - newCarry) << r;\n (this.words[i] = c | carry), (carry = newCarry >>> (26 - r));\n }\n carry && ((this.words[i] = carry), this.length++);\n }\n if (s !== 0) {\n for (i = this.length - 1; i >= 0; i--) this.words[i + s] = this.words[i];\n for (i = 0; i < s; i++) this.words[i] = 0;\n this.length += s;\n }\n return this.strip();\n }),\n (BN.prototype.ishln = function (bits) {\n return assert(this.negative === 0), this.iushln(bits);\n }),\n (BN.prototype.iushrn = function (bits, hint, extended) {\n assert(typeof bits == \"number\" && bits >= 0);\n var h;\n hint ? (h = (hint - (hint % 26)) / 26) : (h = 0);\n var r = bits % 26,\n s = Math.min((bits - r) / 26, this.length),\n mask = 67108863 ^ ((67108863 >>> r) << r),\n maskedWords = extended;\n if (((h -= s), (h = Math.max(0, h)), maskedWords)) {\n for (var i = 0; i < s; i++) maskedWords.words[i] = this.words[i];\n maskedWords.length = s;\n }\n if (s !== 0)\n if (this.length > s) for (this.length -= s, i = 0; i < this.length; i++) this.words[i] = this.words[i + s];\n else (this.words[0] = 0), (this.length = 1);\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)), (carry = word & mask);\n }\n return (\n maskedWords && carry !== 0 && (maskedWords.words[maskedWords.length++] = carry),\n this.length === 0 && ((this.words[0] = 0), (this.length = 1)),\n this.strip()\n );\n }),\n (BN.prototype.ishrn = function (bits, hint, extended) {\n return assert(this.negative === 0), this.iushrn(bits, hint, extended);\n }),\n (BN.prototype.shln = function (bits) {\n return this.clone().ishln(bits);\n }),\n (BN.prototype.ushln = function (bits) {\n return this.clone().iushln(bits);\n }),\n (BN.prototype.shrn = function (bits) {\n return this.clone().ishrn(bits);\n }),\n (BN.prototype.ushrn = function (bits) {\n return this.clone().iushrn(bits);\n }),\n (BN.prototype.testn = function (bit) {\n assert(typeof bit == \"number\" && bit >= 0);\n var r = bit % 26,\n s = (bit - r) / 26,\n q = 1 << r;\n if (this.length <= s) return !1;\n var w = this.words[s];\n return !!(w & q);\n }),\n (BN.prototype.imaskn = function (bits) {\n assert(typeof bits == \"number\" && bits >= 0);\n var r = bits % 26,\n s = (bits - r) / 26;\n if ((assert(this.negative === 0, \"imaskn works only with positive numbers\"), this.length <= s)) return this;\n if ((r !== 0 && s++, (this.length = Math.min(s, this.length)), r !== 0)) {\n var mask = 67108863 ^ ((67108863 >>> r) << r);\n this.words[this.length - 1] &= mask;\n }\n return this.strip();\n }),\n (BN.prototype.maskn = function (bits) {\n return this.clone().imaskn(bits);\n }),\n (BN.prototype.iaddn = function (num) {\n return (\n assert(typeof num == \"number\"),\n assert(num < 67108864),\n num < 0\n ? this.isubn(-num)\n : this.negative !== 0\n ? this.length === 1 && (this.words[0] | 0) < num\n ? ((this.words[0] = num - (this.words[0] | 0)), (this.negative = 0), this)\n : ((this.negative = 0), this.isubn(num), (this.negative = 1), this)\n : this._iaddn(num)\n );\n }),\n (BN.prototype._iaddn = function (num) {\n this.words[0] += num;\n for (var i = 0; i < this.length && this.words[i] >= 67108864; i++)\n (this.words[i] -= 67108864), i === this.length - 1 ? (this.words[i + 1] = 1) : this.words[i + 1]++;\n return (this.length = Math.max(this.length, i + 1)), this;\n }),\n (BN.prototype.isubn = function (num) {\n if ((assert(typeof num == \"number\"), assert(num < 67108864), num < 0)) return this.iaddn(-num);\n if (this.negative !== 0) return (this.negative = 0), this.iaddn(num), (this.negative = 1), this;\n if (((this.words[0] -= num), this.length === 1 && this.words[0] < 0))\n (this.words[0] = -this.words[0]), (this.negative = 1);\n else\n for (var i = 0; i < this.length && this.words[i] < 0; i++)\n (this.words[i] += 67108864), (this.words[i + 1] -= 1);\n return this.strip();\n }),\n (BN.prototype.addn = function (num) {\n return this.clone().iaddn(num);\n }),\n (BN.prototype.subn = function (num) {\n return this.clone().isubn(num);\n }),\n (BN.prototype.iabs = function () {\n return (this.negative = 0), this;\n }),\n (BN.prototype.abs = function () {\n return this.clone().iabs();\n }),\n (BN.prototype._ishlnsubmul = function (num, mul, shift) {\n var len = num.length + shift,\n i;\n this._expand(len);\n var w,\n 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 & 67108863),\n (carry = (w >> 26) - ((right / 67108864) | 0)),\n (this.words[i + shift] = w & 67108863);\n }\n for (; i < this.length - shift; i++)\n (w = (this.words[i + shift] | 0) + carry), (carry = w >> 26), (this.words[i + shift] = w & 67108863);\n if (carry === 0) return this.strip();\n for (assert(carry === -1), carry = 0, i = 0; i < this.length; i++)\n (w = -(this.words[i] | 0) + carry), (carry = w >> 26), (this.words[i] = w & 67108863);\n return (this.negative = 1), this.strip();\n }),\n (BN.prototype._wordDiv = function (num, mode) {\n var shift = this.length - num.length,\n a = this.clone(),\n b = num,\n bhi = b.words[b.length - 1] | 0,\n bhiBits = this._countBits(bhi);\n (shift = 26 - bhiBits),\n shift !== 0 && ((b = b.ushln(shift)), a.iushln(shift), (bhi = b.words[b.length - 1] | 0));\n var m = a.length - b.length,\n q;\n if (mode !== \"mod\") {\n (q = new BN(null)), (q.length = m + 1), (q.words = new Array(q.length));\n for (var i = 0; i < q.length; i++) q.words[i] = 0;\n }\n var diff = a.clone()._ishlnsubmul(b, 1, m);\n diff.negative === 0 && ((a = diff), q && (q.words[m] = 1));\n for (var j = m - 1; j >= 0; j--) {\n var qj = (a.words[b.length + j] | 0) * 67108864 + (a.words[b.length + j - 1] | 0);\n for (qj = Math.min((qj / bhi) | 0, 67108863), a._ishlnsubmul(b, qj, j); a.negative !== 0; )\n qj--, (a.negative = 0), a._ishlnsubmul(b, 1, j), a.isZero() || (a.negative ^= 1);\n q && (q.words[j] = qj);\n }\n return (\n q && q.strip(),\n a.strip(),\n mode !== \"div\" && shift !== 0 && a.iushrn(shift),\n {\n div: q || null,\n mod: a,\n }\n );\n }),\n (BN.prototype.divmod = function (num, mode, positive) {\n if ((assert(!num.isZero()), this.isZero()))\n return {\n div: new BN(0),\n mod: new BN(0),\n };\n var div, mod, res;\n return this.negative !== 0 && num.negative === 0\n ? ((res = this.neg().divmod(num, mode)),\n mode !== \"mod\" && (div = res.div.neg()),\n mode !== \"div\" && ((mod = res.mod.neg()), positive && mod.negative !== 0 && mod.iadd(num)),\n {\n div,\n mod,\n })\n : this.negative === 0 && num.negative !== 0\n ? ((res = this.divmod(num.neg(), mode)),\n mode !== \"mod\" && (div = res.div.neg()),\n {\n div,\n mod: res.mod,\n })\n : (this.negative & num.negative) !== 0\n ? ((res = this.neg().divmod(num.neg(), mode)),\n mode !== \"div\" && ((mod = res.mod.neg()), positive && mod.negative !== 0 && mod.isub(num)),\n {\n div: res.div,\n mod,\n })\n : num.length > this.length || this.cmp(num) < 0\n ? {\n div: new BN(0),\n mod: this,\n }\n : num.length === 1\n ? mode === \"div\"\n ? {\n div: this.divn(num.words[0]),\n mod: null,\n }\n : mode === \"mod\"\n ? {\n div: null,\n mod: new BN(this.modn(num.words[0])),\n }\n : {\n div: this.divn(num.words[0]),\n mod: new BN(this.modn(num.words[0])),\n }\n : this._wordDiv(num, mode);\n }),\n (BN.prototype.div = function (num) {\n return this.divmod(num, \"div\", !1).div;\n }),\n (BN.prototype.mod = function (num) {\n return this.divmod(num, \"mod\", !1).mod;\n }),\n (BN.prototype.umod = function (num) {\n return this.divmod(num, \"mod\", !0).mod;\n }),\n (BN.prototype.divRound = function (num) {\n var dm = this.divmod(num);\n if (dm.mod.isZero()) return dm.div;\n var mod = dm.div.negative !== 0 ? dm.mod.isub(num) : dm.mod,\n half = num.ushrn(1),\n r2 = num.andln(1),\n cmp = mod.cmp(half);\n return cmp < 0 || (r2 === 1 && cmp === 0)\n ? dm.div\n : dm.div.negative !== 0\n ? dm.div.isubn(1)\n : dm.div.iaddn(1);\n }),\n (BN.prototype.modn = function (num) {\n assert(num <= 67108863);\n for (var p = (1 << 26) % num, acc = 0, i = this.length - 1; i >= 0; i--)\n acc = (p * acc + (this.words[i] | 0)) % num;\n return acc;\n }),\n (BN.prototype.idivn = function (num) {\n assert(num <= 67108863);\n for (var carry = 0, i = this.length - 1; i >= 0; i--) {\n var w = (this.words[i] | 0) + carry * 67108864;\n (this.words[i] = (w / num) | 0), (carry = w % num);\n }\n return this.strip();\n }),\n (BN.prototype.divn = function (num) {\n return this.clone().idivn(num);\n }),\n (BN.prototype.egcd = function (p) {\n assert(p.negative === 0), assert(!p.isZero());\n var x = this,\n y = p.clone();\n x.negative !== 0 ? (x = x.umod(p)) : (x = x.clone());\n for (var A = new BN(1), B = new BN(0), C = new BN(0), D = new BN(1), g = 0; x.isEven() && y.isEven(); )\n x.iushrn(1), y.iushrn(1), ++g;\n for (var yp = y.clone(), xp = x.clone(); !x.isZero(); ) {\n for (var i = 0, im = 1; (x.words[0] & im) === 0 && i < 26; ++i, im <<= 1);\n if (i > 0)\n for (x.iushrn(i); i-- > 0; )\n (A.isOdd() || B.isOdd()) && (A.iadd(yp), B.isub(xp)), A.iushrn(1), B.iushrn(1);\n for (var j = 0, jm = 1; (y.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n if (j > 0)\n for (y.iushrn(j); j-- > 0; )\n (C.isOdd() || D.isOdd()) && (C.iadd(yp), D.isub(xp)), C.iushrn(1), D.iushrn(1);\n x.cmp(y) >= 0 ? (x.isub(y), A.isub(C), B.isub(D)) : (y.isub(x), C.isub(A), D.isub(B));\n }\n return {\n a: C,\n b: D,\n gcd: y.iushln(g),\n };\n }),\n (BN.prototype._invmp = function (p) {\n assert(p.negative === 0), assert(!p.isZero());\n var a = this,\n b = p.clone();\n a.negative !== 0 ? (a = a.umod(p)) : (a = a.clone());\n for (var x1 = new BN(1), x2 = new BN(0), delta = b.clone(); 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) for (a.iushrn(i); i-- > 0; ) x1.isOdd() && x1.iadd(delta), x1.iushrn(1);\n for (var j = 0, jm = 1; (b.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n if (j > 0) for (b.iushrn(j); j-- > 0; ) x2.isOdd() && x2.iadd(delta), x2.iushrn(1);\n a.cmp(b) >= 0 ? (a.isub(b), x1.isub(x2)) : (b.isub(a), x2.isub(x1));\n }\n var res;\n return a.cmpn(1) === 0 ? (res = x1) : (res = x2), res.cmpn(0) < 0 && res.iadd(p), res;\n }),\n (BN.prototype.gcd = function (num) {\n if (this.isZero()) return num.abs();\n if (num.isZero()) return this.abs();\n var a = this.clone(),\n b = num.clone();\n (a.negative = 0), (b.negative = 0);\n for (var shift = 0; a.isEven() && b.isEven(); shift++) a.iushrn(1), b.iushrn(1);\n do {\n for (; a.isEven(); ) a.iushrn(1);\n for (; b.isEven(); ) b.iushrn(1);\n var r = a.cmp(b);\n if (r < 0) {\n var t = a;\n (a = b), (b = t);\n } else if (r === 0 || b.cmpn(1) === 0) break;\n a.isub(b);\n } while (!0);\n return b.iushln(shift);\n }),\n (BN.prototype.invm = function (num) {\n return this.egcd(num).a.umod(num);\n }),\n (BN.prototype.isEven = function () {\n return (this.words[0] & 1) === 0;\n }),\n (BN.prototype.isOdd = function () {\n return (this.words[0] & 1) === 1;\n }),\n (BN.prototype.andln = function (num) {\n return this.words[0] & num;\n }),\n (BN.prototype.bincn = function (bit) {\n assert(typeof bit == \"number\");\n var r = bit % 26,\n s = (bit - r) / 26,\n q = 1 << r;\n if (this.length <= s) return this._expand(s + 1), (this.words[s] |= q), this;\n for (var carry = q, i = s; carry !== 0 && i < this.length; i++) {\n var w = this.words[i] | 0;\n (w += carry), (carry = w >>> 26), (w &= 67108863), (this.words[i] = w);\n }\n return carry !== 0 && ((this.words[i] = carry), this.length++), this;\n }),\n (BN.prototype.isZero = function () {\n return this.length === 1 && this.words[0] === 0;\n }),\n (BN.prototype.cmpn = function (num) {\n var negative = num < 0;\n if (this.negative !== 0 && !negative) return -1;\n if (this.negative === 0 && negative) return 1;\n this.strip();\n var res;\n if (this.length > 1) res = 1;\n else {\n negative && (num = -num), assert(num <= 67108863, \"Number is too big\");\n var w = this.words[0] | 0;\n res = w === num ? 0 : w < num ? -1 : 1;\n }\n return this.negative !== 0 ? -res | 0 : res;\n }),\n (BN.prototype.cmp = function (num) {\n if (this.negative !== 0 && num.negative === 0) return -1;\n if (this.negative === 0 && num.negative !== 0) return 1;\n var res = this.ucmp(num);\n return this.negative !== 0 ? -res | 0 : res;\n }),\n (BN.prototype.ucmp = function (num) {\n if (this.length > num.length) return 1;\n if (this.length < num.length) return -1;\n for (var res = 0, i = this.length - 1; i >= 0; i--) {\n var a = this.words[i] | 0,\n b = num.words[i] | 0;\n if (a !== b) {\n a < b ? (res = -1) : a > b && (res = 1);\n break;\n }\n }\n return res;\n }),\n (BN.prototype.gtn = function (num) {\n return this.cmpn(num) === 1;\n }),\n (BN.prototype.gt = function (num) {\n return this.cmp(num) === 1;\n }),\n (BN.prototype.gten = function (num) {\n return this.cmpn(num) >= 0;\n }),\n (BN.prototype.gte = function (num) {\n return this.cmp(num) >= 0;\n }),\n (BN.prototype.ltn = function (num) {\n return this.cmpn(num) === -1;\n }),\n (BN.prototype.lt = function (num) {\n return this.cmp(num) === -1;\n }),\n (BN.prototype.lten = function (num) {\n return this.cmpn(num) <= 0;\n }),\n (BN.prototype.lte = function (num) {\n return this.cmp(num) <= 0;\n }),\n (BN.prototype.eqn = function (num) {\n return this.cmpn(num) === 0;\n }),\n (BN.prototype.eq = function (num) {\n return this.cmp(num) === 0;\n }),\n (BN.red = function (num) {\n return new Red(num);\n }),\n (BN.prototype.toRed = function (ctx) {\n return (\n assert(!this.red, \"Already a number in reduction context\"),\n assert(this.negative === 0, \"red works only with positives\"),\n ctx.convertTo(this)._forceRed(ctx)\n );\n }),\n (BN.prototype.fromRed = function () {\n return assert(this.red, \"fromRed works only with numbers in reduction context\"), this.red.convertFrom(this);\n }),\n (BN.prototype._forceRed = function (ctx) {\n return (this.red = ctx), this;\n }),\n (BN.prototype.forceRed = function (ctx) {\n return assert(!this.red, \"Already a number in reduction context\"), this._forceRed(ctx);\n }),\n (BN.prototype.redAdd = function (num) {\n return assert(this.red, \"redAdd works only with red numbers\"), this.red.add(this, num);\n }),\n (BN.prototype.redIAdd = function (num) {\n return assert(this.red, \"redIAdd works only with red numbers\"), this.red.iadd(this, num);\n }),\n (BN.prototype.redSub = function (num) {\n return assert(this.red, \"redSub works only with red numbers\"), this.red.sub(this, num);\n }),\n (BN.prototype.redISub = function (num) {\n return assert(this.red, \"redISub works only with red numbers\"), this.red.isub(this, num);\n }),\n (BN.prototype.redShl = function (num) {\n return assert(this.red, \"redShl works only with red numbers\"), this.red.shl(this, num);\n }),\n (BN.prototype.redMul = function (num) {\n return (\n assert(this.red, \"redMul works only with red numbers\"),\n this.red._verify2(this, num),\n this.red.mul(this, num)\n );\n }),\n (BN.prototype.redIMul = function (num) {\n return (\n assert(this.red, \"redMul works only with red numbers\"),\n this.red._verify2(this, num),\n this.red.imul(this, num)\n );\n }),\n (BN.prototype.redSqr = function () {\n return assert(this.red, \"redSqr works only with red numbers\"), this.red._verify1(this), this.red.sqr(this);\n }),\n (BN.prototype.redISqr = function () {\n return assert(this.red, \"redISqr works only with red numbers\"), this.red._verify1(this), this.red.isqr(this);\n }),\n (BN.prototype.redSqrt = function () {\n return assert(this.red, \"redSqrt works only with red numbers\"), this.red._verify1(this), this.red.sqrt(this);\n }),\n (BN.prototype.redInvm = function () {\n return assert(this.red, \"redInvm works only with red numbers\"), this.red._verify1(this), this.red.invm(this);\n }),\n (BN.prototype.redNeg = function () {\n return assert(this.red, \"redNeg works only with red numbers\"), this.red._verify1(this), this.red.neg(this);\n }),\n (BN.prototype.redPow = function (num) {\n return assert(this.red && !num.red, \"redPow(normalNum)\"), this.red._verify1(this), this.red.pow(this, num);\n });\n var primes = {\n k256: null,\n p224: null,\n p192: null,\n p25519: null,\n };\n function MPrime(name, p) {\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 (this.tmp = this._tmp());\n }\n (MPrime.prototype._tmp = function () {\n var tmp = new BN(null);\n return (tmp.words = new Array(Math.ceil(this.n / 13))), tmp;\n }),\n (MPrime.prototype.ireduce = function (num) {\n var r = num,\n rlen;\n do this.split(r, this.tmp), (r = this.imulK(r)), (r = r.iadd(this.tmp)), (rlen = r.bitLength());\n while (rlen > this.n);\n var cmp = rlen < this.n ? -1 : r.ucmp(this.p);\n return (\n cmp === 0\n ? ((r.words[0] = 0), (r.length = 1))\n : cmp > 0\n ? r.isub(this.p)\n : r.strip !== void 0\n ? r.strip()\n : r._strip(),\n r\n );\n }),\n (MPrime.prototype.split = function (input, out) {\n input.iushrn(this.n, 0, out);\n }),\n (MPrime.prototype.imulK = function (num) {\n return num.imul(this.k);\n });\n function K256() {\n MPrime.call(this, \"k256\", \"ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f\");\n }\n inherits(K256, MPrime),\n (K256.prototype.split = function (input, output) {\n for (var mask = 4194303, outLen = Math.min(input.length, 9), i = 0; i < outLen; i++)\n output.words[i] = input.words[i];\n if (((output.length = outLen), input.length <= 9)) {\n (input.words[0] = 0), (input.length = 1);\n return;\n }\n var prev = input.words[9];\n for (output.words[output.length++] = prev & mask, i = 10; i < input.length; i++) {\n var next = input.words[i] | 0;\n (input.words[i - 10] = ((next & mask) << 4) | (prev >>> 22)), (prev = next);\n }\n (prev >>>= 22),\n (input.words[i - 10] = prev),\n prev === 0 && input.length > 10 ? (input.length -= 10) : (input.length -= 9);\n }),\n (K256.prototype.imulK = function (num) {\n (num.words[num.length] = 0), (num.words[num.length + 1] = 0), (num.length += 2);\n for (var lo = 0, i = 0; i < num.length; i++) {\n var w = num.words[i] | 0;\n (lo += w * 977), (num.words[i] = lo & 67108863), (lo = w * 64 + ((lo / 67108864) | 0));\n }\n return (\n num.words[num.length - 1] === 0 && (num.length--, num.words[num.length - 1] === 0 && num.length--), num\n );\n });\n function P224() {\n MPrime.call(this, \"p224\", \"ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001\");\n }\n inherits(P224, MPrime);\n function P192() {\n MPrime.call(this, \"p192\", \"ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff\");\n }\n inherits(P192, MPrime);\n function P25519() {\n MPrime.call(this, \"25519\", \"7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed\");\n }\n inherits(P25519, MPrime),\n (P25519.prototype.imulK = function (num) {\n for (var carry = 0, i = 0; i < num.length; i++) {\n var hi = (num.words[i] | 0) * 19 + carry,\n lo = hi & 67108863;\n (hi >>>= 26), (num.words[i] = lo), (carry = hi);\n }\n return carry !== 0 && (num.words[num.length++] = carry), num;\n }),\n (BN._prime = function (name) {\n if (primes[name]) return primes[name];\n var prime2;\n if (name === \"k256\") prime2 = new K256();\n else if (name === \"p224\") prime2 = new P224();\n else if (name === \"p192\") prime2 = new P192();\n else if (name === \"p25519\") prime2 = new P25519();\n else throw new Error(\"Unknown prime \" + name);\n return (primes[name] = prime2), prime2;\n });\n function Red(m) {\n if (typeof m == \"string\") {\n var prime = BN._prime(m);\n (this.m = prime.p), (this.prime = prime);\n } else assert(m.gtn(1), \"modulus must be greater than 1\"), (this.m = m), (this.prime = null);\n }\n (Red.prototype._verify1 = function (a) {\n assert(a.negative === 0, \"red works only with positives\"), assert(a.red, \"red works only with red numbers\");\n }),\n (Red.prototype._verify2 = function (a, b) {\n assert((a.negative | b.negative) === 0, \"red works only with positives\"),\n assert(a.red && a.red === b.red, \"red works only with red numbers\");\n }),\n (Red.prototype.imod = function (a) {\n return this.prime ? this.prime.ireduce(a)._forceRed(this) : a.umod(this.m)._forceRed(this);\n }),\n (Red.prototype.neg = function (a) {\n return a.isZero() ? a.clone() : this.m.sub(a)._forceRed(this);\n }),\n (Red.prototype.add = function (a, b) {\n this._verify2(a, b);\n var res = a.add(b);\n return res.cmp(this.m) >= 0 && res.isub(this.m), res._forceRed(this);\n }),\n (Red.prototype.iadd = function (a, b) {\n this._verify2(a, b);\n var res = a.iadd(b);\n return res.cmp(this.m) >= 0 && res.isub(this.m), res;\n }),\n (Red.prototype.sub = function (a, b) {\n this._verify2(a, b);\n var res = a.sub(b);\n return res.cmpn(0) < 0 && res.iadd(this.m), res._forceRed(this);\n }),\n (Red.prototype.isub = function (a, b) {\n this._verify2(a, b);\n var res = a.isub(b);\n return res.cmpn(0) < 0 && res.iadd(this.m), res;\n }),\n (Red.prototype.shl = function (a, num) {\n return this._verify1(a), this.imod(a.ushln(num));\n }),\n (Red.prototype.imul = function (a, b) {\n return this._verify2(a, b), this.imod(a.imul(b));\n }),\n (Red.prototype.mul = function (a, b) {\n return this._verify2(a, b), this.imod(a.mul(b));\n }),\n (Red.prototype.isqr = function (a) {\n return this.imul(a, a.clone());\n }),\n (Red.prototype.sqr = function (a) {\n return this.mul(a, a);\n }),\n (Red.prototype.sqrt = function (a) {\n if (a.isZero()) return a.clone();\n var mod3 = this.m.andln(3);\n if ((assert(mod3 % 2 === 1), mod3 === 3)) {\n var pow = this.m.add(new BN(1)).iushrn(2);\n return this.pow(a, pow);\n }\n for (var q = this.m.subn(1), s = 0; !q.isZero() && q.andln(1) === 0; ) s++, q.iushrn(1);\n assert(!q.isZero());\n var one = new BN(1).toRed(this),\n nOne = one.redNeg(),\n lpow = this.m.subn(1).iushrn(1),\n z = this.m.bitLength();\n for (z = new BN(2 * z * z).toRed(this); this.pow(z, lpow).cmp(nOne) !== 0; ) z.redIAdd(nOne);\n for (\n var c = this.pow(z, q), r = this.pow(a, q.addn(1).iushrn(1)), t = this.pow(a, q), m = s;\n t.cmp(one) !== 0;\n\n ) {\n for (var tmp = t, i = 0; tmp.cmp(one) !== 0; i++) tmp = tmp.redSqr();\n assert(i < m);\n var b = this.pow(c, new BN(1).iushln(m - i - 1));\n (r = r.redMul(b)), (c = b.redSqr()), (t = t.redMul(c)), (m = i);\n }\n return r;\n }),\n (Red.prototype.invm = function (a) {\n var inv = a._invmp(this.m);\n return inv.negative !== 0 ? ((inv.negative = 0), this.imod(inv).redNeg()) : this.imod(inv);\n }),\n (Red.prototype.pow = function (a, num) {\n if (num.isZero()) return new BN(1).toRed(this);\n if (num.cmpn(1) === 0) return a.clone();\n var windowSize = 4,\n wnd = new Array(1 << windowSize);\n (wnd[0] = new BN(1).toRed(this)), (wnd[1] = a);\n for (var i = 2; i < wnd.length; i++) wnd[i] = this.mul(wnd[i - 1], a);\n var res = wnd[0],\n current = 0,\n currentLen = 0,\n start = num.bitLength() % 26;\n for (start === 0 && (start = 26), i = num.length - 1; i >= 0; i--) {\n for (var word = num.words[i], j = start - 1; j >= 0; j--) {\n var bit = (word >> j) & 1;\n if ((res !== wnd[0] && (res = this.sqr(res)), bit === 0 && current === 0)) {\n currentLen = 0;\n continue;\n }\n (current <<= 1),\n (current |= bit),\n currentLen++,\n !(currentLen !== windowSize && (i !== 0 || j !== 0)) &&\n ((res = this.mul(res, wnd[current])), (currentLen = 0), (current = 0));\n }\n start = 26;\n }\n return res;\n }),\n (Red.prototype.convertTo = function (num) {\n var r = num.umod(this.m);\n return r === num ? r.clone() : r;\n }),\n (Red.prototype.convertFrom = function (num) {\n var res = num.clone();\n return (res.red = null), res;\n }),\n (BN.mont = function (num) {\n return new Mont(num);\n });\n function Mont(m) {\n Red.call(this, m),\n (this.shift = this.m.bitLength()),\n this.shift % 26 !== 0 && (this.shift += 26 - (this.shift % 26)),\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 (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 (Mont.prototype.convertTo = function (num) {\n return this.imod(num.ushln(this.shift));\n }),\n (Mont.prototype.convertFrom = function (num) {\n var r = this.imod(num.mul(this.rinv));\n return (r.red = null), r;\n }),\n (Mont.prototype.imul = function (a, b) {\n if (a.isZero() || b.isZero()) return (a.words[0] = 0), (a.length = 1), a;\n var t = a.imul(b),\n c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m),\n u = t.isub(c).iushrn(this.shift),\n res = u;\n return (\n u.cmp(this.m) >= 0 ? (res = u.isub(this.m)) : u.cmpn(0) < 0 && (res = u.iadd(this.m)), res._forceRed(this)\n );\n }),\n (Mont.prototype.mul = function (a, b) {\n if (a.isZero() || b.isZero()) return new BN(0)._forceRed(this);\n var t = a.mul(b),\n c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m),\n u = t.isub(c).iushrn(this.shift),\n res = u;\n return (\n u.cmp(this.m) >= 0 ? (res = u.isub(this.m)) : u.cmpn(0) < 0 && (res = u.iadd(this.m)), res._forceRed(this)\n );\n }),\n (Mont.prototype.invm = function (a) {\n var res = this.imod(a._invmp(this.m).mul(this.r2));\n return res._forceRed(this);\n });\n })(typeof module > \"u\" || module, exports);\n },\n});\n\n// node_modules/minimalistic-crypto-utils/lib/utils.js\nvar require_utils2 = __commonJS({\n \"node_modules/minimalistic-crypto-utils/lib/utils.js\"(exports) {\n \"use strict\";\n var utils = exports;\n function toArray(msg, enc) {\n if (Array.isArray(msg)) return msg.slice();\n if (!msg) return [];\n var res = [];\n if (typeof msg != \"string\") {\n for (var i = 0; i < msg.length; i++) res[i] = msg[i] | 0;\n return res;\n }\n if (enc === \"hex\") {\n (msg = msg.replace(/[^a-z0-9]+/gi, \"\")), msg.length % 2 !== 0 && (msg = \"0\" + msg);\n for (var i = 0; i < msg.length; i += 2) res.push(parseInt(msg[i] + msg[i + 1], 16));\n } else\n for (var i = 0; i < msg.length; i++) {\n var c = msg.charCodeAt(i),\n hi = c >> 8,\n lo = c & 255;\n hi ? res.push(hi, lo) : res.push(lo);\n }\n return res;\n }\n utils.toArray = toArray;\n function zero2(word) {\n return word.length === 1 ? \"0\" + word : word;\n }\n utils.zero2 = zero2;\n function toHex(msg) {\n for (var res = \"\", i = 0; i < msg.length; i++) res += zero2(msg[i].toString(16));\n return res;\n }\n utils.toHex = toHex;\n utils.encode = function (arr, enc) {\n return enc === \"hex\" ? toHex(arr) : arr;\n };\n },\n});\n\n// node_modules/elliptic/lib/elliptic/utils.js\nvar require_utils3 = __commonJS({\n \"node_modules/elliptic/lib/elliptic/utils.js\"(exports) {\n \"use strict\";\n var utils = exports,\n BN = require_bn4(),\n minAssert = require_minimalistic_assert(),\n minUtils = require_utils2();\n utils.assert = minAssert;\n utils.toArray = minUtils.toArray;\n utils.zero2 = minUtils.zero2;\n utils.toHex = minUtils.toHex;\n utils.encode = minUtils.encode;\n function getNAF(num, w, bits) {\n var naf = new Array(Math.max(num.bitLength(), bits) + 1);\n naf.fill(0);\n for (var ws = 1 << (w + 1), k = num.clone(), i = 0; i < naf.length; i++) {\n var z,\n mod = k.andln(ws - 1);\n k.isOdd() ? (mod > (ws >> 1) - 1 ? (z = (ws >> 1) - mod) : (z = mod), k.isubn(z)) : (z = 0),\n (naf[i] = z),\n k.iushrn(1);\n }\n return naf;\n }\n utils.getNAF = getNAF;\n function getJSF(k1, k2) {\n var jsf = [[], []];\n (k1 = k1.clone()), (k2 = k2.clone());\n for (var d1 = 0, d2 = 0, m8; k1.cmpn(-d1) > 0 || k2.cmpn(-d2) > 0; ) {\n var m14 = (k1.andln(3) + d1) & 3,\n m24 = (k2.andln(3) + d2) & 3;\n m14 === 3 && (m14 = -1), m24 === 3 && (m24 = -1);\n var u1;\n (m14 & 1) === 0\n ? (u1 = 0)\n : ((m8 = (k1.andln(7) + d1) & 7), (m8 === 3 || m8 === 5) && m24 === 2 ? (u1 = -m14) : (u1 = m14)),\n jsf[0].push(u1);\n var u2;\n (m24 & 1) === 0\n ? (u2 = 0)\n : ((m8 = (k2.andln(7) + d2) & 7), (m8 === 3 || m8 === 5) && m14 === 2 ? (u2 = -m24) : (u2 = m24)),\n jsf[1].push(u2),\n 2 * d1 === u1 + 1 && (d1 = 1 - d1),\n 2 * d2 === u2 + 1 && (d2 = 1 - d2),\n k1.iushrn(1),\n k2.iushrn(1);\n }\n return jsf;\n }\n utils.getJSF = getJSF;\n function cachedProperty(obj, name, computer) {\n var key = \"_\" + name;\n obj.prototype[name] = function () {\n return this[key] !== void 0 ? this[key] : (this[key] = computer.call(this));\n };\n }\n utils.cachedProperty = cachedProperty;\n function parseBytes(bytes) {\n return typeof bytes == \"string\" ? utils.toArray(bytes, \"hex\") : bytes;\n }\n utils.parseBytes = parseBytes;\n function intFromLE(bytes) {\n return new BN(bytes, \"hex\", \"le\");\n }\n utils.intFromLE = intFromLE;\n },\n});\n\n// node_modules/elliptic/lib/elliptic/curve/base.js\nvar require_base = __commonJS({\n \"node_modules/elliptic/lib/elliptic/curve/base.js\"(exports, module) {\n \"use strict\";\n var BN = require_bn4(),\n utils = require_utils3(),\n getNAF = utils.getNAF,\n getJSF = utils.getJSF,\n assert = utils.assert;\n function BaseCurve(type, conf) {\n (this.type = type),\n (this.p = new BN(conf.p, 16)),\n (this.red = conf.prime ? BN.red(conf.prime) : BN.mont(this.p)),\n (this.zero = new BN(0).toRed(this.red)),\n (this.one = new BN(1).toRed(this.red)),\n (this.two = new BN(2).toRed(this.red)),\n (this.n = conf.n && new BN(conf.n, 16)),\n (this.g = conf.g && this.pointFromJSON(conf.g, conf.gRed)),\n (this._wnafT1 = new Array(4)),\n (this._wnafT2 = new Array(4)),\n (this._wnafT3 = new Array(4)),\n (this._wnafT4 = new Array(4)),\n (this._bitLength = this.n ? this.n.bitLength() : 0);\n var adjustCount = this.n && this.p.div(this.n);\n !adjustCount || adjustCount.cmpn(100) > 0\n ? (this.redN = null)\n : ((this._maxwellTrick = !0), (this.redN = this.n.toRed(this.red)));\n }\n module.exports = BaseCurve;\n BaseCurve.prototype.point = function () {\n throw new Error(\"Not implemented\");\n };\n BaseCurve.prototype.validate = function () {\n throw new Error(\"Not implemented\");\n };\n BaseCurve.prototype._fixedNafMul = function (p, k) {\n assert(p.precomputed);\n var doubles = p._getDoubles(),\n naf = getNAF(k, 1, this._bitLength),\n I = (1 << (doubles.step + 1)) - (doubles.step % 2 === 0 ? 2 : 1);\n I /= 3;\n var repr = [],\n j,\n nafW;\n for (j = 0; j < naf.length; j += doubles.step) {\n nafW = 0;\n for (var l = j + doubles.step - 1; l >= j; l--) nafW = (nafW << 1) + naf[l];\n repr.push(nafW);\n }\n for (var a = this.jpoint(null, null, null), b = this.jpoint(null, null, null), i = I; i > 0; i--) {\n for (j = 0; j < repr.length; j++)\n (nafW = repr[j]),\n nafW === i ? (b = b.mixedAdd(doubles.points[j])) : nafW === -i && (b = b.mixedAdd(doubles.points[j].neg()));\n a = a.add(b);\n }\n return a.toP();\n };\n BaseCurve.prototype._wnafMul = function (p, k) {\n var w = 4,\n nafPoints = p._getNAFPoints(w);\n w = nafPoints.wnd;\n for (\n var wnd = nafPoints.points,\n naf = getNAF(k, w, this._bitLength),\n acc = this.jpoint(null, null, null),\n i = naf.length - 1;\n i >= 0;\n i--\n ) {\n for (var l = 0; i >= 0 && naf[i] === 0; i--) l++;\n if ((i >= 0 && l++, (acc = acc.dblp(l)), i < 0)) break;\n var z = naf[i];\n assert(z !== 0),\n p.type === \"affine\"\n ? z > 0\n ? (acc = acc.mixedAdd(wnd[(z - 1) >> 1]))\n : (acc = acc.mixedAdd(wnd[(-z - 1) >> 1].neg()))\n : z > 0\n ? (acc = acc.add(wnd[(z - 1) >> 1]))\n : (acc = acc.add(wnd[(-z - 1) >> 1].neg()));\n }\n return p.type === \"affine\" ? acc.toP() : acc;\n };\n BaseCurve.prototype._wnafMulAdd = function (defW, points, coeffs, len, jacobianResult) {\n var wndWidth = this._wnafT1,\n wnd = this._wnafT2,\n naf = this._wnafT3,\n max = 0,\n i,\n j,\n p;\n for (i = 0; i < len; i++) {\n p = points[i];\n var nafPoints = p._getNAFPoints(defW);\n (wndWidth[i] = nafPoints.wnd), (wnd[i] = nafPoints.points);\n }\n for (i = len - 1; i >= 1; i -= 2) {\n var a = i - 1,\n b = i;\n if (wndWidth[a] !== 1 || wndWidth[b] !== 1) {\n (naf[a] = getNAF(coeffs[a], wndWidth[a], this._bitLength)),\n (naf[b] = getNAF(coeffs[b], wndWidth[b], this._bitLength)),\n (max = Math.max(naf[a].length, max)),\n (max = Math.max(naf[b].length, max));\n continue;\n }\n var comb = [points[a], null, null, points[b]];\n points[a].y.cmp(points[b].y) === 0\n ? ((comb[1] = points[a].add(points[b])), (comb[2] = points[a].toJ().mixedAdd(points[b].neg())))\n : points[a].y.cmp(points[b].y.redNeg()) === 0\n ? ((comb[1] = points[a].toJ().mixedAdd(points[b])), (comb[2] = points[a].add(points[b].neg())))\n : ((comb[1] = points[a].toJ().mixedAdd(points[b])), (comb[2] = points[a].toJ().mixedAdd(points[b].neg())));\n var index = [-3, -1, -5, -7, 0, 7, 5, 1, 3],\n jsf = getJSF(coeffs[a], coeffs[b]);\n for (\n max = Math.max(jsf[0].length, max), naf[a] = new Array(max), naf[b] = new Array(max), j = 0;\n j < max;\n j++\n ) {\n var ja = jsf[0][j] | 0,\n jb = jsf[1][j] | 0;\n (naf[a][j] = index[(ja + 1) * 3 + (jb + 1)]), (naf[b][j] = 0), (wnd[a] = comb);\n }\n }\n var acc = this.jpoint(null, null, null),\n tmp = this._wnafT4;\n for (i = max; i >= 0; i--) {\n for (var k = 0; i >= 0; ) {\n var zero = !0;\n for (j = 0; j < len; j++) (tmp[j] = naf[j][i] | 0), tmp[j] !== 0 && (zero = !1);\n if (!zero) break;\n k++, i--;\n }\n if ((i >= 0 && k++, (acc = acc.dblp(k)), i < 0)) break;\n for (j = 0; j < len; j++) {\n var z = tmp[j];\n z !== 0 &&\n (z > 0 ? (p = wnd[j][(z - 1) >> 1]) : z < 0 && (p = wnd[j][(-z - 1) >> 1].neg()),\n p.type === \"affine\" ? (acc = acc.mixedAdd(p)) : (acc = acc.add(p)));\n }\n }\n for (i = 0; i < len; i++) wnd[i] = null;\n return jacobianResult ? acc : acc.toP();\n };\n function BasePoint(curve, type) {\n (this.curve = curve), (this.type = type), (this.precomputed = null);\n }\n BaseCurve.BasePoint = BasePoint;\n BasePoint.prototype.eq = function () {\n throw new Error(\"Not implemented\");\n };\n BasePoint.prototype.validate = function () {\n return this.curve.validate(this);\n };\n BaseCurve.prototype.decodePoint = function (bytes, enc) {\n bytes = utils.toArray(bytes, enc);\n var len = this.p.byteLength();\n if ((bytes[0] === 4 || bytes[0] === 6 || bytes[0] === 7) && bytes.length - 1 === 2 * len) {\n bytes[0] === 6\n ? assert(bytes[bytes.length - 1] % 2 === 0)\n : bytes[0] === 7 && assert(bytes[bytes.length - 1] % 2 === 1);\n var res = this.point(bytes.slice(1, 1 + len), bytes.slice(1 + len, 1 + 2 * len));\n return res;\n } else if ((bytes[0] === 2 || bytes[0] === 3) && bytes.length - 1 === len)\n return this.pointFromX(bytes.slice(1, 1 + len), bytes[0] === 3);\n throw new Error(\"Unknown point format\");\n };\n BasePoint.prototype.encodeCompressed = function (enc) {\n return this.encode(enc, !0);\n };\n BasePoint.prototype._encode = function (compact) {\n var len = this.curve.p.byteLength(),\n x = this.getX().toArray(\"be\", len);\n return compact ? [this.getY().isEven() ? 2 : 3].concat(x) : [4].concat(x, this.getY().toArray(\"be\", len));\n };\n BasePoint.prototype.encode = function (enc, compact) {\n return utils.encode(this._encode(compact), enc);\n };\n BasePoint.prototype.precompute = function (power) {\n if (this.precomputed) return this;\n var precomputed = {\n doubles: null,\n naf: null,\n beta: null,\n };\n return (\n (precomputed.naf = this._getNAFPoints(8)),\n (precomputed.doubles = this._getDoubles(4, power)),\n (precomputed.beta = this._getBeta()),\n (this.precomputed = precomputed),\n this\n );\n };\n BasePoint.prototype._hasDoubles = function (k) {\n if (!this.precomputed) return !1;\n var doubles = this.precomputed.doubles;\n return doubles ? doubles.points.length >= Math.ceil((k.bitLength() + 1) / doubles.step) : !1;\n };\n BasePoint.prototype._getDoubles = function (step, power) {\n if (this.precomputed && this.precomputed.doubles) return this.precomputed.doubles;\n for (var doubles = [this], acc = this, i = 0; i < power; i += step) {\n for (var j = 0; j < step; j++) acc = acc.dbl();\n doubles.push(acc);\n }\n return {\n step,\n points: doubles,\n };\n };\n BasePoint.prototype._getNAFPoints = function (wnd) {\n if (this.precomputed && this.precomputed.naf) return this.precomputed.naf;\n for (var res = [this], max = (1 << wnd) - 1, dbl = max === 1 ? null : this.dbl(), i = 1; i < max; i++)\n res[i] = res[i - 1].add(dbl);\n return {\n wnd,\n points: res,\n };\n };\n BasePoint.prototype._getBeta = function () {\n return null;\n };\n BasePoint.prototype.dblp = function (k) {\n for (var r = this, i = 0; i < k; i++) r = r.dbl();\n return r;\n };\n },\n});\n\n// node_modules/elliptic/lib/elliptic/curve/short.js\nvar require_short = __commonJS({\n \"node_modules/elliptic/lib/elliptic/curve/short.js\"(exports, module) {\n \"use strict\";\n var utils = require_utils3(),\n BN = require_bn4(),\n inherits = require_inherits_browser(),\n Base = require_base(),\n assert = utils.assert;\n function ShortCurve(conf) {\n Base.call(this, \"short\", conf),\n (this.a = new BN(conf.a, 16).toRed(this.red)),\n (this.b = new BN(conf.b, 16).toRed(this.red)),\n (this.tinv = this.two.redInvm()),\n (this.zeroA = this.a.fromRed().cmpn(0) === 0),\n (this.threeA = this.a.fromRed().sub(this.p).cmpn(-3) === 0),\n (this.endo = this._getEndomorphism(conf)),\n (this._endoWnafT1 = new Array(4)),\n (this._endoWnafT2 = new Array(4));\n }\n inherits(ShortCurve, Base);\n module.exports = ShortCurve;\n ShortCurve.prototype._getEndomorphism = function (conf) {\n if (!(!this.zeroA || !this.g || !this.n || this.p.modn(3) !== 1)) {\n var beta, lambda;\n if (conf.beta) beta = new BN(conf.beta, 16).toRed(this.red);\n else {\n var betas = this._getEndoRoots(this.p);\n (beta = betas[0].cmp(betas[1]) < 0 ? betas[0] : betas[1]), (beta = beta.toRed(this.red));\n }\n if (conf.lambda) lambda = new BN(conf.lambda, 16);\n else {\n var lambdas = this._getEndoRoots(this.n);\n this.g.mul(lambdas[0]).x.cmp(this.g.x.redMul(beta)) === 0\n ? (lambda = lambdas[0])\n : ((lambda = lambdas[1]), assert(this.g.mul(lambda).x.cmp(this.g.x.redMul(beta)) === 0));\n }\n var basis;\n return (\n conf.basis\n ? (basis = conf.basis.map(function (vec) {\n return {\n a: new BN(vec.a, 16),\n b: new BN(vec.b, 16),\n };\n }))\n : (basis = this._getEndoBasis(lambda)),\n {\n beta,\n lambda,\n basis,\n }\n );\n }\n };\n ShortCurve.prototype._getEndoRoots = function (num) {\n var red = num === this.p ? this.red : BN.mont(num),\n tinv = new BN(2).toRed(red).redInvm(),\n ntinv = tinv.redNeg(),\n s = new BN(3).toRed(red).redNeg().redSqrt().redMul(tinv),\n l1 = ntinv.redAdd(s).fromRed(),\n l2 = ntinv.redSub(s).fromRed();\n return [l1, l2];\n };\n ShortCurve.prototype._getEndoBasis = function (lambda) {\n for (\n var aprxSqrt = this.n.ushrn(Math.floor(this.n.bitLength() / 2)),\n u = lambda,\n v = this.n.clone(),\n x1 = new BN(1),\n y1 = new BN(0),\n x2 = new BN(0),\n y2 = new BN(1),\n a0,\n b0,\n a1,\n b1,\n a2,\n b2,\n prevR,\n i = 0,\n r,\n x;\n u.cmpn(0) !== 0;\n\n ) {\n var q = v.div(u);\n (r = v.sub(q.mul(u))), (x = x2.sub(q.mul(x1)));\n var y = y2.sub(q.mul(y1));\n if (!a1 && r.cmp(aprxSqrt) < 0) (a0 = prevR.neg()), (b0 = x1), (a1 = r.neg()), (b1 = x);\n else if (a1 && ++i === 2) break;\n (prevR = r), (v = u), (u = r), (x2 = x1), (x1 = x), (y2 = y1), (y1 = y);\n }\n (a2 = r.neg()), (b2 = x);\n var len1 = a1.sqr().add(b1.sqr()),\n len2 = a2.sqr().add(b2.sqr());\n return (\n len2.cmp(len1) >= 0 && ((a2 = a0), (b2 = b0)),\n a1.negative && ((a1 = a1.neg()), (b1 = b1.neg())),\n a2.negative && ((a2 = a2.neg()), (b2 = b2.neg())),\n [\n { a: a1, b: b1 },\n { a: a2, b: b2 },\n ]\n );\n };\n ShortCurve.prototype._endoSplit = function (k) {\n var basis = this.endo.basis,\n v1 = basis[0],\n v2 = basis[1],\n c1 = v2.b.mul(k).divRound(this.n),\n c2 = v1.b.neg().mul(k).divRound(this.n),\n p1 = c1.mul(v1.a),\n p2 = c2.mul(v2.a),\n q1 = c1.mul(v1.b),\n q2 = c2.mul(v2.b),\n k1 = k.sub(p1).sub(p2),\n k2 = q1.add(q2).neg();\n return { k1, k2 };\n };\n ShortCurve.prototype.pointFromX = function (x, odd) {\n (x = new BN(x, 16)), x.red || (x = x.toRed(this.red));\n var y2 = x.redSqr().redMul(x).redIAdd(x.redMul(this.a)).redIAdd(this.b),\n y = y2.redSqrt();\n if (y.redSqr().redSub(y2).cmp(this.zero) !== 0) throw new Error(\"invalid point\");\n var isOdd = y.fromRed().isOdd();\n return ((odd && !isOdd) || (!odd && isOdd)) && (y = y.redNeg()), this.point(x, y);\n };\n ShortCurve.prototype.validate = function (point) {\n if (point.inf) return !0;\n var x = point.x,\n y = point.y,\n ax = this.a.redMul(x),\n rhs = x.redSqr().redMul(x).redIAdd(ax).redIAdd(this.b);\n return y.redSqr().redISub(rhs).cmpn(0) === 0;\n };\n ShortCurve.prototype._endoWnafMulAdd = function (points, coeffs, jacobianResult) {\n for (var npoints = this._endoWnafT1, ncoeffs = this._endoWnafT2, i = 0; i < points.length; i++) {\n var split = this._endoSplit(coeffs[i]),\n p = points[i],\n beta = p._getBeta();\n split.k1.negative && (split.k1.ineg(), (p = p.neg(!0))),\n split.k2.negative && (split.k2.ineg(), (beta = beta.neg(!0))),\n (npoints[i * 2] = p),\n (npoints[i * 2 + 1] = beta),\n (ncoeffs[i * 2] = split.k1),\n (ncoeffs[i * 2 + 1] = split.k2);\n }\n for (var res = this._wnafMulAdd(1, npoints, ncoeffs, i * 2, jacobianResult), j = 0; j < i * 2; j++)\n (npoints[j] = null), (ncoeffs[j] = null);\n return res;\n };\n function Point(curve, x, y, isRed) {\n Base.BasePoint.call(this, curve, \"affine\"),\n x === null && y === null\n ? ((this.x = null), (this.y = null), (this.inf = !0))\n : ((this.x = new BN(x, 16)),\n (this.y = new BN(y, 16)),\n isRed && (this.x.forceRed(this.curve.red), this.y.forceRed(this.curve.red)),\n this.x.red || (this.x = this.x.toRed(this.curve.red)),\n this.y.red || (this.y = this.y.toRed(this.curve.red)),\n (this.inf = !1));\n }\n inherits(Point, Base.BasePoint);\n ShortCurve.prototype.point = function (x, y, isRed) {\n return new Point(this, x, y, isRed);\n };\n ShortCurve.prototype.pointFromJSON = function (obj, red) {\n return Point.fromJSON(this, obj, red);\n };\n Point.prototype._getBeta = function () {\n if (!!this.curve.endo) {\n var pre = this.precomputed;\n if (pre && pre.beta) return pre.beta;\n var beta = this.curve.point(this.x.redMul(this.curve.endo.beta), this.y);\n if (pre) {\n var curve = this.curve,\n endoMul = function (p) {\n return curve.point(p.x.redMul(curve.endo.beta), p.y);\n };\n (pre.beta = beta),\n (beta.precomputed = {\n beta: null,\n naf: pre.naf && {\n wnd: pre.naf.wnd,\n points: pre.naf.points.map(endoMul),\n },\n doubles: pre.doubles && {\n step: pre.doubles.step,\n points: pre.doubles.points.map(endoMul),\n },\n });\n }\n return beta;\n }\n };\n Point.prototype.toJSON = function () {\n return this.precomputed\n ? [\n this.x,\n this.y,\n this.precomputed && {\n doubles: this.precomputed.doubles && {\n step: this.precomputed.doubles.step,\n points: this.precomputed.doubles.points.slice(1),\n },\n naf: this.precomputed.naf && {\n wnd: this.precomputed.naf.wnd,\n points: this.precomputed.naf.points.slice(1),\n },\n },\n ]\n : [this.x, this.y];\n };\n Point.fromJSON = function (curve, obj, red) {\n typeof obj == \"string\" && (obj = JSON.parse(obj));\n var res = curve.point(obj[0], obj[1], red);\n if (!obj[2]) return res;\n function obj2point(obj2) {\n return curve.point(obj2[0], obj2[1], red);\n }\n var pre = obj[2];\n return (\n (res.precomputed = {\n beta: null,\n doubles: pre.doubles && {\n step: pre.doubles.step,\n points: [res].concat(pre.doubles.points.map(obj2point)),\n },\n naf: pre.naf && {\n wnd: pre.naf.wnd,\n points: [res].concat(pre.naf.points.map(obj2point)),\n },\n }),\n res\n );\n };\n Point.prototype.inspect = function () {\n return this.isInfinity()\n ? \"<EC Point Infinity>\"\n : \"<EC Point x: \" + this.x.fromRed().toString(16, 2) + \" y: \" + this.y.fromRed().toString(16, 2) + \">\";\n };\n Point.prototype.isInfinity = function () {\n return this.inf;\n };\n Point.prototype.add = function (p) {\n if (this.inf) return p;\n if (p.inf) return this;\n if (this.eq(p)) return this.dbl();\n if (this.neg().eq(p)) return this.curve.point(null, null);\n if (this.x.cmp(p.x) === 0) return this.curve.point(null, null);\n var c = this.y.redSub(p.y);\n c.cmpn(0) !== 0 && (c = c.redMul(this.x.redSub(p.x).redInvm()));\n var nx = c.redSqr().redISub(this.x).redISub(p.x),\n ny = c.redMul(this.x.redSub(nx)).redISub(this.y);\n return this.curve.point(nx, ny);\n };\n Point.prototype.dbl = function () {\n if (this.inf) return this;\n var ys1 = this.y.redAdd(this.y);\n if (ys1.cmpn(0) === 0) return this.curve.point(null, null);\n var a = this.curve.a,\n x2 = this.x.redSqr(),\n dyinv = ys1.redInvm(),\n c = x2.redAdd(x2).redIAdd(x2).redIAdd(a).redMul(dyinv),\n nx = c.redSqr().redISub(this.x.redAdd(this.x)),\n ny = c.redMul(this.x.redSub(nx)).redISub(this.y);\n return this.curve.point(nx, ny);\n };\n Point.prototype.getX = function () {\n return this.x.fromRed();\n };\n Point.prototype.getY = function () {\n return this.y.fromRed();\n };\n Point.prototype.mul = function (k) {\n return (\n (k = new BN(k, 16)),\n this.isInfinity()\n ? this\n : this._hasDoubles(k)\n ? this.curve._fixedNafMul(this, k)\n : this.curve.endo\n ? this.curve._endoWnafMulAdd([this], [k])\n : this.curve._wnafMul(this, k)\n );\n };\n Point.prototype.mulAdd = function (k1, p2, k2) {\n var points = [this, p2],\n coeffs = [k1, k2];\n return this.curve.endo\n ? this.curve._endoWnafMulAdd(points, coeffs)\n : this.curve._wnafMulAdd(1, points, coeffs, 2);\n };\n Point.prototype.jmulAdd = function (k1, p2, k2) {\n var points = [this, p2],\n coeffs = [k1, k2];\n return this.curve.endo\n ? this.curve._endoWnafMulAdd(points, coeffs, !0)\n : this.curve._wnafMulAdd(1, points, coeffs, 2, !0);\n };\n Point.prototype.eq = function (p) {\n return this === p || (this.inf === p.inf && (this.inf || (this.x.cmp(p.x) === 0 && this.y.cmp(p.y) === 0)));\n };\n Point.prototype.neg = function (_precompute) {\n if (this.inf) return this;\n var res = this.curve.point(this.x, this.y.redNeg());\n if (_precompute && this.precomputed) {\n var pre = this.precomputed,\n negate = function (p) {\n return p.neg();\n };\n res.precomputed = {\n naf: pre.naf && {\n wnd: pre.naf.wnd,\n points: pre.naf.points.map(negate),\n },\n doubles: pre.doubles && {\n step: pre.doubles.step,\n points: pre.doubles.points.map(negate),\n },\n };\n }\n return res;\n };\n Point.prototype.toJ = function () {\n if (this.inf) return this.curve.jpoint(null, null, null);\n var res = this.curve.jpoint(this.x, this.y, this.curve.one);\n return res;\n };\n function JPoint(curve, x, y, z) {\n Base.BasePoint.call(this, curve, \"jacobian\"),\n x === null && y === null && z === null\n ? ((this.x = this.curve.one), (this.y = this.curve.one), (this.z = new BN(0)))\n : ((this.x = new BN(x, 16)), (this.y = new BN(y, 16)), (this.z = new BN(z, 16))),\n this.x.red || (this.x = this.x.toRed(this.curve.red)),\n this.y.red || (this.y = this.y.toRed(this.curve.red)),\n this.z.red || (this.z = this.z.toRed(this.curve.red)),\n (this.zOne = this.z === this.curve.one);\n }\n inherits(JPoint, Base.BasePoint);\n ShortCurve.prototype.jpoint = function (x, y, z) {\n return new JPoint(this, x, y, z);\n };\n JPoint.prototype.toP = function () {\n if (this.isInfinity()) return this.curve.point(null, null);\n var zinv = this.z.redInvm(),\n zinv2 = zinv.redSqr(),\n ax = this.x.redMul(zinv2),\n ay = this.y.redMul(zinv2).redMul(zinv);\n return this.curve.point(ax, ay);\n };\n JPoint.prototype.neg = function () {\n return this.curve.jpoint(this.x, this.y.redNeg(), this.z);\n };\n JPoint.prototype.add = function (p) {\n if (this.isInfinity()) return p;\n if (p.isInfinity()) return this;\n var pz2 = p.z.redSqr(),\n z2 = this.z.redSqr(),\n u1 = this.x.redMul(pz2),\n u2 = p.x.redMul(z2),\n s1 = this.y.redMul(pz2.redMul(p.z)),\n s2 = p.y.redMul(z2.redMul(this.z)),\n h = u1.redSub(u2),\n r = s1.redSub(s2);\n if (h.cmpn(0) === 0) return r.cmpn(0) !== 0 ? this.curve.jpoint(null, null, null) : this.dbl();\n var h2 = h.redSqr(),\n h3 = h2.redMul(h),\n v = u1.redMul(h2),\n nx = r.redSqr().redIAdd(h3).redISub(v).redISub(v),\n ny = r.redMul(v.redISub(nx)).redISub(s1.redMul(h3)),\n nz = this.z.redMul(p.z).redMul(h);\n return this.curve.jpoint(nx, ny, nz);\n };\n JPoint.prototype.mixedAdd = function (p) {\n if (this.isInfinity()) return p.toJ();\n if (p.isInfinity()) return this;\n var z2 = this.z.redSqr(),\n u1 = this.x,\n u2 = p.x.redMul(z2),\n s1 = this.y,\n s2 = p.y.redMul(z2).redMul(this.z),\n h = u1.redSub(u2),\n r = s1.redSub(s2);\n if (h.cmpn(0) === 0) return r.cmpn(0) !== 0 ? this.curve.jpoint(null, null, null) : this.dbl();\n var h2 = h.redSqr(),\n h3 = h2.redMul(h),\n v = u1.redMul(h2),\n nx = r.redSqr().redIAdd(h3).redISub(v).redISub(v),\n ny = r.redMul(v.redISub(nx)).redISub(s1.redMul(h3)),\n nz = this.z.redMul(h);\n return this.curve.jpoint(nx, ny, nz);\n };\n JPoint.prototype.dblp = function (pow) {\n if (pow === 0) return this;\n if (this.isInfinity()) return this;\n if (!pow) return this.dbl();\n var i;\n if (this.curve.zeroA || this.curve.threeA) {\n var r = this;\n for (i = 0; i < pow; i++) r = r.dbl();\n return r;\n }\n var a = this.curve.a,\n tinv = this.curve.tinv,\n jx = this.x,\n jy = this.y,\n jz = this.z,\n jz4 = jz.redSqr().redSqr(),\n jyd = jy.redAdd(jy);\n for (i = 0; i < pow; i++) {\n var jx2 = jx.redSqr(),\n jyd2 = jyd.redSqr(),\n jyd4 = jyd2.redSqr(),\n c = jx2.redAdd(jx2).redIAdd(jx2).redIAdd(a.redMul(jz4)),\n t1 = jx.redMul(jyd2),\n nx = c.redSqr().redISub(t1.redAdd(t1)),\n t2 = t1.redISub(nx),\n dny = c.redMul(t2);\n dny = dny.redIAdd(dny).redISub(jyd4);\n var nz = jyd.redMul(jz);\n i + 1 < pow && (jz4 = jz4.redMul(jyd4)), (jx = nx), (jz = nz), (jyd = dny);\n }\n return this.curve.jpoint(jx, jyd.redMul(tinv), jz);\n };\n JPoint.prototype.dbl = function () {\n return this.isInfinity()\n ? this\n : this.curve.zeroA\n ? this._zeroDbl()\n : this.curve.threeA\n ? this._threeDbl()\n : this._dbl();\n };\n JPoint.prototype._zeroDbl = function () {\n var nx, ny, nz;\n if (this.zOne) {\n var xx = this.x.redSqr(),\n yy = this.y.redSqr(),\n yyyy = yy.redSqr(),\n s = this.x.redAdd(yy).redSqr().redISub(xx).redISub(yyyy);\n s = s.redIAdd(s);\n var m = xx.redAdd(xx).redIAdd(xx),\n t = m.redSqr().redISub(s).redISub(s),\n yyyy8 = yyyy.redIAdd(yyyy);\n (yyyy8 = yyyy8.redIAdd(yyyy8)),\n (yyyy8 = yyyy8.redIAdd(yyyy8)),\n (nx = t),\n (ny = m.redMul(s.redISub(t)).redISub(yyyy8)),\n (nz = this.y.redAdd(this.y));\n } else {\n var a = this.x.redSqr(),\n b = this.y.redSqr(),\n c = b.redSqr(),\n d = this.x.redAdd(b).redSqr().redISub(a).redISub(c);\n d = d.redIAdd(d);\n var e = a.redAdd(a).redIAdd(a),\n f = e.redSqr(),\n c8 = c.redIAdd(c);\n (c8 = c8.redIAdd(c8)),\n (c8 = c8.redIAdd(c8)),\n (nx = f.redISub(d).redISub(d)),\n (ny = e.redMul(d.redISub(nx)).redISub(c8)),\n (nz = this.y.redMul(this.z)),\n (nz = nz.redIAdd(nz));\n }\n return this.curve.jpoint(nx, ny, nz);\n };\n JPoint.prototype._threeDbl = function () {\n var nx, ny, nz;\n if (this.zOne) {\n var xx = this.x.redSqr(),\n yy = this.y.redSqr(),\n yyyy = yy.redSqr(),\n s = this.x.redAdd(yy).redSqr().redISub(xx).redISub(yyyy);\n s = s.redIAdd(s);\n var m = xx.redAdd(xx).redIAdd(xx).redIAdd(this.curve.a),\n t = m.redSqr().redISub(s).redISub(s);\n nx = t;\n var yyyy8 = yyyy.redIAdd(yyyy);\n (yyyy8 = yyyy8.redIAdd(yyyy8)),\n (yyyy8 = yyyy8.redIAdd(yyyy8)),\n (ny = m.redMul(s.redISub(t)).redISub(yyyy8)),\n (nz = this.y.redAdd(this.y));\n } else {\n var delta = this.z.redSqr(),\n gamma = this.y.redSqr(),\n beta = this.x.redMul(gamma),\n alpha = this.x.redSub(delta).redMul(this.x.redAdd(delta));\n alpha = alpha.redAdd(alpha).redIAdd(alpha);\n var beta4 = beta.redIAdd(beta);\n beta4 = beta4.redIAdd(beta4);\n var beta8 = beta4.redAdd(beta4);\n (nx = alpha.redSqr().redISub(beta8)), (nz = this.y.redAdd(this.z).redSqr().redISub(gamma).redISub(delta));\n var ggamma8 = gamma.redSqr();\n (ggamma8 = ggamma8.redIAdd(ggamma8)),\n (ggamma8 = ggamma8.redIAdd(ggamma8)),\n (ggamma8 = ggamma8.redIAdd(ggamma8)),\n (ny = alpha.redMul(beta4.redISub(nx)).redISub(ggamma8));\n }\n return this.curve.jpoint(nx, ny, nz);\n };\n JPoint.prototype._dbl = function () {\n var a = this.curve.a,\n jx = this.x,\n jy = this.y,\n jz = this.z,\n jz4 = jz.redSqr().redSqr(),\n jx2 = jx.redSqr(),\n jy2 = jy.redSqr(),\n c = jx2.redAdd(jx2).redIAdd(jx2).redIAdd(a.redMul(jz4)),\n jxd4 = jx.redAdd(jx);\n jxd4 = jxd4.redIAdd(jxd4);\n var t1 = jxd4.redMul(jy2),\n nx = c.redSqr().redISub(t1.redAdd(t1)),\n t2 = t1.redISub(nx),\n jyd8 = jy2.redSqr();\n (jyd8 = jyd8.redIAdd(jyd8)), (jyd8 = jyd8.redIAdd(jyd8)), (jyd8 = jyd8.redIAdd(jyd8));\n var ny = c.redMul(t2).redISub(jyd8),\n nz = jy.redAdd(jy).redMul(jz);\n return this.curve.jpoint(nx, ny, nz);\n };\n JPoint.prototype.trpl = function () {\n if (!this.curve.zeroA) return this.dbl().add(this);\n var xx = this.x.redSqr(),\n yy = this.y.redSqr(),\n zz = this.z.redSqr(),\n yyyy = yy.redSqr(),\n m = xx.redAdd(xx).redIAdd(xx),\n mm = m.redSqr(),\n e = this.x.redAdd(yy).redSqr().redISub(xx).redISub(yyyy);\n (e = e.redIAdd(e)), (e = e.redAdd(e).redIAdd(e)), (e = e.redISub(mm));\n var ee = e.redSqr(),\n t = yyyy.redIAdd(yyyy);\n (t = t.redIAdd(t)), (t = t.redIAdd(t)), (t = t.redIAdd(t));\n var u = m.redIAdd(e).redSqr().redISub(mm).redISub(ee).redISub(t),\n yyu4 = yy.redMul(u);\n (yyu4 = yyu4.redIAdd(yyu4)), (yyu4 = yyu4.redIAdd(yyu4));\n var nx = this.x.redMul(ee).redISub(yyu4);\n (nx = nx.redIAdd(nx)), (nx = nx.redIAdd(nx));\n var ny = this.y.redMul(u.redMul(t.redISub(u)).redISub(e.redMul(ee)));\n (ny = ny.redIAdd(ny)), (ny = ny.redIAdd(ny)), (ny = ny.redIAdd(ny));\n var nz = this.z.redAdd(e).redSqr().redISub(zz).redISub(ee);\n return this.curve.jpoint(nx, ny, nz);\n };\n JPoint.prototype.mul = function (k, kbase) {\n return (k = new BN(k, kbase)), this.curve._wnafMul(this, k);\n };\n JPoint.prototype.eq = function (p) {\n if (p.type === \"affine\") return this.eq(p.toJ());\n if (this === p) return !0;\n var z2 = this.z.redSqr(),\n pz2 = p.z.redSqr();\n if (this.x.redMul(pz2).redISub(p.x.redMul(z2)).cmpn(0) !== 0) return !1;\n var z3 = z2.redMul(this.z),\n pz3 = pz2.redMul(p.z);\n return this.y.redMul(pz3).redISub(p.y.redMul(z3)).cmpn(0) === 0;\n };\n JPoint.prototype.eqXToP = function (x) {\n var zs = this.z.redSqr(),\n rx = x.toRed(this.curve.red).redMul(zs);\n if (this.x.cmp(rx) === 0) return !0;\n for (var xc = x.clone(), t = this.curve.redN.redMul(zs); ; ) {\n if ((xc.iadd(this.curve.n), xc.cmp(this.curve.p) >= 0)) return !1;\n if ((rx.redIAdd(t), this.x.cmp(rx) === 0)) return !0;\n }\n };\n JPoint.prototype.inspect = function () {\n return this.isInfinity()\n ? \"<EC JPoint Infinity>\"\n : \"<EC JPoint x: \" +\n this.x.toString(16, 2) +\n \" y: \" +\n this.y.toString(16, 2) +\n \" z: \" +\n this.z.toString(16, 2) +\n \">\";\n };\n JPoint.prototype.isInfinity = function () {\n return this.z.cmpn(0) === 0;\n };\n },\n});\n\n// node_modules/elliptic/lib/elliptic/curve/mont.js\nvar require_mont = __commonJS({\n \"node_modules/elliptic/lib/elliptic/curve/mont.js\"(exports, module) {\n \"use strict\";\n var BN = require_bn4(),\n inherits = require_inherits_browser(),\n Base = require_base(),\n utils = require_utils3();\n function MontCurve(conf) {\n Base.call(this, \"mont\", conf),\n (this.a = new BN(conf.a, 16).toRed(this.red)),\n (this.b = new BN(conf.b, 16).toRed(this.red)),\n (this.i4 = new BN(4).toRed(this.red).redInvm()),\n (this.two = new BN(2).toRed(this.red)),\n (this.a24 = this.i4.redMul(this.a.redAdd(this.two)));\n }\n inherits(MontCurve, Base);\n module.exports = MontCurve;\n MontCurve.prototype.validate = function (point) {\n var x = point.normalize().x,\n x2 = x.redSqr(),\n rhs = x2.redMul(x).redAdd(x2.redMul(this.a)).redAdd(x),\n y = rhs.redSqrt();\n return y.redSqr().cmp(rhs) === 0;\n };\n function Point(curve, x, z) {\n Base.BasePoint.call(this, curve, \"projective\"),\n x === null && z === null\n ? ((this.x = this.curve.one), (this.z = this.curve.zero))\n : ((this.x = new BN(x, 16)),\n (this.z = new BN(z, 16)),\n this.x.red || (this.x = this.x.toRed(this.curve.red)),\n this.z.red || (this.z = this.z.toRed(this.curve.red)));\n }\n inherits(Point, Base.BasePoint);\n MontCurve.prototype.decodePoint = function (bytes, enc) {\n return this.point(utils.toArray(bytes, enc), 1);\n };\n MontCurve.prototype.point = function (x, z) {\n return new Point(this, x, z);\n };\n MontCurve.prototype.pointFromJSON = function (obj) {\n return Point.fromJSON(this, obj);\n };\n Point.prototype.precompute = function () {};\n Point.prototype._encode = function () {\n return this.getX().toArray(\"be\", this.curve.p.byteLength());\n };\n Point.fromJSON = function (curve, obj) {\n return new Point(curve, obj[0], obj[1] || curve.one);\n };\n Point.prototype.inspect = function () {\n return this.isInfinity()\n ? \"<EC Point Infinity>\"\n : \"<EC Point x: \" + this.x.fromRed().toString(16, 2) + \" z: \" + this.z.fromRed().toString(16, 2) + \">\";\n };\n Point.prototype.isInfinity = function () {\n return this.z.cmpn(0) === 0;\n };\n Point.prototype.dbl = function () {\n var a = this.x.redAdd(this.z),\n aa = a.redSqr(),\n b = this.x.redSub(this.z),\n bb = b.redSqr(),\n c = aa.redSub(bb),\n nx = aa.redMul(bb),\n nz = c.redMul(bb.redAdd(this.curve.a24.redMul(c)));\n return this.curve.point(nx, nz);\n };\n Point.prototype.add = function () {\n throw new Error(\"Not supported on Montgomery curve\");\n };\n Point.prototype.diffAdd = function (p, diff) {\n var a = this.x.redAdd(this.z),\n b = this.x.redSub(this.z),\n c = p.x.redAdd(p.z),\n d = p.x.redSub(p.z),\n da = d.redMul(a),\n cb = c.redMul(b),\n nx = diff.z.redMul(da.redAdd(cb).redSqr()),\n nz = diff.x.redMul(da.redISub(cb).redSqr());\n return this.curve.point(nx, nz);\n };\n Point.prototype.mul = function (k) {\n for (\n var t = k.clone(), a = this, b = this.curve.point(null, null), c = this, bits = [];\n t.cmpn(0) !== 0;\n t.iushrn(1)\n )\n bits.push(t.andln(1));\n for (var i = bits.length - 1; i >= 0; i--)\n bits[i] === 0 ? ((a = a.diffAdd(b, c)), (b = b.dbl())) : ((b = a.diffAdd(b, c)), (a = a.dbl()));\n return b;\n };\n Point.prototype.mulAdd = function () {\n throw new Error(\"Not supported on Montgomery curve\");\n };\n Point.prototype.jumlAdd = function () {\n throw new Error(\"Not supported on Montgomery curve\");\n };\n Point.prototype.eq = function (other) {\n return this.getX().cmp(other.getX()) === 0;\n };\n Point.prototype.normalize = function () {\n return (this.x = this.x.redMul(this.z.redInvm())), (this.z = this.curve.one), this;\n };\n Point.prototype.getX = function () {\n return this.normalize(), this.x.fromRed();\n };\n },\n});\n\n// node_modules/elliptic/lib/elliptic/curve/edwards.js\nvar require_edwards = __commonJS({\n \"node_modules/elliptic/lib/elliptic/curve/edwards.js\"(exports, module) {\n \"use strict\";\n var utils = require_utils3(),\n BN = require_bn4(),\n inherits = require_inherits_browser(),\n Base = require_base(),\n assert = utils.assert;\n function EdwardsCurve(conf) {\n (this.twisted = (conf.a | 0) !== 1),\n (this.mOneA = this.twisted && (conf.a | 0) === -1),\n (this.extended = this.mOneA),\n Base.call(this, \"edwards\", conf),\n (this.a = new BN(conf.a, 16).umod(this.red.m)),\n (this.a = this.a.toRed(this.red)),\n (this.c = new BN(conf.c, 16).toRed(this.red)),\n (this.c2 = this.c.redSqr()),\n (this.d = new BN(conf.d, 16).toRed(this.red)),\n (this.dd = this.d.redAdd(this.d)),\n assert(!this.twisted || this.c.fromRed().cmpn(1) === 0),\n (this.oneC = (conf.c | 0) === 1);\n }\n inherits(EdwardsCurve, Base);\n module.exports = EdwardsCurve;\n EdwardsCurve.prototype._mulA = function (num) {\n return this.mOneA ? num.redNeg() : this.a.redMul(num);\n };\n EdwardsCurve.prototype._mulC = function (num) {\n return this.oneC ? num : this.c.redMul(num);\n };\n EdwardsCurve.prototype.jpoint = function (x, y, z, t) {\n return this.point(x, y, z, t);\n };\n EdwardsCurve.prototype.pointFromX = function (x, odd) {\n (x = new BN(x, 16)), x.red || (x = x.toRed(this.red));\n var x2 = x.redSqr(),\n rhs = this.c2.redSub(this.a.redMul(x2)),\n lhs = this.one.redSub(this.c2.redMul(this.d).redMul(x2)),\n y2 = rhs.redMul(lhs.redInvm()),\n y = y2.redSqrt();\n if (y.redSqr().redSub(y2).cmp(this.zero) !== 0) throw new Error(\"invalid point\");\n var isOdd = y.fromRed().isOdd();\n return ((odd && !isOdd) || (!odd && isOdd)) && (y = y.redNeg()), this.point(x, y);\n };\n EdwardsCurve.prototype.pointFromY = function (y, odd) {\n (y = new BN(y, 16)), y.red || (y = y.toRed(this.red));\n var y2 = y.redSqr(),\n lhs = y2.redSub(this.c2),\n rhs = y2.redMul(this.d).redMul(this.c2).redSub(this.a),\n x2 = lhs.redMul(rhs.redInvm());\n if (x2.cmp(this.zero) === 0) {\n if (odd) throw new Error(\"invalid point\");\n return this.point(this.zero, y);\n }\n var x = x2.redSqrt();\n if (x.redSqr().redSub(x2).cmp(this.zero) !== 0) throw new Error(\"invalid point\");\n return x.fromRed().isOdd() !== odd && (x = x.redNeg()), this.point(x, y);\n };\n EdwardsCurve.prototype.validate = function (point) {\n if (point.isInfinity()) return !0;\n point.normalize();\n var x2 = point.x.redSqr(),\n y2 = point.y.redSqr(),\n lhs = x2.redMul(this.a).redAdd(y2),\n rhs = this.c2.redMul(this.one.redAdd(this.d.redMul(x2).redMul(y2)));\n return lhs.cmp(rhs) === 0;\n };\n function Point(curve, x, y, z, t) {\n Base.BasePoint.call(this, curve, \"projective\"),\n x === null && y === null && z === null\n ? ((this.x = this.curve.zero),\n (this.y = this.curve.one),\n (this.z = this.curve.one),\n (this.t = this.curve.zero),\n (this.zOne = !0))\n : ((this.x = new BN(x, 16)),\n (this.y = new BN(y, 16)),\n (this.z = z ? new BN(z, 16) : this.curve.one),\n (this.t = t && new BN(t, 16)),\n this.x.red || (this.x = this.x.toRed(this.curve.red)),\n this.y.red || (this.y = this.y.toRed(this.curve.red)),\n this.z.red || (this.z = this.z.toRed(this.curve.red)),\n this.t && !this.t.red && (this.t = this.t.toRed(this.curve.red)),\n (this.zOne = this.z === this.curve.one),\n this.curve.extended &&\n !this.t &&\n ((this.t = this.x.redMul(this.y)), this.zOne || (this.t = this.t.redMul(this.z.redInvm()))));\n }\n inherits(Point, Base.BasePoint);\n EdwardsCurve.prototype.pointFromJSON = function (obj) {\n return Point.fromJSON(this, obj);\n };\n EdwardsCurve.prototype.point = function (x, y, z, t) {\n return new Point(this, x, y, z, t);\n };\n Point.fromJSON = function (curve, obj) {\n return new Point(curve, obj[0], obj[1], obj[2]);\n };\n Point.prototype.inspect = function () {\n return this.isInfinity()\n ? \"<EC Point Infinity>\"\n : \"<EC Point x: \" +\n this.x.fromRed().toString(16, 2) +\n \" y: \" +\n this.y.fromRed().toString(16, 2) +\n \" z: \" +\n this.z.fromRed().toString(16, 2) +\n \">\";\n };\n Point.prototype.isInfinity = function () {\n return this.x.cmpn(0) === 0 && (this.y.cmp(this.z) === 0 || (this.zOne && this.y.cmp(this.curve.c) === 0));\n };\n Point.prototype._extDbl = function () {\n var a = this.x.redSqr(),\n b = this.y.redSqr(),\n c = this.z.redSqr();\n c = c.redIAdd(c);\n var d = this.curve._mulA(a),\n e = this.x.redAdd(this.y).redSqr().redISub(a).redISub(b),\n g = d.redAdd(b),\n f = g.redSub(c),\n h = d.redSub(b),\n nx = e.redMul(f),\n ny = g.redMul(h),\n nt = e.redMul(h),\n nz = f.redMul(g);\n return this.curve.point(nx, ny, nz, nt);\n };\n Point.prototype._projDbl = function () {\n var b = this.x.redAdd(this.y).redSqr(),\n c = this.x.redSqr(),\n d = this.y.redSqr(),\n nx,\n ny,\n nz,\n e,\n h,\n j;\n if (this.curve.twisted) {\n e = this.curve._mulA(c);\n var f = e.redAdd(d);\n this.zOne\n ? ((nx = b.redSub(c).redSub(d).redMul(f.redSub(this.curve.two))),\n (ny = f.redMul(e.redSub(d))),\n (nz = f.redSqr().redSub(f).redSub(f)))\n : ((h = this.z.redSqr()),\n (j = f.redSub(h).redISub(h)),\n (nx = b.redSub(c).redISub(d).redMul(j)),\n (ny = f.redMul(e.redSub(d))),\n (nz = f.redMul(j)));\n } else\n (e = c.redAdd(d)),\n (h = this.curve._mulC(this.z).redSqr()),\n (j = e.redSub(h).redSub(h)),\n (nx = this.curve._mulC(b.redISub(e)).redMul(j)),\n (ny = this.curve._mulC(e).redMul(c.redISub(d))),\n (nz = e.redMul(j));\n return this.curve.point(nx, ny, nz);\n };\n Point.prototype.dbl = function () {\n return this.isInfinity() ? this : this.curve.extended ? this._extDbl() : this._projDbl();\n };\n Point.prototype._extAdd = function (p) {\n var a = this.y.redSub(this.x).redMul(p.y.redSub(p.x)),\n b = this.y.redAdd(this.x).redMul(p.y.redAdd(p.x)),\n c = this.t.redMul(this.curve.dd).redMul(p.t),\n d = this.z.redMul(p.z.redAdd(p.z)),\n e = b.redSub(a),\n f = d.redSub(c),\n g = d.redAdd(c),\n h = b.redAdd(a),\n nx = e.redMul(f),\n ny = g.redMul(h),\n nt = e.redMul(h),\n nz = f.redMul(g);\n return this.curve.point(nx, ny, nz, nt);\n };\n Point.prototype._projAdd = function (p) {\n var a = this.z.redMul(p.z),\n b = a.redSqr(),\n c = this.x.redMul(p.x),\n d = this.y.redMul(p.y),\n e = this.curve.d.redMul(c).redMul(d),\n f = b.redSub(e),\n g = b.redAdd(e),\n tmp = this.x.redAdd(this.y).redMul(p.x.redAdd(p.y)).redISub(c).redISub(d),\n nx = a.redMul(f).redMul(tmp),\n ny,\n nz;\n return (\n this.curve.twisted\n ? ((ny = a.redMul(g).redMul(d.redSub(this.curve._mulA(c)))), (nz = f.redMul(g)))\n : ((ny = a.redMul(g).redMul(d.redSub(c))), (nz = this.curve._mulC(f).redMul(g))),\n this.curve.point(nx, ny, nz)\n );\n };\n Point.prototype.add = function (p) {\n return this.isInfinity() ? p : p.isInfinity() ? this : this.curve.extended ? this._extAdd(p) : this._projAdd(p);\n };\n Point.prototype.mul = function (k) {\n return this._hasDoubles(k) ? this.curve._fixedNafMul(this, k) : this.curve._wnafMul(this, k);\n };\n Point.prototype.mulAdd = function (k1, p, k2) {\n return this.curve._wnafMulAdd(1, [this, p], [k1, k2], 2, !1);\n };\n Point.prototype.jmulAdd = function (k1, p, k2) {\n return this.curve._wnafMulAdd(1, [this, p], [k1, k2], 2, !0);\n };\n Point.prototype.normalize = function () {\n if (this.zOne) return this;\n var zi = this.z.redInvm();\n return (\n (this.x = this.x.redMul(zi)),\n (this.y = this.y.redMul(zi)),\n this.t && (this.t = this.t.redMul(zi)),\n (this.z = this.curve.one),\n (this.zOne = !0),\n this\n );\n };\n Point.prototype.neg = function () {\n return this.curve.point(this.x.redNeg(), this.y, this.z, this.t && this.t.redNeg());\n };\n Point.prototype.getX = function () {\n return this.normalize(), this.x.fromRed();\n };\n Point.prototype.getY = function () {\n return this.normalize(), this.y.fromRed();\n };\n Point.prototype.eq = function (other) {\n return this === other || (this.getX().cmp(other.getX()) === 0 && this.getY().cmp(other.getY()) === 0);\n };\n Point.prototype.eqXToP = function (x) {\n var rx = x.toRed(this.curve.red).redMul(this.z);\n if (this.x.cmp(rx) === 0) return !0;\n for (var xc = x.clone(), t = this.curve.redN.redMul(this.z); ; ) {\n if ((xc.iadd(this.curve.n), xc.cmp(this.curve.p) >= 0)) return !1;\n if ((rx.redIAdd(t), this.x.cmp(rx) === 0)) return !0;\n }\n };\n Point.prototype.toP = Point.prototype.normalize;\n Point.prototype.mixedAdd = Point.prototype.add;\n },\n});\n\n// node_modules/elliptic/lib/elliptic/curve/index.js\nvar require_curve = __commonJS({\n \"node_modules/elliptic/lib/elliptic/curve/index.js\"(exports) {\n \"use strict\";\n var curve = exports;\n curve.base = require_base();\n curve.short = require_short();\n curve.mont = require_mont();\n curve.edwards = require_edwards();\n },\n});\n\n// node_modules/hash.js/lib/hash/utils.js\nvar require_utils4 = __commonJS({\n \"node_modules/hash.js/lib/hash/utils.js\"(exports) {\n \"use strict\";\n var assert = require_minimalistic_assert(),\n inherits = require_inherits_browser();\n exports.inherits = inherits;\n function isSurrogatePair(msg, i) {\n return (msg.charCodeAt(i) & 64512) !== 55296 || i < 0 || i + 1 >= msg.length\n ? !1\n : (msg.charCodeAt(i + 1) & 64512) === 56320;\n }\n function toArray(msg, enc) {\n if (Array.isArray(msg)) return msg.slice();\n if (!msg) return [];\n var res = [];\n if (typeof msg == \"string\")\n if (enc) {\n if (enc === \"hex\")\n for (\n msg = msg.replace(/[^a-z0-9]+/gi, \"\"), msg.length % 2 !== 0 && (msg = \"0\" + msg), i = 0;\n i < msg.length;\n i += 2\n )\n res.push(parseInt(msg[i] + msg[i + 1], 16));\n } else\n for (var p = 0, i = 0; i < msg.length; i++) {\n var c = msg.charCodeAt(i);\n c < 128\n ? (res[p++] = c)\n : c < 2048\n ? ((res[p++] = (c >> 6) | 192), (res[p++] = (c & 63) | 128))\n : isSurrogatePair(msg, i)\n ? ((c = 65536 + ((c & 1023) << 10) + (msg.charCodeAt(++i) & 1023)),\n (res[p++] = (c >> 18) | 240),\n (res[p++] = ((c >> 12) & 63) | 128),\n (res[p++] = ((c >> 6) & 63) | 128),\n (res[p++] = (c & 63) | 128))\n : ((res[p++] = (c >> 12) | 224), (res[p++] = ((c >> 6) & 63) | 128), (res[p++] = (c & 63) | 128));\n }\n else for (i = 0; i < msg.length; i++) res[i] = msg[i] | 0;\n return res;\n }\n exports.toArray = toArray;\n function toHex(msg) {\n for (var res = \"\", i = 0; i < msg.length; i++) res += zero2(msg[i].toString(16));\n return res;\n }\n exports.toHex = toHex;\n function htonl(w) {\n var res = (w >>> 24) | ((w >>> 8) & 65280) | ((w << 8) & 16711680) | ((w & 255) << 24);\n return res >>> 0;\n }\n exports.htonl = htonl;\n function toHex32(msg, endian) {\n for (var res = \"\", i = 0; i < msg.length; i++) {\n var w = msg[i];\n endian === \"little\" && (w = htonl(w)), (res += zero8(w.toString(16)));\n }\n return res;\n }\n exports.toHex32 = toHex32;\n function zero2(word) {\n return word.length === 1 ? \"0\" + word : word;\n }\n exports.zero2 = zero2;\n function zero8(word) {\n return word.length === 7\n ? \"0\" + word\n : word.length === 6\n ? \"00\" + word\n : word.length === 5\n ? \"000\" + word\n : word.length === 4\n ? \"0000\" + word\n : word.length === 3\n ? \"00000\" + word\n : word.length === 2\n ? \"000000\" + word\n : word.length === 1\n ? \"0000000\" + word\n : word;\n }\n exports.zero8 = zero8;\n function join32(msg, start, end, endian) {\n var len = end - start;\n assert(len % 4 === 0);\n for (var res = new Array(len / 4), i = 0, k = start; i < res.length; i++, k += 4) {\n var w;\n endian === \"big\"\n ? (w = (msg[k] << 24) | (msg[k + 1] << 16) | (msg[k + 2] << 8) | msg[k + 3])\n : (w = (msg[k + 3] << 24) | (msg[k + 2] << 16) | (msg[k + 1] << 8) | msg[k]),\n (res[i] = w >>> 0);\n }\n return res;\n }\n exports.join32 = join32;\n function split32(msg, endian) {\n for (var res = new Array(msg.length * 4), i = 0, k = 0; i < msg.length; i++, k += 4) {\n var m = msg[i];\n endian === \"big\"\n ? ((res[k] = m >>> 24),\n (res[k + 1] = (m >>> 16) & 255),\n (res[k + 2] = (m >>> 8) & 255),\n (res[k + 3] = m & 255))\n : ((res[k + 3] = m >>> 24),\n (res[k + 2] = (m >>> 16) & 255),\n (res[k + 1] = (m >>> 8) & 255),\n (res[k] = m & 255));\n }\n return res;\n }\n exports.split32 = split32;\n function rotr32(w, b) {\n return (w >>> b) | (w << (32 - b));\n }\n exports.rotr32 = rotr32;\n function rotl32(w, b) {\n return (w << b) | (w >>> (32 - b));\n }\n exports.rotl32 = rotl32;\n function sum32(a, b) {\n return (a + b) >>> 0;\n }\n exports.sum32 = sum32;\n function sum32_3(a, b, c) {\n return (a + b + c) >>> 0;\n }\n exports.sum32_3 = sum32_3;\n function sum32_4(a, b, c, d) {\n return (a + b + c + d) >>> 0;\n }\n exports.sum32_4 = sum32_4;\n function sum32_5(a, b, c, d, e) {\n return (a + b + c + d + e) >>> 0;\n }\n exports.sum32_5 = sum32_5;\n function sum64(buf, pos, ah, al) {\n var bh = buf[pos],\n bl = buf[pos + 1],\n lo = (al + bl) >>> 0,\n hi = (lo < al ? 1 : 0) + ah + bh;\n (buf[pos] = hi >>> 0), (buf[pos + 1] = lo);\n }\n exports.sum64 = sum64;\n function sum64_hi(ah, al, bh, bl) {\n var lo = (al + bl) >>> 0,\n hi = (lo < al ? 1 : 0) + ah + bh;\n return hi >>> 0;\n }\n exports.sum64_hi = sum64_hi;\n function sum64_lo(ah, al, bh, bl) {\n var lo = al + bl;\n return lo >>> 0;\n }\n exports.sum64_lo = sum64_lo;\n function sum64_4_hi(ah, al, bh, bl, ch, cl, dh, dl) {\n var carry = 0,\n lo = al;\n (lo = (lo + bl) >>> 0),\n (carry += lo < al ? 1 : 0),\n (lo = (lo + cl) >>> 0),\n (carry += lo < cl ? 1 : 0),\n (lo = (lo + dl) >>> 0),\n (carry += lo < dl ? 1 : 0);\n var hi = ah + bh + ch + dh + carry;\n return hi >>> 0;\n }\n exports.sum64_4_hi = sum64_4_hi;\n function sum64_4_lo(ah, al, bh, bl, ch, cl, dh, dl) {\n var lo = al + bl + cl + dl;\n return lo >>> 0;\n }\n exports.sum64_4_lo = sum64_4_lo;\n function sum64_5_hi(ah, al, bh, bl, ch, cl, dh, dl, eh, el) {\n var carry = 0,\n lo = al;\n (lo = (lo + bl) >>> 0),\n (carry += lo < al ? 1 : 0),\n (lo = (lo + cl) >>> 0),\n (carry += lo < cl ? 1 : 0),\n (lo = (lo + dl) >>> 0),\n (carry += lo < dl ? 1 : 0),\n (lo = (lo + el) >>> 0),\n (carry += lo < el ? 1 : 0);\n var hi = ah + bh + ch + dh + eh + carry;\n return hi >>> 0;\n }\n exports.sum64_5_hi = sum64_5_hi;\n function sum64_5_lo(ah, al, bh, bl, ch, cl, dh, dl, eh, el) {\n var lo = al + bl + cl + dl + el;\n return lo >>> 0;\n }\n exports.sum64_5_lo = sum64_5_lo;\n function rotr64_hi(ah, al, num) {\n var r = (al << (32 - num)) | (ah >>> num);\n return r >>> 0;\n }\n exports.rotr64_hi = rotr64_hi;\n function rotr64_lo(ah, al, num) {\n var r = (ah << (32 - num)) | (al >>> num);\n return r >>> 0;\n }\n exports.rotr64_lo = rotr64_lo;\n function shr64_hi(ah, al, num) {\n return ah >>> num;\n }\n exports.shr64_hi = shr64_hi;\n function shr64_lo(ah, al, num) {\n var r = (ah << (32 - num)) | (al >>> num);\n return r >>> 0;\n }\n exports.shr64_lo = shr64_lo;\n },\n});\n\n// node_modules/hash.js/lib/hash/common.js\nvar require_common = __commonJS({\n \"node_modules/hash.js/lib/hash/common.js\"(exports) {\n \"use strict\";\n var utils = require_utils4(),\n assert = require_minimalistic_assert();\n function BlockHash() {\n (this.pending = null),\n (this.pendingTotal = 0),\n (this.blockSize = this.constructor.blockSize),\n (this.outSize = this.constructor.outSize),\n (this.hmacStrength = this.constructor.hmacStrength),\n (this.padLength = this.constructor.padLength / 8),\n (this.endian = \"big\"),\n (this._delta8 = this.blockSize / 8),\n (this._delta32 = this.blockSize / 32);\n }\n exports.BlockHash = BlockHash;\n BlockHash.prototype.update = function (msg, enc) {\n if (\n ((msg = utils.toArray(msg, enc)),\n this.pending ? (this.pending = this.pending.concat(msg)) : (this.pending = msg),\n (this.pendingTotal += msg.length),\n this.pending.length >= this._delta8)\n ) {\n msg = this.pending;\n var r = msg.length % this._delta8;\n (this.pending = msg.slice(msg.length - r, msg.length)),\n this.pending.length === 0 && (this.pending = null),\n (msg = utils.join32(msg, 0, msg.length - r, this.endian));\n for (var i = 0; i < msg.length; i += this._delta32) this._update(msg, i, i + this._delta32);\n }\n return this;\n };\n BlockHash.prototype.digest = function (enc) {\n return this.update(this._pad()), assert(this.pending === null), this._digest(enc);\n };\n BlockHash.prototype._pad = function () {\n var len = this.pendingTotal,\n bytes = this._delta8,\n k = bytes - ((len + this.padLength) % bytes),\n res = new Array(k + this.padLength);\n res[0] = 128;\n for (var i = 1; i < k; i++) res[i] = 0;\n if (((len <<= 3), this.endian === \"big\")) {\n for (var t = 8; t < this.padLength; t++) res[i++] = 0;\n (res[i++] = 0),\n (res[i++] = 0),\n (res[i++] = 0),\n (res[i++] = 0),\n (res[i++] = (len >>> 24) & 255),\n (res[i++] = (len >>> 16) & 255),\n (res[i++] = (len >>> 8) & 255),\n (res[i++] = len & 255);\n } else\n for (\n res[i++] = len & 255,\n res[i++] = (len >>> 8) & 255,\n res[i++] = (len >>> 16) & 255,\n res[i++] = (len >>> 24) & 255,\n res[i++] = 0,\n res[i++] = 0,\n res[i++] = 0,\n res[i++] = 0,\n t = 8;\n t < this.padLength;\n t++\n )\n res[i++] = 0;\n return res;\n };\n },\n});\n\n// node_modules/hash.js/lib/hash/sha/common.js\nvar require_common2 = __commonJS({\n \"node_modules/hash.js/lib/hash/sha/common.js\"(exports) {\n \"use strict\";\n var utils = require_utils4(),\n rotr32 = utils.rotr32;\n function ft_1(s, x, y, z) {\n if (s === 0) return ch32(x, y, z);\n if (s === 1 || s === 3) return p32(x, y, z);\n if (s === 2) return maj32(x, y, z);\n }\n exports.ft_1 = ft_1;\n function ch32(x, y, z) {\n return (x & y) ^ (~x & z);\n }\n exports.ch32 = ch32;\n function maj32(x, y, z) {\n return (x & y) ^ (x & z) ^ (y & z);\n }\n exports.maj32 = maj32;\n function p32(x, y, z) {\n return x ^ y ^ z;\n }\n exports.p32 = p32;\n function s0_256(x) {\n return rotr32(x, 2) ^ rotr32(x, 13) ^ rotr32(x, 22);\n }\n exports.s0_256 = s0_256;\n function s1_256(x) {\n return rotr32(x, 6) ^ rotr32(x, 11) ^ rotr32(x, 25);\n }\n exports.s1_256 = s1_256;\n function g0_256(x) {\n return rotr32(x, 7) ^ rotr32(x, 18) ^ (x >>> 3);\n }\n exports.g0_256 = g0_256;\n function g1_256(x) {\n return rotr32(x, 17) ^ rotr32(x, 19) ^ (x >>> 10);\n }\n exports.g1_256 = g1_256;\n },\n});\n\n// node_modules/hash.js/lib/hash/sha/1.js\nvar require__ = __commonJS({\n \"node_modules/hash.js/lib/hash/sha/1.js\"(exports, module) {\n \"use strict\";\n var utils = require_utils4(),\n common = require_common(),\n shaCommon = require_common2(),\n rotl32 = utils.rotl32,\n sum32 = utils.sum32,\n sum32_5 = utils.sum32_5,\n ft_1 = shaCommon.ft_1,\n BlockHash = common.BlockHash,\n sha1_K = [1518500249, 1859775393, 2400959708, 3395469782];\n function SHA1() {\n if (!(this instanceof SHA1)) return new SHA1();\n BlockHash.call(this),\n (this.h = [1732584193, 4023233417, 2562383102, 271733878, 3285377520]),\n (this.W = new Array(80));\n }\n utils.inherits(SHA1, BlockHash);\n module.exports = SHA1;\n SHA1.blockSize = 512;\n SHA1.outSize = 160;\n SHA1.hmacStrength = 80;\n SHA1.padLength = 64;\n SHA1.prototype._update = function (msg, start) {\n for (var W = this.W, i = 0; i < 16; i++) W[i] = msg[start + i];\n for (; i < W.length; i++) W[i] = rotl32(W[i - 3] ^ W[i - 8] ^ W[i - 14] ^ W[i - 16], 1);\n var a = this.h[0],\n b = this.h[1],\n c = this.h[2],\n d = this.h[3],\n e = this.h[4];\n for (i = 0; i < W.length; i++) {\n var s = ~~(i / 20),\n t = sum32_5(rotl32(a, 5), ft_1(s, b, c, d), e, W[i], sha1_K[s]);\n (e = d), (d = c), (c = rotl32(b, 30)), (b = a), (a = t);\n }\n (this.h[0] = sum32(this.h[0], a)),\n (this.h[1] = sum32(this.h[1], b)),\n (this.h[2] = sum32(this.h[2], c)),\n (this.h[3] = sum32(this.h[3], d)),\n (this.h[4] = sum32(this.h[4], e));\n };\n SHA1.prototype._digest = function (enc) {\n return enc === \"hex\" ? utils.toHex32(this.h, \"big\") : utils.split32(this.h, \"big\");\n };\n },\n});\n\n// node_modules/hash.js/lib/hash/sha/256.js\nvar require__2 = __commonJS({\n \"node_modules/hash.js/lib/hash/sha/256.js\"(exports, module) {\n \"use strict\";\n var utils = require_utils4(),\n common = require_common(),\n shaCommon = require_common2(),\n assert = require_minimalistic_assert(),\n sum32 = utils.sum32,\n sum32_4 = utils.sum32_4,\n sum32_5 = utils.sum32_5,\n ch32 = shaCommon.ch32,\n maj32 = shaCommon.maj32,\n s0_256 = shaCommon.s0_256,\n s1_256 = shaCommon.s1_256,\n g0_256 = shaCommon.g0_256,\n g1_256 = shaCommon.g1_256,\n BlockHash = common.BlockHash,\n sha256_K = [\n 1116352408, 1899447441, 3049323471, 3921009573, 961987163, 1508970993, 2453635748, 2870763221, 3624381080,\n 310598401, 607225278, 1426881987, 1925078388, 2162078206, 2614888103, 3248222580, 3835390401, 4022224774,\n 264347078, 604807628, 770255983, 1249150122, 1555081692, 1996064986, 2554220882, 2821834349, 2952996808,\n 3210313671, 3336571891, 3584528711, 113926993, 338241895, 666307205, 773529912, 1294757372, 1396182291,\n 1695183700, 1986661051, 2177026350, 2456956037, 2730485921, 2820302411, 3259730800, 3345764771, 3516065817,\n 3600352804, 4094571909, 275423344, 430227734, 506948616, 659060556, 883997877, 958139571, 1322822218,\n 1537002063, 1747873779, 1955562222, 2024104815, 2227730452, 2361852424, 2428436474, 2756734187, 3204031479,\n 3329325298,\n ];\n function SHA256() {\n if (!(this instanceof SHA256)) return new SHA256();\n BlockHash.call(this),\n (this.h = [1779033703, 3144134277, 1013904242, 2773480762, 1359893119, 2600822924, 528734635, 1541459225]),\n (this.k = sha256_K),\n (this.W = new Array(64));\n }\n utils.inherits(SHA256, BlockHash);\n module.exports = SHA256;\n SHA256.blockSize = 512;\n SHA256.outSize = 256;\n SHA256.hmacStrength = 192;\n SHA256.padLength = 64;\n SHA256.prototype._update = function (msg, start) {\n for (var W = this.W, i = 0; i < 16; i++) W[i] = msg[start + i];\n for (; i < W.length; i++) W[i] = sum32_4(g1_256(W[i - 2]), W[i - 7], g0_256(W[i - 15]), W[i - 16]);\n var a = this.h[0],\n b = this.h[1],\n c = this.h[2],\n d = this.h[3],\n e = this.h[4],\n f = this.h[5],\n g = this.h[6],\n h = this.h[7];\n for (assert(this.k.length === W.length), i = 0; i < W.length; i++) {\n var T1 = sum32_5(h, s1_256(e), ch32(e, f, g), this.k[i], W[i]),\n T2 = sum32(s0_256(a), maj32(a, b, c));\n (h = g), (g = f), (f = e), (e = sum32(d, T1)), (d = c), (c = b), (b = a), (a = sum32(T1, T2));\n }\n (this.h[0] = sum32(this.h[0], a)),\n (this.h[1] = sum32(this.h[1], b)),\n (this.h[2] = sum32(this.h[2], c)),\n (this.h[3] = sum32(this.h[3], d)),\n (this.h[4] = sum32(this.h[4], e)),\n (this.h[5] = sum32(this.h[5], f)),\n (this.h[6] = sum32(this.h[6], g)),\n (this.h[7] = sum32(this.h[7], h));\n };\n SHA256.prototype._digest = function (enc) {\n return enc === \"hex\" ? utils.toHex32(this.h, \"big\") : utils.split32(this.h, \"big\");\n };\n },\n});\n\n// node_modules/hash.js/lib/hash/sha/224.js\nvar require__3 = __commonJS({\n \"node_modules/hash.js/lib/hash/sha/224.js\"(exports, module) {\n \"use strict\";\n var utils = require_utils4(),\n SHA256 = require__2();\n function SHA224() {\n if (!(this instanceof SHA224)) return new SHA224();\n SHA256.call(this),\n (this.h = [3238371032, 914150663, 812702999, 4144912697, 4290775857, 1750603025, 1694076839, 3204075428]);\n }\n utils.inherits(SHA224, SHA256);\n module.exports = SHA224;\n SHA224.blockSize = 512;\n SHA224.outSize = 224;\n SHA224.hmacStrength = 192;\n SHA224.padLength = 64;\n SHA224.prototype._digest = function (enc) {\n return enc === \"hex\" ? utils.toHex32(this.h.slice(0, 7), \"big\") : utils.split32(this.h.slice(0, 7), \"big\");\n };\n },\n});\n\n// node_modules/hash.js/lib/hash/sha/512.js\nvar require__4 = __commonJS({\n \"node_modules/hash.js/lib/hash/sha/512.js\"(exports, module) {\n \"use strict\";\n var utils = require_utils4(),\n common = require_common(),\n assert = require_minimalistic_assert(),\n rotr64_hi = utils.rotr64_hi,\n rotr64_lo = utils.rotr64_lo,\n shr64_hi = utils.shr64_hi,\n shr64_lo = utils.shr64_lo,\n sum64 = utils.sum64,\n sum64_hi = utils.sum64_hi,\n sum64_lo = utils.sum64_lo,\n sum64_4_hi = utils.sum64_4_hi,\n sum64_4_lo = utils.sum64_4_lo,\n sum64_5_hi = utils.sum64_5_hi,\n sum64_5_lo = utils.sum64_5_lo,\n BlockHash = common.BlockHash,\n sha512_K = [\n 1116352408, 3609767458, 1899447441, 602891725, 3049323471, 3964484399, 3921009573, 2173295548, 961987163,\n 4081628472, 1508970993, 3053834265, 2453635748, 2937671579, 2870763221, 3664609560, 3624381080, 2734883394,\n 310598401, 1164996542, 607225278, 1323610764, 1426881987, 3590304994, 1925078388, 4068182383, 2162078206,\n 991336113, 2614888103, 633803317, 3248222580, 3479774868, 3835390401, 2666613458, 4022224774, 944711139,\n 264347078, 2341262773, 604807628, 2007800933, 770255983, 1495990901, 1249150122, 1856431235, 1555081692,\n 3175218132, 1996064986, 2198950837, 2554220882, 3999719339, 2821834349, 766784016, 2952996808, 2566594879,\n 3210313671, 3203337956, 3336571891, 1034457026, 3584528711, 2466948901, 113926993, 3758326383, 338241895,\n 168717936, 666307205, 1188179964, 773529912, 1546045734, 1294757372, 1522805485, 1396182291, 2643833823,\n 1695183700, 2343527390, 1986661051, 1014477480, 2177026350, 1206759142, 2456956037, 344077627, 2730485921,\n 1290863460, 2820302411, 3158454273, 3259730800, 3505952657, 3345764771, 106217008, 3516065817, 3606008344,\n 3600352804, 1432725776, 4094571909, 1467031594, 275423344, 851169720, 430227734, 3100823752, 506948616,\n 1363258195, 659060556, 3750685593, 883997877, 3785050280, 958139571, 3318307427, 1322822218, 3812723403,\n 1537002063, 2003034995, 1747873779, 3602036899, 1955562222, 1575990012, 2024104815, 1125592928, 2227730452,\n 2716904306, 2361852424, 442776044, 2428436474, 593698344, 2756734187, 3733110249, 3204031479, 2999351573,\n 3329325298, 3815920427, 3391569614, 3928383900, 3515267271, 566280711, 3940187606, 3454069534, 4118630271,\n 4000239992, 116418474, 1914138554, 174292421, 2731055270, 289380356, 3203993006, 460393269, 320620315,\n 685471733, 587496836, 852142971, 1086792851, 1017036298, 365543100, 1126000580, 2618297676, 1288033470,\n 3409855158, 1501505948, 4234509866, 1607167915, 987167468, 1816402316, 1246189591,\n ];\n function SHA512() {\n if (!(this instanceof SHA512)) return new SHA512();\n BlockHash.call(this),\n (this.h = [\n 1779033703, 4089235720, 3144134277, 2227873595, 1013904242, 4271175723, 2773480762, 1595750129, 1359893119,\n 2917565137, 2600822924, 725511199, 528734635, 4215389547, 1541459225, 327033209,\n ]),\n (this.k = sha512_K),\n (this.W = new Array(160));\n }\n utils.inherits(SHA512, BlockHash);\n module.exports = SHA512;\n SHA512.blockSize = 1024;\n SHA512.outSize = 512;\n SHA512.hmacStrength = 192;\n SHA512.padLength = 128;\n SHA512.prototype._prepareBlock = function (msg, start) {\n for (var W = this.W, i = 0; i < 32; i++) W[i] = msg[start + i];\n for (; i < W.length; i += 2) {\n var c0_hi = g1_512_hi(W[i - 4], W[i - 3]),\n c0_lo = g1_512_lo(W[i - 4], W[i - 3]),\n c1_hi = W[i - 14],\n c1_lo = W[i - 13],\n c2_hi = g0_512_hi(W[i - 30], W[i - 29]),\n c2_lo = g0_512_lo(W[i - 30], W[i - 29]),\n c3_hi = W[i - 32],\n c3_lo = W[i - 31];\n (W[i] = sum64_4_hi(c0_hi, c0_lo, c1_hi, c1_lo, c2_hi, c2_lo, c3_hi, c3_lo)),\n (W[i + 1] = sum64_4_lo(c0_hi, c0_lo, c1_hi, c1_lo, c2_hi, c2_lo, c3_hi, c3_lo));\n }\n };\n SHA512.prototype._update = function (msg, start) {\n this._prepareBlock(msg, start);\n var W = this.W,\n ah = this.h[0],\n al = this.h[1],\n bh = this.h[2],\n bl = this.h[3],\n ch = this.h[4],\n cl = this.h[5],\n dh = this.h[6],\n dl = this.h[7],\n eh = this.h[8],\n el = this.h[9],\n fh = this.h[10],\n fl = this.h[11],\n gh = this.h[12],\n gl = this.h[13],\n hh = this.h[14],\n hl = this.h[15];\n assert(this.k.length === W.length);\n for (var i = 0; i < W.length; i += 2) {\n var c0_hi = hh,\n c0_lo = hl,\n c1_hi = s1_512_hi(eh, el),\n c1_lo = s1_512_lo(eh, el),\n c2_hi = ch64_hi(eh, el, fh, fl, gh, gl),\n c2_lo = ch64_lo(eh, el, fh, fl, gh, gl),\n c3_hi = this.k[i],\n c3_lo = this.k[i + 1],\n c4_hi = W[i],\n c4_lo = W[i + 1],\n T1_hi = sum64_5_hi(c0_hi, c0_lo, c1_hi, c1_lo, c2_hi, c2_lo, c3_hi, c3_lo, c4_hi, c4_lo),\n T1_lo = sum64_5_lo(c0_hi, c0_lo, c1_hi, c1_lo, c2_hi, c2_lo, c3_hi, c3_lo, c4_hi, c4_lo);\n (c0_hi = s0_512_hi(ah, al)),\n (c0_lo = s0_512_lo(ah, al)),\n (c1_hi = maj64_hi(ah, al, bh, bl, ch, cl)),\n (c1_lo = maj64_lo(ah, al, bh, bl, ch, cl));\n var T2_hi = sum64_hi(c0_hi, c0_lo, c1_hi, c1_lo),\n T2_lo = sum64_lo(c0_hi, c0_lo, c1_hi, c1_lo);\n (hh = gh),\n (hl = gl),\n (gh = fh),\n (gl = fl),\n (fh = eh),\n (fl = el),\n (eh = sum64_hi(dh, dl, T1_hi, T1_lo)),\n (el = sum64_lo(dl, dl, T1_hi, T1_lo)),\n (dh = ch),\n (dl = cl),\n (ch = bh),\n (cl = bl),\n (bh = ah),\n (bl = al),\n (ah = sum64_hi(T1_hi, T1_lo, T2_hi, T2_lo)),\n (al = sum64_lo(T1_hi, T1_lo, T2_hi, T2_lo));\n }\n sum64(this.h, 0, ah, al),\n sum64(this.h, 2, bh, bl),\n sum64(this.h, 4, ch, cl),\n sum64(this.h, 6, dh, dl),\n sum64(this.h, 8, eh, el),\n sum64(this.h, 10, fh, fl),\n sum64(this.h, 12, gh, gl),\n sum64(this.h, 14, hh, hl);\n };\n SHA512.prototype._digest = function (enc) {\n return enc === \"hex\" ? utils.toHex32(this.h, \"big\") : utils.split32(this.h, \"big\");\n };\n function ch64_hi(xh, xl, yh, yl, zh) {\n var r = (xh & yh) ^ (~xh & zh);\n return r < 0 && (r += 4294967296), r;\n }\n function ch64_lo(xh, xl, yh, yl, zh, zl) {\n var r = (xl & yl) ^ (~xl & zl);\n return r < 0 && (r += 4294967296), r;\n }\n function maj64_hi(xh, xl, yh, yl, zh) {\n var r = (xh & yh) ^ (xh & zh) ^ (yh & zh);\n return r < 0 && (r += 4294967296), r;\n }\n function maj64_lo(xh, xl, yh, yl, zh, zl) {\n var r = (xl & yl) ^ (xl & zl) ^ (yl & zl);\n return r < 0 && (r += 4294967296), r;\n }\n function s0_512_hi(xh, xl) {\n var c0_hi = rotr64_hi(xh, xl, 28),\n c1_hi = rotr64_hi(xl, xh, 2),\n c2_hi = rotr64_hi(xl, xh, 7),\n r = c0_hi ^ c1_hi ^ c2_hi;\n return r < 0 && (r += 4294967296), r;\n }\n function s0_512_lo(xh, xl) {\n var c0_lo = rotr64_lo(xh, xl, 28),\n c1_lo = rotr64_lo(xl, xh, 2),\n c2_lo = rotr64_lo(xl, xh, 7),\n r = c0_lo ^ c1_lo ^ c2_lo;\n return r < 0 && (r += 4294967296), r;\n }\n function s1_512_hi(xh, xl) {\n var c0_hi = rotr64_hi(xh, xl, 14),\n c1_hi = rotr64_hi(xh, xl, 18),\n c2_hi = rotr64_hi(xl, xh, 9),\n r = c0_hi ^ c1_hi ^ c2_hi;\n return r < 0 && (r += 4294967296), r;\n }\n function s1_512_lo(xh, xl) {\n var c0_lo = rotr64_lo(xh, xl, 14),\n c1_lo = rotr64_lo(xh, xl, 18),\n c2_lo = rotr64_lo(xl, xh, 9),\n r = c0_lo ^ c1_lo ^ c2_lo;\n return r < 0 && (r += 4294967296), r;\n }\n function g0_512_hi(xh, xl) {\n var c0_hi = rotr64_hi(xh, xl, 1),\n c1_hi = rotr64_hi(xh, xl, 8),\n c2_hi = shr64_hi(xh, xl, 7),\n r = c0_hi ^ c1_hi ^ c2_hi;\n return r < 0 && (r += 4294967296), r;\n }\n function g0_512_lo(xh, xl) {\n var c0_lo = rotr64_lo(xh, xl, 1),\n c1_lo = rotr64_lo(xh, xl, 8),\n c2_lo = shr64_lo(xh, xl, 7),\n r = c0_lo ^ c1_lo ^ c2_lo;\n return r < 0 && (r += 4294967296), r;\n }\n function g1_512_hi(xh, xl) {\n var c0_hi = rotr64_hi(xh, xl, 19),\n c1_hi = rotr64_hi(xl, xh, 29),\n c2_hi = shr64_hi(xh, xl, 6),\n r = c0_hi ^ c1_hi ^ c2_hi;\n return r < 0 && (r += 4294967296), r;\n }\n function g1_512_lo(xh, xl) {\n var c0_lo = rotr64_lo(xh, xl, 19),\n c1_lo = rotr64_lo(xl, xh, 29),\n c2_lo = shr64_lo(xh, xl, 6),\n r = c0_lo ^ c1_lo ^ c2_lo;\n return r < 0 && (r += 4294967296), r;\n }\n },\n});\n\n// node_modules/hash.js/lib/hash/sha/384.js\nvar require__5 = __commonJS({\n \"node_modules/hash.js/lib/hash/sha/384.js\"(exports, module) {\n \"use strict\";\n var utils = require_utils4(),\n SHA512 = require__4();\n function SHA384() {\n if (!(this instanceof SHA384)) return new SHA384();\n SHA512.call(this),\n (this.h = [\n 3418070365, 3238371032, 1654270250, 914150663, 2438529370, 812702999, 355462360, 4144912697, 1731405415,\n 4290775857, 2394180231, 1750603025, 3675008525, 1694076839, 1203062813, 3204075428,\n ]);\n }\n utils.inherits(SHA384, SHA512);\n module.exports = SHA384;\n SHA384.blockSize = 1024;\n SHA384.outSize = 384;\n SHA384.hmacStrength = 192;\n SHA384.padLength = 128;\n SHA384.prototype._digest = function (enc) {\n return enc === \"hex\" ? utils.toHex32(this.h.slice(0, 12), \"big\") : utils.split32(this.h.slice(0, 12), \"big\");\n };\n },\n});\n\n// node_modules/hash.js/lib/hash/sha.js\nvar require_sha3 = __commonJS({\n \"node_modules/hash.js/lib/hash/sha.js\"(exports) {\n \"use strict\";\n exports.sha1 = require__();\n exports.sha224 = require__3();\n exports.sha256 = require__2();\n exports.sha384 = require__5();\n exports.sha512 = require__4();\n },\n});\n\n// node_modules/hash.js/lib/hash/ripemd.js\nvar require_ripemd = __commonJS({\n \"node_modules/hash.js/lib/hash/ripemd.js\"(exports) {\n \"use strict\";\n var utils = require_utils4(),\n common = require_common(),\n rotl32 = utils.rotl32,\n sum32 = utils.sum32,\n sum32_3 = utils.sum32_3,\n sum32_4 = utils.sum32_4,\n BlockHash = common.BlockHash;\n function RIPEMD160() {\n if (!(this instanceof RIPEMD160)) return new RIPEMD160();\n BlockHash.call(this),\n (this.h = [1732584193, 4023233417, 2562383102, 271733878, 3285377520]),\n (this.endian = \"little\");\n }\n utils.inherits(RIPEMD160, BlockHash);\n exports.ripemd160 = RIPEMD160;\n RIPEMD160.blockSize = 512;\n RIPEMD160.outSize = 160;\n RIPEMD160.hmacStrength = 192;\n RIPEMD160.padLength = 64;\n RIPEMD160.prototype._update = function (msg, start) {\n for (\n var A = this.h[0],\n B = this.h[1],\n C = this.h[2],\n D = this.h[3],\n E = this.h[4],\n Ah = A,\n Bh = B,\n Ch = C,\n Dh = D,\n Eh = E,\n j = 0;\n j < 80;\n j++\n ) {\n var T = sum32(rotl32(sum32_4(A, f(j, B, C, D), msg[r[j] + start], K(j)), s[j]), E);\n (A = E),\n (E = D),\n (D = rotl32(C, 10)),\n (C = B),\n (B = T),\n (T = sum32(rotl32(sum32_4(Ah, f(79 - j, Bh, Ch, Dh), msg[rh[j] + start], Kh(j)), sh[j]), Eh)),\n (Ah = Eh),\n (Eh = Dh),\n (Dh = rotl32(Ch, 10)),\n (Ch = Bh),\n (Bh = T);\n }\n (T = sum32_3(this.h[1], C, Dh)),\n (this.h[1] = sum32_3(this.h[2], D, Eh)),\n (this.h[2] = sum32_3(this.h[3], E, Ah)),\n (this.h[3] = sum32_3(this.h[4], A, Bh)),\n (this.h[4] = sum32_3(this.h[0], B, Ch)),\n (this.h[0] = T);\n };\n RIPEMD160.prototype._digest = function (enc) {\n return enc === \"hex\" ? utils.toHex32(this.h, \"little\") : utils.split32(this.h, \"little\");\n };\n function f(j, x, y, z) {\n return j <= 15\n ? x ^ y ^ z\n : j <= 31\n ? (x & y) | (~x & z)\n : j <= 47\n ? (x | ~y) ^ z\n : j <= 63\n ? (x & z) | (y & ~z)\n : x ^ (y | ~z);\n }\n function K(j) {\n return j <= 15 ? 0 : j <= 31 ? 1518500249 : j <= 47 ? 1859775393 : j <= 63 ? 2400959708 : 2840853838;\n }\n function Kh(j) {\n return j <= 15 ? 1352829926 : j <= 31 ? 1548603684 : j <= 47 ? 1836072691 : j <= 63 ? 2053994217 : 0;\n }\n var r = [\n 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 7, 4, 13, 1, 10, 6, 15, 3, 12, 0, 9, 5, 2, 14, 11, 8, 3,\n 10, 14, 4, 9, 15, 8, 1, 2, 7, 0, 6, 13, 11, 5, 12, 1, 9, 11, 10, 0, 8, 12, 4, 13, 3, 7, 15, 14, 5, 6, 2, 4, 0,\n 5, 9, 7, 12, 2, 10, 14, 1, 3, 8, 11, 6, 15, 13,\n ],\n rh = [\n 5, 14, 7, 0, 9, 2, 11, 4, 13, 6, 15, 8, 1, 10, 3, 12, 6, 11, 3, 7, 0, 13, 5, 10, 14, 15, 8, 12, 4, 9, 1, 2, 15,\n 5, 1, 3, 7, 14, 6, 9, 11, 8, 12, 2, 10, 0, 4, 13, 8, 6, 4, 1, 3, 11, 15, 0, 5, 12, 2, 13, 9, 7, 10, 14, 12, 15,\n 10, 4, 1, 5, 8, 7, 6, 2, 13, 14, 0, 3, 9, 11,\n ],\n s = [\n 11, 14, 15, 12, 5, 8, 7, 9, 11, 13, 14, 15, 6, 7, 9, 8, 7, 6, 8, 13, 11, 9, 7, 15, 7, 12, 15, 9, 11, 7, 13, 12,\n 11, 13, 6, 7, 14, 9, 13, 15, 14, 8, 13, 6, 5, 12, 7, 5, 11, 12, 14, 15, 14, 15, 9, 8, 9, 14, 5, 6, 8, 6, 5, 12,\n 9, 15, 5, 11, 6, 8, 13, 12, 5, 12, 13, 14, 11, 8, 5, 6,\n ],\n sh = [\n 8, 9, 9, 11, 13, 15, 15, 5, 7, 7, 8, 11, 14, 14, 12, 6, 9, 13, 15, 7, 12, 8, 9, 11, 7, 7, 12, 7, 6, 15, 13, 11,\n 9, 7, 15, 11, 8, 6, 6, 14, 12, 13, 5, 14, 13, 13, 7, 5, 15, 5, 8, 11, 14, 14, 6, 14, 6, 9, 12, 9, 12, 5, 15, 8,\n 8, 5, 12, 9, 12, 5, 14, 6, 8, 13, 6, 5, 15, 13, 11, 11,\n ];\n },\n});\n\n// node_modules/hash.js/lib/hash/hmac.js\nvar require_hmac = __commonJS({\n \"node_modules/hash.js/lib/hash/hmac.js\"(exports, module) {\n \"use strict\";\n var utils = require_utils4(),\n assert = require_minimalistic_assert();\n function Hmac(hash, key, enc) {\n if (!(this instanceof Hmac)) return new Hmac(hash, key, enc);\n (this.Hash = hash),\n (this.blockSize = hash.blockSize / 8),\n (this.outSize = hash.outSize / 8),\n (this.inner = null),\n (this.outer = null),\n this._init(utils.toArray(key, enc));\n }\n module.exports = Hmac;\n Hmac.prototype._init = function (key) {\n key.length > this.blockSize && (key = new this.Hash().update(key).digest()), assert(key.length <= this.blockSize);\n for (var i = key.length; i < this.blockSize; i++) key.push(0);\n for (i = 0; i < key.length; i++) key[i] ^= 54;\n for (this.inner = new this.Hash().update(key), i = 0; i < key.length; i++) key[i] ^= 106;\n this.outer = new this.Hash().update(key);\n };\n Hmac.prototype.update = function (msg, enc) {\n return this.inner.update(msg, enc), this;\n };\n Hmac.prototype.digest = function (enc) {\n return this.outer.update(this.inner.digest()), this.outer.digest(enc);\n };\n },\n});\n\n// node_modules/hash.js/lib/hash.js\nvar require_hash2 = __commonJS({\n \"node_modules/hash.js/lib/hash.js\"(exports) {\n var hash = exports;\n hash.utils = require_utils4();\n hash.common = require_common();\n hash.sha = require_sha3();\n hash.ripemd = require_ripemd();\n hash.hmac = require_hmac();\n hash.sha1 = hash.sha.sha1;\n hash.sha256 = hash.sha.sha256;\n hash.sha224 = hash.sha.sha224;\n hash.sha384 = hash.sha.sha384;\n hash.sha512 = hash.sha.sha512;\n hash.ripemd160 = hash.ripemd.ripemd160;\n },\n});\n\n// node_modules/elliptic/lib/elliptic/precomputed/secp256k1.js\nvar require_secp256k1 = __commonJS({\n \"node_modules/elliptic/lib/elliptic/precomputed/secp256k1.js\"(exports, module) {\n module.exports = {\n doubles: {\n step: 4,\n points: [\n [\n \"e60fce93b59e9ec53011aabc21c23e97b2a31369b87a5ae9c44ee89e2a6dec0a\",\n \"f7e3507399e595929db99f34f57937101296891e44d23f0be1f32cce69616821\",\n ],\n [\n \"8282263212c609d9ea2a6e3e172de238d8c39cabd5ac1ca10646e23fd5f51508\",\n \"11f8a8098557dfe45e8256e830b60ace62d613ac2f7b17bed31b6eaff6e26caf\",\n ],\n [\n \"175e159f728b865a72f99cc6c6fc846de0b93833fd2222ed73fce5b551e5b739\",\n \"d3506e0d9e3c79eba4ef97a51ff71f5eacb5955add24345c6efa6ffee9fed695\",\n ],\n [\n \"363d90d447b00c9c99ceac05b6262ee053441c7e55552ffe526bad8f83ff4640\",\n \"4e273adfc732221953b445397f3363145b9a89008199ecb62003c7f3bee9de9\",\n ],\n [\n \"8b4b5f165df3c2be8c6244b5b745638843e4a781a15bcd1b69f79a55dffdf80c\",\n \"4aad0a6f68d308b4b3fbd7813ab0da04f9e336546162ee56b3eff0c65fd4fd36\",\n ],\n [\n \"723cbaa6e5db996d6bf771c00bd548c7b700dbffa6c0e77bcb6115925232fcda\",\n \"96e867b5595cc498a921137488824d6e2660a0653779494801dc069d9eb39f5f\",\n ],\n [\n \"eebfa4d493bebf98ba5feec812c2d3b50947961237a919839a533eca0e7dd7fa\",\n \"5d9a8ca3970ef0f269ee7edaf178089d9ae4cdc3a711f712ddfd4fdae1de8999\",\n ],\n [\n \"100f44da696e71672791d0a09b7bde459f1215a29b3c03bfefd7835b39a48db0\",\n \"cdd9e13192a00b772ec8f3300c090666b7ff4a18ff5195ac0fbd5cd62bc65a09\",\n ],\n [\n \"e1031be262c7ed1b1dc9227a4a04c017a77f8d4464f3b3852c8acde6e534fd2d\",\n \"9d7061928940405e6bb6a4176597535af292dd419e1ced79a44f18f29456a00d\",\n ],\n [\n \"feea6cae46d55b530ac2839f143bd7ec5cf8b266a41d6af52d5e688d9094696d\",\n \"e57c6b6c97dce1bab06e4e12bf3ecd5c981c8957cc41442d3155debf18090088\",\n ],\n [\n \"da67a91d91049cdcb367be4be6ffca3cfeed657d808583de33fa978bc1ec6cb1\",\n \"9bacaa35481642bc41f463f7ec9780e5dec7adc508f740a17e9ea8e27a68be1d\",\n ],\n [\n \"53904faa0b334cdda6e000935ef22151ec08d0f7bb11069f57545ccc1a37b7c0\",\n \"5bc087d0bc80106d88c9eccac20d3c1c13999981e14434699dcb096b022771c8\",\n ],\n [\n \"8e7bcd0bd35983a7719cca7764ca906779b53a043a9b8bcaeff959f43ad86047\",\n \"10b7770b2a3da4b3940310420ca9514579e88e2e47fd68b3ea10047e8460372a\",\n ],\n [\n \"385eed34c1cdff21e6d0818689b81bde71a7f4f18397e6690a841e1599c43862\",\n \"283bebc3e8ea23f56701de19e9ebf4576b304eec2086dc8cc0458fe5542e5453\",\n ],\n [\n \"6f9d9b803ecf191637c73a4413dfa180fddf84a5947fbc9c606ed86c3fac3a7\",\n \"7c80c68e603059ba69b8e2a30e45c4d47ea4dd2f5c281002d86890603a842160\",\n ],\n [\n \"3322d401243c4e2582a2147c104d6ecbf774d163db0f5e5313b7e0e742d0e6bd\",\n \"56e70797e9664ef5bfb019bc4ddaf9b72805f63ea2873af624f3a2e96c28b2a0\",\n ],\n [\n \"85672c7d2de0b7da2bd1770d89665868741b3f9af7643397721d74d28134ab83\",\n \"7c481b9b5b43b2eb6374049bfa62c2e5e77f17fcc5298f44c8e3094f790313a6\",\n ],\n [\n \"948bf809b1988a46b06c9f1919413b10f9226c60f668832ffd959af60c82a0a\",\n \"53a562856dcb6646dc6b74c5d1c3418c6d4dff08c97cd2bed4cb7f88d8c8e589\",\n ],\n [\n \"6260ce7f461801c34f067ce0f02873a8f1b0e44dfc69752accecd819f38fd8e8\",\n \"bc2da82b6fa5b571a7f09049776a1ef7ecd292238051c198c1a84e95b2b4ae17\",\n ],\n [\n \"e5037de0afc1d8d43d8348414bbf4103043ec8f575bfdc432953cc8d2037fa2d\",\n \"4571534baa94d3b5f9f98d09fb990bddbd5f5b03ec481f10e0e5dc841d755bda\",\n ],\n [\n \"e06372b0f4a207adf5ea905e8f1771b4e7e8dbd1c6a6c5b725866a0ae4fce725\",\n \"7a908974bce18cfe12a27bb2ad5a488cd7484a7787104870b27034f94eee31dd\",\n ],\n [\n \"213c7a715cd5d45358d0bbf9dc0ce02204b10bdde2a3f58540ad6908d0559754\",\n \"4b6dad0b5ae462507013ad06245ba190bb4850f5f36a7eeddff2c27534b458f2\",\n ],\n [\n \"4e7c272a7af4b34e8dbb9352a5419a87e2838c70adc62cddf0cc3a3b08fbd53c\",\n \"17749c766c9d0b18e16fd09f6def681b530b9614bff7dd33e0b3941817dcaae6\",\n ],\n [\n \"fea74e3dbe778b1b10f238ad61686aa5c76e3db2be43057632427e2840fb27b6\",\n \"6e0568db9b0b13297cf674deccb6af93126b596b973f7b77701d3db7f23cb96f\",\n ],\n [\n \"76e64113f677cf0e10a2570d599968d31544e179b760432952c02a4417bdde39\",\n \"c90ddf8dee4e95cf577066d70681f0d35e2a33d2b56d2032b4b1752d1901ac01\",\n ],\n [\n \"c738c56b03b2abe1e8281baa743f8f9a8f7cc643df26cbee3ab150242bcbb891\",\n \"893fb578951ad2537f718f2eacbfbbbb82314eef7880cfe917e735d9699a84c3\",\n ],\n [\n \"d895626548b65b81e264c7637c972877d1d72e5f3a925014372e9f6588f6c14b\",\n \"febfaa38f2bc7eae728ec60818c340eb03428d632bb067e179363ed75d7d991f\",\n ],\n [\n \"b8da94032a957518eb0f6433571e8761ceffc73693e84edd49150a564f676e03\",\n \"2804dfa44805a1e4d7c99cc9762808b092cc584d95ff3b511488e4e74efdf6e7\",\n ],\n [\n \"e80fea14441fb33a7d8adab9475d7fab2019effb5156a792f1a11778e3c0df5d\",\n \"eed1de7f638e00771e89768ca3ca94472d155e80af322ea9fcb4291b6ac9ec78\",\n ],\n [\n \"a301697bdfcd704313ba48e51d567543f2a182031efd6915ddc07bbcc4e16070\",\n \"7370f91cfb67e4f5081809fa25d40f9b1735dbf7c0a11a130c0d1a041e177ea1\",\n ],\n [\n \"90ad85b389d6b936463f9d0512678de208cc330b11307fffab7ac63e3fb04ed4\",\n \"e507a3620a38261affdcbd9427222b839aefabe1582894d991d4d48cb6ef150\",\n ],\n [\n \"8f68b9d2f63b5f339239c1ad981f162ee88c5678723ea3351b7b444c9ec4c0da\",\n \"662a9f2dba063986de1d90c2b6be215dbbea2cfe95510bfdf23cbf79501fff82\",\n ],\n [\n \"e4f3fb0176af85d65ff99ff9198c36091f48e86503681e3e6686fd5053231e11\",\n \"1e63633ad0ef4f1c1661a6d0ea02b7286cc7e74ec951d1c9822c38576feb73bc\",\n ],\n [\n \"8c00fa9b18ebf331eb961537a45a4266c7034f2f0d4e1d0716fb6eae20eae29e\",\n \"efa47267fea521a1a9dc343a3736c974c2fadafa81e36c54e7d2a4c66702414b\",\n ],\n [\n \"e7a26ce69dd4829f3e10cec0a9e98ed3143d084f308b92c0997fddfc60cb3e41\",\n \"2a758e300fa7984b471b006a1aafbb18d0a6b2c0420e83e20e8a9421cf2cfd51\",\n ],\n [\n \"b6459e0ee3662ec8d23540c223bcbdc571cbcb967d79424f3cf29eb3de6b80ef\",\n \"67c876d06f3e06de1dadf16e5661db3c4b3ae6d48e35b2ff30bf0b61a71ba45\",\n ],\n [\n \"d68a80c8280bb840793234aa118f06231d6f1fc67e73c5a5deda0f5b496943e8\",\n \"db8ba9fff4b586d00c4b1f9177b0e28b5b0e7b8f7845295a294c84266b133120\",\n ],\n [\n \"324aed7df65c804252dc0270907a30b09612aeb973449cea4095980fc28d3d5d\",\n \"648a365774b61f2ff130c0c35aec1f4f19213b0c7e332843967224af96ab7c84\",\n ],\n [\n \"4df9c14919cde61f6d51dfdbe5fee5dceec4143ba8d1ca888e8bd373fd054c96\",\n \"35ec51092d8728050974c23a1d85d4b5d506cdc288490192ebac06cad10d5d\",\n ],\n [\n \"9c3919a84a474870faed8a9c1cc66021523489054d7f0308cbfc99c8ac1f98cd\",\n \"ddb84f0f4a4ddd57584f044bf260e641905326f76c64c8e6be7e5e03d4fc599d\",\n ],\n [\n \"6057170b1dd12fdf8de05f281d8e06bb91e1493a8b91d4cc5a21382120a959e5\",\n \"9a1af0b26a6a4807add9a2daf71df262465152bc3ee24c65e899be932385a2a8\",\n ],\n [\n \"a576df8e23a08411421439a4518da31880cef0fba7d4df12b1a6973eecb94266\",\n \"40a6bf20e76640b2c92b97afe58cd82c432e10a7f514d9f3ee8be11ae1b28ec8\",\n ],\n [\n \"7778a78c28dec3e30a05fe9629de8c38bb30d1f5cf9a3a208f763889be58ad71\",\n \"34626d9ab5a5b22ff7098e12f2ff580087b38411ff24ac563b513fc1fd9f43ac\",\n ],\n [\n \"928955ee637a84463729fd30e7afd2ed5f96274e5ad7e5cb09eda9c06d903ac\",\n \"c25621003d3f42a827b78a13093a95eeac3d26efa8a8d83fc5180e935bcd091f\",\n ],\n [\n \"85d0fef3ec6db109399064f3a0e3b2855645b4a907ad354527aae75163d82751\",\n \"1f03648413a38c0be29d496e582cf5663e8751e96877331582c237a24eb1f962\",\n ],\n [\n \"ff2b0dce97eece97c1c9b6041798b85dfdfb6d8882da20308f5404824526087e\",\n \"493d13fef524ba188af4c4dc54d07936c7b7ed6fb90e2ceb2c951e01f0c29907\",\n ],\n [\n \"827fbbe4b1e880ea9ed2b2e6301b212b57f1ee148cd6dd28780e5e2cf856e241\",\n \"c60f9c923c727b0b71bef2c67d1d12687ff7a63186903166d605b68baec293ec\",\n ],\n [\n \"eaa649f21f51bdbae7be4ae34ce6e5217a58fdce7f47f9aa7f3b58fa2120e2b3\",\n \"be3279ed5bbbb03ac69a80f89879aa5a01a6b965f13f7e59d47a5305ba5ad93d\",\n ],\n [\n \"e4a42d43c5cf169d9391df6decf42ee541b6d8f0c9a137401e23632dda34d24f\",\n \"4d9f92e716d1c73526fc99ccfb8ad34ce886eedfa8d8e4f13a7f7131deba9414\",\n ],\n [\n \"1ec80fef360cbdd954160fadab352b6b92b53576a88fea4947173b9d4300bf19\",\n \"aeefe93756b5340d2f3a4958a7abbf5e0146e77f6295a07b671cdc1cc107cefd\",\n ],\n [\n \"146a778c04670c2f91b00af4680dfa8bce3490717d58ba889ddb5928366642be\",\n \"b318e0ec3354028add669827f9d4b2870aaa971d2f7e5ed1d0b297483d83efd0\",\n ],\n [\n \"fa50c0f61d22e5f07e3acebb1aa07b128d0012209a28b9776d76a8793180eef9\",\n \"6b84c6922397eba9b72cd2872281a68a5e683293a57a213b38cd8d7d3f4f2811\",\n ],\n [\n \"da1d61d0ca721a11b1a5bf6b7d88e8421a288ab5d5bba5220e53d32b5f067ec2\",\n \"8157f55a7c99306c79c0766161c91e2966a73899d279b48a655fba0f1ad836f1\",\n ],\n [\n \"a8e282ff0c9706907215ff98e8fd416615311de0446f1e062a73b0610d064e13\",\n \"7f97355b8db81c09abfb7f3c5b2515888b679a3e50dd6bd6cef7c73111f4cc0c\",\n ],\n [\n \"174a53b9c9a285872d39e56e6913cab15d59b1fa512508c022f382de8319497c\",\n \"ccc9dc37abfc9c1657b4155f2c47f9e6646b3a1d8cb9854383da13ac079afa73\",\n ],\n [\n \"959396981943785c3d3e57edf5018cdbe039e730e4918b3d884fdff09475b7ba\",\n \"2e7e552888c331dd8ba0386a4b9cd6849c653f64c8709385e9b8abf87524f2fd\",\n ],\n [\n \"d2a63a50ae401e56d645a1153b109a8fcca0a43d561fba2dbb51340c9d82b151\",\n \"e82d86fb6443fcb7565aee58b2948220a70f750af484ca52d4142174dcf89405\",\n ],\n [\n \"64587e2335471eb890ee7896d7cfdc866bacbdbd3839317b3436f9b45617e073\",\n \"d99fcdd5bf6902e2ae96dd6447c299a185b90a39133aeab358299e5e9faf6589\",\n ],\n [\n \"8481bde0e4e4d885b3a546d3e549de042f0aa6cea250e7fd358d6c86dd45e458\",\n \"38ee7b8cba5404dd84a25bf39cecb2ca900a79c42b262e556d64b1b59779057e\",\n ],\n [\n \"13464a57a78102aa62b6979ae817f4637ffcfed3c4b1ce30bcd6303f6caf666b\",\n \"69be159004614580ef7e433453ccb0ca48f300a81d0942e13f495a907f6ecc27\",\n ],\n [\n \"bc4a9df5b713fe2e9aef430bcc1dc97a0cd9ccede2f28588cada3a0d2d83f366\",\n \"d3a81ca6e785c06383937adf4b798caa6e8a9fbfa547b16d758d666581f33c1\",\n ],\n [\n \"8c28a97bf8298bc0d23d8c749452a32e694b65e30a9472a3954ab30fe5324caa\",\n \"40a30463a3305193378fedf31f7cc0eb7ae784f0451cb9459e71dc73cbef9482\",\n ],\n [\n \"8ea9666139527a8c1dd94ce4f071fd23c8b350c5a4bb33748c4ba111faccae0\",\n \"620efabbc8ee2782e24e7c0cfb95c5d735b783be9cf0f8e955af34a30e62b945\",\n ],\n [\n \"dd3625faef5ba06074669716bbd3788d89bdde815959968092f76cc4eb9a9787\",\n \"7a188fa3520e30d461da2501045731ca941461982883395937f68d00c644a573\",\n ],\n [\n \"f710d79d9eb962297e4f6232b40e8f7feb2bc63814614d692c12de752408221e\",\n \"ea98e67232d3b3295d3b535532115ccac8612c721851617526ae47a9c77bfc82\",\n ],\n ],\n },\n naf: {\n wnd: 7,\n points: [\n [\n \"f9308a019258c31049344f85f89d5229b531c845836f99b08601f113bce036f9\",\n \"388f7b0f632de8140fe337e62a37f3566500a99934c2231b6cb9fd7584b8e672\",\n ],\n [\n \"2f8bde4d1a07209355b4a7250a5c5128e88b84bddc619ab7cba8d569b240efe4\",\n \"d8ac222636e5e3d6d4dba9dda6c9c426f788271bab0d6840dca87d3aa6ac62d6\",\n ],\n [\n \"5cbdf0646e5db4eaa398f365f2ea7a0e3d419b7e0330e39ce92bddedcac4f9bc\",\n \"6aebca40ba255960a3178d6d861a54dba813d0b813fde7b5a5082628087264da\",\n ],\n [\n \"acd484e2f0c7f65309ad178a9f559abde09796974c57e714c35f110dfc27ccbe\",\n \"cc338921b0a7d9fd64380971763b61e9add888a4375f8e0f05cc262ac64f9c37\",\n ],\n [\n \"774ae7f858a9411e5ef4246b70c65aac5649980be5c17891bbec17895da008cb\",\n \"d984a032eb6b5e190243dd56d7b7b365372db1e2dff9d6a8301d74c9c953c61b\",\n ],\n [\n \"f28773c2d975288bc7d1d205c3748651b075fbc6610e58cddeeddf8f19405aa8\",\n \"ab0902e8d880a89758212eb65cdaf473a1a06da521fa91f29b5cb52db03ed81\",\n ],\n [\n \"d7924d4f7d43ea965a465ae3095ff41131e5946f3c85f79e44adbcf8e27e080e\",\n \"581e2872a86c72a683842ec228cc6defea40af2bd896d3a5c504dc9ff6a26b58\",\n ],\n [\n \"defdea4cdb677750a420fee807eacf21eb9898ae79b9768766e4faa04a2d4a34\",\n \"4211ab0694635168e997b0ead2a93daeced1f4a04a95c0f6cfb199f69e56eb77\",\n ],\n [\n \"2b4ea0a797a443d293ef5cff444f4979f06acfebd7e86d277475656138385b6c\",\n \"85e89bc037945d93b343083b5a1c86131a01f60c50269763b570c854e5c09b7a\",\n ],\n [\n \"352bbf4a4cdd12564f93fa332ce333301d9ad40271f8107181340aef25be59d5\",\n \"321eb4075348f534d59c18259dda3e1f4a1b3b2e71b1039c67bd3d8bcf81998c\",\n ],\n [\n \"2fa2104d6b38d11b0230010559879124e42ab8dfeff5ff29dc9cdadd4ecacc3f\",\n \"2de1068295dd865b64569335bd5dd80181d70ecfc882648423ba76b532b7d67\",\n ],\n [\n \"9248279b09b4d68dab21a9b066edda83263c3d84e09572e269ca0cd7f5453714\",\n \"73016f7bf234aade5d1aa71bdea2b1ff3fc0de2a887912ffe54a32ce97cb3402\",\n ],\n [\n \"daed4f2be3a8bf278e70132fb0beb7522f570e144bf615c07e996d443dee8729\",\n \"a69dce4a7d6c98e8d4a1aca87ef8d7003f83c230f3afa726ab40e52290be1c55\",\n ],\n [\n \"c44d12c7065d812e8acf28d7cbb19f9011ecd9e9fdf281b0e6a3b5e87d22e7db\",\n \"2119a460ce326cdc76c45926c982fdac0e106e861edf61c5a039063f0e0e6482\",\n ],\n [\n \"6a245bf6dc698504c89a20cfded60853152b695336c28063b61c65cbd269e6b4\",\n \"e022cf42c2bd4a708b3f5126f16a24ad8b33ba48d0423b6efd5e6348100d8a82\",\n ],\n [\n \"1697ffa6fd9de627c077e3d2fe541084ce13300b0bec1146f95ae57f0d0bd6a5\",\n \"b9c398f186806f5d27561506e4557433a2cf15009e498ae7adee9d63d01b2396\",\n ],\n [\n \"605bdb019981718b986d0f07e834cb0d9deb8360ffb7f61df982345ef27a7479\",\n \"2972d2de4f8d20681a78d93ec96fe23c26bfae84fb14db43b01e1e9056b8c49\",\n ],\n [\n \"62d14dab4150bf497402fdc45a215e10dcb01c354959b10cfe31c7e9d87ff33d\",\n \"80fc06bd8cc5b01098088a1950eed0db01aa132967ab472235f5642483b25eaf\",\n ],\n [\n \"80c60ad0040f27dade5b4b06c408e56b2c50e9f56b9b8b425e555c2f86308b6f\",\n \"1c38303f1cc5c30f26e66bad7fe72f70a65eed4cbe7024eb1aa01f56430bd57a\",\n ],\n [\n \"7a9375ad6167ad54aa74c6348cc54d344cc5dc9487d847049d5eabb0fa03c8fb\",\n \"d0e3fa9eca8726909559e0d79269046bdc59ea10c70ce2b02d499ec224dc7f7\",\n ],\n [\n \"d528ecd9b696b54c907a9ed045447a79bb408ec39b68df504bb51f459bc3ffc9\",\n \"eecf41253136e5f99966f21881fd656ebc4345405c520dbc063465b521409933\",\n ],\n [\n \"49370a4b5f43412ea25f514e8ecdad05266115e4a7ecb1387231808f8b45963\",\n \"758f3f41afd6ed428b3081b0512fd62a54c3f3afbb5b6764b653052a12949c9a\",\n ],\n [\n \"77f230936ee88cbbd73df930d64702ef881d811e0e1498e2f1c13eb1fc345d74\",\n \"958ef42a7886b6400a08266e9ba1b37896c95330d97077cbbe8eb3c7671c60d6\",\n ],\n [\n \"f2dac991cc4ce4b9ea44887e5c7c0bce58c80074ab9d4dbaeb28531b7739f530\",\n \"e0dedc9b3b2f8dad4da1f32dec2531df9eb5fbeb0598e4fd1a117dba703a3c37\",\n ],\n [\n \"463b3d9f662621fb1b4be8fbbe2520125a216cdfc9dae3debcba4850c690d45b\",\n \"5ed430d78c296c3543114306dd8622d7c622e27c970a1de31cb377b01af7307e\",\n ],\n [\n \"f16f804244e46e2a09232d4aff3b59976b98fac14328a2d1a32496b49998f247\",\n \"cedabd9b82203f7e13d206fcdf4e33d92a6c53c26e5cce26d6579962c4e31df6\",\n ],\n [\n \"caf754272dc84563b0352b7a14311af55d245315ace27c65369e15f7151d41d1\",\n \"cb474660ef35f5f2a41b643fa5e460575f4fa9b7962232a5c32f908318a04476\",\n ],\n [\n \"2600ca4b282cb986f85d0f1709979d8b44a09c07cb86d7c124497bc86f082120\",\n \"4119b88753c15bd6a693b03fcddbb45d5ac6be74ab5f0ef44b0be9475a7e4b40\",\n ],\n [\n \"7635ca72d7e8432c338ec53cd12220bc01c48685e24f7dc8c602a7746998e435\",\n \"91b649609489d613d1d5e590f78e6d74ecfc061d57048bad9e76f302c5b9c61\",\n ],\n [\n \"754e3239f325570cdbbf4a87deee8a66b7f2b33479d468fbc1a50743bf56cc18\",\n \"673fb86e5bda30fb3cd0ed304ea49a023ee33d0197a695d0c5d98093c536683\",\n ],\n [\n \"e3e6bd1071a1e96aff57859c82d570f0330800661d1c952f9fe2694691d9b9e8\",\n \"59c9e0bba394e76f40c0aa58379a3cb6a5a2283993e90c4167002af4920e37f5\",\n ],\n [\n \"186b483d056a033826ae73d88f732985c4ccb1f32ba35f4b4cc47fdcf04aa6eb\",\n \"3b952d32c67cf77e2e17446e204180ab21fb8090895138b4a4a797f86e80888b\",\n ],\n [\n \"df9d70a6b9876ce544c98561f4be4f725442e6d2b737d9c91a8321724ce0963f\",\n \"55eb2dafd84d6ccd5f862b785dc39d4ab157222720ef9da217b8c45cf2ba2417\",\n ],\n [\n \"5edd5cc23c51e87a497ca815d5dce0f8ab52554f849ed8995de64c5f34ce7143\",\n \"efae9c8dbc14130661e8cec030c89ad0c13c66c0d17a2905cdc706ab7399a868\",\n ],\n [\n \"290798c2b6476830da12fe02287e9e777aa3fba1c355b17a722d362f84614fba\",\n \"e38da76dcd440621988d00bcf79af25d5b29c094db2a23146d003afd41943e7a\",\n ],\n [\n \"af3c423a95d9f5b3054754efa150ac39cd29552fe360257362dfdecef4053b45\",\n \"f98a3fd831eb2b749a93b0e6f35cfb40c8cd5aa667a15581bc2feded498fd9c6\",\n ],\n [\n \"766dbb24d134e745cccaa28c99bf274906bb66b26dcf98df8d2fed50d884249a\",\n \"744b1152eacbe5e38dcc887980da38b897584a65fa06cedd2c924f97cbac5996\",\n ],\n [\n \"59dbf46f8c94759ba21277c33784f41645f7b44f6c596a58ce92e666191abe3e\",\n \"c534ad44175fbc300f4ea6ce648309a042ce739a7919798cd85e216c4a307f6e\",\n ],\n [\n \"f13ada95103c4537305e691e74e9a4a8dd647e711a95e73cb62dc6018cfd87b8\",\n \"e13817b44ee14de663bf4bc808341f326949e21a6a75c2570778419bdaf5733d\",\n ],\n [\n \"7754b4fa0e8aced06d4167a2c59cca4cda1869c06ebadfb6488550015a88522c\",\n \"30e93e864e669d82224b967c3020b8fa8d1e4e350b6cbcc537a48b57841163a2\",\n ],\n [\n \"948dcadf5990e048aa3874d46abef9d701858f95de8041d2a6828c99e2262519\",\n \"e491a42537f6e597d5d28a3224b1bc25df9154efbd2ef1d2cbba2cae5347d57e\",\n ],\n [\n \"7962414450c76c1689c7b48f8202ec37fb224cf5ac0bfa1570328a8a3d7c77ab\",\n \"100b610ec4ffb4760d5c1fc133ef6f6b12507a051f04ac5760afa5b29db83437\",\n ],\n [\n \"3514087834964b54b15b160644d915485a16977225b8847bb0dd085137ec47ca\",\n \"ef0afbb2056205448e1652c48e8127fc6039e77c15c2378b7e7d15a0de293311\",\n ],\n [\n \"d3cc30ad6b483e4bc79ce2c9dd8bc54993e947eb8df787b442943d3f7b527eaf\",\n \"8b378a22d827278d89c5e9be8f9508ae3c2ad46290358630afb34db04eede0a4\",\n ],\n [\n \"1624d84780732860ce1c78fcbfefe08b2b29823db913f6493975ba0ff4847610\",\n \"68651cf9b6da903e0914448c6cd9d4ca896878f5282be4c8cc06e2a404078575\",\n ],\n [\n \"733ce80da955a8a26902c95633e62a985192474b5af207da6df7b4fd5fc61cd4\",\n \"f5435a2bd2badf7d485a4d8b8db9fcce3e1ef8e0201e4578c54673bc1dc5ea1d\",\n ],\n [\n \"15d9441254945064cf1a1c33bbd3b49f8966c5092171e699ef258dfab81c045c\",\n \"d56eb30b69463e7234f5137b73b84177434800bacebfc685fc37bbe9efe4070d\",\n ],\n [\n \"a1d0fcf2ec9de675b612136e5ce70d271c21417c9d2b8aaaac138599d0717940\",\n \"edd77f50bcb5a3cab2e90737309667f2641462a54070f3d519212d39c197a629\",\n ],\n [\n \"e22fbe15c0af8ccc5780c0735f84dbe9a790badee8245c06c7ca37331cb36980\",\n \"a855babad5cd60c88b430a69f53a1a7a38289154964799be43d06d77d31da06\",\n ],\n [\n \"311091dd9860e8e20ee13473c1155f5f69635e394704eaa74009452246cfa9b3\",\n \"66db656f87d1f04fffd1f04788c06830871ec5a64feee685bd80f0b1286d8374\",\n ],\n [\n \"34c1fd04d301be89b31c0442d3e6ac24883928b45a9340781867d4232ec2dbdf\",\n \"9414685e97b1b5954bd46f730174136d57f1ceeb487443dc5321857ba73abee\",\n ],\n [\n \"f219ea5d6b54701c1c14de5b557eb42a8d13f3abbcd08affcc2a5e6b049b8d63\",\n \"4cb95957e83d40b0f73af4544cccf6b1f4b08d3c07b27fb8d8c2962a400766d1\",\n ],\n [\n \"d7b8740f74a8fbaab1f683db8f45de26543a5490bca627087236912469a0b448\",\n \"fa77968128d9c92ee1010f337ad4717eff15db5ed3c049b3411e0315eaa4593b\",\n ],\n [\n \"32d31c222f8f6f0ef86f7c98d3a3335ead5bcd32abdd94289fe4d3091aa824bf\",\n \"5f3032f5892156e39ccd3d7915b9e1da2e6dac9e6f26e961118d14b8462e1661\",\n ],\n [\n \"7461f371914ab32671045a155d9831ea8793d77cd59592c4340f86cbc18347b5\",\n \"8ec0ba238b96bec0cbdddcae0aa442542eee1ff50c986ea6b39847b3cc092ff6\",\n ],\n [\n \"ee079adb1df1860074356a25aa38206a6d716b2c3e67453d287698bad7b2b2d6\",\n \"8dc2412aafe3be5c4c5f37e0ecc5f9f6a446989af04c4e25ebaac479ec1c8c1e\",\n ],\n [\n \"16ec93e447ec83f0467b18302ee620f7e65de331874c9dc72bfd8616ba9da6b5\",\n \"5e4631150e62fb40d0e8c2a7ca5804a39d58186a50e497139626778e25b0674d\",\n ],\n [\n \"eaa5f980c245f6f038978290afa70b6bd8855897f98b6aa485b96065d537bd99\",\n \"f65f5d3e292c2e0819a528391c994624d784869d7e6ea67fb18041024edc07dc\",\n ],\n [\n \"78c9407544ac132692ee1910a02439958ae04877151342ea96c4b6b35a49f51\",\n \"f3e0319169eb9b85d5404795539a5e68fa1fbd583c064d2462b675f194a3ddb4\",\n ],\n [\n \"494f4be219a1a77016dcd838431aea0001cdc8ae7a6fc688726578d9702857a5\",\n \"42242a969283a5f339ba7f075e36ba2af925ce30d767ed6e55f4b031880d562c\",\n ],\n [\n \"a598a8030da6d86c6bc7f2f5144ea549d28211ea58faa70ebf4c1e665c1fe9b5\",\n \"204b5d6f84822c307e4b4a7140737aec23fc63b65b35f86a10026dbd2d864e6b\",\n ],\n [\n \"c41916365abb2b5d09192f5f2dbeafec208f020f12570a184dbadc3e58595997\",\n \"4f14351d0087efa49d245b328984989d5caf9450f34bfc0ed16e96b58fa9913\",\n ],\n [\n \"841d6063a586fa475a724604da03bc5b92a2e0d2e0a36acfe4c73a5514742881\",\n \"73867f59c0659e81904f9a1c7543698e62562d6744c169ce7a36de01a8d6154\",\n ],\n [\n \"5e95bb399a6971d376026947f89bde2f282b33810928be4ded112ac4d70e20d5\",\n \"39f23f366809085beebfc71181313775a99c9aed7d8ba38b161384c746012865\",\n ],\n [\n \"36e4641a53948fd476c39f8a99fd974e5ec07564b5315d8bf99471bca0ef2f66\",\n \"d2424b1b1abe4eb8164227b085c9aa9456ea13493fd563e06fd51cf5694c78fc\",\n ],\n [\n \"336581ea7bfbbb290c191a2f507a41cf5643842170e914faeab27c2c579f726\",\n \"ead12168595fe1be99252129b6e56b3391f7ab1410cd1e0ef3dcdcabd2fda224\",\n ],\n [\n \"8ab89816dadfd6b6a1f2634fcf00ec8403781025ed6890c4849742706bd43ede\",\n \"6fdcef09f2f6d0a044e654aef624136f503d459c3e89845858a47a9129cdd24e\",\n ],\n [\n \"1e33f1a746c9c5778133344d9299fcaa20b0938e8acff2544bb40284b8c5fb94\",\n \"60660257dd11b3aa9c8ed618d24edff2306d320f1d03010e33a7d2057f3b3b6\",\n ],\n [\n \"85b7c1dcb3cec1b7ee7f30ded79dd20a0ed1f4cc18cbcfcfa410361fd8f08f31\",\n \"3d98a9cdd026dd43f39048f25a8847f4fcafad1895d7a633c6fed3c35e999511\",\n ],\n [\n \"29df9fbd8d9e46509275f4b125d6d45d7fbe9a3b878a7af872a2800661ac5f51\",\n \"b4c4fe99c775a606e2d8862179139ffda61dc861c019e55cd2876eb2a27d84b\",\n ],\n [\n \"a0b1cae06b0a847a3fea6e671aaf8adfdfe58ca2f768105c8082b2e449fce252\",\n \"ae434102edde0958ec4b19d917a6a28e6b72da1834aff0e650f049503a296cf2\",\n ],\n [\n \"4e8ceafb9b3e9a136dc7ff67e840295b499dfb3b2133e4ba113f2e4c0e121e5\",\n \"cf2174118c8b6d7a4b48f6d534ce5c79422c086a63460502b827ce62a326683c\",\n ],\n [\n \"d24a44e047e19b6f5afb81c7ca2f69080a5076689a010919f42725c2b789a33b\",\n \"6fb8d5591b466f8fc63db50f1c0f1c69013f996887b8244d2cdec417afea8fa3\",\n ],\n [\n \"ea01606a7a6c9cdd249fdfcfacb99584001edd28abbab77b5104e98e8e3b35d4\",\n \"322af4908c7312b0cfbfe369f7a7b3cdb7d4494bc2823700cfd652188a3ea98d\",\n ],\n [\n \"af8addbf2b661c8a6c6328655eb96651252007d8c5ea31be4ad196de8ce2131f\",\n \"6749e67c029b85f52a034eafd096836b2520818680e26ac8f3dfbcdb71749700\",\n ],\n [\n \"e3ae1974566ca06cc516d47e0fb165a674a3dabcfca15e722f0e3450f45889\",\n \"2aeabe7e4531510116217f07bf4d07300de97e4874f81f533420a72eeb0bd6a4\",\n ],\n [\n \"591ee355313d99721cf6993ffed1e3e301993ff3ed258802075ea8ced397e246\",\n \"b0ea558a113c30bea60fc4775460c7901ff0b053d25ca2bdeee98f1a4be5d196\",\n ],\n [\n \"11396d55fda54c49f19aa97318d8da61fa8584e47b084945077cf03255b52984\",\n \"998c74a8cd45ac01289d5833a7beb4744ff536b01b257be4c5767bea93ea57a4\",\n ],\n [\n \"3c5d2a1ba39c5a1790000738c9e0c40b8dcdfd5468754b6405540157e017aa7a\",\n \"b2284279995a34e2f9d4de7396fc18b80f9b8b9fdd270f6661f79ca4c81bd257\",\n ],\n [\n \"cc8704b8a60a0defa3a99a7299f2e9c3fbc395afb04ac078425ef8a1793cc030\",\n \"bdd46039feed17881d1e0862db347f8cf395b74fc4bcdc4e940b74e3ac1f1b13\",\n ],\n [\n \"c533e4f7ea8555aacd9777ac5cad29b97dd4defccc53ee7ea204119b2889b197\",\n \"6f0a256bc5efdf429a2fb6242f1a43a2d9b925bb4a4b3a26bb8e0f45eb596096\",\n ],\n [\n \"c14f8f2ccb27d6f109f6d08d03cc96a69ba8c34eec07bbcf566d48e33da6593\",\n \"c359d6923bb398f7fd4473e16fe1c28475b740dd098075e6c0e8649113dc3a38\",\n ],\n [\n \"a6cbc3046bc6a450bac24789fa17115a4c9739ed75f8f21ce441f72e0b90e6ef\",\n \"21ae7f4680e889bb130619e2c0f95a360ceb573c70603139862afd617fa9b9f\",\n ],\n [\n \"347d6d9a02c48927ebfb86c1359b1caf130a3c0267d11ce6344b39f99d43cc38\",\n \"60ea7f61a353524d1c987f6ecec92f086d565ab687870cb12689ff1e31c74448\",\n ],\n [\n \"da6545d2181db8d983f7dcb375ef5866d47c67b1bf31c8cf855ef7437b72656a\",\n \"49b96715ab6878a79e78f07ce5680c5d6673051b4935bd897fea824b77dc208a\",\n ],\n [\n \"c40747cc9d012cb1a13b8148309c6de7ec25d6945d657146b9d5994b8feb1111\",\n \"5ca560753be2a12fc6de6caf2cb489565db936156b9514e1bb5e83037e0fa2d4\",\n ],\n [\n \"4e42c8ec82c99798ccf3a610be870e78338c7f713348bd34c8203ef4037f3502\",\n \"7571d74ee5e0fb92a7a8b33a07783341a5492144cc54bcc40a94473693606437\",\n ],\n [\n \"3775ab7089bc6af823aba2e1af70b236d251cadb0c86743287522a1b3b0dedea\",\n \"be52d107bcfa09d8bcb9736a828cfa7fac8db17bf7a76a2c42ad961409018cf7\",\n ],\n [\n \"cee31cbf7e34ec379d94fb814d3d775ad954595d1314ba8846959e3e82f74e26\",\n \"8fd64a14c06b589c26b947ae2bcf6bfa0149ef0be14ed4d80f448a01c43b1c6d\",\n ],\n [\n \"b4f9eaea09b6917619f6ea6a4eb5464efddb58fd45b1ebefcdc1a01d08b47986\",\n \"39e5c9925b5a54b07433a4f18c61726f8bb131c012ca542eb24a8ac07200682a\",\n ],\n [\n \"d4263dfc3d2df923a0179a48966d30ce84e2515afc3dccc1b77907792ebcc60e\",\n \"62dfaf07a0f78feb30e30d6295853ce189e127760ad6cf7fae164e122a208d54\",\n ],\n [\n \"48457524820fa65a4f8d35eb6930857c0032acc0a4a2de422233eeda897612c4\",\n \"25a748ab367979d98733c38a1fa1c2e7dc6cc07db2d60a9ae7a76aaa49bd0f77\",\n ],\n [\n \"dfeeef1881101f2cb11644f3a2afdfc2045e19919152923f367a1767c11cceda\",\n \"ecfb7056cf1de042f9420bab396793c0c390bde74b4bbdff16a83ae09a9a7517\",\n ],\n [\n \"6d7ef6b17543f8373c573f44e1f389835d89bcbc6062ced36c82df83b8fae859\",\n \"cd450ec335438986dfefa10c57fea9bcc521a0959b2d80bbf74b190dca712d10\",\n ],\n [\n \"e75605d59102a5a2684500d3b991f2e3f3c88b93225547035af25af66e04541f\",\n \"f5c54754a8f71ee540b9b48728473e314f729ac5308b06938360990e2bfad125\",\n ],\n [\n \"eb98660f4c4dfaa06a2be453d5020bc99a0c2e60abe388457dd43fefb1ed620c\",\n \"6cb9a8876d9cb8520609af3add26cd20a0a7cd8a9411131ce85f44100099223e\",\n ],\n [\n \"13e87b027d8514d35939f2e6892b19922154596941888336dc3563e3b8dba942\",\n \"fef5a3c68059a6dec5d624114bf1e91aac2b9da568d6abeb2570d55646b8adf1\",\n ],\n [\n \"ee163026e9fd6fe017c38f06a5be6fc125424b371ce2708e7bf4491691e5764a\",\n \"1acb250f255dd61c43d94ccc670d0f58f49ae3fa15b96623e5430da0ad6c62b2\",\n ],\n [\n \"b268f5ef9ad51e4d78de3a750c2dc89b1e626d43505867999932e5db33af3d80\",\n \"5f310d4b3c99b9ebb19f77d41c1dee018cf0d34fd4191614003e945a1216e423\",\n ],\n [\n \"ff07f3118a9df035e9fad85eb6c7bfe42b02f01ca99ceea3bf7ffdba93c4750d\",\n \"438136d603e858a3a5c440c38eccbaddc1d2942114e2eddd4740d098ced1f0d8\",\n ],\n [\n \"8d8b9855c7c052a34146fd20ffb658bea4b9f69e0d825ebec16e8c3ce2b526a1\",\n \"cdb559eedc2d79f926baf44fb84ea4d44bcf50fee51d7ceb30e2e7f463036758\",\n ],\n [\n \"52db0b5384dfbf05bfa9d472d7ae26dfe4b851ceca91b1eba54263180da32b63\",\n \"c3b997d050ee5d423ebaf66a6db9f57b3180c902875679de924b69d84a7b375\",\n ],\n [\n \"e62f9490d3d51da6395efd24e80919cc7d0f29c3f3fa48c6fff543becbd43352\",\n \"6d89ad7ba4876b0b22c2ca280c682862f342c8591f1daf5170e07bfd9ccafa7d\",\n ],\n [\n \"7f30ea2476b399b4957509c88f77d0191afa2ff5cb7b14fd6d8e7d65aaab1193\",\n \"ca5ef7d4b231c94c3b15389a5f6311e9daff7bb67b103e9880ef4bff637acaec\",\n ],\n [\n \"5098ff1e1d9f14fb46a210fada6c903fef0fb7b4a1dd1d9ac60a0361800b7a00\",\n \"9731141d81fc8f8084d37c6e7542006b3ee1b40d60dfe5362a5b132fd17ddc0\",\n ],\n [\n \"32b78c7de9ee512a72895be6b9cbefa6e2f3c4ccce445c96b9f2c81e2778ad58\",\n \"ee1849f513df71e32efc3896ee28260c73bb80547ae2275ba497237794c8753c\",\n ],\n [\n \"e2cb74fddc8e9fbcd076eef2a7c72b0ce37d50f08269dfc074b581550547a4f7\",\n \"d3aa2ed71c9dd2247a62df062736eb0baddea9e36122d2be8641abcb005cc4a4\",\n ],\n [\n \"8438447566d4d7bedadc299496ab357426009a35f235cb141be0d99cd10ae3a8\",\n \"c4e1020916980a4da5d01ac5e6ad330734ef0d7906631c4f2390426b2edd791f\",\n ],\n [\n \"4162d488b89402039b584c6fc6c308870587d9c46f660b878ab65c82c711d67e\",\n \"67163e903236289f776f22c25fb8a3afc1732f2b84b4e95dbda47ae5a0852649\",\n ],\n [\n \"3fad3fa84caf0f34f0f89bfd2dcf54fc175d767aec3e50684f3ba4a4bf5f683d\",\n \"cd1bc7cb6cc407bb2f0ca647c718a730cf71872e7d0d2a53fa20efcdfe61826\",\n ],\n [\n \"674f2600a3007a00568c1a7ce05d0816c1fb84bf1370798f1c69532faeb1a86b\",\n \"299d21f9413f33b3edf43b257004580b70db57da0b182259e09eecc69e0d38a5\",\n ],\n [\n \"d32f4da54ade74abb81b815ad1fb3b263d82d6c692714bcff87d29bd5ee9f08f\",\n \"f9429e738b8e53b968e99016c059707782e14f4535359d582fc416910b3eea87\",\n ],\n [\n \"30e4e670435385556e593657135845d36fbb6931f72b08cb1ed954f1e3ce3ff6\",\n \"462f9bce619898638499350113bbc9b10a878d35da70740dc695a559eb88db7b\",\n ],\n [\n \"be2062003c51cc3004682904330e4dee7f3dcd10b01e580bf1971b04d4cad297\",\n \"62188bc49d61e5428573d48a74e1c655b1c61090905682a0d5558ed72dccb9bc\",\n ],\n [\n \"93144423ace3451ed29e0fb9ac2af211cb6e84a601df5993c419859fff5df04a\",\n \"7c10dfb164c3425f5c71a3f9d7992038f1065224f72bb9d1d902a6d13037b47c\",\n ],\n [\n \"b015f8044f5fcbdcf21ca26d6c34fb8197829205c7b7d2a7cb66418c157b112c\",\n \"ab8c1e086d04e813744a655b2df8d5f83b3cdc6faa3088c1d3aea1454e3a1d5f\",\n ],\n [\n \"d5e9e1da649d97d89e4868117a465a3a4f8a18de57a140d36b3f2af341a21b52\",\n \"4cb04437f391ed73111a13cc1d4dd0db1693465c2240480d8955e8592f27447a\",\n ],\n [\n \"d3ae41047dd7ca065dbf8ed77b992439983005cd72e16d6f996a5316d36966bb\",\n \"bd1aeb21ad22ebb22a10f0303417c6d964f8cdd7df0aca614b10dc14d125ac46\",\n ],\n [\n \"463e2763d885f958fc66cdd22800f0a487197d0a82e377b49f80af87c897b065\",\n \"bfefacdb0e5d0fd7df3a311a94de062b26b80c61fbc97508b79992671ef7ca7f\",\n ],\n [\n \"7985fdfd127c0567c6f53ec1bb63ec3158e597c40bfe747c83cddfc910641917\",\n \"603c12daf3d9862ef2b25fe1de289aed24ed291e0ec6708703a5bd567f32ed03\",\n ],\n [\n \"74a1ad6b5f76e39db2dd249410eac7f99e74c59cb83d2d0ed5ff1543da7703e9\",\n \"cc6157ef18c9c63cd6193d83631bbea0093e0968942e8c33d5737fd790e0db08\",\n ],\n [\n \"30682a50703375f602d416664ba19b7fc9bab42c72747463a71d0896b22f6da3\",\n \"553e04f6b018b4fa6c8f39e7f311d3176290d0e0f19ca73f17714d9977a22ff8\",\n ],\n [\n \"9e2158f0d7c0d5f26c3791efefa79597654e7a2b2464f52b1ee6c1347769ef57\",\n \"712fcdd1b9053f09003a3481fa7762e9ffd7c8ef35a38509e2fbf2629008373\",\n ],\n [\n \"176e26989a43c9cfeba4029c202538c28172e566e3c4fce7322857f3be327d66\",\n \"ed8cc9d04b29eb877d270b4878dc43c19aefd31f4eee09ee7b47834c1fa4b1c3\",\n ],\n [\n \"75d46efea3771e6e68abb89a13ad747ecf1892393dfc4f1b7004788c50374da8\",\n \"9852390a99507679fd0b86fd2b39a868d7efc22151346e1a3ca4726586a6bed8\",\n ],\n [\n \"809a20c67d64900ffb698c4c825f6d5f2310fb0451c869345b7319f645605721\",\n \"9e994980d9917e22b76b061927fa04143d096ccc54963e6a5ebfa5f3f8e286c1\",\n ],\n [\n \"1b38903a43f7f114ed4500b4eac7083fdefece1cf29c63528d563446f972c180\",\n \"4036edc931a60ae889353f77fd53de4a2708b26b6f5da72ad3394119daf408f9\",\n ],\n ],\n },\n };\n },\n});\n\n// node_modules/elliptic/lib/elliptic/curves.js\nvar require_curves = __commonJS({\n \"node_modules/elliptic/lib/elliptic/curves.js\"(exports) {\n \"use strict\";\n var curves = exports,\n hash = require_hash2(),\n curve = require_curve(),\n utils = require_utils3(),\n assert = utils.assert;\n function PresetCurve(options) {\n options.type === \"short\"\n ? (this.curve = new curve.short(options))\n : options.type === \"edwards\"\n ? (this.curve = new curve.edwards(options))\n : (this.curve = new curve.mont(options)),\n (this.g = this.curve.g),\n (this.n = this.curve.n),\n (this.hash = options.hash),\n assert(this.g.validate(), \"Invalid curve\"),\n assert(this.g.mul(this.n).isInfinity(), \"Invalid curve, G*N != O\");\n }\n curves.PresetCurve = PresetCurve;\n function defineCurve(name, options) {\n Object.defineProperty(curves, name, {\n configurable: !0,\n enumerable: !0,\n get: function () {\n var curve2 = new PresetCurve(options);\n return (\n Object.defineProperty(curves, name, {\n configurable: !0,\n enumerable: !0,\n value: curve2,\n }),\n curve2\n );\n },\n });\n }\n defineCurve(\"p192\", {\n type: \"short\",\n prime: \"p192\",\n p: \"ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff\",\n a: \"ffffffff ffffffff ffffffff fffffffe ffffffff fffffffc\",\n b: \"64210519 e59c80e7 0fa7e9ab 72243049 feb8deec c146b9b1\",\n n: \"ffffffff ffffffff ffffffff 99def836 146bc9b1 b4d22831\",\n hash: hash.sha256,\n gRed: !1,\n g: [\n \"188da80e b03090f6 7cbf20eb 43a18800 f4ff0afd 82ff1012\",\n \"07192b95 ffc8da78 631011ed 6b24cdd5 73f977a1 1e794811\",\n ],\n });\n defineCurve(\"p224\", {\n type: \"short\",\n prime: \"p224\",\n p: \"ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001\",\n a: \"ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff fffffffe\",\n b: \"b4050a85 0c04b3ab f5413256 5044b0b7 d7bfd8ba 270b3943 2355ffb4\",\n n: \"ffffffff ffffffff ffffffff ffff16a2 e0b8f03e 13dd2945 5c5c2a3d\",\n hash: hash.sha256,\n gRed: !1,\n g: [\n \"b70e0cbd 6bb4bf7f 321390b9 4a03c1d3 56c21122 343280d6 115c1d21\",\n \"bd376388 b5f723fb 4c22dfe6 cd4375a0 5a074764 44d58199 85007e34\",\n ],\n });\n defineCurve(\"p256\", {\n type: \"short\",\n prime: null,\n p: \"ffffffff 00000001 00000000 00000000 00000000 ffffffff ffffffff ffffffff\",\n a: \"ffffffff 00000001 00000000 00000000 00000000 ffffffff ffffffff fffffffc\",\n b: \"5ac635d8 aa3a93e7 b3ebbd55 769886bc 651d06b0 cc53b0f6 3bce3c3e 27d2604b\",\n n: \"ffffffff 00000000 ffffffff ffffffff bce6faad a7179e84 f3b9cac2 fc632551\",\n hash: hash.sha256,\n gRed: !1,\n g: [\n \"6b17d1f2 e12c4247 f8bce6e5 63a440f2 77037d81 2deb33a0 f4a13945 d898c296\",\n \"4fe342e2 fe1a7f9b 8ee7eb4a 7c0f9e16 2bce3357 6b315ece cbb64068 37bf51f5\",\n ],\n });\n defineCurve(\"p384\", {\n type: \"short\",\n prime: null,\n p: \"ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe ffffffff 00000000 00000000 ffffffff\",\n a: \"ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe ffffffff 00000000 00000000 fffffffc\",\n b: \"b3312fa7 e23ee7e4 988e056b e3f82d19 181d9c6e fe814112 0314088f 5013875a c656398d 8a2ed19d 2a85c8ed d3ec2aef\",\n n: \"ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff c7634d81 f4372ddf 581a0db2 48b0a77a ecec196a ccc52973\",\n hash: hash.sha384,\n gRed: !1,\n g: [\n \"aa87ca22 be8b0537 8eb1c71e f320ad74 6e1d3b62 8ba79b98 59f741e0 82542a38 5502f25d bf55296c 3a545e38 72760ab7\",\n \"3617de4a 96262c6f 5d9e98bf 9292dc29 f8f41dbd 289a147c e9da3113 b5f0b8c0 0a60b1ce 1d7e819d 7a431d7c 90ea0e5f\",\n ],\n });\n defineCurve(\"p521\", {\n type: \"short\",\n prime: null,\n p: \"000001ff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff\",\n a: \"000001ff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffc\",\n b: \"00000051 953eb961 8e1c9a1f 929a21a0 b68540ee a2da725b 99b315f3 b8b48991 8ef109e1 56193951 ec7e937b 1652c0bd 3bb1bf07 3573df88 3d2c34f1 ef451fd4 6b503f00\",\n n: \"000001ff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffa 51868783 bf2f966b 7fcc0148 f709a5d0 3bb5c9b8 899c47ae bb6fb71e 91386409\",\n hash: hash.sha512,\n gRed: !1,\n g: [\n \"000000c6 858e06b7 0404e9cd 9e3ecb66 2395b442 9c648139 053fb521 f828af60 6b4d3dba a14b5e77 efe75928 fe1dc127 a2ffa8de 3348b3c1 856a429b f97e7e31 c2e5bd66\",\n \"00000118 39296a78 9a3bc004 5c8a5fb4 2c7d1bd9 98f54449 579b4468 17afbd17 273e662c 97ee7299 5ef42640 c550b901 3fad0761 353c7086 a272c240 88be9476 9fd16650\",\n ],\n });\n defineCurve(\"curve25519\", {\n type: \"mont\",\n prime: \"p25519\",\n p: \"7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed\",\n a: \"76d06\",\n b: \"1\",\n n: \"1000000000000000 0000000000000000 14def9dea2f79cd6 5812631a5cf5d3ed\",\n hash: hash.sha256,\n gRed: !1,\n g: [\"9\"],\n });\n defineCurve(\"ed25519\", {\n type: \"edwards\",\n prime: \"p25519\",\n p: \"7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed\",\n a: \"-1\",\n c: \"1\",\n d: \"52036cee2b6ffe73 8cc740797779e898 00700a4d4141d8ab 75eb4dca135978a3\",\n n: \"1000000000000000 0000000000000000 14def9dea2f79cd6 5812631a5cf5d3ed\",\n hash: hash.sha256,\n gRed: !1,\n g: [\n \"216936d3cd6e53fec0a4e231fdd6dc5c692cc7609525a7b2c9562d608f25d51a\",\n \"6666666666666666666666666666666666666666666666666666666666666658\",\n ],\n });\n var pre;\n try {\n pre = require_secp256k1();\n } catch {\n pre = void 0;\n }\n defineCurve(\"secp256k1\", {\n type: \"short\",\n prime: \"k256\",\n p: \"ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f\",\n a: \"0\",\n b: \"7\",\n n: \"ffffffff ffffffff ffffffff fffffffe baaedce6 af48a03b bfd25e8c d0364141\",\n h: \"1\",\n hash: hash.sha256,\n beta: \"7ae96a2b657c07106e64479eac3434e99cf0497512f58995c1396c28719501ee\",\n lambda: \"5363ad4cc05c30e0a5261c028812645a122e22ea20816678df02967c1b23bd72\",\n basis: [\n {\n a: \"3086d221a7d46bcde86c90e49284eb15\",\n b: \"-e4437ed6010e88286f547fa90abfe4c3\",\n },\n {\n a: \"114ca50f7a8e2f3f657c1108d9d44cfd8\",\n b: \"3086d221a7d46bcde86c90e49284eb15\",\n },\n ],\n gRed: !1,\n g: [\n \"79be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798\",\n \"483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8\",\n pre,\n ],\n });\n },\n});\n\n// node_modules/hmac-drbg/lib/hmac-drbg.js\nvar require_hmac_drbg = __commonJS({\n \"node_modules/hmac-drbg/lib/hmac-drbg.js\"(exports, module) {\n \"use strict\";\n var hash = require_hash2(),\n utils = require_utils2(),\n assert = require_minimalistic_assert();\n function HmacDRBG(options) {\n if (!(this instanceof HmacDRBG)) return new HmacDRBG(options);\n (this.hash = options.hash),\n (this.predResist = !!options.predResist),\n (this.outLen = this.hash.outSize),\n (this.minEntropy = options.minEntropy || this.hash.hmacStrength),\n (this._reseed = null),\n (this.reseedInterval = null),\n (this.K = null),\n (this.V = null);\n var entropy = utils.toArray(options.entropy, options.entropyEnc || \"hex\"),\n nonce = utils.toArray(options.nonce, options.nonceEnc || \"hex\"),\n pers = utils.toArray(options.pers, options.persEnc || \"hex\");\n assert(entropy.length >= this.minEntropy / 8, \"Not enough entropy. Minimum is: \" + this.minEntropy + \" bits\"),\n this._init(entropy, nonce, pers);\n }\n module.exports = HmacDRBG;\n HmacDRBG.prototype._init = function (entropy, nonce, pers) {\n var seed = entropy.concat(nonce).concat(pers);\n (this.K = new Array(this.outLen / 8)), (this.V = new Array(this.outLen / 8));\n for (var i = 0; i < this.V.length; i++) (this.K[i] = 0), (this.V[i] = 1);\n this._update(seed), (this._reseed = 1), (this.reseedInterval = 281474976710656);\n };\n HmacDRBG.prototype._hmac = function () {\n return new hash.hmac(this.hash, this.K);\n };\n HmacDRBG.prototype._update = function (seed) {\n var kmac = this._hmac().update(this.V).update([0]);\n seed && (kmac = kmac.update(seed)),\n (this.K = kmac.digest()),\n (this.V = this._hmac().update(this.V).digest()),\n seed &&\n ((this.K = this._hmac().update(this.V).update([1]).update(seed).digest()),\n (this.V = this._hmac().update(this.V).digest()));\n };\n HmacDRBG.prototype.reseed = function (entropy, entropyEnc, add, addEnc) {\n typeof entropyEnc != \"string\" && ((addEnc = add), (add = entropyEnc), (entropyEnc = null)),\n (entropy = utils.toArray(entropy, entropyEnc)),\n (add = utils.toArray(add, addEnc)),\n assert(entropy.length >= this.minEntropy / 8, \"Not enough entropy. Minimum is: \" + this.minEntropy + \" bits\"),\n this._update(entropy.concat(add || [])),\n (this._reseed = 1);\n };\n HmacDRBG.prototype.generate = function (len, enc, add, addEnc) {\n if (this._reseed > this.reseedInterval) throw new Error(\"Reseed is required\");\n typeof enc != \"string\" && ((addEnc = add), (add = enc), (enc = null)),\n add && ((add = utils.toArray(add, addEnc || \"hex\")), this._update(add));\n for (var temp = []; temp.length < len; )\n (this.V = this._hmac().update(this.V).digest()), (temp = temp.concat(this.V));\n var res = temp.slice(0, len);\n return this._update(add), this._reseed++, utils.encode(res, enc);\n };\n },\n});\n\n// node_modules/elliptic/lib/elliptic/ec/key.js\nvar require_key = __commonJS({\n \"node_modules/elliptic/lib/elliptic/ec/key.js\"(exports, module) {\n \"use strict\";\n var BN = require_bn4(),\n utils = require_utils3(),\n assert = utils.assert;\n function KeyPair(ec, options) {\n (this.ec = ec),\n (this.priv = null),\n (this.pub = null),\n options.priv && this._importPrivate(options.priv, options.privEnc),\n options.pub && this._importPublic(options.pub, options.pubEnc);\n }\n module.exports = KeyPair;\n KeyPair.fromPublic = function (ec, pub, enc) {\n return pub instanceof KeyPair\n ? pub\n : new KeyPair(ec, {\n pub,\n pubEnc: enc,\n });\n };\n KeyPair.fromPrivate = function (ec, priv, enc) {\n return priv instanceof KeyPair\n ? priv\n : new KeyPair(ec, {\n priv,\n privEnc: enc,\n });\n };\n KeyPair.prototype.validate = function () {\n var pub = this.getPublic();\n return pub.isInfinity()\n ? { result: !1, reason: \"Invalid public key\" }\n : pub.validate()\n ? pub.mul(this.ec.curve.n).isInfinity()\n ? { result: !0, reason: null }\n : { result: !1, reason: \"Public key * N != O\" }\n : { result: !1, reason: \"Public key is not a point\" };\n };\n KeyPair.prototype.getPublic = function (compact, enc) {\n return (\n typeof compact == \"string\" && ((enc = compact), (compact = null)),\n this.pub || (this.pub = this.ec.g.mul(this.priv)),\n enc ? this.pub.encode(enc, compact) : this.pub\n );\n };\n KeyPair.prototype.getPrivate = function (enc) {\n return enc === \"hex\" ? this.priv.toString(16, 2) : this.priv;\n };\n KeyPair.prototype._importPrivate = function (key, enc) {\n (this.priv = new BN(key, enc || 16)), (this.priv = this.priv.umod(this.ec.curve.n));\n };\n KeyPair.prototype._importPublic = function (key, enc) {\n if (key.x || key.y) {\n this.ec.curve.type === \"mont\"\n ? assert(key.x, \"Need x coordinate\")\n : (this.ec.curve.type === \"short\" || this.ec.curve.type === \"edwards\") &&\n assert(key.x && key.y, \"Need both x and y coordinate\"),\n (this.pub = this.ec.curve.point(key.x, key.y));\n return;\n }\n this.pub = this.ec.curve.decodePoint(key, enc);\n };\n KeyPair.prototype.derive = function (pub) {\n return pub.validate() || assert(pub.validate(), \"public point not validated\"), pub.mul(this.priv).getX();\n };\n KeyPair.prototype.sign = function (msg, enc, options) {\n return this.ec.sign(msg, this, enc, options);\n };\n KeyPair.prototype.verify = function (msg, signature) {\n return this.ec.verify(msg, signature, this);\n };\n KeyPair.prototype.inspect = function () {\n return (\n \"<Key priv: \" + (this.priv && this.priv.toString(16, 2)) + \" pub: \" + (this.pub && this.pub.inspect()) + \" >\"\n );\n };\n },\n});\n\n// node_modules/elliptic/lib/elliptic/ec/signature.js\nvar require_signature = __commonJS({\n \"node_modules/elliptic/lib/elliptic/ec/signature.js\"(exports, module) {\n \"use strict\";\n var BN = require_bn4(),\n utils = require_utils3(),\n assert = utils.assert;\n function Signature(options, enc) {\n if (options instanceof Signature) return options;\n this._importDER(options, enc) ||\n (assert(options.r && options.s, \"Signature without r or s\"),\n (this.r = new BN(options.r, 16)),\n (this.s = new BN(options.s, 16)),\n options.recoveryParam === void 0 ? (this.recoveryParam = null) : (this.recoveryParam = options.recoveryParam));\n }\n module.exports = Signature;\n function Position() {\n this.place = 0;\n }\n function getLength(buf, p) {\n var initial = buf[p.place++];\n if (!(initial & 128)) return initial;\n var octetLen = initial & 15;\n if (octetLen === 0 || octetLen > 4) return !1;\n for (var val = 0, i = 0, off = p.place; i < octetLen; i++, off++) (val <<= 8), (val |= buf[off]), (val >>>= 0);\n return val <= 127 ? !1 : ((p.place = off), val);\n }\n function rmPadding(buf) {\n for (var i = 0, len = buf.length - 1; !buf[i] && !(buf[i + 1] & 128) && i < len; ) i++;\n return i === 0 ? buf : buf.slice(i);\n }\n Signature.prototype._importDER = function (data, enc) {\n data = utils.toArray(data, enc);\n var p = new Position();\n if (data[p.place++] !== 48) return !1;\n var len = getLength(data, p);\n if (len === !1 || len + p.place !== data.length || data[p.place++] !== 2) return !1;\n var rlen = getLength(data, p);\n if (rlen === !1) return !1;\n var r = data.slice(p.place, rlen + p.place);\n if (((p.place += rlen), data[p.place++] !== 2)) return !1;\n var slen = getLength(data, p);\n if (slen === !1 || data.length !== slen + p.place) return !1;\n var s = data.slice(p.place, slen + p.place);\n if (r[0] === 0)\n if (r[1] & 128) r = r.slice(1);\n else return !1;\n if (s[0] === 0)\n if (s[1] & 128) s = s.slice(1);\n else return !1;\n return (this.r = new BN(r)), (this.s = new BN(s)), (this.recoveryParam = null), !0;\n };\n function constructLength(arr, len) {\n if (len < 128) {\n arr.push(len);\n return;\n }\n var octets = 1 + ((Math.log(len) / Math.LN2) >>> 3);\n for (arr.push(octets | 128); --octets; ) arr.push((len >>> (octets << 3)) & 255);\n arr.push(len);\n }\n Signature.prototype.toDER = function (enc) {\n var r = this.r.toArray(),\n s = this.s.toArray();\n for (\n r[0] & 128 && (r = [0].concat(r)), s[0] & 128 && (s = [0].concat(s)), r = rmPadding(r), s = rmPadding(s);\n !s[0] && !(s[1] & 128);\n\n )\n s = s.slice(1);\n var arr = [2];\n constructLength(arr, r.length), (arr = arr.concat(r)), arr.push(2), constructLength(arr, s.length);\n var backHalf = arr.concat(s),\n res = [48];\n return constructLength(res, backHalf.length), (res = res.concat(backHalf)), utils.encode(res, enc);\n };\n },\n});\n\n// node_modules/elliptic/lib/elliptic/ec/index.js\nvar require_ec = __commonJS({\n \"node_modules/elliptic/lib/elliptic/ec/index.js\"(exports, module) {\n \"use strict\";\n var BN = require_bn4(),\n HmacDRBG = require_hmac_drbg(),\n utils = require_utils3(),\n curves = require_curves(),\n rand = require_brorand(),\n assert = utils.assert,\n KeyPair = require_key(),\n Signature = require_signature();\n function EC(options) {\n if (!(this instanceof EC)) return new EC(options);\n typeof options == \"string\" &&\n (assert(Object.prototype.hasOwnProperty.call(curves, options), \"Unknown curve \" + options),\n (options = curves[options])),\n options instanceof curves.PresetCurve && (options = { curve: options }),\n (this.curve = options.curve.curve),\n (this.n = this.curve.n),\n (this.nh = this.n.ushrn(1)),\n (this.g = this.curve.g),\n (this.g = options.curve.g),\n this.g.precompute(options.curve.n.bitLength() + 1),\n (this.hash = options.hash || options.curve.hash);\n }\n module.exports = EC;\n EC.prototype.keyPair = function (options) {\n return new KeyPair(this, options);\n };\n EC.prototype.keyFromPrivate = function (priv, enc) {\n return KeyPair.fromPrivate(this, priv, enc);\n };\n EC.prototype.keyFromPublic = function (pub, enc) {\n return KeyPair.fromPublic(this, pub, enc);\n };\n EC.prototype.genKeyPair = function (options) {\n options || (options = {});\n for (\n var drbg = new HmacDRBG({\n hash: this.hash,\n pers: options.pers,\n persEnc: options.persEnc || \"utf8\",\n entropy: options.entropy || rand(this.hash.hmacStrength),\n entropyEnc: (options.entropy && options.entropyEnc) || \"utf8\",\n nonce: this.n.toArray(),\n }),\n bytes = this.n.byteLength(),\n ns2 = this.n.sub(new BN(2));\n ;\n\n ) {\n var priv = new BN(drbg.generate(bytes));\n if (!(priv.cmp(ns2) > 0)) return priv.iaddn(1), this.keyFromPrivate(priv);\n }\n };\n EC.prototype._truncateToN = function (msg, truncOnly) {\n var delta = msg.byteLength() * 8 - this.n.bitLength();\n return delta > 0 && (msg = msg.ushrn(delta)), !truncOnly && msg.cmp(this.n) >= 0 ? msg.sub(this.n) : msg;\n };\n EC.prototype.sign = function (msg, key, enc, options) {\n typeof enc == \"object\" && ((options = enc), (enc = null)),\n options || (options = {}),\n (key = this.keyFromPrivate(key, enc)),\n (msg = this._truncateToN(new BN(msg, 16)));\n for (\n var bytes = this.n.byteLength(),\n bkey = key.getPrivate().toArray(\"be\", bytes),\n nonce = msg.toArray(\"be\", bytes),\n drbg = new HmacDRBG({\n hash: this.hash,\n entropy: bkey,\n nonce,\n pers: options.pers,\n persEnc: options.persEnc || \"utf8\",\n }),\n ns1 = this.n.sub(new BN(1)),\n iter = 0;\n ;\n iter++\n ) {\n var k = options.k ? options.k(iter) : new BN(drbg.generate(this.n.byteLength()));\n if (((k = this._truncateToN(k, !0)), !(k.cmpn(1) <= 0 || k.cmp(ns1) >= 0))) {\n var kp = this.g.mul(k);\n if (!kp.isInfinity()) {\n var kpX = kp.getX(),\n r = kpX.umod(this.n);\n if (r.cmpn(0) !== 0) {\n var s = k.invm(this.n).mul(r.mul(key.getPrivate()).iadd(msg));\n if (((s = s.umod(this.n)), s.cmpn(0) !== 0)) {\n var recoveryParam = (kp.getY().isOdd() ? 1 : 0) | (kpX.cmp(r) !== 0 ? 2 : 0);\n return (\n options.canonical && s.cmp(this.nh) > 0 && ((s = this.n.sub(s)), (recoveryParam ^= 1)),\n new Signature({ r, s, recoveryParam })\n );\n }\n }\n }\n }\n }\n };\n EC.prototype.verify = function (msg, signature, key, enc) {\n (msg = this._truncateToN(new BN(msg, 16))),\n (key = this.keyFromPublic(key, enc)),\n (signature = new Signature(signature, \"hex\"));\n var r = signature.r,\n s = signature.s;\n if (r.cmpn(1) < 0 || r.cmp(this.n) >= 0 || s.cmpn(1) < 0 || s.cmp(this.n) >= 0) return !1;\n var sinv = s.invm(this.n),\n u1 = sinv.mul(msg).umod(this.n),\n u2 = sinv.mul(r).umod(this.n),\n p;\n return this.curve._maxwellTrick\n ? ((p = this.g.jmulAdd(u1, key.getPublic(), u2)), p.isInfinity() ? !1 : p.eqXToP(r))\n : ((p = this.g.mulAdd(u1, key.getPublic(), u2)), p.isInfinity() ? !1 : p.getX().umod(this.n).cmp(r) === 0);\n };\n EC.prototype.recoverPubKey = function (msg, signature, j, enc) {\n assert((3 & j) === j, \"The recovery param is more than two bits\"), (signature = new Signature(signature, enc));\n var n = this.n,\n e = new BN(msg),\n r = signature.r,\n s = signature.s,\n isYOdd = j & 1,\n isSecondKey = j >> 1;\n if (r.cmp(this.curve.p.umod(this.curve.n)) >= 0 && isSecondKey)\n throw new Error(\"Unable to find sencond key candinate\");\n isSecondKey ? (r = this.curve.pointFromX(r.add(this.curve.n), isYOdd)) : (r = this.curve.pointFromX(r, isYOdd));\n var rInv = signature.r.invm(n),\n s1 = n.sub(e).mul(rInv).umod(n),\n s2 = s.mul(rInv).umod(n);\n return this.g.mulAdd(s1, r, s2);\n };\n EC.prototype.getKeyRecoveryParam = function (e, signature, Q, enc) {\n if (((signature = new Signature(signature, enc)), signature.recoveryParam !== null))\n return signature.recoveryParam;\n for (var i = 0; i < 4; i++) {\n var Qprime;\n try {\n Qprime = this.recoverPubKey(e, signature, i);\n } catch {\n continue;\n }\n if (Qprime.eq(Q)) return i;\n }\n throw new Error(\"Unable to find valid recovery factor\");\n };\n },\n});\n\n// node_modules/elliptic/lib/elliptic/eddsa/key.js\nvar require_key2 = __commonJS({\n \"node_modules/elliptic/lib/elliptic/eddsa/key.js\"(exports, module) {\n \"use strict\";\n var utils = require_utils3(),\n assert = utils.assert,\n parseBytes = utils.parseBytes,\n cachedProperty = utils.cachedProperty;\n function KeyPair(eddsa, params) {\n (this.eddsa = eddsa),\n (this._secret = parseBytes(params.secret)),\n eddsa.isPoint(params.pub) ? (this._pub = params.pub) : (this._pubBytes = parseBytes(params.pub));\n }\n KeyPair.fromPublic = function (eddsa, pub) {\n return pub instanceof KeyPair ? pub : new KeyPair(eddsa, { pub });\n };\n KeyPair.fromSecret = function (eddsa, secret) {\n return secret instanceof KeyPair ? secret : new KeyPair(eddsa, { secret });\n };\n KeyPair.prototype.secret = function () {\n return this._secret;\n };\n cachedProperty(KeyPair, \"pubBytes\", function () {\n return this.eddsa.encodePoint(this.pub());\n });\n cachedProperty(KeyPair, \"pub\", function () {\n return this._pubBytes ? this.eddsa.decodePoint(this._pubBytes) : this.eddsa.g.mul(this.priv());\n });\n cachedProperty(KeyPair, \"privBytes\", function () {\n var eddsa = this.eddsa,\n hash = this.hash(),\n lastIx = eddsa.encodingLength - 1,\n a = hash.slice(0, eddsa.encodingLength);\n return (a[0] &= 248), (a[lastIx] &= 127), (a[lastIx] |= 64), a;\n });\n cachedProperty(KeyPair, \"priv\", function () {\n return this.eddsa.decodeInt(this.privBytes());\n });\n cachedProperty(KeyPair, \"hash\", function () {\n return this.eddsa.hash().update(this.secret()).digest();\n });\n cachedProperty(KeyPair, \"messagePrefix\", function () {\n return this.hash().slice(this.eddsa.encodingLength);\n });\n KeyPair.prototype.sign = function (message) {\n return assert(this._secret, \"KeyPair can only verify\"), this.eddsa.sign(message, this);\n };\n KeyPair.prototype.verify = function (message, sig) {\n return this.eddsa.verify(message, sig, this);\n };\n KeyPair.prototype.getSecret = function (enc) {\n return assert(this._secret, \"KeyPair is public only\"), utils.encode(this.secret(), enc);\n };\n KeyPair.prototype.getPublic = function (enc) {\n return utils.encode(this.pubBytes(), enc);\n };\n module.exports = KeyPair;\n },\n});\n\n// node_modules/elliptic/lib/elliptic/eddsa/signature.js\nvar require_signature2 = __commonJS({\n \"node_modules/elliptic/lib/elliptic/eddsa/signature.js\"(exports, module) {\n \"use strict\";\n var BN = require_bn4(),\n utils = require_utils3(),\n assert = utils.assert,\n cachedProperty = utils.cachedProperty,\n parseBytes = utils.parseBytes;\n function Signature(eddsa, sig) {\n (this.eddsa = eddsa),\n typeof sig != \"object\" && (sig = parseBytes(sig)),\n Array.isArray(sig) &&\n (sig = {\n R: sig.slice(0, eddsa.encodingLength),\n S: sig.slice(eddsa.encodingLength),\n }),\n assert(sig.R && sig.S, \"Signature without R or S\"),\n eddsa.isPoint(sig.R) && (this._R = sig.R),\n sig.S instanceof BN && (this._S = sig.S),\n (this._Rencoded = Array.isArray(sig.R) ? sig.R : sig.Rencoded),\n (this._Sencoded = Array.isArray(sig.S) ? sig.S : sig.Sencoded);\n }\n cachedProperty(Signature, \"S\", function () {\n return this.eddsa.decodeInt(this.Sencoded());\n });\n cachedProperty(Signature, \"R\", function () {\n return this.eddsa.decodePoint(this.Rencoded());\n });\n cachedProperty(Signature, \"Rencoded\", function () {\n return this.eddsa.encodePoint(this.R());\n });\n cachedProperty(Signature, \"Sencoded\", function () {\n return this.eddsa.encodeInt(this.S());\n });\n Signature.prototype.toBytes = function () {\n return this.Rencoded().concat(this.Sencoded());\n };\n Signature.prototype.toHex = function () {\n return utils.encode(this.toBytes(), \"hex\").toUpperCase();\n };\n module.exports = Signature;\n },\n});\n\n// node_modules/elliptic/lib/elliptic/eddsa/index.js\nvar require_eddsa = __commonJS({\n \"node_modules/elliptic/lib/elliptic/eddsa/index.js\"(exports, module) {\n \"use strict\";\n var hash = require_hash2(),\n curves = require_curves(),\n utils = require_utils3(),\n assert = utils.assert,\n parseBytes = utils.parseBytes,\n KeyPair = require_key2(),\n Signature = require_signature2();\n function EDDSA(curve) {\n if ((assert(curve === \"ed25519\", \"only tested with ed25519 so far\"), !(this instanceof EDDSA)))\n return new EDDSA(curve);\n (curve = curves[curve].curve),\n (this.curve = curve),\n (this.g = curve.g),\n this.g.precompute(curve.n.bitLength() + 1),\n (this.pointClass = curve.point().constructor),\n (this.encodingLength = Math.ceil(curve.n.bitLength() / 8)),\n (this.hash = hash.sha512);\n }\n module.exports = EDDSA;\n EDDSA.prototype.sign = function (message, secret) {\n message = parseBytes(message);\n var key = this.keyFromSecret(secret),\n r = this.hashInt(key.messagePrefix(), message),\n R = this.g.mul(r),\n Rencoded = this.encodePoint(R),\n s_ = this.hashInt(Rencoded, key.pubBytes(), message).mul(key.priv()),\n S = r.add(s_).umod(this.curve.n);\n return this.makeSignature({ R, S, Rencoded });\n };\n EDDSA.prototype.verify = function (message, sig, pub) {\n (message = parseBytes(message)), (sig = this.makeSignature(sig));\n var key = this.keyFromPublic(pub),\n h = this.hashInt(sig.Rencoded(), key.pubBytes(), message),\n SG = this.g.mul(sig.S()),\n RplusAh = sig.R().add(key.pub().mul(h));\n return RplusAh.eq(SG);\n };\n EDDSA.prototype.hashInt = function () {\n for (var hash2 = this.hash(), i = 0; i < arguments.length; i++) hash2.update(arguments[i]);\n return utils.intFromLE(hash2.digest()).umod(this.curve.n);\n };\n EDDSA.prototype.keyFromPublic = function (pub) {\n return KeyPair.fromPublic(this, pub);\n };\n EDDSA.prototype.keyFromSecret = function (secret) {\n return KeyPair.fromSecret(this, secret);\n };\n EDDSA.prototype.makeSignature = function (sig) {\n return sig instanceof Signature ? sig : new Signature(this, sig);\n };\n EDDSA.prototype.encodePoint = function (point) {\n var enc = point.getY().toArray(\"le\", this.encodingLength);\n return (enc[this.encodingLength - 1] |= point.getX().isOdd() ? 128 : 0), enc;\n };\n EDDSA.prototype.decodePoint = function (bytes) {\n bytes = utils.parseBytes(bytes);\n var lastIx = bytes.length - 1,\n normed = bytes.slice(0, lastIx).concat(bytes[lastIx] & -129),\n xIsOdd = (bytes[lastIx] & 128) !== 0,\n y = utils.intFromLE(normed);\n return this.curve.pointFromY(y, xIsOdd);\n };\n EDDSA.prototype.encodeInt = function (num) {\n return num.toArray(\"le\", this.encodingLength);\n };\n EDDSA.prototype.decodeInt = function (bytes) {\n return utils.intFromLE(bytes);\n };\n EDDSA.prototype.isPoint = function (val) {\n return val instanceof this.pointClass;\n };\n },\n});\n\n// node_modules/elliptic/lib/elliptic.js\nvar require_elliptic = __commonJS({\n \"node_modules/elliptic/lib/elliptic.js\"(exports) {\n \"use strict\";\n var elliptic = exports;\n elliptic.version = require_package().version;\n elliptic.utils = require_utils3();\n elliptic.rand = require_brorand();\n elliptic.curve = require_curve();\n elliptic.curves = require_curves();\n elliptic.ec = require_ec();\n elliptic.eddsa = require_eddsa();\n },\n});\n\n// node_modules/asn1.js/node_modules/bn.js/lib/bn.js\nvar require_bn5 = __commonJS({\n \"node_modules/asn1.js/node_modules/bn.js/lib/bn.js\"(exports, module) {\n (function (module2, exports2) {\n \"use strict\";\n function assert(val, msg) {\n if (!val) throw new Error(msg || \"Assertion failed\");\n }\n function inherits(ctor, superCtor) {\n ctor.super_ = superCtor;\n var TempCtor = function () {};\n (TempCtor.prototype = superCtor.prototype),\n (ctor.prototype = new TempCtor()),\n (ctor.prototype.constructor = ctor);\n }\n function BN(number, base, endian) {\n if (BN.isBN(number)) return number;\n (this.negative = 0),\n (this.words = null),\n (this.length = 0),\n (this.red = null),\n number !== null &&\n ((base === \"le\" || base === \"be\") && ((endian = base), (base = 10)),\n this._init(number || 0, base || 10, endian || \"be\"));\n }\n typeof module2 == \"object\" ? (module2.exports = BN) : (exports2.BN = BN), (BN.BN = BN), (BN.wordSize = 26);\n var Buffer2;\n try {\n typeof window < \"u\" && typeof window.Buffer < \"u\"\n ? (Buffer2 = window.Buffer)\n : (Buffer2 = __require(\"buffer\").Buffer);\n } catch {}\n (BN.isBN = function (num) {\n return num instanceof BN\n ? !0\n : num !== null &&\n typeof num == \"object\" &&\n num.constructor.wordSize === BN.wordSize &&\n Array.isArray(num.words);\n }),\n (BN.max = function (left, right) {\n return left.cmp(right) > 0 ? left : right;\n }),\n (BN.min = function (left, right) {\n return left.cmp(right) < 0 ? left : right;\n }),\n (BN.prototype._init = function (number, base, endian) {\n if (typeof number == \"number\") return this._initNumber(number, base, endian);\n if (typeof number == \"object\") return this._initArray(number, base, endian);\n base === \"hex\" && (base = 16),\n assert(base === (base | 0) && base >= 2 && base <= 36),\n (number = number.toString().replace(/\\s+/g, \"\"));\n var start = 0;\n number[0] === \"-\" && (start++, (this.negative = 1)),\n start < number.length &&\n (base === 16\n ? this._parseHex(number, start, endian)\n : (this._parseBase(number, base, start),\n endian === \"le\" && this._initArray(this.toArray(), base, endian)));\n }),\n (BN.prototype._initNumber = function (number, base, endian) {\n number < 0 && ((this.negative = 1), (number = -number)),\n number < 67108864\n ? ((this.words = [number & 67108863]), (this.length = 1))\n : number < 4503599627370496\n ? ((this.words = [number & 67108863, (number / 67108864) & 67108863]), (this.length = 2))\n : (assert(number < 9007199254740992),\n (this.words = [number & 67108863, (number / 67108864) & 67108863, 1]),\n (this.length = 3)),\n endian === \"le\" && this._initArray(this.toArray(), base, endian);\n }),\n (BN.prototype._initArray = function (number, base, endian) {\n if ((assert(typeof number.length == \"number\"), number.length <= 0))\n return (this.words = [0]), (this.length = 1), this;\n (this.length = Math.ceil(number.length / 3)), (this.words = new Array(this.length));\n for (var i = 0; i < this.length; i++) this.words[i] = 0;\n var j,\n w,\n off = 0;\n if (endian === \"be\")\n for (i = number.length - 1, j = 0; i >= 0; i -= 3)\n (w = number[i] | (number[i - 1] << 8) | (number[i - 2] << 16)),\n (this.words[j] |= (w << off) & 67108863),\n (this.words[j + 1] = (w >>> (26 - off)) & 67108863),\n (off += 24),\n off >= 26 && ((off -= 26), j++);\n else if (endian === \"le\")\n for (i = 0, j = 0; i < number.length; i += 3)\n (w = number[i] | (number[i + 1] << 8) | (number[i + 2] << 16)),\n (this.words[j] |= (w << off) & 67108863),\n (this.words[j + 1] = (w >>> (26 - off)) & 67108863),\n (off += 24),\n off >= 26 && ((off -= 26), j++);\n return this.strip();\n });\n function parseHex4Bits(string, index) {\n var c = string.charCodeAt(index);\n return c >= 65 && c <= 70 ? c - 55 : c >= 97 && c <= 102 ? c - 87 : (c - 48) & 15;\n }\n function parseHexByte(string, lowerBound, index) {\n var r = parseHex4Bits(string, index);\n return index - 1 >= lowerBound && (r |= parseHex4Bits(string, index - 1) << 4), r;\n }\n BN.prototype._parseHex = function (number, start, endian) {\n (this.length = Math.ceil((number.length - start) / 6)), (this.words = new Array(this.length));\n for (var i = 0; i < this.length; i++) this.words[i] = 0;\n var off = 0,\n j = 0,\n w;\n if (endian === \"be\")\n for (i = number.length - 1; i >= start; i -= 2)\n (w = parseHexByte(number, start, i) << off),\n (this.words[j] |= w & 67108863),\n off >= 18 ? ((off -= 18), (j += 1), (this.words[j] |= w >>> 26)) : (off += 8);\n else {\n var parseLength = number.length - start;\n for (i = parseLength % 2 === 0 ? start + 1 : start; i < number.length; i += 2)\n (w = parseHexByte(number, start, i) << off),\n (this.words[j] |= w & 67108863),\n off >= 18 ? ((off -= 18), (j += 1), (this.words[j] |= w >>> 26)) : (off += 8);\n }\n this.strip();\n };\n function parseBase(str, start, end, mul) {\n for (var r = 0, len = Math.min(str.length, end), i = start; i < len; i++) {\n var c = str.charCodeAt(i) - 48;\n (r *= mul), c >= 49 ? (r += c - 49 + 10) : c >= 17 ? (r += c - 17 + 10) : (r += c);\n }\n return r;\n }\n (BN.prototype._parseBase = function (number, base, start) {\n (this.words = [0]), (this.length = 1);\n for (var limbLen = 0, limbPow = 1; limbPow <= 67108863; limbPow *= base) limbLen++;\n limbLen--, (limbPow = (limbPow / base) | 0);\n for (\n var total = number.length - start,\n mod = total % limbLen,\n end = Math.min(total, total - mod) + start,\n word = 0,\n i = start;\n i < end;\n i += limbLen\n )\n (word = parseBase(number, i, i + limbLen, base)),\n this.imuln(limbPow),\n this.words[0] + word < 67108864 ? (this.words[0] += word) : this._iaddn(word);\n if (mod !== 0) {\n var pow = 1;\n for (word = parseBase(number, i, number.length, base), i = 0; i < mod; i++) pow *= base;\n this.imuln(pow), this.words[0] + word < 67108864 ? (this.words[0] += word) : this._iaddn(word);\n }\n this.strip();\n }),\n (BN.prototype.copy = function (dest) {\n dest.words = new Array(this.length);\n for (var i = 0; i < this.length; i++) dest.words[i] = this.words[i];\n (dest.length = this.length), (dest.negative = this.negative), (dest.red = this.red);\n }),\n (BN.prototype.clone = function () {\n var r = new BN(null);\n return this.copy(r), r;\n }),\n (BN.prototype._expand = function (size) {\n for (; this.length < size; ) this.words[this.length++] = 0;\n return this;\n }),\n (BN.prototype.strip = function () {\n for (; this.length > 1 && this.words[this.length - 1] === 0; ) this.length--;\n return this._normSign();\n }),\n (BN.prototype._normSign = function () {\n return this.length === 1 && this.words[0] === 0 && (this.negative = 0), this;\n }),\n (BN.prototype.inspect = function () {\n return (this.red ? \"<BN-R: \" : \"<BN: \") + this.toString(16) + \">\";\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 groupSizes = [\n 0, 0, 25, 16, 12, 11, 10, 9, 8, 8, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5,\n 5, 5,\n ],\n groupBases = [\n 0, 0, 33554432, 43046721, 16777216, 48828125, 60466176, 40353607, 16777216, 43046721, 1e7, 19487171, 35831808,\n 62748517, 7529536, 11390625, 16777216, 24137569, 34012224, 47045881, 64e6, 4084101, 5153632, 6436343, 7962624,\n 9765625, 11881376, 14348907, 17210368, 20511149, 243e5, 28629151, 33554432, 39135393, 45435424, 52521875,\n 60466176,\n ];\n (BN.prototype.toString = function (base, padding) {\n (base = base || 10), (padding = padding | 0 || 1);\n var out;\n if (base === 16 || base === \"hex\") {\n out = \"\";\n for (var off = 0, carry = 0, i = 0; i < this.length; i++) {\n var w = this.words[i],\n word = (((w << off) | carry) & 16777215).toString(16);\n (carry = (w >>> (24 - off)) & 16777215),\n carry !== 0 || i !== this.length - 1 ? (out = zeros[6 - word.length] + word + out) : (out = word + out),\n (off += 2),\n off >= 26 && ((off -= 26), i--);\n }\n for (carry !== 0 && (out = carry.toString(16) + out); out.length % padding !== 0; ) out = \"0\" + out;\n return this.negative !== 0 && (out = \"-\" + out), out;\n }\n if (base === (base | 0) && base >= 2 && base <= 36) {\n var groupSize = groupSizes[base],\n groupBase = groupBases[base];\n out = \"\";\n var c = this.clone();\n for (c.negative = 0; !c.isZero(); ) {\n var r = c.modn(groupBase).toString(base);\n (c = c.idivn(groupBase)), c.isZero() ? (out = r + out) : (out = zeros[groupSize - r.length] + r + out);\n }\n for (this.isZero() && (out = \"0\" + out); out.length % padding !== 0; ) out = \"0\" + out;\n return this.negative !== 0 && (out = \"-\" + out), out;\n }\n assert(!1, \"Base should be between 2 and 36\");\n }),\n (BN.prototype.toNumber = function () {\n var ret = this.words[0];\n return (\n this.length === 2\n ? (ret += this.words[1] * 67108864)\n : this.length === 3 && this.words[2] === 1\n ? (ret += 4503599627370496 + this.words[1] * 67108864)\n : this.length > 2 && assert(!1, \"Number can only safely store up to 53 bits\"),\n this.negative !== 0 ? -ret : ret\n );\n }),\n (BN.prototype.toJSON = function () {\n return this.toString(16);\n }),\n (BN.prototype.toBuffer = function (endian, length) {\n return assert(typeof Buffer2 < \"u\"), this.toArrayLike(Buffer2, endian, length);\n }),\n (BN.prototype.toArray = function (endian, length) {\n return this.toArrayLike(Array, endian, length);\n }),\n (BN.prototype.toArrayLike = function (ArrayType, endian, length) {\n var byteLength = this.byteLength(),\n 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 this.strip();\n var littleEndian = endian === \"le\",\n res = new ArrayType(reqLength),\n b,\n i,\n q = this.clone();\n if (littleEndian) {\n for (i = 0; !q.isZero(); i++) (b = q.andln(255)), q.iushrn(8), (res[i] = b);\n for (; i < reqLength; i++) res[i] = 0;\n } else {\n for (i = 0; i < reqLength - byteLength; i++) res[i] = 0;\n for (i = 0; !q.isZero(); i++) (b = q.andln(255)), q.iushrn(8), (res[reqLength - i - 1] = b);\n }\n return res;\n }),\n Math.clz32\n ? (BN.prototype._countBits = function (w) {\n return 32 - Math.clz32(w);\n })\n : (BN.prototype._countBits = function (w) {\n var t = w,\n r = 0;\n return (\n t >= 4096 && ((r += 13), (t >>>= 13)),\n t >= 64 && ((r += 7), (t >>>= 7)),\n t >= 8 && ((r += 4), (t >>>= 4)),\n t >= 2 && ((r += 2), (t >>>= 2)),\n r + t\n );\n }),\n (BN.prototype._zeroBits = function (w) {\n if (w === 0) return 26;\n var t = w,\n r = 0;\n return (\n (t & 8191) === 0 && ((r += 13), (t >>>= 13)),\n (t & 127) === 0 && ((r += 7), (t >>>= 7)),\n (t & 15) === 0 && ((r += 4), (t >>>= 4)),\n (t & 3) === 0 && ((r += 2), (t >>>= 2)),\n (t & 1) === 0 && r++,\n r\n );\n }),\n (BN.prototype.bitLength = function () {\n var w = this.words[this.length - 1],\n hi = this._countBits(w);\n return (this.length - 1) * 26 + hi;\n });\n function toBitArray(num) {\n for (var w = new Array(num.bitLength()), bit = 0; bit < w.length; bit++) {\n var off = (bit / 26) | 0,\n wbit = bit % 26;\n w[bit] = (num.words[off] & (1 << wbit)) >>> wbit;\n }\n return w;\n }\n (BN.prototype.zeroBits = function () {\n if (this.isZero()) return 0;\n for (var r = 0, i = 0; i < this.length; i++) {\n var b = this._zeroBits(this.words[i]);\n if (((r += b), b !== 26)) break;\n }\n return r;\n }),\n (BN.prototype.byteLength = function () {\n return Math.ceil(this.bitLength() / 8);\n }),\n (BN.prototype.toTwos = function (width) {\n return this.negative !== 0 ? this.abs().inotn(width).iaddn(1) : this.clone();\n }),\n (BN.prototype.fromTwos = function (width) {\n return this.testn(width - 1) ? this.notn(width).iaddn(1).ineg() : this.clone();\n }),\n (BN.prototype.isNeg = function () {\n return this.negative !== 0;\n }),\n (BN.prototype.neg = function () {\n return this.clone().ineg();\n }),\n (BN.prototype.ineg = function () {\n return this.isZero() || (this.negative ^= 1), this;\n }),\n (BN.prototype.iuor = function (num) {\n for (; this.length < num.length; ) this.words[this.length++] = 0;\n for (var i = 0; i < num.length; i++) this.words[i] = this.words[i] | num.words[i];\n return this.strip();\n }),\n (BN.prototype.ior = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuor(num);\n }),\n (BN.prototype.or = function (num) {\n return this.length > num.length ? this.clone().ior(num) : num.clone().ior(this);\n }),\n (BN.prototype.uor = function (num) {\n return this.length > num.length ? this.clone().iuor(num) : num.clone().iuor(this);\n }),\n (BN.prototype.iuand = function (num) {\n var b;\n this.length > num.length ? (b = num) : (b = this);\n for (var i = 0; i < b.length; i++) this.words[i] = this.words[i] & num.words[i];\n return (this.length = b.length), this.strip();\n }),\n (BN.prototype.iand = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuand(num);\n }),\n (BN.prototype.and = function (num) {\n return this.length > num.length ? this.clone().iand(num) : num.clone().iand(this);\n }),\n (BN.prototype.uand = function (num) {\n return this.length > num.length ? this.clone().iuand(num) : num.clone().iuand(this);\n }),\n (BN.prototype.iuxor = function (num) {\n var a, b;\n this.length > num.length ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var i = 0; i < b.length; i++) this.words[i] = a.words[i] ^ b.words[i];\n if (this !== a) for (; i < a.length; i++) this.words[i] = a.words[i];\n return (this.length = a.length), this.strip();\n }),\n (BN.prototype.ixor = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuxor(num);\n }),\n (BN.prototype.xor = function (num) {\n return this.length > num.length ? this.clone().ixor(num) : num.clone().ixor(this);\n }),\n (BN.prototype.uxor = function (num) {\n return this.length > num.length ? this.clone().iuxor(num) : num.clone().iuxor(this);\n }),\n (BN.prototype.inotn = function (width) {\n assert(typeof width == \"number\" && width >= 0);\n var bytesNeeded = Math.ceil(width / 26) | 0,\n bitsLeft = width % 26;\n this._expand(bytesNeeded), bitsLeft > 0 && bytesNeeded--;\n for (var i = 0; i < bytesNeeded; i++) this.words[i] = ~this.words[i] & 67108863;\n return bitsLeft > 0 && (this.words[i] = ~this.words[i] & (67108863 >> (26 - bitsLeft))), this.strip();\n }),\n (BN.prototype.notn = function (width) {\n return this.clone().inotn(width);\n }),\n (BN.prototype.setn = function (bit, val) {\n assert(typeof bit == \"number\" && bit >= 0);\n var off = (bit / 26) | 0,\n wbit = bit % 26;\n return (\n this._expand(off + 1),\n val\n ? (this.words[off] = this.words[off] | (1 << wbit))\n : (this.words[off] = this.words[off] & ~(1 << wbit)),\n this.strip()\n );\n }),\n (BN.prototype.iadd = function (num) {\n var r;\n if (this.negative !== 0 && num.negative === 0)\n return (this.negative = 0), (r = this.isub(num)), (this.negative ^= 1), this._normSign();\n if (this.negative === 0 && num.negative !== 0)\n return (num.negative = 0), (r = this.isub(num)), (num.negative = 1), r._normSign();\n var a, b;\n this.length > num.length ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var carry = 0, i = 0; i < b.length; i++)\n (r = (a.words[i] | 0) + (b.words[i] | 0) + carry), (this.words[i] = r & 67108863), (carry = r >>> 26);\n for (; carry !== 0 && i < a.length; i++)\n (r = (a.words[i] | 0) + carry), (this.words[i] = r & 67108863), (carry = r >>> 26);\n if (((this.length = a.length), carry !== 0)) (this.words[this.length] = carry), this.length++;\n else if (a !== this) for (; i < a.length; i++) this.words[i] = a.words[i];\n return this;\n }),\n (BN.prototype.add = function (num) {\n var res;\n return num.negative !== 0 && this.negative === 0\n ? ((num.negative = 0), (res = this.sub(num)), (num.negative ^= 1), res)\n : num.negative === 0 && this.negative !== 0\n ? ((this.negative = 0), (res = num.sub(this)), (this.negative = 1), res)\n : this.length > num.length\n ? this.clone().iadd(num)\n : num.clone().iadd(this);\n }),\n (BN.prototype.isub = function (num) {\n if (num.negative !== 0) {\n num.negative = 0;\n var r = this.iadd(num);\n return (num.negative = 1), r._normSign();\n } else if (this.negative !== 0)\n return (this.negative = 0), this.iadd(num), (this.negative = 1), this._normSign();\n var cmp = this.cmp(num);\n if (cmp === 0) return (this.negative = 0), (this.length = 1), (this.words[0] = 0), this;\n var a, b;\n cmp > 0 ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var carry = 0, i = 0; i < b.length; i++)\n (r = (a.words[i] | 0) - (b.words[i] | 0) + carry), (carry = r >> 26), (this.words[i] = r & 67108863);\n for (; carry !== 0 && i < a.length; i++)\n (r = (a.words[i] | 0) + carry), (carry = r >> 26), (this.words[i] = r & 67108863);\n if (carry === 0 && i < a.length && a !== this) for (; i < a.length; i++) this.words[i] = a.words[i];\n return (this.length = Math.max(this.length, i)), a !== this && (this.negative = 1), this.strip();\n }),\n (BN.prototype.sub = function (num) {\n return this.clone().isub(num);\n });\n function smallMulTo(self2, num, out) {\n out.negative = num.negative ^ self2.negative;\n var len = (self2.length + num.length) | 0;\n (out.length = len), (len = (len - 1) | 0);\n var a = self2.words[0] | 0,\n b = num.words[0] | 0,\n r = a * b,\n lo = r & 67108863,\n carry = (r / 67108864) | 0;\n out.words[0] = lo;\n for (var k = 1; k < len; k++) {\n for (\n var ncarry = carry >>> 26,\n rword = carry & 67108863,\n maxJ = Math.min(k, num.length - 1),\n j = Math.max(0, k - self2.length + 1);\n j <= maxJ;\n j++\n ) {\n var i = (k - j) | 0;\n (a = self2.words[i] | 0),\n (b = num.words[j] | 0),\n (r = a * b + rword),\n (ncarry += (r / 67108864) | 0),\n (rword = r & 67108863);\n }\n (out.words[k] = rword | 0), (carry = ncarry | 0);\n }\n return carry !== 0 ? (out.words[k] = carry | 0) : out.length--, out.strip();\n }\n var comb10MulTo = function (self2, num, out) {\n var a = self2.words,\n b = num.words,\n o = out.words,\n c = 0,\n lo,\n mid,\n hi,\n a0 = a[0] | 0,\n al0 = a0 & 8191,\n ah0 = a0 >>> 13,\n a1 = a[1] | 0,\n al1 = a1 & 8191,\n ah1 = a1 >>> 13,\n a2 = a[2] | 0,\n al2 = a2 & 8191,\n ah2 = a2 >>> 13,\n a3 = a[3] | 0,\n al3 = a3 & 8191,\n ah3 = a3 >>> 13,\n a4 = a[4] | 0,\n al4 = a4 & 8191,\n ah4 = a4 >>> 13,\n a5 = a[5] | 0,\n al5 = a5 & 8191,\n ah5 = a5 >>> 13,\n a6 = a[6] | 0,\n al6 = a6 & 8191,\n ah6 = a6 >>> 13,\n a7 = a[7] | 0,\n al7 = a7 & 8191,\n ah7 = a7 >>> 13,\n a8 = a[8] | 0,\n al8 = a8 & 8191,\n ah8 = a8 >>> 13,\n a9 = a[9] | 0,\n al9 = a9 & 8191,\n ah9 = a9 >>> 13,\n b0 = b[0] | 0,\n bl0 = b0 & 8191,\n bh0 = b0 >>> 13,\n b1 = b[1] | 0,\n bl1 = b1 & 8191,\n bh1 = b1 >>> 13,\n b2 = b[2] | 0,\n bl2 = b2 & 8191,\n bh2 = b2 >>> 13,\n b3 = b[3] | 0,\n bl3 = b3 & 8191,\n bh3 = b3 >>> 13,\n b4 = b[4] | 0,\n bl4 = b4 & 8191,\n bh4 = b4 >>> 13,\n b5 = b[5] | 0,\n bl5 = b5 & 8191,\n bh5 = b5 >>> 13,\n b6 = b[6] | 0,\n bl6 = b6 & 8191,\n bh6 = b6 >>> 13,\n b7 = b[7] | 0,\n bl7 = b7 & 8191,\n bh7 = b7 >>> 13,\n b8 = b[8] | 0,\n bl8 = b8 & 8191,\n bh8 = b8 >>> 13,\n b9 = b[9] | 0,\n bl9 = b9 & 8191,\n bh9 = b9 >>> 13;\n (out.negative = self2.negative ^ num.negative),\n (out.length = 19),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w0 >>> 26)) | 0),\n (w0 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w1 >>> 26)) | 0),\n (w1 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w2 >>> 26)) | 0),\n (w2 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w3 >>> 26)) | 0),\n (w3 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w4 >>> 26)) | 0),\n (w4 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w5 >>> 26)) | 0),\n (w5 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w6 >>> 26)) | 0),\n (w6 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w7 >>> 26)) | 0),\n (w7 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w8 >>> 26)) | 0),\n (w8 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w9 >>> 26)) | 0),\n (w9 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w10 >>> 26)) | 0),\n (w10 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w11 >>> 26)) | 0),\n (w11 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w12 >>> 26)) | 0),\n (w12 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w13 >>> 26)) | 0),\n (w13 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w14 >>> 26)) | 0),\n (w14 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w15 >>> 26)) | 0),\n (w15 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w16 >>> 26)) | 0),\n (w16 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w17 >>> 26)) | 0),\n (w17 &= 67108863),\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 & 8191) << 13)) | 0;\n return (\n (c = (((hi + (mid >>> 13)) | 0) + (w18 >>> 26)) | 0),\n (w18 &= 67108863),\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 c !== 0 && ((o[19] = c), out.length++),\n out\n );\n };\n Math.imul || (comb10MulTo = smallMulTo);\n function bigMulTo(self2, num, out) {\n (out.negative = num.negative ^ self2.negative), (out.length = self2.length + num.length);\n for (var carry = 0, hncarry = 0, k = 0; k < out.length - 1; k++) {\n var ncarry = hncarry;\n hncarry = 0;\n for (\n var rword = carry & 67108863, maxJ = Math.min(k, num.length - 1), j = Math.max(0, k - self2.length + 1);\n j <= maxJ;\n j++\n ) {\n var i = k - j,\n a = self2.words[i] | 0,\n b = num.words[j] | 0,\n r = a * b,\n lo = r & 67108863;\n (ncarry = (ncarry + ((r / 67108864) | 0)) | 0),\n (lo = (lo + rword) | 0),\n (rword = lo & 67108863),\n (ncarry = (ncarry + (lo >>> 26)) | 0),\n (hncarry += ncarry >>> 26),\n (ncarry &= 67108863);\n }\n (out.words[k] = rword), (carry = ncarry), (ncarry = hncarry);\n }\n return carry !== 0 ? (out.words[k] = carry) : out.length--, out.strip();\n }\n function jumboMulTo(self2, num, out) {\n var fftm = new FFTM();\n return fftm.mulp(self2, num, out);\n }\n BN.prototype.mulTo = function (num, out) {\n var res,\n len = this.length + num.length;\n return (\n this.length === 10 && num.length === 10\n ? (res = comb10MulTo(this, num, out))\n : len < 63\n ? (res = smallMulTo(this, num, out))\n : len < 1024\n ? (res = bigMulTo(this, num, out))\n : (res = jumboMulTo(this, num, out)),\n res\n );\n };\n function FFTM(x, y) {\n (this.x = x), (this.y = y);\n }\n (FFTM.prototype.makeRBT = function (N) {\n for (var t = new Array(N), l = BN.prototype._countBits(N) - 1, i = 0; i < N; i++) t[i] = this.revBin(i, l, N);\n return t;\n }),\n (FFTM.prototype.revBin = function (x, l, N) {\n if (x === 0 || x === N - 1) return x;\n for (var rb = 0, i = 0; i < l; i++) (rb |= (x & 1) << (l - i - 1)), (x >>= 1);\n return rb;\n }),\n (FFTM.prototype.permute = function (rbt, rws, iws, rtws, itws, N) {\n for (var i = 0; i < N; i++) (rtws[i] = rws[rbt[i]]), (itws[i] = iws[rbt[i]]);\n }),\n (FFTM.prototype.transform = function (rws, iws, rtws, itws, N, rbt) {\n this.permute(rbt, rws, iws, rtws, itws, N);\n for (var s = 1; s < N; s <<= 1)\n for (\n var l = s << 1, rtwdf = Math.cos((2 * Math.PI) / l), itwdf = Math.sin((2 * Math.PI) / l), p = 0;\n p < N;\n p += l\n )\n for (var rtwdf_ = rtwdf, itwdf_ = itwdf, j = 0; j < s; j++) {\n var re = rtws[p + j],\n ie = itws[p + j],\n ro = rtws[p + j + s],\n io = itws[p + j + s],\n rx = rtwdf_ * ro - itwdf_ * io;\n (io = rtwdf_ * io + itwdf_ * ro),\n (ro = rx),\n (rtws[p + j] = re + ro),\n (itws[p + j] = ie + io),\n (rtws[p + j + s] = re - ro),\n (itws[p + j + s] = ie - io),\n j !== l &&\n ((rx = rtwdf * rtwdf_ - itwdf * itwdf_), (itwdf_ = rtwdf * itwdf_ + itwdf * rtwdf_), (rtwdf_ = rx));\n }\n }),\n (FFTM.prototype.guessLen13b = function (n, m) {\n var N = Math.max(m, n) | 1,\n odd = N & 1,\n i = 0;\n for (N = (N / 2) | 0; N; N = N >>> 1) i++;\n return 1 << (i + 1 + odd);\n }),\n (FFTM.prototype.conjugate = function (rws, iws, N) {\n if (!(N <= 1))\n for (var i = 0; i < N / 2; i++) {\n var t = rws[i];\n (rws[i] = rws[N - i - 1]),\n (rws[N - i - 1] = t),\n (t = iws[i]),\n (iws[i] = -iws[N - i - 1]),\n (iws[N - i - 1] = -t);\n }\n }),\n (FFTM.prototype.normalize13b = function (ws, N) {\n for (var carry = 0, i = 0; i < N / 2; i++) {\n var w = Math.round(ws[2 * i + 1] / N) * 8192 + Math.round(ws[2 * i] / N) + carry;\n (ws[i] = w & 67108863), w < 67108864 ? (carry = 0) : (carry = (w / 67108864) | 0);\n }\n return ws;\n }),\n (FFTM.prototype.convert13b = function (ws, len, rws, N) {\n for (var carry = 0, i = 0; i < len; i++)\n (carry = carry + (ws[i] | 0)),\n (rws[2 * i] = carry & 8191),\n (carry = carry >>> 13),\n (rws[2 * i + 1] = carry & 8191),\n (carry = carry >>> 13);\n for (i = 2 * len; i < N; ++i) rws[i] = 0;\n assert(carry === 0), assert((carry & -8192) === 0);\n }),\n (FFTM.prototype.stub = function (N) {\n for (var ph = new Array(N), i = 0; i < N; i++) ph[i] = 0;\n return ph;\n }),\n (FFTM.prototype.mulp = function (x, y, out) {\n var N = 2 * this.guessLen13b(x.length, y.length),\n rbt = this.makeRBT(N),\n _ = this.stub(N),\n rws = new Array(N),\n rwst = new Array(N),\n iwst = new Array(N),\n nrws = new Array(N),\n nrwst = new Array(N),\n niwst = new Array(N),\n rmws = out.words;\n (rmws.length = N),\n this.convert13b(x.words, x.length, rws, N),\n this.convert13b(y.words, y.length, nrws, N),\n this.transform(rws, _, rwst, iwst, N, rbt),\n this.transform(nrws, _, nrwst, niwst, N, rbt);\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]), (rwst[i] = rx);\n }\n return (\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 (out.negative = x.negative ^ y.negative),\n (out.length = x.length + y.length),\n out.strip()\n );\n }),\n (BN.prototype.mul = function (num) {\n var out = new BN(null);\n return (out.words = new Array(this.length + num.length)), this.mulTo(num, out);\n }),\n (BN.prototype.mulf = function (num) {\n var out = new BN(null);\n return (out.words = new Array(this.length + num.length)), jumboMulTo(this, num, out);\n }),\n (BN.prototype.imul = function (num) {\n return this.clone().mulTo(num, this);\n }),\n (BN.prototype.imuln = function (num) {\n assert(typeof num == \"number\"), assert(num < 67108864);\n for (var carry = 0, i = 0; i < this.length; i++) {\n var w = (this.words[i] | 0) * num,\n lo = (w & 67108863) + (carry & 67108863);\n (carry >>= 26), (carry += (w / 67108864) | 0), (carry += lo >>> 26), (this.words[i] = lo & 67108863);\n }\n return carry !== 0 && ((this.words[i] = carry), this.length++), this;\n }),\n (BN.prototype.muln = function (num) {\n return this.clone().imuln(num);\n }),\n (BN.prototype.sqr = function () {\n return this.mul(this);\n }),\n (BN.prototype.isqr = function () {\n return this.imul(this.clone());\n }),\n (BN.prototype.pow = function (num) {\n var w = toBitArray(num);\n if (w.length === 0) return new BN(1);\n for (var res = this, i = 0; i < w.length && w[i] === 0; i++, res = res.sqr());\n if (++i < w.length) for (var q = res.sqr(); i < w.length; i++, q = q.sqr()) w[i] !== 0 && (res = res.mul(q));\n return res;\n }),\n (BN.prototype.iushln = function (bits) {\n assert(typeof bits == \"number\" && bits >= 0);\n var r = bits % 26,\n s = (bits - r) / 26,\n carryMask = (67108863 >>> (26 - r)) << (26 - r),\n i;\n if (r !== 0) {\n var carry = 0;\n for (i = 0; i < this.length; i++) {\n var newCarry = this.words[i] & carryMask,\n c = ((this.words[i] | 0) - newCarry) << r;\n (this.words[i] = c | carry), (carry = newCarry >>> (26 - r));\n }\n carry && ((this.words[i] = carry), this.length++);\n }\n if (s !== 0) {\n for (i = this.length - 1; i >= 0; i--) this.words[i + s] = this.words[i];\n for (i = 0; i < s; i++) this.words[i] = 0;\n this.length += s;\n }\n return this.strip();\n }),\n (BN.prototype.ishln = function (bits) {\n return assert(this.negative === 0), this.iushln(bits);\n }),\n (BN.prototype.iushrn = function (bits, hint, extended) {\n assert(typeof bits == \"number\" && bits >= 0);\n var h;\n hint ? (h = (hint - (hint % 26)) / 26) : (h = 0);\n var r = bits % 26,\n s = Math.min((bits - r) / 26, this.length),\n mask = 67108863 ^ ((67108863 >>> r) << r),\n maskedWords = extended;\n if (((h -= s), (h = Math.max(0, h)), maskedWords)) {\n for (var i = 0; i < s; i++) maskedWords.words[i] = this.words[i];\n maskedWords.length = s;\n }\n if (s !== 0)\n if (this.length > s) for (this.length -= s, i = 0; i < this.length; i++) this.words[i] = this.words[i + s];\n else (this.words[0] = 0), (this.length = 1);\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)), (carry = word & mask);\n }\n return (\n maskedWords && carry !== 0 && (maskedWords.words[maskedWords.length++] = carry),\n this.length === 0 && ((this.words[0] = 0), (this.length = 1)),\n this.strip()\n );\n }),\n (BN.prototype.ishrn = function (bits, hint, extended) {\n return assert(this.negative === 0), this.iushrn(bits, hint, extended);\n }),\n (BN.prototype.shln = function (bits) {\n return this.clone().ishln(bits);\n }),\n (BN.prototype.ushln = function (bits) {\n return this.clone().iushln(bits);\n }),\n (BN.prototype.shrn = function (bits) {\n return this.clone().ishrn(bits);\n }),\n (BN.prototype.ushrn = function (bits) {\n return this.clone().iushrn(bits);\n }),\n (BN.prototype.testn = function (bit) {\n assert(typeof bit == \"number\" && bit >= 0);\n var r = bit % 26,\n s = (bit - r) / 26,\n q = 1 << r;\n if (this.length <= s) return !1;\n var w = this.words[s];\n return !!(w & q);\n }),\n (BN.prototype.imaskn = function (bits) {\n assert(typeof bits == \"number\" && bits >= 0);\n var r = bits % 26,\n s = (bits - r) / 26;\n if ((assert(this.negative === 0, \"imaskn works only with positive numbers\"), this.length <= s)) return this;\n if ((r !== 0 && s++, (this.length = Math.min(s, this.length)), r !== 0)) {\n var mask = 67108863 ^ ((67108863 >>> r) << r);\n this.words[this.length - 1] &= mask;\n }\n return this.strip();\n }),\n (BN.prototype.maskn = function (bits) {\n return this.clone().imaskn(bits);\n }),\n (BN.prototype.iaddn = function (num) {\n return (\n assert(typeof num == \"number\"),\n assert(num < 67108864),\n num < 0\n ? this.isubn(-num)\n : this.negative !== 0\n ? this.length === 1 && (this.words[0] | 0) < num\n ? ((this.words[0] = num - (this.words[0] | 0)), (this.negative = 0), this)\n : ((this.negative = 0), this.isubn(num), (this.negative = 1), this)\n : this._iaddn(num)\n );\n }),\n (BN.prototype._iaddn = function (num) {\n this.words[0] += num;\n for (var i = 0; i < this.length && this.words[i] >= 67108864; i++)\n (this.words[i] -= 67108864), i === this.length - 1 ? (this.words[i + 1] = 1) : this.words[i + 1]++;\n return (this.length = Math.max(this.length, i + 1)), this;\n }),\n (BN.prototype.isubn = function (num) {\n if ((assert(typeof num == \"number\"), assert(num < 67108864), num < 0)) return this.iaddn(-num);\n if (this.negative !== 0) return (this.negative = 0), this.iaddn(num), (this.negative = 1), this;\n if (((this.words[0] -= num), this.length === 1 && this.words[0] < 0))\n (this.words[0] = -this.words[0]), (this.negative = 1);\n else\n for (var i = 0; i < this.length && this.words[i] < 0; i++)\n (this.words[i] += 67108864), (this.words[i + 1] -= 1);\n return this.strip();\n }),\n (BN.prototype.addn = function (num) {\n return this.clone().iaddn(num);\n }),\n (BN.prototype.subn = function (num) {\n return this.clone().isubn(num);\n }),\n (BN.prototype.iabs = function () {\n return (this.negative = 0), this;\n }),\n (BN.prototype.abs = function () {\n return this.clone().iabs();\n }),\n (BN.prototype._ishlnsubmul = function (num, mul, shift) {\n var len = num.length + shift,\n i;\n this._expand(len);\n var w,\n 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 & 67108863),\n (carry = (w >> 26) - ((right / 67108864) | 0)),\n (this.words[i + shift] = w & 67108863);\n }\n for (; i < this.length - shift; i++)\n (w = (this.words[i + shift] | 0) + carry), (carry = w >> 26), (this.words[i + shift] = w & 67108863);\n if (carry === 0) return this.strip();\n for (assert(carry === -1), carry = 0, i = 0; i < this.length; i++)\n (w = -(this.words[i] | 0) + carry), (carry = w >> 26), (this.words[i] = w & 67108863);\n return (this.negative = 1), this.strip();\n }),\n (BN.prototype._wordDiv = function (num, mode) {\n var shift = this.length - num.length,\n a = this.clone(),\n b = num,\n bhi = b.words[b.length - 1] | 0,\n bhiBits = this._countBits(bhi);\n (shift = 26 - bhiBits),\n shift !== 0 && ((b = b.ushln(shift)), a.iushln(shift), (bhi = b.words[b.length - 1] | 0));\n var m = a.length - b.length,\n q;\n if (mode !== \"mod\") {\n (q = new BN(null)), (q.length = m + 1), (q.words = new Array(q.length));\n for (var i = 0; i < q.length; i++) q.words[i] = 0;\n }\n var diff = a.clone()._ishlnsubmul(b, 1, m);\n diff.negative === 0 && ((a = diff), q && (q.words[m] = 1));\n for (var j = m - 1; j >= 0; j--) {\n var qj = (a.words[b.length + j] | 0) * 67108864 + (a.words[b.length + j - 1] | 0);\n for (qj = Math.min((qj / bhi) | 0, 67108863), a._ishlnsubmul(b, qj, j); a.negative !== 0; )\n qj--, (a.negative = 0), a._ishlnsubmul(b, 1, j), a.isZero() || (a.negative ^= 1);\n q && (q.words[j] = qj);\n }\n return (\n q && q.strip(),\n a.strip(),\n mode !== \"div\" && shift !== 0 && a.iushrn(shift),\n {\n div: q || null,\n mod: a,\n }\n );\n }),\n (BN.prototype.divmod = function (num, mode, positive) {\n if ((assert(!num.isZero()), this.isZero()))\n return {\n div: new BN(0),\n mod: new BN(0),\n };\n var div, mod, res;\n return this.negative !== 0 && num.negative === 0\n ? ((res = this.neg().divmod(num, mode)),\n mode !== \"mod\" && (div = res.div.neg()),\n mode !== \"div\" && ((mod = res.mod.neg()), positive && mod.negative !== 0 && mod.iadd(num)),\n {\n div,\n mod,\n })\n : this.negative === 0 && num.negative !== 0\n ? ((res = this.divmod(num.neg(), mode)),\n mode !== \"mod\" && (div = res.div.neg()),\n {\n div,\n mod: res.mod,\n })\n : (this.negative & num.negative) !== 0\n ? ((res = this.neg().divmod(num.neg(), mode)),\n mode !== \"div\" && ((mod = res.mod.neg()), positive && mod.negative !== 0 && mod.isub(num)),\n {\n div: res.div,\n mod,\n })\n : num.length > this.length || this.cmp(num) < 0\n ? {\n div: new BN(0),\n mod: this,\n }\n : num.length === 1\n ? mode === \"div\"\n ? {\n div: this.divn(num.words[0]),\n mod: null,\n }\n : mode === \"mod\"\n ? {\n div: null,\n mod: new BN(this.modn(num.words[0])),\n }\n : {\n div: this.divn(num.words[0]),\n mod: new BN(this.modn(num.words[0])),\n }\n : this._wordDiv(num, mode);\n }),\n (BN.prototype.div = function (num) {\n return this.divmod(num, \"div\", !1).div;\n }),\n (BN.prototype.mod = function (num) {\n return this.divmod(num, \"mod\", !1).mod;\n }),\n (BN.prototype.umod = function (num) {\n return this.divmod(num, \"mod\", !0).mod;\n }),\n (BN.prototype.divRound = function (num) {\n var dm = this.divmod(num);\n if (dm.mod.isZero()) return dm.div;\n var mod = dm.div.negative !== 0 ? dm.mod.isub(num) : dm.mod,\n half = num.ushrn(1),\n r2 = num.andln(1),\n cmp = mod.cmp(half);\n return cmp < 0 || (r2 === 1 && cmp === 0)\n ? dm.div\n : dm.div.negative !== 0\n ? dm.div.isubn(1)\n : dm.div.iaddn(1);\n }),\n (BN.prototype.modn = function (num) {\n assert(num <= 67108863);\n for (var p = (1 << 26) % num, acc = 0, i = this.length - 1; i >= 0; i--)\n acc = (p * acc + (this.words[i] | 0)) % num;\n return acc;\n }),\n (BN.prototype.idivn = function (num) {\n assert(num <= 67108863);\n for (var carry = 0, i = this.length - 1; i >= 0; i--) {\n var w = (this.words[i] | 0) + carry * 67108864;\n (this.words[i] = (w / num) | 0), (carry = w % num);\n }\n return this.strip();\n }),\n (BN.prototype.divn = function (num) {\n return this.clone().idivn(num);\n }),\n (BN.prototype.egcd = function (p) {\n assert(p.negative === 0), assert(!p.isZero());\n var x = this,\n y = p.clone();\n x.negative !== 0 ? (x = x.umod(p)) : (x = x.clone());\n for (var A = new BN(1), B = new BN(0), C = new BN(0), D = new BN(1), g = 0; x.isEven() && y.isEven(); )\n x.iushrn(1), y.iushrn(1), ++g;\n for (var yp = y.clone(), xp = x.clone(); !x.isZero(); ) {\n for (var i = 0, im = 1; (x.words[0] & im) === 0 && i < 26; ++i, im <<= 1);\n if (i > 0)\n for (x.iushrn(i); i-- > 0; )\n (A.isOdd() || B.isOdd()) && (A.iadd(yp), B.isub(xp)), A.iushrn(1), B.iushrn(1);\n for (var j = 0, jm = 1; (y.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n if (j > 0)\n for (y.iushrn(j); j-- > 0; )\n (C.isOdd() || D.isOdd()) && (C.iadd(yp), D.isub(xp)), C.iushrn(1), D.iushrn(1);\n x.cmp(y) >= 0 ? (x.isub(y), A.isub(C), B.isub(D)) : (y.isub(x), C.isub(A), D.isub(B));\n }\n return {\n a: C,\n b: D,\n gcd: y.iushln(g),\n };\n }),\n (BN.prototype._invmp = function (p) {\n assert(p.negative === 0), assert(!p.isZero());\n var a = this,\n b = p.clone();\n a.negative !== 0 ? (a = a.umod(p)) : (a = a.clone());\n for (var x1 = new BN(1), x2 = new BN(0), delta = b.clone(); 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) for (a.iushrn(i); i-- > 0; ) x1.isOdd() && x1.iadd(delta), x1.iushrn(1);\n for (var j = 0, jm = 1; (b.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n if (j > 0) for (b.iushrn(j); j-- > 0; ) x2.isOdd() && x2.iadd(delta), x2.iushrn(1);\n a.cmp(b) >= 0 ? (a.isub(b), x1.isub(x2)) : (b.isub(a), x2.isub(x1));\n }\n var res;\n return a.cmpn(1) === 0 ? (res = x1) : (res = x2), res.cmpn(0) < 0 && res.iadd(p), res;\n }),\n (BN.prototype.gcd = function (num) {\n if (this.isZero()) return num.abs();\n if (num.isZero()) return this.abs();\n var a = this.clone(),\n b = num.clone();\n (a.negative = 0), (b.negative = 0);\n for (var shift = 0; a.isEven() && b.isEven(); shift++) a.iushrn(1), b.iushrn(1);\n do {\n for (; a.isEven(); ) a.iushrn(1);\n for (; b.isEven(); ) b.iushrn(1);\n var r = a.cmp(b);\n if (r < 0) {\n var t = a;\n (a = b), (b = t);\n } else if (r === 0 || b.cmpn(1) === 0) break;\n a.isub(b);\n } while (!0);\n return b.iushln(shift);\n }),\n (BN.prototype.invm = function (num) {\n return this.egcd(num).a.umod(num);\n }),\n (BN.prototype.isEven = function () {\n return (this.words[0] & 1) === 0;\n }),\n (BN.prototype.isOdd = function () {\n return (this.words[0] & 1) === 1;\n }),\n (BN.prototype.andln = function (num) {\n return this.words[0] & num;\n }),\n (BN.prototype.bincn = function (bit) {\n assert(typeof bit == \"number\");\n var r = bit % 26,\n s = (bit - r) / 26,\n q = 1 << r;\n if (this.length <= s) return this._expand(s + 1), (this.words[s] |= q), this;\n for (var carry = q, i = s; carry !== 0 && i < this.length; i++) {\n var w = this.words[i] | 0;\n (w += carry), (carry = w >>> 26), (w &= 67108863), (this.words[i] = w);\n }\n return carry !== 0 && ((this.words[i] = carry), this.length++), this;\n }),\n (BN.prototype.isZero = function () {\n return this.length === 1 && this.words[0] === 0;\n }),\n (BN.prototype.cmpn = function (num) {\n var negative = num < 0;\n if (this.negative !== 0 && !negative) return -1;\n if (this.negative === 0 && negative) return 1;\n this.strip();\n var res;\n if (this.length > 1) res = 1;\n else {\n negative && (num = -num), assert(num <= 67108863, \"Number is too big\");\n var w = this.words[0] | 0;\n res = w === num ? 0 : w < num ? -1 : 1;\n }\n return this.negative !== 0 ? -res | 0 : res;\n }),\n (BN.prototype.cmp = function (num) {\n if (this.negative !== 0 && num.negative === 0) return -1;\n if (this.negative === 0 && num.negative !== 0) return 1;\n var res = this.ucmp(num);\n return this.negative !== 0 ? -res | 0 : res;\n }),\n (BN.prototype.ucmp = function (num) {\n if (this.length > num.length) return 1;\n if (this.length < num.length) return -1;\n for (var res = 0, i = this.length - 1; i >= 0; i--) {\n var a = this.words[i] | 0,\n b = num.words[i] | 0;\n if (a !== b) {\n a < b ? (res = -1) : a > b && (res = 1);\n break;\n }\n }\n return res;\n }),\n (BN.prototype.gtn = function (num) {\n return this.cmpn(num) === 1;\n }),\n (BN.prototype.gt = function (num) {\n return this.cmp(num) === 1;\n }),\n (BN.prototype.gten = function (num) {\n return this.cmpn(num) >= 0;\n }),\n (BN.prototype.gte = function (num) {\n return this.cmp(num) >= 0;\n }),\n (BN.prototype.ltn = function (num) {\n return this.cmpn(num) === -1;\n }),\n (BN.prototype.lt = function (num) {\n return this.cmp(num) === -1;\n }),\n (BN.prototype.lten = function (num) {\n return this.cmpn(num) <= 0;\n }),\n (BN.prototype.lte = function (num) {\n return this.cmp(num) <= 0;\n }),\n (BN.prototype.eqn = function (num) {\n return this.cmpn(num) === 0;\n }),\n (BN.prototype.eq = function (num) {\n return this.cmp(num) === 0;\n }),\n (BN.red = function (num) {\n return new Red(num);\n }),\n (BN.prototype.toRed = function (ctx) {\n return (\n assert(!this.red, \"Already a number in reduction context\"),\n assert(this.negative === 0, \"red works only with positives\"),\n ctx.convertTo(this)._forceRed(ctx)\n );\n }),\n (BN.prototype.fromRed = function () {\n return assert(this.red, \"fromRed works only with numbers in reduction context\"), this.red.convertFrom(this);\n }),\n (BN.prototype._forceRed = function (ctx) {\n return (this.red = ctx), this;\n }),\n (BN.prototype.forceRed = function (ctx) {\n return assert(!this.red, \"Already a number in reduction context\"), this._forceRed(ctx);\n }),\n (BN.prototype.redAdd = function (num) {\n return assert(this.red, \"redAdd works only with red numbers\"), this.red.add(this, num);\n }),\n (BN.prototype.redIAdd = function (num) {\n return assert(this.red, \"redIAdd works only with red numbers\"), this.red.iadd(this, num);\n }),\n (BN.prototype.redSub = function (num) {\n return assert(this.red, \"redSub works only with red numbers\"), this.red.sub(this, num);\n }),\n (BN.prototype.redISub = function (num) {\n return assert(this.red, \"redISub works only with red numbers\"), this.red.isub(this, num);\n }),\n (BN.prototype.redShl = function (num) {\n return assert(this.red, \"redShl works only with red numbers\"), this.red.shl(this, num);\n }),\n (BN.prototype.redMul = function (num) {\n return (\n assert(this.red, \"redMul works only with red numbers\"),\n this.red._verify2(this, num),\n this.red.mul(this, num)\n );\n }),\n (BN.prototype.redIMul = function (num) {\n return (\n assert(this.red, \"redMul works only with red numbers\"),\n this.red._verify2(this, num),\n this.red.imul(this, num)\n );\n }),\n (BN.prototype.redSqr = function () {\n return assert(this.red, \"redSqr works only with red numbers\"), this.red._verify1(this), this.red.sqr(this);\n }),\n (BN.prototype.redISqr = function () {\n return assert(this.red, \"redISqr works only with red numbers\"), this.red._verify1(this), this.red.isqr(this);\n }),\n (BN.prototype.redSqrt = function () {\n return assert(this.red, \"redSqrt works only with red numbers\"), this.red._verify1(this), this.red.sqrt(this);\n }),\n (BN.prototype.redInvm = function () {\n return assert(this.red, \"redInvm works only with red numbers\"), this.red._verify1(this), this.red.invm(this);\n }),\n (BN.prototype.redNeg = function () {\n return assert(this.red, \"redNeg works only with red numbers\"), this.red._verify1(this), this.red.neg(this);\n }),\n (BN.prototype.redPow = function (num) {\n return assert(this.red && !num.red, \"redPow(normalNum)\"), this.red._verify1(this), this.red.pow(this, num);\n });\n var primes = {\n k256: null,\n p224: null,\n p192: null,\n p25519: null,\n };\n function MPrime(name, p) {\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 (this.tmp = this._tmp());\n }\n (MPrime.prototype._tmp = function () {\n var tmp = new BN(null);\n return (tmp.words = new Array(Math.ceil(this.n / 13))), tmp;\n }),\n (MPrime.prototype.ireduce = function (num) {\n var r = num,\n rlen;\n do this.split(r, this.tmp), (r = this.imulK(r)), (r = r.iadd(this.tmp)), (rlen = r.bitLength());\n while (rlen > this.n);\n var cmp = rlen < this.n ? -1 : r.ucmp(this.p);\n return (\n cmp === 0\n ? ((r.words[0] = 0), (r.length = 1))\n : cmp > 0\n ? r.isub(this.p)\n : r.strip !== void 0\n ? r.strip()\n : r._strip(),\n r\n );\n }),\n (MPrime.prototype.split = function (input, out) {\n input.iushrn(this.n, 0, out);\n }),\n (MPrime.prototype.imulK = function (num) {\n return num.imul(this.k);\n });\n function K256() {\n MPrime.call(this, \"k256\", \"ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f\");\n }\n inherits(K256, MPrime),\n (K256.prototype.split = function (input, output) {\n for (var mask = 4194303, outLen = Math.min(input.length, 9), i = 0; i < outLen; i++)\n output.words[i] = input.words[i];\n if (((output.length = outLen), input.length <= 9)) {\n (input.words[0] = 0), (input.length = 1);\n return;\n }\n var prev = input.words[9];\n for (output.words[output.length++] = prev & mask, i = 10; i < input.length; i++) {\n var next = input.words[i] | 0;\n (input.words[i - 10] = ((next & mask) << 4) | (prev >>> 22)), (prev = next);\n }\n (prev >>>= 22),\n (input.words[i - 10] = prev),\n prev === 0 && input.length > 10 ? (input.length -= 10) : (input.length -= 9);\n }),\n (K256.prototype.imulK = function (num) {\n (num.words[num.length] = 0), (num.words[num.length + 1] = 0), (num.length += 2);\n for (var lo = 0, i = 0; i < num.length; i++) {\n var w = num.words[i] | 0;\n (lo += w * 977), (num.words[i] = lo & 67108863), (lo = w * 64 + ((lo / 67108864) | 0));\n }\n return (\n num.words[num.length - 1] === 0 && (num.length--, num.words[num.length - 1] === 0 && num.length--), num\n );\n });\n function P224() {\n MPrime.call(this, \"p224\", \"ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001\");\n }\n inherits(P224, MPrime);\n function P192() {\n MPrime.call(this, \"p192\", \"ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff\");\n }\n inherits(P192, MPrime);\n function P25519() {\n MPrime.call(this, \"25519\", \"7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed\");\n }\n inherits(P25519, MPrime),\n (P25519.prototype.imulK = function (num) {\n for (var carry = 0, i = 0; i < num.length; i++) {\n var hi = (num.words[i] | 0) * 19 + carry,\n lo = hi & 67108863;\n (hi >>>= 26), (num.words[i] = lo), (carry = hi);\n }\n return carry !== 0 && (num.words[num.length++] = carry), num;\n }),\n (BN._prime = function (name) {\n if (primes[name]) return primes[name];\n var prime2;\n if (name === \"k256\") prime2 = new K256();\n else if (name === \"p224\") prime2 = new P224();\n else if (name === \"p192\") prime2 = new P192();\n else if (name === \"p25519\") prime2 = new P25519();\n else throw new Error(\"Unknown prime \" + name);\n return (primes[name] = prime2), prime2;\n });\n function Red(m) {\n if (typeof m == \"string\") {\n var prime = BN._prime(m);\n (this.m = prime.p), (this.prime = prime);\n } else assert(m.gtn(1), \"modulus must be greater than 1\"), (this.m = m), (this.prime = null);\n }\n (Red.prototype._verify1 = function (a) {\n assert(a.negative === 0, \"red works only with positives\"), assert(a.red, \"red works only with red numbers\");\n }),\n (Red.prototype._verify2 = function (a, b) {\n assert((a.negative | b.negative) === 0, \"red works only with positives\"),\n assert(a.red && a.red === b.red, \"red works only with red numbers\");\n }),\n (Red.prototype.imod = function (a) {\n return this.prime ? this.prime.ireduce(a)._forceRed(this) : a.umod(this.m)._forceRed(this);\n }),\n (Red.prototype.neg = function (a) {\n return a.isZero() ? a.clone() : this.m.sub(a)._forceRed(this);\n }),\n (Red.prototype.add = function (a, b) {\n this._verify2(a, b);\n var res = a.add(b);\n return res.cmp(this.m) >= 0 && res.isub(this.m), res._forceRed(this);\n }),\n (Red.prototype.iadd = function (a, b) {\n this._verify2(a, b);\n var res = a.iadd(b);\n return res.cmp(this.m) >= 0 && res.isub(this.m), res;\n }),\n (Red.prototype.sub = function (a, b) {\n this._verify2(a, b);\n var res = a.sub(b);\n return res.cmpn(0) < 0 && res.iadd(this.m), res._forceRed(this);\n }),\n (Red.prototype.isub = function (a, b) {\n this._verify2(a, b);\n var res = a.isub(b);\n return res.cmpn(0) < 0 && res.iadd(this.m), res;\n }),\n (Red.prototype.shl = function (a, num) {\n return this._verify1(a), this.imod(a.ushln(num));\n }),\n (Red.prototype.imul = function (a, b) {\n return this._verify2(a, b), this.imod(a.imul(b));\n }),\n (Red.prototype.mul = function (a, b) {\n return this._verify2(a, b), this.imod(a.mul(b));\n }),\n (Red.prototype.isqr = function (a) {\n return this.imul(a, a.clone());\n }),\n (Red.prototype.sqr = function (a) {\n return this.mul(a, a);\n }),\n (Red.prototype.sqrt = function (a) {\n if (a.isZero()) return a.clone();\n var mod3 = this.m.andln(3);\n if ((assert(mod3 % 2 === 1), mod3 === 3)) {\n var pow = this.m.add(new BN(1)).iushrn(2);\n return this.pow(a, pow);\n }\n for (var q = this.m.subn(1), s = 0; !q.isZero() && q.andln(1) === 0; ) s++, q.iushrn(1);\n assert(!q.isZero());\n var one = new BN(1).toRed(this),\n nOne = one.redNeg(),\n lpow = this.m.subn(1).iushrn(1),\n z = this.m.bitLength();\n for (z = new BN(2 * z * z).toRed(this); this.pow(z, lpow).cmp(nOne) !== 0; ) z.redIAdd(nOne);\n for (\n var c = this.pow(z, q), r = this.pow(a, q.addn(1).iushrn(1)), t = this.pow(a, q), m = s;\n t.cmp(one) !== 0;\n\n ) {\n for (var tmp = t, i = 0; tmp.cmp(one) !== 0; i++) tmp = tmp.redSqr();\n assert(i < m);\n var b = this.pow(c, new BN(1).iushln(m - i - 1));\n (r = r.redMul(b)), (c = b.redSqr()), (t = t.redMul(c)), (m = i);\n }\n return r;\n }),\n (Red.prototype.invm = function (a) {\n var inv = a._invmp(this.m);\n return inv.negative !== 0 ? ((inv.negative = 0), this.imod(inv).redNeg()) : this.imod(inv);\n }),\n (Red.prototype.pow = function (a, num) {\n if (num.isZero()) return new BN(1).toRed(this);\n if (num.cmpn(1) === 0) return a.clone();\n var windowSize = 4,\n wnd = new Array(1 << windowSize);\n (wnd[0] = new BN(1).toRed(this)), (wnd[1] = a);\n for (var i = 2; i < wnd.length; i++) wnd[i] = this.mul(wnd[i - 1], a);\n var res = wnd[0],\n current = 0,\n currentLen = 0,\n start = num.bitLength() % 26;\n for (start === 0 && (start = 26), i = num.length - 1; i >= 0; i--) {\n for (var word = num.words[i], j = start - 1; j >= 0; j--) {\n var bit = (word >> j) & 1;\n if ((res !== wnd[0] && (res = this.sqr(res)), bit === 0 && current === 0)) {\n currentLen = 0;\n continue;\n }\n (current <<= 1),\n (current |= bit),\n currentLen++,\n !(currentLen !== windowSize && (i !== 0 || j !== 0)) &&\n ((res = this.mul(res, wnd[current])), (currentLen = 0), (current = 0));\n }\n start = 26;\n }\n return res;\n }),\n (Red.prototype.convertTo = function (num) {\n var r = num.umod(this.m);\n return r === num ? r.clone() : r;\n }),\n (Red.prototype.convertFrom = function (num) {\n var res = num.clone();\n return (res.red = null), res;\n }),\n (BN.mont = function (num) {\n return new Mont(num);\n });\n function Mont(m) {\n Red.call(this, m),\n (this.shift = this.m.bitLength()),\n this.shift % 26 !== 0 && (this.shift += 26 - (this.shift % 26)),\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 (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 (Mont.prototype.convertTo = function (num) {\n return this.imod(num.ushln(this.shift));\n }),\n (Mont.prototype.convertFrom = function (num) {\n var r = this.imod(num.mul(this.rinv));\n return (r.red = null), r;\n }),\n (Mont.prototype.imul = function (a, b) {\n if (a.isZero() || b.isZero()) return (a.words[0] = 0), (a.length = 1), a;\n var t = a.imul(b),\n c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m),\n u = t.isub(c).iushrn(this.shift),\n res = u;\n return (\n u.cmp(this.m) >= 0 ? (res = u.isub(this.m)) : u.cmpn(0) < 0 && (res = u.iadd(this.m)), res._forceRed(this)\n );\n }),\n (Mont.prototype.mul = function (a, b) {\n if (a.isZero() || b.isZero()) return new BN(0)._forceRed(this);\n var t = a.mul(b),\n c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m),\n u = t.isub(c).iushrn(this.shift),\n res = u;\n return (\n u.cmp(this.m) >= 0 ? (res = u.isub(this.m)) : u.cmpn(0) < 0 && (res = u.iadd(this.m)), res._forceRed(this)\n );\n }),\n (Mont.prototype.invm = function (a) {\n var res = this.imod(a._invmp(this.m).mul(this.r2));\n return res._forceRed(this);\n });\n })(typeof module > \"u\" || module, exports);\n },\n});\n\n// node_modules/safer-buffer/safer.js\nvar require_safer = __commonJS({\n \"node_modules/safer-buffer/safer.js\"(exports, module) {\n \"use strict\";\n var buffer = __require(\"buffer\"),\n Buffer2 = buffer.Buffer,\n safer = {},\n key;\n for (key in buffer)\n !buffer.hasOwnProperty(key) || key === \"SlowBuffer\" || key === \"Buffer\" || (safer[key] = buffer[key]);\n var Safer = (safer.Buffer = {});\n for (key in Buffer2)\n !Buffer2.hasOwnProperty(key) || key === \"allocUnsafe\" || key === \"allocUnsafeSlow\" || (Safer[key] = Buffer2[key]);\n safer.Buffer.prototype = Buffer2.prototype;\n (!Safer.from || Safer.from === Uint8Array.from) &&\n (Safer.from = function (value, encodingOrOffset, length) {\n if (typeof value == \"number\")\n throw new TypeError('The \"value\" argument must not be of type number. Received type ' + typeof value);\n if (value && typeof value.length > \"u\")\n throw new TypeError(\n \"The first argument must be one of type string, Buffer, ArrayBuffer, Array, or Array-like Object. Received type \" +\n typeof value,\n );\n return Buffer2(value, encodingOrOffset, length);\n });\n Safer.alloc ||\n (Safer.alloc = function (size, fill, encoding) {\n if (typeof size != \"number\")\n throw new TypeError('The \"size\" argument must be of type number. Received type ' + typeof size);\n if (size < 0 || size >= 2 * (1 << 30))\n throw new RangeError('The value \"' + size + '\" is invalid for option \"size\"');\n var buf = Buffer2(size);\n return (\n !fill || fill.length === 0\n ? buf.fill(0)\n : typeof encoding == \"string\"\n ? buf.fill(fill, encoding)\n : buf.fill(fill),\n buf\n );\n });\n if (!safer.kStringMaxLength)\n try {\n safer.kStringMaxLength = MAX_STRING_LENGTH;\n } catch {}\n safer.constants ||\n ((safer.constants = {\n MAX_LENGTH: safer.kMaxLength,\n }),\n safer.kStringMaxLength && (safer.constants.MAX_STRING_LENGTH = safer.kStringMaxLength));\n module.exports = safer;\n },\n});\n\n// node_modules/asn1.js/lib/asn1/base/reporter.js\nvar require_reporter = __commonJS({\n \"node_modules/asn1.js/lib/asn1/base/reporter.js\"(exports) {\n \"use strict\";\n var inherits = require_inherits_browser();\n function Reporter(options) {\n this._reporterState = {\n obj: null,\n path: [],\n options: options || {},\n errors: [],\n };\n }\n exports.Reporter = Reporter;\n Reporter.prototype.isError = function (obj) {\n return obj instanceof ReporterError;\n };\n Reporter.prototype.save = function () {\n let state = this._reporterState;\n return { obj: state.obj, pathLen: state.path.length };\n };\n Reporter.prototype.restore = function (data) {\n let state = this._reporterState;\n (state.obj = data.obj), (state.path = state.path.slice(0, data.pathLen));\n };\n Reporter.prototype.enterKey = function (key) {\n return this._reporterState.path.push(key);\n };\n Reporter.prototype.exitKey = function (index) {\n let state = this._reporterState;\n state.path = state.path.slice(0, index - 1);\n };\n Reporter.prototype.leaveKey = function (index, key, value) {\n let state = this._reporterState;\n this.exitKey(index), state.obj !== null && (state.obj[key] = value);\n };\n Reporter.prototype.path = function () {\n return this._reporterState.path.join(\"/\");\n };\n Reporter.prototype.enterObject = function () {\n let state = this._reporterState,\n prev = state.obj;\n return (state.obj = {}), prev;\n };\n Reporter.prototype.leaveObject = function (prev) {\n let state = this._reporterState,\n now = state.obj;\n return (state.obj = prev), now;\n };\n Reporter.prototype.error = function (msg) {\n let err,\n state = this._reporterState,\n inherited = msg instanceof ReporterError;\n if (\n (inherited\n ? (err = msg)\n : (err = new ReporterError(\n state.path\n .map(function (elem) {\n return \"[\" + JSON.stringify(elem) + \"]\";\n })\n .join(\"\"),\n msg.message || msg,\n msg.stack,\n )),\n !state.options.partial)\n )\n throw err;\n return inherited || state.errors.push(err), err;\n };\n Reporter.prototype.wrapResult = function (result) {\n let state = this._reporterState;\n return state.options.partial\n ? {\n result: this.isError(result) ? null : result,\n errors: state.errors,\n }\n : result;\n };\n function ReporterError(path, msg) {\n (this.path = path), this.rethrow(msg);\n }\n inherits(ReporterError, Error);\n ReporterError.prototype.rethrow = function (msg) {\n if (\n ((this.message = msg + \" at: \" + (this.path || \"(shallow)\")),\n Error.captureStackTrace && Error.captureStackTrace(this, ReporterError),\n !this.stack)\n )\n try {\n throw new Error(this.message);\n } catch (e) {\n this.stack = e.stack;\n }\n return this;\n };\n },\n});\n\n// node_modules/asn1.js/lib/asn1/base/buffer.js\nvar require_buffer = __commonJS({\n \"node_modules/asn1.js/lib/asn1/base/buffer.js\"(exports) {\n \"use strict\";\n var inherits = require_inherits_browser(),\n Reporter = require_reporter().Reporter,\n Buffer2 = require_safer().Buffer;\n function DecoderBuffer(base, options) {\n if ((Reporter.call(this, options), !Buffer2.isBuffer(base))) {\n this.error(\"Input not Buffer\");\n return;\n }\n (this.base = base), (this.offset = 0), (this.length = base.length);\n }\n inherits(DecoderBuffer, Reporter);\n exports.DecoderBuffer = DecoderBuffer;\n DecoderBuffer.isDecoderBuffer = function (data) {\n return data instanceof DecoderBuffer\n ? !0\n : typeof data == \"object\" &&\n Buffer2.isBuffer(data.base) &&\n data.constructor.name === \"DecoderBuffer\" &&\n typeof data.offset == \"number\" &&\n typeof data.length == \"number\" &&\n typeof data.save == \"function\" &&\n typeof data.restore == \"function\" &&\n typeof data.isEmpty == \"function\" &&\n typeof data.readUInt8 == \"function\" &&\n typeof data.skip == \"function\" &&\n typeof data.raw == \"function\";\n };\n DecoderBuffer.prototype.save = function () {\n return {\n offset: this.offset,\n reporter: Reporter.prototype.save.call(this),\n };\n };\n DecoderBuffer.prototype.restore = function (save) {\n let res = new DecoderBuffer(this.base);\n return (\n (res.offset = save.offset),\n (res.length = this.offset),\n (this.offset = save.offset),\n Reporter.prototype.restore.call(this, save.reporter),\n res\n );\n };\n DecoderBuffer.prototype.isEmpty = function () {\n return this.offset === this.length;\n };\n DecoderBuffer.prototype.readUInt8 = function (fail) {\n return this.offset + 1 <= this.length\n ? this.base.readUInt8(this.offset++, !0)\n : this.error(fail || \"DecoderBuffer overrun\");\n };\n DecoderBuffer.prototype.skip = function (bytes, fail) {\n if (!(this.offset + bytes <= this.length)) return this.error(fail || \"DecoderBuffer overrun\");\n let res = new DecoderBuffer(this.base);\n return (\n (res._reporterState = this._reporterState),\n (res.offset = this.offset),\n (res.length = this.offset + bytes),\n (this.offset += bytes),\n res\n );\n };\n DecoderBuffer.prototype.raw = function (save) {\n return this.base.slice(save ? save.offset : this.offset, this.length);\n };\n function EncoderBuffer(value, reporter) {\n if (Array.isArray(value))\n (this.length = 0),\n (this.value = value.map(function (item) {\n return (\n EncoderBuffer.isEncoderBuffer(item) || (item = new EncoderBuffer(item, reporter)),\n (this.length += item.length),\n item\n );\n }, this));\n else if (typeof value == \"number\") {\n if (!(0 <= value && value <= 255)) return reporter.error(\"non-byte EncoderBuffer value\");\n (this.value = value), (this.length = 1);\n } else if (typeof value == \"string\") (this.value = value), (this.length = Buffer2.byteLength(value));\n else if (Buffer2.isBuffer(value)) (this.value = value), (this.length = value.length);\n else return reporter.error(\"Unsupported type: \" + typeof value);\n }\n exports.EncoderBuffer = EncoderBuffer;\n EncoderBuffer.isEncoderBuffer = function (data) {\n return data instanceof EncoderBuffer\n ? !0\n : typeof data == \"object\" &&\n data.constructor.name === \"EncoderBuffer\" &&\n typeof data.length == \"number\" &&\n typeof data.join == \"function\";\n };\n EncoderBuffer.prototype.join = function (out, offset) {\n return (\n out || (out = Buffer2.alloc(this.length)),\n offset || (offset = 0),\n this.length === 0 ||\n (Array.isArray(this.value)\n ? this.value.forEach(function (item) {\n item.join(out, offset), (offset += item.length);\n })\n : (typeof this.value == \"number\"\n ? (out[offset] = this.value)\n : typeof this.value == \"string\"\n ? out.write(this.value, offset)\n : Buffer2.isBuffer(this.value) && this.value.copy(out, offset),\n (offset += this.length))),\n out\n );\n };\n },\n});\n\n// node_modules/asn1.js/lib/asn1/base/node.js\nvar require_node = __commonJS({\n \"node_modules/asn1.js/lib/asn1/base/node.js\"(exports, module) {\n \"use strict\";\n var Reporter = require_reporter().Reporter,\n EncoderBuffer = require_buffer().EncoderBuffer,\n DecoderBuffer = require_buffer().DecoderBuffer,\n assert = require_minimalistic_assert(),\n tags = [\n \"seq\",\n \"seqof\",\n \"set\",\n \"setof\",\n \"objid\",\n \"bool\",\n \"gentime\",\n \"utctime\",\n \"null_\",\n \"enum\",\n \"int\",\n \"objDesc\",\n \"bitstr\",\n \"bmpstr\",\n \"charstr\",\n \"genstr\",\n \"graphstr\",\n \"ia5str\",\n \"iso646str\",\n \"numstr\",\n \"octstr\",\n \"printstr\",\n \"t61str\",\n \"unistr\",\n \"utf8str\",\n \"videostr\",\n ],\n methods = [\"key\", \"obj\", \"use\", \"optional\", \"explicit\", \"implicit\", \"def\", \"choice\", \"any\", \"contains\"].concat(\n tags,\n ),\n overrided = [\n \"_peekTag\",\n \"_decodeTag\",\n \"_use\",\n \"_decodeStr\",\n \"_decodeObjid\",\n \"_decodeTime\",\n \"_decodeNull\",\n \"_decodeInt\",\n \"_decodeBool\",\n \"_decodeList\",\n \"_encodeComposite\",\n \"_encodeStr\",\n \"_encodeObjid\",\n \"_encodeTime\",\n \"_encodeNull\",\n \"_encodeInt\",\n \"_encodeBool\",\n ];\n function Node(enc, parent, name) {\n let state = {};\n (this._baseState = state),\n (state.name = name),\n (state.enc = enc),\n (state.parent = parent || null),\n (state.children = null),\n (state.tag = null),\n (state.args = null),\n (state.reverseArgs = null),\n (state.choice = null),\n (state.optional = !1),\n (state.any = !1),\n (state.obj = !1),\n (state.use = null),\n (state.useDecoder = null),\n (state.key = null),\n (state.default = null),\n (state.explicit = null),\n (state.implicit = null),\n (state.contains = null),\n state.parent || ((state.children = []), this._wrap());\n }\n module.exports = Node;\n var stateProps = [\n \"enc\",\n \"parent\",\n \"children\",\n \"tag\",\n \"args\",\n \"reverseArgs\",\n \"choice\",\n \"optional\",\n \"any\",\n \"obj\",\n \"use\",\n \"alteredUse\",\n \"key\",\n \"default\",\n \"explicit\",\n \"implicit\",\n \"contains\",\n ];\n Node.prototype.clone = function () {\n let state = this._baseState,\n cstate = {};\n stateProps.forEach(function (prop) {\n cstate[prop] = state[prop];\n });\n let res = new this.constructor(cstate.parent);\n return (res._baseState = cstate), res;\n };\n Node.prototype._wrap = function () {\n let state = this._baseState;\n methods.forEach(function (method) {\n this[method] = function () {\n let clone = new this.constructor(this);\n return state.children.push(clone), clone[method].apply(clone, arguments);\n };\n }, this);\n };\n Node.prototype._init = function (body) {\n let state = this._baseState;\n assert(state.parent === null),\n body.call(this),\n (state.children = state.children.filter(function (child) {\n return child._baseState.parent === this;\n }, this)),\n assert.equal(state.children.length, 1, \"Root node can have only one child\");\n };\n Node.prototype._useArgs = function (args) {\n let state = this._baseState,\n children = args.filter(function (arg) {\n return arg instanceof this.constructor;\n }, this);\n (args = args.filter(function (arg) {\n return !(arg instanceof this.constructor);\n }, this)),\n children.length !== 0 &&\n (assert(state.children === null),\n (state.children = children),\n children.forEach(function (child) {\n child._baseState.parent = this;\n }, this)),\n args.length !== 0 &&\n (assert(state.args === null),\n (state.args = args),\n (state.reverseArgs = args.map(function (arg) {\n if (typeof arg != \"object\" || arg.constructor !== Object) return arg;\n let res = {};\n return (\n Object.keys(arg).forEach(function (key) {\n key == (key | 0) && (key |= 0);\n let value = arg[key];\n res[value] = key;\n }),\n res\n );\n })));\n };\n overrided.forEach(function (method) {\n Node.prototype[method] = function () {\n let state = this._baseState;\n throw new Error(method + \" not implemented for encoding: \" + state.enc);\n };\n });\n tags.forEach(function (tag) {\n Node.prototype[tag] = function () {\n let state = this._baseState,\n args = Array.prototype.slice.call(arguments);\n return assert(state.tag === null), (state.tag = tag), this._useArgs(args), this;\n };\n });\n Node.prototype.use = function (item) {\n assert(item);\n let state = this._baseState;\n return assert(state.use === null), (state.use = item), this;\n };\n Node.prototype.optional = function () {\n let state = this._baseState;\n return (state.optional = !0), this;\n };\n Node.prototype.def = function (val) {\n let state = this._baseState;\n return assert(state.default === null), (state.default = val), (state.optional = !0), this;\n };\n Node.prototype.explicit = function (num) {\n let state = this._baseState;\n return assert(state.explicit === null && state.implicit === null), (state.explicit = num), this;\n };\n Node.prototype.implicit = function (num) {\n let state = this._baseState;\n return assert(state.explicit === null && state.implicit === null), (state.implicit = num), this;\n };\n Node.prototype.obj = function () {\n let state = this._baseState,\n args = Array.prototype.slice.call(arguments);\n return (state.obj = !0), args.length !== 0 && this._useArgs(args), this;\n };\n Node.prototype.key = function (newKey) {\n let state = this._baseState;\n return assert(state.key === null), (state.key = newKey), this;\n };\n Node.prototype.any = function () {\n let state = this._baseState;\n return (state.any = !0), this;\n };\n Node.prototype.choice = function (obj) {\n let state = this._baseState;\n return (\n assert(state.choice === null),\n (state.choice = obj),\n this._useArgs(\n Object.keys(obj).map(function (key) {\n return obj[key];\n }),\n ),\n this\n );\n };\n Node.prototype.contains = function (item) {\n let state = this._baseState;\n return assert(state.use === null), (state.contains = item), this;\n };\n Node.prototype._decode = function (input, options) {\n let state = this._baseState;\n if (state.parent === null) return input.wrapResult(state.children[0]._decode(input, options));\n let result = state.default,\n present = !0,\n prevKey = null;\n if ((state.key !== null && (prevKey = input.enterKey(state.key)), state.optional)) {\n let tag = null;\n if (\n (state.explicit !== null\n ? (tag = state.explicit)\n : state.implicit !== null\n ? (tag = state.implicit)\n : state.tag !== null && (tag = state.tag),\n tag === null && !state.any)\n ) {\n let save = input.save();\n try {\n state.choice === null ? this._decodeGeneric(state.tag, input, options) : this._decodeChoice(input, options),\n (present = !0);\n } catch {\n present = !1;\n }\n input.restore(save);\n } else if (((present = this._peekTag(input, tag, state.any)), input.isError(present))) return present;\n }\n let prevObj;\n if ((state.obj && present && (prevObj = input.enterObject()), present)) {\n if (state.explicit !== null) {\n let explicit = this._decodeTag(input, state.explicit);\n if (input.isError(explicit)) return explicit;\n input = explicit;\n }\n let start = input.offset;\n if (state.use === null && state.choice === null) {\n let save;\n state.any && (save = input.save());\n let body = this._decodeTag(input, state.implicit !== null ? state.implicit : state.tag, state.any);\n if (input.isError(body)) return body;\n state.any ? (result = input.raw(save)) : (input = body);\n }\n if (\n (options && options.track && state.tag !== null && options.track(input.path(), start, input.length, \"tagged\"),\n options &&\n options.track &&\n state.tag !== null &&\n options.track(input.path(), input.offset, input.length, \"content\"),\n state.any ||\n (state.choice === null\n ? (result = this._decodeGeneric(state.tag, input, options))\n : (result = this._decodeChoice(input, options))),\n input.isError(result))\n )\n return result;\n if (\n (!state.any &&\n state.choice === null &&\n state.children !== null &&\n state.children.forEach(function (child) {\n child._decode(input, options);\n }),\n state.contains && (state.tag === \"octstr\" || state.tag === \"bitstr\"))\n ) {\n let data = new DecoderBuffer(result);\n result = this._getUse(state.contains, input._reporterState.obj)._decode(data, options);\n }\n }\n return (\n state.obj && present && (result = input.leaveObject(prevObj)),\n state.key !== null && (result !== null || present === !0)\n ? input.leaveKey(prevKey, state.key, result)\n : prevKey !== null && input.exitKey(prevKey),\n result\n );\n };\n Node.prototype._decodeGeneric = function (tag, input, options) {\n let state = this._baseState;\n return tag === \"seq\" || tag === \"set\"\n ? null\n : tag === \"seqof\" || tag === \"setof\"\n ? this._decodeList(input, tag, state.args[0], options)\n : /str$/.test(tag)\n ? this._decodeStr(input, tag, options)\n : tag === \"objid\" && state.args\n ? this._decodeObjid(input, state.args[0], state.args[1], options)\n : tag === \"objid\"\n ? this._decodeObjid(input, null, null, options)\n : tag === \"gentime\" || tag === \"utctime\"\n ? this._decodeTime(input, tag, options)\n : tag === \"null_\"\n ? this._decodeNull(input, options)\n : tag === \"bool\"\n ? this._decodeBool(input, options)\n : tag === \"objDesc\"\n ? this._decodeStr(input, tag, options)\n : tag === \"int\" || tag === \"enum\"\n ? this._decodeInt(input, state.args && state.args[0], options)\n : state.use !== null\n ? this._getUse(state.use, input._reporterState.obj)._decode(input, options)\n : input.error(\"unknown tag: \" + tag);\n };\n Node.prototype._getUse = function (entity, obj) {\n let state = this._baseState;\n return (\n (state.useDecoder = this._use(entity, obj)),\n assert(state.useDecoder._baseState.parent === null),\n (state.useDecoder = state.useDecoder._baseState.children[0]),\n state.implicit !== state.useDecoder._baseState.implicit &&\n ((state.useDecoder = state.useDecoder.clone()), (state.useDecoder._baseState.implicit = state.implicit)),\n state.useDecoder\n );\n };\n Node.prototype._decodeChoice = function (input, options) {\n let state = this._baseState,\n result = null,\n match = !1;\n return (\n Object.keys(state.choice).some(function (key) {\n let save = input.save(),\n node = state.choice[key];\n try {\n let value = node._decode(input, options);\n if (input.isError(value)) return !1;\n (result = { type: key, value }), (match = !0);\n } catch {\n return input.restore(save), !1;\n }\n return !0;\n }, this),\n match ? result : input.error(\"Choice not matched\")\n );\n };\n Node.prototype._createEncoderBuffer = function (data) {\n return new EncoderBuffer(data, this.reporter);\n };\n Node.prototype._encode = function (data, reporter, parent) {\n let state = this._baseState;\n if (state.default !== null && state.default === data) return;\n let result = this._encodeValue(data, reporter, parent);\n if (result !== void 0 && !this._skipDefault(result, reporter, parent)) return result;\n };\n Node.prototype._encodeValue = function (data, reporter, parent) {\n let state = this._baseState;\n if (state.parent === null) return state.children[0]._encode(data, reporter || new Reporter());\n let result = null;\n if (((this.reporter = reporter), state.optional && data === void 0))\n if (state.default !== null) data = state.default;\n else return;\n let content = null,\n primitive = !1;\n if (state.any) result = this._createEncoderBuffer(data);\n else if (state.choice) result = this._encodeChoice(data, reporter);\n else if (state.contains)\n (content = this._getUse(state.contains, parent)._encode(data, reporter)), (primitive = !0);\n else if (state.children)\n (content = state.children\n .map(function (child) {\n if (child._baseState.tag === \"null_\") return child._encode(null, reporter, data);\n if (child._baseState.key === null) return reporter.error(\"Child should have a key\");\n let prevKey = reporter.enterKey(child._baseState.key);\n if (typeof data != \"object\") return reporter.error(\"Child expected, but input is not object\");\n let res = child._encode(data[child._baseState.key], reporter, data);\n return reporter.leaveKey(prevKey), res;\n }, this)\n .filter(function (child) {\n return child;\n })),\n (content = this._createEncoderBuffer(content));\n else if (state.tag === \"seqof\" || state.tag === \"setof\") {\n if (!(state.args && state.args.length === 1)) return reporter.error(\"Too many args for : \" + state.tag);\n if (!Array.isArray(data)) return reporter.error(\"seqof/setof, but data is not Array\");\n let child = this.clone();\n (child._baseState.implicit = null),\n (content = this._createEncoderBuffer(\n data.map(function (item) {\n let state2 = this._baseState;\n return this._getUse(state2.args[0], data)._encode(item, reporter);\n }, child),\n ));\n } else\n state.use !== null\n ? (result = this._getUse(state.use, parent)._encode(data, reporter))\n : ((content = this._encodePrimitive(state.tag, data)), (primitive = !0));\n if (!state.any && state.choice === null) {\n let tag = state.implicit !== null ? state.implicit : state.tag,\n cls = state.implicit === null ? \"universal\" : \"context\";\n tag === null\n ? state.use === null && reporter.error(\"Tag could be omitted only for .use()\")\n : state.use === null && (result = this._encodeComposite(tag, primitive, cls, content));\n }\n return state.explicit !== null && (result = this._encodeComposite(state.explicit, !1, \"context\", result)), result;\n };\n Node.prototype._encodeChoice = function (data, reporter) {\n let state = this._baseState,\n node = state.choice[data.type];\n return (\n node || assert(!1, data.type + \" not found in \" + JSON.stringify(Object.keys(state.choice))),\n node._encode(data.value, reporter)\n );\n };\n Node.prototype._encodePrimitive = function (tag, data) {\n let state = this._baseState;\n if (/str$/.test(tag)) return this._encodeStr(data, tag);\n if (tag === \"objid\" && state.args) return this._encodeObjid(data, state.reverseArgs[0], state.args[1]);\n if (tag === \"objid\") return this._encodeObjid(data, null, null);\n if (tag === \"gentime\" || tag === \"utctime\") return this._encodeTime(data, tag);\n if (tag === \"null_\") return this._encodeNull();\n if (tag === \"int\" || tag === \"enum\") return this._encodeInt(data, state.args && state.reverseArgs[0]);\n if (tag === \"bool\") return this._encodeBool(data);\n if (tag === \"objDesc\") return this._encodeStr(data, tag);\n throw new Error(\"Unsupported tag: \" + tag);\n };\n Node.prototype._isNumstr = function (str) {\n return /^[0-9 ]*$/.test(str);\n };\n Node.prototype._isPrintstr = function (str) {\n return /^[A-Za-z0-9 '()+,-./:=?]*$/.test(str);\n };\n },\n});\n\n// node_modules/asn1.js/lib/asn1/constants/der.js\nvar require_der = __commonJS({\n \"node_modules/asn1.js/lib/asn1/constants/der.js\"(exports) {\n \"use strict\";\n function reverse(map) {\n let res = {};\n return (\n Object.keys(map).forEach(function (key) {\n (key | 0) == key && (key = key | 0);\n let value = map[key];\n res[value] = key;\n }),\n res\n );\n }\n exports.tagClass = {\n 0: \"universal\",\n 1: \"application\",\n 2: \"context\",\n 3: \"private\",\n };\n exports.tagClassByName = reverse(exports.tagClass);\n exports.tag = {\n 0: \"end\",\n 1: \"bool\",\n 2: \"int\",\n 3: \"bitstr\",\n 4: \"octstr\",\n 5: \"null_\",\n 6: \"objid\",\n 7: \"objDesc\",\n 8: \"external\",\n 9: \"real\",\n 10: \"enum\",\n 11: \"embed\",\n 12: \"utf8str\",\n 13: \"relativeOid\",\n 16: \"seq\",\n 17: \"set\",\n 18: \"numstr\",\n 19: \"printstr\",\n 20: \"t61str\",\n 21: \"videostr\",\n 22: \"ia5str\",\n 23: \"utctime\",\n 24: \"gentime\",\n 25: \"graphstr\",\n 26: \"iso646str\",\n 27: \"genstr\",\n 28: \"unistr\",\n 29: \"charstr\",\n 30: \"bmpstr\",\n };\n exports.tagByName = reverse(exports.tag);\n },\n});\n\n// node_modules/asn1.js/lib/asn1/encoders/der.js\nvar require_der2 = __commonJS({\n \"node_modules/asn1.js/lib/asn1/encoders/der.js\"(exports, module) {\n \"use strict\";\n var inherits = require_inherits_browser(),\n Buffer2 = require_safer().Buffer,\n Node = require_node(),\n der = require_der();\n function DEREncoder(entity) {\n (this.enc = \"der\"),\n (this.name = entity.name),\n (this.entity = entity),\n (this.tree = new DERNode()),\n this.tree._init(entity.body);\n }\n module.exports = DEREncoder;\n DEREncoder.prototype.encode = function (data, reporter) {\n return this.tree._encode(data, reporter).join();\n };\n function DERNode(parent) {\n Node.call(this, \"der\", parent);\n }\n inherits(DERNode, Node);\n DERNode.prototype._encodeComposite = function (tag, primitive, cls, content) {\n let encodedTag = encodeTag(tag, primitive, cls, this.reporter);\n if (content.length < 128) {\n let header2 = Buffer2.alloc(2);\n return (header2[0] = encodedTag), (header2[1] = content.length), this._createEncoderBuffer([header2, content]);\n }\n let lenOctets = 1;\n for (let i = content.length; i >= 256; i >>= 8) lenOctets++;\n let header = Buffer2.alloc(1 + 1 + lenOctets);\n (header[0] = encodedTag), (header[1] = 128 | lenOctets);\n for (let i = 1 + lenOctets, j = content.length; j > 0; i--, j >>= 8) header[i] = j & 255;\n return this._createEncoderBuffer([header, content]);\n };\n DERNode.prototype._encodeStr = function (str, tag) {\n if (tag === \"bitstr\") return this._createEncoderBuffer([str.unused | 0, str.data]);\n if (tag === \"bmpstr\") {\n let buf = Buffer2.alloc(str.length * 2);\n for (let i = 0; i < str.length; i++) buf.writeUInt16BE(str.charCodeAt(i), i * 2);\n return this._createEncoderBuffer(buf);\n } else\n return tag === \"numstr\"\n ? this._isNumstr(str)\n ? this._createEncoderBuffer(str)\n : this.reporter.error(\"Encoding of string type: numstr supports only digits and space\")\n : tag === \"printstr\"\n ? this._isPrintstr(str)\n ? this._createEncoderBuffer(str)\n : this.reporter.error(\n \"Encoding of string type: printstr supports only latin upper and lower case letters, digits, space, apostrophe, left and rigth parenthesis, plus sign, comma, hyphen, dot, slash, colon, equal sign, question mark\",\n )\n : /str$/.test(tag)\n ? this._createEncoderBuffer(str)\n : tag === \"objDesc\"\n ? this._createEncoderBuffer(str)\n : this.reporter.error(\"Encoding of string type: \" + tag + \" unsupported\");\n };\n DERNode.prototype._encodeObjid = function (id, values, relative) {\n if (typeof id == \"string\") {\n if (!values) return this.reporter.error(\"string objid given, but no values map found\");\n if (!values.hasOwnProperty(id)) return this.reporter.error(\"objid not found in values map\");\n id = values[id].split(/[\\s.]+/g);\n for (let i = 0; i < id.length; i++) id[i] |= 0;\n } else if (Array.isArray(id)) {\n id = id.slice();\n for (let i = 0; i < id.length; i++) id[i] |= 0;\n }\n if (!Array.isArray(id))\n return this.reporter.error(\"objid() should be either array or string, got: \" + JSON.stringify(id));\n if (!relative) {\n if (id[1] >= 40) return this.reporter.error(\"Second objid identifier OOB\");\n id.splice(0, 2, id[0] * 40 + id[1]);\n }\n let size = 0;\n for (let i = 0; i < id.length; i++) {\n let ident = id[i];\n for (size++; ident >= 128; ident >>= 7) size++;\n }\n let objid = Buffer2.alloc(size),\n offset = objid.length - 1;\n for (let i = id.length - 1; i >= 0; i--) {\n let ident = id[i];\n for (objid[offset--] = ident & 127; (ident >>= 7) > 0; ) objid[offset--] = 128 | (ident & 127);\n }\n return this._createEncoderBuffer(objid);\n };\n function two(num) {\n return num < 10 ? \"0\" + num : num;\n }\n DERNode.prototype._encodeTime = function (time, tag) {\n let str,\n date = new Date(time);\n return (\n tag === \"gentime\"\n ? (str = [\n two(date.getUTCFullYear()),\n two(date.getUTCMonth() + 1),\n two(date.getUTCDate()),\n two(date.getUTCHours()),\n two(date.getUTCMinutes()),\n two(date.getUTCSeconds()),\n \"Z\",\n ].join(\"\"))\n : tag === \"utctime\"\n ? (str = [\n two(date.getUTCFullYear() % 100),\n two(date.getUTCMonth() + 1),\n two(date.getUTCDate()),\n two(date.getUTCHours()),\n two(date.getUTCMinutes()),\n two(date.getUTCSeconds()),\n \"Z\",\n ].join(\"\"))\n : this.reporter.error(\"Encoding \" + tag + \" time is not supported yet\"),\n this._encodeStr(str, \"octstr\")\n );\n };\n DERNode.prototype._encodeNull = function () {\n return this._createEncoderBuffer(\"\");\n };\n DERNode.prototype._encodeInt = function (num, values) {\n if (typeof num == \"string\") {\n if (!values) return this.reporter.error(\"String int or enum given, but no values map\");\n if (!values.hasOwnProperty(num))\n return this.reporter.error(\"Values map doesn't contain: \" + JSON.stringify(num));\n num = values[num];\n }\n if (typeof num != \"number\" && !Buffer2.isBuffer(num)) {\n let numArray = num.toArray();\n !num.sign && numArray[0] & 128 && numArray.unshift(0), (num = Buffer2.from(numArray));\n }\n if (Buffer2.isBuffer(num)) {\n let size2 = num.length;\n num.length === 0 && size2++;\n let out2 = Buffer2.alloc(size2);\n return num.copy(out2), num.length === 0 && (out2[0] = 0), this._createEncoderBuffer(out2);\n }\n if (num < 128) return this._createEncoderBuffer(num);\n if (num < 256) return this._createEncoderBuffer([0, num]);\n let size = 1;\n for (let i = num; i >= 256; i >>= 8) size++;\n let out = new Array(size);\n for (let i = out.length - 1; i >= 0; i--) (out[i] = num & 255), (num >>= 8);\n return out[0] & 128 && out.unshift(0), this._createEncoderBuffer(Buffer2.from(out));\n };\n DERNode.prototype._encodeBool = function (value) {\n return this._createEncoderBuffer(value ? 255 : 0);\n };\n DERNode.prototype._use = function (entity, obj) {\n return typeof entity == \"function\" && (entity = entity(obj)), entity._getEncoder(\"der\").tree;\n };\n DERNode.prototype._skipDefault = function (dataBuffer, reporter, parent) {\n let state = this._baseState,\n i;\n if (state.default === null) return !1;\n let data = dataBuffer.join();\n if (\n (state.defaultBuffer === void 0 &&\n (state.defaultBuffer = this._encodeValue(state.default, reporter, parent).join()),\n data.length !== state.defaultBuffer.length)\n )\n return !1;\n for (i = 0; i < data.length; i++) if (data[i] !== state.defaultBuffer[i]) return !1;\n return !0;\n };\n function encodeTag(tag, primitive, cls, reporter) {\n let res;\n if ((tag === \"seqof\" ? (tag = \"seq\") : tag === \"setof\" && (tag = \"set\"), der.tagByName.hasOwnProperty(tag)))\n res = der.tagByName[tag];\n else if (typeof tag == \"number\" && (tag | 0) === tag) res = tag;\n else return reporter.error(\"Unknown tag: \" + tag);\n return res >= 31\n ? reporter.error(\"Multi-octet tag encoding unsupported\")\n : (primitive || (res |= 32), (res |= der.tagClassByName[cls || \"universal\"] << 6), res);\n }\n },\n});\n\n// node_modules/asn1.js/lib/asn1/encoders/pem.js\nvar require_pem = __commonJS({\n \"node_modules/asn1.js/lib/asn1/encoders/pem.js\"(exports, module) {\n \"use strict\";\n var inherits = require_inherits_browser(),\n DEREncoder = require_der2();\n function PEMEncoder(entity) {\n DEREncoder.call(this, entity), (this.enc = \"pem\");\n }\n inherits(PEMEncoder, DEREncoder);\n module.exports = PEMEncoder;\n PEMEncoder.prototype.encode = function (data, options) {\n let p = DEREncoder.prototype.encode.call(this, data).toString(\"base64\"),\n out = [\"-----BEGIN \" + options.label + \"-----\"];\n for (let i = 0; i < p.length; i += 64) out.push(p.slice(i, i + 64));\n return (\n out.push(\"-----END \" + options.label + \"-----\"),\n out.join(`\n`)\n );\n };\n },\n});\n\n// node_modules/asn1.js/lib/asn1/encoders/index.js\nvar require_encoders = __commonJS({\n \"node_modules/asn1.js/lib/asn1/encoders/index.js\"(exports) {\n \"use strict\";\n var encoders = exports;\n encoders.der = require_der2();\n encoders.pem = require_pem();\n },\n});\n\n// node_modules/asn1.js/lib/asn1/decoders/der.js\nvar require_der3 = __commonJS({\n \"node_modules/asn1.js/lib/asn1/decoders/der.js\"(exports, module) {\n \"use strict\";\n var inherits = require_inherits_browser(),\n bignum = require_bn5(),\n DecoderBuffer = require_buffer().DecoderBuffer,\n Node = require_node(),\n der = require_der();\n function DERDecoder(entity) {\n (this.enc = \"der\"),\n (this.name = entity.name),\n (this.entity = entity),\n (this.tree = new DERNode()),\n this.tree._init(entity.body);\n }\n module.exports = DERDecoder;\n DERDecoder.prototype.decode = function (data, options) {\n return (\n DecoderBuffer.isDecoderBuffer(data) || (data = new DecoderBuffer(data, options)),\n this.tree._decode(data, options)\n );\n };\n function DERNode(parent) {\n Node.call(this, \"der\", parent);\n }\n inherits(DERNode, Node);\n DERNode.prototype._peekTag = function (buffer, tag, any) {\n if (buffer.isEmpty()) return !1;\n let state = buffer.save(),\n decodedTag = derDecodeTag(buffer, 'Failed to peek tag: \"' + tag + '\"');\n return buffer.isError(decodedTag)\n ? decodedTag\n : (buffer.restore(state),\n decodedTag.tag === tag || decodedTag.tagStr === tag || decodedTag.tagStr + \"of\" === tag || any);\n };\n DERNode.prototype._decodeTag = function (buffer, tag, any) {\n let decodedTag = derDecodeTag(buffer, 'Failed to decode tag of \"' + tag + '\"');\n if (buffer.isError(decodedTag)) return decodedTag;\n let len = derDecodeLen(buffer, decodedTag.primitive, 'Failed to get length of \"' + tag + '\"');\n if (buffer.isError(len)) return len;\n if (!any && decodedTag.tag !== tag && decodedTag.tagStr !== tag && decodedTag.tagStr + \"of\" !== tag)\n return buffer.error('Failed to match tag: \"' + tag + '\"');\n if (decodedTag.primitive || len !== null) return buffer.skip(len, 'Failed to match body of: \"' + tag + '\"');\n let state = buffer.save(),\n res = this._skipUntilEnd(buffer, 'Failed to skip indefinite length body: \"' + this.tag + '\"');\n return buffer.isError(res)\n ? res\n : ((len = buffer.offset - state.offset),\n buffer.restore(state),\n buffer.skip(len, 'Failed to match body of: \"' + tag + '\"'));\n };\n DERNode.prototype._skipUntilEnd = function (buffer, fail) {\n for (;;) {\n let tag = derDecodeTag(buffer, fail);\n if (buffer.isError(tag)) return tag;\n let len = derDecodeLen(buffer, tag.primitive, fail);\n if (buffer.isError(len)) return len;\n let res;\n if (\n (tag.primitive || len !== null ? (res = buffer.skip(len)) : (res = this._skipUntilEnd(buffer, fail)),\n buffer.isError(res))\n )\n return res;\n if (tag.tagStr === \"end\") break;\n }\n };\n DERNode.prototype._decodeList = function (buffer, tag, decoder, options) {\n let result = [];\n for (; !buffer.isEmpty(); ) {\n let possibleEnd = this._peekTag(buffer, \"end\");\n if (buffer.isError(possibleEnd)) return possibleEnd;\n let res = decoder.decode(buffer, \"der\", options);\n if (buffer.isError(res) && possibleEnd) break;\n result.push(res);\n }\n return result;\n };\n DERNode.prototype._decodeStr = function (buffer, tag) {\n if (tag === \"bitstr\") {\n let unused = buffer.readUInt8();\n return buffer.isError(unused) ? unused : { unused, data: buffer.raw() };\n } else if (tag === \"bmpstr\") {\n let raw = buffer.raw();\n if (raw.length % 2 === 1) return buffer.error(\"Decoding of string type: bmpstr length mismatch\");\n let str = \"\";\n for (let i = 0; i < raw.length / 2; i++) str += String.fromCharCode(raw.readUInt16BE(i * 2));\n return str;\n } else if (tag === \"numstr\") {\n let numstr = buffer.raw().toString(\"ascii\");\n return this._isNumstr(numstr) ? numstr : buffer.error(\"Decoding of string type: numstr unsupported characters\");\n } else {\n if (tag === \"octstr\") return buffer.raw();\n if (tag === \"objDesc\") return buffer.raw();\n if (tag === \"printstr\") {\n let printstr = buffer.raw().toString(\"ascii\");\n return this._isPrintstr(printstr)\n ? printstr\n : buffer.error(\"Decoding of string type: printstr unsupported characters\");\n } else\n return /str$/.test(tag)\n ? buffer.raw().toString()\n : buffer.error(\"Decoding of string type: \" + tag + \" unsupported\");\n }\n };\n DERNode.prototype._decodeObjid = function (buffer, values, relative) {\n let result,\n identifiers = [],\n ident = 0,\n subident = 0;\n for (; !buffer.isEmpty(); )\n (subident = buffer.readUInt8()),\n (ident <<= 7),\n (ident |= subident & 127),\n (subident & 128) === 0 && (identifiers.push(ident), (ident = 0));\n subident & 128 && identifiers.push(ident);\n let first = (identifiers[0] / 40) | 0,\n second = identifiers[0] % 40;\n if ((relative ? (result = identifiers) : (result = [first, second].concat(identifiers.slice(1))), values)) {\n let tmp = values[result.join(\" \")];\n tmp === void 0 && (tmp = values[result.join(\".\")]), tmp !== void 0 && (result = tmp);\n }\n return result;\n };\n DERNode.prototype._decodeTime = function (buffer, tag) {\n let str = buffer.raw().toString(),\n year,\n mon,\n day,\n hour,\n min,\n sec;\n if (tag === \"gentime\")\n (year = str.slice(0, 4) | 0),\n (mon = str.slice(4, 6) | 0),\n (day = str.slice(6, 8) | 0),\n (hour = str.slice(8, 10) | 0),\n (min = str.slice(10, 12) | 0),\n (sec = str.slice(12, 14) | 0);\n else if (tag === \"utctime\")\n (year = str.slice(0, 2) | 0),\n (mon = str.slice(2, 4) | 0),\n (day = str.slice(4, 6) | 0),\n (hour = str.slice(6, 8) | 0),\n (min = str.slice(8, 10) | 0),\n (sec = str.slice(10, 12) | 0),\n year < 70 ? (year = 2e3 + year) : (year = 1900 + year);\n else return buffer.error(\"Decoding \" + tag + \" time is not supported yet\");\n return Date.UTC(year, mon - 1, day, hour, min, sec, 0);\n };\n DERNode.prototype._decodeNull = function () {\n return null;\n };\n DERNode.prototype._decodeBool = function (buffer) {\n let res = buffer.readUInt8();\n return buffer.isError(res) ? res : res !== 0;\n };\n DERNode.prototype._decodeInt = function (buffer, values) {\n let raw = buffer.raw(),\n res = new bignum(raw);\n return values && (res = values[res.toString(10)] || res), res;\n };\n DERNode.prototype._use = function (entity, obj) {\n return typeof entity == \"function\" && (entity = entity(obj)), entity._getDecoder(\"der\").tree;\n };\n function derDecodeTag(buf, fail) {\n let tag = buf.readUInt8(fail);\n if (buf.isError(tag)) return tag;\n let cls = der.tagClass[tag >> 6],\n primitive = (tag & 32) === 0;\n if ((tag & 31) === 31) {\n let oct = tag;\n for (tag = 0; (oct & 128) === 128; ) {\n if (((oct = buf.readUInt8(fail)), buf.isError(oct))) return oct;\n (tag <<= 7), (tag |= oct & 127);\n }\n } else tag &= 31;\n let tagStr = der.tag[tag];\n return {\n cls,\n primitive,\n tag,\n tagStr,\n };\n }\n function derDecodeLen(buf, primitive, fail) {\n let len = buf.readUInt8(fail);\n if (buf.isError(len)) return len;\n if (!primitive && len === 128) return null;\n if ((len & 128) === 0) return len;\n let num = len & 127;\n if (num > 4) return buf.error(\"length octect is too long\");\n len = 0;\n for (let i = 0; i < num; i++) {\n len <<= 8;\n let j = buf.readUInt8(fail);\n if (buf.isError(j)) return j;\n len |= j;\n }\n return len;\n }\n },\n});\n\n// node_modules/asn1.js/lib/asn1/decoders/pem.js\nvar require_pem2 = __commonJS({\n \"node_modules/asn1.js/lib/asn1/decoders/pem.js\"(exports, module) {\n \"use strict\";\n var inherits = require_inherits_browser(),\n Buffer2 = require_safer().Buffer,\n DERDecoder = require_der3();\n function PEMDecoder(entity) {\n DERDecoder.call(this, entity), (this.enc = \"pem\");\n }\n inherits(PEMDecoder, DERDecoder);\n module.exports = PEMDecoder;\n PEMDecoder.prototype.decode = function (data, options) {\n let lines = data.toString().split(/[\\r\\n]+/g),\n label = options.label.toUpperCase(),\n re = /^-----(BEGIN|END) ([^-]+)-----$/,\n start = -1,\n end = -1;\n for (let i = 0; i < lines.length; i++) {\n let match = lines[i].match(re);\n if (match !== null && match[2] === label)\n if (start === -1) {\n if (match[1] !== \"BEGIN\") break;\n start = i;\n } else {\n if (match[1] !== \"END\") break;\n end = i;\n break;\n }\n }\n if (start === -1 || end === -1) throw new Error(\"PEM section not found for: \" + label);\n let base64 = lines.slice(start + 1, end).join(\"\");\n base64.replace(/[^a-z0-9+/=]+/gi, \"\");\n let input = Buffer2.from(base64, \"base64\");\n return DERDecoder.prototype.decode.call(this, input, options);\n };\n },\n});\n\n// node_modules/asn1.js/lib/asn1/decoders/index.js\nvar require_decoders = __commonJS({\n \"node_modules/asn1.js/lib/asn1/decoders/index.js\"(exports) {\n \"use strict\";\n var decoders = exports;\n decoders.der = require_der3();\n decoders.pem = require_pem2();\n },\n});\n\n// node_modules/asn1.js/lib/asn1/api.js\nvar require_api = __commonJS({\n \"node_modules/asn1.js/lib/asn1/api.js\"(exports) {\n \"use strict\";\n var encoders = require_encoders(),\n decoders = require_decoders(),\n inherits = require_inherits_browser(),\n api = exports;\n api.define = function (name, body) {\n return new Entity(name, body);\n };\n function Entity(name, body) {\n (this.name = name), (this.body = body), (this.decoders = {}), (this.encoders = {});\n }\n Entity.prototype._createNamed = function (Base) {\n let name = this.name;\n function Generated(entity) {\n this._initNamed(entity, name);\n }\n return (\n inherits(Generated, Base),\n (Generated.prototype._initNamed = function (entity, name2) {\n Base.call(this, entity, name2);\n }),\n new Generated(this)\n );\n };\n Entity.prototype._getDecoder = function (enc) {\n return (\n (enc = enc || \"der\"),\n this.decoders.hasOwnProperty(enc) || (this.decoders[enc] = this._createNamed(decoders[enc])),\n this.decoders[enc]\n );\n };\n Entity.prototype.decode = function (data, enc, options) {\n return this._getDecoder(enc).decode(data, options);\n };\n Entity.prototype._getEncoder = function (enc) {\n return (\n (enc = enc || \"der\"),\n this.encoders.hasOwnProperty(enc) || (this.encoders[enc] = this._createNamed(encoders[enc])),\n this.encoders[enc]\n );\n };\n Entity.prototype.encode = function (data, enc, reporter) {\n return this._getEncoder(enc).encode(data, reporter);\n };\n },\n});\n\n// node_modules/asn1.js/lib/asn1/base/index.js\nvar require_base2 = __commonJS({\n \"node_modules/asn1.js/lib/asn1/base/index.js\"(exports) {\n \"use strict\";\n var base = exports;\n base.Reporter = require_reporter().Reporter;\n base.DecoderBuffer = require_buffer().DecoderBuffer;\n base.EncoderBuffer = require_buffer().EncoderBuffer;\n base.Node = require_node();\n },\n});\n\n// node_modules/asn1.js/lib/asn1/constants/index.js\nvar require_constants = __commonJS({\n \"node_modules/asn1.js/lib/asn1/constants/index.js\"(exports) {\n \"use strict\";\n var constants = exports;\n constants._reverse = function (map) {\n let res = {};\n return (\n Object.keys(map).forEach(function (key) {\n (key | 0) == key && (key = key | 0);\n let value = map[key];\n res[value] = key;\n }),\n res\n );\n };\n constants.der = require_der();\n },\n});\n\n// node_modules/asn1.js/lib/asn1.js\nvar require_asn1 = __commonJS({\n \"node_modules/asn1.js/lib/asn1.js\"(exports) {\n \"use strict\";\n var asn1 = exports;\n asn1.bignum = require_bn5();\n asn1.define = require_api().define;\n asn1.base = require_base2();\n asn1.constants = require_constants();\n asn1.decoders = require_decoders();\n asn1.encoders = require_encoders();\n },\n});\n\n// node_modules/parse-asn1/certificate.js\nvar require_certificate = __commonJS({\n \"node_modules/parse-asn1/certificate.js\"(exports, module) {\n \"use strict\";\n var asn = require_asn1(),\n Time = asn.define(\"Time\", function () {\n this.choice({\n utcTime: this.utctime(),\n generalTime: this.gentime(),\n });\n }),\n AttributeTypeValue = asn.define(\"AttributeTypeValue\", function () {\n this.seq().obj(this.key(\"type\").objid(), this.key(\"value\").any());\n }),\n AlgorithmIdentifier = asn.define(\"AlgorithmIdentifier\", function () {\n this.seq().obj(\n this.key(\"algorithm\").objid(),\n this.key(\"parameters\").optional(),\n this.key(\"curve\").objid().optional(),\n );\n }),\n SubjectPublicKeyInfo = asn.define(\"SubjectPublicKeyInfo\", function () {\n this.seq().obj(this.key(\"algorithm\").use(AlgorithmIdentifier), this.key(\"subjectPublicKey\").bitstr());\n }),\n RelativeDistinguishedName = asn.define(\"RelativeDistinguishedName\", function () {\n this.setof(AttributeTypeValue);\n }),\n RDNSequence = asn.define(\"RDNSequence\", function () {\n this.seqof(RelativeDistinguishedName);\n }),\n Name = asn.define(\"Name\", function () {\n this.choice({\n rdnSequence: this.use(RDNSequence),\n });\n }),\n Validity = asn.define(\"Validity\", function () {\n this.seq().obj(this.key(\"notBefore\").use(Time), this.key(\"notAfter\").use(Time));\n }),\n Extension = asn.define(\"Extension\", function () {\n this.seq().obj(this.key(\"extnID\").objid(), this.key(\"critical\").bool().def(!1), this.key(\"extnValue\").octstr());\n }),\n TBSCertificate = asn.define(\"TBSCertificate\", function () {\n this.seq().obj(\n this.key(\"version\").explicit(0).int().optional(),\n this.key(\"serialNumber\").int(),\n this.key(\"signature\").use(AlgorithmIdentifier),\n this.key(\"issuer\").use(Name),\n this.key(\"validity\").use(Validity),\n this.key(\"subject\").use(Name),\n this.key(\"subjectPublicKeyInfo\").use(SubjectPublicKeyInfo),\n this.key(\"issuerUniqueID\").implicit(1).bitstr().optional(),\n this.key(\"subjectUniqueID\").implicit(2).bitstr().optional(),\n this.key(\"extensions\").explicit(3).seqof(Extension).optional(),\n );\n }),\n X509Certificate = asn.define(\"X509Certificate\", function () {\n this.seq().obj(\n this.key(\"tbsCertificate\").use(TBSCertificate),\n this.key(\"signatureAlgorithm\").use(AlgorithmIdentifier),\n this.key(\"signatureValue\").bitstr(),\n );\n });\n module.exports = X509Certificate;\n },\n});\n\n// node_modules/parse-asn1/asn1.js\nvar require_asn12 = __commonJS({\n \"node_modules/parse-asn1/asn1.js\"(exports) {\n \"use strict\";\n var asn1 = require_asn1();\n exports.certificate = require_certificate();\n var RSAPrivateKey = asn1.define(\"RSAPrivateKey\", function () {\n this.seq().obj(\n this.key(\"version\").int(),\n this.key(\"modulus\").int(),\n this.key(\"publicExponent\").int(),\n this.key(\"privateExponent\").int(),\n this.key(\"prime1\").int(),\n this.key(\"prime2\").int(),\n this.key(\"exponent1\").int(),\n this.key(\"exponent2\").int(),\n this.key(\"coefficient\").int(),\n );\n });\n exports.RSAPrivateKey = RSAPrivateKey;\n var RSAPublicKey = asn1.define(\"RSAPublicKey\", function () {\n this.seq().obj(this.key(\"modulus\").int(), this.key(\"publicExponent\").int());\n });\n exports.RSAPublicKey = RSAPublicKey;\n var PublicKey = asn1.define(\"SubjectPublicKeyInfo\", function () {\n this.seq().obj(this.key(\"algorithm\").use(AlgorithmIdentifier), this.key(\"subjectPublicKey\").bitstr());\n });\n exports.PublicKey = PublicKey;\n var AlgorithmIdentifier = asn1.define(\"AlgorithmIdentifier\", function () {\n this.seq().obj(\n this.key(\"algorithm\").objid(),\n this.key(\"none\").null_().optional(),\n this.key(\"curve\").objid().optional(),\n this.key(\"params\").seq().obj(this.key(\"p\").int(), this.key(\"q\").int(), this.key(\"g\").int()).optional(),\n );\n }),\n PrivateKeyInfo = asn1.define(\"PrivateKeyInfo\", function () {\n this.seq().obj(\n this.key(\"version\").int(),\n this.key(\"algorithm\").use(AlgorithmIdentifier),\n this.key(\"subjectPrivateKey\").octstr(),\n );\n });\n exports.PrivateKey = PrivateKeyInfo;\n var EncryptedPrivateKeyInfo = asn1.define(\"EncryptedPrivateKeyInfo\", function () {\n this.seq().obj(\n this.key(\"algorithm\")\n .seq()\n .obj(\n this.key(\"id\").objid(),\n this.key(\"decrypt\")\n .seq()\n .obj(\n this.key(\"kde\")\n .seq()\n .obj(\n this.key(\"id\").objid(),\n this.key(\"kdeparams\").seq().obj(this.key(\"salt\").octstr(), this.key(\"iters\").int()),\n ),\n this.key(\"cipher\").seq().obj(this.key(\"algo\").objid(), this.key(\"iv\").octstr()),\n ),\n ),\n this.key(\"subjectPrivateKey\").octstr(),\n );\n });\n exports.EncryptedPrivateKey = EncryptedPrivateKeyInfo;\n var DSAPrivateKey = asn1.define(\"DSAPrivateKey\", function () {\n this.seq().obj(\n this.key(\"version\").int(),\n this.key(\"p\").int(),\n this.key(\"q\").int(),\n this.key(\"g\").int(),\n this.key(\"pub_key\").int(),\n this.key(\"priv_key\").int(),\n );\n });\n exports.DSAPrivateKey = DSAPrivateKey;\n exports.DSAparam = asn1.define(\"DSAparam\", function () {\n this.int();\n });\n var ECPrivateKey = asn1.define(\"ECPrivateKey\", function () {\n this.seq().obj(\n this.key(\"version\").int(),\n this.key(\"privateKey\").octstr(),\n this.key(\"parameters\").optional().explicit(0).use(ECParameters),\n this.key(\"publicKey\").optional().explicit(1).bitstr(),\n );\n });\n exports.ECPrivateKey = ECPrivateKey;\n var ECParameters = asn1.define(\"ECParameters\", function () {\n this.choice({\n namedCurve: this.objid(),\n });\n });\n exports.signature = asn1.define(\"signature\", function () {\n this.seq().obj(this.key(\"r\").int(), this.key(\"s\").int());\n });\n },\n});\n\n// node_modules/parse-asn1/aesid.json\nvar require_aesid = __commonJS({\n \"node_modules/parse-asn1/aesid.json\"(exports, module) {\n module.exports = {\n \"2.16.840.1.101.3.4.1.1\": \"aes-128-ecb\",\n \"2.16.840.1.101.3.4.1.2\": \"aes-128-cbc\",\n \"2.16.840.1.101.3.4.1.3\": \"aes-128-ofb\",\n \"2.16.840.1.101.3.4.1.4\": \"aes-128-cfb\",\n \"2.16.840.1.101.3.4.1.21\": \"aes-192-ecb\",\n \"2.16.840.1.101.3.4.1.22\": \"aes-192-cbc\",\n \"2.16.840.1.101.3.4.1.23\": \"aes-192-ofb\",\n \"2.16.840.1.101.3.4.1.24\": \"aes-192-cfb\",\n \"2.16.840.1.101.3.4.1.41\": \"aes-256-ecb\",\n \"2.16.840.1.101.3.4.1.42\": \"aes-256-cbc\",\n \"2.16.840.1.101.3.4.1.43\": \"aes-256-ofb\",\n \"2.16.840.1.101.3.4.1.44\": \"aes-256-cfb\",\n };\n },\n});\n\n// node_modules/parse-asn1/fixProc.js\nvar require_fixProc = __commonJS({\n \"node_modules/parse-asn1/fixProc.js\"(exports, module) {\n var findProc =\n /Proc-Type: 4,ENCRYPTED[\\n\\r]+DEK-Info: AES-((?:128)|(?:192)|(?:256))-CBC,([0-9A-H]+)[\\n\\r]+([0-9A-z\\n\\r+/=]+)[\\n\\r]+/m,\n startRegex = /^-----BEGIN ((?:.*? KEY)|CERTIFICATE)-----/m,\n fullRegex = /^-----BEGIN ((?:.*? KEY)|CERTIFICATE)-----([0-9A-z\\n\\r+/=]+)-----END \\1-----$/m,\n evp = require_evp_bytestokey(),\n ciphers = require_browser5(),\n Buffer2 = require_safe_buffer().Buffer;\n module.exports = function (okey, password) {\n var key = okey.toString(),\n match = key.match(findProc),\n decrypted;\n if (match) {\n var suite = \"aes\" + match[1],\n iv = Buffer2.from(match[2], \"hex\"),\n cipherText = Buffer2.from(match[3].replace(/[\\r\\n]/g, \"\"), \"base64\"),\n cipherKey = evp(password, iv.slice(0, 8), parseInt(match[1], 10)).key,\n out = [],\n cipher = ciphers.createDecipheriv(suite, cipherKey, iv);\n out.push(cipher.update(cipherText)), out.push(cipher.final()), (decrypted = Buffer2.concat(out));\n } else {\n var match2 = key.match(fullRegex);\n decrypted = Buffer2.from(match2[2].replace(/[\\r\\n]/g, \"\"), \"base64\");\n }\n var tag = key.match(startRegex)[1];\n return {\n tag,\n data: decrypted,\n };\n };\n },\n});\n\n// node_modules/parse-asn1/index.js\nvar require_parse_asn1 = __commonJS({\n \"node_modules/parse-asn1/index.js\"(exports, module) {\n var asn1 = require_asn12(),\n aesid = require_aesid(),\n fixProc = require_fixProc(),\n ciphers = require_browser5(),\n compat = require_browser4(),\n Buffer2 = require_safe_buffer().Buffer;\n module.exports = parseKeys;\n function parseKeys(buffer) {\n var password;\n typeof buffer == \"object\" && !Buffer2.isBuffer(buffer) && ((password = buffer.passphrase), (buffer = buffer.key)),\n typeof buffer == \"string\" && (buffer = Buffer2.from(buffer));\n var stripped = fixProc(buffer, password),\n type = stripped.tag,\n data = stripped.data,\n subtype,\n ndata;\n switch (type) {\n case \"CERTIFICATE\":\n ndata = asn1.certificate.decode(data, \"der\").tbsCertificate.subjectPublicKeyInfo;\n case \"PUBLIC KEY\":\n switch (\n (ndata || (ndata = asn1.PublicKey.decode(data, \"der\")),\n (subtype = ndata.algorithm.algorithm.join(\".\")),\n subtype)\n ) {\n case \"1.2.840.113549.1.1.1\":\n return asn1.RSAPublicKey.decode(ndata.subjectPublicKey.data, \"der\");\n case \"1.2.840.10045.2.1\":\n return (\n (ndata.subjectPrivateKey = ndata.subjectPublicKey),\n {\n type: \"ec\",\n data: ndata,\n }\n );\n case \"1.2.840.10040.4.1\":\n return (\n (ndata.algorithm.params.pub_key = asn1.DSAparam.decode(ndata.subjectPublicKey.data, \"der\")),\n {\n type: \"dsa\",\n data: ndata.algorithm.params,\n }\n );\n default:\n throw new Error(\"unknown key id \" + subtype);\n }\n case \"ENCRYPTED PRIVATE KEY\":\n (data = asn1.EncryptedPrivateKey.decode(data, \"der\")), (data = decrypt(data, password));\n case \"PRIVATE KEY\":\n switch (\n ((ndata = asn1.PrivateKey.decode(data, \"der\")), (subtype = ndata.algorithm.algorithm.join(\".\")), subtype)\n ) {\n case \"1.2.840.113549.1.1.1\":\n return asn1.RSAPrivateKey.decode(ndata.subjectPrivateKey, \"der\");\n case \"1.2.840.10045.2.1\":\n return {\n curve: ndata.algorithm.curve,\n privateKey: asn1.ECPrivateKey.decode(ndata.subjectPrivateKey, \"der\").privateKey,\n };\n case \"1.2.840.10040.4.1\":\n return (\n (ndata.algorithm.params.priv_key = asn1.DSAparam.decode(ndata.subjectPrivateKey, \"der\")),\n {\n type: \"dsa\",\n params: ndata.algorithm.params,\n }\n );\n default:\n throw new Error(\"unknown key id \" + subtype);\n }\n case \"RSA PUBLIC KEY\":\n return asn1.RSAPublicKey.decode(data, \"der\");\n case \"RSA PRIVATE KEY\":\n return asn1.RSAPrivateKey.decode(data, \"der\");\n case \"DSA PRIVATE KEY\":\n return {\n type: \"dsa\",\n params: asn1.DSAPrivateKey.decode(data, \"der\"),\n };\n case \"EC PRIVATE KEY\":\n return (\n (data = asn1.ECPrivateKey.decode(data, \"der\")),\n {\n curve: data.parameters.value,\n privateKey: data.privateKey,\n }\n );\n default:\n throw new Error(\"unknown key type \" + type);\n }\n }\n parseKeys.signature = asn1.signature;\n function decrypt(data, password) {\n var salt = data.algorithm.decrypt.kde.kdeparams.salt,\n iters = parseInt(data.algorithm.decrypt.kde.kdeparams.iters.toString(), 10),\n algo = aesid[data.algorithm.decrypt.cipher.algo.join(\".\")],\n iv = data.algorithm.decrypt.cipher.iv,\n cipherText = data.subjectPrivateKey,\n keylen = parseInt(algo.split(\"-\")[1], 10) / 8,\n key = compat.pbkdf2Sync(password, salt, iters, keylen, \"sha1\"),\n cipher = ciphers.createDecipheriv(algo, key, iv),\n out = [];\n return out.push(cipher.update(cipherText)), out.push(cipher.final()), Buffer2.concat(out);\n }\n },\n});\n\n// node_modules/browserify-sign/browser/curves.json\nvar require_curves2 = __commonJS({\n \"node_modules/browserify-sign/browser/curves.json\"(exports, module) {\n module.exports = {\n \"1.3.132.0.10\": \"secp256k1\",\n \"1.3.132.0.33\": \"p224\",\n \"1.2.840.10045.3.1.1\": \"p192\",\n \"1.2.840.10045.3.1.7\": \"p256\",\n \"1.3.132.0.34\": \"p384\",\n \"1.3.132.0.35\": \"p521\",\n };\n },\n});\n\n// node_modules/browserify-sign/browser/sign.js\nvar require_sign = __commonJS({\n \"node_modules/browserify-sign/browser/sign.js\"(exports, module) {\n var Buffer2 = require_safe_buffer().Buffer,\n createHmac = require_browser3(),\n crt = require_browserify_rsa(),\n EC = require_elliptic().ec,\n BN = require_bn3(),\n parseKeys = require_parse_asn1(),\n curves = require_curves2();\n function sign(hash, key, hashType, signType, tag) {\n var priv = parseKeys(key);\n if (priv.curve) {\n if (signType !== \"ecdsa\" && signType !== \"ecdsa/rsa\") throw new Error(\"wrong private key type\");\n return ecSign(hash, priv);\n } else if (priv.type === \"dsa\") {\n if (signType !== \"dsa\") throw new Error(\"wrong private key type\");\n return dsaSign(hash, priv, hashType);\n } else if (signType !== \"rsa\" && signType !== \"ecdsa/rsa\") throw new Error(\"wrong private key type\");\n hash = Buffer2.concat([tag, hash]);\n for (var len = priv.modulus.byteLength(), pad = [0, 1]; hash.length + pad.length + 1 < len; ) pad.push(255);\n pad.push(0);\n for (var i = -1; ++i < hash.length; ) pad.push(hash[i]);\n var out = crt(pad, priv);\n return out;\n }\n function ecSign(hash, priv) {\n var curveId = curves[priv.curve.join(\".\")];\n if (!curveId) throw new Error(\"unknown curve \" + priv.curve.join(\".\"));\n var curve = new EC(curveId),\n key = curve.keyFromPrivate(priv.privateKey),\n out = key.sign(hash);\n return Buffer2.from(out.toDER());\n }\n function dsaSign(hash, priv, algo) {\n for (\n var x = priv.params.priv_key,\n p = priv.params.p,\n q = priv.params.q,\n g = priv.params.g,\n r = new BN(0),\n k,\n H = bits2int(hash, q).mod(q),\n s = !1,\n kv = getKey(x, q, hash, algo);\n s === !1;\n\n )\n (k = makeKey(q, kv, algo)),\n (r = makeR(g, k, p, q)),\n (s = k\n .invm(q)\n .imul(H.add(x.mul(r)))\n .mod(q)),\n s.cmpn(0) === 0 && ((s = !1), (r = new BN(0)));\n return toDER(r, s);\n }\n function toDER(r, s) {\n (r = r.toArray()), (s = s.toArray()), r[0] & 128 && (r = [0].concat(r)), s[0] & 128 && (s = [0].concat(s));\n var total = r.length + s.length + 4,\n res = [48, total, 2, r.length];\n return (res = res.concat(r, [2, s.length], s)), Buffer2.from(res);\n }\n function getKey(x, q, hash, algo) {\n if (((x = Buffer2.from(x.toArray())), x.length < q.byteLength())) {\n var zeros = Buffer2.alloc(q.byteLength() - x.length);\n x = Buffer2.concat([zeros, x]);\n }\n var hlen = hash.length,\n hbits = bits2octets(hash, q),\n v = Buffer2.alloc(hlen);\n v.fill(1);\n var k = Buffer2.alloc(hlen);\n return (\n (k = createHmac(algo, k)\n .update(v)\n .update(Buffer2.from([0]))\n .update(x)\n .update(hbits)\n .digest()),\n (v = createHmac(algo, k).update(v).digest()),\n (k = createHmac(algo, k)\n .update(v)\n .update(Buffer2.from([1]))\n .update(x)\n .update(hbits)\n .digest()),\n (v = createHmac(algo, k).update(v).digest()),\n { k, v }\n );\n }\n function bits2int(obits, q) {\n var bits = new BN(obits),\n shift = (obits.length << 3) - q.bitLength();\n return shift > 0 && bits.ishrn(shift), bits;\n }\n function bits2octets(bits, q) {\n (bits = bits2int(bits, q)), (bits = bits.mod(q));\n var out = Buffer2.from(bits.toArray());\n if (out.length < q.byteLength()) {\n var zeros = Buffer2.alloc(q.byteLength() - out.length);\n out = Buffer2.concat([zeros, out]);\n }\n return out;\n }\n function makeKey(q, kv, algo) {\n var t, k;\n do {\n for (t = Buffer2.alloc(0); t.length * 8 < q.bitLength(); )\n (kv.v = createHmac(algo, kv.k).update(kv.v).digest()), (t = Buffer2.concat([t, kv.v]));\n (k = bits2int(t, q)),\n (kv.k = createHmac(algo, kv.k)\n .update(kv.v)\n .update(Buffer2.from([0]))\n .digest()),\n (kv.v = createHmac(algo, kv.k).update(kv.v).digest());\n } while (k.cmp(q) !== -1);\n return k;\n }\n function makeR(g, k, p, q) {\n return g.toRed(BN.mont(p)).redPow(k).fromRed().mod(q);\n }\n module.exports = sign;\n module.exports.getKey = getKey;\n module.exports.makeKey = makeKey;\n },\n});\n\n// node_modules/browserify-sign/browser/verify.js\nvar require_verify = __commonJS({\n \"node_modules/browserify-sign/browser/verify.js\"(exports, module) {\n var Buffer2 = require_safe_buffer().Buffer,\n BN = require_bn3(),\n EC = require_elliptic().ec,\n parseKeys = require_parse_asn1(),\n curves = require_curves2();\n function verify(sig, hash, key, signType, tag) {\n var pub = parseKeys(key);\n if (pub.type === \"ec\") {\n if (signType !== \"ecdsa\" && signType !== \"ecdsa/rsa\") throw new Error(\"wrong public key type\");\n return ecVerify(sig, hash, pub);\n } else if (pub.type === \"dsa\") {\n if (signType !== \"dsa\") throw new Error(\"wrong public key type\");\n return dsaVerify(sig, hash, pub);\n } else if (signType !== \"rsa\" && signType !== \"ecdsa/rsa\") throw new Error(\"wrong public key type\");\n hash = Buffer2.concat([tag, hash]);\n for (var len = pub.modulus.byteLength(), pad = [1], padNum = 0; hash.length + pad.length + 2 < len; )\n pad.push(255), padNum++;\n pad.push(0);\n for (var i = -1; ++i < hash.length; ) pad.push(hash[i]);\n pad = Buffer2.from(pad);\n var red = BN.mont(pub.modulus);\n (sig = new BN(sig).toRed(red)),\n (sig = sig.redPow(new BN(pub.publicExponent))),\n (sig = Buffer2.from(sig.fromRed().toArray()));\n var out = padNum < 8 ? 1 : 0;\n for (len = Math.min(sig.length, pad.length), sig.length !== pad.length && (out = 1), i = -1; ++i < len; )\n out |= sig[i] ^ pad[i];\n return out === 0;\n }\n function ecVerify(sig, hash, pub) {\n var curveId = curves[pub.data.algorithm.curve.join(\".\")];\n if (!curveId) throw new Error(\"unknown curve \" + pub.data.algorithm.curve.join(\".\"));\n var curve = new EC(curveId),\n pubkey = pub.data.subjectPrivateKey.data;\n return curve.verify(hash, sig, pubkey);\n }\n function dsaVerify(sig, hash, pub) {\n var p = pub.data.p,\n q = pub.data.q,\n g = pub.data.g,\n y = pub.data.pub_key,\n unpacked = parseKeys.signature.decode(sig, \"der\"),\n s = unpacked.s,\n r = unpacked.r;\n checkValue(s, q), checkValue(r, q);\n var montp = BN.mont(p),\n w = s.invm(q),\n v = g\n .toRed(montp)\n .redPow(new BN(hash).mul(w).mod(q))\n .fromRed()\n .mul(y.toRed(montp).redPow(r.mul(w).mod(q)).fromRed())\n .mod(p)\n .mod(q);\n return v.cmp(r) === 0;\n }\n function checkValue(b, q) {\n if (b.cmpn(0) <= 0) throw new Error(\"invalid sig\");\n if (b.cmp(q) >= q) throw new Error(\"invalid sig\");\n }\n module.exports = verify;\n },\n});\n\n// node_modules/browserify-sign/browser/index.js\nvar require_browser8 = __commonJS({\n \"node_modules/browserify-sign/browser/index.js\"(exports, module) {\n var Buffer2 = require_safe_buffer().Buffer,\n createHash = require_browser2(),\n stream = __require(\"readable-stream\"),\n inherits = require_inherits_browser(),\n sign = require_sign(),\n verify = require_verify(),\n algorithms = require_algorithms();\n Object.keys(algorithms).forEach(function (key) {\n (algorithms[key].id = Buffer2.from(algorithms[key].id, \"hex\")), (algorithms[key.toLowerCase()] = algorithms[key]);\n });\n function Sign(algorithm) {\n stream.Writable.call(this);\n var data = algorithms[algorithm];\n if (!data) throw new Error(\"Unknown message digest\");\n (this._hashType = data.hash),\n (this._hash = createHash(data.hash)),\n (this._tag = data.id),\n (this._signType = data.sign);\n }\n inherits(Sign, stream.Writable);\n Sign.prototype._write = function (data, _, done) {\n this._hash.update(data), done();\n };\n Sign.prototype.update = function (data, enc) {\n return typeof data == \"string\" && (data = Buffer2.from(data, enc)), this._hash.update(data), this;\n };\n Sign.prototype.sign = function (key, enc) {\n this.end();\n var hash = this._hash.digest(),\n sig = sign(hash, key, this._hashType, this._signType, this._tag);\n return enc ? sig.toString(enc) : sig;\n };\n function Verify(algorithm) {\n stream.Writable.call(this);\n var data = algorithms[algorithm];\n if (!data) throw new Error(\"Unknown message digest\");\n (this._hash = createHash(data.hash)), (this._tag = data.id), (this._signType = data.sign);\n }\n inherits(Verify, stream.Writable);\n Verify.prototype._write = function (data, _, done) {\n this._hash.update(data), done();\n };\n Verify.prototype.update = function (data, enc) {\n return typeof data == \"string\" && (data = Buffer2.from(data, enc)), this._hash.update(data), this;\n };\n Verify.prototype.verify = function (key, sig, enc) {\n typeof sig == \"string\" && (sig = Buffer2.from(sig, enc)), this.end();\n var hash = this._hash.digest();\n return verify(sig, hash, key, this._signType, this._tag);\n };\n function createSign(algorithm) {\n return new Sign(algorithm);\n }\n function createVerify(algorithm) {\n return new Verify(algorithm);\n }\n module.exports = {\n Sign: createSign,\n Verify: createVerify,\n createSign,\n createVerify,\n };\n },\n});\n\n// node_modules/create-ecdh/node_modules/bn.js/lib/bn.js\nvar require_bn6 = __commonJS({\n \"node_modules/create-ecdh/node_modules/bn.js/lib/bn.js\"(exports, module) {\n (function (module2, exports2) {\n \"use strict\";\n function assert(val, msg) {\n if (!val) throw new Error(msg || \"Assertion failed\");\n }\n function inherits(ctor, superCtor) {\n ctor.super_ = superCtor;\n var TempCtor = function () {};\n (TempCtor.prototype = superCtor.prototype),\n (ctor.prototype = new TempCtor()),\n (ctor.prototype.constructor = ctor);\n }\n function BN(number, base, endian) {\n if (BN.isBN(number)) return number;\n (this.negative = 0),\n (this.words = null),\n (this.length = 0),\n (this.red = null),\n number !== null &&\n ((base === \"le\" || base === \"be\") && ((endian = base), (base = 10)),\n this._init(number || 0, base || 10, endian || \"be\"));\n }\n typeof module2 == \"object\" ? (module2.exports = BN) : (exports2.BN = BN), (BN.BN = BN), (BN.wordSize = 26);\n var Buffer2;\n try {\n typeof window < \"u\" && typeof window.Buffer < \"u\"\n ? (Buffer2 = window.Buffer)\n : (Buffer2 = __require(\"buffer\").Buffer);\n } catch {}\n (BN.isBN = function (num) {\n return num instanceof BN\n ? !0\n : num !== null &&\n typeof num == \"object\" &&\n num.constructor.wordSize === BN.wordSize &&\n Array.isArray(num.words);\n }),\n (BN.max = function (left, right) {\n return left.cmp(right) > 0 ? left : right;\n }),\n (BN.min = function (left, right) {\n return left.cmp(right) < 0 ? left : right;\n }),\n (BN.prototype._init = function (number, base, endian) {\n if (typeof number == \"number\") return this._initNumber(number, base, endian);\n if (typeof number == \"object\") return this._initArray(number, base, endian);\n base === \"hex\" && (base = 16),\n assert(base === (base | 0) && base >= 2 && base <= 36),\n (number = number.toString().replace(/\\s+/g, \"\"));\n var start = 0;\n number[0] === \"-\" && (start++, (this.negative = 1)),\n start < number.length &&\n (base === 16\n ? this._parseHex(number, start, endian)\n : (this._parseBase(number, base, start),\n endian === \"le\" && this._initArray(this.toArray(), base, endian)));\n }),\n (BN.prototype._initNumber = function (number, base, endian) {\n number < 0 && ((this.negative = 1), (number = -number)),\n number < 67108864\n ? ((this.words = [number & 67108863]), (this.length = 1))\n : number < 4503599627370496\n ? ((this.words = [number & 67108863, (number / 67108864) & 67108863]), (this.length = 2))\n : (assert(number < 9007199254740992),\n (this.words = [number & 67108863, (number / 67108864) & 67108863, 1]),\n (this.length = 3)),\n endian === \"le\" && this._initArray(this.toArray(), base, endian);\n }),\n (BN.prototype._initArray = function (number, base, endian) {\n if ((assert(typeof number.length == \"number\"), number.length <= 0))\n return (this.words = [0]), (this.length = 1), this;\n (this.length = Math.ceil(number.length / 3)), (this.words = new Array(this.length));\n for (var i = 0; i < this.length; i++) this.words[i] = 0;\n var j,\n w,\n off = 0;\n if (endian === \"be\")\n for (i = number.length - 1, j = 0; i >= 0; i -= 3)\n (w = number[i] | (number[i - 1] << 8) | (number[i - 2] << 16)),\n (this.words[j] |= (w << off) & 67108863),\n (this.words[j + 1] = (w >>> (26 - off)) & 67108863),\n (off += 24),\n off >= 26 && ((off -= 26), j++);\n else if (endian === \"le\")\n for (i = 0, j = 0; i < number.length; i += 3)\n (w = number[i] | (number[i + 1] << 8) | (number[i + 2] << 16)),\n (this.words[j] |= (w << off) & 67108863),\n (this.words[j + 1] = (w >>> (26 - off)) & 67108863),\n (off += 24),\n off >= 26 && ((off -= 26), j++);\n return this.strip();\n });\n function parseHex4Bits(string, index) {\n var c = string.charCodeAt(index);\n return c >= 65 && c <= 70 ? c - 55 : c >= 97 && c <= 102 ? c - 87 : (c - 48) & 15;\n }\n function parseHexByte(string, lowerBound, index) {\n var r = parseHex4Bits(string, index);\n return index - 1 >= lowerBound && (r |= parseHex4Bits(string, index - 1) << 4), r;\n }\n BN.prototype._parseHex = function (number, start, endian) {\n (this.length = Math.ceil((number.length - start) / 6)), (this.words = new Array(this.length));\n for (var i = 0; i < this.length; i++) this.words[i] = 0;\n var off = 0,\n j = 0,\n w;\n if (endian === \"be\")\n for (i = number.length - 1; i >= start; i -= 2)\n (w = parseHexByte(number, start, i) << off),\n (this.words[j] |= w & 67108863),\n off >= 18 ? ((off -= 18), (j += 1), (this.words[j] |= w >>> 26)) : (off += 8);\n else {\n var parseLength = number.length - start;\n for (i = parseLength % 2 === 0 ? start + 1 : start; i < number.length; i += 2)\n (w = parseHexByte(number, start, i) << off),\n (this.words[j] |= w & 67108863),\n off >= 18 ? ((off -= 18), (j += 1), (this.words[j] |= w >>> 26)) : (off += 8);\n }\n this.strip();\n };\n function parseBase(str, start, end, mul) {\n for (var r = 0, len = Math.min(str.length, end), i = start; i < len; i++) {\n var c = str.charCodeAt(i) - 48;\n (r *= mul), c >= 49 ? (r += c - 49 + 10) : c >= 17 ? (r += c - 17 + 10) : (r += c);\n }\n return r;\n }\n (BN.prototype._parseBase = function (number, base, start) {\n (this.words = [0]), (this.length = 1);\n for (var limbLen = 0, limbPow = 1; limbPow <= 67108863; limbPow *= base) limbLen++;\n limbLen--, (limbPow = (limbPow / base) | 0);\n for (\n var total = number.length - start,\n mod = total % limbLen,\n end = Math.min(total, total - mod) + start,\n word = 0,\n i = start;\n i < end;\n i += limbLen\n )\n (word = parseBase(number, i, i + limbLen, base)),\n this.imuln(limbPow),\n this.words[0] + word < 67108864 ? (this.words[0] += word) : this._iaddn(word);\n if (mod !== 0) {\n var pow = 1;\n for (word = parseBase(number, i, number.length, base), i = 0; i < mod; i++) pow *= base;\n this.imuln(pow), this.words[0] + word < 67108864 ? (this.words[0] += word) : this._iaddn(word);\n }\n this.strip();\n }),\n (BN.prototype.copy = function (dest) {\n dest.words = new Array(this.length);\n for (var i = 0; i < this.length; i++) dest.words[i] = this.words[i];\n (dest.length = this.length), (dest.negative = this.negative), (dest.red = this.red);\n }),\n (BN.prototype.clone = function () {\n var r = new BN(null);\n return this.copy(r), r;\n }),\n (BN.prototype._expand = function (size) {\n for (; this.length < size; ) this.words[this.length++] = 0;\n return this;\n }),\n (BN.prototype.strip = function () {\n for (; this.length > 1 && this.words[this.length - 1] === 0; ) this.length--;\n return this._normSign();\n }),\n (BN.prototype._normSign = function () {\n return this.length === 1 && this.words[0] === 0 && (this.negative = 0), this;\n }),\n (BN.prototype.inspect = function () {\n return (this.red ? \"<BN-R: \" : \"<BN: \") + this.toString(16) + \">\";\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 groupSizes = [\n 0, 0, 25, 16, 12, 11, 10, 9, 8, 8, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5,\n 5, 5,\n ],\n groupBases = [\n 0, 0, 33554432, 43046721, 16777216, 48828125, 60466176, 40353607, 16777216, 43046721, 1e7, 19487171, 35831808,\n 62748517, 7529536, 11390625, 16777216, 24137569, 34012224, 47045881, 64e6, 4084101, 5153632, 6436343, 7962624,\n 9765625, 11881376, 14348907, 17210368, 20511149, 243e5, 28629151, 33554432, 39135393, 45435424, 52521875,\n 60466176,\n ];\n (BN.prototype.toString = function (base, padding) {\n (base = base || 10), (padding = padding | 0 || 1);\n var out;\n if (base === 16 || base === \"hex\") {\n out = \"\";\n for (var off = 0, carry = 0, i = 0; i < this.length; i++) {\n var w = this.words[i],\n word = (((w << off) | carry) & 16777215).toString(16);\n (carry = (w >>> (24 - off)) & 16777215),\n carry !== 0 || i !== this.length - 1 ? (out = zeros[6 - word.length] + word + out) : (out = word + out),\n (off += 2),\n off >= 26 && ((off -= 26), i--);\n }\n for (carry !== 0 && (out = carry.toString(16) + out); out.length % padding !== 0; ) out = \"0\" + out;\n return this.negative !== 0 && (out = \"-\" + out), out;\n }\n if (base === (base | 0) && base >= 2 && base <= 36) {\n var groupSize = groupSizes[base],\n groupBase = groupBases[base];\n out = \"\";\n var c = this.clone();\n for (c.negative = 0; !c.isZero(); ) {\n var r = c.modn(groupBase).toString(base);\n (c = c.idivn(groupBase)), c.isZero() ? (out = r + out) : (out = zeros[groupSize - r.length] + r + out);\n }\n for (this.isZero() && (out = \"0\" + out); out.length % padding !== 0; ) out = \"0\" + out;\n return this.negative !== 0 && (out = \"-\" + out), out;\n }\n assert(!1, \"Base should be between 2 and 36\");\n }),\n (BN.prototype.toNumber = function () {\n var ret = this.words[0];\n return (\n this.length === 2\n ? (ret += this.words[1] * 67108864)\n : this.length === 3 && this.words[2] === 1\n ? (ret += 4503599627370496 + this.words[1] * 67108864)\n : this.length > 2 && assert(!1, \"Number can only safely store up to 53 bits\"),\n this.negative !== 0 ? -ret : ret\n );\n }),\n (BN.prototype.toJSON = function () {\n return this.toString(16);\n }),\n (BN.prototype.toBuffer = function (endian, length) {\n return assert(typeof Buffer2 < \"u\"), this.toArrayLike(Buffer2, endian, length);\n }),\n (BN.prototype.toArray = function (endian, length) {\n return this.toArrayLike(Array, endian, length);\n }),\n (BN.prototype.toArrayLike = function (ArrayType, endian, length) {\n var byteLength = this.byteLength(),\n 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 this.strip();\n var littleEndian = endian === \"le\",\n res = new ArrayType(reqLength),\n b,\n i,\n q = this.clone();\n if (littleEndian) {\n for (i = 0; !q.isZero(); i++) (b = q.andln(255)), q.iushrn(8), (res[i] = b);\n for (; i < reqLength; i++) res[i] = 0;\n } else {\n for (i = 0; i < reqLength - byteLength; i++) res[i] = 0;\n for (i = 0; !q.isZero(); i++) (b = q.andln(255)), q.iushrn(8), (res[reqLength - i - 1] = b);\n }\n return res;\n }),\n Math.clz32\n ? (BN.prototype._countBits = function (w) {\n return 32 - Math.clz32(w);\n })\n : (BN.prototype._countBits = function (w) {\n var t = w,\n r = 0;\n return (\n t >= 4096 && ((r += 13), (t >>>= 13)),\n t >= 64 && ((r += 7), (t >>>= 7)),\n t >= 8 && ((r += 4), (t >>>= 4)),\n t >= 2 && ((r += 2), (t >>>= 2)),\n r + t\n );\n }),\n (BN.prototype._zeroBits = function (w) {\n if (w === 0) return 26;\n var t = w,\n r = 0;\n return (\n (t & 8191) === 0 && ((r += 13), (t >>>= 13)),\n (t & 127) === 0 && ((r += 7), (t >>>= 7)),\n (t & 15) === 0 && ((r += 4), (t >>>= 4)),\n (t & 3) === 0 && ((r += 2), (t >>>= 2)),\n (t & 1) === 0 && r++,\n r\n );\n }),\n (BN.prototype.bitLength = function () {\n var w = this.words[this.length - 1],\n hi = this._countBits(w);\n return (this.length - 1) * 26 + hi;\n });\n function toBitArray(num) {\n for (var w = new Array(num.bitLength()), bit = 0; bit < w.length; bit++) {\n var off = (bit / 26) | 0,\n wbit = bit % 26;\n w[bit] = (num.words[off] & (1 << wbit)) >>> wbit;\n }\n return w;\n }\n (BN.prototype.zeroBits = function () {\n if (this.isZero()) return 0;\n for (var r = 0, i = 0; i < this.length; i++) {\n var b = this._zeroBits(this.words[i]);\n if (((r += b), b !== 26)) break;\n }\n return r;\n }),\n (BN.prototype.byteLength = function () {\n return Math.ceil(this.bitLength() / 8);\n }),\n (BN.prototype.toTwos = function (width) {\n return this.negative !== 0 ? this.abs().inotn(width).iaddn(1) : this.clone();\n }),\n (BN.prototype.fromTwos = function (width) {\n return this.testn(width - 1) ? this.notn(width).iaddn(1).ineg() : this.clone();\n }),\n (BN.prototype.isNeg = function () {\n return this.negative !== 0;\n }),\n (BN.prototype.neg = function () {\n return this.clone().ineg();\n }),\n (BN.prototype.ineg = function () {\n return this.isZero() || (this.negative ^= 1), this;\n }),\n (BN.prototype.iuor = function (num) {\n for (; this.length < num.length; ) this.words[this.length++] = 0;\n for (var i = 0; i < num.length; i++) this.words[i] = this.words[i] | num.words[i];\n return this.strip();\n }),\n (BN.prototype.ior = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuor(num);\n }),\n (BN.prototype.or = function (num) {\n return this.length > num.length ? this.clone().ior(num) : num.clone().ior(this);\n }),\n (BN.prototype.uor = function (num) {\n return this.length > num.length ? this.clone().iuor(num) : num.clone().iuor(this);\n }),\n (BN.prototype.iuand = function (num) {\n var b;\n this.length > num.length ? (b = num) : (b = this);\n for (var i = 0; i < b.length; i++) this.words[i] = this.words[i] & num.words[i];\n return (this.length = b.length), this.strip();\n }),\n (BN.prototype.iand = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuand(num);\n }),\n (BN.prototype.and = function (num) {\n return this.length > num.length ? this.clone().iand(num) : num.clone().iand(this);\n }),\n (BN.prototype.uand = function (num) {\n return this.length > num.length ? this.clone().iuand(num) : num.clone().iuand(this);\n }),\n (BN.prototype.iuxor = function (num) {\n var a, b;\n this.length > num.length ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var i = 0; i < b.length; i++) this.words[i] = a.words[i] ^ b.words[i];\n if (this !== a) for (; i < a.length; i++) this.words[i] = a.words[i];\n return (this.length = a.length), this.strip();\n }),\n (BN.prototype.ixor = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuxor(num);\n }),\n (BN.prototype.xor = function (num) {\n return this.length > num.length ? this.clone().ixor(num) : num.clone().ixor(this);\n }),\n (BN.prototype.uxor = function (num) {\n return this.length > num.length ? this.clone().iuxor(num) : num.clone().iuxor(this);\n }),\n (BN.prototype.inotn = function (width) {\n assert(typeof width == \"number\" && width >= 0);\n var bytesNeeded = Math.ceil(width / 26) | 0,\n bitsLeft = width % 26;\n this._expand(bytesNeeded), bitsLeft > 0 && bytesNeeded--;\n for (var i = 0; i < bytesNeeded; i++) this.words[i] = ~this.words[i] & 67108863;\n return bitsLeft > 0 && (this.words[i] = ~this.words[i] & (67108863 >> (26 - bitsLeft))), this.strip();\n }),\n (BN.prototype.notn = function (width) {\n return this.clone().inotn(width);\n }),\n (BN.prototype.setn = function (bit, val) {\n assert(typeof bit == \"number\" && bit >= 0);\n var off = (bit / 26) | 0,\n wbit = bit % 26;\n return (\n this._expand(off + 1),\n val\n ? (this.words[off] = this.words[off] | (1 << wbit))\n : (this.words[off] = this.words[off] & ~(1 << wbit)),\n this.strip()\n );\n }),\n (BN.prototype.iadd = function (num) {\n var r;\n if (this.negative !== 0 && num.negative === 0)\n return (this.negative = 0), (r = this.isub(num)), (this.negative ^= 1), this._normSign();\n if (this.negative === 0 && num.negative !== 0)\n return (num.negative = 0), (r = this.isub(num)), (num.negative = 1), r._normSign();\n var a, b;\n this.length > num.length ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var carry = 0, i = 0; i < b.length; i++)\n (r = (a.words[i] | 0) + (b.words[i] | 0) + carry), (this.words[i] = r & 67108863), (carry = r >>> 26);\n for (; carry !== 0 && i < a.length; i++)\n (r = (a.words[i] | 0) + carry), (this.words[i] = r & 67108863), (carry = r >>> 26);\n if (((this.length = a.length), carry !== 0)) (this.words[this.length] = carry), this.length++;\n else if (a !== this) for (; i < a.length; i++) this.words[i] = a.words[i];\n return this;\n }),\n (BN.prototype.add = function (num) {\n var res;\n return num.negative !== 0 && this.negative === 0\n ? ((num.negative = 0), (res = this.sub(num)), (num.negative ^= 1), res)\n : num.negative === 0 && this.negative !== 0\n ? ((this.negative = 0), (res = num.sub(this)), (this.negative = 1), res)\n : this.length > num.length\n ? this.clone().iadd(num)\n : num.clone().iadd(this);\n }),\n (BN.prototype.isub = function (num) {\n if (num.negative !== 0) {\n num.negative = 0;\n var r = this.iadd(num);\n return (num.negative = 1), r._normSign();\n } else if (this.negative !== 0)\n return (this.negative = 0), this.iadd(num), (this.negative = 1), this._normSign();\n var cmp = this.cmp(num);\n if (cmp === 0) return (this.negative = 0), (this.length = 1), (this.words[0] = 0), this;\n var a, b;\n cmp > 0 ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var carry = 0, i = 0; i < b.length; i++)\n (r = (a.words[i] | 0) - (b.words[i] | 0) + carry), (carry = r >> 26), (this.words[i] = r & 67108863);\n for (; carry !== 0 && i < a.length; i++)\n (r = (a.words[i] | 0) + carry), (carry = r >> 26), (this.words[i] = r & 67108863);\n if (carry === 0 && i < a.length && a !== this) for (; i < a.length; i++) this.words[i] = a.words[i];\n return (this.length = Math.max(this.length, i)), a !== this && (this.negative = 1), this.strip();\n }),\n (BN.prototype.sub = function (num) {\n return this.clone().isub(num);\n });\n function smallMulTo(self2, num, out) {\n out.negative = num.negative ^ self2.negative;\n var len = (self2.length + num.length) | 0;\n (out.length = len), (len = (len - 1) | 0);\n var a = self2.words[0] | 0,\n b = num.words[0] | 0,\n r = a * b,\n lo = r & 67108863,\n carry = (r / 67108864) | 0;\n out.words[0] = lo;\n for (var k = 1; k < len; k++) {\n for (\n var ncarry = carry >>> 26,\n rword = carry & 67108863,\n maxJ = Math.min(k, num.length - 1),\n j = Math.max(0, k - self2.length + 1);\n j <= maxJ;\n j++\n ) {\n var i = (k - j) | 0;\n (a = self2.words[i] | 0),\n (b = num.words[j] | 0),\n (r = a * b + rword),\n (ncarry += (r / 67108864) | 0),\n (rword = r & 67108863);\n }\n (out.words[k] = rword | 0), (carry = ncarry | 0);\n }\n return carry !== 0 ? (out.words[k] = carry | 0) : out.length--, out.strip();\n }\n var comb10MulTo = function (self2, num, out) {\n var a = self2.words,\n b = num.words,\n o = out.words,\n c = 0,\n lo,\n mid,\n hi,\n a0 = a[0] | 0,\n al0 = a0 & 8191,\n ah0 = a0 >>> 13,\n a1 = a[1] | 0,\n al1 = a1 & 8191,\n ah1 = a1 >>> 13,\n a2 = a[2] | 0,\n al2 = a2 & 8191,\n ah2 = a2 >>> 13,\n a3 = a[3] | 0,\n al3 = a3 & 8191,\n ah3 = a3 >>> 13,\n a4 = a[4] | 0,\n al4 = a4 & 8191,\n ah4 = a4 >>> 13,\n a5 = a[5] | 0,\n al5 = a5 & 8191,\n ah5 = a5 >>> 13,\n a6 = a[6] | 0,\n al6 = a6 & 8191,\n ah6 = a6 >>> 13,\n a7 = a[7] | 0,\n al7 = a7 & 8191,\n ah7 = a7 >>> 13,\n a8 = a[8] | 0,\n al8 = a8 & 8191,\n ah8 = a8 >>> 13,\n a9 = a[9] | 0,\n al9 = a9 & 8191,\n ah9 = a9 >>> 13,\n b0 = b[0] | 0,\n bl0 = b0 & 8191,\n bh0 = b0 >>> 13,\n b1 = b[1] | 0,\n bl1 = b1 & 8191,\n bh1 = b1 >>> 13,\n b2 = b[2] | 0,\n bl2 = b2 & 8191,\n bh2 = b2 >>> 13,\n b3 = b[3] | 0,\n bl3 = b3 & 8191,\n bh3 = b3 >>> 13,\n b4 = b[4] | 0,\n bl4 = b4 & 8191,\n bh4 = b4 >>> 13,\n b5 = b[5] | 0,\n bl5 = b5 & 8191,\n bh5 = b5 >>> 13,\n b6 = b[6] | 0,\n bl6 = b6 & 8191,\n bh6 = b6 >>> 13,\n b7 = b[7] | 0,\n bl7 = b7 & 8191,\n bh7 = b7 >>> 13,\n b8 = b[8] | 0,\n bl8 = b8 & 8191,\n bh8 = b8 >>> 13,\n b9 = b[9] | 0,\n bl9 = b9 & 8191,\n bh9 = b9 >>> 13;\n (out.negative = self2.negative ^ num.negative),\n (out.length = 19),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w0 >>> 26)) | 0),\n (w0 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w1 >>> 26)) | 0),\n (w1 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w2 >>> 26)) | 0),\n (w2 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w3 >>> 26)) | 0),\n (w3 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w4 >>> 26)) | 0),\n (w4 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w5 >>> 26)) | 0),\n (w5 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w6 >>> 26)) | 0),\n (w6 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w7 >>> 26)) | 0),\n (w7 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w8 >>> 26)) | 0),\n (w8 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w9 >>> 26)) | 0),\n (w9 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w10 >>> 26)) | 0),\n (w10 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w11 >>> 26)) | 0),\n (w11 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w12 >>> 26)) | 0),\n (w12 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w13 >>> 26)) | 0),\n (w13 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w14 >>> 26)) | 0),\n (w14 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w15 >>> 26)) | 0),\n (w15 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w16 >>> 26)) | 0),\n (w16 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w17 >>> 26)) | 0),\n (w17 &= 67108863),\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 & 8191) << 13)) | 0;\n return (\n (c = (((hi + (mid >>> 13)) | 0) + (w18 >>> 26)) | 0),\n (w18 &= 67108863),\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 c !== 0 && ((o[19] = c), out.length++),\n out\n );\n };\n Math.imul || (comb10MulTo = smallMulTo);\n function bigMulTo(self2, num, out) {\n (out.negative = num.negative ^ self2.negative), (out.length = self2.length + num.length);\n for (var carry = 0, hncarry = 0, k = 0; k < out.length - 1; k++) {\n var ncarry = hncarry;\n hncarry = 0;\n for (\n var rword = carry & 67108863, maxJ = Math.min(k, num.length - 1), j = Math.max(0, k - self2.length + 1);\n j <= maxJ;\n j++\n ) {\n var i = k - j,\n a = self2.words[i] | 0,\n b = num.words[j] | 0,\n r = a * b,\n lo = r & 67108863;\n (ncarry = (ncarry + ((r / 67108864) | 0)) | 0),\n (lo = (lo + rword) | 0),\n (rword = lo & 67108863),\n (ncarry = (ncarry + (lo >>> 26)) | 0),\n (hncarry += ncarry >>> 26),\n (ncarry &= 67108863);\n }\n (out.words[k] = rword), (carry = ncarry), (ncarry = hncarry);\n }\n return carry !== 0 ? (out.words[k] = carry) : out.length--, out.strip();\n }\n function jumboMulTo(self2, num, out) {\n var fftm = new FFTM();\n return fftm.mulp(self2, num, out);\n }\n BN.prototype.mulTo = function (num, out) {\n var res,\n len = this.length + num.length;\n return (\n this.length === 10 && num.length === 10\n ? (res = comb10MulTo(this, num, out))\n : len < 63\n ? (res = smallMulTo(this, num, out))\n : len < 1024\n ? (res = bigMulTo(this, num, out))\n : (res = jumboMulTo(this, num, out)),\n res\n );\n };\n function FFTM(x, y) {\n (this.x = x), (this.y = y);\n }\n (FFTM.prototype.makeRBT = function (N) {\n for (var t = new Array(N), l = BN.prototype._countBits(N) - 1, i = 0; i < N; i++) t[i] = this.revBin(i, l, N);\n return t;\n }),\n (FFTM.prototype.revBin = function (x, l, N) {\n if (x === 0 || x === N - 1) return x;\n for (var rb = 0, i = 0; i < l; i++) (rb |= (x & 1) << (l - i - 1)), (x >>= 1);\n return rb;\n }),\n (FFTM.prototype.permute = function (rbt, rws, iws, rtws, itws, N) {\n for (var i = 0; i < N; i++) (rtws[i] = rws[rbt[i]]), (itws[i] = iws[rbt[i]]);\n }),\n (FFTM.prototype.transform = function (rws, iws, rtws, itws, N, rbt) {\n this.permute(rbt, rws, iws, rtws, itws, N);\n for (var s = 1; s < N; s <<= 1)\n for (\n var l = s << 1, rtwdf = Math.cos((2 * Math.PI) / l), itwdf = Math.sin((2 * Math.PI) / l), p = 0;\n p < N;\n p += l\n )\n for (var rtwdf_ = rtwdf, itwdf_ = itwdf, j = 0; j < s; j++) {\n var re = rtws[p + j],\n ie = itws[p + j],\n ro = rtws[p + j + s],\n io = itws[p + j + s],\n rx = rtwdf_ * ro - itwdf_ * io;\n (io = rtwdf_ * io + itwdf_ * ro),\n (ro = rx),\n (rtws[p + j] = re + ro),\n (itws[p + j] = ie + io),\n (rtws[p + j + s] = re - ro),\n (itws[p + j + s] = ie - io),\n j !== l &&\n ((rx = rtwdf * rtwdf_ - itwdf * itwdf_), (itwdf_ = rtwdf * itwdf_ + itwdf * rtwdf_), (rtwdf_ = rx));\n }\n }),\n (FFTM.prototype.guessLen13b = function (n, m) {\n var N = Math.max(m, n) | 1,\n odd = N & 1,\n i = 0;\n for (N = (N / 2) | 0; N; N = N >>> 1) i++;\n return 1 << (i + 1 + odd);\n }),\n (FFTM.prototype.conjugate = function (rws, iws, N) {\n if (!(N <= 1))\n for (var i = 0; i < N / 2; i++) {\n var t = rws[i];\n (rws[i] = rws[N - i - 1]),\n (rws[N - i - 1] = t),\n (t = iws[i]),\n (iws[i] = -iws[N - i - 1]),\n (iws[N - i - 1] = -t);\n }\n }),\n (FFTM.prototype.normalize13b = function (ws, N) {\n for (var carry = 0, i = 0; i < N / 2; i++) {\n var w = Math.round(ws[2 * i + 1] / N) * 8192 + Math.round(ws[2 * i] / N) + carry;\n (ws[i] = w & 67108863), w < 67108864 ? (carry = 0) : (carry = (w / 67108864) | 0);\n }\n return ws;\n }),\n (FFTM.prototype.convert13b = function (ws, len, rws, N) {\n for (var carry = 0, i = 0; i < len; i++)\n (carry = carry + (ws[i] | 0)),\n (rws[2 * i] = carry & 8191),\n (carry = carry >>> 13),\n (rws[2 * i + 1] = carry & 8191),\n (carry = carry >>> 13);\n for (i = 2 * len; i < N; ++i) rws[i] = 0;\n assert(carry === 0), assert((carry & -8192) === 0);\n }),\n (FFTM.prototype.stub = function (N) {\n for (var ph = new Array(N), i = 0; i < N; i++) ph[i] = 0;\n return ph;\n }),\n (FFTM.prototype.mulp = function (x, y, out) {\n var N = 2 * this.guessLen13b(x.length, y.length),\n rbt = this.makeRBT(N),\n _ = this.stub(N),\n rws = new Array(N),\n rwst = new Array(N),\n iwst = new Array(N),\n nrws = new Array(N),\n nrwst = new Array(N),\n niwst = new Array(N),\n rmws = out.words;\n (rmws.length = N),\n this.convert13b(x.words, x.length, rws, N),\n this.convert13b(y.words, y.length, nrws, N),\n this.transform(rws, _, rwst, iwst, N, rbt),\n this.transform(nrws, _, nrwst, niwst, N, rbt);\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]), (rwst[i] = rx);\n }\n return (\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 (out.negative = x.negative ^ y.negative),\n (out.length = x.length + y.length),\n out.strip()\n );\n }),\n (BN.prototype.mul = function (num) {\n var out = new BN(null);\n return (out.words = new Array(this.length + num.length)), this.mulTo(num, out);\n }),\n (BN.prototype.mulf = function (num) {\n var out = new BN(null);\n return (out.words = new Array(this.length + num.length)), jumboMulTo(this, num, out);\n }),\n (BN.prototype.imul = function (num) {\n return this.clone().mulTo(num, this);\n }),\n (BN.prototype.imuln = function (num) {\n assert(typeof num == \"number\"), assert(num < 67108864);\n for (var carry = 0, i = 0; i < this.length; i++) {\n var w = (this.words[i] | 0) * num,\n lo = (w & 67108863) + (carry & 67108863);\n (carry >>= 26), (carry += (w / 67108864) | 0), (carry += lo >>> 26), (this.words[i] = lo & 67108863);\n }\n return carry !== 0 && ((this.words[i] = carry), this.length++), this;\n }),\n (BN.prototype.muln = function (num) {\n return this.clone().imuln(num);\n }),\n (BN.prototype.sqr = function () {\n return this.mul(this);\n }),\n (BN.prototype.isqr = function () {\n return this.imul(this.clone());\n }),\n (BN.prototype.pow = function (num) {\n var w = toBitArray(num);\n if (w.length === 0) return new BN(1);\n for (var res = this, i = 0; i < w.length && w[i] === 0; i++, res = res.sqr());\n if (++i < w.length) for (var q = res.sqr(); i < w.length; i++, q = q.sqr()) w[i] !== 0 && (res = res.mul(q));\n return res;\n }),\n (BN.prototype.iushln = function (bits) {\n assert(typeof bits == \"number\" && bits >= 0);\n var r = bits % 26,\n s = (bits - r) / 26,\n carryMask = (67108863 >>> (26 - r)) << (26 - r),\n i;\n if (r !== 0) {\n var carry = 0;\n for (i = 0; i < this.length; i++) {\n var newCarry = this.words[i] & carryMask,\n c = ((this.words[i] | 0) - newCarry) << r;\n (this.words[i] = c | carry), (carry = newCarry >>> (26 - r));\n }\n carry && ((this.words[i] = carry), this.length++);\n }\n if (s !== 0) {\n for (i = this.length - 1; i >= 0; i--) this.words[i + s] = this.words[i];\n for (i = 0; i < s; i++) this.words[i] = 0;\n this.length += s;\n }\n return this.strip();\n }),\n (BN.prototype.ishln = function (bits) {\n return assert(this.negative === 0), this.iushln(bits);\n }),\n (BN.prototype.iushrn = function (bits, hint, extended) {\n assert(typeof bits == \"number\" && bits >= 0);\n var h;\n hint ? (h = (hint - (hint % 26)) / 26) : (h = 0);\n var r = bits % 26,\n s = Math.min((bits - r) / 26, this.length),\n mask = 67108863 ^ ((67108863 >>> r) << r),\n maskedWords = extended;\n if (((h -= s), (h = Math.max(0, h)), maskedWords)) {\n for (var i = 0; i < s; i++) maskedWords.words[i] = this.words[i];\n maskedWords.length = s;\n }\n if (s !== 0)\n if (this.length > s) for (this.length -= s, i = 0; i < this.length; i++) this.words[i] = this.words[i + s];\n else (this.words[0] = 0), (this.length = 1);\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)), (carry = word & mask);\n }\n return (\n maskedWords && carry !== 0 && (maskedWords.words[maskedWords.length++] = carry),\n this.length === 0 && ((this.words[0] = 0), (this.length = 1)),\n this.strip()\n );\n }),\n (BN.prototype.ishrn = function (bits, hint, extended) {\n return assert(this.negative === 0), this.iushrn(bits, hint, extended);\n }),\n (BN.prototype.shln = function (bits) {\n return this.clone().ishln(bits);\n }),\n (BN.prototype.ushln = function (bits) {\n return this.clone().iushln(bits);\n }),\n (BN.prototype.shrn = function (bits) {\n return this.clone().ishrn(bits);\n }),\n (BN.prototype.ushrn = function (bits) {\n return this.clone().iushrn(bits);\n }),\n (BN.prototype.testn = function (bit) {\n assert(typeof bit == \"number\" && bit >= 0);\n var r = bit % 26,\n s = (bit - r) / 26,\n q = 1 << r;\n if (this.length <= s) return !1;\n var w = this.words[s];\n return !!(w & q);\n }),\n (BN.prototype.imaskn = function (bits) {\n assert(typeof bits == \"number\" && bits >= 0);\n var r = bits % 26,\n s = (bits - r) / 26;\n if ((assert(this.negative === 0, \"imaskn works only with positive numbers\"), this.length <= s)) return this;\n if ((r !== 0 && s++, (this.length = Math.min(s, this.length)), r !== 0)) {\n var mask = 67108863 ^ ((67108863 >>> r) << r);\n this.words[this.length - 1] &= mask;\n }\n return this.strip();\n }),\n (BN.prototype.maskn = function (bits) {\n return this.clone().imaskn(bits);\n }),\n (BN.prototype.iaddn = function (num) {\n return (\n assert(typeof num == \"number\"),\n assert(num < 67108864),\n num < 0\n ? this.isubn(-num)\n : this.negative !== 0\n ? this.length === 1 && (this.words[0] | 0) < num\n ? ((this.words[0] = num - (this.words[0] | 0)), (this.negative = 0), this)\n : ((this.negative = 0), this.isubn(num), (this.negative = 1), this)\n : this._iaddn(num)\n );\n }),\n (BN.prototype._iaddn = function (num) {\n this.words[0] += num;\n for (var i = 0; i < this.length && this.words[i] >= 67108864; i++)\n (this.words[i] -= 67108864), i === this.length - 1 ? (this.words[i + 1] = 1) : this.words[i + 1]++;\n return (this.length = Math.max(this.length, i + 1)), this;\n }),\n (BN.prototype.isubn = function (num) {\n if ((assert(typeof num == \"number\"), assert(num < 67108864), num < 0)) return this.iaddn(-num);\n if (this.negative !== 0) return (this.negative = 0), this.iaddn(num), (this.negative = 1), this;\n if (((this.words[0] -= num), this.length === 1 && this.words[0] < 0))\n (this.words[0] = -this.words[0]), (this.negative = 1);\n else\n for (var i = 0; i < this.length && this.words[i] < 0; i++)\n (this.words[i] += 67108864), (this.words[i + 1] -= 1);\n return this.strip();\n }),\n (BN.prototype.addn = function (num) {\n return this.clone().iaddn(num);\n }),\n (BN.prototype.subn = function (num) {\n return this.clone().isubn(num);\n }),\n (BN.prototype.iabs = function () {\n return (this.negative = 0), this;\n }),\n (BN.prototype.abs = function () {\n return this.clone().iabs();\n }),\n (BN.prototype._ishlnsubmul = function (num, mul, shift) {\n var len = num.length + shift,\n i;\n this._expand(len);\n var w,\n 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 & 67108863),\n (carry = (w >> 26) - ((right / 67108864) | 0)),\n (this.words[i + shift] = w & 67108863);\n }\n for (; i < this.length - shift; i++)\n (w = (this.words[i + shift] | 0) + carry), (carry = w >> 26), (this.words[i + shift] = w & 67108863);\n if (carry === 0) return this.strip();\n for (assert(carry === -1), carry = 0, i = 0; i < this.length; i++)\n (w = -(this.words[i] | 0) + carry), (carry = w >> 26), (this.words[i] = w & 67108863);\n return (this.negative = 1), this.strip();\n }),\n (BN.prototype._wordDiv = function (num, mode) {\n var shift = this.length - num.length,\n a = this.clone(),\n b = num,\n bhi = b.words[b.length - 1] | 0,\n bhiBits = this._countBits(bhi);\n (shift = 26 - bhiBits),\n shift !== 0 && ((b = b.ushln(shift)), a.iushln(shift), (bhi = b.words[b.length - 1] | 0));\n var m = a.length - b.length,\n q;\n if (mode !== \"mod\") {\n (q = new BN(null)), (q.length = m + 1), (q.words = new Array(q.length));\n for (var i = 0; i < q.length; i++) q.words[i] = 0;\n }\n var diff = a.clone()._ishlnsubmul(b, 1, m);\n diff.negative === 0 && ((a = diff), q && (q.words[m] = 1));\n for (var j = m - 1; j >= 0; j--) {\n var qj = (a.words[b.length + j] | 0) * 67108864 + (a.words[b.length + j - 1] | 0);\n for (qj = Math.min((qj / bhi) | 0, 67108863), a._ishlnsubmul(b, qj, j); a.negative !== 0; )\n qj--, (a.negative = 0), a._ishlnsubmul(b, 1, j), a.isZero() || (a.negative ^= 1);\n q && (q.words[j] = qj);\n }\n return (\n q && q.strip(),\n a.strip(),\n mode !== \"div\" && shift !== 0 && a.iushrn(shift),\n {\n div: q || null,\n mod: a,\n }\n );\n }),\n (BN.prototype.divmod = function (num, mode, positive) {\n if ((assert(!num.isZero()), this.isZero()))\n return {\n div: new BN(0),\n mod: new BN(0),\n };\n var div, mod, res;\n return this.negative !== 0 && num.negative === 0\n ? ((res = this.neg().divmod(num, mode)),\n mode !== \"mod\" && (div = res.div.neg()),\n mode !== \"div\" && ((mod = res.mod.neg()), positive && mod.negative !== 0 && mod.iadd(num)),\n {\n div,\n mod,\n })\n : this.negative === 0 && num.negative !== 0\n ? ((res = this.divmod(num.neg(), mode)),\n mode !== \"mod\" && (div = res.div.neg()),\n {\n div,\n mod: res.mod,\n })\n : (this.negative & num.negative) !== 0\n ? ((res = this.neg().divmod(num.neg(), mode)),\n mode !== \"div\" && ((mod = res.mod.neg()), positive && mod.negative !== 0 && mod.isub(num)),\n {\n div: res.div,\n mod,\n })\n : num.length > this.length || this.cmp(num) < 0\n ? {\n div: new BN(0),\n mod: this,\n }\n : num.length === 1\n ? mode === \"div\"\n ? {\n div: this.divn(num.words[0]),\n mod: null,\n }\n : mode === \"mod\"\n ? {\n div: null,\n mod: new BN(this.modn(num.words[0])),\n }\n : {\n div: this.divn(num.words[0]),\n mod: new BN(this.modn(num.words[0])),\n }\n : this._wordDiv(num, mode);\n }),\n (BN.prototype.div = function (num) {\n return this.divmod(num, \"div\", !1).div;\n }),\n (BN.prototype.mod = function (num) {\n return this.divmod(num, \"mod\", !1).mod;\n }),\n (BN.prototype.umod = function (num) {\n return this.divmod(num, \"mod\", !0).mod;\n }),\n (BN.prototype.divRound = function (num) {\n var dm = this.divmod(num);\n if (dm.mod.isZero()) return dm.div;\n var mod = dm.div.negative !== 0 ? dm.mod.isub(num) : dm.mod,\n half = num.ushrn(1),\n r2 = num.andln(1),\n cmp = mod.cmp(half);\n return cmp < 0 || (r2 === 1 && cmp === 0)\n ? dm.div\n : dm.div.negative !== 0\n ? dm.div.isubn(1)\n : dm.div.iaddn(1);\n }),\n (BN.prototype.modn = function (num) {\n assert(num <= 67108863);\n for (var p = (1 << 26) % num, acc = 0, i = this.length - 1; i >= 0; i--)\n acc = (p * acc + (this.words[i] | 0)) % num;\n return acc;\n }),\n (BN.prototype.idivn = function (num) {\n assert(num <= 67108863);\n for (var carry = 0, i = this.length - 1; i >= 0; i--) {\n var w = (this.words[i] | 0) + carry * 67108864;\n (this.words[i] = (w / num) | 0), (carry = w % num);\n }\n return this.strip();\n }),\n (BN.prototype.divn = function (num) {\n return this.clone().idivn(num);\n }),\n (BN.prototype.egcd = function (p) {\n assert(p.negative === 0), assert(!p.isZero());\n var x = this,\n y = p.clone();\n x.negative !== 0 ? (x = x.umod(p)) : (x = x.clone());\n for (var A = new BN(1), B = new BN(0), C = new BN(0), D = new BN(1), g = 0; x.isEven() && y.isEven(); )\n x.iushrn(1), y.iushrn(1), ++g;\n for (var yp = y.clone(), xp = x.clone(); !x.isZero(); ) {\n for (var i = 0, im = 1; (x.words[0] & im) === 0 && i < 26; ++i, im <<= 1);\n if (i > 0)\n for (x.iushrn(i); i-- > 0; )\n (A.isOdd() || B.isOdd()) && (A.iadd(yp), B.isub(xp)), A.iushrn(1), B.iushrn(1);\n for (var j = 0, jm = 1; (y.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n if (j > 0)\n for (y.iushrn(j); j-- > 0; )\n (C.isOdd() || D.isOdd()) && (C.iadd(yp), D.isub(xp)), C.iushrn(1), D.iushrn(1);\n x.cmp(y) >= 0 ? (x.isub(y), A.isub(C), B.isub(D)) : (y.isub(x), C.isub(A), D.isub(B));\n }\n return {\n a: C,\n b: D,\n gcd: y.iushln(g),\n };\n }),\n (BN.prototype._invmp = function (p) {\n assert(p.negative === 0), assert(!p.isZero());\n var a = this,\n b = p.clone();\n a.negative !== 0 ? (a = a.umod(p)) : (a = a.clone());\n for (var x1 = new BN(1), x2 = new BN(0), delta = b.clone(); 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) for (a.iushrn(i); i-- > 0; ) x1.isOdd() && x1.iadd(delta), x1.iushrn(1);\n for (var j = 0, jm = 1; (b.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n if (j > 0) for (b.iushrn(j); j-- > 0; ) x2.isOdd() && x2.iadd(delta), x2.iushrn(1);\n a.cmp(b) >= 0 ? (a.isub(b), x1.isub(x2)) : (b.isub(a), x2.isub(x1));\n }\n var res;\n return a.cmpn(1) === 0 ? (res = x1) : (res = x2), res.cmpn(0) < 0 && res.iadd(p), res;\n }),\n (BN.prototype.gcd = function (num) {\n if (this.isZero()) return num.abs();\n if (num.isZero()) return this.abs();\n var a = this.clone(),\n b = num.clone();\n (a.negative = 0), (b.negative = 0);\n for (var shift = 0; a.isEven() && b.isEven(); shift++) a.iushrn(1), b.iushrn(1);\n do {\n for (; a.isEven(); ) a.iushrn(1);\n for (; b.isEven(); ) b.iushrn(1);\n var r = a.cmp(b);\n if (r < 0) {\n var t = a;\n (a = b), (b = t);\n } else if (r === 0 || b.cmpn(1) === 0) break;\n a.isub(b);\n } while (!0);\n return b.iushln(shift);\n }),\n (BN.prototype.invm = function (num) {\n return this.egcd(num).a.umod(num);\n }),\n (BN.prototype.isEven = function () {\n return (this.words[0] & 1) === 0;\n }),\n (BN.prototype.isOdd = function () {\n return (this.words[0] & 1) === 1;\n }),\n (BN.prototype.andln = function (num) {\n return this.words[0] & num;\n }),\n (BN.prototype.bincn = function (bit) {\n assert(typeof bit == \"number\");\n var r = bit % 26,\n s = (bit - r) / 26,\n q = 1 << r;\n if (this.length <= s) return this._expand(s + 1), (this.words[s] |= q), this;\n for (var carry = q, i = s; carry !== 0 && i < this.length; i++) {\n var w = this.words[i] | 0;\n (w += carry), (carry = w >>> 26), (w &= 67108863), (this.words[i] = w);\n }\n return carry !== 0 && ((this.words[i] = carry), this.length++), this;\n }),\n (BN.prototype.isZero = function () {\n return this.length === 1 && this.words[0] === 0;\n }),\n (BN.prototype.cmpn = function (num) {\n var negative = num < 0;\n if (this.negative !== 0 && !negative) return -1;\n if (this.negative === 0 && negative) return 1;\n this.strip();\n var res;\n if (this.length > 1) res = 1;\n else {\n negative && (num = -num), assert(num <= 67108863, \"Number is too big\");\n var w = this.words[0] | 0;\n res = w === num ? 0 : w < num ? -1 : 1;\n }\n return this.negative !== 0 ? -res | 0 : res;\n }),\n (BN.prototype.cmp = function (num) {\n if (this.negative !== 0 && num.negative === 0) return -1;\n if (this.negative === 0 && num.negative !== 0) return 1;\n var res = this.ucmp(num);\n return this.negative !== 0 ? -res | 0 : res;\n }),\n (BN.prototype.ucmp = function (num) {\n if (this.length > num.length) return 1;\n if (this.length < num.length) return -1;\n for (var res = 0, i = this.length - 1; i >= 0; i--) {\n var a = this.words[i] | 0,\n b = num.words[i] | 0;\n if (a !== b) {\n a < b ? (res = -1) : a > b && (res = 1);\n break;\n }\n }\n return res;\n }),\n (BN.prototype.gtn = function (num) {\n return this.cmpn(num) === 1;\n }),\n (BN.prototype.gt = function (num) {\n return this.cmp(num) === 1;\n }),\n (BN.prototype.gten = function (num) {\n return this.cmpn(num) >= 0;\n }),\n (BN.prototype.gte = function (num) {\n return this.cmp(num) >= 0;\n }),\n (BN.prototype.ltn = function (num) {\n return this.cmpn(num) === -1;\n }),\n (BN.prototype.lt = function (num) {\n return this.cmp(num) === -1;\n }),\n (BN.prototype.lten = function (num) {\n return this.cmpn(num) <= 0;\n }),\n (BN.prototype.lte = function (num) {\n return this.cmp(num) <= 0;\n }),\n (BN.prototype.eqn = function (num) {\n return this.cmpn(num) === 0;\n }),\n (BN.prototype.eq = function (num) {\n return this.cmp(num) === 0;\n }),\n (BN.red = function (num) {\n return new Red(num);\n }),\n (BN.prototype.toRed = function (ctx) {\n return (\n assert(!this.red, \"Already a number in reduction context\"),\n assert(this.negative === 0, \"red works only with positives\"),\n ctx.convertTo(this)._forceRed(ctx)\n );\n }),\n (BN.prototype.fromRed = function () {\n return assert(this.red, \"fromRed works only with numbers in reduction context\"), this.red.convertFrom(this);\n }),\n (BN.prototype._forceRed = function (ctx) {\n return (this.red = ctx), this;\n }),\n (BN.prototype.forceRed = function (ctx) {\n return assert(!this.red, \"Already a number in reduction context\"), this._forceRed(ctx);\n }),\n (BN.prototype.redAdd = function (num) {\n return assert(this.red, \"redAdd works only with red numbers\"), this.red.add(this, num);\n }),\n (BN.prototype.redIAdd = function (num) {\n return assert(this.red, \"redIAdd works only with red numbers\"), this.red.iadd(this, num);\n }),\n (BN.prototype.redSub = function (num) {\n return assert(this.red, \"redSub works only with red numbers\"), this.red.sub(this, num);\n }),\n (BN.prototype.redISub = function (num) {\n return assert(this.red, \"redISub works only with red numbers\"), this.red.isub(this, num);\n }),\n (BN.prototype.redShl = function (num) {\n return assert(this.red, \"redShl works only with red numbers\"), this.red.shl(this, num);\n }),\n (BN.prototype.redMul = function (num) {\n return (\n assert(this.red, \"redMul works only with red numbers\"),\n this.red._verify2(this, num),\n this.red.mul(this, num)\n );\n }),\n (BN.prototype.redIMul = function (num) {\n return (\n assert(this.red, \"redMul works only with red numbers\"),\n this.red._verify2(this, num),\n this.red.imul(this, num)\n );\n }),\n (BN.prototype.redSqr = function () {\n return assert(this.red, \"redSqr works only with red numbers\"), this.red._verify1(this), this.red.sqr(this);\n }),\n (BN.prototype.redISqr = function () {\n return assert(this.red, \"redISqr works only with red numbers\"), this.red._verify1(this), this.red.isqr(this);\n }),\n (BN.prototype.redSqrt = function () {\n return assert(this.red, \"redSqrt works only with red numbers\"), this.red._verify1(this), this.red.sqrt(this);\n }),\n (BN.prototype.redInvm = function () {\n return assert(this.red, \"redInvm works only with red numbers\"), this.red._verify1(this), this.red.invm(this);\n }),\n (BN.prototype.redNeg = function () {\n return assert(this.red, \"redNeg works only with red numbers\"), this.red._verify1(this), this.red.neg(this);\n }),\n (BN.prototype.redPow = function (num) {\n return assert(this.red && !num.red, \"redPow(normalNum)\"), this.red._verify1(this), this.red.pow(this, num);\n });\n var primes = {\n k256: null,\n p224: null,\n p192: null,\n p25519: null,\n };\n function MPrime(name, p) {\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 (this.tmp = this._tmp());\n }\n (MPrime.prototype._tmp = function () {\n var tmp = new BN(null);\n return (tmp.words = new Array(Math.ceil(this.n / 13))), tmp;\n }),\n (MPrime.prototype.ireduce = function (num) {\n var r = num,\n rlen;\n do this.split(r, this.tmp), (r = this.imulK(r)), (r = r.iadd(this.tmp)), (rlen = r.bitLength());\n while (rlen > this.n);\n var cmp = rlen < this.n ? -1 : r.ucmp(this.p);\n return (\n cmp === 0\n ? ((r.words[0] = 0), (r.length = 1))\n : cmp > 0\n ? r.isub(this.p)\n : r.strip !== void 0\n ? r.strip()\n : r._strip(),\n r\n );\n }),\n (MPrime.prototype.split = function (input, out) {\n input.iushrn(this.n, 0, out);\n }),\n (MPrime.prototype.imulK = function (num) {\n return num.imul(this.k);\n });\n function K256() {\n MPrime.call(this, \"k256\", \"ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f\");\n }\n inherits(K256, MPrime),\n (K256.prototype.split = function (input, output) {\n for (var mask = 4194303, outLen = Math.min(input.length, 9), i = 0; i < outLen; i++)\n output.words[i] = input.words[i];\n if (((output.length = outLen), input.length <= 9)) {\n (input.words[0] = 0), (input.length = 1);\n return;\n }\n var prev = input.words[9];\n for (output.words[output.length++] = prev & mask, i = 10; i < input.length; i++) {\n var next = input.words[i] | 0;\n (input.words[i - 10] = ((next & mask) << 4) | (prev >>> 22)), (prev = next);\n }\n (prev >>>= 22),\n (input.words[i - 10] = prev),\n prev === 0 && input.length > 10 ? (input.length -= 10) : (input.length -= 9);\n }),\n (K256.prototype.imulK = function (num) {\n (num.words[num.length] = 0), (num.words[num.length + 1] = 0), (num.length += 2);\n for (var lo = 0, i = 0; i < num.length; i++) {\n var w = num.words[i] | 0;\n (lo += w * 977), (num.words[i] = lo & 67108863), (lo = w * 64 + ((lo / 67108864) | 0));\n }\n return (\n num.words[num.length - 1] === 0 && (num.length--, num.words[num.length - 1] === 0 && num.length--), num\n );\n });\n function P224() {\n MPrime.call(this, \"p224\", \"ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001\");\n }\n inherits(P224, MPrime);\n function P192() {\n MPrime.call(this, \"p192\", \"ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff\");\n }\n inherits(P192, MPrime);\n function P25519() {\n MPrime.call(this, \"25519\", \"7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed\");\n }\n inherits(P25519, MPrime),\n (P25519.prototype.imulK = function (num) {\n for (var carry = 0, i = 0; i < num.length; i++) {\n var hi = (num.words[i] | 0) * 19 + carry,\n lo = hi & 67108863;\n (hi >>>= 26), (num.words[i] = lo), (carry = hi);\n }\n return carry !== 0 && (num.words[num.length++] = carry), num;\n }),\n (BN._prime = function (name) {\n if (primes[name]) return primes[name];\n var prime2;\n if (name === \"k256\") prime2 = new K256();\n else if (name === \"p224\") prime2 = new P224();\n else if (name === \"p192\") prime2 = new P192();\n else if (name === \"p25519\") prime2 = new P25519();\n else throw new Error(\"Unknown prime \" + name);\n return (primes[name] = prime2), prime2;\n });\n function Red(m) {\n if (typeof m == \"string\") {\n var prime = BN._prime(m);\n (this.m = prime.p), (this.prime = prime);\n } else assert(m.gtn(1), \"modulus must be greater than 1\"), (this.m = m), (this.prime = null);\n }\n (Red.prototype._verify1 = function (a) {\n assert(a.negative === 0, \"red works only with positives\"), assert(a.red, \"red works only with red numbers\");\n }),\n (Red.prototype._verify2 = function (a, b) {\n assert((a.negative | b.negative) === 0, \"red works only with positives\"),\n assert(a.red && a.red === b.red, \"red works only with red numbers\");\n }),\n (Red.prototype.imod = function (a) {\n return this.prime ? this.prime.ireduce(a)._forceRed(this) : a.umod(this.m)._forceRed(this);\n }),\n (Red.prototype.neg = function (a) {\n return a.isZero() ? a.clone() : this.m.sub(a)._forceRed(this);\n }),\n (Red.prototype.add = function (a, b) {\n this._verify2(a, b);\n var res = a.add(b);\n return res.cmp(this.m) >= 0 && res.isub(this.m), res._forceRed(this);\n }),\n (Red.prototype.iadd = function (a, b) {\n this._verify2(a, b);\n var res = a.iadd(b);\n return res.cmp(this.m) >= 0 && res.isub(this.m), res;\n }),\n (Red.prototype.sub = function (a, b) {\n this._verify2(a, b);\n var res = a.sub(b);\n return res.cmpn(0) < 0 && res.iadd(this.m), res._forceRed(this);\n }),\n (Red.prototype.isub = function (a, b) {\n this._verify2(a, b);\n var res = a.isub(b);\n return res.cmpn(0) < 0 && res.iadd(this.m), res;\n }),\n (Red.prototype.shl = function (a, num) {\n return this._verify1(a), this.imod(a.ushln(num));\n }),\n (Red.prototype.imul = function (a, b) {\n return this._verify2(a, b), this.imod(a.imul(b));\n }),\n (Red.prototype.mul = function (a, b) {\n return this._verify2(a, b), this.imod(a.mul(b));\n }),\n (Red.prototype.isqr = function (a) {\n return this.imul(a, a.clone());\n }),\n (Red.prototype.sqr = function (a) {\n return this.mul(a, a);\n }),\n (Red.prototype.sqrt = function (a) {\n if (a.isZero()) return a.clone();\n var mod3 = this.m.andln(3);\n if ((assert(mod3 % 2 === 1), mod3 === 3)) {\n var pow = this.m.add(new BN(1)).iushrn(2);\n return this.pow(a, pow);\n }\n for (var q = this.m.subn(1), s = 0; !q.isZero() && q.andln(1) === 0; ) s++, q.iushrn(1);\n assert(!q.isZero());\n var one = new BN(1).toRed(this),\n nOne = one.redNeg(),\n lpow = this.m.subn(1).iushrn(1),\n z = this.m.bitLength();\n for (z = new BN(2 * z * z).toRed(this); this.pow(z, lpow).cmp(nOne) !== 0; ) z.redIAdd(nOne);\n for (\n var c = this.pow(z, q), r = this.pow(a, q.addn(1).iushrn(1)), t = this.pow(a, q), m = s;\n t.cmp(one) !== 0;\n\n ) {\n for (var tmp = t, i = 0; tmp.cmp(one) !== 0; i++) tmp = tmp.redSqr();\n assert(i < m);\n var b = this.pow(c, new BN(1).iushln(m - i - 1));\n (r = r.redMul(b)), (c = b.redSqr()), (t = t.redMul(c)), (m = i);\n }\n return r;\n }),\n (Red.prototype.invm = function (a) {\n var inv = a._invmp(this.m);\n return inv.negative !== 0 ? ((inv.negative = 0), this.imod(inv).redNeg()) : this.imod(inv);\n }),\n (Red.prototype.pow = function (a, num) {\n if (num.isZero()) return new BN(1).toRed(this);\n if (num.cmpn(1) === 0) return a.clone();\n var windowSize = 4,\n wnd = new Array(1 << windowSize);\n (wnd[0] = new BN(1).toRed(this)), (wnd[1] = a);\n for (var i = 2; i < wnd.length; i++) wnd[i] = this.mul(wnd[i - 1], a);\n var res = wnd[0],\n current = 0,\n currentLen = 0,\n start = num.bitLength() % 26;\n for (start === 0 && (start = 26), i = num.length - 1; i >= 0; i--) {\n for (var word = num.words[i], j = start - 1; j >= 0; j--) {\n var bit = (word >> j) & 1;\n if ((res !== wnd[0] && (res = this.sqr(res)), bit === 0 && current === 0)) {\n currentLen = 0;\n continue;\n }\n (current <<= 1),\n (current |= bit),\n currentLen++,\n !(currentLen !== windowSize && (i !== 0 || j !== 0)) &&\n ((res = this.mul(res, wnd[current])), (currentLen = 0), (current = 0));\n }\n start = 26;\n }\n return res;\n }),\n (Red.prototype.convertTo = function (num) {\n var r = num.umod(this.m);\n return r === num ? r.clone() : r;\n }),\n (Red.prototype.convertFrom = function (num) {\n var res = num.clone();\n return (res.red = null), res;\n }),\n (BN.mont = function (num) {\n return new Mont(num);\n });\n function Mont(m) {\n Red.call(this, m),\n (this.shift = this.m.bitLength()),\n this.shift % 26 !== 0 && (this.shift += 26 - (this.shift % 26)),\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 (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 (Mont.prototype.convertTo = function (num) {\n return this.imod(num.ushln(this.shift));\n }),\n (Mont.prototype.convertFrom = function (num) {\n var r = this.imod(num.mul(this.rinv));\n return (r.red = null), r;\n }),\n (Mont.prototype.imul = function (a, b) {\n if (a.isZero() || b.isZero()) return (a.words[0] = 0), (a.length = 1), a;\n var t = a.imul(b),\n c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m),\n u = t.isub(c).iushrn(this.shift),\n res = u;\n return (\n u.cmp(this.m) >= 0 ? (res = u.isub(this.m)) : u.cmpn(0) < 0 && (res = u.iadd(this.m)), res._forceRed(this)\n );\n }),\n (Mont.prototype.mul = function (a, b) {\n if (a.isZero() || b.isZero()) return new BN(0)._forceRed(this);\n var t = a.mul(b),\n c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m),\n u = t.isub(c).iushrn(this.shift),\n res = u;\n return (\n u.cmp(this.m) >= 0 ? (res = u.isub(this.m)) : u.cmpn(0) < 0 && (res = u.iadd(this.m)), res._forceRed(this)\n );\n }),\n (Mont.prototype.invm = function (a) {\n var res = this.imod(a._invmp(this.m).mul(this.r2));\n return res._forceRed(this);\n });\n })(typeof module > \"u\" || module, exports);\n },\n});\n\n// node_modules/create-ecdh/browser.js\nvar require_browser9 = __commonJS({\n \"node_modules/create-ecdh/browser.js\"(exports, module) {\n var elliptic = require_elliptic(),\n BN = require_bn6();\n module.exports = function (curve) {\n return new ECDH(curve);\n };\n var aliases = {\n secp256k1: {\n name: \"secp256k1\",\n byteLength: 32,\n },\n secp224r1: {\n name: \"p224\",\n byteLength: 28,\n },\n prime256v1: {\n name: \"p256\",\n byteLength: 32,\n },\n prime192v1: {\n name: \"p192\",\n byteLength: 24,\n },\n ed25519: {\n name: \"ed25519\",\n byteLength: 32,\n },\n secp384r1: {\n name: \"p384\",\n byteLength: 48,\n },\n secp521r1: {\n name: \"p521\",\n byteLength: 66,\n },\n };\n aliases.p224 = aliases.secp224r1;\n aliases.p256 = aliases.secp256r1 = aliases.prime256v1;\n aliases.p192 = aliases.secp192r1 = aliases.prime192v1;\n aliases.p384 = aliases.secp384r1;\n aliases.p521 = aliases.secp521r1;\n function ECDH(curve) {\n (this.curveType = aliases[curve]),\n this.curveType ||\n (this.curveType = {\n name: curve,\n }),\n (this.curve = new elliptic.ec(this.curveType.name)),\n (this.keys = void 0);\n }\n ECDH.prototype.generateKeys = function (enc, format) {\n return (this.keys = this.curve.genKeyPair()), this.getPublicKey(enc, format);\n };\n ECDH.prototype.computeSecret = function (other, inenc, enc) {\n (inenc = inenc || \"utf8\"), Buffer.isBuffer(other) || (other = new Buffer(other, inenc));\n var otherPub = this.curve.keyFromPublic(other).getPublic(),\n out = otherPub.mul(this.keys.getPrivate()).getX();\n return formatReturnValue(out, enc, this.curveType.byteLength);\n };\n ECDH.prototype.getPublicKey = function (enc, format) {\n var key = this.keys.getPublic(format === \"compressed\", !0);\n return (\n format === \"hybrid\" && (key[key.length - 1] % 2 ? (key[0] = 7) : (key[0] = 6)), formatReturnValue(key, enc)\n );\n };\n ECDH.prototype.getPrivateKey = function (enc) {\n return formatReturnValue(this.keys.getPrivate(), enc);\n };\n ECDH.prototype.setPublicKey = function (pub, enc) {\n return (\n (enc = enc || \"utf8\"), Buffer.isBuffer(pub) || (pub = new Buffer(pub, enc)), this.keys._importPublic(pub), this\n );\n };\n ECDH.prototype.setPrivateKey = function (priv, enc) {\n (enc = enc || \"utf8\"), Buffer.isBuffer(priv) || (priv = new Buffer(priv, enc));\n var _priv = new BN(priv);\n return (_priv = _priv.toString(16)), (this.keys = this.curve.genKeyPair()), this.keys._importPrivate(_priv), this;\n };\n function formatReturnValue(bn, enc, len) {\n Array.isArray(bn) || (bn = bn.toArray());\n var buf = new Buffer(bn);\n if (len && buf.length < len) {\n var zeros = new Buffer(len - buf.length);\n zeros.fill(0), (buf = Buffer.concat([zeros, buf]));\n }\n return enc ? buf.toString(enc) : buf;\n }\n },\n});\n\n// node_modules/public-encrypt/mgf.js\nvar require_mgf = __commonJS({\n \"node_modules/public-encrypt/mgf.js\"(exports, module) {\n var createHash = require_browser2(),\n Buffer2 = require_safe_buffer().Buffer;\n module.exports = function (seed, len) {\n for (var t = Buffer2.alloc(0), i = 0, c; t.length < len; )\n (c = i2ops(i++)), (t = Buffer2.concat([t, createHash(\"sha1\").update(seed).update(c).digest()]));\n return t.slice(0, len);\n };\n function i2ops(c) {\n var out = Buffer2.allocUnsafe(4);\n return out.writeUInt32BE(c, 0), out;\n }\n },\n});\n\n// node_modules/public-encrypt/xor.js\nvar require_xor = __commonJS({\n \"node_modules/public-encrypt/xor.js\"(exports, module) {\n module.exports = function (a, b) {\n for (var len = a.length, i = -1; ++i < len; ) a[i] ^= b[i];\n return a;\n };\n },\n});\n\n// node_modules/public-encrypt/node_modules/bn.js/lib/bn.js\nvar require_bn7 = __commonJS({\n \"node_modules/public-encrypt/node_modules/bn.js/lib/bn.js\"(exports, module) {\n (function (module2, exports2) {\n \"use strict\";\n function assert(val, msg) {\n if (!val) throw new Error(msg || \"Assertion failed\");\n }\n function inherits(ctor, superCtor) {\n ctor.super_ = superCtor;\n var TempCtor = function () {};\n (TempCtor.prototype = superCtor.prototype),\n (ctor.prototype = new TempCtor()),\n (ctor.prototype.constructor = ctor);\n }\n function BN(number, base, endian) {\n if (BN.isBN(number)) return number;\n (this.negative = 0),\n (this.words = null),\n (this.length = 0),\n (this.red = null),\n number !== null &&\n ((base === \"le\" || base === \"be\") && ((endian = base), (base = 10)),\n this._init(number || 0, base || 10, endian || \"be\"));\n }\n typeof module2 == \"object\" ? (module2.exports = BN) : (exports2.BN = BN), (BN.BN = BN), (BN.wordSize = 26);\n var Buffer2 = globalThis.Buffer;\n (BN.isBN = function (num) {\n return num instanceof BN\n ? !0\n : num !== null &&\n typeof num == \"object\" &&\n num.constructor.wordSize === BN.wordSize &&\n Array.isArray(num.words);\n }),\n (BN.max = function (left, right) {\n return left.cmp(right) > 0 ? left : right;\n }),\n (BN.min = function (left, right) {\n return left.cmp(right) < 0 ? left : right;\n }),\n (BN.prototype._init = function (number, base, endian) {\n if (typeof number == \"number\") return this._initNumber(number, base, endian);\n if (typeof number == \"object\") return this._initArray(number, base, endian);\n base === \"hex\" && (base = 16),\n assert(base === (base | 0) && base >= 2 && base <= 36),\n (number = number.toString().replace(/\\s+/g, \"\"));\n var start = 0;\n number[0] === \"-\" && (start++, (this.negative = 1)),\n start < number.length &&\n (base === 16\n ? this._parseHex(number, start, endian)\n : (this._parseBase(number, base, start),\n endian === \"le\" && this._initArray(this.toArray(), base, endian)));\n }),\n (BN.prototype._initNumber = function (number, base, endian) {\n number < 0 && ((this.negative = 1), (number = -number)),\n number < 67108864\n ? ((this.words = [number & 67108863]), (this.length = 1))\n : number < 4503599627370496\n ? ((this.words = [number & 67108863, (number / 67108864) & 67108863]), (this.length = 2))\n : (assert(number < 9007199254740992),\n (this.words = [number & 67108863, (number / 67108864) & 67108863, 1]),\n (this.length = 3)),\n endian === \"le\" && this._initArray(this.toArray(), base, endian);\n }),\n (BN.prototype._initArray = function (number, base, endian) {\n if ((assert(typeof number.length == \"number\"), number.length <= 0))\n return (this.words = [0]), (this.length = 1), this;\n (this.length = Math.ceil(number.length / 3)), (this.words = new Array(this.length));\n for (var i = 0; i < this.length; i++) this.words[i] = 0;\n var j,\n w,\n off = 0;\n if (endian === \"be\")\n for (i = number.length - 1, j = 0; i >= 0; i -= 3)\n (w = number[i] | (number[i - 1] << 8) | (number[i - 2] << 16)),\n (this.words[j] |= (w << off) & 67108863),\n (this.words[j + 1] = (w >>> (26 - off)) & 67108863),\n (off += 24),\n off >= 26 && ((off -= 26), j++);\n else if (endian === \"le\")\n for (i = 0, j = 0; i < number.length; i += 3)\n (w = number[i] | (number[i + 1] << 8) | (number[i + 2] << 16)),\n (this.words[j] |= (w << off) & 67108863),\n (this.words[j + 1] = (w >>> (26 - off)) & 67108863),\n (off += 24),\n off >= 26 && ((off -= 26), j++);\n return this.strip();\n });\n function parseHex4Bits(string, index) {\n var c = string.charCodeAt(index);\n return c >= 65 && c <= 70 ? c - 55 : c >= 97 && c <= 102 ? c - 87 : (c - 48) & 15;\n }\n function parseHexByte(string, lowerBound, index) {\n var r = parseHex4Bits(string, index);\n return index - 1 >= lowerBound && (r |= parseHex4Bits(string, index - 1) << 4), r;\n }\n BN.prototype._parseHex = function (number, start, endian) {\n (this.length = Math.ceil((number.length - start) / 6)), (this.words = new Array(this.length));\n for (var i = 0; i < this.length; i++) this.words[i] = 0;\n var off = 0,\n j = 0,\n w;\n if (endian === \"be\")\n for (i = number.length - 1; i >= start; i -= 2)\n (w = parseHexByte(number, start, i) << off),\n (this.words[j] |= w & 67108863),\n off >= 18 ? ((off -= 18), (j += 1), (this.words[j] |= w >>> 26)) : (off += 8);\n else {\n var parseLength = number.length - start;\n for (i = parseLength % 2 === 0 ? start + 1 : start; i < number.length; i += 2)\n (w = parseHexByte(number, start, i) << off),\n (this.words[j] |= w & 67108863),\n off >= 18 ? ((off -= 18), (j += 1), (this.words[j] |= w >>> 26)) : (off += 8);\n }\n this.strip();\n };\n function parseBase(str, start, end, mul) {\n for (var r = 0, len = Math.min(str.length, end), i = start; i < len; i++) {\n var c = str.charCodeAt(i) - 48;\n (r *= mul), c >= 49 ? (r += c - 49 + 10) : c >= 17 ? (r += c - 17 + 10) : (r += c);\n }\n return r;\n }\n (BN.prototype._parseBase = function (number, base, start) {\n (this.words = [0]), (this.length = 1);\n for (var limbLen = 0, limbPow = 1; limbPow <= 67108863; limbPow *= base) limbLen++;\n limbLen--, (limbPow = (limbPow / base) | 0);\n for (\n var total = number.length - start,\n mod = total % limbLen,\n end = Math.min(total, total - mod) + start,\n word = 0,\n i = start;\n i < end;\n i += limbLen\n )\n (word = parseBase(number, i, i + limbLen, base)),\n this.imuln(limbPow),\n this.words[0] + word < 67108864 ? (this.words[0] += word) : this._iaddn(word);\n if (mod !== 0) {\n var pow = 1;\n for (word = parseBase(number, i, number.length, base), i = 0; i < mod; i++) pow *= base;\n this.imuln(pow), this.words[0] + word < 67108864 ? (this.words[0] += word) : this._iaddn(word);\n }\n this.strip();\n }),\n (BN.prototype.copy = function (dest) {\n dest.words = new Array(this.length);\n for (var i = 0; i < this.length; i++) dest.words[i] = this.words[i];\n (dest.length = this.length), (dest.negative = this.negative), (dest.red = this.red);\n }),\n (BN.prototype.clone = function () {\n var r = new BN(null);\n return this.copy(r), r;\n }),\n (BN.prototype._expand = function (size) {\n for (; this.length < size; ) this.words[this.length++] = 0;\n return this;\n }),\n (BN.prototype.strip = function () {\n for (; this.length > 1 && this.words[this.length - 1] === 0; ) this.length--;\n return this._normSign();\n }),\n (BN.prototype._normSign = function () {\n return this.length === 1 && this.words[0] === 0 && (this.negative = 0), this;\n }),\n (BN.prototype.inspect = function () {\n return (this.red ? \"<BN-R: \" : \"<BN: \") + this.toString(16) + \">\";\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 groupSizes = [\n 0, 0, 25, 16, 12, 11, 10, 9, 8, 8, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5,\n 5, 5,\n ],\n groupBases = [\n 0, 0, 33554432, 43046721, 16777216, 48828125, 60466176, 40353607, 16777216, 43046721, 1e7, 19487171, 35831808,\n 62748517, 7529536, 11390625, 16777216, 24137569, 34012224, 47045881, 64e6, 4084101, 5153632, 6436343, 7962624,\n 9765625, 11881376, 14348907, 17210368, 20511149, 243e5, 28629151, 33554432, 39135393, 45435424, 52521875,\n 60466176,\n ];\n (BN.prototype.toString = function (base, padding) {\n (base = base || 10), (padding = padding | 0 || 1);\n var out;\n if (base === 16 || base === \"hex\") {\n out = \"\";\n for (var off = 0, carry = 0, i = 0; i < this.length; i++) {\n var w = this.words[i],\n word = (((w << off) | carry) & 16777215).toString(16);\n (carry = (w >>> (24 - off)) & 16777215),\n carry !== 0 || i !== this.length - 1 ? (out = zeros[6 - word.length] + word + out) : (out = word + out),\n (off += 2),\n off >= 26 && ((off -= 26), i--);\n }\n for (carry !== 0 && (out = carry.toString(16) + out); out.length % padding !== 0; ) out = \"0\" + out;\n return this.negative !== 0 && (out = \"-\" + out), out;\n }\n if (base === (base | 0) && base >= 2 && base <= 36) {\n var groupSize = groupSizes[base],\n groupBase = groupBases[base];\n out = \"\";\n var c = this.clone();\n for (c.negative = 0; !c.isZero(); ) {\n var r = c.modn(groupBase).toString(base);\n (c = c.idivn(groupBase)), c.isZero() ? (out = r + out) : (out = zeros[groupSize - r.length] + r + out);\n }\n for (this.isZero() && (out = \"0\" + out); out.length % padding !== 0; ) out = \"0\" + out;\n return this.negative !== 0 && (out = \"-\" + out), out;\n }\n assert(!1, \"Base should be between 2 and 36\");\n }),\n (BN.prototype.toNumber = function () {\n var ret = this.words[0];\n return (\n this.length === 2\n ? (ret += this.words[1] * 67108864)\n : this.length === 3 && this.words[2] === 1\n ? (ret += 4503599627370496 + this.words[1] * 67108864)\n : this.length > 2 && assert(!1, \"Number can only safely store up to 53 bits\"),\n this.negative !== 0 ? -ret : ret\n );\n }),\n (BN.prototype.toJSON = function () {\n return this.toString(16);\n }),\n (BN.prototype.toBuffer = function (endian, length) {\n return assert(typeof Buffer2 < \"u\"), this.toArrayLike(Buffer2, endian, length);\n }),\n (BN.prototype.toArray = function (endian, length) {\n return this.toArrayLike(Array, endian, length);\n }),\n (BN.prototype.toArrayLike = function (ArrayType, endian, length) {\n var byteLength = this.byteLength(),\n 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 this.strip();\n var littleEndian = endian === \"le\",\n res = new ArrayType(reqLength),\n b,\n i,\n q = this.clone();\n if (littleEndian) {\n for (i = 0; !q.isZero(); i++) (b = q.andln(255)), q.iushrn(8), (res[i] = b);\n for (; i < reqLength; i++) res[i] = 0;\n } else {\n for (i = 0; i < reqLength - byteLength; i++) res[i] = 0;\n for (i = 0; !q.isZero(); i++) (b = q.andln(255)), q.iushrn(8), (res[reqLength - i - 1] = b);\n }\n return res;\n }),\n Math.clz32\n ? (BN.prototype._countBits = function (w) {\n return 32 - Math.clz32(w);\n })\n : (BN.prototype._countBits = function (w) {\n var t = w,\n r = 0;\n return (\n t >= 4096 && ((r += 13), (t >>>= 13)),\n t >= 64 && ((r += 7), (t >>>= 7)),\n t >= 8 && ((r += 4), (t >>>= 4)),\n t >= 2 && ((r += 2), (t >>>= 2)),\n r + t\n );\n }),\n (BN.prototype._zeroBits = function (w) {\n if (w === 0) return 26;\n var t = w,\n r = 0;\n return (\n (t & 8191) === 0 && ((r += 13), (t >>>= 13)),\n (t & 127) === 0 && ((r += 7), (t >>>= 7)),\n (t & 15) === 0 && ((r += 4), (t >>>= 4)),\n (t & 3) === 0 && ((r += 2), (t >>>= 2)),\n (t & 1) === 0 && r++,\n r\n );\n }),\n (BN.prototype.bitLength = function () {\n var w = this.words[this.length - 1],\n hi = this._countBits(w);\n return (this.length - 1) * 26 + hi;\n });\n function toBitArray(num) {\n for (var w = new Array(num.bitLength()), bit = 0; bit < w.length; bit++) {\n var off = (bit / 26) | 0,\n wbit = bit % 26;\n w[bit] = (num.words[off] & (1 << wbit)) >>> wbit;\n }\n return w;\n }\n (BN.prototype.zeroBits = function () {\n if (this.isZero()) return 0;\n for (var r = 0, i = 0; i < this.length; i++) {\n var b = this._zeroBits(this.words[i]);\n if (((r += b), b !== 26)) break;\n }\n return r;\n }),\n (BN.prototype.byteLength = function () {\n return Math.ceil(this.bitLength() / 8);\n }),\n (BN.prototype.toTwos = function (width) {\n return this.negative !== 0 ? this.abs().inotn(width).iaddn(1) : this.clone();\n }),\n (BN.prototype.fromTwos = function (width) {\n return this.testn(width - 1) ? this.notn(width).iaddn(1).ineg() : this.clone();\n }),\n (BN.prototype.isNeg = function () {\n return this.negative !== 0;\n }),\n (BN.prototype.neg = function () {\n return this.clone().ineg();\n }),\n (BN.prototype.ineg = function () {\n return this.isZero() || (this.negative ^= 1), this;\n }),\n (BN.prototype.iuor = function (num) {\n for (; this.length < num.length; ) this.words[this.length++] = 0;\n for (var i = 0; i < num.length; i++) this.words[i] = this.words[i] | num.words[i];\n return this.strip();\n }),\n (BN.prototype.ior = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuor(num);\n }),\n (BN.prototype.or = function (num) {\n return this.length > num.length ? this.clone().ior(num) : num.clone().ior(this);\n }),\n (BN.prototype.uor = function (num) {\n return this.length > num.length ? this.clone().iuor(num) : num.clone().iuor(this);\n }),\n (BN.prototype.iuand = function (num) {\n var b;\n this.length > num.length ? (b = num) : (b = this);\n for (var i = 0; i < b.length; i++) this.words[i] = this.words[i] & num.words[i];\n return (this.length = b.length), this.strip();\n }),\n (BN.prototype.iand = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuand(num);\n }),\n (BN.prototype.and = function (num) {\n return this.length > num.length ? this.clone().iand(num) : num.clone().iand(this);\n }),\n (BN.prototype.uand = function (num) {\n return this.length > num.length ? this.clone().iuand(num) : num.clone().iuand(this);\n }),\n (BN.prototype.iuxor = function (num) {\n var a, b;\n this.length > num.length ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var i = 0; i < b.length; i++) this.words[i] = a.words[i] ^ b.words[i];\n if (this !== a) for (; i < a.length; i++) this.words[i] = a.words[i];\n return (this.length = a.length), this.strip();\n }),\n (BN.prototype.ixor = function (num) {\n return assert((this.negative | num.negative) === 0), this.iuxor(num);\n }),\n (BN.prototype.xor = function (num) {\n return this.length > num.length ? this.clone().ixor(num) : num.clone().ixor(this);\n }),\n (BN.prototype.uxor = function (num) {\n return this.length > num.length ? this.clone().iuxor(num) : num.clone().iuxor(this);\n }),\n (BN.prototype.inotn = function (width) {\n assert(typeof width == \"number\" && width >= 0);\n var bytesNeeded = Math.ceil(width / 26) | 0,\n bitsLeft = width % 26;\n this._expand(bytesNeeded), bitsLeft > 0 && bytesNeeded--;\n for (var i = 0; i < bytesNeeded; i++) this.words[i] = ~this.words[i] & 67108863;\n return bitsLeft > 0 && (this.words[i] = ~this.words[i] & (67108863 >> (26 - bitsLeft))), this.strip();\n }),\n (BN.prototype.notn = function (width) {\n return this.clone().inotn(width);\n }),\n (BN.prototype.setn = function (bit, val) {\n assert(typeof bit == \"number\" && bit >= 0);\n var off = (bit / 26) | 0,\n wbit = bit % 26;\n return (\n this._expand(off + 1),\n val\n ? (this.words[off] = this.words[off] | (1 << wbit))\n : (this.words[off] = this.words[off] & ~(1 << wbit)),\n this.strip()\n );\n }),\n (BN.prototype.iadd = function (num) {\n var r;\n if (this.negative !== 0 && num.negative === 0)\n return (this.negative = 0), (r = this.isub(num)), (this.negative ^= 1), this._normSign();\n if (this.negative === 0 && num.negative !== 0)\n return (num.negative = 0), (r = this.isub(num)), (num.negative = 1), r._normSign();\n var a, b;\n this.length > num.length ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var carry = 0, i = 0; i < b.length; i++)\n (r = (a.words[i] | 0) + (b.words[i] | 0) + carry), (this.words[i] = r & 67108863), (carry = r >>> 26);\n for (; carry !== 0 && i < a.length; i++)\n (r = (a.words[i] | 0) + carry), (this.words[i] = r & 67108863), (carry = r >>> 26);\n if (((this.length = a.length), carry !== 0)) (this.words[this.length] = carry), this.length++;\n else if (a !== this) for (; i < a.length; i++) this.words[i] = a.words[i];\n return this;\n }),\n (BN.prototype.add = function (num) {\n var res;\n return num.negative !== 0 && this.negative === 0\n ? ((num.negative = 0), (res = this.sub(num)), (num.negative ^= 1), res)\n : num.negative === 0 && this.negative !== 0\n ? ((this.negative = 0), (res = num.sub(this)), (this.negative = 1), res)\n : this.length > num.length\n ? this.clone().iadd(num)\n : num.clone().iadd(this);\n }),\n (BN.prototype.isub = function (num) {\n if (num.negative !== 0) {\n num.negative = 0;\n var r = this.iadd(num);\n return (num.negative = 1), r._normSign();\n } else if (this.negative !== 0)\n return (this.negative = 0), this.iadd(num), (this.negative = 1), this._normSign();\n var cmp = this.cmp(num);\n if (cmp === 0) return (this.negative = 0), (this.length = 1), (this.words[0] = 0), this;\n var a, b;\n cmp > 0 ? ((a = this), (b = num)) : ((a = num), (b = this));\n for (var carry = 0, i = 0; i < b.length; i++)\n (r = (a.words[i] | 0) - (b.words[i] | 0) + carry), (carry = r >> 26), (this.words[i] = r & 67108863);\n for (; carry !== 0 && i < a.length; i++)\n (r = (a.words[i] | 0) + carry), (carry = r >> 26), (this.words[i] = r & 67108863);\n if (carry === 0 && i < a.length && a !== this) for (; i < a.length; i++) this.words[i] = a.words[i];\n return (this.length = Math.max(this.length, i)), a !== this && (this.negative = 1), this.strip();\n }),\n (BN.prototype.sub = function (num) {\n return this.clone().isub(num);\n });\n function smallMulTo(self2, num, out) {\n out.negative = num.negative ^ self2.negative;\n var len = (self2.length + num.length) | 0;\n (out.length = len), (len = (len - 1) | 0);\n var a = self2.words[0] | 0,\n b = num.words[0] | 0,\n r = a * b,\n lo = r & 67108863,\n carry = (r / 67108864) | 0;\n out.words[0] = lo;\n for (var k = 1; k < len; k++) {\n for (\n var ncarry = carry >>> 26,\n rword = carry & 67108863,\n maxJ = Math.min(k, num.length - 1),\n j = Math.max(0, k - self2.length + 1);\n j <= maxJ;\n j++\n ) {\n var i = (k - j) | 0;\n (a = self2.words[i] | 0),\n (b = num.words[j] | 0),\n (r = a * b + rword),\n (ncarry += (r / 67108864) | 0),\n (rword = r & 67108863);\n }\n (out.words[k] = rword | 0), (carry = ncarry | 0);\n }\n return carry !== 0 ? (out.words[k] = carry | 0) : out.length--, out.strip();\n }\n var comb10MulTo = function (self2, num, out) {\n var a = self2.words,\n b = num.words,\n o = out.words,\n c = 0,\n lo,\n mid,\n hi,\n a0 = a[0] | 0,\n al0 = a0 & 8191,\n ah0 = a0 >>> 13,\n a1 = a[1] | 0,\n al1 = a1 & 8191,\n ah1 = a1 >>> 13,\n a2 = a[2] | 0,\n al2 = a2 & 8191,\n ah2 = a2 >>> 13,\n a3 = a[3] | 0,\n al3 = a3 & 8191,\n ah3 = a3 >>> 13,\n a4 = a[4] | 0,\n al4 = a4 & 8191,\n ah4 = a4 >>> 13,\n a5 = a[5] | 0,\n al5 = a5 & 8191,\n ah5 = a5 >>> 13,\n a6 = a[6] | 0,\n al6 = a6 & 8191,\n ah6 = a6 >>> 13,\n a7 = a[7] | 0,\n al7 = a7 & 8191,\n ah7 = a7 >>> 13,\n a8 = a[8] | 0,\n al8 = a8 & 8191,\n ah8 = a8 >>> 13,\n a9 = a[9] | 0,\n al9 = a9 & 8191,\n ah9 = a9 >>> 13,\n b0 = b[0] | 0,\n bl0 = b0 & 8191,\n bh0 = b0 >>> 13,\n b1 = b[1] | 0,\n bl1 = b1 & 8191,\n bh1 = b1 >>> 13,\n b2 = b[2] | 0,\n bl2 = b2 & 8191,\n bh2 = b2 >>> 13,\n b3 = b[3] | 0,\n bl3 = b3 & 8191,\n bh3 = b3 >>> 13,\n b4 = b[4] | 0,\n bl4 = b4 & 8191,\n bh4 = b4 >>> 13,\n b5 = b[5] | 0,\n bl5 = b5 & 8191,\n bh5 = b5 >>> 13,\n b6 = b[6] | 0,\n bl6 = b6 & 8191,\n bh6 = b6 >>> 13,\n b7 = b[7] | 0,\n bl7 = b7 & 8191,\n bh7 = b7 >>> 13,\n b8 = b[8] | 0,\n bl8 = b8 & 8191,\n bh8 = b8 >>> 13,\n b9 = b[9] | 0,\n bl9 = b9 & 8191,\n bh9 = b9 >>> 13;\n (out.negative = self2.negative ^ num.negative),\n (out.length = 19),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w0 >>> 26)) | 0),\n (w0 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w1 >>> 26)) | 0),\n (w1 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w2 >>> 26)) | 0),\n (w2 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w3 >>> 26)) | 0),\n (w3 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w4 >>> 26)) | 0),\n (w4 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w5 >>> 26)) | 0),\n (w5 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w6 >>> 26)) | 0),\n (w6 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w7 >>> 26)) | 0),\n (w7 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w8 >>> 26)) | 0),\n (w8 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w9 >>> 26)) | 0),\n (w9 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w10 >>> 26)) | 0),\n (w10 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w11 >>> 26)) | 0),\n (w11 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w12 >>> 26)) | 0),\n (w12 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w13 >>> 26)) | 0),\n (w13 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w14 >>> 26)) | 0),\n (w14 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w15 >>> 26)) | 0),\n (w15 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w16 >>> 26)) | 0),\n (w16 &= 67108863),\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 & 8191) << 13)) | 0;\n (c = (((hi + (mid >>> 13)) | 0) + (w17 >>> 26)) | 0),\n (w17 &= 67108863),\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 & 8191) << 13)) | 0;\n return (\n (c = (((hi + (mid >>> 13)) | 0) + (w18 >>> 26)) | 0),\n (w18 &= 67108863),\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 c !== 0 && ((o[19] = c), out.length++),\n out\n );\n };\n Math.imul || (comb10MulTo = smallMulTo);\n function bigMulTo(self2, num, out) {\n (out.negative = num.negative ^ self2.negative), (out.length = self2.length + num.length);\n for (var carry = 0, hncarry = 0, k = 0; k < out.length - 1; k++) {\n var ncarry = hncarry;\n hncarry = 0;\n for (\n var rword = carry & 67108863, maxJ = Math.min(k, num.length - 1), j = Math.max(0, k - self2.length + 1);\n j <= maxJ;\n j++\n ) {\n var i = k - j,\n a = self2.words[i] | 0,\n b = num.words[j] | 0,\n r = a * b,\n lo = r & 67108863;\n (ncarry = (ncarry + ((r / 67108864) | 0)) | 0),\n (lo = (lo + rword) | 0),\n (rword = lo & 67108863),\n (ncarry = (ncarry + (lo >>> 26)) | 0),\n (hncarry += ncarry >>> 26),\n (ncarry &= 67108863);\n }\n (out.words[k] = rword), (carry = ncarry), (ncarry = hncarry);\n }\n return carry !== 0 ? (out.words[k] = carry) : out.length--, out.strip();\n }\n function jumboMulTo(self2, num, out) {\n var fftm = new FFTM();\n return fftm.mulp(self2, num, out);\n }\n BN.prototype.mulTo = function (num, out) {\n var res,\n len = this.length + num.length;\n return (\n this.length === 10 && num.length === 10\n ? (res = comb10MulTo(this, num, out))\n : len < 63\n ? (res = smallMulTo(this, num, out))\n : len < 1024\n ? (res = bigMulTo(this, num, out))\n : (res = jumboMulTo(this, num, out)),\n res\n );\n };\n function FFTM(x, y) {\n (this.x = x), (this.y = y);\n }\n (FFTM.prototype.makeRBT = function (N) {\n for (var t = new Array(N), l = BN.prototype._countBits(N) - 1, i = 0; i < N; i++) t[i] = this.revBin(i, l, N);\n return t;\n }),\n (FFTM.prototype.revBin = function (x, l, N) {\n if (x === 0 || x === N - 1) return x;\n for (var rb = 0, i = 0; i < l; i++) (rb |= (x & 1) << (l - i - 1)), (x >>= 1);\n return rb;\n }),\n (FFTM.prototype.permute = function (rbt, rws, iws, rtws, itws, N) {\n for (var i = 0; i < N; i++) (rtws[i] = rws[rbt[i]]), (itws[i] = iws[rbt[i]]);\n }),\n (FFTM.prototype.transform = function (rws, iws, rtws, itws, N, rbt) {\n this.permute(rbt, rws, iws, rtws, itws, N);\n for (var s = 1; s < N; s <<= 1)\n for (\n var l = s << 1, rtwdf = Math.cos((2 * Math.PI) / l), itwdf = Math.sin((2 * Math.PI) / l), p = 0;\n p < N;\n p += l\n )\n for (var rtwdf_ = rtwdf, itwdf_ = itwdf, j = 0; j < s; j++) {\n var re = rtws[p + j],\n ie = itws[p + j],\n ro = rtws[p + j + s],\n io = itws[p + j + s],\n rx = rtwdf_ * ro - itwdf_ * io;\n (io = rtwdf_ * io + itwdf_ * ro),\n (ro = rx),\n (rtws[p + j] = re + ro),\n (itws[p + j] = ie + io),\n (rtws[p + j + s] = re - ro),\n (itws[p + j + s] = ie - io),\n j !== l &&\n ((rx = rtwdf * rtwdf_ - itwdf * itwdf_), (itwdf_ = rtwdf * itwdf_ + itwdf * rtwdf_), (rtwdf_ = rx));\n }\n }),\n (FFTM.prototype.guessLen13b = function (n, m) {\n var N = Math.max(m, n) | 1,\n odd = N & 1,\n i = 0;\n for (N = (N / 2) | 0; N; N = N >>> 1) i++;\n return 1 << (i + 1 + odd);\n }),\n (FFTM.prototype.conjugate = function (rws, iws, N) {\n if (!(N <= 1))\n for (var i = 0; i < N / 2; i++) {\n var t = rws[i];\n (rws[i] = rws[N - i - 1]),\n (rws[N - i - 1] = t),\n (t = iws[i]),\n (iws[i] = -iws[N - i - 1]),\n (iws[N - i - 1] = -t);\n }\n }),\n (FFTM.prototype.normalize13b = function (ws, N) {\n for (var carry = 0, i = 0; i < N / 2; i++) {\n var w = Math.round(ws[2 * i + 1] / N) * 8192 + Math.round(ws[2 * i] / N) + carry;\n (ws[i] = w & 67108863), w < 67108864 ? (carry = 0) : (carry = (w / 67108864) | 0);\n }\n return ws;\n }),\n (FFTM.prototype.convert13b = function (ws, len, rws, N) {\n for (var carry = 0, i = 0; i < len; i++)\n (carry = carry + (ws[i] | 0)),\n (rws[2 * i] = carry & 8191),\n (carry = carry >>> 13),\n (rws[2 * i + 1] = carry & 8191),\n (carry = carry >>> 13);\n for (i = 2 * len; i < N; ++i) rws[i] = 0;\n assert(carry === 0), assert((carry & -8192) === 0);\n }),\n (FFTM.prototype.stub = function (N) {\n for (var ph = new Array(N), i = 0; i < N; i++) ph[i] = 0;\n return ph;\n }),\n (FFTM.prototype.mulp = function (x, y, out) {\n var N = 2 * this.guessLen13b(x.length, y.length),\n rbt = this.makeRBT(N),\n _ = this.stub(N),\n rws = new Array(N),\n rwst = new Array(N),\n iwst = new Array(N),\n nrws = new Array(N),\n nrwst = new Array(N),\n niwst = new Array(N),\n rmws = out.words;\n (rmws.length = N),\n this.convert13b(x.words, x.length, rws, N),\n this.convert13b(y.words, y.length, nrws, N),\n this.transform(rws, _, rwst, iwst, N, rbt),\n this.transform(nrws, _, nrwst, niwst, N, rbt);\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]), (rwst[i] = rx);\n }\n return (\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 (out.negative = x.negative ^ y.negative),\n (out.length = x.length + y.length),\n out.strip()\n );\n }),\n (BN.prototype.mul = function (num) {\n var out = new BN(null);\n return (out.words = new Array(this.length + num.length)), this.mulTo(num, out);\n }),\n (BN.prototype.mulf = function (num) {\n var out = new BN(null);\n return (out.words = new Array(this.length + num.length)), jumboMulTo(this, num, out);\n }),\n (BN.prototype.imul = function (num) {\n return this.clone().mulTo(num, this);\n }),\n (BN.prototype.imuln = function (num) {\n assert(typeof num == \"number\"), assert(num < 67108864);\n for (var carry = 0, i = 0; i < this.length; i++) {\n var w = (this.words[i] | 0) * num,\n lo = (w & 67108863) + (carry & 67108863);\n (carry >>= 26), (carry += (w / 67108864) | 0), (carry += lo >>> 26), (this.words[i] = lo & 67108863);\n }\n return carry !== 0 && ((this.words[i] = carry), this.length++), this;\n }),\n (BN.prototype.muln = function (num) {\n return this.clone().imuln(num);\n }),\n (BN.prototype.sqr = function () {\n return this.mul(this);\n }),\n (BN.prototype.isqr = function () {\n return this.imul(this.clone());\n }),\n (BN.prototype.pow = function (num) {\n var w = toBitArray(num);\n if (w.length === 0) return new BN(1);\n for (var res = this, i = 0; i < w.length && w[i] === 0; i++, res = res.sqr());\n if (++i < w.length) for (var q = res.sqr(); i < w.length; i++, q = q.sqr()) w[i] !== 0 && (res = res.mul(q));\n return res;\n }),\n (BN.prototype.iushln = function (bits) {\n assert(typeof bits == \"number\" && bits >= 0);\n var r = bits % 26,\n s = (bits - r) / 26,\n carryMask = (67108863 >>> (26 - r)) << (26 - r),\n i;\n if (r !== 0) {\n var carry = 0;\n for (i = 0; i < this.length; i++) {\n var newCarry = this.words[i] & carryMask,\n c = ((this.words[i] | 0) - newCarry) << r;\n (this.words[i] = c | carry), (carry = newCarry >>> (26 - r));\n }\n carry && ((this.words[i] = carry), this.length++);\n }\n if (s !== 0) {\n for (i = this.length - 1; i >= 0; i--) this.words[i + s] = this.words[i];\n for (i = 0; i < s; i++) this.words[i] = 0;\n this.length += s;\n }\n return this.strip();\n }),\n (BN.prototype.ishln = function (bits) {\n return assert(this.negative === 0), this.iushln(bits);\n }),\n (BN.prototype.iushrn = function (bits, hint, extended) {\n assert(typeof bits == \"number\" && bits >= 0);\n var h;\n hint ? (h = (hint - (hint % 26)) / 26) : (h = 0);\n var r = bits % 26,\n s = Math.min((bits - r) / 26, this.length),\n mask = 67108863 ^ ((67108863 >>> r) << r),\n maskedWords = extended;\n if (((h -= s), (h = Math.max(0, h)), maskedWords)) {\n for (var i = 0; i < s; i++) maskedWords.words[i] = this.words[i];\n maskedWords.length = s;\n }\n if (s !== 0)\n if (this.length > s) for (this.length -= s, i = 0; i < this.length; i++) this.words[i] = this.words[i + s];\n else (this.words[0] = 0), (this.length = 1);\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)), (carry = word & mask);\n }\n return (\n maskedWords && carry !== 0 && (maskedWords.words[maskedWords.length++] = carry),\n this.length === 0 && ((this.words[0] = 0), (this.length = 1)),\n this.strip()\n );\n }),\n (BN.prototype.ishrn = function (bits, hint, extended) {\n return assert(this.negative === 0), this.iushrn(bits, hint, extended);\n }),\n (BN.prototype.shln = function (bits) {\n return this.clone().ishln(bits);\n }),\n (BN.prototype.ushln = function (bits) {\n return this.clone().iushln(bits);\n }),\n (BN.prototype.shrn = function (bits) {\n return this.clone().ishrn(bits);\n }),\n (BN.prototype.ushrn = function (bits) {\n return this.clone().iushrn(bits);\n }),\n (BN.prototype.testn = function (bit) {\n assert(typeof bit == \"number\" && bit >= 0);\n var r = bit % 26,\n s = (bit - r) / 26,\n q = 1 << r;\n if (this.length <= s) return !1;\n var w = this.words[s];\n return !!(w & q);\n }),\n (BN.prototype.imaskn = function (bits) {\n assert(typeof bits == \"number\" && bits >= 0);\n var r = bits % 26,\n s = (bits - r) / 26;\n if ((assert(this.negative === 0, \"imaskn works only with positive numbers\"), this.length <= s)) return this;\n if ((r !== 0 && s++, (this.length = Math.min(s, this.length)), r !== 0)) {\n var mask = 67108863 ^ ((67108863 >>> r) << r);\n this.words[this.length - 1] &= mask;\n }\n return this.strip();\n }),\n (BN.prototype.maskn = function (bits) {\n return this.clone().imaskn(bits);\n }),\n (BN.prototype.iaddn = function (num) {\n return (\n assert(typeof num == \"number\"),\n assert(num < 67108864),\n num < 0\n ? this.isubn(-num)\n : this.negative !== 0\n ? this.length === 1 && (this.words[0] | 0) < num\n ? ((this.words[0] = num - (this.words[0] | 0)), (this.negative = 0), this)\n : ((this.negative = 0), this.isubn(num), (this.negative = 1), this)\n : this._iaddn(num)\n );\n }),\n (BN.prototype._iaddn = function (num) {\n this.words[0] += num;\n for (var i = 0; i < this.length && this.words[i] >= 67108864; i++)\n (this.words[i] -= 67108864), i === this.length - 1 ? (this.words[i + 1] = 1) : this.words[i + 1]++;\n return (this.length = Math.max(this.length, i + 1)), this;\n }),\n (BN.prototype.isubn = function (num) {\n if ((assert(typeof num == \"number\"), assert(num < 67108864), num < 0)) return this.iaddn(-num);\n if (this.negative !== 0) return (this.negative = 0), this.iaddn(num), (this.negative = 1), this;\n if (((this.words[0] -= num), this.length === 1 && this.words[0] < 0))\n (this.words[0] = -this.words[0]), (this.negative = 1);\n else\n for (var i = 0; i < this.length && this.words[i] < 0; i++)\n (this.words[i] += 67108864), (this.words[i + 1] -= 1);\n return this.strip();\n }),\n (BN.prototype.addn = function (num) {\n return this.clone().iaddn(num);\n }),\n (BN.prototype.subn = function (num) {\n return this.clone().isubn(num);\n }),\n (BN.prototype.iabs = function () {\n return (this.negative = 0), this;\n }),\n (BN.prototype.abs = function () {\n return this.clone().iabs();\n }),\n (BN.prototype._ishlnsubmul = function (num, mul, shift) {\n var len = num.length + shift,\n i;\n this._expand(len);\n var w,\n 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 & 67108863),\n (carry = (w >> 26) - ((right / 67108864) | 0)),\n (this.words[i + shift] = w & 67108863);\n }\n for (; i < this.length - shift; i++)\n (w = (this.words[i + shift] | 0) + carry), (carry = w >> 26), (this.words[i + shift] = w & 67108863);\n if (carry === 0) return this.strip();\n for (assert(carry === -1), carry = 0, i = 0; i < this.length; i++)\n (w = -(this.words[i] | 0) + carry), (carry = w >> 26), (this.words[i] = w & 67108863);\n return (this.negative = 1), this.strip();\n }),\n (BN.prototype._wordDiv = function (num, mode) {\n var shift = this.length - num.length,\n a = this.clone(),\n b = num,\n bhi = b.words[b.length - 1] | 0,\n bhiBits = this._countBits(bhi);\n (shift = 26 - bhiBits),\n shift !== 0 && ((b = b.ushln(shift)), a.iushln(shift), (bhi = b.words[b.length - 1] | 0));\n var m = a.length - b.length,\n q;\n if (mode !== \"mod\") {\n (q = new BN(null)), (q.length = m + 1), (q.words = new Array(q.length));\n for (var i = 0; i < q.length; i++) q.words[i] = 0;\n }\n var diff = a.clone()._ishlnsubmul(b, 1, m);\n diff.negative === 0 && ((a = diff), q && (q.words[m] = 1));\n for (var j = m - 1; j >= 0; j--) {\n var qj = (a.words[b.length + j] | 0) * 67108864 + (a.words[b.length + j - 1] | 0);\n for (qj = Math.min((qj / bhi) | 0, 67108863), a._ishlnsubmul(b, qj, j); a.negative !== 0; )\n qj--, (a.negative = 0), a._ishlnsubmul(b, 1, j), a.isZero() || (a.negative ^= 1);\n q && (q.words[j] = qj);\n }\n return (\n q && q.strip(),\n a.strip(),\n mode !== \"div\" && shift !== 0 && a.iushrn(shift),\n {\n div: q || null,\n mod: a,\n }\n );\n }),\n (BN.prototype.divmod = function (num, mode, positive) {\n if ((assert(!num.isZero()), this.isZero()))\n return {\n div: new BN(0),\n mod: new BN(0),\n };\n var div, mod, res;\n return this.negative !== 0 && num.negative === 0\n ? ((res = this.neg().divmod(num, mode)),\n mode !== \"mod\" && (div = res.div.neg()),\n mode !== \"div\" && ((mod = res.mod.neg()), positive && mod.negative !== 0 && mod.iadd(num)),\n {\n div,\n mod,\n })\n : this.negative === 0 && num.negative !== 0\n ? ((res = this.divmod(num.neg(), mode)),\n mode !== \"mod\" && (div = res.div.neg()),\n {\n div,\n mod: res.mod,\n })\n : (this.negative & num.negative) !== 0\n ? ((res = this.neg().divmod(num.neg(), mode)),\n mode !== \"div\" && ((mod = res.mod.neg()), positive && mod.negative !== 0 && mod.isub(num)),\n {\n div: res.div,\n mod,\n })\n : num.length > this.length || this.cmp(num) < 0\n ? {\n div: new BN(0),\n mod: this,\n }\n : num.length === 1\n ? mode === \"div\"\n ? {\n div: this.divn(num.words[0]),\n mod: null,\n }\n : mode === \"mod\"\n ? {\n div: null,\n mod: new BN(this.modn(num.words[0])),\n }\n : {\n div: this.divn(num.words[0]),\n mod: new BN(this.modn(num.words[0])),\n }\n : this._wordDiv(num, mode);\n }),\n (BN.prototype.div = function (num) {\n return this.divmod(num, \"div\", !1).div;\n }),\n (BN.prototype.mod = function (num) {\n return this.divmod(num, \"mod\", !1).mod;\n }),\n (BN.prototype.umod = function (num) {\n return this.divmod(num, \"mod\", !0).mod;\n }),\n (BN.prototype.divRound = function (num) {\n var dm = this.divmod(num);\n if (dm.mod.isZero()) return dm.div;\n var mod = dm.div.negative !== 0 ? dm.mod.isub(num) : dm.mod,\n half = num.ushrn(1),\n r2 = num.andln(1),\n cmp = mod.cmp(half);\n return cmp < 0 || (r2 === 1 && cmp === 0)\n ? dm.div\n : dm.div.negative !== 0\n ? dm.div.isubn(1)\n : dm.div.iaddn(1);\n }),\n (BN.prototype.modn = function (num) {\n assert(num <= 67108863);\n for (var p = (1 << 26) % num, acc = 0, i = this.length - 1; i >= 0; i--)\n acc = (p * acc + (this.words[i] | 0)) % num;\n return acc;\n }),\n (BN.prototype.idivn = function (num) {\n assert(num <= 67108863);\n for (var carry = 0, i = this.length - 1; i >= 0; i--) {\n var w = (this.words[i] | 0) + carry * 67108864;\n (this.words[i] = (w / num) | 0), (carry = w % num);\n }\n return this.strip();\n }),\n (BN.prototype.divn = function (num) {\n return this.clone().idivn(num);\n }),\n (BN.prototype.egcd = function (p) {\n assert(p.negative === 0), assert(!p.isZero());\n var x = this,\n y = p.clone();\n x.negative !== 0 ? (x = x.umod(p)) : (x = x.clone());\n for (var A = new BN(1), B = new BN(0), C = new BN(0), D = new BN(1), g = 0; x.isEven() && y.isEven(); )\n x.iushrn(1), y.iushrn(1), ++g;\n for (var yp = y.clone(), xp = x.clone(); !x.isZero(); ) {\n for (var i = 0, im = 1; (x.words[0] & im) === 0 && i < 26; ++i, im <<= 1);\n if (i > 0)\n for (x.iushrn(i); i-- > 0; )\n (A.isOdd() || B.isOdd()) && (A.iadd(yp), B.isub(xp)), A.iushrn(1), B.iushrn(1);\n for (var j = 0, jm = 1; (y.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n if (j > 0)\n for (y.iushrn(j); j-- > 0; )\n (C.isOdd() || D.isOdd()) && (C.iadd(yp), D.isub(xp)), C.iushrn(1), D.iushrn(1);\n x.cmp(y) >= 0 ? (x.isub(y), A.isub(C), B.isub(D)) : (y.isub(x), C.isub(A), D.isub(B));\n }\n return {\n a: C,\n b: D,\n gcd: y.iushln(g),\n };\n }),\n (BN.prototype._invmp = function (p) {\n assert(p.negative === 0), assert(!p.isZero());\n var a = this,\n b = p.clone();\n a.negative !== 0 ? (a = a.umod(p)) : (a = a.clone());\n for (var x1 = new BN(1), x2 = new BN(0), delta = b.clone(); 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) for (a.iushrn(i); i-- > 0; ) x1.isOdd() && x1.iadd(delta), x1.iushrn(1);\n for (var j = 0, jm = 1; (b.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n if (j > 0) for (b.iushrn(j); j-- > 0; ) x2.isOdd() && x2.iadd(delta), x2.iushrn(1);\n a.cmp(b) >= 0 ? (a.isub(b), x1.isub(x2)) : (b.isub(a), x2.isub(x1));\n }\n var res;\n return a.cmpn(1) === 0 ? (res = x1) : (res = x2), res.cmpn(0) < 0 && res.iadd(p), res;\n }),\n (BN.prototype.gcd = function (num) {\n if (this.isZero()) return num.abs();\n if (num.isZero()) return this.abs();\n var a = this.clone(),\n b = num.clone();\n (a.negative = 0), (b.negative = 0);\n for (var shift = 0; a.isEven() && b.isEven(); shift++) a.iushrn(1), b.iushrn(1);\n do {\n for (; a.isEven(); ) a.iushrn(1);\n for (; b.isEven(); ) b.iushrn(1);\n var r = a.cmp(b);\n if (r < 0) {\n var t = a;\n (a = b), (b = t);\n } else if (r === 0 || b.cmpn(1) === 0) break;\n a.isub(b);\n } while (!0);\n return b.iushln(shift);\n }),\n (BN.prototype.invm = function (num) {\n return this.egcd(num).a.umod(num);\n }),\n (BN.prototype.isEven = function () {\n return (this.words[0] & 1) === 0;\n }),\n (BN.prototype.isOdd = function () {\n return (this.words[0] & 1) === 1;\n }),\n (BN.prototype.andln = function (num) {\n return this.words[0] & num;\n }),\n (BN.prototype.bincn = function (bit) {\n assert(typeof bit == \"number\");\n var r = bit % 26,\n s = (bit - r) / 26,\n q = 1 << r;\n if (this.length <= s) return this._expand(s + 1), (this.words[s] |= q), this;\n for (var carry = q, i = s; carry !== 0 && i < this.length; i++) {\n var w = this.words[i] | 0;\n (w += carry), (carry = w >>> 26), (w &= 67108863), (this.words[i] = w);\n }\n return carry !== 0 && ((this.words[i] = carry), this.length++), this;\n }),\n (BN.prototype.isZero = function () {\n return this.length === 1 && this.words[0] === 0;\n }),\n (BN.prototype.cmpn = function (num) {\n var negative = num < 0;\n if (this.negative !== 0 && !negative) return -1;\n if (this.negative === 0 && negative) return 1;\n this.strip();\n var res;\n if (this.length > 1) res = 1;\n else {\n negative && (num = -num), assert(num <= 67108863, \"Number is too big\");\n var w = this.words[0] | 0;\n res = w === num ? 0 : w < num ? -1 : 1;\n }\n return this.negative !== 0 ? -res | 0 : res;\n }),\n (BN.prototype.cmp = function (num) {\n if (this.negative !== 0 && num.negative === 0) return -1;\n if (this.negative === 0 && num.negative !== 0) return 1;\n var res = this.ucmp(num);\n return this.negative !== 0 ? -res | 0 : res;\n }),\n (BN.prototype.ucmp = function (num) {\n if (this.length > num.length) return 1;\n if (this.length < num.length) return -1;\n for (var res = 0, i = this.length - 1; i >= 0; i--) {\n var a = this.words[i] | 0,\n b = num.words[i] | 0;\n if (a !== b) {\n a < b ? (res = -1) : a > b && (res = 1);\n break;\n }\n }\n return res;\n }),\n (BN.prototype.gtn = function (num) {\n return this.cmpn(num) === 1;\n }),\n (BN.prototype.gt = function (num) {\n return this.cmp(num) === 1;\n }),\n (BN.prototype.gten = function (num) {\n return this.cmpn(num) >= 0;\n }),\n (BN.prototype.gte = function (num) {\n return this.cmp(num) >= 0;\n }),\n (BN.prototype.ltn = function (num) {\n return this.cmpn(num) === -1;\n }),\n (BN.prototype.lt = function (num) {\n return this.cmp(num) === -1;\n }),\n (BN.prototype.lten = function (num) {\n return this.cmpn(num) <= 0;\n }),\n (BN.prototype.lte = function (num) {\n return this.cmp(num) <= 0;\n }),\n (BN.prototype.eqn = function (num) {\n return this.cmpn(num) === 0;\n }),\n (BN.prototype.eq = function (num) {\n return this.cmp(num) === 0;\n }),\n (BN.red = function (num) {\n return new Red(num);\n }),\n (BN.prototype.toRed = function (ctx) {\n return (\n assert(!this.red, \"Already a number in reduction context\"),\n assert(this.negative === 0, \"red works only with positives\"),\n ctx.convertTo(this)._forceRed(ctx)\n );\n }),\n (BN.prototype.fromRed = function () {\n return assert(this.red, \"fromRed works only with numbers in reduction context\"), this.red.convertFrom(this);\n }),\n (BN.prototype._forceRed = function (ctx) {\n return (this.red = ctx), this;\n }),\n (BN.prototype.forceRed = function (ctx) {\n return assert(!this.red, \"Already a number in reduction context\"), this._forceRed(ctx);\n }),\n (BN.prototype.redAdd = function (num) {\n return assert(this.red, \"redAdd works only with red numbers\"), this.red.add(this, num);\n }),\n (BN.prototype.redIAdd = function (num) {\n return assert(this.red, \"redIAdd works only with red numbers\"), this.red.iadd(this, num);\n }),\n (BN.prototype.redSub = function (num) {\n return assert(this.red, \"redSub works only with red numbers\"), this.red.sub(this, num);\n }),\n (BN.prototype.redISub = function (num) {\n return assert(this.red, \"redISub works only with red numbers\"), this.red.isub(this, num);\n }),\n (BN.prototype.redShl = function (num) {\n return assert(this.red, \"redShl works only with red numbers\"), this.red.shl(this, num);\n }),\n (BN.prototype.redMul = function (num) {\n return (\n assert(this.red, \"redMul works only with red numbers\"),\n this.red._verify2(this, num),\n this.red.mul(this, num)\n );\n }),\n (BN.prototype.redIMul = function (num) {\n return (\n assert(this.red, \"redMul works only with red numbers\"),\n this.red._verify2(this, num),\n this.red.imul(this, num)\n );\n }),\n (BN.prototype.redSqr = function () {\n return assert(this.red, \"redSqr works only with red numbers\"), this.red._verify1(this), this.red.sqr(this);\n }),\n (BN.prototype.redISqr = function () {\n return assert(this.red, \"redISqr works only with red numbers\"), this.red._verify1(this), this.red.isqr(this);\n }),\n (BN.prototype.redSqrt = function () {\n return assert(this.red, \"redSqrt works only with red numbers\"), this.red._verify1(this), this.red.sqrt(this);\n }),\n (BN.prototype.redInvm = function () {\n return assert(this.red, \"redInvm works only with red numbers\"), this.red._verify1(this), this.red.invm(this);\n }),\n (BN.prototype.redNeg = function () {\n return assert(this.red, \"redNeg works only with red numbers\"), this.red._verify1(this), this.red.neg(this);\n }),\n (BN.prototype.redPow = function (num) {\n return assert(this.red && !num.red, \"redPow(normalNum)\"), this.red._verify1(this), this.red.pow(this, num);\n });\n var primes = {\n k256: null,\n p224: null,\n p192: null,\n p25519: null,\n };\n function MPrime(name, p) {\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 (this.tmp = this._tmp());\n }\n (MPrime.prototype._tmp = function () {\n var tmp = new BN(null);\n return (tmp.words = new Array(Math.ceil(this.n / 13))), tmp;\n }),\n (MPrime.prototype.ireduce = function (num) {\n var r = num,\n rlen;\n do this.split(r, this.tmp), (r = this.imulK(r)), (r = r.iadd(this.tmp)), (rlen = r.bitLength());\n while (rlen > this.n);\n var cmp = rlen < this.n ? -1 : r.ucmp(this.p);\n return (\n cmp === 0\n ? ((r.words[0] = 0), (r.length = 1))\n : cmp > 0\n ? r.isub(this.p)\n : r.strip !== void 0\n ? r.strip()\n : r._strip(),\n r\n );\n }),\n (MPrime.prototype.split = function (input, out) {\n input.iushrn(this.n, 0, out);\n }),\n (MPrime.prototype.imulK = function (num) {\n return num.imul(this.k);\n });\n function K256() {\n MPrime.call(this, \"k256\", \"ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f\");\n }\n inherits(K256, MPrime),\n (K256.prototype.split = function (input, output) {\n for (var mask = 4194303, outLen = Math.min(input.length, 9), i = 0; i < outLen; i++)\n output.words[i] = input.words[i];\n if (((output.length = outLen), input.length <= 9)) {\n (input.words[0] = 0), (input.length = 1);\n return;\n }\n var prev = input.words[9];\n for (output.words[output.length++] = prev & mask, i = 10; i < input.length; i++) {\n var next = input.words[i] | 0;\n (input.words[i - 10] = ((next & mask) << 4) | (prev >>> 22)), (prev = next);\n }\n (prev >>>= 22),\n (input.words[i - 10] = prev),\n prev === 0 && input.length > 10 ? (input.length -= 10) : (input.length -= 9);\n }),\n (K256.prototype.imulK = function (num) {\n (num.words[num.length] = 0), (num.words[num.length + 1] = 0), (num.length += 2);\n for (var lo = 0, i = 0; i < num.length; i++) {\n var w = num.words[i] | 0;\n (lo += w * 977), (num.words[i] = lo & 67108863), (lo = w * 64 + ((lo / 67108864) | 0));\n }\n return (\n num.words[num.length - 1] === 0 && (num.length--, num.words[num.length - 1] === 0 && num.length--), num\n );\n });\n function P224() {\n MPrime.call(this, \"p224\", \"ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001\");\n }\n inherits(P224, MPrime);\n function P192() {\n MPrime.call(this, \"p192\", \"ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff\");\n }\n inherits(P192, MPrime);\n function P25519() {\n MPrime.call(this, \"25519\", \"7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed\");\n }\n inherits(P25519, MPrime),\n (P25519.prototype.imulK = function (num) {\n for (var carry = 0, i = 0; i < num.length; i++) {\n var hi = (num.words[i] | 0) * 19 + carry,\n lo = hi & 67108863;\n (hi >>>= 26), (num.words[i] = lo), (carry = hi);\n }\n return carry !== 0 && (num.words[num.length++] = carry), num;\n }),\n (BN._prime = function (name) {\n if (primes[name]) return primes[name];\n var prime2;\n if (name === \"k256\") prime2 = new K256();\n else if (name === \"p224\") prime2 = new P224();\n else if (name === \"p192\") prime2 = new P192();\n else if (name === \"p25519\") prime2 = new P25519();\n else throw new Error(\"Unknown prime \" + name);\n return (primes[name] = prime2), prime2;\n });\n function Red(m) {\n if (typeof m == \"string\") {\n var prime = BN._prime(m);\n (this.m = prime.p), (this.prime = prime);\n } else assert(m.gtn(1), \"modulus must be greater than 1\"), (this.m = m), (this.prime = null);\n }\n (Red.prototype._verify1 = function (a) {\n assert(a.negative === 0, \"red works only with positives\"), assert(a.red, \"red works only with red numbers\");\n }),\n (Red.prototype._verify2 = function (a, b) {\n assert((a.negative | b.negative) === 0, \"red works only with positives\"),\n assert(a.red && a.red === b.red, \"red works only with red numbers\");\n }),\n (Red.prototype.imod = function (a) {\n return this.prime ? this.prime.ireduce(a)._forceRed(this) : a.umod(this.m)._forceRed(this);\n }),\n (Red.prototype.neg = function (a) {\n return a.isZero() ? a.clone() : this.m.sub(a)._forceRed(this);\n }),\n (Red.prototype.add = function (a, b) {\n this._verify2(a, b);\n var res = a.add(b);\n return res.cmp(this.m) >= 0 && res.isub(this.m), res._forceRed(this);\n }),\n (Red.prototype.iadd = function (a, b) {\n this._verify2(a, b);\n var res = a.iadd(b);\n return res.cmp(this.m) >= 0 && res.isub(this.m), res;\n }),\n (Red.prototype.sub = function (a, b) {\n this._verify2(a, b);\n var res = a.sub(b);\n return res.cmpn(0) < 0 && res.iadd(this.m), res._forceRed(this);\n }),\n (Red.prototype.isub = function (a, b) {\n this._verify2(a, b);\n var res = a.isub(b);\n return res.cmpn(0) < 0 && res.iadd(this.m), res;\n }),\n (Red.prototype.shl = function (a, num) {\n return this._verify1(a), this.imod(a.ushln(num));\n }),\n (Red.prototype.imul = function (a, b) {\n return this._verify2(a, b), this.imod(a.imul(b));\n }),\n (Red.prototype.mul = function (a, b) {\n return this._verify2(a, b), this.imod(a.mul(b));\n }),\n (Red.prototype.isqr = function (a) {\n return this.imul(a, a.clone());\n }),\n (Red.prototype.sqr = function (a) {\n return this.mul(a, a);\n }),\n (Red.prototype.sqrt = function (a) {\n if (a.isZero()) return a.clone();\n var mod3 = this.m.andln(3);\n if ((assert(mod3 % 2 === 1), mod3 === 3)) {\n var pow = this.m.add(new BN(1)).iushrn(2);\n return this.pow(a, pow);\n }\n for (var q = this.m.subn(1), s = 0; !q.isZero() && q.andln(1) === 0; ) s++, q.iushrn(1);\n assert(!q.isZero());\n var one = new BN(1).toRed(this),\n nOne = one.redNeg(),\n lpow = this.m.subn(1).iushrn(1),\n z = this.m.bitLength();\n for (z = new BN(2 * z * z).toRed(this); this.pow(z, lpow).cmp(nOne) !== 0; ) z.redIAdd(nOne);\n for (\n var c = this.pow(z, q), r = this.pow(a, q.addn(1).iushrn(1)), t = this.pow(a, q), m = s;\n t.cmp(one) !== 0;\n\n ) {\n for (var tmp = t, i = 0; tmp.cmp(one) !== 0; i++) tmp = tmp.redSqr();\n assert(i < m);\n var b = this.pow(c, new BN(1).iushln(m - i - 1));\n (r = r.redMul(b)), (c = b.redSqr()), (t = t.redMul(c)), (m = i);\n }\n return r;\n }),\n (Red.prototype.invm = function (a) {\n var inv = a._invmp(this.m);\n return inv.negative !== 0 ? ((inv.negative = 0), this.imod(inv).redNeg()) : this.imod(inv);\n }),\n (Red.prototype.pow = function (a, num) {\n if (num.isZero()) return new BN(1).toRed(this);\n if (num.cmpn(1) === 0) return a.clone();\n var windowSize = 4,\n wnd = new Array(1 << windowSize);\n (wnd[0] = new BN(1).toRed(this)), (wnd[1] = a);\n for (var i = 2; i < wnd.length; i++) wnd[i] = this.mul(wnd[i - 1], a);\n var res = wnd[0],\n current = 0,\n currentLen = 0,\n start = num.bitLength() % 26;\n for (start === 0 && (start = 26), i = num.length - 1; i >= 0; i--) {\n for (var word = num.words[i], j = start - 1; j >= 0; j--) {\n var bit = (word >> j) & 1;\n if ((res !== wnd[0] && (res = this.sqr(res)), bit === 0 && current === 0)) {\n currentLen = 0;\n continue;\n }\n (current <<= 1),\n (current |= bit),\n currentLen++,\n !(currentLen !== windowSize && (i !== 0 || j !== 0)) &&\n ((res = this.mul(res, wnd[current])), (currentLen = 0), (current = 0));\n }\n start = 26;\n }\n return res;\n }),\n (Red.prototype.convertTo = function (num) {\n var r = num.umod(this.m);\n return r === num ? r.clone() : r;\n }),\n (Red.prototype.convertFrom = function (num) {\n var res = num.clone();\n return (res.red = null), res;\n }),\n (BN.mont = function (num) {\n return new Mont(num);\n });\n function Mont(m) {\n Red.call(this, m),\n (this.shift = this.m.bitLength()),\n this.shift % 26 !== 0 && (this.shift += 26 - (this.shift % 26)),\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 (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 (Mont.prototype.convertTo = function (num) {\n return this.imod(num.ushln(this.shift));\n }),\n (Mont.prototype.convertFrom = function (num) {\n var r = this.imod(num.mul(this.rinv));\n return (r.red = null), r;\n }),\n (Mont.prototype.imul = function (a, b) {\n if (a.isZero() || b.isZero()) return (a.words[0] = 0), (a.length = 1), a;\n var t = a.imul(b),\n c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m),\n u = t.isub(c).iushrn(this.shift),\n res = u;\n return (\n u.cmp(this.m) >= 0 ? (res = u.isub(this.m)) : u.cmpn(0) < 0 && (res = u.iadd(this.m)), res._forceRed(this)\n );\n }),\n (Mont.prototype.mul = function (a, b) {\n if (a.isZero() || b.isZero()) return new BN(0)._forceRed(this);\n var t = a.mul(b),\n c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m),\n u = t.isub(c).iushrn(this.shift),\n res = u;\n return (\n u.cmp(this.m) >= 0 ? (res = u.isub(this.m)) : u.cmpn(0) < 0 && (res = u.iadd(this.m)), res._forceRed(this)\n );\n }),\n (Mont.prototype.invm = function (a) {\n var res = this.imod(a._invmp(this.m).mul(this.r2));\n return res._forceRed(this);\n });\n })(typeof module > \"u\" || module, exports);\n },\n});\n\nconst { CryptoHasher } = globalThis.Bun;\n\n// node_modules/public-encrypt/withPublic.js\nvar require_withPublic = __commonJS({\n \"node_modules/public-encrypt/withPublic.js\"(exports, module) {\n var BN = require_bn7(),\n Buffer2 = require_safe_buffer().Buffer;\n function withPublic(paddedMsg, key) {\n return Buffer2.from(paddedMsg.toRed(BN.mont(key.modulus)).redPow(new BN(key.publicExponent)).fromRed().toArray());\n }\n module.exports = withPublic;\n },\n});\n\n// node_modules/public-encrypt/publicEncrypt.js\nvar require_publicEncrypt = __commonJS({\n \"node_modules/public-encrypt/publicEncrypt.js\"(exports, module) {\n var parseKeys = require_parse_asn1(),\n randomBytes = require_browser(),\n createHash = require_browser2(),\n mgf = require_mgf(),\n xor = require_xor(),\n BN = require_bn7(),\n withPublic = require_withPublic(),\n crt = require_browserify_rsa(),\n Buffer2 = require_safe_buffer().Buffer;\n module.exports = function (publicKey, msg, reverse) {\n var padding;\n publicKey.padding ? (padding = publicKey.padding) : reverse ? (padding = 1) : (padding = 4);\n var key = parseKeys(publicKey),\n paddedMsg;\n if (padding === 4) paddedMsg = oaep(key, msg);\n else if (padding === 1) paddedMsg = pkcs1(key, msg, reverse);\n else if (padding === 3) {\n if (((paddedMsg = new BN(msg)), paddedMsg.cmp(key.modulus) >= 0)) throw new Error(\"data too long for modulus\");\n } else throw new Error(\"unknown padding\");\n return reverse ? crt(paddedMsg, key) : withPublic(paddedMsg, key);\n };\n function oaep(key, msg) {\n var k = key.modulus.byteLength(),\n mLen = msg.length,\n iHash = createHash(\"sha1\").update(Buffer2.alloc(0)).digest(),\n hLen = iHash.length,\n hLen2 = 2 * hLen;\n if (mLen > k - hLen2 - 2) throw new Error(\"message too long\");\n var ps = Buffer2.alloc(k - mLen - hLen2 - 2),\n dblen = k - hLen - 1,\n seed = randomBytes(hLen),\n maskedDb = xor(Buffer2.concat([iHash, ps, Buffer2.alloc(1, 1), msg], dblen), mgf(seed, dblen)),\n maskedSeed = xor(seed, mgf(maskedDb, hLen));\n return new BN(Buffer2.concat([Buffer2.alloc(1), maskedSeed, maskedDb], k));\n }\n function pkcs1(key, msg, reverse) {\n var mLen = msg.length,\n k = key.modulus.byteLength();\n if (mLen > k - 11) throw new Error(\"message too long\");\n var ps;\n return (\n reverse ? (ps = Buffer2.alloc(k - mLen - 3, 255)) : (ps = nonZero(k - mLen - 3)),\n new BN(Buffer2.concat([Buffer2.from([0, reverse ? 1 : 2]), ps, Buffer2.alloc(1), msg], k))\n );\n }\n function nonZero(len) {\n for (var out = Buffer2.allocUnsafe(len), i = 0, cache = randomBytes(len * 2), cur = 0, num; i < len; )\n cur === cache.length && ((cache = randomBytes(len * 2)), (cur = 0)),\n (num = cache[cur++]),\n num && (out[i++] = num);\n return out;\n }\n },\n});\n\n// node_modules/public-encrypt/privateDecrypt.js\nvar require_privateDecrypt = __commonJS({\n \"node_modules/public-encrypt/privateDecrypt.js\"(exports, module) {\n var parseKeys = require_parse_asn1(),\n mgf = require_mgf(),\n xor = require_xor(),\n BN = require_bn7(),\n crt = require_browserify_rsa(),\n createHash = require_browser2(),\n withPublic = require_withPublic(),\n Buffer2 = require_safe_buffer().Buffer;\n module.exports = function (privateKey, enc, reverse) {\n var padding;\n privateKey.padding ? (padding = privateKey.padding) : reverse ? (padding = 1) : (padding = 4);\n var key = parseKeys(privateKey),\n k = key.modulus.byteLength();\n if (enc.length > k || new BN(enc).cmp(key.modulus) >= 0) throw new Error(\"decryption error\");\n var msg;\n reverse ? (msg = withPublic(new BN(enc), key)) : (msg = crt(enc, key));\n var zBuffer = Buffer2.alloc(k - msg.length);\n if (((msg = Buffer2.concat([zBuffer, msg], k)), padding === 4)) return oaep(key, msg);\n if (padding === 1) return pkcs1(key, msg, reverse);\n if (padding === 3) return msg;\n throw new Error(\"unknown padding\");\n };\n function oaep(key, msg) {\n var k = key.modulus.byteLength(),\n iHash = createHash(\"sha1\").update(Buffer2.alloc(0)).digest(),\n hLen = iHash.length;\n if (msg[0] !== 0) throw new Error(\"decryption error\");\n var maskedSeed = msg.slice(1, hLen + 1),\n maskedDb = msg.slice(hLen + 1),\n seed = xor(maskedSeed, mgf(maskedDb, hLen)),\n db = xor(maskedDb, mgf(seed, k - hLen - 1));\n if (compare(iHash, db.slice(0, hLen))) throw new Error(\"decryption error\");\n for (var i = hLen; db[i] === 0; ) i++;\n if (db[i++] !== 1) throw new Error(\"decryption error\");\n return db.slice(i);\n }\n function pkcs1(key, msg, reverse) {\n for (var p1 = msg.slice(0, 2), i = 2, status = 0; msg[i++] !== 0; )\n if (i >= msg.length) {\n status++;\n break;\n }\n var ps = msg.slice(2, i - 1);\n if (\n (((p1.toString(\"hex\") !== \"0002\" && !reverse) || (p1.toString(\"hex\") !== \"0001\" && reverse)) && status++,\n ps.length < 8 && status++,\n status)\n )\n throw new Error(\"decryption error\");\n return msg.slice(i);\n }\n function compare(a, b) {\n (a = Buffer2.from(a)), (b = Buffer2.from(b));\n var dif = 0,\n len = a.length;\n a.length !== b.length && (dif++, (len = Math.min(a.length, b.length)));\n for (var i = -1; ++i < len; ) dif += a[i] ^ b[i];\n return dif;\n }\n },\n});\n\n// node_modules/public-encrypt/browser.js\nvar require_browser10 = __commonJS({\n \"node_modules/public-encrypt/browser.js\"(exports) {\n exports.publicEncrypt = require_publicEncrypt();\n exports.privateDecrypt = require_privateDecrypt();\n exports.privateEncrypt = function (key, buf) {\n return exports.publicEncrypt(key, buf, !0);\n };\n exports.publicDecrypt = function (key, buf) {\n return exports.privateDecrypt(key, buf, !0);\n };\n },\n});\n\n// node_modules/randomfill/browser.js\nvar require_browser11 = __commonJS({\n \"node_modules/randomfill/browser.js\"(exports) {\n \"use strict\";\n var safeBuffer = require_safe_buffer(),\n randombytes = require_browser(),\n Buffer2 = safeBuffer.Buffer,\n kBufferMaxLength = safeBuffer.kMaxLength,\n kMaxUint32 = Math.pow(2, 32) - 1;\n function assertOffset(offset, length) {\n if (typeof offset != \"number\" || offset !== offset) throw new TypeError(\"offset must be a number\");\n if (offset > kMaxUint32 || offset < 0) throw new TypeError(\"offset must be a uint32\");\n if (offset > kBufferMaxLength || offset > length) throw new RangeError(\"offset out of range\");\n }\n function assertSize(size, offset, length) {\n if (typeof size != \"number\" || size !== size) throw new TypeError(\"size must be a number\");\n if (size > kMaxUint32 || size < 0) throw new TypeError(\"size must be a uint32\");\n if (size + offset > length || size > kBufferMaxLength) throw new RangeError(\"buffer too small\");\n }\n\n exports.randomFill = randomFill;\n exports.randomFillSync = randomFillSync;\n\n function randomFill(buf, offset, size, cb) {\n if (!Buffer2.isBuffer(buf) && !(buf instanceof global.Uint8Array))\n throw new TypeError('\"buf\" argument must be a Buffer or Uint8Array');\n if (typeof offset == \"function\") (cb = offset), (offset = 0), (size = buf.length);\n else if (typeof size == \"function\") (cb = size), (size = buf.length - offset);\n else if (typeof cb != \"function\") throw new TypeError('\"cb\" argument must be a function');\n return assertOffset(offset, buf.length), assertSize(size, offset, buf.length), actualFill(buf, offset, size, cb);\n }\n function actualFill(buf, offset, size, cb) {\n if (cb) {\n randombytes(size, function (err, bytes2) {\n if (err) return cb(err);\n bytes2.copy(buf, offset), cb(null, buf);\n });\n return;\n }\n var bytes = randombytes(size);\n return bytes.copy(buf, offset), buf;\n }\n function randomFillSync(buf, offset, size) {\n if ((typeof offset > \"u\" && (offset = 0), !Buffer2.isBuffer(buf) && !(buf instanceof global.Uint8Array)))\n throw new TypeError('\"buf\" argument must be a Buffer or Uint8Array');\n return (\n assertOffset(offset, buf.length),\n size === void 0 && (size = buf.length - offset),\n assertSize(size, offset, buf.length),\n actualFill(buf, offset, size)\n );\n }\n },\n});\n\n// node_modules/crypto-browserify/index.js\nvar require_crypto_browserify2 = __commonJS({\n \"node_modules/crypto-browserify/index.js\"(exports) {\n \"use strict\";\n exports.randomBytes = exports.rng = exports.pseudoRandomBytes = exports.prng = require_browser();\n exports.createHash = require_browser2();\n exports.Hash = exports.createHash.Hash;\n exports.createHmac = exports.Hmac = require_browser3();\n var algos = require_algos(),\n algoKeys = Object.keys(algos),\n hashes = [\"sha1\", \"sha224\", \"sha256\", \"sha384\", \"sha512\", \"md5\", \"rmd160\"].concat(algoKeys);\n exports.getHashes = function () {\n return hashes;\n };\n var p = require_browser4();\n exports.pbkdf2 = p.pbkdf2;\n exports.pbkdf2Sync = p.pbkdf2Sync;\n var aes = require_browser6();\n exports.Cipher = aes.Cipher;\n exports.createCipher = aes.createCipher;\n exports.Cipheriv = aes.Cipheriv;\n exports.createCipheriv = aes.createCipheriv;\n exports.Decipher = aes.Decipher;\n exports.createDecipher = aes.createDecipher;\n exports.Decipheriv = aes.Decipheriv;\n exports.createDecipheriv = aes.createDecipheriv;\n exports.getCiphers = aes.getCiphers;\n exports.listCiphers = aes.listCiphers;\n var dh = require_browser7();\n exports.DiffieHellmanGroup = dh.DiffieHellmanGroup;\n exports.createDiffieHellmanGroup = dh.createDiffieHellmanGroup;\n exports.getDiffieHellman = dh.getDiffieHellman;\n exports.createDiffieHellman = dh.createDiffieHellman;\n exports.DiffieHellman = dh.DiffieHellman;\n var sign = require_browser8();\n exports.createSign = sign.createSign;\n exports.Sign = sign.Sign;\n exports.createVerify = sign.createVerify;\n exports.Verify = sign.Verify;\n exports.createECDH = require_browser9();\n var publicEncrypt = require_browser10();\n exports.publicEncrypt = publicEncrypt.publicEncrypt;\n exports.privateEncrypt = publicEncrypt.privateEncrypt;\n exports.publicDecrypt = publicEncrypt.publicDecrypt;\n exports.privateDecrypt = publicEncrypt.privateDecrypt;\n exports.getRandomValues = values => crypto.getRandomValues(values);\n var rf = require_browser11();\n exports.randomFill = rf.randomFill;\n exports.randomFillSync = rf.randomFillSync;\n exports.createCredentials = function () {\n throw new Error(\n [\n \"sorry, createCredentials is not implemented yet\",\n \"we accept pull requests\",\n \"https://github.com/crypto-browserify/crypto-browserify\",\n ].join(`\n`),\n );\n };\n exports.constants = {\n DH_CHECK_P_NOT_SAFE_PRIME: 2,\n DH_CHECK_P_NOT_PRIME: 1,\n DH_UNABLE_TO_CHECK_GENERATOR: 4,\n DH_NOT_SUITABLE_GENERATOR: 8,\n NPN_ENABLED: 1,\n ALPN_ENABLED: 1,\n RSA_PKCS1_PADDING: 1,\n RSA_SSLV23_PADDING: 2,\n RSA_NO_PADDING: 3,\n RSA_PKCS1_OAEP_PADDING: 4,\n RSA_X931_PADDING: 5,\n RSA_PKCS1_PSS_PADDING: 6,\n POINT_CONVERSION_COMPRESSED: 2,\n POINT_CONVERSION_UNCOMPRESSED: 4,\n POINT_CONVERSION_HYBRID: 6,\n };\n },\n});\n\n// crypto.js\nvar crypto_exports = {\n ...require_crypto_browserify2(),\n [Symbol.for(\"CommonJS\")]: 0,\n};\nvar DEFAULT_ENCODING = \"buffer\",\n getRandomValues = array => crypto.getRandomValues(array),\n randomUUID = () => crypto.randomUUID(),\n timingSafeEqual =\n \"timingSafeEqual\" in crypto\n ? (a, b) => {\n let { byteLength: byteLengthA } = a,\n { byteLength: byteLengthB } = b;\n if (typeof byteLengthA != \"number\" || typeof byteLengthB != \"number\")\n throw new TypeError(\"Input must be an array buffer view\");\n if (byteLengthA !== byteLengthB) throw new RangeError(\"Input buffers must have the same length\");\n return crypto.timingSafeEqual(a, b);\n }\n : void 0,\n scryptSync =\n \"scryptSync\" in crypto\n ? (password, salt, keylen, options) => {\n let res = crypto.scryptSync(password, salt, keylen, options);\n return DEFAULT_ENCODING !== \"buffer\" ? new Buffer(res).toString(DEFAULT_ENCODING) : new Buffer(res);\n }\n : void 0,\n scrypt =\n \"scryptSync\" in crypto\n ? function (password, salt, keylen, options, callback) {\n if (\n (typeof options == \"function\" && ((callback = options), (options = void 0)), typeof callback != \"function\")\n ) {\n var err = new TypeError(\"callback must be a function\");\n throw ((err.code = \"ERR_INVALID_CALLBACK\"), err);\n }\n try {\n let result = crypto.scryptSync(password, salt, keylen, options);\n process.nextTick(\n callback,\n null,\n DEFAULT_ENCODING !== \"buffer\" ? new Buffer(result).toString(DEFAULT_ENCODING) : new Buffer(result),\n );\n } catch (err2) {\n throw err2;\n }\n }\n : void 0;\ntimingSafeEqual &&\n (Object.defineProperty(timingSafeEqual, \"name\", {\n value: \"::bunternal::\",\n }),\n Object.defineProperty(scrypt, \"name\", {\n value: \"::bunternal::\",\n }),\n Object.defineProperty(scryptSync, \"name\", {\n value: \"::bunternal::\",\n }));\nvar webcrypto = crypto;\n__export(crypto_exports, {\n DEFAULT_ENCODING: () => DEFAULT_ENCODING,\n getRandomValues: () => getRandomValues,\n randomUUID: () => randomUUID,\n scrypt: () => scrypt,\n scryptSync: () => scryptSync,\n timingSafeEqual: () => timingSafeEqual,\n webcrypto: () => webcrypto,\n subtle: () => webcrypto.subtle,\n});\n\nexport const {\n randomBytes,\n rng,\n pseudoRandomBytes,\n prng,\n Hash,\n createHash,\n createHmac,\n Hmac,\n getHashes,\n pbkdf2,\n pbkdf2Sync,\n Cipher,\n createCipher,\n Cipheriv,\n createCipheriv,\n Decipher,\n createDecipher,\n Decipheriv,\n createDecipheriv,\n getCiphers,\n listCiphers,\n DiffieHellmanGroup,\n createDiffieHellmanGroup,\n getDiffieHellman,\n createDiffieHellman,\n DiffieHellman,\n createSign,\n Sign,\n createVerify,\n Verify,\n createECDH,\n publicEncrypt,\n privateEncrypt,\n publicDecrypt,\n privateDecrypt,\n randomFill,\n randomFillSync,\n createCredentials,\n constants,\n} = crypto_exports;\nexport { DEFAULT_ENCODING, getRandomValues, randomUUID, scrypt, scryptSync, timingSafeEqual, webcrypto };\nexport default crypto_exports;\n/*! safe-buffer. MIT License. Feross Aboukhadijeh <https://feross.org/opensource> */\n" - ], - "mappings": ";;A//////DAEA,IAAI,YAAY,OAAO;", - "debugId": "207772A6A1EDC1C564756e2164756e21", - "names": [] -}
\ No newline at end of file |