[ { "path": "LICENSE", "content": "Copyright (c) 2017 Howard Wu.\n\nAll files, with the exceptions below, are released under the MIT License:\n\n Permission is hereby granted, free of charge, to any person obtaining a copy\n of this software and associated documentation files (the \"Software\"), to deal\n in the Software without restriction, including without limitation the rights\n to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n copies of the Software, and to permit persons to whom the Software is\n furnished to do so, subject to the following conditions:\n\n The above copyright notice and this permission notice shall be included in\n all copies or substantial portions of the Software.\n\n THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n THE SOFTWARE.\n" }, { "path": "README.md", "content": "# IPFS + Ethereum Storage\n\nWe will create a simple datastore solution using IPFS and Ethereum. IPFS provides a convenient interface for distributed data storage, with a hash-based content address for reference to our file. This address will be stored in our smart contract on a private Ethereum blockchain. To retrieve the latest data, we will fetch the address from our blockchain and query IPFS for the associated file.\n\n## Build Guide\n\nThis repository has the following dependencies:\n * [IPFS](https://ipfs.io) - the Interplanetary File System\n * [Geth](https://ethereum.org/cli) - the Go implementation of Ethereum\n\n### Install Geth\n\n__Mac:__ For Mac users, install [Homebrew](https://brew.sh/) and update:\n```\nbrew update\nbrew upgrade\n```\nThen run:\n```\nbrew tap ethereum/ethereum\nbrew install ethereum\n```\n\n__Windows:__ For Windows users, download the [latest stable release](https://geth.ethereum.org/downloads/), extract it, download the zip file, extract _geth.exe_ from zip, open a command terminal and type:\n```\nchdir \nopen geth.exe\n```\n\n__Linux:__ For Ubuntu users, run:\n```\nsudo apt-get install software-properties-common\nsudo add-apt-repository -y ppa:ethereum/ethereum\nsudo apt-get update\nsudo apt-get install ethereum\n```\n\n### Install IPFS\n\n__Mac/Linux:__ For Mac and Linux users, download the [prebuilt package](https://ipfs.io/docs/install/), then untar and move the binary to your executables `$PATH` as follows:\n```\ntar xvfz go-ipfs.tar.gz\nmv go-ipfs/ipfs /usr/local/bin/ipfs\n```\n\n__Windows:__ For Windows users, download the [prebuilt package](https://ipfs.io/docs/install/), then unzip and move `ipfs.exe` to your `%PATH%`.\n\nTo test that your IPFS installation worked, in your terminal (Mac/Linux) or command prompt (Windows) window, run:\n```\nipfs help\n```\nThe help menu describing IPFS actions will be printed out.\n\n\n## Initialize an Ethereum node\n\nWe will start by setting up a private Ethereum blockchain on your local machine.\n\n### Setup Geth\n\nCreate a new directory for your private blockchain. In your terminal (Mac/Linux) or command prompt (Windows) window, navigate to the directory and create a new account:\n```\ngeth --datadir=\"./\" account new\n```\nEnter a password when prompted for your local Ethereum account. Geth will create a keystore directory and store the account file in the keystore.\n\n### Genesis Block\n\nSetting up a private blockchain requires defining a genesis block, which sets the initial parameters and token distribution.\n\nIn the directory containing your account, copy/paste/save the following JSON into a file called `genesisblock.json`:\n```\n{\n \"config\": {\n \"chainID\" : 10,\n \"homesteadBlock\": 0,\n \"eip155Block\": 0,\n \"eip158Block\": 0\n },\n \"nonce\": \"0x01\",\n \"difficulty\": \"0x20000\",\n \"mixhash\": \"0x00000000000000000000000000000000000000647572616c65787365646c6578\",\n \"coinbase\": \"0x0000000000000000000000000000000000000000\",\n \"timestamp\": \"0x00\",\n \"parentHash\": \"0x0000000000000000000000000000000000000000000000000000000000000000\",\n \"extraData\": \"0x00\",\n \"gasLimit\": \"0x2FEFD8\",\n \"alloc\": {\n }\n}\n```\nThis will be block 0 of your private blockchain. If you ever wish to have others join this network, they will need this genesis block as well.\n\nWe will now instantiate the blockchain network and load the geth console:\n```\ngeth --datadir=\"./\" init genesisblock.json\ngeth --datadir=\"./\" --networkid 23422 --rpc --rpccorsdomain=\"*\" --rpcport=\"8545\" --minerthreads=\"1\" --mine --nodiscover --maxpeers=0 --unlock 0 console\n```\nThe `--datadir` flag tells geth the path for storing blockchain data. The `--networkid` flag gives your private blockchain a unique reference ID. The `--rpc` and related flags enable remote procedure call (RPC) functionality for web3. The `--minerthreads` flag enables the specified number of CPU threads for mining. The `--mine` flag indicates the mine function for processing transactions and propagating smart contracts through the network. The `--nodiscover` and `--maxpeers` flag disables peer discovery mechanisms. The `--unlock 0` flag unlocks the first account in the system. The `--console` flag enables the REPL terminal.\n\nAs this is our first time running the `--mine` flag, wait for the DAG file to be generated. You will see `Generating DAG: xx%` for a couple minutes. This is a one-time operation.\n\n## Initialize IPFS\n\nWhile we wait for the DAG to be generated, let's setup IPFS. Start by initializing IPFS and modifying CORS restrictions:\n```\nipfs init\nipfs config --json API.HTTPHeaders.Access-Control-Allow-Origin '[\"*\"]'\nipfs config --json Gateway.HTTPHeaders.Access-Control-Allow-Origin '[\"*\"]'\n```\n\nNow start the daemon:\n```\nipfs daemon\n```\n\n## Run the Application\n\nOpen `storage.html` and follow the instructions on the front page.\n\n## Further Resources\n\nBelow are references, projects, and developing work related to IPFS and Ethereum.\n\n### IPFS\n* [IPFS](http://ipfs.io) - A peer-to-peer hypermedia protocol to make the web faster, safer, and more open.\n* [astralboot](https://github.com/ipfs/astralboot) - Low level boot server that deploys directly out of IPFS (TFTP, PXE Boot).\n* [ipget](https://github.com/ipfs/ipget) - wget for IPFS: retrieve files over IPFS and save them locally.\n* [container-demos](https://github.com/ipfs/container-demos) - Demos on how to boot docker images and VMs from IPFS.\n* [ipfs-npm](https://github.com/ipfs/ipfs-npm) - npm on IPFS.\n* [luckychain](https://github.com/luckychain/lucky) - Intel SGX and IPFS-based blockchain implementing Proof of Luck.\n\n### Ethereum\n* [Ethereum](https://www.ethereum.org/) - Ethereum is a decentralized platform that runs smart contracts: applications that run exactly as programmed without any possibility of downtime, censorship, fraud or third party interference.\n* [web3.js](https://github.com/ethereum/web3.js) - the Ethereum compatible JavaScript API which implements the Generic JSON RPC spec.\n* [Ethereum Javascript API (web3)](https://github.com/ethereum/wiki/wiki/JavaScript-API) - Web3 JavaScript Ðapp API.\n\n### Ethereum + IPFS\n * [akasha](http://akasha.world/) - A Next-Generation Social Media Network, powered by Ethereum and embedded into IPFS.\n * [digix](https://www.dgx.io/) - An asset-tokenization platform built on Ethereum and IPFS.\n * [embark](https://github.com/iurimatias/embark-framework) - A framework that allows you to easily develop and deploy Decentralized Applications (DApps).\n * [eris](https://github.com/eris-ltd/eris) - An application platform for building, testing, maintaining, and\noperating applications built to run on an ecosystem level.\n * [uport](https://www.uport.me) - A mobile, self-sovereign identity and key management system, built on the Ethereum blockchain.\n * [js-deflate](https://github.com/dankogai/js-deflate) - Gzipping of data to make it fit in URLs\n\n## Acknowledgement\n\nThe Ethereum Foundation and Ledger Labs have provided the original Ethereum [contract resources](https://github.com/ledgerlabs/ethereum-getting-started/wiki/Anatomy-of-a-Contract)." }, { "path": "contract/SimpleStorage.sol", "content": "contract SimpleStorage {\n string storedData;\n\n function set(string x) {\n storedData = x;\n }\n\n function get() constant returns (string x) {\n return storedData;\n }\n}\n" }, { "path": "contract/SimpleStorageBytecode.txt", "content": "6060604052610282806100126000396000f360606040526000357c0100000000000000000000000000000000000000000000000000000000900480634ed3885e146100445780636d4ce63c1461009a57610042565b005b6100986004808035906020019082018035906020019191908080601f016020809104026020016040519081016040528093929190818152602001838380828437820191505050505050909091905050610115565b005b6100a760048050506101c6565b60405180806020018281038252838181518152602001915080519060200190808383829060006004602084601f0104600f02600301f150905090810190601f1680156101075780820380516001836020036101000a031916815260200191505b509250505060405180910390f35b8060006000509080519060200190828054600181600116156101000203166002900490600052602060002090601f016020900481019282601f1061016457805160ff1916838001178555610195565b82800160010185558215610195579182015b82811115610194578251826000505591602001919060010190610176565b5b5090506101c091906101a2565b808211156101bc57600081815060009055506001016101a2565b5090565b50505b50565b602060405190810160405280600081526020015060006000508054600181600116156101000203166002900480601f0160208091040260200160405190810160405280929190818152602001828054600181600116156101000203166002900480156102735780601f1061024857610100808354040283529160200191610273565b820191906000526020600020905b81548152906001019060200180831161025657829003601f168201915b5050505050905061027f565b9056" }, { "path": "ipfs/ipfs.js", "content": "var IpfsApi =\n/******/ (function(modules) { // webpackBootstrap\n/******/ \t// The module cache\n/******/ \tvar installedModules = {};\n\n/******/ \t// The require function\n/******/ \tfunction __webpack_require__(moduleId) {\n\n/******/ \t\t// Check if module is in cache\n/******/ \t\tif(installedModules[moduleId])\n/******/ \t\t\treturn installedModules[moduleId].exports;\n\n/******/ \t\t// Create a new module (and put it into the cache)\n/******/ \t\tvar module = installedModules[moduleId] = {\n/******/ \t\t\ti: moduleId,\n/******/ \t\t\tl: false,\n/******/ \t\t\texports: {}\n/******/ \t\t};\n\n/******/ \t\t// Execute the module function\n/******/ \t\tmodules[moduleId].call(module.exports, module, module.exports, __webpack_require__);\n\n/******/ \t\t// Flag the module as loaded\n/******/ \t\tmodule.l = true;\n\n/******/ \t\t// Return the exports of the module\n/******/ \t\treturn module.exports;\n/******/ \t}\n\n\n/******/ \t// expose the modules object (__webpack_modules__)\n/******/ \t__webpack_require__.m = modules;\n\n/******/ \t// expose the module cache\n/******/ \t__webpack_require__.c = installedModules;\n\n/******/ \t// __webpack_public_path__\n/******/ \t__webpack_require__.p = \"/_karma_webpack_//\";\n\n/******/ \t// Load entry module and return exports\n/******/ \treturn __webpack_require__(__webpack_require__.s = 538);\n/******/ })\n/************************************************************************/\n/******/ ([\n/* 0 */\n/***/ function(module, exports, __webpack_require__) {\n\n\tvar global = __webpack_require__(5)\n\t , core = __webpack_require__(33)\n\t , hide = __webpack_require__(19)\n\t , redefine = __webpack_require__(20)\n\t , ctx = __webpack_require__(34)\n\t , PROTOTYPE = 'prototype';\n\n\tvar $export = function(type, name, source){\n\t var IS_FORCED = type & $export.F\n\t , IS_GLOBAL = type & $export.G\n\t , IS_STATIC = type & $export.S\n\t , IS_PROTO = type & $export.P\n\t , IS_BIND = type & $export.B\n\t , target = IS_GLOBAL ? global : IS_STATIC ? global[name] || (global[name] = {}) : (global[name] || {})[PROTOTYPE]\n\t , exports = IS_GLOBAL ? core : core[name] || (core[name] = {})\n\t , expProto = exports[PROTOTYPE] || (exports[PROTOTYPE] = {})\n\t , key, own, out, exp;\n\t if(IS_GLOBAL)source = name;\n\t for(key in source){\n\t // contains in native\n\t own = !IS_FORCED && target && target[key] !== undefined;\n\t // export native or passed\n\t out = (own ? target : source)[key];\n\t // bind timers to global for call from export context\n\t exp = IS_BIND && own ? ctx(out, global) : IS_PROTO && typeof out == 'function' ? ctx(Function.call, out) : out;\n\t // extend global\n\t if(target)redefine(target, key, out, type & $export.U);\n\t // export\n\t if(exports[key] != out)hide(exports, key, exp);\n\t if(IS_PROTO && expProto[key] != out)expProto[key] = out;\n\t }\n\t};\n\tglobal.core = core;\n\t// type bitmap\n\t$export.F = 1; // forced\n\t$export.G = 2; // global\n\t$export.S = 4; // static\n\t$export.P = 8; // proto\n\t$export.B = 16; // bind\n\t$export.W = 32; // wrap\n\t$export.U = 64; // safe\n\t$export.R = 128; // real proto method for `library` \n\tmodule.exports = $export;\n\n/***/ },\n/* 1 */\n/***/ function(module, exports, __webpack_require__) {\n\n\t/* WEBPACK VAR INJECTION */(function(Buffer, global) {/*!\n\t * The buffer module from node.js, for the browser.\n\t *\n\t * @author Feross Aboukhadijeh \n\t * @license MIT\n\t */\n\t/* eslint-disable no-proto */\n\n\t'use strict'\n\n\tvar base64 = __webpack_require__(254)\n\tvar ieee754 = __webpack_require__(481)\n\tvar isArray = __webpack_require__(266)\n\n\texports.Buffer = Buffer\n\texports.SlowBuffer = SlowBuffer\n\texports.INSPECT_MAX_BYTES = 50\n\n\t/**\n\t * If `Buffer.TYPED_ARRAY_SUPPORT`:\n\t * === true Use Uint8Array implementation (fastest)\n\t * === false Use Object implementation (most compatible, even IE6)\n\t *\n\t * Browsers that support typed arrays are IE 10+, Firefox 4+, Chrome 7+, Safari 5.1+,\n\t * Opera 11.6+, iOS 4.2+.\n\t *\n\t * Due to various browser bugs, sometimes the Object implementation will be used even\n\t * when the browser supports typed arrays.\n\t *\n\t * Note:\n\t *\n\t * - Firefox 4-29 lacks support for adding new properties to `Uint8Array` instances,\n\t * See: https://bugzilla.mozilla.org/show_bug.cgi?id=695438.\n\t *\n\t * - Chrome 9-10 is missing the `TypedArray.prototype.subarray` function.\n\t *\n\t * - IE10 has a broken `TypedArray.prototype.subarray` function which returns arrays of\n\t * incorrect length in some situations.\n\n\t * We detect these buggy browsers and set `Buffer.TYPED_ARRAY_SUPPORT` to `false` so they\n\t * get the Object implementation, which is slower but behaves correctly.\n\t */\n\tBuffer.TYPED_ARRAY_SUPPORT = global.TYPED_ARRAY_SUPPORT !== undefined\n\t ? global.TYPED_ARRAY_SUPPORT\n\t : typedArraySupport()\n\n\t/*\n\t * Export kMaxLength after typed array support is determined.\n\t */\n\texports.kMaxLength = kMaxLength()\n\n\tfunction typedArraySupport () {\n\t try {\n\t var arr = new Uint8Array(1)\n\t arr.foo = function () { return 42 }\n\t return arr.foo() === 42 && // typed array instances can be augmented\n\t typeof arr.subarray === 'function' && // chrome 9-10 lack `subarray`\n\t arr.subarray(1, 1).byteLength === 0 // ie10 has broken `subarray`\n\t } catch (e) {\n\t return false\n\t }\n\t}\n\n\tfunction kMaxLength () {\n\t return Buffer.TYPED_ARRAY_SUPPORT\n\t ? 0x7fffffff\n\t : 0x3fffffff\n\t}\n\n\tfunction createBuffer (that, length) {\n\t if (kMaxLength() < length) {\n\t throw new RangeError('Invalid typed array length')\n\t }\n\t if (Buffer.TYPED_ARRAY_SUPPORT) {\n\t // Return an augmented `Uint8Array` instance, for best performance\n\t that = new Uint8Array(length)\n\t that.__proto__ = Buffer.prototype\n\t } else {\n\t // Fallback: Return an object instance of the Buffer class\n\t if (that === null) {\n\t that = new Buffer(length)\n\t }\n\t that.length = length\n\t }\n\n\t return that\n\t}\n\n\t/**\n\t * The Buffer constructor returns instances of `Uint8Array` that have their\n\t * prototype changed to `Buffer.prototype`. Furthermore, `Buffer` is a subclass of\n\t * `Uint8Array`, so the returned instances will have all the node `Buffer` methods\n\t * and the `Uint8Array` methods. Square bracket notation works as expected -- it\n\t * returns a single octet.\n\t *\n\t * The `Uint8Array` prototype remains unmodified.\n\t */\n\n\tfunction Buffer (arg, encodingOrOffset, length) {\n\t if (!Buffer.TYPED_ARRAY_SUPPORT && !(this instanceof Buffer)) {\n\t return new Buffer(arg, encodingOrOffset, length)\n\t }\n\n\t // Common case.\n\t if (typeof arg === 'number') {\n\t if (typeof encodingOrOffset === 'string') {\n\t throw new Error(\n\t 'If encoding is specified then the first argument must be a string'\n\t )\n\t }\n\t return allocUnsafe(this, arg)\n\t }\n\t return from(this, arg, encodingOrOffset, length)\n\t}\n\n\tBuffer.poolSize = 8192 // not used by this implementation\n\n\t// TODO: Legacy, not needed anymore. Remove in next major version.\n\tBuffer._augment = function (arr) {\n\t arr.__proto__ = Buffer.prototype\n\t return arr\n\t}\n\n\tfunction from (that, value, encodingOrOffset, length) {\n\t if (typeof value === 'number') {\n\t throw new TypeError('\"value\" argument must not be a number')\n\t }\n\n\t if (typeof ArrayBuffer !== 'undefined' && value instanceof ArrayBuffer) {\n\t return fromArrayBuffer(that, value, encodingOrOffset, length)\n\t }\n\n\t if (typeof value === 'string') {\n\t return fromString(that, value, encodingOrOffset)\n\t }\n\n\t return fromObject(that, value)\n\t}\n\n\t/**\n\t * Functionally equivalent to Buffer(arg, encoding) but throws a TypeError\n\t * if value is a number.\n\t * Buffer.from(str[, encoding])\n\t * Buffer.from(array)\n\t * Buffer.from(buffer)\n\t * Buffer.from(arrayBuffer[, byteOffset[, length]])\n\t **/\n\tBuffer.from = function (value, encodingOrOffset, length) {\n\t return from(null, value, encodingOrOffset, length)\n\t}\n\n\tif (Buffer.TYPED_ARRAY_SUPPORT) {\n\t Buffer.prototype.__proto__ = Uint8Array.prototype\n\t Buffer.__proto__ = Uint8Array\n\t if (typeof Symbol !== 'undefined' && Symbol.species &&\n\t Buffer[Symbol.species] === Buffer) {\n\t // Fix subarray() in ES2016. See: https://github.com/feross/buffer/pull/97\n\t Object.defineProperty(Buffer, Symbol.species, {\n\t value: null,\n\t configurable: true\n\t })\n\t }\n\t}\n\n\tfunction assertSize (size) {\n\t if (typeof size !== 'number') {\n\t throw new TypeError('\"size\" argument must be a number')\n\t }\n\t}\n\n\tfunction alloc (that, size, fill, encoding) {\n\t assertSize(size)\n\t if (size <= 0) {\n\t return createBuffer(that, size)\n\t }\n\t if (fill !== undefined) {\n\t // Only pay attention to encoding if it's a string. This\n\t // prevents accidentally sending in a number that would\n\t // be interpretted as a start offset.\n\t return typeof encoding === 'string'\n\t ? createBuffer(that, size).fill(fill, encoding)\n\t : createBuffer(that, size).fill(fill)\n\t }\n\t return createBuffer(that, size)\n\t}\n\n\t/**\n\t * Creates a new filled Buffer instance.\n\t * alloc(size[, fill[, encoding]])\n\t **/\n\tBuffer.alloc = function (size, fill, encoding) {\n\t return alloc(null, size, fill, encoding)\n\t}\n\n\tfunction allocUnsafe (that, size) {\n\t assertSize(size)\n\t that = createBuffer(that, size < 0 ? 0 : checked(size) | 0)\n\t if (!Buffer.TYPED_ARRAY_SUPPORT) {\n\t for (var i = 0; i < size; i++) {\n\t that[i] = 0\n\t }\n\t }\n\t return that\n\t}\n\n\t/**\n\t * Equivalent to Buffer(num), by default creates a non-zero-filled Buffer instance.\n\t * */\n\tBuffer.allocUnsafe = function (size) {\n\t return allocUnsafe(null, size)\n\t}\n\t/**\n\t * Equivalent to SlowBuffer(num), by default creates a non-zero-filled Buffer instance.\n\t */\n\tBuffer.allocUnsafeSlow = function (size) {\n\t return allocUnsafe(null, size)\n\t}\n\n\tfunction fromString (that, string, encoding) {\n\t if (typeof encoding !== 'string' || encoding === '') {\n\t encoding = 'utf8'\n\t }\n\n\t if (!Buffer.isEncoding(encoding)) {\n\t throw new TypeError('\"encoding\" must be a valid string encoding')\n\t }\n\n\t var length = byteLength(string, encoding) | 0\n\t that = createBuffer(that, length)\n\n\t that.write(string, encoding)\n\t return that\n\t}\n\n\tfunction fromArrayLike (that, array) {\n\t var length = checked(array.length) | 0\n\t that = createBuffer(that, length)\n\t for (var i = 0; i < length; i += 1) {\n\t that[i] = array[i] & 255\n\t }\n\t return that\n\t}\n\n\tfunction fromArrayBuffer (that, array, byteOffset, length) {\n\t array.byteLength // this throws if `array` is not a valid ArrayBuffer\n\n\t if (byteOffset < 0 || array.byteLength < byteOffset) {\n\t throw new RangeError('\\'offset\\' is out of bounds')\n\t }\n\n\t if (array.byteLength < byteOffset + (length || 0)) {\n\t throw new RangeError('\\'length\\' is out of bounds')\n\t }\n\n\t if (length === undefined) {\n\t array = new Uint8Array(array, byteOffset)\n\t } else {\n\t array = new Uint8Array(array, byteOffset, length)\n\t }\n\n\t if (Buffer.TYPED_ARRAY_SUPPORT) {\n\t // Return an augmented `Uint8Array` instance, for best performance\n\t that = array\n\t that.__proto__ = Buffer.prototype\n\t } else {\n\t // Fallback: Return an object instance of the Buffer class\n\t that = fromArrayLike(that, array)\n\t }\n\t return that\n\t}\n\n\tfunction fromObject (that, obj) {\n\t if (Buffer.isBuffer(obj)) {\n\t var len = checked(obj.length) | 0\n\t that = createBuffer(that, len)\n\n\t if (that.length === 0) {\n\t return that\n\t }\n\n\t obj.copy(that, 0, 0, len)\n\t return that\n\t }\n\n\t if (obj) {\n\t if ((typeof ArrayBuffer !== 'undefined' &&\n\t obj.buffer instanceof ArrayBuffer) || 'length' in obj) {\n\t if (typeof obj.length !== 'number' || isnan(obj.length)) {\n\t return createBuffer(that, 0)\n\t }\n\t return fromArrayLike(that, obj)\n\t }\n\n\t if (obj.type === 'Buffer' && isArray(obj.data)) {\n\t return fromArrayLike(that, obj.data)\n\t }\n\t }\n\n\t throw new TypeError('First argument must be a string, Buffer, ArrayBuffer, Array, or array-like object.')\n\t}\n\n\tfunction checked (length) {\n\t // Note: cannot use `length < kMaxLength` here because that fails when\n\t // length is NaN (which is otherwise coerced to zero.)\n\t if (length >= kMaxLength()) {\n\t throw new RangeError('Attempt to allocate Buffer larger than maximum ' +\n\t 'size: 0x' + kMaxLength().toString(16) + ' bytes')\n\t }\n\t return length | 0\n\t}\n\n\tfunction SlowBuffer (length) {\n\t if (+length != length) { // eslint-disable-line eqeqeq\n\t length = 0\n\t }\n\t return Buffer.alloc(+length)\n\t}\n\n\tBuffer.isBuffer = function isBuffer (b) {\n\t return !!(b != null && b._isBuffer)\n\t}\n\n\tBuffer.compare = function compare (a, b) {\n\t if (!Buffer.isBuffer(a) || !Buffer.isBuffer(b)) {\n\t throw new TypeError('Arguments must be Buffers')\n\t }\n\n\t if (a === b) return 0\n\n\t var x = a.length\n\t var y = b.length\n\n\t for (var i = 0, len = Math.min(x, y); i < len; ++i) {\n\t if (a[i] !== b[i]) {\n\t x = a[i]\n\t y = b[i]\n\t break\n\t }\n\t }\n\n\t if (x < y) return -1\n\t if (y < x) return 1\n\t return 0\n\t}\n\n\tBuffer.isEncoding = function isEncoding (encoding) {\n\t switch (String(encoding).toLowerCase()) {\n\t case 'hex':\n\t case 'utf8':\n\t case 'utf-8':\n\t case 'ascii':\n\t case 'binary':\n\t case 'base64':\n\t case 'raw':\n\t case 'ucs2':\n\t case 'ucs-2':\n\t case 'utf16le':\n\t case 'utf-16le':\n\t return true\n\t default:\n\t return false\n\t }\n\t}\n\n\tBuffer.concat = function concat (list, length) {\n\t if (!isArray(list)) {\n\t throw new TypeError('\"list\" argument must be an Array of Buffers')\n\t }\n\n\t if (list.length === 0) {\n\t return Buffer.alloc(0)\n\t }\n\n\t var i\n\t if (length === undefined) {\n\t length = 0\n\t for (i = 0; i < list.length; i++) {\n\t length += list[i].length\n\t }\n\t }\n\n\t var buffer = Buffer.allocUnsafe(length)\n\t var pos = 0\n\t for (i = 0; i < list.length; i++) {\n\t var buf = list[i]\n\t if (!Buffer.isBuffer(buf)) {\n\t throw new TypeError('\"list\" argument must be an Array of Buffers')\n\t }\n\t buf.copy(buffer, pos)\n\t pos += buf.length\n\t }\n\t return buffer\n\t}\n\n\tfunction byteLength (string, encoding) {\n\t if (Buffer.isBuffer(string)) {\n\t return string.length\n\t }\n\t if (typeof ArrayBuffer !== 'undefined' && typeof ArrayBuffer.isView === 'function' &&\n\t (ArrayBuffer.isView(string) || string instanceof ArrayBuffer)) {\n\t return string.byteLength\n\t }\n\t if (typeof string !== 'string') {\n\t string = '' + string\n\t }\n\n\t var len = string.length\n\t if (len === 0) return 0\n\n\t // Use a for loop to avoid recursion\n\t var loweredCase = false\n\t for (;;) {\n\t switch (encoding) {\n\t case 'ascii':\n\t case 'binary':\n\t // Deprecated\n\t case 'raw':\n\t case 'raws':\n\t return len\n\t case 'utf8':\n\t case 'utf-8':\n\t case undefined:\n\t return utf8ToBytes(string).length\n\t case 'ucs2':\n\t case 'ucs-2':\n\t case 'utf16le':\n\t case 'utf-16le':\n\t return len * 2\n\t case 'hex':\n\t return len >>> 1\n\t case 'base64':\n\t return base64ToBytes(string).length\n\t default:\n\t if (loweredCase) return utf8ToBytes(string).length // assume utf8\n\t encoding = ('' + encoding).toLowerCase()\n\t loweredCase = true\n\t }\n\t }\n\t}\n\tBuffer.byteLength = byteLength\n\n\tfunction slowToString (encoding, start, end) {\n\t var loweredCase = false\n\n\t // No need to verify that \"this.length <= MAX_UINT32\" since it's a read-only\n\t // property of a typed array.\n\n\t // This behaves neither like String nor Uint8Array in that we set start/end\n\t // to their upper/lower bounds if the value passed is out of range.\n\t // undefined is handled specially as per ECMA-262 6th Edition,\n\t // Section 13.3.3.7 Runtime Semantics: KeyedBindingInitialization.\n\t if (start === undefined || start < 0) {\n\t start = 0\n\t }\n\t // Return early if start > this.length. Done here to prevent potential uint32\n\t // coercion fail below.\n\t if (start > this.length) {\n\t return ''\n\t }\n\n\t if (end === undefined || end > this.length) {\n\t end = this.length\n\t }\n\n\t if (end <= 0) {\n\t return ''\n\t }\n\n\t // Force coersion to uint32. This will also coerce falsey/NaN values to 0.\n\t end >>>= 0\n\t start >>>= 0\n\n\t if (end <= start) {\n\t return ''\n\t }\n\n\t if (!encoding) encoding = 'utf8'\n\n\t while (true) {\n\t switch (encoding) {\n\t case 'hex':\n\t return hexSlice(this, start, end)\n\n\t case 'utf8':\n\t case 'utf-8':\n\t return utf8Slice(this, start, end)\n\n\t case 'ascii':\n\t return asciiSlice(this, start, end)\n\n\t case 'binary':\n\t return binarySlice(this, start, end)\n\n\t case 'base64':\n\t return base64Slice(this, start, end)\n\n\t case 'ucs2':\n\t case 'ucs-2':\n\t case 'utf16le':\n\t case 'utf-16le':\n\t return utf16leSlice(this, start, end)\n\n\t default:\n\t if (loweredCase) throw new TypeError('Unknown encoding: ' + encoding)\n\t encoding = (encoding + '').toLowerCase()\n\t loweredCase = true\n\t }\n\t }\n\t}\n\n\t// The property is used by `Buffer.isBuffer` and `is-buffer` (in Safari 5-7) to detect\n\t// Buffer instances.\n\tBuffer.prototype._isBuffer = true\n\n\tfunction swap (b, n, m) {\n\t var i = b[n]\n\t b[n] = b[m]\n\t b[m] = i\n\t}\n\n\tBuffer.prototype.swap16 = function swap16 () {\n\t var len = this.length\n\t if (len % 2 !== 0) {\n\t throw new RangeError('Buffer size must be a multiple of 16-bits')\n\t }\n\t for (var i = 0; i < len; i += 2) {\n\t swap(this, i, i + 1)\n\t }\n\t return this\n\t}\n\n\tBuffer.prototype.swap32 = function swap32 () {\n\t var len = this.length\n\t if (len % 4 !== 0) {\n\t throw new RangeError('Buffer size must be a multiple of 32-bits')\n\t }\n\t for (var i = 0; i < len; i += 4) {\n\t swap(this, i, i + 3)\n\t swap(this, i + 1, i + 2)\n\t }\n\t return this\n\t}\n\n\tBuffer.prototype.toString = function toString () {\n\t var length = this.length | 0\n\t if (length === 0) return ''\n\t if (arguments.length === 0) return utf8Slice(this, 0, length)\n\t return slowToString.apply(this, arguments)\n\t}\n\n\tBuffer.prototype.equals = function equals (b) {\n\t if (!Buffer.isBuffer(b)) throw new TypeError('Argument must be a Buffer')\n\t if (this === b) return true\n\t return Buffer.compare(this, b) === 0\n\t}\n\n\tBuffer.prototype.inspect = function inspect () {\n\t var str = ''\n\t var max = exports.INSPECT_MAX_BYTES\n\t if (this.length > 0) {\n\t str = this.toString('hex', 0, max).match(/.{2}/g).join(' ')\n\t if (this.length > max) str += ' ... '\n\t }\n\t return ''\n\t}\n\n\tBuffer.prototype.compare = function compare (target, start, end, thisStart, thisEnd) {\n\t if (!Buffer.isBuffer(target)) {\n\t throw new TypeError('Argument must be a Buffer')\n\t }\n\n\t if (start === undefined) {\n\t start = 0\n\t }\n\t if (end === undefined) {\n\t end = target ? target.length : 0\n\t }\n\t if (thisStart === undefined) {\n\t thisStart = 0\n\t }\n\t if (thisEnd === undefined) {\n\t thisEnd = this.length\n\t }\n\n\t if (start < 0 || end > target.length || thisStart < 0 || thisEnd > this.length) {\n\t throw new RangeError('out of range index')\n\t }\n\n\t if (thisStart >= thisEnd && start >= end) {\n\t return 0\n\t }\n\t if (thisStart >= thisEnd) {\n\t return -1\n\t }\n\t if (start >= end) {\n\t return 1\n\t }\n\n\t start >>>= 0\n\t end >>>= 0\n\t thisStart >>>= 0\n\t thisEnd >>>= 0\n\n\t if (this === target) return 0\n\n\t var x = thisEnd - thisStart\n\t var y = end - start\n\t var len = Math.min(x, y)\n\n\t var thisCopy = this.slice(thisStart, thisEnd)\n\t var targetCopy = target.slice(start, end)\n\n\t for (var i = 0; i < len; ++i) {\n\t if (thisCopy[i] !== targetCopy[i]) {\n\t x = thisCopy[i]\n\t y = targetCopy[i]\n\t break\n\t }\n\t }\n\n\t if (x < y) return -1\n\t if (y < x) return 1\n\t return 0\n\t}\n\n\tfunction arrayIndexOf (arr, val, byteOffset, encoding) {\n\t var indexSize = 1\n\t var arrLength = arr.length\n\t var valLength = val.length\n\n\t if (encoding !== undefined) {\n\t encoding = String(encoding).toLowerCase()\n\t if (encoding === 'ucs2' || encoding === 'ucs-2' ||\n\t encoding === 'utf16le' || encoding === 'utf-16le') {\n\t if (arr.length < 2 || val.length < 2) {\n\t return -1\n\t }\n\t indexSize = 2\n\t arrLength /= 2\n\t valLength /= 2\n\t byteOffset /= 2\n\t }\n\t }\n\n\t function read (buf, i) {\n\t if (indexSize === 1) {\n\t return buf[i]\n\t } else {\n\t return buf.readUInt16BE(i * indexSize)\n\t }\n\t }\n\n\t var foundIndex = -1\n\t for (var i = 0; byteOffset + i < arrLength; i++) {\n\t if (read(arr, byteOffset + i) === read(val, foundIndex === -1 ? 0 : i - foundIndex)) {\n\t if (foundIndex === -1) foundIndex = i\n\t if (i - foundIndex + 1 === valLength) return (byteOffset + foundIndex) * indexSize\n\t } else {\n\t if (foundIndex !== -1) i -= i - foundIndex\n\t foundIndex = -1\n\t }\n\t }\n\t return -1\n\t}\n\n\tBuffer.prototype.indexOf = function indexOf (val, byteOffset, encoding) {\n\t if (typeof byteOffset === 'string') {\n\t encoding = byteOffset\n\t byteOffset = 0\n\t } else if (byteOffset > 0x7fffffff) {\n\t byteOffset = 0x7fffffff\n\t } else if (byteOffset < -0x80000000) {\n\t byteOffset = -0x80000000\n\t }\n\t byteOffset >>= 0\n\n\t if (this.length === 0) return -1\n\t if (byteOffset >= this.length) return -1\n\n\t // Negative offsets start from the end of the buffer\n\t if (byteOffset < 0) byteOffset = Math.max(this.length + byteOffset, 0)\n\n\t if (typeof val === 'string') {\n\t val = Buffer.from(val, encoding)\n\t }\n\n\t if (Buffer.isBuffer(val)) {\n\t // special case: looking for empty string/buffer always fails\n\t if (val.length === 0) {\n\t return -1\n\t }\n\t return arrayIndexOf(this, val, byteOffset, encoding)\n\t }\n\t if (typeof val === 'number') {\n\t if (Buffer.TYPED_ARRAY_SUPPORT && Uint8Array.prototype.indexOf === 'function') {\n\t return Uint8Array.prototype.indexOf.call(this, val, byteOffset)\n\t }\n\t return arrayIndexOf(this, [ val ], byteOffset, encoding)\n\t }\n\n\t throw new TypeError('val must be string, number or Buffer')\n\t}\n\n\tBuffer.prototype.includes = function includes (val, byteOffset, encoding) {\n\t return this.indexOf(val, byteOffset, encoding) !== -1\n\t}\n\n\tfunction hexWrite (buf, string, offset, length) {\n\t offset = Number(offset) || 0\n\t var remaining = buf.length - offset\n\t if (!length) {\n\t length = remaining\n\t } else {\n\t length = Number(length)\n\t if (length > remaining) {\n\t length = remaining\n\t }\n\t }\n\n\t // must be an even number of digits\n\t var strLen = string.length\n\t if (strLen % 2 !== 0) throw new Error('Invalid hex string')\n\n\t if (length > strLen / 2) {\n\t length = strLen / 2\n\t }\n\t for (var i = 0; i < length; i++) {\n\t var parsed = parseInt(string.substr(i * 2, 2), 16)\n\t if (isNaN(parsed)) return i\n\t buf[offset + i] = parsed\n\t }\n\t return i\n\t}\n\n\tfunction utf8Write (buf, string, offset, length) {\n\t return blitBuffer(utf8ToBytes(string, buf.length - offset), buf, offset, length)\n\t}\n\n\tfunction asciiWrite (buf, string, offset, length) {\n\t return blitBuffer(asciiToBytes(string), buf, offset, length)\n\t}\n\n\tfunction binaryWrite (buf, string, offset, length) {\n\t return asciiWrite(buf, string, offset, length)\n\t}\n\n\tfunction base64Write (buf, string, offset, length) {\n\t return blitBuffer(base64ToBytes(string), buf, offset, length)\n\t}\n\n\tfunction ucs2Write (buf, string, offset, length) {\n\t return blitBuffer(utf16leToBytes(string, buf.length - offset), buf, offset, length)\n\t}\n\n\tBuffer.prototype.write = function write (string, offset, length, encoding) {\n\t // Buffer#write(string)\n\t if (offset === undefined) {\n\t encoding = 'utf8'\n\t length = this.length\n\t offset = 0\n\t // Buffer#write(string, encoding)\n\t } else if (length === undefined && typeof offset === 'string') {\n\t encoding = offset\n\t length = this.length\n\t offset = 0\n\t // Buffer#write(string, offset[, length][, encoding])\n\t } else if (isFinite(offset)) {\n\t offset = offset | 0\n\t if (isFinite(length)) {\n\t length = length | 0\n\t if (encoding === undefined) encoding = 'utf8'\n\t } else {\n\t encoding = length\n\t length = undefined\n\t }\n\t // legacy write(string, encoding, offset, length) - remove in v0.13\n\t } else {\n\t throw new Error(\n\t 'Buffer.write(string, encoding, offset[, length]) is no longer supported'\n\t )\n\t }\n\n\t var remaining = this.length - offset\n\t if (length === undefined || length > remaining) length = remaining\n\n\t if ((string.length > 0 && (length < 0 || offset < 0)) || offset > this.length) {\n\t throw new RangeError('Attempt to write outside buffer bounds')\n\t }\n\n\t if (!encoding) encoding = 'utf8'\n\n\t var loweredCase = false\n\t for (;;) {\n\t switch (encoding) {\n\t case 'hex':\n\t return hexWrite(this, string, offset, length)\n\n\t case 'utf8':\n\t case 'utf-8':\n\t return utf8Write(this, string, offset, length)\n\n\t case 'ascii':\n\t return asciiWrite(this, string, offset, length)\n\n\t case 'binary':\n\t return binaryWrite(this, string, offset, length)\n\n\t case 'base64':\n\t // Warning: maxLength not taken into account in base64Write\n\t return base64Write(this, string, offset, length)\n\n\t case 'ucs2':\n\t case 'ucs-2':\n\t case 'utf16le':\n\t case 'utf-16le':\n\t return ucs2Write(this, string, offset, length)\n\n\t default:\n\t if (loweredCase) throw new TypeError('Unknown encoding: ' + encoding)\n\t encoding = ('' + encoding).toLowerCase()\n\t loweredCase = true\n\t }\n\t }\n\t}\n\n\tBuffer.prototype.toJSON = function toJSON () {\n\t return {\n\t type: 'Buffer',\n\t data: Array.prototype.slice.call(this._arr || this, 0)\n\t }\n\t}\n\n\tfunction base64Slice (buf, start, end) {\n\t if (start === 0 && end === buf.length) {\n\t return base64.fromByteArray(buf)\n\t } else {\n\t return base64.fromByteArray(buf.slice(start, end))\n\t }\n\t}\n\n\tfunction utf8Slice (buf, start, end) {\n\t end = Math.min(buf.length, end)\n\t var res = []\n\n\t var i = start\n\t while (i < end) {\n\t var firstByte = buf[i]\n\t var codePoint = null\n\t var bytesPerSequence = (firstByte > 0xEF) ? 4\n\t : (firstByte > 0xDF) ? 3\n\t : (firstByte > 0xBF) ? 2\n\t : 1\n\n\t if (i + bytesPerSequence <= end) {\n\t var secondByte, thirdByte, fourthByte, tempCodePoint\n\n\t switch (bytesPerSequence) {\n\t case 1:\n\t if (firstByte < 0x80) {\n\t codePoint = firstByte\n\t }\n\t break\n\t case 2:\n\t secondByte = buf[i + 1]\n\t if ((secondByte & 0xC0) === 0x80) {\n\t tempCodePoint = (firstByte & 0x1F) << 0x6 | (secondByte & 0x3F)\n\t if (tempCodePoint > 0x7F) {\n\t codePoint = tempCodePoint\n\t }\n\t }\n\t break\n\t case 3:\n\t secondByte = buf[i + 1]\n\t thirdByte = buf[i + 2]\n\t if ((secondByte & 0xC0) === 0x80 && (thirdByte & 0xC0) === 0x80) {\n\t tempCodePoint = (firstByte & 0xF) << 0xC | (secondByte & 0x3F) << 0x6 | (thirdByte & 0x3F)\n\t if (tempCodePoint > 0x7FF && (tempCodePoint < 0xD800 || tempCodePoint > 0xDFFF)) {\n\t codePoint = tempCodePoint\n\t }\n\t }\n\t break\n\t case 4:\n\t secondByte = buf[i + 1]\n\t thirdByte = buf[i + 2]\n\t fourthByte = buf[i + 3]\n\t if ((secondByte & 0xC0) === 0x80 && (thirdByte & 0xC0) === 0x80 && (fourthByte & 0xC0) === 0x80) {\n\t tempCodePoint = (firstByte & 0xF) << 0x12 | (secondByte & 0x3F) << 0xC | (thirdByte & 0x3F) << 0x6 | (fourthByte & 0x3F)\n\t if (tempCodePoint > 0xFFFF && tempCodePoint < 0x110000) {\n\t codePoint = tempCodePoint\n\t }\n\t }\n\t }\n\t }\n\n\t if (codePoint === null) {\n\t // we did not generate a valid codePoint so insert a\n\t // replacement char (U+FFFD) and advance only 1 byte\n\t codePoint = 0xFFFD\n\t bytesPerSequence = 1\n\t } else if (codePoint > 0xFFFF) {\n\t // encode to utf16 (surrogate pair dance)\n\t codePoint -= 0x10000\n\t res.push(codePoint >>> 10 & 0x3FF | 0xD800)\n\t codePoint = 0xDC00 | codePoint & 0x3FF\n\t }\n\n\t res.push(codePoint)\n\t i += bytesPerSequence\n\t }\n\n\t return decodeCodePointsArray(res)\n\t}\n\n\t// Based on http://stackoverflow.com/a/22747272/680742, the browser with\n\t// the lowest limit is Chrome, with 0x10000 args.\n\t// We go 1 magnitude less, for safety\n\tvar MAX_ARGUMENTS_LENGTH = 0x1000\n\n\tfunction decodeCodePointsArray (codePoints) {\n\t var len = codePoints.length\n\t if (len <= MAX_ARGUMENTS_LENGTH) {\n\t return String.fromCharCode.apply(String, codePoints) // avoid extra slice()\n\t }\n\n\t // Decode in chunks to avoid \"call stack size exceeded\".\n\t var res = ''\n\t var i = 0\n\t while (i < len) {\n\t res += String.fromCharCode.apply(\n\t String,\n\t codePoints.slice(i, i += MAX_ARGUMENTS_LENGTH)\n\t )\n\t }\n\t return res\n\t}\n\n\tfunction asciiSlice (buf, start, end) {\n\t var ret = ''\n\t end = Math.min(buf.length, end)\n\n\t for (var i = start; i < end; i++) {\n\t ret += String.fromCharCode(buf[i] & 0x7F)\n\t }\n\t return ret\n\t}\n\n\tfunction binarySlice (buf, start, end) {\n\t var ret = ''\n\t end = Math.min(buf.length, end)\n\n\t for (var i = start; i < end; i++) {\n\t ret += String.fromCharCode(buf[i])\n\t }\n\t return ret\n\t}\n\n\tfunction hexSlice (buf, start, end) {\n\t var len = buf.length\n\n\t if (!start || start < 0) start = 0\n\t if (!end || end < 0 || end > len) end = len\n\n\t var out = ''\n\t for (var i = start; i < end; i++) {\n\t out += toHex(buf[i])\n\t }\n\t return out\n\t}\n\n\tfunction utf16leSlice (buf, start, end) {\n\t var bytes = buf.slice(start, end)\n\t var res = ''\n\t for (var i = 0; i < bytes.length; i += 2) {\n\t res += String.fromCharCode(bytes[i] + bytes[i + 1] * 256)\n\t }\n\t return res\n\t}\n\n\tBuffer.prototype.slice = function slice (start, end) {\n\t var len = this.length\n\t start = ~~start\n\t end = end === undefined ? len : ~~end\n\n\t if (start < 0) {\n\t start += len\n\t if (start < 0) start = 0\n\t } else if (start > len) {\n\t start = len\n\t }\n\n\t if (end < 0) {\n\t end += len\n\t if (end < 0) end = 0\n\t } else if (end > len) {\n\t end = len\n\t }\n\n\t if (end < start) end = start\n\n\t var newBuf\n\t if (Buffer.TYPED_ARRAY_SUPPORT) {\n\t newBuf = this.subarray(start, end)\n\t newBuf.__proto__ = Buffer.prototype\n\t } else {\n\t var sliceLen = end - start\n\t newBuf = new Buffer(sliceLen, undefined)\n\t for (var i = 0; i < sliceLen; i++) {\n\t newBuf[i] = this[i + start]\n\t }\n\t }\n\n\t return newBuf\n\t}\n\n\t/*\n\t * Need to make sure that buffer isn't trying to write out of bounds.\n\t */\n\tfunction checkOffset (offset, ext, length) {\n\t if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\n\t if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\n\t}\n\n\tBuffer.prototype.readUIntLE = function readUIntLE (offset, byteLength, noAssert) {\n\t offset = offset | 0\n\t byteLength = byteLength | 0\n\t if (!noAssert) checkOffset(offset, byteLength, this.length)\n\n\t var val = this[offset]\n\t var mul = 1\n\t var i = 0\n\t while (++i < byteLength && (mul *= 0x100)) {\n\t val += this[offset + i] * mul\n\t }\n\n\t return val\n\t}\n\n\tBuffer.prototype.readUIntBE = function readUIntBE (offset, byteLength, noAssert) {\n\t offset = offset | 0\n\t byteLength = byteLength | 0\n\t if (!noAssert) {\n\t checkOffset(offset, byteLength, this.length)\n\t }\n\n\t var val = this[offset + --byteLength]\n\t var mul = 1\n\t while (byteLength > 0 && (mul *= 0x100)) {\n\t val += this[offset + --byteLength] * mul\n\t }\n\n\t return val\n\t}\n\n\tBuffer.prototype.readUInt8 = function readUInt8 (offset, noAssert) {\n\t if (!noAssert) checkOffset(offset, 1, this.length)\n\t return this[offset]\n\t}\n\n\tBuffer.prototype.readUInt16LE = function readUInt16LE (offset, noAssert) {\n\t if (!noAssert) checkOffset(offset, 2, this.length)\n\t return this[offset] | (this[offset + 1] << 8)\n\t}\n\n\tBuffer.prototype.readUInt16BE = function readUInt16BE (offset, noAssert) {\n\t if (!noAssert) checkOffset(offset, 2, this.length)\n\t return (this[offset] << 8) | this[offset + 1]\n\t}\n\n\tBuffer.prototype.readUInt32LE = function readUInt32LE (offset, noAssert) {\n\t if (!noAssert) checkOffset(offset, 4, this.length)\n\n\t return ((this[offset]) |\n\t (this[offset + 1] << 8) |\n\t (this[offset + 2] << 16)) +\n\t (this[offset + 3] * 0x1000000)\n\t}\n\n\tBuffer.prototype.readUInt32BE = function readUInt32BE (offset, noAssert) {\n\t if (!noAssert) checkOffset(offset, 4, this.length)\n\n\t return (this[offset] * 0x1000000) +\n\t ((this[offset + 1] << 16) |\n\t (this[offset + 2] << 8) |\n\t this[offset + 3])\n\t}\n\n\tBuffer.prototype.readIntLE = function readIntLE (offset, byteLength, noAssert) {\n\t offset = offset | 0\n\t byteLength = byteLength | 0\n\t if (!noAssert) checkOffset(offset, byteLength, this.length)\n\n\t var val = this[offset]\n\t var mul = 1\n\t var i = 0\n\t while (++i < byteLength && (mul *= 0x100)) {\n\t val += this[offset + i] * mul\n\t }\n\t mul *= 0x80\n\n\t if (val >= mul) val -= Math.pow(2, 8 * byteLength)\n\n\t return val\n\t}\n\n\tBuffer.prototype.readIntBE = function readIntBE (offset, byteLength, noAssert) {\n\t offset = offset | 0\n\t byteLength = byteLength | 0\n\t if (!noAssert) checkOffset(offset, byteLength, this.length)\n\n\t var i = byteLength\n\t var mul = 1\n\t var val = this[offset + --i]\n\t while (i > 0 && (mul *= 0x100)) {\n\t val += this[offset + --i] * mul\n\t }\n\t mul *= 0x80\n\n\t if (val >= mul) val -= Math.pow(2, 8 * byteLength)\n\n\t return val\n\t}\n\n\tBuffer.prototype.readInt8 = function readInt8 (offset, noAssert) {\n\t if (!noAssert) checkOffset(offset, 1, this.length)\n\t if (!(this[offset] & 0x80)) return (this[offset])\n\t return ((0xff - this[offset] + 1) * -1)\n\t}\n\n\tBuffer.prototype.readInt16LE = function readInt16LE (offset, noAssert) {\n\t if (!noAssert) checkOffset(offset, 2, this.length)\n\t var val = this[offset] | (this[offset + 1] << 8)\n\t return (val & 0x8000) ? val | 0xFFFF0000 : val\n\t}\n\n\tBuffer.prototype.readInt16BE = function readInt16BE (offset, noAssert) {\n\t if (!noAssert) checkOffset(offset, 2, this.length)\n\t var val = this[offset + 1] | (this[offset] << 8)\n\t return (val & 0x8000) ? val | 0xFFFF0000 : val\n\t}\n\n\tBuffer.prototype.readInt32LE = function readInt32LE (offset, noAssert) {\n\t if (!noAssert) checkOffset(offset, 4, this.length)\n\n\t return (this[offset]) |\n\t (this[offset + 1] << 8) |\n\t (this[offset + 2] << 16) |\n\t (this[offset + 3] << 24)\n\t}\n\n\tBuffer.prototype.readInt32BE = function readInt32BE (offset, noAssert) {\n\t if (!noAssert) checkOffset(offset, 4, this.length)\n\n\t return (this[offset] << 24) |\n\t (this[offset + 1] << 16) |\n\t (this[offset + 2] << 8) |\n\t (this[offset + 3])\n\t}\n\n\tBuffer.prototype.readFloatLE = function readFloatLE (offset, noAssert) {\n\t if (!noAssert) checkOffset(offset, 4, this.length)\n\t return ieee754.read(this, offset, true, 23, 4)\n\t}\n\n\tBuffer.prototype.readFloatBE = function readFloatBE (offset, noAssert) {\n\t if (!noAssert) checkOffset(offset, 4, this.length)\n\t return ieee754.read(this, offset, false, 23, 4)\n\t}\n\n\tBuffer.prototype.readDoubleLE = function readDoubleLE (offset, noAssert) {\n\t if (!noAssert) checkOffset(offset, 8, this.length)\n\t return ieee754.read(this, offset, true, 52, 8)\n\t}\n\n\tBuffer.prototype.readDoubleBE = function readDoubleBE (offset, noAssert) {\n\t if (!noAssert) checkOffset(offset, 8, this.length)\n\t return ieee754.read(this, offset, false, 52, 8)\n\t}\n\n\tfunction checkInt (buf, value, offset, ext, max, min) {\n\t if (!Buffer.isBuffer(buf)) throw new TypeError('\"buffer\" argument must be a Buffer instance')\n\t if (value > max || value < min) throw new RangeError('\"value\" argument is out of bounds')\n\t if (offset + ext > buf.length) throw new RangeError('Index out of range')\n\t}\n\n\tBuffer.prototype.writeUIntLE = function writeUIntLE (value, offset, byteLength, noAssert) {\n\t value = +value\n\t offset = offset | 0\n\t byteLength = byteLength | 0\n\t if (!noAssert) {\n\t var maxBytes = Math.pow(2, 8 * byteLength) - 1\n\t checkInt(this, value, offset, byteLength, maxBytes, 0)\n\t }\n\n\t var mul = 1\n\t var i = 0\n\t this[offset] = value & 0xFF\n\t while (++i < byteLength && (mul *= 0x100)) {\n\t this[offset + i] = (value / mul) & 0xFF\n\t }\n\n\t return offset + byteLength\n\t}\n\n\tBuffer.prototype.writeUIntBE = function writeUIntBE (value, offset, byteLength, noAssert) {\n\t value = +value\n\t offset = offset | 0\n\t byteLength = byteLength | 0\n\t if (!noAssert) {\n\t var maxBytes = Math.pow(2, 8 * byteLength) - 1\n\t checkInt(this, value, offset, byteLength, maxBytes, 0)\n\t }\n\n\t var i = byteLength - 1\n\t var mul = 1\n\t this[offset + i] = value & 0xFF\n\t while (--i >= 0 && (mul *= 0x100)) {\n\t this[offset + i] = (value / mul) & 0xFF\n\t }\n\n\t return offset + byteLength\n\t}\n\n\tBuffer.prototype.writeUInt8 = function writeUInt8 (value, offset, noAssert) {\n\t value = +value\n\t offset = offset | 0\n\t if (!noAssert) checkInt(this, value, offset, 1, 0xff, 0)\n\t if (!Buffer.TYPED_ARRAY_SUPPORT) value = Math.floor(value)\n\t this[offset] = (value & 0xff)\n\t return offset + 1\n\t}\n\n\tfunction objectWriteUInt16 (buf, value, offset, littleEndian) {\n\t if (value < 0) value = 0xffff + value + 1\n\t for (var i = 0, j = Math.min(buf.length - offset, 2); i < j; i++) {\n\t buf[offset + i] = (value & (0xff << (8 * (littleEndian ? i : 1 - i)))) >>>\n\t (littleEndian ? i : 1 - i) * 8\n\t }\n\t}\n\n\tBuffer.prototype.writeUInt16LE = function writeUInt16LE (value, offset, noAssert) {\n\t value = +value\n\t offset = offset | 0\n\t if (!noAssert) checkInt(this, value, offset, 2, 0xffff, 0)\n\t if (Buffer.TYPED_ARRAY_SUPPORT) {\n\t this[offset] = (value & 0xff)\n\t this[offset + 1] = (value >>> 8)\n\t } else {\n\t objectWriteUInt16(this, value, offset, true)\n\t }\n\t return offset + 2\n\t}\n\n\tBuffer.prototype.writeUInt16BE = function writeUInt16BE (value, offset, noAssert) {\n\t value = +value\n\t offset = offset | 0\n\t if (!noAssert) checkInt(this, value, offset, 2, 0xffff, 0)\n\t if (Buffer.TYPED_ARRAY_SUPPORT) {\n\t this[offset] = (value >>> 8)\n\t this[offset + 1] = (value & 0xff)\n\t } else {\n\t objectWriteUInt16(this, value, offset, false)\n\t }\n\t return offset + 2\n\t}\n\n\tfunction objectWriteUInt32 (buf, value, offset, littleEndian) {\n\t if (value < 0) value = 0xffffffff + value + 1\n\t for (var i = 0, j = Math.min(buf.length - offset, 4); i < j; i++) {\n\t buf[offset + i] = (value >>> (littleEndian ? i : 3 - i) * 8) & 0xff\n\t }\n\t}\n\n\tBuffer.prototype.writeUInt32LE = function writeUInt32LE (value, offset, noAssert) {\n\t value = +value\n\t offset = offset | 0\n\t if (!noAssert) checkInt(this, value, offset, 4, 0xffffffff, 0)\n\t if (Buffer.TYPED_ARRAY_SUPPORT) {\n\t this[offset + 3] = (value >>> 24)\n\t this[offset + 2] = (value >>> 16)\n\t this[offset + 1] = (value >>> 8)\n\t this[offset] = (value & 0xff)\n\t } else {\n\t objectWriteUInt32(this, value, offset, true)\n\t }\n\t return offset + 4\n\t}\n\n\tBuffer.prototype.writeUInt32BE = function writeUInt32BE (value, offset, noAssert) {\n\t value = +value\n\t offset = offset | 0\n\t if (!noAssert) checkInt(this, value, offset, 4, 0xffffffff, 0)\n\t if (Buffer.TYPED_ARRAY_SUPPORT) {\n\t this[offset] = (value >>> 24)\n\t this[offset + 1] = (value >>> 16)\n\t this[offset + 2] = (value >>> 8)\n\t this[offset + 3] = (value & 0xff)\n\t } else {\n\t objectWriteUInt32(this, value, offset, false)\n\t }\n\t return offset + 4\n\t}\n\n\tBuffer.prototype.writeIntLE = function writeIntLE (value, offset, byteLength, noAssert) {\n\t value = +value\n\t offset = offset | 0\n\t if (!noAssert) {\n\t var limit = Math.pow(2, 8 * byteLength - 1)\n\n\t checkInt(this, value, offset, byteLength, limit - 1, -limit)\n\t }\n\n\t var i = 0\n\t var mul = 1\n\t var sub = 0\n\t this[offset] = value & 0xFF\n\t while (++i < byteLength && (mul *= 0x100)) {\n\t if (value < 0 && sub === 0 && this[offset + i - 1] !== 0) {\n\t sub = 1\n\t }\n\t this[offset + i] = ((value / mul) >> 0) - sub & 0xFF\n\t }\n\n\t return offset + byteLength\n\t}\n\n\tBuffer.prototype.writeIntBE = function writeIntBE (value, offset, byteLength, noAssert) {\n\t value = +value\n\t offset = offset | 0\n\t if (!noAssert) {\n\t var limit = Math.pow(2, 8 * byteLength - 1)\n\n\t checkInt(this, value, offset, byteLength, limit - 1, -limit)\n\t }\n\n\t var i = byteLength - 1\n\t var mul = 1\n\t var sub = 0\n\t this[offset + i] = value & 0xFF\n\t while (--i >= 0 && (mul *= 0x100)) {\n\t if (value < 0 && sub === 0 && this[offset + i + 1] !== 0) {\n\t sub = 1\n\t }\n\t this[offset + i] = ((value / mul) >> 0) - sub & 0xFF\n\t }\n\n\t return offset + byteLength\n\t}\n\n\tBuffer.prototype.writeInt8 = function writeInt8 (value, offset, noAssert) {\n\t value = +value\n\t offset = offset | 0\n\t if (!noAssert) checkInt(this, value, offset, 1, 0x7f, -0x80)\n\t if (!Buffer.TYPED_ARRAY_SUPPORT) value = Math.floor(value)\n\t if (value < 0) value = 0xff + value + 1\n\t this[offset] = (value & 0xff)\n\t return offset + 1\n\t}\n\n\tBuffer.prototype.writeInt16LE = function writeInt16LE (value, offset, noAssert) {\n\t value = +value\n\t offset = offset | 0\n\t if (!noAssert) checkInt(this, value, offset, 2, 0x7fff, -0x8000)\n\t if (Buffer.TYPED_ARRAY_SUPPORT) {\n\t this[offset] = (value & 0xff)\n\t this[offset + 1] = (value >>> 8)\n\t } else {\n\t objectWriteUInt16(this, value, offset, true)\n\t }\n\t return offset + 2\n\t}\n\n\tBuffer.prototype.writeInt16BE = function writeInt16BE (value, offset, noAssert) {\n\t value = +value\n\t offset = offset | 0\n\t if (!noAssert) checkInt(this, value, offset, 2, 0x7fff, -0x8000)\n\t if (Buffer.TYPED_ARRAY_SUPPORT) {\n\t this[offset] = (value >>> 8)\n\t this[offset + 1] = (value & 0xff)\n\t } else {\n\t objectWriteUInt16(this, value, offset, false)\n\t }\n\t return offset + 2\n\t}\n\n\tBuffer.prototype.writeInt32LE = function writeInt32LE (value, offset, noAssert) {\n\t value = +value\n\t offset = offset | 0\n\t if (!noAssert) checkInt(this, value, offset, 4, 0x7fffffff, -0x80000000)\n\t if (Buffer.TYPED_ARRAY_SUPPORT) {\n\t this[offset] = (value & 0xff)\n\t this[offset + 1] = (value >>> 8)\n\t this[offset + 2] = (value >>> 16)\n\t this[offset + 3] = (value >>> 24)\n\t } else {\n\t objectWriteUInt32(this, value, offset, true)\n\t }\n\t return offset + 4\n\t}\n\n\tBuffer.prototype.writeInt32BE = function writeInt32BE (value, offset, noAssert) {\n\t value = +value\n\t offset = offset | 0\n\t if (!noAssert) checkInt(this, value, offset, 4, 0x7fffffff, -0x80000000)\n\t if (value < 0) value = 0xffffffff + value + 1\n\t if (Buffer.TYPED_ARRAY_SUPPORT) {\n\t this[offset] = (value >>> 24)\n\t this[offset + 1] = (value >>> 16)\n\t this[offset + 2] = (value >>> 8)\n\t this[offset + 3] = (value & 0xff)\n\t } else {\n\t objectWriteUInt32(this, value, offset, false)\n\t }\n\t return offset + 4\n\t}\n\n\tfunction checkIEEE754 (buf, value, offset, ext, max, min) {\n\t if (offset + ext > buf.length) throw new RangeError('Index out of range')\n\t if (offset < 0) throw new RangeError('Index out of range')\n\t}\n\n\tfunction writeFloat (buf, value, offset, littleEndian, noAssert) {\n\t if (!noAssert) {\n\t checkIEEE754(buf, value, offset, 4, 3.4028234663852886e+38, -3.4028234663852886e+38)\n\t }\n\t ieee754.write(buf, value, offset, littleEndian, 23, 4)\n\t return offset + 4\n\t}\n\n\tBuffer.prototype.writeFloatLE = function writeFloatLE (value, offset, noAssert) {\n\t return writeFloat(this, value, offset, true, noAssert)\n\t}\n\n\tBuffer.prototype.writeFloatBE = function writeFloatBE (value, offset, noAssert) {\n\t return writeFloat(this, value, offset, false, noAssert)\n\t}\n\n\tfunction writeDouble (buf, value, offset, littleEndian, noAssert) {\n\t if (!noAssert) {\n\t checkIEEE754(buf, value, offset, 8, 1.7976931348623157E+308, -1.7976931348623157E+308)\n\t }\n\t ieee754.write(buf, value, offset, littleEndian, 52, 8)\n\t return offset + 8\n\t}\n\n\tBuffer.prototype.writeDoubleLE = function writeDoubleLE (value, offset, noAssert) {\n\t return writeDouble(this, value, offset, true, noAssert)\n\t}\n\n\tBuffer.prototype.writeDoubleBE = function writeDoubleBE (value, offset, noAssert) {\n\t return writeDouble(this, value, offset, false, noAssert)\n\t}\n\n\t// copy(targetBuffer, targetStart=0, sourceStart=0, sourceEnd=buffer.length)\n\tBuffer.prototype.copy = function copy (target, targetStart, start, end) {\n\t if (!start) start = 0\n\t if (!end && end !== 0) end = this.length\n\t if (targetStart >= target.length) targetStart = target.length\n\t if (!targetStart) targetStart = 0\n\t if (end > 0 && end < start) end = start\n\n\t // Copy 0 bytes; we're done\n\t if (end === start) return 0\n\t if (target.length === 0 || this.length === 0) return 0\n\n\t // Fatal error conditions\n\t if (targetStart < 0) {\n\t throw new RangeError('targetStart out of bounds')\n\t }\n\t if (start < 0 || start >= this.length) throw new RangeError('sourceStart out of bounds')\n\t if (end < 0) throw new RangeError('sourceEnd out of bounds')\n\n\t // Are we oob?\n\t if (end > this.length) end = this.length\n\t if (target.length - targetStart < end - start) {\n\t end = target.length - targetStart + start\n\t }\n\n\t var len = end - start\n\t var i\n\n\t if (this === target && start < targetStart && targetStart < end) {\n\t // descending copy from end\n\t for (i = len - 1; i >= 0; i--) {\n\t target[i + targetStart] = this[i + start]\n\t }\n\t } else if (len < 1000 || !Buffer.TYPED_ARRAY_SUPPORT) {\n\t // ascending copy from start\n\t for (i = 0; i < len; i++) {\n\t target[i + targetStart] = this[i + start]\n\t }\n\t } else {\n\t Uint8Array.prototype.set.call(\n\t target,\n\t this.subarray(start, start + len),\n\t targetStart\n\t )\n\t }\n\n\t return len\n\t}\n\n\t// Usage:\n\t// buffer.fill(number[, offset[, end]])\n\t// buffer.fill(buffer[, offset[, end]])\n\t// buffer.fill(string[, offset[, end]][, encoding])\n\tBuffer.prototype.fill = function fill (val, start, end, encoding) {\n\t // Handle string cases:\n\t if (typeof val === 'string') {\n\t if (typeof start === 'string') {\n\t encoding = start\n\t start = 0\n\t end = this.length\n\t } else if (typeof end === 'string') {\n\t encoding = end\n\t end = this.length\n\t }\n\t if (val.length === 1) {\n\t var code = val.charCodeAt(0)\n\t if (code < 256) {\n\t val = code\n\t }\n\t }\n\t if (encoding !== undefined && typeof encoding !== 'string') {\n\t throw new TypeError('encoding must be a string')\n\t }\n\t if (typeof encoding === 'string' && !Buffer.isEncoding(encoding)) {\n\t throw new TypeError('Unknown encoding: ' + encoding)\n\t }\n\t } else if (typeof val === 'number') {\n\t val = val & 255\n\t }\n\n\t // Invalid ranges are not set to a default, so can range check early.\n\t if (start < 0 || this.length < start || this.length < end) {\n\t throw new RangeError('Out of range index')\n\t }\n\n\t if (end <= start) {\n\t return this\n\t }\n\n\t start = start >>> 0\n\t end = end === undefined ? this.length : end >>> 0\n\n\t if (!val) val = 0\n\n\t var i\n\t if (typeof val === 'number') {\n\t for (i = start; i < end; i++) {\n\t this[i] = val\n\t }\n\t } else {\n\t var bytes = Buffer.isBuffer(val)\n\t ? val\n\t : utf8ToBytes(new Buffer(val, encoding).toString())\n\t var len = bytes.length\n\t for (i = 0; i < end - start; i++) {\n\t this[i + start] = bytes[i % len]\n\t }\n\t }\n\n\t return this\n\t}\n\n\t// HELPER FUNCTIONS\n\t// ================\n\n\tvar INVALID_BASE64_RE = /[^+\\/0-9A-Za-z-_]/g\n\n\tfunction base64clean (str) {\n\t // Node strips out invalid characters like \\n and \\t from the string, base64-js does not\n\t str = stringtrim(str).replace(INVALID_BASE64_RE, '')\n\t // Node converts strings with length < 2 to ''\n\t if (str.length < 2) return ''\n\t // Node allows for non-padded base64 strings (missing trailing ===), base64-js does not\n\t while (str.length % 4 !== 0) {\n\t str = str + '='\n\t }\n\t return str\n\t}\n\n\tfunction stringtrim (str) {\n\t if (str.trim) return str.trim()\n\t return str.replace(/^\\s+|\\s+$/g, '')\n\t}\n\n\tfunction toHex (n) {\n\t if (n < 16) return '0' + n.toString(16)\n\t return n.toString(16)\n\t}\n\n\tfunction utf8ToBytes (string, units) {\n\t units = units || Infinity\n\t var codePoint\n\t var length = string.length\n\t var leadSurrogate = null\n\t var bytes = []\n\n\t for (var i = 0; i < length; i++) {\n\t codePoint = string.charCodeAt(i)\n\n\t // is surrogate component\n\t if (codePoint > 0xD7FF && codePoint < 0xE000) {\n\t // last char was a lead\n\t if (!leadSurrogate) {\n\t // no lead yet\n\t if (codePoint > 0xDBFF) {\n\t // unexpected trail\n\t if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD)\n\t continue\n\t } else if (i + 1 === length) {\n\t // unpaired lead\n\t if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD)\n\t continue\n\t }\n\n\t // valid lead\n\t leadSurrogate = codePoint\n\n\t continue\n\t }\n\n\t // 2 leads in a row\n\t if (codePoint < 0xDC00) {\n\t if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD)\n\t leadSurrogate = codePoint\n\t continue\n\t }\n\n\t // valid surrogate pair\n\t codePoint = (leadSurrogate - 0xD800 << 10 | codePoint - 0xDC00) + 0x10000\n\t } else if (leadSurrogate) {\n\t // valid bmp char, but last char was a lead\n\t if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD)\n\t }\n\n\t leadSurrogate = null\n\n\t // encode utf8\n\t if (codePoint < 0x80) {\n\t if ((units -= 1) < 0) break\n\t bytes.push(codePoint)\n\t } else if (codePoint < 0x800) {\n\t if ((units -= 2) < 0) break\n\t bytes.push(\n\t codePoint >> 0x6 | 0xC0,\n\t codePoint & 0x3F | 0x80\n\t )\n\t } else if (codePoint < 0x10000) {\n\t if ((units -= 3) < 0) break\n\t bytes.push(\n\t codePoint >> 0xC | 0xE0,\n\t codePoint >> 0x6 & 0x3F | 0x80,\n\t codePoint & 0x3F | 0x80\n\t )\n\t } else if (codePoint < 0x110000) {\n\t if ((units -= 4) < 0) break\n\t bytes.push(\n\t codePoint >> 0x12 | 0xF0,\n\t codePoint >> 0xC & 0x3F | 0x80,\n\t codePoint >> 0x6 & 0x3F | 0x80,\n\t codePoint & 0x3F | 0x80\n\t )\n\t } else {\n\t throw new Error('Invalid code point')\n\t }\n\t }\n\n\t return bytes\n\t}\n\n\tfunction asciiToBytes (str) {\n\t var byteArray = []\n\t for (var i = 0; i < str.length; i++) {\n\t // Node's code seems to be doing this and not & 0x7F..\n\t byteArray.push(str.charCodeAt(i) & 0xFF)\n\t }\n\t return byteArray\n\t}\n\n\tfunction utf16leToBytes (str, units) {\n\t var c, hi, lo\n\t var byteArray = []\n\t for (var i = 0; i < str.length; i++) {\n\t if ((units -= 2) < 0) break\n\n\t c = str.charCodeAt(i)\n\t hi = c >> 8\n\t lo = c % 256\n\t byteArray.push(lo)\n\t byteArray.push(hi)\n\t }\n\n\t return byteArray\n\t}\n\n\tfunction base64ToBytes (str) {\n\t return base64.toByteArray(base64clean(str))\n\t}\n\n\tfunction blitBuffer (src, dst, offset, length) {\n\t for (var i = 0; i < length; i++) {\n\t if ((i + offset >= dst.length) || (i >= src.length)) break\n\t dst[i + offset] = src[i]\n\t }\n\t return i\n\t}\n\n\tfunction isnan (val) {\n\t return val !== val // eslint-disable-line no-self-compare\n\t}\n\n\t/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(1).Buffer, (function() { return this; }())))\n\n/***/ },\n/* 2 */\n/***/ function(module, exports) {\n\n\tif (typeof Object.create === 'function') {\n\t // implementation from standard node.js 'util' module\n\t module.exports = function inherits(ctor, superCtor) {\n\t ctor.super_ = superCtor\n\t ctor.prototype = Object.create(superCtor.prototype, {\n\t constructor: {\n\t value: ctor,\n\t enumerable: false,\n\t writable: true,\n\t configurable: true\n\t }\n\t });\n\t };\n\t} else {\n\t // old school shim for old browsers\n\t module.exports = function inherits(ctor, superCtor) {\n\t ctor.super_ = superCtor\n\t var TempCtor = function () {}\n\t TempCtor.prototype = superCtor.prototype\n\t ctor.prototype = new TempCtor()\n\t ctor.prototype.constructor = ctor\n\t }\n\t}\n\n\n/***/ },\n/* 3 */\n/***/ function(module, exports, __webpack_require__) {\n\n\tvar isObject = __webpack_require__(6);\n\tmodule.exports = function(it){\n\t if(!isObject(it))throw TypeError(it + ' is not an object!');\n\t return it;\n\t};\n\n/***/ },\n/* 4 */\n/***/ function(module, exports) {\n\n\tmodule.exports = function(exec){\n\t try {\n\t return !!exec();\n\t } catch(e){\n\t return true;\n\t }\n\t};\n\n/***/ },\n/* 5 */\n/***/ function(module, exports) {\n\n\t// https://github.com/zloirock/core-js/issues/86#issuecomment-115759028\n\tvar global = module.exports = typeof window != 'undefined' && window.Math == Math\n\t ? window : typeof self != 'undefined' && self.Math == Math ? self : Function('return this')();\n\tif(typeof __g == 'number')__g = global; // eslint-disable-line no-undef\n\n/***/ },\n/* 6 */\n/***/ function(module, exports) {\n\n\tmodule.exports = function(it){\n\t return typeof it === 'object' ? it !== null : typeof it === 'function';\n\t};\n\n/***/ },\n/* 7 */\n/***/ function(module, exports, __webpack_require__) {\n\n\tvar store = __webpack_require__(86)('wks')\n\t , uid = __webpack_require__(47)\n\t , Symbol = __webpack_require__(5).Symbol\n\t , USE_SYMBOL = typeof Symbol == 'function';\n\n\tvar $exports = module.exports = function(name){\n\t return store[name] || (store[name] =\n\t USE_SYMBOL && Symbol[name] || (USE_SYMBOL ? Symbol : uid)('Symbol.' + name));\n\t};\n\n\t$exports.store = store;\n\n/***/ },\n/* 8 */\n/***/ function(module, exports) {\n\n\t// shim for using process in browser\n\n\tvar process = module.exports = {};\n\tvar queue = [];\n\tvar draining = false;\n\tvar currentQueue;\n\tvar queueIndex = -1;\n\n\tfunction cleanUpNextTick() {\n\t draining = false;\n\t if (currentQueue.length) {\n\t queue = currentQueue.concat(queue);\n\t } else {\n\t queueIndex = -1;\n\t }\n\t if (queue.length) {\n\t drainQueue();\n\t }\n\t}\n\n\tfunction drainQueue() {\n\t if (draining) {\n\t return;\n\t }\n\t var timeout = setTimeout(cleanUpNextTick);\n\t draining = true;\n\n\t var len = queue.length;\n\t while(len) {\n\t currentQueue = queue;\n\t queue = [];\n\t while (++queueIndex < len) {\n\t if (currentQueue) {\n\t currentQueue[queueIndex].run();\n\t }\n\t }\n\t queueIndex = -1;\n\t len = queue.length;\n\t }\n\t currentQueue = null;\n\t draining = false;\n\t clearTimeout(timeout);\n\t}\n\n\tprocess.nextTick = function (fun) {\n\t var args = new Array(arguments.length - 1);\n\t if (arguments.length > 1) {\n\t for (var i = 1; i < arguments.length; i++) {\n\t args[i - 1] = arguments[i];\n\t }\n\t }\n\t queue.push(new Item(fun, args));\n\t if (queue.length === 1 && !draining) {\n\t setTimeout(drainQueue, 0);\n\t }\n\t};\n\n\t// v8 likes predictible objects\n\tfunction Item(fun, array) {\n\t this.fun = fun;\n\t this.array = array;\n\t}\n\tItem.prototype.run = function () {\n\t this.fun.apply(null, this.array);\n\t};\n\tprocess.title = 'browser';\n\tprocess.browser = true;\n\tprocess.env = {};\n\tprocess.argv = [];\n\tprocess.version = ''; // empty string to avoid regexp issues\n\tprocess.versions = {};\n\n\tfunction noop() {}\n\n\tprocess.on = noop;\n\tprocess.addListener = noop;\n\tprocess.once = noop;\n\tprocess.off = noop;\n\tprocess.removeListener = noop;\n\tprocess.removeAllListeners = noop;\n\tprocess.emit = noop;\n\n\tprocess.binding = function (name) {\n\t throw new Error('process.binding is not supported');\n\t};\n\n\tprocess.cwd = function () { return '/' };\n\tprocess.chdir = function (dir) {\n\t throw new Error('process.chdir is not supported');\n\t};\n\tprocess.umask = function() { return 0; };\n\n\n/***/ },\n/* 9 */\n/***/ function(module, exports, __webpack_require__) {\n\n\t// Thank's IE8 for his funny defineProperty\n\tmodule.exports = !__webpack_require__(4)(function(){\n\t return Object.defineProperty({}, 'a', {get: function(){ return 7; }}).a != 7;\n\t});\n\n/***/ },\n/* 10 */\n/***/ function(module, exports, __webpack_require__) {\n\n\tvar anObject = __webpack_require__(3)\n\t , IE8_DOM_DEFINE = __webpack_require__(159)\n\t , toPrimitive = __webpack_require__(31)\n\t , dP = Object.defineProperty;\n\n\texports.f = __webpack_require__(9) ? Object.defineProperty : function defineProperty(O, P, Attributes){\n\t anObject(O);\n\t P = toPrimitive(P, true);\n\t anObject(Attributes);\n\t if(IE8_DOM_DEFINE)try {\n\t return dP(O, P, Attributes);\n\t } catch(e){ /* empty */ }\n\t if('get' in Attributes || 'set' in Attributes)throw TypeError('Accessors not supported!');\n\t if('value' in Attributes)O[P] = Attributes.value;\n\t return O;\n\t};\n\n/***/ },\n/* 11 */\n/***/ function(module, exports, __webpack_require__) {\n\n\t/* WEBPACK VAR INJECTION */(function(module) {(function (module, exports) {\n\t 'use strict';\n\n\t // Utils\n\t function assert (val, msg) {\n\t if (!val) throw new Error(msg || 'Assertion failed');\n\t }\n\n\t // Could use `inherits` module, but don't want to move from single file\n\t // architecture yet.\n\t function inherits (ctor, superCtor) {\n\t ctor.super_ = superCtor;\n\t var TempCtor = function () {};\n\t TempCtor.prototype = superCtor.prototype;\n\t ctor.prototype = new TempCtor();\n\t ctor.prototype.constructor = ctor;\n\t }\n\n\t // BN\n\n\t function BN (number, base, endian) {\n\t if (BN.isBN(number)) {\n\t return number;\n\t }\n\n\t this.negative = 0;\n\t this.words = null;\n\t this.length = 0;\n\n\t // Reduction context\n\t this.red = null;\n\n\t if (number !== null) {\n\t if (base === 'le' || base === 'be') {\n\t endian = base;\n\t base = 10;\n\t }\n\n\t this._init(number || 0, base || 10, endian || 'be');\n\t }\n\t }\n\t if (typeof module === 'object') {\n\t module.exports = BN;\n\t } else {\n\t exports.BN = BN;\n\t }\n\n\t BN.BN = BN;\n\t BN.wordSize = 26;\n\n\t var Buffer;\n\t try {\n\t Buffer = __webpack_require__(1).Buffer;\n\t } catch (e) {\n\t }\n\n\t BN.isBN = function isBN (num) {\n\t return num !== null && typeof num === 'object' &&\n\t num.constructor.name === 'BN' && Array.isArray(num.words);\n\t };\n\n\t BN.max = function max (left, right) {\n\t if (left.cmp(right) > 0) return left;\n\t return right;\n\t };\n\n\t BN.min = function min (left, right) {\n\t if (left.cmp(right) < 0) return left;\n\t return right;\n\t };\n\n\t BN.prototype._init = function init (number, base, endian) {\n\t if (typeof number === 'number') {\n\t return this._initNumber(number, base, endian);\n\t }\n\n\t if (typeof number === 'object') {\n\t return this._initArray(number, base, endian);\n\t }\n\n\t if (base === 'hex') {\n\t base = 16;\n\t }\n\t assert(base === (base | 0) && base >= 2 && base <= 36);\n\n\t number = number.toString().replace(/\\s+/g, '');\n\t var start = 0;\n\t if (number[0] === '-') {\n\t start++;\n\t }\n\n\t if (base === 16) {\n\t this._parseHex(number, start);\n\t } else {\n\t this._parseBase(number, base, start);\n\t }\n\n\t if (number[0] === '-') {\n\t this.negative = 1;\n\t }\n\n\t this.strip();\n\n\t if (endian !== 'le') return;\n\n\t this._initArray(this.toArray(), base, endian);\n\t };\n\n\t BN.prototype._initNumber = function _initNumber (number, base, endian) {\n\t if (number < 0) {\n\t this.negative = 1;\n\t number = -number;\n\t }\n\t if (number < 0x4000000) {\n\t this.words = [ number & 0x3ffffff ];\n\t this.length = 1;\n\t } else if (number < 0x10000000000000) {\n\t this.words = [\n\t number & 0x3ffffff,\n\t (number / 0x4000000) & 0x3ffffff\n\t ];\n\t this.length = 2;\n\t } else {\n\t assert(number < 0x20000000000000); // 2 ^ 53 (unsafe)\n\t this.words = [\n\t number & 0x3ffffff,\n\t (number / 0x4000000) & 0x3ffffff,\n\t 1\n\t ];\n\t this.length = 3;\n\t }\n\n\t if (endian !== 'le') return;\n\n\t // Reverse the bytes\n\t this._initArray(this.toArray(), base, endian);\n\t };\n\n\t BN.prototype._initArray = function _initArray (number, base, endian) {\n\t // Perhaps a Uint8Array\n\t assert(typeof number.length === 'number');\n\t if (number.length <= 0) {\n\t this.words = [ 0 ];\n\t this.length = 1;\n\t return this;\n\t }\n\n\t this.length = Math.ceil(number.length / 3);\n\t this.words = new Array(this.length);\n\t for (var i = 0; i < this.length; i++) {\n\t this.words[i] = 0;\n\t }\n\n\t var j, w;\n\t var off = 0;\n\t if (endian === 'be') {\n\t for (i = number.length - 1, j = 0; i >= 0; i -= 3) {\n\t w = number[i] | (number[i - 1] << 8) | (number[i - 2] << 16);\n\t this.words[j] |= (w << off) & 0x3ffffff;\n\t this.words[j + 1] = (w >>> (26 - off)) & 0x3ffffff;\n\t off += 24;\n\t if (off >= 26) {\n\t off -= 26;\n\t j++;\n\t }\n\t }\n\t } else if (endian === 'le') {\n\t for (i = 0, j = 0; i < number.length; i += 3) {\n\t w = number[i] | (number[i + 1] << 8) | (number[i + 2] << 16);\n\t this.words[j] |= (w << off) & 0x3ffffff;\n\t this.words[j + 1] = (w >>> (26 - off)) & 0x3ffffff;\n\t off += 24;\n\t if (off >= 26) {\n\t off -= 26;\n\t j++;\n\t }\n\t }\n\t }\n\t return this.strip();\n\t };\n\n\t function parseHex (str, start, end) {\n\t var r = 0;\n\t var len = Math.min(str.length, end);\n\t for (var i = start; i < len; i++) {\n\t var c = str.charCodeAt(i) - 48;\n\n\t r <<= 4;\n\n\t // 'a' - 'f'\n\t if (c >= 49 && c <= 54) {\n\t r |= c - 49 + 0xa;\n\n\t // 'A' - 'F'\n\t } else if (c >= 17 && c <= 22) {\n\t r |= c - 17 + 0xa;\n\n\t // '0' - '9'\n\t } else {\n\t r |= c & 0xf;\n\t }\n\t }\n\t return r;\n\t }\n\n\t BN.prototype._parseHex = function _parseHex (number, start) {\n\t // Create possibly bigger array to ensure that it fits the number\n\t this.length = Math.ceil((number.length - start) / 6);\n\t this.words = new Array(this.length);\n\t for (var i = 0; i < this.length; i++) {\n\t this.words[i] = 0;\n\t }\n\n\t var j, w;\n\t // Scan 24-bit chunks and add them to the number\n\t var off = 0;\n\t for (i = number.length - 6, j = 0; i >= start; i -= 6) {\n\t w = parseHex(number, i, i + 6);\n\t this.words[j] |= (w << off) & 0x3ffffff;\n\t // NOTE: `0x3fffff` is intentional here, 26bits max shift + 24bit hex limb\n\t this.words[j + 1] |= w >>> (26 - off) & 0x3fffff;\n\t off += 24;\n\t if (off >= 26) {\n\t off -= 26;\n\t j++;\n\t }\n\t }\n\t if (i + 6 !== start) {\n\t w = parseHex(number, start, i + 6);\n\t this.words[j] |= (w << off) & 0x3ffffff;\n\t this.words[j + 1] |= w >>> (26 - off) & 0x3fffff;\n\t }\n\t this.strip();\n\t };\n\n\t function parseBase (str, start, end, mul) {\n\t var r = 0;\n\t var len = Math.min(str.length, end);\n\t for (var i = start; i < len; i++) {\n\t var c = str.charCodeAt(i) - 48;\n\n\t r *= mul;\n\n\t // 'a'\n\t if (c >= 49) {\n\t r += c - 49 + 0xa;\n\n\t // 'A'\n\t } else if (c >= 17) {\n\t r += c - 17 + 0xa;\n\n\t // '0' - '9'\n\t } else {\n\t r += c;\n\t }\n\t }\n\t return r;\n\t }\n\n\t BN.prototype._parseBase = function _parseBase (number, base, start) {\n\t // Initialize as zero\n\t this.words = [ 0 ];\n\t this.length = 1;\n\n\t // Find length of limb in base\n\t for (var limbLen = 0, limbPow = 1; limbPow <= 0x3ffffff; limbPow *= base) {\n\t limbLen++;\n\t }\n\t limbLen--;\n\t limbPow = (limbPow / base) | 0;\n\n\t var total = number.length - start;\n\t var mod = total % limbLen;\n\t var end = Math.min(total, total - mod) + start;\n\n\t var word = 0;\n\t for (var i = start; i < end; i += limbLen) {\n\t word = parseBase(number, i, i + limbLen, base);\n\n\t this.imuln(limbPow);\n\t if (this.words[0] + word < 0x4000000) {\n\t this.words[0] += word;\n\t } else {\n\t this._iaddn(word);\n\t }\n\t }\n\n\t if (mod !== 0) {\n\t var pow = 1;\n\t word = parseBase(number, i, number.length, base);\n\n\t for (i = 0; i < mod; i++) {\n\t pow *= base;\n\t }\n\n\t this.imuln(pow);\n\t if (this.words[0] + word < 0x4000000) {\n\t this.words[0] += word;\n\t } else {\n\t this._iaddn(word);\n\t }\n\t }\n\t };\n\n\t BN.prototype.copy = function copy (dest) {\n\t dest.words = new Array(this.length);\n\t for (var i = 0; i < this.length; i++) {\n\t dest.words[i] = this.words[i];\n\t }\n\t dest.length = this.length;\n\t dest.negative = this.negative;\n\t dest.red = this.red;\n\t };\n\n\t BN.prototype.clone = function clone () {\n\t var r = new BN(null);\n\t this.copy(r);\n\t return r;\n\t };\n\n\t BN.prototype._expand = function _expand (size) {\n\t while (this.length < size) {\n\t this.words[this.length++] = 0;\n\t }\n\t return this;\n\t };\n\n\t // Remove leading `0` from `this`\n\t BN.prototype.strip = function strip () {\n\t while (this.length > 1 && this.words[this.length - 1] === 0) {\n\t this.length--;\n\t }\n\t return this._normSign();\n\t };\n\n\t BN.prototype._normSign = function _normSign () {\n\t // -0 = 0\n\t if (this.length === 1 && this.words[0] === 0) {\n\t this.negative = 0;\n\t }\n\t return this;\n\t };\n\n\t BN.prototype.inspect = function inspect () {\n\t return (this.red ? '';\n\t };\n\n\t /*\n\n\t var zeros = [];\n\t var groupSizes = [];\n\t var groupBases = [];\n\n\t var s = '';\n\t var i = -1;\n\t while (++i < BN.wordSize) {\n\t zeros[i] = s;\n\t s += '0';\n\t }\n\t groupSizes[0] = 0;\n\t groupSizes[1] = 0;\n\t groupBases[0] = 0;\n\t groupBases[1] = 0;\n\t var base = 2 - 1;\n\t while (++base < 36 + 1) {\n\t var groupSize = 0;\n\t var groupBase = 1;\n\t while (groupBase < (1 << BN.wordSize) / base) {\n\t groupBase *= base;\n\t groupSize += 1;\n\t }\n\t groupSizes[base] = groupSize;\n\t groupBases[base] = groupBase;\n\t }\n\n\t */\n\n\t var zeros = [\n\t '',\n\t '0',\n\t '00',\n\t '000',\n\t '0000',\n\t '00000',\n\t '000000',\n\t '0000000',\n\t '00000000',\n\t '000000000',\n\t '0000000000',\n\t '00000000000',\n\t '000000000000',\n\t '0000000000000',\n\t '00000000000000',\n\t '000000000000000',\n\t '0000000000000000',\n\t '00000000000000000',\n\t '000000000000000000',\n\t '0000000000000000000',\n\t '00000000000000000000',\n\t '000000000000000000000',\n\t '0000000000000000000000',\n\t '00000000000000000000000',\n\t '000000000000000000000000',\n\t '0000000000000000000000000'\n\t ];\n\n\t var groupSizes = [\n\t 0, 0,\n\t 25, 16, 12, 11, 10, 9, 8,\n\t 8, 7, 7, 7, 7, 6, 6,\n\t 6, 6, 6, 6, 6, 5, 5,\n\t 5, 5, 5, 5, 5, 5, 5,\n\t 5, 5, 5, 5, 5, 5, 5\n\t ];\n\n\t var groupBases = [\n\t 0, 0,\n\t 33554432, 43046721, 16777216, 48828125, 60466176, 40353607, 16777216,\n\t 43046721, 10000000, 19487171, 35831808, 62748517, 7529536, 11390625,\n\t 16777216, 24137569, 34012224, 47045881, 64000000, 4084101, 5153632,\n\t 6436343, 7962624, 9765625, 11881376, 14348907, 17210368, 20511149,\n\t 24300000, 28629151, 33554432, 39135393, 45435424, 52521875, 60466176\n\t ];\n\n\t BN.prototype.toString = function toString (base, padding) {\n\t base = base || 10;\n\t padding = padding | 0 || 1;\n\n\t var out;\n\t if (base === 16 || base === 'hex') {\n\t out = '';\n\t var off = 0;\n\t var carry = 0;\n\t for (var i = 0; i < this.length; i++) {\n\t var w = this.words[i];\n\t var word = (((w << off) | carry) & 0xffffff).toString(16);\n\t carry = (w >>> (24 - off)) & 0xffffff;\n\t if (carry !== 0 || i !== this.length - 1) {\n\t out = zeros[6 - word.length] + word + out;\n\t } else {\n\t out = word + out;\n\t }\n\t off += 2;\n\t if (off >= 26) {\n\t off -= 26;\n\t i--;\n\t }\n\t }\n\t if (carry !== 0) {\n\t out = carry.toString(16) + out;\n\t }\n\t while (out.length % padding !== 0) {\n\t out = '0' + out;\n\t }\n\t if (this.negative !== 0) {\n\t out = '-' + out;\n\t }\n\t return out;\n\t }\n\n\t if (base === (base | 0) && base >= 2 && base <= 36) {\n\t // var groupSize = Math.floor(BN.wordSize * Math.LN2 / Math.log(base));\n\t var groupSize = groupSizes[base];\n\t // var groupBase = Math.pow(base, groupSize);\n\t var groupBase = groupBases[base];\n\t out = '';\n\t var c = this.clone();\n\t c.negative = 0;\n\t while (!c.isZero()) {\n\t var r = c.modn(groupBase).toString(base);\n\t c = c.idivn(groupBase);\n\n\t if (!c.isZero()) {\n\t out = zeros[groupSize - r.length] + r + out;\n\t } else {\n\t out = r + out;\n\t }\n\t }\n\t if (this.isZero()) {\n\t out = '0' + out;\n\t }\n\t while (out.length % padding !== 0) {\n\t out = '0' + out;\n\t }\n\t if (this.negative !== 0) {\n\t out = '-' + out;\n\t }\n\t return out;\n\t }\n\n\t assert(false, 'Base should be between 2 and 36');\n\t };\n\n\t BN.prototype.toNumber = function toNumber () {\n\t var ret = this.words[0];\n\t if (this.length === 2) {\n\t ret += this.words[1] * 0x4000000;\n\t } else if (this.length === 3 && this.words[2] === 0x01) {\n\t // NOTE: at this stage it is known that the top bit is set\n\t ret += 0x10000000000000 + (this.words[1] * 0x4000000);\n\t } else if (this.length > 2) {\n\t assert(false, 'Number can only safely store up to 53 bits');\n\t }\n\t return (this.negative !== 0) ? -ret : ret;\n\t };\n\n\t BN.prototype.toJSON = function toJSON () {\n\t return this.toString(16);\n\t };\n\n\t BN.prototype.toBuffer = function toBuffer (endian, length) {\n\t assert(typeof Buffer !== 'undefined');\n\t return this.toArrayLike(Buffer, endian, length);\n\t };\n\n\t BN.prototype.toArray = function toArray (endian, length) {\n\t return this.toArrayLike(Array, endian, length);\n\t };\n\n\t BN.prototype.toArrayLike = function toArrayLike (ArrayType, endian, length) {\n\t var byteLength = this.byteLength();\n\t var reqLength = length || Math.max(1, byteLength);\n\t assert(byteLength <= reqLength, 'byte array longer than desired length');\n\t assert(reqLength > 0, 'Requested array length <= 0');\n\n\t this.strip();\n\t var littleEndian = endian === 'le';\n\t var res = new ArrayType(reqLength);\n\n\t var b, i;\n\t var q = this.clone();\n\t if (!littleEndian) {\n\t // Assume big-endian\n\t for (i = 0; i < reqLength - byteLength; i++) {\n\t res[i] = 0;\n\t }\n\n\t for (i = 0; !q.isZero(); i++) {\n\t b = q.andln(0xff);\n\t q.iushrn(8);\n\n\t res[reqLength - i - 1] = b;\n\t }\n\t } else {\n\t for (i = 0; !q.isZero(); i++) {\n\t b = q.andln(0xff);\n\t q.iushrn(8);\n\n\t res[i] = b;\n\t }\n\n\t for (; i < reqLength; i++) {\n\t res[i] = 0;\n\t }\n\t }\n\n\t return res;\n\t };\n\n\t if (Math.clz32) {\n\t BN.prototype._countBits = function _countBits (w) {\n\t return 32 - Math.clz32(w);\n\t };\n\t } else {\n\t BN.prototype._countBits = function _countBits (w) {\n\t var t = w;\n\t var r = 0;\n\t if (t >= 0x1000) {\n\t r += 13;\n\t t >>>= 13;\n\t }\n\t if (t >= 0x40) {\n\t r += 7;\n\t t >>>= 7;\n\t }\n\t if (t >= 0x8) {\n\t r += 4;\n\t t >>>= 4;\n\t }\n\t if (t >= 0x02) {\n\t r += 2;\n\t t >>>= 2;\n\t }\n\t return r + t;\n\t };\n\t }\n\n\t BN.prototype._zeroBits = function _zeroBits (w) {\n\t // Short-cut\n\t if (w === 0) return 26;\n\n\t var t = w;\n\t var r = 0;\n\t if ((t & 0x1fff) === 0) {\n\t r += 13;\n\t t >>>= 13;\n\t }\n\t if ((t & 0x7f) === 0) {\n\t r += 7;\n\t t >>>= 7;\n\t }\n\t if ((t & 0xf) === 0) {\n\t r += 4;\n\t t >>>= 4;\n\t }\n\t if ((t & 0x3) === 0) {\n\t r += 2;\n\t t >>>= 2;\n\t }\n\t if ((t & 0x1) === 0) {\n\t r++;\n\t }\n\t return r;\n\t };\n\n\t // Return number of used bits in a BN\n\t BN.prototype.bitLength = function bitLength () {\n\t var w = this.words[this.length - 1];\n\t var hi = this._countBits(w);\n\t return (this.length - 1) * 26 + hi;\n\t };\n\n\t function toBitArray (num) {\n\t var w = new Array(num.bitLength());\n\n\t for (var bit = 0; bit < w.length; bit++) {\n\t var off = (bit / 26) | 0;\n\t var wbit = bit % 26;\n\n\t w[bit] = (num.words[off] & (1 << wbit)) >>> wbit;\n\t }\n\n\t return w;\n\t }\n\n\t // Number of trailing zero bits\n\t BN.prototype.zeroBits = function zeroBits () {\n\t if (this.isZero()) return 0;\n\n\t var r = 0;\n\t for (var i = 0; i < this.length; i++) {\n\t var b = this._zeroBits(this.words[i]);\n\t r += b;\n\t if (b !== 26) break;\n\t }\n\t return r;\n\t };\n\n\t BN.prototype.byteLength = function byteLength () {\n\t return Math.ceil(this.bitLength() / 8);\n\t };\n\n\t BN.prototype.toTwos = function toTwos (width) {\n\t if (this.negative !== 0) {\n\t return this.abs().inotn(width).iaddn(1);\n\t }\n\t return this.clone();\n\t };\n\n\t BN.prototype.fromTwos = function fromTwos (width) {\n\t if (this.testn(width - 1)) {\n\t return this.notn(width).iaddn(1).ineg();\n\t }\n\t return this.clone();\n\t };\n\n\t BN.prototype.isNeg = function isNeg () {\n\t return this.negative !== 0;\n\t };\n\n\t // Return negative clone of `this`\n\t BN.prototype.neg = function neg () {\n\t return this.clone().ineg();\n\t };\n\n\t BN.prototype.ineg = function ineg () {\n\t if (!this.isZero()) {\n\t this.negative ^= 1;\n\t }\n\n\t return this;\n\t };\n\n\t // Or `num` with `this` in-place\n\t BN.prototype.iuor = function iuor (num) {\n\t while (this.length < num.length) {\n\t this.words[this.length++] = 0;\n\t }\n\n\t for (var i = 0; i < num.length; i++) {\n\t this.words[i] = this.words[i] | num.words[i];\n\t }\n\n\t return this.strip();\n\t };\n\n\t BN.prototype.ior = function ior (num) {\n\t assert((this.negative | num.negative) === 0);\n\t return this.iuor(num);\n\t };\n\n\t // Or `num` with `this`\n\t BN.prototype.or = function or (num) {\n\t if (this.length > num.length) return this.clone().ior(num);\n\t return num.clone().ior(this);\n\t };\n\n\t BN.prototype.uor = function uor (num) {\n\t if (this.length > num.length) return this.clone().iuor(num);\n\t return num.clone().iuor(this);\n\t };\n\n\t // And `num` with `this` in-place\n\t BN.prototype.iuand = function iuand (num) {\n\t // b = min-length(num, this)\n\t var b;\n\t if (this.length > num.length) {\n\t b = num;\n\t } else {\n\t b = this;\n\t }\n\n\t for (var i = 0; i < b.length; i++) {\n\t this.words[i] = this.words[i] & num.words[i];\n\t }\n\n\t this.length = b.length;\n\n\t return this.strip();\n\t };\n\n\t BN.prototype.iand = function iand (num) {\n\t assert((this.negative | num.negative) === 0);\n\t return this.iuand(num);\n\t };\n\n\t // And `num` with `this`\n\t BN.prototype.and = function and (num) {\n\t if (this.length > num.length) return this.clone().iand(num);\n\t return num.clone().iand(this);\n\t };\n\n\t BN.prototype.uand = function uand (num) {\n\t if (this.length > num.length) return this.clone().iuand(num);\n\t return num.clone().iuand(this);\n\t };\n\n\t // Xor `num` with `this` in-place\n\t BN.prototype.iuxor = function iuxor (num) {\n\t // a.length > b.length\n\t var a;\n\t var b;\n\t if (this.length > num.length) {\n\t a = this;\n\t b = num;\n\t } else {\n\t a = num;\n\t b = this;\n\t }\n\n\t for (var i = 0; i < b.length; i++) {\n\t this.words[i] = a.words[i] ^ b.words[i];\n\t }\n\n\t if (this !== a) {\n\t for (; i < a.length; i++) {\n\t this.words[i] = a.words[i];\n\t }\n\t }\n\n\t this.length = a.length;\n\n\t return this.strip();\n\t };\n\n\t BN.prototype.ixor = function ixor (num) {\n\t assert((this.negative | num.negative) === 0);\n\t return this.iuxor(num);\n\t };\n\n\t // Xor `num` with `this`\n\t BN.prototype.xor = function xor (num) {\n\t if (this.length > num.length) return this.clone().ixor(num);\n\t return num.clone().ixor(this);\n\t };\n\n\t BN.prototype.uxor = function uxor (num) {\n\t if (this.length > num.length) return this.clone().iuxor(num);\n\t return num.clone().iuxor(this);\n\t };\n\n\t // Not ``this`` with ``width`` bitwidth\n\t BN.prototype.inotn = function inotn (width) {\n\t assert(typeof width === 'number' && width >= 0);\n\n\t var bytesNeeded = Math.ceil(width / 26) | 0;\n\t var bitsLeft = width % 26;\n\n\t // Extend the buffer with leading zeroes\n\t this._expand(bytesNeeded);\n\n\t if (bitsLeft > 0) {\n\t bytesNeeded--;\n\t }\n\n\t // Handle complete words\n\t for (var i = 0; i < bytesNeeded; i++) {\n\t this.words[i] = ~this.words[i] & 0x3ffffff;\n\t }\n\n\t // Handle the residue\n\t if (bitsLeft > 0) {\n\t this.words[i] = ~this.words[i] & (0x3ffffff >> (26 - bitsLeft));\n\t }\n\n\t // And remove leading zeroes\n\t return this.strip();\n\t };\n\n\t BN.prototype.notn = function notn (width) {\n\t return this.clone().inotn(width);\n\t };\n\n\t // Set `bit` of `this`\n\t BN.prototype.setn = function setn (bit, val) {\n\t assert(typeof bit === 'number' && bit >= 0);\n\n\t var off = (bit / 26) | 0;\n\t var wbit = bit % 26;\n\n\t this._expand(off + 1);\n\n\t if (val) {\n\t this.words[off] = this.words[off] | (1 << wbit);\n\t } else {\n\t this.words[off] = this.words[off] & ~(1 << wbit);\n\t }\n\n\t return this.strip();\n\t };\n\n\t // Add `num` to `this` in-place\n\t BN.prototype.iadd = function iadd (num) {\n\t var r;\n\n\t // negative + positive\n\t if (this.negative !== 0 && num.negative === 0) {\n\t this.negative = 0;\n\t r = this.isub(num);\n\t this.negative ^= 1;\n\t return this._normSign();\n\n\t // positive + negative\n\t } else if (this.negative === 0 && num.negative !== 0) {\n\t num.negative = 0;\n\t r = this.isub(num);\n\t num.negative = 1;\n\t return r._normSign();\n\t }\n\n\t // a.length > b.length\n\t var a, b;\n\t if (this.length > num.length) {\n\t a = this;\n\t b = num;\n\t } else {\n\t a = num;\n\t b = this;\n\t }\n\n\t var carry = 0;\n\t for (var i = 0; i < b.length; i++) {\n\t r = (a.words[i] | 0) + (b.words[i] | 0) + carry;\n\t this.words[i] = r & 0x3ffffff;\n\t carry = r >>> 26;\n\t }\n\t for (; carry !== 0 && i < a.length; i++) {\n\t r = (a.words[i] | 0) + carry;\n\t this.words[i] = r & 0x3ffffff;\n\t carry = r >>> 26;\n\t }\n\n\t this.length = a.length;\n\t if (carry !== 0) {\n\t this.words[this.length] = carry;\n\t this.length++;\n\t // Copy the rest of the words\n\t } else if (a !== this) {\n\t for (; i < a.length; i++) {\n\t this.words[i] = a.words[i];\n\t }\n\t }\n\n\t return this;\n\t };\n\n\t // Add `num` to `this`\n\t BN.prototype.add = function add (num) {\n\t var res;\n\t if (num.negative !== 0 && this.negative === 0) {\n\t num.negative = 0;\n\t res = this.sub(num);\n\t num.negative ^= 1;\n\t return res;\n\t } else if (num.negative === 0 && this.negative !== 0) {\n\t this.negative = 0;\n\t res = num.sub(this);\n\t this.negative = 1;\n\t return res;\n\t }\n\n\t if (this.length > num.length) return this.clone().iadd(num);\n\n\t return num.clone().iadd(this);\n\t };\n\n\t // Subtract `num` from `this` in-place\n\t BN.prototype.isub = function isub (num) {\n\t // this - (-num) = this + num\n\t if (num.negative !== 0) {\n\t num.negative = 0;\n\t var r = this.iadd(num);\n\t num.negative = 1;\n\t return r._normSign();\n\n\t // -this - num = -(this + num)\n\t } else if (this.negative !== 0) {\n\t this.negative = 0;\n\t this.iadd(num);\n\t this.negative = 1;\n\t return this._normSign();\n\t }\n\n\t // At this point both numbers are positive\n\t var cmp = this.cmp(num);\n\n\t // Optimization - zeroify\n\t if (cmp === 0) {\n\t this.negative = 0;\n\t this.length = 1;\n\t this.words[0] = 0;\n\t return this;\n\t }\n\n\t // a > b\n\t var a, b;\n\t if (cmp > 0) {\n\t a = this;\n\t b = num;\n\t } else {\n\t a = num;\n\t b = this;\n\t }\n\n\t var carry = 0;\n\t for (var i = 0; i < b.length; i++) {\n\t r = (a.words[i] | 0) - (b.words[i] | 0) + carry;\n\t carry = r >> 26;\n\t this.words[i] = r & 0x3ffffff;\n\t }\n\t for (; carry !== 0 && i < a.length; i++) {\n\t r = (a.words[i] | 0) + carry;\n\t carry = r >> 26;\n\t this.words[i] = r & 0x3ffffff;\n\t }\n\n\t // Copy rest of the words\n\t if (carry === 0 && i < a.length && a !== this) {\n\t for (; i < a.length; i++) {\n\t this.words[i] = a.words[i];\n\t }\n\t }\n\n\t this.length = Math.max(this.length, i);\n\n\t if (a !== this) {\n\t this.negative = 1;\n\t }\n\n\t return this.strip();\n\t };\n\n\t // Subtract `num` from `this`\n\t BN.prototype.sub = function sub (num) {\n\t return this.clone().isub(num);\n\t };\n\n\t function smallMulTo (self, num, out) {\n\t out.negative = num.negative ^ self.negative;\n\t var len = (self.length + num.length) | 0;\n\t out.length = len;\n\t len = (len - 1) | 0;\n\n\t // Peel one iteration (compiler can't do it, because of code complexity)\n\t var a = self.words[0] | 0;\n\t var b = num.words[0] | 0;\n\t var r = a * b;\n\n\t var lo = r & 0x3ffffff;\n\t var carry = (r / 0x4000000) | 0;\n\t out.words[0] = lo;\n\n\t for (var k = 1; k < len; k++) {\n\t // Sum all words with the same `i + j = k` and accumulate `ncarry`,\n\t // note that ncarry could be >= 0x3ffffff\n\t var ncarry = carry >>> 26;\n\t var rword = carry & 0x3ffffff;\n\t var maxJ = Math.min(k, num.length - 1);\n\t for (var j = Math.max(0, k - self.length + 1); j <= maxJ; j++) {\n\t var i = (k - j) | 0;\n\t a = self.words[i] | 0;\n\t b = num.words[j] | 0;\n\t r = a * b + rword;\n\t ncarry += (r / 0x4000000) | 0;\n\t rword = r & 0x3ffffff;\n\t }\n\t out.words[k] = rword | 0;\n\t carry = ncarry | 0;\n\t }\n\t if (carry !== 0) {\n\t out.words[k] = carry | 0;\n\t } else {\n\t out.length--;\n\t }\n\n\t return out.strip();\n\t }\n\n\t // TODO(indutny): it may be reasonable to omit it for users who don't need\n\t // to work with 256-bit numbers, otherwise it gives 20% improvement for 256-bit\n\t // multiplication (like elliptic secp256k1).\n\t var comb10MulTo = function comb10MulTo (self, num, out) {\n\t var a = self.words;\n\t var b = num.words;\n\t var o = out.words;\n\t var c = 0;\n\t var lo;\n\t var mid;\n\t var hi;\n\t var a0 = a[0] | 0;\n\t var al0 = a0 & 0x1fff;\n\t var ah0 = a0 >>> 13;\n\t var a1 = a[1] | 0;\n\t var al1 = a1 & 0x1fff;\n\t var ah1 = a1 >>> 13;\n\t var a2 = a[2] | 0;\n\t var al2 = a2 & 0x1fff;\n\t var ah2 = a2 >>> 13;\n\t var a3 = a[3] | 0;\n\t var al3 = a3 & 0x1fff;\n\t var ah3 = a3 >>> 13;\n\t var a4 = a[4] | 0;\n\t var al4 = a4 & 0x1fff;\n\t var ah4 = a4 >>> 13;\n\t var a5 = a[5] | 0;\n\t var al5 = a5 & 0x1fff;\n\t var ah5 = a5 >>> 13;\n\t var a6 = a[6] | 0;\n\t var al6 = a6 & 0x1fff;\n\t var ah6 = a6 >>> 13;\n\t var a7 = a[7] | 0;\n\t var al7 = a7 & 0x1fff;\n\t var ah7 = a7 >>> 13;\n\t var a8 = a[8] | 0;\n\t var al8 = a8 & 0x1fff;\n\t var ah8 = a8 >>> 13;\n\t var a9 = a[9] | 0;\n\t var al9 = a9 & 0x1fff;\n\t var ah9 = a9 >>> 13;\n\t var b0 = b[0] | 0;\n\t var bl0 = b0 & 0x1fff;\n\t var bh0 = b0 >>> 13;\n\t var b1 = b[1] | 0;\n\t var bl1 = b1 & 0x1fff;\n\t var bh1 = b1 >>> 13;\n\t var b2 = b[2] | 0;\n\t var bl2 = b2 & 0x1fff;\n\t var bh2 = b2 >>> 13;\n\t var b3 = b[3] | 0;\n\t var bl3 = b3 & 0x1fff;\n\t var bh3 = b3 >>> 13;\n\t var b4 = b[4] | 0;\n\t var bl4 = b4 & 0x1fff;\n\t var bh4 = b4 >>> 13;\n\t var b5 = b[5] | 0;\n\t var bl5 = b5 & 0x1fff;\n\t var bh5 = b5 >>> 13;\n\t var b6 = b[6] | 0;\n\t var bl6 = b6 & 0x1fff;\n\t var bh6 = b6 >>> 13;\n\t var b7 = b[7] | 0;\n\t var bl7 = b7 & 0x1fff;\n\t var bh7 = b7 >>> 13;\n\t var b8 = b[8] | 0;\n\t var bl8 = b8 & 0x1fff;\n\t var bh8 = b8 >>> 13;\n\t var b9 = b[9] | 0;\n\t var bl9 = b9 & 0x1fff;\n\t var bh9 = b9 >>> 13;\n\n\t out.negative = self.negative ^ num.negative;\n\t out.length = 19;\n\t /* k = 0 */\n\t lo = Math.imul(al0, bl0);\n\t mid = Math.imul(al0, bh0);\n\t mid += Math.imul(ah0, bl0);\n\t hi = Math.imul(ah0, bh0);\n\t var w0 = c + lo + ((mid & 0x1fff) << 13);\n\t c = hi + (mid >>> 13) + (w0 >>> 26);\n\t w0 &= 0x3ffffff;\n\t /* k = 1 */\n\t lo = Math.imul(al1, bl0);\n\t mid = Math.imul(al1, bh0);\n\t mid += Math.imul(ah1, bl0);\n\t hi = Math.imul(ah1, bh0);\n\t lo += Math.imul(al0, bl1);\n\t mid += Math.imul(al0, bh1);\n\t mid += Math.imul(ah0, bl1);\n\t hi += Math.imul(ah0, bh1);\n\t var w1 = c + lo + ((mid & 0x1fff) << 13);\n\t c = hi + (mid >>> 13) + (w1 >>> 26);\n\t w1 &= 0x3ffffff;\n\t /* k = 2 */\n\t lo = Math.imul(al2, bl0);\n\t mid = Math.imul(al2, bh0);\n\t mid += Math.imul(ah2, bl0);\n\t hi = Math.imul(ah2, bh0);\n\t lo += Math.imul(al1, bl1);\n\t mid += Math.imul(al1, bh1);\n\t mid += Math.imul(ah1, bl1);\n\t hi += Math.imul(ah1, bh1);\n\t lo += Math.imul(al0, bl2);\n\t mid += Math.imul(al0, bh2);\n\t mid += Math.imul(ah0, bl2);\n\t hi += Math.imul(ah0, bh2);\n\t var w2 = c + lo + ((mid & 0x1fff) << 13);\n\t c = hi + (mid >>> 13) + (w2 >>> 26);\n\t w2 &= 0x3ffffff;\n\t /* k = 3 */\n\t lo = Math.imul(al3, bl0);\n\t mid = Math.imul(al3, bh0);\n\t mid += Math.imul(ah3, bl0);\n\t hi = Math.imul(ah3, bh0);\n\t lo += Math.imul(al2, bl1);\n\t mid += Math.imul(al2, bh1);\n\t mid += Math.imul(ah2, bl1);\n\t hi += Math.imul(ah2, bh1);\n\t lo += Math.imul(al1, bl2);\n\t mid += Math.imul(al1, bh2);\n\t mid += Math.imul(ah1, bl2);\n\t hi += Math.imul(ah1, bh2);\n\t lo += Math.imul(al0, bl3);\n\t mid += Math.imul(al0, bh3);\n\t mid += Math.imul(ah0, bl3);\n\t hi += Math.imul(ah0, bh3);\n\t var w3 = c + lo + ((mid & 0x1fff) << 13);\n\t c = hi + (mid >>> 13) + (w3 >>> 26);\n\t w3 &= 0x3ffffff;\n\t /* k = 4 */\n\t lo = Math.imul(al4, bl0);\n\t mid = Math.imul(al4, bh0);\n\t mid += Math.imul(ah4, bl0);\n\t hi = Math.imul(ah4, bh0);\n\t lo += Math.imul(al3, bl1);\n\t mid += Math.imul(al3, bh1);\n\t mid += Math.imul(ah3, bl1);\n\t hi += Math.imul(ah3, bh1);\n\t lo += Math.imul(al2, bl2);\n\t mid += Math.imul(al2, bh2);\n\t mid += Math.imul(ah2, bl2);\n\t hi += Math.imul(ah2, bh2);\n\t lo += Math.imul(al1, bl3);\n\t mid += Math.imul(al1, bh3);\n\t mid += Math.imul(ah1, bl3);\n\t hi += Math.imul(ah1, bh3);\n\t lo += Math.imul(al0, bl4);\n\t mid += Math.imul(al0, bh4);\n\t mid += Math.imul(ah0, bl4);\n\t hi += Math.imul(ah0, bh4);\n\t var w4 = c + lo + ((mid & 0x1fff) << 13);\n\t c = hi + (mid >>> 13) + (w4 >>> 26);\n\t w4 &= 0x3ffffff;\n\t /* k = 5 */\n\t lo = Math.imul(al5, bl0);\n\t mid = Math.imul(al5, bh0);\n\t mid += Math.imul(ah5, bl0);\n\t hi = Math.imul(ah5, bh0);\n\t lo += Math.imul(al4, bl1);\n\t mid += Math.imul(al4, bh1);\n\t mid += Math.imul(ah4, bl1);\n\t hi += Math.imul(ah4, bh1);\n\t lo += Math.imul(al3, bl2);\n\t mid += Math.imul(al3, bh2);\n\t mid += Math.imul(ah3, bl2);\n\t hi += Math.imul(ah3, bh2);\n\t lo += Math.imul(al2, bl3);\n\t mid += Math.imul(al2, bh3);\n\t mid += Math.imul(ah2, bl3);\n\t hi += Math.imul(ah2, bh3);\n\t lo += Math.imul(al1, bl4);\n\t mid += Math.imul(al1, bh4);\n\t mid += Math.imul(ah1, bl4);\n\t hi += Math.imul(ah1, bh4);\n\t lo += Math.imul(al0, bl5);\n\t mid += Math.imul(al0, bh5);\n\t mid += Math.imul(ah0, bl5);\n\t hi += Math.imul(ah0, bh5);\n\t var w5 = c + lo + ((mid & 0x1fff) << 13);\n\t c = hi + (mid >>> 13) + (w5 >>> 26);\n\t w5 &= 0x3ffffff;\n\t /* k = 6 */\n\t lo = Math.imul(al6, bl0);\n\t mid = Math.imul(al6, bh0);\n\t mid += Math.imul(ah6, bl0);\n\t hi = Math.imul(ah6, bh0);\n\t lo += Math.imul(al5, bl1);\n\t mid += Math.imul(al5, bh1);\n\t mid += Math.imul(ah5, bl1);\n\t hi += Math.imul(ah5, bh1);\n\t lo += Math.imul(al4, bl2);\n\t mid += Math.imul(al4, bh2);\n\t mid += Math.imul(ah4, bl2);\n\t hi += Math.imul(ah4, bh2);\n\t lo += Math.imul(al3, bl3);\n\t mid += Math.imul(al3, bh3);\n\t mid += Math.imul(ah3, bl3);\n\t hi += Math.imul(ah3, bh3);\n\t lo += Math.imul(al2, bl4);\n\t mid += Math.imul(al2, bh4);\n\t mid += Math.imul(ah2, bl4);\n\t hi += Math.imul(ah2, bh4);\n\t lo += Math.imul(al1, bl5);\n\t mid += Math.imul(al1, bh5);\n\t mid += Math.imul(ah1, bl5);\n\t hi += Math.imul(ah1, bh5);\n\t lo += Math.imul(al0, bl6);\n\t mid += Math.imul(al0, bh6);\n\t mid += Math.imul(ah0, bl6);\n\t hi += Math.imul(ah0, bh6);\n\t var w6 = c + lo + ((mid & 0x1fff) << 13);\n\t c = hi + (mid >>> 13) + (w6 >>> 26);\n\t w6 &= 0x3ffffff;\n\t /* k = 7 */\n\t lo = Math.imul(al7, bl0);\n\t mid = Math.imul(al7, bh0);\n\t mid += Math.imul(ah7, bl0);\n\t hi = Math.imul(ah7, bh0);\n\t lo += Math.imul(al6, bl1);\n\t mid += Math.imul(al6, bh1);\n\t mid += Math.imul(ah6, bl1);\n\t hi += Math.imul(ah6, bh1);\n\t lo += Math.imul(al5, bl2);\n\t mid += Math.imul(al5, bh2);\n\t mid += Math.imul(ah5, bl2);\n\t hi += Math.imul(ah5, bh2);\n\t lo += Math.imul(al4, bl3);\n\t mid += Math.imul(al4, bh3);\n\t mid += Math.imul(ah4, bl3);\n\t hi += Math.imul(ah4, bh3);\n\t lo += Math.imul(al3, bl4);\n\t mid += Math.imul(al3, bh4);\n\t mid += Math.imul(ah3, bl4);\n\t hi += Math.imul(ah3, bh4);\n\t lo += Math.imul(al2, bl5);\n\t mid += Math.imul(al2, bh5);\n\t mid += Math.imul(ah2, bl5);\n\t hi += Math.imul(ah2, bh5);\n\t lo += Math.imul(al1, bl6);\n\t mid += Math.imul(al1, bh6);\n\t mid += Math.imul(ah1, bl6);\n\t hi += Math.imul(ah1, bh6);\n\t lo += Math.imul(al0, bl7);\n\t mid += Math.imul(al0, bh7);\n\t mid += Math.imul(ah0, bl7);\n\t hi += Math.imul(ah0, bh7);\n\t var w7 = c + lo + ((mid & 0x1fff) << 13);\n\t c = hi + (mid >>> 13) + (w7 >>> 26);\n\t w7 &= 0x3ffffff;\n\t /* k = 8 */\n\t lo = Math.imul(al8, bl0);\n\t mid = Math.imul(al8, bh0);\n\t mid += Math.imul(ah8, bl0);\n\t hi = Math.imul(ah8, bh0);\n\t lo += Math.imul(al7, bl1);\n\t mid += Math.imul(al7, bh1);\n\t mid += Math.imul(ah7, bl1);\n\t hi += Math.imul(ah7, bh1);\n\t lo += Math.imul(al6, bl2);\n\t mid += Math.imul(al6, bh2);\n\t mid += Math.imul(ah6, bl2);\n\t hi += Math.imul(ah6, bh2);\n\t lo += Math.imul(al5, bl3);\n\t mid += Math.imul(al5, bh3);\n\t mid += Math.imul(ah5, bl3);\n\t hi += Math.imul(ah5, bh3);\n\t lo += Math.imul(al4, bl4);\n\t mid += Math.imul(al4, bh4);\n\t mid += Math.imul(ah4, bl4);\n\t hi += Math.imul(ah4, bh4);\n\t lo += Math.imul(al3, bl5);\n\t mid += Math.imul(al3, bh5);\n\t mid += Math.imul(ah3, bl5);\n\t hi += Math.imul(ah3, bh5);\n\t lo += Math.imul(al2, bl6);\n\t mid += Math.imul(al2, bh6);\n\t mid += Math.imul(ah2, bl6);\n\t hi += Math.imul(ah2, bh6);\n\t lo += Math.imul(al1, bl7);\n\t mid += Math.imul(al1, bh7);\n\t mid += Math.imul(ah1, bl7);\n\t hi += Math.imul(ah1, bh7);\n\t lo += Math.imul(al0, bl8);\n\t mid += Math.imul(al0, bh8);\n\t mid += Math.imul(ah0, bl8);\n\t hi += Math.imul(ah0, bh8);\n\t var w8 = c + lo + ((mid & 0x1fff) << 13);\n\t c = hi + (mid >>> 13) + (w8 >>> 26);\n\t w8 &= 0x3ffffff;\n\t /* k = 9 */\n\t lo = Math.imul(al9, bl0);\n\t mid = Math.imul(al9, bh0);\n\t mid += Math.imul(ah9, bl0);\n\t hi = Math.imul(ah9, bh0);\n\t lo += Math.imul(al8, bl1);\n\t mid += Math.imul(al8, bh1);\n\t mid += Math.imul(ah8, bl1);\n\t hi += Math.imul(ah8, bh1);\n\t lo += Math.imul(al7, bl2);\n\t mid += Math.imul(al7, bh2);\n\t mid += Math.imul(ah7, bl2);\n\t hi += Math.imul(ah7, bh2);\n\t lo += Math.imul(al6, bl3);\n\t mid += Math.imul(al6, bh3);\n\t mid += Math.imul(ah6, bl3);\n\t hi += Math.imul(ah6, bh3);\n\t lo += Math.imul(al5, bl4);\n\t mid += Math.imul(al5, bh4);\n\t mid += Math.imul(ah5, bl4);\n\t hi += Math.imul(ah5, bh4);\n\t lo += Math.imul(al4, bl5);\n\t mid += Math.imul(al4, bh5);\n\t mid += Math.imul(ah4, bl5);\n\t hi += Math.imul(ah4, bh5);\n\t lo += Math.imul(al3, bl6);\n\t mid += Math.imul(al3, bh6);\n\t mid += Math.imul(ah3, bl6);\n\t hi += Math.imul(ah3, bh6);\n\t lo += Math.imul(al2, bl7);\n\t mid += Math.imul(al2, bh7);\n\t mid += Math.imul(ah2, bl7);\n\t hi += Math.imul(ah2, bh7);\n\t lo += Math.imul(al1, bl8);\n\t mid += Math.imul(al1, bh8);\n\t mid += Math.imul(ah1, bl8);\n\t hi += Math.imul(ah1, bh8);\n\t lo += Math.imul(al0, bl9);\n\t mid += Math.imul(al0, bh9);\n\t mid += Math.imul(ah0, bl9);\n\t hi += Math.imul(ah0, bh9);\n\t var w9 = c + lo + ((mid & 0x1fff) << 13);\n\t c = hi + (mid >>> 13) + (w9 >>> 26);\n\t w9 &= 0x3ffffff;\n\t /* k = 10 */\n\t lo = Math.imul(al9, bl1);\n\t mid = Math.imul(al9, bh1);\n\t mid += Math.imul(ah9, bl1);\n\t hi = Math.imul(ah9, bh1);\n\t lo += Math.imul(al8, bl2);\n\t mid += Math.imul(al8, bh2);\n\t mid += Math.imul(ah8, bl2);\n\t hi += Math.imul(ah8, bh2);\n\t lo += Math.imul(al7, bl3);\n\t mid += Math.imul(al7, bh3);\n\t mid += Math.imul(ah7, bl3);\n\t hi += Math.imul(ah7, bh3);\n\t lo += Math.imul(al6, bl4);\n\t mid += Math.imul(al6, bh4);\n\t mid += Math.imul(ah6, bl4);\n\t hi += Math.imul(ah6, bh4);\n\t lo += Math.imul(al5, bl5);\n\t mid += Math.imul(al5, bh5);\n\t mid += Math.imul(ah5, bl5);\n\t hi += Math.imul(ah5, bh5);\n\t lo += Math.imul(al4, bl6);\n\t mid += Math.imul(al4, bh6);\n\t mid += Math.imul(ah4, bl6);\n\t hi += Math.imul(ah4, bh6);\n\t lo += Math.imul(al3, bl7);\n\t mid += Math.imul(al3, bh7);\n\t mid += Math.imul(ah3, bl7);\n\t hi += Math.imul(ah3, bh7);\n\t lo += Math.imul(al2, bl8);\n\t mid += Math.imul(al2, bh8);\n\t mid += Math.imul(ah2, bl8);\n\t hi += Math.imul(ah2, bh8);\n\t lo += Math.imul(al1, bl9);\n\t mid += Math.imul(al1, bh9);\n\t mid += Math.imul(ah1, bl9);\n\t hi += Math.imul(ah1, bh9);\n\t var w10 = c + lo + ((mid & 0x1fff) << 13);\n\t c = hi + (mid >>> 13) + (w10 >>> 26);\n\t w10 &= 0x3ffffff;\n\t /* k = 11 */\n\t lo = Math.imul(al9, bl2);\n\t mid = Math.imul(al9, bh2);\n\t mid += Math.imul(ah9, bl2);\n\t hi = Math.imul(ah9, bh2);\n\t lo += Math.imul(al8, bl3);\n\t mid += Math.imul(al8, bh3);\n\t mid += Math.imul(ah8, bl3);\n\t hi += Math.imul(ah8, bh3);\n\t lo += Math.imul(al7, bl4);\n\t mid += Math.imul(al7, bh4);\n\t mid += Math.imul(ah7, bl4);\n\t hi += Math.imul(ah7, bh4);\n\t lo += Math.imul(al6, bl5);\n\t mid += Math.imul(al6, bh5);\n\t mid += Math.imul(ah6, bl5);\n\t hi += Math.imul(ah6, bh5);\n\t lo += Math.imul(al5, bl6);\n\t mid += Math.imul(al5, bh6);\n\t mid += Math.imul(ah5, bl6);\n\t hi += Math.imul(ah5, bh6);\n\t lo += Math.imul(al4, bl7);\n\t mid += Math.imul(al4, bh7);\n\t mid += Math.imul(ah4, bl7);\n\t hi += Math.imul(ah4, bh7);\n\t lo += Math.imul(al3, bl8);\n\t mid += Math.imul(al3, bh8);\n\t mid += Math.imul(ah3, bl8);\n\t hi += Math.imul(ah3, bh8);\n\t lo += Math.imul(al2, bl9);\n\t mid += Math.imul(al2, bh9);\n\t mid += Math.imul(ah2, bl9);\n\t hi += Math.imul(ah2, bh9);\n\t var w11 = c + lo + ((mid & 0x1fff) << 13);\n\t c = hi + (mid >>> 13) + (w11 >>> 26);\n\t w11 &= 0x3ffffff;\n\t /* k = 12 */\n\t lo = Math.imul(al9, bl3);\n\t mid = Math.imul(al9, bh3);\n\t mid += Math.imul(ah9, bl3);\n\t hi = Math.imul(ah9, bh3);\n\t lo += Math.imul(al8, bl4);\n\t mid += Math.imul(al8, bh4);\n\t mid += Math.imul(ah8, bl4);\n\t hi += Math.imul(ah8, bh4);\n\t lo += Math.imul(al7, bl5);\n\t mid += Math.imul(al7, bh5);\n\t mid += Math.imul(ah7, bl5);\n\t hi += Math.imul(ah7, bh5);\n\t lo += Math.imul(al6, bl6);\n\t mid += Math.imul(al6, bh6);\n\t mid += Math.imul(ah6, bl6);\n\t hi += Math.imul(ah6, bh6);\n\t lo += Math.imul(al5, bl7);\n\t mid += Math.imul(al5, bh7);\n\t mid += Math.imul(ah5, bl7);\n\t hi += Math.imul(ah5, bh7);\n\t lo += Math.imul(al4, bl8);\n\t mid += Math.imul(al4, bh8);\n\t mid += Math.imul(ah4, bl8);\n\t hi += Math.imul(ah4, bh8);\n\t lo += Math.imul(al3, bl9);\n\t mid += Math.imul(al3, bh9);\n\t mid += Math.imul(ah3, bl9);\n\t hi += Math.imul(ah3, bh9);\n\t var w12 = c + lo + ((mid & 0x1fff) << 13);\n\t c = hi + (mid >>> 13) + (w12 >>> 26);\n\t w12 &= 0x3ffffff;\n\t /* k = 13 */\n\t lo = Math.imul(al9, bl4);\n\t mid = Math.imul(al9, bh4);\n\t mid += Math.imul(ah9, bl4);\n\t hi = Math.imul(ah9, bh4);\n\t lo += Math.imul(al8, bl5);\n\t mid += Math.imul(al8, bh5);\n\t mid += Math.imul(ah8, bl5);\n\t hi += Math.imul(ah8, bh5);\n\t lo += Math.imul(al7, bl6);\n\t mid += Math.imul(al7, bh6);\n\t mid += Math.imul(ah7, bl6);\n\t hi += Math.imul(ah7, bh6);\n\t lo += Math.imul(al6, bl7);\n\t mid += Math.imul(al6, bh7);\n\t mid += Math.imul(ah6, bl7);\n\t hi += Math.imul(ah6, bh7);\n\t lo += Math.imul(al5, bl8);\n\t mid += Math.imul(al5, bh8);\n\t mid += Math.imul(ah5, bl8);\n\t hi += Math.imul(ah5, bh8);\n\t lo += Math.imul(al4, bl9);\n\t mid += Math.imul(al4, bh9);\n\t mid += Math.imul(ah4, bl9);\n\t hi += Math.imul(ah4, bh9);\n\t var w13 = c + lo + ((mid & 0x1fff) << 13);\n\t c = hi + (mid >>> 13) + (w13 >>> 26);\n\t w13 &= 0x3ffffff;\n\t /* k = 14 */\n\t lo = Math.imul(al9, bl5);\n\t mid = Math.imul(al9, bh5);\n\t mid += Math.imul(ah9, bl5);\n\t hi = Math.imul(ah9, bh5);\n\t lo += Math.imul(al8, bl6);\n\t mid += Math.imul(al8, bh6);\n\t mid += Math.imul(ah8, bl6);\n\t hi += Math.imul(ah8, bh6);\n\t lo += Math.imul(al7, bl7);\n\t mid += Math.imul(al7, bh7);\n\t mid += Math.imul(ah7, bl7);\n\t hi += Math.imul(ah7, bh7);\n\t lo += Math.imul(al6, bl8);\n\t mid += Math.imul(al6, bh8);\n\t mid += Math.imul(ah6, bl8);\n\t hi += Math.imul(ah6, bh8);\n\t lo += Math.imul(al5, bl9);\n\t mid += Math.imul(al5, bh9);\n\t mid += Math.imul(ah5, bl9);\n\t hi += Math.imul(ah5, bh9);\n\t var w14 = c + lo + ((mid & 0x1fff) << 13);\n\t c = hi + (mid >>> 13) + (w14 >>> 26);\n\t w14 &= 0x3ffffff;\n\t /* k = 15 */\n\t lo = Math.imul(al9, bl6);\n\t mid = Math.imul(al9, bh6);\n\t mid += Math.imul(ah9, bl6);\n\t hi = Math.imul(ah9, bh6);\n\t lo += Math.imul(al8, bl7);\n\t mid += Math.imul(al8, bh7);\n\t mid += Math.imul(ah8, bl7);\n\t hi += Math.imul(ah8, bh7);\n\t lo += Math.imul(al7, bl8);\n\t mid += Math.imul(al7, bh8);\n\t mid += Math.imul(ah7, bl8);\n\t hi += Math.imul(ah7, bh8);\n\t lo += Math.imul(al6, bl9);\n\t mid += Math.imul(al6, bh9);\n\t mid += Math.imul(ah6, bl9);\n\t hi += Math.imul(ah6, bh9);\n\t var w15 = c + lo + ((mid & 0x1fff) << 13);\n\t c = hi + (mid >>> 13) + (w15 >>> 26);\n\t w15 &= 0x3ffffff;\n\t /* k = 16 */\n\t lo = Math.imul(al9, bl7);\n\t mid = Math.imul(al9, bh7);\n\t mid += Math.imul(ah9, bl7);\n\t hi = Math.imul(ah9, bh7);\n\t lo += Math.imul(al8, bl8);\n\t mid += Math.imul(al8, bh8);\n\t mid += Math.imul(ah8, bl8);\n\t hi += Math.imul(ah8, bh8);\n\t lo += Math.imul(al7, bl9);\n\t mid += Math.imul(al7, bh9);\n\t mid += Math.imul(ah7, bl9);\n\t hi += Math.imul(ah7, bh9);\n\t var w16 = c + lo + ((mid & 0x1fff) << 13);\n\t c = hi + (mid >>> 13) + (w16 >>> 26);\n\t w16 &= 0x3ffffff;\n\t /* k = 17 */\n\t lo = Math.imul(al9, bl8);\n\t mid = Math.imul(al9, bh8);\n\t mid += Math.imul(ah9, bl8);\n\t hi = Math.imul(ah9, bh8);\n\t lo += Math.imul(al8, bl9);\n\t mid += Math.imul(al8, bh9);\n\t mid += Math.imul(ah8, bl9);\n\t hi += Math.imul(ah8, bh9);\n\t var w17 = c + lo + ((mid & 0x1fff) << 13);\n\t c = hi + (mid >>> 13) + (w17 >>> 26);\n\t w17 &= 0x3ffffff;\n\t /* k = 18 */\n\t lo = Math.imul(al9, bl9);\n\t mid = Math.imul(al9, bh9);\n\t mid += Math.imul(ah9, bl9);\n\t hi = Math.imul(ah9, bh9);\n\t var w18 = c + lo + ((mid & 0x1fff) << 13);\n\t c = hi + (mid >>> 13) + (w18 >>> 26);\n\t w18 &= 0x3ffffff;\n\t o[0] = w0;\n\t o[1] = w1;\n\t o[2] = w2;\n\t o[3] = w3;\n\t o[4] = w4;\n\t o[5] = w5;\n\t o[6] = w6;\n\t o[7] = w7;\n\t o[8] = w8;\n\t o[9] = w9;\n\t o[10] = w10;\n\t o[11] = w11;\n\t o[12] = w12;\n\t o[13] = w13;\n\t o[14] = w14;\n\t o[15] = w15;\n\t o[16] = w16;\n\t o[17] = w17;\n\t o[18] = w18;\n\t if (c !== 0) {\n\t o[19] = c;\n\t out.length++;\n\t }\n\t return out;\n\t };\n\n\t // Polyfill comb\n\t if (!Math.imul) {\n\t comb10MulTo = smallMulTo;\n\t }\n\n\t function bigMulTo (self, num, out) {\n\t out.negative = num.negative ^ self.negative;\n\t out.length = self.length + num.length;\n\n\t var carry = 0;\n\t var hncarry = 0;\n\t for (var k = 0; k < out.length - 1; k++) {\n\t // Sum all words with the same `i + j = k` and accumulate `ncarry`,\n\t // note that ncarry could be >= 0x3ffffff\n\t var ncarry = hncarry;\n\t hncarry = 0;\n\t var rword = carry & 0x3ffffff;\n\t var maxJ = Math.min(k, num.length - 1);\n\t for (var j = Math.max(0, k - self.length + 1); j <= maxJ; j++) {\n\t var i = k - j;\n\t var a = self.words[i] | 0;\n\t var b = num.words[j] | 0;\n\t var r = a * b;\n\n\t var lo = r & 0x3ffffff;\n\t ncarry = (ncarry + ((r / 0x4000000) | 0)) | 0;\n\t lo = (lo + rword) | 0;\n\t rword = lo & 0x3ffffff;\n\t ncarry = (ncarry + (lo >>> 26)) | 0;\n\n\t hncarry += ncarry >>> 26;\n\t ncarry &= 0x3ffffff;\n\t }\n\t out.words[k] = rword;\n\t carry = ncarry;\n\t ncarry = hncarry;\n\t }\n\t if (carry !== 0) {\n\t out.words[k] = carry;\n\t } else {\n\t out.length--;\n\t }\n\n\t return out.strip();\n\t }\n\n\t function jumboMulTo (self, num, out) {\n\t var fftm = new FFTM();\n\t return fftm.mulp(self, num, out);\n\t }\n\n\t BN.prototype.mulTo = function mulTo (num, out) {\n\t var res;\n\t var len = this.length + num.length;\n\t if (this.length === 10 && num.length === 10) {\n\t res = comb10MulTo(this, num, out);\n\t } else if (len < 63) {\n\t res = smallMulTo(this, num, out);\n\t } else if (len < 1024) {\n\t res = bigMulTo(this, num, out);\n\t } else {\n\t res = jumboMulTo(this, num, out);\n\t }\n\n\t return res;\n\t };\n\n\t // Cooley-Tukey algorithm for FFT\n\t // slightly revisited to rely on looping instead of recursion\n\n\t function FFTM (x, y) {\n\t this.x = x;\n\t this.y = y;\n\t }\n\n\t FFTM.prototype.makeRBT = function makeRBT (N) {\n\t var t = new Array(N);\n\t var l = BN.prototype._countBits(N) - 1;\n\t for (var i = 0; i < N; i++) {\n\t t[i] = this.revBin(i, l, N);\n\t }\n\n\t return t;\n\t };\n\n\t // Returns binary-reversed representation of `x`\n\t FFTM.prototype.revBin = function revBin (x, l, N) {\n\t if (x === 0 || x === N - 1) return x;\n\n\t var rb = 0;\n\t for (var i = 0; i < l; i++) {\n\t rb |= (x & 1) << (l - i - 1);\n\t x >>= 1;\n\t }\n\n\t return rb;\n\t };\n\n\t // Performs \"tweedling\" phase, therefore 'emulating'\n\t // behaviour of the recursive algorithm\n\t FFTM.prototype.permute = function permute (rbt, rws, iws, rtws, itws, N) {\n\t for (var i = 0; i < N; i++) {\n\t rtws[i] = rws[rbt[i]];\n\t itws[i] = iws[rbt[i]];\n\t }\n\t };\n\n\t FFTM.prototype.transform = function transform (rws, iws, rtws, itws, N, rbt) {\n\t this.permute(rbt, rws, iws, rtws, itws, N);\n\n\t for (var s = 1; s < N; s <<= 1) {\n\t var l = s << 1;\n\n\t var rtwdf = Math.cos(2 * Math.PI / l);\n\t var itwdf = Math.sin(2 * Math.PI / l);\n\n\t for (var p = 0; p < N; p += l) {\n\t var rtwdf_ = rtwdf;\n\t var itwdf_ = itwdf;\n\n\t for (var j = 0; j < s; j++) {\n\t var re = rtws[p + j];\n\t var ie = itws[p + j];\n\n\t var ro = rtws[p + j + s];\n\t var io = itws[p + j + s];\n\n\t var rx = rtwdf_ * ro - itwdf_ * io;\n\n\t io = rtwdf_ * io + itwdf_ * ro;\n\t ro = rx;\n\n\t rtws[p + j] = re + ro;\n\t itws[p + j] = ie + io;\n\n\t rtws[p + j + s] = re - ro;\n\t itws[p + j + s] = ie - io;\n\n\t /* jshint maxdepth : false */\n\t if (j !== l) {\n\t rx = rtwdf * rtwdf_ - itwdf * itwdf_;\n\n\t itwdf_ = rtwdf * itwdf_ + itwdf * rtwdf_;\n\t rtwdf_ = rx;\n\t }\n\t }\n\t }\n\t }\n\t };\n\n\t FFTM.prototype.guessLen13b = function guessLen13b (n, m) {\n\t var N = Math.max(m, n) | 1;\n\t var odd = N & 1;\n\t var i = 0;\n\t for (N = N / 2 | 0; N; N = N >>> 1) {\n\t i++;\n\t }\n\n\t return 1 << i + 1 + odd;\n\t };\n\n\t FFTM.prototype.conjugate = function conjugate (rws, iws, N) {\n\t if (N <= 1) return;\n\n\t for (var i = 0; i < N / 2; i++) {\n\t var t = rws[i];\n\n\t rws[i] = rws[N - i - 1];\n\t rws[N - i - 1] = t;\n\n\t t = iws[i];\n\n\t iws[i] = -iws[N - i - 1];\n\t iws[N - i - 1] = -t;\n\t }\n\t };\n\n\t FFTM.prototype.normalize13b = function normalize13b (ws, N) {\n\t var carry = 0;\n\t for (var i = 0; i < N / 2; i++) {\n\t var w = Math.round(ws[2 * i + 1] / N) * 0x2000 +\n\t Math.round(ws[2 * i] / N) +\n\t carry;\n\n\t ws[i] = w & 0x3ffffff;\n\n\t if (w < 0x4000000) {\n\t carry = 0;\n\t } else {\n\t carry = w / 0x4000000 | 0;\n\t }\n\t }\n\n\t return ws;\n\t };\n\n\t FFTM.prototype.convert13b = function convert13b (ws, len, rws, N) {\n\t var carry = 0;\n\t for (var i = 0; i < len; i++) {\n\t carry = carry + (ws[i] | 0);\n\n\t rws[2 * i] = carry & 0x1fff; carry = carry >>> 13;\n\t rws[2 * i + 1] = carry & 0x1fff; carry = carry >>> 13;\n\t }\n\n\t // Pad with zeroes\n\t for (i = 2 * len; i < N; ++i) {\n\t rws[i] = 0;\n\t }\n\n\t assert(carry === 0);\n\t assert((carry & ~0x1fff) === 0);\n\t };\n\n\t FFTM.prototype.stub = function stub (N) {\n\t var ph = new Array(N);\n\t for (var i = 0; i < N; i++) {\n\t ph[i] = 0;\n\t }\n\n\t return ph;\n\t };\n\n\t FFTM.prototype.mulp = function mulp (x, y, out) {\n\t var N = 2 * this.guessLen13b(x.length, y.length);\n\n\t var rbt = this.makeRBT(N);\n\n\t var _ = this.stub(N);\n\n\t var rws = new Array(N);\n\t var rwst = new Array(N);\n\t var iwst = new Array(N);\n\n\t var nrws = new Array(N);\n\t var nrwst = new Array(N);\n\t var niwst = new Array(N);\n\n\t var rmws = out.words;\n\t rmws.length = N;\n\n\t this.convert13b(x.words, x.length, rws, N);\n\t this.convert13b(y.words, y.length, nrws, N);\n\n\t this.transform(rws, _, rwst, iwst, N, rbt);\n\t this.transform(nrws, _, nrwst, niwst, N, rbt);\n\n\t for (var i = 0; i < N; i++) {\n\t var rx = rwst[i] * nrwst[i] - iwst[i] * niwst[i];\n\t iwst[i] = rwst[i] * niwst[i] + iwst[i] * nrwst[i];\n\t rwst[i] = rx;\n\t }\n\n\t this.conjugate(rwst, iwst, N);\n\t this.transform(rwst, iwst, rmws, _, N, rbt);\n\t this.conjugate(rmws, _, N);\n\t this.normalize13b(rmws, N);\n\n\t out.negative = x.negative ^ y.negative;\n\t out.length = x.length + y.length;\n\t return out.strip();\n\t };\n\n\t // Multiply `this` by `num`\n\t BN.prototype.mul = function mul (num) {\n\t var out = new BN(null);\n\t out.words = new Array(this.length + num.length);\n\t return this.mulTo(num, out);\n\t };\n\n\t // Multiply employing FFT\n\t BN.prototype.mulf = function mulf (num) {\n\t var out = new BN(null);\n\t out.words = new Array(this.length + num.length);\n\t return jumboMulTo(this, num, out);\n\t };\n\n\t // In-place Multiplication\n\t BN.prototype.imul = function imul (num) {\n\t return this.clone().mulTo(num, this);\n\t };\n\n\t BN.prototype.imuln = function imuln (num) {\n\t assert(typeof num === 'number');\n\t assert(num < 0x4000000);\n\n\t // Carry\n\t var carry = 0;\n\t for (var i = 0; i < this.length; i++) {\n\t var w = (this.words[i] | 0) * num;\n\t var lo = (w & 0x3ffffff) + (carry & 0x3ffffff);\n\t carry >>= 26;\n\t carry += (w / 0x4000000) | 0;\n\t // NOTE: lo is 27bit maximum\n\t carry += lo >>> 26;\n\t this.words[i] = lo & 0x3ffffff;\n\t }\n\n\t if (carry !== 0) {\n\t this.words[i] = carry;\n\t this.length++;\n\t }\n\n\t return this;\n\t };\n\n\t BN.prototype.muln = function muln (num) {\n\t return this.clone().imuln(num);\n\t };\n\n\t // `this` * `this`\n\t BN.prototype.sqr = function sqr () {\n\t return this.mul(this);\n\t };\n\n\t // `this` * `this` in-place\n\t BN.prototype.isqr = function isqr () {\n\t return this.imul(this.clone());\n\t };\n\n\t // Math.pow(`this`, `num`)\n\t BN.prototype.pow = function pow (num) {\n\t var w = toBitArray(num);\n\t if (w.length === 0) return new BN(1);\n\n\t // Skip leading zeroes\n\t var res = this;\n\t for (var i = 0; i < w.length; i++, res = res.sqr()) {\n\t if (w[i] !== 0) break;\n\t }\n\n\t if (++i < w.length) {\n\t for (var q = res.sqr(); i < w.length; i++, q = q.sqr()) {\n\t if (w[i] === 0) continue;\n\n\t res = res.mul(q);\n\t }\n\t }\n\n\t return res;\n\t };\n\n\t // Shift-left in-place\n\t BN.prototype.iushln = function iushln (bits) {\n\t assert(typeof bits === 'number' && bits >= 0);\n\t var r = bits % 26;\n\t var s = (bits - r) / 26;\n\t var carryMask = (0x3ffffff >>> (26 - r)) << (26 - r);\n\t var i;\n\n\t if (r !== 0) {\n\t var carry = 0;\n\n\t for (i = 0; i < this.length; i++) {\n\t var newCarry = this.words[i] & carryMask;\n\t var c = ((this.words[i] | 0) - newCarry) << r;\n\t this.words[i] = c | carry;\n\t carry = newCarry >>> (26 - r);\n\t }\n\n\t if (carry) {\n\t this.words[i] = carry;\n\t this.length++;\n\t }\n\t }\n\n\t if (s !== 0) {\n\t for (i = this.length - 1; i >= 0; i--) {\n\t this.words[i + s] = this.words[i];\n\t }\n\n\t for (i = 0; i < s; i++) {\n\t this.words[i] = 0;\n\t }\n\n\t this.length += s;\n\t }\n\n\t return this.strip();\n\t };\n\n\t BN.prototype.ishln = function ishln (bits) {\n\t // TODO(indutny): implement me\n\t assert(this.negative === 0);\n\t return this.iushln(bits);\n\t };\n\n\t // Shift-right in-place\n\t // NOTE: `hint` is a lowest bit before trailing zeroes\n\t // NOTE: if `extended` is present - it will be filled with destroyed bits\n\t BN.prototype.iushrn = function iushrn (bits, hint, extended) {\n\t assert(typeof bits === 'number' && bits >= 0);\n\t var h;\n\t if (hint) {\n\t h = (hint - (hint % 26)) / 26;\n\t } else {\n\t h = 0;\n\t }\n\n\t var r = bits % 26;\n\t var s = Math.min((bits - r) / 26, this.length);\n\t var mask = 0x3ffffff ^ ((0x3ffffff >>> r) << r);\n\t var maskedWords = extended;\n\n\t h -= s;\n\t h = Math.max(0, h);\n\n\t // Extended mode, copy masked part\n\t if (maskedWords) {\n\t for (var i = 0; i < s; i++) {\n\t maskedWords.words[i] = this.words[i];\n\t }\n\t maskedWords.length = s;\n\t }\n\n\t if (s === 0) {\n\t // No-op, we should not move anything at all\n\t } else if (this.length > s) {\n\t this.length -= s;\n\t for (i = 0; i < this.length; i++) {\n\t this.words[i] = this.words[i + s];\n\t }\n\t } else {\n\t this.words[0] = 0;\n\t this.length = 1;\n\t }\n\n\t var carry = 0;\n\t for (i = this.length - 1; i >= 0 && (carry !== 0 || i >= h); i--) {\n\t var word = this.words[i] | 0;\n\t this.words[i] = (carry << (26 - r)) | (word >>> r);\n\t carry = word & mask;\n\t }\n\n\t // Push carried bits as a mask\n\t if (maskedWords && carry !== 0) {\n\t maskedWords.words[maskedWords.length++] = carry;\n\t }\n\n\t if (this.length === 0) {\n\t this.words[0] = 0;\n\t this.length = 1;\n\t }\n\n\t return this.strip();\n\t };\n\n\t BN.prototype.ishrn = function ishrn (bits, hint, extended) {\n\t // TODO(indutny): implement me\n\t assert(this.negative === 0);\n\t return this.iushrn(bits, hint, extended);\n\t };\n\n\t // Shift-left\n\t BN.prototype.shln = function shln (bits) {\n\t return this.clone().ishln(bits);\n\t };\n\n\t BN.prototype.ushln = function ushln (bits) {\n\t return this.clone().iushln(bits);\n\t };\n\n\t // Shift-right\n\t BN.prototype.shrn = function shrn (bits) {\n\t return this.clone().ishrn(bits);\n\t };\n\n\t BN.prototype.ushrn = function ushrn (bits) {\n\t return this.clone().iushrn(bits);\n\t };\n\n\t // Test if n bit is set\n\t BN.prototype.testn = function testn (bit) {\n\t assert(typeof bit === 'number' && bit >= 0);\n\t var r = bit % 26;\n\t var s = (bit - r) / 26;\n\t var q = 1 << r;\n\n\t // Fast case: bit is much higher than all existing words\n\t if (this.length <= s) return false;\n\n\t // Check bit and return\n\t var w = this.words[s];\n\n\t return !!(w & q);\n\t };\n\n\t // Return only lowers bits of number (in-place)\n\t BN.prototype.imaskn = function imaskn (bits) {\n\t assert(typeof bits === 'number' && bits >= 0);\n\t var r = bits % 26;\n\t var s = (bits - r) / 26;\n\n\t assert(this.negative === 0, 'imaskn works only with positive numbers');\n\n\t if (r !== 0) {\n\t s++;\n\t }\n\t this.length = Math.min(s, this.length);\n\n\t if (r !== 0) {\n\t var mask = 0x3ffffff ^ ((0x3ffffff >>> r) << r);\n\t this.words[this.length - 1] &= mask;\n\t }\n\n\t return this.strip();\n\t };\n\n\t // Return only lowers bits of number\n\t BN.prototype.maskn = function maskn (bits) {\n\t return this.clone().imaskn(bits);\n\t };\n\n\t // Add plain number `num` to `this`\n\t BN.prototype.iaddn = function iaddn (num) {\n\t assert(typeof num === 'number');\n\t assert(num < 0x4000000);\n\t if (num < 0) return this.isubn(-num);\n\n\t // Possible sign change\n\t if (this.negative !== 0) {\n\t if (this.length === 1 && (this.words[0] | 0) < num) {\n\t this.words[0] = num - (this.words[0] | 0);\n\t this.negative = 0;\n\t return this;\n\t }\n\n\t this.negative = 0;\n\t this.isubn(num);\n\t this.negative = 1;\n\t return this;\n\t }\n\n\t // Add without checks\n\t return this._iaddn(num);\n\t };\n\n\t BN.prototype._iaddn = function _iaddn (num) {\n\t this.words[0] += num;\n\n\t // Carry\n\t for (var i = 0; i < this.length && this.words[i] >= 0x4000000; i++) {\n\t this.words[i] -= 0x4000000;\n\t if (i === this.length - 1) {\n\t this.words[i + 1] = 1;\n\t } else {\n\t this.words[i + 1]++;\n\t }\n\t }\n\t this.length = Math.max(this.length, i + 1);\n\n\t return this;\n\t };\n\n\t // Subtract plain number `num` from `this`\n\t BN.prototype.isubn = function isubn (num) {\n\t assert(typeof num === 'number');\n\t assert(num < 0x4000000);\n\t if (num < 0) return this.iaddn(-num);\n\n\t if (this.negative !== 0) {\n\t this.negative = 0;\n\t this.iaddn(num);\n\t this.negative = 1;\n\t return this;\n\t }\n\n\t this.words[0] -= num;\n\n\t if (this.length === 1 && this.words[0] < 0) {\n\t this.words[0] = -this.words[0];\n\t this.negative = 1;\n\t } else {\n\t // Carry\n\t for (var i = 0; i < this.length && this.words[i] < 0; i++) {\n\t this.words[i] += 0x4000000;\n\t this.words[i + 1] -= 1;\n\t }\n\t }\n\n\t return this.strip();\n\t };\n\n\t BN.prototype.addn = function addn (num) {\n\t return this.clone().iaddn(num);\n\t };\n\n\t BN.prototype.subn = function subn (num) {\n\t return this.clone().isubn(num);\n\t };\n\n\t BN.prototype.iabs = function iabs () {\n\t this.negative = 0;\n\n\t return this;\n\t };\n\n\t BN.prototype.abs = function abs () {\n\t return this.clone().iabs();\n\t };\n\n\t BN.prototype._ishlnsubmul = function _ishlnsubmul (num, mul, shift) {\n\t var len = num.length + shift;\n\t var i;\n\n\t this._expand(len);\n\n\t var w;\n\t var carry = 0;\n\t for (i = 0; i < num.length; i++) {\n\t w = (this.words[i + shift] | 0) + carry;\n\t var right = (num.words[i] | 0) * mul;\n\t w -= right & 0x3ffffff;\n\t carry = (w >> 26) - ((right / 0x4000000) | 0);\n\t this.words[i + shift] = w & 0x3ffffff;\n\t }\n\t for (; i < this.length - shift; i++) {\n\t w = (this.words[i + shift] | 0) + carry;\n\t carry = w >> 26;\n\t this.words[i + shift] = w & 0x3ffffff;\n\t }\n\n\t if (carry === 0) return this.strip();\n\n\t // Subtraction overflow\n\t assert(carry === -1);\n\t carry = 0;\n\t for (i = 0; i < this.length; i++) {\n\t w = -(this.words[i] | 0) + carry;\n\t carry = w >> 26;\n\t this.words[i] = w & 0x3ffffff;\n\t }\n\t this.negative = 1;\n\n\t return this.strip();\n\t };\n\n\t BN.prototype._wordDiv = function _wordDiv (num, mode) {\n\t var shift = this.length - num.length;\n\n\t var a = this.clone();\n\t var b = num;\n\n\t // Normalize\n\t var bhi = b.words[b.length - 1] | 0;\n\t var bhiBits = this._countBits(bhi);\n\t shift = 26 - bhiBits;\n\t if (shift !== 0) {\n\t b = b.ushln(shift);\n\t a.iushln(shift);\n\t bhi = b.words[b.length - 1] | 0;\n\t }\n\n\t // Initialize quotient\n\t var m = a.length - b.length;\n\t var q;\n\n\t if (mode !== 'mod') {\n\t q = new BN(null);\n\t q.length = m + 1;\n\t q.words = new Array(q.length);\n\t for (var i = 0; i < q.length; i++) {\n\t q.words[i] = 0;\n\t }\n\t }\n\n\t var diff = a.clone()._ishlnsubmul(b, 1, m);\n\t if (diff.negative === 0) {\n\t a = diff;\n\t if (q) {\n\t q.words[m] = 1;\n\t }\n\t }\n\n\t for (var j = m - 1; j >= 0; j--) {\n\t var qj = (a.words[b.length + j] | 0) * 0x4000000 +\n\t (a.words[b.length + j - 1] | 0);\n\n\t // NOTE: (qj / bhi) is (0x3ffffff * 0x4000000 + 0x3ffffff) / 0x2000000 max\n\t // (0x7ffffff)\n\t qj = Math.min((qj / bhi) | 0, 0x3ffffff);\n\n\t a._ishlnsubmul(b, qj, j);\n\t while (a.negative !== 0) {\n\t qj--;\n\t a.negative = 0;\n\t a._ishlnsubmul(b, 1, j);\n\t if (!a.isZero()) {\n\t a.negative ^= 1;\n\t }\n\t }\n\t if (q) {\n\t q.words[j] = qj;\n\t }\n\t }\n\t if (q) {\n\t q.strip();\n\t }\n\t a.strip();\n\n\t // Denormalize\n\t if (mode !== 'div' && shift !== 0) {\n\t a.iushrn(shift);\n\t }\n\n\t return {\n\t div: q || null,\n\t mod: a\n\t };\n\t };\n\n\t // NOTE: 1) `mode` can be set to `mod` to request mod only,\n\t // to `div` to request div only, or be absent to\n\t // request both div & mod\n\t // 2) `positive` is true if unsigned mod is requested\n\t BN.prototype.divmod = function divmod (num, mode, positive) {\n\t assert(!num.isZero());\n\n\t if (this.isZero()) {\n\t return {\n\t div: new BN(0),\n\t mod: new BN(0)\n\t };\n\t }\n\n\t var div, mod, res;\n\t if (this.negative !== 0 && num.negative === 0) {\n\t res = this.neg().divmod(num, mode);\n\n\t if (mode !== 'mod') {\n\t div = res.div.neg();\n\t }\n\n\t if (mode !== 'div') {\n\t mod = res.mod.neg();\n\t if (positive && mod.negative !== 0) {\n\t mod.iadd(num);\n\t }\n\t }\n\n\t return {\n\t div: div,\n\t mod: mod\n\t };\n\t }\n\n\t if (this.negative === 0 && num.negative !== 0) {\n\t res = this.divmod(num.neg(), mode);\n\n\t if (mode !== 'mod') {\n\t div = res.div.neg();\n\t }\n\n\t return {\n\t div: div,\n\t mod: res.mod\n\t };\n\t }\n\n\t if ((this.negative & num.negative) !== 0) {\n\t res = this.neg().divmod(num.neg(), mode);\n\n\t if (mode !== 'div') {\n\t mod = res.mod.neg();\n\t if (positive && mod.negative !== 0) {\n\t mod.isub(num);\n\t }\n\t }\n\n\t return {\n\t div: res.div,\n\t mod: mod\n\t };\n\t }\n\n\t // Both numbers are positive at this point\n\n\t // Strip both numbers to approximate shift value\n\t if (num.length > this.length || this.cmp(num) < 0) {\n\t return {\n\t div: new BN(0),\n\t mod: this\n\t };\n\t }\n\n\t // Very short reduction\n\t if (num.length === 1) {\n\t if (mode === 'div') {\n\t return {\n\t div: this.divn(num.words[0]),\n\t mod: null\n\t };\n\t }\n\n\t if (mode === 'mod') {\n\t return {\n\t div: null,\n\t mod: new BN(this.modn(num.words[0]))\n\t };\n\t }\n\n\t return {\n\t div: this.divn(num.words[0]),\n\t mod: new BN(this.modn(num.words[0]))\n\t };\n\t }\n\n\t return this._wordDiv(num, mode);\n\t };\n\n\t // Find `this` / `num`\n\t BN.prototype.div = function div (num) {\n\t return this.divmod(num, 'div', false).div;\n\t };\n\n\t // Find `this` % `num`\n\t BN.prototype.mod = function mod (num) {\n\t return this.divmod(num, 'mod', false).mod;\n\t };\n\n\t BN.prototype.umod = function umod (num) {\n\t return this.divmod(num, 'mod', true).mod;\n\t };\n\n\t // Find Round(`this` / `num`)\n\t BN.prototype.divRound = function divRound (num) {\n\t var dm = this.divmod(num);\n\n\t // Fast case - exact division\n\t if (dm.mod.isZero()) return dm.div;\n\n\t var mod = dm.div.negative !== 0 ? dm.mod.isub(num) : dm.mod;\n\n\t var half = num.ushrn(1);\n\t var r2 = num.andln(1);\n\t var cmp = mod.cmp(half);\n\n\t // Round down\n\t if (cmp < 0 || r2 === 1 && cmp === 0) return dm.div;\n\n\t // Round up\n\t return dm.div.negative !== 0 ? dm.div.isubn(1) : dm.div.iaddn(1);\n\t };\n\n\t BN.prototype.modn = function modn (num) {\n\t assert(num <= 0x3ffffff);\n\t var p = (1 << 26) % num;\n\n\t var acc = 0;\n\t for (var i = this.length - 1; i >= 0; i--) {\n\t acc = (p * acc + (this.words[i] | 0)) % num;\n\t }\n\n\t return acc;\n\t };\n\n\t // In-place division by number\n\t BN.prototype.idivn = function idivn (num) {\n\t assert(num <= 0x3ffffff);\n\n\t var carry = 0;\n\t for (var i = this.length - 1; i >= 0; i--) {\n\t var w = (this.words[i] | 0) + carry * 0x4000000;\n\t this.words[i] = (w / num) | 0;\n\t carry = w % num;\n\t }\n\n\t return this.strip();\n\t };\n\n\t BN.prototype.divn = function divn (num) {\n\t return this.clone().idivn(num);\n\t };\n\n\t BN.prototype.egcd = function egcd (p) {\n\t assert(p.negative === 0);\n\t assert(!p.isZero());\n\n\t var x = this;\n\t var y = p.clone();\n\n\t if (x.negative !== 0) {\n\t x = x.umod(p);\n\t } else {\n\t x = x.clone();\n\t }\n\n\t // A * x + B * y = x\n\t var A = new BN(1);\n\t var B = new BN(0);\n\n\t // C * x + D * y = y\n\t var C = new BN(0);\n\t var D = new BN(1);\n\n\t var g = 0;\n\n\t while (x.isEven() && y.isEven()) {\n\t x.iushrn(1);\n\t y.iushrn(1);\n\t ++g;\n\t }\n\n\t var yp = y.clone();\n\t var xp = x.clone();\n\n\t while (!x.isZero()) {\n\t for (var i = 0, im = 1; (x.words[0] & im) === 0 && i < 26; ++i, im <<= 1);\n\t if (i > 0) {\n\t x.iushrn(i);\n\t while (i-- > 0) {\n\t if (A.isOdd() || B.isOdd()) {\n\t A.iadd(yp);\n\t B.isub(xp);\n\t }\n\n\t A.iushrn(1);\n\t B.iushrn(1);\n\t }\n\t }\n\n\t for (var j = 0, jm = 1; (y.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n\t if (j > 0) {\n\t y.iushrn(j);\n\t while (j-- > 0) {\n\t if (C.isOdd() || D.isOdd()) {\n\t C.iadd(yp);\n\t D.isub(xp);\n\t }\n\n\t C.iushrn(1);\n\t D.iushrn(1);\n\t }\n\t }\n\n\t if (x.cmp(y) >= 0) {\n\t x.isub(y);\n\t A.isub(C);\n\t B.isub(D);\n\t } else {\n\t y.isub(x);\n\t C.isub(A);\n\t D.isub(B);\n\t }\n\t }\n\n\t return {\n\t a: C,\n\t b: D,\n\t gcd: y.iushln(g)\n\t };\n\t };\n\n\t // This is reduced incarnation of the binary EEA\n\t // above, designated to invert members of the\n\t // _prime_ fields F(p) at a maximal speed\n\t BN.prototype._invmp = function _invmp (p) {\n\t assert(p.negative === 0);\n\t assert(!p.isZero());\n\n\t var a = this;\n\t var b = p.clone();\n\n\t if (a.negative !== 0) {\n\t a = a.umod(p);\n\t } else {\n\t a = a.clone();\n\t }\n\n\t var x1 = new BN(1);\n\t var x2 = new BN(0);\n\n\t var delta = b.clone();\n\n\t while (a.cmpn(1) > 0 && b.cmpn(1) > 0) {\n\t for (var i = 0, im = 1; (a.words[0] & im) === 0 && i < 26; ++i, im <<= 1);\n\t if (i > 0) {\n\t a.iushrn(i);\n\t while (i-- > 0) {\n\t if (x1.isOdd()) {\n\t x1.iadd(delta);\n\t }\n\n\t x1.iushrn(1);\n\t }\n\t }\n\n\t for (var j = 0, jm = 1; (b.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n\t if (j > 0) {\n\t b.iushrn(j);\n\t while (j-- > 0) {\n\t if (x2.isOdd()) {\n\t x2.iadd(delta);\n\t }\n\n\t x2.iushrn(1);\n\t }\n\t }\n\n\t if (a.cmp(b) >= 0) {\n\t a.isub(b);\n\t x1.isub(x2);\n\t } else {\n\t b.isub(a);\n\t x2.isub(x1);\n\t }\n\t }\n\n\t var res;\n\t if (a.cmpn(1) === 0) {\n\t res = x1;\n\t } else {\n\t res = x2;\n\t }\n\n\t if (res.cmpn(0) < 0) {\n\t res.iadd(p);\n\t }\n\n\t return res;\n\t };\n\n\t BN.prototype.gcd = function gcd (num) {\n\t if (this.isZero()) return num.abs();\n\t if (num.isZero()) return this.abs();\n\n\t var a = this.clone();\n\t var b = num.clone();\n\t a.negative = 0;\n\t b.negative = 0;\n\n\t // Remove common factor of two\n\t for (var shift = 0; a.isEven() && b.isEven(); shift++) {\n\t a.iushrn(1);\n\t b.iushrn(1);\n\t }\n\n\t do {\n\t while (a.isEven()) {\n\t a.iushrn(1);\n\t }\n\t while (b.isEven()) {\n\t b.iushrn(1);\n\t }\n\n\t var r = a.cmp(b);\n\t if (r < 0) {\n\t // Swap `a` and `b` to make `a` always bigger than `b`\n\t var t = a;\n\t a = b;\n\t b = t;\n\t } else if (r === 0 || b.cmpn(1) === 0) {\n\t break;\n\t }\n\n\t a.isub(b);\n\t } while (true);\n\n\t return b.iushln(shift);\n\t };\n\n\t // Invert number in the field F(num)\n\t BN.prototype.invm = function invm (num) {\n\t return this.egcd(num).a.umod(num);\n\t };\n\n\t BN.prototype.isEven = function isEven () {\n\t return (this.words[0] & 1) === 0;\n\t };\n\n\t BN.prototype.isOdd = function isOdd () {\n\t return (this.words[0] & 1) === 1;\n\t };\n\n\t // And first word and num\n\t BN.prototype.andln = function andln (num) {\n\t return this.words[0] & num;\n\t };\n\n\t // Increment at the bit position in-line\n\t BN.prototype.bincn = function bincn (bit) {\n\t assert(typeof bit === 'number');\n\t var r = bit % 26;\n\t var s = (bit - r) / 26;\n\t var q = 1 << r;\n\n\t // Fast case: bit is much higher than all existing words\n\t if (this.length <= s) {\n\t this._expand(s + 1);\n\t this.words[s] |= q;\n\t return this;\n\t }\n\n\t // Add bit and propagate, if needed\n\t var carry = q;\n\t for (var i = s; carry !== 0 && i < this.length; i++) {\n\t var w = this.words[i] | 0;\n\t w += carry;\n\t carry = w >>> 26;\n\t w &= 0x3ffffff;\n\t this.words[i] = w;\n\t }\n\t if (carry !== 0) {\n\t this.words[i] = carry;\n\t this.length++;\n\t }\n\t return this;\n\t };\n\n\t BN.prototype.isZero = function isZero () {\n\t return this.length === 1 && this.words[0] === 0;\n\t };\n\n\t BN.prototype.cmpn = function cmpn (num) {\n\t var negative = num < 0;\n\n\t if (this.negative !== 0 && !negative) return -1;\n\t if (this.negative === 0 && negative) return 1;\n\n\t this.strip();\n\n\t var res;\n\t if (this.length > 1) {\n\t res = 1;\n\t } else {\n\t if (negative) {\n\t num = -num;\n\t }\n\n\t assert(num <= 0x3ffffff, 'Number is too big');\n\n\t var w = this.words[0] | 0;\n\t res = w === num ? 0 : w < num ? -1 : 1;\n\t }\n\t if (this.negative !== 0) return -res | 0;\n\t return res;\n\t };\n\n\t // Compare two numbers and return:\n\t // 1 - if `this` > `num`\n\t // 0 - if `this` == `num`\n\t // -1 - if `this` < `num`\n\t BN.prototype.cmp = function cmp (num) {\n\t if (this.negative !== 0 && num.negative === 0) return -1;\n\t if (this.negative === 0 && num.negative !== 0) return 1;\n\n\t var res = this.ucmp(num);\n\t if (this.negative !== 0) return -res | 0;\n\t return res;\n\t };\n\n\t // Unsigned comparison\n\t BN.prototype.ucmp = function ucmp (num) {\n\t // At this point both numbers have the same sign\n\t if (this.length > num.length) return 1;\n\t if (this.length < num.length) return -1;\n\n\t var res = 0;\n\t for (var i = this.length - 1; i >= 0; i--) {\n\t var a = this.words[i] | 0;\n\t var b = num.words[i] | 0;\n\n\t if (a === b) continue;\n\t if (a < b) {\n\t res = -1;\n\t } else if (a > b) {\n\t res = 1;\n\t }\n\t break;\n\t }\n\t return res;\n\t };\n\n\t BN.prototype.gtn = function gtn (num) {\n\t return this.cmpn(num) === 1;\n\t };\n\n\t BN.prototype.gt = function gt (num) {\n\t return this.cmp(num) === 1;\n\t };\n\n\t BN.prototype.gten = function gten (num) {\n\t return this.cmpn(num) >= 0;\n\t };\n\n\t BN.prototype.gte = function gte (num) {\n\t return this.cmp(num) >= 0;\n\t };\n\n\t BN.prototype.ltn = function ltn (num) {\n\t return this.cmpn(num) === -1;\n\t };\n\n\t BN.prototype.lt = function lt (num) {\n\t return this.cmp(num) === -1;\n\t };\n\n\t BN.prototype.lten = function lten (num) {\n\t return this.cmpn(num) <= 0;\n\t };\n\n\t BN.prototype.lte = function lte (num) {\n\t return this.cmp(num) <= 0;\n\t };\n\n\t BN.prototype.eqn = function eqn (num) {\n\t return this.cmpn(num) === 0;\n\t };\n\n\t BN.prototype.eq = function eq (num) {\n\t return this.cmp(num) === 0;\n\t };\n\n\t //\n\t // A reduce context, could be using montgomery or something better, depending\n\t // on the `m` itself.\n\t //\n\t BN.red = function red (num) {\n\t return new Red(num);\n\t };\n\n\t BN.prototype.toRed = function toRed (ctx) {\n\t assert(!this.red, 'Already a number in reduction context');\n\t assert(this.negative === 0, 'red works only with positives');\n\t return ctx.convertTo(this)._forceRed(ctx);\n\t };\n\n\t BN.prototype.fromRed = function fromRed () {\n\t assert(this.red, 'fromRed works only with numbers in reduction context');\n\t return this.red.convertFrom(this);\n\t };\n\n\t BN.prototype._forceRed = function _forceRed (ctx) {\n\t this.red = ctx;\n\t return this;\n\t };\n\n\t BN.prototype.forceRed = function forceRed (ctx) {\n\t assert(!this.red, 'Already a number in reduction context');\n\t return this._forceRed(ctx);\n\t };\n\n\t BN.prototype.redAdd = function redAdd (num) {\n\t assert(this.red, 'redAdd works only with red numbers');\n\t return this.red.add(this, num);\n\t };\n\n\t BN.prototype.redIAdd = function redIAdd (num) {\n\t assert(this.red, 'redIAdd works only with red numbers');\n\t return this.red.iadd(this, num);\n\t };\n\n\t BN.prototype.redSub = function redSub (num) {\n\t assert(this.red, 'redSub works only with red numbers');\n\t return this.red.sub(this, num);\n\t };\n\n\t BN.prototype.redISub = function redISub (num) {\n\t assert(this.red, 'redISub works only with red numbers');\n\t return this.red.isub(this, num);\n\t };\n\n\t BN.prototype.redShl = function redShl (num) {\n\t assert(this.red, 'redShl works only with red numbers');\n\t return this.red.shl(this, num);\n\t };\n\n\t BN.prototype.redMul = function redMul (num) {\n\t assert(this.red, 'redMul works only with red numbers');\n\t this.red._verify2(this, num);\n\t return this.red.mul(this, num);\n\t };\n\n\t BN.prototype.redIMul = function redIMul (num) {\n\t assert(this.red, 'redMul works only with red numbers');\n\t this.red._verify2(this, num);\n\t return this.red.imul(this, num);\n\t };\n\n\t BN.prototype.redSqr = function redSqr () {\n\t assert(this.red, 'redSqr works only with red numbers');\n\t this.red._verify1(this);\n\t return this.red.sqr(this);\n\t };\n\n\t BN.prototype.redISqr = function redISqr () {\n\t assert(this.red, 'redISqr works only with red numbers');\n\t this.red._verify1(this);\n\t return this.red.isqr(this);\n\t };\n\n\t // Square root over p\n\t BN.prototype.redSqrt = function redSqrt () {\n\t assert(this.red, 'redSqrt works only with red numbers');\n\t this.red._verify1(this);\n\t return this.red.sqrt(this);\n\t };\n\n\t BN.prototype.redInvm = function redInvm () {\n\t assert(this.red, 'redInvm works only with red numbers');\n\t this.red._verify1(this);\n\t return this.red.invm(this);\n\t };\n\n\t // Return negative clone of `this` % `red modulo`\n\t BN.prototype.redNeg = function redNeg () {\n\t assert(this.red, 'redNeg works only with red numbers');\n\t this.red._verify1(this);\n\t return this.red.neg(this);\n\t };\n\n\t BN.prototype.redPow = function redPow (num) {\n\t assert(this.red && !num.red, 'redPow(normalNum)');\n\t this.red._verify1(this);\n\t return this.red.pow(this, num);\n\t };\n\n\t // Prime numbers with efficient reduction\n\t var primes = {\n\t k256: null,\n\t p224: null,\n\t p192: null,\n\t p25519: null\n\t };\n\n\t // Pseudo-Mersenne prime\n\t function MPrime (name, p) {\n\t // P = 2 ^ N - K\n\t this.name = name;\n\t this.p = new BN(p, 16);\n\t this.n = this.p.bitLength();\n\t this.k = new BN(1).iushln(this.n).isub(this.p);\n\n\t this.tmp = this._tmp();\n\t }\n\n\t MPrime.prototype._tmp = function _tmp () {\n\t var tmp = new BN(null);\n\t tmp.words = new Array(Math.ceil(this.n / 13));\n\t return tmp;\n\t };\n\n\t MPrime.prototype.ireduce = function ireduce (num) {\n\t // Assumes that `num` is less than `P^2`\n\t // num = HI * (2 ^ N - K) + HI * K + LO = HI * K + LO (mod P)\n\t var r = num;\n\t var rlen;\n\n\t do {\n\t this.split(r, this.tmp);\n\t r = this.imulK(r);\n\t r = r.iadd(this.tmp);\n\t rlen = r.bitLength();\n\t } while (rlen > this.n);\n\n\t var cmp = rlen < this.n ? -1 : r.ucmp(this.p);\n\t if (cmp === 0) {\n\t r.words[0] = 0;\n\t r.length = 1;\n\t } else if (cmp > 0) {\n\t r.isub(this.p);\n\t } else {\n\t r.strip();\n\t }\n\n\t return r;\n\t };\n\n\t MPrime.prototype.split = function split (input, out) {\n\t input.iushrn(this.n, 0, out);\n\t };\n\n\t MPrime.prototype.imulK = function imulK (num) {\n\t return num.imul(this.k);\n\t };\n\n\t function K256 () {\n\t MPrime.call(\n\t this,\n\t 'k256',\n\t 'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f');\n\t }\n\t inherits(K256, MPrime);\n\n\t K256.prototype.split = function split (input, output) {\n\t // 256 = 9 * 26 + 22\n\t var mask = 0x3fffff;\n\n\t var outLen = Math.min(input.length, 9);\n\t for (var i = 0; i < outLen; i++) {\n\t output.words[i] = input.words[i];\n\t }\n\t output.length = outLen;\n\n\t if (input.length <= 9) {\n\t input.words[0] = 0;\n\t input.length = 1;\n\t return;\n\t }\n\n\t // Shift by 9 limbs\n\t var prev = input.words[9];\n\t output.words[output.length++] = prev & mask;\n\n\t for (i = 10; i < input.length; i++) {\n\t var next = input.words[i] | 0;\n\t input.words[i - 10] = ((next & mask) << 4) | (prev >>> 22);\n\t prev = next;\n\t }\n\t prev >>>= 22;\n\t input.words[i - 10] = prev;\n\t if (prev === 0 && input.length > 10) {\n\t input.length -= 10;\n\t } else {\n\t input.length -= 9;\n\t }\n\t };\n\n\t K256.prototype.imulK = function imulK (num) {\n\t // K = 0x1000003d1 = [ 0x40, 0x3d1 ]\n\t num.words[num.length] = 0;\n\t num.words[num.length + 1] = 0;\n\t num.length += 2;\n\n\t // bounded at: 0x40 * 0x3ffffff + 0x3d0 = 0x100000390\n\t var lo = 0;\n\t for (var i = 0; i < num.length; i++) {\n\t var w = num.words[i] | 0;\n\t lo += w * 0x3d1;\n\t num.words[i] = lo & 0x3ffffff;\n\t lo = w * 0x40 + ((lo / 0x4000000) | 0);\n\t }\n\n\t // Fast length reduction\n\t if (num.words[num.length - 1] === 0) {\n\t num.length--;\n\t if (num.words[num.length - 1] === 0) {\n\t num.length--;\n\t }\n\t }\n\t return num;\n\t };\n\n\t function P224 () {\n\t MPrime.call(\n\t this,\n\t 'p224',\n\t 'ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001');\n\t }\n\t inherits(P224, MPrime);\n\n\t function P192 () {\n\t MPrime.call(\n\t this,\n\t 'p192',\n\t 'ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff');\n\t }\n\t inherits(P192, MPrime);\n\n\t function P25519 () {\n\t // 2 ^ 255 - 19\n\t MPrime.call(\n\t this,\n\t '25519',\n\t '7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed');\n\t }\n\t inherits(P25519, MPrime);\n\n\t P25519.prototype.imulK = function imulK (num) {\n\t // K = 0x13\n\t var carry = 0;\n\t for (var i = 0; i < num.length; i++) {\n\t var hi = (num.words[i] | 0) * 0x13 + carry;\n\t var lo = hi & 0x3ffffff;\n\t hi >>>= 26;\n\n\t num.words[i] = lo;\n\t carry = hi;\n\t }\n\t if (carry !== 0) {\n\t num.words[num.length++] = carry;\n\t }\n\t return num;\n\t };\n\n\t // Exported mostly for testing purposes, use plain name instead\n\t BN._prime = function prime (name) {\n\t // Cached version of prime\n\t if (primes[name]) return primes[name];\n\n\t var prime;\n\t if (name === 'k256') {\n\t prime = new K256();\n\t } else if (name === 'p224') {\n\t prime = new P224();\n\t } else if (name === 'p192') {\n\t prime = new P192();\n\t } else if (name === 'p25519') {\n\t prime = new P25519();\n\t } else {\n\t throw new Error('Unknown prime ' + name);\n\t }\n\t primes[name] = prime;\n\n\t return prime;\n\t };\n\n\t //\n\t // Base reduction engine\n\t //\n\t function Red (m) {\n\t if (typeof m === 'string') {\n\t var prime = BN._prime(m);\n\t this.m = prime.p;\n\t this.prime = prime;\n\t } else {\n\t assert(m.gtn(1), 'modulus must be greater than 1');\n\t this.m = m;\n\t this.prime = null;\n\t }\n\t }\n\n\t Red.prototype._verify1 = function _verify1 (a) {\n\t assert(a.negative === 0, 'red works only with positives');\n\t assert(a.red, 'red works only with red numbers');\n\t };\n\n\t Red.prototype._verify2 = function _verify2 (a, b) {\n\t assert((a.negative | b.negative) === 0, 'red works only with positives');\n\t assert(a.red && a.red === b.red,\n\t 'red works only with red numbers');\n\t };\n\n\t Red.prototype.imod = function imod (a) {\n\t if (this.prime) return this.prime.ireduce(a)._forceRed(this);\n\t return a.umod(this.m)._forceRed(this);\n\t };\n\n\t Red.prototype.neg = function neg (a) {\n\t if (a.isZero()) {\n\t return a.clone();\n\t }\n\n\t return this.m.sub(a)._forceRed(this);\n\t };\n\n\t Red.prototype.add = function add (a, b) {\n\t this._verify2(a, b);\n\n\t var res = a.add(b);\n\t if (res.cmp(this.m) >= 0) {\n\t res.isub(this.m);\n\t }\n\t return res._forceRed(this);\n\t };\n\n\t Red.prototype.iadd = function iadd (a, b) {\n\t this._verify2(a, b);\n\n\t var res = a.iadd(b);\n\t if (res.cmp(this.m) >= 0) {\n\t res.isub(this.m);\n\t }\n\t return res;\n\t };\n\n\t Red.prototype.sub = function sub (a, b) {\n\t this._verify2(a, b);\n\n\t var res = a.sub(b);\n\t if (res.cmpn(0) < 0) {\n\t res.iadd(this.m);\n\t }\n\t return res._forceRed(this);\n\t };\n\n\t Red.prototype.isub = function isub (a, b) {\n\t this._verify2(a, b);\n\n\t var res = a.isub(b);\n\t if (res.cmpn(0) < 0) {\n\t res.iadd(this.m);\n\t }\n\t return res;\n\t };\n\n\t Red.prototype.shl = function shl (a, num) {\n\t this._verify1(a);\n\t return this.imod(a.ushln(num));\n\t };\n\n\t Red.prototype.imul = function imul (a, b) {\n\t this._verify2(a, b);\n\t return this.imod(a.imul(b));\n\t };\n\n\t Red.prototype.mul = function mul (a, b) {\n\t this._verify2(a, b);\n\t return this.imod(a.mul(b));\n\t };\n\n\t Red.prototype.isqr = function isqr (a) {\n\t return this.imul(a, a.clone());\n\t };\n\n\t Red.prototype.sqr = function sqr (a) {\n\t return this.mul(a, a);\n\t };\n\n\t Red.prototype.sqrt = function sqrt (a) {\n\t if (a.isZero()) return a.clone();\n\n\t var mod3 = this.m.andln(3);\n\t assert(mod3 % 2 === 1);\n\n\t // Fast case\n\t if (mod3 === 3) {\n\t var pow = this.m.add(new BN(1)).iushrn(2);\n\t return this.pow(a, pow);\n\t }\n\n\t // Tonelli-Shanks algorithm (Totally unoptimized and slow)\n\t //\n\t // Find Q and S, that Q * 2 ^ S = (P - 1)\n\t var q = this.m.subn(1);\n\t var s = 0;\n\t while (!q.isZero() && q.andln(1) === 0) {\n\t s++;\n\t q.iushrn(1);\n\t }\n\t assert(!q.isZero());\n\n\t var one = new BN(1).toRed(this);\n\t var nOne = one.redNeg();\n\n\t // Find quadratic non-residue\n\t // NOTE: Max is such because of generalized Riemann hypothesis.\n\t var lpow = this.m.subn(1).iushrn(1);\n\t var z = this.m.bitLength();\n\t z = new BN(2 * z * z).toRed(this);\n\n\t while (this.pow(z, lpow).cmp(nOne) !== 0) {\n\t z.redIAdd(nOne);\n\t }\n\n\t var c = this.pow(z, q);\n\t var r = this.pow(a, q.addn(1).iushrn(1));\n\t var t = this.pow(a, q);\n\t var m = s;\n\t while (t.cmp(one) !== 0) {\n\t var tmp = t;\n\t for (var i = 0; tmp.cmp(one) !== 0; i++) {\n\t tmp = tmp.redSqr();\n\t }\n\t assert(i < m);\n\t var b = this.pow(c, new BN(1).iushln(m - i - 1));\n\n\t r = r.redMul(b);\n\t c = b.redSqr();\n\t t = t.redMul(c);\n\t m = i;\n\t }\n\n\t return r;\n\t };\n\n\t Red.prototype.invm = function invm (a) {\n\t var inv = a._invmp(this.m);\n\t if (inv.negative !== 0) {\n\t inv.negative = 0;\n\t return this.imod(inv).redNeg();\n\t } else {\n\t return this.imod(inv);\n\t }\n\t };\n\n\t Red.prototype.pow = function pow (a, num) {\n\t if (num.isZero()) return new BN(1);\n\t if (num.cmpn(1) === 0) return a.clone();\n\n\t var windowSize = 4;\n\t var wnd = new Array(1 << windowSize);\n\t wnd[0] = new BN(1).toRed(this);\n\t wnd[1] = a;\n\t for (var i = 2; i < wnd.length; i++) {\n\t wnd[i] = this.mul(wnd[i - 1], a);\n\t }\n\n\t var res = wnd[0];\n\t var current = 0;\n\t var currentLen = 0;\n\t var start = num.bitLength() % 26;\n\t if (start === 0) {\n\t start = 26;\n\t }\n\n\t for (i = num.length - 1; i >= 0; i--) {\n\t var word = num.words[i];\n\t for (var j = start - 1; j >= 0; j--) {\n\t var bit = (word >> j) & 1;\n\t if (res !== wnd[0]) {\n\t res = this.sqr(res);\n\t }\n\n\t if (bit === 0 && current === 0) {\n\t currentLen = 0;\n\t continue;\n\t }\n\n\t current <<= 1;\n\t current |= bit;\n\t currentLen++;\n\t if (currentLen !== windowSize && (i !== 0 || j !== 0)) continue;\n\n\t res = this.mul(res, wnd[current]);\n\t currentLen = 0;\n\t current = 0;\n\t }\n\t start = 26;\n\t }\n\n\t return res;\n\t };\n\n\t Red.prototype.convertTo = function convertTo (num) {\n\t var r = num.umod(this.m);\n\n\t return r === num ? r.clone() : r;\n\t };\n\n\t Red.prototype.convertFrom = function convertFrom (num) {\n\t var res = num.clone();\n\t res.red = null;\n\t return res;\n\t };\n\n\t //\n\t // Montgomery method engine\n\t //\n\n\t BN.mont = function mont (num) {\n\t return new Mont(num);\n\t };\n\n\t function Mont (m) {\n\t Red.call(this, m);\n\n\t this.shift = this.m.bitLength();\n\t if (this.shift % 26 !== 0) {\n\t this.shift += 26 - (this.shift % 26);\n\t }\n\n\t this.r = new BN(1).iushln(this.shift);\n\t this.r2 = this.imod(this.r.sqr());\n\t this.rinv = this.r._invmp(this.m);\n\n\t this.minv = this.rinv.mul(this.r).isubn(1).div(this.m);\n\t this.minv = this.minv.umod(this.r);\n\t this.minv = this.r.sub(this.minv);\n\t }\n\t inherits(Mont, Red);\n\n\t Mont.prototype.convertTo = function convertTo (num) {\n\t return this.imod(num.ushln(this.shift));\n\t };\n\n\t Mont.prototype.convertFrom = function convertFrom (num) {\n\t var r = this.imod(num.mul(this.rinv));\n\t r.red = null;\n\t return r;\n\t };\n\n\t Mont.prototype.imul = function imul (a, b) {\n\t if (a.isZero() || b.isZero()) {\n\t a.words[0] = 0;\n\t a.length = 1;\n\t return a;\n\t }\n\n\t var t = a.imul(b);\n\t var c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m);\n\t var u = t.isub(c).iushrn(this.shift);\n\t var res = u;\n\n\t if (u.cmp(this.m) >= 0) {\n\t res = u.isub(this.m);\n\t } else if (u.cmpn(0) < 0) {\n\t res = u.iadd(this.m);\n\t }\n\n\t return res._forceRed(this);\n\t };\n\n\t Mont.prototype.mul = function mul (a, b) {\n\t if (a.isZero() || b.isZero()) return new BN(0)._forceRed(this);\n\n\t var t = a.mul(b);\n\t var c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m);\n\t var u = t.isub(c).iushrn(this.shift);\n\t var res = u;\n\t if (u.cmp(this.m) >= 0) {\n\t res = u.isub(this.m);\n\t } else if (u.cmpn(0) < 0) {\n\t res = u.iadd(this.m);\n\t }\n\n\t return res._forceRed(this);\n\t };\n\n\t Mont.prototype.invm = function invm (a) {\n\t // (AR)^-1 * R^2 = (A^-1 * R^-1) * R^2 = A^-1 * R\n\t var res = this.imod(a._invmp(this.m).mul(this.r2));\n\t return res._forceRed(this);\n\t };\n\t})(typeof module === 'undefined' || module, this);\n\n\t/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(92)(module)))\n\n/***/ },\n/* 12 */\n/***/ function(module, exports, __webpack_require__) {\n\n\t// Copyright Joyent, Inc. and other Node contributors.\n\t//\n\t// Permission is hereby granted, free of charge, to any person obtaining a\n\t// copy of this software and associated documentation files (the\n\t// \"Software\"), to deal in the Software without restriction, including\n\t// without limitation the rights to use, copy, modify, merge, publish,\n\t// distribute, sublicense, and/or sell copies of the Software, and to permit\n\t// persons to whom the Software is furnished to do so, subject to the\n\t// following conditions:\n\t//\n\t// The above copyright notice and this permission notice shall be included\n\t// in all copies or substantial portions of the Software.\n\t//\n\t// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n\t// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n\t// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN\n\t// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n\t// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR\n\t// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE\n\t// USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n\tmodule.exports = Stream;\n\n\tvar EE = __webpack_require__(32).EventEmitter;\n\tvar inherits = __webpack_require__(2);\n\n\tinherits(Stream, EE);\n\tStream.Readable = __webpack_require__(522);\n\tStream.Writable = __webpack_require__(524);\n\tStream.Duplex = __webpack_require__(520);\n\tStream.Transform = __webpack_require__(523);\n\tStream.PassThrough = __webpack_require__(521);\n\n\t// Backwards-compat with node 0.4.x\n\tStream.Stream = Stream;\n\n\n\n\t// old-style streams. Note that the pipe method (the only relevant\n\t// part of this class) is overridden in the Readable class.\n\n\tfunction Stream() {\n\t EE.call(this);\n\t}\n\n\tStream.prototype.pipe = function(dest, options) {\n\t var source = this;\n\n\t function ondata(chunk) {\n\t if (dest.writable) {\n\t if (false === dest.write(chunk) && source.pause) {\n\t source.pause();\n\t }\n\t }\n\t }\n\n\t source.on('data', ondata);\n\n\t function ondrain() {\n\t if (source.readable && source.resume) {\n\t source.resume();\n\t }\n\t }\n\n\t dest.on('drain', ondrain);\n\n\t // If the 'end' option is not supplied, dest.end() will be called when\n\t // source gets the 'end' or 'close' events. Only dest.end() once.\n\t if (!dest._isStdio && (!options || options.end !== false)) {\n\t source.on('end', onend);\n\t source.on('close', onclose);\n\t }\n\n\t var didOnEnd = false;\n\t function onend() {\n\t if (didOnEnd) return;\n\t didOnEnd = true;\n\n\t dest.end();\n\t }\n\n\n\t function onclose() {\n\t if (didOnEnd) return;\n\t didOnEnd = true;\n\n\t if (typeof dest.destroy === 'function') dest.destroy();\n\t }\n\n\t // don't leave dangling pipes when there are errors.\n\t function onerror(er) {\n\t cleanup();\n\t if (EE.listenerCount(this, 'error') === 0) {\n\t throw er; // Unhandled stream error in pipe.\n\t }\n\t }\n\n\t source.on('error', onerror);\n\t dest.on('error', onerror);\n\n\t // remove all the event listeners that were added.\n\t function cleanup() {\n\t source.removeListener('data', ondata);\n\t dest.removeListener('drain', ondrain);\n\n\t source.removeListener('end', onend);\n\t source.removeListener('close', onclose);\n\n\t source.removeListener('error', onerror);\n\t dest.removeListener('error', onerror);\n\n\t source.removeListener('end', cleanup);\n\t source.removeListener('close', cleanup);\n\n\t dest.removeListener('close', cleanup);\n\t }\n\n\t source.on('end', cleanup);\n\t source.on('close', cleanup);\n\n\t dest.on('close', cleanup);\n\n\t dest.emit('pipe', source);\n\n\t // Allow for unix-like usage: A.pipe(B).pipe(C)\n\t return dest;\n\t};\n\n\n/***/ },\n/* 13 */\n/***/ function(module, exports, __webpack_require__) {\n\n\t// 7.1.15 ToLength\n\tvar toInteger = __webpack_require__(39)\n\t , min = Math.min;\n\tmodule.exports = function(it){\n\t return it > 0 ? min(toInteger(it), 0x1fffffffffffff) : 0; // pow(2, 53) - 1 == 9007199254740991\n\t};\n\n/***/ },\n/* 14 */\n/***/ function(module, exports, __webpack_require__) {\n\n\t// 7.1.13 ToObject(argument)\n\tvar defined = __webpack_require__(27);\n\tmodule.exports = function(it){\n\t return Object(defined(it));\n\t};\n\n/***/ },\n/* 15 */\n/***/ function(module, exports) {\n\n\t'use strict';\n\n\texports.command = function command(send, name) {\n\t return function (opts, cb) {\n\t if (typeof opts === 'function') {\n\t cb = opts;\n\t opts = {};\n\t }\n\t return send(name, null, opts, null, cb);\n\t };\n\t};\n\n\texports.argCommand = function argCommand(send, name) {\n\t return function (arg, opts, cb) {\n\t if (typeof opts === 'function') {\n\t cb = opts;\n\t opts = {};\n\t }\n\t return send(name, arg, opts, null, cb);\n\t };\n\t};\n\n/***/ },\n/* 16 */\n/***/ function(module, exports) {\n\n\tvar hasOwnProperty = {}.hasOwnProperty;\n\tmodule.exports = function(it, key){\n\t return hasOwnProperty.call(it, key);\n\t};\n\n/***/ },\n/* 17 */\n/***/ function(module, exports, __webpack_require__) {\n\n\t/* WEBPACK VAR INJECTION */(function(Buffer) {// Copyright Joyent, Inc. and other Node contributors.\n\t//\n\t// Permission is hereby granted, free of charge, to any person obtaining a\n\t// copy of this software and associated documentation files (the\n\t// \"Software\"), to deal in the Software without restriction, including\n\t// without limitation the rights to use, copy, modify, merge, publish,\n\t// distribute, sublicense, and/or sell copies of the Software, and to permit\n\t// persons to whom the Software is furnished to do so, subject to the\n\t// following conditions:\n\t//\n\t// The above copyright notice and this permission notice shall be included\n\t// in all copies or substantial portions of the Software.\n\t//\n\t// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n\t// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n\t// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN\n\t// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n\t// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR\n\t// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE\n\t// USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n\t// NOTE: These type checking functions intentionally don't use `instanceof`\n\t// because it is fragile and can be easily faked with `Object.create()`.\n\n\tfunction isArray(arg) {\n\t if (Array.isArray) {\n\t return Array.isArray(arg);\n\t }\n\t return objectToString(arg) === '[object Array]';\n\t}\n\texports.isArray = isArray;\n\n\tfunction isBoolean(arg) {\n\t return typeof arg === 'boolean';\n\t}\n\texports.isBoolean = isBoolean;\n\n\tfunction isNull(arg) {\n\t return arg === null;\n\t}\n\texports.isNull = isNull;\n\n\tfunction isNullOrUndefined(arg) {\n\t return arg == null;\n\t}\n\texports.isNullOrUndefined = isNullOrUndefined;\n\n\tfunction isNumber(arg) {\n\t return typeof arg === 'number';\n\t}\n\texports.isNumber = isNumber;\n\n\tfunction isString(arg) {\n\t return typeof arg === 'string';\n\t}\n\texports.isString = isString;\n\n\tfunction isSymbol(arg) {\n\t return typeof arg === 'symbol';\n\t}\n\texports.isSymbol = isSymbol;\n\n\tfunction isUndefined(arg) {\n\t return arg === void 0;\n\t}\n\texports.isUndefined = isUndefined;\n\n\tfunction isRegExp(re) {\n\t return objectToString(re) === '[object RegExp]';\n\t}\n\texports.isRegExp = isRegExp;\n\n\tfunction isObject(arg) {\n\t return typeof arg === 'object' && arg !== null;\n\t}\n\texports.isObject = isObject;\n\n\tfunction isDate(d) {\n\t return objectToString(d) === '[object Date]';\n\t}\n\texports.isDate = isDate;\n\n\tfunction isError(e) {\n\t return (objectToString(e) === '[object Error]' || e instanceof Error);\n\t}\n\texports.isError = isError;\n\n\tfunction isFunction(arg) {\n\t return typeof arg === 'function';\n\t}\n\texports.isFunction = isFunction;\n\n\tfunction isPrimitive(arg) {\n\t return arg === null ||\n\t typeof arg === 'boolean' ||\n\t typeof arg === 'number' ||\n\t typeof arg === 'string' ||\n\t typeof arg === 'symbol' || // ES6 symbol\n\t typeof arg === 'undefined';\n\t}\n\texports.isPrimitive = isPrimitive;\n\n\texports.isBuffer = Buffer.isBuffer;\n\n\tfunction objectToString(o) {\n\t return Object.prototype.toString.call(o);\n\t}\n\n\t/* WEBPACK VAR INJECTION */}.call(exports, __webpack_require__(1).Buffer))\n\n/***/ },\n/* 18 */\n/***/ function(module, exports, __webpack_require__) {\n\n\t'use strict';\n\n\tvar elliptic = exports;\n\n\telliptic.version = __webpack_require__(488).version;\n\telliptic.utils = __webpack_require__(472);\n\telliptic.rand = __webpack_require__(140);\n\telliptic.hmacDRBG = __webpack_require__(470);\n\telliptic.curve = __webpack_require__(88);\n\telliptic.curves = __webpack_require__(463);\n\n\t// Protocols\n\telliptic.ec = __webpack_require__(464);\n\telliptic.eddsa = __webpack_require__(467);\n\n\n/***/ },\n/* 19 */\n/***/ function(module, exports, __webpack_require__) {\n\n\tvar dP = __webpack_require__(10)\n\t , createDesc = __webpack_require__(38);\n\tmodule.exports = __webpack_require__(9) ? function(object, key, value){\n\t return dP.f(object, key, createDesc(1, value));\n\t} : function(object, key, value){\n\t object[key] = value;\n\t return object;\n\t};\n\n/***/ },\n/* 20 */\n/***/ function(module, exports, __webpack_require__) {\n\n\tvar global = __webpack_require__(5)\n\t , hide = __webpack_require__(19)\n\t , has = __webpack_require__(16)\n\t , SRC = __webpack_require__(47)('src')\n\t , TO_STRING = 'toString'\n\t , $toString = Function[TO_STRING]\n\t , TPL = ('' + $toString).split(TO_STRING);\n\n\t__webpack_require__(33).inspectSource = function(it){\n\t return $toString.call(it);\n\t};\n\n\t(module.exports = function(O, key, val, safe){\n\t var isFunction = typeof val == 'function';\n\t if(isFunction)has(val, 'name') || hide(val, 'name', key);\n\t if(O[key] === val)return;\n\t if(isFunction)has(val, SRC) || hide(val, SRC, O[key] ? '' + O[key] : TPL.join(String(key)));\n\t if(O === global){\n\t O[key] = val;\n\t } else {\n\t if(!safe){\n\t delete O[key];\n\t hide(O, key, val);\n\t } else {\n\t if(O[key])O[key] = val;\n\t else hide(O, key, val);\n\t }\n\t }\n\t// add fake Function#toString for correct work wrapped methods / constructors with methods like LoDash isNative\n\t})(Function.prototype, TO_STRING, function toString(){\n\t return typeof this == 'function' && this[SRC] || $toString.call(this);\n\t});\n\n/***/ },\n/* 21 */\n/***/ function(module, exports, __webpack_require__) {\n\n\tvar $export = __webpack_require__(0)\n\t , fails = __webpack_require__(4)\n\t , defined = __webpack_require__(27)\n\t , quot = /\"/g;\n\t// B.2.3.2.1 CreateHTML(string, tag, attribute, value)\n\tvar createHTML = function(string, tag, attribute, value) {\n\t var S = String(defined(string))\n\t , p1 = '<' + tag;\n\t if(attribute !== '')p1 += ' ' + attribute + '=\"' + String(value).replace(quot, '"') + '\"';\n\t return p1 + '>' + S + '';\n\t};\n\tmodule.exports = function(NAME, exec){\n\t var O = {};\n\t O[NAME] = exec(createHTML);\n\t $export($export.P + $export.F * fails(function(){\n\t var test = ''[NAME]('\"');\n\t return test !== test.toLowerCase() || test.split('\"').length > 3;\n\t }), 'String', O);\n\t};\n\n/***/ },\n/* 22 */\n/***/ function(module, exports, __webpack_require__) {\n\n\t// to indexed object, toObject with fallback for non-array-like ES3 strings\n\tvar IObject = __webpack_require__(67)\n\t , defined = __webpack_require__(27);\n\tmodule.exports = function(it){\n\t return IObject(defined(it));\n\t};\n\n/***/ },\n/* 23 */\n/***/ function(module, exports, __webpack_require__) {\n\n\tvar pIE = __webpack_require__(68)\r\n\t , createDesc = __webpack_require__(38)\r\n\t , toIObject = __webpack_require__(22)\r\n\t , toPrimitive = __webpack_require__(31)\r\n\t , has = __webpack_require__(16)\r\n\t , IE8_DOM_DEFINE = __webpack_require__(159)\r\n\t , gOPD = Object.getOwnPropertyDescriptor;\r\n\r\n\texports.f = __webpack_require__(9) ? gOPD : function getOwnPropertyDescriptor(O, P){\r\n\t O = toIObject(O);\r\n\t P = toPrimitive(P, true);\r\n\t if(IE8_DOM_DEFINE)try {\r\n\t return gOPD(O, P);\r\n\t } catch(e){ /* empty */ }\r\n\t if(has(O, P))return createDesc(!pIE.f.call(O, P), O[P]);\r\n\t};\n\n/***/ },\n/* 24 */\n/***/ function(module, exports, __webpack_require__) {\n\n\t// 19.1.2.9 / 15.2.3.2 Object.getPrototypeOf(O)\r\n\tvar has = __webpack_require__(16)\r\n\t , toObject = __webpack_require__(14)\r\n\t , IE_PROTO = __webpack_require__(109)('IE_PROTO')\r\n\t , ObjectProto = Object.prototype;\r\n\r\n\tmodule.exports = Object.getPrototypeOf || function(O){\r\n\t O = toObject(O);\r\n\t if(has(O, IE_PROTO))return O[IE_PROTO];\r\n\t if(typeof O.constructor == 'function' && O instanceof O.constructor){\r\n\t return O.constructor.prototype;\r\n\t } return O instanceof Object ? ObjectProto : null;\r\n\t};\n\n/***/ },\n/* 25 */\n/***/ function(module, exports) {\n\n\tmodule.exports = function(it){\n\t if(typeof it != 'function')throw TypeError(it + ' is not a function!');\n\t return it;\n\t};\n\n/***/ },\n/* 26 */\n/***/ function(module, exports) {\n\n\tvar toString = {}.toString;\n\n\tmodule.exports = function(it){\n\t return toString.call(it).slice(8, -1);\n\t};\n\n/***/ },\n/* 27 */\n/***/ function(module, exports) {\n\n\t// 7.2.1 RequireObjectCoercible(argument)\n\tmodule.exports = function(it){\n\t if(it == undefined)throw TypeError(\"Can't call method on \" + it);\n\t return it;\n\t};\n\n/***/ },\n/* 28 */\n/***/ function(module, exports, __webpack_require__) {\n\n\tvar fails = __webpack_require__(4);\r\n\r\n\tmodule.exports = function(method, arg){\r\n\t return !!method && fails(function(){\r\n\t arg ? method.call(null, function(){}, 1) : method.call(null);\r\n\t });\r\n\t};\n\n/***/ },\n/* 29 */\n/***/ function(module, exports, __webpack_require__) {\n\n\t// 0 -> Array#forEach\n\t// 1 -> Array#map\n\t// 2 -> Array#filter\n\t// 3 -> Array#some\n\t// 4 -> Array#every\n\t// 5 -> Array#find\n\t// 6 -> Array#findIndex\n\tvar ctx = __webpack_require__(34)\n\t , IObject = __webpack_require__(67)\n\t , toObject = __webpack_require__(14)\n\t , toLength = __webpack_require__(13)\n\t , asc = __webpack_require__(271);\n\tmodule.exports = function(TYPE, $create){\n\t var IS_MAP = TYPE == 1\n\t , IS_FILTER = TYPE == 2\n\t , IS_SOME = TYPE == 3\n\t , IS_EVERY = TYPE == 4\n\t , IS_FIND_INDEX = TYPE == 6\n\t , NO_HOLES = TYPE == 5 || IS_FIND_INDEX\n\t , create = $create || asc;\n\t return function($this, callbackfn, that){\n\t var O = toObject($this)\n\t , self = IObject(O)\n\t , f = ctx(callbackfn, that, 3)\n\t , length = toLength(self.length)\n\t , index = 0\n\t , result = IS_MAP ? create($this, length) : IS_FILTER ? create($this, 0) : undefined\n\t , val, res;\n\t for(;length > index; index++)if(NO_HOLES || index in self){\n\t val = self[index];\n\t res = f(val, index, O);\n\t if(TYPE){\n\t if(IS_MAP)result[index] = res; // map\n\t else if(res)switch(TYPE){\n\t case 3: return true; // some\n\t case 5: return val; // find\n\t case 6: return index; // findIndex\n\t case 2: result.push(val); // filter\n\t } else if(IS_EVERY)return false; // every\n\t }\n\t }\n\t return IS_FIND_INDEX ? -1 : IS_SOME || IS_EVERY ? IS_EVERY : result;\n\t };\n\t};\n\n/***/ },\n/* 30 */\n/***/ function(module, exports, __webpack_require__) {\n\n\t// most Object methods by ES6 should accept primitives\n\tvar $export = __webpack_require__(0)\n\t , core = __webpack_require__(33)\n\t , fails = __webpack_require__(4);\n\tmodule.exports = function(KEY, exec){\n\t var fn = (core.Object || {})[KEY] || Object[KEY]\n\t , exp = {};\n\t exp[KEY] = exec(fn);\n\t $export($export.S + $export.F * fails(function(){ fn(1); }), 'Object', exp);\n\t};\n\n/***/ },\n/* 31 */\n/***/ function(module, exports, __webpack_require__) {\n\n\t// 7.1.1 ToPrimitive(input [, PreferredType])\n\tvar isObject = __webpack_require__(6);\n\t// instead of the ES6 spec version, we didn't implement @@toPrimitive case\n\t// and the second argument - flag - preferred type is a string\n\tmodule.exports = function(it, S){\n\t if(!isObject(it))return it;\n\t var fn, val;\n\t if(S && typeof (fn = it.toString) == 'function' && !isObject(val = fn.call(it)))return val;\n\t if(typeof (fn = it.valueOf) == 'function' && !isObject(val = fn.call(it)))return val;\n\t if(!S && typeof (fn = it.toString) == 'function' && !isObject(val = fn.call(it)))return val;\n\t throw TypeError(\"Can't convert object to primitive value\");\n\t};\n\n/***/ },\n/* 32 */\n/***/ function(module, exports) {\n\n\t// Copyright Joyent, Inc. and other Node contributors.\n\t//\n\t// Permission is hereby granted, free of charge, to any person obtaining a\n\t// copy of this software and associated documentation files (the\n\t// \"Software\"), to deal in the Software without restriction, including\n\t// without limitation the rights to use, copy, modify, merge, publish,\n\t// distribute, sublicense, and/or sell copies of the Software, and to permit\n\t// persons to whom the Software is furnished to do so, subject to the\n\t// following conditions:\n\t//\n\t// The above copyright notice and this permission notice shall be included\n\t// in all copies or substantial portions of the Software.\n\t//\n\t// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n\t// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n\t// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN\n\t// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n\t// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR\n\t// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE\n\t// USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n\tfunction EventEmitter() {\n\t this._events = this._events || {};\n\t this._maxListeners = this._maxListeners || undefined;\n\t}\n\tmodule.exports = EventEmitter;\n\n\t// Backwards-compat with node 0.10.x\n\tEventEmitter.EventEmitter = EventEmitter;\n\n\tEventEmitter.prototype._events = undefined;\n\tEventEmitter.prototype._maxListeners = undefined;\n\n\t// By default EventEmitters will print a warning if more than 10 listeners are\n\t// added to it. This is a useful default which helps finding memory leaks.\n\tEventEmitter.defaultMaxListeners = 10;\n\n\t// Obviously not all Emitters should be limited to 10. This function allows\n\t// that to be increased. Set to zero for unlimited.\n\tEventEmitter.prototype.setMaxListeners = function(n) {\n\t if (!isNumber(n) || n < 0 || isNaN(n))\n\t throw TypeError('n must be a positive number');\n\t this._maxListeners = n;\n\t return this;\n\t};\n\n\tEventEmitter.prototype.emit = function(type) {\n\t var er, handler, len, args, i, listeners;\n\n\t if (!this._events)\n\t this._events = {};\n\n\t // If there is no 'error' event listener then throw.\n\t if (type === 'error') {\n\t if (!this._events.error ||\n\t (isObject(this._events.error) && !this._events.error.length)) {\n\t er = arguments[1];\n\t if (er instanceof Error) {\n\t throw er; // Unhandled 'error' event\n\t }\n\t throw TypeError('Uncaught, unspecified \"error\" event.');\n\t }\n\t }\n\n\t handler = this._events[type];\n\n\t if (isUndefined(handler))\n\t return false;\n\n\t if (isFunction(handler)) {\n\t switch (arguments.length) {\n\t // fast cases\n\t case 1:\n\t handler.call(this);\n\t break;\n\t case 2:\n\t handler.call(this, arguments[1]);\n\t break;\n\t case 3:\n\t handler.call(this, arguments[1], arguments[2]);\n\t break;\n\t // slower\n\t default:\n\t args = Array.prototype.slice.call(arguments, 1);\n\t handler.apply(this, args);\n\t }\n\t } else if (isObject(handler)) {\n\t args = Array.prototype.slice.call(arguments, 1);\n\t listeners = handler.slice();\n\t len = listeners.length;\n\t for (i = 0; i < len; i++)\n\t listeners[i].apply(this, args);\n\t }\n\n\t return true;\n\t};\n\n\tEventEmitter.prototype.addListener = function(type, listener) {\n\t var m;\n\n\t if (!isFunction(listener))\n\t throw TypeError('listener must be a function');\n\n\t if (!this._events)\n\t this._events = {};\n\n\t // To avoid recursion in the case that type === \"newListener\"! Before\n\t // adding it to the listeners, first emit \"newListener\".\n\t if (this._events.newListener)\n\t this.emit('newListener', type,\n\t isFunction(listener.listener) ?\n\t listener.listener : listener);\n\n\t if (!this._events[type])\n\t // Optimize the case of one listener. Don't need the extra array object.\n\t this._events[type] = listener;\n\t else if (isObject(this._events[type]))\n\t // If we've already got an array, just append.\n\t this._events[type].push(listener);\n\t else\n\t // Adding the second element, need to change to array.\n\t this._events[type] = [this._events[type], listener];\n\n\t // Check for listener leak\n\t if (isObject(this._events[type]) && !this._events[type].warned) {\n\t if (!isUndefined(this._maxListeners)) {\n\t m = this._maxListeners;\n\t } else {\n\t m = EventEmitter.defaultMaxListeners;\n\t }\n\n\t if (m && m > 0 && this._events[type].length > m) {\n\t this._events[type].warned = true;\n\t console.error('(node) warning: possible EventEmitter memory ' +\n\t 'leak detected. %d listeners added. ' +\n\t 'Use emitter.setMaxListeners() to increase limit.',\n\t this._events[type].length);\n\t if (typeof console.trace === 'function') {\n\t // not supported in IE 10\n\t console.trace();\n\t }\n\t }\n\t }\n\n\t return this;\n\t};\n\n\tEventEmitter.prototype.on = EventEmitter.prototype.addListener;\n\n\tEventEmitter.prototype.once = function(type, listener) {\n\t if (!isFunction(listener))\n\t throw TypeError('listener must be a function');\n\n\t var fired = false;\n\n\t function g() {\n\t this.removeListener(type, g);\n\n\t if (!fired) {\n\t fired = true;\n\t listener.apply(this, arguments);\n\t }\n\t }\n\n\t g.listener = listener;\n\t this.on(type, g);\n\n\t return this;\n\t};\n\n\t// emits a 'removeListener' event iff the listener was removed\n\tEventEmitter.prototype.removeListener = function(type, listener) {\n\t var list, position, length, i;\n\n\t if (!isFunction(listener))\n\t throw TypeError('listener must be a function');\n\n\t if (!this._events || !this._events[type])\n\t return this;\n\n\t list = this._events[type];\n\t length = list.length;\n\t position = -1;\n\n\t if (list === listener ||\n\t (isFunction(list.listener) && list.listener === listener)) {\n\t delete this._events[type];\n\t if (this._events.removeListener)\n\t this.emit('removeListener', type, listener);\n\n\t } else if (isObject(list)) {\n\t for (i = length; i-- > 0;) {\n\t if (list[i] === listener ||\n\t (list[i].listener && list[i].listener === listener)) {\n\t position = i;\n\t break;\n\t }\n\t }\n\n\t if (position < 0)\n\t return this;\n\n\t if (list.length === 1) {\n\t list.length = 0;\n\t delete this._events[type];\n\t } else {\n\t list.splice(position, 1);\n\t }\n\n\t if (this._events.removeListener)\n\t this.emit('removeListener', type, listener);\n\t }\n\n\t return this;\n\t};\n\n\tEventEmitter.prototype.removeAllListeners = function(type) {\n\t var key, listeners;\n\n\t if (!this._events)\n\t return this;\n\n\t // not listening for removeListener, no need to emit\n\t if (!this._events.removeListener) {\n\t if (arguments.length === 0)\n\t this._events = {};\n\t else if (this._events[type])\n\t delete this._events[type];\n\t return this;\n\t }\n\n\t // emit removeListener for all listeners on all events\n\t if (arguments.length === 0) {\n\t for (key in this._events) {\n\t if (key === 'removeListener') continue;\n\t this.removeAllListeners(key);\n\t }\n\t this.removeAllListeners('removeListener');\n\t this._events = {};\n\t return this;\n\t }\n\n\t listeners = this._events[type];\n\n\t if (isFunction(listeners)) {\n\t this.removeListener(type, listeners);\n\t } else if (listeners) {\n\t // LIFO order\n\t while (listeners.length)\n\t this.removeListener(type, listeners[listeners.length - 1]);\n\t }\n\t delete this._events[type];\n\n\t return this;\n\t};\n\n\tEventEmitter.prototype.listeners = function(type) {\n\t var ret;\n\t if (!this._events || !this._events[type])\n\t ret = [];\n\t else if (isFunction(this._events[type]))\n\t ret = [this._events[type]];\n\t else\n\t ret = this._events[type].slice();\n\t return ret;\n\t};\n\n\tEventEmitter.prototype.listenerCount = function(type) {\n\t if (this._events) {\n\t var evlistener = this._events[type];\n\n\t if (isFunction(evlistener))\n\t return 1;\n\t else if (evlistener)\n\t return evlistener.length;\n\t }\n\t return 0;\n\t};\n\n\tEventEmitter.listenerCount = function(emitter, type) {\n\t return emitter.listenerCount(type);\n\t};\n\n\tfunction isFunction(arg) {\n\t return typeof arg === 'function';\n\t}\n\n\tfunction isNumber(arg) {\n\t return typeof arg === 'number';\n\t}\n\n\tfunction isObject(arg) {\n\t return typeof arg === 'object' && arg !== null;\n\t}\n\n\tfunction isUndefined(arg) {\n\t return arg === void 0;\n\t}\n\n\n/***/ },\n/* 33 */\n/***/ function(module, exports) {\n\n\tvar core = module.exports = {version: '2.3.0'};\n\tif(typeof __e == 'number')__e = core; // eslint-disable-line no-undef\n\n/***/ },\n/* 34 */\n/***/ function(module, exports, __webpack_require__) {\n\n\t// optional / simple context binding\n\tvar aFunction = __webpack_require__(25);\n\tmodule.exports = function(fn, that, length){\n\t aFunction(fn);\n\t if(that === undefined)return fn;\n\t switch(length){\n\t case 1: return function(a){\n\t return fn.call(that, a);\n\t };\n\t case 2: return function(a, b){\n\t return fn.call(that, a, b);\n\t };\n\t case 3: return function(a, b, c){\n\t return fn.call(that, a, b, c);\n\t };\n\t }\n\t return function(/* ...args */){\n\t return fn.apply(that, arguments);\n\t };\n\t};\n\n/***/ },\n/* 35 */\n/***/ function(module, exports, __webpack_require__) {\n\n\tvar Map = __webpack_require__(175)\n\t , $export = __webpack_require__(0)\n\t , shared = __webpack_require__(86)('metadata')\n\t , store = shared.store || (shared.store = new (__webpack_require__(178)));\n\n\tvar getOrCreateMetadataMap = function(target, targetKey, create){\n\t var targetMetadata = store.get(target);\n\t if(!targetMetadata){\n\t if(!create)return undefined;\n\t store.set(target, targetMetadata = new Map);\n\t }\n\t var keyMetadata = targetMetadata.get(targetKey);\n\t if(!keyMetadata){\n\t if(!create)return undefined;\n\t targetMetadata.set(targetKey, keyMetadata = new Map);\n\t } return keyMetadata;\n\t};\n\tvar ordinaryHasOwnMetadata = function(MetadataKey, O, P){\n\t var metadataMap = getOrCreateMetadataMap(O, P, false);\n\t return metadataMap === undefined ? false : metadataMap.has(MetadataKey);\n\t};\n\tvar ordinaryGetOwnMetadata = function(MetadataKey, O, P){\n\t var metadataMap = getOrCreateMetadataMap(O, P, false);\n\t return metadataMap === undefined ? undefined : metadataMap.get(MetadataKey);\n\t};\n\tvar ordinaryDefineOwnMetadata = function(MetadataKey, MetadataValue, O, P){\n\t getOrCreateMetadataMap(O, P, true).set(MetadataKey, MetadataValue);\n\t};\n\tvar ordinaryOwnMetadataKeys = function(target, targetKey){\n\t var metadataMap = getOrCreateMetadataMap(target, targetKey, false)\n\t , keys = [];\n\t if(metadataMap)metadataMap.forEach(function(_, key){ keys.push(key); });\n\t return keys;\n\t};\n\tvar toMetaKey = function(it){\n\t return it === undefined || typeof it == 'symbol' ? it : String(it);\n\t};\n\tvar exp = function(O){\n\t $export($export.S, 'Reflect', O);\n\t};\n\n\tmodule.exports = {\n\t store: store,\n\t map: getOrCreateMetadataMap,\n\t has: ordinaryHasOwnMetadata,\n\t get: ordinaryGetOwnMetadata,\n\t set: ordinaryDefineOwnMetadata,\n\t keys: ordinaryOwnMetadataKeys,\n\t key: toMetaKey,\n\t exp: exp\n\t};\n\n/***/ },\n/* 36 */\n/***/ function(module, exports, __webpack_require__) {\n\n\t'use strict';\n\tif(__webpack_require__(9)){\n\t var LIBRARY = __webpack_require__(42)\n\t , global = __webpack_require__(5)\n\t , fails = __webpack_require__(4)\n\t , $export = __webpack_require__(0)\n\t , $typed = __webpack_require__(87)\n\t , $buffer = __webpack_require__(116)\n\t , ctx = __webpack_require__(34)\n\t , anInstance = __webpack_require__(40)\n\t , propertyDesc = __webpack_require__(38)\n\t , hide = __webpack_require__(19)\n\t , redefineAll = __webpack_require__(54)\n\t , isInteger = __webpack_require__(104)\n\t , toInteger = __webpack_require__(39)\n\t , toLength = __webpack_require__(13)\n\t , toIndex = __webpack_require__(46)\n\t , toPrimitive = __webpack_require__(31)\n\t , has = __webpack_require__(16)\n\t , same = __webpack_require__(172)\n\t , classof = __webpack_require__(53)\n\t , isObject = __webpack_require__(6)\n\t , toObject = __webpack_require__(14)\n\t , isArrayIter = __webpack_require__(102)\n\t , create = __webpack_require__(43)\n\t , getPrototypeOf = __webpack_require__(24)\n\t , gOPN = __webpack_require__(44).f\n\t , isIterable = __webpack_require__(278)\n\t , getIterFn = __webpack_require__(118)\n\t , uid = __webpack_require__(47)\n\t , wks = __webpack_require__(7)\n\t , createArrayMethod = __webpack_require__(29)\n\t , createArrayIncludes = __webpack_require__(76)\n\t , speciesConstructor = __webpack_require__(110)\n\t , ArrayIterators = __webpack_require__(119)\n\t , Iterators = __webpack_require__(41)\n\t , $iterDetect = __webpack_require__(82)\n\t , setSpecies = __webpack_require__(55)\n\t , arrayFill = __webpack_require__(95)\n\t , arrayCopyWithin = __webpack_require__(152)\n\t , $DP = __webpack_require__(10)\n\t , $GOPD = __webpack_require__(23)\n\t , dP = $DP.f\n\t , gOPD = $GOPD.f\n\t , RangeError = global.RangeError\n\t , TypeError = global.TypeError\n\t , Uint8Array = global.Uint8Array\n\t , ARRAY_BUFFER = 'ArrayBuffer'\n\t , SHARED_BUFFER = 'Shared' + ARRAY_BUFFER\n\t , BYTES_PER_ELEMENT = 'BYTES_PER_ELEMENT'\n\t , PROTOTYPE = 'prototype'\n\t , ArrayProto = Array[PROTOTYPE]\n\t , $ArrayBuffer = $buffer.ArrayBuffer\n\t , $DataView = $buffer.DataView\n\t , arrayForEach = createArrayMethod(0)\n\t , arrayFilter = createArrayMethod(2)\n\t , arraySome = createArrayMethod(3)\n\t , arrayEvery = createArrayMethod(4)\n\t , arrayFind = createArrayMethod(5)\n\t , arrayFindIndex = createArrayMethod(6)\n\t , arrayIncludes = createArrayIncludes(true)\n\t , arrayIndexOf = createArrayIncludes(false)\n\t , arrayValues = ArrayIterators.values\n\t , arrayKeys = ArrayIterators.keys\n\t , arrayEntries = ArrayIterators.entries\n\t , arrayLastIndexOf = ArrayProto.lastIndexOf\n\t , arrayReduce = ArrayProto.reduce\n\t , arrayReduceRight = ArrayProto.reduceRight\n\t , arrayJoin = ArrayProto.join\n\t , arraySort = ArrayProto.sort\n\t , arraySlice = ArrayProto.slice\n\t , arrayToString = ArrayProto.toString\n\t , arrayToLocaleString = ArrayProto.toLocaleString\n\t , ITERATOR = wks('iterator')\n\t , TAG = wks('toStringTag')\n\t , TYPED_CONSTRUCTOR = uid('typed_constructor')\n\t , DEF_CONSTRUCTOR = uid('def_constructor')\n\t , ALL_CONSTRUCTORS = $typed.CONSTR\n\t , TYPED_ARRAY = $typed.TYPED\n\t , VIEW = $typed.VIEW\n\t , WRONG_LENGTH = 'Wrong length!';\n\n\t var $map = createArrayMethod(1, function(O, length){\n\t return allocate(speciesConstructor(O, O[DEF_CONSTRUCTOR]), length);\n\t });\n\n\t var LITTLE_ENDIAN = fails(function(){\n\t return new Uint8Array(new Uint16Array([1]).buffer)[0] === 1;\n\t });\n\n\t var FORCED_SET = !!Uint8Array && !!Uint8Array[PROTOTYPE].set && fails(function(){\n\t new Uint8Array(1).set({});\n\t });\n\n\t var strictToLength = function(it, SAME){\n\t if(it === undefined)throw TypeError(WRONG_LENGTH);\n\t var number = +it\n\t , length = toLength(it);\n\t if(SAME && !same(number, length))throw RangeError(WRONG_LENGTH);\n\t return length;\n\t };\n\n\t var toOffset = function(it, BYTES){\n\t var offset = toInteger(it);\n\t if(offset < 0 || offset % BYTES)throw RangeError('Wrong offset!');\n\t return offset;\n\t };\n\n\t var validate = function(it){\n\t if(isObject(it) && TYPED_ARRAY in it)return it;\n\t throw TypeError(it + ' is not a typed array!');\n\t };\n\n\t var allocate = function(C, length){\n\t if(!(isObject(C) && TYPED_CONSTRUCTOR in C)){\n\t throw TypeError('It is not a typed array constructor!');\n\t } return new C(length);\n\t };\n\n\t var speciesFromList = function(O, list){\n\t return fromList(speciesConstructor(O, O[DEF_CONSTRUCTOR]), list);\n\t };\n\n\t var fromList = function(C, list){\n\t var index = 0\n\t , length = list.length\n\t , result = allocate(C, length);\n\t while(length > index)result[index] = list[index++];\n\t return result;\n\t };\n\n\t var addGetter = function(it, key, internal){\n\t dP(it, key, {get: function(){ return this._d[internal]; }});\n\t };\n\n\t var $from = function from(source /*, mapfn, thisArg */){\n\t var O = toObject(source)\n\t , aLen = arguments.length\n\t , mapfn = aLen > 1 ? arguments[1] : undefined\n\t , mapping = mapfn !== undefined\n\t , iterFn = getIterFn(O)\n\t , i, length, values, result, step, iterator;\n\t if(iterFn != undefined && !isArrayIter(iterFn)){\n\t for(iterator = iterFn.call(O), values = [], i = 0; !(step = iterator.next()).done; i++){\n\t values.push(step.value);\n\t } O = values;\n\t }\n\t if(mapping && aLen > 2)mapfn = ctx(mapfn, arguments[2], 2);\n\t for(i = 0, length = toLength(O.length), result = allocate(this, length); length > i; i++){\n\t result[i] = mapping ? mapfn(O[i], i) : O[i];\n\t }\n\t return result;\n\t };\n\n\t var $of = function of(/*...items*/){\n\t var index = 0\n\t , length = arguments.length\n\t , result = allocate(this, length);\n\t while(length > index)result[index] = arguments[index++];\n\t return result;\n\t };\n\n\t // iOS Safari 6.x fails here\n\t var TO_LOCALE_BUG = !!Uint8Array && fails(function(){ arrayToLocaleString.call(new Uint8Array(1)); });\n\n\t var $toLocaleString = function toLocaleString(){\n\t return arrayToLocaleString.apply(TO_LOCALE_BUG ? arraySlice.call(validate(this)) : validate(this), arguments);\n\t };\n\n\t var proto = {\n\t copyWithin: function copyWithin(target, start /*, end */){\n\t return arrayCopyWithin.call(validate(this), target, start, arguments.length > 2 ? arguments[2] : undefined);\n\t },\n\t every: function every(callbackfn /*, thisArg */){\n\t return arrayEvery(validate(this), callbackfn, arguments.length > 1 ? arguments[1] : undefined);\n\t },\n\t fill: function fill(value /*, start, end */){ // eslint-disable-line no-unused-vars\n\t return arrayFill.apply(validate(this), arguments);\n\t },\n\t filter: function filter(callbackfn /*, thisArg */){\n\t return speciesFromList(this, arrayFilter(validate(this), callbackfn,\n\t arguments.length > 1 ? arguments[1] : undefined));\n\t },\n\t find: function find(predicate /*, thisArg */){\n\t return arrayFind(validate(this), predicate, arguments.length > 1 ? arguments[1] : undefined);\n\t },\n\t findIndex: function findIndex(predicate /*, thisArg */){\n\t return arrayFindIndex(validate(this), predicate, arguments.length > 1 ? arguments[1] : undefined);\n\t },\n\t forEach: function forEach(callbackfn /*, thisArg */){\n\t arrayForEach(validate(this), callbackfn, arguments.length > 1 ? arguments[1] : undefined);\n\t },\n\t indexOf: function indexOf(searchElement /*, fromIndex */){\n\t return arrayIndexOf(validate(this), searchElement, arguments.length > 1 ? arguments[1] : undefined);\n\t },\n\t includes: function includes(searchElement /*, fromIndex */){\n\t return arrayIncludes(validate(this), searchElement, arguments.length > 1 ? arguments[1] : undefined);\n\t },\n\t join: function join(separator){ // eslint-disable-line no-unused-vars\n\t return arrayJoin.apply(validate(this), arguments);\n\t },\n\t lastIndexOf: function lastIndexOf(searchElement /*, fromIndex */){ // eslint-disable-line no-unused-vars\n\t return arrayLastIndexOf.apply(validate(this), arguments);\n\t },\n\t map: function map(mapfn /*, thisArg */){\n\t return $map(validate(this), mapfn, arguments.length > 1 ? arguments[1] : undefined);\n\t },\n\t reduce: function reduce(callbackfn /*, initialValue */){ // eslint-disable-line no-unused-vars\n\t return arrayReduce.apply(validate(this), arguments);\n\t },\n\t reduceRight: function reduceRight(callbackfn /*, initialValue */){ // eslint-disable-line no-unused-vars\n\t return arrayReduceRight.apply(validate(this), arguments);\n\t },\n\t reverse: function reverse(){\n\t var that = this\n\t , length = validate(that).length\n\t , middle = Math.floor(length / 2)\n\t , index = 0\n\t , value;\n\t while(index < middle){\n\t value = that[index];\n\t that[index++] = that[--length];\n\t that[length] = value;\n\t } return that;\n\t },\n\t some: function some(callbackfn /*, thisArg */){\n\t return arraySome(validate(this), callbackfn, arguments.length > 1 ? arguments[1] : undefined);\n\t },\n\t sort: function sort(comparefn){\n\t return arraySort.call(validate(this), comparefn);\n\t },\n\t subarray: function subarray(begin, end){\n\t var O = validate(this)\n\t , length = O.length\n\t , $begin = toIndex(begin, length);\n\t return new (speciesConstructor(O, O[DEF_CONSTRUCTOR]))(\n\t O.buffer,\n\t O.byteOffset + $begin * O.BYTES_PER_ELEMENT,\n\t toLength((end === undefined ? length : toIndex(end, length)) - $begin)\n\t );\n\t }\n\t };\n\n\t var $slice = function slice(start, end){\n\t return speciesFromList(this, arraySlice.call(validate(this), start, end));\n\t };\n\n\t var $set = function set(arrayLike /*, offset */){\n\t validate(this);\n\t var offset = toOffset(arguments[1], 1)\n\t , length = this.length\n\t , src = toObject(arrayLike)\n\t , len = toLength(src.length)\n\t , index = 0;\n\t if(len + offset > length)throw RangeError(WRONG_LENGTH);\n\t while(index < len)this[offset + index] = src[index++];\n\t };\n\n\t var $iterators = {\n\t entries: function entries(){\n\t return arrayEntries.call(validate(this));\n\t },\n\t keys: function keys(){\n\t return arrayKeys.call(validate(this));\n\t },\n\t values: function values(){\n\t return arrayValues.call(validate(this));\n\t }\n\t };\n\n\t var isTAIndex = function(target, key){\n\t return isObject(target)\n\t && target[TYPED_ARRAY]\n\t && typeof key != 'symbol'\n\t && key in target\n\t && String(+key) == String(key);\n\t };\n\t var $getDesc = function getOwnPropertyDescriptor(target, key){\n\t return isTAIndex(target, key = toPrimitive(key, true))\n\t ? propertyDesc(2, target[key])\n\t : gOPD(target, key);\n\t };\n\t var $setDesc = function defineProperty(target, key, desc){\n\t if(isTAIndex(target, key = toPrimitive(key, true))\n\t && isObject(desc)\n\t && has(desc, 'value')\n\t && !has(desc, 'get')\n\t && !has(desc, 'set')\n\t // TODO: add validation descriptor w/o calling accessors\n\t && !desc.configurable\n\t && (!has(desc, 'writable') || desc.writable)\n\t && (!has(desc, 'enumerable') || desc.enumerable)\n\t ){\n\t target[key] = desc.value;\n\t return target;\n\t } else return dP(target, key, desc);\n\t };\n\n\t if(!ALL_CONSTRUCTORS){\n\t $GOPD.f = $getDesc;\n\t $DP.f = $setDesc;\n\t }\n\n\t $export($export.S + $export.F * !ALL_CONSTRUCTORS, 'Object', {\n\t getOwnPropertyDescriptor: $getDesc,\n\t defineProperty: $setDesc\n\t });\n\n\t if(fails(function(){ arrayToString.call({}); })){\n\t arrayToString = arrayToLocaleString = function toString(){\n\t return arrayJoin.call(this);\n\t }\n\t }\n\n\t var $TypedArrayPrototype$ = redefineAll({}, proto);\n\t redefineAll($TypedArrayPrototype$, $iterators);\n\t hide($TypedArrayPrototype$, ITERATOR, $iterators.values);\n\t redefineAll($TypedArrayPrototype$, {\n\t slice: $slice,\n\t set: $set,\n\t constructor: function(){ /* noop */ },\n\t toString: arrayToString,\n\t toLocaleString: $toLocaleString\n\t });\n\t addGetter($TypedArrayPrototype$, 'buffer', 'b');\n\t addGetter($TypedArrayPrototype$, 'byteOffset', 'o');\n\t addGetter($TypedArrayPrototype$, 'byteLength', 'l');\n\t addGetter($TypedArrayPrototype$, 'length', 'e');\n\t dP($TypedArrayPrototype$, TAG, {\n\t get: function(){ return this[TYPED_ARRAY]; }\n\t });\n\n\t module.exports = function(KEY, BYTES, wrapper, CLAMPED){\n\t CLAMPED = !!CLAMPED;\n\t var NAME = KEY + (CLAMPED ? 'Clamped' : '') + 'Array'\n\t , ISNT_UINT8 = NAME != 'Uint8Array'\n\t , GETTER = 'get' + KEY\n\t , SETTER = 'set' + KEY\n\t , TypedArray = global[NAME]\n\t , Base = TypedArray || {}\n\t , TAC = TypedArray && getPrototypeOf(TypedArray)\n\t , FORCED = !TypedArray || !$typed.ABV\n\t , O = {}\n\t , TypedArrayPrototype = TypedArray && TypedArray[PROTOTYPE];\n\t var getter = function(that, index){\n\t var data = that._d;\n\t return data.v[GETTER](index * BYTES + data.o, LITTLE_ENDIAN);\n\t };\n\t var setter = function(that, index, value){\n\t var data = that._d;\n\t if(CLAMPED)value = (value = Math.round(value)) < 0 ? 0 : value > 0xff ? 0xff : value & 0xff;\n\t data.v[SETTER](index * BYTES + data.o, value, LITTLE_ENDIAN);\n\t };\n\t var addElement = function(that, index){\n\t dP(that, index, {\n\t get: function(){\n\t return getter(this, index);\n\t },\n\t set: function(value){\n\t return setter(this, index, value);\n\t },\n\t enumerable: true\n\t });\n\t };\n\t if(FORCED){\n\t TypedArray = wrapper(function(that, data, $offset, $length){\n\t anInstance(that, TypedArray, NAME, '_d');\n\t var index = 0\n\t , offset = 0\n\t , buffer, byteLength, length, klass;\n\t if(!isObject(data)){\n\t length = strictToLength(data, true)\n\t byteLength = length * BYTES;\n\t buffer = new $ArrayBuffer(byteLength);\n\t } else if(data instanceof $ArrayBuffer || (klass = classof(data)) == ARRAY_BUFFER || klass == SHARED_BUFFER){\n\t buffer = data;\n\t offset = toOffset($offset, BYTES);\n\t var $len = data.byteLength;\n\t if($length === undefined){\n\t if($len % BYTES)throw RangeError(WRONG_LENGTH);\n\t byteLength = $len - offset;\n\t if(byteLength < 0)throw RangeError(WRONG_LENGTH);\n\t } else {\n\t byteLength = toLength($length) * BYTES;\n\t if(byteLength + offset > $len)throw RangeError(WRONG_LENGTH);\n\t }\n\t length = byteLength / BYTES;\n\t } else if(TYPED_ARRAY in data){\n\t return fromList(TypedArray, data);\n\t } else {\n\t return $from.call(TypedArray, data);\n\t }\n\t hide(that, '_d', {\n\t b: buffer,\n\t o: offset,\n\t l: byteLength,\n\t e: length,\n\t v: new $DataView(buffer)\n\t });\n\t while(index < length)addElement(that, index++);\n\t });\n\t TypedArrayPrototype = TypedArray[PROTOTYPE] = create($TypedArrayPrototype$);\n\t hide(TypedArrayPrototype, 'constructor', TypedArray);\n\t } else if(!$iterDetect(function(iter){\n\t // V8 works with iterators, but fails in many other cases\n\t // https://code.google.com/p/v8/issues/detail?id=4552\n\t new TypedArray(null); // eslint-disable-line no-new\n\t new TypedArray(iter); // eslint-disable-line no-new\n\t }, true)){\n\t TypedArray = wrapper(function(that, data, $offset, $length){\n\t anInstance(that, TypedArray, NAME);\n\t var klass;\n\t // `ws` module bug, temporarily remove validation length for Uint8Array\n\t // https://github.com/websockets/ws/pull/645\n\t if(!isObject(data))return new Base(strictToLength(data, ISNT_UINT8));\n\t if(data instanceof $ArrayBuffer || (klass = classof(data)) == ARRAY_BUFFER || klass == SHARED_BUFFER){\n\t return $length !== undefined\n\t ? new Base(data, toOffset($offset, BYTES), $length)\n\t : $offset !== undefined\n\t ? new Base(data, toOffset($offset, BYTES))\n\t : new Base(data);\n\t }\n\t if(TYPED_ARRAY in data)return fromList(TypedArray, data);\n\t return $from.call(TypedArray, data);\n\t });\n\t arrayForEach(TAC !== Function.prototype ? gOPN(Base).concat(gOPN(TAC)) : gOPN(Base), function(key){\n\t if(!(key in TypedArray))hide(TypedArray, key, Base[key]);\n\t });\n\t TypedArray[PROTOTYPE] = TypedArrayPrototype;\n\t if(!LIBRARY)TypedArrayPrototype.constructor = TypedArray;\n\t }\n\t var $nativeIterator = TypedArrayPrototype[ITERATOR]\n\t , CORRECT_ITER_NAME = !!$nativeIterator && ($nativeIterator.name == 'values' || $nativeIterator.name == undefined)\n\t , $iterator = $iterators.values;\n\t hide(TypedArray, TYPED_CONSTRUCTOR, true);\n\t hide(TypedArrayPrototype, TYPED_ARRAY, NAME);\n\t hide(TypedArrayPrototype, VIEW, true);\n\t hide(TypedArrayPrototype, DEF_CONSTRUCTOR, TypedArray);\n\n\t if(CLAMPED ? new TypedArray(1)[TAG] != NAME : !(TAG in TypedArrayPrototype)){\n\t dP(TypedArrayPrototype, TAG, {\n\t get: function(){ return NAME; }\n\t });\n\t }\n\n\t O[NAME] = TypedArray;\n\n\t $export($export.G + $export.W + $export.F * (TypedArray != Base), O);\n\n\t $export($export.S, NAME, {\n\t BYTES_PER_ELEMENT: BYTES,\n\t from: $from,\n\t of: $of\n\t });\n\n\t if(!(BYTES_PER_ELEMENT in TypedArrayPrototype))hide(TypedArrayPrototype, BYTES_PER_ELEMENT, BYTES);\n\n\t $export($export.P, NAME, proto);\n\n\t setSpecies(NAME);\n\n\t $export($export.P + $export.F * FORCED_SET, NAME, {set: $set});\n\n\t $export($export.P + $export.F * !CORRECT_ITER_NAME, NAME, $iterators);\n\n\t $export($export.P + $export.F * (TypedArrayPrototype.toString != arrayToString), NAME, {toString: arrayToString});\n\n\t $export($export.P + $export.F * fails(function(){\n\t new TypedArray(1).slice();\n\t }), NAME, {slice: $slice});\n\n\t $export($export.P + $export.F * (fails(function(){\n\t return [1, 2].toLocaleString() != new TypedArray([1, 2]).toLocaleString()\n\t }) || !fails(function(){\n\t TypedArrayPrototype.toLocaleString.call([1, 2]);\n\t })), NAME, {toLocaleString: $toLocaleString});\n\n\t Iterators[NAME] = CORRECT_ITER_NAME ? $nativeIterator : $iterator;\n\t if(!LIBRARY && !CORRECT_ITER_NAME)hide(TypedArrayPrototype, ITERATOR, $iterator);\n\t };\n\t} else module.exports = function(){ /* empty */ };\n\n/***/ },\n/* 37 */\n/***/ function(module, exports, __webpack_require__) {\n\n\tvar META = __webpack_require__(47)('meta')\n\t , isObject = __webpack_require__(6)\n\t , has = __webpack_require__(16)\n\t , setDesc = __webpack_require__(10).f\n\t , id = 0;\n\tvar isExtensible = Object.isExtensible || function(){\n\t return true;\n\t};\n\tvar FREEZE = !__webpack_require__(4)(function(){\n\t return isExtensible(Object.preventExtensions({}));\n\t});\n\tvar setMeta = function(it){\n\t setDesc(it, META, {value: {\n\t i: 'O' + ++id, // object ID\n\t w: {} // weak collections IDs\n\t }});\n\t};\n\tvar fastKey = function(it, create){\n\t // return primitive with prefix\n\t if(!isObject(it))return typeof it == 'symbol' ? it : (typeof it == 'string' ? 'S' : 'P') + it;\n\t if(!has(it, META)){\n\t // can't set metadata to uncaught frozen object\n\t if(!isExtensible(it))return 'F';\n\t // not necessary to add metadata\n\t if(!create)return 'E';\n\t // add missing metadata\n\t setMeta(it);\n\t // return object ID\n\t } return it[META].i;\n\t};\n\tvar getWeak = function(it, create){\n\t if(!has(it, META)){\n\t // can't set metadata to uncaught frozen object\n\t if(!isExtensible(it))return true;\n\t // not necessary to add metadata\n\t if(!create)return false;\n\t // add missing metadata\n\t setMeta(it);\n\t // return hash weak collections IDs\n\t } return it[META].w;\n\t};\n\t// add metadata on freeze-family methods calling\n\tvar onFreeze = function(it){\n\t if(FREEZE && meta.NEED && isExtensible(it) && !has(it, META))setMeta(it);\n\t return it;\n\t};\n\tvar meta = module.exports = {\n\t KEY: META,\n\t NEED: false,\n\t fastKey: fastKey,\n\t getWeak: getWeak,\n\t onFreeze: onFreeze\n\t};\n\n/***/ },\n/* 38 */\n/***/ function(module, exports) {\n\n\tmodule.exports = function(bitmap, value){\n\t return {\n\t enumerable : !(bitmap & 1),\n\t configurable: !(bitmap & 2),\n\t writable : !(bitmap & 4),\n\t value : value\n\t };\n\t};\n\n/***/ },\n/* 39 */\n/***/ function(module, exports) {\n\n\t// 7.1.4 ToInteger\n\tvar ceil = Math.ceil\n\t , floor = Math.floor;\n\tmodule.exports = function(it){\n\t return isNaN(it = +it) ? 0 : (it > 0 ? floor : ceil)(it);\n\t};\n\n/***/ },\n/* 40 */\n/***/ function(module, exports) {\n\n\tmodule.exports = function(it, Constructor, name, forbiddenField){\n\t if(!(it instanceof Constructor) || (forbiddenField !== undefined && forbiddenField in it)){\n\t throw TypeError(name + ': incorrect invocation!');\n\t } return it;\n\t};\n\n/***/ },\n/* 41 */\n/***/ function(module, exports) {\n\n\tmodule.exports = {};\n\n/***/ },\n/* 42 */\n/***/ function(module, exports) {\n\n\tmodule.exports = false;\n\n/***/ },\n/* 43 */\n/***/ function(module, exports, __webpack_require__) {\n\n\t// 19.1.2.2 / 15.2.3.5 Object.create(O [, Properties])\r\n\tvar anObject = __webpack_require__(3)\r\n\t , dPs = __webpack_require__(165)\r\n\t , enumBugKeys = __webpack_require__(98)\r\n\t , IE_PROTO = __webpack_require__(109)('IE_PROTO')\r\n\t , Empty = function(){ /* empty */ }\r\n\t , PROTOTYPE = 'prototype';\r\n\r\n\t// Create object with fake `null` prototype: use iframe Object with cleared prototype\r\n\tvar createDict = function(){\r\n\t // Thrash, waste and sodomy: IE GC bug\r\n\t var iframe = __webpack_require__(97)('iframe')\r\n\t , i = enumBugKeys.length\r\n\t , gt = '>'\r\n\t , iframeDocument;\r\n\t iframe.style.display = 'none';\r\n\t __webpack_require__(100).appendChild(iframe);\r\n\t iframe.src = 'javascript:'; // eslint-disable-line no-script-url\r\n\t // createDict = iframe.contentWindow.Object;\r\n\t // html.removeChild(iframe);\r\n\t iframeDocument = iframe.contentWindow.document;\r\n\t iframeDocument.open();\r\n\t iframeDocument.write('\n \n \n\n\n\n
\n

IPFS + Ethereum Storage Application

\n\n
\n
\n\n

Start by opening the developer console to interact with the application. Verify that the console shows we are connect to our IPFS and geth clients. The following steps will guide you through setting up and operating our data storage solution using IPFS and Ethereum.

\n\n
    \n
  1. deployStorage(): Deploy the storage contract to your Ethereum blockchain. The geth client will show it received the deployment transaction, return a transaction hash to the console, and print out the contract transaction address after successful deployment.
    2. \n
    \n
  2. storeContent(URL): Store the specified URL content to IPFS. The IPFS client will receive the URL content for storage and return an IPFS address that will be provided to the smart contract.
    3. \n
    \n
  3. storeAddress(IPFS address): Submit a transaction to the Ethereum contract for storage on our blockchain.
    4. \n
    \n
  4. fetchContent(): Gets the last stored IPFS address in the Ethereum contract and queries IPFS for the associated URL.
    5. \n
\n\n
\n
\n
\n\n

Here is a concrete example. Let's say we want to upload an image of the Ethereum Homestead wallpaper. For example purposes, my IPFS hash address for this wallpaper resolves to \"QmPJLNMiAp3QoCKdGAgzshNRbQiZ8wQmyjYkcUHJZzQ19u\". Then we have all the pieces to run the storage application.

\n\n

Run the commands:

\n
    \n
  1. deployStorage()
    2. \n
  2. storeContent(\"https://ethereum.org/images/wallpaper-homestead.jpg\")
    3. \n
  3. storeAddress(\"QmPJLNMiAp3QoCKdGAgzshNRbQiZ8wQmyjYkcUHJZzQ19u\")
    4. \n
  4. fetchContent()
    5. \n
\n\n

This process will then return: \"http://localhost:8080/ipfs/QmPJLNMiAp3QoCKdGAgzshNRbQiZ8wQmyjYkcUHJZzQ19u\"

\n\n
\n
\n
\n\n

Troubleshooting: To verify there is a positive ether balance, run getBalance() to check the Ethereum wallet balance.

\n\n
\n
\n\n" } ]