download file sharing

documentation technical

technology software

cryptocurrency blockchain

finance banking

English

You're looking at domain 'getlynx-paper.pages.dev' on the developer-focused generic top-level domain (.dev) and includes subdomain 'getlynx-paper'. Count 5 characters in 'pages' with two vowels and 3 consonants. Breaking it apart gives one word: pages. No strong language cues emerged from the frequency lists.

html/83/c2/83c2c836-279f-42b4-892c-4e8d895fd638.html.gz

b376e3f4758cdb1cd4d11c3851fa7ab9d1d0db2653bda04440b9da22ed4eb605

b39b20b8b7b8900821125ac9158d6e9ad4ca515ab923255a47d7c1b59f986f39

72c61475ee31d95cf8b258737571fc374a28131a77339c2f081496d0c8e30db2

f4a24d3c6a61bf1da826624cf3af0a10af3fb127e82bc59d866ae78f7c74b154

1946ec259a5147e837b39951da0a56f9f3e5aa56194d2fd0c79efcb0a16a44ec

35988adb741fb9d3d06cffdc14649a2c6d347a2703608c19a2970443c7faac1f

1a2611d4c212188090acf6d579948ca728b0d2def684e1ea31872a137a896d93

c863b0c34c2dc9398239b2241cd71f41def1915c45abce0f951fc98f16e5e172

fe6e5af0cf31e3802e1b9c931cb7fcd39661ebf2e9161c45ea5463588aed6f53

b466347b21b9db5d43bbca0291dcf1597961dc5d1c5519f09633f3546cde08a8

7365b09f21c10342c097cc23fffa9ef63e23e13d02efb9e098d9bfa3d3d812bb

ed30baafab3ed3ab0ad055e88ea31c6475bd461c21ae10de34cc1494d3bd6bdc

556e337a638e975cda9444492dff5b565cb4a8bf6ad18bb01b72a4e86cf3d9c2

46a8d0da8147d469c9b9b89ed08b722bfc511ffbd405e109e1db6459de9d17b3

157fce33fbee706d1f89d988869b808e7707b1c694039c481ae738fece49e9bd

c4cfef8f45057e176d3ddafb41151d39385c3eaa8bf850b5579946ab1ee33ae0

63e0fc2770b3edb9e891df769fe11556cb80d9be68ab373b8c2db08a3dbdf802

98a212de9d783460190da000e2cf8f086f1258eb99dcbe1a6568f1f38f7316a9

2301316884e21b85d3106bf481f14429a472ff87477de846bf16d38816638ccf

f9fe0b85794649d32d3cb34ff9d7ca1c5d15bc66724720bcbef3e908961df2b4

95a5380b988c64cf2e3e56ec98d388fbe18732d00f586c7a5d4dc0dcd791a140

13fe9927c1e5fb5b7c1020a4dcf84a2a54d8b31ec654df39391ef10aaf41a70d

fd62625a35077513d30d7bb01eeb4912338697de2356599161ee926a68d9260b

6f9ef372abbd0470e623905eddf00a445e2bdc49e917251f353f87dd153d249a

f3aedfde46f6a0dd13779db6621c61911d99f5ef3837bb894453c4ef6cceeedc

1b8f565bd6e9b528c0318b1edea36aebaeaecc9dfe77cd151d96ec4557edac32

ddc7cf18c02f7b2f3555381b863ef90eaeb869e25af321b1e9eccc12f1bed834

10f85fcb8e21b593d83c49012e3b0604fd71f7aa916f4f5a66a0cfd59340fba8

cba0a119722d5e8888db4781a78d49bf7f3520f010c92f02f6235e9604f52023

2e119b522d3b756c18a5556a06472152306e6a4a2cbfcaae97534b6a3e94cd15

1b6652b5ccbb67849026df88457245c2772c956e59f3e272a7ec1d51a5c95fb5

HSTS header missing - vulnerable to protocol downgrade attacks

CSP header missing - vulnerable to XSS attacks

Abuse Team

CloudFlare, Inc.

pages.dev

Cloudflare Abuse Contact

MNT-CLOUDFLARE

Cloudflare Technical Contact

CLOUDFLARENET-EU


      /*!
       * Crypto-JS v2.5.4	Crypto.js
       * http://code.google.com/p/crypto-js/
       * Copyright (c) 2009-2013, Jeff Mott. All rights reserved.
       * http://code.google.com/p/crypto-js/wiki/License
       */
      if (typeof Crypto == "undefined" || !Crypto.util) {
        (function () {
          var base64map =
            "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";

          // Global Crypto object
          var Crypto = (window.Crypto = {});

          // Crypto utilities
          var util = (Crypto.util = {
            // Bit-wise rotate left
            rotl: function (n, b) {
              return (n << b) | (n >>> (32 - b));
            },

            // Bit-wise rotate right
            rotr: function (n, b) {
              return (n << (32 - b)) | (n >>> b);
            },

            // Swap big-endian to little-endian and vice versa
            endian: function (n) {
              // If number given, swap endian
              if (n.constructor == Number) {
                return (
                  (util.rotl(n, 8) & 0x00ff00ff) |
                  (util.rotl(n, 24) & 0xff00ff00)
                );
              }

              // Else, assume array and swap all items
              for (var i = 0; i < n.length; i++) n[i] = util.endian(n[i]);
              return n;
            },

            // Generate an array of any length of random bytes
            randomBytes: function (n) {
              for (var bytes = []; n > 0; n--)
                bytes.push(Math.floor(Math.random() * 256));
              return bytes;
            },

            // Convert a byte array to big-endian 32-bit words
            bytesToWords: function (bytes) {
              for (var words = [], i = 0, b = 0; i < bytes.length; i++, b += 8)
                words[b >>> 5] |= (bytes[i] & 0xff) << (24 - (b % 32));
              return words;
            },

            // Convert big-endian 32-bit words to a byte array
            wordsToBytes: function (words) {
              for (var bytes = [], b = 0; b < words.length * 32; b += 8)
                bytes.push((words[b >>> 5] >>> (24 - (b % 32))) & 0xff);
              return bytes;
            },

            // Convert a byte array to a hex string
            bytesToHex: function (bytes) {
              for (var hex = [], i = 0; i < bytes.length; i++) {
                hex.push((bytes[i] >>> 4).toString(16));
                hex.push((bytes[i] & 0xf).toString(16));
              }
              return hex.join("");
            },

            // Convert a hex string to a byte array
            hexToBytes: function (hex) {
              for (var bytes = [], c = 0; c < hex.length; c += 2)
                bytes.push(parseInt(hex.substr(c, 2), 16));
              return bytes;
            },

            // Convert a byte array to a base-64 string
            bytesToBase64: function (bytes) {
              for (var base64 = [], i = 0; i < bytes.length; i += 3) {
                var triplet =
                  (bytes[i] << 16) | (bytes[i + 1] << 8) | bytes[i + 2];
                for (var j = 0; j < 4; j++) {
                  if (i * 8 + j * 6 <= bytes.length * 8)
                    base64.push(
                      base64map.charAt((triplet >>> (6 * (3 - j))) & 0x3f)
                    );
                  else base64.push("=");
                }
              }

              return base64.join("");
            },

            // Convert a base-64 string to a byte array
            base64ToBytes: function (base64) {
              // Remove non-base-64 characters
              base64 = base64.replace(/[^A-Z0-9+\/]/gi, "");

              for (
                var bytes = [], i = 0, imod4 = 0;
                i < base64.length;
                imod4 = ++i % 4
              ) {
                if (imod4 == 0) continue;
                bytes.push(
                  ((base64map.indexOf(base64.charAt(i - 1)) &
                    (Math.pow(2, -2 * imod4 + 8) - 1)) <<
                    (imod4 * 2)) |
                    (base64map.indexOf(base64.charAt(i)) >>> (6 - imod4 * 2))
                );
              }

              return bytes;
            },
          });

          // Crypto character encodings
          var charenc = (Crypto.charenc = {});

          // UTF-8 encoding
          var UTF8 = (charenc.UTF8 = {
            // Convert a string to a byte array
            stringToBytes: function (str) {
              return Binary.stringToBytes(unescape(encodeURIComponent(str)));
            },

            // Convert a byte array to a string
            bytesToString: function (bytes) {
              return decodeURIComponent(escape(Binary.bytesToString(bytes)));
            },
          });

          // Binary encoding
          var Binary = (charenc.Binary = {
            // Convert a string to a byte array
            stringToBytes: function (str) {
              for (var bytes = [], i = 0; i < str.length; i++)
                bytes.push(str.charCodeAt(i) & 0xff);
              return bytes;
            },

            // Convert a byte array to a string
            bytesToString: function (bytes) {
              for (var str = [], i = 0; i < bytes.length; i++)
                str.push(String.fromCharCode(bytes[i]));
              return str.join("");
            },
          });
        })();
      }
    


      /*!
       * Crypto-JS v2.5.4	SHA256.js
       * http://code.google.com/p/crypto-js/
       * Copyright (c) 2009-2013, Jeff Mott. All rights reserved.
       * http://code.google.com/p/crypto-js/wiki/License
       */
      (function () {
        // Shortcuts
        var C = Crypto,
          util = C.util,
          charenc = C.charenc,
          UTF8 = charenc.UTF8,
          Binary = charenc.Binary;

        // Constants
        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,
        ];

        // Public API
        var SHA256 = (C.SHA256 = function (message, options) {
          var digestbytes = util.wordsToBytes(SHA256._sha256(message));
          return options && options.asBytes
            ? digestbytes
            : options && options.asString
            ? Binary.bytesToString(digestbytes)
            : util.bytesToHex(digestbytes);
        });

        // The core
        SHA256._sha256 = function (message) {
          // Convert to byte array
          if (message.constructor == String)
            message = UTF8.stringToBytes(message);
          /* else, assume byte array already */

          var m = util.bytesToWords(message),
            l = message.length * 8,
            H = [
              0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f,
              0x9b05688c, 0x1f83d9ab, 0x5be0cd19,
            ],
            w = [],
            a,
            b,
            c,
            d,
            e,
            f,
            g,
            h,
            i,
            j,
            t1,
            t2;

          // Padding
          m[l >> 5] |= 0x80 << (24 - (l % 32));
          m[(((l + 64) >> 9) << 4) + 15] = l;

          for (var i = 0; i < m.length; i += 16) {
            a = H[0];
            b = H[1];
            c = H[2];
            d = H[3];
            e = H[4];
            f = H[5];
            g = H[6];
            h = H[7];

            for (var j = 0; j < 64; j++) {
              if (j < 16) w[j] = m[j + i];
              else {
                var gamma0x = w[j - 15],
                  gamma1x = w[j - 2],
                  gamma0 =
                    ((gamma0x << 25) | (gamma0x >>> 7)) ^
                    ((gamma0x << 14) | (gamma0x >>> 18)) ^
                    (gamma0x >>> 3),
                  gamma1 =
                    ((gamma1x << 15) | (gamma1x >>> 17)) ^
                    ((gamma1x << 13) | (gamma1x >>> 19)) ^
                    (gamma1x >>> 10);

                w[j] = gamma0 + (w[j - 7] >>> 0) + gamma1 + (w[j - 16] >>> 0);
              }

              var ch = (e & f) ^ (~e & g),
                maj = (a & b) ^ (a & c) ^ (b & c),
                sigma0 =
                  ((a << 30) | (a >>> 2)) ^
                  ((a << 19) | (a >>> 13)) ^
                  ((a << 10) | (a >>> 22)),
                sigma1 =
                  ((e << 26) | (e >>> 6)) ^
                  ((e << 21) | (e >>> 11)) ^
                  ((e << 7) | (e >>> 25));

              t1 = (h >>> 0) + sigma1 + ch + K[j] + (w[j] >>> 0);
              t2 = sigma0 + maj;

              h = g;
              g = f;
              f = e;
              e = (d + t1) >>> 0;
              d = c;
              c = b;
              b = a;
              a = (t1 + t2) >>> 0;
            }

            H[0] += a;
            H[1] += b;
            H[2] += c;
            H[3] += d;
            H[4] += e;
            H[5] += f;
            H[6] += g;
            H[7] += h;
          }

          return H;
        };

        // Package private blocksize
        SHA256._blocksize = 16;

        SHA256._digestsize = 32;
      })();
    


      /*!
       * Crypto-JS v2.5.4	PBKDF2.js
       * http://code.google.com/p/crypto-js/
       * Copyright (c) 2009-2013, Jeff Mott. All rights reserved.
       * http://code.google.com/p/crypto-js/wiki/License
       */
      (function () {
        // Shortcuts
        var C = Crypto,
          util = C.util,
          charenc = C.charenc,
          UTF8 = charenc.UTF8,
          Binary = charenc.Binary;

        C.PBKDF2 = function (password, salt, keylen, options) {
          // Convert to byte arrays
          if (password.constructor == String)
            password = UTF8.stringToBytes(password);
          if (salt.constructor == String) salt = UTF8.stringToBytes(salt);
          /* else, assume byte arrays already */

          // Defaults
          var hasher = (options && options.hasher) || C.SHA1,
            iterations = (options && options.iterations) || 1;

          // Pseudo-random function
          function PRF(password, salt) {
            return C.HMAC(hasher, salt, password, { asBytes: true });
          }

          // Generate key
          var derivedKeyBytes = [],
            blockindex = 1;
          while (derivedKeyBytes.length < keylen) {
            var block = PRF(
              password,
              salt.concat(util.wordsToBytes([blockindex]))
            );
            for (var u = block, i = 1; i < iterations; i++) {
              u = PRF(password, u);
              for (var j = 0; j < block.length; j++) block[j] ^= u[j];
            }
            derivedKeyBytes = derivedKeyBytes.concat(block);
            blockindex++;
          }

          // Truncate excess bytes
          derivedKeyBytes.length = keylen;

          return options && options.asBytes
            ? derivedKeyBytes
            : options && options.asString
            ? Binary.bytesToString(derivedKeyBytes)
            : util.bytesToHex(derivedKeyBytes);
        };
      })();
    


      /*!
       * Crypto-JS v2.5.4	HMAC.js
       * http://code.google.com/p/crypto-js/
       * Copyright (c) 2009-2013, Jeff Mott. All rights reserved.
       * http://code.google.com/p/crypto-js/wiki/License
       */
      (function () {
        // Shortcuts
        var C = Crypto,
          util = C.util,
          charenc = C.charenc,
          UTF8 = charenc.UTF8,
          Binary = charenc.Binary;

        C.HMAC = function (hasher, message, key, options) {
          // Convert to byte arrays
          if (message.constructor == String)
            message = UTF8.stringToBytes(message);
          if (key.constructor == String) key = UTF8.stringToBytes(key);
          /* else, assume byte arrays already */

          // Allow arbitrary length keys
          if (key.length > hasher._blocksize * 4)
            key = hasher(key, { asBytes: true });

          // XOR keys with pad constants
          var okey = key.slice(0),
            ikey = key.slice(0);
          for (var i = 0; i < hasher._blocksize * 4; i++) {
            okey[i] ^= 0x5c;
            ikey[i] ^= 0x36;
          }

          var hmacbytes = hasher(
            okey.concat(hasher(ikey.concat(message), { asBytes: true })),
            { asBytes: true }
          );

          return options && options.asBytes
            ? hmacbytes
            : options && options.asString
            ? Binary.bytesToString(hmacbytes)
            : util.bytesToHex(hmacbytes);
        };
      })();
    


      /*!
       * Crypto-JS v2.5.4	AES.js
       * http://code.google.com/p/crypto-js/
       * Copyright (c) 2009-2013, Jeff Mott. All rights reserved.
       * http://code.google.com/p/crypto-js/wiki/License
       */
      (function () {
        // Shortcuts
        var C = Crypto,
          util = C.util,
          charenc = C.charenc,
          UTF8 = charenc.UTF8;

        // Precomputed SBOX
        var SBOX = [
          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,
        ];

        // Compute inverse SBOX lookup table
        for (var INVSBOX = [], i = 0; i < 256; i++) INVSBOX[SBOX[i]] = i;

        // Compute multiplication in GF(2^8) lookup tables
        var MULT2 = [],
          MULT3 = [],
          MULT9 = [],
          MULTB = [],
          MULTD = [],
          MULTE = [];

        function xtime(a, b) {
          for (var result = 0, i = 0; i < 8; i++) {
            if (b & 1) result ^= a;
            var hiBitSet = a & 0x80;
            a = (a << 1) & 0xff;
            if (hiBitSet) a ^= 0x1b;
            b >>>= 1;
          }
          return result;
        }

        for (var i = 0; i < 256; i++) {
          MULT2[i] = xtime(i, 2);
          MULT3[i] = xtime(i, 3);
          MULT9[i] = xtime(i, 9);
          MULTB[i] = xtime(i, 0xb);
          MULTD[i] = xtime(i, 0xd);
          MULTE[i] = xtime(i, 0xe);
        }

        // Precomputed RCon lookup
        var RCON = [
          0x00, 0x01, 0x02, 0x04, 0x08, 0x10, 0x20, 0x40, 0x80, 0x1b, 0x36,
        ];

        // Inner state
        var state = [[], [], [], []],
          keylength,
          nrounds,
          keyschedule;

        var AES = (C.AES = {
          /**
           * Public API
           */

          encrypt: function (message, password, options) {
            options = options || {};

            // Determine mode
            var mode = options.mode || new C.mode.OFB();

            // Allow mode to override options
            if (mode.fixOptions) mode.fixOptions(options);

            var // Convert to bytes if message is a string
              m =
                message.constructor == String
                  ? UTF8.stringToBytes(message)
                  : message,
              // Generate random IV
              iv = options.iv || util.randomBytes(AES._blocksize * 4),
              // Generate key
              k =
                password.constructor == String
                  ? // Derive key from pass-phrase
                    C.PBKDF2(password, iv, 32, { asBytes: true })
                  : // else, assume byte array representing cryptographic key
                    password;

            // Encrypt
            AES._init(k);
            mode.encrypt(AES, m, iv);

            // Return ciphertext
            m = options.iv ? m : iv.concat(m);
            return options && options.asBytes ? m : util.bytesToBase64(m);
          },

          decrypt: function (ciphertext, password, options) {
            options = options || {};

            // Determine mode
            var mode = options.mode || new C.mode.OFB();

            // Allow mode to override options
            if (mode.fixOptions) mode.fixOptions(options);

            var // Convert to bytes if ciphertext is a string
              c =
                ciphertext.constructor == String
                  ? util.base64ToBytes(ciphertext)
                  : ciphertext,
              // Separate IV and message
              iv = options.iv || c.splice(0, AES._blocksize * 4),
              // Generate key
              k =
                password.constructor == String
                  ? // Derive key from pass-phrase
                    C.PBKDF2(password, iv, 32, { asBytes: true })
                  : // else, assume byte array representing cryptographic key
                    password;

            // Decrypt
            AES._init(k);
            mode.decrypt(AES, c, iv);

            // Return plaintext
            return options && options.asBytes ? c : UTF8.bytesToString(c);
          },

          /**
           * Package private methods and properties
           */

          _blocksize: 4,

          _encryptblock: function (m, offset) {
            // Set input
            for (var row = 0; row < AES._blocksize; row++) {
              for (var col = 0; col < 4; col++)
                state[row][col] = m[offset + col * 4 + row];
            }

            // Add round key
            for (var row = 0; row < 4; row++) {
              for (var col = 0; col < 4; col++)
                state[row][col] ^= keyschedule[col][row];
            }

            for (var round = 1; round < nrounds; round++) {
              // Sub bytes
              for (var row = 0; row < 4; row++) {
                for (var col = 0; col < 4; col++)
                  state[row][col] = SBOX[state[row][col]];
              }

              // Shift rows
              state[1].push(state[1].shift());
              state[2].push(state[2].shift());
              state[2].push(state[2].shift());
              state[3].unshift(state[3].pop());

              // Mix columns
              for (var col = 0; col < 4; col++) {
                var s0 = state[0][col],
                  s1 = state[1][col],
                  s2 = state[2][col],
                  s3 = state[3][col];

                state[0][col] = MULT2[s0] ^ MULT3[s1] ^ s2 ^ s3;
                state[1][col] = s0 ^ MULT2[s1] ^ MULT3[s2] ^ s3;
                state[2][col] = s0 ^ s1 ^ MULT2[s2] ^ MULT3[s3];
                state[3][col] = MULT3[s0] ^ s1 ^ s2 ^ MULT2[s3];
              }

              // Add round key
              for (var row = 0; row < 4; row++) {
                for (var col = 0; col < 4; col++)
                  state[row][col] ^= keyschedule[round * 4 + col][row];
              }
            }

            // Sub bytes
            for (var row = 0; row < 4; row++) {
              for (var col = 0; col < 4; col++)
                state[row][col] = SBOX[state[row][col]];
            }

            // Shift rows
            state[1].push(state[1].shift());
            state[2].push(state[2].shift());
            state[2].push(state[2].shift());
            state[3].unshift(state[3].pop());

            // Add round key
            for (var row = 0; row < 4; row++) {
              for (var col = 0; col < 4; col++)
                state[row][col] ^= keyschedule[nrounds * 4 + col][row];
            }

            // Set output
            for (var row = 0; row < AES._blocksize; row++) {
              for (var col = 0; col < 4; col++)
                m[offset + col * 4 + row] = state[row][col];
            }
          },

          _decryptblock: function (c, offset) {
            // Set input
            for (var row = 0; row < AES._blocksize; row++) {
              for (var col = 0; col < 4; col++)
                state[row][col] = c[offset + col * 4 + row];
            }

            // Add round key
            for (var row = 0; row < 4; row++) {
              for (var col = 0; col < 4; col++)
                state[row][col] ^= keyschedule[nrounds * 4 + col][row];
            }

            for (var round = 1; round < nrounds; round++) {
              // Inv shift rows
              state[1].unshift(state[1].pop());
              state[2].push(state[2].shift());
              state[2].push(state[2].shift());
              state[3].push(state[3].shift());

              // Inv sub bytes
              for (var row = 0; row < 4; row++) {
                for (var col = 0; col < 4; col++)
                  state[row][col] = INVSBOX[state[row][col]];
              }

              // Add round key
              for (var row = 0; row < 4; row++) {
                for (var col = 0; col < 4; col++)
                  state[row][col] ^=
                    keyschedule[(nrounds - round) * 4 + col][row];
              }

              // Inv mix columns
              for (var col = 0; col < 4; col++) {
                var s0 = state[0][col],
                  s1 = state[1][col],
                  s2 = state[2][col],
                  s3 = state[3][col];

                state[0][col] = MULTE[s0] ^ MULTB[s1] ^ MULTD[s2] ^ MULT9[s3];
                state[1][col] = MULT9[s0] ^ MULTE[s1] ^ MULTB[s2] ^ MULTD[s3];
                state[2][col] = MULTD[s0] ^ MULT9[s1] ^ MULTE[s2] ^ MULTB[s3];
                state[3][col] = MULTB[s0] ^ MULTD[s1] ^ MULT9[s2] ^ MULTE[s3];
              }
            }

            // Inv shift rows
            state[1].unshift(state[1].pop());
            state[2].push(state[2].shift());
            state[2].push(state[2].shift());
            state[3].push(state[3].shift());

            // Inv sub bytes
            for (var row = 0; row < 4; row++) {
              for (var col = 0; col < 4; col++)
                state[row][col] = INVSBOX[state[row][col]];
            }

            // Add round key
            for (var row = 0; row < 4; row++) {
              for (var col = 0; col < 4; col++)
                state[row][col] ^= keyschedule[col][row];
            }

            // Set output
            for (var row = 0; row < AES._blocksize; row++) {
              for (var col = 0; col < 4; col++)
                c[offset + col * 4 + row] = state[row][col];
            }
          },

          /**
           * Private methods
           */

          _init: function (k) {
            keylength = k.length / 4;
            nrounds = keylength + 6;
            AES._keyexpansion(k);
          },

          // Generate a key schedule
          _keyexpansion: function (k) {
            keyschedule = [];

            for (var row = 0; row < keylength; row++) {
              keyschedule[row] = [
                k[row * 4],
                k[row * 4 + 1],
                k[row * 4 + 2],
                k[row * 4 + 3],
              ];
            }

            for (
              var row = keylength;
              row < AES._blocksize * (nrounds + 1);
              row++
            ) {
              var temp = [
                keyschedule[row - 1][0],
                keyschedule[row - 1][1],
                keyschedule[row - 1][2],
                keyschedule[row - 1][3],
              ];

              if (row % keylength == 0) {
                // Rot word
                temp.push(temp.shift());

                // Sub word
                temp[0] = SBOX[temp[0]];
                temp[1] = SBOX[temp[1]];
                temp[2] = SBOX[temp[2]];
                temp[3] = SBOX[temp[3]];

                temp[0] ^= RCON[row / keylength];
              } else if (keylength > 6 && row % keylength == 4) {
                // Sub word
                temp[0] = SBOX[temp[0]];
                temp[1] = SBOX[temp[1]];
                temp[2] = SBOX[temp[2]];
                temp[3] = SBOX[temp[3]];
              }

              keyschedule[row] = [
                keyschedule[row - keylength][0] ^ temp[0],
                keyschedule[row - keylength][1] ^ temp[1],
                keyschedule[row - keylength][2] ^ temp[2],
                keyschedule[row - keylength][3] ^ temp[3],
              ];
            }
          },
        });
      })();
    


      /*!
       * Crypto-JS 2.5.4 BlockModes.js
       * contribution from Simon Greatrix
       */

      (function (C) {
        // Create pad namespace
        var C_pad = (C.pad = {});

        // Calculate the number of padding bytes required.
        function _requiredPadding(cipher, message) {
          var blockSizeInBytes = cipher._blocksize * 4;
          var reqd = blockSizeInBytes - (message.length % blockSizeInBytes);
          return reqd;
        }

        // Remove padding when the final byte gives the number of padding bytes.
        var _unpadLength = function (cipher, message, alg, padding) {
          var pad = message.pop();
          if (pad == 0) {
            throw new Error(
              "Invalid zero-length padding specified for " +
                alg +
                ". Wrong cipher specification or key used?"
            );
          }
          var maxPad = cipher._blocksize * 4;
          if (pad > maxPad) {
            throw new Error(
              "Invalid padding length of " +
                pad +
                " specified for " +
                alg +
                ". Wrong cipher specification or key used?"
            );
          }
          for (var i = 1; i < pad; i++) {
            var b = message.pop();
            if (padding != undefined && padding != b) {
              throw new Error(
                "Invalid padding byte of 0x" +
                  b.toString(16) +
                  " specified for " +
                  alg +
                  ". Wrong cipher specification or key used?"
              );
            }
          }
        };

        // No-operation padding, used for stream ciphers
        C_pad.NoPadding = {
          pad: function (cipher, message) {},
          unpad: function (cipher, message) {},
        };

        // Zero Padding.
        //
        // If the message is not an exact number of blocks, the final block is
        // completed with 0x00 bytes. There is no unpadding.
        C_pad.ZeroPadding = {
          pad: function (cipher, message) {
            var blockSizeInBytes = cipher._blocksize * 4;
            var reqd = message.length % blockSizeInBytes;
            if (reqd != 0) {
              for (reqd = blockSizeInBytes - reqd; reqd > 0; reqd--) {
                message.push(0x00);
              }
            }
          },

          unpad: function (cipher, message) {
            while (message[message.length - 1] == 0) {
              message.pop();
            }
          },
        };

        // ISO/IEC 7816-4 padding.
        //
        // Pads the plain text with an 0x80 byte followed by as many 0x00
        // bytes are required to complete the block.
        C_pad.iso7816 = {
          pad: function (cipher, message) {
            var reqd = _requiredPadding(cipher, message);
            message.push(0x80);
            for (; reqd > 1; reqd--) {
              message.push(0x00);
            }
          },

          unpad: function (cipher, message) {
            var padLength;
            for (
              padLength = cipher._blocksize * 4;
              padLength > 0;
              padLength--
            ) {
              var b = message.pop();
              if (b == 0x80) return;
              if (b != 0x00) {
                throw new Error(
                  "ISO-7816 padding byte must be 0, not 0x" +
                    b.toString(16) +
                    ". Wrong cipher specification or key used?"
                );
              }
            }
            throw new Error(
              "ISO-7816 padded beyond cipher block size. Wrong cipher specification or key used?"
            );
          },
        };

        // ANSI X.923 padding
        //
        // The final block is padded with zeros except for the last byte of the
        // last block which contains the number of padding bytes.
        C_pad.ansix923 = {
          pad: function (cipher, message) {
            var reqd = _requiredPadding(cipher, message);
            for (var i = 1; i < reqd; i++) {
              message.push(0x00);
            }
            message.push(reqd);
          },

          unpad: function (cipher, message) {
            _unpadLength(cipher, message, "ANSI X.923", 0);
          },
        };

        // ISO 10126
        //
        // The final block is padded with random bytes except for the last
        // byte of the last block which contains the number of padding bytes.
        C_pad.iso10126 = {
          pad: function (cipher, message) {
            var reqd = _requiredPadding(cipher, message);
            for (var i = 1; i < reqd; i++) {
              message.push(Math.floor(Math.random() * 256));
            }
            message.push(reqd);
          },

          unpad: function (cipher, message) {
            _unpadLength(cipher, message, "ISO 10126", undefined);
          },
        };

        // PKCS7 padding
        //
        // PKCS7 is described in RFC 5652. Padding is in whole bytes. The
        // value of each added byte is the number of bytes that are added,
        // i.e. N bytes, each of value N are added.
        C_pad.pkcs7 = {
          pad: function (cipher, message) {
            var reqd = _requiredPadding(cipher, message);
            for (var i = 0; i < reqd; i++) {
              message.push(reqd);
            }
          },

          unpad: function (cipher, message) {
            _unpadLength(
              cipher,
              message,
              "PKCS 7",
              message[message.length - 1]
            );
          },
        };

        // Create mode namespace
        var C_mode = (C.mode = {});

        /**
         * Mode base "class".
         */
        var Mode = (C_mode.Mode = function (padding) {
          if (padding) {
            this._padding = padding;
          }
        });

        Mode.prototype = {
          encrypt: function (cipher, m, iv) {
            this._padding.pad(cipher, m);
            this._doEncrypt(cipher, m, iv);
          },

          decrypt: function (cipher, m, iv) {
            this._doDecrypt(cipher, m, iv);
            this._padding.unpad(cipher, m);
          },

          // Default padding
          _padding: C_pad.iso7816,
        };

        /**
         * Electronic Code Book mode.
         *
         * ECB applies the cipher directly against each block of the input.
         *
         * ECB does not require an initialization vector.
         */
        var ECB = (C_mode.ECB = function () {
          // Call parent constructor
          Mode.apply(this, arguments);
        });

        // Inherit from Mode
        var ECB_prototype = (ECB.prototype = new Mode());

        // Concrete steps for Mode template
        ECB_prototype._doEncrypt = function (cipher, m, iv) {
          var blockSizeInBytes = cipher._blocksize * 4;
          // Encrypt each block
          for (var offset = 0; offset < m.length; offset += blockSizeInBytes) {
            cipher._encryptblock(m, offset);
          }
        };
        ECB_prototype._doDecrypt = function (cipher, c, iv) {
          var blockSizeInBytes = cipher._blocksize * 4;
          // Decrypt each block
          for (var offset = 0; offset < c.length; offset += blockSizeInBytes) {
            cipher._decryptblock(c, offset);
          }
        };

        // ECB never uses an IV
        ECB_prototype.fixOptions = function (options) {
          options.iv = [];
        };

        /**
         * Cipher block chaining
         *
         * The first block is XORed with the IV. Subsequent blocks are XOR with the
         * previous cipher output.
         */
        var CBC = (C_mode.CBC = function () {
          // Call parent constructor
          Mode.apply(this, arguments);
        });

        // Inherit from Mode
        var CBC_prototype = (CBC.prototype = new Mode());

        // Concrete steps for Mode template
        CBC_prototype._doEncrypt = function (cipher, m, iv) {
          var blockSizeInBytes = cipher._blocksize * 4;

          // Encrypt each block
          for (var offset = 0; offset < m.length; offset += blockSizeInBytes) {
            if (offset == 0) {
              // XOR first block using IV
              for (var i = 0; i < blockSizeInBytes; i++) m[i] ^= iv[i];
            } else {
              // XOR this block using previous crypted block
              for (var i = 0; i < blockSizeInBytes; i++)
                m[offset + i] ^= m[offset + i - blockSizeInBytes];
            }
            // Encrypt block
            cipher._encryptblock(m, offset);
          }
        };
        CBC_prototype._doDecrypt = function (cipher, c, iv) {
          var blockSizeInBytes = cipher._blocksize * 4;

          // At the start, the previously crypted block is the IV
          var prevCryptedBlock = iv;

          // Decrypt each block
          for (var offset = 0; offset < c.length; offset += blockSizeInBytes) {
            // Save this crypted block
            var thisCryptedBlock = c.slice(offset, offset + blockSizeInBytes);
            // Decrypt block
            cipher._decryptblock(c, offset);
            // XOR decrypted block using previous crypted block
            for (var i = 0; i < blockSizeInBytes; i++) {
              c[offset + i] ^= prevCryptedBlock[i];
            }
            prevCryptedBlock = thisCryptedBlock;
          }
        };

        /**
         * Cipher feed back
         *
         * The cipher output is XORed with the plain text to produce the cipher output,
         * which is then fed back into the cipher to produce a bit pattern to XOR the
         * next block with.
         *
         * This is a stream cipher mode and does not require padding.
         */
        var CFB = (C_mode.CFB = function () {
          // Call parent constructor
          Mode.apply(this, arguments);
        });

        // Inherit from Mode
        var CFB_prototype = (CFB.prototype = new Mode());

        // Override padding
        CFB_prototype._padding = C_pad.NoPadding;

        // Concrete steps for Mode template
        CFB_prototype._doEncrypt = function (cipher, m, iv) {
          var blockSizeInBytes = cipher._blocksize * 4,
            keystream = iv.slice(0);

          // Encrypt each byte
          for (var i = 0; i < m.length; i++) {
            var j = i % blockSizeInBytes;
            if (j == 0) cipher._encryptblock(keystream, 0);

            m[i] ^= keystream[j];
            keystream[j] = m[i];
          }
        };
        CFB_prototype._doDecrypt = function (cipher, c, iv) {
          var blockSizeInBytes = cipher._blocksize * 4,
            keystream = iv.slice(0);

          // Encrypt each byte
          for (var i = 0; i < c.length; i++) {
            var j = i % blockSizeInBytes;
            if (j == 0) cipher._encryptblock(keystream, 0);

            var b = c[i];
            c[i] ^= keystream[j];
            keystream[j] = b;
          }
        };

        /**
         * Output feed back
         *
         * The cipher repeatedly encrypts its own output. The output is XORed with the
         * plain text to produce the cipher text.
         *
         * This is a stream cipher mode and does not require padding.
         */
        var OFB = (C_mode.OFB = function () {
          // Call parent constructor
          Mode.apply(this, arguments);
        });

        // Inherit from Mode
        var OFB_prototype = (OFB.prototype = new Mode());

        // Override padding
        OFB_prototype._padding = C_pad.NoPadding;

        // Concrete steps for Mode template
        OFB_prototype._doEncrypt = function (cipher, m, iv) {
          var blockSizeInBytes = cipher._blocksize * 4,
            keystream = iv.slice(0);

          // Encrypt each byte
          for (var i = 0; i < m.length; i++) {
            // Generate keystream
            if (i % blockSizeInBytes == 0) cipher._encryptblock(keystream, 0);

            // Encrypt byte
            m[i] ^= keystream[i % blockSizeInBytes];
          }
        };
        OFB_prototype._doDecrypt = OFB_prototype._doEncrypt;

        /**
         * Counter
         * @author Gergely Risko
         *
         * After every block the last 4 bytes of the IV is increased by one
         * with carry and that IV is used for the next block.
         *
         * This is a stream cipher mode and does not require padding.
         */
        var CTR = (C_mode.CTR = function () {
          // Call parent constructor
          Mode.apply(this, arguments);
        });

        // Inherit from Mode
        var CTR_prototype = (CTR.prototype = new Mode());

        // Override padding
        CTR_prototype._padding = C_pad.NoPadding;

        CTR_prototype._doEncrypt = function (cipher, m, iv) {
          var blockSizeInBytes = cipher._blocksize * 4;
          var counter = iv.slice(0);

          for (var i = 0; i < m.length; ) {
            // do not lose iv
            var keystream = counter.slice(0);

            // Generate keystream for next block
            cipher._encryptblock(keystream, 0);

            // XOR keystream with block
            for (var j = 0; i < m.length && j < blockSizeInBytes; j++, i++) {
              m[i] ^= keystream[j];
            }

            // Increase counter
            if (++counter[blockSizeInBytes - 1] == 256) {
              counter[blockSizeInBytes - 1] = 0;
              if (++counter[blockSizeInBytes - 2] == 256) {
                counter[blockSizeInBytes - 2] = 0;
                if (++counter[blockSizeInBytes - 3] == 256) {
                  counter[blockSizeInBytes - 3] = 0;
                  ++counter[blockSizeInBytes - 4];
                }
              }
            }
          }
        };
        CTR_prototype._doDecrypt = CTR_prototype._doEncrypt;
      })(Crypto);
    


      /*!
       * Crypto-JS v2.0.0  RIPEMD-160
       * http://code.google.com/p/crypto-js/
       * Copyright (c) 2009, Jeff Mott. All rights reserved.
       * http://code.google.com/p/crypto-js/wiki/License
       *
       * A JavaScript implementation of the RIPEMD-160 Algorithm
       * Version 2.2 Copyright Jeremy Lin, Paul Johnston 2000 - 2009.
       * Other contributors: Greg Holt, Andrew Kepert, Ydnar, Lostinet
       * Distributed under the BSD License
       * See http://pajhome.org.uk/crypt/md5 for details.
       * Also http://www.ocf.berkeley.edu/~jjlin/jsotp/
       * Ported to Crypto-JS by Stefan Thomas.
       */

      (function () {
        // Shortcuts
        var C = Crypto,
          util = C.util,
          charenc = C.charenc,
          UTF8 = charenc.UTF8,
          Binary = charenc.Binary;

        // Convert a byte array to little-endian 32-bit words
        util.bytesToLWords = function (bytes) {
          var output = Array(bytes.length >> 2);
          for (var i = 0; i < output.length; i++) output[i] = 0;
          for (var i = 0; i < bytes.length * 8; i += 8)
            output[i >> 5] |= (bytes[i / 8] & 0xff) << i % 32;
          return output;
        };

        // Convert little-endian 32-bit words to a byte array
        util.lWordsToBytes = function (words) {
          var output = [];
          for (var i = 0; i < words.length * 32; i += 8)
            output.push((words[i >> 5] >>> i % 32) & 0xff);
          return output;
        };

        // Public API
        var RIPEMD160 = (C.RIPEMD160 = function (message, options) {
          var digestbytes = util.lWordsToBytes(RIPEMD160._rmd160(message));
          return options && options.asBytes
            ? digestbytes
            : options && options.asString
            ? Binary.bytesToString(digestbytes)
            : util.bytesToHex(digestbytes);
        });

        // The core
        RIPEMD160._rmd160 = function (message) {
          // Convert to byte array
          if (message.constructor == String)
            message = UTF8.stringToBytes(message);

          var x = util.bytesToLWords(message),
            len = message.length * 8;

          /* append padding */
          x[len >> 5] |= 0x80 << len % 32;
          x[(((len + 64) >>> 9) << 4) + 14] = len;

          var h0 = 0x67452301;
          var h1 = 0xefcdab89;
          var h2 = 0x98badcfe;
          var h3 = 0x10325476;
          var h4 = 0xc3d2e1f0;

          for (var i = 0; i < x.length; i += 16) {
            var T;
            var A1 = h0,
              B1 = h1,
              C1 = h2,
              D1 = h3,
              E1 = h4;
            var A2 = h0,
              B2 = h1,
              C2 = h2,
              D2 = h3,
              E2 = h4;
            for (var j = 0; j <= 79; ++j) {
              T = safe_add(A1, rmd160_f(j, B1, C1, D1));
              T = safe_add(T, x[i + rmd160_r1[j]]);
              T = safe_add(T, rmd160_K1(j));
              T = safe_add(bit_rol(T, rmd160_s1[j]), E1);
              A1 = E1;
              E1 = D1;
              D1 = bit_rol(C1, 10);
              C1 = B1;
              B1 = T;
              T = safe_add(A2, rmd160_f(79 - j, B2, C2, D2));
              T = safe_add(T, x[i + rmd160_r2[j]]);
              T = safe_add(T, rmd160_K2(j));
              T = safe_add(bit_rol(T, rmd160_s2[j]), E2);
              A2 = E2;
              E2 = D2;
              D2 = bit_rol(C2, 10);
              C2 = B2;
              B2 = T;
            }
            T = safe_add(h1, safe_add(C1, D2));
            h1 = safe_add(h2, safe_add(D1, E2));
            h2 = safe_add(h3, safe_add(E1, A2));
            h3 = safe_add(h4, safe_add(A1, B2));
            h4 = safe_add(h0, safe_add(B1, C2));
            h0 = T;
          }
          return [h0, h1, h2, h3, h4];
        };

        function rmd160_f(j, x, y, z) {
          return 0 <= j && j <= 15
            ? x ^ y ^ z
            : 16 <= j && j <= 31
            ? (x & y) | (~x & z)
            : 32 <= j && j <= 47
            ? (x | ~y) ^ z
            : 48 <= j && j <= 63
            ? (x & z) | (y & ~z)
            : 64 <= j && j <= 79
            ? x ^ (y | ~z)
            : "rmd160_f: j out of range";
        }
        function rmd160_K1(j) {
          return 0 <= j && j <= 15
            ? 0x00000000
            : 16 <= j && j <= 31
            ? 0x5a827999
            : 32 <= j && j <= 47
            ? 0x6ed9eba1
            : 48 <= j && j <= 63
            ? 0x8f1bbcdc
            : 64 <= j && j <= 79
            ? 0xa953fd4e
            : "rmd160_K1: j out of range";
        }
        function rmd160_K2(j) {
          return 0 <= j && j <= 15
            ? 0x50a28be6
            : 16 <= j && j <= 31
            ? 0x5c4dd124
            : 32 <= j && j <= 47
            ? 0x6d703ef3
            : 48 <= j && j <= 63
            ? 0x7a6d76e9
            : 64 <= j && j <= 79
            ? 0x00000000
            : "rmd160_K2: j out of range";
        }
        var rmd160_r1 = [
          0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 7, 4, 13, 1, 10,
          6, 15, 3, 12, 0, 9, 5, 2, 14, 11, 8, 3, 10, 14, 4, 9, 15, 8, 1, 2, 7,
          0, 6, 13, 11, 5, 12, 1, 9, 11, 10, 0, 8, 12, 4, 13, 3, 7, 15, 14, 5,
          6, 2, 4, 0, 5, 9, 7, 12, 2, 10, 14, 1, 3, 8, 11, 6, 15, 13,
        ];
        var rmd160_r2 = [
          5, 14, 7, 0, 9, 2, 11, 4, 13, 6, 15, 8, 1, 10, 3, 12, 6, 11, 3, 7, 0,
          13, 5, 10, 14, 15, 8, 12, 4, 9, 1, 2, 15, 5, 1, 3, 7, 14, 6, 9, 11, 8,
          12, 2, 10, 0, 4, 13, 8, 6, 4, 1, 3, 11, 15, 0, 5, 12, 2, 13, 9, 7, 10,
          14, 12, 15, 10, 4, 1, 5, 8, 7, 6, 2, 13, 14, 0, 3, 9, 11,
        ];
        var rmd160_s1 = [
          11, 14, 15, 12, 5, 8, 7, 9, 11, 13, 14, 15, 6, 7, 9, 8, 7, 6, 8, 13,
          11, 9, 7, 15, 7, 12, 15, 9, 11, 7, 13, 12, 11, 13, 6, 7, 14, 9, 13,
          15, 14, 8, 13, 6, 5, 12, 7, 5, 11, 12, 14, 15, 14, 15, 9, 8, 9, 14, 5,
          6, 8, 6, 5, 12, 9, 15, 5, 11, 6, 8, 13, 12, 5, 12, 13, 14, 11, 8, 5,
          6,
        ];
        var rmd160_s2 = [
          8, 9, 9, 11, 13, 15, 15, 5, 7, 7, 8, 11, 14, 14, 12, 6, 9, 13, 15, 7,
          12, 8, 9, 11, 7, 7, 12, 7, 6, 15, 13, 11, 9, 7, 15, 11, 8, 6, 6, 14,
          12, 13, 5, 14, 13, 13, 7, 5, 15, 5, 8, 11, 14, 14, 6, 14, 6, 9, 12, 9,
          12, 5, 15, 8, 8, 5, 12, 9, 12, 5, 14, 6, 8, 13, 6, 5, 15, 13, 11, 11,
        ];

        /*
         * Add integers, wrapping at 2^32. This uses 16-bit operations internally
         * to work around bugs in some JS interpreters.
         */
        function safe_add(x, y) {
          var lsw = (x & 0xffff) + (y & 0xffff);
          var msw = (x >> 16) + (y >> 16) + (lsw >> 16);
          return (msw << 16) | (lsw & 0xffff);
        }

        /*
         * Bitwise rotate a 32-bit number to the left.
         */
        function bit_rol(num, cnt) {
          return (num << cnt) | (num >>> (32 - cnt));
        }
      })();
    


      /*!
       * Random number generator with ArcFour PRNG
       *
       * NOTE: For best results, put code like
       * <body onclick='SecureRandom.seedTime();' onkeypress='SecureRandom.seedTime();'>
       * in your main HTML document.
       *
       * Copyright Tom Wu, bitaddress.org  BSD License.
       * http://www-cs-students.stanford.edu/~tjw/jsbn/LICENSE
       */
      (function () {
        // Constructor function of Global SecureRandom object
        var sr = (window.SecureRandom = function () {});

        // Properties
        sr.state;
        sr.pool;
        sr.pptr;
        sr.poolCopyOnInit;

        // Pool size must be a multiple of 4 and greater than 32.
        // An array of bytes the size of the pool will be passed to init()
        sr.poolSize = 256;

        // --- object methods ---

        // public method
        // ba: byte array
        sr.prototype.nextBytes = function (ba) {
          var i;
          if (
            window.crypto &&
            window.crypto.getRandomValues &&
            window.Uint8Array
          ) {
            try {
              var rvBytes = new Uint8Array(ba.length);
              window.crypto.getRandomValues(rvBytes);
              for (i = 0; i < ba.length; ++i) ba[i] = sr.getByte() ^ rvBytes[i];
              return;
            } catch (e) {
              alert(e);
            }
          }
          for (i = 0; i < ba.length; ++i) ba[i] = sr.getByte();
        };

        // --- static methods ---

        // Mix in the current time (w/milliseconds) into the pool
        // NOTE: this method should be called from body click/keypress event handlers to increase entropy
        sr.seedTime = function () {
          sr.seedInt(new Date().getTime());
        };

        sr.getByte = function () {
          if (sr.state == null) {
            sr.seedTime();
            sr.state = sr.ArcFour(); // Plug in your RNG constructor here
            sr.state.init(sr.pool);
            sr.poolCopyOnInit = [];
            for (sr.pptr = 0; sr.pptr < sr.pool.length; ++sr.pptr)
              sr.poolCopyOnInit[sr.pptr] = sr.pool[sr.pptr];
            sr.pptr = 0;
          }
          // TODO: allow reseeding after first request
          return sr.state.next();
        };

        // Mix in a 32-bit integer into the pool
        sr.seedInt = function (x) {
          sr.seedInt8(x);
          sr.seedInt8(x >> 8);
          sr.seedInt8(x >> 16);
          sr.seedInt8(x >> 24);
        };

        // Mix in a 16-bit integer into the pool
        sr.seedInt16 = function (x) {
          sr.seedInt8(x);
          sr.seedInt8(x >> 8);
        };

        // Mix in a 8-bit integer into the pool
        sr.seedInt8 = function (x) {
          sr.pool[sr.pptr++] ^= x & 255;
          if (sr.pptr >= sr.poolSize) sr.pptr -= sr.poolSize;
        };

        // Arcfour is a PRNG
        sr.ArcFour = function () {
          function Arcfour() {
            this.i = 0;
            this.j = 0;
            this.S = new Array();
          }

          // Initialize arcfour context from key, an array of ints, each from [0..255]
          function ARC4init(key) {
            var i, j, t;
            for (i = 0; i < 256; ++i) this.S[i] = i;
            j = 0;
            for (i = 0; i < 256; ++i) {
              j = (j + this.S[i] + key[i % key.length]) & 255;
              t = this.S[i];
              this.S[i] = this.S[j];
              this.S[j] = t;
            }
            this.i = 0;
            this.j = 0;
          }

          function ARC4next() {
            var t;
            this.i = (this.i + 1) & 255;
            this.j = (this.j + this.S[this.i]) & 255;
            t = this.S[this.i];
            this.S[this.i] = this.S[this.j];
            this.S[this.j] = t;
            return this.S[(t + this.S[this.i]) & 255];
          }

          Arcfour.prototype.init = ARC4init;
          Arcfour.prototype.next = ARC4next;

          return new Arcfour();
        };

        // Initialize the pool with junk if needed.
        if (sr.pool == null) {
          sr.pool = new Array();
          sr.pptr = 0;
          var t;
          if (
            window.crypto &&
            window.crypto.getRandomValues &&
            window.Uint8Array
          ) {
            try {
              // Use webcrypto if available
              var ua = new Uint8Array(sr.poolSize);
              window.crypto.getRandomValues(ua);
              for (t = 0; t < sr.poolSize; ++t) sr.pool[sr.pptr++] = ua[t];
            } catch (e) {
              alert(e);
            }
          }
          while (sr.pptr < sr.poolSize) {
            // extract some randomness from Math.random()
            t = Math.floor(65536 * Math.random());
            sr.pool[sr.pptr++] = t >>> 8;
            sr.pool[sr.pptr++] = t & 255;
          }
          sr.pptr = Math.floor(sr.poolSize * Math.random());
          sr.seedTime();
          // entropy
          var entropyStr = "";
          // screen size and color depth: ~4.8 to ~5.4 bits
          entropyStr +=
            window.screen.height *
            window.screen.width *
            window.screen.colorDepth;
          entropyStr +=
            window.screen.availHeight *
            window.screen.availWidth *
            window.screen.pixelDepth;
          // time zone offset: ~4 bits
          var dateObj = new Date();
          var timeZoneOffset = dateObj.getTimezoneOffset();
          entropyStr += timeZoneOffset;
          // user agent: ~8.3 to ~11.6 bits
          entropyStr += navigator.userAgent;
          // browser plugin details: ~16.2 to ~21.8 bits
          var pluginsStr = "";
          for (var i = 0; i < navigator.plugins.length; i++) {
            pluginsStr +=
              navigator.plugins[i].name +
              " " +
              navigator.plugins[i].filename +
              " " +
              navigator.plugins[i].description +
              " " +
              navigator.plugins[i].version +
              ", ";
          }
          var mimeTypesStr = "";
          for (var i = 0; i < navigator.mimeTypes.length; i++) {
            mimeTypesStr +=
              navigator.mimeTypes[i].description +
              " " +
              navigator.mimeTypes[i].type +
              " " +
              navigator.mimeTypes[i].suffixes +
              ", ";
          }
          entropyStr += pluginsStr + mimeTypesStr;
          // cookies and storage: 1 bit
          entropyStr +=
            navigator.cookieEnabled +
            typeof sessionStorage +
            typeof localStorage;
          // language: ~7 bit
          entropyStr += navigator.language;
          // history: ~2 bit
          entropyStr += window.history.length;
          // location
          entropyStr += window.location;

          var entropyBytes = Crypto.SHA256(entropyStr, { asBytes: true });
          for (var i = 0; i < entropyBytes.length; i++) {
            sr.seedInt8(entropyBytes[i]);
          }
        }
      })();
    


      /*
Copyright (c) 2011 Stefan Thomas

Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:

The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.

THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
*/

      //https://raw.github.com/bitcoinjs/bitcoinjs-lib/1a7fc9d063f864058809d06ef4542af40be3558f/src/bitcoin.js
      (function (exports) {
        var Bitcoin = exports;
      })("object" === typeof module ? module.exports : (window.Bitcoin = {}));
    


      //https://raw.github.com/bitcoinjs/bitcoinjs-lib/c952aaeb3ee472e3776655b8ea07299ebed702c7/src/base58.js
      (function (Bitcoin) {
        Bitcoin.Base58 = {
          alphabet:
            "123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz",
          validRegex: /^[1-9A-HJ-NP-Za-km-z]+$/,
          base: BigInteger.valueOf(58),

          /**
           * Convert a byte array to a base58-encoded string.
           *
           * Written by Mike Hearn for BitcoinJ.
           *   Copyright (c) 2011 Google Inc.
           *
           * Ported to JavaScript by Stefan Thomas.
           */
          encode: function (input) {
            var bi = BigInteger.fromByteArrayUnsigned(input);
            var chars = [];

            while (bi.compareTo(B58.base) >= 0) {
              var mod = bi.mod(B58.base);
              chars.unshift(B58.alphabet[mod.intValue()]);
              bi = bi.subtract(mod).divide(B58.base);
            }
            chars.unshift(B58.alphabet[bi.intValue()]);

            // Convert leading zeros too.
            for (var i = 0; i < input.length; i++) {
              if (input[i] == 0x00) {
                chars.unshift(B58.alphabet[0]);
              } else break;
            }

            return chars.join("");
          },

          /**
           * Convert a base58-encoded string to a byte array.
           *
           * Written by Mike Hearn for BitcoinJ.
           *   Copyright (c) 2011 Google Inc.
           *
           * Ported to JavaScript by Stefan Thomas.
           */
          decode: function (input) {
            var bi = BigInteger.valueOf(0);
            var leadingZerosNum = 0;
            for (var i = input.length - 1; i >= 0; i--) {
              var alphaIndex = B58.alphabet.indexOf(input[i]);
              if (alphaIndex < 0) {
                throw "Invalid character";
              }
              bi = bi.add(
                BigInteger.valueOf(alphaIndex).multiply(
                  B58.base.pow(input.length - 1 - i)
                )
              );

              // This counts leading zero bytes
              if (input[i] == "1") leadingZerosNum++;
              else leadingZerosNum = 0;
            }
            var bytes = bi.toByteArrayUnsigned();

            // Add leading zeros
            while (leadingZerosNum-- > 0) bytes.unshift(0);

            return bytes;
          },
        };

        var B58 = Bitcoin.Base58;
      })("undefined" != typeof Bitcoin ? Bitcoin : module.exports);
    


      //https://raw.github.com/bitcoinjs/bitcoinjs-lib/09e8c6e184d6501a0c2c59d73ca64db5c0d3eb95/src/address.js
      Bitcoin.Address = function (bytes) {
        if ("string" == typeof bytes) {
          bytes = Bitcoin.Address.decodeString(bytes);
        }
        this.hash = bytes;
        this.version = Bitcoin.Address.networkVersion;
      };

      Bitcoin.Address.networkVersion = 0x2d; // mainnet

      /**
       * Serialize this object as a standard Bitcoin address.
       *
       * Returns the address as a base58-encoded string in the standardized format.
       */
      Bitcoin.Address.prototype.toString = function () {
        // Get a copy of the hash
        var hash = this.hash.slice(0);

        // Version
        hash.unshift(this.version);
        var checksum = Crypto.SHA256(Crypto.SHA256(hash, { asBytes: true }), {
          asBytes: true,
        });
        var bytes = hash.concat(checksum.slice(0, 4));
        return Bitcoin.Base58.encode(bytes);
      };

      Bitcoin.Address.prototype.getHashBase64 = function () {
        return Crypto.util.bytesToBase64(this.hash);
      };

      /**
       * Parse a Bitcoin address contained in a string.
       */
      Bitcoin.Address.decodeString = function (string) {
        var bytes = Bitcoin.Base58.decode(string);
        var hash = bytes.slice(0, 21);
        var checksum = Crypto.SHA256(Crypto.SHA256(hash, { asBytes: true }), {
          asBytes: true,
        });

        if (
          checksum[0] != bytes[21] ||
          checksum[1] != bytes[22] ||
          checksum[2] != bytes[23] ||
          checksum[3] != bytes[24]
        ) {
          throw "Checksum validation failed!";
        }

        var version = hash.shift();

        if (version != 0) {
          throw "Version " + version + " not supported!";
        }

        return hash;
      };
    


      //https://raw.github.com/bitcoinjs/bitcoinjs-lib/e90780d3d3b8fc0d027d2bcb38b80479902f223e/src/ecdsa.js
      Bitcoin.ECDSA = (function () {
        var ecparams = EllipticCurve.getSECCurveByName("secp256k1");
        var rng = new SecureRandom();

        var P_OVER_FOUR = null;

        function implShamirsTrick(P, k, Q, l) {
          var m = Math.max(k.bitLength(), l.bitLength());
          var Z = P.add2D(Q);
          var R = P.curve.getInfinity();

          for (var i = m - 1; i >= 0; --i) {
            R = R.twice2D();

            R.z = BigInteger.ONE;

            if (k.testBit(i)) {
              if (l.testBit(i)) {
                R = R.add2D(Z);
              } else {
                R = R.add2D(P);
              }
            } else {
              if (l.testBit(i)) {
                R = R.add2D(Q);
              }
            }
          }

          return R;
        }

        var ECDSA = {
          getBigRandom: function (limit) {
            return new BigInteger(limit.bitLength(), rng)
              .mod(limit.subtract(BigInteger.ONE))
              .add(BigInteger.ONE);
          },
          sign: function (hash, priv) {
            var d = priv;
            var n = ecparams.getN();
            var e = BigInteger.fromByteArrayUnsigned(hash);

            do {
              var k = ECDSA.getBigRandom(n);
              var G = ecparams.getG();
              var Q = G.multiply(k);
              var r = Q.getX().toBigInteger().mod(n);
            } while (r.compareTo(BigInteger.ZERO) <= 0);

            var s = k
              .modInverse(n)
              .multiply(e.add(d.multiply(r)))
              .mod(n);

            return ECDSA.serializeSig(r, s);
          },

          verify: function (hash, sig, pubkey) {
            var r, s;
            if (Bitcoin.Util.isArray(sig)) {
              var obj = ECDSA.parseSig(sig);
              r = obj.r;
              s = obj.s;
            } else if ("object" === typeof sig && sig.r && sig.s) {
              r = sig.r;
              s = sig.s;
            } else {
              throw "Invalid value for signature";
            }

            var Q;
            if (pubkey instanceof ec.PointFp) {
              Q = pubkey;
            } else if (Bitcoin.Util.isArray(pubkey)) {
              Q = EllipticCurve.PointFp.decodeFrom(ecparams.getCurve(), pubkey);
            } else {
              throw "Invalid format for pubkey value, must be byte array or ec.PointFp";
            }
            var e = BigInteger.fromByteArrayUnsigned(hash);

            return ECDSA.verifyRaw(e, r, s, Q);
          },

          verifyRaw: function (e, r, s, Q) {
            var n = ecparams.getN();
            var G = ecparams.getG();

            if (r.compareTo(BigInteger.ONE) < 0 || r.compareTo(n) >= 0)
              return false;

            if (s.compareTo(BigInteger.ONE) < 0 || s.compareTo(n) >= 0)
              return false;

            var c = s.modInverse(n);

            var u1 = e.multiply(c).mod(n);
            var u2 = r.multiply(c).mod(n);

            // TODO(!!!): For some reason Shamir's trick isn't working with
            // signed message verification!? Probably an implementation
            // error!
            //var point = implShamirsTrick(G, u1, Q, u2);
            var point = G.multiply(u1).add(Q.multiply(u2));

            var v = point.getX().toBigInteger().mod(n);

            return v.equals(r);
          },

          /**
           * Serialize a signature into DER format.
           *
           * Takes two BigIntegers representing r and s and returns a byte array.
           */
          serializeSig: function (r, s) {
            var rBa = r.toByteArraySigned();
            var sBa = s.toByteArraySigned();

            var sequence = [];
            sequence.push(0x02); // INTEGER
            sequence.push(rBa.length);
            sequence = sequence.concat(rBa);

            sequence.push(0x02); // INTEGER
            sequence.push(sBa.length);
            sequence = sequence.concat(sBa);

            sequence.unshift(sequence.length);
            sequence.unshift(0x30); // SEQUENCE

            return sequence;
          },

          /**
           * Parses a byte array containing a DER-encoded signature.
           *
           * This function will return an object of the form:
           *
           * {
           *   r: BigInteger,
           *   s: BigInteger
           * }
           */
          parseSig: function (sig) {
            var cursor;
            if (sig[0] != 0x30)
              throw new Error("Signature not a valid DERSequence");

            cursor = 2;
            if (sig[cursor] != 0x02)
              throw new Error(
                "First element in signature must be a DERInteger"
              );
            var rBa = sig.slice(cursor + 2, cursor + 2 + sig[cursor + 1]);

            cursor += 2 + sig[cursor + 1];
            if (sig[cursor] != 0x02)
              throw new Error(
                "Second element in signature must be a DERInteger"
              );
            var sBa = sig.slice(cursor + 2, cursor + 2 + sig[cursor + 1]);

            cursor += 2 + sig[cursor + 1];

            //if (cursor != sig.length)
            //	throw new Error("Extra bytes in signature");

            var r = BigInteger.fromByteArrayUnsigned(rBa);
            var s = BigInteger.fromByteArrayUnsigned(sBa);

            return { r: r, s: s };
          },

          parseSigCompact: function (sig) {
            if (sig.length !== 65) {
              throw "Signature has the wrong length";
            }

            // Signature is prefixed with a type byte storing three bits of
            // information.
            var i = sig[0] - 27;
            if (i < 0 || i > 7) {
              throw "Invalid signature type";
            }

            var n = ecparams.getN();
            var r = BigInteger.fromByteArrayUnsigned(sig.slice(1, 33)).mod(n);
            var s = BigInteger.fromByteArrayUnsigned(sig.slice(33, 65)).mod(n);

            return { r: r, s: s, i: i };
          },

          /**
           * Recover a public key from a signature.
           *
           * See SEC 1: Elliptic Curve Cryptography, section 4.1.6, "Public
           * Key Recovery Operation".
           *
           * http://www.secg.org/download/aid-780/sec1-v2.pdf
           */
          recoverPubKey: function (r, s, hash, i) {
            // The recovery parameter i has two bits.
            i = i & 3;

            // The less significant bit specifies whether the y coordinate
            // of the compressed point is even or not.
            var isYEven = i & 1;

            // The more significant bit specifies whether we should use the
            // first or second candidate key.
            var isSecondKey = i >> 1;

            var n = ecparams.getN();
            var G = ecparams.getG();
            var curve = ecparams.getCurve();
            var p = curve.getQ();
            var a = curve.getA().toBigInteger();
            var b = curve.getB().toBigInteger();

            // We precalculate (p + 1) / 4 where p is if the field order
            if (!P_OVER_FOUR) {
              P_OVER_FOUR = p.add(BigInteger.ONE).divide(BigInteger.valueOf(4));
            }

            // 1.1 Compute x
            var x = isSecondKey ? r.add(n) : r;

            // 1.3 Convert x to point
            var alpha = x
              .multiply(x)
              .multiply(x)
              .add(a.multiply(x))
              .add(b)
              .mod(p);
            var beta = alpha.modPow(P_OVER_FOUR, p);

            var xorOdd = beta.isEven() ? i % 2 : (i + 1) % 2;
            // If beta is even, but y isn't or vice versa, then convert it,
            // otherwise we're done and y == beta.
            var y = (beta.isEven() ? !isYEven : isYEven)
              ? beta
              : p.subtract(beta);

            // 1.4 Check that nR is at infinity
            var R = new EllipticCurve.PointFp(
              curve,
              curve.fromBigInteger(x),
              curve.fromBigInteger(y)
            );
            R.validate();

            // 1.5 Compute e from M
            var e = BigInteger.fromByteArrayUnsigned(hash);
            var eNeg = BigInteger.ZERO.subtract(e).mod(n);

            // 1.6 Compute Q = r^-1 (sR - eG)
            var rInv = r.modInverse(n);
            var Q = implShamirsTrick(R, s, G, eNeg).multiply(rInv);

            Q.validate();
            if (!ECDSA.verifyRaw(e, r, s, Q)) {
              throw "Pubkey recovery unsuccessful";
            }

            var pubKey = new Bitcoin.ECKey();
            pubKey.pub = Q;
            return pubKey;
          },

          /**
           * Calculate pubkey extraction parameter.
           *
           * When extracting a pubkey from a signature, we have to
           * distinguish four different cases. Rather than putting this
           * burden on the verifier, Bitcoin includes a 2-bit value with the
           * signature.
           *
           * This function simply tries all four cases and returns the value
           * that resulted in a successful pubkey recovery.
           */
          calcPubkeyRecoveryParam: function (address, r, s, hash) {
            for (var i = 0; i < 4; i++) {
              try {
                var pubkey = Bitcoin.ECDSA.recoverPubKey(r, s, hash, i);
                if (pubkey.getBitcoinAddress().toString() == address) {
                  return i;
                }
              } catch (e) {}
            }
            throw "Unable to find valid recovery factor";
          },
        };

        return ECDSA;
      })();
    


      Bitcoin.KeyPool = (function () {
        var KeyPool = function () {
          this.keyArray = [];

          this.push = function (item) {
            if (item == null || item.priv == null) return;
            var doAdd = true;
            // prevent duplicates from being added to the array
            for (var index in this.keyArray) {
              var currentItem = this.keyArray[index];
              if (
                currentItem != null &&
                currentItem.priv != null &&
                item.getBitcoinAddress() == currentItem.getBitcoinAddress()
              ) {
                doAdd = false;
                break;
              }
            }
            if (doAdd) this.keyArray.push(item);
          };

          this.reset = function () {
            this.keyArray = [];
          };

          this.getArray = function () {
            // copy array
            return this.keyArray.slice(0);
          };

          this.setArray = function (ka) {
            this.keyArray = ka;
          };

          this.length = function () {
            return this.keyArray.length;
          };

          this.toString = function () {
            var keyPoolString = "# = " + this.length() + "\n";
            var pool = this.getArray();
            for (var index in pool) {
              var item = pool[index];
              if (
                Bitcoin.Util.hasMethods(item, "getBitcoinAddress", "toString")
              ) {
                if (item != null) {
                  keyPoolString +=
                    '"' +
                    item.getBitcoinAddress() +
                    '"' +
                    ', "' +
                    item.toString("wif") +
                    '"\n';
                }
              }
            }

            return keyPoolString;
          };

          return this;
        };

        return new KeyPool();
      })();

      Bitcoin.Bip38Key = (function () {
        var Bip38 = function (address, encryptedKey) {
          this.address = address;
          this.priv = encryptedKey;
        };

        Bip38.prototype.getBitcoinAddress = function () {
          return this.address;
        };

        Bip38.prototype.toString = function () {
          return this.priv;
        };

        return Bip38;
      })();

      //https://raw.github.com/pointbiz/bitcoinjs-lib/9b2f94a028a7bc9bed94e0722563e9ff1d8e8db8/src/eckey.js
      Bitcoin.ECKey = (function () {
        var ECDSA = Bitcoin.ECDSA;
        var KeyPool = Bitcoin.KeyPool;
        var ecparams = EllipticCurve.getSECCurveByName("secp256k1");

        var ECKey = function (input) {
          if (!input) {
            // Generate new key
            var n = ecparams.getN();
            this.priv = ECDSA.getBigRandom(n);
          } else if (input instanceof BigInteger) {
            // Input is a private key value
            this.priv = input;
          } else if (Bitcoin.Util.isArray(input)) {
            // Prepend zero byte to prevent interpretation as negative integer
            this.priv = BigInteger.fromByteArrayUnsigned(input);
          } else if ("string" == typeof input) {
            var bytes = null;
            try {
              if (ECKey.isWalletImportFormat(input)) {
                bytes = ECKey.decodeWalletImportFormat(input);
              } else if (ECKey.isCompressedWalletImportFormat(input)) {
                bytes = ECKey.decodeCompressedWalletImportFormat(input);
                this.compressed = true;
              } else if (ECKey.isMiniFormat(input)) {
                bytes = Crypto.SHA256(input, { asBytes: true });
              } else if (ECKey.isHexFormat(input)) {
                bytes = Crypto.util.hexToBytes(input);
              } else if (ECKey.isBase64Format(input)) {
                bytes = Crypto.util.base64ToBytes(input);
              }
            } catch (exc1) {
              this.setError(exc1);
            }

            if (ECKey.isBase6Format(input)) {
              this.priv = new BigInteger(input, 6);
            } else if (bytes == null || bytes.length != 32) {
              this.priv = null;
            } else {
              // Prepend zero byte to prevent interpretation as negative integer
              this.priv = BigInteger.fromByteArrayUnsigned(bytes);
            }
          }

          this.compressed =
            this.compressed == undefined
              ? !!ECKey.compressByDefault
              : this.compressed;
          try {
            // check not zero
            if (this.priv != null && BigInteger.ZERO.compareTo(this.priv) == 0)
              this.setError("Error: BigInteger equal to zero.");
            // valid range [0x1, 0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEBAAEDCE6AF48A03BBFD25E8CD0364140])
            var hexKeyRangeLimit =
              "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEBAAEDCE6AF48A03BBFD25E8CD0364140";
            var rangeLimitBytes = Crypto.util.hexToBytes(hexKeyRangeLimit);
            var limitBigInt = BigInteger.fromByteArrayUnsigned(rangeLimitBytes);
            if (this.priv != null && limitBigInt.compareTo(this.priv) < 0)
              this.setError("Error: BigInteger outside of curve range.");

            if (this.priv != null) {
              KeyPool.push(this);
            }
          } catch (exc2) {
            this.setError(exc2);
          }
        };

        ECKey.privateKeyPrefix = 0xad; // mainnet 0x80    testnet 0xEF

        /**
         * Whether public keys should be returned compressed by default.
         */
        ECKey.compressByDefault = false;

        /**
         * Set whether the public key should be returned compressed or not.
         */
        ECKey.prototype.setError = function (err) {
          this.error = err;
          this.priv = null;
          return this;
        };

        /**
         * Set whether the public key should be returned compressed or not.
         */
        ECKey.prototype.setCompressed = function (v) {
          this.compressed = !!v;
          if (this.pubPoint) this.pubPoint.compressed = this.compressed;
          return this;
        };

        /*
         * Return public key as a byte array in DER encoding
         */
        ECKey.prototype.getPub = function () {
          if (this.compressed) {
            if (this.pubComp) return this.pubComp;
            return (this.pubComp = this.getPubPoint().getEncoded(1));
          } else {
            if (this.pubUncomp) return this.pubUncomp;
            return (this.pubUncomp = this.getPubPoint().getEncoded(0));
          }
        };

        /**
         * Return public point as ECPoint object.
         */
        ECKey.prototype.getPubPoint = function () {
          if (!this.pubPoint) {
            this.pubPoint = ecparams.getG().multiply(this.priv);
            this.pubPoint.compressed = this.compressed;
          }
          return this.pubPoint;
        };

        ECKey.prototype.getPubKeyHex = function () {
          if (this.compressed) {
            if (this.pubKeyHexComp) return this.pubKeyHexComp;
            return (this.pubKeyHexComp = Crypto.util
              .bytesToHex(this.getPub())
              .toString()
              .toUpperCase());
          } else {
            if (this.pubKeyHexUncomp) return this.pubKeyHexUncomp;
            return (this.pubKeyHexUncomp = Crypto.util
              .bytesToHex(this.getPub())
              .toString()
              .toUpperCase());
          }
        };

        /**
         * Get the pubKeyHash for this key.
         *
         * This is calculated as RIPE160(SHA256([encoded pubkey])) and returned as
         * a byte array.
         */
        ECKey.prototype.getPubKeyHash = function () {
          if (this.compressed) {
            if (this.pubKeyHashComp) return this.pubKeyHashComp;
            return (this.pubKeyHashComp = Bitcoin.Util.sha256ripe160(
              this.getPub()
            ));
          } else {
            if (this.pubKeyHashUncomp) return this.pubKeyHashUncomp;
            return (this.pubKeyHashUncomp = Bitcoin.Util.sha256ripe160(
              this.getPub()
            ));
          }
        };

        ECKey.prototype.getBitcoinAddress = function () {
          var hash = this.getPubKeyHash();
          var addr = new Bitcoin.Address(hash);
          return addr.toString();
        };

        /*
         * Takes a public point as a hex string or byte array
         */
        ECKey.prototype.setPub = function (pub) {
          // byte array
          if (Bitcoin.Util.isArray(pub)) {
            pub = Crypto.util.bytesToHex(pub).toString().toUpperCase();
          }
          var ecPoint = ecparams.getCurve().decodePointHex(pub);
          this.setCompressed(ecPoint.compressed);
          this.pubPoint = ecPoint;
          return this;
        };

        // Sipa Private Key Wallet Import Format
        ECKey.prototype.getBitcoinWalletImportFormat = function () {
          var bytes = this.getBitcoinPrivateKeyByteArray();
          if (bytes == null) return "";
          bytes.unshift(ECKey.privateKeyPrefix); // prepend 0x80 byte
          if (this.compressed) bytes.push(0x01); // append 0x01 byte for compressed format
          var checksum = Crypto.SHA256(
            Crypto.SHA256(bytes, { asBytes: true }),
            { asBytes: true }
          );
          bytes = bytes.concat(checksum.slice(0, 4));
          var privWif = Bitcoin.Base58.encode(bytes);
          return privWif;
        };

        // Private Key Hex Format
        ECKey.prototype.getBitcoinHexFormat = function () {
          return Crypto.util
            .bytesToHex(this.getBitcoinPrivateKeyByteArray())
            .toString()
            .toUpperCase();
        };

        // Private Key Base64 Format
        ECKey.prototype.getBitcoinBase64Format = function () {
          return Crypto.util.bytesToBase64(
            this.getBitcoinPrivateKeyByteArray()
          );
        };

        ECKey.prototype.getBitcoinPrivateKeyByteArray = function () {
          if (this.priv == null) return null;
          // Get a copy of private key as a byte array
          var bytes = this.priv.toByteArrayUnsigned();
          // zero pad if private key is less than 32 bytes
          while (bytes.length < 32) bytes.unshift(0x00);
          return bytes;
        };

        ECKey.prototype.toString = function (format) {
          format = format || "";
          if (
            format.toString().toLowerCase() == "base64" ||
            format.toString().toLowerCase() == "b64"
          ) {
            return this.getBitcoinBase64Format();
          }
          // Wallet Import Format
          else if (format.toString().toLowerCase() == "wif") {
            return this.getBitcoinWalletImportFormat();
          } else {
            return this.getBitcoinHexFormat();
          }
        };

        ECKey.prototype.sign = function (hash) {
          return ECDSA.sign(hash, this.priv);
        };

        ECKey.prototype.verify = function (hash, sig) {
          return ECDSA.verify(hash, sig, this.getPub());
        };

        /**
         * Parse a wallet import format private key contained in a string.
         */
        ECKey.decodeWalletImportFormat = function (privStr) {
          var bytes = Bitcoin.Base58.decode(privStr);
          var hash = bytes.slice(0, 33);
          var checksum = Crypto.SHA256(Crypto.SHA256(hash, { asBytes: true }), {
            asBytes: true,
          });
          if (
            checksum[0] != bytes[33] ||
            checksum[1] != bytes[34] ||
            checksum[2] != bytes[35] ||
            checksum[3] != bytes[36]
          ) {
            throw "Checksum validation failed!";
          }
          var version = hash.shift();
          if (version != ECKey.privateKeyPrefix) {
            throw "Version " + version + " not supported!";
          }
          return hash;
        };

        /**
         * Parse a compressed wallet import format private key contained in a string.
         */
        ECKey.decodeCompressedWalletImportFormat = function (privStr) {
          var bytes = Bitcoin.Base58.decode(privStr);
          var hash = bytes.slice(0, 34);
          var checksum = Crypto.SHA256(Crypto.SHA256(hash, { asBytes: true }), {
            asBytes: true,
          });
          if (
            checksum[0] != bytes[34] ||
            checksum[1] != bytes[35] ||
            checksum[2] != bytes[36] ||
            checksum[3] != bytes[37]
          ) {
            throw "Checksum validation failed!";
          }
          var version = hash.shift();
          if (version != ECKey.privateKeyPrefix) {
            throw "Version " + version + " not supported!";
          }
          hash.pop();
          return hash;
        };

        // 64 characters [0-9A-F]
        ECKey.isHexFormat = function (key) {
          key = key.toString();
          return /^[A-Fa-f0-9]{64}$/.test(key);
        };

        // 51 characters base58, always starts with a '5'
        ECKey.isWalletImportFormat = function (key) {
          key = key.toString();
          return ECKey.privateKeyPrefix == 0xad
            ? /^5[123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz]{50}$/.test(
                key
              )
            : /^9[123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz]{50}$/.test(
                key
              );
        };

        // 52 characters base58
        ECKey.isCompressedWalletImportFormat = function (key) {
          key = key.toString();
          return ECKey.privateKeyPrefix == 0xad
            ? /^[LK][123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz]{51}$/.test(
                key
              )
            : /^c[123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz]{51}$/.test(
                key
              );
        };

        // 44 characters
        ECKey.isBase64Format = function (key) {
          key = key.toString();
          return /^[ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789=+\/]{44}$/.test(
            key
          );
        };

        // 99 characters, 1=1, if using dice convert 6 to 0
        ECKey.isBase6Format = function (key) {
          key = key.toString();
          return /^[012345]{99}$/.test(key);
        };

        // 22, 26 or 30 characters, always starts with an 'S'
        ECKey.isMiniFormat = function (key) {
          key = key.toString();
          var validChars22 =
            /^S[123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz]{21}$/.test(
              key
            );
          var validChars26 =
            /^S[123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz]{25}$/.test(
              key
            );
          var validChars30 =
            /^S[123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz]{29}$/.test(
              key
            );
          var testBytes = Crypto.SHA256(key + "?", { asBytes: true });

          return (
            (testBytes[0] === 0x00 || testBytes[0] === 0x01) &&
            (validChars22 || validChars26 || validChars30)
          );
        };

        return ECKey;
      })();
    


      //https://raw.github.com/bitcoinjs/bitcoinjs-lib/09e8c6e184d6501a0c2c59d73ca64db5c0d3eb95/src/util.js
      // Bitcoin utility functions
      Bitcoin.Util = {
        /**
         * Cross-browser compatibility version of Array.isArray.
         */
        isArray:
          Array.isArray ||
          function (o) {
            return Object.prototype.toString.call(o) === "[object Array]";
          },
        /**
         * Create an array of a certain length filled with a specific value.
         */
        makeFilledArray: function (len, val) {
          var array = [];
          var i = 0;
          while (i < len) {
            array[i++] = val;
          }
          return array;
        },
        /**
         * Turn an integer into a "var_int".
         *
         * "var_int" is a variable length integer used by Bitcoin's binary format.
         *
         * Returns a byte array.
         */
        numToVarInt: function (i) {
          if (i < 0xfd) {
            // unsigned char
            return [i];
          } else if (i <= 1 << 16) {
            // unsigned short (LE)
            return [0xfd, i >>> 8, i & 255];
          } else if (i <= 1 << 32) {
            // unsigned int (LE)
            return [0xfe].concat(Crypto.util.wordsToBytes([i]));
          } else {
            // unsigned long long (LE)
            return [0xff].concat(Crypto.util.wordsToBytes([i >>> 32, i]));
          }
        },
        /**
         * Parse a Bitcoin value byte array, returning a BigInteger.
         */
        valueToBigInt: function (valueBuffer) {
          if (valueBuffer instanceof BigInteger) return valueBuffer;

          // Prepend zero byte to prevent interpretation as negative integer
          return BigInteger.fromByteArrayUnsigned(valueBuffer);
        },
        /**
         * Format a Bitcoin value as a string.
         *
         * Takes a BigInteger or byte-array and returns that amount of Bitcoins in a
         * nice standard formatting.
         *
         * Examples:
         * 12.3555
         * 0.1234
         * 900.99998888
         * 34.00
         */
        formatValue: function (valueBuffer) {
          var value = this.valueToBigInt(valueBuffer).toString();
          var integerPart =
            value.length > 8 ? value.substr(0, value.length - 8) : "0";
          var decimalPart =
            value.length > 8 ? value.substr(value.length - 8) : value;
          while (decimalPart.length < 8) decimalPart = "0" + decimalPart;
          decimalPart = decimalPart.replace(/0*$/, "");
          while (decimalPart.length < 2) decimalPart += "0";
          return integerPart + "." + decimalPart;
        },
        /**
         * Parse a floating point string as a Bitcoin value.
         *
         * Keep in mind that parsing user input is messy. You should always display
         * the parsed value back to the user to make sure we understood his input
         * correctly.
         */
        parseValue: function (valueString) {
          // TODO: Detect other number formats (e.g. comma as decimal separator)
          var valueComp = valueString.split(".");
          var integralPart = valueComp[0];
          var fractionalPart = valueComp[1] || "0";
          while (fractionalPart.length < 8) fractionalPart += "0";
          fractionalPart = fractionalPart.replace(/^0+/g, "");
          var value = BigInteger.valueOf(parseInt(integralPart));
          value = value.multiply(BigInteger.valueOf(100000000));
          value = value.add(BigInteger.valueOf(parseInt(fractionalPart)));
          return value;
        },
        /**
         * Calculate RIPEMD160(SHA256(data)).
         *
         * Takes an arbitrary byte array as inputs and returns the hash as a byte
         * array.
         */
        sha256ripe160: function (data) {
          return Crypto.RIPEMD160(Crypto.SHA256(data, { asBytes: true }), {
            asBytes: true,
          });
        },
        // double sha256
        dsha256: function (data) {
          return Crypto.SHA256(Crypto.SHA256(data, { asBytes: true }), {
            asBytes: true,
          });
        },
        // duck typing method
        hasMethods: function (obj /*, method list as strings */) {
          var i = 1,
            methodName;
          while ((methodName = arguments[i++])) {
            if (typeof obj[methodName] != "function") {
              return false;
            }
          }
          return true;
        },
      };
    


      /*
       * Copyright (c) 2010-2011 Intalio Pte, All Rights Reserved
       *
       * Permission is hereby granted, free of charge, to any person obtaining a copy
       * of this software and associated documentation files (the "Software"), to deal
       * in the Software without restriction, including without limitation the rights
       * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
       * copies of the Software, and to permit persons to whom the Software is
       * furnished to do so, subject to the following conditions:
       *
       * The above copyright notice and this permission notice shall be included in
       * all copies or substantial portions of the Software.
       *
       * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
       * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
       * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
       * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
       * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
       * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
       * THE SOFTWARE.
       */
      // https://github.com/cheongwy/node-scrypt-js
      (function () {
        var MAX_VALUE = 2147483647;
        var workerUrl = null;

        //function scrypt(byte[] passwd, byte[] salt, int N, int r, int p, int dkLen)
        /*
         * N = Cpu cost
         * r = Memory cost
         * p = parallelization cost
         *
         */
        window.Crypto_scrypt = function (
          passwd,
          salt,
          N,
          r,
          p,
          dkLen,
          callback
        ) {
          if (N == 0 || (N & (N - 1)) != 0)
            throw Error("N must be > 0 and a power of 2");

          if (N > MAX_VALUE / 128 / r) throw Error("Parameter N is too large");
          if (r > MAX_VALUE / 128 / p) throw Error("Parameter r is too large");

          var PBKDF2_opts = {
            iterations: 1,
            hasher: Crypto.SHA256,
            asBytes: true,
          };

          var B = Crypto.PBKDF2(passwd, salt, p * 128 * r, PBKDF2_opts);

          try {
            var i = 0;
            var worksDone = 0;
            var makeWorker = function () {
              if (!workerUrl) {
                var code = "(" + scryptCore.toString() + ")()";
                var blob;
                try {
                  blob = new Blob([code], { type: "text/javascript" });
                } catch (e) {
                  window.BlobBuilder =
                    window.BlobBuilder ||
                    window.WebKitBlobBuilder ||
                    window.MozBlobBuilder ||
                    window.MSBlobBuilder;
                  blob = new BlobBuilder();
                  blob.append(code);
                  blob = blob.getBlob("text/javascript");
                }
                workerUrl = URL.createObjectURL(blob);
              }
              var worker = new Worker(workerUrl);
              worker.onmessage = function (event) {
                var Bi = event.data[0],
                  Bslice = event.data[1];
                worksDone++;

                if (i < p) {
                  worker.postMessage([N, r, p, B, i++]);
                }

                var length = Bslice.length,
                  destPos = Bi * 128 * r,
                  srcPos = 0;
                while (length--) {
                  B[destPos++] = Bslice[srcPos++];
                }

                if (worksDone == p) {
                  callback(Crypto.PBKDF2(passwd, B, dkLen, PBKDF2_opts));
                }
              };
              return worker;
            };
            var workers = [makeWorker(), makeWorker()];
            workers[0].postMessage([N, r, p, B, i++]);
            if (p > 1) {
              workers[1].postMessage([N, r, p, B, i++]);
            }
          } catch (e) {
            window.setTimeout(function () {
              scryptCore();
              callback(Crypto.PBKDF2(passwd, B, dkLen, PBKDF2_opts));
            }, 0);
          }

          // using this function to enclose everything needed to create a worker (but also invokable directly for synchronous use)
          function scryptCore() {
            var XY = [],
              V = [];

            if (typeof B === "undefined") {
              onmessage = function (event) {
                var data = event.data;
                var N = data[0],
                  r = data[1],
                  p = data[2],
                  B = data[3],
                  i = data[4];

                var Bslice = [];
                arraycopy32(B, i * 128 * r, Bslice, 0, 128 * r);
                smix(Bslice, 0, r, N, V, XY);

                postMessage([i, Bslice]);
              };
            } else {
              for (var i = 0; i < p; i++) {
                smix(B, i * 128 * r, r, N, V, XY);
              }
            }

            function smix(B, Bi, r, N, V, XY) {
              var Xi = 0;
              var Yi = 128 * r;
              var i;

              arraycopy32(B, Bi, XY, Xi, Yi);

              for (i = 0; i < N; i++) {
                arraycopy32(XY, Xi, V, i * Yi, Yi);
                blockmix_salsa8(XY, Xi, Yi, r);
              }

              for (i = 0; i < N; i++) {
                var j = integerify(XY, Xi, r) & (N - 1);
                blockxor(V, j * Yi, XY, Xi, Yi);
                blockmix_salsa8(XY, Xi, Yi, r);
              }

              arraycopy32(XY, Xi, B, Bi, Yi);
            }

            function blockmix_salsa8(BY, Bi, Yi, r) {
              var X = [];
              var i;

              arraycopy32(BY, Bi + (2 * r - 1) * 64, X, 0, 64);

              for (i = 0; i < 2 * r; i++) {
                blockxor(BY, i * 64, X, 0, 64);
                salsa20_8(X);
                arraycopy32(X, 0, BY, Yi + i * 64, 64);
              }

              for (i = 0; i < r; i++) {
                arraycopy32(BY, Yi + i * 2 * 64, BY, Bi + i * 64, 64);
              }

              for (i = 0; i < r; i++) {
                arraycopy32(
                  BY,
                  Yi + (i * 2 + 1) * 64,
                  BY,
                  Bi + (i + r) * 64,
                  64
                );
              }
            }

            function R(a, b) {
              return (a << b) | (a >>> (32 - b));
            }

            function salsa20_8(B) {
              var B32 = new Array(32);
              var x = new Array(32);
              var i;

              for (i = 0; i < 16; i++) {
                B32[i] = (B[i * 4 + 0] & 0xff) << 0;
                B32[i] |= (B[i * 4 + 1] & 0xff) << 8;
                B32[i] |= (B[i * 4 + 2] & 0xff) << 16;
                B32[i] |= (B[i * 4 + 3] & 0xff) << 24;
              }

              arraycopy(B32, 0, x, 0, 16);

              for (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) B32[i] = x[i] + B32[i];

              for (i = 0; i < 16; i++) {
                var bi = i * 4;
                B[bi + 0] = (B32[i] >> 0) & 0xff;
                B[bi + 1] = (B32[i] >> 8) & 0xff;
                B[bi + 2] = (B32[i] >> 16) & 0xff;
                B[bi + 3] = (B32[i] >> 24) & 0xff;
              }
            }

            function blockxor(S, Si, D, Di, len) {
              var i = len >> 6;
              while (i--) {
                D[Di++] ^= S[Si++];
                D[Di++] ^= S[Si++];
                D[Di++] ^= S[Si++];
                D[Di++] ^= S[Si++];
                D[Di++] ^= S[Si++];
                D[Di++] ^= S[Si++];
                D[Di++] ^= S[Si++];
                D[Di++] ^= S[Si++];

                D[Di++] ^= S[Si++];
                D[Di++] ^= S[Si++];
                D[Di++] ^= S[Si++];
                D[Di++] ^= S[Si++];
                D[Di++] ^= S[Si++];
                D[Di++] ^= S[Si++];
                D[Di++] ^= S[Si++];
                D[Di++] ^= S[Si++];

                D[Di++] ^= S[Si++];
                D[Di++] ^= S[Si++];
                D[Di++] ^= S[Si++];
                D[Di++] ^= S[Si++];
                D[Di++] ^= S[Si++];
                D[Di++] ^= S[Si++];
                D[Di++] ^= S[Si++];
                D[Di++] ^= S[Si++];

                D[Di++] ^= S[Si++];
                D[Di++] ^= S[Si++];
                D[Di++] ^= S[Si++];
                D[Di++] ^= S[Si++];
                D[Di++] ^= S[Si++];
                D[Di++] ^= S[Si++];
                D[Di++] ^= S[Si++];
                D[Di++] ^= S[Si++];

                D[Di++] ^= S[Si++];
                D[Di++] ^= S[Si++];
                D[Di++] ^= S[Si++];
                D[Di++] ^= S[Si++];
                D[Di++] ^= S[Si++];
                D[Di++] ^= S[Si++];
                D[Di++] ^= S[Si++];
                D[Di++] ^= S[Si++];

                D[Di++] ^= S[Si++];
                D[Di++] ^= S[Si++];
                D[Di++] ^= S[Si++];
                D[Di++] ^= S[Si++];
                D[Di++] ^= S[Si++];
                D[Di++] ^= S[Si++];
                D[Di++] ^= S[Si++];
                D[Di++] ^= S[Si++];

                D[Di++] ^= S[Si++];
                D[Di++] ^= S[Si++];
                D[Di++] ^= S[Si++];
                D[Di++] ^= S[Si++];
                D[Di++] ^= S[Si++];
                D[Di++] ^= S[Si++];
                D[Di++] ^= S[Si++];
                D[Di++] ^= S[Si++];

                D[Di++] ^= S[Si++];
                D[Di++] ^= S[Si++];
                D[Di++] ^= S[Si++];
                D[Di++] ^= S[Si++];
                D[Di++] ^= S[Si++];
                D[Di++] ^= S[Si++];
                D[Di++] ^= S[Si++];
                D[Di++] ^= S[Si++];
              }
            }

            function integerify(B, bi, r) {
              var n;

              bi += (2 * r - 1) * 64;

              n = (B[bi + 0] & 0xff) << 0;
              n |= (B[bi + 1] & 0xff) << 8;
              n |= (B[bi + 2] & 0xff) << 16;
              n |= (B[bi + 3] & 0xff) << 24;

              return n;
            }

            function arraycopy(src, srcPos, dest, destPos, length) {
              while (length--) {
                dest[destPos++] = src[srcPos++];
              }
            }

            function arraycopy32(src, srcPos, dest, destPos, length) {
              var i = length >> 5;
              while (i--) {
                dest[destPos++] = src[srcPos++];
                dest[destPos++] = src[srcPos++];
                dest[destPos++] = src[srcPos++];
                dest[destPos++] = src[srcPos++];
                dest[destPos++] = src[srcPos++];
                dest[destPos++] = src[srcPos++];
                dest[destPos++] = src[srcPos++];
                dest[destPos++] = src[srcPos++];

                dest[destPos++] = src[srcPos++];
                dest[destPos++] = src[srcPos++];
                dest[destPos++] = src[srcPos++];
                dest[destPos++] = src[srcPos++];
                dest[destPos++] = src[srcPos++];
                dest[destPos++] = src[srcPos++];
                dest[destPos++] = src[srcPos++];
                dest[destPos++] = src[srcPos++];

                dest[destPos++] = src[srcPos++];
                dest[destPos++] = src[srcPos++];
                dest[destPos++] = src[srcPos++];
                dest[destPos++] = src[srcPos++];
                dest[destPos++] = src[srcPos++];
                dest[destPos++] = src[srcPos++];
                dest[destPos++] = src[srcPos++];
                dest[destPos++] = src[srcPos++];

                dest[destPos++] = src[srcPos++];
                dest[destPos++] = src[srcPos++];
                dest[destPos++] = src[srcPos++];
                dest[destPos++] = src[srcPos++];
                dest[destPos++] = src[srcPos++];
                dest[destPos++] = src[srcPos++];
                dest[destPos++] = src[srcPos++];
                dest[destPos++] = src[srcPos++];
              }
            }
          } // scryptCore
        }; // window.Crypto_scrypt
      })();
    


      ninja.seeder = {
        init: (function () {
          document.getElementById("generatekeyinput").value = "";
        })(),

        // number of mouse movements to wait for
        seedLimit: (function () {
          var num = Crypto.util.randomBytes(12)[11];
          return 200 + Math.floor(num);
        })(),

        seedCount: 0, // counter
        lastInputTime: new Date().getTime(),
        seedPoints: [],
        isStillSeeding: true,
        seederDependentWallets: [
          "singlewallet",
          "paperwallet",
          "bulkwallet",
          "vanitywallet",
          "splitwallet",
        ],

        // seed function exists to wait for mouse movement to add more entropy before generating an address
        seed: function (evt) {
          if (!evt) var evt = window.event;
          var timeStamp = new Date().getTime();
          // seeding is over now we generate and display the address
          if (ninja.seeder.seedCount == ninja.seeder.seedLimit) {
            ninja.seeder.seedCount++;
            ninja.seeder.seedingOver();
          }
          // seed mouse position X and Y when mouse movements are greater than 40ms apart.
          else if (
            ninja.seeder.seedCount < ninja.seeder.seedLimit &&
            evt &&
            timeStamp - ninja.seeder.lastInputTime > 40
          ) {
            SecureRandom.seedTime();
            SecureRandom.seedInt16(evt.clientX * evt.clientY);
            ninja.seeder.showPoint(evt.clientX, evt.clientY);
            ninja.seeder.seedCount++;
            ninja.seeder.lastInputTime = new Date().getTime();
            ninja.seeder.showPool();
          }
        },

        // seed function exists to wait for mouse movement to add more entropy before generating an address
        seedKeyPress: function (evt) {
          if (!evt) var evt = window.event;
          // seeding is over now we generate and display the address
          if (ninja.seeder.seedCount == ninja.seeder.seedLimit) {
            ninja.seeder.seedCount++;
            ninja.seeder.seedingOver();
          }
          // seed key press character
          else if (
            ninja.seeder.seedCount < ninja.seeder.seedLimit &&
            evt.which
          ) {
            var timeStamp = new Date().getTime();
            // seed a bunch (minimum seedLimit) of times
            SecureRandom.seedTime();
            SecureRandom.seedInt8(evt.which);
            var keyPressTimeDiff = timeStamp - ninja.seeder.lastInputTime;
            SecureRandom.seedInt8(keyPressTimeDiff);
            ninja.seeder.seedCount++;
            ninja.seeder.lastInputTime = new Date().getTime();
            ninja.seeder.showPool();
          }
        },

        showPool: function () {
          var poolHex;
          if (SecureRandom.poolCopyOnInit != null) {
            poolHex = Crypto.util.bytesToHex(SecureRandom.poolCopyOnInit);
            document.getElementById("seedpool").innerHTML = poolHex;
            document.getElementById("seedpooldisplay").innerHTML = poolHex;
          } else {
            poolHex = Crypto.util.bytesToHex(SecureRandom.pool);
            document.getElementById("seedpool").innerHTML = poolHex;
            document.getElementById("seedpooldisplay").innerHTML = poolHex;
          }
          var percentSeeded =
            Math.round(
              (ninja.seeder.seedCount / ninja.seeder.seedLimit) * 100
            ) + "%";
          document.getElementById("mousemovelimit").innerHTML = percentSeeded;
          for (var wIndex in ninja.seeder.seederDependentWallets) {
            document.getElementById(
              ninja.seeder.seederDependentWallets[wIndex]
            ).innerHTML = percentSeeded;
          }
        },

        showPoint: function (x, y) {
          var div = document.createElement("div");
          div.setAttribute("class", "seedpoint");
          div.style.top = y + "px";
          div.style.left = x + "px";
          document.body.appendChild(div);
          ninja.seeder.seedPoints.push(div);
        },

        removePoints: function () {
          for (var i = 0; i < ninja.seeder.seedPoints.length; i++) {
            document.body.removeChild(ninja.seeder.seedPoints[i]);
          }
          ninja.seeder.seedPoints = [];
        },

        seedingOver: function () {
          ninja.seeder.isStillSeeding = false;
          // run sync unit tests
          ninja.status.unitTests();
          // open selected tab
          var walletType = ninja.tab.whichIsOpen();
          if (walletType == null) {
            ninja.tab.select("singlewallet");
          } else {
            ninja.tab.select(walletType);
          }
          document.getElementById("generate").style.display = "none";
          // update labels for dependent wallets
          var culture =
            ninja.getQueryString()["culture"] == null
              ? "en"
              : ninja.getQueryString()["culture"];
          ninja.translator.translate(culture);
          ninja.seeder.removePoints();
        },
      };
    


      (function (ninja) {
        var translator = (ninja.translator = {
          currentCulture: "en",

          autoDetectTranslation: function () {
            // window.navigator.language for F


      ninja.wallets.paperwallet = {
        isOpen: function () {
          return (
            document
              .getElementById("paperwallet")
              .className.indexOf("selected") != 


      ninja.wallets.vanitywallet = {
        isOpen: function () {
          return (
            document
              .getElementById("vanitywallet")
              .className.indexOf("selected") != -1
          );
        },

        open: function () {
          document.getElementById("vanityarea").style.display = "block";
        },

        close: function () {
          document.getElementById("vanityarea").style.display = "none";
          document.getElementById("vanitystep1area").style.display = "none";
          document.getElementById("vanitystep2area").style.display = "none";
          document
            .getElementById("vanitystep1icon")
            .setAttribute("class", "more");
          document
            .getElementById("vanitystep2icon")
            .setAttribute("class", "more");
        },

        generateKeyPair: function () {
          var key = new Bitcoin.ECKey(false);
          var publicKey = key.getPubKeyHex();
          var privateKey = key.getBitcoinHexFormat();
          document.getElementById("vanitypubkey").innerHTML = publicKey;
          document.getElementById("vanityprivatekey").innerHTML = privateKey;
          document.getElementById("vanityarea").style.display = "block";
          document.getElementById("vanitystep1area").style.display = "none";
        },

        addKeys: function () {
          var privateKeyWif = ninja.translator.get(
            "vanityinvalidinputcouldnotcombinekeys"
          );
          var bitcoinAddress = ninja.translator.get(
            "vanityinvalidinputcouldnotcombinekeys"
          );
          var publicKeyHex = ninja.translator.get(
            "vanityinvalidinputcouldnotcombinekeys"
          );
          try {
            var input1KeyString = document.getElementById("vanityinput1").value;
            var input2KeyString = document.getElementById("vanityinput2").value;

            // both inputs are public keys
            if (
              ninja.publicKey.isPublicKeyHexFormat(input1KeyString) &&
              ninja.publicKey.isPublicKeyHexFormat(input2KeyString)
            ) {
              // add both public keys together
              if (document.getElementById("vanityradioadd").checked) {
                var pubKeyByteArray = ninja.publicKey.getByteArrayFromAdding(
                  input1KeyString,
                  input2KeyString
                );
                if (pubKeyByteArray == null) {
                  alert(
                    ninja.translator.get(
                      "vanityalertinvalidinputpublickeysmatch"
                    )
                  );
                } else {
                  privateKeyWif = ninja.translator.get(
                    "vanityprivatekeyonlyavailable"
                  );
                  bitcoinAddress =
                    ninja.publicKey.getBitcoinAddressFromByteArray(
                      pubKeyByteArray
                    );
                  publicKeyHex =
                    ninja.publicKey.getHexFromByteArray(pubKeyByteArray);
                }
              } else {
                alert(
                  ninja.translator.get("vanityalertinvalidinputcannotmultiple")
                );
              }
            }
            // one public key and one private key
            else if (
              (ninja.publicKey.isPublicKeyHexFormat(input1KeyString) &&
                ninja.privateKey.isPrivateKey(input2KeyString)) ||
              (ninja.publicKey.isPublicKeyHexFormat(input2KeyString) &&
                ninja.privateKey.isPrivateKey(input1KeyString))
            ) {
              privateKeyWif = ninja.translator.get(
                "vanityprivatekeyonlyavailable"
              );
              var pubKeyHex = ninja.publicKey.isPublicKeyHexFormat(
                input1KeyString
              )
                ? input1KeyString
                : input2KeyString;
              var ecKey = ninja.privateKey.isPrivateKey(input1KeyString)
                ? new Bitcoin.ECKey(input1KeyString)
                : new Bitcoin.ECKey(input2KeyString);
              // add
              if (document.getElementById("vanityradioadd").checked) {
                var pubKeyCombined = ninja.publicKey.getByteArrayFromAdding(
                  pubKeyHex,
                  ecKey.getPubKeyHex()
                );
              }
              // multiply
              else {
                var pubKeyCombined =
                  ninja.publicKey.getByteArrayFromMultiplying(pubKeyHex, ecKey);
              }
              if (pubKeyCombined == null) {
                alert(
                  ninja.translator.get("vanityalertinvalidinputpublickeysmatch")
                );
              } else {
                bitcoinAddress =
                  ninja.publicKey.getBitcoinAddressFromByteArray(
                    pubKeyCombined
                  );
                publicKeyHex =
                  ninja.publicKey.getHexFromByteArray(pubKeyCombined);
              }
            }
            // both inputs are private keys
            else if (
              ninja.privateKey.isPrivateKey(input1KeyString) &&
              ninja.privateKey.isPrivateKey(input2KeyString)
            ) {
              var combinedPrivateKey;
              // add both private keys together
              if (document.getElementById("vanityradioadd").checked) {
                combinedPrivateKey = ninja.privateKey.getECKeyFromAdding(
                  input1KeyString,
                  input2KeyString
                );
              }
              // multiply both private keys together
              else {
                combinedPrivateKey = ninja.privateKey.getECKeyFromMultiplying(
                  input1KeyString,
                  input2KeyString
                );
              }
              if (combinedPrivateKey == null) {
                alert(
                  ninja.translator.get(
                    "vanityalertinvalidinputprivatekeysmatch"
                  )
                );
              } else {
                bitcoinAddress = combinedPrivateKey.getBitcoinAddress();
                privateKeyWif =
                  combinedPrivateKey.getBitcoinWalletImportFormat();
                publicKeyHex = combinedPrivateKey.getPubKeyHex();
              }
            }
          } catch (e) {
            alert(e);
          }
          document.getElementById("vanityprivatekeywif").innerHTML =
            privateKeyWif;
          document.getElementById("vanityaddress").innerHTML = bitcoinAddress;
          document.getElementById("vanitypublickeyhex").innerHTML =
            publicKeyHex;
          document.getElementById("vanitystep2area").style.display = "block";
          document
            .getElementById("vanitystep2icon")
            .setAttribute("class", "less");
        },

        openCloseStep: function (num) {
          // do close
          if (
            document.getElementById("vanitystep" + num + "area").style
              .display == "block"
          ) {
            document.getElementById("vanitystep" + num + "area").style.display =
              "none";
            document
              .getElementById("vanitystep" + num + "icon")
              .setAttribute("class", "more");
          }
          // do open
          else {
            document.getElementById("vanitystep" + num + "area").style.display =
              "block";
            document
              .getElementById("vanitystep" + num + "icon")
              .setAttribute("class", "less");
          }
        },
      };
    


      ninja.wallets.splitwallet = {
        isOpen: function () {
          return (
            document
              .getElementById("splitwallet")
              .className.indexOf("selected") != -1
          );
        },

        open: function () {
          document.getElementById("splitarea").style.display = "block";
          secrets.setRNG();
          secrets.init(7); // 7 bits allows for up to 127 shares
        },

        close: function () {
          document.getElementById("splitarea").style.display = "none";
        },

        mkOutputRow: function (s, id, lbltxt) {
          var row = document.createElement("div");
          var label = document.createElement("label");
          label.innerHTML = lbltxt;
          var qr = document.createElement("div");
          var output = document.createElement("span");
          output.setAttribute("class", "output");
          output.innerHTML = s;

          qr.setAttribute("id", id);
          row.setAttribute("class", "splitsharerow");
          row.appendChild(label);
          row.appendChild(output);
          row.appendChild(qr);
          row.appendChild(document.createElement("br"));

          return row;
        },

        stripLeadZeros: function (hex) {
          return hex.split(/^0+/).slice(-1)[0];
        },

        hexToBytes: function (hex) {
          //if input has odd number of digits, pad it
          if (hex.length % 2 == 1) hex = "0" + hex;
          for (var bytes = [], c = 0; c < hex.length; c += 2)
            bytes.push(parseInt(hex.substr(c, 2), 16));
          return bytes;
        },

        // Split a private key and update information in the HTML
        splitKey: function () {
          try {
            var numshares = parseInt(
              document.getElementById("splitshares").value
            );
            var threshold = parseInt(
              document.getElementById("splitthreshold").value
            );
            var key = new Bitcoin.ECKey(false);
            var bitcoinAddress = key.getBitcoinAddress();
            var shares = ninja.wallets.splitwallet.getFormattedShares(
              key.getBitcoinHexFormat(),
              numshares,
              threshold
            );

            var output = document.createElement("div");
            output.setAttribute("id", "splitoutput");
            var m = {};
            output.appendChild(
              this.mkOutputRow(
                bitcoinAddress,
                "split_addr",
                "Lynx Address:    "
              )
            );
            m["split_addr"] = bitcoinAddress;

            for (var i = 0; i < shares.length; i++) {
              var id = "split_qr_" + i;
              output.appendChild(
                this.mkOutputRow(
                  shares[i],
                  id,
                  "Share " + (i + 1) + ":          "
                )
              );
              m[id] = shares[i];
            }

            document.getElementById("splitstep1area").innerHTML =
              output.innerHTML;
            ninja.qrCode.showQrCode(m);

            document.getElementById("splitstep1area").style.display = "block";
            document
              .getElementById("splitstep1icon")
              .setAttribute("class", "less");
          } catch (e) {
            // browser does not have sufficient JavaScript support to generate a bitcoin address
            alert(e);
          }
        },

        // Combine shares of a private key to retrieve the key
        combineShares: function () {
          try {
            document.getElementById("combinedprivatekey").innerHTML = "";
            var shares = document
              .getElementById("combineinput")
              .value.trim()
              .split(/\W+/);
            var combinedBytes =
              ninja.wallets.splitwallet.combineFormattedShares(shares);
            var privkeyBase58 = new Bitcoin.ECKey(
              combinedBytes
            ).getBitcoinWalletImportFormat();
            document.getElementById("combinedprivatekey").innerHTML =
              privkeyBase58;
          } catch (e) {
            alert(e);
          }
        },

        // generate shares and format them in base58
        getFormattedShares: function (key, numshares, threshold) {
          var shares = secrets
            .share(key, numshares, threshold)
            .map(ninja.wallets.splitwallet.hexToBytes)
            .map(Bitcoin.Base58.encode);
          return shares;
        },

        // combine base58 formatted shares and return a bitcoin byte array
        combineFormattedShares: function (shares) {
          var combined = secrets.combine(
            shares
              .map(Bitcoin.Base58.decode)
              .map(Crypto.util.bytesToHex)
              .map(ninja.wallets.splitwallet.stripLeadZeros)
          );
          return ninja.wallets.splitwallet.hexToBytes(combined);
        },

        openCloseStep: function (num) {
          // do close
          if (
            document.getElementById("splitstep" + num + "area").style.display ==
            "block"
          ) {
            document.getElementById("splitstep" + num + "area").style.display =
              "none";
            document
              .getElementById("splitstep" + num + "icon")
              .setAttribute("class", "more");
          }
          // do open
          else {
            document.getElementById("splitstep" + num + "area").style.display =
              "block";
            document
              .getElementById("splitstep" + num + "icon")
              .setAttribute("class", "less");
          }
        },
      };
    


      // run unit tests
      if (
        ninja.getQueryString()["unittests"] == "true" ||
        ninja.getQueryString()["unittests"] == "1"
      ) {
        ninja.unitTests.runSynchronousTests(true);
        ninja.translator.showEnglishJson();
      }
      // run async unit tests
      if (
        ninja.getQueryString()["asyncunittests"] == "true" ||
        ninja.getQueryString()["asyncunittests"] == "1"
      ) {
        ninja.unitTests.runAsynchronousTests(true);
      }
      // change language
      ninja.translator.extractEnglishFromDomAndUpdateDictionary();
      if (ninja.getQueryString()["culture"] != undefined) {
        ninja.translator.translate(ninja.getQueryString()["culture"]);
      } else {
        ninja.translator.autoDetectTranslation();
      }
      // testnet, check if testnet edition should be activated
      if (
        ninja.getQueryString()["testnet"] == "true" ||
        ninja.getQueryString()["testnet"] == "1"
      ) {
        document.getElementById("testnet").innerHTML = ninja.translator.get(
          "testneteditionactivated"
        );
        document.getElementById("testnet").style.display = "block";
        document.getElementById("detailwifprefix").innerHTML = "'9'";
        document.getElementById("detailcompwifprefix").innerHTML = "'c'";
        Bitcoin.Address.networkVersion = 0x6f; // testnet
        Bitcoin.ECKey.privateKeyPrefix = 0xef; // testnet
        ninja.testnetMode = true;
      }
      if (
        ninja.getQueryString()["showseedpool"] == "true" ||
        ninja.getQueryString()["showseedpool"] == "1"
      ) {
        document.getElementById("seedpoolarea").style.display = "block";
      }
    

Requests	IP Address	Location	AS Autonomous System
4	188.114.96.3	United States	AS13335Cloudflare, Inc.
4	1	-	-

Security Scan Report: getlynx-paper.pages.dev

Summary

AI Security Verdict

Moderate Risk

Risk Factors

Safety Factors

Details

Screenshot

Page Load Overview

Language Analysis

Primary Language

Detection Details

Website Classification

Primary Category

All Detected Categories

Detected Features

Domain & IP Information

Detected Technologies3

Content Similarity HashesFor malware variant detection

TLSH (Trend Micro Locality Sensitive Hash)

ssdeep (Context Triggered Piecewise Hashing)

sdhash (Similarity Digest Hashing)

Image Hashes

Perceptual Hashes

Other Hashes

Scan History