From 0627a65d784e9a4a480039540515a03630f5ba87 Mon Sep 17 00:00:00 2001
From: Abhishek Sinha <avishkarabhishek786@gmail.com>
Date: Wed, 11 Dec 2019 15:52:21 +0530
Subject: [PATCH] initial app status

---
 blockchainCloud_client.html | 7626 +++++++++++++++++++++++++++++++++++
 1 file changed, 7626 insertions(+)
 create mode 100644 blockchainCloud_client.html
diff --git a/blockchainCloud_client.html b/blockchainCloud_client.html
new file mode 100644
index 0000000..34bc144
--- /dev/null
+++ b/blockchainCloud_client.html
@@ -0,0 +1,7626 @@
+<!DOCTYPE html>
+<html>
+
+<head>
+  <title>Content Collaboration</title>
+  <meta name="viewport" content="width=device-width, initial-scale=1">
+  <!-- Bootstrap CSS -->
+    <link rel="stylesheet" href="https://stackpath.bootstrapcdn.com/bootstrap/4.1.3/css/bootstrap.min.css" integrity="sha384-MCw98/SFnGE8fJT3GXwEOngsV7Zt27NXFoaoApmYm81iuXoPkFOJwJ8ERdknLPMO" crossorigin="anonymous">
+
+    <style>
+        html, body {
+          padding: 0;
+          position: absolute;
+          left: 0;
+          right: 0;
+          font-size: 20px;
+        }
+
+        body {
+            background-color: #000000;
+        }
+
+        .margin-15 {
+            margin: 15px 15px;
+        }
+
+        .padding-8 {
+            padding: 8px 8px;   
+        }
+
+        .gallery {
+          position: relative;
+          /*max-width: 800px;*/
+          padding: 0 10;
+          margin-bottom: 50px;
+        }
+
+        .gallery_scroller {
+           /* snap mandatory on horizontal axis  */
+          scroll-snap-type: x mandatory;
+
+          overflow-x: scroll;
+          overflow-y: hidden;
+
+          display: flex;
+          align-items: center;
+
+          height: 500px;
+          
+          /* Enable Safari touch scrolling physics which is needed for scroll snap */
+          -webkit-overflow-scrolling: touch;
+        }
+
+
+        .gallery_scroller div {
+           /* snap align center  */
+          scroll-snap-align: center;
+          margin: 10px;
+          position: relative;
+        }
+
+        .gallery_scroller img {
+          border-radius: 10px;
+        }
+
+        .gallery_scroller div.colored_card {
+          min-width: 40%;
+          min-height: 100%;
+          border-radius: 10px;
+          background-color: #343a40;
+          color: aliceblue;
+         }
+
+        .gallery div.note {
+          position: absolute;
+
+          /* vertically align center */
+          top:  50%;
+          transform: translateY(-50%);
+          left: 0;
+          right: 0;
+
+          background: rgba(0,0,0, 0.6);
+          padding: 20px;
+          position: absolute;
+
+          font-size: 4em;
+          color: white;
+        }
+
+
+        .gallery .btn {
+          position: absolute;
+
+          top: 50%;
+          transform: translateY(-50%);
+
+          height: 30px;
+          width: 30px;
+
+          border-radius: 2px;
+          background-color: rgba(0,0,0,0.5);
+          background-position: 50% 50%;
+          background-repeat: no-repeat;
+
+          z-index: 1;
+        }
+
+        .gallery .btn.next {
+          background-image: url('data:image/svg+xml;charset=utf-8,<svg width="18" height="18" viewBox="0 0 34 34" xmlns="http://www.w3.org/2000/svg"><title>Shape</title><path d="M25.557 14.7L13.818 2.961 16.8 0l16.8 16.8-16.8 16.8-2.961-2.961L25.557 18.9H0v-4.2z" fill="%23FFF" fill-rule="evenodd"/></svg>');
+          right: 10px;
+        }
+
+        .gallery .btn.prev {
+          background-image: url('data:image/svg+xml;charset=utf-8,<svg width="18" height="18" viewBox="0 0 34 34" xmlns="http://www.w3.org/2000/svg"><title>Shape</title><path d="M33.6 14.7H8.043L19.782 2.961 16.8 0 0 16.8l16.8 16.8 2.961-2.961L8.043 18.9H33.6z" fill="%23FFF" fill-rule="evenodd"/></svg>');
+          left: 10px;
+        }
+
+        .set-flex {
+            display: flex;
+            flex-direction: column;
+        }
+
+        .content_div {
+            flex: 1;
+        }
+
+        .card-header {
+            font-size: medium;
+        }
+        .float-right {
+            float: right;
+        }
+        .gallery {
+          
+        }
+
+        /* Scrollbar */
+        ::-webkit-scrollbar {
+          width: 10px;
+        }
+
+        /* Track */
+        ::-webkit-scrollbar-track {
+          background: #f1f1f1; 
+        }
+         
+        /* Handle */
+        ::-webkit-scrollbar-thumb {
+          background: #888; 
+        }
+
+        /* Handle on hover */
+        ::-webkit-scrollbar-thumb:hover {
+          background: #555; 
+        }
+    </style>
+</head>
+
+<script>
+  /* Constants for FLO blockchain operations !!Make sure to add this at begining!! */
+  const floGlobals = {
+
+    //Required for all
+    blockchain: "FLO",
+
+    //Required for blockchain API operators
+    apiURL: {
+      FLO: ['https://explorer.mediciland.com/', 'https://livenet.flocha.in/', 'https://flosight.duckdns.org/', 'http://livenet-explorer.floexperiments.com/'],
+      FLO_TEST: ['https://testnet-flosight.duckdns.org', 'https://testnet.flocha.in/']
+    },
+    adminID: "FMeiptdJNtYQEtzyYAVNP8fjsDJ1i4EPfE",
+    //sendAmt: 0.001,
+    //fee: 0.0005,
+
+    //Required for Supernode operations
+    SNStorageID: "FEzk75EGMPEQMrCuPosGiwuK162hcEu49E",
+    supernodes: {}, //each supnernode must be stored as floID : {uri:<uri>,pubKey:<publicKey>}
+
+    //for cloud apps
+    subAdmins: [],
+    application: "Content Collaboration",
+    vectorClock: {},
+    appObjects: {}
+  }
+</script>
+
+<body onload="onLoadStartUp()">
+
+    <nav class="navbar navbar-expand-lg navbar-dark bg-dark">
+      <span class="navbar-brand mb-0 h1">Blockchain Content Collaboration</span>
+      <button class="navbar-toggler" type="button" data-toggle="collapse" data-target="#navbarText" aria-controls="navbarText" aria-expanded="false" aria-label="Toggle navigation">
+        <span class="navbar-toggler-icon"></span>
+      </button>
+      <div class="collapse navbar-collapse" id="navbarText">
+        <ul class="navbar-nav mr-auto">
+          <li class="nav-item active">
+            <a class="nav-link" href="#" data-toggle="modal" data-target=".bd-example-modal-lg">Actions <span class="sr-only">(current)</span></a>
+          </li>
+        </ul>
+        <span class="navbar-text" id="retrieveLatestContentBtn" onclick="cloudArticleApp.retrieveLatestContent()">
+          Refresh
+        </span>
+      </div>
+    </nav>
+  
+    <div class="container">
+
+        <div id="current_data"></div>
+        <div class="cards">
+            <div id="full_article_div" class="card-body"></div>  
+        </div>
+
+    </div>
+
+    <div class="modal fade bd-example-modal-lg" tabindex="-1" role="dialog" aria-labelledby="myLargeModalLabel" aria-hidden="true">
+      <div class="modal-dialog modal-lg">
+        <div class="modal-content">
+            <div class="modal-header">
+            <h5 class="modal-title" id="exampleModalLabel">Actions</h5>
+            <button type="button" class="close" data-dismiss="modal" aria-label="Close">
+              <span aria-hidden="true">&times;</span>
+            </button>
+          </div>
+          <div class="modal-body">    
+
+            <div class="row">
+                <div class="col-md-12">
+                    <div id="reset_data_div">
+                        <h5>Reset</h5>
+                        <label>Article Name: </label>
+                        <input type="text" class="form-control" id="article_name"> <br>
+                        
+                        <label>Content1: </label>
+                        <input type="text" class="form-control" id="article_content1"> <br>
+
+                        <label>Content2: </label>
+                        <input type="text" class="form-control" id="article_content2"> <br>
+
+                        <label>Content3: </label>
+                        <input type="text" class="form-control" id="article_content3"> <br>
+                        
+                        <input type="button" class="btn btn-secondary" id="reset_data_btn" value="Reset">
+                    </div>
+                </div>
+
+          </div>
+            </div>
+            <div class="modal-footer">
+        <button type="button" class="btn btn-secondary" data-dismiss="modal">Close</button>
+      </div>
+        </div>
+      </div>
+    </div>   
+
+<script>
+    //All util libraries required for Standard operations (DO NOT EDIT ANY)
+
+    /*!
+    * 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+\/]/ig, "");
+  
+                    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("");
+                }
+  
+            };
+  
+        })();
+    }
+  
+  
+  
+            //Adding SHA1 to fix basic PKBDF2
+            /*
+             * Crypto-JS v2.5.4
+             * http://code.google.com/p/crypto-js/
+             * (c) 2009-2012 by 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;
+  
+                // Public API
+                var SHA1 = C.SHA1 = function (message, options) {
+                    var digestbytes = util.wordsToBytes(SHA1._sha1(message));
+                    return options && options.asBytes ? digestbytes :
+                        options && options.asString ? Binary.bytesToString(digestbytes) :
+                        util.bytesToHex(digestbytes);
+                };
+  
+                // The core
+                SHA1._sha1 = 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,
+                        w = [],
+                        H0 = 1732584193,
+                        H1 = -271733879,
+                        H2 = -1732584194,
+                        H3 = 271733878,
+                        H4 = -1009589776;
+  
+                    // Padding
+                    m[l >> 5] |= 0x80 << (24 - l % 32);
+                    m[((l + 64 >>> 9) << 4) + 15] = l;
+  
+                    for (var i = 0; i < m.length; i += 16) {
+  
+                        var a = H0,
+                            b = H1,
+                            c = H2,
+                            d = H3,
+                            e = H4;
+  
+                        for (var j = 0; j < 80; j++) {
+  
+                            if (j < 16) w[j] = m[i + j];
+                            else {
+                                var n = w[j - 3] ^ w[j - 8] ^ w[j - 14] ^ w[j - 16];
+                                w[j] = (n << 1) | (n >>> 31);
+                            }
+  
+                            var t = ((H0 << 5) | (H0 >>> 27)) + H4 + (w[j] >>> 0) + (
+                                j < 20 ? (H1 & H2 | ~H1 & H3) + 1518500249 :
+                                j < 40 ? (H1 ^ H2 ^ H3) + 1859775393 :
+                                j < 60 ? (H1 & H2 | H1 & H3 | H2 & H3) - 1894007588 :
+                                (H1 ^ H2 ^ H3) - 899497514);
+  
+                            H4 = H3;
+                            H3 = H2;
+                            H2 = (H1 << 30) | (H1 >>> 2);
+                            H1 = H0;
+                            H0 = t;
+  
+                        }
+  
+                        H0 += a;
+                        H1 += b;
+                        H2 += c;
+                        H3 += d;
+                        H4 += e;
+  
+                    }
+  
+                    return [H0, H1, H2, H3, H4];
+  
+                };
+  
+                // Package private blocksize
+                SHA1._blocksize = 16;
+  
+                SHA1._digestsize = 20;
+  
+            })();
+  
+            //Added to make PKBDF2 work
+            /*
+             * Crypto-JS v2.5.4
+             * http://code.google.com/p/crypto-js/
+             * (c) 2009-2012 by 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-sha256-hmac.js
+            /*
+             * Crypto-JS v2.5.4
+             * http://code.google.com/p/crypto-js/
+             * (c) 2009-2012 by Jeff Mott. All rights reserved.
+             * http://code.google.com/p/crypto-js/wiki/License
+             */
+  
+            function ascii_to_hexa(str) {
+                var arr1 = [];
+                for (var n = 0, l = str.length; n < l; n++) {
+                    var hex = Number(str.charCodeAt(n)).toString(16);
+                    arr1.push(hex);
+                }
+                return arr1.join('');
+            }
+  
+  
+            (typeof Crypto == "undefined" || !Crypto.util) && function () {
+                var d = window.Crypto = {},
+                    k = d.util = {
+                        rotl: function (b, a) {
+                            return b << a | b >>> 32 - a
+                        },
+                        rotr: function (b, a) {
+                            return b << 32 - a | b >>> a
+                        },
+                        endian: function (b) {
+                            if (b.constructor == Number) return k.rotl(b, 8) & 16711935 | k.rotl(b, 24) & 4278255360;
+                            for (var a = 0; a < b.length; a++) b[a] = k.endian(b[a]);
+                            return b
+                        },
+                        randomBytes: function (b) {
+                            for (var a = []; b > 0; b--) a.push(Math.floor(Math.random() * 256));
+                            return a
+                        },
+                        bytesToWords: function (b) {
+                            for (var a = [], c = 0, e = 0; c < b.length; c++, e += 8) a[e >>> 5] |= (b[c] & 255) <<
+                                24 - e % 32;
+                            return a
+                        },
+                        wordsToBytes: function (b) {
+                            for (var a = [], c = 0; c < b.length * 32; c += 8) a.push(b[c >>> 5] >>> 24 - c % 32 & 255);
+                            return a
+                        },
+                        bytesToHex: function (b) {
+                            for (var a = [], c = 0; c < b.length; c++) a.push((b[c] >>> 4).toString(16)), a.push((b[c] &
+                                15).toString(16));
+                            return a.join("")
+                        },
+                        hexToBytes: function (b) {
+                            for (var a = [], c = 0; c < b.length; c += 2) a.push(parseInt(b.substr(c, 2), 16));
+                            return a
+                        },
+                        bytesToBase64: function (b) {
+                            for (var a = [], c = 0; c < b.length; c += 3)
+                                for (var e = b[c] << 16 | b[c + 1] << 8 | b[c + 2], p = 0; p < 4; p++) c * 8 + p * 6 <=
+                                    b.length * 8 ? a.push(
+                                        "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/".charAt(e >>>
+                                            6 * (3 - p) & 63)) : a.push("=");
+                            return a.join("")
+                        },
+                        base64ToBytes: function (b) {
+                            for (var b = b.replace(/[^A-Z0-9+\/]/ig, ""), a = [], c = 0, e = 0; c < b.length; e = ++c %
+                                4) e != 0 && a.push(("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/"
+                                    .indexOf(b.charAt(c - 1)) & Math.pow(2, -2 * e + 8) - 1) << e * 2 |
+                                "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/".indexOf(b.charAt(
+                                    c)) >>> 6 - e * 2);
+                            return a
+                        }
+                    },
+                    d = d.charenc = {};
+                d.UTF8 = {
+                    stringToBytes: function (b) {
+                        return g.stringToBytes(unescape(encodeURIComponent(b)))
+                    },
+                    bytesToString: function (b) {
+                        return decodeURIComponent(escape(g.bytesToString(b)))
+                    }
+                };
+                var g = d.Binary = {
+                    stringToBytes: function (b) {
+                        for (var a = [], c = 0; c < b.length; c++) a.push(b.charCodeAt(c) & 255);
+                        return a
+                    },
+                    bytesToString: function (b) {
+                        for (var a = [], c = 0; c < b.length; c++) a.push(String.fromCharCode(b[c]));
+                        return a.join("")
+                    }
+                }
+            }();
+            (function () {
+                var d = Crypto,
+                    k = d.util,
+                    g = d.charenc,
+                    b = g.UTF8,
+                    a = g.Binary,
+                    c = [1116352408, 1899447441, 3049323471, 3921009573, 961987163, 1508970993, 2453635748, 2870763221,
+                        3624381080, 310598401, 607225278, 1426881987, 1925078388, 2162078206, 2614888103, 3248222580,
+                        3835390401, 4022224774, 264347078, 604807628, 770255983, 1249150122, 1555081692, 1996064986,
+                        2554220882, 2821834349, 2952996808, 3210313671, 3336571891, 3584528711, 113926993, 338241895,
+                        666307205, 773529912, 1294757372, 1396182291, 1695183700, 1986661051, 2177026350, 2456956037,
+                        2730485921,
+                        2820302411, 3259730800, 3345764771, 3516065817, 3600352804, 4094571909, 275423344, 430227734,
+                        506948616, 659060556, 883997877, 958139571, 1322822218, 1537002063, 1747873779, 1955562222,
+                        2024104815, 2227730452, 2361852424, 2428436474, 2756734187, 3204031479, 3329325298
+                    ],
+                    e = d.SHA256 = function (b, c) {
+                        var f = k.wordsToBytes(e._sha256(b));
+                        return c && c.asBytes ? f : c && c.asString ? a.bytesToString(f) : k.bytesToHex(f)
+                    };
+                e._sha256 = function (a) {
+                    a.constructor == String && (a = b.stringToBytes(a));
+                    var e = k.bytesToWords(a),
+                        f = a.length * 8,
+                        a = [1779033703, 3144134277,
+                            1013904242, 2773480762, 1359893119, 2600822924, 528734635, 1541459225
+                        ],
+                        d = [],
+                        g, m, r, i, n, o, s, t, h, l, j;
+                    e[f >> 5] |= 128 << 24 - f % 32;
+                    e[(f + 64 >> 9 << 4) + 15] = f;
+                    for (t = 0; t < e.length; t += 16) {
+                        f = a[0];
+                        g = a[1];
+                        m = a[2];
+                        r = a[3];
+                        i = a[4];
+                        n = a[5];
+                        o = a[6];
+                        s = a[7];
+                        for (h = 0; h < 64; h++) {
+                            h < 16 ? d[h] = e[h + t] : (l = d[h - 15], j = d[h - 2], d[h] = ((l << 25 | l >>> 7) ^
+                                (l << 14 | l >>> 18) ^ l >>> 3) + (d[h - 7] >>> 0) + ((j << 15 | j >>> 17) ^
+                                (j << 13 | j >>> 19) ^ j >>> 10) + (d[h - 16] >>> 0));
+                            j = f & g ^ f & m ^ g & m;
+                            var u = (f << 30 | f >>> 2) ^ (f << 19 | f >>> 13) ^ (f << 10 | f >>> 22);
+                            l = (s >>> 0) + ((i << 26 | i >>> 6) ^ (i << 21 | i >>> 11) ^ (i << 7 | i >>> 25)) +
+                                (i & n ^ ~i & o) + c[h] + (d[h] >>> 0);
+                            j = u + j;
+                            s = o;
+                            o = n;
+                            n = i;
+                            i = r + l >>> 0;
+                            r = m;
+                            m = g;
+                            g = f;
+                            f = l + j >>> 0
+                        }
+                        a[0] += f;
+                        a[1] += g;
+                        a[2] += m;
+                        a[3] += r;
+                        a[4] += i;
+                        a[5] += n;
+                        a[6] += o;
+                        a[7] += s
+                    }
+                    return a
+                };
+                e._blocksize = 16;
+                e._digestsize = 32
+            })();
+            (function () {
+                var d = Crypto,
+                    k = d.util,
+                    g = d.charenc,
+                    b = g.UTF8,
+                    a = g.Binary;
+                d.HMAC = function (c, e, d, g) {
+                    e.constructor == String && (e = b.stringToBytes(e));
+                    d.constructor == String && (d = b.stringToBytes(d));
+                    d.length > c._blocksize * 4 && (d = c(d, {
+                        asBytes: !0
+                    }));
+                    for (var f = d.slice(0), d = d.slice(0), q = 0; q < c._blocksize * 4; q++) f[q] ^= 92, d[q] ^=
+                        54;
+                    c = c(f.concat(c(d.concat(e), {
+                        asBytes: !0
+                    })), {
+                        asBytes: !0
+                    });
+                    return g && g.asBytes ? c : g && g.asString ? a.bytesToString(c) : k.bytesToHex(c)
+                }
+            })();
+  
+  
+    /*!
+    * 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]);
+            }
+        }
+    })();
+  
+  
+            //ripemd160.js
+            /*
+            CryptoJS v3.1.2
+            code.google.com/p/crypto-js
+            (c) 2009-2013 by Jeff Mott. All rights reserved.
+            code.google.com/p/crypto-js/wiki/License
+            */
+            /** @preserve
+            (c) 2012 by Cédric Mesnil. All rights reserved.
+            Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
+                - Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
+                - Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.
+            THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+            */
+  
+            // Constants table
+            var zl = [
+                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 zr = [
+                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 sl = [
+                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 sr = [
+                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
+            ];
+  
+            var hl = [0x00000000, 0x5A827999, 0x6ED9EBA1, 0x8F1BBCDC, 0xA953FD4E];
+            var hr = [0x50A28BE6, 0x5C4DD124, 0x6D703EF3, 0x7A6D76E9, 0x00000000];
+  
+            var bytesToWords = function (bytes) {
+                var words = [];
+                for (var i = 0, b = 0; i < bytes.length; i++, b += 8) {
+                    words[b >>> 5] |= bytes[i] << (24 - b % 32);
+                }
+                return words;
+            };
+  
+            var wordsToBytes = function (words) {
+                var bytes = [];
+                for (var b = 0; b < words.length * 32; b += 8) {
+                    bytes.push((words[b >>> 5] >>> (24 - b % 32)) & 0xFF);
+                }
+                return bytes;
+            };
+  
+            var processBlock = function (H, M, offset) {
+  
+                // Swap endian
+                for (var i = 0; i < 16; i++) {
+                    var offset_i = offset + i;
+                    var M_offset_i = M[offset_i];
+  
+                    // Swap
+                    M[offset_i] = (
+                        (((M_offset_i << 8) | (M_offset_i >>> 24)) & 0x00ff00ff) |
+                        (((M_offset_i << 24) | (M_offset_i >>> 8)) & 0xff00ff00)
+                    );
+                }
+  
+                // Working variables
+                var al, bl, cl, dl, el;
+                var ar, br, cr, dr, er;
+  
+                ar = al = H[0];
+                br = bl = H[1];
+                cr = cl = H[2];
+                dr = dl = H[3];
+                er = el = H[4];
+                // Computation
+                var t;
+                for (var i = 0; i < 80; i += 1) {
+                    t = (al + M[offset + zl[i]]) | 0;
+                    if (i < 16) {
+                        t += f1(bl, cl, dl) + hl[0];
+                    } else if (i < 32) {
+                        t += f2(bl, cl, dl) + hl[1];
+                    } else if (i < 48) {
+                        t += f3(bl, cl, dl) + hl[2];
+                    } else if (i < 64) {
+                        t += f4(bl, cl, dl) + hl[3];
+                    } else { // if (i<80) {
+                        t += f5(bl, cl, dl) + hl[4];
+                    }
+                    t = t | 0;
+                    t = rotl(t, sl[i]);
+                    t = (t + el) | 0;
+                    al = el;
+                    el = dl;
+                    dl = rotl(cl, 10);
+                    cl = bl;
+                    bl = t;
+  
+                    t = (ar + M[offset + zr[i]]) | 0;
+                    if (i < 16) {
+                        t += f5(br, cr, dr) + hr[0];
+                    } else if (i < 32) {
+                        t += f4(br, cr, dr) + hr[1];
+                    } else if (i < 48) {
+                        t += f3(br, cr, dr) + hr[2];
+                    } else if (i < 64) {
+                        t += f2(br, cr, dr) + hr[3];
+                    } else { // if (i<80) {
+                        t += f1(br, cr, dr) + hr[4];
+                    }
+                    t = t | 0;
+                    t = rotl(t, sr[i]);
+                    t = (t + er) | 0;
+                    ar = er;
+                    er = dr;
+                    dr = rotl(cr, 10);
+                    cr = br;
+                    br = t;
+                }
+                // Intermediate hash value
+                t = (H[1] + cl + dr) | 0;
+                H[1] = (H[2] + dl + er) | 0;
+                H[2] = (H[3] + el + ar) | 0;
+                H[3] = (H[4] + al + br) | 0;
+                H[4] = (H[0] + bl + cr) | 0;
+                H[0] = t;
+            };
+  
+            function f1(x, y, z) {
+                return ((x) ^ (y) ^ (z));
+            }
+  
+            function f2(x, y, z) {
+                return (((x) & (y)) | ((~x) & (z)));
+            }
+  
+            function f3(x, y, z) {
+                return (((x) | (~(y))) ^ (z));
+            }
+  
+            function f4(x, y, z) {
+                return (((x) & (z)) | ((y) & (~(z))));
+            }
+  
+            function f5(x, y, z) {
+                return ((x) ^ ((y) | (~(z))));
+            }
+  
+            function rotl(x, n) {
+                return (x << n) | (x >>> (32 - n));
+            }
+  
+            function ripemd160(message) {
+                var H = [0x67452301, 0xEFCDAB89, 0x98BADCFE, 0x10325476, 0xC3D2E1F0];
+  
+                var m = bytesToWords(message);
+  
+                var nBitsLeft = message.length * 8;
+                var nBitsTotal = message.length * 8;
+  
+                // Add padding
+                m[nBitsLeft >>> 5] |= 0x80 << (24 - nBitsLeft % 32);
+                m[(((nBitsLeft + 64) >>> 9) << 4) + 14] = (
+                    (((nBitsTotal << 8) | (nBitsTotal >>> 24)) & 0x00ff00ff) |
+                    (((nBitsTotal << 24) | (nBitsTotal >>> 8)) & 0xff00ff00)
+                );
+  
+                for (var i = 0; i < m.length; i += 16) {
+                    processBlock(H, m, i);
+                }
+  
+                // Swap endian
+                for (var i = 0; i < 5; i++) {
+                    // Shortcut
+                    var H_i = H[i];
+  
+                    // Swap
+                    H[i] = (((H_i << 8) | (H_i >>> 24)) & 0x00ff00ff) |
+                        (((H_i << 24) | (H_i >>> 8)) & 0xff00ff00);
+                }
+  
+                var digestbytes = wordsToBytes(H);
+                return digestbytes;
+            }
+  
+  
+  
+  
+  
+  
+            // Upstream 'BigInteger' here:
+            // Original Author: http://www-cs-students.stanford.edu/~tjw/jsbn/
+            // Follows 'jsbn' on Github: https://github.com/jasondavies/jsbn
+            // Review and Testing: https://github.com/cryptocoinjs/bigi/
+            /*!
+            * Basic JavaScript BN library - subset useful for RSA encryption. v1.4
+            *
+            * Copyright (c) 2005  Tom Wu
+            * All Rights Reserved.
+            * BSD License
+            * http://www-cs-students.stanford.edu/~tjw/jsbn/LICENSE
+            *
+            * Copyright Stephan Thomas
+            * Copyright pointbiz
+            */
+  
+            (function () {
+  
+                // (public) Constructor function of Global BigInteger object
+                var BigInteger = window.BigInteger = function BigInteger(a, b, c) {
+                    if (!(this instanceof BigInteger))
+                        return new BigInteger(a, b, c);
+  
+                    if (a != null)
+                        if ("number" == typeof a) this.fromNumber(a, b, c);
+                        else if (b == null && "string" != typeof a) this.fromString(a, 256);
+                    else this.fromString(a, b);
+                };
+  
+                // Bits per digit
+                var dbits;
+  
+                // JavaScript engine analysis
+                var canary = 0xdeadbeefcafe;
+                var j_lm = ((canary & 0xffffff) == 0xefcafe);
+  
+                // return new, unset BigInteger
+                function nbi() {
+                    return new BigInteger(null);
+                }
+  
+                // am: Compute w_j += (x*this_i), propagate carries,
+                // c is initial carry, returns final carry.
+                // c < 3*dvalue, x < 2*dvalue, this_i < dvalue
+                // We need to select the fastest one that works in this environment.
+  
+                // am1: use a single mult and divide to get the high bits,
+                // max digit bits should be 26 because
+                // max internal value = 2*dvalue^2-2*dvalue (< 2^53)
+                function am1(i, x, w, j, c, n) {
+                    while (--n >= 0) {
+                        var v = x * this[i++] + w[j] + c;
+                        c = Math.floor(v / 0x4000000);
+                        w[j++] = v & 0x3ffffff;
+                    }
+                    return c;
+                }
+                // am2 avoids a big mult-and-extract completely.
+                // Max digit bits should be <= 30 because we do bitwise ops
+                // on values up to 2*hdvalue^2-hdvalue-1 (< 2^31)
+                function am2(i, x, w, j, c, n) {
+                    var xl = x & 0x7fff,
+                        xh = x >> 15;
+                    while (--n >= 0) {
+                        var l = this[i] & 0x7fff;
+                        var h = this[i++] >> 15;
+                        var m = xh * l + h * xl;
+                        l = xl * l + ((m & 0x7fff) << 15) + w[j] + (c & 0x3fffffff);
+                        c = (l >>> 30) + (m >>> 15) + xh * h + (c >>> 30);
+                        w[j++] = l & 0x3fffffff;
+                    }
+                    return c;
+                }
+                // Alternately, set max digit bits to 28 since some
+                // browsers slow down when dealing with 32-bit numbers.
+                function am3(i, x, w, j, c, n) {
+                    var xl = x & 0x3fff,
+                        xh = x >> 14;
+                    while (--n >= 0) {
+                        var l = this[i] & 0x3fff;
+                        var h = this[i++] >> 14;
+                        var m = xh * l + h * xl;
+                        l = xl * l + ((m & 0x3fff) << 14) + w[j] + c;
+                        c = (l >> 28) + (m >> 14) + xh * h;
+                        w[j++] = l & 0xfffffff;
+                    }
+                    return c;
+                }
+                if (j_lm && (navigator.appName == "Microsoft Internet Explorer")) {
+                    BigInteger.prototype.am = am2;
+                    dbits = 30;
+                } else if (j_lm && (navigator.appName != "Netscape")) {
+                    BigInteger.prototype.am = am1;
+                    dbits = 26;
+                } else { // Mozilla/Netscape seems to prefer am3
+                    BigInteger.prototype.am = am3;
+                    dbits = 28;
+                }
+  
+                BigInteger.prototype.DB = dbits;
+                BigInteger.prototype.DM = ((1 << dbits) - 1);
+                BigInteger.prototype.DV = (1 << dbits);
+  
+                var BI_FP = 52;
+                BigInteger.prototype.FV = Math.pow(2, BI_FP);
+                BigInteger.prototype.F1 = BI_FP - dbits;
+                BigInteger.prototype.F2 = 2 * dbits - BI_FP;
+  
+                // Digit conversions
+                var BI_RM = "0123456789abcdefghijklmnopqrstuvwxyz";
+                var BI_RC = new Array();
+                var rr, vv;
+                rr = "0".charCodeAt(0);
+                for (vv = 0; vv <= 9; ++vv) BI_RC[rr++] = vv;
+                rr = "a".charCodeAt(0);
+                for (vv = 10; vv < 36; ++vv) BI_RC[rr++] = vv;
+                rr = "A".charCodeAt(0);
+                for (vv = 10; vv < 36; ++vv) BI_RC[rr++] = vv;
+  
+                function int2char(n) {
+                    return BI_RM.charAt(n);
+                }
+  
+                function intAt(s, i) {
+                    var c = BI_RC[s.charCodeAt(i)];
+                    return (c == null) ? -1 : c;
+                }
+  
+  
+  
+                // return bigint initialized to value
+                function nbv(i) {
+                    var r = nbi();
+                    r.fromInt(i);
+                    return r;
+                }
+  
+  
+                // returns bit length of the integer x
+                function nbits(x) {
+                    var r = 1,
+                        t;
+                    if ((t = x >>> 16) != 0) {
+                        x = t;
+                        r += 16;
+                    }
+                    if ((t = x >> 8) != 0) {
+                        x = t;
+                        r += 8;
+                    }
+                    if ((t = x >> 4) != 0) {
+                        x = t;
+                        r += 4;
+                    }
+                    if ((t = x >> 2) != 0) {
+                        x = t;
+                        r += 2;
+                    }
+                    if ((t = x >> 1) != 0) {
+                        x = t;
+                        r += 1;
+                    }
+                    return r;
+                }
+  
+  
+  
+  
+  
+  
+  
+                // (protected) copy this to r
+                BigInteger.prototype.copyTo = function (r) {
+                    for (var i = this.t - 1; i >= 0; --i) r[i] = this[i];
+                    r.t = this.t;
+                    r.s = this.s;
+                };
+  
+  
+                // (protected) set from integer value x, -DV <= x < DV
+                BigInteger.prototype.fromInt = function (x) {
+                    this.t = 1;
+                    this.s = (x < 0) ? -1 : 0;
+                    if (x > 0) this[0] = x;
+                    else if (x < -1) this[0] = x + this.DV;
+                    else this.t = 0;
+                };
+  
+                // (protected) set from string and radix
+                BigInteger.prototype.fromString = function (s, b) {
+                    var k;
+                    if (b == 16) k = 4;
+                    else if (b == 8) k = 3;
+                    else if (b == 256) k = 8; // byte array
+                    else if (b == 2) k = 1;
+                    else if (b == 32) k = 5;
+                    else if (b == 4) k = 2;
+                    else {
+                        this.fromRadix(s, b);
+                        return;
+                    }
+                    this.t = 0;
+                    this.s = 0;
+                    var i = s.length,
+                        mi = false,
+                        sh = 0;
+                    while (--i >= 0) {
+                        var x = (k == 8) ? s[i] & 0xff : intAt(s, i);
+                        if (x < 0) {
+                            if (s.charAt(i) == "-") mi = true;
+                            continue;
+                        }
+                        mi = false;
+                        if (sh == 0)
+                            this[this.t++] = x;
+                        else if (sh + k > this.DB) {
+                            this[this.t - 1] |= (x & ((1 << (this.DB - sh)) - 1)) << sh;
+                            this[this.t++] = (x >> (this.DB - sh));
+                        } else
+                            this[this.t - 1] |= x << sh;
+                        sh += k;
+                        if (sh >= this.DB) sh -= this.DB;
+                    }
+                    if (k == 8 && (s[0] & 0x80) != 0) {
+                        this.s = -1;
+                        if (sh > 0) this[this.t - 1] |= ((1 << (this.DB - sh)) - 1) << sh;
+                    }
+                    this.clamp();
+                    if (mi) BigInteger.ZERO.subTo(this, this);
+                };
+  
+  
+                // (protected) clamp off excess high words
+                BigInteger.prototype.clamp = function () {
+                    var c = this.s & this.DM;
+                    while (this.t > 0 && this[this.t - 1] == c) --this.t;
+                };
+  
+                // (protected) r = this << n*DB
+                BigInteger.prototype.dlShiftTo = function (n, r) {
+                    var i;
+                    for (i = this.t - 1; i >= 0; --i) r[i + n] = this[i];
+                    for (i = n - 1; i >= 0; --i) r[i] = 0;
+                    r.t = this.t + n;
+                    r.s = this.s;
+                };
+  
+                // (protected) r = this >> n*DB
+                BigInteger.prototype.drShiftTo = function (n, r) {
+                    for (var i = n; i < this.t; ++i) r[i - n] = this[i];
+                    r.t = Math.max(this.t - n, 0);
+                    r.s = this.s;
+                };
+  
+  
+                // (protected) r = this << n
+                BigInteger.prototype.lShiftTo = function (n, r) {
+                    var bs = n % this.DB;
+                    var cbs = this.DB - bs;
+                    var bm = (1 << cbs) - 1;
+                    var ds = Math.floor(n / this.DB),
+                        c = (this.s << bs) & this.DM,
+                        i;
+                    for (i = this.t - 1; i >= 0; --i) {
+                        r[i + ds + 1] = (this[i] >> cbs) | c;
+                        c = (this[i] & bm) << bs;
+                    }
+                    for (i = ds - 1; i >= 0; --i) r[i] = 0;
+                    r[ds] = c;
+                    r.t = this.t + ds + 1;
+                    r.s = this.s;
+                    r.clamp();
+                };
+  
+  
+                // (protected) r = this >> n
+                BigInteger.prototype.rShiftTo = function (n, r) {
+                    r.s = this.s;
+                    var ds = Math.floor(n / this.DB);
+                    if (ds >= this.t) {
+                        r.t = 0;
+                        return;
+                    }
+                    var bs = n % this.DB;
+                    var cbs = this.DB - bs;
+                    var bm = (1 << bs) - 1;
+                    r[0] = this[ds] >> bs;
+                    for (var i = ds + 1; i < this.t; ++i) {
+                        r[i - ds - 1] |= (this[i] & bm) << cbs;
+                        r[i - ds] = this[i] >> bs;
+                    }
+                    if (bs > 0) r[this.t - ds - 1] |= (this.s & bm) << cbs;
+                    r.t = this.t - ds;
+                    r.clamp();
+                };
+  
+  
+                // (protected) r = this - a
+                BigInteger.prototype.subTo = function (a, r) {
+                    var i = 0,
+                        c = 0,
+                        m = Math.min(a.t, this.t);
+                    while (i < m) {
+                        c += this[i] - a[i];
+                        r[i++] = c & this.DM;
+                        c >>= this.DB;
+                    }
+                    if (a.t < this.t) {
+                        c -= a.s;
+                        while (i < this.t) {
+                            c += this[i];
+                            r[i++] = c & this.DM;
+                            c >>= this.DB;
+                        }
+                        c += this.s;
+                    } else {
+                        c += this.s;
+                        while (i < a.t) {
+                            c -= a[i];
+                            r[i++] = c & this.DM;
+                            c >>= this.DB;
+                        }
+                        c -= a.s;
+                    }
+                    r.s = (c < 0) ? -1 : 0;
+                    if (c < -1) r[i++] = this.DV + c;
+                    else if (c > 0) r[i++] = c;
+                    r.t = i;
+                    r.clamp();
+                };
+  
+  
+                // (protected) r = this * a, r != this,a (HAC 14.12)
+                // "this" should be the larger one if appropriate.
+                BigInteger.prototype.multiplyTo = function (a, r) {
+                    var x = this.abs(),
+                        y = a.abs();
+                    var i = x.t;
+                    r.t = i + y.t;
+                    while (--i >= 0) r[i] = 0;
+                    for (i = 0; i < y.t; ++i) r[i + x.t] = x.am(0, y[i], r, i, 0, x.t);
+                    r.s = 0;
+                    r.clamp();
+                    if (this.s != a.s) BigInteger.ZERO.subTo(r, r);
+                };
+  
+  
+                // (protected) r = this^2, r != this (HAC 14.16)
+                BigInteger.prototype.squareTo = function (r) {
+                    var x = this.abs();
+                    var i = r.t = 2 * x.t;
+                    while (--i >= 0) r[i] = 0;
+                    for (i = 0; i < x.t - 1; ++i) {
+                        var c = x.am(i, x[i], r, 2 * i, 0, 1);
+                        if ((r[i + x.t] += x.am(i + 1, 2 * x[i], r, 2 * i + 1, c, x.t - i - 1)) >= x.DV) {
+                            r[i + x.t] -= x.DV;
+                            r[i + x.t + 1] = 1;
+                        }
+                    }
+                    if (r.t > 0) r[r.t - 1] += x.am(i, x[i], r, 2 * i, 0, 1);
+                    r.s = 0;
+                    r.clamp();
+                };
+  
+  
+  
+                // (protected) divide this by m, quotient and remainder to q, r (HAC 14.20)
+                // r != q, this != m.  q or r may be null.
+                BigInteger.prototype.divRemTo = function (m, q, r) {
+                    var pm = m.abs();
+                    if (pm.t <= 0) return;
+                    var pt = this.abs();
+                    if (pt.t < pm.t) {
+                        if (q != null) q.fromInt(0);
+                        if (r != null) this.copyTo(r);
+                        return;
+                    }
+                    if (r == null) r = nbi();
+                    var y = nbi(),
+                        ts = this.s,
+                        ms = m.s;
+                    var nsh = this.DB - nbits(pm[pm.t - 1]); // normalize modulus
+                    if (nsh > 0) {
+                        pm.lShiftTo(nsh, y);
+                        pt.lShiftTo(nsh, r);
+                    } else {
+                        pm.copyTo(y);
+                        pt.copyTo(r);
+                    }
+                    var ys = y.t;
+                    var y0 = y[ys - 1];
+                    if (y0 == 0) return;
+                    var yt = y0 * (1 << this.F1) + ((ys > 1) ? y[ys - 2] >> this.F2 : 0);
+                    var d1 = this.FV / yt,
+                        d2 = (1 << this.F1) / yt,
+                        e = 1 << this.F2;
+                    var i = r.t,
+                        j = i - ys,
+                        t = (q == null) ? nbi() : q;
+                    y.dlShiftTo(j, t);
+                    if (r.compareTo(t) >= 0) {
+                        r[r.t++] = 1;
+                        r.subTo(t, r);
+                    }
+                    BigInteger.ONE.dlShiftTo(ys, t);
+                    t.subTo(y, y); // "negative" y so we can replace sub with am later
+                    while (y.t < ys) y[y.t++] = 0;
+                    while (--j >= 0) {
+                        // Estimate quotient digit
+                        var qd = (r[--i] == y0) ? this.DM : Math.floor(r[i] * d1 + (r[i - 1] + e) * d2);
+                        if ((r[i] += y.am(0, qd, r, j, 0, ys)) < qd) { // Try it out
+                            y.dlShiftTo(j, t);
+                            r.subTo(t, r);
+                            while (r[i] < --qd) r.subTo(t, r);
+                        }
+                    }
+                    if (q != null) {
+                        r.drShiftTo(ys, q);
+                        if (ts != ms) BigInteger.ZERO.subTo(q, q);
+                    }
+                    r.t = ys;
+                    r.clamp();
+                    if (nsh > 0) r.rShiftTo(nsh, r); // Denormalize remainder
+                    if (ts < 0) BigInteger.ZERO.subTo(r, r);
+                };
+  
+  
+                // (protected) return "-1/this % 2^DB"; useful for Mont. reduction
+                // justification:
+                //         xy == 1 (mod m)
+                //         xy =  1+km
+                //   xy(2-xy) = (1+km)(1-km)
+                // x[y(2-xy)] = 1-k^2m^2
+                // x[y(2-xy)] == 1 (mod m^2)
+                // if y is 1/x mod m, then y(2-xy) is 1/x mod m^2
+                // should reduce x and y(2-xy) by m^2 at each step to keep size bounded.
+                // JS multiply "overflows" differently from C/C++, so care is needed here.
+                BigInteger.prototype.invDigit = function () {
+                    if (this.t < 1) return 0;
+                    var x = this[0];
+                    if ((x & 1) == 0) return 0;
+                    var y = x & 3; // y == 1/x mod 2^2
+                    y = (y * (2 - (x & 0xf) * y)) & 0xf; // y == 1/x mod 2^4
+                    y = (y * (2 - (x & 0xff) * y)) & 0xff; // y == 1/x mod 2^8
+                    y = (y * (2 - (((x & 0xffff) * y) & 0xffff))) & 0xffff; // y == 1/x mod 2^16
+                    // last step - calculate inverse mod DV directly;
+                    // assumes 16 < DB <= 32 and assumes ability to handle 48-bit ints
+                    y = (y * (2 - x * y % this.DV)) % this.DV; // y == 1/x mod 2^dbits
+                    // we really want the negative inverse, and -DV < y < DV
+                    return (y > 0) ? this.DV - y : -y;
+                };
+  
+  
+                // (protected) true iff this is even
+                BigInteger.prototype.isEven = function () {
+                    return ((this.t > 0) ? (this[0] & 1) : this.s) == 0;
+                };
+  
+  
+                // (protected) this^e, e < 2^32, doing sqr and mul with "r" (HAC 14.79)
+                BigInteger.prototype.exp = function (e, z) {
+                    if (e > 0xffffffff || e < 1) return BigInteger.ONE;
+                    var r = nbi(),
+                        r2 = nbi(),
+                        g = z.convert(this),
+                        i = nbits(e) - 1;
+                    g.copyTo(r);
+                    while (--i >= 0) {
+                        z.sqrTo(r, r2);
+                        if ((e & (1 << i)) > 0) z.mulTo(r2, g, r);
+                        else {
+                            var t = r;
+                            r = r2;
+                            r2 = t;
+                        }
+                    }
+                    return z.revert(r);
+                };
+  
+  
+                // (public) return string representation in given radix
+                BigInteger.prototype.toString = function (b) {
+                    if (this.s < 0) return "-" + this.negate().toString(b);
+                    var k;
+                    if (b == 16) k = 4;
+                    else if (b == 8) k = 3;
+                    else if (b == 2) k = 1;
+                    else if (b == 32) k = 5;
+                    else if (b == 4) k = 2;
+                    else return this.toRadix(b);
+                    var km = (1 << k) - 1,
+                        d, m = false,
+                        r = "",
+                        i = this.t;
+                    var p = this.DB - (i * this.DB) % k;
+                    if (i-- > 0) {
+                        if (p < this.DB && (d = this[i] >> p) > 0) {
+                            m = true;
+                            r = int2char(d);
+                        }
+                        while (i >= 0) {
+                            if (p < k) {
+                                d = (this[i] & ((1 << p) - 1)) << (k - p);
+                                d |= this[--i] >> (p += this.DB - k);
+                            } else {
+                                d = (this[i] >> (p -= k)) & km;
+                                if (p <= 0) {
+                                    p += this.DB;
+                                    --i;
+                                }
+                            }
+                            if (d > 0) m = true;
+                            if (m) r += int2char(d);
+                        }
+                    }
+                    return m ? r : "0";
+                };
+  
+  
+                // (public) -this
+                BigInteger.prototype.negate = function () {
+                    var r = nbi();
+                    BigInteger.ZERO.subTo(this, r);
+                    return r;
+                };
+  
+                // (public) |this|
+                BigInteger.prototype.abs = function () {
+                    return (this.s < 0) ? this.negate() : this;
+                };
+  
+                // (public) return + if this > a, - if this < a, 0 if equal
+                BigInteger.prototype.compareTo = function (a) {
+                    var r = this.s - a.s;
+                    if (r != 0) return r;
+                    var i = this.t;
+                    r = i - a.t;
+                    if (r != 0) return (this.s < 0) ? -r : r;
+                    while (--i >= 0)
+                        if ((r = this[i] - a[i]) != 0) return r;
+                    return 0;
+                }
+  
+                // (public) return the number of bits in "this"
+                BigInteger.prototype.bitLength = function () {
+                    if (this.t <= 0) return 0;
+                    return this.DB * (this.t - 1) + nbits(this[this.t - 1] ^ (this.s & this.DM));
+                };
+  
+                // (public) this mod a
+                BigInteger.prototype.mod = function (a) {
+                    var r = nbi();
+                    this.abs().divRemTo(a, null, r);
+                    if (this.s < 0 && r.compareTo(BigInteger.ZERO) > 0) a.subTo(r, r);
+                    return r;
+                }
+  
+                // (public) this^e % m, 0 <= e < 2^32
+                BigInteger.prototype.modPowInt = function (e, m) {
+                    var z;
+                    if (e < 256 || m.isEven()) z = new Classic(m);
+                    else z = new Montgomery(m);
+                    return this.exp(e, z);
+                };
+  
+                // "constants"
+                BigInteger.ZERO = nbv(0);
+                BigInteger.ONE = nbv(1);
+  
+  
+  
+  
+  
+  
+  
+                // Copyright (c) 2005-2009  Tom Wu
+                // All Rights Reserved.
+                // See "LICENSE" for details.
+                // Extended JavaScript BN functions, required for RSA private ops.
+                // Version 1.1: new BigInteger("0", 10) returns "proper" zero
+                // Version 1.2: square() API, isProbablePrime fix
+  
+  
+                // return index of lowest 1-bit in x, x < 2^31
+                function lbit(x) {
+                    if (x == 0) return -1;
+                    var r = 0;
+                    if ((x & 0xffff) == 0) {
+                        x >>= 16;
+                        r += 16;
+                    }
+                    if ((x & 0xff) == 0) {
+                        x >>= 8;
+                        r += 8;
+                    }
+                    if ((x & 0xf) == 0) {
+                        x >>= 4;
+                        r += 4;
+                    }
+                    if ((x & 3) == 0) {
+                        x >>= 2;
+                        r += 2;
+                    }
+                    if ((x & 1) == 0) ++r;
+                    return r;
+                }
+  
+                // return number of 1 bits in x
+                function cbit(x) {
+                    var r = 0;
+                    while (x != 0) {
+                        x &= x - 1;
+                        ++r;
+                    }
+                    return r;
+                }
+  
+                var lowprimes = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83,
+                    89,
+                    97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191,
+                    193,
+                    197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307,
+                    311,
+                    313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, 401, 409, 419, 421, 431,
+                    433,
+                    439, 443, 449, 457, 461, 463, 467, 479, 487, 491, 499, 503, 509, 521, 523, 541, 547, 557, 563,
+                    569,
+                    571, 577, 587, 593, 599, 601, 607, 613, 617, 619, 631, 641, 643, 647, 653, 659, 661, 673, 677,
+                    683,
+                    691, 701, 709, 719, 727, 733, 739, 743, 751, 757, 761, 769, 773, 787, 797, 809, 811, 821, 823,
+                    827,
+                    829, 839, 853, 857, 859, 863, 877, 881, 883, 887, 907, 911, 919, 929, 937, 941, 947, 953, 967,
+                    971,
+                    977, 983, 991, 997
+                ];
+                var lplim = (1 << 26) / lowprimes[lowprimes.length - 1];
+  
+  
+  
+                // (protected) return x s.t. r^x < DV
+                BigInteger.prototype.chunkSize = function (r) {
+                    return Math.floor(Math.LN2 * this.DB / Math.log(r));
+                };
+  
+                // (protected) convert to radix string
+                BigInteger.prototype.toRadix = function (b) {
+                    if (b == null) b = 10;
+                    if (this.signum() == 0 || b < 2 || b > 36) return "0";
+                    var cs = this.chunkSize(b);
+                    var a = Math.pow(b, cs);
+                    var d = nbv(a),
+                        y = nbi(),
+                        z = nbi(),
+                        r = "";
+                    this.divRemTo(d, y, z);
+                    while (y.signum() > 0) {
+                        r = (a + z.intValue()).toString(b).substr(1) + r;
+                        y.divRemTo(d, y, z);
+                    }
+                    return z.intValue().toString(b) + r;
+                };
+  
+                // (protected) convert from radix string
+                BigInteger.prototype.fromRadix = function (s, b) {
+                    this.fromInt(0);
+                    if (b == null) b = 10;
+                    var cs = this.chunkSize(b);
+                    var d = Math.pow(b, cs),
+                        mi = false,
+                        j = 0,
+                        w = 0;
+                    for (var i = 0; i < s.length; ++i) {
+                        var x = intAt(s, i);
+                        if (x < 0) {
+                            if (s.charAt(i) == "-" && this.signum() == 0) mi = true;
+                            continue;
+                        }
+                        w = b * w + x;
+                        if (++j >= cs) {
+                            this.dMultiply(d);
+                            this.dAddOffset(w, 0);
+                            j = 0;
+                            w = 0;
+                        }
+                    }
+                    if (j > 0) {
+                        this.dMultiply(Math.pow(b, j));
+                        this.dAddOffset(w, 0);
+                    }
+                    if (mi) BigInteger.ZERO.subTo(this, this);
+                };
+  
+                // (protected) alternate constructor
+                BigInteger.prototype.fromNumber = function (a, b, c) {
+                    if ("number" == typeof b) {
+                        // new BigInteger(int,int,RNG)
+                        if (a < 2) this.fromInt(1);
+                        else {
+                            this.fromNumber(a, c);
+                            if (!this.testBit(a - 1)) // force MSB set
+                                this.bitwiseTo(BigInteger.ONE.shiftLeft(a - 1), op_or, this);
+                            if (this.isEven()) this.dAddOffset(1, 0); // force odd
+                            while (!this.isProbablePrime(b)) {
+                                this.dAddOffset(2, 0);
+                                if (this.bitLength() > a) this.subTo(BigInteger.ONE.shiftLeft(a - 1), this);
+                            }
+                        }
+                    } else {
+                        // new BigInteger(int,RNG)
+                        var x = new Array(),
+                            t = a & 7;
+                        x.length = (a >> 3) + 1;
+                        b.nextBytes(x);
+                        if (t > 0) x[0] &= ((1 << t) - 1);
+                        else x[0] = 0;
+                        this.fromString(x, 256);
+                    }
+                };
+  
+                // (protected) r = this op a (bitwise)
+                BigInteger.prototype.bitwiseTo = function (a, op, r) {
+                    var i, f, m = Math.min(a.t, this.t);
+                    for (i = 0; i < m; ++i) r[i] = op(this[i], a[i]);
+                    if (a.t < this.t) {
+                        f = a.s & this.DM;
+                        for (i = m; i < this.t; ++i) r[i] = op(this[i], f);
+                        r.t = this.t;
+                    } else {
+                        f = this.s & this.DM;
+                        for (i = m; i < a.t; ++i) r[i] = op(f, a[i]);
+                        r.t = a.t;
+                    }
+                    r.s = op(this.s, a.s);
+                    r.clamp();
+                };
+  
+                // (protected) this op (1<<n)
+                BigInteger.prototype.changeBit = function (n, op) {
+                    var r = BigInteger.ONE.shiftLeft(n);
+                    this.bitwiseTo(r, op, r);
+                    return r;
+                };
+  
+                // (protected) r = this + a
+                BigInteger.prototype.addTo = function (a, r) {
+                    var i = 0,
+                        c = 0,
+                        m = Math.min(a.t, this.t);
+                    while (i < m) {
+                        c += this[i] + a[i];
+                        r[i++] = c & this.DM;
+                        c >>= this.DB;
+                    }
+                    if (a.t < this.t) {
+                        c += a.s;
+                        while (i < this.t) {
+                            c += this[i];
+                            r[i++] = c & this.DM;
+                            c >>= this.DB;
+                        }
+                        c += this.s;
+                    } else {
+                        c += this.s;
+                        while (i < a.t) {
+                            c += a[i];
+                            r[i++] = c & this.DM;
+                            c >>= this.DB;
+                        }
+                        c += a.s;
+                    }
+                    r.s = (c < 0) ? -1 : 0;
+                    if (c > 0) r[i++] = c;
+                    else if (c < -1) r[i++] = this.DV + c;
+                    r.t = i;
+                    r.clamp();
+                };
+  
+                // (protected) this *= n, this >= 0, 1 < n < DV
+                BigInteger.prototype.dMultiply = function (n) {
+                    this[this.t] = this.am(0, n - 1, this, 0, 0, this.t);
+                    ++this.t;
+                    this.clamp();
+                };
+  
+                // (protected) this += n << w words, this >= 0
+                BigInteger.prototype.dAddOffset = function (n, w) {
+                    if (n == 0) return;
+                    while (this.t <= w) this[this.t++] = 0;
+                    this[w] += n;
+                    while (this[w] >= this.DV) {
+                        this[w] -= this.DV;
+                        if (++w >= this.t) this[this.t++] = 0;
+                        ++this[w];
+                    }
+                };
+  
+                // (protected) r = lower n words of "this * a", a.t <= n
+                // "this" should be the larger one if appropriate.
+                BigInteger.prototype.multiplyLowerTo = function (a, n, r) {
+                    var i = Math.min(this.t + a.t, n);
+                    r.s = 0; // assumes a,this >= 0
+                    r.t = i;
+                    while (i > 0) r[--i] = 0;
+                    var j;
+                    for (j = r.t - this.t; i < j; ++i) r[i + this.t] = this.am(0, a[i], r, i, 0, this.t);
+                    for (j = Math.min(a.t, n); i < j; ++i) this.am(0, a[i], r, i, 0, n - i);
+                    r.clamp();
+                };
+  
+  
+                // (protected) r = "this * a" without lower n words, n > 0
+                // "this" should be the larger one if appropriate.
+                BigInteger.prototype.multiplyUpperTo = function (a, n, r) {
+                    --n;
+                    var i = r.t = this.t + a.t - n;
+                    r.s = 0; // assumes a,this >= 0
+                    while (--i >= 0) r[i] = 0;
+                    for (i = Math.max(n - this.t, 0); i < a.t; ++i)
+                        r[this.t + i - n] = this.am(n - i, a[i], r, 0, 0, this.t + i - n);
+                    r.clamp();
+                    r.drShiftTo(1, r);
+                };
+  
+                // (protected) this % n, n < 2^26
+                BigInteger.prototype.modInt = function (n) {
+                    if (n <= 0) return 0;
+                    var d = this.DV % n,
+                        r = (this.s < 0) ? n - 1 : 0;
+                    if (this.t > 0)
+                        if (d == 0) r = this[0] % n;
+                        else
+                            for (var i = this.t - 1; i >= 0; --i) r = (d * r + this[i]) % n;
+                    return r;
+                };
+  
+  
+                // (protected) true if probably prime (HAC 4.24, Miller-Rabin)
+                BigInteger.prototype.millerRabin = function (t) {
+                    var n1 = this.subtract(BigInteger.ONE);
+                    var k = n1.getLowestSetBit();
+                    if (k <= 0) return false;
+                    var r = n1.shiftRight(k);
+                    t = (t + 1) >> 1;
+                    if (t > lowprimes.length) t = lowprimes.length;
+                    var a = nbi();
+                    for (var i = 0; i < t; ++i) {
+                        //Pick bases at random, instead of starting at 2
+                        a.fromInt(lowprimes[Math.floor(Math.random() * lowprimes.length)]);
+                        var y = a.modPow(r, this);
+                        if (y.compareTo(BigInteger.ONE) != 0 && y.compareTo(n1) != 0) {
+                            var j = 1;
+                            while (j++ < k && y.compareTo(n1) != 0) {
+                                y = y.modPowInt(2, this);
+                                if (y.compareTo(BigInteger.ONE) == 0) return false;
+                            }
+                            if (y.compareTo(n1) != 0) return false;
+                        }
+                    }
+                    return true;
+                };
+  
+  
+  
+                // (public)
+                BigInteger.prototype.clone = function () {
+                    var r = nbi();
+                    this.copyTo(r);
+                    return r;
+                };
+  
+                // (public) return value as integer
+                BigInteger.prototype.intValue = function () {
+                    if (this.s < 0) {
+                        if (this.t == 1) return this[0] - this.DV;
+                        else if (this.t == 0) return -1;
+                    } else if (this.t == 1) return this[0];
+                    else if (this.t == 0) return 0;
+                    // assumes 16 < DB < 32
+                    return ((this[1] & ((1 << (32 - this.DB)) - 1)) << this.DB) | this[0];
+                };
+  
+  
+                // (public) return value as byte
+                BigInteger.prototype.byteValue = function () {
+                    return (this.t == 0) ? this.s : (this[0] << 24) >> 24;
+                };
+  
+                // (public) return value as short (assumes DB>=16)
+                BigInteger.prototype.shortValue = function () {
+                    return (this.t == 0) ? this.s : (this[0] << 16) >> 16;
+                };
+  
+                // (public) 0 if this == 0, 1 if this > 0
+                BigInteger.prototype.signum = function () {
+                    if (this.s < 0) return -1;
+                    else if (this.t <= 0 || (this.t == 1 && this[0] <= 0)) return 0;
+                    else return 1;
+                };
+  
+  
+                // (public) convert to bigendian byte array
+                BigInteger.prototype.toByteArray = function () {
+                    var i = this.t,
+                        r = new Array();
+                    r[0] = this.s;
+                    var p = this.DB - (i * this.DB) % 8,
+                        d, k = 0;
+                    if (i-- > 0) {
+                        if (p < this.DB && (d = this[i] >> p) != (this.s & this.DM) >> p)
+                            r[k++] = d | (this.s << (this.DB - p));
+                        while (i >= 0) {
+                            if (p < 8) {
+                                d = (this[i] & ((1 << p) - 1)) << (8 - p);
+                                d |= this[--i] >> (p += this.DB - 8);
+                            } else {
+                                d = (this[i] >> (p -= 8)) & 0xff;
+                                if (p <= 0) {
+                                    p += this.DB;
+                                    --i;
+                                }
+                            }
+                            if ((d & 0x80) != 0) d |= -256;
+                            if (k == 0 && (this.s & 0x80) != (d & 0x80)) ++k;
+                            if (k > 0 || d != this.s) r[k++] = d;
+                        }
+                    }
+                    return r;
+                };
+  
+                BigInteger.prototype.equals = function (a) {
+                    return (this.compareTo(a) == 0);
+                };
+                BigInteger.prototype.min = function (a) {
+                    return (this.compareTo(a) < 0) ? this : a;
+                };
+                BigInteger.prototype.max = function (a) {
+                    return (this.compareTo(a) > 0) ? this : a;
+                };
+  
+                // (public) this & a
+                function op_and(x, y) {
+                    return x & y;
+                }
+                BigInteger.prototype.and = function (a) {
+                    var r = nbi();
+                    this.bitwiseTo(a, op_and, r);
+                    return r;
+                };
+  
+                // (public) this | a
+                function op_or(x, y) {
+                    return x | y;
+                }
+                BigInteger.prototype.or = function (a) {
+                    var r = nbi();
+                    this.bitwiseTo(a, op_or, r);
+                    return r;
+                };
+  
+                // (public) this ^ a
+                function op_xor(x, y) {
+                    return x ^ y;
+                }
+                BigInteger.prototype.xor = function (a) {
+                    var r = nbi();
+                    this.bitwiseTo(a, op_xor, r);
+                    return r;
+                };
+  
+                // (public) this & ~a
+                function op_andnot(x, y) {
+                    return x & ~y;
+                }
+                BigInteger.prototype.andNot = function (a) {
+                    var r = nbi();
+                    this.bitwiseTo(a, op_andnot, r);
+                    return r;
+                };
+  
+                // (public) ~this
+                BigInteger.prototype.not = function () {
+                    var r = nbi();
+                    for (var i = 0; i < this.t; ++i) r[i] = this.DM & ~this[i];
+                    r.t = this.t;
+                    r.s = ~this.s;
+                    return r;
+                };
+  
+                // (public) this << n
+                BigInteger.prototype.shiftLeft = function (n) {
+                    var r = nbi();
+                    if (n < 0) this.rShiftTo(-n, r);
+                    else this.lShiftTo(n, r);
+                    return r;
+                };
+  
+                // (public) this >> n
+                BigInteger.prototype.shiftRight = function (n) {
+                    var r = nbi();
+                    if (n < 0) this.lShiftTo(-n, r);
+                    else this.rShiftTo(n, r);
+                    return r;
+                };
+  
+                // (public) returns index of lowest 1-bit (or -1 if none)
+                BigInteger.prototype.getLowestSetBit = function () {
+                    for (var i = 0; i < this.t; ++i)
+                        if (this[i] != 0) return i * this.DB + lbit(this[i]);
+                    if (this.s < 0) return this.t * this.DB;
+                    return -1;
+                };
+  
+                // (public) return number of set bits
+                BigInteger.prototype.bitCount = function () {
+                    var r = 0,
+                        x = this.s & this.DM;
+                    for (var i = 0; i < this.t; ++i) r += cbit(this[i] ^ x);
+                    return r;
+                };
+  
+                // (public) true iff nth bit is set
+                BigInteger.prototype.testBit = function (n) {
+                    var j = Math.floor(n / this.DB);
+                    if (j >= this.t) return (this.s != 0);
+                    return ((this[j] & (1 << (n % this.DB))) != 0);
+                };
+  
+                // (public) this | (1<<n)
+                BigInteger.prototype.setBit = function (n) {
+                    return this.changeBit(n, op_or);
+                };
+                // (public) this & ~(1<<n)
+                BigInteger.prototype.clearBit = function (n) {
+                    return this.changeBit(n, op_andnot);
+                };
+                // (public) this ^ (1<<n)
+                BigInteger.prototype.flipBit = function (n) {
+                    return this.changeBit(n, op_xor);
+                };
+                // (public) this + a
+                BigInteger.prototype.add = function (a) {
+                    var r = nbi();
+                    this.addTo(a, r);
+                    return r;
+                };
+                // (public) this - a
+                BigInteger.prototype.subtract = function (a) {
+                    var r = nbi();
+                    this.subTo(a, r);
+                    return r;
+                };
+                // (public) this * a
+                BigInteger.prototype.multiply = function (a) {
+                    var r = nbi();
+                    this.multiplyTo(a, r);
+                    return r;
+                };
+                // (public) this / a
+                BigInteger.prototype.divide = function (a) {
+                    var r = nbi();
+                    this.divRemTo(a, r, null);
+                    return r;
+                };
+                // (public) this % a
+                BigInteger.prototype.remainder = function (a) {
+                    var r = nbi();
+                    this.divRemTo(a, null, r);
+                    return r;
+                };
+                // (public) [this/a,this%a]
+                BigInteger.prototype.divideAndRemainder = function (a) {
+                    var q = nbi(),
+                        r = nbi();
+                    this.divRemTo(a, q, r);
+                    return new Array(q, r);
+                };
+  
+                // (public) this^e % m (HAC 14.85)
+                BigInteger.prototype.modPow = function (e, m) {
+                    var i = e.bitLength(),
+                        k, r = nbv(1),
+                        z;
+                    if (i <= 0) return r;
+                    else if (i < 18) k = 1;
+                    else if (i < 48) k = 3;
+                    else if (i < 144) k = 4;
+                    else if (i < 768) k = 5;
+                    else k = 6;
+                    if (i < 8)
+                        z = new Classic(m);
+                    else if (m.isEven())
+                        z = new Barrett(m);
+                    else
+                        z = new Montgomery(m);
+  
+                    // precomputation
+                    var g = new Array(),
+                        n = 3,
+                        k1 = k - 1,
+                        km = (1 << k) - 1;
+                    g[1] = z.convert(this);
+                    if (k > 1) {
+                        var g2 = nbi();
+                        z.sqrTo(g[1], g2);
+                        while (n <= km) {
+                            g[n] = nbi();
+                            z.mulTo(g2, g[n - 2], g[n]);
+                            n += 2;
+                        }
+                    }
+  
+                    var j = e.t - 1,
+                        w, is1 = true,
+                        r2 = nbi(),
+                        t;
+                    i = nbits(e[j]) - 1;
+                    while (j >= 0) {
+                        if (i >= k1) w = (e[j] >> (i - k1)) & km;
+                        else {
+                            w = (e[j] & ((1 << (i + 1)) - 1)) << (k1 - i);
+                            if (j > 0) w |= e[j - 1] >> (this.DB + i - k1);
+                        }
+  
+                        n = k;
+                        while ((w & 1) == 0) {
+                            w >>= 1;
+                            --n;
+                        }
+                        if ((i -= n) < 0) {
+                            i += this.DB;
+                            --j;
+                        }
+                        if (is1) { // ret == 1, don't bother squaring or multiplying it
+                            g[w].copyTo(r);
+                            is1 = false;
+                        } else {
+                            while (n > 1) {
+                                z.sqrTo(r, r2);
+                                z.sqrTo(r2, r);
+                                n -= 2;
+                            }
+                            if (n > 0) z.sqrTo(r, r2);
+                            else {
+                                t = r;
+                                r = r2;
+                                r2 = t;
+                            }
+                            z.mulTo(r2, g[w], r);
+                        }
+  
+                        while (j >= 0 && (e[j] & (1 << i)) == 0) {
+                            z.sqrTo(r, r2);
+                            t = r;
+                            r = r2;
+                            r2 = t;
+                            if (--i < 0) {
+                                i = this.DB - 1;
+                                --j;
+                            }
+                        }
+                    }
+                    return z.revert(r);
+                };
+  
+                // (public) 1/this % m (HAC 14.61)
+                BigInteger.prototype.modInverse = function (m) {
+                    var ac = m.isEven();
+                    if (this.signum() === 0) throw new Error('division by zero');
+                    if ((this.isEven() && ac) || m.signum() == 0) return BigInteger.ZERO;
+                    var u = m.clone(),
+                        v = this.clone();
+                    var a = nbv(1),
+                        b = nbv(0),
+                        c = nbv(0),
+                        d = nbv(1);
+                    while (u.signum() != 0) {
+                        while (u.isEven()) {
+                            u.rShiftTo(1, u);
+                            if (ac) {
+                                if (!a.isEven() || !b.isEven()) {
+                                    a.addTo(this, a);
+                                    b.subTo(m, b);
+                                }
+                                a.rShiftTo(1, a);
+                            } else if (!b.isEven()) b.subTo(m, b);
+                            b.rShiftTo(1, b);
+                        }
+                        while (v.isEven()) {
+                            v.rShiftTo(1, v);
+                            if (ac) {
+                                if (!c.isEven() || !d.isEven()) {
+                                    c.addTo(this, c);
+                                    d.subTo(m, d);
+                                }
+                                c.rShiftTo(1, c);
+                            } else if (!d.isEven()) d.subTo(m, d);
+                            d.rShiftTo(1, d);
+                        }
+                        if (u.compareTo(v) >= 0) {
+                            u.subTo(v, u);
+                            if (ac) a.subTo(c, a);
+                            b.subTo(d, b);
+                        } else {
+                            v.subTo(u, v);
+                            if (ac) c.subTo(a, c);
+                            d.subTo(b, d);
+                        }
+                    }
+                    if (v.compareTo(BigInteger.ONE) != 0) return BigInteger.ZERO;
+                    while (d.compareTo(m) >= 0) d.subTo(m, d);
+                    while (d.signum() < 0) d.addTo(m, d);
+                    return d;
+                };
+  
+  
+                // (public) this^e
+                BigInteger.prototype.pow = function (e) {
+                    return this.exp(e, new NullExp());
+                };
+  
+                // (public) gcd(this,a) (HAC 14.54)
+                BigInteger.prototype.gcd = function (a) {
+                    var x = (this.s < 0) ? this.negate() : this.clone();
+                    var y = (a.s < 0) ? a.negate() : a.clone();
+                    if (x.compareTo(y) < 0) {
+                        var t = x;
+                        x = y;
+                        y = t;
+                    }
+                    var i = x.getLowestSetBit(),
+                        g = y.getLowestSetBit();
+                    if (g < 0) return x;
+                    if (i < g) g = i;
+                    if (g > 0) {
+                        x.rShiftTo(g, x);
+                        y.rShiftTo(g, y);
+                    }
+                    while (x.signum() > 0) {
+                        if ((i = x.getLowestSetBit()) > 0) x.rShiftTo(i, x);
+                        if ((i = y.getLowestSetBit()) > 0) y.rShiftTo(i, y);
+                        if (x.compareTo(y) >= 0) {
+                            x.subTo(y, x);
+                            x.rShiftTo(1, x);
+                        } else {
+                            y.subTo(x, y);
+                            y.rShiftTo(1, y);
+                        }
+                    }
+                    if (g > 0) y.lShiftTo(g, y);
+                    return y;
+                };
+  
+                // (public) test primality with certainty >= 1-.5^t
+                BigInteger.prototype.isProbablePrime = function (t) {
+                    var i, x = this.abs();
+                    if (x.t == 1 && x[0] <= lowprimes[lowprimes.length - 1]) {
+                        for (i = 0; i < lowprimes.length; ++i)
+                            if (x[0] == lowprimes[i]) return true;
+                        return false;
+                    }
+                    if (x.isEven()) return false;
+                    i = 1;
+                    while (i < lowprimes.length) {
+                        var m = lowprimes[i],
+                            j = i + 1;
+                        while (j < lowprimes.length && m < lplim) m *= lowprimes[j++];
+                        m = x.modInt(m);
+                        while (i < j)
+                            if (m % lowprimes[i++] == 0) return false;
+                    }
+                    return x.millerRabin(t);
+                };
+  
+  
+                // JSBN-specific extension
+  
+                // (public) this^2
+                BigInteger.prototype.square = function () {
+                    var r = nbi();
+                    this.squareTo(r);
+                    return r;
+                };
+  
+  
+                // NOTE: BigInteger interfaces not implemented in jsbn:
+                // BigInteger(int signum, byte[] magnitude)
+                // double doubleValue()
+                // float floatValue()
+                // int hashCode()
+                // long longValue()
+                // static BigInteger valueOf(long val)
+  
+  
+  
+                // Copyright Stephan Thomas (start) --- //
+                // https://raw.github.com/bitcoinjs/bitcoinjs-lib/07f9d55ccb6abd962efb6befdd37671f85ea4ff9/src/util.js
+                // BigInteger monkey patching
+                BigInteger.valueOf = nbv;
+  
+                /**
+                * Returns a byte array representation of the big integer.
+                *
+                * This returns the absolute of the contained value in big endian
+                * form. A value of zero results in an empty array.
+                */
+                BigInteger.prototype.toByteArrayUnsigned = function () {
+                    var ba = this.abs().toByteArray();
+                    if (ba.length) {
+                        if (ba[0] == 0) {
+                            ba = ba.slice(1);
+                        }
+                        return ba.map(function (v) {
+                            return (v < 0) ? v + 256 : v;
+                        });
+                    } else {
+                        // Empty array, nothing to do
+                        return ba;
+                    }
+                };
+  
+                /**
+                * Turns a byte array into a big integer.
+                *
+                * This function will interpret a byte array as a big integer in big
+                * endian notation and ignore leading zeros.
+                */
+                BigInteger.fromByteArrayUnsigned = function (ba) {
+                    if (!ba.length) {
+                        return ba.valueOf(0);
+                    } else if (ba[0] & 0x80) {
+                        // Prepend a zero so the BigInteger class doesn't mistake this
+                        // for a negative integer.
+                        return new BigInteger([0].concat(ba));
+                    } else {
+                        return new BigInteger(ba);
+                    }
+                };
+  
+                /**
+                * Converts big integer to signed byte representation.
+                *
+                * The format for this value uses a the most significant bit as a sign
+                * bit. If the most significant bit is already occupied by the
+                * absolute value, an extra byte is prepended and the sign bit is set
+                * there.
+                *
+                * Examples:
+                *
+                *      0 =>     0x00
+                *      1 =>     0x01
+                *     -1 =>     0x81
+                *    127 =>     0x7f
+                *   -127 =>     0xff
+                *    128 =>   0x0080
+                *   -128 =>   0x8080
+                *    255 =>   0x00ff
+                *   -255 =>   0x80ff
+                *  16300 =>   0x3fac
+                * -16300 =>   0xbfac
+                *  62300 => 0x00f35c
+                * -62300 => 0x80f35c
+                */
+                BigInteger.prototype.toByteArraySigned = function () {
+                    var val = this.abs().toByteArrayUnsigned();
+                    var neg = this.compareTo(BigInteger.ZERO) < 0;
+  
+                    if (neg) {
+                        if (val[0] & 0x80) {
+                            val.unshift(0x80);
+                        } else {
+                            val[0] |= 0x80;
+                        }
+                    } else {
+                        if (val[0] & 0x80) {
+                            val.unshift(0x00);
+                        }
+                    }
+  
+                    return val;
+                };
+  
+                /**
+                * Parse a signed big integer byte representation.
+                *
+                * For details on the format please see BigInteger.toByteArraySigned.
+                */
+                BigInteger.fromByteArraySigned = function (ba) {
+                    // Check for negative value
+                    if (ba[0] & 0x80) {
+                        // Remove sign bit
+                        ba[0] &= 0x7f;
+  
+                        return BigInteger.fromByteArrayUnsigned(ba).negate();
+                    } else {
+                        return BigInteger.fromByteArrayUnsigned(ba);
+                    }
+                };
+                // Copyright Stephan Thomas (end) --- //
+  
+  
+  
+  
+                // ****** REDUCTION ******* //
+  
+                // Modular reduction using "classic" algorithm
+                var Classic = window.Classic = function Classic(m) {
+                    this.m = m;
+                }
+                Classic.prototype.convert = function (x) {
+                    if (x.s < 0 || x.compareTo(this.m) >= 0) return x.mod(this.m);
+                    else return x;
+                };
+                Classic.prototype.revert = function (x) {
+                    return x;
+                };
+                Classic.prototype.reduce = function (x) {
+                    x.divRemTo(this.m, null, x);
+                };
+                Classic.prototype.mulTo = function (x, y, r) {
+                    x.multiplyTo(y, r);
+                    this.reduce(r);
+                };
+                Classic.prototype.sqrTo = function (x, r) {
+                    x.squareTo(r);
+                    this.reduce(r);
+                };
+  
+  
+  
+  
+  
+                // Montgomery reduction
+                var Montgomery = window.Montgomery = function Montgomery(m) {
+                    this.m = m;
+                    this.mp = m.invDigit();
+                    this.mpl = this.mp & 0x7fff;
+                    this.mph = this.mp >> 15;
+                    this.um = (1 << (m.DB - 15)) - 1;
+                    this.mt2 = 2 * m.t;
+                }
+                // xR mod m
+                Montgomery.prototype.convert = function (x) {
+                    var r = nbi();
+                    x.abs().dlShiftTo(this.m.t, r);
+                    r.divRemTo(this.m, null, r);
+                    if (x.s < 0 && r.compareTo(BigInteger.ZERO) > 0) this.m.subTo(r, r);
+                    return r;
+                }
+                // x/R mod m
+                Montgomery.prototype.revert = function (x) {
+                    var r = nbi();
+                    x.copyTo(r);
+                    this.reduce(r);
+                    return r;
+                };
+                // x = x/R mod m (HAC 14.32)
+                Montgomery.prototype.reduce = function (x) {
+                    while (x.t <= this.mt2) // pad x so am has enough room later
+                        x[x.t++] = 0;
+                    for (var i = 0; i < this.m.t; ++i) {
+                        // faster way of calculating u0 = x[i]*mp mod DV
+                        var j = x[i] & 0x7fff;
+                        var u0 = (j * this.mpl + (((j * this.mph + (x[i] >> 15) * this.mpl) & this.um) << 15)) & x.DM;
+                        // use am to combine the multiply-shift-add into one call
+                        j = i + this.m.t;
+                        x[j] += this.m.am(0, u0, x, i, 0, this.m.t);
+                        // propagate carry
+                        while (x[j] >= x.DV) {
+                            x[j] -= x.DV;
+                            x[++j]++;
+                        }
+                    }
+                    x.clamp();
+                    x.drShiftTo(this.m.t, x);
+                    if (x.compareTo(this.m) >= 0) x.subTo(this.m, x);
+                };
+                // r = "xy/R mod m"; x,y != r
+                Montgomery.prototype.mulTo = function (x, y, r) {
+                    x.multiplyTo(y, r);
+                    this.reduce(r);
+                };
+                // r = "x^2/R mod m"; x != r
+                Montgomery.prototype.sqrTo = function (x, r) {
+                    x.squareTo(r);
+                    this.reduce(r);
+                };
+  
+  
+  
+  
+  
+                // A "null" reducer
+                var NullExp = window.NullExp = function NullExp() {}
+                NullExp.prototype.convert = function (x) {
+                    return x;
+                };
+                NullExp.prototype.revert = function (x) {
+                    return x;
+                };
+                NullExp.prototype.mulTo = function (x, y, r) {
+                    x.multiplyTo(y, r);
+                };
+                NullExp.prototype.sqrTo = function (x, r) {
+                    x.squareTo(r);
+                };
+  
+  
+  
+  
+  
+                // Barrett modular reduction
+                var Barrett = window.Barrett = function Barrett(m) {
+                    // setup Barrett
+                    this.r2 = nbi();
+                    this.q3 = nbi();
+                    BigInteger.ONE.dlShiftTo(2 * m.t, this.r2);
+                    this.mu = this.r2.divide(m);
+                    this.m = m;
+                }
+                Barrett.prototype.convert = function (x) {
+                    if (x.s < 0 || x.t > 2 * this.m.t) return x.mod(this.m);
+                    else if (x.compareTo(this.m) < 0) return x;
+                    else {
+                        var r = nbi();
+                        x.copyTo(r);
+                        this.reduce(r);
+                        return r;
+                    }
+                };
+                Barrett.prototype.revert = function (x) {
+                    return x;
+                };
+                // x = x mod m (HAC 14.42)
+                Barrett.prototype.reduce = function (x) {
+                    x.drShiftTo(this.m.t - 1, this.r2);
+                    if (x.t > this.m.t + 1) {
+                        x.t = this.m.t + 1;
+                        x.clamp();
+                    }
+                    this.mu.multiplyUpperTo(this.r2, this.m.t + 1, this.q3);
+                    this.m.multiplyLowerTo(this.q3, this.m.t + 1, this.r2);
+                    while (x.compareTo(this.r2) < 0) x.dAddOffset(1, this.m.t + 1);
+                    x.subTo(this.r2, x);
+                    while (x.compareTo(this.m) >= 0) x.subTo(this.m, x);
+                };
+                // r = x*y mod m; x,y != r
+                Barrett.prototype.mulTo = function (x, y, r) {
+                    x.multiplyTo(y, r);
+                    this.reduce(r);
+                };
+                // r = x^2 mod m; x != r
+                Barrett.prototype.sqrTo = function (x, r) {
+                    x.squareTo(r);
+                    this.reduce(r);
+                };
+  
+            })();
+  
+            // BigInteger interfaces not implemented in jsbn:
+  
+            // BigInteger(int signum, byte[] magnitude)
+            // double doubleValue()
+            // float floatValue()
+            // int hashCode()
+            // long longValue()
+            // static BigInteger valueOf(long val)
+  
+  
+  
+  
+  
+            //ellipticcurve.js
+            /*!
+             * Basic Javascript Elliptic Curve implementation
+             * Ported loosely from BouncyCastle's Java EC code
+             * Only Fp curves implemented for now
+             *
+             * Copyright Tom Wu, bitaddress.org  BSD License.
+             * http://www-cs-students.stanford.edu/~tjw/jsbn/LICENSE
+             */
+            (function () {
+  
+                // Constructor function of Global EllipticCurve object
+                var ec  = window.EllipticCurve = function () {};
+  
+                // ----------------
+                // ECFieldElementFp constructor
+                // q instanceof BigInteger
+                // x instanceof BigInteger
+                ec.FieldElementFp = function (q, x) {
+                    this.x = x;
+                    // TODO if(x.compareTo(q) >= 0) error
+                    this.q = q;
+                };
+  
+                ec.FieldElementFp.prototype.equals = function (other) {
+                    if (other == this) return true;
+                    return (this.q.equals(other.q) && this.x.equals(other.x));
+                };
+  
+                ec.FieldElementFp.prototype.toBigInteger = function () {
+                    return this.x;
+                };
+  
+                ec.FieldElementFp.prototype.negate = function () {
+                    return new ec.FieldElementFp(this.q, this.x.negate().mod(this.q));
+                };
+  
+                ec.FieldElementFp.prototype.add = function (b) {
+                    return new ec.FieldElementFp(this.q, this.x.add(b.toBigInteger()).mod(this.q));
+                };
+  
+                ec.FieldElementFp.prototype.subtract = function (b) {
+                    return new ec.FieldElementFp(this.q, this.x.subtract(b.toBigInteger()).mod(this.q));
+                };
+  
+                ec.FieldElementFp.prototype.multiply = function (b) {
+                    return new ec.FieldElementFp(this.q, this.x.multiply(b.toBigInteger()).mod(this.q));
+                };
+  
+                ec.FieldElementFp.prototype.square = function () {
+                    return new ec.FieldElementFp(this.q, this.x.square().mod(this.q));
+                };
+  
+                ec.FieldElementFp.prototype.divide = function (b) {
+                    return new ec.FieldElementFp(this.q, this.x.multiply(b.toBigInteger().modInverse(this.q)).mod(
+                        this.q));
+                };
+  
+                ec.FieldElementFp.prototype.getByteLength = function () {
+                    return Math.floor((this.toBigInteger().bitLength() + 7) / 8);
+                };
+  
+                // D.1.4 91
+                /**
+                 * return a sqrt root - the routine verifies that the calculation
+                 * returns the right value - if none exists it returns null.
+                 *
+                 * Copyright (c) 2000 - 2011 The Legion Of The Bouncy Castle (http://www.bouncycastle.org)
+                 * Ported to JavaScript by bitaddress.org
+                 */
+                ec.FieldElementFp.prototype.sqrt = function () {
+                    if (!this.q.testBit(0)) throw new Error("even value of q");
+  
+                    // p mod 4 == 3
+                    if (this.q.testBit(1)) {
+                        // z = g^(u+1) + p, p = 4u + 3
+                        var z = new ec.FieldElementFp(this.q, this.x.modPow(this.q.shiftRight(2).add(BigInteger.ONE),
+                            this.q));
+                        return z.square().equals(this) ? z : null;
+                    }
+  
+                    // p mod 4 == 1
+                    var qMinusOne = this.q.subtract(BigInteger.ONE);
+                    var legendreExponent = qMinusOne.shiftRight(1);
+                    if (!(this.x.modPow(legendreExponent, this.q).equals(BigInteger.ONE))) return null;
+                    var u = qMinusOne.shiftRight(2);
+                    var k = u.shiftLeft(1).add(BigInteger.ONE);
+                    var Q = this.x;
+                    var fourQ = Q.shiftLeft(2).mod(this.q);
+                    var U, V;
+  
+                    do {
+                        var rand = new SecureRandom();
+                        var P;
+                        do {
+                            P = new BigInteger(this.q.bitLength(), rand);
+                        }
+                        while (P.compareTo(this.q) >= 0 || !(P.multiply(P).subtract(fourQ).modPow(legendreExponent,
+                                this.q).equals(qMinusOne)));
+  
+                        var result = ec.FieldElementFp.fastLucasSequence(this.q, P, Q, k);
+  
+                        U = result[0];
+                        V = result[1];
+                        if (V.multiply(V).mod(this.q).equals(fourQ)) {
+                            // Integer division by 2, mod q
+                            if (V.testBit(0)) {
+                                V = V.add(this.q);
+                            }
+                            V = V.shiftRight(1);
+                            return new ec.FieldElementFp(this.q, V);
+                        }
+                    }
+                    while (U.equals(BigInteger.ONE) || U.equals(qMinusOne));
+  
+                    return null;
+                };
+  
+                /*
+                 * Copyright (c) 2000 - 2011 The Legion Of The Bouncy Castle (http://www.bouncycastle.org)
+                 * Ported to JavaScript by bitaddress.org
+                 */
+                ec.FieldElementFp.fastLucasSequence = function (p, P, Q, k) {
+                    // TODO Research and apply "common-multiplicand multiplication here"
+  
+                    var n = k.bitLength();
+                    var s = k.getLowestSetBit();
+                    var Uh = BigInteger.ONE;
+                    var Vl = BigInteger.TWO;
+                    var Vh = P;
+                    var Ql = BigInteger.ONE;
+                    var Qh = BigInteger.ONE;
+  
+                    for (var j = n - 1; j >= s + 1; --j) {
+                        Ql = Ql.multiply(Qh).mod(p);
+                        if (k.testBit(j)) {
+                            Qh = Ql.multiply(Q).mod(p);
+                            Uh = Uh.multiply(Vh).mod(p);
+                            Vl = Vh.multiply(Vl).subtract(P.multiply(Ql)).mod(p);
+                            Vh = Vh.multiply(Vh).subtract(Qh.shiftLeft(1)).mod(p);
+                        } else {
+                            Qh = Ql;
+                            Uh = Uh.multiply(Vl).subtract(Ql).mod(p);
+                            Vh = Vh.multiply(Vl).subtract(P.multiply(Ql)).mod(p);
+                            Vl = Vl.multiply(Vl).subtract(Ql.shiftLeft(1)).mod(p);
+                        }
+                    }
+  
+                    Ql = Ql.multiply(Qh).mod(p);
+                    Qh = Ql.multiply(Q).mod(p);
+                    Uh = Uh.multiply(Vl).subtract(Ql).mod(p);
+                    Vl = Vh.multiply(Vl).subtract(P.multiply(Ql)).mod(p);
+                    Ql = Ql.multiply(Qh).mod(p);
+  
+                    for (var j = 1; j <= s; ++j) {
+                        Uh = Uh.multiply(Vl).mod(p);
+                        Vl = Vl.multiply(Vl).subtract(Ql.shiftLeft(1)).mod(p);
+                        Ql = Ql.multiply(Ql).mod(p);
+                    }
+  
+                    return [Uh, Vl];
+                };
+  
+                // ----------------
+                // ECPointFp constructor
+                ec.PointFp = function (curve, x, y, z, compressed) {
+                    this.curve = curve;
+                    this.x = x;
+                    this.y = y;
+                    // Projective coordinates: either zinv == null or z * zinv == 1
+                    // z and zinv are just BigIntegers, not fieldElements
+                    if (z == null) {
+                        this.z = BigInteger.ONE;
+                    } else {
+                        this.z = z;
+                    }
+                    this.zinv = null;
+                    // compression flag
+                    this.compressed = !!compressed;
+                };
+  
+                ec.PointFp.prototype.getX = function () {
+                    if (this.zinv == null) {
+                        this.zinv = this.z.modInverse(this.curve.q);
+                    }
+                    var r = this.x.toBigInteger().multiply(this.zinv);
+                    this.curve.reduce(r);
+                    return this.curve.fromBigInteger(r);
+                };
+  
+                ec.PointFp.prototype.getY = function () {
+                    if (this.zinv == null) {
+                        this.zinv = this.z.modInverse(this.curve.q);
+                    }
+                    var r = this.y.toBigInteger().multiply(this.zinv);
+                    this.curve.reduce(r);
+                    return this.curve.fromBigInteger(r);
+                };
+  
+                ec.PointFp.prototype.equals = function (other) {
+                    if (other == this) return true;
+                    if (this.isInfinity()) return other.isInfinity();
+                    if (other.isInfinity()) return this.isInfinity();
+                    var u, v;
+                    // u = Y2 * Z1 - Y1 * Z2
+                    u = other.y.toBigInteger().multiply(this.z).subtract(this.y.toBigInteger().multiply(other.z)).mod(
+                        this.curve.q);
+                    if (!u.equals(BigInteger.ZERO)) return false;
+                    // v = X2 * Z1 - X1 * Z2
+                    v = other.x.toBigInteger().multiply(this.z).subtract(this.x.toBigInteger().multiply(other.z)).mod(
+                        this.curve.q);
+                    return v.equals(BigInteger.ZERO);
+                };
+  
+                ec.PointFp.prototype.isInfinity = function () {
+                    if ((this.x == null) && (this.y == null)) return true;
+                    return this.z.equals(BigInteger.ZERO) && !this.y.toBigInteger().equals(BigInteger.ZERO);
+                };
+  
+                ec.PointFp.prototype.negate = function () {
+                    return new ec.PointFp(this.curve, this.x, this.y.negate(), this.z);
+                };
+  
+                ec.PointFp.prototype.add = function (b) {
+                    if (this.isInfinity()) return b;
+                    if (b.isInfinity()) return this;
+  
+                    // u = Y2 * Z1 - Y1 * Z2
+                    var u = b.y.toBigInteger().multiply(this.z).subtract(this.y.toBigInteger().multiply(b.z)).mod(
+                        this.curve.q);
+                    // v = X2 * Z1 - X1 * Z2
+                    var v = b.x.toBigInteger().multiply(this.z).subtract(this.x.toBigInteger().multiply(b.z)).mod(
+                        this.curve.q);
+  
+  
+                    if (BigInteger.ZERO.equals(v)) {
+                        if (BigInteger.ZERO.equals(u)) {
+                            return this.twice(); // this == b, so double
+                        }
+                        return this.curve.getInfinity(); // this = -b, so infinity
+                    }
+  
+                    var THREE = new BigInteger("3");
+                    var x1 = this.x.toBigInteger();
+                    var y1 = this.y.toBigInteger();
+                    var x2 = b.x.toBigInteger();
+                    var y2 = b.y.toBigInteger();
+  
+                    var v2 = v.square();
+                    var v3 = v2.multiply(v);
+                    var x1v2 = x1.multiply(v2);
+                    var zu2 = u.square().multiply(this.z);
+  
+                    // x3 = v * (z2 * (z1 * u^2 - 2 * x1 * v^2) - v^3)
+                    var x3 = zu2.subtract(x1v2.shiftLeft(1)).multiply(b.z).subtract(v3).multiply(v).mod(this.curve.q);
+                    // y3 = z2 * (3 * x1 * u * v^2 - y1 * v^3 - z1 * u^3) + u * v^3
+                    var y3 = x1v2.multiply(THREE).multiply(u).subtract(y1.multiply(v3)).subtract(zu2.multiply(u)).multiply(
+                        b.z).add(u.multiply(v3)).mod(this.curve.q);
+                    // z3 = v^3 * z1 * z2
+                    var z3 = v3.multiply(this.z).multiply(b.z).mod(this.curve.q);
+  
+                    return new ec.PointFp(this.curve, this.curve.fromBigInteger(x3), this.curve.fromBigInteger(y3),
+                        z3);
+                };
+  
+                ec.PointFp.prototype.twice = function () {
+                    if (this.isInfinity()) return this;
+                    if (this.y.toBigInteger().signum() == 0) return this.curve.getInfinity();
+  
+                    // TODO: optimized handling of constants
+                    var THREE = new BigInteger("3");
+                    var x1 = this.x.toBigInteger();
+                    var y1 = this.y.toBigInteger();
+  
+                    var y1z1 = y1.multiply(this.z);
+                    var y1sqz1 = y1z1.multiply(y1).mod(this.curve.q);
+                    var a = this.curve.a.toBigInteger();
+  
+                    // w = 3 * x1^2 + a * z1^2
+                    var w = x1.square().multiply(THREE);
+                    if (!BigInteger.ZERO.equals(a)) {
+                        w = w.add(this.z.square().multiply(a));
+                    }
+                    w = w.mod(this.curve.q);
+                    //this.curve.reduce(w);
+                    // x3 = 2 * y1 * z1 * (w^2 - 8 * x1 * y1^2 * z1)
+                    var x3 = w.square().subtract(x1.shiftLeft(3).multiply(y1sqz1)).shiftLeft(1).multiply(y1z1).mod(
+                        this.curve.q);
+                    // y3 = 4 * y1^2 * z1 * (3 * w * x1 - 2 * y1^2 * z1) - w^3
+                    var y3 = w.multiply(THREE).multiply(x1).subtract(y1sqz1.shiftLeft(1)).shiftLeft(2).multiply(
+                        y1sqz1).subtract(w.square().multiply(w)).mod(this.curve.q);
+                    // z3 = 8 * (y1 * z1)^3
+                    var z3 = y1z1.square().multiply(y1z1).shiftLeft(3).mod(this.curve.q);
+  
+                    return new ec.PointFp(this.curve, this.curve.fromBigInteger(x3), this.curve.fromBigInteger(y3),
+                        z3);
+                };
+  
+                // Simple NAF (Non-Adjacent Form) multiplication algorithm
+                // TODO: modularize the multiplication algorithm
+                ec.PointFp.prototype.multiply = function (k) {
+                    if (this.isInfinity()) return this;
+                    if (k.signum() == 0) return this.curve.getInfinity();
+  
+                    var e = k;
+                    var h = e.multiply(new BigInteger("3"));
+  
+                    var neg = this.negate();
+                    var R = this;
+  
+                    var i;
+                    for (i = h.bitLength() - 2; i > 0; --i) {
+                        R = R.twice();
+  
+                        var hBit = h.testBit(i);
+                        var eBit = e.testBit(i);
+  
+                        if (hBit != eBit) {
+                            R = R.add(hBit ? this : neg);
+                        }
+                    }
+  
+                    return R;
+                };
+  
+                // Compute this*j + x*k (simultaneous multiplication)
+                ec.PointFp.prototype.multiplyTwo = function (j, x, k) {
+                    var i;
+                    if (j.bitLength() > k.bitLength())
+                        i = j.bitLength() - 1;
+                    else
+                        i = k.bitLength() - 1;
+  
+                    var R = this.curve.getInfinity();
+                    var both = this.add(x);
+                    while (i >= 0) {
+                        R = R.twice();
+                        if (j.testBit(i)) {
+                            if (k.testBit(i)) {
+                                R = R.add(both);
+                            } else {
+                                R = R.add(this);
+                            }
+                        } else {
+                            if (k.testBit(i)) {
+                                R = R.add(x);
+                            }
+                        }
+                        --i;
+                    }
+  
+                    return R;
+                };
+  
+                // patched by bitaddress.org and Casascius for use with Bitcoin.ECKey
+                // patched by coretechs to support compressed public keys
+                ec.PointFp.prototype.getEncoded = function (compressed) {
+                    var x = this.getX().toBigInteger();
+                    var y = this.getY().toBigInteger();
+                    var len = 32; // integerToBytes will zero pad if integer is less than 32 bytes. 32 bytes length is required by the Bitcoin protocol.
+                    var enc = ec.integerToBytes(x, len);
+  
+                    // when compressed prepend byte depending if y point is even or odd
+                    if (compressed) {
+                        if (y.isEven()) {
+                            enc.unshift(0x02);
+                        } else {
+                            enc.unshift(0x03);
+                        }
+                    } else {
+                        enc.unshift(0x04);
+                        enc = enc.concat(ec.integerToBytes(y, len)); // uncompressed public key appends the bytes of the y point
+                    }
+                    return enc;
+                };
+  
+                ec.PointFp.decodeFrom = function (curve, enc) {
+                    var type = enc[0];
+                    var dataLen = enc.length - 1;
+  
+                    // Extract x and y as byte arrays
+                    var xBa = enc.slice(1, 1 + dataLen / 2);
+                    var yBa = enc.slice(1 + dataLen / 2, 1 + dataLen);
+  
+                    // Prepend zero byte to prevent interpretation as negative integer
+                    xBa.unshift(0);
+                    yBa.unshift(0);
+  
+                    // Convert to BigIntegers
+                    var x = new BigInteger(xBa);
+                    var y = new BigInteger(yBa);
+  
+                    // Return point
+                    return new ec.PointFp(curve, curve.fromBigInteger(x), curve.fromBigInteger(y));
+                };
+  
+                ec.PointFp.prototype.add2D = function (b) {
+                    if (this.isInfinity()) return b;
+                    if (b.isInfinity()) return this;
+  
+                    if (this.x.equals(b.x)) {
+                        if (this.y.equals(b.y)) {
+                            // this = b, i.e. this must be doubled
+                            return this.twice();
+                        }
+                        // this = -b, i.e. the result is the point at infinity
+                        return this.curve.getInfinity();
+                    }
+  
+                    var x_x = b.x.subtract(this.x);
+                    var y_y = b.y.subtract(this.y);
+                    var gamma = y_y.divide(x_x);
+  
+                    var x3 = gamma.square().subtract(this.x).subtract(b.x);
+                    var y3 = gamma.multiply(this.x.subtract(x3)).subtract(this.y);
+  
+                    return new ec.PointFp(this.curve, x3, y3);
+                };
+  
+                ec.PointFp.prototype.twice2D = function () {
+                    if (this.isInfinity()) return this;
+                    if (this.y.toBigInteger().signum() == 0) {
+                        // if y1 == 0, then (x1, y1) == (x1, -y1)
+                        // and hence this = -this and thus 2(x1, y1) == infinity
+                        return this.curve.getInfinity();
+                    }
+  
+                    var TWO = this.curve.fromBigInteger(BigInteger.valueOf(2));
+                    var THREE = this.curve.fromBigInteger(BigInteger.valueOf(3));
+                    var gamma = this.x.square().multiply(THREE).add(this.curve.a).divide(this.y.multiply(TWO));
+  
+                    var x3 = gamma.square().subtract(this.x.multiply(TWO));
+                    var y3 = gamma.multiply(this.x.subtract(x3)).subtract(this.y);
+  
+                    return new ec.PointFp(this.curve, x3, y3);
+                };
+  
+                ec.PointFp.prototype.multiply2D = function (k) {
+                    if (this.isInfinity()) return this;
+                    if (k.signum() == 0) return this.curve.getInfinity();
+  
+                    var e = k;
+                    var h = e.multiply(new BigInteger("3"));
+  
+                    var neg = this.negate();
+                    var R = this;
+  
+                    var i;
+                    for (i = h.bitLength() - 2; i > 0; --i) {
+                        R = R.twice();
+  
+                        var hBit = h.testBit(i);
+                        var eBit = e.testBit(i);
+  
+                        if (hBit != eBit) {
+                            R = R.add2D(hBit ? this : neg);
+                        }
+                    }
+  
+                    return R;
+                };
+  
+                ec.PointFp.prototype.isOnCurve = function () {
+                    var x = this.getX().toBigInteger();
+                    var y = this.getY().toBigInteger();
+                    var a = this.curve.getA().toBigInteger();
+                    var b = this.curve.getB().toBigInteger();
+                    var n = this.curve.getQ();
+                    var lhs = y.multiply(y).mod(n);
+                    var rhs = x.multiply(x).multiply(x).add(a.multiply(x)).add(b).mod(n);
+                    return lhs.equals(rhs);
+                };
+  
+                ec.PointFp.prototype.toString = function () {
+                    return '(' + this.getX().toBigInteger().toString() + ',' + this.getY().toBigInteger().toString() +
+                        ')';
+                };
+  
+                /**
+                 * Validate an elliptic curve point.
+                 *
+                 * See SEC 1, section 3.2.2.1: Elliptic Curve Public Key Validation Primitive
+                 */
+                ec.PointFp.prototype.validate = function () {
+                    var n = this.curve.getQ();
+  
+                    // Check Q != O
+                    if (this.isInfinity()) {
+                        throw new Error("Point is at infinity.");
+                    }
+  
+                    // Check coordinate bounds
+                    var x = this.getX().toBigInteger();
+                    var y = this.getY().toBigInteger();
+                    if (x.compareTo(BigInteger.ONE) < 0 || x.compareTo(n.subtract(BigInteger.ONE)) > 0) {
+                        throw new Error('x coordinate out of bounds');
+                    }
+                    if (y.compareTo(BigInteger.ONE) < 0 || y.compareTo(n.subtract(BigInteger.ONE)) > 0) {
+                        throw new Error('y coordinate out of bounds');
+                    }
+  
+                    // Check y^2 = x^3 + ax + b (mod n)
+                    if (!this.isOnCurve()) {
+                        throw new Error("Point is not on the curve.");
+                    }
+  
+                    // Check nQ = 0 (Q is a scalar multiple of G)
+                    if (this.multiply(n).isInfinity()) {
+                        // TODO: This check doesn't work - fix.
+                        throw new Error("Point is not a scalar multiple of G.");
+                    }
+  
+                    return true;
+                };
+  
+  
+  
+  
+                // ----------------
+                // ECCurveFp constructor
+                ec.CurveFp = function (q, a, b) {
+                    this.q = q;
+                    this.a = this.fromBigInteger(a);
+                    this.b = this.fromBigInteger(b);
+                    this.infinity = new ec.PointFp(this, null, null);
+                    this.reducer = new Barrett(this.q);
+                }
+  
+                ec.CurveFp.prototype.getQ = function () {
+                    return this.q;
+                };
+  
+                ec.CurveFp.prototype.getA = function () {
+                    return this.a;
+                };
+  
+                ec.CurveFp.prototype.getB = function () {
+                    return this.b;
+                };
+  
+                ec.CurveFp.prototype.equals = function (other) {
+                    if (other == this) return true;
+                    return (this.q.equals(other.q) && this.a.equals(other.a) && this.b.equals(other.b));
+                };
+  
+                ec.CurveFp.prototype.getInfinity = function () {
+                    return this.infinity;
+                };
+  
+                ec.CurveFp.prototype.fromBigInteger = function (x) {
+                    return new ec.FieldElementFp(this.q, x);
+                };
+  
+                ec.CurveFp.prototype.reduce = function (x) {
+                    this.reducer.reduce(x);
+                };
+  
+                // for now, work with hex strings because they're easier in JS
+                // compressed support added by bitaddress.org
+                ec.CurveFp.prototype.decodePointHex = function (s) {
+                    var firstByte = parseInt(s.substr(0, 2), 16);
+                    switch (firstByte) { // first byte
+                        case 0:
+                            return this.infinity;
+                        case 2: // compressed
+                        case 3: // compressed
+                            var yTilde = firstByte & 1;
+                            var xHex = s.substr(2, s.length - 2);
+                            var X1 = new BigInteger(xHex, 16);
+                            return this.decompressPoint(yTilde, X1);
+                        case 4: // uncompressed
+                        case 6: // hybrid
+                        case 7: // hybrid
+                            var len = (s.length - 2) / 2;
+                            var xHex = s.substr(2, len);
+                            var yHex = s.substr(len + 2, len);
+  
+                            return new ec.PointFp(this,
+                                this.fromBigInteger(new BigInteger(xHex, 16)),
+                                this.fromBigInteger(new BigInteger(yHex, 16)));
+  
+                        default: // unsupported
+                            return null;
+                    }
+                };
+  
+                ec.CurveFp.prototype.encodePointHex = function (p) {
+                    if (p.isInfinity()) return "00";
+                    var xHex = p.getX().toBigInteger().toString(16);
+                    var yHex = p.getY().toBigInteger().toString(16);
+                    var oLen = this.getQ().toString(16).length;
+                    if ((oLen % 2) != 0) oLen++;
+                    while (xHex.length < oLen) {
+                        xHex = "0" + xHex;
+                    }
+                    while (yHex.length < oLen) {
+                        yHex = "0" + yHex;
+                    }
+                    return "04" + xHex + yHex;
+                };
+  
+                /*
+                 * Copyright (c) 2000 - 2011 The Legion Of The Bouncy Castle (http://www.bouncycastle.org)
+                 * Ported to JavaScript by bitaddress.org
+                 *
+                 * Number yTilde
+                 * BigInteger X1
+                 */
+                ec.CurveFp.prototype.decompressPoint = function (yTilde, X1) {
+                    var x = this.fromBigInteger(X1);
+                    var alpha = x.multiply(x.square().add(this.getA())).add(this.getB());
+                    var beta = alpha.sqrt();
+                    // if we can't find a sqrt we haven't got a point on the curve - run!
+                    if (beta == null) throw new Error("Invalid point compression");
+                    var betaValue = beta.toBigInteger();
+                    var bit0 = betaValue.testBit(0) ? 1 : 0;
+                    if (bit0 != yTilde) {
+                        // Use the other root
+                        beta = this.fromBigInteger(this.getQ().subtract(betaValue));
+                    }
+                    return new ec.PointFp(this, x, beta, null, true);
+                };
+  
+  
+                ec.fromHex = function (s) {
+                    return new BigInteger(s, 16);
+                };
+  
+                ec.integerToBytes = function (i, len) {
+                    var bytes = i.toByteArrayUnsigned();
+                    if (len < bytes.length) {
+                        bytes = bytes.slice(bytes.length - len);
+                    } else
+                        while (len > bytes.length) {
+                            bytes.unshift(0);
+                        }
+                    return bytes;
+                };
+  
+  
+                // Named EC curves
+                // ----------------
+                // X9ECParameters constructor
+                ec.X9Parameters = function (curve, g, n, h) {
+                    this.curve = curve;
+                    this.g = g;
+                    this.n = n;
+                    this.h = h;
+                }
+                ec.X9Parameters.prototype.getCurve = function () {
+                    return this.curve;
+                };
+                ec.X9Parameters.prototype.getG = function () {
+                    return this.g;
+                };
+                ec.X9Parameters.prototype.getN = function () {
+                    return this.n;
+                };
+                ec.X9Parameters.prototype.getH = function () {
+                    return this.h;
+                };
+  
+                // secp256k1 is the Curve used by Bitcoin
+                ec.secNamedCurves = {
+                    // used by Bitcoin
+                    "secp256k1": function () {
+                        // p = 2^256 - 2^32 - 2^9 - 2^8 - 2^7 - 2^6 - 2^4 - 1
+                        var p = ec.fromHex("FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEFFFFFC2F");
+                        var a = BigInteger.ZERO;
+                        var b = ec.fromHex("7");
+                        var n = ec.fromHex("FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEBAAEDCE6AF48A03BBFD25E8CD0364141");
+                        var h = BigInteger.ONE;
+                        var curve = new ec.CurveFp(p, a, b);
+                        var G = curve.decodePointHex("04" +
+                            "79BE667EF9DCBBAC55A06295CE870B07029BFCDB2DCE28D959F2815B16F81798" +
+                            "483ADA7726A3C4655DA4FBFC0E1108A8FD17B448A68554199C47D08FFB10D4B8");
+                        return new ec.X9Parameters(curve, G, n, h);
+                    }
+                };
+  
+                // secp256k1 called by Bitcoin's ECKEY
+                ec.getSECCurveByName = function (name) {
+                    if (ec.secNamedCurves[name] == undefined) return null;
+                    return ec.secNamedCurves[name]();
+                }
+            })();
+  
+  
+            //bitTrx.js
+            (function () {
+  
+                var bitjs = window.bitjs = function () {};
+  
+                /* public vars */
+                bitjs.pub = 0x23; // flochange - changed the prefix to FLO Mainnet PublicKey Prefix 0x23
+                bitjs.priv = 0xa3; //flochange - changed the prefix to FLO Mainnet Private key prefix 0xa3
+                bitjs.compressed = false;
+  
+                /* provide a privkey and return an WIF  */
+                bitjs.privkey2wif = function (h) {
+                    var r = Crypto.util.hexToBytes(h);
+  
+                    if (bitjs.compressed == true) {
+                        r.push(0x01);
+                    }
+  
+                    r.unshift(bitjs.priv);
+                    var hash = Crypto.SHA256(Crypto.SHA256(r, {
+                        asBytes: true
+                    }), {
+                        asBytes: true
+                    });
+                    var checksum = hash.slice(0, 4);
+  
+                    return B58.encode(r.concat(checksum));
+                }
+  
+                /* convert a wif key back to a private key */
+                bitjs.wif2privkey = function (wif) {
+                    var compressed = false;
+                    var decode = B58.decode(wif);
+                    var key = decode.slice(0, decode.length - 4);
+                    key = key.slice(1, key.length);
+                    if (key.length >= 33 && key[key.length - 1] == 0x01) {
+                        key = key.slice(0, key.length - 1);
+                        compressed = true;
+                    }
+                    return {
+                        'privkey': Crypto.util.bytesToHex(key),
+                        'compressed': compressed
+                    };
+                }
+  
+                /* convert a wif to a pubkey */
+                bitjs.wif2pubkey = function (wif) {
+                    var compressed = bitjs.compressed;
+                    var r = bitjs.wif2privkey(wif);
+                    bitjs.compressed = r['compressed'];
+                    var pubkey = bitjs.newPubkey(r['privkey']);
+                    bitjs.compressed = compressed;
+                    return {
+                        'pubkey': pubkey,
+                        'compressed': r['compressed']
+                    };
+                }
+  
+                /* convert a wif to a address */
+                bitjs.wif2address = function (wif) {
+                    var r = bitjs.wif2pubkey(wif);
+                    return {
+                        'address': bitjs.pubkey2address(r['pubkey']),
+                        'compressed': r['compressed']
+                    };
+                }
+  
+                /* generate a public key from a private key */
+                bitjs.newPubkey = function (hash) {
+                    var privateKeyBigInt = BigInteger.fromByteArrayUnsigned(Crypto.util.hexToBytes(hash));
+                    var curve = EllipticCurve.getSECCurveByName("secp256k1");
+  
+                    var curvePt = curve.getG().multiply(privateKeyBigInt);
+                    var x = curvePt.getX().toBigInteger();
+                    var y = curvePt.getY().toBigInteger();
+  
+                    var publicKeyBytes = EllipticCurve.integerToBytes(x, 32);
+                    publicKeyBytes = publicKeyBytes.concat(EllipticCurve.integerToBytes(y, 32));
+                    publicKeyBytes.unshift(0x04);
+  
+                    if (bitjs.compressed == true) {
+                        var publicKeyBytesCompressed = EllipticCurve.integerToBytes(x, 32)
+                        if (y.isEven()) {
+                            publicKeyBytesCompressed.unshift(0x02)
+                        } else {
+                            publicKeyBytesCompressed.unshift(0x03)
+                        }
+                        return Crypto.util.bytesToHex(publicKeyBytesCompressed);
+                    } else {
+                        return Crypto.util.bytesToHex(publicKeyBytes);
+                    }
+                }
+  
+                /* provide a public key and return address */
+                bitjs.pubkey2address = function (h, byte) {
+                    var r = ripemd160(Crypto.SHA256(Crypto.util.hexToBytes(h), {
+                        asBytes: true
+                    }));
+                    r.unshift(byte || bitjs.pub);
+                    var hash = Crypto.SHA256(Crypto.SHA256(r, {
+                        asBytes: true
+                    }), {
+                        asBytes: true
+                    });
+                    var checksum = hash.slice(0, 4);
+                    return B58.encode(r.concat(checksum));
+                }
+  
+                bitjs.transaction = function () {
+                    var btrx = {};
+                    btrx.version = 2; //flochange look at this version
+                    btrx.inputs = [];
+                    btrx.outputs = [];
+                    btrx.locktime = 0;
+                    btrx.floData = ""; //flochange .. look at this
+  
+  
+                    btrx.addinput = function (txid, index, scriptPubKey, sequence) {
+                        var o = {};
+                        o.outpoint = {
+                            'hash': txid,
+                            'index': index
+                        };
+                        //o.script = []; Signature and Public Key should be added after singning
+                        o.script = Crypto.util.hexToBytes(scriptPubKey); //push previous output pubkey script
+                        o.sequence = sequence || ((btrx.locktime == 0) ? 4294967295 : 0);
+                        return this.inputs.push(o);
+                    }
+  
+                    btrx.addoutput = function (address, value) {
+                        var o = {};
+                        var buf = [];
+                        var addrDecoded = btrx.addressDecode(address);
+                        o.value = new BigInteger('' + Math.round((value * 1) * 1e8), 10);
+                        buf.push(118); //OP_DUP
+                        buf.push(169); //OP_HASH160
+                        buf.push(addrDecoded.length);
+                        buf = buf.concat(addrDecoded); // address in bytes
+                        buf.push(136); //OP_EQUALVERIFY
+                        buf.push(172); //  OP_CHECKSIG
+                        o.script = buf;
+                        return this.outputs.push(o);
+                    }
+  
+  
+                    btrx.addflodata = function (txcomments) { // flochange - this whole function needs to be done
+                        this.floData = txcomments;
+                        return this.floData; //flochange .. returning the txcomments -- check if the function return will assign
+                    }
+  
+  
+                    // Only standard addresses
+                    btrx.addressDecode = function (address) {
+                        var bytes = B58.decode(address);
+                        var front = bytes.slice(0, bytes.length - 4);
+                        var back = bytes.slice(bytes.length - 4);
+                        var checksum = Crypto.SHA256(Crypto.SHA256(front, {
+                            asBytes: true
+                        }), {
+                            asBytes: true
+                        }).slice(0, 4);
+                        if (checksum + "" == back + "") {
+                            return front.slice(1);
+                        }
+                    }
+  
+                    /* generate the transaction hash to sign from a transaction input */
+                    btrx.transactionHash = function (index, sigHashType) {
+  
+                        var clone = bitjs.clone(this);
+                        var shType = sigHashType || 1;
+  
+                        /* black out all other ins, except this one */
+                        for (var i = 0; i < clone.inputs.length; i++) {
+                            if (index != i) {
+                                clone.inputs[i].script = [];
+                            }
+                        }
+  
+  
+                        if ((clone.inputs) && clone.inputs[index]) {
+  
+                            /* SIGHASH : For more info on sig hashs see https://en.bitcoin.it/wiki/OP_CHECKSIG
+                                and https://bitcoin.org/en/developer-guide#signature-hash-type */
+  
+                            if (shType == 1) {
+                                //SIGHASH_ALL 0x01
+  
+                            } else if (shType == 2) {
+                                //SIGHASH_NONE 0x02
+                                clone.outputs = [];
+                                for (var i = 0; i < clone.inputs.length; i++) {
+                                    if (index != i) {
+                                        clone.inputs[i].sequence = 0;
+                                    }
+                                }
+  
+                            } else if (shType == 3) {
+  
+                                //SIGHASH_SINGLE 0x03
+                                clone.outputs.length = index + 1;
+  
+                                for (var i = 0; i < index; i++) {
+                                    clone.outputs[i].value = -1;
+                                    clone.outputs[i].script = [];
+                                }
+  
+                                for (var i = 0; i < clone.inputs.length; i++) {
+                                    if (index != i) {
+                                        clone.inputs[i].sequence = 0;
+                                    }
+                                }
+  
+                            } else if (shType >= 128) {
+                                //SIGHASH_ANYONECANPAY 0x80
+                                clone.inputs = [clone.inputs[index]];
+  
+                                if (shType == 129) {
+                                    // SIGHASH_ALL + SIGHASH_ANYONECANPAY
+  
+                                } else if (shType == 130) {
+                                    // SIGHASH_NONE + SIGHASH_ANYONECANPAY
+                                    clone.outputs = [];
+  
+                                } else if (shType == 131) {
+                                    // SIGHASH_SINGLE + SIGHASH_ANYONECANPAY
+                                    clone.outputs.length = index + 1;
+                                    for (var i = 0; i < index; i++) {
+                                        clone.outputs[i].value = -1;
+                                        clone.outputs[i].script = [];
+                                    }
+                                }
+                            }
+  
+                            var buffer = Crypto.util.hexToBytes(clone.serialize());
+                            buffer = buffer.concat(bitjs.numToBytes(parseInt(shType), 4));
+                            var hash = Crypto.SHA256(buffer, {
+                                asBytes: true
+                            });
+                            var r = Crypto.util.bytesToHex(Crypto.SHA256(hash, {
+                                asBytes: true
+                            }));
+                            return r;
+                        } else {
+                            return false;
+                        }
+                    }
+  
+                    /* generate a signature from a transaction hash */
+                    btrx.transactionSig = function (index, wif, sigHashType, txhash) {
+  
+                        function serializeSig(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;
+                        }
+  
+                        var shType = sigHashType || 1;
+                        var hash = txhash || Crypto.util.hexToBytes(this.transactionHash(index, shType));
+  
+                        if (hash) {
+                            var curve = EllipticCurve.getSECCurveByName("secp256k1");
+                            var key = bitjs.wif2privkey(wif);
+                            var priv = BigInteger.fromByteArrayUnsigned(Crypto.util.hexToBytes(key['privkey']));
+                            var n = curve.getN();
+                            var e = BigInteger.fromByteArrayUnsigned(hash);
+                            var badrs = 0
+                            do {
+                                var k = this.deterministicK(wif, hash, badrs);
+                                var G = curve.getG();
+                                var Q = G.multiply(k);
+                                var r = Q.getX().toBigInteger().mod(n);
+                                var s = k.modInverse(n).multiply(e.add(priv.multiply(r))).mod(n);
+                                badrs++
+                            } while (r.compareTo(BigInteger.ZERO) <= 0 || s.compareTo(BigInteger.ZERO) <= 0);
+  
+                            // Force lower s values per BIP62
+                            var halfn = n.shiftRight(1);
+                            if (s.compareTo(halfn) > 0) {
+                                s = n.subtract(s);
+                            };
+  
+                            var sig = serializeSig(r, s);
+                            sig.push(parseInt(shType, 10));
+  
+                            return Crypto.util.bytesToHex(sig);
+                        } else {
+                            return false;
+                        }
+                    }
+  
+                    // https://tools.ietf.org/html/rfc6979#section-3.2
+                    btrx.deterministicK = function (wif, hash, badrs) {
+                        // if r or s were invalid when this function was used in signing,
+                        // we do not want to actually compute r, s here for efficiency, so,
+                        // we can increment badrs. explained at end of RFC 6979 section 3.2
+  
+                        // wif is b58check encoded wif privkey.
+                        // hash is byte array of transaction digest.
+                        // badrs is used only if the k resulted in bad r or s.
+  
+                        // some necessary things out of the way for clarity.
+                        badrs = badrs || 0;
+                        var key = bitjs.wif2privkey(wif);
+                        var x = Crypto.util.hexToBytes(key['privkey'])
+                        var curve = EllipticCurve.getSECCurveByName("secp256k1");
+                        var N = curve.getN();
+  
+                        // Step: a
+                        // hash is a byteArray of the message digest. so h1 == hash in our case
+  
+                        // Step: b
+                        var v = [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
+                            1, 1, 1, 1, 1, 1
+                        ];
+  
+                        // Step: c
+                        var k = [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+                            0, 0, 0, 0, 0, 0
+                        ];
+  
+                        // Step: d
+                        k = Crypto.HMAC(Crypto.SHA256, v.concat([0]).concat(x).concat(hash), k, {
+                            asBytes: true
+                        });
+  
+                        // Step: e
+                        v = Crypto.HMAC(Crypto.SHA256, v, k, {
+                            asBytes: true
+                        });
+  
+                        // Step: f
+                        k = Crypto.HMAC(Crypto.SHA256, v.concat([1]).concat(x).concat(hash), k, {
+                            asBytes: true
+                        });
+  
+                        // Step: g
+                        v = Crypto.HMAC(Crypto.SHA256, v, k, {
+                            asBytes: true
+                        });
+  
+                        // Step: h1
+                        var T = [];
+  
+                        // Step: h2 (since we know tlen = qlen, just copy v to T.)
+                        v = Crypto.HMAC(Crypto.SHA256, v, k, {
+                            asBytes: true
+                        });
+                        T = v;
+  
+                        // Step: h3
+                        var KBigInt = BigInteger.fromByteArrayUnsigned(T);
+  
+                        // loop if KBigInt is not in the range of [1, N-1] or if badrs needs incrementing.
+                        var i = 0
+                        while (KBigInt.compareTo(N) >= 0 || KBigInt.compareTo(BigInteger.ZERO) <= 0 || i <
+                            badrs) {
+                            k = Crypto.HMAC(Crypto.SHA256, v.concat([0]), k, {
+                                asBytes: true
+                            });
+                            v = Crypto.HMAC(Crypto.SHA256, v, k, {
+                                asBytes: true
+                            });
+                            v = Crypto.HMAC(Crypto.SHA256, v, k, {
+                                asBytes: true
+                            });
+                            T = v;
+                            KBigInt = BigInteger.fromByteArrayUnsigned(T);
+                            i++
+                        };
+  
+                        return KBigInt;
+                    };
+  
+                    /* sign a "standard" input */
+                    btrx.signinput = function (index, wif, sigHashType) {
+                        var key = bitjs.wif2pubkey(wif);
+                        var shType = sigHashType || 1;
+                        var signature = this.transactionSig(index, wif, shType);
+                        var buf = [];
+                        var sigBytes = Crypto.util.hexToBytes(signature);
+                        buf.push(sigBytes.length);
+                        buf = buf.concat(sigBytes);
+                        var pubKeyBytes = Crypto.util.hexToBytes(key['pubkey']);
+                        buf.push(pubKeyBytes.length);
+                        buf = buf.concat(pubKeyBytes);
+                        this.inputs[index].script = buf;
+                        return true;
+                    }
+  
+                    /* sign inputs */
+                    btrx.sign = function (wif, sigHashType) {
+                        var shType = sigHashType || 1;
+                        for (var i = 0; i < this.inputs.length; i++) {
+                            this.signinput(i, wif, shType);
+                        }
+                        return this.serialize();
+                    }
+  
+  
+                    /* serialize a transaction */
+                    btrx.serialize = function () {
+                        var buffer = [];
+                        buffer = buffer.concat(bitjs.numToBytes(parseInt(this.version), 4));
+  
+                        buffer = buffer.concat(bitjs.numToVarInt(this.inputs.length));
+                        for (var i = 0; i < this.inputs.length; i++) {
+                            var txin = this.inputs[i];
+                            buffer = buffer.concat(Crypto.util.hexToBytes(txin.outpoint.hash).reverse());
+                            buffer = buffer.concat(bitjs.numToBytes(parseInt(txin.outpoint.index), 4));
+                            var scriptBytes = txin.script;
+                            buffer = buffer.concat(bitjs.numToVarInt(scriptBytes.length));
+                            buffer = buffer.concat(scriptBytes);
+                            buffer = buffer.concat(bitjs.numToBytes(parseInt(txin.sequence), 4));
+  
+                        }
+                        buffer = buffer.concat(bitjs.numToVarInt(this.outputs.length));
+  
+                        for (var i = 0; i < this.outputs.length; i++) {
+                            var txout = this.outputs[i];
+                            buffer = buffer.concat(bitjs.numToBytes(txout.value, 8));
+                            var scriptBytes = txout.script;
+                            buffer = buffer.concat(bitjs.numToVarInt(scriptBytes.length));
+                            buffer = buffer.concat(scriptBytes);
+                        }
+  
+                        buffer = buffer.concat(bitjs.numToBytes(parseInt(this.locktime),4));
+                        flohex = ascii_to_hexa(this.floData);
+                        floDataCount = this.floData.length;
+  
+                        //flochange -- creating unique data character count logic for floData. This string is prefixed before actual floData string in Raw Transaction
+                        if (floDataCount <= 16) {
+                                      floDataCountString = floDataCount.toString(16);
+                                      floDataCountString = "0"+ floDataCountString;
+                        } else if (floDataCount < 253) {
+                                      floDataCountString = floDataCount.toString(16);
+                        } else if (floDataCount <= 1023) {
+                                      floDataCountAdjusted = (floDataCount - 253) +  parseInt("0xfd00fd");
+                                      floDataCountStringAdjusted = floDataCountAdjusted.toString(16);
+                                      floDataCountString = floDataCountStringAdjusted.substr(0,2)+ floDataCountStringAdjusted.substr(4,2)+ floDataCountStringAdjusted.substr(2,2);
+                        } else {
+                                      floDataCountString = "Character Limit Exceeded";
+                                  }
+  
+  
+                        return Crypto.util.bytesToHex(buffer)+floDataCountString+flohex;    // flochange -- Addition of floDataCountString and floData in serialization
+                    }
+  
+  
+  
+                    return btrx;
+  
+                }
+  
+                bitjs.numToBytes = function (num, bytes) {
+                    if (typeof bytes === "undefined") bytes = 8;
+                    if (bytes == 0) {
+                        return [];
+                    } else if (num == -1) {
+                        return Crypto.util.hexToBytes("ffffffffffffffff");
+                    } else {
+                        return [num % 256].concat(bitjs.numToBytes(Math.floor(num / 256), bytes - 1));
+                    }
+                }
+  
+                bitjs.numToByteArray = function (num) {
+                    if (num <= 256) {
+                        return [num];
+                    } else {
+                        return [num % 256].concat(bitjs.numToByteArray(Math.floor(num / 256)));
+                    }
+                }
+  
+                bitjs.numToVarInt = function (num) {
+                    if (num < 253) {
+                        return [num];
+                    } else if (num < 65536) {
+                        return [253].concat(bitjs.numToBytes(num, 2));
+                    } else if (num < 4294967296) {
+                        return [254].concat(bitjs.numToBytes(num, 4));
+                    } else {
+                        return [255].concat(bitjs.numToBytes(num, 8));
+                    }
+                }
+  
+                bitjs.bytesToNum = function (bytes) {
+                    if (bytes.length == 0) return 0;
+                    else return bytes[0] + 256 * bitjs.bytesToNum(bytes.slice(1));
+                }
+  
+                /* clone an object */
+                bitjs.clone = function (obj) {
+                    if (obj == null || typeof (obj) != 'object') return obj;
+                    var temp = new obj.constructor();
+  
+                    for (var key in obj) {
+                        if (obj.hasOwnProperty(key)) {
+                            temp[key] = bitjs.clone(obj[key]);
+                        }
+                    }
+                    return temp;
+                }
+  
+                var B58 = bitjs.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;
+                    }
+                }
+                return bitjs;
+  
+            })();
+  
+  
+  
+    /*
+    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(floGlobals.blockchain == "FLO")
+            this.version = 0x23; // FLO mainnet public address
+        else if(floGlobals.blockchain == "FLO_TEST")
+            this.version = 0x73; // FLO testnet public address
+        if ("string" == typeof bytes) {
+            bytes = Bitcoin.Address.decodeString(bytes,this.version);
+        }
+        this.hash = bytes;
+    };
+  
+    Bitcoin.Address.networkVersion = 0x23; // (FLO mainnet 0x23, 35D), (Bitcoin Mainnet, 0x00, 0D) // *this has no effect *
+  
+    /**
+    * 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,version) {
+        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!";
+        }
+  
+        if (version != hash.shift()) {
+            throw "Version " + hash.shift() + " 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{
+  
+                // This part is edited for FLO. FLO WIF are always compressed WIF. FLO WIF (private key) starts with R for mainnet and c for testnet.
+                    if(((floGlobals.blockchain == "FLO") && /^R[123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz]{51}$/.test(input)) ||
+                        ((floGlobals.blockchain == "FLO_TEST") && /^c[123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz]{51}$/.test(input))) {
+                        bytes = ECKey.decodeCompressedWalletImportFormat(input);
+                        this.compressed = true;
+                    }else if (ECKey.isHexFormat(input)) {
+                        bytes = Crypto.util.hexToBytes(input);
+                    }
+  
+  
+                /*
+                    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);
+            }
+        };
+  
+        if(floGlobals.blockchain == "FLO")
+            ECKey.privateKeyPrefix = 0xA3; //(Bitcoin mainnet 0x80    testnet 0xEF) (FLO mainnet 0xA3 163 D)
+        else if(floGlobals.blockchain == "FLO_TEST")
+            ECKey.privateKeyPrefix = 0xEF; //FLO testnet
+  
+        /**
+        * 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 == 0x80) ?
+                                (/^5[123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz]{50}$/.test(key)) :
+                                (/^R[123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz]{50}$/.test(key));
+        };
+  
+        // 52 characters base58
+        ECKey.isCompressedWalletImportFormat = function (key) {
+            key = key.toString();
+            return (ECKey.privateKeyPrefix == 0x80) ?
+                                (/^[LK][123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz]{51}$/.test(key)) :
+                                (/^R[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 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;
+        }
+    };
+
+    // secrets.js - by Alexander Stetsyuk - released under MIT License
+    (function (exports, global) {
+            var defaults = {
+                bits: 8, // default number of bits
+                radix: 16, // work with HEX by default
+                minBits: 3,
+                maxBits: 20, // this permits 1,048,575 shares, though going this high is NOT recommended in JS!
+
+                bytesPerChar: 2,
+                maxBytesPerChar: 6, // Math.pow(256,7) > Math.pow(2,53)
+
+                // Primitive polynomials (in decimal form) for Galois Fields GF(2^n), for 2 <= n <= 30
+                // The index of each term in the array corresponds to the n for that polynomial
+                // i.e. to get the polynomial for n=16, use primitivePolynomials[16]
+                primitivePolynomials: [null, null, 1, 3, 3, 5, 3, 3, 29, 17, 9, 5, 83, 27, 43, 3, 45, 9, 39, 39,
+                    9, 5, 3, 33, 27, 9, 71, 39, 9, 5, 83
+                ],
+
+                // warning for insecure PRNG
+                warning: 'WARNING:\nA secure random number generator was not found.\nUsing Math.random(), which is NOT cryptographically strong!'
+            };
+
+            // Protected settings object
+            var config = {};
+
+            /** @expose **/
+            exports.getConfig = function () {
+                return {
+                    'bits': config.bits,
+                    'unsafePRNG': config.unsafePRNG
+                };
+            };
+
+            function init(bits) {
+                if (bits && (typeof bits !== 'number' || bits % 1 !== 0 || bits < defaults.minBits || bits >
+                        defaults.maxBits)) {
+                    throw new Error('Number of bits must be an integer between ' + defaults.minBits + ' and ' +
+                        defaults.maxBits + ', inclusive.')
+                }
+
+                config.radix = defaults.radix;
+                config.bits = bits || defaults.bits;
+                config.size = Math.pow(2, config.bits);
+                config.max = config.size - 1;
+
+                // Construct the exp and log tables for multiplication.
+                var logs = [],
+                    exps = [],
+                    x = 1,
+                    primitive = defaults.primitivePolynomials[config.bits];
+                for (var i = 0; i < config.size; i++) {
+                    exps[i] = x;
+                    logs[x] = i;
+                    x <<= 1;
+                    if (x >= config.size) {
+                        x ^= primitive;
+                        x &= config.max;
+                    }
+                }
+
+                config.logs = logs;
+                config.exps = exps;
+            };
+
+            /** @expose **/
+            exports.init = init;
+
+            function isInited() {
+                if (!config.bits || !config.size || !config.max || !config.logs || !config.exps || config.logs.length !==
+                    config.size || config.exps.length !== config.size) {
+                    return false;
+                }
+                return true;
+            };
+
+            // Returns a pseudo-random number generator of the form function(bits){}
+            // which should output a random string of 1's and 0's of length `bits`
+            function getRNG() {
+                var randomBits, crypto;
+
+                function construct(bits, arr, radix, size) {
+                    var str = '',
+                        i = 0,
+                        len = arr.length - 1;
+                    while (i < len || (str.length < bits)) {
+                        str += padLeft(parseInt(arr[i], radix).toString(2), size);
+                        i++;
+                    }
+                    str = str.substr(-bits);
+                    if ((str.match(/0/g) || []).length === str.length) { // all zeros?
+                        return null;
+                    } else {
+                        return str;
+                    }
+                }
+
+                // node.js crypto.randomBytes()
+                if (typeof require === 'function' && (crypto = require('crypto')) && (randomBits = crypto[
+                        'randomBytes'])) {
+                    return function (bits) {
+                        var bytes = Math.ceil(bits / 8),
+                            str = null;
+
+                        while (str === null) {
+                            str = construct(bits, randomBits(bytes).toString('hex'), 16, 4);
+                        }
+                        return str;
+                    }
+                }
+
+                // browsers with window.crypto.getRandomValues()
+                if (global['crypto'] && typeof global['crypto']['getRandomValues'] === 'function' && typeof global[
+                        'Uint32Array'] === 'function') {
+                    crypto = global['crypto'];
+                    return function (bits) {
+                        var elems = Math.ceil(bits / 32),
+                            str = null,
+                            arr = new global['Uint32Array'](elems);
+
+                        while (str === null) {
+                            crypto['getRandomValues'](arr);
+                            str = construct(bits, arr, 10, 32);
+                        }
+
+                        return str;
+                    }
+                }
+
+                // A totally insecure RNG!!! (except in Safari)
+                // Will produce a warning every time it is called.
+                config.unsafePRNG = true;
+                warn();
+
+                var bitsPerNum = 32;
+                var max = Math.pow(2, bitsPerNum) - 1;
+                return function (bits) {
+                    var elems = Math.ceil(bits / bitsPerNum);
+                    var arr = [],
+                        str = null;
+                    while (str === null) {
+                        for (var i = 0; i < elems; i++) {
+                            arr[i] = Math.floor(Math.random() * max + 1);
+                        }
+                        str = construct(bits, arr, 10, bitsPerNum);
+                    }
+                    return str;
+                };
+            };
+
+            // Warn about using insecure rng.
+            // Called when Math.random() is being used.
+            function warn() {
+                global['console']['warn'](defaults.warning);
+                if (typeof global['alert'] === 'function' && config.alert) {
+                    global['alert'](defaults.warning);
+                }
+            }
+
+            // Set the PRNG to use. If no RNG function is supplied, pick a default using getRNG()
+            /** @expose **/
+            exports.setRNG = function (rng, alert) {
+                if (!isInited()) {
+                    this.init();
+                }
+                config.unsafePRNG = false;
+                rng = rng || getRNG();
+
+                // test the RNG (5 times)
+                if (typeof rng !== 'function' || typeof rng(config.bits) !== 'string' || !parseInt(rng(config.bits),
+                        2) || rng(config.bits).length > config.bits || rng(config.bits).length < config.bits) {
+                    throw new Error(
+                        "Random number generator is invalid. Supply an RNG of the form function(bits){} that returns a string containing 'bits' number of random 1's and 0's."
+                    )
+                } else {
+                    config.rng = rng;
+                }
+                config.alert = !!alert;
+
+                return !!config.unsafePRNG;
+            };
+
+            function isSetRNG() {
+                return typeof config.rng === 'function';
+            };
+
+            // Generates a random bits-length number string using the PRNG
+            /** @expose **/
+            exports.random = function (bits) {
+                if (!isSetRNG()) {
+                    this.setRNG();
+                }
+
+                if (typeof bits !== 'number' || bits % 1 !== 0 || bits < 2) {
+                    throw new Error('Number of bits must be an integer greater than 1.')
+                }
+
+                if (config.unsafePRNG) {
+                    warn();
+                }
+                return bin2hex(config.rng(bits));
+            }
+
+            // Divides a `secret` number String str expressed in radix `inputRadix` (optional, default 16)
+            // into `numShares` shares, each expressed in radix `outputRadix` (optional, default to `inputRadix`),
+            // requiring `threshold` number of shares to reconstruct the secret.
+            // Optionally, zero-pads the secret to a length that is a multiple of padLength before sharing.
+            /** @expose **/
+            exports.share = function (secret, numShares, threshold, padLength, withoutPrefix) {
+                if (!isInited()) {
+                    this.init();
+                }
+                if (!isSetRNG()) {
+                    this.setRNG();
+                }
+
+                padLength = padLength || 0;
+
+                if (typeof secret !== 'string') {
+                    throw new Error('Secret must be a string.');
+                }
+                if (typeof numShares !== 'number' || numShares % 1 !== 0 || numShares < 2) {
+                    throw new Error('Number of shares must be an integer between 2 and 2^bits-1 (' + config.max +
+                        '), inclusive.')
+                }
+                if (numShares > config.max) {
+                    var neededBits = Math.ceil(Math.log(numShares + 1) / Math.LN2);
+                    throw new Error('Number of shares must be an integer between 2 and 2^bits-1 (' + config.max +
+                        '), inclusive. To create ' + numShares + ' shares, use at least ' + neededBits +
+                        ' bits.')
+                }
+                if (typeof threshold !== 'number' || threshold % 1 !== 0 || threshold < 2) {
+                    throw new Error('Threshold number of shares must be an integer between 2 and 2^bits-1 (' +
+                        config.max + '), inclusive.');
+                }
+                if (threshold > config.max) {
+                    var neededBits = Math.ceil(Math.log(threshold + 1) / Math.LN2);
+                    throw new Error('Threshold number of shares must be an integer between 2 and 2^bits-1 (' +
+                        config.max + '), inclusive.  To use a threshold of ' + threshold +
+                        ', use at least ' + neededBits + ' bits.');
+                }
+                if (typeof padLength !== 'number' || padLength % 1 !== 0) {
+                    throw new Error('Zero-pad length must be an integer greater than 1.');
+                }
+
+                if (config.unsafePRNG) {
+                    warn();
+                }
+
+                secret = '1' + hex2bin(secret); // append a 1 so that we can preserve the correct number of leading zeros in our secret
+                secret = split(secret, padLength);
+                var x = new Array(numShares),
+                    y = new Array(numShares);
+                for (var i = 0, len = secret.length; i < len; i++) {
+                    var subShares = this._getShares(secret[i], numShares, threshold);
+                    for (var j = 0; j < numShares; j++) {
+                        x[j] = x[j] || subShares[j].x.toString(config.radix);
+                        y[j] = padLeft(subShares[j].y.toString(2)) + (y[j] ? y[j] : '');
+                    }
+                }
+                var padding = config.max.toString(config.radix).length;
+                if (withoutPrefix) {
+                    for (var i = 0; i < numShares; i++) {
+                        x[i] = bin2hex(y[i]);
+                    }
+                } else {
+                    for (var i = 0; i < numShares; i++) {
+                        x[i] = config.bits.toString(36).toUpperCase() + padLeft(x[i], padding) + bin2hex(y[i]);
+                    }
+                }
+
+                return x;
+            };
+
+            // This is the basic polynomial generation and evaluation function
+            // for a `config.bits`-length secret (NOT an arbitrary length)
+            // Note: no error-checking at this stage! If `secrets` is NOT
+            // a NUMBER less than 2^bits-1, the output will be incorrect!
+            /** @expose **/
+            exports._getShares = function (secret, numShares, threshold) {
+                var shares = [];
+                var coeffs = [secret];
+
+                for (var i = 1; i < threshold; i++) {
+                    coeffs[i] = parseInt(config.rng(config.bits), 2);
+                }
+                for (var i = 1, len = numShares + 1; i < len; i++) {
+                    shares[i - 1] = {
+                        x: i,
+                        y: horner(i, coeffs)
+                    }
+                }
+                return shares;
+            };
+
+            // Polynomial evaluation at `x` using Horner's Method
+            // TODO: this can possibly be sped up using other methods
+            // NOTE: fx=fx * x + coeff[i] ->  exp(log(fx) + log(x)) + coeff[i],
+            //       so if fx===0, just set fx to coeff[i] because
+            //       using the exp/log form will result in incorrect value
+            function horner(x, coeffs) {
+                var logx = config.logs[x];
+                var fx = 0;
+                for (var i = coeffs.length - 1; i >= 0; i--) {
+                    if (fx === 0) {
+                        fx = coeffs[i];
+                        continue;
+                    }
+                    fx = config.exps[(logx + config.logs[fx]) % config.max] ^ coeffs[i];
+                }
+                return fx;
+            };
+
+            function inArray(arr, val) {
+                for (var i = 0, len = arr.length; i < len; i++) {
+                    if (arr[i] === val) {
+                        return true;
+                    }
+                }
+                return false;
+            };
+
+            function processShare(share) {
+
+                var bits = parseInt(share[0], 36);
+                if (bits && (typeof bits !== 'number' || bits % 1 !== 0 || bits < defaults.minBits || bits >
+                        defaults.maxBits)) {
+                    throw new Error('Number of bits must be an integer between ' + defaults.minBits + ' and ' +
+                        defaults.maxBits + ', inclusive.')
+                }
+
+                var max = Math.pow(2, bits) - 1;
+                var idLength = max.toString(config.radix).length;
+
+                var id = parseInt(share.substr(1, idLength), config.radix);
+                if (typeof id !== 'number' || id % 1 !== 0 || id < 1 || id > max) {
+                    throw new Error('Share id must be an integer between 1 and ' + config.max + ', inclusive.');
+                }
+                share = share.substr(idLength + 1);
+                if (!share.length) {
+                    throw new Error('Invalid share: zero-length share.')
+                }
+                return {
+                    'bits': bits,
+                    'id': id,
+                    'value': share
+                };
+            };
+
+            /** @expose **/
+            exports._processShare = processShare;
+
+            // Protected method that evaluates the Lagrange interpolation
+            // polynomial at x=`at` for individual config.bits-length
+            // segments of each share in the `shares` Array.
+            // Each share is expressed in base `inputRadix`. The output
+            // is expressed in base `outputRadix'
+            function combine(at, shares) {
+                var setBits, share, x = [],
+                    y = [],
+                    result = '',
+                    idx;
+
+                for (var i = 0, len = shares.length; i < len; i++) {
+                    share = processShare(shares[i]);
+                    if (typeof setBits === 'undefined') {
+                        setBits = share['bits'];
+                    } else if (share['bits'] !== setBits) {
+                        throw new Error('Mismatched shares: Different bit settings.')
+                    }
+
+                    if (config.bits !== setBits) {
+                        init(setBits);
+                    }
+
+                    if (inArray(x, share['id'])) { // repeated x value?
+                        continue;
+                    }
+
+                    idx = x.push(share['id']) - 1;
+                    share = split(hex2bin(share['value']));
+                    for (var j = 0, len2 = share.length; j < len2; j++) {
+                        y[j] = y[j] || [];
+                        y[j][idx] = share[j];
+                    }
+                }
+
+                for (var i = 0, len = y.length; i < len; i++) {
+                    result = padLeft(lagrange(at, x, y[i]).toString(2)) + result;
+                }
+
+                if (at === 0) { // reconstructing the secret
+                    var idx = result.indexOf('1'); //find the first 1
+                    return bin2hex(result.slice(idx + 1));
+                } else { // generating a new share
+                    return bin2hex(result);
+                }
+            };
+
+            // Combine `shares` Array into the original secret
+            /** @expose **/
+            exports.combine = function (shares) {
+                return combine(0, shares);
+            };
+
+            // Generate a new share with id `id` (a number between 1 and 2^bits-1)
+            // `id` can be a Number or a String in the default radix (16)
+            /** @expose **/
+            exports.newShare = function (id, shares) {
+                if (typeof id === 'string') {
+                    id = parseInt(id, config.radix);
+                }
+
+                var share = processShare(shares[0]);
+                var max = Math.pow(2, share['bits']) - 1;
+
+                if (typeof id !== 'number' || id % 1 !== 0 || id < 1 || id > max) {
+                    throw new Error('Share id must be an integer between 1 and ' + config.max + ', inclusive.');
+                }
+
+                var padding = max.toString(config.radix).length;
+                return config.bits.toString(36).toUpperCase() + padLeft(id.toString(config.radix), padding) +
+                    combine(id, shares);
+            };
+
+            // Evaluate the Lagrange interpolation polynomial at x = `at`
+            // using x and y Arrays that are of the same length, with
+            // corresponding elements constituting points on the polynomial.
+            function lagrange(at, x, y) {
+                var sum = 0,
+                    product,
+                    i, j;
+
+                for (var i = 0, len = x.length; i < len; i++) {
+                    if (!y[i]) {
+                        continue;
+                    }
+
+                    product = config.logs[y[i]];
+                    for (var j = 0; j < len; j++) {
+                        if (i === j) {
+                            continue;
+                        }
+                        if (at === x[j]) { // happens when computing a share that is in the list of shares used to compute it
+                            product = -1; // fix for a zero product term, after which the sum should be sum^0 = sum, not sum^1
+                            break;
+                        }
+                        product = (product + config.logs[at ^ x[j]] - config.logs[x[i] ^ x[j]] + config.max /* to make sure it's not negative */ ) %
+                            config.max;
+                    }
+
+                    sum = product === -1 ? sum : sum ^ config.exps[product]; // though exps[-1]= undefined and undefined ^ anything = anything in chrome, this behavior may not hold everywhere, so do the check
+                }
+                return sum;
+            };
+
+            /** @expose **/
+            exports._lagrange = lagrange;
+
+            // Splits a number string `bits`-length segments, after first
+            // optionally zero-padding it to a length that is a multiple of `padLength.
+            // Returns array of integers (each less than 2^bits-1), with each element
+            // representing a `bits`-length segment of the input string from right to left,
+            // i.e. parts[0] represents the right-most `bits`-length segment of the input string.
+            function split(str, padLength) {
+                if (padLength) {
+                    str = padLeft(str, padLength)
+                }
+                var parts = [];
+                for (var i = str.length; i > config.bits; i -= config.bits) {
+                    parts.push(parseInt(str.slice(i - config.bits, i), 2));
+                }
+                parts.push(parseInt(str.slice(0, i), 2));
+                return parts;
+            };
+
+            // Pads a string `str` with zeros on the left so that its length is a multiple of `bits`
+            function padLeft(str, bits) {
+                bits = bits || config.bits
+                var missing = str.length % bits;
+                return (missing ? new Array(bits - missing + 1).join('0') : '') + str;
+            };
+
+            function hex2bin(str) {
+                var bin = '',
+                    num;
+                for (var i = str.length - 1; i >= 0; i--) {
+                    num = parseInt(str[i], 16)
+                    if (isNaN(num)) {
+                        throw new Error('Invalid hex character.')
+                    }
+                    bin = padLeft(num.toString(2), 4) + bin;
+                }
+                return bin;
+            }
+
+            function bin2hex(str) {
+                var hex = '',
+                    num;
+                str = padLeft(str, 4);
+                for (var i = str.length; i >= 4; i -= 4) {
+                    num = parseInt(str.slice(i - 4, i), 2);
+                    if (isNaN(num)) {
+                        throw new Error('Invalid binary character.')
+                    }
+                    hex = num.toString(16) + hex;
+                }
+                return hex;
+            }
+
+            // Converts a given UTF16 character string to the HEX representation.
+            // Each character of the input string is represented by
+            // `bytesPerChar` bytes in the output string.
+            /** @expose **/
+            exports.str2hex = function (str, bytesPerChar) {
+                if (typeof str !== 'string') {
+                    throw new Error('Input must be a character string.');
+                }
+                bytesPerChar = bytesPerChar || defaults.bytesPerChar;
+
+                if (typeof bytesPerChar !== 'number' || bytesPerChar % 1 !== 0 || bytesPerChar < 1 ||
+                    bytesPerChar > defaults.maxBytesPerChar) {
+                    throw new Error('Bytes per character must be an integer between 1 and ' + defaults.maxBytesPerChar +
+                        ', inclusive.')
+                }
+
+                var hexChars = 2 * bytesPerChar;
+                var max = Math.pow(16, hexChars) - 1;
+                var out = '',
+                    num;
+                for (var i = 0, len = str.length; i < len; i++) {
+                    num = str[i].charCodeAt();
+                    if (isNaN(num)) {
+                        throw new Error('Invalid character: ' + str[i]);
+                    } else if (num > max) {
+                        var neededBytes = Math.ceil(Math.log(num + 1) / Math.log(256));
+                        throw new Error('Invalid character code (' + num +
+                            '). Maximum allowable is 256^bytes-1 (' + max +
+                            '). To convert this character, use at least ' + neededBytes + ' bytes.')
+                    } else {
+                        out = padLeft(num.toString(16), hexChars) + out;
+                    }
+                }
+                return out;
+            };
+
+            // Converts a given HEX number string to a UTF16 character string.
+            /** @expose **/
+            exports.hex2str = function (str, bytesPerChar) {
+                if (typeof str !== 'string') {
+                    throw new Error('Input must be a hexadecimal string.');
+                }
+                bytesPerChar = bytesPerChar || defaults.bytesPerChar;
+
+                if (typeof bytesPerChar !== 'number' || bytesPerChar % 1 !== 0 || bytesPerChar < 1 ||
+                    bytesPerChar > defaults.maxBytesPerChar) {
+                    throw new Error('Bytes per character must be an integer between 1 and ' + defaults.maxBytesPerChar +
+                        ', inclusive.')
+                }
+
+                var hexChars = 2 * bytesPerChar;
+                var out = '';
+                str = padLeft(str, hexChars);
+                for (var i = 0, len = str.length; i < len; i += hexChars) {
+                    out = String.fromCharCode(parseInt(str.slice(i, i + hexChars), 16)) + out;
+                }
+                return out;
+            };
+
+            // by default, initialize without an RNG
+            exports.init();
+        })(typeof module !== 'undefined' && module['exports'] ? module['exports'] : (window['shamirSecretShare'] = {}),
+            typeof global !== 'undefined' ? global : window);
+</script>
+
+<script>
+  /* Reactor Event handling */
+  if (typeof reactor == "undefined" || !reactor) {
+    (function () {
+      function Event(name) {
+        this.name = name;
+        this.callbacks = [];
+      }
+
+      Event.prototype.registerCallback = function (callback) {
+        this.callbacks.push(callback);
+      };
+
+      function Reactor() {
+        this.events = {};
+      }
+
+      Reactor.prototype.registerEvent = function (eventName) {
+        var event = new Event(eventName);
+        this.events[eventName] = event;
+      };
+
+      Reactor.prototype.dispatchEvent = function (eventName, eventArgs) {
+        this.events[eventName].callbacks.forEach(function (callback) {
+          callback(eventArgs);
+        });
+      };
+
+      Reactor.prototype.addEventListener = function (eventName, callback) {
+        this.events[eventName].registerCallback(callback);
+      };
+
+      window.reactor = new Reactor();
+    })();
+  }
+
+  /* Sample Usage
+
+    --Creating and defining the event--
+    reactor.registerEvent('<eventName>');
+    reactor.addEventListener('<eventName>', function(someObject){
+      do something...
+    });
+
+    --Firing the event--
+    reactor.dispatchEvent('<eventName>',<someObject>);
+
+  */
+</script>
+<script>
+  /* FLO Crypto Operators*/
+  const floCrypto = {
+
+    p: BigInteger("FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEFFFFFC2F", 16),
+
+    ecparams: EllipticCurve.getSECCurveByName("secp256k1"),
+
+    exponent1: function () {
+      return this.p.add(BigInteger.ONE).divide(BigInteger("4"))
+    },
+
+    calculateY: function (x) {
+      let p = this.p;
+      let exp = this.exponent1();
+      // x is x value of public key in BigInteger format without 02 or 03 or 04 prefix
+      return x.modPow(BigInteger("3"), p).add(BigInteger("7")).mod(p).modPow(exp, p)
+    },
+
+    //generate a random Interger within range
+    randInt: function(min, max) {
+        min = Math.ceil(min);
+        max = Math.floor(max);
+        return Math.floor(Math.random() * (max - min + 1)) + min;
+    },
+
+    //generate a random String within length (options : alphaNumeric chars only)
+    randString: function (length, alphaNumeric = false) {
+        var result = '';
+        if(alphaNumeric)
+            var characters = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789';
+        else
+            var characters = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789_+-./*?@#&$<>=[]{}():';
+        for ( var i = 0; i < length; i++ ) 
+            result += characters.charAt(Math.floor(Math.random() * characters.length));
+        return result;
+    },
+
+    getUncompressedPublicKey: function (compressedPublicKey) {
+
+      const p = this.p;
+
+      // Fetch x from compressedPublicKey
+      let pubKeyBytes = Crypto.util.hexToBytes(compressedPublicKey);
+      const prefix = pubKeyBytes.shift() // remove prefix
+      let prefix_modulus = prefix % 2;
+      pubKeyBytes.unshift(0) // add prefix 0
+      let x = new BigInteger(pubKeyBytes)
+      let xDecimalValue = x.toString()
+
+      // Fetch y
+      let y = this.calculateY(x);
+      let yDecimalValue = y.toString();
+
+      // verify y value
+      let resultBigInt = y.mod(BigInteger("2"));
+
+      let check = resultBigInt.toString() % 2;
+
+      if (prefix_modulus !== check) {
+        yDecimalValue = y.negate().mod(p).toString();
+      }
+
+      return {
+        x: xDecimalValue,
+        y: yDecimalValue
+      };
+    },
+
+    getSenderPublicKeyString: function () {
+      privateKey = ellipticCurveEncryption.senderRandom();
+      senderPublicKeyString = ellipticCurveEncryption.senderPublicString(privateKey);
+      return {
+        privateKey: privateKey,
+        senderPublicKeyString: senderPublicKeyString
+      }
+    },
+
+    deriveSharedKeySender: function (receiverCompressedPublicKey, senderPrivateKey) {
+      try {
+        let receiverPublicKeyString = this.getUncompressedPublicKey(receiverCompressedPublicKey);
+        var senderDerivedKey = ellipticCurveEncryption.senderSharedKeyDerivation(
+          receiverPublicKeyString.x, receiverPublicKeyString.y, senderPrivateKey);
+        return senderDerivedKey;
+      } catch (error) {
+        return new Error(error);
+      }
+    },
+
+    deriveReceiverSharedKey: function (senderPublicKeyString, receiverPrivateKey) {
+      return ellipticCurveEncryption.receiverSharedKeyDerivation(
+        senderPublicKeyString.XValuePublicString, senderPublicKeyString.YValuePublicString,
+        receiverPrivateKey);
+    },
+
+    getReceiverPublicKeyString: function (privateKey) {
+      return ellipticCurveEncryption.receiverPublicString(privateKey);
+    },
+
+    deriveSharedKeyReceiver: function (senderPublicKeyString, receiverPrivateKey) {
+      try {
+        return ellipticCurveEncryption.receiverSharedKeyDerivation(senderPublicKeyString.XValuePublicString,
+          senderPublicKeyString.YValuePublicString, receiverPrivateKey);
+
+      } catch (error) {
+        return new Error(error);
+      }
+    },
+
+    wifToDecimal: function (pk_wif, isPubKeyCompressed = false) {
+      let pk = Bitcoin.Base58.decode(pk_wif)
+      pk.shift()
+      pk.splice(-4, 4)
+      //If the private key corresponded to a compressed public key, also drop the last byte (it should be 0x01).
+      if (isPubKeyCompressed == true) pk.pop()
+      pk.unshift(0)
+      privateKeyDecimal = BigInteger(pk).toString()
+      privateKeyHex = Crypto.util.bytesToHex(pk)
+      return {
+        privateKeyDecimal: privateKeyDecimal,
+        privateKeyHex: privateKeyHex
+      }
+    },
+
+    //Encrypt Data using public-key
+    encryptData: function (data, receiverCompressedPublicKey) {
+      var senderECKeyData = this.getSenderPublicKeyString();
+      var senderDerivedKey = this.deriveSharedKeySender(receiverCompressedPublicKey, senderECKeyData.privateKey);
+      let senderKey = senderDerivedKey.XValue + senderDerivedKey.YValue;
+      let secret = Crypto.AES.encrypt(data, senderKey);
+      return {
+        secret: secret,
+        senderPublicKeyString: senderECKeyData.senderPublicKeyString
+      };
+    },
+
+    //Decrypt Data using private-key
+    decryptData: function (data, myPrivateKey) {
+      var receiverECKeyData = {};
+      if (typeof myPrivateKey !== "string") throw new Error("No private key found.");
+
+      let privateKey = this.wifToDecimal(myPrivateKey, true);
+      if (typeof privateKey.privateKeyDecimal !== "string") throw new Error(
+        "Failed to detremine your private key.");
+      receiverECKeyData.privateKey = privateKey.privateKeyDecimal;
+
+      var receiverDerivedKey = this.deriveReceiverSharedKey(data.senderPublicKeyString, receiverECKeyData
+        .privateKey);
+
+      let receiverKey = receiverDerivedKey.XValue + receiverDerivedKey.YValue;
+      let decryptMsg = Crypto.AES.decrypt(data.secret, receiverKey);
+      return decryptMsg;
+    },
+
+    //Sign data using private-key
+    signData: function (data, privateKeyHex) {
+      var key = new Bitcoin.ECKey(privateKeyHex);
+      key.setCompressed(true);
+
+      var privateKeyArr = key.getBitcoinPrivateKeyByteArray();
+      privateKey = BigInteger.fromByteArrayUnsigned(privateKeyArr);
+      var messageHash = Crypto.SHA256(data);
+
+      var messageHashBigInteger = new BigInteger(messageHash);
+      var messageSign = Bitcoin.ECDSA.sign(messageHashBigInteger, key.priv);
+
+      var sighex = Crypto.util.bytesToHex(messageSign);
+      return sighex;
+    },
+
+    //Verify signatue of the data using public-key
+    verifySign: function (data, signatureHex, publicKeyHex) {
+      var msgHash = Crypto.SHA256(data);
+      var messageHashBigInteger = new BigInteger(msgHash);
+
+      var sigBytes = Crypto.util.hexToBytes(signatureHex);
+      var signature = Bitcoin.ECDSA.parseSig(sigBytes);
+
+      var publicKeyPoint = this.ecparams.getCurve().decodePointHex(publicKeyHex);
+
+      var verify = Bitcoin.ECDSA.verifyRaw(messageHashBigInteger, signature.r, signature.s,
+        publicKeyPoint);
+      return verify;
+    },
+
+    //Generates a new flo ID and returns private-key, public-key and floID
+    generateNewID: function () {
+      try {
+        var key = new Bitcoin.ECKey(false);
+        key.setCompressed(true);
+        return {
+          floID: key.getBitcoinAddress(),
+          pubKey: key.getPubKeyHex(),
+          privKey: key.getBitcoinWalletImportFormat()
+        }
+      } catch (e) {
+        console.log(e);
+      }
+    },
+
+    //Returns public-key from private-key
+    getPubKeyHex: function (privateKeyHex) {
+      var key = new Bitcoin.ECKey(privateKeyHex);
+      if (key.priv == null) {
+        alert("Invalid Private key");
+        return;
+      }
+      key.setCompressed(true);
+      var pubkeyHex = key.getPubKeyHex();
+      return pubkeyHex;
+    },
+
+    //Returns flo-ID from public-key
+    getFloIDfromPubkeyHex: function (pubkeyHex) {
+      var key = new Bitcoin.ECKey().setPub(pubkeyHex);
+      var floID = key.getBitcoinAddress();
+      return floID;
+    },
+
+    //Verify the private-key for the given public-key or flo-ID
+    verifyPrivKey: function (privateKeyHex, pubKey_floID, isfloID = true) {
+      try {
+        var key = new Bitcoin.ECKey(privateKeyHex);
+        if (key.priv == null)
+          return false;
+        key.setCompressed(true);
+        if (isfloID && pubKey_floID == key.getBitcoinAddress())
+          return true;
+        else if (!isfloID && pubKey_floID == key.getPubKeyHex())
+          return true;
+        else
+          return false;
+      } catch (e) {
+        console.log(e);
+      }
+    },
+
+    //Check if the given Address is valid or not
+    validateAddr: function (inpAddr) {
+      try {
+        var addr = new Bitcoin.Address(inpAddr);
+        return true;
+      } catch {
+        return false;
+      }
+    },
+
+    createShamirsSecretShares: function (str, total_shares, threshold_limit) {
+        try{
+            if (str.length > 0) {
+                var strHex = shamirSecretShare.str2hex(str);
+                var shares = shamirSecretShare.share(strHex, total_shares, threshold_limit);
+                return shares;
+            }
+            return false;
+        }catch{
+            return false
+        }
+    },
+
+    verifyShamirsSecret: function (sharesArray, str) {
+        return (str && this.retrieveShamirSecret(sharesArray) === str)
+    },
+
+    retrieveShamirSecret: function (sharesArray) {
+        try{
+            if (sharesArray.length > 0) {
+                var comb = shamirSecretShare.combine(sharesArray.slice(0, sharesArray.length));
+                comb = shamirSecretShare.hex2str(comb);
+                return comb;
+            }
+            return false;
+        }catch{
+            return false
+        }
+    }
+  }
+</script>
+<script>
+  /* FLO Blockchain Operator to send/receive data from blockchain using API calls*/
+  const floBlockchainAPI = {
+
+    util: {
+        serverList: floGlobals.apiURL[floGlobals.blockchain].slice(0),
+        curPos: floCrypto.randInt(0, floGlobals.apiURL[floGlobals.blockchain].length),
+        fetch_retry: function(apicall){
+            return new Promise((resolve,reject) => {
+                this.serverList.splice(this.curPos, 1);
+                this.curPos = floCrypto.randInt(0, this.serverList.length)
+                this.fetch_api(apicall)
+                    .then(result => resolve(result))
+                    .catch(error => reject(error));
+            })
+        },
+        fetch_api: function(apicall){
+            return new Promise((resolve, reject) => {
+                if(this.serverList.length === 0)
+                    reject("No floSight server working")
+                else{
+                    fetch(this.serverList[this.curPos] + apicall).then(response  => {
+                        if(response.ok)
+                            response.json().then(data => resolve(data));
+                        else{
+                            this.fetch_retry(apicall)
+                                .then(result => resolve(result))
+                                .catch(error => reject(error));
+                        }
+                    }).catch(error => {
+                        this.fetch_retry(apicall)
+                            .then(result => resolve(result))
+                            .catch(error => reject(error));
+                    })
+                }
+            })
+        }
+    },
+
+    //Promised function to get data from API
+    promisedAPI: function (apicall) {
+      return new Promise((resolve, reject) => {
+        console.log(apicall)
+        this.util.fetch_api(apicall)
+            .then(result => resolve(result))
+            .catch(error => reject(error));
+      });
+    },
+
+    //Get balance for the given Address
+    getBalance: function (addr) {
+      return new Promise((resolve, reject) => {
+        this.promisedAPI(`api/addr/${addr}/balance`)
+            .then(balance => resolve(parseFloat(balance)))
+            .catch(error => reject(error));
+      });
+    },
+
+    //Write Data into blockchain
+    writeData: function (senderAddr, Data, PrivKey, receiverAddr = floGlobals.adminID) {
+      return new Promise((resolve, reject) => {
+        this.sendTx(senderAddr, receiverAddr, floGlobals.sendAmt, PrivKey, Data)
+            .then(txid => resolve(txid))
+            .catch(error => reject(error))
+      });
+    },
+
+    //Send Tx to blockchain 
+    sendTx: function (senderAddr, receiverAddr, sendAmt, PrivKey, floData = '') {
+      return new Promise((resolve, reject) => {
+        if (!floCrypto.validateAddr(senderAddr))
+          reject(`Invalid address : ${senderAddr}`);
+        else if (!floCrypto.validateAddr(receiverAddr))
+          reject(`Invalid address : ${receiverAddr}`);
+        if (PrivKey.length < 1 || !floCrypto.verifyPrivKey(PrivKey, senderAddr))
+          reject("Invalid Private key!");
+        else if (typeof sendAmt !== 'number' || sendAmt <= 0)
+          reject(`Invalid sendAmt : ${sendAmt}`);
+        else {
+          var trx = bitjs.transaction();
+          var utxoAmt = 0.0;
+          var fee = floGlobals.fee;
+          this.promisedAPI(`api/addr/${senderAddr}/utxo`).then(utxos => {
+            for (var i = utxos.length - 1;
+              (i >= 0) && (utxoAmt < sendAmt + fee); i--) {
+              if (utxos[i].confirmations) {
+                trx.addinput(utxos[i].txid, utxos[i].vout, utxos[i].scriptPubKey)
+                utxoAmt += utxos[i].amount;
+              } else break;
+            }
+            if (utxoAmt < sendAmt + fee)
+              reject("Insufficient balance!");
+            else {
+              trx.addoutput(receiverAddr, sendAmt);
+              var change = utxoAmt - sendAmt - fee;
+              if (change > 0)
+                trx.addoutput(senderAddr, change);
+              trx.addflodata(floData);
+              var signedTxHash = trx.sign(PrivKey, 1);
+              this.broadcastTx(signedTxHash)
+                .then(txid => resolve(txid))
+                .catch(error => reject(error))
+            }
+          }).catch(error => reject(error))
+        }
+      });
+    },
+
+    //Broadcast signed Tx in blockchain using API
+    broadcastTx: function (signedTxHash) {
+      return new Promise((resolve, reject) => {
+        var request = new XMLHttpRequest();
+        var url = this.util.serverList[this.util.curPos] + 'api/tx/send';
+        if (signedTxHash.length < 1)
+          reject("Empty Signature");
+        else {
+          var params = `{"rawtx":"${signedTxHash}"}`;
+          request.open('POST', url, true);
+          //Send the proper header information along with the request
+          request.setRequestHeader('Content-type', 'application/json');
+          request.onload = function () {
+            if (request.readyState == 4 && request.status == 200) {
+              console.log(request.response);
+              resolve(JSON.parse(request.response).txid.result);
+            } else
+              reject(request.responseText);
+          }
+          request.send(params);
+        }
+      })
+    },
+
+    //Read Txs of Address between from and to
+    readTxs: function (addr, from, to) {
+      return new Promise((resolve, reject) => {
+        this.promisedAPI(`api/addrs/${addr}/txs?from=${from}&to=${to}`)
+            .then(response => resolve(response))
+            .catch(error => reject(error))
+      });
+    },
+
+    //Read All Txs of Address (newest first)
+    readAllTxs: function (addr) {
+      return new Promise((resolve, reject) => {
+        this.promisedAPI(`api/addrs/${addr}/txs?from=0&to=1`).then(response => {
+          this.promisedAPI(`api/addrs/${addr}/txs?from=0&to=${response.totalItems}0`)
+            .then(response => resolve(response.items))
+            .catch(error => reject(error));
+        }).catch(error => reject(error))
+      });
+    },
+
+    /*Read flo Data from txs of given Address
+    options can be used to filter data
+    limit       : maximum number of filtered data (default = 1000, negative  = no limit)
+    ignoreOld   : ignore old txs (default = 0)
+    sentOnly    : filters only sent data
+    pattern     : filters data that starts with a pattern
+    contains    : filters data that contains a string
+    filter      : custom filter funtion for floData (eg . filter: d => {return d[0] == '$'})
+    */
+    readData: function(addr,options = {}){
+        options.limit = options.limit | 1000
+        options.ignoreOld = options.ignoreOld | 0
+        return new Promise((resolve, reject) => {
+        this.promisedAPI(`api/addrs/${addr}/txs?from=0&to=1`).then(response => {
+          var newItems = response.totalItems - options.ignoreOld;
+          this.promisedAPI(`api/addrs/${addr}/txs?from=0&to=${newItems*2}`).then(response => {
+              if (options.limit <= 0) 
+                options.limit = response.items.length;
+              var filteredData = [];
+              for (i = 0; i < (response.totalItems - options.ignoreOld) && filteredData.length < options.limit; i++){
+                if(options.sentOnly && response.items[i].vin[0].addr !== addr)
+                    continue;
+                if(options.pattern && !response.items[i].floData.startsWith(options.pattern, 0) && !response.items[i].floData.startsWith(options.pattern, 2))
+                    continue;
+                if(options.contains && !response.items[i].floData.includes(options.contains))
+                    continue;
+                if(options.filter && !options.filter(response.items[i].floData))
+                    continue;
+                filteredData.push(response.items[i].floData);
+              }
+              resolve({totalTxs:response.totalItems , data:filteredData});
+          }).catch(error => {
+            reject(error);
+          });
+        }).catch(error => {
+          reject(error);
+        });
+      });
+    }
+  }
+</script>
+<script>
+  /* flo Supernode Operators to send/receive data from supernodes using websocket */
+  const floSupernode = {
+
+    //kBucket object 
+    kBucket: {
+      supernodeKBucket: null,
+      decodeBase58Address: function (address) {
+        let k = bitjs.Base58.decode(address)
+        k.shift()
+        k.splice(-4, 4)
+        return Crypto.util.bytesToHex(k)
+      },
+      floIdToKbucketId: function (address) {
+        const decodedId = this.decodeBase58Address(address);
+        const nodeIdBigInt = new BigInteger(decodedId, 16);
+        const nodeIdBytes = nodeIdBigInt.toByteArrayUnsigned();
+        const nodeIdNewInt8Array = new Uint8Array(nodeIdBytes);
+        return nodeIdNewInt8Array;
+      },
+      launch: function (superNodeList = Object.keys(floGlobals.supernodes), master_floID = floGlobals.adminID) {
+        return new Promise((resolve, reject) => {
+          try {
+            const SuKBucketId = this.floIdToKbucketId(master_floID);
+            const SukbOptions = {
+              localNodeId: SuKBucketId
+            }
+            this.supernodeKBucket = new BuildKBucket(SukbOptions);
+            for (var i = 0; i < superNodeList.length; i++) {
+              this.addNewNode(superNodeList[i])
+            }
+            resolve('SuperNode KBucket formed');
+          } catch (error) {
+            reject(error);
+          }
+        });
+      },
+      addContact: function (id, floID, KB = this.supernodeKBucket) {
+        const contact = {
+          id: id,
+          floID: floID
+        };
+        KB.add(contact)
+      },
+      addNewNode: function (address, KB = this.supernodeKBucket) {
+        let decodedId = address;
+        try {
+          decodedId = this.floIdToKbucketId(address);
+        } catch (e) {
+          decodedId = address;
+        }
+        this.addContact(decodedId, address, KB);
+      },
+      isNodePresent: function (flo_id, KB = this.supernodeKBucket) {
+        return new Promise((resolve, reject) => {
+          let kArray = KB.toArray();
+          let kArrayFloIds = kArray.map(k => k.data.id);
+          if (kArrayFloIds.includes(flo_id)) {
+            resolve(true);
+          } else {
+            reject(false);
+          }
+        });
+      },
+      getPrevSupernode: function(flo_addr, n = 1, KB = this.supernodeKBucket){
+        return new Promise((resolve, reject) => {
+          try {
+            let isFloIdUint8 = flo_addr instanceof Uint8Array;
+            if (!isFloIdUint8)
+              flo_addr = this.floIdToKbucketId(flo_addr);
+            const KA = KB.toArray();
+            let pos = KB._indexOf(KB.root,flo_addr)
+            var prevSupernode = []
+            for(var i = 1; i <= n; i++){
+                if(pos - i < 0)
+                    var prev = pos - i + KA.length
+                else
+                    var prev = pos - i
+                prevSupernode.push(KA[prev])
+            }
+            resolve(prevSupernode);
+          } catch (error) {
+            reject(error);
+          }
+        });
+      },
+      getNextSupernode: function(flo_addr, n = 1, KB = this.supernodeKBucket){
+        return new Promise((resolve, reject) => {
+          try {
+            let isFloIdUint8 = flo_addr instanceof Uint8Array;
+            if (!isFloIdUint8)
+              flo_addr = this.floIdToKbucketId(flo_addr);
+            const KA = KB.toArray();
+            let pos = KB._indexOf(KB.root,flo_addr)
+            var nextSupernode = []
+            for(var i = 1; i <= n; i++){
+                if(pos + i >= KA.length)
+                    var next = pos + i - KA.length
+                else
+                    var next = pos + i
+                nextSupernode.push(KA[next])
+            }
+            resolve(nextSupernode);
+          } catch (error) {
+            reject(error);
+          }
+        });
+      },
+      determineClosestSupernode: function (flo_addr, n = 1, KB = this.supernodeKBucket) {
+        return new Promise((resolve, reject) => {
+          try {
+            let isFloIdUint8 = flo_addr instanceof Uint8Array;
+            if (!isFloIdUint8)
+              flo_addr = this.floIdToKbucketId(flo_addr);
+            const closestSupernode = KB.closest(flo_addr, n);
+            resolve(closestSupernode);
+          } catch (error) {
+            reject(error);
+          }
+        });
+      }
+    },
+
+    sendDataToSN(data, snfloID){
+        return new Promise((resolve, reject) => {
+            console.log(snfloID)
+            var websocket = new WebSocket("wss://" + floGlobals.supernodes[snfloID].uri + "/ws");
+            websocket.onmessage = (evt => {
+                if(evt.data == '$+'){
+                    websocket.send(data);
+                    resolve(`Data sent to supernode : ${snfloID}`);
+                }else if(evt.data == '$-'){
+                    this.kBucket.getNextSupernode(snfloID)
+                        .then(nextnode => this.sendDataToSN(data, nextnode[0].floID))
+                        .catch(error => reject(error))
+                }else{
+                    console.log(evt.data)
+                    reject(evt.data)
+                }
+                websocket.close();
+            })
+            websocket.onerror = (evt) => {
+                this.kBucket.getNextSupernode(snfloID)
+                    .then(nextnode => this.sendDataToSN(data, nextnode[0].floID))
+                    .catch(error => reject(error))
+            };
+        })
+    },
+
+    //Sends data to the supernode
+    sendData: function (data, floID) {
+      return new Promise((resolve, reject) => {
+        this.kBucket.determineClosestSupernode(floID).then(result => {
+            this.sendDataToSN(data, result[0].floID)
+                .then(result => resolve(result))
+                .catch(error => reject(error))
+        }).catch(error => {
+            reject(error);
+        });
+      });
+    },
+
+    requestDataFromSN(request, snfloID){
+        return new Promise((resolve, reject) => {
+            var websocket = new WebSocket("wss://" + floGlobals.supernodes[snfloID].uri + "/ws");
+            websocket.onmessage = (evt => {
+                if(evt.data == '$+'){
+                    websocket.send(`?${request}`);
+                }else if(evt.data == '$-'){
+                    this.kBucket.getNextSupernode(snfloID)
+                        .then(nextnode => this.requestDataFromSN(request, nextnode[0].floID))
+                        .catch(error => reject(error))
+                    websocket.close()
+                }else{
+                    resolve(evt.data);
+                    websocket.close();
+                }
+            })
+            websocket.onerror = (evt) => {
+                this.kBucket.getNextSupernode(snfloID)
+                    .then(nextnode => this.requestDataFromSN(request, nextnode[0].floID))
+                    .catch(error => reject(error))
+            };
+        })
+    },
+
+    //Request data from supernode
+    requestData: function (request, floID) {
+      return new Promise((resolve, reject) => {
+        this.kBucket.determineClosestSupernode(floID).then(result => {
+            this.requestDataFromSN(request, result[0].floID)
+                .then(result => resolve(result))
+                .catch(error => reject(error))
+        }).catch(error => {
+            reject(error);
+        });
+      });
+    }
+  }
+
+</script>
+<script>
+  /* Compact IndexedDB operations */
+
+  window.indexedDB = window.indexedDB || window.mozIndexedDB || window.webkitIndexedDB || window.msIndexedDB;
+  window.IDBTransaction = window.IDBTransaction || window.webkitIDBTransaction || window.msIDBTransaction;
+  window.IDBKeyRange = window.IDBKeyRange || window.webkitIDBKeyRange || window.msIDBKeyRange;
+
+  if (!window.indexedDB)
+    window.alert("Your browser doesn't support a stable version of IndexedDB.")
+
+  const compactIDB = {
+
+    setDefaultDB: function (dbName) {
+      this.dbName = dbName;
+    },
+
+    initDB: function (dbName, objectStores = {}) {
+      return new Promise((resolve, reject) => {
+        this.dbName = this.dbName || dbName;
+        var idb = indexedDB.open(dbName);
+        idb.onerror = (event) => {
+          reject("Error in opening IndexedDB!");
+        };
+        idb.onupgradeneeded = (event) => {
+          var db = event.target.result;
+          for (obs in objectStores) {
+            var objectStore = db.createObjectStore(obs, objectStores[obs].options || {});
+            if (objectStores[obs].indexes && typeof objectStores[obs].indexes === 'object')
+              for (i in objectStores[obs].indexes)
+                objectStore.createIndex(i, i, objectStores[obs].indexes[i] || {});
+          }
+        }
+        idb.onsuccess = (event) => {
+          var db = event.target.result;
+          if (JSON.stringify(Object.values(db.objectStoreNames).sort()) === JSON.stringify(Object.keys(
+              objectStores).sort()))
+            resolve("Initiated IndexedDB");
+          else
+            reject("IndexedDB already exist with different ObjectStores!");
+          db.close();
+        }
+      });
+    },
+
+    openDB: function (dbName = this.dbName) {
+      return new Promise((resolve, reject) => {
+        var idb = indexedDB.open(dbName);
+        idb.onerror = (event) => reject("Error in opening IndexedDB!");
+        idb.onsuccess = (event) => resolve(event.target.result);
+      });
+    },
+
+    deleteDB: function (dbName = this.dbName) {
+      return new Promise((resolve, reject) => {
+        var deleteReq = indexedDB.deleteDatabase(dbName);;
+        deleteReq.onerror = (event) => reject("Error deleting database!");
+        deleteReq.onsuccess = (event) => resolve("Database deleted successfully");
+      });
+    },
+
+    writeData: function (obsName, data, key = false, dbName = this.dbName) {
+      return new Promise((resolve, reject) => {
+        this.openDB(dbName).then(db => {
+          var obs = db.transaction(obsName, "readwrite").objectStore(obsName);
+          let writeReq = (key ? obs.put(data, key) : obs.put(data));
+          writeReq.onsuccess = (evt) => resolve(`Write data Successful`);
+          writeReq.onerror = (evt) => reject(
+            `Write data unsuccessful [${evt.target.error.name}] ${evt.target.error.message}`);
+          db.close();
+        }).catch(error => reject(error));
+      });
+    },
+
+    addData: function (obsName, data, key = false, dbName = this.dbName) {
+      return new Promise((resolve, reject) => {
+        this.openDB(dbName).then(db => {
+          var obs = db.transaction(obsName, "readwrite").objectStore(obsName);
+          let addReq = (key ? obs.add(data, key) : obs.add(data));
+          addReq.onsuccess = (evt) => resolve(`Add data successful`);
+          addReq.onerror = (evt) => reject(
+            `Add data unsuccessful [${evt.target.error.name}] ${evt.target.error.message}`);
+          db.close();
+        }).catch(error => reject(error));
+      });
+    },
+
+    removeData: function (obsName, key, dbName = this.dbName) {
+      return new Promise((resolve, reject) => {
+        this.openDB(dbName).then(db => {
+          var obs = db.transaction(obsName, "readwrite").objectStore(obsName);
+          let delReq = obs.delete(key);
+          delReq.onsuccess = (evt) => resolve(`Removed Data ${key}`);
+          delReq.onerror = (evt) => reject(
+            `Remove data unsuccessful [${evt.target.error.name}] ${evt.target.error.message}`);
+          db.close();
+        }).catch(error => reject(error));
+      });
+    },
+
+    readData: function (obsName, key, dbName = this.dbName) {
+      return new Promise((resolve, reject) => {
+        this.openDB(dbName).then(db => {
+          var obs = db.transaction(obsName, "readonly").objectStore(obsName);
+          let getReq = obs.get(key);
+          getReq.onsuccess = (evt) => resolve(evt.target.result);
+          getReq.onerror = (evt) => reject(
+            `Read data unsuccessful [${evt.target.error.name}] ${evt.target.error.message}`);
+          db.close();
+        }).catch(error => reject(error));
+      });
+    },
+
+    readAllData: function (obsName, dbName = this.dbName) {
+      return new Promise((resolve, reject) => {
+        this.openDB(dbName).then(db => {
+          var obs = db.transaction(obsName, "readonly").objectStore(obsName);
+          var tmpResult = {}
+          let curReq = obs.openCursor();
+          curReq.onsuccess = (evt) => {
+            var cursor = evt.target.result;
+            if (cursor) {
+              tmpResult[cursor.primaryKey] = cursor.value;
+              cursor.continue();
+            } else
+              resolve(tmpResult);
+          }
+          curReq.onerror = (evt) => reject(
+            `Read-All data unsuccessful [${evt.target.error.name}] ${evt.target.error.message}`);
+          db.close();
+        }).catch(error => reject(error));
+      });
+    },
+
+    searchData: function (obsName, patternEval, dbName = this.dbName) {
+      return new Promise((resolve, reject) => {
+        this.openDB(dbName).then(db => {
+          var obs = db.transaction(obsName, "readonly").objectStore(obsName);
+          var filteredResult = {}
+          let curReq = obs.openCursor();
+          curReq.onsuccess = (evt) => {
+            var cursor = evt.target.result;
+            if (cursor) {
+              if (patternEval(cursor.primaryKey, cursor.value))
+                filteredResult[cursor.primaryKey] = cursor.value;
+              cursor.continue();
+            } else
+              resolve(filteredResult);
+          }
+          curReq.onerror = (evt) => reject(
+            `Search unsuccessful [${evt.target.error.name}] ${evt.target.error.message}`);
+          db.close();
+        }).catch(error => reject(error));
+      });
+    }
+  }
+</script>
+<script>
+  /*Kademlia DHT K-bucket implementation as a binary tree.*/
+
+  /**
+   * Implementation of a Kademlia DHT k-bucket used for storing
+   * contact (peer node) information.
+   *
+   * @extends EventEmitter
+   */
+  function BuildKBucket(options = {}) {
+    /**
+     * `options`:
+     *   `distance`: Function
+     *     `function (firstId, secondId) { return distance }` An optional
+     *     `distance` function that gets two `id` Uint8Arrays
+     *     and return distance (as number) between them.
+     *   `arbiter`: Function (Default: vectorClock arbiter)
+     *     `function (incumbent, candidate) { return contact; }` An optional
+     *     `arbiter` function that givent two `contact` objects with the same `id`
+     *     returns the desired object to be used for updating the k-bucket. For
+     *     more details, see [arbiter function](#arbiter-function).
+     *   `localNodeId`: Uint8Array An optional Uint8Array representing the local node id.
+     *     If not provided, a local node id will be created via `randomBytes(20)`.
+     *     `metadata`: Object (Default: {}) Optional satellite data to include
+     *     with the k-bucket. `metadata` property is guaranteed not be altered by,
+     *     it is provided as an explicit container for users of k-bucket to store
+     *     implementation-specific data.
+     *   `numberOfNodesPerKBucket`: Integer (Default: 20) The number of nodes
+     *     that a k-bucket can contain before being full or split.
+     *     `numberOfNodesToPing`: Integer (Default: 3) The number of nodes to
+     *     ping when a bucket that should not be split becomes full. KBucket will
+     *     emit a `ping` event that contains `numberOfNodesToPing` nodes that have
+     *     not been contacted the longest.
+     *
+     * @param {Object=} options optional
+     */
+
+    this.localNodeId = options.localNodeId || window.crypto.getRandomValues(new Uint8Array(20))
+    this.numberOfNodesPerKBucket = options.numberOfNodesPerKBucket || 20
+    this.numberOfNodesToPing = options.numberOfNodesToPing || 3
+    this.distance = options.distance || this.distance
+    // use an arbiter from options or vectorClock arbiter by default
+    this.arbiter = options.arbiter || this.arbiter
+    this.metadata = Object.assign({}, options.metadata)
+
+    this.createNode = function () {
+      return {
+        contacts: [],
+        dontSplit: false,
+        left: null,
+        right: null
+      }
+    }
+
+    this.ensureInt8 = function (name, val) {
+      if (!(val instanceof Uint8Array)) {
+        throw new TypeError(name + ' is not a Uint8Array')
+      }
+    }
+
+    /**
+     * @param  {Uint8Array} array1
+     * @param  {Uint8Array} array2
+     * @return {Boolean}
+     */
+    this.arrayEquals = function (array1, array2) {
+      if (array1 === array2) {
+        return true
+      }
+      if (array1.length !== array2.length) {
+        return false
+      }
+      for (let i = 0, length = array1.length; i < length; ++i) {
+        if (array1[i] !== array2[i]) {
+          return false
+        }
+      }
+      return true
+    }
+
+    this.ensureInt8('option.localNodeId as parameter 1', this.localNodeId)
+    this.root = this.createNode()
+
+    /**
+     * Default arbiter function for contacts with the same id. Uses
+     * contact.vectorClock to select which contact to update the k-bucket with.
+     * Contact with larger vectorClock field will be selected. If vectorClock is
+     * the same, candidat will be selected.
+     *
+     * @param  {Object} incumbent Contact currently stored in the k-bucket.
+     * @param  {Object} candidate Contact being added to the k-bucket.
+     * @return {Object}           Contact to updated the k-bucket with.
+     */
+    this.arbiter = function (incumbent, candidate) {
+      return incumbent.vectorClock > candidate.vectorClock ? incumbent : candidate
+    }
+
+    /**
+     * Default distance function. Finds the XOR
+     * distance between firstId and secondId.
+     *
+     * @param  {Uint8Array} firstId  Uint8Array containing first id.
+     * @param  {Uint8Array} secondId Uint8Array containing second id.
+     * @return {Number}              Integer The XOR distance between firstId
+     *                               and secondId.
+     */
+    this.distance = function (firstId, secondId) {
+      let distance = 0
+      let i = 0
+      const min = Math.min(firstId.length, secondId.length)
+      const max = Math.max(firstId.length, secondId.length)
+      for (; i < min; ++i) {
+        distance = distance * 256 + (firstId[i] ^ secondId[i])
+      }
+      for (; i < max; ++i) distance = distance * 256 + 255
+      return distance
+    }
+
+    /**
+     * Adds a contact to the k-bucket.
+     *
+     * @param {Object} contact the contact object to add
+     */
+    this.add = function (contact) {
+      this.ensureInt8('contact.id', (contact || {}).id)
+
+      let bitIndex = 0
+      let node = this.root
+
+      while (node.contacts === null) {
+        // this is not a leaf node but an inner node with 'low' and 'high'
+        // branches; we will check the appropriate bit of the identifier and
+        // delegate to the appropriate node for further processing
+        node = this._determineNode(node, contact.id, bitIndex++)
+      }
+
+      // check if the contact already exists
+      const index = this._indexOf(node, contact.id)
+      if (index >= 0) {
+        this._update(node, index, contact)
+        return this
+      }
+
+      if (node.contacts.length < this.numberOfNodesPerKBucket) {
+        node.contacts.push(contact)
+        return this
+      }
+
+      // the bucket is full
+      if (node.dontSplit) {
+        // we are not allowed to split the bucket
+        // we need to ping the first this.numberOfNodesToPing
+        // in order to determine if they are alive
+        // only if one of the pinged nodes does not respond, can the new contact
+        // be added (this prevents DoS flodding with new invalid contacts)
+        return this
+      }
+
+      this._split(node, bitIndex)
+      return this.add(contact)
+    }
+
+    /**
+     * Get the n closest contacts to the provided node id. "Closest" here means:
+     * closest according to the XOR metric of the contact node id.
+     *
+     * @param  {Uint8Array} id  Contact node id
+     * @param  {Number=} n      Integer (Default: Infinity) The maximum number of
+     *                          closest contacts to return
+     * @return {Array}          Array Maximum of n closest contacts to the node id
+     */
+    this.closest = function (id, n = Infinity) {
+      this.ensureInt8('id', id)
+
+      if ((!Number.isInteger(n) && n !== Infinity) || n <= 0) {
+        throw new TypeError('n is not positive number')
+      }
+
+      let contacts = []
+
+      for (let nodes = [this.root], bitIndex = 0; nodes.length > 0 && contacts.length < n;) {
+        const node = nodes.pop()
+        if (node.contacts === null) {
+          const detNode = this._determineNode(node, id, bitIndex++)
+          nodes.push(node.left === detNode ? node.right : node.left)
+          nodes.push(detNode)
+        } else {
+          contacts = contacts.concat(node.contacts)
+        }
+      }
+
+      return contacts
+        .map(a => [this.distance(a.id, id), a])
+        .sort((a, b) => a[0] - b[0])
+        .slice(0, n)
+        .map(a => a[1])
+    }
+
+    /**
+     * Counts the total number of contacts in the tree.
+     *
+     * @return {Number} The number of contacts held in the tree
+     */
+    this.count = function () {
+      // return this.toArray().length
+      let count = 0
+      for (const nodes = [this.root]; nodes.length > 0;) {
+        const node = nodes.pop()
+        if (node.contacts === null) nodes.push(node.right, node.left)
+        else count += node.contacts.length
+      }
+      return count
+    }
+
+    /**
+     * Determines whether the id at the bitIndex is 0 or 1.
+     * Return left leaf if `id` at `bitIndex` is 0, right leaf otherwise
+     *
+     * @param  {Object} node     internal object that has 2 leafs: left and right
+     * @param  {Uint8Array} id   Id to compare localNodeId with.
+     * @param  {Number} bitIndex Integer (Default: 0) The bit index to which bit
+     *                           to check in the id Uint8Array.
+     * @return {Object}          left leaf if id at bitIndex is 0, right leaf otherwise.
+     */
+    this._determineNode = function (node, id, bitIndex) {
+      // *NOTE* remember that id is a Uint8Array and has granularity of
+      // bytes (8 bits), whereas the bitIndex is the bit index (not byte)
+
+      // id's that are too short are put in low bucket (1 byte = 8 bits)
+      // (bitIndex >> 3) finds how many bytes the bitIndex describes
+      // bitIndex % 8 checks if we have extra bits beyond byte multiples
+      // if number of bytes is <= no. of bytes described by bitIndex and there
+      // are extra bits to consider, this means id has less bits than what
+      // bitIndex describes, id therefore is too short, and will be put in low
+      // bucket
+      const bytesDescribedByBitIndex = bitIndex >> 3
+      const bitIndexWithinByte = bitIndex % 8
+      if ((id.length <= bytesDescribedByBitIndex) && (bitIndexWithinByte !== 0)) {
+        return node.left
+      }
+
+      const byteUnderConsideration = id[bytesDescribedByBitIndex]
+
+      // byteUnderConsideration is an integer from 0 to 255 represented by 8 bits
+      // where 255 is 11111111 and 0 is 00000000
+      // in order to find out whether the bit at bitIndexWithinByte is set
+      // we construct (1 << (7 - bitIndexWithinByte)) which will consist
+      // of all bits being 0, with only one bit set to 1
+      // for example, if bitIndexWithinByte is 3, we will construct 00010000 by
+      // (1 << (7 - 3)) -> (1 << 4) -> 16
+      if (byteUnderConsideration & (1 << (7 - bitIndexWithinByte))) {
+        return node.right
+      }
+
+      return node.left
+    }
+
+    /**
+     * Get a contact by its exact ID.
+     * If this is a leaf, loop through the bucket contents and return the correct
+     * contact if we have it or null if not. If this is an inner node, determine
+     * which branch of the tree to traverse and repeat.
+     *
+     * @param  {Uint8Array} id The ID of the contact to fetch.
+     * @return {Object|Null}   The contact if available, otherwise null
+     */
+    this.get = function (id) {
+      this.ensureInt8('id', id)
+
+      let bitIndex = 0
+
+      let node = this.root
+      while (node.contacts === null) {
+        node = this._determineNode(node, id, bitIndex++)
+      }
+
+      // index of uses contact id for matching
+      const index = this._indexOf(node, id)
+      return index >= 0 ? node.contacts[index] : null
+    }
+
+    /**
+     * Returns the index of the contact with provided
+     * id if it exists, returns -1 otherwise.
+     *
+     * @param  {Object} node    internal object that has 2 leafs: left and right
+     * @param  {Uint8Array} id  Contact node id.
+     * @return {Number}         Integer Index of contact with provided id if it
+     *                          exists, -1 otherwise.
+     */
+    this._indexOf = function (node, id) {
+      for (let i = 0; i < node.contacts.length; ++i) {
+        if (this.arrayEquals(node.contacts[i].id, id)) return i
+      }
+
+      return -1
+    }
+
+    /**
+     * Removes contact with the provided id.
+     *
+     * @param  {Uint8Array} id The ID of the contact to remove.
+     * @return {Object}        The k-bucket itself.
+     */
+    this.remove = function (id) {
+      this.ensureInt8('the id as parameter 1', id)
+
+      let bitIndex = 0
+      let node = this.root
+
+      while (node.contacts === null) {
+        node = this._determineNode(node, id, bitIndex++)
+      }
+
+      const index = this._indexOf(node, id)
+      if (index >= 0) {
+        const contact = node.contacts.splice(index, 1)[0]
+      }
+
+      return this
+    }
+
+    /**
+     * Splits the node, redistributes contacts to the new nodes, and marks the
+     * node that was split as an inner node of the binary tree of nodes by
+     * setting this.root.contacts = null
+     *
+     * @param  {Object} node     node for splitting
+     * @param  {Number} bitIndex the bitIndex to which byte to check in the
+     *                           Uint8Array for navigating the binary tree
+     */
+    this._split = function (node, bitIndex) {
+      node.left = this.createNode()
+      node.right = this.createNode()
+
+      // redistribute existing contacts amongst the two newly created nodes
+      for (const contact of node.contacts) {
+        this._determineNode(node, contact.id, bitIndex).contacts.push(contact)
+      }
+
+      node.contacts = null // mark as inner tree node
+
+      // don't split the "far away" node
+      // we check where the local node would end up and mark the other one as
+      // "dontSplit" (i.e. "far away")
+      const detNode = this._determineNode(node, this.localNodeId, bitIndex)
+      const otherNode = node.left === detNode ? node.right : node.left
+      otherNode.dontSplit = true
+    }
+
+    /**
+     * Returns all the contacts contained in the tree as an array.
+     * If this is a leaf, return a copy of the bucket. `slice` is used so that we
+     * don't accidentally leak an internal reference out that might be
+     * accidentally misused. If this is not a leaf, return the union of the low
+     * and high branches (themselves also as arrays).
+     *
+     * @return {Array} All of the contacts in the tree, as an array
+     */
+    this.toArray = function () {
+      let result = []
+      for (const nodes = [this.root]; nodes.length > 0;) {
+        const node = nodes.pop()
+        if (node.contacts === null) nodes.push(node.right, node.left)
+        else result = result.concat(node.contacts)
+      }
+      return result
+    }
+
+    /**
+     * Updates the contact selected by the arbiter.
+     * If the selection is our old contact and the candidate is some new contact
+     * then the new contact is abandoned (not added).
+     * If the selection is our old contact and the candidate is our old contact
+     * then we are refreshing the contact and it is marked as most recently
+     * contacted (by being moved to the right/end of the bucket array).
+     * If the selection is our new contact, the old contact is removed and the new
+     * contact is marked as most recently contacted.
+     *
+     * @param  {Object} node    internal object that has 2 leafs: left and right
+     * @param  {Number} index   the index in the bucket where contact exists
+     *                          (index has already been computed in a previous
+     *                          calculation)
+     * @param  {Object} contact The contact object to update.
+     */
+    this._update = function (node, index, contact) {
+      // sanity check
+      if (!this.arrayEquals(node.contacts[index].id, contact.id)) {
+        throw new Error('wrong index for _update')
+      }
+
+      const incumbent = node.contacts[index]
+      const selection = this.arbiter(incumbent, contact)
+      // if the selection is our old contact and the candidate is some new
+      // contact, then there is nothing to do
+      if (selection === incumbent && incumbent !== contact) return
+
+      node.contacts.splice(index, 1) // remove old contact
+      node.contacts.push(selection) // add more recent contact version
+
+    }
+  }
+</script>
+<script>
+//For diff base
+    /*
+    Functions available:
+    diff(originalObj, updatedObj) returns the difference of the original and updated objects
+    addedDiff(original, updatedObj) returns only the values added to the updated object
+    deletedDiff(original, updatedObj) returns only the values deleted in the updated object
+    updatedDiff(original, updatedObj) returns only the values that have been changed in the updated object
+    detailedDiff(original, updatedObj) returns an object with the added, deleted and updated differences  
+    mergeRecurcive(original, diff) this will get you a new object that will merge all the changes between the old object and the new object
+    */
+    
+    const isDate = d => d instanceof Date;
+    const isEmpty = o => Object.keys(o).length === 0;
+    const isObject = o => o != null && typeof o === 'object';
+    const properObject = o => isObject(o) && !o.hasOwnProperty ? { ...o } : o;
+    
+    
+    const getLargerArray = (l, r) => l.length > r.length ? l : r;
+    
+    const preserve = (diff, left, right) => {
+    
+      if (!isObject(diff)) return diff;
+    
+      return Object.keys(diff).reduce((acc, key) => {
+    
+        const leftArray = left[key];
+        const rightArray = right[key];
+    
+        if (Array.isArray(leftArray) && Array.isArray(rightArray)) {
+          const array = [...getLargerArray(leftArray, rightArray)];
+          return {
+            ...acc,
+            [key]: array.reduce((acc2, item, index) => {
+              if (diff[key].hasOwnProperty(index)) {
+                acc2[index] = preserve(diff[key][index], leftArray[index], rightArray[index]); // diff recurse and check for nested arrays
+                return acc2;
+              }
+    
+              delete acc2[index]; // no diff aka empty
+              return acc2;
+            }, array)
+          };
+        }
+    
+        return {
+          ...acc,
+          [key]: diff[key]
+        };
+      }, {});
+    };
+    
+    
+    const updatedDiff = (lhs, rhs) => {
+    
+      if (lhs === rhs) return {};
+    
+      if (!isObject(lhs) || !isObject(rhs)) return rhs;
+    
+      const l = properObject(lhs);
+      const r = properObject(rhs);
+    
+      if (isDate(l) || isDate(r)) {
+        if (l.valueOf() == r.valueOf()) return {};
+        return r;
+      }
+    
+      return Object.keys(r).reduce((acc, key) => {
+    
+        if (l.hasOwnProperty(key)) {
+          const difference = updatedDiff(l[key], r[key]);
+    
+          if (isObject(difference) && isEmpty(difference) && !isDate(difference)) return acc;
+    
+          return { ...acc, [key]: difference };
+        }
+    
+        return acc;
+      }, {});
+    };
+    
+    
+    const diff = (lhs, rhs) => {
+      if (lhs === rhs) return {}; // equal return no diff
+    
+      if (!isObject(lhs) || !isObject(rhs)) return rhs; // return updated rhs
+    
+      const l = properObject(lhs);
+      const r = properObject(rhs);
+    
+      const deletedValues = Object.keys(l).reduce((acc, key) => {
+        return r.hasOwnProperty(key) ? acc : { ...acc, [key]: null };
+      }, {});
+    
+      if (isDate(l) || isDate(r)) {
+        if (l.valueOf() == r.valueOf()) return {};
+        return r;
+      }
+    
+      return Object.keys(r).reduce((acc, key) => {
+        if (!l.hasOwnProperty(key)) return { ...acc, [key]: r[key] }; // return added r key
+    
+        const difference = diff(l[key], r[key]);
+    
+        if (isObject(difference) && isEmpty(difference) && !isDate(difference)) return acc; // return no diff
+    
+        return { ...acc, [key]: difference }; // return updated key
+      }, deletedValues);
+    };
+    
+    const detailedDiff = (lhs, rhs) => ({
+      added: addedDiff(lhs, rhs),
+      deleted: deletedDiff(lhs, rhs),
+      updated: updatedDiff(lhs, rhs),
+    });
+    
+    
+    
+    const addedDiff = (lhs, rhs) => {
+    
+      if (lhs === rhs || !isObject(lhs) || !isObject(rhs)) return {};
+    
+      const l = properObject(lhs);
+      const r = properObject(rhs);
+    
+      return Object.keys(r).reduce((acc, key) => {
+        if (l.hasOwnProperty(key)) {
+          const difference = addedDiff(l[key], r[key]);
+    
+          if (isObject(difference) && isEmpty(difference)) return acc;
+    
+          return { ...acc, [key]: difference };
+        }
+    
+        return { ...acc, [key]: r[key] };
+      }, {});
+    };
+    
+    
+    const arrayDiff = (lhs, rhs) => {
+      if (lhs === rhs) return {}; // equal return no diff
+    
+      if (!isObject(lhs) || !isObject(rhs)) return rhs; // return updated rhs
+    
+      const l = properObject(lhs);
+      const r = properObject(rhs);
+    
+      const deletedValues = Object.keys(l).reduce((acc, key) => {
+        return r.hasOwnProperty(key) ? acc : { ...acc, [key]: null };
+      }, {});
+    
+      if (isDate(l) || isDate(r)) {
+        if (l.valueOf() == r.valueOf()) return {};
+        return r;
+      }
+    
+      if (Array.isArray(r) && Array.isArray(l)) {
+        const deletedValues = l.reduce((acc, item, index) => {
+          return r.hasOwnProperty(index) ? acc.concat(item) : acc.concat(null);
+        }, []);
+    
+        return r.reduce((acc, rightItem, index) => {
+          if (!deletedValues.hasOwnProperty(index)) {
+            return acc.concat(rightItem);
+          }
+    
+          const leftItem = l[index];
+          const difference = diff(rightItem, leftItem);
+    
+          if (isObject(difference) && isEmpty(difference) && !isDate(difference)) {
+            delete acc[index];
+            return acc; // return no diff
+          }
+    
+          return acc.slice(0, index).concat(rightItem).concat(acc.slice(index + 1)); // return updated key
+        }, deletedValues);
+      }
+    
+      return Object.keys(r).reduce((acc, key) => {
+        if (!l.hasOwnProperty(key)) return { ...acc, [key]: r[key] }; // return added r key
+    
+        const difference = diff(l[key], r[key]);
+    
+        if (isObject(difference) && isEmpty(difference) && !isDate(difference)) return acc; // return no diff
+    
+        return { ...acc, [key]: difference }; // return updated key
+      }, deletedValues);
+    };
+    
+    const deletedDiff = (lhs, rhs) => {
+      if (lhs === rhs || !isObject(lhs) || !isObject(rhs)) return {};
+    
+      const l = properObject(lhs);
+      const r = properObject(rhs);
+    
+      return Object.keys(l).reduce((acc, key) => {
+        if (r.hasOwnProperty(key)) {
+          const difference = deletedDiff(l[key], r[key]);
+    
+          if (isObject(difference) && isEmpty(difference)) return acc;
+    
+          return { ...acc, [key]: difference };
+        }
+    
+        return { ...acc, [key]: null };
+      }, {});
+    };
+    
+    function mergeRecursive(obj1, obj2) {
+        for (var p in obj2) {
+            try {
+                if(obj2[p].constructor == Object) {
+                    obj1[p] = mergeRecursive(obj1[p], obj2[p]);
+                }
+                // Property in destination object set; update its value.
+                else if (Ext.isArray(obj2[p])) {
+                    // obj1[p] = [];
+                    if (obj2[p].length < 1) {
+                        obj1[p] = obj2[p];
+                    }
+                    else {
+                        obj1[p] = mergeRecursive(obj1[p], obj2[p]);
+                    }
+    
+                }else{
+                    obj1[p] = obj2[p];
+                }
+            } catch (e) {
+                // Property in destination object not set; create it and set its value.
+                obj1[p] = obj2[p];
+            }
+        }
+        return obj1;
+    }
+    
+    /*
+    var test = {
+      foo : {
+        bar : {
+          baz : null
+        }
+      },
+      bar : 1
+    };
+    cleanse(test);
+    
+    Rohit: Added a small fix for object being entered as Array*/
+    
+    function cleanse(obj) {
+        console.log(obj)
+        Object.keys(obj).forEach(function(key) {
+            var value = obj[key];
+            if (typeof value === "object" && value !== null) {
+                // Recurse...
+                cleanse(value);
+                // ...and remove if now "empty" (NOTE: insert your definition of "empty" here)
+                if (!Object.keys(value).length) {
+                    delete obj[key]
+                }
+            }
+            else if (value === null) {
+                // null, remove it
+                delete obj[key];
+    
+            }
+        });
+    
+    if(obj.constructor.toString().indexOf("Array") != -1)  {obj = obj.filter(function (el) {
+      return el != null;
+    });}
+    
+    return obj; 
+    }
+    
+    /*obj is original object or array, diff is the output of detailedDiff */
+    function mergeAllDiff(obj,diff){
+      if(Object.keys(diff.updated).length !== 0)
+        obj = mergeRecursive(obj,diff.updated)
+      if(Object.keys(diff.deleted).length !== 0){
+        obj = mergeRecursive(obj,diff.deleted)
+        obj = cleanse(obj)
+      }
+      if(Object.keys(diff.added).length !== 0)
+        obj = mergeRecursive(obj,diff.added)
+        return obj
+    }
+</script>
+<script>
+    /* FLO Cloud operations to send/request application data*/
+    floCloudAPI = {
+        //send Any message to supernode cloud storage
+        sendApplicationData: function(message, type, options = {}){
+            return new Promise((resolve,reject) => {
+                var data = {
+                    senderID : myFloID,
+                    receiverID: options.receiverID || floGlobals.adminID,
+                    pubKey : myPubKey,
+                    message : message,
+                    sign: floCrypto.signData(JSON.stringify(message), myPrivKey),
+                    application : options.application || floGlobals.application,
+                    type: type,
+                    comment: options.comment || ""
+                }
+                floSupernode.sendData(JSON.stringify(data), data.receiverID)
+                    .then(result => resolve(result))
+                    .catch(error => reject(error))
+            })
+        },
+
+        //request any data from supernode cloud
+        requestApplicationData: function(options = {}){
+            return new Promise((resolve,reject) => {
+                var request = {
+                    receiverID: options.receiverID || floGlobals.adminID,
+                    senderIDs: options.senderIDs || undefined,
+                    application: options.application || floGlobals.application,
+                    type: options.type || undefined,
+                    comment: options.comment || undefined,
+                    lowerVectorClock: options.lowerVectorClock || undefined,
+                    upperVectorClock: options.upperVectorClock || undefined,
+                    atVectorClock: options.atVectorClock || undefined,
+                    mostRecent: options.mostRecent || undefined,
+                }
+                floSupernode.requestData(JSON.stringify(request), request.receiverID)
+                    .then(response => resolve(response))
+                    .catch(error => reject(error))
+            })
+        },
+
+        //request an object data from supernode cloud
+        requestObjectData: function(objectName, options = {}){
+            var request = {
+                receiverID: options.receiverID || floGlobals.adminID,
+                senderIDs: (options.senderIDs === false) ? false: options.senderIDs || floGlobals.subAdmins,
+                application: options.application || floGlobals.application,
+                type: `${objectName}@Reset`,
+                lowerVectorClock: floGlobals.vectorClock[objectName]+1,
+                mostRecent: true
+            }
+            floSupernode.requestData(JSON.stringify(request),request.receiverID).then(resetData => {
+                reactor.dispatchEvent('resetData', resetData);
+                request.type = `${objectName}@Update`
+                request.lowerVectorClock = floGlobals.vectorClock[objectName]+1
+                request.mostRecent = false
+                floSupernode.requestData(JSON.stringify(request), request.receiverID)
+                    .then(updateData => reactor.dispatchEvent('updateData', updateData))
+            }).catch(error => reactor.dispatchEvent('errorHandle', error))
+        },
+
+        //reset or initialize an object and send it to cloud
+        resetObjectData: function(newObject, objectName, options = {}){
+            var message = {
+                division: options.division || floGlobals.division, 
+                object: objectName, 
+                vectorClock: floGlobals.vectorClock[objectName], 
+                reset: newObject
+            }
+            this.sendApplicationData(message, `${objectName}@Reset`, options)
+                .then(result => reactor.dispatchEvent('logHandle',result))
+                .catch(error => reactor.dispatchEvent('errorHandle',error))
+        },
+
+        //update the diff and send it to cloud
+        updateObjectData: function(oldObject, newObject, objectName, options = {}){
+            var message = {
+                division: options.division || floGlobals.division,
+                object: objectName, 
+                vectorClock: floGlobals.vectorClock[objectName],
+                diff: detailedDiff(oldObject, newObject)
+            }
+            this.sendApplicationData(message, `${objectName}@Update`, options)
+                .then(result => reactor.dispatchEvent('logHandle',result))
+                .catch(error => reactor.dispatchEvent('errorHandle',error))
+        }
+    }
+
+    reactor.registerEvent('resetData');
+    reactor.addEventListener('resetData', function(dataSet){
+        try{
+            dataSet = JSON.parse(dataSet);
+            console.log(dataSet)
+            for(vc in dataSet){
+                //if(floGlobals.subAdmins.includes(dataSet[vc].senderID)){
+                    var message = dataSet[vc].message;
+                    if(message.reset){
+                        floGlobals.appObjects[message.object] = message.reset
+                        floGlobals.vectorClock[message.object] = vc
+                        compactIDB.writeData("appObjects", floGlobals.appObjects[message.object], message.object)
+                        compactIDB.writeData("vectorClocks", vc, message.object)
+                    }
+                //}
+            }
+        }catch(error){
+            console.log(error)
+        }
+    });
+
+    reactor.registerEvent('updateData');
+    reactor.addEventListener('updateData', function(dataSet){
+        try{
+            dataSet = JSON.parse(dataSet);
+            console.log(dataSet)
+            for(vc in dataSet){
+                //if(floGlobals.subAdmins.includes(dataSet[vc].senderID)){
+                    var message = dataSet[vc].message;
+                    if(message.diff){
+                        floGlobals.appObjects[message.object] = mergeAllDiff(floGlobals.appObjects[message.object], message.diff)
+                        compactIDB.writeData("appObjects",floGlobals.appObjects[message.object], message.object)
+                    }
+                //}
+                floGlobals.vectorClock[message.object] = vc
+                compactIDB.writeData("vectorClocks", vc, message.object)
+            }
+        }catch(error){
+            console.log(error)
+        }
+    });
+
+    reactor.registerEvent('errorHandle');
+    reactor.addEventListener('errorHandle', function(event){
+        console.log(event)
+    });
+    reactor.registerEvent('logHandle');
+    reactor.addEventListener('logHandle', function(event){
+        console.log(event)
+    });
+</script>
+
+<script>
+    function onLoadStartUp() {
+        initIndexedDB().then(result => {
+            console.log(result)
+            getCredentials().then(result => {
+                console.log(result)
+                alert(`FLO_ID: ${myFloID}`)
+                readSubAdminListFromAPI().then(result => {
+                    console.log(result)
+                    readSupernodeListFromAPI().then(result => {
+                        console.log(result)
+                        floSupernode.kBucket.launch(Object.keys(floGlobals.supernodes),floGlobals.SNStorageID).then(result => {
+                            console.log(result)
+                            loadObjectsFromIDB().then(result => {
+                                console.log(result)
+                                cloudArticleApp.retrieveLatestContent();
+                            }).catch(error => console.log(error))
+                        }).catch(error => console.log(error))
+                    }).catch(error => console.log(error))
+                }).catch(error => console.log(error))
+            }).catch(error => console.log(error))
+        }).catch(error => console.log(error))
+    }
+
+    function initIndexedDB(){
+        return new Promise((resolve, reject) => {
+            var storageList = floGlobals.storageList;
+            var obj = {
+                lastTx:{},
+                supernodes:{
+                    indexes:{ uri:null, pubKey:null }
+                },
+                subAdmins:{},
+                credentials:{},
+                //any other objectstores if needed
+                appObjects:{},
+                vectorClocks:{}
+            }
+            compactIDB.initDB(floGlobals.application, obj)
+                .then(result => resolve("Initiated supernode storage"))
+                .catch(error => reject(error));
+        })
+    }
+
+    function readSupernodeListFromAPI(){
+        return new Promise((resolve,reject) => {
+            compactIDB.readData("lastTx",floGlobals.SNStorageID).then(lastTx => {
+                floBlockchainAPI.readData(floGlobals.SNStorageID,{ignoreOld:lastTx,sentOnly:true,pattern:"SuperNodeStorage"}).then(result => {
+                    for(var i=result.data.length-1;i>=0;i--){
+                        var content = JSON.parse(result.data[i]).SuperNodeStorage;
+                        for(sn in content.removeNodes)
+                            compactIDB.removeData("supernodes",sn);
+                        for(sn in content.addNodes)
+                            compactIDB.writeData("supernodes",content.addNodes[sn],sn);
+                    }
+                    compactIDB.writeData("lastTx",result.totalTxs,floGlobals.SNStorageID);
+                    compactIDB.readAllData("supernodes").then(result => {
+                        floGlobals.supernodes = result;
+                        resolve("Read supernode from blockchain");                    
+                    })
+                })
+            }).catch(error => reject(error))
+        })
+    }
+
+    function readSubAdminListFromAPI(){
+        return new Promise((resolve,reject) => {
+            compactIDB.readData("lastTx",floGlobals.adminID).then(lastTx => {
+                floBlockchainAPI.readData(floGlobals.adminID,{ignoreOld:lastTx,sentOnly:true,pattern:floGlobals.application}).then(result => {
+                    for(var i=result.data.length-1;i>=0;i--){
+                        var content = JSON.parse(result.data[i])[floGlobals.application];
+                        if(Array.isArray(content.removeSubAdmin))
+                            for(var j = 0; j < content.removeSubAdmin.length; j++)
+                                compactIDB.removeData("subAdmins",content.removeSubAdmin[j]);
+                        if(Array.isArray(content.addSubAdmin))
+                            for(var k = 0; k < content.addSubAdmin.length; k++)
+                                compactIDB.writeData("subAdmins",true,content.addSubAdmin[k]);
+                    }
+                    compactIDB.writeData("lastTx",result.totalTxs,floGlobals.adminID);
+                    compactIDB.readAllData("subAdmins").then(result => {
+                        floGlobals.subAdmins = Object.keys(result);
+                        resolve("Read subAdmins from blockchain");                    
+                    })
+                })
+            }).catch(error => reject(error))
+        })
+    }
+
+    function loadObjectsFromIDB(){
+        return new Promise((resolve,reject) => {
+            var promise1 = compactIDB.readAllData("appObjects")
+            var promise2 = compactIDB.readAllData("vectorClocks")
+            Promise.all([promise1,promise2]).then(results => {
+                floGlobals.appObjects = results[0]
+                floGlobals.vectorClock = results[1]
+                resolve("Loaded appObjects and vectorClocks from IDB")
+            }).catch(error => reject(error))
+        })
+    }
+
+    function getCredentials(){
+        return new Promise((resolve, reject) => {
+            getPrivateKeyCredentials().then(privKey => {
+                myPrivKey = privKey
+                myPubKey = floCrypto.getPubKeyHex(myPrivKey)
+                myFloID = floCrypto.getFloIDfromPubkeyHex(myPubKey)
+                resolve('Login Credentials loaded successful')
+            }).catch(error => reject(error))
+        })
+    }
+
+    function getPrivateKeyCredentials(){
+        return new Promise((resolve, reject) => {
+            var indexArr = localStorage.getItem("privKey")
+            if(indexArr){
+                readSharesFromIDB(JSON.parse(indexArr))
+                    .then(result => resolve(result))
+                    .catch(error => reject(error))
+            }else{
+                try{
+                    var privKey = prompt("Enter Private Key: ")
+                    if(!privKey)
+                        return reject("Empty Private Key")
+                    var floID = floCrypto.getFloIDfromPubkeyHex(floCrypto.getPubKeyHex(privKey))
+                    console.log(floID)
+                }catch(error){
+                    console.log(error)
+                    return reject("Invalid Private Key")
+                }
+                var threshold = floCrypto.randInt(10,20)
+                writeSharesToIDB(floCrypto.createShamirsSecretShares(privKey, threshold, threshold)).then(resultIndexes =>{
+                    //store index keys in localStorage
+                    console.log(resultIndexes)
+                    localStorage.setItem("privKey", JSON.stringify(resultIndexes))
+                    //also add a dummy privatekey to the IDB
+                    var randomPrivKey = floCrypto.generateNewID().privKey
+                    var randomThreshold = floCrypto.randInt(10,20)
+                    writeSharesToIDB(floCrypto.createShamirsSecretShares(randomPrivKey, randomThreshold, randomThreshold))
+                    //resolve private Key
+                    resolve(privKey)
+                }).catch(error => reject(error))
+            }
+        })
+    }
+
+    function readSharesFromIDB(indexArr){
+        return new Promise((resolve, reject) => {
+            var promises = []
+            for(var i = 0; i < indexArr.length; i++)
+                promises.push(compactIDB.readData('credentials', indexArr[i]))
+            Promise.all(promises).then(shares => {
+                var secret = floCrypto.retrieveShamirSecret(shares)
+                if(secret)
+                    resolve(secret)
+                else
+                    reject("Shares are insufficient or incorrect")
+            }).catch(error => reject(error))
+        })
+    }
+
+    function writeSharesToIDB(shares, i = 0, resultIndexes = []){
+        return new Promise((resolve, reject) => {
+            if(i >= shares.length)
+                return resolve(resultIndexes)
+            var n = floCrypto.randInt(0, 100000)
+            compactIDB.addData("credentials", shares[i], n).then(res => {
+                resultIndexes.push(n)
+                writeSharesToIDB(shares, i+1, resultIndexes)
+                    .then(result => resolve(result))
+            }).catch(error => {
+                writeSharesToIDB(shares, i, resultIndexes)
+                    .then(result => resolve(result))
+            })
+        }) 
+    }
+
+    function clearCredentials(type = 'Both'){
+        if(type === 'Both')
+            return clearCredentials('privKey') + clearCredentials('serverPass')
+        else if(type === 'privKey' || type === 'serverPass'){
+            var indexArr = localStorage.getItem(type)
+            if(!indexArr)
+                return `${type} credentials not found!\n`
+            indexArr = JSON.parse(indexArr)
+            indexArr.forEach(i => compactIDB.removeData('credentials', indexArr[i]))
+            localStorage.removeItem(type)
+            return `${type} credentials deleted!\n`
+        }
+    }
+</script>
+
+<script src="https://code.jquery.com/jquery-3.3.1.slim.min.js" integrity="sha384-q8i/X+965DzO0rT7abK41JStQIAqVgRVzpbzo5smXKp4YfRvH+8abtTE1Pi6jizo" crossorigin="anonymous"></script>
+<script src="https://cdnjs.cloudflare.com/ajax/libs/popper.js/1.14.3/umd/popper.min.js" integrity="sha384-ZMP7rVo3mIykV+2+9J3UJ46jBk0WLaUAdn689aCwoqbBJiSnjAK/l8WvCWPIPm49" crossorigin="anonymous"></script>
+<script src="https://stackpath.bootstrapcdn.com/bootstrap/4.1.3/js/bootstrap.min.js" integrity="sha384-ChfqqxuZUCnJSK3+MXmPNIyE6ZbWh2IMqE241rYiqJxyMiZ6OW/JmZQ5stwEULTy" crossorigin="anonymous"></script>
+
+<script>
+    
+    const cloudArticleApp = {
+
+        SUBJECT: "testArticle",
+
+        numberOfSections: 5,
+
+        delay: (t, v) => {
+          return new Promise(function(resolve) {
+            setTimeout(resolve.bind(null, v), t);
+          });
+        },
+
+        // Create unique id
+        unique_id: function() {
+          return `${+new Date()}_${Math.random()
+            .toString(36)
+            .substr(2, 9)}`;
+        },
+
+        showFullContentOfArticle: function(obj) {
+            let full_data_div = document.getElementById('current_data');
+            let full_article_div = document.getElementById('full_article_div');
+            const articleSubject = floGlobals.appObjects[this.SUBJECT]; 
+            let t = ``;
+
+            for(key in obj) {
+                if (Object.keys(articleSubject).includes(key)) {
+                    t += `<h4 class="card text-center margin-15 padding-8">${key}</h4>`;
+                }
+
+                for(secKey in articleSubject[key]) {
+                    const secObject = articleSubject[key][secKey];
+                    // Sort by score
+                    let secObj = Object.values(secObject).sort((a,b)=>b.score-a.score);
+
+                    t += `<div id="paginated_gallery" class="gallery">
+                        <div class="gallery_scroller">`;
+                    
+                    for(iterKey in secObj) {
+                        const article_data = secObj[iterKey];
+                        const gen_div_id = this.unique_id();
+                        const content_hash = Crypto.SHA256(article_data.content);
+                        t += 
+                            `<div class="card colored_card">
+                              <div class="card-header">
+                                Author Id: ${article_data.content_creator}
+                              </div>
+                              <div class="card-body set-flex">
+                              <div class="card-text content_div" id="${gen_div_id}" data-value="${key}__${secKey}" contenteditable="true" onfocusout="cloudArticleApp.edit_onfocuout()">
+                                ${article_data.content}
+                              </div>
+                              <input type="hidden" id="hash_${gen_div_id}" value="${content_hash}">
+                            </div>
+                            <div class="card-footer">
+                              <small class="text-muted">Section: ${secKey} </small>
+                              <small class="text-muted float-right">SCORE: ${article_data.score}</small>
+                            </div>
+                          </div>`;
+                    }         
+                    t += `</div>
+                      <span class="btn prev"></span>
+                      <span class="btn next"></span></div>`;
+                }
+                
+            }
+            full_data_div.innerHTML = t;
+
+            const gallery = document.querySelector('#paginated_gallery');
+            const gallery_scroller = gallery.querySelector('.gallery_scroller');
+            const gallery_item_size = gallery_scroller.querySelector('div').clientWidth;
+
+            gallery.querySelector('.btn.next').addEventListener('click', scrollToNextPage);
+            gallery.querySelector('.btn.prev').addEventListener('click', scrollToPrevPage);
+
+            // For paginated scrolling, simply scroll the gallery one item in the given
+            // direction and let css scroll snaping handle the specific alignment.
+            function scrollToNextPage() {
+              gallery_scroller.scrollBy(gallery_item_size, 0);
+            }
+            function scrollToPrevPage() {
+              gallery_scroller.scrollBy(-gallery_item_size, 0);
+            }
+
+        },
+
+        retrieveLatestContent: async function(receiverID=floGlobals.adminID, senderIDs=false) {
+            floCloudAPI.requestObjectData(this.SUBJECT,{receiverID, senderIDs});
+            await this.delay(5000);
+            document.getElementById('current_data').innerHTML = '';
+            this.showFullContentOfArticle(floGlobals.appObjects[this.SUBJECT]);
+        },
+
+        createNewArticle: function(article_name, div='', number_of_sections=cloudArticleApp.numberOfSections) {
+            new_article = {};
+            new_article[article_name] = {};
+            for (let j=0; j<number_of_sections; j++) {
+                i = j+1;
+                let content = '';
+                if(div=='reset_data_div') {
+                    content = document.getElementById(`article_content${i}`).value;
+                    new_article[article_name][`section${i}`] = {};
+                    new_article[article_name][`section${i}`]["iteration0"] = {
+                        content: content,
+                        content_creator: myFloID,
+                        score: 0
+                    }
+                } else if(div=='update_data_div') {
+                    content = document.getElementById(`article_content_up`).value;
+                    new_article[article_name][`section${i}`] = {};
+                    if(i!==1) {
+                        content = '';
+                    }
+                    new_article[article_name][`section${i}`]["iteration0"] = {
+                        content: content,
+                        content_creator: myFloID,
+                        score: 0
+                    }
+                } else {
+                    console.error('errror');
+                }
+                    
+            }
+            return new_article;
+        },
+
+        resetArticleContent: function() {
+            const article_name = document.getElementById('article_name').value;
+            let number_of_sections = document.getElementById('num_sections').value;
+            number_of_sections = Number(number_of_sections);
+            if(number_of_sections<1) throw new Error('Error: Number of sections must be more than 0.');
+            let new_article = this.createNewArticle(article_name, 'reset_data_div', num_sections);
+            floCloudAPI.resetObjectData(new_article, this.SUBJECT,
+            {receiverID:floGlobals.adminID});
+
+            this.retrieveLatestContent(); 
+
+            return true;    
+        }, 
+
+        addArticleContent: function(article_name="", section="", newcontent="") {
+            this.retrieveLatestContent();  
+            let full_data =  Object.assign({}, floGlobals.appObjects[this.SUBJECT]);
+            let article = full_data[article_name];
+            //if(typeof article!=="object") throw new Error("Error: No such article found.");
+            //if(typeof article[section]!=="object") throw new Error("Error: No such section found.");
+
+            if(typeof article!=="object") {
+                make_article=this.createNewArticle(article_name, 'update_data_div');
+                full_data[article_name] = make_article[article_name];
+                article = full_data[article_name];
+            }
+
+            let iterNumber = Object.keys(article[section]).map(f=>{
+                return f.match(/\d+/)[0];
+            }).reduce(function(prev, current) {
+                return (prev.y > current.y) ? prev : current
+            });
+
+            let oldArticle = article[section][`iteration${iterNumber}`];
+            let iterNum = Number(iterNumber)+1;
+            article[section][`iteration${iterNum}`] = {
+                content: newcontent,
+                content_creator: myFloID,
+                score: Math.floor((Math.random() * 10) + 1)
+            };
+
+            console.log(floGlobals.appObjects[this.SUBJECT]);
+            console.log(full_data);
+
+            floCloudAPI.updateObjectData(floGlobals.appObjects[this.SUBJECT], full_data, this.SUBJECT); 
+
+            this.retrieveLatestContent(); 
+        },
+
+        getEventTarget: function(e) {
+            e = e || window.event; // for browsers compatibility
+            return e.target || e.srcElement;
+        },
+
+        edit_onfocuout: function(event) {
+            let target = this.getEventTarget(event);
+            const updated_content = target.innerText;   
+            const updated_content_hash = Crypto.SHA256(updated_content);
+            let editable_div = document.getElementsByClassName('content_div');
+            let _id = target.id;
+            let previous_content_hash = document.getElementById(`hash_${_id}`).value;
+            if(previous_content_hash===updated_content_hash) return;
+            let detail_block = document.getElementById(_id).getAttribute('data-value');
+            let separate_data = detail_block.trim().split('__');
+            if(separate_data.length!==2) return;
+
+            cloudArticleApp.addArticleContent(separate_data[0].trim(), separate_data[1].trim(), updated_content);
+        },
+
+    }
+
+    function contentSettings(content_name="", content_sections=5) {
+      return {
+        getContentName: function() {
+          return content_name;
+        },
+        setContentName: function(name) {
+            content_name = name;
+        },
+        getNumberOfSections: function() {
+          return content_sections;
+        },
+        setNumberOfSections: function(num) {
+            content_sections = num;
+        },
+      };
+    }
+ </script>
+
+ <script>
+    (function() {
+        //const SUBJECT = "testArticle";
+        const reset_data_btn = document.getElementById('reset_data_btn');
+        reset_data_btn.onclick = function() {
+            cloudArticleApp.resetArticleContent();
+        }
+    })();
+ </script>
+
+
+</body>
+</html>
+
