text: (function(f){if(typeof exports==="object"&&typeof module!=="undefined"){module.exports=f()}else if(typeof define==="function"&&define.amd){define([],f)}else{var g;if(typeof window!=="undefined"){g=window}else if(typeof global!=="undefined"){g=global}else if(typeof self!=="undefined"){g=self}else{g=this}g.ethers = f()}})(function(){var define,module,exports;return (function(){function r(e,n,t){function o(i,f){if(!n[i]){if(!e[i]){var c="function"==typeof require&&require;if(!f&&c)return c(i,!0);if(u)return u(i,!0);var a=new Error("Cannot find module '"+i+"'");throw a.code="MODULE_NOT_FOUND",a}var p=n[i]={exports:{}};e[i][0].call(p.exports,function(r){var n=e[i][1][r];return o(n||r)},p,p.exports,r,e,n,t)}return n[i].exports}for(var u="function"==typeof require&&require,i=0;i<t.length;i++)o(t[i]);return o}return r})()({1:[function(require,module,exports){
  "use strict";
  Object.defineProperty(exports, "__esModule", { value: true });
  exports.version = "4.0.0-beta.3";
  
  },{}],2:[function(require,module,exports){
  'use strict';
  var __importStar = (this && this.__importStar) || function (mod) {
      if (mod && mod.__esModule) return mod;
      var result = {};
      if (mod != null) for (var k in mod) if (Object.hasOwnProperty.call(mod, k)) result[k] = mod[k];
      result["default"] = mod;
      return result;
  };
  Object.defineProperty(exports, "__esModule", { value: true });
  var interface_1 = require("./interface");
  var abi_coder_1 = require("../utils/abi-coder");
  var address_1 = require("../utils/address");
  var bignumber_1 = require("../utils/bignumber");
  var bytes_1 = require("../utils/bytes");
  var properties_1 = require("../utils/properties");
  var web_1 = require("../utils/web");
  var types_1 = require("../utils/types");
  var errors = __importStar(require("../utils/errors"));
  var allowedTransactionKeys = {
      data: true, from: true, gasLimit: true, gasPrice: true, nonce: true, to: true, value: true
  };
  // Recursively replaces ENS names with promises to resolve the name and
  // stalls until all promises have returned
  // @TODO: Expand this to resolve any promises too
  function resolveAddresses(provider, value, paramType) {
      if (Array.isArray(paramType)) {
          var promises = [];
          paramType.forEach(function (paramType, index) {
              var v = null;
              if (Array.isArray(value)) {
                  v = value[index];
              }
              else {
                  v = value[paramType.name];
              }
              promises.push(resolveAddresses(provider, v, paramType));
          });
          return Promise.all(promises);
      }
      if (paramType.type === 'address') {
          return provider.resolveName(value);
      }
      if (paramType.components) {
          return resolveAddresses(provider, value, paramType.components);
      }
      return Promise.resolve(value);
  }
  function runMethod(contract, functionName, estimateOnly) {
      var method = contract.interface.functions[functionName];
      return function () {
          var params = [];
          for (var _i = 0; _i < arguments.length; _i++) {
              params[_i] = arguments[_i];
          }
          var tx = {};
          // If 1 extra parameter was passed in, it contains overrides
          if (params.length === method.inputs.length + 1 && typeof (params[params.length - 1]) === 'object') {
              tx = properties_1.shallowCopy(params.pop());
              // Check for unexpected keys (e.g. using "gas" instead of "gasLimit")
              for (var key in tx) {
                  if (!allowedTransactionKeys[key]) {
                      throw new Error('unknown transaction override ' + key);
                  }
              }
          }
          if (params.length != method.inputs.length) {
              throw new Error('incorrect number of arguments');
          }
          // Check overrides make sense
          ['data', 'to'].forEach(function (key) {
              if (tx[key] != null) {
                  errors.throwError('cannot override ' + key, errors.UNSUPPORTED_OPERATION, { operation: key });
              }
          });
          // Send to the contract address
          tx.to = contract.addressPromise;
          return resolveAddresses(contract.provider, params, method.inputs).then(function (params) {
              tx.data = method.encode(params);
              if (method.type === 'call') {
                  // Call (constant functions) always cost 0 ether
                  if (estimateOnly) {
                      return Promise.resolve(bignumber_1.ConstantZero);
                  }
                  if (!contract.provider) {
                      errors.throwError('call (constant functions) require a provider or a signer with a provider', errors.UNSUPPORTED_OPERATION, { operation: 'call' });
                  }
                  // Check overrides make sense
                  ['gasLimit', 'gasPrice', 'value'].forEach(function (key) {
                      if (tx[key] != null) {
                          throw new Error('call cannot override ' + key);
                      }
                  });
                  if (tx.from == null && contract.signer) {
                      tx.from = contract.signer.getAddress();
                  }
                  return contract.provider.call(tx).then(function (value) {
                      if ((bytes_1.hexDataLength(value) % 32) === 4 && bytes_1.hexDataSlice(value, 0, 4) === '0x08c379a0') {
                          var reason = abi_coder_1.defaultAbiCoder.decode(['string'], bytes_1.hexDataSlice(value, 4));
                          errors.throwError('call revert exception', errors.CALL_EXCEPTION, {
                              address: contract.address,
                              args: params,
                              method: method.signature,
                              errorSignature: 'Error(string)',
                              errorArgs: [reason],
                              reason: reason,
                              transaction: tx
                          });
                      }
                      try {
                          var result = method.decode(value);
                          if (method.outputs.length === 1) {
                              result = result[0];
                          }
                          return result;
                      }
                      catch (error) {
                          if (value === '0x' && method.outputs.length > 0) {
                              errors.throwError('call exception', errors.CALL_EXCEPTION, {
                                  address: contract.address,
                                  method: method.signature,
                                  args: params
                              });
                          }
                          throw error;
                      }
                  });
              }
              else if (method.type === 'transaction') {
                  // Only computing the transaction estimate
                  if (estimateOnly) {
                      if (!contract.provider) {
                          errors.throwError('estimate gas require a provider or a signer with a provider', errors.UNSUPPORTED_OPERATION, { operation: 'estimateGas' });
                      }
                      if (tx.from == null && contract.signer) {
                          tx.from = contract.signer.getAddress();
                      }
                      return contract.provider.estimateGas(tx);
                  }
                  if (!contract.signer) {
                      errors.throwError('sending a transaction require a signer', errors.UNSUPPORTED_OPERATION, { operation: 'sendTransaction' });
                  }
                  // Make sure they aren't overriding something they shouldn't
                  if (tx.from != null) {
                      errors.throwError('cannot override from in a transaction', errors.UNSUPPORTED_OPERATION, { operation: 'sendTransaction' });
                  }
                  return contract.signer.sendTransaction(tx);
              }
              throw new Error('invalid type - ' + method.type);
              return null;
          });
      };
  }
  function getEventTag(filter) {
      return (filter.address || '') + (filter.topics ? filter.topics.join(':') : '');
  }
  var Contract = /** @class */ (function () {
      // https://github.com/Microsoft/TypeScript/issues/5453
      // Once this issue is resolved (there are open PR) we can do this nicer
      // by making addressOrName default to null for 2 operand calls. :)
      function Contract(addressOrName, contractInterface, signerOrProvider) {
          var _this = this;
          errors.checkNew(this, Contract);
          // @TODO: Maybe still check the addressOrName looks like a valid address or name?
          //address = getAddress(address);
          if (contractInterface instanceof interface_1.Interface) {
              properties_1.defineReadOnly(this, 'interface', contractInterface);
          }
          else {
              properties_1.defineReadOnly(this, 'interface', new interface_1.Interface(contractInterface));
          }
          if (signerOrProvider instanceof types_1.Signer) {
              properties_1.defineReadOnly(this, 'provider', signerOrProvider.provider);
              properties_1.defineReadOnly(this, 'signer', signerOrProvider);
          }
          else if (signerOrProvider instanceof types_1.MinimalProvider) {
              properties_1.defineReadOnly(this, 'provider', signerOrProvider);
              properties_1.defineReadOnly(this, 'signer', null);
          }
          else {
              errors.throwError('invalid signer or provider', errors.INVALID_ARGUMENT, { arg: 'signerOrProvider', value: signerOrProvider });
          }
          properties_1.defineReadOnly(this, 'estimate', {});
          properties_1.defineReadOnly(this, 'functions', {});
          properties_1.defineReadOnly(this, 'filters', {});
          Object.keys(this.interface.events).forEach(function (eventName) {
              var event = _this.interface.events[eventName];
              properties_1.defineReadOnly(_this.filters, eventName, function () {
                  var args = [];
                  for (var _i = 0; _i < arguments.length; _i++) {
                      args[_i] = arguments[_i];
                  }
                  return {
                      address: _this.address,
                      topics: event.encodeTopics(args)
                  };
              });
          });
          // Not connected to an on-chain instance, so do not connect functions and events
          if (!addressOrName) {
              properties_1.defineReadOnly(this, 'address', null);
              properties_1.defineReadOnly(this, 'addressPromise', Promise.resolve(null));
              return;
          }
          this._events = [];
          properties_1.defineReadOnly(this, 'address', addressOrName);
          if (this.provider) {
              properties_1.defineReadOnly(this, 'addressPromise', this.provider.resolveName(addressOrName).then(function (address) {
                  if (address == null) {
                      throw new Error('name not found');
                  }
                  return address;
              }).catch(function (error) {
                  console.log('ERROR: Cannot find Contract - ' + addressOrName);
                  throw error;
              }));
          }
          else {
              try {
                  properties_1.defineReadOnly(this, 'addressPromise', Promise.resolve(address_1.getAddress(addressOrName)));
              }
              catch (error) {
                  errors.throwError('provider is required to use non-address contract address', errors.INVALID_ARGUMENT, { argument: 'addressOrName', value: addressOrName });
              }
          }
          Object.keys(this.interface.functions).forEach(function (name) {
              var run = runMethod(_this, name, false);
              if (_this[name] == null) {
                  properties_1.defineReadOnly(_this, name, run);
              }
              else {
                  console.log('WARNING: Multiple definitions for ' + name);
              }
              if (_this.functions[name] == null) {
                  properties_1.defineReadOnly(_this.functions, name, run);
                  properties_1.defineReadOnly(_this.estimate, name, runMethod(_this, name, true));
              }
          });
      }
      // @TODO: Allow timeout?
      Contract.prototype.deployed = function () {
          var _this = this;
          // If we were just deployed, we know the transaction we should occur in
          if (this.deployTransaction) {
              return this.deployTransaction.wait().then(function () {
                  return _this;
              });
          }
          // Otherwise, poll for our code to be deployed
          return web_1.poll(function () {
              return _this.provider.getCode(_this.address).then(function (code) {
                  if (code === '0x') {
                      return undefined;
                  }
                  return _this;
              });
          }, { onceBlock: this.provider });
      };
      // @TODO:
      // estimateFallback(overrides?: TransactionRequest): Promise<BigNumber>
      // @TODO:
      // estimateDeploy(bytecode: string, ...args): Promise<BigNumber>
      Contract.prototype.fallback = function (overrides) {
          if (!this.signer) {
              errors.throwError('sending a transaction require a signer', errors.UNSUPPORTED_OPERATION, { operation: 'sendTransaction(fallback)' });
          }
          var tx = properties_1.shallowCopy(overrides || {});
          ['from', 'to'].forEach(function (key) {
              if (tx[key] == null) {
                  return;
              }
              errors.throwError('cannot override ' + key, errors.UNSUPPORTED_OPERATION, { operation: key });
          });
          tx.to = this.addressPromise;
          return this.signer.sendTransaction(tx);
      };
      // Reconnect to a different signer or provider
      Contract.prototype.connect = function (signerOrProvider) {
          return new Contract(this.address, this.interface, signerOrProvider);
      };
      // Re-attach to a different on=chain instance of this contract
      Contract.prototype.attach = function (addressOrName) {
          return new Contract(addressOrName, this.interface, this.signer || this.provider);
      };
      // Deploy the contract with the bytecode, resolving to the deployed address.
      // Use contract.deployTransaction.wait() to wait until the contract has
      // been mined.
      Contract.prototype.deploy = function (bytecode) {
          var _this = this;
          var args = [];
          for (var _i = 1; _i < arguments.length; _i++) {
              args[_i - 1] = arguments[_i];
          }
          if (this.signer == null) {
              throw new Error('missing signer'); // @TODO: errors.throwError
          }
          // A lot of common tools do not prefix bytecode with a 0x
          if (typeof (bytecode) === 'string' && bytecode.match(/^[0-9a-f]*$/i) && (bytecode.length % 2) == 0) {
              bytecode = '0x' + bytecode;
          }
          if (!bytes_1.isHexString(bytecode)) {
              errors.throwError('bytecode must be a valid hex string', errors.INVALID_ARGUMENT, { arg: 'bytecode', value: bytecode });
          }
          if ((bytecode.length % 2) !== 0) {
              errors.throwError('bytecode must be valid data (even length)', errors.INVALID_ARGUMENT, { arg: 'bytecode', value: bytecode });
          }
          var tx = {};
          if (args.length === this.interface.deployFunction.inputs.length + 1) {
              tx = properties_1.shallowCopy(args.pop());
              for (var key in tx) {
                  if (!allowedTransactionKeys[key]) {
                      throw new Error('unknown transaction override ' + key);
                  }
              }
          }
          ['data', 'from', 'to'].forEach(function (key) {
              if (tx[key] == null) {
                  return;
              }
              errors.throwError('cannot override ' + key, errors.UNSUPPORTED_OPERATION, { operation: key });
          });
          tx.data = this.interface.deployFunction.encode(bytecode, args);
          errors.checkArgumentCount(args.length, this.interface.deployFunction.inputs.length, 'in Contract constructor');
          // @TODO: overrides of args.length = this.interface.deployFunction.inputs.length + 1
          return this.signer.sendTransaction(tx).then(function (tx) {
              var contract = new Contract(address_1.getContractAddress(tx), _this.interface, _this.signer || _this.provider);
              properties_1.defineReadOnly(contract, 'deployTransaction', tx);
              return contract;
          });
      };
      Contract.prototype._getEventFilter = function (eventName) {
          var _this = this;
          if (typeof (eventName) === 'string') {
              // Listen for any event
              if (eventName === '*') {
                  return {
                      decode: function (log) {
                          return [_this.interface.parseLog(log)];
                      },
                      eventTag: '*',
                      filter: { address: this.address },
                  };
              }
              // Normalize the eventName
              if (eventName.indexOf('(') !== -1) {
                  eventName = abi_coder_1.formatSignature(abi_coder_1.parseSignature('event ' + eventName));
              }
              var event_1 = this.interface.events[eventName];
              if (!event_1) {
                  errors.throwError('unknown event - ' + eventName, errors.INVALID_ARGUMENT, { argumnet: 'eventName', value: eventName });
              }
              var filter_1 = {
                  address: this.address,
                  topics: [event_1.topic]
              };
              return {
                  decode: function (log) {
                      return event_1.decode(log.data, log.topics);
                  },
                  event: event_1,
                  eventTag: getEventTag(filter_1),
                  filter: filter_1
              };
          }
          var filter = {
              address: this.address
          };
          // Find the matching event in the ABI; if none, we still allow filtering
          // since it may be a filter for an otherwise unknown event
          var event = null;
          if (eventName.topics && eventName.topics[0]) {
              filter.topics = eventName.topics;
              for (var name in this.interface.events) {
                  if (name.indexOf('(') === -1) {
                      continue;
                  }
                  var e = this.interface.events[name];
                  if (e.topic === eventName.topics[0].toLowerCase()) {
                      event = e;
                      break;
                  }
              }
          }
          return {
              decode: function (log) {
                  if (event) {
                      return event.decode(log.data, log.topics);
                  }
                  return [log];
              },
              event: event,
              eventTag: getEventTag(filter),
              filter: filter
          };
      };
      Contract.prototype._addEventListener = function (eventFilter, listener, once) {
          var _this = this;
          if (!this.provider) {
              errors.throwError('events require a provider or a signer with a provider', errors.UNSUPPORTED_OPERATION, { operation: 'once' });
          }
          var wrappedListener = function (log) {
              var decoded = Array.prototype.slice.call(eventFilter.decode(log));
              var event = properties_1.jsonCopy(log);
              event.args = decoded;
              event.decode = eventFilter.event.decode;
              event.event = eventFilter.event.name;
              event.eventSignature = eventFilter.event.signature;
              event.removeListener = function () { _this.removeListener(eventFilter.filter, listener); };
              event.getBlock = function () { return _this.provider.getBlock(log.blockHash); };
              event.getTransaction = function () { return _this.provider.getTransactionReceipt(log.transactionHash); };
              event.getTransactionReceipt = function () { return _this.provider.getTransactionReceipt(log.transactionHash); };
              decoded.push(event);
              _this.emit.apply(_this, [eventFilter.filter].concat(decoded));
          };
          this.provider.on(eventFilter.filter, wrappedListener);
          this._events.push({ eventFilter: eventFilter, listener: listener, wrappedListener: wrappedListener, once: once });
      };
      Contract.prototype.on = function (event, listener) {
          this._addEventListener(this._getEventFilter(event), listener, false);
          return this;
      };
      Contract.prototype.once = function (event, listener) {
          this._addEventListener(this._getEventFilter(event), listener, true);
          return this;
      };
      Contract.prototype.addEventLisener = function (eventName, listener) {
          return this.on(eventName, listener);
      };
      Contract.prototype.emit = function (eventName) {
          var _this = this;
          var args = [];
          for (var _i = 1; _i < arguments.length; _i++) {
              args[_i - 1] = arguments[_i];
          }
          if (!this.provider) {
              return false;
          }
          var result = false;
          var eventFilter = this._getEventFilter(eventName);
          this._events = this._events.filter(function (event) {
              if (event.eventFilter.eventTag !== eventFilter.eventTag) {
                  return true;
              }
              setTimeout(function () {
                  event.listener.apply(_this, args);
              }, 0);
              result = true;
              return !(event.once);
          });
          return result;
      };
      Contract.prototype.listenerCount = function (eventName) {
          if (!this.provider) {
              return 0;
          }
          var eventFilter = this._getEventFilter(eventName);
          return this._events.filter(function (event) {
              return event.eventFilter.eventTag === eventFilter.eventTag;
          }).length;
      };
      Contract.prototype.listeners = function (eventName) {
          if (!this.provider) {
              return [];
          }
          var eventFilter = this._getEventFilter(eventName);
          return this._events.filter(function (event) {
              return event.eventFilter.eventTag === eventFilter.eventTag;
          }).map(function (event) { return event.listener; });
      };
      Contract.prototype.removeAllListeners = function (eventName) {
          if (!this.provider) {
              return this;
          }
          var eventFilter = this._getEventFilter(eventName);
          this._events = this._events.filter(function (event) {
              return event.eventFilter.eventTag !== eventFilter.eventTag;
          });
          return this;
      };
      Contract.prototype.removeListener = function (eventName, listener) {
          var _this = this;
          if (!this.provider) {
              return this;
          }
          var found = false;
          var eventFilter = this._getEventFilter(eventName);
          this._events = this._events.filter(function (event) {
              // Make sure this event and listener match
              if (event.eventFilter.eventTag !== eventFilter.eventTag) {
                  return true;
              }
              if (event.listener !== listener) {
                  return true;
              }
              _this.provider.removeListener(event.eventFilter.filter, event.wrappedListener);
              // Already found a matching event in a previous loop
              if (found) {
                  return true;
              }
              // REmove this event (returning false filters us out)
              found = true;
              return false;
          });
          return this;
      };
      return Contract;
  }());
  exports.Contract = Contract;
  
  },{"../utils/abi-coder":56,"../utils/address":57,"../utils/bignumber":59,"../utils/bytes":60,"../utils/errors":61,"../utils/properties":69,"../utils/types":77,"../utils/web":80,"./interface":4}],3:[function(require,module,exports){
  'use strict';
  Object.defineProperty(exports, "__esModule", { value: true });
  var contract_1 = require("./contract");
  exports.Contract = contract_1.Contract;
  var interface_1 = require("./interface");
  exports.Interface = interface_1.Interface;
  
  },{"./contract":2,"./interface":4}],4:[function(require,module,exports){
  'use strict';
  var __extends = (this && this.__extends) || (function () {
      var extendStatics = Object.setPrototypeOf ||
          ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||
          function (d, b) { for (var p in b) if (b.hasOwnProperty(p)) d[p] = b[p]; };
      return function (d, b) {
          extendStatics(d, b);
          function __() { this.constructor = d; }
          d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());
      };
  })();
  var __importStar = (this && this.__importStar) || function (mod) {
      if (mod && mod.__esModule) return mod;
      var result = {};
      if (mod != null) for (var k in mod) if (Object.hasOwnProperty.call(mod, k)) result[k] = mod[k];
      result["default"] = mod;
      return result;
  };
  Object.defineProperty(exports, "__esModule", { value: true });
  // See: https://github.com/ethereum/wiki/wiki/Ethereum-Contract-ABI
  var address_1 = require("../utils/address");
  var abi_coder_1 = require("../utils/abi-coder");
  var bignumber_1 = require("../utils/bignumber");
  var bytes_1 = require("../utils/bytes");
  var hash_1 = require("../utils/hash");
  var keccak256_1 = require("../utils/keccak256");
  var properties_1 = require("../utils/properties");
  var types_1 = require("../utils/types");
  var errors = __importStar(require("../utils/errors"));
  var Indexed = /** @class */ (function (_super) {
      __extends(Indexed, _super);
      function Indexed(hash) {
          var _this = _super.call(this) || this;
          properties_1.defineReadOnly(_this, 'hash', hash);
          return _this;
      }
      return Indexed;
  }(types_1.Indexed));
  var Description = /** @class */ (function () {
      function Description(info) {
          for (var key in info) {
              var value = info[key];
              if (value != null && typeof (value) === 'object') {
                  properties_1.defineFrozen(this, key, info[key]);
              }
              else {
                  properties_1.defineReadOnly(this, key, info[key]);
              }
          }
      }
      return Description;
  }());
  var DeployDescription = /** @class */ (function (_super) {
      __extends(DeployDescription, _super);
      function DeployDescription() {
          return _super !== null && _super.apply(this, arguments) || this;
      }
      DeployDescription.prototype.encode = function (bytecode, params) {
          if (!bytes_1.isHexString(bytecode)) {
              errors.throwError('invalid contract bytecode', errors.INVALID_ARGUMENT, {
                  arg: 'bytecode',
                  value: bytecode
              });
          }
          errors.checkArgumentCount(params.length, this.inputs.length, 'in Interface constructor');
          try {
              return (bytecode + abi_coder_1.defaultAbiCoder.encode(this.inputs, params).substring(2));
          }
          catch (error) {
              errors.throwError('invalid constructor argument', errors.INVALID_ARGUMENT, {
                  arg: error.arg,
                  reason: error.reason,
                  value: error.value
              });
          }
          return null;
      };
      return DeployDescription;
  }(Description));
  var FunctionDescription = /** @class */ (function (_super) {
      __extends(FunctionDescription, _super);
      function FunctionDescription() {
          return _super !== null && _super.apply(this, arguments) || this;
      }
      FunctionDescription.prototype.encode = function (params) {
          errors.checkArgumentCount(params.length, this.inputs.length, 'in interface function ' + this.name);
          try {
              return this.sighash + abi_coder_1.defaultAbiCoder.encode(this.inputs, params).substring(2);
          }
          catch (error) {
              errors.throwError('invalid input argument', errors.INVALID_ARGUMENT, {
                  arg: error.arg,
                  reason: error.reason,
                  value: error.value
              });
          }
          return null;
      };
      FunctionDescription.prototype.decode = function (data) {
          try {
              return abi_coder_1.defaultAbiCoder.decode(this.outputs, bytes_1.arrayify(data));
          }
          catch (error) {
              errors.throwError('invalid data for function output', errors.INVALID_ARGUMENT, {
                  arg: 'data',
                  errorArg: error.arg,
                  errorValue: error.value,
                  value: data,
                  reason: error.reason
              });
          }
      };
      return FunctionDescription;
  }(Description));
  var Result = /** @class */ (function (_super) {
      __extends(Result, _super);
      function Result() {
          return _super !== null && _super.apply(this, arguments) || this;
      }
      return Result;
  }(Description));
  var EventDescription = /** @class */ (function (_super) {
      __extends(EventDescription, _super);
      function EventDescription() {
          return _super !== null && _super.apply(this, arguments) || this;
      }
      EventDescription.prototype.encodeTopics = function (params) {
          var _this = this;
          if (params.length > this.inputs.length) {
              errors.throwError('too many arguments for ' + this.name, errors.UNEXPECTED_ARGUMENT, { maxCount: params.length, expectedCount: this.inputs.length });
          }
          var topics = [];
          if (!this.anonymous) {
              topics.push(this.topic);
          }
          params.forEach(function (arg, index) {
              if (arg === null) {
                  topics.push(null);
                  return;
              }
              var param = _this.inputs[index];
              if (!param.indexed) {
                  errors.throwError('cannot filter non-indexed parameters; must be null', errors.INVALID_ARGUMENT, { argument: (param.name || index), value: arg });
              }
              if (param.type === 'string') {
                  topics.push(hash_1.id(arg));
              }
              else if (param.type === 'bytes') {
                  topics.push(keccak256_1.keccak256(arg));
              }
              else if (param.type.indexOf('[') !== -1 || param.type.substring(0, 5) === 'tuple') {
                  errors.throwError('filtering with tuples or arrays not implemented yet; bug us on GitHub', errors.NOT_IMPLEMENTED, { operation: 'filter(array|tuple)' });
              }
              else {
                  if (param.type === 'address') {
                      address_1.getAddress(arg);
                  }
                  topics.push(bytes_1.hexZeroPad(bytes_1.hexlify(arg), 32).toLowerCase());
              }
          });
          // Trim off trailing nulls
          while (topics.length && topics[topics.length - 1] === null) {
              topics.pop();
          }
          return topics;
      };
      EventDescription.prototype.decode = function (data, topics) {
          // Strip the signature off of non-anonymous topics
          if (topics != null && !this.anonymous) {
              topics = topics.slice(1);
          }
          var inputIndexed = [];
          var inputNonIndexed = [];
          var inputDynamic = [];
          this.inputs.forEach(function (param, index) {
              if (param.indexed) {
                  if (param.type === 'string' || param.type === 'bytes' || param.type.indexOf('[') >= 0 || param.type.substring(0, 5) === 'tuple') {
                      inputIndexed.push({ type: 'bytes32', name: (param.name || '') });
                      inputDynamic.push(true);
                  }
                  else {
                      inputIndexed.push(param);
                      inputDynamic.push(false);
                  }
              }
              else {
                  inputNonIndexed.push(param);
                  inputDynamic.push(false);
              }
          });
          if (topics != null) {
              var resultIndexed = abi_coder_1.defaultAbiCoder.decode(inputIndexed, bytes_1.concat(topics));
          }
          var resultNonIndexed = abi_coder_1.defaultAbiCoder.decode(inputNonIndexed, bytes_1.arrayify(data));
          var result = new Result({});
          var nonIndexedIndex = 0, indexedIndex = 0;
          this.inputs.forEach(function (input, index) {
              if (input.indexed) {
                  if (topics == null) {
                      result[index] = new Indexed(null);
                  }
                  else if (inputDynamic[index]) {
                      result[index] = new Indexed(resultIndexed[indexedIndex++]);
                  }
                  else {
                      result[index] = resultIndexed[indexedIndex++];
                  }
              }
              else {
                  result[index] = resultNonIndexed[nonIndexedIndex++];
              }
              if (input.name) {
                  result[input.name] = result[index];
              }
          });
          result.length = this.inputs.length;
          return result;
      };
      return EventDescription;
  }(Description));
  var TransactionDescription = /** @class */ (function (_super) {
      __extends(TransactionDescription, _super);
      function TransactionDescription() {
          return _super !== null && _super.apply(this, arguments) || this;
      }
      return TransactionDescription;
  }(Description));
  var LogDescription = /** @class */ (function (_super) {
      __extends(LogDescription, _super);
      function LogDescription() {
          return _super !== null && _super.apply(this, arguments) || this;
      }
      return LogDescription;
  }(Description));
  function addMethod(method) {
      switch (method.type) {
          case 'constructor': {
              var description = new DeployDescription({
                  inputs: method.inputs,
                  payable: (method.payable == null || !!method.payable)
              });
              if (!this.deployFunction) {
                  this.deployFunction = description;
              }
              break;
          }
          case 'function': {
              var signature = abi_coder_1.formatSignature(method).replace(/tuple/g, '');
              var sighash = hash_1.id(signature).substring(0, 10);
              var description = new FunctionDescription({
                  inputs: method.inputs,
                  outputs: method.outputs,
                  payable: (method.payable == null || !!method.payable),
                  type: ((method.constant) ? 'call' : 'transaction'),
                  signature: signature,
                  sighash: sighash,
              });
              // Expose the first (and hopefully unique named function
              if (method.name && this.functions[method.name] == null) {
                  properties_1.defineReadOnly(this.functions, method.name, description);
              }
              // Expose all methods by their signature, for overloaded functions
              if (this.functions[description.signature] == null) {
                  properties_1.defineReadOnly(this.functions, description.signature, description);
              }
              break;
          }
          case 'event': {
              var signature = abi_coder_1.formatSignature(method).replace(/tuple/g, '');
              var description = new EventDescription({
                  name: method.name,
                  signature: signature,
                  inputs: method.inputs,
                  topic: hash_1.id(signature),
                  anonymous: (!!method.anonymous)
              });
              // Expose the first (and hopefully unique) event name
              if (method.name && this.events[method.name] == null) {
                  properties_1.defineReadOnly(this.events, method.name, description);
              }
              // Expose all events by their signature, for overloaded functions
              if (this.events[description.signature] == null) {
                  properties_1.defineReadOnly(this.events, description.signature, description);
              }
              break;
          }
          case 'fallback':
              // Nothing to do for fallback
              break;
          default:
              console.log('WARNING: unsupported ABI type - ' + method.type);
              break;
      }
  }
  var Interface = /** @class */ (function () {
      function Interface(abi) {
          errors.checkNew(this, Interface);
          if (typeof (abi) === 'string') {
              try {
                  abi = JSON.parse(abi);
              }
              catch (error) {
                  errors.throwError('could not parse ABI JSON', errors.INVALID_ARGUMENT, {
                      arg: 'abi',
                      errorMessage: error.message,
                      value: abi
                  });
              }
              if (!Array.isArray(abi)) {
                  errors.throwError('invalid abi', errors.INVALID_ARGUMENT, { arg: 'abi', value: abi });
                  return null;
              }
          }
          properties_1.defineReadOnly(this, 'functions', {});
          properties_1.defineReadOnly(this, 'events', {});
          // Convert any supported ABI format into a standard ABI format
          var _abi = [];
          abi.forEach(function (fragment) {
              if (typeof (fragment) === 'string') {
                  fragment = abi_coder_1.parseSignature(fragment);
              }
              // @TODO: We should probable do some validation; create abiCoder.formatSignature for checking
              _abi.push(fragment);
          });
          properties_1.defineFrozen(this, 'abi', _abi);
          _abi.forEach(addMethod, this);
          // If there wasn't a constructor, create the default constructor
          if (!this.deployFunction) {
              addMethod.call(this, { type: 'constructor', inputs: [] });
          }
      }
      Interface.prototype.parseTransaction = function (tx) {
          var sighash = tx.data.substring(0, 10).toLowerCase();
          for (var name in this.functions) {
              if (name.indexOf('(') === -1) {
                  continue;
              }
              var func = this.functions[name];
              if (func.sighash === sighash) {
                  var result = abi_coder_1.defaultAbiCoder.decode(func.inputs, '0x' + tx.data.substring(10));
                  return new TransactionDescription({
                      args: result,
                      decode: func.decode,
                      name: name,
                      signature: func.signature,
                      sighash: func.sighash,
                      value: bignumber_1.bigNumberify(tx.value || 0),
                  });
              }
          }
          return null;
      };
      Interface.prototype.parseLog = function (log) {
          for (var name in this.events) {
              if (name.indexOf('(') === -1) {
                  continue;
              }
              var event = this.events[name];
              if (event.anonymous) {
                  continue;
              }
              if (event.topic !== log.topics[0]) {
                  continue;
              }
              // @TODO: If anonymous, and the only method, and the input count matches, should we parse and return it?
              return new LogDescription({
                  name: event.name,
                  signature: event.signature,
                  topic: event.topic,
                  values: event.decode(log.data, log.topics)
              });
          }
          return null;
      };
      return Interface;
  }());
  exports.Interface = Interface;
  
  },{"../utils/abi-coder":56,"../utils/address":57,"../utils/bignumber":59,"../utils/bytes":60,"../utils/errors":61,"../utils/hash":62,"../utils/keccak256":66,"../utils/properties":69,"../utils/types":77}],5:[function(require,module,exports){
  'use strict';
  var __importStar = (this && this.__importStar) || function (mod) {
      if (mod && mod.__esModule) return mod;
      var result = {};
      if (mod != null) for (var k in mod) if (Object.hasOwnProperty.call(mod, k)) result[k] = mod[k];
      result["default"] = mod;
      return result;
  };
  Object.defineProperty(exports, "__esModule", { value: true });
  // This is empty in node, and used by browserify to inject extra goodies
  var shims_1 = require("./utils/shims");
  exports.platform = shims_1.platform;
  var contracts_1 = require("./contracts");
  exports.Contract = contracts_1.Contract;
  exports.Interface = contracts_1.Interface;
  var providers = __importStar(require("./providers"));
  exports.providers = providers;
  var utils = __importStar(require("./utils"));
  exports.utils = utils;
  var wallet_1 = require("./wallet");
  exports.HDNode = wallet_1.HDNode;
  exports.SigningKey = wallet_1.SigningKey;
  exports.Wallet = wallet_1.Wallet;
  var wordlists = __importStar(require("./wordlists"));
  exports.wordlists = wordlists;
  var types = __importStar(require("./utils/types"));
  exports.types = types;
  var errors = __importStar(require("./utils/errors"));
  exports.errors = errors;
  var _version_1 = require("./_version");
  exports.version = _version_1.version;
  var constants = utils.constants;
  exports.constants = constants;
  
  },{"./_version":1,"./contracts":3,"./providers":50,"./utils":64,"./utils/errors":61,"./utils/shims":74,"./utils/types":77,"./wallet":82,"./wordlists":86}],6:[function(require,module,exports){
  "use strict";
  function __export(m) {
      for (var p in m) if (!exports.hasOwnProperty(p)) exports[p] = m[p];
  }
  var __importStar = (this && this.__importStar) || function (mod) {
      if (mod && mod.__esModule) return mod;
      var result = {};
      if (mod != null) for (var k in mod) if (Object.hasOwnProperty.call(mod, k)) result[k] = mod[k];
      result["default"] = mod;
      return result;
  };
  Object.defineProperty(exports, "__esModule", { value: true });
  var ethers = __importStar(require("./ethers"));
  exports.ethers = ethers;
  __export(require("./ethers"));
  
  },{"./ethers":5}],7:[function(require,module,exports){
  "use strict";
  
  (function(root) {
  
      function checkInt(value) {
          return (parseInt(value) === value);
      }
  
      function checkInts(arrayish) {
          if (!checkInt(arrayish.length)) { return false; }
  
          for (var i = 0; i < arrayish.length; i++) {
              if (!checkInt(arrayish[i]) || arrayish[i] < 0 || arrayish[i] > 255) {
                  return false;
              }
          }
  
          return true;
      }
  
      function coerceArray(arg, copy) {
  
          // ArrayBuffer view
          if (arg.buffer && ArrayBuffer.isView(arg) && arg.name === 'Uint8Array') {
  
              if (copy) {
                  if (arg.slice) {
                      arg = arg.slice();
                  } else {
                      arg = Array.prototype.slice.call(arg);
                  }
              }
  
              return arg;
          }
  
          // It's an array; check it is a valid representation of a byte
          if (Array.isArray(arg)) {
              if (!checkInts(arg)) {
                  throw new Error('Array contains invalid value: ' + arg);
              }
  
              return new Uint8Array(arg);
          }
  
          // Something else, but behaves like an array (maybe a Buffer? Arguments?)
          if (checkInt(arg.length) && checkInts(arg)) {
              return new Uint8Array(arg);
          }
  
          throw new Error('unsupported array-like object');
      }
  
      function createArray(length) {
          return new Uint8Array(length);
      }
  
      function copyArray(sourceArray, targetArray, targetStart, sourceStart, sourceEnd) {
          if (sourceStart != null || sourceEnd != null) {
              if (sourceArray.slice) {
                  sourceArray = sourceArray.slice(sourceStart, sourceEnd);
              } else {
                  sourceArray = Array.prototype.slice.call(sourceArray, sourceStart, sourceEnd);
              }
          }
          targetArray.set(sourceArray, targetStart);
      }
  
  
  
      var convertUtf8 = (function() {
          function toBytes(text) {
              var result = [], i = 0;
              text = encodeURI(text);
              while (i < text.length) {
                  var c = text.charCodeAt(i++);
  
                  // if it is a % sign, encode the following 2 bytes as a hex value
                  if (c === 37) {
                      result.push(parseInt(text.substr(i, 2), 16))
                      i += 2;
  
                  // otherwise, just the actual byte
                  } else {
                      result.push(c)
                  }
              }
  
              return coerceArray(result);
          }
  
          function fromBytes(bytes) {
              var result = [], i = 0;
  
              while (i < bytes.length) {
                  var c = bytes[i];
  
                  if (c < 128) {
                      result.push(String.fromCharCode(c));
                      i++;
                  } else if (c > 191 && c < 224) {
                      result.push(String.fromCharCode(((c & 0x1f) << 6) | (bytes[i + 1] & 0x3f)));
                      i += 2;
                  } else {
                      result.push(String.fromCharCode(((c & 0x0f) << 12) | ((bytes[i + 1] & 0x3f) << 6) | (bytes[i + 2] & 0x3f)));
                      i += 3;
                  }
              }
  
              return result.join('');
          }
  
          return {
              toBytes: toBytes,
              fromBytes: fromBytes,
          }
      })();
  
      var convertHex = (function() {
          function toBytes(text) {
              var result = [];
              for (var i = 0; i < text.length; i += 2) {
                  result.push(parseInt(text.substr(i, 2), 16));
              }
  
              return result;
          }
  
          // http://ixti.net/development/javascript/2011/11/11/base64-encodedecode-of-utf8-in-browser-with-js.html
          var Hex = '0123456789abcdef';
  
          function fromBytes(bytes) {
                  var result = [];
                  for (var i = 0; i < bytes.length; i++) {
                      var v = bytes[i];
                      result.push(Hex[(v & 0xf0) >> 4] + Hex[v & 0x0f]);
                  }
                  return result.join('');
          }
  
          return {
              toBytes: toBytes,
              fromBytes: fromBytes,
          }
      })();
  
  
      // Number of rounds by keysize
      var numberOfRounds = {16: 10, 24: 12, 32: 14}
  
      // Round constant words
      var rcon = [0x01, 0x02, 0x04, 0x08, 0x10, 0x20, 0x40, 0x80, 0x1b, 0x36, 0x6c, 0xd8, 0xab, 0x4d, 0x9a, 0x2f, 0x5e, 0xbc, 0x63, 0xc6, 0x97, 0x35, 0x6a, 0xd4, 0xb3, 0x7d, 0xfa, 0xef, 0xc5, 0x91];
  
      // S-box and Inverse S-box (S is for Substitution)
      var S = [0x63, 0x7c, 0x77, 0x7b, 0xf2, 0x6b, 0x6f, 0xc5, 0x30, 0x01, 0x67, 0x2b, 0xfe, 0xd7, 0xab, 0x76, 0xca, 0x82, 0xc9, 0x7d, 0xfa, 0x59, 0x47, 0xf0, 0xad, 0xd4, 0xa2, 0xaf, 0x9c, 0xa4, 0x72, 0xc0, 0xb7, 0xfd, 0x93, 0x26, 0x36, 0x3f, 0xf7, 0xcc, 0x34, 0xa5, 0xe5, 0xf1, 0x71, 0xd8, 0x31, 0x15, 0x04, 0xc7, 0x23, 0xc3, 0x18, 0x96, 0x05, 0x9a, 0x07, 0x12, 0x80, 0xe2, 0xeb, 0x27, 0xb2, 0x75, 0x09, 0x83, 0x2c, 0x1a, 0x1b, 0x6e, 0x5a, 0xa0, 0x52, 0x3b, 0xd6, 0xb3, 0x29, 0xe3, 0x2f, 0x84, 0x53, 0xd1, 0x00, 0xed, 0x20, 0xfc, 0xb1, 0x5b, 0x6a, 0xcb, 0xbe, 0x39, 0x4a, 0x4c, 0x58, 0xcf, 0xd0, 0xef, 0xaa, 0xfb, 0x43, 0x4d, 0x33, 0x85, 0x45, 0xf9, 0x02, 0x7f, 0x50, 0x3c, 0x9f, 0xa8, 0x51, 0xa3, 0x40, 0x8f, 0x92, 0x9d, 0x38, 0xf5, 0xbc, 0xb6, 0xda, 0x21, 0x10, 0xff, 0xf3, 0xd2, 0xcd, 0x0c, 0x13, 0xec, 0x5f, 0x97, 0x44, 0x17, 0xc4, 0xa7, 0x7e, 0x3d, 0x64, 0x5d, 0x19, 0x73, 0x60, 0x81, 0x4f, 0xdc, 0x22, 0x2a, 0x90, 0x88, 0x46, 0xee, 0xb8, 0x14, 0xde, 0x5e, 0x0b, 0xdb, 0xe0, 0x32, 0x3a, 0x0a, 0x49, 0x06, 0x24, 0x5c, 0xc2, 0xd3, 0xac, 0x62, 0x91, 0x95, 0xe4, 0x79, 0xe7, 0xc8, 0x37, 0x6d, 0x8d, 0xd5, 0x4e, 0xa9, 0x6c, 0x56, 0xf4, 0xea, 0x65, 0x7a, 0xae, 0x08, 0xba, 0x78, 0x25, 0x2e, 0x1c, 0xa6, 0xb4, 0xc6, 0xe8, 0xdd, 0x74, 0x1f, 0x4b, 0xbd, 0x8b, 0x8a, 0x70, 0x3e, 0xb5, 0x66, 0x48, 0x03, 0xf6, 0x0e, 0x61, 0x35, 0x57, 0xb9, 0x86, 0xc1, 0x1d, 0x9e, 0xe1, 0xf8, 0x98, 0x11, 0x69, 0xd9, 0x8e, 0x94, 0x9b, 0x1e, 0x87, 0xe9, 0xce, 0x55, 0x28, 0xdf, 0x8c, 0xa1, 0x89, 0x0d, 0xbf, 0xe6, 0x42, 0x68, 0x41, 0x99, 0x2d, 0x0f, 0xb0, 0x54, 0xbb, 0x16];
      var Si =[0x52, 0x09, 0x6a, 0xd5, 0x30, 0x36, 0xa5, 0x38, 0xbf, 0x40, 0xa3, 0x9e, 0x81, 0xf3, 0xd7, 0xfb, 0x7c, 0xe3, 0x39, 0x82, 0x9b, 0x2f, 0xff, 0x87, 0x34, 0x8e, 0x43, 0x44, 0xc4, 0xde, 0xe9, 0xcb, 0x54, 0x7b, 0x94, 0x32, 0xa6, 0xc2, 0x23, 0x3d, 0xee, 0x4c, 0x95, 0x0b, 0x42, 0xfa, 0xc3, 0x4e, 0x08, 0x2e, 0xa1, 0x66, 0x28, 0xd9, 0x24, 0xb2, 0x76, 0x5b, 0xa2, 0x49, 0x6d, 0x8b, 0xd1, 0x25, 0x72, 0xf8, 0xf6, 0x64, 0x86, 0x68, 0x98, 0x16, 0xd4, 0xa4, 0x5c, 0xcc, 0x5d, 0x65, 0xb6, 0x92, 0x6c, 0x70, 0x48, 0x50, 0xfd, 0xed, 0xb9, 0xda, 0x5e, 0x15, 0x46, 0x57, 0xa7, 0x8d, 0x9d, 0x84, 0x90, 0xd8, 0xab, 0x00, 0x8c, 0xbc, 0xd3, 0x0a, 0xf7, 0xe4, 0x58, 0x05, 0xb8, 0xb3, 0x45, 0x06, 0xd0, 0x2c, 0x1e, 0x8f, 0xca, 0x3f, 0x0f, 0x02, 0xc1, 0xaf, 0xbd, 0x03, 0x01, 0x13, 0x8a, 0x6b, 0x3a, 0x91, 0x11, 0x41, 0x4f, 0x67, 0xdc, 0xea, 0x97, 0xf2, 0xcf, 0xce, 0xf0, 0xb4, 0xe6, 0x73, 0x96, 0xac, 0x74, 0x22, 0xe7, 0xad, 0x35, 0x85, 0xe2, 0xf9, 0x37, 0xe8, 0x1c, 0x75, 0xdf, 0x6e, 0x47, 0xf1, 0x1a, 0x71, 0x1d, 0x29, 0xc5, 0x89, 0x6f, 0xb7, 0x62, 0x0e, 0xaa, 0x18, 0xbe, 0x1b, 0xfc, 0x56, 0x3e, 0x4b, 0xc6, 0xd2, 0x79, 0x20, 0x9a, 0xdb, 0xc0, 0xfe, 0x78, 0xcd, 0x5a, 0xf4, 0x1f, 0xdd, 0xa8, 0x33, 0x88, 0x07, 0xc7, 0x31, 0xb1, 0x12, 0x10, 0x59, 0x27, 0x80, 0xec, 0x5f, 0x60, 0x51, 0x7f, 0xa9, 0x19, 0xb5, 0x4a, 0x0d, 0x2d, 0xe5, 0x7a, 0x9f, 0x93, 0xc9, 0x9c, 0xef, 0xa0, 0xe0, 0x3b, 0x4d, 0xae, 0x2a, 0xf5, 0xb0, 0xc8, 0xeb, 0xbb, 0x3c, 0x83, 0x53, 0x99, 0x61, 0x17, 0x2b, 0x04, 0x7e, 0xba, 0x77, 0xd6, 0x26, 0xe1, 0x69, 0x14, 0x63, 0x55, 0x21, 0x0c, 0x7d];
  
      // Transformations for encryption
      var T1 = [0xc66363a5, 0xf87c7c84, 0xee777799, 0xf67b7b8d, 0xfff2f20d, 0xd66b6bbd, 0xde6f6fb1, 0x91c5c554, 0x60303050, 0x02010103, 0xce6767a9, 0x562b2b7d, 0xe7fefe19, 0xb5d7d762, 0x4dababe6, 0xec76769a, 0x8fcaca45, 0x1f82829d, 0x89c9c940, 0xfa7d7d87, 0xeffafa15, 0xb25959eb, 0x8e4747c9, 0xfbf0f00b, 0x41adadec, 0xb3d4d467, 0x5fa2a2fd, 0x45afafea, 0x239c9cbf, 0x53a4a4f7, 0xe4727296, 0x9bc0c05b, 0x75b7b7c2, 0xe1fdfd1c, 0x3d9393ae, 0x4c26266a, 0x6c36365a, 0x7e3f3f41, 0xf5f7f702, 0x83cccc4f, 0x6834345c, 0x51a5a5f4, 0xd1e5e534, 0xf9f1f108, 0xe2717193, 0xabd8d873, 0x62313153, 0x2a15153f, 0x0804040c, 0x95c7c752, 0x46232365, 0x9dc3c35e, 0x30181828, 0x379696a1, 0x0a05050f, 0x2f9a9ab5, 0x0e070709, 0x24121236, 0x1b80809b, 0xdfe2e23d, 0xcdebeb26, 0x4e272769, 0x7fb2b2cd, 0xea75759f, 0x1209091b, 0x1d83839e, 0x582c2c74, 0x341a1a2e, 0x361b1b2d, 0xdc6e6eb2, 0xb45a5aee, 0x5ba0a0fb, 0xa45252f6, 0x763b3b4d, 0xb7d6d661, 0x7db3b3ce, 0x5229297b, 0xdde3e33e, 0x5e2f2f71, 0x13848497, 0xa65353f5, 0xb9d1d168, 0x00000000, 0xc1eded2c, 0x40202060, 0xe3fcfc1f, 0x79b1b1c8, 0xb65b5bed, 0xd46a6abe, 0x8dcbcb46, 0x67bebed9, 0x7239394b, 0x944a4ade, 0x984c4cd4, 0xb05858e8, 0x85cfcf4a, 0xbbd0d06b, 0xc5efef2a, 0x4faaaae5, 0xedfbfb16, 0x864343c5, 0x9a4d4dd7, 0x66333355, 0x11858594, 0x8a4545cf, 0xe9f9f910, 0x04020206, 0xfe7f7f81, 0xa05050f0, 0x783c3c44, 0x259f9fba, 0x4ba8a8e3, 0xa25151f3, 0x5da3a3fe, 0x804040c0, 0x058f8f8a, 0x3f9292ad, 0x219d9dbc, 0x70383848, 0xf1f5f504, 0x63bcbcdf, 0x77b6b6c1, 0xafdada75, 0x42212163, 0x20101030, 0xe5ffff1a, 0xfdf3f30e, 0xbfd2d26d, 0x81cdcd4c, 0x180c0c14, 0x26131335, 0xc3ecec2f, 0xbe5f5fe1, 0x359797a2, 0x884444cc, 0x2e171739, 0x93c4c457, 0x55a7a7f2, 0xfc7e7e82, 0x7a3d3d47, 0xc86464ac, 0xba5d5de7, 0x3219192b, 0xe6737395, 0xc06060a0, 0x19818198, 0x9e4f4fd1, 0xa3dcdc7f, 0x44222266, 0x542a2a7e, 0x3b9090ab, 0x0b888883, 0x8c4646ca, 0xc7eeee29, 0x6bb8b8d3, 0x2814143c, 0xa7dede79, 0xbc5e5ee2, 0x160b0b1d, 0xaddbdb76, 0xdbe0e03b, 0x64323256, 0x743a3a4e, 0x140a0a1e, 0x924949db, 0x0c06060a, 0x4824246c, 0xb85c5ce4, 0x9fc2c25d, 0xbdd3d36e, 0x43acacef, 0xc46262a6, 0x399191a8, 0x319595a4, 0xd3e4e437, 0xf279798b, 0xd5e7e732, 0x8bc8c843, 0x6e373759, 0xda6d6db7, 0x018d8d8c, 0xb1d5d564, 0x9c4e4ed2, 0x49a9a9e0, 0xd86c6cb4, 0xac5656fa, 0xf3f4f407, 0xcfeaea25, 0xca6565af, 0xf47a7a8e, 0x47aeaee9, 0x10080818, 0x6fbabad5, 0xf0787888, 0x4a25256f, 0x5c2e2e72, 0x381c1c24, 0x57a6a6f1, 0x73b4b4c7, 0x97c6c651, 0xcbe8e823, 0xa1dddd7c, 0xe874749c, 0x3e1f1f21, 0x964b4bdd, 0x61bdbddc, 0x0d8b8b86, 0x0f8a8a85, 0xe0707090, 0x7c3e3e42, 0x71b5b5c4, 0xcc6666aa, 0x904848d8, 0x06030305, 0xf7f6f601, 0x1c0e0e12, 0xc26161a3, 0x6a35355f, 0xae5757f9, 0x69b9b9d0, 0x17868691, 0x99c1c158, 0x3a1d1d27, 0x279e9eb9, 0xd9e1e138, 0xebf8f813, 0x2b9898b3, 0x22111133, 0xd26969bb, 0xa9d9d970, 0x078e8e89, 0x339494a7, 0x2d9b9bb6, 0x3c1e1e22, 0x15878792, 0xc9e9e920, 0x87cece49, 0xaa5555ff, 0x50282878, 0xa5dfdf7a, 0x038c8c8f, 0x59a1a1f8, 0x09898980, 0x1a0d0d17, 0x65bfbfda, 0xd7e6e631, 0x844242c6, 0xd06868b8, 0x824141c3, 0x299999b0, 0x5a2d2d77, 0x1e0f0f11, 0x7bb0b0cb, 0xa85454fc, 0x6dbbbbd6, 0x2c16163a];
      var T2 = [0xa5c66363, 0x84f87c7c, 0x99ee7777, 0x8df67b7b, 0x0dfff2f2, 0xbdd66b6b, 0xb1de6f6f, 0x5491c5c5, 0x50603030, 0x03020101, 0xa9ce6767, 0x7d562b2b, 0x19e7fefe, 0x62b5d7d7, 0xe64dabab, 0x9aec7676, 0x458fcaca, 0x9d1f8282, 0x4089c9c9, 0x87fa7d7d, 0x15effafa, 0xebb25959, 0xc98e4747, 0x0bfbf0f0, 0xec41adad, 0x67b3d4d4, 0xfd5fa2a2, 0xea45afaf, 0xbf239c9c, 0xf753a4a4, 0x96e47272, 0x5b9bc0c0, 0xc275b7b7, 0x1ce1fdfd, 0xae3d9393, 0x6a4c2626, 0x5a6c3636, 0x417e3f3f, 0x02f5f7f7, 0x4f83cccc, 0x5c683434, 0xf451a5a5, 0x34d1e5e5, 0x08f9f1f1, 0x93e27171, 0x73abd8d8, 0x53623131, 0x3f2a1515, 0x0c080404, 0x5295c7c7, 0x65462323, 0x5e9dc3c3, 0x28301818, 0xa1379696, 0x0f0a0505, 0xb52f9a9a, 0x090e0707, 0x36241212, 0x9b1b8080, 0x3ddfe2e2, 0x26cdebeb, 0x694e2727, 0xcd7fb2b2, 0x9fea7575, 0x1b120909, 0x9e1d8383, 0x74582c2c, 0x2e341a1a, 0x2d361b1b, 0xb2dc6e6e, 0xeeb45a5a, 0xfb5ba0a0, 0xf6a45252, 0x4d763b3b, 0x61b7d6d6, 0xce7db3b3, 0x7b522929, 0x3edde3e3, 0x715e2f2f, 0x97138484, 0xf5a65353, 0x68b9d1d1, 0x00000000, 0x2cc1eded, 0x60402020, 0x1fe3fcfc, 0xc879b1b1, 0xedb65b5b, 0xbed46a6a, 0x468dcbcb, 0xd967bebe, 0x4b723939, 0xde944a4a, 0xd4984c4c, 0xe8b05858, 0x4a85cfcf, 0x6bbbd0d0, 0x2ac5efef, 0xe54faaaa, 0x16edfbfb, 0xc5864343, 0xd79a4d4d, 0x55663333, 0x94118585, 0xcf8a4545, 0x10e9f9f9, 0x06040202, 0x81fe7f7f, 0xf0a05050, 0x44783c3c, 0xba259f9f, 0xe34ba8a8, 0xf3a25151, 0xfe5da3a3, 0xc0804040, 0x8a058f8f, 0xad3f9292, 0xbc219d9d, 0x48703838, 0x04f1f5f5, 0xdf63bcbc, 0xc177b6b6, 0x75afdada, 0x63422121, 0x30201010, 0x1ae5ffff, 0x0efdf3f3, 0x6dbfd2d2, 0x4c81cdcd, 0x14180c0c, 0x35261313, 0x2fc3ecec, 0xe1be5f5f, 0xa2359797, 0xcc884444, 0x392e1717, 0x5793c4c4, 0xf255a7a7, 0x82fc7e7e, 0x477a3d3d, 0xacc86464, 0xe7ba5d5d, 0x2b321919, 0x95e67373, 0xa0c06060, 0x98198181, 0xd19e4f4f, 0x7fa3dcdc, 0x66442222, 0x7e542a2a, 0xab3b9090, 0x830b8888, 0xca8c4646, 0x29c7eeee, 0xd36bb8b8, 0x3c281414, 0x79a7dede, 0xe2bc5e5e, 0x1d160b0b, 0x76addbdb, 0x3bdbe0e0, 0x56643232, 0x4e743a3a, 0x1e140a0a, 0xdb924949, 0x0a0c0606, 0x6c482424, 0xe4b85c5c, 0x5d9fc2c2, 0x6ebdd3d3, 0xef43acac, 0xa6c46262, 0xa8399191, 0xa4319595, 0x37d3e4e4, 0x8bf27979, 0x32d5e7e7, 0x438bc8c8, 0x596e3737, 0xb7da6d6d, 0x8c018d8d, 0x64b1d5d5, 0xd29c4e4e, 0xe049a9a9, 0xb4d86c6c, 0xfaac5656, 0x07f3f4f4, 0x25cfeaea, 0xafca6565, 0x8ef47a7a, 0xe947aeae, 0x18100808, 0xd56fbaba, 0x88f07878, 0x6f4a2525, 0x725c2e2e, 0x24381c1c, 0xf157a6a6, 0xc773b4b4, 0x5197c6c6, 0x23cbe8e8, 0x7ca1dddd, 0x9ce87474, 0x213e1f1f, 0xdd964b4b, 0xdc61bdbd, 0x860d8b8b, 0x850f8a8a, 0x90e07070, 0x427c3e3e, 0xc471b5b5, 0xaacc6666, 0xd8904848, 0x05060303, 0x01f7f6f6, 0x121c0e0e, 0xa3c26161, 0x5f6a3535, 0xf9ae5757, 0xd069b9b9, 0x91178686, 0x5899c1c1, 0x273a1d1d, 0xb9279e9e, 0x38d9e1e1, 0x13ebf8f8, 0xb32b9898, 0x33221111, 0xbbd26969, 0x70a9d9d9, 0x89078e8e, 0xa7339494, 0xb62d9b9b, 0x223c1e1e, 0x92158787, 0x20c9e9e9, 0x4987cece, 0xffaa5555, 0x78502828, 0x7aa5dfdf, 0x8f038c8c, 0xf859a1a1, 0x80098989, 0x171a0d0d, 0xda65bfbf, 0x31d7e6e6, 0xc6844242, 0xb8d06868, 0xc3824141, 0xb0299999, 0x775a2d2d, 0x111e0f0f, 0xcb7bb0b0, 0xfca85454, 0xd66dbbbb, 0x3a2c1616];
      var T3 = [0x63a5c663, 0x7c84f87c, 0x7799ee77, 0x7b8df67b, 0xf20dfff2, 0x6bbdd66b, 0x6fb1de6f, 0xc55491c5, 0x30506030, 0x01030201, 0x67a9ce67, 0x2b7d562b, 0xfe19e7fe, 0xd762b5d7, 0xabe64dab, 0x769aec76, 0xca458fca, 0x829d1f82, 0xc94089c9, 0x7d87fa7d, 0xfa15effa, 0x59ebb259, 0x47c98e47, 0xf00bfbf0, 0xadec41ad, 0xd467b3d4, 0xa2fd5fa2, 0xafea45af, 0x9cbf239c, 0xa4f753a4, 0x7296e472, 0xc05b9bc0, 0xb7c275b7, 0xfd1ce1fd, 0x93ae3d93, 0x266a4c26, 0x365a6c36, 0x3f417e3f, 0xf702f5f7, 0xcc4f83cc, 0x345c6834, 0xa5f451a5, 0xe534d1e5, 0xf108f9f1, 0x7193e271, 0xd873abd8, 0x31536231, 0x153f2a15, 0x040c0804, 0xc75295c7, 0x23654623, 0xc35e9dc3, 0x18283018, 0x96a13796, 0x050f0a05, 0x9ab52f9a, 0x07090e07, 0x12362412, 0x809b1b80, 0xe23ddfe2, 0xeb26cdeb, 0x27694e27, 0xb2cd7fb2, 0x759fea75, 0x091b1209, 0x839e1d83, 0x2c74582c, 0x1a2e341a, 0x1b2d361b, 0x6eb2dc6e, 0x5aeeb45a, 0xa0fb5ba0, 0x52f6a452, 0x3b4d763b, 0xd661b7d6, 0xb3ce7db3, 0x297b5229, 0xe33edde3, 0x2f715e2f, 0x84971384, 0x53f5a653, 0xd168b9d1, 0x00000000, 0xed2cc1ed, 0x20604020, 0xfc1fe3fc, 0xb1c879b1, 0x5bedb65b, 0x6abed46a, 0xcb468dcb, 0xbed967be, 0x394b7239, 0x4ade944a, 0x4cd4984c, 0x58e8b058, 0xcf4a85cf, 0xd06bbbd0, 0xef2ac5ef, 0xaae54faa, 0xfb16edfb, 0x43c58643, 0x4dd79a4d, 0x33556633, 0x85941185, 0x45cf8a45, 0xf910e9f9, 0x02060402, 0x7f81fe7f, 0x50f0a050, 0x3c44783c, 0x9fba259f, 0xa8e34ba8, 0x51f3a251, 0xa3fe5da3, 0x40c08040, 0x8f8a058f, 0x92ad3f92, 0x9dbc219d, 0x38487038, 0xf504f1f5, 0xbcdf63bc, 0xb6c177b6, 0xda75afda, 0x21634221, 0x10302010, 0xff1ae5ff, 0xf30efdf3, 0xd26dbfd2, 0xcd4c81cd, 0x0c14180c, 0x13352613, 0xec2fc3ec, 0x5fe1be5f, 0x97a23597, 0x44cc8844, 0x17392e17, 0xc45793c4, 0xa7f255a7, 0x7e82fc7e, 0x3d477a3d, 0x64acc864, 0x5de7ba5d, 0x192b3219, 0x7395e673, 0x60a0c060, 0x81981981, 0x4fd19e4f, 0xdc7fa3dc, 0x22664422, 0x2a7e542a, 0x90ab3b90, 0x88830b88, 0x46ca8c46, 0xee29c7ee, 0xb8d36bb8, 0x143c2814, 0xde79a7de, 0x5ee2bc5e, 0x0b1d160b, 0xdb76addb, 0xe03bdbe0, 0x32566432, 0x3a4e743a, 0x0a1e140a, 0x49db9249, 0x060a0c06, 0x246c4824, 0x5ce4b85c, 0xc25d9fc2, 0xd36ebdd3, 0xacef43ac, 0x62a6c462, 0x91a83991, 0x95a43195, 0xe437d3e4, 0x798bf279, 0xe732d5e7, 0xc8438bc8, 0x37596e37, 0x6db7da6d, 0x8d8c018d, 0xd564b1d5, 0x4ed29c4e, 0xa9e049a9, 0x6cb4d86c, 0x56faac56, 0xf407f3f4, 0xea25cfea, 0x65afca65, 0x7a8ef47a, 0xaee947ae, 0x08181008, 0xbad56fba, 0x7888f078, 0x256f4a25, 0x2e725c2e, 0x1c24381c, 0xa6f157a6, 0xb4c773b4, 0xc65197c6, 0xe823cbe8, 0xdd7ca1dd, 0x749ce874, 0x1f213e1f, 0x4bdd964b, 0xbddc61bd, 0x8b860d8b, 0x8a850f8a, 0x7090e070, 0x3e427c3e, 0xb5c471b5, 0x66aacc66, 0x48d89048, 0x03050603, 0xf601f7f6, 0x0e121c0e, 0x61a3c261, 0x355f6a35, 0x57f9ae57, 0xb9d069b9, 0x86911786, 0xc15899c1, 0x1d273a1d, 0x9eb9279e, 0xe138d9e1, 0xf813ebf8, 0x98b32b98, 0x11332211, 0x69bbd269, 0xd970a9d9, 0x8e89078e, 0x94a73394, 0x9bb62d9b, 0x1e223c1e, 0x87921587, 0xe920c9e9, 0xce4987ce, 0x55ffaa55, 0x28785028, 0xdf7aa5df, 0x8c8f038c, 0xa1f859a1, 0x89800989, 0x0d171a0d, 0xbfda65bf, 0xe631d7e6, 0x42c68442, 0x68b8d068, 0x41c38241, 0x99b02999, 0x2d775a2d, 0x0f111e0f, 0xb0cb7bb0, 0x54fca854, 0xbbd66dbb, 0x163a2c16];
      var T4 = [0x6363a5c6, 0x7c7c84f8, 0x777799ee, 0x7b7b8df6, 0xf2f20dff, 0x6b6bbdd6, 0x6f6fb1de, 0xc5c55491, 0x30305060, 0x01010302, 0x6767a9ce, 0x2b2b7d56, 0xfefe19e7, 0xd7d762b5, 0xababe64d, 0x76769aec, 0xcaca458f, 0x82829d1f, 0xc9c94089, 0x7d7d87fa, 0xfafa15ef, 0x5959ebb2, 0x4747c98e, 0xf0f00bfb, 0xadadec41, 0xd4d467b3, 0xa2a2fd5f, 0xafafea45, 0x9c9cbf23, 0xa4a4f753, 0x727296e4, 0xc0c05b9b, 0xb7b7c275, 0xfdfd1ce1, 0x9393ae3d, 0x26266a4c, 0x36365a6c, 0x3f3f417e, 0xf7f702f5, 0xcccc4f83, 0x34345c68, 0xa5a5f451, 0xe5e534d1, 0xf1f108f9, 0x717193e2, 0xd8d873ab, 0x31315362, 0x15153f2a, 0x04040c08, 0xc7c75295, 0x23236546, 0xc3c35e9d, 0x18182830, 0x9696a137, 0x05050f0a, 0x9a9ab52f, 0x0707090e, 0x12123624, 0x80809b1b, 0xe2e23ddf, 0xebeb26cd, 0x2727694e, 0xb2b2cd7f, 0x75759fea, 0x09091b12, 0x83839e1d, 0x2c2c7458, 0x1a1a2e34, 0x1b1b2d36, 0x6e6eb2dc, 0x5a5aeeb4, 0xa0a0fb5b, 0x5252f6a4, 0x3b3b4d76, 0xd6d661b7, 0xb3b3ce7d, 0x29297b52, 0xe3e33edd, 0x2f2f715e, 0x84849713, 0x5353f5a6, 0xd1d168b9, 0x00000000, 0xeded2cc1, 0x20206040, 0xfcfc1fe3, 0xb1b1c879, 0x5b5bedb6, 0x6a6abed4, 0xcbcb468d, 0xbebed967, 0x39394b72, 0x4a4ade94, 0x4c4cd498, 0x5858e8b0, 0xcfcf4a85, 0xd0d06bbb, 0xefef2ac5, 0xaaaae54f, 0xfbfb16ed, 0x4343c586, 0x4d4dd79a, 0x33335566, 0x85859411, 0x4545cf8a, 0xf9f910e9, 0x02020604, 0x7f7f81fe, 0x5050f0a0, 0x3c3c4478, 0x9f9fba25, 0xa8a8e34b, 0x5151f3a2, 0xa3a3fe5d, 0x4040c080, 0x8f8f8a05, 0x9292ad3f, 0x9d9dbc21, 0x38384870, 0xf5f504f1, 0xbcbcdf63, 0xb6b6c177, 0xdada75af, 0x21216342, 0x10103020, 0xffff1ae5, 0xf3f30efd, 0xd2d26dbf, 0xcdcd4c81, 0x0c0c1418, 0x13133526, 0xecec2fc3, 0x5f5fe1be, 0x9797a235, 0x4444cc88, 0x1717392e, 0xc4c45793, 0xa7a7f255, 0x7e7e82fc, 0x3d3d477a, 0x6464acc8, 0x5d5de7ba, 0x19192b32, 0x737395e6, 0x6060a0c0, 0x81819819, 0x4f4fd19e, 0xdcdc7fa3, 0x22226644, 0x2a2a7e54, 0x9090ab3b, 0x8888830b, 0x4646ca8c, 0xeeee29c7, 0xb8b8d36b, 0x14143c28, 0xdede79a7, 0x5e5ee2bc, 0x0b0b1d16, 0xdbdb76ad, 0xe0e03bdb, 0x32325664, 0x3a3a4e74, 0x0a0a1e14, 0x4949db92, 0x06060a0c, 0x24246c48, 0x5c5ce4b8, 0xc2c25d9f, 0xd3d36ebd, 0xacacef43, 0x6262a6c4, 0x9191a839, 0x9595a431, 0xe4e437d3, 0x79798bf2, 0xe7e732d5, 0xc8c8438b, 0x3737596e, 0x6d6db7da, 0x8d8d8c01, 0xd5d564b1, 0x4e4ed29c, 0xa9a9e049, 0x6c6cb4d8, 0x5656faac, 0xf4f407f3, 0xeaea25cf, 0x6565afca, 0x7a7a8ef4, 0xaeaee947, 0x08081810, 0xbabad56f, 0x787888f0, 0x25256f4a, 0x2e2e725c, 0x1c1c2438, 0xa6a6f157, 0xb4b4c773, 0xc6c65197, 0xe8e823cb, 0xdddd7ca1, 0x74749ce8, 0x1f1f213e, 0x4b4bdd96, 0xbdbddc61, 0x8b8b860d, 0x8a8a850f, 0x707090e0, 0x3e3e427c, 0xb5b5c471, 0x6666aacc, 0x4848d890, 0x03030506, 0xf6f601f7, 0x0e0e121c, 0x6161a3c2, 0x35355f6a, 0x5757f9ae, 0xb9b9d069, 0x86869117, 0xc1c15899, 0x1d1d273a, 0x9e9eb927, 0xe1e138d9, 0xf8f813eb, 0x9898b32b, 0x11113322, 0x6969bbd2, 0xd9d970a9, 0x8e8e8907, 0x9494a733, 0x9b9bb62d, 0x1e1e223c, 0x87879215, 0xe9e920c9, 0xcece4987, 0x5555ffaa, 0x28287850, 0xdfdf7aa5, 0x8c8c8f03, 0xa1a1f859, 0x89898009, 0x0d0d171a, 0xbfbfda65, 0xe6e631d7, 0x4242c684, 0x6868b8d0, 0x4141c382, 0x9999b029, 0x2d2d775a, 0x0f0f111e, 0xb0b0cb7b, 0x5454fca8, 0xbbbbd66d, 0x16163a2c];
  
      // Transformations for decryption
      var T5 = [0x51f4a750, 0x7e416553, 0x1a17a4c3, 0x3a275e96, 0x3bab6bcb, 0x1f9d45f1, 0xacfa58ab, 0x4be30393, 0x2030fa55, 0xad766df6, 0x88cc7691, 0xf5024c25, 0x4fe5d7fc, 0xc52acbd7, 0x26354480, 0xb562a38f, 0xdeb15a49, 0x25ba1b67, 0x45ea0e98, 0x5dfec0e1, 0xc32f7502, 0x814cf012, 0x8d4697a3, 0x6bd3f9c6, 0x038f5fe7, 0x15929c95, 0xbf6d7aeb, 0x955259da, 0xd4be832d, 0x587421d3, 0x49e06929, 0x8ec9c844, 0x75c2896a, 0xf48e7978, 0x99583e6b, 0x27b971dd, 0xbee14fb6, 0xf088ad17, 0xc920ac66, 0x7dce3ab4, 0x63df4a18, 0xe51a3182, 0x97513360, 0x62537f45, 0xb16477e0, 0xbb6bae84, 0xfe81a01c, 0xf9082b94, 0x70486858, 0x8f45fd19, 0x94de6c87, 0x527bf8b7, 0xab73d323, 0x724b02e2, 0xe31f8f57, 0x6655ab2a, 0xb2eb2807, 0x2fb5c203, 0x86c57b9a, 0xd33708a5, 0x302887f2, 0x23bfa5b2, 0x02036aba, 0xed16825c, 0x8acf1c2b, 0xa779b492, 0xf307f2f0, 0x4e69e2a1, 0x65daf4cd, 0x0605bed5, 0xd134621f, 0xc4a6fe8a, 0x342e539d, 0xa2f355a0, 0x058ae132, 0xa4f6eb75, 0x0b83ec39, 0x4060efaa, 0x5e719f06, 0xbd6e1051, 0x3e218af9, 0x96dd063d, 0xdd3e05ae, 0x4de6bd46, 0x91548db5, 0x71c45d05, 0x0406d46f, 0x605015ff, 0x1998fb24, 0xd6bde997, 0x894043cc, 0x67d99e77, 0xb0e842bd, 0x07898b88, 0xe7195b38, 0x79c8eedb, 0xa17c0a47, 0x7c420fe9, 0xf8841ec9, 0x00000000, 0x09808683, 0x322bed48, 0x1e1170ac, 0x6c5a724e, 0xfd0efffb, 0x0f853856, 0x3daed51e, 0x362d3927, 0x0a0fd964, 0x685ca621, 0x9b5b54d1, 0x24362e3a, 0x0c0a67b1, 0x9357e70f, 0xb4ee96d2, 0x1b9b919e, 0x80c0c54f, 0x61dc20a2, 0x5a774b69, 0x1c121a16, 0xe293ba0a, 0xc0a02ae5, 0x3c22e043, 0x121b171d, 0x0e090d0b, 0xf28bc7ad, 0x2db6a8b9, 0x141ea9c8, 0x57f11985, 0xaf75074c, 0xee99ddbb, 0xa37f60fd, 0xf701269f, 0x5c72f5bc, 0x44663bc5, 0x5bfb7e34, 0x8b432976, 0xcb23c6dc, 0xb6edfc68, 0xb8e4f163, 0xd731dcca, 0x42638510, 0x13972240, 0x84c61120, 0x854a247d, 0xd2bb3df8, 0xaef93211, 0xc729a16d, 0x1d9e2f4b, 0xdcb230f3, 0x0d8652ec, 0x77c1e3d0, 0x2bb3166c, 0xa970b999, 0x119448fa, 0x47e96422, 0xa8fc8cc4, 0xa0f03f1a, 0x567d2cd8, 0x223390ef, 0x87494ec7, 0xd938d1c1, 0x8ccaa2fe, 0x98d40b36, 0xa6f581cf, 0xa57ade28, 0xdab78e26, 0x3fadbfa4, 0x2c3a9de4, 0x5078920d, 0x6a5fcc9b, 0x547e4662, 0xf68d13c2, 0x90d8b8e8, 0x2e39f75e, 0x82c3aff5, 0x9f5d80be, 0x69d0937c, 0x6fd52da9, 0xcf2512b3, 0xc8ac993b, 0x10187da7, 0xe89c636e, 0xdb3bbb7b, 0xcd267809, 0x6e5918f4, 0xec9ab701, 0x834f9aa8, 0xe6956e65, 0xaaffe67e, 0x21bccf08, 0xef15e8e6, 0xbae79bd9, 0x4a6f36ce, 0xea9f09d4, 0x29b07cd6, 0x31a4b2af, 0x2a3f2331, 0xc6a59430, 0x35a266c0, 0x744ebc37, 0xfc82caa6, 0xe090d0b0, 0x33a7d815, 0xf104984a, 0x41ecdaf7, 0x7fcd500e, 0x1791f62f, 0x764dd68d, 0x43efb04d, 0xccaa4d54, 0xe49604df, 0x9ed1b5e3, 0x4c6a881b, 0xc12c1fb8, 0x4665517f, 0x9d5eea04, 0x018c355d, 0xfa877473, 0xfb0b412e, 0xb3671d5a, 0x92dbd252, 0xe9105633, 0x6dd64713, 0x9ad7618c, 0x37a10c7a, 0x59f8148e, 0xeb133c89, 0xcea927ee, 0xb761c935, 0xe11ce5ed, 0x7a47b13c, 0x9cd2df59, 0x55f2733f, 0x1814ce79, 0x73c737bf, 0x53f7cdea, 0x5ffdaa5b, 0xdf3d6f14, 0x7844db86, 0xcaaff381, 0xb968c43e, 0x3824342c, 0xc2a3405f, 0x161dc372, 0xbce2250c, 0x283c498b, 0xff0d9541, 0x39a80171, 0x080cb3de, 0xd8b4e49c, 0x6456c190, 0x7bcb8461, 0xd532b670, 0x486c5c74, 0xd0b85742];
      var T6 = [0x5051f4a7, 0x537e4165, 0xc31a17a4, 0x963a275e, 0xcb3bab6b, 0xf11f9d45, 0xabacfa58, 0x934be303, 0x552030fa, 0xf6ad766d, 0x9188cc76, 0x25f5024c, 0xfc4fe5d7, 0xd7c52acb, 0x80263544, 0x8fb562a3, 0x49deb15a, 0x6725ba1b, 0x9845ea0e, 0xe15dfec0, 0x02c32f75, 0x12814cf0, 0xa38d4697, 0xc66bd3f9, 0xe7038f5f, 0x9515929c, 0xebbf6d7a, 0xda955259, 0x2dd4be83, 0xd3587421, 0x2949e069, 0x448ec9c8, 0x6a75c289, 0x78f48e79, 0x6b99583e, 0xdd27b971, 0xb6bee14f, 0x17f088ad, 0x66c920ac, 0xb47dce3a, 0x1863df4a, 0x82e51a31, 0x60975133, 0x4562537f, 0xe0b16477, 0x84bb6bae, 0x1cfe81a0, 0x94f9082b, 0x58704868, 0x198f45fd, 0x8794de6c, 0xb7527bf8, 0x23ab73d3, 0xe2724b02, 0x57e31f8f, 0x2a6655ab, 0x07b2eb28, 0x032fb5c2, 0x9a86c57b, 0xa5d33708, 0xf2302887, 0xb223bfa5, 0xba02036a, 0x5ced1682, 0x2b8acf1c, 0x92a779b4, 0xf0f307f2, 0xa14e69e2, 0xcd65daf4, 0xd50605be, 0x1fd13462, 0x8ac4a6fe, 0x9d342e53, 0xa0a2f355, 0x32058ae1, 0x75a4f6eb, 0x390b83ec, 0xaa4060ef, 0x065e719f, 0x51bd6e10, 0xf93e218a, 0x3d96dd06, 0xaedd3e05, 0x464de6bd, 0xb591548d, 0x0571c45d, 0x6f0406d4, 0xff605015, 0x241998fb, 0x97d6bde9, 0xcc894043, 0x7767d99e, 0xbdb0e842, 0x8807898b, 0x38e7195b, 0xdb79c8ee, 0x47a17c0a, 0xe97c420f, 0xc9f8841e, 0x00000000, 0x83098086, 0x48322bed, 0xac1e1170, 0x4e6c5a72, 0xfbfd0eff, 0x560f8538, 0x1e3daed5, 0x27362d39, 0x640a0fd9, 0x21685ca6, 0xd19b5b54, 0x3a24362e, 0xb10c0a67, 0x0f9357e7, 0xd2b4ee96, 0x9e1b9b91, 0x4f80c0c5, 0xa261dc20, 0x695a774b, 0x161c121a, 0x0ae293ba, 0xe5c0a02a, 0x433c22e0, 0x1d121b17, 0x0b0e090d, 0xadf28bc7, 0xb92db6a8, 0xc8141ea9, 0x8557f119, 0x4caf7507, 0xbbee99dd, 0xfda37f60, 0x9ff70126, 0xbc5c72f5, 0xc544663b, 0x345bfb7e, 0x768b4329, 0xdccb23c6, 0x68b6edfc, 0x63b8e4f1, 0xcad731dc, 0x10426385, 0x40139722, 0x2084c611, 0x7d854a24, 0xf8d2bb3d, 0x11aef932, 0x6dc729a1, 0x4b1d9e2f, 0xf3dcb230, 0xec0d8652, 0xd077c1e3, 0x6c2bb316, 0x99a970b9, 0xfa119448, 0x2247e964, 0xc4a8fc8c, 0x1aa0f03f, 0xd8567d2c, 0xef223390, 0xc787494e, 0xc1d938d1, 0xfe8ccaa2, 0x3698d40b, 0xcfa6f581, 0x28a57ade, 0x26dab78e, 0xa43fadbf, 0xe42c3a9d, 0x0d507892, 0x9b6a5fcc, 0x62547e46, 0xc2f68d13, 0xe890d8b8, 0x5e2e39f7, 0xf582c3af, 0xbe9f5d80, 0x7c69d093, 0xa96fd52d, 0xb3cf2512, 0x3bc8ac99, 0xa710187d, 0x6ee89c63, 0x7bdb3bbb, 0x09cd2678, 0xf46e5918, 0x01ec9ab7, 0xa8834f9a, 0x65e6956e, 0x7eaaffe6, 0x0821bccf, 0xe6ef15e8, 0xd9bae79b, 0xce4a6f36, 0xd4ea9f09, 0xd629b07c, 0xaf31a4b2, 0x312a3f23, 0x30c6a594, 0xc035a266, 0x37744ebc, 0xa6fc82ca, 0xb0e090d0, 0x1533a7d8, 0x4af10498, 0xf741ecda, 0x0e7fcd50, 0x2f1791f6, 0x8d764dd6, 0x4d43efb0, 0x54ccaa4d, 0xdfe49604, 0xe39ed1b5, 0x1b4c6a88, 0xb8c12c1f, 0x7f466551, 0x049d5eea, 0x5d018c35, 0x73fa8774, 0x2efb0b41, 0x5ab3671d, 0x5292dbd2, 0x33e91056, 0x136dd647, 0x8c9ad761, 0x7a37a10c, 0x8e59f814, 0x89eb133c, 0xeecea927, 0x35b761c9, 0xede11ce5, 0x3c7a47b1, 0x599cd2df, 0x3f55f273, 0x791814ce, 0xbf73c737, 0xea53f7cd, 0x5b5ffdaa, 0x14df3d6f, 0x867844db, 0x81caaff3, 0x3eb968c4, 0x2c382434, 0x5fc2a340, 0x72161dc3, 0x0cbce225, 0x8b283c49, 0x41ff0d95, 0x7139a801, 0xde080cb3, 0x9cd8b4e4, 0x906456c1, 0x617bcb84, 0x70d532b6, 0x74486c5c, 0x42d0b857];
      var T7 = [0xa75051f4, 0x65537e41, 0xa4c31a17, 0x5e963a27, 0x6bcb3bab, 0x45f11f9d, 0x58abacfa, 0x03934be3, 0xfa552030, 0x6df6ad76, 0x769188cc, 0x4c25f502, 0xd7fc4fe5, 0xcbd7c52a, 0x44802635, 0xa38fb562, 0x5a49deb1, 0x1b6725ba, 0x0e9845ea, 0xc0e15dfe, 0x7502c32f, 0xf012814c, 0x97a38d46, 0xf9c66bd3, 0x5fe7038f, 0x9c951592, 0x7aebbf6d, 0x59da9552, 0x832dd4be, 0x21d35874, 0x692949e0, 0xc8448ec9, 0x896a75c2, 0x7978f48e, 0x3e6b9958, 0x71dd27b9, 0x4fb6bee1, 0xad17f088, 0xac66c920, 0x3ab47dce, 0x4a1863df, 0x3182e51a, 0x33609751, 0x7f456253, 0x77e0b164, 0xae84bb6b, 0xa01cfe81, 0x2b94f908, 0x68587048, 0xfd198f45, 0x6c8794de, 0xf8b7527b, 0xd323ab73, 0x02e2724b, 0x8f57e31f, 0xab2a6655, 0x2807b2eb, 0xc2032fb5, 0x7b9a86c5, 0x08a5d337, 0x87f23028, 0xa5b223bf, 0x6aba0203, 0x825ced16, 0x1c2b8acf, 0xb492a779, 0xf2f0f307, 0xe2a14e69, 0xf4cd65da, 0xbed50605, 0x621fd134, 0xfe8ac4a6, 0x539d342e, 0x55a0a2f3, 0xe132058a, 0xeb75a4f6, 0xec390b83, 0xefaa4060, 0x9f065e71, 0x1051bd6e, 0x8af93e21, 0x063d96dd, 0x05aedd3e, 0xbd464de6, 0x8db59154, 0x5d0571c4, 0xd46f0406, 0x15ff6050, 0xfb241998, 0xe997d6bd, 0x43cc8940, 0x9e7767d9, 0x42bdb0e8, 0x8b880789, 0x5b38e719, 0xeedb79c8, 0x0a47a17c, 0x0fe97c42, 0x1ec9f884, 0x00000000, 0x86830980, 0xed48322b, 0x70ac1e11, 0x724e6c5a, 0xfffbfd0e, 0x38560f85, 0xd51e3dae, 0x3927362d, 0xd9640a0f, 0xa621685c, 0x54d19b5b, 0x2e3a2436, 0x67b10c0a, 0xe70f9357, 0x96d2b4ee, 0x919e1b9b, 0xc54f80c0, 0x20a261dc, 0x4b695a77, 0x1a161c12, 0xba0ae293, 0x2ae5c0a0, 0xe0433c22, 0x171d121b, 0x0d0b0e09, 0xc7adf28b, 0xa8b92db6, 0xa9c8141e, 0x198557f1, 0x074caf75, 0xddbbee99, 0x60fda37f, 0x269ff701, 0xf5bc5c72, 0x3bc54466, 0x7e345bfb, 0x29768b43, 0xc6dccb23, 0xfc68b6ed, 0xf163b8e4, 0xdccad731, 0x85104263, 0x22401397, 0x112084c6, 0x247d854a, 0x3df8d2bb, 0x3211aef9, 0xa16dc729, 0x2f4b1d9e, 0x30f3dcb2, 0x52ec0d86, 0xe3d077c1, 0x166c2bb3, 0xb999a970, 0x48fa1194, 0x642247e9, 0x8cc4a8fc, 0x3f1aa0f0, 0x2cd8567d, 0x90ef2233, 0x4ec78749, 0xd1c1d938, 0xa2fe8cca, 0x0b3698d4, 0x81cfa6f5, 0xde28a57a, 0x8e26dab7, 0xbfa43fad, 0x9de42c3a, 0x920d5078, 0xcc9b6a5f, 0x4662547e, 0x13c2f68d, 0xb8e890d8, 0xf75e2e39, 0xaff582c3, 0x80be9f5d, 0x937c69d0, 0x2da96fd5, 0x12b3cf25, 0x993bc8ac, 0x7da71018, 0x636ee89c, 0xbb7bdb3b, 0x7809cd26, 0x18f46e59, 0xb701ec9a, 0x9aa8834f, 0x6e65e695, 0xe67eaaff, 0xcf0821bc, 0xe8e6ef15, 0x9bd9bae7, 0x36ce4a6f, 0x09d4ea9f, 0x7cd629b0, 0xb2af31a4, 0x23312a3f, 0x9430c6a5, 0x66c035a2, 0xbc37744e, 0xcaa6fc82, 0xd0b0e090, 0xd81533a7, 0x984af104, 0xdaf741ec, 0x500e7fcd, 0xf62f1791, 0xd68d764d, 0xb04d43ef, 0x4d54ccaa, 0x04dfe496, 0xb5e39ed1, 0x881b4c6a, 0x1fb8c12c, 0x517f4665, 0xea049d5e, 0x355d018c, 0x7473fa87, 0x412efb0b, 0x1d5ab367, 0xd25292db, 0x5633e910, 0x47136dd6, 0x618c9ad7, 0x0c7a37a1, 0x148e59f8, 0x3c89eb13, 0x27eecea9, 0xc935b761, 0xe5ede11c, 0xb13c7a47, 0xdf599cd2, 0x733f55f2, 0xce791814, 0x37bf73c7, 0xcdea53f7, 0xaa5b5ffd, 0x6f14df3d, 0xdb867844, 0xf381caaf, 0xc43eb968, 0x342c3824, 0x405fc2a3, 0xc372161d, 0x250cbce2, 0x498b283c, 0x9541ff0d, 0x017139a8, 0xb3de080c, 0xe49cd8b4, 0xc1906456, 0x84617bcb, 0xb670d532, 0x5c74486c, 0x5742d0b8];
      var T8 = [0xf4a75051, 0x4165537e, 0x17a4c31a, 0x275e963a, 0xab6bcb3b, 0x9d45f11f, 0xfa58abac, 0xe303934b, 0x30fa5520, 0x766df6ad, 0xcc769188, 0x024c25f5, 0xe5d7fc4f, 0x2acbd7c5, 0x35448026, 0x62a38fb5, 0xb15a49de, 0xba1b6725, 0xea0e9845, 0xfec0e15d, 0x2f7502c3, 0x4cf01281, 0x4697a38d, 0xd3f9c66b, 0x8f5fe703, 0x929c9515, 0x6d7aebbf, 0x5259da95, 0xbe832dd4, 0x7421d358, 0xe0692949, 0xc9c8448e, 0xc2896a75, 0x8e7978f4, 0x583e6b99, 0xb971dd27, 0xe14fb6be, 0x88ad17f0, 0x20ac66c9, 0xce3ab47d, 0xdf4a1863, 0x1a3182e5, 0x51336097, 0x537f4562, 0x6477e0b1, 0x6bae84bb, 0x81a01cfe, 0x082b94f9, 0x48685870, 0x45fd198f, 0xde6c8794, 0x7bf8b752, 0x73d323ab, 0x4b02e272, 0x1f8f57e3, 0x55ab2a66, 0xeb2807b2, 0xb5c2032f, 0xc57b9a86, 0x3708a5d3, 0x2887f230, 0xbfa5b223, 0x036aba02, 0x16825ced, 0xcf1c2b8a, 0x79b492a7, 0x07f2f0f3, 0x69e2a14e, 0xdaf4cd65, 0x05bed506, 0x34621fd1, 0xa6fe8ac4, 0x2e539d34, 0xf355a0a2, 0x8ae13205, 0xf6eb75a4, 0x83ec390b, 0x60efaa40, 0x719f065e, 0x6e1051bd, 0x218af93e, 0xdd063d96, 0x3e05aedd, 0xe6bd464d, 0x548db591, 0xc45d0571, 0x06d46f04, 0x5015ff60, 0x98fb2419, 0xbde997d6, 0x4043cc89, 0xd99e7767, 0xe842bdb0, 0x898b8807, 0x195b38e7, 0xc8eedb79, 0x7c0a47a1, 0x420fe97c, 0x841ec9f8, 0x00000000, 0x80868309, 0x2bed4832, 0x1170ac1e, 0x5a724e6c, 0x0efffbfd, 0x8538560f, 0xaed51e3d, 0x2d392736, 0x0fd9640a, 0x5ca62168, 0x5b54d19b, 0x362e3a24, 0x0a67b10c, 0x57e70f93, 0xee96d2b4, 0x9b919e1b, 0xc0c54f80, 0xdc20a261, 0x774b695a, 0x121a161c, 0x93ba0ae2, 0xa02ae5c0, 0x22e0433c, 0x1b171d12, 0x090d0b0e, 0x8bc7adf2, 0xb6a8b92d, 0x1ea9c814, 0xf1198557, 0x75074caf, 0x99ddbbee, 0x7f60fda3, 0x01269ff7, 0x72f5bc5c, 0x663bc544, 0xfb7e345b, 0x4329768b, 0x23c6dccb, 0xedfc68b6, 0xe4f163b8, 0x31dccad7, 0x63851042, 0x97224013, 0xc6112084, 0x4a247d85, 0xbb3df8d2, 0xf93211ae, 0x29a16dc7, 0x9e2f4b1d, 0xb230f3dc, 0x8652ec0d, 0xc1e3d077, 0xb3166c2b, 0x70b999a9, 0x9448fa11, 0xe9642247, 0xfc8cc4a8, 0xf03f1aa0, 0x7d2cd856, 0x3390ef22, 0x494ec787, 0x38d1c1d9, 0xcaa2fe8c, 0xd40b3698, 0xf581cfa6, 0x7ade28a5, 0xb78e26da, 0xadbfa43f, 0x3a9de42c, 0x78920d50, 0x5fcc9b6a, 0x7e466254, 0x8d13c2f6, 0xd8b8e890, 0x39f75e2e, 0xc3aff582, 0x5d80be9f, 0xd0937c69, 0xd52da96f, 0x2512b3cf, 0xac993bc8, 0x187da710, 0x9c636ee8, 0x3bbb7bdb, 0x267809cd, 0x5918f46e, 0x9ab701ec, 0x4f9aa883, 0x956e65e6, 0xffe67eaa, 0xbccf0821, 0x15e8e6ef, 0xe79bd9ba, 0x6f36ce4a, 0x9f09d4ea, 0xb07cd629, 0xa4b2af31, 0x3f23312a, 0xa59430c6, 0xa266c035, 0x4ebc3774, 0x82caa6fc, 0x90d0b0e0, 0xa7d81533, 0x04984af1, 0xecdaf741, 0xcd500e7f, 0x91f62f17, 0x4dd68d76, 0xefb04d43, 0xaa4d54cc, 0x9604dfe4, 0xd1b5e39e, 0x6a881b4c, 0x2c1fb8c1, 0x65517f46, 0x5eea049d, 0x8c355d01, 0x877473fa, 0x0b412efb, 0x671d5ab3, 0xdbd25292, 0x105633e9, 0xd647136d, 0xd7618c9a, 0xa10c7a37, 0xf8148e59, 0x133c89eb, 0xa927eece, 0x61c935b7, 0x1ce5ede1, 0x47b13c7a, 0xd2df599c, 0xf2733f55, 0x14ce7918, 0xc737bf73, 0xf7cdea53, 0xfdaa5b5f, 0x3d6f14df, 0x44db8678, 0xaff381ca, 0x68c43eb9, 0x24342c38, 0xa3405fc2, 0x1dc37216, 0xe2250cbc, 0x3c498b28, 0x0d9541ff, 0xa8017139, 0x0cb3de08, 0xb4e49cd8, 0x56c19064, 0xcb84617b, 0x32b670d5, 0x6c5c7448, 0xb85742d0];
  
      // Transformations for decryption key expansion
      var U1 = [0x00000000, 0x0e090d0b, 0x1c121a16, 0x121b171d, 0x3824342c, 0x362d3927, 0x24362e3a, 0x2a3f2331, 0x70486858, 0x7e416553, 0x6c5a724e, 0x62537f45, 0x486c5c74, 0x4665517f, 0x547e4662, 0x5a774b69, 0xe090d0b0, 0xee99ddbb, 0xfc82caa6, 0xf28bc7ad, 0xd8b4e49c, 0xd6bde997, 0xc4a6fe8a, 0xcaaff381, 0x90d8b8e8, 0x9ed1b5e3, 0x8ccaa2fe, 0x82c3aff5, 0xa8fc8cc4, 0xa6f581cf, 0xb4ee96d2, 0xbae79bd9, 0xdb3bbb7b, 0xd532b670, 0xc729a16d, 0xc920ac66, 0xe31f8f57, 0xed16825c, 0xff0d9541, 0xf104984a, 0xab73d323, 0xa57ade28, 0xb761c935, 0xb968c43e, 0x9357e70f, 0x9d5eea04, 0x8f45fd19, 0x814cf012, 0x3bab6bcb, 0x35a266c0, 0x27b971dd, 0x29b07cd6, 0x038f5fe7, 0x0d8652ec, 0x1f9d45f1, 0x119448fa, 0x4be30393, 0x45ea0e98, 0x57f11985, 0x59f8148e, 0x73c737bf, 0x7dce3ab4, 0x6fd52da9, 0x61dc20a2, 0xad766df6, 0xa37f60fd, 0xb16477e0, 0xbf6d7aeb, 0x955259da, 0x9b5b54d1, 0x894043cc, 0x87494ec7, 0xdd3e05ae, 0xd33708a5, 0xc12c1fb8, 0xcf2512b3, 0xe51a3182, 0xeb133c89, 0xf9082b94, 0xf701269f, 0x4de6bd46, 0x43efb04d, 0x51f4a750, 0x5ffdaa5b, 0x75c2896a, 0x7bcb8461, 0x69d0937c, 0x67d99e77, 0x3daed51e, 0x33a7d815, 0x21bccf08, 0x2fb5c203, 0x058ae132, 0x0b83ec39, 0x1998fb24, 0x1791f62f, 0x764dd68d, 0x7844db86, 0x6a5fcc9b, 0x6456c190, 0x4e69e2a1, 0x4060efaa, 0x527bf8b7, 0x5c72f5bc, 0x0605bed5, 0x080cb3de, 0x1a17a4c3, 0x141ea9c8, 0x3e218af9, 0x302887f2, 0x223390ef, 0x2c3a9de4, 0x96dd063d, 0x98d40b36, 0x8acf1c2b, 0x84c61120, 0xaef93211, 0xa0f03f1a, 0xb2eb2807, 0xbce2250c, 0xe6956e65, 0xe89c636e, 0xfa877473, 0xf48e7978, 0xdeb15a49, 0xd0b85742, 0xc2a3405f, 0xccaa4d54, 0x41ecdaf7, 0x4fe5d7fc, 0x5dfec0e1, 0x53f7cdea, 0x79c8eedb, 0x77c1e3d0, 0x65daf4cd, 0x6bd3f9c6, 0x31a4b2af, 0x3fadbfa4, 0x2db6a8b9, 0x23bfa5b2, 0x09808683, 0x07898b88, 0x15929c95, 0x1b9b919e, 0xa17c0a47, 0xaf75074c, 0xbd6e1051, 0xb3671d5a, 0x99583e6b, 0x97513360, 0x854a247d, 0x8b432976, 0xd134621f, 0xdf3d6f14, 0xcd267809, 0xc32f7502, 0xe9105633, 0xe7195b38, 0xf5024c25, 0xfb0b412e, 0x9ad7618c, 0x94de6c87, 0x86c57b9a, 0x88cc7691, 0xa2f355a0, 0xacfa58ab, 0xbee14fb6, 0xb0e842bd, 0xea9f09d4, 0xe49604df, 0xf68d13c2, 0xf8841ec9, 0xd2bb3df8, 0xdcb230f3, 0xcea927ee, 0xc0a02ae5, 0x7a47b13c, 0x744ebc37, 0x6655ab2a, 0x685ca621, 0x42638510, 0x4c6a881b, 0x5e719f06, 0x5078920d, 0x0a0fd964, 0x0406d46f, 0x161dc372, 0x1814ce79, 0x322bed48, 0x3c22e043, 0x2e39f75e, 0x2030fa55, 0xec9ab701, 0xe293ba0a, 0xf088ad17, 0xfe81a01c, 0xd4be832d, 0xdab78e26, 0xc8ac993b, 0xc6a59430, 0x9cd2df59, 0x92dbd252, 0x80c0c54f, 0x8ec9c844, 0xa4f6eb75, 0xaaffe67e, 0xb8e4f163, 0xb6edfc68, 0x0c0a67b1, 0x02036aba, 0x10187da7, 0x1e1170ac, 0x342e539d, 0x3a275e96, 0x283c498b, 0x26354480, 0x7c420fe9, 0x724b02e2, 0x605015ff, 0x6e5918f4, 0x44663bc5, 0x4a6f36ce, 0x587421d3, 0x567d2cd8, 0x37a10c7a, 0x39a80171, 0x2bb3166c, 0x25ba1b67, 0x0f853856, 0x018c355d, 0x13972240, 0x1d9e2f4b, 0x47e96422, 0x49e06929, 0x5bfb7e34, 0x55f2733f, 0x7fcd500e, 0x71c45d05, 0x63df4a18, 0x6dd64713, 0xd731dcca, 0xd938d1c1, 0xcb23c6dc, 0xc52acbd7, 0xef15e8e6, 0xe11ce5ed, 0xf307f2f0, 0xfd0efffb, 0xa779b492, 0xa970b999, 0xbb6bae84, 0xb562a38f, 0x9f5d80be, 0x91548db5, 0x834f9aa8, 0x8d4697a3];
      var U2 = [0x00000000, 0x0b0e090d, 0x161c121a, 0x1d121b17, 0x2c382434, 0x27362d39, 0x3a24362e, 0x312a3f23, 0x58704868, 0x537e4165, 0x4e6c5a72, 0x4562537f, 0x74486c5c, 0x7f466551, 0x62547e46, 0x695a774b, 0xb0e090d0, 0xbbee99dd, 0xa6fc82ca, 0xadf28bc7, 0x9cd8b4e4, 0x97d6bde9, 0x8ac4a6fe, 0x81caaff3, 0xe890d8b8, 0xe39ed1b5, 0xfe8ccaa2, 0xf582c3af, 0xc4a8fc8c, 0xcfa6f581, 0xd2b4ee96, 0xd9bae79b, 0x7bdb3bbb, 0x70d532b6, 0x6dc729a1, 0x66c920ac, 0x57e31f8f, 0x5ced1682, 0x41ff0d95, 0x4af10498, 0x23ab73d3, 0x28a57ade, 0x35b761c9, 0x3eb968c4, 0x0f9357e7, 0x049d5eea, 0x198f45fd, 0x12814cf0, 0xcb3bab6b, 0xc035a266, 0xdd27b971, 0xd629b07c, 0xe7038f5f, 0xec0d8652, 0xf11f9d45, 0xfa119448, 0x934be303, 0x9845ea0e, 0x8557f119, 0x8e59f814, 0xbf73c737, 0xb47dce3a, 0xa96fd52d, 0xa261dc20, 0xf6ad766d, 0xfda37f60, 0xe0b16477, 0xebbf6d7a, 0xda955259, 0xd19b5b54, 0xcc894043, 0xc787494e, 0xaedd3e05, 0xa5d33708, 0xb8c12c1f, 0xb3cf2512, 0x82e51a31, 0x89eb133c, 0x94f9082b, 0x9ff70126, 0x464de6bd, 0x4d43efb0, 0x5051f4a7, 0x5b5ffdaa, 0x6a75c289, 0x617bcb84, 0x7c69d093, 0x7767d99e, 0x1e3daed5, 0x1533a7d8, 0x0821bccf, 0x032fb5c2, 0x32058ae1, 0x390b83ec, 0x241998fb, 0x2f1791f6, 0x8d764dd6, 0x867844db, 0x9b6a5fcc, 0x906456c1, 0xa14e69e2, 0xaa4060ef, 0xb7527bf8, 0xbc5c72f5, 0xd50605be, 0xde080cb3, 0xc31a17a4, 0xc8141ea9, 0xf93e218a, 0xf2302887, 0xef223390, 0xe42c3a9d, 0x3d96dd06, 0x3698d40b, 0x2b8acf1c, 0x2084c611, 0x11aef932, 0x1aa0f03f, 0x07b2eb28, 0x0cbce225, 0x65e6956e, 0x6ee89c63, 0x73fa8774, 0x78f48e79, 0x49deb15a, 0x42d0b857, 0x5fc2a340, 0x54ccaa4d, 0xf741ecda, 0xfc4fe5d7, 0xe15dfec0, 0xea53f7cd, 0xdb79c8ee, 0xd077c1e3, 0xcd65daf4, 0xc66bd3f9, 0xaf31a4b2, 0xa43fadbf, 0xb92db6a8, 0xb223bfa5, 0x83098086, 0x8807898b, 0x9515929c, 0x9e1b9b91, 0x47a17c0a, 0x4caf7507, 0x51bd6e10, 0x5ab3671d, 0x6b99583e, 0x60975133, 0x7d854a24, 0x768b4329, 0x1fd13462, 0x14df3d6f, 0x09cd2678, 0x02c32f75, 0x33e91056, 0x38e7195b, 0x25f5024c, 0x2efb0b41, 0x8c9ad761, 0x8794de6c, 0x9a86c57b, 0x9188cc76, 0xa0a2f355, 0xabacfa58, 0xb6bee14f, 0xbdb0e842, 0xd4ea9f09, 0xdfe49604, 0xc2f68d13, 0xc9f8841e, 0xf8d2bb3d, 0xf3dcb230, 0xeecea927, 0xe5c0a02a, 0x3c7a47b1, 0x37744ebc, 0x2a6655ab, 0x21685ca6, 0x10426385, 0x1b4c6a88, 0x065e719f, 0x0d507892, 0x640a0fd9, 0x6f0406d4, 0x72161dc3, 0x791814ce, 0x48322bed, 0x433c22e0, 0x5e2e39f7, 0x552030fa, 0x01ec9ab7, 0x0ae293ba, 0x17f088ad, 0x1cfe81a0, 0x2dd4be83, 0x26dab78e, 0x3bc8ac99, 0x30c6a594, 0x599cd2df, 0x5292dbd2, 0x4f80c0c5, 0x448ec9c8, 0x75a4f6eb, 0x7eaaffe6, 0x63b8e4f1, 0x68b6edfc, 0xb10c0a67, 0xba02036a, 0xa710187d, 0xac1e1170, 0x9d342e53, 0x963a275e, 0x8b283c49, 0x80263544, 0xe97c420f, 0xe2724b02, 0xff605015, 0xf46e5918, 0xc544663b, 0xce4a6f36, 0xd3587421, 0xd8567d2c, 0x7a37a10c, 0x7139a801, 0x6c2bb316, 0x6725ba1b, 0x560f8538, 0x5d018c35, 0x40139722, 0x4b1d9e2f, 0x2247e964, 0x2949e069, 0x345bfb7e, 0x3f55f273, 0x0e7fcd50, 0x0571c45d, 0x1863df4a, 0x136dd647, 0xcad731dc, 0xc1d938d1, 0xdccb23c6, 0xd7c52acb, 0xe6ef15e8, 0xede11ce5, 0xf0f307f2, 0xfbfd0eff, 0x92a779b4, 0x99a970b9, 0x84bb6bae, 0x8fb562a3, 0xbe9f5d80, 0xb591548d, 0xa8834f9a, 0xa38d4697];
      var U3 = [0x00000000, 0x0d0b0e09, 0x1a161c12, 0x171d121b, 0x342c3824, 0x3927362d, 0x2e3a2436, 0x23312a3f, 0x68587048, 0x65537e41, 0x724e6c5a, 0x7f456253, 0x5c74486c, 0x517f4665, 0x4662547e, 0x4b695a77, 0xd0b0e090, 0xddbbee99, 0xcaa6fc82, 0xc7adf28b, 0xe49cd8b4, 0xe997d6bd, 0xfe8ac4a6, 0xf381caaf, 0xb8e890d8, 0xb5e39ed1, 0xa2fe8cca, 0xaff582c3, 0x8cc4a8fc, 0x81cfa6f5, 0x96d2b4ee, 0x9bd9bae7, 0xbb7bdb3b, 0xb670d532, 0xa16dc729, 0xac66c920, 0x8f57e31f, 0x825ced16, 0x9541ff0d, 0x984af104, 0xd323ab73, 0xde28a57a, 0xc935b761, 0xc43eb968, 0xe70f9357, 0xea049d5e, 0xfd198f45, 0xf012814c, 0x6bcb3bab, 0x66c035a2, 0x71dd27b9, 0x7cd629b0, 0x5fe7038f, 0x52ec0d86, 0x45f11f9d, 0x48fa1194, 0x03934be3, 0x0e9845ea, 0x198557f1, 0x148e59f8, 0x37bf73c7, 0x3ab47dce, 0x2da96fd5, 0x20a261dc, 0x6df6ad76, 0x60fda37f, 0x77e0b164, 0x7aebbf6d, 0x59da9552, 0x54d19b5b, 0x43cc8940, 0x4ec78749, 0x05aedd3e, 0x08a5d337, 0x1fb8c12c, 0x12b3cf25, 0x3182e51a, 0x3c89eb13, 0x2b94f908, 0x269ff701, 0xbd464de6, 0xb04d43ef, 0xa75051f4, 0xaa5b5ffd, 0x896a75c2, 0x84617bcb, 0x937c69d0, 0x9e7767d9, 0xd51e3dae, 0xd81533a7, 0xcf0821bc, 0xc2032fb5, 0xe132058a, 0xec390b83, 0xfb241998, 0xf62f1791, 0xd68d764d, 0xdb867844, 0xcc9b6a5f, 0xc1906456, 0xe2a14e69, 0xefaa4060, 0xf8b7527b, 0xf5bc5c72, 0xbed50605, 0xb3de080c, 0xa4c31a17, 0xa9c8141e, 0x8af93e21, 0x87f23028, 0x90ef2233, 0x9de42c3a, 0x063d96dd, 0x0b3698d4, 0x1c2b8acf, 0x112084c6, 0x3211aef9, 0x3f1aa0f0, 0x2807b2eb, 0x250cbce2, 0x6e65e695, 0x636ee89c, 0x7473fa87, 0x7978f48e, 0x5a49deb1, 0x5742d0b8, 0x405fc2a3, 0x4d54ccaa, 0xdaf741ec, 0xd7fc4fe5, 0xc0e15dfe, 0xcdea53f7, 0xeedb79c8, 0xe3d077c1, 0xf4cd65da, 0xf9c66bd3, 0xb2af31a4, 0xbfa43fad, 0xa8b92db6, 0xa5b223bf, 0x86830980, 0x8b880789, 0x9c951592, 0x919e1b9b, 0x0a47a17c, 0x074caf75, 0x1051bd6e, 0x1d5ab367, 0x3e6b9958, 0x33609751, 0x247d854a, 0x29768b43, 0x621fd134, 0x6f14df3d, 0x7809cd26, 0x7502c32f, 0x5633e910, 0x5b38e719, 0x4c25f502, 0x412efb0b, 0x618c9ad7, 0x6c8794de, 0x7b9a86c5, 0x769188cc, 0x55a0a2f3, 0x58abacfa, 0x4fb6bee1, 0x42bdb0e8, 0x09d4ea9f, 0x04dfe496, 0x13c2f68d, 0x1ec9f884, 0x3df8d2bb, 0x30f3dcb2, 0x27eecea9, 0x2ae5c0a0, 0xb13c7a47, 0xbc37744e, 0xab2a6655, 0xa621685c, 0x85104263, 0x881b4c6a, 0x9f065e71, 0x920d5078, 0xd9640a0f, 0xd46f0406, 0xc372161d, 0xce791814, 0xed48322b, 0xe0433c22, 0xf75e2e39, 0xfa552030, 0xb701ec9a, 0xba0ae293, 0xad17f088, 0xa01cfe81, 0x832dd4be, 0x8e26dab7, 0x993bc8ac, 0x9430c6a5, 0xdf599cd2, 0xd25292db, 0xc54f80c0, 0xc8448ec9, 0xeb75a4f6, 0xe67eaaff, 0xf163b8e4, 0xfc68b6ed, 0x67b10c0a, 0x6aba0203, 0x7da71018, 0x70ac1e11, 0x539d342e, 0x5e963a27, 0x498b283c, 0x44802635, 0x0fe97c42, 0x02e2724b, 0x15ff6050, 0x18f46e59, 0x3bc54466, 0x36ce4a6f, 0x21d35874, 0x2cd8567d, 0x0c7a37a1, 0x017139a8, 0x166c2bb3, 0x1b6725ba, 0x38560f85, 0x355d018c, 0x22401397, 0x2f4b1d9e, 0x642247e9, 0x692949e0, 0x7e345bfb, 0x733f55f2, 0x500e7fcd, 0x5d0571c4, 0x4a1863df, 0x47136dd6, 0xdccad731, 0xd1c1d938, 0xc6dccb23, 0xcbd7c52a, 0xe8e6ef15, 0xe5ede11c, 0xf2f0f307, 0xfffbfd0e, 0xb492a779, 0xb999a970, 0xae84bb6b, 0xa38fb562, 0x80be9f5d, 0x8db59154, 0x9aa8834f, 0x97a38d46];
      var U4 = [0x00000000, 0x090d0b0e, 0x121a161c, 0x1b171d12, 0x24342c38, 0x2d392736, 0x362e3a24, 0x3f23312a, 0x48685870, 0x4165537e, 0x5a724e6c, 0x537f4562, 0x6c5c7448, 0x65517f46, 0x7e466254, 0x774b695a, 0x90d0b0e0, 0x99ddbbee, 0x82caa6fc, 0x8bc7adf2, 0xb4e49cd8, 0xbde997d6, 0xa6fe8ac4, 0xaff381ca, 0xd8b8e890, 0xd1b5e39e, 0xcaa2fe8c, 0xc3aff582, 0xfc8cc4a8, 0xf581cfa6, 0xee96d2b4, 0xe79bd9ba, 0x3bbb7bdb, 0x32b670d5, 0x29a16dc7, 0x20ac66c9, 0x1f8f57e3, 0x16825ced, 0x0d9541ff, 0x04984af1, 0x73d323ab, 0x7ade28a5, 0x61c935b7, 0x68c43eb9, 0x57e70f93, 0x5eea049d, 0x45fd198f, 0x4cf01281, 0xab6bcb3b, 0xa266c035, 0xb971dd27, 0xb07cd629, 0x8f5fe703, 0x8652ec0d, 0x9d45f11f, 0x9448fa11, 0xe303934b, 0xea0e9845, 0xf1198557, 0xf8148e59, 0xc737bf73, 0xce3ab47d, 0xd52da96f, 0xdc20a261, 0x766df6ad, 0x7f60fda3, 0x6477e0b1, 0x6d7aebbf, 0x5259da95, 0x5b54d19b, 0x4043cc89, 0x494ec787, 0x3e05aedd, 0x3708a5d3, 0x2c1fb8c1, 0x2512b3cf, 0x1a3182e5, 0x133c89eb, 0x082b94f9, 0x01269ff7, 0xe6bd464d, 0xefb04d43, 0xf4a75051, 0xfdaa5b5f, 0xc2896a75, 0xcb84617b, 0xd0937c69, 0xd99e7767, 0xaed51e3d, 0xa7d81533, 0xbccf0821, 0xb5c2032f, 0x8ae13205, 0x83ec390b, 0x98fb2419, 0x91f62f17, 0x4dd68d76, 0x44db8678, 0x5fcc9b6a, 0x56c19064, 0x69e2a14e, 0x60efaa40, 0x7bf8b752, 0x72f5bc5c, 0x05bed506, 0x0cb3de08, 0x17a4c31a, 0x1ea9c814, 0x218af93e, 0x2887f230, 0x3390ef22, 0x3a9de42c, 0xdd063d96, 0xd40b3698, 0xcf1c2b8a, 0xc6112084, 0xf93211ae, 0xf03f1aa0, 0xeb2807b2, 0xe2250cbc, 0x956e65e6, 0x9c636ee8, 0x877473fa, 0x8e7978f4, 0xb15a49de, 0xb85742d0, 0xa3405fc2, 0xaa4d54cc, 0xecdaf741, 0xe5d7fc4f, 0xfec0e15d, 0xf7cdea53, 0xc8eedb79, 0xc1e3d077, 0xdaf4cd65, 0xd3f9c66b, 0xa4b2af31, 0xadbfa43f, 0xb6a8b92d, 0xbfa5b223, 0x80868309, 0x898b8807, 0x929c9515, 0x9b919e1b, 0x7c0a47a1, 0x75074caf, 0x6e1051bd, 0x671d5ab3, 0x583e6b99, 0x51336097, 0x4a247d85, 0x4329768b, 0x34621fd1, 0x3d6f14df, 0x267809cd, 0x2f7502c3, 0x105633e9, 0x195b38e7, 0x024c25f5, 0x0b412efb, 0xd7618c9a, 0xde6c8794, 0xc57b9a86, 0xcc769188, 0xf355a0a2, 0xfa58abac, 0xe14fb6be, 0xe842bdb0, 0x9f09d4ea, 0x9604dfe4, 0x8d13c2f6, 0x841ec9f8, 0xbb3df8d2, 0xb230f3dc, 0xa927eece, 0xa02ae5c0, 0x47b13c7a, 0x4ebc3774, 0x55ab2a66, 0x5ca62168, 0x63851042, 0x6a881b4c, 0x719f065e, 0x78920d50, 0x0fd9640a, 0x06d46f04, 0x1dc37216, 0x14ce7918, 0x2bed4832, 0x22e0433c, 0x39f75e2e, 0x30fa5520, 0x9ab701ec, 0x93ba0ae2, 0x88ad17f0, 0x81a01cfe, 0xbe832dd4, 0xb78e26da, 0xac993bc8, 0xa59430c6, 0xd2df599c, 0xdbd25292, 0xc0c54f80, 0xc9c8448e, 0xf6eb75a4, 0xffe67eaa, 0xe4f163b8, 0xedfc68b6, 0x0a67b10c, 0x036aba02, 0x187da710, 0x1170ac1e, 0x2e539d34, 0x275e963a, 0x3c498b28, 0x35448026, 0x420fe97c, 0x4b02e272, 0x5015ff60, 0x5918f46e, 0x663bc544, 0x6f36ce4a, 0x7421d358, 0x7d2cd856, 0xa10c7a37, 0xa8017139, 0xb3166c2b, 0xba1b6725, 0x8538560f, 0x8c355d01, 0x97224013, 0x9e2f4b1d, 0xe9642247, 0xe0692949, 0xfb7e345b, 0xf2733f55, 0xcd500e7f, 0xc45d0571, 0xdf4a1863, 0xd647136d, 0x31dccad7, 0x38d1c1d9, 0x23c6dccb, 0x2acbd7c5, 0x15e8e6ef, 0x1ce5ede1, 0x07f2f0f3, 0x0efffbfd, 0x79b492a7, 0x70b999a9, 0x6bae84bb, 0x62a38fb5, 0x5d80be9f, 0x548db591, 0x4f9aa883, 0x4697a38d];
  
      function convertToInt32(bytes) {
          var result = [];
          for (var i = 0; i < bytes.length; i += 4) {
              result.push(
                  (bytes[i    ] << 24) |
                  (bytes[i + 1] << 16) |
                  (bytes[i + 2] <<  8) |
                   bytes[i + 3]
              );
          }
          return result;
      }
  
      var AES = function(key) {
          if (!(this instanceof AES)) {
              throw Error('AES must be instanitated with `new`');
          }
  
          Object.defineProperty(this, 'key', {
              value: coerceArray(key, true)
          });
  
          this._prepare();
      }
  
  
      AES.prototype._prepare = function() {
  
          var rounds = numberOfRounds[this.key.length];
          if (rounds == null) {
              throw new Error('invalid key size (must be 16, 24 or 32 bytes)');
          }
  
          // encryption round keys
          this._Ke = [];
  
          // decryption round keys
          this._Kd = [];
  
          for (var i = 0; i <= rounds; i++) {
              this._Ke.push([0, 0, 0, 0]);
              this._Kd.push([0, 0, 0, 0]);
          }
  
          var roundKeyCount = (rounds + 1) * 4;
          var KC = this.key.length / 4;
  
          // convert the key into ints
          var tk = convertToInt32(this.key);
  
          // copy values into round key arrays
          var index;
          for (var i = 0; i < KC; i++) {
              index = i >> 2;
              this._Ke[index][i % 4] = tk[i];
              this._Kd[rounds - index][i % 4] = tk[i];
          }
  
          // key expansion (fips-197 section 5.2)
          var rconpointer = 0;
          var t = KC, tt;
          while (t < roundKeyCount) {
              tt = tk[KC - 1];
              tk[0] ^= ((S[(tt >> 16) & 0xFF] << 24) ^
                        (S[(tt >>  8) & 0xFF] << 16) ^
                        (S[ tt        & 0xFF] <<  8) ^
                         S[(tt >> 24) & 0xFF]        ^
                        (rcon[rconpointer] << 24));
              rconpointer += 1;
  
              // key expansion (for non-256 bit)
              if (KC != 8) {
                  for (var i = 1; i < KC; i++) {
                      tk[i] ^= tk[i - 1];
                  }
  
              // key expansion for 256-bit keys is "slightly different" (fips-197)
              } else {
                  for (var i = 1; i < (KC / 2); i++) {
                      tk[i] ^= tk[i - 1];
                  }
                  tt = tk[(KC / 2) - 1];
  
                  tk[KC / 2] ^= (S[ tt        & 0xFF]        ^
                                (S[(tt >>  8) & 0xFF] <<  8) ^
                                (S[(tt >> 16) & 0xFF] << 16) ^
                                (S[(tt >> 24) & 0xFF] << 24));
  
                  for (var i = (KC / 2) + 1; i < KC; i++) {
                      tk[i] ^= tk[i - 1];
                  }
              }
  
              // copy values into round key arrays
              var i = 0, r, c;
              while (i < KC && t < roundKeyCount) {
                  r = t >> 2;
                  c = t % 4;
                  this._Ke[r][c] = tk[i];
                  this._Kd[rounds - r][c] = tk[i++];
                  t++;
              }
          }
  
          // inverse-cipher-ify the decryption round key (fips-197 section 5.3)
          for (var r = 1; r < rounds; r++) {
              for (var c = 0; c < 4; c++) {
                  tt = this._Kd[r][c];
                  this._Kd[r][c] = (U1[(tt >> 24) & 0xFF] ^
                                    U2[(tt >> 16) & 0xFF] ^
                                    U3[(tt >>  8) & 0xFF] ^
                                    U4[ tt        & 0xFF]);
              }
          }
      }
  
      AES.prototype.encrypt = function(plaintext) {
          if (plaintext.length != 16) {
              throw new Error('invalid plaintext size (must be 16 bytes)');
          }
  
          var rounds = this._Ke.length - 1;
          var a = [0, 0, 0, 0];
  
          // convert plaintext to (ints ^ key)
          var t = convertToInt32(plaintext);
          for (var i = 0; i < 4; i++) {
              t[i] ^= this._Ke[0][i];
          }
  
          // apply round transforms
          for (var r = 1; r < rounds; r++) {
              for (var i = 0; i < 4; i++) {
                  a[i] = (T1[(t[ i         ] >> 24) & 0xff] ^
                          T2[(t[(i + 1) % 4] >> 16) & 0xff] ^
                          T3[(t[(i + 2) % 4] >>  8) & 0xff] ^
                          T4[ t[(i + 3) % 4]        & 0xff] ^
                          this._Ke[r][i]);
              }
              t = a.slice();
          }
  
          // the last round is special
          var result = createArray(16), tt;
          for (var i = 0; i < 4; i++) {
              tt = this._Ke[rounds][i];
              result[4 * i    ] = (S[(t[ i         ] >> 24) & 0xff] ^ (tt >> 24)) & 0xff;
              result[4 * i + 1] = (S[(t[(i + 1) % 4] >> 16) & 0xff] ^ (tt >> 16)) & 0xff;
              result[4 * i + 2] = (S[(t[(i + 2) % 4] >>  8) & 0xff] ^ (tt >>  8)) & 0xff;
              result[4 * i + 3] = (S[ t[(i + 3) % 4]        & 0xff] ^  tt       ) & 0xff;
          }
  
          return result;
      }
  
      AES.prototype.decrypt = function(ciphertext) {
          if (ciphertext.length != 16) {
              throw new Error('invalid ciphertext size (must be 16 bytes)');
          }
  
          var rounds = this._Kd.length - 1;
          var a = [0, 0, 0, 0];
  
          // convert plaintext to (ints ^ key)
          var t = convertToInt32(ciphertext);
          for (var i = 0; i < 4; i++) {
              t[i] ^= this._Kd[0][i];
          }
  
          // apply round transforms
          for (var r = 1; r < rounds; r++) {
              for (var i = 0; i < 4; i++) {
                  a[i] = (T5[(t[ i          ] >> 24) & 0xff] ^
                          T6[(t[(i + 3) % 4] >> 16) & 0xff] ^
                          T7[(t[(i + 2) % 4] >>  8) & 0xff] ^
                          T8[ t[(i + 1) % 4]        & 0xff] ^
                          this._Kd[r][i]);
              }
              t = a.slice();
          }
  
          // the last round is special
          var result = createArray(16), tt;
          for (var i = 0; i < 4; i++) {
              tt = this._Kd[rounds][i];
              result[4 * i    ] = (Si[(t[ i         ] >> 24) & 0xff] ^ (tt >> 24)) & 0xff;
              result[4 * i + 1] = (Si[(t[(i + 3) % 4] >> 16) & 0xff] ^ (tt >> 16)) & 0xff;
              result[4 * i + 2] = (Si[(t[(i + 2) % 4] >>  8) & 0xff] ^ (tt >>  8)) & 0xff;
              result[4 * i + 3] = (Si[ t[(i + 1) % 4]        & 0xff] ^  tt       ) & 0xff;
          }
  
          return result;
      }
  
  
      /**
       *  Mode Of Operation - Electonic Codebook (ECB)
       */
      var ModeOfOperationECB = function(key) {
          if (!(this instanceof ModeOfOperationECB)) {
              throw Error('AES must be instanitated with `new`');
          }
  
          this.description = "Electronic Code Block";
          this.name = "ecb";
  
          this._aes = new AES(key);
      }
  
      ModeOfOperationECB.prototype.encrypt = function(plaintext) {
          plaintext = coerceArray(plaintext);
  
          if ((plaintext.length % 16) !== 0) {
              throw new Error('invalid plaintext size (must be multiple of 16 bytes)');
          }
  
          var ciphertext = createArray(plaintext.length);
          var block = createArray(16);
  
          for (var i = 0; i < plaintext.length; i += 16) {
              copyArray(plaintext, block, 0, i, i + 16);
              block = this._aes.encrypt(block);
              copyArray(block, ciphertext, i);
          }
  
          return ciphertext;
      }
  
      ModeOfOperationECB.prototype.decrypt = function(ciphertext) {
          ciphertext = coerceArray(ciphertext);
  
          if ((ciphertext.length % 16) !== 0) {
              throw new Error('invalid ciphertext size (must be multiple of 16 bytes)');
          }
  
          var plaintext = createArray(ciphertext.length);
          var block = createArray(16);
  
          for (var i = 0; i < ciphertext.length; i += 16) {
              copyArray(ciphertext, block, 0, i, i + 16);
              block = this._aes.decrypt(block);
              copyArray(block, plaintext, i);
          }
  
          return plaintext;
      }
  
  
      /**
       *  Mode Of Operation - Cipher Block Chaining (CBC)
       */
      var ModeOfOperationCBC = function(key, iv) {
          if (!(this instanceof ModeOfOperationCBC)) {
              throw Error('AES must be instanitated with `new`');
          }
  
          this.description = "Cipher Block Chaining";
          this.name = "cbc";
  
          if (!iv) {
              iv = createArray(16);
  
          } else if (iv.length != 16) {
              throw new Error('invalid initialation vector size (must be 16 bytes)');
          }
  
          this._lastCipherblock = coerceArray(iv, true);
  
          this._aes = new AES(key);
      }
  
      ModeOfOperationCBC.prototype.encrypt = function(plaintext) {
          plaintext = coerceArray(plaintext);
  
          if ((plaintext.length % 16) !== 0) {
              throw new Error('invalid plaintext size (must be multiple of 16 bytes)');
          }
  
          var ciphertext = createArray(plaintext.length);
          var block = createArray(16);
  
          for (var i = 0; i < plaintext.length; i += 16) {
              copyArray(plaintext, block, 0, i, i + 16);
  
              for (var j = 0; j < 16; j++) {
                  block[j] ^= this._lastCipherblock[j];
              }
  
              this._lastCipherblock = this._aes.encrypt(block);
              copyArray(this._lastCipherblock, ciphertext, i);
          }
  
          return ciphertext;
      }
  
      ModeOfOperationCBC.prototype.decrypt = function(ciphertext) {
          ciphertext = coerceArray(ciphertext);
  
          if ((ciphertext.length % 16) !== 0) {
              throw new Error('invalid ciphertext size (must be multiple of 16 bytes)');
          }
  
          var plaintext = createArray(ciphertext.length);
          var block = createArray(16);
  
          for (var i = 0; i < ciphertext.length; i += 16) {
              copyArray(ciphertext, block, 0, i, i + 16);
              block = this._aes.decrypt(block);
  
              for (var j = 0; j < 16; j++) {
                  plaintext[i + j] = block[j] ^ this._lastCipherblock[j];
              }
  
              copyArray(ciphertext, this._lastCipherblock, 0, i, i + 16);
          }
  
          return plaintext;
      }
  
  
      /**
       *  Mode Of Operation - Cipher Feedback (CFB)
       */
      var ModeOfOperationCFB = function(key, iv, segmentSize) {
          if (!(this instanceof ModeOfOperationCFB)) {
              throw Error('AES must be instanitated with `new`');
          }
  
          this.description = "Cipher Feedback";
          this.name = "cfb";
  
          if (!iv) {
              iv = createArray(16);
  
          } else if (iv.length != 16) {
              throw new Error('invalid initialation vector size (must be 16 size)');
          }
  
          if (!segmentSize) { segmentSize = 1; }
  
          this.segmentSize = segmentSize;
  
          this._shiftRegister = coerceArray(iv, true);
  
          this._aes = new AES(key);
      }
  
      ModeOfOperationCFB.prototype.encrypt = function(plaintext) {
          if ((plaintext.length % this.segmentSize) != 0) {
              throw new Error('invalid plaintext size (must be segmentSize bytes)');
          }
  
          var encrypted = coerceArray(plaintext, true);
  
          var xorSegment;
          for (var i = 0; i < encrypted.length; i += this.segmentSize) {
              xorSegment = this._aes.encrypt(this._shiftRegister);
              for (var j = 0; j < this.segmentSize; j++) {
                  encrypted[i + j] ^= xorSegment[j];
              }
  
              // Shift the register
              copyArray(this._shiftRegister, this._shiftRegister, 0, this.segmentSize);
              copyArray(encrypted, this._shiftRegister, 16 - this.segmentSize, i, i + this.segmentSize);
          }
  
          return encrypted;
      }
  
      ModeOfOperationCFB.prototype.decrypt = function(ciphertext) {
          if ((ciphertext.length % this.segmentSize) != 0) {
              throw new Error('invalid ciphertext size (must be segmentSize bytes)');
          }
  
          var plaintext = coerceArray(ciphertext, true);
  
          var xorSegment;
          for (var i = 0; i < plaintext.length; i += this.segmentSize) {
              xorSegment = this._aes.encrypt(this._shiftRegister);
  
              for (var j = 0; j < this.segmentSize; j++) {
                  plaintext[i + j] ^= xorSegment[j];
              }
  
              // Shift the register
              copyArray(this._shiftRegister, this._shiftRegister, 0, this.segmentSize);
              copyArray(ciphertext, this._shiftRegister, 16 - this.segmentSize, i, i + this.segmentSize);
          }
  
          return plaintext;
      }
  
      /**
       *  Mode Of Operation - Output Feedback (OFB)
       */
      var ModeOfOperationOFB = function(key, iv) {
          if (!(this instanceof ModeOfOperationOFB)) {
              throw Error('AES must be instanitated with `new`');
          }
  
          this.description = "Output Feedback";
          this.name = "ofb";
  
          if (!iv) {
              iv = createArray(16);
  
          } else if (iv.length != 16) {
              throw new Error('invalid initialation vector size (must be 16 bytes)');
          }
  
          this._lastPrecipher = coerceArray(iv, true);
          this._lastPrecipherIndex = 16;
  
          this._aes = new AES(key);
      }
  
      ModeOfOperationOFB.prototype.encrypt = function(plaintext) {
          var encrypted = coerceArray(plaintext, true);
  
          for (var i = 0; i < encrypted.length; i++) {
              if (this._lastPrecipherIndex === 16) {
                  this._lastPrecipher = this._aes.encrypt(this._lastPrecipher);
                  this._lastPrecipherIndex = 0;
              }
              encrypted[i] ^= this._lastPrecipher[this._lastPrecipherIndex++];
          }
  
          return encrypted;
      }
  
      // Decryption is symetric
      ModeOfOperationOFB.prototype.decrypt = ModeOfOperationOFB.prototype.encrypt;
  
  
      /**
       *  Counter object for CTR common mode of operation
       */
      var Counter = function(initialValue) {
          if (!(this instanceof Counter)) {
              throw Error('Counter must be instanitated with `new`');
          }
  
          // We allow 0, but anything false-ish uses the default 1
          if (initialValue !== 0 && !initialValue) { initialValue = 1; }
  
          if (typeof(initialValue) === 'number') {
              this._counter = createArray(16);
              this.setValue(initialValue);
  
          } else {
              this.setBytes(initialValue);
          }
      }
  
      Counter.prototype.setValue = function(value) {
          if (typeof(value) !== 'number' || parseInt(value) != value) {
              throw new Error('invalid counter value (must be an integer)');
          }
  
          for (var index = 15; index >= 0; --index) {
              this._counter[index] = value % 256;
              value = value >> 8;
          }
      }
  
      Counter.prototype.setBytes = function(bytes) {
          bytes = coerceArray(bytes, true);
  
          if (bytes.length != 16) {
              throw new Error('invalid counter bytes size (must be 16 bytes)');
          }
  
          this._counter = bytes;
      };
  
      Counter.prototype.increment = function() {
          for (var i = 15; i >= 0; i--) {
              if (this._counter[i] === 255) {
                  this._counter[i] = 0;
              } else {
                  this._counter[i]++;
                  break;
              }
          }
      }
  
  
      /**
       *  Mode Of Operation - Counter (CTR)
       */
      var ModeOfOperationCTR = function(key, counter) {
          if (!(this instanceof ModeOfOperationCTR)) {
              throw Error('AES must be instanitated with `new`');
          }
  
          this.description = "Counter";
          this.name = "ctr";
  
          if (!(counter instanceof Counter)) {
              counter = new Counter(counter)
          }
  
          this._counter = counter;
  
          this._remainingCounter = null;
          this._remainingCounterIndex = 16;
  
          this._aes = new AES(key);
      }
  
      ModeOfOperationCTR.prototype.encrypt = function(plaintext) {
          var encrypted = coerceArray(plaintext, true);
  
          for (var i = 0; i < encrypted.length; i++) {
              if (this._remainingCounterIndex === 16) {
                  this._remainingCounter = this._aes.encrypt(this._counter._counter);
                  this._remainingCounterIndex = 0;
                  this._counter.increment();
              }
              encrypted[i] ^= this._remainingCounter[this._remainingCounterIndex++];
          }
  
          return encrypted;
      }
  
      // Decryption is symetric
      ModeOfOperationCTR.prototype.decrypt = ModeOfOperationCTR.prototype.encrypt;
  
  
      ///////////////////////
      // Padding
  
      // See:https://tools.ietf.org/html/rfc2315
      function pkcs7pad(data) {
          data = coerceArray(data, true);
          var padder = 16 - (data.length % 16);
          var result = createArray(data.length + padder);
          copyArray(data, result);
          for (var i = data.length; i < result.length; i++) {
              result[i] = padder;
          }
          return result;
      }
  
      function pkcs7strip(data) {
          data = coerceArray(data, true);
          if (data.length < 16) { throw new Error('PKCS#7 invalid length'); }
  
          var padder = data[data.length - 1];
          if (padder > 16) { throw new Error('PKCS#7 padding byte out of range'); }
  
          var length = data.length - padder;
          for (var i = 0; i < padder; i++) {
              if (data[length + i] !== padder) {
                  throw new Error('PKCS#7 invalid padding byte');
              }
          }
  
          var result = createArray(length);
          copyArray(data, result, 0, 0, length);
          return result;
      }
  
      ///////////////////////
      // Exporting
  
  
      // The block cipher
      var aesjs = {
          AES: AES,
          Counter: Counter,
  
          ModeOfOperation: {
              ecb: ModeOfOperationECB,
              cbc: ModeOfOperationCBC,
              cfb: ModeOfOperationCFB,
              ofb: ModeOfOperationOFB,
              ctr: ModeOfOperationCTR
          },
  
          utils: {
              hex: convertHex,
              utf8: convertUtf8
          },
  
          padding: {
              pkcs7: {
                  pad: pkcs7pad,
                  strip: pkcs7strip
              }
          },
  
          _arrayTest: {
              coerceArray: coerceArray,
              createArray: createArray,
              copyArray: copyArray,
          }
      };
  
  
      // node.js
      if (typeof exports !== 'undefined') {
          module.exports = aesjs
  
      // RequireJS/AMD
      // http://www.requirejs.org/docs/api.html
      // https://github.com/amdjs/amdjs-api/wiki/AMD
      } else if (typeof(define) === 'function' && define.amd) {
          define(aesjs);
  
      // Web Browsers
      } else {
  
          // If there was an existing library at "aesjs" make sure it's still available
          if (root.aesjs) {
              aesjs._aesjs = root.aesjs;
          }
  
          root.aesjs = aesjs;
      }
  
  
  })(this);
  
  },{}],8:[function(require,module,exports){
  (function (module, exports) {
    'use strict';
  
    // Utils
    function assert (val, msg) {
      if (!val) throw new Error(msg || 'Assertion failed');
    }
  
    // Could use `inherits` module, but don't want to move from single file
    // architecture yet.
    function inherits (ctor, superCtor) {
      ctor.super_ = superCtor;
      var TempCtor = function () {};
      TempCtor.prototype = superCtor.prototype;
      ctor.prototype = new TempCtor();
      ctor.prototype.constructor = ctor;
    }
  
    // BN
  
    function BN (number, base, endian) {
      if (BN.isBN(number)) {
        return number;
      }
  
      this.negative = 0;
      this.words = null;
      this.length = 0;
  
      // Reduction context
      this.red = null;
  
      if (number !== null) {
        if (base === 'le' || base === 'be') {
          endian = base;
          base = 10;
        }
  
        this._init(number || 0, base || 10, endian || 'be');
      }
    }
    if (typeof module === 'object') {
      module.exports = BN;
    } else {
      exports.BN = BN;
    }
  
    BN.BN = BN;
    BN.wordSize = 26;
  
    var Buffer;
    try {
      Buffer = require('buffer').Buffer;
    } catch (e) {
    }
  
    BN.isBN = function isBN (num) {
      if (num instanceof BN) {
        return true;
      }
  
      return num !== null && typeof num === 'object' &&
        num.constructor.wordSize === BN.wordSize && Array.isArray(num.words);
    };
  
    BN.max = function max (left, right) {
      if (left.cmp(right) > 0) return left;
      return right;
    };
  
    BN.min = function min (left, right) {
      if (left.cmp(right) < 0) return left;
      return right;
    };
  
    BN.prototype._init = function init (number, base, endian) {
      if (typeof number === 'number') {
        return this._initNumber(number, base, endian);
      }
  
      if (typeof number === 'object') {
        return this._initArray(number, base, endian);
      }
  
      if (base === 'hex') {
        base = 16;
      }
      assert(base === (base | 0) && base >= 2 && base <= 36);
  
      number = number.toString().replace(/\s+/g, '');
      var start = 0;
      if (number[0] === '-') {
        start++;
      }
  
      if (base === 16) {
        this._parseHex(number, start);
      } else {
        this._parseBase(number, base, start);
      }
  
      if (number[0] === '-') {
        this.negative = 1;
      }
  
      this.strip();
  
      if (endian !== 'le') return;
  
      this._initArray(this.toArray(), base, endian);
    };
  
    BN.prototype._initNumber = function _initNumber (number, base, endian) {
      if (number < 0) {
        this.negative = 1;
        number = -number;
      }
      if (number < 0x4000000) {
        this.words = [ number & 0x3ffffff ];
        this.length = 1;
      } else if (number < 0x10000000000000) {
        this.words = [
          number & 0x3ffffff,
          (number / 0x4000000) & 0x3ffffff
        ];
        this.length = 2;
      } else {
        assert(number < 0x20000000000000); // 2 ^ 53 (unsafe)
        this.words = [
          number & 0x3ffffff,
          (number / 0x4000000) & 0x3ffffff,
          1
        ];
        this.length = 3;
      }
  
      if (endian !== 'le') return;
  
      // Reverse the bytes
      this._initArray(this.toArray(), base, endian);
    };
  
    BN.prototype._initArray = function _initArray (number, base, endian) {
      // Perhaps a Uint8Array
      assert(typeof number.length === 'number');
      if (number.length <= 0) {
        this.words = [ 0 ];
        this.length = 1;
        return this;
      }
  
      this.length = Math.ceil(number.length / 3);
      this.words = new Array(this.length);
      for (var i = 0; i < this.length; i++) {
        this.words[i] = 0;
      }
  
      var j, w;
      var off = 0;
      if (endian === 'be') {
        for (i = number.length - 1, j = 0; i >= 0; i -= 3) {
          w = number[i] | (number[i - 1] << 8) | (number[i - 2] << 16);
          this.words[j] |= (w << off) & 0x3ffffff;
          this.words[j + 1] = (w >>> (26 - off)) & 0x3ffffff;
          off += 24;
          if (off >= 26) {
            off -= 26;
            j++;
          }
        }
      } else if (endian === 'le') {
        for (i = 0, j = 0; i < number.length; i += 3) {
          w = number[i] | (number[i + 1] << 8) | (number[i + 2] << 16);
          this.words[j] |= (w << off) & 0x3ffffff;
          this.words[j + 1] = (w >>> (26 - off)) & 0x3ffffff;
          off += 24;
          if (off >= 26) {
            off -= 26;
            j++;
          }
        }
      }
      return this.strip();
    };
  
    function parseHex (str, start, end) {
      var r = 0;
      var len = Math.min(str.length, end);
      for (var i = start; i < len; i++) {
        var c = str.charCodeAt(i) - 48;
  
        r <<= 4;
  
        // 'a' - 'f'
        if (c >= 49 && c <= 54) {
          r |= c - 49 + 0xa;
  
        // 'A' - 'F'
        } else if (c >= 17 && c <= 22) {
          r |= c - 17 + 0xa;
  
        // '0' - '9'
        } else {
          r |= c & 0xf;
        }
      }
      return r;
    }
  
    BN.prototype._parseHex = function _parseHex (number, start) {
      // Create possibly bigger array to ensure that it fits the number
      this.length = Math.ceil((number.length - start) / 6);
      this.words = new Array(this.length);
      for (var i = 0; i < this.length; i++) {
        this.words[i] = 0;
      }
  
      var j, w;
      // Scan 24-bit chunks and add them to the number
      var off = 0;
      for (i = number.length - 6, j = 0; i >= start; i -= 6) {
        w = parseHex(number, i, i + 6);
        this.words[j] |= (w << off) & 0x3ffffff;
        // NOTE: `0x3fffff` is intentional here, 26bits max shift + 24bit hex limb
        this.words[j + 1] |= w >>> (26 - off) & 0x3fffff;
        off += 24;
        if (off >= 26) {
          off -= 26;
          j++;
        }
      }
      if (i + 6 !== start) {
        w = parseHex(number, start, i + 6);
        this.words[j] |= (w << off) & 0x3ffffff;
        this.words[j + 1] |= w >>> (26 - off) & 0x3fffff;
      }
      this.strip();
    };
  
    function parseBase (str, start, end, mul) {
      var r = 0;
      var len = Math.min(str.length, end);
      for (var i = start; i < len; i++) {
        var c = str.charCodeAt(i) - 48;
  
        r *= mul;
  
        // 'a'
        if (c >= 49) {
          r += c - 49 + 0xa;
  
        // 'A'
        } else if (c >= 17) {
          r += c - 17 + 0xa;
  
        // '0' - '9'
        } else {
          r += c;
        }
      }
      return r;
    }
  
    BN.prototype._parseBase = function _parseBase (number, base, start) {
      // Initialize as zero
      this.words = [ 0 ];
      this.length = 1;
  
      // Find length of limb in base
      for (var limbLen = 0, limbPow = 1; limbPow <= 0x3ffffff; limbPow *= base) {
        limbLen++;
      }
      limbLen--;
      limbPow = (limbPow / base) | 0;
  
      var total = number.length - start;
      var mod = total % limbLen;
      var end = Math.min(total, total - mod) + start;
  
      var word = 0;
      for (var i = start; i < end; i += limbLen) {
        word = parseBase(number, i, i + limbLen, base);
  
        this.imuln(limbPow);
        if (this.words[0] + word < 0x4000000) {
          this.words[0] += word;
        } else {
          this._iaddn(word);
        }
      }
  
      if (mod !== 0) {
        var pow = 1;
        word = parseBase(number, i, number.length, base);
  
        for (i = 0; i < mod; i++) {
          pow *= base;
        }
  
        this.imuln(pow);
        if (this.words[0] + word < 0x4000000) {
          this.words[0] += word;
        } else {
          this._iaddn(word);
        }
      }
    };
  
    BN.prototype.copy = function copy (dest) {
      dest.words = new Array(this.length);
      for (var i = 0; i < this.length; i++) {
        dest.words[i] = this.words[i];
      }
      dest.length = this.length;
      dest.negative = this.negative;
      dest.red = this.red;
    };
  
    BN.prototype.clone = function clone () {
      var r = new BN(null);
      this.copy(r);
      return r;
    };
  
    BN.prototype._expand = function _expand (size) {
      while (this.length < size) {
        this.words[this.length++] = 0;
      }
      return this;
    };
  
    // Remove leading `0` from `this`
    BN.prototype.strip = function strip () {
      while (this.length > 1 && this.words[this.length - 1] === 0) {
        this.length--;
      }
      return this._normSign();
    };
  
    BN.prototype._normSign = function _normSign () {
      // -0 = 0
      if (this.length === 1 && this.words[0] === 0) {
        this.negative = 0;
      }
      return this;
    };
  
    BN.prototype.inspect = function inspect () {
      return (this.red ? '<BN-R: ' : '<BN: ') + this.toString(16) + '>';
    };
  
    /*
  
    var zeros = [];
    var groupSizes = [];
    var groupBases = [];
  
    var s = '';
    var i = -1;
    while (++i < BN.wordSize) {
      zeros[i] = s;
      s += '0';
    }
    groupSizes[0] = 0;
    groupSizes[1] = 0;
    groupBases[0] = 0;
    groupBases[1] = 0;
    var base = 2 - 1;
    while (++base < 36 + 1) {
      var groupSize = 0;
      var groupBase = 1;
      while (groupBase < (1 << BN.wordSize) / base) {
        groupBase *= base;
        groupSize += 1;
      }
      groupSizes[base] = groupSize;
      groupBases[base] = groupBase;
    }
  
    */
  
    var zeros = [
      '',
      '0',
      '00',
      '000',
      '0000',
      '00000',
      '000000',
      '0000000',
      '00000000',
      '000000000',
      '0000000000',
      '00000000000',
      '000000000000',
      '0000000000000',
      '00000000000000',
      '000000000000000',
      '0000000000000000',
      '00000000000000000',
      '000000000000000000',
      '0000000000000000000',
      '00000000000000000000',
      '000000000000000000000',
      '0000000000000000000000',
      '00000000000000000000000',
      '000000000000000000000000',
      '0000000000000000000000000'
    ];
  
    var groupSizes = [
      0, 0,
      25, 16, 12, 11, 10, 9, 8,
      8, 7, 7, 7, 7, 6, 6,
      6, 6, 6, 6, 6, 5, 5,
      5, 5, 5, 5, 5, 5, 5,
      5, 5, 5, 5, 5, 5, 5
    ];
  
    var groupBases = [
      0, 0,
      33554432, 43046721, 16777216, 48828125, 60466176, 40353607, 16777216,
      43046721, 10000000, 19487171, 35831808, 62748517, 7529536, 11390625,
      16777216, 24137569, 34012224, 47045881, 64000000, 4084101, 5153632,
      6436343, 7962624, 9765625, 11881376, 14348907, 17210368, 20511149,
      24300000, 28629151, 33554432, 39135393, 45435424, 52521875, 60466176
    ];
  
    BN.prototype.toString = function toString (base, padding) {
      base = base || 10;
      padding = padding | 0 || 1;
  
      var out;
      if (base === 16 || base === 'hex') {
        out = '';
        var off = 0;
        var carry = 0;
        for (var i = 0; i < this.length; i++) {
          var w = this.words[i];
          var word = (((w << off) | carry) & 0xffffff).toString(16);
          carry = (w >>> (24 - off)) & 0xffffff;
          if (carry !== 0 || i !== this.length - 1) {
            out = zeros[6 - word.length] + word + out;
          } else {
            out = word + out;
          }
          off += 2;
          if (off >= 26) {
            off -= 26;
            i--;
          }
        }
        if (carry !== 0) {
          out = carry.toString(16) + out;
        }
        while (out.length % padding !== 0) {
          out = '0' + out;
        }
        if (this.negative !== 0) {
          out = '-' + out;
        }
        return out;
      }
  
      if (base === (base | 0) && base >= 2 && base <= 36) {
        // var groupSize = Math.floor(BN.wordSize * Math.LN2 / Math.log(base));
        var groupSize = groupSizes[base];
        // var groupBase = Math.pow(base, groupSize);
        var groupBase = groupBases[base];
        out = '';
        var c = this.clone();
        c.negative = 0;
        while (!c.isZero()) {
          var r = c.modn(groupBase).toString(base);
          c = c.idivn(groupBase);
  
          if (!c.isZero()) {
            out = zeros[groupSize - r.length] + r + out;
          } else {
            out = r + out;
          }
        }
        if (this.isZero()) {
          out = '0' + out;
        }
        while (out.length % padding !== 0) {
          out = '0' + out;
        }
        if (this.negative !== 0) {
          out = '-' + out;
        }
        return out;
      }
  
      assert(false, 'Base should be between 2 and 36');
    };
  
    BN.prototype.toNumber = function toNumber () {
      var ret = this.words[0];
      if (this.length === 2) {
        ret += this.words[1] * 0x4000000;
      } else if (this.length === 3 && this.words[2] === 0x01) {
        // NOTE: at this stage it is known that the top bit is set
        ret += 0x10000000000000 + (this.words[1] * 0x4000000);
      } else if (this.length > 2) {
        assert(false, 'Number can only safely store up to 53 bits');
      }
      return (this.negative !== 0) ? -ret : ret;
    };
  
    BN.prototype.toJSON = function toJSON () {
      return this.toString(16);
    };
  
    BN.prototype.toBuffer = function toBuffer (endian, length) {
      assert(typeof Buffer !== 'undefined');
      return this.toArrayLike(Buffer, endian, length);
    };
  
    BN.prototype.toArray = function toArray (endian, length) {
      return this.toArrayLike(Array, endian, length);
    };
  
    BN.prototype.toArrayLike = function toArrayLike (ArrayType, endian, length) {
      var byteLength = this.byteLength();
      var reqLength = length || Math.max(1, byteLength);
      assert(byteLength <= reqLength, 'byte array longer than desired length');
      assert(reqLength > 0, 'Requested array length <= 0');
  
      this.strip();
      var littleEndian = endian === 'le';
      var res = new ArrayType(reqLength);
  
      var b, i;
      var q = this.clone();
      if (!littleEndian) {
        // Assume big-endian
        for (i = 0; i < reqLength - byteLength; i++) {
          res[i] = 0;
        }
  
        for (i = 0; !q.isZero(); i++) {
          b = q.andln(0xff);
          q.iushrn(8);
  
          res[reqLength - i - 1] = b;
        }
      } else {
        for (i = 0; !q.isZero(); i++) {
          b = q.andln(0xff);
          q.iushrn(8);
  
          res[i] = b;
        }
  
        for (; i < reqLength; i++) {
          res[i] = 0;
        }
      }
  
      return res;
    };
  
    if (Math.clz32) {
      BN.prototype._countBits = function _countBits (w) {
        return 32 - Math.clz32(w);
      };
    } else {
      BN.prototype._countBits = function _countBits (w) {
        var t = w;
        var r = 0;
        if (t >= 0x1000) {
          r += 13;
          t >>>= 13;
        }
        if (t >= 0x40) {
          r += 7;
          t >>>= 7;
        }
        if (t >= 0x8) {
          r += 4;
          t >>>= 4;
        }
        if (t >= 0x02) {
          r += 2;
          t >>>= 2;
        }
        return r + t;
      };
    }
  
    BN.prototype._zeroBits = function _zeroBits (w) {
      // Short-cut
      if (w === 0) return 26;
  
      var t = w;
      var r = 0;
      if ((t & 0x1fff) === 0) {
        r += 13;
        t >>>= 13;
      }
      if ((t & 0x7f) === 0) {
        r += 7;
        t >>>= 7;
      }
      if ((t & 0xf) === 0) {
        r += 4;
        t >>>= 4;
      }
      if ((t & 0x3) === 0) {
        r += 2;
        t >>>= 2;
      }
      if ((t & 0x1) === 0) {
        r++;
      }
      return r;
    };
  
    // Return number of used bits in a BN
    BN.prototype.bitLength = function bitLength () {
      var w = this.words[this.length - 1];
      var hi = this._countBits(w);
      return (this.length - 1) * 26 + hi;
    };
  
    function toBitArray (num) {
      var w = new Array(num.bitLength());
  
      for (var bit = 0; bit < w.length; bit++) {
        var off = (bit / 26) | 0;
        var wbit = bit % 26;
  
        w[bit] = (num.words[off] & (1 << wbit)) >>> wbit;
      }
  
      return w;
    }
  
    // Number of trailing zero bits
    BN.prototype.zeroBits = function zeroBits () {
      if (this.isZero()) return 0;
  
      var r = 0;
      for (var i = 0; i < this.length; i++) {
        var b = this._zeroBits(this.words[i]);
        r += b;
        if (b !== 26) break;
      }
      return r;
    };
  
    BN.prototype.byteLength = function byteLength () {
      return Math.ceil(this.bitLength() / 8);
    };
  
    BN.prototype.toTwos = function toTwos (width) {
      if (this.negative !== 0) {
        return this.abs().inotn(width).iaddn(1);
      }
      return this.clone();
    };
  
    BN.prototype.fromTwos = function fromTwos (width) {
      if (this.testn(width - 1)) {
        return this.notn(width).iaddn(1).ineg();
      }
      return this.clone();
    };
  
    BN.prototype.isNeg = function isNeg () {
      return this.negative !== 0;
    };
  
    // Return negative clone of `this`
    BN.prototype.neg = function neg () {
      return this.clone().ineg();
    };
  
    BN.prototype.ineg = function ineg () {
      if (!this.isZero()) {
        this.negative ^= 1;
      }
  
      return this;
    };
  
    // Or `num` with `this` in-place
    BN.prototype.iuor = function iuor (num) {
      while (this.length < num.length) {
        this.words[this.length++] = 0;
      }
  
      for (var i = 0; i < num.length; i++) {
        this.words[i] = this.words[i] | num.words[i];
      }
  
      return this.strip();
    };
  
    BN.prototype.ior = function ior (num) {
      assert((this.negative | num.negative) === 0);
      return this.iuor(num);
    };
  
    // Or `num` with `this`
    BN.prototype.or = function or (num) {
      if (this.length > num.length) return this.clone().ior(num);
      return num.clone().ior(this);
    };
  
    BN.prototype.uor = function uor (num) {
      if (this.length > num.length) return this.clone().iuor(num);
      return num.clone().iuor(this);
    };
  
    // And `num` with `this` in-place
    BN.prototype.iuand = function iuand (num) {
      // b = min-length(num, this)
      var b;
      if (this.length > num.length) {
        b = num;
      } else {
        b = this;
      }
  
      for (var i = 0; i < b.length; i++) {
        this.words[i] = this.words[i] & num.words[i];
      }
  
      this.length = b.length;
  
      return this.strip();
    };
  
    BN.prototype.iand = function iand (num) {
      assert((this.negative | num.negative) === 0);
      return this.iuand(num);
    };
  
    // And `num` with `this`
    BN.prototype.and = function and (num) {
      if (this.length > num.length) return this.clone().iand(num);
      return num.clone().iand(this);
    };
  
    BN.prototype.uand = function uand (num) {
      if (this.length > num.length) return this.clone().iuand(num);
      return num.clone().iuand(this);
    };
  
    // Xor `num` with `this` in-place
    BN.prototype.iuxor = function iuxor (num) {
      // a.length > b.length
      var a;
      var b;
      if (this.length > num.length) {
        a = this;
        b = num;
      } else {
        a = num;
        b = this;
      }
  
      for (var i = 0; i < b.length; i++) {
        this.words[i] = a.words[i] ^ b.words[i];
      }
  
      if (this !== a) {
        for (; i < a.length; i++) {
          this.words[i] = a.words[i];
        }
      }
  
      this.length = a.length;
  
      return this.strip();
    };
  
    BN.prototype.ixor = function ixor (num) {
      assert((this.negative | num.negative) === 0);
      return this.iuxor(num);
    };
  
    // Xor `num` with `this`
    BN.prototype.xor = function xor (num) {
      if (this.length > num.length) return this.clone().ixor(num);
      return num.clone().ixor(this);
    };
  
    BN.prototype.uxor = function uxor (num) {
      if (this.length > num.length) return this.clone().iuxor(num);
      return num.clone().iuxor(this);
    };
  
    // Not ``this`` with ``width`` bitwidth
    BN.prototype.inotn = function inotn (width) {
      assert(typeof width === 'number' && width >= 0);
  
      var bytesNeeded = Math.ceil(width / 26) | 0;
      var bitsLeft = width % 26;
  
      // Extend the buffer with leading zeroes
      this._expand(bytesNeeded);
  
      if (bitsLeft > 0) {
        bytesNeeded--;
      }
  
      // Handle complete words
      for (var i = 0; i < bytesNeeded; i++) {
        this.words[i] = ~this.words[i] & 0x3ffffff;
      }
  
      // Handle the residue
      if (bitsLeft > 0) {
        this.words[i] = ~this.words[i] & (0x3ffffff >> (26 - bitsLeft));
      }
  
      // And remove leading zeroes
      return this.strip();
    };
  
    BN.prototype.notn = function notn (width) {
      return this.clone().inotn(width);
    };
  
    // Set `bit` of `this`
    BN.prototype.setn = function setn (bit, val) {
      assert(typeof bit === 'number' && bit >= 0);
  
      var off = (bit / 26) | 0;
      var wbit = bit % 26;
  
      this._expand(off + 1);
  
      if (val) {
        this.words[off] = this.words[off] | (1 << wbit);
      } else {
        this.words[off] = this.words[off] & ~(1 << wbit);
      }
  
      return this.strip();
    };
  
    // Add `num` to `this` in-place
    BN.prototype.iadd = function iadd (num) {
      var r;
  
      // negative + positive
      if (this.negative !== 0 && num.negative === 0) {
        this.negative = 0;
        r = this.isub(num);
        this.negative ^= 1;
        return this._normSign();
  
      // positive + negative
      } else if (this.negative === 0 && num.negative !== 0) {
        num.negative = 0;
        r = this.isub(num);
        num.negative = 1;
        return r._normSign();
      }
  
      // a.length > b.length
      var a, b;
      if (this.length > num.length) {
        a = this;
        b = num;
      } else {
        a = num;
        b = this;
      }
  
      var carry = 0;
      for (var i = 0; i < b.length; i++) {
        r = (a.words[i] | 0) + (b.words[i] | 0) + carry;
        this.words[i] = r & 0x3ffffff;
        carry = r >>> 26;
      }
      for (; carry !== 0 && i < a.length; i++) {
        r = (a.words[i] | 0) + carry;
        this.words[i] = r & 0x3ffffff;
        carry = r >>> 26;
      }
  
      this.length = a.length;
      if (carry !== 0) {
        this.words[this.length] = carry;
        this.length++;
      // Copy the rest of the words
      } else if (a !== this) {
        for (; i < a.length; i++) {
          this.words[i] = a.words[i];
        }
      }
  
      return this;
    };
  
    // Add `num` to `this`
    BN.prototype.add = function add (num) {
      var res;
      if (num.negative !== 0 && this.negative === 0) {
        num.negative = 0;
        res = this.sub(num);
        num.negative ^= 1;
        return res;
      } else if (num.negative === 0 && this.negative !== 0) {
        this.negative = 0;
        res = num.sub(this);
        this.negative = 1;
        return res;
      }
  
      if (this.length > num.length) return this.clone().iadd(num);
  
      return num.clone().iadd(this);
    };
  
    // Subtract `num` from `this` in-place
    BN.prototype.isub = function isub (num) {
      // this - (-num) = this + num
      if (num.negative !== 0) {
        num.negative = 0;
        var r = this.iadd(num);
        num.negative = 1;
        return r._normSign();
  
      // -this - num = -(this + num)
      } else if (this.negative !== 0) {
        this.negative = 0;
        this.iadd(num);
        this.negative = 1;
        return this._normSign();
      }
  
      // At this point both numbers are positive
      var cmp = this.cmp(num);
  
      // Optimization - zeroify
      if (cmp === 0) {
        this.negative = 0;
        this.length = 1;
        this.words[0] = 0;
        return this;
      }
  
      // a > b
      var a, b;
      if (cmp > 0) {
        a = this;
        b = num;
      } else {
        a = num;
        b = this;
      }
  
      var carry = 0;
      for (var i = 0; i < b.length; i++) {
        r = (a.words[i] | 0) - (b.words[i] | 0) + carry;
        carry = r >> 26;
        this.words[i] = r & 0x3ffffff;
      }
      for (; carry !== 0 && i < a.length; i++) {
        r = (a.words[i] | 0) + carry;
        carry = r >> 26;
        this.words[i] = r & 0x3ffffff;
      }
  
      // Copy rest of the words
      if (carry === 0 && i < a.length && a !== this) {
        for (; i < a.length; i++) {
          this.words[i] = a.words[i];
        }
      }
  
      this.length = Math.max(this.length, i);
  
      if (a !== this) {
        this.negative = 1;
      }
  
      return this.strip();
    };
  
    // Subtract `num` from `this`
    BN.prototype.sub = function sub (num) {
      return this.clone().isub(num);
    };
  
    function smallMulTo (self, num, out) {
      out.negative = num.negative ^ self.negative;
      var len = (self.length + num.length) | 0;
      out.length = len;
      len = (len - 1) | 0;
  
      // Peel one iteration (compiler can't do it, because of code complexity)
      var a = self.words[0] | 0;
      var b = num.words[0] | 0;
      var r = a * b;
  
      var lo = r & 0x3ffffff;
      var carry = (r / 0x4000000) | 0;
      out.words[0] = lo;
  
      for (var k = 1; k < len; k++) {
        // Sum all words with the same `i + j = k` and accumulate `ncarry`,
        // note that ncarry could be >= 0x3ffffff
        var ncarry = carry >>> 26;
        var rword = carry & 0x3ffffff;
        var maxJ = Math.min(k, num.length - 1);
        for (var j = Math.max(0, k - self.length + 1); j <= maxJ; j++) {
          var i = (k - j) | 0;
          a = self.words[i] | 0;
          b = num.words[j] | 0;
          r = a * b + rword;
          ncarry += (r / 0x4000000) | 0;
          rword = r & 0x3ffffff;
        }
        out.words[k] = rword | 0;
        carry = ncarry | 0;
      }
      if (carry !== 0) {
        out.words[k] = carry | 0;
      } else {
        out.length--;
      }
  
      return out.strip();
    }
  
    // TODO(indutny): it may be reasonable to omit it for users who don't need
    // to work with 256-bit numbers, otherwise it gives 20% improvement for 256-bit
    // multiplication (like elliptic secp256k1).
    var comb10MulTo = function comb10MulTo (self, num, out) {
      var a = self.words;
      var b = num.words;
      var o = out.words;
      var c = 0;
      var lo;
      var mid;
      var hi;
      var a0 = a[0] | 0;
      var al0 = a0 & 0x1fff;
      var ah0 = a0 >>> 13;
      var a1 = a[1] | 0;
      var al1 = a1 & 0x1fff;
      var ah1 = a1 >>> 13;
      var a2 = a[2] | 0;
      var al2 = a2 & 0x1fff;
      var ah2 = a2 >>> 13;
      var a3 = a[3] | 0;
      var al3 = a3 & 0x1fff;
      var ah3 = a3 >>> 13;
      var a4 = a[4] | 0;
      var al4 = a4 & 0x1fff;
      var ah4 = a4 >>> 13;
      var a5 = a[5] | 0;
      var al5 = a5 & 0x1fff;
      var ah5 = a5 >>> 13;
      var a6 = a[6] | 0;
      var al6 = a6 & 0x1fff;
      var ah6 = a6 >>> 13;
      var a7 = a[7] | 0;
      var al7 = a7 & 0x1fff;
      var ah7 = a7 >>> 13;
      var a8 = a[8] | 0;
      var al8 = a8 & 0x1fff;
      var ah8 = a8 >>> 13;
      var a9 = a[9] | 0;
      var al9 = a9 & 0x1fff;
      var ah9 = a9 >>> 13;
      var b0 = b[0] | 0;
      var bl0 = b0 & 0x1fff;
      var bh0 = b0 >>> 13;
      var b1 = b[1] | 0;
      var bl1 = b1 & 0x1fff;
      var bh1 = b1 >>> 13;
      var b2 = b[2] | 0;
      var bl2 = b2 & 0x1fff;
      var bh2 = b2 >>> 13;
      var b3 = b[3] | 0;
      var bl3 = b3 & 0x1fff;
      var bh3 = b3 >>> 13;
      var b4 = b[4] | 0;
      var bl4 = b4 & 0x1fff;
      var bh4 = b4 >>> 13;
      var b5 = b[5] | 0;
      var bl5 = b5 & 0x1fff;
      var bh5 = b5 >>> 13;
      var b6 = b[6] | 0;
      var bl6 = b6 & 0x1fff;
      var bh6 = b6 >>> 13;
      var b7 = b[7] | 0;
      var bl7 = b7 & 0x1fff;
      var bh7 = b7 >>> 13;
      var b8 = b[8] | 0;
      var bl8 = b8 & 0x1fff;
      var bh8 = b8 >>> 13;
      var b9 = b[9] | 0;
      var bl9 = b9 & 0x1fff;
      var bh9 = b9 >>> 13;
  
      out.negative = self.negative ^ num.negative;
      out.length = 19;
      /* k = 0 */
      lo = Math.imul(al0, bl0);
      mid = Math.imul(al0, bh0);
      mid = (mid + Math.imul(ah0, bl0)) | 0;
      hi = Math.imul(ah0, bh0);
      var w0 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;
      c = (((hi + (mid >>> 13)) | 0) + (w0 >>> 26)) | 0;
      w0 &= 0x3ffffff;
      /* k = 1 */
      lo = Math.imul(al1, bl0);
      mid = Math.imul(al1, bh0);
      mid = (mid + Math.imul(ah1, bl0)) | 0;
      hi = Math.imul(ah1, bh0);
      lo = (lo + Math.imul(al0, bl1)) | 0;
      mid = (mid + Math.imul(al0, bh1)) | 0;
      mid = (mid + Math.imul(ah0, bl1)) | 0;
      hi = (hi + Math.imul(ah0, bh1)) | 0;
      var w1 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;
      c = (((hi + (mid >>> 13)) | 0) + (w1 >>> 26)) | 0;
      w1 &= 0x3ffffff;
      /* k = 2 */
      lo = Math.imul(al2, bl0);
      mid = Math.imul(al2, bh0);
      mid = (mid + Math.imul(ah2, bl0)) | 0;
      hi = Math.imul(ah2, bh0);
      lo = (lo + Math.imul(al1, bl1)) | 0;
      mid = (mid + Math.imul(al1, bh1)) | 0;
      mid = (mid + Math.imul(ah1, bl1)) | 0;
      hi = (hi + Math.imul(ah1, bh1)) | 0;
      lo = (lo + Math.imul(al0, bl2)) | 0;
      mid = (mid + Math.imul(al0, bh2)) | 0;
      mid = (mid + Math.imul(ah0, bl2)) | 0;
      hi = (hi + Math.imul(ah0, bh2)) | 0;
      var w2 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;
      c = (((hi + (mid >>> 13)) | 0) + (w2 >>> 26)) | 0;
      w2 &= 0x3ffffff;
      /* k = 3 */
      lo = Math.imul(al3, bl0);
      mid = Math.imul(al3, bh0);
      mid = (mid + Math.imul(ah3, bl0)) | 0;
      hi = Math.imul(ah3, bh0);
      lo = (lo + Math.imul(al2, bl1)) | 0;
      mid = (mid + Math.imul(al2, bh1)) | 0;
      mid = (mid + Math.imul(ah2, bl1)) | 0;
      hi = (hi + Math.imul(ah2, bh1)) | 0;
      lo = (lo + Math.imul(al1, bl2)) | 0;
      mid = (mid + Math.imul(al1, bh2)) | 0;
      mid = (mid + Math.imul(ah1, bl2)) | 0;
      hi = (hi + Math.imul(ah1, bh2)) | 0;
      lo = (lo + Math.imul(al0, bl3)) | 0;
      mid = (mid + Math.imul(al0, bh3)) | 0;
      mid = (mid + Math.imul(ah0, bl3)) | 0;
      hi = (hi + Math.imul(ah0, bh3)) | 0;
      var w3 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;
      c = (((hi + (mid >>> 13)) | 0) + (w3 >>> 26)) | 0;
      w3 &= 0x3ffffff;
      /* k = 4 */
      lo = Math.imul(al4, bl0);
      mid = Math.imul(al4, bh0);
      mid = (mid + Math.imul(ah4, bl0)) | 0;
      hi = Math.imul(ah4, bh0);
      lo = (lo + Math.imul(al3, bl1)) | 0;
      mid = (mid + Math.imul(al3, bh1)) | 0;
      mid = (mid + Math.imul(ah3, bl1)) | 0;
      hi = (hi + Math.imul(ah3, bh1)) | 0;
      lo = (lo + Math.imul(al2, bl2)) | 0;
      mid = (mid + Math.imul(al2, bh2)) | 0;
      mid = (mid + Math.imul(ah2, bl2)) | 0;
      hi = (hi + Math.imul(ah2, bh2)) | 0;
      lo = (lo + Math.imul(al1, bl3)) | 0;
      mid = (mid + Math.imul(al1, bh3)) | 0;
      mid = (mid + Math.imul(ah1, bl3)) | 0;
      hi = (hi + Math.imul(ah1, bh3)) | 0;
      lo = (lo + Math.imul(al0, bl4)) | 0;
      mid = (mid + Math.imul(al0, bh4)) | 0;
      mid = (mid + Math.imul(ah0, bl4)) | 0;
      hi = (hi + Math.imul(ah0, bh4)) | 0;
      var w4 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;
      c = (((hi + (mid >>> 13)) | 0) + (w4 >>> 26)) | 0;
      w4 &= 0x3ffffff;
      /* k = 5 */
      lo = Math.imul(al5, bl0);
      mid = Math.imul(al5, bh0);
      mid = (mid + Math.imul(ah5, bl0)) | 0;
      hi = Math.imul(ah5, bh0);
      lo = (lo + Math.imul(al4, bl1)) | 0;
      mid = (mid + Math.imul(al4, bh1)) | 0;
      mid = (mid + Math.imul(ah4, bl1)) | 0;
      hi = (hi + Math.imul(ah4, bh1)) | 0;
      lo = (lo + Math.imul(al3, bl2)) | 0;
      mid = (mid + Math.imul(al3, bh2)) | 0;
      mid = (mid + Math.imul(ah3, bl2)) | 0;
      hi = (hi + Math.imul(ah3, bh2)) | 0;
      lo = (lo + Math.imul(al2, bl3)) | 0;
      mid = (mid + Math.imul(al2, bh3)) | 0;
      mid = (mid + Math.imul(ah2, bl3)) | 0;
      hi = (hi + Math.imul(ah2, bh3)) | 0;
      lo = (lo + Math.imul(al1, bl4)) | 0;
      mid = (mid + Math.imul(al1, bh4)) | 0;
      mid = (mid + Math.imul(ah1, bl4)) | 0;
      hi = (hi + Math.imul(ah1, bh4)) | 0;
      lo = (lo + Math.imul(al0, bl5)) | 0;
      mid = (mid + Math.imul(al0, bh5)) | 0;
      mid = (mid + Math.imul(ah0, bl5)) | 0;
      hi = (hi + Math.imul(ah0, bh5)) | 0;
      var w5 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;
      c = (((hi + (mid >>> 13)) | 0) + (w5 >>> 26)) | 0;
      w5 &= 0x3ffffff;
      /* k = 6 */
      lo = Math.imul(al6, bl0);
      mid = Math.imul(al6, bh0);
      mid = (mid + Math.imul(ah6, bl0)) | 0;
      hi = Math.imul(ah6, bh0);
      lo = (lo + Math.imul(al5, bl1)) | 0;
      mid = (mid + Math.imul(al5, bh1)) | 0;
      mid = (mid + Math.imul(ah5, bl1)) | 0;
      hi = (hi + Math.imul(ah5, bh1)) | 0;
      lo = (lo + Math.imul(al4, bl2)) | 0;
      mid = (mid + Math.imul(al4, bh2)) | 0;
      mid = (mid + Math.imul(ah4, bl2)) | 0;
      hi = (hi + Math.imul(ah4, bh2)) | 0;
      lo = (lo + Math.imul(al3, bl3)) | 0;
      mid = (mid + Math.imul(al3, bh3)) | 0;
      mid = (mid + Math.imul(ah3, bl3)) | 0;
      hi = (hi + Math.imul(ah3, bh3)) | 0;
      lo = (lo + Math.imul(al2, bl4)) | 0;
      mid = (mid + Math.imul(al2, bh4)) | 0;
      mid = (mid + Math.imul(ah2, bl4)) | 0;
      hi = (hi + Math.imul(ah2, bh4)) | 0;
      lo = (lo + Math.imul(al1, bl5)) | 0;
      mid = (mid + Math.imul(al1, bh5)) | 0;
      mid = (mid + Math.imul(ah1, bl5)) | 0;
      hi = (hi + Math.imul(ah1, bh5)) | 0;
      lo = (lo + Math.imul(al0, bl6)) | 0;
      mid = (mid + Math.imul(al0, bh6)) | 0;
      mid = (mid + Math.imul(ah0, bl6)) | 0;
      hi = (hi + Math.imul(ah0, bh6)) | 0;
      var w6 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;
      c = (((hi + (mid >>> 13)) | 0) + (w6 >>> 26)) | 0;
      w6 &= 0x3ffffff;
      /* k = 7 */
      lo = Math.imul(al7, bl0);
      mid = Math.imul(al7, bh0);
      mid = (mid + Math.imul(ah7, bl0)) | 0;
      hi = Math.imul(ah7, bh0);
      lo = (lo + Math.imul(al6, bl1)) | 0;
      mid = (mid + Math.imul(al6, bh1)) | 0;
      mid = (mid + Math.imul(ah6, bl1)) | 0;
      hi = (hi + Math.imul(ah6, bh1)) | 0;
      lo = (lo + Math.imul(al5, bl2)) | 0;
      mid = (mid + Math.imul(al5, bh2)) | 0;
      mid = (mid + Math.imul(ah5, bl2)) | 0;
      hi = (hi + Math.imul(ah5, bh2)) | 0;
      lo = (lo + Math.imul(al4, bl3)) | 0;
      mid = (mid + Math.imul(al4, bh3)) | 0;
      mid = (mid + Math.imul(ah4, bl3)) | 0;
      hi = (hi + Math.imul(ah4, bh3)) | 0;
      lo = (lo + Math.imul(al3, bl4)) | 0;
      mid = (mid + Math.imul(al3, bh4)) | 0;
      mid = (mid + Math.imul(ah3, bl4)) | 0;
      hi = (hi + Math.imul(ah3, bh4)) | 0;
      lo = (lo + Math.imul(al2, bl5)) | 0;
      mid = (mid + Math.imul(al2, bh5)) | 0;
      mid = (mid + Math.imul(ah2, bl5)) | 0;
      hi = (hi + Math.imul(ah2, bh5)) | 0;
      lo = (lo + Math.imul(al1, bl6)) | 0;
      mid = (mid + Math.imul(al1, bh6)) | 0;
      mid = (mid + Math.imul(ah1, bl6)) | 0;
      hi = (hi + Math.imul(ah1, bh6)) | 0;
      lo = (lo + Math.imul(al0, bl7)) | 0;
      mid = (mid + Math.imul(al0, bh7)) | 0;
      mid = (mid + Math.imul(ah0, bl7)) | 0;
      hi = (hi + Math.imul(ah0, bh7)) | 0;
      var w7 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;
      c = (((hi + (mid >>> 13)) | 0) + (w7 >>> 26)) | 0;
      w7 &= 0x3ffffff;
      /* k = 8 */
      lo = Math.imul(al8, bl0);
      mid = Math.imul(al8, bh0);
      mid = (mid + Math.imul(ah8, bl0)) | 0;
      hi = Math.imul(ah8, bh0);
      lo = (lo + Math.imul(al7, bl1)) | 0;
      mid = (mid + Math.imul(al7, bh1)) | 0;
      mid = (mid + Math.imul(ah7, bl1)) | 0;
      hi = (hi + Math.imul(ah7, bh1)) | 0;
      lo = (lo + Math.imul(al6, bl2)) | 0;
      mid = (mid + Math.imul(al6, bh2)) | 0;
      mid = (mid + Math.imul(ah6, bl2)) | 0;
      hi = (hi + Math.imul(ah6, bh2)) | 0;
      lo = (lo + Math.imul(al5, bl3)) | 0;
      mid = (mid + Math.imul(al5, bh3)) | 0;
      mid = (mid + Math.imul(ah5, bl3)) | 0;
      hi = (hi + Math.imul(ah5, bh3)) | 0;
      lo = (lo + Math.imul(al4, bl4)) | 0;
      mid = (mid + Math.imul(al4, bh4)) | 0;
      mid = (mid + Math.imul(ah4, bl4)) | 0;
      hi = (hi + Math.imul(ah4, bh4)) | 0;
      lo = (lo + Math.imul(al3, bl5)) | 0;
      mid = (mid + Math.imul(al3, bh5)) | 0;
      mid = (mid + Math.imul(ah3, bl5)) | 0;
      hi = (hi + Math.imul(ah3, bh5)) | 0;
      lo = (lo + Math.imul(al2, bl6)) | 0;
      mid = (mid + Math.imul(al2, bh6)) | 0;
      mid = (mid + Math.imul(ah2, bl6)) | 0;
      hi = (hi + Math.imul(ah2, bh6)) | 0;
      lo = (lo + Math.imul(al1, bl7)) | 0;
      mid = (mid + Math.imul(al1, bh7)) | 0;
      mid = (mid + Math.imul(ah1, bl7)) | 0;
      hi = (hi + Math.imul(ah1, bh7)) | 0;
      lo = (lo + Math.imul(al0, bl8)) | 0;
      mid = (mid + Math.imul(al0, bh8)) | 0;
      mid = (mid + Math.imul(ah0, bl8)) | 0;
      hi = (hi + Math.imul(ah0, bh8)) | 0;
      var w8 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;
      c = (((hi + (mid >>> 13)) | 0) + (w8 >>> 26)) | 0;
      w8 &= 0x3ffffff;
      /* k = 9 */
      lo = Math.imul(al9, bl0);
      mid = Math.imul(al9, bh0);
      mid = (mid + Math.imul(ah9, bl0)) | 0;
      hi = Math.imul(ah9, bh0);
      lo = (lo + Math.imul(al8, bl1)) | 0;
      mid = (mid + Math.imul(al8, bh1)) | 0;
      mid = (mid + Math.imul(ah8, bl1)) | 0;
      hi = (hi + Math.imul(ah8, bh1)) | 0;
      lo = (lo + Math.imul(al7, bl2)) | 0;
      mid = (mid + Math.imul(al7, bh2)) | 0;
      mid = (mid + Math.imul(ah7, bl2)) | 0;
      hi = (hi + Math.imul(ah7, bh2)) | 0;
      lo = (lo + Math.imul(al6, bl3)) | 0;
      mid = (mid + Math.imul(al6, bh3)) | 0;
      mid = (mid + Math.imul(ah6, bl3)) | 0;
      hi = (hi + Math.imul(ah6, bh3)) | 0;
      lo = (lo + Math.imul(al5, bl4)) | 0;
      mid = (mid + Math.imul(al5, bh4)) | 0;
      mid = (mid + Math.imul(ah5, bl4)) | 0;
      hi = (hi + Math.imul(ah5, bh4)) | 0;
      lo = (lo + Math.imul(al4, bl5)) | 0;
      mid = (mid + Math.imul(al4, bh5)) | 0;
      mid = (mid + Math.imul(ah4, bl5)) | 0;
      hi = (hi + Math.imul(ah4, bh5)) | 0;
      lo = (lo + Math.imul(al3, bl6)) | 0;
      mid = (mid + Math.imul(al3, bh6)) | 0;
      mid = (mid + Math.imul(ah3, bl6)) | 0;
      hi = (hi + Math.imul(ah3, bh6)) | 0;
      lo = (lo + Math.imul(al2, bl7)) | 0;
      mid = (mid + Math.imul(al2, bh7)) | 0;
      mid = (mid + Math.imul(ah2, bl7)) | 0;
      hi = (hi + Math.imul(ah2, bh7)) | 0;
      lo = (lo + Math.imul(al1, bl8)) | 0;
      mid = (mid + Math.imul(al1, bh8)) | 0;
      mid = (mid + Math.imul(ah1, bl8)) | 0;
      hi = (hi + Math.imul(ah1, bh8)) | 0;
      lo = (lo + Math.imul(al0, bl9)) | 0;
      mid = (mid + Math.imul(al0, bh9)) | 0;
      mid = (mid + Math.imul(ah0, bl9)) | 0;
      hi = (hi + Math.imul(ah0, bh9)) | 0;
      var w9 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;
      c = (((hi + (mid >>> 13)) | 0) + (w9 >>> 26)) | 0;
      w9 &= 0x3ffffff;
      /* k = 10 */
      lo = Math.imul(al9, bl1);
      mid = Math.imul(al9, bh1);
      mid = (mid + Math.imul(ah9, bl1)) | 0;
      hi = Math.imul(ah9, bh1);
      lo = (lo + Math.imul(al8, bl2)) | 0;
      mid = (mid + Math.imul(al8, bh2)) | 0;
      mid = (mid + Math.imul(ah8, bl2)) | 0;
      hi = (hi + Math.imul(ah8, bh2)) | 0;
      lo = (lo + Math.imul(al7, bl3)) | 0;
      mid = (mid + Math.imul(al7, bh3)) | 0;
      mid = (mid + Math.imul(ah7, bl3)) | 0;
      hi = (hi + Math.imul(ah7, bh3)) | 0;
      lo = (lo + Math.imul(al6, bl4)) | 0;
      mid = (mid + Math.imul(al6, bh4)) | 0;
      mid = (mid + Math.imul(ah6, bl4)) | 0;
      hi = (hi + Math.imul(ah6, bh4)) | 0;
      lo = (lo + Math.imul(al5, bl5)) | 0;
      mid = (mid + Math.imul(al5, bh5)) | 0;
      mid = (mid + Math.imul(ah5, bl5)) | 0;
      hi = (hi + Math.imul(ah5, bh5)) | 0;
      lo = (lo + Math.imul(al4, bl6)) | 0;
      mid = (mid + Math.imul(al4, bh6)) | 0;
      mid = (mid + Math.imul(ah4, bl6)) | 0;
      hi = (hi + Math.imul(ah4, bh6)) | 0;
      lo = (lo + Math.imul(al3, bl7)) | 0;
      mid = (mid + Math.imul(al3, bh7)) | 0;
      mid = (mid + Math.imul(ah3, bl7)) | 0;
      hi = (hi + Math.imul(ah3, bh7)) | 0;
      lo = (lo + Math.imul(al2, bl8)) | 0;
      mid = (mid + Math.imul(al2, bh8)) | 0;
      mid = (mid + Math.imul(ah2, bl8)) | 0;
      hi = (hi + Math.imul(ah2, bh8)) | 0;
      lo = (lo + Math.imul(al1, bl9)) | 0;
      mid = (mid + Math.imul(al1, bh9)) | 0;
      mid = (mid + Math.imul(ah1, bl9)) | 0;
      hi = (hi + Math.imul(ah1, bh9)) | 0;
      var w10 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;
      c = (((hi + (mid >>> 13)) | 0) + (w10 >>> 26)) | 0;
      w10 &= 0x3ffffff;
      /* k = 11 */
      lo = Math.imul(al9, bl2);
      mid = Math.imul(al9, bh2);
      mid = (mid + Math.imul(ah9, bl2)) | 0;
      hi = Math.imul(ah9, bh2);
      lo = (lo + Math.imul(al8, bl3)) | 0;
      mid = (mid + Math.imul(al8, bh3)) | 0;
      mid = (mid + Math.imul(ah8, bl3)) | 0;
      hi = (hi + Math.imul(ah8, bh3)) | 0;
      lo = (lo + Math.imul(al7, bl4)) | 0;
      mid = (mid + Math.imul(al7, bh4)) | 0;
      mid = (mid + Math.imul(ah7, bl4)) | 0;
      hi = (hi + Math.imul(ah7, bh4)) | 0;
      lo = (lo + Math.imul(al6, bl5)) | 0;
      mid = (mid + Math.imul(al6, bh5)) | 0;
      mid = (mid + Math.imul(ah6, bl5)) | 0;
      hi = (hi + Math.imul(ah6, bh5)) | 0;
      lo = (lo + Math.imul(al5, bl6)) | 0;
      mid = (mid + Math.imul(al5, bh6)) | 0;
      mid = (mid + Math.imul(ah5, bl6)) | 0;
      hi = (hi + Math.imul(ah5, bh6)) | 0;
      lo = (lo + Math.imul(al4, bl7)) | 0;
      mid = (mid + Math.imul(al4, bh7)) | 0;
      mid = (mid + Math.imul(ah4, bl7)) | 0;
      hi = (hi + Math.imul(ah4, bh7)) | 0;
      lo = (lo + Math.imul(al3, bl8)) | 0;
      mid = (mid + Math.imul(al3, bh8)) | 0;
      mid = (mid + Math.imul(ah3, bl8)) | 0;
      hi = (hi + Math.imul(ah3, bh8)) | 0;
      lo = (lo + Math.imul(al2, bl9)) | 0;
      mid = (mid + Math.imul(al2, bh9)) | 0;
      mid = (mid + Math.imul(ah2, bl9)) | 0;
      hi = (hi + Math.imul(ah2, bh9)) | 0;
      var w11 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;
      c = (((hi + (mid >>> 13)) | 0) + (w11 >>> 26)) | 0;
      w11 &= 0x3ffffff;
      /* k = 12 */
      lo = Math.imul(al9, bl3);
      mid = Math.imul(al9, bh3);
      mid = (mid + Math.imul(ah9, bl3)) | 0;
      hi = Math.imul(ah9, bh3);
      lo = (lo + Math.imul(al8, bl4)) | 0;
      mid = (mid + Math.imul(al8, bh4)) | 0;
      mid = (mid + Math.imul(ah8, bl4)) | 0;
      hi = (hi + Math.imul(ah8, bh4)) | 0;
      lo = (lo + Math.imul(al7, bl5)) | 0;
      mid = (mid + Math.imul(al7, bh5)) | 0;
      mid = (mid + Math.imul(ah7, bl5)) | 0;
      hi = (hi + Math.imul(ah7, bh5)) | 0;
      lo = (lo + Math.imul(al6, bl6)) | 0;
      mid = (mid + Math.imul(al6, bh6)) | 0;
      mid = (mid + Math.imul(ah6, bl6)) | 0;
      hi = (hi + Math.imul(ah6, bh6)) | 0;
      lo = (lo + Math.imul(al5, bl7)) | 0;
      mid = (mid + Math.imul(al5, bh7)) | 0;
      mid = (mid + Math.imul(ah5, bl7)) | 0;
      hi = (hi + Math.imul(ah5, bh7)) | 0;
      lo = (lo + Math.imul(al4, bl8)) | 0;
      mid = (mid + Math.imul(al4, bh8)) | 0;
      mid = (mid + Math.imul(ah4, bl8)) | 0;
      hi = (hi + Math.imul(ah4, bh8)) | 0;
      lo = (lo + Math.imul(al3, bl9)) | 0;
      mid = (mid + Math.imul(al3, bh9)) | 0;
      mid = (mid + Math.imul(ah3, bl9)) | 0;
      hi = (hi + Math.imul(ah3, bh9)) | 0;
      var w12 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;
      c = (((hi + (mid >>> 13)) | 0) + (w12 >>> 26)) | 0;
      w12 &= 0x3ffffff;
      /* k = 13 */
      lo = Math.imul(al9, bl4);
      mid = Math.imul(al9, bh4);
      mid = (mid + Math.imul(ah9, bl4)) | 0;
      hi = Math.imul(ah9, bh4);
      lo = (lo + Math.imul(al8, bl5)) | 0;
      mid = (mid + Math.imul(al8, bh5)) | 0;
      mid = (mid + Math.imul(ah8, bl5)) | 0;
      hi = (hi + Math.imul(ah8, bh5)) | 0;
      lo = (lo + Math.imul(al7, bl6)) | 0;
      mid = (mid + Math.imul(al7, bh6)) | 0;
      mid = (mid + Math.imul(ah7, bl6)) | 0;
      hi = (hi + Math.imul(ah7, bh6)) | 0;
      lo = (lo + Math.imul(al6, bl7)) | 0;
      mid = (mid + Math.imul(al6, bh7)) | 0;
      mid = (mid + Math.imul(ah6, bl7)) | 0;
      hi = (hi + Math.imul(ah6, bh7)) | 0;
      lo = (lo + Math.imul(al5, bl8)) | 0;
      mid = (mid + Math.imul(al5, bh8)) | 0;
      mid = (mid + Math.imul(ah5, bl8)) | 0;
      hi = (hi + Math.imul(ah5, bh8)) | 0;
      lo = (lo + Math.imul(al4, bl9)) | 0;
      mid = (mid + Math.imul(al4, bh9)) | 0;
      mid = (mid + Math.imul(ah4, bl9)) | 0;
      hi = (hi + Math.imul(ah4, bh9)) | 0;
      var w13 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;
      c = (((hi + (mid >>> 13)) | 0) + (w13 >>> 26)) | 0;
      w13 &= 0x3ffffff;
      /* k = 14 */
      lo = Math.imul(al9, bl5);
      mid = Math.imul(al9, bh5);
      mid = (mid + Math.imul(ah9, bl5)) | 0;
      hi = Math.imul(ah9, bh5);
      lo = (lo + Math.imul(al8, bl6)) | 0;
      mid = (mid + Math.imul(al8, bh6)) | 0;
      mid = (mid + Math.imul(ah8, bl6)) | 0;
      hi = (hi + Math.imul(ah8, bh6)) | 0;
      lo = (lo + Math.imul(al7, bl7)) | 0;
      mid = (mid + Math.imul(al7, bh7)) | 0;
      mid = (mid + Math.imul(ah7, bl7)) | 0;
      hi = (hi + Math.imul(ah7, bh7)) | 0;
      lo = (lo + Math.imul(al6, bl8)) | 0;
      mid = (mid + Math.imul(al6, bh8)) | 0;
      mid = (mid + Math.imul(ah6, bl8)) | 0;
      hi = (hi + Math.imul(ah6, bh8)) | 0;
      lo = (lo + Math.imul(al5, bl9)) | 0;
      mid = (mid + Math.imul(al5, bh9)) | 0;
      mid = (mid + Math.imul(ah5, bl9)) | 0;
      hi = (hi + Math.imul(ah5, bh9)) | 0;
      var w14 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;
      c = (((hi + (mid >>> 13)) | 0) + (w14 >>> 26)) | 0;
      w14 &= 0x3ffffff;
      /* k = 15 */
      lo = Math.imul(al9, bl6);
      mid = Math.imul(al9, bh6);
      mid = (mid + Math.imul(ah9, bl6)) | 0;
      hi = Math.imul(ah9, bh6);
      lo = (lo + Math.imul(al8, bl7)) | 0;
      mid = (mid + Math.imul(al8, bh7)) | 0;
      mid = (mid + Math.imul(ah8, bl7)) | 0;
      hi = (hi + Math.imul(ah8, bh7)) | 0;
      lo = (lo + Math.imul(al7, bl8)) | 0;
      mid = (mid + Math.imul(al7, bh8)) | 0;
      mid = (mid + Math.imul(ah7, bl8)) | 0;
      hi = (hi + Math.imul(ah7, bh8)) | 0;
      lo = (lo + Math.imul(al6, bl9)) | 0;
      mid = (mid + Math.imul(al6, bh9)) | 0;
      mid = (mid + Math.imul(ah6, bl9)) | 0;
      hi = (hi + Math.imul(ah6, bh9)) | 0;
      var w15 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;
      c = (((hi + (mid >>> 13)) | 0) + (w15 >>> 26)) | 0;
      w15 &= 0x3ffffff;
      /* k = 16 */
      lo = Math.imul(al9, bl7);
      mid = Math.imul(al9, bh7);
      mid = (mid + Math.imul(ah9, bl7)) | 0;
      hi = Math.imul(ah9, bh7);
      lo = (lo + Math.imul(al8, bl8)) | 0;
      mid = (mid + Math.imul(al8, bh8)) | 0;
      mid = (mid + Math.imul(ah8, bl8)) | 0;
      hi = (hi + Math.imul(ah8, bh8)) | 0;
      lo = (lo + Math.imul(al7, bl9)) | 0;
      mid = (mid + Math.imul(al7, bh9)) | 0;
      mid = (mid + Math.imul(ah7, bl9)) | 0;
      hi = (hi + Math.imul(ah7, bh9)) | 0;
      var w16 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;
      c = (((hi + (mid >>> 13)) | 0) + (w16 >>> 26)) | 0;
      w16 &= 0x3ffffff;
      /* k = 17 */
      lo = Math.imul(al9, bl8);
      mid = Math.imul(al9, bh8);
      mid = (mid + Math.imul(ah9, bl8)) | 0;
      hi = Math.imul(ah9, bh8);
      lo = (lo + Math.imul(al8, bl9)) | 0;
      mid = (mid + Math.imul(al8, bh9)) | 0;
      mid = (mid + Math.imul(ah8, bl9)) | 0;
      hi = (hi + Math.imul(ah8, bh9)) | 0;
      var w17 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;
      c = (((hi + (mid >>> 13)) | 0) + (w17 >>> 26)) | 0;
      w17 &= 0x3ffffff;
      /* k = 18 */
      lo = Math.imul(al9, bl9);
      mid = Math.imul(al9, bh9);
      mid = (mid + Math.imul(ah9, bl9)) | 0;
      hi = Math.imul(ah9, bh9);
      var w18 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;
      c = (((hi + (mid >>> 13)) | 0) + (w18 >>> 26)) | 0;
      w18 &= 0x3ffffff;
      o[0] = w0;
      o[1] = w1;
      o[2] = w2;
      o[3] = w3;
      o[4] = w4;
      o[5] = w5;
      o[6] = w6;
      o[7] = w7;
      o[8] = w8;
      o[9] = w9;
      o[10] = w10;
      o[11] = w11;
      o[12] = w12;
      o[13] = w13;
      o[14] = w14;
      o[15] = w15;
      o[16] = w16;
      o[17] = w17;
      o[18] = w18;
      if (c !== 0) {
        o[19] = c;
        out.length++;
      }
      return out;
    };
  
    // Polyfill comb
    if (!Math.imul) {
      comb10MulTo = smallMulTo;
    }
  
    function bigMulTo (self, num, out) {
      out.negative = num.negative ^ self.negative;
      out.length = self.length + num.length;
  
      var carry = 0;
      var hncarry = 0;
      for (var k = 0; k < out.length - 1; k++) {
        // Sum all words with the same `i + j = k` and accumulate `ncarry`,
        // note that ncarry could be >= 0x3ffffff
        var ncarry = hncarry;
        hncarry = 0;
        var rword = carry & 0x3ffffff;
        var maxJ = Math.min(k, num.length - 1);
        for (var j = Math.max(0, k - self.length + 1); j <= maxJ; j++) {
          var i = k - j;
          var a = self.words[i] | 0;
          var b = num.words[j] | 0;
          var r = a * b;
  
          var lo = r & 0x3ffffff;
          ncarry = (ncarry + ((r / 0x4000000) | 0)) | 0;
          lo = (lo + rword) | 0;
          rword = lo & 0x3ffffff;
          ncarry = (ncarry + (lo >>> 26)) | 0;
  
          hncarry += ncarry >>> 26;
          ncarry &= 0x3ffffff;
        }
        out.words[k] = rword;
        carry = ncarry;
        ncarry = hncarry;
      }
      if (carry !== 0) {
        out.words[k] = carry;
      } else {
        out.length--;
      }
  
      return out.strip();
    }
  
    function jumboMulTo (self, num, out) {
      var fftm = new FFTM();
      return fftm.mulp(self, num, out);
    }
  
    BN.prototype.mulTo = function mulTo (num, out) {
      var res;
      var len = this.length + num.length;
      if (this.length === 10 && num.length === 10) {
        res = comb10MulTo(this, num, out);
      } else if (len < 63) {
        res = smallMulTo(this, num, out);
      } else if (len < 1024) {
        res = bigMulTo(this, num, out);
      } else {
        res = jumboMulTo(this, num, out);
      }
  
      return res;
    };
  
    // Cooley-Tukey algorithm for FFT
    // slightly revisited to rely on looping instead of recursion
  
    function FFTM (x, y) {
      this.x = x;
      this.y = y;
    }
  
    FFTM.prototype.makeRBT = function makeRBT (N) {
      var t = new Array(N);
      var l = BN.prototype._countBits(N) - 1;
      for (var i = 0; i < N; i++) {
        t[i] = this.revBin(i, l, N);
      }
  
      return t;
    };
  
    // Returns binary-reversed representation of `x`
    FFTM.prototype.revBin = function revBin (x, l, N) {
      if (x === 0 || x === N - 1) return x;
  
      var rb = 0;
      for (var i = 0; i < l; i++) {
        rb |= (x & 1) << (l - i - 1);
        x >>= 1;
      }
  
      return rb;
    };
  
    // Performs "tweedling" phase, therefore 'emulating'
    // behaviour of the recursive algorithm
    FFTM.prototype.permute = function permute (rbt, rws, iws, rtws, itws, N) {
      for (var i = 0; i < N; i++) {
        rtws[i] = rws[rbt[i]];
        itws[i] = iws[rbt[i]];
      }
    };
  
    FFTM.prototype.transform = function transform (rws, iws, rtws, itws, N, rbt) {
      this.permute(rbt, rws, iws, rtws, itws, N);
  
      for (var s = 1; s < N; s <<= 1) {
        var l = s << 1;
  
        var rtwdf = Math.cos(2 * Math.PI / l);
        var itwdf = Math.sin(2 * Math.PI / l);
  
        for (var p = 0; p < N; p += l) {
          var rtwdf_ = rtwdf;
          var itwdf_ = itwdf;
  
          for (var j = 0; j < s; j++) {
            var re = rtws[p + j];
            var ie = itws[p + j];
  
            var ro = rtws[p + j + s];
            var io = itws[p + j + s];
  
            var rx = rtwdf_ * ro - itwdf_ * io;
  
            io = rtwdf_ * io + itwdf_ * ro;
            ro = rx;
  
            rtws[p + j] = re + ro;
            itws[p + j] = ie + io;
  
            rtws[p + j + s] = re - ro;
            itws[p + j + s] = ie - io;
  
            /* jshint maxdepth : false */
            if (j !== l) {
              rx = rtwdf * rtwdf_ - itwdf * itwdf_;
  
              itwdf_ = rtwdf * itwdf_ + itwdf * rtwdf_;
              rtwdf_ = rx;
            }
          }
        }
      }
    };
  
    FFTM.prototype.guessLen13b = function guessLen13b (n, m) {
      var N = Math.max(m, n) | 1;
      var odd = N & 1;
      var i = 0;
      for (N = N / 2 | 0; N; N = N >>> 1) {
        i++;
      }
  
      return 1 << i + 1 + odd;
    };
  
    FFTM.prototype.conjugate = function conjugate (rws, iws, N) {
      if (N <= 1) return;
  
      for (var i = 0; i < N / 2; i++) {
        var t = rws[i];
  
        rws[i] = rws[N - i - 1];
        rws[N - i - 1] = t;
  
        t = iws[i];
  
        iws[i] = -iws[N - i - 1];
        iws[N - i - 1] = -t;
      }
    };
  
    FFTM.prototype.normalize13b = function normalize13b (ws, N) {
      var carry = 0;
      for (var i = 0; i < N / 2; i++) {
        var w = Math.round(ws[2 * i + 1] / N) * 0x2000 +
          Math.round(ws[2 * i] / N) +
          carry;
  
        ws[i] = w & 0x3ffffff;
  
        if (w < 0x4000000) {
          carry = 0;
        } else {
          carry = w / 0x4000000 | 0;
        }
      }
  
      return ws;
    };
  
    FFTM.prototype.convert13b = function convert13b (ws, len, rws, N) {
      var carry = 0;
      for (var i = 0; i < len; i++) {
        carry = carry + (ws[i] | 0);
  
        rws[2 * i] = carry & 0x1fff; carry = carry >>> 13;
        rws[2 * i + 1] = carry & 0x1fff; carry = carry >>> 13;
      }
  
      // Pad with zeroes
      for (i = 2 * len; i < N; ++i) {
        rws[i] = 0;
      }
  
      assert(carry === 0);
      assert((carry & ~0x1fff) === 0);
    };
  
    FFTM.prototype.stub = function stub (N) {
      var ph = new Array(N);
      for (var i = 0; i < N; i++) {
        ph[i] = 0;
      }
  
      return ph;
    };
  
    FFTM.prototype.mulp = function mulp (x, y, out) {
      var N = 2 * this.guessLen13b(x.length, y.length);
  
      var rbt = this.makeRBT(N);
  
      var _ = this.stub(N);
  
      var rws = new Array(N);
      var rwst = new Array(N);
      var iwst = new Array(N);
  
      var nrws = new Array(N);
      var nrwst = new Array(N);
      var niwst = new Array(N);
  
      var rmws = out.words;
      rmws.length = N;
  
      this.convert13b(x.words, x.length, rws, N);
      this.convert13b(y.words, y.length, nrws, N);
  
      this.transform(rws, _, rwst, iwst, N, rbt);
      this.transform(nrws, _, nrwst, niwst, N, rbt);
  
      for (var i = 0; i < N; i++) {
        var rx = rwst[i] * nrwst[i] - iwst[i] * niwst[i];
        iwst[i] = rwst[i] * niwst[i] + iwst[i] * nrwst[i];
        rwst[i] = rx;
      }
  
      this.conjugate(rwst, iwst, N);
      this.transform(rwst, iwst, rmws, _, N, rbt);
      this.conjugate(rmws, _, N);
      this.normalize13b(rmws, N);
  
      out.negative = x.negative ^ y.negative;
      out.length = x.length + y.length;
      return out.strip();
    };
  
    // Multiply `this` by `num`
    BN.prototype.mul = function mul (num) {
      var out = new BN(null);
      out.words = new Array(this.length + num.length);
      return this.mulTo(num, out);
    };
  
    // Multiply employing FFT
    BN.prototype.mulf = function mulf (num) {
      var out = new BN(null);
      out.words = new Array(this.length + num.length);
      return jumboMulTo(this, num, out);
    };
  
    // In-place Multiplication
    BN.prototype.imul = function imul (num) {
      return this.clone().mulTo(num, this);
    };
  
    BN.prototype.imuln = function imuln (num) {
      assert(typeof num === 'number');
      assert(num < 0x4000000);
  
      // Carry
      var carry = 0;
      for (var i = 0; i < this.length; i++) {
        var w = (this.words[i] | 0) * num;
        var lo = (w & 0x3ffffff) + (carry & 0x3ffffff);
        carry >>= 26;
        carry += (w / 0x4000000) | 0;
        // NOTE: lo is 27bit maximum
        carry += lo >>> 26;
        this.words[i] = lo & 0x3ffffff;
      }
  
      if (carry !== 0) {
        this.words[i] = carry;
        this.length++;
      }
  
      return this;
    };
  
    BN.prototype.muln = function muln (num) {
      return this.clone().imuln(num);
    };
  
    // `this` * `this`
    BN.prototype.sqr = function sqr () {
      return this.mul(this);
    };
  
    // `this` * `this` in-place
    BN.prototype.isqr = function isqr () {
      return this.imul(this.clone());
    };
  
    // Math.pow(`this`, `num`)
    BN.prototype.pow = function pow (num) {
      var w = toBitArray(num);
      if (w.length === 0) return new BN(1);
  
      // Skip leading zeroes
      var res = this;
      for (var i = 0; i < w.length; i++, res = res.sqr()) {
        if (w[i] !== 0) break;
      }
  
      if (++i < w.length) {
        for (var q = res.sqr(); i < w.length; i++, q = q.sqr()) {
          if (w[i] === 0) continue;
  
          res = res.mul(q);
        }
      }
  
      return res;
    };
  
    // Shift-left in-place
    BN.prototype.iushln = function iushln (bits) {
      assert(typeof bits === 'number' && bits >= 0);
      var r = bits % 26;
      var s = (bits - r) / 26;
      var carryMask = (0x3ffffff >>> (26 - r)) << (26 - r);
      var i;
  
      if (r !== 0) {
        var carry = 0;
  
        for (i = 0; i < this.length; i++) {
          var newCarry = this.words[i] & carryMask;
          var c = ((this.words[i] | 0) - newCarry) << r;
          this.words[i] = c | carry;
          carry = newCarry >>> (26 - r);
        }
  
        if (carry) {
          this.words[i] = carry;
          this.length++;
        }
      }
  
      if (s !== 0) {
        for (i = this.length - 1; i >= 0; i--) {
          this.words[i + s] = this.words[i];
        }
  
        for (i = 0; i < s; i++) {
          this.words[i] = 0;
        }
  
        this.length += s;
      }
  
      return this.strip();
    };
  
    BN.prototype.ishln = function ishln (bits) {
      // TODO(indutny): implement me
      assert(this.negative === 0);
      return this.iushln(bits);
    };
  
    // Shift-right in-place
    // NOTE: `hint` is a lowest bit before trailing zeroes
    // NOTE: if `extended` is present - it will be filled with destroyed bits
    BN.prototype.iushrn = function iushrn (bits, hint, extended) {
      assert(typeof bits === 'number' && bits >= 0);
      var h;
      if (hint) {
        h = (hint - (hint % 26)) / 26;
      } else {
        h = 0;
      }
  
      var r = bits % 26;
      var s = Math.min((bits - r) / 26, this.length);
      var mask = 0x3ffffff ^ ((0x3ffffff >>> r) << r);
      var maskedWords = extended;
  
      h -= s;
      h = Math.max(0, h);
  
      // Extended mode, copy masked part
      if (maskedWords) {
        for (var i = 0; i < s; i++) {
          maskedWords.words[i] = this.words[i];
        }
        maskedWords.length = s;
      }
  
      if (s === 0) {
        // No-op, we should not move anything at all
      } else if (this.length > s) {
        this.length -= s;
        for (i = 0; i < this.length; i++) {
          this.words[i] = this.words[i + s];
        }
      } else {
        this.words[0] = 0;
        this.length = 1;
      }
  
      var carry = 0;
      for (i = this.length - 1; i >= 0 && (carry !== 0 || i >= h); i--) {
        var word = this.words[i] | 0;
        this.words[i] = (carry << (26 - r)) | (word >>> r);
        carry = word & mask;
      }
  
      // Push carried bits as a mask
      if (maskedWords && carry !== 0) {
        maskedWords.words[maskedWords.length++] = carry;
      }
  
      if (this.length === 0) {
        this.words[0] = 0;
        this.length = 1;
      }
  
      return this.strip();
    };
  
    BN.prototype.ishrn = function ishrn (bits, hint, extended) {
      // TODO(indutny): implement me
      assert(this.negative === 0);
      return this.iushrn(bits, hint, extended);
    };
  
    // Shift-left
    BN.prototype.shln = function shln (bits) {
      return this.clone().ishln(bits);
    };
  
    BN.prototype.ushln = function ushln (bits) {
      return this.clone().iushln(bits);
    };
  
    // Shift-right
    BN.prototype.shrn = function shrn (bits) {
      return this.clone().ishrn(bits);
    };
  
    BN.prototype.ushrn = function ushrn (bits) {
      return this.clone().iushrn(bits);
    };
  
    // Test if n bit is set
    BN.prototype.testn = function testn (bit) {
      assert(typeof bit === 'number' && bit >= 0);
      var r = bit % 26;
      var s = (bit - r) / 26;
      var q = 1 << r;
  
      // Fast case: bit is much higher than all existing words
      if (this.length <= s) return false;
  
      // Check bit and return
      var w = this.words[s];
  
      return !!(w & q);
    };
  
    // Return only lowers bits of number (in-place)
    BN.prototype.imaskn = function imaskn (bits) {
      assert(typeof bits === 'number' && bits >= 0);
      var r = bits % 26;
      var s = (bits - r) / 26;
  
      assert(this.negative === 0, 'imaskn works only with positive numbers');
  
      if (this.length <= s) {
        return this;
      }
  
      if (r !== 0) {
        s++;
      }
      this.length = Math.min(s, this.length);
  
      if (r !== 0) {
        var mask = 0x3ffffff ^ ((0x3ffffff >>> r) << r);
        this.words[this.length - 1] &= mask;
      }
  
      return this.strip();
    };
  
    // Return only lowers bits of number
    BN.prototype.maskn = function maskn (bits) {
      return this.clone().imaskn(bits);
    };
  
    // Add plain number `num` to `this`
    BN.prototype.iaddn = function iaddn (num) {
      assert(typeof num === 'number');
      assert(num < 0x4000000);
      if (num < 0) return this.isubn(-num);
  
      // Possible sign change
      if (this.negative !== 0) {
        if (this.length === 1 && (this.words[0] | 0) < num) {
          this.words[0] = num - (this.words[0] | 0);
          this.negative = 0;
          return this;
        }
  
        this.negative = 0;
        this.isubn(num);
        this.negative = 1;
        return this;
      }
  
      // Add without checks
      return this._iaddn(num);
    };
  
    BN.prototype._iaddn = function _iaddn (num) {
      this.words[0] += num;
  
      // Carry
      for (var i = 0; i < this.length && this.words[i] >= 0x4000000; i++) {
        this.words[i] -= 0x4000000;
        if (i === this.length - 1) {
          this.words[i + 1] = 1;
        } else {
          this.words[i + 1]++;
        }
      }
      this.length = Math.max(this.length, i + 1);
  
      return this;
    };
  
    // Subtract plain number `num` from `this`
    BN.prototype.isubn = function isubn (num) {
      assert(typeof num === 'number');
      assert(num < 0x4000000);
      if (num < 0) return this.iaddn(-num);
  
      if (this.negative !== 0) {
        this.negative = 0;
        this.iaddn(num);
        this.negative = 1;
        return this;
      }
  
      this.words[0] -= num;
  
      if (this.length === 1 && this.words[0] < 0) {
        this.words[0] = -this.words[0];
        this.negative = 1;
      } else {
        // Carry
        for (var i = 0; i < this.length && this.words[i] < 0; i++) {
          this.words[i] += 0x4000000;
          this.words[i + 1] -= 1;
        }
      }
  
      return this.strip();
    };
  
    BN.prototype.addn = function addn (num) {
      return this.clone().iaddn(num);
    };
  
    BN.prototype.subn = function subn (num) {
      return this.clone().isubn(num);
    };
  
    BN.prototype.iabs = function iabs () {
      this.negative = 0;
  
      return this;
    };
  
    BN.prototype.abs = function abs () {
      return this.clone().iabs();
    };
  
    BN.prototype._ishlnsubmul = function _ishlnsubmul (num, mul, shift) {
      var len = num.length + shift;
      var i;
  
      this._expand(len);
  
      var w;
      var carry = 0;
      for (i = 0; i < num.length; i++) {
        w = (this.words[i + shift] | 0) + carry;
        var right = (num.words[i] | 0) * mul;
        w -= right & 0x3ffffff;
        carry = (w >> 26) - ((right / 0x4000000) | 0);
        this.words[i + shift] = w & 0x3ffffff;
      }
      for (; i < this.length - shift; i++) {
        w = (this.words[i + shift] | 0) + carry;
        carry = w >> 26;
        this.words[i + shift] = w & 0x3ffffff;
      }
  
      if (carry === 0) return this.strip();
  
      // Subtraction overflow
      assert(carry === -1);
      carry = 0;
      for (i = 0; i < this.length; i++) {
        w = -(this.words[i] | 0) + carry;
        carry = w >> 26;
        this.words[i] = w & 0x3ffffff;
      }
      this.negative = 1;
  
      return this.strip();
    };
  
    BN.prototype._wordDiv = function _wordDiv (num, mode) {
      var shift = this.length - num.length;
  
      var a = this.clone();
      var b = num;
  
      // Normalize
      var bhi = b.words[b.length - 1] | 0;
      var bhiBits = this._countBits(bhi);
      shift = 26 - bhiBits;
      if (shift !== 0) {
        b = b.ushln(shift);
        a.iushln(shift);
        bhi = b.words[b.length - 1] | 0;
      }
  
      // Initialize quotient
      var m = a.length - b.length;
      var q;
  
      if (mode !== 'mod') {
        q = new BN(null);
        q.length = m + 1;
        q.words = new Array(q.length);
        for (var i = 0; i < q.length; i++) {
          q.words[i] = 0;
        }
      }
  
      var diff = a.clone()._ishlnsubmul(b, 1, m);
      if (diff.negative === 0) {
        a = diff;
        if (q) {
          q.words[m] = 1;
        }
      }
  
      for (var j = m - 1; j >= 0; j--) {
        var qj = (a.words[b.length + j] | 0) * 0x4000000 +
          (a.words[b.length + j - 1] | 0);
  
        // NOTE: (qj / bhi) is (0x3ffffff * 0x4000000 + 0x3ffffff) / 0x2000000 max
        // (0x7ffffff)
        qj = Math.min((qj / bhi) | 0, 0x3ffffff);
  
        a._ishlnsubmul(b, qj, j);
        while (a.negative !== 0) {
          qj--;
          a.negative = 0;
          a._ishlnsubmul(b, 1, j);
          if (!a.isZero()) {
            a.negative ^= 1;
          }
        }
        if (q) {
          q.words[j] = qj;
        }
      }
      if (q) {
        q.strip();
      }
      a.strip();
  
      // Denormalize
      if (mode !== 'div' && shift !== 0) {
        a.iushrn(shift);
      }
  
      return {
        div: q || null,
        mod: a
      };
    };
  
    // NOTE: 1) `mode` can be set to `mod` to request mod only,
    //       to `div` to request div only, or be absent to
    //       request both div & mod
    //       2) `positive` is true if unsigned mod is requested
    BN.prototype.divmod = function divmod (num, mode, positive) {
      assert(!num.isZero());
  
      if (this.isZero()) {
        return {
          div: new BN(0),
          mod: new BN(0)
        };
      }
  
      var div, mod, res;
      if (this.negative !== 0 && num.negative === 0) {
        res = this.neg().divmod(num, mode);
  
        if (mode !== 'mod') {
          div = res.div.neg();
        }
  
        if (mode !== 'div') {
          mod = res.mod.neg();
          if (positive && mod.negative !== 0) {
            mod.iadd(num);
          }
        }
  
        return {
          div: div,
          mod: mod
        };
      }
  
      if (this.negative === 0 && num.negative !== 0) {
        res = this.divmod(num.neg(), mode);
  
        if (mode !== 'mod') {
          div = res.div.neg();
        }
  
        return {
          div: div,
          mod: res.mod
        };
      }
  
      if ((this.negative & num.negative) !== 0) {
        res = this.neg().divmod(num.neg(), mode);
  
        if (mode !== 'div') {
          mod = res.mod.neg();
          if (positive && mod.negative !== 0) {
            mod.isub(num);
          }
        }
  
        return {
          div: res.div,
          mod: mod
        };
      }
  
      // Both numbers are positive at this point
  
      // Strip both numbers to approximate shift value
      if (num.length > this.length || this.cmp(num) < 0) {
        return {
          div: new BN(0),
          mod: this
        };
      }
  
      // Very short reduction
      if (num.length === 1) {
        if (mode === 'div') {
          return {
            div: this.divn(num.words[0]),
            mod: null
          };
        }
  
        if (mode === 'mod') {
          return {
            div: null,
            mod: new BN(this.modn(num.words[0]))
          };
        }
  
        return {
          div: this.divn(num.words[0]),
          mod: new BN(this.modn(num.words[0]))
        };
      }
  
      return this._wordDiv(num, mode);
    };
  
    // Find `this` / `num`
    BN.prototype.div = function div (num) {
      return this.divmod(num, 'div', false).div;
    };
  
    // Find `this` % `num`
    BN.prototype.mod = function mod (num) {
      return this.divmod(num, 'mod', false).mod;
    };
  
    BN.prototype.umod = function umod (num) {
      return this.divmod(num, 'mod', true).mod;
    };
  
    // Find Round(`this` / `num`)
    BN.prototype.divRound = function divRound (num) {
      var dm = this.divmod(num);
  
      // Fast case - exact division
      if (dm.mod.isZero()) return dm.div;
  
      var mod = dm.div.negative !== 0 ? dm.mod.isub(num) : dm.mod;
  
      var half = num.ushrn(1);
      var r2 = num.andln(1);
      var cmp = mod.cmp(half);
  
      // Round down
      if (cmp < 0 || r2 === 1 && cmp === 0) return dm.div;
  
      // Round up
      return dm.div.negative !== 0 ? dm.div.isubn(1) : dm.div.iaddn(1);
    };
  
    BN.prototype.modn = function modn (num) {
      assert(num <= 0x3ffffff);
      var p = (1 << 26) % num;
  
      var acc = 0;
      for (var i = this.length - 1; i >= 0; i--) {
        acc = (p * acc + (this.words[i] | 0)) % num;
      }
  
      return acc;
    };
  
    // In-place division by number
    BN.prototype.idivn = function idivn (num) {
      assert(num <= 0x3ffffff);
  
      var carry = 0;
      for (var i = this.length - 1; i >= 0; i--) {
        var w = (this.words[i] | 0) + carry * 0x4000000;
        this.words[i] = (w / num) | 0;
        carry = w % num;
      }
  
      return this.strip();
    };
  
    BN.prototype.divn = function divn (num) {
      return this.clone().idivn(num);
    };
  
    BN.prototype.egcd = function egcd (p) {
      assert(p.negative === 0);
      assert(!p.isZero());
  
      var x = this;
      var y = p.clone();
  
      if (x.negative !== 0) {
        x = x.umod(p);
      } else {
        x = x.clone();
      }
  
      // A * x + B * y = x
      var A = new BN(1);
      var B = new BN(0);
  
      // C * x + D * y = y
      var C = new BN(0);
      var D = new BN(1);
  
      var g = 0;
  
      while (x.isEven() && y.isEven()) {
        x.iushrn(1);
        y.iushrn(1);
        ++g;
      }
  
      var yp = y.clone();
      var xp = x.clone();
  
      while (!x.isZero()) {
        for (var i = 0, im = 1; (x.words[0] & im) === 0 && i < 26; ++i, im <<= 1);
        if (i > 0) {
          x.iushrn(i);
          while (i-- > 0) {
            if (A.isOdd() || B.isOdd()) {
              A.iadd(yp);
              B.isub(xp);
            }
  
            A.iushrn(1);
            B.iushrn(1);
          }
        }
  
        for (var j = 0, jm = 1; (y.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);
        if (j > 0) {
          y.iushrn(j);
          while (j-- > 0) {
            if (C.isOdd() || D.isOdd()) {
              C.iadd(yp);
              D.isub(xp);
            }
  
            C.iushrn(1);
            D.iushrn(1);
          }
        }
  
        if (x.cmp(y) >= 0) {
          x.isub(y);
          A.isub(C);
          B.isub(D);
        } else {
          y.isub(x);
          C.isub(A);
          D.isub(B);
        }
      }
  
      return {
        a: C,
        b: D,
        gcd: y.iushln(g)
      };
    };
  
    // This is reduced incarnation of the binary EEA
    // above, designated to invert members of the
    // _prime_ fields F(p) at a maximal speed
    BN.prototype._invmp = function _invmp (p) {
      assert(p.negative === 0);
      assert(!p.isZero());
  
      var a = this;
      var b = p.clone();
  
      if (a.negative !== 0) {
        a = a.umod(p);
      } else {
        a = a.clone();
      }
  
      var x1 = new BN(1);
      var x2 = new BN(0);
  
      var delta = b.clone();
  
      while (a.cmpn(1) > 0 && b.cmpn(1) > 0) {
        for (var i = 0, im = 1; (a.words[0] & im) === 0 && i < 26; ++i, im <<= 1);
        if (i > 0) {
          a.iushrn(i);
          while (i-- > 0) {
            if (x1.isOdd()) {
              x1.iadd(delta);
            }
  
            x1.iushrn(1);
          }
        }
  
        for (var j = 0, jm = 1; (b.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);
        if (j > 0) {
          b.iushrn(j);
          while (j-- > 0) {
            if (x2.isOdd()) {
              x2.iadd(delta);
            }
  
            x2.iushrn(1);
          }
        }
  
        if (a.cmp(b) >= 0) {
          a.isub(b);
          x1.isub(x2);
        } else {
          b.isub(a);
          x2.isub(x1);
        }
      }
  
      var res;
      if (a.cmpn(1) === 0) {
        res = x1;
      } else {
        res = x2;
      }
  
      if (res.cmpn(0) < 0) {
        res.iadd(p);
      }
  
      return res;
    };
  
    BN.prototype.gcd = function gcd (num) {
      if (this.isZero()) return num.abs();
      if (num.isZero()) return this.abs();
  
      var a = this.clone();
      var b = num.clone();
      a.negative = 0;
      b.negative = 0;
  
      // Remove common factor of two
      for (var shift = 0; a.isEven() && b.isEven(); shift++) {
        a.iushrn(1);
        b.iushrn(1);
      }
  
      do {
        while (a.isEven()) {
          a.iushrn(1);
        }
        while (b.isEven()) {
          b.iushrn(1);
        }
  
        var r = a.cmp(b);
        if (r < 0) {
          // Swap `a` and `b` to make `a` always bigger than `b`
          var t = a;
          a = b;
          b = t;
        } else if (r === 0 || b.cmpn(1) === 0) {
          break;
        }
  
        a.isub(b);
      } while (true);
  
      return b.iushln(shift);
    };
  
    // Invert number in the field F(num)
    BN.prototype.invm = function invm (num) {
      return this.egcd(num).a.umod(num);
    };
  
    BN.prototype.isEven = function isEven () {
      return (this.words[0] & 1) === 0;
    };
  
    BN.prototype.isOdd = function isOdd () {
      return (this.words[0] & 1) === 1;
    };
  
    // And first word and num
    BN.prototype.andln = function andln (num) {
      return this.words[0] & num;
    };
  
    // Increment at the bit position in-line
    BN.prototype.bincn = function bincn (bit) {
      assert(typeof bit === 'number');
      var r = bit % 26;
      var s = (bit - r) / 26;
      var q = 1 << r;
  
      // Fast case: bit is much higher than all existing words
      if (this.length <= s) {
        this._expand(s + 1);
        this.words[s] |= q;
        return this;
      }
  
      // Add bit and propagate, if needed
      var carry = q;
      for (var i = s; carry !== 0 && i < this.length; i++) {
        var w = this.words[i] | 0;
        w += carry;
        carry = w >>> 26;
        w &= 0x3ffffff;
        this.words[i] = w;
      }
      if (carry !== 0) {
        this.words[i] = carry;
        this.length++;
      }
      return this;
    };
  
    BN.prototype.isZero = function isZero () {
      return this.length === 1 && this.words[0] === 0;
    };
  
    BN.prototype.cmpn = function cmpn (num) {
      var negative = num < 0;
  
      if (this.negative !== 0 && !negative) return -1;
      if (this.negative === 0 && negative) return 1;
  
      this.strip();
  
      var res;
      if (this.length > 1) {
        res = 1;
      } else {
        if (negative) {
          num = -num;
        }
  
        assert(num <= 0x3ffffff, 'Number is too big');
  
        var w = this.words[0] | 0;
        res = w === num ? 0 : w < num ? -1 : 1;
      }
      if (this.negative !== 0) return -res | 0;
      return res;
    };
  
    // Compare two numbers and return:
    // 1 - if `this` > `num`
    // 0 - if `this` == `num`
    // -1 - if `this` < `num`
    BN.prototype.cmp = function cmp (num) {
      if (this.negative !== 0 && num.negative === 0) return -1;
      if (this.negative === 0 && num.negative !== 0) return 1;
  
      var res = this.ucmp(num);
      if (this.negative !== 0) return -res | 0;
      return res;
    };
  
    // Unsigned comparison
    BN.prototype.ucmp = function ucmp (num) {
      // At this point both numbers have the same sign
      if (this.length > num.length) return 1;
      if (this.length < num.length) return -1;
  
      var res = 0;
      for (var i = this.length - 1; i >= 0; i--) {
        var a = this.words[i] | 0;
        var b = num.words[i] | 0;
  
        if (a === b) continue;
        if (a < b) {
          res = -1;
        } else if (a > b) {
          res = 1;
        }
        break;
      }
      return res;
    };
  
    BN.prototype.gtn = function gtn (num) {
      return this.cmpn(num) === 1;
    };
  
    BN.prototype.gt = function gt (num) {
      return this.cmp(num) === 1;
    };
  
    BN.prototype.gten = function gten (num) {
      return this.cmpn(num) >= 0;
    };
  
    BN.prototype.gte = function gte (num) {
      return this.cmp(num) >= 0;
    };
  
    BN.prototype.ltn = function ltn (num) {
      return this.cmpn(num) === -1;
    };
  
    BN.prototype.lt = function lt (num) {
      return this.cmp(num) === -1;
    };
  
    BN.prototype.lten = function lten (num) {
      return this.cmpn(num) <= 0;
    };
  
    BN.prototype.lte = function lte (num) {
      return this.cmp(num) <= 0;
    };
  
    BN.prototype.eqn = function eqn (num) {
      return this.cmpn(num) === 0;
    };
  
    BN.prototype.eq = function eq (num) {
      return this.cmp(num) === 0;
    };
  
    //
    // A reduce context, could be using montgomery or something better, depending
    // on the `m` itself.
    //
    BN.red = function red (num) {
      return new Red(num);
    };
  
    BN.prototype.toRed = function toRed (ctx) {
      assert(!this.red, 'Already a number in reduction context');
      assert(this.negative === 0, 'red works only with positives');
      return ctx.convertTo(this)._forceRed(ctx);
    };
  
    BN.prototype.fromRed = function fromRed () {
      assert(this.red, 'fromRed works only with numbers in reduction context');
      return this.red.convertFrom(this);
    };
  
    BN.prototype._forceRed = function _forceRed (ctx) {
      this.red = ctx;
      return this;
    };
  
    BN.prototype.forceRed = function forceRed (ctx) {
      assert(!this.red, 'Already a number in reduction context');
      return this._forceRed(ctx);
    };
  
    BN.prototype.redAdd = function redAdd (num) {
      assert(this.red, 'redAdd works only with red numbers');
      return this.red.add(this, num);
    };
  
    BN.prototype.redIAdd = function redIAdd (num) {
      assert(this.red, 'redIAdd works only with red numbers');
      return this.red.iadd(this, num);
    };
  
    BN.prototype.redSub = function redSub (num) {
      assert(this.red, 'redSub works only with red numbers');
      return this.red.sub(this, num);
    };
  
    BN.prototype.redISub = function redISub (num) {
      assert(this.red, 'redISub works only with red numbers');
      return this.red.isub(this, num);
    };
  
    BN.prototype.redShl = function redShl (num) {
      assert(this.red, 'redShl works only with red numbers');
      return this.red.shl(this, num);
    };
  
    BN.prototype.redMul = function redMul (num) {
      assert(this.red, 'redMul works only with red numbers');
      this.red._verify2(this, num);
      return this.red.mul(this, num);
    };
  
    BN.prototype.redIMul = function redIMul (num) {
      assert(this.red, 'redMul works only with red numbers');
      this.red._verify2(this, num);
      return this.red.imul(this, num);
    };
  
    BN.prototype.redSqr = function redSqr () {
      assert(this.red, 'redSqr works only with red numbers');
      this.red._verify1(this);
      return this.red.sqr(this);
    };
  
    BN.prototype.redISqr = function redISqr () {
      assert(this.red, 'redISqr works only with red numbers');
      this.red._verify1(this);
      return this.red.isqr(this);
    };
  
    // Square root over p
    BN.prototype.redSqrt = function redSqrt () {
      assert(this.red, 'redSqrt works only with red numbers');
      this.red._verify1(this);
      return this.red.sqrt(this);
    };
  
    BN.prototype.redInvm = function redInvm () {
      assert(this.red, 'redInvm works only with red numbers');
      this.red._verify1(this);
      return this.red.invm(this);
    };
  
    // Return negative clone of `this` % `red modulo`
    BN.prototype.redNeg = function redNeg () {
      assert(this.red, 'redNeg works only with red numbers');
      this.red._verify1(this);
      return this.red.neg(this);
    };
  
    BN.prototype.redPow = function redPow (num) {
      assert(this.red && !num.red, 'redPow(normalNum)');
      this.red._verify1(this);
      return this.red.pow(this, num);
    };
  
    // Prime numbers with efficient reduction
    var primes = {
      k256: null,
      p224: null,
      p192: null,
      p25519: null
    };
  
    // Pseudo-Mersenne prime
    function MPrime (name, p) {
      // P = 2 ^ N - K
      this.name = name;
      this.p = new BN(p, 16);
      this.n = this.p.bitLength();
      this.k = new BN(1).iushln(this.n).isub(this.p);
  
      this.tmp = this._tmp();
    }
  
    MPrime.prototype._tmp = function _tmp () {
      var tmp = new BN(null);
      tmp.words = new Array(Math.ceil(this.n / 13));
      return tmp;
    };
  
    MPrime.prototype.ireduce = function ireduce (num) {
      // Assumes that `num` is less than `P^2`
      // num = HI * (2 ^ N - K) + HI * K + LO = HI * K + LO (mod P)
      var r = num;
      var rlen;
  
      do {
        this.split(r, this.tmp);
        r = this.imulK(r);
        r = r.iadd(this.tmp);
        rlen = r.bitLength();
      } while (rlen > this.n);
  
      var cmp = rlen < this.n ? -1 : r.ucmp(this.p);
      if (cmp === 0) {
        r.words[0] = 0;
        r.length = 1;
      } else if (cmp > 0) {
        r.isub(this.p);
      } else {
        r.strip();
      }
  
      return r;
    };
  
    MPrime.prototype.split = function split (input, out) {
      input.iushrn(this.n, 0, out);
    };
  
    MPrime.prototype.imulK = function imulK (num) {
      return num.imul(this.k);
    };
  
    function K256 () {
      MPrime.call(
        this,
        'k256',
        'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f');
    }
    inherits(K256, MPrime);
  
    K256.prototype.split = function split (input, output) {
      // 256 = 9 * 26 + 22
      var mask = 0x3fffff;
  
      var outLen = Math.min(input.length, 9);
      for (var i = 0; i < outLen; i++) {
        output.words[i] = input.words[i];
      }
      output.length = outLen;
  
      if (input.length <= 9) {
        input.words[0] = 0;
        input.length = 1;
        return;
      }
  
      // Shift by 9 limbs
      var prev = input.words[9];
      output.words[output.length++] = prev & mask;
  
      for (i = 10; i < input.length; i++) {
        var next = input.words[i] | 0;
        input.words[i - 10] = ((next & mask) << 4) | (prev >>> 22);
        prev = next;
      }
      prev >>>= 22;
      input.words[i - 10] = prev;
      if (prev === 0 && input.length > 10) {
        input.length -= 10;
      } else {
        input.length -= 9;
      }
    };
  
    K256.prototype.imulK = function imulK (num) {
      // K = 0x1000003d1 = [ 0x40, 0x3d1 ]
      num.words[num.length] = 0;
      num.words[num.length + 1] = 0;
      num.length += 2;
  
      // bounded at: 0x40 * 0x3ffffff + 0x3d0 = 0x100000390
      var lo = 0;
      for (var i = 0; i < num.length; i++) {
        var w = num.words[i] | 0;
        lo += w * 0x3d1;
        num.words[i] = lo & 0x3ffffff;
        lo = w * 0x40 + ((lo / 0x4000000) | 0);
      }
  
      // Fast length reduction
      if (num.words[num.length - 1] === 0) {
        num.length--;
        if (num.words[num.length - 1] === 0) {
          num.length--;
        }
      }
      return num;
    };
  
    function P224 () {
      MPrime.call(
        this,
        'p224',
        'ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001');
    }
    inherits(P224, MPrime);
  
    function P192 () {
      MPrime.call(
        this,
        'p192',
        'ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff');
    }
    inherits(P192, MPrime);
  
    function P25519 () {
      // 2 ^ 255 - 19
      MPrime.call(
        this,
        '25519',
        '7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed');
    }
    inherits(P25519, MPrime);
  
    P25519.prototype.imulK = function imulK (num) {
      // K = 0x13
      var carry = 0;
      for (var i = 0; i < num.length; i++) {
        var hi = (num.words[i] | 0) * 0x13 + carry;
        var lo = hi & 0x3ffffff;
        hi >>>= 26;
  
        num.words[i] = lo;
        carry = hi;
      }
      if (carry !== 0) {
        num.words[num.length++] = carry;
      }
      return num;
    };
  
    // Exported mostly for testing purposes, use plain name instead
    BN._prime = function prime (name) {
      // Cached version of prime
      if (primes[name]) return primes[name];
  
      var prime;
      if (name === 'k256') {
        prime = new K256();
      } else if (name === 'p224') {
        prime = new P224();
      } else if (name === 'p192') {
        prime = new P192();
      } else if (name === 'p25519') {
        prime = new P25519();
      } else {
        throw new Error('Unknown prime ' + name);
      }
      primes[name] = prime;
  
      return prime;
    };
  
    //
    // Base reduction engine
    //
    function Red (m) {
      if (typeof m === 'string') {
        var prime = BN._prime(m);
        this.m = prime.p;
        this.prime = prime;
      } else {
        assert(m.gtn(1), 'modulus must be greater than 1');
        this.m = m;
        this.prime = null;
      }
    }
  
    Red.prototype._verify1 = function _verify1 (a) {
      assert(a.negative === 0, 'red works only with positives');
      assert(a.red, 'red works only with red numbers');
    };
  
    Red.prototype._verify2 = function _verify2 (a, b) {
      assert((a.negative | b.negative) === 0, 'red works only with positives');
      assert(a.red && a.red === b.red,
        'red works only with red numbers');
    };
  
    Red.prototype.imod = function imod (a) {
      if (this.prime) return this.prime.ireduce(a)._forceRed(this);
      return a.umod(this.m)._forceRed(this);
    };
  
    Red.prototype.neg = function neg (a) {
      if (a.isZero()) {
        return a.clone();
      }
  
      return this.m.sub(a)._forceRed(this);
    };
  
    Red.prototype.add = function add (a, b) {
      this._verify2(a, b);
  
      var res = a.add(b);
      if (res.cmp(this.m) >= 0) {
        res.isub(this.m);
      }
      return res._forceRed(this);
    };
  
    Red.prototype.iadd = function iadd (a, b) {
      this._verify2(a, b);
  
      var res = a.iadd(b);
      if (res.cmp(this.m) >= 0) {
        res.isub(this.m);
      }
      return res;
    };
  
    Red.prototype.sub = function sub (a, b) {
      this._verify2(a, b);
  
      var res = a.sub(b);
      if (res.cmpn(0) < 0) {
        res.iadd(this.m);
      }
      return res._forceRed(this);
    };
  
    Red.prototype.isub = function isub (a, b) {
      this._verify2(a, b);
  
      var res = a.isub(b);
      if (res.cmpn(0) < 0) {
        res.iadd(this.m);
      }
      return res;
    };
  
    Red.prototype.shl = function shl (a, num) {
      this._verify1(a);
      return this.imod(a.ushln(num));
    };
  
    Red.prototype.imul = function imul (a, b) {
      this._verify2(a, b);
      return this.imod(a.imul(b));
    };
  
    Red.prototype.mul = function mul (a, b) {
      this._verify2(a, b);
      return this.imod(a.mul(b));
    };
  
    Red.prototype.isqr = function isqr (a) {
      return this.imul(a, a.clone());
    };
  
    Red.prototype.sqr = function sqr (a) {
      return this.mul(a, a);
    };
  
    Red.prototype.sqrt = function sqrt (a) {
      if (a.isZero()) return a.clone();
  
      var mod3 = this.m.andln(3);
      assert(mod3 % 2 === 1);
  
      // Fast case
      if (mod3 === 3) {
        var pow = this.m.add(new BN(1)).iushrn(2);
        return this.pow(a, pow);
      }
  
      // Tonelli-Shanks algorithm (Totally unoptimized and slow)
      //
      // Find Q and S, that Q * 2 ^ S = (P - 1)
      var q = this.m.subn(1);
      var s = 0;
      while (!q.isZero() && q.andln(1) === 0) {
        s++;
        q.iushrn(1);
      }
      assert(!q.isZero());
  
      var one = new BN(1).toRed(this);
      var nOne = one.redNeg();
  
      // Find quadratic non-residue
      // NOTE: Max is such because of generalized Riemann hypothesis.
      var lpow = this.m.subn(1).iushrn(1);
      var z = this.m.bitLength();
      z = new BN(2 * z * z).toRed(this);
  
      while (this.pow(z, lpow).cmp(nOne) !== 0) {
        z.redIAdd(nOne);
      }
  
      var c = this.pow(z, q);
      var r = this.pow(a, q.addn(1).iushrn(1));
      var t = this.pow(a, q);
      var m = s;
      while (t.cmp(one) !== 0) {
        var tmp = t;
        for (var i = 0; tmp.cmp(one) !== 0; i++) {
          tmp = tmp.redSqr();
        }
        assert(i < m);
        var b = this.pow(c, new BN(1).iushln(m - i - 1));
  
        r = r.redMul(b);
        c = b.redSqr();
        t = t.redMul(c);
        m = i;
      }
  
      return r;
    };
  
    Red.prototype.invm = function invm (a) {
      var inv = a._invmp(this.m);
      if (inv.negative !== 0) {
        inv.negative = 0;
        return this.imod(inv).redNeg();
      } else {
        return this.imod(inv);
      }
    };
  
    Red.prototype.pow = function pow (a, num) {
      if (num.isZero()) return new BN(1).toRed(this);
      if (num.cmpn(1) === 0) return a.clone();
  
      var windowSize = 4;
      var wnd = new Array(1 << windowSize);
      wnd[0] = new BN(1).toRed(this);
      wnd[1] = a;
      for (var i = 2; i < wnd.length; i++) {
        wnd[i] = this.mul(wnd[i - 1], a);
      }
  
      var res = wnd[0];
      var current = 0;
      var currentLen = 0;
      var start = num.bitLength() % 26;
      if (start === 0) {
        start = 26;
      }
  
      for (i = num.length - 1; i >= 0; i--) {
        var word = num.words[i];
        for (var j = start - 1; j >= 0; j--) {
          var bit = (word >> j) & 1;
          if (res !== wnd[0]) {
            res = this.sqr(res);
          }
  
          if (bit === 0 && current === 0) {
            currentLen = 0;
            continue;
          }
  
          current <<= 1;
          current |= bit;
          currentLen++;
          if (currentLen !== windowSize && (i !== 0 || j !== 0)) continue;
  
          res = this.mul(res, wnd[current]);
          currentLen = 0;
          current = 0;
        }
        start = 26;
      }
  
      return res;
    };
  
    Red.prototype.convertTo = function convertTo (num) {
      var r = num.umod(this.m);
  
      return r === num ? r.clone() : r;
    };
  
    Red.prototype.convertFrom = function convertFrom (num) {
      var res = num.clone();
      res.red = null;
      return res;
    };
  
    //
    // Montgomery method engine
    //
  
    BN.mont = function mont (num) {
      return new Mont(num);
    };
  
    function Mont (m) {
      Red.call(this, m);
  
      this.shift = this.m.bitLength();
      if (this.shift % 26 !== 0) {
        this.shift += 26 - (this.shift % 26);
      }
  
      this.r = new BN(1).iushln(this.shift);
      this.r2 = this.imod(this.r.sqr());
      this.rinv = this.r._invmp(this.m);
  
      this.minv = this.rinv.mul(this.r).isubn(1).div(this.m);
      this.minv = this.minv.umod(this.r);
      this.minv = this.r.sub(this.minv);
    }
    inherits(Mont, Red);
  
    Mont.prototype.convertTo = function convertTo (num) {
      return this.imod(num.ushln(this.shift));
    };
  
    Mont.prototype.convertFrom = function convertFrom (num) {
      var r = this.imod(num.mul(this.rinv));
      r.red = null;
      return r;
    };
  
    Mont.prototype.imul = function imul (a, b) {
      if (a.isZero() || b.isZero()) {
        a.words[0] = 0;
        a.length = 1;
        return a;
      }
  
      var t = a.imul(b);
      var c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m);
      var u = t.isub(c).iushrn(this.shift);
      var res = u;
  
      if (u.cmp(this.m) >= 0) {
        res = u.isub(this.m);
      } else if (u.cmpn(0) < 0) {
        res = u.iadd(this.m);
      }
  
      return res._forceRed(this);
    };
  
    Mont.prototype.mul = function mul (a, b) {
      if (a.isZero() || b.isZero()) return new BN(0)._forceRed(this);
  
      var t = a.mul(b);
      var c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m);
      var u = t.isub(c).iushrn(this.shift);
      var res = u;
      if (u.cmp(this.m) >= 0) {
        res = u.isub(this.m);
      } else if (u.cmpn(0) < 0) {
        res = u.iadd(this.m);
      }
  
      return res._forceRed(this);
    };
  
    Mont.prototype.invm = function invm (a) {
      // (AR)^-1 * R^2 = (A^-1 * R^-1) * R^2 = A^-1 * R
      var res = this.imod(a._invmp(this.m).mul(this.r2));
      return res._forceRed(this);
    };
  })(typeof module === 'undefined' || module, this);
  
  },{"buffer":10}],9:[function(require,module,exports){
  var randomBytes = require('../../utils').randomBytes; module.exports = function(length) { return randomBytes(length); };
  },{"../../utils":64}],10:[function(require,module,exports){
  
  },{}],11:[function(require,module,exports){
  'use strict';
  
  var elliptic = exports;
  
  elliptic.version = require('../package.json').version;
  elliptic.utils = require('./elliptic/utils');
  elliptic.rand = require('brorand');
  elliptic.hmacDRBG = require('./elliptic/hmac-drbg');
  elliptic.curve = require('./elliptic/curve');
  elliptic.curves = require('./elliptic/curves');
  
  // Protocols
  elliptic.ec = require('./elliptic/ec');
  elliptic.eddsa = require('./elliptic/eddsa');
  
  },{"../package.json":25,"./elliptic/curve":14,"./elliptic/curves":17,"./elliptic/ec":18,"./elliptic/eddsa":21,"./elliptic/hmac-drbg":22,"./elliptic/utils":24,"brorand":9}],12:[function(require,module,exports){
  'use strict';
  
  var BN = require('bn.js');
  var elliptic = require('../../elliptic');
  var utils = elliptic.utils;
  var getNAF = utils.getNAF;
  var getJSF = utils.getJSF;
  var assert = utils.assert;
  
  function BaseCurve(type, conf) {
    this.type = type;
    this.p = new BN(conf.p, 16);
  
    // Use Montgomery, when there is no fast reduction for the prime
    this.red = conf.prime ? BN.red(conf.prime) : BN.mont(this.p);
  
    // Useful for many curves
    this.zero = new BN(0).toRed(this.red);
    this.one = new BN(1).toRed(this.red);
    this.two = new BN(2).toRed(this.red);
  
    // Curve configuration, optional
    this.n = conf.n && new BN(conf.n, 16);
    this.g = conf.g && this.pointFromJSON(conf.g, conf.gRed);
  
    // Temporary arrays
    this._wnafT1 = new Array(4);
    this._wnafT2 = new Array(4);
    this._wnafT3 = new Array(4);
    this._wnafT4 = new Array(4);
  
    // Generalized Greg Maxwell's trick
    var adjustCount = this.n && this.p.div(this.n);
    if (!adjustCount || adjustCount.cmpn(100) > 0) {
      this.redN = null;
    } else {
      this._maxwellTrick = true;
      this.redN = this.n.toRed(this.red);
    }
  }
  module.exports = BaseCurve;
  
  BaseCurve.prototype.point = function point() {
    throw new Error('Not implemented');
  };
  
  BaseCurve.prototype.validate = function validate() {
    throw new Error('Not implemented');
  };
  
  BaseCurve.prototype._fixedNafMul = function _fixedNafMul(p, k) {
    assert(p.precomputed);
    var doubles = p._getDoubles();
  
    var naf = getNAF(k, 1);
    var I = (1 << (doubles.step + 1)) - (doubles.step % 2 === 0 ? 2 : 1);
    I /= 3;
  
    // Translate into more windowed form
    var repr = [];
    for (var j = 0; j < naf.length; j += doubles.step) {
      var nafW = 0;
      for (var k = j + doubles.step - 1; k >= j; k--)
        nafW = (nafW << 1) + naf[k];
      repr.push(nafW);
    }
  
    var a = this.jpoint(null, null, null);
    var b = this.jpoint(null, null, null);
    for (var i = I; i > 0; i--) {
      for (var j = 0; j < repr.length; j++) {
        var nafW = repr[j];
        if (nafW === i)
          b = b.mixedAdd(doubles.points[j]);
        else if (nafW === -i)
          b = b.mixedAdd(doubles.points[j].neg());
      }
      a = a.add(b);
    }
    return a.toP();
  };
  
  BaseCurve.prototype._wnafMul = function _wnafMul(p, k) {
    var w = 4;
  
    // Precompute window
    var nafPoints = p._getNAFPoints(w);
    w = nafPoints.wnd;
    var wnd = nafPoints.points;
  
    // Get NAF form
    var naf = getNAF(k, w);
  
    // Add `this`*(N+1) for every w-NAF index
    var acc = this.jpoint(null, null, null);
    for (var i = naf.length - 1; i >= 0; i--) {
      // Count zeroes
      for (var k = 0; i >= 0 && naf[i] === 0; i--)
        k++;
      if (i >= 0)
        k++;
      acc = acc.dblp(k);
  
      if (i < 0)
        break;
      var z = naf[i];
      assert(z !== 0);
      if (p.type === 'affine') {
        // J +- P
        if (z > 0)
          acc = acc.mixedAdd(wnd[(z - 1) >> 1]);
        else
          acc = acc.mixedAdd(wnd[(-z - 1) >> 1].neg());
      } else {
        // J +- J
        if (z > 0)
          acc = acc.add(wnd[(z - 1) >> 1]);
        else
          acc = acc.add(wnd[(-z - 1) >> 1].neg());
      }
    }
    return p.type === 'affine' ? acc.toP() : acc;
  };
  
  BaseCurve.prototype._wnafMulAdd = function _wnafMulAdd(defW,
                                                         points,
                                                         coeffs,
                                                         len,
                                                         jacobianResult) {
    var wndWidth = this._wnafT1;
    var wnd = this._wnafT2;
    var naf = this._wnafT3;
  
    // Fill all arrays
    var max = 0;
    for (var i = 0; i < len; i++) {
      var p = points[i];
      var nafPoints = p._getNAFPoints(defW);
      wndWidth[i] = nafPoints.wnd;
      wnd[i] = nafPoints.points;
    }
  
    // Comb small window NAFs
    for (var i = len - 1; i >= 1; i -= 2) {
      var a = i - 1;
      var b = i;
      if (wndWidth[a] !== 1 || wndWidth[b] !== 1) {
        naf[a] = getNAF(coeffs[a], wndWidth[a]);
        naf[b] = getNAF(coeffs[b], wndWidth[b]);
        max = Math.max(naf[a].length, max);
        max = Math.max(naf[b].length, max);
        continue;
      }
  
      var comb = [
        points[a], /* 1 */
        null, /* 3 */
        null, /* 5 */
        points[b] /* 7 */
      ];
  
      // Try to avoid Projective points, if possible
      if (points[a].y.cmp(points[b].y) === 0) {
        comb[1] = points[a].add(points[b]);
        comb[2] = points[a].toJ().mixedAdd(points[b].neg());
      } else if (points[a].y.cmp(points[b].y.redNeg()) === 0) {
        comb[1] = points[a].toJ().mixedAdd(points[b]);
        comb[2] = points[a].add(points[b].neg());
      } else {
        comb[1] = points[a].toJ().mixedAdd(points[b]);
        comb[2] = points[a].toJ().mixedAdd(points[b].neg());
      }
  
      var index = [
        -3, /* -1 -1 */
        -1, /* -1 0 */
        -5, /* -1 1 */
        -7, /* 0 -1 */
        0, /* 0 0 */
        7, /* 0 1 */
        5, /* 1 -1 */
        1, /* 1 0 */
        3  /* 1 1 */
      ];
  
      var jsf = getJSF(coeffs[a], coeffs[b]);
      max = Math.max(jsf[0].length, max);
      naf[a] = new Array(max);
      naf[b] = new Array(max);
      for (var j = 0; j < max; j++) {
        var ja = jsf[0][j] | 0;
        var jb = jsf[1][j] | 0;
  
        naf[a][j] = index[(ja + 1) * 3 + (jb + 1)];
        naf[b][j] = 0;
        wnd[a] = comb;
      }
    }
  
    var acc = this.jpoint(null, null, null);
    var tmp = this._wnafT4;
    for (var i = max; i >= 0; i--) {
      var k = 0;
  
      while (i >= 0) {
        var zero = true;
        for (var j = 0; j < len; j++) {
          tmp[j] = naf[j][i] | 0;
          if (tmp[j] !== 0)
            zero = false;
        }
        if (!zero)
          break;
        k++;
        i--;
      }
      if (i >= 0)
        k++;
      acc = acc.dblp(k);
      if (i < 0)
        break;
  
      for (var j = 0; j < len; j++) {
        var z = tmp[j];
        var p;
        if (z === 0)
          continue;
        else if (z > 0)
          p = wnd[j][(z - 1) >> 1];
        else if (z < 0)
          p = wnd[j][(-z - 1) >> 1].neg();
  
        if (p.type === 'affine')
          acc = acc.mixedAdd(p);
        else
          acc = acc.add(p);
      }
    }
    // Zeroify references
    for (var i = 0; i < len; i++)
      wnd[i] = null;
  
    if (jacobianResult)
      return acc;
    else
      return acc.toP();
  };
  
  function BasePoint(curve, type) {
    this.curve = curve;
    this.type = type;
    this.precomputed = null;
  }
  BaseCurve.BasePoint = BasePoint;
  
  BasePoint.prototype.eq = function eq(/*other*/) {
    throw new Error('Not implemented');
  };
  
  BasePoint.prototype.validate = function validate() {
    return this.curve.validate(this);
  };
  
  BaseCurve.prototype.decodePoint = function decodePoint(bytes, enc) {
    bytes = utils.toArray(bytes, enc);
  
    var len = this.p.byteLength();
  
    // uncompressed, hybrid-odd, hybrid-even
    if ((bytes[0] === 0x04 || bytes[0] === 0x06 || bytes[0] === 0x07) &&
        bytes.length - 1 === 2 * len) {
      if (bytes[0] === 0x06)
        assert(bytes[bytes.length - 1] % 2 === 0);
      else if (bytes[0] === 0x07)
        assert(bytes[bytes.length - 1] % 2 === 1);
  
      var res =  this.point(bytes.slice(1, 1 + len),
                            bytes.slice(1 + len, 1 + 2 * len));
  
      return res;
    } else if ((bytes[0] === 0x02 || bytes[0] === 0x03) &&
                bytes.length - 1 === len) {
      return this.pointFromX(bytes.slice(1, 1 + len), bytes[0] === 0x03);
    }
    throw new Error('Unknown point format');
  };
  
  BasePoint.prototype.encodeCompressed = function encodeCompressed(enc) {
    return this.encode(enc, true);
  };
  
  BasePoint.prototype._encode = function _encode(compact) {
    var len = this.curve.p.byteLength();
    var x = this.getX().toArray('be', len);
  
    if (compact)
      return [ this.getY().isEven() ? 0x02 : 0x03 ].concat(x);
  
    return [ 0x04 ].concat(x, this.getY().toArray('be', len)) ;
  };
  
  BasePoint.prototype.encode = function encode(enc, compact) {
    return utils.encode(this._encode(compact), enc);
  };
  
  BasePoint.prototype.precompute = function precompute(power) {
    if (this.precomputed)
      return this;
  
    var precomputed = {
      doubles: null,
      naf: null,
      beta: null
    };
    precomputed.naf = this._getNAFPoints(8);
    precomputed.doubles = this._getDoubles(4, power);
    precomputed.beta = this._getBeta();
    this.precomputed = precomputed;
  
    return this;
  };
  
  BasePoint.prototype._hasDoubles = function _hasDoubles(k) {
    if (!this.precomputed)
      return false;
  
    var doubles = this.precomputed.doubles;
    if (!doubles)
      return false;
  
    return doubles.points.length >= Math.ceil((k.bitLength() + 1) / doubles.step);
  };
  
  BasePoint.prototype._getDoubles = function _getDoubles(step, power) {
    if (this.precomputed && this.precomputed.doubles)
      return this.precomputed.doubles;
  
    var doubles = [ this ];
    var acc = this;
    for (var i = 0; i < power; i += step) {
      for (var j = 0; j < step; j++)
        acc = acc.dbl();
      doubles.push(acc);
    }
    return {
      step: step,
      points: doubles
    };
  };
  
  BasePoint.prototype._getNAFPoints = function _getNAFPoints(wnd) {
    if (this.precomputed && this.precomputed.naf)
      return this.precomputed.naf;
  
    var res = [ this ];
    var max = (1 << wnd) - 1;
    var dbl = max === 1 ? null : this.dbl();
    for (var i = 1; i < max; i++)
      res[i] = res[i - 1].add(dbl);
    return {
      wnd: wnd,
      points: res
    };
  };
  
  BasePoint.prototype._getBeta = function _getBeta() {
    return null;
  };
  
  BasePoint.prototype.dblp = function dblp(k) {
    var r = this;
    for (var i = 0; i < k; i++)
      r = r.dbl();
    return r;
  };
  
  },{"../../elliptic":11,"bn.js":8}],13:[function(require,module,exports){
  module.exports = {};
  },{}],14:[function(require,module,exports){
  'use strict';
  
  var curve = exports;
  
  curve.base = require('./base');
  curve.short = require('./short');
  curve.mont = require('./mont');
  curve.edwards = require('./edwards');
  
  },{"./base":12,"./edwards":13,"./mont":15,"./short":16}],15:[function(require,module,exports){
  arguments[4][13][0].apply(exports,arguments)
  },{"dup":13}],16:[function(require,module,exports){
  'use strict';
  
  var curve = require('../curve');
  var elliptic = require('../../elliptic');
  var BN = require('bn.js');
  var inherits = require('inherits');
  var Base = curve.base;
  
  var assert = elliptic.utils.assert;
  
  function ShortCurve(conf) {
    Base.call(this, 'short', conf);
  
    this.a = new BN(conf.a, 16).toRed(this.red);
    this.b = new BN(conf.b, 16).toRed(this.red);
    this.tinv = this.two.redInvm();
  
    this.zeroA = this.a.fromRed().cmpn(0) === 0;
    this.threeA = this.a.fromRed().sub(this.p).cmpn(-3) === 0;
  
    // If the curve is endomorphic, precalculate beta and lambda
    this.endo = this._getEndomorphism(conf);
    this._endoWnafT1 = new Array(4);
    this._endoWnafT2 = new Array(4);
  }
  inherits(ShortCurve, Base);
  module.exports = ShortCurve;
  
  ShortCurve.prototype._getEndomorphism = function _getEndomorphism(conf) {
    // No efficient endomorphism
    if (!this.zeroA || !this.g || !this.n || this.p.modn(3) !== 1)
      return;
  
    // Compute beta and lambda, that lambda * P = (beta * Px; Py)
    var beta;
    var lambda;
    if (conf.beta) {
      beta = new BN(conf.beta, 16).toRed(this.red);
    } else {
      var betas = this._getEndoRoots(this.p);
      // Choose the smallest beta
      beta = betas[0].cmp(betas[1]) < 0 ? betas[0] : betas[1];
      beta = beta.toRed(this.red);
    }
    if (conf.lambda) {
      lambda = new BN(conf.lambda, 16);
    } else {
      // Choose the lambda that is matching selected beta
      var lambdas = this._getEndoRoots(this.n);
      if (this.g.mul(lambdas[0]).x.cmp(this.g.x.redMul(beta)) === 0) {
        lambda = lambdas[0];
      } else {
        lambda = lambdas[1];
        assert(this.g.mul(lambda).x.cmp(this.g.x.redMul(beta)) === 0);
      }
    }
  
    // Get basis vectors, used for balanced length-two representation
    var basis;
    if (conf.basis) {
      basis = conf.basis.map(function(vec) {
        return {
          a: new BN(vec.a, 16),
          b: new BN(vec.b, 16)
        };
      });
    } else {
      basis = this._getEndoBasis(lambda);
    }
  
    return {
      beta: beta,
      lambda: lambda,
      basis: basis
    };
  };
  
  ShortCurve.prototype._getEndoRoots = function _getEndoRoots(num) {
    // Find roots of for x^2 + x + 1 in F
    // Root = (-1 +- Sqrt(-3)) / 2
    //
    var red = num === this.p ? this.red : BN.mont(num);
    var tinv = new BN(2).toRed(red).redInvm();
    var ntinv = tinv.redNeg();
  
    var s = new BN(3).toRed(red).redNeg().redSqrt().redMul(tinv);
  
    var l1 = ntinv.redAdd(s).fromRed();
    var l2 = ntinv.redSub(s).fromRed();
    return [ l1, l2 ];
  };
  
  ShortCurve.prototype._getEndoBasis = function _getEndoBasis(lambda) {
    // aprxSqrt >= sqrt(this.n)
    var aprxSqrt = this.n.ushrn(Math.floor(this.n.bitLength() / 2));
  
    // 3.74
    // Run EGCD, until r(L + 1) < aprxSqrt
    var u = lambda;
    var v = this.n.clone();
    var x1 = new BN(1);
    var y1 = new BN(0);
    var x2 = new BN(0);
    var y2 = new BN(1);
  
    // NOTE: all vectors are roots of: a + b * lambda = 0 (mod n)
    var a0;
    var b0;
    // First vector
    var a1;
    var b1;
    // Second vector
    var a2;
    var b2;
  
    var prevR;
    var i = 0;
    var r;
    var x;
    while (u.cmpn(0) !== 0) {
      var q = v.div(u);
      r = v.sub(q.mul(u));
      x = x2.sub(q.mul(x1));
      var y = y2.sub(q.mul(y1));
  
      if (!a1 && r.cmp(aprxSqrt) < 0) {
        a0 = prevR.neg();
        b0 = x1;
        a1 = r.neg();
        b1 = x;
      } else if (a1 && ++i === 2) {
        break;
      }
      prevR = r;
  
      v = u;
      u = r;
      x2 = x1;
      x1 = x;
      y2 = y1;
      y1 = y;
    }
    a2 = r.neg();
    b2 = x;
  
    var len1 = a1.sqr().add(b1.sqr());
    var len2 = a2.sqr().add(b2.sqr());
    if (len2.cmp(len1) >= 0) {
      a2 = a0;
      b2 = b0;
    }
  
    // Normalize signs
    if (a1.negative) {
      a1 = a1.neg();
      b1 = b1.neg();
    }
    if (a2.negative) {
      a2 = a2.neg();
      b2 = b2.neg();
    }
  
    return [
      { a: a1, b: b1 },
      { a: a2, b: b2 }
    ];
  };
  
  ShortCurve.prototype._endoSplit = function _endoSplit(k) {
    var basis = this.endo.basis;
    var v1 = basis[0];
    var v2 = basis[1];
  
    var c1 = v2.b.mul(k).divRound(this.n);
    var c2 = v1.b.neg().mul(k).divRound(this.n);
  
    var p1 = c1.mul(v1.a);
    var p2 = c2.mul(v2.a);
    var q1 = c1.mul(v1.b);
    var q2 = c2.mul(v2.b);
  
    // Calculate answer
    var k1 = k.sub(p1).sub(p2);
    var k2 = q1.add(q2).neg();
    return { k1: k1, k2: k2 };
  };
  
  ShortCurve.prototype.pointFromX = function pointFromX(x, odd) {
    x = new BN(x, 16);
    if (!x.red)
      x = x.toRed(this.red);
  
    var y2 = x.redSqr().redMul(x).redIAdd(x.redMul(this.a)).redIAdd(this.b);
    var y = y2.redSqrt();
    if (y.redSqr().redSub(y2).cmp(this.zero) !== 0)
      throw new Error('invalid point');
  
    // XXX Is there any way to tell if the number is odd without converting it
    // to non-red form?
    var isOdd = y.fromRed().isOdd();
    if (odd && !isOdd || !odd && isOdd)
      y = y.redNeg();
  
    return this.point(x, y);
  };
  
  ShortCurve.prototype.validate = function validate(point) {
    if (point.inf)
      return true;
  
    var x = point.x;
    var y = point.y;
  
    var ax = this.a.redMul(x);
    var rhs = x.redSqr().redMul(x).redIAdd(ax).redIAdd(this.b);
    return y.redSqr().redISub(rhs).cmpn(0) === 0;
  };
  
  ShortCurve.prototype._endoWnafMulAdd =
      function _endoWnafMulAdd(points, coeffs, jacobianResult) {
    var npoints = this._endoWnafT1;
    var ncoeffs = this._endoWnafT2;
    for (var i = 0; i < points.length; i++) {
      var split = this._endoSplit(coeffs[i]);
      var p = points[i];
      var beta = p._getBeta();
  
      if (split.k1.negative) {
        split.k1.ineg();
        p = p.neg(true);
      }
      if (split.k2.negative) {
        split.k2.ineg();
        beta = beta.neg(true);
      }
  
      npoints[i * 2] = p;
      npoints[i * 2 + 1] = beta;
      ncoeffs[i * 2] = split.k1;
      ncoeffs[i * 2 + 1] = split.k2;
    }
    var res = this._wnafMulAdd(1, npoints, ncoeffs, i * 2, jacobianResult);
  
    // Clean-up references to points and coefficients
    for (var j = 0; j < i * 2; j++) {
      npoints[j] = null;
      ncoeffs[j] = null;
    }
    return res;
  };
  
  function Point(curve, x, y, isRed) {
    Base.BasePoint.call(this, curve, 'affine');
    if (x === null && y === null) {
      this.x = null;
      this.y = null;
      this.inf = true;
    } else {
      this.x = new BN(x, 16);
      this.y = new BN(y, 16);
      // Force redgomery representation when loading from JSON
      if (isRed) {
        this.x.forceRed(this.curve.red);
        this.y.forceRed(this.curve.red);
      }
      if (!this.x.red)
        this.x = this.x.toRed(this.curve.red);
      if (!this.y.red)
        this.y = this.y.toRed(this.curve.red);
      this.inf = false;
    }
  }
  inherits(Point, Base.BasePoint);
  
  ShortCurve.prototype.point = function point(x, y, isRed) {
    return new Point(this, x, y, isRed);
  };
  
  ShortCurve.prototype.pointFromJSON = function pointFromJSON(obj, red) {
    return Point.fromJSON(this, obj, red);
  };
  
  Point.prototype._getBeta = function _getBeta() {
    if (!this.curve.endo)
      return;
  
    var pre = this.precomputed;
    if (pre && pre.beta)
      return pre.beta;
  
    var beta = this.curve.point(this.x.redMul(this.curve.endo.beta), this.y);
    if (pre) {
      var curve = this.curve;
      var endoMul = function(p) {
        return curve.point(p.x.redMul(curve.endo.beta), p.y);
      };
      pre.beta = beta;
      beta.precomputed = {
        beta: null,
        naf: pre.naf && {
          wnd: pre.naf.wnd,
          points: pre.naf.points.map(endoMul)
        },
        doubles: pre.doubles && {
          step: pre.doubles.step,
          points: pre.doubles.points.map(endoMul)
        }
      };
    }
    return beta;
  };
  
  Point.prototype.toJSON = function toJSON() {
    if (!this.precomputed)
      return [ this.x, this.y ];
  
    return [ this.x, this.y, this.precomputed && {
      doubles: this.precomputed.doubles && {
        step: this.precomputed.doubles.step,
        points: this.precomputed.doubles.points.slice(1)
      },
      naf: this.precomputed.naf && {
        wnd: this.precomputed.naf.wnd,
        points: this.precomputed.naf.points.slice(1)
      }
    } ];
  };
  
  Point.fromJSON = function fromJSON(curve, obj, red) {
    if (typeof obj === 'string')
      obj = JSON.parse(obj);
    var res = curve.point(obj[0], obj[1], red);
    if (!obj[2])
      return res;
  
    function obj2point(obj) {
      return curve.point(obj[0], obj[1], red);
    }
  
    var pre = obj[2];
    res.precomputed = {
      beta: null,
      doubles: pre.doubles && {
        step: pre.doubles.step,
        points: [ res ].concat(pre.doubles.points.map(obj2point))
      },
      naf: pre.naf && {
        wnd: pre.naf.wnd,
        points: [ res ].concat(pre.naf.points.map(obj2point))
      }
    };
    return res;
  };
  
  Point.prototype.inspect = function inspect() {
    if (this.isInfinity())
      return '<EC Point Infinity>';
    return '<EC Point x: ' + this.x.fromRed().toString(16, 2) +
        ' y: ' + this.y.fromRed().toString(16, 2) + '>';
  };
  
  Point.prototype.isInfinity = function isInfinity() {
    return this.inf;
  };
  
  Point.prototype.add = function add(p) {
    // O + P = P
    if (this.inf)
      return p;
  
    // P + O = P
    if (p.inf)
      return this;
  
    // P + P = 2P
    if (this.eq(p))
      return this.dbl();
  
    // P + (-P) = O
    if (this.neg().eq(p))
      return this.curve.point(null, null);
  
    // P + Q = O
    if (this.x.cmp(p.x) === 0)
      return this.curve.point(null, null);
  
    var c = this.y.redSub(p.y);
    if (c.cmpn(0) !== 0)
      c = c.redMul(this.x.redSub(p.x).redInvm());
    var nx = c.redSqr().redISub(this.x).redISub(p.x);
    var ny = c.redMul(this.x.redSub(nx)).redISub(this.y);
    return this.curve.point(nx, ny);
  };
  
  Point.prototype.dbl = function dbl() {
    if (this.inf)
      return this;
  
    // 2P = O
    var ys1 = this.y.redAdd(this.y);
    if (ys1.cmpn(0) === 0)
      return this.curve.point(null, null);
  
    var a = this.curve.a;
  
    var x2 = this.x.redSqr();
    var dyinv = ys1.redInvm();
    var c = x2.redAdd(x2).redIAdd(x2).redIAdd(a).redMul(dyinv);
  
    var nx = c.redSqr().redISub(this.x.redAdd(this.x));
    var ny = c.redMul(this.x.redSub(nx)).redISub(this.y);
    return this.curve.point(nx, ny);
  };
  
  Point.prototype.getX = function getX() {
    return this.x.fromRed();
  };
  
  Point.prototype.getY = function getY() {
    return this.y.fromRed();
  };
  
  Point.prototype.mul = function mul(k) {
    k = new BN(k, 16);
  
    if (this._hasDoubles(k))
      return this.curve._fixedNafMul(this, k);
    else if (this.curve.endo)
      return this.curve._endoWnafMulAdd([ this ], [ k ]);
    else
      return this.curve._wnafMul(this, k);
  };
  
  Point.prototype.mulAdd = function mulAdd(k1, p2, k2) {
    var points = [ this, p2 ];
    var coeffs = [ k1, k2 ];
    if (this.curve.endo)
      return this.curve._endoWnafMulAdd(points, coeffs);
    else
      return this.curve._wnafMulAdd(1, points, coeffs, 2);
  };
  
  Point.prototype.jmulAdd = function jmulAdd(k1, p2, k2) {
    var points = [ this, p2 ];
    var coeffs = [ k1, k2 ];
    if (this.curve.endo)
      return this.curve._endoWnafMulAdd(points, coeffs, true);
    else
      return this.curve._wnafMulAdd(1, points, coeffs, 2, true);
  };
  
  Point.prototype.eq = function eq(p) {
    return this === p ||
           this.inf === p.inf &&
               (this.inf || this.x.cmp(p.x) === 0 && this.y.cmp(p.y) === 0);
  };
  
  Point.prototype.neg = function neg(_precompute) {
    if (this.inf)
      return this;
  
    var res = this.curve.point(this.x, this.y.redNeg());
    if (_precompute && this.precomputed) {
      var pre = this.precomputed;
      var negate = function(p) {
        return p.neg();
      };
      res.precomputed = {
        naf: pre.naf && {
          wnd: pre.naf.wnd,
          points: pre.naf.points.map(negate)
        },
        doubles: pre.doubles && {
          step: pre.doubles.step,
          points: pre.doubles.points.map(negate)
        }
      };
    }
    return res;
  };
  
  Point.prototype.toJ = function toJ() {
    if (this.inf)
      return this.curve.jpoint(null, null, null);
  
    var res = this.curve.jpoint(this.x, this.y, this.curve.one);
    return res;
  };
  
  function JPoint(curve, x, y, z) {
    Base.BasePoint.call(this, curve, 'jacobian');
    if (x === null && y === null && z === null) {
      this.x = this.curve.one;
      this.y = this.curve.one;
      this.z = new BN(0);
    } else {
      this.x = new BN(x, 16);
      this.y = new BN(y, 16);
      this.z = new BN(z, 16);
    }
    if (!this.x.red)
      this.x = this.x.toRed(this.curve.red);
    if (!this.y.red)
      this.y = this.y.toRed(this.curve.red);
    if (!this.z.red)
      this.z = this.z.toRed(this.curve.red);
  
    this.zOne = this.z === this.curve.one;
  }
  inherits(JPoint, Base.BasePoint);
  
  ShortCurve.prototype.jpoint = function jpoint(x, y, z) {
    return new JPoint(this, x, y, z);
  };
  
  JPoint.prototype.toP = function toP() {
    if (this.isInfinity())
      return this.curve.point(null, null);
  
    var zinv = this.z.redInvm();
    var zinv2 = zinv.redSqr();
    var ax = this.x.redMul(zinv2);
    var ay = this.y.redMul(zinv2).redMul(zinv);
  
    return this.curve.point(ax, ay);
  };
  
  JPoint.prototype.neg = function neg() {
    return this.curve.jpoint(this.x, this.y.redNeg(), this.z);
  };
  
  JPoint.prototype.add = function add(p) {
    // O + P = P
    if (this.isInfinity())
      return p;
  
    // P + O = P
    if (p.isInfinity())
      return this;
  
    // 12M + 4S + 7A
    var pz2 = p.z.redSqr();
    var z2 = this.z.redSqr();
    var u1 = this.x.redMul(pz2);
    var u2 = p.x.redMul(z2);
    var s1 = this.y.redMul(pz2.redMul(p.z));
    var s2 = p.y.redMul(z2.redMul(this.z));
  
    var h = u1.redSub(u2);
    var r = s1.redSub(s2);
    if (h.cmpn(0) === 0) {
      if (r.cmpn(0) !== 0)
        return this.curve.jpoint(null, null, null);
      else
        return this.dbl();
    }
  
    var h2 = h.redSqr();
    var h3 = h2.redMul(h);
    var v = u1.redMul(h2);
  
    var nx = r.redSqr().redIAdd(h3).redISub(v).redISub(v);
    var ny = r.redMul(v.redISub(nx)).redISub(s1.redMul(h3));
    var nz = this.z.redMul(p.z).redMul(h);
  
    return this.curve.jpoint(nx, ny, nz);
  };
  
  JPoint.prototype.mixedAdd = function mixedAdd(p) {
    // O + P = P
    if (this.isInfinity())
      return p.toJ();
  
    // P + O = P
    if (p.isInfinity())
      return this;
  
    // 8M + 3S + 7A
    var z2 = this.z.redSqr();
    var u1 = this.x;
    var u2 = p.x.redMul(z2);
    var s1 = this.y;
    var s2 = p.y.redMul(z2).redMul(this.z);
  
    var h = u1.redSub(u2);
    var r = s1.redSub(s2);
    if (h.cmpn(0) === 0) {
      if (r.cmpn(0) !== 0)
        return this.curve.jpoint(null, null, null);
      else
        return this.dbl();
    }
  
    var h2 = h.redSqr();
    var h3 = h2.redMul(h);
    var v = u1.redMul(h2);
  
    var nx = r.redSqr().redIAdd(h3).redISub(v).redISub(v);
    var ny = r.redMul(v.redISub(nx)).redISub(s1.redMul(h3));
    var nz = this.z.redMul(h);
  
    return this.curve.jpoint(nx, ny, nz);
  };
  
  JPoint.prototype.dblp = function dblp(pow) {
    if (pow === 0)
      return this;
    if (this.isInfinity())
      return this;
    if (!pow)
      return this.dbl();
  
    if (this.curve.zeroA || this.curve.threeA) {
      var r = this;
      for (var i = 0; i < pow; i++)
        r = r.dbl();
      return r;
    }
  
    // 1M + 2S + 1A + N * (4S + 5M + 8A)
    // N = 1 => 6M + 6S + 9A
    var a = this.curve.a;
    var tinv = this.curve.tinv;
  
    var jx = this.x;
    var jy = this.y;
    var jz = this.z;
    var jz4 = jz.redSqr().redSqr();
  
    // Reuse results
    var jyd = jy.redAdd(jy);
    for (var i = 0; i < pow; i++) {
      var jx2 = jx.redSqr();
      var jyd2 = jyd.redSqr();
      var jyd4 = jyd2.redSqr();
      var c = jx2.redAdd(jx2).redIAdd(jx2).redIAdd(a.redMul(jz4));
  
      var t1 = jx.redMul(jyd2);
      var nx = c.redSqr().redISub(t1.redAdd(t1));
      var t2 = t1.redISub(nx);
      var dny = c.redMul(t2);
      dny = dny.redIAdd(dny).redISub(jyd4);
      var nz = jyd.redMul(jz);
      if (i + 1 < pow)
        jz4 = jz4.redMul(jyd4);
  
      jx = nx;
      jz = nz;
      jyd = dny;
    }
  
    return this.curve.jpoint(jx, jyd.redMul(tinv), jz);
  };
  
  JPoint.prototype.dbl = function dbl() {
    if (this.isInfinity())
      return this;
  
    if (this.curve.zeroA)
      return this._zeroDbl();
    else if (this.curve.threeA)
      return this._threeDbl();
    else
      return this._dbl();
  };
  
  JPoint.prototype._zeroDbl = function _zeroDbl() {
    var nx;
    var ny;
    var nz;
    // Z = 1
    if (this.zOne) {
      // hyperelliptic.org/EFD/g1p/auto-shortw-jacobian-0.html
      //     #doubling-mdbl-2007-bl
      // 1M + 5S + 14A
  
      // XX = X1^2
      var xx = this.x.redSqr();
      // YY = Y1^2
      var yy = this.y.redSqr();
      // YYYY = YY^2
      var yyyy = yy.redSqr();
      // S = 2 * ((X1 + YY)^2 - XX - YYYY)
      var s = this.x.redAdd(yy).redSqr().redISub(xx).redISub(yyyy);
      s = s.redIAdd(s);
      // M = 3 * XX + a; a = 0
      var m = xx.redAdd(xx).redIAdd(xx);
      // T = M ^ 2 - 2*S
      var t = m.redSqr().redISub(s).redISub(s);
  
      // 8 * YYYY
      var yyyy8 = yyyy.redIAdd(yyyy);
      yyyy8 = yyyy8.redIAdd(yyyy8);
      yyyy8 = yyyy8.redIAdd(yyyy8);
  
      // X3 = T
      nx = t;
      // Y3 = M * (S - T) - 8 * YYYY
      ny = m.redMul(s.redISub(t)).redISub(yyyy8);
      // Z3 = 2*Y1
      nz = this.y.redAdd(this.y);
    } else {
      // hyperelliptic.org/EFD/g1p/auto-shortw-jacobian-0.html
      //     #doubling-dbl-2009-l
      // 2M + 5S + 13A
  
      // A = X1^2
      var a = this.x.redSqr();
      // B = Y1^2
      var b = this.y.redSqr();
      // C = B^2
      var c = b.redSqr();
      // D = 2 * ((X1 + B)^2 - A - C)
      var d = this.x.redAdd(b).redSqr().redISub(a).redISub(c);
      d = d.redIAdd(d);
      // E = 3 * A
      var e = a.redAdd(a).redIAdd(a);
      // F = E^2
      var f = e.redSqr();
  
      // 8 * C
      var c8 = c.redIAdd(c);
      c8 = c8.redIAdd(c8);
      c8 = c8.redIAdd(c8);
  
      // X3 = F - 2 * D
      nx = f.redISub(d).redISub(d);
      // Y3 = E * (D - X3) - 8 * C
      ny = e.redMul(d.redISub(nx)).redISub(c8);
      // Z3 = 2 * Y1 * Z1
      nz = this.y.redMul(this.z);
      nz = nz.redIAdd(nz);
    }
  
    return this.curve.jpoint(nx, ny, nz);
  };
  
  JPoint.prototype._threeDbl = function _threeDbl() {
    var nx;
    var ny;
    var nz;
    // Z = 1
    if (this.zOne) {
      // hyperelliptic.org/EFD/g1p/auto-shortw-jacobian-3.html
      //     #doubling-mdbl-2007-bl
      // 1M + 5S + 15A
  
      // XX = X1^2
      var xx = this.x.redSqr();
      // YY = Y1^2
      var yy = this.y.redSqr();
      // YYYY = YY^2
      var yyyy = yy.redSqr();
      // S = 2 * ((X1 + YY)^2 - XX - YYYY)
      var s = this.x.redAdd(yy).redSqr().redISub(xx).redISub(yyyy);
      s = s.redIAdd(s);
      // M = 3 * XX + a
      var m = xx.redAdd(xx).redIAdd(xx).redIAdd(this.curve.a);
      // T = M^2 - 2 * S
      var t = m.redSqr().redISub(s).redISub(s);
      // X3 = T
      nx = t;
      // Y3 = M * (S - T) - 8 * YYYY
      var yyyy8 = yyyy.redIAdd(yyyy);
      yyyy8 = yyyy8.redIAdd(yyyy8);
      yyyy8 = yyyy8.redIAdd(yyyy8);
      ny = m.redMul(s.redISub(t)).redISub(yyyy8);
      // Z3 = 2 * Y1
      nz = this.y.redAdd(this.y);
    } else {
      // hyperelliptic.org/EFD/g1p/auto-shortw-jacobian-3.html#doubling-dbl-2001-b
      // 3M + 5S
  
      // delta = Z1^2
      var delta = this.z.redSqr();
      // gamma = Y1^2
      var gamma = this.y.redSqr();
      // beta = X1 * gamma
      var beta = this.x.redMul(gamma);
      // alpha = 3 * (X1 - delta) * (X1 + delta)
      var alpha = this.x.redSub(delta).redMul(this.x.redAdd(delta));
      alpha = alpha.redAdd(alpha).redIAdd(alpha);
      // X3 = alpha^2 - 8 * beta
      var beta4 = beta.redIAdd(beta);
      beta4 = beta4.redIAdd(beta4);
      var beta8 = beta4.redAdd(beta4);
      nx = alpha.redSqr().redISub(beta8);
      // Z3 = (Y1 + Z1)^2 - gamma - delta
      nz = this.y.redAdd(this.z).redSqr().redISub(gamma).redISub(delta);
      // Y3 = alpha * (4 * beta - X3) - 8 * gamma^2
      var ggamma8 = gamma.redSqr();
      ggamma8 = ggamma8.redIAdd(ggamma8);
      ggamma8 = ggamma8.redIAdd(ggamma8);
      ggamma8 = ggamma8.redIAdd(ggamma8);
      ny = alpha.redMul(beta4.redISub(nx)).redISub(ggamma8);
    }
  
    return this.curve.jpoint(nx, ny, nz);
  };
  
  JPoint.prototype._dbl = function _dbl() {
    var a = this.curve.a;
  
    // 4M + 6S + 10A
    var jx = this.x;
    var jy = this.y;
    var jz = this.z;
    var jz4 = jz.redSqr().redSqr();
  
    var jx2 = jx.redSqr();
    var jy2 = jy.redSqr();
  
    var c = jx2.redAdd(jx2).redIAdd(jx2).redIAdd(a.redMul(jz4));
  
    var jxd4 = jx.redAdd(jx);
    jxd4 = jxd4.redIAdd(jxd4);
    var t1 = jxd4.redMul(jy2);
    var nx = c.redSqr().redISub(t1.redAdd(t1));
    var t2 = t1.redISub(nx);
  
    var jyd8 = jy2.redSqr();
    jyd8 = jyd8.redIAdd(jyd8);
    jyd8 = jyd8.redIAdd(jyd8);
    jyd8 = jyd8.redIAdd(jyd8);
    var ny = c.redMul(t2).redISub(jyd8);
    var nz = jy.redAdd(jy).redMul(jz);
  
    return this.curve.jpoint(nx, ny, nz);
  };
  
  JPoint.prototype.trpl = function trpl() {
    if (!this.curve.zeroA)
      return this.dbl().add(this);
  
    // hyperelliptic.org/EFD/g1p/auto-shortw-jacobian-0.html#tripling-tpl-2007-bl
    // 5M + 10S + ...
  
    // XX = X1^2
    var xx = this.x.redSqr();
    // YY = Y1^2
    var yy = this.y.redSqr();
    // ZZ = Z1^2
    var zz = this.z.redSqr();
    // YYYY = YY^2
    var yyyy = yy.redSqr();
    // M = 3 * XX + a * ZZ2; a = 0
    var m = xx.redAdd(xx).redIAdd(xx);
    // MM = M^2
    var mm = m.redSqr();
    // E = 6 * ((X1 + YY)^2 - XX - YYYY) - MM
    var e = this.x.redAdd(yy).redSqr().redISub(xx).redISub(yyyy);
    e = e.redIAdd(e);
    e = e.redAdd(e).redIAdd(e);
    e = e.redISub(mm);
    // EE = E^2
    var ee = e.redSqr();
    // T = 16*YYYY
    var t = yyyy.redIAdd(yyyy);
    t = t.redIAdd(t);
    t = t.redIAdd(t);
    t = t.redIAdd(t);
    // U = (M + E)^2 - MM - EE - T
    var u = m.redIAdd(e).redSqr().redISub(mm).redISub(ee).redISub(t);
    // X3 = 4 * (X1 * EE - 4 * YY * U)
    var yyu4 = yy.redMul(u);
    yyu4 = yyu4.redIAdd(yyu4);
    yyu4 = yyu4.redIAdd(yyu4);
    var nx = this.x.redMul(ee).redISub(yyu4);
    nx = nx.redIAdd(nx);
    nx = nx.redIAdd(nx);
    // Y3 = 8 * Y1 * (U * (T - U) - E * EE)
    var ny = this.y.redMul(u.redMul(t.redISub(u)).redISub(e.redMul(ee)));
    ny = ny.redIAdd(ny);
    ny = ny.redIAdd(ny);
    ny = ny.redIAdd(ny);
    // Z3 = (Z1 + E)^2 - ZZ - EE
    var nz = this.z.redAdd(e).redSqr().redISub(zz).redISub(ee);
  
    return this.curve.jpoint(nx, ny, nz);
  };
  
  JPoint.prototype.mul = function mul(k, kbase) {
    k = new BN(k, kbase);
  
    return this.curve._wnafMul(this, k);
  };
  
  JPoint.prototype.eq = function eq(p) {
    if (p.type === 'affine')
      return this.eq(p.toJ());
  
    if (this === p)
      return true;
  
    // x1 * z2^2 == x2 * z1^2
    var z2 = this.z.redSqr();
    var pz2 = p.z.redSqr();
    if (this.x.redMul(pz2).redISub(p.x.redMul(z2)).cmpn(0) !== 0)
      return false;
  
    // y1 * z2^3 == y2 * z1^3
    var z3 = z2.redMul(this.z);
    var pz3 = pz2.redMul(p.z);
    return this.y.redMul(pz3).redISub(p.y.redMul(z3)).cmpn(0) === 0;
  };
  
  JPoint.prototype.eqXToP = function eqXToP(x) {
    var zs = this.z.redSqr();
    var rx = x.toRed(this.curve.red).redMul(zs);
    if (this.x.cmp(rx) === 0)
      return true;
  
    var xc = x.clone();
    var t = this.curve.redN.redMul(zs);
    for (;;) {
      xc.iadd(this.curve.n);
      if (xc.cmp(this.curve.p) >= 0)
        return false;
  
      rx.redIAdd(t);
      if (this.x.cmp(rx) === 0)
        return true;
    }
    return false;
  };
  
  JPoint.prototype.inspect = function inspect() {
    if (this.isInfinity())
      return '<EC JPoint Infinity>';
    return '<EC JPoint x: ' + this.x.toString(16, 2) +
        ' y: ' + this.y.toString(16, 2) +
        ' z: ' + this.z.toString(16, 2) + '>';
  };
  
  JPoint.prototype.isInfinity = function isInfinity() {
    // XXX This code assumes that zero is always zero in red
    return this.z.cmpn(0) === 0;
  };
  
  },{"../../elliptic":11,"../curve":14,"bn.js":8,"inherits":38}],17:[function(require,module,exports){
  'use strict';
  
  var curves = exports;
  
  var hash = require('hash.js');
  var elliptic = require('../elliptic');
  
  var assert = elliptic.utils.assert;
  
  function PresetCurve(options) {
    if (options.type === 'short')
      this.curve = new elliptic.curve.short(options);
    else if (options.type === 'edwards')
      this.curve = new elliptic.curve.edwards(options);
    else
      this.curve = new elliptic.curve.mont(options);
    this.g = this.curve.g;
    this.n = this.curve.n;
    this.hash = options.hash;
  
    assert(this.g.validate(), 'Invalid curve');
    assert(this.g.mul(this.n).isInfinity(), 'Invalid curve, G*N != O');
  }
  curves.PresetCurve = PresetCurve;
  
  function defineCurve(name, options) {
    Object.defineProperty(curves, name, {
      configurable: true,
      enumerable: true,
      get: function() {
        var curve = new PresetCurve(options);
        Object.defineProperty(curves, name, {
          configurable: true,
          enumerable: true,
          value: curve
        });
        return curve;
      }
    });
  }
  
  defineCurve('p192', {
    type: 'short',
    prime: 'p192',
    p: 'ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff',
    a: 'ffffffff ffffffff ffffffff fffffffe ffffffff fffffffc',
    b: '64210519 e59c80e7 0fa7e9ab 72243049 feb8deec c146b9b1',
    n: 'ffffffff ffffffff ffffffff 99def836 146bc9b1 b4d22831',
    hash: hash.sha256,
    gRed: false,
    g: [
      '188da80e b03090f6 7cbf20eb 43a18800 f4ff0afd 82ff1012',
      '07192b95 ffc8da78 631011ed 6b24cdd5 73f977a1 1e794811'
    ]
  });
  
  defineCurve('p224', {
    type: 'short',
    prime: 'p224',
    p: 'ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001',
    a: 'ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff fffffffe',
    b: 'b4050a85 0c04b3ab f5413256 5044b0b7 d7bfd8ba 270b3943 2355ffb4',
    n: 'ffffffff ffffffff ffffffff ffff16a2 e0b8f03e 13dd2945 5c5c2a3d',
    hash: hash.sha256,
    gRed: false,
    g: [
      'b70e0cbd 6bb4bf7f 321390b9 4a03c1d3 56c21122 343280d6 115c1d21',
      'bd376388 b5f723fb 4c22dfe6 cd4375a0 5a074764 44d58199 85007e34'
    ]
  });
  
  defineCurve('p256', {
    type: 'short',
    prime: null,
    p: 'ffffffff 00000001 00000000 00000000 00000000 ffffffff ffffffff ffffffff',
    a: 'ffffffff 00000001 00000000 00000000 00000000 ffffffff ffffffff fffffffc',
    b: '5ac635d8 aa3a93e7 b3ebbd55 769886bc 651d06b0 cc53b0f6 3bce3c3e 27d2604b',
    n: 'ffffffff 00000000 ffffffff ffffffff bce6faad a7179e84 f3b9cac2 fc632551',
    hash: hash.sha256,
    gRed: false,
    g: [
      '6b17d1f2 e12c4247 f8bce6e5 63a440f2 77037d81 2deb33a0 f4a13945 d898c296',
      '4fe342e2 fe1a7f9b 8ee7eb4a 7c0f9e16 2bce3357 6b315ece cbb64068 37bf51f5'
    ]
  });
  
  defineCurve('p384', {
    type: 'short',
    prime: null,
    p: 'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ' +
       'fffffffe ffffffff 00000000 00000000 ffffffff',
    a: 'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ' +
       'fffffffe ffffffff 00000000 00000000 fffffffc',
    b: 'b3312fa7 e23ee7e4 988e056b e3f82d19 181d9c6e fe814112 0314088f ' +
       '5013875a c656398d 8a2ed19d 2a85c8ed d3ec2aef',
    n: 'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff c7634d81 ' +
       'f4372ddf 581a0db2 48b0a77a ecec196a ccc52973',
    hash: hash.sha384,
    gRed: false,
    g: [
      'aa87ca22 be8b0537 8eb1c71e f320ad74 6e1d3b62 8ba79b98 59f741e0 82542a38 ' +
      '5502f25d bf55296c 3a545e38 72760ab7',
      '3617de4a 96262c6f 5d9e98bf 9292dc29 f8f41dbd 289a147c e9da3113 b5f0b8c0 ' +
      '0a60b1ce 1d7e819d 7a431d7c 90ea0e5f'
    ]
  });
  
  defineCurve('p521', {
    type: 'short',
    prime: null,
    p: '000001ff ffffffff ffffffff ffffffff ffffffff ffffffff ' +
       'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ' +
       'ffffffff ffffffff ffffffff ffffffff ffffffff',
    a: '000001ff ffffffff ffffffff ffffffff ffffffff ffffffff ' +
       'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ' +
       'ffffffff ffffffff ffffffff ffffffff fffffffc',
    b: '00000051 953eb961 8e1c9a1f 929a21a0 b68540ee a2da725b ' +
       '99b315f3 b8b48991 8ef109e1 56193951 ec7e937b 1652c0bd ' +
       '3bb1bf07 3573df88 3d2c34f1 ef451fd4 6b503f00',
    n: '000001ff ffffffff ffffffff ffffffff ffffffff ffffffff ' +
       'ffffffff ffffffff fffffffa 51868783 bf2f966b 7fcc0148 ' +
       'f709a5d0 3bb5c9b8 899c47ae bb6fb71e 91386409',
    hash: hash.sha512,
    gRed: false,
    g: [
      '000000c6 858e06b7 0404e9cd 9e3ecb66 2395b442 9c648139 ' +
      '053fb521 f828af60 6b4d3dba a14b5e77 efe75928 fe1dc127 ' +
      'a2ffa8de 3348b3c1 856a429b f97e7e31 c2e5bd66',
      '00000118 39296a78 9a3bc004 5c8a5fb4 2c7d1bd9 98f54449 ' +
      '579b4468 17afbd17 273e662c 97ee7299 5ef42640 c550b901 ' +
      '3fad0761 353c7086 a272c240 88be9476 9fd16650'
    ]
  });
  
  defineCurve('curve25519', {
    type: 'mont',
    prime: 'p25519',
    p: '7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed',
    a: '76d06',
    b: '1',
    n: '1000000000000000 0000000000000000 14def9dea2f79cd6 5812631a5cf5d3ed',
    hash: hash.sha256,
    gRed: false,
    g: [
      '9'
    ]
  });
  
  defineCurve('ed25519', {
    type: 'edwards',
    prime: 'p25519',
    p: '7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed',
    a: '-1',
    c: '1',
    // -121665 * (121666^(-1)) (mod P)
    d: '52036cee2b6ffe73 8cc740797779e898 00700a4d4141d8ab 75eb4dca135978a3',
    n: '1000000000000000 0000000000000000 14def9dea2f79cd6 5812631a5cf5d3ed',
    hash: hash.sha256,
    gRed: false,
    g: [
      '216936d3cd6e53fec0a4e231fdd6dc5c692cc7609525a7b2c9562d608f25d51a',
  
      // 4/5
      '6666666666666666666666666666666666666666666666666666666666666658'
    ]
  });
  
  var pre;
  try {
    pre = require('./precomputed/secp256k1');
  } catch (e) {
    pre = undefined;
  }
  
  defineCurve('secp256k1', {
    type: 'short',
    prime: 'k256',
    p: 'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f',
    a: '0',
    b: '7',
    n: 'ffffffff ffffffff ffffffff fffffffe baaedce6 af48a03b bfd25e8c d0364141',
    h: '1',
    hash: hash.sha256,
  
    // Precomputed endomorphism
    beta: '7ae96a2b657c07106e64479eac3434e99cf0497512f58995c1396c28719501ee',
    lambda: '5363ad4cc05c30e0a5261c028812645a122e22ea20816678df02967c1b23bd72',
    basis: [
      {
        a: '3086d221a7d46bcde86c90e49284eb15',
        b: '-e4437ed6010e88286f547fa90abfe4c3'
      },
      {
        a: '114ca50f7a8e2f3f657c1108d9d44cfd8',
        b: '3086d221a7d46bcde86c90e49284eb15'
      }
    ],
  
    gRed: false,
    g: [
      '79be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798',
      '483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8',
      pre
    ]
  });
  
  },{"../elliptic":11,"./precomputed/secp256k1":23,"hash.js":26}],18:[function(require,module,exports){
  'use strict';
  
  var BN = require('bn.js');
  var elliptic = require('../../elliptic');
  var utils = elliptic.utils;
  var assert = utils.assert;
  
  var KeyPair = require('./key');
  var Signature = require('./signature');
  
  function EC(options) {
    if (!(this instanceof EC))
      return new EC(options);
  
    // Shortcut `elliptic.ec(curve-name)`
    if (typeof options === 'string') {
      assert(elliptic.curves.hasOwnProperty(options), 'Unknown curve ' + options);
  
      options = elliptic.curves[options];
    }
  
    // Shortcut for `elliptic.ec(elliptic.curves.curveName)`
    if (options instanceof elliptic.curves.PresetCurve)
      options = { curve: options };
  
    this.curve = options.curve.curve;
    this.n = this.curve.n;
    this.nh = this.n.ushrn(1);
    this.g = this.curve.g;
  
    // Point on curve
    this.g = options.curve.g;
    this.g.precompute(options.curve.n.bitLength() + 1);
  
    // Hash for function for DRBG
    this.hash = options.hash || options.curve.hash;
  }
  module.exports = EC;
  
  EC.prototype.keyPair = function keyPair(options) {
    return new KeyPair(this, options);
  };
  
  EC.prototype.keyFromPrivate = function keyFromPrivate(priv, enc) {
    return KeyPair.fromPrivate(this, priv, enc);
  };
  
  EC.prototype.keyFromPublic = function keyFromPublic(pub, enc) {
    return KeyPair.fromPublic(this, pub, enc);
  };
  
  EC.prototype.genKeyPair = function genKeyPair(options) {
    if (!options)
      options = {};
  
    // Instantiate Hmac_DRBG
    var drbg = new elliptic.hmacDRBG({
      hash: this.hash,
      pers: options.pers,
      entropy: options.entropy || elliptic.rand(this.hash.hmacStrength),
      nonce: this.n.toArray()
    });
  
    var bytes = this.n.byteLength();
    var ns2 = this.n.sub(new BN(2));
    do {
      var priv = new BN(drbg.generate(bytes));
      if (priv.cmp(ns2) > 0)
        continue;
  
      priv.iaddn(1);
      return this.keyFromPrivate(priv);
    } while (true);
  };
  
  EC.prototype._truncateToN = function truncateToN(msg, truncOnly) {
    var delta = msg.byteLength() * 8 - this.n.bitLength();
    if (delta > 0)
      msg = msg.ushrn(delta);
    if (!truncOnly && msg.cmp(this.n) >= 0)
      return msg.sub(this.n);
    else
      return msg;
  };
  
  EC.prototype.sign = function sign(msg, key, enc, options) {
    if (typeof enc === 'object') {
      options = enc;
      enc = null;
    }
    if (!options)
      options = {};
  
    key = this.keyFromPrivate(key, enc);
    msg = this._truncateToN(new BN(msg, 16));
  
    // Zero-extend key to provide enough entropy
    var bytes = this.n.byteLength();
    var bkey = key.getPrivate().toArray('be', bytes);
  
    // Zero-extend nonce to have the same byte size as N
    var nonce = msg.toArray('be', bytes);
  
    // Instantiate Hmac_DRBG
    var drbg = new elliptic.hmacDRBG({
      hash: this.hash,
      entropy: bkey,
      nonce: nonce,
      pers: options.pers,
      persEnc: options.persEnc
    });
  
    // Number of bytes to generate
    var ns1 = this.n.sub(new BN(1));
  
    for (var iter = 0; true; iter++) {
      var k = options.k ?
          options.k(iter) :
          new BN(drbg.generate(this.n.byteLength()));
      k = this._truncateToN(k, true);
      if (k.cmpn(1) <= 0 || k.cmp(ns1) >= 0)
        continue;
  
      var kp = this.g.mul(k);
      if (kp.isInfinity())
        continue;
  
      var kpX = kp.getX();
      var r = kpX.umod(this.n);
      if (r.cmpn(0) === 0)
        continue;
  
      var s = k.invm(this.n).mul(r.mul(key.getPrivate()).iadd(msg));
      s = s.umod(this.n);
      if (s.cmpn(0) === 0)
        continue;
  
      var recoveryParam = (kp.getY().isOdd() ? 1 : 0) |
                          (kpX.cmp(r) !== 0 ? 2 : 0);
  
      // Use complement of `s`, if it is > `n / 2`
      if (options.canonical && s.cmp(this.nh) > 0) {
        s = this.n.sub(s);
        recoveryParam ^= 1;
      }
  
      return new Signature({ r: r, s: s, recoveryParam: recoveryParam });
    }
  };
  
  EC.prototype.verify = function verify(msg, signature, key, enc) {
    msg = this._truncateToN(new BN(msg, 16));
    key = this.keyFromPublic(key, enc);
    signature = new Signature(signature, 'hex');
  
    // Perform primitive values validation
    var r = signature.r;
    var s = signature.s;
    if (r.cmpn(1) < 0 || r.cmp(this.n) >= 0)
      return false;
    if (s.cmpn(1) < 0 || s.cmp(this.n) >= 0)
      return false;
  
    // Validate signature
    var sinv = s.invm(this.n);
    var u1 = sinv.mul(msg).umod(this.n);
    var u2 = sinv.mul(r).umod(this.n);
  
    if (!this.curve._maxwellTrick) {
      var p = this.g.mulAdd(u1, key.getPublic(), u2);
      if (p.isInfinity())
        return false;
  
      return p.getX().umod(this.n).cmp(r) === 0;
    }
  
    // NOTE: Greg Maxwell's trick, inspired by:
    // https://git.io/vad3K
  
    var p = this.g.jmulAdd(u1, key.getPublic(), u2);
    if (p.isInfinity())
      return false;
  
    // Compare `p.x` of Jacobian point with `r`,
    // this will do `p.x == r * p.z^2` instead of multiplying `p.x` by the
    // inverse of `p.z^2`
    return p.eqXToP(r);
  };
  
  EC.prototype.recoverPubKey = function(msg, signature, j, enc) {
    assert((3 & j) === j, 'The recovery param is more than two bits');
    signature = new Signature(signature, enc);
  
    var n = this.n;
    var e = new BN(msg);
    var r = signature.r;
    var s = signature.s;
  
    // A set LSB signifies that the y-coordinate is odd
    var isYOdd = j & 1;
    var isSecondKey = j >> 1;
    if (r.cmp(this.curve.p.umod(this.curve.n)) >= 0 && isSecondKey)
      throw new Error('Unable to find sencond key candinate');
  
    // 1.1. Let x = r + jn.
    if (isSecondKey)
      r = this.curve.pointFromX(r.add(this.curve.n), isYOdd);
    else
      r = this.curve.pointFromX(r, isYOdd);
  
    var rInv = signature.r.invm(n);
    var s1 = n.sub(e).mul(rInv).umod(n);
    var s2 = s.mul(rInv).umod(n);
  
    // 1.6.1 Compute Q = r^-1 (sR -  eG)
    //               Q = r^-1 (sR + -eG)
    return this.g.mulAdd(s1, r, s2);
  };
  
  EC.prototype.getKeyRecoveryParam = function(e, signature, Q, enc) {
    signature = new Signature(signature, enc);
    if (signature.recoveryParam !== null)
      return signature.recoveryParam;
  
    for (var i = 0; i < 4; i++) {
      var Qprime;
      try {
        Qprime = this.recoverPubKey(e, signature, i);
      } catch (e) {
        continue;
      }
  
      if (Qprime.eq(Q))
        return i;
    }
    throw new Error('Unable to find valid recovery factor');
  };
  
  },{"../../elliptic":11,"./key":19,"./signature":20,"bn.js":8}],19:[function(require,module,exports){
  'use strict';
  
  var BN = require('bn.js');
  var elliptic = require('../../elliptic');
  var utils = elliptic.utils;
  var assert = utils.assert;
  
  function KeyPair(ec, options) {
    this.ec = ec;
    this.priv = null;
    this.pub = null;
  
    // KeyPair(ec, { priv: ..., pub: ... })
    if (options.priv)
      this._importPrivate(options.priv, options.privEnc);
    if (options.pub)
      this._importPublic(options.pub, options.pubEnc);
  }
  module.exports = KeyPair;
  
  KeyPair.fromPublic = function fromPublic(ec, pub, enc) {
    if (pub instanceof KeyPair)
      return pub;
  
    return new KeyPair(ec, {
      pub: pub,
      pubEnc: enc
    });
  };
  
  KeyPair.fromPrivate = function fromPrivate(ec, priv, enc) {
    if (priv instanceof KeyPair)
      return priv;
  
    return new KeyPair(ec, {
      priv: priv,
      privEnc: enc
    });
  };
  
  KeyPair.prototype.validate = function validate() {
    var pub = this.getPublic();
  
    if (pub.isInfinity())
      return { result: false, reason: 'Invalid public key' };
    if (!pub.validate())
      return { result: false, reason: 'Public key is not a point' };
    if (!pub.mul(this.ec.curve.n).isInfinity())
      return { result: false, reason: 'Public key * N != O' };
  
    return { result: true, reason: null };
  };
  
  KeyPair.prototype.getPublic = function getPublic(compact, enc) {
    // compact is optional argument
    if (typeof compact === 'string') {
      enc = compact;
      compact = null;
    }
  
    if (!this.pub)
      this.pub = this.ec.g.mul(this.priv);
  
    if (!enc)
      return this.pub;
  
    return this.pub.encode(enc, compact);
  };
  
  KeyPair.prototype.getPrivate = function getPrivate(enc) {
    if (enc === 'hex')
      return this.priv.toString(16, 2);
    else
      return this.priv;
  };
  
  KeyPair.prototype._importPrivate = function _importPrivate(key, enc) {
    this.priv = new BN(key, enc || 16);
  
    // Ensure that the priv won't be bigger than n, otherwise we may fail
    // in fixed multiplication method
    this.priv = this.priv.umod(this.ec.curve.n);
  };
  
  KeyPair.prototype._importPublic = function _importPublic(key, enc) {
    if (key.x || key.y) {
      // Montgomery points only have an `x` coordinate.
      // Weierstrass/Edwards points on the other hand have both `x` and
      // `y` coordinates.
      if (this.ec.curve.type === 'mont') {
        assert(key.x, 'Need x coordinate');
      } else if (this.ec.curve.type === 'short' ||
                 this.ec.curve.type === 'edwards') {
        assert(key.x && key.y, 'Need both x and y coordinate');
      }
      this.pub = this.ec.curve.point(key.x, key.y);
      return;
    }
    this.pub = this.ec.curve.decodePoint(key, enc);
  };
  
  // ECDH
  KeyPair.prototype.derive = function derive(pub) {
    return pub.mul(this.priv).getX();
  };
  
  // ECDSA
  KeyPair.prototype.sign = function sign(msg, enc, options) {
    return this.ec.sign(msg, this, enc, options);
  };
  
  KeyPair.prototype.verify = function verify(msg, signature) {
    return this.ec.verify(msg, signature, this);
  };
  
  KeyPair.prototype.inspect = function inspect() {
    return '<Key priv: ' + (this.priv && this.priv.toString(16, 2)) +
           ' pub: ' + (this.pub && this.pub.inspect()) + ' >';
  };
  
  },{"../../elliptic":11,"bn.js":8}],20:[function(require,module,exports){
  'use strict';
  
  var BN = require('bn.js');
  
  var elliptic = require('../../elliptic');
  var utils = elliptic.utils;
  var assert = utils.assert;
  
  function Signature(options, enc) {
    if (options instanceof Signature)
      return options;
  
    if (this._importDER(options, enc))
      return;
  
    assert(options.r && options.s, 'Signature without r or s');
    this.r = new BN(options.r, 16);
    this.s = new BN(options.s, 16);
    if (options.recoveryParam === undefined)
      this.recoveryParam = null;
    else
      this.recoveryParam = options.recoveryParam;
  }
  module.exports = Signature;
  
  function Position() {
    this.place = 0;
  }
  
  function getLength(buf, p) {
    var initial = buf[p.place++];
    if (!(initial & 0x80)) {
      return initial;
    }
    var octetLen = initial & 0xf;
    var val = 0;
    for (var i = 0, off = p.place; i < octetLen; i++, off++) {
      val <<= 8;
      val |= buf[off];
    }
    p.place = off;
    return val;
  }
  
  function rmPadding(buf) {
    var i = 0;
    var len = buf.length - 1;
    while (!buf[i] && !(buf[i + 1] & 0x80) && i < len) {
      i++;
    }
    if (i === 0) {
      return buf;
    }
    return buf.slice(i);
  }
  
  Signature.prototype._importDER = function _importDER(data, enc) {
    data = utils.toArray(data, enc);
    var p = new Position();
    if (data[p.place++] !== 0x30) {
      return false;
    }
    var len = getLength(data, p);
    if ((len + p.place) !== data.length) {
      return false;
    }
    if (data[p.place++] !== 0x02) {
      return false;
    }
    var rlen = getLength(data, p);
    var r = data.slice(p.place, rlen + p.place);
    p.place += rlen;
    if (data[p.place++] !== 0x02) {
      return false;
    }
    var slen = getLength(data, p);
    if (data.length !== slen + p.place) {
      return false;
    }
    var s = data.slice(p.place, slen + p.place);
    if (r[0] === 0 && (r[1] & 0x80)) {
      r = r.slice(1);
    }
    if (s[0] === 0 && (s[1] & 0x80)) {
      s = s.slice(1);
    }
  
    this.r = new BN(r);
    this.s = new BN(s);
    this.recoveryParam = null;
  
    return true;
  };
  
  function constructLength(arr, len) {
    if (len < 0x80) {
      arr.push(len);
      return;
    }
    var octets = 1 + (Math.log(len) / Math.LN2 >>> 3);
    arr.push(octets | 0x80);
    while (--octets) {
      arr.push((len >>> (octets << 3)) & 0xff);
    }
    arr.push(len);
  }
  
  Signature.prototype.toDER = function toDER(enc) {
    var r = this.r.toArray();
    var s = this.s.toArray();
  
    // Pad values
    if (r[0] & 0x80)
      r = [ 0 ].concat(r);
    // Pad values
    if (s[0] & 0x80)
      s = [ 0 ].concat(s);
  
    r = rmPadding(r);
    s = rmPadding(s);
  
    while (!s[0] && !(s[1] & 0x80)) {
      s = s.slice(1);
    }
    var arr = [ 0x02 ];
    constructLength(arr, r.length);
    arr = arr.concat(r);
    arr.push(0x02);
    constructLength(arr, s.length);
    var backHalf = arr.concat(s);
    var res = [ 0x30 ];
    constructLength(res, backHalf.length);
    res = res.concat(backHalf);
    return utils.encode(res, enc);
  };
  
  },{"../../elliptic":11,"bn.js":8}],21:[function(require,module,exports){
  arguments[4][13][0].apply(exports,arguments)
  },{"dup":13}],22:[function(require,module,exports){
  'use strict';
  
  var hash = require('hash.js');
  var elliptic = require('../elliptic');
  var utils = elliptic.utils;
  var assert = utils.assert;
  
  function HmacDRBG(options) {
    if (!(this instanceof HmacDRBG))
      return new HmacDRBG(options);
    this.hash = options.hash;
    this.predResist = !!options.predResist;
  
    this.outLen = this.hash.outSize;
    this.minEntropy = options.minEntropy || this.hash.hmacStrength;
  
    this.reseed = null;
    this.reseedInterval = null;
    this.K = null;
    this.V = null;
  
    var entropy = utils.toArray(options.entropy, options.entropyEnc);
    var nonce = utils.toArray(options.nonce, options.nonceEnc);
    var pers = utils.toArray(options.pers, options.persEnc);
    assert(entropy.length >= (this.minEntropy / 8),
           'Not enough entropy. Minimum is: ' + this.minEntropy + ' bits');
    this._init(entropy, nonce, pers);
  }
  module.exports = HmacDRBG;
  
  HmacDRBG.prototype._init = function init(entropy, nonce, pers) {
    var seed = entropy.concat(nonce).concat(pers);
  
    this.K = new Array(this.outLen / 8);
    this.V = new Array(this.outLen / 8);
    for (var i = 0; i < this.V.length; i++) {
      this.K[i] = 0x00;
      this.V[i] = 0x01;
    }
  
    this._update(seed);
    this.reseed = 1;
    this.reseedInterval = 0x1000000000000;  // 2^48
  };
  
  HmacDRBG.prototype._hmac = function hmac() {
    return new hash.hmac(this.hash, this.K);
  };
  
  HmacDRBG.prototype._update = function update(seed) {
    var kmac = this._hmac()
                   .update(this.V)
                   .update([ 0x00 ]);
    if (seed)
      kmac = kmac.update(seed);
    this.K = kmac.digest();
    this.V = this._hmac().update(this.V).digest();
    if (!seed)
      return;
  
    this.K = this._hmac()
                 .update(this.V)
                 .update([ 0x01 ])
                 .update(seed)
                 .digest();
    this.V = this._hmac().update(this.V).digest();
  };
  
  HmacDRBG.prototype.reseed = function reseed(entropy, entropyEnc, add, addEnc) {
    // Optional entropy enc
    if (typeof entropyEnc !== 'string') {
      addEnc = add;
      add = entropyEnc;
      entropyEnc = null;
    }
  
    entropy = utils.toBuffer(entropy, entropyEnc);
    add = utils.toBuffer(add, addEnc);
  
    assert(entropy.length >= (this.minEntropy / 8),
           'Not enough entropy. Minimum is: ' + this.minEntropy + ' bits');
  
    this._update(entropy.concat(add || []));
    this.reseed = 1;
  };
  
  HmacDRBG.prototype.generate = function generate(len, enc, add, addEnc) {
    if (this.reseed > this.reseedInterval)
      throw new Error('Reseed is required');
  
    // Optional encoding
    if (typeof enc !== 'string') {
      addEnc = add;
      add = enc;
      enc = null;
    }
  
    // Optional additional data
    if (add) {
      add = utils.toArray(add, addEnc);
      this._update(add);
    }
  
    var temp = [];
    while (temp.length < len) {
      this.V = this._hmac().update(this.V).digest();
      temp = temp.concat(this.V);
    }
  
    var res = temp.slice(0, len);
    this._update(add);
    this.reseed++;
    return utils.encode(res, enc);
  };
  
  },{"../elliptic":11,"hash.js":26}],23:[function(require,module,exports){
  module.exports = undefined;
  },{}],24:[function(require,module,exports){
  'use strict';
  
  var utils = exports;
  var BN = require('bn.js');
  
  utils.assert = function assert(val, msg) {
    if (!val)
      throw new Error(msg || 'Assertion failed');
  };
  
  function toArray(msg, enc) {
    if (Array.isArray(msg))
      return msg.slice();
    if (!msg)
      return [];
    var res = [];
    if (typeof msg !== 'string') {
      for (var i = 0; i < msg.length; i++)
        res[i] = msg[i] | 0;
      return res;
    }
    if (!enc) {
      for (var i = 0; i < msg.length; i++) {
        var c = msg.charCodeAt(i);
        var hi = c >> 8;
        var lo = c & 0xff;
        if (hi)
          res.push(hi, lo);
        else
          res.push(lo);
      }
    } else if (enc === 'hex') {
      msg = msg.replace(/[^a-z0-9]+/ig, '');
      if (msg.length % 2 !== 0)
        msg = '0' + msg;
      for (var i = 0; i < msg.length; i += 2)
        res.push(parseInt(msg[i] + msg[i + 1], 16));
    }
    return res;
  }
  utils.toArray = toArray;
  
  function zero2(word) {
    if (word.length === 1)
      return '0' + word;
    else
      return word;
  }
  utils.zero2 = zero2;
  
  function toHex(msg) {
    var res = '';
    for (var i = 0; i < msg.length; i++)
      res += zero2(msg[i].toString(16));
    return res;
  }
  utils.toHex = toHex;
  
  utils.encode = function encode(arr, enc) {
    if (enc === 'hex')
      return toHex(arr);
    else
      return arr;
  };
  
  // Represent num in a w-NAF form
  function getNAF(num, w) {
    var naf = [];
    var ws = 1 << (w + 1);
    var k = num.clone();
    while (k.cmpn(1) >= 0) {
      var z;
      if (k.isOdd()) {
        var mod = k.andln(ws - 1);
        if (mod > (ws >> 1) - 1)
          z = (ws >> 1) - mod;
        else
          z = mod;
        k.isubn(z);
      } else {
        z = 0;
      }
      naf.push(z);
  
      // Optimization, shift by word if possible
      var shift = (k.cmpn(0) !== 0 && k.andln(ws - 1) === 0) ? (w + 1) : 1;
      for (var i = 1; i < shift; i++)
        naf.push(0);
      k.iushrn(shift);
    }
  
    return naf;
  }
  utils.getNAF = getNAF;
  
  // Represent k1, k2 in a Joint Sparse Form
  function getJSF(k1, k2) {
    var jsf = [
      [],
      []
    ];
  
    k1 = k1.clone();
    k2 = k2.clone();
    var d1 = 0;
    var d2 = 0;
    while (k1.cmpn(-d1) > 0 || k2.cmpn(-d2) > 0) {
  
      // First phase
      var m14 = (k1.andln(3) + d1) & 3;
      var m24 = (k2.andln(3) + d2) & 3;
      if (m14 === 3)
        m14 = -1;
      if (m24 === 3)
        m24 = -1;
      var u1;
      if ((m14 & 1) === 0) {
        u1 = 0;
      } else {
        var m8 = (k1.andln(7) + d1) & 7;
        if ((m8 === 3 || m8 === 5) && m24 === 2)
          u1 = -m14;
        else
          u1 = m14;
      }
      jsf[0].push(u1);
  
      var u2;
      if ((m24 & 1) === 0) {
        u2 = 0;
      } else {
        var m8 = (k2.andln(7) + d2) & 7;
        if ((m8 === 3 || m8 === 5) && m14 === 2)
          u2 = -m24;
        else
          u2 = m24;
      }
      jsf[1].push(u2);
  
      // Second phase
      if (2 * d1 === u1 + 1)
        d1 = 1 - d1;
      if (2 * d2 === u2 + 1)
        d2 = 1 - d2;
      k1.iushrn(1);
      k2.iushrn(1);
    }
  
    return jsf;
  }
  utils.getJSF = getJSF;
  
  function cachedProperty(obj, name, computer) {
    var key = '_' + name;
    obj.prototype[name] = function cachedProperty() {
      return this[key] !== undefined ? this[key] :
             this[key] = computer.call(this);
    };
  }
  utils.cachedProperty = cachedProperty;
  
  function parseBytes(bytes) {
    return typeof bytes === 'string' ? utils.toArray(bytes, 'hex') :
                                       bytes;
  }
  utils.parseBytes = parseBytes;
  
  function intFromLE(bytes) {
    return new BN(bytes, 'hex', 'le');
  }
  utils.intFromLE = intFromLE;
  
  
  },{"bn.js":8}],25:[function(require,module,exports){
  module.exports={"version":"6.3.3"}
  },{}],26:[function(require,module,exports){
  var hash = exports;
  
  hash.utils = require('./hash/utils');
  hash.common = require('./hash/common');
  hash.sha = require('./hash/sha');
  hash.ripemd = require('./hash/ripemd');
  hash.hmac = require('./hash/hmac');
  
  // Proxy hash functions to the main object
  hash.sha1 = hash.sha.sha1;
  hash.sha256 = hash.sha.sha256;
  hash.sha224 = hash.sha.sha224;
  hash.sha384 = hash.sha.sha384;
  hash.sha512 = hash.sha.sha512;
  hash.ripemd160 = hash.ripemd.ripemd160;
  
  },{"./hash/common":27,"./hash/hmac":28,"./hash/ripemd":29,"./hash/sha":30,"./hash/utils":37}],27:[function(require,module,exports){
  'use strict';
  
  var utils = require('./utils');
  var assert = require('minimalistic-assert');
  
  function BlockHash() {
    this.pending = null;
    this.pendingTotal = 0;
    this.blockSize = this.constructor.blockSize;
    this.outSize = this.constructor.outSize;
    this.hmacStrength = this.constructor.hmacStrength;
    this.padLength = this.constructor.padLength / 8;
    this.endian = 'big';
  
    this._delta8 = this.blockSize / 8;
    this._delta32 = this.blockSize / 32;
  }
  exports.BlockHash = BlockHash;
  
  BlockHash.prototype.update = function update(msg, enc) {
    // Convert message to array, pad it, and join into 32bit blocks
    msg = utils.toArray(msg, enc);
    if (!this.pending)
      this.pending = msg;
    else
      this.pending = this.pending.concat(msg);
    this.pendingTotal += msg.length;
  
    // Enough data, try updating
    if (this.pending.length >= this._delta8) {
      msg = this.pending;
  
      // Process pending data in blocks
      var r = msg.length % this._delta8;
      this.pending = msg.slice(msg.length - r, msg.length);
      if (this.pending.length === 0)
        this.pending = null;
  
      msg = utils.join32(msg, 0, msg.length - r, this.endian);
      for (var i = 0; i < msg.length; i += this._delta32)
        this._update(msg, i, i + this._delta32);
    }
  
    return this;
  };
  
  BlockHash.prototype.digest = function digest(enc) {
    this.update(this._pad());
    assert(this.pending === null);
  
    return this._digest(enc);
  };
  
  BlockHash.prototype._pad = function pad() {
    var len = this.pendingTotal;
    var bytes = this._delta8;
    var k = bytes - ((len + this.padLength) % bytes);
    var res = new Array(k + this.padLength);
    res[0] = 0x80;
    for (var i = 1; i < k; i++)
      res[i] = 0;
  
    // Append length
    len <<= 3;
    if (this.endian === 'big') {
      for (var t = 8; t < this.padLength; t++)
        res[i++] = 0;
  
      res[i++] = 0;
      res[i++] = 0;
      res[i++] = 0;
      res[i++] = 0;
      res[i++] = (len >>> 24) & 0xff;
      res[i++] = (len >>> 16) & 0xff;
      res[i++] = (len >>> 8) & 0xff;
      res[i++] = len & 0xff;
    } else {
      res[i++] = len & 0xff;
      res[i++] = (len >>> 8) & 0xff;
      res[i++] = (len >>> 16) & 0xff;
      res[i++] = (len >>> 24) & 0xff;
      res[i++] = 0;
      res[i++] = 0;
      res[i++] = 0;
      res[i++] = 0;
  
      for (t = 8; t < this.padLength; t++)
        res[i++] = 0;
    }
  
    return res;
  };
  
  },{"./utils":37,"minimalistic-assert":40}],28:[function(require,module,exports){
  'use strict';
  
  var utils = require('./utils');
  var assert = require('minimalistic-assert');
  
  function Hmac(hash, key, enc) {
    if (!(this instanceof Hmac))
      return new Hmac(hash, key, enc);
    this.Hash = hash;
    this.blockSize = hash.blockSize / 8;
    this.outSize = hash.outSize / 8;
    this.inner = null;
    this.outer = null;
  
    this._init(utils.toArray(key, enc));
  }
  module.exports = Hmac;
  
  Hmac.prototype._init = function init(key) {
    // Shorten key, if needed
    if (key.length > this.blockSize)
      key = new this.Hash().update(key).digest();
    assert(key.length <= this.blockSize);
  
    // Add padding to key
    for (var i = key.length; i < this.blockSize; i++)
      key.push(0);
  
    for (i = 0; i < key.length; i++)
      key[i] ^= 0x36;
    this.inner = new this.Hash().update(key);
  
    // 0x36 ^ 0x5c = 0x6a
    for (i = 0; i < key.length; i++)
      key[i] ^= 0x6a;
    this.outer = new this.Hash().update(key);
  };
  
  Hmac.prototype.update = function update(msg, enc) {
    this.inner.update(msg, enc);
    return this;
  };
  
  Hmac.prototype.digest = function digest(enc) {
    this.outer.update(this.inner.digest());
    return this.outer.digest(enc);
  };
  
  },{"./utils":37,"minimalistic-assert":40}],29:[function(require,module,exports){
  module.exports = {ripemd160: null}
  },{}],30:[function(require,module,exports){
  'use strict';
  
  exports.sha1 = require('./sha/1');
  exports.sha224 = require('./sha/224');
  exports.sha256 = require('./sha/256');
  exports.sha384 = require('./sha/384');
  exports.sha512 = require('./sha/512');
  
  },{"./sha/1":31,"./sha/224":32,"./sha/256":33,"./sha/384":34,"./sha/512":35}],31:[function(require,module,exports){
  arguments[4][13][0].apply(exports,arguments)
  },{"dup":13}],32:[function(require,module,exports){
  arguments[4][13][0].apply(exports,arguments)
  },{"dup":13}],33:[function(require,module,exports){
  'use strict';
  
  var utils = require('../utils');
  var common = require('../common');
  var shaCommon = require('./common');
  var assert = require('minimalistic-assert');
  
  var sum32 = utils.sum32;
  var sum32_4 = utils.sum32_4;
  var sum32_5 = utils.sum32_5;
  var ch32 = shaCommon.ch32;
  var maj32 = shaCommon.maj32;
  var s0_256 = shaCommon.s0_256;
  var s1_256 = shaCommon.s1_256;
  var g0_256 = shaCommon.g0_256;
  var g1_256 = shaCommon.g1_256;
  
  var BlockHash = common.BlockHash;
  
  var sha256_K = [
    0x428a2f98, 0x71374491, 0xb5c0fbcf, 0xe9b5dba5,
    0x3956c25b, 0x59f111f1, 0x923f82a4, 0xab1c5ed5,
    0xd807aa98, 0x12835b01, 0x243185be, 0x550c7dc3,
    0x72be5d74, 0x80deb1fe, 0x9bdc06a7, 0xc19bf174,
    0xe49b69c1, 0xefbe4786, 0x0fc19dc6, 0x240ca1cc,
    0x2de92c6f, 0x4a7484aa, 0x5cb0a9dc, 0x76f988da,
    0x983e5152, 0xa831c66d, 0xb00327c8, 0xbf597fc7,
    0xc6e00bf3, 0xd5a79147, 0x06ca6351, 0x14292967,
    0x27b70a85, 0x2e1b2138, 0x4d2c6dfc, 0x53380d13,
    0x650a7354, 0x766a0abb, 0x81c2c92e, 0x92722c85,
    0xa2bfe8a1, 0xa81a664b, 0xc24b8b70, 0xc76c51a3,
    0xd192e819, 0xd6990624, 0xf40e3585, 0x106aa070,
    0x19a4c116, 0x1e376c08, 0x2748774c, 0x34b0bcb5,
    0x391c0cb3, 0x4ed8aa4a, 0x5b9cca4f, 0x682e6ff3,
    0x748f82ee, 0x78a5636f, 0x84c87814, 0x8cc70208,
    0x90befffa, 0xa4506ceb, 0xbef9a3f7, 0xc67178f2
  ];
  
  function SHA256() {
    if (!(this instanceof SHA256))
      return new SHA256();
  
    BlockHash.call(this);
    this.h = [
      0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a,
      0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19
    ];
    this.k = sha256_K;
    this.W = new Array(64);
  }
  utils.inherits(SHA256, BlockHash);
  module.exports = SHA256;
  
  SHA256.blockSize = 512;
  SHA256.outSize = 256;
  SHA256.hmacStrength = 192;
  SHA256.padLength = 64;
  
  SHA256.prototype._update = function _update(msg, start) {
    var W = this.W;
  
    for (var i = 0; i < 16; i++)
      W[i] = msg[start + i];
    for (; i < W.length; i++)
      W[i] = sum32_4(g1_256(W[i - 2]), W[i - 7], g0_256(W[i - 15]), W[i - 16]);
  
    var a = this.h[0];
    var b = this.h[1];
    var c = this.h[2];
    var d = this.h[3];
    var e = this.h[4];
    var f = this.h[5];
    var g = this.h[6];
    var h = this.h[7];
  
    assert(this.k.length === W.length);
    for (i = 0; i < W.length; i++) {
      var T1 = sum32_5(h, s1_256(e), ch32(e, f, g), this.k[i], W[i]);
      var T2 = sum32(s0_256(a), maj32(a, b, c));
      h = g;
      g = f;
      f = e;
      e = sum32(d, T1);
      d = c;
      c = b;
      b = a;
      a = sum32(T1, T2);
    }
  
    this.h[0] = sum32(this.h[0], a);
    this.h[1] = sum32(this.h[1], b);
    this.h[2] = sum32(this.h[2], c);
    this.h[3] = sum32(this.h[3], d);
    this.h[4] = sum32(this.h[4], e);
    this.h[5] = sum32(this.h[5], f);
    this.h[6] = sum32(this.h[6], g);
    this.h[7] = sum32(this.h[7], h);
  };
  
  SHA256.prototype._digest = function digest(enc) {
    if (enc === 'hex')
      return utils.toHex32(this.h, 'big');
    else
      return utils.split32(this.h, 'big');
  };
  
  },{"../common":27,"../utils":37,"./common":36,"minimalistic-assert":40}],34:[function(require,module,exports){
  arguments[4][13][0].apply(exports,arguments)
  },{"dup":13}],35:[function(require,module,exports){
  'use strict';
  
  var utils = require('../utils');
  var common = require('../common');
  var assert = require('minimalistic-assert');
  
  var rotr64_hi = utils.rotr64_hi;
  var rotr64_lo = utils.rotr64_lo;
  var shr64_hi = utils.shr64_hi;
  var shr64_lo = utils.shr64_lo;
  var sum64 = utils.sum64;
  var sum64_hi = utils.sum64_hi;
  var sum64_lo = utils.sum64_lo;
  var sum64_4_hi = utils.sum64_4_hi;
  var sum64_4_lo = utils.sum64_4_lo;
  var sum64_5_hi = utils.sum64_5_hi;
  var sum64_5_lo = utils.sum64_5_lo;
  
  var BlockHash = common.BlockHash;
  
  var sha512_K = [
    0x428a2f98, 0xd728ae22, 0x71374491, 0x23ef65cd,
    0xb5c0fbcf, 0xec4d3b2f, 0xe9b5dba5, 0x8189dbbc,
    0x3956c25b, 0xf348b538, 0x59f111f1, 0xb605d019,
    0x923f82a4, 0xaf194f9b, 0xab1c5ed5, 0xda6d8118,
    0xd807aa98, 0xa3030242, 0x12835b01, 0x45706fbe,
    0x243185be, 0x4ee4b28c, 0x550c7dc3, 0xd5ffb4e2,
    0x72be5d74, 0xf27b896f, 0x80deb1fe, 0x3b1696b1,
    0x9bdc06a7, 0x25c71235, 0xc19bf174, 0xcf692694,
    0xe49b69c1, 0x9ef14ad2, 0xefbe4786, 0x384f25e3,
    0x0fc19dc6, 0x8b8cd5b5, 0x240ca1cc, 0x77ac9c65,
    0x2de92c6f, 0x592b0275, 0x4a7484aa, 0x6ea6e483,
    0x5cb0a9dc, 0xbd41fbd4, 0x76f988da, 0x831153b5,
    0x983e5152, 0xee66dfab, 0xa831c66d, 0x2db43210,
    0xb00327c8, 0x98fb213f, 0xbf597fc7, 0xbeef0ee4,
    0xc6e00bf3, 0x3da88fc2, 0xd5a79147, 0x930aa725,
    0x06ca6351, 0xe003826f, 0x14292967, 0x0a0e6e70,
    0x27b70a85, 0x46d22ffc, 0x2e1b2138, 0x5c26c926,
    0x4d2c6dfc, 0x5ac42aed, 0x53380d13, 0x9d95b3df,
    0x650a7354, 0x8baf63de, 0x766a0abb, 0x3c77b2a8,
    0x81c2c92e, 0x47edaee6, 0x92722c85, 0x1482353b,
    0xa2bfe8a1, 0x4cf10364, 0xa81a664b, 0xbc423001,
    0xc24b8b70, 0xd0f89791, 0xc76c51a3, 0x0654be30,
    0xd192e819, 0xd6ef5218, 0xd6990624, 0x5565a910,
    0xf40e3585, 0x5771202a, 0x106aa070, 0x32bbd1b8,
    0x19a4c116, 0xb8d2d0c8, 0x1e376c08, 0x5141ab53,
    0x2748774c, 0xdf8eeb99, 0x34b0bcb5, 0xe19b48a8,
    0x391c0cb3, 0xc5c95a63, 0x4ed8aa4a, 0xe3418acb,
    0x5b9cca4f, 0x7763e373, 0x682e6ff3, 0xd6b2b8a3,
    0x748f82ee, 0x5defb2fc, 0x78a5636f, 0x43172f60,
    0x84c87814, 0xa1f0ab72, 0x8cc70208, 0x1a6439ec,
    0x90befffa, 0x23631e28, 0xa4506ceb, 0xde82bde9,
    0xbef9a3f7, 0xb2c67915, 0xc67178f2, 0xe372532b,
    0xca273ece, 0xea26619c, 0xd186b8c7, 0x21c0c207,
    0xeada7dd6, 0xcde0eb1e, 0xf57d4f7f, 0xee6ed178,
    0x06f067aa, 0x72176fba, 0x0a637dc5, 0xa2c898a6,
    0x113f9804, 0xbef90dae, 0x1b710b35, 0x131c471b,
    0x28db77f5, 0x23047d84, 0x32caab7b, 0x40c72493,
    0x3c9ebe0a, 0x15c9bebc, 0x431d67c4, 0x9c100d4c,
    0x4cc5d4be, 0xcb3e42b6, 0x597f299c, 0xfc657e2a,
    0x5fcb6fab, 0x3ad6faec, 0x6c44198c, 0x4a475817
  ];
  
  function SHA512() {
    if (!(this instanceof SHA512))
      return new SHA512();
  
    BlockHash.call(this);
    this.h = [
      0x6a09e667, 0xf3bcc908,
      0xbb67ae85, 0x84caa73b,
      0x3c6ef372, 0xfe94f82b,
      0xa54ff53a, 0x5f1d36f1,
      0x510e527f, 0xade682d1,
      0x9b05688c, 0x2b3e6c1f,
      0x1f83d9ab, 0xfb41bd6b,
      0x5be0cd19, 0x137e2179 ];
    this.k = sha512_K;
    this.W = new Array(160);
  }
  utils.inherits(SHA512, BlockHash);
  module.exports = SHA512;
  
  SHA512.blockSize = 1024;
  SHA512.outSize = 512;
  SHA512.hmacStrength = 192;
  SHA512.padLength = 128;
  
  SHA512.prototype._prepareBlock = function _prepareBlock(msg, start) {
    var W = this.W;
  
    // 32 x 32bit words
    for (var i = 0; i < 32; i++)
      W[i] = msg[start + i];
    for (; i < W.length; i += 2) {
      var c0_hi = g1_512_hi(W[i - 4], W[i - 3]);  // i - 2
      var c0_lo = g1_512_lo(W[i - 4], W[i - 3]);
      var c1_hi = W[i - 14];  // i - 7
      var c1_lo = W[i - 13];
      var c2_hi = g0_512_hi(W[i - 30], W[i - 29]);  // i - 15
      var c2_lo = g0_512_lo(W[i - 30], W[i - 29]);
      var c3_hi = W[i - 32];  // i - 16
      var c3_lo = W[i - 31];
  
      W[i] = sum64_4_hi(
        c0_hi, c0_lo,
        c1_hi, c1_lo,
        c2_hi, c2_lo,
        c3_hi, c3_lo);
      W[i + 1] = sum64_4_lo(
        c0_hi, c0_lo,
        c1_hi, c1_lo,
        c2_hi, c2_lo,
        c3_hi, c3_lo);
    }
  };
  
  SHA512.prototype._update = function _update(msg, start) {
    this._prepareBlock(msg, start);
  
    var W = this.W;
  
    var ah = this.h[0];
    var al = this.h[1];
    var bh = this.h[2];
    var bl = this.h[3];
    var ch = this.h[4];
    var cl = this.h[5];
    var dh = this.h[6];
    var dl = this.h[7];
    var eh = this.h[8];
    var el = this.h[9];
    var fh = this.h[10];
    var fl = this.h[11];
    var gh = this.h[12];
    var gl = this.h[13];
    var hh = this.h[14];
    var hl = this.h[15];
  
    assert(this.k.length === W.length);
    for (var i = 0; i < W.length; i += 2) {
      var c0_hi = hh;
      var c0_lo = hl;
      var c1_hi = s1_512_hi(eh, el);
      var c1_lo = s1_512_lo(eh, el);
      var c2_hi = ch64_hi(eh, el, fh, fl, gh, gl);
      var c2_lo = ch64_lo(eh, el, fh, fl, gh, gl);
      var c3_hi = this.k[i];
      var c3_lo = this.k[i + 1];
      var c4_hi = W[i];
      var c4_lo = W[i + 1];
  
      var T1_hi = sum64_5_hi(
        c0_hi, c0_lo,
        c1_hi, c1_lo,
        c2_hi, c2_lo,
        c3_hi, c3_lo,
        c4_hi, c4_lo);
      var T1_lo = sum64_5_lo(
        c0_hi, c0_lo,
        c1_hi, c1_lo,
        c2_hi, c2_lo,
        c3_hi, c3_lo,
        c4_hi, c4_lo);
  
      c0_hi = s0_512_hi(ah, al);
      c0_lo = s0_512_lo(ah, al);
      c1_hi = maj64_hi(ah, al, bh, bl, ch, cl);
      c1_lo = maj64_lo(ah, al, bh, bl, ch, cl);
  
      var T2_hi = sum64_hi(c0_hi, c0_lo, c1_hi, c1_lo);
      var T2_lo = sum64_lo(c0_hi, c0_lo, c1_hi, c1_lo);
  
      hh = gh;
      hl = gl;
  
      gh = fh;
      gl = fl;
  
      fh = eh;
      fl = el;
  
      eh = sum64_hi(dh, dl, T1_hi, T1_lo);
      el = sum64_lo(dl, dl, T1_hi, T1_lo);
  
      dh = ch;
      dl = cl;
  
      ch = bh;
      cl = bl;
  
      bh = ah;
      bl = al;
  
      ah = sum64_hi(T1_hi, T1_lo, T2_hi, T2_lo);
      al = sum64_lo(T1_hi, T1_lo, T2_hi, T2_lo);
    }
  
    sum64(this.h, 0, ah, al);
    sum64(this.h, 2, bh, bl);
    sum64(this.h, 4, ch, cl);
    sum64(this.h, 6, dh, dl);
    sum64(this.h, 8, eh, el);
    sum64(this.h, 10, fh, fl);
    sum64(this.h, 12, gh, gl);
    sum64(this.h, 14, hh, hl);
  };
  
  SHA512.prototype._digest = function digest(enc) {
    if (enc === 'hex')
      return utils.toHex32(this.h, 'big');
    else
      return utils.split32(this.h, 'big');
  };
  
  function ch64_hi(xh, xl, yh, yl, zh) {
    var r = (xh & yh) ^ ((~xh) & zh);
    if (r < 0)
      r += 0x100000000;
    return r;
  }
  
  function ch64_lo(xh, xl, yh, yl, zh, zl) {
    var r = (xl & yl) ^ ((~xl) & zl);
    if (r < 0)
      r += 0x100000000;
    return r;
  }
  
  function maj64_hi(xh, xl, yh, yl, zh) {
    var r = (xh & yh) ^ (xh & zh) ^ (yh & zh);
    if (r < 0)
      r += 0x100000000;
    return r;
  }
  
  function maj64_lo(xh, xl, yh, yl, zh, zl) {
    var r = (xl & yl) ^ (xl & zl) ^ (yl & zl);
    if (r < 0)
      r += 0x100000000;
    return r;
  }
  
  function s0_512_hi(xh, xl) {
    var c0_hi = rotr64_hi(xh, xl, 28);
    var c1_hi = rotr64_hi(xl, xh, 2);  // 34
    var c2_hi = rotr64_hi(xl, xh, 7);  // 39
  
    var r = c0_hi ^ c1_hi ^ c2_hi;
    if (r < 0)
      r += 0x100000000;
    return r;
  }
  
  function s0_512_lo(xh, xl) {
    var c0_lo = rotr64_lo(xh, xl, 28);
    var c1_lo = rotr64_lo(xl, xh, 2);  // 34
    var c2_lo = rotr64_lo(xl, xh, 7);  // 39
  
    var r = c0_lo ^ c1_lo ^ c2_lo;
    if (r < 0)
      r += 0x100000000;
    return r;
  }
  
  function s1_512_hi(xh, xl) {
    var c0_hi = rotr64_hi(xh, xl, 14);
    var c1_hi = rotr64_hi(xh, xl, 18);
    var c2_hi = rotr64_hi(xl, xh, 9);  // 41
  
    var r = c0_hi ^ c1_hi ^ c2_hi;
    if (r < 0)
      r += 0x100000000;
    return r;
  }
  
  function s1_512_lo(xh, xl) {
    var c0_lo = rotr64_lo(xh, xl, 14);
    var c1_lo = rotr64_lo(xh, xl, 18);
    var c2_lo = rotr64_lo(xl, xh, 9);  // 41
  
    var r = c0_lo ^ c1_lo ^ c2_lo;
    if (r < 0)
      r += 0x100000000;
    return r;
  }
  
  function g0_512_hi(xh, xl) {
    var c0_hi = rotr64_hi(xh, xl, 1);
    var c1_hi = rotr64_hi(xh, xl, 8);
    var c2_hi = shr64_hi(xh, xl, 7);
  
    var r = c0_hi ^ c1_hi ^ c2_hi;
    if (r < 0)
      r += 0x100000000;
    return r;
  }
  
  function g0_512_lo(xh, xl) {
    var c0_lo = rotr64_lo(xh, xl, 1);
    var c1_lo = rotr64_lo(xh, xl, 8);
    var c2_lo = shr64_lo(xh, xl, 7);
  
    var r = c0_lo ^ c1_lo ^ c2_lo;
    if (r < 0)
      r += 0x100000000;
    return r;
  }
  
  function g1_512_hi(xh, xl) {
    var c0_hi = rotr64_hi(xh, xl, 19);
    var c1_hi = rotr64_hi(xl, xh, 29);  // 61
    var c2_hi = shr64_hi(xh, xl, 6);
  
    var r = c0_hi ^ c1_hi ^ c2_hi;
    if (r < 0)
      r += 0x100000000;
    return r;
  }
  
  function g1_512_lo(xh, xl) {
    var c0_lo = rotr64_lo(xh, xl, 19);
    var c1_lo = rotr64_lo(xl, xh, 29);  // 61
    var c2_lo = shr64_lo(xh, xl, 6);
  
    var r = c0_lo ^ c1_lo ^ c2_lo;
    if (r < 0)
      r += 0x100000000;
    return r;
  }
  
  },{"../common":27,"../utils":37,"minimalistic-assert":40}],36:[function(require,module,exports){
  'use strict';
  
  var utils = require('../utils');
  var rotr32 = utils.rotr32;
  
  function ft_1(s, x, y, z) {
    if (s === 0)
      return ch32(x, y, z);
    if (s === 1 || s === 3)
      return p32(x, y, z);
    if (s === 2)
      return maj32(x, y, z);
  }
  exports.ft_1 = ft_1;
  
  function ch32(x, y, z) {
    return (x & y) ^ ((~x) & z);
  }
  exports.ch32 = ch32;
  
  function maj32(x, y, z) {
    return (x & y) ^ (x & z) ^ (y & z);
  }
  exports.maj32 = maj32;
  
  function p32(x, y, z) {
    return x ^ y ^ z;
  }
  exports.p32 = p32;
  
  function s0_256(x) {
    return rotr32(x, 2) ^ rotr32(x, 13) ^ rotr32(x, 22);
  }
  exports.s0_256 = s0_256;
  
  function s1_256(x) {
    return rotr32(x, 6) ^ rotr32(x, 11) ^ rotr32(x, 25);
  }
  exports.s1_256 = s1_256;
  
  function g0_256(x) {
    return rotr32(x, 7) ^ rotr32(x, 18) ^ (x >>> 3);
  }
  exports.g0_256 = g0_256;
  
  function g1_256(x) {
    return rotr32(x, 17) ^ rotr32(x, 19) ^ (x >>> 10);
  }
  exports.g1_256 = g1_256;
  
  },{"../utils":37}],37:[function(require,module,exports){
  'use strict';
  
  var assert = require('minimalistic-assert');
  var inherits = require('inherits');
  
  exports.inherits = inherits;
  
  function toArray(msg, enc) {
    if (Array.isArray(msg))
      return msg.slice();
    if (!msg)
      return [];
    var res = [];
    if (typeof msg === 'string') {
      if (!enc) {
        for (var i = 0; i < msg.length; i++) {
          var c = msg.charCodeAt(i);
          var hi = c >> 8;
          var lo = c & 0xff;
          if (hi)
            res.push(hi, lo);
          else
            res.push(lo);
        }
      } else if (enc === 'hex') {
        msg = msg.replace(/[^a-z0-9]+/ig, '');
        if (msg.length % 2 !== 0)
          msg = '0' + msg;
        for (i = 0; i < msg.length; i += 2)
          res.push(parseInt(msg[i] + msg[i + 1], 16));
      }
    } else {
      for (i = 0; i < msg.length; i++)
        res[i] = msg[i] | 0;
    }
    return res;
  }
  exports.toArray = toArray;
  
  function toHex(msg) {
    var res = '';
    for (var i = 0; i < msg.length; i++)
      res += zero2(msg[i].toString(16));
    return res;
  }
  exports.toHex = toHex;
  
  function htonl(w) {
    var res = (w >>> 24) |
              ((w >>> 8) & 0xff00) |
              ((w << 8) & 0xff0000) |
              ((w & 0xff) << 24);
    return res >>> 0;
  }
  exports.htonl = htonl;
  
  function toHex32(msg, endian) {
    var res = '';
    for (var i = 0; i < msg.length; i++) {
      var w = msg[i];
      if (endian === 'little')
        w = htonl(w);
      res += zero8(w.toString(16));
    }
    return res;
  }
  exports.toHex32 = toHex32;
  
  function zero2(word) {
    if (word.length === 1)
      return '0' + word;
    else
      return word;
  }
  exports.zero2 = zero2;
  
  function zero8(word) {
    if (word.length === 7)
      return '0' + word;
    else if (word.length === 6)
      return '00' + word;
    else if (word.length === 5)
      return '000' + word;
    else if (word.length === 4)
      return '0000' + word;
    else if (word.length === 3)
      return '00000' + word;
    else if (word.length === 2)
      return '000000' + word;
    else if (word.length === 1)
      return '0000000' + word;
    else
      return word;
  }
  exports.zero8 = zero8;
  
  function join32(msg, start, end, endian) {
    var len = end - start;
    assert(len % 4 === 0);
    var res = new Array(len / 4);
    for (var i = 0, k = start; i < res.length; i++, k += 4) {
      var w;
      if (endian === 'big')
        w = (msg[k] << 24) | (msg[k + 1] << 16) | (msg[k + 2] << 8) | msg[k + 3];
      else
        w = (msg[k + 3] << 24) | (msg[k + 2] << 16) | (msg[k + 1] << 8) | msg[k];
      res[i] = w >>> 0;
    }
    return res;
  }
  exports.join32 = join32;
  
  function split32(msg, endian) {
    var res = new Array(msg.length * 4);
    for (var i = 0, k = 0; i < msg.length; i++, k += 4) {
      var m = msg[i];
      if (endian === 'big') {
        res[k] = m >>> 24;
        res[k + 1] = (m >>> 16) & 0xff;
        res[k + 2] = (m >>> 8) & 0xff;
        res[k + 3] = m & 0xff;
      } else {
        res[k + 3] = m >>> 24;
        res[k + 2] = (m >>> 16) & 0xff;
        res[k + 1] = (m >>> 8) & 0xff;
        res[k] = m & 0xff;
      }
    }
    return res;
  }
  exports.split32 = split32;
  
  function rotr32(w, b) {
    return (w >>> b) | (w << (32 - b));
  }
  exports.rotr32 = rotr32;
  
  function rotl32(w, b) {
    return (w << b) | (w >>> (32 - b));
  }
  exports.rotl32 = rotl32;
  
  function sum32(a, b) {
    return (a + b) >>> 0;
  }
  exports.sum32 = sum32;
  
  function sum32_3(a, b, c) {
    return (a + b + c) >>> 0;
  }
  exports.sum32_3 = sum32_3;
  
  function sum32_4(a, b, c, d) {
    return (a + b + c + d) >>> 0;
  }
  exports.sum32_4 = sum32_4;
  
  function sum32_5(a, b, c, d, e) {
    return (a + b + c + d + e) >>> 0;
  }
  exports.sum32_5 = sum32_5;
  
  function sum64(buf, pos, ah, al) {
    var bh = buf[pos];
    var bl = buf[pos + 1];
  
    var lo = (al + bl) >>> 0;
    var hi = (lo < al ? 1 : 0) + ah + bh;
    buf[pos] = hi >>> 0;
    buf[pos + 1] = lo;
  }
  exports.sum64 = sum64;
  
  function sum64_hi(ah, al, bh, bl) {
    var lo = (al + bl) >>> 0;
    var hi = (lo < al ? 1 : 0) + ah + bh;
    return hi >>> 0;
  }
  exports.sum64_hi = sum64_hi;
  
  function sum64_lo(ah, al, bh, bl) {
    var lo = al + bl;
    return lo >>> 0;
  }
  exports.sum64_lo = sum64_lo;
  
  function sum64_4_hi(ah, al, bh, bl, ch, cl, dh, dl) {
    var carry = 0;
    var lo = al;
    lo = (lo + bl) >>> 0;
    carry += lo < al ? 1 : 0;
    lo = (lo + cl) >>> 0;
    carry += lo < cl ? 1 : 0;
    lo = (lo + dl) >>> 0;
    carry += lo < dl ? 1 : 0;
  
    var hi = ah + bh + ch + dh + carry;
    return hi >>> 0;
  }
  exports.sum64_4_hi = sum64_4_hi;
  
  function sum64_4_lo(ah, al, bh, bl, ch, cl, dh, dl) {
    var lo = al + bl + cl + dl;
    return lo >>> 0;
  }
  exports.sum64_4_lo = sum64_4_lo;
  
  function sum64_5_hi(ah, al, bh, bl, ch, cl, dh, dl, eh, el) {
    var carry = 0;
    var lo = al;
    lo = (lo + bl) >>> 0;
    carry += lo < al ? 1 : 0;
    lo = (lo + cl) >>> 0;
    carry += lo < cl ? 1 : 0;
    lo = (lo + dl) >>> 0;
    carry += lo < dl ? 1 : 0;
    lo = (lo + el) >>> 0;
    carry += lo < el ? 1 : 0;
  
    var hi = ah + bh + ch + dh + eh + carry;
    return hi >>> 0;
  }
  exports.sum64_5_hi = sum64_5_hi;
  
  function sum64_5_lo(ah, al, bh, bl, ch, cl, dh, dl, eh, el) {
    var lo = al + bl + cl + dl + el;
  
    return lo >>> 0;
  }
  exports.sum64_5_lo = sum64_5_lo;
  
  function rotr64_hi(ah, al, num) {
    var r = (al << (32 - num)) | (ah >>> num);
    return r >>> 0;
  }
  exports.rotr64_hi = rotr64_hi;
  
  function rotr64_lo(ah, al, num) {
    var r = (ah << (32 - num)) | (al >>> num);
    return r >>> 0;
  }
  exports.rotr64_lo = rotr64_lo;
  
  function shr64_hi(ah, al, num) {
    return ah >>> num;
  }
  exports.shr64_hi = shr64_hi;
  
  function shr64_lo(ah, al, num) {
    var r = (ah << (32 - num)) | (al >>> num);
    return r >>> 0;
  }
  exports.shr64_lo = shr64_lo;
  
  },{"inherits":38,"minimalistic-assert":40}],38:[function(require,module,exports){
  if (typeof Object.create === 'function') {
    // implementation from standard node.js 'util' module
    module.exports = function inherits(ctor, superCtor) {
      ctor.super_ = superCtor
      ctor.prototype = Object.create(superCtor.prototype, {
        constructor: {
          value: ctor,
          enumerable: false,
          writable: true,
          configurable: true
        }
      });
    };
  } else {
    // old school shim for old browsers
    module.exports = function inherits(ctor, superCtor) {
      ctor.super_ = superCtor
      var TempCtor = function () {}
      TempCtor.prototype = superCtor.prototype
      ctor.prototype = new TempCtor()
      ctor.prototype.constructor = ctor
    }
  }
  
  },{}],39:[function(require,module,exports){
  (function (process,global){
  /**
   * [js-sha3]{@link https://github.com/emn178/js-sha3}
   *
   * @version 0.5.7
   * @author Chen, Yi-Cyuan [emn178@gmail.com]
   * @copyright Chen, Yi-Cyuan 2015-2016
   * @license MIT
   */
  /*jslint bitwise: true */
  (function () {
    'use strict';
  
    var root = typeof window === 'object' ? window : {};
    var NODE_JS = !root.JS_SHA3_NO_NODE_JS && typeof process === 'object' && process.versions && process.versions.node;
    if (NODE_JS) {
      root = global;
    }
    var COMMON_JS = !root.JS_SHA3_NO_COMMON_JS && typeof module === 'object' && module.exports;
    var HEX_CHARS = '0123456789abcdef'.split('');
    var SHAKE_PADDING = [31, 7936, 2031616, 520093696];
    var KECCAK_PADDING = [1, 256, 65536, 16777216];
    var PADDING = [6, 1536, 393216, 100663296];
    var SHIFT = [0, 8, 16, 24];
    var RC = [1, 0, 32898, 0, 32906, 2147483648, 2147516416, 2147483648, 32907, 0, 2147483649,
              0, 2147516545, 2147483648, 32777, 2147483648, 138, 0, 136, 0, 2147516425, 0,
              2147483658, 0, 2147516555, 0, 139, 2147483648, 32905, 2147483648, 32771,
              2147483648, 32770, 2147483648, 128, 2147483648, 32778, 0, 2147483658, 2147483648,
              2147516545, 2147483648, 32896, 2147483648, 2147483649, 0, 2147516424, 2147483648];
    var BITS = [224, 256, 384, 512];
    var SHAKE_BITS = [128, 256];
    var OUTPUT_TYPES = ['hex', 'buffer', 'arrayBuffer', 'array'];
  
    var createOutputMethod = function (bits, padding, outputType) {
      return function (message) {
        return new Keccak(bits, padding, bits).update(message)[outputType]();
      };
    };
  
    var createShakeOutputMethod = function (bits, padding, outputType) {
      return function (message, outputBits) {
        return new Keccak(bits, padding, outputBits).update(message)[outputType]();
      };
    };
  
    var createMethod = function (bits, padding) {
      var method = createOutputMethod(bits, padding, 'hex');
      method.create = function () {
        return new Keccak(bits, padding, bits);
      };
      method.update = function (message) {
        return method.create().update(message);
      };
      for (var i = 0; i < OUTPUT_TYPES.length; ++i) {
        var type = OUTPUT_TYPES[i];
        method[type] = createOutputMethod(bits, padding, type);
      }
      return method;
    };
  
    var createShakeMethod = function (bits, padding) {
      var method = createShakeOutputMethod(bits, padding, 'hex');
      method.create = function (outputBits) {
        return new Keccak(bits, padding, outputBits);
      };
      method.update = function (message, outputBits) {
        return method.create(outputBits).update(message);
      };
      for (var i = 0; i < OUTPUT_TYPES.length; ++i) {
        var type = OUTPUT_TYPES[i];
        method[type] = createShakeOutputMethod(bits, padding, type);
      }
      return method;
    };
  
    var algorithms = [
      {name: 'keccak', padding: KECCAK_PADDING, bits: BITS, createMethod: createMethod},
      {name: 'sha3', padding: PADDING, bits: BITS, createMethod: createMethod},
      {name: 'shake', padding: SHAKE_PADDING, bits: SHAKE_BITS, createMethod: createShakeMethod}
    ];
  
    var methods = {}, methodNames = [];
  
    for (var i = 0; i < algorithms.length; ++i) {
      var algorithm = algorithms[i];
      var bits  = algorithm.bits;
      for (var j = 0; j < bits.length; ++j) {
        var methodName = algorithm.name +'_' + bits[j];
        methodNames.push(methodName);
        methods[methodName] = algorithm.createMethod(bits[j], algorithm.padding);
      }
    }
  
    function Keccak(bits, padding, outputBits) {
      this.blocks = [];
      this.s = [];
      this.padding = padding;
      this.outputBits = outputBits;
      this.reset = true;
      this.block = 0;
      this.start = 0;
      this.blockCount = (1600 - (bits << 1)) >> 5;
      this.byteCount = this.blockCount << 2;
      this.outputBlocks = outputBits >> 5;
      this.extraBytes = (outputBits & 31) >> 3;
  
      for (var i = 0; i < 50; ++i) {
        this.s[i] = 0;
      }
    }
  
    Keccak.prototype.update = function (message) {
      var notString = typeof message !== 'string';
      if (notString && message.constructor === ArrayBuffer) {
        message = new Uint8Array(message);
      }
      var length = message.length, blocks = this.blocks, byteCount = this.byteCount,
        blockCount = this.blockCount, index = 0, s = this.s, i, code;
  
      while (index < length) {
        if (this.reset) {
          this.reset = false;
          blocks[0] = this.block;
          for (i = 1; i < blockCount + 1; ++i) {
            blocks[i] = 0;
          }
        }
        if (notString) {
          for (i = this.start; index < length && i < byteCount; ++index) {
            blocks[i >> 2] |= message[index] << SHIFT[i++ & 3];
          }
        } else {
          for (i = this.start; index < length && i < byteCount; ++index) {
            code = message.charCodeAt(index);
            if (code < 0x80) {
              blocks[i >> 2] |= code << SHIFT[i++ & 3];
            } else if (code < 0x800) {
              blocks[i >> 2] |= (0xc0 | (code >> 6)) << SHIFT[i++ & 3];
              blocks[i >> 2] |= (0x80 | (code & 0x3f)) << SHIFT[i++ & 3];
            } else if (code < 0xd800 || code >= 0xe000) {
              blocks[i >> 2] |= (0xe0 | (code >> 12)) << SHIFT[i++ & 3];
              blocks[i >> 2] |= (0x80 | ((code >> 6) & 0x3f)) << SHIFT[i++ & 3];
              blocks[i >> 2] |= (0x80 | (code & 0x3f)) << SHIFT[i++ & 3];
            } else {
              code = 0x10000 + (((code & 0x3ff) << 10) | (message.charCodeAt(++index) & 0x3ff));
              blocks[i >> 2] |= (0xf0 | (code >> 18)) << SHIFT[i++ & 3];
              blocks[i >> 2] |= (0x80 | ((code >> 12) & 0x3f)) << SHIFT[i++ & 3];
              blocks[i >> 2] |= (0x80 | ((code >> 6) & 0x3f)) << SHIFT[i++ & 3];
              blocks[i >> 2] |= (0x80 | (code & 0x3f)) << SHIFT[i++ & 3];
            }
          }
        }
        this.lastByteIndex = i;
        if (i >= byteCount) {
          this.start = i - byteCount;
          this.block = blocks[blockCount];
          for (i = 0; i < blockCount; ++i) {
            s[i] ^= blocks[i];
          }
          f(s);
          this.reset = true;
        } else {
          this.start = i;
        }
      }
      return this;
    };
  
    Keccak.prototype.finalize = function () {
      var blocks = this.blocks, i = this.lastByteIndex, blockCount = this.blockCount, s = this.s;
      blocks[i >> 2] |= this.padding[i & 3];
      if (this.lastByteIndex === this.byteCount) {
        blocks[0] = blocks[blockCount];
        for (i = 1; i < blockCount + 1; ++i) {
          blocks[i] = 0;
        }
      }
      blocks[blockCount - 1] |= 0x80000000;
      for (i = 0; i < blockCount; ++i) {
        s[i] ^= blocks[i];
      }
      f(s);
    };
  
    Keccak.prototype.toString = Keccak.prototype.hex = function () {
      this.finalize();
  
      var blockCount = this.blockCount, s = this.s, outputBlocks = this.outputBlocks,
          extraBytes = this.extraBytes, i = 0, j = 0;
      var hex = '', block;
      while (j < outputBlocks) {
        for (i = 0; i < blockCount && j < outputBlocks; ++i, ++j) {
          block = s[i];
          hex += HEX_CHARS[(block >> 4) & 0x0F] + HEX_CHARS[block & 0x0F] +
                 HEX_CHARS[(block >> 12) & 0x0F] + HEX_CHARS[(block >> 8) & 0x0F] +
                 HEX_CHARS[(block >> 20) & 0x0F] + HEX_CHARS[(block >> 16) & 0x0F] +
                 HEX_CHARS[(block >> 28) & 0x0F] + HEX_CHARS[(block >> 24) & 0x0F];
        }
        if (j % blockCount === 0) {
          f(s);
          i = 0;
        }
      }
      if (extraBytes) {
        block = s[i];
        if (extraBytes > 0) {
          hex += HEX_CHARS[(block >> 4) & 0x0F] + HEX_CHARS[block & 0x0F];
        }
        if (extraBytes > 1) {
          hex += HEX_CHARS[(block >> 12) & 0x0F] + HEX_CHARS[(block >> 8) & 0x0F];
        }
        if (extraBytes > 2) {
          hex += HEX_CHARS[(block >> 20) & 0x0F] + HEX_CHARS[(block >> 16) & 0x0F];
        }
      }
      return hex;
    };
  
    Keccak.prototype.arrayBuffer = function () {
      this.finalize();
  
      var blockCount = this.blockCount, s = this.s, outputBlocks = this.outputBlocks,
          extraBytes = this.extraBytes, i = 0, j = 0;
      var bytes = this.outputBits >> 3;
      var buffer;
      if (extraBytes) {
        buffer = new ArrayBuffer((outputBlocks + 1) << 2);
      } else {
        buffer = new ArrayBuffer(bytes);
      }
      var array = new Uint32Array(buffer);
      while (j < outputBlocks) {
        for (i = 0; i < blockCount && j < outputBlocks; ++i, ++j) {
          array[j] = s[i];
        }
        if (j % blockCount === 0) {
          f(s);
        }
      }
      if (extraBytes) {
        array[i] = s[i];
        buffer = buffer.slice(0, bytes);
      }
      return buffer;
    };
  
    Keccak.prototype.buffer = Keccak.prototype.arrayBuffer;
  
    Keccak.prototype.digest = Keccak.prototype.array = function () {
      this.finalize();
  
      var blockCount = this.blockCount, s = this.s, outputBlocks = this.outputBlocks,
          extraBytes = this.extraBytes, i = 0, j = 0;
      var array = [], offset, block;
      while (j < outputBlocks) {
        for (i = 0; i < blockCount && j < outputBlocks; ++i, ++j) {
          offset = j << 2;
          block = s[i];
          array[offset] = block & 0xFF;
          array[offset + 1] = (block >> 8) & 0xFF;
          array[offset + 2] = (block >> 16) & 0xFF;
          array[offset + 3] = (block >> 24) & 0xFF;
        }
        if (j % blockCount === 0) {
          f(s);
        }
      }
      if (extraBytes) {
        offset = j << 2;
        block = s[i];
        if (extraBytes > 0) {
          array[offset] = block & 0xFF;
        }
        if (extraBytes > 1) {
          array[offset + 1] = (block >> 8) & 0xFF;
        }
        if (extraBytes > 2) {
          array[offset + 2] = (block >> 16) & 0xFF;
        }
      }
      return array;
    };
  
    var f = function (s) {
      var h, l, n, c0, c1, c2, c3, c4, c5, c6, c7, c8, c9,
          b0, b1, b2, b3, b4, b5, b6, b7, b8, b9, b10, b11, b12, b13, b14, b15, b16, b17,
          b18, b19, b20, b21, b22, b23, b24, b25, b26, b27, b28, b29, b30, b31, b32, b33,
          b34, b35, b36, b37, b38, b39, b40, b41, b42, b43, b44, b45, b46, b47, b48, b49;
      for (n = 0; n < 48; n += 2) {
        c0 = s[0] ^ s[10] ^ s[20] ^ s[30] ^ s[40];
        c1 = s[1] ^ s[11] ^ s[21] ^ s[31] ^ s[41];
        c2 = s[2] ^ s[12] ^ s[22] ^ s[32] ^ s[42];
        c3 = s[3] ^ s[13] ^ s[23] ^ s[33] ^ s[43];
        c4 = s[4] ^ s[14] ^ s[24] ^ s[34] ^ s[44];
        c5 = s[5] ^ s[15] ^ s[25] ^ s[35] ^ s[45];
        c6 = s[6] ^ s[16] ^ s[26] ^ s[36] ^ s[46];
        c7 = s[7] ^ s[17] ^ s[27] ^ s[37] ^ s[47];
        c8 = s[8] ^ s[18] ^ s[28] ^ s[38] ^ s[48];
        c9 = s[9] ^ s[19] ^ s[29] ^ s[39] ^ s[49];
  
        h = c8 ^ ((c2 << 1) | (c3 >>> 31));
        l = c9 ^ ((c3 << 1) | (c2 >>> 31));
        s[0] ^= h;
        s[1] ^= l;
        s[10] ^= h;
        s[11] ^= l;
        s[20] ^= h;
        s[21] ^= l;
        s[30] ^= h;
        s[31] ^= l;
        s[40] ^= h;
        s[41] ^= l;
        h = c0 ^ ((c4 << 1) | (c5 >>> 31));
        l = c1 ^ ((c5 << 1) | (c4 >>> 31));
        s[2] ^= h;
        s[3] ^= l;
        s[12] ^= h;
        s[13] ^= l;
        s[22] ^= h;
        s[23] ^= l;
        s[32] ^= h;
        s[33] ^= l;
        s[42] ^= h;
        s[43] ^= l;
        h = c2 ^ ((c6 << 1) | (c7 >>> 31));
        l = c3 ^ ((c7 << 1) | (c6 >>> 31));
        s[4] ^= h;
        s[5] ^= l;
        s[14] ^= h;
        s[15] ^= l;
        s[24] ^= h;
        s[25] ^= l;
        s[34] ^= h;
        s[35] ^= l;
        s[44] ^= h;
        s[45] ^= l;
        h = c4 ^ ((c8 << 1) | (c9 >>> 31));
        l = c5 ^ ((c9 << 1) | (c8 >>> 31));
        s[6] ^= h;
        s[7] ^= l;
        s[16] ^= h;
        s[17] ^= l;
        s[26] ^= h;
        s[27] ^= l;
        s[36] ^= h;
        s[37] ^= l;
        s[46] ^= h;
        s[47] ^= l;
        h = c6 ^ ((c0 << 1) | (c1 >>> 31));
        l = c7 ^ ((c1 << 1) | (c0 >>> 31));
        s[8] ^= h;
        s[9] ^= l;
        s[18] ^= h;
        s[19] ^= l;
        s[28] ^= h;
        s[29] ^= l;
        s[38] ^= h;
        s[39] ^= l;
        s[48] ^= h;
        s[49] ^= l;
  
        b0 = s[0];
        b1 = s[1];
        b32 = (s[11] << 4) | (s[10] >>> 28);
        b33 = (s[10] << 4) | (s[11] >>> 28);
        b14 = (s[20] << 3) | (s[21] >>> 29);
        b15 = (s[21] << 3) | (s[20] >>> 29);
        b46 = (s[31] << 9) | (s[30] >>> 23);
        b47 = (s[30] << 9) | (s[31] >>> 23);
        b28 = (s[40] << 18) | (s[41] >>> 14);
        b29 = (s[41] << 18) | (s[40] >>> 14);
        b20 = (s[2] << 1) | (s[3] >>> 31);
        b21 = (s[3] << 1) | (s[2] >>> 31);
        b2 = (s[13] << 12) | (s[12] >>> 20);
        b3 = (s[12] << 12) | (s[13] >>> 20);
        b34 = (s[22] << 10) | (s[23] >>> 22);
        b35 = (s[23] << 10) | (s[22] >>> 22);
        b16 = (s[33] << 13) | (s[32] >>> 19);
        b17 = (s[32] << 13) | (s[33] >>> 19);
        b48 = (s[42] << 2) | (s[43] >>> 30);
        b49 = (s[43] << 2) | (s[42] >>> 30);
        b40 = (s[5] << 30) | (s[4] >>> 2);
        b41 = (s[4] << 30) | (s[5] >>> 2);
        b22 = (s[14] << 6) | (s[15] >>> 26);
        b23 = (s[15] << 6) | (s[14] >>> 26);
        b4 = (s[25] << 11) | (s[24] >>> 21);
        b5 = (s[24] << 11) | (s[25] >>> 21);
        b36 = (s[34] << 15) | (s[35] >>> 17);
        b37 = (s[35] << 15) | (s[34] >>> 17);
        b18 = (s[45] << 29) | (s[44] >>> 3);
        b19 = (s[44] << 29) | (s[45] >>> 3);
        b10 = (s[6] << 28) | (s[7] >>> 4);
        b11 = (s[7] << 28) | (s[6] >>> 4);
        b42 = (s[17] << 23) | (s[16] >>> 9);
        b43 = (s[16] << 23) | (s[17] >>> 9);
        b24 = (s[26] << 25) | (s[27] >>> 7);
        b25 = (s[27] << 25) | (s[26] >>> 7);
        b6 = (s[36] << 21) | (s[37] >>> 11);
        b7 = (s[37] << 21) | (s[36] >>> 11);
        b38 = (s[47] << 24) | (s[46] >>> 8);
        b39 = (s[46] << 24) | (s[47] >>> 8);
        b30 = (s[8] << 27) | (s[9] >>> 5);
        b31 = (s[9] << 27) | (s[8] >>> 5);
        b12 = (s[18] << 20) | (s[19] >>> 12);
        b13 = (s[19] << 20) | (s[18] >>> 12);
        b44 = (s[29] << 7) | (s[28] >>> 25);
        b45 = (s[28] << 7) | (s[29] >>> 25);
        b26 = (s[38] << 8) | (s[39] >>> 24);
        b27 = (s[39] << 8) | (s[38] >>> 24);
        b8 = (s[48] << 14) | (s[49] >>> 18);
        b9 = (s[49] << 14) | (s[48] >>> 18);
  
        s[0] = b0 ^ (~b2 & b4);
        s[1] = b1 ^ (~b3 & b5);
        s[10] = b10 ^ (~b12 & b14);
        s[11] = b11 ^ (~b13 & b15);
        s[20] = b20 ^ (~b22 & b24);
        s[21] = b21 ^ (~b23 & b25);
        s[30] = b30 ^ (~b32 & b34);
        s[31] = b31 ^ (~b33 & b35);
        s[40] = b40 ^ (~b42 & b44);
        s[41] = b41 ^ (~b43 & b45);
        s[2] = b2 ^ (~b4 & b6);
        s[3] = b3 ^ (~b5 & b7);
        s[12] = b12 ^ (~b14 & b16);
        s[13] = b13 ^ (~b15 & b17);
        s[22] = b22 ^ (~b24 & b26);
        s[23] = b23 ^ (~b25 & b27);
        s[32] = b32 ^ (~b34 & b36);
        s[33] = b33 ^ (~b35 & b37);
        s[42] = b42 ^ (~b44 & b46);
        s[43] = b43 ^ (~b45 & b47);
        s[4] = b4 ^ (~b6 & b8);
        s[5] = b5 ^ (~b7 & b9);
        s[14] = b14 ^ (~b16 & b18);
        s[15] = b15 ^ (~b17 & b19);
        s[24] = b24 ^ (~b26 & b28);
        s[25] = b25 ^ (~b27 & b29);
        s[34] = b34 ^ (~b36 & b38);
        s[35] = b35 ^ (~b37 & b39);
        s[44] = b44 ^ (~b46 & b48);
        s[45] = b45 ^ (~b47 & b49);
        s[6] = b6 ^ (~b8 & b0);
        s[7] = b7 ^ (~b9 & b1);
        s[16] = b16 ^ (~b18 & b10);
        s[17] = b17 ^ (~b19 & b11);
        s[26] = b26 ^ (~b28 & b20);
        s[27] = b27 ^ (~b29 & b21);
        s[36] = b36 ^ (~b38 & b30);
        s[37] = b37 ^ (~b39 & b31);
        s[46] = b46 ^ (~b48 & b40);
        s[47] = b47 ^ (~b49 & b41);
        s[8] = b8 ^ (~b0 & b2);
        s[9] = b9 ^ (~b1 & b3);
        s[18] = b18 ^ (~b10 & b12);
        s[19] = b19 ^ (~b11 & b13);
        s[28] = b28 ^ (~b20 & b22);
        s[29] = b29 ^ (~b21 & b23);
        s[38] = b38 ^ (~b30 & b32);
        s[39] = b39 ^ (~b31 & b33);
        s[48] = b48 ^ (~b40 & b42);
        s[49] = b49 ^ (~b41 & b43);
  
        s[0] ^= RC[n];
        s[1] ^= RC[n + 1];
      }
    };
  
    if (COMMON_JS) {
      module.exports = methods;
    } else {
      for (var i = 0; i < methodNames.length; ++i) {
        root[methodNames[i]] = methods[methodNames[i]];
      }
    }
  })();
  
  }).call(this,require('_process'),typeof global !== "undefined" ? global : typeof self !== "undefined" ? self : typeof window !== "undefined" ? window : {})
  },{"_process":41}],40:[function(require,module,exports){
  module.exports = assert;
  
  function assert(val, msg) {
    if (!val)
      throw new Error(msg || 'Assertion failed');
  }
  
  assert.equal = function assertEqual(l, r, msg) {
    if (l != r)
      throw new Error(msg || ('Assertion failed: ' + l + ' != ' + r));
  };
  
  },{}],41:[function(require,module,exports){
  module.exports = { browser: true };
  },{}],42:[function(require,module,exports){
  (function (setImmediate){
  "use strict";
  
  (function(root) {
      var MAX_VALUE = 0x7fffffff;
  
      // The SHA256 and PBKDF2 implementation are from scrypt-async-js:
      // See: https://github.com/dchest/scrypt-async-js
      function SHA256(m) {
          var K = [
             0x428a2f98, 0x71374491, 0xb5c0fbcf, 0xe9b5dba5, 0x3956c25b,
             0x59f111f1, 0x923f82a4, 0xab1c5ed5, 0xd807aa98, 0x12835b01,
             0x243185be, 0x550c7dc3, 0x72be5d74, 0x80deb1fe, 0x9bdc06a7,
             0xc19bf174, 0xe49b69c1, 0xefbe4786, 0x0fc19dc6, 0x240ca1cc,
             0x2de92c6f, 0x4a7484aa, 0x5cb0a9dc, 0x76f988da, 0x983e5152,
             0xa831c66d, 0xb00327c8, 0xbf597fc7, 0xc6e00bf3, 0xd5a79147,
             0x06ca6351, 0x14292967, 0x27b70a85, 0x2e1b2138, 0x4d2c6dfc,
             0x53380d13, 0x650a7354, 0x766a0abb, 0x81c2c92e, 0x92722c85,
             0xa2bfe8a1, 0xa81a664b, 0xc24b8b70, 0xc76c51a3, 0xd192e819,
             0xd6990624, 0xf40e3585, 0x106aa070, 0x19a4c116, 0x1e376c08,
             0x2748774c, 0x34b0bcb5, 0x391c0cb3, 0x4ed8aa4a, 0x5b9cca4f,
             0x682e6ff3, 0x748f82ee, 0x78a5636f, 0x84c87814, 0x8cc70208,
             0x90befffa, 0xa4506ceb, 0xbef9a3f7, 0xc67178f2
         ];
  
          var h0 = 0x6a09e667, h1 = 0xbb67ae85, h2 = 0x3c6ef372, h3 = 0xa54ff53a;
          var h4 = 0x510e527f, h5 = 0x9b05688c, h6 = 0x1f83d9ab, h7 = 0x5be0cd19;
          var w = new Array(64);
  
          function blocks(p) {
              var off = 0, len = p.length;
              while (len >= 64) {
                  var a = h0, b = h1, c = h2, d = h3, e = h4, f = h5, g = h6, h = h7, u, i, j, t1, t2;
  
                  for (i = 0; i < 16; i++) {
                      j = off + i*4;
                      w[i] = ((p[j] & 0xff)<<24) | ((p[j+1] & 0xff)<<16) |
                      ((p[j+2] & 0xff)<<8) | (p[j+3] & 0xff);
                  }
  
                  for (i = 16; i < 64; i++) {
                      u = w[i-2];
                      t1 = ((u>>>17) | (u<<(32-17))) ^ ((u>>>19) | (u<<(32-19))) ^ (u>>>10);
  
                      u = w[i-15];
                      t2 = ((u>>>7) | (u<<(32-7))) ^ ((u>>>18) | (u<<(32-18))) ^ (u>>>3);
  
                      w[i] = (((t1 + w[i-7]) | 0) + ((t2 + w[i-16]) | 0)) | 0;
                  }
  
                  for (i = 0; i < 64; i++) {
                      t1 = ((((((e>>>6) | (e<<(32-6))) ^ ((e>>>11) | (e<<(32-11))) ^
                               ((e>>>25) | (e<<(32-25)))) + ((e & f) ^ (~e & g))) | 0) +
                            ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
  
                      t2 = ((((a>>>2) | (a<<(32-2))) ^ ((a>>>13) | (a<<(32-13))) ^
                             ((a>>>22) | (a<<(32-22)))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
  
                      h = g;
                      g = f;
                      f = e;
                      e = (d + t1) | 0;
                      d = c;
                      c = b;
                      b = a;
                      a = (t1 + t2) | 0;
                  }
  
                  h0 = (h0 + a) | 0;
                  h1 = (h1 + b) | 0;
                  h2 = (h2 + c) | 0;
                  h3 = (h3 + d) | 0;
                  h4 = (h4 + e) | 0;
                  h5 = (h5 + f) | 0;
                  h6 = (h6 + g) | 0;
                  h7 = (h7 + h) | 0;
  
                  off += 64;
                  len -= 64;
              }
          }
  
          blocks(m);
  
          var i, bytesLeft = m.length % 64,
          bitLenHi = (m.length / 0x20000000) | 0,
          bitLenLo = m.length << 3,
          numZeros = (bytesLeft < 56) ? 56 : 120,
          p = m.slice(m.length - bytesLeft, m.length);
  
          p.push(0x80);
          for (i = bytesLeft + 1; i < numZeros; i++) { p.push(0); }
          p.push((bitLenHi>>>24) & 0xff);
          p.push((bitLenHi>>>16) & 0xff);
          p.push((bitLenHi>>>8)  & 0xff);
          p.push((bitLenHi>>>0)  & 0xff);
          p.push((bitLenLo>>>24) & 0xff);
          p.push((bitLenLo>>>16) & 0xff);
          p.push((bitLenLo>>>8)  & 0xff);
          p.push((bitLenLo>>>0)  & 0xff);
  
          blocks(p);
  
          return [
              (h0>>>24) & 0xff, (h0>>>16) & 0xff, (h0>>>8) & 0xff, (h0>>>0) & 0xff,
              (h1>>>24) & 0xff, (h1>>>16) & 0xff, (h1>>>8) & 0xff, (h1>>>0) & 0xff,
              (h2>>>24) & 0xff, (h2>>>16) & 0xff, (h2>>>8) & 0xff, (h2>>>0) & 0xff,
              (h3>>>24) & 0xff, (h3>>>16) & 0xff, (h3>>>8) & 0xff, (h3>>>0) & 0xff,
              (h4>>>24) & 0xff, (h4>>>16) & 0xff, (h4>>>8) & 0xff, (h4>>>0) & 0xff,
              (h5>>>24) & 0xff, (h5>>>16) & 0xff, (h5>>>8) & 0xff, (h5>>>0) & 0xff,
              (h6>>>24) & 0xff, (h6>>>16) & 0xff, (h6>>>8) & 0xff, (h6>>>0) & 0xff,
              (h7>>>24) & 0xff, (h7>>>16) & 0xff, (h7>>>8) & 0xff, (h7>>>0) & 0xff
          ];
      }
  
      function PBKDF2_HMAC_SHA256_OneIter(password, salt, dkLen) {
          // compress password if it's longer than hash block length
          password = password.length <= 64 ? password : SHA256(password);
  
          var i;
          var innerLen = 64 + salt.length + 4;
          var inner = new Array(innerLen);
          var outerKey = new Array(64);
          var dk = [];
  
          // inner = (password ^ ipad) || salt || counter
          for (i = 0; i < 64; i++) inner[i] = 0x36;
          for (i = 0; i < password.length; i++) inner[i] ^= password[i];
          for (i = 0; i < salt.length; i++) inner[64+i] = salt[i];
          for (i = innerLen - 4; i < innerLen; i++) inner[i] = 0;
  
          // outerKey = password ^ opad
          for (i = 0; i < 64; i++) outerKey[i] = 0x5c;
          for (i = 0; i < password.length; i++) outerKey[i] ^= password[i];
  
          // increments counter inside inner
          function incrementCounter() {
              for (var i = innerLen-1; i >= innerLen-4; i--) {
                  inner[i]++;
                  if (inner[i] <= 0xff) return;
                  inner[i] = 0;
              }
          }
  
          // output blocks = SHA256(outerKey || SHA256(inner)) ...
          while (dkLen >= 32) {
              incrementCounter();
              dk = dk.concat(SHA256(outerKey.concat(SHA256(inner))));
              dkLen -= 32;
          }
          if (dkLen > 0) {
              incrementCounter();
              dk = dk.concat(SHA256(outerKey.concat(SHA256(inner))).slice(0, dkLen));
          }
  
          return dk;
      }
  
      // The following is an adaptation of scryptsy
      // See: https://www.npmjs.com/package/scryptsy
      function blockmix_salsa8(BY, Yi, r, x, _X) {
          var i;
  
          arraycopy(BY, (2 * r - 1) * 16, _X, 0, 16);
          for (i = 0; i < 2 * r; i++) {
              blockxor(BY, i * 16, _X, 16);
              salsa20_8(_X, x);
              arraycopy(_X, 0, BY, Yi + (i * 16), 16);
          }
  
          for (i = 0; i < r; i++) {
              arraycopy(BY, Yi + (i * 2) * 16, BY, (i * 16), 16);
          }
  
          for (i = 0; i < r; i++) {
              arraycopy(BY, Yi + (i * 2 + 1) * 16, BY, (i + r) * 16, 16);
          }
      }
  
      function R(a, b) {
          return (a << b) | (a >>> (32 - b));
      }
  
      function salsa20_8(B, x) {
          arraycopy(B, 0, x, 0, 16);
  
          for (var i = 8; i > 0; i -= 2) {
              x[ 4] ^= R(x[ 0] + x[12], 7);
              x[ 8] ^= R(x[ 4] + x[ 0], 9);
              x[12] ^= R(x[ 8] + x[ 4], 13);
              x[ 0] ^= R(x[12] + x[ 8], 18);
              x[ 9] ^= R(x[ 5] + x[ 1], 7);
              x[13] ^= R(x[ 9] + x[ 5], 9);
              x[ 1] ^= R(x[13] + x[ 9], 13);
              x[ 5] ^= R(x[ 1] + x[13], 18);
              x[14] ^= R(x[10] + x[ 6], 7);
              x[ 2] ^= R(x[14] + x[10], 9);
              x[ 6] ^= R(x[ 2] + x[14], 13);
              x[10] ^= R(x[ 6] + x[ 2], 18);
              x[ 3] ^= R(x[15] + x[11], 7);
              x[ 7] ^= R(x[ 3] + x[15], 9);
              x[11] ^= R(x[ 7] + x[ 3], 13);
              x[15] ^= R(x[11] + x[ 7], 18);
              x[ 1] ^= R(x[ 0] + x[ 3], 7);
              x[ 2] ^= R(x[ 1] + x[ 0], 9);
              x[ 3] ^= R(x[ 2] + x[ 1], 13);
              x[ 0] ^= R(x[ 3] + x[ 2], 18);
              x[ 6] ^= R(x[ 5] + x[ 4], 7);
              x[ 7] ^= R(x[ 6] + x[ 5], 9);
              x[ 4] ^= R(x[ 7] + x[ 6], 13);
              x[ 5] ^= R(x[ 4] + x[ 7], 18);
              x[11] ^= R(x[10] + x[ 9], 7);
              x[ 8] ^= R(x[11] + x[10], 9);
              x[ 9] ^= R(x[ 8] + x[11], 13);
              x[10] ^= R(x[ 9] + x[ 8], 18);
              x[12] ^= R(x[15] + x[14], 7);
              x[13] ^= R(x[12] + x[15], 9);
              x[14] ^= R(x[13] + x[12], 13);
              x[15] ^= R(x[14] + x[13], 18);
          }
  
          for (i = 0; i < 16; ++i) {
              B[i] += x[i];
          }
      }
  
      // naive approach... going back to loop unrolling may yield additional performance
      function blockxor(S, Si, D, len) {
          for (var i = 0; i < len; i++) {
              D[i] ^= S[Si + i]
          }
      }
  
      function arraycopy(src, srcPos, dest, destPos, length) {
          while (length--) {
              dest[destPos++] = src[srcPos++];
          }
      }
  
      function checkBufferish(o) {
          if (!o || typeof(o.length) !== 'number') {
              return false;
          }
          for (var i = 0; i < o.length; i++) {
              if (typeof(o[i]) !== 'number') { return false; }
  
              var v = parseInt(o[i]);
              if (v != o[i] || v < 0 || v >= 256) {
                  return false;
              }
          }
          return true;
      }
  
      function ensureInteger(value, name) {
          var intValue = parseInt(value);
          if (value != intValue) { throw new Error('invalid ' + name); }
          return intValue;
      }
  
      // N = Cpu cost, r = Memory cost, p = parallelization cost
      // callback(error, progress, key)
      function scrypt(password, salt, N, r, p, dkLen, callback) {
  
          if (!callback) { throw new Error('missing callback'); }
  
          N = ensureInteger(N, 'N');
          r = ensureInteger(r, 'r');
          p = ensureInteger(p, 'p');
  
          dkLen = ensureInteger(dkLen, 'dkLen');
  
          if (N === 0 || (N & (N - 1)) !== 0) { throw new Error('N must be power of 2'); }
  
          if (N > MAX_VALUE / 128 / r) { throw new Error('N too large'); }
          if (r > MAX_VALUE / 128 / p) { throw new Error('r too large'); }
  
          if (!checkBufferish(password)) {
              throw new Error('password must be an array or buffer');
          }
  
          if (!checkBufferish(salt)) {
              throw new Error('salt must be an array or buffer');
          }
  
          var b = PBKDF2_HMAC_SHA256_OneIter(password, salt, p * 128 * r);
          var B = new Uint32Array(p * 32 * r)
          for (var i = 0; i < B.length; i++) {
              var j = i * 4;
              B[i] = ((b[j + 3] & 0xff) << 24) |
                     ((b[j + 2] & 0xff) << 16) |
                     ((b[j + 1] & 0xff) << 8) |
                     ((b[j + 0] & 0xff) << 0);
          }
  
          var XY = new Uint32Array(64 * r);
          var V = new Uint32Array(32 * r * N);
  
          var Yi = 32 * r;
  
          // scratch space
          var x = new Uint32Array(16);       // salsa20_8
          var _X = new Uint32Array(16);      // blockmix_salsa8
  
          var totalOps = p * N * 2;
          var currentOp = 0;
          var lastPercent10 = null;
  
          // Set this to true to abandon the scrypt on the next step
          var stop = false;
  
          // State information
          var state = 0;
          var i0 = 0, i1;
          var Bi;
  
          // How many blockmix_salsa8 can we do per step?
          var limit = parseInt(1000 / r);
  
          // Trick from scrypt-async; if there is a setImmediate shim in place, use it
          var nextTick = (typeof(setImmediate) !== 'undefined') ? setImmediate : setTimeout;
  
          // This is really all I changed; making scryptsy a state machine so we occasionally
          // stop and give other evnts on the evnt loop a chance to run. ~RicMoo
          var incrementalSMix = function() {
              if (stop) {
                  return callback(new Error('cancelled'), currentOp / totalOps);
              }
  
              switch (state) {
                  case 0:
                      // for (var i = 0; i < p; i++)...
                      Bi = i0 * 32 * r;
  
                      arraycopy(B, Bi, XY, 0, Yi);                       // ROMix - 1
  
                      state = 1;                                         // Move to ROMix 2
                      i1 = 0;
  
                      // Fall through
  
                  case 1:
  
                      // Run up to 1000 steps of the first inner smix loop
                      var steps = N - i1;
                      if (steps > limit) { steps = limit; }
                      for (var i = 0; i < steps; i++) {                  // ROMix - 2
                          arraycopy(XY, 0, V, (i1 + i) * Yi, Yi)         // ROMix - 3
                          blockmix_salsa8(XY, Yi, r, x, _X);             // ROMix - 4
                      }
  
                      // for (var i = 0; i < N; i++)
                      i1 += steps;
                      currentOp += steps;
  
                      // Call the callback with the progress (optionally stopping us)
                      var percent10 = parseInt(1000 * currentOp / totalOps);
                      if (percent10 !== lastPercent10) {
                          stop = callback(null, currentOp / totalOps);
                          if (stop) { break; }
                          lastPercent10 = percent10;
                      }
  
                      if (i1 < N) {
                          break;
                      }
  
                      i1 = 0;                                          // Move to ROMix 6
                      state = 2;
  
                      // Fall through
  
                  case 2:
  
                      // Run up to 1000 steps of the second inner smix loop
                      var steps = N - i1;
                      if (steps > limit) { steps = limit; }
                      for (var i = 0; i < steps; i++) {                // ROMix - 6
                          var offset = (2 * r - 1) * 16;               // ROMix - 7
                          var j = XY[offset] & (N - 1);
                          blockxor(V, j * Yi, XY, Yi);                 // ROMix - 8 (inner)
                          blockmix_salsa8(XY, Yi, r, x, _X);           // ROMix - 9 (outer)
                      }
  
                      // for (var i = 0; i < N; i++)...
                      i1 += steps;
                      currentOp += steps;
  
                      // Call the callback with the progress (optionally stopping us)
                      var percent10 = parseInt(1000 * currentOp / totalOps);
                      if (percent10 !== lastPercent10) {
                          stop = callback(null, currentOp / totalOps);
                          if (stop) { break; }
                          lastPercent10 = percent10;
                      }
  
                      if (i1 < N) {
                          break;
                      }
  
                      arraycopy(XY, 0, B, Bi, Yi);                     // ROMix - 10
  
                      // for (var i = 0; i < p; i++)...
                      i0++;
                      if (i0 < p) {
                          state = 0;
                          break;
                      }
  
                      b = [];
                      for (var i = 0; i < B.length; i++) {
                          b.push((B[i] >>  0) & 0xff);
                          b.push((B[i] >>  8) & 0xff);
                          b.push((B[i] >> 16) & 0xff);
                          b.push((B[i] >> 24) & 0xff);
                      }
  
                      var derivedKey = PBKDF2_HMAC_SHA256_OneIter(password, b, dkLen);
  
                      // Done; don't break (which would reschedule)
                      return callback(null, 1.0, derivedKey);
                  }
  
                  // Schedule the next steps
                  nextTick(incrementalSMix);
              }
  
              // Bootstrap the incremental smix
              incrementalSMix();
      }
  
      // node.js
      if (typeof(exports) !== 'undefined') {
         module.exports = scrypt;
  
      // RequireJS/AMD
      // http://www.requirejs.org/docs/api.html
      // https://github.com/amdjs/amdjs-api/wiki/AMD
      } else if (typeof(define) === 'function' && define.amd) {
          define(scrypt);
  
      // Web Browsers
      } else if (root) {
  
          // If there was an existing library "scrypt", make sure it is still available
          if (root.scrypt) {
              root._scrypt = root.scrypt;
          }
  
          root.scrypt = scrypt;
      }
  
  })(this);
  
  }).call(this,require("timers").setImmediate)
  },{"timers":44}],43:[function(require,module,exports){
  (function (process,global){
  (function (global, undefined) {
      "use strict";
  
      if (global.setImmediate) {
          return;
      }
  
      var nextHandle = 1; // Spec says greater than zero
      var tasksByHandle = {};
      var currentlyRunningATask = false;
      var doc = global.document;
      var setImmediate;
  
      function addFromSetImmediateArguments(args) {
          tasksByHandle[nextHandle] = partiallyApplied.apply(undefined, args);
          return nextHandle++;
      }
  
      // This function accepts the same arguments as setImmediate, but
      // returns a function that requires no arguments.
      function partiallyApplied(handler) {
          var args = [].slice.call(arguments, 1);
          return function() {
              if (typeof handler === "function") {
                  handler.apply(undefined, args);
              } else {
                  (new Function("" + handler))();
              }
          };
      }
  
      function runIfPresent(handle) {
          // From the spec: "Wait until any invocations of this algorithm started before this one have completed."
          // So if we're currently running a task, we'll need to delay this invocation.
          if (currentlyRunningATask) {
              // Delay by doing a setTimeout. setImmediate was tried instead, but in Firefox 7 it generated a
              // "too much recursion" error.
              setTimeout(partiallyApplied(runIfPresent, handle), 0);
          } else {
              var task = tasksByHandle[handle];
              if (task) {
                  currentlyRunningATask = true;
                  try {
                      task();
                  } finally {
                      clearImmediate(handle);
                      currentlyRunningATask = false;
                  }
              }
          }
      }
  
      function clearImmediate(handle) {
          delete tasksByHandle[handle];
      }
  
      function installNextTickImplementation() {
          setImmediate = function() {
              var handle = addFromSetImmediateArguments(arguments);
              process.nextTick(partiallyApplied(runIfPresent, handle));
              return handle;
          };
      }
  
      function canUsePostMessage() {
          // The test against `importScripts` prevents this implementation from being installed inside a web worker,
          // where `global.postMessage` means something completely different and can't be used for this purpose.
          if (global.postMessage && !global.importScripts) {
              var postMessageIsAsynchronous = true;
              var oldOnMessage = global.onmessage;
              global.onmessage = function() {
                  postMessageIsAsynchronous = false;
              };
              global.postMessage("", "*");
              global.onmessage = oldOnMessage;
              return postMessageIsAsynchronous;
          }
      }
  
      function installPostMessageImplementation() {
          // Installs an event handler on `global` for the `message` event: see
          // * https://developer.mozilla.org/en/DOM/window.postMessage
          // * http://www.whatwg.org/specs/web-apps/current-work/multipage/comms.html#crossDocumentMessages
  
          var messagePrefix = "setImmediate$" + Math.random() + "$";
          var onGlobalMessage = function(event) {
              if (event.source === global &&
                  typeof event.data === "string" &&
                  event.data.indexOf(messagePrefix) === 0) {
                  runIfPresent(+event.data.slice(messagePrefix.length));
              }
          };
  
          if (global.addEventListener) {
              global.addEventListener("message", onGlobalMessage, false);
          } else {
              global.attachEvent("onmessage", onGlobalMessage);
          }
  
          setImmediate = function() {
              var handle = addFromSetImmediateArguments(arguments);
              global.postMessage(messagePrefix + handle, "*");
              return handle;
          };
      }
  
      function installMessageChannelImplementation() {
          var channel = new MessageChannel();
          channel.port1.onmessage = function(event) {
              var handle = event.data;
              runIfPresent(handle);
          };
  
          setImmediate = function() {
              var handle = addFromSetImmediateArguments(arguments);
              channel.port2.postMessage(handle);
              return handle;
          };
      }
  
      function installReadyStateChangeImplementation() {
          var html = doc.documentElement;
          setImmediate = function() {
              var handle = addFromSetImmediateArguments(arguments);
              // Create a <script> element; its readystatechange event will be fired asynchronously once it is inserted
              // into the document. Do so, thus queuing up the task. Remember to clean up once it's been called.
              var script = doc.createElement("script");
              script.onreadystatechange = function () {
                  runIfPresent(handle);
                  script.onreadystatechange = null;
                  html.removeChild(script);
                  script = null;
              };
              html.appendChild(script);
              return handle;
          };
      }
  
      function installSetTimeoutImplementation() {
          setImmediate = function() {
              var handle = addFromSetImmediateArguments(arguments);
              setTimeout(partiallyApplied(runIfPresent, handle), 0);
              return handle;
          };
      }
  
      // If supported, we should attach to the prototype of global, since that is where setTimeout et al. live.
      var attachTo = Object.getPrototypeOf && Object.getPrototypeOf(global);
      attachTo = attachTo && attachTo.setTimeout ? attachTo : global;
  
      // Don't get fooled by e.g. browserify environments.
      if ({}.toString.call(global.process) === "[object process]") {
          // For Node.js before 0.9
          installNextTickImplementation();
  
      } else if (canUsePostMessage()) {
          // For non-IE10 modern browsers
          installPostMessageImplementation();
  
      } else if (global.MessageChannel) {
          // For web workers, where supported
          installMessageChannelImplementation();
  
      } else if (doc && "onreadystatechange" in doc.createElement("script")) {
          // For IE 6–8
          installReadyStateChangeImplementation();
  
      } else {
          // For older browsers
          installSetTimeoutImplementation();
      }
  
      attachTo.setImmediate = setImmediate;
      attachTo.clearImmediate = clearImmediate;
  }(typeof self === "undefined" ? typeof global === "undefined" ? this : global : self));
  
  }).call(this,require('_process'),typeof global !== "undefined" ? global : typeof self !== "undefined" ? self : typeof window !== "undefined" ? window : {})
  },{"_process":41}],44:[function(require,module,exports){
  (function (global){
  module.exports = { setImmediate: global.setImmediate }; 
  }).call(this,typeof global !== "undefined" ? global : typeof self !== "undefined" ? self : typeof window !== "undefined" ? window : {})
  },{}],45:[function(require,module,exports){
  (function (global){
  
  var rng;
  
  if (global.crypto && crypto.getRandomValues) {
    // WHATWG crypto-based RNG - http://wiki.whatwg.org/wiki/Crypto
    // Moderately fast, high quality
    var _rnds8 = new Uint8Array(16);
    rng = function whatwgRNG() {
      crypto.getRandomValues(_rnds8);
      return _rnds8;
    };
  }
  
  if (!rng) {
    // Math.random()-based (RNG)
    //
    // If all else fails, use Math.random().  It's fast, but is of unspecified
    // quality.
    var  _rnds = new Array(16);
    rng = function() {
      for (var i = 0, r; i < 16; i++) {
        if ((i & 0x03) === 0) r = Math.random() * 0x100000000;
        _rnds[i] = r >>> ((i & 0x03) << 3) & 0xff;
      }
  
      return _rnds;
    };
  }
  
  module.exports = rng;
  
  
  }).call(this,typeof global !== "undefined" ? global : typeof self !== "undefined" ? self : typeof window !== "undefined" ? window : {})
  },{}],46:[function(require,module,exports){
  //     uuid.js
  //
  //     Copyright (c) 2010-2012 Robert Kieffer
  //     MIT License - http://opensource.org/licenses/mit-license.php
  
  // Unique ID creation requires a high quality random # generator.  We feature
  // detect to determine the best RNG source, normalizing to a function that
  // returns 128-bits of randomness, since that's what's usually required
  var _rng = require('./rng');
  
  // Maps for number <-> hex string conversion
  var _byteToHex = [];
  var _hexToByte = {};
  for (var i = 0; i < 256; i++) {
    _byteToHex[i] = (i + 0x100).toString(16).substr(1);
    _hexToByte[_byteToHex[i]] = i;
  }
  
  // **`parse()` - Parse a UUID into it's component bytes**
  function parse(s, buf, offset) {
    var i = (buf && offset) || 0, ii = 0;
  
    buf = buf || [];
    s.toLowerCase().replace(/[0-9a-f]{2}/g, function(oct) {
      if (ii < 16) { // Don't overflow!
        buf[i + ii++] = _hexToByte[oct];
      }
    });
  
    // Zero out remaining bytes if string was short
    while (ii < 16) {
      buf[i + ii++] = 0;
    }
  
    return buf;
  }
  
  // **`unparse()` - Convert UUID byte array (ala parse()) into a string**
  function unparse(buf, offset) {
    var i = offset || 0, bth = _byteToHex;
    return  bth[buf[i++]] + bth[buf[i++]] +
            bth[buf[i++]] + bth[buf[i++]] + '-' +
            bth[buf[i++]] + bth[buf[i++]] + '-' +
            bth[buf[i++]] + bth[buf[i++]] + '-' +
            bth[buf[i++]] + bth[buf[i++]] + '-' +
            bth[buf[i++]] + bth[buf[i++]] +
            bth[buf[i++]] + bth[buf[i++]] +
            bth[buf[i++]] + bth[buf[i++]];
  }
  
  // **`v1()` - Generate time-based UUID**
  //
  // Inspired by https://github.com/LiosK/UUID.js
  // and http://docs.python.org/library/uuid.html
  
  // random #'s we need to init node and clockseq
  var _seedBytes = _rng();
  
  // Per 4.5, create and 48-bit node id, (47 random bits + multicast bit = 1)
  var _nodeId = [
    _seedBytes[0] | 0x01,
    _seedBytes[1], _seedBytes[2], _seedBytes[3], _seedBytes[4], _seedBytes[5]
  ];
  
  // Per 4.2.2, randomize (14 bit) clockseq
  var _clockseq = (_seedBytes[6] << 8 | _seedBytes[7]) & 0x3fff;
  
  // Previous uuid creation time
  var _lastMSecs = 0, _lastNSecs = 0;
  
  // See https://github.com/broofa/node-uuid for API details
  function v1(options, buf, offset) {
    var i = buf && offset || 0;
    var b = buf || [];
  
    options = options || {};
  
    var clockseq = options.clockseq !== undefined ? options.clockseq : _clockseq;
  
    // UUID timestamps are 100 nano-second units since the Gregorian epoch,
    // (1582-10-15 00:00).  JSNumbers aren't precise enough for this, so
    // time is handled internally as 'msecs' (integer milliseconds) and 'nsecs'
    // (100-nanoseconds offset from msecs) since unix epoch, 1970-01-01 00:00.
    var msecs = options.msecs !== undefined ? options.msecs : new Date().getTime();
  
    // Per 4.2.1.2, use count of uuid's generated during the current clock
    // cycle to simulate higher resolution clock
    var nsecs = options.nsecs !== undefined ? options.nsecs : _lastNSecs + 1;
  
    // Time since last uuid creation (in msecs)
    var dt = (msecs - _lastMSecs) + (nsecs - _lastNSecs)/10000;
  
    // Per 4.2.1.2, Bump clockseq on clock regression
    if (dt < 0 && options.clockseq === undefined) {
      clockseq = clockseq + 1 & 0x3fff;
    }
  
    // Reset nsecs if clock regresses (new clockseq) or we've moved onto a new
    // time interval
    if ((dt < 0 || msecs > _lastMSecs) && options.nsecs === undefined) {
      nsecs = 0;
    }
  
    // Per 4.2.1.2 Throw error if too many uuids are requested
    if (nsecs >= 10000) {
      throw new Error('uuid.v1(): Can\'t create more than 10M uuids/sec');
    }
  
    _lastMSecs = msecs;
    _lastNSecs = nsecs;
    _clockseq = clockseq;
  
    // Per 4.1.4 - Convert from unix epoch to Gregorian epoch
    msecs += 12219292800000;
  
    // `time_low`
    var tl = ((msecs & 0xfffffff) * 10000 + nsecs) % 0x100000000;
    b[i++] = tl >>> 24 & 0xff;
    b[i++] = tl >>> 16 & 0xff;
    b[i++] = tl >>> 8 & 0xff;
    b[i++] = tl & 0xff;
  
    // `time_mid`
    var tmh = (msecs / 0x100000000 * 10000) & 0xfffffff;
    b[i++] = tmh >>> 8 & 0xff;
    b[i++] = tmh & 0xff;
  
    // `time_high_and_version`
    b[i++] = tmh >>> 24 & 0xf | 0x10; // include version
    b[i++] = tmh >>> 16 & 0xff;
  
    // `clock_seq_hi_and_reserved` (Per 4.2.2 - include variant)
    b[i++] = clockseq >>> 8 | 0x80;
  
    // `clock_seq_low`
    b[i++] = clockseq & 0xff;
  
    // `node`
    var node = options.node || _nodeId;
    for (var n = 0; n < 6; n++) {
      b[i + n] = node[n];
    }
  
    return buf ? buf : unparse(b);
  }
  
  // **`v4()` - Generate random UUID**
  
  // See https://github.com/broofa/node-uuid for API details
  function v4(options, buf, offset) {
    // Deprecated - 'format' argument, as supported in v1.2
    var i = buf && offset || 0;
  
    if (typeof(options) == 'string') {
      buf = options == 'binary' ? new Array(16) : null;
      options = null;
    }
    options = options || {};
  
    var rnds = options.random || (options.rng || _rng)();
  
    // Per 4.4, set bits for version and `clock_seq_hi_and_reserved`
    rnds[6] = (rnds[6] & 0x0f) | 0x40;
    rnds[8] = (rnds[8] & 0x3f) | 0x80;
  
    // Copy bytes to buffer, if provided
    if (buf) {
      for (var ii = 0; ii < 16; ii++) {
        buf[i + ii] = rnds[ii];
      }
    }
  
    return buf || unparse(rnds);
  }
  
  // Export public API
  var uuid = v4;
  uuid.v1 = v1;
  uuid.v4 = v4;
  uuid.parse = parse;
  uuid.unparse = unparse;
  
  module.exports = uuid;
  
  },{"./rng":45}],47:[function(require,module,exports){
  'use strict';
  Object.defineProperty(exports, "__esModule", { value: true });
  try {
      module.exports.XMLHttpRequest = XMLHttpRequest;
  }
  catch (error) {
      console.log('Warning: XMLHttpRequest is not defined');
      module.exports.XMLHttpRequest = null;
  }
  
  },{}],48:[function(require,module,exports){
  "use strict";
  var __extends = (this && this.__extends) || (function () {
      var extendStatics = Object.setPrototypeOf ||
          ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||
          function (d, b) { for (var p in b) if (b.hasOwnProperty(p)) d[p] = b[p]; };
      return function (d, b) {
          extendStatics(d, b);
          function __() { this.constructor = d; }
          d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());
      };
  })();
  var __importStar = (this && this.__importStar) || function (mod) {
      if (mod && mod.__esModule) return mod;
      var result = {};
      if (mod != null) for (var k in mod) if (Object.hasOwnProperty.call(mod, k)) result[k] = mod[k];
      result["default"] = mod;
      return result;
  };
  Object.defineProperty(exports, "__esModule", { value: true });
  var provider_1 = require("./provider");
  var bytes_1 = require("../utils/bytes");
  var properties_1 = require("../utils/properties");
  var web_1 = require("../utils/web");
  var errors = __importStar(require("../utils/errors"));
  // The transaction has already been sanitized by the calls in Provider
  function getTransactionString(transaction) {
      var result = [];
      for (var key in transaction) {
          if (transaction[key] == null) {
              continue;
          }
          var value = bytes_1.hexlify(transaction[key]);
          if ({ gasLimit: true, gasPrice: true, nonce: true, value: true }[key]) {
              value = bytes_1.hexStripZeros(value);
          }
          result.push(key + '=' + value);
      }
      return result.join('&');
  }
  function getResult(result) {
      // getLogs, getHistory have weird success responses
      if (result.status == 0 && (result.message === 'No records found' || result.message === 'No transactions found')) {
          return result.result;
      }
      if (result.status != 1 || result.message != 'OK') {
          // @TODO: not any
          var error = new Error('invalid response');
          error.result = JSON.stringify(result);
          throw error;
      }
      return result.result;
  }
  function getJsonResult(result) {
      if (result.jsonrpc != '2.0') {
          // @TODO: not any
          var error = new Error('invalid response');
          error.result = JSON.stringify(result);
          throw error;
      }
      if (result.error) {
          // @TODO: not any
          var error = new Error(result.error.message || 'unknown error');
          if (result.error.code) {
              error.code = result.error.code;
          }
          if (result.error.data) {
              error.data = result.error.data;
          }
          throw error;
      }
      return result.result;
  }
  // The blockTag was normalized as a string by the Provider pre-perform operations
  function checkLogTag(blockTag) {
      if (blockTag === 'pending') {
          throw new Error('pending not supported');
      }
      if (blockTag === 'latest') {
          return blockTag;
      }
      return parseInt(blockTag.substring(2), 16);
  }
  var EtherscanProvider = /** @class */ (function (_super) {
      __extends(EtherscanProvider, _super);
      function EtherscanProvider(network, apiKey) {
          var _this = _super.call(this, network) || this;
          errors.checkNew(_this, EtherscanProvider);
          var name = 'invalid';
          if (_this.network) {
              name = _this.network.name;
          }
          var baseUrl = null;
          switch (name) {
              case 'homestead':
                  baseUrl = 'https://api.etherscan.io';
                  break;
              case 'ropsten':
                  baseUrl = 'https://api-ropsten.etherscan.io';
                  break;
              case 'rinkeby':
                  baseUrl = 'https://api-rinkeby.etherscan.io';
                  break;
              case 'kovan':
                  baseUrl = 'https://api-kovan.etherscan.io';
                  break;
              default:
                  throw new Error('unsupported network');
          }
          properties_1.defineReadOnly(_this, 'baseUrl', baseUrl);
          properties_1.defineReadOnly(_this, 'apiKey', apiKey);
          return _this;
      }
      EtherscanProvider.prototype.perform = function (method, params) {
          //if (!params) { params = {}; }
          var url = this.baseUrl;
          var apiKey = '';
          if (this.apiKey) {
              apiKey += '&apikey=' + this.apiKey;
          }
          switch (method) {
              case 'getBlockNumber':
                  url += '/api?module=proxy&action=eth_blockNumber' + apiKey;
                  return web_1.fetchJson(url, null, getJsonResult);
              case 'getGasPrice':
                  url += '/api?module=proxy&action=eth_gasPrice' + apiKey;
                  return web_1.fetchJson(url, null, getJsonResult);
              case 'getBalance':
                  // Returns base-10 result
                  url += '/api?module=account&action=balance&address=' + params.address;
                  url += '&tag=' + params.blockTag + apiKey;
                  return web_1.fetchJson(url, null, getResult);
              case 'getTransactionCount':
                  url += '/api?module=proxy&action=eth_getTransactionCount&address=' + params.address;
                  url += '&tag=' + params.blockTag + apiKey;
                  return web_1.fetchJson(url, null, getJsonResult);
              case 'getCode':
                  url += '/api?module=proxy&action=eth_getCode&address=' + params.address;
                  url += '&tag=' + params.blockTag + apiKey;
                  return web_1.fetchJson(url, null, getJsonResult);
              case 'getStorageAt':
                  url += '/api?module=proxy&action=eth_getStorageAt&address=' + params.address;
                  url += '&position=' + params.position;
                  url += '&tag=' + params.blockTag + apiKey;
                  return web_1.fetchJson(url, null, getJsonResult);
              case 'sendTransaction':
                  url += '/api?module=proxy&action=eth_sendRawTransaction&hex=' + params.signedTransaction;
                  url += apiKey;
                  return web_1.fetchJson(url, null, getJsonResult);
              case 'getBlock':
                  if (params.blockTag) {
                      url += '/api?module=proxy&action=eth_getBlockByNumber&tag=' + params.blockTag;
                      url += '&boolean=false';
                      url += apiKey;
                      return web_1.fetchJson(url, null, getJsonResult);
                  }
                  throw new Error('getBlock by blockHash not implmeneted');
              case 'getTransaction':
                  url += '/api?module=proxy&action=eth_getTransactionByHash&txhash=' + params.transactionHash;
                  url += apiKey;
                  return web_1.fetchJson(url, null, getJsonResult);
              case 'getTransactionReceipt':
                  url += '/api?module=proxy&action=eth_getTransactionReceipt&txhash=' + params.transactionHash;
                  url += apiKey;
                  return web_1.fetchJson(url, null, getJsonResult);
              case 'call':
                  var transaction = getTransactionString(params.transaction);
                  if (transaction) {
                      transaction = '&' + transaction;
                  }
                  url += '/api?module=proxy&action=eth_call' + transaction;
                  url += apiKey;
                  return web_1.fetchJson(url, null, getJsonResult);
              case 'estimateGas':
                  var transaction = getTransactionString(params.transaction);
                  if (transaction) {
                      transaction = '&' + transaction;
                  }
                  url += '/api?module=proxy&action=eth_estimateGas&' + transaction;
                  url += apiKey;
                  return web_1.fetchJson(url, null, getJsonResult);
              case 'getLogs':
                  url += '/api?module=logs&action=getLogs';
                  try {
                      if (params.filter.fromBlock) {
                          url += '&fromBlock=' + checkLogTag(params.filter.fromBlock);
                      }
                      if (params.filter.toBlock) {
                          url += '&toBlock=' + checkLogTag(params.filter.toBlock);
                      }
                      if (params.filter.address) {
                          url += '&address=' + params.filter.address;
                      }
                      // @TODO: We can handle slightly more complicated logs using the logs API
                      if (params.filter.topics && params.filter.topics.length > 0) {
                          if (params.filter.topics.length > 1) {
                              throw new Error('unsupported topic format');
                          }
                          var topic0 = params.filter.topics[0];
                          if (typeof (topic0) !== 'string' || topic0.length !== 66) {
                              throw new Error('unsupported topic0 format');
                          }
                          url += '&topic0=' + topic0;
                      }
                  }
                  catch (error) {
                      return Promise.reject(error);
                  }
                  url += apiKey;
                  var self = this;
                  return web_1.fetchJson(url, null, getResult).then(function (logs) {
                      var txs = {};
                      var seq = Promise.resolve();
                      logs.forEach(function (log) {
                          seq = seq.then(function () {
                              if (log.blockHash != null) {
                                  return null;
                              }
                              log.blockHash = txs[log.transactionHash];
                              if (log.blockHash == null) {
                                  return self.getTransaction(log.transactionHash).then(function (tx) {
                                      txs[log.transactionHash] = tx.blockHash;
                                      log.blockHash = tx.blockHash;
                                      return null;
                                  });
                              }
                              return null;
                          });
                      });
                      return seq.then(function () {
                          return logs;
                      });
                  });
              case 'getEtherPrice':
                  if (this.network.name !== 'homestead') {
                      return Promise.resolve(0.0);
                  }
                  url += '/api?module=stats&action=ethprice';
                  url += apiKey;
                  return web_1.fetchJson(url, null, getResult).then(function (result) {
                      return parseFloat(result.ethusd);
                  });
              default:
                  break;
          }
          return _super.prototype.perform.call(this, method, params);
      };
      // @TODO: Allow startBlock and endBlock to be Promises
      EtherscanProvider.prototype.getHistory = function (addressOrName, startBlock, endBlock) {
          var url = this.baseUrl;
          var apiKey = '';
          if (this.apiKey) {
              apiKey += '&apikey=' + this.apiKey;
          }
          if (startBlock == null) {
              startBlock = 0;
          }
          if (endBlock == null) {
              endBlock = 99999999;
          }
          return this.resolveName(addressOrName).then(function (address) {
              url += '/api?module=account&action=txlist&address=' + address;
              url += '&startblock=' + startBlock;
              url += '&endblock=' + endBlock;
              url += '&sort=asc' + apiKey;
              return web_1.fetchJson(url, null, getResult).then(function (result) {
                  var output = [];
                  result.forEach(function (tx) {
                      ['contractAddress', 'to'].forEach(function (key) {
                          if (tx[key] == '') {
                              delete tx[key];
                          }
                      });
                      if (tx.creates == null && tx.contractAddress != null) {
                          tx.creates = tx.contractAddress;
                      }
                      var item = provider_1.Provider.checkTransactionResponse(tx);
                      if (tx.timeStamp) {
                          item.timestamp = parseInt(tx.timeStamp);
                      }
                      output.push(item);
                  });
                  return output;
              });
          });
      };
      return EtherscanProvider;
  }(provider_1.Provider));
  exports.EtherscanProvider = EtherscanProvider;
  
  },{"../utils/bytes":60,"../utils/errors":61,"../utils/properties":69,"../utils/web":80,"./provider":54}],49:[function(require,module,exports){
  'use strict';
  var __extends = (this && this.__extends) || (function () {
      var extendStatics = Object.setPrototypeOf ||
          ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||
          function (d, b) { for (var p in b) if (b.hasOwnProperty(p)) d[p] = b[p]; };
      return function (d, b) {
          extendStatics(d, b);
          function __() { this.constructor = d; }
          d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());
      };
  })();
  var __importStar = (this && this.__importStar) || function (mod) {
      if (mod && mod.__esModule) return mod;
      var result = {};
      if (mod != null) for (var k in mod) if (Object.hasOwnProperty.call(mod, k)) result[k] = mod[k];
      result["default"] = mod;
      return result;
  };
  Object.defineProperty(exports, "__esModule", { value: true });
  var provider_1 = require("./provider");
  var errors = __importStar(require("../utils/errors"));
  // Returns:
  //  - true is all networks match
  //  - false if any network is null
  //  - throws if any 2 networks do not match
  function checkNetworks(networks) {
      var result = true;
      var check = null;
      networks.forEach(function (network) {
          // Null
          if (network == null) {
              result = false;
              return;
          }
          // Have nothing to compre to yet
          if (check == null) {
              check = network;
              return;
          }
          // Matches!
          if (check.name === network.name &&
              check.chainId === network.chainId &&
              check.ensAddress === network.ensAddress) {
              return;
          }
          errors.throwError('provider mismatch', errors.INVALID_ARGUMENT, { arg: 'networks', value: networks });
      });
      return result;
  }
  var FallbackProvider = /** @class */ (function (_super) {
      __extends(FallbackProvider, _super);
      function FallbackProvider(providers) {
          var _this = this;
          if (providers.length === 0) {
              throw new Error('no providers');
          }
          // All networks are ready, we can know the network for certain
          var ready = checkNetworks(providers.map(function (p) { return p.network; }));
          if (ready) {
              _this = _super.call(this, providers[0].network) || this;
          }
          else {
              // The network won't be known until all child providers know
              var ready_1 = Promise.all(providers.map(function (p) { return p.getNetwork(); })).then(function (networks) {
                  if (!checkNetworks(networks)) {
                      errors.throwError('getNetwork returned null', errors.UNKNOWN_ERROR, {});
                  }
                  return networks[0];
              });
              _this = _super.call(this, ready_1) || this;
          }
          errors.checkNew(_this, FallbackProvider);
          // Preserve a copy, so we don't get mutated
          _this._providers = providers.slice(0);
          return _this;
      }
      Object.defineProperty(FallbackProvider.prototype, "providers", {
          get: function () {
              // Return a copy, so we don't get mutated
              return this._providers.slice(0);
          },
          enumerable: true,
          configurable: true
      });
      FallbackProvider.prototype.perform = function (method, params) {
          // Creates a copy of the providers array
          var providers = this.providers;
          return new Promise(function (resolve, reject) {
              var firstError = null;
              function next() {
                  if (!providers.length) {
                      reject(firstError);
                      return;
                  }
                  var provider = providers.shift();
                  provider.perform(method, params).then(function (result) {
                      return resolve(result);
                  }).catch(function (error) {
                      if (!firstError) {
                          firstError = error;
                      }
                      setTimeout(next, 0);
                  });
              }
              next();
          });
      };
      return FallbackProvider;
  }(provider_1.Provider));
  exports.FallbackProvider = FallbackProvider;
  
  },{"../utils/errors":61,"./provider":54}],50:[function(require,module,exports){
  'use strict';
  Object.defineProperty(exports, "__esModule", { value: true });
  var provider_1 = require("./provider");
  exports.Provider = provider_1.Provider;
  var etherscan_provider_1 = require("./etherscan-provider");
  exports.EtherscanProvider = etherscan_provider_1.EtherscanProvider;
  var fallback_provider_1 = require("./fallback-provider");
  exports.FallbackProvider = fallback_provider_1.FallbackProvider;
  var ipc_provider_1 = require("./ipc-provider");
  exports.IpcProvider = ipc_provider_1.IpcProvider;
  var infura_provider_1 = require("./infura-provider");
  exports.InfuraProvider = infura_provider_1.InfuraProvider;
  var json_rpc_provider_1 = require("./json-rpc-provider");
  exports.JsonRpcProvider = json_rpc_provider_1.JsonRpcProvider;
  exports.JsonRpcSigner = json_rpc_provider_1.JsonRpcSigner;
  var web3_provider_1 = require("./web3-provider");
  exports.Web3Provider = web3_provider_1.Web3Provider;
  function getDefaultProvider(network) {
      return new fallback_provider_1.FallbackProvider([
          new infura_provider_1.InfuraProvider(network),
          new etherscan_provider_1.EtherscanProvider(network),
      ]);
  }
  exports.getDefaultProvider = getDefaultProvider;
  
  },{"./etherscan-provider":48,"./fallback-provider":49,"./infura-provider":51,"./ipc-provider":52,"./json-rpc-provider":53,"./provider":54,"./web3-provider":55}],51:[function(require,module,exports){
  'use strict';
  var __extends = (this && this.__extends) || (function () {
      var extendStatics = Object.setPrototypeOf ||
          ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||
          function (d, b) { for (var p in b) if (b.hasOwnProperty(p)) d[p] = b[p]; };
      return function (d, b) {
          extendStatics(d, b);
          function __() { this.constructor = d; }
          d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());
      };
  })();
  var __importStar = (this && this.__importStar) || function (mod) {
      if (mod && mod.__esModule) return mod;
      var result = {};
      if (mod != null) for (var k in mod) if (Object.hasOwnProperty.call(mod, k)) result[k] = mod[k];
      result["default"] = mod;
      return result;
  };
  Object.defineProperty(exports, "__esModule", { value: true });
  var json_rpc_provider_1 = require("./json-rpc-provider");
  var networks_1 = require("../utils/networks");
  var properties_1 = require("../utils/properties");
  var errors = __importStar(require("../utils/errors"));
  var InfuraProvider = /** @class */ (function (_super) {
      __extends(InfuraProvider, _super);
      function InfuraProvider(network, apiAccessToken) {
          var _this = this;
          network = networks_1.getNetwork((network == null) ? 'homestead' : network);
          var host = null;
          switch (network.name) {
              case 'homestead':
                  host = 'mainnet.infura.io';
                  break;
              case 'ropsten':
                  host = 'ropsten.infura.io';
                  break;
              case 'rinkeby':
                  host = 'rinkeby.infura.io';
                  break;
              case 'kovan':
                  host = 'kovan.infura.io';
                  break;
              default:
                  throw new Error('unsupported network');
          }
          _this = _super.call(this, 'https://' + host + '/' + (apiAccessToken || ''), network) || this;
          errors.checkNew(_this, InfuraProvider);
          properties_1.defineReadOnly(_this, 'apiAccessToken', apiAccessToken || null);
          return _this;
      }
      InfuraProvider.prototype._startPending = function () {
          console.log('WARNING: INFURA does not support pending filters');
      };
      InfuraProvider.prototype.getSigner = function (address) {
          errors.throwError('INFURA does not support signing', errors.UNSUPPORTED_OPERATION, { operation: 'getSigner' });
          return null;
      };
      InfuraProvider.prototype.listAccounts = function () {
          return Promise.resolve([]);
      };
      return InfuraProvider;
  }(json_rpc_provider_1.JsonRpcProvider));
  exports.InfuraProvider = InfuraProvider;
  
  },{"../utils/errors":61,"../utils/networks":67,"../utils/properties":69,"./json-rpc-provider":53}],52:[function(require,module,exports){
  "use strict";
  Object.defineProperty(exports, "__esModule", { value: true });
  
  },{}],53:[function(require,module,exports){
  'use strict';
  var __extends = (this && this.__extends) || (function () {
      var extendStatics = Object.setPrototypeOf ||
          ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||
          function (d, b) { for (var p in b) if (b.hasOwnProperty(p)) d[p] = b[p]; };
      return function (d, b) {
          extendStatics(d, b);
          function __() { this.constructor = d; }
          d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());
      };
  })();
  var __importStar = (this && this.__importStar) || function (mod) {
      if (mod && mod.__esModule) return mod;
      var result = {};
      if (mod != null) for (var k in mod) if (Object.hasOwnProperty.call(mod, k)) result[k] = mod[k];
      result["default"] = mod;
      return result;
  };
  Object.defineProperty(exports, "__esModule", { value: true });
  // See: https://github.com/ethereum/wiki/wiki/JSON-RPC
  var provider_1 = require("./provider");
  var address_1 = require("../utils/address");
  var bytes_1 = require("../utils/bytes");
  var networks_1 = require("../utils/networks");
  var properties_1 = require("../utils/properties");
  var utf8_1 = require("../utils/utf8");
  var web_1 = require("../utils/web");
  var types_1 = require("../utils/types");
  var errors = __importStar(require("../utils/errors"));
  function timer(timeout) {
      return new Promise(function (resolve) {
          setTimeout(function () {
              resolve();
          }, timeout);
      });
  }
  function getResult(payload) {
      if (payload.error) {
          // @TODO: not any
          var error = new Error(payload.error.message);
          error.code = payload.error.code;
          error.data = payload.error.data;
          throw error;
      }
      return payload.result;
  }
  function getLowerCase(value) {
      if (value) {
          return value.toLowerCase();
      }
      return value;
  }
  var JsonRpcSigner = /** @class */ (function (_super) {
      __extends(JsonRpcSigner, _super);
      function JsonRpcSigner(provider, address) {
          var _this = _super.call(this) || this;
          errors.checkNew(_this, JsonRpcSigner);
          properties_1.defineReadOnly(_this, 'provider', provider);
          // Statically attach to a given address
          if (address) {
              properties_1.defineReadOnly(_this, '_address', address);
          }
          return _this;
      }
      Object.defineProperty(JsonRpcSigner.prototype, "address", {
          get: function () {
              if (!this._address) {
                  errors.throwError('no sync sync address available; use getAddress', errors.UNSUPPORTED_OPERATION, { operation: 'address' });
              }
              return this._address;
          },
          enumerable: true,
          configurable: true
      });
      JsonRpcSigner.prototype.getAddress = function () {
          if (this._address) {
              return Promise.resolve(this._address);
          }
          return this.provider.send('eth_accounts', []).then(function (accounts) {
              if (accounts.length === 0) {
                  errors.throwError('no accounts', errors.UNSUPPORTED_OPERATION, { operation: 'getAddress' });
              }
              return address_1.getAddress(accounts[0]);
          });
      };
      JsonRpcSigner.prototype.getBalance = function (blockTag) {
          return this.provider.getBalance(this.getAddress(), blockTag);
      };
      JsonRpcSigner.prototype.getTransactionCount = function (blockTag) {
          return this.provider.getTransactionCount(this.getAddress(), blockTag);
      };
      JsonRpcSigner.prototype.sendTransaction = function (transaction) {
          var _this = this;
          var tx = properties_1.shallowCopy(transaction);
          if (tx.from == null) {
              tx.from = this.getAddress().then(function (address) {
                  if (!address) {
                      return null;
                  }
                  return address.toLowerCase();
              });
          }
          return properties_1.resolveProperties(tx).then(function (tx) {
              tx = JsonRpcProvider.hexlifyTransaction(tx);
              return _this.provider.send('eth_sendTransaction', [tx]).then(function (hash) {
                  return web_1.poll(function () {
                      return _this.provider.getTransaction(hash).then(function (tx) {
                          if (tx === null) {
                              return undefined;
                          }
                          return _this.provider._wrapTransaction(tx, hash);
                      });
                  }, { onceBlock: _this.provider }).catch(function (error) {
                      error.transactionHash = hash;
                      throw error;
                  });
              });
          });
      };
      JsonRpcSigner.prototype.signMessage = function (message) {
          var _this = this;
          var data = ((typeof (message) === 'string') ? utf8_1.toUtf8Bytes(message) : message);
          return this.getAddress().then(function (address) {
              // https://github.com/ethereum/wiki/wiki/JSON-RPC#eth_sign
              return _this.provider.send('eth_sign', [address.toLowerCase(), bytes_1.hexlify(data)]);
          });
      };
      JsonRpcSigner.prototype.unlock = function (password) {
          var provider = this.provider;
          return this.getAddress().then(function (address) {
              return provider.send('personal_unlockAccount', [address.toLowerCase(), password, null]);
          });
      };
      return JsonRpcSigner;
  }(types_1.Signer));
  exports.JsonRpcSigner = JsonRpcSigner;
  var JsonRpcProvider = /** @class */ (function (_super) {
      __extends(JsonRpcProvider, _super);
      function JsonRpcProvider(url, network) {
          var _this = this;
          // One parameter, but it is a network name, so swap it with the URL
          if (typeof (url) === 'string') {
              if (network === null && networks_1.getNetwork(url)) {
                  network = url;
                  url = null;
              }
          }
          if (network) {
              // The network has been specified explicitly, we can use it
              _this = _super.call(this, network) || this;
          }
          else {
              // The network is unknown, query the JSON-RPC for it
              var ready = new Promise(function (resolve, reject) {
                  setTimeout(function () {
                      _this.send('net_version', []).then(function (result) {
                          return resolve(networks_1.getNetwork(parseInt(result)));
                      }).catch(function (error) {
                          reject(error);
                      });
                  });
              });
              _this = _super.call(this, ready) || this;
          }
          errors.checkNew(_this, JsonRpcProvider);
          // Default URL
          if (!url) {
              url = 'http://localhost:8545';
          }
          if (typeof (url) === 'string') {
              _this.connection = {
                  url: url
              };
          }
          else {
              _this.connection = url;
          }
          return _this;
      }
      JsonRpcProvider.prototype.getSigner = function (address) {
          return new JsonRpcSigner(this, address);
      };
      JsonRpcProvider.prototype.listAccounts = function () {
          return this.send('eth_accounts', []).then(function (accounts) {
              return accounts.map(function (a) { return address_1.getAddress(a); });
          });
      };
      JsonRpcProvider.prototype.send = function (method, params) {
          var request = {
              method: method,
              params: params,
              id: 42,
              jsonrpc: "2.0"
          };
          return web_1.fetchJson(this.connection, JSON.stringify(request), getResult);
      };
      JsonRpcProvider.prototype.perform = function (method, params) {
          switch (method) {
              case 'getBlockNumber':
                  return this.send('eth_blockNumber', []);
              case 'getGasPrice':
                  return this.send('eth_gasPrice', []);
              case 'getBalance':
                  return this.send('eth_getBalance', [getLowerCase(params.address), params.blockTag]);
              case 'getTransactionCount':
                  return this.send('eth_getTransactionCount', [getLowerCase(params.address), params.blockTag]);
              case 'getCode':
                  return this.send('eth_getCode', [getLowerCase(params.address), params.blockTag]);
              case 'getStorageAt':
                  return this.send('eth_getStorageAt', [getLowerCase(params.address), params.position, params.blockTag]);
              case 'sendTransaction':
                  return this.send('eth_sendRawTransaction', [params.signedTransaction]);
              case 'getBlock':
                  if (params.blockTag) {
                      return this.send('eth_getBlockByNumber', [params.blockTag, false]);
                  }
                  else if (params.blockHash) {
                      return this.send('eth_getBlockByHash', [params.blockHash, false]);
                  }
                  return Promise.reject(new Error('invalid block tag or block hash'));
              case 'getTransaction':
                  return this.send('eth_getTransactionByHash', [params.transactionHash]);
              case 'getTransactionReceipt':
                  return this.send('eth_getTransactionReceipt', [params.transactionHash]);
              case 'call':
                  return this.send('eth_call', [JsonRpcProvider.hexlifyTransaction(params.transaction), 'latest']);
              case 'estimateGas':
                  return this.send('eth_estimateGas', [JsonRpcProvider.hexlifyTransaction(params.transaction)]);
              case 'getLogs':
                  if (params.filter && params.filter.address != null) {
                      params.filter.address = getLowerCase(params.filter.address);
                  }
                  return this.send('eth_getLogs', [params.filter]);
              default:
                  break;
          }
          errors.throwError(method + ' not implemented', errors.NOT_IMPLEMENTED, { operation: method });
          return null;
      };
      JsonRpcProvider.prototype._startPending = function () {
          if (this._pendingFilter != null) {
              return;
          }
          var self = this;
          var pendingFilter = this.send('eth_newPendingTransactionFilter', []);
          this._pendingFilter = pendingFilter;
          pendingFilter.then(function (filterId) {
              function poll() {
                  self.send('eth_getFilterChanges', [filterId]).then(function (hashes) {
                      if (self._pendingFilter != pendingFilter) {
                          return null;
                      }
                      var seq = Promise.resolve();
                      hashes.forEach(function (hash) {
                          self._emitted['t:' + hash.toLowerCase()] = 'pending';
                          seq = seq.then(function () {
                              return self.getTransaction(hash).then(function (tx) {
                                  self.emit('pending', tx);
                                  return null;
                              });
                          });
                      });
                      return seq.then(function () {
                          return timer(1000);
                      });
                  }).then(function () {
                      if (self._pendingFilter != pendingFilter) {
                          self.send('eth_uninstallFilter', [filterId]);
                          return;
                      }
                      setTimeout(function () { poll(); }, 0);
                      return null;
                  }).catch(function (error) { });
              }
              poll();
              return filterId;
          }).catch(function (error) { });
      };
      JsonRpcProvider.prototype._stopPending = function () {
          this._pendingFilter = null;
      };
      // Convert an ethers.js transaction into a JSON-RPC transaction
      //  - gasLimit => gas
      //  - All values hexlified
      //  - All numeric values zero-striped
      // @TODO: Not any, a dictionary of string to strings
      JsonRpcProvider.hexlifyTransaction = function (transaction) {
          var result = {};
          // Some nodes (INFURA ropsten; INFURA mainnet is fine) don't like extra zeros.
          ['gasLimit', 'gasPrice', 'nonce', 'value'].forEach(function (key) {
              if (transaction[key] == null) {
                  return;
              }
              var value = bytes_1.hexStripZeros(bytes_1.hexlify(transaction[key]));
              if (key === 'gasLimit') {
                  key = 'gas';
              }
              result[key] = value;
          });
          ['from', 'to', 'data'].forEach(function (key) {
              if (transaction[key] == null) {
                  return;
              }
              result[key] = bytes_1.hexlify(transaction[key]);
          });
          return result;
      };
      return JsonRpcProvider;
  }(provider_1.Provider));
  exports.JsonRpcProvider = JsonRpcProvider;
  
  },{"../utils/address":57,"../utils/bytes":60,"../utils/errors":61,"../utils/networks":67,"../utils/properties":69,"../utils/types":77,"../utils/utf8":79,"../utils/web":80,"./provider":54}],54:[function(require,module,exports){
  'use strict';
  var __extends = (this && this.__extends) || (function () {
      var extendStatics = Object.setPrototypeOf ||
          ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||
          function (d, b) { for (var p in b) if (b.hasOwnProperty(p)) d[p] = b[p]; };
      return function (d, b) {
          extendStatics(d, b);
          function __() { this.constructor = d; }
          d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());
      };
  })();
  var __importStar = (this && this.__importStar) || function (mod) {
      if (mod && mod.__esModule) return mod;
      var result = {};
      if (mod != null) for (var k in mod) if (Object.hasOwnProperty.call(mod, k)) result[k] = mod[k];
      result["default"] = mod;
      return result;
  };
  Object.defineProperty(exports, "__esModule", { value: true });
  var address_1 = require("../utils/address");
  var bignumber_1 = require("../utils/bignumber");
  var bytes_1 = require("../utils/bytes");
  var hash_1 = require("../utils/hash");
  var networks_1 = require("../utils/networks");
  var properties_1 = require("../utils/properties");
  var rlp_1 = require("../utils/rlp");
  var transaction_1 = require("../utils/transaction");
  var utf8_1 = require("../utils/utf8");
  var web_1 = require("../utils/web");
  var types_1 = require("../utils/types");
  var errors = __importStar(require("../utils/errors"));
  //////////////////////////////
  // Request and Response Checking
  // @TODO: not any?
  function check(format, object) {
      var result = {};
      for (var key in format) {
          try {
              var value = format[key](object[key]);
              if (value !== undefined) {
                  result[key] = value;
              }
          }
          catch (error) {
              error.checkKey = key;
              error.checkValue = object[key];
              throw error;
          }
      }
      return result;
  }
  function allowNull(check, nullValue) {
      return (function (value) {
          if (value == null) {
              return nullValue;
          }
          return check(value);
      });
  }
  function allowFalsish(check, replaceValue) {
      return (function (value) {
          if (!value) {
              return replaceValue;
          }
          return check(value);
      });
  }
  function arrayOf(check) {
      return (function (array) {
          if (!Array.isArray(array)) {
              throw new Error('not an array');
          }
          var result = [];
          array.forEach(function (value) {
              result.push(check(value));
          });
          return result;
      });
  }
  function checkHash(hash) {
      if (typeof (hash) === 'string' && bytes_1.hexDataLength(hash) === 32) {
          return hash.toLowerCase();
      }
      errors.throwError('invalid hash', errors.INVALID_ARGUMENT, { arg: 'hash', value: hash });
      return null;
  }
  function checkNumber(number) {
      return bignumber_1.bigNumberify(number).toNumber();
  }
  // Returns the difficulty as a number, or if too large (i.e. PoA network) null
  function checkDifficulty(value) {
      var v = bignumber_1.bigNumberify(value);
      try {
          return v.toNumber();
      }
      catch (error) { }
      return null;
  }
  function checkBoolean(value) {
      if (typeof (value) === 'boolean') {
          return value;
      }
      if (typeof (value) === 'string') {
          if (value === 'true') {
              return true;
          }
          if (value === 'false') {
              return false;
          }
      }
      throw new Error('invaid boolean - ' + value);
  }
  function checkUint256(uint256) {
      if (!bytes_1.isHexString(uint256)) {
          throw new Error('invalid uint256');
      }
      while (uint256.length < 66) {
          uint256 = '0x0' + uint256.substring(2);
      }
      return uint256;
  }
  /*
  function checkString(string) {
      if (typeof(string) !== 'string') { throw new Error('invalid string'); }
      return string;
  }
  */
  function checkBlockTag(blockTag) {
      if (blockTag == null) {
          return 'latest';
      }
      if (blockTag === 'earliest') {
          return '0x0';
      }
      if (blockTag === 'latest' || blockTag === 'pending') {
          return blockTag;
      }
      if (typeof (blockTag) === 'number') {
          return bytes_1.hexStripZeros(bytes_1.hexlify(blockTag));
      }
      if (bytes_1.isHexString(blockTag)) {
          return bytes_1.hexStripZeros(blockTag);
      }
      throw new Error('invalid blockTag');
  }
  var formatBlock = {
      hash: checkHash,
      parentHash: checkHash,
      number: checkNumber,
      timestamp: checkNumber,
      nonce: allowNull(bytes_1.hexlify),
      difficulty: checkDifficulty,
      gasLimit: bignumber_1.bigNumberify,
      gasUsed: bignumber_1.bigNumberify,
      miner: address_1.getAddress,
      extraData: bytes_1.hexlify,
      //transactions: allowNull(arrayOf(checkTransaction)),
      transactions: allowNull(arrayOf(checkHash)),
  };
  function checkBlock(block) {
      if (block.author != null && block.miner == null) {
          block.miner = block.author;
      }
      return check(formatBlock, block);
  }
  var formatTransaction = {
      hash: checkHash,
      blockHash: allowNull(checkHash, null),
      blockNumber: allowNull(checkNumber, null),
      transactionIndex: allowNull(checkNumber, null),
      from: address_1.getAddress,
      gasPrice: bignumber_1.bigNumberify,
      gasLimit: bignumber_1.bigNumberify,
      to: allowNull(address_1.getAddress, null),
      value: bignumber_1.bigNumberify,
      nonce: checkNumber,
      data: bytes_1.hexlify,
      r: allowNull(checkUint256),
      s: allowNull(checkUint256),
      v: allowNull(checkNumber),
      creates: allowNull(address_1.getAddress, null),
      raw: allowNull(bytes_1.hexlify),
  };
  function checkTransactionResponse(transaction) {
      // Rename gas to gasLimit
      if (transaction.gas != null && transaction.gasLimit == null) {
          transaction.gasLimit = transaction.gas;
      }
      // Some clients (TestRPC) do strange things like return 0x0 for the
      // 0 address; correct this to be a real address
      if (transaction.to && bignumber_1.bigNumberify(transaction.to).isZero()) {
          transaction.to = '0x0000000000000000000000000000000000000000';
      }
      // Rename input to data
      if (transaction.input != null && transaction.data == null) {
          transaction.data = transaction.input;
      }
      // If to and creates are empty, populate the creates from the transaction
      if (transaction.to == null && transaction.creates == null) {
          transaction.creates = address_1.getContractAddress(transaction);
      }
      // @TODO: use transaction.serialize? Have to add support for including v, r, and s...
      if (!transaction.raw) {
          // Very loose providers (e.g. TestRPC) don't provide a signature or raw
          if (transaction.v && transaction.r && transaction.s) {
              var raw = [
                  bytes_1.stripZeros(bytes_1.hexlify(transaction.nonce)),
                  bytes_1.stripZeros(bytes_1.hexlify(transaction.gasPrice)),
                  bytes_1.stripZeros(bytes_1.hexlify(transaction.gasLimit)),
                  (transaction.to || "0x"),
                  bytes_1.stripZeros(bytes_1.hexlify(transaction.value || '0x')),
                  bytes_1.hexlify(transaction.data || '0x'),
                  bytes_1.stripZeros(bytes_1.hexlify(transaction.v || '0x')),
                  bytes_1.stripZeros(bytes_1.hexlify(transaction.r)),
                  bytes_1.stripZeros(bytes_1.hexlify(transaction.s)),
              ];
              transaction.raw = rlp_1.encode(raw);
          }
      }
      var result = check(formatTransaction, transaction);
      var networkId = transaction.networkId;
      if (bytes_1.isHexString(networkId)) {
          networkId = bignumber_1.bigNumberify(networkId).toNumber();
      }
      if (typeof (networkId) !== 'number' && result.v != null) {
          networkId = (result.v - 35) / 2;
          if (networkId < 0) {
              networkId = 0;
          }
          networkId = parseInt(networkId);
      }
      if (typeof (networkId) !== 'number') {
          networkId = 0;
      }
      result.networkId = networkId;
      // 0x0000... should actually be null
      if (result.blockHash && result.blockHash.replace(/0/g, '') === 'x') {
          result.blockHash = null;
      }
      return result;
  }
  var formatTransactionRequest = {
      from: allowNull(address_1.getAddress),
      nonce: allowNull(checkNumber),
      gasLimit: allowNull(bignumber_1.bigNumberify),
      gasPrice: allowNull(bignumber_1.bigNumberify),
      to: allowNull(address_1.getAddress),
      value: allowNull(bignumber_1.bigNumberify),
      data: allowNull(bytes_1.hexlify),
  };
  function checkTransactionRequest(transaction) {
      return check(formatTransactionRequest, transaction);
  }
  var formatTransactionReceiptLog = {
      transactionLogIndex: allowNull(checkNumber),
      transactionIndex: checkNumber,
      blockNumber: checkNumber,
      transactionHash: checkHash,
      address: address_1.getAddress,
      topics: arrayOf(checkHash),
      data: bytes_1.hexlify,
      logIndex: checkNumber,
      blockHash: checkHash,
  };
  function checkTransactionReceiptLog(log) {
      return check(formatTransactionReceiptLog, log);
  }
  var formatTransactionReceipt = {
      contractAddress: allowNull(address_1.getAddress, null),
      transactionIndex: checkNumber,
      root: allowNull(checkHash),
      gasUsed: bignumber_1.bigNumberify,
      logsBloom: allowNull(bytes_1.hexlify),
      blockHash: checkHash,
      transactionHash: checkHash,
      logs: arrayOf(checkTransactionReceiptLog),
      blockNumber: checkNumber,
      cumulativeGasUsed: bignumber_1.bigNumberify,
      status: allowNull(checkNumber)
  };
  function checkTransactionReceipt(transactionReceipt) {
      //var status = transactionReceipt.status;
      //var root = transactionReceipt.root;
      var result = check(formatTransactionReceipt, transactionReceipt);
      result.logs.forEach(function (entry, index) {
          if (entry.transactionLogIndex == null) {
              entry.transactionLogIndex = index;
          }
      });
      if (transactionReceipt.status != null) {
          result.byzantium = true;
      }
      return result;
  }
  function checkTopics(topics) {
      if (Array.isArray(topics)) {
          topics.forEach(function (topic) {
              checkTopics(topic);
          });
      }
      else if (topics != null) {
          checkHash(topics);
      }
      return topics;
  }
  var formatFilter = {
      fromBlock: allowNull(checkBlockTag, undefined),
      toBlock: allowNull(checkBlockTag, undefined),
      address: allowNull(address_1.getAddress, undefined),
      topics: allowNull(checkTopics, undefined),
  };
  function checkFilter(filter) {
      return check(formatFilter, filter);
  }
  var formatLog = {
      blockNumber: allowNull(checkNumber),
      blockHash: allowNull(checkHash),
      transactionIndex: checkNumber,
      removed: allowNull(checkBoolean),
      address: address_1.getAddress,
      data: allowFalsish(bytes_1.hexlify, '0x'),
      topics: arrayOf(checkHash),
      transactionHash: checkHash,
      logIndex: checkNumber,
  };
  function checkLog(log) {
      return check(formatLog, log);
  }
  //////////////////////////////
  // Event Serializeing
  function serializeTopics(topics) {
      return topics.map(function (topic) {
          if (typeof (topic) === 'string') {
              return topic;
          }
          else if (Array.isArray(topic)) {
              topic.forEach(function (topic) {
                  if (topic !== null && bytes_1.hexDataLength(topic) !== 32) {
                      errors.throwError('invalid topic', errors.INVALID_ARGUMENT, { argument: 'topic', value: topic });
                  }
              });
              return topic.join(',');
          }
          return errors.throwError('invalid topic value', errors.INVALID_ARGUMENT, { argument: 'topic', value: topic });
      }).join('&');
  }
  function deserializeTopics(data) {
      return data.split(/&/g).map(function (topic) {
          var comps = topic.split(',');
          if (comps.length === 1) {
              if (comps[0] === '') {
                  return null;
              }
              return topic;
          }
          return comps;
      });
  }
  function getEventTag(eventName) {
      if (typeof (eventName) === 'string') {
          if (bytes_1.hexDataLength(eventName) === 20) {
              return 'address:' + address_1.getAddress(eventName);
          }
          eventName = eventName.toLowerCase();
          if (eventName === 'block' || eventName === 'pending' || eventName === 'error') {
              return eventName;
          }
          else if (bytes_1.hexDataLength(eventName) === 32) {
              return 'tx:' + eventName;
          }
      }
      else if (Array.isArray(eventName)) {
          return 'filter::' + serializeTopics(eventName);
      }
      else if (eventName && typeof (eventName) === 'object') {
          return 'filter:' + (eventName.address || '') + ':' + serializeTopics(eventName.topics || []);
      }
      throw new Error('invalid event - ' + eventName);
  }
  var Provider = /** @class */ (function (_super) {
      __extends(Provider, _super);
      function Provider(network) {
          var _this = _super.call(this) || this;
          errors.checkNew(_this, Provider);
          if (network instanceof Promise) {
              properties_1.defineReadOnly(_this, 'ready', network.then(function (network) {
                  properties_1.defineReadOnly(_this, '_network', network);
                  return network;
              }));
          }
          else {
              var knownNetwork = networks_1.getNetwork((network == null) ? 'homestead' : network);
              if (knownNetwork) {
                  properties_1.defineReadOnly(_this, '_network', knownNetwork);
                  properties_1.defineReadOnly(_this, 'ready', Promise.resolve(_this._network));
              }
              else {
                  errors.throwError('invalid network', errors.INVALID_ARGUMENT, { arg: 'network', value: network });
              }
          }
          _this._lastBlockNumber = -2;
          // Balances being watched for changes
          _this._balances = {};
          // Events being listened to
          _this._events = [];
          _this._pollingInterval = 4000;
          // We use this to track recent emitted events; for example, if we emit a "block" of 100
          // and we get a `getBlock(100)` request which would result in null, we should retry
          // until we get a response. This provides devs with a consistent view. Similarly for
          // transaction hashes.
          _this._emitted = { block: _this._lastBlockNumber };
          return _this;
      }
      Provider.prototype._doPoll = function () {
          var _this = this;
          this.getBlockNumber().then(function (blockNumber) {
              // If the block hasn't changed, meh.
              if (blockNumber === _this._lastBlockNumber) {
                  return;
              }
              if (_this._lastBlockNumber === -2) {
                  _this._lastBlockNumber = blockNumber - 1;
              }
              // Notify all listener for each block that has passed
              for (var i = _this._lastBlockNumber + 1; i <= blockNumber; i++) {
                  if (_this._emitted.block < i) {
                      _this._emitted.block = i;
                      // Evict any transaction hashes or block hashes over 12 blocks
                      // old, since they should not return null anyways
                      Object.keys(_this._emitted).forEach(function (key) {
                          if (key === 'block') {
                              return;
                          }
                          if (_this._emitted[key] > i + 12) {
                              delete _this._emitted[key];
                          }
                      });
                  }
                  _this.emit('block', i);
              }
              // Sweep balances and remove addresses we no longer have events for
              var newBalances = {};
              // Find all transaction hashes we are waiting on
              _this._events.forEach(function (event) {
                  var comps = event.tag.split(':');
                  switch (comps[0]) {
                      case 'tx': {
                          var hash_2 = comps[1];
                          _this.getTransactionReceipt(hash_2).then(function (receipt) {
                              if (!receipt || receipt.blockNumber == null) {
                                  return null;
                              }
                              _this._emitted['t:' + hash_2] = receipt.blockNumber;
                              _this.emit(hash_2, receipt);
                              return null;
                          }).catch(function (error) { _this.emit('error', error); });
                          break;
                      }
                      case 'address': {
                          var address_2 = comps[1];
                          if (_this._balances[address_2]) {
                              newBalances[address_2] = _this._balances[address_2];
                          }
                          _this.getBalance(address_2, 'latest').then(function (balance) {
                              var lastBalance = this._balances[address_2];
                              if (lastBalance && balance.eq(lastBalance)) {
                                  return;
                              }
                              this._balances[address_2] = balance;
                              this.emit(address_2, balance);
                              return null;
                          }).catch(function (error) { _this.emit('error', error); });
                          break;
                      }
                      case 'filter': {
                          var address = comps[1];
                          var topics = deserializeTopics(comps[2]);
                          var filter_1 = {
                              address: address,
                              fromBlock: _this._lastBlockNumber + 1,
                              toBlock: blockNumber,
                              topics: topics
                          };
                          _this.getLogs(filter_1).then(function (logs) {
                              if (logs.length === 0) {
                                  return;
                              }
                              logs.forEach(function (log) {
                                  _this._emitted['b:' + log.blockHash] = log.blockNumber;
                                  _this._emitted['t:' + log.transactionHash] = log.blockNumber;
                                  _this.emit(filter_1, log);
                              });
                              return null;
                          }).catch(function (error) { _this.emit('error', error); });
                          break;
                      }
                  }
              });
              _this._lastBlockNumber = blockNumber;
              _this._balances = newBalances;
              return null;
          }).catch(function (error) { });
          this.doPoll();
      };
      Provider.prototype.resetEventsBlock = function (blockNumber) {
          this._lastBlockNumber = blockNumber;
          this._doPoll();
      };
      Object.defineProperty(Provider.prototype, "network", {
          get: function () {
              return this._network;
          },
          enumerable: true,
          configurable: true
      });
      Provider.prototype.getNetwork = function () {
          return this.ready;
      };
      Object.defineProperty(Provider.prototype, "blockNumber", {
          get: function () {
              if (this._lastBlockNumber < 0) {
                  return null;
              }
              return this._lastBlockNumber;
          },
          enumerable: true,
          configurable: true
      });
      Object.defineProperty(Provider.prototype, "polling", {
          get: function () {
              return (this._poller != null);
          },
          set: function (value) {
              var _this = this;
              setTimeout(function () {
                  if (value && !_this._poller) {
                      _this._poller = setInterval(_this._doPoll.bind(_this), _this.pollingInterval);
                  }
                  else if (!value && _this._poller) {
                      clearInterval(_this._poller);
                      _this._poller = null;
                  }
              }, 0);
          },
          enumerable: true,
          configurable: true
      });
      Object.defineProperty(Provider.prototype, "pollingInterval", {
          get: function () {
              return this._pollingInterval;
          },
          set: function (value) {
              var _this = this;
              if (typeof (value) !== 'number' || value <= 0 || parseInt(String(value)) != value) {
                  throw new Error('invalid polling interval');
              }
              this._pollingInterval = value;
              if (this._poller) {
                  clearInterval(this._poller);
                  this._poller = setInterval(function () { _this._doPoll(); }, this._pollingInterval);
              }
          },
          enumerable: true,
          configurable: true
      });
      // @TODO: Add .poller which must be an event emitter with a 'start', 'stop' and 'block' event;
      //        this will be used once we move to the WebSocket or other alternatives to polling
      Provider.prototype.waitForTransaction = function (transactionHash, timeout) {
          var _this = this;
          return web_1.poll(function () {
              return _this.getTransactionReceipt(transactionHash).then(function (receipt) {
                  if (receipt == null) {
                      return undefined;
                  }
                  return receipt;
              });
          }, { onceBlock: this });
      };
      Provider.prototype.getBlockNumber = function () {
          var _this = this;
          return this.ready.then(function () {
              return _this.perform('getBlockNumber', {}).then(function (result) {
                  var value = parseInt(result);
                  if (value != result) {
                      throw new Error('invalid response - getBlockNumber');
                  }
                  return value;
              });
          });
      };
      Provider.prototype.getGasPrice = function () {
          var _this = this;
          return this.ready.then(function () {
              return _this.perform('getGasPrice', {}).then(function (result) {
                  return bignumber_1.bigNumberify(result);
              });
          });
      };
      Provider.prototype.getBalance = function (addressOrName, blockTag) {
          var _this = this;
          return this.ready.then(function () {
              return properties_1.resolveProperties({ addressOrName: addressOrName, blockTag: blockTag }).then(function (_a) {
                  var addressOrName = _a.addressOrName, blockTag = _a.blockTag;
                  return _this.resolveName(addressOrName).then(function (address) {
                      var params = { address: address, blockTag: checkBlockTag(blockTag) };
                      return _this.perform('getBalance', params).then(function (result) {
                          return bignumber_1.bigNumberify(result);
                      });
                  });
              });
          });
      };
      Provider.prototype.getTransactionCount = function (addressOrName, blockTag) {
          var _this = this;
          return this.ready.then(function () {
              return properties_1.resolveProperties({ addressOrName: addressOrName, blockTag: blockTag }).then(function (_a) {
                  var addressOrName = _a.addressOrName, blockTag = _a.blockTag;
                  return _this.resolveName(addressOrName).then(function (address) {
                      var params = { address: address, blockTag: checkBlockTag(blockTag) };
                      return _this.perform('getTransactionCount', params).then(function (result) {
                          return bignumber_1.bigNumberify(result).toNumber();
                      });
                  });
              });
          });
      };
      Provider.prototype.getCode = function (addressOrName, blockTag) {
          var _this = this;
          return this.ready.then(function () {
              return properties_1.resolveProperties({ addressOrName: addressOrName, blockTag: blockTag }).then(function (_a) {
                  var addressOrName = _a.addressOrName, blockTag = _a.blockTag;
                  return _this.resolveName(addressOrName).then(function (address) {
                      var params = { address: address, blockTag: checkBlockTag(blockTag) };
                      return _this.perform('getCode', params).then(function (result) {
                          return bytes_1.hexlify(result);
                      });
                  });
              });
          });
      };
      Provider.prototype.getStorageAt = function (addressOrName, position, blockTag) {
          var _this = this;
          return this.ready.then(function () {
              return properties_1.resolveProperties({ addressOrName: addressOrName, position: position, blockTag: blockTag }).then(function (_a) {
                  var addressOrName = _a.addressOrName, position = _a.position, blockTag = _a.blockTag;
                  return _this.resolveName(addressOrName).then(function (address) {
                      var params = {
                          address: address,
                          blockTag: checkBlockTag(blockTag),
                          position: bytes_1.hexStripZeros(bytes_1.hexlify(position)),
                      };
                      return _this.perform('getStorageAt', params).then(function (result) {
                          return bytes_1.hexlify(result);
                      });
                  });
              });
          });
      };
      Provider.prototype.sendTransaction = function (signedTransaction) {
          var _this = this;
          return this.ready.then(function () {
              return properties_1.resolveProperties({ signedTransaction: signedTransaction }).then(function (_a) {
                  var signedTransaction = _a.signedTransaction;
                  var params = { signedTransaction: bytes_1.hexlify(signedTransaction) };
                  return _this.perform('sendTransaction', params).then(function (hash) {
                      return _this._wrapTransaction(transaction_1.parse(signedTransaction), hash);
                  }, function (error) {
                      var tx = transaction_1.parse(signedTransaction);
                      if (tx.hash) {
                          error.transactionHash = tx.hash;
                      }
                      throw error;
                  });
              });
          });
      };
      // This should be called by any subclass wrapping a TransactionResponse
      Provider.prototype._wrapTransaction = function (tx, hash) {
          var _this = this;
          if (bytes_1.hexDataLength(hash) !== 32) {
              throw new Error('invalid response - sendTransaction');
          }
          var result = tx;
          // Check the hash we expect is the same as the hash the server reported
          if (hash != null && tx.hash !== hash) {
              errors.throwError('Transaction hash mismatch from Proivder.sendTransaction.', errors.UNKNOWN_ERROR, { expectedHash: tx.hash, returnedHash: hash });
          }
          this._emitted['t:' + tx.hash] = 'pending';
          result.wait = function (timeout) {
              return _this.waitForTransaction(hash, timeout).then(function (receipt) {
                  if (receipt.status === 0) {
                      errors.throwError('transaction failed', errors.CALL_EXCEPTION, {
                          transaction: tx
                      });
                  }
                  return receipt;
              });
          };
          return result;
      };
      Provider.prototype.call = function (transaction) {
          var _this = this;
          var tx = properties_1.shallowCopy(transaction);
          return this.ready.then(function () {
              return properties_1.resolveProperties(tx).then(function (tx) {
                  return _this._resolveNames(tx, ['to', 'from']).then(function (tx) {
                      var params = { transaction: checkTransactionRequest(tx) };
                      return _this.perform('call', params).then(function (result) {
                          return bytes_1.hexlify(result);
                      });
                  });
              });
          });
      };
      Provider.prototype.estimateGas = function (transaction) {
          var _this = this;
          var tx = {
              to: transaction.to,
              from: transaction.from,
              data: transaction.data
          };
          return this.ready.then(function () {
              return properties_1.resolveProperties(tx).then(function (tx) {
                  return _this._resolveNames(tx, ['to', 'from']).then(function (tx) {
                      var params = { transaction: checkTransactionRequest(tx) };
                      return _this.perform('estimateGas', params).then(function (result) {
                          return bignumber_1.bigNumberify(result);
                      });
                  });
              });
          });
      };
      Provider.prototype.getBlock = function (blockHashOrBlockTag) {
          var _this = this;
          return this.ready.then(function () {
              return properties_1.resolveProperties({ blockHashOrBlockTag: blockHashOrBlockTag }).then(function (_a) {
                  var blockHashOrBlockTag = _a.blockHashOrBlockTag;
                  try {
                      var blockHash = bytes_1.hexlify(blockHashOrBlockTag);
                      if (bytes_1.hexDataLength(blockHash) === 32) {
                          return web_1.poll(function () {
                              return _this.perform('getBlock', { blockHash: blockHash }).then(function (block) {
                                  if (block == null) {
                                      if (_this._emitted['b:' + blockHash] == null) {
                                          return null;
                                      }
                                      return undefined;
                                  }
                                  return checkBlock(block);
                              });
                          }, { onceBlock: _this });
                      }
                  }
                  catch (error) { }
                  try {
                      var blockNumber_1 = -128;
                      var blockTag_1 = checkBlockTag(blockHashOrBlockTag);
                      if (bytes_1.isHexString(blockTag_1)) {
                          blockNumber_1 = parseInt(blockTag_1.substring(2), 16);
                      }
                      return web_1.poll(function () {
                          return _this.perform('getBlock', { blockTag: blockTag_1 }).then(function (block) {
                              if (block == null) {
                                  if (blockNumber_1 > _this._emitted.block) {
                                      return undefined;
                                  }
                                  return null;
                              }
                              return checkBlock(block);
                          });
                      }, { onceBlock: _this });
                  }
                  catch (error) { }
                  throw new Error('invalid block hash or block tag');
              });
          });
      };
      Provider.prototype.getTransaction = function (transactionHash) {
          var _this = this;
          return this.ready.then(function () {
              return properties_1.resolveProperties({ transactionHash: transactionHash }).then(function (_a) {
                  var transactionHash = _a.transactionHash;
                  var params = { transactionHash: checkHash(transactionHash) };
                  return web_1.poll(function () {
                      return _this.perform('getTransaction', params).then(function (result) {
                          if (result == null) {
                              if (_this._emitted['t:' + transactionHash] == null) {
                                  return null;
                              }
                              return undefined;
                          }
                          return Provider.checkTransactionResponse(result);
                      });
                  }, { onceBlock: _this });
              });
          });
      };
      Provider.prototype.getTransactionReceipt = function (transactionHash) {
          var _this = this;
          return this.ready.then(function () {
              return properties_1.resolveProperties({ transactionHash: transactionHash }).then(function (_a) {
                  var transactionHash = _a.transactionHash;
                  var params = { transactionHash: checkHash(transactionHash) };
                  return web_1.poll(function () {
                      return _this.perform('getTransactionReceipt', params).then(function (result) {
                          if (result == null) {
                              if (_this._emitted['t:' + transactionHash] == null) {
                                  return null;
                              }
                              return undefined;
                          }
                          return checkTransactionReceipt(result);
                      });
                  }, { onceBlock: _this });
              });
          });
      };
      Provider.prototype.getLogs = function (filter) {
          var _this = this;
          return this.ready.then(function () {
              return properties_1.resolveProperties(filter).then(function (filter) {
                  return _this._resolveNames(filter, ['address']).then(function (filter) {
                      var params = { filter: checkFilter(filter) };
                      return _this.perform('getLogs', params).then(function (result) {
                          return arrayOf(checkLog)(result);
                      });
                  });
              });
          });
      };
      Provider.prototype.getEtherPrice = function () {
          var _this = this;
          return this.ready.then(function () {
              return _this.perform('getEtherPrice', {}).then(function (result) {
                  // @TODO: Check valid float
                  return result;
              });
          });
      };
      // @TODO: Could probably use resolveProperties instead?
      Provider.prototype._resolveNames = function (object, keys) {
          var promises = [];
          var result = properties_1.shallowCopy(object);
          keys.forEach(function (key) {
              if (result[key] == null) {
                  return;
              }
              promises.push(this.resolveName(result[key]).then(function (address) {
                  result[key] = address;
                  return;
              }));
          }, this);
          return Promise.all(promises).then(function () { return result; });
      };
      Provider.prototype._getResolver = function (name) {
          var _this = this;
          // Get the resolver from the blockchain
          return this.getNetwork().then(function (network) {
              // No ENS...
              if (!network.ensAddress) {
                  errors.throwError('network does support ENS', errors.UNSUPPORTED_OPERATION, { operation: 'ENS', network: network.name });
              }
              // keccak256('resolver(bytes32)')
              var data = '0x0178b8bf' + hash_1.namehash(name).substring(2);
              var transaction = { to: network.ensAddress, data: data };
              return _this.call(transaction).then(function (data) {
                  // extract the address from the data
                  if (bytes_1.hexDataLength(data) !== 32) {
                      return null;
                  }
                  return address_1.getAddress(bytes_1.hexDataSlice(data, 12));
              });
          });
      };
      Provider.prototype.resolveName = function (name) {
          var _this = this;
          // If it is a promise, resolve it then recurse
          if (name instanceof Promise) {
              return name.then(function (addressOrName) {
                  return _this.resolveName(addressOrName);
              });
          }
          // If it is already an address, nothing to resolve
          try {
              return Promise.resolve(address_1.getAddress(name));
          }
          catch (error) { }
          var self = this;
          var nodeHash = hash_1.namehash(name);
          // Get the addr from the resovler
          return this._getResolver(name).then(function (resolverAddress) {
              // keccak256('addr(bytes32)')
              var data = '0x3b3b57de' + nodeHash.substring(2);
              var transaction = { to: resolverAddress, data: data };
              return self.call(transaction);
              // extract the address from the data
          }).then(function (data) {
              if (bytes_1.hexDataLength(data) !== 32) {
                  return null;
              }
              var address = address_1.getAddress(bytes_1.hexDataSlice(data, 12));
              if (address === '0x0000000000000000000000000000000000000000') {
                  return null;
              }
              return address;
          });
      };
      Provider.prototype.lookupAddress = function (address) {
          var _this = this;
          if (address instanceof Promise) {
              return address.then(function (address) {
                  return _this.lookupAddress(address);
              });
          }
          address = address_1.getAddress(address);
          var name = address.substring(2) + '.addr.reverse';
          var nodehash = hash_1.namehash(name);
          var self = this;
          return this._getResolver(name).then(function (resolverAddress) {
              if (!resolverAddress) {
                  return null;
              }
              // keccak('name(bytes32)')
              var data = '0x691f3431' + nodehash.substring(2);
              var transaction = { to: resolverAddress, data: data };
              return self.call(transaction);
          }).then(function (data) {
              // Strip off the "0x"
              data = data.substring(2);
              // Strip off the dynamic string pointer (0x20)
              if (data.length < 64) {
                  return null;
              }
              data = data.substring(64);
              if (data.length < 64) {
                  return null;
              }
              var length = bignumber_1.bigNumberify('0x' + data.substring(0, 64)).toNumber();
              data = data.substring(64);
              if (2 * length > data.length) {
                  return null;
              }
              var name = utf8_1.toUtf8String('0x' + data.substring(0, 2 * length));
              // Make sure the reverse record matches the foward record
              return self.resolveName(name).then(function (addr) {
                  if (addr != address) {
                      return null;
                  }
                  return name;
              });
          });
      };
      Provider.checkTransactionResponse = function (transaction) {
          return checkTransactionResponse(transaction);
      };
      Provider.prototype.doPoll = function () {
      };
      Provider.prototype.perform = function (method, params) {
          errors.throwError(method + ' not implemented', errors.NOT_IMPLEMENTED, { operation: method });
          return null;
      };
      Provider.prototype._startPending = function () {
          console.log('WARNING: this provider does not support pending events');
      };
      Provider.prototype._stopPending = function () {
      };
      Provider.prototype._addEventListener = function (eventName, listener, once) {
          this._events.push({
              tag: getEventTag(eventName),
              listener: listener,
              once: once,
          });
          if (eventName === 'pending') {
              this._startPending();
          }
          this.polling = true;
      };
      Provider.prototype.on = function (eventName, listener) {
          this._addEventListener(eventName, listener, false);
          return this;
      };
      Provider.prototype.once = function (eventName, listener) {
          this._addEventListener(eventName, listener, true);
          return this;
      };
      Provider.prototype.addEventListener = function (eventName, listener) {
          return this.on(eventName, listener);
      };
      Provider.prototype.emit = function (eventName) {
          var _this = this;
          var args = [];
          for (var _i = 1; _i < arguments.length; _i++) {
              args[_i - 1] = arguments[_i];
          }
          var result = false;
          var eventTag = getEventTag(eventName);
          this._events = this._events.filter(function (event) {
              if (event.tag !== eventTag) {
                  return true;
              }
              setTimeout(function () {
                  event.listener.apply(_this, args);
              }, 0);
              result = true;
              return !(event.once);
          });
          return result;
      };
      Provider.prototype.listenerCount = function (eventName) {
          if (!eventName) {
              return this._events.length;
          }
          var eventTag = getEventTag(eventName);
          return this._events.filter(function (event) {
              return (event.tag === eventTag);
          }).length;
      };
      Provider.prototype.listeners = function (eventName) {
          var eventTag = getEventTag(eventName);
          return this._events.filter(function (event) {
              return (event.tag === eventTag);
          }).map(function (event) {
              return event.listener;
          });
      };
      Provider.prototype.removeAllListeners = function (eventName) {
          var eventTag = getEventTag(eventName);
          this._events = this._events.filter(function (event) {
              return (event.tag !== eventTag);
          });
          if (eventName === 'pending') {
              this._stopPending();
          }
          if (this._events.length === 0) {
              this.polling = false;
          }
          return this;
      };
      Provider.prototype.removeListener = function (eventName, listener) {
          var found = false;
          var eventTag = getEventTag(eventName);
          this._events = this._events.filter(function (event) {
              if (event.tag !== eventTag) {
                  return true;
              }
              if (found) {
                  return true;
              }
              found = false;
              return false;
          });
          if (eventName === 'pending' && this.listenerCount('pending') === 0) {
              this._stopPending();
          }
          if (this.listenerCount() === 0) {
              this.polling = false;
          }
          return this;
      };
      return Provider;
  }(types_1.MinimalProvider));
  exports.Provider = Provider;
  // See: https://github.com/isaacs/inherits/blob/master/inherits_browser.js
  function inherits(ctor, superCtor) {
      ctor.super_ = superCtor;
      ctor.prototype = Object.create(superCtor.prototype, {
          constructor: {
              value: ctor,
              enumerable: false,
              writable: true,
              configurable: true
          }
      });
  }
  function inheritable(parent) {
      return function (child) {
          inherits(child, parent);
          properties_1.defineReadOnly(child, 'inherits', inheritable(child));
      };
  }
  properties_1.defineReadOnly(Provider, 'inherits', inheritable(Provider));
  
  },{"../utils/address":57,"../utils/bignumber":59,"../utils/bytes":60,"../utils/errors":61,"../utils/hash":62,"../utils/networks":67,"../utils/properties":69,"../utils/rlp":71,"../utils/transaction":76,"../utils/types":77,"../utils/utf8":79,"../utils/web":80}],55:[function(require,module,exports){
  'use strict';
  var __extends = (this && this.__extends) || (function () {
      var extendStatics = Object.setPrototypeOf ||
          ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||
          function (d, b) { for (var p in b) if (b.hasOwnProperty(p)) d[p] = b[p]; };
      return function (d, b) {
          extendStatics(d, b);
          function __() { this.constructor = d; }
          d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());
      };
  })();
  var __importStar = (this && this.__importStar) || function (mod) {
      if (mod && mod.__esModule) return mod;
      var result = {};
      if (mod != null) for (var k in mod) if (Object.hasOwnProperty.call(mod, k)) result[k] = mod[k];
      result["default"] = mod;
      return result;
  };
  Object.defineProperty(exports, "__esModule", { value: true });
  var json_rpc_provider_1 = require("./json-rpc-provider");
  var properties_1 = require("../utils/properties");
  var errors = __importStar(require("../utils/errors"));
  /*
  @TODO
  utils.defineProperty(Web3Signer, 'onchange', {
  
  });
  
  */
  var Web3Provider = /** @class */ (function (_super) {
      __extends(Web3Provider, _super);
      function Web3Provider(web3Provider, network) {
          var _this = this;
          if (!web3Provider || !web3Provider.sendAsync) {
              errors.throwError('invalid web3Provider', errors.INVALID_ARGUMENT, { arg: 'web3Provider', value: web3Provider });
          }
          // HTTP has a host; IPC has a path.
          var url = web3Provider.host || web3Provider.path || '';
          _this = _super.call(this, url, network) || this;
          errors.checkNew(_this, Web3Provider);
          properties_1.defineReadOnly(_this, '_web3Provider', web3Provider);
          return _this;
      }
      Web3Provider.prototype.send = function (method, params) {
          var _this = this;
          // Metamask complains about eth_sign (and on some versions hangs)
          if (method == 'eth_sign' && this._web3Provider.isMetaMask) {
              // https://github.com/ethereum/go-ethereum/wiki/Management-APIs#personal_sign
              method = 'personal_sign';
              params = [params[1], params[0]];
          }
          return new Promise(function (resolve, reject) {
              var request = {
                  method: method,
                  params: params,
                  id: 42,
                  jsonrpc: "2.0"
              };
              _this._web3Provider.sendAsync(request, function (error, result) {
                  if (error) {
                      reject(error);
                      return;
                  }
                  if (result.error) {
                      // @TODO: not any
                      var error = new Error(result.error.message);
                      error.code = result.error.code;
                      error.data = result.error.data;
                      reject(error);
                      return;
                  }
                  resolve(result.result);
              });
          });
      };
      return Web3Provider;
  }(json_rpc_provider_1.JsonRpcProvider));
  exports.Web3Provider = Web3Provider;
  
  },{"../utils/errors":61,"../utils/properties":69,"./json-rpc-provider":53}],56:[function(require,module,exports){
  'use strict';
  var __extends = (this && this.__extends) || (function () {
      var extendStatics = Object.setPrototypeOf ||
          ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||
          function (d, b) { for (var p in b) if (b.hasOwnProperty(p)) d[p] = b[p]; };
      return function (d, b) {
          extendStatics(d, b);
          function __() { this.constructor = d; }
          d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());
      };
  })();
  var __importStar = (this && this.__importStar) || function (mod) {
      if (mod && mod.__esModule) return mod;
      var result = {};
      if (mod != null) for (var k in mod) if (Object.hasOwnProperty.call(mod, k)) result[k] = mod[k];
      result["default"] = mod;
      return result;
  };
  Object.defineProperty(exports, "__esModule", { value: true });
  // See: https://github.com/ethereum/wiki/wiki/Ethereum-Contract-ABI
  var address_1 = require("./address");
  var bignumber_1 = require("./bignumber");
  var bytes_1 = require("./bytes");
  var utf8_1 = require("./utf8");
  var properties_1 = require("./properties");
  var errors = __importStar(require("./errors"));
  var paramTypeBytes = new RegExp(/^bytes([0-9]*)$/);
  var paramTypeNumber = new RegExp(/^(u?int)([0-9]*)$/);
  var paramTypeArray = new RegExp(/^(.*)\[([0-9]*)\]$/);
  exports.defaultCoerceFunc = function (type, value) {
      var match = type.match(paramTypeNumber);
      if (match && parseInt(match[2]) <= 48) {
          return value.toNumber();
      }
      return value;
  };
  ///////////////////////////////////
  // Parsing for Solidity Signatures
  var regexParen = new RegExp("^([^)(]*)\\((.*)\\)([^)(]*)$");
  var regexIdentifier = new RegExp("^[A-Za-z_][A-Za-z0-9_]*$");
  function verifyType(type) {
      // These need to be transformed to their full description
      if (type.match(/^uint($|[^1-9])/)) {
          type = 'uint256' + type.substring(4);
      }
      else if (type.match(/^int($|[^1-9])/)) {
          type = 'int256' + type.substring(3);
      }
      return type;
  }
  function parseParam(param, allowIndexed) {
      function throwError(i) {
          throw new Error('unexpected character "' + param[i] + '" at position ' + i + ' in "' + param + '"');
      }
      var parent = { type: '', name: '', state: { allowType: true } };
      var node = parent;
      for (var i = 0; i < param.length; i++) {
          var c = param[i];
          switch (c) {
              case '(':
                  if (!node.state.allowParams) {
                      throwError(i);
                  }
                  node.state.allowType = false;
                  node.type = verifyType(node.type);
                  node.components = [{ type: '', name: '', parent: node, state: { allowType: true } }];
                  node = node.components[0];
                  break;
              case ')':
                  delete node.state;
                  if (allowIndexed && node.name === 'indexed') {
                      node.indexed = true;
                      node.name = '';
                  }
                  node.type = verifyType(node.type);
                  var child = node;
                  node = node.parent;
                  if (!node) {
                      throwError(i);
                  }
                  delete child.parent;
                  node.state.allowParams = false;
                  node.state.allowName = true;
                  node.state.allowArray = true;
                  break;
              case ',':
                  delete node.state;
                  if (allowIndexed && node.name === 'indexed') {
                      node.indexed = true;
                      node.name = '';
                  }
                  node.type = verifyType(node.type);
                  var sibling = { type: '', name: '', parent: node.parent, state: { allowType: true } };
                  node.parent.components.push(sibling);
                  delete node.parent;
                  node = sibling;
                  break;
              // Hit a space...
              case ' ':
                  // If reading type, the type is done and may read a param or name
                  if (node.state.allowType) {
                      if (node.type !== '') {
                          node.type = verifyType(node.type);
                          delete node.state.allowType;
                          node.state.allowName = true;
                          node.state.allowParams = true;
                      }
                  }
                  // If reading name, the name is done
                  if (node.state.allowName) {
                      if (node.name !== '') {
                          if (allowIndexed && node.name === 'indexed') {
                              node.indexed = true;
                              node.name = '';
                          }
                          else {
                              node.state.allowName = false;
                          }
                      }
                  }
                  break;
              case '[':
                  if (!node.state.allowArray) {
                      throwError(i);
                  }
                  node.type += c;
                  node.state.allowArray = false;
                  node.state.allowName = false;
                  node.state.readArray = true;
                  break;
              case ']':
                  if (!node.state.readArray) {
                      throwError(i);
                  }
                  node.type += c;
                  node.state.readArray = false;
                  node.state.allowArray = true;
                  node.state.allowName = true;
                  break;
              default:
                  if (node.state.allowType) {
                      node.type += c;
                      node.state.allowParams = true;
                      node.state.allowArray = true;
                  }
                  else if (node.state.allowName) {
                      node.name += c;
                      delete node.state.allowArray;
                  }
                  else if (node.state.readArray) {
                      node.type += c;
                  }
                  else {
                      throwError(i);
                  }
          }
      }
      if (node.parent) {
          throw new Error("unexpected eof");
      }
      delete parent.state;
      if (allowIndexed && node.name === 'indexed') {
          node.indexed = true;
          node.name = '';
      }
      parent.type = verifyType(parent.type);
      return parent;
  }
  // @TODO: Better return type
  function parseSignatureEvent(fragment) {
      var abi = {
          anonymous: false,
          inputs: [],
          name: '',
          type: 'event'
      };
      var match = fragment.match(regexParen);
      if (!match) {
          throw new Error('invalid event: ' + fragment);
      }
      abi.name = match[1].trim();
      splitNesting(match[2]).forEach(function (param) {
          param = parseParam(param, true);
          param.indexed = !!param.indexed;
          abi.inputs.push(param);
      });
      match[3].split(' ').forEach(function (modifier) {
          switch (modifier) {
              case 'anonymous':
                  abi.anonymous = true;
                  break;
              case '':
                  break;
              default:
                  console.log('unknown modifier: ' + modifier);
          }
      });
      if (abi.name && !abi.name.match(regexIdentifier)) {
          throw new Error('invalid identifier: "' + abi.name + '"');
      }
      return abi;
  }
  function parseSignatureFunction(fragment) {
      var abi = {
          constant: false,
          inputs: [],
          name: '',
          outputs: [],
          payable: false,
          stateMutability: null,
          type: 'function'
      };
      var comps = fragment.split(' returns ');
      var left = comps[0].match(regexParen);
      if (!left) {
          throw new Error('invalid signature');
      }
      abi.name = left[1].trim();
      if (!abi.name.match(regexIdentifier)) {
          throw new Error('invalid identifier: "' + left[1] + '"');
      }
      splitNesting(left[2]).forEach(function (param) {
          abi.inputs.push(parseParam(param));
      });
      left[3].split(' ').forEach(function (modifier) {
          switch (modifier) {
              case 'constant':
                  abi.constant = true;
                  break;
              case 'payable':
                  abi.payable = true;
                  break;
              case 'pure':
                  abi.constant = true;
                  abi.stateMutability = 'pure';
                  break;
              case 'view':
                  abi.constant = true;
                  abi.stateMutability = 'view';
                  break;
              case '':
                  break;
              default:
                  console.log('unknown modifier: ' + modifier);
          }
      });
      // We have outputs
      if (comps.length > 1) {
          var right = comps[1].match(regexParen);
          if (right[1].trim() != '' || right[3].trim() != '') {
              throw new Error('unexpected tokens');
          }
          splitNesting(right[2]).forEach(function (param) {
              abi.outputs.push(parseParam(param));
          });
      }
      return abi;
  }
  function parseParamType(type) {
      return parseParam(type, true);
  }
  exports.parseParamType = parseParamType;
  // @TODO: Allow a second boolean to expose names
  function formatParamType(paramType) {
      return getParamCoder(exports.defaultCoerceFunc, paramType).type;
  }
  exports.formatParamType = formatParamType;
  // @TODO: Allow a second boolean to expose names and modifiers
  function formatSignature(fragment) {
      return fragment.name + '(' + fragment.inputs.map(function (i) { return formatParamType(i); }).join(',') + ')';
  }
  exports.formatSignature = formatSignature;
  function parseSignature(fragment) {
      if (typeof (fragment) === 'string') {
          // Make sure the "returns" is surrounded by a space and all whitespace is exactly one space
          fragment = fragment.replace(/\(/g, ' (').replace(/\)/g, ') ').replace(/\s+/g, ' ');
          fragment = fragment.trim();
          if (fragment.substring(0, 6) === 'event ') {
              return parseSignatureEvent(fragment.substring(6).trim());
          }
          else {
              if (fragment.substring(0, 9) === 'function ') {
                  fragment = fragment.substring(9);
              }
              return parseSignatureFunction(fragment.trim());
          }
      }
      throw new Error('unknown signature');
  }
  exports.parseSignature = parseSignature;
  var Coder = /** @class */ (function () {
      function Coder(coerceFunc, name, type, localName, dynamic) {
          this.coerceFunc = coerceFunc;
          this.name = name;
          this.type = type;
          this.localName = localName;
          this.dynamic = dynamic;
      }
      return Coder;
  }());
  // Clones the functionality of an existing Coder, but without a localName
  var CoderAnonymous = /** @class */ (function (_super) {
      __extends(CoderAnonymous, _super);
      function CoderAnonymous(coder) {
          var _this = _super.call(this, coder.coerceFunc, coder.name, coder.type, undefined, coder.dynamic) || this;
          properties_1.defineReadOnly(_this, 'coder', coder);
          return _this;
      }
      CoderAnonymous.prototype.encode = function (value) { return this.coder.encode(value); };
      CoderAnonymous.prototype.decode = function (data, offset) { return this.coder.decode(data, offset); };
      return CoderAnonymous;
  }(Coder));
  var CoderNull = /** @class */ (function (_super) {
      __extends(CoderNull, _super);
      function CoderNull(coerceFunc, localName) {
          return _super.call(this, coerceFunc, 'null', '', localName, false) || this;
      }
      CoderNull.prototype.encode = function (value) {
          return bytes_1.arrayify([]);
      };
      CoderNull.prototype.decode = function (data, offset) {
          if (offset > data.length) {
              throw new Error('invalid null');
          }
          return {
              consumed: 0,
              value: this.coerceFunc('null', undefined)
          };
      };
      return CoderNull;
  }(Coder));
  var CoderNumber = /** @class */ (function (_super) {
      __extends(CoderNumber, _super);
      function CoderNumber(coerceFunc, size, signed, localName) {
          var _this = this;
          var name = ((signed ? 'int' : 'uint') + (size * 8));
          _this = _super.call(this, coerceFunc, name, name, localName, false) || this;
          _this.size = size;
          _this.signed = signed;
          return _this;
      }
      CoderNumber.prototype.encode = function (value) {
          try {
              var v = bignumber_1.bigNumberify(value);
              v = v.toTwos(this.size * 8).maskn(this.size * 8);
              //value = value.toTwos(size * 8).maskn(size * 8);
              if (this.signed) {
                  v = v.fromTwos(this.size * 8).toTwos(256);
              }
              return bytes_1.padZeros(bytes_1.arrayify(v), 32);
          }
          catch (error) {
              errors.throwError('invalid number value', errors.INVALID_ARGUMENT, {
                  arg: this.localName,
                  coderType: this.name,
                  value: value
              });
          }
          return null;
      };
      CoderNumber.prototype.decode = function (data, offset) {
          if (data.length < offset + 32) {
              errors.throwError('insufficient data for ' + this.name + ' type', errors.INVALID_ARGUMENT, {
                  arg: this.localName,
                  coderType: this.name,
                  value: bytes_1.hexlify(data.slice(offset, offset + 32))
              });
          }
          var junkLength = 32 - this.size;
          var value = bignumber_1.bigNumberify(data.slice(offset + junkLength, offset + 32));
          if (this.signed) {
              value = value.fromTwos(this.size * 8);
          }
          else {
              value = value.maskn(this.size * 8);
          }
          return {
              consumed: 32,
              value: this.coerceFunc(this.name, value),
          };
      };
      return CoderNumber;
  }(Coder));
  var uint256Coder = new CoderNumber(function (type, value) { return value; }, 32, false, 'none');
  var CoderBoolean = /** @class */ (function (_super) {
      __extends(CoderBoolean, _super);
      function CoderBoolean(coerceFunc, localName) {
          return _super.call(this, coerceFunc, 'bool', 'bool', localName, false) || this;
      }
      CoderBoolean.prototype.encode = function (value) {
          return uint256Coder.encode(!!value ? 1 : 0);
      };
      CoderBoolean.prototype.decode = function (data, offset) {
          try {
              var result = uint256Coder.decode(data, offset);
          }
          catch (error) {
              if (error.reason === 'insufficient data for uint256 type') {
                  errors.throwError('insufficient data for boolean type', errors.INVALID_ARGUMENT, {
                      arg: this.localName,
                      coderType: 'boolean',
                      value: error.value
                  });
              }
              throw error;
          }
          return {
              consumed: result.consumed,
              value: this.coerceFunc('bool', !result.value.isZero())
          };
      };
      return CoderBoolean;
  }(Coder));
  var CoderFixedBytes = /** @class */ (function (_super) {
      __extends(CoderFixedBytes, _super);
      function CoderFixedBytes(coerceFunc, length, localName) {
          var _this = this;
          var name = ('bytes' + length);
          _this = _super.call(this, coerceFunc, name, name, localName, false) || this;
          _this.length = length;
          return _this;
      }
      CoderFixedBytes.prototype.encode = function (value) {
          var result = new Uint8Array(32);
          try {
              var data = bytes_1.arrayify(value);
              if (data.length > 32) {
                  throw new Error();
              }
              result.set(data);
          }
          catch (error) {
              errors.throwError('invalid ' + this.name + ' value', errors.INVALID_ARGUMENT, {
                  arg: this.localName,
                  coderType: this.name,
                  value: (error.value || value)
              });
          }
          return result;
      };
      CoderFixedBytes.prototype.decode = function (data, offset) {
          if (data.length < offset + 32) {
              errors.throwError('insufficient data for ' + name + ' type', errors.INVALID_ARGUMENT, {
                  arg: this.localName,
                  coderType: this.name,
                  value: bytes_1.hexlify(data.slice(offset, offset + 32))
              });
          }
          return {
              consumed: 32,
              value: this.coerceFunc(this.name, bytes_1.hexlify(data.slice(offset, offset + this.length)))
          };
      };
      return CoderFixedBytes;
  }(Coder));
  var CoderAddress = /** @class */ (function (_super) {
      __extends(CoderAddress, _super);
      function CoderAddress(coerceFunc, localName) {
          return _super.call(this, coerceFunc, 'address', 'address', localName, false) || this;
      }
      CoderAddress.prototype.encode = function (value) {
          var result = new Uint8Array(32);
          try {
              result.set(bytes_1.arrayify(address_1.getAddress(value)), 12);
          }
          catch (error) {
              errors.throwError('invalid address', errors.INVALID_ARGUMENT, {
                  arg: this.localName,
                  coderType: 'address',
                  value: value
              });
          }
          return result;
      };
      CoderAddress.prototype.decode = function (data, offset) {
          if (data.length < offset + 32) {
              errors.throwError('insufficuent data for address type', errors.INVALID_ARGUMENT, {
                  arg: this.localName,
                  coderType: 'address',
                  value: bytes_1.hexlify(data.slice(offset, offset + 32))
              });
          }
          return {
              consumed: 32,
              value: this.coerceFunc('address', address_1.getAddress(bytes_1.hexlify(data.slice(offset + 12, offset + 32))))
          };
      };
      return CoderAddress;
  }(Coder));
  function _encodeDynamicBytes(value) {
      var dataLength = 32 * Math.ceil(value.length / 32);
      var padding = new Uint8Array(dataLength - value.length);
      return bytes_1.concat([
          uint256Coder.encode(value.length),
          value,
          padding
      ]);
  }
  function _decodeDynamicBytes(data, offset, localName) {
      if (data.length < offset + 32) {
          errors.throwError('insufficient data for dynamicBytes length', errors.INVALID_ARGUMENT, {
              arg: localName,
              coderType: 'dynamicBytes',
              value: bytes_1.hexlify(data.slice(offset, offset + 32))
          });
      }
      var length = uint256Coder.decode(data, offset).value;
      try {
          length = length.toNumber();
      }
      catch (error) {
          errors.throwError('dynamic bytes count too large', errors.INVALID_ARGUMENT, {
              arg: localName,
              coderType: 'dynamicBytes',
              value: length.toString()
          });
      }
      if (data.length < offset + 32 + length) {
          errors.throwError('insufficient data for dynamicBytes type', errors.INVALID_ARGUMENT, {
              arg: localName,
              coderType: 'dynamicBytes',
              value: bytes_1.hexlify(data.slice(offset, offset + 32 + length))
          });
      }
      return {
          consumed: 32 + 32 * Math.ceil(length / 32),
          value: data.slice(offset + 32, offset + 32 + length),
      };
  }
  var CoderDynamicBytes = /** @class */ (function (_super) {
      __extends(CoderDynamicBytes, _super);
      function CoderDynamicBytes(coerceFunc, localName) {
          return _super.call(this, coerceFunc, 'bytes', 'bytes', localName, true) || this;
      }
      CoderDynamicBytes.prototype.encode = function (value) {
          try {
              return _encodeDynamicBytes(bytes_1.arrayify(value));
          }
          catch (error) {
              errors.throwError('invalid bytes value', errors.INVALID_ARGUMENT, {
                  arg: this.localName,
                  coderType: 'bytes',
                  value: error.value
              });
          }
          return null;
      };
      CoderDynamicBytes.prototype.decode = function (data, offset) {
          var result = _decodeDynamicBytes(data, offset, this.localName);
          result.value = this.coerceFunc('bytes', bytes_1.hexlify(result.value));
          return result;
      };
      return CoderDynamicBytes;
  }(Coder));
  var CoderString = /** @class */ (function (_super) {
      __extends(CoderString, _super);
      function CoderString(coerceFunc, localName) {
          return _super.call(this, coerceFunc, 'string', 'string', localName, true) || this;
      }
      CoderString.prototype.encode = function (value) {
          if (typeof (value) !== 'string') {
              errors.throwError('invalid string value', errors.INVALID_ARGUMENT, {
                  arg: this.localName,
                  coderType: 'string',
                  value: value
              });
          }
          return _encodeDynamicBytes(utf8_1.toUtf8Bytes(value));
      };
      CoderString.prototype.decode = function (data, offset) {
          var result = _decodeDynamicBytes(data, offset, this.localName);
          result.value = this.coerceFunc('string', utf8_1.toUtf8String(result.value));
          return result;
      };
      return CoderString;
  }(Coder));
  function alignSize(size) {
      return 32 * Math.ceil(size / 32);
  }
  function pack(coders, values) {
      if (Array.isArray(values)) {
          // do nothing
      }
      else if (values && typeof (values) === 'object') {
          var arrayValues = [];
          coders.forEach(function (coder) {
              arrayValues.push(values[coder.localName]);
          });
          values = arrayValues;
      }
      else {
          errors.throwError('invalid tuple value', errors.INVALID_ARGUMENT, {
              coderType: 'tuple',
              value: values
          });
      }
      if (coders.length !== values.length) {
          errors.throwError('types/value length mismatch', errors.INVALID_ARGUMENT, {
              coderType: 'tuple',
              value: values
          });
      }
      var parts = [];
      coders.forEach(function (coder, index) {
          parts.push({ dynamic: coder.dynamic, value: coder.encode(values[index]) });
      });
      var staticSize = 0, dynamicSize = 0;
      parts.forEach(function (part) {
          if (part.dynamic) {
              staticSize += 32;
              dynamicSize += alignSize(part.value.length);
          }
          else {
              staticSize += alignSize(part.value.length);
          }
      });
      var offset = 0, dynamicOffset = staticSize;
      var data = new Uint8Array(staticSize + dynamicSize);
      parts.forEach(function (part) {
          if (part.dynamic) {
              //uint256Coder.encode(dynamicOffset).copy(data, offset);
              data.set(uint256Coder.encode(dynamicOffset), offset);
              offset += 32;
              //part.value.copy(data, dynamicOffset);  @TODO
              data.set(part.value, dynamicOffset);
              dynamicOffset += alignSize(part.value.length);
          }
          else {
              //part.value.copy(data, offset);  @TODO
              data.set(part.value, offset);
              offset += alignSize(part.value.length);
          }
      });
      return data;
  }
  function unpack(coders, data, offset) {
      var baseOffset = offset;
      var consumed = 0;
      var value = [];
      coders.forEach(function (coder) {
          if (coder.dynamic) {
              var dynamicOffset = uint256Coder.decode(data, offset);
              var result = coder.decode(data, baseOffset + dynamicOffset.value.toNumber());
              // The dynamic part is leap-frogged somewhere else; doesn't count towards size
              result.consumed = dynamicOffset.consumed;
          }
          else {
              var result = coder.decode(data, offset);
          }
          if (result.value != undefined) {
              value.push(result.value);
          }
          offset += result.consumed;
          consumed += result.consumed;
      });
      coders.forEach(function (coder, index) {
          var name = coder.localName;
          if (!name) {
              return;
          }
          if (name === 'length') {
              name = '_length';
          }
          if (value[name] != null) {
              return;
          }
          value[name] = value[index];
      });
      return {
          value: value,
          consumed: consumed
      };
  }
  var CoderArray = /** @class */ (function (_super) {
      __extends(CoderArray, _super);
      function CoderArray(coerceFunc, coder, length, localName) {
          var _this = this;
          var type = (coder.type + '[' + (length >= 0 ? length : '') + ']');
          var dynamic = (length === -1 || coder.dynamic);
          _this = _super.call(this, coerceFunc, 'array', type, localName, dynamic) || this;
          _this.coder = coder;
          _this.length = length;
          return _this;
      }
      CoderArray.prototype.encode = function (value) {
          if (!Array.isArray(value)) {
              errors.throwError('expected array value', errors.INVALID_ARGUMENT, {
                  arg: this.localName,
                  coderType: 'array',
                  value: value
              });
          }
          var count = this.length;
          var result = new Uint8Array(0);
          if (count === -1) {
              count = value.length;
              result = uint256Coder.encode(count);
          }
          errors.checkArgumentCount(count, value.length, 'in coder array' + (this.localName ? (" " + this.localName) : ""));
          var coders = [];
          for (var i = 0; i < value.length; i++) {
              coders.push(this.coder);
          }
          return bytes_1.concat([result, pack(coders, value)]);
      };
      CoderArray.prototype.decode = function (data, offset) {
          // @TODO:
          //if (data.length < offset + length * 32) { throw new Error('invalid array'); }
          var consumed = 0;
          var count = this.length;
          if (count === -1) {
              try {
                  var decodedLength = uint256Coder.decode(data, offset);
              }
              catch (error) {
                  errors.throwError('insufficient data for dynamic array length', errors.INVALID_ARGUMENT, {
                      arg: this.localName,
                      coderType: 'array',
                      value: error.value
                  });
              }
              try {
                  count = decodedLength.value.toNumber();
              }
              catch (error) {
                  errors.throwError('array count too large', errors.INVALID_ARGUMENT, {
                      arg: this.localName,
                      coderType: 'array',
                      value: decodedLength.value.toString()
                  });
              }
              consumed += decodedLength.consumed;
              offset += decodedLength.consumed;
          }
          var coders = [];
          for (var i = 0; i < count; i++) {
              coders.push(new CoderAnonymous(this.coder));
          }
          var result = unpack(coders, data, offset);
          result.consumed += consumed;
          result.value = this.coerceFunc(this.type, result.value);
          return result;
      };
      return CoderArray;
  }(Coder));
  var CoderTuple = /** @class */ (function (_super) {
      __extends(CoderTuple, _super);
      function CoderTuple(coerceFunc, coders, localName) {
          var _this = this;
          var dynamic = false;
          var types = [];
          coders.forEach(function (coder) {
              if (coder.dynamic) {
                  dynamic = true;
              }
              types.push(coder.type);
          });
          var type = ('tuple(' + types.join(',') + ')');
          _this = _super.call(this, coerceFunc, 'tuple', type, localName, dynamic) || this;
          _this.coders = coders;
          return _this;
      }
      CoderTuple.prototype.encode = function (value) {
          return pack(this.coders, value);
      };
      CoderTuple.prototype.decode = function (data, offset) {
          var result = unpack(this.coders, data, offset);
          result.value = this.coerceFunc(this.type, result.value);
          return result;
      };
      return CoderTuple;
  }(Coder));
  /*
  function getTypes(coders) {
      var type = coderTuple(coders).type;
      return type.substring(6, type.length - 1);
  }
  */
  function splitNesting(value) {
      var result = [];
      var accum = '';
      var depth = 0;
      for (var offset = 0; offset < value.length; offset++) {
          var c = value[offset];
          if (c === ',' && depth === 0) {
              result.push(accum);
              accum = '';
          }
          else {
              accum += c;
              if (c === '(') {
                  depth++;
              }
              else if (c === ')') {
                  depth--;
                  if (depth === -1) {
                      throw new Error('unbalanced parenthsis');
                  }
              }
          }
      }
      result.push(accum);
      return result;
  }
  // @TODO: Is there a way to return "class"?
  var paramTypeSimple = {
      address: CoderAddress,
      bool: CoderBoolean,
      string: CoderString,
      bytes: CoderDynamicBytes,
  };
  function getTupleParamCoder(coerceFunc, components, localName) {
      if (!components) {
          components = [];
      }
      var coders = [];
      components.forEach(function (component) {
          coders.push(getParamCoder(coerceFunc, component));
      });
      return new CoderTuple(coerceFunc, coders, localName);
  }
  function getParamCoder(coerceFunc, param) {
      var coder = paramTypeSimple[param.type];
      if (coder) {
          return new coder(coerceFunc, param.name);
      }
      var match = param.type.match(paramTypeNumber);
      if (match) {
          var size = parseInt(match[2] || "256");
          if (size === 0 || size > 256 || (size % 8) !== 0) {
              errors.throwError('invalid ' + match[1] + ' bit length', errors.INVALID_ARGUMENT, {
                  arg: 'param',
                  value: param
              });
          }
          return new CoderNumber(coerceFunc, size / 8, (match[1] === 'int'), param.name);
      }
      var match = param.type.match(paramTypeBytes);
      if (match) {
          var size = parseInt(match[1]);
          if (size === 0 || size > 32) {
              errors.throwError('invalid bytes length', errors.INVALID_ARGUMENT, {
                  arg: 'param',
                  value: param
              });
          }
          return new CoderFixedBytes(coerceFunc, size, param.name);
      }
      var match = param.type.match(paramTypeArray);
      if (match) {
          var size = parseInt(match[2] || "-1");
          param = properties_1.jsonCopy(param);
          param.type = match[1];
          return new CoderArray(coerceFunc, getParamCoder(coerceFunc, param), size, param.name);
      }
      if (param.type.substring(0, 5) === 'tuple') {
          return getTupleParamCoder(coerceFunc, param.components, param.name);
      }
      if (param.type === '') {
          return new CoderNull(coerceFunc, param.name);
      }
      errors.throwError('invalid type', errors.INVALID_ARGUMENT, {
          arg: 'type',
          value: param.type
      });
      return null;
  }
  var AbiCoder = /** @class */ (function () {
      function AbiCoder(coerceFunc) {
          errors.checkNew(this, AbiCoder);
          if (!coerceFunc) {
              coerceFunc = exports.defaultCoerceFunc;
          }
          properties_1.defineReadOnly(this, 'coerceFunc', coerceFunc);
      }
      AbiCoder.prototype.encode = function (types, values) {
          if (types.length !== values.length) {
              errors.throwError('types/values length mismatch', errors.INVALID_ARGUMENT, {
                  count: { types: types.length, values: values.length },
                  value: { types: types, values: values }
              });
          }
          var coders = [];
          types.forEach(function (type) {
              // Convert types to type objects
              //   - "uint foo" => { type: "uint", name: "foo" }
              //   - "tuple(uint, uint)" => { type: "tuple", components: [ { type: "uint" }, { type: "uint" }, ] }
              var typeObject = null;
              if (typeof (type) === 'string') {
                  typeObject = parseParam(type);
              }
              else {
                  typeObject = type;
              }
              coders.push(getParamCoder(this.coerceFunc, typeObject));
          }, this);
          return bytes_1.hexlify(new CoderTuple(this.coerceFunc, coders, '_').encode(values));
      };
      AbiCoder.prototype.decode = function (types, data) {
          var coders = [];
          types.forEach(function (type) {
              // See encode for details
              var typeObject = null;
              if (typeof (type) === 'string') {
                  typeObject = parseParam(type);
              }
              else {
                  typeObject = properties_1.jsonCopy(type);
              }
              coders.push(getParamCoder(this.coerceFunc, typeObject));
          }, this);
          return new CoderTuple(this.coerceFunc, coders, '_').decode(bytes_1.arrayify(data), 0).value;
      };
      return AbiCoder;
  }());
  exports.AbiCoder = AbiCoder;
  exports.defaultAbiCoder = new AbiCoder();
  
  },{"./address":57,"./bignumber":59,"./bytes":60,"./errors":61,"./properties":69,"./utf8":79}],57:[function(require,module,exports){
  'use strict';
  var __importDefault = (this && this.__importDefault) || function (mod) {
      return (mod && mod.__esModule) ? mod : { "default": mod };
  };
  Object.defineProperty(exports, "__esModule", { value: true });
  // We use this for base 36 maths
  var bn_js_1 = __importDefault(require("bn.js"));
  var bytes_1 = require("./bytes");
  var keccak256_1 = require("./keccak256");
  var rlp_1 = require("./rlp");
  var errors = require("./errors");
  function getChecksumAddress(address) {
      if (typeof (address) !== 'string' || !address.match(/^0x[0-9A-Fa-f]{40}$/)) {
          errors.throwError('invalid address', errors.INVALID_ARGUMENT, { arg: 'address', value: address });
      }
      address = address.toLowerCase();
      var chars = address.substring(2).split('');
      var hashed = new Uint8Array(40);
      for (var i_1 = 0; i_1 < 40; i_1++) {
          hashed[i_1] = chars[i_1].charCodeAt(0);
      }
      hashed = bytes_1.arrayify(keccak256_1.keccak256(hashed));
      for (var i = 0; i < 40; i += 2) {
          if ((hashed[i >> 1] >> 4) >= 8) {
              chars[i] = chars[i].toUpperCase();
          }
          if ((hashed[i >> 1] & 0x0f) >= 8) {
              chars[i + 1] = chars[i + 1].toUpperCase();
          }
      }
      return '0x' + chars.join('');
  }
  // Shims for environments that are missing some required constants and functions
  var MAX_SAFE_INTEGER = 0x1fffffffffffff;
  function log10(x) {
      if (Math.log10) {
          return Math.log10(x);
      }
      return Math.log(x) / Math.LN10;
  }
  // See: https://en.wikipedia.org/wiki/International_Bank_Account_Number
  // Create lookup table
  var ibanLookup = {};
  for (var i = 0; i < 10; i++) {
      ibanLookup[String(i)] = String(i);
  }
  for (var i = 0; i < 26; i++) {
      ibanLookup[String.fromCharCode(65 + i)] = String(10 + i);
  }
  // How many decimal digits can we process? (for 64-bit float, this is 15)
  var safeDigits = Math.floor(log10(MAX_SAFE_INTEGER));
  function ibanChecksum(address) {
      address = address.toUpperCase();
      address = address.substring(4) + address.substring(0, 2) + '00';
      var expanded = '';
      address.split('').forEach(function (c) {
          expanded += ibanLookup[c];
      });
      // Javascript can handle integers safely up to 15 (decimal) digits
      while (expanded.length >= safeDigits) {
          var block = expanded.substring(0, safeDigits);
          expanded = parseInt(block, 10) % 97 + expanded.substring(block.length);
      }
      var checksum = String(98 - (parseInt(expanded, 10) % 97));
      while (checksum.length < 2) {
          checksum = '0' + checksum;
      }
      return checksum;
  }
  ;
  function getAddress(address) {
      var result = null;
      if (typeof (address) !== 'string') {
          errors.throwError('invalid address', errors.INVALID_ARGUMENT, { arg: 'address', value: address });
      }
      if (address.match(/^(0x)?[0-9a-fA-F]{40}$/)) {
          // Missing the 0x prefix
          if (address.substring(0, 2) !== '0x') {
              address = '0x' + address;
          }
          result = getChecksumAddress(address);
          // It is a checksummed address with a bad checksum
          if (address.match(/([A-F].*[a-f])|([a-f].*[A-F])/) && result !== address) {
              errors.throwError('bad address checksum', errors.INVALID_ARGUMENT, { arg: 'address', value: address });
          }
          // Maybe ICAP? (we only support direct mode)
      }
      else if (address.match(/^XE[0-9]{2}[0-9A-Za-z]{30,31}$/)) {
          // It is an ICAP address with a bad checksum
          if (address.substring(2, 4) !== ibanChecksum(address)) {
              errors.throwError('bad icap checksum', errors.INVALID_ARGUMENT, { arg: 'address', value: address });
          }
          result = (new bn_js_1.default.BN(address.substring(4), 36)).toString(16);
          while (result.length < 40) {
              result = '0' + result;
          }
          result = getChecksumAddress('0x' + result);
      }
      else {
          errors.throwError('invalid address', errors.INVALID_ARGUMENT, { arg: 'address', value: address });
      }
      return result;
  }
  exports.getAddress = getAddress;
  function getIcapAddress(address) {
      var base36 = (new bn_js_1.default.BN(getAddress(address).substring(2), 16)).toString(36).toUpperCase();
      while (base36.length < 30) {
          base36 = '0' + base36;
      }
      return 'XE' + ibanChecksum('XE00' + base36) + base36;
  }
  exports.getIcapAddress = getIcapAddress;
  // http://ethereum.stackexchange.com/questions/760/how-is-the-address-of-an-ethereum-contract-computed
  function getContractAddress(transaction) {
      if (!transaction.from) {
          throw new Error('missing from address');
      }
      var nonce = transaction.nonce;
      return getAddress('0x' + keccak256_1.keccak256(rlp_1.encode([
          getAddress(transaction.from),
          bytes_1.stripZeros(bytes_1.hexlify(nonce))
      ])).substring(26));
  }
  exports.getContractAddress = getContractAddress;
  
  },{"./bytes":60,"./errors":61,"./keccak256":66,"./rlp":71,"bn.js":8}],58:[function(require,module,exports){
  'use strict';
  Object.defineProperty(exports, "__esModule", { value: true });
  var bytes_1 = require("../utils/bytes");
  module.exports = {
      decode: function (textData) {
          textData = atob(textData);
          var data = [];
          for (var i = 0; i < textData.length; i++) {
              data.push(textData.charCodeAt(i));
          }
          return bytes_1.arrayify(data);
      },
      encode: function (data) {
          data = bytes_1.arrayify(data);
          var textData = '';
          for (var i = 0; i < data.length; i++) {
              textData += String.fromCharCode(data[i]);
          }
          return btoa(textData);
      }
  };
  
  },{"../utils/bytes":60}],59:[function(require,module,exports){
  'use strict';
  var __extends = (this && this.__extends) || (function () {
      var extendStatics = Object.setPrototypeOf ||
          ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||
          function (d, b) { for (var p in b) if (b.hasOwnProperty(p)) d[p] = b[p]; };
      return function (d, b) {
          extendStatics(d, b);
          function __() { this.constructor = d; }
          d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());
      };
  })();
  var __importDefault = (this && this.__importDefault) || function (mod) {
      return (mod && mod.__esModule) ? mod : { "default": mod };
  };
  var __importStar = (this && this.__importStar) || function (mod) {
      if (mod && mod.__esModule) return mod;
      var result = {};
      if (mod != null) for (var k in mod) if (Object.hasOwnProperty.call(mod, k)) result[k] = mod[k];
      result["default"] = mod;
      return result;
  };
  Object.defineProperty(exports, "__esModule", { value: true });
  /**
   *  BigNumber
   *
   *  A wrapper around the BN.js object. We use the BN.js library
   *  because it is used by elliptic, so it is required regardles.
   *
   */
  var bn_js_1 = __importDefault(require("bn.js"));
  var bytes_1 = require("./bytes");
  var properties_1 = require("./properties");
  var types_1 = require("./types");
  var errors = __importStar(require("./errors"));
  var BN_1 = new bn_js_1.default.BN(-1);
  function toHex(bn) {
      var value = bn.toString(16);
      if (value[0] === '-') {
          if ((value.length % 2) === 0) {
              return '-0x0' + value.substring(1);
          }
          return "-0x" + value.substring(1);
      }
      if ((value.length % 2) === 1) {
          return '0x0' + value;
      }
      return '0x' + value;
  }
  function toBN(value) {
      return bigNumberify(value)._bn;
  }
  function toBigNumber(bn) {
      return new BigNumber(toHex(bn));
  }
  var BigNumber = /** @class */ (function (_super) {
      __extends(BigNumber, _super);
      function BigNumber(value) {
          var _this = _super.call(this) || this;
          errors.checkNew(_this, BigNumber);
          if (typeof (value) === 'string') {
              if (bytes_1.isHexString(value)) {
                  if (value == '0x') {
                      value = '0x0';
                  }
                  properties_1.defineReadOnly(_this, '_hex', value);
              }
              else if (value[0] === '-' && bytes_1.isHexString(value.substring(1))) {
                  properties_1.defineReadOnly(_this, '_hex', value);
              }
              else if (value.match(/^-?[0-9]*$/)) {
                  if (value == '') {
                      value = '0';
                  }
                  properties_1.defineReadOnly(_this, '_hex', toHex(new bn_js_1.default.BN(value)));
              }
              else {
                  errors.throwError('invalid BigNumber string value', errors.INVALID_ARGUMENT, { arg: 'value', value: value });
              }
          }
          else if (typeof (value) === 'number') {
              if (parseInt(String(value)) !== value) {
                  errors.throwError('underflow', errors.NUMERIC_FAULT, { operation: 'setValue', fault: 'underflow', value: value, outputValue: parseInt(String(value)) });
              }
              try {
                  properties_1.defineReadOnly(_this, '_hex', toHex(new bn_js_1.default.BN(value)));
              }
              catch (error) {
                  errors.throwError('overflow', errors.NUMERIC_FAULT, { operation: 'setValue', fault: 'overflow', details: error.message });
              }
          }
          else if (value instanceof BigNumber) {
              properties_1.defineReadOnly(_this, '_hex', value._hex);
          }
          else if (value.toHexString) {
              properties_1.defineReadOnly(_this, '_hex', toHex(toBN(value.toHexString())));
          }
          else if (bytes_1.isArrayish(value)) {
              properties_1.defineReadOnly(_this, '_hex', toHex(new bn_js_1.default.BN(bytes_1.hexlify(value).substring(2), 16)));
          }
          else {
              errors.throwError('invalid BigNumber value', errors.INVALID_ARGUMENT, { arg: 'value', value: value });
          }
          return _this;
      }
      Object.defineProperty(BigNumber.prototype, "_bn", {
          get: function () {
              if (this._hex[0] === '-') {
                  return (new bn_js_1.default.BN(this._hex.substring(3), 16)).mul(BN_1);
              }
              return new bn_js_1.default.BN(this._hex.substring(2), 16);
          },
          enumerable: true,
          configurable: true
      });
      BigNumber.prototype.fromTwos = function (value) {
          return toBigNumber(this._bn.fromTwos(value));
      };
      BigNumber.prototype.toTwos = function (value) {
          return toBigNumber(this._bn.toTwos(value));
      };
      BigNumber.prototype.add = function (other) {
          return toBigNumber(this._bn.add(toBN(other)));
      };
      BigNumber.prototype.sub = function (other) {
          return toBigNumber(this._bn.sub(toBN(other)));
      };
      BigNumber.prototype.div = function (other) {
          var o = bigNumberify(other);
          if (o.isZero()) {
              errors.throwError('division by zero', errors.NUMERIC_FAULT, { operation: 'divide', fault: 'division by zero' });
          }
          return toBigNumber(this._bn.div(toBN(other)));
      };
      BigNumber.prototype.mul = function (other) {
          return toBigNumber(this._bn.mul(toBN(other)));
      };
      BigNumber.prototype.mod = function (other) {
          return toBigNumber(this._bn.mod(toBN(other)));
      };
      BigNumber.prototype.pow = function (other) {
          return toBigNumber(this._bn.pow(toBN(other)));
      };
      BigNumber.prototype.maskn = function (value) {
          return toBigNumber(this._bn.maskn(value));
      };
      BigNumber.prototype.eq = function (other) {
          return this._bn.eq(toBN(other));
      };
      BigNumber.prototype.lt = function (other) {
          return this._bn.lt(toBN(other));
      };
      BigNumber.prototype.lte = function (other) {
          return this._bn.lte(toBN(other));
      };
      BigNumber.prototype.gt = function (other) {
          return this._bn.gt(toBN(other));
      };
      BigNumber.prototype.gte = function (other) {
          return this._bn.gte(toBN(other));
      };
      BigNumber.prototype.isZero = function () {
          return this._bn.isZero();
      };
      BigNumber.prototype.toNumber = function () {
          try {
              return this._bn.toNumber();
          }
          catch (error) {
              errors.throwError('overflow', errors.NUMERIC_FAULT, { operation: 'setValue', fault: 'overflow', details: error.message });
          }
          return null;
      };
      BigNumber.prototype.toString = function () {
          return this._bn.toString(10);
      };
      BigNumber.prototype.toHexString = function () {
          return this._hex;
      };
      return BigNumber;
  }(types_1.BigNumber));
  function bigNumberify(value) {
      if (value instanceof BigNumber) {
          return value;
      }
      return new BigNumber(value);
  }
  exports.bigNumberify = bigNumberify;
  exports.ConstantNegativeOne = bigNumberify(-1);
  exports.ConstantZero = bigNumberify(0);
  exports.ConstantOne = bigNumberify(1);
  exports.ConstantTwo = bigNumberify(2);
  exports.ConstantWeiPerEther = bigNumberify('1000000000000000000');
  
  },{"./bytes":60,"./errors":61,"./properties":69,"./types":77,"bn.js":8}],60:[function(require,module,exports){
  "use strict";
  /**
   *  Conversion Utilities
   *
   */
  Object.defineProperty(exports, "__esModule", { value: true });
  var types_1 = require("./types");
  var errors = require("./errors");
  exports.AddressZero = '0x0000000000000000000000000000000000000000';
  exports.HashZero = '0x0000000000000000000000000000000000000000000000000000000000000000';
  function isBigNumber(value) {
      return (value instanceof types_1.BigNumber);
  }
  function addSlice(array) {
      if (array.slice) {
          return array;
      }
      array.slice = function () {
          var args = Array.prototype.slice.call(arguments);
          return new Uint8Array(Array.prototype.slice.apply(array, args));
      };
      return array;
  }
  function isArrayish(value) {
      if (!value || parseInt(String(value.length)) != value.length || typeof (value) === 'string') {
          return false;
      }
      for (var i = 0; i < value.length; i++) {
          var v = value[i];
          if (v < 0 || v >= 256 || parseInt(String(v)) != v) {
              return false;
          }
      }
      return true;
  }
  exports.isArrayish = isArrayish;
  function arrayify(value) {
      if (value == null) {
          errors.throwError('cannot convert null value to array', errors.INVALID_ARGUMENT, { arg: 'value', value: value });
      }
      if (isBigNumber(value)) {
          value = value.toHexString();
      }
      if (typeof (value) === 'string') {
          var match = value.match(/^(0x)?[0-9a-fA-F]*$/);
          if (!match) {
              errors.throwError('invalid hexidecimal string', errors.INVALID_ARGUMENT, { arg: 'value', value: value });
          }
          if (match[1] !== '0x') {
              errors.throwError('hex string must have 0x prefix', errors.INVALID_ARGUMENT, { arg: 'value', value: value });
          }
          value = value.substring(2);
          if (value.length % 2) {
              value = '0' + value;
          }
          var result = [];
          for (var i = 0; i < value.length; i += 2) {
              result.push(parseInt(value.substr(i, 2), 16));
          }
          return addSlice(new Uint8Array(result));
      }
      else if (typeof (value) === 'string') {
      }
      if (isArrayish(value)) {
          return addSlice(new Uint8Array(value));
      }
      errors.throwError('invalid arrayify value', null, { arg: 'value', value: value, type: typeof (value) });
      return null;
  }
  exports.arrayify = arrayify;
  function concat(objects) {
      var arrays = [];
      var length = 0;
      for (var i = 0; i < objects.length; i++) {
          var object = arrayify(objects[i]);
          arrays.push(object);
          length += object.length;
      }
      var result = new Uint8Array(length);
      var offset = 0;
      for (var i = 0; i < arrays.length; i++) {
          result.set(arrays[i], offset);
          offset += arrays[i].length;
      }
      return addSlice(result);
  }
  exports.concat = concat;
  function stripZeros(value) {
      var result = arrayify(value);
      if (result.length === 0) {
          return result;
      }
      // Find the first non-zero entry
      var start = 0;
      while (result[start] === 0) {
          start++;
      }
      // If we started with zeros, strip them
      if (start) {
          result = result.slice(start);
      }
      return result;
  }
  exports.stripZeros = stripZeros;
  function padZeros(value, length) {
      value = arrayify(value);
      if (length < value.length) {
          throw new Error('cannot pad');
      }
      var result = new Uint8Array(length);
      result.set(value, length - value.length);
      return addSlice(result);
  }
  exports.padZeros = padZeros;
  function isHexString(value, length) {
      if (typeof (value) !== 'string' || !value.match(/^0x[0-9A-Fa-f]*$/)) {
          return false;
      }
      if (length && value.length !== 2 + 2 * length) {
          return false;
      }
      return true;
  }
  exports.isHexString = isHexString;
  var HexCharacters = '0123456789abcdef';
  function hexlify(value) {
      if (isBigNumber(value)) {
          return value.toHexString();
      }
      if (typeof (value) === 'number') {
          if (value < 0) {
              errors.throwError('cannot hexlify negative value', errors.INVALID_ARGUMENT, { arg: 'value', value: value });
          }
          var hex = '';
          while (value) {
              hex = HexCharacters[value & 0x0f] + hex;
              value = Math.floor(value / 16);
          }
          if (hex.length) {
              if (hex.length % 2) {
                  hex = '0' + hex;
              }
              return '0x' + hex;
          }
          return '0x00';
      }
      if (typeof (value) === 'string') {
          var match = value.match(/^(0x)?[0-9a-fA-F]*$/);
          if (!match) {
              errors.throwError('invalid hexidecimal string', errors.INVALID_ARGUMENT, { arg: 'value', value: value });
          }
          if (match[1] !== '0x') {
              errors.throwError('hex string must have 0x prefix', errors.INVALID_ARGUMENT, { arg: 'value', value: value });
          }
          if (value.length % 2) {
              value = '0x0' + value.substring(2);
          }
          return value;
      }
      if (isArrayish(value)) {
          var result = [];
          for (var i = 0; i < value.length; i++) {
              var v = value[i];
              result.push(HexCharacters[(v & 0xf0) >> 4] + HexCharacters[v & 0x0f]);
          }
          return '0x' + result.join('');
      }
      errors.throwError('invalid hexlify value', null, { arg: 'value', value: value });
      return 'never';
  }
  exports.hexlify = hexlify;
  function hexDataLength(data) {
      if (!isHexString(data) || (data.length % 2) !== 0) {
          return null;
      }
      return (data.length - 2) / 2;
  }
  exports.hexDataLength = hexDataLength;
  function hexDataSlice(data, offset, length) {
      if (!isHexString(data)) {
          errors.throwError('invalid hex data', errors.INVALID_ARGUMENT, { arg: 'value', value: data });
      }
      if ((data.length % 2) !== 0) {
          errors.throwError('hex data length must be even', errors.INVALID_ARGUMENT, { arg: 'value', value: data });
      }
      offset = 2 + 2 * offset;
      if (length != null) {
          return '0x' + data.substring(offset, offset + 2 * length);
      }
      return '0x' + data.substring(offset);
  }
  exports.hexDataSlice = hexDataSlice;
  function hexStripZeros(value) {
      if (!isHexString(value)) {
          errors.throwError('invalid hex string', errors.INVALID_ARGUMENT, { arg: 'value', value: value });
      }
      while (value.length > 3 && value.substring(0, 3) === '0x0') {
          value = '0x' + value.substring(3);
      }
      return value;
  }
  exports.hexStripZeros = hexStripZeros;
  function hexZeroPad(value, length) {
      if (!isHexString(value)) {
          errors.throwError('invalid hex string', errors.INVALID_ARGUMENT, { arg: 'value', value: value });
      }
      while (value.length < 2 * length + 2) {
          value = '0x0' + value.substring(2);
      }
      return value;
  }
  exports.hexZeroPad = hexZeroPad;
  function isSignature(value) {
      return (value && value.r != null && value.s != null);
  }
  function splitSignature(signature) {
      var v = 0;
      var r = '0x', s = '0x';
      if (isSignature(signature)) {
          if (signature.v == null && signature.recoveryParam == null) {
              errors.throwError('at least on of recoveryParam or v must be specified', errors.INVALID_ARGUMENT, { argument: 'signature', value: signature });
          }
          r = hexZeroPad(signature.r, 32);
          s = hexZeroPad(signature.s, 32);
          v = signature.v;
          if (typeof (v) === 'string') {
              v = parseInt(v, 16);
          }
          var recoveryParam = signature.recoveryParam;
          if (recoveryParam == null && signature.v != null) {
              recoveryParam = 1 - (v % 2);
          }
          v = 27 + recoveryParam;
      }
      else {
          var bytes = arrayify(signature);
          if (bytes.length !== 65) {
              throw new Error('invalid signature');
          }
          r = hexlify(bytes.slice(0, 32));
          s = hexlify(bytes.slice(32, 64));
          v = bytes[64];
          if (v !== 27 && v !== 28) {
              v = 27 + (v % 2);
          }
      }
      return {
          r: r,
          s: s,
          recoveryParam: (v - 27),
          v: v
      };
  }
  exports.splitSignature = splitSignature;
  function joinSignature(signature) {
      signature = splitSignature(signature);
      return hexlify(concat([
          signature.r,
          signature.s,
          (signature.recoveryParam ? '0x1c' : '0x1b')
      ]));
  }
  exports.joinSignature = joinSignature;
  
  },{"./errors":61,"./types":77}],61:[function(require,module,exports){
  'use strict';
  Object.defineProperty(exports, "__esModule", { value: true });
  // Unknown Error
  exports.UNKNOWN_ERROR = 'UNKNOWN_ERROR';
  // Not implemented
  exports.NOT_IMPLEMENTED = 'NOT_IMPLEMENTED';
  // Missing new operator to an object
  //  - name: The name of the class
  exports.MISSING_NEW = 'MISSING_NEW';
  // Call exception
  //  - transaction: the transaction
  //  - address?: the contract address
  //  - args?: The arguments passed into the function
  //  - method?: The Solidity method signature
  //  - errorSignature?: The EIP848 error signature
  //  - errorArgs?: The EIP848 error parameters
  //  - reason: The reason (only for EIP848 "Error(string)")
  exports.CALL_EXCEPTION = 'CALL_EXCEPTION';
  // Response from a server was invalid
  //   - response: The body of the response
  //'BAD_RESPONSE',
  // Invalid argument (e.g. value is incompatible with type) to a function:
  //   - arg: The argument name that was invalid
  //   - value: The value of the argument
  exports.INVALID_ARGUMENT = 'INVALID_ARGUMENT';
  // Missing argument to a function:
  //   - count: The number of arguments received
  //   - expectedCount: The number of arguments expected
  exports.MISSING_ARGUMENT = 'MISSING_ARGUMENT';
  // Too many arguments
  //   - count: The number of arguments received
  //   - expectedCount: The number of arguments expected
  exports.UNEXPECTED_ARGUMENT = 'UNEXPECTED_ARGUMENT';
  // Numeric Fault
  //   - operation: the operation being executed
  //   - fault: the reason this faulted
  exports.NUMERIC_FAULT = 'NUMERIC_FAULT';
  // Unsupported operation
  //   - operation
  exports.UNSUPPORTED_OPERATION = 'UNSUPPORTED_OPERATION';
  var _permanentCensorErrors = false;
  var _censorErrors = false;
  // @TODO: Enum
  function throwError(message, code, params) {
      if (_censorErrors) {
          throw new Error('unknown error');
      }
      if (!code) {
          code = exports.UNKNOWN_ERROR;
      }
      if (!params) {
          params = {};
      }
      var messageDetails = [];
      Object.keys(params).forEach(function (key) {
          try {
              messageDetails.push(key + '=' + JSON.stringify(params[key]));
          }
          catch (error) {
              messageDetails.push(key + '=' + JSON.stringify(params[key].toString()));
          }
      });
      var reason = message;
      if (messageDetails.length) {
          message += ' (' + messageDetails.join(', ') + ')';
      }
      // @TODO: Any??
      var error = new Error(message);
      error.reason = reason;
      error.code = code;
      Object.keys(params).forEach(function (key) {
          error[key] = params[key];
      });
      throw error;
  }
  exports.throwError = throwError;
  function checkNew(self, kind) {
      if (!(self instanceof kind)) {
          throwError('missing new', exports.MISSING_NEW, { name: kind.name });
      }
  }
  exports.checkNew = checkNew;
  function checkArgumentCount(count, expectedCount, suffix) {
      if (!suffix) {
          suffix = '';
      }
      if (count < expectedCount) {
          throwError('missing argument' + suffix, exports.MISSING_ARGUMENT, { count: count, expectedCount: expectedCount });
      }
      if (count > expectedCount) {
          throwError('too many arguments' + suffix, exports.UNEXPECTED_ARGUMENT, { count: count, expectedCount: expectedCount });
      }
  }
  exports.checkArgumentCount = checkArgumentCount;
  function setCensorship(censorship, permanent) {
      if (_permanentCensorErrors) {
          throwError('error censorship permanent', exports.UNSUPPORTED_OPERATION, { operation: 'setCersorship' });
      }
      _censorErrors = !!censorship;
      _permanentCensorErrors = !!permanent;
  }
  exports.setCensorship = setCensorship;
  
  },{}],62:[function(require,module,exports){
  'use strict';
  Object.defineProperty(exports, "__esModule", { value: true });
  var bytes_1 = require("./bytes");
  var utf8_1 = require("./utf8");
  var keccak256_1 = require("./keccak256");
  var Zeros = new Uint8Array([0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]);
  var Partition = new RegExp("^((.*)\\.)?([^.]+)$");
  var UseSTD3ASCIIRules = new RegExp("^[a-z0-9.-]*$");
  function namehash(name) {
      name = name.toLowerCase();
      // Supporting the full UTF-8 space requires additional (and large)
      // libraries, so for now we simply do not support them.
      // It should be fairly easy in the future to support systems with
      // String.normalize, but that is future work.
      if (!name.match(UseSTD3ASCIIRules)) {
          throw new Error('contains invalid UseSTD3ASCIIRules characters');
      }
      var result = Zeros;
      while (name.length) {
          var partition = name.match(Partition);
          var label = utf8_1.toUtf8Bytes(partition[3]);
          result = keccak256_1.keccak256(bytes_1.concat([result, keccak256_1.keccak256(label)]));
          name = partition[2] || '';
      }
      return bytes_1.hexlify(result);
  }
  exports.namehash = namehash;
  function id(text) {
      return keccak256_1.keccak256(utf8_1.toUtf8Bytes(text));
  }
  exports.id = id;
  function hashMessage(message) {
      var payload = bytes_1.concat([
          utf8_1.toUtf8Bytes('\x19Ethereum Signed Message:\n'),
          utf8_1.toUtf8Bytes(String(message.length)),
          ((typeof (message) === 'string') ? utf8_1.toUtf8Bytes(message) : message)
      ]);
      return keccak256_1.keccak256(payload);
  }
  exports.hashMessage = hashMessage;
  
  },{"./bytes":60,"./keccak256":66,"./utf8":79}],63:[function(require,module,exports){
  "use strict";
  var __importStar = (this && this.__importStar) || function (mod) {
      if (mod && mod.__esModule) return mod;
      var result = {};
      if (mod != null) for (var k in mod) if (Object.hasOwnProperty.call(mod, k)) result[k] = mod[k];
      result["default"] = mod;
      return result;
  };
  Object.defineProperty(exports, "__esModule", { value: true });
  var hash = __importStar(require("hash.js"));
  var bytes_1 = require("../utils/bytes");
  var errors = __importStar(require("../utils/errors"));
  var supportedAlgorithms = { sha256: true, sha512: true };
  function computeHmac(algorithm, key, data) {
      if (!supportedAlgorithms[algorithm]) {
          errors.throwError('unsupported algorithm ' + algorithm, errors.UNSUPPORTED_OPERATION, { operation: 'hmac', algorithm: algorithm });
      }
      return bytes_1.arrayify(hash.hmac(hash[algorithm], bytes_1.arrayify(key)).update(bytes_1.arrayify(data)).digest());
  }
  exports.computeHmac = computeHmac;
  
  },{"../utils/bytes":60,"../utils/errors":61,"hash.js":26}],64:[function(require,module,exports){
  'use strict';
  var __importStar = (this && this.__importStar) || function (mod) {
      if (mod && mod.__esModule) return mod;
      var result = {};
      if (mod != null) for (var k in mod) if (Object.hasOwnProperty.call(mod, k)) result[k] = mod[k];
      result["default"] = mod;
      return result;
  };
  Object.defineProperty(exports, "__esModule", { value: true });
  // This is SUPER useful, but adds 140kb (even zipped, adds 40kb)
  //var unorm = require('unorm');
  var address_1 = require("./address");
  exports.getAddress = address_1.getAddress;
  exports.getContractAddress = address_1.getContractAddress;
  exports.getIcapAddress = address_1.getIcapAddress;
  var abi_coder_1 = require("./abi-coder");
  exports.AbiCoder = abi_coder_1.AbiCoder;
  exports.defaultAbiCoder = abi_coder_1.defaultAbiCoder;
  exports.formatSignature = abi_coder_1.formatSignature;
  exports.formatParamType = abi_coder_1.formatParamType;
  exports.parseSignature = abi_coder_1.parseSignature;
  exports.parseParamType = abi_coder_1.parseParamType;
  var base64 = __importStar(require("./base64"));
  exports.base64 = base64;
  var bignumber_1 = require("./bignumber");
  exports.bigNumberify = bignumber_1.bigNumberify;
  var bytes_1 = require("./bytes");
  exports.arrayify = bytes_1.arrayify;
  exports.concat = bytes_1.concat;
  exports.hexDataSlice = bytes_1.hexDataSlice;
  exports.hexDataLength = bytes_1.hexDataLength;
  exports.hexlify = bytes_1.hexlify;
  exports.hexStripZeros = bytes_1.hexStripZeros;
  exports.hexZeroPad = bytes_1.hexZeroPad;
  exports.joinSignature = bytes_1.joinSignature;
  exports.padZeros = bytes_1.padZeros;
  exports.splitSignature = bytes_1.splitSignature;
  exports.stripZeros = bytes_1.stripZeros;
  var hash_1 = require("./hash");
  exports.hashMessage = hash_1.hashMessage;
  exports.id = hash_1.id;
  exports.namehash = hash_1.namehash;
  var json_wallet_1 = require("./json-wallet");
  exports.getJsonWalletAddress = json_wallet_1.getJsonWalletAddress;
  var keccak256_1 = require("./keccak256");
  exports.keccak256 = keccak256_1.keccak256;
  var sha2_1 = require("./sha2");
  exports.sha256 = sha2_1.sha256;
  var solidity_1 = require("./solidity");
  exports.solidityKeccak256 = solidity_1.keccak256;
  exports.solidityPack = solidity_1.pack;
  exports.soliditySha256 = solidity_1.sha256;
  var random_bytes_1 = require("./random-bytes");
  exports.randomBytes = random_bytes_1.randomBytes;
  var networks_1 = require("./networks");
  exports.getNetwork = networks_1.getNetwork;
  var properties_1 = require("./properties");
  exports.defineFrozen = properties_1.defineFrozen;
  exports.defineReadOnly = properties_1.defineReadOnly;
  exports.resolveProperties = properties_1.resolveProperties;
  exports.shallowCopy = properties_1.shallowCopy;
  var RLP = __importStar(require("./rlp"));
  exports.RLP = RLP;
  var secp256k1_1 = require("./secp256k1");
  exports.computePublicKey = secp256k1_1.computePublicKey;
  exports.verifyMessage = secp256k1_1.verifyMessage;
  var transaction_1 = require("./transaction");
  exports.parseTransaction = transaction_1.parse;
  exports.serializeTransaction = transaction_1.serialize;
  var utf8_1 = require("./utf8");
  exports.toUtf8Bytes = utf8_1.toUtf8Bytes;
  exports.toUtf8String = utf8_1.toUtf8String;
  var units_1 = require("./units");
  exports.formatEther = units_1.formatEther;
  exports.parseEther = units_1.parseEther;
  exports.formatUnits = units_1.formatUnits;
  exports.parseUnits = units_1.parseUnits;
  var web_1 = require("./web");
  exports.fetchJson = web_1.fetchJson;
  var types = __importStar(require("./types"));
  exports.types = types;
  var errors = __importStar(require("./errors"));
  exports.errors = errors;
  // NFKD (decomposed)
  //const etherSymbol = '\uD835\uDF63';
  // NFKC (composed)
  var etherSymbol = '\u039e';
  exports.etherSymbol = etherSymbol;
  var constants = {
      AddressZero: bytes_1.AddressZero,
      HashZero: bytes_1.HashZero,
      NegativeOne: bignumber_1.ConstantNegativeOne,
      Zero: bignumber_1.ConstantZero,
      One: bignumber_1.ConstantOne,
      Two: bignumber_1.ConstantTwo,
      WeiPerEther: bignumber_1.ConstantWeiPerEther
  };
  exports.constants = constants;
  
  },{"./abi-coder":56,"./address":57,"./base64":58,"./bignumber":59,"./bytes":60,"./errors":61,"./hash":62,"./json-wallet":65,"./keccak256":66,"./networks":67,"./properties":69,"./random-bytes":70,"./rlp":71,"./secp256k1":72,"./sha2":73,"./solidity":75,"./transaction":76,"./types":77,"./units":78,"./utf8":79,"./web":80}],65:[function(require,module,exports){
  "use strict";
  Object.defineProperty(exports, "__esModule", { value: true });
  var address_1 = require("./address");
  function isCrowdsaleWallet(json) {
      try {
          var data = JSON.parse(json);
      }
      catch (error) {
          return false;
      }
      return (data.encseed && data.ethaddr);
  }
  exports.isCrowdsaleWallet = isCrowdsaleWallet;
  function isSecretStorageWallet(json) {
      try {
          var data = JSON.parse(json);
      }
      catch (error) {
          return false;
      }
      if (!data.version || parseInt(data.version) !== data.version || parseInt(data.version) !== 3) {
          return false;
      }
      // @TODO: Put more checks to make sure it has kdf, iv and all that good stuff
      return true;
  }
  exports.isSecretStorageWallet = isSecretStorageWallet;
  //export function isJsonWallet(json: string): boolean {
  //    return (isSecretStorageWallet(json) || isCrowdsaleWallet(json));
  //}
  function getJsonWalletAddress(json) {
      if (isCrowdsaleWallet(json)) {
          try {
              return address_1.getAddress(JSON.parse(json).ethaddr);
          }
          catch (error) {
              return null;
          }
      }
      if (isSecretStorageWallet(json)) {
          try {
              return address_1.getAddress(JSON.parse(json).address);
          }
          catch (error) {
              return null;
          }
      }
      return null;
  }
  exports.getJsonWalletAddress = getJsonWalletAddress;
  
  },{"./address":57}],66:[function(require,module,exports){
  'use strict';
  Object.defineProperty(exports, "__esModule", { value: true });
  var sha3 = require("js-sha3");
  var bytes_1 = require("./bytes");
  function keccak256(data) {
      return '0x' + sha3.keccak_256(bytes_1.arrayify(data));
  }
  exports.keccak256 = keccak256;
  
  },{"./bytes":60,"js-sha3":39}],67:[function(require,module,exports){
  'use strict';
  var __importStar = (this && this.__importStar) || function (mod) {
      if (mod && mod.__esModule) return mod;
      var result = {};
      if (mod != null) for (var k in mod) if (Object.hasOwnProperty.call(mod, k)) result[k] = mod[k];
      result["default"] = mod;
      return result;
  };
  Object.defineProperty(exports, "__esModule", { value: true });
  var errors = __importStar(require("../utils/errors"));
  var homestead = {
      chainId: 1,
      ensAddress: "0x314159265dd8dbb310642f98f50c066173c1259b",
      name: "homestead"
  };
  var ropsten = {
      chainId: 3,
      ensAddress: "0x112234455c3a32fd11230c42e7bccd4a84e02010",
      name: "ropsten"
  };
  var networks = {
      unspecified: {
          chainId: 0
      },
      homestead: homestead,
      mainnet: homestead,
      morden: {
          chainId: 2
      },
      ropsten: ropsten,
      testnet: ropsten,
      rinkeby: {
          chainId: 4,
          ensAddress: "0xe7410170f87102DF0055eB195163A03B7F2Bff4A"
      },
      kovan: {
          chainId: 42
      },
      classic: {
          chainId: 61
      }
  };
  /**
   *  getNetwork
   *
   *  Converts a named common networks or chain ID (network ID) to a Network
   *  and verifies a network is a valid Network..
   */
  function getNetwork(network) {
      // No network (null) or unspecified (chainId = 0)
      if (!network) {
          return null;
      }
      if (typeof (network) === 'number') {
          for (var name in networks) {
              var n_1 = networks[name];
              if (n_1.chainId === network) {
                  return {
                      name: name,
                      chainId: n_1.chainId,
                      ensAddress: n_1.ensAddress
                  };
              }
          }
          return {
              chainId: network,
              name: 'unknown'
          };
      }
      if (typeof (network) === 'string') {
          var n_2 = networks[network];
          if (n_2 == null) {
              return null;
          }
          return {
              name: network,
              chainId: n_2.chainId,
              ensAddress: n_2.ensAddress
          };
      }
      var n = networks[network.name];
      // Not a standard network; check that it is a valid network in general
      if (!n) {
          if (typeof (n.chainId) !== 'number') {
              errors.throwError('invalid network chainId', errors.INVALID_ARGUMENT, { arg: 'network', value: network });
          }
          return network;
      }
      // Make sure the chainId matches the expected network chainId (or is 0; disable EIP-155)
      if (network.chainId !== 0 && network.chainId !== n.chainId) {
          errors.throwError('network chainId mismatch', errors.INVALID_ARGUMENT, { arg: 'network', value: network });
      }
      // Standard Network
      return {
          name: network.name,
          chainId: n.chainId,
          ensAddress: n.ensAddress
      };
  }
  exports.getNetwork = getNetwork;
  
  },{"../utils/errors":61}],68:[function(require,module,exports){
  'use strict';
  Object.defineProperty(exports, "__esModule", { value: true });
  var bytes_1 = require("../utils/bytes");
  var hmac_1 = require("./hmac");
  function pbkdf2(password, salt, iterations, keylen, hashAlgorithm) {
      password = bytes_1.arrayify(password);
      salt = bytes_1.arrayify(salt);
      var hLen;
      var l = 1;
      var DK = new Uint8Array(keylen);
      var block1 = new Uint8Array(salt.length + 4);
      block1.set(salt);
      //salt.copy(block1, 0, 0, salt.length)
      var r;
      var T;
      for (var i = 1; i <= l; i++) {
          //block1.writeUInt32BE(i, salt.length)
          block1[salt.length] = (i >> 24) & 0xff;
          block1[salt.length + 1] = (i >> 16) & 0xff;
          block1[salt.length + 2] = (i >> 8) & 0xff;
          block1[salt.length + 3] = i & 0xff;
          //var U = createHmac(password).update(block1).digest();
          var U = hmac_1.computeHmac(hashAlgorithm, password, block1);
          if (!hLen) {
              hLen = U.length;
              T = new Uint8Array(hLen);
              l = Math.ceil(keylen / hLen);
              r = keylen - (l - 1) * hLen;
          }
          //U.copy(T, 0, 0, hLen)
          T.set(U);
          for (var j = 1; j < iterations; j++) {
              //U = createHmac(password).update(U).digest();
              U = hmac_1.computeHmac(hashAlgorithm, password, U);
              for (var k = 0; k < hLen; k++)
                  T[k] ^= U[k];
          }
          var destPos = (i - 1) * hLen;
          var len = (i === l ? r : hLen);
          //T.copy(DK, destPos, 0, len)
          DK.set(bytes_1.arrayify(T).slice(0, len), destPos);
      }
      return bytes_1.arrayify(DK);
  }
  exports.pbkdf2 = pbkdf2;
  
  },{"../utils/bytes":60,"./hmac":63}],69:[function(require,module,exports){
  'use strict';
  Object.defineProperty(exports, "__esModule", { value: true });
  function defineReadOnly(object, name, value) {
      Object.defineProperty(object, name, {
          enumerable: true,
          value: value,
          writable: false,
      });
  }
  exports.defineReadOnly = defineReadOnly;
  function defineFrozen(object, name, value) {
      var frozen = JSON.stringify(value);
      Object.defineProperty(object, name, {
          enumerable: true,
          get: function () { return JSON.parse(frozen); }
      });
  }
  exports.defineFrozen = defineFrozen;
  function resolveProperties(object) {
      var result = {};
      var promises = [];
      Object.keys(object).forEach(function (key) {
          var value = object[key];
          if (value instanceof Promise) {
              promises.push(value.then(function (value) {
                  result[key] = value;
                  return null;
              }));
          }
          else {
              result[key] = value;
          }
      });
      return Promise.all(promises).then(function () {
          return result;
      });
  }
  exports.resolveProperties = resolveProperties;
  function shallowCopy(object) {
      var result = {};
      for (var key in object) {
          result[key] = object[key];
      }
      return result;
  }
  exports.shallowCopy = shallowCopy;
  function jsonCopy(object) {
      return JSON.parse(JSON.stringify(object));
  }
  exports.jsonCopy = jsonCopy;
  
  },{}],70:[function(require,module,exports){
  (function (global){
  'use strict';
  Object.defineProperty(exports, "__esModule", { value: true });
  var bytes_1 = require("../utils/bytes");
  var properties_1 = require("../utils/properties");
  var crypto = global.crypto || global.msCrypto;
  if (!crypto || !crypto.getRandomValues) {
      console.log('WARNING: Missing strong random number source; using weak randomBytes');
      crypto = {
          getRandomValues: function (buffer) {
              for (var round = 0; round < 20; round++) {
                  for (var i = 0; i < buffer.length; i++) {
                      if (round) {
                          buffer[i] ^= Math.trunc(256 * Math.random());
                      }
                      else {
                          buffer[i] = Math.trunc(256 * Math.random());
                      }
                  }
              }
              return buffer;
          },
          _weakCrypto: true
      };
  }
  function randomBytes(length) {
      if (length <= 0 || length > 1024 || parseInt(String(length)) != length) {
          throw new Error('invalid length');
      }
      var result = new Uint8Array(length);
      crypto.getRandomValues(result);
      return bytes_1.arrayify(result);
  }
  exports.randomBytes = randomBytes;
  ;
  if (crypto._weakCrypto === true) {
      properties_1.defineReadOnly(randomBytes, '_weakCrypto', true);
  }
  
  }).call(this,typeof global !== "undefined" ? global : typeof self !== "undefined" ? self : typeof window !== "undefined" ? window : {})
  },{"../utils/bytes":60,"../utils/properties":69}],71:[function(require,module,exports){
  "use strict";
  //See: https://github.com/ethereum/wiki/wiki/RLP
  Object.defineProperty(exports, "__esModule", { value: true });
  var bytes_1 = require("./bytes");
  function arrayifyInteger(value) {
      var result = [];
      while (value) {
          result.unshift(value & 0xff);
          value >>= 8;
      }
      return result;
  }
  function unarrayifyInteger(data, offset, length) {
      var result = 0;
      for (var i = 0; i < length; i++) {
          result = (result * 256) + data[offset + i];
      }
      return result;
  }
  function _encode(object) {
      if (Array.isArray(object)) {
          var payload = [];
          object.forEach(function (child) {
              payload = payload.concat(_encode(child));
          });
          if (payload.length <= 55) {
              payload.unshift(0xc0 + payload.length);
              return payload;
          }
          var length = arrayifyInteger(payload.length);
          length.unshift(0xf7 + length.length);
          return length.concat(payload);
      }
      var data = Array.prototype.slice.call(bytes_1.arrayify(object));
      if (data.length === 1 && data[0] <= 0x7f) {
          return data;
      }
      else if (data.length <= 55) {
          data.unshift(0x80 + data.length);
          return data;
      }
      var length = arrayifyInteger(data.length);
      length.unshift(0xb7 + length.length);
      return length.concat(data);
  }
  function encode(object) {
      return bytes_1.hexlify(_encode(object));
  }
  exports.encode = encode;
  function _decodeChildren(data, offset, childOffset, length) {
      var result = [];
      while (childOffset < offset + 1 + length) {
          var decoded = _decode(data, childOffset);
          result.push(decoded.result);
          childOffset += decoded.consumed;
          if (childOffset > offset + 1 + length) {
              throw new Error('invalid rlp');
          }
      }
      return { consumed: (1 + length), result: result };
  }
  // returns { consumed: number, result: Object }
  function _decode(data, offset) {
      if (data.length === 0) {
          throw new Error('invalid rlp data');
      }
      // Array with extra length prefix
      if (data[offset] >= 0xf8) {
          var lengthLength = data[offset] - 0xf7;
          if (offset + 1 + lengthLength > data.length) {
              throw new Error('too short');
          }
          var length = unarrayifyInteger(data, offset + 1, lengthLength);
          if (offset + 1 + lengthLength + length > data.length) {
              throw new Error('to short');
          }
          return _decodeChildren(data, offset, offset + 1 + lengthLength, lengthLength + length);
      }
      else if (data[offset] >= 0xc0) {
          var length = data[offset] - 0xc0;
          if (offset + 1 + length > data.length) {
              throw new Error('invalid rlp data');
          }
          return _decodeChildren(data, offset, offset + 1, length);
      }
      else if (data[offset] >= 0xb8) {
          var lengthLength = data[offset] - 0xb7;
          if (offset + 1 + lengthLength > data.length) {
              throw new Error('invalid rlp data');
          }
          var length = unarrayifyInteger(data, offset + 1, lengthLength);
          if (offset + 1 + lengthLength + length > data.length) {
              throw new Error('invalid rlp data');
          }
          var result = bytes_1.hexlify(data.slice(offset + 1 + lengthLength, offset + 1 + lengthLength + length));
          return { consumed: (1 + lengthLength + length), result: result };
      }
      else if (data[offset] >= 0x80) {
          var length = data[offset] - 0x80;
          if (offset + 1 + length > data.length) {
              throw new Error('invlaid rlp data');
          }
          var result = bytes_1.hexlify(data.slice(offset + 1, offset + 1 + length));
          return { consumed: (1 + length), result: result };
      }
      return { consumed: 1, result: bytes_1.hexlify(data[offset]) };
  }
  function decode(data) {
      var bytes = bytes_1.arrayify(data);
      var decoded = _decode(bytes, 0);
      if (decoded.consumed !== bytes.length) {
          throw new Error('invalid rlp data');
      }
      return decoded.result;
  }
  exports.decode = decode;
  
  },{"./bytes":60}],72:[function(require,module,exports){
  'use strict';
  var __importStar = (this && this.__importStar) || function (mod) {
      if (mod && mod.__esModule) return mod;
      var result = {};
      if (mod != null) for (var k in mod) if (Object.hasOwnProperty.call(mod, k)) result[k] = mod[k];
      result["default"] = mod;
      return result;
  };
  Object.defineProperty(exports, "__esModule", { value: true });
  var address_1 = require("./address");
  var bytes_1 = require("./bytes");
  var hash_1 = require("./hash");
  var keccak256_1 = require("./keccak256");
  var properties_1 = require("./properties");
  var errors = __importStar(require("./errors"));
  var _curve = null;
  function getCurve() {
      if (!_curve) {
          _curve = new elliptic_1.ec('secp256k1');
      }
      return _curve;
  }
  var KeyPair = /** @class */ (function () {
      function KeyPair(privateKey) {
          var keyPair = getCurve().keyFromPrivate(bytes_1.arrayify(privateKey));
          properties_1.defineReadOnly(this, 'privateKey', bytes_1.hexlify(keyPair.priv.toArray('be', 32)));
          properties_1.defineReadOnly(this, 'publicKey', '0x' + keyPair.getPublic(false, 'hex'));
          properties_1.defineReadOnly(this, 'compressedPublicKey', '0x' + keyPair.getPublic(true, 'hex'));
          properties_1.defineReadOnly(this, 'publicKeyBytes', keyPair.getPublic().encode(null, true));
      }
      KeyPair.prototype.sign = function (digest) {
          var keyPair = getCurve().keyFromPrivate(bytes_1.arrayify(this.privateKey));
          var signature = keyPair.sign(bytes_1.arrayify(digest), { canonical: true });
          return {
              recoveryParam: signature.recoveryParam,
              r: bytes_1.hexZeroPad('0x' + signature.r.toString(16), 32),
              s: bytes_1.hexZeroPad('0x' + signature.s.toString(16), 32),
              v: 27 + signature.recoveryParam
          };
      };
      return KeyPair;
  }());
  exports.KeyPair = KeyPair;
  function recoverPublicKey(digest, signature) {
      var sig = {
          r: bytes_1.arrayify(signature.r),
          s: bytes_1.arrayify(signature.s)
      };
      return '0x' + getCurve().recoverPubKey(bytes_1.arrayify(digest), sig, signature.recoveryParam).encode('hex', false);
  }
  exports.recoverPublicKey = recoverPublicKey;
  function computePublicKey(key, compressed) {
      var bytes = bytes_1.arrayify(key);
      if (bytes.length === 32) {
          var keyPair = new KeyPair(bytes);
          if (compressed) {
              return keyPair.compressedPublicKey;
          }
          return keyPair.publicKey;
      }
      else if (bytes.length === 33) {
          if (compressed) {
              return bytes_1.hexlify(bytes);
          }
          return '0x' + getCurve().keyFromPublic(bytes).getPublic(false, 'hex');
      }
      else if (bytes.length === 65) {
          if (!compressed) {
              return bytes_1.hexlify(bytes);
          }
          return '0x' + getCurve().keyFromPublic(bytes).getPublic(true, 'hex');
      }
      errors.throwError('invalid public or private key', errors.INVALID_ARGUMENT, { arg: 'key', value: '[REDACTED]' });
      return null;
  }
  exports.computePublicKey = computePublicKey;
  function recoverAddress(digest, signature) {
      return computeAddress(recoverPublicKey(digest, signature));
  }
  exports.recoverAddress = recoverAddress;
  function computeAddress(key) {
      // Strip off the leading "0x04"
      var publicKey = '0x' + computePublicKey(key).slice(4);
      return address_1.getAddress('0x' + keccak256_1.keccak256(publicKey).substring(26));
  }
  exports.computeAddress = computeAddress;
  function verifyMessage(message, signature) {
      var sig = bytes_1.splitSignature(signature);
      var digest = hash_1.hashMessage(message);
      return recoverAddress(digest, {
          r: sig.r,
          s: sig.s,
          recoveryParam: sig.recoveryParam
      });
  }
  exports.verifyMessage = verifyMessage;
  // !!! IMPORTANT !!!
  //
  // This must be be at the end, otherwise Browserify attempts to include upstream
  // dependencies before this module is loaded.
  var elliptic_1 = require("elliptic");
  
  },{"./address":57,"./bytes":60,"./errors":61,"./hash":62,"./keccak256":66,"./properties":69,"elliptic":11}],73:[function(require,module,exports){
  'use strict';
  var __importDefault = (this && this.__importDefault) || function (mod) {
      return (mod && mod.__esModule) ? mod : { "default": mod };
  };
  Object.defineProperty(exports, "__esModule", { value: true });
  var hash_js_1 = __importDefault(require("hash.js"));
  var bytes_1 = require("./bytes");
  function sha256(data) {
      return '0x' + (hash_js_1.default.sha256().update(bytes_1.arrayify(data)).digest('hex'));
  }
  exports.sha256 = sha256;
  function sha512(data) {
      return '0x' + (hash_js_1.default.sha512().update(bytes_1.arrayify(data)).digest('hex'));
  }
  exports.sha512 = sha512;
  
  },{"./bytes":60,"hash.js":26}],74:[function(require,module,exports){
  "use strict";
  Object.defineProperty(exports, "__esModule", { value: true });
  require('setimmediate');
  exports.platform = "browser";
  
  },{"setimmediate":43}],75:[function(require,module,exports){
  'use strict';
  Object.defineProperty(exports, "__esModule", { value: true });
  var bignumber_1 = require("./bignumber");
  var bytes_1 = require("./bytes");
  var utf8_1 = require("./utf8");
  var keccak256_1 = require("./keccak256");
  var sha2_1 = require("./sha2");
  var regexBytes = new RegExp("^bytes([0-9]+)$");
  var regexNumber = new RegExp("^(u?int)([0-9]*)$");
  var regexArray = new RegExp("^(.*)\\[([0-9]*)\\]$");
  var Zeros = '0000000000000000000000000000000000000000000000000000000000000000';
  function _pack(type, value, isArray) {
      switch (type) {
          case 'address':
              if (isArray) {
                  return bytes_1.padZeros(value, 32);
              }
              return bytes_1.arrayify(value);
          case 'string':
              return utf8_1.toUtf8Bytes(value);
          case 'bytes':
              return bytes_1.arrayify(value);
          case 'bool':
              value = (value ? '0x01' : '0x00');
              if (isArray) {
                  return bytes_1.padZeros(value, 32);
              }
              return bytes_1.arrayify(value);
      }
      var match = type.match(regexNumber);
      if (match) {
          //var signed = (match[1] === 'int')
          var size = parseInt(match[2] || "256");
          if ((size % 8 != 0) || size === 0 || size > 256) {
              throw new Error('invalid number type - ' + type);
          }
          if (isArray) {
              size = 256;
          }
          value = bignumber_1.bigNumberify(value).toTwos(size);
          return bytes_1.padZeros(value, size / 8);
      }
      match = type.match(regexBytes);
      if (match) {
          var size = parseInt(match[1]);
          if (String(size) != match[1] || size === 0 || size > 32) {
              throw new Error('invalid number type - ' + type);
          }
          if (bytes_1.arrayify(value).byteLength !== size) {
              throw new Error('invalid value for ' + type);
          }
          if (isArray) {
              return bytes_1.arrayify((value + Zeros).substring(0, 66));
          }
          return value;
      }
      match = type.match(regexArray);
      if (match && Array.isArray(value)) {
          var baseType = match[1];
          var count = parseInt(match[2] || String(value.length));
          if (count != value.length) {
              throw new Error('invalid value for ' + type);
          }
          var result = [];
          value.forEach(function (value) {
              result.push(_pack(baseType, value, true));
          });
          return bytes_1.concat(result);
      }
      throw new Error('unknown type - ' + type);
  }
  // @TODO: Array Enum
  function pack(types, values) {
      if (types.length != values.length) {
          throw new Error('type/value count mismatch');
      }
      var tight = [];
      types.forEach(function (type, index) {
          tight.push(_pack(type, values[index]));
      });
      return bytes_1.hexlify(bytes_1.concat(tight));
  }
  exports.pack = pack;
  function keccak256(types, values) {
      return keccak256_1.keccak256(pack(types, values));
  }
  exports.keccak256 = keccak256;
  function sha256(types, values) {
      return sha2_1.sha256(pack(types, values));
  }
  exports.sha256 = sha256;
  
  },{"./bignumber":59,"./bytes":60,"./keccak256":66,"./sha2":73,"./utf8":79}],76:[function(require,module,exports){
  "use strict";
  var __importStar = (this && this.__importStar) || function (mod) {
      if (mod && mod.__esModule) return mod;
      var result = {};
      if (mod != null) for (var k in mod) if (Object.hasOwnProperty.call(mod, k)) result[k] = mod[k];
      result["default"] = mod;
      return result;
  };
  Object.defineProperty(exports, "__esModule", { value: true });
  var address_1 = require("./address");
  var bignumber_1 = require("./bignumber");
  var bytes_1 = require("./bytes");
  var keccak256_1 = require("./keccak256");
  var RLP = __importStar(require("./rlp"));
  var errors = __importStar(require("./errors"));
  /* !!!!!!!!!!!!!!!!!!!!!!!! IMPORTANT !!!!!!!!!!!!!!!!!!!!!!!
   *
   *  Due to a weird ordering-issue with browserify, there is an
   *  import for secp256k1 at the bottom of the file; it must be
   *  required AFTER the parse and serialize exports have been
   *  defined.
   *
   */
  function handleAddress(value) {
      if (value === '0x') {
          return null;
      }
      return address_1.getAddress(value);
  }
  function handleNumber(value) {
      if (value === '0x') {
          return bignumber_1.ConstantZero;
      }
      return bignumber_1.bigNumberify(value);
  }
  var transactionFields = [
      { name: 'nonce', maxLength: 32 },
      { name: 'gasPrice', maxLength: 32 },
      { name: 'gasLimit', maxLength: 32 },
      { name: 'to', length: 20 },
      { name: 'value', maxLength: 32 },
      { name: 'data' },
  ];
  function serialize(transaction, signature) {
      var raw = [];
      transactionFields.forEach(function (fieldInfo) {
          var value = transaction[fieldInfo.name] || ([]);
          value = bytes_1.arrayify(bytes_1.hexlify(value));
          // Fixed-width field
          if (fieldInfo.length && value.length !== fieldInfo.length && value.length > 0) {
              errors.throwError('invalid length for ' + fieldInfo.name, errors.INVALID_ARGUMENT, { arg: ('transaction' + fieldInfo.name), value: value });
          }
          // Variable-width (with a maximum)
          if (fieldInfo.maxLength) {
              value = bytes_1.stripZeros(value);
              if (value.length > fieldInfo.maxLength) {
                  errors.throwError('invalid length for ' + fieldInfo.name, errors.INVALID_ARGUMENT, { arg: ('transaction' + fieldInfo.name), value: value });
              }
          }
          raw.push(bytes_1.hexlify(value));
      });
      if (transaction.chainId != null && transaction.chainId !== 0) {
          raw.push(bytes_1.hexlify(transaction.chainId));
          raw.push('0x');
          raw.push('0x');
      }
      var unsignedTransaction = RLP.encode(raw);
      // Requesting an unsigned transation
      if (!signature) {
          return unsignedTransaction;
      }
      // The splitSignature will ensure the transaction has a recoveryParam in the
      // case that the signTransaction function only adds a v.
      signature = bytes_1.splitSignature(signature);
      // We pushed a chainId and null r, s on for hashing only; remove those
      var v = 27 + signature.recoveryParam;
      if (raw.length === 9) {
          raw.pop();
          raw.pop();
          raw.pop();
          v += transaction.chainId * 2 + 8;
      }
      raw.push(bytes_1.hexlify(v));
      raw.push(bytes_1.stripZeros(bytes_1.arrayify(signature.r)));
      raw.push(bytes_1.stripZeros(bytes_1.arrayify(signature.s)));
      return RLP.encode(raw);
  }
  exports.serialize = serialize;
  function parse(rawTransaction) {
      var transaction = RLP.decode(rawTransaction);
      if (transaction.length !== 9 && transaction.length !== 6) {
          errors.throwError('invalid raw transaction', errors.INVALID_ARGUMENT, { arg: 'rawTransactin', value: rawTransaction });
      }
      var tx = {
          nonce: handleNumber(transaction[0]).toNumber(),
          gasPrice: handleNumber(transaction[1]),
          gasLimit: handleNumber(transaction[2]),
          to: handleAddress(transaction[3]),
          value: handleNumber(transaction[4]),
          data: transaction[5],
          chainId: 0
      };
      // Legacy unsigned transaction
      if (transaction.length === 6) {
          return tx;
      }
      try {
          tx.v = bignumber_1.bigNumberify(transaction[6]).toNumber();
      }
      catch (error) {
          console.log(error);
          return tx;
      }
      tx.r = bytes_1.hexZeroPad(transaction[7], 32);
      tx.s = bytes_1.hexZeroPad(transaction[8], 32);
      if (bignumber_1.bigNumberify(tx.r).isZero() && bignumber_1.bigNumberify(tx.s).isZero()) {
          // EIP-155 unsigned transaction
          tx.chainId = tx.v;
          tx.v = 0;
      }
      else {
          // Signed Tranasaction
          tx.chainId = Math.floor((tx.v - 35) / 2);
          if (tx.chainId < 0) {
              tx.chainId = 0;
          }
          var recoveryParam = tx.v - 27;
          var raw = transaction.slice(0, 6);
          if (tx.chainId !== 0) {
              raw.push(bytes_1.hexlify(tx.chainId));
              raw.push('0x');
              raw.push('0x');
              recoveryParam -= tx.chainId * 2 + 8;
          }
          var digest = keccak256_1.keccak256(RLP.encode(raw));
          try {
              tx.from = secp256k1_1.recoverAddress(digest, { r: bytes_1.hexlify(tx.r), s: bytes_1.hexlify(tx.s), recoveryParam: recoveryParam });
          }
          catch (error) {
              console.log(error);
          }
          tx.hash = keccak256_1.keccak256(rawTransaction);
      }
      return tx;
  }
  exports.parse = parse;
  // !!! IMPORTANT !!!
  //
  // This must be be at the end, otherwise Browserify attempts to include upstream
  // dependencies before this module is loaded.
  var secp256k1_1 = require("./secp256k1");
  
  },{"./address":57,"./bignumber":59,"./bytes":60,"./errors":61,"./keccak256":66,"./rlp":71,"./secp256k1":72}],77:[function(require,module,exports){
  "use strict";
  ///////////////////////////////
  // Bytes
  Object.defineProperty(exports, "__esModule", { value: true });
  ///////////////////////////////
  // BigNumber
  var BigNumber = /** @class */ (function () {
      function BigNumber() {
      }
      return BigNumber;
  }());
  exports.BigNumber = BigNumber;
  ;
  ;
  ;
  ///////////////////////////////
  // Interface
  var Indexed = /** @class */ (function () {
      function Indexed() {
      }
      return Indexed;
  }());
  exports.Indexed = Indexed;
  /**
   *  Provider
   *
   *  Note: We use an abstract class so we can use instanceof to determine if an
   *        object is a Provider.
   */
  var MinimalProvider = /** @class */ (function () {
      function MinimalProvider() {
      }
      return MinimalProvider;
  }());
  exports.MinimalProvider = MinimalProvider;
  /**
   *  Signer
   *
   *  Note: We use an abstract class so we can use instanceof to determine if an
   *        object is a Signer.
   */
  var Signer = /** @class */ (function () {
      function Signer() {
      }
      return Signer;
  }());
  exports.Signer = Signer;
  ///////////////////////////////
  // HDNode
  var HDNode = /** @class */ (function () {
      function HDNode() {
      }
      return HDNode;
  }());
  exports.HDNode = HDNode;
  
  },{}],78:[function(require,module,exports){
  'use strict';
  var __importStar = (this && this.__importStar) || function (mod) {
      if (mod && mod.__esModule) return mod;
      var result = {};
      if (mod != null) for (var k in mod) if (Object.hasOwnProperty.call(mod, k)) result[k] = mod[k];
      result["default"] = mod;
      return result;
  };
  Object.defineProperty(exports, "__esModule", { value: true });
  var bignumber_1 = require("./bignumber");
  var errors = __importStar(require("./errors"));
  var names = [
      'wei',
      'kwei',
      'Mwei',
      'Gwei',
      'szabo',
      'finny',
      'ether',
  ];
  var unitInfos = {};
  function _getUnitInfo(value) {
      return {
          decimals: value.length - 1,
          tenPower: bignumber_1.bigNumberify(value)
      };
  }
  // Build cache of common units
  (function () {
      // Cache the common units
      var value = '1';
      names.forEach(function (name) {
          var info = _getUnitInfo(value);
          unitInfos[name.toLowerCase()] = info;
          unitInfos[String(info.decimals)] = info;
          value += '000';
      });
  })();
  function getUnitInfo(name) {
      // Try the cache
      var info = unitInfos[String(name).toLowerCase()];
      if (!info && typeof (name) === 'number' && parseInt(String(name)) == name && name >= 0 && name <= 256) {
          var value = '1';
          for (var i = 0; i < name; i++) {
              value += '0';
          }
          info = _getUnitInfo(value);
      }
      // Make sure we got something
      if (!info) {
          errors.throwError('invalid unitType', errors.INVALID_ARGUMENT, { arg: 'name', value: name });
      }
      return info;
  }
  function formatUnits(value, unitType, options) {
      /*
      if (typeof(unitType) === 'object' && !options) {
          options = unitType;
          unitType = undefined;
      }
      if (unitType == null) { unitType = 18; }
      */
      if (!options) {
          options = {};
      }
      var unitInfo = getUnitInfo(unitType);
      // Make sure wei is a big number (convert as necessary)
      value = bignumber_1.bigNumberify(value);
      var negative = value.lt(bignumber_1.ConstantZero);
      if (negative) {
          value = value.mul(bignumber_1.ConstantNegativeOne);
      }
      var fraction = value.mod(unitInfo.tenPower).toString();
      while (fraction.length < unitInfo.decimals) {
          fraction = '0' + fraction;
      }
      // Strip off trailing zeros (but keep one if would otherwise be bare decimal point)
      if (!options.pad) {
          fraction = fraction.match(/^([0-9]*[1-9]|0)(0*)/)[1];
      }
      var whole = value.div(unitInfo.tenPower).toString();
      if (options.commify) {
          whole = whole.replace(/\B(?=(\d{3})+(?!\d))/g, ",");
      }
      value = whole + '.' + fraction;
      if (negative) {
          value = '-' + value;
      }
      return value;
  }
  exports.formatUnits = formatUnits;
  function parseUnits(value, unitType) {
      if (unitType == null) {
          unitType = 18;
      }
      var unitInfo = getUnitInfo(unitType);
      if (typeof (value) !== 'string' || !value.match(/^-?[0-9.,]+$/)) {
          errors.throwError('invalid decimal value', errors.INVALID_ARGUMENT, { arg: 'value', value: value });
      }
      // Remove commas
      var value = value.replace(/,/g, '');
      if (unitInfo.decimals === 0) {
          return bignumber_1.bigNumberify(value);
      }
      // Is it negative?
      var negative = (value.substring(0, 1) === '-');
      if (negative) {
          value = value.substring(1);
      }
      if (value === '.') {
          errors.throwError('missing value', errors.INVALID_ARGUMENT, { arg: 'value', value: value });
      }
      // Split it into a whole and fractional part
      var comps = value.split('.');
      if (comps.length > 2) {
          errors.throwError('too many decimal points', errors.INVALID_ARGUMENT, { arg: 'value', value: value });
      }
      var whole = comps[0], fraction = comps[1];
      if (!whole) {
          whole = '0';
      }
      if (!fraction) {
          fraction = '0';
      }
      // Prevent underflow
      if (fraction.length > unitInfo.decimals) {
          errors.throwError('underflow occurred', errors.NUMERIC_FAULT, { operation: 'division', fault: "underflow" });
      }
      // Fully pad the string with zeros to get to wei
      while (fraction.length < unitInfo.decimals) {
          fraction += '0';
      }
      var wholeValue = bignumber_1.bigNumberify(whole);
      var fractionValue = bignumber_1.bigNumberify(fraction);
      var wei = (wholeValue.mul(unitInfo.tenPower)).add(fractionValue);
      if (negative) {
          wei = wei.mul(bignumber_1.ConstantNegativeOne);
      }
      return wei;
  }
  exports.parseUnits = parseUnits;
  function formatEther(wei, options) {
      return formatUnits(wei, 18, options);
  }
  exports.formatEther = formatEther;
  function parseEther(ether) {
      return parseUnits(ether, 18);
  }
  exports.parseEther = parseEther;
  
  },{"./bignumber":59,"./errors":61}],79:[function(require,module,exports){
  'use strict';
  Object.defineProperty(exports, "__esModule", { value: true });
  var bytes_1 = require("./bytes");
  var UnicodeNormalizationForm;
  (function (UnicodeNormalizationForm) {
      UnicodeNormalizationForm["current"] = "";
      UnicodeNormalizationForm["NFC"] = "NFC";
      UnicodeNormalizationForm["NFD"] = "NFD";
      UnicodeNormalizationForm["NFKC"] = "NFKC";
      UnicodeNormalizationForm["NFKD"] = "NFKD";
  })(UnicodeNormalizationForm = exports.UnicodeNormalizationForm || (exports.UnicodeNormalizationForm = {}));
  ;
  // http://stackoverflow.com/questions/18729405/how-to-convert-utf8-string-to-byte-array
  function toUtf8Bytes(str, form) {
      if (form === void 0) { form = UnicodeNormalizationForm.current; }
      if (form != UnicodeNormalizationForm.current) {
          str = str.normalize(form);
      }
      var result = [];
      var offset = 0;
      for (var i = 0; i < str.length; i++) {
          var c = str.charCodeAt(i);
          if (c < 128) {
              result[offset++] = c;
          }
          else if (c < 2048) {
              result[offset++] = (c >> 6) | 192;
              result[offset++] = (c & 63) | 128;
          }
          else if (((c & 0xFC00) == 0xD800) && (i + 1) < str.length && ((str.charCodeAt(i + 1) & 0xFC00) == 0xDC00)) {
              // Surrogate Pair
              c = 0x10000 + ((c & 0x03FF) << 10) + (str.charCodeAt(++i) & 0x03FF);
              result[offset++] = (c >> 18) | 240;
              result[offset++] = ((c >> 12) & 63) | 128;
              result[offset++] = ((c >> 6) & 63) | 128;
              result[offset++] = (c & 63) | 128;
          }
          else {
              result[offset++] = (c >> 12) | 224;
              result[offset++] = ((c >> 6) & 63) | 128;
              result[offset++] = (c & 63) | 128;
          }
      }
      return bytes_1.arrayify(result);
  }
  exports.toUtf8Bytes = toUtf8Bytes;
  ;
  // http://stackoverflow.com/questions/13356493/decode-utf-8-with-javascript#13691499
  function toUtf8String(bytes) {
      bytes = bytes_1.arrayify(bytes);
      var result = '';
      var i = 0;
      // Invalid bytes are ignored
      while (i < bytes.length) {
          var c = bytes[i++];
          if (c >> 7 == 0) {
              // 0xxx xxxx
              result += String.fromCharCode(c);
              continue;
          }
          // Invalid starting byte
          if (c >> 6 == 0x02) {
              continue;
          }
          // Multibyte; how many bytes left for thus character?
          var extraLength = null;
          if (c >> 5 == 0x06) {
              extraLength = 1;
          }
          else if (c >> 4 == 0x0e) {
              extraLength = 2;
          }
          else if (c >> 3 == 0x1e) {
              extraLength = 3;
          }
          else if (c >> 2 == 0x3e) {
              extraLength = 4;
          }
          else if (c >> 1 == 0x7e) {
              extraLength = 5;
          }
          else {
              continue;
          }
          // Do we have enough bytes in our data?
          if (i + extraLength > bytes.length) {
              // If there is an invalid unprocessed byte, try to continue
              for (; i < bytes.length; i++) {
                  if (bytes[i] >> 6 != 0x02) {
                      break;
                  }
              }
              if (i != bytes.length)
                  continue;
              // All leftover bytes are valid.
              return result;
          }
          // Remove the UTF-8 prefix from the char (res)
          var res = c & ((1 << (8 - extraLength - 1)) - 1);
          var count;
          for (count = 0; count < extraLength; count++) {
              var nextChar = bytes[i++];
              // Is the char valid multibyte part?
              if (nextChar >> 6 != 0x02) {
                  break;
              }
              ;
              res = (res << 6) | (nextChar & 0x3f);
          }
          if (count != extraLength) {
              i--;
              continue;
          }
          if (res <= 0xffff) {
              result += String.fromCharCode(res);
              continue;
          }
          res -= 0x10000;
          result += String.fromCharCode(((res >> 10) & 0x3ff) + 0xd800, (res & 0x3ff) + 0xdc00);
      }
      return result;
  }
  exports.toUtf8String = toUtf8String;
  
  },{"./bytes":60}],80:[function(require,module,exports){
  'use strict';
  var __importStar = (this && this.__importStar) || function (mod) {
      if (mod && mod.__esModule) return mod;
      var result = {};
      if (mod != null) for (var k in mod) if (Object.hasOwnProperty.call(mod, k)) result[k] = mod[k];
      result["default"] = mod;
      return result;
  };
  Object.defineProperty(exports, "__esModule", { value: true });
  var xmlhttprequest_1 = require("xmlhttprequest");
  var base64_1 = require("./base64");
  var utf8_1 = require("./utf8");
  var errors = __importStar(require("./errors"));
  function fetchJson(connection, json, processFunc) {
      var headers = [];
      var url = null;
      if (typeof (connection) === 'string') {
          url = connection;
      }
      else if (typeof (connection) === 'object') {
          if (connection.url == null) {
              errors.throwError('missing URL', errors.MISSING_ARGUMENT, { arg: 'url' });
          }
          url = connection.url;
          if (connection.user != null && connection.password != null) {
              if (url.substring(0, 6) !== 'https:' && connection.allowInsecure !== true) {
                  errors.throwError('basic authentication requires a secure https url', errors.INVALID_ARGUMENT, { arg: 'url', url: url, user: connection.user, password: '[REDACTED]' });
              }
              var authorization = connection.user + ':' + connection.password;
              headers.push({
                  key: 'Authorization',
                  value: 'Basic ' + base64_1.encode(utf8_1.toUtf8Bytes(authorization))
              });
          }
      }
      return new Promise(function (resolve, reject) {
          var request = new xmlhttprequest_1.XMLHttpRequest();
          if (json) {
              request.open('POST', url, true);
              headers.push({ key: 'Content-Type', value: 'application/json' });
          }
          else {
              request.open('GET', url, true);
          }
          headers.forEach(function (header) {
              request.setRequestHeader(header.key, header.value);
          });
          request.onreadystatechange = function () {
              if (request.readyState !== 4) {
                  return;
              }
              try {
                  var result = JSON.parse(request.responseText);
              }
              catch (error) {
                  // @TODO: not any!
                  var jsonError = new Error('invalid json response');
                  jsonError.orginialError = error;
                  jsonError.responseText = request.responseText;
                  jsonError.url = url;
                  reject(jsonError);
                  return;
              }
              if (processFunc) {
                  try {
                      result = processFunc(result);
                  }
                  catch (error) {
                      error.url = url;
                      error.body = json;
                      error.responseText = request.responseText;
                      reject(error);
                      return;
                  }
              }
              if (request.status != 200) {
                  // @TODO: not any!
                  var error = new Error('invalid response - ' + request.status);
                  error.statusCode = request.status;
                  reject(error);
                  return;
              }
              resolve(result);
          };
          request.onerror = function (error) {
              reject(error);
          };
          try {
              if (json) {
                  request.send(json);
              }
              else {
                  request.send();
              }
          }
          catch (error) {
              // @TODO: not any!
              var connectionError = new Error('connection error');
              connectionError.error = error;
              reject(connectionError);
          }
      });
  }
  exports.fetchJson = fetchJson;
  function poll(func, options) {
      if (!options) {
          options = {};
      }
      if (options.floor == null) {
          options.floor = 0;
      }
      if (options.ceiling == null) {
          options.ceiling = 10000;
      }
      if (options.interval == null) {
          options.interval = 250;
      }
      return new Promise(function (resolve, reject) {
          var timer = null;
          var done = false;
          // Returns true if cancel was successful. Unsuccessful cancel means we're already done.
          var cancel = function () {
              if (done) {
                  return false;
              }
              done = true;
              if (timer) {
                  clearTimeout(timer);
              }
              return true;
          };
          if (options.timeout) {
              timer = setTimeout(function () {
                  if (cancel()) {
                      reject(new Error('timeout'));
                  }
              }, options.timeout);
          }
          var attempt = 0;
          function check() {
              return func().then(function (result) {
                  // If we have a result, or are allowed null then we're done
                  if (result !== undefined) {
                      if (cancel()) {
                          resolve(result);
                      }
                  }
                  else if (options.onceBlock) {
                      options.onceBlock.once('block', check);
                      // Otherwise, exponential back-off (up to 10s) our next request
                  }
                  else if (!done) {
                      attempt++;
                      var timeout = options.interval * parseInt(String(Math.random() * Math.pow(2, attempt)));
                      if (timeout < options.floor) {
                          timeout = options.floor;
                      }
                      if (timeout > options.ceiling) {
                          timeout = options.ceiling;
                      }
                      setTimeout(check, timeout);
                  }
                  return null;
              }, function (error) {
                  if (cancel()) {
                      reject(error);
                  }
              });
          }
          check();
      });
  }
  exports.poll = poll;
  
  },{"./base64":58,"./errors":61,"./utf8":79,"xmlhttprequest":47}],81:[function(require,module,exports){
  'use strict';
  var __extends = (this && this.__extends) || (function () {
      var extendStatics = Object.setPrototypeOf ||
          ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||
          function (d, b) { for (var p in b) if (b.hasOwnProperty(p)) d[p] = b[p]; };
      return function (d, b) {
          extendStatics(d, b);
          function __() { this.constructor = d; }
          d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());
      };
  })();
  var __importStar = (this && this.__importStar) || function (mod) {
      if (mod && mod.__esModule) return mod;
      var result = {};
      if (mod != null) for (var k in mod) if (Object.hasOwnProperty.call(mod, k)) result[k] = mod[k];
      result["default"] = mod;
      return result;
  };
  Object.defineProperty(exports, "__esModule", { value: true });
  // See: https://github.com/bitcoin/bips/blob/master/bip-0032.mediawiki
  // See: https://github.com/bitcoin/bips/blob/master/bip-0039.mediawiki
  // The English language word list.
  // For additional word lists, please see /src.tc/wordlists/
  var lang_en_1 = require("../wordlists/lang-en");
  // Automatically register English?
  //import { register } from '../wordlists/wordlist';
  //register(langEn);
  var bytes_1 = require("../utils/bytes");
  var bignumber_1 = require("../utils/bignumber");
  var utf8_1 = require("../utils/utf8");
  var pbkdf2_1 = require("../utils/pbkdf2");
  var hmac_1 = require("../utils/hmac");
  var properties_1 = require("../utils/properties");
  var secp256k1_1 = require("../utils/secp256k1");
  var sha2_1 = require("../utils/sha2");
  var N = bignumber_1.bigNumberify("0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141");
  var types_1 = require("../utils/types");
  var errors = __importStar(require("../utils/errors"));
  // "Bitcoin seed"
  var MasterSecret = utf8_1.toUtf8Bytes('Bitcoin seed');
  var HardenedBit = 0x80000000;
  // Returns a byte with the MSB bits set
  function getUpperMask(bits) {
      return ((1 << bits) - 1) << (8 - bits);
  }
  // Returns a byte with the LSB bits set
  function getLowerMask(bits) {
      return (1 << bits) - 1;
  }
  exports.defaultPath = "m/44'/60'/0'/0/0";
  var HDNode = /** @class */ (function (_super) {
      __extends(HDNode, _super);
      /**
       *  This constructor should not be called directly.
       *
       *  Please use:
       *   - fromMnemonic
       *   - fromSeed
       */
      function HDNode(privateKey, chainCode, index, depth, mnemonic, path) {
          var _this = _super.call(this) || this;
          errors.checkNew(_this, HDNode);
          properties_1.defineReadOnly(_this, 'keyPair', new secp256k1_1.KeyPair(privateKey));
          properties_1.defineReadOnly(_this, 'privateKey', _this.keyPair.privateKey);
          properties_1.defineReadOnly(_this, 'publicKey', _this.keyPair.compressedPublicKey);
          properties_1.defineReadOnly(_this, 'chainCode', bytes_1.hexlify(chainCode));
          properties_1.defineReadOnly(_this, 'index', index);
          properties_1.defineReadOnly(_this, 'depth', depth);
          properties_1.defineReadOnly(_this, 'mnemonic', mnemonic);
          properties_1.defineReadOnly(_this, 'path', path);
          return _this;
      }
      HDNode.prototype._derive = function (index) {
          // Public parent key -> public child key
          if (!this.privateKey) {
              if (index >= HardenedBit) {
                  throw new Error('cannot derive child of neutered node');
              }
              throw new Error('not implemented');
          }
          var data = new Uint8Array(37);
          // Base path
          var mnemonic = this.mnemonic;
          var path = this.path;
          if (path) {
              path += '/' + index;
          }
          if (index & HardenedBit) {
              // Data = 0x00 || ser_256(k_par)
              data.set(bytes_1.arrayify(this.privateKey), 1);
              // Hardened path
              if (path) {
                  path += "'";
              }
          }
          else {
              // Data = ser_p(point(k_par))
              data.set(this.keyPair.publicKeyBytes);
          }
          // Data += ser_32(i)
          for (var i = 24; i >= 0; i -= 8) {
              data[33 + (i >> 3)] = ((index >> (24 - i)) & 0xff);
          }
          var I = hmac_1.computeHmac('sha512', this.chainCode, data);
          var IL = bignumber_1.bigNumberify(I.slice(0, 32));
          var IR = I.slice(32);
          var ki = IL.add(this.keyPair.privateKey).mod(N);
          return new HDNode(bytes_1.arrayify(ki), IR, index, this.depth + 1, mnemonic, path);
      };
      HDNode.prototype.derivePath = function (path) {
          var components = path.split('/');
          if (components.length === 0 || (components[0] === 'm' && this.depth !== 0)) {
              throw new Error('invalid path');
          }
          if (components[0] === 'm') {
              components.shift();
          }
          var result = this;
          for (var i = 0; i < components.length; i++) {
              var component = components[i];
              if (component.match(/^[0-9]+'$/)) {
                  var index = parseInt(component.substring(0, component.length - 1));
                  if (index >= HardenedBit) {
                      throw new Error('invalid path index - ' + component);
                  }
                  result = result._derive(HardenedBit + index);
              }
              else if (component.match(/^[0-9]+$/)) {
                  var index = parseInt(component);
                  if (index >= HardenedBit) {
                      throw new Error('invalid path index - ' + component);
                  }
                  result = result._derive(index);
              }
              else {
                  throw new Error('invlaid path component - ' + component);
              }
          }
          return result;
      };
      return HDNode;
  }(types_1.HDNode));
  function _fromSeed(seed, mnemonic) {
      var seedArray = bytes_1.arrayify(seed);
      if (seedArray.length < 16 || seedArray.length > 64) {
          throw new Error('invalid seed');
      }
      var I = bytes_1.arrayify(hmac_1.computeHmac('sha512', MasterSecret, seedArray));
      return new HDNode(I.slice(0, 32), I.slice(32), 0, 0, mnemonic, 'm');
  }
  function fromMnemonic(mnemonic, wordlist) {
      // Check that the checksum s valid (will throw an error)
      mnemonicToEntropy(mnemonic, wordlist);
      return _fromSeed(mnemonicToSeed(mnemonic), mnemonic);
  }
  exports.fromMnemonic = fromMnemonic;
  function fromSeed(seed) {
      return _fromSeed(seed, null);
  }
  exports.fromSeed = fromSeed;
  function mnemonicToSeed(mnemonic, password) {
      if (!password) {
          password = '';
      }
      var salt = utf8_1.toUtf8Bytes('mnemonic' + password, utf8_1.UnicodeNormalizationForm.NFKD);
      return bytes_1.hexlify(pbkdf2_1.pbkdf2(utf8_1.toUtf8Bytes(mnemonic, utf8_1.UnicodeNormalizationForm.NFKD), salt, 2048, 64, 'sha512'));
  }
  exports.mnemonicToSeed = mnemonicToSeed;
  function mnemonicToEntropy(mnemonic, wordlist) {
      if (!wordlist) {
          wordlist = lang_en_1.langEn;
      }
      var words = wordlist.split(mnemonic);
      if ((words.length % 3) !== 0) {
          throw new Error('invalid mnemonic');
      }
      var entropy = bytes_1.arrayify(new Uint8Array(Math.ceil(11 * words.length / 8)));
      var offset = 0;
      for (var i = 0; i < words.length; i++) {
          var index = wordlist.getWordIndex(words[i].normalize('NFKD'));
          if (index === -1) {
              throw new Error('invalid mnemonic');
          }
          for (var bit = 0; bit < 11; bit++) {
              if (index & (1 << (10 - bit))) {
                  entropy[offset >> 3] |= (1 << (7 - (offset % 8)));
              }
              offset++;
          }
      }
      var entropyBits = 32 * words.length / 3;
      var checksumBits = words.length / 3;
      var checksumMask = getUpperMask(checksumBits);
      var checksum = bytes_1.arrayify(sha2_1.sha256(entropy.slice(0, entropyBits / 8)))[0];
      checksum &= checksumMask;
      if (checksum !== (entropy[entropy.length - 1] & checksumMask)) {
          throw new Error('invalid checksum');
      }
      return bytes_1.hexlify(entropy.slice(0, entropyBits / 8));
  }
  exports.mnemonicToEntropy = mnemonicToEntropy;
  function entropyToMnemonic(entropy, wordlist) {
      entropy = bytes_1.arrayify(entropy);
      if ((entropy.length % 4) !== 0 || entropy.length < 16 || entropy.length > 32) {
          throw new Error('invalid entropy');
      }
      var indices = [0];
      var remainingBits = 11;
      for (var i = 0; i < entropy.length; i++) {
          // Consume the whole byte (with still more to go)
          if (remainingBits > 8) {
              indices[indices.length - 1] <<= 8;
              indices[indices.length - 1] |= entropy[i];
              remainingBits -= 8;
              // This byte will complete an 11-bit index
          }
          else {
              indices[indices.length - 1] <<= remainingBits;
              indices[indices.length - 1] |= entropy[i] >> (8 - remainingBits);
              // Start the next word
              indices.push(entropy[i] & getLowerMask(8 - remainingBits));
              remainingBits += 3;
          }
      }
      // Compute the checksum bits
      var checksum = bytes_1.arrayify(sha2_1.sha256(entropy))[0];
      var checksumBits = entropy.length / 4;
      checksum &= getUpperMask(checksumBits);
      // Shift the checksum into the word indices
      indices[indices.length - 1] <<= checksumBits;
      indices[indices.length - 1] |= (checksum >> (8 - checksumBits));
      if (!wordlist) {
          wordlist = lang_en_1.langEn;
      }
      return wordlist.join(indices.map(function (index) { return wordlist.getWord(index); }));
  }
  exports.entropyToMnemonic = entropyToMnemonic;
  function isValidMnemonic(mnemonic, wordlist) {
      try {
          mnemonicToEntropy(mnemonic, wordlist);
          return true;
      }
      catch (error) { }
      return false;
  }
  exports.isValidMnemonic = isValidMnemonic;
  
  },{"../utils/bignumber":59,"../utils/bytes":60,"../utils/errors":61,"../utils/hmac":63,"../utils/pbkdf2":68,"../utils/properties":69,"../utils/secp256k1":72,"../utils/sha2":73,"../utils/types":77,"../utils/utf8":79,"../wordlists/lang-en":87}],82:[function(require,module,exports){
  'use strict';
  var __importStar = (this && this.__importStar) || function (mod) {
      if (mod && mod.__esModule) return mod;
      var result = {};
      if (mod != null) for (var k in mod) if (Object.hasOwnProperty.call(mod, k)) result[k] = mod[k];
      result["default"] = mod;
      return result;
  };
  Object.defineProperty(exports, "__esModule", { value: true });
  var wallet_1 = require("./wallet");
  exports.Wallet = wallet_1.Wallet;
  var HDNode = __importStar(require("./hdnode"));
  exports.HDNode = HDNode;
  var signing_key_1 = require("./signing-key");
  exports.SigningKey = signing_key_1.SigningKey;
  
  },{"./hdnode":81,"./signing-key":84,"./wallet":85}],83:[function(require,module,exports){
  'use strict';
  var __importDefault = (this && this.__importDefault) || function (mod) {
      return (mod && mod.__esModule) ? mod : { "default": mod };
  };
  var __importStar = (this && this.__importStar) || function (mod) {
      if (mod && mod.__esModule) return mod;
      var result = {};
      if (mod != null) for (var k in mod) if (Object.hasOwnProperty.call(mod, k)) result[k] = mod[k];
      result["default"] = mod;
      return result;
  };
  Object.defineProperty(exports, "__esModule", { value: true });
  var aes_js_1 = __importDefault(require("aes-js"));
  var scrypt_js_1 = __importDefault(require("scrypt-js"));
  var uuid_1 = __importDefault(require("uuid"));
  var signing_key_1 = require("./signing-key");
  var HDNode = __importStar(require("./hdnode"));
  var address_1 = require("../utils/address");
  var bytes_1 = require("../utils/bytes");
  var pbkdf2_1 = require("../utils/pbkdf2");
  var keccak256_1 = require("../utils/keccak256");
  var utf8_1 = require("../utils/utf8");
  var random_bytes_1 = require("../utils/random-bytes");
  function looseArrayify(hexString) {
      if (typeof (hexString) === 'string' && hexString.substring(0, 2) !== '0x') {
          hexString = '0x' + hexString;
      }
      return bytes_1.arrayify(hexString);
  }
  function zpad(value, length) {
      value = String(value);
      while (value.length < length) {
          value = '0' + value;
      }
      return value;
  }
  function getPassword(password) {
      if (typeof (password) === 'string') {
          return utf8_1.toUtf8Bytes(password, utf8_1.UnicodeNormalizationForm.NFKC);
      }
      return bytes_1.arrayify(password);
  }
  // Search an Object and its children recursively, caselessly.
  function searchPath(object, path) {
      var currentChild = object;
      var comps = path.toLowerCase().split('/');
      for (var i = 0; i < comps.length; i++) {
          // Search for a child object with a case-insensitive matching key
          var matchingChild = null;
          for (var key in currentChild) {
              if (key.toLowerCase() === comps[i]) {
                  matchingChild = currentChild[key];
                  break;
              }
          }
          // Didn't find one. :'(
          if (matchingChild === null) {
              return null;
          }
          // Now check this child...
          currentChild = matchingChild;
      }
      return currentChild;
  }
  // @TODO: Make a type for string or arrayish
  // See: https://github.com/ethereum/pyethsaletool
  function decryptCrowdsale(json, password) {
      var data = JSON.parse(json);
      password = getPassword(password);
      // Ethereum Address
      var ethaddr = address_1.getAddress(searchPath(data, 'ethaddr'));
      // Encrypted Seed
      var encseed = looseArrayify(searchPath(data, 'encseed'));
      if (!encseed || (encseed.length % 16) !== 0) {
          throw new Error('invalid encseed');
      }
      var key = pbkdf2_1.pbkdf2(password, password, 2000, 32, 'sha256').slice(0, 16);
      var iv = encseed.slice(0, 16);
      var encryptedSeed = encseed.slice(16);
      // Decrypt the seed
      var aesCbc = new aes_js_1.default.ModeOfOperation.cbc(key, iv);
      var seed = bytes_1.arrayify(aesCbc.decrypt(encryptedSeed));
      seed = aes_js_1.default.padding.pkcs7.strip(seed);
      // This wallet format is weird... Convert the binary encoded hex to a string.
      var seedHex = '';
      for (var i = 0; i < seed.length; i++) {
          seedHex += String.fromCharCode(seed[i]);
      }
      var seedHexBytes = utf8_1.toUtf8Bytes(seedHex);
      var signingKey = new signing_key_1.SigningKey(keccak256_1.keccak256(seedHexBytes));
      if (signingKey.address !== ethaddr) {
          throw new Error('corrupt crowdsale wallet');
      }
      return signingKey;
  }
  exports.decryptCrowdsale = decryptCrowdsale;
  //@TODO: string or arrayish
  function decrypt(json, password, progressCallback) {
      var data = JSON.parse(json);
      var passwordBytes = getPassword(password);
      var decrypt = function (key, ciphertext) {
          var cipher = searchPath(data, 'crypto/cipher');
          if (cipher === 'aes-128-ctr') {
              var iv = looseArrayify(searchPath(data, 'crypto/cipherparams/iv'));
              var counter = new aes_js_1.default.Counter(iv);
              var aesCtr = new aes_js_1.default.ModeOfOperation.ctr(key, counter);
              return bytes_1.arrayify(aesCtr.decrypt(ciphertext));
          }
          return null;
      };
      var computeMAC = function (derivedHalf, ciphertext) {
          return keccak256_1.keccak256(bytes_1.concat([derivedHalf, ciphertext]));
      };
      var getSigningKey = function (key, reject) {
          var ciphertext = looseArrayify(searchPath(data, 'crypto/ciphertext'));
          var computedMAC = bytes_1.hexlify(computeMAC(key.slice(16, 32), ciphertext)).substring(2);
          if (computedMAC !== searchPath(data, 'crypto/mac').toLowerCase()) {
              reject(new Error('invalid password'));
              return null;
          }
          var privateKey = decrypt(key.slice(0, 16), ciphertext);
          var mnemonicKey = key.slice(32, 64);
          if (!privateKey) {
              reject(new Error('unsupported cipher'));
              return null;
          }
          var signingKey = new signing_key_1.SigningKey(privateKey);
          if (signingKey.address !== address_1.getAddress(data.address)) {
              reject(new Error('address mismatch'));
              return null;
          }
          // Version 0.1 x-ethers metadata must contain an encrypted mnemonic phrase
          if (searchPath(data, 'x-ethers/version') === '0.1') {
              var mnemonicCiphertext = looseArrayify(searchPath(data, 'x-ethers/mnemonicCiphertext'));
              var mnemonicIv = looseArrayify(searchPath(data, 'x-ethers/mnemonicCounter'));
              var mnemonicCounter = new aes_js_1.default.Counter(mnemonicIv);
              var mnemonicAesCtr = new aes_js_1.default.ModeOfOperation.ctr(mnemonicKey, mnemonicCounter);
              var path = searchPath(data, 'x-ethers/path') || HDNode.defaultPath;
              var entropy = bytes_1.arrayify(mnemonicAesCtr.decrypt(mnemonicCiphertext));
              var mnemonic = HDNode.entropyToMnemonic(entropy);
              var node = HDNode.fromMnemonic(mnemonic).derivePath(path);
              if (node.privateKey != bytes_1.hexlify(privateKey)) {
                  reject(new Error('mnemonic mismatch'));
                  return null;
              }
              signingKey = new signing_key_1.SigningKey(node);
          }
          return signingKey;
      };
      return new Promise(function (resolve, reject) {
          var kdf = searchPath(data, 'crypto/kdf');
          if (kdf && typeof (kdf) === 'string') {
              if (kdf.toLowerCase() === 'scrypt') {
                  var salt = looseArrayify(searchPath(data, 'crypto/kdfparams/salt'));
                  var N = parseInt(searchPath(data, 'crypto/kdfparams/n'));
                  var r = parseInt(searchPath(data, 'crypto/kdfparams/r'));
                  var p = parseInt(searchPath(data, 'crypto/kdfparams/p'));
                  if (!N || !r || !p) {
                      reject(new Error('unsupported key-derivation function parameters'));
                      return;
                  }
                  // Make sure N is a power of 2
                  if ((N & (N - 1)) !== 0) {
                      reject(new Error('unsupported key-derivation function parameter value for N'));
                      return;
                  }
                  var dkLen = parseInt(searchPath(data, 'crypto/kdfparams/dklen'));
                  if (dkLen !== 32) {
                      reject(new Error('unsupported key-derivation derived-key length'));
                      return;
                  }
                  if (progressCallback) {
                      progressCallback(0);
                  }
                  scrypt_js_1.default(passwordBytes, salt, N, r, p, 64, function (error, progress, key) {
                      if (error) {
                          error.progress = progress;
                          reject(error);
                      }
                      else if (key) {
                          key = bytes_1.arrayify(key);
                          var signingKey = getSigningKey(key, reject);
                          if (!signingKey) {
                              return;
                          }
                          if (progressCallback) {
                              progressCallback(1);
                          }
                          resolve(signingKey);
                      }
                      else if (progressCallback) {
                          return progressCallback(progress);
                      }
                  });
              }
              else if (kdf.toLowerCase() === 'pbkdf2') {
                  var salt = looseArrayify(searchPath(data, 'crypto/kdfparams/salt'));
                  var prfFunc = null;
                  var prf = searchPath(data, 'crypto/kdfparams/prf');
                  if (prf === 'hmac-sha256') {
                      prfFunc = 'sha256';
                  }
                  else if (prf === 'hmac-sha512') {
                      prfFunc = 'sha512';
                  }
                  else {
                      reject(new Error('unsupported prf'));
                      return;
                  }
                  var c = parseInt(searchPath(data, 'crypto/kdfparams/c'));
                  var dkLen = parseInt(searchPath(data, 'crypto/kdfparams/dklen'));
                  if (dkLen !== 32) {
                      reject(new Error('unsupported key-derivation derived-key length'));
                      return;
                  }
                  var key = pbkdf2_1.pbkdf2(passwordBytes, salt, c, dkLen, prfFunc);
                  var signingKey = getSigningKey(key, reject);
                  if (!signingKey) {
                      return;
                  }
                  resolve(signingKey);
              }
              else {
                  reject(new Error('unsupported key-derivation function'));
              }
          }
          else {
              reject(new Error('unsupported key-derivation function'));
          }
      });
  }
  exports.decrypt = decrypt;
  function encrypt(privateKey, password, options, progressCallback) {
      // the options are optional, so adjust the call as needed
      if (typeof (options) === 'function' && !progressCallback) {
          progressCallback = options;
          options = {};
      }
      if (!options) {
          options = {};
      }
      // Check the private key
      var privateKeyBytes = null;
      if (privateKey instanceof signing_key_1.SigningKey) {
          privateKeyBytes = bytes_1.arrayify(privateKey.privateKey);
      }
      else {
          privateKeyBytes = bytes_1.arrayify(privateKey);
      }
      if (privateKeyBytes.length !== 32) {
          throw new Error('invalid private key');
      }
      var passwordBytes = getPassword(password);
      var entropy = null;
      if (options.entropy) {
          entropy = bytes_1.arrayify(options.entropy);
      }
      if (options.mnemonic) {
          if (entropy) {
              if (HDNode.entropyToMnemonic(entropy) !== options.mnemonic) {
                  throw new Error('entropy and mnemonic mismatch');
              }
          }
          else {
              entropy = bytes_1.arrayify(HDNode.mnemonicToEntropy(options.mnemonic));
          }
      }
      var path = options.path;
      if (entropy && !path) {
          path = HDNode.defaultPath;
      }
      var client = options.client;
      if (!client) {
          client = "ethers.js";
      }
      // Check/generate the salt
      var salt = null;
      if (options.salt) {
          salt = bytes_1.arrayify(options.salt);
      }
      else {
          salt = random_bytes_1.randomBytes(32);
          ;
      }
      // Override initialization vector
      var iv = null;
      if (options.iv) {
          iv = bytes_1.arrayify(options.iv);
          if (iv.length !== 16) {
              throw new Error('invalid iv');
          }
      }
      else {
          iv = random_bytes_1.randomBytes(16);
      }
      // Override the uuid
      var uuidRandom = null;
      if (options.uuid) {
          uuidRandom = bytes_1.arrayify(options.uuid);
          if (uuidRandom.length !== 16) {
              throw new Error('invalid uuid');
          }
      }
      else {
          uuidRandom = random_bytes_1.randomBytes(16);
      }
      // Override the scrypt password-based key derivation function parameters
      var N = (1 << 17), r = 8, p = 1;
      if (options.scrypt) {
          if (options.scrypt.N) {
              N = options.scrypt.N;
          }
          if (options.scrypt.r) {
              r = options.scrypt.r;
          }
          if (options.scrypt.p) {
              p = options.scrypt.p;
          }
      }
      return new Promise(function (resolve, reject) {
          if (progressCallback) {
              progressCallback(0);
          }
          // We take 64 bytes:
          //   - 32 bytes   As normal for the Web3 secret storage (derivedKey, macPrefix)
          //   - 32 bytes   AES key to encrypt mnemonic with (required here to be Ethers Wallet)
          scrypt_js_1.default(passwordBytes, salt, N, r, p, 64, function (error, progress, key) {
              if (error) {
                  error.progress = progress;
                  reject(error);
              }
              else if (key) {
                  key = bytes_1.arrayify(key);
                  // This will be used to encrypt the wallet (as per Web3 secret storage)
                  var derivedKey = key.slice(0, 16);
                  var macPrefix = key.slice(16, 32);
                  // This will be used to encrypt the mnemonic phrase (if any)
                  var mnemonicKey = key.slice(32, 64);
                  // Get the address for this private key
                  var address = (new signing_key_1.SigningKey(privateKeyBytes)).address;
                  // Encrypt the private key
                  var counter = new aes_js_1.default.Counter(iv);
                  var aesCtr = new aes_js_1.default.ModeOfOperation.ctr(derivedKey, counter);
                  var ciphertext = bytes_1.arrayify(aesCtr.encrypt(privateKeyBytes));
                  // Compute the message authentication code, used to check the password
                  var mac = keccak256_1.keccak256(bytes_1.concat([macPrefix, ciphertext]));
                  // See: https://github.com/ethereum/wiki/wiki/Web3-Secret-Storage-Definition
                  var data = {
                      address: address.substring(2).toLowerCase(),
                      id: uuid_1.default.v4({ random: uuidRandom }),
                      version: 3,
                      Crypto: {
                          cipher: 'aes-128-ctr',
                          cipherparams: {
                              iv: bytes_1.hexlify(iv).substring(2),
                          },
                          ciphertext: bytes_1.hexlify(ciphertext).substring(2),
                          kdf: 'scrypt',
                          kdfparams: {
                              salt: bytes_1.hexlify(salt).substring(2),
                              n: N,
                              dklen: 32,
                              p: p,
                              r: r
                          },
                          mac: mac.substring(2)
                      }
                  };
                  // If we have a mnemonic, encrypt it into the JSON wallet
                  if (entropy) {
                      var mnemonicIv = random_bytes_1.randomBytes(16);
                      var mnemonicCounter = new aes_js_1.default.Counter(mnemonicIv);
                      var mnemonicAesCtr = new aes_js_1.default.ModeOfOperation.ctr(mnemonicKey, mnemonicCounter);
                      var mnemonicCiphertext = bytes_1.arrayify(mnemonicAesCtr.encrypt(entropy));
                      var now = new Date();
                      var timestamp = (now.getUTCFullYear() + '-' +
                          zpad(now.getUTCMonth() + 1, 2) + '-' +
                          zpad(now.getUTCDate(), 2) + 'T' +
                          zpad(now.getUTCHours(), 2) + '-' +
                          zpad(now.getUTCMinutes(), 2) + '-' +
                          zpad(now.getUTCSeconds(), 2) + '.0Z');
                      data['x-ethers'] = {
                          client: client,
                          gethFilename: ('UTC--' + timestamp + '--' + data.address),
                          mnemonicCounter: bytes_1.hexlify(mnemonicIv).substring(2),
                          mnemonicCiphertext: bytes_1.hexlify(mnemonicCiphertext).substring(2),
                          version: "0.1"
                      };
                  }
                  if (progressCallback) {
                      progressCallback(1);
                  }
                  resolve(JSON.stringify(data));
              }
              else if (progressCallback) {
                  return progressCallback(progress);
              }
          });
      });
  }
  exports.encrypt = encrypt;
  
  },{"../utils/address":57,"../utils/bytes":60,"../utils/keccak256":66,"../utils/pbkdf2":68,"../utils/random-bytes":70,"../utils/utf8":79,"./hdnode":81,"./signing-key":84,"aes-js":7,"scrypt-js":42,"uuid":46}],84:[function(require,module,exports){
  'use strict';
  Object.defineProperty(exports, "__esModule", { value: true });
  /**
   *  SigningKey
   *
   *
   */
  var bytes_1 = require("../utils/bytes");
  var properties_1 = require("../utils/properties");
  var secp256k1_1 = require("../utils/secp256k1");
  var types_1 = require("../utils/types");
  var errors = require("../utils/errors");
  var SigningKey = /** @class */ (function () {
      function SigningKey(privateKey) {
          errors.checkNew(this, SigningKey);
          var privateKeyBytes = null;
          if (privateKey instanceof types_1.HDNode) {
              properties_1.defineReadOnly(this, 'mnemonic', privateKey.mnemonic);
              properties_1.defineReadOnly(this, 'path', privateKey.path);
              privateKeyBytes = bytes_1.arrayify(privateKey.privateKey);
          }
          else {
              // A lot of common tools do not prefix private keys with a 0x
              if (typeof (privateKey) === 'string' && privateKey.match(/^[0-9a-f]*$/i) && privateKey.length === 64) {
                  privateKey = '0x' + privateKey;
              }
              privateKeyBytes = bytes_1.arrayify(privateKey);
          }
          try {
              if (privateKeyBytes.length !== 32) {
                  errors.throwError('exactly 32 bytes required', errors.INVALID_ARGUMENT, { arg: 'privateKey', value: '[REDACTED]' });
              }
          }
          catch (error) {
              var params = { arg: 'privateKey', reason: error.reason, value: '[REDACTED]' };
              if (error.value) {
                  if (typeof (error.value.length) === 'number') {
                      params.length = error.value.length;
                  }
                  params.type = typeof (error.value);
              }
              errors.throwError('invalid private key', error.code, params);
          }
          properties_1.defineReadOnly(this, 'privateKey', bytes_1.hexlify(privateKeyBytes));
          properties_1.defineReadOnly(this, 'keyPair', new secp256k1_1.KeyPair(privateKeyBytes));
          properties_1.defineReadOnly(this, 'publicKey', this.keyPair.publicKey);
          properties_1.defineReadOnly(this, 'address', secp256k1_1.computeAddress(this.keyPair.publicKey));
      }
      SigningKey.prototype.signDigest = function (digest) {
          return this.keyPair.sign(digest);
      };
      return SigningKey;
  }());
  exports.SigningKey = SigningKey;
  
  },{"../utils/bytes":60,"../utils/errors":61,"../utils/properties":69,"../utils/secp256k1":72,"../utils/types":77}],85:[function(require,module,exports){
  'use strict';
  var __extends = (this && this.__extends) || (function () {
      var extendStatics = Object.setPrototypeOf ||
          ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||
          function (d, b) { for (var p in b) if (b.hasOwnProperty(p)) d[p] = b[p]; };
      return function (d, b) {
          extendStatics(d, b);
          function __() { this.constructor = d; }
          d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());
      };
  })();
  var __importStar = (this && this.__importStar) || function (mod) {
      if (mod && mod.__esModule) return mod;
      var result = {};
      if (mod != null) for (var k in mod) if (Object.hasOwnProperty.call(mod, k)) result[k] = mod[k];
      result["default"] = mod;
      return result;
  };
  Object.defineProperty(exports, "__esModule", { value: true });
  var hdnode_1 = require("./hdnode");
  var secretStorage = __importStar(require("./secret-storage"));
  var signing_key_1 = require("./signing-key");
  var bytes_1 = require("../utils/bytes");
  var hash_1 = require("../utils/hash");
  var json_wallet_1 = require("../utils/json-wallet");
  var keccak256_1 = require("../utils/keccak256");
  var properties_1 = require("../utils/properties");
  var random_bytes_1 = require("../utils/random-bytes");
  var transaction_1 = require("../utils/transaction");
  var types_1 = require("../utils/types");
  var errors = __importStar(require("../utils/errors"));
  var Wallet = /** @class */ (function (_super) {
      __extends(Wallet, _super);
      function Wallet(privateKey, provider) {
          var _this = _super.call(this) || this;
          errors.checkNew(_this, Wallet);
          // Make sure we have a valid signing key
          if (privateKey instanceof signing_key_1.SigningKey) {
              properties_1.defineReadOnly(_this, 'signingKey', privateKey);
          }
          else {
              properties_1.defineReadOnly(_this, 'signingKey', new signing_key_1.SigningKey(privateKey));
          }
          properties_1.defineReadOnly(_this, 'provider', provider);
          return _this;
      }
      Object.defineProperty(Wallet.prototype, "address", {
          get: function () { return this.signingKey.address; },
          enumerable: true,
          configurable: true
      });
      Object.defineProperty(Wallet.prototype, "mnemonic", {
          get: function () { return this.signingKey.mnemonic; },
          enumerable: true,
          configurable: true
      });
      Object.defineProperty(Wallet.prototype, "path", {
          get: function () { return this.signingKey.mnemonic; },
          enumerable: true,
          configurable: true
      });
      Object.defineProperty(Wallet.prototype, "privateKey", {
          get: function () { return this.signingKey.privateKey; },
          enumerable: true,
          configurable: true
      });
      /**
       *  Create a new instance of this Wallet connected to provider.
       */
      Wallet.prototype.connect = function (provider) {
          if (!(provider instanceof types_1.MinimalProvider)) {
              errors.throwError('invalid provider', errors.INVALID_ARGUMENT, { argument: 'provider', value: provider });
          }
          return new Wallet(this.signingKey, provider);
      };
      Wallet.prototype.getAddress = function () {
          return Promise.resolve(this.address);
      };
      Wallet.prototype.sign = function (transaction) {
          var _this = this;
          return properties_1.resolveProperties(transaction).then(function (tx) {
              var rawTx = transaction_1.serialize(tx);
              var signature = _this.signingKey.signDigest(keccak256_1.keccak256(rawTx));
              return Promise.resolve(transaction_1.serialize(tx, signature));
          });
      };
      Wallet.prototype.signMessage = function (message) {
          return Promise.resolve(bytes_1.joinSignature(this.signingKey.signDigest(hash_1.hashMessage(message))));
      };
      Wallet.prototype.getBalance = function (blockTag) {
          if (!this.provider) {
              throw new Error('missing provider');
          }
          return this.provider.getBalance(this.address, blockTag);
      };
      Wallet.prototype.getTransactionCount = function (blockTag) {
          if (!this.provider) {
              throw new Error('missing provider');
          }
          return this.provider.getTransactionCount(this.address, blockTag);
      };
      Wallet.prototype.sendTransaction = function (transaction) {
          if (!this.provider) {
              throw new Error('missing provider');
          }
          if (!transaction || typeof (transaction) !== 'object') {
              throw new Error('invalid transaction object');
          }
          var tx = properties_1.shallowCopy(transaction);
          if (tx.to != null) {
              tx.to = this.provider.resolveName(tx.to);
          }
          if (tx.gasLimit == null) {
              tx.from = this.getAddress();
              tx.gasLimit = this.provider.estimateGas(tx);
          }
          if (tx.gasPrice == null) {
              tx.gasPrice = this.provider.getGasPrice();
          }
          if (tx.nonce == null) {
              tx.nonce = this.getTransactionCount();
          }
          if (tx.chainId == null) {
              tx.chainId = this.provider.getNetwork().then(function (network) { return network.chainId; });
          }
          return this.provider.sendTransaction(this.sign(tx));
      };
      Wallet.prototype.encrypt = function (password, options, progressCallback) {
          if (typeof (options) === 'function' && !progressCallback) {
              progressCallback = options;
              options = {};
          }
          if (progressCallback && typeof (progressCallback) !== 'function') {
              throw new Error('invalid callback');
          }
          if (!options) {
              options = {};
          }
          if (this.mnemonic) {
              // Make sure we don't accidentally bubble the mnemonic up the call-stack
              var safeOptions = {};
              for (var key in options) {
                  safeOptions[key] = options[key];
              }
              options = safeOptions;
              // Set the mnemonic and path
              options.mnemonic = this.mnemonic;
              options.path = this.path;
          }
          return secretStorage.encrypt(this.privateKey, password, options, progressCallback);
      };
      /**
       *  Static methods to create Wallet instances.
       */
      Wallet.createRandom = function (options) {
          var entropy = random_bytes_1.randomBytes(16);
          if (!options) {
              options = {};
          }
          if (options.extraEntropy) {
              entropy = bytes_1.arrayify(keccak256_1.keccak256(bytes_1.concat([entropy, options.extraEntropy])).substring(0, 34));
          }
          var mnemonic = hdnode_1.entropyToMnemonic(entropy, options.locale);
          return Wallet.fromMnemonic(mnemonic, options.path, options.locale);
      };
      Wallet.fromEncryptedJson = function (json, password, progressCallback) {
          if (json_wallet_1.isCrowdsaleWallet(json)) {
              try {
                  if (progressCallback) {
                      progressCallback(0);
                  }
                  var privateKey = secretStorage.decryptCrowdsale(json, password);
                  if (progressCallback) {
                      progressCallback(1);
                  }
                  return Promise.resolve(new Wallet(privateKey));
              }
              catch (error) {
                  return Promise.reject(error);
              }
          }
          else if (json_wallet_1.isSecretStorageWallet(json)) {
              return secretStorage.decrypt(json, password, progressCallback).then(function (signingKey) {
                  return new Wallet(signingKey);
              });
          }
          return Promise.reject('invalid wallet JSON');
      };
      Wallet.fromMnemonic = function (mnemonic, path, wordlist) {
          if (!path) {
              path = hdnode_1.defaultPath;
          }
          return new Wallet(hdnode_1.fromMnemonic(mnemonic, wordlist).derivePath(path));
      };
      return Wallet;
  }(types_1.Signer));
  exports.Wallet = Wallet;
  
  },{"../utils/bytes":60,"../utils/errors":61,"../utils/hash":62,"../utils/json-wallet":65,"../utils/keccak256":66,"../utils/properties":69,"../utils/random-bytes":70,"../utils/transaction":76,"../utils/types":77,"./hdnode":81,"./secret-storage":83,"./signing-key":84}],86:[function(require,module,exports){
  "use strict";
  Object.defineProperty(exports, "__esModule", { value: true });
  var lang_en_1 = require("../wordlists/lang-en");
  var en = lang_en_1.langEn;
  exports.en = en;
  
  },{"../wordlists/lang-en":87}],87:[function(require,module,exports){
  'use strict';
  var __extends = (this && this.__extends) || (function () {
      var extendStatics = Object.setPrototypeOf ||
          ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||
          function (d, b) { for (var p in b) if (b.hasOwnProperty(p)) d[p] = b[p]; };
      return function (d, b) {
          extendStatics(d, b);
          function __() { this.constructor = d; }
          d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());
      };
  })();
  Object.defineProperty(exports, "__esModule", { value: true });
  var wordlist_1 = require("./wordlist");
  var words = "AbandonAbilityAbleAboutAboveAbsentAbsorbAbstractAbsurdAbuseAccessAccidentAccountAccuseAchieveAcidAcousticAcquireAcrossActActionActorActressActualAdaptAddAddictAddressAdjustAdmitAdultAdvanceAdviceAerobicAffairAffordAfraidAgainAgeAgentAgreeAheadAimAirAirportAisleAlarmAlbumAlcoholAlertAlienAllAlleyAllowAlmostAloneAlphaAlreadyAlsoAlterAlwaysAmateurAmazingAmongAmountAmusedAnalystAnchorAncientAngerAngleAngryAnimalAnkleAnnounceAnnualAnotherAnswerAntennaAntiqueAnxietyAnyApartApologyAppearAppleApproveAprilArchArcticAreaArenaArgueArmArmedArmorArmyAroundArrangeArrestArriveArrowArtArtefactArtistArtworkAskAspectAssaultAssetAssistAssumeAsthmaAthleteAtomAttackAttendAttitudeAttractAuctionAuditAugustAuntAuthorAutoAutumnAverageAvocadoAvoidAwakeAwareAwayAwesomeAwfulAwkwardAxisBabyBachelorBaconBadgeBagBalanceBalconyBallBambooBananaBannerBarBarelyBargainBarrelBaseBasicBasketBattleBeachBeanBeautyBecauseBecomeBeefBeforeBeginBehaveBehindBelieveBelowBeltBenchBenefitBestBetrayBetterBetweenBeyondBicycleBidBikeBindBiologyBirdBirthBitterBlackBladeBlameBlanketBlastBleakBlessBlindBloodBlossomBlouseBlueBlurBlushBoardBoatBodyBoilBombBoneBonusBookBoostBorderBoringBorrowBossBottomBounceBoxBoyBracketBrainBrandBrassBraveBreadBreezeBrickBridgeBriefBrightBringBriskBroccoliBrokenBronzeBroomBrotherBrownBrushBubbleBuddyBudgetBuffaloBuildBulbBulkBulletBundleBunkerBurdenBurgerBurstBusBusinessBusyButterBuyerBuzzCabbageCabinCableCactusCageCakeCallCalmCameraCampCanCanalCancelCandyCannonCanoeCanvasCanyonCapableCapitalCaptainCarCarbonCardCargoCarpetCarryCartCaseCashCasinoCastleCasualCatCatalogCatchCategoryCattleCaughtCauseCautionCaveCeilingCeleryCementCensusCenturyCerealCertainChairChalkChampionChangeChaosChapterChargeChaseChatCheapCheckCheeseChefCherryChestChickenChiefChildChimneyChoiceChooseChronicChuckleChunkChurnCigarCinnamonCircleCitizenCityCivilClaimClapClarifyClawClayCleanClerkCleverClickClientCliffClimbClinicClipClockClogCloseClothCloudClownClubClumpClusterClutchCoachCoastCoconutCodeCoffeeCoilCoinCollectColorColumnCombineComeComfortComicCommonCompanyConcertConductConfirmCongressConnectConsiderControlConvinceCookCoolCopperCopyCoralCoreCornCorrectCostCottonCouchCountryCoupleCourseCousinCoverCoyoteCrackCradleCraftCramCraneCrashCraterCrawlCrazyCreamCreditCreekCrewCricketCrimeCrispCriticCropCrossCrouchCrowdCrucialCruelCruiseCrumbleCrunchCrushCryCrystalCubeCultureCupCupboardCuriousCurrentCurtainCurveCushionCustomCuteCycleDadDamageDampDanceDangerDaringDashDaughterDawnDayDealDebateDebrisDecadeDecemberDecideDeclineDecorateDecreaseDeerDefenseDefineDefyDegreeDelayDeliverDemandDemiseDenialDentistDenyDepartDependDepositDepthDeputyDeriveDescribeDesertDesignDeskDespairDestroyDetailDetectDevelopDeviceDevoteDiagramDialDiamondDiaryDiceDieselDietDifferDigitalDignityDilemmaDinnerDinosaurDirectDirtDisagreeDiscoverDiseaseDishDismissDisorderDisplayDistanceDivertDivideDivorceDizzyDoctorDocumentDogDollDolphinDomainDonateDonkeyDonorDoorDoseDoubleDoveDraftDragonDramaDrasticDrawDreamDressDriftDrillDrinkDripDriveDropDrumDryDuckDumbDuneDuringDustDutchDutyDwarfDynamicEagerEagleEarlyEarnEarthEasilyEastEasyEchoEcologyEconomyEdgeEditEducateEffortEggEightEitherElbowElderElectricElegantElementElephantElevatorEliteElseEmbarkEmbodyEmbraceEmergeEmotionEmployEmpowerEmptyEnableEnactEndEndlessEndorseEnemyEnergyEnforceEngageEngineEnhanceEnjoyEnlistEnoughEnrichEnrollEnsureEnterEntireEntryEnvelopeEpisodeEqualEquipEraEraseErodeErosionErrorEruptEscapeEssayEssenceEstateEternalEthicsEvidenceEvilEvokeEvolveExactExampleExcessExchangeExciteExcludeExcuseExecuteExerciseExhaustExhibitExileExistExitExoticExpandExpectExpireExplainExposeExpressExtendExtraEyeEyebrowFabricFaceFacultyFadeFaintFaithFallFalseFameFamilyFamousFanFancyFantasyFarmFashionFatFatalFatherFatigueFaultFavoriteFeatureFebruaryFederalFeeFeedFeelFemaleFenceFestivalFetchFeverFewFiberFictionFieldFigureFileFilmFilterFinalFindFineFingerFinishFireFirmFirstFiscalFishFitFitnessFixFlagFlameFlashFlatFlavorFleeFlightFlipFloatFlockFloorFlowerFluidFlushFlyFoamFocusFogFoilFoldFollowFoodFootForceForestForgetForkFortuneForumForwardFossilFosterFoundFoxFragileFrameFrequentFreshFriendFringeFrogFrontFrostFrownFrozenFruitFuelFunFunnyFurnaceFuryFutureGadgetGainGalaxyGalleryGameGapGarageGarbageGardenGarlicGarmentGasGaspGateGatherGaugeGazeGeneralGeniusGenreGentleGenuineGestureGhostGiantGiftGiggleGingerGiraffeGirlGiveGladGlanceGlareGlassGlideGlimpseGlobeGloomGloryGloveGlowGlueGoatGoddessGoldGoodGooseGorillaGospelGossipGovernGownGrabGraceGrainGrantGrapeGrassGravityGreatGreenGridGriefGritGroceryGroupGrowGruntGuardGuessGuideGuiltGuitarGunGymHabitHairHalfHammerHamsterHandHappyHarborHardHarshHarvestHatHaveHawkHazardHeadHealthHeartHeavyHedgehogHeightHelloHelmetHelpHenHeroHiddenHighHillHintHipHireHistoryHobbyHockeyHoldHoleHolidayHollowHomeHoneyHoodHopeHornHorrorHorseHospitalHostHotelHourHoverHubHugeHumanHumbleHumorHundredHungryHuntHurdleHurryHurtHusbandHybridIceIconIdeaIdentifyIdleIgnoreIllIllegalIllnessImageImitateImmenseImmuneImpactImposeImproveImpulseInchIncludeIncomeIncreaseIndexIndicateIndoorIndustryInfantInflictInformInhaleInheritInitialInjectInjuryInmateInnerInnocentInputInquiryInsaneInsectInsideInspireInstallIntactInterestIntoInvestInviteInvolveIronIslandIsolateIssueItemIvoryJacketJaguarJarJazzJealousJeansJellyJewelJobJoinJokeJourneyJoyJudgeJuiceJumpJungleJuniorJunkJustKangarooKeenKeepKetchupKeyKickKidKidneyKindKingdomKissKitKitchenKiteKittenKiwiKneeKnifeKnockKnowLabLabelLaborLadderLadyLakeLampLanguageLaptopLargeLaterLatinLaughLaundryLavaLawLawnLawsuitLayerLazyLeaderLeafLearnLeaveLectureLeftLegLegalLegendLeisureLemonLendLengthLensLeopardLessonLetterLevelLiarLibertyLibraryLicenseLifeLiftLightLikeLimbLimitLinkLionLiquidListLittleLiveLizardLoadLoanLobsterLocalLockLogicLonelyLongLoopLotteryLoudLoungeLoveLoyalLuckyLuggageLumberLunarLunchLuxuryLyricsMachineMadMagicMagnetMaidMailMainMajorMakeMammalManManageMandateMangoMansionManualMapleMarbleMarchMarginMarineMarketMarriageMaskMassMasterMatchMaterialMathMatrixMatterMaximumMazeMeadowMeanMeasureMeatMechanicMedalMediaMelodyMeltMemberMemoryMentionMenuMercyMergeMeritMerryMeshMessageMetalMethodMiddleMidnightMilkMillionMimicMindMinimumMinorMinuteMiracleMirrorMiseryMissMistakeMixMixedMixtureMobileModelModifyMomMomentMonitorMonkeyMonsterMonthMoonMoralMoreMorningMosquitoMotherMotionMotorMountainMouseMoveMovieMuchMuffinMuleMultiplyMuscleMuseumMushroomMusicMustMutualMyselfMysteryMythNaiveNameNapkinNarrowNastyNationNatureNearNeckNeedNegativeNeglectNeitherNephewNerveNestNetNetworkNeutralNeverNewsNextNiceNightNobleNoiseNomineeNoodleNormalNorthNoseNotableNoteNothingNoticeNovelNowNuclearNumberNurseNutOakObeyObjectObligeObscureObserveObtainObviousOccurOceanOctoberOdorOffOfferOfficeOftenOilOkayOldOliveOlympicOmitOnceOneOnionOnlineOnlyOpenOperaOpinionOpposeOptionOrangeOrbitOrchardOrderOrdinaryOrganOrientOriginalOrphanOstrichOtherOutdoorOuterOutputOutsideOvalOvenOverOwnOwnerOxygenOysterOzonePactPaddlePagePairPalacePalmPandaPanelPanicPantherPaperParadeParentParkParrotPartyPassPatchPathPatientPatrolPatternPausePavePaymentPeacePeanutPearPeasantPelicanPenPenaltyPencilPeoplePepperPerfectPermitPersonPetPhonePhotoPhrasePhysicalPianoPicnicPicturePiecePigPigeonPillPilotPinkPioneerPipePistolPitchPizzaPlacePlanetPlasticPlatePlayPleasePledgePluckPlugPlungePoemPoetPointPolarPolePolicePondPonyPoolPopularPortionPositionPossiblePostPotatoPotteryPovertyPowderPowerPracticePraisePredictPreferPreparePresentPrettyPreventPricePridePrimaryPrintPriorityPrisonPrivatePrizeProblemProcessProduceProfitProgramProjectPromoteProofPropertyProsperProtectProudProvidePublicPuddingPullPulpPulsePumpkinPunchPupilPuppyPurchasePurityPurposePursePushPutPuzzlePyramidQualityQuantumQuarterQuestionQuickQuitQuizQuoteRabbitRaccoonRaceRackRadarRadioRailRainRaiseRallyRampRanchRandomRangeRapidRareRateRatherRavenRawRazorReadyRealReasonRebelRebuildRecallReceiveRecipeRecordRecycleReduceReflectReformRefuseRegionRegretRegularRejectRelaxReleaseReliefRelyRemainRememberRemindRemoveRenderRenewRentReopenRepairRepeatReplaceReportRequireRescueResembleResistResourceResponseResultRetireRetreatReturnReunionRevealReviewRewardRhythmRibRibbonRiceRichRideRidgeRifleRightRigidRingRiotRippleRiskRitualRivalRiverRoadRoastRobotRobustRocketRomanceRoofRookieRoomRoseRotateRoughRoundRouteRoyalRubberRudeRugRuleRunRunwayRuralSadSaddleSadnessSafeSailSaladSalmonSalonSaltSaluteSameSampleSandSatisfySatoshiSauceSausageSaveSayScaleScanScareScatterSceneSchemeSchoolScienceScissorsScorpionScoutScrapScreenScriptScrubSeaSearchSeasonSeatSecondSecretSectionSecuritySeedSeekSegmentSelectSellSeminarSeniorSenseSentenceSeriesServiceSessionSettleSetupSevenShadowShaftShallowShareShedShellSheriffShieldShiftShineShipShiverShockShoeShootShopShortShoulderShoveShrimpShrugShuffleShySiblingSickSideSiegeSightSignSilentSilkSillySilverSimilarSimpleSinceSingSirenSisterSituateSixSizeSkateSketchSkiSkillSkinSkirtSkullSlabSlamSleepSlenderSliceSlideSlightSlimSloganSlotSlowSlushSmallSmartSmileSmokeSmoothSnackSnakeSnapSniffSnowSoapSoccerSocialSockSodaSoftSolarSoldierSolidSolutionSolveSomeoneSongSoonSorrySortSoulSoundSoupSourceSouthSpaceSpareSpatialSpawnSpeakSpecialSpeedSpellSpendSphereSpiceSpiderSpikeSpinSpiritSplitSpoilSponsorSpoonSportSpotSpraySpreadSpringSpySquareSqueezeSquirrelStableStadiumStaffStageStairsStampStandStartStateStaySteakSteelStemStepStereoStickStillStingStockStomachStoneStoolStoryStoveStrategyStreetStrikeStrongStruggleStudentStuffStumbleStyleSubjectSubmitSubwaySuccessSuchSuddenSufferSugarSuggestSuitSummerSunSunnySunsetSuperSupplySupremeSureSurfaceSurgeSurpriseSurroundSurveySuspectSustainSwallowSwampSwapSwarmSwearSweetSwiftSwimSwingSwitchSwordSymbolSymptomSyrupSystemTableTackleTagTailTalentTalkTankTapeTargetTaskTasteTattooTaxiTeachTeamTellTenTenantTennisTentTermTestTextThankThatThemeThenTheoryThereTheyThingThisThoughtThreeThriveThrowThumbThunderTicketTideTigerTiltTimberTimeTinyTipTiredTissueTitleToastTobaccoTodayToddlerToeTogetherToiletTokenTomatoTomorrowToneTongueTonightToolToothTopTopicToppleTorchTornadoTortoiseTossTotalTouristTowardTowerTownToyTrackTradeTrafficTragicTrainTransferTrapTrashTravelTrayTreatTreeTrendTrialTribeTrickTriggerTrimTripTrophyTroubleTruckTrueTrulyTrumpetTrustTruthTryTubeTuitionTumbleTunaTunnelTurkeyTurnTurtleTwelveTwentyTwiceTwinTwistTwoTypeTypicalUglyUmbrellaUnableUnawareUncleUncoverUnderUndoUnfairUnfoldUnhappyUniformUniqueUnitUniverseUnknownUnlockUntilUnusualUnveilUpdateUpgradeUpholdUponUpperUpsetUrbanUrgeUsageUseUsedUsefulUselessUsualUtilityVacantVacuumVagueValidValleyValveVanVanishVaporVariousVastVaultVehicleVelvetVendorVentureVenueVerbVerifyVersionVeryVesselVeteranViableVibrantViciousVictoryVideoViewVillageVintageViolinVirtualVirusVisaVisitVisualVitalVividVocalVoiceVoidVolcanoVolumeVoteVoyageWageWagonWaitWalkWallWalnutWantWarfareWarmWarriorWashWaspWasteWaterWaveWayWealthWeaponWearWeaselWeatherWebWeddingWeekendWeirdWelcomeWestWetWhaleWhatWheatWheelWhenWhereWhipWhisperWideWidthWifeWildWillWinWindowWineWingWinkWinnerWinterWireWisdomWiseWishWitnessWolfWomanWonderWoodWoolWordWorkWorldWorryWorthWrapWreckWrestleWristWriteWrongYardYearYellowYouYoungYouthZebraZeroZoneZoo";
  var wordlist = null;
  function loadWords(lang) {
      if (wordlist != null) {
          return;
      }
      wordlist = words.replace(/([A-Z])/g, ' $1').toLowerCase().substring(1).split(' ');
      if (wordlist_1.check(lang) !== '0x3c8acc1e7b08d8e76f9fda015ef48dc8c710a73cb7e0f77b2c18a9b5a7adde60') {
          wordlist = null;
          throw new Error('BIP39 Wordlist for en (English) FAILED');
      }
  }
  var LangEn = /** @class */ (function (_super) {
      __extends(LangEn, _super);
      function LangEn() {
          return _super.call(this, 'en') || this;
      }
      LangEn.prototype.getWord = function (index) {
          loadWords(this);
          return wordlist[index];
      };
      LangEn.prototype.getWordIndex = function (word) {
          loadWords(this);
          return wordlist.indexOf(word);
      };
      return LangEn;
  }(wordlist_1.Wordlist));
  var langEn = new LangEn();
  exports.langEn = langEn;
  wordlist_1.register(langEn);
  
  },{"./wordlist":88}],88:[function(require,module,exports){
  (function (global){
  "use strict";
  Object.defineProperty(exports, "__esModule", { value: true });
  // This gets overriddenby gulp during bip39-XX
  var exportWordlist = false;
  var hash_1 = require("../utils/hash");
  var properties_1 = require("../utils/properties");
  function check(wordlist) {
      var words = [];
      for (var i = 0; i < 2048; i++) {
          var word = wordlist.getWord(i);
          if (i !== wordlist.getWordIndex(word)) {
              return '0x';
          }
          words.push(word);
      }
      return hash_1.id(words.join('\n') + '\n');
  }
  exports.check = check;
  var Wordlist = /** @class */ (function () {
      function Wordlist(locale) {
          properties_1.defineReadOnly(this, 'locale', locale);
      }
      // Subclasses may override this
      Wordlist.prototype.split = function (mnemonic) {
          return mnemonic.toLowerCase().split(/ +/g);
      };
      // Subclasses may override this
      Wordlist.prototype.join = function (words) {
          return words.join(' ');
      };
      return Wordlist;
  }());
  exports.Wordlist = Wordlist;
  function register(lang, name) {
      if (!name) {
          name = lang.locale;
      }
      if (exportWordlist) {
          var g = global;
          if (!(g.wordlists)) {
              properties_1.defineReadOnly(g, 'wordlists', {});
          }
          if (!g.wordlists[name]) {
              properties_1.defineReadOnly(g.wordlists, name, lang);
          }
          if (g.ethers && g.ethers.wordlists) {
              if (!g.ethers.wordlists[name]) {
                  properties_1.defineReadOnly(g.ethers.wordlists, name, lang);
              }
          }
      }
  }
  exports.register = register;
  
  }).call(this,typeof global !== "undefined" ? global : typeof self !== "undefined" ? self : typeof window !== "undefined" ? window : {})
  },{"../utils/hash":62,"../utils/properties":69}]},{},[6])(6)
  });
  