RanchiMall/articles
3
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity
9ca69ed4e1
articles/index.html
Vivek Teega bfbbdb5bdc Justifying content paragraph
2020-09-05 20:39:23 +05:30

10373 lines
439 KiB
HTML
Raw Blame History

This file contains invisible Unicode characters

This file contains invisible Unicode characters that are indistinguishable to humans but may be processed differently by a computer. If you think that this is intentional, you can safely ignore this warning. Use the Escape button to reveal them.

<html lang="en">
<head>
<meta charset="UTF-8">
<meta name="viewport" content="width=device-width, initial-scale=1.0">
<title>RanchiMall Times</title>
<script src="https://use.fontawesome.com/41cc35d596.js"></script>
<link
href="https://fonts.googleapis.com/css2?family=Playfair+Display:ital,wght@0,400;0,500;0,600;0,700;0,900;1,400;1,700;1,900&family=Poppins:wght@400;500;600;700&display=swap"
rel="stylesheet">
<link href="https://fonts.googleapis.com/css2?family=Lora:wght@400;500;600;700&display=swap" rel="stylesheet">
<style>
* {
padding: 0;
margin: 0;
box-sizing: border-box;
}
.hide {
display: none !important;
}
body {
font-family: 'lora', serif;
font-size: 16px;
color: #2f2f2f;
background-color: #f9f7f1;
--accent-color: teal;
--text-color: 24, 24, 24;
--foreground-color: 255, 255, 255;
--error-color: #E53935;
}
header {
font-family: 'Playfair Display', serif;
font-weight: 900;
width: 100%;
text-align: center;
font-size: 4rem;
text-transform: uppercase;
padding: 1rem 0;
letter-spacing: 6;
}
p {
margin: 1.2rem 0;
display: -webkit-box;
-webkit-line-clamp: 8;
-webkit-box-orient: vertical;
overflow: hidden;
text-align: justify;
}
p:not(:first-of-type)::first-letter {
margin-left: 4rem;
}
#homepage {
display: grid;
}
.head {
display: flex;
flex-direction: column;
text-align: center;
justify-content: center;
position: relative;
margin-bottom: 1rem;
}
.subhead {
display: flex;
flex-direction: column;
align-items: center;
text-transform: uppercase;
padding: 0.6rem 0;
}
.subhead::after {
content: '';
position: absolute;
bottom: 0;
width: 10%;
height: 0.1rem;
background: #2f2f2f;
}
.columns {
padding-top: 2rem;
display: grid;
grid-template-columns: repeat(auto-fit, minmax(26rem, 1fr));
}
.column {
font-size: 1.2rem;
line-height: 1.8;
display: flex;
flex-direction: column;
padding: 0 1.5rem;
vertical-align: top;
margin-bottom: 4rem;
}
.column .headline {
text-align: center;
line-height: normal;
font-family: 'lora', serif;
display: block;
margin: 0 auto;
}
.column .headline.hl1 {
font-weight: 700;
font-size: 30px;
text-transform: uppercase;
padding: 0.8rem 0;
}
.column .headline.hl2 {
font-weight: 400;
font-size: 24px;
padding: 0.8rem 0;
}
.column .headline.hl2:before {
border-top: 1px solid #2f2f2f;
content: '';
width: 100px;
height: 7px;
display: block;
margin: 0 auto;
}
.column .headline.hl2:after {
border-bottom: 1px solid #2f2f2f;
content: '';
width: 100px;
height: 13px;
display: block;
margin: 0 auto;
}
.column .headline.hl3 {
font-weight: 400;
font-size: 36px;
padding: 0.8rem 0;
font-style: italic;
font-family: 'Playfair Display', serif;
}
.column .headline.hl4 {
font-weight: 500;
font-size: 0.9rem;
padding: 0.8rem 0;
}
.column .headline.hl4:before {
border-top: 1px solid #2f2f2f;
content: '';
width: 100px;
height: 7px;
display: block;
margin: 0 auto;
}
.column .headline.hl4:after {
border-bottom: 1px solid #2f2f2f;
content: '';
width: 100px;
height: 10px;
display: block;
margin: 0 auto;
}
.column .headline.hl5 {
font-weight: 400;
font-size: 42px;
text-transform: uppercase;
padding: 0.8rem 0;
}
.column .headline.hl6 {
font-weight: 400;
font-size: 18px;
padding: 0.8rem 0;
}
.column .headline.hl6:before {
border-top: 1px solid #2f2f2f;
content: '';
width: 100px;
height: 7px;
display: block;
margin: 0 auto;
}
.column .headline.hl6:after {
border-bottom: 1px solid #2f2f2f;
content: '';
width: 100px;
height: 10px;
display: block;
margin: 0 auto;
}
.column .headline.hl7 {
font-weight: 700;
font-size: 0.9rem;
display: block;
padding: 0.8rem 0;
}
.column .headline.hl8 {
font-weight: 700;
font-size: 0.9rem;
padding: 0.8rem 0;
}
.column .headline.hl9 {
font-weight: 700;
font-size: 0.9rem;
padding: 0.8rem 0;
}
.column .headline.hl10 {
font-weight: 700;
font-size: 0.9rem;
padding: 0.8rem 0;
}
.column .citation {
font-family: 'Playfair Display', serif;
font-size: 36px;
line-height: 44px;
/*font-style: italic;*/
text-align: center;
font-weight: 400;
display: block;
margin: 40px 0 40px 0;
font-feature-settings: "liga", "dlig";
}
.column .citation:before {
border-top: 1px solid #2f2f2f;
content: '';
width: 100px;
height: 16px;
display: block;
margin: 0 auto;
}
.column .citation:after {
border-bottom: 1px solid #2f2f2f;
content: '';
width: 100px;
height: 16px;
display: block;
margin: 0 auto;
}
.column .figure {
margin: 0 0 20px;
}
.column .figcaption {
font-style: italic;
font-size: 0.9rem;
}
.media {
-webkit-filter: sepia(80%) contrast(1) opacity(0.8);
filter: sepia(80%) grayscale(1) contrast(1) opacity(0.8);
mix-blend-mode: multiply;
width: 100%;
}
:any-link {
text-decoration: none;
color: #DC143C;
cursor: pointer;
}
.topnav {
overflow: hidden;
display: flex;
justify-content: space-between;
align-items: center;
}
/* Style the links inside the navigation bar */
.topnav a {
float: left;
text-align: center;
padding: 14px 16px;
text-decoration: none;
font-size: 17px;
}
.topnav a img {
width: 14rem;
}
.rmtimeslogo_size {
width: 25rem;
height: 10rem;
overflow: visible
}
.spinner {
animation: Rotate 2.4s both infinite linear;
}
.path {
animation: DrawLine 1.6s both infinite alternate linear;
fill: none;
stroke: #000;
stroke-width: 50;
}
@keyframes Rotate {
0% {
transform: rotate(0deg);
}
100% {
transform: rotate(360deg);
}
}
@keyframes DrawLine {
0% {
stroke-dasharray: 0 126;
}
100% {
stroke-dasharray: 126 126;
}
}
/*________________________________________________________________________________________________________________________________*/
/*MEDIAQUERIES*/
@media all and (max-width: 640px) {
header {
font-size: 2.5rem;
}
.topnav a img {
width: 10rem;
}
.rmtimeslogo_size {
width: 15rem;
height: auto;
margin: 3rem 0 1rem 0;
}
}
@media all and (min-width: 640px) {
.columns {
margin: 0 2vw;
}
}
@media all and (min-width: 1920px) {
.columns {
margin: 0 4vw;
}
}
</style>
<script src="components.js"></script>
</head>
<body translate="no" onload="onLoadStartUp()">
<sm-notifications id="sm-notifications"></sm-notifications>
<nav class="topnav">
<a id='ranchimalltimes-logo' style="cursor:pointer"><img
src="data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAjoAAACTCAYAAACHxLPPAAAQxXpUWHRSYXcgcHJvZmlsZSB0eXBlIGV4aWYAAHjarZlpkhs5DoX/8xRzBIIbwONwjZgbzPHnQ0pVdrnttntiXFZJllKZTODhLXQ4//n3Df/iTxGxUKpa661F/pReehq8sPj605/fEsvz+/mTR0zvd7+8H3p+fynxlr9+/1vH61kG79dvX/i4hsyv7wd7f5LsfSL5PPFrBX5lf72/XyTvp9f7Uj5WdF4vWjf9fqnzfaL1PvBZyvtRPpf1evJ/hy9vKFXalQvllE6WHPmd8nsF+fUYPIzfko3j/D1/3QNPKX/cKwX5cnsfzzF+X6AvRf54FX6sfkk/L34a7yPyD7Vs7xrx4qcfSP3h/fx5/fQFDp8rSl8/OM/fH27n/bh3273ndXejNCra3oh6ii0fp+HAyc3l52uNH+VRea3PT+fH4oiLlu+44uRnSZdEV26QIluGXDnP85LFEks6SXlOaaX8vGdZU0+LLkku/iM3ae5508GUVzohZ95On2uR57r9ud4S48pbODQJJxO+8suf8Hcf/pOfcO/yEsmD2PTUinUlBwHL8M75b46iIXLffatPgT9+3u2P3wHLoVo4zMts3OCI83WKWeUbtvLT58xxlefXCEnQ/T4BC+LalcVIpgOxSa7SJGpKKkIdjQYNVp5ySZMOSK1ps8hUcm4paGJkuDbfUXmOTTW15G/DTTSi5paV3vQ8aFYpFfxoMTA0aq6l1tqqVgu119FyK6221rQ5yQ3NWrRqU1XTrsOyFavWTM2s2+ipZziw9ta1W+99jBQGFxqca3D84J2ZZp5l1tmmTpt9jgV8Vll1taXLVl9jp503NLHb1m2773EkHJjilFNPO3rs9DMuWLv5lltvu3rt9js+u/bu6l9+/kHX5N219HTKj9PPrvFuUP04hTidVO8ZHUtF6Lh6BwB08p5Fk1KSd857FntiKGpikdV7E7Z4x2hhOZLqlc/efevcH/UtVPujvqXfdS546/4fnQu07q99+0nXtuvcejr2mkKvacxMH8eMVsJMCxkqO62dUlEZtljOfHhOU+u3rnUGa+Kyq1yOTmuYljOlrb2z1niT3RmmxFtzP8X4Cv2Ox/Ts2u5pfOnoqnP3rGOcKz3NM9BgnVw350UL6F6LvaYabF1a0Fj1PSnNxXDNWWxsXu4Gb66mdqJeiedqvenUltPpFDG3LdKjHuCUg8jkNK1MbdnGnKNc6/GattUOJ00225itDrOdZ+WlWdsmm6PGBLeTs81YAWTL0pecWaKctUtlXVFLXHNHW0Y33RgM/v7tc/jdAX/0vFxF8rXWyhVK21jDblplZw5g8b22BXqld8NL7VGMPizNd8ngGJmAVU7Ku7UgdjI8oLNdMFFGi9SERzFZN58+7eZ95oYVl036Qd91n4SAyV5qpaFFo8zQdublpuU6VnH3lBgWpnRKctlKQKPzje06yRLq6Mduk3FXHsO93k11ywzMc+dS1hk2Hpt5ZhA2dkb70rLudEx2o7c7jTtXlQmCwIPOfEZVB72OG0qHx1K0O0D4OVz6nKOy7AJCoe15MyuT2S11FOA3NVOfDBjS7pxHawPjM6xchl6gmuNRTtAThrTcvO6OE2a5fLfPE++WTg0gIiZINoVb+eZUuOqYWW6gAMNihr+8OPA8/Yqx5uGdxZu1a6B0cxNHznVO6YPJhmY2i+uymDGIqGBrCgYPLI7I57VDYkfaFSZVUCNhlZCtgHjqaoULtFnNYCgmvF+4qpZ9ZQdv+oHs+N69FbKgeGIJUrirxl1ziTdCg4yZC7ZVVr1lQ1ZDzx21C/yasgWhYTj1mDsMtLgJPJsprWXY2+xaT+q7ZXwQTqcnFsEKctUFVoZxA7cjt2vgRtZDWBSu+zVNwGaj+A1yZDwHkFo3jVKB7lhnuSpZh/yoWO1HaNTcu4ULcMxkQK0Njrzcv/Mqi8/NjQBVuDmDENiCT+mwFMeUzIpITZmL6YLHQ2KhMNIsNGIxMyMbdOhKdCPMgFj5DB3djR5C5lA0x05o2/mIeo3Fu1oINb1IauN2LBEYWlF2YeV9OtHVrYwrSEbrBu3Ex3ktwf8+zfaJsxvo4iIQG5c76jb6PNMJMZ3pVaZbuoHPgv9zO2AxVaUeECxUyPwcP0GCSIFZD878LATumLWWpFFsjQkBH0X9+r4bWeFqONEDjXfs1EKMJwshoFUIpSK2zYKO0zqdgkPRhZMuszHgGJjn6O3Am4VB8L4SodjcceyMHsPPCAIyc7D0gdIyZBhvtOakzcVYmGHG7wIGlYV1p2DUDx4a4LzFMaD4ztpjbUwy1ISv1tCBvaCxza5bavd+KGmu3NkF4Whku5z7RkpV0k4Hnag2q3aEbhf63yhGmwEhLbqVgT8xITGABXN+hFG9LgAGjQ0uDJVZIZgxHAcjwThkONShN2BsXc+sMQAw+C3U/HKRe5mjC9f0puSAXely3VEXCgMI9GBWDEI9MAagv4x0zRgtZqGqwj00fpeDW0gwROsw74HblYWBRKiCaHeyuVaKMSJMhN8GPIu/yCED71kbmN7z7I2Own/ufWdZBb+CtsFuU2FLLIH0/K7+bFiX+g0a4cGGFHqKScgtbgWWTqTYo11wLwsmgQpkHGY4T8MzcMIFo2PBhTE8mnENQY1R25MbmHR8bVZSd1KlbKgdMlUOFgiugZL2QpIYZ7DUKL9/QbzG4FBDUX85I67ursNgQiCnI4VwaQd5FxeS/LaMWxGKt+CByCVhPbR0XoGfRr7BK1TaRGgwZJ3ypzQS2Q1AGDELejcQfiK4AJamd5G6DmvCyvkSSNZQE7NW4dzLKiMEvZwV4UUDA9xgkVH2Xly/1ekRjtD2KJ3K9rWfQZmB1HDqDAwyjgWNycKH8Yw2j3ZEiMW7LKt1PXhZJI4hLP6StXCK9gwTUg6ih90wkVRsDawb4ZMBpfR6zE9xsViCeEVWd1tfh8WALWR9D+ZtO2vbAQt7McwBKdzu4jAIEAL29Hi96cZkNgrHZwquAw+Re7vbx9717thEx1ANEMpHaP8qij/GhaSGc1ycMZuDBF1Gj0VBOKIMuuupve8KQSJx4B2phNcYcUPOboX8BYailARyj9RHqFBZGGzEEraDSiHCw/A0nDXcBZqxSAkokTcgFG4J0mBoR41RQQcUjory2eg4zCIHkGMm+820nICBPJ+2sL/e9NbOYVxpH2Yl3XFyGAiHf7QiYo5B534MK82K8DtgEs7uiA/GIUF48DKtSTQF2pdbvD4MCRAOPB15pJEJh/TsYdrjlHD9nxmfvEELRFeYX6SDlEERkUOviRsKGtpraM+IVDj2sX6M/akZmCs31L2j9x7u+5mpwzkQYSeGe3us9VnARj/uDb7nVXwpYzweNcbhTQDqmJY5uLGxN2o4M7QnbV+ACEs2F3MFA6Q/HH6OYXlkAbBjK1Lphe8JZkJEMPj0iHIu4+u2sUFEMNLIGIu4FOFy1oC/Ut/MCcj7KQquLybroMDapusy8OR+Lelzy0Qe0hX3x7w72ZIa6RpUOi7ekBKgIimjNG7N6oXtsPpHiIWgCFsBXWNsxxmnSh2kJcgc2huKQ5wEzZvclVus000ESAZRt734f+Cn9yUr4dc2uoEXWr3HbXXCgzMBzM3UTawUWatc8sylf74TQWBG0m6OXhmMyC5YpfWCpfq+5s3zepkwoJtJ8ynkZMCpeYg1hSFHD61xDvMOjw5Rk40YDMwe7N6ZJ/wNdWIqxbWQC9HUyCGocMnIi+85Yjar537nQd8YzXhrfCieppMMPLn5C2JhsXbIHscneJY7XcqJwVrhYocj/bAcHqOH73RJwmqRHMVDnou4Jm6FPImpAu6kcm50OP85opnxzn0ixRcdajssGBtLx2khZ+uAYbtA11sa8d8lDM8oKCHAYQFMFinBx7ZgavBYAEJgjxoYaagC/SrcAmtfxowAyubXKkK8wViQ5LvvwBEbEvwAq4jvc/G1US1xuQJnV4ScBB9rzLm4laZmscGSXjV3Q4yAywMaAM8cVoZJJnQ0v+4yq4wFSA5t0irShIdZj211UUw6Bm7AEeS8VsuQCK4lYwaJAGRXdxjwCp9igZE7lo6K7LoRT4YJ+2jHzSuEi+mClslH7m4e/81Eopc6e1dsy4aBDU1Dra5gb3fwwLw8ZXIdJqc50dG2+cgOqlvd2RFfWAIiOs42/DuN5BOiEfzpOoJFCeOioUxQGwmU4YUn/IhlwH9YefbVoVWcmzt60MxNswwh+xaABYvDA91tbEDMvJfc5SJmnjTdVXl14RuMplWiEQRZCTzI/7MpyP2AKibLnQ1ShVaMEsAZ7tQnaviGxk02/UwUEJbcOCaopGJ3tczEq02r2lkeeQA162a43f/OgDrjXLEjjGohDoxecFgJsCb3hEAQP0fhfmxJq6jddB7bD8EG3BTmD4c0YvYc8SgKDtH9I8YswinoHXRGmKq+JvDsW0RG+IJkIEsPyycG35WZmJgOIzItuB3f2XhUWX2LBDZcvsFCzGPmI8LE7Q2MCvrenEigPixHDJP053sAWAjfCsH9XL6xFRfSCA2PTrReXLN3cv3YqKQ7kdGiQYPoAjEi7xDpBCFQJymzepQk3TAxZAiAW7FCyDbrWi4LxEPcKOcqbuFNM6hBqYfn8uB77e4+MczLokde3NweDPL0gE20QiQxtp2C4/7AMM4SzFFPsmgFrDB1rzOIZR9CB6ezK9jGy+f4BZ/5e3xCGVDUra0rGdPjAsU6J3iAS/Ue0h6xAu9V48kLE0d41MmDPNt09+ROEqfr+2a34Wk4GREMP7y2gwvJXvM8lDmgtzc8B5GPeDM9DWFBM9RIHn3wqu4NvA0YDjJ1E+pAD3aAqZExtwbLNyxNDqIGLsCXEypOmblKkAm5gQHlRExe8iA7JuRPT/JeOIpQfrZRBT1B4ZjHS7OheCwnRvkSlVAHHBZJj9ED+sUD0XGhCbSkAnxnZ+KV26uN4hBNsQJ+3Vw94UGMgBUf5BvLBYWmmRSQyW/PXr1YWCklEMQMorxQ5v+60xZ+8gGzTNUhM99SZsgIjojbnMQC8uTyjUiqSRAFKFCweCIVfHY/Mok5y3cDdnUJS2J7EnyYt4r+pSJ0CI5g3kk2jJSrx7oepeC2OdYZyBH5xcUYd62P2nO8b1UNLy0uaFbOCJv4QEe8BWGMUWFSSCrL+RO7lX2zrk/f5LqUk1CojBXRPReumRyeY0zfLXZJ7fYE5DF9d/HiNXGJ40ykYHPhEfB36oZnJ1log4BV2PT49hdMriRa7ISR/wl+eDAPlwSdqxEKgRnXAtsOM2xN8dyzcABJpqsqJ8XvMEnKn4zduz6BubUENpuDmgmL+J51C2126srz+IYmtuS0AQJduqjNyhihUgeMAd85QzO2t+P/8RD2+Ft8HGriIuGxbZJRgnoYIWNDK8v0MUdILFD0lAYr1eI7j2Sh4ilj+d64jupWUtyp5A1aoK8WDFN5iIy+r9Q9RlryCEubKTQfbewlssxAk2ZcgiOpeDe0wtW0wyxYF9JiUP+/QG6M6BOTLlebh7nbK5erT1CuzrUI/6AavpcA10J1tDExXozKvifQ94PfRYvQag4+dY/tCEPIoPxOvROfzXlQ+RoH2JlPJHr+i5OwkTE3+M5wC5JYcTF4u+Vn9QHHLOCBcMoJ5DW3zH0L9pzS4o58rf7fBtgiilegKkY1NOrgD0/ytogfvWJafIv98ZXeOm7pYqNcB+WXz+F3B/zp8y9ORGSCkMN/AZftdFGQZt33AAABhGlDQ1BJQ0MgcHJvZmlsZQAAeJx9kT1Iw0AcxV8/pEUqImYQcchQnSyIijhqFYpQIdQKrTqYXPoFTQxJiouj4Fpw8GOx6uDirKuDqyAIfoA4OTopukiJ/0sKLWI8OO7Hu3uPu3dAsFFlmhUeAzTdNjOppJjLr4iRV0TRBwEiwjKzjFlJSsN3fN0jwNe7BM/yP/fn6FELFgMCIvEMM0ybeJ14atM2OO8TC6wsq8TnxKMmXZD4keuKx2+cSy4HeaZgZjNzxAKxWOpgpYNZ2dSIJ4njqqZTfjDnscp5i7NWrbHWPfkLYwV9eYnrNIeQwgIWIVFHCmqooAobCVp1UixkaD/p4x90/RK5FHJVwMgxjw1okF0/+B/87tYqTox7SbEk0PXiOB/DQGQXaNYd5/vYcZonQOgZuNLb/o0GMP1Jer2txY+A3m3g4rqtKXvA5Q4w8GTIpuxKIZrBYhF4P6NvygP9t0D3qtdbax+nD0CWukrfAAeHwEiJstd83h3t7O3fM63+fgA04nKO6Q3f2wAAAAZiS0dEAAAAAAAA+UO7fwAAAAlwSFlzAAALEwAACxMBAJqcGAAAAAd0SU1FB+QIERQxGSDNLNEAAB/HSURBVHja7Z17lBxFvcc/IZjwCC5BFBGyokDUkOUhCCgLIXIwJusbFLKCovgIF7y+kNX4vCpoUOQcTI5R8RlMUEEO4XUJCgQ2YhSPkISoEUxuFrwmgUBCRNCE3D9+1Xd6e6t6emZ6enp2v59z5uxOd01NT/VM9bd/9a1fwU5GIYQQQgghhBBCCCGEEEIIIYQQQgghhBBCCCGEEEIIIYQQQgghhBBCCCGEEEIIIYQQQgghhBBCCCGEEEIIIYQQQgghhBBCCCGEEEIIIYQQQgghhBBCCCGEEKJoRpfkOBYDM4BNwPqUcj3AEuBQYBWwJVCuC/gTMBl4ENioUy2EEEKIVtANbI49FgOdgbL3xcqtBfoC5S5J1Hkx0KGmFkIIIUTRXAXcBfQC96eImEgQ9SSEzNKEMOpwr7/K1RGVu8/VIYQQQghRCJ1OhMQFSFzExKM7i4F5sXK9wLqYMJrltvc5wRRFcHpi5aLojhBCCCFE05kH3ODZ3svgIaq57v+uRLkuKlGgSBitdWIpWe4uwlEgIYQQQohciYaiulP2r0sIHp/PpiMhYkJ1djhhFa+vS6dBCCGEEM1gKYOHonx0JcTO3EC5pNhZSth8fFVCFPXqVAghhBAiT85zIqPa8FEHg2dapYmdxYlyIbHjiwBJ7AghhBAiFzrx+2h8XIJFdOZVETs9bntUPovYWSexI4QQQoi8WeBERrW8NpGHJ5pmflVA7ETTyaOZVj1ki+wkh8Xk2RFCCCFEQ/QkxEuIaMgqPk3cF4WZS2VGVjwic4NH7KSJqWqGZyGEEEKIquJlbUK8hIhy6fQktp+XECbR44YqAmaze62PpChaoFMlhBBCiFqJzMLVvDDdAfESsc4jYroyCJi1+M3PPlHUo9MlhBBCiKz0VREvEfFZVp1V6qomTLo85ULT2ZOi6D6dMiGEEEJkIYqYrCN9OnkH5qWp5uHp9AiYxYGyd3nK+obNesg+1CWEEEKINmGXJtffRcXzcj6wPqXsXFd+FTCninDybfOJqJUBUZNki2fbB/X1EEIIISR0QnRgkZYO4GbgpioipycmiEL0Ek4Y6BMwyzzbZni2+QRYJ1rtXAghhBAeujDz72bSZ1nFh6uqDRfNwj/jKjTzKjoOX1kfvnJKIiiEEEK0Mc2I6HRRieSARWh8Q0Odrlw0Y+pm4FuBOucyOJPyzRmPZWWDn2WCviJCCCGEhE7ELAZnIp4P9KeUi0TOAP4hq0g0xSMrnw4ImMkBMeVDQ1JCCCGEhE5mup0giUddVgGzPcIjKheJoa3AWQyN+vQ5MRQXJYuwqE9o/aqsQidrOS0JIUR5+QT+IedPqGlEm3Nc4Lt9DbBPG9RfKnZt8PUzgJkMNQIPAG9MCIYPunJJQTKbSoSmw9XZ5xEfy6hEfXwCZFkThM5K/d6EEEKI4S90eqgMDU12giRt+GcFcJETJF2EzcgrMR/MAic2QhGUVVjUJxJDJ9QgxLKg9a2EEEWzJzAW2A48CexUkwjROqEzqwZxEQmjLHRRfXhoERb12VKl7i0e8RISOv0ZBdGyNj+/hwDfx+9fqpUB4K/AI8AfgN8DfwKe1s9IiJrYF/g88M7Ytp8AXwI2FvS7fzfVM9U3kynuBndcSpnpwHJ9XUSjZPXorM9QZhlwQYZyWzFDcRYRMZ+hs7bODJS9OaPYWuYRRDMziqeRzATXOfUCXwNuB9a4zuoUd2cqhEhnNPD+hMjBPf8ksFtBxzEN2KNFbTAWeH0VkSNE4UJnWRXhcgHmyVno7vxDLAKOwAzF/VXebwpDzczd+IfMtjI0IWFWQTQrJYIhj04645yg/Llr1yk0P9u2EO3Mi9zvxMeJwMEFHcdxwEta1AYvAabqqyDKJnT6A+JijhMuC6uUXQQcyeDojC8XzqqYaPKJjIsCx3cTg6MvPYQ9RHFB1JEidObo61ETRwHXAZ/RnZoQqdGMUCTl4AJ/Owc7wTWq4M8/CngtMFFfBVEUWT06692Fv9v9n7akwyInNPpduX78Q18rsaGpLrd/PukRlDTxMichXi5OObb4sczCb0QeSIg3kZ2PAPsDnwUeVXMIMYhtwBOBfauAxwo8llOBa4ENBb7nPiiaI0oqdCIxkSXK0Q8clLHO2RnLdRBe4yopXnxT032CqJPwKunzR8C5vxDz2GTlIOBQdxd4eJWyZ7gO/fPAU/qZCfH/bHA3gL6btiXAugKPZQpwLMWakidjw2ZClFLotJK5hKeAx8VLL+GhqPkJQRQSTgOEl6IYTjxAbTMaoiHJUZgx+UwsN9L4QPlzsQjdAjRtVoiIncAPsOnk5wBHAw8C3wN+hE01L5JpwK8KuiGRCVm0hHYwjp5HeAbVnJh46aoiXuKCqI/wMNj5+lpU7ajXA5e6TuuOlLJnkz1poxAjhWew6eSnYkM5xwLfpjWpGo4p8DcqE7KQ0PHQRdhvsyomXqKlJUgRL5FZuZfwkNUi0meDicH8BYughRZZPZrsSRuFEMUzETMHN9uULBOykNAJiJyQeNlKJfLSgQ2PpA1t9WcQTlvJ7hkSFTYBlxFOK3Ac8Fw1kxCl+K1u82w/FXhBk9+7Azjes32bOy4hRpzQqSZezqcyQ2su4ezKy6hEfSLh1BEQOW9ECQLrZQVwdWDfYZinRwjRWm4A7vRsj0zJzeQI4GTP9jtpbYZmIaHTMpGzmPSZUzfFRE7IvxNfHytN5MDghUVF7ezAMiX77hYPRj4dIcrAFvc79TGV5mVlTjMhL6HY6e1iBFK2WVeRyAlFaBZRidD0uoePaPX0LRlEznyUMycP/gasDtwZ7tfk997bve8J2NT3lzI4inQvZqD+LbAUeIjiZ7ekMQp4PmaQfy02BffwxPGvcRepu2ltqH+MO75u4FXAy7C1lZJt3e8efwWeLUk7R9+TU12E4ZjYvhXY7Kd+4Db3fR5uswXHA9dg69Qdndj3GiyFxJ+a8L4hE/Lv3ff5HSX5XrRr/yHaSOhkETnnx0ROaIbVViySk0XkRAuGisb5B/6IDu4i3ozv7gmYGXpalbLHuMfb3PPV2KKHV9OcabW7AZdg04fjrALe6y6okcA5DPgwcFqG4+91bbwIuAJbYLUo9gXehS0GOaGGtr7H3UwswWYbtYJO13fMJDy1+XD3iI77WuBy913Jm08An/Js/wq2jlwzGXCCOSl0IlPyn3MWeGkm5N8Cm2m+P6jd+g+RM2UZuqomcpbVIHKi5SOyiBxNJc+Pp8i2+GseHecRmIfrugydlI9JwNcxb8CxFJ8GPxJDH8dmrJ1Ww+vGYYtCXoctptrsYx8LnO6O8zPU7rd6NZYf5ofuvBXZ1rs6cXOHa7Na8rec5r4fM2mffGNZ2A78muJMyWkm5CXAv7GFTotiuPQfos2EThdwX4rIiXtt5uYkci6QyGnKRWX3At7jfa6DmZZDfUc5wfvWgjurfV20YDb1J087BPgGNuTQLMYDXwa+w+DhqXqYBvzCCYgi+p09sNXA5xFOapnl888B3jLMLmb3U5wpOc2EfH8L+qjh0H+INhM6WaIukddmLmFPTq0iR56c/BlDeIgqj/HsXZ04nUO+mVXHY0tVvKaANpqMDVV9DVsmo1EmuChLM8zez3dC6tyc2/ob2BBAMy8MHa5dPpZDXeOwdduOHEa/1SdcNMXHa7AoXh5UMyE/UbDIaff+QzRw8ssscqKoS1aR04vlyZHIKZ79gRcH9q1rsO5R7q764yllVgNXYf6DjcA/sQjTrtjMrzc7cTE+IBi+gI3XP9TkdvoqQ83Z2zCT492YR2KH234Q5iN4XUpU4jgXJbki9ro8oiEXuTYLcQ9wI/A7d36fxYYgJgPT3TGNDwiHL7lzdFeT2vg/AtuXYsNYK2Li+4XY0MqphIflJmBZvv9Ia7IX50WnO7dPu++az5Q8FRtqzMOUXM2EXBTDqf8QbSR08hI5q2IRnzTvjkRO8znKdQhJNgBrG6x7ErYIqe9ObMCJ2+sZanaNnj+Kres1392d+zwxR2OzPy7NUTD4SIqcb7nHw56y/a7z3c99/lB0ZRo2m2Ygp4vCu1Lea5W7g70bf6TuDve41P2Gz/Wct/0wM+46ivF1XYtF0f6C32h7DbCXu1B9KPA9mw78GBtmHw48TPNNyVPxm5Bvj33fR9F8j85w6j9EHbRi6KoZIqdHIqfl0Zy3B/b9rsGIzlhsAdGJgTvDdwM/I9uMnvXARzEjoo/XAgcW1GYDwHtcx/lwlbIbnLj4XmD/sS6SktdF4ZzAviXAO52QqTYc+ai7gMzGb3yNIlHNvMhtw3w6F2DT89Mu3E9ivqnLUgTqq4fRb3YHcCv+HDZ5mJL3DrTXBve+kRjYHTigiZ9zuPYfosRCpxkip0sip6XsgXkhTky5ODYyFj8BM0n6LmKX13GHvQ0z164J3JVNKkjkfMj9FrLmmHkK+CbhFeePyUE0jMWM/6GLwudqjBptx6bghsTDjCZeGLa5u/gryT6tfTs2bHN9YP/hDK+Vt9cQNiW/ssG6Qybk32G5lYpiOPYfosRCp5PsM6FqETkyHreOcaQPqdwN/KrB9zgwEK1YnnLRr8aDhFddP5zmz6C4zLVNrUMDAynt+SIan/V2GOZlCF0U1tRR53b3G7wlcGFo1tID38FmedWarPAJwovUHjDMhM42LHWHj5Oo35RcJhPycOw/RI0U5dGptnZVXJBcklHkdEjktFQgH4EZVqeldKLfBv63wffaI9Cp/IFwgsJqPEN4aut+rqNulun0eve9rcf/sBPL0urjhVhunnrbJErs5stifSONmUc3YZGd6Z59R7o2+VeObbwc89PUO9tvNWYqTXrO9sG8PH9v09/tPtiQ0ubEzUjepuSymJCHY/8hSix0+kjPeBwJkh7MEOgjnvEYLOojkVMce2L5X05xYnNKhqjFkhze9+aUO+xGWJ8SGdmtiR3VrQ3e0T7iLsTJEPnz3EXs0QYugscF9t2CeVga4Y/uRiV5d32wuxjlKXTupDFj9gbMN5UUOpNcO7Vzf5+M4jfDlHw81U3IRTHc+g9RUqHTnSJebqYyXNVB9WSA62OCKLSY56clcjJxSxPr/gbwXcq9HsyOGi4GRbxvVnbSnLWjJuAP8f8em47dKBsxb8Zkzx133otJPktjM4aeZeTMnIlMye9iaDTvVGzGWi2Lbu7tBJJPPN7qadc9ac/hwFb1H6KkQickXgYYnJ34EsIRmrOorC6eJogWYVN1RWvYhmXS/RGtW9dI1MfL8Q9brXYipVH+gUX5rkxs3079QwgiH/6Eeb+SloHIlFzLTVHIhPwr/MNgY53YFaJthU4v4ayt51MZhurE1pTxMR/LJ1JNEA2gBTpbya1YMrwVDL9Vn4c7owgne3wYS56Wxx3wSjV1KXnK/X593siTsCGnLDcuaSbk36AFMMUwFTozAtsXJcRLaBhqK5ayO0udceEkihU4V7rz2YoozihsuYIudzd5FOaj6GJ4zZBpJmPxR3Og8azWojzsTngm1X3YauLJWXC1mJLLZEJW/yEKETqdKaIkKV5OCJRbmBAv3fijOasSwkkUxy9ofAp5PeyDJZx7B0ONlKI2dsNMlD42qXmGDQenXLz/hi2RkRQ6tZiSy2RCVv8hChM6PpYx1LGelkAwiyC6SaeyZi4ke16UXbEMor61j3qxNYs2FHTce7hjuZD6V6UWg9klpS/4p5pnRNCoKblWE3KrUP8hoZMrIfGSNfIyQPYx/WU6lTXzALUlzNqJTS1P3hFOwXLpLKD53pxDMR/QVJ0+IXInzZT8iipCp1YTcsTzyG/5EvUfonChM7lBUVJLlEbenOazHFv88BzPvplY7pJmLtB4JLYwY7Uw8wA2lHkflpvlEfwJ3iYCX9dpFeL/STMlT8NWrPf58NJMyLdSDhOy+g8JnaZQZJRFszmaz9PYStrTGRrajhZovILmhKg7ga+kdFKrqaxRtIlskaV/65QKMYTfYl6dZELQNFNyyITcj61t1WrUf4xwmpnYqBZzsC8S4MukvEqnrKU8gEV1fJyBhYbzZizwfvxZe7dhC02+DktQuBFNbReiETYCt3m2R6Zk3zpOx+A3Id9D683s6j9E0zM4+lJv+7w7tQxnDWQURSJ/nsFmWQ0EOsLTyT9KOAl4U6CT+hgwD+XnaJR/pVyQRqt5RhQ7sZw3Pj/OqcALEtv2dkIhSVlMyOo/RNOFznzPthMyCpiQx8e3vEOnTmVhrAR+Htj39pxF5yjMAD3Bs+8abLFJ3YE1znbCs6sOUPOMOCJTcpKjsQzaceo1IReB+g9RiNDpZ2hUx5dbZwtDc+t04DfFzccSCVarUzTvongd/qnpE4CzyW/tor1SBO9itHBeXjxNeJX5A9U8I47IlJxkHGY6jpIOlt2ErP5DFCJ0wJZliAuTTvyZkBcyNG9OSBS9MbFtJhq+KvqO7/rAvunY+jh5sC/+aN0qypeArN15MLB9AvkvuinKT2RKTjIVMx9H3w1fhH6pe32rUf8hChM6650wiYudi/F7dc5PiJ0Z+KM6K4ELEtvm6nQWxg5s+MpnDt8PW4R1rxzeZ/dAPRuBzToNubIWvy9jEpYiv1FGu5uR7sTjeJRqv4xkMSUfjz9ichv5LASr/kO0jdCJhElc7HSmCJOk2JmLP1qzMCF2uiR2Cr8wXhfY9wbgxBzeYxyWtj7JGPdotBMUFQYCwvVYLAdJo+wFfBobMog/ZkvolJKd2NINviHqqcBLCZuQf005vC/qP0ShQscndnqqiJ24kXlxitg5O1ZnL3CeTmsh7MDSwi8PdDDvzCES8EwgyrA/llG1XvYA3qJTOIjNhDNlT3Nt1ggHBC46j2AzYET5WA/c69l+HPBBwibkNSU5fvUfonChE4mdI6hMJ+91IsY3jDU7JmI6XDnfMNZNTkBFd6MXA306tYVFAdK8Oic3WP9W/CbZg7FVhuthFDYk+jadPu8dvO/C8Cb8eUiysqv7PviEzgoJndKSZkp+H+XOhKz+Q7RM6EDFTBxFbLoJR2xuAk5ywqgDiwDN9QijlYk6+zBDnAzKzb84Xg/cHdh/lrt7qpdHCS8r8QaG5vTI0km9AfgsGi7xsRq4JXBh+0gD5/I4d9OSZA1wh5q91IRMyT7KYkJW/yFaLnQiZrs7xWVOkCwGZnnKRWbmC5xC7w0Ioy2xOgfc/qUoutNs/o4NYfk4EVvxfFSddT+Z0nG+Driohg5nD2xIdB7+vBrCptsuwJ8Q8kRsraBaxM4oJ3K+EmjzGwnP9hLlIGRK9lEWE7L6D1EaoQOWZycuYi5x4qTbU3YhNuw1JyaM+hga3emPldvqyixGSQWbxU4sXB266+vFP2SRte6lhMf834ulbj8iRUzt5jq1G4AvZujYxgF7juDzuQK4MrBvBrbe2ZQMfcce7sZlIf6ZOcuBH2N5mUS5f9+3U913s8aV21myY1f/IZq6qGctLHSPPsxMvNg9v5TBoccoseAiV7bPdaazGZqDZw42lBWVWeqez0ernefNBne+pnj2TXZitt4FP/+MZTGdHdg/zT1+j62gHvk9ounMJwHja3i/cYzsvDE7gO+5G4NzPfuPwmbb3YNF8vqxIYLoxukgbFbOWSl3vgPAl2nuavciP9ZiQ4wTU8r8GlhXwmNX/yFKI3RC4qQnIE7WY2HEOVgocZ57zZyE4ImGs+YnhNF8hmZiFo1xJ+bvmO7ZdwawBFsUtFa2YysLH0l6BuyjCa9OnGQb5i06nqHRpknYDKG/jOBz+ZS7ydg/pc1f7R618jjwX+7CKNqDZ7Co7QdTytxBOTMNq/8QLR+68hGJkyOx5SP6gPvwD1NF/p3IlzPPlZ3pKXe+p86Z+grkxibg6sC+icCZVFLH11P3p5xYapTH3fm/HHgsUOYVOp1swgzIP82xzgeBD2ARIa0x1F78kfDwdNlMyOo/ROmFjk+cLMKGtEKCp78OwbMIM0lK8OTH3YSnm58OHNZA3QPAfwI/aaCOP7hzfTVmmlwbKHc4mlUBNiT1Ecy0+XiDdV0NvBXLsyKR036kmZLLZkJW/yHaRujExclszDA2PyZ4fDO0ahE8c1ydEjz58QS2NIQvL8p+wGk0lpF0I/Bhd8G8p4bXrQYudN+N37oL7TbMeOvjZOAQnU7Ahi2uBF6D+WoGanjtNndRmIpNOHhEzdm2hEzJZTQhq/8QgxjVhsfc4UTOee7CmvTlxOnGIkAnxMTNogbrFOUR6YcAp7iL8Mtincvj7u5ruYsgrAL+pSbLhTGYwbwbeFWi3bdhOa1Wu4vfvdiwgRDqP4SoU/DMw1LXV4vG9AL3ZyjbgU2fjcr1qJmFEEII0Uo6sRwHWcTJedgUyM2EszHj7lbvz1BOCCGEEKIQehIiJpQgsANLTLjZPS7Gv9ZWBzbsFZWbGygnhBBCCFEI8aGntaQv/9AF3BUrOzNjuVlqZiGEEEK0knh0J7SkREQ8apM2THVeok4NZwkhhBCiZXRSicSkDVHhRMv9sbJ9GevUgqFCCCGEaCnzYsJkLeHoTgcVU3M1n0+8zqVowVAhhBBCtJDemDDZ7J5nFUZdGepci6aiCyGEEKJEYmdWRrGTJoxqqVMIIYQQolCxM7cJYmeumlkIIYQQ7SB2bpDYEUIIIdqX0SPwM6/EzMOR9yb6u8xTdpkTMWPd8xnYooYrG6hTCCGEEKKpdDB4mvhmwrOxzkuU24zfoNzB4Cnqm5FBWQghhBAtojshStYSniaeFEVL8efk6amhTiGEEEKIpnJDRgHTxdCoTl9GUbRAzSyEEEKIVtBTg4BZ5ynri9b0esp1q6mFEEKI4tllhH/+m4CtiW2hxT37PdtmBepMcpG+akIIIYSETitIzqDqxD+N3DeDyieKtgCrEtu6kVdHCCGEkNApgdABmOzZ5ovodOCfgbXFs00zsIQQQggJncLxiZKujIIoVHa9Z9sMNbUQQgghoVNW8QND/TwDgXLra6hTCCFE43wE2JnDY13G93sipY6nazjuRwN1XFZnO9wSqO83ORxTLY9GmATMAX4NbAL+hU3sWQ38GDidSiJfkYFo5tUN2IyrrpSyl2BrYPWS7rnpdfXNwxIOyp8jhBASOrWIik3AmBrbYAKwIwehs6FFQmcc8H3g2Qz1rwfOzVLpKP02hBBCDBOhc7n7/xvAHxL7PwtMdP9/AXgosf8y4AXA/wAHZXi/VwOHY5NSprht92C501aQfQmgycARwNnAtMS+M4Cf1dAGn3efLc5VwPWuPR7KWM8Y4BXAR4F3u203Aj+t8rrPAYfWqS92B+4EjnXPn3HvudyJvt1c0OBk1/YRP3Pn4Fn9BIQQQgx3oRPd7ftyl/XH9h/v2X8vtUV0Ij4Zq/fLDRz/hZ6oxW01vH4XJ9KSdbwlp2P6aobyN1N/ROfS2GsfAF6SUvYY4OFY+d2qNYwQQgjR7vwTeMw9NtTx+gfdazeX4LM85v6eQrboEsDrqNgkHm3Rcdf7vrsA74s9PwNbQinEvbWIQAkdIYQQw4FvA/u6x1/qeP2Z7rWvLMFnucr9HUVGH0pMKOykdUsPfRMbgju7xte9EBjv/h9gaC46H/dnrXxX/TaEEEKIUvFL4DTgQOA9mO9mR0r5FwBvcv8vAf7WouP+nXvUyj9j/48DRlf5vAB3UPEMpZZVREcIIYQoF2OA77r/DwCmVyn/buA57v/5mLG3nXicSq668cCHM7zmfiwKdybwbwkdIYQQon3YHbgS2O6ev79K+Wh46xEstclubfiZPxv7/zJsKPLAPCqW0BFCCCHKJ3T+Bix2z2cA+wfKngS8zP3/XWwYpxlCp4/0vDbbGqz/eiySEw1DfQAzJN+CLaD9UgkdIYQQYvgIHbBhKDA/7TmBspEJeQcWBYL2jOgAXIGlBlge+9yvB76F5QD6M+ZXOqCWSmVGFkIIIcopdH6JTXs/BBue+iqDc9TsjS2HADZk9UgThU61hIH/zul9foPlOToReBfmT4qEzUQsKWIflhTyC1neV0JHCCGEKKfQ2Yl5Vb4GHAxMBW6PlXtnrOy3YtubIXQeoDLtvQjudg+wta+mYcbjY93nm41Ff6YDT6VVpKErIYQQolzEhcoPsOUQYKgpORq2eojBCfTGDLP2WI0t73EclkQxWjj7JCx3DxI6QgghRPsQXyfqMeDn7v+3Avu4/48BjnT/f4fBQ1rDeR3L253YiXLvvIcqnh0JHSGEEKLcRKbksVSyDkfRnGewqE87Mwlb8f1pbDHRajwI3BQTdd0SOkIIIUT7soxKQr33AXtiK3YDXIut7l0GDsVmh52DGaWzsosTcWOpRKmqEV+TbJyEjhBCCNHeRFGdyZhf5bmJ7WXgTVh06QfUn+zviAxlRgMnx57/VUJHCCGEaG8WUEnKF5mSH6AyM6kMPD+HOt6PLWkxOrD/uVhixInu+UC1NtD0ciGEEMOZXbE8NB2xbYcBaxg8/FEPBwIHxZ5PADqpzArKygGBegaomIyfBBZiGYMjktGc0VgG4bjgeJl7Xsvw1hjg5a6d4m12VpXXHVtnO/4Rmz31Icxs/UPgi8B/YzOutrrPcCjwDirRrGewYbLt+poLIYQYibzKXQxDyxYsaKDugZR6axEVa1PqeTxR9sjYvn8kxNuLsZlIobpuq+GYNpC+3EOWx+Q62vTtmNE4S/1rqGJCjtDQlRBCiOHKWNJzyuzVQN175VRvLfXcR2V5hEXAlti+55CeKLCWYxrdovP1c2zW1ZuxKfMrgI1YxOZJbAmIRVhU5zCgX19xIYQQQgghhBBCCCGEEEIIIYQQQgghhBBCCCGEEEIIIYQQQgghhBBCCCGEEEIIIYQQQgghhBBCCCGEEEIIIYQQQgghhBBCCCGEEEIIIYQQQgghxDDg/wCvfdgEFdBqoQAAAABJRU5ErkJggg=="></a>
<sm-button id='login-button' variant='outlined' class='round'>Login</sm-button>
<div id='settings-button'
style="float: right; font-family: 'Roboto'; margin:1rem; cursor:pointer; display: none;">
<span style="padding-right: 0.5rem; font-weight:bold"><i class="fa fa-cog fa-2x"
aria-hidden="true"></i></span>
</div>
</nav>
<div id='homepage'>
<meta name="viewport" content="width=device-width">
<div class="head">
<div class="headerobjectswrapper" style='2px 10px'>
<svg viewBox="0 0 960 253" fill="none" class="rmtimeslogo_size" xmlns="http://www.w3.org/2000/svg">
<rect width="960" height="253" fill="" />
<g clip-path="url(#clip0)">
<path
d="M96.9 105.4C94.5 109 92.1 111.5 89.7 113.1C87.3 114.7 84.1 115.5 80.1 115.5C75.8 115.5 72.3 114.2 69.5 111.7C66.7 109.2 64.7 104.8 63.3 98.5L59.8 82.8C58.5 77.4 57.4 73.2 56.3 70.3C55.2 67.4 53.6 65 51.4 63.2C49.2 61.4 46.1 60.5 42.1 60.5H27.3V96.6C27.3 100.6 27.6 103.4 28.2 105.2C28.8 107 30 108.2 31.7 108.8C33.4 109.4 36.2 109.8 39.9 110.1V113.2C35.1 112.9 28.5 112.7 20 112.7C11 112.7 4.3 112.9 -0.0999985 113.2V110.1C3.7 109.9 6.4 109.5 8.1 108.8C9.8 108.2 11 107 11.6 105.2C12.2 103.4 12.5 100.5 12.5 96.6V18.8C12.5 14.8 12.2 12 11.6 10.2C11 8.40001 9.8 7.20001 8.1 6.60001C6.4 6.00001 3.8 5.50001 1.52737e-06 5.30001V2.20001C4.4 2.50001 10.8 2.70001 19.1 2.70001L36 2.50001C38 2.40001 40.2 2.30001 42.7 2.30001C54.8 2.30001 64.2 4.80001 70.7 9.90001C77.2 15 80.5 21.5 80.5 29.6C80.5 33.7 79.5 37.8 77.6 41.9C75.7 46 72.4 49.7 67.9 53C63.4 56.3 57.4 58.5 50.1 59.7L52 60C58.9 61.2 63.9 63.2 67.1 66.3C70.2 69.3 72.5 74.1 74 80.7L77.9 96.7C78.9 101.5 80 104.9 81.2 106.7C82.3 108.6 83.9 109.5 85.9 109.5C87.7 109.5 89.2 109 90.4 108.1C91.6 107.2 93 105.6 94.6 103.6L96.9 105.4ZM31.6 6.40001C30 7.10001 28.9 8.40001 28.2 10.3C27.6 12.2 27.3 15 27.3 18.8V57.4H37.8C48.2 57.4 55.3 55.1 59.1 50.5C63 45.9 64.9 39.5 64.9 31.4C64.9 22.8 62.9 16.3 58.8 12C54.7 7.60001 48.1 5.40001 38.9 5.40001C35.7 5.30001 33.2 5.70001 31.6 6.40001Z"
fill="black" />
<path
d="M197 110.1V113.2C192.8 112.9 187.2 112.7 180.2 112.7C171.2 112.7 164.5 112.9 160.1 113.2V110.1C164.1 109.9 166.9 109.4 168.6 108.6C170.3 107.8 171.2 106.4 171.2 104.3C171.2 102.5 170.6 100.1 169.3 96.9L159.7 71.2H121.7L115.3 87.8C113.2 93.4 112.2 97.7 112.2 100.7C112.2 103.9 113.3 106.3 115.6 107.8C117.8 109.3 121.3 110 125.9 110.2V113.3C119.9 113 113.9 112.8 107.9 112.8C103.2 112.8 99.3 113 96.1 113.3V110.2C101.3 108.9 105.5 104.4 108.5 96.6L145.4 1.60001H147.9L186.2 100.3C188.7 106.6 192.3 109.9 197 110.1ZM158.6 68.1L141 21.2L123.1 68.1H158.6Z"
fill="black" />
<path
d="M298 5.30001C294.3 5.50001 291.6 6.10001 289.8 6.90001C288 7.80001 286.8 9.30001 286.2 11.3C285.6 13.3 285.3 16.3 285.3 20.3V114H281.7L215.8 12.2V95C215.8 99.1 216.1 102.1 216.8 104.1C217.5 106.1 218.8 107.5 220.8 108.4C222.8 109.3 225.9 109.8 230.1 110V113.1C226.3 112.8 221 112.6 214.1 112.6C207.8 112.6 203 112.8 199.5 113.1V110C203.2 109.8 205.9 109.2 207.7 108.4C209.5 107.5 210.7 106 211.3 104C211.9 102 212.2 99 212.2 95V18.8C212.2 14.8 211.9 12 211.3 10.2C210.7 8.40001 209.5 7.20001 207.8 6.60001C206.1 6.00001 203.3 5.60001 199.6 5.30001V2.20001C203.1 2.50001 207.9 2.70001 214.2 2.70001C218.9 2.70001 223 2.50001 226.4 2.20001L281.8 87.5V20.4C281.8 16.3 281.5 13.3 280.8 11.3C280.1 9.30001 278.8 7.90001 276.8 7.00001C274.8 6.10001 271.7 5.60001 267.5 5.40001V2.20001C271.3 2.50001 276.6 2.70001 283.5 2.70001C289.8 2.70001 294.6 2.50001 298.1 2.20001V5.30001H298Z"
fill="black" />
<path
d="M366.5 2.70001C370.9 4.50001 375.2 7.00001 379.4 10.2C380.5 11.1 381.5 11.6 382.4 11.6C384.5 11.6 385.9 8.50001 386.5 2.20001H390.1C389.7 9.00001 389.5 21 389.5 38.3H385.9C384.7 31.5 383.7 26.6 382.8 23.6C381.9 20.6 380.3 17.8 378.1 15.1C375 11 371 8.00001 366.1 5.90001C361.2 3.90001 356 2.80001 350.3 2.80001C343.5 2.80001 337.6 5.00001 332.5 9.50001C327.4 14 323.5 20.4 320.7 28.7C317.9 37 316.5 46.8 316.5 58C316.5 69.4 318 79.2 321 87.3C324 95.5 328.2 101.7 333.6 105.9C339 110.1 345.1 112.3 351.9 112.3C357.1 112.3 362.2 111.3 367.1 109.3C372 107.3 375.9 104.3 378.7 100.4C380.8 97.5 382.3 94.3 383.2 91C384.1 87.7 385 82.5 385.9 75.6H389.5C389.5 93.6 389.7 106.1 390.1 113.2H386.5C386.2 109.9 385.7 107.5 385.2 106.1C384.6 104.7 383.8 104 382.8 104C382 104 380.9 104.4 379.5 105.3C374.8 108.6 370.3 111.2 366 112.9C361.7 114.6 356.5 115.5 350.5 115.5C340.6 115.5 331.9 113.3 324.4 108.8C316.9 104.3 311.1 97.8 307 89.3C302.9 80.8 300.8 70.6 300.8 58.8C300.8 47.3 302.9 37.1 307.2 28.2C311.4 19.3 317.3 12.4 324.9 7.50001C332.5 2.60001 341.1 0.100011 350.7 0.100011C356.8 1.13244e-05 362.1 0.900011 366.5 2.70001Z"
fill="black" />
<path
d="M496.9 6.60001C495.2 7.20001 494 8.40001 493.4 10.2C492.8 12 492.5 14.9 492.5 18.8V96.6C492.5 100.6 492.8 103.4 493.4 105.2C494 107 495.2 108.2 496.9 108.8C498.6 109.4 501.4 109.8 505.1 110.1V113.2C500.7 112.9 494 112.7 485 112.7C476.5 112.7 469.9 112.9 465.1 113.2V110.1C468.9 109.9 471.6 109.5 473.3 108.8C475 108.2 476.2 107 476.8 105.2C477.4 103.4 477.7 100.5 477.7 96.6V59H426.7V96.6C426.7 100.6 427 103.4 427.6 105.2C428.2 107 429.4 108.2 431.1 108.8C432.8 109.4 435.6 109.8 439.3 110.1V113.2C434.5 112.9 427.9 112.7 419.4 112.7C410.4 112.7 403.7 112.9 399.3 113.2V110.1C403.1 109.9 405.8 109.5 407.5 108.8C409.2 108.2 410.4 107 411 105.2C411.6 103.4 411.9 100.5 411.9 96.6V18.8C411.9 14.8 411.6 12 411 10.2C410.4 8.40001 409.2 7.20001 407.5 6.60001C405.8 6.00001 403 5.60001 399.3 5.30001V2.20001C403.7 2.50001 410.4 2.70001 419.4 2.70001C427.8 2.70001 434.4 2.50001 439.3 2.20001V5.30001C435.5 5.50001 432.8 5.90001 431.1 6.60001C429.4 7.30001 428.2 8.40001 427.6 10.2C427 12 426.7 14.9 426.7 18.8V55.8H477.7V18.8C477.7 14.8 477.4 12 476.8 10.2C476.2 8.40001 475 7.20001 473.3 6.60001C471.6 6.00001 468.8 5.60001 465.1 5.30001V2.20001C469.9 2.50001 476.5 2.70001 485 2.70001C494 2.70001 500.7 2.50001 505.1 2.20001V5.30001C501.4 5.50001 498.7 6.00001 496.9 6.60001Z"
fill="black" />
<path
d="M554 5.30001C550.2 5.50001 547.5 5.90001 545.8 6.60001C544.1 7.20001 542.9 8.40001 542.3 10.2C541.7 12 541.4 14.9 541.4 18.8V96.6C541.4 100.6 541.7 103.4 542.3 105.2C542.9 107 544.1 108.2 545.8 108.8C547.5 109.4 550.3 109.8 554 110.1V113.2C549.2 112.9 542.6 112.7 534.1 112.7C525.1 112.7 518.4 112.9 514 113.2V110.1C517.8 109.9 520.5 109.5 522.2 108.8C523.9 108.2 525.1 107 525.7 105.2C526.3 103.4 526.6 100.5 526.6 96.6V18.8C526.6 14.8 526.3 12 525.7 10.2C525.1 8.40001 523.9 7.20001 522.2 6.60001C520.5 6.00001 517.7 5.60001 514 5.30001V2.20001C518.4 2.50001 525.1 2.70001 534.1 2.70001C542.5 2.70001 549.1 2.50001 554 2.20001V5.30001Z"
fill="black" />
<path
d="M678 6.60001C676.3 7.20001 675.1 8.40001 674.5 10.2C673.9 12 673.6 14.9 673.6 18.8V96.6C673.6 100.6 673.9 103.4 674.5 105.2C675.1 107 676.3 108.2 678 108.8C679.7 109.4 682.5 109.8 686.2 110.1V113.2C681.4 112.9 674.8 112.7 666.3 112.7C657.3 112.7 650.6 112.9 646.2 113.2V110.1C650 109.9 652.7 109.5 654.4 108.8C656.1 108.2 657.3 107 657.9 105.2C658.5 103.4 658.8 100.5 658.8 96.6V12.5L621.1 114H618.6L579.1 12.2V95C579.1 99.1 579.4 102.1 580.1 104.1C580.8 106.1 582.1 107.5 584.1 108.4C586.1 109.3 589.2 109.8 593.4 110V113.1C589.6 112.8 584.3 112.6 577.4 112.6C571.1 112.6 566.3 112.8 562.8 113.1V110C566.5 109.8 569.2 109.2 571 108.4C572.8 107.5 574 106 574.6 104C575.2 102 575.5 99 575.5 95V18.8C575.5 14.8 575.2 12 574.6 10.2C574 8.40001 572.8 7.20001 571.1 6.60001C569.4 6.00001 566.6 5.60001 562.9 5.30001V2.20001C566.4 2.50001 571.2 2.70001 577.5 2.70001C582.9 2.70001 587.4 2.50001 590.8 2.20001L625.2 93L658.9 2.70001H666.3C674.8 2.70001 681.4 2.50001 686.2 2.20001V5.30001C682.5 5.50001 679.7 6.00001 678 6.60001Z"
fill="black" />
<path
d="M792.6 110.1V113.2C788.4 112.9 782.8 112.7 775.8 112.7C766.8 112.7 760.1 112.9 755.7 113.2V110.1C759.7 109.9 762.5 109.4 764.2 108.6C765.9 107.8 766.8 106.4 766.8 104.3C766.8 102.5 766.2 100.1 764.9 96.9L755.3 71.2H717.3L711 87.8C708.9 93.4 707.9 97.7 707.9 100.7C707.9 103.9 709 106.3 711.3 107.8C713.5 109.3 717 110 721.6 110.2V113.3C715.6 113 709.6 112.8 703.6 112.8C698.9 112.8 695 113 691.8 113.3V110.2C697 108.9 701.2 104.4 704.2 96.6L741.1 1.60001H743.6L781.9 100.3C784.3 106.6 787.9 109.9 792.6 110.1ZM754.1 68.1L736.5 21.2L718.6 68.1H754.1Z"
fill="black" />
<path
d="M835.1 5.30001C831.3 5.50001 828.6 5.90001 826.9 6.60001C825.2 7.20001 824 8.40001 823.4 10.2C822.8 12 822.5 14.9 822.5 18.8V96.6C822.5 100.6 822.8 103.4 823.4 105.2C824 107 825.2 108.2 826.9 108.7C828.6 109.3 831.4 109.6 835.1 109.6H846.5C853 109.6 857.9 108.7 861.3 106.9C864.7 105.1 867.2 102.1 868.8 98C870.4 93.9 871.5 88 872.3 80.3H875.9C875.6 83.5 875.4 87.8 875.4 93.2C875.4 99.2 875.8 105.9 876.5 113.3C869.4 113 857.4 112.8 840.6 112.8C820.5 112.8 805.4 113 795.1 113.3V110.2C798.9 110 801.6 109.6 803.3 108.9C805 108.3 806.2 107.1 806.8 105.3C807.4 103.5 807.7 100.6 807.7 96.7V18.8C807.7 14.8 807.4 12 806.8 10.2C806.2 8.40001 805 7.20001 803.3 6.60001C801.6 6.00001 798.8 5.60001 795.1 5.30001V2.20001C799.5 2.50001 806.2 2.70001 815.2 2.70001C823.6 2.70001 830.2 2.50001 835.1 2.20001V5.30001Z"
fill="black" />
<path
d="M918.6 5.30001C914.8 5.50001 912.1 5.90001 910.4 6.60001C908.7 7.20001 907.5 8.40001 906.9 10.2C906.3 12 906 14.9 906 18.8V96.6C906 100.6 906.3 103.4 906.9 105.2C907.5 107 908.7 108.2 910.4 108.7C912.1 109.3 914.9 109.6 918.6 109.6H930C936.5 109.6 941.4 108.7 944.8 106.9C948.2 105.1 950.7 102.1 952.3 98C953.9 93.9 955 88 955.8 80.3H959.4C959.1 83.5 958.9 87.8 958.9 93.2C958.9 99.2 959.3 105.9 960 113.3C952.9 113 940.9 112.8 924.1 112.8C904 112.8 888.9 113 878.6 113.3V110.2C882.4 110 885.1 109.6 886.8 108.9C888.5 108.3 889.7 107.1 890.3 105.3C890.9 103.5 891.2 100.6 891.2 96.7V18.8C891.2 14.8 890.9 12 890.3 10.2C889.7 8.40001 888.5 7.20001 886.8 6.60001C885.1 6.00001 882.3 5.60001 878.6 5.30001V2.20001C883 2.50001 889.7 2.70001 898.7 2.70001C907.1 2.70001 913.7 2.50001 918.6 2.20001V5.30001Z"
fill="black" />
<path
d="M402 142.6C398.2 142.8 395.5 143.2 393.8 143.9C392.1 144.5 390.9 145.7 390.3 147.5C389.7 149.3 389.4 152.2 389.4 156.1V233.9C389.4 237.9 389.7 240.7 390.3 242.5C390.9 244.3 392.1 245.5 393.8 246.1C395.5 246.7 398.3 247.1 402 247.4V250.5C397.2 250.2 390.6 250 382.1 250C373.1 250 366.4 250.2 362 250.5V247.4C365.8 247.2 368.5 246.8 370.2 246.1C371.9 245.5 373.1 244.3 373.7 242.5C374.3 240.7 374.6 237.8 374.6 233.9V156.1C374.6 152.1 374.3 149.3 373.7 147.5C373.1 145.7 371.9 144.5 370.2 143.9C368.5 143.3 365.7 142.9 362 142.6V139.5C366.4 139.8 373.1 140 382.1 140C390.5 140 397.1 139.8 402 139.5V142.6Z"
fill="black" />
<path
d="M526.1 143.8C524.4 144.4 523.2 145.6 522.6 147.4C522 149.2 521.7 152.1 521.7 156V233.8C521.7 237.8 522 240.6 522.6 242.4C523.2 244.2 524.4 245.4 526.1 246C527.8 246.6 530.6 247 534.3 247.3V250.4C529.5 250.1 522.9 249.9 514.4 249.9C505.4 249.9 498.7 250.1 494.3 250.4V247.3C498.1 247.1 500.8 246.7 502.5 246C504.2 245.4 505.4 244.2 506 242.4C506.6 240.6 506.9 237.7 506.9 233.8V149.7L469.1 251.2H466.6L427.1 149.4V232.2C427.1 236.3 427.4 239.3 428.1 241.3C428.8 243.3 430.1 244.7 432.1 245.6C434.1 246.5 437.2 247 441.4 247.2V250.3C437.6 250 432.3 249.8 425.4 249.8C419.1 249.8 414.3 250 410.8 250.3V247.2C414.5 247 417.2 246.4 419 245.6C420.8 244.7 422 243.2 422.6 241.2C423.2 239.2 423.5 236.2 423.5 232.2V156C423.5 152 423.2 149.2 422.6 147.4C422 145.6 420.8 144.4 419.1 143.8C417.4 143.2 414.6 142.8 410.9 142.5V139.4C414.4 139.7 419.2 139.9 425.5 139.9C430.9 139.9 435.4 139.7 438.8 139.4L473.3 230.2L507 139.9H514.4C522.9 139.9 529.5 139.7 534.3 139.4V142.5C530.5 142.8 527.8 143.2 526.1 143.8Z"
fill="black" />
<path
d="M624.5 250.5C617.4 250.2 605.4 250 588.6 250C568.5 250 553.4 250.2 543.1 250.5V247.4C546.9 247.2 549.6 246.8 551.3 246.1C553 245.5 554.2 244.3 554.8 242.5C555.4 240.7 555.7 237.8 555.7 233.9V156.1C555.7 152.1 555.4 149.3 554.8 147.5C554.2 145.7 553 144.5 551.3 143.9C549.6 143.3 546.8 142.9 543.1 142.6V139.5C553.3 139.8 568.5 140 588.6 140C604 140 614.9 139.8 621.4 139.5C620.7 146.4 620.3 152.6 620.3 158C620.3 162.1 620.5 165.3 620.8 167.7H617.2C616.5 160.9 615.5 155.9 614.4 152.6C613.2 149.3 611.3 146.9 608.6 145.4C605.9 143.9 601.8 143.1 596.2 143.1H583.2C579.4 143.1 576.7 143.4 575 144C573.3 144.6 572.1 145.8 571.5 147.5C570.9 149.3 570.6 152.2 570.6 156.1V193.1H581C584.7 193.1 587.5 192.2 589.5 190.5C591.5 188.8 592.8 186.7 593.5 184.4C594.2 182 594.7 179.1 595.1 175.5L595.6 172.4H599.2C598.9 176.8 598.7 181.7 598.7 187.1V194.6C598.7 199.9 599 207.4 599.6 216.9H596C595.9 216.2 595.6 213.6 595.1 209.3C594.6 205 593.1 201.7 590.8 199.5C588.4 197.3 585.2 196.2 581 196.2H570.6V233.8C570.6 237.8 570.9 240.6 571.5 242.4C572.1 244.2 573.3 245.4 575 245.9C576.7 246.5 579.5 246.8 583.2 246.8H594.7C601.2 246.8 606.1 245.9 609.5 244.2C612.9 242.5 615.4 239.7 617 235.9C618.6 232.1 619.7 226.5 620.5 219H624.1C623.8 221.8 623.6 225.6 623.6 230.3C623.4 236.4 623.8 243.1 624.5 250.5Z"
fill="black" />
<path
d="M850.4 195.2L847.6 196C845 189.7 840.1 186.5 832.9 186.5C829.6 186.5 826.5 187 823.6 188C820.7 189 817.1 190.6 812.9 192.7C808.4 194.9 804.7 196.5 801.6 197.5C798.5 198.5 795.2 199 791.6 199C785.6 199 780.5 197.4 776.1 194.3C772.6 191.8 770.3 188.5 769.2 184.7C768.5 182.4 767.3 180.3 765.5 178.8C762.9 176.7 759.5 175.6 755.3 175.6C752.1 175.6 748.9 176.1 746 177.1C743.1 178.1 739.5 179.7 735.2 181.7C730.8 183.9 727 185.5 723.9 186.5C720.8 187.5 717.5 188 713.9 188C707.9 188 702.8 186.4 698.4 183.3C694 180.2 691.3 175.8 690.7 170.6C690.1 162.1 687.6 155 683.4 149.2C679.2 143.4 673 140.5 665 140.5C659.4 140.5 654.7 142.2 651.2 145.6C647.7 149 645.9 153.4 645.9 158.7C645.9 162.7 646.8 166.1 648.7 169C650.5 171.9 652.8 174.4 655.7 176.5C658.5 178.6 662.5 181.2 667.8 184.5L672.4 187.3C679 191.4 684.2 194.9 688 198C691.8 201.1 694.9 204.6 697.2 208.6C699.5 212.6 700.6 217.2 700.6 222.6C700.6 232.1 697.5 239.5 691.2 244.6C684.9 249.8 677 252.4 667.4 252.4C662.4 252.4 658.3 251.9 655.1 250.8C651.9 249.8 648.9 248.3 645.9 246.6C643.6 245.1 641.8 244.4 640.6 244.4C639.7 244.4 638.9 244.9 638.4 246C638 246.9 637.6 248.2 637.3 249.9C637.2 250.7 636.5 251.3 635.7 251.3H635.1C634.2 251.3 633.5 250.6 633.5 249.6C633.8 243.5 634 232 634 215.2C634 214.3 634.7 213.6 635.6 213.6H636.2C637 213.6 637.7 214.2 637.8 215.1C638.7 225 641.2 233.1 645.5 239.4C650 246 656.9 249.3 666.2 249.3C671.8 249.3 676.7 247.5 680.6 244C684.6 240.5 686.5 235.3 686.5 228.4C686.5 222.5 684.5 217.6 680.6 213.5C676.7 209.4 670.5 204.8 662 199.7C655.8 195.9 650.8 192.6 647 189.7C643.2 186.8 640.1 183.2 637.7 179.1C635.3 175 634.1 170.1 634.1 164.6C634.1 155.8 636.9 149.1 642.6 144.4C648.2 139.7 655.3 137.4 663.6 137.4C668.2 137.4 671.8 137.9 674.5 138.9C677.2 139.9 679.9 141.3 682.7 143.2C685 144.7 686.8 145.4 688 145.4C688.9 145.4 689.7 144.9 690.2 143.8C690.6 142.9 691 141.6 691.3 139.9C691.4 139.1 692.1 138.6 692.9 138.6H693.4C694.3 138.6 695 139.4 695 140.3C694.6 146.4 694.4 156.2 694.3 169.6C694.3 170.3 694.4 170.9 694.7 171.5C697.3 177.1 701.6 179.4 708.4 179.4C711.6 179.4 714.8 178.9 717.7 177.9C720.6 176.9 724.2 175.3 728.5 173.3C732.9 171.1 736.7 169.5 739.8 168.5C742.9 167.5 746.2 167 749.8 167C755.8 167 760.9 168.6 765.3 171.7C768.5 174 770.7 176.9 771.9 180.3C773.7 185.4 777.7 189.4 783 190.2C784 190.3 785 190.4 786.1 190.4C789.4 190.4 792.5 189.9 795.4 188.9C798.3 187.9 801.9 186.3 806.2 184.3C810.6 182.1 814.4 180.5 817.5 179.5C820.6 178.5 823.9 178 827.5 178C833.5 178 838.7 179.6 843 182.7C847.2 185.8 849.7 190 850.4 195.2Z"
fill="black" />
<path
d="M352.9 139.4C344.2 139.7 329.5 139.9 308.8 139.9C288 139.9 273.2 139.7 264.6 139.4C265.3 146.8 265.7 153.5 265.7 159.5C265.7 164.6 265.5 168.8 265.2 172.2C265.2 172.3 265.2 172.5 265.1 172.6C262.5 178.7 258.5 181 251.4 181C248.2 181 245.1 180.5 242.1 179.5C239.2 178.5 235.6 176.9 231.4 174.9C227 172.7 223.2 171.1 220.1 170.1C217 169.1 213.7 168.6 210.1 168.6C204.1 168.6 199 170.2 194.7 173.3C190.9 176.1 189.1 179.8 187.5 184C185.5 189.6 180.2 192 173.6 192C170.4 192 167.3 191.5 164.3 190.5C161.4 189.5 157.8 187.9 153.6 185.9C149.2 183.7 145.4 182.1 142.3 181.1C139.2 180.1 135.9 179.6 132.3 179.6C126.3 179.6 121.2 181.2 116.9 184.3C112.6 187.4 110.1 191.6 109.4 196.8L112.2 197.6C114.8 191.3 119.7 188.2 126.8 188.2C130 188.2 133.1 188.7 136.1 189.7C139 190.7 142.6 192.3 146.8 194.3C151.2 196.5 155 198.1 158.1 199.1C161.2 200.1 164.5 200.6 168.1 200.6C174 200.6 179.2 199 183.5 195.9C187.3 193.1 189.1 189.4 190.7 185.2C192.7 179.6 198 177.2 204.6 177.2C207.8 177.2 210.9 177.7 213.9 178.7C216.8 179.7 220.4 181.3 224.6 183.3C229 185.5 232.8 187.1 235.9 188.1C239 189.1 242.3 189.6 245.9 189.6C251.8 189.6 257 188 261.3 184.9C265.6 181.8 268.1 177.6 268.8 172.4C269.6 164.3 270.7 158.4 271.9 154.4C273.2 150.5 275.4 147.6 278.5 145.8C281.6 144 286.4 143.1 292.9 143.1H301.4V232.3C301.4 236.7 301 239.9 300.1 241.9C299.3 243.9 297.8 245.2 295.7 246C293.6 246.7 290.2 247.2 285.5 247.4V250.5C290.5 250.2 298.3 250 308.7 250C318.6 250 326.3 250.2 331.8 250.5V247.4C327.1 247.2 323.7 246.7 321.6 246C319.5 245.3 318 243.9 317.2 241.9C316.4 239.9 315.9 236.7 315.9 232.3V143H324.4C330.9 143 335.7 143.9 338.8 145.7C341.9 147.5 344.1 150.4 345.4 154.3C346.7 158.2 347.7 164.2 348.5 172.3H352.1C351.8 169 351.6 164.7 351.6 159.4C351.8 153.6 352.1 146.9 352.9 139.4Z"
fill="black" />
</g>
<defs>
<clipPath id="clip0">
<rect width="960" height="252.7" fill="white" />
</clipPath>
</defs>
</svg>
</div>
<div id='current_date' class="subhead"></div>
</div>
<sm-popup id="login-popup">
<div id='main-login'>
<h2 style="margin-bottom: 2rem;">Sign In</h2>
<sm-input id='privateKey-input' placeholder="Private Key" animate></sm-input>
<p>Don't have a private key yet?<br>Try Guest login</p>
<div style="margin-top: 1rem; display:flex; justify-content: space-between;">
<sm-button id='signin-button'>Login</sm-button>
<sm-button id='guest-login-button'>Guest</sm-button>
</div>
</div>
<!--<div id='guest-login' style='display:none'>
<h2 style="margin-bottom: 0.5rem;">Guest Sign In</h2>
<p style='max-width:50ch; line-height: 1.7; margin-bottom:2rem'>
Losing your Private Key means losing all the data &amp; money attached to your
FLO ID. Private Key once lost can <strong>NEVER</strong> be recovered. Please store
it safely.
</p>
<sm-input id='gen-floid' disabled placeholder="Blockchain ID" animate readonly
style="margin-bottom: 1rem;"></sm-input>
<sm-input id='gen-privateKey' disabled placeholder="Private Key" animate readonly
style="margin-bottom: 1rem;"></sm-input>
<sm-button id='continue-login-button'>Continue</sm-button>
</div>-->
</sm-popup>
<div class="content">
<div id='loader_columnsmain'>
<svg class="spinner" viewBox="0 0 100 100" height="150px" width="150px"
style="display:block; margin:auto">
<clipPath id="clip4">
<path
d="M 50.027344 18.191406 A 31 31 0 0 0 19.029297 49.191406 A 31 31 0 0 0 50.029297 80.191406 A 31 31 0 0 0 67.878906 74.535156 L 67.154297 73.458984 A 29.700001 29.700001 0 0 1 50.029297 78.892578 A 29.700001 29.700001 0 0 1 20.330078 49.191406 A 29.700001 29.700001 0 0 1 50.029297 19.492188 A 29.700001 29.700001 0 0 1 79.730469 49.191406 A 29.700001 29.700001 0 0 1 77.251953 61.068359 L 78.425781 61.626953 A 31 31 0 0 0 81.029297 49.191406 A 31 31 0 0 0 50.029297 18.191406 A 31 31 0 0 1 50.027344 18.191406 z " />
<path
d="M 61.01817,78.089719 61.271147,78.975135 61.207903,80.30326 60.575462,81.821118 59.753289,82.95951 58.994361,83.465463 H 58.551653 L 58.108944,82.95951 57.982456,81.757874 58.298676,80.30326 58.867873,79.3546 59.373825,78.785403 59.753289,78.405939 60.38573,78.216207 Z" />
<path
d="M 54.728749,79.459955 54.78719,80.378945 54.442315,81.66307 53.500882,83.011246 52.454958,83.948236 51.605629,84.2808 51.173094,84.186438 50.8484,83.59775 50.980942,82.396767 51.59994,81.042981 52.35826,80.237442 52.973908,79.789167 53.425533,79.499304 54.083881,79.448734 Z" />
<path
d="M 48.558586,79.878573 48.388748,80.783622 47.738049,81.943151 46.493406,83.017739 45.248828,83.668072 44.343737,83.781069 43.947797,83.583023 43.778194,82.932474 44.202619,81.801196 45.136154,80.64171 46.069603,80.047896 46.776736,79.765168 47.285866,79.595543 47.936372,79.708777 Z" />
<path
d="M 61.791822,76.565856 61.604281,75.664309 60.930985,74.517754 59.665525,73.467762 58.408443,72.841942 57.50131,72.746702 57.109327,72.952468 56.952504,73.606216 57.399017,74.728961 58.355094,75.869931 59.3,76.445338 60.012537,76.714156 60.524894,76.873771 61.173056,76.747812 Z" />
<path
d="M 56.023933,78.335208 56.017199,77.414386 55.582323,76.157884 54.547853,74.879704 53.43825,74.019072 52.567516,73.747441 52.142742,73.872172 51.860518,74.48236 52.077711,75.670955 52.790952,76.977547 53.604372,77.727406 54.250196,78.130994 54.7212,78.388174 55.381477,78.392032 Z" />
<path
d="M 49.703044,78.909095 49.966492,78.026738 49.918985,76.697957 49.30457,75.172714 48.495941,74.024661 47.743059,73.509754 47.300382,73.504509 46.85171,74.005182 46.710997,75.205236 47.009963,76.663494 47.567882,77.61883 48.067056,78.19398 48.441998,78.577913 49.072147,78.775124 Z" />
<path
d="M 35.82007,76.507367 35.351528,77.300101 34.344144,78.16791 32.807473,78.75316 31.415667,78.939654 30.526358,78.736948 30.221788,78.415657 30.284409,77.746285 31.069466,76.8278 32.342688,76.056566 33.422758,75.817007 34.183927,75.792608 34.720378,75.806941 35.293174,76.135399 Z" />
<path
d="M 30.498712,72.885557 29.871969,73.560206 28.702764,74.193354 27.076662,74.43762 25.677087,74.32317 24.85142,73.935571 24.622332,73.556745 24.826188,72.916102 25.788975,72.186055 27.197324,71.703925 28.303636,71.700083 29.052514,71.838485 29.573583,71.966831 30.063206,72.409831 Z" />
<path
d="M 25.950027,68.695615 25.176353,69.195002 23.887175,69.520482 22.251028,69.356477 20.922824,68.900644 20.218144,68.321521 20.08948,67.897922 20.444928,67.327277 21.557933,66.857016 23.041662,66.736831 24.1148,67.005748 24.806473,67.324435 25.279842,67.577235 25.645191,68.127235 Z" />
<path
d="M 37.458248,76.020468 37.983515,75.264126 38.35241,73.986694 38.243835,72.345937 37.833186,71.003077 37.278227,70.279212 36.859222,70.136295 36.276881,70.47224 35.769246,71.568705 35.598949,73.047521 35.831418,74.129139 36.126529,74.831194 36.363175,75.312843 36.900503,75.696585 Z" />
<path
d="M 32.206032,73.051735 32.869677,72.413351 33.482391,71.23331 33.698335,69.603206 33.559559,68.205834 33.157655,67.387034 32.774902,67.164569 32.137903,67.379538 31.424713,68.354879 30.967153,69.771401 30.982557,70.877612 31.133963,71.623969 31.271353,72.142727 31.722803,72.624571 Z" />
<path
d="M 27.440967,68.859224 28.262573,68.443386 29.19424,67.494749 29.878473,65.999524 30.155351,64.622845 30.011081,63.722208 29.71034,63.397331 29.038309,63.416158 28.070575,64.139636 27.217937,65.359844 26.908441,66.421989 26.834447,67.179945 26.81376,67.716189 27.104158,68.309189 Z" />
<path
d="M 20.102362,56.940303 19.199074,57.119273 17.880713,56.946531 16.420288,56.190862 15.353706,55.277459 14.912177,54.479329 14.948747,54.038133 15.489543,53.638733 16.697521,53.611944 18.12104,54.047248 19.019438,54.692866 19.544893,55.244111 19.891713,55.653623 20.028551,56.299577 Z" />
<path
d="M 19.256372,50.559187 18.335695,50.541511 17.084447,50.091735 15.818651,49.042148 14.971265,47.922396 14.71,47.048496 14.83977,46.625235 15.453269,46.350282 16.639199,46.581583 17.937223,47.310299 18.677365,48.132572 19.073249,48.783147 19.324814,49.257173 19.320825,49.917449 Z" />
<path
d="M 19.348894,44.375531 18.460968,44.131509 17.359156,43.387246 16.391059,42.058087 15.845761,40.764039 15.80792,39.852708 16.037997,39.474481 16.700333,39.359199 17.792683,39.875627 18.871087,40.901755 19.38576,41.881068 19.609107,42.609139 19.736093,43.130542 19.569509,43.769471 Z" />
<path
d="M 21.557106,57.837197 22.471064,57.724772 23.669321,57.148493 24.820262,55.974096 25.547789,54.773009 25.717641,53.876845 25.544958,53.469204 24.9064,53.258911 23.750607,53.611149 22.534556,54.469705 21.883058,55.363847 21.556298,56.051742 21.354903,56.549162 21.426886,57.205514 Z" />
<path
d="M 20.27028,51.942857 21.188511,52.012214 22.476643,51.682623 23.83591,50.757278 24.785264,49.722563 25.127896,48.877244 25.038682,48.443619 24.453893,48.111953 23.251419,48.230214 21.890373,48.833081 21.075881,49.581776 20.620321,50.192053 20.325113,50.640202 20.266722,51.297903 Z" />
<path
d="M 20.220515,45.596164 21.078093,45.931603 22.406257,45.994027 23.977043,45.507711 25.187971,44.796685 25.763313,44.088912 25.80511,43.648182 25.343212,43.159682 24.158885,42.920316 22.680913,43.097796 21.682753,43.574888 21.068333,44.024843 20.65474,44.366787 20.406146,44.978492 Z" />
<path
d="M 22.921373,34.095278 22.158959,33.578862 21.354757,32.520007 20.865137,30.950246 20.764606,29.549605 21.02163,28.674448 21.361046,28.390217 22.025299,28.493893 22.893755,29.333959 23.585212,30.652209 23.757884,31.74497 23.735416,32.506199 23.688115,33.040752 23.325045,33.59226 Z" />
<path
d="M 26.863641,29.006775 26.228821,28.339721 25.668788,27.133783 25.525008,25.495736 25.725328,24.105852 26.162981,23.305588 26.55518,23.100235 27.18207,23.343112 27.851515,24.348982 28.246105,25.784318 28.18189,26.888773 27.997686,27.627719 27.837533,28.139907 27.365255,28.601355 Z" />
<path
d="M 31.32544,24.724426 30.874587,23.921499 30.629021,22.614741 30.893355,20.991781 31.430022,19.69413 32.051393,19.026407 32.482104,18.924042 33.029805,19.313917 33.430714,20.453741 33.459407,21.942052 33.12499,22.996618 32.764363,23.667378 32.482925,24.124301 31.911493,24.455127 Z" />
<path
d="M 23.306585,35.760303 24.029186,36.331098 25.281508,36.77787 26.925836,36.770423 28.291413,36.443151 29.048043,35.933769 29.216462,35.524347 28.916973,34.922445 27.853808,34.348328 26.388268,34.087391 25.294398,34.252889 24.575521,34.504259 24.080228,34.71083 23.664161,35.223536 Z" />
<path
d="M 26.592761,30.700639 27.189115,31.402295 28.329233,32.086433 29.942968,32.402237 31.34623,32.349676 32.188201,31.998897 32.433787,31.630553 32.258406,30.981536 31.328782,30.209703 29.943086,29.66588 28.838022,29.613211 28.083766,29.718422 27.557539,29.823644 27.048838,30.2446 Z" />
<path
d="M 31.070432,26.202478 31.434945,27.048108 32.32448,28.036361 33.774786,28.81127 35.131827,29.172302 36.039632,29.083704 36.382394,28.803516 36.404939,28.131598 35.742356,27.121197 34.576904,26.195118 33.535808,25.820875 32.783839,25.700399 32.249883,25.646767 31.640142,25.90014 Z" />
<path
d="M 40.49588,20.070372 40.262175,19.179674 40.354224,17.853234 41.019455,16.349457 41.866136,15.229175 42.635866,14.739811 43.07847,14.749416 43.510096,15.264857 43.610477,16.468955 43.262765,17.916364 42.673118,18.85245 42.154931,19.410533 41.767325,19.781674 41.130914,19.957637 Z" />
<path
d="M 46.813552,18.83694 46.775068,17.916899 47.147727,16.640557 48.118195,15.31313 49.184204,14.399056 50.040552,14.085 50.470937,14.188725 50.782778,14.784322 50.624207,15.982147 49.975979,17.322181 49.200356,18.111075 48.575125,18.545884 48.117317,18.825879 47.458026,18.862151 Z" />
<path
d="M 52.991347,18.552314 53.180785,17.651163 53.856494,16.506027 55.124161,15.458701 56.382559,14.835528 57.289888,14.742199 57.681437,14.94879 57.836884,15.602866 57.388009,16.724667 56.429533,17.863622 55.483417,18.43704 54.770317,18.704357 54.257626,18.862894 53.60973,18.73557 Z" />
<path
d="M 39.689341,21.577087 39.857275,22.482492 40.505531,23.643388 41.747909,24.720592 42.991115,25.373544 43.895966,25.488447 44.292322,25.291234 44.463295,24.641043 44.04125,23.508874 43.110158,22.347425 42.177961,21.751649 41.471425,21.467434 40.962652,21.296737 40.31191,21.4086 Z" />
<path
d="M 45.494267,19.933315 45.481018,20.854067 45.888525,22.11971 46.895014,23.420038 47.98568,24.304545 48.850315,24.595007 49.277695,24.479523 49.573093,23.875601 49.381746,22.682574 48.697025,21.360813 47.900069,20.593478 47.263155,20.175971 46.797842,19.908632 46.137804,19.890446 Z" />
<path
d="M 51.826122,19.496727 51.543587,20.37316 51.562249,21.702659 52.143421,23.240876 52.926947,24.406205 53.668477,24.937328 54.110937,24.952179 54.570369,24.46136 54.737089,23.264643 54.469837,21.80024 53.932782,20.833022 53.446207,20.247175 53.079684,19.855197 52.453962,19.644357 Z" />
<path
d="M 64.064587,21.383541 64.567323,20.612038 65.611667,19.789078 67.172445,19.271538 68.57107,19.146042 69.450672,19.387417 69.740912,19.721709 69.6491,20.387706 68.824656,21.271006 67.518948,21.985865 66.429442,22.178 65.667933,22.169112 65.132622,22.131352 64.574725,21.778176 Z" />
<path
d="M 69.222593,25.234425 69.878219,24.587809 71.073976,24.006357 72.709198,23.833385 74.102435,24.008882 74.910377,24.432194 75.122693,24.820667 74.891034,25.451789 73.897265,26.139069 72.469195,26.559196 71.36377,26.514689 70.621656,26.343693 70.106694,26.192701 69.636896,25.728728 Z" />
<path
d="M 73.58384,29.619137 74.378598,29.154035 75.680768,28.885202 77.308184,29.120546 78.615201,29.633984 79.2939,30.243347 79.403931,30.672164 79.023887,31.226732 77.891394,31.647906 76.403831,31.70314 75.343469,31.387584 74.666384,31.038977 74.204514,30.765734 73.863548,30.200294 Z" />
<path
d="M 62.406698,21.798387 61.848882,22.531055 61.424516,23.791145 61.46129,25.435079 61.812866,26.794602 62.335661,27.542026 62.748022,27.703116 63.344487,27.39294 63.89955,26.319704 64.134308,24.849744 63.949326,23.759 63.685174,23.04472 63.469802,22.553189 62.949756,22.146334 Z" />
<path
d="M 67.524167,24.993798 66.83326,25.602574 66.169565,26.754712 65.882592,28.373822 65.960173,29.775923 66.325913,30.611505 66.698579,30.850482 67.344365,30.663553 68.099495,29.720311 68.618517,28.325136 68.651468,27.219308 68.532821,26.467049 68.41823,25.942782 67.988268,25.44167 Z" />
<path
d="M 72.101474,29.390532 71.26248,29.770069 70.29025,30.677088 69.541331,32.140984 69.20456,33.504249 69.309335,34.410329 69.595592,34.748039 70.267804,34.758596 71.266227,34.078098 72.171372,32.896314 72.526988,31.84871 72.634034,31.094712 72.678133,30.559883 72.413925,29.954758 Z" />
<path
d="M 78.850319,38.376906 79.73285,38.114041 81.061601,38.162425 82.586438,38.777852 83.733953,39.58724 84.248361,40.340463 84.253316,40.783143 83.752345,41.231483 82.552198,41.371401 81.094139,41.071469 80.139172,40.512921 79.564352,40.013364 79.180668,39.638171 78.983874,39.007889 Z" />
<path
d="M 80.290812,44.650605 81.209092,44.58189 82.496996,44.912382 83.855614,45.838678 84.804246,46.874055 85.146288,47.719615 85.056771,48.153176 84.47175,48.484432 83.269358,48.365333 81.908735,47.761517 81.094764,47.012252 80.639633,46.401655 80.344736,45.953302 80.286806,45.29556 Z" />
<path
d="M 80.778415,50.815702 81.685307,50.975407 82.852041,51.613098 83.940483,52.845642 84.604696,54.08287 84.727807,54.98664 84.534203,55.384769 83.885592,55.561639 82.749637,55.149892 81.579783,54.229384 80.975567,53.302634 80.684947,52.598708 80.509639,52.091508 80.61559,51.439776 Z" />
<path
d="M 77.3179,37.620344 76.418505,37.817959 75.279553,38.504034 74.243782,39.781159 73.63206,41.045163 73.54697,41.953302 73.757109,42.34296 74.41257,42.492462 75.530251,42.033419 76.660456,41.064641 77.225259,40.113359 77.486089,39.397859 77.639966,38.883748 77.506765,38.237036 Z" />
<path
d="M 79.151652,43.368082 78.230962,43.385117 76.979402,43.834018 75.712871,44.882717 74.864704,46.001877 74.602829,46.875596 74.732303,47.298947 75.345611,47.574328 76.531702,47.343858 77.830234,46.616047 78.57095,45.794291 78.967289,45.143993 79.219184,44.670142 79.215657,44.009863 Z" />
<path
d="M 79.796198,49.682159 78.910949,49.428595 77.582783,49.490962 76.064507,50.122396 74.925571,50.943815 74.419117,51.702408 74.418822,52.145117 74.924483,52.588161 76.126034,52.715443 77.580858,52.400185 78.529894,51.831619 79.099426,51.326045 79.47914,50.94683 79.669292,50.314513 Z" />
</clipPath>
<path class="path" clip-path="url(#clip4)"
d="M 66.249976,61.659254 C 59.810751,70.633869 47.315358,72.689205 38.340746,66.249976 29.366131,59.810751 27.310795,47.315358 33.750024,38.340746 40.189249,29.366131 52.684642,27.310795 61.659254,33.750024 70.633869,40.189249 72.689205,52.684642 66.249976,61.659254" />
</svg>
</div>
<div class="columns hide" id='columnsmain'>
<!--
<div class="column" id="column1">
<div class="head"><span class="headline hl3">When darkness overspreads my eyes</span>
<p><span class="headline hl4">by JOHANN WOLFGANG VON GOETHE</span></p>
</div>
When, while the lovely valley teems with vapour around me, and the meridian sun strikes the upper
surface of the impenetrable foliage of my trees, and but a few stray gleams steal into the inner
sanctuary, I throw myself down among the tall grass by the trickling stream;
<p>and, as I lie close
to
the earth, a thousand unknown plants are noticed by me: when I hear the buzz of the little world
among the stalks, and grow familiar with the countless indescribable forms of the insects and
flies,
then I feel the presence of the Almighty, who formed us in his own image, and the breath of that
universal love which bears and sustains us, as it floats around us in an eternity of bliss; and
then, my friend, when darkness overspreads my eyes, and heaven and earth seem to dwell in my
soul
and absorb its power, like the form of a beloved mistress, then I often think with longing, Oh,
would I could describe these conceptions, could impress upon paper all that is living so full
and
warm within me, that it might be the mirror of my soul, as my soul is the mirror of the infinite
God!</p>
</div>
<div class="column" id="column2">
<div class="head"><span class="headline hl5">Give people courage</span>
<p><span class="headline hl6">The crowd seemed to grow</span></p>
</div>
The sunset faded to twilight before anything further happened. The crowd far away on the left,
towards
Woking, seemed to grow, and I heard now a faint murmur from it. The little knot of people towards
Chobham dispersed. There was scarcely an intimation of movement from the pit.<p></p>
<figure class="figure">
<img class="media" src="https://i.giphy.com/PW7MoTD2d9pJK.gif" alt="">
<figcaption class="figcaption">Hermine hoping for courage.</figcaption>
</figure>
<p>It was this, as much as anything, that gave people courage, and I suppose the new arrivals from
Woking also helped to restore confidence. At any rate, as the dusk came on a slow, intermittent
movement upon the sand pits began, a movement that seemed to gather force as the stillness of
the
evening about the cylinder remained unbroken. Vertical black figures in twos and threes would
advance, stop, watch, and advance again, spreading out as they did so in a thin irregular
crescent
that promised to enclose the pit in its attenuated horns. I, too, on my side began to move
towards
the pit.</p>
<p>Then I saw some cabmen and others had walked boldly into the sand pits, and heard the clatter of
hoofs and the gride of wheels. I saw a lad trundling off the barrow of apples. And then, within
thirty yards of the pit, advancing from the direction of Horsell, I noted a little black knot of
men, the foremost of whom was waving a white flag.</p>
</div>
<div class="column" id="column3">
<div class="head"><span class="headline hl1">May the Force be with you</span>
<p><span class="headline hl2">Let go your conscious self and act on instinct</span></p>
</div>Partially, but it also obeys your commands. Hey, Luke! May the Force be with you. I have
traced
the Rebel spies to her. Now she is my only link to finding their secret base.<p></p>
<figure class="figure">
<img class="media" src="https://i.giphy.com/4fDWVPMoSyhgc.gif" alt="">
<figcaption class="figcaption">"This time, let go your conscious self and act on instinct."
</figcaption>
</figure>
<p>Leave that to me. Send a distress signal, and inform the Senate that all on board were killed.
<span class="citation">"Don't under­estimate the Force. I suggest you try it again,
Luke."</span> This
time, let go your conscious self and act on instinct. In my experience, there is no such thing
as
luck. You're all clear, kid. Let's blow this thing and go home!</p>
<p>You don't believe in the Force, do you? Partially, but it also obeys your commands. The plans you
refer to will soon be back in our hands. As you wish.</p>
</div>
<div class="column" id="column4">
<div class="head"><span class="headline hl3">The buzz of the little world </span>
<p><span class="headline hl4">A thousand unknown plants</span></p>
</div>
<p>I should be incapable of drawing a single stroke at the present moment; and yet I feel that I
never
was a greater artist than now. When, while the lovely valley teems with vapour around me, and
the
meridian sun strikes the upper surface of the impenetrable foliage of my trees, and but a few
stray
gleams steal into the inner sanctuary, I throw myself down among the tall grass by the trickling
stream; and, as I lie close to the earth, a thousand unknown plants are noticed by me: when I
hear
the buzz of the little world among the stalks, and grow familiar with the countless
indescribable
forms of the insects and flies, then I feel the presence of the Almighty, who formed us in his
own
image, and the breath</p>
</div>
<div class="column" id="column5">
<div class="head"><span class="headline hl1">It wasn't a dream </span>
<p><span class="headline hl4">by FRANZ KAFKA</span></p>
</div>
<p>One morning, when Gregor Samsa woke from troubled dreams, he found himself transformed in his bed
into a horrible vermin. He lay on his armour-like back, and if he lifted his head a little he
could
see his brown belly, slightly domed and divided by arches into stiff sections. The bedding was
hardly able to cover it and seemed ready to slide off any moment. </p>
<p>His many legs, pitifully thin compared with the size of the rest of him, waved about helplessly
as he
looked. "What's happened to me?" he thought. It wasn't a dream. His room, a proper human room
although a little too small, lay peacefully between its four familiar walls. A collection of
textile
samples lay spread out on the table - Samsa was a travelling salesman - and above it there hung
a
picture that he had recently cut out of an illustrated magazine and housed in a nice, gilded
frame.
It showed a lady fitted out with a fur hat and fur boa who sat upright, raising a heavy fur muff
that covered the whole of her lower arm towards the viewer. Gregor then turned to look out the
window at the dull weather. </p>
</div>
-->
</div>
</div>
</div>
<div id="settings-page" class='hide' style='margin:2rem'>
<h2>Settings</h2>
<p style='max-width:50ch; line-height: 1.7; margin-bottom:2rem'>
Losing your Private Key means losing all the data &amp; money attached to your
FLO ID. Private Key once lost can <strong>NEVER</strong> be recovered. Please store
it safely.
</p>
<div style="display:flex; flex-direction: column; max-width: 37rem">
<sm-input id='gen-floid' disabled placeholder="Blockchain ID" animate readonly
style="margin-bottom: 1rem; display:flex"></sm-input>
<sm-input id='gen-privateKey' disabled placeholder="Private Key" animate readonly
style="margin-bottom: 1rem; display:flex">
</sm-input>
</div>
<sm-button id='logout-button' style="margin-top:2rem">Logout</sm-button>
</div>
<div id="display_page_main" class="hide">
<div id="go_back" style="color:#DC143C">
<i class="fa fa-angle-double-left" aria-hidden="true" style="color:#DC143C"></i>
Go Back
</div>
<div id="displaypage">
</div>
<div id="go_back_bottom" style="color:#DC143C">
<i class="fa fa-angle-double-left" aria-hidden="true" style="color:#DC143C"></i>
Go Back
</div>
</div>
</body>
<script id="floGlobals">
/* Constants for FLO blockchain operations !!Make sure to add this at begining!! */
const floGlobals = {
//Required for all
blockchain: "FLO",
//Required for blockchain API operators
apiURL: {
FLO: ['https://explorer.mediciland.com/', 'https://livenet.flocha.in/', 'https://flosight.duckdns.org/',
'http://livenet-explorer.floexperiments.com/'
],
FLO_TEST: ['https://testnet-flosight.duckdns.org/', 'https://testnet.flocha.in/']
},
adminID: "F9Cs1wF7BS8fDj1gmCsuQ3kpBWRwQj7B2o",
sendAmt: 0.001,
fee: 0.0005,
//Required for Supernode operations
SNStorageID: "FEzk75EGMPEQMrCuPosGiwuK162hcEu49E",
supernodes: {}, //each supnernode must be stored as floID : {uri:<uri>,pubKey:<publicKey>}
//for cloud apps
subAdmins: [],
webAppURL: "ranchimalltimes-webappserver.duckdns.org",
application: "TestApp",
vectorClock: {},
appObjects: {},
generalData: {},
generalVC: {}
}
</script>
<script id="init_lib">
//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 = [];
}
Event.prototype.registerCallback = function (callback) {
this.callbacks.push(callback);
};
function Reactor() {
this.events = {};
}
Reactor.prototype.registerEvent = function (eventName) {
var event = new Event(eventName);
this.events[eventName] = event;
};
Reactor.prototype.dispatchEvent = function (eventName, eventArgs) {
this.events[eventName].callbacks.forEach(function (callback) {
callback(eventArgs);
});
};
Reactor.prototype.addEventListener = function (eventName, callback) {
this.events[eventName].registerCallback(callback);
};
window.reactor = new Reactor();
})();
}
/* Sample Usage
--Creating and defining the event--
reactor.registerEvent('<eventName>');
reactor.addEventListener('<eventName>', function(someObject){
do something...
});
--Firing the event--
reactor.dispatchEvent('<eventName>',<someObject>);
*/
/*!
* Crypto-JS v2.5.4 Crypto.js
* http://code.google.com/p/crypto-js/
* Copyright (c) 2009-2013, Jeff Mott. All rights reserved.
* http://code.google.com/p/crypto-js/wiki/License
*/
if (typeof Crypto == "undefined" || !Crypto.util) {
(function () {
var base64map = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
// Global Crypto object
var Crypto = window.Crypto = {};
// Crypto utilities
var util = Crypto.util = {
// Bit-wise rotate left
rotl: function (n, b) {
return (n << b) | (n >>> (32 - b));
},
// Bit-wise rotate right
rotr: function (n, b) {
return (n << (32 - b)) | (n >>> b);
},
// Swap big-endian to little-endian and vice versa
endian: function (n) {
// If number given, swap endian
if (n.constructor == Number) {
return util.rotl(n, 8) & 0x00FF00FF |
util.rotl(n, 24) & 0xFF00FF00;
}
// Else, assume array and swap all items
for (var i = 0; i < n.length; i++)
n[i] = util.endian(n[i]);
return n;
},
// Generate an array of any length of random bytes
randomBytes: function (n) {
for (var bytes = []; n > 0; n--)
bytes.push(Math.floor(Math.random() * 256));
return bytes;
},
// Convert a byte array to big-endian 32-bit words
bytesToWords: function (bytes) {
for (var words = [], i = 0, b = 0; i < bytes.length; i++, b += 8)
words[b >>> 5] |= (bytes[i] & 0xFF) << (24 - b % 32);
return words;
},
// Convert big-endian 32-bit words to a byte array
wordsToBytes: function (words) {
for (var bytes = [], b = 0; b < words.length * 32; b += 8)
bytes.push((words[b >>> 5] >>> (24 - b % 32)) & 0xFF);
return bytes;
},
// Convert a byte array to a hex string
bytesToHex: function (bytes) {
for (var hex = [], i = 0; i < bytes.length; i++) {
hex.push((bytes[i] >>> 4).toString(16));
hex.push((bytes[i] & 0xF).toString(16));
}
return hex.join("");
},
// Convert a hex string to a byte array
hexToBytes: function (hex) {
for (var bytes = [], c = 0; c < hex.length; c += 2)
bytes.push(parseInt(hex.substr(c, 2), 16));
return bytes;
},
// Convert a byte array to a base-64 string
bytesToBase64: function (bytes) {
for (var base64 = [], i = 0; i < bytes.length; i += 3) {
var triplet = (bytes[i] << 16) | (bytes[i + 1] << 8) | bytes[i + 2];
for (var j = 0; j < 4; j++) {
if (i * 8 + j * 6 <= bytes.length * 8)
base64.push(base64map.charAt((triplet >>> 6 * (3 - j)) & 0x3F));
else base64.push("=");
}
}
return base64.join("");
},
// Convert a base-64 string to a byte array
base64ToBytes: function (base64) {
// Remove non-base-64 characters
base64 = base64.replace(/[^A-Z0-9+\/]/ig, "");
for (var bytes = [], i = 0, imod4 = 0; i < base64.length; imod4 = ++i % 4) {
if (imod4 == 0) continue;
bytes.push(((base64map.indexOf(base64.charAt(i - 1)) & (Math.pow(2, -2 * imod4 +
8) - 1)) << (imod4 * 2)) |
(base64map.indexOf(base64.charAt(i)) >>> (6 - imod4 * 2)));
}
return bytes;
}
};
// Crypto character encodings
var charenc = Crypto.charenc = {};
// UTF-8 encoding
var UTF8 = charenc.UTF8 = {
// Convert a string to a byte array
stringToBytes: function (str) {
return Binary.stringToBytes(unescape(encodeURIComponent(str)));
},
// Convert a byte array to a string
bytesToString: function (bytes) {
return decodeURIComponent(escape(Binary.bytesToString(bytes)));
}
};
// Binary encoding
var Binary = charenc.Binary = {
// Convert a string to a byte array
stringToBytes: function (str) {
for (var bytes = [], i = 0; i < str.length; i++)
bytes.push(str.charCodeAt(i) & 0xFF);
return bytes;
},
// Convert a byte array to a string
bytesToString: function (bytes) {
for (var str = [], i = 0; i < bytes.length; i++)
str.push(String.fromCharCode(bytes[i]));
return str.join("");
}
};
})();
}
//Adding SHA1 to fix basic PKBDF2
/*
* Crypto-JS v2.5.4
* http://code.google.com/p/crypto-js/
* (c) 2009-2012 by Jeff Mott. All rights reserved.
* http://code.google.com/p/crypto-js/wiki/License
*/
(function () {
// Shortcuts
var C = Crypto,
util = C.util,
charenc = C.charenc,
UTF8 = charenc.UTF8,
Binary = charenc.Binary;
// Public API
var SHA1 = C.SHA1 = function (message, options) {
var digestbytes = util.wordsToBytes(SHA1._sha1(message));
return options && options.asBytes ? digestbytes :
options && options.asString ? Binary.bytesToString(digestbytes) :
util.bytesToHex(digestbytes);
};
// The core
SHA1._sha1 = function (message) {
// Convert to byte array
if (message.constructor == String) message = UTF8.stringToBytes(message);
/* else, assume byte array already */
var m = util.bytesToWords(message),
l = message.length * 8,
w = [],
H0 = 1732584193,
H1 = -271733879,
H2 = -1732584194,
H3 = 271733878,
H4 = -1009589776;
// Padding
m[l >> 5] |= 0x80 << (24 - l % 32);
m[((l + 64 >>> 9) << 4) + 15] = l;
for (var i = 0; i < m.length; i += 16) {
var a = H0,
b = H1,
c = H2,
d = H3,
e = H4;
for (var j = 0; j < 80; j++) {
if (j < 16) w[j] = m[i + j];
else {
var n = w[j - 3] ^ w[j - 8] ^ w[j - 14] ^ w[j - 16];
w[j] = (n << 1) | (n >>> 31);
}
var t = ((H0 << 5) | (H0 >>> 27)) + H4 + (w[j] >>> 0) + (
j < 20 ? (H1 & H2 | ~H1 & H3) + 1518500249 :
j < 40 ? (H1 ^ H2 ^ H3) + 1859775393 :
j < 60 ? (H1 & H2 | H1 & H3 | H2 & H3) - 1894007588 :
(H1 ^ H2 ^ H3) - 899497514);
H4 = H3;
H3 = H2;
H2 = (H1 << 30) | (H1 >>> 2);
H1 = H0;
H0 = t;
}
H0 += a;
H1 += b;
H2 += c;
H3 += d;
H4 += e;
}
return [H0, H1, H2, H3, H4];
};
// Package private blocksize
SHA1._blocksize = 16;
SHA1._digestsize = 20;
})();
//Added to make PKBDF2 work
/*
* Crypto-JS v2.5.4
* http://code.google.com/p/crypto-js/
* (c) 2009-2012 by Jeff Mott. All rights reserved.
* http://code.google.com/p/crypto-js/wiki/License
*/
(function () {
// Shortcuts
var C = Crypto,
util = C.util,
charenc = C.charenc,
UTF8 = charenc.UTF8,
Binary = charenc.Binary;
C.HMAC = function (hasher, message, key, options) {
// Convert to byte arrays
if (message.constructor == String) message = UTF8.stringToBytes(message);
if (key.constructor == String) key = UTF8.stringToBytes(key);
/* else, assume byte arrays already */
// Allow arbitrary length keys
if (key.length > hasher._blocksize * 4)
key = hasher(key, {
asBytes: true
});
// XOR keys with pad constants
var okey = key.slice(0),
ikey = key.slice(0);
for (var i = 0; i < hasher._blocksize * 4; i++) {
okey[i] ^= 0x5C;
ikey[i] ^= 0x36;
}
var hmacbytes = hasher(okey.concat(hasher(ikey.concat(message), {
asBytes: true
})), {
asBytes: true
});
return options && options.asBytes ? hmacbytes :
options && options.asString ? Binary.bytesToString(hmacbytes) :
util.bytesToHex(hmacbytes);
};
})();
//crypto-sha256-hmac.js
/*
* Crypto-JS v2.5.4
* http://code.google.com/p/crypto-js/
* (c) 2009-2012 by Jeff Mott. All rights reserved.
* http://code.google.com/p/crypto-js/wiki/License
*/
function ascii_to_hexa(str) {
var arr1 = [];
for (var n = 0, l = str.length; n < l; n++) {
var hex = Number(str.charCodeAt(n)).toString(16);
arr1.push(hex);
}
return arr1.join('');
}
(typeof Crypto == "undefined" || !Crypto.util) && function () {
var d = window.Crypto = {},
k = d.util = {
rotl: function (b, a) {
return b << a | b >>> 32 - a
},
rotr: function (b, a) {
return b << 32 - a | b >>> a
},
endian: function (b) {
if (b.constructor == Number) return k.rotl(b, 8) & 16711935 | k.rotl(b, 24) & 4278255360;
for (var a = 0; a < b.length; a++) b[a] = k.endian(b[a]);
return b
},
randomBytes: function (b) {
for (var a = []; b > 0; b--) a.push(Math.floor(Math.random() * 256));
return a
},
bytesToWords: function (b) {
for (var a = [], c = 0, e = 0; c < b.length; c++, e += 8) a[e >>> 5] |= (b[c] & 255) <<
24 - e % 32;
return a
},
wordsToBytes: function (b) {
for (var a = [], c = 0; c < b.length * 32; c += 8) a.push(b[c >>> 5] >>> 24 - c % 32 & 255);
return a
},
bytesToHex: function (b) {
for (var a = [], c = 0; c < b.length; c++) a.push((b[c] >>> 4).toString(16)), a.push((b[c] &
15).toString(16));
return a.join("")
},
hexToBytes: function (b) {
for (var a = [], c = 0; c < b.length; c += 2) a.push(parseInt(b.substr(c, 2), 16));
return a
},
bytesToBase64: function (b) {
for (var a = [], c = 0; c < b.length; c += 3)
for (var e = b[c] << 16 | b[c + 1] << 8 | b[c + 2], p = 0; p < 4; p++) c * 8 + p * 6 <=
b.length * 8 ? a.push(
"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/".charAt(e >>>
6 * (3 - p) & 63)) : a.push("=");
return a.join("")
},
base64ToBytes: function (b) {
for (var b = b.replace(/[^A-Z0-9+\/]/ig, ""), a = [], c = 0, e = 0; c < b.length; e = ++c %
4) e != 0 && a.push(("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/"
.indexOf(b.charAt(c - 1)) & Math.pow(2, -2 * e + 8) - 1) << e * 2 |
"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/".indexOf(b.charAt(
c)) >>> 6 - e * 2);
return a
}
},
d = d.charenc = {};
d.UTF8 = {
stringToBytes: function (b) {
return g.stringToBytes(unescape(encodeURIComponent(b)))
},
bytesToString: function (b) {
return decodeURIComponent(escape(g.bytesToString(b)))
}
};
var g = d.Binary = {
stringToBytes: function (b) {
for (var a = [], c = 0; c < b.length; c++) a.push(b.charCodeAt(c) & 255);
return a
},
bytesToString: function (b) {
for (var a = [], c = 0; c < b.length; c++) a.push(String.fromCharCode(b[c]));
return a.join("")
}
}
}();
(function () {
var d = Crypto,
k = d.util,
g = d.charenc,
b = g.UTF8,
a = g.Binary,
c = [1116352408, 1899447441, 3049323471, 3921009573, 961987163, 1508970993, 2453635748, 2870763221,
3624381080, 310598401, 607225278, 1426881987, 1925078388, 2162078206, 2614888103, 3248222580,
3835390401, 4022224774, 264347078, 604807628, 770255983, 1249150122, 1555081692, 1996064986,
2554220882, 2821834349, 2952996808, 3210313671, 3336571891, 3584528711, 113926993, 338241895,
666307205, 773529912, 1294757372, 1396182291, 1695183700, 1986661051, 2177026350, 2456956037,
2730485921,
2820302411, 3259730800, 3345764771, 3516065817, 3600352804, 4094571909, 275423344, 430227734,
506948616, 659060556, 883997877, 958139571, 1322822218, 1537002063, 1747873779, 1955562222,
2024104815, 2227730452, 2361852424, 2428436474, 2756734187, 3204031479, 3329325298
],
e = d.SHA256 = function (b, c) {
var f = k.wordsToBytes(e._sha256(b));
return c && c.asBytes ? f : c && c.asString ? a.bytesToString(f) : k.bytesToHex(f)
};
e._sha256 = function (a) {
a.constructor == String && (a = b.stringToBytes(a));
var e = k.bytesToWords(a),
f = a.length * 8,
a = [1779033703, 3144134277,
1013904242, 2773480762, 1359893119, 2600822924, 528734635, 1541459225
],
d = [],
g, m, r, i, n, o, s, t, h, l, j;
e[f >> 5] |= 128 << 24 - f % 32;
e[(f + 64 >> 9 << 4) + 15] = f;
for (t = 0; t < e.length; t += 16) {
f = a[0];
g = a[1];
m = a[2];
r = a[3];
i = a[4];
n = a[5];
o = a[6];
s = a[7];
for (h = 0; h < 64; h++) {
h < 16 ? d[h] = e[h + t] : (l = d[h - 15], j = d[h - 2], d[h] = ((l << 25 | l >>> 7) ^
(l << 14 | l >>> 18) ^ l >>> 3) + (d[h - 7] >>> 0) + ((j << 15 | j >>> 17) ^
(j << 13 | j >>> 19) ^ j >>> 10) + (d[h - 16] >>> 0));
j = f & g ^ f & m ^ g & m;
var u = (f << 30 | f >>> 2) ^ (f << 19 | f >>> 13) ^ (f << 10 | f >>> 22);
l = (s >>> 0) + ((i << 26 | i >>> 6) ^ (i << 21 | i >>> 11) ^ (i << 7 | i >>> 25)) +
(i & n ^ ~i & o) + c[h] + (d[h] >>> 0);
j = u + j;
s = o;
o = n;
n = i;
i = r + l >>> 0;
r = m;
m = g;
g = f;
f = l + j >>> 0
}
a[0] += f;
a[1] += g;
a[2] += m;
a[3] += r;
a[4] += i;
a[5] += n;
a[6] += o;
a[7] += s
}
return a
};
e._blocksize = 16;
e._digestsize = 32
})();
(function () {
var d = Crypto,
k = d.util,
g = d.charenc,
b = g.UTF8,
a = g.Binary;
d.HMAC = function (c, e, d, g) {
e.constructor == String && (e = b.stringToBytes(e));
d.constructor == String && (d = b.stringToBytes(d));
d.length > c._blocksize * 4 && (d = c(d, {
asBytes: !0
}));
for (var f = d.slice(0), d = d.slice(0), q = 0; q < c._blocksize * 4; q++) f[q] ^= 92, d[q] ^=
54;
c = c(f.concat(c(d.concat(e), {
asBytes: !0
})), {
asBytes: !0
});
return g && g.asBytes ? c : g && g.asString ? a.bytesToString(c) : k.bytesToHex(c)
}
})();
/*!
* Random number generator with ArcFour PRNG
*
* NOTE: For best results, put code like
* <body onclick='SecureRandom.seedTime();' onkeypress='SecureRandom.seedTime();'>
* in your main HTML document.
*
* Copyright Tom Wu, bitaddress.org BSD License.
* http://www-cs-students.stanford.edu/~tjw/jsbn/LICENSE
*/
(function () {
// Constructor function of Global SecureRandom object
var sr = window.SecureRandom = function () {};
// Properties
sr.state;
sr.pool;
sr.pptr;
sr.poolCopyOnInit;
// Pool size must be a multiple of 4 and greater than 32.
// An array of bytes the size of the pool will be passed to init()
sr.poolSize = 256;
// --- object methods ---
// public method
// ba: byte array
sr.prototype.nextBytes = function (ba) {
var i;
if (window.crypto && window.crypto.getRandomValues && window.Uint8Array) {
try {
var rvBytes = new Uint8Array(ba.length);
window.crypto.getRandomValues(rvBytes);
for (i = 0; i < ba.length; ++i)
ba[i] = sr.getByte() ^ rvBytes[i];
return;
} catch (e) {
alert(e);
}
}
for (i = 0; i < ba.length; ++i) ba[i] = sr.getByte();
};
// --- static methods ---
// Mix in the current time (w/milliseconds) into the pool
// NOTE: this method should be called from body click/keypress event handlers to increase entropy
sr.seedTime = function () {
sr.seedInt(new Date().getTime());
}
sr.getByte = function () {
if (sr.state == null) {
sr.seedTime();
sr.state = sr.ArcFour(); // Plug in your RNG constructor here
sr.state.init(sr.pool);
sr.poolCopyOnInit = [];
for (sr.pptr = 0; sr.pptr < sr.pool.length; ++sr.pptr)
sr.poolCopyOnInit[sr.pptr] = sr.pool[sr.pptr];
sr.pptr = 0;
}
// TODO: allow reseeding after first request
return sr.state.next();
}
// Mix in a 32-bit integer into the pool
sr.seedInt = function (x) {
sr.seedInt8(x);
sr.seedInt8((x >> 8));
sr.seedInt8((x >> 16));
sr.seedInt8((x >> 24));
}
// Mix in a 16-bit integer into the pool
sr.seedInt16 = function (x) {
sr.seedInt8(x);
sr.seedInt8((x >> 8));
}
// Mix in a 8-bit integer into the pool
sr.seedInt8 = function (x) {
sr.pool[sr.pptr++] ^= x & 255;
if (sr.pptr >= sr.poolSize) sr.pptr -= sr.poolSize;
}
// Arcfour is a PRNG
sr.ArcFour = function () {
function Arcfour() {
this.i = 0;
this.j = 0;
this.S = new Array();
}
// Initialize arcfour context from key, an array of ints, each from [0..255]
function ARC4init(key) {
var i, j, t;
for (i = 0; i < 256; ++i)
this.S[i] = i;
j = 0;
for (i = 0; i < 256; ++i) {
j = (j + this.S[i] + key[i % key.length]) & 255;
t = this.S[i];
this.S[i] = this.S[j];
this.S[j] = t;
}
this.i = 0;
this.j = 0;
}
function ARC4next() {
var t;
this.i = (this.i + 1) & 255;
this.j = (this.j + this.S[this.i]) & 255;
t = this.S[this.i];
this.S[this.i] = this.S[this.j];
this.S[this.j] = t;
return this.S[(t + this.S[this.i]) & 255];
}
Arcfour.prototype.init = ARC4init;
Arcfour.prototype.next = ARC4next;
return new Arcfour();
};
// Initialize the pool with junk if needed.
if (sr.pool == null) {
sr.pool = new Array();
sr.pptr = 0;
var t;
if (window.crypto && window.crypto.getRandomValues && window.Uint8Array) {
try {
// Use webcrypto if available
var ua = new Uint8Array(sr.poolSize);
window.crypto.getRandomValues(ua);
for (t = 0; t < sr.poolSize; ++t)
sr.pool[sr.pptr++] = ua[t];
} catch (e) {
alert(e);
}
}
while (sr.pptr < sr.poolSize) { // extract some randomness from Math.random()
t = Math.floor(65536 * Math.random());
sr.pool[sr.pptr++] = t >>> 8;
sr.pool[sr.pptr++] = t & 255;
}
sr.pptr = Math.floor(sr.poolSize * Math.random());
sr.seedTime();
// entropy
var entropyStr = "";
// screen size and color depth: ~4.8 to ~5.4 bits
entropyStr += (window.screen.height * window.screen.width * window.screen.colorDepth);
entropyStr += (window.screen.availHeight * window.screen.availWidth * window.screen.pixelDepth);
// time zone offset: ~4 bits
var dateObj = new Date();
var timeZoneOffset = dateObj.getTimezoneOffset();
entropyStr += timeZoneOffset;
// user agent: ~8.3 to ~11.6 bits
entropyStr += navigator.userAgent;
// browser plugin details: ~16.2 to ~21.8 bits
var pluginsStr = "";
for (var i = 0; i < navigator.plugins.length; i++) {
pluginsStr += navigator.plugins[i].name + " " + navigator.plugins[i].filename + " " + navigator
.plugins[i].description + " " + navigator.plugins[i].version + ", ";
}
var mimeTypesStr = "";
for (var i = 0; i < navigator.mimeTypes.length; i++) {
mimeTypesStr += navigator.mimeTypes[i].description + " " + navigator.mimeTypes[i].type + " " +
navigator.mimeTypes[i].suffixes + ", ";
}
entropyStr += pluginsStr + mimeTypesStr;
// cookies and storage: 1 bit
entropyStr += navigator.cookieEnabled + typeof (sessionStorage) + typeof (localStorage);
// language: ~7 bit
entropyStr += navigator.language;
// history: ~2 bit
entropyStr += window.history.length;
// location
entropyStr += window.location;
var entropyBytes = Crypto.SHA256(entropyStr, {
asBytes: true
});
for (var i = 0; i < entropyBytes.length; i++) {
sr.seedInt8(entropyBytes[i]);
}
}
})();
//ripemd160.js
/*
CryptoJS v3.1.2
code.google.com/p/crypto-js
(c) 2009-2013 by Jeff Mott. All rights reserved.
code.google.com/p/crypto-js/wiki/License
*/
/** @preserve
(c) 2012 by Cédric Mesnil. All rights reserved.
Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
- Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
- Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
// Constants table
var zl = [
0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15,
7, 4, 13, 1, 10, 6, 15, 3, 12, 0, 9, 5, 2, 14, 11, 8,
3, 10, 14, 4, 9, 15, 8, 1, 2, 7, 0, 6, 13, 11, 5, 12,
1, 9, 11, 10, 0, 8, 12, 4, 13, 3, 7, 15, 14, 5, 6, 2,
4, 0, 5, 9, 7, 12, 2, 10, 14, 1, 3, 8, 11, 6, 15, 13
];
var zr = [
5, 14, 7, 0, 9, 2, 11, 4, 13, 6, 15, 8, 1, 10, 3, 12,
6, 11, 3, 7, 0, 13, 5, 10, 14, 15, 8, 12, 4, 9, 1, 2,
15, 5, 1, 3, 7, 14, 6, 9, 11, 8, 12, 2, 10, 0, 4, 13,
8, 6, 4, 1, 3, 11, 15, 0, 5, 12, 2, 13, 9, 7, 10, 14,
12, 15, 10, 4, 1, 5, 8, 7, 6, 2, 13, 14, 0, 3, 9, 11
];
var sl = [
11, 14, 15, 12, 5, 8, 7, 9, 11, 13, 14, 15, 6, 7, 9, 8,
7, 6, 8, 13, 11, 9, 7, 15, 7, 12, 15, 9, 11, 7, 13, 12,
11, 13, 6, 7, 14, 9, 13, 15, 14, 8, 13, 6, 5, 12, 7, 5,
11, 12, 14, 15, 14, 15, 9, 8, 9, 14, 5, 6, 8, 6, 5, 12,
9, 15, 5, 11, 6, 8, 13, 12, 5, 12, 13, 14, 11, 8, 5, 6
];
var sr = [
8, 9, 9, 11, 13, 15, 15, 5, 7, 7, 8, 11, 14, 14, 12, 6,
9, 13, 15, 7, 12, 8, 9, 11, 7, 7, 12, 7, 6, 15, 13, 11,
9, 7, 15, 11, 8, 6, 6, 14, 12, 13, 5, 14, 13, 13, 7, 5,
15, 5, 8, 11, 14, 14, 6, 14, 6, 9, 12, 9, 12, 5, 15, 8,
8, 5, 12, 9, 12, 5, 14, 6, 8, 13, 6, 5, 15, 13, 11, 11
];
var hl = [0x00000000, 0x5A827999, 0x6ED9EBA1, 0x8F1BBCDC, 0xA953FD4E];
var hr = [0x50A28BE6, 0x5C4DD124, 0x6D703EF3, 0x7A6D76E9, 0x00000000];
var bytesToWords = function (bytes) {
var words = [];
for (var i = 0, b = 0; i < bytes.length; i++, b += 8) {
words[b >>> 5] |= bytes[i] << (24 - b % 32);
}
return words;
};
var wordsToBytes = function (words) {
var bytes = [];
for (var b = 0; b < words.length * 32; b += 8) {
bytes.push((words[b >>> 5] >>> (24 - b % 32)) & 0xFF);
}
return bytes;
};
var processBlock = function (H, M, offset) {
// Swap endian
for (var i = 0; i < 16; i++) {
var offset_i = offset + i;
var M_offset_i = M[offset_i];
// Swap
M[offset_i] = (
(((M_offset_i << 8) | (M_offset_i >>> 24)) & 0x00ff00ff) |
(((M_offset_i << 24) | (M_offset_i >>> 8)) & 0xff00ff00)
);
}
// Working variables
var al, bl, cl, dl, el;
var ar, br, cr, dr, er;
ar = al = H[0];
br = bl = H[1];
cr = cl = H[2];
dr = dl = H[3];
er = el = H[4];
// Computation
var t;
for (var i = 0; i < 80; i += 1) {
t = (al + M[offset + zl[i]]) | 0;
if (i < 16) {
t += f1(bl, cl, dl) + hl[0];
} else if (i < 32) {
t += f2(bl, cl, dl) + hl[1];
} else if (i < 48) {
t += f3(bl, cl, dl) + hl[2];
} else if (i < 64) {
t += f4(bl, cl, dl) + hl[3];
} else { // if (i<80) {
t += f5(bl, cl, dl) + hl[4];
}
t = t | 0;
t = rotl(t, sl[i]);
t = (t + el) | 0;
al = el;
el = dl;
dl = rotl(cl, 10);
cl = bl;
bl = t;
t = (ar + M[offset + zr[i]]) | 0;
if (i < 16) {
t += f5(br, cr, dr) + hr[0];
} else if (i < 32) {
t += f4(br, cr, dr) + hr[1];
} else if (i < 48) {
t += f3(br, cr, dr) + hr[2];
} else if (i < 64) {
t += f2(br, cr, dr) + hr[3];
} else { // if (i<80) {
t += f1(br, cr, dr) + hr[4];
}
t = t | 0;
t = rotl(t, sr[i]);
t = (t + er) | 0;
ar = er;
er = dr;
dr = rotl(cr, 10);
cr = br;
br = t;
}
// Intermediate hash value
t = (H[1] + cl + dr) | 0;
H[1] = (H[2] + dl + er) | 0;
H[2] = (H[3] + el + ar) | 0;
H[3] = (H[4] + al + br) | 0;
H[4] = (H[0] + bl + cr) | 0;
H[0] = t;
};
function f1(x, y, z) {
return ((x) ^ (y) ^ (z));
}
function f2(x, y, z) {
return (((x) & (y)) | ((~x) & (z)));
}
function f3(x, y, z) {
return (((x) | (~(y))) ^ (z));
}
function f4(x, y, z) {
return (((x) & (z)) | ((y) & (~(z))));
}
function f5(x, y, z) {
return ((x) ^ ((y) | (~(z))));
}
function rotl(x, n) {
return (x << n) | (x >>> (32 - n));
}
function ripemd160(message) {
var H = [0x67452301, 0xEFCDAB89, 0x98BADCFE, 0x10325476, 0xC3D2E1F0];
var m = bytesToWords(message);
var nBitsLeft = message.length * 8;
var nBitsTotal = message.length * 8;
// Add padding
m[nBitsLeft >>> 5] |= 0x80 << (24 - nBitsLeft % 32);
m[(((nBitsLeft + 64) >>> 9) << 4) + 14] = (
(((nBitsTotal << 8) | (nBitsTotal >>> 24)) & 0x00ff00ff) |
(((nBitsTotal << 24) | (nBitsTotal >>> 8)) & 0xff00ff00)
);
for (var i = 0; i < m.length; i += 16) {
processBlock(H, m, i);
}
// Swap endian
for (var i = 0; i < 5; i++) {
// Shortcut
var H_i = H[i];
// Swap
H[i] = (((H_i << 8) | (H_i >>> 24)) & 0x00ff00ff) |
(((H_i << 24) | (H_i >>> 8)) & 0xff00ff00);
}
var digestbytes = wordsToBytes(H);
return digestbytes;
}
// Upstream 'BigInteger' here:
// Original Author: http://www-cs-students.stanford.edu/~tjw/jsbn/
// Follows 'jsbn' on Github: https://github.com/jasondavies/jsbn
// Review and Testing: https://github.com/cryptocoinjs/bigi/
/*!
* Basic JavaScript BN library - subset useful for RSA encryption. v1.4
*
* Copyright (c) 2005 Tom Wu
* All Rights Reserved.
* BSD License
* http://www-cs-students.stanford.edu/~tjw/jsbn/LICENSE
*
* Copyright Stephan Thomas
* Copyright pointbiz
*/
(function () {
// (public) Constructor function of Global BigInteger object
var BigInteger = window.BigInteger = function BigInteger(a, b, c) {
if (!(this instanceof BigInteger))
return new BigInteger(a, b, c);
if (a != null)
if ("number" == typeof a) this.fromNumber(a, b, c);
else if (b == null && "string" != typeof a) this.fromString(a, 256);
else this.fromString(a, b);
};
// Bits per digit
var dbits;
// JavaScript engine analysis
var canary = 0xdeadbeefcafe;
var j_lm = ((canary & 0xffffff) == 0xefcafe);
// return new, unset BigInteger
function nbi() {
return new BigInteger(null);
}
// am: Compute w_j += (x*this_i), propagate carries,
// c is initial carry, returns final carry.
// c < 3*dvalue, x < 2*dvalue, this_i < dvalue
// We need to select the fastest one that works in this environment.
// am1: use a single mult and divide to get the high bits,
// max digit bits should be 26 because
// max internal value = 2*dvalue^2-2*dvalue (< 2^53)
function am1(i, x, w, j, c, n) {
while (--n >= 0) {
var v = x * this[i++] + w[j] + c;
c = Math.floor(v / 0x4000000);
w[j++] = v & 0x3ffffff;
}
return c;
}
// am2 avoids a big mult-and-extract completely.
// Max digit bits should be <= 30 because we do bitwise ops
// on values up to 2*hdvalue^2-hdvalue-1 (< 2^31)
function am2(i, x, w, j, c, n) {
var xl = x & 0x7fff,
xh = x >> 15;
while (--n >= 0) {
var l = this[i] & 0x7fff;
var h = this[i++] >> 15;
var m = xh * l + h * xl;
l = xl * l + ((m & 0x7fff) << 15) + w[j] + (c & 0x3fffffff);
c = (l >>> 30) + (m >>> 15) + xh * h + (c >>> 30);
w[j++] = l & 0x3fffffff;
}
return c;
}
// Alternately, set max digit bits to 28 since some
// browsers slow down when dealing with 32-bit numbers.
function am3(i, x, w, j, c, n) {
var xl = x & 0x3fff,
xh = x >> 14;
while (--n >= 0) {
var l = this[i] & 0x3fff;
var h = this[i++] >> 14;
var m = xh * l + h * xl;
l = xl * l + ((m & 0x3fff) << 14) + w[j] + c;
c = (l >> 28) + (m >> 14) + xh * h;
w[j++] = l & 0xfffffff;
}
return c;
}
if (j_lm && (navigator.appName == "Microsoft Internet Explorer")) {
BigInteger.prototype.am = am2;
dbits = 30;
} else if (j_lm && (navigator.appName != "Netscape")) {
BigInteger.prototype.am = am1;
dbits = 26;
} else { // Mozilla/Netscape seems to prefer am3
BigInteger.prototype.am = am3;
dbits = 28;
}
BigInteger.prototype.DB = dbits;
BigInteger.prototype.DM = ((1 << dbits) - 1);
BigInteger.prototype.DV = (1 << dbits);
var BI_FP = 52;
BigInteger.prototype.FV = Math.pow(2, BI_FP);
BigInteger.prototype.F1 = BI_FP - dbits;
BigInteger.prototype.F2 = 2 * dbits - BI_FP;
// Digit conversions
var BI_RM = "0123456789abcdefghijklmnopqrstuvwxyz";
var BI_RC = new Array();
var rr, vv;
rr = "0".charCodeAt(0);
for (vv = 0; vv <= 9; ++vv) BI_RC[rr++] = vv;
rr = "a".charCodeAt(0);
for (vv = 10; vv < 36; ++vv) BI_RC[rr++] = vv;
rr = "A".charCodeAt(0);
for (vv = 10; vv < 36; ++vv) BI_RC[rr++] = vv;
function int2char(n) {
return BI_RM.charAt(n);
}
function intAt(s, i) {
var c = BI_RC[s.charCodeAt(i)];
return (c == null) ? -1 : c;
}
// return bigint initialized to value
function nbv(i) {
var r = nbi();
r.fromInt(i);
return r;
}
// returns bit length of the integer x
function nbits(x) {
var r = 1,
t;
if ((t = x >>> 16) != 0) {
x = t;
r += 16;
}
if ((t = x >> 8) != 0) {
x = t;
r += 8;
}
if ((t = x >> 4) != 0) {
x = t;
r += 4;
}
if ((t = x >> 2) != 0) {
x = t;
r += 2;
}
if ((t = x >> 1) != 0) {
x = t;
r += 1;
}
return r;
}
// (protected) copy this to r
BigInteger.prototype.copyTo = function (r) {
for (var i = this.t - 1; i >= 0; --i) r[i] = this[i];
r.t = this.t;
r.s = this.s;
};
// (protected) set from integer value x, -DV <= x < DV
BigInteger.prototype.fromInt = function (x) {
this.t = 1;
this.s = (x < 0) ? -1 : 0;
if (x > 0) this[0] = x;
else if (x < -1) this[0] = x + this.DV;
else this.t = 0;
};
// (protected) set from string and radix
BigInteger.prototype.fromString = function (s, b) {
var k;
if (b == 16) k = 4;
else if (b == 8) k = 3;
else if (b == 256) k = 8; // byte array
else if (b == 2) k = 1;
else if (b == 32) k = 5;
else if (b == 4) k = 2;
else {
this.fromRadix(s, b);
return;
}
this.t = 0;
this.s = 0;
var i = s.length,
mi = false,
sh = 0;
while (--i >= 0) {
var x = (k == 8) ? s[i] & 0xff : intAt(s, i);
if (x < 0) {
if (s.charAt(i) == "-") mi = true;
continue;
}
mi = false;
if (sh == 0)
this[this.t++] = x;
else if (sh + k > this.DB) {
this[this.t - 1] |= (x & ((1 << (this.DB - sh)) - 1)) << sh;
this[this.t++] = (x >> (this.DB - sh));
} else
this[this.t - 1] |= x << sh;
sh += k;
if (sh >= this.DB) sh -= this.DB;
}
if (k == 8 && (s[0] & 0x80) != 0) {
this.s = -1;
if (sh > 0) this[this.t - 1] |= ((1 << (this.DB - sh)) - 1) << sh;
}
this.clamp();
if (mi) BigInteger.ZERO.subTo(this, this);
};
// (protected) clamp off excess high words
BigInteger.prototype.clamp = function () {
var c = this.s & this.DM;
while (this.t > 0 && this[this.t - 1] == c) --this.t;
};
// (protected) r = this << n*DB
BigInteger.prototype.dlShiftTo = function (n, r) {
var i;
for (i = this.t - 1; i >= 0; --i) r[i + n] = this[i];
for (i = n - 1; i >= 0; --i) r[i] = 0;
r.t = this.t + n;
r.s = this.s;
};
// (protected) r = this >> n*DB
BigInteger.prototype.drShiftTo = function (n, r) {
for (var i = n; i < this.t; ++i) r[i - n] = this[i];
r.t = Math.max(this.t - n, 0);
r.s = this.s;
};
// (protected) r = this << n
BigInteger.prototype.lShiftTo = function (n, r) {
var bs = n % this.DB;
var cbs = this.DB - bs;
var bm = (1 << cbs) - 1;
var ds = Math.floor(n / this.DB),
c = (this.s << bs) & this.DM,
i;
for (i = this.t - 1; i >= 0; --i) {
r[i + ds + 1] = (this[i] >> cbs) | c;
c = (this[i] & bm) << bs;
}
for (i = ds - 1; i >= 0; --i) r[i] = 0;
r[ds] = c;
r.t = this.t + ds + 1;
r.s = this.s;
r.clamp();
};
// (protected) r = this >> n
BigInteger.prototype.rShiftTo = function (n, r) {
r.s = this.s;
var ds = Math.floor(n / this.DB);
if (ds >= this.t) {
r.t = 0;
return;
}
var bs = n % this.DB;
var cbs = this.DB - bs;
var bm = (1 << bs) - 1;
r[0] = this[ds] >> bs;
for (var i = ds + 1; i < this.t; ++i) {
r[i - ds - 1] |= (this[i] & bm) << cbs;
r[i - ds] = this[i] >> bs;
}
if (bs > 0) r[this.t - ds - 1] |= (this.s & bm) << cbs;
r.t = this.t - ds;
r.clamp();
};
// (protected) r = this - a
BigInteger.prototype.subTo = function (a, r) {
var i = 0,
c = 0,
m = Math.min(a.t, this.t);
while (i < m) {
c += this[i] - a[i];
r[i++] = c & this.DM;
c >>= this.DB;
}
if (a.t < this.t) {
c -= a.s;
while (i < this.t) {
c += this[i];
r[i++] = c & this.DM;
c >>= this.DB;
}
c += this.s;
} else {
c += this.s;
while (i < a.t) {
c -= a[i];
r[i++] = c & this.DM;
c >>= this.DB;
}
c -= a.s;
}
r.s = (c < 0) ? -1 : 0;
if (c < -1) r[i++] = this.DV + c;
else if (c > 0) r[i++] = c;
r.t = i;
r.clamp();
};
// (protected) r = this * a, r != this,a (HAC 14.12)
// "this" should be the larger one if appropriate.
BigInteger.prototype.multiplyTo = function (a, r) {
var x = this.abs(),
y = a.abs();
var i = x.t;
r.t = i + y.t;
while (--i >= 0) r[i] = 0;
for (i = 0; i < y.t; ++i) r[i + x.t] = x.am(0, y[i], r, i, 0, x.t);
r.s = 0;
r.clamp();
if (this.s != a.s) BigInteger.ZERO.subTo(r, r);
};
// (protected) r = this^2, r != this (HAC 14.16)
BigInteger.prototype.squareTo = function (r) {
var x = this.abs();
var i = r.t = 2 * x.t;
while (--i >= 0) r[i] = 0;
for (i = 0; i < x.t - 1; ++i) {
var c = x.am(i, x[i], r, 2 * i, 0, 1);
if ((r[i + x.t] += x.am(i + 1, 2 * x[i], r, 2 * i + 1, c, x.t - i - 1)) >= x.DV) {
r[i + x.t] -= x.DV;
r[i + x.t + 1] = 1;
}
}
if (r.t > 0) r[r.t - 1] += x.am(i, x[i], r, 2 * i, 0, 1);
r.s = 0;
r.clamp();
};
// (protected) divide this by m, quotient and remainder to q, r (HAC 14.20)
// r != q, this != m. q or r may be null.
BigInteger.prototype.divRemTo = function (m, q, r) {
var pm = m.abs();
if (pm.t <= 0) return;
var pt = this.abs();
if (pt.t < pm.t) {
if (q != null) q.fromInt(0);
if (r != null) this.copyTo(r);
return;
}
if (r == null) r = nbi();
var y = nbi(),
ts = this.s,
ms = m.s;
var nsh = this.DB - nbits(pm[pm.t - 1]); // normalize modulus
if (nsh > 0) {
pm.lShiftTo(nsh, y);
pt.lShiftTo(nsh, r);
} else {
pm.copyTo(y);
pt.copyTo(r);
}
var ys = y.t;
var y0 = y[ys - 1];
if (y0 == 0) return;
var yt = y0 * (1 << this.F1) + ((ys > 1) ? y[ys - 2] >> this.F2 : 0);
var d1 = this.FV / yt,
d2 = (1 << this.F1) / yt,
e = 1 << this.F2;
var i = r.t,
j = i - ys,
t = (q == null) ? nbi() : q;
y.dlShiftTo(j, t);
if (r.compareTo(t) >= 0) {
r[r.t++] = 1;
r.subTo(t, r);
}
BigInteger.ONE.dlShiftTo(ys, t);
t.subTo(y, y); // "negative" y so we can replace sub with am later
while (y.t < ys) y[y.t++] = 0;
while (--j >= 0) {
// Estimate quotient digit
var qd = (r[--i] == y0) ? this.DM : Math.floor(r[i] * d1 + (r[i - 1] + e) * d2);
if ((r[i] += y.am(0, qd, r, j, 0, ys)) < qd) { // Try it out
y.dlShiftTo(j, t);
r.subTo(t, r);
while (r[i] < --qd) r.subTo(t, r);
}
}
if (q != null) {
r.drShiftTo(ys, q);
if (ts != ms) BigInteger.ZERO.subTo(q, q);
}
r.t = ys;
r.clamp();
if (nsh > 0) r.rShiftTo(nsh, r); // Denormalize remainder
if (ts < 0) BigInteger.ZERO.subTo(r, r);
};
// (protected) return "-1/this % 2^DB"; useful for Mont. reduction
// justification:
// xy == 1 (mod m)
// xy = 1+km
// xy(2-xy) = (1+km)(1-km)
// x[y(2-xy)] = 1-k^2m^2
// x[y(2-xy)] == 1 (mod m^2)
// if y is 1/x mod m, then y(2-xy) is 1/x mod m^2
// should reduce x and y(2-xy) by m^2 at each step to keep size bounded.
// JS multiply "overflows" differently from C/C++, so care is needed here.
BigInteger.prototype.invDigit = function () {
if (this.t < 1) return 0;
var x = this[0];
if ((x & 1) == 0) return 0;
var y = x & 3; // y == 1/x mod 2^2
y = (y * (2 - (x & 0xf) * y)) & 0xf; // y == 1/x mod 2^4
y = (y * (2 - (x & 0xff) * y)) & 0xff; // y == 1/x mod 2^8
y = (y * (2 - (((x & 0xffff) * y) & 0xffff))) & 0xffff; // y == 1/x mod 2^16
// last step - calculate inverse mod DV directly;
// assumes 16 < DB <= 32 and assumes ability to handle 48-bit ints
y = (y * (2 - x * y % this.DV)) % this.DV; // y == 1/x mod 2^dbits
// we really want the negative inverse, and -DV < y < DV
return (y > 0) ? this.DV - y : -y;
};
// (protected) true iff this is even
BigInteger.prototype.isEven = function () {
return ((this.t > 0) ? (this[0] & 1) : this.s) == 0;
};
// (protected) this^e, e < 2^32, doing sqr and mul with "r" (HAC 14.79)
BigInteger.prototype.exp = function (e, z) {
if (e > 0xffffffff || e < 1) return BigInteger.ONE;
var r = nbi(),
r2 = nbi(),
g = z.convert(this),
i = nbits(e) - 1;
g.copyTo(r);
while (--i >= 0) {
z.sqrTo(r, r2);
if ((e & (1 << i)) > 0) z.mulTo(r2, g, r);
else {
var t = r;
r = r2;
r2 = t;
}
}
return z.revert(r);
};
// (public) return string representation in given radix
BigInteger.prototype.toString = function (b) {
if (this.s < 0) return "-" + this.negate().toString(b);
var k;
if (b == 16) k = 4;
else if (b == 8) k = 3;
else if (b == 2) k = 1;
else if (b == 32) k = 5;
else if (b == 4) k = 2;
else return this.toRadix(b);
var km = (1 << k) - 1,
d, m = false,
r = "",
i = this.t;
var p = this.DB - (i * this.DB) % k;
if (i-- > 0) {
if (p < this.DB && (d = this[i] >> p) > 0) {
m = true;
r = int2char(d);
}
while (i >= 0) {
if (p < k) {
d = (this[i] & ((1 << p) - 1)) << (k - p);
d |= this[--i] >> (p += this.DB - k);
} else {
d = (this[i] >> (p -= k)) & km;
if (p <= 0) {
p += this.DB;
--i;
}
}
if (d > 0) m = true;
if (m) r += int2char(d);
}
}
return m ? r : "0";
};
// (public) -this
BigInteger.prototype.negate = function () {
var r = nbi();
BigInteger.ZERO.subTo(this, r);
return r;
};
// (public) |this|
BigInteger.prototype.abs = function () {
return (this.s < 0) ? this.negate() : this;
};
// (public) return + if this > a, - if this < a, 0 if equal
BigInteger.prototype.compareTo = function (a) {
var r = this.s - a.s;
if (r != 0) return r;
var i = this.t;
r = i - a.t;
if (r != 0) return (this.s < 0) ? -r : r;
while (--i >= 0)
if ((r = this[i] - a[i]) != 0) return r;
return 0;
}
// (public) return the number of bits in "this"
BigInteger.prototype.bitLength = function () {
if (this.t <= 0) return 0;
return this.DB * (this.t - 1) + nbits(this[this.t - 1] ^ (this.s & this.DM));
};
// (public) this mod a
BigInteger.prototype.mod = function (a) {
var r = nbi();
this.abs().divRemTo(a, null, r);
if (this.s < 0 && r.compareTo(BigInteger.ZERO) > 0) a.subTo(r, r);
return r;
}
// (public) this^e % m, 0 <= e < 2^32
BigInteger.prototype.modPowInt = function (e, m) {
var z;
if (e < 256 || m.isEven()) z = new Classic(m);
else z = new Montgomery(m);
return this.exp(e, z);
};
// "constants"
BigInteger.ZERO = nbv(0);
BigInteger.ONE = nbv(1);
// Copyright (c) 2005-2009 Tom Wu
// All Rights Reserved.
// See "LICENSE" for details.
// Extended JavaScript BN functions, required for RSA private ops.
// Version 1.1: new BigInteger("0", 10) returns "proper" zero
// Version 1.2: square() API, isProbablePrime fix
// return index of lowest 1-bit in x, x < 2^31
function lbit(x) {
if (x == 0) return -1;
var r = 0;
if ((x & 0xffff) == 0) {
x >>= 16;
r += 16;
}
if ((x & 0xff) == 0) {
x >>= 8;
r += 8;
}
if ((x & 0xf) == 0) {
x >>= 4;
r += 4;
}
if ((x & 3) == 0) {
x >>= 2;
r += 2;
}
if ((x & 1) == 0) ++r;
return r;
}
// return number of 1 bits in x
function cbit(x) {
var r = 0;
while (x != 0) {
x &= x - 1;
++r;
}
return r;
}
var lowprimes = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83,
89,
97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191,
193,
197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307,
311,
313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, 401, 409, 419, 421, 431,
433,
439, 443, 449, 457, 461, 463, 467, 479, 487, 491, 499, 503, 509, 521, 523, 541, 547, 557, 563,
569,
571, 577, 587, 593, 599, 601, 607, 613, 617, 619, 631, 641, 643, 647, 653, 659, 661, 673, 677,
683,
691, 701, 709, 719, 727, 733, 739, 743, 751, 757, 761, 769, 773, 787, 797, 809, 811, 821, 823,
827,
829, 839, 853, 857, 859, 863, 877, 881, 883, 887, 907, 911, 919, 929, 937, 941, 947, 953, 967,
971,
977, 983, 991, 997
];
var lplim = (1 << 26) / lowprimes[lowprimes.length - 1];
// (protected) return x s.t. r^x < DV
BigInteger.prototype.chunkSize = function (r) {
return Math.floor(Math.LN2 * this.DB / Math.log(r));
};
// (protected) convert to radix string
BigInteger.prototype.toRadix = function (b) {
if (b == null) b = 10;
if (this.signum() == 0 || b < 2 || b > 36) return "0";
var cs = this.chunkSize(b);
var a = Math.pow(b, cs);
var d = nbv(a),
y = nbi(),
z = nbi(),
r = "";
this.divRemTo(d, y, z);
while (y.signum() > 0) {
r = (a + z.intValue()).toString(b).substr(1) + r;
y.divRemTo(d, y, z);
}
return z.intValue().toString(b) + r;
};
// (protected) convert from radix string
BigInteger.prototype.fromRadix = function (s, b) {
this.fromInt(0);
if (b == null) b = 10;
var cs = this.chunkSize(b);
var d = Math.pow(b, cs),
mi = false,
j = 0,
w = 0;
for (var i = 0; i < s.length; ++i) {
var x = intAt(s, i);
if (x < 0) {
if (s.charAt(i) == "-" && this.signum() == 0) mi = true;
continue;
}
w = b * w + x;
if (++j >= cs) {
this.dMultiply(d);
this.dAddOffset(w, 0);
j = 0;
w = 0;
}
}
if (j > 0) {
this.dMultiply(Math.pow(b, j));
this.dAddOffset(w, 0);
}
if (mi) BigInteger.ZERO.subTo(this, this);
};
// (protected) alternate constructor
BigInteger.prototype.fromNumber = function (a, b, c) {
if ("number" == typeof b) {
// new BigInteger(int,int,RNG)
if (a < 2) this.fromInt(1);
else {
this.fromNumber(a, c);
if (!this.testBit(a - 1)) // force MSB set
this.bitwiseTo(BigInteger.ONE.shiftLeft(a - 1), op_or, this);
if (this.isEven()) this.dAddOffset(1, 0); // force odd
while (!this.isProbablePrime(b)) {
this.dAddOffset(2, 0);
if (this.bitLength() > a) this.subTo(BigInteger.ONE.shiftLeft(a - 1), this);
}
}
} else {
// new BigInteger(int,RNG)
var x = new Array(),
t = a & 7;
x.length = (a >> 3) + 1;
b.nextBytes(x);
if (t > 0) x[0] &= ((1 << t) - 1);
else x[0] = 0;
this.fromString(x, 256);
}
};
// (protected) r = this op a (bitwise)
BigInteger.prototype.bitwiseTo = function (a, op, r) {
var i, f, m = Math.min(a.t, this.t);
for (i = 0; i < m; ++i) r[i] = op(this[i], a[i]);
if (a.t < this.t) {
f = a.s & this.DM;
for (i = m; i < this.t; ++i) r[i] = op(this[i], f);
r.t = this.t;
} else {
f = this.s & this.DM;
for (i = m; i < a.t; ++i) r[i] = op(f, a[i]);
r.t = a.t;
}
r.s = op(this.s, a.s);
r.clamp();
};
// (protected) this op (1<<n)
BigInteger.prototype.changeBit = function (n, op) {
var r = BigInteger.ONE.shiftLeft(n);
this.bitwiseTo(r, op, r);
return r;
};
// (protected) r = this + a
BigInteger.prototype.addTo = function (a, r) {
var i = 0,
c = 0,
m = Math.min(a.t, this.t);
while (i < m) {
c += this[i] + a[i];
r[i++] = c & this.DM;
c >>= this.DB;
}
if (a.t < this.t) {
c += a.s;
while (i < this.t) {
c += this[i];
r[i++] = c & this.DM;
c >>= this.DB;
}
c += this.s;
} else {
c += this.s;
while (i < a.t) {
c += a[i];
r[i++] = c & this.DM;
c >>= this.DB;
}
c += a.s;
}
r.s = (c < 0) ? -1 : 0;
if (c > 0) r[i++] = c;
else if (c < -1) r[i++] = this.DV + c;
r.t = i;
r.clamp();
};
// (protected) this *= n, this >= 0, 1 < n < DV
BigInteger.prototype.dMultiply = function (n) {
this[this.t] = this.am(0, n - 1, this, 0, 0, this.t);
++this.t;
this.clamp();
};
// (protected) this += n << w words, this >= 0
BigInteger.prototype.dAddOffset = function (n, w) {
if (n == 0) return;
while (this.t <= w) this[this.t++] = 0;
this[w] += n;
while (this[w] >= this.DV) {
this[w] -= this.DV;
if (++w >= this.t) this[this.t++] = 0;
++this[w];
}
};
// (protected) r = lower n words of "this * a", a.t <= n
// "this" should be the larger one if appropriate.
BigInteger.prototype.multiplyLowerTo = function (a, n, r) {
var i = Math.min(this.t + a.t, n);
r.s = 0; // assumes a,this >= 0
r.t = i;
while (i > 0) r[--i] = 0;
var j;
for (j = r.t - this.t; i < j; ++i) r[i + this.t] = this.am(0, a[i], r, i, 0, this.t);
for (j = Math.min(a.t, n); i < j; ++i) this.am(0, a[i], r, i, 0, n - i);
r.clamp();
};
// (protected) r = "this * a" without lower n words, n > 0
// "this" should be the larger one if appropriate.
BigInteger.prototype.multiplyUpperTo = function (a, n, r) {
--n;
var i = r.t = this.t + a.t - n;
r.s = 0; // assumes a,this >= 0
while (--i >= 0) r[i] = 0;
for (i = Math.max(n - this.t, 0); i < a.t; ++i)
r[this.t + i - n] = this.am(n - i, a[i], r, 0, 0, this.t + i - n);
r.clamp();
r.drShiftTo(1, r);
};
// (protected) this % n, n < 2^26
BigInteger.prototype.modInt = function (n) {
if (n <= 0) return 0;
var d = this.DV % n,
r = (this.s < 0) ? n - 1 : 0;
if (this.t > 0)
if (d == 0) r = this[0] % n;
else
for (var i = this.t - 1; i >= 0; --i) r = (d * r + this[i]) % n;
return r;
};
// (protected) true if probably prime (HAC 4.24, Miller-Rabin)
BigInteger.prototype.millerRabin = function (t) {
var n1 = this.subtract(BigInteger.ONE);
var k = n1.getLowestSetBit();
if (k <= 0) return false;
var r = n1.shiftRight(k);
t = (t + 1) >> 1;
if (t > lowprimes.length) t = lowprimes.length;
var a = nbi();
for (var i = 0; i < t; ++i) {
//Pick bases at random, instead of starting at 2
a.fromInt(lowprimes[Math.floor(Math.random() * lowprimes.length)]);
var y = a.modPow(r, this);
if (y.compareTo(BigInteger.ONE) != 0 && y.compareTo(n1) != 0) {
var j = 1;
while (j++ < k && y.compareTo(n1) != 0) {
y = y.modPowInt(2, this);
if (y.compareTo(BigInteger.ONE) == 0) return false;
}
if (y.compareTo(n1) != 0) return false;
}
}
return true;
};
// (public)
BigInteger.prototype.clone = function () {
var r = nbi();
this.copyTo(r);
return r;
};
// (public) return value as integer
BigInteger.prototype.intValue = function () {
if (this.s < 0) {
if (this.t == 1) return this[0] - this.DV;
else if (this.t == 0) return -1;
} else if (this.t == 1) return this[0];
else if (this.t == 0) return 0;
// assumes 16 < DB < 32
return ((this[1] & ((1 << (32 - this.DB)) - 1)) << this.DB) | this[0];
};
// (public) return value as byte
BigInteger.prototype.byteValue = function () {
return (this.t == 0) ? this.s : (this[0] << 24) >> 24;
};
// (public) return value as short (assumes DB>=16)
BigInteger.prototype.shortValue = function () {
return (this.t == 0) ? this.s : (this[0] << 16) >> 16;
};
// (public) 0 if this == 0, 1 if this > 0
BigInteger.prototype.signum = function () {
if (this.s < 0) return -1;
else if (this.t <= 0 || (this.t == 1 && this[0] <= 0)) return 0;
else return 1;
};
// (public) convert to bigendian byte array
BigInteger.prototype.toByteArray = function () {
var i = this.t,
r = new Array();
r[0] = this.s;
var p = this.DB - (i * this.DB) % 8,
d, k = 0;
if (i-- > 0) {
if (p < this.DB && (d = this[i] >> p) != (this.s & this.DM) >> p)
r[k++] = d | (this.s << (this.DB - p));
while (i >= 0) {
if (p < 8) {
d = (this[i] & ((1 << p) - 1)) << (8 - p);
d |= this[--i] >> (p += this.DB - 8);
} else {
d = (this[i] >> (p -= 8)) & 0xff;
if (p <= 0) {
p += this.DB;
--i;
}
}
if ((d & 0x80) != 0) d |= -256;
if (k == 0 && (this.s & 0x80) != (d & 0x80)) ++k;
if (k > 0 || d != this.s) r[k++] = d;
}
}
return r;
};
BigInteger.prototype.equals = function (a) {
return (this.compareTo(a) == 0);
};
BigInteger.prototype.min = function (a) {
return (this.compareTo(a) < 0) ? this : a;
};
BigInteger.prototype.max = function (a) {
return (this.compareTo(a) > 0) ? this : a;
};
// (public) this & a
function op_and(x, y) {
return x & y;
}
BigInteger.prototype.and = function (a) {
var r = nbi();
this.bitwiseTo(a, op_and, r);
return r;
};
// (public) this | a
function op_or(x, y) {
return x | y;
}
BigInteger.prototype.or = function (a) {
var r = nbi();
this.bitwiseTo(a, op_or, r);
return r;
};
// (public) this ^ a
function op_xor(x, y) {
return x ^ y;
}
BigInteger.prototype.xor = function (a) {
var r = nbi();
this.bitwiseTo(a, op_xor, r);
return r;
};
// (public) this & ~a
function op_andnot(x, y) {
return x & ~y;
}
BigInteger.prototype.andNot = function (a) {
var r = nbi();
this.bitwiseTo(a, op_andnot, r);
return r;
};
// (public) ~this
BigInteger.prototype.not = function () {
var r = nbi();
for (var i = 0; i < this.t; ++i) r[i] = this.DM & ~this[i];
r.t = this.t;
r.s = ~this.s;
return r;
};
// (public) this << n
BigInteger.prototype.shiftLeft = function (n) {
var r = nbi();
if (n < 0) this.rShiftTo(-n, r);
else this.lShiftTo(n, r);
return r;
};
// (public) this >> n
BigInteger.prototype.shiftRight = function (n) {
var r = nbi();
if (n < 0) this.lShiftTo(-n, r);
else this.rShiftTo(n, r);
return r;
};
// (public) returns index of lowest 1-bit (or -1 if none)
BigInteger.prototype.getLowestSetBit = function () {
for (var i = 0; i < this.t; ++i)
if (this[i] != 0) return i * this.DB + lbit(this[i]);
if (this.s < 0) return this.t * this.DB;
return -1;
};
// (public) return number of set bits
BigInteger.prototype.bitCount = function () {
var r = 0,
x = this.s & this.DM;
for (var i = 0; i < this.t; ++i) r += cbit(this[i] ^ x);
return r;
};
// (public) true iff nth bit is set
BigInteger.prototype.testBit = function (n) {
var j = Math.floor(n / this.DB);
if (j >= this.t) return (this.s != 0);
return ((this[j] & (1 << (n % this.DB))) != 0);
};
// (public) this | (1<<n)
BigInteger.prototype.setBit = function (n) {
return this.changeBit(n, op_or);
};
// (public) this & ~(1<<n)
BigInteger.prototype.clearBit = function (n) {
return this.changeBit(n, op_andnot);
};
// (public) this ^ (1<<n)
BigInteger.prototype.flipBit = function (n) {
return this.changeBit(n, op_xor);
};
// (public) this + a
BigInteger.prototype.add = function (a) {
var r = nbi();
this.addTo(a, r);
return r;
};
// (public) this - a
BigInteger.prototype.subtract = function (a) {
var r = nbi();
this.subTo(a, r);
return r;
};
// (public) this * a
BigInteger.prototype.multiply = function (a) {
var r = nbi();
this.multiplyTo(a, r);
return r;
};
// (public) this / a
BigInteger.prototype.divide = function (a) {
var r = nbi();
this.divRemTo(a, r, null);
return r;
};
// (public) this % a
BigInteger.prototype.remainder = function (a) {
var r = nbi();
this.divRemTo(a, null, r);
return r;
};
// (public) [this/a,this%a]
BigInteger.prototype.divideAndRemainder = function (a) {
var q = nbi(),
r = nbi();
this.divRemTo(a, q, r);
return new Array(q, r);
};
// (public) this^e % m (HAC 14.85)
BigInteger.prototype.modPow = function (e, m) {
var i = e.bitLength(),
k, r = nbv(1),
z;
if (i <= 0) return r;
else if (i < 18) k = 1;
else if (i < 48) k = 3;
else if (i < 144) k = 4;
else if (i < 768) k = 5;
else k = 6;
if (i < 8)
z = new Classic(m);
else if (m.isEven())
z = new Barrett(m);
else
z = new Montgomery(m);
// precomputation
var g = new Array(),
n = 3,
k1 = k - 1,
km = (1 << k) - 1;
g[1] = z.convert(this);
if (k > 1) {
var g2 = nbi();
z.sqrTo(g[1], g2);
while (n <= km) {
g[n] = nbi();
z.mulTo(g2, g[n - 2], g[n]);
n += 2;
}
}
var j = e.t - 1,
w, is1 = true,
r2 = nbi(),
t;
i = nbits(e[j]) - 1;
while (j >= 0) {
if (i >= k1) w = (e[j] >> (i - k1)) & km;
else {
w = (e[j] & ((1 << (i + 1)) - 1)) << (k1 - i);
if (j > 0) w |= e[j - 1] >> (this.DB + i - k1);
}
n = k;
while ((w & 1) == 0) {
w >>= 1;
--n;
}
if ((i -= n) < 0) {
i += this.DB;
--j;
}
if (is1) { // ret == 1, don't bother squaring or multiplying it
g[w].copyTo(r);
is1 = false;
} else {
while (n > 1) {
z.sqrTo(r, r2);
z.sqrTo(r2, r);
n -= 2;
}
if (n > 0) z.sqrTo(r, r2);
else {
t = r;
r = r2;
r2 = t;
}
z.mulTo(r2, g[w], r);
}
while (j >= 0 && (e[j] & (1 << i)) == 0) {
z.sqrTo(r, r2);
t = r;
r = r2;
r2 = t;
if (--i < 0) {
i = this.DB - 1;
--j;
}
}
}
return z.revert(r);
};
// (public) 1/this % m (HAC 14.61)
BigInteger.prototype.modInverse = function (m) {
var ac = m.isEven();
if (this.signum() === 0) throw new Error('division by zero');
if ((this.isEven() && ac) || m.signum() == 0) return BigInteger.ZERO;
var u = m.clone(),
v = this.clone();
var a = nbv(1),
b = nbv(0),
c = nbv(0),
d = nbv(1);
while (u.signum() != 0) {
while (u.isEven()) {
u.rShiftTo(1, u);
if (ac) {
if (!a.isEven() || !b.isEven()) {
a.addTo(this, a);
b.subTo(m, b);
}
a.rShiftTo(1, a);
} else if (!b.isEven()) b.subTo(m, b);
b.rShiftTo(1, b);
}
while (v.isEven()) {
v.rShiftTo(1, v);
if (ac) {
if (!c.isEven() || !d.isEven()) {
c.addTo(this, c);
d.subTo(m, d);
}
c.rShiftTo(1, c);
} else if (!d.isEven()) d.subTo(m, d);
d.rShiftTo(1, d);
}
if (u.compareTo(v) >= 0) {
u.subTo(v, u);
if (ac) a.subTo(c, a);
b.subTo(d, b);
} else {
v.subTo(u, v);
if (ac) c.subTo(a, c);
d.subTo(b, d);
}
}
if (v.compareTo(BigInteger.ONE) != 0) return BigInteger.ZERO;
while (d.compareTo(m) >= 0) d.subTo(m, d);
while (d.signum() < 0) d.addTo(m, d);
return d;
};
// (public) this^e
BigInteger.prototype.pow = function (e) {
return this.exp(e, new NullExp());
};
// (public) gcd(this,a) (HAC 14.54)
BigInteger.prototype.gcd = function (a) {
var x = (this.s < 0) ? this.negate() : this.clone();
var y = (a.s < 0) ? a.negate() : a.clone();
if (x.compareTo(y) < 0) {
var t = x;
x = y;
y = t;
}
var i = x.getLowestSetBit(),
g = y.getLowestSetBit();
if (g < 0) return x;
if (i < g) g = i;
if (g > 0) {
x.rShiftTo(g, x);
y.rShiftTo(g, y);
}
while (x.signum() > 0) {
if ((i = x.getLowestSetBit()) > 0) x.rShiftTo(i, x);
if ((i = y.getLowestSetBit()) > 0) y.rShiftTo(i, y);
if (x.compareTo(y) >= 0) {
x.subTo(y, x);
x.rShiftTo(1, x);
} else {
y.subTo(x, y);
y.rShiftTo(1, y);
}
}
if (g > 0) y.lShiftTo(g, y);
return y;
};
// (public) test primality with certainty >= 1-.5^t
BigInteger.prototype.isProbablePrime = function (t) {
var i, x = this.abs();
if (x.t == 1 && x[0] <= lowprimes[lowprimes.length - 1]) {
for (i = 0; i < lowprimes.length; ++i)
if (x[0] == lowprimes[i]) return true;
return false;
}
if (x.isEven()) return false;
i = 1;
while (i < lowprimes.length) {
var m = lowprimes[i],
j = i + 1;
while (j < lowprimes.length && m < lplim) m *= lowprimes[j++];
m = x.modInt(m);
while (i < j)
if (m % lowprimes[i++] == 0) return false;
}
return x.millerRabin(t);
};
// JSBN-specific extension
// (public) this^2
BigInteger.prototype.square = function () {
var r = nbi();
this.squareTo(r);
return r;
};
// NOTE: BigInteger interfaces not implemented in jsbn:
// BigInteger(int signum, byte[] magnitude)
// double doubleValue()
// float floatValue()
// int hashCode()
// long longValue()
// static BigInteger valueOf(long val)
// Copyright Stephan Thomas (start) --- //
// https://raw.github.com/bitcoinjs/bitcoinjs-lib/07f9d55ccb6abd962efb6befdd37671f85ea4ff9/src/util.js
// BigInteger monkey patching
BigInteger.valueOf = nbv;
/**
* Returns a byte array representation of the big integer.
*
* This returns the absolute of the contained value in big endian
* form. A value of zero results in an empty array.
*/
BigInteger.prototype.toByteArrayUnsigned = function () {
var ba = this.abs().toByteArray();
if (ba.length) {
if (ba[0] == 0) {
ba = ba.slice(1);
}
return ba.map(function (v) {
return (v < 0) ? v + 256 : v;
});
} else {
// Empty array, nothing to do
return ba;
}
};
/**
* Turns a byte array into a big integer.
*
* This function will interpret a byte array as a big integer in big
* endian notation and ignore leading zeros.
*/
BigInteger.fromByteArrayUnsigned = function (ba) {
if (!ba.length) {
return ba.valueOf(0);
} else if (ba[0] & 0x80) {
// Prepend a zero so the BigInteger class doesn't mistake this
// for a negative integer.
return new BigInteger([0].concat(ba));
} else {
return new BigInteger(ba);
}
};
/**
* Converts big integer to signed byte representation.
*
* The format for this value uses a the most significant bit as a sign
* bit. If the most significant bit is already occupied by the
* absolute value, an extra byte is prepended and the sign bit is set
* there.
*
* Examples:
*
* 0 => 0x00
* 1 => 0x01
* -1 => 0x81
* 127 => 0x7f
* -127 => 0xff
* 128 => 0x0080
* -128 => 0x8080
* 255 => 0x00ff
* -255 => 0x80ff
* 16300 => 0x3fac
* -16300 => 0xbfac
* 62300 => 0x00f35c
* -62300 => 0x80f35c
*/
BigInteger.prototype.toByteArraySigned = function () {
var val = this.abs().toByteArrayUnsigned();
var neg = this.compareTo(BigInteger.ZERO) < 0;
if (neg) {
if (val[0] & 0x80) {
val.unshift(0x80);
} else {
val[0] |= 0x80;
}
} else {
if (val[0] & 0x80) {
val.unshift(0x00);
}
}
return val;
};
/**
* Parse a signed big integer byte representation.
*
* For details on the format please see BigInteger.toByteArraySigned.
*/
BigInteger.fromByteArraySigned = function (ba) {
// Check for negative value
if (ba[0] & 0x80) {
// Remove sign bit
ba[0] &= 0x7f;
return BigInteger.fromByteArrayUnsigned(ba).negate();
} else {
return BigInteger.fromByteArrayUnsigned(ba);
}
};
// Copyright Stephan Thomas (end) --- //
// ****** REDUCTION ******* //
// Modular reduction using "classic" algorithm
var Classic = window.Classic = function Classic(m) {
this.m = m;
}
Classic.prototype.convert = function (x) {
if (x.s < 0 || x.compareTo(this.m) >= 0) return x.mod(this.m);
else return x;
};
Classic.prototype.revert = function (x) {
return x;
};
Classic.prototype.reduce = function (x) {
x.divRemTo(this.m, null, x);
};
Classic.prototype.mulTo = function (x, y, r) {
x.multiplyTo(y, r);
this.reduce(r);
};
Classic.prototype.sqrTo = function (x, r) {
x.squareTo(r);
this.reduce(r);
};
// Montgomery reduction
var Montgomery = window.Montgomery = function Montgomery(m) {
this.m = m;
this.mp = m.invDigit();
this.mpl = this.mp & 0x7fff;
this.mph = this.mp >> 15;
this.um = (1 << (m.DB - 15)) - 1;
this.mt2 = 2 * m.t;
}
// xR mod m
Montgomery.prototype.convert = function (x) {
var r = nbi();
x.abs().dlShiftTo(this.m.t, r);
r.divRemTo(this.m, null, r);
if (x.s < 0 && r.compareTo(BigInteger.ZERO) > 0) this.m.subTo(r, r);
return r;
}
// x/R mod m
Montgomery.prototype.revert = function (x) {
var r = nbi();
x.copyTo(r);
this.reduce(r);
return r;
};
// x = x/R mod m (HAC 14.32)
Montgomery.prototype.reduce = function (x) {
while (x.t <= this.mt2) // pad x so am has enough room later
x[x.t++] = 0;
for (var i = 0; i < this.m.t; ++i) {
// faster way of calculating u0 = x[i]*mp mod DV
var j = x[i] & 0x7fff;
var u0 = (j * this.mpl + (((j * this.mph + (x[i] >> 15) * this.mpl) & this.um) << 15)) & x.DM;
// use am to combine the multiply-shift-add into one call
j = i + this.m.t;
x[j] += this.m.am(0, u0, x, i, 0, this.m.t);
// propagate carry
while (x[j] >= x.DV) {
x[j] -= x.DV;
x[++j]++;
}
}
x.clamp();
x.drShiftTo(this.m.t, x);
if (x.compareTo(this.m) >= 0) x.subTo(this.m, x);
};
// r = "xy/R mod m"; x,y != r
Montgomery.prototype.mulTo = function (x, y, r) {
x.multiplyTo(y, r);
this.reduce(r);
};
// r = "x^2/R mod m"; x != r
Montgomery.prototype.sqrTo = function (x, r) {
x.squareTo(r);
this.reduce(r);
};
// A "null" reducer
var NullExp = window.NullExp = function NullExp() {}
NullExp.prototype.convert = function (x) {
return x;
};
NullExp.prototype.revert = function (x) {
return x;
};
NullExp.prototype.mulTo = function (x, y, r) {
x.multiplyTo(y, r);
};
NullExp.prototype.sqrTo = function (x, r) {
x.squareTo(r);
};
// Barrett modular reduction
var Barrett = window.Barrett = function Barrett(m) {
// setup Barrett
this.r2 = nbi();
this.q3 = nbi();
BigInteger.ONE.dlShiftTo(2 * m.t, this.r2);
this.mu = this.r2.divide(m);
this.m = m;
}
Barrett.prototype.convert = function (x) {
if (x.s < 0 || x.t > 2 * this.m.t) return x.mod(this.m);
else if (x.compareTo(this.m) < 0) return x;
else {
var r = nbi();
x.copyTo(r);
this.reduce(r);
return r;
}
};
Barrett.prototype.revert = function (x) {
return x;
};
// x = x mod m (HAC 14.42)
Barrett.prototype.reduce = function (x) {
x.drShiftTo(this.m.t - 1, this.r2);
if (x.t > this.m.t + 1) {
x.t = this.m.t + 1;
x.clamp();
}
this.mu.multiplyUpperTo(this.r2, this.m.t + 1, this.q3);
this.m.multiplyLowerTo(this.q3, this.m.t + 1, this.r2);
while (x.compareTo(this.r2) < 0) x.dAddOffset(1, this.m.t + 1);
x.subTo(this.r2, x);
while (x.compareTo(this.m) >= 0) x.subTo(this.m, x);
};
// r = x*y mod m; x,y != r
Barrett.prototype.mulTo = function (x, y, r) {
x.multiplyTo(y, r);
this.reduce(r);
};
// r = x^2 mod m; x != r
Barrett.prototype.sqrTo = function (x, r) {
x.squareTo(r);
this.reduce(r);
};
})();
// BigInteger interfaces not implemented in jsbn:
// BigInteger(int signum, byte[] magnitude)
// double doubleValue()
// float floatValue()
// int hashCode()
// long longValue()
// static BigInteger valueOf(long val)
//ellipticcurve.js
/*!
* Basic Javascript Elliptic Curve implementation
* Ported loosely from BouncyCastle's Java EC code
* Only Fp curves implemented for now
*
* Copyright Tom Wu, bitaddress.org BSD License.
* http://www-cs-students.stanford.edu/~tjw/jsbn/LICENSE
*/
(function () {
// Constructor function of Global EllipticCurve object
var ec = window.EllipticCurve = function () {};
// ----------------
// ECFieldElementFp constructor
// q instanceof BigInteger
// x instanceof BigInteger
ec.FieldElementFp = function (q, x) {
this.x = x;
// TODO if(x.compareTo(q) >= 0) error
this.q = q;
};
ec.FieldElementFp.prototype.equals = function (other) {
if (other == this) return true;
return (this.q.equals(other.q) && this.x.equals(other.x));
};
ec.FieldElementFp.prototype.toBigInteger = function () {
return this.x;
};
ec.FieldElementFp.prototype.negate = function () {
return new ec.FieldElementFp(this.q, this.x.negate().mod(this.q));
};
ec.FieldElementFp.prototype.add = function (b) {
return new ec.FieldElementFp(this.q, this.x.add(b.toBigInteger()).mod(this.q));
};
ec.FieldElementFp.prototype.subtract = function (b) {
return new ec.FieldElementFp(this.q, this.x.subtract(b.toBigInteger()).mod(this.q));
};
ec.FieldElementFp.prototype.multiply = function (b) {
return new ec.FieldElementFp(this.q, this.x.multiply(b.toBigInteger()).mod(this.q));
};
ec.FieldElementFp.prototype.square = function () {
return new ec.FieldElementFp(this.q, this.x.square().mod(this.q));
};
ec.FieldElementFp.prototype.divide = function (b) {
return new ec.FieldElementFp(this.q, this.x.multiply(b.toBigInteger().modInverse(this.q)).mod(
this.q));
};
ec.FieldElementFp.prototype.getByteLength = function () {
return Math.floor((this.toBigInteger().bitLength() + 7) / 8);
};
// D.1.4 91
/**
* return a sqrt root - the routine verifies that the calculation
* returns the right value - if none exists it returns null.
*
* Copyright (c) 2000 - 2011 The Legion Of The Bouncy Castle (http://www.bouncycastle.org)
* Ported to JavaScript by bitaddress.org
*/
ec.FieldElementFp.prototype.sqrt = function () {
if (!this.q.testBit(0)) throw new Error("even value of q");
// p mod 4 == 3
if (this.q.testBit(1)) {
// z = g^(u+1) + p, p = 4u + 3
var z = new ec.FieldElementFp(this.q, this.x.modPow(this.q.shiftRight(2).add(BigInteger.ONE),
this.q));
return z.square().equals(this) ? z : null;
}
// p mod 4 == 1
var qMinusOne = this.q.subtract(BigInteger.ONE);
var legendreExponent = qMinusOne.shiftRight(1);
if (!(this.x.modPow(legendreExponent, this.q).equals(BigInteger.ONE))) return null;
var u = qMinusOne.shiftRight(2);
var k = u.shiftLeft(1).add(BigInteger.ONE);
var Q = this.x;
var fourQ = Q.shiftLeft(2).mod(this.q);
var U, V;
do {
var rand = new SecureRandom();
var P;
do {
P = new BigInteger(this.q.bitLength(), rand);
}
while (P.compareTo(this.q) >= 0 || !(P.multiply(P).subtract(fourQ).modPow(legendreExponent,
this.q).equals(qMinusOne)));
var result = ec.FieldElementFp.fastLucasSequence(this.q, P, Q, k);
U = result[0];
V = result[1];
if (V.multiply(V).mod(this.q).equals(fourQ)) {
// Integer division by 2, mod q
if (V.testBit(0)) {
V = V.add(this.q);
}
V = V.shiftRight(1);
return new ec.FieldElementFp(this.q, V);
}
}
while (U.equals(BigInteger.ONE) || U.equals(qMinusOne));
return null;
};
/*!
* Crypto-JS 2.5.4 BlockModes.js
* contribution from Simon Greatrix
*/
(function (C) {
// Create pad namespace
var C_pad = C.pad = {};
// Calculate the number of padding bytes required.
function _requiredPadding(cipher, message) {
var blockSizeInBytes = cipher._blocksize * 4;
var reqd = blockSizeInBytes - message.length % blockSizeInBytes;
return reqd;
}
// Remove padding when the final byte gives the number of padding bytes.
var _unpadLength = function (cipher, message, alg, padding) {
var pad = message.pop();
if (pad == 0) {
throw new Error("Invalid zero-length padding specified for " + alg +
". Wrong cipher specification or key used?");
}
var maxPad = cipher._blocksize * 4;
if (pad > maxPad) {
throw new Error("Invalid padding length of " + pad +
" specified for " + alg +
". Wrong cipher specification or key used?");
}
for (var i = 1; i < pad; i++) {
var b = message.pop();
if (padding != undefined && padding != b) {
throw new Error("Invalid padding byte of 0x" + b.toString(16) +
" specified for " + alg +
". Wrong cipher specification or key used?");
}
}
};
// No-operation padding, used for stream ciphers
C_pad.NoPadding = {
pad: function (cipher, message) {},
unpad: function (cipher, message) {}
};
// Zero Padding.
//
// If the message is not an exact number of blocks, the final block is
// completed with 0x00 bytes. There is no unpadding.
C_pad.ZeroPadding = {
pad: function (cipher, message) {
var blockSizeInBytes = cipher._blocksize * 4;
var reqd = message.length % blockSizeInBytes;
if (reqd != 0) {
for (reqd = blockSizeInBytes - reqd; reqd > 0; reqd--) {
message.push(0x00);
}
}
},
unpad: function (cipher, message) {
while (message[message.length - 1] == 0) {
message.pop();
}
}
};
// ISO/IEC 7816-4 padding.
//
// Pads the plain text with an 0x80 byte followed by as many 0x00
// bytes are required to complete the block.
C_pad.iso7816 = {
pad: function (cipher, message) {
var reqd = _requiredPadding(cipher, message);
message.push(0x80);
for (; reqd > 1; reqd--) {
message.push(0x00);
}
},
unpad: function (cipher, message) {
var padLength;
for (padLength = cipher._blocksize * 4; padLength > 0; padLength--) {
var b = message.pop();
if (b == 0x80) return;
if (b != 0x00) {
throw new Error("ISO-7816 padding byte must be 0, not 0x" + b.toString(16) +
". Wrong cipher specification or key used?");
}
}
throw new Error(
"ISO-7816 padded beyond cipher block size. Wrong cipher specification or key used?"
);
}
};
// ANSI X.923 padding
//
// The final block is padded with zeros except for the last byte of the
// last block which contains the number of padding bytes.
C_pad.ansix923 = {
pad: function (cipher, message) {
var reqd = _requiredPadding(cipher, message);
for (var i = 1; i < reqd; i++) {
message.push(0x00);
}
message.push(reqd);
},
unpad: function (cipher, message) {
_unpadLength(cipher, message, "ANSI X.923", 0);
}
};
// ISO 10126
//
// The final block is padded with random bytes except for the last
// byte of the last block which contains the number of padding bytes.
C_pad.iso10126 = {
pad: function (cipher, message) {
var reqd = _requiredPadding(cipher, message);
for (var i = 1; i < reqd; i++) {
message.push(Math.floor(Math.random() * 256));
}
message.push(reqd);
},
unpad: function (cipher, message) {
_unpadLength(cipher, message, "ISO 10126", undefined);
}
};
// PKCS7 padding
//
// PKCS7 is described in RFC 5652. Padding is in whole bytes. The
// value of each added byte is the number of bytes that are added,
// i.e. N bytes, each of value N are added.
C_pad.pkcs7 = {
pad: function (cipher, message) {
var reqd = _requiredPadding(cipher, message);
for (var i = 0; i < reqd; i++) {
message.push(reqd);
}
},
unpad: function (cipher, message) {
_unpadLength(cipher, message, "PKCS 7", message[message.length - 1]);
}
};
// Create mode namespace
var C_mode = C.mode = {};
/**
* Mode base "class".
*/
var Mode = C_mode.Mode = function (padding) {
if (padding) {
this._padding = padding;
}
};
Mode.prototype = {
encrypt: function (cipher, m, iv) {
this._padding.pad(cipher, m);
this._doEncrypt(cipher, m, iv);
},
decrypt: function (cipher, m, iv) {
this._doDecrypt(cipher, m, iv);
this._padding.unpad(cipher, m);
},
// Default padding
_padding: C_pad.iso7816
};
/**
* Electronic Code Book mode.
*
* ECB applies the cipher directly against each block of the input.
*
* ECB does not require an initialization vector.
*/
var ECB = C_mode.ECB = function () {
// Call parent constructor
Mode.apply(this, arguments);
};
// Inherit from Mode
var ECB_prototype = ECB.prototype = new Mode;
// Concrete steps for Mode template
ECB_prototype._doEncrypt = function (cipher, m, iv) {
var blockSizeInBytes = cipher._blocksize * 4;
// Encrypt each block
for (var offset = 0; offset < m.length; offset += blockSizeInBytes) {
cipher._encryptblock(m, offset);
}
};
ECB_prototype._doDecrypt = function (cipher, c, iv) {
var blockSizeInBytes = cipher._blocksize * 4;
// Decrypt each block
for (var offset = 0; offset < c.length; offset += blockSizeInBytes) {
cipher._decryptblock(c, offset);
}
};
// ECB never uses an IV
ECB_prototype.fixOptions = function (options) {
options.iv = [];
};
/**
* Cipher block chaining
*
* The first block is XORed with the IV. Subsequent blocks are XOR with the
* previous cipher output.
*/
var CBC = C_mode.CBC = function () {
// Call parent constructor
Mode.apply(this, arguments);
};
// Inherit from Mode
var CBC_prototype = CBC.prototype = new Mode;
// Concrete steps for Mode template
CBC_prototype._doEncrypt = function (cipher, m, iv) {
var blockSizeInBytes = cipher._blocksize * 4;
// Encrypt each block
for (var offset = 0; offset < m.length; offset += blockSizeInBytes) {
if (offset == 0) {
// XOR first block using IV
for (var i = 0; i < blockSizeInBytes; i++)
m[i] ^= iv[i];
} else {
// XOR this block using previous crypted block
for (var i = 0; i < blockSizeInBytes; i++)
m[offset + i] ^= m[offset + i - blockSizeInBytes];
}
// Encrypt block
cipher._encryptblock(m, offset);
}
};
CBC_prototype._doDecrypt = function (cipher, c, iv) {
var blockSizeInBytes = cipher._blocksize * 4;
// At the start, the previously crypted block is the IV
var prevCryptedBlock = iv;
// Decrypt each block
for (var offset = 0; offset < c.length; offset += blockSizeInBytes) {
// Save this crypted block
var thisCryptedBlock = c.slice(offset, offset + blockSizeInBytes);
// Decrypt block
cipher._decryptblock(c, offset);
// XOR decrypted block using previous crypted block
for (var i = 0; i < blockSizeInBytes; i++) {
c[offset + i] ^= prevCryptedBlock[i];
}
prevCryptedBlock = thisCryptedBlock;
}
};
/**
* Cipher feed back
*
* The cipher output is XORed with the plain text to produce the cipher output,
* which is then fed back into the cipher to produce a bit pattern to XOR the
* next block with.
*
* This is a stream cipher mode and does not require padding.
*/
var CFB = C_mode.CFB = function () {
// Call parent constructor
Mode.apply(this, arguments);
};
// Inherit from Mode
var CFB_prototype = CFB.prototype = new Mode;
// Override padding
CFB_prototype._padding = C_pad.NoPadding;
// Concrete steps for Mode template
CFB_prototype._doEncrypt = function (cipher, m, iv) {
var blockSizeInBytes = cipher._blocksize * 4,
keystream = iv.slice(0);
// Encrypt each byte
for (var i = 0; i < m.length; i++) {
var j = i % blockSizeInBytes;
if (j == 0) cipher._encryptblock(keystream, 0);
m[i] ^= keystream[j];
keystream[j] = m[i];
}
};
CFB_prototype._doDecrypt = function (cipher, c, iv) {
var blockSizeInBytes = cipher._blocksize * 4,
keystream = iv.slice(0);
// Encrypt each byte
for (var i = 0; i < c.length; i++) {
var j = i % blockSizeInBytes;
if (j == 0) cipher._encryptblock(keystream, 0);
var b = c[i];
c[i] ^= keystream[j];
keystream[j] = b;
}
};
/**
* Output feed back
*
* The cipher repeatedly encrypts its own output. The output is XORed with the
* plain text to produce the cipher text.
*
* This is a stream cipher mode and does not require padding.
*/
var OFB = C_mode.OFB = function () {
// Call parent constructor
Mode.apply(this, arguments);
};
// Inherit from Mode
var OFB_prototype = OFB.prototype = new Mode;
// Override padding
OFB_prototype._padding = C_pad.NoPadding;
// Concrete steps for Mode template
OFB_prototype._doEncrypt = function (cipher, m, iv) {
var blockSizeInBytes = cipher._blocksize * 4,
keystream = iv.slice(0);
// Encrypt each byte
for (var i = 0; i < m.length; i++) {
// Generate keystream
if (i % blockSizeInBytes == 0)
cipher._encryptblock(keystream, 0);
// Encrypt byte
m[i] ^= keystream[i % blockSizeInBytes];
}
};
OFB_prototype._doDecrypt = OFB_prototype._doEncrypt;
/**
* Counter
* @author Gergely Risko
*
* After every block the last 4 bytes of the IV is increased by one
* with carry and that IV is used for the next block.
*
* This is a stream cipher mode and does not require padding.
*/
var CTR = C_mode.CTR = function () {
// Call parent constructor
Mode.apply(this, arguments);
};
// Inherit from Mode
var CTR_prototype = CTR.prototype = new Mode;
// Override padding
CTR_prototype._padding = C_pad.NoPadding;
CTR_prototype._doEncrypt = function (cipher, m, iv) {
var blockSizeInBytes = cipher._blocksize * 4;
var counter = iv.slice(0);
for (var i = 0; i < m.length;) {
// do not lose iv
var keystream = counter.slice(0);
// Generate keystream for next block
cipher._encryptblock(keystream, 0);
// XOR keystream with block
for (var j = 0; i < m.length && j < blockSizeInBytes; j++, i++) {
m[i] ^= keystream[j];
}
// Increase counter
if (++(counter[blockSizeInBytes - 1]) == 256) {
counter[blockSizeInBytes - 1] = 0;
if (++(counter[blockSizeInBytes - 2]) == 256) {
counter[blockSizeInBytes - 2] = 0;
if (++(counter[blockSizeInBytes - 3]) == 256) {
counter[blockSizeInBytes - 3] = 0;
++(counter[blockSizeInBytes - 4]);
}
}
}
}
};
CTR_prototype._doDecrypt = CTR_prototype._doEncrypt;
})(Crypto);
/*!
* Crypto-JS v2.5.4 PBKDF2.js
* http://code.google.com/p/crypto-js/
* Copyright (c) 2009-2013, Jeff Mott. All rights reserved.
* http://code.google.com/p/crypto-js/wiki/License
*/
(function () {
// Shortcuts
var C = Crypto,
util = C.util,
charenc = C.charenc,
UTF8 = charenc.UTF8,
Binary = charenc.Binary;
C.PBKDF2 = function (password, salt, keylen, options) {
// Convert to byte arrays
if (password.constructor == String) password = UTF8.stringToBytes(password);
if (salt.constructor == String) salt = UTF8.stringToBytes(salt);
/* else, assume byte arrays already */
// Defaults
var hasher = options && options.hasher || C.SHA1,
iterations = options && options.iterations || 1;
// Pseudo-random function
function PRF(password, salt) {
return C.HMAC(hasher, salt, password, {
asBytes: true
});
}
// Generate key
var derivedKeyBytes = [],
blockindex = 1;
while (derivedKeyBytes.length < keylen) {
var block = PRF(password, salt.concat(util.wordsToBytes([blockindex])));
for (var u = block, i = 1; i < iterations; i++) {
u = PRF(password, u);
for (var j = 0; j < block.length; j++) block[j] ^= u[j];
}
derivedKeyBytes = derivedKeyBytes.concat(block);
blockindex++;
}
// Truncate excess bytes
derivedKeyBytes.length = keylen;
return options && options.asBytes ? derivedKeyBytes :
options && options.asString ? Binary.bytesToString(derivedKeyBytes) :
util.bytesToHex(derivedKeyBytes);
};
})();
/*
* Copyright (c) 2010-2011 Intalio Pte, All Rights Reserved
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to deal
* in the Software without restriction, including without limitation the rights
* to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
* copies of the Software, and to permit persons to whom the Software is
* furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included in
* all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
* THE SOFTWARE.
*/
// https://github.com/cheongwy/node-scrypt-js
(function () {
var MAX_VALUE = 2147483647;
var workerUrl = null;
//function scrypt(byte[] passwd, byte[] salt, int N, int r, int p, int dkLen)
/*
* N = Cpu cost
* r = Memory cost
* p = parallelization cost
*
*/
window.Crypto_scrypt = function (passwd, salt, N, r, p, dkLen, callback) {
if (N == 0 || (N & (N - 1)) != 0) throw Error("N must be > 0 and a power of 2");
if (N > MAX_VALUE / 128 / r) throw Error("Parameter N is too large");
if (r > MAX_VALUE / 128 / p) throw Error("Parameter r is too large");
var PBKDF2_opts = {
iterations: 1,
hasher: Crypto.SHA256,
asBytes: true
};
var B = Crypto.PBKDF2(passwd, salt, p * 128 * r, PBKDF2_opts);
try {
var i = 0;
var worksDone = 0;
var makeWorker = function () {
if (!workerUrl) {
var code = '(' + scryptCore.toString() + ')()';
var blob;
try {
blob = new Blob([code], {
type: "text/javascript"
});
} catch (e) {
window.BlobBuilder = window.BlobBuilder || window.WebKitBlobBuilder ||
window.MozBlobBuilder ||
window.MSBlobBuilder;
blob = new BlobBuilder();
blob.append(code);
blob = blob.getBlob("text/javascript");
}
workerUrl = URL.createObjectURL(blob);
}
var worker = new Worker(workerUrl);
worker.onmessage = function (event) {
var Bi = event.data[0],
Bslice = event.data[1];
worksDone++;
if (i < p) {
worker.postMessage([N, r, p, B, i++]);
}
var length = Bslice.length,
destPos = Bi * 128 * r,
srcPos = 0;
while (length--) {
B[destPos++] = Bslice[srcPos++];
}
if (worksDone == p) {
callback(Crypto.PBKDF2(passwd, B, dkLen, PBKDF2_opts));
}
};
return worker;
};
var workers = [makeWorker(), makeWorker()];
workers[0].postMessage([N, r, p, B, i++]);
if (p > 1) {
workers[1].postMessage([N, r, p, B, i++]);
}
} catch (e) {
window.setTimeout(function () {
scryptCore();
callback(Crypto.PBKDF2(passwd, B, dkLen, PBKDF2_opts));
}, 0);
}
// using this function to enclose everything needed to create a worker (but also invokable directly for synchronous use)
function scryptCore() {
var XY = [],
V = [];
if (typeof B === 'undefined') {
onmessage = function (event) {
var data = event.data;
var N = data[0],
r = data[1],
p = data[2],
B = data[3],
i = data[4];
var Bslice = [];
arraycopy32(B, i * 128 * r, Bslice, 0, 128 * r);
smix(Bslice, 0, r, N, V, XY);
postMessage([i, Bslice]);
};
} else {
for (var i = 0; i < p; i++) {
smix(B, i * 128 * r, r, N, V, XY);
}
}
function smix(B, Bi, r, N, V, XY) {
var Xi = 0;
var Yi = 128 * r;
var i;
arraycopy32(B, Bi, XY, Xi, Yi);
for (i = 0; i < N; i++) {
arraycopy32(XY, Xi, V, i * Yi, Yi);
blockmix_salsa8(XY, Xi, Yi, r);
}
for (i = 0; i < N; i++) {
var j = integerify(XY, Xi, r) & (N - 1);
blockxor(V, j * Yi, XY, Xi, Yi);
blockmix_salsa8(XY, Xi, Yi, r);
}
arraycopy32(XY, Xi, B, Bi, Yi);
}
function blockmix_salsa8(BY, Bi, Yi, r) {
var X = [];
var i;
arraycopy32(BY, Bi + (2 * r - 1) * 64, X, 0, 64);
for (i = 0; i < 2 * r; i++) {
blockxor(BY, i * 64, X, 0, 64);
salsa20_8(X);
arraycopy32(X, 0, BY, Yi + (i * 64), 64);
}
for (i = 0; i < r; i++) {
arraycopy32(BY, Yi + (i * 2) * 64, BY, Bi + (i * 64), 64);
}
for (i = 0; i < r; i++) {
arraycopy32(BY, Yi + (i * 2 + 1) * 64, BY, Bi + (i + r) * 64, 64);
}
}
function R(a, b) {
return (a << b) | (a >>> (32 - b));
}
function salsa20_8(B) {
var B32 = new Array(32);
var x = new Array(32);
var i;
for (i = 0; i < 16; i++) {
B32[i] = (B[i * 4 + 0] & 0xff) << 0;
B32[i] |= (B[i * 4 + 1] & 0xff) << 8;
B32[i] |= (B[i * 4 + 2] & 0xff) << 16;
B32[i] |= (B[i * 4 + 3] & 0xff) << 24;
}
arraycopy(B32, 0, x, 0, 16);
for (i = 8; i > 0; i -= 2) {
x[4] ^= R(x[0] + x[12], 7);
x[8] ^= R(x[4] + x[0], 9);
x[12] ^= R(x[8] + x[4], 13);
x[0] ^= R(x[12] + x[8], 18);
x[9] ^= R(x[5] + x[1], 7);
x[13] ^= R(x[9] + x[5], 9);
x[1] ^= R(x[13] + x[9], 13);
x[5] ^= R(x[1] + x[13], 18);
x[14] ^= R(x[10] + x[6], 7);
x[2] ^= R(x[14] + x[10], 9);
x[6] ^= R(x[2] + x[14], 13);
x[10] ^= R(x[6] + x[2], 18);
x[3] ^= R(x[15] + x[11], 7);
x[7] ^= R(x[3] + x[15], 9);
x[11] ^= R(x[7] + x[3], 13);
x[15] ^= R(x[11] + x[7], 18);
x[1] ^= R(x[0] + x[3], 7);
x[2] ^= R(x[1] + x[0], 9);
x[3] ^= R(x[2] + x[1], 13);
x[0] ^= R(x[3] + x[2], 18);
x[6] ^= R(x[5] + x[4], 7);
x[7] ^= R(x[6] + x[5], 9);
x[4] ^= R(x[7] + x[6], 13);
x[5] ^= R(x[4] + x[7], 18);
x[11] ^= R(x[10] + x[9], 7);
x[8] ^= R(x[11] + x[10], 9);
x[9] ^= R(x[8] + x[11], 13);
x[10] ^= R(x[9] + x[8], 18);
x[12] ^= R(x[15] + x[14], 7);
x[13] ^= R(x[12] + x[15], 9);
x[14] ^= R(x[13] + x[12], 13);
x[15] ^= R(x[14] + x[13], 18);
}
for (i = 0; i < 16; ++i) B32[i] = x[i] + B32[i];
for (i = 0; i < 16; i++) {
var bi = i * 4;
B[bi + 0] = (B32[i] >> 0 & 0xff);
B[bi + 1] = (B32[i] >> 8 & 0xff);
B[bi + 2] = (B32[i] >> 16 & 0xff);
B[bi + 3] = (B32[i] >> 24 & 0xff);
}
}
function blockxor(S, Si, D, Di, len) {
var i = len >> 6;
while (i--) {
D[Di++] ^= S[Si++];
D[Di++] ^= S[Si++];
D[Di++] ^= S[Si++];
D[Di++] ^= S[Si++];
D[Di++] ^= S[Si++];
D[Di++] ^= S[Si++];
D[Di++] ^= S[Si++];
D[Di++] ^= S[Si++];
D[Di++] ^= S[Si++];
D[Di++] ^= S[Si++];
D[Di++] ^= S[Si++];
D[Di++] ^= S[Si++];
D[Di++] ^= S[Si++];
D[Di++] ^= S[Si++];
D[Di++] ^= S[Si++];
D[Di++] ^= S[Si++];
D[Di++] ^= S[Si++];
D[Di++] ^= S[Si++];
D[Di++] ^= S[Si++];
D[Di++] ^= S[Si++];
D[Di++] ^= S[Si++];
D[Di++] ^= S[Si++];
D[Di++] ^= S[Si++];
D[Di++] ^= S[Si++];
D[Di++] ^= S[Si++];
D[Di++] ^= S[Si++];
D[Di++] ^= S[Si++];
D[Di++] ^= S[Si++];
D[Di++] ^= S[Si++];
D[Di++] ^= S[Si++];
D[Di++] ^= S[Si++];
D[Di++] ^= S[Si++];
D[Di++] ^= S[Si++];
D[Di++] ^= S[Si++];
D[Di++] ^= S[Si++];
D[Di++] ^= S[Si++];
D[Di++] ^= S[Si++];
D[Di++] ^= S[Si++];
D[Di++] ^= S[Si++];
D[Di++] ^= S[Si++];
D[Di++] ^= S[Si++];
D[Di++] ^= S[Si++];
D[Di++] ^= S[Si++];
D[Di++] ^= S[Si++];
D[Di++] ^= S[Si++];
D[Di++] ^= S[Si++];
D[Di++] ^= S[Si++];
D[Di++] ^= S[Si++];
D[Di++] ^= S[Si++];
D[Di++] ^= S[Si++];
D[Di++] ^= S[Si++];
D[Di++] ^= S[Si++];
D[Di++] ^= S[Si++];
D[Di++] ^= S[Si++];
D[Di++] ^= S[Si++];
D[Di++] ^= S[Si++];
D[Di++] ^= S[Si++];
D[Di++] ^= S[Si++];
D[Di++] ^= S[Si++];
D[Di++] ^= S[Si++];
D[Di++] ^= S[Si++];
D[Di++] ^= S[Si++];
D[Di++] ^= S[Si++];
D[Di++] ^= S[Si++];
}
}
function integerify(B, bi, r) {
var n;
bi += (2 * r - 1) * 64;
n = (B[bi + 0] & 0xff) << 0;
n |= (B[bi + 1] & 0xff) << 8;
n |= (B[bi + 2] & 0xff) << 16;
n |= (B[bi + 3] & 0xff) << 24;
return n;
}
function arraycopy(src, srcPos, dest, destPos, length) {
while (length--) {
dest[destPos++] = src[srcPos++];
}
}
function arraycopy32(src, srcPos, dest, destPos, length) {
var i = length >> 5;
while (i--) {
dest[destPos++] = src[srcPos++];
dest[destPos++] = src[srcPos++];
dest[destPos++] = src[srcPos++];
dest[destPos++] = src[srcPos++];
dest[destPos++] = src[srcPos++];
dest[destPos++] = src[srcPos++];
dest[destPos++] = src[srcPos++];
dest[destPos++] = src[srcPos++];
dest[destPos++] = src[srcPos++];
dest[destPos++] = src[srcPos++];
dest[destPos++] = src[srcPos++];
dest[destPos++] = src[srcPos++];
dest[destPos++] = src[srcPos++];
dest[destPos++] = src[srcPos++];
dest[destPos++] = src[srcPos++];
dest[destPos++] = src[srcPos++];
dest[destPos++] = src[srcPos++];
dest[destPos++] = src[srcPos++];
dest[destPos++] = src[srcPos++];
dest[destPos++] = src[srcPos++];
dest[destPos++] = src[srcPos++];
dest[destPos++] = src[srcPos++];
dest[destPos++] = src[srcPos++];
dest[destPos++] = src[srcPos++];
dest[destPos++] = src[srcPos++];
dest[destPos++] = src[srcPos++];
dest[destPos++] = src[srcPos++];
dest[destPos++] = src[srcPos++];
dest[destPos++] = src[srcPos++];
dest[destPos++] = src[srcPos++];
dest[destPos++] = src[srcPos++];
dest[destPos++] = src[srcPos++];
}
}
} // scryptCore
}; // window.Crypto_scrypt
})();
/*!
* Crypto-JS v2.5.4 AES.js
* http://code.google.com/p/crypto-js/
* Copyright (c) 2009-2013, Jeff Mott. All rights reserved.
* http://code.google.com/p/crypto-js/wiki/License
*/
(function () {
// Shortcuts
var C = Crypto,
util = C.util,
charenc = C.charenc,
UTF8 = charenc.UTF8;
// Precomputed SBOX
var SBOX = [0x63, 0x7c, 0x77, 0x7b, 0xf2, 0x6b, 0x6f, 0xc5,
0x30, 0x01, 0x67, 0x2b, 0xfe, 0xd7, 0xab, 0x76,
0xca, 0x82, 0xc9, 0x7d, 0xfa, 0x59, 0x47, 0xf0,
0xad, 0xd4, 0xa2, 0xaf, 0x9c, 0xa4, 0x72, 0xc0,
0xb7, 0xfd, 0x93, 0x26, 0x36, 0x3f, 0xf7, 0xcc,
0x34, 0xa5, 0xe5, 0xf1, 0x71, 0xd8, 0x31, 0x15,
0x04, 0xc7, 0x23, 0xc3, 0x18, 0x96, 0x05, 0x9a,
0x07, 0x12, 0x80, 0xe2, 0xeb, 0x27, 0xb2, 0x75,
0x09, 0x83, 0x2c, 0x1a, 0x1b, 0x6e, 0x5a, 0xa0,
0x52, 0x3b, 0xd6, 0xb3, 0x29, 0xe3, 0x2f, 0x84,
0x53, 0xd1, 0x00, 0xed, 0x20, 0xfc, 0xb1, 0x5b,
0x6a, 0xcb, 0xbe, 0x39, 0x4a, 0x4c, 0x58, 0xcf,
0xd0, 0xef, 0xaa, 0xfb, 0x43, 0x4d, 0x33, 0x85,
0x45, 0xf9, 0x02, 0x7f, 0x50, 0x3c, 0x9f, 0xa8,
0x51, 0xa3, 0x40, 0x8f, 0x92, 0x9d, 0x38, 0xf5,
0xbc, 0xb6, 0xda, 0x21, 0x10, 0xff, 0xf3, 0xd2,
0xcd, 0x0c, 0x13, 0xec, 0x5f, 0x97, 0x44, 0x17,
0xc4, 0xa7, 0x7e, 0x3d, 0x64, 0x5d, 0x19, 0x73,
0x60, 0x81, 0x4f, 0xdc, 0x22, 0x2a, 0x90, 0x88,
0x46, 0xee, 0xb8, 0x14, 0xde, 0x5e, 0x0b, 0xdb,
0xe0, 0x32, 0x3a, 0x0a, 0x49, 0x06, 0x24, 0x5c,
0xc2, 0xd3, 0xac, 0x62, 0x91, 0x95, 0xe4, 0x79,
0xe7, 0xc8, 0x37, 0x6d, 0x8d, 0xd5, 0x4e, 0xa9,
0x6c, 0x56, 0xf4, 0xea, 0x65, 0x7a, 0xae, 0x08,
0xba, 0x78, 0x25, 0x2e, 0x1c, 0xa6, 0xb4, 0xc6,
0xe8, 0xdd, 0x74, 0x1f, 0x4b, 0xbd, 0x8b, 0x8a,
0x70, 0x3e, 0xb5, 0x66, 0x48, 0x03, 0xf6, 0x0e,
0x61, 0x35, 0x57, 0xb9, 0x86, 0xc1, 0x1d, 0x9e,
0xe1, 0xf8, 0x98, 0x11, 0x69, 0xd9, 0x8e, 0x94,
0x9b, 0x1e, 0x87, 0xe9, 0xce, 0x55, 0x28, 0xdf,
0x8c, 0xa1, 0x89, 0x0d, 0xbf, 0xe6, 0x42, 0x68,
0x41, 0x99, 0x2d, 0x0f, 0xb0, 0x54, 0xbb, 0x16
];
// Compute inverse SBOX lookup table
for (var INVSBOX = [], i = 0; i < 256; i++) INVSBOX[SBOX[i]] = i;
// Compute multiplication in GF(2^8) lookup tables
var MULT2 = [],
MULT3 = [],
MULT9 = [],
MULTB = [],
MULTD = [],
MULTE = [];
function xtime(a, b) {
for (var result = 0, i = 0; i < 8; i++) {
if (b & 1) result ^= a;
var hiBitSet = a & 0x80;
a = (a << 1) & 0xFF;
if (hiBitSet) a ^= 0x1b;
b >>>= 1;
}
return result;
}
for (var i = 0; i < 256; i++) {
MULT2[i] = xtime(i, 2);
MULT3[i] = xtime(i, 3);
MULT9[i] = xtime(i, 9);
MULTB[i] = xtime(i, 0xB);
MULTD[i] = xtime(i, 0xD);
MULTE[i] = xtime(i, 0xE);
}
// Precomputed RCon lookup
var RCON = [0x00, 0x01, 0x02, 0x04, 0x08, 0x10, 0x20, 0x40, 0x80, 0x1b, 0x36];
// Inner state
var state = [
[],
[],
[],
[]
],
keylength,
nrounds,
keyschedule;
var AES = C.AES = {
/**
* Public API
*/
encrypt: function (message, password, options) {
options = options || {};
// Determine mode
var mode = options.mode || new C.mode.OFB;
// Allow mode to override options
if (mode.fixOptions) mode.fixOptions(options);
var
// Convert to bytes if message is a string
m = (
message.constructor == String ?
UTF8.stringToBytes(message) :
message
),
// Generate random IV
iv = options.iv || util.randomBytes(AES._blocksize * 4),
// Generate key
k = (
password.constructor == String ?
// Derive key from pass-phrase
C.PBKDF2(password, iv, 32, {
asBytes: true
}) :
// else, assume byte array representing cryptographic key
password
);
// Encrypt
AES._init(k);
mode.encrypt(AES, m, iv);
// Return ciphertext
m = options.iv ? m : iv.concat(m);
return (options && options.asBytes) ? m : util.bytesToBase64(m);
},
decrypt: function (ciphertext, password, options) {
options = options || {};
// Determine mode
var mode = options.mode || new C.mode.OFB;
// Allow mode to override options
if (mode.fixOptions) mode.fixOptions(options);
var
// Convert to bytes if ciphertext is a string
c = (
ciphertext.constructor == String ?
util.base64ToBytes(ciphertext) :
ciphertext
),
// Separate IV and message
iv = options.iv || c.splice(0, AES._blocksize * 4),
// Generate key
k = (
password.constructor == String ?
// Derive key from pass-phrase
C.PBKDF2(password, iv, 32, {
asBytes: true
}) :
// else, assume byte array representing cryptographic key
password
);
// Decrypt
AES._init(k);
mode.decrypt(AES, c, iv);
// Return plaintext
return (options && options.asBytes) ? c : UTF8.bytesToString(c);
},
/**
* Package private methods and properties
*/
_blocksize: 4,
_encryptblock: function (m, offset) {
// Set input
for (var row = 0; row < AES._blocksize; row++) {
for (var col = 0; col < 4; col++)
state[row][col] = m[offset + col * 4 + row];
}
// Add round key
for (var row = 0; row < 4; row++) {
for (var col = 0; col < 4; col++)
state[row][col] ^= keyschedule[col][row];
}
for (var round = 1; round < nrounds; round++) {
// Sub bytes
for (var row = 0; row < 4; row++) {
for (var col = 0; col < 4; col++)
state[row][col] = SBOX[state[row][col]];
}
// Shift rows
state[1].push(state[1].shift());
state[2].push(state[2].shift());
state[2].push(state[2].shift());
state[3].unshift(state[3].pop());
// Mix columns
for (var col = 0; col < 4; col++) {
var s0 = state[0][col],
s1 = state[1][col],
s2 = state[2][col],
s3 = state[3][col];
state[0][col] = MULT2[s0] ^ MULT3[s1] ^ s2 ^ s3;
state[1][col] = s0 ^ MULT2[s1] ^ MULT3[s2] ^ s3;
state[2][col] = s0 ^ s1 ^ MULT2[s2] ^ MULT3[s3];
state[3][col] = MULT3[s0] ^ s1 ^ s2 ^ MULT2[s3];
}
// Add round key
for (var row = 0; row < 4; row++) {
for (var col = 0; col < 4; col++)
state[row][col] ^= keyschedule[round * 4 + col][row];
}
}
// Sub bytes
for (var row = 0; row < 4; row++) {
for (var col = 0; col < 4; col++)
state[row][col] = SBOX[state[row][col]];
}
// Shift rows
state[1].push(state[1].shift());
state[2].push(state[2].shift());
state[2].push(state[2].shift());
state[3].unshift(state[3].pop());
// Add round key
for (var row = 0; row < 4; row++) {
for (var col = 0; col < 4; col++)
state[row][col] ^= keyschedule[nrounds * 4 + col][row];
}
// Set output
for (var row = 0; row < AES._blocksize; row++) {
for (var col = 0; col < 4; col++)
m[offset + col * 4 + row] = state[row][col];
}
},
_decryptblock: function (c, offset) {
// Set input
for (var row = 0; row < AES._blocksize; row++) {
for (var col = 0; col < 4; col++)
state[row][col] = c[offset + col * 4 + row];
}
// Add round key
for (var row = 0; row < 4; row++) {
for (var col = 0; col < 4; col++)
state[row][col] ^= keyschedule[nrounds * 4 + col][row];
}
for (var round = 1; round < nrounds; round++) {
// Inv shift rows
state[1].unshift(state[1].pop());
state[2].push(state[2].shift());
state[2].push(state[2].shift());
state[3].push(state[3].shift());
// Inv sub bytes
for (var row = 0; row < 4; row++) {
for (var col = 0; col < 4; col++)
state[row][col] = INVSBOX[state[row][col]];
}
// Add round key
for (var row = 0; row < 4; row++) {
for (var col = 0; col < 4; col++)
state[row][col] ^= keyschedule[(nrounds - round) * 4 + col][row];
}
// Inv mix columns
for (var col = 0; col < 4; col++) {
var s0 = state[0][col],
s1 = state[1][col],
s2 = state[2][col],
s3 = state[3][col];
state[0][col] = MULTE[s0] ^ MULTB[s1] ^ MULTD[s2] ^ MULT9[s3];
state[1][col] = MULT9[s0] ^ MULTE[s1] ^ MULTB[s2] ^ MULTD[s3];
state[2][col] = MULTD[s0] ^ MULT9[s1] ^ MULTE[s2] ^ MULTB[s3];
state[3][col] = MULTB[s0] ^ MULTD[s1] ^ MULT9[s2] ^ MULTE[s3];
}
}
// Inv shift rows
state[1].unshift(state[1].pop());
state[2].push(state[2].shift());
state[2].push(state[2].shift());
state[3].push(state[3].shift());
// Inv sub bytes
for (var row = 0; row < 4; row++) {
for (var col = 0; col < 4; col++)
state[row][col] = INVSBOX[state[row][col]];
}
// Add round key
for (var row = 0; row < 4; row++) {
for (var col = 0; col < 4; col++)
state[row][col] ^= keyschedule[col][row];
}
// Set output
for (var row = 0; row < AES._blocksize; row++) {
for (var col = 0; col < 4; col++)
c[offset + col * 4 + row] = state[row][col];
}
},
/**
* Private methods
*/
_init: function (k) {
keylength = k.length / 4;
nrounds = keylength + 6;
AES._keyexpansion(k);
},
// Generate a key schedule
_keyexpansion: function (k) {
keyschedule = [];
for (var row = 0; row < keylength; row++) {
keyschedule[row] = [
k[row * 4],
k[row * 4 + 1],
k[row * 4 + 2],
k[row * 4 + 3]
];
}
for (var row = keylength; row < AES._blocksize * (nrounds + 1); row++) {
var temp = [
keyschedule[row - 1][0],
keyschedule[row - 1][1],
keyschedule[row - 1][2],
keyschedule[row - 1][3]
];
if (row % keylength == 0) {
// Rot word
temp.push(temp.shift());
// Sub word
temp[0] = SBOX[temp[0]];
temp[1] = SBOX[temp[1]];
temp[2] = SBOX[temp[2]];
temp[3] = SBOX[temp[3]];
temp[0] ^= RCON[row / keylength];
} else if (keylength > 6 && row % keylength == 4) {
// Sub word
temp[0] = SBOX[temp[0]];
temp[1] = SBOX[temp[1]];
temp[2] = SBOX[temp[2]];
temp[3] = SBOX[temp[3]];
}
keyschedule[row] = [
keyschedule[row - keylength][0] ^ temp[0],
keyschedule[row - keylength][1] ^ temp[1],
keyschedule[row - keylength][2] ^ temp[2],
keyschedule[row - keylength][3] ^ temp[3]
];
}
}
};
})();
/*
* Copyright (c) 2000 - 2011 The Legion Of The Bouncy Castle (http://www.bouncycastle.org)
* Ported to JavaScript by bitaddress.org
*/
ec.FieldElementFp.fastLucasSequence = function (p, P, Q, k) {
// TODO Research and apply "common-multiplicand multiplication here"
var n = k.bitLength();
var s = k.getLowestSetBit();
var Uh = BigInteger.ONE;
var Vl = BigInteger.TWO;
var Vh = P;
var Ql = BigInteger.ONE;
var Qh = BigInteger.ONE;
for (var j = n - 1; j >= s + 1; --j) {
Ql = Ql.multiply(Qh).mod(p);
if (k.testBit(j)) {
Qh = Ql.multiply(Q).mod(p);
Uh = Uh.multiply(Vh).mod(p);
Vl = Vh.multiply(Vl).subtract(P.multiply(Ql)).mod(p);
Vh = Vh.multiply(Vh).subtract(Qh.shiftLeft(1)).mod(p);
} else {
Qh = Ql;
Uh = Uh.multiply(Vl).subtract(Ql).mod(p);
Vh = Vh.multiply(Vl).subtract(P.multiply(Ql)).mod(p);
Vl = Vl.multiply(Vl).subtract(Ql.shiftLeft(1)).mod(p);
}
}
Ql = Ql.multiply(Qh).mod(p);
Qh = Ql.multiply(Q).mod(p);
Uh = Uh.multiply(Vl).subtract(Ql).mod(p);
Vl = Vh.multiply(Vl).subtract(P.multiply(Ql)).mod(p);
Ql = Ql.multiply(Qh).mod(p);
for (var j = 1; j <= s; ++j) {
Uh = Uh.multiply(Vl).mod(p);
Vl = Vl.multiply(Vl).subtract(Ql.shiftLeft(1)).mod(p);
Ql = Ql.multiply(Ql).mod(p);
}
return [Uh, Vl];
};
// ----------------
// ECPointFp constructor
ec.PointFp = function (curve, x, y, z, compressed) {
this.curve = curve;
this.x = x;
this.y = y;
// Projective coordinates: either zinv == null or z * zinv == 1
// z and zinv are just BigIntegers, not fieldElements
if (z == null) {
this.z = BigInteger.ONE;
} else {
this.z = z;
}
this.zinv = null;
// compression flag
this.compressed = !!compressed;
};
ec.PointFp.prototype.getX = function () {
if (this.zinv == null) {
this.zinv = this.z.modInverse(this.curve.q);
}
var r = this.x.toBigInteger().multiply(this.zinv);
this.curve.reduce(r);
return this.curve.fromBigInteger(r);
};
ec.PointFp.prototype.getY = function () {
if (this.zinv == null) {
this.zinv = this.z.modInverse(this.curve.q);
}
var r = this.y.toBigInteger().multiply(this.zinv);
this.curve.reduce(r);
return this.curve.fromBigInteger(r);
};
ec.PointFp.prototype.equals = function (other) {
if (other == this) return true;
if (this.isInfinity()) return other.isInfinity();
if (other.isInfinity()) return this.isInfinity();
var u, v;
// u = Y2 * Z1 - Y1 * Z2
u = other.y.toBigInteger().multiply(this.z).subtract(this.y.toBigInteger().multiply(other.z)).mod(
this.curve.q);
if (!u.equals(BigInteger.ZERO)) return false;
// v = X2 * Z1 - X1 * Z2
v = other.x.toBigInteger().multiply(this.z).subtract(this.x.toBigInteger().multiply(other.z)).mod(
this.curve.q);
return v.equals(BigInteger.ZERO);
};
ec.PointFp.prototype.isInfinity = function () {
if ((this.x == null) && (this.y == null)) return true;
return this.z.equals(BigInteger.ZERO) && !this.y.toBigInteger().equals(BigInteger.ZERO);
};
ec.PointFp.prototype.negate = function () {
return new ec.PointFp(this.curve, this.x, this.y.negate(), this.z);
};
ec.PointFp.prototype.add = function (b) {
if (this.isInfinity()) return b;
if (b.isInfinity()) return this;
// u = Y2 * Z1 - Y1 * Z2
var u = b.y.toBigInteger().multiply(this.z).subtract(this.y.toBigInteger().multiply(b.z)).mod(
this.curve.q);
// v = X2 * Z1 - X1 * Z2
var v = b.x.toBigInteger().multiply(this.z).subtract(this.x.toBigInteger().multiply(b.z)).mod(
this.curve.q);
if (BigInteger.ZERO.equals(v)) {
if (BigInteger.ZERO.equals(u)) {
return this.twice(); // this == b, so double
}
return this.curve.getInfinity(); // this = -b, so infinity
}
var THREE = new BigInteger("3");
var x1 = this.x.toBigInteger();
var y1 = this.y.toBigInteger();
var x2 = b.x.toBigInteger();
var y2 = b.y.toBigInteger();
var v2 = v.square();
var v3 = v2.multiply(v);
var x1v2 = x1.multiply(v2);
var zu2 = u.square().multiply(this.z);
// x3 = v * (z2 * (z1 * u^2 - 2 * x1 * v^2) - v^3)
var x3 = zu2.subtract(x1v2.shiftLeft(1)).multiply(b.z).subtract(v3).multiply(v).mod(this.curve.q);
// y3 = z2 * (3 * x1 * u * v^2 - y1 * v^3 - z1 * u^3) + u * v^3
var y3 = x1v2.multiply(THREE).multiply(u).subtract(y1.multiply(v3)).subtract(zu2.multiply(u))
.multiply(
b.z).add(u.multiply(v3)).mod(this.curve.q);
// z3 = v^3 * z1 * z2
var z3 = v3.multiply(this.z).multiply(b.z).mod(this.curve.q);
return new ec.PointFp(this.curve, this.curve.fromBigInteger(x3), this.curve.fromBigInteger(y3),
z3);
};
ec.PointFp.prototype.twice = function () {
if (this.isInfinity()) return this;
if (this.y.toBigInteger().signum() == 0) return this.curve.getInfinity();
// TODO: optimized handling of constants
var THREE = new BigInteger("3");
var x1 = this.x.toBigInteger();
var y1 = this.y.toBigInteger();
var y1z1 = y1.multiply(this.z);
var y1sqz1 = y1z1.multiply(y1).mod(this.curve.q);
var a = this.curve.a.toBigInteger();
// w = 3 * x1^2 + a * z1^2
var w = x1.square().multiply(THREE);
if (!BigInteger.ZERO.equals(a)) {
w = w.add(this.z.square().multiply(a));
}
w = w.mod(this.curve.q);
//this.curve.reduce(w);
// x3 = 2 * y1 * z1 * (w^2 - 8 * x1 * y1^2 * z1)
var x3 = w.square().subtract(x1.shiftLeft(3).multiply(y1sqz1)).shiftLeft(1).multiply(y1z1).mod(
this.curve.q);
// y3 = 4 * y1^2 * z1 * (3 * w * x1 - 2 * y1^2 * z1) - w^3
var y3 = w.multiply(THREE).multiply(x1).subtract(y1sqz1.shiftLeft(1)).shiftLeft(2).multiply(
y1sqz1).subtract(w.square().multiply(w)).mod(this.curve.q);
// z3 = 8 * (y1 * z1)^3
var z3 = y1z1.square().multiply(y1z1).shiftLeft(3).mod(this.curve.q);
return new ec.PointFp(this.curve, this.curve.fromBigInteger(x3), this.curve.fromBigInteger(y3),
z3);
};
// Simple NAF (Non-Adjacent Form) multiplication algorithm
// TODO: modularize the multiplication algorithm
ec.PointFp.prototype.multiply = function (k) {
if (this.isInfinity()) return this;
if (k.signum() == 0) return this.curve.getInfinity();
var e = k;
var h = e.multiply(new BigInteger("3"));
var neg = this.negate();
var R = this;
var i;
for (i = h.bitLength() - 2; i > 0; --i) {
R = R.twice();
var hBit = h.testBit(i);
var eBit = e.testBit(i);
if (hBit != eBit) {
R = R.add(hBit ? this : neg);
}
}
return R;
};
// Compute this*j + x*k (simultaneous multiplication)
ec.PointFp.prototype.multiplyTwo = function (j, x, k) {
var i;
if (j.bitLength() > k.bitLength())
i = j.bitLength() - 1;
else
i = k.bitLength() - 1;
var R = this.curve.getInfinity();
var both = this.add(x);
while (i >= 0) {
R = R.twice();
if (j.testBit(i)) {
if (k.testBit(i)) {
R = R.add(both);
} else {
R = R.add(this);
}
} else {
if (k.testBit(i)) {
R = R.add(x);
}
}
--i;
}
return R;
};
// patched by bitaddress.org and Casascius for use with Bitcoin.ECKey
// patched by coretechs to support compressed public keys
ec.PointFp.prototype.getEncoded = function (compressed) {
var x = this.getX().toBigInteger();
var y = this.getY().toBigInteger();
var len =
32; // integerToBytes will zero pad if integer is less than 32 bytes. 32 bytes length is required by the Bitcoin protocol.
var enc = ec.integerToBytes(x, len);
// when compressed prepend byte depending if y point is even or odd
if (compressed) {
if (y.isEven()) {
enc.unshift(0x02);
} else {
enc.unshift(0x03);
}
} else {
enc.unshift(0x04);
enc = enc.concat(ec.integerToBytes(y,
len)); // uncompressed public key appends the bytes of the y point
}
return enc;
};
ec.PointFp.decodeFrom = function (curve, enc) {
var type = enc[0];
var dataLen = enc.length - 1;
// Extract x and y as byte arrays
var xBa = enc.slice(1, 1 + dataLen / 2);
var yBa = enc.slice(1 + dataLen / 2, 1 + dataLen);
// Prepend zero byte to prevent interpretation as negative integer
xBa.unshift(0);
yBa.unshift(0);
// Convert to BigIntegers
var x = new BigInteger(xBa);
var y = new BigInteger(yBa);
// Return point
return new ec.PointFp(curve, curve.fromBigInteger(x), curve.fromBigInteger(y));
};
ec.PointFp.prototype.add2D = function (b) {
if (this.isInfinity()) return b;
if (b.isInfinity()) return this;
if (this.x.equals(b.x)) {
if (this.y.equals(b.y)) {
// this = b, i.e. this must be doubled
return this.twice();
}
// this = -b, i.e. the result is the point at infinity
return this.curve.getInfinity();
}
var x_x = b.x.subtract(this.x);
var y_y = b.y.subtract(this.y);
var gamma = y_y.divide(x_x);
var x3 = gamma.square().subtract(this.x).subtract(b.x);
var y3 = gamma.multiply(this.x.subtract(x3)).subtract(this.y);
return new ec.PointFp(this.curve, x3, y3);
};
ec.PointFp.prototype.twice2D = function () {
if (this.isInfinity()) return this;
if (this.y.toBigInteger().signum() == 0) {
// if y1 == 0, then (x1, y1) == (x1, -y1)
// and hence this = -this and thus 2(x1, y1) == infinity
return this.curve.getInfinity();
}
var TWO = this.curve.fromBigInteger(BigInteger.valueOf(2));
var THREE = this.curve.fromBigInteger(BigInteger.valueOf(3));
var gamma = this.x.square().multiply(THREE).add(this.curve.a).divide(this.y.multiply(TWO));
var x3 = gamma.square().subtract(this.x.multiply(TWO));
var y3 = gamma.multiply(this.x.subtract(x3)).subtract(this.y);
return new ec.PointFp(this.curve, x3, y3);
};
ec.PointFp.prototype.multiply2D = function (k) {
if (this.isInfinity()) return this;
if (k.signum() == 0) return this.curve.getInfinity();
var e = k;
var h = e.multiply(new BigInteger("3"));
var neg = this.negate();
var R = this;
var i;
for (i = h.bitLength() - 2; i > 0; --i) {
R = R.twice();
var hBit = h.testBit(i);
var eBit = e.testBit(i);
if (hBit != eBit) {
R = R.add2D(hBit ? this : neg);
}
}
return R;
};
ec.PointFp.prototype.isOnCurve = function () {
var x = this.getX().toBigInteger();
var y = this.getY().toBigInteger();
var a = this.curve.getA().toBigInteger();
var b = this.curve.getB().toBigInteger();
var n = this.curve.getQ();
var lhs = y.multiply(y).mod(n);
var rhs = x.multiply(x).multiply(x).add(a.multiply(x)).add(b).mod(n);
return lhs.equals(rhs);
};
ec.PointFp.prototype.toString = function () {
return '(' + this.getX().toBigInteger().toString() + ',' + this.getY().toBigInteger().toString() +
')';
};
/**
* Validate an elliptic curve point.
*
* See SEC 1, section 3.2.2.1: Elliptic Curve Public Key Validation Primitive
*/
ec.PointFp.prototype.validate = function () {
var n = this.curve.getQ();
// Check Q != O
if (this.isInfinity()) {
throw new Error("Point is at infinity.");
}
// Check coordinate bounds
var x = this.getX().toBigInteger();
var y = this.getY().toBigInteger();
if (x.compareTo(BigInteger.ONE) < 0 || x.compareTo(n.subtract(BigInteger.ONE)) > 0) {
throw new Error('x coordinate out of bounds');
}
if (y.compareTo(BigInteger.ONE) < 0 || y.compareTo(n.subtract(BigInteger.ONE)) > 0) {
throw new Error('y coordinate out of bounds');
}
// Check y^2 = x^3 + ax + b (mod n)
if (!this.isOnCurve()) {
throw new Error("Point is not on the curve.");
}
// Check nQ = 0 (Q is a scalar multiple of G)
if (this.multiply(n).isInfinity()) {
// TODO: This check doesn't work - fix.
throw new Error("Point is not a scalar multiple of G.");
}
return true;
};
// ----------------
// ECCurveFp constructor
ec.CurveFp = function (q, a, b) {
this.q = q;
this.a = this.fromBigInteger(a);
this.b = this.fromBigInteger(b);
this.infinity = new ec.PointFp(this, null, null);
this.reducer = new Barrett(this.q);
}
ec.CurveFp.prototype.getQ = function () {
return this.q;
};
ec.CurveFp.prototype.getA = function () {
return this.a;
};
ec.CurveFp.prototype.getB = function () {
return this.b;
};
ec.CurveFp.prototype.equals = function (other) {
if (other == this) return true;
return (this.q.equals(other.q) && this.a.equals(other.a) && this.b.equals(other.b));
};
ec.CurveFp.prototype.getInfinity = function () {
return this.infinity;
};
ec.CurveFp.prototype.fromBigInteger = function (x) {
return new ec.FieldElementFp(this.q, x);
};
ec.CurveFp.prototype.reduce = function (x) {
this.reducer.reduce(x);
};
// for now, work with hex strings because they're easier in JS
// compressed support added by bitaddress.org
ec.CurveFp.prototype.decodePointHex = function (s) {
var firstByte = parseInt(s.substr(0, 2), 16);
switch (firstByte) { // first byte
case 0:
return this.infinity;
case 2: // compressed
case 3: // compressed
var yTilde = firstByte & 1;
var xHex = s.substr(2, s.length - 2);
var X1 = new BigInteger(xHex, 16);
return this.decompressPoint(yTilde, X1);
case 4: // uncompressed
case 6: // hybrid
case 7: // hybrid
var len = (s.length - 2) / 2;
var xHex = s.substr(2, len);
var yHex = s.substr(len + 2, len);
return new ec.PointFp(this,
this.fromBigInteger(new BigInteger(xHex, 16)),
this.fromBigInteger(new BigInteger(yHex, 16)));
default: // unsupported
return null;
}
};
ec.CurveFp.prototype.encodePointHex = function (p) {
if (p.isInfinity()) return "00";
var xHex = p.getX().toBigInteger().toString(16);
var yHex = p.getY().toBigInteger().toString(16);
var oLen = this.getQ().toString(16).length;
if ((oLen % 2) != 0) oLen++;
while (xHex.length < oLen) {
xHex = "0" + xHex;
}
while (yHex.length < oLen) {
yHex = "0" + yHex;
}
return "04" + xHex + yHex;
};
/*
* Copyright (c) 2000 - 2011 The Legion Of The Bouncy Castle (http://www.bouncycastle.org)
* Ported to JavaScript by bitaddress.org
*
* Number yTilde
* BigInteger X1
*/
ec.CurveFp.prototype.decompressPoint = function (yTilde, X1) {
var x = this.fromBigInteger(X1);
var alpha = x.multiply(x.square().add(this.getA())).add(this.getB());
var beta = alpha.sqrt();
// if we can't find a sqrt we haven't got a point on the curve - run!
if (beta == null) throw new Error("Invalid point compression");
var betaValue = beta.toBigInteger();
var bit0 = betaValue.testBit(0) ? 1 : 0;
if (bit0 != yTilde) {
// Use the other root
beta = this.fromBigInteger(this.getQ().subtract(betaValue));
}
return new ec.PointFp(this, x, beta, null, true);
};
ec.fromHex = function (s) {
return new BigInteger(s, 16);
};
ec.integerToBytes = function (i, len) {
var bytes = i.toByteArrayUnsigned();
if (len < bytes.length) {
bytes = bytes.slice(bytes.length - len);
} else
while (len > bytes.length) {
bytes.unshift(0);
}
return bytes;
};
// Named EC curves
// ----------------
// X9ECParameters constructor
ec.X9Parameters = function (curve, g, n, h) {
this.curve = curve;
this.g = g;
this.n = n;
this.h = h;
}
ec.X9Parameters.prototype.getCurve = function () {
return this.curve;
};
ec.X9Parameters.prototype.getG = function () {
return this.g;
};
ec.X9Parameters.prototype.getN = function () {
return this.n;
};
ec.X9Parameters.prototype.getH = function () {
return this.h;
};
// secp256k1 is the Curve used by Bitcoin
ec.secNamedCurves = {
// used by Bitcoin
"secp256k1": function () {
// p = 2^256 - 2^32 - 2^9 - 2^8 - 2^7 - 2^6 - 2^4 - 1
var p = ec.fromHex("FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEFFFFFC2F");
var a = BigInteger.ZERO;
var b = ec.fromHex("7");
var n = ec.fromHex("FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEBAAEDCE6AF48A03BBFD25E8CD0364141");
var h = BigInteger.ONE;
var curve = new ec.CurveFp(p, a, b);
var G = curve.decodePointHex("04" +
"79BE667EF9DCBBAC55A06295CE870B07029BFCDB2DCE28D959F2815B16F81798" +
"483ADA7726A3C4655DA4FBFC0E1108A8FD17B448A68554199C47D08FFB10D4B8");
return new ec.X9Parameters(curve, G, n, h);
}
};
// secp256k1 called by Bitcoin's ECKEY
ec.getSECCurveByName = function (name) {
if (ec.secNamedCurves[name] == undefined) return null;
return ec.secNamedCurves[name]();
}
})();
//bitTrx.js
(function () {
var bitjs = window.bitjs = function () {};
/* public vars */
bitjs.pub = 0x23; // flochange - changed the prefix to FLO Mainnet PublicKey Prefix 0x23
bitjs.priv = 0xa3; //flochange - changed the prefix to FLO Mainnet Private key prefix 0xa3
bitjs.compressed = false;
/* provide a privkey and return an WIF */
bitjs.privkey2wif = function (h) {
var r = Crypto.util.hexToBytes(h);
if (bitjs.compressed == true) {
r.push(0x01);
}
r.unshift(bitjs.priv);
var hash = Crypto.SHA256(Crypto.SHA256(r, {
asBytes: true
}), {
asBytes: true
});
var checksum = hash.slice(0, 4);
return B58.encode(r.concat(checksum));
}
/* convert a wif key back to a private key */
bitjs.wif2privkey = function (wif) {
var compressed = false;
var decode = B58.decode(wif);
var key = decode.slice(0, decode.length - 4);
key = key.slice(1, key.length);
if (key.length >= 33 && key[key.length - 1] == 0x01) {
key = key.slice(0, key.length - 1);
compressed = true;
}
return {
'privkey': Crypto.util.bytesToHex(key),
'compressed': compressed
};
}
/* convert a wif to a pubkey */
bitjs.wif2pubkey = function (wif) {
var compressed = bitjs.compressed;
var r = bitjs.wif2privkey(wif);
bitjs.compressed = r['compressed'];
var pubkey = bitjs.newPubkey(r['privkey']);
bitjs.compressed = compressed;
return {
'pubkey': pubkey,
'compressed': r['compressed']
};
}
/* convert a wif to a address */
bitjs.wif2address = function (wif) {
var r = bitjs.wif2pubkey(wif);
return {
'address': bitjs.pubkey2address(r['pubkey']),
'compressed': r['compressed']
};
}
/* generate a public key from a private key */
bitjs.newPubkey = function (hash) {
var privateKeyBigInt = BigInteger.fromByteArrayUnsigned(Crypto.util.hexToBytes(hash));
var curve = EllipticCurve.getSECCurveByName("secp256k1");
var curvePt = curve.getG().multiply(privateKeyBigInt);
var x = curvePt.getX().toBigInteger();
var y = curvePt.getY().toBigInteger();
var publicKeyBytes = EllipticCurve.integerToBytes(x, 32);
publicKeyBytes = publicKeyBytes.concat(EllipticCurve.integerToBytes(y, 32));
publicKeyBytes.unshift(0x04);
if (bitjs.compressed == true) {
var publicKeyBytesCompressed = EllipticCurve.integerToBytes(x, 32)
if (y.isEven()) {
publicKeyBytesCompressed.unshift(0x02)
} else {
publicKeyBytesCompressed.unshift(0x03)
}
return Crypto.util.bytesToHex(publicKeyBytesCompressed);
} else {
return Crypto.util.bytesToHex(publicKeyBytes);
}
}
/* provide a public key and return address */
bitjs.pubkey2address = function (h, byte) {
var r = ripemd160(Crypto.SHA256(Crypto.util.hexToBytes(h), {
asBytes: true
}));
r.unshift(byte || bitjs.pub);
var hash = Crypto.SHA256(Crypto.SHA256(r, {
asBytes: true
}), {
asBytes: true
});
var checksum = hash.slice(0, 4);
return B58.encode(r.concat(checksum));
}
bitjs.transaction = function () {
var btrx = {};
btrx.version = 2; //flochange look at this version
btrx.inputs = [];
btrx.outputs = [];
btrx.locktime = 0;
btrx.floData = ""; //flochange .. look at this
btrx.addinput = function (txid, index, scriptPubKey, sequence) {
var o = {};
o.outpoint = {
'hash': txid,
'index': index
};
//o.script = []; Signature and Public Key should be added after singning
o.script = Crypto.util.hexToBytes(scriptPubKey); //push previous output pubkey script
o.sequence = sequence || ((btrx.locktime == 0) ? 4294967295 : 0);
return this.inputs.push(o);
}
btrx.addoutput = function (address, value) {
var o = {};
var buf = [];
var addrDecoded = btrx.addressDecode(address);
o.value = new BigInteger('' + Math.round((value * 1) * 1e8), 10);
buf.push(118); //OP_DUP
buf.push(169); //OP_HASH160
buf.push(addrDecoded.length);
buf = buf.concat(addrDecoded); // address in bytes
buf.push(136); //OP_EQUALVERIFY
buf.push(172); // OP_CHECKSIG
o.script = buf;
return this.outputs.push(o);
}
btrx.addflodata = function (txcomments) { // flochange - this whole function needs to be done
this.floData = txcomments;
return this
.floData; //flochange .. returning the txcomments -- check if the function return will assign
}
// Only standard addresses
btrx.addressDecode = function (address) {
var bytes = B58.decode(address);
var front = bytes.slice(0, bytes.length - 4);
var back = bytes.slice(bytes.length - 4);
var checksum = Crypto.SHA256(Crypto.SHA256(front, {
asBytes: true
}), {
asBytes: true
}).slice(0, 4);
if (checksum + "" == back + "") {
return front.slice(1);
}
}
/* generate the transaction hash to sign from a transaction input */
btrx.transactionHash = function (index, sigHashType) {
var clone = bitjs.clone(this);
var shType = sigHashType || 1;
/* black out all other ins, except this one */
for (var i = 0; i < clone.inputs.length; i++) {
if (index != i) {
clone.inputs[i].script = [];
}
}
if ((clone.inputs) && clone.inputs[index]) {
/* SIGHASH : For more info on sig hashs see https://en.bitcoin.it/wiki/OP_CHECKSIG
and https://bitcoin.org/en/developer-guide#signature-hash-type */
if (shType == 1) {
//SIGHASH_ALL 0x01
} else if (shType == 2) {
//SIGHASH_NONE 0x02
clone.outputs = [];
for (var i = 0; i < clone.inputs.length; i++) {
if (index != i) {
clone.inputs[i].sequence = 0;
}
}
} else if (shType == 3) {
//SIGHASH_SINGLE 0x03
clone.outputs.length = index + 1;
for (var i = 0; i < index; i++) {
clone.outputs[i].value = -1;
clone.outputs[i].script = [];
}
for (var i = 0; i < clone.inputs.length; i++) {
if (index != i) {
clone.inputs[i].sequence = 0;
}
}
} else if (shType >= 128) {
//SIGHASH_ANYONECANPAY 0x80
clone.inputs = [clone.inputs[index]];
if (shType == 129) {
// SIGHASH_ALL + SIGHASH_ANYONECANPAY
} else if (shType == 130) {
// SIGHASH_NONE + SIGHASH_ANYONECANPAY
clone.outputs = [];
} else if (shType == 131) {
// SIGHASH_SINGLE + SIGHASH_ANYONECANPAY
clone.outputs.length = index + 1;
for (var i = 0; i < index; i++) {
clone.outputs[i].value = -1;
clone.outputs[i].script = [];
}
}
}
var buffer = Crypto.util.hexToBytes(clone.serialize());
buffer = buffer.concat(bitjs.numToBytes(parseInt(shType), 4));
var hash = Crypto.SHA256(buffer, {
asBytes: true
});
var r = Crypto.util.bytesToHex(Crypto.SHA256(hash, {
asBytes: true
}));
return r;
} else {
return false;
}
}
/* generate a signature from a transaction hash */
btrx.transactionSig = function (index, wif, sigHashType, txhash) {
function serializeSig(r, s) {
var rBa = r.toByteArraySigned();
var sBa = s.toByteArraySigned();
var sequence = [];
sequence.push(0x02); // INTEGER
sequence.push(rBa.length);
sequence = sequence.concat(rBa);
sequence.push(0x02); // INTEGER
sequence.push(sBa.length);
sequence = sequence.concat(sBa);
sequence.unshift(sequence.length);
sequence.unshift(0x30); // SEQUENCE
return sequence;
}
var shType = sigHashType || 1;
var hash = txhash || Crypto.util.hexToBytes(this.transactionHash(index, shType));
if (hash) {
var curve = EllipticCurve.getSECCurveByName("secp256k1");
var key = bitjs.wif2privkey(wif);
var priv = BigInteger.fromByteArrayUnsigned(Crypto.util.hexToBytes(key['privkey']));
var n = curve.getN();
var e = BigInteger.fromByteArrayUnsigned(hash);
var badrs = 0
do {
var k = this.deterministicK(wif, hash, badrs);
var G = curve.getG();
var Q = G.multiply(k);
var r = Q.getX().toBigInteger().mod(n);
var s = k.modInverse(n).multiply(e.add(priv.multiply(r))).mod(n);
badrs++
} while (r.compareTo(BigInteger.ZERO) <= 0 || s.compareTo(BigInteger.ZERO) <= 0);
// Force lower s values per BIP62
var halfn = n.shiftRight(1);
if (s.compareTo(halfn) > 0) {
s = n.subtract(s);
};
var sig = serializeSig(r, s);
sig.push(parseInt(shType, 10));
return Crypto.util.bytesToHex(sig);
} else {
return false;
}
}
// https://tools.ietf.org/html/rfc6979#section-3.2
btrx.deterministicK = function (wif, hash, badrs) {
// if r or s were invalid when this function was used in signing,
// we do not want to actually compute r, s here for efficiency, so,
// we can increment badrs. explained at end of RFC 6979 section 3.2
// wif is b58check encoded wif privkey.
// hash is byte array of transaction digest.
// badrs is used only if the k resulted in bad r or s.
// some necessary things out of the way for clarity.
badrs = badrs || 0;
var key = bitjs.wif2privkey(wif);
var x = Crypto.util.hexToBytes(key['privkey'])
var curve = EllipticCurve.getSECCurveByName("secp256k1");
var N = curve.getN();
// Step: a
// hash is a byteArray of the message digest. so h1 == hash in our case
// Step: b
var v = [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1
];
// Step: c
var k = [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0
];
// Step: d
k = Crypto.HMAC(Crypto.SHA256, v.concat([0]).concat(x).concat(hash), k, {
asBytes: true
});
// Step: e
v = Crypto.HMAC(Crypto.SHA256, v, k, {
asBytes: true
});
// Step: f
k = Crypto.HMAC(Crypto.SHA256, v.concat([1]).concat(x).concat(hash), k, {
asBytes: true
});
// Step: g
v = Crypto.HMAC(Crypto.SHA256, v, k, {
asBytes: true
});
// Step: h1
var T = [];
// Step: h2 (since we know tlen = qlen, just copy v to T.)
v = Crypto.HMAC(Crypto.SHA256, v, k, {
asBytes: true
});
T = v;
// Step: h3
var KBigInt = BigInteger.fromByteArrayUnsigned(T);
// loop if KBigInt is not in the range of [1, N-1] or if badrs needs incrementing.
var i = 0
while (KBigInt.compareTo(N) >= 0 || KBigInt.compareTo(BigInteger.ZERO) <= 0 || i <
badrs) {
k = Crypto.HMAC(Crypto.SHA256, v.concat([0]), k, {
asBytes: true
});
v = Crypto.HMAC(Crypto.SHA256, v, k, {
asBytes: true
});
v = Crypto.HMAC(Crypto.SHA256, v, k, {
asBytes: true
});
T = v;
KBigInt = BigInteger.fromByteArrayUnsigned(T);
i++
};
return KBigInt;
};
/* sign a "standard" input */
btrx.signinput = function (index, wif, sigHashType) {
var key = bitjs.wif2pubkey(wif);
var shType = sigHashType || 1;
var signature = this.transactionSig(index, wif, shType);
var buf = [];
var sigBytes = Crypto.util.hexToBytes(signature);
buf.push(sigBytes.length);
buf = buf.concat(sigBytes);
var pubKeyBytes = Crypto.util.hexToBytes(key['pubkey']);
buf.push(pubKeyBytes.length);
buf = buf.concat(pubKeyBytes);
this.inputs[index].script = buf;
return true;
}
/* sign inputs */
btrx.sign = function (wif, sigHashType) {
var shType = sigHashType || 1;
for (var i = 0; i < this.inputs.length; i++) {
this.signinput(i, wif, shType);
}
return this.serialize();
}
/* serialize a transaction */
btrx.serialize = function () {
var buffer = [];
buffer = buffer.concat(bitjs.numToBytes(parseInt(this.version), 4));
buffer = buffer.concat(bitjs.numToVarInt(this.inputs.length));
for (var i = 0; i < this.inputs.length; i++) {
var txin = this.inputs[i];
buffer = buffer.concat(Crypto.util.hexToBytes(txin.outpoint.hash).reverse());
buffer = buffer.concat(bitjs.numToBytes(parseInt(txin.outpoint.index), 4));
var scriptBytes = txin.script;
buffer = buffer.concat(bitjs.numToVarInt(scriptBytes.length));
buffer = buffer.concat(scriptBytes);
buffer = buffer.concat(bitjs.numToBytes(parseInt(txin.sequence), 4));
}
buffer = buffer.concat(bitjs.numToVarInt(this.outputs.length));
for (var i = 0; i < this.outputs.length; i++) {
var txout = this.outputs[i];
buffer = buffer.concat(bitjs.numToBytes(txout.value, 8));
var scriptBytes = txout.script;
buffer = buffer.concat(bitjs.numToVarInt(scriptBytes.length));
buffer = buffer.concat(scriptBytes);
}
buffer = buffer.concat(bitjs.numToBytes(parseInt(this.locktime), 4));
flohex = ascii_to_hexa(this.floData);
floDataCount = this.floData.length;
//flochange -- creating unique data character count logic for floData. This string is prefixed before actual floData string in Raw Transaction
if (floDataCount <= 16) {
floDataCountString = floDataCount.toString(16);
floDataCountString = "0" + floDataCountString;
} else if (floDataCount < 253) {
floDataCountString = floDataCount.toString(16);
} else if (floDataCount <= 1023) {
floDataCountAdjusted = (floDataCount - 253) + parseInt("0xfd00fd");
floDataCountStringAdjusted = floDataCountAdjusted.toString(16);
floDataCountString = floDataCountStringAdjusted.substr(0, 2) +
floDataCountStringAdjusted.substr(4, 2) + floDataCountStringAdjusted.substr(2, 2);
} else {
floDataCountString = "Character Limit Exceeded";
}
return Crypto.util.bytesToHex(buffer) + floDataCountString +
flohex; // flochange -- Addition of floDataCountString and floData in serialization
}
return btrx;
}
bitjs.numToBytes = function (num, bytes) {
if (typeof bytes === "undefined") bytes = 8;
if (bytes == 0) {
return [];
} else if (num == -1) {
return Crypto.util.hexToBytes("ffffffffffffffff");
} else {
return [num % 256].concat(bitjs.numToBytes(Math.floor(num / 256), bytes - 1));
}
}
bitjs.numToByteArray = function (num) {
if (num <= 256) {
return [num];
} else {
return [num % 256].concat(bitjs.numToByteArray(Math.floor(num / 256)));
}
}
bitjs.numToVarInt = function (num) {
if (num < 253) {
return [num];
} else if (num < 65536) {
return [253].concat(bitjs.numToBytes(num, 2));
} else if (num < 4294967296) {
return [254].concat(bitjs.numToBytes(num, 4));
} else {
return [255].concat(bitjs.numToBytes(num, 8));
}
}
bitjs.bytesToNum = function (bytes) {
if (bytes.length == 0) return 0;
else return bytes[0] + 256 * bitjs.bytesToNum(bytes.slice(1));
}
/* clone an object */
bitjs.clone = function (obj) {
if (obj == null || typeof (obj) != 'object') return obj;
var temp = new obj.constructor();
for (var key in obj) {
if (obj.hasOwnProperty(key)) {
temp[key] = bitjs.clone(obj[key]);
}
}
return temp;
}
var B58 = bitjs.Base58 = {
alphabet: "123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz",
validRegex: /^[1-9A-HJ-NP-Za-km-z]+$/,
base: BigInteger.valueOf(58),
/**
* Convert a byte array to a base58-encoded string.
*
* Written by Mike Hearn for BitcoinJ.
* Copyright (c) 2011 Google Inc.
*
* Ported to JavaScript by Stefan Thomas.
*/
encode: function (input) {
var bi = BigInteger.fromByteArrayUnsigned(input);
var chars = [];
while (bi.compareTo(B58.base) >= 0) {
var mod = bi.mod(B58.base);
chars.unshift(B58.alphabet[mod.intValue()]);
bi = bi.subtract(mod).divide(B58.base);
}
chars.unshift(B58.alphabet[bi.intValue()]);
// Convert leading zeros too.
for (var i = 0; i < input.length; i++) {
if (input[i] == 0x00) {
chars.unshift(B58.alphabet[0]);
} else break;
}
return chars.join('');
},
/**
* Convert a base58-encoded string to a byte array.
*
* Written by Mike Hearn for BitcoinJ.
* Copyright (c) 2011 Google Inc.
*
* Ported to JavaScript by Stefan Thomas.
*/
decode: function (input) {
var bi = BigInteger.valueOf(0);
var leadingZerosNum = 0;
for (var i = input.length - 1; i >= 0; i--) {
var alphaIndex = B58.alphabet.indexOf(input[i]);
if (alphaIndex < 0) {
throw "Invalid character";
}
bi = bi.add(BigInteger.valueOf(alphaIndex)
.multiply(B58.base.pow(input.length - 1 - i)));
// This counts leading zero bytes
if (input[i] == "1") leadingZerosNum++;
else leadingZerosNum = 0;
}
var bytes = bi.toByteArrayUnsigned();
// Add leading zeros
while (leadingZerosNum-- > 0) bytes.unshift(0);
return bytes;
}
}
return bitjs;
})();
/*
Copyright (c) 2011 Stefan Thomas
Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
*/
//https://raw.github.com/bitcoinjs/bitcoinjs-lib/1a7fc9d063f864058809d06ef4542af40be3558f/src/bitcoin.js
(function (exports) {
var Bitcoin = exports;
})(
'object' === typeof module ? module.exports : (window.Bitcoin = {})
);
//https://raw.github.com/bitcoinjs/bitcoinjs-lib/c952aaeb3ee472e3776655b8ea07299ebed702c7/src/base58.js
(function (Bitcoin) {
Bitcoin.Base58 = {
alphabet: "123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz",
validRegex: /^[1-9A-HJ-NP-Za-km-z]+$/,
base: BigInteger.valueOf(58),
/**
* Convert a byte array to a base58-encoded string.
*
* Written by Mike Hearn for BitcoinJ.
* Copyright (c) 2011 Google Inc.
*
* Ported to JavaScript by Stefan Thomas.
*/
encode: function (input) {
var bi = BigInteger.fromByteArrayUnsigned(input);
var chars = [];
while (bi.compareTo(B58.base) >= 0) {
var mod = bi.mod(B58.base);
chars.unshift(B58.alphabet[mod.intValue()]);
bi = bi.subtract(mod).divide(B58.base);
}
chars.unshift(B58.alphabet[bi.intValue()]);
// Convert leading zeros too.
for (var i = 0; i < input.length; i++) {
if (input[i] == 0x00) {
chars.unshift(B58.alphabet[0]);
} else break;
}
return chars.join('');
},
/**
* Convert a base58-encoded string to a byte array.
*
* Written by Mike Hearn for BitcoinJ.
* Copyright (c) 2011 Google Inc.
*
* Ported to JavaScript by Stefan Thomas.
*/
decode: function (input) {
var bi = BigInteger.valueOf(0);
var leadingZerosNum = 0;
for (var i = input.length - 1; i >= 0; i--) {
var alphaIndex = B58.alphabet.indexOf(input[i]);
if (alphaIndex < 0) {
throw "Invalid character";
}
bi = bi.add(BigInteger.valueOf(alphaIndex)
.multiply(B58.base.pow(input.length - 1 - i)));
// This counts leading zero bytes
if (input[i] == "1") leadingZerosNum++;
else leadingZerosNum = 0;
}
var bytes = bi.toByteArrayUnsigned();
// Add leading zeros
while (leadingZerosNum-- > 0) bytes.unshift(0);
return bytes;
}
};
var B58 = Bitcoin.Base58;
})(
'undefined' != typeof Bitcoin ? Bitcoin : module.exports
);
//https://raw.github.com/bitcoinjs/bitcoinjs-lib/09e8c6e184d6501a0c2c59d73ca64db5c0d3eb95/src/address.js
Bitcoin.Address = function (bytes) {
if (floGlobals.blockchain == "FLO")
this.version = 0x23; // FLO mainnet public address
else if (floGlobals.blockchain == "FLO_TEST")
this.version = 0x73; // FLO testnet public address
if ("string" == typeof bytes) {
bytes = Bitcoin.Address.decodeString(bytes, this.version);
}
this.hash = bytes;
};
Bitcoin.Address.networkVersion =
0x23; // (FLO mainnet 0x23, 35D), (Bitcoin Mainnet, 0x00, 0D) // *this has no effect *
/**
* Serialize this object as a standard Bitcoin address.
*
* Returns the address as a base58-encoded string in the standardized format.
*/
Bitcoin.Address.prototype.toString = function () {
// Get a copy of the hash
var hash = this.hash.slice(0);
// Version
hash.unshift(this.version);
var checksum = Crypto.SHA256(Crypto.SHA256(hash, {
asBytes: true
}), {
asBytes: true
});
var bytes = hash.concat(checksum.slice(0, 4));
return Bitcoin.Base58.encode(bytes);
};
Bitcoin.Address.prototype.getHashBase64 = function () {
return Crypto.util.bytesToBase64(this.hash);
};
/**
* Parse a Bitcoin address contained in a string.
*/
Bitcoin.Address.decodeString = function (string, version) {
var bytes = Bitcoin.Base58.decode(string);
var hash = bytes.slice(0, 21);
var checksum = Crypto.SHA256(Crypto.SHA256(hash, {
asBytes: true
}), {
asBytes: true
});
if (checksum[0] != bytes[21] ||
checksum[1] != bytes[22] ||
checksum[2] != bytes[23] ||
checksum[3] != bytes[24]) {
throw "Checksum validation failed!";
}
if (version != hash.shift()) {
throw "Version " + hash.shift() + " not supported!";
}
return hash;
};
//https://raw.github.com/bitcoinjs/bitcoinjs-lib/e90780d3d3b8fc0d027d2bcb38b80479902f223e/src/ecdsa.js
Bitcoin.ECDSA = (function () {
var ecparams = EllipticCurve.getSECCurveByName("secp256k1");
var rng = new SecureRandom();
var P_OVER_FOUR = null;
function implShamirsTrick(P, k, Q, l) {
var m = Math.max(k.bitLength(), l.bitLength());
var Z = P.add2D(Q);
var R = P.curve.getInfinity();
for (var i = m - 1; i >= 0; --i) {
R = R.twice2D();
R.z = BigInteger.ONE;
if (k.testBit(i)) {
if (l.testBit(i)) {
R = R.add2D(Z);
} else {
R = R.add2D(P);
}
} else {
if (l.testBit(i)) {
R = R.add2D(Q);
}
}
}
return R;
};
var ECDSA = {
getBigRandom: function (limit) {
return new BigInteger(limit.bitLength(), rng)
.mod(limit.subtract(BigInteger.ONE))
.add(BigInteger.ONE);
},
sign: function (hash, priv) {
var d = priv;
var n = ecparams.getN();
var e = BigInteger.fromByteArrayUnsigned(hash);
do {
var k = ECDSA.getBigRandom(n);
var G = ecparams.getG();
var Q = G.multiply(k);
var r = Q.getX().toBigInteger().mod(n);
} while (r.compareTo(BigInteger.ZERO) <= 0);
var s = k.modInverse(n).multiply(e.add(d.multiply(r))).mod(n);
return ECDSA.serializeSig(r, s);
},
verify: function (hash, sig, pubkey) {
var r, s;
if (Bitcoin.Util.isArray(sig)) {
var obj = ECDSA.parseSig(sig);
r = obj.r;
s = obj.s;
} else if ("object" === typeof sig && sig.r && sig.s) {
r = sig.r;
s = sig.s;
} else {
throw "Invalid value for signature";
}
var Q;
if (pubkey instanceof ec.PointFp) {
Q = pubkey;
} else if (Bitcoin.Util.isArray(pubkey)) {
Q = EllipticCurve.PointFp.decodeFrom(ecparams.getCurve(), pubkey);
} else {
throw "Invalid format for pubkey value, must be byte array or ec.PointFp";
}
var e = BigInteger.fromByteArrayUnsigned(hash);
return ECDSA.verifyRaw(e, r, s, Q);
},
verifyRaw: function (e, r, s, Q) {
var n = ecparams.getN();
var G = ecparams.getG();
if (r.compareTo(BigInteger.ONE) < 0 ||
r.compareTo(n) >= 0)
return false;
if (s.compareTo(BigInteger.ONE) < 0 ||
s.compareTo(n) >= 0)
return false;
var c = s.modInverse(n);
var u1 = e.multiply(c).mod(n);
var u2 = r.multiply(c).mod(n);
// TODO(!!!): For some reason Shamir's trick isn't working with
// signed message verification!? Probably an implementation
// error!
//var point = implShamirsTrick(G, u1, Q, u2);
var point = G.multiply(u1).add(Q.multiply(u2));
var v = point.getX().toBigInteger().mod(n);
return v.equals(r);
},
/**
* Serialize a signature into DER format.
*
* Takes two BigIntegers representing r and s and returns a byte array.
*/
serializeSig: function (r, s) {
var rBa = r.toByteArraySigned();
var sBa = s.toByteArraySigned();
var sequence = [];
sequence.push(0x02); // INTEGER
sequence.push(rBa.length);
sequence = sequence.concat(rBa);
sequence.push(0x02); // INTEGER
sequence.push(sBa.length);
sequence = sequence.concat(sBa);
sequence.unshift(sequence.length);
sequence.unshift(0x30); // SEQUENCE
return sequence;
},
/**
* Parses a byte array containing a DER-encoded signature.
*
* This function will return an object of the form:
*
* {
* r: BigInteger,
* s: BigInteger
* }
*/
parseSig: function (sig) {
var cursor;
if (sig[0] != 0x30)
throw new Error("Signature not a valid DERSequence");
cursor = 2;
if (sig[cursor] != 0x02)
throw new Error("First element in signature must be a DERInteger");;
var rBa = sig.slice(cursor + 2, cursor + 2 + sig[cursor + 1]);
cursor += 2 + sig[cursor + 1];
if (sig[cursor] != 0x02)
throw new Error("Second element in signature must be a DERInteger");
var sBa = sig.slice(cursor + 2, cursor + 2 + sig[cursor + 1]);
cursor += 2 + sig[cursor + 1];
//if (cursor != sig.length)
// throw new Error("Extra bytes in signature");
var r = BigInteger.fromByteArrayUnsigned(rBa);
var s = BigInteger.fromByteArrayUnsigned(sBa);
return {
r: r,
s: s
};
},
parseSigCompact: function (sig) {
if (sig.length !== 65) {
throw "Signature has the wrong length";
}
// Signature is prefixed with a type byte storing three bits of
// information.
var i = sig[0] - 27;
if (i < 0 || i > 7) {
throw "Invalid signature type";
}
var n = ecparams.getN();
var r = BigInteger.fromByteArrayUnsigned(sig.slice(1, 33)).mod(n);
var s = BigInteger.fromByteArrayUnsigned(sig.slice(33, 65)).mod(n);
return {
r: r,
s: s,
i: i
};
},
/**
* Recover a public key from a signature.
*
* See SEC 1: Elliptic Curve Cryptography, section 4.1.6, "Public
* Key Recovery Operation".
*
* http://www.secg.org/download/aid-780/sec1-v2.pdf
*/
recoverPubKey: function (r, s, hash, i) {
// The recovery parameter i has two bits.
i = i & 3;
// The less significant bit specifies whether the y coordinate
// of the compressed point is even or not.
var isYEven = i & 1;
// The more significant bit specifies whether we should use the
// first or second candidate key.
var isSecondKey = i >> 1;
var n = ecparams.getN();
var G = ecparams.getG();
var curve = ecparams.getCurve();
var p = curve.getQ();
var a = curve.getA().toBigInteger();
var b = curve.getB().toBigInteger();
// We precalculate (p + 1) / 4 where p is if the field order
if (!P_OVER_FOUR) {
P_OVER_FOUR = p.add(BigInteger.ONE).divide(BigInteger.valueOf(4));
}
// 1.1 Compute x
var x = isSecondKey ? r.add(n) : r;
// 1.3 Convert x to point
var alpha = x.multiply(x).multiply(x).add(a.multiply(x)).add(b).mod(p);
var beta = alpha.modPow(P_OVER_FOUR, p);
var xorOdd = beta.isEven() ? (i % 2) : ((i + 1) % 2);
// If beta is even, but y isn't or vice versa, then convert it,
// otherwise we're done and y == beta.
var y = (beta.isEven() ? !isYEven : isYEven) ? beta : p.subtract(beta);
// 1.4 Check that nR is at infinity
var R = new EllipticCurve.PointFp(curve,
curve.fromBigInteger(x),
curve.fromBigInteger(y));
R.validate();
// 1.5 Compute e from M
var e = BigInteger.fromByteArrayUnsigned(hash);
var eNeg = BigInteger.ZERO.subtract(e).mod(n);
// 1.6 Compute Q = r^-1 (sR - eG)
var rInv = r.modInverse(n);
var Q = implShamirsTrick(R, s, G, eNeg).multiply(rInv);
Q.validate();
if (!ECDSA.verifyRaw(e, r, s, Q)) {
throw "Pubkey recovery unsuccessful";
}
var pubKey = new Bitcoin.ECKey();
pubKey.pub = Q;
return pubKey;
},
/**
* Calculate pubkey extraction parameter.
*
* When extracting a pubkey from a signature, we have to
* distinguish four different cases. Rather than putting this
* burden on the verifier, Bitcoin includes a 2-bit value with the
* signature.
*
* This function simply tries all four cases and returns the value
* that resulted in a successful pubkey recovery.
*/
calcPubkeyRecoveryParam: function (address, r, s, hash) {
for (var i = 0; i < 4; i++) {
try {
var pubkey = Bitcoin.ECDSA.recoverPubKey(r, s, hash, i);
if (pubkey.getBitcoinAddress().toString() == address) {
return i;
}
} catch (e) {}
}
throw "Unable to find valid recovery factor";
}
};
return ECDSA;
})();
Bitcoin.KeyPool = (function () {
var KeyPool = function () {
this.keyArray = [];
this.push = function (item) {
if (item == null || item.priv == null) return;
var doAdd = true;
// prevent duplicates from being added to the array
for (var index in this.keyArray) {
var currentItem = this.keyArray[index];
if (currentItem != null && currentItem.priv != null && item.getBitcoinAddress() ==
currentItem.getBitcoinAddress()) {
doAdd = false;
break;
}
}
if (doAdd) this.keyArray.push(item);
};
this.reset = function () {
this.keyArray = [];
};
this.getArray = function () {
// copy array
return this.keyArray.slice(0);
};
this.setArray = function (ka) {
this.keyArray = ka;
};
this.length = function () {
return this.keyArray.length;
};
this.toString = function () {
var keyPoolString = "# = " + this.length() + "\n";
var pool = this.getArray();
for (var index in pool) {
var item = pool[index];
if (Bitcoin.Util.hasMethods(item, 'getBitcoinAddress', 'toString')) {
if (item != null) {
keyPoolString += "\"" + item.getBitcoinAddress() + "\"" + ", \"" + item
.toString("wif") + "\"\n";
}
}
}
return keyPoolString;
};
return this;
};
return new KeyPool();
})();
Bitcoin.Bip38Key = (function () {
var Bip38 = function (address, encryptedKey) {
this.address = address;
this.priv = encryptedKey;
};
Bip38.prototype.getBitcoinAddress = function () {
return this.address;
};
Bip38.prototype.toString = function () {
return this.priv;
};
return Bip38;
})();
//https://raw.github.com/pointbiz/bitcoinjs-lib/9b2f94a028a7bc9bed94e0722563e9ff1d8e8db8/src/eckey.js
Bitcoin.ECKey = (function () {
var ECDSA = Bitcoin.ECDSA;
var KeyPool = Bitcoin.KeyPool;
var ecparams = EllipticCurve.getSECCurveByName("secp256k1");
var ECKey = function (input) {
if (!input) {
// Generate new key
var n = ecparams.getN();
this.priv = ECDSA.getBigRandom(n);
} else if (input instanceof BigInteger) {
// Input is a private key value
this.priv = input;
} else if (Bitcoin.Util.isArray(input)) {
// Prepend zero byte to prevent interpretation as negative integer
this.priv = BigInteger.fromByteArrayUnsigned(input);
} else if ("string" == typeof input) {
var bytes = null;
try {
// This part is edited for FLO. FLO WIF are always compressed WIF. FLO WIF (private key) starts with R for mainnet and c for testnet.
if (((floGlobals.blockchain == "FLO") &&
/^R[123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz]{51}$/.test(
input)) ||
((floGlobals.blockchain == "FLO_TEST") &&
/^c[123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz]{51}$/.test(
input))) {
bytes = ECKey.decodeCompressedWalletImportFormat(input);
this.compressed = true;
} else if (ECKey.isHexFormat(input)) {
bytes = Crypto.util.hexToBytes(input);
}
/*
if (ECKey.isWalletImportFormat(input)) {
bytes = ECKey.decodeWalletImportFormat(input);
} else if (ECKey.isCompressedWalletImportFormat(input)) {
bytes = ECKey.decodeCompressedWalletImportFormat(input);
this.compressed = true;
} else if (ECKey.isMiniFormat(input)) {
bytes = Crypto.SHA256(input, { asBytes: true });
} else if (ECKey.isHexFormat(input)) {
bytes = Crypto.util.hexToBytes(input);
} else if (ECKey.isBase64Format(input)) {
bytes = Crypto.util.base64ToBytes(input);
}
*/
} catch (exc1) {
this.setError(exc1);
}
if (ECKey.isBase6Format(input)) {
this.priv = new BigInteger(input, 6);
} else if (bytes == null || bytes.length != 32) {
this.priv = null;
} else {
// Prepend zero byte to prevent interpretation as negative integer
this.priv = BigInteger.fromByteArrayUnsigned(bytes);
}
}
this.compressed = (this.compressed == undefined) ? !!ECKey.compressByDefault : this.compressed;
try {
// check not zero
if (this.priv != null && BigInteger.ZERO.compareTo(this.priv) == 0) this.setError(
"Error: BigInteger equal to zero.");
// valid range [0x1, 0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEBAAEDCE6AF48A03BBFD25E8CD0364140])
var hexKeyRangeLimit = "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEBAAEDCE6AF48A03BBFD25E8CD0364140";
var rangeLimitBytes = Crypto.util.hexToBytes(hexKeyRangeLimit);
var limitBigInt = BigInteger.fromByteArrayUnsigned(rangeLimitBytes);
if (this.priv != null && limitBigInt.compareTo(this.priv) < 0) this.setError(
"Error: BigInteger outside of curve range.")
if (this.priv != null) {
KeyPool.push(this);
}
} catch (exc2) {
this.setError(exc2);
}
};
if (floGlobals.blockchain == "FLO")
ECKey.privateKeyPrefix = 0xA3; //(Bitcoin mainnet 0x80 testnet 0xEF) (FLO mainnet 0xA3 163 D)
else if (floGlobals.blockchain == "FLO_TEST")
ECKey.privateKeyPrefix = 0xEF; //FLO testnet
/**
* Whether public keys should be returned compressed by default.
*/
ECKey.compressByDefault = false;
/**
* Set whether the public key should be returned compressed or not.
*/
ECKey.prototype.setError = function (err) {
this.error = err;
this.priv = null;
return this;
};
/**
* Set whether the public key should be returned compressed or not.
*/
ECKey.prototype.setCompressed = function (v) {
this.compressed = !!v;
if (this.pubPoint) this.pubPoint.compressed = this.compressed;
return this;
};
/*
* Return public key as a byte array in DER encoding
*/
ECKey.prototype.getPub = function () {
if (this.compressed) {
if (this.pubComp) return this.pubComp;
return this.pubComp = this.getPubPoint().getEncoded(1);
} else {
if (this.pubUncomp) return this.pubUncomp;
return this.pubUncomp = this.getPubPoint().getEncoded(0);
}
};
/**
* Return public point as ECPoint object.
*/
ECKey.prototype.getPubPoint = function () {
if (!this.pubPoint) {
this.pubPoint = ecparams.getG().multiply(this.priv);
this.pubPoint.compressed = this.compressed;
}
return this.pubPoint;
};
ECKey.prototype.getPubKeyHex = function () {
if (this.compressed) {
if (this.pubKeyHexComp) return this.pubKeyHexComp;
return this.pubKeyHexComp = Crypto.util.bytesToHex(this.getPub()).toString().toUpperCase();
} else {
if (this.pubKeyHexUncomp) return this.pubKeyHexUncomp;
return this.pubKeyHexUncomp = Crypto.util.bytesToHex(this.getPub()).toString()
.toUpperCase();
}
};
/**
* Get the pubKeyHash for this key.
*
* This is calculated as RIPE160(SHA256([encoded pubkey])) and returned as
* a byte array.
*/
ECKey.prototype.getPubKeyHash = function () {
if (this.compressed) {
if (this.pubKeyHashComp) return this.pubKeyHashComp;
return this.pubKeyHashComp = Bitcoin.Util.sha256ripe160(this.getPub());
} else {
if (this.pubKeyHashUncomp) return this.pubKeyHashUncomp;
return this.pubKeyHashUncomp = Bitcoin.Util.sha256ripe160(this.getPub());
}
};
ECKey.prototype.getBitcoinAddress = function () {
var hash = this.getPubKeyHash();
var addr = new Bitcoin.Address(hash);
return addr.toString();
};
/*
* Takes a public point as a hex string or byte array
*/
ECKey.prototype.setPub = function (pub) {
// byte array
if (Bitcoin.Util.isArray(pub)) {
pub = Crypto.util.bytesToHex(pub).toString().toUpperCase();
}
var ecPoint = ecparams.getCurve().decodePointHex(pub);
this.setCompressed(ecPoint.compressed);
this.pubPoint = ecPoint;
return this;
};
// Sipa Private Key Wallet Import Format
ECKey.prototype.getBitcoinWalletImportFormat = function () {
var bytes = this.getBitcoinPrivateKeyByteArray();
if (bytes == null) return "";
bytes.unshift(ECKey.privateKeyPrefix); // prepend 0x80 byte
if (this.compressed) bytes.push(0x01); // append 0x01 byte for compressed format
var checksum = Crypto.SHA256(Crypto.SHA256(bytes, {
asBytes: true
}), {
asBytes: true
});
bytes = bytes.concat(checksum.slice(0, 4));
var privWif = Bitcoin.Base58.encode(bytes);
return privWif;
};
// Private Key Hex Format
ECKey.prototype.getBitcoinHexFormat = function () {
return Crypto.util.bytesToHex(this.getBitcoinPrivateKeyByteArray()).toString().toUpperCase();
};
// Private Key Base64 Format
ECKey.prototype.getBitcoinBase64Format = function () {
return Crypto.util.bytesToBase64(this.getBitcoinPrivateKeyByteArray());
};
ECKey.prototype.getBitcoinPrivateKeyByteArray = function () {
if (this.priv == null) return null;
// Get a copy of private key as a byte array
var bytes = this.priv.toByteArrayUnsigned();
// zero pad if private key is less than 32 bytes
while (bytes.length < 32) bytes.unshift(0x00);
return bytes;
};
ECKey.prototype.toString = function (format) {
format = format || "";
if (format.toString().toLowerCase() == "base64" || format.toString().toLowerCase() == "b64") {
return this.getBitcoinBase64Format();
}
// Wallet Import Format
else if (format.toString().toLowerCase() == "wif") {
return this.getBitcoinWalletImportFormat();
} else {
return this.getBitcoinHexFormat();
}
};
ECKey.prototype.sign = function (hash) {
return ECDSA.sign(hash, this.priv);
};
ECKey.prototype.verify = function (hash, sig) {
return ECDSA.verify(hash, sig, this.getPub());
};
/**
* Parse a wallet import format private key contained in a string.
*/
ECKey.decodeWalletImportFormat = function (privStr) {
var bytes = Bitcoin.Base58.decode(privStr);
var hash = bytes.slice(0, 33);
var checksum = Crypto.SHA256(Crypto.SHA256(hash, {
asBytes: true
}), {
asBytes: true
});
if (checksum[0] != bytes[33] ||
checksum[1] != bytes[34] ||
checksum[2] != bytes[35] ||
checksum[3] != bytes[36]) {
throw "Checksum validation failed!";
}
var version = hash.shift();
if (version != ECKey.privateKeyPrefix) {
throw "Version " + version + " not supported!";
}
return hash;
};
/**
* Parse a compressed wallet import format private key contained in a string.
*/
ECKey.decodeCompressedWalletImportFormat = function (privStr) {
var bytes = Bitcoin.Base58.decode(privStr);
var hash = bytes.slice(0, 34);
var checksum = Crypto.SHA256(Crypto.SHA256(hash, {
asBytes: true
}), {
asBytes: true
});
if (checksum[0] != bytes[34] ||
checksum[1] != bytes[35] ||
checksum[2] != bytes[36] ||
checksum[3] != bytes[37]) {
throw "Checksum validation failed!";
}
var version = hash.shift();
if (version != ECKey.privateKeyPrefix) {
throw "Version " + version + " not supported!";
}
hash.pop();
return hash;
};
// 64 characters [0-9A-F]
ECKey.isHexFormat = function (key) {
key = key.toString();
return /^[A-Fa-f0-9]{64}$/.test(key);
};
// 51 characters base58, always starts with a '5'
ECKey.isWalletImportFormat = function (key) {
key = key.toString();
return (ECKey.privateKeyPrefix == 0x80) ?
(/^5[123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz]{50}$/.test(key)) :
(/^R[123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz]{50}$/.test(key));
};
// 52 characters base58
ECKey.isCompressedWalletImportFormat = function (key) {
key = key.toString();
return (ECKey.privateKeyPrefix == 0x80) ?
(/^[LK][123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz]{51}$/.test(key)) :
(/^R[123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz]{51}$/.test(key));
};
// 44 characters
ECKey.isBase64Format = function (key) {
key = key.toString();
return (/^[ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789=+\/]{44}$/.test(key));
};
// 99 characters, 1=1, if using dice convert 6 to 0
ECKey.isBase6Format = function (key) {
key = key.toString();
return (/^[012345]{99}$/.test(key));
};
// 22, 26 or 30 characters, always starts with an 'S'
ECKey.isMiniFormat = function (key) {
key = key.toString();
var validChars22 = /^S[123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz]{21}$/.test(
key);
var validChars26 = /^S[123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz]{25}$/.test(
key);
var validChars30 = /^S[123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz]{29}$/.test(
key);
var testBytes = Crypto.SHA256(key + "?", {
asBytes: true
});
return ((testBytes[0] === 0x00 || testBytes[0] === 0x01) && (validChars22 || validChars26 ||
validChars30));
};
return ECKey;
})();
//https://raw.github.com/bitcoinjs/bitcoinjs-lib/09e8c6e184d6501a0c2c59d73ca64db5c0d3eb95/src/util.js
// Bitcoin utility functions
Bitcoin.Util = {
/**
* Cross-browser compatibility version of Array.isArray.
*/
isArray: Array.isArray || function (o) {
return Object.prototype.toString.call(o) === '[object Array]';
},
/**
* Create an array of a certain length filled with a specific value.
*/
makeFilledArray: function (len, val) {
var array = [];
var i = 0;
while (i < len) {
array[i++] = val;
}
return array;
},
/**
* Turn an integer into a "var_int".
*
* "var_int" is a variable length integer used by Bitcoin's binary format.
*
* Returns a byte array.
*/
numToVarInt: function (i) {
if (i < 0xfd) {
// unsigned char
return [i];
} else if (i <= 1 << 16) {
// unsigned short (LE)
return [0xfd, i >>> 8, i & 255];
} else if (i <= 1 << 32) {
// unsigned int (LE)
return [0xfe].concat(Crypto.util.wordsToBytes([i]));
} else {
// unsigned long long (LE)
return [0xff].concat(Crypto.util.wordsToBytes([i >>> 32, i]));
}
},
/**
* Parse a Bitcoin value byte array, returning a BigInteger.
*/
valueToBigInt: function (valueBuffer) {
if (valueBuffer instanceof BigInteger) return valueBuffer;
// Prepend zero byte to prevent interpretation as negative integer
return BigInteger.fromByteArrayUnsigned(valueBuffer);
},
/**
* Format a Bitcoin value as a string.
*
* Takes a BigInteger or byte-array and returns that amount of Bitcoins in a
* nice standard formatting.
*
* Examples:
* 12.3555
* 0.1234
* 900.99998888
* 34.00
*/
formatValue: function (valueBuffer) {
var value = this.valueToBigInt(valueBuffer).toString();
var integerPart = value.length > 8 ? value.substr(0, value.length - 8) : '0';
var decimalPart = value.length > 8 ? value.substr(value.length - 8) : value;
while (decimalPart.length < 8) decimalPart = "0" + decimalPart;
decimalPart = decimalPart.replace(/0*$/, '');
while (decimalPart.length < 2) decimalPart += "0";
return integerPart + "." + decimalPart;
},
/**
* Parse a floating point string as a Bitcoin value.
*
* Keep in mind that parsing user input is messy. You should always display
* the parsed value back to the user to make sure we understood his input
* correctly.
*/
parseValue: function (valueString) {
// TODO: Detect other number formats (e.g. comma as decimal separator)
var valueComp = valueString.split('.');
var integralPart = valueComp[0];
var fractionalPart = valueComp[1] || "0";
while (fractionalPart.length < 8) fractionalPart += "0";
fractionalPart = fractionalPart.replace(/^0+/g, '');
var value = BigInteger.valueOf(parseInt(integralPart));
value = value.multiply(BigInteger.valueOf(100000000));
value = value.add(BigInteger.valueOf(parseInt(fractionalPart)));
return value;
},
/**
* Calculate RIPEMD160(SHA256(data)).
*
* Takes an arbitrary byte array as inputs and returns the hash as a byte
* array.
*/
sha256ripe160: function (data) {
return ripemd160(Crypto.SHA256(data, {
asBytes: true
}), {
asBytes: true
});
},
// double sha256
dsha256: function (data) {
return Crypto.SHA256(Crypto.SHA256(data, {
asBytes: true
}), {
asBytes: true
});
},
// duck typing method
hasMethods: function (obj /*, method list as strings */ ) {
var i = 1,
methodName;
while ((methodName = arguments[i++])) {
if (typeof obj[methodName] != 'function') {
return false;
}
}
return true;
}
};
(function (ellipticCurveType) {
//Defining Elliptic Encryption Object
var ellipticEncryption = window.ellipticCurveEncryption = function () {};
ellipticEncryption.rng = new SecureRandom();
ellipticEncryption.getCurveParameters = function (curveName) {
//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();
};
ellipticEncryption.receiverRandom = function () {
//This is receivers private key. For now we will use random. CHANGE IT LATER
var r = this.pick_rand();
return r.toString();
}
ellipticEncryption.senderPublicString = function (senderPrivateKey) {
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;
}
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!
bytesPerChar: 2,
maxBytesPerChar: 6, // Math.pow(256,7) > Math.pow(2,53)
// Primitive polynomials (in decimal form) for Galois Fields GF(2^n), for 2 <= n <= 30
// The index of each term in the array corresponds to the n for that polynomial
// i.e. to get the polynomial for n=16, use primitivePolynomials[16]
primitivePolynomials: [null, null, 1, 3, 3, 5, 3, 3, 29, 17, 9, 5, 83, 27, 43, 3, 45, 9, 39, 39,
9, 5, 3, 33, 27, 9, 71, 39, 9, 5, 83
],
// warning for insecure PRNG
warning: 'WARNING:\nA secure random number generator was not found.\nUsing Math.random(), which is NOT cryptographically strong!'
};
// Protected settings object
var config = {};
/** @expose **/
exports.getConfig = function () {
return {
'bits': config.bits,
'unsafePRNG': config.unsafePRNG
};
};
function init(bits) {
if (bits && (typeof bits !== 'number' || bits % 1 !== 0 || bits < defaults.minBits || bits >
defaults.maxBits)) {
throw new Error('Number of bits must be an integer between ' + defaults.minBits + ' and ' +
defaults.maxBits + ', inclusive.')
}
config.radix = defaults.radix;
config.bits = bits || defaults.bits;
config.size = Math.pow(2, config.bits);
config.max = config.size - 1;
// Construct the exp and log tables for multiplication.
var logs = [],
exps = [],
x = 1,
primitive = defaults.primitivePolynomials[config.bits];
for (var i = 0; i < config.size; i++) {
exps[i] = x;
logs[x] = i;
x <<= 1;
if (x >= config.size) {
x ^= primitive;
x &= config.max;
}
}
config.logs = logs;
config.exps = exps;
};
/** @expose **/
exports.init = init;
function isInited() {
if (!config.bits || !config.size || !config.max || !config.logs || !config.exps || config.logs
.length !==
config.size || config.exps.length !== config.size) {
return false;
}
return true;
};
// Returns a pseudo-random number generator of the form function(bits){}
// which should output a random string of 1's and 0's of length `bits`
function getRNG() {
var randomBits, crypto;
function construct(bits, arr, radix, size) {
var str = '',
i = 0,
len = arr.length - 1;
while (i < len || (str.length < bits)) {
str += padLeft(parseInt(arr[i], radix).toString(2), size);
i++;
}
str = str.substr(-bits);
if ((str.match(/0/g) || []).length === str.length) { // all zeros?
return null;
} else {
return str;
}
}
// node.js crypto.randomBytes()
if (typeof require === 'function' && (crypto = require('crypto')) && (randomBits = crypto[
'randomBytes'])) {
return function (bits) {
var bytes = Math.ceil(bits / 8),
str = null;
while (str === null) {
str = construct(bits, randomBits(bytes).toString('hex'), 16, 4);
}
return str;
}
}
// browsers with window.crypto.getRandomValues()
if (global['crypto'] && typeof global['crypto']['getRandomValues'] === 'function' && typeof global[
'Uint32Array'] === 'function') {
crypto = global['crypto'];
return function (bits) {
var elems = Math.ceil(bits / 32),
str = null,
arr = new global['Uint32Array'](elems);
while (str === null) {
crypto['getRandomValues'](arr);
str = construct(bits, arr, 10, 32);
}
return str;
}
}
// A totally insecure RNG!!! (except in Safari)
// Will produce a warning every time it is called.
config.unsafePRNG = true;
warn();
var bitsPerNum = 32;
var max = Math.pow(2, bitsPerNum) - 1;
return function (bits) {
var elems = Math.ceil(bits / bitsPerNum);
var arr = [],
str = null;
while (str === null) {
for (var i = 0; i < elems; i++) {
arr[i] = Math.floor(Math.random() * max + 1);
}
str = construct(bits, arr, 10, bitsPerNum);
}
return str;
};
};
// Warn about using insecure rng.
// Called when Math.random() is being used.
function warn() {
global['console']['warn'](defaults.warning);
if (typeof global['alert'] === 'function' && config.alert) {
global['alert'](defaults.warning);
}
}
// Set the PRNG to use. If no RNG function is supplied, pick a default using getRNG()
/** @expose **/
exports.setRNG = function (rng, alert) {
if (!isInited()) {
this.init();
}
config.unsafePRNG = false;
rng = rng || getRNG();
// test the RNG (5 times)
if (typeof rng !== 'function' || typeof rng(config.bits) !== 'string' || !parseInt(rng(config.bits),
2) || rng(config.bits).length > config.bits || rng(config.bits).length < config.bits) {
throw new Error(
"Random number generator is invalid. Supply an RNG of the form function(bits){} that returns a string containing 'bits' number of random 1's and 0's."
)
} else {
config.rng = rng;
}
config.alert = !!alert;
return !!config.unsafePRNG;
};
function isSetRNG() {
return typeof config.rng === 'function';
};
// Generates a random bits-length number string using the PRNG
/** @expose **/
exports.random = function (bits) {
if (!isSetRNG()) {
this.setRNG();
}
if (typeof bits !== 'number' || bits % 1 !== 0 || bits < 2) {
throw new Error('Number of bits must be an integer greater than 1.')
}
if (config.unsafePRNG) {
warn();
}
return bin2hex(config.rng(bits));
}
// Divides a `secret` number String str expressed in radix `inputRadix` (optional, default 16)
// into `numShares` shares, each expressed in radix `outputRadix` (optional, default to `inputRadix`),
// requiring `threshold` number of shares to reconstruct the secret.
// Optionally, zero-pads the secret to a length that is a multiple of padLength before sharing.
/** @expose **/
exports.share = function (secret, numShares, threshold, padLength, withoutPrefix) {
if (!isInited()) {
this.init();
}
if (!isSetRNG()) {
this.setRNG();
}
padLength = padLength || 0;
if (typeof secret !== 'string') {
throw new Error('Secret must be a string.');
}
if (typeof numShares !== 'number' || numShares % 1 !== 0 || numShares < 2) {
throw new Error('Number of shares must be an integer between 2 and 2^bits-1 (' + config.max +
'), inclusive.')
}
if (numShares > config.max) {
var neededBits = Math.ceil(Math.log(numShares + 1) / Math.LN2);
throw new Error('Number of shares must be an integer between 2 and 2^bits-1 (' + config.max +
'), inclusive. To create ' + numShares + ' shares, use at least ' + neededBits +
' bits.')
}
if (typeof threshold !== 'number' || threshold % 1 !== 0 || threshold < 2) {
throw new Error('Threshold number of shares must be an integer between 2 and 2^bits-1 (' +
config.max + '), inclusive.');
}
if (threshold > config.max) {
var neededBits = Math.ceil(Math.log(threshold + 1) / Math.LN2);
throw new Error('Threshold number of shares must be an integer between 2 and 2^bits-1 (' +
config.max + '), inclusive. To use a threshold of ' + threshold +
', use at least ' + neededBits + ' bits.');
}
if (typeof padLength !== 'number' || padLength % 1 !== 0) {
throw new Error('Zero-pad length must be an integer greater than 1.');
}
if (config.unsafePRNG) {
warn();
}
secret = '1' + hex2bin(
secret); // append a 1 so that we can preserve the correct number of leading zeros in our secret
secret = split(secret, padLength);
var x = new Array(numShares),
y = new Array(numShares);
for (var i = 0, len = secret.length; i < len; i++) {
var subShares = this._getShares(secret[i], numShares, threshold);
for (var j = 0; j < numShares; j++) {
x[j] = x[j] || subShares[j].x.toString(config.radix);
y[j] = padLeft(subShares[j].y.toString(2)) + (y[j] ? y[j] : '');
}
}
var padding = config.max.toString(config.radix).length;
if (withoutPrefix) {
for (var i = 0; i < numShares; i++) {
x[i] = bin2hex(y[i]);
}
} else {
for (var i = 0; i < numShares; i++) {
x[i] = config.bits.toString(36).toUpperCase() + padLeft(x[i], padding) + bin2hex(y[i]);
}
}
return x;
};
// This is the basic polynomial generation and evaluation function
// for a `config.bits`-length secret (NOT an arbitrary length)
// Note: no error-checking at this stage! If `secrets` is NOT
// a NUMBER less than 2^bits-1, the output will be incorrect!
/** @expose **/
exports._getShares = function (secret, numShares, threshold) {
var shares = [];
var coeffs = [secret];
for (var i = 1; i < threshold; i++) {
coeffs[i] = parseInt(config.rng(config.bits), 2);
}
for (var i = 1, len = numShares + 1; i < len; i++) {
shares[i - 1] = {
x: i,
y: horner(i, coeffs)
}
}
return shares;
};
// Polynomial evaluation at `x` using Horner's Method
// TODO: this can possibly be sped up using other methods
// NOTE: fx=fx * x + coeff[i] -> exp(log(fx) + log(x)) + coeff[i],
// so if fx===0, just set fx to coeff[i] because
// using the exp/log form will result in incorrect value
function horner(x, coeffs) {
var logx = config.logs[x];
var fx = 0;
for (var i = coeffs.length - 1; i >= 0; i--) {
if (fx === 0) {
fx = coeffs[i];
continue;
}
fx = config.exps[(logx + config.logs[fx]) % config.max] ^ coeffs[i];
}
return fx;
};
function inArray(arr, val) {
for (var i = 0, len = arr.length; i < len; i++) {
if (arr[i] === val) {
return true;
}
}
return false;
};
function processShare(share) {
var bits = parseInt(share[0], 36);
if (bits && (typeof bits !== 'number' || bits % 1 !== 0 || bits < defaults.minBits || bits >
defaults.maxBits)) {
throw new Error('Number of bits must be an integer between ' + defaults.minBits + ' and ' +
defaults.maxBits + ', inclusive.')
}
var max = Math.pow(2, bits) - 1;
var idLength = max.toString(config.radix).length;
var id = parseInt(share.substr(1, idLength), config.radix);
if (typeof id !== 'number' || id % 1 !== 0 || id < 1 || id > max) {
throw new Error('Share id must be an integer between 1 and ' + config.max + ', inclusive.');
}
share = share.substr(idLength + 1);
if (!share.length) {
throw new Error('Invalid share: zero-length share.')
}
return {
'bits': bits,
'id': id,
'value': share
};
};
/** @expose **/
exports._processShare = processShare;
// Protected method that evaluates the Lagrange interpolation
// polynomial at x=`at` for individual config.bits-length
// segments of each share in the `shares` Array.
// Each share is expressed in base `inputRadix`. The output
// is expressed in base `outputRadix'
function combine(at, shares) {
var setBits, share, x = [],
y = [],
result = '',
idx;
for (var i = 0, len = shares.length; i < len; i++) {
share = processShare(shares[i]);
if (typeof setBits === 'undefined') {
setBits = share['bits'];
} else if (share['bits'] !== setBits) {
throw new Error('Mismatched shares: Different bit settings.')
}
if (config.bits !== setBits) {
init(setBits);
}
if (inArray(x, share['id'])) { // repeated x value?
continue;
}
idx = x.push(share['id']) - 1;
share = split(hex2bin(share['value']));
for (var j = 0, len2 = share.length; j < len2; j++) {
y[j] = y[j] || [];
y[j][idx] = share[j];
}
}
for (var i = 0, len = y.length; i < len; i++) {
result = padLeft(lagrange(at, x, y[i]).toString(2)) + result;
}
if (at === 0) { // reconstructing the secret
var idx = result.indexOf('1'); //find the first 1
return bin2hex(result.slice(idx + 1));
} else { // generating a new share
return bin2hex(result);
}
};
// Combine `shares` Array into the original secret
/** @expose **/
exports.combine = function (shares) {
return combine(0, shares);
};
// Generate a new share with id `id` (a number between 1 and 2^bits-1)
// `id` can be a Number or a String in the default radix (16)
/** @expose **/
exports.newShare = function (id, shares) {
if (typeof id === 'string') {
id = parseInt(id, config.radix);
}
var share = processShare(shares[0]);
var max = Math.pow(2, share['bits']) - 1;
if (typeof id !== 'number' || id % 1 !== 0 || id < 1 || id > max) {
throw new Error('Share id must be an integer between 1 and ' + config.max + ', inclusive.');
}
var padding = max.toString(config.radix).length;
return config.bits.toString(36).toUpperCase() + padLeft(id.toString(config.radix), padding) +
combine(id, shares);
};
// Evaluate the Lagrange interpolation polynomial at x = `at`
// using x and y Arrays that are of the same length, with
// corresponding elements constituting points on the polynomial.
function lagrange(at, x, y) {
var sum = 0,
product,
i, j;
for (var i = 0, len = x.length; i < len; i++) {
if (!y[i]) {
continue;
}
product = config.logs[y[i]];
for (var j = 0; j < len; j++) {
if (i === j) {
continue;
}
if (at === x[
j]) { // happens when computing a share that is in the list of shares used to compute it
product = -
1; // fix for a zero product term, after which the sum should be sum^0 = sum, not sum^1
break;
}
product = (product + config.logs[at ^ x[j]] - config.logs[x[i] ^ x[j]] + config
.max /* to make sure it's not negative */ ) %
config.max;
}
sum = product === -1 ? sum : sum ^ config.exps[
product
]; // though exps[-1]= undefined and undefined ^ anything = anything in chrome, this behavior may not hold everywhere, so do the check
}
return sum;
};
/** @expose **/
exports._lagrange = lagrange;
// Splits a number string `bits`-length segments, after first
// optionally zero-padding it to a length that is a multiple of `padLength.
// Returns array of integers (each less than 2^bits-1), with each element
// representing a `bits`-length segment of the input string from right to left,
// i.e. parts[0] represents the right-most `bits`-length segment of the input string.
function split(str, padLength) {
if (padLength) {
str = padLeft(str, padLength)
}
var parts = [];
for (var i = str.length; i > config.bits; i -= config.bits) {
parts.push(parseInt(str.slice(i - config.bits, i), 2));
}
parts.push(parseInt(str.slice(0, i), 2));
return parts;
};
// Pads a string `str` with zeros on the left so that its length is a multiple of `bits`
function padLeft(str, bits) {
bits = bits || config.bits
var missing = str.length % bits;
return (missing ? new Array(bits - missing + 1).join('0') : '') + str;
};
function hex2bin(str) {
var bin = '',
num;
for (var i = str.length - 1; i >= 0; i--) {
num = parseInt(str[i], 16)
if (isNaN(num)) {
throw new Error('Invalid hex character.')
}
bin = padLeft(num.toString(2), 4) + bin;
}
return bin;
}
function bin2hex(str) {
var hex = '',
num;
str = padLeft(str, 4);
for (var i = str.length; i >= 4; i -= 4) {
num = parseInt(str.slice(i - 4, i), 2);
if (isNaN(num)) {
throw new Error('Invalid binary character.')
}
hex = num.toString(16) + hex;
}
return hex;
}
// Converts a given UTF16 character string to the HEX representation.
// Each character of the input string is represented by
// `bytesPerChar` bytes in the output string.
/** @expose **/
exports.str2hex = function (str, bytesPerChar) {
if (typeof str !== 'string') {
throw new Error('Input must be a character string.');
}
bytesPerChar = bytesPerChar || defaults.bytesPerChar;
if (typeof bytesPerChar !== 'number' || bytesPerChar % 1 !== 0 || bytesPerChar < 1 ||
bytesPerChar > defaults.maxBytesPerChar) {
throw new Error('Bytes per character must be an integer between 1 and ' + defaults
.maxBytesPerChar +
', inclusive.')
}
var hexChars = 2 * bytesPerChar;
var max = Math.pow(16, hexChars) - 1;
var out = '',
num;
for (var i = 0, len = str.length; i < len; i++) {
num = str[i].charCodeAt();
if (isNaN(num)) {
throw new Error('Invalid character: ' + str[i]);
} else if (num > max) {
var neededBytes = Math.ceil(Math.log(num + 1) / Math.log(256));
throw new Error('Invalid character code (' + num +
'). Maximum allowable is 256^bytes-1 (' + max +
'). To convert this character, use at least ' + neededBytes + ' bytes.')
} else {
out = padLeft(num.toString(16), hexChars) + out;
}
}
return out;
};
// Converts a given HEX number string to a UTF16 character string.
/** @expose **/
exports.hex2str = function (str, bytesPerChar) {
if (typeof str !== 'string') {
throw new Error('Input must be a hexadecimal string.');
}
bytesPerChar = bytesPerChar || defaults.bytesPerChar;
if (typeof bytesPerChar !== 'number' || bytesPerChar % 1 !== 0 || bytesPerChar < 1 ||
bytesPerChar > defaults.maxBytesPerChar) {
throw new Error('Bytes per character must be an integer between 1 and ' + defaults
.maxBytesPerChar +
', inclusive.')
}
var hexChars = 2 * bytesPerChar;
var out = '';
str = padLeft(str, hexChars);
for (var i = 0, len = str.length; i < len; i += hexChars) {
out = String.fromCharCode(parseInt(str.slice(i, i + hexChars), 16)) + out;
}
return out;
};
// by default, initialize without an RNG
exports.init();
})(typeof module !== 'undefined' && module['exports'] ? module['exports'] : (window['shamirSecretShare'] = {}),
typeof global !== 'undefined' ? global : window);
//For diff base
/*
Functions available:
diff(originalObj, updatedObj) returns the difference of the original and updated objects
addedDiff(original, updatedObj) returns only the values added to the updated object
deletedDiff(original, updatedObj) returns only the values deleted in the updated object
updatedDiff(original, updatedObj) returns only the values that have been changed in the updated object
findDifference(original, updatedObj) returns an object with the added, deleted and updated differences
mergeRecurcive(original, diff) this will get you a new object that will merge all the changes between the old object and the new object
*/
(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)
};
}
return {
...acc,
[key]: diff[key]
};
}, {});
};
const updatedDiff = (lhs, rhs) => {
if (lhs === rhs) return {};
if (!isObject(lhs) || !isObject(rhs)) return rhs;
const l = properObject(lhs);
const r = properObject(rhs);
if (isDate(l) || isDate(r)) {
if (l.valueOf() == r.valueOf()) return {};
return r;
}
return Object.keys(r).reduce((acc, key) => {
if (l.hasOwnProperty(key)) {
const difference = updatedDiff(l[key], r[key]);
if (isObject(difference) && isEmpty(difference) && !isDate(difference)) return acc;
return {
...acc,
[key]: difference
};
}
return acc;
}, {});
};
const diff = (lhs, rhs) => {
if (lhs === rhs) return {}; // equal return no diff
if (!isObject(lhs) || !isObject(rhs)) return rhs; // return updated rhs
const l = properObject(lhs);
const r = properObject(rhs);
const deletedValues = Object.keys(l).reduce((acc, key) => {
return r.hasOwnProperty(key) ? acc : {
...acc,
[key]: null
};
}, {});
if (isDate(l) || isDate(r)) {
if (l.valueOf() == r.valueOf()) return {};
return r;
}
return Object.keys(r).reduce((acc, key) => {
if (!l.hasOwnProperty(key)) return {
...acc,
[key]: r[key]
}; // return added r key
const difference = diff(l[key], r[key]);
if (isObject(difference) && isEmpty(difference) && !isDate(difference))
return acc; // return no diff
return {
...acc,
[key]: difference
}; // return updated key
}, deletedValues);
};
const 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.findDifference = (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];
}
}
return obj1;
}
/*
var test = {
foo : {
bar : {
baz : null
}
},
bar : 1
};
cleanse(test);
Rohit: Added a small fix for object being entered as Array*/
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) {
// null, remove it
delete obj[key];
}
});
if (obj.constructor.toString().indexOf("Array") != -1) {
obj = obj.filter(function (el) {
return el != null;
});
}
return obj;
}
/*obj is original object or array, diff is the output of findDifference */
window.mergeDifference = (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">
/* FLO Crypto Operators*/
const floCrypto = {
util: {
p: BigInteger("FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEFFFFFC2F", 16),
ecparams: EllipticCurve.getSECCurveByName("secp256k1"),
exponent1: function () {
return this.p.add(BigInteger.ONE).divide(BigInteger("4"))
},
calculateY: function (x) {
let p = this.p;
let exp = this.exponent1();
// x is x value of public key in BigInteger format without 02 or 03 or 04 prefix
return x.modPow(BigInteger("3"), p).add(BigInteger("7")).mod(p).modPow(exp, p)
},
getUncompressedPublicKey: function (compressedPublicKey) {
const p = this.p;
// Fetch x from compressedPublicKey
let pubKeyBytes = Crypto.util.hexToBytes(compressedPublicKey);
const prefix = pubKeyBytes.shift() // remove prefix
let prefix_modulus = prefix % 2;
pubKeyBytes.unshift(0) // add prefix 0
let x = new BigInteger(pubKeyBytes)
let xDecimalValue = x.toString()
// Fetch y
let y = this.calculateY(x);
let yDecimalValue = y.toString();
// verify y value
let resultBigInt = y.mod(BigInteger("2"));
let check = resultBigInt.toString() % 2;
if (prefix_modulus !== check) {
yDecimalValue = y.negate().mod(p).toString();
}
return {
x: xDecimalValue,
y: yDecimalValue
};
},
getSenderPublicKeyString: function () {
privateKey = ellipticCurveEncryption.senderRandom();
senderPublicKeyString = ellipticCurveEncryption.senderPublicString(privateKey);
return {
privateKey: privateKey,
senderPublicKeyString: senderPublicKeyString
}
},
deriveSharedKeySender: function (receiverCompressedPublicKey, senderPrivateKey) {
try {
let receiverPublicKeyString = this.getUncompressedPublicKey(receiverCompressedPublicKey);
var senderDerivedKey = ellipticCurveEncryption.senderSharedKeyDerivation(
receiverPublicKeyString.x, receiverPublicKeyString.y, senderPrivateKey);
return senderDerivedKey;
} catch (error) {
return new Error(error);
}
},
deriveReceiverSharedKey: function (senderPublicKeyString, receiverPrivateKey) {
return ellipticCurveEncryption.receiverSharedKeyDerivation(
senderPublicKeyString.XValuePublicString, senderPublicKeyString.YValuePublicString,
receiverPrivateKey);
},
getReceiverPublicKeyString: function (privateKey) {
return ellipticCurveEncryption.receiverPublicString(privateKey);
},
deriveSharedKeyReceiver: function (senderPublicKeyString, receiverPrivateKey) {
try {
return ellipticCurveEncryption.receiverSharedKeyDerivation(senderPublicKeyString
.XValuePublicString,
senderPublicKeyString.YValuePublicString, receiverPrivateKey);
} catch (error) {
return new Error(error);
}
},
wifToDecimal: function (pk_wif, isPubKeyCompressed = false) {
let pk = Bitcoin.Base58.decode(pk_wif)
pk.shift()
pk.splice(-4, 4)
//If the private key corresponded to a compressed public key, also drop the last byte (it should be 0x01).
if (isPubKeyCompressed == true) pk.pop()
pk.unshift(0)
privateKeyDecimal = BigInteger(pk).toString()
privateKeyHex = Crypto.util.bytesToHex(pk)
return {
privateKeyDecimal: privateKeyDecimal,
privateKeyHex: privateKeyHex
}
}
},
//generate a random Interger within range
randInt: function (min, max) {
min = Math.ceil(min);
max = Math.floor(max);
return Math.floor(Math.random() * (max - min + 1)) + min;
},
//generate a random String within length (options : alphaNumeric chars only)
randString: function (length, alphaNumeric = false) {
var result = '';
if (alphaNumeric)
var characters = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789';
else
var characters =
'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789_+-./*?@#&$<>=[]{}():';
for (var i = 0; i < length; i++)
result += characters.charAt(Math.floor(Math.random() * characters.length));
return result;
},
//Encrypt Data using public-key
encryptData: function (data, receiverCompressedPublicKey) {
var senderECKeyData = this.util.getSenderPublicKeyString();
var senderDerivedKey = this.util.deriveSharedKeySender(receiverCompressedPublicKey, senderECKeyData
.privateKey);
let senderKey = senderDerivedKey.XValue + senderDerivedKey.YValue;
let secret = Crypto.AES.encrypt(data, senderKey);
return {
secret: secret,
senderPublicKeyString: senderECKeyData.senderPublicKeyString
};
},
//Decrypt Data using private-key
decryptData: function (data, myPrivateKey) {
var receiverECKeyData = {};
if (typeof myPrivateKey !== "string") throw new Error("No private key found.");
let privateKey = this.util.wifToDecimal(myPrivateKey, true);
if (typeof privateKey.privateKeyDecimal !== "string") throw new Error(
"Failed to detremine your private key.");
receiverECKeyData.privateKey = privateKey.privateKeyDecimal;
var receiverDerivedKey = this.util.deriveReceiverSharedKey(data.senderPublicKeyString,
receiverECKeyData
.privateKey);
let receiverKey = receiverDerivedKey.XValue + receiverDerivedKey.YValue;
let decryptMsg = Crypto.AES.decrypt(data.secret, receiverKey);
return decryptMsg;
},
//Sign data using private-key
signData: function (data, privateKeyHex) {
var key = new Bitcoin.ECKey(privateKeyHex);
key.setCompressed(true);
var privateKeyArr = key.getBitcoinPrivateKeyByteArray();
privateKey = BigInteger.fromByteArrayUnsigned(privateKeyArr);
var messageHash = Crypto.SHA256(data);
var messageHashBigInteger = new BigInteger(messageHash);
var messageSign = Bitcoin.ECDSA.sign(messageHashBigInteger, key.priv);
var sighex = Crypto.util.bytesToHex(messageSign);
return sighex;
},
//Verify signatue of the data using public-key
verifySign: function (data, signatureHex, publicKeyHex) {
var msgHash = Crypto.SHA256(data);
var messageHashBigInteger = new BigInteger(msgHash);
var sigBytes = Crypto.util.hexToBytes(signatureHex);
var signature = Bitcoin.ECDSA.parseSig(sigBytes);
var publicKeyPoint = this.util.ecparams.getCurve().decodePointHex(publicKeyHex);
var verify = Bitcoin.ECDSA.verifyRaw(messageHashBigInteger, signature.r, signature.s,
publicKeyPoint);
return verify;
},
//Generates a new flo ID and returns private-key, public-key and floID
generateNewID: function () {
try {
var key = new Bitcoin.ECKey(false);
key.setCompressed(true);
return {
floID: key.getBitcoinAddress(),
pubKey: key.getPubKeyHex(),
privKey: key.getBitcoinWalletImportFormat()
}
} catch (e) {
console.error(e);
}
},
//Returns public-key from private-key
getPubKeyHex: function (privateKeyHex) {
if (!privateKeyHex)
return null;
var key = new Bitcoin.ECKey(privateKeyHex);
if (key.priv == null)
return null;
key.setCompressed(true);
var pubkeyHex = key.getPubKeyHex();
return pubkeyHex;
},
//Returns flo-ID from public-key
getFloIDfromPubkeyHex: function (pubkeyHex) {
try {
var key = new Bitcoin.ECKey().setPub(pubkeyHex);
var floID = key.getBitcoinAddress();
return floID;
} catch (e) {
console.error(e);
}
},
//Verify the private-key for the given public-key or flo-ID
verifyPrivKey: function (privateKeyHex, pubKey_floID, isfloID = true) {
try {
var key = new Bitcoin.ECKey(privateKeyHex);
if (key.priv == null)
return false;
key.setCompressed(true);
if (isfloID && pubKey_floID == key.getBitcoinAddress())
return true;
else if (!isfloID && pubKey_floID == key.getPubKeyHex())
return true;
else
return false;
} catch (e) {
console.error(e);
}
},
//Check if the given Address is valid or not
validateAddr: function (inpAddr) {
try {
var addr = new Bitcoin.Address(inpAddr);
return true;
} catch {
return false;
}
},
//Split the str using shamir's Secret and Returns the shares
createShamirsSecretShares: function (str, total_shares, threshold_limit) {
try {
if (str.length > 0) {
var strHex = shamirSecretShare.str2hex(str);
var shares = shamirSecretShare.share(strHex, total_shares, threshold_limit);
return shares;
}
return false;
} catch {
return false
}
},
//Verifies the shares and str
verifyShamirsSecret: function (sharesArray, str) {
return (str && this.retrieveShamirSecret(sharesArray) === str)
},
//Returns the retrived secret by combining the shamirs shares
retrieveShamirSecret: function (sharesArray) {
try {
if (sharesArray.length > 0) {
var comb = shamirSecretShare.combine(sharesArray.slice(0, sharesArray.length));
comb = shamirSecretShare.hex2str(comb);
return comb;
}
return false;
} catch {
return false;
}
}
}
</script>
<script id="floBlockchainAPI">
/* FLO Blockchain Operator to send/receive data from blockchain using API calls*/
const floBlockchainAPI = {
util: {
serverList: floGlobals.apiURL[floGlobals.blockchain].slice(0),
curPos: floCrypto.randInt(0, floGlobals.apiURL[floGlobals.blockchain].length),
fetch_retry: function (apicall) {
return new Promise((resolve, reject) => {
this.serverList.splice(this.curPos, 1);
this.curPos = floCrypto.randInt(0, this.serverList.length)
this.fetch_api(apicall)
.then(result => resolve(result))
.catch(error => reject(error));
})
},
fetch_api: function (apicall) {
return new Promise((resolve, reject) => {
if (this.serverList.length === 0)
reject("No floSight server working")
else {
fetch(this.serverList[this.curPos] + apicall).then(response => {
if (response.ok)
response.json().then(data => resolve(data));
else {
this.fetch_retry(apicall)
.then(result => resolve(result))
.catch(error => reject(error));
}
}).catch(error => {
this.fetch_retry(apicall)
.then(result => resolve(result))
.catch(error => reject(error));
})
}
})
}
},
//Promised function to get data from API
promisedAPI: function (apicall) {
return new Promise((resolve, reject) => {
console.log(apicall)
this.util.fetch_api(apicall)
.then(result => resolve(result))
.catch(error => reject(error));
});
},
//Get balance for the given Address
getBalance: function (addr) {
return new Promise((resolve, reject) => {
this.promisedAPI(`api/addr/${addr}/balance`)
.then(balance => resolve(parseFloat(balance)))
.catch(error => reject(error));
});
},
//Write Data into blockchain
writeData: function (senderAddr, data, privKey, receiverAddr = floGlobals.adminID) {
return new Promise((resolve, reject) => {
if (typeof data != "string")
data = JSON.stringify(data);
this.sendTx(senderAddr, receiverAddr, floGlobals.sendAmt, privKey, data)
.then(txid => resolve(txid))
.catch(error => reject(error))
});
},
//Send Tx to blockchain
sendTx: function (senderAddr, receiverAddr, sendAmt, privKey, floData = '') {
return new Promise((resolve, reject) => {
if (!floCrypto.validateAddr(senderAddr))
reject(`Invalid address : ${senderAddr}`);
else if (!floCrypto.validateAddr(receiverAddr))
reject(`Invalid address : ${receiverAddr}`);
if (privKey.length < 1 || !floCrypto.verifyPrivKey(privKey, senderAddr))
reject("Invalid Private key!");
else if (typeof sendAmt !== 'number' || sendAmt <= 0)
reject(`Invalid sendAmt : ${sendAmt}`);
else {
var trx = bitjs.transaction();
var utxoAmt = 0.0;
var fee = floGlobals.fee;
this.promisedAPI(`api/addr/${senderAddr}/utxo`).then(utxos => {
for (var i = utxos.length - 1;
(i >= 0) && (utxoAmt < sendAmt + fee); i--) {
if (utxos[i].confirmations) {
trx.addinput(utxos[i].txid, utxos[i].vout, utxos[i]
.scriptPubKey)
utxoAmt += utxos[i].amount;
} else break;
}
if (utxoAmt < sendAmt + fee)
reject("Insufficient balance!");
else {
trx.addoutput(receiverAddr, sendAmt);
var change = utxoAmt - sendAmt - fee;
if (change > 0)
trx.addoutput(senderAddr, change);
trx.addflodata(floData);
var signedTxHash = trx.sign(privKey, 1);
this.broadcastTx(signedTxHash)
.then(txid => resolve(txid))
.catch(error => reject(error))
}
}).catch(error => reject(error))
}
});
},
//merge all UTXOs of a given floID into a single UTXO
mergeUTXOs: function (floID, privKey, floData = '') {
return new Promise((resolve, reject) => {
if (!floCrypto.validateAddr(floID))
return reject(`Invalid floID`);
if (!floCrypto.verifyPrivKey(privKey, floID))
return reject("Invalid Private Key")
var trx = bitjs.transaction();
var utxoAmt = 0.0;
var fee = floGlobals.fee;
this.promisedAPI(`api/addr/${floID}/utxo`).then(utxos => {
for (var i = utxos.length - 1; i >= 0; i--) {
if (utxos[i].confirmations) {
trx.addinput(utxos[i].txid, utxos[i].vout, utxos[i]
.scriptPubKey)
utxoAmt += utxos[i].amount;
}
}
trx.addoutput(floID, utxoAmt - fee);
trx.addflodata(floData);
var signedTxHash = trx.sign(privKey, 1);
this.broadcastTx(signedTxHash)
.then(txid => resolve(txid))
.catch(error => reject(error))
}).catch(error => reject(error))
})
},
/**Write data into blockchain from (and/or) to multiple floID
* @param {Array} senderPrivKeys List of sender private-keys
* @param {string} data FLO data of the txn
* @param {Array} receivers List of receivers
* @param {boolean} preserveRatio (optional) preserve ratio or equal contribution
* @return {Promise}
*/
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")
if (!preserveRatio) {
let tmp = {};
let amount = (floGlobals.sendAmt * receivers.length) / senderPrivKeys.length;
senderPrivKeys.forEach(key => tmp[key] = amount);
senderPrivKeys = tmp
}
if (!Array.isArray(receivers))
return reject("Invalid receivers: Receivers must be Array")
else {
let tmp = {};
let amount = floGlobals.sendAmt;
receivers.forEach(floID => tmp[floID] = amount);
receivers = tmp
}
if (typeof data != "string")
data = JSON.stringify(data);
this.sendTxMultiple(senderPrivKeys, receivers, data)
.then(txid => resolve(txid))
.catch(error => reject(error))
})
},
/**Send Tx from (and/or) to multiple floID
* @param {Array or Object} senderPrivKeys List of sender private-key (optional: with coins to be sent)
* @param {Object} receivers List of receivers with respective amount to be sent
* @param {string} floData FLO data of the txn
* @return {Promise}
*/
sendTxMultiple: function (senderPrivKeys, receivers, floData = '') {
return new Promise((resolve, reject) => {
let senders = {},
preserveRatio;
//check for argument validations
try {
let invalids = {
InvalidSenderPrivKeys: [],
InvalidSenderAmountFor: [],
InvalidReceiverIDs: [],
InvalidReceiveAmountFor: []
}
let inputVal = 0,
outputVal = 0;
//Validate sender privatekeys (and send amount if passed)
//conversion when only privateKeys are passed (preserveRatio mode)
if (Array.isArray(senderPrivKeys)) {
senderPrivKeys.forEach(key => {
try {
if (!key)
invalids.InvalidSenderPrivKeys.push(key);
else {
let floID = floCrypto.getFloIDfromPubkeyHex(floCrypto
.getPubKeyHex(key));
senders[floID] = {
wif: key
}
}
} catch (error) {
invalids.InvalidSenderPrivKeys.push(key)
}
})
preserveRatio = true;
}
//conversion when privatekeys are passed with send amount
else {
for (let key in senderPrivKeys) {
try {
if (!key)
invalids.InvalidSenderPrivKeys.push(key);
else {
if (typeof senderPrivKeys[key] !== 'number' || senderPrivKeys[
key] <= 0)
invalids.InvalidSenderAmountFor.push(key)
else
inputVal += senderPrivKeys[key];
let floID = floCrypto.getFloIDfromPubkeyHex(floCrypto.getPubKeyHex(
key));
senders[floID] = {
wif: key,
coins: senderPrivKeys[key]
}
}
} catch (error) {
invalids.InvalidSenderPrivKeys.push(key)
}
}
preserveRatio = false;
}
//Validate the receiver IDs and receive amount
for (let floID in receivers) {
if (!floCrypto.validateAddr(floID))
invalids.InvalidReceiverIDs.push(floID)
if (typeof receivers[floID] !== 'number' || receivers[floID] <= 0)
invalids.InvalidReceiveAmountFor.push(floID)
else
outputVal += receivers[floID];
}
//Reject if any invalids are found
for (let i in invalids)
if (!invalids[i].length)
delete invalids[i];
if (Object.keys(invalids).length)
return reject(invalids);
//Reject if given inputVal and outputVal are not equal
if (!preserveRatio && inputVal != outputVal)
return reject(
`Input Amount (${inputVal}) not equal to Output Amount (${outputVal})`)
} catch (error) {
return reject(error)
}
//Get balance of senders
let promises = []
for (let floID in senders)
promises.push(this.getBalance(floID))
Promise.all(promises).then(results => {
let totalBalance = 0,
totalFee = floGlobals.fee,
balance = {};
//Divide fee among sender if not for preserveRatio
if (!preserveRatio)
var dividedFee = totalFee / Object.keys(senders).length;
//Check if balance of each sender is sufficient enough
let insufficient = [];
for (let floID in senders) {
balance[floID] = parseFloat(results.shift());
if (isNaN(balance[floID]) || (preserveRatio && balance[floID] <=
totalFee) || (!preserveRatio && balance[floID] < senders[floID]
.coins + dividedFee))
insufficient.push(floID)
totalBalance += balance[floID];
}
if (insufficient.length)
return reject({
InsufficientBalance: insufficient
})
//Calculate totalSentAmount and check if totalBalance is sufficient
let totalSendAmt = totalFee;
for (floID in receivers)
totalSendAmt += receivers[floID];
if (totalBalance < totalSendAmt)
return reject("Insufficient total Balance")
//Get the UTXOs of the senders
let promises = []
for (floID in senders)
promises.push(this.promisedAPI(`api/addr/${floID}/utxo`))
Promise.all(promises).then(results => {
let wifSeq = [];
var trx = bitjs.transaction();
for (floID in senders) {
let utxos = results.shift();
let sendAmt;
if (preserveRatio) {
let ratio = (balance[floID] / totalBalance);
sendAmt = totalSendAmt * ratio;
} else
sendAmt = senders[floID].coins + dividedFee;
let wif = senders[floID].wif;
let utxoAmt = 0.0;
for (let i = utxos.length - 1;
(i >= 0) && (utxoAmt < sendAmt); i--) {
if (utxos[i].confirmations) {
trx.addinput(utxos[i].txid, utxos[i].vout, utxos[i]
.scriptPubKey)
wifSeq.push(wif);
utxoAmt += utxos[i].amount;
}
}
if (utxoAmt < sendAmt)
return reject("Insufficient balance:" + floID);
let change = (utxoAmt - sendAmt);
if (change > 0)
trx.addoutput(floID, change);
}
for (floID in receivers)
trx.addoutput(floID, receivers[floID]);
trx.addflodata(floData);
for (let i = 0; i < wifSeq.length; i++)
trx.signinput(i, wifSeq[i], 1);
var signedTxHash = trx.serialize();
this.broadcastTx(signedTxHash)
.then(txid => resolve(txid))
.catch(error => reject(error))
}).catch(error => reject(error))
}).catch(error => reject(error))
})
},
//Broadcast signed Tx in blockchain using API
broadcastTx: function (signedTxHash) {
return new Promise((resolve, reject) => {
var request = new XMLHttpRequest();
var url = this.util.serverList[this.util.curPos] + 'api/tx/send';
console.log(url)
if (signedTxHash.length < 1)
reject("Empty Signature");
else {
var params = `{"rawtx":"${signedTxHash}"}`;
request.open('POST', url, true);
//Send the proper header information along with the request
request.setRequestHeader('Content-type', 'application/json');
request.onload = function () {
if (request.readyState == 4 && request.status == 200) {
console.log(request.response);
resolve(JSON.parse(request.response).txid.result);
} else
reject(request.responseText);
}
request.send(params);
}
})
},
//Read Txs of Address between from and to
readTxs: function (addr, from, to) {
return new Promise((resolve, reject) => {
this.promisedAPI(`api/addrs/${addr}/txs?from=${from}&to=${to}`)
.then(response => resolve(response))
.catch(error => reject(error))
});
},
//Read All Txs of Address (newest first)
readAllTxs: function (addr) {
return new Promise((resolve, reject) => {
this.promisedAPI(`api/addrs/${addr}/txs?from=0&to=1`).then(response => {
this.promisedAPI(`api/addrs/${addr}/txs?from=0&to=${response.totalItems}0`)
.then(response => resolve(response.items))
.catch(error => reject(error));
}).catch(error => reject(error))
});
},
/*Read flo Data from txs of given Address
options can be used to filter data
limit : maximum number of filtered data (default = 1000, negative = no limit)
ignoreOld : ignore old txs (default = 0)
sentOnly : filters only sent data
pattern : filters data that starts with a pattern
contains : filters data that contains a string
filter : custom filter funtion for floData (eg . filter: d => {return d[0] == '$'})
*/
readData: function (addr, options = {}) {
options.limit = options.limit | 1000
options.ignoreOld = options.ignoreOld | 0
return new Promise((resolve, reject) => {
this.promisedAPI(`api/addrs/${addr}/txs?from=0&to=1`).then(response => {
var newItems = response.totalItems - options.ignoreOld;
this.promisedAPI(`api/addrs/${addr}/txs?from=0&to=${newItems * 2}`).then(
response => {
if (options.limit <= 0)
options.limit = response.items.length;
var filteredData = [];
for (i = 0; i < (response.totalItems - options.ignoreOld) &&
filteredData.length < options.limit; i++) {
if (options.sentOnly && response.items[i].vin[0].addr !==
addr)
continue;
if (options.pattern && !response.items[i].floData
.startsWith(options.pattern, 0) && !response.items[i]
.floData.startsWith(options.pattern, 2))
continue;
if (options.contains && !response.items[i].floData.includes(
options.contains))
continue;
if (options.filter && !options.filter(response.items[i]
.floData))
continue;
filteredData.push(response.items[i].floData);
}
resolve({
totalTxs: response.totalItems,
data: filteredData
});
}).catch(error => {
reject(error);
});
}).catch(error => {
reject(error);
});
});
}
}
</script>
<script id="floSupernode">
/* flo Supernode Operators to send/receive data from supernodes using websocket */
const floSupernode = {
//kBucket object
kBucket: {
supernodeKBucket: null,
decodeBase58Address: function (address) {
let k = bitjs.Base58.decode(address)
k.shift()
k.splice(-4, 4)
return Crypto.util.bytesToHex(k)
},
floIdToKbucketId: function (address) {
const decodedId = this.decodeBase58Address(address);
const nodeIdBigInt = new BigInteger(decodedId, 16);
const nodeIdBytes = nodeIdBigInt.toByteArrayUnsigned();
const nodeIdNewInt8Array = new Uint8Array(nodeIdBytes);
return nodeIdNewInt8Array;
},
launch: function (superNodeList = Object.keys(floGlobals.supernodes), master_floID = floGlobals
.adminID) {
return new Promise((resolve, reject) => {
try {
const SuKBucketId = this.floIdToKbucketId(master_floID);
const SukbOptions = {
localNodeId: SuKBucketId
}
this.supernodeKBucket = new BuildKBucket(SukbOptions);
for (var i = 0; i < superNodeList.length; i++) {
this.addNewNode(superNodeList[i])
}
resolve('SuperNode KBucket formed');
} catch (error) {
reject(error);
}
});
},
addContact: function (id, floID, KB = this.supernodeKBucket) {
const contact = {
id: id,
floID: floID
};
KB.add(contact)
},
addNewNode: function (address, KB = this.supernodeKBucket) {
let decodedId = address;
try {
decodedId = this.floIdToKbucketId(address);
} catch (e) {
decodedId = address;
}
this.addContact(decodedId, address, KB);
},
isNodePresent: function (flo_id, KB = this.supernodeKBucket) {
let kArray = KB.toArray();
let kArrayFloIds = kArray.map(k => k.floID);
if (kArrayFloIds.includes(flo_id))
return true;
else
return false;
},
getInnerNodes: function (flo_addr1, flo_addr2, KB = this.supernodeKBucket) {
return new Promise((resolve, reject) => {
let kArrayFloIds = KB.toArray().map(k => k.floID);
var innerNodes = []
if (kArrayFloIds.includes(flo_addr1) && kArrayFloIds.includes(flo_addr2)) {
for (var i = kArrayFloIds.indexOf(flo_addr1); i != flo_addr2; i++) {
if (i >= kArrayFloIds.length)
i = -1
else
innerNodes.push(kArrayFloIds[i])
}
resolve(innerNodes)
} else
reject('Given nodes are not in KBucket')
});
},
getOuterNodes: function (flo_addr1, flo_addr2, KB = this.supernodeKBucket) {
return new Promise((resolve, reject) => {
let kArrayFloIds = KB.toArray().map(k => k.floID);
var outterNodes = []
if (kArrayFloIds.includes(flo_addr1) && kArrayFloIds.includes(flo_addr2)) {
for (var i = kArrayFloIds.indexOf(flo_addr2); i != flo_addr1; i++) {
if (i >= kArrayFloIds.length)
i = -1
else
outterNodes.push(kArrayFloIds[i])
}
resolve(outterNodes)
} else
reject('Given nodes are not in KBucket')
});
},
getPrevSupernode: function (flo_addr, n = 1, KB = this.supernodeKBucket) {
return new Promise((resolve, reject) => {
try {
let kArrayFloIds = KB.toArray().map(k => k.floID);
let pos = kArrayFloIds.indexOf(flo_addr)
var prevSupernode = []
for (var i = 1; i <= n; i++) {
if (pos - i < 0)
var prev = pos - i + kArrayFloIds.length
else
var prev = pos - i
prevSupernode.push(kArrayFloIds[prev])
}
resolve(prevSupernode);
} catch (error) {
reject(error);
}
});
},
getNextSupernode: function (flo_addr, n = 1, KB = this.supernodeKBucket) {
return new Promise((resolve, reject) => {
try {
let kArrayFloIds = KB.toArray().map(k => k.floID);
let pos = kArrayFloIds.indexOf(flo_addr)
var nextSupernode = []
for (var i = 1; i <= n; i++) {
if (pos + i >= kArrayFloIds.length)
var next = pos + i - kArrayFloIds.length
else
var next = pos + i
nextSupernode.push(kArrayFloIds[next])
}
resolve(nextSupernode);
} catch (error) {
reject(error);
}
});
},
determineClosestSupernode: function (flo_addr, n = 1, KB = this.supernodeKBucket) {
return new Promise((resolve, reject) => {
try {
let isFloIdUint8 = flo_addr instanceof Uint8Array;
if (!isFloIdUint8)
flo_addr = this.floIdToKbucketId(flo_addr);
var closestSupernode = KB.closest(flo_addr, n);
closestSupernode = closestSupernode.map(k => k.floID);
resolve(closestSupernode);
} catch (error) {
reject(error);
}
});
}
},
sendDataToSN(data, snfloID) {
return new Promise((resolve, reject) => {
var websocket = new WebSocket("wss://" + floGlobals.supernodes[snfloID].uri + "/ws");
websocket.onmessage = (evt => {
if (evt.data == '$+') {
websocket.send(data);
resolve(`Data sent to supernode : ${snfloID}`);
} else if (evt.data == '$-') {
this.kBucket.getNextSupernode(snfloID).then(nextNode => {
this.sendDataToSN(data, nextNode[0])
.then(result => resolve(result))
.catch(error => reject(error))
}).catch(error => reject(error))
} else {
console.log(evt.data)
reject(evt.data)
}
websocket.close();
})
websocket.onerror = (evt) => {
this.kBucket.getNextSupernode(snfloID).then(nextNode => {
this.sendDataToSN(data, nextNode[0])
.then(result => resolve(result))
.catch(error => reject(error))
}).catch(error => reject(error))
};
})
},
//Sends data to the supernode
sendData: function (data, floID) {
return new Promise((resolve, reject) => {
this.kBucket.determineClosestSupernode(floID).then(closestNode => {
this.sendDataToSN(data, closestNode[0])
.then(result => resolve(result))
.catch(error => reject(error))
}).catch(error => {
reject(error);
});
});
},
requestDataFromSN(request, snfloID) {
return new Promise((resolve, reject) => {
var websocket = new WebSocket("wss://" + floGlobals.supernodes[snfloID].uri + "/ws");
websocket.onmessage = (evt => {
if (evt.data == '$+') {
websocket.send(`?${request}`);
} else if (evt.data == '$-') {
this.kBucket.getNextSupernode(snfloID).then(nextNode => {
this.requestDataFromSN(request, nextNode[0])
.then(result => resolve(result))
.catch(error => reject(error))
}).catch(error => reject(error))
websocket.close()
} else {
resolve(evt.data);
websocket.close();
}
})
websocket.onerror = (evt) => {
this.kBucket.getNextSupernode(snfloID).then(nextNode => {
this.requestDataFromSN(request, nextNode[0])
.then(result => resolve(result))
.catch(error => reject(error))
}).catch(error => reject(error))
};
})
},
//Request data from supernode
requestData: function (request, floID) {
return new Promise((resolve, reject) => {
this.kBucket.determineClosestSupernode(floID).then(closestNode => {
this.requestDataFromSN(request, closestNode[0])
.then(result => resolve(result))
.catch(error => reject(error))
}).catch(error => {
reject(error);
});
});
}
}
/**Kademlia DHT K-bucket implementation as a binary tree.
* Implementation of a Kademlia DHT k-bucket used for storing
* contact (peer node) information.
*
* @extends EventEmitter
*/
function BuildKBucket(options = {}) {
/**
* `options`:
* `distance`: Function
* `function (firstId, secondId) { return distance }` An optional
* `distance` function that gets two `id` Uint8Arrays
* and return distance (as number) between them.
* `arbiter`: Function (Default: vectorClock arbiter)
* `function (incumbent, candidate) { return contact; }` An optional
* `arbiter` function that givent two `contact` objects with the same `id`
* returns the desired object to be used for updating the k-bucket. For
* more details, see [arbiter function](#arbiter-function).
* `localNodeId`: Uint8Array An optional Uint8Array representing the local node id.
* If not provided, a local node id will be created via `randomBytes(20)`.
* `metadata`: Object (Default: {}) Optional satellite data to include
* with the k-bucket. `metadata` property is guaranteed not be altered by,
* it is provided as an explicit container for users of k-bucket to store
* implementation-specific data.
* `numberOfNodesPerKBucket`: Integer (Default: 20) The number of nodes
* that a k-bucket can contain before being full or split.
* `numberOfNodesToPing`: Integer (Default: 3) The number of nodes to
* ping when a bucket that should not be split becomes full. KBucket will
* emit a `ping` event that contains `numberOfNodesToPing` nodes that have
* not been contacted the longest.
*
* @param {Object=} options optional
*/
this.localNodeId = options.localNodeId || window.crypto.getRandomValues(new Uint8Array(20))
this.numberOfNodesPerKBucket = options.numberOfNodesPerKBucket || 20
this.numberOfNodesToPing = options.numberOfNodesToPing || 3
this.distance = options.distance || this.distance
// use an arbiter from options or vectorClock arbiter by default
this.arbiter = options.arbiter || this.arbiter
this.metadata = Object.assign({}, options.metadata)
this.createNode = function () {
return {
contacts: [],
dontSplit: false,
left: null,
right: null
}
}
this.ensureInt8 = function (name, val) {
if (!(val instanceof Uint8Array)) {
throw new TypeError(name + ' is not a Uint8Array')
}
}
/**
* @param {Uint8Array} array1
* @param {Uint8Array} array2
* @return {Boolean}
*/
this.arrayEquals = function (array1, array2) {
if (array1 === array2) {
return true
}
if (array1.length !== array2.length) {
return false
}
for (let i = 0, length = array1.length; i < length; ++i) {
if (array1[i] !== array2[i]) {
return false
}
}
return true
}
this.ensureInt8('option.localNodeId as parameter 1', this.localNodeId)
this.root = this.createNode()
/**
* Default arbiter function for contacts with the same id. Uses
* contact.vectorClock to select which contact to update the k-bucket with.
* Contact with larger vectorClock field will be selected. If vectorClock is
* the same, candidat will be selected.
*
* @param {Object} incumbent Contact currently stored in the k-bucket.
* @param {Object} candidate Contact being added to the k-bucket.
* @return {Object} Contact to updated the k-bucket with.
*/
this.arbiter = function (incumbent, candidate) {
return incumbent.vectorClock > candidate.vectorClock ? incumbent : candidate
}
/**
* Default distance function. Finds the XOR
* distance between firstId and secondId.
*
* @param {Uint8Array} firstId Uint8Array containing first id.
* @param {Uint8Array} secondId Uint8Array containing second id.
* @return {Number} Integer The XOR distance between firstId
* and secondId.
*/
this.distance = function (firstId, secondId) {
let distance = 0
let i = 0
const min = Math.min(firstId.length, secondId.length)
const max = Math.max(firstId.length, secondId.length)
for (; i < min; ++i) {
distance = distance * 256 + (firstId[i] ^ secondId[i])
}
for (; i < max; ++i) distance = distance * 256 + 255
return distance
}
/**
* Adds a contact to the k-bucket.
*
* @param {Object} contact the contact object to add
*/
this.add = function (contact) {
this.ensureInt8('contact.id', (contact || {}).id)
let bitIndex = 0
let node = this.root
while (node.contacts === null) {
// this is not a leaf node but an inner node with 'low' and 'high'
// branches; we will check the appropriate bit of the identifier and
// delegate to the appropriate node for further processing
node = this._determineNode(node, contact.id, bitIndex++)
}
// check if the contact already exists
const index = this._indexOf(node, contact.id)
if (index >= 0) {
this._update(node, index, contact)
return this
}
if (node.contacts.length < this.numberOfNodesPerKBucket) {
node.contacts.push(contact)
return this
}
// the bucket is full
if (node.dontSplit) {
// we are not allowed to split the bucket
// we need to ping the first this.numberOfNodesToPing
// in order to determine if they are alive
// only if one of the pinged nodes does not respond, can the new contact
// be added (this prevents DoS flodding with new invalid contacts)
return this
}
this._split(node, bitIndex)
return this.add(contact)
}
/**
* Get the n closest contacts to the provided node id. "Closest" here means:
* closest according to the XOR metric of the contact node id.
*
* @param {Uint8Array} id Contact node id
* @param {Number=} n Integer (Default: Infinity) The maximum number of
* closest contacts to return
* @return {Array} Array Maximum of n closest contacts to the node id
*/
this.closest = function (id, n = Infinity) {
this.ensureInt8('id', id)
if ((!Number.isInteger(n) && n !== Infinity) || n <= 0) {
throw new TypeError('n is not positive number')
}
let contacts = []
for (let nodes = [this.root], bitIndex = 0; nodes.length > 0 && contacts.length < n;) {
const node = nodes.pop()
if (node.contacts === null) {
const detNode = this._determineNode(node, id, bitIndex++)
nodes.push(node.left === detNode ? node.right : node.left)
nodes.push(detNode)
} else {
contacts = contacts.concat(node.contacts)
}
}
return contacts
.map(a => [this.distance(a.id, id), a])
.sort((a, b) => a[0] - b[0])
.slice(0, n)
.map(a => a[1])
}
/**
* Counts the total number of contacts in the tree.
*
* @return {Number} The number of contacts held in the tree
*/
this.count = function () {
// return this.toArray().length
let count = 0
for (const nodes = [this.root]; nodes.length > 0;) {
const node = nodes.pop()
if (node.contacts === null) nodes.push(node.right, node.left)
else count += node.contacts.length
}
return count
}
/**
* Determines whether the id at the bitIndex is 0 or 1.
* Return left leaf if `id` at `bitIndex` is 0, right leaf otherwise
*
* @param {Object} node internal object that has 2 leafs: left and right
* @param {Uint8Array} id Id to compare localNodeId with.
* @param {Number} bitIndex Integer (Default: 0) The bit index to which bit
* to check in the id Uint8Array.
* @return {Object} left leaf if id at bitIndex is 0, right leaf otherwise.
*/
this._determineNode = function (node, id, bitIndex) {
// *NOTE* remember that id is a Uint8Array and has granularity of
// bytes (8 bits), whereas the bitIndex is the bit index (not byte)
// id's that are too short are put in low bucket (1 byte = 8 bits)
// (bitIndex >> 3) finds how many bytes the bitIndex describes
// bitIndex % 8 checks if we have extra bits beyond byte multiples
// if number of bytes is <= no. of bytes described by bitIndex and there
// are extra bits to consider, this means id has less bits than what
// bitIndex describes, id therefore is too short, and will be put in low
// bucket
const bytesDescribedByBitIndex = bitIndex >> 3
const bitIndexWithinByte = bitIndex % 8
if ((id.length <= bytesDescribedByBitIndex) && (bitIndexWithinByte !== 0)) {
return node.left
}
const byteUnderConsideration = id[bytesDescribedByBitIndex]
// byteUnderConsideration is an integer from 0 to 255 represented by 8 bits
// where 255 is 11111111 and 0 is 00000000
// in order to find out whether the bit at bitIndexWithinByte is set
// we construct (1 << (7 - bitIndexWithinByte)) which will consist
// of all bits being 0, with only one bit set to 1
// for example, if bitIndexWithinByte is 3, we will construct 00010000 by
// (1 << (7 - 3)) -> (1 << 4) -> 16
if (byteUnderConsideration & (1 << (7 - bitIndexWithinByte))) {
return node.right
}
return node.left
}
/**
* Get a contact by its exact ID.
* If this is a leaf, loop through the bucket contents and return the correct
* contact if we have it or null if not. If this is an inner node, determine
* which branch of the tree to traverse and repeat.
*
* @param {Uint8Array} id The ID of the contact to fetch.
* @return {Object|Null} The contact if available, otherwise null
*/
this.get = function (id) {
this.ensureInt8('id', id)
let bitIndex = 0
let node = this.root
while (node.contacts === null) {
node = this._determineNode(node, id, bitIndex++)
}
// index of uses contact id for matching
const index = this._indexOf(node, id)
return index >= 0 ? node.contacts[index] : null
}
/**
* Returns the index of the contact with provided
* id if it exists, returns -1 otherwise.
*
* @param {Object} node internal object that has 2 leafs: left and right
* @param {Uint8Array} id Contact node id.
* @return {Number} Integer Index of contact with provided id if it
* exists, -1 otherwise.
*/
this._indexOf = function (node, id) {
for (let i = 0; i < node.contacts.length; ++i) {
if (this.arrayEquals(node.contacts[i].id, id)) return i
}
return -1
}
/**
* Removes contact with the provided id.
*
* @param {Uint8Array} id The ID of the contact to remove.
* @return {Object} The k-bucket itself.
*/
this.remove = function (id) {
this.ensureInt8('the id as parameter 1', id)
let bitIndex = 0
let node = this.root
while (node.contacts === null) {
node = this._determineNode(node, id, bitIndex++)
}
const index = this._indexOf(node, id)
if (index >= 0) {
const contact = node.contacts.splice(index, 1)[0]
}
return this
}
/**
* Splits the node, redistributes contacts to the new nodes, and marks the
* node that was split as an inner node of the binary tree of nodes by
* setting this.root.contacts = null
*
* @param {Object} node node for splitting
* @param {Number} bitIndex the bitIndex to which byte to check in the
* Uint8Array for navigating the binary tree
*/
this._split = function (node, bitIndex) {
node.left = this.createNode()
node.right = this.createNode()
// redistribute existing contacts amongst the two newly created nodes
for (const contact of node.contacts) {
this._determineNode(node, contact.id, bitIndex).contacts.push(contact)
}
node.contacts = null // mark as inner tree node
// don't split the "far away" node
// we check where the local node would end up and mark the other one as
// "dontSplit" (i.e. "far away")
const detNode = this._determineNode(node, this.localNodeId, bitIndex)
const otherNode = node.left === detNode ? node.right : node.left
otherNode.dontSplit = true
}
/**
* Returns all the contacts contained in the tree as an array.
* If this is a leaf, return a copy of the bucket. `slice` is used so that we
* don't accidentally leak an internal reference out that might be
* accidentally misused. If this is not a leaf, return the union of the low
* and high branches (themselves also as arrays).
*
* @return {Array} All of the contacts in the tree, as an array
*/
this.toArray = function () {
let result = []
for (const nodes = [this.root]; nodes.length > 0;) {
const node = nodes.pop()
if (node.contacts === null) nodes.push(node.right, node.left)
else result = result.concat(node.contacts)
}
return result
}
/**
* Updates the contact selected by the arbiter.
* If the selection is our old contact and the candidate is some new contact
* then the new contact is abandoned (not added).
* If the selection is our old contact and the candidate is our old contact
* then we are refreshing the contact and it is marked as most recently
* contacted (by being moved to the right/end of the bucket array).
* If the selection is our new contact, the old contact is removed and the new
* contact is marked as most recently contacted.
*
* @param {Object} node internal object that has 2 leafs: left and right
* @param {Number} index the index in the bucket where contact exists
* (index has already been computed in a previous
* calculation)
* @param {Object} contact The contact object to update.
*/
this._update = function (node, index, contact) {
// sanity check
if (!this.arrayEquals(node.contacts[index].id, contact.id)) {
throw new Error('wrong index for _update')
}
const incumbent = node.contacts[index]
const selection = this.arbiter(incumbent, contact)
// if the selection is our old contact and the candidate is some new
// contact, then there is nothing to do
if (selection === incumbent && incumbent !== contact) return
node.contacts.splice(index, 1) // remove old contact
node.contacts.push(selection) // add more recent contact version
}
}
</script>
<script id="compactIDB">
/* Compact IndexedDB operations */
window.indexedDB = window.indexedDB || window.mozIndexedDB || window.webkitIndexedDB || window.msIndexedDB;
window.IDBTransaction = window.IDBTransaction || window.webkitIDBTransaction || window.msIDBTransaction;
window.IDBKeyRange = window.IDBKeyRange || window.webkitIDBKeyRange || window.msIDBKeyRange;
if (!window.indexedDB)
window.alert("Your browser doesn't support a stable version of IndexedDB.")
const compactIDB = {
setDefaultDB: function (dbName) {
this.defaultDB = dbName;
},
initDB: function (dbName, objectStores = {}, version = null, removeStores = []) {
return new Promise((resolve, reject) => {
this.defaultDB = this.defaultDB || dbName;
var idb = version ? indexedDB.open(dbName, version) : indexedDB.open(dbName);
idb.onerror = (event) => {
reject("Error in opening IndexedDB!");
};
idb.onupgradeneeded = (event) => {
var db = event.target.result;
for (let obs in objectStores) {
var objectStore = db.createObjectStore(obs, objectStores[obs].options ||
{});
if (objectStores[obs].indexes && typeof objectStores[obs].indexes ===
'object')
for (let i in objectStores[obs].indexes)
objectStore.createIndex(i, i, objectStores[obs].indexes[i] || {});
}
if (version)
removeStores.forEach(obs => db.deleteObjectStore(obs));
}
idb.onsuccess = (event) => {
var db = event.target.result;
if (JSON.stringify(Object.values(db.objectStoreNames).sort()) === JSON
.stringify(Object.keys(objectStores).sort()))
resolve("Initiated IndexedDB");
else {
let removeObs = [];
Object.values(db.objectStoreNames).forEach(obs => {
if (obs in objectStores)
delete objectStores[obs]
else
removeObs.push(obs)
})
this.initDB(dbName, objectStores, db.version + 1, removeObs)
.then(result => resolve(result))
.catch(error => reject(error))
}
db.close();
}
});
},
openDB: function (dbName = this.defaultDB) {
return new Promise((resolve, reject) => {
var idb = indexedDB.open(dbName);
idb.onerror = (event) => reject("Error in opening IndexedDB!");
idb.onsuccess = (event) => resolve(event.target.result);
});
},
deleteDB: function (dbName = this.defaultDB) {
return new Promise((resolve, reject) => {
var deleteReq = indexedDB.deleteDatabase(dbName);;
deleteReq.onerror = (event) => reject("Error deleting database!");
deleteReq.onsuccess = (event) => resolve("Database deleted successfully");
});
},
writeData: function (obsName, data, key = false, dbName = this.defaultDB) {
return new Promise((resolve, reject) => {
this.openDB(dbName).then(db => {
var obs = db.transaction(obsName, "readwrite").objectStore(obsName);
let writeReq = (key ? obs.put(data, key) : obs.put(data));
writeReq.onsuccess = (evt) => resolve(`Write data Successful`);
writeReq.onerror = (evt) => reject(
`Write data unsuccessful [${evt.target.error.name}] ${evt.target.error.message}`
);
db.close();
}).catch(error => reject(error));
});
},
addData: function (obsName, data, key = false, dbName = this.defaultDB) {
return new Promise((resolve, reject) => {
this.openDB(dbName).then(db => {
var obs = db.transaction(obsName, "readwrite").objectStore(obsName);
let addReq = (key ? obs.add(data, key) : obs.add(data));
addReq.onsuccess = (evt) => resolve(`Add data successful`);
addReq.onerror = (evt) => reject(
`Add data unsuccessful [${evt.target.error.name}] ${evt.target.error.message}`
);
db.close();
}).catch(error => reject(error));
});
},
removeData: function (obsName, key, dbName = this.defaultDB) {
return new Promise((resolve, reject) => {
this.openDB(dbName).then(db => {
var obs = db.transaction(obsName, "readwrite").objectStore(obsName);
let delReq = obs.delete(key);
delReq.onsuccess = (evt) => resolve(`Removed Data ${key}`);
delReq.onerror = (evt) => reject(
`Remove data unsuccessful [${evt.target.error.name}] ${evt.target.error.message}`
);
db.close();
}).catch(error => reject(error));
});
},
clearData: function (obsName, dbName = this.defaultDB) {
return new Promise((resolve, reject) => {
this.openDB(dbName).then(db => {
var obs = db.transaction(obsName, "readwrite").objectStore(obsName);
let clearReq = obs.clear();
clearReq.onsuccess = (evt) => resolve(`Clear data Successful`);
clearReq.onerror = (evt) => reject(`Clear data Unsuccessful`);
db.close();
}).catch(error => reject(error));
});
},
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);
let getReq = obs.get(key);
getReq.onsuccess = (evt) => resolve(evt.target.result);
getReq.onerror = (evt) => reject(
`Read data unsuccessful [${evt.target.error.name}] ${evt.target.error.message}`
);
db.close();
}).catch(error => reject(error));
});
},
readAllData: function (obsName, dbName = this.defaultDB) {
return new Promise((resolve, reject) => {
this.openDB(dbName).then(db => {
var obs = db.transaction(obsName, "readonly").objectStore(obsName);
var tmpResult = {}
let curReq = obs.openCursor();
curReq.onsuccess = (evt) => {
var cursor = evt.target.result;
if (cursor) {
tmpResult[cursor.primaryKey] = cursor.value;
cursor.continue();
} else
resolve(tmpResult);
}
curReq.onerror = (evt) => reject(
`Read-All data unsuccessful [${evt.target.error.name}] ${evt.target.error.message}`
);
db.close();
}).catch(error => reject(error));
});
},
searchData: function (obsName, patternEval, dbName = this.defaultDB) {
return new Promise((resolve, reject) => {
this.openDB(dbName).then(db => {
var obs = db.transaction(obsName, "readonly").objectStore(obsName);
var filteredResult = {}
let curReq = obs.openCursor();
curReq.onsuccess = (evt) => {
var cursor = evt.target.result;
if (cursor) {
if (patternEval(cursor.primaryKey, cursor.value))
filteredResult[cursor.primaryKey] = cursor.value;
cursor.continue();
} else
resolve(filteredResult);
}
curReq.onerror = (evt) => reject(
`Search unsuccessful [${evt.target.error.name}] ${evt.target.error.message}`
);
db.close();
}).catch(error => reject(error));
});
}
}
</script>
<script id="floCloudAPI">
/* FLO Cloud operations to send/request application data*/
const floCloudAPI = {
util: {
lastCommit: {},
resetData: function (dataSet) {
try {
dataSet = JSON.parse(dataSet);
console.log(dataSet)
for (vc in dataSet) {
var message = dataSet[vc].message;
if (message.reset) {
floGlobals.appObjects[message.object] = message.reset
floGlobals.vectorClock[message.object] = vc
compactIDB.writeData("appObjects", floGlobals.appObjects[message.object], message
.object)
compactIDB.writeData("vectorClock", vc, message.object)
}
}
} catch (error) {
console.error(error)
}
},
updateData: function (dataSet) {
try {
dataSet = JSON.parse(dataSet);
console.log(dataSet)
for (vc in dataSet) {
var message = dataSet[vc].message;
if (message.diff) {
floGlobals.appObjects[message.object] = mergeDifference(floGlobals.appObjects[
message.object], message.diff)
compactIDB.writeData("appObjects", floGlobals.appObjects[message.object], message
.object)
}
floGlobals.vectorClock[message.object] = vc
compactIDB.writeData("vectorClock", vc, message.object)
}
} catch (error) {
console.error(error)
}
},
storeGeneralData: function (filterStr, dataSet) {
try {
dataSet = JSON.parse(dataSet);
console.log(dataSet)
if (!Array.isArray(floGlobals.generalData[filterStr]))
floGlobals.generalData[filterStr] = []
for (vc in dataSet) {
floGlobals.generalData[filterStr].push({
sender: dataSet[vc].senderID,
vectorClock: vc,
message: dataSet[vc].message
})
compactIDB.writeData("generalData", floGlobals.generalData[filterStr], filterStr)
floGlobals.generalVC[filterStr] = vc
compactIDB.writeData("generalVC", vc, filterStr)
}
} catch (error) {
console.error(error)
}
}
},
//send Any message to supernode cloud storage
sendApplicationData: function (message, type, options = {}) {
return new Promise((resolve, reject) => {
var data = {
senderID: myFloID,
receiverID: options.receiverID || floGlobals.adminID,
pubKey: myPubKey,
message: message,
sign: floCrypto.signData(JSON.stringify(message), myPrivKey),
application: options.application || floGlobals.application,
type: type,
comment: options.comment || ""
}
floSupernode.sendData(JSON.stringify(data), data.receiverID)
.then(result => resolve(result))
.catch(error => reject(error))
})
},
//request any data from supernode cloud
requestApplicationData: function (options = {}) {
return new Promise((resolve, reject) => {
var request = {
receiverID: options.receiverID || floGlobals.adminID,
senderIDs: options.senderIDs || undefined,
application: options.application || floGlobals.application,
type: options.type || undefined,
comment: options.comment || undefined,
lowerVectorClock: options.lowerVectorClock || undefined,
upperVectorClock: options.upperVectorClock || undefined,
atVectorClock: options.atVectorClock || undefined,
mostRecent: options.mostRecent || undefined,
}
floSupernode.requestData(JSON.stringify(request), request.receiverID)
.then(response => resolve(response))
.catch(error => reject(error))
})
},
//send General Data
sendGeneralData: function (message, type, options = {}) {
return new Promise((resolve, reject) => {
this.sendApplicationData(message, type, options)
.then(result => resolve(result))
.catch(error => reject(error))
})
},
//request General Data
requestGeneralData: function (type, options = {}) {
return new Promise((resolve, reject) => {
var filterStr = JSON.stringify({
application: options.application || floGlobals.application,
type: type,
comment: options.comment
})
options.type = type
options.lowerVectorClock = options.lowerVectorClock || floGlobals.generalVC[filterStr] +
1
this.requestApplicationData(options).then(dataSet => {
this.util.storeGeneralData(filterStr, dataSet)
resolve('General Data Updated')
}).catch(error => reject(error))
})
},
//request an object data from supernode cloud
requestObjectData: function (objectName, options = {}) {
return new Promise((resolve, reject) => {
var request = {
receiverID: options.receiverID || floGlobals.adminID,
senderIDs: (options.senderIDs === false) ? false : options.senderIDs ||
floGlobals.subAdmins,
application: options.application || floGlobals.application,
comment: options.comment,
type: `${objectName}@Reset`,
lowerVectorClock: floGlobals.vectorClock[objectName] + 1,
mostRecent: true
}
floSupernode.requestData(JSON.stringify(request), request.receiverID).then(dataSet => {
this.util.resetData(dataSet)
request.type = `${objectName}@Update`
request.lowerVectorClock = floGlobals.vectorClock[objectName] + 1
request.mostRecent = false
floSupernode.requestData(JSON.stringify(request), request.receiverID).then(
dataSet => {
this.util.updateData(dataSet)
this.util.lastCommit[objectName] = JSON.stringify(floGlobals
.appObjects[objectName])
resolve('Object Data Updated')
}).catch(error => reject(error))
}).catch(error => reject(error))
})
},
//reset or initialize an object and send it to cloud
resetObjectData: function (objectName, options = {}) {
return new Promise((resolve, reject) => {
var message = {
division: options.division || floGlobals.division,
object: objectName,
vectorClock: floGlobals.vectorClock[objectName],
reset: floGlobals.appObjects[objectName]
}
this.sendApplicationData(message, `${objectName}@Reset`, options).then(result => {
this.util.lastCommit[objectName] = JSON.stringify(floGlobals.appObjects[
objectName])
resolve(result)
}).catch(error => reject(error))
})
},
//update the diff and send it to cloud
updateObjectData: function (objectName, options = {}) {
return new Promise((resolve, reject) => {
var message = {
division: options.division || floGlobals.division,
object: objectName,
vectorClock: floGlobals.vectorClock[objectName],
diff: findDifference(JSON.parse(this.util.lastCommit[objectName]), floGlobals
.appObjects[objectName])
}
this.sendApplicationData(message, `${objectName}@Update`, options).then(result => {
this.util.lastCommit[objectName] = JSON.stringify(floGlobals.appObjects[
objectName])
resolve(result)
}).catch(error => reject(error))
})
}
}
</script>
<script id="floDapps">
/* General functions for FLO Dapps*/
const floDapps = {
util: {
appObs: {},
initIndexedDB: function () {
return new Promise((resolve, reject) => {
var obj = {
//general
lastTx: {},
//supernode (cloud list)
supernodes: {
indexes: {
uri: null,
pubKey: null
}
},
//login credentials
credentials: {},
//for Dapps
subAdmins: {},
appObjects: {},
vectorClock: {},
generalData: {},
generalVC: {}
}
//add other given objectStores
for (o in this.appObs)
if (!(o in obj))
obj[o] = this.appObs[o]
compactIDB.initDB(floGlobals.application, obj).then(result => {
resolve("IndexedDB App Storage Initated Successfully")
}).catch(error => reject(error));
})
},
startUpFunctions: {
readSupernodeListFromAPI: function () {
return new Promise((resolve, reject) => {
compactIDB.readData("lastTx", floGlobals.SNStorageID).then(lastTx => {
floBlockchainAPI.readData(floGlobals.SNStorageID, {
ignoreOld: lastTx,
sentOnly: true,
pattern: "SuperNodeStorage"
}).then(result => {
for (var i = result.data.length - 1; i >= 0; i--) {
var content = JSON.parse(result.data[i])
.SuperNodeStorage;
for (sn in content.removeNodes)
compactIDB.removeData("supernodes", sn);
for (sn in content.addNodes)
compactIDB.writeData("supernodes", content
.addNodes[sn], sn);
}
compactIDB.writeData("lastTx", result.totalTxs,
floGlobals.SNStorageID);
compactIDB.readAllData("supernodes").then(result => {
floGlobals.supernodes = result;
floSupernode.kBucket.launch(Object.keys(
floGlobals.supernodes),
floGlobals.SNStorageID)
.then(result => resolve(
"Loaded Supernode list\n" +
result))
})
})
}).catch(error => reject(error))
})
},
readSubAdminListFromAPI: function () {
return new Promise((resolve, reject) => {
compactIDB.readData("lastTx", floGlobals.adminID).then(lastTx => {
floBlockchainAPI.readData(floGlobals.adminID, {
ignoreOld: lastTx,
sentOnly: true,
pattern: floGlobals.application
}).then(result => {
for (var i = result.data.length - 1; i >= 0; i--) {
var content = JSON.parse(result.data[i])[floGlobals
.application];
if (Array.isArray(content.removeSubAdmin))
for (var j = 0; j < content.removeSubAdmin
.length; j++)
compactIDB.removeData("subAdmins", content
.removeSubAdmin[j]);
if (Array.isArray(content.addSubAdmin))
for (var k = 0; k < content.addSubAdmin
.length; k++)
compactIDB.writeData("subAdmins", true,
content.addSubAdmin[k]);
}
compactIDB.writeData("lastTx", result.totalTxs,
floGlobals.adminID);
compactIDB.readAllData("subAdmins").then(result => {
floGlobals.subAdmins = Object.keys(result);
resolve("Read subAdmins from blockchain");
})
})
}).catch(error => reject(error))
})
},
loadDataFromIDB: function () {
return new Promise((resolve, reject) => {
var loadData = ["appObjects", "vectorClock", "generalData", "generalVC"]
var promises = []
for (var i = 0; i < loadData.length; i++)
promises[i] = compactIDB.readAllData(loadData[i])
Promise.all(promises).then(results => {
for (var i = 0; i < loadData.length; i++)
floGlobals[loadData[i]] = results[i]
resolve("Loaded Data from IDB")
}).catch(error => reject(error))
})
},
getCredentials: function () {
const defaultInput = function (type) {
return new Promise((resolve, reject) => {
let inputVal = prompt(`Enter ${type}: `)
if (inputVal === null)
reject(null)
else
resolve(inputVal)
})
}
const inputFn = this.getCredentials.privKeyInput || defaultInput;
const readSharesFromIDB = function (indexArr) {
return new Promise((resolve, reject) => {
var promises = []
for (var i = 0; i < indexArr.length; i++)
promises.push(compactIDB.readData('credentials', indexArr[i]))
Promise.all(promises).then(shares => {
var secret = floCrypto.retrieveShamirSecret(shares)
if (secret)
resolve(secret)
else
reject("Shares are insufficient or incorrect")
}).catch(error => reject(error))
})
}
const writeSharesToIDB = function (shares, i = 0, resultIndexes = []) {
return new Promise((resolve, reject) => {
if (i >= shares.length)
return resolve(resultIndexes)
var n = floCrypto.randInt(0, 100000)
compactIDB.addData("credentials", shares[i], n).then(res => {
resultIndexes.push(n)
writeSharesToIDB(shares, i + 1, resultIndexes)
.then(result => resolve(result))
}).catch(error => {
writeSharesToIDB(shares, i, resultIndexes)
.then(result => resolve(result))
})
})
}
const getPrivateKeyCredentials = function () {
return new Promise((resolve, reject) => {
var indexArr = localStorage.getItem(`${floGlobals.application}#privKey`)
if (indexArr) {
readSharesFromIDB(JSON.parse(indexArr))
.then(result => resolve(result))
.catch(error => reject(error))
} else {
var privKey;
inputFn("PRIVATE_KEY").then(result => {
try {
if (!result)
return reject("Empty Private Key")
var floID = floCrypto.getFloIDfromPubkeyHex(
floCrypto.getPubKeyHex(result))
privKey = result
} catch (error) {
console.error(error)
return reject("Invalid Private Key")
}
}).catch(error => {
console.log(error, "Generating Random Keys")
privKey = floCrypto.generateNewID().privKey
}).finally(_ => {
var threshold = floCrypto.randInt(10, 20)
writeSharesToIDB(floCrypto.createShamirsSecretShares(
privKey, threshold, threshold)).then(
resultIndexes => {
//store index keys in localStorage
localStorage.setItem(
`${floGlobals.application}#privKey`,
JSON.stringify(resultIndexes))
//also add a dummy privatekey to the IDB
var randomPrivKey = floCrypto
.generateNewID().privKey
var randomThreshold = floCrypto.randInt(10,
20)
writeSharesToIDB(floCrypto
.createShamirsSecretShares(
randomPrivKey, randomThreshold,
randomThreshold))
//resolve private Key
resolve(privKey)
}).catch(error => reject(error))
})
}
})
}
const checkIfPinRequired = function (key) {
return new Promise((resolve, reject) => {
if (key.length == 52)
resolve(key)
else {
inputFn("PIN/Password").then(pwd => {
try {
let privKey = Crypto.AES.decrypt(key, pwd);
resolve(privKey)
} catch (error) {
reject("Access Denied: Incorrect PIN/Password")
}
}).catch(error => reject(
"Access Denied: PIN/Password required"))
}
})
}
return new Promise((resolve, reject) => {
getPrivateKeyCredentials().then(key => {
checkIfPinRequired(key).then(privKey => {
try {
myPrivKey = privKey
myPubKey = floCrypto.getPubKeyHex(myPrivKey)
myFloID = floCrypto.getFloIDfromPubkeyHex(myPubKey)
resolve('Login Credentials loaded successful')
} catch (error) {
reject("Corrupted Private Key")
}
}).catch(error => reject(error))
}).catch(error => reject(error))
})
}
},
callStartUpFunction: function (fname) {
return new Promise((resolve, reject) => {
this.startUpFunctions[fname]().then(result => {
this.callStartUpFunction.completed += 1
reactor.dispatchEvent("startUpSuccessLog",
`${result}\nCompleted ${this.callStartUpFunction.completed}/${this.callStartUpFunction.total} Startup functions`
)
resolve(true)
}).catch(error => {
this.callStartUpFunction.failed += 1
reactor.dispatchEvent("startUpErrorLog",
`${error}\nFailed ${this.callStartUpFunction.failed}/${this.callStartUpFunction.total} Startup functions`
)
reject(false)
})
})
},
getFilterString: function (type, options = {}) {
var filterStr = JSON.stringify({
application: options.application || floGlobals.application,
type: type,
comment: options.comment
})
return filterStr
}
},
launchStartUp: function () {
return new Promise((resolve, reject) => {
this.util.initIndexedDB().then(log => {
console.log(log)
this.util.callStartUpFunction.total = Object.keys(this.util
.startUpFunctions).length
this.util.callStartUpFunction.completed = 0
this.util.callStartUpFunction.failed = 0
var promises = []
for (fn in this.util.startUpFunctions)
promises.push(this.util.callStartUpFunction(fn))
Promise.all(promises)
.then(results => resolve('App Startup finished successful'))
.catch(errors => reject('App StartUp failed'))
})
})
},
addStartUpFunction: function (fname, fn) {
if (fname in this.util.startUpFunctions)
throw (`Function ${fname} already defined`)
this.util.startUpFunctions[fname] = fn;
},
setCustomPrivKeyInput: function (customFn) {
this.util.startUpFunctions.getCredentials.privKeyInput = customFn
},
setAppObjectStores: function (appObs) {
this.util.appObs = appObs
},
manageSubAdmins(adminPrivKey, addList, rmList) {
return new Promise((resolve, reject) => {
if (!Array.isArray(addList)) addList = undefined;
if (!Array.isArray(rmList)) rmList = undefined;
var floData = {
[floGlobals.application]: {
addSubAdmin: addList,
removeSubAdmin: rmList,
}
}
var floID = floCrypto.getFloIDfromPubkeyHex(floCrypto.getPubKeyHex(adminPrivKey))
if (floID != floGlobals.adminID)
reject('Access Denied for Admin privilege')
else
floBlockchainAPI.writeData(floID, JSON.stringify(floData), adminPrivKey)
.then(result => resolve(['Updated SubAdmin List', result]))
.catch(error => reject(error))
})
},
clearCredentials: function () {
return new Promise((resolve, reject) => {
compactIDB.clearData('credentials').then(result => {
localStorage.removeItem(`${floGlobals.application}#privKey`)
myPrivKey = myPubKey = myFloID = undefined;
resolve("privKey credentials deleted!")
}).catch(error => reject(error))
})
},
securePrivKey: function (pwd) {
return new Promise((resolve, reject) => {
let indexArr = localStorage.getItem(`${floGlobals.application}#privKey`)
if (!indexArr)
return reject("PrivKey not found");
indexArr = JSON.parse(indexArr)
let encryptedKey = Crypto.AES.encrypt(myPrivKey, pwd);
let threshold = indexArr.length;
let shares = floCrypto.createShamirsSecretShares(encryptedKey, threshold, threshold)
let promises = [];
for (var i = 0; i < threshold; i++)
promises.push(compactIDB.writeData("credentials", shares[i], indexArr[i], floGlobals
.application));
Promise.all(promises)
.then(results => resolve("Private Key Secured"))
.catch(error => reject(error))
})
},
objectDataMapper: function (object, path, data) {
var resObject = JSON.parse(JSON.stringify(object))
var pos = resObject;
path.forEach(p => pos = pos[p])
if (Array.isArray(pos)) {
pos.push(data)
return resObject
} else
throw ('Path is not an Array')
},
getNextGeneralData: function (type, vectorClock, options = {}) {
var filter = this.util.getFilterString(type, options)
var filteredResult = []
for (var i = 0; i < floGlobals.generalData[filter].length; i++)
if (floGlobals.generalData[filter][i].vectorClock > vectorClock)
filteredResult.push(floGlobals.generalData[filter][i])
return filteredResult
}
}
reactor.registerEvent("startUpSuccessLog");
reactor.addEventListener("startUpSuccessLog", log => console.log(log))
reactor.registerEvent("startUpErrorLog");
reactor.addEventListener("startUpErrorLog", log => console.error(log))
</script>
<script id="webAppClient">
//Add this to the client script to request data from floWebappServer
const webAppClient = {
util: {
requestData(request = []) {
return new Promise((resolve, reject) => {
var websocket = new WebSocket("wss://" + floGlobals.webAppURL + "/ws");
websocket.onmessage = (evt => {
if (evt.data == '$+') {
websocket.send(`?${JSON.stringify(request)}`);
} else if (evt.data == '$-') {
reject(`webApp not available`)
websocket.close()
} else {
resolve(JSON.parse(evt.data));
websocket.close();
}
})
websocket.onerror = (evt) => {
reject(`webApp server not found`)
};
})
}
},
requestGeneralData: function (type, vectorClock = '0') {
if (typeof vectorClock !== 'string')
vectorClock.toString()
return new Promise((resolve, reject) => {
this.util.requestData([floGlobals.application, 'generalData', type, vectorClock])
.then(
result => {
if (result[0])
resolve(result[1])
else
reject(result[1])
}).catch(error => reject(error))
})
},
requestObjectData: function (keyPath) {
return new Promise((resolve, reject) => {
this.util.requestData([floGlobals.application, 'appObjects'].concat(keyPath)).then(
result => {
if (result[0])
resolve(result[1])
else
reject(result[1])
}).catch(error => reject(error))
})
},
requestSubAdminList: function () {
return new Promise((resolve, reject) => {
this.util.requestData([floGlobals.application, 'subAdmins']).then(
result => {
if (result[0])
resolve(result[1])
else
reject(result[1])
}).catch(error => reject(error))
})
}
}
</script>
<script id="onLoadStartUp">
let notifications = document.getElementById("sm-notifications"),
genblockchainID = document.getElementById('gen-floid'),
genPrivateKey = document.getElementById('gen-privateKey'),
settings_page = document.getElementById('settings-page'),
homepage = document.getElementById('homepage'),
mainarticle_page = document.getElementById('display_page_main')
async function updateDate() {
var month = ["January", "February", "March", "April", "May", "June", "July", "August", "September",
"October", "November", "December"
];
var weekday = ["Sunday", "Monday", "Tuesday", "Wednesday", "Thursday", "Friday", "Saturday"];
var d = new Date();
var weekday = weekday[d.getDay()];
var month = month[d.getMonth()];
var date = d.getDate();
var year = d.getFullYear();
document.getElementById('current_date').innerText = `${weekday} ${month} ${date}, ${year}`
}
updateDate();
async function fetchArticleDetails() {
let applicants = await floCloudAPI.requestGeneralData('test')
}
function parseArticles(articles) {
let totalarticles = Object.keys(articles).length
articlekeys = Object.keys(articles)
let domparser = new DOMParser();
for (let i = 0; i < totalarticles; i++) {
let currentarticle = {}
let articlehtml = articles[articlekeys[i]]
let parsedhtml = domparser.parseFromString(articlehtml, 'text/html')
currentarticle['title'] = parsedhtml.getElementById('title').innerText
currentarticle['subtitle'] = parsedhtml.getElementById('subtitle').innerText
currentarticle['sections'] = {}
totalsections = parsedhtml.getElementById('sectionmaster').childElementCount
for (let j = 0; j < totalsections; j++) {
tempobj = {}
asection = parsedhtml.getElementById(`section${j + 1}`)
sectiontitle = asection.children[0].children[0].innerText
sectionpara1 = asection.children[1].innerText
tempobj['title'] = sectiontitle
tempobj['paragraph'] = sectionpara1
currentarticle['sections'][j] = tempobj
}
parsedarticles[articlekeys[i]] = currentarticle
}
}
function renderColumns(parsedarticles) {
numberOfColumns = Object.keys(parsedarticles).length
let columns = document.getElementById('columnsmain')
let parsedArticlesKeys = Object.keys(parsedarticles)
let map_articlekey_column = {}
document.getElementById('loader_columnsmain').classList.add('hide')
columns.classList.remove('hide')
for (let i = 0; i < parsedArticlesKeys.length; i++) {
columnhtml = `<div class="column" id="column${i + 1}" data-articlekey="${parsedArticlesKeys[i]}">
<div class="head">
<span class="headline hl3">${parsedarticles[parsedArticlesKeys[i]].title}</span>
<p><span class="headline hl4">${parsedarticles[parsedArticlesKeys[i]].subtitle}</span></p>
</div>
<p>${parsedarticles[parsedArticlesKeys[i]].sections[0].paragraph}</p>
<span><a href='./${parsedArticlesKeys[i]}.html'>Read article
<i class="fa fa-angle-double-right" aria-hidden="true"></i>
</a>
<span style="float:right"><span id="column${i + 1}_count"></span><i class="fa fa-thumbs-o-up" aria-hidden="true" style="padding-left:0.5rem; cursor:pointer" id="column${i + 1}_thumbs" onclick="clickProcess(this)"></i></span>
<span>
</div>`
//columns.append(columnhtml)
columns.innerHTML += columnhtml
map_articlekey_column[parsedArticlesKeys[i]] = `column${i + 1}`
}
return map_articlekey_column
}
function switchtoArticle(element) {
homepage.classList.add('hide')
document.getElementById("displaypage").innerHTML = articles[element.dataset.articlekey]
mainarticle_page.classList.remove('hide')
}
function clickProcess(element) {
let columnName = element.id.split('_')[0]
if (typeof myFloID !== 'undefined') {
if (element.classList.value == 'fa fa-thumbs-o-up') {
let articlekey = document.getElementById(columnName).dataset.articlekey
let mainObj = {
'floID': myFloID,
'articlekey': articlekey
}
floCloudAPI.sendGeneralData(JSON.stringify(mainObj), 'test').then((result, mainObj) => {
element.classList.value = 'fa fa-thumbs-up'
if (document.getElementById(`${columnName}_count`).innerText == '') {
document.getElementById(`${columnName}_count`).innerText = '1'
} else {
document.getElementById(`${columnName}_count`).innerText = parseInt(document
.getElementById(
`${columnName}_count`).innerText) + 1
}
})
}
} else {
notifications.push("Please login to upvote")
}
}
document.getElementById("go_back").addEventListener("click", function () {
console.log("Registered a click")
if (homepage.classList.contains('hide')) {
homepage.classList.remove('hide')
mainarticle_page.classList.add('hide')
} else {
}
});
document.getElementById("go_back_bottom").addEventListener("click", function () {
console.log("Registered a click")
if (homepage.classList.contains('hide')) {
homepage.classList.remove('hide')
mainarticle_page.classList.add('hide')
} else {
}
});
function updateVotes(articles_votesmapping, map_articlekey_column) {
var articleKeys = Object.keys(map_articlekey_column)
for (let i = 0; i < articleKeys.length; i++) {
if (articleKeys[i] in articles_votesmapping) {
document.getElementById(`${map_articlekey_column[articleKeys[i]]}_count`).innerText =
articles_votesmapping[articleKeys[i]]
}
}
}
let repourl = "https://api.github.com/repos/ranchimall/articles/contents"
Promise.all([fetch(repourl), webAppClient.requestGeneralData('test')]).then(async (values) => {
let repocontent = null
window.articles = {}
window.parsedarticles = {}
repocontent = await values[0].json()
for (let i = 0; i < repocontent.length; i++) {
articlehtml = await (await fetch(repocontent[i]["download_url"])).text()
if (repocontent[i]['name'].slice(-5, repocontent[i]['name'].length) == '.html' && repocontent[i]
['name'].slice(0, -5) != 'index') {
articles[repocontent[i]['name'].slice(0, repocontent[i]['name'].length - 5)] = articlehtml
}
}
parseArticles(articles)
let map_articlekey_column = renderColumns(parsedarticles)
let articleInfo = values[1]
let articles_votesmapping = {}
for (let i = 0; i < articleInfo.length; i++) {
let article_message = JSON.parse(articleInfo[i].message)
if (!(article_message.articlekey in articles_votesmapping)) {
articles_votesmapping[article_message.articlekey] = 1
} else {
articles_votesmapping[article_message.articlekey]++
}
}
updateVotes(articles_votesmapping, map_articlekey_column)
})
let myCustomLogin = function () {
return new Promise((resolve, reject) => {
document.getElementById("login-button").addEventListener("click", function () {
//let userprivatekey = prompt(`Enter Private Key: `)
//resolve(userprivatekey)
document.getElementById('login-popup').show()
});
document.getElementById("signin-button").addEventListener("click", function () {
let userprivatekey = document.getElementById('privateKey-input').value.trim()
document.getElementById('login-popup').hide()
resolve(userprivatekey)
});
document.getElementById("guest-login-button").addEventListener("click", function () {
notifications.push('Please save your Private Key!', '', true)
document.getElementById('login-popup').hide()
homepage.classList.toggle('hide')
settings_page.classList.toggle('hide')
reject()
});
})
}
genblockchainID.addEventListener("click", function () {
navigator.clipboard.writeText(this.value).then(value => {
notifications.push('Blockchain ID copied')
})
})
genPrivateKey.addEventListener("click", function () {
navigator.clipboard.writeText(this.value).then(value => {
notifications.push('Private Key copied')
})
})
document.getElementById('ranchimalltimes-logo').addEventListener("click", function () {
if (!mainarticle_page.classList.contains('hide')) {
document.getElementById("go_back").click()
} else if (!settings_page.classList.contains('hide')) {
document.getElementById('settings-button').click()
}
})
document.getElementById('logout-button').addEventListener("click", function () {
floDapps.clearCredentials()
notifications.push('Succesfully logged out')
setTimeout(function () {
location.reload()
}, 2000);
})
document.getElementById('settings-button').addEventListener("click", function () {
homepage.classList.toggle('hide')
settings_page.classList.toggle('hide')
})
function onLoadStartUp() {
//floDapps.addStartUpFunction('Sample', Promised Function)
//floDapps.setAppObjectStores({sampleObs1:{}, sampleObs2:{options{autoIncrement:true, keyPath:'SampleKey'}, Indexes:{sampleIndex:{}}}})
floDapps.setCustomPrivKeyInput(myCustomLogin);
floDapps.launchStartUp().then(result => {
document.getElementById("login-button").style.display = 'none'
document.getElementById("settings-button").style.display = 'initial'
console.log(result)
console.log(`Welcome FLO_ID: ${myFloID}`)
// fill settings page
genblockchainID.value = myFloID
genPrivateKey.value = myPrivKey
//App functions....
let articledata = floCloudAPI.requestGeneralData('test')
Promise.all([articledata]).then((values) => {
console.log("The promises just got resolved")
console.log(values)
let allArticles = document.querySelectorAll('[data-articlekey]')
let map_articlekey_column = {}
for (let i = 0; i < allArticles.length; i++) {
map_articlekey_column[`${allArticles[i].dataset.articlekey}`] = allArticles[i].id
}
// User list related operations
let articleInfo = floGlobals.generalData[
'{"application":"TestApp","type":"test"}']
let articles_votesmapping = {}
for (let i = 0; i < articleInfo.length; i++) {
let article_message = JSON.parse(articleInfo[i].message)
if (articleInfo[i].sender == myFloID) {
let article_column_number = map_articlekey_column[article_message.articlekey]
document.getElementById(`${article_column_number}_thumbs`).classList.value =
'fa fa-thumbs-up'
}
if (!(article_message.articlekey in articles_votesmapping)) {
articles_votesmapping[article_message.articlekey] = 1
} else {
articles_votesmapping[article_message.articlekey]++
}
}
updateVotes(articles_votesmapping, map_articlekey_column)
});
}).catch(error => console.error(error))
}
</script>
</html>
Reference in New Issue View Git Blame Copy Permalink