diff --git a/css/main.css b/css/main.css
index c62843d..0e9939e 100644
--- a/css/main.css
+++ b/css/main.css
@@ -1,4 +1,3 @@
-@charset "UTF-8";
 * {
   padding: 0;
   margin: 0;
@@ -43,7 +42,7 @@ body[data-theme=dark] * {
   --background-color: 10, 10, 10;
   --foreground-color: rgb(20, 20, 20);
   --danger-color: rgb(255, 106, 106);
-  --green: #00E676;
+  --green: #00e676;
   --yellow: #ffd13a;
 }
 
@@ -483,7 +482,7 @@ details[open] > summary .icon {
 
 #sign_up sm-copy {
   font-size: 0.9rem;
-  --button-border-radius: 0.5rem ;
+  --button-border-radius: 0.5rem;
 }
 #sign_up .h2 {
   margin-bottom: 0.5rem;
@@ -934,17 +933,8 @@ details[open] > summary .icon {
   font-size: 1.8rem;
   font-weight: 700;
 }
-#transaction_detail__amount::before,
-#account_detail__amount::before {
-  font-weight: 500;
-  font-size: 1rem;
-  -ms-flex-item-align: start;
-      align-self: flex-start;
-  content: "₹";
-}
 
-#transaction_detail__time,
-#account_detail__time {
+#transaction_detail__time {
   font-size: 0.8rem;
   color: rgba(var(--text-color), 0.8);
   margin-right: 1rem;
@@ -957,21 +947,25 @@ details[open] > summary .icon {
   gap: 2rem;
 }
 
-#account_process__type {
-  margin-top: 1.5rem;
-  font-size: 0.9rem;
-  font-weight: 500;
-  color: rgba(var(--text-color), 0.8);
-}
-
-#account_process__amount {
-  font-size: 1.5rem;
-}
-
 .account-step {
+  opacity: 0;
   grid-template-columns: auto minmax(0, 1fr);
-  grid-template-areas: "step-icon step-title" "step-icon step-description";
+  grid-template-areas: "step-icon step-title" ". step-description";
   gap: 0.3rem 0.8rem;
+  -webkit-animation: slide-down 0.3s forwards;
+          animation: slide-down 0.3s forwards;
+}
+.account-step:nth-of-type(2) {
+  -webkit-animation-delay: 0.1s;
+          animation-delay: 0.1s;
+}
+.account-step:nth-of-type(3) {
+  -webkit-animation-delay: 0.2s;
+          animation-delay: 0.2s;
+}
+.account-step:nth-of-type(4) {
+  -webkit-animation-delay: 0.3s;
+          animation-delay: 0.3s;
 }
 .account-step sm-spinner {
   --height: 1rem;
@@ -994,6 +988,7 @@ details[open] > summary .icon {
   width: 1.5rem;
 }
 .account-step:not(.loading) .step__title {
+  text-transform: capitalize;
   grid-area: step-title;
   font-weight: 500;
   font-size: 0.9rem;
@@ -1066,6 +1061,10 @@ details[open] > summary .icon {
 #account_action_button {
     margin-top: auto;
   }
+
+  #account_process {
+    margin-top: 3rem;
+  }
 }
 @media screen and (min-width: 640px) {
   #confirmation_popup,
@@ -1120,7 +1119,8 @@ details[open] > summary .icon {
   }
 
   #transaction_top,
-#account_top {
+#account_top,
+#account_process {
     overflow: hidden;
     padding: 1.8rem;
     border-radius: 0.5rem;
@@ -1170,6 +1170,7 @@ details[open] > summary .icon {
   #transaction section,
 #account_details {
     display: grid;
+    gap: 1.5rem;
     grid-template-columns: 18rem minmax(0, 1fr);
   }
 }
diff --git a/css/main.min.css b/css/main.min.css
index 83a7161..86b84c1 100644
--- a/css/main.min.css
+++ b/css/main.min.css
@@ -1 +1 @@
-*{padding:0;margin:0;-webkit-box-sizing:border-box;box-sizing:border-box;font-family:"Roboto",sans-serif}:root{font-size:clamp(1rem, 1.2vmax, 3rem)}html,body{height:100%;scroll-behavior:smooth}body{color:rgba(var(--text-color), 1);background:rgba(var(--background-color), 1)}body,body *{--accent-color: #2672ff;--accent-color--light: rgba(38, 114, 255, 0.06);--text-color: 36, 36, 36;--background-color: 247, 250, 255;--foreground-color: rgb(250, 252, 255);--danger-color: rgb(255, 75, 75);--green: #1cad59;--yellow: #f3a600;scrollbar-width:thin}body[data-theme=dark],body[data-theme=dark] *{--accent-color: rgb(170, 190, 255);--accent-color--light: rgba(231, 239, 255, 0.06);--text-color: 230, 230, 230;--text-color-light: 170, 170, 170;--background-color: 10, 10, 10;--foreground-color: rgb(20, 20, 20);--danger-color: rgb(255, 106, 106);--green: #00E676;--yellow: #ffd13a}p{font-size:.9rem;max-width:70ch;line-height:1.7;color:rgba(var(--text-color), 0.8)}p:not(:last-of-type){margin-bottom:1.5rem}a:where([class]){color:inherit;text-decoration:none}a:where([class]):focus-visible{-webkit-box-shadow:0 0 0 .1rem rgba(var(--text-color), 1) inset;box-shadow:0 0 0 .1rem rgba(var(--text-color), 1) inset}a{color:var(--accent-color)}button,.button{-webkit-user-select:none;-moz-user-select:none;-ms-user-select:none;user-select:none;position:relative;display:-webkit-inline-box;display:-ms-inline-flexbox;display:inline-flex;border:none;background-color:transparent;overflow:hidden;color:inherit;cursor:pointer;-webkit-transition:-webkit-transform .3s;transition:-webkit-transform .3s;transition:transform .3s;transition:transform .3s, -webkit-transform .3s}.button{padding:.4rem .6rem;border-radius:.3rem;font-weight:500;font-size:.8rem;border:solid thin rgba(var(--text-color), 0.5)}button:disabled{opacity:.5}a:-webkit-any-link:focus-visible{outline:rgba(var(--text-color), 1) .1rem solid}a:-moz-any-link:focus-visible{outline:rgba(var(--text-color), 1) .1rem solid}a:any-link:focus-visible{outline:rgba(var(--text-color), 1) .1rem solid}sm-button{--border-radius: 0.5rem;--padding: 0.8rem 1rem}sm-button[variant=primary] .icon{fill:rgba(var(--background-color), 1)}sm-button[disabled] .icon{fill:rgba(var(--text-color), 0.6)}ul{list-style:none}.flex{display:-webkit-box;display:-ms-flexbox;display:flex}.grid{display:grid}.hide{opacity:0;pointer-events:none}.hide-completely{display:none !important}.no-transformations{-webkit-transform:none !important;transform:none !important}.overflow-ellipsis{width:100%;overflow:hidden;white-space:nowrap;text-overflow:ellipsis}.breakable{overflow-wrap:break-word;word-wrap:break-word;-ms-word-break:break-all;word-break:break-word;-ms-hyphens:auto;-webkit-hyphens:auto;hyphens:auto}.full-bleed{grid-column:1/4}.h1{font-size:2.5rem}.h2{font-size:2rem}.h3{font-size:1.4rem}.h4{font-size:1rem}.h5{font-size:.8rem}.uppercase{text-transform:uppercase}.capitalize{text-transform:capitalize}.flex{display:-webkit-box;display:-ms-flexbox;display:flex}.grid{display:grid}.grid-3{grid-template-columns:1fr auto auto}.flow-column{grid-auto-flow:column}.gap-0-5{gap:.5rem}.gap-1{gap:1rem}.gap-1-5{gap:1.5rem}.gap-2{gap:2rem}.gap-3{gap:3rem}.text-align-right{text-align:right}.align-start{-webkit-box-align:start;-ms-flex-align:start;align-items:flex-start}.align-center{-webkit-box-align:center;-ms-flex-align:center;align-items:center}.text-center{text-align:center}.justify-start{-webkit-box-pack:start;-ms-flex-pack:start;justify-content:start}.justify-center{-webkit-box-pack:center;-ms-flex-pack:center;justify-content:center}.justify-right{margin-left:auto}.align-self-center{-ms-flex-item-align:center;align-self:center}.justify-self-center{justify-self:center}.justify-self-start{justify-self:start}.justify-self-end{justify-self:end}.direction-column{-webkit-box-orient:vertical;-webkit-box-direction:normal;-ms-flex-direction:column;flex-direction:column}.space-between{-webkit-box-pack:justify;-ms-flex-pack:justify;justify-content:space-between}.stretch{-webkit-box-pack:stretch;-ms-flex-pack:stretch;justify-content:stretch;justify-items:stretch}.stretch>*{width:100%}.ripple{position:absolute;border-radius:50%;-webkit-transform:scale(0);transform:scale(0);background:rgba(var(--text-color), 0.16);pointer-events:none}.interact{position:relative;cursor:pointer;-webkit-transition:-webkit-transform .3s;transition:-webkit-transform .3s;transition:transform .3s;transition:transform .3s, -webkit-transform .3s;-webkit-tap-highlight-color:transparent}.observe-empty-state:empty{display:none}.observe-empty-state:not(:empty)~.empty-state{display:none}.icon{width:1.2rem;height:1.2rem;fill:rgba(var(--text-color), 0.8)}.button__icon{height:1.2rem;width:1.2rem}.button__icon--left{margin-right:.5rem}.button__icon--right{margin-left:.5rem}.icon-button{padding:.6rem;border-radius:.8rem;background-color:var(--accent-color--light)}.icon-button .icon{fill:var(--accent-color)}#confirmation_popup,#prompt_popup{-webkit-box-orient:vertical;-webkit-box-direction:normal;-ms-flex-direction:column;flex-direction:column}#confirmation_popup h4,#prompt_popup h4{font-weight:500;margin-bottom:.5rem}#confirmation_popup sm-button,#prompt_popup sm-button{margin:0}#confirmation_popup .flex,#prompt_popup .flex{padding:0;margin-top:1rem}#confirmation_popup .flex sm-button:first-of-type,#prompt_popup .flex sm-button:first-of-type{margin-right:.6rem;margin-left:auto}button:active,.button:active,.interact:active,.nav-item:active{-webkit-transform:scale(0.96);transform:scale(0.96)}#main_page{padding:1.5rem}#main_page>section:nth-of-type(1){-ms-flex-line-pack:start;align-content:flex-start}#logo{display:grid;-webkit-box-align:center;-ms-flex-align:center;align-items:center;width:100%;grid-template-columns:auto 1fr;gap:0 .3rem;margin-right:1rem}#logo h4{text-transform:capitalize;font-size:1rem;font-weight:600}#logo #main_logo{height:1.4rem;width:1.4rem;fill:rgba(var(--text-color), 1);stroke:none}details summary{-webkit-user-select:none;-moz-user-select:none;-ms-user-select:none;user-select:none;cursor:pointer}details[open]>summary{margin-bottom:1rem}details[open]>summary .icon{-webkit-transform:rotate(180deg);transform:rotate(180deg)}.card{padding:1rem;border-radius:.5rem;background-color:var(--accent-color--light)}.page-layout{display:grid;grid-template-columns:1.5rem minmax(0, 1fr) 1.5rem}.page-layout>*{grid-column:2/3}.page{height:100%}#sign_in,#sign_up{place-items:center}#sign_in section,#sign_up section{width:min(24rem, 100%)}#sign_in sm-form,#sign_up sm-form{margin:2rem 0}#sign_up sm-copy{font-size:.9rem;--button-border-radius: 0.5rem }#sign_up .h2{margin-bottom:.5rem}#sign_up .card{margin:1.5rem 0}#sign_up h5{font-weight:500;color:rgba(var(--text-color), 0.8)}#loading{place-content:center;text-align:center}#loading sm-spinner{margin-bottom:1.5rem}#homepage{height:100%;display:grid;grid-template-rows:auto 1fr auto;grid-template-columns:minmax(0, 1fr);grid-template-areas:"main-header" "subpages" "main-nav"}#main_nav{grid-area:main-nav;position:relative;display:-webkit-box;display:-ms-flexbox;display:flex}.nav-item{display:-webkit-box;display:-ms-flexbox;display:flex;-webkit-box-align:center;-ms-flex-align:center;align-items:center;padding:.8rem;border-radius:.5rem;color:inherit;-webkit-transition:-webkit-transform .3s;transition:-webkit-transform .3s;transition:transform .3s;transition:transform .3s, -webkit-transform .3s;-webkit-user-select:none;-moz-user-select:none;-ms-user-select:none;user-select:none;-webkit-tap-highlight-color:transparent}.nav-item--active .icon{fill:var(--accent-color)}.nav-item--active .nav-item__title{color:var(--accent-color)}#main_header{grid-area:main-header;padding:1.5rem;display:grid;gap:1rem;-webkit-box-align:center;-ms-flex-align:center;align-items:center;grid-template-columns:1fr auto auto}#subpage_container{grid-area:subpages;overflow-y:auto}#dashboard{display:grid;gap:1.5rem;padding:0 1.5rem}#quick_actions_container{display:-webkit-box;display:-ms-flexbox;display:flex;-ms-flex-wrap:wrap;flex-wrap:wrap;gap:1.5rem;margin:2rem 0}.quick-action{display:-webkit-box;display:-ms-flexbox;display:flex;-webkit-box-orient:vertical;-webkit-box-direction:normal;-ms-flex-direction:column;flex-direction:column;-webkit-box-align:center;-ms-flex-align:center;align-items:center}.quick-action__icon{padding:1rem;border-radius:1rem;background-color:var(--accent-color--light);margin-bottom:.8rem}.quick-action__icon .icon{height:1.5rem;width:1.5rem;fill:var(--accent-color)}.quick-action__title{font-size:.8rem;font-weight:500}#recent_transactions_container{display:grid;margin:1.5rem 0;padding-bottom:5rem}.activity-card{display:grid;padding:1rem 0;gap:.4rem 1rem;border-radius:.5rem;-webkit-box-align:start;-ms-flex-align:start;align-items:flex-start;color:inherit;grid-template-columns:auto minmax(0, 1fr) auto}.activity-card__icon{display:-webkit-box;display:-ms-flexbox;display:flex;-ms-flex-line-pack:center;align-content:center;-webkit-box-pack:center;-ms-flex-pack:center;justify-content:center;padding:.5rem;border-radius:.8rem;background-color:var(--accent-color--light)}.activity-card__icon .icon{height:1.3rem;width:1.3rem;fill:var(--accent-color)}.activity-card__title{font-size:.95rem;font-weight:500}.activity-card__title::first-letter{text-transform:uppercase}.activity-card__time{font-size:.8rem;color:rgba(var(--text-color), 0.8)}#notifications,#history{padding-bottom:5rem}#notifications .activity-card,#history .activity-card{padding:1rem 1.5rem}#user_accounts{margin-top:1.5rem;display:grid;gap:1rem;padding-bottom:5rem;grid-template-columns:repeat(auto-fill, minmax(12rem, 1fr))}.activity-card--account{-webkit-user-select:none;-moz-user-select:none;-ms-user-select:none;user-select:none;gap:1.5rem;padding:1.5rem;background-color:var(--foreground-color);border:solid thin rgba(var(--text-color), 0.2);grid-template-columns:minmax(0, 1fr)}.activity-card--account .activity-card__icon{padding:0;margin-bottom:.5rem;background-color:transparent}.activity-card--account .activity-card__type{font-size:.9rem;color:rgba(var(--text-color), 0.6);font-weight:500}.activity-card--account .activity-card__amount{margin-top:.3rem;font-size:1.3rem}.activity-card--request{grid-template-areas:"icon . amount" "icon time ."}.activity-card--request .activity-card__icon{grid-area:icon}.activity-card--request .activity-card__time{grid-area:time}.activity-card--request .activity-card__amount{grid-area:amount;text-align:end}.status-tag:not(:empty){text-transform:uppercase;letter-spacing:.05em;font-size:.7rem;border-radius:.2rem;padding:.3rem .4rem;font-weight:500;color:rgba(0,0,0,.7)}.status-tag:not(:empty) .icon{margin-right:.3rem}.status-tag:not(:empty).success,.status-tag:not(:empty).active{color:var(--green);background-color:rgba(0,230,118,.1)}.status-tag:not(:empty).failed{color:var(--danger-color);background-color:rgba(255,75,75,.1)}.status-tag:not(:empty).pending{color:var(--yellow);background-color:rgba(255,252,75,.1)}.status-tag:not(:empty).closed{color:rgba(var(--text-color), 0.7);background-color:rgba(var(--text-color), 0.06)}.activity-card--response{grid-template-areas:"icon . time" "icon description description"}.activity-card--response .activity-card__icon{grid-area:icon}.activity-card--response .activity-card__description{grid-area:description;font-size:.8rem;color:rgba(var(--text-color), 0.8)}.activity-card--response .activity-card__time{grid-area:time}.success .icon{fill:var(--green)}.pending .icon{fill:var(--yellow)}.failed .icon{fill:var(--danger-color)}#user_section{display:grid;-ms-flex-line-pack:start;align-content:flex-start;gap:2rem;overflow-y:auto;padding:1.5rem;grid-template-columns:minmax(0, 1fr)}#user_section h4{margin-bottom:1rem}#account_chart_container{display:-webkit-box;display:-ms-flexbox;display:flex;-webkit-box-orient:vertical;-webkit-box-direction:normal;-ms-flex-direction:column;flex-direction:column;-webkit-box-align:center;-ms-flex-align:center;align-items:center;height:15rem;padding-bottom:3rem;margin:1.5rem 0}#chart_legend{display:-webkit-box;display:-ms-flexbox;display:flex;-ms-flex-wrap:wrap;flex-wrap:wrap;-webkit-box-pack:center;-ms-flex-pack:center;justify-content:center;-webkit-box-align:center;-ms-flex-align:center;align-items:center;margin-bottom:1rem}.legend{display:-webkit-box;display:-ms-flexbox;display:flex;-webkit-box-align:center;-ms-flex-align:center;align-items:center;font-size:.8rem;margin-right:1rem;margin-bottom:1rem}.legend::before{content:"";margin-right:.5rem;width:1rem;height:1rem;border-radius:25%}.legend:nth-of-type(1)::before{background-color:var(--green)}.legend:nth-of-type(2)::before{background-color:#ffbb61}.balance-card{display:grid;grid-template-columns:auto 1fr;grid-template-areas:"icon ." "icon .";padding:1rem 0;-webkit-box-align:center;-ms-flex-align:center;align-items:center;gap:.3rem 1rem;border-radius:.5rem}.balance-card__icon{grid-area:icon;display:-webkit-box;display:-ms-flexbox;display:flex;-ms-flex-line-pack:center;align-content:center;-webkit-box-pack:center;-ms-flex-pack:center;justify-content:center;padding:.5rem;border-radius:.8rem;background-color:var(--accent-color--light)}.balance-card__icon .icon{height:1.3rem;width:1.3rem;fill:var(--accent-color)}.balance-card__token{font-size:.8rem}.balance-card__amount{font-size:1rem;font-weight:700}#transaction,#account{grid-template-rows:auto 1fr;gap:1.5rem 0;padding:1.5rem 0;-ms-flex-line-pack:start;align-content:flex-start}#transaction section,#account_details{display:-webkit-box;display:-ms-flexbox;display:flex;-webkit-box-orient:vertical;-webkit-box-direction:normal;-ms-flex-direction:column;flex-direction:column}#transaction_top,#account_top{display:-webkit-box;display:-ms-flexbox;display:flex;-webkit-box-orient:vertical;-webkit-box-direction:normal;-ms-flex-direction:column;flex-direction:column;justify-items:flex-start;position:relative}#transaction_detail__icon,#account_detail__icon{display:-webkit-box;display:-ms-flexbox;display:flex;background-color:var(--accent-color);border-radius:40%;padding:.8rem;justify-self:flex-start;-ms-flex-item-align:start;align-self:flex-start}#transaction_detail__icon .icon,#account_detail__icon .icon{height:1.5rem;width:1.5rem;fill:rgba(var(--background-color), 1)}#transaction_detail__amount,#account_detail__amount{display:-webkit-box;display:-ms-flexbox;display:flex;font-size:1.8rem;font-weight:700}#transaction_detail__amount::before,#account_detail__amount::before{font-weight:500;font-size:1rem;-ms-flex-item-align:start;align-self:flex-start;content:"₹"}#transaction_detail__time,#account_detail__time{font-size:.8rem;color:rgba(var(--text-color), 0.8);margin-right:1rem}#account_process{display:grid;-ms-flex-line-pack:start;align-content:flex-start;gap:2rem}#account_process__type{margin-top:1.5rem;font-size:.9rem;font-weight:500;color:rgba(var(--text-color), 0.8)}#account_process__amount{font-size:1.5rem}.account-step{grid-template-columns:auto minmax(0, 1fr);grid-template-areas:"step-icon step-title" "step-icon step-description";gap:.3rem .8rem}.account-step sm-spinner{--height: 1rem;--width: 1rem}.account-step:not(:last-of-type)::after{position:relative;content:"";height:3rem;width:.1rem;margin:.5rem 0 1rem 0;margin-left:.7rem;background-color:var(--green)}.account-step .step__icon{grid-area:step-icon}.account-step .icon{height:1.5rem;width:1.5rem}.account-step:not(.loading) .step__title{grid-area:step-title;font-weight:500;font-size:.9rem;padding:.2rem 0}.account-step .step__description{grid-area:step-description;font-size:.8rem}@-webkit-keyframes slide-down{from{opacity:0;-webkit-transform:translateY(-1rem);transform:translateY(-1rem)}to{opacity:1;-webkit-transform:none;transform:none}}@keyframes slide-down{from{opacity:0;-webkit-transform:translateY(-1rem);transform:translateY(-1rem)}to{opacity:1;-webkit-transform:none;transform:none}}@media screen and (max-width: 640px){sm-button{--padding: 1rem}#dashboard{padding:0 1.5rem}#main_nav{border-radius:1rem 1rem 0 0;background-color:var(--foreground-color)}.nav-item{-webkit-box-flex:1;-ms-flex:1;flex:1;-webkit-box-orient:vertical;-webkit-box-direction:normal;-ms-flex-direction:column;flex-direction:column}.nav-item__title{display:-webkit-box;display:-ms-flexbox;display:flex;font-size:.7rem;font-weight:500;color:rgba(var(--text-color), 0.8);margin-top:.3rem}#transaction_action_button,#account_action_button{margin-top:auto}}@media screen and (min-width: 640px){#confirmation_popup,#prompt_popup{--width: 24rem}.page-layout{grid-template-columns:1fr 90vw 1fr}#homepage{background-color:var(--foreground-color);grid-template-rows:auto 1fr;grid-template-columns:auto minmax(0, 1fr);grid-template-areas:"main-header main-header user-section" "main-nav subpages user-section"}#main_nav{-webkit-box-orient:vertical;-webkit-box-direction:normal;-ms-flex-direction:column;flex-direction:column;padding:0 1rem}#main_nav::after{position:absolute;right:0;content:"";width:1px;background-color:rgba(var(--text-color), 0.3);height:80%}.nav-item--active{background-color:var(--accent-color--light)}.nav-item:not(:last-of-type){margin-bottom:.5rem}.nav-item:last-of-type{margin-top:auto;margin-bottom:1.5rem}.nav-item__title{display:none}#user_section{grid-area:user-section;background-color:rgba(var(--background-color), 1)}#transaction_top,#account_top{overflow:hidden;padding:1.8rem;border-radius:.5rem;border:solid thin rgba(var(--text-color), 0.2)}#transaction_detail__status{justify-self:flex-start}#transaction_detail__icon{justify-self:flex-start}}@media screen and (max-width: 1024px){#user_section{position:fixed;background-color:rgba(var(--background-color), 1);z-index:2;-webkit-transform:translateX(-100%);transform:translateX(-100%)}}@media screen and (min-width: 1024px){.page-layout{grid-template-columns:1fr 80vw 1fr}.card{padding:2rem}#homepage{grid-template-columns:14rem minmax(0, 1fr) 24rem}.nav-item__title{display:-webkit-box;display:-ms-flexbox;display:flex;font-size:.9rem;font-weight:500;color:rgba(var(--text-color), 0.8);margin-left:.5rem}#transaction section,#account_details{display:grid;grid-template-columns:18rem minmax(0, 1fr)}}@media screen and (min-width: 1920px){.page-layout{grid-template-columns:1fr 70vw 1fr}}@media(any-hover: hover){::-webkit-scrollbar{width:.5rem;height:.5rem}::-webkit-scrollbar-thumb{background:rgba(var(--text-color), 0.3);border-radius:1rem}::-webkit-scrollbar-thumb:hover{background:rgba(var(--text-color), 0.5)}.nav-item,.interact{-webkit-transition:background-color .3s,-webkit-transform .3s;transition:background-color .3s,-webkit-transform .3s;transition:background-color .3s,transform .3s;transition:background-color .3s,transform .3s,-webkit-transform .3s}.nav-item:hover,.interact:hover{background-color:var(--accent-color--light)}}
\ No newline at end of file
+*{padding:0;margin:0;-webkit-box-sizing:border-box;box-sizing:border-box;font-family:"Roboto",sans-serif}:root{font-size:clamp(1rem, 1.2vmax, 3rem)}html,body{height:100%;scroll-behavior:smooth}body{color:rgba(var(--text-color), 1);background:rgba(var(--background-color), 1)}body,body *{--accent-color: #2672ff;--accent-color--light: rgba(38, 114, 255, 0.06);--text-color: 36, 36, 36;--background-color: 247, 250, 255;--foreground-color: rgb(250, 252, 255);--danger-color: rgb(255, 75, 75);--green: #1cad59;--yellow: #f3a600;scrollbar-width:thin}body[data-theme=dark],body[data-theme=dark] *{--accent-color: rgb(170, 190, 255);--accent-color--light: rgba(231, 239, 255, 0.06);--text-color: 230, 230, 230;--text-color-light: 170, 170, 170;--background-color: 10, 10, 10;--foreground-color: rgb(20, 20, 20);--danger-color: rgb(255, 106, 106);--green: #00e676;--yellow: #ffd13a}p{font-size:.9rem;max-width:70ch;line-height:1.7;color:rgba(var(--text-color), 0.8)}p:not(:last-of-type){margin-bottom:1.5rem}a:where([class]){color:inherit;text-decoration:none}a:where([class]):focus-visible{-webkit-box-shadow:0 0 0 .1rem rgba(var(--text-color), 1) inset;box-shadow:0 0 0 .1rem rgba(var(--text-color), 1) inset}a{color:var(--accent-color)}button,.button{-webkit-user-select:none;-moz-user-select:none;-ms-user-select:none;user-select:none;position:relative;display:-webkit-inline-box;display:-ms-inline-flexbox;display:inline-flex;border:none;background-color:transparent;overflow:hidden;color:inherit;cursor:pointer;-webkit-transition:-webkit-transform .3s;transition:-webkit-transform .3s;transition:transform .3s;transition:transform .3s, -webkit-transform .3s}.button{padding:.4rem .6rem;border-radius:.3rem;font-weight:500;font-size:.8rem;border:solid thin rgba(var(--text-color), 0.5)}button:disabled{opacity:.5}a:-webkit-any-link:focus-visible{outline:rgba(var(--text-color), 1) .1rem solid}a:-moz-any-link:focus-visible{outline:rgba(var(--text-color), 1) .1rem solid}a:any-link:focus-visible{outline:rgba(var(--text-color), 1) .1rem solid}sm-button{--border-radius: 0.5rem;--padding: 0.8rem 1rem}sm-button[variant=primary] .icon{fill:rgba(var(--background-color), 1)}sm-button[disabled] .icon{fill:rgba(var(--text-color), 0.6)}ul{list-style:none}.flex{display:-webkit-box;display:-ms-flexbox;display:flex}.grid{display:grid}.hide{opacity:0;pointer-events:none}.hide-completely{display:none !important}.no-transformations{-webkit-transform:none !important;transform:none !important}.overflow-ellipsis{width:100%;overflow:hidden;white-space:nowrap;text-overflow:ellipsis}.breakable{overflow-wrap:break-word;word-wrap:break-word;-ms-word-break:break-all;word-break:break-word;-ms-hyphens:auto;-webkit-hyphens:auto;hyphens:auto}.full-bleed{grid-column:1/4}.h1{font-size:2.5rem}.h2{font-size:2rem}.h3{font-size:1.4rem}.h4{font-size:1rem}.h5{font-size:.8rem}.uppercase{text-transform:uppercase}.capitalize{text-transform:capitalize}.flex{display:-webkit-box;display:-ms-flexbox;display:flex}.grid{display:grid}.grid-3{grid-template-columns:1fr auto auto}.flow-column{grid-auto-flow:column}.gap-0-5{gap:.5rem}.gap-1{gap:1rem}.gap-1-5{gap:1.5rem}.gap-2{gap:2rem}.gap-3{gap:3rem}.text-align-right{text-align:right}.align-start{-webkit-box-align:start;-ms-flex-align:start;align-items:flex-start}.align-center{-webkit-box-align:center;-ms-flex-align:center;align-items:center}.text-center{text-align:center}.justify-start{-webkit-box-pack:start;-ms-flex-pack:start;justify-content:start}.justify-center{-webkit-box-pack:center;-ms-flex-pack:center;justify-content:center}.justify-right{margin-left:auto}.align-self-center{-ms-flex-item-align:center;align-self:center}.justify-self-center{justify-self:center}.justify-self-start{justify-self:start}.justify-self-end{justify-self:end}.direction-column{-webkit-box-orient:vertical;-webkit-box-direction:normal;-ms-flex-direction:column;flex-direction:column}.space-between{-webkit-box-pack:justify;-ms-flex-pack:justify;justify-content:space-between}.stretch{-webkit-box-pack:stretch;-ms-flex-pack:stretch;justify-content:stretch;justify-items:stretch}.stretch>*{width:100%}.ripple{position:absolute;border-radius:50%;-webkit-transform:scale(0);transform:scale(0);background:rgba(var(--text-color), 0.16);pointer-events:none}.interact{position:relative;cursor:pointer;-webkit-transition:-webkit-transform .3s;transition:-webkit-transform .3s;transition:transform .3s;transition:transform .3s, -webkit-transform .3s;-webkit-tap-highlight-color:transparent}.observe-empty-state:empty{display:none}.observe-empty-state:not(:empty)~.empty-state{display:none}.icon{width:1.2rem;height:1.2rem;fill:rgba(var(--text-color), 0.8)}.button__icon{height:1.2rem;width:1.2rem}.button__icon--left{margin-right:.5rem}.button__icon--right{margin-left:.5rem}.icon-button{padding:.6rem;border-radius:.8rem;background-color:var(--accent-color--light)}.icon-button .icon{fill:var(--accent-color)}#confirmation_popup,#prompt_popup{-webkit-box-orient:vertical;-webkit-box-direction:normal;-ms-flex-direction:column;flex-direction:column}#confirmation_popup h4,#prompt_popup h4{font-weight:500;margin-bottom:.5rem}#confirmation_popup sm-button,#prompt_popup sm-button{margin:0}#confirmation_popup .flex,#prompt_popup .flex{padding:0;margin-top:1rem}#confirmation_popup .flex sm-button:first-of-type,#prompt_popup .flex sm-button:first-of-type{margin-right:.6rem;margin-left:auto}button:active,.button:active,.interact:active,.nav-item:active{-webkit-transform:scale(0.96);transform:scale(0.96)}#main_page{padding:1.5rem}#main_page>section:nth-of-type(1){-ms-flex-line-pack:start;align-content:flex-start}#logo{display:grid;-webkit-box-align:center;-ms-flex-align:center;align-items:center;width:100%;grid-template-columns:auto 1fr;gap:0 .3rem;margin-right:1rem}#logo h4{text-transform:capitalize;font-size:1rem;font-weight:600}#logo #main_logo{height:1.4rem;width:1.4rem;fill:rgba(var(--text-color), 1);stroke:none}details summary{-webkit-user-select:none;-moz-user-select:none;-ms-user-select:none;user-select:none;cursor:pointer}details[open]>summary{margin-bottom:1rem}details[open]>summary .icon{-webkit-transform:rotate(180deg);transform:rotate(180deg)}.card{padding:1rem;border-radius:.5rem;background-color:var(--accent-color--light)}.page-layout{display:grid;grid-template-columns:1.5rem minmax(0, 1fr) 1.5rem}.page-layout>*{grid-column:2/3}.page{height:100%}#sign_in,#sign_up{place-items:center}#sign_in section,#sign_up section{width:min(24rem, 100%)}#sign_in sm-form,#sign_up sm-form{margin:2rem 0}#sign_up sm-copy{font-size:.9rem;--button-border-radius: 0.5rem}#sign_up .h2{margin-bottom:.5rem}#sign_up .card{margin:1.5rem 0}#sign_up h5{font-weight:500;color:rgba(var(--text-color), 0.8)}#loading{place-content:center;text-align:center}#loading sm-spinner{margin-bottom:1.5rem}#homepage{height:100%;display:grid;grid-template-rows:auto 1fr auto;grid-template-columns:minmax(0, 1fr);grid-template-areas:"main-header" "subpages" "main-nav"}#main_nav{grid-area:main-nav;position:relative;display:-webkit-box;display:-ms-flexbox;display:flex}.nav-item{display:-webkit-box;display:-ms-flexbox;display:flex;-webkit-box-align:center;-ms-flex-align:center;align-items:center;padding:.8rem;border-radius:.5rem;color:inherit;-webkit-transition:-webkit-transform .3s;transition:-webkit-transform .3s;transition:transform .3s;transition:transform .3s, -webkit-transform .3s;-webkit-user-select:none;-moz-user-select:none;-ms-user-select:none;user-select:none;-webkit-tap-highlight-color:transparent}.nav-item--active .icon{fill:var(--accent-color)}.nav-item--active .nav-item__title{color:var(--accent-color)}#main_header{grid-area:main-header;padding:1.5rem;display:grid;gap:1rem;-webkit-box-align:center;-ms-flex-align:center;align-items:center;grid-template-columns:1fr auto auto}#subpage_container{grid-area:subpages;overflow-y:auto}#dashboard{display:grid;gap:1.5rem;padding:0 1.5rem}#quick_actions_container{display:-webkit-box;display:-ms-flexbox;display:flex;-ms-flex-wrap:wrap;flex-wrap:wrap;gap:1.5rem;margin:2rem 0}.quick-action{display:-webkit-box;display:-ms-flexbox;display:flex;-webkit-box-orient:vertical;-webkit-box-direction:normal;-ms-flex-direction:column;flex-direction:column;-webkit-box-align:center;-ms-flex-align:center;align-items:center}.quick-action__icon{padding:1rem;border-radius:1rem;background-color:var(--accent-color--light);margin-bottom:.8rem}.quick-action__icon .icon{height:1.5rem;width:1.5rem;fill:var(--accent-color)}.quick-action__title{font-size:.8rem;font-weight:500}#recent_transactions_container{display:grid;margin:1.5rem 0;padding-bottom:5rem}.activity-card{display:grid;padding:1rem 0;gap:.4rem 1rem;border-radius:.5rem;-webkit-box-align:start;-ms-flex-align:start;align-items:flex-start;color:inherit;grid-template-columns:auto minmax(0, 1fr) auto}.activity-card__icon{display:-webkit-box;display:-ms-flexbox;display:flex;-ms-flex-line-pack:center;align-content:center;-webkit-box-pack:center;-ms-flex-pack:center;justify-content:center;padding:.5rem;border-radius:.8rem;background-color:var(--accent-color--light)}.activity-card__icon .icon{height:1.3rem;width:1.3rem;fill:var(--accent-color)}.activity-card__title{font-size:.95rem;font-weight:500}.activity-card__title::first-letter{text-transform:uppercase}.activity-card__time{font-size:.8rem;color:rgba(var(--text-color), 0.8)}#notifications,#history{padding-bottom:5rem}#notifications .activity-card,#history .activity-card{padding:1rem 1.5rem}#user_accounts{margin-top:1.5rem;display:grid;gap:1rem;padding-bottom:5rem;grid-template-columns:repeat(auto-fill, minmax(12rem, 1fr))}.activity-card--account{-webkit-user-select:none;-moz-user-select:none;-ms-user-select:none;user-select:none;gap:1.5rem;padding:1.5rem;background-color:var(--foreground-color);border:solid thin rgba(var(--text-color), 0.2);grid-template-columns:minmax(0, 1fr)}.activity-card--account .activity-card__icon{padding:0;margin-bottom:.5rem;background-color:transparent}.activity-card--account .activity-card__type{font-size:.9rem;color:rgba(var(--text-color), 0.6);font-weight:500}.activity-card--account .activity-card__amount{margin-top:.3rem;font-size:1.3rem}.activity-card--request{grid-template-areas:"icon . amount" "icon time ."}.activity-card--request .activity-card__icon{grid-area:icon}.activity-card--request .activity-card__time{grid-area:time}.activity-card--request .activity-card__amount{grid-area:amount;text-align:end}.status-tag:not(:empty){text-transform:uppercase;letter-spacing:.05em;font-size:.7rem;border-radius:.2rem;padding:.3rem .4rem;font-weight:500;color:rgba(0,0,0,.7)}.status-tag:not(:empty) .icon{margin-right:.3rem}.status-tag:not(:empty).success,.status-tag:not(:empty).active{color:var(--green);background-color:rgba(0,230,118,.1)}.status-tag:not(:empty).failed{color:var(--danger-color);background-color:rgba(255,75,75,.1)}.status-tag:not(:empty).pending{color:var(--yellow);background-color:rgba(255,252,75,.1)}.status-tag:not(:empty).closed{color:rgba(var(--text-color), 0.7);background-color:rgba(var(--text-color), 0.06)}.activity-card--response{grid-template-areas:"icon . time" "icon description description"}.activity-card--response .activity-card__icon{grid-area:icon}.activity-card--response .activity-card__description{grid-area:description;font-size:.8rem;color:rgba(var(--text-color), 0.8)}.activity-card--response .activity-card__time{grid-area:time}.success .icon{fill:var(--green)}.pending .icon{fill:var(--yellow)}.failed .icon{fill:var(--danger-color)}#user_section{display:grid;-ms-flex-line-pack:start;align-content:flex-start;gap:2rem;overflow-y:auto;padding:1.5rem;grid-template-columns:minmax(0, 1fr)}#user_section h4{margin-bottom:1rem}#account_chart_container{display:-webkit-box;display:-ms-flexbox;display:flex;-webkit-box-orient:vertical;-webkit-box-direction:normal;-ms-flex-direction:column;flex-direction:column;-webkit-box-align:center;-ms-flex-align:center;align-items:center;height:15rem;padding-bottom:3rem;margin:1.5rem 0}#chart_legend{display:-webkit-box;display:-ms-flexbox;display:flex;-ms-flex-wrap:wrap;flex-wrap:wrap;-webkit-box-pack:center;-ms-flex-pack:center;justify-content:center;-webkit-box-align:center;-ms-flex-align:center;align-items:center;margin-bottom:1rem}.legend{display:-webkit-box;display:-ms-flexbox;display:flex;-webkit-box-align:center;-ms-flex-align:center;align-items:center;font-size:.8rem;margin-right:1rem;margin-bottom:1rem}.legend::before{content:"";margin-right:.5rem;width:1rem;height:1rem;border-radius:25%}.legend:nth-of-type(1)::before{background-color:var(--green)}.legend:nth-of-type(2)::before{background-color:#ffbb61}.balance-card{display:grid;grid-template-columns:auto 1fr;grid-template-areas:"icon ." "icon .";padding:1rem 0;-webkit-box-align:center;-ms-flex-align:center;align-items:center;gap:.3rem 1rem;border-radius:.5rem}.balance-card__icon{grid-area:icon;display:-webkit-box;display:-ms-flexbox;display:flex;-ms-flex-line-pack:center;align-content:center;-webkit-box-pack:center;-ms-flex-pack:center;justify-content:center;padding:.5rem;border-radius:.8rem;background-color:var(--accent-color--light)}.balance-card__icon .icon{height:1.3rem;width:1.3rem;fill:var(--accent-color)}.balance-card__token{font-size:.8rem}.balance-card__amount{font-size:1rem;font-weight:700}#transaction,#account{grid-template-rows:auto 1fr;gap:1.5rem 0;padding:1.5rem 0;-ms-flex-line-pack:start;align-content:flex-start}#transaction section,#account_details{display:-webkit-box;display:-ms-flexbox;display:flex;-webkit-box-orient:vertical;-webkit-box-direction:normal;-ms-flex-direction:column;flex-direction:column}#transaction_top,#account_top{display:-webkit-box;display:-ms-flexbox;display:flex;-webkit-box-orient:vertical;-webkit-box-direction:normal;-ms-flex-direction:column;flex-direction:column;justify-items:flex-start;position:relative}#transaction_detail__icon,#account_detail__icon{display:-webkit-box;display:-ms-flexbox;display:flex;background-color:var(--accent-color);border-radius:40%;padding:.8rem;justify-self:flex-start;-ms-flex-item-align:start;align-self:flex-start}#transaction_detail__icon .icon,#account_detail__icon .icon{height:1.5rem;width:1.5rem;fill:rgba(var(--background-color), 1)}#transaction_detail__amount,#account_detail__amount{display:-webkit-box;display:-ms-flexbox;display:flex;font-size:1.8rem;font-weight:700}#transaction_detail__time{font-size:.8rem;color:rgba(var(--text-color), 0.8);margin-right:1rem}#account_process{display:grid;-ms-flex-line-pack:start;align-content:flex-start;gap:2rem}.account-step{opacity:0;grid-template-columns:auto minmax(0, 1fr);grid-template-areas:"step-icon step-title" ". step-description";gap:.3rem .8rem;-webkit-animation:slide-down .3s forwards;animation:slide-down .3s forwards}.account-step:nth-of-type(2){-webkit-animation-delay:.1s;animation-delay:.1s}.account-step:nth-of-type(3){-webkit-animation-delay:.2s;animation-delay:.2s}.account-step:nth-of-type(4){-webkit-animation-delay:.3s;animation-delay:.3s}.account-step sm-spinner{--height: 1rem;--width: 1rem}.account-step:not(:last-of-type)::after{position:relative;content:"";height:3rem;width:.1rem;margin:.5rem 0 1rem 0;margin-left:.7rem;background-color:var(--green)}.account-step .step__icon{grid-area:step-icon}.account-step .icon{height:1.5rem;width:1.5rem}.account-step:not(.loading) .step__title{text-transform:capitalize;grid-area:step-title;font-weight:500;font-size:.9rem;padding:.2rem 0}.account-step .step__description{grid-area:step-description;font-size:.8rem}@-webkit-keyframes slide-down{from{opacity:0;-webkit-transform:translateY(-1rem);transform:translateY(-1rem)}to{opacity:1;-webkit-transform:none;transform:none}}@keyframes slide-down{from{opacity:0;-webkit-transform:translateY(-1rem);transform:translateY(-1rem)}to{opacity:1;-webkit-transform:none;transform:none}}@media screen and (max-width: 640px){sm-button{--padding: 1rem}#dashboard{padding:0 1.5rem}#main_nav{border-radius:1rem 1rem 0 0;background-color:var(--foreground-color)}.nav-item{-webkit-box-flex:1;-ms-flex:1;flex:1;-webkit-box-orient:vertical;-webkit-box-direction:normal;-ms-flex-direction:column;flex-direction:column}.nav-item__title{display:-webkit-box;display:-ms-flexbox;display:flex;font-size:.7rem;font-weight:500;color:rgba(var(--text-color), 0.8);margin-top:.3rem}#transaction_action_button,#account_action_button{margin-top:auto}#account_process{margin-top:3rem}}@media screen and (min-width: 640px){#confirmation_popup,#prompt_popup{--width: 24rem}.page-layout{grid-template-columns:1fr 90vw 1fr}#homepage{background-color:var(--foreground-color);grid-template-rows:auto 1fr;grid-template-columns:auto minmax(0, 1fr);grid-template-areas:"main-header main-header user-section" "main-nav subpages user-section"}#main_nav{-webkit-box-orient:vertical;-webkit-box-direction:normal;-ms-flex-direction:column;flex-direction:column;padding:0 1rem}#main_nav::after{position:absolute;right:0;content:"";width:1px;background-color:rgba(var(--text-color), 0.3);height:80%}.nav-item--active{background-color:var(--accent-color--light)}.nav-item:not(:last-of-type){margin-bottom:.5rem}.nav-item:last-of-type{margin-top:auto;margin-bottom:1.5rem}.nav-item__title{display:none}#user_section{grid-area:user-section;background-color:rgba(var(--background-color), 1)}#transaction_top,#account_top,#account_process{overflow:hidden;padding:1.8rem;border-radius:.5rem;border:solid thin rgba(var(--text-color), 0.2)}#transaction_detail__status{justify-self:flex-start}#transaction_detail__icon{justify-self:flex-start}}@media screen and (max-width: 1024px){#user_section{position:fixed;background-color:rgba(var(--background-color), 1);z-index:2;-webkit-transform:translateX(-100%);transform:translateX(-100%)}}@media screen and (min-width: 1024px){.page-layout{grid-template-columns:1fr 80vw 1fr}.card{padding:2rem}#homepage{grid-template-columns:14rem minmax(0, 1fr) 24rem}.nav-item__title{display:-webkit-box;display:-ms-flexbox;display:flex;font-size:.9rem;font-weight:500;color:rgba(var(--text-color), 0.8);margin-left:.5rem}#transaction section,#account_details{display:grid;gap:1.5rem;grid-template-columns:18rem minmax(0, 1fr)}}@media screen and (min-width: 1920px){.page-layout{grid-template-columns:1fr 70vw 1fr}}@media(any-hover: hover){::-webkit-scrollbar{width:.5rem;height:.5rem}::-webkit-scrollbar-thumb{background:rgba(var(--text-color), 0.3);border-radius:1rem}::-webkit-scrollbar-thumb:hover{background:rgba(var(--text-color), 0.5)}.nav-item,.interact{-webkit-transition:background-color .3s,-webkit-transform .3s;transition:background-color .3s,-webkit-transform .3s;transition:background-color .3s,transform .3s;transition:background-color .3s,transform .3s,-webkit-transform .3s}.nav-item:hover,.interact:hover{background-color:var(--accent-color--light)}}
\ No newline at end of file
diff --git a/css/main.scss b/css/main.scss
index 0b82cc9..d0aea8e 100644
--- a/css/main.scss
+++ b/css/main.scss
@@ -1,1024 +1,1022 @@
 * {
-    padding: 0;
-    margin: 0;
-    box-sizing: border-box;
-    font-family: 'Roboto', sans-serif;
+  padding: 0;
+  margin: 0;
+  box-sizing: border-box;
+  font-family: "Roboto", sans-serif;
 }
 
 :root {
-    font-size: clamp(1rem, 1.2vmax, 3rem);
+  font-size: clamp(1rem, 1.2vmax, 3rem);
 }
 
 html,
 body {
-    height: 100%;
-    scroll-behavior: smooth;
+  height: 100%;
+  scroll-behavior: smooth;
 }
 
 body {
-    &,
-    * {
-        --accent-color: #2672ff;
-        --accent-color--light: rgba(38, 114, 255, 0.06);
-        --text-color: 36, 36, 36;
-        --background-color: 247, 250, 255;
-        --foreground-color: rgb(250, 252, 255);
-        --danger-color: rgb(255, 75, 75);
-        --green: #1cad59;
-        --yellow: #f3a600;
-        scrollbar-width: thin;
-    }
-    
-    color: rgba(var(--text-color), 1);
-    background: rgba(var(--background-color), 1);
+  &,
+  * {
+    --accent-color: #2672ff;
+    --accent-color--light: rgba(38, 114, 255, 0.06);
+    --text-color: 36, 36, 36;
+    --background-color: 247, 250, 255;
+    --foreground-color: rgb(250, 252, 255);
+    --danger-color: rgb(255, 75, 75);
+    --green: #1cad59;
+    --yellow: #f3a600;
+    scrollbar-width: thin;
+  }
+
+  color: rgba(var(--text-color), 1);
+  background: rgba(var(--background-color), 1);
 }
 
-body[data-theme='dark'] {
-    
-    &,
-    * {
-        --accent-color: rgb(170, 190, 255);
-        --accent-color--light: rgba(231, 239, 255, 0.06);
-        --text-color: 230, 230, 230;
-        --text-color-light: 170, 170, 170;
-        --background-color: 10, 10, 10;
-        --foreground-color: rgb(20, 20, 20);
-        --danger-color: rgb(255, 106, 106);
-        --green: #00E676;
-        --yellow: #ffd13a;
-    }
+body[data-theme="dark"] {
+  &,
+  * {
+    --accent-color: rgb(170, 190, 255);
+    --accent-color--light: rgba(231, 239, 255, 0.06);
+    --text-color: 230, 230, 230;
+    --text-color-light: 170, 170, 170;
+    --background-color: 10, 10, 10;
+    --foreground-color: rgb(20, 20, 20);
+    --danger-color: rgb(255, 106, 106);
+    --green: #00e676;
+    --yellow: #ffd13a;
+  }
 }
 
 p {
-    font-size: 0.9rem;
-    max-width: 70ch;
-    line-height: 1.7;
-    color: rgba(var(--text-color), 0.8);
+  font-size: 0.9rem;
+  max-width: 70ch;
+  line-height: 1.7;
+  color: rgba(var(--text-color), 0.8);
 
-    &:not(:last-of-type) {
-        margin-bottom: 1.5rem;
-    }
+  &:not(:last-of-type) {
+    margin-bottom: 1.5rem;
+  }
 }
 
 a:where([class]) {
-    color: inherit;
-    text-decoration: none;
+  color: inherit;
+  text-decoration: none;
 
-    &:focus-visible {
-        box-shadow: 0 0 0 0.1rem rgba(var(--text-color), 1) inset;
-    }
+  &:focus-visible {
+    box-shadow: 0 0 0 0.1rem rgba(var(--text-color), 1) inset;
+  }
 }
 
 a {
-    color: var(--accent-color);
+  color: var(--accent-color);
 }
 
 button,
 .button {
-    user-select: none;
-    position: relative;
-    display: inline-flex;
-    border: none;
-    background-color: transparent;
-    overflow: hidden;
-    color: inherit;
-    cursor: pointer;
-    transition: transform 0.3s;
+  user-select: none;
+  position: relative;
+  display: inline-flex;
+  border: none;
+  background-color: transparent;
+  overflow: hidden;
+  color: inherit;
+  cursor: pointer;
+  transition: transform 0.3s;
 }
-.button{
-    padding: 0.4rem 0.6rem;
-    border-radius: 0.3rem;
-    font-weight: 500;
-    font-size: 0.8rem;
-    border: solid thin rgba(var(--text-color), 0.5);
+.button {
+  padding: 0.4rem 0.6rem;
+  border-radius: 0.3rem;
+  font-weight: 500;
+  font-size: 0.8rem;
+  border: solid thin rgba(var(--text-color), 0.5);
 }
 
 button:disabled {
-    opacity: 0.5;
+  opacity: 0.5;
 }
 
 a:any-link:focus-visible {
-    outline: rgba(var(--text-color), 1) 0.1rem solid;
+  outline: rgba(var(--text-color), 1) 0.1rem solid;
 }
 
 sm-button {
-    --border-radius: 0.5rem;
-    --padding: 0.8rem 1rem;
-    &[variant="primary"] {
-        .icon {
-            fill: rgba(var(--background-color), 1);
-        }
+  --border-radius: 0.5rem;
+  --padding: 0.8rem 1rem;
+  &[variant="primary"] {
+    .icon {
+      fill: rgba(var(--background-color), 1);
     }
+  }
 
-    &[disabled] {
-        .icon {
-            fill: rgba(var(--text-color), 0.6);
-        }
+  &[disabled] {
+    .icon {
+      fill: rgba(var(--text-color), 0.6);
     }
+  }
 }
 
 ul {
-    list-style: none;
+  list-style: none;
 }
 
 .flex {
-    display: flex;
+  display: flex;
 }
 
 .grid {
-    display: grid;
+  display: grid;
 }
 
 .hide {
-    opacity: 0;
-    pointer-events: none;
+  opacity: 0;
+  pointer-events: none;
 }
 
 .hide-completely {
-    display: none !important;
+  display: none !important;
 }
 
 .no-transformations {
-    transform: none !important;
+  transform: none !important;
 }
 
 .overflow-ellipsis {
-    width: 100%;
-    overflow: hidden;
-    white-space: nowrap;
-    text-overflow: ellipsis;
+  width: 100%;
+  overflow: hidden;
+  white-space: nowrap;
+  text-overflow: ellipsis;
 }
 
 .breakable {
-    overflow-wrap: break-word;
-    word-wrap: break-word;
-    -ms-word-break: break-all;
-    word-break: break-word;
-    -ms-hyphens: auto;
-    -moz-hyphens: auto;
-    -webkit-hyphens: auto;
-    hyphens: auto;
+  overflow-wrap: break-word;
+  word-wrap: break-word;
+  -ms-word-break: break-all;
+  word-break: break-word;
+  -ms-hyphens: auto;
+  -moz-hyphens: auto;
+  -webkit-hyphens: auto;
+  hyphens: auto;
 }
 
 .full-bleed {
-    grid-column: 1/4;
+  grid-column: 1/4;
 }
 
 .h1 {
-    font-size: 2.5rem;
+  font-size: 2.5rem;
 }
 
 .h2 {
-    font-size: 2rem;
+  font-size: 2rem;
 }
 
 .h3 {
-    font-size: 1.4rem;
+  font-size: 1.4rem;
 }
 
 .h4 {
-    font-size: 1rem;
+  font-size: 1rem;
 }
 
 .h5 {
-    font-size: 0.8rem;
+  font-size: 0.8rem;
 }
 
 .uppercase {
-    text-transform: uppercase;
+  text-transform: uppercase;
 }
 
 .capitalize {
-    text-transform: capitalize;
+  text-transform: capitalize;
 }
 
 .flex {
-    display: flex;
+  display: flex;
 }
 
 .grid {
-    display: grid;
+  display: grid;
 }
 
 .grid-3 {
-    grid-template-columns: 1fr auto auto;
+  grid-template-columns: 1fr auto auto;
 }
 
 .flow-column {
-    grid-auto-flow: column;
+  grid-auto-flow: column;
 }
 
 .gap-0-5 {
-    gap: 0.5rem;
+  gap: 0.5rem;
 }
 
 .gap-1 {
-    gap: 1rem;
+  gap: 1rem;
 }
 
 .gap-1-5 {
-    gap: 1.5rem;
+  gap: 1.5rem;
 }
 
 .gap-2 {
-    gap: 2rem;
+  gap: 2rem;
 }
 
 .gap-3 {
-    gap: 3rem;
+  gap: 3rem;
 }
 
 .text-align-right {
-    text-align: right;
+  text-align: right;
 }
 
 .align-start {
-    align-items: flex-start;
+  align-items: flex-start;
 }
 
 .align-center {
-    align-items: center;
+  align-items: center;
 }
 
 .text-center {
-    text-align: center;
+  text-align: center;
 }
 
 .justify-start {
-    justify-content: start;
+  justify-content: start;
 }
 
 .justify-center {
-    justify-content: center;
+  justify-content: center;
 }
 
 .justify-right {
-    margin-left: auto;
+  margin-left: auto;
 }
 
 .align-self-center {
-    align-self: center;
+  align-self: center;
 }
 
 .justify-self-center {
-    justify-self: center;
+  justify-self: center;
 }
 
 .justify-self-start {
-    justify-self: start;
+  justify-self: start;
 }
 
 .justify-self-end {
-    justify-self: end;
+  justify-self: end;
 }
 
 .direction-column {
-    flex-direction: column;
+  flex-direction: column;
 }
 
 .space-between {
-    justify-content: space-between;
+  justify-content: space-between;
 }
 
 .stretch {
-    justify-content: stretch;
-    justify-items: stretch;
+  justify-content: stretch;
+  justify-items: stretch;
 
-    &>* {
-        width: 100%;
-    }
+  & > * {
+    width: 100%;
+  }
 }
 
 .ripple {
-    position: absolute;
-    border-radius: 50%;
-    transform: scale(0);
-    background: rgba(var(--text-color), 0.16);
-    pointer-events: none;
+  position: absolute;
+  border-radius: 50%;
+  transform: scale(0);
+  background: rgba(var(--text-color), 0.16);
+  pointer-events: none;
 }
 
 .interact {
-    position: relative;
-    cursor: pointer;
-    transition: transform 0.3s;
-    -webkit-tap-highlight-color: transparent;
+  position: relative;
+  cursor: pointer;
+  transition: transform 0.3s;
+  -webkit-tap-highlight-color: transparent;
 }
 
 .observe-empty-state:empty {
-    display: none;
+  display: none;
 }
 
-.observe-empty-state:not(:empty)~.empty-state {
-    display: none;
+.observe-empty-state:not(:empty) ~ .empty-state {
+  display: none;
 }
 
 .icon {
-    width: 1.2rem;
-    height: 1.2rem;
-    fill: rgba(var(--text-color), 0.8);
+  width: 1.2rem;
+  height: 1.2rem;
+  fill: rgba(var(--text-color), 0.8);
 }
 
 .button__icon {
-    height: 1.2rem;
-    width: 1.2rem;
+  height: 1.2rem;
+  width: 1.2rem;
 
-    &--left {
-        margin-right: 0.5rem;
-    }
+  &--left {
+    margin-right: 0.5rem;
+  }
 
-    &--right {
-        margin-left: 0.5rem;
-    }
+  &--right {
+    margin-left: 0.5rem;
+  }
 }
 
-.icon-button{
-    padding: 0.6rem;
-    border-radius: 0.8rem;
-    background-color: var(--accent-color--light);
-    .icon{
-        fill: var(--accent-color);
-    }
+.icon-button {
+  padding: 0.6rem;
+  border-radius: 0.8rem;
+  background-color: var(--accent-color--light);
+  .icon {
+    fill: var(--accent-color);
+  }
 }
 #confirmation_popup,
 #prompt_popup {
-    flex-direction: column;
+  flex-direction: column;
 
-    h4 {
-        font-weight: 500;
-        margin-bottom: 0.5rem;
-    }
-
-    sm-button {
-        margin: 0;
-    }
-
-    .flex {
-        padding: 0;
-        margin-top: 1rem;
-
-        sm-button:first-of-type {
-            margin-right: 0.6rem;
-            margin-left: auto;
-        }
+  h4 {
+    font-weight: 500;
+    margin-bottom: 0.5rem;
+  }
+
+  sm-button {
+    margin: 0;
+  }
+
+  .flex {
+    padding: 0;
+    margin-top: 1rem;
+
+    sm-button:first-of-type {
+      margin-right: 0.6rem;
+      margin-left: auto;
     }
+  }
 }
 
 button:active,
 .button:active,
 .interact:active,
-.nav-item:active{
-    transform: scale(0.96);
+.nav-item:active {
+  transform: scale(0.96);
 }
 
-
 #main_page {
-    padding: 1.5rem;
+  padding: 1.5rem;
 
-    &>section:nth-of-type(1) {
-        align-content: flex-start;
-    }
+  & > section:nth-of-type(1) {
+    align-content: flex-start;
+  }
 }
 #logo {
-    display: grid;
-    align-items: center;
-    width: 100%;
-    grid-template-columns: auto 1fr;
-    gap: 0 0.3rem;
-    margin-right: 1rem;
+  display: grid;
+  align-items: center;
+  width: 100%;
+  grid-template-columns: auto 1fr;
+  gap: 0 0.3rem;
+  margin-right: 1rem;
 
-    h4 {
-        text-transform: capitalize;
-        font-size: 1rem;
-        font-weight: 600;
-    }
+  h4 {
+    text-transform: capitalize;
+    font-size: 1rem;
+    font-weight: 600;
+  }
 
-    #main_logo {
-        height: 1.4rem;
-        width: 1.4rem;
-        fill: rgba(var(--text-color), 1);
-        stroke: none;
-    }
+  #main_logo {
+    height: 1.4rem;
+    width: 1.4rem;
+    fill: rgba(var(--text-color), 1);
+    stroke: none;
+  }
 }
 details {
-    summary {
-        user-select: none;
-        cursor: pointer;
-    }
-    
-    &[open] > summary {
-        margin-bottom: 1rem;
-        .icon {
-            transform: rotate(180deg);
-        }
-    }
+  summary {
+    user-select: none;
+    cursor: pointer;
+  }
 
-}
-.card{
-    padding: 1rem;
-    border-radius: 0.5rem;
-    background-color: var(--accent-color--light);
-}
-.page-layout{
-    display: grid;
-    grid-template-columns: 1.5rem minmax(0, 1fr) 1.5rem;
-    & > * {
-        grid-column: 2/3;
+  &[open] > summary {
+    margin-bottom: 1rem;
+    .icon {
+      transform: rotate(180deg);
     }
+  }
 }
-.page{
-    height: 100%;
+.card {
+  padding: 1rem;
+  border-radius: 0.5rem;
+  background-color: var(--accent-color--light);
+}
+.page-layout {
+  display: grid;
+  grid-template-columns: 1.5rem minmax(0, 1fr) 1.5rem;
+  & > * {
+    grid-column: 2/3;
+  }
+}
+.page {
+  height: 100%;
 }
 #sign_in,
-#sign_up{
-    place-items: center;
-    section{
-        width: min(24rem, 100%);
-    }
-    sm-form{
-        margin: 2rem 0;
-    }
+#sign_up {
+  place-items: center;
+  section {
+    width: min(24rem, 100%);
+  }
+  sm-form {
+    margin: 2rem 0;
+  }
 }
-#sign_up{
-    sm-copy{
-        font-size: 0.9rem;
-        --button-border-radius: 0.5rem
-    }
-    .h2{
-        margin-bottom: 0.5rem;
-    }
-    .card{
-        margin: 1.5rem 0;
-    }
-    h5{
-        font-weight: 500;
-        color: rgba(var(--text-color), 0.8);
-    }
+#sign_up {
+  sm-copy {
+    font-size: 0.9rem;
+    --button-border-radius: 0.5rem;
+  }
+  .h2 {
+    margin-bottom: 0.5rem;
+  }
+  .card {
+    margin: 1.5rem 0;
+  }
+  h5 {
+    font-weight: 500;
+    color: rgba(var(--text-color), 0.8);
+  }
 }
-#loading{
-    place-content: center;
-    text-align: center;
-    sm-spinner{
-        margin-bottom: 1.5rem;
+#loading {
+  place-content: center;
+  text-align: center;
+  sm-spinner {
+    margin-bottom: 1.5rem;
+  }
+}
+#homepage {
+  height: 100%;
+  display: grid;
+  grid-template-rows: auto 1fr auto;
+  grid-template-columns: minmax(0, 1fr);
+  grid-template-areas: "main-header" "subpages" "main-nav";
+}
+#main_nav {
+  grid-area: main-nav;
+  position: relative;
+  display: flex;
+}
+.nav-item {
+  display: flex;
+  align-items: center;
+  padding: 0.8rem;
+  border-radius: 0.5rem;
+  color: inherit;
+  transition: transform 0.3s;
+  user-select: none;
+  -webkit-tap-highlight-color: transparent;
+  &--active {
+    .icon {
+      fill: var(--accent-color);
     }
-}
-#homepage{
-    height: 100%;
-    display: grid;
-    grid-template-rows: auto 1fr auto;
-    grid-template-columns: minmax(0, 1fr);
-    grid-template-areas: 'main-header' 'subpages' 'main-nav';
-}
-#main_nav{
-    grid-area: main-nav;
-    position: relative;
-    display: flex;
-}
-.nav-item{
-    display: flex;
-    align-items: center;
-    padding: 0.8rem;
-    border-radius: 0.5rem;
-    color: inherit;
-    transition: transform 0.3s;
-    user-select: none;
-    -webkit-tap-highlight-color: transparent;
-    &--active{
-        .icon{
-            fill: var(--accent-color);
-        }
-        .nav-item__title{
-            color: var(--accent-color);
-        }
+    .nav-item__title {
+      color: var(--accent-color);
     }
+  }
 }
 #main_header {
-    grid-area: main-header;
-    padding: 1.5rem;
-    display: grid;
-    gap: 1rem;
-    align-items: center;
-    grid-template-columns: 1fr auto auto;
+  grid-area: main-header;
+  padding: 1.5rem;
+  display: grid;
+  gap: 1rem;
+  align-items: center;
+  grid-template-columns: 1fr auto auto;
 }
-#subpage_container{
-    grid-area: subpages;
-    overflow-y: auto;
+#subpage_container {
+  grid-area: subpages;
+  overflow-y: auto;
 }
-#dashboard{
-    display: grid;
-    gap: 1.5rem;
-    padding: 0 1.5rem;
+#dashboard {
+  display: grid;
+  gap: 1.5rem;
+  padding: 0 1.5rem;
 }
-#quick_actions_container{
+#quick_actions_container {
+  display: flex;
+  flex-wrap: wrap;
+  gap: 1.5rem;
+  margin: 2rem 0;
+}
+.quick-action {
+  display: flex;
+  flex-direction: column;
+  align-items: center;
+  &__icon {
+    padding: 1rem;
+    border-radius: 1rem;
+    background-color: var(--accent-color--light);
+    margin-bottom: 0.8rem;
+    .icon {
+      height: 1.5rem;
+      width: 1.5rem;
+      fill: var(--accent-color);
+    }
+  }
+  &__title {
+    font-size: 0.8rem;
+    font-weight: 500;
+  }
+}
+#recent_transactions_container {
+  display: grid;
+  margin: 1.5rem 0;
+  padding-bottom: 5rem;
+}
+.activity-card {
+  display: grid;
+  padding: 1rem 0;
+  gap: 0.4rem 1rem;
+  border-radius: 0.5rem;
+  align-items: flex-start;
+  color: inherit;
+  grid-template-columns: auto minmax(0, 1fr) auto;
+  &__icon {
     display: flex;
-    flex-wrap: wrap;
-    gap: 1.5rem;
-    margin: 2rem 0;
-}
-.quick-action{
-    display: flex;
-    flex-direction: column;
-    align-items: center;
-    &__icon{
-        padding: 1rem;
-        border-radius: 1rem;
-        background-color: var(--accent-color--light);
-        margin-bottom: 0.8rem;
-        .icon{
-            height: 1.5rem;
-            width: 1.5rem;
-            fill: var(--accent-color);
-        }
+    align-content: center;
+    justify-content: center;
+    padding: 0.5rem;
+    border-radius: 0.8rem;
+    background-color: var(--accent-color--light);
+    .icon {
+      height: 1.3rem;
+      width: 1.3rem;
+      fill: var(--accent-color);
     }
-    &__title{
-        font-size: 0.8rem;
-        font-weight: 500;
-    }
-}
-#recent_transactions_container{
-    display: grid;
-    margin: 1.5rem 0;
-    padding-bottom: 5rem;
-}
-.activity-card{
-    display: grid;
-    padding: 1rem 0;
-    gap: 0.4rem 1rem;
-    border-radius: 0.5rem;
-    align-items: flex-start;
-    color: inherit;
-    grid-template-columns: auto minmax(0, 1fr) auto;
-    &__icon{
-        display: flex;
-        align-content: center;
-        justify-content: center;
-        padding: 0.5rem;
-        border-radius: 0.8rem;
-        background-color: var(--accent-color--light);
-        .icon{
-            height: 1.3rem;
-            width: 1.3rem;
-            fill: var(--accent-color);
-        }
-    }
-    &__title{
-        font-size: 0.95rem;
-        &::first-letter{
-            text-transform: uppercase;
-        }
-        font-weight: 500;
-    }
-    &__time{
-        font-size: 0.8rem;
-        color: rgba(var(--text-color), 0.8);
+  }
+  &__title {
+    font-size: 0.95rem;
+    &::first-letter {
+      text-transform: uppercase;
     }
+    font-weight: 500;
+  }
+  &__time {
+    font-size: 0.8rem;
+    color: rgba(var(--text-color), 0.8);
+  }
 }
 #notifications,
-#history{
-    padding-bottom: 5rem;
-    .activity-card{
-        padding: 1rem 1.5rem;
-    }
+#history {
+  padding-bottom: 5rem;
+  .activity-card {
+    padding: 1rem 1.5rem;
+  }
 }
-#user_accounts{
-    margin-top: 1.5rem;
-    display: grid;
-    gap: 1rem;
-    padding-bottom: 5rem;
-    grid-template-columns: repeat(auto-fill, minmax(12rem, 1fr));
+#user_accounts {
+  margin-top: 1.5rem;
+  display: grid;
+  gap: 1rem;
+  padding-bottom: 5rem;
+  grid-template-columns: repeat(auto-fill, minmax(12rem, 1fr));
 }
-.activity-card--account{
-    user-select: none;
-    gap: 1.5rem;
-    padding: 1.5rem;
-    background-color: var(--foreground-color);
-    border: solid thin rgba(var(--text-color), 0.2);
-    grid-template-columns: minmax(0, 1fr);
-    .activity-card__icon{
-        padding: 0;
-        margin-bottom: 0.5rem;
-        background-color: transparent;
-    }
-    .activity-card__type{
-        font-size: 0.9rem;
-        color: rgba(var(--text-color), 0.6);
-        font-weight: 500;
-    }
-    .activity-card__amount{
-        margin-top: 0.3rem;
-        font-size: 1.3rem;
-    }
-}
-.activity-card--request{
-    grid-template-areas: 'icon . amount' 'icon time .';
-    .activity-card__icon{
-        grid-area: icon;
-    }
-    .activity-card__time{
-        grid-area: time;
-    }
-    .activity-card__amount{
-        grid-area: amount;
-        text-align: end;
-    }
-}
-.status-tag:not(:empty){
-    text-transform: uppercase;
-    letter-spacing: 0.05em;
-    font-size: 0.7rem;
-    border-radius: 0.2rem;
-    padding: 0.3rem 0.4rem;
+.activity-card--account {
+  user-select: none;
+  gap: 1.5rem;
+  padding: 1.5rem;
+  background-color: var(--foreground-color);
+  border: solid thin rgba(var(--text-color), 0.2);
+  grid-template-columns: minmax(0, 1fr);
+  .activity-card__icon {
+    padding: 0;
+    margin-bottom: 0.5rem;
+    background-color: transparent;
+  }
+  .activity-card__type {
+    font-size: 0.9rem;
+    color: rgba(var(--text-color), 0.6);
     font-weight: 500;
-    color: rgba($color: #000000, $alpha: 0.7);
-    .icon{
-        margin-right: 0.3rem;
-    }
-    &.success,
-    &.active{
-        color: var(--green);
-        background-color: rgb(0, 230, 118, 0.1);
-    }
-    &.failed{
-        color: var(--danger-color);
-        background-color: rgb(255, 75, 75, 0.1);
-    }
-    &.pending{
-        color: var(--yellow);
-        background-color: rgba(255, 252, 75, 0.1);
-    }
-    &.closed{
-        color: rgba(var(--text-color), 0.7);
-        background-color: rgba(var(--text-color), 0.06);
-    }
+  }
+  .activity-card__amount {
+    margin-top: 0.3rem;
+    font-size: 1.3rem;
+  }
 }
-.activity-card--response{
-    grid-template-areas: 'icon . time' 'icon description description';
-    .activity-card__icon{
-        grid-area: icon;
-    }
-    .activity-card__description{
-        grid-area: description;
-        font-size: 0.8rem;
-        color: rgba(var(--text-color), 0.8);
-    }
-    .activity-card__time{
-        grid-area: time;
-    }
+.activity-card--request {
+  grid-template-areas: "icon . amount" "icon time .";
+  .activity-card__icon {
+    grid-area: icon;
+  }
+  .activity-card__time {
+    grid-area: time;
+  }
+  .activity-card__amount {
+    grid-area: amount;
+    text-align: end;
+  }
 }
-.success{
-    .icon{
-        fill: var(--green);
-    }
+.status-tag:not(:empty) {
+  text-transform: uppercase;
+  letter-spacing: 0.05em;
+  font-size: 0.7rem;
+  border-radius: 0.2rem;
+  padding: 0.3rem 0.4rem;
+  font-weight: 500;
+  color: rgba($color: #000000, $alpha: 0.7);
+  .icon {
+    margin-right: 0.3rem;
+  }
+  &.success,
+  &.active {
+    color: var(--green);
+    background-color: rgb(0, 230, 118, 0.1);
+  }
+  &.failed {
+    color: var(--danger-color);
+    background-color: rgb(255, 75, 75, 0.1);
+  }
+  &.pending {
+    color: var(--yellow);
+    background-color: rgba(255, 252, 75, 0.1);
+  }
+  &.closed {
+    color: rgba(var(--text-color), 0.7);
+    background-color: rgba(var(--text-color), 0.06);
+  }
 }
-.pending{
-    .icon{
-        fill: var(--yellow);
-    }
+.activity-card--response {
+  grid-template-areas: "icon . time" "icon description description";
+  .activity-card__icon {
+    grid-area: icon;
+  }
+  .activity-card__description {
+    grid-area: description;
+    font-size: 0.8rem;
+    color: rgba(var(--text-color), 0.8);
+  }
+  .activity-card__time {
+    grid-area: time;
+  }
 }
-.failed{
-    .icon{
-        fill: var(--danger-color);
-    }
+.success {
+  .icon {
+    fill: var(--green);
+  }
 }
-#user_section{
-    display: grid;
-    align-content: flex-start;
-    gap: 2rem;
-    overflow-y: auto;
-    padding: 1.5rem;
-    grid-template-columns: minmax(0, 1fr);
-    h4{
-        margin-bottom: 1rem;
-    }
+.pending {
+  .icon {
+    fill: var(--yellow);
+  }
 }
-#account_chart_container{
-    display: flex;
-    flex-direction: column;
-    align-items: center;
-    height: 15rem;
-    padding-bottom: 3rem;
-    margin: 1.5rem 0;
+.failed {
+  .icon {
+    fill: var(--danger-color);
+  }
+}
+#user_section {
+  display: grid;
+  align-content: flex-start;
+  gap: 2rem;
+  overflow-y: auto;
+  padding: 1.5rem;
+  grid-template-columns: minmax(0, 1fr);
+  h4 {
+    margin-bottom: 1rem;
+  }
+}
+#account_chart_container {
+  display: flex;
+  flex-direction: column;
+  align-items: center;
+  height: 15rem;
+  padding-bottom: 3rem;
+  margin: 1.5rem 0;
 }
 #chart_legend {
-    display: flex;
-    flex-wrap: wrap;
-    justify-content: center;
-    align-items: center;
-    margin-bottom: 1rem;
+  display: flex;
+  flex-wrap: wrap;
+  justify-content: center;
+  align-items: center;
+  margin-bottom: 1rem;
 }
 
 .legend {
-    display: flex;
-    align-items: center;
-    font-size: 0.8rem;
-    margin-right: 1rem;
-    margin-bottom: 1rem;
+  display: flex;
+  align-items: center;
+  font-size: 0.8rem;
+  margin-right: 1rem;
+  margin-bottom: 1rem;
+  &::before {
+    content: "";
+    margin-right: 0.5rem;
+    width: 1rem;
+    height: 1rem;
+    border-radius: 25%;
+  }
+  &:nth-of-type(1) {
     &::before {
-        content: '';
-        margin-right: 0.5rem;
-        width: 1rem;
-        height: 1rem;
-        border-radius: 25%;
+      background-color: var(--green);
     }
-    &:nth-of-type(1){
-        &::before{
-            background-color: var(--green);
-        }
-    }
-    &:nth-of-type(2){
-        &::before{
-            background-color: rgb(255, 187, 97);
-        }
+  }
+  &:nth-of-type(2) {
+    &::before {
+      background-color: rgb(255, 187, 97);
     }
+  }
 }
-.balance-card{
-    display: grid;
-    grid-template-columns: auto 1fr;
-    grid-template-areas: 'icon .' 'icon .';
-    padding: 1rem 0;
-    align-items: center;
-    gap: 0.3rem 1rem;
-    border-radius: 0.5rem;
-    &__icon{
-        grid-area: icon;
-        display: flex;
-        align-content: center;
-        justify-content: center;
-        padding: 0.5rem;
-        border-radius: 0.8rem;
-        background-color: var(--accent-color--light);
-        .icon{
-            height: 1.3rem;
-            width: 1.3rem;
-            fill: var(--accent-color);
-        }
-    }
-    &__token{
-        font-size: 0.8rem;
-    }
-    &__amount{
-        font-size: 1rem;
-        font-weight: 700;
+.balance-card {
+  display: grid;
+  grid-template-columns: auto 1fr;
+  grid-template-areas: "icon ." "icon .";
+  padding: 1rem 0;
+  align-items: center;
+  gap: 0.3rem 1rem;
+  border-radius: 0.5rem;
+  &__icon {
+    grid-area: icon;
+    display: flex;
+    align-content: center;
+    justify-content: center;
+    padding: 0.5rem;
+    border-radius: 0.8rem;
+    background-color: var(--accent-color--light);
+    .icon {
+      height: 1.3rem;
+      width: 1.3rem;
+      fill: var(--accent-color);
     }
+  }
+  &__token {
+    font-size: 0.8rem;
+  }
+  &__amount {
+    font-size: 1rem;
+    font-weight: 700;
+  }
 }
 #transaction,
-#account{
-    grid-template-rows: auto 1fr;
-    gap: 1.5rem 0;
-    padding: 1.5rem 0;
-    align-content: flex-start;
+#account {
+  grid-template-rows: auto 1fr;
+  gap: 1.5rem 0;
+  padding: 1.5rem 0;
+  align-content: flex-start;
 }
 #transaction section,
-#account_details{
-    display: flex;
-    flex-direction: column;
+#account_details {
+  display: flex;
+  flex-direction: column;
 }
 #transaction_top,
-#account_top{
-    display: flex;
-    flex-direction: column;
-    justify-items: flex-start;
-    position: relative;
+#account_top {
+  display: flex;
+  flex-direction: column;
+  justify-items: flex-start;
+  position: relative;
 }
 #transaction_detail__icon,
-#account_detail__icon{
-    display: flex;
-    background-color: var(--accent-color);
-    border-radius: 40%;
-    padding: 0.8rem;
-    justify-self: flex-start;
-    align-self: flex-start;
-    .icon{
-        height: 1.5rem;
-        width: 1.5rem;
-        fill: rgba(var(--background-color), 1);
-    }
+#account_detail__icon {
+  display: flex;
+  background-color: var(--accent-color);
+  border-radius: 40%;
+  padding: 0.8rem;
+  justify-self: flex-start;
+  align-self: flex-start;
+  .icon {
+    height: 1.5rem;
+    width: 1.5rem;
+    fill: rgba(var(--background-color), 1);
+  }
 }
 #transaction_detail__amount,
-#account_detail__amount{
-    display: flex;
-    font-size: 1.8rem;
-    font-weight: 700;
-    &::before{
-        font-weight: 500;
-        font-size: 1rem;
-        align-self: flex-start;
-        content: '₹';
-    }
+#account_detail__amount {
+  display: flex;
+  font-size: 1.8rem;
+  font-weight: 700;
 }
-#transaction_detail__time,
-#account_detail__time{
-    font-size: 0.8rem;
-    color: rgba(var(--text-color), 0.8);
-    margin-right: 1rem;
+#transaction_detail__time {
+  font-size: 0.8rem;
+  color: rgba(var(--text-color), 0.8);
+  margin-right: 1rem;
 }
 
-#account_process{
-    display: grid;
-    align-content: flex-start;
-    gap: 2rem;
+#account_process {
+  display: grid;
+  align-content: flex-start;
+  gap: 2rem;
 }
-#account_process__type{
-    margin-top: 1.5rem;
-    font-size: 0.9rem;
-    font-weight: 500;
-    color: rgba(var(--text-color), 0.8);
-}
-#account_process__amount{
-    font-size: 1.5rem;
-}
-.account-step{
-    grid-template-columns: auto minmax(0, 1fr);
-    grid-template-areas: 'step-icon step-title' 'step-icon step-description';
-    gap: 0.3rem 0.8rem;
-    sm-spinner{
-        --height: 1rem;
-        --width: 1rem;
-    }
-    &:not(:last-of-type)::after{
-        position: relative;
-        content: '';
-        height: 3rem;
-        width: 0.1rem;
-        margin: 0.5rem 0 1rem 0;
-        margin-left: 0.7rem;
-        background-color: var(--green);
-    }
-    .step__icon{
-        grid-area: step-icon;
-    }
-    .icon{
-        height: 1.5rem;
-        width: 1.5rem;
-    }
-    &:not(.loading){
-        .step__title{
-            grid-area: step-title;
-            font-weight: 500;
-            font-size: 0.9rem;
-            padding: 0.2rem 0;
-        }
-    }
-    .step__description{
-        grid-area: step-description;
-        font-size: 0.8rem;
+.account-step {
+  opacity: 0;
+  grid-template-columns: auto minmax(0, 1fr);
+  grid-template-areas: "step-icon step-title" ". step-description";
+  gap: 0.3rem 0.8rem;
+  animation: slide-down 0.3s forwards;
+  &:nth-of-type(2) {
+    animation-delay: 0.1s;
+  }
+  &:nth-of-type(3) {
+    animation-delay: 0.2s;
+  }
+  &:nth-of-type(4) {
+    animation-delay: 0.3s;
+  }
+  sm-spinner {
+    --height: 1rem;
+    --width: 1rem;
+  }
+  &:not(:last-of-type)::after {
+    position: relative;
+    content: "";
+    height: 3rem;
+    width: 0.1rem;
+    margin: 0.5rem 0 1rem 0;
+    margin-left: 0.7rem;
+    background-color: var(--green);
+  }
+  .step__icon {
+    grid-area: step-icon;
+  }
+  .icon {
+    height: 1.5rem;
+    width: 1.5rem;
+  }
+  &:not(.loading) {
+    .step__title {
+      text-transform: capitalize;
+      grid-area: step-title;
+      font-weight: 500;
+      font-size: 0.9rem;
+      padding: 0.2rem 0;
     }
+  }
+  .step__description {
+    grid-area: step-description;
+    font-size: 0.8rem;
+  }
 }
 @keyframes slide-down {
-    from{
-        opacity: 0;
-        transform: translateY(-1rem);
-    }
-    to{
-        opacity: 1;
-        transform: none;
-    }
+  from {
+    opacity: 0;
+    transform: translateY(-1rem);
+  }
+  to {
+    opacity: 1;
+    transform: none;
+  }
 }
 @media screen and (max-width: 640px) {
-    sm-button{
-        --padding: 1rem;
-    }
-    #dashboard{
-        padding: 0 1.5rem;
-    }
-    #main_nav{
-        border-radius: 1rem 1rem 0 0;
-        background-color: var(--foreground-color);
-    }
-    .nav-item{
-        flex: 1;
-        flex-direction: column;
-        &__title{
-            display: flex;
-            font-size: 0.7rem;
-            font-weight: 500;
-            color: rgba(var(--text-color), 0.8);
-            margin-top: 0.3rem;
-        }
-    }
-    #transaction_action_button,
-    #account_action_button{
-        margin-top: auto;
+  sm-button {
+    --padding: 1rem;
+  }
+  #dashboard {
+    padding: 0 1.5rem;
+  }
+  #main_nav {
+    border-radius: 1rem 1rem 0 0;
+    background-color: var(--foreground-color);
+  }
+  .nav-item {
+    flex: 1;
+    flex-direction: column;
+    &__title {
+      display: flex;
+      font-size: 0.7rem;
+      font-weight: 500;
+      color: rgba(var(--text-color), 0.8);
+      margin-top: 0.3rem;
     }
+  }
+  #transaction_action_button,
+  #account_action_button {
+    margin-top: auto;
+  }
+  #account_process {
+    margin-top: 3rem;
+  }
 }
 @media screen and (min-width: 640px) {
-    #confirmation_popup,
-    #prompt_popup {
-        --width: 24rem;
+  #confirmation_popup,
+  #prompt_popup {
+    --width: 24rem;
+  }
+  .page-layout {
+    grid-template-columns: 1fr 90vw 1fr;
+  }
+  #homepage {
+    background-color: var(--foreground-color);
+    grid-template-rows: auto 1fr;
+    grid-template-columns: auto minmax(0, 1fr);
+    grid-template-areas: "main-header main-header user-section" "main-nav subpages user-section";
+  }
+  #main_nav {
+    flex-direction: column;
+    padding: 0 1rem;
+    &::after {
+      position: absolute;
+      right: 0;
+      content: "";
+      width: 1px;
+      background-color: rgba(var(--text-color), 0.3);
+      height: 80%;
     }
-    .page-layout{
-        grid-template-columns: 1fr 90vw 1fr;
+  }
+  .nav-item {
+    &--active {
+      background-color: var(--accent-color--light);
     }
-    #homepage{
-        background-color: var(--foreground-color);
-        grid-template-rows: auto 1fr;
-        grid-template-columns: auto minmax(0, 1fr);
-        grid-template-areas: 'main-header main-header user-section' 'main-nav subpages user-section';
+    &:not(:last-of-type) {
+      margin-bottom: 0.5rem;
     }
-    #main_nav{
-        flex-direction: column;
-        padding: 0 1rem;
-        &::after{
-            position: absolute;
-            right: 0;
-            content: '';
-            width: 1px;
-            background-color: rgba(var(--text-color), 0.3);
-            height: 80%;
-        }
+    &:last-of-type {
+      margin-top: auto;
+      margin-bottom: 1.5rem;
     }
-    .nav-item{
-        &--active{
-            background-color: var(--accent-color--light);
-        }
-        &:not(:last-of-type){
-            margin-bottom: 0.5rem;
-        }
-        &:last-of-type{
-            margin-top: auto;
-            margin-bottom: 1.5rem;
-        }
-        &__title{
-            display: none;
-        }
+    &__title {
+      display: none;
     }
+  }
 
-    #user_section{
-        grid-area: user-section;
-        background-color: rgba(var(--background-color), 1);
-    }
-    #transaction_top,
-    #account_top{
-        overflow: hidden;
-        padding: 1.8rem;
-        border-radius: 0.5rem;
-        border: solid thin rgba(var(--text-color), 0.2);
-        // background-color: var(--foreground-color);
-        // box-shadow: 0 0 0.1rem rgba(0, 0, 0, 0.1), 0 1rem 1.5rem -0.8rem rgba(0, 0, 0, 0.1);
-    }
-    #transaction_detail__status{
-        justify-self: flex-start;
-    }
-    #transaction_detail__icon{
-        justify-self: flex-start;
-    }
+  #user_section {
+    grid-area: user-section;
+    background-color: rgba(var(--background-color), 1);
+  }
+  #transaction_top,
+  #account_top,
+  #account_process {
+    overflow: hidden;
+    padding: 1.8rem;
+    border-radius: 0.5rem;
+    border: solid thin rgba(var(--text-color), 0.2);
+    // background-color: var(--foreground-color);
+    // box-shadow: 0 0 0.1rem rgba(0, 0, 0, 0.1), 0 1rem 1.5rem -0.8rem rgba(0, 0, 0, 0.1);
+  }
+  #transaction_detail__status {
+    justify-self: flex-start;
+  }
+  #transaction_detail__icon {
+    justify-self: flex-start;
+  }
 }
 @media screen and (max-width: 1024px) {
-    #user_section{
-        position: fixed;
-        background-color: rgba(var(--background-color), 1);
-        z-index: 2;
-        transform: translateX(-100%);
-    }
+  #user_section {
+    position: fixed;
+    background-color: rgba(var(--background-color), 1);
+    z-index: 2;
+    transform: translateX(-100%);
+  }
 }
 @media screen and (min-width: 1024px) {
-    .page-layout{
-        grid-template-columns: 1fr 80vw 1fr;
-    }
-    .card{
-        padding: 2rem;
-    }
-    #homepage{
-        grid-template-columns: 14rem minmax(0, 1fr) 24rem;
-    }
-    .nav-item{
-        &__title{
-            display: flex;
-            font-size: 0.9rem;
-            font-weight: 500;
-            color: rgba(var(--text-color), 0.8);
-            margin-left: 0.5rem;
-        }
-    }
-    #transaction section,
-    #account_details{
-        display: grid;
-        grid-template-columns: 18rem minmax(0, 1fr);
+  .page-layout {
+    grid-template-columns: 1fr 80vw 1fr;
+  }
+  .card {
+    padding: 2rem;
+  }
+  #homepage {
+    grid-template-columns: 14rem minmax(0, 1fr) 24rem;
+  }
+  .nav-item {
+    &__title {
+      display: flex;
+      font-size: 0.9rem;
+      font-weight: 500;
+      color: rgba(var(--text-color), 0.8);
+      margin-left: 0.5rem;
     }
+  }
+  #transaction section,
+  #account_details {
+    display: grid;
+    gap: 1.5rem;
+    grid-template-columns: 18rem minmax(0, 1fr);
+  }
 }
 @media screen and (min-width: 1920px) {
-    .page-layout{
-        grid-template-columns: 1fr 70vw 1fr;
-    }
+  .page-layout {
+    grid-template-columns: 1fr 70vw 1fr;
+  }
 }
 @media (any-hover: hover) {
-    ::-webkit-scrollbar {
-        width: 0.5rem;
-        height: 0.5rem;
-    }
+  ::-webkit-scrollbar {
+    width: 0.5rem;
+    height: 0.5rem;
+  }
 
-    ::-webkit-scrollbar-thumb {
-        background: rgba(var(--text-color), 0.3);
-        border-radius: 1rem;
+  ::-webkit-scrollbar-thumb {
+    background: rgba(var(--text-color), 0.3);
+    border-radius: 1rem;
 
-        &:hover {
-            background: rgba(var(--text-color), 0.5);
-        }
+    &:hover {
+      background: rgba(var(--text-color), 0.5);
     }
-    .nav-item,
-    .interact{
-        transition: background-color 0.3s, transform 0.3s;
-        &:hover{
-            background-color: var(--accent-color--light);
-        }
+  }
+  .nav-item,
+  .interact {
+    transition: background-color 0.3s, transform 0.3s;
+    &:hover {
+      background-color: var(--accent-color--light);
     }
-}
\ No newline at end of file
+  }
+}
diff --git a/index.html b/index.html
index 64453dd..2f5a0da 100644
--- a/index.html
+++ b/index.html
@@ -1,5 +1,6 @@
 <!DOCTYPE html>
 <html lang="en">
+
 <head>
     <meta charset="UTF-8">
     <meta http-equiv="X-UA-Compatible" content="IE=edge">
@@ -18,7 +19,7 @@
 
             //Required for blockchain API operators
             apiURL: {
-                FLO: [ 'https://livenet.flocha.in/', 'https://flosight.duckdns.org/'],
+                FLO: ['https://livenet.flocha.in/', 'https://flosight.duckdns.org/'],
                 FLO_TEST: ['https://testnet-flosight.duckdns.org/', 'https://testnet.flocha.in/']
             },
             tokenURL: "https://ranchimallflo.duckdns.org/",
@@ -36,7 +37,9 @@
         }
     </script>
     <script src="components.js" defer></script>
-    <script defer src="https://cdnjs.cloudflare.com/ajax/libs/Chart.js/3.5.1/chart.min.js" integrity="sha512-Wt1bJGtlnMtGP0dqNFH1xlkLBNpEodaiQ8ZN5JLA5wpc1sUlk/O5uuOMNgvzddzkpvZ9GLyYNa8w2s7rqiTk5Q==" crossorigin="anonymous" referrerpolicy="no-referrer"></script>
+    <script defer src="https://cdnjs.cloudflare.com/ajax/libs/Chart.js/3.5.1/chart.min.js"
+        integrity="sha512-Wt1bJGtlnMtGP0dqNFH1xlkLBNpEodaiQ8ZN5JLA5wpc1sUlk/O5uuOMNgvzddzkpvZ9GLyYNa8w2s7rqiTk5Q=="
+        crossorigin="anonymous" referrerpolicy="no-referrer"></script>
 </head>
 
 <body onload="onLoadStartUp()">
@@ -67,8 +70,8 @@
             <h1 class="h2">Sign In</h1>
             <p>Welcome back, glad to see you again</p>
             <sm-form>
-                <sm-input id="private_key_field" type="password" placeholder="FLO private key" error-text="Private key is invalid"
-                data-private-key required></sm-input>
+                <sm-input id="private_key_field" type="password" placeholder="FLO private key"
+                    error-text="Private key is invalid" data-private-key required></sm-input>
                 <sm-button id="sign_in_button" variant="primary" disabled>Sign In</sm-button>
             </sm-form>
             <p>
@@ -113,39 +116,46 @@
             <theme-toggle></theme-toggle>
             <button class="icon-button">
                 <svg xmlns="http://www.w3.org/2000/svg" class="icon" viewBox="0 0 20 20" fill="currentColor">
-                    <path fill-rule="evenodd" d="M18 10a8 8 0 11-16 0 8 8 0 0116 0zm-6-3a2 2 0 11-4 0 2 2 0 014 0zm-2 4a5 5 0 00-4.546 2.916A5.986 5.986 0 0010 16a5.986 5.986 0 004.546-2.084A5 5 0 0010 11z" clip-rule="evenodd" />
+                    <path fill-rule="evenodd"
+                        d="M18 10a8 8 0 11-16 0 8 8 0 0116 0zm-6-3a2 2 0 11-4 0 2 2 0 014 0zm-2 4a5 5 0 00-4.546 2.916A5.986 5.986 0 0010 16a5.986 5.986 0 004.546-2.084A5 5 0 0010 11z"
+                        clip-rule="evenodd" />
                 </svg>
             </button>
         </header>
         <nav id="main_nav">
             <a href="#/homepage/dashboard" class="nav-item nav-item--active">
                 <svg xmlns="http://www.w3.org/2000/svg" class="icon" viewBox="0 0 20 20" fill="currentColor">
-                    <path d="M3 4a1 1 0 011-1h12a1 1 0 011 1v2a1 1 0 01-1 1H4a1 1 0 01-1-1V4zM3 10a1 1 0 011-1h6a1 1 0 011 1v6a1 1 0 01-1 1H4a1 1 0 01-1-1v-6zM14 9a1 1 0 00-1 1v6a1 1 0 001 1h2a1 1 0 001-1v-6a1 1 0 00-1-1h-2z" />
-                  </svg>
+                    <path
+                        d="M3 4a1 1 0 011-1h12a1 1 0 011 1v2a1 1 0 01-1 1H4a1 1 0 01-1-1V4zM3 10a1 1 0 011-1h6a1 1 0 011 1v6a1 1 0 01-1 1H4a1 1 0 01-1-1v-6zM14 9a1 1 0 00-1 1v6a1 1 0 001 1h2a1 1 0 001-1v-6a1 1 0 00-1-1h-2z" />
+                </svg>
                 <span class="nav-item__title">
                     Dashboard
                 </span>
             </a>
             <a href="#/homepage/notifications" class="nav-item">
                 <svg xmlns="http://www.w3.org/2000/svg" class="icon" viewBox="0 0 20 20" fill="currentColor">
-                    <path d="M10 2a6 6 0 00-6 6v3.586l-.707.707A1 1 0 004 14h12a1 1 0 00.707-1.707L16 11.586V8a6 6 0 00-6-6zM10 18a3 3 0 01-3-3h6a3 3 0 01-3 3z" />
-                  </svg>
+                    <path
+                        d="M10 2a6 6 0 00-6 6v3.586l-.707.707A1 1 0 004 14h12a1 1 0 00.707-1.707L16 11.586V8a6 6 0 00-6-6zM10 18a3 3 0 01-3-3h6a3 3 0 01-3 3z" />
+                </svg>
                 <span class="nav-item__title">
                     Notifications
                 </span>
             </a>
             <a href="#/homepage/history" class="nav-item">
                 <svg xmlns="http://www.w3.org/2000/svg" class="icon" viewBox="0 0 20 20" fill="currentColor">
-                    <path d="M5 12a1 1 0 102 0V6.414l1.293 1.293a1 1 0 001.414-1.414l-3-3a1 1 0 00-1.414 0l-3 3a1 1 0 001.414 1.414L5 6.414V12zM15 8a1 1 0 10-2 0v5.586l-1.293-1.293a1 1 0 00-1.414 1.414l3 3a1 1 0 001.414 0l3-3a1 1 0 00-1.414-1.414L15 13.586V8z" />
-                  </svg>
+                    <path
+                        d="M5 12a1 1 0 102 0V6.414l1.293 1.293a1 1 0 001.414-1.414l-3-3a1 1 0 00-1.414 0l-3 3a1 1 0 001.414 1.414L5 6.414V12zM15 8a1 1 0 10-2 0v5.586l-1.293-1.293a1 1 0 00-1.414 1.414l3 3a1 1 0 001.414 0l3-3a1 1 0 00-1.414-1.414L15 13.586V8z" />
+                </svg>
                 <span class="nav-item__title">
                     History
                 </span>
             </a>
             <a href="#/homepage/settings" class="nav-item">
                 <svg xmlns="http://www.w3.org/2000/svg" class="icon" viewBox="0 0 20 20" fill="currentColor">
-                    <path fill-rule="evenodd" d="M11.49 3.17c-.38-1.56-2.6-1.56-2.98 0a1.532 1.532 0 01-2.286.948c-1.372-.836-2.942.734-2.106 2.106.54.886.061 2.042-.947 2.287-1.561.379-1.561 2.6 0 2.978a1.532 1.532 0 01.947 2.287c-.836 1.372.734 2.942 2.106 2.106a1.532 1.532 0 012.287.947c.379 1.561 2.6 1.561 2.978 0a1.533 1.533 0 012.287-.947c1.372.836 2.942-.734 2.106-2.106a1.533 1.533 0 01.947-2.287c1.561-.379 1.561-2.6 0-2.978a1.532 1.532 0 01-.947-2.287c.836-1.372-.734-2.942-2.106-2.106a1.532 1.532 0 01-2.287-.947zM10 13a3 3 0 100-6 3 3 0 000 6z" clip-rule="evenodd" />
-                  </svg>
+                    <path fill-rule="evenodd"
+                        d="M11.49 3.17c-.38-1.56-2.6-1.56-2.98 0a1.532 1.532 0 01-2.286.948c-1.372-.836-2.942.734-2.106 2.106.54.886.061 2.042-.947 2.287-1.561.379-1.561 2.6 0 2.978a1.532 1.532 0 01.947 2.287c-.836 1.372.734 2.942 2.106 2.106a1.532 1.532 0 012.287.947c.379 1.561 2.6 1.561 2.978 0a1.533 1.533 0 012.287-.947c1.372.836 2.942-.734 2.106-2.106a1.533 1.533 0 01.947-2.287c1.561-.379 1.561-2.6 0-2.978a1.532 1.532 0 01-.947-2.287c.836-1.372-.734-2.942-2.106-2.106a1.532 1.532 0 01-2.287-.947zM10 13a3 3 0 100-6 3 3 0 000 6z"
+                        clip-rule="evenodd" />
+                </svg>
                 <span class="nav-item__title">
                     Settings
                 </span>
@@ -155,21 +165,36 @@
             <div id="dashboard" class="sub-page">
                 <section>
                     <h4 class="flex align-center">
-                        <svg xmlns="http://www.w3.org/2000/svg" class="icon button__icon--left" viewBox="0 0 20 20" fill="currentColor">
-                            <path fill-rule="evenodd" d="M11.3 1.046A1 1 0 0112 2v5h4a1 1 0 01.82 1.573l-7 10A1 1 0 018 18v-5H4a1 1 0 01-.82-1.573l7-10a1 1 0 011.12-.38z" clip-rule="evenodd" />
-                          </svg>
-                          Quick actions
+                        <svg xmlns="http://www.w3.org/2000/svg" class="icon button__icon--left" viewBox="0 0 20 20"
+                            fill="currentColor">
+                            <path fill-rule="evenodd"
+                                d="M11.3 1.046A1 1 0 0112 2v5h4a1 1 0 01.82 1.573l-7 10A1 1 0 018 18v-5H4a1 1 0 01-.82-1.573l7-10a1 1 0 011.12-.38z"
+                                clip-rule="evenodd" />
+                        </svg>
+                        Quick actions
                     </h4>
                     <div id="quick_actions_container">
                         <button class="quick-action">
                             <div class="quick-action__icon">
-                                <svg class="icon" xmlns="http://www.w3.org/2000/svg" enable-background="new 0 0 24 24" height="24px" viewBox="0 0 24 24" width="24px" fill="#000000"><rect fill="none" height="24" width="24"/><g><path d="M19.83,7.5l-2.27-2.27c0.07-0.42,0.18-0.81,0.32-1.15C17.96,3.9,18,3.71,18,3.5C18,2.67,17.33,2,16.5,2 c-1.64,0-3.09,0.79-4,2l-5,0C4.46,4,2,6.46,2,9.5S4.5,21,4.5,21l5.5,0v-2h2v2l5.5,0l1.68-5.59L22,14.47V7.5H19.83z M13,9H8V7h5V9z M16,11c-0.55,0-1-0.45-1-1c0-0.55,0.45-1,1-1s1,0.45,1,1C17,10.55,16.55,11,16,11z"/></g></svg>
+                                <svg class="icon" xmlns="http://www.w3.org/2000/svg" enable-background="new 0 0 24 24"
+                                    height="24px" viewBox="0 0 24 24" width="24px" fill="#000000">
+                                    <rect fill="none" height="24" width="24" />
+                                    <g>
+                                        <path
+                                            d="M19.83,7.5l-2.27-2.27c0.07-0.42,0.18-0.81,0.32-1.15C17.96,3.9,18,3.71,18,3.5C18,2.67,17.33,2,16.5,2 c-1.64,0-3.09,0.79-4,2l-5,0C4.46,4,2,6.46,2,9.5S4.5,21,4.5,21l5.5,0v-2h2v2l5.5,0l1.68-5.59L22,14.47V7.5H19.83z M13,9H8V7h5V9z M16,11c-0.55,0-1-0.45-1-1c0-0.55,0.45-1,1-1s1,0.45,1,1C17,10.55,16.55,11,16,11z" />
+                                    </g>
+                                </svg>
                             </div>
                             <span class="quick-action__title">Make deposit</span>
                         </button>
                         <button class="quick-action">
                             <div class="quick-action__icon">
-                                <svg class="icon" xmlns="http://www.w3.org/2000/svg" viewBox="0 0 24 24"><path d="M12.65,8.5H10.42a5.18,5.18,0,0,0-4,1.95L3.75,13.74a5,5,0,0,0-.68,5.31l0,0h0a5.07,5.07,0,0,0,4.5,2.73h7.88A5.08,5.08,0,0,0,20,19.05h0a5.39,5.39,0,0,0,.43-1.2,4.91,4.91,0,0,0-1-4.06l-2.66-3.34A5.17,5.17,0,0,0,12.65,8.5Z"/><path d="M9.71,6.59h3.94A2.94,2.94,0,0,0,16,5.39h0a1.13,1.13,0,0,0-.23-1.57,1.11,1.11,0,0,0-.95-.18h0a1.2,1.2,0,0,1-.92-.18l-.28-.21a3.64,3.64,0,0,0-4.22,0h0a1.18,1.18,0,0,1-1,.16L8.2,3.35a1.13,1.13,0,0,0-1.36.84A1.17,1.17,0,0,0,7,5H7A3.18,3.18,0,0,0,9.71,6.59Z"/></svg>
+                                <svg class="icon" xmlns="http://www.w3.org/2000/svg" viewBox="0 0 24 24">
+                                    <path
+                                        d="M12.65,8.5H10.42a5.18,5.18,0,0,0-4,1.95L3.75,13.74a5,5,0,0,0-.68,5.31l0,0h0a5.07,5.07,0,0,0,4.5,2.73h7.88A5.08,5.08,0,0,0,20,19.05h0a5.39,5.39,0,0,0,.43-1.2,4.91,4.91,0,0,0-1-4.06l-2.66-3.34A5.17,5.17,0,0,0,12.65,8.5Z" />
+                                    <path
+                                        d="M9.71,6.59h3.94A2.94,2.94,0,0,0,16,5.39h0a1.13,1.13,0,0,0-.23-1.57,1.11,1.11,0,0,0-.95-.18h0a1.2,1.2,0,0,1-.92-.18l-.28-.21a3.64,3.64,0,0,0-4.22,0h0a1.18,1.18,0,0,1-1,.16L8.2,3.35a1.13,1.13,0,0,0-1.36.84A1.17,1.17,0,0,0,7,5H7A3.18,3.18,0,0,0,9.71,6.59Z" />
+                                </svg>
                             </div>
                             <span class="quick-action__title">Get loan</span>
                         </button>
@@ -178,10 +203,13 @@
                 <section>
                     <div class="flex align-center space-between">
                         <h4 class="flex align-center">
-                            <svg xmlns="http://www.w3.org/2000/svg" class="icon button__icon--left" viewBox="0 0 20 20" fill="currentColor">
-                                <path fill-rule="evenodd" d="M10 18a8 8 0 100-16 8 8 0 000 16zm1-12a1 1 0 10-2 0v4a1 1 0 00.293.707l2.828 2.829a1 1 0 101.415-1.415L11 9.586V6z" clip-rule="evenodd" />
-                              </svg>
-                              Accounts
+                            <svg xmlns="http://www.w3.org/2000/svg" class="icon button__icon--left" viewBox="0 0 20 20"
+                                fill="currentColor">
+                                <path fill-rule="evenodd"
+                                    d="M10 18a8 8 0 100-16 8 8 0 000 16zm1-12a1 1 0 10-2 0v4a1 1 0 00.293.707l2.828 2.829a1 1 0 101.415-1.415L11 9.586V6z"
+                                    clip-rule="evenodd" />
+                            </svg>
+                            Accounts
                         </h4>
                     </div>
                     <div id="user_accounts" class="observe-empty-state"></div>
@@ -203,10 +231,11 @@
         <section id="user_section">
             <div>
                 <h4 class="flex align-center">
-                    <svg xmlns="http://www.w3.org/2000/svg" class="icon button__icon--left" viewBox="0 0 20 20" fill="currentColor">
+                    <svg xmlns="http://www.w3.org/2000/svg" class="icon button__icon--left" viewBox="0 0 20 20"
+                        fill="currentColor">
                         <path d="M2 10a8 8 0 018-8v8h8a8 8 0 11-16 0z" />
                         <path d="M12 2.252A8.014 8.014 0 0117.748 8H12V2.252z" />
-                      </svg>
+                    </svg>
                     Account summary
                     <button class="button justify-right" onclick="refreshBalance()">
                         Refresh
@@ -221,14 +250,26 @@
                 </div>
                 <div class="balance-card">
                     <div class="balance-card__icon">
-                        <svg class="icon" xmlns="http://www.w3.org/2000/svg" enable-background="new 0 0 24 24" height="24px" viewBox="0 0 24 24" width="24px" fill="#000000"><rect fill="none" height="24" width="24"/><g><path d="M19.83,7.5l-2.27-2.27c0.07-0.42,0.18-0.81,0.32-1.15C17.96,3.9,18,3.71,18,3.5C18,2.67,17.33,2,16.5,2 c-1.64,0-3.09,0.79-4,2l-5,0C4.46,4,2,6.46,2,9.5S4.5,21,4.5,21l5.5,0v-2h2v2l5.5,0l1.68-5.59L22,14.47V7.5H19.83z M13,9H8V7h5V9z M16,11c-0.55,0-1-0.45-1-1c0-0.55,0.45-1,1-1s1,0.45,1,1C17,10.55,16.55,11,16,11z"/></g></svg>
+                        <svg class="icon" xmlns="http://www.w3.org/2000/svg" enable-background="new 0 0 24 24"
+                            height="24px" viewBox="0 0 24 24" width="24px" fill="#000000">
+                            <rect fill="none" height="24" width="24" />
+                            <g>
+                                <path
+                                    d="M19.83,7.5l-2.27-2.27c0.07-0.42,0.18-0.81,0.32-1.15C17.96,3.9,18,3.71,18,3.5C18,2.67,17.33,2,16.5,2 c-1.64,0-3.09,0.79-4,2l-5,0C4.46,4,2,6.46,2,9.5S4.5,21,4.5,21l5.5,0v-2h2v2l5.5,0l1.68-5.59L22,14.47V7.5H19.83z M13,9H8V7h5V9z M16,11c-0.55,0-1-0.45-1-1c0-0.55,0.45-1,1-1s1,0.45,1,1C17,10.55,16.55,11,16,11z" />
+                            </g>
+                        </svg>
                     </div>
                     <div class="balance-card__token">Total deposit</div>
                     <div id="total_deposit" class="balance-card__amount"></div>
                 </div>
                 <div class="balance-card">
                     <div class="balance-card__icon">
-                        <svg class="icon" xmlns="http://www.w3.org/2000/svg" viewBox="0 0 24 24"><path d="M12.65,8.5H10.42a5.18,5.18,0,0,0-4,1.95L3.75,13.74a5,5,0,0,0-.68,5.31l0,0h0a5.07,5.07,0,0,0,4.5,2.73h7.88A5.08,5.08,0,0,0,20,19.05h0a5.39,5.39,0,0,0,.43-1.2,4.91,4.91,0,0,0-1-4.06l-2.66-3.34A5.17,5.17,0,0,0,12.65,8.5Z"/><path d="M9.71,6.59h3.94A2.94,2.94,0,0,0,16,5.39h0a1.13,1.13,0,0,0-.23-1.57,1.11,1.11,0,0,0-.95-.18h0a1.2,1.2,0,0,1-.92-.18l-.28-.21a3.64,3.64,0,0,0-4.22,0h0a1.18,1.18,0,0,1-1,.16L8.2,3.35a1.13,1.13,0,0,0-1.36.84A1.17,1.17,0,0,0,7,5H7A3.18,3.18,0,0,0,9.71,6.59Z"/></svg>
+                        <svg class="icon" xmlns="http://www.w3.org/2000/svg" viewBox="0 0 24 24">
+                            <path
+                                d="M12.65,8.5H10.42a5.18,5.18,0,0,0-4,1.95L3.75,13.74a5,5,0,0,0-.68,5.31l0,0h0a5.07,5.07,0,0,0,4.5,2.73h7.88A5.08,5.08,0,0,0,20,19.05h0a5.39,5.39,0,0,0,.43-1.2,4.91,4.91,0,0,0-1-4.06l-2.66-3.34A5.17,5.17,0,0,0,12.65,8.5Z" />
+                            <path
+                                d="M9.71,6.59h3.94A2.94,2.94,0,0,0,16,5.39h0a1.13,1.13,0,0,0-.23-1.57,1.11,1.11,0,0,0-.95-.18h0a1.2,1.2,0,0,1-.92-.18l-.28-.21a3.64,3.64,0,0,0-4.22,0h0a1.18,1.18,0,0,1-1,.16L8.2,3.35a1.13,1.13,0,0,0-1.36.84A1.17,1.17,0,0,0,7,5H7A3.18,3.18,0,0,0,9.71,6.59Z" />
+                        </svg>
                     </div>
                     <div class="balance-card__token">Total loan</div>
                     <div id="total_loan" class="balance-card__amount"></div>
@@ -236,15 +277,20 @@
             </div>
             <div>
                 <h4 class="flex align-center">
-                    <svg xmlns="http://www.w3.org/2000/svg" class="icon button__icon--left" viewBox="0 0 20 20" fill="currentColor">
-                        <path fill-rule="evenodd" d="M4 4a2 2 0 00-2 2v4a2 2 0 002 2V6h10a2 2 0 00-2-2H4zm2 6a2 2 0 012-2h8a2 2 0 012 2v4a2 2 0 01-2 2H8a2 2 0 01-2-2v-4zm6 4a2 2 0 100-4 2 2 0 000 4z" clip-rule="evenodd" />
+                    <svg xmlns="http://www.w3.org/2000/svg" class="icon button__icon--left" viewBox="0 0 20 20"
+                        fill="currentColor">
+                        <path fill-rule="evenodd"
+                            d="M4 4a2 2 0 00-2 2v4a2 2 0 002 2V6h10a2 2 0 00-2-2H4zm2 6a2 2 0 012-2h8a2 2 0 012 2v4a2 2 0 01-2 2H8a2 2 0 01-2-2v-4zm6 4a2 2 0 100-4 2 2 0 000 4z"
+                            clip-rule="evenodd" />
                     </svg>
                     My balance
                 </h4>
                 <div class="balance-card">
                     <div class="balance-card__icon">
                         <svg xmlns="http://www.w3.org/2000/svg" class="icon" viewBox="0 0 20 20" fill="currentColor">
-                            <path fill-rule="evenodd" d="M10 18a8 8 0 100-16 8 8 0 000 16zM7 5a1 1 0 100 2h1a2 2 0 011.732 1H7a1 1 0 100 2h2.732A2 2 0 018 11H7a1 1 0 00-.707 1.707l3 3a1 1 0 001.414-1.414l-1.483-1.484A4.008 4.008 0 0011.874 10H13a1 1 0 100-2h-1.126a3.976 3.976 0 00-.41-1H13a1 1 0 100-2H7z" clip-rule="evenodd" />
+                            <path fill-rule="evenodd"
+                                d="M10 18a8 8 0 100-16 8 8 0 000 16zM7 5a1 1 0 100 2h1a2 2 0 011.732 1H7a1 1 0 100 2h2.732A2 2 0 018 11H7a1 1 0 00-.707 1.707l3 3a1 1 0 001.414-1.414l-1.483-1.484A4.008 4.008 0 0011.874 10H13a1 1 0 100-2h-1.126a3.976 3.976 0 00-.41-1H13a1 1 0 100-2H7z"
+                                clip-rule="evenodd" />
                         </svg>
                     </div>
                     <div class="balance-card__token">Rupee</div>
@@ -252,7 +298,10 @@
                 </div>
                 <div class="balance-card">
                     <div class="balance-card__icon">
-                        <svg class="icon" xmlns="http://www.w3.org/2000/svg" viewBox="0 0 24 24"><path d="M16.36,15.39c1.83,0,4.26-2.49,4.36-4.74-5.65-.19-4.91.47-7.28,2.39,2.19-2.4,1.42-7.79-1.43-10V6.17c2.33,1.49,2.21,5.14,0,7.15-2.23-2-2.27-5.69,0-7.15V3c-2.83,2.26-3.62,7.66-1.44,10-2.36-1.93-1.63-2.58-7.28-2.39.1,2.26,2.55,4.73,4.36,4.74,0,0-1.93.22-2.74-2.62,2.38-.37,4.29-.14,6.28,2-.79-.11-4.89,1.13-4.38,3.26.53.06,3,.3,3.58-.83-.17.18-1.25.5-1.53.05.38-1.39,2.32-2,2.32-2-1,1.82-.48,4.63.82,5.72,1.31-1.08,1.8-3.95.82-5.72,0,0,1.95.6,2.32,2-.29.46-1.36.12-1.53-.05.58,1.14,3.06.88,3.58.83.49-2.17-3.58-3.36-4.38-3.26,2-2.17,3.92-2.39,6.28-2C18.3,15.62,16.36,15.39,16.36,15.39ZM12,19.46c-.91-.79-.5-3,0-3.59C12.5,16.45,12.91,18.66,12,19.46Z"/></svg>
+                        <svg class="icon" xmlns="http://www.w3.org/2000/svg" viewBox="0 0 24 24">
+                            <path
+                                d="M16.36,15.39c1.83,0,4.26-2.49,4.36-4.74-5.65-.19-4.91.47-7.28,2.39,2.19-2.4,1.42-7.79-1.43-10V6.17c2.33,1.49,2.21,5.14,0,7.15-2.23-2-2.27-5.69,0-7.15V3c-2.83,2.26-3.62,7.66-1.44,10-2.36-1.93-1.63-2.58-7.28-2.39.1,2.26,2.55,4.73,4.36,4.74,0,0-1.93.22-2.74-2.62,2.38-.37,4.29-.14,6.28,2-.79-.11-4.89,1.13-4.38,3.26.53.06,3,.3,3.58-.83-.17.18-1.25.5-1.53.05.38-1.39,2.32-2,2.32-2-1,1.82-.48,4.63.82,5.72,1.31-1.08,1.8-3.95.82-5.72,0,0,1.95.6,2.32,2-.29.46-1.36.12-1.53-.05.58,1.14,3.06.88,3.58.83.49-2.17-3.58-3.36-4.38-3.26,2-2.17,3.92-2.39,6.28-2C18.3,15.62,16.36,15.39,16.36,15.39ZM12,19.46c-.91-.79-.5-3,0-3.59C12.5,16.45,12.91,18.66,12,19.46Z" />
+                        </svg>
                     </div>
                     <div class="balance-card__token">FLO</div>
                     <div id="flo_balance" class="balance-card__amount"></div>
@@ -263,7 +312,9 @@
     <article id="transaction" class="page hide-completely page-layout">
         <button class="icon-button justify-self-start" onclick="history.back()">
             <svg xmlns="http://www.w3.org/2000/svg" class="icon" viewBox="0 0 20 20" fill="currentColor">
-                <path fill-rule="evenodd" d="M9.707 16.707a1 1 0 01-1.414 0l-6-6a1 1 0 010-1.414l6-6a1 1 0 011.414 1.414L5.414 9H17a1 1 0 110 2H5.414l4.293 4.293a1 1 0 010 1.414z" clip-rule="evenodd" />
+                <path fill-rule="evenodd"
+                    d="M9.707 16.707a1 1 0 01-1.414 0l-6-6a1 1 0 010-1.414l6-6a1 1 0 011.414 1.414L5.414 9H17a1 1 0 110 2H5.414l4.293 4.293a1 1 0 010 1.414z"
+                    clip-rule="evenodd" />
             </svg>
         </button>
         <section>
@@ -284,7 +335,9 @@
     <article id="account" class="page hide-completely page-layout">
         <button class="icon-button justify-self-start" onclick="history.back()">
             <svg xmlns="http://www.w3.org/2000/svg" class="icon" viewBox="0 0 20 20" fill="currentColor">
-                <path fill-rule="evenodd" d="M9.707 16.707a1 1 0 01-1.414 0l-6-6a1 1 0 010-1.414l6-6a1 1 0 011.414 1.414L5.414 9H17a1 1 0 110 2H5.414l4.293 4.293a1 1 0 010 1.414z" clip-rule="evenodd" />
+                <path fill-rule="evenodd"
+                    d="M9.707 16.707a1 1 0 01-1.414 0l-6-6a1 1 0 010-1.414l6-6a1 1 0 011.414 1.414L5.414 9H17a1 1 0 110 2H5.414l4.293 4.293a1 1 0 010 1.414z"
+                    clip-rule="evenodd" />
             </svg>
         </button>
         <section id="account_details">
@@ -297,16 +350,11 @@
                     <div id="account_detail__type"></div>
                     <h3 id="account_detail__amount"></h3>
                 </div>
-                <time id="account_detail__time"></time>
                 <sm-button id="account_action_button" onclick="processAccount()" variant="primary"></sm-button>
             </div>
-        </section>
-        <section id="account_process" class="hide-completely">
-            <div class="grid gap-0-5">
-                <div id="account_process__type"></div>
-                <h4 id="account_process__amount"></h4>
+            <div id="account_process">
+                <div id="account_process__steps"></div>
             </div>
-            <div id="account_process__steps"></div>
         </section>
     </article>
     <template id="request_template">
@@ -444,7 +492,7 @@
             }
             pop() {
                 if (this.items.length == 0)
-                return "Underflow";
+                    return "Underflow";
                 return this.items.pop();
             }
             peek() {
@@ -533,17 +581,17 @@
                 getRef("notification_sound").currentTime = 0;
                 getRef("notification_sound").play();
             }
-            if(mode === 'error'){
+            if (mode === 'error') {
                 console.error(message)
             }
         }
 
-        function getFormatedTime(time, relative) {
+        function getFormattedTime(time, relative) {
             try {
                 if (String(time).indexOf('_'))
-                time = String(time).split('_')[0]
+                    time = String(time).split('_')[0]
                 const intTime = parseInt(time)
-                if(String(intTime).length < 13)
+                if (String(intTime).length < 13)
                     time *= 1000
                 let timeFrag = new Date(intTime).toString().split(' '),
                     day = timeFrag[0],
@@ -566,13 +614,13 @@
                 finalHours = hours >= 12 ? `${finalHours} PM` : `${finalHours} AM`
                 if (relative) {
                     if (year == currentYear) {
-                        if (currentTime[1] === month){
+                        if (currentTime[1] === month) {
                             const dateDiff = (parseInt(currentTime[2]) - parseInt(date))
-                            if(dateDiff === 0)
+                            if (dateDiff === 0)
                                 return `${finalHours}`;
-                            else if(dateDiff === 1)
+                            else if (dateDiff === 1)
                                 return `Yesterday`;
-                            else if(dateDiff > 1 && dateDiff < 8)
+                            else if (dateDiff > 1 && dateDiff < 8)
                                 return currentTime[0];
                             else
                                 return ` ${date} ${month}`;
@@ -624,47 +672,47 @@
             if (targetPage === '') {
                 pageId = 'homepage'
                 subPageId = 'dashboard'
-            }else {
-                if(targetPage.includes('/')){
+            } else {
+                if (targetPage.includes('/')) {
                     if (targetPage.includes('?')) {
                         const splitAddress = targetPage.split('?')
                         searchParams = splitAddress.pop()
                         const pages = splitAddress.pop().split('/')
                         pageId = pages[1]
                         subPageId = pages[2]
-                    }else{
+                    } else {
                         const pages = targetPage.split('/')
                         pageId = pages[1]
                         subPageId = pages[2]
                     }
-                }else{
+                } else {
                     pageId = targetPage
                 }
             }
-            if(typeof myFloID === "undefined" && !(['sign_up', 'sign_in', 'loading'].includes(pageId))) return
+            if (typeof myFloID === "undefined" && !(['sign_up', 'sign_in', 'loading'].includes(pageId))) return
             if (searchParams) {
                 const urlSearchParams = new URLSearchParams('?' + searchParams);
                 params = Object.fromEntries(urlSearchParams.entries());
                 pagesData.params = params
             }
-            if(pagesData.lastPage !== pageId){
+            if (pagesData.lastPage !== pageId) {
                 switch (pageId) {
-                    case 'sign_in': 
-                    setTimeout(() => {
-                        getRef('private_key_field').focusIn()
-                    }, 0);
-                    break;
-                    case 'sign_up': 
-                        const {floID, privKey} = floCrypto.generateNewID()   
+                    case 'sign_in':
+                        setTimeout(() => {
+                            getRef('private_key_field').focusIn()
+                        }, 0);
+                        break;
+                    case 'sign_up':
+                        const { floID, privKey } = floCrypto.generateNewID()
                         getRef('generated_flo_id').value = floID
                         getRef('generated_private_key').value = privKey
-                    break;
-                    case 'transaction': 
+                        break;
+                    case 'transaction':
                         showTransactionDetails(params)
-                    break;
-                    case 'account': 
+                        break;
+                    case 'account':
                         showAccountDetails(params)
-                    break;
+                        break;
                 }
                 document.querySelector('.page:not(.hide-completely)')?.classList.add('hide-completely')
                 getRef(pageId)?.classList.remove('hide-completely')
@@ -681,35 +729,34 @@
                         easing: 'ease'
                     })
             }
-            if(subPageId){
+            if (subPageId) {
                 getRef('all_responses_list').innerHTML = ''
                 getRef('all_requests_list').innerHTML = ''
                 switch (subPageId) {
-                    case 'dashboard': 
-                        // renderRecentTransactions()
-                        if(pagesData.openedSubPages.includes(subPageId)){
+                    case 'dashboard':
+                        if (pagesData.openedSubPages.includes(subPageId)) {
                             accountLoader.reset()
-                        }else{
-                            accountLoader = new LazyLoader('#user_accounts', bank_app.accounts.reverse(), render.accountCard, {batchSize: 10})
+                        } else {
+                            accountLoader = new LazyLoader('#user_accounts', bank_app.accounts.reverse(), render.accountCard, { batchSize: 10 })
                             accountLoader.init()
                         }
-                    break;
-                    case 'notifications': 
-                        if(pagesData.openedSubPages.includes(subPageId)){
+                        break;
+                    case 'notifications':
+                        if (pagesData.openedSubPages.includes(subPageId)) {
                             responseLoader.reset()
-                        }else{
-                            responseLoader = new LazyLoader('#all_responses_list', utils.getArrayOfObj(bank_app.viewAllResponses()).reverse(), render.responseCard, {batchSize: 10})
+                        } else {
+                            responseLoader = new LazyLoader('#all_responses_list', utils.getArrayOfObj(bank_app.viewAllResponses()).reverse(), render.responseCard, { batchSize: 10 })
                             responseLoader.init()
                         }
-                    break;
-                    case 'history': 
-                        if(pagesData.openedSubPages.includes(subPageId)){
+                        break;
+                    case 'history':
+                        if (pagesData.openedSubPages.includes(subPageId)) {
                             requestLoader.reset()
-                        }else{
-                            requestLoader = new LazyLoader('#all_requests_list', getRequests(), render.requestCard, {batchSize: 10})
+                        } else {
+                            requestLoader = new LazyLoader('#all_requests_list', getRequests(), render.requestCard, { batchSize: 10 })
                             requestLoader.init()
                         }
-                    break;
+                        break;
                 }
                 document.querySelector('.sub-page:not(.hide-completely)')?.classList.add('hide-completely')
                 getRef(subPageId)?.classList.remove('hide-completely')
@@ -725,44 +772,44 @@
                         transform: 'none'
                     },
                 ],
-                {
-                    duration: 300,
-                    easing: 'ease'
-                })
+                    {
+                        duration: 300,
+                        easing: 'ease'
+                    })
             }
             pagesData.lastPage = pageId
-            if(!pagesData.openedPages.includes(pageId)){
+            if (!pagesData.openedPages.includes(pageId)) {
                 pagesData.openedPages.push(pageId)
             }
-            if(subPageId && !pagesData.openedSubPages.includes(subPageId)){
+            if (subPageId && !pagesData.openedSubPages.includes(subPageId)) {
                 pagesData.openedSubPages.push(subPageId)
             }
         }
         // class based lazy loading
-        class LazyLoader{
-            constructor(container, arrayOfElements, renderFn, options = {}){
-                const {batchSize = 10} = options
+        class LazyLoader {
+            constructor(container, arrayOfElements, renderFn, options = {}) {
+                const { batchSize = 10 } = options
                 this.arrayOfElements = arrayOfElements
                 this.renderFn = renderFn
                 this.intersectionObserver
-                
+
                 this.batchSize = batchSize
-                
+
                 this.lazyContainer = document.querySelector(container)
-                
+
                 this.render = this.render.bind(this)
                 this.init = this.init.bind(this)
                 this.clear = this.clear.bind(this)
             }
-            init(){
+            init() {
                 this.intersectionObserver = new IntersectionObserver((entries, observer) => {
                     entries.forEach(entry => {
-                        if(entry.isIntersecting){
-                            observer.disconnect() 
-                            this.render({lazyLoad: true})
+                        if (entry.isIntersecting) {
+                            observer.disconnect()
+                            this.render({ lazyLoad: true })
                         }
                     })
-                },{
+                }, {
                     threshold: 0.3
                 })
                 this.mutationObserver = new MutationObserver(mutationList => {
@@ -781,12 +828,12 @@
                 console.log(this.arrayOfElements.length)
             }
             render(options = {}) {
-                let {lazyLoad = false} = options
+                let { lazyLoad = false } = options
                 const frag = document.createDocumentFragment();
-                if(lazyLoad){
+                if (lazyLoad) {
                     this.updateStartIndex = this.updateEndIndex
                     this.updateEndIndex = this.arrayOfElements.length > this.updateEndIndex + this.batchSize ? this.updateEndIndex + this.batchSize : this.arrayOfElements.length
-                }else{
+                } else {
                     this.intersectionObserver.disconnect()
                     this.lazyContainer.innerHTML = ``;
                     this.updateStartIndex = 0
@@ -797,12 +844,12 @@
                 }
                 this.lazyContainer.append(frag)
             }
-            clear(){
+            clear() {
                 this.intersectionObserver.disconnect()
                 this.mutationObserver.disconnect()
                 this.lazyContainer.innerHTML = ``;
             }
-            reset(){
+            reset() {
                 this.render()
             }
         }
@@ -811,135 +858,135 @@
         const utils = {
             getArrayOfObj(obj) {
                 const arrayOfObj = []
-                for (key in obj) {    
-                    arrayOfObj.push({id: key, ...obj[key]});
+                for (key in obj) {
+                    arrayOfObj.push({ id: key, ...obj[key] });
                 }
                 return arrayOfObj
             },
-            getRelatedIcon(type){
+            getRelatedIcon(type) {
                 let icon
-                switch(type){
+                switch (type) {
                     case 'openDeposit':
                     case 'deposit':
                         icon = `
                             <svg class="icon" xmlns="http://www.w3.org/2000/svg" enable-background="new 0 0 24 24" height="24px" viewBox="0 0 24 24" width="24px" fill="#000000"><rect fill="none" height="24" width="24"/><g><path d="M19.83,7.5l-2.27-2.27c0.07-0.42,0.18-0.81,0.32-1.15C17.96,3.9,18,3.71,18,3.5C18,2.67,17.33,2,16.5,2 c-1.64,0-3.09,0.79-4,2l-5,0C4.46,4,2,6.46,2,9.5S4.5,21,4.5,21l5.5,0v-2h2v2l5.5,0l1.68-5.59L22,14.47V7.5H19.83z M13,9H8V7h5V9z M16,11c-0.55,0-1-0.45-1-1c0-0.55,0.45-1,1-1s1,0.45,1,1C17,10.55,16.55,11,16,11z"/></g></svg>
                         `
-                    break
+                        break
                     case 'closeDeposit':
                         icon = `
                             <svg class="icon" xmlns="http://www.w3.org/2000/svg" viewBox="0 0 24 24"><path d="M19.08,2.5H4.92A1.5,1.5,0,0,0,3.42,4V9.62a1.5,1.5,0,0,0,1.5,1.5H7v9a.87.87,0,0,0,.86.87h8.26a.87.87,0,0,0,.86-.87v-9h2.09a1.5,1.5,0,0,0,1.5-1.5V4A1.5,1.5,0,0,0,19.08,2.5ZM12,17.68a2.18,2.18,0,1,1,2.18-2.17A2.18,2.18,0,0,1,12,17.68Zm7.58-8.06a.5.5,0,0,1-.5.5H17V7.24h.76a.43.43,0,0,0,0-.86H6.25a.43.43,0,0,0,0,.86H7v2.88H4.92a.5.5,0,0,1-.5-.5V4a.5.5,0,0,1,.5-.5H19.08a.5.5,0,0,1,.5.5Z"/></svg>
                         `
-                    break
+                        break
                     case 'openLoan':
                     case 'loan':
                         icon = `
                             <svg class="icon" xmlns="http://www.w3.org/2000/svg" viewBox="0 0 24 24"><path d="M12.65,8.5H10.42a5.18,5.18,0,0,0-4,1.95L3.75,13.74a5,5,0,0,0-.68,5.31l0,0h0a5.07,5.07,0,0,0,4.5,2.73h7.88A5.08,5.08,0,0,0,20,19.05h0a5.39,5.39,0,0,0,.43-1.2,4.91,4.91,0,0,0-1-4.06l-2.66-3.34A5.17,5.17,0,0,0,12.65,8.5Z"/><path d="M9.71,6.59h3.94A2.94,2.94,0,0,0,16,5.39h0a1.13,1.13,0,0,0-.23-1.57,1.11,1.11,0,0,0-.95-.18h0a1.2,1.2,0,0,1-.92-.18l-.28-.21a3.64,3.64,0,0,0-4.22,0h0a1.18,1.18,0,0,1-1,.16L8.2,3.35a1.13,1.13,0,0,0-1.36.84A1.17,1.17,0,0,0,7,5H7A3.18,3.18,0,0,0,9.71,6.59Z"/></svg>
                         `
-                    break
+                        break
                     case 'closeLoan':
                         icon = `
                             <svg class="icon" xmlns="http://www.w3.org/2000/svg" viewBox="0 0 24 24"><path d="M6.42,9.17h0a1,1,0,0,0-1.57.2A7.54,7.54,0,0,0,4.19,11a1,1,0,0,0,1,1.24h0a1,1,0,0,0,.94-.7,5.61,5.61,0,0,1,.49-1.16A1,1,0,0,0,6.42,9.17Zm-1.26,5h0a1,1,0,0,0-1,1.25A8,8,0,0,0,4.84,17a1,1,0,0,0,1.57.19h0a1,1,0,0,0,.17-1.15A6.17,6.17,0,0,1,6.1,14.9,1,1,0,0,0,5.16,14.19Zm2.86,6a7.85,7.85,0,0,0,1.59.66,1,1,0,0,0,1.25-1v0a1,1,0,0,0-.7-.94A6.08,6.08,0,0,1,9,18.45a1,1,0,0,0-1.17.17l0,0A1,1,0,0,0,8,20.21ZM12.86,5V3.73a.64.64,0,0,0-1.09-.45l-3,3a.63.63,0,0,0,0,.9l3,3a.64.64,0,0,0,1.08-.46v-2a.36.36,0,0,1,.43-.35A6,6,0,0,1,13.54,19a1,1,0,0,0-.68.94h0a1,1,0,0,0,1.24,1,8,8,0,0,0-.95-15.56A.34.34,0,0,1,12.86,5Z"/></svg>
                         `
-                    break
+                        break
                     case 'success':
                         icon = `
                         <svg xmlns="http://www.w3.org/2000/svg" class="icon" viewBox="0 0 20 20" fill="currentColor">
                             <path fill-rule="evenodd" d="M6.267 3.455a3.066 3.066 0 001.745-.723 3.066 3.066 0 013.976 0 3.066 3.066 0 001.745.723 3.066 3.066 0 012.812 2.812c.051.643.304 1.254.723 1.745a3.066 3.066 0 010 3.976 3.066 3.066 0 00-.723 1.745 3.066 3.066 0 01-2.812 2.812 3.066 3.066 0 00-1.745.723 3.066 3.066 0 01-3.976 0 3.066 3.066 0 00-1.745-.723 3.066 3.066 0 01-2.812-2.812 3.066 3.066 0 00-.723-1.745 3.066 3.066 0 010-3.976 3.066 3.066 0 00.723-1.745 3.066 3.066 0 012.812-2.812zm7.44 5.252a1 1 0 00-1.414-1.414L9 10.586 7.707 9.293a1 1 0 00-1.414 1.414l2 2a1 1 0 001.414 0l4-4z" clip-rule="evenodd" />
                         </svg>
                         `
-                    break;
+                        break;
                     case 'pending':
                         icon = `
                         <svg xmlns="http://www.w3.org/2000/svg" class="icon" viewBox="0 0 20 20" fill="currentColor">
                             <path fill-rule="evenodd" d="M10 18a8 8 0 100-16 8 8 0 000 16zm1-12a1 1 0 10-2 0v4a1 1 0 00.293.707l2.828 2.829a1 1 0 101.415-1.415L11 9.586V6z" clip-rule="evenodd" />
                         </svg>
                         `
-                    break;
+                        break;
                     case 'failed':
                         icon = `
                         <svg xmlns="http://www.w3.org/2000/svg" class="icon" viewBox="0 0 20 20" fill="currentColor">
                             <path fill-rule="evenodd" d="M8.257 3.099c.765-1.36 2.722-1.36 3.486 0l5.58 9.92c.75 1.334-.213 2.98-1.742 2.98H4.42c-1.53 0-2.493-1.646-1.743-2.98l5.58-9.92zM11 13a1 1 0 11-2 0 1 1 0 012 0zm-1-8a1 1 0 00-1 1v3a1 1 0 002 0V6a1 1 0 00-1-1z" clip-rule="evenodd" />
                         </svg>
                         `
-                    break;
+                        break;
                 }
                 return icon
             }
         }
         const render = {
-            requestCard(activityDetails = {}){
-                const {requestID, amount, rtype, timestamp, status} = activityDetails
+            requestCard(activityDetails = {}) {
+                const { requestID, amount, rtype, timestamp, status } = activityDetails
                 const card = getRef('request_template').content.cloneNode(true).firstElementChild
                 const icon = utils.getRelatedIcon(rtype)
                 let action = ''
-                switch(rtype){
+                switch (rtype) {
                     case 'openDeposit':
                         action = 'deposit'
-                    break
+                        break
                     case 'closeDeposit':
                         action = 'withdraw'
-                    break
+                        break
                     case 'openLoan':
                         action = 'Get loan'
-                    break
+                        break
                     case 'closeLoan':
                         action = 'Repay loan'
-                    break
+                        break
                 }
                 card.setAttribute('href', `#/transaction?requestID=${requestID}`)
                 card.querySelector('.activity-card__icon').innerHTML = icon
                 card.querySelector('.activity-card__title').textContent = action
-                card.querySelector('.activity-card__time').textContent = getFormatedTime(timestamp, true)
-                card.querySelector('.activity-card__amount').textContent = `₹${amount}`
+                card.querySelector('.activity-card__time').textContent = getFormattedTime(timestamp, true)
+                card.querySelector('.activity-card__amount').textContent = amount.toLocaleString(`en-IN`, { style: 'currency', currency: 'INR' })
                 card.querySelector('.activity-card__status').classList.add(status)
                 card.querySelector('.activity-card__status').textContent = status
                 return card
             },
-            responseCard(responseDetails){
-                const {id, requestID, reason = 'none', rtype, status = 'pending'} = responseDetails
-                let {amount = undefined, index = undefined} = bank_app.viewAllRequests()[requestID]
-                if(!amount){
+            responseCard(responseDetails) {
+                const { id, requestID, reason = 'none', rtype, status = 'pending' } = responseDetails
+                let { amount = undefined, index = undefined } = bank_app.viewAllRequests()[requestID]
+                if (!amount) {
                     amount = bank_app.accounts[index].amount
                 }
                 const timestamp = id.split('_')[0]
                 const card = getRef('response_template').content.cloneNode(true).firstElementChild
                 const icon = utils.getRelatedIcon(status)
                 let action = ''
-                switch(rtype){
+                switch (rtype) {
                     case 'openDeposit':
                         action = 'deposit'
-                    break
+                        break
                     case 'closeDeposit':
                         action = 'withdrawal'
-                    break
+                        break
                     case 'openLoan':
                         action = 'loan'
-                    break
+                        break
                     case 'closeLoan':
                         action = 'loan repayment'
-                    break
+                        break
                 }
                 card.querySelector('.activity-card__icon').innerHTML = icon
                 card.querySelector('.activity-card__icon').classList.add(status)
-                card.querySelector('.activity-card__title').textContent = `${action} ${status === 'success' ? 'approved': 'failed'}`
-                card.querySelector('.activity-card__description').textContent = `Your request for ${action} of ${amount} was ${status === 'success' ? 'successful': 'rejected'}`
-                card.querySelector('.activity-card__time').textContent = getFormatedTime(timestamp, true)
+                card.querySelector('.activity-card__title').textContent = `${action} ${status === 'success' ? 'approved' : 'failed'}`
+                card.querySelector('.activity-card__description').textContent = `Your request for ${action} of ${amount} was ${status === 'success' ? 'successful' : 'rejected'}`
+                card.querySelector('.activity-card__time').textContent = getFormattedTime(timestamp, true)
                 return card
             },
-            accountCard(accountDetails = {}, index){
-                const {type, status, openTime, closeTime = 0, amount, netAmt} = accountDetails
+            accountCard(accountDetails = {}, index) {
+                const { type, status, openTime, closeTime = 0, amount, netAmt } = accountDetails
                 const card = getRef('account_template').content.cloneNode(true).firstElementChild
                 const icon = utils.getRelatedIcon(type)
                 card.setAttribute('href', `#/account?index=${index}`)
                 card.querySelector('.activity-card__icon').innerHTML = icon
                 card.querySelector('.activity-card__type').textContent = type
-                card.querySelector('.activity-card__time').textContent = getFormatedTime(parseInt(openTime))
-                card.querySelector('.activity-card__amount').textContent = `₹${amount}`
+                card.querySelector('.activity-card__time').textContent = getFormattedTime(parseInt(openTime))
+                card.querySelector('.activity-card__amount').textContent = amount.toLocaleString(`en-IN`, { style: 'currency', currency: 'INR' })
                 card.querySelector('.activity-card__status').classList.add(status)
                 card.querySelector('.activity-card__status').textContent = status
                 return card
             },
-            accountProgressStep(type, title, description = ''){
+            accountProgressStep(type, title, description = '') {
                 const elem = getRef('account_step_template').content.cloneNode(true).firstElementChild
                 elem.classList.add(type)
                 elem.querySelector('.step__icon').innerHTML = type === 'loading' ? '<sm-spinner></sm-spinner>' : utils.getRelatedIcon(type)
@@ -948,11 +995,11 @@
                 return elem
             }
         }
-        function getSignedIn(){
+        function getSignedIn() {
             return new Promise((resolve, reject) => {
-                if(window.location.hash.includes('sign_in') || window.location.hash.includes('sign_up')){
+                if (window.location.hash.includes('sign_in') || window.location.hash.includes('sign_up')) {
                     showPage(window.location.hash)
-                }else{
+                } else {
                     window.location.hash = '#/sign_in'
                 }
                 getRef('sign_in_button').onclick = () => {
@@ -967,27 +1014,27 @@
                 }
             })
         }
-        function signOut(){
+        function signOut() {
             getConfirmation('Sign out?', 'You are about to sign out of the app, continue?')
-            .then(async (res) => {
-                if (res) {
-                    await floDapps.clearCredentials()
-                    onLoadStartUp()
-                }
-            })
+                .then(async (res) => {
+                    if (res) {
+                        await floDapps.clearCredentials()
+                        onLoadStartUp()
+                    }
+                })
         }
         function refreshBalance() {
             Promise.all([bank_app.tokenAPI.getBalance(myFloID), floBlockchainAPI.getBalance(myFloID)])
-            .then(([rupeeBalance, floBalance]) => {
-                getRef('rupee_balance').textContent = rupeeBalance 
-                getRef('flo_balance').textContent = floBalance
-            })
-            .catch(error => notify(error, 'error'))
+                .then(([rupeeBalance, floBalance]) => {
+                    getRef('rupee_balance').textContent = rupeeBalance.toLocaleString(`en-IN`, { style: 'currency', currency: 'INR' })
+                    getRef('flo_balance').textContent = floBalance
+                })
+                .catch(error => notify(error, 'error'))
             updateChart()
         }
         function getRequestDetails(requestID) {
-            let {amount, rtype, index} = bank_app.viewAllRequests()[requestID]
-            if(!amount){
+            let { amount, rtype, index } = bank_app.viewAllRequests()[requestID]
+            if (!amount) {
                 amount = bank_app.accounts[index].amount
             }
             const transactionDetails = {
@@ -1018,10 +1065,10 @@
             getRef('recent_transactions_container').innerHTML = ''
             getRef('recent_transactions_container').append(activityFrag)
         }
-        function showTransactionDetails(params){
-            const {requestID} = params
-            const {amount, rtype, timestamp, status, index} = getRequestDetails(requestID)
-            const {status: accountStatus} = bank_app.accounts[index]
+        function showTransactionDetails(params) {
+            const { requestID } = params
+            const { amount, rtype, timestamp, status, index } = getRequestDetails(requestID)
+            const { status: accountStatus } = bank_app.accounts[index]
 
             let type = (rtype === 'openDeposit' || rtype === 'closeDeposit') ? 'deposit' : 'loan'
             const icon = utils.getRelatedIcon(rtype)
@@ -1030,47 +1077,140 @@
             getRef('transaction_detail__status').innerHTML = `${statusIcon} ${status === 'success' ? 'completed' : status}`
             getRef('transaction_detail__status').className = `status-tag flex align-center ${status}`
             getRef('transaction_detail__type').textContent = type
-            getRef('transaction_detail__amount').textContent = amount
-            getRef('transaction_detail__time').textContent = getFormatedTime(timestamp)
+            getRef('transaction_detail__amount').textContent = amount.toLocaleString(`en-IN`, { style: 'currency', currency: 'INR' })
+            getRef('transaction_detail__time').textContent = getFormattedTime(timestamp)
             getRef('transaction_action_button').classList.remove('hide-completely')
 
-            if(accountStatus === 'active'){
+            if (accountStatus === 'active') {
                 getRef('transaction_action_button').classList.remove('hide-completely')
-            }else{
+            } else {
                 getRef('transaction_action_button').classList.add('hide-completely')
             }
 
-            switch(rtype){
+            switch (rtype) {
                 case 'openDeposit':
                     getRef('transaction_action_button').textContent = 'Withdraw'
-                break
+                    break
                 case 'openLoan':
                     getRef('transaction_action_button').textContent = 'Repay'
-                break
+                    break
             }
         }
-        function showAccountDetails(params){
-            const {index} = params
-            const {type, status, openTime, closeTime = 0, amount, netAmt} = bank_app.accounts[index]
+
+        function getAccountStatus(index) {
+            const { status } = bank_app.accounts[index]
+            const allRequests = bank_app.viewAllRequests()
+            const filteredRequests = {}
+            const details = {}
+            for (const requestKey in allRequests) {
+                const { index: requestIndex } = allRequests[requestKey]
+                if (index == requestIndex) {
+                    filteredRequests[requestKey] = allRequests[requestKey]
+                }
+            }
+
+
+            const allResponses = bank_app.viewAllResponses()
+            for (const responseKey in allResponses) {
+                const { requestID } = allResponses[responseKey]
+                if (filteredRequests[requestID]) {
+                    delete filteredRequests[requestID]
+                }
+            }
+
+            let isPending = false
+            for (const key in filteredRequests) {
+                isPending = true
+                details.pendingRequest = key
+            }
+
+            details.isPending = (isPending && (status === 'active'))
+            return details
+        }
+
+        function renderAccountProgress(index) {
+            const { type, status, openTime, closeTime = 0, amount, netAmt } = bank_app.accounts[index]
+            getRef('account_process__steps').innerHTML = ''
+            getRef('account_process__steps').append(render.accountProgressStep('success', `${type}ed`, getFormattedTime(openTime)))
+            const { isPending, pendingRequest } = getAccountStatus(index)
+            if (type === 'deposit') {
+                if (isPending) {
+                    getRef('account_process__steps').append(render.accountProgressStep('success', 'Sent withdrawal request', getFormattedTime(pendingRequest.split('_')[0])))
+                    getRef('account_process__steps').append(render.accountProgressStep('pending', 'Waiting for confirmation', `Once your request is processed, your withdrawn amount will reflect in your balance.<br>meanwhile you can go back and continue using the app.`))
+                } else {
+                    getRef('account_process__steps').append(render.accountProgressStep('success', 'Withdrawal complete', getFormattedTime(closeTime)))
+                }
+            } else {
+                if (isPending) {
+                    getRef('account_process__steps').append(render.accountProgressStep('success', 'Sent repay request', getFormattedTime(pendingRequest.split('_')[0])))
+                    getRef('account_process__steps').append(render.accountProgressStep('pending', 'Waiting for confirmation', `Once your request is processed, your loan will be closed,`))
+                } else {
+                    getRef('account_process__steps').append(render.accountProgressStep('success', 'Repayment complete', getFormattedTime(closeTime)))
+                }
+            }
+        }
+
+        function showAccountDetails(params) {
+            const { index } = params
+            const { type, status, openTime, closeTime = 0, amount, netAmt } = bank_app.accounts[index]
             const icon = utils.getRelatedIcon(type)
 
             getRef('account_detail__icon').innerHTML = icon
             getRef('account_detail__status').textContent = status
             getRef('account_detail__status').className = `status-tag flex align-center ${status}`
             getRef('account_detail__type').textContent = type
-            getRef('account_detail__amount').textContent = amount
-            getRef('account_detail__time').textContent = getFormatedTime(openTime)
-            getRef('account_action_button').classList.remove('hide-completely')
+            getRef('account_detail__amount').textContent = amount.toLocaleString(`en-IN`, { style: 'currency', currency: 'INR' })
+            renderAccountProgress(index)
 
-            if(status === 'active'){
+            if (status === 'active' && !getAccountStatus(index).isPending) {
                 getRef('account_action_button').classList.remove('hide-completely')
-            }else{
+            } else {
                 getRef('account_action_button').classList.add('hide-completely')
             }
-            getRef('account_action_button').textContent = type ==='deposit' ? 'Withdraw' : 'Repay'
+            getRef('account_action_button').textContent = (type === 'deposit') ? 'Withdraw' : 'Repay'
         }
 
-        function selectGraphColors(){
+        async function processAccount() {
+            const { index } = pagesData.params
+            const { type, netAmt } = bank_app.accounts[index]
+            let ans
+            if (type === 'deposit') {
+                ans = await getConfirmation('Withdraw deposit?', 'Are you sure to withdraw this deposit now?')
+            } else {
+                ans = await getConfirmation('Repay loan?', 'Make sure you have required amount to repay the loan!')
+            }
+            if (ans) {
+                const actionToDo = type === 'deposit' ? 'withdraw' : 'Repay'
+                getRef('account_process__steps').append(render.accountProgressStep('loading', `Sending ${actionToDo} request`))
+                if (type === 'deposit') {
+                    bank_app.withdrawDeposit(parseInt(index))
+                        .then(res => {
+                            getRef('account_process__steps').lastElementChild.remove()
+                            renderAccountProgress()
+                        })
+                        .catch(err => {
+                            getRef('account_process__steps')
+                                .append(
+                                    render.accountProgressStep('failed', 'Failed withdrawal', `Can't withdraw deposit as loan amount exceeds total deposit amount.`)
+                                )
+                        })
+                } else {
+                    bank_app.repayLoan(parseInt(index))
+                        .then(res => {
+                            getRef('account_process__steps').lastElementChild.remove()
+                            renderAccountProgress()
+                        })
+                        .catch(err => {
+                            getRef('account_process__steps')
+                                .append(
+                                    render.accountProgressStep('failed', 'Failed repayment', err)
+                                )
+                        })
+                }
+            }
+        }
+
+        function selectGraphColors() {
             const colors = []
             const green = getComputedStyle(document.body).getPropertyValue('--green')
             const yellow = getComputedStyle(document.body).getPropertyValue('--yellow')
@@ -1078,17 +1218,17 @@
         }
 
         function updateChart() {
-            const {depositTotal, loanTotal} = bank_app.getUserDetails(myFloID)
-            if(accountChart){
+            const { depositTotal, loanTotal } = bank_app.getUserDetails(myFloID)
+            if (accountChart) {
                 accountChart.data.datasets[0].data = [depositTotal, loanTotal]
                 accountChart.update()
             }
-            getRef('total_deposit').textContent = depositTotal 
+            getRef('total_deposit').textContent = depositTotal
             getRef('total_loan').textContent = loanTotal
         }
 
         document.querySelector('theme-toggle').addEventListener('themechange', e => {
-            if(accountChart){
+            if (accountChart) {
                 accountChart.data.datasets[0].backgroundColor = selectGraphColors()
                 accountChart.update()
             }
@@ -1096,7 +1236,7 @@
 
         function renderChart(params) {
             const ctx = getRef('account_summary_chart').getContext('2d');
-            const {depositTotal, loanTotal} = bank_app.getUserDetails(myFloID)
+            const { depositTotal, loanTotal } = bank_app.getUserDetails(myFloID)
             return new Chart(ctx, {
                 type: 'doughnut',
                 data: {
@@ -1121,7 +1261,7 @@
                         }
                     },
                     plugins: {
-                        legend:{
+                        legend: {
                             display: false
                         }
                     }
@@ -1131,71 +1271,19 @@
 
         const chartObserver = new IntersectionObserver(entries => {
             entries.forEach(entry => {
-                if(entry.isIntersecting){
+                if (entry.isIntersecting) {
                     accountChart = renderChart()
                     refreshBalance()
-                }else if(!entry.isIntersecting && accountChart){
+                } else if (!entry.isIntersecting && accountChart) {
                     accountChart.destroy()
                 }
             })
         })
-
-        async function processAccount() {
-            const {index} = pagesData.params
-            const {type, netAmt} = bank_app.accounts[index]
-            if(type === 'deposit'){
-                const ans = await getConfirmation('Withdraw deposit?', 'Are you sure to withdraw this deposit now?')
-                if(ans){
-                    getRef('account_process__type').textContent = 'Withdraw'
-                    getRef('account_process__amount').textContent = `₹${netAmt}`
-                    getRef('account_process__steps').innerHTML = ''
-                    getRef('account_process__steps').append(render.accountProgressStep('loading', 'Sending withdraw request'))
-                    getRef('account_process').classList.remove('hide-completely')
-                    getRef('account_details').classList.add('hide-completely')
-                    bank_app.withdrawDeposit(index)
-                    .then(res => {
-                        getRef('account_process__steps').innerHTML = ''
-                        getRef('account_process__steps').append(render.accountProgressStep('success', 'Sent withdraw request'))
-                        getRef('account_process__steps').append(render.accountProgressStep('pending', 'Waiting for confirmation', `Once your request is processed, your withdrawn amount will reflect in your balance.<br>meanwhile you can go back and continue using the app.`))
-                    })
-                    .catch(err => {
-                        getRef('account_process__steps').innerHTML = ''
-                        getRef('account_process__steps')
-                            .append(
-                                render.accountProgressStep('failed', 'Failed withdrawal', `Can't withdraw deposit as loan amount exceeds total deposit amount.`)
-                            )
-                    })
-                }
-            }else{
-                const ans = await getConfirmation('Repay loan?', 'Make sure you have required amount to repay the loan!')
-                if(ans){
-                    getRef('account_process__type').textContent = 'Repay'
-                    getRef('account_process__amount').textContent = `₹${netAmt}`
-                    getRef('account_process__steps').innerHTML = ''
-                    getRef('account_process__steps').append(render.accountProgressStep('loading', 'Sending repay request'))
-                    getRef('account_process').classList.remove('hide-completely')
-                    getRef('account_details').classList.add('hide-completely')
-                    bank_app.repayLoan(index)
-                    .then(res => {
-                        getRef('account_process__steps').innerHTML = ''
-                        getRef('account_process__steps').append(render.accountProgressStep('success', 'Sent repay request'))
-                        getRef('account_process__steps').append(render.accountProgressStep('pending', 'Waiting for confirmation', `Once your request is processed, your loan will be closed,`))
-                    })
-                    .catch(err => {
-                        getRef('account_process__steps').innerHTML = ''
-                        getRef('account_process__steps')
-                            .append(
-                                render.accountProgressStep('failed', 'Failed repayment', err)
-                            )
-                    })
-                }
-            }
-        }
     </script>
     <script id="onLoadStartUp">
         const requestResponsePairs = {}
         function onLoadStartUp() {
-            
+
             //floDapps.addStartUpFunction('Sample', Promised Function)
             //floDapps.setAppObjectStores({sampleObs1:{}, sampleObs2:{options{autoIncrement:true, keyPath:'SampleKey'}, Indexes:{sampleIndex:{}}}})
             floDapps.setCustomPrivKeyInput(getSignedIn)
@@ -1212,22 +1300,22 @@
                 // alert(`Welcome FLO_ID: ${myFloID}`);
                 //App functions....
                 bank_app.launchApp(DummyCallBack, DummyCallBack)
-                .then(result => {
-                    console.log(result)
-                    // create pairs of requestIDs and their respective responses for efficient lookup
-                    const allResponses =  bank_app.viewAllResponses()
-                    for(const key in allResponses){
-                        const {requestID} = allResponses[key]
-                        requestResponsePairs[requestID] = key
-                    }
-                    if(window.location.hash.includes('sign_in') || window.location.hash.includes('sign_up')){
-                        window.location.hash = ''
-                    }else{
-                        showPage(window.location.hash)
-                    }
-                    chartObserver.observe(getRef('account_chart_container'))
-                })
-                .catch(error => console.error(error))
+                    .then(result => {
+                        console.log(result)
+                        // create pairs of requestIDs and their respective responses for efficient lookup
+                        const allResponses = bank_app.viewAllResponses()
+                        for (const key in allResponses) {
+                            const { requestID } = allResponses[key]
+                            requestResponsePairs[requestID] = key
+                        }
+                        if (window.location.hash.includes('sign_in') || window.location.hash.includes('sign_up')) {
+                            window.location.hash = ''
+                        } else {
+                            showPage(window.location.hash)
+                        }
+                        chartObserver.observe(getRef('account_chart_container'))
+                    })
+                    .catch(error => console.error(error))
             }).catch(error => console.error(error));
         }
 
@@ -1240,919 +1328,1089 @@
         //All util libraries required for Standard operations (DO NOT EDIT ANY)
 
         /* Reactor Event handling */
-    if (typeof reactor == "undefined" || !reactor) {
-        (function () {
-        function Event(name) {
-            this.name = name;
-            this.callbacks = [];
+        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();
+            })();
         }
 
-        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);
+        /* Sample Usage
+            --Creating and defining the event--
+            reactor.registerEvent('<eventName>');
+            reactor.addEventListener('<eventName>', function(someObject){
+            do something...
             });
-        };
+            --Firing the event--
+            reactor.dispatchEvent('<eventName>',<someObject>);
+        */
 
-        Reactor.prototype.addEventListener = function (eventName, callback) {
-            this.events[eventName].registerCallback(callback);
-        };
 
-        window.reactor = new Reactor();
-        })();
-    }
+        /*!
+        * 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 () {
 
-    /* Sample Usage
-        --Creating and defining the event--
-        reactor.registerEvent('<eventName>');
-        reactor.addEventListener('<eventName>', function(someObject){
-        do something...
-        });
-        --Firing the event--
-        reactor.dispatchEvent('<eventName>',<someObject>);
-    */
+                var base64map = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
 
-    
-    /*!
-    * 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) {
+                // 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 () {
 
-            var base64map = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
+            // Shortcuts
+            var C = Crypto,
+                util = C.util,
+                charenc = C.charenc,
+                UTF8 = charenc.UTF8,
+                Binary = charenc.Binary;
 
-            // 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) :
+            // 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;
-            };
+            // The core
+            SHA1._sha1 = function (message) {
 
-            var processBlock = function (H, M, offset) {
+                // Convert to byte array
+                if (message.constructor == String) message = UTF8.stringToBytes(message);
+                /* else, assume byte array already */
 
-                // Swap endian
-                for (var i = 0; i < 16; i++) {
-                    var offset_i = offset + i;
-                    var M_offset_i = M[offset_i];
+                var m = util.bytesToWords(message),
+                    l = message.length * 8,
+                    w = [],
+                    H0 = 1732584193,
+                    H1 = -271733879,
+                    H2 = -1732584194,
+                    H3 = 271733878,
+                    H4 = -1009589776;
 
-                    // 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)
-                );
+                // Padding
+                m[l >> 5] |= 0x80 << (24 - l % 32);
+                m[((l + 64 >>> 9) << 4) + 15] = l;
 
                 for (var i = 0; i < m.length; i += 16) {
-                    processBlock(H, m, i);
+
+                    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;
+
                 }
 
-                // Swap endian
-                for (var i = 0; i < 5; i++) {
-                    // Shortcut
-                    var H_i = H[i];
+                return [H0, H1, H2, H3, H4];
 
-                    // Swap
-                    H[i] = (((H_i << 8) | (H_i >>> 24)) & 0x00ff00ff) |
-                        (((H_i << 24) | (H_i >>> 8)) & 0xff00ff00);
+            };
+
+            // 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 digestbytes = wordsToBytes(H);
-                return digestbytes;
+                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;
             }
 
 
@@ -2160,1566 +2418,1121 @@
 
 
 
-            // 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 () {
+            // (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;
+            };
 
-                // (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);
-                };
+            // (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;
+            };
 
-                // 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);
+            // (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;
                 }
-
-                // 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;
+                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;
                     }
-                    return c;
+                    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;
                 }
-                // 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;
+                if (k == 8 && (s[0] & 0x80) != 0) {
+                    this.s = -1;
+                    if (sh > 0) this[this.t - 1] |= ((1 << (this.DB - sh)) - 1) << sh;
                 }
-                // 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;
+                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;
                 }
-                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;
+                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;
                 }
-
-                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);
+                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();
+            };
 
-                function intAt(s, i) {
-                    var c = BI_RC[s.charCodeAt(i)];
-                    return (c == null) ? -1 : c;
+
+            // (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;
                 }
-
-
-
-                // 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];
+                if (a.t < this.t) {
+                    c -= a.s;
+                    while (i < this.t) {
+                        c += this[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;
+                    c += this.s;
+                } else {
+                    c += this.s;
+                    while (i < a.t) {
+                        c -= a[i];
+                        r[i++] = c & this.DM;
+                        c >>= this.DB;
                     }
-                    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();
-                };
+                    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 * 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;
-                        }
+            // (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();
-                };
+                }
+                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;
+            // (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);
                     }
-                    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;
                     }
-                    if (q != null) {
-                        r.drShiftTo(ys, q);
-                        if (ts != ms) BigInteger.ZERO.subTo(q, q);
+                }
+                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);
                     }
-                    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;
-                                }
+                    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);
                         }
+                        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;
                 }
+                return m ? r : "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
+            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;
                 }
-
-                // (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;
+                if ((x & 0xff) == 0) {
+                    x >>= 8;
+                    r += 8;
                 }
-
-                // return number of 1 bits in x
-                function cbit(x) {
-                    var r = 0;
-                    while (x != 0) {
-                        x &= x - 1;
-                        ++r;
-                    }
-                    return r;
+                if ((x & 0xf) == 0) {
+                    x >>= 4;
+                    r += 4;
                 }
+                if ((x & 3) == 0) {
+                    x >>= 2;
+                    r += 2;
+                }
+                if ((x & 1) == 0) ++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];
+            // 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) 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);
+            // (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;
                     }
-                    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));
+                    w = b * w + x;
+                    if (++j >= cs) {
+                        this.dMultiply(d);
                         this.dAddOffset(w, 0);
+                        j = 0;
+                        w = 0;
                     }
-                    if (mi) BigInteger.ZERO.subTo(this, this);
-                };
+                }
+                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);
-                            }
+            // (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);
                     }
-                };
+                } 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) 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) 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];
+            // (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;
                     }
-                    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;
+                    c += this.s;
+                } else {
+                    c += this.s;
+                    while (i < a.t) {
+                        c += a[i];
+                        r[i++] = c & this.DM;
+                        c >>= this.DB;
                     }
-                    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;
+                    c += a.s;
                 }
-                BigInteger.prototype.and = function (a) {
-                    var r = nbi();
-                    this.bitwiseTo(a, op_and, r);
-                    return r;
-                };
+                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();
+            };
 
-                // (public) this | a
-                function op_or(x, y) {
-                    return x | y;
+            // (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];
                 }
-                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;
-                };
+            // (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();
+            };
 
-                // (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;
-                };
+            // (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);
+            };
 
-                // (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);
+            // (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
-                        z = new Montgomery(m);
+                        for (var i = this.t - 1; i >= 0; --i) r = (d * r + this[i]) % n;
+                return r;
+            };
 
-                    // 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;
+
+            // (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);
                     }
 
-                    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) {
+                    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;
-                            if (--i < 0) {
-                                i = this.DB - 1;
-                                --j;
+                        }
+                        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);
                     }
-                    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);
-                        }
+                    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 (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;
-                        });
+                    if (u.compareTo(v) >= 0) {
+                        u.subTo(v, u);
+                        if (ac) a.subTo(c, a);
+                        b.subTo(d, b);
                     } else {
-                        // Empty array, nothing to do
-                        return ba;
+                        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;
+            };
 
-                /**
-                * 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));
+
+            // (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 {
-                        return new BigInteger(ba);
+                        y.subTo(x, y);
+                        y.rShiftTo(1, y);
                     }
-                };
-
-                /**
-                * 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);
-                };
+                if (g > 0) y.lShiftTo(g, y);
+                return y;
+            };
 
-
-
-
-
-                // 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;
+            // (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;
                 }
-                // 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;
+                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;
                 }
-                // 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);
-                };
+                return x.millerRabin(t);
+            };
 
 
+            // JSBN-specific extension
+
+            // (public) this^2
+            BigInteger.prototype.square = function () {
+                var r = nbi();
+                this.squareTo(r);
+                return 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:
-
+            // NOTE: BigInteger interfaces not implemented in jsbn:
             // BigInteger(int signum, byte[] magnitude)
             // double doubleValue()
             // float floatValue()
@@ -3729,129 +3542,404 @@
 
 
 
+            // Copyright Stephan Thomas (start) --- //
+            // https://raw.github.com/bitcoinjs/bitcoinjs-lib/07f9d55ccb6abd962efb6befdd37671f85ea4ff9/src/util.js
+            // BigInteger monkey patching
+            BigInteger.valueOf = nbv;
 
-
-            //ellipticcurve.js
-            /*!
-            * Basic Javascript Elliptic Curve implementation
-            * Ported loosely from BouncyCastle's Java EC code
-            * Only Fp curves implemented for now
+            /**
+            * Returns a byte array representation of the big integer.
             *
-            * Copyright Tom Wu, bitaddress.org  BSD License.
-            * http://www-cs-students.stanford.edu/~tjw/jsbn/LICENSE
+            * This returns the absolute of the contained value in big endian
+            * form. A value of zero results in an empty array.
             */
-            (function () {
+            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;
+                }
+            };
 
-                // Constructor function of Global EllipticCurve object
-                var ec  = window.EllipticCurve = function () {};
+            /**
+            * 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);
+                }
+            };
 
-                // ----------------
-                // 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;
-                };
+            /**
+            * 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;
 
-                ec.FieldElementFp.prototype.equals = function (other) {
-                    if (other == this) return true;
-                    return (this.q.equals(other.q) && this.x.equals(other.x));
-                };
+                if (neg) {
+                    if (val[0] & 0x80) {
+                        val.unshift(0x80);
+                    } else {
+                        val[0] |= 0x80;
+                    }
+                } else {
+                    if (val[0] & 0x80) {
+                        val.unshift(0x00);
+                    }
+                }
 
-                ec.FieldElementFp.prototype.toBigInteger = function () {
-                    return this.x;
-                };
+                return val;
+            };
 
-                ec.FieldElementFp.prototype.negate = function () {
-                    return new ec.FieldElementFp(this.q, this.x.negate().mod(this.q));
-                };
+            /**
+            * 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;
 
-                ec.FieldElementFp.prototype.add = function (b) {
-                    return new ec.FieldElementFp(this.q, this.x.add(b.toBigInteger()).mod(this.q));
-                };
+                    return BigInteger.fromByteArrayUnsigned(ba).negate();
+                } else {
+                    return BigInteger.fromByteArrayUnsigned(ba);
+                }
+            };
+            // Copyright Stephan Thomas (end) --- //
 
-                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(
+            // ****** 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;
+                }
 
-                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;
+                // 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 {
-                        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);
-                        }
+                        P = new BigInteger(this.q.bitLength(), rand);
                     }
-                    while (U.equals(BigInteger.ONE) || U.equals(qMinusOne));
+                    while (P.compareTo(this.q) >= 0 || !(P.multiply(P).subtract(fourQ).modPow(legendreExponent,
+                        this.q).equals(qMinusOne)));
 
-                    return null;
-                };
-                    /*!
-            * Crypto-JS 2.5.4 BlockModes.js
-            * contribution from Simon Greatrix
-            */
+                    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;
+            };
+            /*!
+    * Crypto-JS 2.5.4 BlockModes.js
+    * contribution from Simon Greatrix
+    */
 
             (function (C) {
 
@@ -3890,8 +3978,8 @@
 
                 // No-operation padding, used for stream ciphers
                 C_pad.NoPadding = {
-                    pad: function (cipher, message) {},
-                    unpad: function (cipher, message) {}
+                    pad: function (cipher, message) { },
+                    unpad: function (cipher, message) { }
                 };
 
                 // Zero Padding.
@@ -4262,12 +4350,12 @@
 
             })(Crypto);
 
-                /*!
-            * Crypto-JS v2.5.4  PBKDF2.js
-            * http://code.google.com/p/crypto-js/
-            * Copyright (c) 2009-2013, Jeff Mott. All rights reserved.
-            * http://code.google.com/p/crypto-js/wiki/License
-            */
+            /*!
+        * Crypto-JS v2.5.4  PBKDF2.js
+        * http://code.google.com/p/crypto-js/
+        * Copyright (c) 2009-2013, Jeff Mott. All rights reserved.
+        * http://code.google.com/p/crypto-js/wiki/License
+        */
             (function () {
 
                 // Shortcuts
@@ -4313,33 +4401,33 @@
 
                     return options && options.asBytes ? derivedKeyBytes :
                         options && options.asString ? Binary.bytesToString(derivedKeyBytes) :
-                        util.bytesToHex(derivedKeyBytes);
+                            util.bytesToHex(derivedKeyBytes);
 
                 };
 
             })();
-        
-    /*
-            * Copyright (c) 2010-2011 Intalio Pte, All Rights Reserved
-            * 
-            * Permission is hereby granted, free of charge, to any person obtaining a copy
-            * of this software and associated documentation files (the "Software"), to deal
-            * in the Software without restriction, including without limitation the rights
-            * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-            * copies of the Software, and to permit persons to whom the Software is
-            * furnished to do so, subject to the following conditions:
-            * 
-            * The above copyright notice and this permission notice shall be included in
-            * all copies or substantial portions of the Software.
-            * 
-            * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-            * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-            * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-            * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-            * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-            * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
-            * THE SOFTWARE.
-            */
+
+            /*
+                    * Copyright (c) 2010-2011 Intalio Pte, All Rights Reserved
+                    * 
+                    * Permission is hereby granted, free of charge, to any person obtaining a copy
+                    * of this software and associated documentation files (the "Software"), to deal
+                    * in the Software without restriction, including without limitation the rights
+                    * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+                    * copies of the Software, and to permit persons to whom the Software is
+                    * furnished to do so, subject to the following conditions:
+                    * 
+                    * The above copyright notice and this permission notice shall be included in
+                    * all copies or substantial portions of the Software.
+                    * 
+                    * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+                    * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+                    * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+                    * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+                    * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+                    * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+                    * THE SOFTWARE.
+                    */
             // https://github.com/cheongwy/node-scrypt-js
             (function () {
 
@@ -4695,12 +4783,12 @@
                 }; // window.Crypto_scrypt
             })();
 
-        /*!
-            * Crypto-JS v2.5.4  AES.js
-            * http://code.google.com/p/crypto-js/
-            * Copyright (c) 2009-2013, Jeff Mott. All rights reserved.
-            * http://code.google.com/p/crypto-js/wiki/License
-            */
+            /*!
+                * Crypto-JS v2.5.4  AES.js
+                * http://code.google.com/p/crypto-js/
+                * Copyright (c) 2009-2013, Jeff Mott. All rights reserved.
+                * http://code.google.com/p/crypto-js/wiki/License
+                */
             (function () {
 
                 // Shortcuts
@@ -4780,11 +4868,11 @@
 
                 // Inner state
                 var state = [
-                        [],
-                        [],
-                        [],
-                        []
-                    ],
+                    [],
+                    [],
+                    [],
+                    []
+                ],
                     keylength,
                     nrounds,
                     keyschedule;
@@ -4810,8 +4898,8 @@
                             // Convert to bytes if message is a string
                             m = (
                                 message.constructor == String ?
-                                UTF8.stringToBytes(message) :
-                                message
+                                    UTF8.stringToBytes(message) :
+                                    message
                             ),
 
                             // Generate random IV
@@ -4820,12 +4908,12 @@
                             // Generate key
                             k = (
                                 password.constructor == String ?
-                                // Derive key from pass-phrase
-                                C.PBKDF2(password, iv, 32, {
-                                    asBytes: true
-                                }) :
-                                // else, assume byte array representing cryptographic key
-                                password
+                                    // Derive key from pass-phrase
+                                    C.PBKDF2(password, iv, 32, {
+                                        asBytes: true
+                                    }) :
+                                    // else, assume byte array representing cryptographic key
+                                    password
                             );
 
                         // Encrypt
@@ -4853,8 +4941,8 @@
                             // Convert to bytes if ciphertext is a string
                             c = (
                                 ciphertext.constructor == String ?
-                                util.base64ToBytes(ciphertext) :
-                                ciphertext
+                                    util.base64ToBytes(ciphertext) :
+                                    ciphertext
                             ),
 
                             // Separate IV and message
@@ -4863,12 +4951,12 @@
                             // Generate key
                             k = (
                                 password.constructor == String ?
-                                // Derive key from pass-phrase
-                                C.PBKDF2(password, iv, 32, {
-                                    asBytes: true
-                                }) :
-                                // else, assume byte array representing cryptographic key
-                                password
+                                    // Derive key from pass-phrase
+                                    C.PBKDF2(password, iv, 32, {
+                                        asBytes: true
+                                    }) :
+                                    // else, assume byte array representing cryptographic key
+                                    password
                             );
 
                         // Decrypt
@@ -5112,2822 +5200,2822 @@
                 };
 
             })();
-    
-                /*
-                * 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;
+            /*
+            * 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"
 
-                    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);
-                        }
-                    }
+                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);
-                    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);
+                    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(Ql).mod(p);
                     }
+                }
 
-                    return [Uh, Vl];
-                };
+                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);
 
-                // ----------------
-                // 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;
+                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
                     }
-                    this.zinv = null;
-                    // compression flag
-                    this.compressed = !!compressed;
-                };
+                    return this.curve.getInfinity(); // this = -b, so infinity
+                }
 
-                ec.PointFp.prototype.getX = function () {
-                    if (this.zinv == null) {
-                        this.zinv = this.z.modInverse(this.curve.q);
+                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);
                     }
-                    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);
-                };
+                return 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);
-                };
+            // 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;
 
-                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);
-                            }
+                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 {
-                            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);
+                            R = R.add(this);
                         }
                     } 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);
+                        if (k.testBit(i)) {
+                            R = R.add(x);
                         }
                     }
-
-                    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);
+                    --i;
                 }
 
-                ec.CurveFp.prototype.getQ = function () {
-                    return this.q;
-                };
+                return R;
+            };
 
-                ec.CurveFp.prototype.getA = function () {
-                    return this.a;
-                };
+            // 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);
 
-                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;
+                // when compressed prepend byte depending if y point is even or odd
+                if (compressed) {
+                    if (y.isEven()) {
+                        enc.unshift(0x02);
+                    } else {
+                        enc.unshift(0x03);
                     }
-                };
-
-                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;
+                } else {
+                    enc.unshift(0x04);
+                    enc = enc.concat(ec.integerToBytes(y, len)); // uncompressed public key appends the bytes of the y point
                 }
-                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;
-                };
+                return enc;
+            };
 
-                // 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);
+            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();
                     }
-                };
-
-                // secp256k1 called by Bitcoin's ECKEY
-                ec.getSECCurveByName = function (name) {
-                    if (ec.secNamedCurves[name] == undefined) return null;
-                    return ec.secNamedCurves[name]();
+                    // 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);
 
-            //bitTrx.js
-            (function () {
+                var x3 = gamma.square().subtract(this.x).subtract(b.x);
+                var y3 = gamma.multiply(this.x.subtract(x3)).subtract(this.y);
 
-                var bitjs = window.bitjs = function () {};
+                return new ec.PointFp(this.curve, x3, y3);
+            };
 
-                /* 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;
+            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();
+                }
 
-                /* provide a privkey and return an WIF  */
-                bitjs.privkey2wif = function (h) {
-                    var r = Crypto.util.hexToBytes(h);
+                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));
 
-                    if (bitjs.compressed == true) {
-                        r.push(0x01);
+                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);
                     }
+                }
 
-                    r.unshift(bitjs.priv);
-                    var hash = Crypto.SHA256(Crypto.SHA256(r, {
+                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
-                    });
-                    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);
+                    }).slice(0, 4);
+                    if (checksum + "" == back + "") {
+                        return front.slice(1);
                     }
                 }
 
-                /* 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));
-                }
+                /* generate the transaction hash to sign from a transaction input */
+                btrx.transactionHash = function (index, sigHashType) {
 
-                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
+                    var clone = bitjs.clone(this);
+                    var shType = sigHashType || 1;
 
-
-                    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);
+                    /* black out all other ins, except this one */
+                    for (var i = 0; i < clone.inputs.length; i++) {
+                        if (index != i) {
+                            clone.inputs[i].script = [];
                         }
                     }
 
-                    /* generate the transaction hash to sign from a transaction input */
-                    btrx.transactionHash = function (index, sigHashType) {
 
-                        var clone = bitjs.clone(this);
-                        var shType = sigHashType || 1;
+                    if ((clone.inputs) && clone.inputs[index]) {
 
-                        /* black out all other ins, except this one */
-                        for (var i = 0; i < clone.inputs.length; i++) {
-                            if (index != i) {
-                                clone.inputs[i].script = [];
-                            }
-                        }
+                        /* 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
 
-                        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 == 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) {
+                        } else if (shType == 3) {
 
-                                //SIGHASH_SINGLE 0x03
+                            //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 = [];
                                 }
-
-                                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;
                         }
+
+                        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;
                     }
 
-                    /* generate a signature from a transaction hash */
-                    btrx.transactionSig = function (index, wif, sigHashType, txhash) {
+                    var shType = sigHashType || 1;
+                    var hash = txhash || Crypto.util.hexToBytes(this.transactionHash(index, shType));
 
-                        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'])
+                    if (hash) {
                         var curve = EllipticCurve.getSECCurveByName("secp256k1");
-                        var N = curve.getN();
+                        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);
 
-                        // Step: a
-                        // hash is a byteArray of the message digest. so h1 == hash in our case
+                        // Force lower s values per BIP62
+                        var halfn = n.shiftRight(1);
+                        if (s.compareTo(halfn) > 0) {
+                            s = n.subtract(s);
+                        };
 
-                        // 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
-                        ];
+                        var sig = serializeSig(r, s);
+                        sig.push(parseInt(shType, 10));
 
-                        // 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
-                        ];
+                        return Crypto.util.bytesToHex(sig);
+                    } else {
+                        return false;
+                    }
+                }
 
-                        // Step: d
-                        k = Crypto.HMAC(Crypto.SHA256, v.concat([0]).concat(x).concat(hash), k, {
+                // 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
                         });
-
-                        // 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;
+                        KBigInt = BigInteger.fromByteArrayUnsigned(T);
+                        i++
                     };
 
-                    /* 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 <= 1040) {
-                                    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;
+                    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;
                 }
 
-                bitjs.numToBytes = function (num, bytes) {
-                    if (typeof bytes === "undefined") bytes = 8;
-                    if (bytes == 0) {
-                        return [];
-                    } else if (num == -1) {
-                        return Crypto.util.hexToBytes("ffffffffffffffff");
+                /* 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 <= 1040) {
+                        floDataCountAdjusted = (floDataCount - 253) + parseInt("0xfd00fd");
+                        floDataCountStringAdjusted = floDataCountAdjusted.toString(16);
+                        floDataCountString = floDataCountStringAdjusted.substr(0, 2) + floDataCountStringAdjusted.substr(4, 2) + floDataCountStringAdjusted.substr(2, 2);
                     } else {
-                        return [num % 256].concat(bitjs.numToBytes(Math.floor(num / 256), bytes - 1));
+                        floDataCountString = "Character Limit Exceeded";
                     }
+
+
+                    return Crypto.util.bytesToHex(buffer) + floDataCountString + flohex;    // flochange -- Addition of floDataCountString and floData in serialization
                 }
 
-                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;
-
-            })();
 
 
+                return btrx;
 
-    /*
-    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;
             }
+
+            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;
         };
 
-        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 *
 
-    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);
 
-    /**
-    * 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);
+        };
 
-        // 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);
+        };
 
-    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 });
 
-    /**
-    * 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] ||
+            if (checksum[0] != bytes[21] ||
                 checksum[1] != bytes[22] ||
                 checksum[2] != bytes[23] ||
                 checksum[3] != bytes[24]) {
-            throw "Checksum validation failed!";
-        }
+                throw "Checksum validation failed!";
+            }
 
-        if (version != hash.shift()) {
-            throw "Version " + hash.shift() + " not supported!";
-        }
+            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();
+            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;
+            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();
+            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();
+                for (var i = m - 1; i >= 0; --i) {
+                    R = R.twice2D();
 
-                R.z = BigInteger.ONE;
+                    R.z = BigInteger.ONE;
 
-                if (k.testBit(i)) {
-                    if (l.testBit(i)) {
-                        R = R.add2D(Z);
+                    if (k.testBit(i)) {
+                        if (l.testBit(i)) {
+                            R = R.add2D(Z);
+                        } else {
+                            R = R.add2D(P);
+                        }
                     } else {
-                        R = R.add2D(P);
-                    }
-                } else {
-                    if (l.testBit(i)) {
-                        R = R.add2D(Q);
+                        if (l.testBit(i)) {
+                            R = R.add2D(Q);
+                        }
                     }
                 }
-            }
 
-            return R;
-        };
+                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);
+            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);
+                    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();
-                    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);
+                    if (r.compareTo(BigInteger.ONE) < 0 ||
+                        r.compareTo(n) >= 0)
+                        return false;
 
-                return ECDSA.serializeSig(r, s);
-            },
+                    if (s.compareTo(BigInteger.ONE) < 0 ||
+                        s.compareTo(n) >= 0)
+                        return false;
 
-            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 c = s.modInverse(n);
 
-                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);
+                    var u1 = e.multiply(c).mod(n);
+                    var u2 = r.multiply(c).mod(n);
 
-                return ECDSA.verifyRaw(e, r, s, Q);
-            },
+                    // 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));
 
-            verifyRaw: function (e, r, s, Q) {
-                var n = ecparams.getN();
-                var G = ecparams.getG();
+                    var v = point.getX().toBigInteger().mod(n);
 
-                if (r.compareTo(BigInteger.ONE) < 0 ||
-                    r.compareTo(n) >= 0)
-                    return false;
+                    return v.equals(r);
+                },
 
-                if (s.compareTo(BigInteger.ONE) < 0 ||
-                    s.compareTo(n) >= 0)
-                    return false;
+                /**
+                * 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 c = s.modInverse(n);
+                    var sequence = [];
+                    sequence.push(0x02); // INTEGER
+                    sequence.push(rBa.length);
+                    sequence = sequence.concat(rBa);
 
-                var u1 = e.multiply(c).mod(n);
-                var u2 = r.multiply(c).mod(n);
+                    sequence.push(0x02); // INTEGER
+                    sequence.push(sBa.length);
+                    sequence = sequence.concat(sBa);
 
-                // 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));
+                    sequence.unshift(sequence.length);
+                    sequence.unshift(0x30); // SEQUENCE
 
-                var v = point.getX().toBigInteger().mod(n);
+                    return sequence;
+                },
 
-                return v.equals(r);
-            },
+                /**
+                * 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");
 
-            /**
-            * 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();
+                    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]);
 
-                var sequence = [];
-                sequence.push(0x02); // INTEGER
-                sequence.push(rBa.length);
-                sequence = sequence.concat(rBa);
+                    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]);
 
-                sequence.push(0x02); // INTEGER
-                sequence.push(sBa.length);
-                sequence = sequence.concat(sBa);
+                    cursor += 2 + sig[cursor + 1];
 
-                sequence.unshift(sequence.length);
-                sequence.unshift(0x30); // SEQUENCE
+                    //if (cursor != sig.length)
+                    //  throw new Error("Extra bytes in signature");
 
-                return sequence;
-            },
+                    var r = BigInteger.fromByteArrayUnsigned(rBa);
+                    var s = BigInteger.fromByteArrayUnsigned(sBa);
 
-            /**
-            * 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");
+                    return {
+                        r: r,
+                        s: s
+                    };
+                },
 
-                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;
+                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";
                 }
-                if (doAdd) this.keyArray.push(item);
             };
 
-            this.reset = function () {
+            return ECDSA;
+        })();
+        Bitcoin.KeyPool = (function () {
+            var KeyPool = 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";
+                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);
+                };
 
-                return keyPoolString;
+                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 this;
-        };
+            return new KeyPool();
+        })();
 
-        return new KeyPool();
-    })();
+        Bitcoin.Bip38Key = (function () {
+            var Bip38 = function (address, encryptedKey) {
+                this.address = address;
+                this.priv = encryptedKey;
+            };
 
-    Bitcoin.Bip38Key = (function () {
-        var Bip38 = function (address, encryptedKey) {
-            this.address = address;
-            this.priv = encryptedKey;
-        };
+            Bip38.prototype.getBitcoinAddress = function () {
+                return this.address;
+            };
 
-        Bip38.prototype.getBitcoinAddress = function () {
-            return this.address;
-        };
+            Bip38.prototype.toString = function () {
+                return this.priv;
+            };
 
-        Bip38.prototype.toString = function () {
-            return this.priv;
-        };
+            return Bip38;
+        })();
 
-        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");
 
-    //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 {
+            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(bytes);
+                    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.")
+                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);
+                    if (this.priv != null) {
+                        KeyPool.push(this);
+                    }
+                } catch (exc2) {
+                    this.setError(exc2);
                 }
-            } 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
+            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;
+            /**
+            * 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.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;
-        };
+            /**
+            * 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 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;
             }
-            return true;
-        }
-    };
+        };
 
 
         (function (ellipticCurveType) {
 
-                //Defining Elliptic Encryption Object  
-                var ellipticEncryption = window.ellipticCurveEncryption = function () {};
+            //Defining Elliptic Encryption Object  
+            var ellipticEncryption = window.ellipticCurveEncryption = function () { };
 
-                ellipticEncryption.rng = new SecureRandom();
+            ellipticEncryption.rng = new SecureRandom();
 
 
 
-                ellipticEncryption.getCurveParameters = function (curveName) {
+            ellipticEncryption.getCurveParameters = function (curveName) {
 
-                    //Default is secp256k1
-                    curveName = typeof curveName !== 'undefined' ? curveName : "secp256k1";
+                //Default is secp256k1
+                curveName = typeof curveName !== 'undefined' ? curveName : "secp256k1";
 
-                    var c = EllipticCurve.getSECCurveByName(curveName);
-                    var curveDetails = {
-                        Q: "",
-                        A: "",
-                        B: "",
-                        GX: "",
-                        GY: "",
-                        N: ""
-                    };
-
-                    curveDetails.Q = c.getCurve().getQ().toString();
-                    curveDetails.A = c.getCurve().getA().toBigInteger().toString();
-                    curveDetails.B = c.getCurve().getB().toBigInteger().toString();
-                    curveDetails.GX = c.getG().getX().toBigInteger().toString();
-                    curveDetails.GY = c.getG().getY().toBigInteger().toString();
-                    curveDetails.N = c.getN().toString();
-
-                    return curveDetails;
-
-                }
-
-                ellipticEncryption.selectedCurve = ellipticEncryption.getCurveParameters(ellipticCurveType);
-
-
-                ellipticEncryption.get_curve = function () {
-                    return new EllipticCurve.CurveFp(new BigInteger(this.selectedCurve.Q),
-                        new BigInteger(this.selectedCurve.A),
-                        new BigInteger(this.selectedCurve.B));
-                }
-
-                ellipticEncryption.get_G = function (curve) {
-                    return new EllipticCurve.PointFp(curve,
-                        curve.fromBigInteger(new BigInteger(this.selectedCurve.GX)),
-                        curve.fromBigInteger(new BigInteger(this.selectedCurve.GY)));
-                }
-
-
-                ellipticEncryption.pick_rand = function () {
-                    var n = new BigInteger(this.selectedCurve.N);
-                    var n1 = n.subtract(BigInteger.ONE);
-                    var r = new BigInteger(n.bitLength(), this.rng);
-                    return r.mod(n1).add(BigInteger.ONE);
-                }
-
-
-                ellipticEncryption.senderRandom = function () {
-                    var r = this.pick_rand();
-                    return r.toString();
+                var c = EllipticCurve.getSECCurveByName(curveName);
+                var curveDetails = {
+                    Q: "",
+                    A: "",
+                    B: "",
+                    GX: "",
+                    GY: "",
+                    N: ""
                 };
 
+                curveDetails.Q = c.getCurve().getQ().toString();
+                curveDetails.A = c.getCurve().getA().toBigInteger().toString();
+                curveDetails.B = c.getCurve().getB().toBigInteger().toString();
+                curveDetails.GX = c.getG().getX().toBigInteger().toString();
+                curveDetails.GY = c.getG().getY().toBigInteger().toString();
+                curveDetails.N = c.getN().toString();
+
+                return curveDetails;
+
+            }
+
+            ellipticEncryption.selectedCurve = ellipticEncryption.getCurveParameters(ellipticCurveType);
 
 
-                ellipticEncryption.receiverRandom = function () {
+            ellipticEncryption.get_curve = function () {
+                return new EllipticCurve.CurveFp(new BigInteger(this.selectedCurve.Q),
+                    new BigInteger(this.selectedCurve.A),
+                    new BigInteger(this.selectedCurve.B));
+            }
 
-                    //This is receivers private key. For now we will use random. CHANGE IT LATER
-                    var r = this.pick_rand();
-                    return r.toString();
-                }
+            ellipticEncryption.get_G = function (curve) {
+                return new EllipticCurve.PointFp(curve,
+                    curve.fromBigInteger(new BigInteger(this.selectedCurve.GX)),
+                    curve.fromBigInteger(new BigInteger(this.selectedCurve.GY)));
+            }
+
+
+            ellipticEncryption.pick_rand = function () {
+                var n = new BigInteger(this.selectedCurve.N);
+                var n1 = n.subtract(BigInteger.ONE);
+                var r = new BigInteger(n.bitLength(), this.rng);
+                return r.mod(n1).add(BigInteger.ONE);
+            }
+
+
+            ellipticEncryption.senderRandom = function () {
+                var r = this.pick_rand();
+                return r.toString();
+            };
 
 
 
-                ellipticEncryption.senderPublicString = function (senderPrivateKey) {
+            ellipticEncryption.receiverRandom = function () {
 
-                    var senderKeyECData = {};
-
-                    var curve = this.get_curve();
-                    var G = this.get_G(curve);
-                    var a = new BigInteger(senderPrivateKey);
-                    var P = G.multiply(a);
-                    senderKeyECData.XValuePublicString = P.getX().toBigInteger().toString();
-                    senderKeyECData.YValuePublicString = P.getY().toBigInteger().toString();
-
-                    return senderKeyECData;
-                }
-
-                //In real life ellipticEncryption.receiverPublicString is the public key of the receiver.
-                //you don't have to run receiverRandom and the bottom function 
-                ellipticEncryption.receiverPublicString = function (receiverPublicKey) {
-
-                    var receiverKeyECData = {};
-
-                    var curve = this.get_curve();
-                    var G = this.get_G(curve);
-                    var a = new BigInteger(receiverPublicKey);
-                    var P = G.multiply(a);
-                    receiverKeyECData.XValuePublicString = P.getX().toBigInteger().toString();
-                    receiverKeyECData.YValuePublicString = P.getY().toBigInteger().toString();
-
-                    return receiverKeyECData;
-                }
-
-                ellipticEncryption.senderSharedKeyDerivation = function (receiverPublicStringXValue,
-                    receiverPublicStringYValue, senderPrivateKey) {
-
-                    var senderDerivedKey = {};
-                    var curve = this.get_curve();
-                    var P = new EllipticCurve.PointFp(curve,
-                        curve.fromBigInteger(new BigInteger(receiverPublicStringXValue)),
-                        curve.fromBigInteger(new BigInteger(receiverPublicStringYValue)));
-                    var a = new BigInteger(senderPrivateKey);
-                    var S = P.multiply(a);
-
-                    senderDerivedKey.XValue = S.getX().toBigInteger().toString();
-                    senderDerivedKey.YValue = S.getY().toBigInteger().toString();
-
-                    return senderDerivedKey;
-                }
+                //This is receivers private key. For now we will use random. CHANGE IT LATER
+                var r = this.pick_rand();
+                return r.toString();
+            }
 
 
-                ellipticEncryption.receiverSharedKeyDerivation = function (senderPublicStringXValue,
-                    senderPublicStringYValue, receiverPrivateKey) {
 
-                    var receiverDerivedKey = {};
-                    var curve = this.get_curve();
-                    var P = new EllipticCurve.PointFp(curve,
-                        curve.fromBigInteger(new BigInteger(senderPublicStringXValue)),
-                        curve.fromBigInteger(new BigInteger(senderPublicStringYValue)));
-                    var a = new BigInteger(receiverPrivateKey);
-                    var S = P.multiply(a);
+            ellipticEncryption.senderPublicString = function (senderPrivateKey) {
 
-                    receiverDerivedKey.XValue = S.getX().toBigInteger().toString();
-                    receiverDerivedKey.YValue = S.getY().toBigInteger().toString();
+                var senderKeyECData = {};
 
-                    return receiverDerivedKey;
-                }
+                var curve = this.get_curve();
+                var G = this.get_G(curve);
+                var a = new BigInteger(senderPrivateKey);
+                var P = G.multiply(a);
+                senderKeyECData.XValuePublicString = P.getX().toBigInteger().toString();
+                senderKeyECData.YValuePublicString = P.getY().toBigInteger().toString();
 
-            })("secp256k1");
+                return senderKeyECData;
+            }
+
+            //In real life ellipticEncryption.receiverPublicString is the public key of the receiver.
+            //you don't have to run receiverRandom and the bottom function 
+            ellipticEncryption.receiverPublicString = function (receiverPublicKey) {
+
+                var receiverKeyECData = {};
+
+                var curve = this.get_curve();
+                var G = this.get_G(curve);
+                var a = new BigInteger(receiverPublicKey);
+                var P = G.multiply(a);
+                receiverKeyECData.XValuePublicString = P.getX().toBigInteger().toString();
+                receiverKeyECData.YValuePublicString = P.getY().toBigInteger().toString();
+
+                return receiverKeyECData;
+            }
+
+            ellipticEncryption.senderSharedKeyDerivation = function (receiverPublicStringXValue,
+                receiverPublicStringYValue, senderPrivateKey) {
+
+                var senderDerivedKey = {};
+                var curve = this.get_curve();
+                var P = new EllipticCurve.PointFp(curve,
+                    curve.fromBigInteger(new BigInteger(receiverPublicStringXValue)),
+                    curve.fromBigInteger(new BigInteger(receiverPublicStringYValue)));
+                var a = new BigInteger(senderPrivateKey);
+                var S = P.multiply(a);
+
+                senderDerivedKey.XValue = S.getX().toBigInteger().toString();
+                senderDerivedKey.YValue = S.getY().toBigInteger().toString();
+
+                return senderDerivedKey;
+            }
+
+
+            ellipticEncryption.receiverSharedKeyDerivation = function (senderPublicStringXValue,
+                senderPublicStringYValue, receiverPrivateKey) {
+
+                var receiverDerivedKey = {};
+                var curve = this.get_curve();
+                var P = new EllipticCurve.PointFp(curve,
+                    curve.fromBigInteger(new BigInteger(senderPublicStringXValue)),
+                    curve.fromBigInteger(new BigInteger(senderPublicStringYValue)));
+                var a = new BigInteger(receiverPrivateKey);
+                var S = P.multiply(a);
+
+                receiverDerivedKey.XValue = S.getX().toBigInteger().toString();
+                receiverDerivedKey.YValue = S.getY().toBigInteger().toString();
+
+                return receiverDerivedKey;
+            }
+
+        })("secp256k1");
 
 
         // 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!
+            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)
+                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
-                    ],
+                // 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!'
+                // 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
                 };
+            };
 
-                // Protected settings object
-                var config = {};
+            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.')
+                }
 
-                /** @expose **/
-                exports.getConfig = function () {
-                    return {
-                        'bits': config.bits,
-                        'unsafePRNG': config.unsafePRNG
-                    };
-                };
+                config.radix = defaults.radix;
+                config.bits = bits || defaults.bits;
+                config.size = Math.pow(2, config.bits);
+                config.max = config.size - 1;
 
-                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.')
+                // 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.radix = defaults.radix;
-                    config.bits = bits || defaults.bits;
-                    config.size = Math.pow(2, config.bits);
-                    config.max = config.size - 1;
+                config.logs = logs;
+                config.exps = exps;
+            };
 
-                    // 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;
-                        }
+            /** @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++;
                     }
-
-                    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;
+                    str = str.substr(-bits);
+                    if ((str.match(/0/g) || []).length === str.length) { // all zeros?
+                        return null;
+                    } else {
+                        return str;
                     }
-                    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;
+                // node.js crypto.randomBytes()
+                if (typeof require === 'function' && (crypto = require('crypto')) && (randomBits = crypto[
+                    'randomBytes'])) {
                     return function (bits) {
-                        var elems = Math.ceil(bits / bitsPerNum);
-                        var arr = [],
+                        var bytes = Math.ceil(bits / 8),
                             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);
+                            str = construct(bits, randomBits(bytes).toString('hex'), 16, 4);
                         }
                         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();
+                // 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);
 
-                    // 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."
-                        )
+                        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 {
-                        config.rng = rng;
+                        out = padLeft(num.toString(16), hexChars) + out;
                     }
-                    config.alert = !!alert;
+                }
+                return out;
+            };
 
-                    return !!config.unsafePRNG;
-                };
+            // 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;
 
-                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));
+                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.')
                 }
 
-                // 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;
+                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;
+            };
 
-                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;
-                }
+            // by default, initialize without an RNG
+            exports.init();
+        })(typeof module !== 'undefined' && module['exports'] ? module['exports'] : (window['shamirSecretShare'] = {}),
+            typeof global !== 'undefined' ? global : window);
 
-                // 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);
-
-            //For diff base
+        //For diff base
         /*
         Functions available:
         diff(originalObj, updatedObj) returns the difference of the original and updated objects
@@ -7938,204 +8026,206 @@
         mergeRecursive(original, diff) returns a new object that will merge difference to old object
         mergeDiff(original, allDiff) returns a new object from original object merged with all differences (allDiff is returned object of findDiff)
         */
-    (function(){
-        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;
+        (function () {
+            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)
+            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]
+                    };
+                }, {});
             };
-            }
-            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 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 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 };
-        }, {});
-        };
-        window.findDiff = (lhs, rhs) => ({
-        added: addedDiff(lhs, rhs),
-        deleted: deletedDiff(lhs, rhs),
-        updated: updatedDiff(lhs, rhs),
-        });
-        
-        const 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];
+
+
+            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 obj1;
-        }
-        
-        const cleanse = (obj) => {
-            Object.keys(obj).forEach(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];
+                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 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;
                 }
-                else if (value === null) 
-                    delete obj[key];// null, remove it
+                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 };
+                }, {});
+            };
+            window.findDiff = (lhs, rhs) => ({
+                added: addedDiff(lhs, rhs),
+                deleted: deletedDiff(lhs, rhs),
+                updated: updatedDiff(lhs, rhs),
             });
-            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 findDiff */
-        window.mergeDiff = (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
-        }
-    })();
+
+            const 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;
+            }
+
+            const cleanse = (obj) => {
+                Object.keys(obj).forEach(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)
+                        delete obj[key];// null, remove it
+                });
+                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 findDiff */
+            window.mergeDiff = (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 id="floCrypto" version="2.0.1">
         /* FLO Crypto Operators*/
@@ -8148,17 +8238,17 @@
 
                 asciiAlternatives: `‘ '\n’ '\n“ "\n” "\n– --\n— ---\n≥ >=\n≤ <=\n≠ !=\n× *\n÷ /\n← <-\n→ ->\n↔ <->\n⇒ =>\n⇐ <=\n⇔ <=>`,
 
-                exponent1: function() {
+                exponent1: function () {
                     return this.p.add(BigInteger.ONE).divide(BigInteger("4"))
                 },
 
-                calculateY: function(x) {
+                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)
                 },
-                getUncompressedPublicKey: function(compressedPublicKey) {
+                getUncompressedPublicKey: function (compressedPublicKey) {
                     const p = this.p;
                     // Fetch x from compressedPublicKey
                     let pubKeyBytes = Crypto.util.hexToBytes(compressedPublicKey);
@@ -8181,7 +8271,7 @@
                     };
                 },
 
-                getSenderPublicKeyString: function() {
+                getSenderPublicKeyString: function () {
                     privateKey = ellipticCurveEncryption.senderRandom();
                     senderPublicKeyString = ellipticCurveEncryption.senderPublicString(privateKey);
                     return {
@@ -8190,28 +8280,28 @@
                     }
                 },
 
-                deriveSharedKeySender: function(receiverCompressedPublicKey, senderPrivateKey) {
+                deriveSharedKeySender: function (receiverCompressedPublicKey, senderPrivateKey) {
                     let receiverPublicKeyString = this.getUncompressedPublicKey(receiverCompressedPublicKey);
                     var senderDerivedKey = ellipticCurveEncryption.senderSharedKeyDerivation(
                         receiverPublicKeyString.x, receiverPublicKeyString.y, senderPrivateKey);
                     return senderDerivedKey;
                 },
 
-                deriveReceiverSharedKey: function(senderPublicKeyString, receiverPrivateKey) {
+                deriveReceiverSharedKey: function (senderPublicKeyString, receiverPrivateKey) {
                     return ellipticCurveEncryption.receiverSharedKeyDerivation(
                         senderPublicKeyString.XValuePublicString, senderPublicKeyString.YValuePublicString, receiverPrivateKey);
                 },
 
-                getReceiverPublicKeyString: function(privateKey) {
+                getReceiverPublicKeyString: function (privateKey) {
                     return ellipticCurveEncryption.receiverPublicString(privateKey);
                 },
 
-                deriveSharedKeyReceiver: function(senderPublicKeyString, receiverPrivateKey) {
+                deriveSharedKeyReceiver: function (senderPublicKeyString, receiverPrivateKey) {
                     return ellipticCurveEncryption.receiverSharedKeyDerivation(
                         senderPublicKeyString.XValuePublicString, senderPublicKeyString.YValuePublicString, receiverPrivateKey);
                 },
 
-                wifToDecimal: function(pk_wif, isPubKeyCompressed = false) {
+                wifToDecimal: function (pk_wif, isPubKeyCompressed = false) {
                     let pk = Bitcoin.Base58.decode(pk_wif)
                     pk.shift()
                     pk.splice(-4, 4)
@@ -8228,14 +8318,14 @@
             },
 
             //generate a random Interger within range
-            randInt: function(min, max) {
+            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 = true) {
+            randString: function (length, alphaNumeric = true) {
                 var result = '';
                 if (alphaNumeric)
                     var characters = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789';
@@ -8248,7 +8338,7 @@
             },
 
             //Encrypt Data using public-key
-            encryptData: function(data, receiverCompressedPublicKey) {
+            encryptData: function (data, receiverCompressedPublicKey) {
                 var senderECKeyData = this.util.getSenderPublicKeyString();
                 var senderDerivedKey = this.util.deriveSharedKeySender(receiverCompressedPublicKey, senderECKeyData
                     .privateKey);
@@ -8261,7 +8351,7 @@
             },
 
             //Decrypt Data using private-key
-            decryptData: function(data, myPrivateKey) {
+            decryptData: function (data, myPrivateKey) {
                 var receiverECKeyData = {};
                 if (typeof myPrivateKey !== "string") throw new Error("No private key found.");
 
@@ -8272,7 +8362,7 @@
 
                 var receiverDerivedKey = this.util.deriveReceiverSharedKey(data.senderPublicKeyString,
                     receiverECKeyData
-                    .privateKey);
+                        .privateKey);
 
                 let receiverKey = receiverDerivedKey.XValue + receiverDerivedKey.YValue;
                 let decryptMsg = Crypto.AES.decrypt(data.secret, receiverKey);
@@ -8280,7 +8370,7 @@
             },
 
             //Sign data using private-key
-            signData: function(data, privateKeyHex) {
+            signData: function (data, privateKeyHex) {
                 var key = new Bitcoin.ECKey(privateKeyHex);
                 key.setCompressed(true);
 
@@ -8296,7 +8386,7 @@
             },
 
             //Verify signatue of the data using public-key
-            verifySign: function(data, signatureHex, publicKeyHex) {
+            verifySign: function (data, signatureHex, publicKeyHex) {
                 var msgHash = Crypto.SHA256(data);
                 var messageHashBigInteger = new BigInteger(msgHash);
 
@@ -8311,7 +8401,7 @@
             },
 
             //Generates a new flo ID and returns private-key, public-key and floID
-            generateNewID: function() {
+            generateNewID: function () {
                 try {
                     var key = new Bitcoin.ECKey(false);
                     key.setCompressed(true);
@@ -8326,7 +8416,7 @@
             },
 
             //Returns public-key from private-key
-            getPubKeyHex: function(privateKeyHex) {
+            getPubKeyHex: function (privateKeyHex) {
                 if (!privateKeyHex)
                     return null;
                 var key = new Bitcoin.ECKey(privateKeyHex);
@@ -8337,7 +8427,7 @@
             },
 
             //Returns flo-ID from public-key or private-key
-            getFloID: function(keyHex) {
+            getFloID: function (keyHex) {
                 if (!keyHex)
                     return null;
                 try {
@@ -8351,7 +8441,7 @@
             },
 
             //Verify the private-key for the given public-key or flo-ID
-            verifyPrivKey: function(privateKeyHex, pubKey_floID, isfloID = true) {
+            verifyPrivKey: function (privateKeyHex, pubKey_floID, isfloID = true) {
                 if (!privateKeyHex || !pubKey_floID)
                     return false;
                 try {
@@ -8371,7 +8461,7 @@
             },
 
             //Check if the given Address is valid or not
-            validateAddr: function(inpAddr) {
+            validateAddr: function (inpAddr) {
                 if (!inpAddr)
                     return false;
                 try {
@@ -8383,7 +8473,7 @@
             },
 
             //Split the str using shamir's Secret and Returns the shares 
-            createShamirsSecretShares: function(str, total_shares, threshold_limit) {
+            createShamirsSecretShares: function (str, total_shares, threshold_limit) {
                 try {
                     if (str.length > 0) {
                         var strHex = shamirSecretShare.str2hex(str);
@@ -8397,12 +8487,12 @@
             },
 
             //Verifies the shares and str
-            verifyShamirsSecret: function(sharesArray, str) {
+            verifyShamirsSecret: function (sharesArray, str) {
                 return (str && this.retrieveShamirSecret(sharesArray) === str)
             },
 
             //Returns the retrived secret by combining the shamirs shares
-            retrieveShamirSecret: function(sharesArray) {
+            retrieveShamirSecret: function (sharesArray) {
                 try {
                     if (sharesArray.length > 0) {
                         var comb = shamirSecretShare.combine(sharesArray.slice(0, sharesArray.length));
@@ -8415,7 +8505,7 @@
                 }
             },
 
-            validateASCII: function(string, bool = true) {
+            validateASCII: function (string, bool = true) {
                 if (typeof string !== "string")
                     return null;
                 if (bool) {
@@ -8433,8 +8523,8 @@
                         if (x < 32 || x > 127)
                             if (x in invalids)
                                 invalids[string[i]].push(i)
-                        else
-                            invalids[string[i]] = [i];
+                            else
+                                invalids[string[i]] = [i];
                     }
                     if (Object.keys(invalids).length)
                         return invalids;
@@ -8443,7 +8533,7 @@
                 }
             },
 
-            convertToASCII: function(string, mode = 'soft-remove') {
+            convertToASCII: function (string, mode = 'soft-remove') {
                 let chars = this.validateASCII(string, false);
                 if (chars === true)
                     return string;
@@ -8454,9 +8544,9 @@
                 this.util.asciiAlternatives.split('\n').forEach(a => refAlt[a[0]] = a.slice(2));
                 mode = mode.toLowerCase();
                 if (mode === "hard-unicode")
-                    convertor = (c) => `\\u${('000'+c.charCodeAt().toString(16)).slice(-4)}`;
+                    convertor = (c) => `\\u${('000' + c.charCodeAt().toString(16)).slice(-4)}`;
                 else if (mode === "soft-unicode")
-                    convertor = (c) => refAlt[c] || `\\u${('000'+c.charCodeAt().toString(16)).slice(-4)}`;
+                    convertor = (c) => refAlt[c] || `\\u${('000' + c.charCodeAt().toString(16)).slice(-4)}`;
                 else if (mode === "hard-remove")
                     convertor = c => "";
                 else if (mode === "soft-remove")
@@ -8468,7 +8558,7 @@
                 return result;
             },
 
-            revertUnicode: function(string) {
+            revertUnicode: function (string) {
                 return string.replace(/\\u[\dA-F]{4}/gi,
                     m => String.fromCharCode(parseInt(m.replace(/\\u/g, ''), 16)));
             }
@@ -8481,7 +8571,7 @@
             util: {
                 serverList: floGlobals.apiURL[floGlobals.blockchain].slice(0),
                 curPos: floCrypto.randInt(0, floGlobals.apiURL[floGlobals.blockchain].length - 1),
-                fetch_retry: function(apicall, rm_flosight) {
+                fetch_retry: function (apicall, rm_flosight) {
                     return new Promise((resolve, reject) => {
                         let i = this.serverList.indexOf(rm_flosight)
                         if (i != -1) this.serverList.splice(i, 1);
@@ -8491,7 +8581,7 @@
                             .catch(error => reject(error));
                     })
                 },
-                fetch_api: function(apicall) {
+                fetch_api: function (apicall) {
                     return new Promise((resolve, reject) => {
                         if (this.serverList.length === 0)
                             reject("No floSight server working")
@@ -8514,13 +8604,13 @@
                     })
                 },
 
-                current: function() {
+                current: function () {
                     return this.serverList[this.curPos];
                 }
             },
 
             //Promised function to get data from API
-            promisedAPI: function(apicall) {
+            promisedAPI: function (apicall) {
                 return new Promise((resolve, reject) => {
                     console.log(apicall)
                     this.util.fetch_api(apicall)
@@ -8530,7 +8620,7 @@
             },
 
             //Get balance for the given Address
-            getBalance: function(addr) {
+            getBalance: function (addr) {
                 return new Promise((resolve, reject) => {
                     this.promisedAPI(`api/addr/${addr}/balance`)
                         .then(balance => resolve(parseFloat(balance)))
@@ -8539,7 +8629,7 @@
             },
 
             //Write Data into blockchain
-            writeData: function(senderAddr, data, privKey, receiverAddr = floGlobals.adminID) {
+            writeData: function (senderAddr, data, privKey, receiverAddr = floGlobals.adminID) {
                 return new Promise((resolve, reject) => {
                     if (typeof data != "string")
                         data = JSON.stringify(data);
@@ -8550,7 +8640,7 @@
             },
 
             //Send Tx to blockchain 
-            sendTx: function(senderAddr, receiverAddr, sendAmt, privKey, floData = '') {
+            sendTx: function (senderAddr, receiverAddr, sendAmt, privKey, floData = '') {
                 return new Promise((resolve, reject) => {
                     if (!floCrypto.validateASCII(floData))
                         return reject("Invalid FLO_Data: only printable ASCII characters are allowed");
@@ -8594,7 +8684,7 @@
             },
 
             //merge all UTXOs of a given floID into a single UTXO
-            mergeUTXOs: function(floID, privKey, floData = '') {
+            mergeUTXOs: function (floID, privKey, floData = '') {
                 return new Promise((resolve, reject) => {
                     if (!floCrypto.validateAddr(floID))
                         return reject(`Invalid floID`);
@@ -8631,7 +8721,7 @@
              * @param  {boolean} preserveRatio (optional) preserve ratio or equal contribution
              * @return {Promise}
              */
-            writeDataMultiple: function(senderPrivKeys, data, receivers = [floGlobals.adminID], preserveRatio = true) {
+            writeDataMultiple: function (senderPrivKeys, data, receivers = [floGlobals.adminID], preserveRatio = true) {
                 return new Promise((resolve, reject) => {
                     if (!Array.isArray(senderPrivKeys))
                         return reject("Invalid senderPrivKeys: SenderPrivKeys must be Array")
@@ -8663,7 +8753,7 @@
              * @param  {string} floData FLO data of the txn
              * @return {Promise}
              */
-            sendTxMultiple: function(senderPrivKeys, receivers, floData = '') {
+            sendTxMultiple: function (senderPrivKeys, receivers, floData = '') {
                 return new Promise((resolve, reject) => {
                     if (!floCrypto.validateASCII(floData))
                         return reject("Invalid FLO_Data: only printable ASCII characters are allowed");
@@ -8706,7 +8796,7 @@
                                         invalids.InvalidSenderPrivKeys.push(key);
                                     else {
                                         if (typeof senderPrivKeys[key] !== 'number' || senderPrivKeys[
-                                                key] <= 0)
+                                            key] <= 0)
                                             invalids.InvalidSenderAmountFor.push(key)
                                         else
                                             inputVal += senderPrivKeys[key];
@@ -8760,7 +8850,7 @@
                         for (let floID in senders) {
                             balance[floID] = parseFloat(results.shift());
                             if (isNaN(balance[floID]) || (preserveRatio && balance[floID] <=
-                                    totalFee) || (!preserveRatio && balance[floID] < senders[floID]
+                                totalFee) || (!preserveRatio && balance[floID] < senders[floID]
                                     .coins + dividedFee))
                                 insufficient.push(floID)
                             totalBalance += balance[floID];
@@ -8822,7 +8912,7 @@
             },
 
             //Broadcast signed Tx in blockchain using API
-            broadcastTx: function(signedTxHash) {
+            broadcastTx: function (signedTxHash) {
                 return new Promise((resolve, reject) => {
                     var request = new XMLHttpRequest();
                     var url = this.util.serverList[this.util.curPos] + 'api/tx/send';
@@ -8834,7 +8924,7 @@
                         request.open('POST', url, true);
                         //Send the proper header information along with the request
                         request.setRequestHeader('Content-type', 'application/json');
-                        request.onload = function() {
+                        request.onload = function () {
                             if (request.readyState == 4 && request.status == 200) {
                                 console.log(request.response);
                                 resolve(JSON.parse(request.response).txid.result);
@@ -8846,7 +8936,7 @@
                 })
             },
 
-            getTx: function(txid) {
+            getTx: function (txid) {
                 return new Promise((resolve, reject) => {
                     this.promisedAPI(`api/tx/${txid}`)
                         .then(response => resolve(response))
@@ -8855,7 +8945,7 @@
             },
 
             //Read Txs of Address between from and to
-            readTxs: function(addr, from, 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))
@@ -8864,7 +8954,7 @@
             },
 
             //Read All Txs of Address (newest first)
-            readAllTxs: function(addr) {
+            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`)
@@ -8886,7 +8976,7 @@
             sender      : flo-id(s) of sender
             receiver    : flo-id(s) of receiver
             */
-            readData: function(addr, options = {}) {
+            readData: function (addr, options = {}) {
                 options.limit = options.limit || 0
                 options.ignoreOld = options.ignoreOld || 0
                 if (typeof options.sender === "string") options.sender = [options.sender];
@@ -8894,7 +8984,7 @@
                 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(
+                        this.promisedAPI(`api/addrs/${addr}/txs?from=0&to=${newItems * 2}`).then(
                             response => {
                                 if (options.limit <= 0)
                                     options.limit = response.items.length;
@@ -8964,8 +9054,8 @@
                                     data: filteredData
                                 });
                             }).catch(error => {
-                            reject(error);
-                        });
+                                reject(error);
+                            });
                     }).catch(error => {
                         reject(error);
                     });
@@ -8985,11 +9075,11 @@
 
         const compactIDB = {
 
-            setDefaultDB: function(dbName) {
+            setDefaultDB: function (dbName) {
                 this.defaultDB = dbName;
             },
 
-            upgradeDB: function(dbName, createList = null, deleteList = null) {
+            upgradeDB: function (dbName, createList = null, deleteList = null) {
                 return new Promise((resolve, reject) => {
                     this.getDBversion(dbName).then(version => {
                         var idb = indexedDB.open(dbName, version + 1);
@@ -9018,7 +9108,7 @@
                 })
             },
 
-            initDB: function(dbName, objectStores = {}) {
+            initDB: function (dbName, objectStores = {}) {
                 return new Promise((resolve, reject) => {
                     if (!(objectStores instanceof Object))
                         return reject('ObjectStores must be an object or array')
@@ -9046,14 +9136,14 @@
                             resolve("Initiated IndexedDB");
                         else
                             this.upgradeDB(dbName, a_obs, d_obs)
-                            .then(result => resolve(result))
-                            .catch(error => reject(error))
+                                .then(result => resolve(result))
+                                .catch(error => reject(error))
                         db.close();
                     }
                 });
             },
 
-            openDB: function(dbName = this.defaultDB) {
+            openDB: function (dbName = this.defaultDB) {
                 return new Promise((resolve, reject) => {
                     var idb = indexedDB.open(dbName);
                     idb.onerror = (event) => reject("Error in opening IndexedDB");
@@ -9066,7 +9156,7 @@
                 });
             },
 
-            deleteDB: function(dbName = this.defaultDB) {
+            deleteDB: function (dbName = this.defaultDB) {
                 return new Promise((resolve, reject) => {
                     var deleteReq = indexedDB.deleteDatabase(dbName);;
                     deleteReq.onerror = (event) => reject("Error deleting database!");
@@ -9074,7 +9164,7 @@
                 });
             },
 
-            getDBversion: function(dbName = this.defaultDB) {
+            getDBversion: function (dbName = this.defaultDB) {
                 return new Promise((resolve, reject) => {
                     this.openDB(dbName).then(db => {
                         resolve(db.version)
@@ -9083,7 +9173,7 @@
                 })
             },
 
-            writeData: function(obsName, data, key = false, dbName = this.defaultDB) {
+            writeData: function (obsName, data, key = false, dbName = this.defaultDB) {
                 return new Promise((resolve, reject) => {
                     this.openDB(dbName).then(db => {
                         var obs = db.transaction(obsName, "readwrite").objectStore(obsName);
@@ -9097,7 +9187,7 @@
                 });
             },
 
-            addData: function(obsName, data, key = false, dbName = this.defaultDB) {
+            addData: function (obsName, data, key = false, dbName = this.defaultDB) {
                 return new Promise((resolve, reject) => {
                     this.openDB(dbName).then(db => {
                         var obs = db.transaction(obsName, "readwrite").objectStore(obsName);
@@ -9111,7 +9201,7 @@
                 });
             },
 
-            removeData: function(obsName, key, dbName = this.defaultDB) {
+            removeData: function (obsName, key, dbName = this.defaultDB) {
                 return new Promise((resolve, reject) => {
                     this.openDB(dbName).then(db => {
                         var obs = db.transaction(obsName, "readwrite").objectStore(obsName);
@@ -9125,7 +9215,7 @@
                 });
             },
 
-            clearData: function(obsName, dbName = this.defaultDB) {
+            clearData: function (obsName, dbName = this.defaultDB) {
                 return new Promise((resolve, reject) => {
                     this.openDB(dbName).then(db => {
                         var obs = db.transaction(obsName, "readwrite").objectStore(obsName);
@@ -9137,7 +9227,7 @@
                 });
             },
 
-            readData: function(obsName, key, dbName = this.defaultDB) {
+            readData: function (obsName, key, dbName = this.defaultDB) {
                 return new Promise((resolve, reject) => {
                     this.openDB(dbName).then(db => {
                         var obs = db.transaction(obsName, "readonly").objectStore(obsName);
@@ -9151,7 +9241,7 @@
                 });
             },
 
-            readAllData: function(obsName, dbName = this.defaultDB) {
+            readAllData: function (obsName, dbName = this.defaultDB) {
                 return new Promise((resolve, reject) => {
                     this.openDB(dbName).then(db => {
                         var obs = db.transaction(obsName, "readonly").objectStore(obsName);
@@ -9173,7 +9263,7 @@
                 });
             },
 
-            searchData: function(obsName, options = {}, dbName = this.defaultDB) {
+            searchData: function (obsName, options = {}, dbName = this.defaultDB) {
                 options.lowerKey = options.atKey || options.lowerKey || 0
                 options.upperKey = options.atKey || options.upperKey || false
                 options.patternEval = options.patternEval || ((k, v) => {
@@ -9231,7 +9321,7 @@
                             return nodeIdNewInt8Array;
                         },
 
-                        addNode: function(floID, KB) {
+                        addNode: function (floID, KB) {
                             let decodedId = this.decodeID(floID);
                             const contact = {
                                 id: decodedId,
@@ -9240,27 +9330,27 @@
                             KB.add(contact)
                         },
 
-                        removeNode: function(floID, KB) {
+                        removeNode: function (floID, KB) {
                             let decodedId = this.decodeID(floID);
                             KB.remove(decodedId)
                         },
 
-                        isPresent: function(floID, KB) {
+                        isPresent: function (floID, KB) {
                             let kArray = KB.toArray().map(k => k.floID);
                             return kArray.includes(floID)
                         },
 
-                        distanceOf: function(floID, KB) {
+                        distanceOf: function (floID, KB) {
                             let decodedId = this.decodeID(floID);
                             return KB.distance(KB.localNodeId, decodedId);
                         },
 
-                        closestOf: function(floID, n, KB) {
+                        closestOf: function (floID, n, KB) {
                             let decodedId = this.decodeID(floID);
                             return KB.closest(decodedId, n)
                         },
 
-                        constructKB: function(list, refID) {
+                        constructKB: function (list, refID) {
                             const KBoptions = {
                                 localNodeId: this.decodeID(refID)
                             };
@@ -9271,15 +9361,15 @@
                         }
                     },
 
-                    launch: function() {
+                    launch: function () {
                         return new Promise((resolve, reject) => {
                             try {
                                 let superNodeList = Object.keys(floGlobals.supernodes);
                                 let masterID = floGlobals.SNStorageID;
                                 this.SNKB = this.util.constructKB(superNodeList, masterID);
                                 this.SNCO = superNodeList.map(sn => [this.util.distanceOf(sn, this.SNKB),
-                                        sn
-                                    ])
+                                    sn
+                                ])
                                     .sort((a, b) => a[0] - b[0])
                                     .map(a => a[1])
                                 resolve('Supernode KBucket formed');
@@ -9289,7 +9379,7 @@
                         });
                     },
 
-                    innerNodes: function(id1, id2) {
+                    innerNodes: function (id1, id2) {
                         if (!this.SNCO.includes(id1) || !this.SNCO.includes(id2))
                             throw Error('Given nodes are not supernode');
                         let iNodes = []
@@ -9301,7 +9391,7 @@
                         return iNodes
                     },
 
-                    outterNodes: function(id1, id2) {
+                    outterNodes: function (id1, id2) {
                         if (!this.SNCO.includes(id1) || !this.SNCO.includes(id2))
                             throw Error('Given nodes are not supernode');
                         let oNodes = []
@@ -9313,7 +9403,7 @@
                         return oNodes
                     },
 
-                    prevNode: function(id, N = 1) {
+                    prevNode: function (id, N = 1) {
                         let n = N || this.SNCO.length;
                         if (!this.SNCO.includes(id))
                             throw Error('Given node is not supernode');
@@ -9328,7 +9418,7 @@
                         return (N == 1 ? pNodes[0] : pNodes)
                     },
 
-                    nextNode: function(id, N = 1) {
+                    nextNode: function (id, N = 1) {
                         let n = N || this.SNCO.length;
                         if (!this.SNCO.includes(id))
                             throw Error('Given node is not supernode');
@@ -9344,7 +9434,7 @@
                         return (N == 1 ? nNodes[0] : nNodes)
                     },
 
-                    closestNode: function(id, N = 1) {
+                    closestNode: function (id, N = 1) {
                         let decodedId = this.util.decodeID(id);
                         let n = N || this.SNCO.length;
                         let cNodes = this.SNKB.closest(decodedId, n)
@@ -9391,7 +9481,7 @@
                     })
                 },
 
-                fetch_API: function(snID, data) {
+                fetch_API: function (snID, data) {
                     return new Promise((resolve, reject) => {
                         if (this.inactive.has(snID))
                             return reject(`${snID} is not active`);
@@ -9409,7 +9499,7 @@
                     })
                 },
 
-                fetch_ActiveAPI: function(snID, data, reverse = false) {
+                fetch_ActiveAPI: function (snID, data, reverse = false) {
                     return new Promise((resolve, reject) => {
                         if (this.inactive.size === this.kBucket.SNCO.length)
                             return reject('Cloud offline');
@@ -9430,7 +9520,7 @@
                     })
                 },
 
-                singleRequest: function(floID, data_obj, method = "POST") {
+                singleRequest: function (floID, data_obj, method = "POST") {
                     return new Promise((resolve, reject) => {
                         let data;
                         if (method === "POST")
@@ -9452,7 +9542,7 @@
                     })
                 },
 
-                liveRequest: function(floID, request, callback) {
+                liveRequest: function (floID, request, callback) {
                     const checkFilter = (v, d, r) =>
                         (!r.atVectorClock || r.atVectorClock == v) &&
                         (r.atVectorClock || !r.lowerVectorClock || r.lowerVectorClock <= v) &&
@@ -9488,21 +9578,21 @@
                     });
                 },
 
-                encodeMessage: function(message) {
+                encodeMessage: function (message) {
                     return btoa(unescape(encodeURIComponent(JSON.stringify(message))))
                 },
 
-                decodeMessage: function(message) {
+                decodeMessage: function (message) {
                     return JSON.parse(decodeURIComponent(escape(atob(message))))
                 },
 
-                filterKey: function(type, options) {
+                filterKey: function (type, options) {
                     return type + (options.comment ? ':' + options.comment : '') +
                         '|' + (options.receiverID || floGlobals.adminID) +
                         '|' + (options.application || floGlobals.application);
                 },
 
-                lastCommit: function(method, objName) {
+                lastCommit: function (method, objName) {
                     switch (method) {
                         case "GET":
                             return JSON.parse(this.lastCommit[objName]);
@@ -9511,7 +9601,7 @@
                     }
                 },
 
-                updateObject: function(dataSet) {
+                updateObject: function (dataSet) {
                     try {
                         console.log(dataSet)
                         let updatedObjects = new Set()
@@ -9538,7 +9628,7 @@
                     }
                 },
 
-                storeGeneral: function(fk, dataSet) {
+                storeGeneral: function (fk, dataSet) {
                     try {
                         console.log(dataSet)
                         if (typeof floGlobals.generalData[fk] !== "object")
@@ -9553,7 +9643,7 @@
                     }
                 },
 
-                objectifier: function(data) {
+                objectifier: function (data) {
                     if (!Array.isArray(data))
                         data = [data];
                     return Object.fromEntries(data.map(d => {
@@ -9564,7 +9654,7 @@
             },
 
             //send Any message to supernode cloud storage
-            sendApplicationData: function(message, type, options = {}) {
+            sendApplicationData: function (message, type, options = {}) {
                 return new Promise((resolve, reject) => {
                     var data = {
                         senderID: myFloID,
@@ -9586,7 +9676,7 @@
             },
 
             //request any data from supernode cloud
-            requestApplicationData: function(type, options = {}) {
+            requestApplicationData: function (type, options = {}) {
                 return new Promise((resolve, reject) => {
                     var request = {
                         receiverID: options.receiverID || floGlobals.adminID,
@@ -9617,7 +9707,7 @@
             },
 
             //(NEEDS UPDATE) delete data from supernode cloud (received only)
-            deleteApplicationData: function(vectorClocks, options = {}) {
+            deleteApplicationData: function (vectorClocks, options = {}) {
                 return new Promise((resolve, reject) => {
                     var delreq = {
                         requestorID: myFloID,
@@ -9643,7 +9733,7 @@
             },
 
             //(NEEDS UPDATE) edit comment of data in supernode cloud (mutable comments only)
-            editApplicationData: function(vectorClock, newComment, oldData, options = {}) {
+            editApplicationData: function (vectorClock, newComment, oldData, options = {}) {
                 return new Promise((resolve, reject) => {
                     let p0
                     if (!oldData) {
@@ -9673,8 +9763,8 @@
                         }
                         d.comment = data.edit.comment;
                         let hashcontent = ["receiverID", "time", "application", "type", "message",
-                                "comment"
-                            ]
+                            "comment"
+                        ]
                             .map(x => d[x]).join("|")
                         data.edit.sign = floCrypto.signData(hashcontent, myPrivKey)
                         this.util.singleRequest(data.receiverID, data)
@@ -9685,7 +9775,7 @@
             },
 
             //mark data in supernode cloud (subAdmin access only)
-            markApplicationData: function(mark, options = {}) {
+            markApplicationData: function (mark, options = {}) {
                 return new Promise((resolve, reject) => {
                     if (!floGlobals.subAdmins.includes(myFloID))
                         return reject("Only subAdmins can mark data")
@@ -9720,7 +9810,7 @@
             },
 
             //send General Data
-            sendGeneralData: function(message, type, options = {}) {
+            sendGeneralData: function (message, type, options = {}) {
                 return new Promise((resolve, reject) => {
                     if (options.encrypt) {
                         let encryptionKey = options.encrypt === true ?
@@ -9737,7 +9827,7 @@
             },
 
             //request General Data
-            requestGeneralData: function(type, options = {}) {
+            requestGeneralData: function (type, options = {}) {
                 return new Promise((resolve, reject) => {
                     var fk = this.util.filterKey(type, options)
                     options.lowerVectorClock = options.lowerVectorClock || floGlobals.lastVC[fk] + 1;
@@ -9760,7 +9850,7 @@
             },
 
             //request an object data from supernode cloud
-            requestObjectData: function(objectName, options = {}) {
+            requestObjectData: function (objectName, options = {}) {
                 return new Promise((resolve, reject) => {
                     options.lowerVectorClock = options.lowerVectorClock || floGlobals.lastVC[objectName] +
                         1;
@@ -9798,7 +9888,7 @@
                 })
             },
 
-            closeRequest: function(requestID) {
+            closeRequest: function (requestID) {
                 return new Promise((resolve, reject) => {
                     let conn = this.util.liveRequest[requestID]
                     if (!conn)
@@ -9812,7 +9902,7 @@
             },
 
             //reset or initialize an object and send it to cloud
-            resetObjectData: function(objectName, options = {}) {
+            resetObjectData: function (objectName, options = {}) {
                 return new Promise((resolve, reject) => {
                     let message = {
                         reset: floGlobals.appObjects[objectName]
@@ -9826,7 +9916,7 @@
             },
 
             //update the diff and send it to cloud
-            updateObjectData: function(objectName, options = {}) {
+            updateObjectData: function (objectName, options = {}) {
                 return new Promise((resolve, reject) => {
                     let message = {
                         diff: findDiff(this.util.lastCommit("GET", objectName), floGlobals.appObjects[
@@ -9850,7 +9940,7 @@
             this.arbiter = options.arbiter || this.arbiter
             this.metadata = Object.assign({}, options.metadata)
 
-            this.createNode = function() {
+            this.createNode = function () {
                 return {
                     contacts: [],
                     dontSplit: false,
@@ -9859,12 +9949,12 @@
                 }
             }
 
-            this.ensureInt8 = function(name, val) {
+            this.ensureInt8 = function (name, val) {
                 if (!(val instanceof Uint8Array))
                     throw new TypeError(name + ' is not a Uint8Array')
             }
 
-            this.arrayEquals = function(array1, array2) {
+            this.arrayEquals = function (array1, array2) {
                 if (array1 === array2)
                     return true
                 if (array1.length !== array2.length)
@@ -9878,11 +9968,11 @@
             this.ensureInt8('option.localNodeId as parameter 1', this.localNodeId)
             this.root = this.createNode()
 
-            this.arbiter = function(incumbent, candidate) {
+            this.arbiter = function (incumbent, candidate) {
                 return incumbent.vectorClock > candidate.vectorClock ? incumbent : candidate
             }
 
-            this.distance = function(firstId, secondId) {
+            this.distance = function (firstId, secondId) {
                 let distance = 0
                 let i = 0
                 const min = Math.min(firstId.length, secondId.length)
@@ -9893,7 +9983,7 @@
                 return distance
             }
 
-            this.add = function(contact) {
+            this.add = function (contact) {
                 this.ensureInt8('contact.id', (contact || {}).id)
                 let bitIndex = 0
                 let node = this.root
@@ -9914,7 +10004,7 @@
                 return this.add(contact)
             }
 
-            this.closest = function(id, n = Infinity) {
+            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')
@@ -9935,7 +10025,7 @@
                     .map(a => a[1])
             }
 
-            this.count = function() {
+            this.count = function () {
                 let count = 0
                 for (const nodes = [this.root]; nodes.length > 0;) {
                     const node = nodes.pop()
@@ -9947,7 +10037,7 @@
                 return count
             }
 
-            this._determineNode = function(node, id, bitIndex) {
+            this._determineNode = function (node, id, bitIndex) {
                 const bytesDescribedByBitIndex = bitIndex >> 3
                 const bitIndexWithinByte = bitIndex % 8
                 if ((id.length <= bytesDescribedByBitIndex) && (bitIndexWithinByte !== 0))
@@ -9958,7 +10048,7 @@
                 return node.left
             }
 
-            this.get = function(id) {
+            this.get = function (id) {
                 this.ensureInt8('id', id)
                 let bitIndex = 0
                 let node = this.root
@@ -9968,14 +10058,14 @@
                 return index >= 0 ? node.contacts[index] : null
             }
 
-            this._indexOf = function(node, id) {
+            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
             }
 
-            this.remove = function(id) {
+            this.remove = function (id) {
                 this.ensureInt8('the id as parameter 1', id)
                 let bitIndex = 0
                 let node = this.root
@@ -9987,7 +10077,7 @@
                 return this
             }
 
-            this._split = function(node, bitIndex) {
+            this._split = function (node, bitIndex) {
                 node.left = this.createNode()
                 node.right = this.createNode()
                 for (const contact of node.contacts)
@@ -9998,7 +10088,7 @@
                 otherNode.dontSplit = true
             }
 
-            this.toArray = function() {
+            this.toArray = function () {
                 let result = []
                 for (const nodes = [this.root]; nodes.length > 0;) {
                     const node = nodes.pop()
@@ -10010,7 +10100,7 @@
                 return result
             }
 
-            this._update = function(node, index, contact) {
+            this._update = function (node, index, contact) {
                 if (!this.arrayEquals(node.contacts[index].id, contact.id))
                     throw new Error('wrong index for _update')
                 const incumbent = node.contacts[index]
@@ -10027,7 +10117,7 @@
 
             util: {
 
-                initIndexedDB: function() {
+                initIndexedDB: function () {
                     return new Promise((resolve, reject) => {
                         var obs_g = {
                             //general
@@ -10065,7 +10155,7 @@
                     })
                 },
 
-                initUserDB: function(floID) {
+                initUserDB: function (floID) {
                     return new Promise((resolve, reject) => {
                         var obs = {
                             contacts: {},
@@ -10078,7 +10168,7 @@
                     })
                 },
 
-                loadUserDB: function(floID) {
+                loadUserDB: function (floID) {
                     return new Promise((resolve, reject) => {
                         var loadData = ["contacts", "pubKeys", "messages"]
                         var promises = []
@@ -10094,7 +10184,7 @@
 
                 startUpFunctions: {
 
-                    readSupernodeListFromAPI: function() {
+                    readSupernodeListFromAPI: function () {
                         return new Promise((resolve, reject) => {
                             compactIDB.readData("lastTx", floGlobals.SNStorageID, "floDapps").then(lastTx => {
                                 floBlockchainAPI.readData(floGlobals.SNStorageID, {
@@ -10121,7 +10211,7 @@
                         })
                     },
 
-                    readAppConfigFromAPI: function() {
+                    readAppConfigFromAPI: function () {
                         return new Promise((resolve, reject) => {
                             compactIDB.readData("lastTx", `${floGlobals.application}|${floGlobals.adminID}`, "floDapps").then(lastTx => {
                                 floBlockchainAPI.readData(floGlobals.adminID, {
@@ -10156,7 +10246,7 @@
                         })
                     },
 
-                    loadDataFromAppIDB: function() {
+                    loadDataFromAppIDB: function () {
                         return new Promise((resolve, reject) => {
                             var loadData = ["appObjects", "generalData", "lastVC"]
                             var promises = []
@@ -10171,9 +10261,9 @@
                     }
                 },
 
-                getCredentials: function() {
+                getCredentials: function () {
 
-                    const defaultInput = function(type) {
+                    const defaultInput = function (type) {
                         return new Promise((resolve, reject) => {
                             let inputVal = prompt(`Enter ${type}: `)
                             if (inputVal === null)
@@ -10185,7 +10275,7 @@
 
                     const inputFn = this.getCredentials.privKeyInput || defaultInput;
 
-                    const readSharesFromIDB = function(indexArr) {
+                    const readSharesFromIDB = function (indexArr) {
                         return new Promise((resolve, reject) => {
                             var promises = []
                             for (var i = 0; i < indexArr.length; i++)
@@ -10200,7 +10290,7 @@
                         })
                     }
 
-                    const writeSharesToIDB = function(shares, i = 0, resultIndexes = []) {
+                    const writeSharesToIDB = function (shares, i = 0, resultIndexes = []) {
                         return new Promise(resolve => {
                             if (i >= shares.length)
                                 return resolve(resultIndexes)
@@ -10216,7 +10306,7 @@
                         })
                     }
 
-                    const getPrivateKeyCredentials = function() {
+                    const getPrivateKeyCredentials = function () {
                         return new Promise((resolve, reject) => {
                             var indexArr = localStorage.getItem(`${floGlobals.application}#privKey`)
                             if (indexArr) {
@@ -10256,7 +10346,7 @@
                         })
                     }
 
-                    const checkIfPinRequired = function(key) {
+                    const checkIfPinRequired = function (key) {
                         return new Promise((resolve, reject) => {
                             if (key.length == 52)
                                 resolve(key)
@@ -10290,14 +10380,14 @@
                     })
                 },
 
-                startUpLog: function(status, log) {
+                startUpLog: function (status, log) {
                     if (status)
                         console.log(log)
                     else
                         console.error(log)
                 },
 
-                callStartUpFunction: function(fname) {
+                callStartUpFunction: function (fname) {
                     return new Promise((resolve, reject) => {
                         this.startUpFunctions[fname]().then(result => {
                             this.callStartUpFunction.completed += 1
@@ -10312,7 +10402,7 @@
                 }
             },
 
-            launchStartUp: function() {
+            launchStartUp: function () {
                 return new Promise((resolve, reject) => {
                     this.util.initIndexedDB().then(log => {
                         console.log(log)
@@ -10362,26 +10452,26 @@
                 })
             },
 
-            addStartUpFunction: function(fname, fn) {
+            addStartUpFunction: function (fname, fn) {
                 if (fname in this.util.startUpFunctions)
                     throw (`Function ${fname} already defined`)
                 this.util.startUpFunctions[fname] = fn;
             },
 
-            setMidStartup: function(fn) {
+            setMidStartup: function (fn) {
                 if (fn instanceof Function)
                     this.launchStartUp.midFunction = fn;
             },
 
-            setCustomStartupLogger: function(logger) {
+            setCustomStartupLogger: function (logger) {
                 this.util.startUpLog = logger;
             },
 
-            setCustomPrivKeyInput: function(customFn) {
+            setCustomPrivKeyInput: function (customFn) {
                 this.util.getCredentials.privKeyInput = customFn
             },
 
-            setAppObjectStores: function(appObs) {
+            setAppObjectStores: function (appObs) {
                 this.util.initIndexedDB.appObs = appObs
             },
 
@@ -10439,7 +10529,7 @@
                             try {
                                 if (d[v].message instanceof Object && "secret" in d[v].message)
                                     d[v].message = floCrypto.decryptData(d[v].message, myPrivKey)
-                            } catch (error) {}
+                            } catch (error) { }
                             compactIDB.writeData("messages", d[v], v, `floDapps#${myFloID}`)
                             floGlobals.messages[v] = d[v]
                         }
@@ -10471,12 +10561,12 @@
                         reject('Access Denied for Admin privilege')
                     else
                         floBlockchainAPI.writeData(floID, JSON.stringify(floData), adminPrivKey)
-                        .then(result => resolve(['Updated App Configuration', result]))
-                        .catch(error => reject(error))
+                            .then(result => resolve(['Updated App Configuration', result]))
+                            .catch(error => reject(error))
                 })
             },
 
-            clearCredentials: function() {
+            clearCredentials: function () {
                 return new Promise((resolve, reject) => {
                     compactIDB.clearData('credentials', floGlobals.application).then(result => {
                         localStorage.removeItem(`${floGlobals.application}#privKey`)
@@ -10486,7 +10576,7 @@
                 })
             },
 
-            deleteUserData: function(credentials = false) {
+            deleteUserData: function (credentials = false) {
                 return new Promise((resolve, reject) => {
                     let p = []
                     p.push(compactIDB.deleteDB(`floDapps#${myFloID}`))
@@ -10498,7 +10588,7 @@
                 })
             },
 
-            deleteAppData: function() {
+            deleteAppData: function () {
                 return new Promise((resolve, reject) => {
                     compactIDB.deleteDB(floGlobals.application).then(result => {
                         localStorage.removeItem(`${floGlobals.application}#privKey`)
@@ -10510,7 +10600,7 @@
                 })
             },
 
-            securePrivKey: function(pwd) {
+            securePrivKey: function (pwd) {
                 return new Promise((resolve, reject) => {
                     let indexArr = localStorage.getItem(`${floGlobals.application}#privKey`)
                     if (!indexArr)
@@ -10530,7 +10620,7 @@
                 })
             },
 
-            getNextGeneralData: function(type, vectorClock = null, options = {}) {
+            getNextGeneralData: function (type, vectorClock = null, options = {}) {
                 var fk = floCloudAPI.util.filterKey(type, options)
                 vectorClock = vectorClock || this.getNextGeneralData[fk] || '0';
                 var filteredResult = {}
@@ -10559,10 +10649,10 @@
                                         let tmp = floCrypto.decryptData(data.message, key)
                                         data.message = JSON.parse(tmp)
                                         break;
-                                    } catch (error) {}
+                                    } catch (error) { }
                                 }
                             }
-                        } catch (error) {}
+                        } catch (error) { }
                     }
                 }
                 this.getNextGeneralData[fk] = Object.keys(filteredResult).sort().pop();
@@ -10570,7 +10660,7 @@
             },
 
             syncData: {
-                oldDevice: function() {
+                oldDevice: function () {
                     return new Promise((resolve, reject) => {
                         let sync = {
                             contacts: floGlobals.contacts,
@@ -10617,12 +10707,12 @@
         }
     </script>
     <script>
-        /* decimal.js v10.2.1 https://github.com/MikeMcl/decimal.js/LICENCE */!function(n){"use strict";var h,S,e,o,u=9e15,g=1e9,m="0123456789abcdef",t="2.3025850929940456840179914546843642076011014886287729760333279009675726096773524802359972050895982983419677840422862486334095254650828067566662873690987816894829072083255546808437998948262331985283935053089653777326288461633662222876982198867465436674744042432743651550489343149393914796194044002221051017141748003688084012647080685567743216228355220114804663715659121373450747856947683463616792101806445070648000277502684916746550586856935673420670581136429224554405758925724208241314695689016758940256776311356919292033376587141660230105703089634572075440370847469940168269282808481184289314848524948644871927809676271275775397027668605952496716674183485704422507197965004714951050492214776567636938662976979522110718264549734772662425709429322582798502585509785265383207606726317164309505995087807523710333101197857547331541421808427543863591778117054309827482385045648019095610299291824318237525357709750539565187697510374970888692180205189339507238539205144634197265287286965110862571492198849978748873771345686209167058",r="3.1415926535897932384626433832795028841971693993751058209749445923078164062862089986280348253421170679821480865132823066470938446095505822317253594081284811174502841027019385211055596446229489549303819644288109756659334461284756482337867831652712019091456485669234603486104543266482133936072602491412737245870066063155881748815209209628292540917153643678925903600113305305488204665213841469519415116094330572703657595919530921861173819326117931051185480744623799627495673518857527248912279381830119491298336733624406566430860213949463952247371907021798609437027705392171762931767523846748184676694051320005681271452635608277857713427577896091736371787214684409012249534301465495853710507922796892589235420199561121290219608640344181598136297747713099605187072113499999983729780499510597317328160963185950244594553469083026425223082533446850352619311881710100031378387528865875332083814206171776691473035982534904287554687311595628638823537875937519577818577805321712268066130019278766111959092164201989380952572010654858632789",c={precision:20,rounding:4,modulo:1,toExpNeg:-7,toExpPos:21,minE:-u,maxE:u,crypto:!1},N=!0,f="[DecimalError] ",w=f+"Invalid argument: ",s=f+"Precision limit exceeded",a=f+"crypto unavailable",Z=Math.floor,v=Math.pow,l=/^0b([01]+(\.[01]*)?|\.[01]+)(p[+-]?\d+)?$/i,d=/^0x([0-9a-f]+(\.[0-9a-f]*)?|\.[0-9a-f]+)(p[+-]?\d+)?$/i,p=/^0o([0-7]+(\.[0-7]*)?|\.[0-7]+)(p[+-]?\d+)?$/i,b=/^(\d+(\.\d*)?|\.\d+)(e[+-]?\d+)?$/i,P=1e7,R=7,E=t.length-1,x=r.length-1,y={name:"[object Decimal]"};function M(n){var e,i,t,r=n.length-1,s="",o=n[0];if(0<r){for(s+=o,e=1;e<r;e++)t=n[e]+"",(i=R-t.length)&&(s+=B(i)),s+=t;o=n[e],(i=R-(t=o+"").length)&&(s+=B(i))}else if(0===o)return"0";for(;o%10==0;)o/=10;return s+o}function q(n,e,i){if(n!==~~n||n<e||i<n)throw Error(w+n)}function O(n,e,i,t){for(var r,s,o=n[0];10<=o;o/=10)--e;return--e<0?(e+=R,r=0):(r=Math.ceil((e+1)/R),e%=R),o=v(10,R-e),s=n[r]%o|0,null==t?e<3?(0==e?s=s/100|0:1==e&&(s=s/10|0),i<4&&99999==s||3<i&&49999==s||5e4==s||0==s):(i<4&&s+1==o||3<i&&s+1==o/2)&&(n[r+1]/o/100|0)==v(10,e-2)-1||(s==o/2||0==s)&&0==(n[r+1]/o/100|0):e<4?(0==e?s=s/1e3|0:1==e?s=s/100|0:2==e&&(s=s/10|0),(t||i<4)&&9999==s||!t&&3<i&&4999==s):((t||i<4)&&s+1==o||!t&&3<i&&s+1==o/2)&&(n[r+1]/o/1e3|0)==v(10,e-3)-1}function D(n,e,i){for(var t,r,s=[0],o=0,u=n.length;o<u;){for(r=s.length;r--;)s[r]*=e;for(s[0]+=m.indexOf(n.charAt(o++)),t=0;t<s.length;t++)s[t]>i-1&&(void 0===s[t+1]&&(s[t+1]=0),s[t+1]+=s[t]/i|0,s[t]%=i)}return s.reverse()}y.absoluteValue=y.abs=function(){var n=new this.constructor(this);return n.s<0&&(n.s=1),_(n)},y.ceil=function(){return _(new this.constructor(this),this.e+1,2)},y.comparedTo=y.cmp=function(n){var e,i,t,r,s=this,o=s.d,u=(n=new s.constructor(n)).d,c=s.s,f=n.s;if(!o||!u)return c&&f?c!==f?c:o===u?0:!o^c<0?1:-1:NaN;if(!o[0]||!u[0])return o[0]?c:u[0]?-f:0;if(c!==f)return c;if(s.e!==n.e)return s.e>n.e^c<0?1:-1;for(e=0,i=(t=o.length)<(r=u.length)?t:r;e<i;++e)if(o[e]!==u[e])return o[e]>u[e]^c<0?1:-1;return t===r?0:r<t^c<0?1:-1},y.cosine=y.cos=function(){var n,e,i=this,t=i.constructor;return i.d?i.d[0]?(n=t.precision,e=t.rounding,t.precision=n+Math.max(i.e,i.sd())+R,t.rounding=1,i=function(n,e){var i,t,r=e.d.length;t=r<32?(i=Math.ceil(r/3),(1/K(4,i)).toString()):(i=16,"2.3283064365386962890625e-10");n.precision+=i,e=G(n,1,e.times(t),new n(1));for(var s=i;s--;){var o=e.times(e);e=o.times(o).minus(o).times(8).plus(1)}return n.precision-=i,e}(t,Q(t,i)),t.precision=n,t.rounding=e,_(2==o||3==o?i.neg():i,n,e,!0)):new t(1):new t(NaN)},y.cubeRoot=y.cbrt=function(){var n,e,i,t,r,s,o,u,c,f,a=this,h=a.constructor;if(!a.isFinite()||a.isZero())return new h(a);for(N=!1,(s=a.s*v(a.s*a,1/3))&&Math.abs(s)!=1/0?t=new h(s.toString()):(i=M(a.d),(s=((n=a.e)-i.length+1)%3)&&(i+=1==s||-2==s?"0":"00"),s=v(i,1/3),n=Z((n+1)/3)-(n%3==(n<0?-1:2)),(t=new h(i=s==1/0?"5e"+n:(i=s.toExponential()).slice(0,i.indexOf("e")+1)+n)).s=a.s),o=(n=h.precision)+3;;)if(f=(c=(u=t).times(u).times(u)).plus(a),t=F(f.plus(a).times(u),f.plus(c),o+2,1),M(u.d).slice(0,o)===(i=M(t.d)).slice(0,o)){if("9999"!=(i=i.slice(o-3,o+1))&&(r||"4999"!=i)){+i&&(+i.slice(1)||"5"!=i.charAt(0))||(_(t,n+1,1),e=!t.times(t).times(t).eq(a));break}if(!r&&(_(u,n+1,0),u.times(u).times(u).eq(a))){t=u;break}o+=4,r=1}return N=!0,_(t,n,h.rounding,e)},y.decimalPlaces=y.dp=function(){var n,e=this.d,i=NaN;if(e){if(i=((n=e.length-1)-Z(this.e/R))*R,n=e[n])for(;n%10==0;n/=10)i--;i<0&&(i=0)}return i},y.dividedBy=y.div=function(n){return F(this,new this.constructor(n))},y.dividedToIntegerBy=y.divToInt=function(n){var e=this.constructor;return _(F(this,new e(n),0,1,1),e.precision,e.rounding)},y.equals=y.eq=function(n){return 0===this.cmp(n)},y.floor=function(){return _(new this.constructor(this),this.e+1,3)},y.greaterThan=y.gt=function(n){return 0<this.cmp(n)},y.greaterThanOrEqualTo=y.gte=function(n){var e=this.cmp(n);return 1==e||0===e},y.hyperbolicCosine=y.cosh=function(){var n,e,i,t,r,s=this,o=s.constructor,u=new o(1);if(!s.isFinite())return new o(s.s?1/0:NaN);if(s.isZero())return u;i=o.precision,t=o.rounding,o.precision=i+Math.max(s.e,s.sd())+4,o.rounding=1,e=(r=s.d.length)<32?(1/K(4,n=Math.ceil(r/3))).toString():(n=16,"2.3283064365386962890625e-10"),s=G(o,1,s.times(e),new o(1),!0);for(var c,f=n,a=new o(8);f--;)c=s.times(s),s=u.minus(c.times(a.minus(c.times(a))));return _(s,o.precision=i,o.rounding=t,!0)},y.hyperbolicSine=y.sinh=function(){var n,e,i,t,r=this,s=r.constructor;if(!r.isFinite()||r.isZero())return new s(r);if(e=s.precision,i=s.rounding,s.precision=e+Math.max(r.e,r.sd())+4,s.rounding=1,(t=r.d.length)<3)r=G(s,2,r,r,!0);else{n=16<(n=1.4*Math.sqrt(t))?16:0|n,r=G(s,2,r=r.times(1/K(5,n)),r,!0);for(var o,u=new s(5),c=new s(16),f=new s(20);n--;)o=r.times(r),r=r.times(u.plus(o.times(c.times(o).plus(f))))}return _(r,s.precision=e,s.rounding=i,!0)},y.hyperbolicTangent=y.tanh=function(){var n,e,i=this,t=i.constructor;return i.isFinite()?i.isZero()?new t(i):(n=t.precision,e=t.rounding,t.precision=n+7,t.rounding=1,F(i.sinh(),i.cosh(),t.precision=n,t.rounding=e)):new t(i.s)},y.inverseCosine=y.acos=function(){var n,e=this,i=e.constructor,t=e.abs().cmp(1),r=i.precision,s=i.rounding;return-1!==t?0===t?e.isNeg()?I(i,r,s):new i(0):new i(NaN):e.isZero()?I(i,r+4,s).times(.5):(i.precision=r+6,i.rounding=1,e=e.asin(),n=I(i,r+4,s).times(.5),i.precision=r,i.rounding=s,n.minus(e))},y.inverseHyperbolicCosine=y.acosh=function(){var n,e,i=this,t=i.constructor;return i.lte(1)?new t(i.eq(1)?0:NaN):i.isFinite()?(n=t.precision,e=t.rounding,t.precision=n+Math.max(Math.abs(i.e),i.sd())+4,t.rounding=1,N=!1,i=i.times(i).minus(1).sqrt().plus(i),N=!0,t.precision=n,t.rounding=e,i.ln()):new t(i)},y.inverseHyperbolicSine=y.asinh=function(){var n,e,i=this,t=i.constructor;return!i.isFinite()||i.isZero()?new t(i):(n=t.precision,e=t.rounding,t.precision=n+2*Math.max(Math.abs(i.e),i.sd())+6,t.rounding=1,N=!1,i=i.times(i).plus(1).sqrt().plus(i),N=!0,t.precision=n,t.rounding=e,i.ln())},y.inverseHyperbolicTangent=y.atanh=function(){var n,e,i,t,r=this,s=r.constructor;return r.isFinite()?0<=r.e?new s(r.abs().eq(1)?r.s/0:r.isZero()?r:NaN):(n=s.precision,e=s.rounding,t=r.sd(),Math.max(t,n)<2*-r.e-1?_(new s(r),n,e,!0):(s.precision=i=t-r.e,r=F(r.plus(1),new s(1).minus(r),i+n,1),s.precision=n+4,s.rounding=1,r=r.ln(),s.precision=n,s.rounding=e,r.times(.5))):new s(NaN)},y.inverseSine=y.asin=function(){var n,e,i,t,r=this,s=r.constructor;return r.isZero()?new s(r):(e=r.abs().cmp(1),i=s.precision,t=s.rounding,-1!==e?0===e?((n=I(s,i+4,t).times(.5)).s=r.s,n):new s(NaN):(s.precision=i+6,s.rounding=1,r=r.div(new s(1).minus(r.times(r)).sqrt().plus(1)).atan(),s.precision=i,s.rounding=t,r.times(2)))},y.inverseTangent=y.atan=function(){var n,e,i,t,r,s,o,u,c,f=this,a=f.constructor,h=a.precision,l=a.rounding;if(f.isFinite()){if(f.isZero())return new a(f);if(f.abs().eq(1)&&h+4<=x)return(o=I(a,h+4,l).times(.25)).s=f.s,o}else{if(!f.s)return new a(NaN);if(h+4<=x)return(o=I(a,h+4,l).times(.5)).s=f.s,o}for(a.precision=u=h+10,a.rounding=1,n=i=Math.min(28,u/R+2|0);n;--n)f=f.div(f.times(f).plus(1).sqrt().plus(1));for(N=!1,e=Math.ceil(u/R),t=1,c=f.times(f),o=new a(f),r=f;-1!==n;)if(r=r.times(c),s=o.minus(r.div(t+=2)),r=r.times(c),void 0!==(o=s.plus(r.div(t+=2))).d[e])for(n=e;o.d[n]===s.d[n]&&n--;);return i&&(o=o.times(2<<i-1)),N=!0,_(o,a.precision=h,a.rounding=l,!0)},y.isFinite=function(){return!!this.d},y.isInteger=y.isInt=function(){return!!this.d&&Z(this.e/R)>this.d.length-2},y.isNaN=function(){return!this.s},y.isNegative=y.isNeg=function(){return this.s<0},y.isPositive=y.isPos=function(){return 0<this.s},y.isZero=function(){return!!this.d&&0===this.d[0]},y.lessThan=y.lt=function(n){return this.cmp(n)<0},y.lessThanOrEqualTo=y.lte=function(n){return this.cmp(n)<1},y.logarithm=y.log=function(n){var e,i,t,r,s,o,u,c,f=this,a=f.constructor,h=a.precision,l=a.rounding;if(null==n)n=new a(10),e=!0;else{if(i=(n=new a(n)).d,n.s<0||!i||!i[0]||n.eq(1))return new a(NaN);e=n.eq(10)}if(i=f.d,f.s<0||!i||!i[0]||f.eq(1))return new a(i&&!i[0]?-1/0:1!=f.s?NaN:i?0:1/0);if(e)if(1<i.length)s=!0;else{for(r=i[0];r%10==0;)r/=10;s=1!==r}if(N=!1,o=W(f,u=h+5),t=e?C(a,u+10):W(n,u),O((c=F(o,t,u,1)).d,r=h,l))do{if(o=W(f,u+=10),t=e?C(a,u+10):W(n,u),c=F(o,t,u,1),!s){+M(c.d).slice(r+1,r+15)+1==1e14&&(c=_(c,h+1,0));break}}while(O(c.d,r+=10,l));return N=!0,_(c,h,l)},y.minus=y.sub=function(n){var e,i,t,r,s,o,u,c,f,a,h,l,d=this,p=d.constructor;if(n=new p(n),!d.d||!n.d)return d.s&&n.s?d.d?n.s=-n.s:n=new p(n.d||d.s!==n.s?d:NaN):n=new p(NaN),n;if(d.s!=n.s)return n.s=-n.s,d.plus(n);if(f=d.d,l=n.d,u=p.precision,c=p.rounding,!f[0]||!l[0]){if(l[0])n.s=-n.s;else{if(!f[0])return new p(3===c?-0:0);n=new p(d)}return N?_(n,u,c):n}if(i=Z(n.e/R),a=Z(d.e/R),f=f.slice(),s=a-i){for(o=(h=s<0)?(e=f,s=-s,l.length):(e=l,i=a,f.length),(t=Math.max(Math.ceil(u/R),o)+2)<s&&(s=t,e.length=1),e.reverse(),t=s;t--;)e.push(0);e.reverse()}else{for((h=(t=f.length)<(o=l.length))&&(o=t),t=0;t<o;t++)if(f[t]!=l[t]){h=f[t]<l[t];break}s=0}for(h&&(e=f,f=l,l=e,n.s=-n.s),o=f.length,t=l.length-o;0<t;--t)f[o++]=0;for(t=l.length;s<t;){if(f[--t]<l[t]){for(r=t;r&&0===f[--r];)f[r]=P-1;--f[r],f[t]+=P}f[t]-=l[t]}for(;0===f[--o];)f.pop();for(;0===f[0];f.shift())--i;return f[0]?(n.d=f,n.e=k(f,i),N?_(n,u,c):n):new p(3===c?-0:0)},y.modulo=y.mod=function(n){var e,i=this,t=i.constructor;return n=new t(n),!i.d||!n.s||n.d&&!n.d[0]?new t(NaN):!n.d||i.d&&!i.d[0]?_(new t(i),t.precision,t.rounding):(N=!1,9==t.modulo?(e=F(i,n.abs(),0,3,1)).s*=n.s:e=F(i,n,0,t.modulo,1),e=e.times(n),N=!0,i.minus(e))},y.naturalExponential=y.exp=function(){return $(this)},y.naturalLogarithm=y.ln=function(){return W(this)},y.negated=y.neg=function(){var n=new this.constructor(this);return n.s=-n.s,_(n)},y.plus=y.add=function(n){var e,i,t,r,s,o,u,c,f,a,h=this,l=h.constructor;if(n=new l(n),!h.d||!n.d)return h.s&&n.s?h.d||(n=new l(n.d||h.s===n.s?h:NaN)):n=new l(NaN),n;if(h.s!=n.s)return n.s=-n.s,h.minus(n);if(f=h.d,a=n.d,u=l.precision,c=l.rounding,!f[0]||!a[0])return a[0]||(n=new l(h)),N?_(n,u,c):n;if(s=Z(h.e/R),t=Z(n.e/R),f=f.slice(),r=s-t){for((o=(o=r<0?(i=f,r=-r,a.length):(i=a,t=s,f.length))<(s=Math.ceil(u/R))?s+1:o+1)<r&&(r=o,i.length=1),i.reverse();r--;)i.push(0);i.reverse()}for((o=f.length)-(r=a.length)<0&&(r=o,i=a,a=f,f=i),e=0;r;)e=(f[--r]=f[r]+a[r]+e)/P|0,f[r]%=P;for(e&&(f.unshift(e),++t),o=f.length;0==f[--o];)f.pop();return n.d=f,n.e=k(f,t),N?_(n,u,c):n},y.precision=y.sd=function(n){var e;if(void 0!==n&&n!==!!n&&1!==n&&0!==n)throw Error(w+n);return this.d?(e=H(this.d),n&&this.e+1>e&&(e=this.e+1)):e=NaN,e},y.round=function(){var n=this.constructor;return _(new n(this),this.e+1,n.rounding)},y.sine=y.sin=function(){var n,e,i=this,t=i.constructor;return i.isFinite()?i.isZero()?new t(i):(n=t.precision,e=t.rounding,t.precision=n+Math.max(i.e,i.sd())+R,t.rounding=1,i=function(n,e){var i,t=e.d.length;if(t<3)return G(n,2,e,e);i=16<(i=1.4*Math.sqrt(t))?16:0|i,e=e.times(1/K(5,i)),e=G(n,2,e,e);for(var r,s=new n(5),o=new n(16),u=new n(20);i--;)r=e.times(e),e=e.times(s.plus(r.times(o.times(r).minus(u))));return e}(t,Q(t,i)),t.precision=n,t.rounding=e,_(2<o?i.neg():i,n,e,!0)):new t(NaN)},y.squareRoot=y.sqrt=function(){var n,e,i,t,r,s,o=this,u=o.d,c=o.e,f=o.s,a=o.constructor;if(1!==f||!u||!u[0])return new a(!f||f<0&&(!u||u[0])?NaN:u?o:1/0);for(N=!1,t=0==(f=Math.sqrt(+o))||f==1/0?(((e=M(u)).length+c)%2==0&&(e+="0"),f=Math.sqrt(e),c=Z((c+1)/2)-(c<0||c%2),new a(e=f==1/0?"5e"+c:(e=f.toExponential()).slice(0,e.indexOf("e")+1)+c)):new a(f.toString()),i=(c=a.precision)+3;;)if(t=(s=t).plus(F(o,s,i+2,1)).times(.5),M(s.d).slice(0,i)===(e=M(t.d)).slice(0,i)){if("9999"!=(e=e.slice(i-3,i+1))&&(r||"4999"!=e)){+e&&(+e.slice(1)||"5"!=e.charAt(0))||(_(t,c+1,1),n=!t.times(t).eq(o));break}if(!r&&(_(s,c+1,0),s.times(s).eq(o))){t=s;break}i+=4,r=1}return N=!0,_(t,c,a.rounding,n)},y.tangent=y.tan=function(){var n,e,i=this,t=i.constructor;return i.isFinite()?i.isZero()?new t(i):(n=t.precision,e=t.rounding,t.precision=n+10,t.rounding=1,(i=i.sin()).s=1,i=F(i,new t(1).minus(i.times(i)).sqrt(),n+10,0),t.precision=n,t.rounding=e,_(2==o||4==o?i.neg():i,n,e,!0)):new t(NaN)},y.times=y.mul=function(n){var e,i,t,r,s,o,u,c,f,a=this.constructor,h=this.d,l=(n=new a(n)).d;if(n.s*=this.s,!(h&&h[0]&&l&&l[0]))return new a(!n.s||h&&!h[0]&&!l||l&&!l[0]&&!h?NaN:h&&l?0*n.s:n.s/0);for(i=Z(this.e/R)+Z(n.e/R),(c=h.length)<(f=l.length)&&(s=h,h=l,l=s,o=c,c=f,f=o),s=[],t=o=c+f;t--;)s.push(0);for(t=f;0<=--t;){for(e=0,r=c+t;t<r;)u=s[r]+l[t]*h[r-t-1]+e,s[r--]=u%P|0,e=u/P|0;s[r]=(s[r]+e)%P|0}for(;!s[--o];)s.pop();return e?++i:s.shift(),n.d=s,n.e=k(s,i),N?_(n,a.precision,a.rounding):n},y.toBinary=function(n,e){return X(this,2,n,e)},y.toDecimalPlaces=y.toDP=function(n,e){var i=this.constructor,t=new i(this);return void 0===n?t:(q(n,0,g),void 0===e?e=i.rounding:q(e,0,8),_(t,n+t.e+1,e))},y.toExponential=function(n,e){var i=this,t=i.constructor,r=void 0===n?A(i,!0):(q(n,0,g),void 0===e?e=t.rounding:q(e,0,8),A(i=_(new t(i),n+1,e),!0,n+1));return i.isNeg()&&!i.isZero()?"-"+r:r},y.toFixed=function(n,e){var i,t=this,r=t.constructor,s=void 0===n?A(t):(q(n,0,g),void 0===e?e=r.rounding:q(e,0,8),A(i=_(new r(t),n+t.e+1,e),!1,n+i.e+1));return t.isNeg()&&!t.isZero()?"-"+s:s},y.toFraction=function(n){var e,i,t,r,s,o,u,c,f,a,h,l,d=this,p=d.d,g=d.constructor;if(!p)return new g(d);if(f=i=new g(1),t=c=new g(0),o=(s=(e=new g(t)).e=H(p)-d.e-1)%R,e.d[0]=v(10,o<0?R+o:o),null==n)n=0<s?e:f;else{if(!(u=new g(n)).isInt()||u.lt(f))throw Error(w+u);n=u.gt(e)?0<s?e:f:u}for(N=!1,u=new g(M(p)),a=g.precision,g.precision=s=p.length*R*2;h=F(u,e,0,1,1),1!=(r=i.plus(h.times(t))).cmp(n);)i=t,t=r,r=f,f=c.plus(h.times(r)),c=r,r=e,e=u.minus(h.times(r)),u=r;return r=F(n.minus(i),t,0,1,1),c=c.plus(r.times(f)),i=i.plus(r.times(t)),c.s=f.s=d.s,l=F(f,t,s,1).minus(d).abs().cmp(F(c,i,s,1).minus(d).abs())<1?[f,t]:[c,i],g.precision=a,N=!0,l},y.toHexadecimal=y.toHex=function(n,e){return X(this,16,n,e)},y.toNearest=function(n,e){var i=(t=this).constructor,t=new i(t);if(null==n){if(!t.d)return t;n=new i(1),e=i.rounding}else{if(n=new i(n),void 0===e?e=i.rounding:q(e,0,8),!t.d)return n.s?t:n;if(!n.d)return n.s&&(n.s=t.s),n}return n.d[0]?(N=!1,t=F(t,n,0,e,1).times(n),N=!0,_(t)):(n.s=t.s,t=n),t},y.toNumber=function(){return+this},y.toOctal=function(n,e){return X(this,8,n,e)},y.toPower=y.pow=function(n){var e,i,t,r,s,o,u=this,c=u.constructor,f=+(n=new c(n));if(!(u.d&&n.d&&u.d[0]&&n.d[0]))return new c(v(+u,f));if((u=new c(u)).eq(1))return u;if(t=c.precision,s=c.rounding,n.eq(1))return _(u,t,s);if((e=Z(n.e/R))>=n.d.length-1&&(i=f<0?-f:f)<=9007199254740991)return r=V(c,u,i,t),n.s<0?new c(1).div(r):_(r,t,s);if((o=u.s)<0){if(e<n.d.length-1)return new c(NaN);if(0==(1&n.d[e])&&(o=1),0==u.e&&1==u.d[0]&&1==u.d.length)return u.s=o,u}return(e=0!=(i=v(+u,f))&&isFinite(i)?new c(i+"").e:Z(f*(Math.log("0."+M(u.d))/Math.LN10+u.e+1)))>c.maxE+1||e<c.minE-1?new c(0<e?o/0:0):(N=!1,c.rounding=u.s=1,i=Math.min(12,(e+"").length),(r=$(n.times(W(u,t+i)),t)).d&&O((r=_(r,t+5,1)).d,t,s)&&(e=t+10,+M((r=_($(n.times(W(u,e+i)),e),e+5,1)).d).slice(t+1,t+15)+1==1e14&&(r=_(r,t+1,0))),r.s=o,N=!0,_(r,t,c.rounding=s))},y.toPrecision=function(n,e){var i=this,t=i.constructor,r=void 0===n?A(i,i.e<=t.toExpNeg||i.e>=t.toExpPos):(q(n,1,g),void 0===e?e=t.rounding:q(e,0,8),A(i=_(new t(i),n,e),n<=i.e||i.e<=t.toExpNeg,n));return i.isNeg()&&!i.isZero()?"-"+r:r},y.toSignificantDigits=y.toSD=function(n,e){var i=this.constructor;return void 0===n?(n=i.precision,e=i.rounding):(q(n,1,g),void 0===e?e=i.rounding:q(e,0,8)),_(new i(this),n,e)},y.toString=function(){var n=this,e=n.constructor,i=A(n,n.e<=e.toExpNeg||n.e>=e.toExpPos);return n.isNeg()&&!n.isZero()?"-"+i:i},y.truncated=y.trunc=function(){return _(new this.constructor(this),this.e+1,1)},y.valueOf=y.toJSON=function(){var n=this,e=n.constructor,i=A(n,n.e<=e.toExpNeg||n.e>=e.toExpPos);return n.isNeg()?"-"+i:i};var F=function(n,e,i,t,r,s){var o,u,c,f,a,h,l,d,p,g,m,w,v,N,b,E,x,y,M,q,O=n.constructor,D=n.s==e.s?1:-1,F=n.d,A=e.d;if(!(F&&F[0]&&A&&A[0]))return new O(n.s&&e.s&&(F?!A||F[0]!=A[0]:A)?F&&0==F[0]||!A?0*D:D/0:NaN);for(u=s?(a=1,n.e-e.e):(s=P,a=R,Z(n.e/a)-Z(e.e/a)),M=A.length,x=F.length,g=(p=new O(D)).d=[],c=0;A[c]==(F[c]||0);c++);if(A[c]>(F[c]||0)&&u--,null==i?(N=i=O.precision,t=O.rounding):N=r?i+(n.e-e.e)+1:i,N<0)g.push(1),h=!0;else{if(N=N/a+2|0,c=0,1==M){for(A=A[f=0],N++;(c<x||f)&&N--;c++)b=f*s+(F[c]||0),g[c]=b/A|0,f=b%A|0;h=f||c<x}else{for(1<(f=s/(A[0]+1)|0)&&(A=L(A,f,s),F=L(F,f,s),M=A.length,x=F.length),E=M,w=(m=F.slice(0,M)).length;w<M;)m[w++]=0;for((q=A.slice()).unshift(0),y=A[0],A[1]>=s/2&&++y;f=0,(o=T(A,m,M,w))<0?(v=m[0],M!=w&&(v=v*s+(m[1]||0)),1<(f=v/y|0)?(s<=f&&(f=s-1),1==(o=T(l=L(A,f,s),m,d=l.length,w=m.length))&&(f--,U(l,M<d?q:A,d,s))):(0==f&&(o=f=1),l=A.slice()),(d=l.length)<w&&l.unshift(0),U(m,l,w,s),-1==o&&(o=T(A,m,M,w=m.length))<1&&(f++,U(m,M<w?q:A,w,s)),w=m.length):0===o&&(f++,m=[0]),g[c++]=f,o&&m[0]?m[w++]=F[E]||0:(m=[F[E]],w=1),(E++<x||void 0!==m[0])&&N--;);h=void 0!==m[0]}g[0]||g.shift()}if(1==a)p.e=u,S=h;else{for(c=1,f=g[0];10<=f;f/=10)c++;p.e=c+u*a-1,_(p,r?i+p.e+1:i,t,h)}return p};function L(n,e,i){var t,r=0,s=n.length;for(n=n.slice();s--;)t=n[s]*e+r,n[s]=t%i|0,r=t/i|0;return r&&n.unshift(r),n}function T(n,e,i,t){var r,s;if(i!=t)s=t<i?1:-1;else for(r=s=0;r<i;r++)if(n[r]!=e[r]){s=n[r]>e[r]?1:-1;break}return s}function U(n,e,i,t){for(var r=0;i--;)n[i]-=r,r=n[i]<e[i]?1:0,n[i]=r*t+n[i]-e[i];for(;!n[0]&&1<n.length;)n.shift()}function _(n,e,i,t){var r,s,o,u,c,f,a,h,l,d=n.constructor;n:if(null!=e){if(!(h=n.d))return n;for(r=1,u=h[0];10<=u;u/=10)r++;if((s=e-r)<0)s+=R,o=e,c=(a=h[l=0])/v(10,r-o-1)%10|0;else if(l=Math.ceil((s+1)/R),(u=h.length)<=l){if(!t)break n;for(;u++<=l;)h.push(0);a=c=0,o=(s%=R)-R+(r=1)}else{for(a=u=h[l],r=1;10<=u;u/=10)r++;c=(o=(s%=R)-R+r)<0?0:a/v(10,r-o-1)%10|0}if(t=t||e<0||void 0!==h[l+1]||(o<0?a:a%v(10,r-o-1)),f=i<4?(c||t)&&(0==i||i==(n.s<0?3:2)):5<c||5==c&&(4==i||t||6==i&&(0<s?0<o?a/v(10,r-o):0:h[l-1])%10&1||i==(n.s<0?8:7)),e<1||!h[0])return h.length=0,f?(e-=n.e+1,h[0]=v(10,(R-e%R)%R),n.e=-e||0):h[0]=n.e=0,n;if(0==s?(h.length=l,u=1,l--):(h.length=l+1,u=v(10,R-s),h[l]=0<o?(a/v(10,r-o)%v(10,o)|0)*u:0),f)for(;;){if(0==l){for(s=1,o=h[0];10<=o;o/=10)s++;for(o=h[0]+=u,u=1;10<=o;o/=10)u++;s!=u&&(n.e++,h[0]==P&&(h[0]=1));break}if(h[l]+=u,h[l]!=P)break;h[l--]=0,u=1}for(s=h.length;0===h[--s];)h.pop()}return N&&(n.e>d.maxE?(n.d=null,n.e=NaN):n.e<d.minE&&(n.e=0,n.d=[0])),n}function A(n,e,i){if(!n.isFinite())return J(n);var t,r=n.e,s=M(n.d),o=s.length;return e?(i&&0<(t=i-o)?s=s.charAt(0)+"."+s.slice(1)+B(t):1<o&&(s=s.charAt(0)+"."+s.slice(1)),s=s+(n.e<0?"e":"e+")+n.e):r<0?(s="0."+B(-r-1)+s,i&&0<(t=i-o)&&(s+=B(t))):o<=r?(s+=B(r+1-o),i&&0<(t=i-r-1)&&(s=s+"."+B(t))):((t=r+1)<o&&(s=s.slice(0,t)+"."+s.slice(t)),i&&0<(t=i-o)&&(r+1===o&&(s+="."),s+=B(t))),s}function k(n,e){var i=n[0];for(e*=R;10<=i;i/=10)e++;return e}function C(n,e,i){if(E<e)throw N=!0,i&&(n.precision=i),Error(s);return _(new n(t),e,1,!0)}function I(n,e,i){if(x<e)throw Error(s);return _(new n(r),e,i,!0)}function H(n){var e=n.length-1,i=e*R+1;if(e=n[e]){for(;e%10==0;e/=10)i--;for(e=n[0];10<=e;e/=10)i++}return i}function B(n){for(var e="";n--;)e+="0";return e}function V(n,e,i,t){var r,s=new n(1),o=Math.ceil(t/R+4);for(N=!1;;){if(i%2&&Y((s=s.times(e)).d,o)&&(r=!0),0===(i=Z(i/2))){i=s.d.length-1,r&&0===s.d[i]&&++s.d[i];break}Y((e=e.times(e)).d,o)}return N=!0,s}function j(n){return 1&n.d[n.d.length-1]}function i(n,e,i){for(var t,r=new n(e[0]),s=0;++s<e.length;){if(!(t=new n(e[s])).s){r=t;break}r[i](t)&&(r=t)}return r}function $(n,e){var i,t,r,s,o,u,c,f=0,a=0,h=0,l=n.constructor,d=l.rounding,p=l.precision;if(!n.d||!n.d[0]||17<n.e)return new l(n.d?n.d[0]?n.s<0?0:1/0:1:n.s?n.s<0?0:n:NaN);for(c=null==e?(N=!1,p):e,u=new l(.03125);-2<n.e;)n=n.times(u),h+=5;for(c+=t=Math.log(v(2,h))/Math.LN10*2+5|0,i=s=o=new l(1),l.precision=c;;){if(s=_(s.times(n),c,1),i=i.times(++a),M((u=o.plus(F(s,i,c,1))).d).slice(0,c)===M(o.d).slice(0,c)){for(r=h;r--;)o=_(o.times(o),c,1);if(null!=e)return l.precision=p,o;if(!(f<3&&O(o.d,c-t,d,f)))return _(o,l.precision=p,d,N=!0);l.precision=c+=10,i=s=u=new l(1),a=0,f++}o=u}}function W(n,e){var i,t,r,s,o,u,c,f,a,h,l,d=1,p=n,g=p.d,m=p.constructor,w=m.rounding,v=m.precision;if(p.s<0||!g||!g[0]||!p.e&&1==g[0]&&1==g.length)return new m(g&&!g[0]?-1/0:1!=p.s?NaN:g?0:p);if(a=null==e?(N=!1,v):e,m.precision=a+=10,t=(i=M(g)).charAt(0),!(Math.abs(s=p.e)<15e14))return f=C(m,a+2,v).times(s+""),p=W(new m(t+"."+i.slice(1)),a-10).plus(f),m.precision=v,null==e?_(p,v,w,N=!0):p;for(;t<7&&1!=t||1==t&&3<i.charAt(1);)t=(i=M((p=p.times(n)).d)).charAt(0),d++;for(s=p.e,1<t?(p=new m("0."+i),s++):p=new m(t+"."+i.slice(1)),c=o=p=F((h=p).minus(1),p.plus(1),a,1),l=_(p.times(p),a,1),r=3;;){if(o=_(o.times(l),a,1),M((f=c.plus(F(o,new m(r),a,1))).d).slice(0,a)===M(c.d).slice(0,a)){if(c=c.times(2),0!==s&&(c=c.plus(C(m,a+2,v).times(s+""))),c=F(c,new m(d),a,1),null!=e)return m.precision=v,c;if(!O(c.d,a-10,w,u))return _(c,m.precision=v,w,N=!0);m.precision=a+=10,f=o=p=F(h.minus(1),h.plus(1),a,1),l=_(p.times(p),a,1),r=u=1}c=f,r+=2}}function J(n){return String(n.s*n.s/0)}function z(n,e){var i,t,r;for(-1<(i=e.indexOf("."))&&(e=e.replace(".","")),0<(t=e.search(/e/i))?(i<0&&(i=t),i+=+e.slice(t+1),e=e.substring(0,t)):i<0&&(i=e.length),t=0;48===e.charCodeAt(t);t++);for(r=e.length;48===e.charCodeAt(r-1);--r);if(e=e.slice(t,r)){if(r-=t,n.e=i=i-t-1,n.d=[],t=(i+1)%R,i<0&&(t+=R),t<r){for(t&&n.d.push(+e.slice(0,t)),r-=R;t<r;)n.d.push(+e.slice(t,t+=R));e=e.slice(t),t=R-e.length}else t-=r;for(;t--;)e+="0";n.d.push(+e),N&&(n.e>n.constructor.maxE?(n.d=null,n.e=NaN):n.e<n.constructor.minE&&(n.e=0,n.d=[0]))}else n.e=0,n.d=[0];return n}function G(n,e,i,t,r){var s,o,u,c,f=n.precision,a=Math.ceil(f/R);for(N=!1,c=i.times(i),u=new n(t);;){if(o=F(u.times(c),new n(e++*e++),f,1),u=r?t.plus(o):t.minus(o),t=F(o.times(c),new n(e++*e++),f,1),void 0!==(o=u.plus(t)).d[a]){for(s=a;o.d[s]===u.d[s]&&s--;);if(-1==s)break}s=u,u=t,t=o,o=s,0}return N=!0,o.d.length=a+1,o}function K(n,e){for(var i=n;--e;)i*=n;return i}function Q(n,e){var i,t=e.s<0,r=I(n,n.precision,1),s=r.times(.5);if((e=e.abs()).lte(s))return o=t?4:1,e;if((i=e.divToInt(r)).isZero())o=t?3:2;else{if((e=e.minus(i.times(r))).lte(s))return o=j(i)?t?2:3:t?4:1,e;o=j(i)?t?1:4:t?3:2}return e.minus(r).abs()}function X(n,e,i,t){var r,s,o,u,c,f,a,h,l,d=n.constructor,p=void 0!==i;if(p?(q(i,1,g),void 0===t?t=d.rounding:q(t,0,8)):(i=d.precision,t=d.rounding),n.isFinite()){for(p?(r=2,16==e?i=4*i-3:8==e&&(i=3*i-2)):r=e,0<=(o=(a=A(n)).indexOf("."))&&(a=a.replace(".",""),(l=new d(1)).e=a.length-o,l.d=D(A(l),10,r),l.e=l.d.length),s=c=(h=D(a,10,r)).length;0==h[--c];)h.pop();if(h[0]){if(o<0?s--:((n=new d(n)).d=h,n.e=s,h=(n=F(n,l,i,t,0,r)).d,s=n.e,f=S),o=h[i],u=r/2,f=f||void 0!==h[i+1],f=t<4?(void 0!==o||f)&&(0===t||t===(n.s<0?3:2)):u<o||o===u&&(4===t||f||6===t&&1&h[i-1]||t===(n.s<0?8:7)),h.length=i,f)for(;++h[--i]>r-1;)h[i]=0,i||(++s,h.unshift(1));for(c=h.length;!h[c-1];--c);for(o=0,a="";o<c;o++)a+=m.charAt(h[o]);if(p){if(1<c)if(16==e||8==e){for(o=16==e?4:3,--c;c%o;c++)a+="0";for(c=(h=D(a,r,e)).length;!h[c-1];--c);for(o=1,a="1.";o<c;o++)a+=m.charAt(h[o])}else a=a.charAt(0)+"."+a.slice(1);a=a+(s<0?"p":"p+")+s}else if(s<0){for(;++s;)a="0"+a;a="0."+a}else if(++s>c)for(s-=c;s--;)a+="0";else s<c&&(a=a.slice(0,s)+"."+a.slice(s))}else a=p?"0p+0":"0";a=(16==e?"0x":2==e?"0b":8==e?"0o":"")+a}else a=J(n);return n.s<0?"-"+a:a}function Y(n,e){return n.length>e&&(n.length=e,1)}function nn(n){return new this(n).abs()}function en(n){return new this(n).acos()}function tn(n){return new this(n).acosh()}function rn(n,e){return new this(n).plus(e)}function sn(n){return new this(n).asin()}function on(n){return new this(n).asinh()}function un(n){return new this(n).atan()}function cn(n){return new this(n).atanh()}function fn(n,e){n=new this(n),e=new this(e);var i,t=this.precision,r=this.rounding,s=t+4;return n.s&&e.s?n.d||e.d?!e.d||n.isZero()?(i=e.s<0?I(this,t,r):new this(0)).s=n.s:!n.d||e.isZero()?(i=I(this,s,1).times(.5)).s=n.s:i=e.s<0?(this.precision=s,this.rounding=1,i=this.atan(F(n,e,s,1)),e=I(this,s,1),this.precision=t,this.rounding=r,n.s<0?i.minus(e):i.plus(e)):this.atan(F(n,e,s,1)):(i=I(this,s,1).times(0<e.s?.25:.75)).s=n.s:i=new this(NaN),i}function an(n){return new this(n).cbrt()}function hn(n){return _(n=new this(n),n.e+1,2)}function ln(n){if(!n||"object"!=typeof n)throw Error(f+"Object expected");for(var e,i,t=!0===n.defaults,r=["precision",1,g,"rounding",0,8,"toExpNeg",-u,0,"toExpPos",0,u,"maxE",0,u,"minE",-u,0,"modulo",0,9],s=0;s<r.length;s+=3)if(e=r[s],t&&(this[e]=c[e]),void 0!==(i=n[e])){if(!(Z(i)===i&&r[s+1]<=i&&i<=r[s+2]))throw Error(w+e+": "+i);this[e]=i}if(e="crypto",t&&(this[e]=c[e]),void 0!==(i=n[e])){if(!0!==i&&!1!==i&&0!==i&&1!==i)throw Error(w+e+": "+i);if(i){if("undefined"==typeof crypto||!crypto||!crypto.getRandomValues&&!crypto.randomBytes)throw Error(a);this[e]=!0}else this[e]=!1}return this}function dn(n){return new this(n).cos()}function pn(n){return new this(n).cosh()}function gn(n,e){return new this(n).div(e)}function mn(n){return new this(n).exp()}function wn(n){return _(n=new this(n),n.e+1,3)}function vn(){var n,e,i=new this(0);for(N=!1,n=0;n<arguments.length;)if((e=new this(arguments[n++])).d)i.d&&(i=i.plus(e.times(e)));else{if(e.s)return N=!0,new this(1/0);i=e}return N=!0,i.sqrt()}function Nn(n){return n instanceof h||n&&"[object Decimal]"===n.name||!1}function bn(n){return new this(n).ln()}function En(n,e){return new this(n).log(e)}function xn(n){return new this(n).log(2)}function yn(n){return new this(n).log(10)}function Mn(){return i(this,arguments,"lt")}function qn(){return i(this,arguments,"gt")}function On(n,e){return new this(n).mod(e)}function Dn(n,e){return new this(n).mul(e)}function Fn(n,e){return new this(n).pow(e)}function An(n){var e,i,t,r,s=0,o=new this(1),u=[];if(void 0===n?n=this.precision:q(n,1,g),t=Math.ceil(n/R),this.crypto)if(crypto.getRandomValues)for(e=crypto.getRandomValues(new Uint32Array(t));s<t;)429e7<=(r=e[s])?e[s]=crypto.getRandomValues(new Uint32Array(1))[0]:u[s++]=r%1e7;else{if(!crypto.randomBytes)throw Error(a);for(e=crypto.randomBytes(t*=4);s<t;)214e7<=(r=e[s]+(e[s+1]<<8)+(e[s+2]<<16)+((127&e[s+3])<<24))?crypto.randomBytes(4).copy(e,s):(u.push(r%1e7),s+=4);s=t/4}else for(;s<t;)u[s++]=1e7*Math.random()|0;for(t=u[--s],n%=R,t&&n&&(r=v(10,R-n),u[s]=(t/r|0)*r);0===u[s];s--)u.pop();if(s<0)u=[i=0];else{for(i=-1;0===u[0];i-=R)u.shift();for(t=1,r=u[0];10<=r;r/=10)t++;t<R&&(i-=R-t)}return o.e=i,o.d=u,o}function Sn(n){return _(n=new this(n),n.e+1,this.rounding)}function Zn(n){return(n=new this(n)).d?n.d[0]?n.s:0*n.s:n.s||NaN}function Pn(n){return new this(n).sin()}function Rn(n){return new this(n).sinh()}function Ln(n){return new this(n).sqrt()}function Tn(n,e){return new this(n).sub(e)}function Un(n){return new this(n).tan()}function _n(n){return new this(n).tanh()}function kn(n){return _(n=new this(n),n.e+1,1)}(h=function n(e){var i,t,r;function s(n){var e,i,t,r=this;if(!(r instanceof s))return new s(n);if(n instanceof(r.constructor=s))return r.s=n.s,void(N?!n.d||n.e>s.maxE?(r.e=NaN,r.d=null):n.e<s.minE?(r.e=0,r.d=[0]):(r.e=n.e,r.d=n.d.slice()):(r.e=n.e,r.d=n.d?n.d.slice():n.d));if("number"==(t=typeof n)){if(0===n)return r.s=1/n<0?-1:1,r.e=0,void(r.d=[0]);if(n<0?(n=-n,r.s=-1):r.s=1,n===~~n&&n<1e7){for(e=0,i=n;10<=i;i/=10)e++;return void(N?s.maxE<e?(r.e=NaN,r.d=null):e<s.minE?(r.e=0,r.d=[0]):(r.e=e,r.d=[n]):(r.e=e,r.d=[n]))}return 0*n!=0?(n||(r.s=NaN),r.e=NaN,void(r.d=null)):z(r,n.toString())}if("string"!=t)throw Error(w+n);return 45===(i=n.charCodeAt(0))?(n=n.slice(1),r.s=-1):(43===i&&(n=n.slice(1)),r.s=1),(b.test(n)?z:function(n,e){var i,t,r,s,o,u,c,f,a;if("Infinity"===e||"NaN"===e)return+e||(n.s=NaN),n.e=NaN,n.d=null,n;if(d.test(e))i=16,e=e.toLowerCase();else if(l.test(e))i=2;else{if(!p.test(e))throw Error(w+e);i=8}for(o=0<=(s=(e=0<(s=e.search(/p/i))?(c=+e.slice(s+1),e.substring(2,s)):e.slice(2)).indexOf(".")),t=n.constructor,o&&(s=(u=(e=e.replace(".","")).length)-s,r=V(t,new t(i),s,2*s)),s=a=(f=D(e,i,P)).length-1;0===f[s];--s)f.pop();return s<0?new t(0*n.s):(n.e=k(f,a),n.d=f,N=!1,o&&(n=F(n,r,4*u)),c&&(n=n.times(Math.abs(c)<54?v(2,c):h.pow(2,c))),N=!0,n)})(r,n)}if(s.prototype=y,s.ROUND_UP=0,s.ROUND_DOWN=1,s.ROUND_CEIL=2,s.ROUND_FLOOR=3,s.ROUND_HALF_UP=4,s.ROUND_HALF_DOWN=5,s.ROUND_HALF_EVEN=6,s.ROUND_HALF_CEIL=7,s.ROUND_HALF_FLOOR=8,s.EUCLID=9,s.config=s.set=ln,s.clone=n,s.isDecimal=Nn,s.abs=nn,s.acos=en,s.acosh=tn,s.add=rn,s.asin=sn,s.asinh=on,s.atan=un,s.atanh=cn,s.atan2=fn,s.cbrt=an,s.ceil=hn,s.cos=dn,s.cosh=pn,s.div=gn,s.exp=mn,s.floor=wn,s.hypot=vn,s.ln=bn,s.log=En,s.log10=yn,s.log2=xn,s.max=Mn,s.min=qn,s.mod=On,s.mul=Dn,s.pow=Fn,s.random=An,s.round=Sn,s.sign=Zn,s.sin=Pn,s.sinh=Rn,s.sqrt=Ln,s.sub=Tn,s.tan=Un,s.tanh=_n,s.trunc=kn,void 0===e&&(e={}),e&&!0!==e.defaults)for(r=["precision","rounding","toExpNeg","toExpPos","maxE","minE","modulo","crypto"],i=0;i<r.length;)e.hasOwnProperty(t=r[i++])||(e[t]=this[t]);return s.config(e),s}(c)).default=h.Decimal=h,t=new h(t),r=new h(r),"function"==typeof define&&define.amd?define(function(){return h}):"undefined"!=typeof module&&module.exports?("function"==typeof Symbol&&"symbol"==typeof Symbol.iterator&&(y[Symbol.for("nodejs.util.inspect.custom")]=y.toString,y[Symbol.toStringTag]="Decimal"),module.exports=h):(n=n||("undefined"!=typeof self&&self&&self.self==self?self:window),e=n.Decimal,h.noConflict=function(){return n.Decimal=e,h},n.Decimal=h)}(this);
+        /* decimal.js v10.2.1 https://github.com/MikeMcl/decimal.js/LICENCE */!function (n) { "use strict"; var h, S, e, o, u = 9e15, g = 1e9, m = "0123456789abcdef", t = "2.3025850929940456840179914546843642076011014886287729760333279009675726096773524802359972050895982983419677840422862486334095254650828067566662873690987816894829072083255546808437998948262331985283935053089653777326288461633662222876982198867465436674744042432743651550489343149393914796194044002221051017141748003688084012647080685567743216228355220114804663715659121373450747856947683463616792101806445070648000277502684916746550586856935673420670581136429224554405758925724208241314695689016758940256776311356919292033376587141660230105703089634572075440370847469940168269282808481184289314848524948644871927809676271275775397027668605952496716674183485704422507197965004714951050492214776567636938662976979522110718264549734772662425709429322582798502585509785265383207606726317164309505995087807523710333101197857547331541421808427543863591778117054309827482385045648019095610299291824318237525357709750539565187697510374970888692180205189339507238539205144634197265287286965110862571492198849978748873771345686209167058", r = "3.1415926535897932384626433832795028841971693993751058209749445923078164062862089986280348253421170679821480865132823066470938446095505822317253594081284811174502841027019385211055596446229489549303819644288109756659334461284756482337867831652712019091456485669234603486104543266482133936072602491412737245870066063155881748815209209628292540917153643678925903600113305305488204665213841469519415116094330572703657595919530921861173819326117931051185480744623799627495673518857527248912279381830119491298336733624406566430860213949463952247371907021798609437027705392171762931767523846748184676694051320005681271452635608277857713427577896091736371787214684409012249534301465495853710507922796892589235420199561121290219608640344181598136297747713099605187072113499999983729780499510597317328160963185950244594553469083026425223082533446850352619311881710100031378387528865875332083814206171776691473035982534904287554687311595628638823537875937519577818577805321712268066130019278766111959092164201989380952572010654858632789", c = { precision: 20, rounding: 4, modulo: 1, toExpNeg: -7, toExpPos: 21, minE: -u, maxE: u, crypto: !1 }, N = !0, f = "[DecimalError] ", w = f + "Invalid argument: ", s = f + "Precision limit exceeded", a = f + "crypto unavailable", Z = Math.floor, v = Math.pow, l = /^0b([01]+(\.[01]*)?|\.[01]+)(p[+-]?\d+)?$/i, d = /^0x([0-9a-f]+(\.[0-9a-f]*)?|\.[0-9a-f]+)(p[+-]?\d+)?$/i, p = /^0o([0-7]+(\.[0-7]*)?|\.[0-7]+)(p[+-]?\d+)?$/i, b = /^(\d+(\.\d*)?|\.\d+)(e[+-]?\d+)?$/i, P = 1e7, R = 7, E = t.length - 1, x = r.length - 1, y = { name: "[object Decimal]" }; function M(n) { var e, i, t, r = n.length - 1, s = "", o = n[0]; if (0 < r) { for (s += o, e = 1; e < r; e++)t = n[e] + "", (i = R - t.length) && (s += B(i)), s += t; o = n[e], (i = R - (t = o + "").length) && (s += B(i)) } else if (0 === o) return "0"; for (; o % 10 == 0;)o /= 10; return s + o } function q(n, e, i) { if (n !== ~~n || n < e || i < n) throw Error(w + n) } function O(n, e, i, t) { for (var r, s, o = n[0]; 10 <= o; o /= 10)--e; return --e < 0 ? (e += R, r = 0) : (r = Math.ceil((e + 1) / R), e %= R), o = v(10, R - e), s = n[r] % o | 0, null == t ? e < 3 ? (0 == e ? s = s / 100 | 0 : 1 == e && (s = s / 10 | 0), i < 4 && 99999 == s || 3 < i && 49999 == s || 5e4 == s || 0 == s) : (i < 4 && s + 1 == o || 3 < i && s + 1 == o / 2) && (n[r + 1] / o / 100 | 0) == v(10, e - 2) - 1 || (s == o / 2 || 0 == s) && 0 == (n[r + 1] / o / 100 | 0) : e < 4 ? (0 == e ? s = s / 1e3 | 0 : 1 == e ? s = s / 100 | 0 : 2 == e && (s = s / 10 | 0), (t || i < 4) && 9999 == s || !t && 3 < i && 4999 == s) : ((t || i < 4) && s + 1 == o || !t && 3 < i && s + 1 == o / 2) && (n[r + 1] / o / 1e3 | 0) == v(10, e - 3) - 1 } function D(n, e, i) { for (var t, r, s = [0], o = 0, u = n.length; o < u;) { for (r = s.length; r--;)s[r] *= e; for (s[0] += m.indexOf(n.charAt(o++)), t = 0; t < s.length; t++)s[t] > i - 1 && (void 0 === s[t + 1] && (s[t + 1] = 0), s[t + 1] += s[t] / i | 0, s[t] %= i) } return s.reverse() } y.absoluteValue = y.abs = function () { var n = new this.constructor(this); return n.s < 0 && (n.s = 1), _(n) }, y.ceil = function () { return _(new this.constructor(this), this.e + 1, 2) }, y.comparedTo = y.cmp = function (n) { var e, i, t, r, s = this, o = s.d, u = (n = new s.constructor(n)).d, c = s.s, f = n.s; if (!o || !u) return c && f ? c !== f ? c : o === u ? 0 : !o ^ c < 0 ? 1 : -1 : NaN; if (!o[0] || !u[0]) return o[0] ? c : u[0] ? -f : 0; if (c !== f) return c; if (s.e !== n.e) return s.e > n.e ^ c < 0 ? 1 : -1; for (e = 0, i = (t = o.length) < (r = u.length) ? t : r; e < i; ++e)if (o[e] !== u[e]) return o[e] > u[e] ^ c < 0 ? 1 : -1; return t === r ? 0 : r < t ^ c < 0 ? 1 : -1 }, y.cosine = y.cos = function () { var n, e, i = this, t = i.constructor; return i.d ? i.d[0] ? (n = t.precision, e = t.rounding, t.precision = n + Math.max(i.e, i.sd()) + R, t.rounding = 1, i = function (n, e) { var i, t, r = e.d.length; t = r < 32 ? (i = Math.ceil(r / 3), (1 / K(4, i)).toString()) : (i = 16, "2.3283064365386962890625e-10"); n.precision += i, e = G(n, 1, e.times(t), new n(1)); for (var s = i; s--;) { var o = e.times(e); e = o.times(o).minus(o).times(8).plus(1) } return n.precision -= i, e }(t, Q(t, i)), t.precision = n, t.rounding = e, _(2 == o || 3 == o ? i.neg() : i, n, e, !0)) : new t(1) : new t(NaN) }, y.cubeRoot = y.cbrt = function () { var n, e, i, t, r, s, o, u, c, f, a = this, h = a.constructor; if (!a.isFinite() || a.isZero()) return new h(a); for (N = !1, (s = a.s * v(a.s * a, 1 / 3)) && Math.abs(s) != 1 / 0 ? t = new h(s.toString()) : (i = M(a.d), (s = ((n = a.e) - i.length + 1) % 3) && (i += 1 == s || -2 == s ? "0" : "00"), s = v(i, 1 / 3), n = Z((n + 1) / 3) - (n % 3 == (n < 0 ? -1 : 2)), (t = new h(i = s == 1 / 0 ? "5e" + n : (i = s.toExponential()).slice(0, i.indexOf("e") + 1) + n)).s = a.s), o = (n = h.precision) + 3; ;)if (f = (c = (u = t).times(u).times(u)).plus(a), t = F(f.plus(a).times(u), f.plus(c), o + 2, 1), M(u.d).slice(0, o) === (i = M(t.d)).slice(0, o)) { if ("9999" != (i = i.slice(o - 3, o + 1)) && (r || "4999" != i)) { +i && (+i.slice(1) || "5" != i.charAt(0)) || (_(t, n + 1, 1), e = !t.times(t).times(t).eq(a)); break } if (!r && (_(u, n + 1, 0), u.times(u).times(u).eq(a))) { t = u; break } o += 4, r = 1 } return N = !0, _(t, n, h.rounding, e) }, y.decimalPlaces = y.dp = function () { var n, e = this.d, i = NaN; if (e) { if (i = ((n = e.length - 1) - Z(this.e / R)) * R, n = e[n]) for (; n % 10 == 0; n /= 10)i--; i < 0 && (i = 0) } return i }, y.dividedBy = y.div = function (n) { return F(this, new this.constructor(n)) }, y.dividedToIntegerBy = y.divToInt = function (n) { var e = this.constructor; return _(F(this, new e(n), 0, 1, 1), e.precision, e.rounding) }, y.equals = y.eq = function (n) { return 0 === this.cmp(n) }, y.floor = function () { return _(new this.constructor(this), this.e + 1, 3) }, y.greaterThan = y.gt = function (n) { return 0 < this.cmp(n) }, y.greaterThanOrEqualTo = y.gte = function (n) { var e = this.cmp(n); return 1 == e || 0 === e }, y.hyperbolicCosine = y.cosh = function () { var n, e, i, t, r, s = this, o = s.constructor, u = new o(1); if (!s.isFinite()) return new o(s.s ? 1 / 0 : NaN); if (s.isZero()) return u; i = o.precision, t = o.rounding, o.precision = i + Math.max(s.e, s.sd()) + 4, o.rounding = 1, e = (r = s.d.length) < 32 ? (1 / K(4, n = Math.ceil(r / 3))).toString() : (n = 16, "2.3283064365386962890625e-10"), s = G(o, 1, s.times(e), new o(1), !0); for (var c, f = n, a = new o(8); f--;)c = s.times(s), s = u.minus(c.times(a.minus(c.times(a)))); return _(s, o.precision = i, o.rounding = t, !0) }, y.hyperbolicSine = y.sinh = function () { var n, e, i, t, r = this, s = r.constructor; if (!r.isFinite() || r.isZero()) return new s(r); if (e = s.precision, i = s.rounding, s.precision = e + Math.max(r.e, r.sd()) + 4, s.rounding = 1, (t = r.d.length) < 3) r = G(s, 2, r, r, !0); else { n = 16 < (n = 1.4 * Math.sqrt(t)) ? 16 : 0 | n, r = G(s, 2, r = r.times(1 / K(5, n)), r, !0); for (var o, u = new s(5), c = new s(16), f = new s(20); n--;)o = r.times(r), r = r.times(u.plus(o.times(c.times(o).plus(f)))) } return _(r, s.precision = e, s.rounding = i, !0) }, y.hyperbolicTangent = y.tanh = function () { var n, e, i = this, t = i.constructor; return i.isFinite() ? i.isZero() ? new t(i) : (n = t.precision, e = t.rounding, t.precision = n + 7, t.rounding = 1, F(i.sinh(), i.cosh(), t.precision = n, t.rounding = e)) : new t(i.s) }, y.inverseCosine = y.acos = function () { var n, e = this, i = e.constructor, t = e.abs().cmp(1), r = i.precision, s = i.rounding; return -1 !== t ? 0 === t ? e.isNeg() ? I(i, r, s) : new i(0) : new i(NaN) : e.isZero() ? I(i, r + 4, s).times(.5) : (i.precision = r + 6, i.rounding = 1, e = e.asin(), n = I(i, r + 4, s).times(.5), i.precision = r, i.rounding = s, n.minus(e)) }, y.inverseHyperbolicCosine = y.acosh = function () { var n, e, i = this, t = i.constructor; return i.lte(1) ? new t(i.eq(1) ? 0 : NaN) : i.isFinite() ? (n = t.precision, e = t.rounding, t.precision = n + Math.max(Math.abs(i.e), i.sd()) + 4, t.rounding = 1, N = !1, i = i.times(i).minus(1).sqrt().plus(i), N = !0, t.precision = n, t.rounding = e, i.ln()) : new t(i) }, y.inverseHyperbolicSine = y.asinh = function () { var n, e, i = this, t = i.constructor; return !i.isFinite() || i.isZero() ? new t(i) : (n = t.precision, e = t.rounding, t.precision = n + 2 * Math.max(Math.abs(i.e), i.sd()) + 6, t.rounding = 1, N = !1, i = i.times(i).plus(1).sqrt().plus(i), N = !0, t.precision = n, t.rounding = e, i.ln()) }, y.inverseHyperbolicTangent = y.atanh = function () { var n, e, i, t, r = this, s = r.constructor; return r.isFinite() ? 0 <= r.e ? new s(r.abs().eq(1) ? r.s / 0 : r.isZero() ? r : NaN) : (n = s.precision, e = s.rounding, t = r.sd(), Math.max(t, n) < 2 * -r.e - 1 ? _(new s(r), n, e, !0) : (s.precision = i = t - r.e, r = F(r.plus(1), new s(1).minus(r), i + n, 1), s.precision = n + 4, s.rounding = 1, r = r.ln(), s.precision = n, s.rounding = e, r.times(.5))) : new s(NaN) }, y.inverseSine = y.asin = function () { var n, e, i, t, r = this, s = r.constructor; return r.isZero() ? new s(r) : (e = r.abs().cmp(1), i = s.precision, t = s.rounding, -1 !== e ? 0 === e ? ((n = I(s, i + 4, t).times(.5)).s = r.s, n) : new s(NaN) : (s.precision = i + 6, s.rounding = 1, r = r.div(new s(1).minus(r.times(r)).sqrt().plus(1)).atan(), s.precision = i, s.rounding = t, r.times(2))) }, y.inverseTangent = y.atan = function () { var n, e, i, t, r, s, o, u, c, f = this, a = f.constructor, h = a.precision, l = a.rounding; if (f.isFinite()) { if (f.isZero()) return new a(f); if (f.abs().eq(1) && h + 4 <= x) return (o = I(a, h + 4, l).times(.25)).s = f.s, o } else { if (!f.s) return new a(NaN); if (h + 4 <= x) return (o = I(a, h + 4, l).times(.5)).s = f.s, o } for (a.precision = u = h + 10, a.rounding = 1, n = i = Math.min(28, u / R + 2 | 0); n; --n)f = f.div(f.times(f).plus(1).sqrt().plus(1)); for (N = !1, e = Math.ceil(u / R), t = 1, c = f.times(f), o = new a(f), r = f; -1 !== n;)if (r = r.times(c), s = o.minus(r.div(t += 2)), r = r.times(c), void 0 !== (o = s.plus(r.div(t += 2))).d[e]) for (n = e; o.d[n] === s.d[n] && n--;); return i && (o = o.times(2 << i - 1)), N = !0, _(o, a.precision = h, a.rounding = l, !0) }, y.isFinite = function () { return !!this.d }, y.isInteger = y.isInt = function () { return !!this.d && Z(this.e / R) > this.d.length - 2 }, y.isNaN = function () { return !this.s }, y.isNegative = y.isNeg = function () { return this.s < 0 }, y.isPositive = y.isPos = function () { return 0 < this.s }, y.isZero = function () { return !!this.d && 0 === this.d[0] }, y.lessThan = y.lt = function (n) { return this.cmp(n) < 0 }, y.lessThanOrEqualTo = y.lte = function (n) { return this.cmp(n) < 1 }, y.logarithm = y.log = function (n) { var e, i, t, r, s, o, u, c, f = this, a = f.constructor, h = a.precision, l = a.rounding; if (null == n) n = new a(10), e = !0; else { if (i = (n = new a(n)).d, n.s < 0 || !i || !i[0] || n.eq(1)) return new a(NaN); e = n.eq(10) } if (i = f.d, f.s < 0 || !i || !i[0] || f.eq(1)) return new a(i && !i[0] ? -1 / 0 : 1 != f.s ? NaN : i ? 0 : 1 / 0); if (e) if (1 < i.length) s = !0; else { for (r = i[0]; r % 10 == 0;)r /= 10; s = 1 !== r } if (N = !1, o = W(f, u = h + 5), t = e ? C(a, u + 10) : W(n, u), O((c = F(o, t, u, 1)).d, r = h, l)) do { if (o = W(f, u += 10), t = e ? C(a, u + 10) : W(n, u), c = F(o, t, u, 1), !s) { +M(c.d).slice(r + 1, r + 15) + 1 == 1e14 && (c = _(c, h + 1, 0)); break } } while (O(c.d, r += 10, l)); return N = !0, _(c, h, l) }, y.minus = y.sub = function (n) { var e, i, t, r, s, o, u, c, f, a, h, l, d = this, p = d.constructor; if (n = new p(n), !d.d || !n.d) return d.s && n.s ? d.d ? n.s = -n.s : n = new p(n.d || d.s !== n.s ? d : NaN) : n = new p(NaN), n; if (d.s != n.s) return n.s = -n.s, d.plus(n); if (f = d.d, l = n.d, u = p.precision, c = p.rounding, !f[0] || !l[0]) { if (l[0]) n.s = -n.s; else { if (!f[0]) return new p(3 === c ? -0 : 0); n = new p(d) } return N ? _(n, u, c) : n } if (i = Z(n.e / R), a = Z(d.e / R), f = f.slice(), s = a - i) { for (o = (h = s < 0) ? (e = f, s = -s, l.length) : (e = l, i = a, f.length), (t = Math.max(Math.ceil(u / R), o) + 2) < s && (s = t, e.length = 1), e.reverse(), t = s; t--;)e.push(0); e.reverse() } else { for ((h = (t = f.length) < (o = l.length)) && (o = t), t = 0; t < o; t++)if (f[t] != l[t]) { h = f[t] < l[t]; break } s = 0 } for (h && (e = f, f = l, l = e, n.s = -n.s), o = f.length, t = l.length - o; 0 < t; --t)f[o++] = 0; for (t = l.length; s < t;) { if (f[--t] < l[t]) { for (r = t; r && 0 === f[--r];)f[r] = P - 1; --f[r], f[t] += P } f[t] -= l[t] } for (; 0 === f[--o];)f.pop(); for (; 0 === f[0]; f.shift())--i; return f[0] ? (n.d = f, n.e = k(f, i), N ? _(n, u, c) : n) : new p(3 === c ? -0 : 0) }, y.modulo = y.mod = function (n) { var e, i = this, t = i.constructor; return n = new t(n), !i.d || !n.s || n.d && !n.d[0] ? new t(NaN) : !n.d || i.d && !i.d[0] ? _(new t(i), t.precision, t.rounding) : (N = !1, 9 == t.modulo ? (e = F(i, n.abs(), 0, 3, 1)).s *= n.s : e = F(i, n, 0, t.modulo, 1), e = e.times(n), N = !0, i.minus(e)) }, y.naturalExponential = y.exp = function () { return $(this) }, y.naturalLogarithm = y.ln = function () { return W(this) }, y.negated = y.neg = function () { var n = new this.constructor(this); return n.s = -n.s, _(n) }, y.plus = y.add = function (n) { var e, i, t, r, s, o, u, c, f, a, h = this, l = h.constructor; if (n = new l(n), !h.d || !n.d) return h.s && n.s ? h.d || (n = new l(n.d || h.s === n.s ? h : NaN)) : n = new l(NaN), n; if (h.s != n.s) return n.s = -n.s, h.minus(n); if (f = h.d, a = n.d, u = l.precision, c = l.rounding, !f[0] || !a[0]) return a[0] || (n = new l(h)), N ? _(n, u, c) : n; if (s = Z(h.e / R), t = Z(n.e / R), f = f.slice(), r = s - t) { for ((o = (o = r < 0 ? (i = f, r = -r, a.length) : (i = a, t = s, f.length)) < (s = Math.ceil(u / R)) ? s + 1 : o + 1) < r && (r = o, i.length = 1), i.reverse(); r--;)i.push(0); i.reverse() } for ((o = f.length) - (r = a.length) < 0 && (r = o, i = a, a = f, f = i), e = 0; r;)e = (f[--r] = f[r] + a[r] + e) / P | 0, f[r] %= P; for (e && (f.unshift(e), ++t), o = f.length; 0 == f[--o];)f.pop(); return n.d = f, n.e = k(f, t), N ? _(n, u, c) : n }, y.precision = y.sd = function (n) { var e; if (void 0 !== n && n !== !!n && 1 !== n && 0 !== n) throw Error(w + n); return this.d ? (e = H(this.d), n && this.e + 1 > e && (e = this.e + 1)) : e = NaN, e }, y.round = function () { var n = this.constructor; return _(new n(this), this.e + 1, n.rounding) }, y.sine = y.sin = function () { var n, e, i = this, t = i.constructor; return i.isFinite() ? i.isZero() ? new t(i) : (n = t.precision, e = t.rounding, t.precision = n + Math.max(i.e, i.sd()) + R, t.rounding = 1, i = function (n, e) { var i, t = e.d.length; if (t < 3) return G(n, 2, e, e); i = 16 < (i = 1.4 * Math.sqrt(t)) ? 16 : 0 | i, e = e.times(1 / K(5, i)), e = G(n, 2, e, e); for (var r, s = new n(5), o = new n(16), u = new n(20); i--;)r = e.times(e), e = e.times(s.plus(r.times(o.times(r).minus(u)))); return e }(t, Q(t, i)), t.precision = n, t.rounding = e, _(2 < o ? i.neg() : i, n, e, !0)) : new t(NaN) }, y.squareRoot = y.sqrt = function () { var n, e, i, t, r, s, o = this, u = o.d, c = o.e, f = o.s, a = o.constructor; if (1 !== f || !u || !u[0]) return new a(!f || f < 0 && (!u || u[0]) ? NaN : u ? o : 1 / 0); for (N = !1, t = 0 == (f = Math.sqrt(+o)) || f == 1 / 0 ? (((e = M(u)).length + c) % 2 == 0 && (e += "0"), f = Math.sqrt(e), c = Z((c + 1) / 2) - (c < 0 || c % 2), new a(e = f == 1 / 0 ? "5e" + c : (e = f.toExponential()).slice(0, e.indexOf("e") + 1) + c)) : new a(f.toString()), i = (c = a.precision) + 3; ;)if (t = (s = t).plus(F(o, s, i + 2, 1)).times(.5), M(s.d).slice(0, i) === (e = M(t.d)).slice(0, i)) { if ("9999" != (e = e.slice(i - 3, i + 1)) && (r || "4999" != e)) { +e && (+e.slice(1) || "5" != e.charAt(0)) || (_(t, c + 1, 1), n = !t.times(t).eq(o)); break } if (!r && (_(s, c + 1, 0), s.times(s).eq(o))) { t = s; break } i += 4, r = 1 } return N = !0, _(t, c, a.rounding, n) }, y.tangent = y.tan = function () { var n, e, i = this, t = i.constructor; return i.isFinite() ? i.isZero() ? new t(i) : (n = t.precision, e = t.rounding, t.precision = n + 10, t.rounding = 1, (i = i.sin()).s = 1, i = F(i, new t(1).minus(i.times(i)).sqrt(), n + 10, 0), t.precision = n, t.rounding = e, _(2 == o || 4 == o ? i.neg() : i, n, e, !0)) : new t(NaN) }, y.times = y.mul = function (n) { var e, i, t, r, s, o, u, c, f, a = this.constructor, h = this.d, l = (n = new a(n)).d; if (n.s *= this.s, !(h && h[0] && l && l[0])) return new a(!n.s || h && !h[0] && !l || l && !l[0] && !h ? NaN : h && l ? 0 * n.s : n.s / 0); for (i = Z(this.e / R) + Z(n.e / R), (c = h.length) < (f = l.length) && (s = h, h = l, l = s, o = c, c = f, f = o), s = [], t = o = c + f; t--;)s.push(0); for (t = f; 0 <= --t;) { for (e = 0, r = c + t; t < r;)u = s[r] + l[t] * h[r - t - 1] + e, s[r--] = u % P | 0, e = u / P | 0; s[r] = (s[r] + e) % P | 0 } for (; !s[--o];)s.pop(); return e ? ++i : s.shift(), n.d = s, n.e = k(s, i), N ? _(n, a.precision, a.rounding) : n }, y.toBinary = function (n, e) { return X(this, 2, n, e) }, y.toDecimalPlaces = y.toDP = function (n, e) { var i = this.constructor, t = new i(this); return void 0 === n ? t : (q(n, 0, g), void 0 === e ? e = i.rounding : q(e, 0, 8), _(t, n + t.e + 1, e)) }, y.toExponential = function (n, e) { var i = this, t = i.constructor, r = void 0 === n ? A(i, !0) : (q(n, 0, g), void 0 === e ? e = t.rounding : q(e, 0, 8), A(i = _(new t(i), n + 1, e), !0, n + 1)); return i.isNeg() && !i.isZero() ? "-" + r : r }, y.toFixed = function (n, e) { var i, t = this, r = t.constructor, s = void 0 === n ? A(t) : (q(n, 0, g), void 0 === e ? e = r.rounding : q(e, 0, 8), A(i = _(new r(t), n + t.e + 1, e), !1, n + i.e + 1)); return t.isNeg() && !t.isZero() ? "-" + s : s }, y.toFraction = function (n) { var e, i, t, r, s, o, u, c, f, a, h, l, d = this, p = d.d, g = d.constructor; if (!p) return new g(d); if (f = i = new g(1), t = c = new g(0), o = (s = (e = new g(t)).e = H(p) - d.e - 1) % R, e.d[0] = v(10, o < 0 ? R + o : o), null == n) n = 0 < s ? e : f; else { if (!(u = new g(n)).isInt() || u.lt(f)) throw Error(w + u); n = u.gt(e) ? 0 < s ? e : f : u } for (N = !1, u = new g(M(p)), a = g.precision, g.precision = s = p.length * R * 2; h = F(u, e, 0, 1, 1), 1 != (r = i.plus(h.times(t))).cmp(n);)i = t, t = r, r = f, f = c.plus(h.times(r)), c = r, r = e, e = u.minus(h.times(r)), u = r; return r = F(n.minus(i), t, 0, 1, 1), c = c.plus(r.times(f)), i = i.plus(r.times(t)), c.s = f.s = d.s, l = F(f, t, s, 1).minus(d).abs().cmp(F(c, i, s, 1).minus(d).abs()) < 1 ? [f, t] : [c, i], g.precision = a, N = !0, l }, y.toHexadecimal = y.toHex = function (n, e) { return X(this, 16, n, e) }, y.toNearest = function (n, e) { var i = (t = this).constructor, t = new i(t); if (null == n) { if (!t.d) return t; n = new i(1), e = i.rounding } else { if (n = new i(n), void 0 === e ? e = i.rounding : q(e, 0, 8), !t.d) return n.s ? t : n; if (!n.d) return n.s && (n.s = t.s), n } return n.d[0] ? (N = !1, t = F(t, n, 0, e, 1).times(n), N = !0, _(t)) : (n.s = t.s, t = n), t }, y.toNumber = function () { return +this }, y.toOctal = function (n, e) { return X(this, 8, n, e) }, y.toPower = y.pow = function (n) { var e, i, t, r, s, o, u = this, c = u.constructor, f = +(n = new c(n)); if (!(u.d && n.d && u.d[0] && n.d[0])) return new c(v(+u, f)); if ((u = new c(u)).eq(1)) return u; if (t = c.precision, s = c.rounding, n.eq(1)) return _(u, t, s); if ((e = Z(n.e / R)) >= n.d.length - 1 && (i = f < 0 ? -f : f) <= 9007199254740991) return r = V(c, u, i, t), n.s < 0 ? new c(1).div(r) : _(r, t, s); if ((o = u.s) < 0) { if (e < n.d.length - 1) return new c(NaN); if (0 == (1 & n.d[e]) && (o = 1), 0 == u.e && 1 == u.d[0] && 1 == u.d.length) return u.s = o, u } return (e = 0 != (i = v(+u, f)) && isFinite(i) ? new c(i + "").e : Z(f * (Math.log("0." + M(u.d)) / Math.LN10 + u.e + 1))) > c.maxE + 1 || e < c.minE - 1 ? new c(0 < e ? o / 0 : 0) : (N = !1, c.rounding = u.s = 1, i = Math.min(12, (e + "").length), (r = $(n.times(W(u, t + i)), t)).d && O((r = _(r, t + 5, 1)).d, t, s) && (e = t + 10, +M((r = _($(n.times(W(u, e + i)), e), e + 5, 1)).d).slice(t + 1, t + 15) + 1 == 1e14 && (r = _(r, t + 1, 0))), r.s = o, N = !0, _(r, t, c.rounding = s)) }, y.toPrecision = function (n, e) { var i = this, t = i.constructor, r = void 0 === n ? A(i, i.e <= t.toExpNeg || i.e >= t.toExpPos) : (q(n, 1, g), void 0 === e ? e = t.rounding : q(e, 0, 8), A(i = _(new t(i), n, e), n <= i.e || i.e <= t.toExpNeg, n)); return i.isNeg() && !i.isZero() ? "-" + r : r }, y.toSignificantDigits = y.toSD = function (n, e) { var i = this.constructor; return void 0 === n ? (n = i.precision, e = i.rounding) : (q(n, 1, g), void 0 === e ? e = i.rounding : q(e, 0, 8)), _(new i(this), n, e) }, y.toString = function () { var n = this, e = n.constructor, i = A(n, n.e <= e.toExpNeg || n.e >= e.toExpPos); return n.isNeg() && !n.isZero() ? "-" + i : i }, y.truncated = y.trunc = function () { return _(new this.constructor(this), this.e + 1, 1) }, y.valueOf = y.toJSON = function () { var n = this, e = n.constructor, i = A(n, n.e <= e.toExpNeg || n.e >= e.toExpPos); return n.isNeg() ? "-" + i : i }; var F = function (n, e, i, t, r, s) { var o, u, c, f, a, h, l, d, p, g, m, w, v, N, b, E, x, y, M, q, O = n.constructor, D = n.s == e.s ? 1 : -1, F = n.d, A = e.d; if (!(F && F[0] && A && A[0])) return new O(n.s && e.s && (F ? !A || F[0] != A[0] : A) ? F && 0 == F[0] || !A ? 0 * D : D / 0 : NaN); for (u = s ? (a = 1, n.e - e.e) : (s = P, a = R, Z(n.e / a) - Z(e.e / a)), M = A.length, x = F.length, g = (p = new O(D)).d = [], c = 0; A[c] == (F[c] || 0); c++); if (A[c] > (F[c] || 0) && u--, null == i ? (N = i = O.precision, t = O.rounding) : N = r ? i + (n.e - e.e) + 1 : i, N < 0) g.push(1), h = !0; else { if (N = N / a + 2 | 0, c = 0, 1 == M) { for (A = A[f = 0], N++; (c < x || f) && N--; c++)b = f * s + (F[c] || 0), g[c] = b / A | 0, f = b % A | 0; h = f || c < x } else { for (1 < (f = s / (A[0] + 1) | 0) && (A = L(A, f, s), F = L(F, f, s), M = A.length, x = F.length), E = M, w = (m = F.slice(0, M)).length; w < M;)m[w++] = 0; for ((q = A.slice()).unshift(0), y = A[0], A[1] >= s / 2 && ++y; f = 0, (o = T(A, m, M, w)) < 0 ? (v = m[0], M != w && (v = v * s + (m[1] || 0)), 1 < (f = v / y | 0) ? (s <= f && (f = s - 1), 1 == (o = T(l = L(A, f, s), m, d = l.length, w = m.length)) && (f--, U(l, M < d ? q : A, d, s))) : (0 == f && (o = f = 1), l = A.slice()), (d = l.length) < w && l.unshift(0), U(m, l, w, s), -1 == o && (o = T(A, m, M, w = m.length)) < 1 && (f++, U(m, M < w ? q : A, w, s)), w = m.length) : 0 === o && (f++, m = [0]), g[c++] = f, o && m[0] ? m[w++] = F[E] || 0 : (m = [F[E]], w = 1), (E++ < x || void 0 !== m[0]) && N--;); h = void 0 !== m[0] } g[0] || g.shift() } if (1 == a) p.e = u, S = h; else { for (c = 1, f = g[0]; 10 <= f; f /= 10)c++; p.e = c + u * a - 1, _(p, r ? i + p.e + 1 : i, t, h) } return p }; function L(n, e, i) { var t, r = 0, s = n.length; for (n = n.slice(); s--;)t = n[s] * e + r, n[s] = t % i | 0, r = t / i | 0; return r && n.unshift(r), n } function T(n, e, i, t) { var r, s; if (i != t) s = t < i ? 1 : -1; else for (r = s = 0; r < i; r++)if (n[r] != e[r]) { s = n[r] > e[r] ? 1 : -1; break } return s } function U(n, e, i, t) { for (var r = 0; i--;)n[i] -= r, r = n[i] < e[i] ? 1 : 0, n[i] = r * t + n[i] - e[i]; for (; !n[0] && 1 < n.length;)n.shift() } function _(n, e, i, t) { var r, s, o, u, c, f, a, h, l, d = n.constructor; n: if (null != e) { if (!(h = n.d)) return n; for (r = 1, u = h[0]; 10 <= u; u /= 10)r++; if ((s = e - r) < 0) s += R, o = e, c = (a = h[l = 0]) / v(10, r - o - 1) % 10 | 0; else if (l = Math.ceil((s + 1) / R), (u = h.length) <= l) { if (!t) break n; for (; u++ <= l;)h.push(0); a = c = 0, o = (s %= R) - R + (r = 1) } else { for (a = u = h[l], r = 1; 10 <= u; u /= 10)r++; c = (o = (s %= R) - R + r) < 0 ? 0 : a / v(10, r - o - 1) % 10 | 0 } if (t = t || e < 0 || void 0 !== h[l + 1] || (o < 0 ? a : a % v(10, r - o - 1)), f = i < 4 ? (c || t) && (0 == i || i == (n.s < 0 ? 3 : 2)) : 5 < c || 5 == c && (4 == i || t || 6 == i && (0 < s ? 0 < o ? a / v(10, r - o) : 0 : h[l - 1]) % 10 & 1 || i == (n.s < 0 ? 8 : 7)), e < 1 || !h[0]) return h.length = 0, f ? (e -= n.e + 1, h[0] = v(10, (R - e % R) % R), n.e = -e || 0) : h[0] = n.e = 0, n; if (0 == s ? (h.length = l, u = 1, l--) : (h.length = l + 1, u = v(10, R - s), h[l] = 0 < o ? (a / v(10, r - o) % v(10, o) | 0) * u : 0), f) for (; ;) { if (0 == l) { for (s = 1, o = h[0]; 10 <= o; o /= 10)s++; for (o = h[0] += u, u = 1; 10 <= o; o /= 10)u++; s != u && (n.e++, h[0] == P && (h[0] = 1)); break } if (h[l] += u, h[l] != P) break; h[l--] = 0, u = 1 } for (s = h.length; 0 === h[--s];)h.pop() } return N && (n.e > d.maxE ? (n.d = null, n.e = NaN) : n.e < d.minE && (n.e = 0, n.d = [0])), n } function A(n, e, i) { if (!n.isFinite()) return J(n); var t, r = n.e, s = M(n.d), o = s.length; return e ? (i && 0 < (t = i - o) ? s = s.charAt(0) + "." + s.slice(1) + B(t) : 1 < o && (s = s.charAt(0) + "." + s.slice(1)), s = s + (n.e < 0 ? "e" : "e+") + n.e) : r < 0 ? (s = "0." + B(-r - 1) + s, i && 0 < (t = i - o) && (s += B(t))) : o <= r ? (s += B(r + 1 - o), i && 0 < (t = i - r - 1) && (s = s + "." + B(t))) : ((t = r + 1) < o && (s = s.slice(0, t) + "." + s.slice(t)), i && 0 < (t = i - o) && (r + 1 === o && (s += "."), s += B(t))), s } function k(n, e) { var i = n[0]; for (e *= R; 10 <= i; i /= 10)e++; return e } function C(n, e, i) { if (E < e) throw N = !0, i && (n.precision = i), Error(s); return _(new n(t), e, 1, !0) } function I(n, e, i) { if (x < e) throw Error(s); return _(new n(r), e, i, !0) } function H(n) { var e = n.length - 1, i = e * R + 1; if (e = n[e]) { for (; e % 10 == 0; e /= 10)i--; for (e = n[0]; 10 <= e; e /= 10)i++ } return i } function B(n) { for (var e = ""; n--;)e += "0"; return e } function V(n, e, i, t) { var r, s = new n(1), o = Math.ceil(t / R + 4); for (N = !1; ;) { if (i % 2 && Y((s = s.times(e)).d, o) && (r = !0), 0 === (i = Z(i / 2))) { i = s.d.length - 1, r && 0 === s.d[i] && ++s.d[i]; break } Y((e = e.times(e)).d, o) } return N = !0, s } function j(n) { return 1 & n.d[n.d.length - 1] } function i(n, e, i) { for (var t, r = new n(e[0]), s = 0; ++s < e.length;) { if (!(t = new n(e[s])).s) { r = t; break } r[i](t) && (r = t) } return r } function $(n, e) { var i, t, r, s, o, u, c, f = 0, a = 0, h = 0, l = n.constructor, d = l.rounding, p = l.precision; if (!n.d || !n.d[0] || 17 < n.e) return new l(n.d ? n.d[0] ? n.s < 0 ? 0 : 1 / 0 : 1 : n.s ? n.s < 0 ? 0 : n : NaN); for (c = null == e ? (N = !1, p) : e, u = new l(.03125); -2 < n.e;)n = n.times(u), h += 5; for (c += t = Math.log(v(2, h)) / Math.LN10 * 2 + 5 | 0, i = s = o = new l(1), l.precision = c; ;) { if (s = _(s.times(n), c, 1), i = i.times(++a), M((u = o.plus(F(s, i, c, 1))).d).slice(0, c) === M(o.d).slice(0, c)) { for (r = h; r--;)o = _(o.times(o), c, 1); if (null != e) return l.precision = p, o; if (!(f < 3 && O(o.d, c - t, d, f))) return _(o, l.precision = p, d, N = !0); l.precision = c += 10, i = s = u = new l(1), a = 0, f++ } o = u } } function W(n, e) { var i, t, r, s, o, u, c, f, a, h, l, d = 1, p = n, g = p.d, m = p.constructor, w = m.rounding, v = m.precision; if (p.s < 0 || !g || !g[0] || !p.e && 1 == g[0] && 1 == g.length) return new m(g && !g[0] ? -1 / 0 : 1 != p.s ? NaN : g ? 0 : p); if (a = null == e ? (N = !1, v) : e, m.precision = a += 10, t = (i = M(g)).charAt(0), !(Math.abs(s = p.e) < 15e14)) return f = C(m, a + 2, v).times(s + ""), p = W(new m(t + "." + i.slice(1)), a - 10).plus(f), m.precision = v, null == e ? _(p, v, w, N = !0) : p; for (; t < 7 && 1 != t || 1 == t && 3 < i.charAt(1);)t = (i = M((p = p.times(n)).d)).charAt(0), d++; for (s = p.e, 1 < t ? (p = new m("0." + i), s++) : p = new m(t + "." + i.slice(1)), c = o = p = F((h = p).minus(1), p.plus(1), a, 1), l = _(p.times(p), a, 1), r = 3; ;) { if (o = _(o.times(l), a, 1), M((f = c.plus(F(o, new m(r), a, 1))).d).slice(0, a) === M(c.d).slice(0, a)) { if (c = c.times(2), 0 !== s && (c = c.plus(C(m, a + 2, v).times(s + ""))), c = F(c, new m(d), a, 1), null != e) return m.precision = v, c; if (!O(c.d, a - 10, w, u)) return _(c, m.precision = v, w, N = !0); m.precision = a += 10, f = o = p = F(h.minus(1), h.plus(1), a, 1), l = _(p.times(p), a, 1), r = u = 1 } c = f, r += 2 } } function J(n) { return String(n.s * n.s / 0) } function z(n, e) { var i, t, r; for (-1 < (i = e.indexOf(".")) && (e = e.replace(".", "")), 0 < (t = e.search(/e/i)) ? (i < 0 && (i = t), i += +e.slice(t + 1), e = e.substring(0, t)) : i < 0 && (i = e.length), t = 0; 48 === e.charCodeAt(t); t++); for (r = e.length; 48 === e.charCodeAt(r - 1); --r); if (e = e.slice(t, r)) { if (r -= t, n.e = i = i - t - 1, n.d = [], t = (i + 1) % R, i < 0 && (t += R), t < r) { for (t && n.d.push(+e.slice(0, t)), r -= R; t < r;)n.d.push(+e.slice(t, t += R)); e = e.slice(t), t = R - e.length } else t -= r; for (; t--;)e += "0"; n.d.push(+e), N && (n.e > n.constructor.maxE ? (n.d = null, n.e = NaN) : n.e < n.constructor.minE && (n.e = 0, n.d = [0])) } else n.e = 0, n.d = [0]; return n } function G(n, e, i, t, r) { var s, o, u, c, f = n.precision, a = Math.ceil(f / R); for (N = !1, c = i.times(i), u = new n(t); ;) { if (o = F(u.times(c), new n(e++ * e++), f, 1), u = r ? t.plus(o) : t.minus(o), t = F(o.times(c), new n(e++ * e++), f, 1), void 0 !== (o = u.plus(t)).d[a]) { for (s = a; o.d[s] === u.d[s] && s--;); if (-1 == s) break } s = u, u = t, t = o, o = s, 0 } return N = !0, o.d.length = a + 1, o } function K(n, e) { for (var i = n; --e;)i *= n; return i } function Q(n, e) { var i, t = e.s < 0, r = I(n, n.precision, 1), s = r.times(.5); if ((e = e.abs()).lte(s)) return o = t ? 4 : 1, e; if ((i = e.divToInt(r)).isZero()) o = t ? 3 : 2; else { if ((e = e.minus(i.times(r))).lte(s)) return o = j(i) ? t ? 2 : 3 : t ? 4 : 1, e; o = j(i) ? t ? 1 : 4 : t ? 3 : 2 } return e.minus(r).abs() } function X(n, e, i, t) { var r, s, o, u, c, f, a, h, l, d = n.constructor, p = void 0 !== i; if (p ? (q(i, 1, g), void 0 === t ? t = d.rounding : q(t, 0, 8)) : (i = d.precision, t = d.rounding), n.isFinite()) { for (p ? (r = 2, 16 == e ? i = 4 * i - 3 : 8 == e && (i = 3 * i - 2)) : r = e, 0 <= (o = (a = A(n)).indexOf(".")) && (a = a.replace(".", ""), (l = new d(1)).e = a.length - o, l.d = D(A(l), 10, r), l.e = l.d.length), s = c = (h = D(a, 10, r)).length; 0 == h[--c];)h.pop(); if (h[0]) { if (o < 0 ? s-- : ((n = new d(n)).d = h, n.e = s, h = (n = F(n, l, i, t, 0, r)).d, s = n.e, f = S), o = h[i], u = r / 2, f = f || void 0 !== h[i + 1], f = t < 4 ? (void 0 !== o || f) && (0 === t || t === (n.s < 0 ? 3 : 2)) : u < o || o === u && (4 === t || f || 6 === t && 1 & h[i - 1] || t === (n.s < 0 ? 8 : 7)), h.length = i, f) for (; ++h[--i] > r - 1;)h[i] = 0, i || (++s, h.unshift(1)); for (c = h.length; !h[c - 1]; --c); for (o = 0, a = ""; o < c; o++)a += m.charAt(h[o]); if (p) { if (1 < c) if (16 == e || 8 == e) { for (o = 16 == e ? 4 : 3, --c; c % o; c++)a += "0"; for (c = (h = D(a, r, e)).length; !h[c - 1]; --c); for (o = 1, a = "1."; o < c; o++)a += m.charAt(h[o]) } else a = a.charAt(0) + "." + a.slice(1); a = a + (s < 0 ? "p" : "p+") + s } else if (s < 0) { for (; ++s;)a = "0" + a; a = "0." + a } else if (++s > c) for (s -= c; s--;)a += "0"; else s < c && (a = a.slice(0, s) + "." + a.slice(s)) } else a = p ? "0p+0" : "0"; a = (16 == e ? "0x" : 2 == e ? "0b" : 8 == e ? "0o" : "") + a } else a = J(n); return n.s < 0 ? "-" + a : a } function Y(n, e) { return n.length > e && (n.length = e, 1) } function nn(n) { return new this(n).abs() } function en(n) { return new this(n).acos() } function tn(n) { return new this(n).acosh() } function rn(n, e) { return new this(n).plus(e) } function sn(n) { return new this(n).asin() } function on(n) { return new this(n).asinh() } function un(n) { return new this(n).atan() } function cn(n) { return new this(n).atanh() } function fn(n, e) { n = new this(n), e = new this(e); var i, t = this.precision, r = this.rounding, s = t + 4; return n.s && e.s ? n.d || e.d ? !e.d || n.isZero() ? (i = e.s < 0 ? I(this, t, r) : new this(0)).s = n.s : !n.d || e.isZero() ? (i = I(this, s, 1).times(.5)).s = n.s : i = e.s < 0 ? (this.precision = s, this.rounding = 1, i = this.atan(F(n, e, s, 1)), e = I(this, s, 1), this.precision = t, this.rounding = r, n.s < 0 ? i.minus(e) : i.plus(e)) : this.atan(F(n, e, s, 1)) : (i = I(this, s, 1).times(0 < e.s ? .25 : .75)).s = n.s : i = new this(NaN), i } function an(n) { return new this(n).cbrt() } function hn(n) { return _(n = new this(n), n.e + 1, 2) } function ln(n) { if (!n || "object" != typeof n) throw Error(f + "Object expected"); for (var e, i, t = !0 === n.defaults, r = ["precision", 1, g, "rounding", 0, 8, "toExpNeg", -u, 0, "toExpPos", 0, u, "maxE", 0, u, "minE", -u, 0, "modulo", 0, 9], s = 0; s < r.length; s += 3)if (e = r[s], t && (this[e] = c[e]), void 0 !== (i = n[e])) { if (!(Z(i) === i && r[s + 1] <= i && i <= r[s + 2])) throw Error(w + e + ": " + i); this[e] = i } if (e = "crypto", t && (this[e] = c[e]), void 0 !== (i = n[e])) { if (!0 !== i && !1 !== i && 0 !== i && 1 !== i) throw Error(w + e + ": " + i); if (i) { if ("undefined" == typeof crypto || !crypto || !crypto.getRandomValues && !crypto.randomBytes) throw Error(a); this[e] = !0 } else this[e] = !1 } return this } function dn(n) { return new this(n).cos() } function pn(n) { return new this(n).cosh() } function gn(n, e) { return new this(n).div(e) } function mn(n) { return new this(n).exp() } function wn(n) { return _(n = new this(n), n.e + 1, 3) } function vn() { var n, e, i = new this(0); for (N = !1, n = 0; n < arguments.length;)if ((e = new this(arguments[n++])).d) i.d && (i = i.plus(e.times(e))); else { if (e.s) return N = !0, new this(1 / 0); i = e } return N = !0, i.sqrt() } function Nn(n) { return n instanceof h || n && "[object Decimal]" === n.name || !1 } function bn(n) { return new this(n).ln() } function En(n, e) { return new this(n).log(e) } function xn(n) { return new this(n).log(2) } function yn(n) { return new this(n).log(10) } function Mn() { return i(this, arguments, "lt") } function qn() { return i(this, arguments, "gt") } function On(n, e) { return new this(n).mod(e) } function Dn(n, e) { return new this(n).mul(e) } function Fn(n, e) { return new this(n).pow(e) } function An(n) { var e, i, t, r, s = 0, o = new this(1), u = []; if (void 0 === n ? n = this.precision : q(n, 1, g), t = Math.ceil(n / R), this.crypto) if (crypto.getRandomValues) for (e = crypto.getRandomValues(new Uint32Array(t)); s < t;)429e7 <= (r = e[s]) ? e[s] = crypto.getRandomValues(new Uint32Array(1))[0] : u[s++] = r % 1e7; else { if (!crypto.randomBytes) throw Error(a); for (e = crypto.randomBytes(t *= 4); s < t;)214e7 <= (r = e[s] + (e[s + 1] << 8) + (e[s + 2] << 16) + ((127 & e[s + 3]) << 24)) ? crypto.randomBytes(4).copy(e, s) : (u.push(r % 1e7), s += 4); s = t / 4 } else for (; s < t;)u[s++] = 1e7 * Math.random() | 0; for (t = u[--s], n %= R, t && n && (r = v(10, R - n), u[s] = (t / r | 0) * r); 0 === u[s]; s--)u.pop(); if (s < 0) u = [i = 0]; else { for (i = -1; 0 === u[0]; i -= R)u.shift(); for (t = 1, r = u[0]; 10 <= r; r /= 10)t++; t < R && (i -= R - t) } return o.e = i, o.d = u, o } function Sn(n) { return _(n = new this(n), n.e + 1, this.rounding) } function Zn(n) { return (n = new this(n)).d ? n.d[0] ? n.s : 0 * n.s : n.s || NaN } function Pn(n) { return new this(n).sin() } function Rn(n) { return new this(n).sinh() } function Ln(n) { return new this(n).sqrt() } function Tn(n, e) { return new this(n).sub(e) } function Un(n) { return new this(n).tan() } function _n(n) { return new this(n).tanh() } function kn(n) { return _(n = new this(n), n.e + 1, 1) } (h = function n(e) { var i, t, r; function s(n) { var e, i, t, r = this; if (!(r instanceof s)) return new s(n); if (n instanceof (r.constructor = s)) return r.s = n.s, void (N ? !n.d || n.e > s.maxE ? (r.e = NaN, r.d = null) : n.e < s.minE ? (r.e = 0, r.d = [0]) : (r.e = n.e, r.d = n.d.slice()) : (r.e = n.e, r.d = n.d ? n.d.slice() : n.d)); if ("number" == (t = typeof n)) { if (0 === n) return r.s = 1 / n < 0 ? -1 : 1, r.e = 0, void (r.d = [0]); if (n < 0 ? (n = -n, r.s = -1) : r.s = 1, n === ~~n && n < 1e7) { for (e = 0, i = n; 10 <= i; i /= 10)e++; return void (N ? s.maxE < e ? (r.e = NaN, r.d = null) : e < s.minE ? (r.e = 0, r.d = [0]) : (r.e = e, r.d = [n]) : (r.e = e, r.d = [n])) } return 0 * n != 0 ? (n || (r.s = NaN), r.e = NaN, void (r.d = null)) : z(r, n.toString()) } if ("string" != t) throw Error(w + n); return 45 === (i = n.charCodeAt(0)) ? (n = n.slice(1), r.s = -1) : (43 === i && (n = n.slice(1)), r.s = 1), (b.test(n) ? z : function (n, e) { var i, t, r, s, o, u, c, f, a; if ("Infinity" === e || "NaN" === e) return +e || (n.s = NaN), n.e = NaN, n.d = null, n; if (d.test(e)) i = 16, e = e.toLowerCase(); else if (l.test(e)) i = 2; else { if (!p.test(e)) throw Error(w + e); i = 8 } for (o = 0 <= (s = (e = 0 < (s = e.search(/p/i)) ? (c = +e.slice(s + 1), e.substring(2, s)) : e.slice(2)).indexOf(".")), t = n.constructor, o && (s = (u = (e = e.replace(".", "")).length) - s, r = V(t, new t(i), s, 2 * s)), s = a = (f = D(e, i, P)).length - 1; 0 === f[s]; --s)f.pop(); return s < 0 ? new t(0 * n.s) : (n.e = k(f, a), n.d = f, N = !1, o && (n = F(n, r, 4 * u)), c && (n = n.times(Math.abs(c) < 54 ? v(2, c) : h.pow(2, c))), N = !0, n) })(r, n) } if (s.prototype = y, s.ROUND_UP = 0, s.ROUND_DOWN = 1, s.ROUND_CEIL = 2, s.ROUND_FLOOR = 3, s.ROUND_HALF_UP = 4, s.ROUND_HALF_DOWN = 5, s.ROUND_HALF_EVEN = 6, s.ROUND_HALF_CEIL = 7, s.ROUND_HALF_FLOOR = 8, s.EUCLID = 9, s.config = s.set = ln, s.clone = n, s.isDecimal = Nn, s.abs = nn, s.acos = en, s.acosh = tn, s.add = rn, s.asin = sn, s.asinh = on, s.atan = un, s.atanh = cn, s.atan2 = fn, s.cbrt = an, s.ceil = hn, s.cos = dn, s.cosh = pn, s.div = gn, s.exp = mn, s.floor = wn, s.hypot = vn, s.ln = bn, s.log = En, s.log10 = yn, s.log2 = xn, s.max = Mn, s.min = qn, s.mod = On, s.mul = Dn, s.pow = Fn, s.random = An, s.round = Sn, s.sign = Zn, s.sin = Pn, s.sinh = Rn, s.sqrt = Ln, s.sub = Tn, s.tan = Un, s.tanh = _n, s.trunc = kn, void 0 === e && (e = {}), e && !0 !== e.defaults) for (r = ["precision", "rounding", "toExpNeg", "toExpPos", "maxE", "minE", "modulo", "crypto"], i = 0; i < r.length;)e.hasOwnProperty(t = r[i++]) || (e[t] = this[t]); return s.config(e), s }(c)).default = h.Decimal = h, t = new h(t), r = new h(r), "function" == typeof define && define.amd ? define(function () { return h }) : "undefined" != typeof module && module.exports ? ("function" == typeof Symbol && "symbol" == typeof Symbol.iterator && (y[Symbol.for("nodejs.util.inspect.custom")] = y.toString, y[Symbol.toStringTag] = "Decimal"), module.exports = h) : (n = n || ("undefined" != typeof self && self && self.self == self ? self : window), e = n.Decimal, h.noConflict = function () { return n.Decimal = e, h }, n.Decimal = h) }(this);
     </script>
     <script id="bank_app" version=0.6>
         const bank_app = {
 
-            launchApp: function(reqCallback, resCallback) {
+            launchApp: function (reqCallback, resCallback) {
                 return new Promise((resolve, reject) => {
                     let data = ["requests", "responses", "appendix"];
                     Promise.all(data.map(d => compactIDB.readAllData(d))).then(results => {
@@ -10654,7 +10744,7 @@
             accounts: [],
             rates: {},
 
-            refreshData: function(reset = false) {
+            refreshData: function (reset = false) {
                 return new Promise((resolve, reject) => {
                     this.readDataFromBlockchain().then(accounts => {
                         if (reset) {
@@ -10686,7 +10776,7 @@
                 })
             },
 
-            readDataFromCloud: function(isAdmin, reqCallback, resCallback) {
+            readDataFromCloud: function (isAdmin, reqCallback, resCallback) {
                 if (isAdmin)
                     return floCloudAPI.requestApplicationData("REQUEST", {
                         receiverID: floGlobals.adminID,
@@ -10753,7 +10843,7 @@
                 }
             },
 
-            readDataFromBlockchain: function() {
+            readDataFromBlockchain: function () {
                 return new Promise((resolve, reject) => {
                     let options = {
                         sentOnly: true,
@@ -10802,7 +10892,7 @@
 
             },
 
-            dataConstruct: function(time, floID, type, index, sign, pubKey, amount = null, tokenTx = null) {
+            dataConstruct: function (time, floID, type, index, sign, pubKey, amount = null, tokenTx = null) {
                 let data = [];
                 data.push(time);
                 data.push('floID:' + floID);
@@ -10817,7 +10907,7 @@
                 return this.util.istr + data.join('|');
             },
 
-            parseAccount: function(time, account) {
+            parseAccount: function (time, account) {
                 if (!account.data) {
                     this.updateAccountNetValues(time);
                     if (account["I_b"])
@@ -10898,7 +10988,7 @@
             },
 
             tokenAPI: {
-                fetch_api: function(apicall) {
+                fetch_api: function (apicall) {
                     return new Promise((resolve, reject) => {
                         console.log(floGlobals.tokenURL + apicall);
                         fetch(floGlobals.tokenURL + apicall).then(response => {
@@ -10909,14 +10999,14 @@
                         }).catch(error => reject(error))
                     })
                 },
-                getBalance: function(floID, token = floGlobals.token) {
+                getBalance: function (floID, token = floGlobals.token) {
                     return new Promise((resolve, reject) => {
                         this.fetch_api(`api/v1.0/getFloAddressBalance?token=${token}&floAddress=${floID}`)
                             .then(result => resolve(result.balance || 0))
                             .catch(error => reject(error))
                     })
                 },
-                getTx: function(txID) {
+                getTx: function (txID) {
                     return new Promise((resolve, reject) => {
                         this.fetch_api(`api/v1.0/getTransactionDetails/${txID}`).then(res => {
                             if (res.result === "error")
@@ -10945,7 +11035,7 @@
                         }).catch(error => reject(error))
                     })
                 },
-                sendToken: function(privKey, amount, message = "", receiverID = floGlobals.adminID, token = floGlobals.token) {
+                sendToken: function (privKey, amount, message = "", receiverID = floGlobals.adminID, token = floGlobals.token) {
                     return new Promise((resolve, reject) => {
                         let senderID = floCrypto.getFloID(privKey);
                         if (typeof amount !== "number" || amount <= 0)
@@ -10959,13 +11049,13 @@
                         }).catch(error => reject(error))
                     });
                 },
-                validateToken: function(tx, sender, receiver, amount = null, token = floGlobals.token) {
+                validateToken: function (tx, sender, receiver, amount = null, token = floGlobals.token) {
                     return ((!sender || tx.sender === sender) &&
                         (!receiver || tx.receiver === receiver) &&
                         (amount === null || tx.amount === amount) &&
                         (token === tx.token));
                 },
-                verifyToken: function(txid, sender, receiver, amount = null, token = floGlobals.token) {
+                verifyToken: function (txid, sender, receiver, amount = null, token = floGlobals.token) {
                     return new Promise((resolve, reject) => {
                         this.getTx(tx).then(txn => {
                             if (sender && txn.sender != sender)
@@ -10984,7 +11074,7 @@
 
             },
 
-            writeBankTxData: function(privKey, data, receiverID, tokenAmt = null, token = floGlobals.token) {
+            writeBankTxData: function (privKey, data, receiverID, tokenAmt = null, token = floGlobals.token) {
                 return new Promise((resolve, reject) => {
                     let senderID = floCrypto.getFloID(privKey);
                     if (senderID != floGlobals.adminID)
@@ -11007,7 +11097,7 @@
                 })
             },
 
-            checkTxDuplicate: function(txid, floID = null) {
+            checkTxDuplicate: function (txid, floID = null) {
                 let accounts = [];
                 if (!floID)
                     accounts = this.accounts;
@@ -11019,7 +11109,7 @@
                 return false;
             },
 
-            addAccount: function(floID, account, time, txid, tokenTx) {
+            addAccount: function (floID, account, time, txid, tokenTx) {
                 this.updateAccountNetValues(time);
                 account.netAmt = account.amount;
                 account.status = "active";
@@ -11034,7 +11124,7 @@
                 this.updateRates();
             },
 
-            closeAccount: function(floID, index, time, sign, txid, tokenTx) {
+            closeAccount: function (floID, index, time, sign, txid, tokenTx) {
                 let accIndex = this.accMap[floID][index];
                 if (typeof accIndex != "number")
                     throw Error("Invalid Account index");
@@ -11052,7 +11142,7 @@
                 this.updateRates();
             },
 
-            updateAccountNetValues: function(time = Date.now()) {
+            updateAccountNetValues: function (time = Date.now()) {
                 if (this.util.lastUpdate > time)
                     throw Error("update time is already passed");
                 let t, rates = {};
@@ -11067,7 +11157,7 @@
                 this.util.lastUpdate = time;
             },
 
-            calcNetValue: function(P, r, t) {
+            calcNetValue: function (P, r, t) {
                 let x, A;
                 //A = P*e^rt
                 x = Decimal.mul(r, t) //rt
@@ -11076,7 +11166,7 @@
                 return A.toNumber();
             },
 
-            calcUtilizationRate: function(toNum = true) {
+            calcUtilizationRate: function (toNum = true) {
                 let totalLoan = 0,
                     totalDeposit = 0;
                 for (let acc of this.accounts)
@@ -11098,7 +11188,7 @@
                 return toNum ? U.toNumber() : U;
             },
 
-            calcBorrowingRate: function(U = null, toNum = true) {
+            calcBorrowingRate: function (U = null, toNum = true) {
                 if (U === null)
                     U = this.calcUtilizationRate(false);
                 let model = this.model["I_b"];
@@ -11111,7 +11201,7 @@
                 return this.evaluator(model, constants, toNum);
             },
 
-            calcSavingRate: function(U = null, I_b = null, toNum = true) {
+            calcSavingRate: function (U = null, I_b = null, toNum = true) {
                 if (U === null)
                     U = this.calcUtilizationRate(false);
                 if (I_b === null)
@@ -11127,7 +11217,7 @@
                 return this.evaluator(model, constants, toNum);
             },
 
-            calcRates: function(toNum = true) {
+            calcRates: function (toNum = true) {
                 let U, I_b, I_s, result;
                 U = this.calcUtilizationRate(false);
                 I_b = this.calcBorrowingRate(U, false);
@@ -11144,19 +11234,19 @@
                 };
             },
 
-            updateRates: function() {
+            updateRates: function () {
                 this.rates = this.calcRates(false);
                 return this.rates;
             },
 
-            getRates: function() {
+            getRates: function () {
                 let rates = {}
                 for (let x in this.rates)
                     rates[x] = this.rates[x].toNumber();
                 return rates;
             },
 
-            getUserDetails: function(floID) {
+            getUserDetails: function (floID) {
                 let accList = this.accMap[floID]
                 let result = {
                     accounts: [],
@@ -11181,7 +11271,7 @@
                 return result
             },
 
-            getAccount: function(floID, index) {
+            getAccount: function (floID, index) {
                 let mappedIndex = this.accMap[floID][index]
                 return this.accounts[mappedIndex];
             },
@@ -11235,7 +11325,7 @@
                 return postfix
             },
 
-            evaluator: function(model, constants, toNum = true) {
+            evaluator: function (model, constants, toNum = true) {
                 let result = [];
                 const operator = (o) => {
                     switch (o) {
@@ -11274,7 +11364,7 @@
                     return result[0];
             },
 
-            makeDeposit: function(amount) {
+            makeDeposit: function (amount) {
                 return new Promise(async (resolve, reject) => {
                     try {
                         let index = this.accMap[myFloID] ? this.accMap[myFloID].length : 0;
@@ -11300,7 +11390,7 @@
                 })
             },
 
-            verifyDeposit: function(reqID) {
+            verifyDeposit: function (reqID) {
                 return new Promise(async (resolve, reject) => {
                     let req = this.requests[reqID];
                     try {
@@ -11336,8 +11426,8 @@
                         compactIDB.writeData("requests", req, reqID);
                         //send response to client
                         floCloudAPI.sendApplicationData(response, "RESPONSE", {
-                                receiverID: req.floID
-                            }).then(result => resolve(response))
+                            receiverID: req.floID
+                        }).then(result => resolve(response))
                             .catch(error => reject(error))
 
                     } catch (error) {
@@ -11354,17 +11444,18 @@
                             compactIDB.writeData("requests", req, reqID);
                             //send rejected response to client
                             floCloudAPI.sendApplicationData(response, "RESPONSE", {
-                                    receiverID: req.floID
-                                }).then(result => resolve(response))
+                                receiverID: req.floID
+                            }).then(result => resolve(response))
                                 .catch(error => reject(error))
                         }
                     }
                 })
             },
 
-            withdrawDeposit: function(index) {
+            withdrawDeposit: function (index) {
                 return new Promise(async (resolve, reject) => {
                     try {
+                        index = parseInt(index)
                         //check for validity (ie no loans outstanding)
                         let details = this.getUserDetails(myFloID)
                         let acc = details.accounts[index]
@@ -11390,7 +11481,7 @@
                 })
             },
 
-            closeDeposit: function(reqID) {
+            closeDeposit: function (reqID) {
                 return new Promise(async (resolve, reject) => {
                     let req = this.requests[reqID];
                     try {
@@ -11425,8 +11516,8 @@
                         req.status = "completed";
                         compactIDB.writeData("requests", req, reqID);
                         floCloudAPI.sendApplicationData(response, "RESPONSE", {
-                                receiverID: req.floID
-                            }).then(result => resolve(response))
+                            receiverID: req.floID
+                        }).then(result => resolve(response))
                             .catch(error => reject(error))
                     } catch (error) {
                         if (error.message || !error.startsWith('R>'))
@@ -11442,15 +11533,15 @@
                             compactIDB.writeData("requests", req, reqID);
                             //send rejected response to client
                             floCloudAPI.sendApplicationData(response, "RESPONSE", {
-                                    receiverID: req.floID
-                                }).then(result => resolve(response))
+                                receiverID: req.floID
+                            }).then(result => resolve(response))
                                 .catch(error => reject(error))
                         }
                     }
                 })
             },
 
-            requestLoan: function(amount) {
+            requestLoan: function (amount) {
                 return new Promise(async (resolve, reject) => {
                     await this.refreshData()
                     let index = this.accMap[myFloID] ? this.accMap[myFloID].length : 0;
@@ -11471,7 +11562,7 @@
                 })
             },
 
-            sendLoan: function(reqID) {
+            sendLoan: function (reqID) {
                 return new Promise(async (resolve, reject) => {
                     let req = this.requests[reqID];
                     try {
@@ -11501,8 +11592,8 @@
                         req.status = "completed";
                         compactIDB.writeData("requests", req, reqID);
                         floCloudAPI.sendApplicationData(response, "RESPONSE", {
-                                receiverID: req.floID
-                            }).then(result => resolve(result))
+                            receiverID: req.floID
+                        }).then(result => resolve(result))
                             .catch(error => reject(error))
                     } catch (error) {
                         if (error.message || !error.startsWith('R>'))
@@ -11518,17 +11609,18 @@
                             compactIDB.writeData("requests", req, reqID);
                             //send rejected response to client
                             floCloudAPI.sendApplicationData(response, "RESPONSE", {
-                                    receiverID: req.floID
-                                }).then(result => resolve(response))
+                                receiverID: req.floID
+                            }).then(result => resolve(response))
                                 .catch(error => reject(error))
                         }
                     }
                 })
             },
 
-            repayLoan: function(index) {
+            repayLoan: function (index) {
                 return new Promise(async (resolve, reject) => {
                     try {
+                        index = parseInt(index)
                         this.refreshData();
                         let details = this.getUserDetails(myFloID)
                         let acc = details.accounts[index]
@@ -11554,7 +11646,7 @@
                 })
             },
 
-            closeLoan: function(reqID) {
+            closeLoan: function (reqID) {
                 return new Promise(async (resolve, reject) => {
                     let req = this.requests[reqID];
                     try {
@@ -11593,8 +11685,8 @@
                         req.status = "completed";
                         compactIDB.writeData("requests", req, reqID);
                         floCloudAPI.sendApplicationData(response, "RESPONSE", {
-                                receiverID: req.floID
-                            }).then(result => resolve(result))
+                            receiverID: req.floID
+                        }).then(result => resolve(result))
                             .catch(error => reject(error))
                     } catch (error) {
                         if (error.message || !error.startsWith('R>'))
@@ -11610,15 +11702,15 @@
                             compactIDB.writeData("requests", req, reqID);
                             //send rejected response to client
                             floCloudAPI.sendApplicationData(response, "RESPONSE", {
-                                    receiverID: req.floID
-                                }).then(result => resolve(response))
+                                receiverID: req.floID
+                            }).then(result => resolve(response))
                                 .catch(error => reject(error))
                         }
                     }
                 })
             },
 
-            updateModel: function(I_b = null, I_s = null, constants = {}) {
+            updateModel: function (I_b = null, I_s = null, constants = {}) {
                 return new Promise((resolve, reject) => {
                     if (myFloID !== floGlobals.adminID)
                         reject("Access Denied! Admin only")
@@ -11636,7 +11728,7 @@
                 })
             },
 
-            viewAllRequests: function(floID = null) {
+            viewAllRequests: function (floID = null) {
                 let requests = this.requests
                 if (floID) {
                     let result = {}
@@ -11648,10 +11740,11 @@
                     return requests;
             },
 
-            viewAllResponses: function() {
+            viewAllResponses: function () {
                 return this.responses;
             }
         }
     </script>
 </body>
-</html>
+
+</html>
\ No newline at end of file