<head lang="en">
<meta charset="utf-8" />
<title>BIP39 - Mnemonic Code</title>
- <!--<link rel="stylesheet" href="https://maxcdn.bootstrapcdn.com/bootstrap/3.2.0/css/bootstrap.min.css">-->
- <style>
-/*!
+ <style>/*!
* Bootstrap v3.2.0 (http://getbootstrap.com)
* Copyright 2011-2014 Twitter, Inc.
* Licensed under MIT (https://github.com/twbs/bootstrap/blob/master/LICENSE)
- *//*! normalize.css v3.0.1 | MIT License | git.io/normalize */html{font-family:sans-serif;-webkit-text-size-adjust:100%;-ms-text-size-adjust:100%}body{margin:0}article,aside,details,figcaption,figure,footer,header,hgroup,main,nav,section,summary{display:block}audio,canvas,progress,video{display:inline-block;vertical-align:baseline}audio:not([controls]){display:none;height:0}[hidden],template{display:none}a{background:0 0}a:active,a:hover{outline:0}abbr[title]{border-bottom:1px dotted}b,strong{font-weight:700}dfn{font-style:italic}h1{margin:.67em 0;font-size:2em}mark{color:#000;background:#ff0}small{font-size:80%}sub,sup{position:relative;font-size:75%;line-height:0;vertical-align:baseline}sup{top:-.5em}sub{bottom:-.25em}img{border:0}svg:not(:root){overflow:hidden}figure{margin:1em 40px}hr{height:0;-webkit-box-sizing:content-box;-moz-box-sizing:content-box;box-sizing:content-box}pre{overflow:auto}code,kbd,pre,samp{font-family:monospace,monospace;font-size:1em}button,input,optgroup,select,textarea{margin:0;font:inherit;color:inherit}button{overflow:visible}button,select{text-transform:none}button,html input[type=button],input[type=reset],input[type=submit]{-webkit-appearance:button;cursor:pointer}button[disabled],html input[disabled]{cursor:default}button::-moz-focus-inner,input::-moz-focus-inner{padding:0;border:0}input{line-height:normal}input[type=checkbox],input[type=radio]{-webkit-box-sizing:border-box;-moz-box-sizing:border-box;box-sizing:border-box;padding:0}input[type=number]::-webkit-inner-spin-button,input[type=number]::-webkit-outer-spin-button{height:auto}input[type=search]{-webkit-box-sizing:content-box;-moz-box-sizing:content-box;box-sizing:content-box;-webkit-appearance:textfield}input[type=search]::-webkit-search-cancel-button,input[type=search]::-webkit-search-decoration{-webkit-appearance:none}fieldset{padding:.35em .625em .75em;margin:0 2px;border:1px solid silver}legend{padding:0;border:0}textarea{overflow:auto}optgroup{font-weight:700}table{border-spacing:0;border-collapse:collapse}td,th{padding:0}@media print{*{color:#000!important;text-shadow:none!important;background:transparent!important;-webkit-box-shadow:none!important;box-shadow:none!important}a,a:visited{text-decoration:underline}a[href]:after{content:" (" attr(href) ")"}abbr[title]:after{content:" (" attr(title) ")"}a[href^="javascript:"]:after,a[href^="#"]:after{content:""}pre,blockquote{border:1px solid #999;page-break-inside:avoid}thead{display:table-header-group}tr,img{page-break-inside:avoid}img{max-width:100%!important}p,h2,h3{orphans:3;widows:3}h2,h3{page-break-after:avoid}select{background:#fff!important}.navbar{display:none}.table td,.table th{background-color:#fff!important}.btn>.caret,.dropup>.btn>.caret{border-top-color:#000!important}.label{border:1px solid #000}.table{border-collapse:collapse!important}.table-bordered th,.table-bordered td{border:1px solid #ddd!important}}@font-face{font-family:'Glyphicons Halflings';src:url(../fonts/glyphicons-halflings-regular.eot);src:url(../fonts/glyphicons-halflings-regular.eot?#iefix) format('embedded-opentype'),url(../fonts/glyphicons-halflings-regular.woff) format('woff'),url(../fonts/glyphicons-halflings-regular.ttf) format('truetype'),url(../fonts/glyphicons-halflings-regular.svg#glyphicons_halflingsregular) format('svg')}.glyphicon{position:relative;top:1px;display:inline-block;font-family:'Glyphicons Halflings';font-style:normal;font-weight:400;line-height:1;-webkit-font-smoothing:antialiased;-moz-osx-font-smoothing:grayscale}.glyphicon-asterisk:before{content:"\2a"}.glyphicon-plus:before{content:"\2b"}.glyphicon-euro:before{content:"\20ac"}.glyphicon-minus:before{content:"\2212"}.glyphicon-cloud:before{content:"\2601"}.glyphicon-envelope:before{content:"\2709"}.glyphicon-pencil:before{content:"\270f"}.glyphicon-glass:before{content:"\e001"}.glyphicon-music:before{content:"\e002"}.glyphicon-search:before{content:"\e003"}.glyphicon-heart:before{content:"\e005"}.glyphicon-star:before{content:"\e006"}.glyphicon-star-empty:before{content:"\e007"}.glyphicon-user:before{content:"\e008"}.glyphicon-film:before{content:"\e009"}.glyphicon-th-large:before{content:"\e010"}.glyphicon-th:before{content:"\e011"}.glyphicon-th-list:before{content:"\e012"}.glyphicon-ok:before{content:"\e013"}.glyphicon-remove:before{content:"\e014"}.glyphicon-zoom-in:before{content:"\e015"}.glyphicon-zoom-out:before{content:"\e016"}.glyphicon-off:before{content:"\e017"}.glyphicon-signal:before{content:"\e018"}.glyphicon-cog:before{content:"\e019"}.glyphicon-trash:before{content:"\e020"}.glyphicon-home:before{content:"\e021"}.glyphicon-file:before{content:"\e022"}.glyphicon-time:before{content:"\e023"}.glyphicon-road:before{content:"\e024"}.glyphicon-download-alt:before{content:"\e025"}.glyphicon-download:before{content:"\e026"}.glyphicon-upload:before{content:"\e027"}.glyphicon-inbox:before{content:"\e028"}.glyphicon-play-circle:before{content:"\e029"}.glyphicon-repeat:before{content:"\e030"}.glyphicon-refresh:before{content:"\e031"}.glyphicon-list-alt:before{content:"\e032"}.glyphicon-lock:before{content:"\e033"}.glyphicon-flag:before{content:"\e034"}.glyphicon-headphones:before{content:"\e035"}.glyphicon-volume-off:before{content:"\e036"}.glyphicon-volume-down:before{content:"\e037"}.glyphicon-volume-up:before{content:"\e038"}.glyphicon-qrcode:before{content:"\e039"}.glyphicon-barcode:before{content:"\e040"}.glyphicon-tag:before{content:"\e041"}.glyphicon-tags:before{content:"\e042"}.glyphicon-book:before{content:"\e043"}.glyphicon-bookmark:before{content:"\e044"}.glyphicon-print:before{content:"\e045"}.glyphicon-camera:before{content:"\e046"}.glyphicon-font:before{content:"\e047"}.glyphicon-bold:before{content:"\e048"}.glyphicon-italic:before{content:"\e049"}.glyphicon-text-height:before{content:"\e050"}.glyphicon-text-width:before{content:"\e051"}.glyphicon-align-left:before{content:"\e052"}.glyphicon-align-center:before{content:"\e053"}.glyphicon-align-right:before{content:"\e054"}.glyphicon-align-justify:before{content:"\e055"}.glyphicon-list:before{content:"\e056"}.glyphicon-indent-left:before{content:"\e057"}.glyphicon-indent-right:before{content:"\e058"}.glyphicon-facetime-video:before{content:"\e059"}.glyphicon-picture:before{content:"\e060"}.glyphicon-map-marker:before{content:"\e062"}.glyphicon-adjust:before{content:"\e063"}.glyphicon-tint:before{content:"\e064"}.glyphicon-edit:before{content:"\e065"}.glyphicon-share:before{content:"\e066"}.glyphicon-check:before{content:"\e067"}.glyphicon-move:before{content:"\e068"}.glyphicon-step-backward:before{content:"\e069"}.glyphicon-fast-backward:before{content:"\e070"}.glyphicon-backward:before{content:"\e071"}.glyphicon-play:before{content:"\e072"}.glyphicon-pause:before{content:"\e073"}.glyphicon-stop:before{content:"\e074"}.glyphicon-forward:before{content:"\e075"}.glyphicon-fast-forward:before{content:"\e076"}.glyphicon-step-forward:before{content:"\e077"}.glyphicon-eject:before{content:"\e078"}.glyphicon-chevron-left:before{content:"\e079"}.glyphicon-chevron-right:before{content:"\e080"}.glyphicon-plus-sign:before{content:"\e081"}.glyphicon-minus-sign:before{content:"\e082"}.glyphicon-remove-sign:before{content:"\e083"}.glyphicon-ok-sign:before{content:"\e084"}.glyphicon-question-sign:before{content:"\e085"}.glyphicon-info-sign:before{content:"\e086"}.glyphicon-screenshot:before{content:"\e087"}.glyphicon-remove-circle:before{content:"\e088"}.glyphicon-ok-circle:before{content:"\e089"}.glyphicon-ban-circle:before{content:"\e090"}.glyphicon-arrow-left:before{content:"\e091"}.glyphicon-arrow-right:before{content:"\e092"}.glyphicon-arrow-up:before{content:"\e093"}.glyphicon-arrow-down:before{content:"\e094"}.glyphicon-share-alt:before{content:"\e095"}.glyphicon-resize-full:before{content:"\e096"}.glyphicon-resize-small:before{content:"\e097"}.glyphicon-exclamation-sign:before{content:"\e101"}.glyphicon-gift:before{content:"\e102"}.glyphicon-leaf:before{content:"\e103"}.glyphicon-fire:before{content:"\e104"}.glyphicon-eye-open:before{content:"\e105"}.glyphicon-eye-close:before{content:"\e106"}.glyphicon-warning-sign:before{content:"\e107"}.glyphicon-plane:before{content:"\e108"}.glyphicon-calendar:before{content:"\e109"}.glyphicon-random:before{content:"\e110"}.glyphicon-comment:before{content:"\e111"}.glyphicon-magnet:before{content:"\e112"}.glyphicon-chevron-up:before{content:"\e113"}.glyphicon-chevron-down:before{content:"\e114"}.glyphicon-retweet:before{content:"\e115"}.glyphicon-shopping-cart:before{content:"\e116"}.glyphicon-folder-close:before{content:"\e117"}.glyphicon-folder-open:before{content:"\e118"}.glyphicon-resize-vertical:before{content:"\e119"}.glyphicon-resize-horizontal:before{content:"\e120"}.glyphicon-hdd:before{content:"\e121"}.glyphicon-bullhorn:before{content:"\e122"}.glyphicon-bell:before{content:"\e123"}.glyphicon-certificate:before{content:"\e124"}.glyphicon-thumbs-up:before{content:"\e125"}.glyphicon-thumbs-down:before{content:"\e126"}.glyphicon-hand-right:before{content:"\e127"}.glyphicon-hand-left:before{content:"\e128"}.glyphicon-hand-up:before{content:"\e129"}.glyphicon-hand-down:before{content:"\e130"}.glyphicon-circle-arrow-right:before{content:"\e131"}.glyphicon-circle-arrow-left:before{content:"\e132"}.glyphicon-circle-arrow-up:before{content:"\e133"}.glyphicon-circle-arrow-down:before{content:"\e134"}.glyphicon-globe:before{content:"\e135"}.glyphicon-wrench:before{content:"\e136"}.glyphicon-tasks:before{content:"\e137"}.glyphicon-filter:before{content:"\e138"}.glyphicon-briefcase:before{content:"\e139"}.glyphicon-fullscreen:before{content:"\e140"}.glyphicon-dashboard:before{content:"\e141"}.glyphicon-paperclip:before{content:"\e142"}.glyphicon-heart-empty:before{content:"\e143"}.glyphicon-link:before{content:"\e144"}.glyphicon-phone:before{content:"\e145"}.glyphicon-pushpin:before{content:"\e146"}.glyphicon-usd:before{content:"\e148"}.glyphicon-gbp:before{content:"\e149"}.glyphicon-sort:before{content:"\e150"}.glyphicon-sort-by-alphabet:before{content:"\e151"}.glyphicon-sort-by-alphabet-alt:before{content:"\e152"}.glyphicon-sort-by-order:before{content:"\e153"}.glyphicon-sort-by-order-alt:before{content:"\e154"}.glyphicon-sort-by-attributes:before{content:"\e155"}.glyphicon-sort-by-attributes-alt:before{content:"\e156"}.glyphicon-unchecked:before{content:"\e157"}.glyphicon-expand:before{content:"\e158"}.glyphicon-collapse-down:before{content:"\e159"}.glyphicon-collapse-up:before{content:"\e160"}.glyphicon-log-in:before{content:"\e161"}.glyphicon-flash:before{content:"\e162"}.glyphicon-log-out:before{content:"\e163"}.glyphicon-new-window:before{content:"\e164"}.glyphicon-record:before{content:"\e165"}.glyphicon-save:before{content:"\e166"}.glyphicon-open:before{content:"\e167"}.glyphicon-saved:before{content:"\e168"}.glyphicon-import:before{content:"\e169"}.glyphicon-export:before{content:"\e170"}.glyphicon-send:before{content:"\e171"}.glyphicon-floppy-disk:before{content:"\e172"}.glyphicon-floppy-saved:before{content:"\e173"}.glyphicon-floppy-remove:before{content:"\e174"}.glyphicon-floppy-save:before{content:"\e175"}.glyphicon-floppy-open:before{content:"\e176"}.glyphicon-credit-card:before{content:"\e177"}.glyphicon-transfer:before{content:"\e178"}.glyphicon-cutlery:before{content:"\e179"}.glyphicon-header:before{content:"\e180"}.glyphicon-compressed:before{content:"\e181"}.glyphicon-earphone:before{content:"\e182"}.glyphicon-phone-alt:before{content:"\e183"}.glyphicon-tower:before{content:"\e184"}.glyphicon-stats:before{content:"\e185"}.glyphicon-sd-video:before{content:"\e186"}.glyphicon-hd-video:before{content:"\e187"}.glyphicon-subtitles:before{content:"\e188"}.glyphicon-sound-stereo:before{content:"\e189"}.glyphicon-sound-dolby:before{content:"\e190"}.glyphicon-sound-5-1:before{content:"\e191"}.glyphicon-sound-6-1:before{content:"\e192"}.glyphicon-sound-7-1:before{content:"\e193"}.glyphicon-copyright-mark:before{content:"\e194"}.glyphicon-registration-mark:before{content:"\e195"}.glyphicon-cloud-download:before{content:"\e197"}.glyphicon-cloud-upload:before{content:"\e198"}.glyphicon-tree-conifer:before{content:"\e199"}.glyphicon-tree-deciduous:before{content:"\e200"}*{-webkit-box-sizing:border-box;-moz-box-sizing:border-box;box-sizing:border-box}:before,:after{-webkit-box-sizing:border-box;-moz-box-sizing:border-box;box-sizing:border-box}html{font-size:10px;-webkit-tap-highlight-color:rgba(0,0,0,0)}body{font-family:"Helvetica Neue",Helvetica,Arial,sans-serif;font-size:14px;line-height:1.42857143;color:#333;background-color:#fff}input,button,select,textarea{font-family:inherit;font-size:inherit;line-height:inherit}a{color:#428bca;text-decoration:none}a:hover,a:focus{color:#2a6496;text-decoration:underline}a:focus{outline:thin dotted;outline:5px auto -webkit-focus-ring-color;outline-offset:-2px}figure{margin:0}img{vertical-align:middle}.img-responsive,.thumbnail>img,.thumbnail a>img,.carousel-inner>.item>img,.carousel-inner>.item>a>img{display:block;width:100% \9;max-width:100%;height:auto}.img-rounded{border-radius:6px}.img-thumbnail{display:inline-block;width:100% \9;max-width:100%;height:auto;padding:4px;line-height:1.42857143;background-color:#fff;border:1px solid #ddd;border-radius:4px;-webkit-transition:all .2s ease-in-out;-o-transition:all .2s ease-in-out;transition:all .2s ease-in-out}.img-circle{border-radius:50%}hr{margin-top:20px;margin-bottom:20px;border:0;border-top:1px solid #eee}.sr-only{position:absolute;width:1px;height:1px;padding:0;margin:-1px;overflow:hidden;clip:rect(0,0,0,0);border:0}.sr-only-focusable:active,.sr-only-focusable:focus{position:static;width:auto;height:auto;margin:0;overflow:visible;clip:auto}h1,h2,h3,h4,h5,h6,.h1,.h2,.h3,.h4,.h5,.h6{font-family:inherit;font-weight:500;line-height:1.1;color:inherit}h1 small,h2 small,h3 small,h4 small,h5 small,h6 small,.h1 small,.h2 small,.h3 small,.h4 small,.h5 small,.h6 small,h1 .small,h2 .small,h3 .small,h4 .small,h5 .small,h6 .small,.h1 .small,.h2 .small,.h3 .small,.h4 .small,.h5 .small,.h6 .small{font-weight:400;line-height:1;color:#777}h1,.h1,h2,.h2,h3,.h3{margin-top:20px;margin-bottom:10px}h1 small,.h1 small,h2 small,.h2 small,h3 small,.h3 small,h1 .small,.h1 .small,h2 .small,.h2 .small,h3 .small,.h3 .small{font-size:65%}h4,.h4,h5,.h5,h6,.h6{margin-top:10px;margin-bottom:10px}h4 small,.h4 small,h5 small,.h5 small,h6 small,.h6 small,h4 .small,.h4 .small,h5 .small,.h5 .small,h6 .small,.h6 .small{font-size:75%}h1,.h1{font-size:36px}h2,.h2{font-size:30px}h3,.h3{font-size:24px}h4,.h4{font-size:18px}h5,.h5{font-size:14px}h6,.h6{font-size:12px}p{margin:0 0 10px}.lead{margin-bottom:20px;font-size:16px;font-weight:300;line-height:1.4}@media (min-width:768px){.lead{font-size:21px}}small,.small{font-size:85%}cite{font-style:normal}mark,.mark{padding:.2em;background-color:#fcf8e3}.text-left{text-align:left}.text-right{text-align:right}.text-center{text-align:center}.text-justify{text-align:justify}.text-nowrap{white-space:nowrap}.text-lowercase{text-transform:lowercase}.text-uppercase{text-transform:uppercase}.text-capitalize{text-transform:capitalize}.text-muted{color:#777}.text-primary{color:#428bca}a.text-primary:hover{color:#3071a9}.text-success{color:#3c763d}a.text-success:hover{color:#2b542c}.text-info{color:#31708f}a.text-info:hover{color:#245269}.text-warning{color:#8a6d3b}a.text-warning:hover{color:#66512c}.text-danger{color:#a94442}a.text-danger:hover{color:#843534}.bg-primary{color:#fff;background-color:#428bca}a.bg-primary:hover{background-color:#3071a9}.bg-success{background-color:#dff0d8}a.bg-success:hover{background-color:#c1e2b3}.bg-info{background-color:#d9edf7}a.bg-info:hover{background-color:#afd9ee}.bg-warning{background-color:#fcf8e3}a.bg-warning:hover{background-color:#f7ecb5}.bg-danger{background-color:#f2dede}a.bg-danger:hover{background-color:#e4b9b9}.page-header{padding-bottom:9px;margin:40px 0 20px;border-bottom:1px solid #eee}ul,ol{margin-top:0;margin-bottom:10px}ul ul,ol ul,ul ol,ol ol{margin-bottom:0}.list-unstyled{padding-left:0;list-style:none}.list-inline{padding-left:0;margin-left:-5px;list-style:none}.list-inline>li{display:inline-block;padding-right:5px;padding-left:5px}dl{margin-top:0;margin-bottom:20px}dt,dd{line-height:1.42857143}dt{font-weight:700}dd{margin-left:0}@media (min-width:768px){.dl-horizontal dt{float:left;width:160px;overflow:hidden;clear:left;text-align:right;text-overflow:ellipsis;white-space:nowrap}.dl-horizontal dd{margin-left:180px}}abbr[title],abbr[data-original-title]{cursor:help;border-bottom:1px dotted #777}.initialism{font-size:90%;text-transform:uppercase}blockquote{padding:10px 20px;margin:0 0 20px;font-size:17.5px;border-left:5px solid #eee}blockquote p:last-child,blockquote ul:last-child,blockquote ol:last-child{margin-bottom:0}blockquote footer,blockquote small,blockquote .small{display:block;font-size:80%;line-height:1.42857143;color:#777}blockquote footer:before,blockquote small:before,blockquote .small:before{content:'\2014 \00A0'}.blockquote-reverse,blockquote.pull-right{padding-right:15px;padding-left:0;text-align:right;border-right:5px solid #eee;border-left:0}.blockquote-reverse footer:before,blockquote.pull-right footer:before,.blockquote-reverse small:before,blockquote.pull-right small:before,.blockquote-reverse .small:before,blockquote.pull-right .small:before{content:''}.blockquote-reverse footer:after,blockquote.pull-right footer:after,.blockquote-reverse small:after,blockquote.pull-right small:after,.blockquote-reverse .small:after,blockquote.pull-right .small:after{content:'\00A0 \2014'}blockquote:before,blockquote:after{content:""}address{margin-bottom:20px;font-style:normal;line-height:1.42857143}code,kbd,pre,samp{font-family:Menlo,Monaco,Consolas,"Courier New",monospace}code{padding:2px 4px;font-size:90%;color:#c7254e;background-color:#f9f2f4;border-radius:4px}kbd{padding:2px 4px;font-size:90%;color:#fff;background-color:#333;border-radius:3px;-webkit-box-shadow:inset 0 -1px 0 rgba(0,0,0,.25);box-shadow:inset 0 -1px 0 rgba(0,0,0,.25)}kbd kbd{padding:0;font-size:100%;-webkit-box-shadow:none;box-shadow:none}pre{display:block;padding:9.5px;margin:0 0 10px;font-size:13px;line-height:1.42857143;color:#333;word-break:break-all;word-wrap:break-word;background-color:#f5f5f5;border:1px solid #ccc;border-radius:4px}pre code{padding:0;font-size:inherit;color:inherit;white-space:pre-wrap;background-color:transparent;border-radius:0}.pre-scrollable{max-height:340px;overflow-y:scroll}.container{padding-right:15px;padding-left:15px;margin-right:auto;margin-left:auto}@media (min-width:768px){.container{width:750px}}@media (min-width:992px){.container{width:970px}}@media (min-width:1200px){.container{width:1170px}}.container-fluid{padding-right:15px;padding-left:15px;margin-right:auto;margin-left:auto}.row{margin-right:-15px;margin-left:-15px}.col-xs-1,.col-sm-1,.col-md-1,.col-lg-1,.col-xs-2,.col-sm-2,.col-md-2,.col-lg-2,.col-xs-3,.col-sm-3,.col-md-3,.col-lg-3,.col-xs-4,.col-sm-4,.col-md-4,.col-lg-4,.col-xs-5,.col-sm-5,.col-md-5,.col-lg-5,.col-xs-6,.col-sm-6,.col-md-6,.col-lg-6,.col-xs-7,.col-sm-7,.col-md-7,.col-lg-7,.col-xs-8,.col-sm-8,.col-md-8,.col-lg-8,.col-xs-9,.col-sm-9,.col-md-9,.col-lg-9,.col-xs-10,.col-sm-10,.col-md-10,.col-lg-10,.col-xs-11,.col-sm-11,.col-md-11,.col-lg-11,.col-xs-12,.col-sm-12,.col-md-12,.col-lg-12{position:relative;min-height:1px;padding-right:15px;padding-left:15px}.col-xs-1,.col-xs-2,.col-xs-3,.col-xs-4,.col-xs-5,.col-xs-6,.col-xs-7,.col-xs-8,.col-xs-9,.col-xs-10,.col-xs-11,.col-xs-12{float:left}.col-xs-12{width:100%}.col-xs-11{width:91.66666667%}.col-xs-10{width:83.33333333%}.col-xs-9{width:75%}.col-xs-8{width:66.66666667%}.col-xs-7{width:58.33333333%}.col-xs-6{width:50%}.col-xs-5{width:41.66666667%}.col-xs-4{width:33.33333333%}.col-xs-3{width:25%}.col-xs-2{width:16.66666667%}.col-xs-1{width:8.33333333%}.col-xs-pull-12{right:100%}.col-xs-pull-11{right:91.66666667%}.col-xs-pull-10{right:83.33333333%}.col-xs-pull-9{right:75%}.col-xs-pull-8{right:66.66666667%}.col-xs-pull-7{right:58.33333333%}.col-xs-pull-6{right:50%}.col-xs-pull-5{right:41.66666667%}.col-xs-pull-4{right:33.33333333%}.col-xs-pull-3{right:25%}.col-xs-pull-2{right:16.66666667%}.col-xs-pull-1{right:8.33333333%}.col-xs-pull-0{right:auto}.col-xs-push-12{left:100%}.col-xs-push-11{left:91.66666667%}.col-xs-push-10{left:83.33333333%}.col-xs-push-9{left:75%}.col-xs-push-8{left:66.66666667%}.col-xs-push-7{left:58.33333333%}.col-xs-push-6{left:50%}.col-xs-push-5{left:41.66666667%}.col-xs-push-4{left:33.33333333%}.col-xs-push-3{left:25%}.col-xs-push-2{left:16.66666667%}.col-xs-push-1{left:8.33333333%}.col-xs-push-0{left:auto}.col-xs-offset-12{margin-left:100%}.col-xs-offset-11{margin-left:91.66666667%}.col-xs-offset-10{margin-left:83.33333333%}.col-xs-offset-9{margin-left:75%}.col-xs-offset-8{margin-left:66.66666667%}.col-xs-offset-7{margin-left:58.33333333%}.col-xs-offset-6{margin-left:50%}.col-xs-offset-5{margin-left:41.66666667%}.col-xs-offset-4{margin-left:33.33333333%}.col-xs-offset-3{margin-left:25%}.col-xs-offset-2{margin-left:16.66666667%}.col-xs-offset-1{margin-left:8.33333333%}.col-xs-offset-0{margin-left:0}@media (min-width:768px){.col-sm-1,.col-sm-2,.col-sm-3,.col-sm-4,.col-sm-5,.col-sm-6,.col-sm-7,.col-sm-8,.col-sm-9,.col-sm-10,.col-sm-11,.col-sm-12{float:left}.col-sm-12{width:100%}.col-sm-11{width:91.66666667%}.col-sm-10{width:83.33333333%}.col-sm-9{width:75%}.col-sm-8{width:66.66666667%}.col-sm-7{width:58.33333333%}.col-sm-6{width:50%}.col-sm-5{width:41.66666667%}.col-sm-4{width:33.33333333%}.col-sm-3{width:25%}.col-sm-2{width:16.66666667%}.col-sm-1{width:8.33333333%}.col-sm-pull-12{right:100%}.col-sm-pull-11{right:91.66666667%}.col-sm-pull-10{right:83.33333333%}.col-sm-pull-9{right:75%}.col-sm-pull-8{right:66.66666667%}.col-sm-pull-7{right:58.33333333%}.col-sm-pull-6{right:50%}.col-sm-pull-5{right:41.66666667%}.col-sm-pull-4{right:33.33333333%}.col-sm-pull-3{right:25%}.col-sm-pull-2{right:16.66666667%}.col-sm-pull-1{right:8.33333333%}.col-sm-pull-0{right:auto}.col-sm-push-12{left:100%}.col-sm-push-11{left:91.66666667%}.col-sm-push-10{left:83.33333333%}.col-sm-push-9{left:75%}.col-sm-push-8{left:66.66666667%}.col-sm-push-7{left:58.33333333%}.col-sm-push-6{left:50%}.col-sm-push-5{left:41.66666667%}.col-sm-push-4{left:33.33333333%}.col-sm-push-3{left:25%}.col-sm-push-2{left:16.66666667%}.col-sm-push-1{left:8.33333333%}.col-sm-push-0{left:auto}.col-sm-offset-12{margin-left:100%}.col-sm-offset-11{margin-left:91.66666667%}.col-sm-offset-10{margin-left:83.33333333%}.col-sm-offset-9{margin-left:75%}.col-sm-offset-8{margin-left:66.66666667%}.col-sm-offset-7{margin-left:58.33333333%}.col-sm-offset-6{margin-left:50%}.col-sm-offset-5{margin-left:41.66666667%}.col-sm-offset-4{margin-left:33.33333333%}.col-sm-offset-3{margin-left:25%}.col-sm-offset-2{margin-left:16.66666667%}.col-sm-offset-1{margin-left:8.33333333%}.col-sm-offset-0{margin-left:0}}@media (min-width:992px){.col-md-1,.col-md-2,.col-md-3,.col-md-4,.col-md-5,.col-md-6,.col-md-7,.col-md-8,.col-md-9,.col-md-10,.col-md-11,.col-md-12{float:left}.col-md-12{width:100%}.col-md-11{width:91.66666667%}.col-md-10{width:83.33333333%}.col-md-9{width:75%}.col-md-8{width:66.66666667%}.col-md-7{width:58.33333333%}.col-md-6{width:50%}.col-md-5{width:41.66666667%}.col-md-4{width:33.33333333%}.col-md-3{width:25%}.col-md-2{width:16.66666667%}.col-md-1{width:8.33333333%}.col-md-pull-12{right:100%}.col-md-pull-11{right:91.66666667%}.col-md-pull-10{right:83.33333333%}.col-md-pull-9{right:75%}.col-md-pull-8{right:66.66666667%}.col-md-pull-7{right:58.33333333%}.col-md-pull-6{right:50%}.col-md-pull-5{right:41.66666667%}.col-md-pull-4{right:33.33333333%}.col-md-pull-3{right:25%}.col-md-pull-2{right:16.66666667%}.col-md-pull-1{right:8.33333333%}.col-md-pull-0{right:auto}.col-md-push-12{left:100%}.col-md-push-11{left:91.66666667%}.col-md-push-10{left:83.33333333%}.col-md-push-9{left:75%}.col-md-push-8{left:66.66666667%}.col-md-push-7{left:58.33333333%}.col-md-push-6{left:50%}.col-md-push-5{left:41.66666667%}.col-md-push-4{left:33.33333333%}.col-md-push-3{left:25%}.col-md-push-2{left:16.66666667%}.col-md-push-1{left:8.33333333%}.col-md-push-0{left:auto}.col-md-offset-12{margin-left:100%}.col-md-offset-11{margin-left:91.66666667%}.col-md-offset-10{margin-left:83.33333333%}.col-md-offset-9{margin-left:75%}.col-md-offset-8{margin-left:66.66666667%}.col-md-offset-7{margin-left:58.33333333%}.col-md-offset-6{margin-left:50%}.col-md-offset-5{margin-left:41.66666667%}.col-md-offset-4{margin-left:33.33333333%}.col-md-offset-3{margin-left:25%}.col-md-offset-2{margin-left:16.66666667%}.col-md-offset-1{margin-left:8.33333333%}.col-md-offset-0{margin-left:0}}@media (min-width:1200px){.col-lg-1,.col-lg-2,.col-lg-3,.col-lg-4,.col-lg-5,.col-lg-6,.col-lg-7,.col-lg-8,.col-lg-9,.col-lg-10,.col-lg-11,.col-lg-12{float:left}.col-lg-12{width:100%}.col-lg-11{width:91.66666667%}.col-lg-10{width:83.33333333%}.col-lg-9{width:75%}.col-lg-8{width:66.66666667%}.col-lg-7{width:58.33333333%}.col-lg-6{width:50%}.col-lg-5{width:41.66666667%}.col-lg-4{width:33.33333333%}.col-lg-3{width:25%}.col-lg-2{width:16.66666667%}.col-lg-1{width:8.33333333%}.col-lg-pull-12{right:100%}.col-lg-pull-11{right:91.66666667%}.col-lg-pull-10{right:83.33333333%}.col-lg-pull-9{right:75%}.col-lg-pull-8{right:66.66666667%}.col-lg-pull-7{right:58.33333333%}.col-lg-pull-6{right:50%}.col-lg-pull-5{right:41.66666667%}.col-lg-pull-4{right:33.33333333%}.col-lg-pull-3{right:25%}.col-lg-pull-2{right:16.66666667%}.col-lg-pull-1{right:8.33333333%}.col-lg-pull-0{right:auto}.col-lg-push-12{left:100%}.col-lg-push-11{left:91.66666667%}.col-lg-push-10{left:83.33333333%}.col-lg-push-9{left:75%}.col-lg-push-8{left:66.66666667%}.col-lg-push-7{left:58.33333333%}.col-lg-push-6{left:50%}.col-lg-push-5{left:41.66666667%}.col-lg-push-4{left:33.33333333%}.col-lg-push-3{left:25%}.col-lg-push-2{left:16.66666667%}.col-lg-push-1{left:8.33333333%}.col-lg-push-0{left:auto}.col-lg-offset-12{margin-left:100%}.col-lg-offset-11{margin-left:91.66666667%}.col-lg-offset-10{margin-left:83.33333333%}.col-lg-offset-9{margin-left:75%}.col-lg-offset-8{margin-left:66.66666667%}.col-lg-offset-7{margin-left:58.33333333%}.col-lg-offset-6{margin-left:50%}.col-lg-offset-5{margin-left:41.66666667%}.col-lg-offset-4{margin-left:33.33333333%}.col-lg-offset-3{margin-left:25%}.col-lg-offset-2{margin-left:16.66666667%}.col-lg-offset-1{margin-left:8.33333333%}.col-lg-offset-0{margin-left:0}}table{background-color:transparent}th{text-align:left}.table{width:100%;max-width:100%;margin-bottom:20px}.table>thead>tr>th,.table>tbody>tr>th,.table>tfoot>tr>th,.table>thead>tr>td,.table>tbody>tr>td,.table>tfoot>tr>td{padding:8px;line-height:1.42857143;vertical-align:top;border-top:1px solid #ddd}.table>thead>tr>th{vertical-align:bottom;border-bottom:2px solid #ddd}.table>caption+thead>tr:first-child>th,.table>colgroup+thead>tr:first-child>th,.table>thead:first-child>tr:first-child>th,.table>caption+thead>tr:first-child>td,.table>colgroup+thead>tr:first-child>td,.table>thead:first-child>tr:first-child>td{border-top:0}.table>tbody+tbody{border-top:2px solid #ddd}.table .table{background-color:#fff}.table-condensed>thead>tr>th,.table-condensed>tbody>tr>th,.table-condensed>tfoot>tr>th,.table-condensed>thead>tr>td,.table-condensed>tbody>tr>td,.table-condensed>tfoot>tr>td{padding:5px}.table-bordered{border:1px solid #ddd}.table-bordered>thead>tr>th,.table-bordered>tbody>tr>th,.table-bordered>tfoot>tr>th,.table-bordered>thead>tr>td,.table-bordered>tbody>tr>td,.table-bordered>tfoot>tr>td{border:1px solid #ddd}.table-bordered>thead>tr>th,.table-bordered>thead>tr>td{border-bottom-width:2px}.table-striped>tbody>tr:nth-child(odd)>td,.table-striped>tbody>tr:nth-child(odd)>th{background-color:#f9f9f9}.table-hover>tbody>tr:hover>td,.table-hover>tbody>tr:hover>th{background-color:#f5f5f5}table col[class*=col-]{position:static;display:table-column;float:none}table td[class*=col-],table th[class*=col-]{position:static;display:table-cell;float:none}.table>thead>tr>td.active,.table>tbody>tr>td.active,.table>tfoot>tr>td.active,.table>thead>tr>th.active,.table>tbody>tr>th.active,.table>tfoot>tr>th.active,.table>thead>tr.active>td,.table>tbody>tr.active>td,.table>tfoot>tr.active>td,.table>thead>tr.active>th,.table>tbody>tr.active>th,.table>tfoot>tr.active>th{background-color:#f5f5f5}.table-hover>tbody>tr>td.active:hover,.table-hover>tbody>tr>th.active:hover,.table-hover>tbody>tr.active:hover>td,.table-hover>tbody>tr:hover>.active,.table-hover>tbody>tr.active:hover>th{background-color:#e8e8e8}.table>thead>tr>td.success,.table>tbody>tr>td.success,.table>tfoot>tr>td.success,.table>thead>tr>th.success,.table>tbody>tr>th.success,.table>tfoot>tr>th.success,.table>thead>tr.success>td,.table>tbody>tr.success>td,.table>tfoot>tr.success>td,.table>thead>tr.success>th,.table>tbody>tr.success>th,.table>tfoot>tr.success>th{background-color:#dff0d8}.table-hover>tbody>tr>td.success:hover,.table-hover>tbody>tr>th.success:hover,.table-hover>tbody>tr.success:hover>td,.table-hover>tbody>tr:hover>.success,.table-hover>tbody>tr.success:hover>th{background-color:#d0e9c6}.table>thead>tr>td.info,.table>tbody>tr>td.info,.table>tfoot>tr>td.info,.table>thead>tr>th.info,.table>tbody>tr>th.info,.table>tfoot>tr>th.info,.table>thead>tr.info>td,.table>tbody>tr.info>td,.table>tfoot>tr.info>td,.table>thead>tr.info>th,.table>tbody>tr.info>th,.table>tfoot>tr.info>th{background-color:#d9edf7}.table-hover>tbody>tr>td.info:hover,.table-hover>tbody>tr>th.info:hover,.table-hover>tbody>tr.info:hover>td,.table-hover>tbody>tr:hover>.info,.table-hover>tbody>tr.info:hover>th{background-color:#c4e3f3}.table>thead>tr>td.warning,.table>tbody>tr>td.warning,.table>tfoot>tr>td.warning,.table>thead>tr>th.warning,.table>tbody>tr>th.warning,.table>tfoot>tr>th.warning,.table>thead>tr.warning>td,.table>tbody>tr.warning>td,.table>tfoot>tr.warning>td,.table>thead>tr.warning>th,.table>tbody>tr.warning>th,.table>tfoot>tr.warning>th{background-color:#fcf8e3}.table-hover>tbody>tr>td.warning:hover,.table-hover>tbody>tr>th.warning:hover,.table-hover>tbody>tr.warning:hover>td,.table-hover>tbody>tr:hover>.warning,.table-hover>tbody>tr.warning:hover>th{background-color:#faf2cc}.table>thead>tr>td.danger,.table>tbody>tr>td.danger,.table>tfoot>tr>td.danger,.table>thead>tr>th.danger,.table>tbody>tr>th.danger,.table>tfoot>tr>th.danger,.table>thead>tr.danger>td,.table>tbody>tr.danger>td,.table>tfoot>tr.danger>td,.table>thead>tr.danger>th,.table>tbody>tr.danger>th,.table>tfoot>tr.danger>th{background-color:#f2dede}.table-hover>tbody>tr>td.danger:hover,.table-hover>tbody>tr>th.danger:hover,.table-hover>tbody>tr.danger:hover>td,.table-hover>tbody>tr:hover>.danger,.table-hover>tbody>tr.danger:hover>th{background-color:#ebcccc}@media screen and (max-width:767px){.table-responsive{width:100%;margin-bottom:15px;overflow-x:auto;overflow-y:hidden;-webkit-overflow-scrolling:touch;-ms-overflow-style:-ms-autohiding-scrollbar;border:1px solid #ddd}.table-responsive>.table{margin-bottom:0}.table-responsive>.table>thead>tr>th,.table-responsive>.table>tbody>tr>th,.table-responsive>.table>tfoot>tr>th,.table-responsive>.table>thead>tr>td,.table-responsive>.table>tbody>tr>td,.table-responsive>.table>tfoot>tr>td{white-space:nowrap}.table-responsive>.table-bordered{border:0}.table-responsive>.table-bordered>thead>tr>th:first-child,.table-responsive>.table-bordered>tbody>tr>th:first-child,.table-responsive>.table-bordered>tfoot>tr>th:first-child,.table-responsive>.table-bordered>thead>tr>td:first-child,.table-responsive>.table-bordered>tbody>tr>td:first-child,.table-responsive>.table-bordered>tfoot>tr>td:first-child{border-left:0}.table-responsive>.table-bordered>thead>tr>th:last-child,.table-responsive>.table-bordered>tbody>tr>th:last-child,.table-responsive>.table-bordered>tfoot>tr>th:last-child,.table-responsive>.table-bordered>thead>tr>td:last-child,.table-responsive>.table-bordered>tbody>tr>td:last-child,.table-responsive>.table-bordered>tfoot>tr>td:last-child{border-right:0}.table-responsive>.table-bordered>tbody>tr:last-child>th,.table-responsive>.table-bordered>tfoot>tr:last-child>th,.table-responsive>.table-bordered>tbody>tr:last-child>td,.table-responsive>.table-bordered>tfoot>tr:last-child>td{border-bottom:0}}fieldset{min-width:0;padding:0;margin:0;border:0}legend{display:block;width:100%;padding:0;margin-bottom:20px;font-size:21px;line-height:inherit;color:#333;border:0;border-bottom:1px solid #e5e5e5}label{display:inline-block;max-width:100%;margin-bottom:5px;font-weight:700}input[type=search]{-webkit-box-sizing:border-box;-moz-box-sizing:border-box;box-sizing:border-box}input[type=radio],input[type=checkbox]{margin:4px 0 0;margin-top:1px \9;line-height:normal}input[type=file]{display:block}input[type=range]{display:block;width:100%}select[multiple],select[size]{height:auto}input[type=file]:focus,input[type=radio]:focus,input[type=checkbox]:focus{outline:thin dotted;outline:5px auto -webkit-focus-ring-color;outline-offset:-2px}output{display:block;padding-top:7px;font-size:14px;line-height:1.42857143;color:#555}.form-control{display:block;width:100%;height:34px;padding:6px 12px;font-size:14px;line-height:1.42857143;color:#555;background-color:#fff;background-image:none;border:1px solid #ccc;border-radius:4px;-webkit-box-shadow:inset 0 1px 1px rgba(0,0,0,.075);box-shadow:inset 0 1px 1px rgba(0,0,0,.075);-webkit-transition:border-color ease-in-out .15s,-webkit-box-shadow ease-in-out .15s;-o-transition:border-color ease-in-out .15s,box-shadow ease-in-out .15s;transition:border-color ease-in-out .15s,box-shadow ease-in-out .15s}.form-control:focus{border-color:#66afe9;outline:0;-webkit-box-shadow:inset 0 1px 1px rgba(0,0,0,.075),0 0 8px rgba(102,175,233,.6);box-shadow:inset 0 1px 1px rgba(0,0,0,.075),0 0 8px rgba(102,175,233,.6)}.form-control::-moz-placeholder{color:#777;opacity:1}.form-control:-ms-input-placeholder{color:#777}.form-control::-webkit-input-placeholder{color:#777}.form-control[disabled],.form-control[readonly],fieldset[disabled] .form-control{cursor:not-allowed;background-color:#eee;opacity:1}textarea.form-control{height:auto}input[type=search]{-webkit-appearance:none}input[type=date],input[type=time],input[type=datetime-local],input[type=month]{line-height:34px;line-height:1.42857143 \0}input[type=date].input-sm,input[type=time].input-sm,input[type=datetime-local].input-sm,input[type=month].input-sm{line-height:30px}input[type=date].input-lg,input[type=time].input-lg,input[type=datetime-local].input-lg,input[type=month].input-lg{line-height:46px}.form-group{margin-bottom:15px}.radio,.checkbox{position:relative;display:block;min-height:20px;margin-top:10px;margin-bottom:10px}.radio label,.checkbox label{padding-left:20px;margin-bottom:0;font-weight:400;cursor:pointer}.radio input[type=radio],.radio-inline input[type=radio],.checkbox input[type=checkbox],.checkbox-inline input[type=checkbox]{position:absolute;margin-top:4px \9;margin-left:-20px}.radio+.radio,.checkbox+.checkbox{margin-top:-5px}.radio-inline,.checkbox-inline{display:inline-block;padding-left:20px;margin-bottom:0;font-weight:400;vertical-align:middle;cursor:pointer}.radio-inline+.radio-inline,.checkbox-inline+.checkbox-inline{margin-top:0;margin-left:10px}input[type=radio][disabled],input[type=checkbox][disabled],input[type=radio].disabled,input[type=checkbox].disabled,fieldset[disabled] input[type=radio],fieldset[disabled] input[type=checkbox]{cursor:not-allowed}.radio-inline.disabled,.checkbox-inline.disabled,fieldset[disabled] .radio-inline,fieldset[disabled] .checkbox-inline{cursor:not-allowed}.radio.disabled label,.checkbox.disabled label,fieldset[disabled] .radio label,fieldset[disabled] .checkbox label{cursor:not-allowed}.form-control-static{padding-top:7px;padding-bottom:7px;margin-bottom:0}.form-control-static.input-lg,.form-control-static.input-sm{padding-right:0;padding-left:0}.input-sm,.form-horizontal .form-group-sm .form-control{height:30px;padding:5px 10px;font-size:12px;line-height:1.5;border-radius:3px}select.input-sm{height:30px;line-height:30px}textarea.input-sm,select[multiple].input-sm{height:auto}.input-lg,.form-horizontal .form-group-lg .form-control{height:46px;padding:10px 16px;font-size:18px;line-height:1.33;border-radius:6px}select.input-lg{height:46px;line-height:46px}textarea.input-lg,select[multiple].input-lg{height:auto}.has-feedback{position:relative}.has-feedback .form-control{padding-right:42.5px}.form-control-feedback{position:absolute;top:25px;right:0;z-index:2;display:block;width:34px;height:34px;line-height:34px;text-align:center}.input-lg+.form-control-feedback{width:46px;height:46px;line-height:46px}.input-sm+.form-control-feedback{width:30px;height:30px;line-height:30px}.has-success .help-block,.has-success .control-label,.has-success .radio,.has-success .checkbox,.has-success .radio-inline,.has-success .checkbox-inline{color:#3c763d}.has-success .form-control{border-color:#3c763d;-webkit-box-shadow:inset 0 1px 1px rgba(0,0,0,.075);box-shadow:inset 0 1px 1px rgba(0,0,0,.075)}.has-success .form-control:focus{border-color:#2b542c;-webkit-box-shadow:inset 0 1px 1px rgba(0,0,0,.075),0 0 6px #67b168;box-shadow:inset 0 1px 1px rgba(0,0,0,.075),0 0 6px #67b168}.has-success .input-group-addon{color:#3c763d;background-color:#dff0d8;border-color:#3c763d}.has-success .form-control-feedback{color:#3c763d}.has-warning .help-block,.has-warning .control-label,.has-warning .radio,.has-warning .checkbox,.has-warning .radio-inline,.has-warning .checkbox-inline{color:#8a6d3b}.has-warning .form-control{border-color:#8a6d3b;-webkit-box-shadow:inset 0 1px 1px rgba(0,0,0,.075);box-shadow:inset 0 1px 1px rgba(0,0,0,.075)}.has-warning .form-control:focus{border-color:#66512c;-webkit-box-shadow:inset 0 1px 1px rgba(0,0,0,.075),0 0 6px #c0a16b;box-shadow:inset 0 1px 1px rgba(0,0,0,.075),0 0 6px #c0a16b}.has-warning .input-group-addon{color:#8a6d3b;background-color:#fcf8e3;border-color:#8a6d3b}.has-warning .form-control-feedback{color:#8a6d3b}.has-error .help-block,.has-error .control-label,.has-error .radio,.has-error .checkbox,.has-error .radio-inline,.has-error .checkbox-inline{color:#a94442}.has-error .form-control{border-color:#a94442;-webkit-box-shadow:inset 0 1px 1px rgba(0,0,0,.075);box-shadow:inset 0 1px 1px rgba(0,0,0,.075)}.has-error .form-control:focus{border-color:#843534;-webkit-box-shadow:inset 0 1px 1px rgba(0,0,0,.075),0 0 6px #ce8483;box-shadow:inset 0 1px 1px rgba(0,0,0,.075),0 0 6px #ce8483}.has-error .input-group-addon{color:#a94442;background-color:#f2dede;border-color:#a94442}.has-error .form-control-feedback{color:#a94442}.has-feedback label.sr-only~.form-control-feedback{top:0}.help-block{display:block;margin-top:5px;margin-bottom:10px;color:#737373}@media (min-width:768px){.form-inline .form-group{display:inline-block;margin-bottom:0;vertical-align:middle}.form-inline .form-control{display:inline-block;width:auto;vertical-align:middle}.form-inline .input-group{display:inline-table;vertical-align:middle}.form-inline .input-group .input-group-addon,.form-inline .input-group .input-group-btn,.form-inline .input-group .form-control{width:auto}.form-inline .input-group>.form-control{width:100%}.form-inline .control-label{margin-bottom:0;vertical-align:middle}.form-inline .radio,.form-inline .checkbox{display:inline-block;margin-top:0;margin-bottom:0;vertical-align:middle}.form-inline .radio label,.form-inline .checkbox label{padding-left:0}.form-inline .radio input[type=radio],.form-inline .checkbox input[type=checkbox]{position:relative;margin-left:0}.form-inline .has-feedback .form-control-feedback{top:0}}.form-horizontal .radio,.form-horizontal .checkbox,.form-horizontal .radio-inline,.form-horizontal .checkbox-inline{padding-top:7px;margin-top:0;margin-bottom:0}.form-horizontal .radio,.form-horizontal .checkbox{min-height:27px}.form-horizontal .form-group{margin-right:-15px;margin-left:-15px}@media (min-width:768px){.form-horizontal .control-label{padding-top:7px;margin-bottom:0;text-align:right}}.form-horizontal .has-feedback .form-control-feedback{top:0;right:15px}@media (min-width:768px){.form-horizontal .form-group-lg .control-label{padding-top:14.3px}}@media (min-width:768px){.form-horizontal .form-group-sm .control-label{padding-top:6px}}.btn{display:inline-block;padding:6px 12px;margin-bottom:0;font-size:14px;font-weight:400;line-height:1.42857143;text-align:center;white-space:nowrap;vertical-align:middle;cursor:pointer;-webkit-user-select:none;-moz-user-select:none;-ms-user-select:none;user-select:none;background-image:none;border:1px solid transparent;border-radius:4px}.btn:focus,.btn:active:focus,.btn.active:focus{outline:thin dotted;outline:5px auto -webkit-focus-ring-color;outline-offset:-2px}.btn:hover,.btn:focus{color:#333;text-decoration:none}.btn:active,.btn.active{background-image:none;outline:0;-webkit-box-shadow:inset 0 3px 5px rgba(0,0,0,.125);box-shadow:inset 0 3px 5px rgba(0,0,0,.125)}.btn.disabled,.btn[disabled],fieldset[disabled] .btn{pointer-events:none;cursor:not-allowed;filter:alpha(opacity=65);-webkit-box-shadow:none;box-shadow:none;opacity:.65}.btn-default{color:#333;background-color:#fff;border-color:#ccc}.btn-default:hover,.btn-default:focus,.btn-default:active,.btn-default.active,.open>.dropdown-toggle.btn-default{color:#333;background-color:#e6e6e6;border-color:#adadad}.btn-default:active,.btn-default.active,.open>.dropdown-toggle.btn-default{background-image:none}.btn-default.disabled,.btn-default[disabled],fieldset[disabled] .btn-default,.btn-default.disabled:hover,.btn-default[disabled]:hover,fieldset[disabled] .btn-default:hover,.btn-default.disabled:focus,.btn-default[disabled]:focus,fieldset[disabled] .btn-default:focus,.btn-default.disabled:active,.btn-default[disabled]:active,fieldset[disabled] .btn-default:active,.btn-default.disabled.active,.btn-default[disabled].active,fieldset[disabled] .btn-default.active{background-color:#fff;border-color:#ccc}.btn-default .badge{color:#fff;background-color:#333}.btn-primary{color:#fff;background-color:#428bca;border-color:#357ebd}.btn-primary:hover,.btn-primary:focus,.btn-primary:active,.btn-primary.active,.open>.dropdown-toggle.btn-primary{color:#fff;background-color:#3071a9;border-color:#285e8e}.btn-primary:active,.btn-primary.active,.open>.dropdown-toggle.btn-primary{background-image:none}.btn-primary.disabled,.btn-primary[disabled],fieldset[disabled] .btn-primary,.btn-primary.disabled:hover,.btn-primary[disabled]:hover,fieldset[disabled] .btn-primary:hover,.btn-primary.disabled:focus,.btn-primary[disabled]:focus,fieldset[disabled] .btn-primary:focus,.btn-primary.disabled:active,.btn-primary[disabled]:active,fieldset[disabled] .btn-primary:active,.btn-primary.disabled.active,.btn-primary[disabled].active,fieldset[disabled] .btn-primary.active{background-color:#428bca;border-color:#357ebd}.btn-primary .badge{color:#428bca;background-color:#fff}.btn-success{color:#fff;background-color:#5cb85c;border-color:#4cae4c}.btn-success:hover,.btn-success:focus,.btn-success:active,.btn-success.active,.open>.dropdown-toggle.btn-success{color:#fff;background-color:#449d44;border-color:#398439}.btn-success:active,.btn-success.active,.open>.dropdown-toggle.btn-success{background-image:none}.btn-success.disabled,.btn-success[disabled],fieldset[disabled] .btn-success,.btn-success.disabled:hover,.btn-success[disabled]:hover,fieldset[disabled] .btn-success:hover,.btn-success.disabled:focus,.btn-success[disabled]:focus,fieldset[disabled] .btn-success:focus,.btn-success.disabled:active,.btn-success[disabled]:active,fieldset[disabled] .btn-success:active,.btn-success.disabled.active,.btn-success[disabled].active,fieldset[disabled] .btn-success.active{background-color:#5cb85c;border-color:#4cae4c}.btn-success .badge{color:#5cb85c;background-color:#fff}.btn-info{color:#fff;background-color:#5bc0de;border-color:#46b8da}.btn-info:hover,.btn-info:focus,.btn-info:active,.btn-info.active,.open>.dropdown-toggle.btn-info{color:#fff;background-color:#31b0d5;border-color:#269abc}.btn-info:active,.btn-info.active,.open>.dropdown-toggle.btn-info{background-image:none}.btn-info.disabled,.btn-info[disabled],fieldset[disabled] .btn-info,.btn-info.disabled:hover,.btn-info[disabled]:hover,fieldset[disabled] .btn-info:hover,.btn-info.disabled:focus,.btn-info[disabled]:focus,fieldset[disabled] .btn-info:focus,.btn-info.disabled:active,.btn-info[disabled]:active,fieldset[disabled] .btn-info:active,.btn-info.disabled.active,.btn-info[disabled].active,fieldset[disabled] .btn-info.active{background-color:#5bc0de;border-color:#46b8da}.btn-info .badge{color:#5bc0de;background-color:#fff}.btn-warning{color:#fff;background-color:#f0ad4e;border-color:#eea236}.btn-warning:hover,.btn-warning:focus,.btn-warning:active,.btn-warning.active,.open>.dropdown-toggle.btn-warning{color:#fff;background-color:#ec971f;border-color:#d58512}.btn-warning:active,.btn-warning.active,.open>.dropdown-toggle.btn-warning{background-image:none}.btn-warning.disabled,.btn-warning[disabled],fieldset[disabled] .btn-warning,.btn-warning.disabled:hover,.btn-warning[disabled]:hover,fieldset[disabled] .btn-warning:hover,.btn-warning.disabled:focus,.btn-warning[disabled]:focus,fieldset[disabled] .btn-warning:focus,.btn-warning.disabled:active,.btn-warning[disabled]:active,fieldset[disabled] .btn-warning:active,.btn-warning.disabled.active,.btn-warning[disabled].active,fieldset[disabled] .btn-warning.active{background-color:#f0ad4e;border-color:#eea236}.btn-warning .badge{color:#f0ad4e;background-color:#fff}.btn-danger{color:#fff;background-color:#d9534f;border-color:#d43f3a}.btn-danger:hover,.btn-danger:focus,.btn-danger:active,.btn-danger.active,.open>.dropdown-toggle.btn-danger{color:#fff;background-color:#c9302c;border-color:#ac2925}.btn-danger:active,.btn-danger.active,.open>.dropdown-toggle.btn-danger{background-image:none}.btn-danger.disabled,.btn-danger[disabled],fieldset[disabled] .btn-danger,.btn-danger.disabled:hover,.btn-danger[disabled]:hover,fieldset[disabled] .btn-danger:hover,.btn-danger.disabled:focus,.btn-danger[disabled]:focus,fieldset[disabled] .btn-danger:focus,.btn-danger.disabled:active,.btn-danger[disabled]:active,fieldset[disabled] .btn-danger:active,.btn-danger.disabled.active,.btn-danger[disabled].active,fieldset[disabled] .btn-danger.active{background-color:#d9534f;border-color:#d43f3a}.btn-danger .badge{color:#d9534f;background-color:#fff}.btn-link{font-weight:400;color:#428bca;cursor:pointer;border-radius:0}.btn-link,.btn-link:active,.btn-link[disabled],fieldset[disabled] .btn-link{background-color:transparent;-webkit-box-shadow:none;box-shadow:none}.btn-link,.btn-link:hover,.btn-link:focus,.btn-link:active{border-color:transparent}.btn-link:hover,.btn-link:focus{color:#2a6496;text-decoration:underline;background-color:transparent}.btn-link[disabled]:hover,fieldset[disabled] .btn-link:hover,.btn-link[disabled]:focus,fieldset[disabled] .btn-link:focus{color:#777;text-decoration:none}.btn-lg,.btn-group-lg>.btn{padding:10px 16px;font-size:18px;line-height:1.33;border-radius:6px}.btn-sm,.btn-group-sm>.btn{padding:5px 10px;font-size:12px;line-height:1.5;border-radius:3px}.btn-xs,.btn-group-xs>.btn{padding:1px 5px;font-size:12px;line-height:1.5;border-radius:3px}.btn-block{display:block;width:100%}.btn-block+.btn-block{margin-top:5px}input[type=submit].btn-block,input[type=reset].btn-block,input[type=button].btn-block{width:100%}.fade{opacity:0;-webkit-transition:opacity .15s linear;-o-transition:opacity .15s linear;transition:opacity .15s linear}.fade.in{opacity:1}.collapse{display:none}.collapse.in{display:block}tr.collapse.in{display:table-row}tbody.collapse.in{display:table-row-group}.collapsing{position:relative;height:0;overflow:hidden;-webkit-transition:height .35s ease;-o-transition:height .35s ease;transition:height .35s ease}.caret{display:inline-block;width:0;height:0;margin-left:2px;vertical-align:middle;border-top:4px solid;border-right:4px solid transparent;border-left:4px solid transparent}.dropdown{position:relative}.dropdown-toggle:focus{outline:0}.dropdown-menu{position:absolute;top:100%;left:0;z-index:1000;display:none;float:left;min-width:160px;padding:5px 0;margin:2px 0 0;font-size:14px;text-align:left;list-style:none;background-color:#fff;-webkit-background-clip:padding-box;background-clip:padding-box;border:1px solid #ccc;border:1px solid rgba(0,0,0,.15);border-radius:4px;-webkit-box-shadow:0 6px 12px rgba(0,0,0,.175);box-shadow:0 6px 12px rgba(0,0,0,.175)}.dropdown-menu.pull-right{right:0;left:auto}.dropdown-menu .divider{height:1px;margin:9px 0;overflow:hidden;background-color:#e5e5e5}.dropdown-menu>li>a{display:block;padding:3px 20px;clear:both;font-weight:400;line-height:1.42857143;color:#333;white-space:nowrap}.dropdown-menu>li>a:hover,.dropdown-menu>li>a:focus{color:#262626;text-decoration:none;background-color:#f5f5f5}.dropdown-menu>.active>a,.dropdown-menu>.active>a:hover,.dropdown-menu>.active>a:focus{color:#fff;text-decoration:none;background-color:#428bca;outline:0}.dropdown-menu>.disabled>a,.dropdown-menu>.disabled>a:hover,.dropdown-menu>.disabled>a:focus{color:#777}.dropdown-menu>.disabled>a:hover,.dropdown-menu>.disabled>a:focus{text-decoration:none;cursor:not-allowed;background-color:transparent;background-image:none;filter:progid:DXImageTransform.Microsoft.gradient(enabled=false)}.open>.dropdown-menu{display:block}.open>a{outline:0}.dropdown-menu-right{right:0;left:auto}.dropdown-menu-left{right:auto;left:0}.dropdown-header{display:block;padding:3px 20px;font-size:12px;line-height:1.42857143;color:#777;white-space:nowrap}.dropdown-backdrop{position:fixed;top:0;right:0;bottom:0;left:0;z-index:990}.pull-right>.dropdown-menu{right:0;left:auto}.dropup .caret,.navbar-fixed-bottom .dropdown .caret{content:"";border-top:0;border-bottom:4px solid}.dropup .dropdown-menu,.navbar-fixed-bottom .dropdown .dropdown-menu{top:auto;bottom:100%;margin-bottom:1px}@media (min-width:768px){.navbar-right .dropdown-menu{right:0;left:auto}.navbar-right .dropdown-menu-left{right:auto;left:0}}.btn-group,.btn-group-vertical{position:relative;display:inline-block;vertical-align:middle}.btn-group>.btn,.btn-group-vertical>.btn{position:relative;float:left}.btn-group>.btn:hover,.btn-group-vertical>.btn:hover,.btn-group>.btn:focus,.btn-group-vertical>.btn:focus,.btn-group>.btn:active,.btn-group-vertical>.btn:active,.btn-group>.btn.active,.btn-group-vertical>.btn.active{z-index:2}.btn-group>.btn:focus,.btn-group-vertical>.btn:focus{outline:0}.btn-group .btn+.btn,.btn-group .btn+.btn-group,.btn-group .btn-group+.btn,.btn-group .btn-group+.btn-group{margin-left:-1px}.btn-toolbar{margin-left:-5px}.btn-toolbar .btn-group,.btn-toolbar .input-group{float:left}.btn-toolbar>.btn,.btn-toolbar>.btn-group,.btn-toolbar>.input-group{margin-left:5px}.btn-group>.btn:not(:first-child):not(:last-child):not(.dropdown-toggle){border-radius:0}.btn-group>.btn:first-child{margin-left:0}.btn-group>.btn:first-child:not(:last-child):not(.dropdown-toggle){border-top-right-radius:0;border-bottom-right-radius:0}.btn-group>.btn:last-child:not(:first-child),.btn-group>.dropdown-toggle:not(:first-child){border-top-left-radius:0;border-bottom-left-radius:0}.btn-group>.btn-group{float:left}.btn-group>.btn-group:not(:first-child):not(:last-child)>.btn{border-radius:0}.btn-group>.btn-group:first-child>.btn:last-child,.btn-group>.btn-group:first-child>.dropdown-toggle{border-top-right-radius:0;border-bottom-right-radius:0}.btn-group>.btn-group:last-child>.btn:first-child{border-top-left-radius:0;border-bottom-left-radius:0}.btn-group .dropdown-toggle:active,.btn-group.open .dropdown-toggle{outline:0}.btn-group>.btn+.dropdown-toggle{padding-right:8px;padding-left:8px}.btn-group>.btn-lg+.dropdown-toggle{padding-right:12px;padding-left:12px}.btn-group.open .dropdown-toggle{-webkit-box-shadow:inset 0 3px 5px rgba(0,0,0,.125);box-shadow:inset 0 3px 5px rgba(0,0,0,.125)}.btn-group.open .dropdown-toggle.btn-link{-webkit-box-shadow:none;box-shadow:none}.btn .caret{margin-left:0}.btn-lg .caret{border-width:5px 5px 0;border-bottom-width:0}.dropup .btn-lg .caret{border-width:0 5px 5px}.btn-group-vertical>.btn,.btn-group-vertical>.btn-group,.btn-group-vertical>.btn-group>.btn{display:block;float:none;width:100%;max-width:100%}.btn-group-vertical>.btn-group>.btn{float:none}.btn-group-vertical>.btn+.btn,.btn-group-vertical>.btn+.btn-group,.btn-group-vertical>.btn-group+.btn,.btn-group-vertical>.btn-group+.btn-group{margin-top:-1px;margin-left:0}.btn-group-vertical>.btn:not(:first-child):not(:last-child){border-radius:0}.btn-group-vertical>.btn:first-child:not(:last-child){border-top-right-radius:4px;border-bottom-right-radius:0;border-bottom-left-radius:0}.btn-group-vertical>.btn:last-child:not(:first-child){border-top-left-radius:0;border-top-right-radius:0;border-bottom-left-radius:4px}.btn-group-vertical>.btn-group:not(:first-child):not(:last-child)>.btn{border-radius:0}.btn-group-vertical>.btn-group:first-child:not(:last-child)>.btn:last-child,.btn-group-vertical>.btn-group:first-child:not(:last-child)>.dropdown-toggle{border-bottom-right-radius:0;border-bottom-left-radius:0}.btn-group-vertical>.btn-group:last-child:not(:first-child)>.btn:first-child{border-top-left-radius:0;border-top-right-radius:0}.btn-group-justified{display:table;width:100%;table-layout:fixed;border-collapse:separate}.btn-group-justified>.btn,.btn-group-justified>.btn-group{display:table-cell;float:none;width:1%}.btn-group-justified>.btn-group .btn{width:100%}.btn-group-justified>.btn-group .dropdown-menu{left:auto}[data-toggle=buttons]>.btn>input[type=radio],[data-toggle=buttons]>.btn>input[type=checkbox]{position:absolute;z-index:-1;filter:alpha(opacity=0);opacity:0}.input-group{position:relative;display:table;border-collapse:separate}.input-group[class*=col-]{float:none;padding-right:0;padding-left:0}.input-group .form-control{position:relative;z-index:2;float:left;width:100%;margin-bottom:0}.input-group-lg>.form-control,.input-group-lg>.input-group-addon,.input-group-lg>.input-group-btn>.btn{height:46px;padding:10px 16px;font-size:18px;line-height:1.33;border-radius:6px}select.input-group-lg>.form-control,select.input-group-lg>.input-group-addon,select.input-group-lg>.input-group-btn>.btn{height:46px;line-height:46px}textarea.input-group-lg>.form-control,textarea.input-group-lg>.input-group-addon,textarea.input-group-lg>.input-group-btn>.btn,select[multiple].input-group-lg>.form-control,select[multiple].input-group-lg>.input-group-addon,select[multiple].input-group-lg>.input-group-btn>.btn{height:auto}.input-group-sm>.form-control,.input-group-sm>.input-group-addon,.input-group-sm>.input-group-btn>.btn{height:30px;padding:5px 10px;font-size:12px;line-height:1.5;border-radius:3px}select.input-group-sm>.form-control,select.input-group-sm>.input-group-addon,select.input-group-sm>.input-group-btn>.btn{height:30px;line-height:30px}textarea.input-group-sm>.form-control,textarea.input-group-sm>.input-group-addon,textarea.input-group-sm>.input-group-btn>.btn,select[multiple].input-group-sm>.form-control,select[multiple].input-group-sm>.input-group-addon,select[multiple].input-group-sm>.input-group-btn>.btn{height:auto}.input-group-addon,.input-group-btn,.input-group .form-control{display:table-cell}.input-group-addon:not(:first-child):not(:last-child),.input-group-btn:not(:first-child):not(:last-child),.input-group .form-control:not(:first-child):not(:last-child){border-radius:0}.input-group-addon,.input-group-btn{width:1%;white-space:nowrap;vertical-align:middle}.input-group-addon{padding:6px 12px;font-size:14px;font-weight:400;line-height:1;color:#555;text-align:center;background-color:#eee;border:1px solid #ccc;border-radius:4px}.input-group-addon.input-sm{padding:5px 10px;font-size:12px;border-radius:3px}.input-group-addon.input-lg{padding:10px 16px;font-size:18px;border-radius:6px}.input-group-addon input[type=radio],.input-group-addon input[type=checkbox]{margin-top:0}.input-group .form-control:first-child,.input-group-addon:first-child,.input-group-btn:first-child>.btn,.input-group-btn:first-child>.btn-group>.btn,.input-group-btn:first-child>.dropdown-toggle,.input-group-btn:last-child>.btn:not(:last-child):not(.dropdown-toggle),.input-group-btn:last-child>.btn-group:not(:last-child)>.btn{border-top-right-radius:0;border-bottom-right-radius:0}.input-group-addon:first-child{border-right:0}.input-group .form-control:last-child,.input-group-addon:last-child,.input-group-btn:last-child>.btn,.input-group-btn:last-child>.btn-group>.btn,.input-group-btn:last-child>.dropdown-toggle,.input-group-btn:first-child>.btn:not(:first-child),.input-group-btn:first-child>.btn-group:not(:first-child)>.btn{border-top-left-radius:0;border-bottom-left-radius:0}.input-group-addon:last-child{border-left:0}.input-group-btn{position:relative;font-size:0;white-space:nowrap}.input-group-btn>.btn{position:relative}.input-group-btn>.btn+.btn{margin-left:-1px}.input-group-btn>.btn:hover,.input-group-btn>.btn:focus,.input-group-btn>.btn:active{z-index:2}.input-group-btn:first-child>.btn,.input-group-btn:first-child>.btn-group{margin-right:-1px}.input-group-btn:last-child>.btn,.input-group-btn:last-child>.btn-group{margin-left:-1px}.nav{padding-left:0;margin-bottom:0;list-style:none}.nav>li{position:relative;display:block}.nav>li>a{position:relative;display:block;padding:10px 15px}.nav>li>a:hover,.nav>li>a:focus{text-decoration:none;background-color:#eee}.nav>li.disabled>a{color:#777}.nav>li.disabled>a:hover,.nav>li.disabled>a:focus{color:#777;text-decoration:none;cursor:not-allowed;background-color:transparent}.nav .open>a,.nav .open>a:hover,.nav .open>a:focus{background-color:#eee;border-color:#428bca}.nav .nav-divider{height:1px;margin:9px 0;overflow:hidden;background-color:#e5e5e5}.nav>li>a>img{max-width:none}.nav-tabs{border-bottom:1px solid #ddd}.nav-tabs>li{float:left;margin-bottom:-1px}.nav-tabs>li>a{margin-right:2px;line-height:1.42857143;border:1px solid transparent;border-radius:4px 4px 0 0}.nav-tabs>li>a:hover{border-color:#eee #eee #ddd}.nav-tabs>li.active>a,.nav-tabs>li.active>a:hover,.nav-tabs>li.active>a:focus{color:#555;cursor:default;background-color:#fff;border:1px solid #ddd;border-bottom-color:transparent}.nav-tabs.nav-justified{width:100%;border-bottom:0}.nav-tabs.nav-justified>li{float:none}.nav-tabs.nav-justified>li>a{margin-bottom:5px;text-align:center}.nav-tabs.nav-justified>.dropdown .dropdown-menu{top:auto;left:auto}@media (min-width:768px){.nav-tabs.nav-justified>li{display:table-cell;width:1%}.nav-tabs.nav-justified>li>a{margin-bottom:0}}.nav-tabs.nav-justified>li>a{margin-right:0;border-radius:4px}.nav-tabs.nav-justified>.active>a,.nav-tabs.nav-justified>.active>a:hover,.nav-tabs.nav-justified>.active>a:focus{border:1px solid #ddd}@media (min-width:768px){.nav-tabs.nav-justified>li>a{border-bottom:1px solid #ddd;border-radius:4px 4px 0 0}.nav-tabs.nav-justified>.active>a,.nav-tabs.nav-justified>.active>a:hover,.nav-tabs.nav-justified>.active>a:focus{border-bottom-color:#fff}}.nav-pills>li{float:left}.nav-pills>li>a{border-radius:4px}.nav-pills>li+li{margin-left:2px}.nav-pills>li.active>a,.nav-pills>li.active>a:hover,.nav-pills>li.active>a:focus{color:#fff;background-color:#428bca}.nav-stacked>li{float:none}.nav-stacked>li+li{margin-top:2px;margin-left:0}.nav-justified{width:100%}.nav-justified>li{float:none}.nav-justified>li>a{margin-bottom:5px;text-align:center}.nav-justified>.dropdown .dropdown-menu{top:auto;left:auto}@media (min-width:768px){.nav-justified>li{display:table-cell;width:1%}.nav-justified>li>a{margin-bottom:0}}.nav-tabs-justified{border-bottom:0}.nav-tabs-justified>li>a{margin-right:0;border-radius:4px}.nav-tabs-justified>.active>a,.nav-tabs-justified>.active>a:hover,.nav-tabs-justified>.active>a:focus{border:1px solid #ddd}@media (min-width:768px){.nav-tabs-justified>li>a{border-bottom:1px solid #ddd;border-radius:4px 4px 0 0}.nav-tabs-justified>.active>a,.nav-tabs-justified>.active>a:hover,.nav-tabs-justified>.active>a:focus{border-bottom-color:#fff}}.tab-content>.tab-pane{display:none}.tab-content>.active{display:block}.nav-tabs .dropdown-menu{margin-top:-1px;border-top-left-radius:0;border-top-right-radius:0}.navbar{position:relative;min-height:50px;margin-bottom:20px;border:1px solid transparent}@media (min-width:768px){.navbar{border-radius:4px}}@media (min-width:768px){.navbar-header{float:left}}.navbar-collapse{padding-right:15px;padding-left:15px;overflow-x:visible;-webkit-overflow-scrolling:touch;border-top:1px solid transparent;-webkit-box-shadow:inset 0 1px 0 rgba(255,255,255,.1);box-shadow:inset 0 1px 0 rgba(255,255,255,.1)}.navbar-collapse.in{overflow-y:auto}@media (min-width:768px){.navbar-collapse{width:auto;border-top:0;-webkit-box-shadow:none;box-shadow:none}.navbar-collapse.collapse{display:block!important;height:auto!important;padding-bottom:0;overflow:visible!important}.navbar-collapse.in{overflow-y:visible}.navbar-fixed-top .navbar-collapse,.navbar-static-top .navbar-collapse,.navbar-fixed-bottom .navbar-collapse{padding-right:0;padding-left:0}}.navbar-fixed-top .navbar-collapse,.navbar-fixed-bottom .navbar-collapse{max-height:340px}@media (max-width:480px) and (orientation:landscape){.navbar-fixed-top .navbar-collapse,.navbar-fixed-bottom .navbar-collapse{max-height:200px}}.container>.navbar-header,.container-fluid>.navbar-header,.container>.navbar-collapse,.container-fluid>.navbar-collapse{margin-right:-15px;margin-left:-15px}@media (min-width:768px){.container>.navbar-header,.container-fluid>.navbar-header,.container>.navbar-collapse,.container-fluid>.navbar-collapse{margin-right:0;margin-left:0}}.navbar-static-top{z-index:1000;border-width:0 0 1px}@media (min-width:768px){.navbar-static-top{border-radius:0}}.navbar-fixed-top,.navbar-fixed-bottom{position:fixed;right:0;left:0;z-index:1030;-webkit-transform:translate3d(0,0,0);-o-transform:translate3d(0,0,0);transform:translate3d(0,0,0)}@media (min-width:768px){.navbar-fixed-top,.navbar-fixed-bottom{border-radius:0}}.navbar-fixed-top{top:0;border-width:0 0 1px}.navbar-fixed-bottom{bottom:0;margin-bottom:0;border-width:1px 0 0}.navbar-brand{float:left;height:50px;padding:15px 15px;font-size:18px;line-height:20px}.navbar-brand:hover,.navbar-brand:focus{text-decoration:none}@media (min-width:768px){.navbar>.container .navbar-brand,.navbar>.container-fluid .navbar-brand{margin-left:-15px}}.navbar-toggle{position:relative;float:right;padding:9px 10px;margin-top:8px;margin-right:15px;margin-bottom:8px;background-color:transparent;background-image:none;border:1px solid transparent;border-radius:4px}.navbar-toggle:focus{outline:0}.navbar-toggle .icon-bar{display:block;width:22px;height:2px;border-radius:1px}.navbar-toggle .icon-bar+.icon-bar{margin-top:4px}@media (min-width:768px){.navbar-toggle{display:none}}.navbar-nav{margin:7.5px -15px}.navbar-nav>li>a{padding-top:10px;padding-bottom:10px;line-height:20px}@media (max-width:767px){.navbar-nav .open .dropdown-menu{position:static;float:none;width:auto;margin-top:0;background-color:transparent;border:0;-webkit-box-shadow:none;box-shadow:none}.navbar-nav .open .dropdown-menu>li>a,.navbar-nav .open .dropdown-menu .dropdown-header{padding:5px 15px 5px 25px}.navbar-nav .open .dropdown-menu>li>a{line-height:20px}.navbar-nav .open .dropdown-menu>li>a:hover,.navbar-nav .open .dropdown-menu>li>a:focus{background-image:none}}@media (min-width:768px){.navbar-nav{float:left;margin:0}.navbar-nav>li{float:left}.navbar-nav>li>a{padding-top:15px;padding-bottom:15px}.navbar-nav.navbar-right:last-child{margin-right:-15px}}@media (min-width:768px){.navbar-left{float:left!important}.navbar-right{float:right!important}}.navbar-form{padding:10px 15px;margin-top:8px;margin-right:-15px;margin-bottom:8px;margin-left:-15px;border-top:1px solid transparent;border-bottom:1px solid transparent;-webkit-box-shadow:inset 0 1px 0 rgba(255,255,255,.1),0 1px 0 rgba(255,255,255,.1);box-shadow:inset 0 1px 0 rgba(255,255,255,.1),0 1px 0 rgba(255,255,255,.1)}@media (min-width:768px){.navbar-form .form-group{display:inline-block;margin-bottom:0;vertical-align:middle}.navbar-form .form-control{display:inline-block;width:auto;vertical-align:middle}.navbar-form .input-group{display:inline-table;vertical-align:middle}.navbar-form .input-group .input-group-addon,.navbar-form .input-group .input-group-btn,.navbar-form .input-group .form-control{width:auto}.navbar-form .input-group>.form-control{width:100%}.navbar-form .control-label{margin-bottom:0;vertical-align:middle}.navbar-form .radio,.navbar-form .checkbox{display:inline-block;margin-top:0;margin-bottom:0;vertical-align:middle}.navbar-form .radio label,.navbar-form .checkbox label{padding-left:0}.navbar-form .radio input[type=radio],.navbar-form .checkbox input[type=checkbox]{position:relative;margin-left:0}.navbar-form .has-feedback .form-control-feedback{top:0}}@media (max-width:767px){.navbar-form .form-group{margin-bottom:5px}}@media (min-width:768px){.navbar-form{width:auto;padding-top:0;padding-bottom:0;margin-right:0;margin-left:0;border:0;-webkit-box-shadow:none;box-shadow:none}.navbar-form.navbar-right:last-child{margin-right:-15px}}.navbar-nav>li>.dropdown-menu{margin-top:0;border-top-left-radius:0;border-top-right-radius:0}.navbar-fixed-bottom .navbar-nav>li>.dropdown-menu{border-bottom-right-radius:0;border-bottom-left-radius:0}.navbar-btn{margin-top:8px;margin-bottom:8px}.navbar-btn.btn-sm{margin-top:10px;margin-bottom:10px}.navbar-btn.btn-xs{margin-top:14px;margin-bottom:14px}.navbar-text{margin-top:15px;margin-bottom:15px}@media (min-width:768px){.navbar-text{float:left;margin-right:15px;margin-left:15px}.navbar-text.navbar-right:last-child{margin-right:0}}.navbar-default{background-color:#f8f8f8;border-color:#e7e7e7}.navbar-default .navbar-brand{color:#777}.navbar-default .navbar-brand:hover,.navbar-default .navbar-brand:focus{color:#5e5e5e;background-color:transparent}.navbar-default .navbar-text{color:#777}.navbar-default .navbar-nav>li>a{color:#777}.navbar-default .navbar-nav>li>a:hover,.navbar-default .navbar-nav>li>a:focus{color:#333;background-color:transparent}.navbar-default .navbar-nav>.active>a,.navbar-default .navbar-nav>.active>a:hover,.navbar-default .navbar-nav>.active>a:focus{color:#555;background-color:#e7e7e7}.navbar-default .navbar-nav>.disabled>a,.navbar-default .navbar-nav>.disabled>a:hover,.navbar-default .navbar-nav>.disabled>a:focus{color:#ccc;background-color:transparent}.navbar-default .navbar-toggle{border-color:#ddd}.navbar-default .navbar-toggle:hover,.navbar-default .navbar-toggle:focus{background-color:#ddd}.navbar-default .navbar-toggle .icon-bar{background-color:#888}.navbar-default .navbar-collapse,.navbar-default .navbar-form{border-color:#e7e7e7}.navbar-default .navbar-nav>.open>a,.navbar-default .navbar-nav>.open>a:hover,.navbar-default .navbar-nav>.open>a:focus{color:#555;background-color:#e7e7e7}@media (max-width:767px){.navbar-default .navbar-nav .open .dropdown-menu>li>a{color:#777}.navbar-default .navbar-nav .open .dropdown-menu>li>a:hover,.navbar-default .navbar-nav .open .dropdown-menu>li>a:focus{color:#333;background-color:transparent}.navbar-default .navbar-nav .open .dropdown-menu>.active>a,.navbar-default .navbar-nav .open .dropdown-menu>.active>a:hover,.navbar-default .navbar-nav .open .dropdown-menu>.active>a:focus{color:#555;background-color:#e7e7e7}.navbar-default .navbar-nav .open .dropdown-menu>.disabled>a,.navbar-default .navbar-nav .open .dropdown-menu>.disabled>a:hover,.navbar-default .navbar-nav .open .dropdown-menu>.disabled>a:focus{color:#ccc;background-color:transparent}}.navbar-default .navbar-link{color:#777}.navbar-default .navbar-link:hover{color:#333}.navbar-default .btn-link{color:#777}.navbar-default .btn-link:hover,.navbar-default .btn-link:focus{color:#333}.navbar-default .btn-link[disabled]:hover,fieldset[disabled] .navbar-default .btn-link:hover,.navbar-default .btn-link[disabled]:focus,fieldset[disabled] .navbar-default .btn-link:focus{color:#ccc}.navbar-inverse{background-color:#222;border-color:#080808}.navbar-inverse .navbar-brand{color:#777}.navbar-inverse .navbar-brand:hover,.navbar-inverse .navbar-brand:focus{color:#fff;background-color:transparent}.navbar-inverse .navbar-text{color:#777}.navbar-inverse .navbar-nav>li>a{color:#777}.navbar-inverse .navbar-nav>li>a:hover,.navbar-inverse .navbar-nav>li>a:focus{color:#fff;background-color:transparent}.navbar-inverse .navbar-nav>.active>a,.navbar-inverse .navbar-nav>.active>a:hover,.navbar-inverse .navbar-nav>.active>a:focus{color:#fff;background-color:#080808}.navbar-inverse .navbar-nav>.disabled>a,.navbar-inverse .navbar-nav>.disabled>a:hover,.navbar-inverse .navbar-nav>.disabled>a:focus{color:#444;background-color:transparent}.navbar-inverse .navbar-toggle{border-color:#333}.navbar-inverse .navbar-toggle:hover,.navbar-inverse .navbar-toggle:focus{background-color:#333}.navbar-inverse .navbar-toggle .icon-bar{background-color:#fff}.navbar-inverse .navbar-collapse,.navbar-inverse .navbar-form{border-color:#101010}.navbar-inverse .navbar-nav>.open>a,.navbar-inverse .navbar-nav>.open>a:hover,.navbar-inverse .navbar-nav>.open>a:focus{color:#fff;background-color:#080808}@media (max-width:767px){.navbar-inverse .navbar-nav .open .dropdown-menu>.dropdown-header{border-color:#080808}.navbar-inverse .navbar-nav .open .dropdown-menu .divider{background-color:#080808}.navbar-inverse .navbar-nav .open .dropdown-menu>li>a{color:#777}.navbar-inverse .navbar-nav .open .dropdown-menu>li>a:hover,.navbar-inverse .navbar-nav .open .dropdown-menu>li>a:focus{color:#fff;background-color:transparent}.navbar-inverse .navbar-nav .open .dropdown-menu>.active>a,.navbar-inverse .navbar-nav .open .dropdown-menu>.active>a:hover,.navbar-inverse .navbar-nav .open .dropdown-menu>.active>a:focus{color:#fff;background-color:#080808}.navbar-inverse .navbar-nav .open .dropdown-menu>.disabled>a,.navbar-inverse .navbar-nav .open .dropdown-menu>.disabled>a:hover,.navbar-inverse .navbar-nav .open .dropdown-menu>.disabled>a:focus{color:#444;background-color:transparent}}.navbar-inverse .navbar-link{color:#777}.navbar-inverse .navbar-link:hover{color:#fff}.navbar-inverse .btn-link{color:#777}.navbar-inverse .btn-link:hover,.navbar-inverse .btn-link:focus{color:#fff}.navbar-inverse .btn-link[disabled]:hover,fieldset[disabled] .navbar-inverse .btn-link:hover,.navbar-inverse .btn-link[disabled]:focus,fieldset[disabled] .navbar-inverse .btn-link:focus{color:#444}.breadcrumb{padding:8px 15px;margin-bottom:20px;list-style:none;background-color:#f5f5f5;border-radius:4px}.breadcrumb>li{display:inline-block}.breadcrumb>li+li:before{padding:0 5px;color:#ccc;content:"/\00a0"}.breadcrumb>.active{color:#777}.pagination{display:inline-block;padding-left:0;margin:20px 0;border-radius:4px}.pagination>li{display:inline}.pagination>li>a,.pagination>li>span{position:relative;float:left;padding:6px 12px;margin-left:-1px;line-height:1.42857143;color:#428bca;text-decoration:none;background-color:#fff;border:1px solid #ddd}.pagination>li:first-child>a,.pagination>li:first-child>span{margin-left:0;border-top-left-radius:4px;border-bottom-left-radius:4px}.pagination>li:last-child>a,.pagination>li:last-child>span{border-top-right-radius:4px;border-bottom-right-radius:4px}.pagination>li>a:hover,.pagination>li>span:hover,.pagination>li>a:focus,.pagination>li>span:focus{color:#2a6496;background-color:#eee;border-color:#ddd}.pagination>.active>a,.pagination>.active>span,.pagination>.active>a:hover,.pagination>.active>span:hover,.pagination>.active>a:focus,.pagination>.active>span:focus{z-index:2;color:#fff;cursor:default;background-color:#428bca;border-color:#428bca}.pagination>.disabled>span,.pagination>.disabled>span:hover,.pagination>.disabled>span:focus,.pagination>.disabled>a,.pagination>.disabled>a:hover,.pagination>.disabled>a:focus{color:#777;cursor:not-allowed;background-color:#fff;border-color:#ddd}.pagination-lg>li>a,.pagination-lg>li>span{padding:10px 16px;font-size:18px}.pagination-lg>li:first-child>a,.pagination-lg>li:first-child>span{border-top-left-radius:6px;border-bottom-left-radius:6px}.pagination-lg>li:last-child>a,.pagination-lg>li:last-child>span{border-top-right-radius:6px;border-bottom-right-radius:6px}.pagination-sm>li>a,.pagination-sm>li>span{padding:5px 10px;font-size:12px}.pagination-sm>li:first-child>a,.pagination-sm>li:first-child>span{border-top-left-radius:3px;border-bottom-left-radius:3px}.pagination-sm>li:last-child>a,.pagination-sm>li:last-child>span{border-top-right-radius:3px;border-bottom-right-radius:3px}.pager{padding-left:0;margin:20px 0;text-align:center;list-style:none}.pager li{display:inline}.pager li>a,.pager li>span{display:inline-block;padding:5px 14px;background-color:#fff;border:1px solid #ddd;border-radius:15px}.pager li>a:hover,.pager li>a:focus{text-decoration:none;background-color:#eee}.pager .next>a,.pager .next>span{float:right}.pager .previous>a,.pager .previous>span{float:left}.pager .disabled>a,.pager .disabled>a:hover,.pager .disabled>a:focus,.pager .disabled>span{color:#777;cursor:not-allowed;background-color:#fff}.label{display:inline;padding:.2em .6em .3em;font-size:75%;font-weight:700;line-height:1;color:#fff;text-align:center;white-space:nowrap;vertical-align:baseline;border-radius:.25em}a.label:hover,a.label:focus{color:#fff;text-decoration:none;cursor:pointer}.label:empty{display:none}.btn .label{position:relative;top:-1px}.label-default{background-color:#777}.label-default[href]:hover,.label-default[href]:focus{background-color:#5e5e5e}.label-primary{background-color:#428bca}.label-primary[href]:hover,.label-primary[href]:focus{background-color:#3071a9}.label-success{background-color:#5cb85c}.label-success[href]:hover,.label-success[href]:focus{background-color:#449d44}.label-info{background-color:#5bc0de}.label-info[href]:hover,.label-info[href]:focus{background-color:#31b0d5}.label-warning{background-color:#f0ad4e}.label-warning[href]:hover,.label-warning[href]:focus{background-color:#ec971f}.label-danger{background-color:#d9534f}.label-danger[href]:hover,.label-danger[href]:focus{background-color:#c9302c}.badge{display:inline-block;min-width:10px;padding:3px 7px;font-size:12px;font-weight:700;line-height:1;color:#fff;text-align:center;white-space:nowrap;vertical-align:baseline;background-color:#777;border-radius:10px}.badge:empty{display:none}.btn .badge{position:relative;top:-1px}.btn-xs .badge{top:0;padding:1px 5px}a.badge:hover,a.badge:focus{color:#fff;text-decoration:none;cursor:pointer}a.list-group-item.active>.badge,.nav-pills>.active>a>.badge{color:#428bca;background-color:#fff}.nav-pills>li>a>.badge{margin-left:3px}.jumbotron{padding:30px;margin-bottom:30px;color:inherit;background-color:#eee}.jumbotron h1,.jumbotron .h1{color:inherit}.jumbotron p{margin-bottom:15px;font-size:21px;font-weight:200}.jumbotron>hr{border-top-color:#d5d5d5}.container .jumbotron{border-radius:6px}.jumbotron .container{max-width:100%}@media screen and (min-width:768px){.jumbotron{padding-top:48px;padding-bottom:48px}.container .jumbotron{padding-right:60px;padding-left:60px}.jumbotron h1,.jumbotron .h1{font-size:63px}}.thumbnail{display:block;padding:4px;margin-bottom:20px;line-height:1.42857143;background-color:#fff;border:1px solid #ddd;border-radius:4px;-webkit-transition:all .2s ease-in-out;-o-transition:all .2s ease-in-out;transition:all .2s ease-in-out}.thumbnail>img,.thumbnail a>img{margin-right:auto;margin-left:auto}a.thumbnail:hover,a.thumbnail:focus,a.thumbnail.active{border-color:#428bca}.thumbnail .caption{padding:9px;color:#333}.alert{padding:15px;margin-bottom:20px;border:1px solid transparent;border-radius:4px}.alert h4{margin-top:0;color:inherit}.alert .alert-link{font-weight:700}.alert>p,.alert>ul{margin-bottom:0}.alert>p+p{margin-top:5px}.alert-dismissable,.alert-dismissible{padding-right:35px}.alert-dismissable .close,.alert-dismissible .close{position:relative;top:-2px;right:-21px;color:inherit}.alert-success{color:#3c763d;background-color:#dff0d8;border-color:#d6e9c6}.alert-success hr{border-top-color:#c9e2b3}.alert-success .alert-link{color:#2b542c}.alert-info{color:#31708f;background-color:#d9edf7;border-color:#bce8f1}.alert-info hr{border-top-color:#a6e1ec}.alert-info .alert-link{color:#245269}.alert-warning{color:#8a6d3b;background-color:#fcf8e3;border-color:#faebcc}.alert-warning hr{border-top-color:#f7e1b5}.alert-warning .alert-link{color:#66512c}.alert-danger{color:#a94442;background-color:#f2dede;border-color:#ebccd1}.alert-danger hr{border-top-color:#e4b9c0}.alert-danger .alert-link{color:#843534}@-webkit-keyframes progress-bar-stripes{from{background-position:40px 0}to{background-position:0 0}}@-o-keyframes progress-bar-stripes{from{background-position:40px 0}to{background-position:0 0}}@keyframes progress-bar-stripes{from{background-position:40px 0}to{background-position:0 0}}.progress{height:20px;margin-bottom:20px;overflow:hidden;background-color:#f5f5f5;border-radius:4px;-webkit-box-shadow:inset 0 1px 2px rgba(0,0,0,.1);box-shadow:inset 0 1px 2px rgba(0,0,0,.1)}.progress-bar{float:left;width:0;height:100%;font-size:12px;line-height:20px;color:#fff;text-align:center;background-color:#428bca;-webkit-box-shadow:inset 0 -1px 0 rgba(0,0,0,.15);box-shadow:inset 0 -1px 0 rgba(0,0,0,.15);-webkit-transition:width .6s ease;-o-transition:width .6s ease;transition:width .6s ease}.progress-striped .progress-bar,.progress-bar-striped{background-image:-webkit-linear-gradient(45deg,rgba(255,255,255,.15) 25%,transparent 25%,transparent 50%,rgba(255,255,255,.15) 50%,rgba(255,255,255,.15) 75%,transparent 75%,transparent);background-image:-o-linear-gradient(45deg,rgba(255,255,255,.15) 25%,transparent 25%,transparent 50%,rgba(255,255,255,.15) 50%,rgba(255,255,255,.15) 75%,transparent 75%,transparent);background-image:linear-gradient(45deg,rgba(255,255,255,.15) 25%,transparent 25%,transparent 50%,rgba(255,255,255,.15) 50%,rgba(255,255,255,.15) 75%,transparent 75%,transparent);-webkit-background-size:40px 40px;background-size:40px 40px}.progress.active .progress-bar,.progress-bar.active{-webkit-animation:progress-bar-stripes 2s linear infinite;-o-animation:progress-bar-stripes 2s linear infinite;animation:progress-bar-stripes 2s linear infinite}.progress-bar[aria-valuenow="1"],.progress-bar[aria-valuenow="2"]{min-width:30px}.progress-bar[aria-valuenow="0"]{min-width:30px;color:#777;background-color:transparent;background-image:none;-webkit-box-shadow:none;box-shadow:none}.progress-bar-success{background-color:#5cb85c}.progress-striped .progress-bar-success{background-image:-webkit-linear-gradient(45deg,rgba(255,255,255,.15) 25%,transparent 25%,transparent 50%,rgba(255,255,255,.15) 50%,rgba(255,255,255,.15) 75%,transparent 75%,transparent);background-image:-o-linear-gradient(45deg,rgba(255,255,255,.15) 25%,transparent 25%,transparent 50%,rgba(255,255,255,.15) 50%,rgba(255,255,255,.15) 75%,transparent 75%,transparent);background-image:linear-gradient(45deg,rgba(255,255,255,.15) 25%,transparent 25%,transparent 50%,rgba(255,255,255,.15) 50%,rgba(255,255,255,.15) 75%,transparent 75%,transparent)}.progress-bar-info{background-color:#5bc0de}.progress-striped .progress-bar-info{background-image:-webkit-linear-gradient(45deg,rgba(255,255,255,.15) 25%,transparent 25%,transparent 50%,rgba(255,255,255,.15) 50%,rgba(255,255,255,.15) 75%,transparent 75%,transparent);background-image:-o-linear-gradient(45deg,rgba(255,255,255,.15) 25%,transparent 25%,transparent 50%,rgba(255,255,255,.15) 50%,rgba(255,255,255,.15) 75%,transparent 75%,transparent);background-image:linear-gradient(45deg,rgba(255,255,255,.15) 25%,transparent 25%,transparent 50%,rgba(255,255,255,.15) 50%,rgba(255,255,255,.15) 75%,transparent 75%,transparent)}.progress-bar-warning{background-color:#f0ad4e}.progress-striped .progress-bar-warning{background-image:-webkit-linear-gradient(45deg,rgba(255,255,255,.15) 25%,transparent 25%,transparent 50%,rgba(255,255,255,.15) 50%,rgba(255,255,255,.15) 75%,transparent 75%,transparent);background-image:-o-linear-gradient(45deg,rgba(255,255,255,.15) 25%,transparent 25%,transparent 50%,rgba(255,255,255,.15) 50%,rgba(255,255,255,.15) 75%,transparent 75%,transparent);background-image:linear-gradient(45deg,rgba(255,255,255,.15) 25%,transparent 25%,transparent 50%,rgba(255,255,255,.15) 50%,rgba(255,255,255,.15) 75%,transparent 75%,transparent)}.progress-bar-danger{background-color:#d9534f}.progress-striped .progress-bar-danger{background-image:-webkit-linear-gradient(45deg,rgba(255,255,255,.15) 25%,transparent 25%,transparent 50%,rgba(255,255,255,.15) 50%,rgba(255,255,255,.15) 75%,transparent 75%,transparent);background-image:-o-linear-gradient(45deg,rgba(255,255,255,.15) 25%,transparent 25%,transparent 50%,rgba(255,255,255,.15) 50%,rgba(255,255,255,.15) 75%,transparent 75%,transparent);background-image:linear-gradient(45deg,rgba(255,255,255,.15) 25%,transparent 25%,transparent 50%,rgba(255,255,255,.15) 50%,rgba(255,255,255,.15) 75%,transparent 75%,transparent)}.media,.media-body{overflow:hidden;zoom:1}.media,.media .media{margin-top:15px}.media:first-child{margin-top:0}.media-object{display:block}.media-heading{margin:0 0 5px}.media>.pull-left{margin-right:10px}.media>.pull-right{margin-left:10px}.media-list{padding-left:0;list-style:none}.list-group{padding-left:0;margin-bottom:20px}.list-group-item{position:relative;display:block;padding:10px 15px;margin-bottom:-1px;background-color:#fff;border:1px solid #ddd}.list-group-item:first-child{border-top-left-radius:4px;border-top-right-radius:4px}.list-group-item:last-child{margin-bottom:0;border-bottom-right-radius:4px;border-bottom-left-radius:4px}.list-group-item>.badge{float:right}.list-group-item>.badge+.badge{margin-right:5px}a.list-group-item{color:#555}a.list-group-item .list-group-item-heading{color:#333}a.list-group-item:hover,a.list-group-item:focus{color:#555;text-decoration:none;background-color:#f5f5f5}.list-group-item.disabled,.list-group-item.disabled:hover,.list-group-item.disabled:focus{color:#777;background-color:#eee}.list-group-item.disabled .list-group-item-heading,.list-group-item.disabled:hover .list-group-item-heading,.list-group-item.disabled:focus .list-group-item-heading{color:inherit}.list-group-item.disabled .list-group-item-text,.list-group-item.disabled:hover .list-group-item-text,.list-group-item.disabled:focus .list-group-item-text{color:#777}.list-group-item.active,.list-group-item.active:hover,.list-group-item.active:focus{z-index:2;color:#fff;background-color:#428bca;border-color:#428bca}.list-group-item.active .list-group-item-heading,.list-group-item.active:hover .list-group-item-heading,.list-group-item.active:focus .list-group-item-heading,.list-group-item.active .list-group-item-heading>small,.list-group-item.active:hover .list-group-item-heading>small,.list-group-item.active:focus .list-group-item-heading>small,.list-group-item.active .list-group-item-heading>.small,.list-group-item.active:hover .list-group-item-heading>.small,.list-group-item.active:focus .list-group-item-heading>.small{color:inherit}.list-group-item.active .list-group-item-text,.list-group-item.active:hover .list-group-item-text,.list-group-item.active:focus .list-group-item-text{color:#e1edf7}.list-group-item-success{color:#3c763d;background-color:#dff0d8}a.list-group-item-success{color:#3c763d}a.list-group-item-success .list-group-item-heading{color:inherit}a.list-group-item-success:hover,a.list-group-item-success:focus{color:#3c763d;background-color:#d0e9c6}a.list-group-item-success.active,a.list-group-item-success.active:hover,a.list-group-item-success.active:focus{color:#fff;background-color:#3c763d;border-color:#3c763d}.list-group-item-info{color:#31708f;background-color:#d9edf7}a.list-group-item-info{color:#31708f}a.list-group-item-info .list-group-item-heading{color:inherit}a.list-group-item-info:hover,a.list-group-item-info:focus{color:#31708f;background-color:#c4e3f3}a.list-group-item-info.active,a.list-group-item-info.active:hover,a.list-group-item-info.active:focus{color:#fff;background-color:#31708f;border-color:#31708f}.list-group-item-warning{color:#8a6d3b;background-color:#fcf8e3}a.list-group-item-warning{color:#8a6d3b}a.list-group-item-warning .list-group-item-heading{color:inherit}a.list-group-item-warning:hover,a.list-group-item-warning:focus{color:#8a6d3b;background-color:#faf2cc}a.list-group-item-warning.active,a.list-group-item-warning.active:hover,a.list-group-item-warning.active:focus{color:#fff;background-color:#8a6d3b;border-color:#8a6d3b}.list-group-item-danger{color:#a94442;background-color:#f2dede}a.list-group-item-danger{color:#a94442}a.list-group-item-danger .list-group-item-heading{color:inherit}a.list-group-item-danger:hover,a.list-group-item-danger:focus{color:#a94442;background-color:#ebcccc}a.list-group-item-danger.active,a.list-group-item-danger.active:hover,a.list-group-item-danger.active:focus{color:#fff;background-color:#a94442;border-color:#a94442}.list-group-item-heading{margin-top:0;margin-bottom:5px}.list-group-item-text{margin-bottom:0;line-height:1.3}.panel{margin-bottom:20px;background-color:#fff;border:1px solid transparent;border-radius:4px;-webkit-box-shadow:0 1px 1px rgba(0,0,0,.05);box-shadow:0 1px 1px rgba(0,0,0,.05)}.panel-body{padding:15px}.panel-heading{padding:10px 15px;border-bottom:1px solid transparent;border-top-left-radius:3px;border-top-right-radius:3px}.panel-heading>.dropdown .dropdown-toggle{color:inherit}.panel-title{margin-top:0;margin-bottom:0;font-size:16px;color:inherit}.panel-title>a{color:inherit}.panel-footer{padding:10px 15px;background-color:#f5f5f5;border-top:1px solid #ddd;border-bottom-right-radius:3px;border-bottom-left-radius:3px}.panel>.list-group{margin-bottom:0}.panel>.list-group .list-group-item{border-width:1px 0;border-radius:0}.panel>.list-group:first-child .list-group-item:first-child{border-top:0;border-top-left-radius:3px;border-top-right-radius:3px}.panel>.list-group:last-child .list-group-item:last-child{border-bottom:0;border-bottom-right-radius:3px;border-bottom-left-radius:3px}.panel-heading+.list-group .list-group-item:first-child{border-top-width:0}.list-group+.panel-footer{border-top-width:0}.panel>.table,.panel>.table-responsive>.table,.panel>.panel-collapse>.table{margin-bottom:0}.panel>.table:first-child,.panel>.table-responsive:first-child>.table:first-child{border-top-left-radius:3px;border-top-right-radius:3px}.panel>.table:first-child>thead:first-child>tr:first-child td:first-child,.panel>.table-responsive:first-child>.table:first-child>thead:first-child>tr:first-child td:first-child,.panel>.table:first-child>tbody:first-child>tr:first-child td:first-child,.panel>.table-responsive:first-child>.table:first-child>tbody:first-child>tr:first-child td:first-child,.panel>.table:first-child>thead:first-child>tr:first-child th:first-child,.panel>.table-responsive:first-child>.table:first-child>thead:first-child>tr:first-child th:first-child,.panel>.table:first-child>tbody:first-child>tr:first-child th:first-child,.panel>.table-responsive:first-child>.table:first-child>tbody:first-child>tr:first-child th:first-child{border-top-left-radius:3px}.panel>.table:first-child>thead:first-child>tr:first-child td:last-child,.panel>.table-responsive:first-child>.table:first-child>thead:first-child>tr:first-child td:last-child,.panel>.table:first-child>tbody:first-child>tr:first-child td:last-child,.panel>.table-responsive:first-child>.table:first-child>tbody:first-child>tr:first-child td:last-child,.panel>.table:first-child>thead:first-child>tr:first-child th:last-child,.panel>.table-responsive:first-child>.table:first-child>thead:first-child>tr:first-child th:last-child,.panel>.table:first-child>tbody:first-child>tr:first-child th:last-child,.panel>.table-responsive:first-child>.table:first-child>tbody:first-child>tr:first-child th:last-child{border-top-right-radius:3px}.panel>.table:last-child,.panel>.table-responsive:last-child>.table:last-child{border-bottom-right-radius:3px;border-bottom-left-radius:3px}.panel>.table:last-child>tbody:last-child>tr:last-child td:first-child,.panel>.table-responsive:last-child>.table:last-child>tbody:last-child>tr:last-child td:first-child,.panel>.table:last-child>tfoot:last-child>tr:last-child td:first-child,.panel>.table-responsive:last-child>.table:last-child>tfoot:last-child>tr:last-child td:first-child,.panel>.table:last-child>tbody:last-child>tr:last-child th:first-child,.panel>.table-responsive:last-child>.table:last-child>tbody:last-child>tr:last-child th:first-child,.panel>.table:last-child>tfoot:last-child>tr:last-child th:first-child,.panel>.table-responsive:last-child>.table:last-child>tfoot:last-child>tr:last-child th:first-child{border-bottom-left-radius:3px}.panel>.table:last-child>tbody:last-child>tr:last-child td:last-child,.panel>.table-responsive:last-child>.table:last-child>tbody:last-child>tr:last-child td:last-child,.panel>.table:last-child>tfoot:last-child>tr:last-child td:last-child,.panel>.table-responsive:last-child>.table:last-child>tfoot:last-child>tr:last-child td:last-child,.panel>.table:last-child>tbody:last-child>tr:last-child th:last-child,.panel>.table-responsive:last-child>.table:last-child>tbody:last-child>tr:last-child th:last-child,.panel>.table:last-child>tfoot:last-child>tr:last-child th:last-child,.panel>.table-responsive:last-child>.table:last-child>tfoot:last-child>tr:last-child th:last-child{border-bottom-right-radius:3px}.panel>.panel-body+.table,.panel>.panel-body+.table-responsive{border-top:1px solid #ddd}.panel>.table>tbody:first-child>tr:first-child th,.panel>.table>tbody:first-child>tr:first-child td{border-top:0}.panel>.table-bordered,.panel>.table-responsive>.table-bordered{border:0}.panel>.table-bordered>thead>tr>th:first-child,.panel>.table-responsive>.table-bordered>thead>tr>th:first-child,.panel>.table-bordered>tbody>tr>th:first-child,.panel>.table-responsive>.table-bordered>tbody>tr>th:first-child,.panel>.table-bordered>tfoot>tr>th:first-child,.panel>.table-responsive>.table-bordered>tfoot>tr>th:first-child,.panel>.table-bordered>thead>tr>td:first-child,.panel>.table-responsive>.table-bordered>thead>tr>td:first-child,.panel>.table-bordered>tbody>tr>td:first-child,.panel>.table-responsive>.table-bordered>tbody>tr>td:first-child,.panel>.table-bordered>tfoot>tr>td:first-child,.panel>.table-responsive>.table-bordered>tfoot>tr>td:first-child{border-left:0}.panel>.table-bordered>thead>tr>th:last-child,.panel>.table-responsive>.table-bordered>thead>tr>th:last-child,.panel>.table-bordered>tbody>tr>th:last-child,.panel>.table-responsive>.table-bordered>tbody>tr>th:last-child,.panel>.table-bordered>tfoot>tr>th:last-child,.panel>.table-responsive>.table-bordered>tfoot>tr>th:last-child,.panel>.table-bordered>thead>tr>td:last-child,.panel>.table-responsive>.table-bordered>thead>tr>td:last-child,.panel>.table-bordered>tbody>tr>td:last-child,.panel>.table-responsive>.table-bordered>tbody>tr>td:last-child,.panel>.table-bordered>tfoot>tr>td:last-child,.panel>.table-responsive>.table-bordered>tfoot>tr>td:last-child{border-right:0}.panel>.table-bordered>thead>tr:first-child>td,.panel>.table-responsive>.table-bordered>thead>tr:first-child>td,.panel>.table-bordered>tbody>tr:first-child>td,.panel>.table-responsive>.table-bordered>tbody>tr:first-child>td,.panel>.table-bordered>thead>tr:first-child>th,.panel>.table-responsive>.table-bordered>thead>tr:first-child>th,.panel>.table-bordered>tbody>tr:first-child>th,.panel>.table-responsive>.table-bordered>tbody>tr:first-child>th{border-bottom:0}.panel>.table-bordered>tbody>tr:last-child>td,.panel>.table-responsive>.table-bordered>tbody>tr:last-child>td,.panel>.table-bordered>tfoot>tr:last-child>td,.panel>.table-responsive>.table-bordered>tfoot>tr:last-child>td,.panel>.table-bordered>tbody>tr:last-child>th,.panel>.table-responsive>.table-bordered>tbody>tr:last-child>th,.panel>.table-bordered>tfoot>tr:last-child>th,.panel>.table-responsive>.table-bordered>tfoot>tr:last-child>th{border-bottom:0}.panel>.table-responsive{margin-bottom:0;border:0}.panel-group{margin-bottom:20px}.panel-group .panel{margin-bottom:0;border-radius:4px}.panel-group .panel+.panel{margin-top:5px}.panel-group .panel-heading{border-bottom:0}.panel-group .panel-heading+.panel-collapse>.panel-body{border-top:1px solid #ddd}.panel-group .panel-footer{border-top:0}.panel-group .panel-footer+.panel-collapse .panel-body{border-bottom:1px solid #ddd}.panel-default{border-color:#ddd}.panel-default>.panel-heading{color:#333;background-color:#f5f5f5;border-color:#ddd}.panel-default>.panel-heading+.panel-collapse>.panel-body{border-top-color:#ddd}.panel-default>.panel-heading .badge{color:#f5f5f5;background-color:#333}.panel-default>.panel-footer+.panel-collapse>.panel-body{border-bottom-color:#ddd}.panel-primary{border-color:#428bca}.panel-primary>.panel-heading{color:#fff;background-color:#428bca;border-color:#428bca}.panel-primary>.panel-heading+.panel-collapse>.panel-body{border-top-color:#428bca}.panel-primary>.panel-heading .badge{color:#428bca;background-color:#fff}.panel-primary>.panel-footer+.panel-collapse>.panel-body{border-bottom-color:#428bca}.panel-success{border-color:#d6e9c6}.panel-success>.panel-heading{color:#3c763d;background-color:#dff0d8;border-color:#d6e9c6}.panel-success>.panel-heading+.panel-collapse>.panel-body{border-top-color:#d6e9c6}.panel-success>.panel-heading .badge{color:#dff0d8;background-color:#3c763d}.panel-success>.panel-footer+.panel-collapse>.panel-body{border-bottom-color:#d6e9c6}.panel-info{border-color:#bce8f1}.panel-info>.panel-heading{color:#31708f;background-color:#d9edf7;border-color:#bce8f1}.panel-info>.panel-heading+.panel-collapse>.panel-body{border-top-color:#bce8f1}.panel-info>.panel-heading .badge{color:#d9edf7;background-color:#31708f}.panel-info>.panel-footer+.panel-collapse>.panel-body{border-bottom-color:#bce8f1}.panel-warning{border-color:#faebcc}.panel-warning>.panel-heading{color:#8a6d3b;background-color:#fcf8e3;border-color:#faebcc}.panel-warning>.panel-heading+.panel-collapse>.panel-body{border-top-color:#faebcc}.panel-warning>.panel-heading .badge{color:#fcf8e3;background-color:#8a6d3b}.panel-warning>.panel-footer+.panel-collapse>.panel-body{border-bottom-color:#faebcc}.panel-danger{border-color:#ebccd1}.panel-danger>.panel-heading{color:#a94442;background-color:#f2dede;border-color:#ebccd1}.panel-danger>.panel-heading+.panel-collapse>.panel-body{border-top-color:#ebccd1}.panel-danger>.panel-heading .badge{color:#f2dede;background-color:#a94442}.panel-danger>.panel-footer+.panel-collapse>.panel-body{border-bottom-color:#ebccd1}.embed-responsive{position:relative;display:block;height:0;padding:0;overflow:hidden}.embed-responsive .embed-responsive-item,.embed-responsive iframe,.embed-responsive embed,.embed-responsive object{position:absolute;top:0;bottom:0;left:0;width:100%;height:100%;border:0}.embed-responsive.embed-responsive-16by9{padding-bottom:56.25%}.embed-responsive.embed-responsive-4by3{padding-bottom:75%}.well{min-height:20px;padding:19px;margin-bottom:20px;background-color:#f5f5f5;border:1px solid #e3e3e3;border-radius:4px;-webkit-box-shadow:inset 0 1px 1px rgba(0,0,0,.05);box-shadow:inset 0 1px 1px rgba(0,0,0,.05)}.well blockquote{border-color:#ddd;border-color:rgba(0,0,0,.15)}.well-lg{padding:24px;border-radius:6px}.well-sm{padding:9px;border-radius:3px}.close{float:right;font-size:21px;font-weight:700;line-height:1;color:#000;text-shadow:0 1px 0 #fff;filter:alpha(opacity=20);opacity:.2}.close:hover,.close:focus{color:#000;text-decoration:none;cursor:pointer;filter:alpha(opacity=50);opacity:.5}button.close{-webkit-appearance:none;padding:0;cursor:pointer;background:0 0;border:0}.modal-open{overflow:hidden}.modal{position:fixed;top:0;right:0;bottom:0;left:0;z-index:1050;display:none;overflow:hidden;-webkit-overflow-scrolling:touch;outline:0}.modal.fade .modal-dialog{-webkit-transition:-webkit-transform .3s ease-out;-o-transition:-o-transform .3s ease-out;transition:transform .3s ease-out;-webkit-transform:translate3d(0,-25%,0);-o-transform:translate3d(0,-25%,0);transform:translate3d(0,-25%,0)}.modal.in .modal-dialog{-webkit-transform:translate3d(0,0,0);-o-transform:translate3d(0,0,0);transform:translate3d(0,0,0)}.modal-open .modal{overflow-x:hidden;overflow-y:auto}.modal-dialog{position:relative;width:auto;margin:10px}.modal-content{position:relative;background-color:#fff;-webkit-background-clip:padding-box;background-clip:padding-box;border:1px solid #999;border:1px solid rgba(0,0,0,.2);border-radius:6px;outline:0;-webkit-box-shadow:0 3px 9px rgba(0,0,0,.5);box-shadow:0 3px 9px rgba(0,0,0,.5)}.modal-backdrop{position:fixed;top:0;right:0;bottom:0;left:0;z-index:1040;background-color:#000}.modal-backdrop.fade{filter:alpha(opacity=0);opacity:0}.modal-backdrop.in{filter:alpha(opacity=50);opacity:.5}.modal-header{min-height:16.43px;padding:15px;border-bottom:1px solid #e5e5e5}.modal-header .close{margin-top:-2px}.modal-title{margin:0;line-height:1.42857143}.modal-body{position:relative;padding:15px}.modal-footer{padding:15px;text-align:right;border-top:1px solid #e5e5e5}.modal-footer .btn+.btn{margin-bottom:0;margin-left:5px}.modal-footer .btn-group .btn+.btn{margin-left:-1px}.modal-footer .btn-block+.btn-block{margin-left:0}.modal-scrollbar-measure{position:absolute;top:-9999px;width:50px;height:50px;overflow:scroll}@media (min-width:768px){.modal-dialog{width:600px;margin:30px auto}.modal-content{-webkit-box-shadow:0 5px 15px rgba(0,0,0,.5);box-shadow:0 5px 15px rgba(0,0,0,.5)}.modal-sm{width:300px}}@media (min-width:992px){.modal-lg{width:900px}}.tooltip{position:absolute;z-index:1070;display:block;font-size:12px;line-height:1.4;visibility:visible;filter:alpha(opacity=0);opacity:0}.tooltip.in{filter:alpha(opacity=90);opacity:.9}.tooltip.top{padding:5px 0;margin-top:-3px}.tooltip.right{padding:0 5px;margin-left:3px}.tooltip.bottom{padding:5px 0;margin-top:3px}.tooltip.left{padding:0 5px;margin-left:-3px}.tooltip-inner{max-width:200px;padding:3px 8px;color:#fff;text-align:center;text-decoration:none;background-color:#000;border-radius:4px}.tooltip-arrow{position:absolute;width:0;height:0;border-color:transparent;border-style:solid}.tooltip.top .tooltip-arrow{bottom:0;left:50%;margin-left:-5px;border-width:5px 5px 0;border-top-color:#000}.tooltip.top-left .tooltip-arrow{bottom:0;left:5px;border-width:5px 5px 0;border-top-color:#000}.tooltip.top-right .tooltip-arrow{right:5px;bottom:0;border-width:5px 5px 0;border-top-color:#000}.tooltip.right .tooltip-arrow{top:50%;left:0;margin-top:-5px;border-width:5px 5px 5px 0;border-right-color:#000}.tooltip.left .tooltip-arrow{top:50%;right:0;margin-top:-5px;border-width:5px 0 5px 5px;border-left-color:#000}.tooltip.bottom .tooltip-arrow{top:0;left:50%;margin-left:-5px;border-width:0 5px 5px;border-bottom-color:#000}.tooltip.bottom-left .tooltip-arrow{top:0;left:5px;border-width:0 5px 5px;border-bottom-color:#000}.tooltip.bottom-right .tooltip-arrow{top:0;right:5px;border-width:0 5px 5px;border-bottom-color:#000}.popover{position:absolute;top:0;left:0;z-index:1060;display:none;max-width:276px;padding:1px;text-align:left;white-space:normal;background-color:#fff;-webkit-background-clip:padding-box;background-clip:padding-box;border:1px solid #ccc;border:1px solid rgba(0,0,0,.2);border-radius:6px;-webkit-box-shadow:0 5px 10px rgba(0,0,0,.2);box-shadow:0 5px 10px rgba(0,0,0,.2)}.popover.top{margin-top:-10px}.popover.right{margin-left:10px}.popover.bottom{margin-top:10px}.popover.left{margin-left:-10px}.popover-title{padding:8px 14px;margin:0;font-size:14px;font-weight:400;line-height:18px;background-color:#f7f7f7;border-bottom:1px solid #ebebeb;border-radius:5px 5px 0 0}.popover-content{padding:9px 14px}.popover>.arrow,.popover>.arrow:after{position:absolute;display:block;width:0;height:0;border-color:transparent;border-style:solid}.popover>.arrow{border-width:11px}.popover>.arrow:after{content:"";border-width:10px}.popover.top>.arrow{bottom:-11px;left:50%;margin-left:-11px;border-top-color:#999;border-top-color:rgba(0,0,0,.25);border-bottom-width:0}.popover.top>.arrow:after{bottom:1px;margin-left:-10px;content:" ";border-top-color:#fff;border-bottom-width:0}.popover.right>.arrow{top:50%;left:-11px;margin-top:-11px;border-right-color:#999;border-right-color:rgba(0,0,0,.25);border-left-width:0}.popover.right>.arrow:after{bottom:-10px;left:1px;content:" ";border-right-color:#fff;border-left-width:0}.popover.bottom>.arrow{top:-11px;left:50%;margin-left:-11px;border-top-width:0;border-bottom-color:#999;border-bottom-color:rgba(0,0,0,.25)}.popover.bottom>.arrow:after{top:1px;margin-left:-10px;content:" ";border-top-width:0;border-bottom-color:#fff}.popover.left>.arrow{top:50%;right:-11px;margin-top:-11px;border-right-width:0;border-left-color:#999;border-left-color:rgba(0,0,0,.25)}.popover.left>.arrow:after{right:1px;bottom:-10px;content:" ";border-right-width:0;border-left-color:#fff}.carousel{position:relative}.carousel-inner{position:relative;width:100%;overflow:hidden}.carousel-inner>.item{position:relative;display:none;-webkit-transition:.6s ease-in-out left;-o-transition:.6s ease-in-out left;transition:.6s ease-in-out left}.carousel-inner>.item>img,.carousel-inner>.item>a>img{line-height:1}.carousel-inner>.active,.carousel-inner>.next,.carousel-inner>.prev{display:block}.carousel-inner>.active{left:0}.carousel-inner>.next,.carousel-inner>.prev{position:absolute;top:0;width:100%}.carousel-inner>.next{left:100%}.carousel-inner>.prev{left:-100%}.carousel-inner>.next.left,.carousel-inner>.prev.right{left:0}.carousel-inner>.active.left{left:-100%}.carousel-inner>.active.right{left:100%}.carousel-control{position:absolute;top:0;bottom:0;left:0;width:15%;font-size:20px;color:#fff;text-align:center;text-shadow:0 1px 2px rgba(0,0,0,.6);filter:alpha(opacity=50);opacity:.5}.carousel-control.left{background-image:-webkit-linear-gradient(left,rgba(0,0,0,.5) 0,rgba(0,0,0,.0001) 100%);background-image:-o-linear-gradient(left,rgba(0,0,0,.5) 0,rgba(0,0,0,.0001) 100%);background-image:-webkit-gradient(linear,left top,right top,from(rgba(0,0,0,.5)),to(rgba(0,0,0,.0001)));background-image:linear-gradient(to right,rgba(0,0,0,.5) 0,rgba(0,0,0,.0001) 100%);filter:progid:DXImageTransform.Microsoft.gradient(startColorstr='#80000000', endColorstr='#00000000', GradientType=1);background-repeat:repeat-x}.carousel-control.right{right:0;left:auto;background-image:-webkit-linear-gradient(left,rgba(0,0,0,.0001) 0,rgba(0,0,0,.5) 100%);background-image:-o-linear-gradient(left,rgba(0,0,0,.0001) 0,rgba(0,0,0,.5) 100%);background-image:-webkit-gradient(linear,left top,right top,from(rgba(0,0,0,.0001)),to(rgba(0,0,0,.5)));background-image:linear-gradient(to right,rgba(0,0,0,.0001) 0,rgba(0,0,0,.5) 100%);filter:progid:DXImageTransform.Microsoft.gradient(startColorstr='#00000000', endColorstr='#80000000', GradientType=1);background-repeat:repeat-x}.carousel-control:hover,.carousel-control:focus{color:#fff;text-decoration:none;filter:alpha(opacity=90);outline:0;opacity:.9}.carousel-control .icon-prev,.carousel-control .icon-next,.carousel-control .glyphicon-chevron-left,.carousel-control .glyphicon-chevron-right{position:absolute;top:50%;z-index:5;display:inline-block}.carousel-control .icon-prev,.carousel-control .glyphicon-chevron-left{left:50%;margin-left:-10px}.carousel-control .icon-next,.carousel-control .glyphicon-chevron-right{right:50%;margin-right:-10px}.carousel-control .icon-prev,.carousel-control .icon-next{width:20px;height:20px;margin-top:-10px;font-family:serif}.carousel-control .icon-prev:before{content:'\2039'}.carousel-control .icon-next:before{content:'\203a'}.carousel-indicators{position:absolute;bottom:10px;left:50%;z-index:15;width:60%;padding-left:0;margin-left:-30%;text-align:center;list-style:none}.carousel-indicators li{display:inline-block;width:10px;height:10px;margin:1px;text-indent:-999px;cursor:pointer;background-color:#000 \9;background-color:rgba(0,0,0,0);border:1px solid #fff;border-radius:10px}.carousel-indicators .active{width:12px;height:12px;margin:0;background-color:#fff}.carousel-caption{position:absolute;right:15%;bottom:20px;left:15%;z-index:10;padding-top:20px;padding-bottom:20px;color:#fff;text-align:center;text-shadow:0 1px 2px rgba(0,0,0,.6)}.carousel-caption .btn{text-shadow:none}@media screen and (min-width:768px){.carousel-control .glyphicon-chevron-left,.carousel-control .glyphicon-chevron-right,.carousel-control .icon-prev,.carousel-control .icon-next{width:30px;height:30px;margin-top:-15px;font-size:30px}.carousel-control .glyphicon-chevron-left,.carousel-control .icon-prev{margin-left:-15px}.carousel-control .glyphicon-chevron-right,.carousel-control .icon-next{margin-right:-15px}.carousel-caption{right:20%;left:20%;padding-bottom:30px}.carousel-indicators{bottom:20px}}.clearfix:before,.clearfix:after,.dl-horizontal dd:before,.dl-horizontal dd:after,.container:before,.container:after,.container-fluid:before,.container-fluid:after,.row:before,.row:after,.form-horizontal .form-group:before,.form-horizontal .form-group:after,.btn-toolbar:before,.btn-toolbar:after,.btn-group-vertical>.btn-group:before,.btn-group-vertical>.btn-group:after,.nav:before,.nav:after,.navbar:before,.navbar:after,.navbar-header:before,.navbar-header:after,.navbar-collapse:before,.navbar-collapse:after,.pager:before,.pager:after,.panel-body:before,.panel-body:after,.modal-footer:before,.modal-footer:after{display:table;content:" "}.clearfix:after,.dl-horizontal dd:after,.container:after,.container-fluid:after,.row:after,.form-horizontal .form-group:after,.btn-toolbar:after,.btn-group-vertical>.btn-group:after,.nav:after,.navbar:after,.navbar-header:after,.navbar-collapse:after,.pager:after,.panel-body:after,.modal-footer:after{clear:both}.center-block{display:block;margin-right:auto;margin-left:auto}.pull-right{float:right!important}.pull-left{float:left!important}.hide{display:none!important}.show{display:block!important}.invisible{visibility:hidden}.text-hide{font:0/0 a;color:transparent;text-shadow:none;background-color:transparent;border:0}.hidden{display:none!important;visibility:hidden!important}.affix{position:fixed;-webkit-transform:translate3d(0,0,0);-o-transform:translate3d(0,0,0);transform:translate3d(0,0,0)}@-ms-viewport{width:device-width}.visible-xs,.visible-sm,.visible-md,.visible-lg{display:none!important}.visible-xs-block,.visible-xs-inline,.visible-xs-inline-block,.visible-sm-block,.visible-sm-inline,.visible-sm-inline-block,.visible-md-block,.visible-md-inline,.visible-md-inline-block,.visible-lg-block,.visible-lg-inline,.visible-lg-inline-block{display:none!important}@media (max-width:767px){.visible-xs{display:block!important}table.visible-xs{display:table}tr.visible-xs{display:table-row!important}th.visible-xs,td.visible-xs{display:table-cell!important}}@media (max-width:767px){.visible-xs-block{display:block!important}}@media (max-width:767px){.visible-xs-inline{display:inline!important}}@media (max-width:767px){.visible-xs-inline-block{display:inline-block!important}}@media (min-width:768px) and (max-width:991px){.visible-sm{display:block!important}table.visible-sm{display:table}tr.visible-sm{display:table-row!important}th.visible-sm,td.visible-sm{display:table-cell!important}}@media (min-width:768px) and (max-width:991px){.visible-sm-block{display:block!important}}@media (min-width:768px) and (max-width:991px){.visible-sm-inline{display:inline!important}}@media (min-width:768px) and (max-width:991px){.visible-sm-inline-block{display:inline-block!important}}@media (min-width:992px) and (max-width:1199px){.visible-md{display:block!important}table.visible-md{display:table}tr.visible-md{display:table-row!important}th.visible-md,td.visible-md{display:table-cell!important}}@media (min-width:992px) and (max-width:1199px){.visible-md-block{display:block!important}}@media (min-width:992px) and (max-width:1199px){.visible-md-inline{display:inline!important}}@media (min-width:992px) and (max-width:1199px){.visible-md-inline-block{display:inline-block!important}}@media (min-width:1200px){.visible-lg{display:block!important}table.visible-lg{display:table}tr.visible-lg{display:table-row!important}th.visible-lg,td.visible-lg{display:table-cell!important}}@media (min-width:1200px){.visible-lg-block{display:block!important}}@media (min-width:1200px){.visible-lg-inline{display:inline!important}}@media (min-width:1200px){.visible-lg-inline-block{display:inline-block!important}}@media (max-width:767px){.hidden-xs{display:none!important}}@media (min-width:768px) and (max-width:991px){.hidden-sm{display:none!important}}@media (min-width:992px) and (max-width:1199px){.hidden-md{display:none!important}}@media (min-width:1200px){.hidden-lg{display:none!important}}.visible-print{display:none!important}@media print{.visible-print{display:block!important}table.visible-print{display:table}tr.visible-print{display:table-row!important}th.visible-print,td.visible-print{display:table-cell!important}}.visible-print-block{display:none!important}@media print{.visible-print-block{display:block!important}}.visible-print-inline{display:none!important}@media print{.visible-print-inline{display:inline!important}}.visible-print-inline-block{display:none!important}@media print{.visible-print-inline-block{display:inline-block!important}}@media print{.hidden-print{display:none!important}}
- </style>
-
+ *//*! normalize.css v3.0.1 | MIT License | git.io/normalize */html{font-family:sans-serif;-webkit-text-size-adjust:100%;-ms-text-size-adjust:100%}body{margin:0}article,aside,details,figcaption,figure,footer,header,hgroup,main,nav,section,summary{display:block}audio,canvas,progress,video{display:inline-block;vertical-align:baseline}audio:not([controls]){display:none;height:0}[hidden],template{display:none}a{background:0 0}a:active,a:hover{outline:0}abbr[title]{border-bottom:1px dotted}b,strong{font-weight:700}dfn{font-style:italic}h1{margin:.67em 0;font-size:2em}mark{color:#000;background:#ff0}small{font-size:80%}sub,sup{position:relative;font-size:75%;line-height:0;vertical-align:baseline}sup{top:-.5em}sub{bottom:-.25em}img{border:0}svg:not(:root){overflow:hidden}figure{margin:1em 40px}hr{height:0;-webkit-box-sizing:content-box;-moz-box-sizing:content-box;box-sizing:content-box}pre{overflow:auto}code,kbd,pre,samp{font-family:monospace,monospace;font-size:1em}button,input,optgroup,select,textarea{margin:0;font:inherit;color:inherit}button{overflow:visible}button,select{text-transform:none}button,html input[type=button],input[type=reset],input[type=submit]{-webkit-appearance:button;cursor:pointer}button[disabled],html input[disabled]{cursor:default}button::-moz-focus-inner,input::-moz-focus-inner{padding:0;border:0}input{line-height:normal}input[type=checkbox],input[type=radio]{-webkit-box-sizing:border-box;-moz-box-sizing:border-box;box-sizing:border-box;padding:0}input[type=number]::-webkit-inner-spin-button,input[type=number]::-webkit-outer-spin-button{height:auto}input[type=search]{-webkit-box-sizing:content-box;-moz-box-sizing:content-box;box-sizing:content-box;-webkit-appearance:textfield}input[type=search]::-webkit-search-cancel-button,input[type=search]::-webkit-search-decoration{-webkit-appearance:none}fieldset{padding:.35em .625em .75em;margin:0 2px;border:1px solid silver}legend{padding:0;border:0}textarea{overflow:auto}optgroup{font-weight:700}table{border-spacing:0;border-collapse:collapse}td,th{padding:0}@media print{*{color:#000!important;text-shadow:none!important;background:transparent!important;-webkit-box-shadow:none!important;box-shadow:none!important}a,a:visited{text-decoration:underline}a[href]:after{content:" (" attr(href) ")"}abbr[title]:after{content:" (" attr(title) ")"}a[href^="javascript:"]:after,a[href^="#"]:after{content:""}pre,blockquote{border:1px solid #999;page-break-inside:avoid}thead{display:table-header-group}tr,img{page-break-inside:avoid}img{max-width:100%!important}p,h2,h3{orphans:3;widows:3}h2,h3{page-break-after:avoid}select{background:#fff!important}.navbar{display:none}.table td,.table th{background-color:#fff!important}.btn>.caret,.dropup>.btn>.caret{border-top-color:#000!important}.label{border:1px solid #000}.table{border-collapse:collapse!important}.table-bordered th,.table-bordered td{border:1px solid #ddd!important}}@font-face{font-family:'Glyphicons Halflings';src:url(../fonts/glyphicons-halflings-regular.eot);src:url(../fonts/glyphicons-halflings-regular.eot?#iefix) format('embedded-opentype'),url(../fonts/glyphicons-halflings-regular.woff) format('woff'),url(../fonts/glyphicons-halflings-regular.ttf) format('truetype'),url(../fonts/glyphicons-halflings-regular.svg#glyphicons_halflingsregular) format('svg')}.glyphicon{position:relative;top:1px;display:inline-block;font-family:'Glyphicons Halflings';font-style:normal;font-weight:400;line-height:1;-webkit-font-smoothing:antialiased;-moz-osx-font-smoothing:grayscale}.glyphicon-asterisk:before{content:"\2a"}.glyphicon-plus:before{content:"\2b"}.glyphicon-euro:before{content:"\20ac"}.glyphicon-minus:before{content:"\2212"}.glyphicon-cloud:before{content:"\2601"}.glyphicon-envelope:before{content:"\2709"}.glyphicon-pencil:before{content:"\270f"}.glyphicon-glass:before{content:"\e001"}.glyphicon-music:before{content:"\e002"}.glyphicon-search:before{content:"\e003"}.glyphicon-heart:before{content:"\e005"}.glyphicon-star:before{content:"\e006"}.glyphicon-star-empty:before{content:"\e007"}.glyphicon-user:before{content:"\e008"}.glyphicon-film:before{content:"\e009"}.glyphicon-th-large:before{content:"\e010"}.glyphicon-th:before{content:"\e011"}.glyphicon-th-list:before{content:"\e012"}.glyphicon-ok:before{content:"\e013"}.glyphicon-remove:before{content:"\e014"}.glyphicon-zoom-in:before{content:"\e015"}.glyphicon-zoom-out:before{content:"\e016"}.glyphicon-off:before{content:"\e017"}.glyphicon-signal:before{content:"\e018"}.glyphicon-cog:before{content:"\e019"}.glyphicon-trash:before{content:"\e020"}.glyphicon-home:before{content:"\e021"}.glyphicon-file:before{content:"\e022"}.glyphicon-time:before{content:"\e023"}.glyphicon-road:before{content:"\e024"}.glyphicon-download-alt:before{content:"\e025"}.glyphicon-download:before{content:"\e026"}.glyphicon-upload:before{content:"\e027"}.glyphicon-inbox:before{content:"\e028"}.glyphicon-play-circle:before{content:"\e029"}.glyphicon-repeat:before{content:"\e030"}.glyphicon-refresh:before{content:"\e031"}.glyphicon-list-alt:before{content:"\e032"}.glyphicon-lock:before{content:"\e033"}.glyphicon-flag:before{content:"\e034"}.glyphicon-headphones:before{content:"\e035"}.glyphicon-volume-off:before{content:"\e036"}.glyphicon-volume-down:before{content:"\e037"}.glyphicon-volume-up:before{content:"\e038"}.glyphicon-qrcode:before{content:"\e039"}.glyphicon-barcode:before{content:"\e040"}.glyphicon-tag:before{content:"\e041"}.glyphicon-tags:before{content:"\e042"}.glyphicon-book:before{content:"\e043"}.glyphicon-bookmark:before{content:"\e044"}.glyphicon-print:before{content:"\e045"}.glyphicon-camera:before{content:"\e046"}.glyphicon-font:before{content:"\e047"}.glyphicon-bold:before{content:"\e048"}.glyphicon-italic:before{content:"\e049"}.glyphicon-text-height:before{content:"\e050"}.glyphicon-text-width:before{content:"\e051"}.glyphicon-align-left:before{content:"\e052"}.glyphicon-align-center:before{content:"\e053"}.glyphicon-align-right:before{content:"\e054"}.glyphicon-align-justify:before{content:"\e055"}.glyphicon-list:before{content:"\e056"}.glyphicon-indent-left:before{content:"\e057"}.glyphicon-indent-right:before{content:"\e058"}.glyphicon-facetime-video:before{content:"\e059"}.glyphicon-picture:before{content:"\e060"}.glyphicon-map-marker:before{content:"\e062"}.glyphicon-adjust:before{content:"\e063"}.glyphicon-tint:before{content:"\e064"}.glyphicon-edit:before{content:"\e065"}.glyphicon-share:before{content:"\e066"}.glyphicon-check:before{content:"\e067"}.glyphicon-move:before{content:"\e068"}.glyphicon-step-backward:before{content:"\e069"}.glyphicon-fast-backward:before{content:"\e070"}.glyphicon-backward:before{content:"\e071"}.glyphicon-play:before{content:"\e072"}.glyphicon-pause:before{content:"\e073"}.glyphicon-stop:before{content:"\e074"}.glyphicon-forward:before{content:"\e075"}.glyphicon-fast-forward:before{content:"\e076"}.glyphicon-step-forward:before{content:"\e077"}.glyphicon-eject:before{content:"\e078"}.glyphicon-chevron-left:before{content:"\e079"}.glyphicon-chevron-right:before{content:"\e080"}.glyphicon-plus-sign:before{content:"\e081"}.glyphicon-minus-sign:before{content:"\e082"}.glyphicon-remove-sign:before{content:"\e083"}.glyphicon-ok-sign:before{content:"\e084"}.glyphicon-question-sign:before{content:"\e085"}.glyphicon-info-sign:before{content:"\e086"}.glyphicon-screenshot:before{content:"\e087"}.glyphicon-remove-circle:before{content:"\e088"}.glyphicon-ok-circle:before{content:"\e089"}.glyphicon-ban-circle:before{content:"\e090"}.glyphicon-arrow-left:before{content:"\e091"}.glyphicon-arrow-right:before{content:"\e092"}.glyphicon-arrow-up:before{content:"\e093"}.glyphicon-arrow-down:before{content:"\e094"}.glyphicon-share-alt:before{content:"\e095"}.glyphicon-resize-full:before{content:"\e096"}.glyphicon-resize-small:before{content:"\e097"}.glyphicon-exclamation-sign:before{content:"\e101"}.glyphicon-gift:before{content:"\e102"}.glyphicon-leaf:before{content:"\e103"}.glyphicon-fire:before{content:"\e104"}.glyphicon-eye-open:before{content:"\e105"}.glyphicon-eye-close:before{content:"\e106"}.glyphicon-warning-sign:before{content:"\e107"}.glyphicon-plane:before{content:"\e108"}.glyphicon-calendar:before{content:"\e109"}.glyphicon-random:before{content:"\e110"}.glyphicon-comment:before{content:"\e111"}.glyphicon-magnet:before{content:"\e112"}.glyphicon-chevron-up:before{content:"\e113"}.glyphicon-chevron-down:before{content:"\e114"}.glyphicon-retweet:before{content:"\e115"}.glyphicon-shopping-cart:before{content:"\e116"}.glyphicon-folder-close:before{content:"\e117"}.glyphicon-folder-open:before{content:"\e118"}.glyphicon-resize-vertical:before{content:"\e119"}.glyphicon-resize-horizontal:before{content:"\e120"}.glyphicon-hdd:before{content:"\e121"}.glyphicon-bullhorn:before{content:"\e122"}.glyphicon-bell:before{content:"\e123"}.glyphicon-certificate:before{content:"\e124"}.glyphicon-thumbs-up:before{content:"\e125"}.glyphicon-thumbs-down:before{content:"\e126"}.glyphicon-hand-right:before{content:"\e127"}.glyphicon-hand-left:before{content:"\e128"}.glyphicon-hand-up:before{content:"\e129"}.glyphicon-hand-down:before{content:"\e130"}.glyphicon-circle-arrow-right:before{content:"\e131"}.glyphicon-circle-arrow-left:before{content:"\e132"}.glyphicon-circle-arrow-up:before{content:"\e133"}.glyphicon-circle-arrow-down:before{content:"\e134"}.glyphicon-globe:before{content:"\e135"}.glyphicon-wrench:before{content:"\e136"}.glyphicon-tasks:before{content:"\e137"}.glyphicon-filter:before{content:"\e138"}.glyphicon-briefcase:before{content:"\e139"}.glyphicon-fullscreen:before{content:"\e140"}.glyphicon-dashboard:before{content:"\e141"}.glyphicon-paperclip:before{content:"\e142"}.glyphicon-heart-empty:before{content:"\e143"}.glyphicon-link:before{content:"\e144"}.glyphicon-phone:before{content:"\e145"}.glyphicon-pushpin:before{content:"\e146"}.glyphicon-usd:before{content:"\e148"}.glyphicon-gbp:before{content:"\e149"}.glyphicon-sort:before{content:"\e150"}.glyphicon-sort-by-alphabet:before{content:"\e151"}.glyphicon-sort-by-alphabet-alt:before{content:"\e152"}.glyphicon-sort-by-order:before{content:"\e153"}.glyphicon-sort-by-order-alt:before{content:"\e154"}.glyphicon-sort-by-attributes:before{content:"\e155"}.glyphicon-sort-by-attributes-alt:before{content:"\e156"}.glyphicon-unchecked:before{content:"\e157"}.glyphicon-expand:before{content:"\e158"}.glyphicon-collapse-down:before{content:"\e159"}.glyphicon-collapse-up:before{content:"\e160"}.glyphicon-log-in:before{content:"\e161"}.glyphicon-flash:before{content:"\e162"}.glyphicon-log-out:before{content:"\e163"}.glyphicon-new-window:before{content:"\e164"}.glyphicon-record:before{content:"\e165"}.glyphicon-save:before{content:"\e166"}.glyphicon-open:before{content:"\e167"}.glyphicon-saved:before{content:"\e168"}.glyphicon-import:before{content:"\e169"}.glyphicon-export:before{content:"\e170"}.glyphicon-send:before{content:"\e171"}.glyphicon-floppy-disk:before{content:"\e172"}.glyphicon-floppy-saved:before{content:"\e173"}.glyphicon-floppy-remove:before{content:"\e174"}.glyphicon-floppy-save:before{content:"\e175"}.glyphicon-floppy-open:before{content:"\e176"}.glyphicon-credit-card:before{content:"\e177"}.glyphicon-transfer:before{content:"\e178"}.glyphicon-cutlery:before{content:"\e179"}.glyphicon-header:before{content:"\e180"}.glyphicon-compressed:before{content:"\e181"}.glyphicon-earphone:before{content:"\e182"}.glyphicon-phone-alt:before{content:"\e183"}.glyphicon-tower:before{content:"\e184"}.glyphicon-stats:before{content:"\e185"}.glyphicon-sd-video:before{content:"\e186"}.glyphicon-hd-video:before{content:"\e187"}.glyphicon-subtitles:before{content:"\e188"}.glyphicon-sound-stereo:before{content:"\e189"}.glyphicon-sound-dolby:before{content:"\e190"}.glyphicon-sound-5-1:before{content:"\e191"}.glyphicon-sound-6-1:before{content:"\e192"}.glyphicon-sound-7-1:before{content:"\e193"}.glyphicon-copyright-mark:before{content:"\e194"}.glyphicon-registration-mark:before{content:"\e195"}.glyphicon-cloud-download:before{content:"\e197"}.glyphicon-cloud-upload:before{content:"\e198"}.glyphicon-tree-conifer:before{content:"\e199"}.glyphicon-tree-deciduous:before{content:"\e200"}*{-webkit-box-sizing:border-box;-moz-box-sizing:border-box;box-sizing:border-box}:before,:after{-webkit-box-sizing:border-box;-moz-box-sizing:border-box;box-sizing:border-box}html{font-size:10px;-webkit-tap-highlight-color:rgba(0,0,0,0)}body{font-family:"Helvetica Neue",Helvetica,Arial,sans-serif;font-size:14px;line-height:1.42857143;color:#333;background-color:#fff}input,button,select,textarea{font-family:inherit;font-size:inherit;line-height:inherit}a{color:#428bca;text-decoration:none}a:hover,a:focus{color:#2a6496;text-decoration:underline}a:focus{outline:thin dotted;outline:5px auto -webkit-focus-ring-color;outline-offset:-2px}figure{margin:0}img{vertical-align:middle}.img-responsive,.thumbnail>img,.thumbnail a>img,.carousel-inner>.item>img,.carousel-inner>.item>a>img{display:block;width:100% \9;max-width:100%;height:auto}.img-rounded{border-radius:6px}.img-thumbnail{display:inline-block;width:100% \9;max-width:100%;height:auto;padding:4px;line-height:1.42857143;background-color:#fff;border:1px solid #ddd;border-radius:4px;-webkit-transition:all .2s ease-in-out;-o-transition:all .2s ease-in-out;transition:all .2s ease-in-out}.img-circle{border-radius:50%}hr{margin-top:20px;margin-bottom:20px;border:0;border-top:1px solid #eee}.sr-only{position:absolute;width:1px;height:1px;padding:0;margin:-1px;overflow:hidden;clip:rect(0,0,0,0);border:0}.sr-only-focusable:active,.sr-only-focusable:focus{position:static;width:auto;height:auto;margin:0;overflow:visible;clip:auto}h1,h2,h3,h4,h5,h6,.h1,.h2,.h3,.h4,.h5,.h6{font-family:inherit;font-weight:500;line-height:1.1;color:inherit}h1 small,h2 small,h3 small,h4 small,h5 small,h6 small,.h1 small,.h2 small,.h3 small,.h4 small,.h5 small,.h6 small,h1 .small,h2 .small,h3 .small,h4 .small,h5 .small,h6 .small,.h1 .small,.h2 .small,.h3 .small,.h4 .small,.h5 .small,.h6 .small{font-weight:400;line-height:1;color:#777}h1,.h1,h2,.h2,h3,.h3{margin-top:20px;margin-bottom:10px}h1 small,.h1 small,h2 small,.h2 small,h3 small,.h3 small,h1 .small,.h1 .small,h2 .small,.h2 .small,h3 .small,.h3 .small{font-size:65%}h4,.h4,h5,.h5,h6,.h6{margin-top:10px;margin-bottom:10px}h4 small,.h4 small,h5 small,.h5 small,h6 small,.h6 small,h4 .small,.h4 .small,h5 .small,.h5 .small,h6 .small,.h6 .small{font-size:75%}h1,.h1{font-size:36px}h2,.h2{font-size:30px}h3,.h3{font-size:24px}h4,.h4{font-size:18px}h5,.h5{font-size:14px}h6,.h6{font-size:12px}p{margin:0 0 10px}.lead{margin-bottom:20px;font-size:16px;font-weight:300;line-height:1.4}@media (min-width:768px){.lead{font-size:21px}}small,.small{font-size:85%}cite{font-style:normal}mark,.mark{padding:.2em;background-color:#fcf8e3}.text-left{text-align:left}.text-right{text-align:right}.text-center{text-align:center}.text-justify{text-align:justify}.text-nowrap{white-space:nowrap}.text-lowercase{text-transform:lowercase}.text-uppercase{text-transform:uppercase}.text-capitalize{text-transform:capitalize}.text-muted{color:#777}.text-primary{color:#428bca}a.text-primary:hover{color:#3071a9}.text-success{color:#3c763d}a.text-success:hover{color:#2b542c}.text-info{color:#31708f}a.text-info:hover{color:#245269}.text-warning{color:#8a6d3b}a.text-warning:hover{color:#66512c}.text-danger{color:#a94442}a.text-danger:hover{color:#843534}.bg-primary{color:#fff;background-color:#428bca}a.bg-primary:hover{background-color:#3071a9}.bg-success{background-color:#dff0d8}a.bg-success:hover{background-color:#c1e2b3}.bg-info{background-color:#d9edf7}a.bg-info:hover{background-color:#afd9ee}.bg-warning{background-color:#fcf8e3}a.bg-warning:hover{background-color:#f7ecb5}.bg-danger{background-color:#f2dede}a.bg-danger:hover{background-color:#e4b9b9}.page-header{padding-bottom:9px;margin:40px 0 20px;border-bottom:1px solid #eee}ul,ol{margin-top:0;margin-bottom:10px}ul ul,ol ul,ul ol,ol ol{margin-bottom:0}.list-unstyled{padding-left:0;list-style:none}.list-inline{padding-left:0;margin-left:-5px;list-style:none}.list-inline>li{display:inline-block;padding-right:5px;padding-left:5px}dl{margin-top:0;margin-bottom:20px}dt,dd{line-height:1.42857143}dt{font-weight:700}dd{margin-left:0}@media (min-width:768px){.dl-horizontal dt{float:left;width:160px;overflow:hidden;clear:left;text-align:right;text-overflow:ellipsis;white-space:nowrap}.dl-horizontal dd{margin-left:180px}}abbr[title],abbr[data-original-title]{cursor:help;border-bottom:1px dotted #777}.initialism{font-size:90%;text-transform:uppercase}blockquote{padding:10px 20px;margin:0 0 20px;font-size:17.5px;border-left:5px solid #eee}blockquote p:last-child,blockquote ul:last-child,blockquote ol:last-child{margin-bottom:0}blockquote footer,blockquote small,blockquote .small{display:block;font-size:80%;line-height:1.42857143;color:#777}blockquote footer:before,blockquote small:before,blockquote .small:before{content:'\2014 \00A0'}.blockquote-reverse,blockquote.pull-right{padding-right:15px;padding-left:0;text-align:right;border-right:5px solid #eee;border-left:0}.blockquote-reverse footer:before,blockquote.pull-right footer:before,.blockquote-reverse small:before,blockquote.pull-right small:before,.blockquote-reverse .small:before,blockquote.pull-right .small:before{content:''}.blockquote-reverse footer:after,blockquote.pull-right footer:after,.blockquote-reverse small:after,blockquote.pull-right small:after,.blockquote-reverse .small:after,blockquote.pull-right .small:after{content:'\00A0 \2014'}blockquote:before,blockquote:after{content:""}address{margin-bottom:20px;font-style:normal;line-height:1.42857143}code,kbd,pre,samp{font-family:Menlo,Monaco,Consolas,"Courier New",monospace}code{padding:2px 4px;font-size:90%;color:#c7254e;background-color:#f9f2f4;border-radius:4px}kbd{padding:2px 4px;font-size:90%;color:#fff;background-color:#333;border-radius:3px;-webkit-box-shadow:inset 0 -1px 0 rgba(0,0,0,.25);box-shadow:inset 0 -1px 0 rgba(0,0,0,.25)}kbd kbd{padding:0;font-size:100%;-webkit-box-shadow:none;box-shadow:none}pre{display:block;padding:9.5px;margin:0 0 10px;font-size:13px;line-height:1.42857143;color:#333;word-break:break-all;word-wrap:break-word;background-color:#f5f5f5;border:1px solid #ccc;border-radius:4px}pre code{padding:0;font-size:inherit;color:inherit;white-space:pre-wrap;background-color:transparent;border-radius:0}.pre-scrollable{max-height:340px;overflow-y:scroll}.container{padding-right:15px;padding-left:15px;margin-right:auto;margin-left:auto}@media (min-width:768px){.container{width:750px}}@media (min-width:992px){.container{width:970px}}@media (min-width:1200px){.container{width:1170px}}.container-fluid{padding-right:15px;padding-left:15px;margin-right:auto;margin-left:auto}.row{margin-right:-15px;margin-left:-15px}.col-xs-1,.col-sm-1,.col-md-1,.col-lg-1,.col-xs-2,.col-sm-2,.col-md-2,.col-lg-2,.col-xs-3,.col-sm-3,.col-md-3,.col-lg-3,.col-xs-4,.col-sm-4,.col-md-4,.col-lg-4,.col-xs-5,.col-sm-5,.col-md-5,.col-lg-5,.col-xs-6,.col-sm-6,.col-md-6,.col-lg-6,.col-xs-7,.col-sm-7,.col-md-7,.col-lg-7,.col-xs-8,.col-sm-8,.col-md-8,.col-lg-8,.col-xs-9,.col-sm-9,.col-md-9,.col-lg-9,.col-xs-10,.col-sm-10,.col-md-10,.col-lg-10,.col-xs-11,.col-sm-11,.col-md-11,.col-lg-11,.col-xs-12,.col-sm-12,.col-md-12,.col-lg-12{position:relative;min-height:1px;padding-right:15px;padding-left:15px}.col-xs-1,.col-xs-2,.col-xs-3,.col-xs-4,.col-xs-5,.col-xs-6,.col-xs-7,.col-xs-8,.col-xs-9,.col-xs-10,.col-xs-11,.col-xs-12{float:left}.col-xs-12{width:100%}.col-xs-11{width:91.66666667%}.col-xs-10{width:83.33333333%}.col-xs-9{width:75%}.col-xs-8{width:66.66666667%}.col-xs-7{width:58.33333333%}.col-xs-6{width:50%}.col-xs-5{width:41.66666667%}.col-xs-4{width:33.33333333%}.col-xs-3{width:25%}.col-xs-2{width:16.66666667%}.col-xs-1{width:8.33333333%}.col-xs-pull-12{right:100%}.col-xs-pull-11{right:91.66666667%}.col-xs-pull-10{right:83.33333333%}.col-xs-pull-9{right:75%}.col-xs-pull-8{right:66.66666667%}.col-xs-pull-7{right:58.33333333%}.col-xs-pull-6{right:50%}.col-xs-pull-5{right:41.66666667%}.col-xs-pull-4{right:33.33333333%}.col-xs-pull-3{right:25%}.col-xs-pull-2{right:16.66666667%}.col-xs-pull-1{right:8.33333333%}.col-xs-pull-0{right:auto}.col-xs-push-12{left:100%}.col-xs-push-11{left:91.66666667%}.col-xs-push-10{left:83.33333333%}.col-xs-push-9{left:75%}.col-xs-push-8{left:66.66666667%}.col-xs-push-7{left:58.33333333%}.col-xs-push-6{left:50%}.col-xs-push-5{left:41.66666667%}.col-xs-push-4{left:33.33333333%}.col-xs-push-3{left:25%}.col-xs-push-2{left:16.66666667%}.col-xs-push-1{left:8.33333333%}.col-xs-push-0{left:auto}.col-xs-offset-12{margin-left:100%}.col-xs-offset-11{margin-left:91.66666667%}.col-xs-offset-10{margin-left:83.33333333%}.col-xs-offset-9{margin-left:75%}.col-xs-offset-8{margin-left:66.66666667%}.col-xs-offset-7{margin-left:58.33333333%}.col-xs-offset-6{margin-left:50%}.col-xs-offset-5{margin-left:41.66666667%}.col-xs-offset-4{margin-left:33.33333333%}.col-xs-offset-3{margin-left:25%}.col-xs-offset-2{margin-left:16.66666667%}.col-xs-offset-1{margin-left:8.33333333%}.col-xs-offset-0{margin-left:0}@media (min-width:768px){.col-sm-1,.col-sm-2,.col-sm-3,.col-sm-4,.col-sm-5,.col-sm-6,.col-sm-7,.col-sm-8,.col-sm-9,.col-sm-10,.col-sm-11,.col-sm-12{float:left}.col-sm-12{width:100%}.col-sm-11{width:91.66666667%}.col-sm-10{width:83.33333333%}.col-sm-9{width:75%}.col-sm-8{width:66.66666667%}.col-sm-7{width:58.33333333%}.col-sm-6{width:50%}.col-sm-5{width:41.66666667%}.col-sm-4{width:33.33333333%}.col-sm-3{width:25%}.col-sm-2{width:16.66666667%}.col-sm-1{width:8.33333333%}.col-sm-pull-12{right:100%}.col-sm-pull-11{right:91.66666667%}.col-sm-pull-10{right:83.33333333%}.col-sm-pull-9{right:75%}.col-sm-pull-8{right:66.66666667%}.col-sm-pull-7{right:58.33333333%}.col-sm-pull-6{right:50%}.col-sm-pull-5{right:41.66666667%}.col-sm-pull-4{right:33.33333333%}.col-sm-pull-3{right:25%}.col-sm-pull-2{right:16.66666667%}.col-sm-pull-1{right:8.33333333%}.col-sm-pull-0{right:auto}.col-sm-push-12{left:100%}.col-sm-push-11{left:91.66666667%}.col-sm-push-10{left:83.33333333%}.col-sm-push-9{left:75%}.col-sm-push-8{left:66.66666667%}.col-sm-push-7{left:58.33333333%}.col-sm-push-6{left:50%}.col-sm-push-5{left:41.66666667%}.col-sm-push-4{left:33.33333333%}.col-sm-push-3{left:25%}.col-sm-push-2{left:16.66666667%}.col-sm-push-1{left:8.33333333%}.col-sm-push-0{left:auto}.col-sm-offset-12{margin-left:100%}.col-sm-offset-11{margin-left:91.66666667%}.col-sm-offset-10{margin-left:83.33333333%}.col-sm-offset-9{margin-left:75%}.col-sm-offset-8{margin-left:66.66666667%}.col-sm-offset-7{margin-left:58.33333333%}.col-sm-offset-6{margin-left:50%}.col-sm-offset-5{margin-left:41.66666667%}.col-sm-offset-4{margin-left:33.33333333%}.col-sm-offset-3{margin-left:25%}.col-sm-offset-2{margin-left:16.66666667%}.col-sm-offset-1{margin-left:8.33333333%}.col-sm-offset-0{margin-left:0}}@media (min-width:992px){.col-md-1,.col-md-2,.col-md-3,.col-md-4,.col-md-5,.col-md-6,.col-md-7,.col-md-8,.col-md-9,.col-md-10,.col-md-11,.col-md-12{float:left}.col-md-12{width:100%}.col-md-11{width:91.66666667%}.col-md-10{width:83.33333333%}.col-md-9{width:75%}.col-md-8{width:66.66666667%}.col-md-7{width:58.33333333%}.col-md-6{width:50%}.col-md-5{width:41.66666667%}.col-md-4{width:33.33333333%}.col-md-3{width:25%}.col-md-2{width:16.66666667%}.col-md-1{width:8.33333333%}.col-md-pull-12{right:100%}.col-md-pull-11{right:91.66666667%}.col-md-pull-10{right:83.33333333%}.col-md-pull-9{right:75%}.col-md-pull-8{right:66.66666667%}.col-md-pull-7{right:58.33333333%}.col-md-pull-6{right:50%}.col-md-pull-5{right:41.66666667%}.col-md-pull-4{right:33.33333333%}.col-md-pull-3{right:25%}.col-md-pull-2{right:16.66666667%}.col-md-pull-1{right:8.33333333%}.col-md-pull-0{right:auto}.col-md-push-12{left:100%}.col-md-push-11{left:91.66666667%}.col-md-push-10{left:83.33333333%}.col-md-push-9{left:75%}.col-md-push-8{left:66.66666667%}.col-md-push-7{left:58.33333333%}.col-md-push-6{left:50%}.col-md-push-5{left:41.66666667%}.col-md-push-4{left:33.33333333%}.col-md-push-3{left:25%}.col-md-push-2{left:16.66666667%}.col-md-push-1{left:8.33333333%}.col-md-push-0{left:auto}.col-md-offset-12{margin-left:100%}.col-md-offset-11{margin-left:91.66666667%}.col-md-offset-10{margin-left:83.33333333%}.col-md-offset-9{margin-left:75%}.col-md-offset-8{margin-left:66.66666667%}.col-md-offset-7{margin-left:58.33333333%}.col-md-offset-6{margin-left:50%}.col-md-offset-5{margin-left:41.66666667%}.col-md-offset-4{margin-left:33.33333333%}.col-md-offset-3{margin-left:25%}.col-md-offset-2{margin-left:16.66666667%}.col-md-offset-1{margin-left:8.33333333%}.col-md-offset-0{margin-left:0}}@media (min-width:1200px){.col-lg-1,.col-lg-2,.col-lg-3,.col-lg-4,.col-lg-5,.col-lg-6,.col-lg-7,.col-lg-8,.col-lg-9,.col-lg-10,.col-lg-11,.col-lg-12{float:left}.col-lg-12{width:100%}.col-lg-11{width:91.66666667%}.col-lg-10{width:83.33333333%}.col-lg-9{width:75%}.col-lg-8{width:66.66666667%}.col-lg-7{width:58.33333333%}.col-lg-6{width:50%}.col-lg-5{width:41.66666667%}.col-lg-4{width:33.33333333%}.col-lg-3{width:25%}.col-lg-2{width:16.66666667%}.col-lg-1{width:8.33333333%}.col-lg-pull-12{right:100%}.col-lg-pull-11{right:91.66666667%}.col-lg-pull-10{right:83.33333333%}.col-lg-pull-9{right:75%}.col-lg-pull-8{right:66.66666667%}.col-lg-pull-7{right:58.33333333%}.col-lg-pull-6{right:50%}.col-lg-pull-5{right:41.66666667%}.col-lg-pull-4{right:33.33333333%}.col-lg-pull-3{right:25%}.col-lg-pull-2{right:16.66666667%}.col-lg-pull-1{right:8.33333333%}.col-lg-pull-0{right:auto}.col-lg-push-12{left:100%}.col-lg-push-11{left:91.66666667%}.col-lg-push-10{left:83.33333333%}.col-lg-push-9{left:75%}.col-lg-push-8{left:66.66666667%}.col-lg-push-7{left:58.33333333%}.col-lg-push-6{left:50%}.col-lg-push-5{left:41.66666667%}.col-lg-push-4{left:33.33333333%}.col-lg-push-3{left:25%}.col-lg-push-2{left:16.66666667%}.col-lg-push-1{left:8.33333333%}.col-lg-push-0{left:auto}.col-lg-offset-12{margin-left:100%}.col-lg-offset-11{margin-left:91.66666667%}.col-lg-offset-10{margin-left:83.33333333%}.col-lg-offset-9{margin-left:75%}.col-lg-offset-8{margin-left:66.66666667%}.col-lg-offset-7{margin-left:58.33333333%}.col-lg-offset-6{margin-left:50%}.col-lg-offset-5{margin-left:41.66666667%}.col-lg-offset-4{margin-left:33.33333333%}.col-lg-offset-3{margin-left:25%}.col-lg-offset-2{margin-left:16.66666667%}.col-lg-offset-1{margin-left:8.33333333%}.col-lg-offset-0{margin-left:0}}table{background-color:transparent}th{text-align:left}.table{width:100%;max-width:100%;margin-bottom:20px}.table>thead>tr>th,.table>tbody>tr>th,.table>tfoot>tr>th,.table>thead>tr>td,.table>tbody>tr>td,.table>tfoot>tr>td{padding:8px;line-height:1.42857143;vertical-align:top;border-top:1px solid #ddd}.table>thead>tr>th{vertical-align:bottom;border-bottom:2px solid #ddd}.table>caption+thead>tr:first-child>th,.table>colgroup+thead>tr:first-child>th,.table>thead:first-child>tr:first-child>th,.table>caption+thead>tr:first-child>td,.table>colgroup+thead>tr:first-child>td,.table>thead:first-child>tr:first-child>td{border-top:0}.table>tbody+tbody{border-top:2px solid #ddd}.table .table{background-color:#fff}.table-condensed>thead>tr>th,.table-condensed>tbody>tr>th,.table-condensed>tfoot>tr>th,.table-condensed>thead>tr>td,.table-condensed>tbody>tr>td,.table-condensed>tfoot>tr>td{padding:5px}.table-bordered{border:1px solid #ddd}.table-bordered>thead>tr>th,.table-bordered>tbody>tr>th,.table-bordered>tfoot>tr>th,.table-bordered>thead>tr>td,.table-bordered>tbody>tr>td,.table-bordered>tfoot>tr>td{border:1px solid #ddd}.table-bordered>thead>tr>th,.table-bordered>thead>tr>td{border-bottom-width:2px}.table-striped>tbody>tr:nth-child(odd)>td,.table-striped>tbody>tr:nth-child(odd)>th{background-color:#f9f9f9}.table-hover>tbody>tr:hover>td,.table-hover>tbody>tr:hover>th{background-color:#f5f5f5}table col[class*=col-]{position:static;display:table-column;float:none}table td[class*=col-],table th[class*=col-]{position:static;display:table-cell;float:none}.table>thead>tr>td.active,.table>tbody>tr>td.active,.table>tfoot>tr>td.active,.table>thead>tr>th.active,.table>tbody>tr>th.active,.table>tfoot>tr>th.active,.table>thead>tr.active>td,.table>tbody>tr.active>td,.table>tfoot>tr.active>td,.table>thead>tr.active>th,.table>tbody>tr.active>th,.table>tfoot>tr.active>th{background-color:#f5f5f5}.table-hover>tbody>tr>td.active:hover,.table-hover>tbody>tr>th.active:hover,.table-hover>tbody>tr.active:hover>td,.table-hover>tbody>tr:hover>.active,.table-hover>tbody>tr.active:hover>th{background-color:#e8e8e8}.table>thead>tr>td.success,.table>tbody>tr>td.success,.table>tfoot>tr>td.success,.table>thead>tr>th.success,.table>tbody>tr>th.success,.table>tfoot>tr>th.success,.table>thead>tr.success>td,.table>tbody>tr.success>td,.table>tfoot>tr.success>td,.table>thead>tr.success>th,.table>tbody>tr.success>th,.table>tfoot>tr.success>th{background-color:#dff0d8}.table-hover>tbody>tr>td.success:hover,.table-hover>tbody>tr>th.success:hover,.table-hover>tbody>tr.success:hover>td,.table-hover>tbody>tr:hover>.success,.table-hover>tbody>tr.success:hover>th{background-color:#d0e9c6}.table>thead>tr>td.info,.table>tbody>tr>td.info,.table>tfoot>tr>td.info,.table>thead>tr>th.info,.table>tbody>tr>th.info,.table>tfoot>tr>th.info,.table>thead>tr.info>td,.table>tbody>tr.info>td,.table>tfoot>tr.info>td,.table>thead>tr.info>th,.table>tbody>tr.info>th,.table>tfoot>tr.info>th{background-color:#d9edf7}.table-hover>tbody>tr>td.info:hover,.table-hover>tbody>tr>th.info:hover,.table-hover>tbody>tr.info:hover>td,.table-hover>tbody>tr:hover>.info,.table-hover>tbody>tr.info:hover>th{background-color:#c4e3f3}.table>thead>tr>td.warning,.table>tbody>tr>td.warning,.table>tfoot>tr>td.warning,.table>thead>tr>th.warning,.table>tbody>tr>th.warning,.table>tfoot>tr>th.warning,.table>thead>tr.warning>td,.table>tbody>tr.warning>td,.table>tfoot>tr.warning>td,.table>thead>tr.warning>th,.table>tbody>tr.warning>th,.table>tfoot>tr.warning>th{background-color:#fcf8e3}.table-hover>tbody>tr>td.warning:hover,.table-hover>tbody>tr>th.warning:hover,.table-hover>tbody>tr.warning:hover>td,.table-hover>tbody>tr:hover>.warning,.table-hover>tbody>tr.warning:hover>th{background-color:#faf2cc}.table>thead>tr>td.danger,.table>tbody>tr>td.danger,.table>tfoot>tr>td.danger,.table>thead>tr>th.danger,.table>tbody>tr>th.danger,.table>tfoot>tr>th.danger,.table>thead>tr.danger>td,.table>tbody>tr.danger>td,.table>tfoot>tr.danger>td,.table>thead>tr.danger>th,.table>tbody>tr.danger>th,.table>tfoot>tr.danger>th{background-color:#f2dede}.table-hover>tbody>tr>td.danger:hover,.table-hover>tbody>tr>th.danger:hover,.table-hover>tbody>tr.danger:hover>td,.table-hover>tbody>tr:hover>.danger,.table-hover>tbody>tr.danger:hover>th{background-color:#ebcccc}@media screen and (max-width:767px){.table-responsive{width:100%;margin-bottom:15px;overflow-x:auto;overflow-y:hidden;-webkit-overflow-scrolling:touch;-ms-overflow-style:-ms-autohiding-scrollbar;border:1px solid #ddd}.table-responsive>.table{margin-bottom:0}.table-responsive>.table>thead>tr>th,.table-responsive>.table>tbody>tr>th,.table-responsive>.table>tfoot>tr>th,.table-responsive>.table>thead>tr>td,.table-responsive>.table>tbody>tr>td,.table-responsive>.table>tfoot>tr>td{white-space:nowrap}.table-responsive>.table-bordered{border:0}.table-responsive>.table-bordered>thead>tr>th:first-child,.table-responsive>.table-bordered>tbody>tr>th:first-child,.table-responsive>.table-bordered>tfoot>tr>th:first-child,.table-responsive>.table-bordered>thead>tr>td:first-child,.table-responsive>.table-bordered>tbody>tr>td:first-child,.table-responsive>.table-bordered>tfoot>tr>td:first-child{border-left:0}.table-responsive>.table-bordered>thead>tr>th:last-child,.table-responsive>.table-bordered>tbody>tr>th:last-child,.table-responsive>.table-bordered>tfoot>tr>th:last-child,.table-responsive>.table-bordered>thead>tr>td:last-child,.table-responsive>.table-bordered>tbody>tr>td:last-child,.table-responsive>.table-bordered>tfoot>tr>td:last-child{border-right:0}.table-responsive>.table-bordered>tbody>tr:last-child>th,.table-responsive>.table-bordered>tfoot>tr:last-child>th,.table-responsive>.table-bordered>tbody>tr:last-child>td,.table-responsive>.table-bordered>tfoot>tr:last-child>td{border-bottom:0}}fieldset{min-width:0;padding:0;margin:0;border:0}legend{display:block;width:100%;padding:0;margin-bottom:20px;font-size:21px;line-height:inherit;color:#333;border:0;border-bottom:1px solid #e5e5e5}label{display:inline-block;max-width:100%;margin-bottom:5px;font-weight:700}input[type=search]{-webkit-box-sizing:border-box;-moz-box-sizing:border-box;box-sizing:border-box}input[type=radio],input[type=checkbox]{margin:4px 0 0;margin-top:1px \9;line-height:normal}input[type=file]{display:block}input[type=range]{display:block;width:100%}select[multiple],select[size]{height:auto}input[type=file]:focus,input[type=radio]:focus,input[type=checkbox]:focus{outline:thin dotted;outline:5px auto -webkit-focus-ring-color;outline-offset:-2px}output{display:block;padding-top:7px;font-size:14px;line-height:1.42857143;color:#555}.form-control{display:block;width:100%;height:34px;padding:6px 12px;font-size:14px;line-height:1.42857143;color:#555;background-color:#fff;background-image:none;border:1px solid #ccc;border-radius:4px;-webkit-box-shadow:inset 0 1px 1px rgba(0,0,0,.075);box-shadow:inset 0 1px 1px rgba(0,0,0,.075);-webkit-transition:border-color ease-in-out .15s,-webkit-box-shadow ease-in-out .15s;-o-transition:border-color ease-in-out .15s,box-shadow ease-in-out .15s;transition:border-color ease-in-out .15s,box-shadow ease-in-out .15s}.form-control:focus{border-color:#66afe9;outline:0;-webkit-box-shadow:inset 0 1px 1px rgba(0,0,0,.075),0 0 8px rgba(102,175,233,.6);box-shadow:inset 0 1px 1px rgba(0,0,0,.075),0 0 8px rgba(102,175,233,.6)}.form-control::-moz-placeholder{color:#777;opacity:1}.form-control:-ms-input-placeholder{color:#777}.form-control::-webkit-input-placeholder{color:#777}.form-control[disabled],.form-control[readonly],fieldset[disabled] .form-control{cursor:not-allowed;background-color:#eee;opacity:1}textarea.form-control{height:auto}input[type=search]{-webkit-appearance:none}input[type=date],input[type=time],input[type=datetime-local],input[type=month]{line-height:34px;line-height:1.42857143 \0}input[type=date].input-sm,input[type=time].input-sm,input[type=datetime-local].input-sm,input[type=month].input-sm{line-height:30px}input[type=date].input-lg,input[type=time].input-lg,input[type=datetime-local].input-lg,input[type=month].input-lg{line-height:46px}.form-group{margin-bottom:15px}.radio,.checkbox{position:relative;display:block;min-height:20px;margin-top:10px;margin-bottom:10px}.radio label,.checkbox label{padding-left:20px;margin-bottom:0;font-weight:400;cursor:pointer}.radio input[type=radio],.radio-inline input[type=radio],.checkbox input[type=checkbox],.checkbox-inline input[type=checkbox]{position:absolute;margin-top:4px \9;margin-left:-20px}.radio+.radio,.checkbox+.checkbox{margin-top:-5px}.radio-inline,.checkbox-inline{display:inline-block;padding-left:20px;margin-bottom:0;font-weight:400;vertical-align:middle;cursor:pointer}.radio-inline+.radio-inline,.checkbox-inline+.checkbox-inline{margin-top:0;margin-left:10px}input[type=radio][disabled],input[type=checkbox][disabled],input[type=radio].disabled,input[type=checkbox].disabled,fieldset[disabled] input[type=radio],fieldset[disabled] input[type=checkbox]{cursor:not-allowed}.radio-inline.disabled,.checkbox-inline.disabled,fieldset[disabled] .radio-inline,fieldset[disabled] .checkbox-inline{cursor:not-allowed}.radio.disabled label,.checkbox.disabled label,fieldset[disabled] .radio label,fieldset[disabled] .checkbox label{cursor:not-allowed}.form-control-static{padding-top:7px;padding-bottom:7px;margin-bottom:0}.form-control-static.input-lg,.form-control-static.input-sm{padding-right:0;padding-left:0}.input-sm,.form-horizontal .form-group-sm .form-control{height:30px;padding:5px 10px;font-size:12px;line-height:1.5;border-radius:3px}select.input-sm{height:30px;line-height:30px}textarea.input-sm,select[multiple].input-sm{height:auto}.input-lg,.form-horizontal .form-group-lg .form-control{height:46px;padding:10px 16px;font-size:18px;line-height:1.33;border-radius:6px}select.input-lg{height:46px;line-height:46px}textarea.input-lg,select[multiple].input-lg{height:auto}.has-feedback{position:relative}.has-feedback .form-control{padding-right:42.5px}.form-control-feedback{position:absolute;top:25px;right:0;z-index:2;display:block;width:34px;height:34px;line-height:34px;text-align:center}.input-lg+.form-control-feedback{width:46px;height:46px;line-height:46px}.input-sm+.form-control-feedback{width:30px;height:30px;line-height:30px}.has-success .help-block,.has-success .control-label,.has-success .radio,.has-success .checkbox,.has-success .radio-inline,.has-success .checkbox-inline{color:#3c763d}.has-success .form-control{border-color:#3c763d;-webkit-box-shadow:inset 0 1px 1px rgba(0,0,0,.075);box-shadow:inset 0 1px 1px rgba(0,0,0,.075)}.has-success .form-control:focus{border-color:#2b542c;-webkit-box-shadow:inset 0 1px 1px rgba(0,0,0,.075),0 0 6px #67b168;box-shadow:inset 0 1px 1px rgba(0,0,0,.075),0 0 6px #67b168}.has-success .input-group-addon{color:#3c763d;background-color:#dff0d8;border-color:#3c763d}.has-success .form-control-feedback{color:#3c763d}.has-warning .help-block,.has-warning .control-label,.has-warning .radio,.has-warning .checkbox,.has-warning .radio-inline,.has-warning .checkbox-inline{color:#8a6d3b}.has-warning .form-control{border-color:#8a6d3b;-webkit-box-shadow:inset 0 1px 1px rgba(0,0,0,.075);box-shadow:inset 0 1px 1px rgba(0,0,0,.075)}.has-warning .form-control:focus{border-color:#66512c;-webkit-box-shadow:inset 0 1px 1px rgba(0,0,0,.075),0 0 6px #c0a16b;box-shadow:inset 0 1px 1px rgba(0,0,0,.075),0 0 6px #c0a16b}.has-warning .input-group-addon{color:#8a6d3b;background-color:#fcf8e3;border-color:#8a6d3b}.has-warning .form-control-feedback{color:#8a6d3b}.has-error .help-block,.has-error .control-label,.has-error .radio,.has-error .checkbox,.has-error .radio-inline,.has-error .checkbox-inline{color:#a94442}.has-error .form-control{border-color:#a94442;-webkit-box-shadow:inset 0 1px 1px rgba(0,0,0,.075);box-shadow:inset 0 1px 1px rgba(0,0,0,.075)}.has-error .form-control:focus{border-color:#843534;-webkit-box-shadow:inset 0 1px 1px rgba(0,0,0,.075),0 0 6px #ce8483;box-shadow:inset 0 1px 1px rgba(0,0,0,.075),0 0 6px #ce8483}.has-error .input-group-addon{color:#a94442;background-color:#f2dede;border-color:#a94442}.has-error .form-control-feedback{color:#a94442}.has-feedback label.sr-only~.form-control-feedback{top:0}.help-block{display:block;margin-top:5px;margin-bottom:10px;color:#737373}@media (min-width:768px){.form-inline .form-group{display:inline-block;margin-bottom:0;vertical-align:middle}.form-inline .form-control{display:inline-block;width:auto;vertical-align:middle}.form-inline .input-group{display:inline-table;vertical-align:middle}.form-inline .input-group .input-group-addon,.form-inline .input-group .input-group-btn,.form-inline .input-group .form-control{width:auto}.form-inline .input-group>.form-control{width:100%}.form-inline .control-label{margin-bottom:0;vertical-align:middle}.form-inline .radio,.form-inline .checkbox{display:inline-block;margin-top:0;margin-bottom:0;vertical-align:middle}.form-inline .radio label,.form-inline .checkbox label{padding-left:0}.form-inline .radio input[type=radio],.form-inline .checkbox input[type=checkbox]{position:relative;margin-left:0}.form-inline .has-feedback .form-control-feedback{top:0}}.form-horizontal .radio,.form-horizontal .checkbox,.form-horizontal .radio-inline,.form-horizontal .checkbox-inline{padding-top:7px;margin-top:0;margin-bottom:0}.form-horizontal .radio,.form-horizontal .checkbox{min-height:27px}.form-horizontal .form-group{margin-right:-15px;margin-left:-15px}@media (min-width:768px){.form-horizontal .control-label{padding-top:7px;margin-bottom:0;text-align:right}}.form-horizontal .has-feedback .form-control-feedback{top:0;right:15px}@media (min-width:768px){.form-horizontal .form-group-lg .control-label{padding-top:14.3px}}@media (min-width:768px){.form-horizontal .form-group-sm .control-label{padding-top:6px}}.btn{display:inline-block;padding:6px 12px;margin-bottom:0;font-size:14px;font-weight:400;line-height:1.42857143;text-align:center;white-space:nowrap;vertical-align:middle;cursor:pointer;-webkit-user-select:none;-moz-user-select:none;-ms-user-select:none;user-select:none;background-image:none;border:1px solid transparent;border-radius:4px}.btn:focus,.btn:active:focus,.btn.active:focus{outline:thin dotted;outline:5px auto -webkit-focus-ring-color;outline-offset:-2px}.btn:hover,.btn:focus{color:#333;text-decoration:none}.btn:active,.btn.active{background-image:none;outline:0;-webkit-box-shadow:inset 0 3px 5px rgba(0,0,0,.125);box-shadow:inset 0 3px 5px rgba(0,0,0,.125)}.btn.disabled,.btn[disabled],fieldset[disabled] .btn{pointer-events:none;cursor:not-allowed;filter:alpha(opacity=65);-webkit-box-shadow:none;box-shadow:none;opacity:.65}.btn-default{color:#333;background-color:#fff;border-color:#ccc}.btn-default:hover,.btn-default:focus,.btn-default:active,.btn-default.active,.open>.dropdown-toggle.btn-default{color:#333;background-color:#e6e6e6;border-color:#adadad}.btn-default:active,.btn-default.active,.open>.dropdown-toggle.btn-default{background-image:none}.btn-default.disabled,.btn-default[disabled],fieldset[disabled] .btn-default,.btn-default.disabled:hover,.btn-default[disabled]:hover,fieldset[disabled] .btn-default:hover,.btn-default.disabled:focus,.btn-default[disabled]:focus,fieldset[disabled] .btn-default:focus,.btn-default.disabled:active,.btn-default[disabled]:active,fieldset[disabled] .btn-default:active,.btn-default.disabled.active,.btn-default[disabled].active,fieldset[disabled] .btn-default.active{background-color:#fff;border-color:#ccc}.btn-default .badge{color:#fff;background-color:#333}.btn-primary{color:#fff;background-color:#428bca;border-color:#357ebd}.btn-primary:hover,.btn-primary:focus,.btn-primary:active,.btn-primary.active,.open>.dropdown-toggle.btn-primary{color:#fff;background-color:#3071a9;border-color:#285e8e}.btn-primary:active,.btn-primary.active,.open>.dropdown-toggle.btn-primary{background-image:none}.btn-primary.disabled,.btn-primary[disabled],fieldset[disabled] .btn-primary,.btn-primary.disabled:hover,.btn-primary[disabled]:hover,fieldset[disabled] .btn-primary:hover,.btn-primary.disabled:focus,.btn-primary[disabled]:focus,fieldset[disabled] .btn-primary:focus,.btn-primary.disabled:active,.btn-primary[disabled]:active,fieldset[disabled] .btn-primary:active,.btn-primary.disabled.active,.btn-primary[disabled].active,fieldset[disabled] .btn-primary.active{background-color:#428bca;border-color:#357ebd}.btn-primary .badge{color:#428bca;background-color:#fff}.btn-success{color:#fff;background-color:#5cb85c;border-color:#4cae4c}.btn-success:hover,.btn-success:focus,.btn-success:active,.btn-success.active,.open>.dropdown-toggle.btn-success{color:#fff;background-color:#449d44;border-color:#398439}.btn-success:active,.btn-success.active,.open>.dropdown-toggle.btn-success{background-image:none}.btn-success.disabled,.btn-success[disabled],fieldset[disabled] .btn-success,.btn-success.disabled:hover,.btn-success[disabled]:hover,fieldset[disabled] .btn-success:hover,.btn-success.disabled:focus,.btn-success[disabled]:focus,fieldset[disabled] .btn-success:focus,.btn-success.disabled:active,.btn-success[disabled]:active,fieldset[disabled] .btn-success:active,.btn-success.disabled.active,.btn-success[disabled].active,fieldset[disabled] .btn-success.active{background-color:#5cb85c;border-color:#4cae4c}.btn-success .badge{color:#5cb85c;background-color:#fff}.btn-info{color:#fff;background-color:#5bc0de;border-color:#46b8da}.btn-info:hover,.btn-info:focus,.btn-info:active,.btn-info.active,.open>.dropdown-toggle.btn-info{color:#fff;background-color:#31b0d5;border-color:#269abc}.btn-info:active,.btn-info.active,.open>.dropdown-toggle.btn-info{background-image:none}.btn-info.disabled,.btn-info[disabled],fieldset[disabled] .btn-info,.btn-info.disabled:hover,.btn-info[disabled]:hover,fieldset[disabled] .btn-info:hover,.btn-info.disabled:focus,.btn-info[disabled]:focus,fieldset[disabled] .btn-info:focus,.btn-info.disabled:active,.btn-info[disabled]:active,fieldset[disabled] .btn-info:active,.btn-info.disabled.active,.btn-info[disabled].active,fieldset[disabled] .btn-info.active{background-color:#5bc0de;border-color:#46b8da}.btn-info .badge{color:#5bc0de;background-color:#fff}.btn-warning{color:#fff;background-color:#f0ad4e;border-color:#eea236}.btn-warning:hover,.btn-warning:focus,.btn-warning:active,.btn-warning.active,.open>.dropdown-toggle.btn-warning{color:#fff;background-color:#ec971f;border-color:#d58512}.btn-warning:active,.btn-warning.active,.open>.dropdown-toggle.btn-warning{background-image:none}.btn-warning.disabled,.btn-warning[disabled],fieldset[disabled] .btn-warning,.btn-warning.disabled:hover,.btn-warning[disabled]:hover,fieldset[disabled] .btn-warning:hover,.btn-warning.disabled:focus,.btn-warning[disabled]:focus,fieldset[disabled] .btn-warning:focus,.btn-warning.disabled:active,.btn-warning[disabled]:active,fieldset[disabled] .btn-warning:active,.btn-warning.disabled.active,.btn-warning[disabled].active,fieldset[disabled] .btn-warning.active{background-color:#f0ad4e;border-color:#eea236}.btn-warning .badge{color:#f0ad4e;background-color:#fff}.btn-danger{color:#fff;background-color:#d9534f;border-color:#d43f3a}.btn-danger:hover,.btn-danger:focus,.btn-danger:active,.btn-danger.active,.open>.dropdown-toggle.btn-danger{color:#fff;background-color:#c9302c;border-color:#ac2925}.btn-danger:active,.btn-danger.active,.open>.dropdown-toggle.btn-danger{background-image:none}.btn-danger.disabled,.btn-danger[disabled],fieldset[disabled] .btn-danger,.btn-danger.disabled:hover,.btn-danger[disabled]:hover,fieldset[disabled] .btn-danger:hover,.btn-danger.disabled:focus,.btn-danger[disabled]:focus,fieldset[disabled] .btn-danger:focus,.btn-danger.disabled:active,.btn-danger[disabled]:active,fieldset[disabled] .btn-danger:active,.btn-danger.disabled.active,.btn-danger[disabled].active,fieldset[disabled] .btn-danger.active{background-color:#d9534f;border-color:#d43f3a}.btn-danger .badge{color:#d9534f;background-color:#fff}.btn-link{font-weight:400;color:#428bca;cursor:pointer;border-radius:0}.btn-link,.btn-link:active,.btn-link[disabled],fieldset[disabled] .btn-link{background-color:transparent;-webkit-box-shadow:none;box-shadow:none}.btn-link,.btn-link:hover,.btn-link:focus,.btn-link:active{border-color:transparent}.btn-link:hover,.btn-link:focus{color:#2a6496;text-decoration:underline;background-color:transparent}.btn-link[disabled]:hover,fieldset[disabled] .btn-link:hover,.btn-link[disabled]:focus,fieldset[disabled] .btn-link:focus{color:#777;text-decoration:none}.btn-lg,.btn-group-lg>.btn{padding:10px 16px;font-size:18px;line-height:1.33;border-radius:6px}.btn-sm,.btn-group-sm>.btn{padding:5px 10px;font-size:12px;line-height:1.5;border-radius:3px}.btn-xs,.btn-group-xs>.btn{padding:1px 5px;font-size:12px;line-height:1.5;border-radius:3px}.btn-block{display:block;width:100%}.btn-block+.btn-block{margin-top:5px}input[type=submit].btn-block,input[type=reset].btn-block,input[type=button].btn-block{width:100%}.fade{opacity:0;-webkit-transition:opacity .15s linear;-o-transition:opacity .15s linear;transition:opacity .15s linear}.fade.in{opacity:1}.collapse{display:none}.collapse.in{display:block}tr.collapse.in{display:table-row}tbody.collapse.in{display:table-row-group}.collapsing{position:relative;height:0;overflow:hidden;-webkit-transition:height .35s ease;-o-transition:height .35s ease;transition:height .35s ease}.caret{display:inline-block;width:0;height:0;margin-left:2px;vertical-align:middle;border-top:4px solid;border-right:4px solid transparent;border-left:4px solid transparent}.dropdown{position:relative}.dropdown-toggle:focus{outline:0}.dropdown-menu{position:absolute;top:100%;left:0;z-index:1000;display:none;float:left;min-width:160px;padding:5px 0;margin:2px 0 0;font-size:14px;text-align:left;list-style:none;background-color:#fff;-webkit-background-clip:padding-box;background-clip:padding-box;border:1px solid #ccc;border:1px solid rgba(0,0,0,.15);border-radius:4px;-webkit-box-shadow:0 6px 12px rgba(0,0,0,.175);box-shadow:0 6px 12px rgba(0,0,0,.175)}.dropdown-menu.pull-right{right:0;left:auto}.dropdown-menu .divider{height:1px;margin:9px 0;overflow:hidden;background-color:#e5e5e5}.dropdown-menu>li>a{display:block;padding:3px 20px;clear:both;font-weight:400;line-height:1.42857143;color:#333;white-space:nowrap}.dropdown-menu>li>a:hover,.dropdown-menu>li>a:focus{color:#262626;text-decoration:none;background-color:#f5f5f5}.dropdown-menu>.active>a,.dropdown-menu>.active>a:hover,.dropdown-menu>.active>a:focus{color:#fff;text-decoration:none;background-color:#428bca;outline:0}.dropdown-menu>.disabled>a,.dropdown-menu>.disabled>a:hover,.dropdown-menu>.disabled>a:focus{color:#777}.dropdown-menu>.disabled>a:hover,.dropdown-menu>.disabled>a:focus{text-decoration:none;cursor:not-allowed;background-color:transparent;background-image:none;filter:progid:DXImageTransform.Microsoft.gradient(enabled=false)}.open>.dropdown-menu{display:block}.open>a{outline:0}.dropdown-menu-right{right:0;left:auto}.dropdown-menu-left{right:auto;left:0}.dropdown-header{display:block;padding:3px 20px;font-size:12px;line-height:1.42857143;color:#777;white-space:nowrap}.dropdown-backdrop{position:fixed;top:0;right:0;bottom:0;left:0;z-index:990}.pull-right>.dropdown-menu{right:0;left:auto}.dropup .caret,.navbar-fixed-bottom .dropdown .caret{content:"";border-top:0;border-bottom:4px solid}.dropup .dropdown-menu,.navbar-fixed-bottom .dropdown .dropdown-menu{top:auto;bottom:100%;margin-bottom:1px}@media (min-width:768px){.navbar-right .dropdown-menu{right:0;left:auto}.navbar-right .dropdown-menu-left{right:auto;left:0}}.btn-group,.btn-group-vertical{position:relative;display:inline-block;vertical-align:middle}.btn-group>.btn,.btn-group-vertical>.btn{position:relative;float:left}.btn-group>.btn:hover,.btn-group-vertical>.btn:hover,.btn-group>.btn:focus,.btn-group-vertical>.btn:focus,.btn-group>.btn:active,.btn-group-vertical>.btn:active,.btn-group>.btn.active,.btn-group-vertical>.btn.active{z-index:2}.btn-group>.btn:focus,.btn-group-vertical>.btn:focus{outline:0}.btn-group .btn+.btn,.btn-group .btn+.btn-group,.btn-group .btn-group+.btn,.btn-group .btn-group+.btn-group{margin-left:-1px}.btn-toolbar{margin-left:-5px}.btn-toolbar .btn-group,.btn-toolbar .input-group{float:left}.btn-toolbar>.btn,.btn-toolbar>.btn-group,.btn-toolbar>.input-group{margin-left:5px}.btn-group>.btn:not(:first-child):not(:last-child):not(.dropdown-toggle){border-radius:0}.btn-group>.btn:first-child{margin-left:0}.btn-group>.btn:first-child:not(:last-child):not(.dropdown-toggle){border-top-right-radius:0;border-bottom-right-radius:0}.btn-group>.btn:last-child:not(:first-child),.btn-group>.dropdown-toggle:not(:first-child){border-top-left-radius:0;border-bottom-left-radius:0}.btn-group>.btn-group{float:left}.btn-group>.btn-group:not(:first-child):not(:last-child)>.btn{border-radius:0}.btn-group>.btn-group:first-child>.btn:last-child,.btn-group>.btn-group:first-child>.dropdown-toggle{border-top-right-radius:0;border-bottom-right-radius:0}.btn-group>.btn-group:last-child>.btn:first-child{border-top-left-radius:0;border-bottom-left-radius:0}.btn-group .dropdown-toggle:active,.btn-group.open .dropdown-toggle{outline:0}.btn-group>.btn+.dropdown-toggle{padding-right:8px;padding-left:8px}.btn-group>.btn-lg+.dropdown-toggle{padding-right:12px;padding-left:12px}.btn-group.open .dropdown-toggle{-webkit-box-shadow:inset 0 3px 5px rgba(0,0,0,.125);box-shadow:inset 0 3px 5px rgba(0,0,0,.125)}.btn-group.open .dropdown-toggle.btn-link{-webkit-box-shadow:none;box-shadow:none}.btn .caret{margin-left:0}.btn-lg .caret{border-width:5px 5px 0;border-bottom-width:0}.dropup .btn-lg .caret{border-width:0 5px 5px}.btn-group-vertical>.btn,.btn-group-vertical>.btn-group,.btn-group-vertical>.btn-group>.btn{display:block;float:none;width:100%;max-width:100%}.btn-group-vertical>.btn-group>.btn{float:none}.btn-group-vertical>.btn+.btn,.btn-group-vertical>.btn+.btn-group,.btn-group-vertical>.btn-group+.btn,.btn-group-vertical>.btn-group+.btn-group{margin-top:-1px;margin-left:0}.btn-group-vertical>.btn:not(:first-child):not(:last-child){border-radius:0}.btn-group-vertical>.btn:first-child:not(:last-child){border-top-right-radius:4px;border-bottom-right-radius:0;border-bottom-left-radius:0}.btn-group-vertical>.btn:last-child:not(:first-child){border-top-left-radius:0;border-top-right-radius:0;border-bottom-left-radius:4px}.btn-group-vertical>.btn-group:not(:first-child):not(:last-child)>.btn{border-radius:0}.btn-group-vertical>.btn-group:first-child:not(:last-child)>.btn:last-child,.btn-group-vertical>.btn-group:first-child:not(:last-child)>.dropdown-toggle{border-bottom-right-radius:0;border-bottom-left-radius:0}.btn-group-vertical>.btn-group:last-child:not(:first-child)>.btn:first-child{border-top-left-radius:0;border-top-right-radius:0}.btn-group-justified{display:table;width:100%;table-layout:fixed;border-collapse:separate}.btn-group-justified>.btn,.btn-group-justified>.btn-group{display:table-cell;float:none;width:1%}.btn-group-justified>.btn-group .btn{width:100%}.btn-group-justified>.btn-group .dropdown-menu{left:auto}[data-toggle=buttons]>.btn>input[type=radio],[data-toggle=buttons]>.btn>input[type=checkbox]{position:absolute;z-index:-1;filter:alpha(opacity=0);opacity:0}.input-group{position:relative;display:table;border-collapse:separate}.input-group[class*=col-]{float:none;padding-right:0;padding-left:0}.input-group .form-control{position:relative;z-index:2;float:left;width:100%;margin-bottom:0}.input-group-lg>.form-control,.input-group-lg>.input-group-addon,.input-group-lg>.input-group-btn>.btn{height:46px;padding:10px 16px;font-size:18px;line-height:1.33;border-radius:6px}select.input-group-lg>.form-control,select.input-group-lg>.input-group-addon,select.input-group-lg>.input-group-btn>.btn{height:46px;line-height:46px}textarea.input-group-lg>.form-control,textarea.input-group-lg>.input-group-addon,textarea.input-group-lg>.input-group-btn>.btn,select[multiple].input-group-lg>.form-control,select[multiple].input-group-lg>.input-group-addon,select[multiple].input-group-lg>.input-group-btn>.btn{height:auto}.input-group-sm>.form-control,.input-group-sm>.input-group-addon,.input-group-sm>.input-group-btn>.btn{height:30px;padding:5px 10px;font-size:12px;line-height:1.5;border-radius:3px}select.input-group-sm>.form-control,select.input-group-sm>.input-group-addon,select.input-group-sm>.input-group-btn>.btn{height:30px;line-height:30px}textarea.input-group-sm>.form-control,textarea.input-group-sm>.input-group-addon,textarea.input-group-sm>.input-group-btn>.btn,select[multiple].input-group-sm>.form-control,select[multiple].input-group-sm>.input-group-addon,select[multiple].input-group-sm>.input-group-btn>.btn{height:auto}.input-group-addon,.input-group-btn,.input-group .form-control{display:table-cell}.input-group-addon:not(:first-child):not(:last-child),.input-group-btn:not(:first-child):not(:last-child),.input-group .form-control:not(:first-child):not(:last-child){border-radius:0}.input-group-addon,.input-group-btn{width:1%;white-space:nowrap;vertical-align:middle}.input-group-addon{padding:6px 12px;font-size:14px;font-weight:400;line-height:1;color:#555;text-align:center;background-color:#eee;border:1px solid #ccc;border-radius:4px}.input-group-addon.input-sm{padding:5px 10px;font-size:12px;border-radius:3px}.input-group-addon.input-lg{padding:10px 16px;font-size:18px;border-radius:6px}.input-group-addon input[type=radio],.input-group-addon input[type=checkbox]{margin-top:0}.input-group .form-control:first-child,.input-group-addon:first-child,.input-group-btn:first-child>.btn,.input-group-btn:first-child>.btn-group>.btn,.input-group-btn:first-child>.dropdown-toggle,.input-group-btn:last-child>.btn:not(:last-child):not(.dropdown-toggle),.input-group-btn:last-child>.btn-group:not(:last-child)>.btn{border-top-right-radius:0;border-bottom-right-radius:0}.input-group-addon:first-child{border-right:0}.input-group .form-control:last-child,.input-group-addon:last-child,.input-group-btn:last-child>.btn,.input-group-btn:last-child>.btn-group>.btn,.input-group-btn:last-child>.dropdown-toggle,.input-group-btn:first-child>.btn:not(:first-child),.input-group-btn:first-child>.btn-group:not(:first-child)>.btn{border-top-left-radius:0;border-bottom-left-radius:0}.input-group-addon:last-child{border-left:0}.input-group-btn{position:relative;font-size:0;white-space:nowrap}.input-group-btn>.btn{position:relative}.input-group-btn>.btn+.btn{margin-left:-1px}.input-group-btn>.btn:hover,.input-group-btn>.btn:focus,.input-group-btn>.btn:active{z-index:2}.input-group-btn:first-child>.btn,.input-group-btn:first-child>.btn-group{margin-right:-1px}.input-group-btn:last-child>.btn,.input-group-btn:last-child>.btn-group{margin-left:-1px}.nav{padding-left:0;margin-bottom:0;list-style:none}.nav>li{position:relative;display:block}.nav>li>a{position:relative;display:block;padding:10px 15px}.nav>li>a:hover,.nav>li>a:focus{text-decoration:none;background-color:#eee}.nav>li.disabled>a{color:#777}.nav>li.disabled>a:hover,.nav>li.disabled>a:focus{color:#777;text-decoration:none;cursor:not-allowed;background-color:transparent}.nav .open>a,.nav .open>a:hover,.nav .open>a:focus{background-color:#eee;border-color:#428bca}.nav .nav-divider{height:1px;margin:9px 0;overflow:hidden;background-color:#e5e5e5}.nav>li>a>img{max-width:none}.nav-tabs{border-bottom:1px solid #ddd}.nav-tabs>li{float:left;margin-bottom:-1px}.nav-tabs>li>a{margin-right:2px;line-height:1.42857143;border:1px solid transparent;border-radius:4px 4px 0 0}.nav-tabs>li>a:hover{border-color:#eee #eee #ddd}.nav-tabs>li.active>a,.nav-tabs>li.active>a:hover,.nav-tabs>li.active>a:focus{color:#555;cursor:default;background-color:#fff;border:1px solid #ddd;border-bottom-color:transparent}.nav-tabs.nav-justified{width:100%;border-bottom:0}.nav-tabs.nav-justified>li{float:none}.nav-tabs.nav-justified>li>a{margin-bottom:5px;text-align:center}.nav-tabs.nav-justified>.dropdown .dropdown-menu{top:auto;left:auto}@media (min-width:768px){.nav-tabs.nav-justified>li{display:table-cell;width:1%}.nav-tabs.nav-justified>li>a{margin-bottom:0}}.nav-tabs.nav-justified>li>a{margin-right:0;border-radius:4px}.nav-tabs.nav-justified>.active>a,.nav-tabs.nav-justified>.active>a:hover,.nav-tabs.nav-justified>.active>a:focus{border:1px solid #ddd}@media (min-width:768px){.nav-tabs.nav-justified>li>a{border-bottom:1px solid #ddd;border-radius:4px 4px 0 0}.nav-tabs.nav-justified>.active>a,.nav-tabs.nav-justified>.active>a:hover,.nav-tabs.nav-justified>.active>a:focus{border-bottom-color:#fff}}.nav-pills>li{float:left}.nav-pills>li>a{border-radius:4px}.nav-pills>li+li{margin-left:2px}.nav-pills>li.active>a,.nav-pills>li.active>a:hover,.nav-pills>li.active>a:focus{color:#fff;background-color:#428bca}.nav-stacked>li{float:none}.nav-stacked>li+li{margin-top:2px;margin-left:0}.nav-justified{width:100%}.nav-justified>li{float:none}.nav-justified>li>a{margin-bottom:5px;text-align:center}.nav-justified>.dropdown .dropdown-menu{top:auto;left:auto}@media (min-width:768px){.nav-justified>li{display:table-cell;width:1%}.nav-justified>li>a{margin-bottom:0}}.nav-tabs-justified{border-bottom:0}.nav-tabs-justified>li>a{margin-right:0;border-radius:4px}.nav-tabs-justified>.active>a,.nav-tabs-justified>.active>a:hover,.nav-tabs-justified>.active>a:focus{border:1px solid #ddd}@media (min-width:768px){.nav-tabs-justified>li>a{border-bottom:1px solid #ddd;border-radius:4px 4px 0 0}.nav-tabs-justified>.active>a,.nav-tabs-justified>.active>a:hover,.nav-tabs-justified>.active>a:focus{border-bottom-color:#fff}}.tab-content>.tab-pane{display:none}.tab-content>.active{display:block}.nav-tabs .dropdown-menu{margin-top:-1px;border-top-left-radius:0;border-top-right-radius:0}.navbar{position:relative;min-height:50px;margin-bottom:20px;border:1px solid transparent}@media (min-width:768px){.navbar{border-radius:4px}}@media (min-width:768px){.navbar-header{float:left}}.navbar-collapse{padding-right:15px;padding-left:15px;overflow-x:visible;-webkit-overflow-scrolling:touch;border-top:1px solid transparent;-webkit-box-shadow:inset 0 1px 0 rgba(255,255,255,.1);box-shadow:inset 0 1px 0 rgba(255,255,255,.1)}.navbar-collapse.in{overflow-y:auto}@media (min-width:768px){.navbar-collapse{width:auto;border-top:0;-webkit-box-shadow:none;box-shadow:none}.navbar-collapse.collapse{display:block!important;height:auto!important;padding-bottom:0;overflow:visible!important}.navbar-collapse.in{overflow-y:visible}.navbar-fixed-top .navbar-collapse,.navbar-static-top .navbar-collapse,.navbar-fixed-bottom .navbar-collapse{padding-right:0;padding-left:0}}.navbar-fixed-top .navbar-collapse,.navbar-fixed-bottom .navbar-collapse{max-height:340px}@media (max-width:480px) and (orientation:landscape){.navbar-fixed-top .navbar-collapse,.navbar-fixed-bottom .navbar-collapse{max-height:200px}}.container>.navbar-header,.container-fluid>.navbar-header,.container>.navbar-collapse,.container-fluid>.navbar-collapse{margin-right:-15px;margin-left:-15px}@media (min-width:768px){.container>.navbar-header,.container-fluid>.navbar-header,.container>.navbar-collapse,.container-fluid>.navbar-collapse{margin-right:0;margin-left:0}}.navbar-static-top{z-index:1000;border-width:0 0 1px}@media (min-width:768px){.navbar-static-top{border-radius:0}}.navbar-fixed-top,.navbar-fixed-bottom{position:fixed;right:0;left:0;z-index:1030;-webkit-transform:translate3d(0,0,0);-o-transform:translate3d(0,0,0);transform:translate3d(0,0,0)}@media (min-width:768px){.navbar-fixed-top,.navbar-fixed-bottom{border-radius:0}}.navbar-fixed-top{top:0;border-width:0 0 1px}.navbar-fixed-bottom{bottom:0;margin-bottom:0;border-width:1px 0 0}.navbar-brand{float:left;height:50px;padding:15px 15px;font-size:18px;line-height:20px}.navbar-brand:hover,.navbar-brand:focus{text-decoration:none}@media (min-width:768px){.navbar>.container .navbar-brand,.navbar>.container-fluid .navbar-brand{margin-left:-15px}}.navbar-toggle{position:relative;float:right;padding:9px 10px;margin-top:8px;margin-right:15px;margin-bottom:8px;background-color:transparent;background-image:none;border:1px solid transparent;border-radius:4px}.navbar-toggle:focus{outline:0}.navbar-toggle .icon-bar{display:block;width:22px;height:2px;border-radius:1px}.navbar-toggle .icon-bar+.icon-bar{margin-top:4px}@media (min-width:768px){.navbar-toggle{display:none}}.navbar-nav{margin:7.5px -15px}.navbar-nav>li>a{padding-top:10px;padding-bottom:10px;line-height:20px}@media (max-width:767px){.navbar-nav .open .dropdown-menu{position:static;float:none;width:auto;margin-top:0;background-color:transparent;border:0;-webkit-box-shadow:none;box-shadow:none}.navbar-nav .open .dropdown-menu>li>a,.navbar-nav .open .dropdown-menu .dropdown-header{padding:5px 15px 5px 25px}.navbar-nav .open .dropdown-menu>li>a{line-height:20px}.navbar-nav .open .dropdown-menu>li>a:hover,.navbar-nav .open .dropdown-menu>li>a:focus{background-image:none}}@media (min-width:768px){.navbar-nav{float:left;margin:0}.navbar-nav>li{float:left}.navbar-nav>li>a{padding-top:15px;padding-bottom:15px}.navbar-nav.navbar-right:last-child{margin-right:-15px}}@media (min-width:768px){.navbar-left{float:left!important}.navbar-right{float:right!important}}.navbar-form{padding:10px 15px;margin-top:8px;margin-right:-15px;margin-bottom:8px;margin-left:-15px;border-top:1px solid transparent;border-bottom:1px solid transparent;-webkit-box-shadow:inset 0 1px 0 rgba(255,255,255,.1),0 1px 0 rgba(255,255,255,.1);box-shadow:inset 0 1px 0 rgba(255,255,255,.1),0 1px 0 rgba(255,255,255,.1)}@media (min-width:768px){.navbar-form .form-group{display:inline-block;margin-bottom:0;vertical-align:middle}.navbar-form .form-control{display:inline-block;width:auto;vertical-align:middle}.navbar-form .input-group{display:inline-table;vertical-align:middle}.navbar-form .input-group .input-group-addon,.navbar-form .input-group .input-group-btn,.navbar-form .input-group .form-control{width:auto}.navbar-form .input-group>.form-control{width:100%}.navbar-form .control-label{margin-bottom:0;vertical-align:middle}.navbar-form .radio,.navbar-form .checkbox{display:inline-block;margin-top:0;margin-bottom:0;vertical-align:middle}.navbar-form .radio label,.navbar-form .checkbox label{padding-left:0}.navbar-form .radio input[type=radio],.navbar-form .checkbox input[type=checkbox]{position:relative;margin-left:0}.navbar-form .has-feedback .form-control-feedback{top:0}}@media (max-width:767px){.navbar-form .form-group{margin-bottom:5px}}@media (min-width:768px){.navbar-form{width:auto;padding-top:0;padding-bottom:0;margin-right:0;margin-left:0;border:0;-webkit-box-shadow:none;box-shadow:none}.navbar-form.navbar-right:last-child{margin-right:-15px}}.navbar-nav>li>.dropdown-menu{margin-top:0;border-top-left-radius:0;border-top-right-radius:0}.navbar-fixed-bottom .navbar-nav>li>.dropdown-menu{border-bottom-right-radius:0;border-bottom-left-radius:0}.navbar-btn{margin-top:8px;margin-bottom:8px}.navbar-btn.btn-sm{margin-top:10px;margin-bottom:10px}.navbar-btn.btn-xs{margin-top:14px;margin-bottom:14px}.navbar-text{margin-top:15px;margin-bottom:15px}@media (min-width:768px){.navbar-text{float:left;margin-right:15px;margin-left:15px}.navbar-text.navbar-right:last-child{margin-right:0}}.navbar-default{background-color:#f8f8f8;border-color:#e7e7e7}.navbar-default .navbar-brand{color:#777}.navbar-default .navbar-brand:hover,.navbar-default .navbar-brand:focus{color:#5e5e5e;background-color:transparent}.navbar-default .navbar-text{color:#777}.navbar-default .navbar-nav>li>a{color:#777}.navbar-default .navbar-nav>li>a:hover,.navbar-default .navbar-nav>li>a:focus{color:#333;background-color:transparent}.navbar-default .navbar-nav>.active>a,.navbar-default .navbar-nav>.active>a:hover,.navbar-default .navbar-nav>.active>a:focus{color:#555;background-color:#e7e7e7}.navbar-default .navbar-nav>.disabled>a,.navbar-default .navbar-nav>.disabled>a:hover,.navbar-default .navbar-nav>.disabled>a:focus{color:#ccc;background-color:transparent}.navbar-default .navbar-toggle{border-color:#ddd}.navbar-default .navbar-toggle:hover,.navbar-default .navbar-toggle:focus{background-color:#ddd}.navbar-default .navbar-toggle .icon-bar{background-color:#888}.navbar-default .navbar-collapse,.navbar-default .navbar-form{border-color:#e7e7e7}.navbar-default .navbar-nav>.open>a,.navbar-default .navbar-nav>.open>a:hover,.navbar-default .navbar-nav>.open>a:focus{color:#555;background-color:#e7e7e7}@media (max-width:767px){.navbar-default .navbar-nav .open .dropdown-menu>li>a{color:#777}.navbar-default .navbar-nav .open .dropdown-menu>li>a:hover,.navbar-default .navbar-nav .open .dropdown-menu>li>a:focus{color:#333;background-color:transparent}.navbar-default .navbar-nav .open .dropdown-menu>.active>a,.navbar-default .navbar-nav .open .dropdown-menu>.active>a:hover,.navbar-default .navbar-nav .open .dropdown-menu>.active>a:focus{color:#555;background-color:#e7e7e7}.navbar-default .navbar-nav .open .dropdown-menu>.disabled>a,.navbar-default .navbar-nav .open .dropdown-menu>.disabled>a:hover,.navbar-default .navbar-nav .open .dropdown-menu>.disabled>a:focus{color:#ccc;background-color:transparent}}.navbar-default .navbar-link{color:#777}.navbar-default .navbar-link:hover{color:#333}.navbar-default .btn-link{color:#777}.navbar-default .btn-link:hover,.navbar-default .btn-link:focus{color:#333}.navbar-default .btn-link[disabled]:hover,fieldset[disabled] .navbar-default .btn-link:hover,.navbar-default .btn-link[disabled]:focus,fieldset[disabled] .navbar-default .btn-link:focus{color:#ccc}.navbar-inverse{background-color:#222;border-color:#080808}.navbar-inverse .navbar-brand{color:#777}.navbar-inverse .navbar-brand:hover,.navbar-inverse .navbar-brand:focus{color:#fff;background-color:transparent}.navbar-inverse .navbar-text{color:#777}.navbar-inverse .navbar-nav>li>a{color:#777}.navbar-inverse .navbar-nav>li>a:hover,.navbar-inverse .navbar-nav>li>a:focus{color:#fff;background-color:transparent}.navbar-inverse .navbar-nav>.active>a,.navbar-inverse .navbar-nav>.active>a:hover,.navbar-inverse .navbar-nav>.active>a:focus{color:#fff;background-color:#080808}.navbar-inverse .navbar-nav>.disabled>a,.navbar-inverse .navbar-nav>.disabled>a:hover,.navbar-inverse .navbar-nav>.disabled>a:focus{color:#444;background-color:transparent}.navbar-inverse .navbar-toggle{border-color:#333}.navbar-inverse .navbar-toggle:hover,.navbar-inverse .navbar-toggle:focus{background-color:#333}.navbar-inverse .navbar-toggle .icon-bar{background-color:#fff}.navbar-inverse .navbar-collapse,.navbar-inverse .navbar-form{border-color:#101010}.navbar-inverse .navbar-nav>.open>a,.navbar-inverse .navbar-nav>.open>a:hover,.navbar-inverse .navbar-nav>.open>a:focus{color:#fff;background-color:#080808}@media (max-width:767px){.navbar-inverse .navbar-nav .open .dropdown-menu>.dropdown-header{border-color:#080808}.navbar-inverse .navbar-nav .open .dropdown-menu .divider{background-color:#080808}.navbar-inverse .navbar-nav .open .dropdown-menu>li>a{color:#777}.navbar-inverse .navbar-nav .open .dropdown-menu>li>a:hover,.navbar-inverse .navbar-nav .open .dropdown-menu>li>a:focus{color:#fff;background-color:transparent}.navbar-inverse .navbar-nav .open .dropdown-menu>.active>a,.navbar-inverse .navbar-nav .open .dropdown-menu>.active>a:hover,.navbar-inverse .navbar-nav .open .dropdown-menu>.active>a:focus{color:#fff;background-color:#080808}.navbar-inverse .navbar-nav .open .dropdown-menu>.disabled>a,.navbar-inverse .navbar-nav .open .dropdown-menu>.disabled>a:hover,.navbar-inverse .navbar-nav .open .dropdown-menu>.disabled>a:focus{color:#444;background-color:transparent}}.navbar-inverse .navbar-link{color:#777}.navbar-inverse .navbar-link:hover{color:#fff}.navbar-inverse .btn-link{color:#777}.navbar-inverse .btn-link:hover,.navbar-inverse .btn-link:focus{color:#fff}.navbar-inverse .btn-link[disabled]:hover,fieldset[disabled] .navbar-inverse .btn-link:hover,.navbar-inverse .btn-link[disabled]:focus,fieldset[disabled] .navbar-inverse .btn-link:focus{color:#444}.breadcrumb{padding:8px 15px;margin-bottom:20px;list-style:none;background-color:#f5f5f5;border-radius:4px}.breadcrumb>li{display:inline-block}.breadcrumb>li+li:before{padding:0 5px;color:#ccc;content:"/\00a0"}.breadcrumb>.active{color:#777}.pagination{display:inline-block;padding-left:0;margin:20px 0;border-radius:4px}.pagination>li{display:inline}.pagination>li>a,.pagination>li>span{position:relative;float:left;padding:6px 12px;margin-left:-1px;line-height:1.42857143;color:#428bca;text-decoration:none;background-color:#fff;border:1px solid #ddd}.pagination>li:first-child>a,.pagination>li:first-child>span{margin-left:0;border-top-left-radius:4px;border-bottom-left-radius:4px}.pagination>li:last-child>a,.pagination>li:last-child>span{border-top-right-radius:4px;border-bottom-right-radius:4px}.pagination>li>a:hover,.pagination>li>span:hover,.pagination>li>a:focus,.pagination>li>span:focus{color:#2a6496;background-color:#eee;border-color:#ddd}.pagination>.active>a,.pagination>.active>span,.pagination>.active>a:hover,.pagination>.active>span:hover,.pagination>.active>a:focus,.pagination>.active>span:focus{z-index:2;color:#fff;cursor:default;background-color:#428bca;border-color:#428bca}.pagination>.disabled>span,.pagination>.disabled>span:hover,.pagination>.disabled>span:focus,.pagination>.disabled>a,.pagination>.disabled>a:hover,.pagination>.disabled>a:focus{color:#777;cursor:not-allowed;background-color:#fff;border-color:#ddd}.pagination-lg>li>a,.pagination-lg>li>span{padding:10px 16px;font-size:18px}.pagination-lg>li:first-child>a,.pagination-lg>li:first-child>span{border-top-left-radius:6px;border-bottom-left-radius:6px}.pagination-lg>li:last-child>a,.pagination-lg>li:last-child>span{border-top-right-radius:6px;border-bottom-right-radius:6px}.pagination-sm>li>a,.pagination-sm>li>span{padding:5px 10px;font-size:12px}.pagination-sm>li:first-child>a,.pagination-sm>li:first-child>span{border-top-left-radius:3px;border-bottom-left-radius:3px}.pagination-sm>li:last-child>a,.pagination-sm>li:last-child>span{border-top-right-radius:3px;border-bottom-right-radius:3px}.pager{padding-left:0;margin:20px 0;text-align:center;list-style:none}.pager li{display:inline}.pager li>a,.pager li>span{display:inline-block;padding:5px 14px;background-color:#fff;border:1px solid #ddd;border-radius:15px}.pager li>a:hover,.pager li>a:focus{text-decoration:none;background-color:#eee}.pager .next>a,.pager .next>span{float:right}.pager .previous>a,.pager .previous>span{float:left}.pager .disabled>a,.pager .disabled>a:hover,.pager .disabled>a:focus,.pager .disabled>span{color:#777;cursor:not-allowed;background-color:#fff}.label{display:inline;padding:.2em .6em .3em;font-size:75%;font-weight:700;line-height:1;color:#fff;text-align:center;white-space:nowrap;vertical-align:baseline;border-radius:.25em}a.label:hover,a.label:focus{color:#fff;text-decoration:none;cursor:pointer}.label:empty{display:none}.btn .label{position:relative;top:-1px}.label-default{background-color:#777}.label-default[href]:hover,.label-default[href]:focus{background-color:#5e5e5e}.label-primary{background-color:#428bca}.label-primary[href]:hover,.label-primary[href]:focus{background-color:#3071a9}.label-success{background-color:#5cb85c}.label-success[href]:hover,.label-success[href]:focus{background-color:#449d44}.label-info{background-color:#5bc0de}.label-info[href]:hover,.label-info[href]:focus{background-color:#31b0d5}.label-warning{background-color:#f0ad4e}.label-warning[href]:hover,.label-warning[href]:focus{background-color:#ec971f}.label-danger{background-color:#d9534f}.label-danger[href]:hover,.label-danger[href]:focus{background-color:#c9302c}.badge{display:inline-block;min-width:10px;padding:3px 7px;font-size:12px;font-weight:700;line-height:1;color:#fff;text-align:center;white-space:nowrap;vertical-align:baseline;background-color:#777;border-radius:10px}.badge:empty{display:none}.btn .badge{position:relative;top:-1px}.btn-xs .badge{top:0;padding:1px 5px}a.badge:hover,a.badge:focus{color:#fff;text-decoration:none;cursor:pointer}a.list-group-item.active>.badge,.nav-pills>.active>a>.badge{color:#428bca;background-color:#fff}.nav-pills>li>a>.badge{margin-left:3px}.jumbotron{padding:30px;margin-bottom:30px;color:inherit;background-color:#eee}.jumbotron h1,.jumbotron .h1{color:inherit}.jumbotron p{margin-bottom:15px;font-size:21px;font-weight:200}.jumbotron>hr{border-top-color:#d5d5d5}.container .jumbotron{border-radius:6px}.jumbotron .container{max-width:100%}@media screen and (min-width:768px){.jumbotron{padding-top:48px;padding-bottom:48px}.container .jumbotron{padding-right:60px;padding-left:60px}.jumbotron h1,.jumbotron .h1{font-size:63px}}.thumbnail{display:block;padding:4px;margin-bottom:20px;line-height:1.42857143;background-color:#fff;border:1px solid #ddd;border-radius:4px;-webkit-transition:all .2s ease-in-out;-o-transition:all .2s ease-in-out;transition:all .2s ease-in-out}.thumbnail>img,.thumbnail a>img{margin-right:auto;margin-left:auto}a.thumbnail:hover,a.thumbnail:focus,a.thumbnail.active{border-color:#428bca}.thumbnail .caption{padding:9px;color:#333}.alert{padding:15px;margin-bottom:20px;border:1px solid transparent;border-radius:4px}.alert h4{margin-top:0;color:inherit}.alert .alert-link{font-weight:700}.alert>p,.alert>ul{margin-bottom:0}.alert>p+p{margin-top:5px}.alert-dismissable,.alert-dismissible{padding-right:35px}.alert-dismissable .close,.alert-dismissible .close{position:relative;top:-2px;right:-21px;color:inherit}.alert-success{color:#3c763d;background-color:#dff0d8;border-color:#d6e9c6}.alert-success hr{border-top-color:#c9e2b3}.alert-success .alert-link{color:#2b542c}.alert-info{color:#31708f;background-color:#d9edf7;border-color:#bce8f1}.alert-info hr{border-top-color:#a6e1ec}.alert-info .alert-link{color:#245269}.alert-warning{color:#8a6d3b;background-color:#fcf8e3;border-color:#faebcc}.alert-warning hr{border-top-color:#f7e1b5}.alert-warning .alert-link{color:#66512c}.alert-danger{color:#a94442;background-color:#f2dede;border-color:#ebccd1}.alert-danger hr{border-top-color:#e4b9c0}.alert-danger .alert-link{color:#843534}@-webkit-keyframes progress-bar-stripes{from{background-position:40px 0}to{background-position:0 0}}@-o-keyframes progress-bar-stripes{from{background-position:40px 0}to{background-position:0 0}}@keyframes progress-bar-stripes{from{background-position:40px 0}to{background-position:0 0}}.progress{height:20px;margin-bottom:20px;overflow:hidden;background-color:#f5f5f5;border-radius:4px;-webkit-box-shadow:inset 0 1px 2px rgba(0,0,0,.1);box-shadow:inset 0 1px 2px rgba(0,0,0,.1)}.progress-bar{float:left;width:0;height:100%;font-size:12px;line-height:20px;color:#fff;text-align:center;background-color:#428bca;-webkit-box-shadow:inset 0 -1px 0 rgba(0,0,0,.15);box-shadow:inset 0 -1px 0 rgba(0,0,0,.15);-webkit-transition:width .6s ease;-o-transition:width .6s ease;transition:width .6s ease}.progress-striped .progress-bar,.progress-bar-striped{background-image:-webkit-linear-gradient(45deg,rgba(255,255,255,.15) 25%,transparent 25%,transparent 50%,rgba(255,255,255,.15) 50%,rgba(255,255,255,.15) 75%,transparent 75%,transparent);background-image:-o-linear-gradient(45deg,rgba(255,255,255,.15) 25%,transparent 25%,transparent 50%,rgba(255,255,255,.15) 50%,rgba(255,255,255,.15) 75%,transparent 75%,transparent);background-image:linear-gradient(45deg,rgba(255,255,255,.15) 25%,transparent 25%,transparent 50%,rgba(255,255,255,.15) 50%,rgba(255,255,255,.15) 75%,transparent 75%,transparent);-webkit-background-size:40px 40px;background-size:40px 40px}.progress.active .progress-bar,.progress-bar.active{-webkit-animation:progress-bar-stripes 2s linear infinite;-o-animation:progress-bar-stripes 2s linear infinite;animation:progress-bar-stripes 2s linear infinite}.progress-bar[aria-valuenow="1"],.progress-bar[aria-valuenow="2"]{min-width:30px}.progress-bar[aria-valuenow="0"]{min-width:30px;color:#777;background-color:transparent;background-image:none;-webkit-box-shadow:none;box-shadow:none}.progress-bar-success{background-color:#5cb85c}.progress-striped .progress-bar-success{background-image:-webkit-linear-gradient(45deg,rgba(255,255,255,.15) 25%,transparent 25%,transparent 50%,rgba(255,255,255,.15) 50%,rgba(255,255,255,.15) 75%,transparent 75%,transparent);background-image:-o-linear-gradient(45deg,rgba(255,255,255,.15) 25%,transparent 25%,transparent 50%,rgba(255,255,255,.15) 50%,rgba(255,255,255,.15) 75%,transparent 75%,transparent);background-image:linear-gradient(45deg,rgba(255,255,255,.15) 25%,transparent 25%,transparent 50%,rgba(255,255,255,.15) 50%,rgba(255,255,255,.15) 75%,transparent 75%,transparent)}.progress-bar-info{background-color:#5bc0de}.progress-striped .progress-bar-info{background-image:-webkit-linear-gradient(45deg,rgba(255,255,255,.15) 25%,transparent 25%,transparent 50%,rgba(255,255,255,.15) 50%,rgba(255,255,255,.15) 75%,transparent 75%,transparent);background-image:-o-linear-gradient(45deg,rgba(255,255,255,.15) 25%,transparent 25%,transparent 50%,rgba(255,255,255,.15) 50%,rgba(255,255,255,.15) 75%,transparent 75%,transparent);background-image:linear-gradient(45deg,rgba(255,255,255,.15) 25%,transparent 25%,transparent 50%,rgba(255,255,255,.15) 50%,rgba(255,255,255,.15) 75%,transparent 75%,transparent)}.progress-bar-warning{background-color:#f0ad4e}.progress-striped .progress-bar-warning{background-image:-webkit-linear-gradient(45deg,rgba(255,255,255,.15) 25%,transparent 25%,transparent 50%,rgba(255,255,255,.15) 50%,rgba(255,255,255,.15) 75%,transparent 75%,transparent);background-image:-o-linear-gradient(45deg,rgba(255,255,255,.15) 25%,transparent 25%,transparent 50%,rgba(255,255,255,.15) 50%,rgba(255,255,255,.15) 75%,transparent 75%,transparent);background-image:linear-gradient(45deg,rgba(255,255,255,.15) 25%,transparent 25%,transparent 50%,rgba(255,255,255,.15) 50%,rgba(255,255,255,.15) 75%,transparent 75%,transparent)}.progress-bar-danger{background-color:#d9534f}.progress-striped .progress-bar-danger{background-image:-webkit-linear-gradient(45deg,rgba(255,255,255,.15) 25%,transparent 25%,transparent 50%,rgba(255,255,255,.15) 50%,rgba(255,255,255,.15) 75%,transparent 75%,transparent);background-image:-o-linear-gradient(45deg,rgba(255,255,255,.15) 25%,transparent 25%,transparent 50%,rgba(255,255,255,.15) 50%,rgba(255,255,255,.15) 75%,transparent 75%,transparent);background-image:linear-gradient(45deg,rgba(255,255,255,.15) 25%,transparent 25%,transparent 50%,rgba(255,255,255,.15) 50%,rgba(255,255,255,.15) 75%,transparent 75%,transparent)}.media,.media-body{overflow:hidden;zoom:1}.media,.media .media{margin-top:15px}.media:first-child{margin-top:0}.media-object{display:block}.media-heading{margin:0 0 5px}.media>.pull-left{margin-right:10px}.media>.pull-right{margin-left:10px}.media-list{padding-left:0;list-style:none}.list-group{padding-left:0;margin-bottom:20px}.list-group-item{position:relative;display:block;padding:10px 15px;margin-bottom:-1px;background-color:#fff;border:1px solid #ddd}.list-group-item:first-child{border-top-left-radius:4px;border-top-right-radius:4px}.list-group-item:last-child{margin-bottom:0;border-bottom-right-radius:4px;border-bottom-left-radius:4px}.list-group-item>.badge{float:right}.list-group-item>.badge+.badge{margin-right:5px}a.list-group-item{color:#555}a.list-group-item .list-group-item-heading{color:#333}a.list-group-item:hover,a.list-group-item:focus{color:#555;text-decoration:none;background-color:#f5f5f5}.list-group-item.disabled,.list-group-item.disabled:hover,.list-group-item.disabled:focus{color:#777;background-color:#eee}.list-group-item.disabled .list-group-item-heading,.list-group-item.disabled:hover .list-group-item-heading,.list-group-item.disabled:focus .list-group-item-heading{color:inherit}.list-group-item.disabled .list-group-item-text,.list-group-item.disabled:hover .list-group-item-text,.list-group-item.disabled:focus .list-group-item-text{color:#777}.list-group-item.active,.list-group-item.active:hover,.list-group-item.active:focus{z-index:2;color:#fff;background-color:#428bca;border-color:#428bca}.list-group-item.active .list-group-item-heading,.list-group-item.active:hover .list-group-item-heading,.list-group-item.active:focus .list-group-item-heading,.list-group-item.active .list-group-item-heading>small,.list-group-item.active:hover .list-group-item-heading>small,.list-group-item.active:focus .list-group-item-heading>small,.list-group-item.active .list-group-item-heading>.small,.list-group-item.active:hover .list-group-item-heading>.small,.list-group-item.active:focus .list-group-item-heading>.small{color:inherit}.list-group-item.active .list-group-item-text,.list-group-item.active:hover .list-group-item-text,.list-group-item.active:focus .list-group-item-text{color:#e1edf7}.list-group-item-success{color:#3c763d;background-color:#dff0d8}a.list-group-item-success{color:#3c763d}a.list-group-item-success .list-group-item-heading{color:inherit}a.list-group-item-success:hover,a.list-group-item-success:focus{color:#3c763d;background-color:#d0e9c6}a.list-group-item-success.active,a.list-group-item-success.active:hover,a.list-group-item-success.active:focus{color:#fff;background-color:#3c763d;border-color:#3c763d}.list-group-item-info{color:#31708f;background-color:#d9edf7}a.list-group-item-info{color:#31708f}a.list-group-item-info .list-group-item-heading{color:inherit}a.list-group-item-info:hover,a.list-group-item-info:focus{color:#31708f;background-color:#c4e3f3}a.list-group-item-info.active,a.list-group-item-info.active:hover,a.list-group-item-info.active:focus{color:#fff;background-color:#31708f;border-color:#31708f}.list-group-item-warning{color:#8a6d3b;background-color:#fcf8e3}a.list-group-item-warning{color:#8a6d3b}a.list-group-item-warning .list-group-item-heading{color:inherit}a.list-group-item-warning:hover,a.list-group-item-warning:focus{color:#8a6d3b;background-color:#faf2cc}a.list-group-item-warning.active,a.list-group-item-warning.active:hover,a.list-group-item-warning.active:focus{color:#fff;background-color:#8a6d3b;border-color:#8a6d3b}.list-group-item-danger{color:#a94442;background-color:#f2dede}a.list-group-item-danger{color:#a94442}a.list-group-item-danger .list-group-item-heading{color:inherit}a.list-group-item-danger:hover,a.list-group-item-danger:focus{color:#a94442;background-color:#ebcccc}a.list-group-item-danger.active,a.list-group-item-danger.active:hover,a.list-group-item-danger.active:focus{color:#fff;background-color:#a94442;border-color:#a94442}.list-group-item-heading{margin-top:0;margin-bottom:5px}.list-group-item-text{margin-bottom:0;line-height:1.3}.panel{margin-bottom:20px;background-color:#fff;border:1px solid transparent;border-radius:4px;-webkit-box-shadow:0 1px 1px rgba(0,0,0,.05);box-shadow:0 1px 1px rgba(0,0,0,.05)}.panel-body{padding:15px}.panel-heading{padding:10px 15px;border-bottom:1px solid transparent;border-top-left-radius:3px;border-top-right-radius:3px}.panel-heading>.dropdown .dropdown-toggle{color:inherit}.panel-title{margin-top:0;margin-bottom:0;font-size:16px;color:inherit}.panel-title>a{color:inherit}.panel-footer{padding:10px 15px;background-color:#f5f5f5;border-top:1px solid #ddd;border-bottom-right-radius:3px;border-bottom-left-radius:3px}.panel>.list-group{margin-bottom:0}.panel>.list-group .list-group-item{border-width:1px 0;border-radius:0}.panel>.list-group:first-child .list-group-item:first-child{border-top:0;border-top-left-radius:3px;border-top-right-radius:3px}.panel>.list-group:last-child .list-group-item:last-child{border-bottom:0;border-bottom-right-radius:3px;border-bottom-left-radius:3px}.panel-heading+.list-group .list-group-item:first-child{border-top-width:0}.list-group+.panel-footer{border-top-width:0}.panel>.table,.panel>.table-responsive>.table,.panel>.panel-collapse>.table{margin-bottom:0}.panel>.table:first-child,.panel>.table-responsive:first-child>.table:first-child{border-top-left-radius:3px;border-top-right-radius:3px}.panel>.table:first-child>thead:first-child>tr:first-child td:first-child,.panel>.table-responsive:first-child>.table:first-child>thead:first-child>tr:first-child td:first-child,.panel>.table:first-child>tbody:first-child>tr:first-child td:first-child,.panel>.table-responsive:first-child>.table:first-child>tbody:first-child>tr:first-child td:first-child,.panel>.table:first-child>thead:first-child>tr:first-child th:first-child,.panel>.table-responsive:first-child>.table:first-child>thead:first-child>tr:first-child th:first-child,.panel>.table:first-child>tbody:first-child>tr:first-child th:first-child,.panel>.table-responsive:first-child>.table:first-child>tbody:first-child>tr:first-child th:first-child{border-top-left-radius:3px}.panel>.table:first-child>thead:first-child>tr:first-child td:last-child,.panel>.table-responsive:first-child>.table:first-child>thead:first-child>tr:first-child td:last-child,.panel>.table:first-child>tbody:first-child>tr:first-child td:last-child,.panel>.table-responsive:first-child>.table:first-child>tbody:first-child>tr:first-child td:last-child,.panel>.table:first-child>thead:first-child>tr:first-child th:last-child,.panel>.table-responsive:first-child>.table:first-child>thead:first-child>tr:first-child th:last-child,.panel>.table:first-child>tbody:first-child>tr:first-child th:last-child,.panel>.table-responsive:first-child>.table:first-child>tbody:first-child>tr:first-child th:last-child{border-top-right-radius:3px}.panel>.table:last-child,.panel>.table-responsive:last-child>.table:last-child{border-bottom-right-radius:3px;border-bottom-left-radius:3px}.panel>.table:last-child>tbody:last-child>tr:last-child td:first-child,.panel>.table-responsive:last-child>.table:last-child>tbody:last-child>tr:last-child td:first-child,.panel>.table:last-child>tfoot:last-child>tr:last-child td:first-child,.panel>.table-responsive:last-child>.table:last-child>tfoot:last-child>tr:last-child td:first-child,.panel>.table:last-child>tbody:last-child>tr:last-child th:first-child,.panel>.table-responsive:last-child>.table:last-child>tbody:last-child>tr:last-child th:first-child,.panel>.table:last-child>tfoot:last-child>tr:last-child th:first-child,.panel>.table-responsive:last-child>.table:last-child>tfoot:last-child>tr:last-child th:first-child{border-bottom-left-radius:3px}.panel>.table:last-child>tbody:last-child>tr:last-child td:last-child,.panel>.table-responsive:last-child>.table:last-child>tbody:last-child>tr:last-child td:last-child,.panel>.table:last-child>tfoot:last-child>tr:last-child td:last-child,.panel>.table-responsive:last-child>.table:last-child>tfoot:last-child>tr:last-child td:last-child,.panel>.table:last-child>tbody:last-child>tr:last-child th:last-child,.panel>.table-responsive:last-child>.table:last-child>tbody:last-child>tr:last-child th:last-child,.panel>.table:last-child>tfoot:last-child>tr:last-child th:last-child,.panel>.table-responsive:last-child>.table:last-child>tfoot:last-child>tr:last-child th:last-child{border-bottom-right-radius:3px}.panel>.panel-body+.table,.panel>.panel-body+.table-responsive{border-top:1px solid #ddd}.panel>.table>tbody:first-child>tr:first-child th,.panel>.table>tbody:first-child>tr:first-child td{border-top:0}.panel>.table-bordered,.panel>.table-responsive>.table-bordered{border:0}.panel>.table-bordered>thead>tr>th:first-child,.panel>.table-responsive>.table-bordered>thead>tr>th:first-child,.panel>.table-bordered>tbody>tr>th:first-child,.panel>.table-responsive>.table-bordered>tbody>tr>th:first-child,.panel>.table-bordered>tfoot>tr>th:first-child,.panel>.table-responsive>.table-bordered>tfoot>tr>th:first-child,.panel>.table-bordered>thead>tr>td:first-child,.panel>.table-responsive>.table-bordered>thead>tr>td:first-child,.panel>.table-bordered>tbody>tr>td:first-child,.panel>.table-responsive>.table-bordered>tbody>tr>td:first-child,.panel>.table-bordered>tfoot>tr>td:first-child,.panel>.table-responsive>.table-bordered>tfoot>tr>td:first-child{border-left:0}.panel>.table-bordered>thead>tr>th:last-child,.panel>.table-responsive>.table-bordered>thead>tr>th:last-child,.panel>.table-bordered>tbody>tr>th:last-child,.panel>.table-responsive>.table-bordered>tbody>tr>th:last-child,.panel>.table-bordered>tfoot>tr>th:last-child,.panel>.table-responsive>.table-bordered>tfoot>tr>th:last-child,.panel>.table-bordered>thead>tr>td:last-child,.panel>.table-responsive>.table-bordered>thead>tr>td:last-child,.panel>.table-bordered>tbody>tr>td:last-child,.panel>.table-responsive>.table-bordered>tbody>tr>td:last-child,.panel>.table-bordered>tfoot>tr>td:last-child,.panel>.table-responsive>.table-bordered>tfoot>tr>td:last-child{border-right:0}.panel>.table-bordered>thead>tr:first-child>td,.panel>.table-responsive>.table-bordered>thead>tr:first-child>td,.panel>.table-bordered>tbody>tr:first-child>td,.panel>.table-responsive>.table-bordered>tbody>tr:first-child>td,.panel>.table-bordered>thead>tr:first-child>th,.panel>.table-responsive>.table-bordered>thead>tr:first-child>th,.panel>.table-bordered>tbody>tr:first-child>th,.panel>.table-responsive>.table-bordered>tbody>tr:first-child>th{border-bottom:0}.panel>.table-bordered>tbody>tr:last-child>td,.panel>.table-responsive>.table-bordered>tbody>tr:last-child>td,.panel>.table-bordered>tfoot>tr:last-child>td,.panel>.table-responsive>.table-bordered>tfoot>tr:last-child>td,.panel>.table-bordered>tbody>tr:last-child>th,.panel>.table-responsive>.table-bordered>tbody>tr:last-child>th,.panel>.table-bordered>tfoot>tr:last-child>th,.panel>.table-responsive>.table-bordered>tfoot>tr:last-child>th{border-bottom:0}.panel>.table-responsive{margin-bottom:0;border:0}.panel-group{margin-bottom:20px}.panel-group .panel{margin-bottom:0;border-radius:4px}.panel-group .panel+.panel{margin-top:5px}.panel-group .panel-heading{border-bottom:0}.panel-group .panel-heading+.panel-collapse>.panel-body{border-top:1px solid #ddd}.panel-group .panel-footer{border-top:0}.panel-group .panel-footer+.panel-collapse .panel-body{border-bottom:1px solid #ddd}.panel-default{border-color:#ddd}.panel-default>.panel-heading{color:#333;background-color:#f5f5f5;border-color:#ddd}.panel-default>.panel-heading+.panel-collapse>.panel-body{border-top-color:#ddd}.panel-default>.panel-heading .badge{color:#f5f5f5;background-color:#333}.panel-default>.panel-footer+.panel-collapse>.panel-body{border-bottom-color:#ddd}.panel-primary{border-color:#428bca}.panel-primary>.panel-heading{color:#fff;background-color:#428bca;border-color:#428bca}.panel-primary>.panel-heading+.panel-collapse>.panel-body{border-top-color:#428bca}.panel-primary>.panel-heading .badge{color:#428bca;background-color:#fff}.panel-primary>.panel-footer+.panel-collapse>.panel-body{border-bottom-color:#428bca}.panel-success{border-color:#d6e9c6}.panel-success>.panel-heading{color:#3c763d;background-color:#dff0d8;border-color:#d6e9c6}.panel-success>.panel-heading+.panel-collapse>.panel-body{border-top-color:#d6e9c6}.panel-success>.panel-heading .badge{color:#dff0d8;background-color:#3c763d}.panel-success>.panel-footer+.panel-collapse>.panel-body{border-bottom-color:#d6e9c6}.panel-info{border-color:#bce8f1}.panel-info>.panel-heading{color:#31708f;background-color:#d9edf7;border-color:#bce8f1}.panel-info>.panel-heading+.panel-collapse>.panel-body{border-top-color:#bce8f1}.panel-info>.panel-heading .badge{color:#d9edf7;background-color:#31708f}.panel-info>.panel-footer+.panel-collapse>.panel-body{border-bottom-color:#bce8f1}.panel-warning{border-color:#faebcc}.panel-warning>.panel-heading{color:#8a6d3b;background-color:#fcf8e3;border-color:#faebcc}.panel-warning>.panel-heading+.panel-collapse>.panel-body{border-top-color:#faebcc}.panel-warning>.panel-heading .badge{color:#fcf8e3;background-color:#8a6d3b}.panel-warning>.panel-footer+.panel-collapse>.panel-body{border-bottom-color:#faebcc}.panel-danger{border-color:#ebccd1}.panel-danger>.panel-heading{color:#a94442;background-color:#f2dede;border-color:#ebccd1}.panel-danger>.panel-heading+.panel-collapse>.panel-body{border-top-color:#ebccd1}.panel-danger>.panel-heading .badge{color:#f2dede;background-color:#a94442}.panel-danger>.panel-footer+.panel-collapse>.panel-body{border-bottom-color:#ebccd1}.embed-responsive{position:relative;display:block;height:0;padding:0;overflow:hidden}.embed-responsive .embed-responsive-item,.embed-responsive iframe,.embed-responsive embed,.embed-responsive object{position:absolute;top:0;bottom:0;left:0;width:100%;height:100%;border:0}.embed-responsive.embed-responsive-16by9{padding-bottom:56.25%}.embed-responsive.embed-responsive-4by3{padding-bottom:75%}.well{min-height:20px;padding:19px;margin-bottom:20px;background-color:#f5f5f5;border:1px solid #e3e3e3;border-radius:4px;-webkit-box-shadow:inset 0 1px 1px rgba(0,0,0,.05);box-shadow:inset 0 1px 1px rgba(0,0,0,.05)}.well blockquote{border-color:#ddd;border-color:rgba(0,0,0,.15)}.well-lg{padding:24px;border-radius:6px}.well-sm{padding:9px;border-radius:3px}.close{float:right;font-size:21px;font-weight:700;line-height:1;color:#000;text-shadow:0 1px 0 #fff;filter:alpha(opacity=20);opacity:.2}.close:hover,.close:focus{color:#000;text-decoration:none;cursor:pointer;filter:alpha(opacity=50);opacity:.5}button.close{-webkit-appearance:none;padding:0;cursor:pointer;background:0 0;border:0}.modal-open{overflow:hidden}.modal{position:fixed;top:0;right:0;bottom:0;left:0;z-index:1050;display:none;overflow:hidden;-webkit-overflow-scrolling:touch;outline:0}.modal.fade .modal-dialog{-webkit-transition:-webkit-transform .3s ease-out;-o-transition:-o-transform .3s ease-out;transition:transform .3s ease-out;-webkit-transform:translate3d(0,-25%,0);-o-transform:translate3d(0,-25%,0);transform:translate3d(0,-25%,0)}.modal.in .modal-dialog{-webkit-transform:translate3d(0,0,0);-o-transform:translate3d(0,0,0);transform:translate3d(0,0,0)}.modal-open .modal{overflow-x:hidden;overflow-y:auto}.modal-dialog{position:relative;width:auto;margin:10px}.modal-content{position:relative;background-color:#fff;-webkit-background-clip:padding-box;background-clip:padding-box;border:1px solid #999;border:1px solid rgba(0,0,0,.2);border-radius:6px;outline:0;-webkit-box-shadow:0 3px 9px rgba(0,0,0,.5);box-shadow:0 3px 9px rgba(0,0,0,.5)}.modal-backdrop{position:fixed;top:0;right:0;bottom:0;left:0;z-index:1040;background-color:#000}.modal-backdrop.fade{filter:alpha(opacity=0);opacity:0}.modal-backdrop.in{filter:alpha(opacity=50);opacity:.5}.modal-header{min-height:16.43px;padding:15px;border-bottom:1px solid #e5e5e5}.modal-header .close{margin-top:-2px}.modal-title{margin:0;line-height:1.42857143}.modal-body{position:relative;padding:15px}.modal-footer{padding:15px;text-align:right;border-top:1px solid #e5e5e5}.modal-footer .btn+.btn{margin-bottom:0;margin-left:5px}.modal-footer .btn-group .btn+.btn{margin-left:-1px}.modal-footer .btn-block+.btn-block{margin-left:0}.modal-scrollbar-measure{position:absolute;top:-9999px;width:50px;height:50px;overflow:scroll}@media (min-width:768px){.modal-dialog{width:600px;margin:30px auto}.modal-content{-webkit-box-shadow:0 5px 15px rgba(0,0,0,.5);box-shadow:0 5px 15px rgba(0,0,0,.5)}.modal-sm{width:300px}}@media (min-width:992px){.modal-lg{width:900px}}.tooltip{position:absolute;z-index:1070;display:block;font-size:12px;line-height:1.4;visibility:visible;filter:alpha(opacity=0);opacity:0}.tooltip.in{filter:alpha(opacity=90);opacity:.9}.tooltip.top{padding:5px 0;margin-top:-3px}.tooltip.right{padding:0 5px;margin-left:3px}.tooltip.bottom{padding:5px 0;margin-top:3px}.tooltip.left{padding:0 5px;margin-left:-3px}.tooltip-inner{max-width:200px;padding:3px 8px;color:#fff;text-align:center;text-decoration:none;background-color:#000;border-radius:4px}.tooltip-arrow{position:absolute;width:0;height:0;border-color:transparent;border-style:solid}.tooltip.top .tooltip-arrow{bottom:0;left:50%;margin-left:-5px;border-width:5px 5px 0;border-top-color:#000}.tooltip.top-left .tooltip-arrow{bottom:0;left:5px;border-width:5px 5px 0;border-top-color:#000}.tooltip.top-right .tooltip-arrow{right:5px;bottom:0;border-width:5px 5px 0;border-top-color:#000}.tooltip.right .tooltip-arrow{top:50%;left:0;margin-top:-5px;border-width:5px 5px 5px 0;border-right-color:#000}.tooltip.left .tooltip-arrow{top:50%;right:0;margin-top:-5px;border-width:5px 0 5px 5px;border-left-color:#000}.tooltip.bottom .tooltip-arrow{top:0;left:50%;margin-left:-5px;border-width:0 5px 5px;border-bottom-color:#000}.tooltip.bottom-left .tooltip-arrow{top:0;left:5px;border-width:0 5px 5px;border-bottom-color:#000}.tooltip.bottom-right .tooltip-arrow{top:0;right:5px;border-width:0 5px 5px;border-bottom-color:#000}.popover{position:absolute;top:0;left:0;z-index:1060;display:none;max-width:276px;padding:1px;text-align:left;white-space:normal;background-color:#fff;-webkit-background-clip:padding-box;background-clip:padding-box;border:1px solid #ccc;border:1px solid rgba(0,0,0,.2);border-radius:6px;-webkit-box-shadow:0 5px 10px rgba(0,0,0,.2);box-shadow:0 5px 10px rgba(0,0,0,.2)}.popover.top{margin-top:-10px}.popover.right{margin-left:10px}.popover.bottom{margin-top:10px}.popover.left{margin-left:-10px}.popover-title{padding:8px 14px;margin:0;font-size:14px;font-weight:400;line-height:18px;background-color:#f7f7f7;border-bottom:1px solid #ebebeb;border-radius:5px 5px 0 0}.popover-content{padding:9px 14px}.popover>.arrow,.popover>.arrow:after{position:absolute;display:block;width:0;height:0;border-color:transparent;border-style:solid}.popover>.arrow{border-width:11px}.popover>.arrow:after{content:"";border-width:10px}.popover.top>.arrow{bottom:-11px;left:50%;margin-left:-11px;border-top-color:#999;border-top-color:rgba(0,0,0,.25);border-bottom-width:0}.popover.top>.arrow:after{bottom:1px;margin-left:-10px;content:" ";border-top-color:#fff;border-bottom-width:0}.popover.right>.arrow{top:50%;left:-11px;margin-top:-11px;border-right-color:#999;border-right-color:rgba(0,0,0,.25);border-left-width:0}.popover.right>.arrow:after{bottom:-10px;left:1px;content:" ";border-right-color:#fff;border-left-width:0}.popover.bottom>.arrow{top:-11px;left:50%;margin-left:-11px;border-top-width:0;border-bottom-color:#999;border-bottom-color:rgba(0,0,0,.25)}.popover.bottom>.arrow:after{top:1px;margin-left:-10px;content:" ";border-top-width:0;border-bottom-color:#fff}.popover.left>.arrow{top:50%;right:-11px;margin-top:-11px;border-right-width:0;border-left-color:#999;border-left-color:rgba(0,0,0,.25)}.popover.left>.arrow:after{right:1px;bottom:-10px;content:" ";border-right-width:0;border-left-color:#fff}.carousel{position:relative}.carousel-inner{position:relative;width:100%;overflow:hidden}.carousel-inner>.item{position:relative;display:none;-webkit-transition:.6s ease-in-out left;-o-transition:.6s ease-in-out left;transition:.6s ease-in-out left}.carousel-inner>.item>img,.carousel-inner>.item>a>img{line-height:1}.carousel-inner>.active,.carousel-inner>.next,.carousel-inner>.prev{display:block}.carousel-inner>.active{left:0}.carousel-inner>.next,.carousel-inner>.prev{position:absolute;top:0;width:100%}.carousel-inner>.next{left:100%}.carousel-inner>.prev{left:-100%}.carousel-inner>.next.left,.carousel-inner>.prev.right{left:0}.carousel-inner>.active.left{left:-100%}.carousel-inner>.active.right{left:100%}.carousel-control{position:absolute;top:0;bottom:0;left:0;width:15%;font-size:20px;color:#fff;text-align:center;text-shadow:0 1px 2px rgba(0,0,0,.6);filter:alpha(opacity=50);opacity:.5}.carousel-control.left{background-image:-webkit-linear-gradient(left,rgba(0,0,0,.5) 0,rgba(0,0,0,.0001) 100%);background-image:-o-linear-gradient(left,rgba(0,0,0,.5) 0,rgba(0,0,0,.0001) 100%);background-image:-webkit-gradient(linear,left top,right top,from(rgba(0,0,0,.5)),to(rgba(0,0,0,.0001)));background-image:linear-gradient(to right,rgba(0,0,0,.5) 0,rgba(0,0,0,.0001) 100%);filter:progid:DXImageTransform.Microsoft.gradient(startColorstr='#80000000', endColorstr='#00000000', GradientType=1);background-repeat:repeat-x}.carousel-control.right{right:0;left:auto;background-image:-webkit-linear-gradient(left,rgba(0,0,0,.0001) 0,rgba(0,0,0,.5) 100%);background-image:-o-linear-gradient(left,rgba(0,0,0,.0001) 0,rgba(0,0,0,.5) 100%);background-image:-webkit-gradient(linear,left top,right top,from(rgba(0,0,0,.0001)),to(rgba(0,0,0,.5)));background-image:linear-gradient(to right,rgba(0,0,0,.0001) 0,rgba(0,0,0,.5) 100%);filter:progid:DXImageTransform.Microsoft.gradient(startColorstr='#00000000', endColorstr='#80000000', GradientType=1);background-repeat:repeat-x}.carousel-control:hover,.carousel-control:focus{color:#fff;text-decoration:none;filter:alpha(opacity=90);outline:0;opacity:.9}.carousel-control .icon-prev,.carousel-control .icon-next,.carousel-control .glyphicon-chevron-left,.carousel-control .glyphicon-chevron-right{position:absolute;top:50%;z-index:5;display:inline-block}.carousel-control .icon-prev,.carousel-control .glyphicon-chevron-left{left:50%;margin-left:-10px}.carousel-control .icon-next,.carousel-control .glyphicon-chevron-right{right:50%;margin-right:-10px}.carousel-control .icon-prev,.carousel-control .icon-next{width:20px;height:20px;margin-top:-10px;font-family:serif}.carousel-control .icon-prev:before{content:'\2039'}.carousel-control .icon-next:before{content:'\203a'}.carousel-indicators{position:absolute;bottom:10px;left:50%;z-index:15;width:60%;padding-left:0;margin-left:-30%;text-align:center;list-style:none}.carousel-indicators li{display:inline-block;width:10px;height:10px;margin:1px;text-indent:-999px;cursor:pointer;background-color:#000 \9;background-color:rgba(0,0,0,0);border:1px solid #fff;border-radius:10px}.carousel-indicators .active{width:12px;height:12px;margin:0;background-color:#fff}.carousel-caption{position:absolute;right:15%;bottom:20px;left:15%;z-index:10;padding-top:20px;padding-bottom:20px;color:#fff;text-align:center;text-shadow:0 1px 2px rgba(0,0,0,.6)}.carousel-caption .btn{text-shadow:none}@media screen and (min-width:768px){.carousel-control .glyphicon-chevron-left,.carousel-control .glyphicon-chevron-right,.carousel-control .icon-prev,.carousel-control .icon-next{width:30px;height:30px;margin-top:-15px;font-size:30px}.carousel-control .glyphicon-chevron-left,.carousel-control .icon-prev{margin-left:-15px}.carousel-control .glyphicon-chevron-right,.carousel-control .icon-next{margin-right:-15px}.carousel-caption{right:20%;left:20%;padding-bottom:30px}.carousel-indicators{bottom:20px}}.clearfix:before,.clearfix:after,.dl-horizontal dd:before,.dl-horizontal dd:after,.container:before,.container:after,.container-fluid:before,.container-fluid:after,.row:before,.row:after,.form-horizontal .form-group:before,.form-horizontal .form-group:after,.btn-toolbar:before,.btn-toolbar:after,.btn-group-vertical>.btn-group:before,.btn-group-vertical>.btn-group:after,.nav:before,.nav:after,.navbar:before,.navbar:after,.navbar-header:before,.navbar-header:after,.navbar-collapse:before,.navbar-collapse:after,.pager:before,.pager:after,.panel-body:before,.panel-body:after,.modal-footer:before,.modal-footer:after{display:table;content:" "}.clearfix:after,.dl-horizontal dd:after,.container:after,.container-fluid:after,.row:after,.form-horizontal .form-group:after,.btn-toolbar:after,.btn-group-vertical>.btn-group:after,.nav:after,.navbar:after,.navbar-header:after,.navbar-collapse:after,.pager:after,.panel-body:after,.modal-footer:after{clear:both}.center-block{display:block;margin-right:auto;margin-left:auto}.pull-right{float:right!important}.pull-left{float:left!important}.hide{display:none!important}.show{display:block!important}.invisible{visibility:hidden}.text-hide{font:0/0 a;color:transparent;text-shadow:none;background-color:transparent;border:0}.hidden{display:none!important;visibility:hidden!important}.affix{position:fixed;-webkit-transform:translate3d(0,0,0);-o-transform:translate3d(0,0,0);transform:translate3d(0,0,0)}@-ms-viewport{width:device-width}.visible-xs,.visible-sm,.visible-md,.visible-lg{display:none!important}.visible-xs-block,.visible-xs-inline,.visible-xs-inline-block,.visible-sm-block,.visible-sm-inline,.visible-sm-inline-block,.visible-md-block,.visible-md-inline,.visible-md-inline-block,.visible-lg-block,.visible-lg-inline,.visible-lg-inline-block{display:none!important}@media (max-width:767px){.visible-xs{display:block!important}table.visible-xs{display:table}tr.visible-xs{display:table-row!important}th.visible-xs,td.visible-xs{display:table-cell!important}}@media (max-width:767px){.visible-xs-block{display:block!important}}@media (max-width:767px){.visible-xs-inline{display:inline!important}}@media (max-width:767px){.visible-xs-inline-block{display:inline-block!important}}@media (min-width:768px) and (max-width:991px){.visible-sm{display:block!important}table.visible-sm{display:table}tr.visible-sm{display:table-row!important}th.visible-sm,td.visible-sm{display:table-cell!important}}@media (min-width:768px) and (max-width:991px){.visible-sm-block{display:block!important}}@media (min-width:768px) and (max-width:991px){.visible-sm-inline{display:inline!important}}@media (min-width:768px) and (max-width:991px){.visible-sm-inline-block{display:inline-block!important}}@media (min-width:992px) and (max-width:1199px){.visible-md{display:block!important}table.visible-md{display:table}tr.visible-md{display:table-row!important}th.visible-md,td.visible-md{display:table-cell!important}}@media (min-width:992px) and (max-width:1199px){.visible-md-block{display:block!important}}@media (min-width:992px) and (max-width:1199px){.visible-md-inline{display:inline!important}}@media (min-width:992px) and (max-width:1199px){.visible-md-inline-block{display:inline-block!important}}@media (min-width:1200px){.visible-lg{display:block!important}table.visible-lg{display:table}tr.visible-lg{display:table-row!important}th.visible-lg,td.visible-lg{display:table-cell!important}}@media (min-width:1200px){.visible-lg-block{display:block!important}}@media (min-width:1200px){.visible-lg-inline{display:inline!important}}@media (min-width:1200px){.visible-lg-inline-block{display:inline-block!important}}@media (max-width:767px){.hidden-xs{display:none!important}}@media (min-width:768px) and (max-width:991px){.hidden-sm{display:none!important}}@media (min-width:992px) and (max-width:1199px){.hidden-md{display:none!important}}@media (min-width:1200px){.hidden-lg{display:none!important}}.visible-print{display:none!important}@media print{.visible-print{display:block!important}table.visible-print{display:table}tr.visible-print{display:table-row!important}th.visible-print,td.visible-print{display:table-cell!important}}.visible-print-block{display:none!important}@media print{.visible-print-block{display:block!important}}.visible-print-inline{display:none!important}@media print{.visible-print-inline{display:inline!important}}.visible-print-inline-block{display:none!important}@media print{.visible-print-inline-block{display:inline-block!important}}@media print{.hidden-print{display:none!important}}</style>
<meta content="Mnemonic code for generating deterministic keys" name="description"/>
<meta content="width=device-width, initial-scale=1.0" name="viewport" />
<meta content="bitcoin mnemonic converter" name="description" />
- <meta content="DC POS" name="author" />
+ <meta content="Ian Coleman" name="author" />
<style>
body {
border-bottom-left-radius: 20px 20px;
border-bottom-right-radius: 20px 20px;
}
+ .no-border {
+ border: 0;
+ box-shadow: inset 0 1px 1px rgba(0,0,0,.0);
+ -webkit-box-shadow: inset 0 1px 1px rgba(0,0,0,.0);
+ }
+ .phrase {
+ word-break: keep-all;
+ }
+ .strength {
+ /* override mobile width from bootstrap */
+ width: auto!important;
+ display: inline-block;
+ }
+ .languages * {
+ padding-left: 10px;
+ }
+ .monospace {
+ font-family: monospace;
+ }
</style>
</head>
<body>
<div class="col-md-12">
<h2>Mnemonic</h2>
<form class="form-horizontal" role="form">
- <div class="col-sm-2"></div>
- <div class="col-sm-10">
- <p>You can enter an existing BIP39 mnemonic, or generate a new random one. Typing your own twelve words will probably not work how you expect, since the words require a particular structure (the last word is a checksum)</p>
- <p>For more info see the <a href="https://github.com/bitcoin/bips/blob/master/bip-0039.mediawiki" target="_blank">BIP39 spec</a></p>
+ <div class="form-group">
+ <div class="col-sm-2"></div>
+ <div class="col-sm-10">
+ <p>You can enter an existing BIP39 mnemonic, or generate a new random one. Typing your own twelve words will probably not work how you expect, since the words require a particular structure (the last word is a checksum)</p>
+ <p>For more info see the <a href="https://github.com/bitcoin/bips/blob/master/bip-0039.mediawiki" target="_blank">BIP39 spec</a></p>
+ </div>
+ </div>
+ <div class="form-group generate-container">
+ <label class="col-sm-2 control-label"></label>
+ <div class="col-sm-10">
+ <div class="form-inline">
+ <div class="input-group-inline">
+ <button class="btn generate">Generate</button>
+ <span>a random</span>
+ <select id="strength" class="strength form-control">
+ <option value="3">3</option>
+ <option value="6">6</option>
+ <option value="9">9</option>
+ <option value="12">12</option>
+ <option value="15" selected>15</option>
+ <option value="18">18</option>
+ <option value="21">21</option>
+ <option value="24">24</option>
+ </select>
+ word mnemonic, or enter your own below.
+ </div>
+ </div>
+ </div>
+ </div>
+ <div class="entropy-container hidden">
+ <label for="entropy" class="col-sm-2 control-label">Entropy</label>
+ <div class="col-sm-10">
+ <input id="entropy" class="entropy form-control" placeholder="Accepts binary, base 6, 6-sided dice, base 10, hexadecimal">
+ <span class="help-block">
+ <div class="text-danger">
+ This is an advanced feature.
+ Your mnemonic may be insecure if this feature is used incorrectly.
+ <a href="#entropy-notes">Read more</a>
+ </div>
+ <div class="text-danger entropy-error"></div>
+ </span>
+ </div>
+ </div>
+ <div class="form-group">
+ <div class="col-sm-2"></div>
+ <div class="col-sm-10 checkbox">
+ <label>
+ <input type="checkbox" class="use-entropy">
+ Supply my own source of entropy
+ </label>
+ </div>
+ </div>
+ <div class="form-group">
+ <label class="col-sm-2 control-label"></label>
+ <div class="col-sm-10 languages">
+ <a href="#english">English</a>
+ <a href="#japanese" title="Japanese">日本語</a>
+ <a href="#spanish" title="Spanish">Español</a>
+ <a href="#chinese_simplified" title="Chinese (Simplified)">中文(简体)</a>
+ <a href="#chinese_traditional" title="Chinese (Traditional)">中文(繁體)</a>
+ <a href="#french" title="French">Français</a>
+ <a href="#italian" title="Italian">Italiano</a>
+ </div>
</div>
<div class="form-group">
<label for="phrase" class="col-sm-2 control-label">BIP39 Mnemonic</label>
</div>
</div>
<div class="form-group">
- <label for="strength" class="col-sm-2 control-label">Number of words</label>
+ <label for="passphrase" class="col-sm-2 control-label">BIP39 Passphrase (optional)</label>
<div class="col-sm-10">
- <div class="input-group">
- <input type="number" class="strength form-control" id="strength" value="12">
- <span class="input-group-btn">
- <button class="btn generate">Generate Random Mnemonic</button>
- </span>
- </div>
+ <textarea id="passphrase" class="passphrase form-control"></textarea>
</div>
</div>
<div class="form-group">
- <label for="passphrase" class="col-sm-2 control-label">BIP39 Passphrase (optional)</label>
+ <label for="seed" class="col-sm-2 control-label">BIP39 Seed</label>
<div class="col-sm-10">
- <textarea id="passphrase" class="passphrase form-control"></textarea>
+ <textarea id="seed" class="seed form-control" readonly="readonly"></textarea>
+ </div>
+ </div>
+ <div class="form-group">
+ <label for="network-phrase" class="col-sm-2 control-label">Coin</label>
+ <div class="col-sm-10">
+ <select id="network-phrase" class="network form-control">
+ <!-- populated by javascript -->
+ </select>
</div>
</div>
<div class="form-group">
<label for="root-key" class="col-sm-2 control-label">BIP32 Root Key</label>
<div class="col-sm-10">
- <textarea id="root-key" class="root-key form-control" readonly="readonly"></textarea>
+ <textarea id="root-key" class="root-key form-control"></textarea>
</div>
</div>
</form>
<div class="col-md-12">
<h2>Derivation Path</h2>
<ul class="derivation-type nav nav-tabs" role="tablist">
- <li class="active">
- <a href="#bip44" role="tab" data-toggle="tab">BIP44</a></li>
- <li><a href="#bip32" role="tab" data-toggle="tab">BIP32</a></li>
+ <li id="bip44-tab" class="active">
+ <a href="#bip44" role="tab" data-toggle="tab">BIP44</a>
+ </li>
+ <li id="bip32-tab">
+ <a href="#bip32" role="tab" data-toggle="tab">BIP32</a>
+ </li>
</ul>
<div class="derivation-type tab-content">
<div id="bip44" class="tab-pane active">
<input id="bip32-path" type="text" class="path form-control" value="m/0">
</div>
</div>
+ <div class="form-group">
+ <div class="col-sm-2"></div>
+ <label class="col-sm-10">
+ <input class="hardened-addresses" type="checkbox">
+ Use hardened addresses
+ </label>
+ </div>
+ <div class="form-group">
+ <label class="col-sm-2 control-label">Hive Wallet</label>
+ <div class="col-sm-10">
+ <p class="form-control no-border">
+ Use path <code>m/0'/0</code>.
+ For more info see the <a href="https://www.hivewallet.com/" target="_blank">Hive Wallet homepage</a>
+ </p>
+ </div>
+ </div>
+ <div class="form-group">
+ <label for="mycelium-path" class="col-sm-2 control-label">Mycelium Wallet</label>
+ <div class="col-sm-10">
+ <p class="form-control no-border">
+ Use path <code>m/44'/0'/0'/0</code>.
+ For more info see the <a href="http://www.mycelium.com/" target="_blank">Mycelium Wallet homepage</a>
+ </p>
+ </div>
+ </div>
+ <div class="form-group">
+ <label for="core-path" class="col-sm-2 control-label">Bitcoin Core</label>
+ <div class="col-sm-10">
+ <p class="form-control no-border">
+ Use path <code>m/0'/0'</code> with hardened addresses.
+ For more info see the <a href="https://github.com/bitcoin/bitcoin/pull/8035" target="_blank">Bitcoin Core BIP32 implementation</a>
+ </p>
+ </div>
+ </div>
+ <div class="form-group">
+ <label class="col-sm-2 control-label">Block Explorers</label>
+ <div class="col-sm-10">
+ <p class="form-control no-border">
+ Use path <code>m/44'/0'/0'</code>.
+ Only enter the <code>xpub</code> extended key into block explorer search fields, never the <code>xpriv</code> key.
+ </p>
+ </div>
+ </div>
</form>
</div>
</div>
<thead>
<th>
<div class="input-group">
- Index
+ Path
<button class="index-toggle">Toggle</button>
</div>
</th>
<button class="address-toggle">Toggle</button>
</div>
</th>
+ <th>
+ <div class="input-group">
+ Public Key
+ <button class="public-key-toggle">Toggle</button>
+ </div>
+ </th>
<th>
<div class="input-group">
Private Key
</div>
</th>
</thead>
- <tbody class="addresses">
+ <tbody class="addresses monospace">
<tr><td> </td><td> </td><td> </td></tr>
<tr><td> </td><td> </td><td> </td></tr>
<tr><td> </td><td> </td><td> </td></tr>
<h3>Private Keys</h3>
<p>
Use private keys at
- <a href="https://brainwallet.github.io/" target="_blank">brainwallet.org</a>,
+ <a href="https://web.archive.org/web/20150707020924/https://brainwallet.org/" target="_blank">brainwallet.org</a>,
but be careful - it can be easy to make mistakes if you
don't know what you're doing
</p>
+ <h3 id="entropy-notes">Entropy</h3>
+ <p>
+ Entropy values must be sourced from a
+ <a href="https://en.wikipedia.org/wiki/Random_number_generation" target="_blank">strong source of randomness</a>.
+ This means flipping a fair coin, rolling a fair dice, noise measurements etc. Do <strong>NOT</strong> use
+ phrases from books, lyrics from songs, your birthday or steet address, keyboard mashing, or anything you <i>think</i>
+ is random, because chances are <em>overwhelming</em> that it isn't random enough for the needs of this tool.
+ </p>
+ <p>
+ The random mnemonic generator on this page uses a
+ <a href="https://developer.mozilla.org/en-US/docs/Web/API/RandomSource/getRandomValues" target="_blank">cryptographically secure random number generator</a>,
+ and can generally be trusted more than your own intuition about randomness.
+ If cryptographic randomness isn't available in your browser, this page will show a warning and <i>will not generate
+ random mnemonics</i>.
+ </p>
+ <p>
+ <a href="https://bitcointalk.org/index.php?topic=311000.msg3345309#msg3345309" target="_blank">You are not a good source of entropy.</a>
+ </p>
</div>
</div>
</p>
<p>
Alternatively, download it from
- <a href="https://github.com/dcpos/bip39">
- https://github.com/dcpos/bip39
+ <a href="https://github.com/iancoleman/bip39">
+ https://github.com/iancoleman/bip39
</a>
</div>
<p>
<span>Get the source code at - </span>
- <a href="https://github.com/dcpos/bip39" target="_blank">
- https://github.com/dcpos/bip39
+ <a href="https://github.com/iancoleman/bip39" target="_blank">
+ https://github.com/iancoleman/bip39
</a>
</p>
</p>
<p>
- <span>asmCrypto - </span>
- <a href="https://github.com/vibornoff/asmcrypto.js" target="_blank">
- https://github.com/vibornoff/asmcrypto.js
+ <span>sjcl - </span>
+ <a href="https://github.com/bitwiseshiftleft/sjcl" target="_blank">
+ https://github.com/bitwiseshiftleft/sjcl
</a>
</p>
<tr>
<td class="index"><span></span></td>
<td class="address"><span></span></td>
+ <td class="pubkey"><span></span></td>
<td class="privkey"><span></span></td>
</tr>
</script>
-
- <!--<script src="//ajax.googleapis.com/ajax/libs/jquery/2.1.1/jquery.min.js"></script>-->
- <script>
-/*! jQuery v2.1.1 | (c) 2005, 2014 jQuery Foundation, Inc. | jquery.org/license */
+ <script>/*! jQuery v2.1.1 | (c) 2005, 2014 jQuery Foundation, Inc. | jquery.org/license */
!function(a,b){"object"==typeof module&&"object"==typeof module.exports?module.exports=a.document?b(a,!0):function(a){if(!a.document)throw new Error("jQuery requires a window with a document");return b(a)}:b(a)}("undefined"!=typeof window?window:this,function(a,b){var c=[],d=c.slice,e=c.concat,f=c.push,g=c.indexOf,h={},i=h.toString,j=h.hasOwnProperty,k={},l=a.document,m="2.1.1",n=function(a,b){return new n.fn.init(a,b)},o=/^[\s\uFEFF\xA0]+|[\s\uFEFF\xA0]+$/g,p=/^-ms-/,q=/-([\da-z])/gi,r=function(a,b){return b.toUpperCase()};n.fn=n.prototype={jquery:m,constructor:n,selector:"",length:0,toArray:function(){return d.call(this)},get:function(a){return null!=a?0>a?this[a+this.length]:this[a]:d.call(this)},pushStack:function(a){var b=n.merge(this.constructor(),a);return b.prevObject=this,b.context=this.context,b},each:function(a,b){return n.each(this,a,b)},map:function(a){return this.pushStack(n.map(this,function(b,c){return a.call(b,c,b)}))},slice:function(){return this.pushStack(d.apply(this,arguments))},first:function(){return this.eq(0)},last:function(){return this.eq(-1)},eq:function(a){var b=this.length,c=+a+(0>a?b:0);return this.pushStack(c>=0&&b>c?[this[c]]:[])},end:function(){return this.prevObject||this.constructor(null)},push:f,sort:c.sort,splice:c.splice},n.extend=n.fn.extend=function(){var a,b,c,d,e,f,g=arguments[0]||{},h=1,i=arguments.length,j=!1;for("boolean"==typeof g&&(j=g,g=arguments[h]||{},h++),"object"==typeof g||n.isFunction(g)||(g={}),h===i&&(g=this,h--);i>h;h++)if(null!=(a=arguments[h]))for(b in a)c=g[b],d=a[b],g!==d&&(j&&d&&(n.isPlainObject(d)||(e=n.isArray(d)))?(e?(e=!1,f=c&&n.isArray(c)?c:[]):f=c&&n.isPlainObject(c)?c:{},g[b]=n.extend(j,f,d)):void 0!==d&&(g[b]=d));return g},n.extend({expando:"jQuery"+(m+Math.random()).replace(/\D/g,""),isReady:!0,error:function(a){throw new Error(a)},noop:function(){},isFunction:function(a){return"function"===n.type(a)},isArray:Array.isArray,isWindow:function(a){return null!=a&&a===a.window},isNumeric:function(a){return!n.isArray(a)&&a-parseFloat(a)>=0},isPlainObject:function(a){return"object"!==n.type(a)||a.nodeType||n.isWindow(a)?!1:a.constructor&&!j.call(a.constructor.prototype,"isPrototypeOf")?!1:!0},isEmptyObject:function(a){var b;for(b in a)return!1;return!0},type:function(a){return null==a?a+"":"object"==typeof a||"function"==typeof a?h[i.call(a)]||"object":typeof a},globalEval:function(a){var b,c=eval;a=n.trim(a),a&&(1===a.indexOf("use strict")?(b=l.createElement("script"),b.text=a,l.head.appendChild(b).parentNode.removeChild(b)):c(a))},camelCase:function(a){return a.replace(p,"ms-").replace(q,r)},nodeName:function(a,b){return a.nodeName&&a.nodeName.toLowerCase()===b.toLowerCase()},each:function(a,b,c){var d,e=0,f=a.length,g=s(a);if(c){if(g){for(;f>e;e++)if(d=b.apply(a[e],c),d===!1)break}else for(e in a)if(d=b.apply(a[e],c),d===!1)break}else if(g){for(;f>e;e++)if(d=b.call(a[e],e,a[e]),d===!1)break}else for(e in a)if(d=b.call(a[e],e,a[e]),d===!1)break;return a},trim:function(a){return null==a?"":(a+"").replace(o,"")},makeArray:function(a,b){var c=b||[];return null!=a&&(s(Object(a))?n.merge(c,"string"==typeof a?[a]:a):f.call(c,a)),c},inArray:function(a,b,c){return null==b?-1:g.call(b,a,c)},merge:function(a,b){for(var c=+b.length,d=0,e=a.length;c>d;d++)a[e++]=b[d];return a.length=e,a},grep:function(a,b,c){for(var d,e=[],f=0,g=a.length,h=!c;g>f;f++)d=!b(a[f],f),d!==h&&e.push(a[f]);return e},map:function(a,b,c){var d,f=0,g=a.length,h=s(a),i=[];if(h)for(;g>f;f++)d=b(a[f],f,c),null!=d&&i.push(d);else for(f in a)d=b(a[f],f,c),null!=d&&i.push(d);return e.apply([],i)},guid:1,proxy:function(a,b){var c,e,f;return"string"==typeof b&&(c=a[b],b=a,a=c),n.isFunction(a)?(e=d.call(arguments,2),f=function(){return a.apply(b||this,e.concat(d.call(arguments)))},f.guid=a.guid=a.guid||n.guid++,f):void 0},now:Date.now,support:k}),n.each("Boolean Number String Function Array Date RegExp Object Error".split(" "),function(a,b){h["[object "+b+"]"]=b.toLowerCase()});function s(a){var b=a.length,c=n.type(a);return"function"===c||n.isWindow(a)?!1:1===a.nodeType&&b?!0:"array"===c||0===b||"number"==typeof b&&b>0&&b-1 in a}var t=function(a){var b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t,u="sizzle"+-new Date,v=a.document,w=0,x=0,y=gb(),z=gb(),A=gb(),B=function(a,b){return a===b&&(l=!0),0},C="undefined",D=1<<31,E={}.hasOwnProperty,F=[],G=F.pop,H=F.push,I=F.push,J=F.slice,K=F.indexOf||function(a){for(var b=0,c=this.length;c>b;b++)if(this[b]===a)return b;return-1},L="checked|selected|async|autofocus|autoplay|controls|defer|disabled|hidden|ismap|loop|multiple|open|readonly|required|scoped",M="[\\x20\\t\\r\\n\\f]",N="(?:\\\\.|[\\w-]|[^\\x00-\\xa0])+",O=N.replace("w","w#"),P="\\["+M+"*("+N+")(?:"+M+"*([*^$|!~]?=)"+M+"*(?:'((?:\\\\.|[^\\\\'])*)'|\"((?:\\\\.|[^\\\\\"])*)\"|("+O+"))|)"+M+"*\\]",Q=":("+N+")(?:\\((('((?:\\\\.|[^\\\\'])*)'|\"((?:\\\\.|[^\\\\\"])*)\")|((?:\\\\.|[^\\\\()[\\]]|"+P+")*)|.*)\\)|)",R=new RegExp("^"+M+"+|((?:^|[^\\\\])(?:\\\\.)*)"+M+"+$","g"),S=new RegExp("^"+M+"*,"+M+"*"),T=new RegExp("^"+M+"*([>+~]|"+M+")"+M+"*"),U=new RegExp("="+M+"*([^\\]'\"]*?)"+M+"*\\]","g"),V=new RegExp(Q),W=new RegExp("^"+O+"$"),X={ID:new RegExp("^#("+N+")"),CLASS:new RegExp("^\\.("+N+")"),TAG:new RegExp("^("+N.replace("w","w*")+")"),ATTR:new RegExp("^"+P),PSEUDO:new RegExp("^"+Q),CHILD:new RegExp("^:(only|first|last|nth|nth-last)-(child|of-type)(?:\\("+M+"*(even|odd|(([+-]|)(\\d*)n|)"+M+"*(?:([+-]|)"+M+"*(\\d+)|))"+M+"*\\)|)","i"),bool:new RegExp("^(?:"+L+")$","i"),needsContext:new RegExp("^"+M+"*[>+~]|:(even|odd|eq|gt|lt|nth|first|last)(?:\\("+M+"*((?:-\\d)?\\d*)"+M+"*\\)|)(?=[^-]|$)","i")},Y=/^(?:input|select|textarea|button)$/i,Z=/^h\d$/i,$=/^[^{]+\{\s*\[native \w/,_=/^(?:#([\w-]+)|(\w+)|\.([\w-]+))$/,ab=/[+~]/,bb=/'|\\/g,cb=new RegExp("\\\\([\\da-f]{1,6}"+M+"?|("+M+")|.)","ig"),db=function(a,b,c){var d="0x"+b-65536;return d!==d||c?b:0>d?String.fromCharCode(d+65536):String.fromCharCode(d>>10|55296,1023&d|56320)};try{I.apply(F=J.call(v.childNodes),v.childNodes),F[v.childNodes.length].nodeType}catch(eb){I={apply:F.length?function(a,b){H.apply(a,J.call(b))}:function(a,b){var c=a.length,d=0;while(a[c++]=b[d++]);a.length=c-1}}}function fb(a,b,d,e){var f,h,j,k,l,o,r,s,w,x;if((b?b.ownerDocument||b:v)!==n&&m(b),b=b||n,d=d||[],!a||"string"!=typeof a)return d;if(1!==(k=b.nodeType)&&9!==k)return[];if(p&&!e){if(f=_.exec(a))if(j=f[1]){if(9===k){if(h=b.getElementById(j),!h||!h.parentNode)return d;if(h.id===j)return d.push(h),d}else if(b.ownerDocument&&(h=b.ownerDocument.getElementById(j))&&t(b,h)&&h.id===j)return d.push(h),d}else{if(f[2])return I.apply(d,b.getElementsByTagName(a)),d;if((j=f[3])&&c.getElementsByClassName&&b.getElementsByClassName)return I.apply(d,b.getElementsByClassName(j)),d}if(c.qsa&&(!q||!q.test(a))){if(s=r=u,w=b,x=9===k&&a,1===k&&"object"!==b.nodeName.toLowerCase()){o=g(a),(r=b.getAttribute("id"))?s=r.replace(bb,"\\$&"):b.setAttribute("id",s),s="[id='"+s+"'] ",l=o.length;while(l--)o[l]=s+qb(o[l]);w=ab.test(a)&&ob(b.parentNode)||b,x=o.join(",")}if(x)try{return I.apply(d,w.querySelectorAll(x)),d}catch(y){}finally{r||b.removeAttribute("id")}}}return i(a.replace(R,"$1"),b,d,e)}function gb(){var a=[];function b(c,e){return a.push(c+" ")>d.cacheLength&&delete b[a.shift()],b[c+" "]=e}return b}function hb(a){return a[u]=!0,a}function ib(a){var b=n.createElement("div");try{return!!a(b)}catch(c){return!1}finally{b.parentNode&&b.parentNode.removeChild(b),b=null}}function jb(a,b){var c=a.split("|"),e=a.length;while(e--)d.attrHandle[c[e]]=b}function kb(a,b){var c=b&&a,d=c&&1===a.nodeType&&1===b.nodeType&&(~b.sourceIndex||D)-(~a.sourceIndex||D);if(d)return d;if(c)while(c=c.nextSibling)if(c===b)return-1;return a?1:-1}function lb(a){return function(b){var c=b.nodeName.toLowerCase();return"input"===c&&b.type===a}}function mb(a){return function(b){var c=b.nodeName.toLowerCase();return("input"===c||"button"===c)&&b.type===a}}function nb(a){return hb(function(b){return b=+b,hb(function(c,d){var e,f=a([],c.length,b),g=f.length;while(g--)c[e=f[g]]&&(c[e]=!(d[e]=c[e]))})})}function ob(a){return a&&typeof a.getElementsByTagName!==C&&a}c=fb.support={},f=fb.isXML=function(a){var b=a&&(a.ownerDocument||a).documentElement;return b?"HTML"!==b.nodeName:!1},m=fb.setDocument=function(a){var b,e=a?a.ownerDocument||a:v,g=e.defaultView;return e!==n&&9===e.nodeType&&e.documentElement?(n=e,o=e.documentElement,p=!f(e),g&&g!==g.top&&(g.addEventListener?g.addEventListener("unload",function(){m()},!1):g.attachEvent&&g.attachEvent("onunload",function(){m()})),c.attributes=ib(function(a){return a.className="i",!a.getAttribute("className")}),c.getElementsByTagName=ib(function(a){return a.appendChild(e.createComment("")),!a.getElementsByTagName("*").length}),c.getElementsByClassName=$.test(e.getElementsByClassName)&&ib(function(a){return a.innerHTML="<div class='a'></div><div class='a i'></div>",a.firstChild.className="i",2===a.getElementsByClassName("i").length}),c.getById=ib(function(a){return o.appendChild(a).id=u,!e.getElementsByName||!e.getElementsByName(u).length}),c.getById?(d.find.ID=function(a,b){if(typeof b.getElementById!==C&&p){var c=b.getElementById(a);return c&&c.parentNode?[c]:[]}},d.filter.ID=function(a){var b=a.replace(cb,db);return function(a){return a.getAttribute("id")===b}}):(delete d.find.ID,d.filter.ID=function(a){var b=a.replace(cb,db);return function(a){var c=typeof a.getAttributeNode!==C&&a.getAttributeNode("id");return c&&c.value===b}}),d.find.TAG=c.getElementsByTagName?function(a,b){return typeof b.getElementsByTagName!==C?b.getElementsByTagName(a):void 0}:function(a,b){var c,d=[],e=0,f=b.getElementsByTagName(a);if("*"===a){while(c=f[e++])1===c.nodeType&&d.push(c);return d}return f},d.find.CLASS=c.getElementsByClassName&&function(a,b){return typeof b.getElementsByClassName!==C&&p?b.getElementsByClassName(a):void 0},r=[],q=[],(c.qsa=$.test(e.querySelectorAll))&&(ib(function(a){a.innerHTML="<select msallowclip=''><option selected=''></option></select>",a.querySelectorAll("[msallowclip^='']").length&&q.push("[*^$]="+M+"*(?:''|\"\")"),a.querySelectorAll("[selected]").length||q.push("\\["+M+"*(?:value|"+L+")"),a.querySelectorAll(":checked").length||q.push(":checked")}),ib(function(a){var b=e.createElement("input");b.setAttribute("type","hidden"),a.appendChild(b).setAttribute("name","D"),a.querySelectorAll("[name=d]").length&&q.push("name"+M+"*[*^$|!~]?="),a.querySelectorAll(":enabled").length||q.push(":enabled",":disabled"),a.querySelectorAll("*,:x"),q.push(",.*:")})),(c.matchesSelector=$.test(s=o.matches||o.webkitMatchesSelector||o.mozMatchesSelector||o.oMatchesSelector||o.msMatchesSelector))&&ib(function(a){c.disconnectedMatch=s.call(a,"div"),s.call(a,"[s!='']:x"),r.push("!=",Q)}),q=q.length&&new RegExp(q.join("|")),r=r.length&&new RegExp(r.join("|")),b=$.test(o.compareDocumentPosition),t=b||$.test(o.contains)?function(a,b){var c=9===a.nodeType?a.documentElement:a,d=b&&b.parentNode;return a===d||!(!d||1!==d.nodeType||!(c.contains?c.contains(d):a.compareDocumentPosition&&16&a.compareDocumentPosition(d)))}:function(a,b){if(b)while(b=b.parentNode)if(b===a)return!0;return!1},B=b?function(a,b){if(a===b)return l=!0,0;var d=!a.compareDocumentPosition-!b.compareDocumentPosition;return d?d:(d=(a.ownerDocument||a)===(b.ownerDocument||b)?a.compareDocumentPosition(b):1,1&d||!c.sortDetached&&b.compareDocumentPosition(a)===d?a===e||a.ownerDocument===v&&t(v,a)?-1:b===e||b.ownerDocument===v&&t(v,b)?1:k?K.call(k,a)-K.call(k,b):0:4&d?-1:1)}:function(a,b){if(a===b)return l=!0,0;var c,d=0,f=a.parentNode,g=b.parentNode,h=[a],i=[b];if(!f||!g)return a===e?-1:b===e?1:f?-1:g?1:k?K.call(k,a)-K.call(k,b):0;if(f===g)return kb(a,b);c=a;while(c=c.parentNode)h.unshift(c);c=b;while(c=c.parentNode)i.unshift(c);while(h[d]===i[d])d++;return d?kb(h[d],i[d]):h[d]===v?-1:i[d]===v?1:0},e):n},fb.matches=function(a,b){return fb(a,null,null,b)},fb.matchesSelector=function(a,b){if((a.ownerDocument||a)!==n&&m(a),b=b.replace(U,"='$1']"),!(!c.matchesSelector||!p||r&&r.test(b)||q&&q.test(b)))try{var d=s.call(a,b);if(d||c.disconnectedMatch||a.document&&11!==a.document.nodeType)return d}catch(e){}return fb(b,n,null,[a]).length>0},fb.contains=function(a,b){return(a.ownerDocument||a)!==n&&m(a),t(a,b)},fb.attr=function(a,b){(a.ownerDocument||a)!==n&&m(a);var e=d.attrHandle[b.toLowerCase()],f=e&&E.call(d.attrHandle,b.toLowerCase())?e(a,b,!p):void 0;return void 0!==f?f:c.attributes||!p?a.getAttribute(b):(f=a.getAttributeNode(b))&&f.specified?f.value:null},fb.error=function(a){throw new Error("Syntax error, unrecognized expression: "+a)},fb.uniqueSort=function(a){var b,d=[],e=0,f=0;if(l=!c.detectDuplicates,k=!c.sortStable&&a.slice(0),a.sort(B),l){while(b=a[f++])b===a[f]&&(e=d.push(f));while(e--)a.splice(d[e],1)}return k=null,a},e=fb.getText=function(a){var b,c="",d=0,f=a.nodeType;if(f){if(1===f||9===f||11===f){if("string"==typeof a.textContent)return a.textContent;for(a=a.firstChild;a;a=a.nextSibling)c+=e(a)}else if(3===f||4===f)return a.nodeValue}else while(b=a[d++])c+=e(b);return c},d=fb.selectors={cacheLength:50,createPseudo:hb,match:X,attrHandle:{},find:{},relative:{">":{dir:"parentNode",first:!0}," ":{dir:"parentNode"},"+":{dir:"previousSibling",first:!0},"~":{dir:"previousSibling"}},preFilter:{ATTR:function(a){return a[1]=a[1].replace(cb,db),a[3]=(a[3]||a[4]||a[5]||"").replace(cb,db),"~="===a[2]&&(a[3]=" "+a[3]+" "),a.slice(0,4)},CHILD:function(a){return a[1]=a[1].toLowerCase(),"nth"===a[1].slice(0,3)?(a[3]||fb.error(a[0]),a[4]=+(a[4]?a[5]+(a[6]||1):2*("even"===a[3]||"odd"===a[3])),a[5]=+(a[7]+a[8]||"odd"===a[3])):a[3]&&fb.error(a[0]),a},PSEUDO:function(a){var b,c=!a[6]&&a[2];return X.CHILD.test(a[0])?null:(a[3]?a[2]=a[4]||a[5]||"":c&&V.test(c)&&(b=g(c,!0))&&(b=c.indexOf(")",c.length-b)-c.length)&&(a[0]=a[0].slice(0,b),a[2]=c.slice(0,b)),a.slice(0,3))}},filter:{TAG:function(a){var b=a.replace(cb,db).toLowerCase();return"*"===a?function(){return!0}:function(a){return a.nodeName&&a.nodeName.toLowerCase()===b}},CLASS:function(a){var b=y[a+" "];return b||(b=new RegExp("(^|"+M+")"+a+"("+M+"|$)"))&&y(a,function(a){return b.test("string"==typeof a.className&&a.className||typeof a.getAttribute!==C&&a.getAttribute("class")||"")})},ATTR:function(a,b,c){return function(d){var e=fb.attr(d,a);return null==e?"!="===b:b?(e+="","="===b?e===c:"!="===b?e!==c:"^="===b?c&&0===e.indexOf(c):"*="===b?c&&e.indexOf(c)>-1:"$="===b?c&&e.slice(-c.length)===c:"~="===b?(" "+e+" ").indexOf(c)>-1:"|="===b?e===c||e.slice(0,c.length+1)===c+"-":!1):!0}},CHILD:function(a,b,c,d,e){var f="nth"!==a.slice(0,3),g="last"!==a.slice(-4),h="of-type"===b;return 1===d&&0===e?function(a){return!!a.parentNode}:function(b,c,i){var j,k,l,m,n,o,p=f!==g?"nextSibling":"previousSibling",q=b.parentNode,r=h&&b.nodeName.toLowerCase(),s=!i&&!h;if(q){if(f){while(p){l=b;while(l=l[p])if(h?l.nodeName.toLowerCase()===r:1===l.nodeType)return!1;o=p="only"===a&&!o&&"nextSibling"}return!0}if(o=[g?q.firstChild:q.lastChild],g&&s){k=q[u]||(q[u]={}),j=k[a]||[],n=j[0]===w&&j[1],m=j[0]===w&&j[2],l=n&&q.childNodes[n];while(l=++n&&l&&l[p]||(m=n=0)||o.pop())if(1===l.nodeType&&++m&&l===b){k[a]=[w,n,m];break}}else if(s&&(j=(b[u]||(b[u]={}))[a])&&j[0]===w)m=j[1];else while(l=++n&&l&&l[p]||(m=n=0)||o.pop())if((h?l.nodeName.toLowerCase()===r:1===l.nodeType)&&++m&&(s&&((l[u]||(l[u]={}))[a]=[w,m]),l===b))break;return m-=e,m===d||m%d===0&&m/d>=0}}},PSEUDO:function(a,b){var c,e=d.pseudos[a]||d.setFilters[a.toLowerCase()]||fb.error("unsupported pseudo: "+a);return e[u]?e(b):e.length>1?(c=[a,a,"",b],d.setFilters.hasOwnProperty(a.toLowerCase())?hb(function(a,c){var d,f=e(a,b),g=f.length;while(g--)d=K.call(a,f[g]),a[d]=!(c[d]=f[g])}):function(a){return e(a,0,c)}):e}},pseudos:{not:hb(function(a){var b=[],c=[],d=h(a.replace(R,"$1"));return d[u]?hb(function(a,b,c,e){var f,g=d(a,null,e,[]),h=a.length;while(h--)(f=g[h])&&(a[h]=!(b[h]=f))}):function(a,e,f){return b[0]=a,d(b,null,f,c),!c.pop()}}),has:hb(function(a){return function(b){return fb(a,b).length>0}}),contains:hb(function(a){return function(b){return(b.textContent||b.innerText||e(b)).indexOf(a)>-1}}),lang:hb(function(a){return W.test(a||"")||fb.error("unsupported lang: "+a),a=a.replace(cb,db).toLowerCase(),function(b){var c;do if(c=p?b.lang:b.getAttribute("xml:lang")||b.getAttribute("lang"))return c=c.toLowerCase(),c===a||0===c.indexOf(a+"-");while((b=b.parentNode)&&1===b.nodeType);return!1}}),target:function(b){var c=a.location&&a.location.hash;return c&&c.slice(1)===b.id},root:function(a){return a===o},focus:function(a){return a===n.activeElement&&(!n.hasFocus||n.hasFocus())&&!!(a.type||a.href||~a.tabIndex)},enabled:function(a){return a.disabled===!1},disabled:function(a){return a.disabled===!0},checked:function(a){var b=a.nodeName.toLowerCase();return"input"===b&&!!a.checked||"option"===b&&!!a.selected},selected:function(a){return a.parentNode&&a.parentNode.selectedIndex,a.selected===!0},empty:function(a){for(a=a.firstChild;a;a=a.nextSibling)if(a.nodeType<6)return!1;return!0},parent:function(a){return!d.pseudos.empty(a)},header:function(a){return Z.test(a.nodeName)},input:function(a){return Y.test(a.nodeName)},button:function(a){var b=a.nodeName.toLowerCase();return"input"===b&&"button"===a.type||"button"===b},text:function(a){var b;return"input"===a.nodeName.toLowerCase()&&"text"===a.type&&(null==(b=a.getAttribute("type"))||"text"===b.toLowerCase())},first:nb(function(){return[0]}),last:nb(function(a,b){return[b-1]}),eq:nb(function(a,b,c){return[0>c?c+b:c]}),even:nb(function(a,b){for(var c=0;b>c;c+=2)a.push(c);return a}),odd:nb(function(a,b){for(var c=1;b>c;c+=2)a.push(c);return a}),lt:nb(function(a,b,c){for(var d=0>c?c+b:c;--d>=0;)a.push(d);return a}),gt:nb(function(a,b,c){for(var d=0>c?c+b:c;++d<b;)a.push(d);return a})}},d.pseudos.nth=d.pseudos.eq;for(b in{radio:!0,checkbox:!0,file:!0,password:!0,image:!0})d.pseudos[b]=lb(b);for(b in{submit:!0,reset:!0})d.pseudos[b]=mb(b);function pb(){}pb.prototype=d.filters=d.pseudos,d.setFilters=new pb,g=fb.tokenize=function(a,b){var c,e,f,g,h,i,j,k=z[a+" "];if(k)return b?0:k.slice(0);h=a,i=[],j=d.preFilter;while(h){(!c||(e=S.exec(h)))&&(e&&(h=h.slice(e[0].length)||h),i.push(f=[])),c=!1,(e=T.exec(h))&&(c=e.shift(),f.push({value:c,type:e[0].replace(R," ")}),h=h.slice(c.length));for(g in d.filter)!(e=X[g].exec(h))||j[g]&&!(e=j[g](e))||(c=e.shift(),f.push({value:c,type:g,matches:e}),h=h.slice(c.length));if(!c)break}return b?h.length:h?fb.error(a):z(a,i).slice(0)};function qb(a){for(var b=0,c=a.length,d="";c>b;b++)d+=a[b].value;return d}function rb(a,b,c){var d=b.dir,e=c&&"parentNode"===d,f=x++;return b.first?function(b,c,f){while(b=b[d])if(1===b.nodeType||e)return a(b,c,f)}:function(b,c,g){var h,i,j=[w,f];if(g){while(b=b[d])if((1===b.nodeType||e)&&a(b,c,g))return!0}else while(b=b[d])if(1===b.nodeType||e){if(i=b[u]||(b[u]={}),(h=i[d])&&h[0]===w&&h[1]===f)return j[2]=h[2];if(i[d]=j,j[2]=a(b,c,g))return!0}}}function sb(a){return a.length>1?function(b,c,d){var e=a.length;while(e--)if(!a[e](b,c,d))return!1;return!0}:a[0]}function tb(a,b,c){for(var d=0,e=b.length;e>d;d++)fb(a,b[d],c);return c}function ub(a,b,c,d,e){for(var f,g=[],h=0,i=a.length,j=null!=b;i>h;h++)(f=a[h])&&(!c||c(f,d,e))&&(g.push(f),j&&b.push(h));return g}function vb(a,b,c,d,e,f){return d&&!d[u]&&(d=vb(d)),e&&!e[u]&&(e=vb(e,f)),hb(function(f,g,h,i){var j,k,l,m=[],n=[],o=g.length,p=f||tb(b||"*",h.nodeType?[h]:h,[]),q=!a||!f&&b?p:ub(p,m,a,h,i),r=c?e||(f?a:o||d)?[]:g:q;if(c&&c(q,r,h,i),d){j=ub(r,n),d(j,[],h,i),k=j.length;while(k--)(l=j[k])&&(r[n[k]]=!(q[n[k]]=l))}if(f){if(e||a){if(e){j=[],k=r.length;while(k--)(l=r[k])&&j.push(q[k]=l);e(null,r=[],j,i)}k=r.length;while(k--)(l=r[k])&&(j=e?K.call(f,l):m[k])>-1&&(f[j]=!(g[j]=l))}}else r=ub(r===g?r.splice(o,r.length):r),e?e(null,g,r,i):I.apply(g,r)})}function wb(a){for(var b,c,e,f=a.length,g=d.relative[a[0].type],h=g||d.relative[" "],i=g?1:0,k=rb(function(a){return a===b},h,!0),l=rb(function(a){return K.call(b,a)>-1},h,!0),m=[function(a,c,d){return!g&&(d||c!==j)||((b=c).nodeType?k(a,c,d):l(a,c,d))}];f>i;i++)if(c=d.relative[a[i].type])m=[rb(sb(m),c)];else{if(c=d.filter[a[i].type].apply(null,a[i].matches),c[u]){for(e=++i;f>e;e++)if(d.relative[a[e].type])break;return vb(i>1&&sb(m),i>1&&qb(a.slice(0,i-1).concat({value:" "===a[i-2].type?"*":""})).replace(R,"$1"),c,e>i&&wb(a.slice(i,e)),f>e&&wb(a=a.slice(e)),f>e&&qb(a))}m.push(c)}return sb(m)}function xb(a,b){var c=b.length>0,e=a.length>0,f=function(f,g,h,i,k){var l,m,o,p=0,q="0",r=f&&[],s=[],t=j,u=f||e&&d.find.TAG("*",k),v=w+=null==t?1:Math.random()||.1,x=u.length;for(k&&(j=g!==n&&g);q!==x&&null!=(l=u[q]);q++){if(e&&l){m=0;while(o=a[m++])if(o(l,g,h)){i.push(l);break}k&&(w=v)}c&&((l=!o&&l)&&p--,f&&r.push(l))}if(p+=q,c&&q!==p){m=0;while(o=b[m++])o(r,s,g,h);if(f){if(p>0)while(q--)r[q]||s[q]||(s[q]=G.call(i));s=ub(s)}I.apply(i,s),k&&!f&&s.length>0&&p+b.length>1&&fb.uniqueSort(i)}return k&&(w=v,j=t),r};return c?hb(f):f}return h=fb.compile=function(a,b){var c,d=[],e=[],f=A[a+" "];if(!f){b||(b=g(a)),c=b.length;while(c--)f=wb(b[c]),f[u]?d.push(f):e.push(f);f=A(a,xb(e,d)),f.selector=a}return f},i=fb.select=function(a,b,e,f){var i,j,k,l,m,n="function"==typeof a&&a,o=!f&&g(a=n.selector||a);if(e=e||[],1===o.length){if(j=o[0]=o[0].slice(0),j.length>2&&"ID"===(k=j[0]).type&&c.getById&&9===b.nodeType&&p&&d.relative[j[1].type]){if(b=(d.find.ID(k.matches[0].replace(cb,db),b)||[])[0],!b)return e;n&&(b=b.parentNode),a=a.slice(j.shift().value.length)}i=X.needsContext.test(a)?0:j.length;while(i--){if(k=j[i],d.relative[l=k.type])break;if((m=d.find[l])&&(f=m(k.matches[0].replace(cb,db),ab.test(j[0].type)&&ob(b.parentNode)||b))){if(j.splice(i,1),a=f.length&&qb(j),!a)return I.apply(e,f),e;break}}}return(n||h(a,o))(f,b,!p,e,ab.test(a)&&ob(b.parentNode)||b),e},c.sortStable=u.split("").sort(B).join("")===u,c.detectDuplicates=!!l,m(),c.sortDetached=ib(function(a){return 1&a.compareDocumentPosition(n.createElement("div"))}),ib(function(a){return a.innerHTML="<a href='#'></a>","#"===a.firstChild.getAttribute("href")})||jb("type|href|height|width",function(a,b,c){return c?void 0:a.getAttribute(b,"type"===b.toLowerCase()?1:2)}),c.attributes&&ib(function(a){return a.innerHTML="<input/>",a.firstChild.setAttribute("value",""),""===a.firstChild.getAttribute("value")})||jb("value",function(a,b,c){return c||"input"!==a.nodeName.toLowerCase()?void 0:a.defaultValue}),ib(function(a){return null==a.getAttribute("disabled")})||jb(L,function(a,b,c){var d;return c?void 0:a[b]===!0?b.toLowerCase():(d=a.getAttributeNode(b))&&d.specified?d.value:null}),fb}(a);n.find=t,n.expr=t.selectors,n.expr[":"]=n.expr.pseudos,n.unique=t.uniqueSort,n.text=t.getText,n.isXMLDoc=t.isXML,n.contains=t.contains;var u=n.expr.match.needsContext,v=/^<(\w+)\s*\/?>(?:<\/\1>|)$/,w=/^.[^:#\[\.,]*$/;function x(a,b,c){if(n.isFunction(b))return n.grep(a,function(a,d){return!!b.call(a,d,a)!==c});if(b.nodeType)return n.grep(a,function(a){return a===b!==c});if("string"==typeof b){if(w.test(b))return n.filter(b,a,c);b=n.filter(b,a)}return n.grep(a,function(a){return g.call(b,a)>=0!==c})}n.filter=function(a,b,c){var d=b[0];return c&&(a=":not("+a+")"),1===b.length&&1===d.nodeType?n.find.matchesSelector(d,a)?[d]:[]:n.find.matches(a,n.grep(b,function(a){return 1===a.nodeType}))},n.fn.extend({find:function(a){var b,c=this.length,d=[],e=this;if("string"!=typeof a)return this.pushStack(n(a).filter(function(){for(b=0;c>b;b++)if(n.contains(e[b],this))return!0}));for(b=0;c>b;b++)n.find(a,e[b],d);return d=this.pushStack(c>1?n.unique(d):d),d.selector=this.selector?this.selector+" "+a:a,d},filter:function(a){return this.pushStack(x(this,a||[],!1))},not:function(a){return this.pushStack(x(this,a||[],!0))},is:function(a){return!!x(this,"string"==typeof a&&u.test(a)?n(a):a||[],!1).length}});var y,z=/^(?:\s*(<[\w\W]+>)[^>]*|#([\w-]*))$/,A=n.fn.init=function(a,b){var c,d;if(!a)return this;if("string"==typeof a){if(c="<"===a[0]&&">"===a[a.length-1]&&a.length>=3?[null,a,null]:z.exec(a),!c||!c[1]&&b)return!b||b.jquery?(b||y).find(a):this.constructor(b).find(a);if(c[1]){if(b=b instanceof n?b[0]:b,n.merge(this,n.parseHTML(c[1],b&&b.nodeType?b.ownerDocument||b:l,!0)),v.test(c[1])&&n.isPlainObject(b))for(c in b)n.isFunction(this[c])?this[c](b[c]):this.attr(c,b[c]);return this}return d=l.getElementById(c[2]),d&&d.parentNode&&(this.length=1,this[0]=d),this.context=l,this.selector=a,this}return a.nodeType?(this.context=this[0]=a,this.length=1,this):n.isFunction(a)?"undefined"!=typeof y.ready?y.ready(a):a(n):(void 0!==a.selector&&(this.selector=a.selector,this.context=a.context),n.makeArray(a,this))};A.prototype=n.fn,y=n(l);var B=/^(?:parents|prev(?:Until|All))/,C={children:!0,contents:!0,next:!0,prev:!0};n.extend({dir:function(a,b,c){var d=[],e=void 0!==c;while((a=a[b])&&9!==a.nodeType)if(1===a.nodeType){if(e&&n(a).is(c))break;d.push(a)}return d},sibling:function(a,b){for(var c=[];a;a=a.nextSibling)1===a.nodeType&&a!==b&&c.push(a);return c}}),n.fn.extend({has:function(a){var b=n(a,this),c=b.length;return this.filter(function(){for(var a=0;c>a;a++)if(n.contains(this,b[a]))return!0})},closest:function(a,b){for(var c,d=0,e=this.length,f=[],g=u.test(a)||"string"!=typeof a?n(a,b||this.context):0;e>d;d++)for(c=this[d];c&&c!==b;c=c.parentNode)if(c.nodeType<11&&(g?g.index(c)>-1:1===c.nodeType&&n.find.matchesSelector(c,a))){f.push(c);break}return this.pushStack(f.length>1?n.unique(f):f)},index:function(a){return a?"string"==typeof a?g.call(n(a),this[0]):g.call(this,a.jquery?a[0]:a):this[0]&&this[0].parentNode?this.first().prevAll().length:-1},add:function(a,b){return this.pushStack(n.unique(n.merge(this.get(),n(a,b))))},addBack:function(a){return this.add(null==a?this.prevObject:this.prevObject.filter(a))}});function D(a,b){while((a=a[b])&&1!==a.nodeType);return a}n.each({parent:function(a){var b=a.parentNode;return b&&11!==b.nodeType?b:null},parents:function(a){return n.dir(a,"parentNode")},parentsUntil:function(a,b,c){return n.dir(a,"parentNode",c)},next:function(a){return D(a,"nextSibling")},prev:function(a){return D(a,"previousSibling")},nextAll:function(a){return n.dir(a,"nextSibling")},prevAll:function(a){return n.dir(a,"previousSibling")},nextUntil:function(a,b,c){return n.dir(a,"nextSibling",c)},prevUntil:function(a,b,c){return n.dir(a,"previousSibling",c)},siblings:function(a){return n.sibling((a.parentNode||{}).firstChild,a)},children:function(a){return n.sibling(a.firstChild)},contents:function(a){return a.contentDocument||n.merge([],a.childNodes)}},function(a,b){n.fn[a]=function(c,d){var e=n.map(this,b,c);return"Until"!==a.slice(-5)&&(d=c),d&&"string"==typeof d&&(e=n.filter(d,e)),this.length>1&&(C[a]||n.unique(e),B.test(a)&&e.reverse()),this.pushStack(e)}});var E=/\S+/g,F={};function G(a){var b=F[a]={};return n.each(a.match(E)||[],function(a,c){b[c]=!0}),b}n.Callbacks=function(a){a="string"==typeof a?F[a]||G(a):n.extend({},a);var b,c,d,e,f,g,h=[],i=!a.once&&[],j=function(l){for(b=a.memory&&l,c=!0,g=e||0,e=0,f=h.length,d=!0;h&&f>g;g++)if(h[g].apply(l[0],l[1])===!1&&a.stopOnFalse){b=!1;break}d=!1,h&&(i?i.length&&j(i.shift()):b?h=[]:k.disable())},k={add:function(){if(h){var c=h.length;!function g(b){n.each(b,function(b,c){var d=n.type(c);"function"===d?a.unique&&k.has(c)||h.push(c):c&&c.length&&"string"!==d&&g(c)})}(arguments),d?f=h.length:b&&(e=c,j(b))}return this},remove:function(){return h&&n.each(arguments,function(a,b){var c;while((c=n.inArray(b,h,c))>-1)h.splice(c,1),d&&(f>=c&&f--,g>=c&&g--)}),this},has:function(a){return a?n.inArray(a,h)>-1:!(!h||!h.length)},empty:function(){return h=[],f=0,this},disable:function(){return h=i=b=void 0,this},disabled:function(){return!h},lock:function(){return i=void 0,b||k.disable(),this},locked:function(){return!i},fireWith:function(a,b){return!h||c&&!i||(b=b||[],b=[a,b.slice?b.slice():b],d?i.push(b):j(b)),this},fire:function(){return k.fireWith(this,arguments),this},fired:function(){return!!c}};return k},n.extend({Deferred:function(a){var b=[["resolve","done",n.Callbacks("once memory"),"resolved"],["reject","fail",n.Callbacks("once memory"),"rejected"],["notify","progress",n.Callbacks("memory")]],c="pending",d={state:function(){return c},always:function(){return e.done(arguments).fail(arguments),this},then:function(){var a=arguments;return n.Deferred(function(c){n.each(b,function(b,f){var g=n.isFunction(a[b])&&a[b];e[f[1]](function(){var a=g&&g.apply(this,arguments);a&&n.isFunction(a.promise)?a.promise().done(c.resolve).fail(c.reject).progress(c.notify):c[f[0]+"With"](this===d?c.promise():this,g?[a]:arguments)})}),a=null}).promise()},promise:function(a){return null!=a?n.extend(a,d):d}},e={};return d.pipe=d.then,n.each(b,function(a,f){var g=f[2],h=f[3];d[f[1]]=g.add,h&&g.add(function(){c=h},b[1^a][2].disable,b[2][2].lock),e[f[0]]=function(){return e[f[0]+"With"](this===e?d:this,arguments),this},e[f[0]+"With"]=g.fireWith}),d.promise(e),a&&a.call(e,e),e},when:function(a){var b=0,c=d.call(arguments),e=c.length,f=1!==e||a&&n.isFunction(a.promise)?e:0,g=1===f?a:n.Deferred(),h=function(a,b,c){return function(e){b[a]=this,c[a]=arguments.length>1?d.call(arguments):e,c===i?g.notifyWith(b,c):--f||g.resolveWith(b,c)}},i,j,k;if(e>1)for(i=new Array(e),j=new Array(e),k=new Array(e);e>b;b++)c[b]&&n.isFunction(c[b].promise)?c[b].promise().done(h(b,k,c)).fail(g.reject).progress(h(b,j,i)):--f;return f||g.resolveWith(k,c),g.promise()}});var H;n.fn.ready=function(a){return n.ready.promise().done(a),this},n.extend({isReady:!1,readyWait:1,holdReady:function(a){a?n.readyWait++:n.ready(!0)},ready:function(a){(a===!0?--n.readyWait:n.isReady)||(n.isReady=!0,a!==!0&&--n.readyWait>0||(H.resolveWith(l,[n]),n.fn.triggerHandler&&(n(l).triggerHandler("ready"),n(l).off("ready"))))}});function I(){l.removeEventListener("DOMContentLoaded",I,!1),a.removeEventListener("load",I,!1),n.ready()}n.ready.promise=function(b){return H||(H=n.Deferred(),"complete"===l.readyState?setTimeout(n.ready):(l.addEventListener("DOMContentLoaded",I,!1),a.addEventListener("load",I,!1))),H.promise(b)},n.ready.promise();var J=n.access=function(a,b,c,d,e,f,g){var h=0,i=a.length,j=null==c;if("object"===n.type(c)){e=!0;for(h in c)n.access(a,b,h,c[h],!0,f,g)}else if(void 0!==d&&(e=!0,n.isFunction(d)||(g=!0),j&&(g?(b.call(a,d),b=null):(j=b,b=function(a,b,c){return j.call(n(a),c)})),b))for(;i>h;h++)b(a[h],c,g?d:d.call(a[h],h,b(a[h],c)));return e?a:j?b.call(a):i?b(a[0],c):f};n.acceptData=function(a){return 1===a.nodeType||9===a.nodeType||!+a.nodeType};function K(){Object.defineProperty(this.cache={},0,{get:function(){return{}}}),this.expando=n.expando+Math.random()}K.uid=1,K.accepts=n.acceptData,K.prototype={key:function(a){if(!K.accepts(a))return 0;var b={},c=a[this.expando];if(!c){c=K.uid++;try{b[this.expando]={value:c},Object.defineProperties(a,b)}catch(d){b[this.expando]=c,n.extend(a,b)}}return this.cache[c]||(this.cache[c]={}),c},set:function(a,b,c){var d,e=this.key(a),f=this.cache[e];if("string"==typeof b)f[b]=c;else if(n.isEmptyObject(f))n.extend(this.cache[e],b);else for(d in b)f[d]=b[d];return f},get:function(a,b){var c=this.cache[this.key(a)];return void 0===b?c:c[b]},access:function(a,b,c){var d;return void 0===b||b&&"string"==typeof b&&void 0===c?(d=this.get(a,b),void 0!==d?d:this.get(a,n.camelCase(b))):(this.set(a,b,c),void 0!==c?c:b)},remove:function(a,b){var c,d,e,f=this.key(a),g=this.cache[f];if(void 0===b)this.cache[f]={};else{n.isArray(b)?d=b.concat(b.map(n.camelCase)):(e=n.camelCase(b),b in g?d=[b,e]:(d=e,d=d in g?[d]:d.match(E)||[])),c=d.length;while(c--)delete g[d[c]]}},hasData:function(a){return!n.isEmptyObject(this.cache[a[this.expando]]||{})},discard:function(a){a[this.expando]&&delete this.cache[a[this.expando]]}};var L=new K,M=new K,N=/^(?:\{[\w\W]*\}|\[[\w\W]*\])$/,O=/([A-Z])/g;function P(a,b,c){var d;if(void 0===c&&1===a.nodeType)if(d="data-"+b.replace(O,"-$1").toLowerCase(),c=a.getAttribute(d),"string"==typeof c){try{c="true"===c?!0:"false"===c?!1:"null"===c?null:+c+""===c?+c:N.test(c)?n.parseJSON(c):c}catch(e){}M.set(a,b,c)}else c=void 0;return c}n.extend({hasData:function(a){return M.hasData(a)||L.hasData(a)},data:function(a,b,c){return M.access(a,b,c)},removeData:function(a,b){M.remove(a,b)
},_data:function(a,b,c){return L.access(a,b,c)},_removeData:function(a,b){L.remove(a,b)}}),n.fn.extend({data:function(a,b){var c,d,e,f=this[0],g=f&&f.attributes;if(void 0===a){if(this.length&&(e=M.get(f),1===f.nodeType&&!L.get(f,"hasDataAttrs"))){c=g.length;while(c--)g[c]&&(d=g[c].name,0===d.indexOf("data-")&&(d=n.camelCase(d.slice(5)),P(f,d,e[d])));L.set(f,"hasDataAttrs",!0)}return e}return"object"==typeof a?this.each(function(){M.set(this,a)}):J(this,function(b){var c,d=n.camelCase(a);if(f&&void 0===b){if(c=M.get(f,a),void 0!==c)return c;if(c=M.get(f,d),void 0!==c)return c;if(c=P(f,d,void 0),void 0!==c)return c}else this.each(function(){var c=M.get(this,d);M.set(this,d,b),-1!==a.indexOf("-")&&void 0!==c&&M.set(this,a,b)})},null,b,arguments.length>1,null,!0)},removeData:function(a){return this.each(function(){M.remove(this,a)})}}),n.extend({queue:function(a,b,c){var d;return a?(b=(b||"fx")+"queue",d=L.get(a,b),c&&(!d||n.isArray(c)?d=L.access(a,b,n.makeArray(c)):d.push(c)),d||[]):void 0},dequeue:function(a,b){b=b||"fx";var c=n.queue(a,b),d=c.length,e=c.shift(),f=n._queueHooks(a,b),g=function(){n.dequeue(a,b)};"inprogress"===e&&(e=c.shift(),d--),e&&("fx"===b&&c.unshift("inprogress"),delete f.stop,e.call(a,g,f)),!d&&f&&f.empty.fire()},_queueHooks:function(a,b){var c=b+"queueHooks";return L.get(a,c)||L.access(a,c,{empty:n.Callbacks("once memory").add(function(){L.remove(a,[b+"queue",c])})})}}),n.fn.extend({queue:function(a,b){var c=2;return"string"!=typeof a&&(b=a,a="fx",c--),arguments.length<c?n.queue(this[0],a):void 0===b?this:this.each(function(){var c=n.queue(this,a,b);n._queueHooks(this,a),"fx"===a&&"inprogress"!==c[0]&&n.dequeue(this,a)})},dequeue:function(a){return this.each(function(){n.dequeue(this,a)})},clearQueue:function(a){return this.queue(a||"fx",[])},promise:function(a,b){var c,d=1,e=n.Deferred(),f=this,g=this.length,h=function(){--d||e.resolveWith(f,[f])};"string"!=typeof a&&(b=a,a=void 0),a=a||"fx";while(g--)c=L.get(f[g],a+"queueHooks"),c&&c.empty&&(d++,c.empty.add(h));return h(),e.promise(b)}});var Q=/[+-]?(?:\d*\.|)\d+(?:[eE][+-]?\d+|)/.source,R=["Top","Right","Bottom","Left"],S=function(a,b){return a=b||a,"none"===n.css(a,"display")||!n.contains(a.ownerDocument,a)},T=/^(?:checkbox|radio)$/i;!function(){var a=l.createDocumentFragment(),b=a.appendChild(l.createElement("div")),c=l.createElement("input");c.setAttribute("type","radio"),c.setAttribute("checked","checked"),c.setAttribute("name","t"),b.appendChild(c),k.checkClone=b.cloneNode(!0).cloneNode(!0).lastChild.checked,b.innerHTML="<textarea>x</textarea>",k.noCloneChecked=!!b.cloneNode(!0).lastChild.defaultValue}();var U="undefined";k.focusinBubbles="onfocusin"in a;var V=/^key/,W=/^(?:mouse|pointer|contextmenu)|click/,X=/^(?:focusinfocus|focusoutblur)$/,Y=/^([^.]*)(?:\.(.+)|)$/;function Z(){return!0}function $(){return!1}function _(){try{return l.activeElement}catch(a){}}n.event={global:{},add:function(a,b,c,d,e){var f,g,h,i,j,k,l,m,o,p,q,r=L.get(a);if(r){c.handler&&(f=c,c=f.handler,e=f.selector),c.guid||(c.guid=n.guid++),(i=r.events)||(i=r.events={}),(g=r.handle)||(g=r.handle=function(b){return typeof n!==U&&n.event.triggered!==b.type?n.event.dispatch.apply(a,arguments):void 0}),b=(b||"").match(E)||[""],j=b.length;while(j--)h=Y.exec(b[j])||[],o=q=h[1],p=(h[2]||"").split(".").sort(),o&&(l=n.event.special[o]||{},o=(e?l.delegateType:l.bindType)||o,l=n.event.special[o]||{},k=n.extend({type:o,origType:q,data:d,handler:c,guid:c.guid,selector:e,needsContext:e&&n.expr.match.needsContext.test(e),namespace:p.join(".")},f),(m=i[o])||(m=i[o]=[],m.delegateCount=0,l.setup&&l.setup.call(a,d,p,g)!==!1||a.addEventListener&&a.addEventListener(o,g,!1)),l.add&&(l.add.call(a,k),k.handler.guid||(k.handler.guid=c.guid)),e?m.splice(m.delegateCount++,0,k):m.push(k),n.event.global[o]=!0)}},remove:function(a,b,c,d,e){var f,g,h,i,j,k,l,m,o,p,q,r=L.hasData(a)&&L.get(a);if(r&&(i=r.events)){b=(b||"").match(E)||[""],j=b.length;while(j--)if(h=Y.exec(b[j])||[],o=q=h[1],p=(h[2]||"").split(".").sort(),o){l=n.event.special[o]||{},o=(d?l.delegateType:l.bindType)||o,m=i[o]||[],h=h[2]&&new RegExp("(^|\\.)"+p.join("\\.(?:.*\\.|)")+"(\\.|$)"),g=f=m.length;while(f--)k=m[f],!e&&q!==k.origType||c&&c.guid!==k.guid||h&&!h.test(k.namespace)||d&&d!==k.selector&&("**"!==d||!k.selector)||(m.splice(f,1),k.selector&&m.delegateCount--,l.remove&&l.remove.call(a,k));g&&!m.length&&(l.teardown&&l.teardown.call(a,p,r.handle)!==!1||n.removeEvent(a,o,r.handle),delete i[o])}else for(o in i)n.event.remove(a,o+b[j],c,d,!0);n.isEmptyObject(i)&&(delete r.handle,L.remove(a,"events"))}},trigger:function(b,c,d,e){var f,g,h,i,k,m,o,p=[d||l],q=j.call(b,"type")?b.type:b,r=j.call(b,"namespace")?b.namespace.split("."):[];if(g=h=d=d||l,3!==d.nodeType&&8!==d.nodeType&&!X.test(q+n.event.triggered)&&(q.indexOf(".")>=0&&(r=q.split("."),q=r.shift(),r.sort()),k=q.indexOf(":")<0&&"on"+q,b=b[n.expando]?b:new n.Event(q,"object"==typeof b&&b),b.isTrigger=e?2:3,b.namespace=r.join("."),b.namespace_re=b.namespace?new RegExp("(^|\\.)"+r.join("\\.(?:.*\\.|)")+"(\\.|$)"):null,b.result=void 0,b.target||(b.target=d),c=null==c?[b]:n.makeArray(c,[b]),o=n.event.special[q]||{},e||!o.trigger||o.trigger.apply(d,c)!==!1)){if(!e&&!o.noBubble&&!n.isWindow(d)){for(i=o.delegateType||q,X.test(i+q)||(g=g.parentNode);g;g=g.parentNode)p.push(g),h=g;h===(d.ownerDocument||l)&&p.push(h.defaultView||h.parentWindow||a)}f=0;while((g=p[f++])&&!b.isPropagationStopped())b.type=f>1?i:o.bindType||q,m=(L.get(g,"events")||{})[b.type]&&L.get(g,"handle"),m&&m.apply(g,c),m=k&&g[k],m&&m.apply&&n.acceptData(g)&&(b.result=m.apply(g,c),b.result===!1&&b.preventDefault());return b.type=q,e||b.isDefaultPrevented()||o._default&&o._default.apply(p.pop(),c)!==!1||!n.acceptData(d)||k&&n.isFunction(d[q])&&!n.isWindow(d)&&(h=d[k],h&&(d[k]=null),n.event.triggered=q,d[q](),n.event.triggered=void 0,h&&(d[k]=h)),b.result}},dispatch:function(a){a=n.event.fix(a);var b,c,e,f,g,h=[],i=d.call(arguments),j=(L.get(this,"events")||{})[a.type]||[],k=n.event.special[a.type]||{};if(i[0]=a,a.delegateTarget=this,!k.preDispatch||k.preDispatch.call(this,a)!==!1){h=n.event.handlers.call(this,a,j),b=0;while((f=h[b++])&&!a.isPropagationStopped()){a.currentTarget=f.elem,c=0;while((g=f.handlers[c++])&&!a.isImmediatePropagationStopped())(!a.namespace_re||a.namespace_re.test(g.namespace))&&(a.handleObj=g,a.data=g.data,e=((n.event.special[g.origType]||{}).handle||g.handler).apply(f.elem,i),void 0!==e&&(a.result=e)===!1&&(a.preventDefault(),a.stopPropagation()))}return k.postDispatch&&k.postDispatch.call(this,a),a.result}},handlers:function(a,b){var c,d,e,f,g=[],h=b.delegateCount,i=a.target;if(h&&i.nodeType&&(!a.button||"click"!==a.type))for(;i!==this;i=i.parentNode||this)if(i.disabled!==!0||"click"!==a.type){for(d=[],c=0;h>c;c++)f=b[c],e=f.selector+" ",void 0===d[e]&&(d[e]=f.needsContext?n(e,this).index(i)>=0:n.find(e,this,null,[i]).length),d[e]&&d.push(f);d.length&&g.push({elem:i,handlers:d})}return h<b.length&&g.push({elem:this,handlers:b.slice(h)}),g},props:"altKey bubbles cancelable ctrlKey currentTarget eventPhase metaKey relatedTarget shiftKey target timeStamp view which".split(" "),fixHooks:{},keyHooks:{props:"char charCode key keyCode".split(" "),filter:function(a,b){return null==a.which&&(a.which=null!=b.charCode?b.charCode:b.keyCode),a}},mouseHooks:{props:"button buttons clientX clientY offsetX offsetY pageX pageY screenX screenY toElement".split(" "),filter:function(a,b){var c,d,e,f=b.button;return null==a.pageX&&null!=b.clientX&&(c=a.target.ownerDocument||l,d=c.documentElement,e=c.body,a.pageX=b.clientX+(d&&d.scrollLeft||e&&e.scrollLeft||0)-(d&&d.clientLeft||e&&e.clientLeft||0),a.pageY=b.clientY+(d&&d.scrollTop||e&&e.scrollTop||0)-(d&&d.clientTop||e&&e.clientTop||0)),a.which||void 0===f||(a.which=1&f?1:2&f?3:4&f?2:0),a}},fix:function(a){if(a[n.expando])return a;var b,c,d,e=a.type,f=a,g=this.fixHooks[e];g||(this.fixHooks[e]=g=W.test(e)?this.mouseHooks:V.test(e)?this.keyHooks:{}),d=g.props?this.props.concat(g.props):this.props,a=new n.Event(f),b=d.length;while(b--)c=d[b],a[c]=f[c];return a.target||(a.target=l),3===a.target.nodeType&&(a.target=a.target.parentNode),g.filter?g.filter(a,f):a},special:{load:{noBubble:!0},focus:{trigger:function(){return this!==_()&&this.focus?(this.focus(),!1):void 0},delegateType:"focusin"},blur:{trigger:function(){return this===_()&&this.blur?(this.blur(),!1):void 0},delegateType:"focusout"},click:{trigger:function(){return"checkbox"===this.type&&this.click&&n.nodeName(this,"input")?(this.click(),!1):void 0},_default:function(a){return n.nodeName(a.target,"a")}},beforeunload:{postDispatch:function(a){void 0!==a.result&&a.originalEvent&&(a.originalEvent.returnValue=a.result)}}},simulate:function(a,b,c,d){var e=n.extend(new n.Event,c,{type:a,isSimulated:!0,originalEvent:{}});d?n.event.trigger(e,null,b):n.event.dispatch.call(b,e),e.isDefaultPrevented()&&c.preventDefault()}},n.removeEvent=function(a,b,c){a.removeEventListener&&a.removeEventListener(b,c,!1)},n.Event=function(a,b){return this instanceof n.Event?(a&&a.type?(this.originalEvent=a,this.type=a.type,this.isDefaultPrevented=a.defaultPrevented||void 0===a.defaultPrevented&&a.returnValue===!1?Z:$):this.type=a,b&&n.extend(this,b),this.timeStamp=a&&a.timeStamp||n.now(),void(this[n.expando]=!0)):new n.Event(a,b)},n.Event.prototype={isDefaultPrevented:$,isPropagationStopped:$,isImmediatePropagationStopped:$,preventDefault:function(){var a=this.originalEvent;this.isDefaultPrevented=Z,a&&a.preventDefault&&a.preventDefault()},stopPropagation:function(){var a=this.originalEvent;this.isPropagationStopped=Z,a&&a.stopPropagation&&a.stopPropagation()},stopImmediatePropagation:function(){var a=this.originalEvent;this.isImmediatePropagationStopped=Z,a&&a.stopImmediatePropagation&&a.stopImmediatePropagation(),this.stopPropagation()}},n.each({mouseenter:"mouseover",mouseleave:"mouseout",pointerenter:"pointerover",pointerleave:"pointerout"},function(a,b){n.event.special[a]={delegateType:b,bindType:b,handle:function(a){var c,d=this,e=a.relatedTarget,f=a.handleObj;return(!e||e!==d&&!n.contains(d,e))&&(a.type=f.origType,c=f.handler.apply(this,arguments),a.type=b),c}}}),k.focusinBubbles||n.each({focus:"focusin",blur:"focusout"},function(a,b){var c=function(a){n.event.simulate(b,a.target,n.event.fix(a),!0)};n.event.special[b]={setup:function(){var d=this.ownerDocument||this,e=L.access(d,b);e||d.addEventListener(a,c,!0),L.access(d,b,(e||0)+1)},teardown:function(){var d=this.ownerDocument||this,e=L.access(d,b)-1;e?L.access(d,b,e):(d.removeEventListener(a,c,!0),L.remove(d,b))}}}),n.fn.extend({on:function(a,b,c,d,e){var f,g;if("object"==typeof a){"string"!=typeof b&&(c=c||b,b=void 0);for(g in a)this.on(g,b,c,a[g],e);return this}if(null==c&&null==d?(d=b,c=b=void 0):null==d&&("string"==typeof b?(d=c,c=void 0):(d=c,c=b,b=void 0)),d===!1)d=$;else if(!d)return this;return 1===e&&(f=d,d=function(a){return n().off(a),f.apply(this,arguments)},d.guid=f.guid||(f.guid=n.guid++)),this.each(function(){n.event.add(this,a,d,c,b)})},one:function(a,b,c,d){return this.on(a,b,c,d,1)},off:function(a,b,c){var d,e;if(a&&a.preventDefault&&a.handleObj)return d=a.handleObj,n(a.delegateTarget).off(d.namespace?d.origType+"."+d.namespace:d.origType,d.selector,d.handler),this;if("object"==typeof a){for(e in a)this.off(e,b,a[e]);return this}return(b===!1||"function"==typeof b)&&(c=b,b=void 0),c===!1&&(c=$),this.each(function(){n.event.remove(this,a,c,b)})},trigger:function(a,b){return this.each(function(){n.event.trigger(a,b,this)})},triggerHandler:function(a,b){var c=this[0];return c?n.event.trigger(a,b,c,!0):void 0}});var ab=/<(?!area|br|col|embed|hr|img|input|link|meta|param)(([\w:]+)[^>]*)\/>/gi,bb=/<([\w:]+)/,cb=/<|&#?\w+;/,db=/<(?:script|style|link)/i,eb=/checked\s*(?:[^=]|=\s*.checked.)/i,fb=/^$|\/(?:java|ecma)script/i,gb=/^true\/(.*)/,hb=/^\s*<!(?:\[CDATA\[|--)|(?:\]\]|--)>\s*$/g,ib={option:[1,"<select multiple='multiple'>","</select>"],thead:[1,"<table>","</table>"],col:[2,"<table><colgroup>","</colgroup></table>"],tr:[2,"<table><tbody>","</tbody></table>"],td:[3,"<table><tbody><tr>","</tr></tbody></table>"],_default:[0,"",""]};ib.optgroup=ib.option,ib.tbody=ib.tfoot=ib.colgroup=ib.caption=ib.thead,ib.th=ib.td;function jb(a,b){return n.nodeName(a,"table")&&n.nodeName(11!==b.nodeType?b:b.firstChild,"tr")?a.getElementsByTagName("tbody")[0]||a.appendChild(a.ownerDocument.createElement("tbody")):a}function kb(a){return a.type=(null!==a.getAttribute("type"))+"/"+a.type,a}function lb(a){var b=gb.exec(a.type);return b?a.type=b[1]:a.removeAttribute("type"),a}function mb(a,b){for(var c=0,d=a.length;d>c;c++)L.set(a[c],"globalEval",!b||L.get(b[c],"globalEval"))}function nb(a,b){var c,d,e,f,g,h,i,j;if(1===b.nodeType){if(L.hasData(a)&&(f=L.access(a),g=L.set(b,f),j=f.events)){delete g.handle,g.events={};for(e in j)for(c=0,d=j[e].length;d>c;c++)n.event.add(b,e,j[e][c])}M.hasData(a)&&(h=M.access(a),i=n.extend({},h),M.set(b,i))}}function ob(a,b){var c=a.getElementsByTagName?a.getElementsByTagName(b||"*"):a.querySelectorAll?a.querySelectorAll(b||"*"):[];return void 0===b||b&&n.nodeName(a,b)?n.merge([a],c):c}function pb(a,b){var c=b.nodeName.toLowerCase();"input"===c&&T.test(a.type)?b.checked=a.checked:("input"===c||"textarea"===c)&&(b.defaultValue=a.defaultValue)}n.extend({clone:function(a,b,c){var d,e,f,g,h=a.cloneNode(!0),i=n.contains(a.ownerDocument,a);if(!(k.noCloneChecked||1!==a.nodeType&&11!==a.nodeType||n.isXMLDoc(a)))for(g=ob(h),f=ob(a),d=0,e=f.length;e>d;d++)pb(f[d],g[d]);if(b)if(c)for(f=f||ob(a),g=g||ob(h),d=0,e=f.length;e>d;d++)nb(f[d],g[d]);else nb(a,h);return g=ob(h,"script"),g.length>0&&mb(g,!i&&ob(a,"script")),h},buildFragment:function(a,b,c,d){for(var e,f,g,h,i,j,k=b.createDocumentFragment(),l=[],m=0,o=a.length;o>m;m++)if(e=a[m],e||0===e)if("object"===n.type(e))n.merge(l,e.nodeType?[e]:e);else if(cb.test(e)){f=f||k.appendChild(b.createElement("div")),g=(bb.exec(e)||["",""])[1].toLowerCase(),h=ib[g]||ib._default,f.innerHTML=h[1]+e.replace(ab,"<$1></$2>")+h[2],j=h[0];while(j--)f=f.lastChild;n.merge(l,f.childNodes),f=k.firstChild,f.textContent=""}else l.push(b.createTextNode(e));k.textContent="",m=0;while(e=l[m++])if((!d||-1===n.inArray(e,d))&&(i=n.contains(e.ownerDocument,e),f=ob(k.appendChild(e),"script"),i&&mb(f),c)){j=0;while(e=f[j++])fb.test(e.type||"")&&c.push(e)}return k},cleanData:function(a){for(var b,c,d,e,f=n.event.special,g=0;void 0!==(c=a[g]);g++){if(n.acceptData(c)&&(e=c[L.expando],e&&(b=L.cache[e]))){if(b.events)for(d in b.events)f[d]?n.event.remove(c,d):n.removeEvent(c,d,b.handle);L.cache[e]&&delete L.cache[e]}delete M.cache[c[M.expando]]}}}),n.fn.extend({text:function(a){return J(this,function(a){return void 0===a?n.text(this):this.empty().each(function(){(1===this.nodeType||11===this.nodeType||9===this.nodeType)&&(this.textContent=a)})},null,a,arguments.length)},append:function(){return this.domManip(arguments,function(a){if(1===this.nodeType||11===this.nodeType||9===this.nodeType){var b=jb(this,a);b.appendChild(a)}})},prepend:function(){return this.domManip(arguments,function(a){if(1===this.nodeType||11===this.nodeType||9===this.nodeType){var b=jb(this,a);b.insertBefore(a,b.firstChild)}})},before:function(){return this.domManip(arguments,function(a){this.parentNode&&this.parentNode.insertBefore(a,this)})},after:function(){return this.domManip(arguments,function(a){this.parentNode&&this.parentNode.insertBefore(a,this.nextSibling)})},remove:function(a,b){for(var c,d=a?n.filter(a,this):this,e=0;null!=(c=d[e]);e++)b||1!==c.nodeType||n.cleanData(ob(c)),c.parentNode&&(b&&n.contains(c.ownerDocument,c)&&mb(ob(c,"script")),c.parentNode.removeChild(c));return this},empty:function(){for(var a,b=0;null!=(a=this[b]);b++)1===a.nodeType&&(n.cleanData(ob(a,!1)),a.textContent="");return this},clone:function(a,b){return a=null==a?!1:a,b=null==b?a:b,this.map(function(){return n.clone(this,a,b)})},html:function(a){return J(this,function(a){var b=this[0]||{},c=0,d=this.length;if(void 0===a&&1===b.nodeType)return b.innerHTML;if("string"==typeof a&&!db.test(a)&&!ib[(bb.exec(a)||["",""])[1].toLowerCase()]){a=a.replace(ab,"<$1></$2>");try{for(;d>c;c++)b=this[c]||{},1===b.nodeType&&(n.cleanData(ob(b,!1)),b.innerHTML=a);b=0}catch(e){}}b&&this.empty().append(a)},null,a,arguments.length)},replaceWith:function(){var a=arguments[0];return this.domManip(arguments,function(b){a=this.parentNode,n.cleanData(ob(this)),a&&a.replaceChild(b,this)}),a&&(a.length||a.nodeType)?this:this.remove()},detach:function(a){return this.remove(a,!0)},domManip:function(a,b){a=e.apply([],a);var c,d,f,g,h,i,j=0,l=this.length,m=this,o=l-1,p=a[0],q=n.isFunction(p);if(q||l>1&&"string"==typeof p&&!k.checkClone&&eb.test(p))return this.each(function(c){var d=m.eq(c);q&&(a[0]=p.call(this,c,d.html())),d.domManip(a,b)});if(l&&(c=n.buildFragment(a,this[0].ownerDocument,!1,this),d=c.firstChild,1===c.childNodes.length&&(c=d),d)){for(f=n.map(ob(c,"script"),kb),g=f.length;l>j;j++)h=c,j!==o&&(h=n.clone(h,!0,!0),g&&n.merge(f,ob(h,"script"))),b.call(this[j],h,j);if(g)for(i=f[f.length-1].ownerDocument,n.map(f,lb),j=0;g>j;j++)h=f[j],fb.test(h.type||"")&&!L.access(h,"globalEval")&&n.contains(i,h)&&(h.src?n._evalUrl&&n._evalUrl(h.src):n.globalEval(h.textContent.replace(hb,"")))}return this}}),n.each({appendTo:"append",prependTo:"prepend",insertBefore:"before",insertAfter:"after",replaceAll:"replaceWith"},function(a,b){n.fn[a]=function(a){for(var c,d=[],e=n(a),g=e.length-1,h=0;g>=h;h++)c=h===g?this:this.clone(!0),n(e[h])[b](c),f.apply(d,c.get());return this.pushStack(d)}});var qb,rb={};function sb(b,c){var d,e=n(c.createElement(b)).appendTo(c.body),f=a.getDefaultComputedStyle&&(d=a.getDefaultComputedStyle(e[0]))?d.display:n.css(e[0],"display");return e.detach(),f}function tb(a){var b=l,c=rb[a];return c||(c=sb(a,b),"none"!==c&&c||(qb=(qb||n("<iframe frameborder='0' width='0' height='0'/>")).appendTo(b.documentElement),b=qb[0].contentDocument,b.write(),b.close(),c=sb(a,b),qb.detach()),rb[a]=c),c}var ub=/^margin/,vb=new RegExp("^("+Q+")(?!px)[a-z%]+$","i"),wb=function(a){return a.ownerDocument.defaultView.getComputedStyle(a,null)};function xb(a,b,c){var d,e,f,g,h=a.style;return c=c||wb(a),c&&(g=c.getPropertyValue(b)||c[b]),c&&(""!==g||n.contains(a.ownerDocument,a)||(g=n.style(a,b)),vb.test(g)&&ub.test(b)&&(d=h.width,e=h.minWidth,f=h.maxWidth,h.minWidth=h.maxWidth=h.width=g,g=c.width,h.width=d,h.minWidth=e,h.maxWidth=f)),void 0!==g?g+"":g}function yb(a,b){return{get:function(){return a()?void delete this.get:(this.get=b).apply(this,arguments)}}}!function(){var b,c,d=l.documentElement,e=l.createElement("div"),f=l.createElement("div");if(f.style){f.style.backgroundClip="content-box",f.cloneNode(!0).style.backgroundClip="",k.clearCloneStyle="content-box"===f.style.backgroundClip,e.style.cssText="border:0;width:0;height:0;top:0;left:-9999px;margin-top:1px;position:absolute",e.appendChild(f);function g(){f.style.cssText="-webkit-box-sizing:border-box;-moz-box-sizing:border-box;box-sizing:border-box;display:block;margin-top:1%;top:1%;border:1px;padding:1px;width:4px;position:absolute",f.innerHTML="",d.appendChild(e);var g=a.getComputedStyle(f,null);b="1%"!==g.top,c="4px"===g.width,d.removeChild(e)}a.getComputedStyle&&n.extend(k,{pixelPosition:function(){return g(),b},boxSizingReliable:function(){return null==c&&g(),c},reliableMarginRight:function(){var b,c=f.appendChild(l.createElement("div"));return c.style.cssText=f.style.cssText="-webkit-box-sizing:content-box;-moz-box-sizing:content-box;box-sizing:content-box;display:block;margin:0;border:0;padding:0",c.style.marginRight=c.style.width="0",f.style.width="1px",d.appendChild(e),b=!parseFloat(a.getComputedStyle(c,null).marginRight),d.removeChild(e),b}})}}(),n.swap=function(a,b,c,d){var e,f,g={};for(f in b)g[f]=a.style[f],a.style[f]=b[f];e=c.apply(a,d||[]);for(f in b)a.style[f]=g[f];return e};var zb=/^(none|table(?!-c[ea]).+)/,Ab=new RegExp("^("+Q+")(.*)$","i"),Bb=new RegExp("^([+-])=("+Q+")","i"),Cb={position:"absolute",visibility:"hidden",display:"block"},Db={letterSpacing:"0",fontWeight:"400"},Eb=["Webkit","O","Moz","ms"];function Fb(a,b){if(b in a)return b;var c=b[0].toUpperCase()+b.slice(1),d=b,e=Eb.length;while(e--)if(b=Eb[e]+c,b in a)return b;return d}function Gb(a,b,c){var d=Ab.exec(b);return d?Math.max(0,d[1]-(c||0))+(d[2]||"px"):b}function Hb(a,b,c,d,e){for(var f=c===(d?"border":"content")?4:"width"===b?1:0,g=0;4>f;f+=2)"margin"===c&&(g+=n.css(a,c+R[f],!0,e)),d?("content"===c&&(g-=n.css(a,"padding"+R[f],!0,e)),"margin"!==c&&(g-=n.css(a,"border"+R[f]+"Width",!0,e))):(g+=n.css(a,"padding"+R[f],!0,e),"padding"!==c&&(g+=n.css(a,"border"+R[f]+"Width",!0,e)));return g}function Ib(a,b,c){var d=!0,e="width"===b?a.offsetWidth:a.offsetHeight,f=wb(a),g="border-box"===n.css(a,"boxSizing",!1,f);if(0>=e||null==e){if(e=xb(a,b,f),(0>e||null==e)&&(e=a.style[b]),vb.test(e))return e;d=g&&(k.boxSizingReliable()||e===a.style[b]),e=parseFloat(e)||0}return e+Hb(a,b,c||(g?"border":"content"),d,f)+"px"}function Jb(a,b){for(var c,d,e,f=[],g=0,h=a.length;h>g;g++)d=a[g],d.style&&(f[g]=L.get(d,"olddisplay"),c=d.style.display,b?(f[g]||"none"!==c||(d.style.display=""),""===d.style.display&&S(d)&&(f[g]=L.access(d,"olddisplay",tb(d.nodeName)))):(e=S(d),"none"===c&&e||L.set(d,"olddisplay",e?c:n.css(d,"display"))));for(g=0;h>g;g++)d=a[g],d.style&&(b&&"none"!==d.style.display&&""!==d.style.display||(d.style.display=b?f[g]||"":"none"));return a}n.extend({cssHooks:{opacity:{get:function(a,b){if(b){var c=xb(a,"opacity");return""===c?"1":c}}}},cssNumber:{columnCount:!0,fillOpacity:!0,flexGrow:!0,flexShrink:!0,fontWeight:!0,lineHeight:!0,opacity:!0,order:!0,orphans:!0,widows:!0,zIndex:!0,zoom:!0},cssProps:{"float":"cssFloat"},style:function(a,b,c,d){if(a&&3!==a.nodeType&&8!==a.nodeType&&a.style){var e,f,g,h=n.camelCase(b),i=a.style;return b=n.cssProps[h]||(n.cssProps[h]=Fb(i,h)),g=n.cssHooks[b]||n.cssHooks[h],void 0===c?g&&"get"in g&&void 0!==(e=g.get(a,!1,d))?e:i[b]:(f=typeof c,"string"===f&&(e=Bb.exec(c))&&(c=(e[1]+1)*e[2]+parseFloat(n.css(a,b)),f="number"),null!=c&&c===c&&("number"!==f||n.cssNumber[h]||(c+="px"),k.clearCloneStyle||""!==c||0!==b.indexOf("background")||(i[b]="inherit"),g&&"set"in g&&void 0===(c=g.set(a,c,d))||(i[b]=c)),void 0)}},css:function(a,b,c,d){var e,f,g,h=n.camelCase(b);return b=n.cssProps[h]||(n.cssProps[h]=Fb(a.style,h)),g=n.cssHooks[b]||n.cssHooks[h],g&&"get"in g&&(e=g.get(a,!0,c)),void 0===e&&(e=xb(a,b,d)),"normal"===e&&b in Db&&(e=Db[b]),""===c||c?(f=parseFloat(e),c===!0||n.isNumeric(f)?f||0:e):e}}),n.each(["height","width"],function(a,b){n.cssHooks[b]={get:function(a,c,d){return c?zb.test(n.css(a,"display"))&&0===a.offsetWidth?n.swap(a,Cb,function(){return Ib(a,b,d)}):Ib(a,b,d):void 0},set:function(a,c,d){var e=d&&wb(a);return Gb(a,c,d?Hb(a,b,d,"border-box"===n.css(a,"boxSizing",!1,e),e):0)}}}),n.cssHooks.marginRight=yb(k.reliableMarginRight,function(a,b){return b?n.swap(a,{display:"inline-block"},xb,[a,"marginRight"]):void 0}),n.each({margin:"",padding:"",border:"Width"},function(a,b){n.cssHooks[a+b]={expand:function(c){for(var d=0,e={},f="string"==typeof c?c.split(" "):[c];4>d;d++)e[a+R[d]+b]=f[d]||f[d-2]||f[0];return e}},ub.test(a)||(n.cssHooks[a+b].set=Gb)}),n.fn.extend({css:function(a,b){return J(this,function(a,b,c){var d,e,f={},g=0;if(n.isArray(b)){for(d=wb(a),e=b.length;e>g;g++)f[b[g]]=n.css(a,b[g],!1,d);return f}return void 0!==c?n.style(a,b,c):n.css(a,b)},a,b,arguments.length>1)},show:function(){return Jb(this,!0)},hide:function(){return Jb(this)},toggle:function(a){return"boolean"==typeof a?a?this.show():this.hide():this.each(function(){S(this)?n(this).show():n(this).hide()})}});function Kb(a,b,c,d,e){return new Kb.prototype.init(a,b,c,d,e)}n.Tween=Kb,Kb.prototype={constructor:Kb,init:function(a,b,c,d,e,f){this.elem=a,this.prop=c,this.easing=e||"swing",this.options=b,this.start=this.now=this.cur(),this.end=d,this.unit=f||(n.cssNumber[c]?"":"px")},cur:function(){var a=Kb.propHooks[this.prop];return a&&a.get?a.get(this):Kb.propHooks._default.get(this)},run:function(a){var b,c=Kb.propHooks[this.prop];return this.pos=b=this.options.duration?n.easing[this.easing](a,this.options.duration*a,0,1,this.options.duration):a,this.now=(this.end-this.start)*b+this.start,this.options.step&&this.options.step.call(this.elem,this.now,this),c&&c.set?c.set(this):Kb.propHooks._default.set(this),this}},Kb.prototype.init.prototype=Kb.prototype,Kb.propHooks={_default:{get:function(a){var b;return null==a.elem[a.prop]||a.elem.style&&null!=a.elem.style[a.prop]?(b=n.css(a.elem,a.prop,""),b&&"auto"!==b?b:0):a.elem[a.prop]},set:function(a){n.fx.step[a.prop]?n.fx.step[a.prop](a):a.elem.style&&(null!=a.elem.style[n.cssProps[a.prop]]||n.cssHooks[a.prop])?n.style(a.elem,a.prop,a.now+a.unit):a.elem[a.prop]=a.now}}},Kb.propHooks.scrollTop=Kb.propHooks.scrollLeft={set:function(a){a.elem.nodeType&&a.elem.parentNode&&(a.elem[a.prop]=a.now)}},n.easing={linear:function(a){return a},swing:function(a){return.5-Math.cos(a*Math.PI)/2}},n.fx=Kb.prototype.init,n.fx.step={};var Lb,Mb,Nb=/^(?:toggle|show|hide)$/,Ob=new RegExp("^(?:([+-])=|)("+Q+")([a-z%]*)$","i"),Pb=/queueHooks$/,Qb=[Vb],Rb={"*":[function(a,b){var c=this.createTween(a,b),d=c.cur(),e=Ob.exec(b),f=e&&e[3]||(n.cssNumber[a]?"":"px"),g=(n.cssNumber[a]||"px"!==f&&+d)&&Ob.exec(n.css(c.elem,a)),h=1,i=20;if(g&&g[3]!==f){f=f||g[3],e=e||[],g=+d||1;do h=h||".5",g/=h,n.style(c.elem,a,g+f);while(h!==(h=c.cur()/d)&&1!==h&&--i)}return e&&(g=c.start=+g||+d||0,c.unit=f,c.end=e[1]?g+(e[1]+1)*e[2]:+e[2]),c}]};function Sb(){return setTimeout(function(){Lb=void 0}),Lb=n.now()}function Tb(a,b){var c,d=0,e={height:a};for(b=b?1:0;4>d;d+=2-b)c=R[d],e["margin"+c]=e["padding"+c]=a;return b&&(e.opacity=e.width=a),e}function Ub(a,b,c){for(var d,e=(Rb[b]||[]).concat(Rb["*"]),f=0,g=e.length;g>f;f++)if(d=e[f].call(c,b,a))return d}function Vb(a,b,c){var d,e,f,g,h,i,j,k,l=this,m={},o=a.style,p=a.nodeType&&S(a),q=L.get(a,"fxshow");c.queue||(h=n._queueHooks(a,"fx"),null==h.unqueued&&(h.unqueued=0,i=h.empty.fire,h.empty.fire=function(){h.unqueued||i()}),h.unqueued++,l.always(function(){l.always(function(){h.unqueued--,n.queue(a,"fx").length||h.empty.fire()})})),1===a.nodeType&&("height"in b||"width"in b)&&(c.overflow=[o.overflow,o.overflowX,o.overflowY],j=n.css(a,"display"),k="none"===j?L.get(a,"olddisplay")||tb(a.nodeName):j,"inline"===k&&"none"===n.css(a,"float")&&(o.display="inline-block")),c.overflow&&(o.overflow="hidden",l.always(function(){o.overflow=c.overflow[0],o.overflowX=c.overflow[1],o.overflowY=c.overflow[2]}));for(d in b)if(e=b[d],Nb.exec(e)){if(delete b[d],f=f||"toggle"===e,e===(p?"hide":"show")){if("show"!==e||!q||void 0===q[d])continue;p=!0}m[d]=q&&q[d]||n.style(a,d)}else j=void 0;if(n.isEmptyObject(m))"inline"===("none"===j?tb(a.nodeName):j)&&(o.display=j);else{q?"hidden"in q&&(p=q.hidden):q=L.access(a,"fxshow",{}),f&&(q.hidden=!p),p?n(a).show():l.done(function(){n(a).hide()}),l.done(function(){var b;L.remove(a,"fxshow");for(b in m)n.style(a,b,m[b])});for(d in m)g=Ub(p?q[d]:0,d,l),d in q||(q[d]=g.start,p&&(g.end=g.start,g.start="width"===d||"height"===d?1:0))}}function Wb(a,b){var c,d,e,f,g;for(c in a)if(d=n.camelCase(c),e=b[d],f=a[c],n.isArray(f)&&(e=f[1],f=a[c]=f[0]),c!==d&&(a[d]=f,delete a[c]),g=n.cssHooks[d],g&&"expand"in g){f=g.expand(f),delete a[d];for(c in f)c in a||(a[c]=f[c],b[c]=e)}else b[d]=e}function Xb(a,b,c){var d,e,f=0,g=Qb.length,h=n.Deferred().always(function(){delete i.elem}),i=function(){if(e)return!1;for(var b=Lb||Sb(),c=Math.max(0,j.startTime+j.duration-b),d=c/j.duration||0,f=1-d,g=0,i=j.tweens.length;i>g;g++)j.tweens[g].run(f);return h.notifyWith(a,[j,f,c]),1>f&&i?c:(h.resolveWith(a,[j]),!1)},j=h.promise({elem:a,props:n.extend({},b),opts:n.extend(!0,{specialEasing:{}},c),originalProperties:b,originalOptions:c,startTime:Lb||Sb(),duration:c.duration,tweens:[],createTween:function(b,c){var d=n.Tween(a,j.opts,b,c,j.opts.specialEasing[b]||j.opts.easing);return j.tweens.push(d),d},stop:function(b){var c=0,d=b?j.tweens.length:0;if(e)return this;for(e=!0;d>c;c++)j.tweens[c].run(1);return b?h.resolveWith(a,[j,b]):h.rejectWith(a,[j,b]),this}}),k=j.props;for(Wb(k,j.opts.specialEasing);g>f;f++)if(d=Qb[f].call(j,a,k,j.opts))return d;return n.map(k,Ub,j),n.isFunction(j.opts.start)&&j.opts.start.call(a,j),n.fx.timer(n.extend(i,{elem:a,anim:j,queue:j.opts.queue})),j.progress(j.opts.progress).done(j.opts.done,j.opts.complete).fail(j.opts.fail).always(j.opts.always)}n.Animation=n.extend(Xb,{tweener:function(a,b){n.isFunction(a)?(b=a,a=["*"]):a=a.split(" ");for(var c,d=0,e=a.length;e>d;d++)c=a[d],Rb[c]=Rb[c]||[],Rb[c].unshift(b)},prefilter:function(a,b){b?Qb.unshift(a):Qb.push(a)}}),n.speed=function(a,b,c){var d=a&&"object"==typeof a?n.extend({},a):{complete:c||!c&&b||n.isFunction(a)&&a,duration:a,easing:c&&b||b&&!n.isFunction(b)&&b};return d.duration=n.fx.off?0:"number"==typeof d.duration?d.duration:d.duration in n.fx.speeds?n.fx.speeds[d.duration]:n.fx.speeds._default,(null==d.queue||d.queue===!0)&&(d.queue="fx"),d.old=d.complete,d.complete=function(){n.isFunction(d.old)&&d.old.call(this),d.queue&&n.dequeue(this,d.queue)},d},n.fn.extend({fadeTo:function(a,b,c,d){return this.filter(S).css("opacity",0).show().end().animate({opacity:b},a,c,d)},animate:function(a,b,c,d){var e=n.isEmptyObject(a),f=n.speed(b,c,d),g=function(){var b=Xb(this,n.extend({},a),f);(e||L.get(this,"finish"))&&b.stop(!0)};return g.finish=g,e||f.queue===!1?this.each(g):this.queue(f.queue,g)},stop:function(a,b,c){var d=function(a){var b=a.stop;delete a.stop,b(c)};return"string"!=typeof a&&(c=b,b=a,a=void 0),b&&a!==!1&&this.queue(a||"fx",[]),this.each(function(){var b=!0,e=null!=a&&a+"queueHooks",f=n.timers,g=L.get(this);if(e)g[e]&&g[e].stop&&d(g[e]);else for(e in g)g[e]&&g[e].stop&&Pb.test(e)&&d(g[e]);for(e=f.length;e--;)f[e].elem!==this||null!=a&&f[e].queue!==a||(f[e].anim.stop(c),b=!1,f.splice(e,1));(b||!c)&&n.dequeue(this,a)})},finish:function(a){return a!==!1&&(a=a||"fx"),this.each(function(){var b,c=L.get(this),d=c[a+"queue"],e=c[a+"queueHooks"],f=n.timers,g=d?d.length:0;for(c.finish=!0,n.queue(this,a,[]),e&&e.stop&&e.stop.call(this,!0),b=f.length;b--;)f[b].elem===this&&f[b].queue===a&&(f[b].anim.stop(!0),f.splice(b,1));for(b=0;g>b;b++)d[b]&&d[b].finish&&d[b].finish.call(this);delete c.finish})}}),n.each(["toggle","show","hide"],function(a,b){var c=n.fn[b];n.fn[b]=function(a,d,e){return null==a||"boolean"==typeof a?c.apply(this,arguments):this.animate(Tb(b,!0),a,d,e)}}),n.each({slideDown:Tb("show"),slideUp:Tb("hide"),slideToggle:Tb("toggle"),fadeIn:{opacity:"show"},fadeOut:{opacity:"hide"},fadeToggle:{opacity:"toggle"}},function(a,b){n.fn[a]=function(a,c,d){return this.animate(b,a,c,d)}}),n.timers=[],n.fx.tick=function(){var a,b=0,c=n.timers;for(Lb=n.now();b<c.length;b++)a=c[b],a()||c[b]!==a||c.splice(b--,1);c.length||n.fx.stop(),Lb=void 0},n.fx.timer=function(a){n.timers.push(a),a()?n.fx.start():n.timers.pop()},n.fx.interval=13,n.fx.start=function(){Mb||(Mb=setInterval(n.fx.tick,n.fx.interval))},n.fx.stop=function(){clearInterval(Mb),Mb=null},n.fx.speeds={slow:600,fast:200,_default:400},n.fn.delay=function(a,b){return a=n.fx?n.fx.speeds[a]||a:a,b=b||"fx",this.queue(b,function(b,c){var d=setTimeout(b,a);c.stop=function(){clearTimeout(d)}})},function(){var a=l.createElement("input"),b=l.createElement("select"),c=b.appendChild(l.createElement("option"));a.type="checkbox",k.checkOn=""!==a.value,k.optSelected=c.selected,b.disabled=!0,k.optDisabled=!c.disabled,a=l.createElement("input"),a.value="t",a.type="radio",k.radioValue="t"===a.value}();var Yb,Zb,$b=n.expr.attrHandle;n.fn.extend({attr:function(a,b){return J(this,n.attr,a,b,arguments.length>1)},removeAttr:function(a){return this.each(function(){n.removeAttr(this,a)})}}),n.extend({attr:function(a,b,c){var d,e,f=a.nodeType;if(a&&3!==f&&8!==f&&2!==f)return typeof a.getAttribute===U?n.prop(a,b,c):(1===f&&n.isXMLDoc(a)||(b=b.toLowerCase(),d=n.attrHooks[b]||(n.expr.match.bool.test(b)?Zb:Yb)),void 0===c?d&&"get"in d&&null!==(e=d.get(a,b))?e:(e=n.find.attr(a,b),null==e?void 0:e):null!==c?d&&"set"in d&&void 0!==(e=d.set(a,c,b))?e:(a.setAttribute(b,c+""),c):void n.removeAttr(a,b))
},removeAttr:function(a,b){var c,d,e=0,f=b&&b.match(E);if(f&&1===a.nodeType)while(c=f[e++])d=n.propFix[c]||c,n.expr.match.bool.test(c)&&(a[d]=!1),a.removeAttribute(c)},attrHooks:{type:{set:function(a,b){if(!k.radioValue&&"radio"===b&&n.nodeName(a,"input")){var c=a.value;return a.setAttribute("type",b),c&&(a.value=c),b}}}}}),Zb={set:function(a,b,c){return b===!1?n.removeAttr(a,c):a.setAttribute(c,c),c}},n.each(n.expr.match.bool.source.match(/\w+/g),function(a,b){var c=$b[b]||n.find.attr;$b[b]=function(a,b,d){var e,f;return d||(f=$b[b],$b[b]=e,e=null!=c(a,b,d)?b.toLowerCase():null,$b[b]=f),e}});var _b=/^(?:input|select|textarea|button)$/i;n.fn.extend({prop:function(a,b){return J(this,n.prop,a,b,arguments.length>1)},removeProp:function(a){return this.each(function(){delete this[n.propFix[a]||a]})}}),n.extend({propFix:{"for":"htmlFor","class":"className"},prop:function(a,b,c){var d,e,f,g=a.nodeType;if(a&&3!==g&&8!==g&&2!==g)return f=1!==g||!n.isXMLDoc(a),f&&(b=n.propFix[b]||b,e=n.propHooks[b]),void 0!==c?e&&"set"in e&&void 0!==(d=e.set(a,c,b))?d:a[b]=c:e&&"get"in e&&null!==(d=e.get(a,b))?d:a[b]},propHooks:{tabIndex:{get:function(a){return a.hasAttribute("tabindex")||_b.test(a.nodeName)||a.href?a.tabIndex:-1}}}}),k.optSelected||(n.propHooks.selected={get:function(a){var b=a.parentNode;return b&&b.parentNode&&b.parentNode.selectedIndex,null}}),n.each(["tabIndex","readOnly","maxLength","cellSpacing","cellPadding","rowSpan","colSpan","useMap","frameBorder","contentEditable"],function(){n.propFix[this.toLowerCase()]=this});var ac=/[\t\r\n\f]/g;n.fn.extend({addClass:function(a){var b,c,d,e,f,g,h="string"==typeof a&&a,i=0,j=this.length;if(n.isFunction(a))return this.each(function(b){n(this).addClass(a.call(this,b,this.className))});if(h)for(b=(a||"").match(E)||[];j>i;i++)if(c=this[i],d=1===c.nodeType&&(c.className?(" "+c.className+" ").replace(ac," "):" ")){f=0;while(e=b[f++])d.indexOf(" "+e+" ")<0&&(d+=e+" ");g=n.trim(d),c.className!==g&&(c.className=g)}return this},removeClass:function(a){var b,c,d,e,f,g,h=0===arguments.length||"string"==typeof a&&a,i=0,j=this.length;if(n.isFunction(a))return this.each(function(b){n(this).removeClass(a.call(this,b,this.className))});if(h)for(b=(a||"").match(E)||[];j>i;i++)if(c=this[i],d=1===c.nodeType&&(c.className?(" "+c.className+" ").replace(ac," "):"")){f=0;while(e=b[f++])while(d.indexOf(" "+e+" ")>=0)d=d.replace(" "+e+" "," ");g=a?n.trim(d):"",c.className!==g&&(c.className=g)}return this},toggleClass:function(a,b){var c=typeof a;return"boolean"==typeof b&&"string"===c?b?this.addClass(a):this.removeClass(a):this.each(n.isFunction(a)?function(c){n(this).toggleClass(a.call(this,c,this.className,b),b)}:function(){if("string"===c){var b,d=0,e=n(this),f=a.match(E)||[];while(b=f[d++])e.hasClass(b)?e.removeClass(b):e.addClass(b)}else(c===U||"boolean"===c)&&(this.className&&L.set(this,"__className__",this.className),this.className=this.className||a===!1?"":L.get(this,"__className__")||"")})},hasClass:function(a){for(var b=" "+a+" ",c=0,d=this.length;d>c;c++)if(1===this[c].nodeType&&(" "+this[c].className+" ").replace(ac," ").indexOf(b)>=0)return!0;return!1}});var bc=/\r/g;n.fn.extend({val:function(a){var b,c,d,e=this[0];{if(arguments.length)return d=n.isFunction(a),this.each(function(c){var e;1===this.nodeType&&(e=d?a.call(this,c,n(this).val()):a,null==e?e="":"number"==typeof e?e+="":n.isArray(e)&&(e=n.map(e,function(a){return null==a?"":a+""})),b=n.valHooks[this.type]||n.valHooks[this.nodeName.toLowerCase()],b&&"set"in b&&void 0!==b.set(this,e,"value")||(this.value=e))});if(e)return b=n.valHooks[e.type]||n.valHooks[e.nodeName.toLowerCase()],b&&"get"in b&&void 0!==(c=b.get(e,"value"))?c:(c=e.value,"string"==typeof c?c.replace(bc,""):null==c?"":c)}}}),n.extend({valHooks:{option:{get:function(a){var b=n.find.attr(a,"value");return null!=b?b:n.trim(n.text(a))}},select:{get:function(a){for(var b,c,d=a.options,e=a.selectedIndex,f="select-one"===a.type||0>e,g=f?null:[],h=f?e+1:d.length,i=0>e?h:f?e:0;h>i;i++)if(c=d[i],!(!c.selected&&i!==e||(k.optDisabled?c.disabled:null!==c.getAttribute("disabled"))||c.parentNode.disabled&&n.nodeName(c.parentNode,"optgroup"))){if(b=n(c).val(),f)return b;g.push(b)}return g},set:function(a,b){var c,d,e=a.options,f=n.makeArray(b),g=e.length;while(g--)d=e[g],(d.selected=n.inArray(d.value,f)>=0)&&(c=!0);return c||(a.selectedIndex=-1),f}}}}),n.each(["radio","checkbox"],function(){n.valHooks[this]={set:function(a,b){return n.isArray(b)?a.checked=n.inArray(n(a).val(),b)>=0:void 0}},k.checkOn||(n.valHooks[this].get=function(a){return null===a.getAttribute("value")?"on":a.value})}),n.each("blur focus focusin focusout load resize scroll unload click dblclick mousedown mouseup mousemove mouseover mouseout mouseenter mouseleave change select submit keydown keypress keyup error contextmenu".split(" "),function(a,b){n.fn[b]=function(a,c){return arguments.length>0?this.on(b,null,a,c):this.trigger(b)}}),n.fn.extend({hover:function(a,b){return this.mouseenter(a).mouseleave(b||a)},bind:function(a,b,c){return this.on(a,null,b,c)},unbind:function(a,b){return this.off(a,null,b)},delegate:function(a,b,c,d){return this.on(b,a,c,d)},undelegate:function(a,b,c){return 1===arguments.length?this.off(a,"**"):this.off(b,a||"**",c)}});var cc=n.now(),dc=/\?/;n.parseJSON=function(a){return JSON.parse(a+"")},n.parseXML=function(a){var b,c;if(!a||"string"!=typeof a)return null;try{c=new DOMParser,b=c.parseFromString(a,"text/xml")}catch(d){b=void 0}return(!b||b.getElementsByTagName("parsererror").length)&&n.error("Invalid XML: "+a),b};var ec,fc,gc=/#.*$/,hc=/([?&])_=[^&]*/,ic=/^(.*?):[ \t]*([^\r\n]*)$/gm,jc=/^(?:about|app|app-storage|.+-extension|file|res|widget):$/,kc=/^(?:GET|HEAD)$/,lc=/^\/\//,mc=/^([\w.+-]+:)(?:\/\/(?:[^\/?#]*@|)([^\/?#:]*)(?::(\d+)|)|)/,nc={},oc={},pc="*/".concat("*");try{fc=location.href}catch(qc){fc=l.createElement("a"),fc.href="",fc=fc.href}ec=mc.exec(fc.toLowerCase())||[];function rc(a){return function(b,c){"string"!=typeof b&&(c=b,b="*");var d,e=0,f=b.toLowerCase().match(E)||[];if(n.isFunction(c))while(d=f[e++])"+"===d[0]?(d=d.slice(1)||"*",(a[d]=a[d]||[]).unshift(c)):(a[d]=a[d]||[]).push(c)}}function sc(a,b,c,d){var e={},f=a===oc;function g(h){var i;return e[h]=!0,n.each(a[h]||[],function(a,h){var j=h(b,c,d);return"string"!=typeof j||f||e[j]?f?!(i=j):void 0:(b.dataTypes.unshift(j),g(j),!1)}),i}return g(b.dataTypes[0])||!e["*"]&&g("*")}function tc(a,b){var c,d,e=n.ajaxSettings.flatOptions||{};for(c in b)void 0!==b[c]&&((e[c]?a:d||(d={}))[c]=b[c]);return d&&n.extend(!0,a,d),a}function uc(a,b,c){var d,e,f,g,h=a.contents,i=a.dataTypes;while("*"===i[0])i.shift(),void 0===d&&(d=a.mimeType||b.getResponseHeader("Content-Type"));if(d)for(e in h)if(h[e]&&h[e].test(d)){i.unshift(e);break}if(i[0]in c)f=i[0];else{for(e in c){if(!i[0]||a.converters[e+" "+i[0]]){f=e;break}g||(g=e)}f=f||g}return f?(f!==i[0]&&i.unshift(f),c[f]):void 0}function vc(a,b,c,d){var e,f,g,h,i,j={},k=a.dataTypes.slice();if(k[1])for(g in a.converters)j[g.toLowerCase()]=a.converters[g];f=k.shift();while(f)if(a.responseFields[f]&&(c[a.responseFields[f]]=b),!i&&d&&a.dataFilter&&(b=a.dataFilter(b,a.dataType)),i=f,f=k.shift())if("*"===f)f=i;else if("*"!==i&&i!==f){if(g=j[i+" "+f]||j["* "+f],!g)for(e in j)if(h=e.split(" "),h[1]===f&&(g=j[i+" "+h[0]]||j["* "+h[0]])){g===!0?g=j[e]:j[e]!==!0&&(f=h[0],k.unshift(h[1]));break}if(g!==!0)if(g&&a["throws"])b=g(b);else try{b=g(b)}catch(l){return{state:"parsererror",error:g?l:"No conversion from "+i+" to "+f}}}return{state:"success",data:b}}n.extend({active:0,lastModified:{},etag:{},ajaxSettings:{url:fc,type:"GET",isLocal:jc.test(ec[1]),global:!0,processData:!0,async:!0,contentType:"application/x-www-form-urlencoded; charset=UTF-8",accepts:{"*":pc,text:"text/plain",html:"text/html",xml:"application/xml, text/xml",json:"application/json, text/javascript"},contents:{xml:/xml/,html:/html/,json:/json/},responseFields:{xml:"responseXML",text:"responseText",json:"responseJSON"},converters:{"* text":String,"text html":!0,"text json":n.parseJSON,"text xml":n.parseXML},flatOptions:{url:!0,context:!0}},ajaxSetup:function(a,b){return b?tc(tc(a,n.ajaxSettings),b):tc(n.ajaxSettings,a)},ajaxPrefilter:rc(nc),ajaxTransport:rc(oc),ajax:function(a,b){"object"==typeof a&&(b=a,a=void 0),b=b||{};var c,d,e,f,g,h,i,j,k=n.ajaxSetup({},b),l=k.context||k,m=k.context&&(l.nodeType||l.jquery)?n(l):n.event,o=n.Deferred(),p=n.Callbacks("once memory"),q=k.statusCode||{},r={},s={},t=0,u="canceled",v={readyState:0,getResponseHeader:function(a){var b;if(2===t){if(!f){f={};while(b=ic.exec(e))f[b[1].toLowerCase()]=b[2]}b=f[a.toLowerCase()]}return null==b?null:b},getAllResponseHeaders:function(){return 2===t?e:null},setRequestHeader:function(a,b){var c=a.toLowerCase();return t||(a=s[c]=s[c]||a,r[a]=b),this},overrideMimeType:function(a){return t||(k.mimeType=a),this},statusCode:function(a){var b;if(a)if(2>t)for(b in a)q[b]=[q[b],a[b]];else v.always(a[v.status]);return this},abort:function(a){var b=a||u;return c&&c.abort(b),x(0,b),this}};if(o.promise(v).complete=p.add,v.success=v.done,v.error=v.fail,k.url=((a||k.url||fc)+"").replace(gc,"").replace(lc,ec[1]+"//"),k.type=b.method||b.type||k.method||k.type,k.dataTypes=n.trim(k.dataType||"*").toLowerCase().match(E)||[""],null==k.crossDomain&&(h=mc.exec(k.url.toLowerCase()),k.crossDomain=!(!h||h[1]===ec[1]&&h[2]===ec[2]&&(h[3]||("http:"===h[1]?"80":"443"))===(ec[3]||("http:"===ec[1]?"80":"443")))),k.data&&k.processData&&"string"!=typeof k.data&&(k.data=n.param(k.data,k.traditional)),sc(nc,k,b,v),2===t)return v;i=k.global,i&&0===n.active++&&n.event.trigger("ajaxStart"),k.type=k.type.toUpperCase(),k.hasContent=!kc.test(k.type),d=k.url,k.hasContent||(k.data&&(d=k.url+=(dc.test(d)?"&":"?")+k.data,delete k.data),k.cache===!1&&(k.url=hc.test(d)?d.replace(hc,"$1_="+cc++):d+(dc.test(d)?"&":"?")+"_="+cc++)),k.ifModified&&(n.lastModified[d]&&v.setRequestHeader("If-Modified-Since",n.lastModified[d]),n.etag[d]&&v.setRequestHeader("If-None-Match",n.etag[d])),(k.data&&k.hasContent&&k.contentType!==!1||b.contentType)&&v.setRequestHeader("Content-Type",k.contentType),v.setRequestHeader("Accept",k.dataTypes[0]&&k.accepts[k.dataTypes[0]]?k.accepts[k.dataTypes[0]]+("*"!==k.dataTypes[0]?", "+pc+"; q=0.01":""):k.accepts["*"]);for(j in k.headers)v.setRequestHeader(j,k.headers[j]);if(k.beforeSend&&(k.beforeSend.call(l,v,k)===!1||2===t))return v.abort();u="abort";for(j in{success:1,error:1,complete:1})v[j](k[j]);if(c=sc(oc,k,b,v)){v.readyState=1,i&&m.trigger("ajaxSend",[v,k]),k.async&&k.timeout>0&&(g=setTimeout(function(){v.abort("timeout")},k.timeout));try{t=1,c.send(r,x)}catch(w){if(!(2>t))throw w;x(-1,w)}}else x(-1,"No Transport");function x(a,b,f,h){var j,r,s,u,w,x=b;2!==t&&(t=2,g&&clearTimeout(g),c=void 0,e=h||"",v.readyState=a>0?4:0,j=a>=200&&300>a||304===a,f&&(u=uc(k,v,f)),u=vc(k,u,v,j),j?(k.ifModified&&(w=v.getResponseHeader("Last-Modified"),w&&(n.lastModified[d]=w),w=v.getResponseHeader("etag"),w&&(n.etag[d]=w)),204===a||"HEAD"===k.type?x="nocontent":304===a?x="notmodified":(x=u.state,r=u.data,s=u.error,j=!s)):(s=x,(a||!x)&&(x="error",0>a&&(a=0))),v.status=a,v.statusText=(b||x)+"",j?o.resolveWith(l,[r,x,v]):o.rejectWith(l,[v,x,s]),v.statusCode(q),q=void 0,i&&m.trigger(j?"ajaxSuccess":"ajaxError",[v,k,j?r:s]),p.fireWith(l,[v,x]),i&&(m.trigger("ajaxComplete",[v,k]),--n.active||n.event.trigger("ajaxStop")))}return v},getJSON:function(a,b,c){return n.get(a,b,c,"json")},getScript:function(a,b){return n.get(a,void 0,b,"script")}}),n.each(["get","post"],function(a,b){n[b]=function(a,c,d,e){return n.isFunction(c)&&(e=e||d,d=c,c=void 0),n.ajax({url:a,type:b,dataType:e,data:c,success:d})}}),n.each(["ajaxStart","ajaxStop","ajaxComplete","ajaxError","ajaxSuccess","ajaxSend"],function(a,b){n.fn[b]=function(a){return this.on(b,a)}}),n._evalUrl=function(a){return n.ajax({url:a,type:"GET",dataType:"script",async:!1,global:!1,"throws":!0})},n.fn.extend({wrapAll:function(a){var b;return n.isFunction(a)?this.each(function(b){n(this).wrapAll(a.call(this,b))}):(this[0]&&(b=n(a,this[0].ownerDocument).eq(0).clone(!0),this[0].parentNode&&b.insertBefore(this[0]),b.map(function(){var a=this;while(a.firstElementChild)a=a.firstElementChild;return a}).append(this)),this)},wrapInner:function(a){return this.each(n.isFunction(a)?function(b){n(this).wrapInner(a.call(this,b))}:function(){var b=n(this),c=b.contents();c.length?c.wrapAll(a):b.append(a)})},wrap:function(a){var b=n.isFunction(a);return this.each(function(c){n(this).wrapAll(b?a.call(this,c):a)})},unwrap:function(){return this.parent().each(function(){n.nodeName(this,"body")||n(this).replaceWith(this.childNodes)}).end()}}),n.expr.filters.hidden=function(a){return a.offsetWidth<=0&&a.offsetHeight<=0},n.expr.filters.visible=function(a){return!n.expr.filters.hidden(a)};var wc=/%20/g,xc=/\[\]$/,yc=/\r?\n/g,zc=/^(?:submit|button|image|reset|file)$/i,Ac=/^(?:input|select|textarea|keygen)/i;function Bc(a,b,c,d){var e;if(n.isArray(b))n.each(b,function(b,e){c||xc.test(a)?d(a,e):Bc(a+"["+("object"==typeof e?b:"")+"]",e,c,d)});else if(c||"object"!==n.type(b))d(a,b);else for(e in b)Bc(a+"["+e+"]",b[e],c,d)}n.param=function(a,b){var c,d=[],e=function(a,b){b=n.isFunction(b)?b():null==b?"":b,d[d.length]=encodeURIComponent(a)+"="+encodeURIComponent(b)};if(void 0===b&&(b=n.ajaxSettings&&n.ajaxSettings.traditional),n.isArray(a)||a.jquery&&!n.isPlainObject(a))n.each(a,function(){e(this.name,this.value)});else for(c in a)Bc(c,a[c],b,e);return d.join("&").replace(wc,"+")},n.fn.extend({serialize:function(){return n.param(this.serializeArray())},serializeArray:function(){return this.map(function(){var a=n.prop(this,"elements");return a?n.makeArray(a):this}).filter(function(){var a=this.type;return this.name&&!n(this).is(":disabled")&&Ac.test(this.nodeName)&&!zc.test(a)&&(this.checked||!T.test(a))}).map(function(a,b){var c=n(this).val();return null==c?null:n.isArray(c)?n.map(c,function(a){return{name:b.name,value:a.replace(yc,"\r\n")}}):{name:b.name,value:c.replace(yc,"\r\n")}}).get()}}),n.ajaxSettings.xhr=function(){try{return new XMLHttpRequest}catch(a){}};var Cc=0,Dc={},Ec={0:200,1223:204},Fc=n.ajaxSettings.xhr();a.ActiveXObject&&n(a).on("unload",function(){for(var a in Dc)Dc[a]()}),k.cors=!!Fc&&"withCredentials"in Fc,k.ajax=Fc=!!Fc,n.ajaxTransport(function(a){var b;return k.cors||Fc&&!a.crossDomain?{send:function(c,d){var e,f=a.xhr(),g=++Cc;if(f.open(a.type,a.url,a.async,a.username,a.password),a.xhrFields)for(e in a.xhrFields)f[e]=a.xhrFields[e];a.mimeType&&f.overrideMimeType&&f.overrideMimeType(a.mimeType),a.crossDomain||c["X-Requested-With"]||(c["X-Requested-With"]="XMLHttpRequest");for(e in c)f.setRequestHeader(e,c[e]);b=function(a){return function(){b&&(delete Dc[g],b=f.onload=f.onerror=null,"abort"===a?f.abort():"error"===a?d(f.status,f.statusText):d(Ec[f.status]||f.status,f.statusText,"string"==typeof f.responseText?{text:f.responseText}:void 0,f.getAllResponseHeaders()))}},f.onload=b(),f.onerror=b("error"),b=Dc[g]=b("abort");try{f.send(a.hasContent&&a.data||null)}catch(h){if(b)throw h}},abort:function(){b&&b()}}:void 0}),n.ajaxSetup({accepts:{script:"text/javascript, application/javascript, application/ecmascript, application/x-ecmascript"},contents:{script:/(?:java|ecma)script/},converters:{"text script":function(a){return n.globalEval(a),a}}}),n.ajaxPrefilter("script",function(a){void 0===a.cache&&(a.cache=!1),a.crossDomain&&(a.type="GET")}),n.ajaxTransport("script",function(a){if(a.crossDomain){var b,c;return{send:function(d,e){b=n("<script>").prop({async:!0,charset:a.scriptCharset,src:a.url}).on("load error",c=function(a){b.remove(),c=null,a&&e("error"===a.type?404:200,a.type)}),l.head.appendChild(b[0])},abort:function(){c&&c()}}}});var Gc=[],Hc=/(=)\?(?=&|$)|\?\?/;n.ajaxSetup({jsonp:"callback",jsonpCallback:function(){var a=Gc.pop()||n.expando+"_"+cc++;return this[a]=!0,a}}),n.ajaxPrefilter("json jsonp",function(b,c,d){var e,f,g,h=b.jsonp!==!1&&(Hc.test(b.url)?"url":"string"==typeof b.data&&!(b.contentType||"").indexOf("application/x-www-form-urlencoded")&&Hc.test(b.data)&&"data");return h||"jsonp"===b.dataTypes[0]?(e=b.jsonpCallback=n.isFunction(b.jsonpCallback)?b.jsonpCallback():b.jsonpCallback,h?b[h]=b[h].replace(Hc,"$1"+e):b.jsonp!==!1&&(b.url+=(dc.test(b.url)?"&":"?")+b.jsonp+"="+e),b.converters["script json"]=function(){return g||n.error(e+" was not called"),g[0]},b.dataTypes[0]="json",f=a[e],a[e]=function(){g=arguments},d.always(function(){a[e]=f,b[e]&&(b.jsonpCallback=c.jsonpCallback,Gc.push(e)),g&&n.isFunction(f)&&f(g[0]),g=f=void 0}),"script"):void 0}),n.parseHTML=function(a,b,c){if(!a||"string"!=typeof a)return null;"boolean"==typeof b&&(c=b,b=!1),b=b||l;var d=v.exec(a),e=!c&&[];return d?[b.createElement(d[1])]:(d=n.buildFragment([a],b,e),e&&e.length&&n(e).remove(),n.merge([],d.childNodes))};var Ic=n.fn.load;n.fn.load=function(a,b,c){if("string"!=typeof a&&Ic)return Ic.apply(this,arguments);var d,e,f,g=this,h=a.indexOf(" ");return h>=0&&(d=n.trim(a.slice(h)),a=a.slice(0,h)),n.isFunction(b)?(c=b,b=void 0):b&&"object"==typeof b&&(e="POST"),g.length>0&&n.ajax({url:a,type:e,dataType:"html",data:b}).done(function(a){f=arguments,g.html(d?n("<div>").append(n.parseHTML(a)).find(d):a)}).complete(c&&function(a,b){g.each(c,f||[a.responseText,b,a])}),this},n.expr.filters.animated=function(a){return n.grep(n.timers,function(b){return a===b.elem}).length};var Jc=a.document.documentElement;function Kc(a){return n.isWindow(a)?a:9===a.nodeType&&a.defaultView}n.offset={setOffset:function(a,b,c){var d,e,f,g,h,i,j,k=n.css(a,"position"),l=n(a),m={};"static"===k&&(a.style.position="relative"),h=l.offset(),f=n.css(a,"top"),i=n.css(a,"left"),j=("absolute"===k||"fixed"===k)&&(f+i).indexOf("auto")>-1,j?(d=l.position(),g=d.top,e=d.left):(g=parseFloat(f)||0,e=parseFloat(i)||0),n.isFunction(b)&&(b=b.call(a,c,h)),null!=b.top&&(m.top=b.top-h.top+g),null!=b.left&&(m.left=b.left-h.left+e),"using"in b?b.using.call(a,m):l.css(m)}},n.fn.extend({offset:function(a){if(arguments.length)return void 0===a?this:this.each(function(b){n.offset.setOffset(this,a,b)});var b,c,d=this[0],e={top:0,left:0},f=d&&d.ownerDocument;if(f)return b=f.documentElement,n.contains(b,d)?(typeof d.getBoundingClientRect!==U&&(e=d.getBoundingClientRect()),c=Kc(f),{top:e.top+c.pageYOffset-b.clientTop,left:e.left+c.pageXOffset-b.clientLeft}):e},position:function(){if(this[0]){var a,b,c=this[0],d={top:0,left:0};return"fixed"===n.css(c,"position")?b=c.getBoundingClientRect():(a=this.offsetParent(),b=this.offset(),n.nodeName(a[0],"html")||(d=a.offset()),d.top+=n.css(a[0],"borderTopWidth",!0),d.left+=n.css(a[0],"borderLeftWidth",!0)),{top:b.top-d.top-n.css(c,"marginTop",!0),left:b.left-d.left-n.css(c,"marginLeft",!0)}}},offsetParent:function(){return this.map(function(){var a=this.offsetParent||Jc;while(a&&!n.nodeName(a,"html")&&"static"===n.css(a,"position"))a=a.offsetParent;return a||Jc})}}),n.each({scrollLeft:"pageXOffset",scrollTop:"pageYOffset"},function(b,c){var d="pageYOffset"===c;n.fn[b]=function(e){return J(this,function(b,e,f){var g=Kc(b);return void 0===f?g?g[c]:b[e]:void(g?g.scrollTo(d?a.pageXOffset:f,d?f:a.pageYOffset):b[e]=f)},b,e,arguments.length,null)}}),n.each(["top","left"],function(a,b){n.cssHooks[b]=yb(k.pixelPosition,function(a,c){return c?(c=xb(a,b),vb.test(c)?n(a).position()[b]+"px":c):void 0})}),n.each({Height:"height",Width:"width"},function(a,b){n.each({padding:"inner"+a,content:b,"":"outer"+a},function(c,d){n.fn[d]=function(d,e){var f=arguments.length&&(c||"boolean"!=typeof d),g=c||(d===!0||e===!0?"margin":"border");return J(this,function(b,c,d){var e;return n.isWindow(b)?b.document.documentElement["client"+a]:9===b.nodeType?(e=b.documentElement,Math.max(b.body["scroll"+a],e["scroll"+a],b.body["offset"+a],e["offset"+a],e["client"+a])):void 0===d?n.css(b,c,g):n.style(b,c,d,g)},b,f?d:void 0,f,null)}})}),n.fn.size=function(){return this.length},n.fn.andSelf=n.fn.addBack,"function"==typeof define&&define.amd&&define("jquery",[],function(){return n});var Lc=a.jQuery,Mc=a.$;return n.noConflict=function(b){return a.$===n&&(a.$=Mc),b&&a.jQuery===n&&(a.jQuery=Lc),n},typeof b===U&&(a.jQuery=a.$=n),n});
- </script>
-
- <!--<script src="https://maxcdn.bootstrapcdn.com/bootstrap/3.2.0/js/bootstrap.min.js"></script>-->
- <script>
-/*!
+</script>
+ <script>/*!
* Bootstrap v3.2.0 (http://getbootstrap.com)
* Copyright 2011-2014 Twitter, Inc.
* Licensed under MIT (https://github.com/twbs/bootstrap/blob/master/LICENSE)
*/
-if("undefined"==typeof jQuery)throw new Error("Bootstrap's JavaScript requires jQuery");+function(a){"use strict";function b(){var a=document.createElement("bootstrap"),b={WebkitTransition:"webkitTransitionEnd",MozTransition:"transitionend",OTransition:"oTransitionEnd otransitionend",transition:"transitionend"};for(var c in b)if(void 0!==a.style[c])return{end:b[c]};return!1}a.fn.emulateTransitionEnd=function(b){var c=!1,d=this;a(this).one("bsTransitionEnd",function(){c=!0});var e=function(){c||a(d).trigger(a.support.transition.end)};return setTimeout(e,b),this},a(function(){a.support.transition=b(),a.support.transition&&(a.event.special.bsTransitionEnd={bindType:a.support.transition.end,delegateType:a.support.transition.end,handle:function(b){return a(b.target).is(this)?b.handleObj.handler.apply(this,arguments):void 0}})})}(jQuery),+function(a){"use strict";function b(b){return this.each(function(){var c=a(this),e=c.data("bs.alert");e||c.data("bs.alert",e=new d(this)),"string"==typeof b&&e[b].call(c)})}var c='[data-dismiss="alert"]',d=function(b){a(b).on("click",c,this.close)};d.VERSION="3.2.0",d.prototype.close=function(b){function c(){f.detach().trigger("closed.bs.alert").remove()}var d=a(this),e=d.attr("data-target");e||(e=d.attr("href"),e=e&&e.replace(/.*(?=#[^\s]*$)/,""));var f=a(e);b&&b.preventDefault(),f.length||(f=d.hasClass("alert")?d:d.parent()),f.trigger(b=a.Event("close.bs.alert")),b.isDefaultPrevented()||(f.removeClass("in"),a.support.transition&&f.hasClass("fade")?f.one("bsTransitionEnd",c).emulateTransitionEnd(150):c())};var e=a.fn.alert;a.fn.alert=b,a.fn.alert.Constructor=d,a.fn.alert.noConflict=function(){return a.fn.alert=e,this},a(document).on("click.bs.alert.data-api",c,d.prototype.close)}(jQuery),+function(a){"use strict";function b(b){return this.each(function(){var d=a(this),e=d.data("bs.button"),f="object"==typeof b&&b;e||d.data("bs.button",e=new c(this,f)),"toggle"==b?e.toggle():b&&e.setState(b)})}var c=function(b,d){this.$element=a(b),this.options=a.extend({},c.DEFAULTS,d),this.isLoading=!1};c.VERSION="3.2.0",c.DEFAULTS={loadingText:"loading..."},c.prototype.setState=function(b){var c="disabled",d=this.$element,e=d.is("input")?"val":"html",f=d.data();b+="Text",null==f.resetText&&d.data("resetText",d[e]()),d[e](null==f[b]?this.options[b]:f[b]),setTimeout(a.proxy(function(){"loadingText"==b?(this.isLoading=!0,d.addClass(c).attr(c,c)):this.isLoading&&(this.isLoading=!1,d.removeClass(c).removeAttr(c))},this),0)},c.prototype.toggle=function(){var a=!0,b=this.$element.closest('[data-toggle="buttons"]');if(b.length){var c=this.$element.find("input");"radio"==c.prop("type")&&(c.prop("checked")&&this.$element.hasClass("active")?a=!1:b.find(".active").removeClass("active")),a&&c.prop("checked",!this.$element.hasClass("active")).trigger("change")}a&&this.$element.toggleClass("active")};var d=a.fn.button;a.fn.button=b,a.fn.button.Constructor=c,a.fn.button.noConflict=function(){return a.fn.button=d,this},a(document).on("click.bs.button.data-api",'[data-toggle^="button"]',function(c){var d=a(c.target);d.hasClass("btn")||(d=d.closest(".btn")),b.call(d,"toggle"),c.preventDefault()})}(jQuery),+function(a){"use strict";function b(b){return this.each(function(){var d=a(this),e=d.data("bs.carousel"),f=a.extend({},c.DEFAULTS,d.data(),"object"==typeof b&&b),g="string"==typeof b?b:f.slide;e||d.data("bs.carousel",e=new c(this,f)),"number"==typeof b?e.to(b):g?e[g]():f.interval&&e.pause().cycle()})}var c=function(b,c){this.$element=a(b).on("keydown.bs.carousel",a.proxy(this.keydown,this)),this.$indicators=this.$element.find(".carousel-indicators"),this.options=c,this.paused=this.sliding=this.interval=this.$active=this.$items=null,"hover"==this.options.pause&&this.$element.on("mouseenter.bs.carousel",a.proxy(this.pause,this)).on("mouseleave.bs.carousel",a.proxy(this.cycle,this))};c.VERSION="3.2.0",c.DEFAULTS={interval:5e3,pause:"hover",wrap:!0},c.prototype.keydown=function(a){switch(a.which){case 37:this.prev();break;case 39:this.next();break;default:return}a.preventDefault()},c.prototype.cycle=function(b){return b||(this.paused=!1),this.interval&&clearInterval(this.interval),this.options.interval&&!this.paused&&(this.interval=setInterval(a.proxy(this.next,this),this.options.interval)),this},c.prototype.getItemIndex=function(a){return this.$items=a.parent().children(".item"),this.$items.index(a||this.$active)},c.prototype.to=function(b){var c=this,d=this.getItemIndex(this.$active=this.$element.find(".item.active"));return b>this.$items.length-1||0>b?void 0:this.sliding?this.$element.one("slid.bs.carousel",function(){c.to(b)}):d==b?this.pause().cycle():this.slide(b>d?"next":"prev",a(this.$items[b]))},c.prototype.pause=function(b){return b||(this.paused=!0),this.$element.find(".next, .prev").length&&a.support.transition&&(this.$element.trigger(a.support.transition.end),this.cycle(!0)),this.interval=clearInterval(this.interval),this},c.prototype.next=function(){return this.sliding?void 0:this.slide("next")},c.prototype.prev=function(){return this.sliding?void 0:this.slide("prev")},c.prototype.slide=function(b,c){var d=this.$element.find(".item.active"),e=c||d[b](),f=this.interval,g="next"==b?"left":"right",h="next"==b?"first":"last",i=this;if(!e.length){if(!this.options.wrap)return;e=this.$element.find(".item")[h]()}if(e.hasClass("active"))return this.sliding=!1;var j=e[0],k=a.Event("slide.bs.carousel",{relatedTarget:j,direction:g});if(this.$element.trigger(k),!k.isDefaultPrevented()){if(this.sliding=!0,f&&this.pause(),this.$indicators.length){this.$indicators.find(".active").removeClass("active");var l=a(this.$indicators.children()[this.getItemIndex(e)]);l&&l.addClass("active")}var m=a.Event("slid.bs.carousel",{relatedTarget:j,direction:g});return a.support.transition&&this.$element.hasClass("slide")?(e.addClass(b),e[0].offsetWidth,d.addClass(g),e.addClass(g),d.one("bsTransitionEnd",function(){e.removeClass([b,g].join(" ")).addClass("active"),d.removeClass(["active",g].join(" ")),i.sliding=!1,setTimeout(function(){i.$element.trigger(m)},0)}).emulateTransitionEnd(1e3*d.css("transition-duration").slice(0,-1))):(d.removeClass("active"),e.addClass("active"),this.sliding=!1,this.$element.trigger(m)),f&&this.cycle(),this}};var d=a.fn.carousel;a.fn.carousel=b,a.fn.carousel.Constructor=c,a.fn.carousel.noConflict=function(){return a.fn.carousel=d,this},a(document).on("click.bs.carousel.data-api","[data-slide], [data-slide-to]",function(c){var d,e=a(this),f=a(e.attr("data-target")||(d=e.attr("href"))&&d.replace(/.*(?=#[^\s]+$)/,""));if(f.hasClass("carousel")){var g=a.extend({},f.data(),e.data()),h=e.attr("data-slide-to");h&&(g.interval=!1),b.call(f,g),h&&f.data("bs.carousel").to(h),c.preventDefault()}}),a(window).on("load",function(){a('[data-ride="carousel"]').each(function(){var c=a(this);b.call(c,c.data())})})}(jQuery),+function(a){"use strict";function b(b){return this.each(function(){var d=a(this),e=d.data("bs.collapse"),f=a.extend({},c.DEFAULTS,d.data(),"object"==typeof b&&b);!e&&f.toggle&&"show"==b&&(b=!b),e||d.data("bs.collapse",e=new c(this,f)),"string"==typeof b&&e[b]()})}var c=function(b,d){this.$element=a(b),this.options=a.extend({},c.DEFAULTS,d),this.transitioning=null,this.options.parent&&(this.$parent=a(this.options.parent)),this.options.toggle&&this.toggle()};c.VERSION="3.2.0",c.DEFAULTS={toggle:!0},c.prototype.dimension=function(){var a=this.$element.hasClass("width");return a?"width":"height"},c.prototype.show=function(){if(!this.transitioning&&!this.$element.hasClass("in")){var c=a.Event("show.bs.collapse");if(this.$element.trigger(c),!c.isDefaultPrevented()){var d=this.$parent&&this.$parent.find("> .panel > .in");if(d&&d.length){var e=d.data("bs.collapse");if(e&&e.transitioning)return;b.call(d,"hide"),e||d.data("bs.collapse",null)}var f=this.dimension();this.$element.removeClass("collapse").addClass("collapsing")[f](0),this.transitioning=1;var g=function(){this.$element.removeClass("collapsing").addClass("collapse in")[f](""),this.transitioning=0,this.$element.trigger("shown.bs.collapse")};if(!a.support.transition)return g.call(this);var h=a.camelCase(["scroll",f].join("-"));this.$element.one("bsTransitionEnd",a.proxy(g,this)).emulateTransitionEnd(350)[f](this.$element[0][h])}}},c.prototype.hide=function(){if(!this.transitioning&&this.$element.hasClass("in")){var b=a.Event("hide.bs.collapse");if(this.$element.trigger(b),!b.isDefaultPrevented()){var c=this.dimension();this.$element[c](this.$element[c]())[0].offsetHeight,this.$element.addClass("collapsing").removeClass("collapse").removeClass("in"),this.transitioning=1;var d=function(){this.transitioning=0,this.$element.trigger("hidden.bs.collapse").removeClass("collapsing").addClass("collapse")};return a.support.transition?void this.$element[c](0).one("bsTransitionEnd",a.proxy(d,this)).emulateTransitionEnd(350):d.call(this)}}},c.prototype.toggle=function(){this[this.$element.hasClass("in")?"hide":"show"]()};var d=a.fn.collapse;a.fn.collapse=b,a.fn.collapse.Constructor=c,a.fn.collapse.noConflict=function(){return a.fn.collapse=d,this},a(document).on("click.bs.collapse.data-api",'[data-toggle="collapse"]',function(c){var d,e=a(this),f=e.attr("data-target")||c.preventDefault()||(d=e.attr("href"))&&d.replace(/.*(?=#[^\s]+$)/,""),g=a(f),h=g.data("bs.collapse"),i=h?"toggle":e.data(),j=e.attr("data-parent"),k=j&&a(j);h&&h.transitioning||(k&&k.find('[data-toggle="collapse"][data-parent="'+j+'"]').not(e).addClass("collapsed"),e[g.hasClass("in")?"addClass":"removeClass"]("collapsed")),b.call(g,i)})}(jQuery),+function(a){"use strict";function b(b){b&&3===b.which||(a(e).remove(),a(f).each(function(){var d=c(a(this)),e={relatedTarget:this};d.hasClass("open")&&(d.trigger(b=a.Event("hide.bs.dropdown",e)),b.isDefaultPrevented()||d.removeClass("open").trigger("hidden.bs.dropdown",e))}))}function c(b){var c=b.attr("data-target");c||(c=b.attr("href"),c=c&&/#[A-Za-z]/.test(c)&&c.replace(/.*(?=#[^\s]*$)/,""));var d=c&&a(c);return d&&d.length?d:b.parent()}function d(b){return this.each(function(){var c=a(this),d=c.data("bs.dropdown");d||c.data("bs.dropdown",d=new g(this)),"string"==typeof b&&d[b].call(c)})}var e=".dropdown-backdrop",f='[data-toggle="dropdown"]',g=function(b){a(b).on("click.bs.dropdown",this.toggle)};g.VERSION="3.2.0",g.prototype.toggle=function(d){var e=a(this);if(!e.is(".disabled, :disabled")){var f=c(e),g=f.hasClass("open");if(b(),!g){"ontouchstart"in document.documentElement&&!f.closest(".navbar-nav").length&&a('<div class="dropdown-backdrop"/>').insertAfter(a(this)).on("click",b);var h={relatedTarget:this};if(f.trigger(d=a.Event("show.bs.dropdown",h)),d.isDefaultPrevented())return;e.trigger("focus"),f.toggleClass("open").trigger("shown.bs.dropdown",h)}return!1}},g.prototype.keydown=function(b){if(/(38|40|27)/.test(b.keyCode)){var d=a(this);if(b.preventDefault(),b.stopPropagation(),!d.is(".disabled, :disabled")){var e=c(d),g=e.hasClass("open");if(!g||g&&27==b.keyCode)return 27==b.which&&e.find(f).trigger("focus"),d.trigger("click");var h=" li:not(.divider):visible a",i=e.find('[role="menu"]'+h+', [role="listbox"]'+h);if(i.length){var j=i.index(i.filter(":focus"));38==b.keyCode&&j>0&&j--,40==b.keyCode&&j<i.length-1&&j++,~j||(j=0),i.eq(j).trigger("focus")}}}};var h=a.fn.dropdown;a.fn.dropdown=d,a.fn.dropdown.Constructor=g,a.fn.dropdown.noConflict=function(){return a.fn.dropdown=h,this},a(document).on("click.bs.dropdown.data-api",b).on("click.bs.dropdown.data-api",".dropdown form",function(a){a.stopPropagation()}).on("click.bs.dropdown.data-api",f,g.prototype.toggle).on("keydown.bs.dropdown.data-api",f+', [role="menu"], [role="listbox"]',g.prototype.keydown)}(jQuery),+function(a){"use strict";function b(b,d){return this.each(function(){var e=a(this),f=e.data("bs.modal"),g=a.extend({},c.DEFAULTS,e.data(),"object"==typeof b&&b);f||e.data("bs.modal",f=new c(this,g)),"string"==typeof b?f[b](d):g.show&&f.show(d)})}var c=function(b,c){this.options=c,this.$body=a(document.body),this.$element=a(b),this.$backdrop=this.isShown=null,this.scrollbarWidth=0,this.options.remote&&this.$element.find(".modal-content").load(this.options.remote,a.proxy(function(){this.$element.trigger("loaded.bs.modal")},this))};c.VERSION="3.2.0",c.DEFAULTS={backdrop:!0,keyboard:!0,show:!0},c.prototype.toggle=function(a){return this.isShown?this.hide():this.show(a)},c.prototype.show=function(b){var c=this,d=a.Event("show.bs.modal",{relatedTarget:b});this.$element.trigger(d),this.isShown||d.isDefaultPrevented()||(this.isShown=!0,this.checkScrollbar(),this.$body.addClass("modal-open"),this.setScrollbar(),this.escape(),this.$element.on("click.dismiss.bs.modal",'[data-dismiss="modal"]',a.proxy(this.hide,this)),this.backdrop(function(){var d=a.support.transition&&c.$element.hasClass("fade");c.$element.parent().length||c.$element.appendTo(c.$body),c.$element.show().scrollTop(0),d&&c.$element[0].offsetWidth,c.$element.addClass("in").attr("aria-hidden",!1),c.enforceFocus();var e=a.Event("shown.bs.modal",{relatedTarget:b});d?c.$element.find(".modal-dialog").one("bsTransitionEnd",function(){c.$element.trigger("focus").trigger(e)}).emulateTransitionEnd(300):c.$element.trigger("focus").trigger(e)}))},c.prototype.hide=function(b){b&&b.preventDefault(),b=a.Event("hide.bs.modal"),this.$element.trigger(b),this.isShown&&!b.isDefaultPrevented()&&(this.isShown=!1,this.$body.removeClass("modal-open"),this.resetScrollbar(),this.escape(),a(document).off("focusin.bs.modal"),this.$element.removeClass("in").attr("aria-hidden",!0).off("click.dismiss.bs.modal"),a.support.transition&&this.$element.hasClass("fade")?this.$element.one("bsTransitionEnd",a.proxy(this.hideModal,this)).emulateTransitionEnd(300):this.hideModal())},c.prototype.enforceFocus=function(){a(document).off("focusin.bs.modal").on("focusin.bs.modal",a.proxy(function(a){this.$element[0]===a.target||this.$element.has(a.target).length||this.$element.trigger("focus")},this))},c.prototype.escape=function(){this.isShown&&this.options.keyboard?this.$element.on("keyup.dismiss.bs.modal",a.proxy(function(a){27==a.which&&this.hide()},this)):this.isShown||this.$element.off("keyup.dismiss.bs.modal")},c.prototype.hideModal=function(){var a=this;this.$element.hide(),this.backdrop(function(){a.$element.trigger("hidden.bs.modal")})},c.prototype.removeBackdrop=function(){this.$backdrop&&this.$backdrop.remove(),this.$backdrop=null},c.prototype.backdrop=function(b){var c=this,d=this.$element.hasClass("fade")?"fade":"";if(this.isShown&&this.options.backdrop){var e=a.support.transition&&d;if(this.$backdrop=a('<div class="modal-backdrop '+d+'" />').appendTo(this.$body),this.$element.on("click.dismiss.bs.modal",a.proxy(function(a){a.target===a.currentTarget&&("static"==this.options.backdrop?this.$element[0].focus.call(this.$element[0]):this.hide.call(this))},this)),e&&this.$backdrop[0].offsetWidth,this.$backdrop.addClass("in"),!b)return;e?this.$backdrop.one("bsTransitionEnd",b).emulateTransitionEnd(150):b()}else if(!this.isShown&&this.$backdrop){this.$backdrop.removeClass("in");var f=function(){c.removeBackdrop(),b&&b()};a.support.transition&&this.$element.hasClass("fade")?this.$backdrop.one("bsTransitionEnd",f).emulateTransitionEnd(150):f()}else b&&b()},c.prototype.checkScrollbar=function(){document.body.clientWidth>=window.innerWidth||(this.scrollbarWidth=this.scrollbarWidth||this.measureScrollbar())},c.prototype.setScrollbar=function(){var a=parseInt(this.$body.css("padding-right")||0,10);this.scrollbarWidth&&this.$body.css("padding-right",a+this.scrollbarWidth)},c.prototype.resetScrollbar=function(){this.$body.css("padding-right","")},c.prototype.measureScrollbar=function(){var a=document.createElement("div");a.className="modal-scrollbar-measure",this.$body.append(a);var b=a.offsetWidth-a.clientWidth;return this.$body[0].removeChild(a),b};var d=a.fn.modal;a.fn.modal=b,a.fn.modal.Constructor=c,a.fn.modal.noConflict=function(){return a.fn.modal=d,this},a(document).on("click.bs.modal.data-api",'[data-toggle="modal"]',function(c){var d=a(this),e=d.attr("href"),f=a(d.attr("data-target")||e&&e.replace(/.*(?=#[^\s]+$)/,"")),g=f.data("bs.modal")?"toggle":a.extend({remote:!/#/.test(e)&&e},f.data(),d.data());d.is("a")&&c.preventDefault(),f.one("show.bs.modal",function(a){a.isDefaultPrevented()||f.one("hidden.bs.modal",function(){d.is(":visible")&&d.trigger("focus")})}),b.call(f,g,this)})}(jQuery),+function(a){"use strict";function b(b){return this.each(function(){var d=a(this),e=d.data("bs.tooltip"),f="object"==typeof b&&b;(e||"destroy"!=b)&&(e||d.data("bs.tooltip",e=new c(this,f)),"string"==typeof b&&e[b]())})}var c=function(a,b){this.type=this.options=this.enabled=this.timeout=this.hoverState=this.$element=null,this.init("tooltip",a,b)};c.VERSION="3.2.0",c.DEFAULTS={animation:!0,placement:"top",selector:!1,template:'<div class="tooltip" role="tooltip"><div class="tooltip-arrow"></div><div class="tooltip-inner"></div></div>',trigger:"hover focus",title:"",delay:0,html:!1,container:!1,viewport:{selector:"body",padding:0}},c.prototype.init=function(b,c,d){this.enabled=!0,this.type=b,this.$element=a(c),this.options=this.getOptions(d),this.$viewport=this.options.viewport&&a(this.options.viewport.selector||this.options.viewport);for(var e=this.options.trigger.split(" "),f=e.length;f--;){var g=e[f];if("click"==g)this.$element.on("click."+this.type,this.options.selector,a.proxy(this.toggle,this));else if("manual"!=g){var h="hover"==g?"mouseenter":"focusin",i="hover"==g?"mouseleave":"focusout";this.$element.on(h+"."+this.type,this.options.selector,a.proxy(this.enter,this)),this.$element.on(i+"."+this.type,this.options.selector,a.proxy(this.leave,this))}}this.options.selector?this._options=a.extend({},this.options,{trigger:"manual",selector:""}):this.fixTitle()},c.prototype.getDefaults=function(){return c.DEFAULTS},c.prototype.getOptions=function(b){return b=a.extend({},this.getDefaults(),this.$element.data(),b),b.delay&&"number"==typeof b.delay&&(b.delay={show:b.delay,hide:b.delay}),b},c.prototype.getDelegateOptions=function(){var b={},c=this.getDefaults();return this._options&&a.each(this._options,function(a,d){c[a]!=d&&(b[a]=d)}),b},c.prototype.enter=function(b){var c=b instanceof this.constructor?b:a(b.currentTarget).data("bs."+this.type);return c||(c=new this.constructor(b.currentTarget,this.getDelegateOptions()),a(b.currentTarget).data("bs."+this.type,c)),clearTimeout(c.timeout),c.hoverState="in",c.options.delay&&c.options.delay.show?void(c.timeout=setTimeout(function(){"in"==c.hoverState&&c.show()},c.options.delay.show)):c.show()},c.prototype.leave=function(b){var c=b instanceof this.constructor?b:a(b.currentTarget).data("bs."+this.type);return c||(c=new this.constructor(b.currentTarget,this.getDelegateOptions()),a(b.currentTarget).data("bs."+this.type,c)),clearTimeout(c.timeout),c.hoverState="out",c.options.delay&&c.options.delay.hide?void(c.timeout=setTimeout(function(){"out"==c.hoverState&&c.hide()},c.options.delay.hide)):c.hide()},c.prototype.show=function(){var b=a.Event("show.bs."+this.type);if(this.hasContent()&&this.enabled){this.$element.trigger(b);var c=a.contains(document.documentElement,this.$element[0]);if(b.isDefaultPrevented()||!c)return;var d=this,e=this.tip(),f=this.getUID(this.type);this.setContent(),e.attr("id",f),this.$element.attr("aria-describedby",f),this.options.animation&&e.addClass("fade");var g="function"==typeof this.options.placement?this.options.placement.call(this,e[0],this.$element[0]):this.options.placement,h=/\s?auto?\s?/i,i=h.test(g);i&&(g=g.replace(h,"")||"top"),e.detach().css({top:0,left:0,display:"block"}).addClass(g).data("bs."+this.type,this),this.options.container?e.appendTo(this.options.container):e.insertAfter(this.$element);var j=this.getPosition(),k=e[0].offsetWidth,l=e[0].offsetHeight;if(i){var m=g,n=this.$element.parent(),o=this.getPosition(n);g="bottom"==g&&j.top+j.height+l-o.scroll>o.height?"top":"top"==g&&j.top-o.scroll-l<0?"bottom":"right"==g&&j.right+k>o.width?"left":"left"==g&&j.left-k<o.left?"right":g,e.removeClass(m).addClass(g)}var p=this.getCalculatedOffset(g,j,k,l);this.applyPlacement(p,g);var q=function(){d.$element.trigger("shown.bs."+d.type),d.hoverState=null};a.support.transition&&this.$tip.hasClass("fade")?e.one("bsTransitionEnd",q).emulateTransitionEnd(150):q()}},c.prototype.applyPlacement=function(b,c){var d=this.tip(),e=d[0].offsetWidth,f=d[0].offsetHeight,g=parseInt(d.css("margin-top"),10),h=parseInt(d.css("margin-left"),10);isNaN(g)&&(g=0),isNaN(h)&&(h=0),b.top=b.top+g,b.left=b.left+h,a.offset.setOffset(d[0],a.extend({using:function(a){d.css({top:Math.round(a.top),left:Math.round(a.left)})}},b),0),d.addClass("in");var i=d[0].offsetWidth,j=d[0].offsetHeight;"top"==c&&j!=f&&(b.top=b.top+f-j);var k=this.getViewportAdjustedDelta(c,b,i,j);k.left?b.left+=k.left:b.top+=k.top;var l=k.left?2*k.left-e+i:2*k.top-f+j,m=k.left?"left":"top",n=k.left?"offsetWidth":"offsetHeight";d.offset(b),this.replaceArrow(l,d[0][n],m)},c.prototype.replaceArrow=function(a,b,c){this.arrow().css(c,a?50*(1-a/b)+"%":"")},c.prototype.setContent=function(){var a=this.tip(),b=this.getTitle();a.find(".tooltip-inner")[this.options.html?"html":"text"](b),a.removeClass("fade in top bottom left right")},c.prototype.hide=function(){function b(){"in"!=c.hoverState&&d.detach(),c.$element.trigger("hidden.bs."+c.type)}var c=this,d=this.tip(),e=a.Event("hide.bs."+this.type);return this.$element.removeAttr("aria-describedby"),this.$element.trigger(e),e.isDefaultPrevented()?void 0:(d.removeClass("in"),a.support.transition&&this.$tip.hasClass("fade")?d.one("bsTransitionEnd",b).emulateTransitionEnd(150):b(),this.hoverState=null,this)},c.prototype.fixTitle=function(){var a=this.$element;(a.attr("title")||"string"!=typeof a.attr("data-original-title"))&&a.attr("data-original-title",a.attr("title")||"").attr("title","")},c.prototype.hasContent=function(){return this.getTitle()},c.prototype.getPosition=function(b){b=b||this.$element;var c=b[0],d="BODY"==c.tagName;return a.extend({},"function"==typeof c.getBoundingClientRect?c.getBoundingClientRect():null,{scroll:d?document.documentElement.scrollTop||document.body.scrollTop:b.scrollTop(),width:d?a(window).width():b.outerWidth(),height:d?a(window).height():b.outerHeight()},d?{top:0,left:0}:b.offset())},c.prototype.getCalculatedOffset=function(a,b,c,d){return"bottom"==a?{top:b.top+b.height,left:b.left+b.width/2-c/2}:"top"==a?{top:b.top-d,left:b.left+b.width/2-c/2}:"left"==a?{top:b.top+b.height/2-d/2,left:b.left-c}:{top:b.top+b.height/2-d/2,left:b.left+b.width}},c.prototype.getViewportAdjustedDelta=function(a,b,c,d){var e={top:0,left:0};if(!this.$viewport)return e;var f=this.options.viewport&&this.options.viewport.padding||0,g=this.getPosition(this.$viewport);if(/right|left/.test(a)){var h=b.top-f-g.scroll,i=b.top+f-g.scroll+d;h<g.top?e.top=g.top-h:i>g.top+g.height&&(e.top=g.top+g.height-i)}else{var j=b.left-f,k=b.left+f+c;j<g.left?e.left=g.left-j:k>g.width&&(e.left=g.left+g.width-k)}return e},c.prototype.getTitle=function(){var a,b=this.$element,c=this.options;return a=b.attr("data-original-title")||("function"==typeof c.title?c.title.call(b[0]):c.title)},c.prototype.getUID=function(a){do a+=~~(1e6*Math.random());while(document.getElementById(a));return a},c.prototype.tip=function(){return this.$tip=this.$tip||a(this.options.template)},c.prototype.arrow=function(){return this.$arrow=this.$arrow||this.tip().find(".tooltip-arrow")},c.prototype.validate=function(){this.$element[0].parentNode||(this.hide(),this.$element=null,this.options=null)},c.prototype.enable=function(){this.enabled=!0},c.prototype.disable=function(){this.enabled=!1},c.prototype.toggleEnabled=function(){this.enabled=!this.enabled},c.prototype.toggle=function(b){var c=this;b&&(c=a(b.currentTarget).data("bs."+this.type),c||(c=new this.constructor(b.currentTarget,this.getDelegateOptions()),a(b.currentTarget).data("bs."+this.type,c))),c.tip().hasClass("in")?c.leave(c):c.enter(c)},c.prototype.destroy=function(){clearTimeout(this.timeout),this.hide().$element.off("."+this.type).removeData("bs."+this.type)};var d=a.fn.tooltip;a.fn.tooltip=b,a.fn.tooltip.Constructor=c,a.fn.tooltip.noConflict=function(){return a.fn.tooltip=d,this}}(jQuery),+function(a){"use strict";function b(b){return this.each(function(){var d=a(this),e=d.data("bs.popover"),f="object"==typeof b&&b;(e||"destroy"!=b)&&(e||d.data("bs.popover",e=new c(this,f)),"string"==typeof b&&e[b]())})}var c=function(a,b){this.init("popover",a,b)};if(!a.fn.tooltip)throw new Error("Popover requires tooltip.js");c.VERSION="3.2.0",c.DEFAULTS=a.extend({},a.fn.tooltip.Constructor.DEFAULTS,{placement:"right",trigger:"click",content:"",template:'<div class="popover" role="tooltip"><div class="arrow"></div><h3 class="popover-title"></h3><div class="popover-content"></div></div>'}),c.prototype=a.extend({},a.fn.tooltip.Constructor.prototype),c.prototype.constructor=c,c.prototype.getDefaults=function(){return c.DEFAULTS},c.prototype.setContent=function(){var a=this.tip(),b=this.getTitle(),c=this.getContent();a.find(".popover-title")[this.options.html?"html":"text"](b),a.find(".popover-content").empty()[this.options.html?"string"==typeof c?"html":"append":"text"](c),a.removeClass("fade top bottom left right in"),a.find(".popover-title").html()||a.find(".popover-title").hide()},c.prototype.hasContent=function(){return this.getTitle()||this.getContent()},c.prototype.getContent=function(){var a=this.$element,b=this.options;return a.attr("data-content")||("function"==typeof b.content?b.content.call(a[0]):b.content)},c.prototype.arrow=function(){return this.$arrow=this.$arrow||this.tip().find(".arrow")},c.prototype.tip=function(){return this.$tip||(this.$tip=a(this.options.template)),this.$tip};var d=a.fn.popover;a.fn.popover=b,a.fn.popover.Constructor=c,a.fn.popover.noConflict=function(){return a.fn.popover=d,this}}(jQuery),+function(a){"use strict";function b(c,d){var e=a.proxy(this.process,this);this.$body=a("body"),this.$scrollElement=a(a(c).is("body")?window:c),this.options=a.extend({},b.DEFAULTS,d),this.selector=(this.options.target||"")+" .nav li > a",this.offsets=[],this.targets=[],this.activeTarget=null,this.scrollHeight=0,this.$scrollElement.on("scroll.bs.scrollspy",e),this.refresh(),this.process()}function c(c){return this.each(function(){var d=a(this),e=d.data("bs.scrollspy"),f="object"==typeof c&&c;e||d.data("bs.scrollspy",e=new b(this,f)),"string"==typeof c&&e[c]()})}b.VERSION="3.2.0",b.DEFAULTS={offset:10},b.prototype.getScrollHeight=function(){return this.$scrollElement[0].scrollHeight||Math.max(this.$body[0].scrollHeight,document.documentElement.scrollHeight)},b.prototype.refresh=function(){var b="offset",c=0;a.isWindow(this.$scrollElement[0])||(b="position",c=this.$scrollElement.scrollTop()),this.offsets=[],this.targets=[],this.scrollHeight=this.getScrollHeight();var d=this;this.$body.find(this.selector).map(function(){var d=a(this),e=d.data("target")||d.attr("href"),f=/^#./.test(e)&&a(e);return f&&f.length&&f.is(":visible")&&[[f[b]().top+c,e]]||null}).sort(function(a,b){return a[0]-b[0]}).each(function(){d.offsets.push(this[0]),d.targets.push(this[1])})},b.prototype.process=function(){var a,b=this.$scrollElement.scrollTop()+this.options.offset,c=this.getScrollHeight(),d=this.options.offset+c-this.$scrollElement.height(),e=this.offsets,f=this.targets,g=this.activeTarget;if(this.scrollHeight!=c&&this.refresh(),b>=d)return g!=(a=f[f.length-1])&&this.activate(a);if(g&&b<=e[0])return g!=(a=f[0])&&this.activate(a);for(a=e.length;a--;)g!=f[a]&&b>=e[a]&&(!e[a+1]||b<=e[a+1])&&this.activate(f[a])},b.prototype.activate=function(b){this.activeTarget=b,a(this.selector).parentsUntil(this.options.target,".active").removeClass("active");var c=this.selector+'[data-target="'+b+'"],'+this.selector+'[href="'+b+'"]',d=a(c).parents("li").addClass("active");d.parent(".dropdown-menu").length&&(d=d.closest("li.dropdown").addClass("active")),d.trigger("activate.bs.scrollspy")};var d=a.fn.scrollspy;a.fn.scrollspy=c,a.fn.scrollspy.Constructor=b,a.fn.scrollspy.noConflict=function(){return a.fn.scrollspy=d,this},a(window).on("load.bs.scrollspy.data-api",function(){a('[data-spy="scroll"]').each(function(){var b=a(this);c.call(b,b.data())})})}(jQuery),+function(a){"use strict";function b(b){return this.each(function(){var d=a(this),e=d.data("bs.tab");e||d.data("bs.tab",e=new c(this)),"string"==typeof b&&e[b]()})}var c=function(b){this.element=a(b)};c.VERSION="3.2.0",c.prototype.show=function(){var b=this.element,c=b.closest("ul:not(.dropdown-menu)"),d=b.data("target");if(d||(d=b.attr("href"),d=d&&d.replace(/.*(?=#[^\s]*$)/,"")),!b.parent("li").hasClass("active")){var e=c.find(".active:last a")[0],f=a.Event("show.bs.tab",{relatedTarget:e});if(b.trigger(f),!f.isDefaultPrevented()){var g=a(d);this.activate(b.closest("li"),c),this.activate(g,g.parent(),function(){b.trigger({type:"shown.bs.tab",relatedTarget:e})})}}},c.prototype.activate=function(b,c,d){function e(){f.removeClass("active").find("> .dropdown-menu > .active").removeClass("active"),b.addClass("active"),g?(b[0].offsetWidth,b.addClass("in")):b.removeClass("fade"),b.parent(".dropdown-menu")&&b.closest("li.dropdown").addClass("active"),d&&d()}var f=c.find("> .active"),g=d&&a.support.transition&&f.hasClass("fade");g?f.one("bsTransitionEnd",e).emulateTransitionEnd(150):e(),f.removeClass("in")};var d=a.fn.tab;a.fn.tab=b,a.fn.tab.Constructor=c,a.fn.tab.noConflict=function(){return a.fn.tab=d,this},a(document).on("click.bs.tab.data-api",'[data-toggle="tab"], [data-toggle="pill"]',function(c){c.preventDefault(),b.call(a(this),"show")})}(jQuery),+function(a){"use strict";function b(b){return this.each(function(){var d=a(this),e=d.data("bs.affix"),f="object"==typeof b&&b;e||d.data("bs.affix",e=new c(this,f)),"string"==typeof b&&e[b]()})}var c=function(b,d){this.options=a.extend({},c.DEFAULTS,d),this.$target=a(this.options.target).on("scroll.bs.affix.data-api",a.proxy(this.checkPosition,this)).on("click.bs.affix.data-api",a.proxy(this.checkPositionWithEventLoop,this)),this.$element=a(b),this.affixed=this.unpin=this.pinnedOffset=null,this.checkPosition()};c.VERSION="3.2.0",c.RESET="affix affix-top affix-bottom",c.DEFAULTS={offset:0,target:window},c.prototype.getPinnedOffset=function(){if(this.pinnedOffset)return this.pinnedOffset;this.$element.removeClass(c.RESET).addClass("affix");var a=this.$target.scrollTop(),b=this.$element.offset();return this.pinnedOffset=b.top-a},c.prototype.checkPositionWithEventLoop=function(){setTimeout(a.proxy(this.checkPosition,this),1)},c.prototype.checkPosition=function(){if(this.$element.is(":visible")){var b=a(document).height(),d=this.$target.scrollTop(),e=this.$element.offset(),f=this.options.offset,g=f.top,h=f.bottom;"object"!=typeof f&&(h=g=f),"function"==typeof g&&(g=f.top(this.$element)),"function"==typeof h&&(h=f.bottom(this.$element));var i=null!=this.unpin&&d+this.unpin<=e.top?!1:null!=h&&e.top+this.$element.height()>=b-h?"bottom":null!=g&&g>=d?"top":!1;if(this.affixed!==i){null!=this.unpin&&this.$element.css("top","");var j="affix"+(i?"-"+i:""),k=a.Event(j+".bs.affix");this.$element.trigger(k),k.isDefaultPrevented()||(this.affixed=i,this.unpin="bottom"==i?this.getPinnedOffset():null,this.$element.removeClass(c.RESET).addClass(j).trigger(a.Event(j.replace("affix","affixed"))),"bottom"==i&&this.$element.offset({top:b-this.$element.height()-h}))}}};var d=a.fn.affix;a.fn.affix=b,a.fn.affix.Constructor=c,a.fn.affix.noConflict=function(){return a.fn.affix=d,this},a(window).on("load",function(){a('[data-spy="affix"]').each(function(){var c=a(this),d=c.data();d.offset=d.offset||{},d.offsetBottom&&(d.offset.bottom=d.offsetBottom),d.offsetTop&&(d.offset.top=d.offsetTop),b.call(c,d)})})}(jQuery);
- </script>
+if("undefined"==typeof jQuery)throw new Error("Bootstrap's JavaScript requires jQuery");+function(a){"use strict";function b(){var a=document.createElement("bootstrap"),b={WebkitTransition:"webkitTransitionEnd",MozTransition:"transitionend",OTransition:"oTransitionEnd otransitionend",transition:"transitionend"};for(var c in b)if(void 0!==a.style[c])return{end:b[c]};return!1}a.fn.emulateTransitionEnd=function(b){var c=!1,d=this;a(this).one("bsTransitionEnd",function(){c=!0});var e=function(){c||a(d).trigger(a.support.transition.end)};return setTimeout(e,b),this},a(function(){a.support.transition=b(),a.support.transition&&(a.event.special.bsTransitionEnd={bindType:a.support.transition.end,delegateType:a.support.transition.end,handle:function(b){return a(b.target).is(this)?b.handleObj.handler.apply(this,arguments):void 0}})})}(jQuery),+function(a){"use strict";function b(b){return this.each(function(){var c=a(this),e=c.data("bs.alert");e||c.data("bs.alert",e=new d(this)),"string"==typeof b&&e[b].call(c)})}var c='[data-dismiss="alert"]',d=function(b){a(b).on("click",c,this.close)};d.VERSION="3.2.0",d.prototype.close=function(b){function c(){f.detach().trigger("closed.bs.alert").remove()}var d=a(this),e=d.attr("data-target");e||(e=d.attr("href"),e=e&&e.replace(/.*(?=#[^\s]*$)/,""));var f=a(e);b&&b.preventDefault(),f.length||(f=d.hasClass("alert")?d:d.parent()),f.trigger(b=a.Event("close.bs.alert")),b.isDefaultPrevented()||(f.removeClass("in"),a.support.transition&&f.hasClass("fade")?f.one("bsTransitionEnd",c).emulateTransitionEnd(150):c())};var e=a.fn.alert;a.fn.alert=b,a.fn.alert.Constructor=d,a.fn.alert.noConflict=function(){return a.fn.alert=e,this},a(document).on("click.bs.alert.data-api",c,d.prototype.close)}(jQuery),+function(a){"use strict";function b(b){return this.each(function(){var d=a(this),e=d.data("bs.button"),f="object"==typeof b&&b;e||d.data("bs.button",e=new c(this,f)),"toggle"==b?e.toggle():b&&e.setState(b)})}var c=function(b,d){this.$element=a(b),this.options=a.extend({},c.DEFAULTS,d),this.isLoading=!1};c.VERSION="3.2.0",c.DEFAULTS={loadingText:"loading..."},c.prototype.setState=function(b){var c="disabled",d=this.$element,e=d.is("input")?"val":"html",f=d.data();b+="Text",null==f.resetText&&d.data("resetText",d[e]()),d[e](null==f[b]?this.options[b]:f[b]),setTimeout(a.proxy(function(){"loadingText"==b?(this.isLoading=!0,d.addClass(c).attr(c,c)):this.isLoading&&(this.isLoading=!1,d.removeClass(c).removeAttr(c))},this),0)},c.prototype.toggle=function(){var a=!0,b=this.$element.closest('[data-toggle="buttons"]');if(b.length){var c=this.$element.find("input");"radio"==c.prop("type")&&(c.prop("checked")&&this.$element.hasClass("active")?a=!1:b.find(".active").removeClass("active")),a&&c.prop("checked",!this.$element.hasClass("active")).trigger("change")}a&&this.$element.toggleClass("active")};var d=a.fn.button;a.fn.button=b,a.fn.button.Constructor=c,a.fn.button.noConflict=function(){return a.fn.button=d,this},a(document).on("click.bs.button.data-api",'[data-toggle^="button"]',function(c){var d=a(c.target);d.hasClass("btn")||(d=d.closest(".btn")),b.call(d,"toggle"),c.preventDefault()})}(jQuery),+function(a){"use strict";function b(b){return this.each(function(){var d=a(this),e=d.data("bs.carousel"),f=a.extend({},c.DEFAULTS,d.data(),"object"==typeof b&&b),g="string"==typeof b?b:f.slide;e||d.data("bs.carousel",e=new c(this,f)),"number"==typeof b?e.to(b):g?e[g]():f.interval&&e.pause().cycle()})}var c=function(b,c){this.$element=a(b).on("keydown.bs.carousel",a.proxy(this.keydown,this)),this.$indicators=this.$element.find(".carousel-indicators"),this.options=c,this.paused=this.sliding=this.interval=this.$active=this.$items=null,"hover"==this.options.pause&&this.$element.on("mouseenter.bs.carousel",a.proxy(this.pause,this)).on("mouseleave.bs.carousel",a.proxy(this.cycle,this))};c.VERSION="3.2.0",c.DEFAULTS={interval:5e3,pause:"hover",wrap:!0},c.prototype.keydown=function(a){switch(a.which){case 37:this.prev();break;case 39:this.next();break;default:return}a.preventDefault()},c.prototype.cycle=function(b){return b||(this.paused=!1),this.interval&&clearInterval(this.interval),this.options.interval&&!this.paused&&(this.interval=setInterval(a.proxy(this.next,this),this.options.interval)),this},c.prototype.getItemIndex=function(a){return this.$items=a.parent().children(".item"),this.$items.index(a||this.$active)},c.prototype.to=function(b){var c=this,d=this.getItemIndex(this.$active=this.$element.find(".item.active"));return b>this.$items.length-1||0>b?void 0:this.sliding?this.$element.one("slid.bs.carousel",function(){c.to(b)}):d==b?this.pause().cycle():this.slide(b>d?"next":"prev",a(this.$items[b]))},c.prototype.pause=function(b){return b||(this.paused=!0),this.$element.find(".next, .prev").length&&a.support.transition&&(this.$element.trigger(a.support.transition.end),this.cycle(!0)),this.interval=clearInterval(this.interval),this},c.prototype.next=function(){return this.sliding?void 0:this.slide("next")},c.prototype.prev=function(){return this.sliding?void 0:this.slide("prev")},c.prototype.slide=function(b,c){var d=this.$element.find(".item.active"),e=c||d[b](),f=this.interval,g="next"==b?"left":"right",h="next"==b?"first":"last",i=this;if(!e.length){if(!this.options.wrap)return;e=this.$element.find(".item")[h]()}if(e.hasClass("active"))return this.sliding=!1;var j=e[0],k=a.Event("slide.bs.carousel",{relatedTarget:j,direction:g});if(this.$element.trigger(k),!k.isDefaultPrevented()){if(this.sliding=!0,f&&this.pause(),this.$indicators.length){this.$indicators.find(".active").removeClass("active");var l=a(this.$indicators.children()[this.getItemIndex(e)]);l&&l.addClass("active")}var m=a.Event("slid.bs.carousel",{relatedTarget:j,direction:g});return a.support.transition&&this.$element.hasClass("slide")?(e.addClass(b),e[0].offsetWidth,d.addClass(g),e.addClass(g),d.one("bsTransitionEnd",function(){e.removeClass([b,g].join(" ")).addClass("active"),d.removeClass(["active",g].join(" ")),i.sliding=!1,setTimeout(function(){i.$element.trigger(m)},0)}).emulateTransitionEnd(1e3*d.css("transition-duration").slice(0,-1))):(d.removeClass("active"),e.addClass("active"),this.sliding=!1,this.$element.trigger(m)),f&&this.cycle(),this}};var d=a.fn.carousel;a.fn.carousel=b,a.fn.carousel.Constructor=c,a.fn.carousel.noConflict=function(){return a.fn.carousel=d,this},a(document).on("click.bs.carousel.data-api","[data-slide], [data-slide-to]",function(c){var d,e=a(this),f=a(e.attr("data-target")||(d=e.attr("href"))&&d.replace(/.*(?=#[^\s]+$)/,""));if(f.hasClass("carousel")){var g=a.extend({},f.data(),e.data()),h=e.attr("data-slide-to");h&&(g.interval=!1),b.call(f,g),h&&f.data("bs.carousel").to(h),c.preventDefault()}}),a(window).on("load",function(){a('[data-ride="carousel"]').each(function(){var c=a(this);b.call(c,c.data())})})}(jQuery),+function(a){"use strict";function b(b){return this.each(function(){var d=a(this),e=d.data("bs.collapse"),f=a.extend({},c.DEFAULTS,d.data(),"object"==typeof b&&b);!e&&f.toggle&&"show"==b&&(b=!b),e||d.data("bs.collapse",e=new c(this,f)),"string"==typeof b&&e[b]()})}var c=function(b,d){this.$element=a(b),this.options=a.extend({},c.DEFAULTS,d),this.transitioning=null,this.options.parent&&(this.$parent=a(this.options.parent)),this.options.toggle&&this.toggle()};c.VERSION="3.2.0",c.DEFAULTS={toggle:!0},c.prototype.dimension=function(){var a=this.$element.hasClass("width");return a?"width":"height"},c.prototype.show=function(){if(!this.transitioning&&!this.$element.hasClass("in")){var c=a.Event("show.bs.collapse");if(this.$element.trigger(c),!c.isDefaultPrevented()){var d=this.$parent&&this.$parent.find("> .panel > .in");if(d&&d.length){var e=d.data("bs.collapse");if(e&&e.transitioning)return;b.call(d,"hide"),e||d.data("bs.collapse",null)}var f=this.dimension();this.$element.removeClass("collapse").addClass("collapsing")[f](0),this.transitioning=1;var g=function(){this.$element.removeClass("collapsing").addClass("collapse in")[f](""),this.transitioning=0,this.$element.trigger("shown.bs.collapse")};if(!a.support.transition)return g.call(this);var h=a.camelCase(["scroll",f].join("-"));this.$element.one("bsTransitionEnd",a.proxy(g,this)).emulateTransitionEnd(350)[f](this.$element[0][h])}}},c.prototype.hide=function(){if(!this.transitioning&&this.$element.hasClass("in")){var b=a.Event("hide.bs.collapse");if(this.$element.trigger(b),!b.isDefaultPrevented()){var c=this.dimension();this.$element[c](this.$element[c]())[0].offsetHeight,this.$element.addClass("collapsing").removeClass("collapse").removeClass("in"),this.transitioning=1;var d=function(){this.transitioning=0,this.$element.trigger("hidden.bs.collapse").removeClass("collapsing").addClass("collapse")};return a.support.transition?void this.$element[c](0).one("bsTransitionEnd",a.proxy(d,this)).emulateTransitionEnd(350):d.call(this)}}},c.prototype.toggle=function(){this[this.$element.hasClass("in")?"hide":"show"]()};var d=a.fn.collapse;a.fn.collapse=b,a.fn.collapse.Constructor=c,a.fn.collapse.noConflict=function(){return a.fn.collapse=d,this},a(document).on("click.bs.collapse.data-api",'[data-toggle="collapse"]',function(c){var d,e=a(this),f=e.attr("data-target")||c.preventDefault()||(d=e.attr("href"))&&d.replace(/.*(?=#[^\s]+$)/,""),g=a(f),h=g.data("bs.collapse"),i=h?"toggle":e.data(),j=e.attr("data-parent"),k=j&&a(j);h&&h.transitioning||(k&&k.find('[data-toggle="collapse"][data-parent="'+j+'"]').not(e).addClass("collapsed"),e[g.hasClass("in")?"addClass":"removeClass"]("collapsed")),b.call(g,i)})}(jQuery),+function(a){"use strict";function b(b){b&&3===b.which||(a(e).remove(),a(f).each(function(){var d=c(a(this)),e={relatedTarget:this};d.hasClass("open")&&(d.trigger(b=a.Event("hide.bs.dropdown",e)),b.isDefaultPrevented()||d.removeClass("open").trigger("hidden.bs.dropdown",e))}))}function c(b){var c=b.attr("data-target");c||(c=b.attr("href"),c=c&&/#[A-Za-z]/.test(c)&&c.replace(/.*(?=#[^\s]*$)/,""));var d=c&&a(c);return d&&d.length?d:b.parent()}function d(b){return this.each(function(){var c=a(this),d=c.data("bs.dropdown");d||c.data("bs.dropdown",d=new g(this)),"string"==typeof b&&d[b].call(c)})}var e=".dropdown-backdrop",f='[data-toggle="dropdown"]',g=function(b){a(b).on("click.bs.dropdown",this.toggle)};g.VERSION="3.2.0",g.prototype.toggle=function(d){var e=a(this);if(!e.is(".disabled, :disabled")){var f=c(e),g=f.hasClass("open");if(b(),!g){"ontouchstart"in document.documentElement&&!f.closest(".navbar-nav").length&&a('<div class="dropdown-backdrop"/>').insertAfter(a(this)).on("click",b);var h={relatedTarget:this};if(f.trigger(d=a.Event("show.bs.dropdown",h)),d.isDefaultPrevented())return;e.trigger("focus"),f.toggleClass("open").trigger("shown.bs.dropdown",h)}return!1}},g.prototype.keydown=function(b){if(/(38|40|27)/.test(b.keyCode)){var d=a(this);if(b.preventDefault(),b.stopPropagation(),!d.is(".disabled, :disabled")){var e=c(d),g=e.hasClass("open");if(!g||g&&27==b.keyCode)return 27==b.which&&e.find(f).trigger("focus"),d.trigger("click");var h=" li:not(.divider):visible a",i=e.find('[role="menu"]'+h+', [role="listbox"]'+h);if(i.length){var j=i.index(i.filter(":focus"));38==b.keyCode&&j>0&&j--,40==b.keyCode&&j<i.length-1&&j++,~j||(j=0),i.eq(j).trigger("focus")}}}};var h=a.fn.dropdown;a.fn.dropdown=d,a.fn.dropdown.Constructor=g,a.fn.dropdown.noConflict=function(){return a.fn.dropdown=h,this},a(document).on("click.bs.dropdown.data-api",b).on("click.bs.dropdown.data-api",".dropdown form",function(a){a.stopPropagation()}).on("click.bs.dropdown.data-api",f,g.prototype.toggle).on("keydown.bs.dropdown.data-api",f+', [role="menu"], [role="listbox"]',g.prototype.keydown)}(jQuery),+function(a){"use strict";function b(b,d){return this.each(function(){var e=a(this),f=e.data("bs.modal"),g=a.extend({},c.DEFAULTS,e.data(),"object"==typeof b&&b);f||e.data("bs.modal",f=new c(this,g)),"string"==typeof b?f[b](d):g.show&&f.show(d)})}var c=function(b,c){this.options=c,this.$body=a(document.body),this.$element=a(b),this.$backdrop=this.isShown=null,this.scrollbarWidth=0,this.options.remote&&this.$element.find(".modal-content").load(this.options.remote,a.proxy(function(){this.$element.trigger("loaded.bs.modal")},this))};c.VERSION="3.2.0",c.DEFAULTS={backdrop:!0,keyboard:!0,show:!0},c.prototype.toggle=function(a){return this.isShown?this.hide():this.show(a)},c.prototype.show=function(b){var c=this,d=a.Event("show.bs.modal",{relatedTarget:b});this.$element.trigger(d),this.isShown||d.isDefaultPrevented()||(this.isShown=!0,this.checkScrollbar(),this.$body.addClass("modal-open"),this.setScrollbar(),this.escape(),this.$element.on("click.dismiss.bs.modal",'[data-dismiss="modal"]',a.proxy(this.hide,this)),this.backdrop(function(){var d=a.support.transition&&c.$element.hasClass("fade");c.$element.parent().length||c.$element.appendTo(c.$body),c.$element.show().scrollTop(0),d&&c.$element[0].offsetWidth,c.$element.addClass("in").attr("aria-hidden",!1),c.enforceFocus();var e=a.Event("shown.bs.modal",{relatedTarget:b});d?c.$element.find(".modal-dialog").one("bsTransitionEnd",function(){c.$element.trigger("focus").trigger(e)}).emulateTransitionEnd(300):c.$element.trigger("focus").trigger(e)}))},c.prototype.hide=function(b){b&&b.preventDefault(),b=a.Event("hide.bs.modal"),this.$element.trigger(b),this.isShown&&!b.isDefaultPrevented()&&(this.isShown=!1,this.$body.removeClass("modal-open"),this.resetScrollbar(),this.escape(),a(document).off("focusin.bs.modal"),this.$element.removeClass("in").attr("aria-hidden",!0).off("click.dismiss.bs.modal"),a.support.transition&&this.$element.hasClass("fade")?this.$element.one("bsTransitionEnd",a.proxy(this.hideModal,this)).emulateTransitionEnd(300):this.hideModal())},c.prototype.enforceFocus=function(){a(document).off("focusin.bs.modal").on("focusin.bs.modal",a.proxy(function(a){this.$element[0]===a.target||this.$element.has(a.target).length||this.$element.trigger("focus")},this))},c.prototype.escape=function(){this.isShown&&this.options.keyboard?this.$element.on("keyup.dismiss.bs.modal",a.proxy(function(a){27==a.which&&this.hide()},this)):this.isShown||this.$element.off("keyup.dismiss.bs.modal")},c.prototype.hideModal=function(){var a=this;this.$element.hide(),this.backdrop(function(){a.$element.trigger("hidden.bs.modal")})},c.prototype.removeBackdrop=function(){this.$backdrop&&this.$backdrop.remove(),this.$backdrop=null},c.prototype.backdrop=function(b){var c=this,d=this.$element.hasClass("fade")?"fade":"";if(this.isShown&&this.options.backdrop){var e=a.support.transition&&d;if(this.$backdrop=a('<div class="modal-backdrop '+d+'" />').appendTo(this.$body),this.$element.on("click.dismiss.bs.modal",a.proxy(function(a){a.target===a.currentTarget&&("static"==this.options.backdrop?this.$element[0].focus.call(this.$element[0]):this.hide.call(this))},this)),e&&this.$backdrop[0].offsetWidth,this.$backdrop.addClass("in"),!b)return;e?this.$backdrop.one("bsTransitionEnd",b).emulateTransitionEnd(150):b()}else if(!this.isShown&&this.$backdrop){this.$backdrop.removeClass("in");var f=function(){c.removeBackdrop(),b&&b()};a.support.transition&&this.$element.hasClass("fade")?this.$backdrop.one("bsTransitionEnd",f).emulateTransitionEnd(150):f()}else b&&b()},c.prototype.checkScrollbar=function(){document.body.clientWidth>=window.innerWidth||(this.scrollbarWidth=this.scrollbarWidth||this.measureScrollbar())},c.prototype.setScrollbar=function(){var a=parseInt(this.$body.css("padding-right")||0,10);this.scrollbarWidth&&this.$body.css("padding-right",a+this.scrollbarWidth)},c.prototype.resetScrollbar=function(){this.$body.css("padding-right","")},c.prototype.measureScrollbar=function(){var a=document.createElement("div");a.className="modal-scrollbar-measure",this.$body.append(a);var b=a.offsetWidth-a.clientWidth;return this.$body[0].removeChild(a),b};var d=a.fn.modal;a.fn.modal=b,a.fn.modal.Constructor=c,a.fn.modal.noConflict=function(){return a.fn.modal=d,this},a(document).on("click.bs.modal.data-api",'[data-toggle="modal"]',function(c){var d=a(this),e=d.attr("href"),f=a(d.attr("data-target")||e&&e.replace(/.*(?=#[^\s]+$)/,"")),g=f.data("bs.modal")?"toggle":a.extend({remote:!/#/.test(e)&&e},f.data(),d.data());d.is("a")&&c.preventDefault(),f.one("show.bs.modal",function(a){a.isDefaultPrevented()||f.one("hidden.bs.modal",function(){d.is(":visible")&&d.trigger("focus")})}),b.call(f,g,this)})}(jQuery),+function(a){"use strict";function b(b){return this.each(function(){var d=a(this),e=d.data("bs.tooltip"),f="object"==typeof b&&b;(e||"destroy"!=b)&&(e||d.data("bs.tooltip",e=new c(this,f)),"string"==typeof b&&e[b]())})}var c=function(a,b){this.type=this.options=this.enabled=this.timeout=this.hoverState=this.$element=null,this.init("tooltip",a,b)};c.VERSION="3.2.0",c.DEFAULTS={animation:!0,placement:"top",selector:!1,template:'<div class="tooltip" role="tooltip"><div class="tooltip-arrow"></div><div class="tooltip-inner"></div></div>',trigger:"hover focus",title:"",delay:0,html:!1,container:!1,viewport:{selector:"body",padding:0}},c.prototype.init=function(b,c,d){this.enabled=!0,this.type=b,this.$element=a(c),this.options=this.getOptions(d),this.$viewport=this.options.viewport&&a(this.options.viewport.selector||this.options.viewport);for(var e=this.options.trigger.split(" "),f=e.length;f--;){var g=e[f];if("click"==g)this.$element.on("click."+this.type,this.options.selector,a.proxy(this.toggle,this));else if("manual"!=g){var h="hover"==g?"mouseenter":"focusin",i="hover"==g?"mouseleave":"focusout";this.$element.on(h+"."+this.type,this.options.selector,a.proxy(this.enter,this)),this.$element.on(i+"."+this.type,this.options.selector,a.proxy(this.leave,this))}}this.options.selector?this._options=a.extend({},this.options,{trigger:"manual",selector:""}):this.fixTitle()},c.prototype.getDefaults=function(){return c.DEFAULTS},c.prototype.getOptions=function(b){return b=a.extend({},this.getDefaults(),this.$element.data(),b),b.delay&&"number"==typeof b.delay&&(b.delay={show:b.delay,hide:b.delay}),b},c.prototype.getDelegateOptions=function(){var b={},c=this.getDefaults();return this._options&&a.each(this._options,function(a,d){c[a]!=d&&(b[a]=d)}),b},c.prototype.enter=function(b){var c=b instanceof this.constructor?b:a(b.currentTarget).data("bs."+this.type);return c||(c=new this.constructor(b.currentTarget,this.getDelegateOptions()),a(b.currentTarget).data("bs."+this.type,c)),clearTimeout(c.timeout),c.hoverState="in",c.options.delay&&c.options.delay.show?void(c.timeout=setTimeout(function(){"in"==c.hoverState&&c.show()},c.options.delay.show)):c.show()},c.prototype.leave=function(b){var c=b instanceof this.constructor?b:a(b.currentTarget).data("bs."+this.type);return c||(c=new this.constructor(b.currentTarget,this.getDelegateOptions()),a(b.currentTarget).data("bs."+this.type,c)),clearTimeout(c.timeout),c.hoverState="out",c.options.delay&&c.options.delay.hide?void(c.timeout=setTimeout(function(){"out"==c.hoverState&&c.hide()},c.options.delay.hide)):c.hide()},c.prototype.show=function(){var b=a.Event("show.bs."+this.type);if(this.hasContent()&&this.enabled){this.$element.trigger(b);var c=a.contains(document.documentElement,this.$element[0]);if(b.isDefaultPrevented()||!c)return;var d=this,e=this.tip(),f=this.getUID(this.type);this.setContent(),e.attr("id",f),this.$element.attr("aria-describedby",f),this.options.animation&&e.addClass("fade");var g="function"==typeof this.options.placement?this.options.placement.call(this,e[0],this.$element[0]):this.options.placement,h=/\s?auto?\s?/i,i=h.test(g);i&&(g=g.replace(h,"")||"top"),e.detach().css({top:0,left:0,display:"block"}).addClass(g).data("bs."+this.type,this),this.options.container?e.appendTo(this.options.container):e.insertAfter(this.$element);var j=this.getPosition(),k=e[0].offsetWidth,l=e[0].offsetHeight;if(i){var m=g,n=this.$element.parent(),o=this.getPosition(n);g="bottom"==g&&j.top+j.height+l-o.scroll>o.height?"top":"top"==g&&j.top-o.scroll-l<0?"bottom":"right"==g&&j.right+k>o.width?"left":"left"==g&&j.left-k<o.left?"right":g,e.removeClass(m).addClass(g)}var p=this.getCalculatedOffset(g,j,k,l);this.applyPlacement(p,g);var q=function(){d.$element.trigger("shown.bs."+d.type),d.hoverState=null};a.support.transition&&this.$tip.hasClass("fade")?e.one("bsTransitionEnd",q).emulateTransitionEnd(150):q()}},c.prototype.applyPlacement=function(b,c){var d=this.tip(),e=d[0].offsetWidth,f=d[0].offsetHeight,g=parseInt(d.css("margin-top"),10),h=parseInt(d.css("margin-left"),10);isNaN(g)&&(g=0),isNaN(h)&&(h=0),b.top=b.top+g,b.left=b.left+h,a.offset.setOffset(d[0],a.extend({using:function(a){d.css({top:Math.round(a.top),left:Math.round(a.left)})}},b),0),d.addClass("in");var i=d[0].offsetWidth,j=d[0].offsetHeight;"top"==c&&j!=f&&(b.top=b.top+f-j);var k=this.getViewportAdjustedDelta(c,b,i,j);k.left?b.left+=k.left:b.top+=k.top;var l=k.left?2*k.left-e+i:2*k.top-f+j,m=k.left?"left":"top",n=k.left?"offsetWidth":"offsetHeight";d.offset(b),this.replaceArrow(l,d[0][n],m)},c.prototype.replaceArrow=function(a,b,c){this.arrow().css(c,a?50*(1-a/b)+"%":"")},c.prototype.setContent=function(){var a=this.tip(),b=this.getTitle();a.find(".tooltip-inner")[this.options.html?"html":"text"](b),a.removeClass("fade in top bottom left right")},c.prototype.hide=function(){function b(){"in"!=c.hoverState&&d.detach(),c.$element.trigger("hidden.bs."+c.type)}var c=this,d=this.tip(),e=a.Event("hide.bs."+this.type);return this.$element.removeAttr("aria-describedby"),this.$element.trigger(e),e.isDefaultPrevented()?void 0:(d.removeClass("in"),a.support.transition&&this.$tip.hasClass("fade")?d.one("bsTransitionEnd",b).emulateTransitionEnd(150):b(),this.hoverState=null,this)},c.prototype.fixTitle=function(){var a=this.$element;(a.attr("title")||"string"!=typeof a.attr("data-original-title"))&&a.attr("data-original-title",a.attr("title")||"").attr("title","")},c.prototype.hasContent=function(){return this.getTitle()},c.prototype.getPosition=function(b){b=b||this.$element;var c=b[0],d="BODY"==c.tagName;return a.extend({},"function"==typeof c.getBoundingClientRect?c.getBoundingClientRect():null,{scroll:d?document.documentElement.scrollTop||document.body.scrollTop:b.scrollTop(),width:d?a(window).width():b.outerWidth(),height:d?a(window).height():b.outerHeight()},d?{top:0,left:0}:b.offset())},c.prototype.getCalculatedOffset=function(a,b,c,d){return"bottom"==a?{top:b.top+b.height,left:b.left+b.width/2-c/2}:"top"==a?{top:b.top-d,left:b.left+b.width/2-c/2}:"left"==a?{top:b.top+b.height/2-d/2,left:b.left-c}:{top:b.top+b.height/2-d/2,left:b.left+b.width}},c.prototype.getViewportAdjustedDelta=function(a,b,c,d){var e={top:0,left:0};if(!this.$viewport)return e;var f=this.options.viewport&&this.options.viewport.padding||0,g=this.getPosition(this.$viewport);if(/right|left/.test(a)){var h=b.top-f-g.scroll,i=b.top+f-g.scroll+d;h<g.top?e.top=g.top-h:i>g.top+g.height&&(e.top=g.top+g.height-i)}else{var j=b.left-f,k=b.left+f+c;j<g.left?e.left=g.left-j:k>g.width&&(e.left=g.left+g.width-k)}return e},c.prototype.getTitle=function(){var a,b=this.$element,c=this.options;return a=b.attr("data-original-title")||("function"==typeof c.title?c.title.call(b[0]):c.title)},c.prototype.getUID=function(a){do a+=~~(1e6*Math.random());while(document.getElementById(a));return a},c.prototype.tip=function(){return this.$tip=this.$tip||a(this.options.template)},c.prototype.arrow=function(){return this.$arrow=this.$arrow||this.tip().find(".tooltip-arrow")},c.prototype.validate=function(){this.$element[0].parentNode||(this.hide(),this.$element=null,this.options=null)},c.prototype.enable=function(){this.enabled=!0},c.prototype.disable=function(){this.enabled=!1},c.prototype.toggleEnabled=function(){this.enabled=!this.enabled},c.prototype.toggle=function(b){var c=this;b&&(c=a(b.currentTarget).data("bs."+this.type),c||(c=new this.constructor(b.currentTarget,this.getDelegateOptions()),a(b.currentTarget).data("bs."+this.type,c))),c.tip().hasClass("in")?c.leave(c):c.enter(c)},c.prototype.destroy=function(){clearTimeout(this.timeout),this.hide().$element.off("."+this.type).removeData("bs."+this.type)};var d=a.fn.tooltip;a.fn.tooltip=b,a.fn.tooltip.Constructor=c,a.fn.tooltip.noConflict=function(){return a.fn.tooltip=d,this}}(jQuery),+function(a){"use strict";function b(b){return this.each(function(){var d=a(this),e=d.data("bs.popover"),f="object"==typeof b&&b;(e||"destroy"!=b)&&(e||d.data("bs.popover",e=new c(this,f)),"string"==typeof b&&e[b]())})}var c=function(a,b){this.init("popover",a,b)};if(!a.fn.tooltip)throw new Error("Popover requires tooltip.js");c.VERSION="3.2.0",c.DEFAULTS=a.extend({},a.fn.tooltip.Constructor.DEFAULTS,{placement:"right",trigger:"click",content:"",template:'<div class="popover" role="tooltip"><div class="arrow"></div><h3 class="popover-title"></h3><div class="popover-content"></div></div>'}),c.prototype=a.extend({},a.fn.tooltip.Constructor.prototype),c.prototype.constructor=c,c.prototype.getDefaults=function(){return c.DEFAULTS},c.prototype.setContent=function(){var a=this.tip(),b=this.getTitle(),c=this.getContent();a.find(".popover-title")[this.options.html?"html":"text"](b),a.find(".popover-content").empty()[this.options.html?"string"==typeof c?"html":"append":"text"](c),a.removeClass("fade top bottom left right in"),a.find(".popover-title").html()||a.find(".popover-title").hide()},c.prototype.hasContent=function(){return this.getTitle()||this.getContent()},c.prototype.getContent=function(){var a=this.$element,b=this.options;return a.attr("data-content")||("function"==typeof b.content?b.content.call(a[0]):b.content)},c.prototype.arrow=function(){return this.$arrow=this.$arrow||this.tip().find(".arrow")},c.prototype.tip=function(){return this.$tip||(this.$tip=a(this.options.template)),this.$tip};var d=a.fn.popover;a.fn.popover=b,a.fn.popover.Constructor=c,a.fn.popover.noConflict=function(){return a.fn.popover=d,this}}(jQuery),+function(a){"use strict";function b(c,d){var e=a.proxy(this.process,this);this.$body=a("body"),this.$scrollElement=a(a(c).is("body")?window:c),this.options=a.extend({},b.DEFAULTS,d),this.selector=(this.options.target||"")+" .nav li > a",this.offsets=[],this.targets=[],this.activeTarget=null,this.scrollHeight=0,this.$scrollElement.on("scroll.bs.scrollspy",e),this.refresh(),this.process()}function c(c){return this.each(function(){var d=a(this),e=d.data("bs.scrollspy"),f="object"==typeof c&&c;e||d.data("bs.scrollspy",e=new b(this,f)),"string"==typeof c&&e[c]()})}b.VERSION="3.2.0",b.DEFAULTS={offset:10},b.prototype.getScrollHeight=function(){return this.$scrollElement[0].scrollHeight||Math.max(this.$body[0].scrollHeight,document.documentElement.scrollHeight)},b.prototype.refresh=function(){var b="offset",c=0;a.isWindow(this.$scrollElement[0])||(b="position",c=this.$scrollElement.scrollTop()),this.offsets=[],this.targets=[],this.scrollHeight=this.getScrollHeight();var d=this;this.$body.find(this.selector).map(function(){var d=a(this),e=d.data("target")||d.attr("href"),f=/^#./.test(e)&&a(e);return f&&f.length&&f.is(":visible")&&[[f[b]().top+c,e]]||null}).sort(function(a,b){return a[0]-b[0]}).each(function(){d.offsets.push(this[0]),d.targets.push(this[1])})},b.prototype.process=function(){var a,b=this.$scrollElement.scrollTop()+this.options.offset,c=this.getScrollHeight(),d=this.options.offset+c-this.$scrollElement.height(),e=this.offsets,f=this.targets,g=this.activeTarget;if(this.scrollHeight!=c&&this.refresh(),b>=d)return g!=(a=f[f.length-1])&&this.activate(a);if(g&&b<=e[0])return g!=(a=f[0])&&this.activate(a);for(a=e.length;a--;)g!=f[a]&&b>=e[a]&&(!e[a+1]||b<=e[a+1])&&this.activate(f[a])},b.prototype.activate=function(b){this.activeTarget=b,a(this.selector).parentsUntil(this.options.target,".active").removeClass("active");var c=this.selector+'[data-target="'+b+'"],'+this.selector+'[href="'+b+'"]',d=a(c).parents("li").addClass("active");d.parent(".dropdown-menu").length&&(d=d.closest("li.dropdown").addClass("active")),d.trigger("activate.bs.scrollspy")};var d=a.fn.scrollspy;a.fn.scrollspy=c,a.fn.scrollspy.Constructor=b,a.fn.scrollspy.noConflict=function(){return a.fn.scrollspy=d,this},a(window).on("load.bs.scrollspy.data-api",function(){a('[data-spy="scroll"]').each(function(){var b=a(this);c.call(b,b.data())})})}(jQuery),+function(a){"use strict";function b(b){return this.each(function(){var d=a(this),e=d.data("bs.tab");e||d.data("bs.tab",e=new c(this)),"string"==typeof b&&e[b]()})}var c=function(b){this.element=a(b)};c.VERSION="3.2.0",c.prototype.show=function(){var b=this.element,c=b.closest("ul:not(.dropdown-menu)"),d=b.data("target");if(d||(d=b.attr("href"),d=d&&d.replace(/.*(?=#[^\s]*$)/,"")),!b.parent("li").hasClass("active")){var e=c.find(".active:last a")[0],f=a.Event("show.bs.tab",{relatedTarget:e});if(b.trigger(f),!f.isDefaultPrevented()){var g=a(d);this.activate(b.closest("li"),c),this.activate(g,g.parent(),function(){b.trigger({type:"shown.bs.tab",relatedTarget:e})})}}},c.prototype.activate=function(b,c,d){function e(){f.removeClass("active").find("> .dropdown-menu > .active").removeClass("active"),b.addClass("active"),g?(b[0].offsetWidth,b.addClass("in")):b.removeClass("fade"),b.parent(".dropdown-menu")&&b.closest("li.dropdown").addClass("active"),d&&d()}var f=c.find("> .active"),g=d&&a.support.transition&&f.hasClass("fade");g?f.one("bsTransitionEnd",e).emulateTransitionEnd(150):e(),f.removeClass("in")};var d=a.fn.tab;a.fn.tab=b,a.fn.tab.Constructor=c,a.fn.tab.noConflict=function(){return a.fn.tab=d,this},a(document).on("click.bs.tab.data-api",'[data-toggle="tab"], [data-toggle="pill"]',function(c){c.preventDefault(),b.call(a(this),"show")})}(jQuery),+function(a){"use strict";function b(b){return this.each(function(){var d=a(this),e=d.data("bs.affix"),f="object"==typeof b&&b;e||d.data("bs.affix",e=new c(this,f)),"string"==typeof b&&e[b]()})}var c=function(b,d){this.options=a.extend({},c.DEFAULTS,d),this.$target=a(this.options.target).on("scroll.bs.affix.data-api",a.proxy(this.checkPosition,this)).on("click.bs.affix.data-api",a.proxy(this.checkPositionWithEventLoop,this)),this.$element=a(b),this.affixed=this.unpin=this.pinnedOffset=null,this.checkPosition()};c.VERSION="3.2.0",c.RESET="affix affix-top affix-bottom",c.DEFAULTS={offset:0,target:window},c.prototype.getPinnedOffset=function(){if(this.pinnedOffset)return this.pinnedOffset;this.$element.removeClass(c.RESET).addClass("affix");var a=this.$target.scrollTop(),b=this.$element.offset();return this.pinnedOffset=b.top-a},c.prototype.checkPositionWithEventLoop=function(){setTimeout(a.proxy(this.checkPosition,this),1)},c.prototype.checkPosition=function(){if(this.$element.is(":visible")){var b=a(document).height(),d=this.$target.scrollTop(),e=this.$element.offset(),f=this.options.offset,g=f.top,h=f.bottom;"object"!=typeof f&&(h=g=f),"function"==typeof g&&(g=f.top(this.$element)),"function"==typeof h&&(h=f.bottom(this.$element));var i=null!=this.unpin&&d+this.unpin<=e.top?!1:null!=h&&e.top+this.$element.height()>=b-h?"bottom":null!=g&&g>=d?"top":!1;if(this.affixed!==i){null!=this.unpin&&this.$element.css("top","");var j="affix"+(i?"-"+i:""),k=a.Event(j+".bs.affix");this.$element.trigger(k),k.isDefaultPrevented()||(this.affixed=i,this.unpin="bottom"==i?this.getPinnedOffset():null,this.$element.removeClass(c.RESET).addClass(j).trigger(a.Event(j.replace("affix","affixed"))),"bottom"==i&&this.$element.offset({top:b-this.$element.height()-h}))}}};var d=a.fn.affix;a.fn.affix=b,a.fn.affix.Constructor=c,a.fn.affix.noConflict=function(){return a.fn.affix=d,this},a(window).on("load",function(){a('[data-spy="affix"]').each(function(){var c=a(this),d=c.data();d.offset=d.offset||{},d.offsetBottom&&(d.offset.bottom=d.offsetBottom),d.offsetTop&&(d.offset.top=d.offsetTop),b.call(c,d)})})}(jQuery);</script>
+ <script>(function() {
+ 'use strict';
- <!--<script src="/js/bitcoinjs-1-0-0.js"></script>-->
- <script>
-(function(e){if("object"==typeof exports&&"undefined"!=typeof module)module.exports=e();else if("function"==typeof define&&define.amd)define([],e);else{var f;"undefined"!=typeof window?f=window:"undefined"!=typeof global?f=global:"undefined"!=typeof self&&(f=self),f.Bitcoin=e()}})(function(){var define,module,exports;return (function e(t,n,r){function s(o,u){if(!n[o]){if(!t[o]){var a=typeof require=="function"&&require;if(!u&&a)return a(o,!0);if(i)return i(o,!0);throw new Error("Cannot find module '"+o+"'")}var f=n[o]={exports:{}};t[o][0].call(f.exports,function(e){var n=t[o][1][e];return s(n?n:e)},f,f.exports,e,t,n,r)}return n[o].exports}var i=typeof require=="function"&&require;for(var o=0;o<r.length;o++)s(r[o]);return s})({1:[function(_dereq_,module,exports){
-var assert = _dereq_('assert')
+ /**
+ * Extend an Object with another Object's properties.
+ *
+ * The source objects are specified as additional arguments.
+ *
+ * @param dst Object the object to extend.
+ *
+ * @return Object the final object.
+ */
+ var _extend = function(dst) {
+ var sources = Array.prototype.slice.call(arguments, 1);
+ for (var i=0; i<sources.length; ++i) {
+ var src = sources[i];
+ for (var p in src) {
+ if (src.hasOwnProperty(p)) dst[p] = src[p];
+ }
+ }
+ return dst;
+ };
-module.exports = BigInteger
-// JavaScript engine analysis
-var canary = 0xdeadbeefcafe;
-var j_lm = ((canary&0xffffff)==0xefcafe);
+ /**
+ * Defer execution of given function.
+ * @param {Function} func
+ */
+ var _defer = function(func) {
+ if (typeof setImmediate === 'function') {
+ return setImmediate(func);
+ } else {
+ return setTimeout(func, 0);
+ }
+ };
-// (public) Constructor
-function BigInteger(a,b,c) {
- if (!(this instanceof BigInteger)) {
- return new BigInteger(a, b, c);
+ /**
+ * Based on the algorithm at http://en.wikipedia.org/wiki/Levenshtein_distance.
+ */
+ var Levenshtein = {
+ /**
+ * Calculate levenshtein distance of the two strings.
+ *
+ * @param str1 String the first string.
+ * @param str2 String the second string.
+ * @return Integer the levenshtein distance (0 and above).
+ */
+ get: function(str1, str2) {
+ // base cases
+ if (str1 === str2) return 0;
+ if (str1.length === 0) return str2.length;
+ if (str2.length === 0) return str1.length;
+
+ // two rows
+ var prevRow = new Array(str2.length + 1),
+ curCol, nextCol, i, j, tmp;
+
+ // initialise previous row
+ for (i=0; i<prevRow.length; ++i) {
+ prevRow[i] = i;
+ }
+
+ // calculate current row distance from previous row
+ for (i=0; i<str1.length; ++i) {
+ nextCol = i + 1;
+
+ for (j=0; j<str2.length; ++j) {
+ curCol = nextCol;
+
+ // substution
+ nextCol = prevRow[j] + ( (str1.charAt(i) === str2.charAt(j)) ? 0 : 1 );
+ // insertion
+ tmp = curCol + 1;
+ if (nextCol > tmp) {
+ nextCol = tmp;
+ }
+ // deletion
+ tmp = prevRow[j + 1] + 1;
+ if (nextCol > tmp) {
+ nextCol = tmp;
+ }
+
+ // copy current col value into previous (in preparation for next iteration)
+ prevRow[j] = curCol;
+ }
+
+ // copy last col value into previous (in preparation for next iteration)
+ prevRow[j] = nextCol;
+ }
+
+ return nextCol;
+ },
+
+ /**
+ * Asynchronously calculate levenshtein distance of the two strings.
+ *
+ * @param str1 String the first string.
+ * @param str2 String the second string.
+ * @param cb Function callback function with signature: function(Error err, int distance)
+ * @param [options] Object additional options.
+ * @param [options.progress] Function progress callback with signature: function(percentComplete)
+ */
+ getAsync: function(str1, str2, cb, options) {
+ options = _extend({}, {
+ progress: null
+ }, options);
+
+ // base cases
+ if (str1 === str2) return cb(null, 0);
+ if (str1.length === 0) return cb(null, str2.length);
+ if (str2.length === 0) return cb(null, str1.length);
+
+ // two rows
+ var prevRow = new Array(str2.length + 1),
+ curCol, nextCol,
+ i, j, tmp,
+ startTime, currentTime;
+
+ // initialise previous row
+ for (i=0; i<prevRow.length; ++i) {
+ prevRow[i] = i;
+ }
+
+ nextCol = 1;
+ i = 0;
+ j = -1;
+
+ var __calculate = function() {
+ // reset timer
+ startTime = new Date().valueOf();
+ currentTime = startTime;
+
+ // keep going until one second has elapsed
+ while (currentTime - startTime < 1000) {
+ // reached end of current row?
+ if (str2.length <= (++j)) {
+ // copy current into previous (in preparation for next iteration)
+ prevRow[j] = nextCol;
+
+ // if already done all chars
+ if (str1.length <= (++i)) {
+ return cb(null, nextCol);
+ }
+ // else if we have more left to do
+ else {
+ nextCol = i + 1;
+ j = 0;
+ }
+ }
+
+ // calculation
+ curCol = nextCol;
+
+ // substution
+ nextCol = prevRow[j] + ( (str1.charAt(i) === str2.charAt(j)) ? 0 : 1 );
+ // insertion
+ tmp = curCol + 1;
+ if (nextCol > tmp) {
+ nextCol = tmp;
+ }
+ // deletion
+ tmp = prevRow[j + 1] + 1;
+ if (nextCol > tmp) {
+ nextCol = tmp;
+ }
+
+ // copy current into previous (in preparation for next iteration)
+ prevRow[j] = curCol;
+
+ // get current time
+ currentTime = new Date().valueOf();
+ }
+
+ // send a progress update?
+ if (null !== options.progress) {
+ try {
+ options.progress.call(null, (i * 100.0/ str1.length));
+ } catch (err) {
+ return cb('Progress callback: ' + err.toString());
+ }
+ }
+
+ // next iteration
+ _defer(__calculate);
+ };
+
+ __calculate();
+ }
+
+ };
+
+ // amd
+ if (typeof define !== "undefined" && define !== null && define.amd) {
+ define(function() {
+ return Levenshtein;
+ });
+ }
+ // commonjs
+ else if (typeof module !== "undefined" && module !== null && typeof exports !== "undefined" && module.exports === exports) {
+ module.exports = Levenshtein;
}
+ // web worker
+ else if (typeof self !== "undefined" && typeof self.postMessage === 'function' && typeof self.importScripts === 'function') {
+ self.Levenshtein = Levenshtein;
+ }
+ // browser main thread
+ else if (typeof window !== "undefined" && window !== null) {
+ window.Levenshtein = Levenshtein;
+ }
+}());
+
+</script>
+ <script>(function(f){if(typeof exports==="object"&&typeof module!=="undefined"){module.exports=f()}else if(typeof define==="function"&&define.amd){define([],f)}else{var g;if(typeof window!=="undefined"){g=window}else if(typeof global!=="undefined"){g=global}else if(typeof self!=="undefined"){g=self}else{g=this}g.bitcoin = f()}})(function(){var define,module,exports;return (function e(t,n,r){function s(o,u){if(!n[o]){if(!t[o]){var a=typeof require=="function"&&require;if(!u&&a)return a(o,!0);if(i)return i(o,!0);var f=new Error("Cannot find module '"+o+"'");throw f.code="MODULE_NOT_FOUND",f}var l=n[o]={exports:{}};t[o][0].call(l.exports,function(e){var n=t[o][1][e];return s(n?n:e)},l,l.exports,e,t,n,r)}return n[o].exports}var i=typeof require=="function"&&require;for(var o=0;o<r.length;o++)s(r[o]);return s})({1:[function(require,module,exports){
+// (public) Constructor
+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);
+ 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)
}
}
-var proto = BigInteger.prototype;
+var proto = BigInteger.prototype
-// return new, unset BigInteger
-function nbi() { return new BigInteger(null); }
+// duck-typed isBigInteger
+proto.__bigi = require('../package.json').version
+BigInteger.isBigInteger = function (obj, check_ver) {
+ return obj && obj.__bigi && (!check_ver || obj.__bigi === proto.__bigi)
+}
// Bits per digit
-var dbits;
+var dbits
// am: Compute w_j += (x*this_i), propagate carries,
// c is initial carry, returns final carry.
// 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;
+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;
+ 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;
+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;
+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;
+ return c
}
// wtf?
-BigInteger.prototype.am = am1;
-dbits = 26;
-
-/*
-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.am = am1
+dbits = 26
-BigInteger.prototype.DB = dbits;
-BigInteger.prototype.DM = ((1<<dbits)-1);
-var DV = BigInteger.prototype.DV = (1<<dbits);
+BigInteger.prototype.DB = dbits
+BigInteger.prototype.DM = ((1 << dbits) - 1)
+var DV = 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;
+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;
+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
}
// (protected) copy this to r
function bnpCopyTo(r) {
- for(var i = this.t-1; i >= 0; --i) r[i] = this[i];
- r.t = this.t;
- r.s = this.s;
+ 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
function bnpFromInt(x) {
- this.t = 1;
- this.s = (x<0)?-1:0;
- if(x > 0) this[0] = x;
- else if(x < -1) this[0] = x+DV;
- else this.t = 0;
+ this.t = 1
+ this.s = (x < 0) ? -1 : 0
+ if (x > 0) this[0] = x
+ else if (x < -1) this[0] = x + DV
+ else this.t = 0
}
// return bigint initialized to value
-function nbv(i) { var r = nbi(); r.fromInt(i); return r; }
+function nbv(i) {
+ var r = new BigInteger()
+ r.fromInt(i)
+ return r
+}
// (protected) set from string and radix
-function bnpFromString(s,b) {
- var self = this;
+function bnpFromString(s, b) {
+ var self = this
- 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 { self.fromRadix(s,b); return; }
- self.t = 0;
- self.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)
- self[self.t++] = x;
- else if(sh+k > self.DB) {
- self[self.t-1] |= (x&((1<<(self.DB-sh))-1))<<sh;
- self[self.t++] = (x>>(self.DB-sh));
+ 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 {
+ self.fromRadix(s, b)
+ return
+ }
+ self.t = 0
+ self.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
}
- else
- self[self.t-1] |= x<<sh;
- sh += k;
- if(sh >= self.DB) sh -= self.DB;
+ mi = false
+ if (sh == 0)
+ self[self.t++] = x
+ else if (sh + k > self.DB) {
+ self[self.t - 1] |= (x & ((1 << (self.DB - sh)) - 1)) << sh
+ self[self.t++] = (x >> (self.DB - sh))
+ } else
+ self[self.t - 1] |= x << sh
+ sh += k
+ if (sh >= self.DB) sh -= self.DB
}
- if(k == 8 && (s[0]&0x80) != 0) {
- self.s = -1;
- if(sh > 0) self[self.t-1] |= ((1<<(self.DB-sh))-1)<<sh;
+ if (k == 8 && (s[0] & 0x80) != 0) {
+ self.s = -1
+ if (sh > 0) self[self.t - 1] |= ((1 << (self.DB - sh)) - 1) << sh
}
- self.clamp();
- if(mi) BigInteger.ZERO.subTo(self,self);
+ self.clamp()
+ if (mi) BigInteger.ZERO.subTo(self, self)
}
// (protected) clamp off excess high words
function bnpClamp() {
- var c = this.s&this.DM;
- while(this.t > 0 && this[this.t-1] == c) --this.t;
+ var c = this.s & this.DM
+ while (this.t > 0 && this[this.t - 1] == c)--this.t
}
// (public) return string representation in given radix
function bnToString(b) {
- var self = this;
- if(self.s < 0) return "-"+self.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 self.toRadix(b);
- var km = (1<<k)-1, d, m = false, r = "", i = self.t;
- var p = self.DB-(i*self.DB)%k;
- if(i-- > 0) {
- if(p < self.DB && (d = self[i]>>p) > 0) { m = true; r = int2char(d); }
- while(i >= 0) {
- if(p < k) {
- d = (self[i]&((1<<p)-1))<<(k-p);
- d |= self[--i]>>(p+=self.DB-k);
- }
- else {
- d = (self[i]>>(p-=k))&km;
- if(p <= 0) { p += self.DB; --i; }
+ var self = this
+ if (self.s < 0) return "-" + self.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 self.toRadix(b)
+ var km = (1 << k) - 1,
+ d, m = false,
+ r = "",
+ i = self.t
+ var p = self.DB - (i * self.DB) % k
+ if (i-- > 0) {
+ if (p < self.DB && (d = self[i] >> p) > 0) {
+ m = true
+ r = int2char(d)
+ }
+ while (i >= 0) {
+ if (p < k) {
+ d = (self[i] & ((1 << p) - 1)) << (k - p)
+ d |= self[--i] >> (p += self.DB - k)
+ } else {
+ d = (self[i] >> (p -= k)) & km
+ if (p <= 0) {
+ p += self.DB
+ --i
+ }
}
- if(d > 0) m = true;
- if(m) r += int2char(d);
+ if (d > 0) m = true
+ if (m) r += int2char(d)
}
}
- return m?r:"0";
+ return m ? r : "0"
}
// (public) -this
-function bnNegate() { var r = nbi(); BigInteger.ZERO.subTo(this,r); return r; }
+function bnNegate() {
+ var r = new BigInteger()
+ BigInteger.ZERO.subTo(this, r)
+ return r
+}
// (public) |this|
-function bnAbs() { return (this.s<0)?this.negate():this; }
+function bnAbs() {
+ return (this.s < 0) ? this.negate() : this
+}
// (public) return + if this > a, - if this < a, 0 if equal
function bnCompareTo(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;
+ 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
}
// 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;
+ 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
}
// (public) return the number of bits in "this"
function bnBitLength() {
- if(this.t <= 0) return 0;
- return this.DB*(this.t-1)+nbits(this[this.t-1]^(this.s&this.DM));
+ if (this.t <= 0) return 0
+ return this.DB * (this.t - 1) + nbits(this[this.t - 1] ^ (this.s & this.DM))
+}
+
+// (public) return the number of bytes in "this"
+function bnByteLength() {
+ return this.bitLength() >> 3
}
// (protected) r = this << n*DB
-function bnpDLShiftTo(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;
+function bnpDLShiftTo(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
-function bnpDRShiftTo(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;
+function bnpDRShiftTo(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
-function bnpLShiftTo(n,r) {
- var self = this;
- var bs = n%self.DB;
- var cbs = self.DB-bs;
- var bm = (1<<cbs)-1;
- var ds = Math.floor(n/self.DB), c = (self.s<<bs)&self.DM, i;
- for(i = self.t-1; i >= 0; --i) {
- r[i+ds+1] = (self[i]>>cbs)|c;
- c = (self[i]&bm)<<bs;
- }
- for(i = ds-1; i >= 0; --i) r[i] = 0;
- r[ds] = c;
- r.t = self.t+ds+1;
- r.s = self.s;
- r.clamp();
+function bnpLShiftTo(n, r) {
+ var self = this
+ var bs = n % self.DB
+ var cbs = self.DB - bs
+ var bm = (1 << cbs) - 1
+ var ds = Math.floor(n / self.DB),
+ c = (self.s << bs) & self.DM,
+ i
+ for (i = self.t - 1; i >= 0; --i) {
+ r[i + ds + 1] = (self[i] >> cbs) | c
+ c = (self[i] & bm) << bs
+ }
+ for (i = ds - 1; i >= 0; --i) r[i] = 0
+ r[ds] = c
+ r.t = self.t + ds + 1
+ r.s = self.s
+ r.clamp()
}
// (protected) r = this >> n
-function bnpRShiftTo(n,r) {
- var self = this;
- r.s = self.s;
- var ds = Math.floor(n/self.DB);
- if(ds >= self.t) { r.t = 0; return; }
- var bs = n%self.DB;
- var cbs = self.DB-bs;
- var bm = (1<<bs)-1;
- r[0] = self[ds]>>bs;
- for(var i = ds+1; i < self.t; ++i) {
- r[i-ds-1] |= (self[i]&bm)<<cbs;
- r[i-ds] = self[i]>>bs;
- }
- if(bs > 0) r[self.t-ds-1] |= (self.s&bm)<<cbs;
- r.t = self.t-ds;
- r.clamp();
+function bnpRShiftTo(n, r) {
+ var self = this
+ r.s = self.s
+ var ds = Math.floor(n / self.DB)
+ if (ds >= self.t) {
+ r.t = 0
+ return
+ }
+ var bs = n % self.DB
+ var cbs = self.DB - bs
+ var bm = (1 << bs) - 1
+ r[0] = self[ds] >> bs
+ for (var i = ds + 1; i < self.t; ++i) {
+ r[i - ds - 1] |= (self[i] & bm) << cbs
+ r[i - ds] = self[i] >> bs
+ }
+ if (bs > 0) r[self.t - ds - 1] |= (self.s & bm) << cbs
+ r.t = self.t - ds
+ r.clamp()
}
// (protected) r = this - a
-function bnpSubTo(a,r) {
- var self = this;
- var i = 0, c = 0, m = Math.min(a.t,self.t);
- while(i < m) {
- c += self[i]-a[i];
- r[i++] = c&self.DM;
- c >>= self.DB;
- }
- if(a.t < self.t) {
- c -= a.s;
- while(i < self.t) {
- c += self[i];
- r[i++] = c&self.DM;
- c >>= self.DB;
+function bnpSubTo(a, r) {
+ var self = this
+ var i = 0,
+ c = 0,
+ m = Math.min(a.t, self.t)
+ while (i < m) {
+ c += self[i] - a[i]
+ r[i++] = c & self.DM
+ c >>= self.DB
+ }
+ if (a.t < self.t) {
+ c -= a.s
+ while (i < self.t) {
+ c += self[i]
+ r[i++] = c & self.DM
+ c >>= self.DB
}
- c += self.s;
- }
- else {
- c += self.s;
- while(i < a.t) {
- c -= a[i];
- r[i++] = c&self.DM;
- c >>= self.DB;
+ c += self.s
+ } else {
+ c += self.s
+ while (i < a.t) {
+ c -= a[i]
+ r[i++] = c & self.DM
+ c >>= self.DB
}
- c -= a.s;
+ c -= a.s
}
- r.s = (c<0)?-1:0;
- if(c < -1) r[i++] = self.DV+c;
- else if(c > 0) r[i++] = c;
- r.t = i;
- r.clamp();
+ r.s = (c < 0) ? -1 : 0
+ if (c < -1) r[i++] = self.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.
-function bnpMultiplyTo(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);
+function bnpMultiplyTo(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)
function bnpSquareTo(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;
+ var x = this.abs()
+ var i = r.t = 2 * x.t
+ while (--i >= 0) r[i] = 0
+ for (i = 0; i < x.t - 1; ++i) {
+ var c = x.am(i, x[i], r, 2 * i, 0, 1)
+ if ((r[i + x.t] += x.am(i + 1, 2 * x[i], r, 2 * i + 1, c, x.t - i - 1)) >= x.DV) {
+ r[i + x.t] -= x.DV
+ r[i + x.t + 1] = 1
}
}
- if(r.t > 0) r[r.t-1] += x.am(i,x[i],r,2*i,0,1);
- r.s = 0;
- r.clamp();
+ if (r.t > 0) r[r.t - 1] += x.am(i, x[i], r, 2 * i, 0, 1)
+ r.s = 0
+ r.clamp()
}
// (protected) divide this by m, quotient and remainder to q, r (HAC 14.20)
// r != q, this != m. q or r may be null.
-function bnpDivRemTo(m,q,r) {
- var self = this;
- var pm = m.abs();
- if(pm.t <= 0) return;
- var pt = self.abs();
- if(pt.t < pm.t) {
- if(q != null) q.fromInt(0);
- if(r != null) self.copyTo(r);
- return;
+function bnpDivRemTo(m, q, r) {
+ var self = this
+ var pm = m.abs()
+ if (pm.t <= 0) return
+ var pt = self.abs()
+ if (pt.t < pm.t) {
+ if (q != null) q.fromInt(0)
+ if (r != null) self.copyTo(r)
+ return
}
- if(r == null) r = nbi();
- var y = nbi(), ts = self.s, ms = m.s;
- var nsh = self.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<<self.F1)+((ys>1)?y[ys-2]>>self.F2:0);
- var d1 = self.FV/yt, d2 = (1<<self.F1)/yt, e = 1<<self.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) {
+ if (r == null) r = new BigInteger()
+ var y = new BigInteger(),
+ ts = self.s,
+ ms = m.s
+ var nsh = self.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 << self.F1) + ((ys > 1) ? y[ys - 2] >> self.F2 : 0)
+ var d1 = self.FV / yt,
+ d2 = (1 << self.F1) / yt,
+ e = 1 << self.F2
+ var i = r.t,
+ j = i - ys,
+ t = (q == null) ? new BigInteger() : 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)?self.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);
+ var qd = (r[--i] == y0) ? self.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);
+ 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);
+ r.t = ys
+ r.clamp()
+ if (nsh > 0) r.rShiftTo(nsh, r); // Denormalize remainder
+ if (ts < 0) BigInteger.ZERO.subTo(r, r)
}
// (public) this mod a
function bnMod(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;
+ var r = new BigInteger()
+ this.abs()
+ .divRemTo(a, null, r)
+ if (this.s < 0 && r.compareTo(BigInteger.ZERO) > 0) a.subTo(r, r)
+ return r
}
// Modular reduction using "classic" algorithm
-function Classic(m) { this.m = m; }
+function Classic(m) {
+ this.m = m
+}
+
function cConvert(x) {
- if(x.s < 0 || x.compareTo(this.m) >= 0) return x.mod(this.m);
- else return x;
+ if (x.s < 0 || x.compareTo(this.m) >= 0) return x.mod(this.m)
+ else return x
+}
+
+function cRevert(x) {
+ return x
+}
+
+function cReduce(x) {
+ x.divRemTo(this.m, null, x)
+}
+
+function cMulTo(x, y, r) {
+ x.multiplyTo(y, r)
+ this.reduce(r)
+}
+
+function cSqrTo(x, r) {
+ x.squareTo(r)
+ this.reduce(r)
}
-function cRevert(x) { return x; }
-function cReduce(x) { x.divRemTo(this.m,null,x); }
-function cMulTo(x,y,r) { x.multiplyTo(y,r); this.reduce(r); }
-function cSqrTo(x,r) { x.squareTo(r); this.reduce(r); }
-Classic.prototype.convert = cConvert;
-Classic.prototype.revert = cRevert;
-Classic.prototype.reduce = cReduce;
-Classic.prototype.mulTo = cMulTo;
-Classic.prototype.sqrTo = cSqrTo;
+Classic.prototype.convert = cConvert
+Classic.prototype.revert = cRevert
+Classic.prototype.reduce = cReduce
+Classic.prototype.mulTo = cMulTo
+Classic.prototype.sqrTo = cSqrTo
// (protected) return "-1/this % 2^DB"; useful for Mont. reduction
// justification:
// 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.
function bnpInvDigit() {
- 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;
+ 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
+ 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;
+ return (y > 0) ? this.DV - y : -y
}
// Montgomery reduction
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;
+ 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
function montConvert(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;
+ var r = new BigInteger()
+ 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
function montRevert(x) {
- var r = nbi();
- x.copyTo(r);
- this.reduce(r);
- return r;
+ var r = new BigInteger()
+ x.copyTo(r)
+ this.reduce(r)
+ return r
}
// x = x/R mod m (HAC 14.32)
function montReduce(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) {
+ 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;
+ 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);
+ 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]++; }
+ 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);
+ x.clamp()
+ x.drShiftTo(this.m.t, x)
+ if (x.compareTo(this.m) >= 0) x.subTo(this.m, x)
}
// r = "x^2/R mod m"; x != r
-function montSqrTo(x,r) { x.squareTo(r); this.reduce(r); }
+function montSqrTo(x, r) {
+ x.squareTo(r)
+ this.reduce(r)
+}
// r = "xy/R mod m"; x,y != r
-function montMulTo(x,y,r) { x.multiplyTo(y,r); this.reduce(r); }
+function montMulTo(x, y, r) {
+ x.multiplyTo(y, r)
+ this.reduce(r)
+}
-Montgomery.prototype.convert = montConvert;
-Montgomery.prototype.revert = montRevert;
-Montgomery.prototype.reduce = montReduce;
-Montgomery.prototype.mulTo = montMulTo;
-Montgomery.prototype.sqrTo = montSqrTo;
+Montgomery.prototype.convert = montConvert
+Montgomery.prototype.revert = montRevert
+Montgomery.prototype.reduce = montReduce
+Montgomery.prototype.mulTo = montMulTo
+Montgomery.prototype.sqrTo = montSqrTo
// (protected) true iff this is even
-function bnpIsEven() { return ((this.t>0)?(this[0]&1):this.s) == 0; }
+function bnpIsEven() {
+ 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)
-function bnpExp(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; }
+function bnpExp(e, z) {
+ if (e > 0xffffffff || e < 1) return BigInteger.ONE
+ var r = new BigInteger(),
+ r2 = new BigInteger(),
+ 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);
+ return z.revert(r)
}
// (public) this^e % m, 0 <= e < 2^32
-function bnModPowInt(e,m) {
- var z;
- if(e < 256 || m.isEven()) z = new Classic(m); else z = new Montgomery(m);
- return this.exp(e,z);
+function bnModPowInt(e, m) {
+ var z
+ if (e < 256 || m.isEven()) z = new Classic(m)
+ else z = new Montgomery(m)
+ return this.exp(e, z)
}
// protected
-proto.copyTo = bnpCopyTo;
-proto.fromInt = bnpFromInt;
-proto.fromString = bnpFromString;
-proto.clamp = bnpClamp;
-proto.dlShiftTo = bnpDLShiftTo;
-proto.drShiftTo = bnpDRShiftTo;
-proto.lShiftTo = bnpLShiftTo;
-proto.rShiftTo = bnpRShiftTo;
-proto.subTo = bnpSubTo;
-proto.multiplyTo = bnpMultiplyTo;
-proto.squareTo = bnpSquareTo;
-proto.divRemTo = bnpDivRemTo;
-proto.invDigit = bnpInvDigit;
-proto.isEven = bnpIsEven;
-proto.exp = bnpExp;
+proto.copyTo = bnpCopyTo
+proto.fromInt = bnpFromInt
+proto.fromString = bnpFromString
+proto.clamp = bnpClamp
+proto.dlShiftTo = bnpDLShiftTo
+proto.drShiftTo = bnpDRShiftTo
+proto.lShiftTo = bnpLShiftTo
+proto.rShiftTo = bnpRShiftTo
+proto.subTo = bnpSubTo
+proto.multiplyTo = bnpMultiplyTo
+proto.squareTo = bnpSquareTo
+proto.divRemTo = bnpDivRemTo
+proto.invDigit = bnpInvDigit
+proto.isEven = bnpIsEven
+proto.exp = bnpExp
// public
-proto.toString = bnToString;
-proto.negate = bnNegate;
-proto.abs = bnAbs;
-proto.compareTo = bnCompareTo;
-proto.bitLength = bnBitLength;
-proto.mod = bnMod;
-proto.modPowInt = bnModPowInt;
-
-//// jsbn2
-
-function nbi() { return new BigInteger(null); }
+proto.toString = bnToString
+proto.negate = bnNegate
+proto.abs = bnAbs
+proto.compareTo = bnCompareTo
+proto.bitLength = bnBitLength
+proto.byteLength = bnByteLength
+proto.mod = bnMod
+proto.modPowInt = bnModPowInt
// (public)
-function bnClone() { var r = nbi(); this.copyTo(r); return r; }
+function bnClone() {
+ var r = new BigInteger()
+ this.copyTo(r)
+ return r
+}
// (public) return value as integer
function bnIntValue() {
- 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;
+ 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];
+ return ((this[1] & ((1 << (32 - this.DB)) - 1)) << this.DB) | this[0]
}
// (public) return value as byte
-function bnByteValue() { return (this.t==0)?this.s:(this[0]<<24)>>24; }
+function bnByteValue() {
+ return (this.t == 0) ? this.s : (this[0] << 24) >> 24
+}
// (public) return value as short (assumes DB>=16)
-function bnShortValue() { return (this.t==0)?this.s:(this[0]<<16)>>16; }
+function bnShortValue() {
+ return (this.t == 0) ? this.s : (this[0] << 16) >> 16
+}
// (protected) return x s.t. r^x < DV
-function bnpChunkSize(r) { return Math.floor(Math.LN2*this.DB/Math.log(r)); }
+function bnpChunkSize(r) {
+ return Math.floor(Math.LN2 * this.DB / Math.log(r))
+}
// (public) 0 if this == 0, 1 if this > 0
function bnSigNum() {
- if(this.s < 0) return -1;
- else if(this.t <= 0 || (this.t == 1 && this[0] <= 0)) return 0;
- else return 1;
+ if (this.s < 0) return -1
+ else if (this.t <= 0 || (this.t == 1 && this[0] <= 0)) return 0
+ else return 1
}
// (protected) convert to radix string
function bnpToRadix(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;
+ 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 = new BigInteger(),
+ z = new BigInteger(),
+ 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
-function bnpFromRadix(s,b) {
- var self = this;
- self.fromInt(0);
- if(b == null) b = 10;
- var cs = self.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) == "-" && self.signum() == 0) mi = true;
- continue;
+function bnpFromRadix(s, b) {
+ var self = this
+ self.fromInt(0)
+ if (b == null) b = 10
+ var cs = self.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) == "-" && self.signum() == 0) mi = true
+ continue
}
- w = b*w+x;
- if(++j >= cs) {
- self.dMultiply(d);
- self.dAddOffset(w,0);
- j = 0;
- w = 0;
+ w = b * w + x
+ if (++j >= cs) {
+ self.dMultiply(d)
+ self.dAddOffset(w, 0)
+ j = 0
+ w = 0
}
}
- if(j > 0) {
- self.dMultiply(Math.pow(b,j));
- self.dAddOffset(w,0);
+ if (j > 0) {
+ self.dMultiply(Math.pow(b, j))
+ self.dAddOffset(w, 0)
}
- if(mi) BigInteger.ZERO.subTo(self,self);
+ if (mi) BigInteger.ZERO.subTo(self, self)
}
// (protected) alternate constructor
-function bnpFromNumber(a,b,c) {
- var self = this;
- if("number" == typeof b) {
+function bnpFromNumber(a, b, c) {
+ var self = this
+ if ("number" == typeof b) {
// new BigInteger(int,int,RNG)
- if(a < 2) self.fromInt(1);
+ if (a < 2) self.fromInt(1)
else {
- self.fromNumber(a,c);
- if(!self.testBit(a-1)) // force MSB set
- self.bitwiseTo(BigInteger.ONE.shiftLeft(a-1),op_or,self);
- if(self.isEven()) self.dAddOffset(1,0); // force odd
- while(!self.isProbablePrime(b)) {
- self.dAddOffset(2,0);
- if(self.bitLength() > a) self.subTo(BigInteger.ONE.shiftLeft(a-1),self);
+ self.fromNumber(a, c)
+ if (!self.testBit(a - 1)) // force MSB set
+ self.bitwiseTo(BigInteger.ONE.shiftLeft(a - 1), op_or, self)
+ if (self.isEven()) self.dAddOffset(1, 0); // force odd
+ while (!self.isProbablePrime(b)) {
+ self.dAddOffset(2, 0)
+ if (self.bitLength() > a) self.subTo(BigInteger.ONE.shiftLeft(a - 1), self)
}
}
- }
- else {
+ } 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;
- self.fromString(x,256);
+ 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
+ self.fromString(x, 256)
}
}
// (public) convert to bigendian byte array
function bnToByteArray() {
- var self = this;
- var i = self.t, r = new Array();
- r[0] = self.s;
- var p = self.DB-(i*self.DB)%8, d, k = 0;
- if(i-- > 0) {
- if(p < self.DB && (d = self[i]>>p) != (self.s&self.DM)>>p)
- r[k++] = d|(self.s<<(self.DB-p));
- while(i >= 0) {
- if(p < 8) {
- d = (self[i]&((1<<p)-1))<<(8-p);
- d |= self[--i]>>(p+=self.DB-8);
- }
- else {
- d = (self[i]>>(p-=8))&0xff;
- if(p <= 0) { p += self.DB; --i; }
+ var self = this
+ var i = self.t,
+ r = new Array()
+ r[0] = self.s
+ var p = self.DB - (i * self.DB) % 8,
+ d, k = 0
+ if (i-- > 0) {
+ if (p < self.DB && (d = self[i] >> p) != (self.s & self.DM) >> p)
+ r[k++] = d | (self.s << (self.DB - p))
+ while (i >= 0) {
+ if (p < 8) {
+ d = (self[i] & ((1 << p) - 1)) << (8 - p)
+ d |= self[--i] >> (p += self.DB - 8)
+ } else {
+ d = (self[i] >> (p -= 8)) & 0xff
+ if (p <= 0) {
+ p += self.DB
+ --i
+ }
}
- if((d&0x80) != 0) d |= -256;
- if(k === 0 && (self.s&0x80) != (d&0x80)) ++k;
- if(k > 0 || d != self.s) r[k++] = d;
+ if ((d & 0x80) != 0) d |= -256
+ if (k === 0 && (self.s & 0x80) != (d & 0x80))++k
+ if (k > 0 || d != self.s) r[k++] = d
}
}
- return r;
+ return r
+}
+
+function bnEquals(a) {
+ return (this.compareTo(a) == 0)
+}
+
+function bnMin(a) {
+ return (this.compareTo(a) < 0) ? this : a
}
-function bnEquals(a) { return(this.compareTo(a)==0); }
-function bnMin(a) { return(this.compareTo(a)<0)?this:a; }
-function bnMax(a) { return(this.compareTo(a)>0)?this:a; }
+function bnMax(a) {
+ return (this.compareTo(a) > 0) ? this : a
+}
// (protected) r = this op a (bitwise)
-function bnpBitwiseTo(a,op,r) {
- var self = this;
- var i, f, m = Math.min(a.t,self.t);
- for(i = 0; i < m; ++i) r[i] = op(self[i],a[i]);
- if(a.t < self.t) {
- f = a.s&self.DM;
- for(i = m; i < self.t; ++i) r[i] = op(self[i],f);
- r.t = self.t;
- }
- else {
- f = self.s&self.DM;
- for(i = m; i < a.t; ++i) r[i] = op(f,a[i]);
- r.t = a.t;
+function bnpBitwiseTo(a, op, r) {
+ var self = this
+ var i, f, m = Math.min(a.t, self.t)
+ for (i = 0; i < m; ++i) r[i] = op(self[i], a[i])
+ if (a.t < self.t) {
+ f = a.s & self.DM
+ for (i = m; i < self.t; ++i) r[i] = op(self[i], f)
+ r.t = self.t
+ } else {
+ f = self.s & self.DM
+ for (i = m; i < a.t; ++i) r[i] = op(f, a[i])
+ r.t = a.t
}
- r.s = op(self.s,a.s);
- r.clamp();
+ r.s = op(self.s, a.s)
+ r.clamp()
}
// (public) this & a
-function op_and(x,y) { return x&y; }
-function bnAnd(a) { var r = nbi(); this.bitwiseTo(a,op_and,r); return r; }
+function op_and(x, y) {
+ return x & y
+}
+
+function bnAnd(a) {
+ var r = new BigInteger()
+ this.bitwiseTo(a, op_and, r)
+ return r
+}
// (public) this | a
-function op_or(x,y) { return x|y; }
-function bnOr(a) { var r = nbi(); this.bitwiseTo(a,op_or,r); return r; }
+function op_or(x, y) {
+ return x | y
+}
+
+function bnOr(a) {
+ var r = new BigInteger()
+ this.bitwiseTo(a, op_or, r)
+ return r
+}
// (public) this ^ a
-function op_xor(x,y) { return x^y; }
-function bnXor(a) { var r = nbi(); this.bitwiseTo(a,op_xor,r); return r; }
+function op_xor(x, y) {
+ return x ^ y
+}
+
+function bnXor(a) {
+ var r = new BigInteger()
+ this.bitwiseTo(a, op_xor, r)
+ return r
+}
// (public) this & ~a
-function op_andnot(x,y) { return x&~y; }
-function bnAndNot(a) { var r = nbi(); this.bitwiseTo(a,op_andnot,r); return r; }
+function op_andnot(x, y) {
+ return x & ~y
+}
+
+function bnAndNot(a) {
+ var r = new BigInteger()
+ this.bitwiseTo(a, op_andnot, r)
+ return r
+}
// (public) ~this
function bnNot() {
- 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;
+ var r = new BigInteger()
+ 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
function bnShiftLeft(n) {
- var r = nbi();
- if(n < 0) this.rShiftTo(-n,r); else this.lShiftTo(n,r);
- return r;
+ var r = new BigInteger()
+ if (n < 0) this.rShiftTo(-n, r)
+ else this.lShiftTo(n, r)
+ return r
}
// (public) this >> n
function bnShiftRight(n) {
- var r = nbi();
- if(n < 0) this.lShiftTo(-n,r); else this.rShiftTo(n,r);
- return r;
+ var r = new BigInteger()
+ if (n < 0) this.lShiftTo(-n, r)
+ else this.rShiftTo(n, r)
+ return r
}
// return index of lowest 1-bit in x, x < 2^31
function lbit(x) {
- if(x == 0) return -1;
- var r = 0;
- if((x&0xffff) == 0) { x >>= 16; r += 16; }
- if((x&0xff) == 0) { x >>= 8; r += 8; }
- if((x&0xf) == 0) { x >>= 4; r += 4; }
- if((x&3) == 0) { x >>= 2; r += 2; }
- if((x&1) == 0) ++r;
- return r;
+ if (x == 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
}
// (public) returns index of lowest 1-bit (or -1 if none)
function bnGetLowestSetBit() {
- 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;
+ 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
}
// return number of 1 bits in x
function cbit(x) {
- var r = 0;
- while(x != 0) { x &= x-1; ++r; }
- return r;
+ var r = 0
+ while (x != 0) {
+ x &= x - 1
+ ++r
+ }
+ return r
}
// (public) return number of set bits
function bnBitCount() {
- var r = 0, x = this.s&this.DM;
- for(var i = 0; i < this.t; ++i) r += cbit(this[i]^x);
- return r;
+ 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
function bnTestBit(n) {
- var j = Math.floor(n/this.DB);
- if(j >= this.t) return(this.s!=0);
- return((this[j]&(1<<(n%this.DB)))!=0);
+ var j = Math.floor(n / this.DB)
+ if (j >= this.t) return (this.s != 0)
+ return ((this[j] & (1 << (n % this.DB))) != 0)
}
// (protected) this op (1<<n)
-function bnpChangeBit(n,op) {
- var r = BigInteger.ONE.shiftLeft(n);
- this.bitwiseTo(r,op,r);
- return r;
+function bnpChangeBit(n, op) {
+ var r = BigInteger.ONE.shiftLeft(n)
+ this.bitwiseTo(r, op, r)
+ return r
}
// (public) this | (1<<n)
-function bnSetBit(n) { return this.changeBit(n,op_or); }
+function bnSetBit(n) {
+ return this.changeBit(n, op_or)
+}
// (public) this & ~(1<<n)
-function bnClearBit(n) { return this.changeBit(n,op_andnot); }
+function bnClearBit(n) {
+ return this.changeBit(n, op_andnot)
+}
// (public) this ^ (1<<n)
-function bnFlipBit(n) { return this.changeBit(n,op_xor); }
+function bnFlipBit(n) {
+ return this.changeBit(n, op_xor)
+}
// (protected) r = this + a
-function bnpAddTo(a,r) {
- var self = this;
+function bnpAddTo(a, r) {
+ var self = this
- var i = 0, c = 0, m = Math.min(a.t,self.t);
- while(i < m) {
- c += self[i]+a[i];
- r[i++] = c&self.DM;
- c >>= self.DB;
- }
- if(a.t < self.t) {
- c += a.s;
- while(i < self.t) {
- c += self[i];
- r[i++] = c&self.DM;
- c >>= self.DB;
+ var i = 0,
+ c = 0,
+ m = Math.min(a.t, self.t)
+ while (i < m) {
+ c += self[i] + a[i]
+ r[i++] = c & self.DM
+ c >>= self.DB
+ }
+ if (a.t < self.t) {
+ c += a.s
+ while (i < self.t) {
+ c += self[i]
+ r[i++] = c & self.DM
+ c >>= self.DB
}
- c += self.s;
- }
- else {
- c += self.s;
- while(i < a.t) {
- c += a[i];
- r[i++] = c&self.DM;
- c >>= self.DB;
+ c += self.s
+ } else {
+ c += self.s
+ while (i < a.t) {
+ c += a[i]
+ r[i++] = c & self.DM
+ c >>= self.DB
}
- c += a.s;
+ c += a.s
}
- r.s = (c<0)?-1:0;
- if(c > 0) r[i++] = c;
- else if(c < -1) r[i++] = self.DV+c;
- r.t = i;
- r.clamp();
+ r.s = (c < 0) ? -1 : 0
+ if (c > 0) r[i++] = c
+ else if (c < -1) r[i++] = self.DV + c
+ r.t = i
+ r.clamp()
}
// (public) this + a
-function bnAdd(a) { var r = nbi(); this.addTo(a,r); return r; }
+function bnAdd(a) {
+ var r = new BigInteger()
+ this.addTo(a, r)
+ return r
+}
// (public) this - a
-function bnSubtract(a) { var r = nbi(); this.subTo(a,r); return r; }
+function bnSubtract(a) {
+ var r = new BigInteger()
+ this.subTo(a, r)
+ return r
+}
// (public) this * a
-function bnMultiply(a) { var r = nbi(); this.multiplyTo(a,r); return r; }
+function bnMultiply(a) {
+ var r = new BigInteger()
+ this.multiplyTo(a, r)
+ return r
+}
// (public) this^2
-function bnSquare() { var r = nbi(); this.squareTo(r); return r; }
+function bnSquare() {
+ var r = new BigInteger()
+ this.squareTo(r)
+ return r
+}
// (public) this / a
-function bnDivide(a) { var r = nbi(); this.divRemTo(a,r,null); return r; }
+function bnDivide(a) {
+ var r = new BigInteger()
+ this.divRemTo(a, r, null)
+ return r
+}
// (public) this % a
-function bnRemainder(a) { var r = nbi(); this.divRemTo(a,null,r); return r; }
+function bnRemainder(a) {
+ var r = new BigInteger()
+ this.divRemTo(a, null, r)
+ return r
+}
// (public) [this/a,this%a]
function bnDivideAndRemainder(a) {
- var q = nbi(), r = nbi();
- this.divRemTo(a,q,r);
- return new Array(q,r);
+ var q = new BigInteger(),
+ r = new BigInteger()
+ this.divRemTo(a, q, r)
+ return new Array(q, r)
}
// (protected) this *= n, this >= 0, 1 < n < DV
function bnpDMultiply(n) {
- this[this.t] = this.am(0,n-1,this,0,0,this.t);
- ++this.t;
- this.clamp();
+ this[this.t] = this.am(0, n - 1, this, 0, 0, this.t)
+ ++this.t
+ this.clamp()
}
// (protected) this += n << w words, this >= 0
-function bnpDAddOffset(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];
+function bnpDAddOffset(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]
}
}
// A "null" reducer
function NullExp() {}
-function nNop(x) { return x; }
-function nMulTo(x,y,r) { x.multiplyTo(y,r); }
-function nSqrTo(x,r) { x.squareTo(r); }
-NullExp.prototype.convert = nNop;
-NullExp.prototype.revert = nNop;
-NullExp.prototype.mulTo = nMulTo;
-NullExp.prototype.sqrTo = nSqrTo;
+function nNop(x) {
+ return x
+}
+
+function nMulTo(x, y, r) {
+ x.multiplyTo(y, r)
+}
+
+function nSqrTo(x, r) {
+ x.squareTo(r)
+}
+
+NullExp.prototype.convert = nNop
+NullExp.prototype.revert = nNop
+NullExp.prototype.mulTo = nMulTo
+NullExp.prototype.sqrTo = nSqrTo
// (public) this^e
-function bnPow(e) { return this.exp(e,new NullExp()); }
+function bnPow(e) {
+ return this.exp(e, new NullExp())
+}
// (protected) r = lower n words of "this * a", a.t <= n
// "this" should be the larger one if appropriate.
-function bnpMultiplyLowerTo(a,n,r) {
- var i = Math.min(this.t+a.t,n);
+function bnpMultiplyLowerTo(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();
+ 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.
-function bnpMultiplyUpperTo(a,n,r) {
- --n;
- var i = r.t = this.t+a.t-n;
+function bnpMultiplyUpperTo(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);
+ 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)
}
// Barrett modular reduction
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;
+ this.r2 = new BigInteger()
+ this.q3 = new BigInteger()
+ BigInteger.ONE.dlShiftTo(2 * m.t, this.r2)
+ this.mu = this.r2.divide(m)
+ this.m = m
}
function barrettConvert(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; }
+ 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 = new BigInteger()
+ x.copyTo(r)
+ this.reduce(r)
+ return r
+ }
}
-function barrettRevert(x) { return x; }
+function barrettRevert(x) {
+ return x
+}
// x = x mod m (HAC 14.42)
function barrettReduce(x) {
- var self = this;
- x.drShiftTo(self.m.t-1,self.r2);
- if(x.t > self.m.t+1) { x.t = self.m.t+1; x.clamp(); }
- self.mu.multiplyUpperTo(self.r2,self.m.t+1,self.q3);
- self.m.multiplyLowerTo(self.q3,self.m.t+1,self.r2);
- while(x.compareTo(self.r2) < 0) x.dAddOffset(1,self.m.t+1);
- x.subTo(self.r2,x);
- while(x.compareTo(self.m) >= 0) x.subTo(self.m,x);
+ var self = this
+ x.drShiftTo(self.m.t - 1, self.r2)
+ if (x.t > self.m.t + 1) {
+ x.t = self.m.t + 1
+ x.clamp()
+ }
+ self.mu.multiplyUpperTo(self.r2, self.m.t + 1, self.q3)
+ self.m.multiplyLowerTo(self.q3, self.m.t + 1, self.r2)
+ while (x.compareTo(self.r2) < 0) x.dAddOffset(1, self.m.t + 1)
+ x.subTo(self.r2, x)
+ while (x.compareTo(self.m) >= 0) x.subTo(self.m, x)
}
// r = x^2 mod m; x != r
-function barrettSqrTo(x,r) { x.squareTo(r); this.reduce(r); }
+function barrettSqrTo(x, r) {
+ x.squareTo(r)
+ this.reduce(r)
+}
// r = x*y mod m; x,y != r
-function barrettMulTo(x,y,r) { x.multiplyTo(y,r); this.reduce(r); }
+function barrettMulTo(x, y, r) {
+ x.multiplyTo(y, r)
+ this.reduce(r)
+}
-Barrett.prototype.convert = barrettConvert;
-Barrett.prototype.revert = barrettRevert;
-Barrett.prototype.reduce = barrettReduce;
-Barrett.prototype.mulTo = barrettMulTo;
-Barrett.prototype.sqrTo = barrettSqrTo;
+Barrett.prototype.convert = barrettConvert
+Barrett.prototype.revert = barrettRevert
+Barrett.prototype.reduce = barrettReduce
+Barrett.prototype.mulTo = barrettMulTo
+Barrett.prototype.sqrTo = barrettSqrTo
// (public) this^e % m (HAC 14.85)
-function bnModPow(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);
+function bnModPow(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);
+ 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;
+ var g = new Array(),
+ n = 3,
+ k1 = k - 1,
+ km = (1 << k) - 1
+ g[1] = z.convert(this)
+ if (k > 1) {
+ var g2 = new BigInteger()
+ z.sqrTo(g[1], g2)
+ while (n <= km) {
+ g[n] = new BigInteger()
+ z.mulTo(g2, g[n - 2], g[n])
+ n += 2
+ }
+ }
+
+ var j = e.t - 1,
+ w, is1 = true,
+ r2 = new BigInteger(),
+ 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);
+ 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;
+ n = k
+ while ((w & 1) == 0) {
+ w >>= 1
+ --n
}
- 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);
+ 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; }
+ 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);
+ return z.revert(r)
}
// (public) gcd(this,a) (HAC 14.54)
function bnGCD(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);
+ 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;
+ if (g > 0) y.lShiftTo(g, y)
+ return y
}
// (protected) this % n, n < 2^26
function bnpModInt(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;
+ 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
}
// (public) 1/this % m (HAC 14.61)
function bnModInverse(m) {
- var ac = m.isEven();
- 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);
+ var ac = m.isEven()
+ 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)
}
- if(u.compareTo(v) >= 0) {
- u.subTo(v,u);
- if(ac) a.subTo(c,a);
- b.subTo(d,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)
}
- else {
- v.subTo(u,v);
- if(ac) c.subTo(a,c);
- d.subTo(b,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
+ if (d.compareTo(m) >= 0) return d.subtract(m)
+ if (d.signum() < 0) d.addTo(m, d)
+ else return d
+ if (d.signum() < 0) return d.add(m)
+ else return d
+}
+
+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]
+
+// (public) test primality with certainty >= 1-.5^t
+function bnIsProbablePrime(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)
+}
+
+// (protected) true if probably prime (HAC 4.24, Miller-Rabin)
+function bnpMillerRabin(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 = new BigInteger(null)
+ var j, bases = []
+ for (var i = 0; i < t; ++i) {
+ for (;;) {
+ j = lowprimes[Math.floor(Math.random() * lowprimes.length)]
+ if (bases.indexOf(j) == -1) break
+ }
+ bases.push(j)
+ a.fromInt(j)
+ 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
}
}
- if(v.compareTo(BigInteger.ONE) != 0) return BigInteger.ZERO;
- if(d.compareTo(m) >= 0) return d.subtract(m);
- if(d.signum() < 0) d.addTo(m,d); else return d;
- if(d.signum() < 0) return d.add(m); else return d;
+ return true
}
// protected
-proto.chunkSize = bnpChunkSize;
-proto.toRadix = bnpToRadix;
-proto.fromRadix = bnpFromRadix;
-proto.fromNumber = bnpFromNumber;
-proto.bitwiseTo = bnpBitwiseTo;
-proto.changeBit = bnpChangeBit;
-proto.addTo = bnpAddTo;
-proto.dMultiply = bnpDMultiply;
-proto.dAddOffset = bnpDAddOffset;
-proto.multiplyLowerTo = bnpMultiplyLowerTo;
-proto.multiplyUpperTo = bnpMultiplyUpperTo;
-proto.modInt = bnpModInt;
+proto.chunkSize = bnpChunkSize
+proto.toRadix = bnpToRadix
+proto.fromRadix = bnpFromRadix
+proto.fromNumber = bnpFromNumber
+proto.bitwiseTo = bnpBitwiseTo
+proto.changeBit = bnpChangeBit
+proto.addTo = bnpAddTo
+proto.dMultiply = bnpDMultiply
+proto.dAddOffset = bnpDAddOffset
+proto.multiplyLowerTo = bnpMultiplyLowerTo
+proto.multiplyUpperTo = bnpMultiplyUpperTo
+proto.modInt = bnpModInt
+proto.millerRabin = bnpMillerRabin
// public
-proto.clone = bnClone;
-proto.intValue = bnIntValue;
-proto.byteValue = bnByteValue;
-proto.shortValue = bnShortValue;
-proto.signum = bnSigNum;
-proto.toByteArray = bnToByteArray;
-proto.equals = bnEquals;
-proto.min = bnMin;
-proto.max = bnMax;
-proto.and = bnAnd;
-proto.or = bnOr;
-proto.xor = bnXor;
-proto.andNot = bnAndNot;
-proto.not = bnNot;
-proto.shiftLeft = bnShiftLeft;
-proto.shiftRight = bnShiftRight;
-proto.getLowestSetBit = bnGetLowestSetBit;
-proto.bitCount = bnBitCount;
-proto.testBit = bnTestBit;
-proto.setBit = bnSetBit;
-proto.clearBit = bnClearBit;
-proto.flipBit = bnFlipBit;
-proto.add = bnAdd;
-proto.subtract = bnSubtract;
-proto.multiply = bnMultiply;
-proto.divide = bnDivide;
-proto.remainder = bnRemainder;
-proto.divideAndRemainder = bnDivideAndRemainder;
-proto.modPow = bnModPow;
-proto.modInverse = bnModInverse;
-proto.pow = bnPow;
-proto.gcd = bnGCD;
+proto.clone = bnClone
+proto.intValue = bnIntValue
+proto.byteValue = bnByteValue
+proto.shortValue = bnShortValue
+proto.signum = bnSigNum
+proto.toByteArray = bnToByteArray
+proto.equals = bnEquals
+proto.min = bnMin
+proto.max = bnMax
+proto.and = bnAnd
+proto.or = bnOr
+proto.xor = bnXor
+proto.andNot = bnAndNot
+proto.not = bnNot
+proto.shiftLeft = bnShiftLeft
+proto.shiftRight = bnShiftRight
+proto.getLowestSetBit = bnGetLowestSetBit
+proto.bitCount = bnBitCount
+proto.testBit = bnTestBit
+proto.setBit = bnSetBit
+proto.clearBit = bnClearBit
+proto.flipBit = bnFlipBit
+proto.add = bnAdd
+proto.subtract = bnSubtract
+proto.multiply = bnMultiply
+proto.divide = bnDivide
+proto.remainder = bnRemainder
+proto.divideAndRemainder = bnDivideAndRemainder
+proto.modPow = bnModPow
+proto.modInverse = bnModInverse
+proto.pow = bnPow
+proto.gcd = bnGCD
+proto.isProbablePrime = bnIsProbablePrime
// JSBN-specific extension
-proto.square = bnSquare;
+proto.square = bnSquare
-// BigInteger interfaces not implemented in jsbn:
+// constants
+BigInteger.ZERO = nbv(0)
+BigInteger.ONE = nbv(1)
+BigInteger.valueOf = nbv
-// BigInteger(int signum, byte[] magnitude)
-// double doubleValue()
-// float floatValue()
-// int hashCode()
-// long longValue()
-// static BigInteger valueOf(long val)
-
-// "constants"
-BigInteger.ZERO = nbv(0);
-BigInteger.ONE = nbv(1);
-BigInteger.valueOf = nbv;
+module.exports = BigInteger
-},{"assert":4}],2:[function(_dereq_,module,exports){
+},{"../package.json":4}],2:[function(require,module,exports){
(function (Buffer){
// FIXME: Kind of a weird way to throw exceptions, consider removing
-var assert = _dereq_('assert')
-var BigInteger = _dereq_('./bigi')
+var assert = require('assert')
+var BigInteger = require('./bigi')
/**
* Turns a byte array into a big integer.
*
* 0 => 0x00
* 1 => 0x01
- * -1 => 0x81
+ * -1 => 0xff
* 127 => 0x7f
- * -127 => 0xff
+ * -127 => 0x81
* 128 => 0x0080
* -128 => 0x80
* 255 => 0x00ff
- * -255 => 0xff
+ * -255 => 0xff01
* 16300 => 0x3fac
- * -16300 => 0xbfac
+ * -16300 => 0xc054
* 62300 => 0x00f35c
- * -62300 => 0xf35c
+ * -62300 => 0xff0ca4
*/
BigInteger.prototype.toDERInteger = BigInteger.prototype.toByteArray
return this.toBuffer(size).toString('hex')
}
-}).call(this,_dereq_("buffer").Buffer)
-},{"./bigi":1,"assert":4,"buffer":8}],3:[function(_dereq_,module,exports){
-var BigInteger = _dereq_('./bigi')
+}).call(this,require("buffer").Buffer)
+},{"./bigi":1,"assert":5,"buffer":7}],3:[function(require,module,exports){
+var BigInteger = require('./bigi')
//addons
-_dereq_('./convert')
+require('./convert')
module.exports = BigInteger
-},{"./bigi":1,"./convert":2}],4:[function(_dereq_,module,exports){
+},{"./bigi":1,"./convert":2}],4:[function(require,module,exports){
+module.exports={
+ "name": "bigi",
+ "version": "1.4.0",
+ "description": "Big integers.",
+ "keywords": [
+ "cryptography",
+ "math",
+ "bitcoin",
+ "arbitrary",
+ "precision",
+ "arithmetic",
+ "big",
+ "integer",
+ "int",
+ "number",
+ "biginteger",
+ "bigint",
+ "bignumber",
+ "decimal",
+ "float"
+ ],
+ "devDependencies": {
+ "mocha": "^1.20.1",
+ "jshint": "^2.5.1",
+ "coveralls": "^2.10.0",
+ "istanbul": "^0.2.11"
+ },
+ "repository": {
+ "url": "https://github.com/cryptocoinjs/bigi",
+ "type": "git"
+ },
+ "main": "./lib/index.js",
+ "scripts": {
+ "test": "_mocha -- test/*.js",
+ "jshint": "jshint --config jshint.json lib/*.js ; true",
+ "unit": "mocha",
+ "coverage": "istanbul cover ./node_modules/.bin/_mocha -- --reporter list test/*.js",
+ "coveralls": "npm run-script coverage && node ./node_modules/.bin/coveralls < coverage/lcov.info"
+ },
+ "dependencies": {},
+ "testling": {
+ "files": "test/*.js",
+ "harness": "mocha",
+ "browsers": [
+ "ie/9..latest",
+ "firefox/latest",
+ "chrome/latest",
+ "safari/6.0..latest",
+ "iphone/6.0..latest",
+ "android-browser/4.2..latest"
+ ]
+ },
+ "bugs": {
+ "url": "https://github.com/cryptocoinjs/bigi/issues"
+ },
+ "homepage": "https://github.com/cryptocoinjs/bigi",
+ "_id": "bigi@1.4.0",
+ "dist": {
+ "shasum": "90ac1aeac0a531216463bdb58f42c1e05c8407ac",
+ "tarball": "http://registry.npmjs.org/bigi/-/bigi-1.4.0.tgz"
+ },
+ "_from": "bigi@^1.4.0",
+ "_npmVersion": "1.4.3",
+ "_npmUser": {
+ "name": "jp",
+ "email": "jprichardson@gmail.com"
+ },
+ "maintainers": [
+ {
+ "name": "jp",
+ "email": "jprichardson@gmail.com"
+ },
+ {
+ "name": "midnightlightning",
+ "email": "boydb@midnightdesign.ws"
+ },
+ {
+ "name": "sidazhang",
+ "email": "sidazhang89@gmail.com"
+ },
+ {
+ "name": "nadav",
+ "email": "npm@shesek.info"
+ }
+ ],
+ "directories": {},
+ "_shasum": "90ac1aeac0a531216463bdb58f42c1e05c8407ac",
+ "_resolved": "https://registry.npmjs.org/bigi/-/bigi-1.4.0.tgz"
+}
+
+},{}],5:[function(require,module,exports){
// http://wiki.commonjs.org/wiki/Unit_Testing/1.0
//
// THIS IS NOT TESTED NOR LIKELY TO WORK OUTSIDE V8!
// when used in node, this will actually load the util module we depend on
// versus loading the builtin util module as happens otherwise
// this is a bug in node module loading as far as I am concerned
-var util = _dereq_('util/');
+var util = require('util/');
var pSlice = Array.prototype.slice;
var hasOwn = Object.prototype.hasOwnProperty;
if (util.isUndefined(value)) {
return '' + value;
}
- if (util.isNumber(value) && (isNaN(value) || !isFinite(value))) {
+ if (util.isNumber(value) && !isFinite(value)) {
return value.toString();
}
if (util.isFunction(value) || util.isRegExp(value)) {
return false;
// an identical 'prototype' property.
if (a.prototype !== b.prototype) return false;
- //~~~I've managed to break Object.keys through screwy arguments passing.
- // Converting to array solves the problem.
- if (isArguments(a)) {
- if (!isArguments(b)) {
- return false;
- }
+ // if one is a primitive, the other must be same
+ if (util.isPrimitive(a) || util.isPrimitive(b)) {
+ return a === b;
+ }
+ var aIsArgs = isArguments(a),
+ bIsArgs = isArguments(b);
+ if ((aIsArgs && !bIsArgs) || (!aIsArgs && bIsArgs))
+ return false;
+ if (aIsArgs) {
a = pSlice.call(a);
b = pSlice.call(b);
return _deepEqual(a, b);
}
- try {
- var ka = objectKeys(a),
- kb = objectKeys(b),
- key, i;
- } catch (e) {//happens when one is a string literal and the other isn't
- return false;
- }
+ var ka = objectKeys(a),
+ kb = objectKeys(b),
+ key, i;
// having the same number of owned properties (keys incorporates
// hasOwnProperty)
if (ka.length != kb.length)
return keys;
};
-},{"util/":6}],5:[function(_dereq_,module,exports){
-module.exports = function isBuffer(arg) {
- return arg && typeof arg === 'object'
- && typeof arg.copy === 'function'
- && typeof arg.fill === 'function'
- && typeof arg.readUInt8 === 'function';
+},{"util/":29}],6:[function(require,module,exports){
+
+},{}],7:[function(require,module,exports){
+/*!
+ * The buffer module from node.js, for the browser.
+ *
+ * @author Feross Aboukhadijeh <feross@feross.org> <http://feross.org>
+ * @license MIT
+ */
+
+var base64 = require('base64-js')
+var ieee754 = require('ieee754')
+var isArray = require('is-array')
+
+exports.Buffer = Buffer
+exports.SlowBuffer = SlowBuffer
+exports.INSPECT_MAX_BYTES = 50
+Buffer.poolSize = 8192 // not used by this implementation
+
+var rootParent = {}
+
+/**
+ * If `Buffer.TYPED_ARRAY_SUPPORT`:
+ * === true Use Uint8Array implementation (fastest)
+ * === false Use Object implementation (most compatible, even IE6)
+ *
+ * Browsers that support typed arrays are IE 10+, Firefox 4+, Chrome 7+, Safari 5.1+,
+ * Opera 11.6+, iOS 4.2+.
+ *
+ * Due to various browser bugs, sometimes the Object implementation will be used even
+ * when the browser supports typed arrays.
+ *
+ * Note:
+ *
+ * - Firefox 4-29 lacks support for adding new properties to `Uint8Array` instances,
+ * See: https://bugzilla.mozilla.org/show_bug.cgi?id=695438.
+ *
+ * - Safari 5-7 lacks support for changing the `Object.prototype.constructor` property
+ * on objects.
+ *
+ * - Chrome 9-10 is missing the `TypedArray.prototype.subarray` function.
+ *
+ * - IE10 has a broken `TypedArray.prototype.subarray` function which returns arrays of
+ * incorrect length in some situations.
+
+ * We detect these buggy browsers and set `Buffer.TYPED_ARRAY_SUPPORT` to `false` so they
+ * get the Object implementation, which is slower but behaves correctly.
+ */
+Buffer.TYPED_ARRAY_SUPPORT = (function () {
+ function Bar () {}
+ try {
+ var arr = new Uint8Array(1)
+ arr.foo = function () { return 42 }
+ arr.constructor = Bar
+ return arr.foo() === 42 && // typed array instances can be augmented
+ arr.constructor === Bar && // constructor can be set
+ typeof arr.subarray === 'function' && // chrome 9-10 lack `subarray`
+ arr.subarray(1, 1).byteLength === 0 // ie10 has broken `subarray`
+ } catch (e) {
+ return false
+ }
+})()
+
+function kMaxLength () {
+ return Buffer.TYPED_ARRAY_SUPPORT
+ ? 0x7fffffff
+ : 0x3fffffff
}
-},{}],6:[function(_dereq_,module,exports){
-(function (process,global){
-// Copyright Joyent, Inc. and other Node contributors.
-//
-// 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.
-var formatRegExp = /%[sdj%]/g;
-exports.format = function(f) {
- if (!isString(f)) {
- var objects = [];
- for (var i = 0; i < arguments.length; i++) {
- objects.push(inspect(arguments[i]));
+/**
+ * Class: Buffer
+ * =============
+ *
+ * The Buffer constructor returns instances of `Uint8Array` that are augmented
+ * with function properties for all the node `Buffer` API functions. We use
+ * `Uint8Array` so that square bracket notation works as expected -- it returns
+ * a single octet.
+ *
+ * By augmenting the instances, we can avoid modifying the `Uint8Array`
+ * prototype.
+ */
+function Buffer (arg) {
+ if (!(this instanceof Buffer)) {
+ // Avoid going through an ArgumentsAdaptorTrampoline in the common case.
+ if (arguments.length > 1) return new Buffer(arg, arguments[1])
+ return new Buffer(arg)
+ }
+
+ this.length = 0
+ this.parent = undefined
+
+ // Common case.
+ if (typeof arg === 'number') {
+ return fromNumber(this, arg)
+ }
+
+ // Slightly less common case.
+ if (typeof arg === 'string') {
+ return fromString(this, arg, arguments.length > 1 ? arguments[1] : 'utf8')
+ }
+
+ // Unusual.
+ return fromObject(this, arg)
+}
+
+function fromNumber (that, length) {
+ that = allocate(that, length < 0 ? 0 : checked(length) | 0)
+ if (!Buffer.TYPED_ARRAY_SUPPORT) {
+ for (var i = 0; i < length; i++) {
+ that[i] = 0
}
- return objects.join(' ');
}
+ return that
+}
- var i = 1;
- var args = arguments;
- var len = args.length;
- var str = String(f).replace(formatRegExp, function(x) {
- if (x === '%%') return '%';
- if (i >= len) return x;
- switch (x) {
- case '%s': return String(args[i++]);
- case '%d': return Number(args[i++]);
- case '%j':
- try {
- return JSON.stringify(args[i++]);
- } catch (_) {
- return '[Circular]';
- }
- default:
- return x;
+function fromString (that, string, encoding) {
+ if (typeof encoding !== 'string' || encoding === '') encoding = 'utf8'
+
+ // Assumption: byteLength() return value is always < kMaxLength.
+ var length = byteLength(string, encoding) | 0
+ that = allocate(that, length)
+
+ that.write(string, encoding)
+ return that
+}
+
+function fromObject (that, object) {
+ if (Buffer.isBuffer(object)) return fromBuffer(that, object)
+
+ if (isArray(object)) return fromArray(that, object)
+
+ if (object == null) {
+ throw new TypeError('must start with number, buffer, array or string')
+ }
+
+ if (typeof ArrayBuffer !== 'undefined') {
+ if (object.buffer instanceof ArrayBuffer) {
+ return fromTypedArray(that, object)
}
- });
- for (var x = args[i]; i < len; x = args[++i]) {
- if (isNull(x) || !isObject(x)) {
- str += ' ' + x;
- } else {
- str += ' ' + inspect(x);
+ if (object instanceof ArrayBuffer) {
+ return fromArrayBuffer(that, object)
}
}
- return str;
-};
+ if (object.length) return fromArrayLike(that, object)
-// Mark that a method should not be used.
-// Returns a modified function which warns once by default.
-// If --no-deprecation is set, then it is a no-op.
-exports.deprecate = function(fn, msg) {
- // Allow for deprecating things in the process of starting up.
- if (isUndefined(global.process)) {
- return function() {
- return exports.deprecate(fn, msg).apply(this, arguments);
- };
+ return fromJsonObject(that, object)
+}
+
+function fromBuffer (that, buffer) {
+ var length = checked(buffer.length) | 0
+ that = allocate(that, length)
+ buffer.copy(that, 0, 0, length)
+ return that
+}
+
+function fromArray (that, array) {
+ var length = checked(array.length) | 0
+ that = allocate(that, length)
+ for (var i = 0; i < length; i += 1) {
+ that[i] = array[i] & 255
}
+ return that
+}
- if (process.noDeprecation === true) {
- return fn;
+// Duplicate of fromArray() to keep fromArray() monomorphic.
+function fromTypedArray (that, array) {
+ var length = checked(array.length) | 0
+ that = allocate(that, length)
+ // Truncating the elements is probably not what people expect from typed
+ // arrays with BYTES_PER_ELEMENT > 1 but it's compatible with the behavior
+ // of the old Buffer constructor.
+ for (var i = 0; i < length; i += 1) {
+ that[i] = array[i] & 255
}
+ return that
+}
- var warned = false;
- function deprecated() {
- if (!warned) {
- if (process.throwDeprecation) {
- throw new Error(msg);
- } else if (process.traceDeprecation) {
- console.trace(msg);
- } else {
- console.error(msg);
- }
- warned = true;
- }
- return fn.apply(this, arguments);
+function fromArrayBuffer (that, array) {
+ if (Buffer.TYPED_ARRAY_SUPPORT) {
+ // Return an augmented `Uint8Array` instance, for best performance
+ array.byteLength
+ that = Buffer._augment(new Uint8Array(array))
+ } else {
+ // Fallback: Return an object instance of the Buffer class
+ that = fromTypedArray(that, new Uint8Array(array))
}
+ return that
+}
- return deprecated;
-};
+function fromArrayLike (that, array) {
+ var length = checked(array.length) | 0
+ that = allocate(that, length)
+ for (var i = 0; i < length; i += 1) {
+ that[i] = array[i] & 255
+ }
+ return that
+}
+// Deserialize { type: 'Buffer', data: [1,2,3,...] } into a Buffer object.
+// Returns a zero-length buffer for inputs that don't conform to the spec.
+function fromJsonObject (that, object) {
+ var array
+ var length = 0
-var debugs = {};
-var debugEnviron;
-exports.debuglog = function(set) {
- if (isUndefined(debugEnviron))
- debugEnviron = process.env.NODE_DEBUG || '';
- set = set.toUpperCase();
- if (!debugs[set]) {
- if (new RegExp('\\b' + set + '\\b', 'i').test(debugEnviron)) {
- var pid = process.pid;
- debugs[set] = function() {
- var msg = exports.format.apply(exports, arguments);
- console.error('%s %d: %s', set, pid, msg);
- };
- } else {
- debugs[set] = function() {};
- }
+ if (object.type === 'Buffer' && isArray(object.data)) {
+ array = object.data
+ length = checked(array.length) | 0
}
- return debugs[set];
-};
+ that = allocate(that, length)
+ for (var i = 0; i < length; i += 1) {
+ that[i] = array[i] & 255
+ }
+ return that
+}
-/**
- * Echos the value of a value. Trys to print the value out
- * in the best way possible given the different types.
- *
- * @param {Object} obj The object to print out.
- * @param {Object} opts Optional options object that alters the output.
- */
-/* legacy: obj, showHidden, depth, colors*/
-function inspect(obj, opts) {
- // default options
- var ctx = {
- seen: [],
- stylize: stylizeNoColor
- };
- // legacy...
- if (arguments.length >= 3) ctx.depth = arguments[2];
- if (arguments.length >= 4) ctx.colors = arguments[3];
- if (isBoolean(opts)) {
- // legacy...
- ctx.showHidden = opts;
- } else if (opts) {
- // got an "options" object
- exports._extend(ctx, opts);
+function allocate (that, length) {
+ if (Buffer.TYPED_ARRAY_SUPPORT) {
+ // Return an augmented `Uint8Array` instance, for best performance
+ that = Buffer._augment(new Uint8Array(length))
+ } else {
+ // Fallback: Return an object instance of the Buffer class
+ that.length = length
+ that._isBuffer = true
}
- // set default options
- if (isUndefined(ctx.showHidden)) ctx.showHidden = false;
- if (isUndefined(ctx.depth)) ctx.depth = 2;
- if (isUndefined(ctx.colors)) ctx.colors = false;
- if (isUndefined(ctx.customInspect)) ctx.customInspect = true;
- if (ctx.colors) ctx.stylize = stylizeWithColor;
- return formatValue(ctx, obj, ctx.depth);
-}
-exports.inspect = inspect;
-
-
-// http://en.wikipedia.org/wiki/ANSI_escape_code#graphics
-inspect.colors = {
- 'bold' : [1, 22],
- 'italic' : [3, 23],
- 'underline' : [4, 24],
- 'inverse' : [7, 27],
- 'white' : [37, 39],
- 'grey' : [90, 39],
- 'black' : [30, 39],
- 'blue' : [34, 39],
- 'cyan' : [36, 39],
- 'green' : [32, 39],
- 'magenta' : [35, 39],
- 'red' : [31, 39],
- 'yellow' : [33, 39]
-};
-
-// Don't use 'blue' not visible on cmd.exe
-inspect.styles = {
- 'special': 'cyan',
- 'number': 'yellow',
- 'boolean': 'yellow',
- 'undefined': 'grey',
- 'null': 'bold',
- 'string': 'green',
- 'date': 'magenta',
- // "name": intentionally not styling
- 'regexp': 'red'
-};
+ var fromPool = length !== 0 && length <= Buffer.poolSize >>> 1
+ if (fromPool) that.parent = rootParent
-function stylizeWithColor(str, styleType) {
- var style = inspect.styles[styleType];
+ return that
+}
- if (style) {
- return '\u001b[' + inspect.colors[style][0] + 'm' + str +
- '\u001b[' + inspect.colors[style][1] + 'm';
- } else {
- return str;
+function checked (length) {
+ // Note: cannot use `length < kMaxLength` here because that fails when
+ // length is NaN (which is otherwise coerced to zero.)
+ if (length >= kMaxLength()) {
+ throw new RangeError('Attempt to allocate Buffer larger than maximum ' +
+ 'size: 0x' + kMaxLength().toString(16) + ' bytes')
}
+ return length | 0
}
+function SlowBuffer (subject, encoding) {
+ if (!(this instanceof SlowBuffer)) return new SlowBuffer(subject, encoding)
-function stylizeNoColor(str, styleType) {
- return str;
+ var buf = new Buffer(subject, encoding)
+ delete buf.parent
+ return buf
}
+Buffer.isBuffer = function isBuffer (b) {
+ return !!(b != null && b._isBuffer)
+}
-function arrayToHash(array) {
- var hash = {};
+Buffer.compare = function compare (a, b) {
+ if (!Buffer.isBuffer(a) || !Buffer.isBuffer(b)) {
+ throw new TypeError('Arguments must be Buffers')
+ }
- array.forEach(function(val, idx) {
- hash[val] = true;
- });
+ if (a === b) return 0
- return hash;
-}
+ var x = a.length
+ var y = b.length
+ var i = 0
+ var len = Math.min(x, y)
+ while (i < len) {
+ if (a[i] !== b[i]) break
-function formatValue(ctx, value, recurseTimes) {
- // Provide a hook for user-specified inspect functions.
- // Check that value is an object with an inspect function on it
- if (ctx.customInspect &&
- value &&
- isFunction(value.inspect) &&
- // Filter out the util module, it's inspect function is special
- value.inspect !== exports.inspect &&
- // Also filter out any prototype objects using the circular check.
- !(value.constructor && value.constructor.prototype === value)) {
- var ret = value.inspect(recurseTimes, ctx);
- if (!isString(ret)) {
- ret = formatValue(ctx, ret, recurseTimes);
- }
- return ret;
+ ++i
}
- // Primitive types cannot have properties
- var primitive = formatPrimitive(ctx, value);
- if (primitive) {
- return primitive;
+ if (i !== len) {
+ x = a[i]
+ y = b[i]
}
- // Look up the keys of the object.
- var keys = Object.keys(value);
- var visibleKeys = arrayToHash(keys);
+ if (x < y) return -1
+ if (y < x) return 1
+ return 0
+}
- if (ctx.showHidden) {
- keys = Object.getOwnPropertyNames(value);
+Buffer.isEncoding = function isEncoding (encoding) {
+ switch (String(encoding).toLowerCase()) {
+ case 'hex':
+ case 'utf8':
+ case 'utf-8':
+ case 'ascii':
+ case 'binary':
+ case 'base64':
+ case 'raw':
+ case 'ucs2':
+ case 'ucs-2':
+ case 'utf16le':
+ case 'utf-16le':
+ return true
+ default:
+ return false
}
+}
- // IE doesn't make error fields non-enumerable
- // http://msdn.microsoft.com/en-us/library/ie/dww52sbt(v=vs.94).aspx
- if (isError(value)
- && (keys.indexOf('message') >= 0 || keys.indexOf('description') >= 0)) {
- return formatError(value);
+Buffer.concat = function concat (list, length) {
+ if (!isArray(list)) throw new TypeError('list argument must be an Array of Buffers.')
+
+ if (list.length === 0) {
+ return new Buffer(0)
}
- // Some type of object without properties can be shortcutted.
- if (keys.length === 0) {
- if (isFunction(value)) {
- var name = value.name ? ': ' + value.name : '';
- return ctx.stylize('[Function' + name + ']', 'special');
- }
- if (isRegExp(value)) {
- return ctx.stylize(RegExp.prototype.toString.call(value), 'regexp');
- }
- if (isDate(value)) {
- return ctx.stylize(Date.prototype.toString.call(value), 'date');
- }
- if (isError(value)) {
- return formatError(value);
+ var i
+ if (length === undefined) {
+ length = 0
+ for (i = 0; i < list.length; i++) {
+ length += list[i].length
}
}
- var base = '', array = false, braces = ['{', '}'];
-
- // Make Array say that they are Array
- if (isArray(value)) {
- array = true;
- braces = ['[', ']'];
+ var buf = new Buffer(length)
+ var pos = 0
+ for (i = 0; i < list.length; i++) {
+ var item = list[i]
+ item.copy(buf, pos)
+ pos += item.length
}
+ return buf
+}
- // Make functions say that they are functions
- if (isFunction(value)) {
- var n = value.name ? ': ' + value.name : '';
- base = ' [Function' + n + ']';
+function byteLength (string, encoding) {
+ if (typeof string !== 'string') string = '' + string
+
+ var len = string.length
+ if (len === 0) return 0
+
+ // Use a for loop to avoid recursion
+ var loweredCase = false
+ for (;;) {
+ switch (encoding) {
+ case 'ascii':
+ case 'binary':
+ // Deprecated
+ case 'raw':
+ case 'raws':
+ return len
+ case 'utf8':
+ case 'utf-8':
+ return utf8ToBytes(string).length
+ case 'ucs2':
+ case 'ucs-2':
+ case 'utf16le':
+ case 'utf-16le':
+ return len * 2
+ case 'hex':
+ return len >>> 1
+ case 'base64':
+ return base64ToBytes(string).length
+ default:
+ if (loweredCase) return utf8ToBytes(string).length // assume utf8
+ encoding = ('' + encoding).toLowerCase()
+ loweredCase = true
+ }
}
+}
+Buffer.byteLength = byteLength
- // Make RegExps say that they are RegExps
- if (isRegExp(value)) {
- base = ' ' + RegExp.prototype.toString.call(value);
- }
+// pre-set for values that may exist in the future
+Buffer.prototype.length = undefined
+Buffer.prototype.parent = undefined
- // Make dates with properties first say the date
- if (isDate(value)) {
- base = ' ' + Date.prototype.toUTCString.call(value);
- }
+function slowToString (encoding, start, end) {
+ var loweredCase = false
- // Make error with message first say the error
- if (isError(value)) {
- base = ' ' + formatError(value);
- }
+ start = start | 0
+ end = end === undefined || end === Infinity ? this.length : end | 0
- if (keys.length === 0 && (!array || value.length == 0)) {
- return braces[0] + base + braces[1];
- }
+ if (!encoding) encoding = 'utf8'
+ if (start < 0) start = 0
+ if (end > this.length) end = this.length
+ if (end <= start) return ''
- if (recurseTimes < 0) {
- if (isRegExp(value)) {
- return ctx.stylize(RegExp.prototype.toString.call(value), 'regexp');
- } else {
- return ctx.stylize('[Object]', 'special');
- }
- }
+ while (true) {
+ switch (encoding) {
+ case 'hex':
+ return hexSlice(this, start, end)
- ctx.seen.push(value);
+ case 'utf8':
+ case 'utf-8':
+ return utf8Slice(this, start, end)
- var output;
- if (array) {
- output = formatArray(ctx, value, recurseTimes, visibleKeys, keys);
- } else {
- output = keys.map(function(key) {
- return formatProperty(ctx, value, recurseTimes, visibleKeys, key, array);
- });
- }
+ case 'ascii':
+ return asciiSlice(this, start, end)
- ctx.seen.pop();
+ case 'binary':
+ return binarySlice(this, start, end)
- return reduceToSingleString(output, base, braces);
-}
+ case 'base64':
+ return base64Slice(this, start, end)
+ case 'ucs2':
+ case 'ucs-2':
+ case 'utf16le':
+ case 'utf-16le':
+ return utf16leSlice(this, start, end)
-function formatPrimitive(ctx, value) {
- if (isUndefined(value))
- return ctx.stylize('undefined', 'undefined');
- if (isString(value)) {
- var simple = '\'' + JSON.stringify(value).replace(/^"|"$/g, '')
- .replace(/'/g, "\\'")
- .replace(/\\"/g, '"') + '\'';
- return ctx.stylize(simple, 'string');
+ default:
+ if (loweredCase) throw new TypeError('Unknown encoding: ' + encoding)
+ encoding = (encoding + '').toLowerCase()
+ loweredCase = true
+ }
}
- if (isNumber(value))
- return ctx.stylize('' + value, 'number');
- if (isBoolean(value))
- return ctx.stylize('' + value, 'boolean');
- // For some reason typeof null is "object", so special case here.
- if (isNull(value))
- return ctx.stylize('null', 'null');
}
+Buffer.prototype.toString = function toString () {
+ var length = this.length | 0
+ if (length === 0) return ''
+ if (arguments.length === 0) return utf8Slice(this, 0, length)
+ return slowToString.apply(this, arguments)
+}
-function formatError(value) {
- return '[' + Error.prototype.toString.call(value) + ']';
+Buffer.prototype.equals = function equals (b) {
+ if (!Buffer.isBuffer(b)) throw new TypeError('Argument must be a Buffer')
+ if (this === b) return true
+ return Buffer.compare(this, b) === 0
}
+Buffer.prototype.inspect = function inspect () {
+ var str = ''
+ var max = exports.INSPECT_MAX_BYTES
+ if (this.length > 0) {
+ str = this.toString('hex', 0, max).match(/.{2}/g).join(' ')
+ if (this.length > max) str += ' ... '
+ }
+ return '<Buffer ' + str + '>'
+}
-function formatArray(ctx, value, recurseTimes, visibleKeys, keys) {
- var output = [];
- for (var i = 0, l = value.length; i < l; ++i) {
- if (hasOwnProperty(value, String(i))) {
- output.push(formatProperty(ctx, value, recurseTimes, visibleKeys,
- String(i), true));
- } else {
- output.push('');
+Buffer.prototype.compare = function compare (b) {
+ if (!Buffer.isBuffer(b)) throw new TypeError('Argument must be a Buffer')
+ if (this === b) return 0
+ return Buffer.compare(this, b)
+}
+
+Buffer.prototype.indexOf = function indexOf (val, byteOffset) {
+ if (byteOffset > 0x7fffffff) byteOffset = 0x7fffffff
+ else if (byteOffset < -0x80000000) byteOffset = -0x80000000
+ byteOffset >>= 0
+
+ if (this.length === 0) return -1
+ if (byteOffset >= this.length) return -1
+
+ // Negative offsets start from the end of the buffer
+ if (byteOffset < 0) byteOffset = Math.max(this.length + byteOffset, 0)
+
+ if (typeof val === 'string') {
+ if (val.length === 0) return -1 // special case: looking for empty string always fails
+ return String.prototype.indexOf.call(this, val, byteOffset)
+ }
+ if (Buffer.isBuffer(val)) {
+ return arrayIndexOf(this, val, byteOffset)
+ }
+ if (typeof val === 'number') {
+ if (Buffer.TYPED_ARRAY_SUPPORT && Uint8Array.prototype.indexOf === 'function') {
+ return Uint8Array.prototype.indexOf.call(this, val, byteOffset)
}
+ return arrayIndexOf(this, [ val ], byteOffset)
}
- keys.forEach(function(key) {
- if (!key.match(/^\d+$/)) {
- output.push(formatProperty(ctx, value, recurseTimes, visibleKeys,
- key, true));
+
+ function arrayIndexOf (arr, val, byteOffset) {
+ var foundIndex = -1
+ for (var i = 0; byteOffset + i < arr.length; i++) {
+ if (arr[byteOffset + i] === val[foundIndex === -1 ? 0 : i - foundIndex]) {
+ if (foundIndex === -1) foundIndex = i
+ if (i - foundIndex + 1 === val.length) return byteOffset + foundIndex
+ } else {
+ foundIndex = -1
+ }
}
- });
- return output;
+ return -1
+ }
+
+ throw new TypeError('val must be string, number or Buffer')
}
+// `get` is deprecated
+Buffer.prototype.get = function get (offset) {
+ console.log('.get() is deprecated. Access using array indexes instead.')
+ return this.readUInt8(offset)
+}
-function formatProperty(ctx, value, recurseTimes, visibleKeys, key, array) {
- var name, str, desc;
- desc = Object.getOwnPropertyDescriptor(value, key) || { value: value[key] };
- if (desc.get) {
- if (desc.set) {
- str = ctx.stylize('[Getter/Setter]', 'special');
- } else {
- str = ctx.stylize('[Getter]', 'special');
- }
+// `set` is deprecated
+Buffer.prototype.set = function set (v, offset) {
+ console.log('.set() is deprecated. Access using array indexes instead.')
+ return this.writeUInt8(v, offset)
+}
+
+function hexWrite (buf, string, offset, length) {
+ offset = Number(offset) || 0
+ var remaining = buf.length - offset
+ if (!length) {
+ length = remaining
} else {
- if (desc.set) {
- str = ctx.stylize('[Setter]', 'special');
+ length = Number(length)
+ if (length > remaining) {
+ length = remaining
}
}
- if (!hasOwnProperty(visibleKeys, key)) {
- name = '[' + key + ']';
- }
- if (!str) {
- if (ctx.seen.indexOf(desc.value) < 0) {
- if (isNull(recurseTimes)) {
- str = formatValue(ctx, desc.value, null);
- } else {
- str = formatValue(ctx, desc.value, recurseTimes - 1);
- }
- if (str.indexOf('\n') > -1) {
- if (array) {
- str = str.split('\n').map(function(line) {
- return ' ' + line;
- }).join('\n').substr(2);
- } else {
- str = '\n' + str.split('\n').map(function(line) {
- return ' ' + line;
- }).join('\n');
- }
- }
- } else {
- str = ctx.stylize('[Circular]', 'special');
- }
+
+ // must be an even number of digits
+ var strLen = string.length
+ if (strLen % 2 !== 0) throw new Error('Invalid hex string')
+
+ if (length > strLen / 2) {
+ length = strLen / 2
}
- if (isUndefined(name)) {
- if (array && key.match(/^\d+$/)) {
- return str;
- }
- name = JSON.stringify('' + key);
- if (name.match(/^"([a-zA-Z_][a-zA-Z_0-9]*)"$/)) {
- name = name.substr(1, name.length - 2);
- name = ctx.stylize(name, 'name');
- } else {
- name = name.replace(/'/g, "\\'")
- .replace(/\\"/g, '"')
- .replace(/(^"|"$)/g, "'");
- name = ctx.stylize(name, 'string');
- }
+ for (var i = 0; i < length; i++) {
+ var parsed = parseInt(string.substr(i * 2, 2), 16)
+ if (isNaN(parsed)) throw new Error('Invalid hex string')
+ buf[offset + i] = parsed
}
+ return i
+}
- return name + ': ' + str;
+function utf8Write (buf, string, offset, length) {
+ return blitBuffer(utf8ToBytes(string, buf.length - offset), buf, offset, length)
}
+function asciiWrite (buf, string, offset, length) {
+ return blitBuffer(asciiToBytes(string), buf, offset, length)
+}
-function reduceToSingleString(output, base, braces) {
- var numLinesEst = 0;
- var length = output.reduce(function(prev, cur) {
- numLinesEst++;
- if (cur.indexOf('\n') >= 0) numLinesEst++;
- return prev + cur.replace(/\u001b\[\d\d?m/g, '').length + 1;
- }, 0);
+function binaryWrite (buf, string, offset, length) {
+ return asciiWrite(buf, string, offset, length)
+}
- if (length > 60) {
- return braces[0] +
- (base === '' ? '' : base + '\n ') +
- ' ' +
- output.join(',\n ') +
- ' ' +
- braces[1];
- }
+function base64Write (buf, string, offset, length) {
+ return blitBuffer(base64ToBytes(string), buf, offset, length)
+}
- return braces[0] + base + ' ' + output.join(', ') + ' ' + braces[1];
+function ucs2Write (buf, string, offset, length) {
+ return blitBuffer(utf16leToBytes(string, buf.length - offset), buf, offset, length)
}
+Buffer.prototype.write = function write (string, offset, length, encoding) {
+ // Buffer#write(string)
+ if (offset === undefined) {
+ encoding = 'utf8'
+ length = this.length
+ offset = 0
+ // Buffer#write(string, encoding)
+ } else if (length === undefined && typeof offset === 'string') {
+ encoding = offset
+ length = this.length
+ offset = 0
+ // Buffer#write(string, offset[, length][, encoding])
+ } else if (isFinite(offset)) {
+ offset = offset | 0
+ if (isFinite(length)) {
+ length = length | 0
+ if (encoding === undefined) encoding = 'utf8'
+ } else {
+ encoding = length
+ length = undefined
+ }
+ // legacy write(string, encoding, offset, length) - remove in v0.13
+ } else {
+ var swap = encoding
+ encoding = offset
+ offset = length | 0
+ length = swap
+ }
-// NOTE: These type checking functions intentionally don't use `instanceof`
-// because it is fragile and can be easily faked with `Object.create()`.
-function isArray(ar) {
- return Array.isArray(ar);
-}
-exports.isArray = isArray;
+ var remaining = this.length - offset
+ if (length === undefined || length > remaining) length = remaining
-function isBoolean(arg) {
- return typeof arg === 'boolean';
-}
-exports.isBoolean = isBoolean;
+ if ((string.length > 0 && (length < 0 || offset < 0)) || offset > this.length) {
+ throw new RangeError('attempt to write outside buffer bounds')
+ }
-function isNull(arg) {
- return arg === null;
-}
-exports.isNull = isNull;
+ if (!encoding) encoding = 'utf8'
-function isNullOrUndefined(arg) {
- return arg == null;
-}
-exports.isNullOrUndefined = isNullOrUndefined;
+ var loweredCase = false
+ for (;;) {
+ switch (encoding) {
+ case 'hex':
+ return hexWrite(this, string, offset, length)
-function isNumber(arg) {
- return typeof arg === 'number';
-}
-exports.isNumber = isNumber;
+ case 'utf8':
+ case 'utf-8':
+ return utf8Write(this, string, offset, length)
-function isString(arg) {
- return typeof arg === 'string';
-}
-exports.isString = isString;
+ case 'ascii':
+ return asciiWrite(this, string, offset, length)
-function isSymbol(arg) {
- return typeof arg === 'symbol';
-}
-exports.isSymbol = isSymbol;
+ case 'binary':
+ return binaryWrite(this, string, offset, length)
-function isUndefined(arg) {
- return arg === void 0;
-}
-exports.isUndefined = isUndefined;
+ case 'base64':
+ // Warning: maxLength not taken into account in base64Write
+ return base64Write(this, string, offset, length)
-function isRegExp(re) {
- return isObject(re) && objectToString(re) === '[object RegExp]';
-}
-exports.isRegExp = isRegExp;
+ case 'ucs2':
+ case 'ucs-2':
+ case 'utf16le':
+ case 'utf-16le':
+ return ucs2Write(this, string, offset, length)
-function isObject(arg) {
- return typeof arg === 'object' && arg !== null;
+ default:
+ if (loweredCase) throw new TypeError('Unknown encoding: ' + encoding)
+ encoding = ('' + encoding).toLowerCase()
+ loweredCase = true
+ }
+ }
}
-exports.isObject = isObject;
-function isDate(d) {
- return isObject(d) && objectToString(d) === '[object Date]';
+Buffer.prototype.toJSON = function toJSON () {
+ return {
+ type: 'Buffer',
+ data: Array.prototype.slice.call(this._arr || this, 0)
+ }
}
-exports.isDate = isDate;
-function isError(e) {
- return isObject(e) &&
- (objectToString(e) === '[object Error]' || e instanceof Error);
+function base64Slice (buf, start, end) {
+ if (start === 0 && end === buf.length) {
+ return base64.fromByteArray(buf)
+ } else {
+ return base64.fromByteArray(buf.slice(start, end))
+ }
}
-exports.isError = isError;
-function isFunction(arg) {
- return typeof arg === 'function';
-}
-exports.isFunction = isFunction;
+function utf8Slice (buf, start, end) {
+ end = Math.min(buf.length, end)
+ var firstByte
+ var secondByte
+ var thirdByte
+ var fourthByte
+ var bytesPerSequence
+ var tempCodePoint
+ var codePoint
+ var res = []
+ var i = start
+
+ for (; i < end; i += bytesPerSequence) {
+ firstByte = buf[i]
+ codePoint = 0xFFFD
+
+ if (firstByte > 0xEF) {
+ bytesPerSequence = 4
+ } else if (firstByte > 0xDF) {
+ bytesPerSequence = 3
+ } else if (firstByte > 0xBF) {
+ bytesPerSequence = 2
+ } else {
+ bytesPerSequence = 1
+ }
-function isPrimitive(arg) {
- return arg === null ||
- typeof arg === 'boolean' ||
- typeof arg === 'number' ||
- typeof arg === 'string' ||
- typeof arg === 'symbol' || // ES6 symbol
- typeof arg === 'undefined';
+ if (i + bytesPerSequence <= end) {
+ switch (bytesPerSequence) {
+ case 1:
+ if (firstByte < 0x80) {
+ codePoint = firstByte
+ }
+ break
+ case 2:
+ secondByte = buf[i + 1]
+ if ((secondByte & 0xC0) === 0x80) {
+ tempCodePoint = (firstByte & 0x1F) << 0x6 | (secondByte & 0x3F)
+ if (tempCodePoint > 0x7F) {
+ codePoint = tempCodePoint
+ }
+ }
+ break
+ case 3:
+ secondByte = buf[i + 1]
+ thirdByte = buf[i + 2]
+ if ((secondByte & 0xC0) === 0x80 && (thirdByte & 0xC0) === 0x80) {
+ tempCodePoint = (firstByte & 0xF) << 0xC | (secondByte & 0x3F) << 0x6 | (thirdByte & 0x3F)
+ if (tempCodePoint > 0x7FF && (tempCodePoint < 0xD800 || tempCodePoint > 0xDFFF)) {
+ codePoint = tempCodePoint
+ }
+ }
+ break
+ case 4:
+ secondByte = buf[i + 1]
+ thirdByte = buf[i + 2]
+ fourthByte = buf[i + 3]
+ if ((secondByte & 0xC0) === 0x80 && (thirdByte & 0xC0) === 0x80 && (fourthByte & 0xC0) === 0x80) {
+ tempCodePoint = (firstByte & 0xF) << 0x12 | (secondByte & 0x3F) << 0xC | (thirdByte & 0x3F) << 0x6 | (fourthByte & 0x3F)
+ if (tempCodePoint > 0xFFFF && tempCodePoint < 0x110000) {
+ codePoint = tempCodePoint
+ }
+ }
+ }
+ }
+
+ if (codePoint === 0xFFFD) {
+ // we generated an invalid codePoint so make sure to only advance by 1 byte
+ bytesPerSequence = 1
+ } else if (codePoint > 0xFFFF) {
+ // encode to utf16 (surrogate pair dance)
+ codePoint -= 0x10000
+ res.push(codePoint >>> 10 & 0x3FF | 0xD800)
+ codePoint = 0xDC00 | codePoint & 0x3FF
+ }
+
+ res.push(codePoint)
+ }
+
+ return String.fromCharCode.apply(String, res)
}
-exports.isPrimitive = isPrimitive;
-exports.isBuffer = _dereq_('./support/isBuffer');
+function asciiSlice (buf, start, end) {
+ var ret = ''
+ end = Math.min(buf.length, end)
-function objectToString(o) {
- return Object.prototype.toString.call(o);
+ for (var i = start; i < end; i++) {
+ ret += String.fromCharCode(buf[i] & 0x7F)
+ }
+ return ret
}
+function binarySlice (buf, start, end) {
+ var ret = ''
+ end = Math.min(buf.length, end)
-function pad(n) {
- return n < 10 ? '0' + n.toString(10) : n.toString(10);
+ for (var i = start; i < end; i++) {
+ ret += String.fromCharCode(buf[i])
+ }
+ return ret
}
+function hexSlice (buf, start, end) {
+ var len = buf.length
-var months = ['Jan', 'Feb', 'Mar', 'Apr', 'May', 'Jun', 'Jul', 'Aug', 'Sep',
- 'Oct', 'Nov', 'Dec'];
+ if (!start || start < 0) start = 0
+ if (!end || end < 0 || end > len) end = len
-// 26 Feb 16:19:34
-function timestamp() {
- var d = new Date();
- var time = [pad(d.getHours()),
- pad(d.getMinutes()),
- pad(d.getSeconds())].join(':');
- return [d.getDate(), months[d.getMonth()], time].join(' ');
+ var out = ''
+ for (var i = start; i < end; i++) {
+ out += toHex(buf[i])
+ }
+ return out
}
+function utf16leSlice (buf, start, end) {
+ var bytes = buf.slice(start, end)
+ var res = ''
+ for (var i = 0; i < bytes.length; i += 2) {
+ res += String.fromCharCode(bytes[i] + bytes[i + 1] * 256)
+ }
+ return res
+}
-// log is just a thin wrapper to console.log that prepends a timestamp
-exports.log = function() {
- console.log('%s - %s', timestamp(), exports.format.apply(exports, arguments));
-};
+Buffer.prototype.slice = function slice (start, end) {
+ var len = this.length
+ start = ~~start
+ end = end === undefined ? len : ~~end
+ if (start < 0) {
+ start += len
+ if (start < 0) start = 0
+ } else if (start > len) {
+ start = len
+ }
-/**
- * Inherit the prototype methods from one constructor into another.
- *
- * The Function.prototype.inherits from lang.js rewritten as a standalone
- * function (not on Function.prototype). NOTE: If this file is to be loaded
- * during bootstrapping this function needs to be rewritten using some native
- * functions as prototype setup using normal JavaScript does not work as
- * expected during bootstrapping (see mirror.js in r114903).
- *
- * @param {function} ctor Constructor function which needs to inherit the
- * prototype.
- * @param {function} superCtor Constructor function to inherit prototype from.
- */
-exports.inherits = _dereq_('inherits');
-
-exports._extend = function(origin, add) {
- // Don't do anything if add isn't an object
- if (!add || !isObject(add)) return origin;
-
- var keys = Object.keys(add);
- var i = keys.length;
- while (i--) {
- origin[keys[i]] = add[keys[i]];
+ if (end < 0) {
+ end += len
+ if (end < 0) end = 0
+ } else if (end > len) {
+ end = len
}
- return origin;
-};
-
-function hasOwnProperty(obj, prop) {
- return Object.prototype.hasOwnProperty.call(obj, prop);
-}
-}).call(this,_dereq_("FWaASH"),typeof self !== "undefined" ? self : typeof window !== "undefined" ? window : {})
-},{"./support/isBuffer":5,"FWaASH":12,"inherits":11}],7:[function(_dereq_,module,exports){
-
-},{}],8:[function(_dereq_,module,exports){
-/*!
- * The buffer module from node.js, for the browser.
- *
- * at author Feross Aboukhadijeh <feross@feross.org> <http://feross.org>
- * at license MIT
- */
+ if (end < start) end = start
-var base64 = _dereq_('base64-js')
-var ieee754 = _dereq_('ieee754')
+ var newBuf
+ if (Buffer.TYPED_ARRAY_SUPPORT) {
+ newBuf = Buffer._augment(this.subarray(start, end))
+ } else {
+ var sliceLen = end - start
+ newBuf = new Buffer(sliceLen, undefined)
+ for (var i = 0; i < sliceLen; i++) {
+ newBuf[i] = this[i + start]
+ }
+ }
-exports.Buffer = Buffer
-exports.SlowBuffer = Buffer
-exports.INSPECT_MAX_BYTES = 50
-Buffer.poolSize = 8192
+ if (newBuf.length) newBuf.parent = this.parent || this
-/**
- * If `Buffer._useTypedArrays`:
- * === true Use Uint8Array implementation (fastest)
- * === false Use Object implementation (compatible down to IE6)
- */
-Buffer._useTypedArrays = (function () {
- // Detect if browser supports Typed Arrays. Supported browsers are IE 10+, Firefox 4+,
- // Chrome 7+, Safari 5.1+, Opera 11.6+, iOS 4.2+. If the browser does not support adding
- // properties to `Uint8Array` instances, then that's the same as no `Uint8Array` support
- // because we need to be able to add all the node Buffer API methods. This is an issue
- // in Firefox 4-29. Now fixed: https://bugzilla.mozilla.org/show_bug.cgi?id=695438
- try {
- var buf = new ArrayBuffer(0)
- var arr = new Uint8Array(buf)
- arr.foo = function () { return 42 }
- return 42 === arr.foo() &&
- typeof arr.subarray === 'function' // Chrome 9-10 lack `subarray`
- } catch (e) {
- return false
- }
-})()
+ return newBuf
+}
-/**
- * Class: Buffer
- * =============
- *
- * The Buffer constructor returns instances of `Uint8Array` that are augmented
- * with function properties for all the node `Buffer` API functions. We use
- * `Uint8Array` so that square bracket notation works as expected -- it returns
- * a single octet.
- *
- * By augmenting the instances, we can avoid modifying the `Uint8Array`
- * prototype.
+/*
+ * Need to make sure that buffer isn't trying to write out of bounds.
*/
-function Buffer (subject, encoding, noZero) {
- if (!(this instanceof Buffer))
- return new Buffer(subject, encoding, noZero)
+function checkOffset (offset, ext, length) {
+ if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')
+ if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')
+}
- var type = typeof subject
+Buffer.prototype.readUIntLE = function readUIntLE (offset, byteLength, noAssert) {
+ offset = offset | 0
+ byteLength = byteLength | 0
+ if (!noAssert) checkOffset(offset, byteLength, this.length)
- if (encoding === 'base64' && type === 'string') {
- subject = base64clean(subject)
+ var val = this[offset]
+ var mul = 1
+ var i = 0
+ while (++i < byteLength && (mul *= 0x100)) {
+ val += this[offset + i] * mul
}
- // Find the length
- var length
- if (type === 'number')
- length = coerce(subject)
- else if (type === 'string')
- length = Buffer.byteLength(subject, encoding)
- else if (type === 'object')
- length = coerce(subject.length) // assume that object is array-like
- else
- throw new Error('First argument needs to be a number, array or string.')
+ return val
+}
- var buf
- if (Buffer._useTypedArrays) {
- // Preferred: Return an augmented `Uint8Array` instance for best performance
- buf = Buffer._augment(new Uint8Array(length))
- } else {
- // Fallback: Return THIS instance of Buffer (created by `new`)
- buf = this
- buf.length = length
- buf._isBuffer = true
+Buffer.prototype.readUIntBE = function readUIntBE (offset, byteLength, noAssert) {
+ offset = offset | 0
+ byteLength = byteLength | 0
+ if (!noAssert) {
+ checkOffset(offset, byteLength, this.length)
}
- var i
- if (Buffer._useTypedArrays && typeof subject.byteLength === 'number') {
- // Speed optimization -- use set if we're copying from a typed array
- buf._set(subject)
- } else if (isArrayish(subject)) {
- // Treat array-ish objects as a byte array
- if (Buffer.isBuffer(subject)) {
- for (i = 0; i < length; i++)
- buf[i] = subject.readUInt8(i)
- } else {
- for (i = 0; i < length; i++)
- buf[i] = ((subject[i] % 256) + 256) % 256
- }
- } else if (type === 'string') {
- buf.write(subject, 0, encoding)
- } else if (type === 'number' && !Buffer._useTypedArrays && !noZero) {
- for (i = 0; i < length; i++) {
- buf[i] = 0
- }
+ var val = this[offset + --byteLength]
+ var mul = 1
+ while (byteLength > 0 && (mul *= 0x100)) {
+ val += this[offset + --byteLength] * mul
}
- return buf
+ return val
}
-// STATIC METHODS
-// ==============
-
-Buffer.isEncoding = function (encoding) {
- switch (String(encoding).toLowerCase()) {
- case 'hex':
- case 'utf8':
- case 'utf-8':
- case 'ascii':
- case 'binary':
- case 'base64':
- case 'raw':
- case 'ucs2':
- case 'ucs-2':
- case 'utf16le':
- case 'utf-16le':
- return true
- default:
- return false
- }
+Buffer.prototype.readUInt8 = function readUInt8 (offset, noAssert) {
+ if (!noAssert) checkOffset(offset, 1, this.length)
+ return this[offset]
}
-Buffer.isBuffer = function (b) {
- return !!(b !== null && b !== undefined && b._isBuffer)
+Buffer.prototype.readUInt16LE = function readUInt16LE (offset, noAssert) {
+ if (!noAssert) checkOffset(offset, 2, this.length)
+ return this[offset] | (this[offset + 1] << 8)
}
-Buffer.byteLength = function (str, encoding) {
- var ret
- str = str.toString()
- switch (encoding || 'utf8') {
- case 'hex':
- ret = str.length / 2
- break
- case 'utf8':
- case 'utf-8':
- ret = utf8ToBytes(str).length
- break
- case 'ascii':
- case 'binary':
- case 'raw':
- ret = str.length
- break
- case 'base64':
- ret = base64ToBytes(str).length
- break
- case 'ucs2':
- case 'ucs-2':
- case 'utf16le':
- case 'utf-16le':
- ret = str.length * 2
- break
- default:
- throw new Error('Unknown encoding')
- }
- return ret
+Buffer.prototype.readUInt16BE = function readUInt16BE (offset, noAssert) {
+ if (!noAssert) checkOffset(offset, 2, this.length)
+ return (this[offset] << 8) | this[offset + 1]
}
-Buffer.concat = function (list, totalLength) {
- assert(isArray(list), 'Usage: Buffer.concat(list[, length])')
+Buffer.prototype.readUInt32LE = function readUInt32LE (offset, noAssert) {
+ if (!noAssert) checkOffset(offset, 4, this.length)
- if (list.length === 0) {
- return new Buffer(0)
- } else if (list.length === 1) {
- return list[0]
- }
+ return ((this[offset]) |
+ (this[offset + 1] << 8) |
+ (this[offset + 2] << 16)) +
+ (this[offset + 3] * 0x1000000)
+}
- var i
- if (totalLength === undefined) {
- totalLength = 0
- for (i = 0; i < list.length; i++) {
- totalLength += list[i].length
- }
- }
+Buffer.prototype.readUInt32BE = function readUInt32BE (offset, noAssert) {
+ if (!noAssert) checkOffset(offset, 4, this.length)
- var buf = new Buffer(totalLength)
- var pos = 0
- for (i = 0; i < list.length; i++) {
- var item = list[i]
- item.copy(buf, pos)
- pos += item.length
- }
- return buf
+ return (this[offset] * 0x1000000) +
+ ((this[offset + 1] << 16) |
+ (this[offset + 2] << 8) |
+ this[offset + 3])
}
-Buffer.compare = function (a, b) {
- assert(Buffer.isBuffer(a) && Buffer.isBuffer(b), 'Arguments must be Buffers')
- var x = a.length
- var y = b.length
- for (var i = 0, len = Math.min(x, y); i < len && a[i] === b[i]; i++) {}
- if (i !== len) {
- x = a[i]
- y = b[i]
- }
- if (x < y) {
- return -1
- }
- if (y < x) {
- return 1
+Buffer.prototype.readIntLE = function readIntLE (offset, byteLength, noAssert) {
+ offset = offset | 0
+ byteLength = byteLength | 0
+ if (!noAssert) checkOffset(offset, byteLength, this.length)
+
+ var val = this[offset]
+ var mul = 1
+ var i = 0
+ while (++i < byteLength && (mul *= 0x100)) {
+ val += this[offset + i] * mul
}
- return 0
-}
+ mul *= 0x80
-// BUFFER INSTANCE METHODS
-// =======================
+ if (val >= mul) val -= Math.pow(2, 8 * byteLength)
-function hexWrite (buf, string, offset, length) {
- offset = Number(offset) || 0
- var remaining = buf.length - offset
- if (!length) {
- length = remaining
- } else {
- length = Number(length)
- if (length > remaining) {
- length = remaining
- }
- }
+ return val
+}
- // must be an even number of digits
- var strLen = string.length
- assert(strLen % 2 === 0, 'Invalid hex string')
+Buffer.prototype.readIntBE = function readIntBE (offset, byteLength, noAssert) {
+ offset = offset | 0
+ byteLength = byteLength | 0
+ if (!noAssert) checkOffset(offset, byteLength, this.length)
- if (length > strLen / 2) {
- length = strLen / 2
- }
- for (var i = 0; i < length; i++) {
- var byte = parseInt(string.substr(i * 2, 2), 16)
- assert(!isNaN(byte), 'Invalid hex string')
- buf[offset + i] = byte
+ var i = byteLength
+ var mul = 1
+ var val = this[offset + --i]
+ while (i > 0 && (mul *= 0x100)) {
+ val += this[offset + --i] * mul
}
- return i
-}
+ mul *= 0x80
-function utf8Write (buf, string, offset, length) {
- var charsWritten = blitBuffer(utf8ToBytes(string), buf, offset, length)
- return charsWritten
-}
+ if (val >= mul) val -= Math.pow(2, 8 * byteLength)
-function asciiWrite (buf, string, offset, length) {
- var charsWritten = blitBuffer(asciiToBytes(string), buf, offset, length)
- return charsWritten
+ return val
}
-function binaryWrite (buf, string, offset, length) {
- return asciiWrite(buf, string, offset, length)
+Buffer.prototype.readInt8 = function readInt8 (offset, noAssert) {
+ if (!noAssert) checkOffset(offset, 1, this.length)
+ if (!(this[offset] & 0x80)) return (this[offset])
+ return ((0xff - this[offset] + 1) * -1)
}
-function base64Write (buf, string, offset, length) {
- var charsWritten = blitBuffer(base64ToBytes(string), buf, offset, length)
- return charsWritten
+Buffer.prototype.readInt16LE = function readInt16LE (offset, noAssert) {
+ if (!noAssert) checkOffset(offset, 2, this.length)
+ var val = this[offset] | (this[offset + 1] << 8)
+ return (val & 0x8000) ? val | 0xFFFF0000 : val
}
-function utf16leWrite (buf, string, offset, length) {
- var charsWritten = blitBuffer(utf16leToBytes(string), buf, offset, length)
- return charsWritten
+Buffer.prototype.readInt16BE = function readInt16BE (offset, noAssert) {
+ if (!noAssert) checkOffset(offset, 2, this.length)
+ var val = this[offset + 1] | (this[offset] << 8)
+ return (val & 0x8000) ? val | 0xFFFF0000 : val
}
-Buffer.prototype.write = function (string, offset, length, encoding) {
- // Support both (string, offset, length, encoding)
- // and the legacy (string, encoding, offset, length)
- if (isFinite(offset)) {
- if (!isFinite(length)) {
- encoding = length
- length = undefined
- }
- } else { // legacy
- var swap = encoding
- encoding = offset
- offset = length
- length = swap
- }
-
- offset = Number(offset) || 0
- var remaining = this.length - offset
- if (!length) {
- length = remaining
- } else {
- length = Number(length)
- if (length > remaining) {
- length = remaining
- }
- }
- encoding = String(encoding || 'utf8').toLowerCase()
+Buffer.prototype.readInt32LE = function readInt32LE (offset, noAssert) {
+ if (!noAssert) checkOffset(offset, 4, this.length)
- var ret
- switch (encoding) {
- case 'hex':
- ret = hexWrite(this, string, offset, length)
- break
- case 'utf8':
- case 'utf-8':
- ret = utf8Write(this, string, offset, length)
- break
- case 'ascii':
- ret = asciiWrite(this, string, offset, length)
- break
- case 'binary':
- ret = binaryWrite(this, string, offset, length)
- break
- case 'base64':
- ret = base64Write(this, string, offset, length)
- break
- case 'ucs2':
- case 'ucs-2':
- case 'utf16le':
- case 'utf-16le':
- ret = utf16leWrite(this, string, offset, length)
- break
- default:
- throw new Error('Unknown encoding')
- }
- return ret
+ return (this[offset]) |
+ (this[offset + 1] << 8) |
+ (this[offset + 2] << 16) |
+ (this[offset + 3] << 24)
}
-Buffer.prototype.toString = function (encoding, start, end) {
- var self = this
+Buffer.prototype.readInt32BE = function readInt32BE (offset, noAssert) {
+ if (!noAssert) checkOffset(offset, 4, this.length)
- encoding = String(encoding || 'utf8').toLowerCase()
- start = Number(start) || 0
- end = (end === undefined) ? self.length : Number(end)
+ return (this[offset] << 24) |
+ (this[offset + 1] << 16) |
+ (this[offset + 2] << 8) |
+ (this[offset + 3])
+}
- // Fastpath empty strings
- if (end === start)
- return ''
+Buffer.prototype.readFloatLE = function readFloatLE (offset, noAssert) {
+ if (!noAssert) checkOffset(offset, 4, this.length)
+ return ieee754.read(this, offset, true, 23, 4)
+}
- var ret
- switch (encoding) {
- case 'hex':
- ret = hexSlice(self, start, end)
- break
- case 'utf8':
- case 'utf-8':
- ret = utf8Slice(self, start, end)
- break
- case 'ascii':
- ret = asciiSlice(self, start, end)
- break
- case 'binary':
- ret = binarySlice(self, start, end)
- break
- case 'base64':
- ret = base64Slice(self, start, end)
- break
- case 'ucs2':
- case 'ucs-2':
- case 'utf16le':
- case 'utf-16le':
- ret = utf16leSlice(self, start, end)
- break
- default:
- throw new Error('Unknown encoding')
- }
- return ret
+Buffer.prototype.readFloatBE = function readFloatBE (offset, noAssert) {
+ if (!noAssert) checkOffset(offset, 4, this.length)
+ return ieee754.read(this, offset, false, 23, 4)
}
-Buffer.prototype.toJSON = function () {
- return {
- type: 'Buffer',
- data: Array.prototype.slice.call(this._arr || this, 0)
- }
+Buffer.prototype.readDoubleLE = function readDoubleLE (offset, noAssert) {
+ if (!noAssert) checkOffset(offset, 8, this.length)
+ return ieee754.read(this, offset, true, 52, 8)
}
-Buffer.prototype.equals = function (b) {
- assert(Buffer.isBuffer(b), 'Argument must be a Buffer')
- return Buffer.compare(this, b) === 0
+Buffer.prototype.readDoubleBE = function readDoubleBE (offset, noAssert) {
+ if (!noAssert) checkOffset(offset, 8, this.length)
+ return ieee754.read(this, offset, false, 52, 8)
}
-Buffer.prototype.compare = function (b) {
- assert(Buffer.isBuffer(b), 'Argument must be a Buffer')
- return Buffer.compare(this, b)
+function checkInt (buf, value, offset, ext, max, min) {
+ if (!Buffer.isBuffer(buf)) throw new TypeError('buffer must be a Buffer instance')
+ if (value > max || value < min) throw new RangeError('value is out of bounds')
+ if (offset + ext > buf.length) throw new RangeError('index out of range')
}
-// copy(targetBuffer, targetStart=0, sourceStart=0, sourceEnd=buffer.length)
-Buffer.prototype.copy = function (target, target_start, start, end) {
- var source = this
+Buffer.prototype.writeUIntLE = function writeUIntLE (value, offset, byteLength, noAssert) {
+ value = +value
+ offset = offset | 0
+ byteLength = byteLength | 0
+ if (!noAssert) checkInt(this, value, offset, byteLength, Math.pow(2, 8 * byteLength), 0)
- if (!start) start = 0
- if (!end && end !== 0) end = this.length
- if (!target_start) target_start = 0
+ var mul = 1
+ var i = 0
+ this[offset] = value & 0xFF
+ while (++i < byteLength && (mul *= 0x100)) {
+ this[offset + i] = (value / mul) & 0xFF
+ }
- // Copy 0 bytes; we're done
- if (end === start) return
- if (target.length === 0 || source.length === 0) return
+ return offset + byteLength
+}
- // Fatal error conditions
- assert(end >= start, 'sourceEnd < sourceStart')
- assert(target_start >= 0 && target_start < target.length,
- 'targetStart out of bounds')
- assert(start >= 0 && start < source.length, 'sourceStart out of bounds')
- assert(end >= 0 && end <= source.length, 'sourceEnd out of bounds')
+Buffer.prototype.writeUIntBE = function writeUIntBE (value, offset, byteLength, noAssert) {
+ value = +value
+ offset = offset | 0
+ byteLength = byteLength | 0
+ if (!noAssert) checkInt(this, value, offset, byteLength, Math.pow(2, 8 * byteLength), 0)
- // Are we oob?
- if (end > this.length)
- end = this.length
- if (target.length - target_start < end - start)
- end = target.length - target_start + start
+ var i = byteLength - 1
+ var mul = 1
+ this[offset + i] = value & 0xFF
+ while (--i >= 0 && (mul *= 0x100)) {
+ this[offset + i] = (value / mul) & 0xFF
+ }
- var len = end - start
+ return offset + byteLength
+}
- if (len < 100 || !Buffer._useTypedArrays) {
- for (var i = 0; i < len; i++) {
- target[i + target_start] = this[i + start]
- }
+Buffer.prototype.writeUInt8 = function writeUInt8 (value, offset, noAssert) {
+ value = +value
+ offset = offset | 0
+ if (!noAssert) checkInt(this, value, offset, 1, 0xff, 0)
+ if (!Buffer.TYPED_ARRAY_SUPPORT) value = Math.floor(value)
+ this[offset] = value
+ return offset + 1
+}
+
+function objectWriteUInt16 (buf, value, offset, littleEndian) {
+ if (value < 0) value = 0xffff + value + 1
+ for (var i = 0, j = Math.min(buf.length - offset, 2); i < j; i++) {
+ buf[offset + i] = (value & (0xff << (8 * (littleEndian ? i : 1 - i)))) >>>
+ (littleEndian ? i : 1 - i) * 8
+ }
+}
+
+Buffer.prototype.writeUInt16LE = function writeUInt16LE (value, offset, noAssert) {
+ value = +value
+ offset = offset | 0
+ if (!noAssert) checkInt(this, value, offset, 2, 0xffff, 0)
+ if (Buffer.TYPED_ARRAY_SUPPORT) {
+ this[offset] = value
+ this[offset + 1] = (value >>> 8)
} else {
- target._set(this.subarray(start, start + len), target_start)
+ objectWriteUInt16(this, value, offset, true)
}
+ return offset + 2
}
-function base64Slice (buf, start, end) {
- if (start === 0 && end === buf.length) {
- return base64.fromByteArray(buf)
+Buffer.prototype.writeUInt16BE = function writeUInt16BE (value, offset, noAssert) {
+ value = +value
+ offset = offset | 0
+ if (!noAssert) checkInt(this, value, offset, 2, 0xffff, 0)
+ if (Buffer.TYPED_ARRAY_SUPPORT) {
+ this[offset] = (value >>> 8)
+ this[offset + 1] = value
} else {
- return base64.fromByteArray(buf.slice(start, end))
+ objectWriteUInt16(this, value, offset, false)
}
+ return offset + 2
}
-function utf8Slice (buf, start, end) {
- var res = ''
- var tmp = ''
- end = Math.min(buf.length, end)
-
- for (var i = start; i < end; i++) {
- if (buf[i] <= 0x7F) {
- res += decodeUtf8Char(tmp) + String.fromCharCode(buf[i])
- tmp = ''
- } else {
- tmp += '%' + buf[i].toString(16)
- }
- }
-
- return res + decodeUtf8Char(tmp)
-}
-
-function asciiSlice (buf, start, end) {
- var ret = ''
- end = Math.min(buf.length, end)
-
- for (var i = start; i < end; i++) {
- ret += String.fromCharCode(buf[i])
- }
- return ret
-}
-
-function binarySlice (buf, start, end) {
- return asciiSlice(buf, start, end)
-}
-
-function hexSlice (buf, start, end) {
- var len = buf.length
-
- if (!start || start < 0) start = 0
- if (!end || end < 0 || end > len) end = len
-
- var out = ''
- for (var i = start; i < end; i++) {
- out += toHex(buf[i])
- }
- return out
-}
-
-function utf16leSlice (buf, start, end) {
- var bytes = buf.slice(start, end)
- var res = ''
- for (var i = 0; i < bytes.length; i += 2) {
- res += String.fromCharCode(bytes[i] + bytes[i + 1] * 256)
+function objectWriteUInt32 (buf, value, offset, littleEndian) {
+ if (value < 0) value = 0xffffffff + value + 1
+ for (var i = 0, j = Math.min(buf.length - offset, 4); i < j; i++) {
+ buf[offset + i] = (value >>> (littleEndian ? i : 3 - i) * 8) & 0xff
}
- return res
}
-Buffer.prototype.slice = function (start, end) {
- var len = this.length
- start = clamp(start, len, 0)
- end = clamp(end, len, len)
-
- if (Buffer._useTypedArrays) {
- return Buffer._augment(this.subarray(start, end))
+Buffer.prototype.writeUInt32LE = function writeUInt32LE (value, offset, noAssert) {
+ value = +value
+ offset = offset | 0
+ if (!noAssert) checkInt(this, value, offset, 4, 0xffffffff, 0)
+ if (Buffer.TYPED_ARRAY_SUPPORT) {
+ this[offset + 3] = (value >>> 24)
+ this[offset + 2] = (value >>> 16)
+ this[offset + 1] = (value >>> 8)
+ this[offset] = value
} else {
- var sliceLen = end - start
- var newBuf = new Buffer(sliceLen, undefined, true)
- for (var i = 0; i < sliceLen; i++) {
- newBuf[i] = this[i + start]
- }
- return newBuf
- }
-}
-
-// `get` will be removed in Node 0.13+
-Buffer.prototype.get = function (offset) {
- console.log('.get() is deprecated. Access using array indexes instead.')
- return this.readUInt8(offset)
-}
-
-// `set` will be removed in Node 0.13+
-Buffer.prototype.set = function (v, offset) {
- console.log('.set() is deprecated. Access using array indexes instead.')
- return this.writeUInt8(v, offset)
-}
-
-Buffer.prototype.readUInt8 = function (offset, noAssert) {
- if (!noAssert) {
- assert(offset !== undefined && offset !== null, 'missing offset')
- assert(offset < this.length, 'Trying to read beyond buffer length')
+ objectWriteUInt32(this, value, offset, true)
}
-
- if (offset >= this.length)
- return
-
- return this[offset]
+ return offset + 4
}
-function readUInt16 (buf, offset, littleEndian, noAssert) {
- if (!noAssert) {
- assert(typeof littleEndian === 'boolean', 'missing or invalid endian')
- assert(offset !== undefined && offset !== null, 'missing offset')
- assert(offset + 1 < buf.length, 'Trying to read beyond buffer length')
- }
-
- var len = buf.length
- if (offset >= len)
- return
-
- var val
- if (littleEndian) {
- val = buf[offset]
- if (offset + 1 < len)
- val |= buf[offset + 1] << 8
+Buffer.prototype.writeUInt32BE = function writeUInt32BE (value, offset, noAssert) {
+ value = +value
+ offset = offset | 0
+ if (!noAssert) checkInt(this, value, offset, 4, 0xffffffff, 0)
+ if (Buffer.TYPED_ARRAY_SUPPORT) {
+ this[offset] = (value >>> 24)
+ this[offset + 1] = (value >>> 16)
+ this[offset + 2] = (value >>> 8)
+ this[offset + 3] = value
} else {
- val = buf[offset] << 8
- if (offset + 1 < len)
- val |= buf[offset + 1]
+ objectWriteUInt32(this, value, offset, false)
}
- return val
-}
-
-Buffer.prototype.readUInt16LE = function (offset, noAssert) {
- return readUInt16(this, offset, true, noAssert)
-}
-
-Buffer.prototype.readUInt16BE = function (offset, noAssert) {
- return readUInt16(this, offset, false, noAssert)
+ return offset + 4
}
-function readUInt32 (buf, offset, littleEndian, noAssert) {
+Buffer.prototype.writeIntLE = function writeIntLE (value, offset, byteLength, noAssert) {
+ value = +value
+ offset = offset | 0
if (!noAssert) {
- assert(typeof littleEndian === 'boolean', 'missing or invalid endian')
- assert(offset !== undefined && offset !== null, 'missing offset')
- assert(offset + 3 < buf.length, 'Trying to read beyond buffer length')
- }
-
- var len = buf.length
- if (offset >= len)
- return
+ var limit = Math.pow(2, 8 * byteLength - 1)
- var val
- if (littleEndian) {
- if (offset + 2 < len)
- val = buf[offset + 2] << 16
- if (offset + 1 < len)
- val |= buf[offset + 1] << 8
- val |= buf[offset]
- if (offset + 3 < len)
- val = val + (buf[offset + 3] << 24 >>> 0)
- } else {
- if (offset + 1 < len)
- val = buf[offset + 1] << 16
- if (offset + 2 < len)
- val |= buf[offset + 2] << 8
- if (offset + 3 < len)
- val |= buf[offset + 3]
- val = val + (buf[offset] << 24 >>> 0)
- }
- return val
-}
-
-Buffer.prototype.readUInt32LE = function (offset, noAssert) {
- return readUInt32(this, offset, true, noAssert)
-}
-
-Buffer.prototype.readUInt32BE = function (offset, noAssert) {
- return readUInt32(this, offset, false, noAssert)
-}
-
-Buffer.prototype.readInt8 = function (offset, noAssert) {
- if (!noAssert) {
- assert(offset !== undefined && offset !== null,
- 'missing offset')
- assert(offset < this.length, 'Trying to read beyond buffer length')
+ checkInt(this, value, offset, byteLength, limit - 1, -limit)
}
- if (offset >= this.length)
- return
-
- var neg = this[offset] & 0x80
- if (neg)
- return (0xff - this[offset] + 1) * -1
- else
- return this[offset]
-}
-
-function readInt16 (buf, offset, littleEndian, noAssert) {
- if (!noAssert) {
- assert(typeof littleEndian === 'boolean', 'missing or invalid endian')
- assert(offset !== undefined && offset !== null, 'missing offset')
- assert(offset + 1 < buf.length, 'Trying to read beyond buffer length')
+ var i = 0
+ var mul = 1
+ var sub = value < 0 ? 1 : 0
+ this[offset] = value & 0xFF
+ while (++i < byteLength && (mul *= 0x100)) {
+ this[offset + i] = ((value / mul) >> 0) - sub & 0xFF
}
- var len = buf.length
- if (offset >= len)
- return
-
- var val = readUInt16(buf, offset, littleEndian, true)
- var neg = val & 0x8000
- if (neg)
- return (0xffff - val + 1) * -1
- else
- return val
-}
-
-Buffer.prototype.readInt16LE = function (offset, noAssert) {
- return readInt16(this, offset, true, noAssert)
-}
-
-Buffer.prototype.readInt16BE = function (offset, noAssert) {
- return readInt16(this, offset, false, noAssert)
+ return offset + byteLength
}
-function readInt32 (buf, offset, littleEndian, noAssert) {
+Buffer.prototype.writeIntBE = function writeIntBE (value, offset, byteLength, noAssert) {
+ value = +value
+ offset = offset | 0
if (!noAssert) {
- assert(typeof littleEndian === 'boolean', 'missing or invalid endian')
- assert(offset !== undefined && offset !== null, 'missing offset')
- assert(offset + 3 < buf.length, 'Trying to read beyond buffer length')
- }
-
- var len = buf.length
- if (offset >= len)
- return
-
- var val = readUInt32(buf, offset, littleEndian, true)
- var neg = val & 0x80000000
- if (neg)
- return (0xffffffff - val + 1) * -1
- else
- return val
-}
+ var limit = Math.pow(2, 8 * byteLength - 1)
-Buffer.prototype.readInt32LE = function (offset, noAssert) {
- return readInt32(this, offset, true, noAssert)
-}
-
-Buffer.prototype.readInt32BE = function (offset, noAssert) {
- return readInt32(this, offset, false, noAssert)
-}
-
-function readFloat (buf, offset, littleEndian, noAssert) {
- if (!noAssert) {
- assert(typeof littleEndian === 'boolean', 'missing or invalid endian')
- assert(offset + 3 < buf.length, 'Trying to read beyond buffer length')
+ checkInt(this, value, offset, byteLength, limit - 1, -limit)
}
- return ieee754.read(buf, offset, littleEndian, 23, 4)
-}
-
-Buffer.prototype.readFloatLE = function (offset, noAssert) {
- return readFloat(this, offset, true, noAssert)
-}
-
-Buffer.prototype.readFloatBE = function (offset, noAssert) {
- return readFloat(this, offset, false, noAssert)
-}
-
-function readDouble (buf, offset, littleEndian, noAssert) {
- if (!noAssert) {
- assert(typeof littleEndian === 'boolean', 'missing or invalid endian')
- assert(offset + 7 < buf.length, 'Trying to read beyond buffer length')
+ var i = byteLength - 1
+ var mul = 1
+ var sub = value < 0 ? 1 : 0
+ this[offset + i] = value & 0xFF
+ while (--i >= 0 && (mul *= 0x100)) {
+ this[offset + i] = ((value / mul) >> 0) - sub & 0xFF
}
- return ieee754.read(buf, offset, littleEndian, 52, 8)
-}
-
-Buffer.prototype.readDoubleLE = function (offset, noAssert) {
- return readDouble(this, offset, true, noAssert)
-}
-
-Buffer.prototype.readDoubleBE = function (offset, noAssert) {
- return readDouble(this, offset, false, noAssert)
+ return offset + byteLength
}
-Buffer.prototype.writeUInt8 = function (value, offset, noAssert) {
- if (!noAssert) {
- assert(value !== undefined && value !== null, 'missing value')
- assert(offset !== undefined && offset !== null, 'missing offset')
- assert(offset < this.length, 'trying to write beyond buffer length')
- verifuint(value, 0xff)
- }
-
- if (offset >= this.length) return
-
+Buffer.prototype.writeInt8 = function writeInt8 (value, offset, noAssert) {
+ value = +value
+ offset = offset | 0
+ if (!noAssert) checkInt(this, value, offset, 1, 0x7f, -0x80)
+ if (!Buffer.TYPED_ARRAY_SUPPORT) value = Math.floor(value)
+ if (value < 0) value = 0xff + value + 1
this[offset] = value
return offset + 1
}
-function writeUInt16 (buf, value, offset, littleEndian, noAssert) {
- if (!noAssert) {
- assert(value !== undefined && value !== null, 'missing value')
- assert(typeof littleEndian === 'boolean', 'missing or invalid endian')
- assert(offset !== undefined && offset !== null, 'missing offset')
- assert(offset + 1 < buf.length, 'trying to write beyond buffer length')
- verifuint(value, 0xffff)
- }
-
- var len = buf.length
- if (offset >= len)
- return
-
- for (var i = 0, j = Math.min(len - offset, 2); i < j; i++) {
- buf[offset + i] =
- (value & (0xff << (8 * (littleEndian ? i : 1 - i)))) >>>
- (littleEndian ? i : 1 - i) * 8
+Buffer.prototype.writeInt16LE = function writeInt16LE (value, offset, noAssert) {
+ value = +value
+ offset = offset | 0
+ if (!noAssert) checkInt(this, value, offset, 2, 0x7fff, -0x8000)
+ if (Buffer.TYPED_ARRAY_SUPPORT) {
+ this[offset] = value
+ this[offset + 1] = (value >>> 8)
+ } else {
+ objectWriteUInt16(this, value, offset, true)
}
return offset + 2
}
-Buffer.prototype.writeUInt16LE = function (value, offset, noAssert) {
- return writeUInt16(this, value, offset, true, noAssert)
-}
-
-Buffer.prototype.writeUInt16BE = function (value, offset, noAssert) {
- return writeUInt16(this, value, offset, false, noAssert)
-}
-
-function writeUInt32 (buf, value, offset, littleEndian, noAssert) {
- if (!noAssert) {
- assert(value !== undefined && value !== null, 'missing value')
- assert(typeof littleEndian === 'boolean', 'missing or invalid endian')
- assert(offset !== undefined && offset !== null, 'missing offset')
- assert(offset + 3 < buf.length, 'trying to write beyond buffer length')
- verifuint(value, 0xffffffff)
- }
-
- var len = buf.length
- if (offset >= len)
- return
-
- for (var i = 0, j = Math.min(len - offset, 4); i < j; i++) {
- buf[offset + i] =
- (value >>> (littleEndian ? i : 3 - i) * 8) & 0xff
- }
- return offset + 4
-}
-
-Buffer.prototype.writeUInt32LE = function (value, offset, noAssert) {
- return writeUInt32(this, value, offset, true, noAssert)
-}
-
-Buffer.prototype.writeUInt32BE = function (value, offset, noAssert) {
- return writeUInt32(this, value, offset, false, noAssert)
-}
-
-Buffer.prototype.writeInt8 = function (value, offset, noAssert) {
- if (!noAssert) {
- assert(value !== undefined && value !== null, 'missing value')
- assert(offset !== undefined && offset !== null, 'missing offset')
- assert(offset < this.length, 'Trying to write beyond buffer length')
- verifsint(value, 0x7f, -0x80)
- }
-
- if (offset >= this.length)
- return
-
- if (value >= 0)
- this.writeUInt8(value, offset, noAssert)
- else
- this.writeUInt8(0xff + value + 1, offset, noAssert)
- return offset + 1
-}
-
-function writeInt16 (buf, value, offset, littleEndian, noAssert) {
- if (!noAssert) {
- assert(value !== undefined && value !== null, 'missing value')
- assert(typeof littleEndian === 'boolean', 'missing or invalid endian')
- assert(offset !== undefined && offset !== null, 'missing offset')
- assert(offset + 1 < buf.length, 'Trying to write beyond buffer length')
- verifsint(value, 0x7fff, -0x8000)
+Buffer.prototype.writeInt16BE = function writeInt16BE (value, offset, noAssert) {
+ value = +value
+ offset = offset | 0
+ if (!noAssert) checkInt(this, value, offset, 2, 0x7fff, -0x8000)
+ if (Buffer.TYPED_ARRAY_SUPPORT) {
+ this[offset] = (value >>> 8)
+ this[offset + 1] = value
+ } else {
+ objectWriteUInt16(this, value, offset, false)
}
-
- var len = buf.length
- if (offset >= len)
- return
-
- if (value >= 0)
- writeUInt16(buf, value, offset, littleEndian, noAssert)
- else
- writeUInt16(buf, 0xffff + value + 1, offset, littleEndian, noAssert)
return offset + 2
}
-Buffer.prototype.writeInt16LE = function (value, offset, noAssert) {
- return writeInt16(this, value, offset, true, noAssert)
-}
-
-Buffer.prototype.writeInt16BE = function (value, offset, noAssert) {
- return writeInt16(this, value, offset, false, noAssert)
-}
-
-function writeInt32 (buf, value, offset, littleEndian, noAssert) {
- if (!noAssert) {
- assert(value !== undefined && value !== null, 'missing value')
- assert(typeof littleEndian === 'boolean', 'missing or invalid endian')
- assert(offset !== undefined && offset !== null, 'missing offset')
- assert(offset + 3 < buf.length, 'Trying to write beyond buffer length')
- verifsint(value, 0x7fffffff, -0x80000000)
+Buffer.prototype.writeInt32LE = function writeInt32LE (value, offset, noAssert) {
+ value = +value
+ offset = offset | 0
+ if (!noAssert) checkInt(this, value, offset, 4, 0x7fffffff, -0x80000000)
+ if (Buffer.TYPED_ARRAY_SUPPORT) {
+ this[offset] = value
+ this[offset + 1] = (value >>> 8)
+ this[offset + 2] = (value >>> 16)
+ this[offset + 3] = (value >>> 24)
+ } else {
+ objectWriteUInt32(this, value, offset, true)
}
-
- var len = buf.length
- if (offset >= len)
- return
-
- if (value >= 0)
- writeUInt32(buf, value, offset, littleEndian, noAssert)
- else
- writeUInt32(buf, 0xffffffff + value + 1, offset, littleEndian, noAssert)
return offset + 4
}
-Buffer.prototype.writeInt32LE = function (value, offset, noAssert) {
- return writeInt32(this, value, offset, true, noAssert)
+Buffer.prototype.writeInt32BE = function writeInt32BE (value, offset, noAssert) {
+ value = +value
+ offset = offset | 0
+ if (!noAssert) checkInt(this, value, offset, 4, 0x7fffffff, -0x80000000)
+ if (value < 0) value = 0xffffffff + value + 1
+ if (Buffer.TYPED_ARRAY_SUPPORT) {
+ this[offset] = (value >>> 24)
+ this[offset + 1] = (value >>> 16)
+ this[offset + 2] = (value >>> 8)
+ this[offset + 3] = value
+ } else {
+ objectWriteUInt32(this, value, offset, false)
+ }
+ return offset + 4
}
-Buffer.prototype.writeInt32BE = function (value, offset, noAssert) {
- return writeInt32(this, value, offset, false, noAssert)
+function checkIEEE754 (buf, value, offset, ext, max, min) {
+ if (value > max || value < min) throw new RangeError('value is out of bounds')
+ if (offset + ext > buf.length) throw new RangeError('index out of range')
+ if (offset < 0) throw new RangeError('index out of range')
}
function writeFloat (buf, value, offset, littleEndian, noAssert) {
if (!noAssert) {
- assert(value !== undefined && value !== null, 'missing value')
- assert(typeof littleEndian === 'boolean', 'missing or invalid endian')
- assert(offset !== undefined && offset !== null, 'missing offset')
- assert(offset + 3 < buf.length, 'Trying to write beyond buffer length')
- verifIEEE754(value, 3.4028234663852886e+38, -3.4028234663852886e+38)
+ checkIEEE754(buf, value, offset, 4, 3.4028234663852886e+38, -3.4028234663852886e+38)
}
-
- var len = buf.length
- if (offset >= len)
- return
-
ieee754.write(buf, value, offset, littleEndian, 23, 4)
return offset + 4
}
-Buffer.prototype.writeFloatLE = function (value, offset, noAssert) {
+Buffer.prototype.writeFloatLE = function writeFloatLE (value, offset, noAssert) {
return writeFloat(this, value, offset, true, noAssert)
}
-Buffer.prototype.writeFloatBE = function (value, offset, noAssert) {
+Buffer.prototype.writeFloatBE = function writeFloatBE (value, offset, noAssert) {
return writeFloat(this, value, offset, false, noAssert)
}
function writeDouble (buf, value, offset, littleEndian, noAssert) {
if (!noAssert) {
- assert(value !== undefined && value !== null, 'missing value')
- assert(typeof littleEndian === 'boolean', 'missing or invalid endian')
- assert(offset !== undefined && offset !== null, 'missing offset')
- assert(offset + 7 < buf.length,
- 'Trying to write beyond buffer length')
- verifIEEE754(value, 1.7976931348623157E+308, -1.7976931348623157E+308)
+ checkIEEE754(buf, value, offset, 8, 1.7976931348623157E+308, -1.7976931348623157E+308)
}
-
- var len = buf.length
- if (offset >= len)
- return
-
ieee754.write(buf, value, offset, littleEndian, 52, 8)
return offset + 8
}
-Buffer.prototype.writeDoubleLE = function (value, offset, noAssert) {
+Buffer.prototype.writeDoubleLE = function writeDoubleLE (value, offset, noAssert) {
return writeDouble(this, value, offset, true, noAssert)
}
-Buffer.prototype.writeDoubleBE = function (value, offset, noAssert) {
+Buffer.prototype.writeDoubleBE = function writeDoubleBE (value, offset, noAssert) {
return writeDouble(this, value, offset, false, noAssert)
}
+// copy(targetBuffer, targetStart=0, sourceStart=0, sourceEnd=buffer.length)
+Buffer.prototype.copy = function copy (target, targetStart, start, end) {
+ if (!start) start = 0
+ if (!end && end !== 0) end = this.length
+ if (targetStart >= target.length) targetStart = target.length
+ if (!targetStart) targetStart = 0
+ if (end > 0 && end < start) end = start
+
+ // Copy 0 bytes; we're done
+ if (end === start) return 0
+ if (target.length === 0 || this.length === 0) return 0
+
+ // Fatal error conditions
+ if (targetStart < 0) {
+ throw new RangeError('targetStart out of bounds')
+ }
+ if (start < 0 || start >= this.length) throw new RangeError('sourceStart out of bounds')
+ if (end < 0) throw new RangeError('sourceEnd out of bounds')
+
+ // Are we oob?
+ if (end > this.length) end = this.length
+ if (target.length - targetStart < end - start) {
+ end = target.length - targetStart + start
+ }
+
+ var len = end - start
+ var i
+
+ if (this === target && start < targetStart && targetStart < end) {
+ // descending copy from end
+ for (i = len - 1; i >= 0; i--) {
+ target[i + targetStart] = this[i + start]
+ }
+ } else if (len < 1000 || !Buffer.TYPED_ARRAY_SUPPORT) {
+ // ascending copy from start
+ for (i = 0; i < len; i++) {
+ target[i + targetStart] = this[i + start]
+ }
+ } else {
+ target._set(this.subarray(start, start + len), targetStart)
+ }
+
+ return len
+}
+
// fill(value, start=0, end=buffer.length)
-Buffer.prototype.fill = function (value, start, end) {
+Buffer.prototype.fill = function fill (value, start, end) {
if (!value) value = 0
if (!start) start = 0
if (!end) end = this.length
- assert(end >= start, 'end < start')
+ if (end < start) throw new RangeError('end < start')
// Fill 0 bytes; we're done
if (end === start) return
if (this.length === 0) return
- assert(start >= 0 && start < this.length, 'start out of bounds')
- assert(end >= 0 && end <= this.length, 'end out of bounds')
+ if (start < 0 || start >= this.length) throw new RangeError('start out of bounds')
+ if (end < 0 || end > this.length) throw new RangeError('end out of bounds')
var i
if (typeof value === 'number') {
return this
}
-Buffer.prototype.inspect = function () {
- var out = []
- var len = this.length
- for (var i = 0; i < len; i++) {
- out[i] = toHex(this[i])
- if (i === exports.INSPECT_MAX_BYTES) {
- out[i + 1] = '...'
- break
- }
- }
- return '<Buffer ' + out.join(' ') + '>'
-}
-
/**
* Creates a new `ArrayBuffer` with the *copied* memory of the buffer instance.
* Added in Node 0.12. Only available in browsers that support ArrayBuffer.
*/
-Buffer.prototype.toArrayBuffer = function () {
+Buffer.prototype.toArrayBuffer = function toArrayBuffer () {
if (typeof Uint8Array !== 'undefined') {
- if (Buffer._useTypedArrays) {
+ if (Buffer.TYPED_ARRAY_SUPPORT) {
return (new Buffer(this)).buffer
} else {
var buf = new Uint8Array(this.length)
return buf.buffer
}
} else {
- throw new Error('Buffer.toArrayBuffer not supported in this browser')
+ throw new TypeError('Buffer.toArrayBuffer not supported in this browser')
}
}
/**
* Augment a Uint8Array *instance* (not the Uint8Array class!) with Buffer methods
*/
-Buffer._augment = function (arr) {
+Buffer._augment = function _augment (arr) {
+ arr.constructor = Buffer
arr._isBuffer = true
- // save reference to original Uint8Array get/set methods before overwriting
- arr._get = arr.get
+ // save reference to original Uint8Array set method before overwriting
arr._set = arr.set
- // deprecated, will be removed in node 0.13+
+ // deprecated
arr.get = BP.get
arr.set = BP.set
arr.toJSON = BP.toJSON
arr.equals = BP.equals
arr.compare = BP.compare
+ arr.indexOf = BP.indexOf
arr.copy = BP.copy
arr.slice = BP.slice
+ arr.readUIntLE = BP.readUIntLE
+ arr.readUIntBE = BP.readUIntBE
arr.readUInt8 = BP.readUInt8
arr.readUInt16LE = BP.readUInt16LE
arr.readUInt16BE = BP.readUInt16BE
arr.readUInt32LE = BP.readUInt32LE
arr.readUInt32BE = BP.readUInt32BE
+ arr.readIntLE = BP.readIntLE
+ arr.readIntBE = BP.readIntBE
arr.readInt8 = BP.readInt8
arr.readInt16LE = BP.readInt16LE
arr.readInt16BE = BP.readInt16BE
arr.readDoubleLE = BP.readDoubleLE
arr.readDoubleBE = BP.readDoubleBE
arr.writeUInt8 = BP.writeUInt8
+ arr.writeUIntLE = BP.writeUIntLE
+ arr.writeUIntBE = BP.writeUIntBE
arr.writeUInt16LE = BP.writeUInt16LE
arr.writeUInt16BE = BP.writeUInt16BE
arr.writeUInt32LE = BP.writeUInt32LE
arr.writeUInt32BE = BP.writeUInt32BE
+ arr.writeIntLE = BP.writeIntLE
+ arr.writeIntBE = BP.writeIntBE
arr.writeInt8 = BP.writeInt8
arr.writeInt16LE = BP.writeInt16LE
arr.writeInt16BE = BP.writeInt16BE
return arr
}
-var INVALID_BASE64_RE = /[^+\/0-9A-z]/g
+var INVALID_BASE64_RE = /[^+\/0-9A-Za-z-_]/g
function base64clean (str) {
// Node strips out invalid characters like \n and \t from the string, base64-js does not
str = stringtrim(str).replace(INVALID_BASE64_RE, '')
+ // Node converts strings with length < 2 to ''
+ if (str.length < 2) return ''
// Node allows for non-padded base64 strings (missing trailing ===), base64-js does not
while (str.length % 4 !== 0) {
str = str + '='
return str.replace(/^\s+|\s+$/g, '')
}
-// slice(start, end)
-function clamp (index, len, defaultValue) {
- if (typeof index !== 'number') return defaultValue
- index = ~~index; // Coerce to integer.
- if (index >= len) return len
- if (index >= 0) return index
- index += len
- if (index >= 0) return index
- return 0
+function toHex (n) {
+ if (n < 16) return '0' + n.toString(16)
+ return n.toString(16)
}
-function coerce (length) {
- // Coerce length to a number (possibly NaN), round up
- // in case it's fractional (e.g. 123.456) then do a
- // double negate to coerce a NaN to 0. Easy, right?
- length = ~~Math.ceil(+length)
- return length < 0 ? 0 : length
-}
+function utf8ToBytes (string, units) {
+ units = units || Infinity
+ var codePoint
+ var length = string.length
+ var leadSurrogate = null
+ var bytes = []
-function isArray (subject) {
- return (Array.isArray || function (subject) {
- return Object.prototype.toString.call(subject) === '[object Array]'
- })(subject)
-}
+ for (var i = 0; i < length; i++) {
+ codePoint = string.charCodeAt(i)
+
+ // is surrogate component
+ if (codePoint > 0xD7FF && codePoint < 0xE000) {
+ // last char was a lead
+ if (!leadSurrogate) {
+ // no lead yet
+ if (codePoint > 0xDBFF) {
+ // unexpected trail
+ if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD)
+ continue
+
+ } else if (i + 1 === length) {
+ // unpaired lead
+ if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD)
+ continue
+ }
-function isArrayish (subject) {
- return isArray(subject) || Buffer.isBuffer(subject) ||
- subject && typeof subject === 'object' &&
- typeof subject.length === 'number'
-}
+ // valid lead
+ leadSurrogate = codePoint
-function toHex (n) {
- if (n < 16) return '0' + n.toString(16)
- return n.toString(16)
-}
+ continue
+ }
-function utf8ToBytes (str) {
- var byteArray = []
- for (var i = 0; i < str.length; i++) {
- var b = str.charCodeAt(i)
- if (b <= 0x7F) {
- byteArray.push(b)
- } else {
- var start = i
- if (b >= 0xD800 && b <= 0xDFFF) i++
- var h = encodeURIComponent(str.slice(start, i+1)).substr(1).split('%')
- for (var j = 0; j < h.length; j++) {
- byteArray.push(parseInt(h[j], 16))
+ // 2 leads in a row
+ if (codePoint < 0xDC00) {
+ if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD)
+ leadSurrogate = codePoint
+ continue
}
+
+ // valid surrogate pair
+ codePoint = leadSurrogate - 0xD800 << 10 | codePoint - 0xDC00 | 0x10000
+
+ } else if (leadSurrogate) {
+ // valid bmp char, but last char was a lead
+ if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD)
+ }
+
+ leadSurrogate = null
+
+ // encode utf8
+ if (codePoint < 0x80) {
+ if ((units -= 1) < 0) break
+ bytes.push(codePoint)
+ } else if (codePoint < 0x800) {
+ if ((units -= 2) < 0) break
+ bytes.push(
+ codePoint >> 0x6 | 0xC0,
+ codePoint & 0x3F | 0x80
+ )
+ } else if (codePoint < 0x10000) {
+ if ((units -= 3) < 0) break
+ bytes.push(
+ codePoint >> 0xC | 0xE0,
+ codePoint >> 0x6 & 0x3F | 0x80,
+ codePoint & 0x3F | 0x80
+ )
+ } else if (codePoint < 0x110000) {
+ if ((units -= 4) < 0) break
+ bytes.push(
+ codePoint >> 0x12 | 0xF0,
+ codePoint >> 0xC & 0x3F | 0x80,
+ codePoint >> 0x6 & 0x3F | 0x80,
+ codePoint & 0x3F | 0x80
+ )
+ } else {
+ throw new Error('Invalid code point')
}
}
- return byteArray
+
+ return bytes
}
function asciiToBytes (str) {
return byteArray
}
-function utf16leToBytes (str) {
+function utf16leToBytes (str, units) {
var c, hi, lo
var byteArray = []
for (var i = 0; i < str.length; i++) {
+ if ((units -= 2) < 0) break
+
c = str.charCodeAt(i)
hi = c >> 8
lo = c % 256
}
function base64ToBytes (str) {
- return base64.toByteArray(str)
+ return base64.toByteArray(base64clean(str))
}
function blitBuffer (src, dst, offset, length) {
for (var i = 0; i < length; i++) {
- if ((i + offset >= dst.length) || (i >= src.length))
- break
+ if ((i + offset >= dst.length) || (i >= src.length)) break
dst[i + offset] = src[i]
}
return i
}
-function decodeUtf8Char (str) {
- try {
- return decodeURIComponent(str)
- } catch (err) {
- return String.fromCharCode(0xFFFD) // UTF 8 invalid char
- }
-}
-
-/*
- * We have to make sure that the value is a valid integer. This means that it
- * is non-negative. It has no fractional component and that it does not
- * exceed the maximum allowed value.
- */
-function verifuint (value, max) {
- assert(typeof value === 'number', 'cannot write a non-number as a number')
- assert(value >= 0, 'specified a negative value for writing an unsigned value')
- assert(value <= max, 'value is larger than maximum value for type')
- assert(Math.floor(value) === value, 'value has a fractional component')
-}
-
-function verifsint (value, max, min) {
- assert(typeof value === 'number', 'cannot write a non-number as a number')
- assert(value <= max, 'value larger than maximum allowed value')
- assert(value >= min, 'value smaller than minimum allowed value')
- assert(Math.floor(value) === value, 'value has a fractional component')
-}
-
-function verifIEEE754 (value, max, min) {
- assert(typeof value === 'number', 'cannot write a non-number as a number')
- assert(value <= max, 'value larger than maximum allowed value')
- assert(value >= min, 'value smaller than minimum allowed value')
-}
-
-function assert (test, message) {
- if (!test) throw new Error(message || 'Failed assertion')
-}
-
-},{"base64-js":9,"ieee754":10}],9:[function(_dereq_,module,exports){
-var lookup = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/';
+},{"base64-js":8,"ieee754":9,"is-array":10}],8:[function(require,module,exports){
+var lookup = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/';
;(function (exports) {
'use strict';
var NUMBER = '0'.charCodeAt(0)
var LOWER = 'a'.charCodeAt(0)
var UPPER = 'A'.charCodeAt(0)
+ var PLUS_URL_SAFE = '-'.charCodeAt(0)
+ var SLASH_URL_SAFE = '_'.charCodeAt(0)
function decode (elt) {
var code = elt.charCodeAt(0)
- if (code === PLUS)
+ if (code === PLUS ||
+ code === PLUS_URL_SAFE)
return 62 // '+'
- if (code === SLASH)
+ if (code === SLASH ||
+ code === SLASH_URL_SAFE)
return 63 // '/'
if (code < NUMBER)
return -1 //no match
exports.fromByteArray = uint8ToBase64
}(typeof exports === 'undefined' ? (this.base64js = {}) : exports))
-},{}],10:[function(_dereq_,module,exports){
-exports.read = function(buffer, offset, isLE, mLen, nBytes) {
- var e, m,
- eLen = nBytes * 8 - mLen - 1,
- eMax = (1 << eLen) - 1,
- eBias = eMax >> 1,
- nBits = -7,
- i = isLE ? (nBytes - 1) : 0,
- d = isLE ? -1 : 1,
- s = buffer[offset + i];
-
- i += d;
-
- e = s & ((1 << (-nBits)) - 1);
- s >>= (-nBits);
- nBits += eLen;
- for (; nBits > 0; e = e * 256 + buffer[offset + i], i += d, nBits -= 8){};
-
- m = e & ((1 << (-nBits)) - 1);
- e >>= (-nBits);
- nBits += mLen;
- for (; nBits > 0; m = m * 256 + buffer[offset + i], i += d, nBits -= 8){};
+},{}],9:[function(require,module,exports){
+exports.read = function (buffer, offset, isLE, mLen, nBytes) {
+ var e, m
+ var eLen = nBytes * 8 - mLen - 1
+ var eMax = (1 << eLen) - 1
+ var eBias = eMax >> 1
+ var nBits = -7
+ var i = isLE ? (nBytes - 1) : 0
+ var d = isLE ? -1 : 1
+ var s = buffer[offset + i]
+
+ i += d
+
+ e = s & ((1 << (-nBits)) - 1)
+ s >>= (-nBits)
+ nBits += eLen
+ for (; nBits > 0; e = e * 256 + buffer[offset + i], i += d, nBits -= 8) {}
+
+ m = e & ((1 << (-nBits)) - 1)
+ e >>= (-nBits)
+ nBits += mLen
+ for (; nBits > 0; m = m * 256 + buffer[offset + i], i += d, nBits -= 8) {}
if (e === 0) {
- e = 1 - eBias;
+ e = 1 - eBias
} else if (e === eMax) {
- return m ? NaN : ((s ? -1 : 1) * Infinity);
+ return m ? NaN : ((s ? -1 : 1) * Infinity)
} else {
- m = m + Math.pow(2, mLen);
- e = e - eBias;
+ m = m + Math.pow(2, mLen)
+ e = e - eBias
}
- return (s ? -1 : 1) * m * Math.pow(2, e - mLen);
-};
+ return (s ? -1 : 1) * m * Math.pow(2, e - mLen)
+}
-exports.write = function(buffer, value, offset, isLE, mLen, nBytes) {
- var e, m, c,
- eLen = nBytes * 8 - mLen - 1,
- eMax = (1 << eLen) - 1,
- eBias = eMax >> 1,
- rt = (mLen === 23 ? Math.pow(2, -24) - Math.pow(2, -77) : 0),
- i = isLE ? 0 : (nBytes - 1),
- d = isLE ? 1 : -1,
- s = value < 0 || (value === 0 && 1 / value < 0) ? 1 : 0;
+exports.write = function (buffer, value, offset, isLE, mLen, nBytes) {
+ var e, m, c
+ var eLen = nBytes * 8 - mLen - 1
+ var eMax = (1 << eLen) - 1
+ var eBias = eMax >> 1
+ var rt = (mLen === 23 ? Math.pow(2, -24) - Math.pow(2, -77) : 0)
+ var i = isLE ? 0 : (nBytes - 1)
+ var d = isLE ? 1 : -1
+ var s = value < 0 || (value === 0 && 1 / value < 0) ? 1 : 0
- value = Math.abs(value);
+ value = Math.abs(value)
if (isNaN(value) || value === Infinity) {
- m = isNaN(value) ? 1 : 0;
- e = eMax;
+ m = isNaN(value) ? 1 : 0
+ e = eMax
} else {
- e = Math.floor(Math.log(value) / Math.LN2);
+ e = Math.floor(Math.log(value) / Math.LN2)
if (value * (c = Math.pow(2, -e)) < 1) {
- e--;
- c *= 2;
+ e--
+ c *= 2
}
if (e + eBias >= 1) {
- value += rt / c;
+ value += rt / c
} else {
- value += rt * Math.pow(2, 1 - eBias);
+ value += rt * Math.pow(2, 1 - eBias)
}
if (value * c >= 2) {
- e++;
- c /= 2;
+ e++
+ c /= 2
}
if (e + eBias >= eMax) {
- m = 0;
- e = eMax;
+ m = 0
+ e = eMax
} else if (e + eBias >= 1) {
- m = (value * c - 1) * Math.pow(2, mLen);
- e = e + eBias;
+ m = (value * c - 1) * Math.pow(2, mLen)
+ e = e + eBias
+ } else {
+ m = value * Math.pow(2, eBias - 1) * Math.pow(2, mLen)
+ e = 0
+ }
+ }
+
+ for (; mLen >= 8; buffer[offset + i] = m & 0xff, i += d, m /= 256, mLen -= 8) {}
+
+ e = (e << mLen) | m
+ eLen += mLen
+ for (; eLen > 0; buffer[offset + i] = e & 0xff, i += d, e /= 256, eLen -= 8) {}
+
+ buffer[offset + i - d] |= s * 128
+}
+
+},{}],10:[function(require,module,exports){
+
+/**
+ * isArray
+ */
+
+var isArray = Array.isArray;
+
+/**
+ * toString
+ */
+
+var str = Object.prototype.toString;
+
+/**
+ * Whether or not the given `val`
+ * is an array.
+ *
+ * example:
+ *
+ * isArray([]);
+ * // > true
+ * isArray(arguments);
+ * // > false
+ * isArray('');
+ * // > false
+ *
+ * @param {mixed} val
+ * @return {bool}
+ */
+
+module.exports = isArray || function (val) {
+ return !! val && '[object Array]' == str.call(val);
+};
+
+},{}],11:[function(require,module,exports){
+// Copyright Joyent, Inc. and other Node contributors.
+//
+// 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.
+
+function EventEmitter() {
+ this._events = this._events || {};
+ this._maxListeners = this._maxListeners || undefined;
+}
+module.exports = EventEmitter;
+
+// Backwards-compat with node 0.10.x
+EventEmitter.EventEmitter = EventEmitter;
+
+EventEmitter.prototype._events = undefined;
+EventEmitter.prototype._maxListeners = undefined;
+
+// By default EventEmitters will print a warning if more than 10 listeners are
+// added to it. This is a useful default which helps finding memory leaks.
+EventEmitter.defaultMaxListeners = 10;
+
+// Obviously not all Emitters should be limited to 10. This function allows
+// that to be increased. Set to zero for unlimited.
+EventEmitter.prototype.setMaxListeners = function(n) {
+ if (!isNumber(n) || n < 0 || isNaN(n))
+ throw TypeError('n must be a positive number');
+ this._maxListeners = n;
+ return this;
+};
+
+EventEmitter.prototype.emit = function(type) {
+ var er, handler, len, args, i, listeners;
+
+ if (!this._events)
+ this._events = {};
+
+ // If there is no 'error' event listener then throw.
+ if (type === 'error') {
+ if (!this._events.error ||
+ (isObject(this._events.error) && !this._events.error.length)) {
+ er = arguments[1];
+ if (er instanceof Error) {
+ throw er; // Unhandled 'error' event
+ }
+ throw TypeError('Uncaught, unspecified "error" event.');
+ }
+ }
+
+ handler = this._events[type];
+
+ if (isUndefined(handler))
+ return false;
+
+ if (isFunction(handler)) {
+ switch (arguments.length) {
+ // fast cases
+ case 1:
+ handler.call(this);
+ break;
+ case 2:
+ handler.call(this, arguments[1]);
+ break;
+ case 3:
+ handler.call(this, arguments[1], arguments[2]);
+ break;
+ // slower
+ default:
+ len = arguments.length;
+ args = new Array(len - 1);
+ for (i = 1; i < len; i++)
+ args[i - 1] = arguments[i];
+ handler.apply(this, args);
+ }
+ } else if (isObject(handler)) {
+ len = arguments.length;
+ args = new Array(len - 1);
+ for (i = 1; i < len; i++)
+ args[i - 1] = arguments[i];
+
+ listeners = handler.slice();
+ len = listeners.length;
+ for (i = 0; i < len; i++)
+ listeners[i].apply(this, args);
+ }
+
+ return true;
+};
+
+EventEmitter.prototype.addListener = function(type, listener) {
+ var m;
+
+ if (!isFunction(listener))
+ throw TypeError('listener must be a function');
+
+ if (!this._events)
+ this._events = {};
+
+ // To avoid recursion in the case that type === "newListener"! Before
+ // adding it to the listeners, first emit "newListener".
+ if (this._events.newListener)
+ this.emit('newListener', type,
+ isFunction(listener.listener) ?
+ listener.listener : listener);
+
+ if (!this._events[type])
+ // Optimize the case of one listener. Don't need the extra array object.
+ this._events[type] = listener;
+ else if (isObject(this._events[type]))
+ // If we've already got an array, just append.
+ this._events[type].push(listener);
+ else
+ // Adding the second element, need to change to array.
+ this._events[type] = [this._events[type], listener];
+
+ // Check for listener leak
+ if (isObject(this._events[type]) && !this._events[type].warned) {
+ var m;
+ if (!isUndefined(this._maxListeners)) {
+ m = this._maxListeners;
+ } else {
+ m = EventEmitter.defaultMaxListeners;
+ }
+
+ if (m && m > 0 && this._events[type].length > m) {
+ this._events[type].warned = true;
+ console.error('(node) warning: possible EventEmitter memory ' +
+ 'leak detected. %d listeners added. ' +
+ 'Use emitter.setMaxListeners() to increase limit.',
+ this._events[type].length);
+ if (typeof console.trace === 'function') {
+ // not supported in IE 10
+ console.trace();
+ }
+ }
+ }
+
+ return this;
+};
+
+EventEmitter.prototype.on = EventEmitter.prototype.addListener;
+
+EventEmitter.prototype.once = function(type, listener) {
+ if (!isFunction(listener))
+ throw TypeError('listener must be a function');
+
+ var fired = false;
+
+ function g() {
+ this.removeListener(type, g);
+
+ if (!fired) {
+ fired = true;
+ listener.apply(this, arguments);
+ }
+ }
+
+ g.listener = listener;
+ this.on(type, g);
+
+ return this;
+};
+
+// emits a 'removeListener' event iff the listener was removed
+EventEmitter.prototype.removeListener = function(type, listener) {
+ var list, position, length, i;
+
+ if (!isFunction(listener))
+ throw TypeError('listener must be a function');
+
+ if (!this._events || !this._events[type])
+ return this;
+
+ list = this._events[type];
+ length = list.length;
+ position = -1;
+
+ if (list === listener ||
+ (isFunction(list.listener) && list.listener === listener)) {
+ delete this._events[type];
+ if (this._events.removeListener)
+ this.emit('removeListener', type, listener);
+
+ } else if (isObject(list)) {
+ for (i = length; i-- > 0;) {
+ if (list[i] === listener ||
+ (list[i].listener && list[i].listener === listener)) {
+ position = i;
+ break;
+ }
+ }
+
+ if (position < 0)
+ return this;
+
+ if (list.length === 1) {
+ list.length = 0;
+ delete this._events[type];
} else {
- m = value * Math.pow(2, eBias - 1) * Math.pow(2, mLen);
- e = 0;
+ list.splice(position, 1);
+ }
+
+ if (this._events.removeListener)
+ this.emit('removeListener', type, listener);
+ }
+
+ return this;
+};
+
+EventEmitter.prototype.removeAllListeners = function(type) {
+ var key, listeners;
+
+ if (!this._events)
+ return this;
+
+ // not listening for removeListener, no need to emit
+ if (!this._events.removeListener) {
+ if (arguments.length === 0)
+ this._events = {};
+ else if (this._events[type])
+ delete this._events[type];
+ return this;
+ }
+
+ // emit removeListener for all listeners on all events
+ if (arguments.length === 0) {
+ for (key in this._events) {
+ if (key === 'removeListener') continue;
+ this.removeAllListeners(key);
}
+ this.removeAllListeners('removeListener');
+ this._events = {};
+ return this;
+ }
+
+ listeners = this._events[type];
+
+ if (isFunction(listeners)) {
+ this.removeListener(type, listeners);
+ } else {
+ // LIFO order
+ while (listeners.length)
+ this.removeListener(type, listeners[listeners.length - 1]);
}
+ delete this._events[type];
- for (; mLen >= 8; buffer[offset + i] = m & 0xff, i += d, m /= 256, mLen -= 8){};
+ return this;
+};
- e = (e << mLen) | m;
- eLen += mLen;
- for (; eLen > 0; buffer[offset + i] = e & 0xff, i += d, e /= 256, eLen -= 8){};
+EventEmitter.prototype.listeners = function(type) {
+ var ret;
+ if (!this._events || !this._events[type])
+ ret = [];
+ else if (isFunction(this._events[type]))
+ ret = [this._events[type]];
+ else
+ ret = this._events[type].slice();
+ return ret;
+};
- buffer[offset + i - d] |= s * 128;
+EventEmitter.listenerCount = function(emitter, type) {
+ var ret;
+ if (!emitter._events || !emitter._events[type])
+ ret = 0;
+ else if (isFunction(emitter._events[type]))
+ ret = 1;
+ else
+ ret = emitter._events[type].length;
+ return ret;
};
-},{}],11:[function(_dereq_,module,exports){
+function isFunction(arg) {
+ return typeof arg === 'function';
+}
+
+function isNumber(arg) {
+ return typeof arg === 'number';
+}
+
+function isObject(arg) {
+ return typeof arg === 'object' && arg !== null;
+}
+
+function isUndefined(arg) {
+ return arg === void 0;
+}
+
+},{}],12:[function(require,module,exports){
if (typeof Object.create === 'function') {
// implementation from standard node.js 'util' module
module.exports = function inherits(ctor, superCtor) {
}
}
-},{}],12:[function(_dereq_,module,exports){
+},{}],13:[function(require,module,exports){
+module.exports = Array.isArray || function (arr) {
+ return Object.prototype.toString.call(arr) == '[object Array]';
+};
+
+},{}],14:[function(require,module,exports){
// shim for using process in browser
var process = module.exports = {};
+var queue = [];
+var draining = false;
+var currentQueue;
+var queueIndex = -1;
+
+function cleanUpNextTick() {
+ draining = false;
+ if (currentQueue.length) {
+ queue = currentQueue.concat(queue);
+ } else {
+ queueIndex = -1;
+ }
+ if (queue.length) {
+ drainQueue();
+ }
+}
-process.nextTick = (function () {
- var canSetImmediate = typeof window !== 'undefined'
- && window.setImmediate;
- var canPost = typeof window !== 'undefined'
- && window.postMessage && window.addEventListener
- ;
-
- if (canSetImmediate) {
- return function (f) { return window.setImmediate(f) };
- }
-
- if (canPost) {
- var queue = [];
- window.addEventListener('message', function (ev) {
- var source = ev.source;
- if ((source === window || source === null) && ev.data === 'process-tick') {
- ev.stopPropagation();
- if (queue.length > 0) {
- var fn = queue.shift();
- fn();
- }
- }
- }, true);
-
- return function nextTick(fn) {
- queue.push(fn);
- window.postMessage('process-tick', '*');
- };
+function drainQueue() {
+ if (draining) {
+ return;
}
+ var timeout = setTimeout(cleanUpNextTick);
+ draining = true;
+
+ var len = queue.length;
+ while(len) {
+ currentQueue = queue;
+ queue = [];
+ while (++queueIndex < len) {
+ currentQueue[queueIndex].run();
+ }
+ queueIndex = -1;
+ len = queue.length;
+ }
+ currentQueue = null;
+ draining = false;
+ clearTimeout(timeout);
+}
- return function nextTick(fn) {
- setTimeout(fn, 0);
- };
-})();
+process.nextTick = function (fun) {
+ var args = new Array(arguments.length - 1);
+ if (arguments.length > 1) {
+ for (var i = 1; i < arguments.length; i++) {
+ args[i - 1] = arguments[i];
+ }
+ }
+ queue.push(new Item(fun, args));
+ if (queue.length === 1 && !draining) {
+ setTimeout(drainQueue, 0);
+ }
+};
+// v8 likes predictible objects
+function Item(fun, array) {
+ this.fun = fun;
+ this.array = array;
+}
+Item.prototype.run = function () {
+ this.fun.apply(null, this.array);
+};
process.title = 'browser';
process.browser = true;
process.env = {};
process.argv = [];
+process.version = ''; // empty string to avoid regexp issues
+process.versions = {};
function noop() {}
process.binding = function (name) {
throw new Error('process.binding is not supported');
-}
+};
// TODO(shtylman)
process.cwd = function () { return '/' };
process.chdir = function (dir) {
throw new Error('process.chdir is not supported');
};
+process.umask = function() { return 0; };
-},{}],13:[function(_dereq_,module,exports){
-module.exports=_dereq_(5)
-},{}],14:[function(_dereq_,module,exports){
-module.exports=_dereq_(6)
-},{"./support/isBuffer":13,"FWaASH":12,"inherits":11}],15:[function(_dereq_,module,exports){
-(function (Buffer){
-// Base58 encoding/decoding
-// Originally written by Mike Hearn for BitcoinJ
-// Copyright (c) 2011 Google Inc
-// Ported to JavaScript by Stefan Thomas
-// Merged Buffer refactorings from base58-native by Stephen Pair
-// Copyright (c) 2013 BitPay Inc
-
-var assert = _dereq_('assert')
-var BigInteger = _dereq_('bigi')
-
-var ALPHABET = '123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz'
-var ALPHABET_BUF = new Buffer(ALPHABET, 'ascii')
-var ALPHABET_MAP = {}
-for(var i = 0; i < ALPHABET.length; i++) {
- ALPHABET_MAP[ALPHABET.charAt(i)] = BigInteger.valueOf(i)
-}
-var BASE = new BigInteger('58')
-
-function encode(buffer) {
- var bi = BigInteger.fromBuffer(buffer)
- var result = new Buffer(buffer.length << 1)
+},{}],15:[function(require,module,exports){
+module.exports = require("./lib/_stream_duplex.js")
- var i = result.length - 1
- while (bi.signum() > 0) {
- var remainder = bi.mod(BASE)
- bi = bi.divide(BASE)
+},{"./lib/_stream_duplex.js":16}],16:[function(require,module,exports){
+(function (process){
+// Copyright Joyent, Inc. and other Node contributors.
+//
+// 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.
- result[i] = ALPHABET_BUF[remainder.intValue()]
- i--
- }
+// a duplex stream is just a stream that is both readable and writable.
+// Since JS doesn't have multiple prototypal inheritance, this class
+// prototypally inherits from Readable, and then parasitically from
+// Writable.
- // deal with leading zeros
- var j = 0
- while (buffer[j] === 0) {
- result[i] = ALPHABET_BUF[0]
- j++
- i--
- }
+module.exports = Duplex;
- return result.slice(i + 1, result.length).toString('ascii')
+/*<replacement>*/
+var objectKeys = Object.keys || function (obj) {
+ var keys = [];
+ for (var key in obj) keys.push(key);
+ return keys;
}
+/*</replacement>*/
-function decode(string) {
- if (string.length === 0) return new Buffer(0)
- var num = BigInteger.ZERO
+/*<replacement>*/
+var util = require('core-util-is');
+util.inherits = require('inherits');
+/*</replacement>*/
- for (var i = 0; i < string.length; i++) {
- num = num.multiply(BASE)
+var Readable = require('./_stream_readable');
+var Writable = require('./_stream_writable');
- var figure = ALPHABET_MAP[string.charAt(i)]
- assert.notEqual(figure, undefined, 'Non-base58 character')
+util.inherits(Duplex, Readable);
- num = num.add(figure)
- }
+forEach(objectKeys(Writable.prototype), function(method) {
+ if (!Duplex.prototype[method])
+ Duplex.prototype[method] = Writable.prototype[method];
+});
- // deal with leading zeros
- var j = 0
- while ((j < string.length) && (string[j] === ALPHABET[0])) {
- j++
- }
+function Duplex(options) {
+ if (!(this instanceof Duplex))
+ return new Duplex(options);
- var buffer = num.toBuffer()
- var leadingZeros = new Buffer(j)
- leadingZeros.fill(0)
+ Readable.call(this, options);
+ Writable.call(this, options);
- return Buffer.concat([leadingZeros, buffer])
-}
+ if (options && options.readable === false)
+ this.readable = false;
-module.exports = {
- encode: encode,
- decode: decode
-}
+ if (options && options.writable === false)
+ this.writable = false;
-}).call(this,_dereq_("buffer").Buffer)
-},{"assert":4,"bigi":3,"buffer":8}],16:[function(_dereq_,module,exports){
-(function (Buffer){
-var createHash = _dereq_('sha.js')
-
-var md5 = toConstructor(_dereq_('./md5'))
-var rmd160 = toConstructor(_dereq_('ripemd160'))
-
-function toConstructor (fn) {
- return function () {
- var buffers = []
- var m= {
- update: function (data, enc) {
- if(!Buffer.isBuffer(data)) data = new Buffer(data, enc)
- buffers.push(data)
- return this
- },
- digest: function (enc) {
- var buf = Buffer.concat(buffers)
- var r = fn(buf)
- buffers = null
- return enc ? r.toString(enc) : r
- }
- }
- return m
- }
-}
+ this.allowHalfOpen = true;
+ if (options && options.allowHalfOpen === false)
+ this.allowHalfOpen = false;
-module.exports = function (alg) {
- if('md5' === alg) return new md5()
- if('rmd160' === alg) return new rmd160()
- return createHash(alg)
+ this.once('end', onend);
}
-}).call(this,_dereq_("buffer").Buffer)
-},{"./md5":20,"buffer":8,"ripemd160":21,"sha.js":23}],17:[function(_dereq_,module,exports){
-(function (Buffer){
-var createHash = _dereq_('./create-hash')
-
-var blocksize = 64
-var zeroBuffer = new Buffer(blocksize); zeroBuffer.fill(0)
-
-module.exports = Hmac
-
-function Hmac (alg, key) {
- if(!(this instanceof Hmac)) return new Hmac(alg, key)
- this._opad = opad
- this._alg = alg
+// the no-half-open enforcer
+function onend() {
+ // if we allow half-open state, or if the writable side ended,
+ // then we're ok.
+ if (this.allowHalfOpen || this._writableState.ended)
+ return;
- key = this._key = !Buffer.isBuffer(key) ? new Buffer(key) : key
+ // no more data can be written.
+ // But allow more writes to happen in this tick.
+ process.nextTick(this.end.bind(this));
+}
- if(key.length > blocksize) {
- key = createHash(alg).update(key).digest()
- } else if(key.length < blocksize) {
- key = Buffer.concat([key, zeroBuffer], blocksize)
+function forEach (xs, f) {
+ for (var i = 0, l = xs.length; i < l; i++) {
+ f(xs[i], i);
}
+}
- var ipad = this._ipad = new Buffer(blocksize)
- var opad = this._opad = new Buffer(blocksize)
-
- for(var i = 0; i < blocksize; i++) {
- ipad[i] = key[i] ^ 0x36
- opad[i] = key[i] ^ 0x5C
- }
+}).call(this,require('_process'))
+},{"./_stream_readable":18,"./_stream_writable":20,"_process":14,"core-util-is":21,"inherits":12}],17:[function(require,module,exports){
+// Copyright Joyent, Inc. and other Node contributors.
+//
+// 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.
- this._hash = createHash(alg).update(ipad)
-}
+// a passthrough stream.
+// basically just the most minimal sort of Transform stream.
+// Every written chunk gets output as-is.
-Hmac.prototype.update = function (data, enc) {
- this._hash.update(data, enc)
- return this
-}
+module.exports = PassThrough;
-Hmac.prototype.digest = function (enc) {
- var h = this._hash.digest()
- return createHash(this._alg).update(this._opad).update(h).digest(enc)
-}
+var Transform = require('./_stream_transform');
+/*<replacement>*/
+var util = require('core-util-is');
+util.inherits = require('inherits');
+/*</replacement>*/
-}).call(this,_dereq_("buffer").Buffer)
-},{"./create-hash":16,"buffer":8}],18:[function(_dereq_,module,exports){
-(function (Buffer){
-var intSize = 4;
-var zeroBuffer = new Buffer(intSize); zeroBuffer.fill(0);
-var chrsz = 8;
+util.inherits(PassThrough, Transform);
-function toArray(buf, bigEndian) {
- if ((buf.length % intSize) !== 0) {
- var len = buf.length + (intSize - (buf.length % intSize));
- buf = Buffer.concat([buf, zeroBuffer], len);
- }
+function PassThrough(options) {
+ if (!(this instanceof PassThrough))
+ return new PassThrough(options);
- var arr = [];
- var fn = bigEndian ? buf.readInt32BE : buf.readInt32LE;
- for (var i = 0; i < buf.length; i += intSize) {
- arr.push(fn.call(buf, i));
- }
- return arr;
+ Transform.call(this, options);
}
-function toBuffer(arr, size, bigEndian) {
- var buf = new Buffer(size);
- var fn = bigEndian ? buf.writeInt32BE : buf.writeInt32LE;
- for (var i = 0; i < arr.length; i++) {
- fn.call(buf, arr[i], i * 4, true);
- }
- return buf;
-}
+PassThrough.prototype._transform = function(chunk, encoding, cb) {
+ cb(null, chunk);
+};
-function hash(buf, fn, hashSize, bigEndian) {
- if (!Buffer.isBuffer(buf)) buf = new Buffer(buf);
- var arr = fn(toArray(buf, bigEndian), buf.length * chrsz);
- return toBuffer(arr, hashSize, bigEndian);
-}
+},{"./_stream_transform":19,"core-util-is":21,"inherits":12}],18:[function(require,module,exports){
+(function (process){
+// Copyright Joyent, Inc. and other Node contributors.
+//
+// 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.
-module.exports = { hash: hash };
+module.exports = Readable;
-}).call(this,_dereq_("buffer").Buffer)
-},{"buffer":8}],19:[function(_dereq_,module,exports){
-(function (Buffer){
-var rng = _dereq_('./rng')
+/*<replacement>*/
+var isArray = require('isarray');
+/*</replacement>*/
-function error () {
- var m = [].slice.call(arguments).join(' ')
- throw new Error([
- m,
- 'we accept pull requests',
- 'http://github.com/dominictarr/crypto-browserify'
- ].join('\n'))
-}
-exports.createHash = _dereq_('./create-hash')
+/*<replacement>*/
+var Buffer = require('buffer').Buffer;
+/*</replacement>*/
-exports.createHmac = _dereq_('./create-hmac')
+Readable.ReadableState = ReadableState;
-exports.randomBytes = function(size, callback) {
- if (callback && callback.call) {
- try {
- callback.call(this, undefined, new Buffer(rng(size)))
- } catch (err) { callback(err) }
- } else {
- return new Buffer(rng(size))
- }
-}
+var EE = require('events').EventEmitter;
-function each(a, f) {
- for(var i in a)
- f(a[i], i)
-}
+/*<replacement>*/
+if (!EE.listenerCount) EE.listenerCount = function(emitter, type) {
+ return emitter.listeners(type).length;
+};
+/*</replacement>*/
+
+var Stream = require('stream');
-exports.getHashes = function () {
- return ['sha1', 'sha256', 'md5', 'rmd160']
+/*<replacement>*/
+var util = require('core-util-is');
+util.inherits = require('inherits');
+/*</replacement>*/
+var StringDecoder;
+
+
+/*<replacement>*/
+var debug = require('util');
+if (debug && debug.debuglog) {
+ debug = debug.debuglog('stream');
+} else {
+ debug = function () {};
}
+/*</replacement>*/
-var p = _dereq_('./pbkdf2')(exports.createHmac)
-exports.pbkdf2 = p.pbkdf2
-exports.pbkdf2Sync = p.pbkdf2Sync
+util.inherits(Readable, Stream);
-// the least I can do is make error messages for the rest of the node.js/crypto api.
-each(['createCredentials'
-, 'createCipher'
-, 'createCipheriv'
-, 'createDecipher'
-, 'createDecipheriv'
-, 'createSign'
-, 'createVerify'
-, 'createDiffieHellman'
-], function (name) {
- exports[name] = function () {
- error('sorry,', name, 'is not implemented yet')
- }
-})
+function ReadableState(options, stream) {
+ var Duplex = require('./_stream_duplex');
-}).call(this,_dereq_("buffer").Buffer)
-},{"./create-hash":16,"./create-hmac":17,"./pbkdf2":27,"./rng":28,"buffer":8}],20:[function(_dereq_,module,exports){
-/*
- * A JavaScript implementation of the RSA Data Security, Inc. MD5 Message
- * Digest Algorithm, as defined in RFC 1321.
- * Version 2.1 Copyright (C) Paul Johnston 1999 - 2002.
- * Other contributors: Greg Holt, Andrew Kepert, Ydnar, Lostinet
- * Distributed under the BSD License
- * See http://pajhome.org.uk/crypt/md5 for more info.
- */
+ options = options || {};
-var helpers = _dereq_('./helpers');
+ // the point at which it stops calling _read() to fill the buffer
+ // Note: 0 is a valid value, means "don't call _read preemptively ever"
+ var hwm = options.highWaterMark;
+ var defaultHwm = options.objectMode ? 16 : 16 * 1024;
+ this.highWaterMark = (hwm || hwm === 0) ? hwm : defaultHwm;
-/*
- * Calculate the MD5 of an array of little-endian words, and a bit length
- */
-function core_md5(x, len)
-{
- /* append padding */
- x[len >> 5] |= 0x80 << ((len) % 32);
- x[(((len + 64) >>> 9) << 4) + 14] = len;
+ // cast to ints.
+ this.highWaterMark = ~~this.highWaterMark;
- var a = 1732584193;
- var b = -271733879;
- var c = -1732584194;
- var d = 271733878;
+ this.buffer = [];
+ this.length = 0;
+ this.pipes = null;
+ this.pipesCount = 0;
+ this.flowing = null;
+ this.ended = false;
+ this.endEmitted = false;
+ this.reading = false;
- for(var i = 0; i < x.length; i += 16)
- {
- var olda = a;
- var oldb = b;
- var oldc = c;
- var oldd = d;
+ // a flag to be able to tell if the onwrite cb is called immediately,
+ // or on a later tick. We set this to true at first, because any
+ // actions that shouldn't happen until "later" should generally also
+ // not happen before the first write call.
+ this.sync = true;
- a = md5_ff(a, b, c, d, x[i+ 0], 7 , -680876936);
- d = md5_ff(d, a, b, c, x[i+ 1], 12, -389564586);
- c = md5_ff(c, d, a, b, x[i+ 2], 17, 606105819);
- b = md5_ff(b, c, d, a, x[i+ 3], 22, -1044525330);
- a = md5_ff(a, b, c, d, x[i+ 4], 7 , -176418897);
- d = md5_ff(d, a, b, c, x[i+ 5], 12, 1200080426);
- c = md5_ff(c, d, a, b, x[i+ 6], 17, -1473231341);
- b = md5_ff(b, c, d, a, x[i+ 7], 22, -45705983);
- a = md5_ff(a, b, c, d, x[i+ 8], 7 , 1770035416);
- d = md5_ff(d, a, b, c, x[i+ 9], 12, -1958414417);
- c = md5_ff(c, d, a, b, x[i+10], 17, -42063);
- b = md5_ff(b, c, d, a, x[i+11], 22, -1990404162);
- a = md5_ff(a, b, c, d, x[i+12], 7 , 1804603682);
- d = md5_ff(d, a, b, c, x[i+13], 12, -40341101);
- c = md5_ff(c, d, a, b, x[i+14], 17, -1502002290);
- b = md5_ff(b, c, d, a, x[i+15], 22, 1236535329);
+ // whenever we return null, then we set a flag to say
+ // that we're awaiting a 'readable' event emission.
+ this.needReadable = false;
+ this.emittedReadable = false;
+ this.readableListening = false;
- a = md5_gg(a, b, c, d, x[i+ 1], 5 , -165796510);
- d = md5_gg(d, a, b, c, x[i+ 6], 9 , -1069501632);
- c = md5_gg(c, d, a, b, x[i+11], 14, 643717713);
- b = md5_gg(b, c, d, a, x[i+ 0], 20, -373897302);
- a = md5_gg(a, b, c, d, x[i+ 5], 5 , -701558691);
- d = md5_gg(d, a, b, c, x[i+10], 9 , 38016083);
- c = md5_gg(c, d, a, b, x[i+15], 14, -660478335);
- b = md5_gg(b, c, d, a, x[i+ 4], 20, -405537848);
- a = md5_gg(a, b, c, d, x[i+ 9], 5 , 568446438);
- d = md5_gg(d, a, b, c, x[i+14], 9 , -1019803690);
- c = md5_gg(c, d, a, b, x[i+ 3], 14, -187363961);
- b = md5_gg(b, c, d, a, x[i+ 8], 20, 1163531501);
- a = md5_gg(a, b, c, d, x[i+13], 5 , -1444681467);
- d = md5_gg(d, a, b, c, x[i+ 2], 9 , -51403784);
- c = md5_gg(c, d, a, b, x[i+ 7], 14, 1735328473);
- b = md5_gg(b, c, d, a, x[i+12], 20, -1926607734);
- a = md5_hh(a, b, c, d, x[i+ 5], 4 , -378558);
- d = md5_hh(d, a, b, c, x[i+ 8], 11, -2022574463);
- c = md5_hh(c, d, a, b, x[i+11], 16, 1839030562);
- b = md5_hh(b, c, d, a, x[i+14], 23, -35309556);
- a = md5_hh(a, b, c, d, x[i+ 1], 4 , -1530992060);
- d = md5_hh(d, a, b, c, x[i+ 4], 11, 1272893353);
- c = md5_hh(c, d, a, b, x[i+ 7], 16, -155497632);
- b = md5_hh(b, c, d, a, x[i+10], 23, -1094730640);
- a = md5_hh(a, b, c, d, x[i+13], 4 , 681279174);
- d = md5_hh(d, a, b, c, x[i+ 0], 11, -358537222);
- c = md5_hh(c, d, a, b, x[i+ 3], 16, -722521979);
- b = md5_hh(b, c, d, a, x[i+ 6], 23, 76029189);
- a = md5_hh(a, b, c, d, x[i+ 9], 4 , -640364487);
- d = md5_hh(d, a, b, c, x[i+12], 11, -421815835);
- c = md5_hh(c, d, a, b, x[i+15], 16, 530742520);
- b = md5_hh(b, c, d, a, x[i+ 2], 23, -995338651);
+ // object stream flag. Used to make read(n) ignore n and to
+ // make all the buffer merging and length checks go away
+ this.objectMode = !!options.objectMode;
- a = md5_ii(a, b, c, d, x[i+ 0], 6 , -198630844);
- d = md5_ii(d, a, b, c, x[i+ 7], 10, 1126891415);
- c = md5_ii(c, d, a, b, x[i+14], 15, -1416354905);
- b = md5_ii(b, c, d, a, x[i+ 5], 21, -57434055);
- a = md5_ii(a, b, c, d, x[i+12], 6 , 1700485571);
- d = md5_ii(d, a, b, c, x[i+ 3], 10, -1894986606);
- c = md5_ii(c, d, a, b, x[i+10], 15, -1051523);
- b = md5_ii(b, c, d, a, x[i+ 1], 21, -2054922799);
- a = md5_ii(a, b, c, d, x[i+ 8], 6 , 1873313359);
- d = md5_ii(d, a, b, c, x[i+15], 10, -30611744);
- c = md5_ii(c, d, a, b, x[i+ 6], 15, -1560198380);
- b = md5_ii(b, c, d, a, x[i+13], 21, 1309151649);
- a = md5_ii(a, b, c, d, x[i+ 4], 6 , -145523070);
- d = md5_ii(d, a, b, c, x[i+11], 10, -1120210379);
- c = md5_ii(c, d, a, b, x[i+ 2], 15, 718787259);
- b = md5_ii(b, c, d, a, x[i+ 9], 21, -343485551);
+ if (stream instanceof Duplex)
+ this.objectMode = this.objectMode || !!options.readableObjectMode;
- a = safe_add(a, olda);
- b = safe_add(b, oldb);
- c = safe_add(c, oldc);
- d = safe_add(d, oldd);
- }
- return Array(a, b, c, d);
+ // Crypto is kind of old and crusty. Historically, its default string
+ // encoding is 'binary' so we have to make this configurable.
+ // Everything else in the universe uses 'utf8', though.
+ this.defaultEncoding = options.defaultEncoding || 'utf8';
-}
+ // when piping, we only care about 'readable' events that happen
+ // after read()ing all the bytes and not getting any pushback.
+ this.ranOut = false;
-/*
- * These functions implement the four basic operations the algorithm uses.
- */
-function md5_cmn(q, a, b, x, s, t)
-{
- return safe_add(bit_rol(safe_add(safe_add(a, q), safe_add(x, t)), s),b);
-}
-function md5_ff(a, b, c, d, x, s, t)
-{
- return md5_cmn((b & c) | ((~b) & d), a, b, x, s, t);
-}
-function md5_gg(a, b, c, d, x, s, t)
-{
- return md5_cmn((b & d) | (c & (~d)), a, b, x, s, t);
-}
-function md5_hh(a, b, c, d, x, s, t)
-{
- return md5_cmn(b ^ c ^ d, a, b, x, s, t);
-}
-function md5_ii(a, b, c, d, x, s, t)
-{
- return md5_cmn(c ^ (b | (~d)), a, b, x, s, t);
-}
+ // the number of writers that are awaiting a drain event in .pipe()s
+ this.awaitDrain = 0;
-/*
- * Add integers, wrapping at 2^32. This uses 16-bit operations internally
- * to work around bugs in some JS interpreters.
- */
-function safe_add(x, y)
-{
- var lsw = (x & 0xFFFF) + (y & 0xFFFF);
- var msw = (x >> 16) + (y >> 16) + (lsw >> 16);
- return (msw << 16) | (lsw & 0xFFFF);
-}
+ // if true, a maybeReadMore has been scheduled
+ this.readingMore = false;
-/*
- * Bitwise rotate a 32-bit number to the left.
- */
-function bit_rol(num, cnt)
-{
- return (num << cnt) | (num >>> (32 - cnt));
+ this.decoder = null;
+ this.encoding = null;
+ if (options.encoding) {
+ if (!StringDecoder)
+ StringDecoder = require('string_decoder/').StringDecoder;
+ this.decoder = new StringDecoder(options.encoding);
+ this.encoding = options.encoding;
+ }
}
-module.exports = function md5(buf) {
- return helpers.hash(buf, core_md5, 16);
-};
+function Readable(options) {
+ var Duplex = require('./_stream_duplex');
-},{"./helpers":18}],21:[function(_dereq_,module,exports){
-(function (Buffer){
+ if (!(this instanceof Readable))
+ return new Readable(options);
-module.exports = ripemd160
+ this._readableState = new ReadableState(options, this);
+ // legacy
+ this.readable = true;
+ Stream.call(this);
+}
-/*
-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.
+// Manually shove something into the read() buffer.
+// This returns true if the highWaterMark has not been hit yet,
+// similar to how Writable.write() returns true if you should
+// write() some more.
+Readable.prototype.push = function(chunk, encoding) {
+ var state = this._readableState;
-Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
+ if (util.isString(chunk) && !state.objectMode) {
+ encoding = encoding || state.defaultEncoding;
+ if (encoding !== state.encoding) {
+ chunk = new Buffer(chunk, encoding);
+ encoding = '';
+ }
+ }
- - 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.
+ return readableAddChunk(this, state, chunk, encoding, false);
+};
-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.
-*/
+// Unshift should *always* be something directly out of read()
+Readable.prototype.unshift = function(chunk) {
+ var state = this._readableState;
+ return readableAddChunk(this, state, chunk, '', true);
+};
-// 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 ];
+function readableAddChunk(stream, state, chunk, encoding, addToFront) {
+ var er = chunkInvalid(state, chunk);
+ if (er) {
+ stream.emit('error', er);
+ } else if (util.isNullOrUndefined(chunk)) {
+ state.reading = false;
+ if (!state.ended)
+ onEofChunk(stream, state);
+ } else if (state.objectMode || chunk && chunk.length > 0) {
+ if (state.ended && !addToFront) {
+ var e = new Error('stream.push() after EOF');
+ stream.emit('error', e);
+ } else if (state.endEmitted && addToFront) {
+ var e = new Error('stream.unshift() after end event');
+ stream.emit('error', e);
+ } else {
+ if (state.decoder && !addToFront && !encoding)
+ chunk = state.decoder.write(chunk);
-var hl = [ 0x00000000, 0x5A827999, 0x6ED9EBA1, 0x8F1BBCDC, 0xA953FD4E];
-var hr = [ 0x50A28BE6, 0x5C4DD124, 0x6D703EF3, 0x7A6D76E9, 0x00000000];
+ if (!addToFront)
+ state.reading = false;
-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);
+ // if we want the data now, just emit it.
+ if (state.flowing && state.length === 0 && !state.sync) {
+ stream.emit('data', chunk);
+ stream.read(0);
+ } else {
+ // update the buffer info.
+ state.length += state.objectMode ? 1 : chunk.length;
+ if (addToFront)
+ state.buffer.unshift(chunk);
+ else
+ state.buffer.push(chunk);
+
+ if (state.needReadable)
+ emitReadable(stream);
+ }
+
+ maybeReadMore(stream, state);
+ }
+ } else if (!addToFront) {
+ state.reading = false;
}
- return words;
+
+ return needMoreData(state);
+}
+
+
+
+// if it's past the high water mark, we can push in some more.
+// Also, if we have no data yet, we can stand some
+// more bytes. This is to work around cases where hwm=0,
+// such as the repl. Also, if the push() triggered a
+// readable event, and the user called read(largeNumber) such that
+// needReadable was set, then we ought to push more, so that another
+// 'readable' event will be triggered.
+function needMoreData(state) {
+ return !state.ended &&
+ (state.needReadable ||
+ state.length < state.highWaterMark ||
+ state.length === 0);
+}
+
+// backwards compatibility.
+Readable.prototype.setEncoding = function(enc) {
+ if (!StringDecoder)
+ StringDecoder = require('string_decoder/').StringDecoder;
+ this._readableState.decoder = new StringDecoder(enc);
+ this._readableState.encoding = enc;
+ return this;
};
-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);
+// Don't raise the hwm > 128MB
+var MAX_HWM = 0x800000;
+function roundUpToNextPowerOf2(n) {
+ if (n >= MAX_HWM) {
+ n = MAX_HWM;
+ } else {
+ // Get the next highest power of 2
+ n--;
+ for (var p = 1; p < 32; p <<= 1) n |= n >> p;
+ n++;
}
- return bytes;
-};
+ return n;
+}
-var processBlock = function (H, M, offset) {
+function howMuchToRead(n, state) {
+ if (state.length === 0 && state.ended)
+ return 0;
- // Swap endian
- for (var i = 0; i < 16; i++) {
- var offset_i = offset + i;
- var M_offset_i = M[offset_i];
+ if (state.objectMode)
+ return n === 0 ? 0 : 1;
- // Swap
- M[offset_i] = (
- (((M_offset_i << 8) | (M_offset_i >>> 24)) & 0x00ff00ff) |
- (((M_offset_i << 24) | (M_offset_i >>> 8)) & 0xff00ff00)
- );
+ if (isNaN(n) || util.isNull(n)) {
+ // only flow one buffer at a time
+ if (state.flowing && state.buffer.length)
+ return state.buffer[0].length;
+ else
+ return state.length;
}
- // 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;
-};
+ if (n <= 0)
+ return 0;
-function f1(x, y, z) {
- return ((x) ^ (y) ^ (z));
-}
+ // If we're asking for more than the target buffer level,
+ // then raise the water mark. Bump up to the next highest
+ // power of 2, to prevent increasing it excessively in tiny
+ // amounts.
+ if (n > state.highWaterMark)
+ state.highWaterMark = roundUpToNextPowerOf2(n);
-function f2(x, y, z) {
- return (((x)&(y)) | ((~x)&(z)));
-}
+ // don't have that much. return null, unless we've ended.
+ if (n > state.length) {
+ if (!state.ended) {
+ state.needReadable = true;
+ return 0;
+ } else
+ return state.length;
+ }
-function f3(x, y, z) {
- return (((x) | (~(y))) ^ (z));
+ return n;
}
-function f4(x, y, z) {
- return (((x) & (z)) | ((y)&(~(z))));
-}
+// you can override either this method, or the async _read(n) below.
+Readable.prototype.read = function(n) {
+ debug('read', n);
+ var state = this._readableState;
+ var nOrig = n;
-function f5(x, y, z) {
- return ((x) ^ ((y) |(~(z))));
-}
+ if (!util.isNumber(n) || n > 0)
+ state.emittedReadable = false;
-function rotl(x,n) {
- return (x<<n) | (x>>>(32-n));
-}
+ // if we're doing read(0) to trigger a readable event, but we
+ // already have a bunch of data in the buffer, then just trigger
+ // the 'readable' event and move on.
+ if (n === 0 &&
+ state.needReadable &&
+ (state.length >= state.highWaterMark || state.ended)) {
+ debug('read: emitReadable', state.length, state.ended);
+ if (state.length === 0 && state.ended)
+ endReadable(this);
+ else
+ emitReadable(this);
+ return null;
+ }
+
+ n = howMuchToRead(n, state);
+
+ // if we've ended, and we're now clear, then finish it up.
+ if (n === 0 && state.ended) {
+ if (state.length === 0)
+ endReadable(this);
+ return null;
+ }
+
+ // All the actual chunk generation logic needs to be
+ // *below* the call to _read. The reason is that in certain
+ // synthetic stream cases, such as passthrough streams, _read
+ // may be a completely synchronous operation which may change
+ // the state of the read buffer, providing enough data when
+ // before there was *not* enough.
+ //
+ // So, the steps are:
+ // 1. Figure out what the state of things will be after we do
+ // a read from the buffer.
+ //
+ // 2. If that resulting state will trigger a _read, then call _read.
+ // Note that this may be asynchronous, or synchronous. Yes, it is
+ // deeply ugly to write APIs this way, but that still doesn't mean
+ // that the Readable class should behave improperly, as streams are
+ // designed to be sync/async agnostic.
+ // Take note if the _read call is sync or async (ie, if the read call
+ // has returned yet), so that we know whether or not it's safe to emit
+ // 'readable' etc.
+ //
+ // 3. Actually pull the requested chunks out of the buffer and return.
+
+ // if we need a readable event, then we need to do some reading.
+ var doRead = state.needReadable;
+ debug('need readable', doRead);
+
+ // if we currently have less than the highWaterMark, then also read some
+ if (state.length === 0 || state.length - n < state.highWaterMark) {
+ doRead = true;
+ debug('length less than watermark', doRead);
+ }
+
+ // however, if we've ended, then there's no point, and if we're already
+ // reading, then it's unnecessary.
+ if (state.ended || state.reading) {
+ doRead = false;
+ debug('reading or ended', doRead);
+ }
+
+ if (doRead) {
+ debug('do read');
+ state.reading = true;
+ state.sync = true;
+ // if the length is currently zero, then we *need* a readable event.
+ if (state.length === 0)
+ state.needReadable = true;
+ // call internal read method
+ this._read(state.highWaterMark);
+ state.sync = false;
+ }
+
+ // If _read pushed data synchronously, then `reading` will be false,
+ // and we need to re-evaluate how much data we can return to the user.
+ if (doRead && !state.reading)
+ n = howMuchToRead(nOrig, state);
+
+ var ret;
+ if (n > 0)
+ ret = fromList(n, state);
+ else
+ ret = null;
-function ripemd160(message) {
- var H = [0x67452301, 0xEFCDAB89, 0x98BADCFE, 0x10325476, 0xC3D2E1F0];
+ if (util.isNull(ret)) {
+ state.needReadable = true;
+ n = 0;
+ }
- if (typeof message == 'string')
- message = new Buffer(message, 'utf8');
+ state.length -= n;
- var m = bytesToWords(message);
+ // If we have nothing in the buffer, then we want to know
+ // as soon as we *do* get something into the buffer.
+ if (state.length === 0 && !state.ended)
+ state.needReadable = true;
- var nBitsLeft = message.length * 8;
- var nBitsTotal = message.length * 8;
+ // If we tried to read() past the EOF, then emit end on the next tick.
+ if (nOrig !== n && state.ended && state.length === 0)
+ endReadable(this);
- // 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)
- );
+ if (!util.isNull(ret))
+ this.emit('data', ret);
+
+ return ret;
+};
- for (var i=0 ; i<m.length; i += 16) {
- processBlock(H, m, i);
+function chunkInvalid(state, chunk) {
+ var er = null;
+ if (!util.isBuffer(chunk) &&
+ !util.isString(chunk) &&
+ !util.isNullOrUndefined(chunk) &&
+ !state.objectMode) {
+ er = new TypeError('Invalid non-string/buffer chunk');
}
+ return er;
+}
- // 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);
+function onEofChunk(stream, state) {
+ if (state.decoder && !state.ended) {
+ var chunk = state.decoder.end();
+ if (chunk && chunk.length) {
+ state.buffer.push(chunk);
+ state.length += state.objectMode ? 1 : chunk.length;
+ }
}
+ state.ended = true;
+
+ // emit 'readable' now to make sure it gets picked up.
+ emitReadable(stream);
+}
+
+// Don't emit readable right away in sync mode, because this can trigger
+// another read() call => stack overflow. This way, it might trigger
+// a nextTick recursion warning, but that's not so bad.
+function emitReadable(stream) {
+ var state = stream._readableState;
+ state.needReadable = false;
+ if (!state.emittedReadable) {
+ debug('emitReadable', state.flowing);
+ state.emittedReadable = true;
+ if (state.sync)
+ process.nextTick(function() {
+ emitReadable_(stream);
+ });
+ else
+ emitReadable_(stream);
+ }
+}
- var digestbytes = wordsToBytes(H);
- return new Buffer(digestbytes);
+function emitReadable_(stream) {
+ debug('emit readable');
+ stream.emit('readable');
+ flow(stream);
}
+// at this point, the user has presumably seen the 'readable' event,
+// and called read() to consume some data. that may have triggered
+// in turn another _read(n) call, in which case reading = true if
+// it's in progress.
+// However, if we're not ended, or reading, and the length < hwm,
+// then go ahead and try to read some more preemptively.
+function maybeReadMore(stream, state) {
+ if (!state.readingMore) {
+ state.readingMore = true;
+ process.nextTick(function() {
+ maybeReadMore_(stream, state);
+ });
+ }
+}
-}).call(this,_dereq_("buffer").Buffer)
-},{"buffer":8}],22:[function(_dereq_,module,exports){
-var u = _dereq_('./util')
-var write = u.write
-var fill = u.zeroFill
+function maybeReadMore_(stream, state) {
+ var len = state.length;
+ while (!state.reading && !state.flowing && !state.ended &&
+ state.length < state.highWaterMark) {
+ debug('maybeReadMore read 0');
+ stream.read(0);
+ if (len === state.length)
+ // didn't get any data, stop spinning.
+ break;
+ else
+ len = state.length;
+ }
+ state.readingMore = false;
+}
-module.exports = function (Buffer) {
+// abstract method. to be overridden in specific implementation classes.
+// call cb(er, data) where data is <= n in length.
+// for virtual (non-string, non-buffer) streams, "length" is somewhat
+// arbitrary, and perhaps not very meaningful.
+Readable.prototype._read = function(n) {
+ this.emit('error', new Error('not implemented'));
+};
- //prototype class for hash functions
- function Hash (blockSize, finalSize) {
- this._block = new Buffer(blockSize) //new Uint32Array(blockSize/4)
- this._finalSize = finalSize
- this._blockSize = blockSize
- this._len = 0
- this._s = 0
+Readable.prototype.pipe = function(dest, pipeOpts) {
+ var src = this;
+ var state = this._readableState;
+
+ switch (state.pipesCount) {
+ case 0:
+ state.pipes = dest;
+ break;
+ case 1:
+ state.pipes = [state.pipes, dest];
+ break;
+ default:
+ state.pipes.push(dest);
+ break;
}
+ state.pipesCount += 1;
+ debug('pipe count=%d opts=%j', state.pipesCount, pipeOpts);
+
+ var doEnd = (!pipeOpts || pipeOpts.end !== false) &&
+ dest !== process.stdout &&
+ dest !== process.stderr;
- Hash.prototype.init = function () {
- this._s = 0
- this._len = 0
+ var endFn = doEnd ? onend : cleanup;
+ if (state.endEmitted)
+ process.nextTick(endFn);
+ else
+ src.once('end', endFn);
+
+ dest.on('unpipe', onunpipe);
+ function onunpipe(readable) {
+ debug('onunpipe');
+ if (readable === src) {
+ cleanup();
+ }
}
- function lengthOf(data, enc) {
- if(enc == null) return data.byteLength || data.length
- if(enc == 'ascii' || enc == 'binary') return data.length
- if(enc == 'hex') return data.length/2
- if(enc == 'base64') return data.length/3
+ function onend() {
+ debug('onend');
+ dest.end();
+ }
+
+ // when the dest drains, it reduces the awaitDrain counter
+ // on the source. This would be more elegant with a .once()
+ // handler in flow(), but adding and removing repeatedly is
+ // too slow.
+ var ondrain = pipeOnDrain(src);
+ dest.on('drain', ondrain);
+
+ function cleanup() {
+ debug('cleanup');
+ // cleanup event handlers once the pipe is broken
+ dest.removeListener('close', onclose);
+ dest.removeListener('finish', onfinish);
+ dest.removeListener('drain', ondrain);
+ dest.removeListener('error', onerror);
+ dest.removeListener('unpipe', onunpipe);
+ src.removeListener('end', onend);
+ src.removeListener('end', cleanup);
+ src.removeListener('data', ondata);
+
+ // if the reader is waiting for a drain event from this
+ // specific writer, then it would cause it to never start
+ // flowing again.
+ // So, if this is awaiting a drain, then we just call it now.
+ // If we don't know, then assume that we are waiting for one.
+ if (state.awaitDrain &&
+ (!dest._writableState || dest._writableState.needDrain))
+ ondrain();
+ }
+
+ src.on('data', ondata);
+ function ondata(chunk) {
+ debug('ondata');
+ var ret = dest.write(chunk);
+ if (false === ret) {
+ debug('false write response, pause',
+ src._readableState.awaitDrain);
+ src._readableState.awaitDrain++;
+ src.pause();
+ }
}
- Hash.prototype.update = function (data, enc) {
- var bl = this._blockSize
+ // if the dest has an error, then stop piping into it.
+ // however, don't suppress the throwing behavior for this.
+ function onerror(er) {
+ debug('onerror', er);
+ unpipe();
+ dest.removeListener('error', onerror);
+ if (EE.listenerCount(dest, 'error') === 0)
+ dest.emit('error', er);
+ }
+ // This is a brutally ugly hack to make sure that our error handler
+ // is attached before any userland ones. NEVER DO THIS.
+ if (!dest._events || !dest._events.error)
+ dest.on('error', onerror);
+ else if (isArray(dest._events.error))
+ dest._events.error.unshift(onerror);
+ else
+ dest._events.error = [onerror, dest._events.error];
- //I'd rather do this with a streaming encoder, like the opposite of
- //http://nodejs.org/api/string_decoder.html
- var length
- if(!enc && 'string' === typeof data)
- enc = 'utf8'
- if(enc) {
- if(enc === 'utf-8')
- enc = 'utf8'
- if(enc === 'base64' || enc === 'utf8')
- data = new Buffer(data, enc), enc = null
+ // Both close and finish should trigger unpipe, but only once.
+ function onclose() {
+ dest.removeListener('finish', onfinish);
+ unpipe();
+ }
+ dest.once('close', onclose);
+ function onfinish() {
+ debug('onfinish');
+ dest.removeListener('close', onclose);
+ unpipe();
+ }
+ dest.once('finish', onfinish);
- length = lengthOf(data, enc)
- } else
- length = data.byteLength || data.length
+ function unpipe() {
+ debug('unpipe');
+ src.unpipe(dest);
+ }
+
+ // tell the dest that it's being piped to
+ dest.emit('pipe', src);
+
+ // start the flow if it hasn't been started already.
+ if (!state.flowing) {
+ debug('pipe resume');
+ src.resume();
+ }
- var l = this._len += length
- var s = this._s = (this._s || 0)
- var f = 0
- var buffer = this._block
- while(s < l) {
- var t = Math.min(length, f + bl)
- write(buffer, data, enc, s%bl, f, t)
- var ch = (t - f);
- s += ch; f += ch
+ return dest;
+};
- if(!(s%bl))
- this._update(buffer)
+function pipeOnDrain(src) {
+ return function() {
+ var state = src._readableState;
+ debug('pipeOnDrain', state.awaitDrain);
+ if (state.awaitDrain)
+ state.awaitDrain--;
+ if (state.awaitDrain === 0 && EE.listenerCount(src, 'data')) {
+ state.flowing = true;
+ flow(src);
}
- this._s = s
+ };
+}
+
- return this
+Readable.prototype.unpipe = function(dest) {
+ var state = this._readableState;
+ // if we're not piping anywhere, then do nothing.
+ if (state.pipesCount === 0)
+ return this;
+
+ // just one destination. most common case.
+ if (state.pipesCount === 1) {
+ // passed in one, but it's not the right one.
+ if (dest && dest !== state.pipes)
+ return this;
+
+ if (!dest)
+ dest = state.pipes;
+
+ // got a match.
+ state.pipes = null;
+ state.pipesCount = 0;
+ state.flowing = false;
+ if (dest)
+ dest.emit('unpipe', this);
+ return this;
}
- Hash.prototype.digest = function (enc) {
- var bl = this._blockSize
- var fl = this._finalSize
- var len = this._len*8
+ // slow case. multiple pipe destinations.
+
+ if (!dest) {
+ // remove all.
+ var dests = state.pipes;
+ var len = state.pipesCount;
+ state.pipes = null;
+ state.pipesCount = 0;
+ state.flowing = false;
- var x = this._block
+ for (var i = 0; i < len; i++)
+ dests[i].emit('unpipe', this);
+ return this;
+ }
- var bits = len % (bl*8)
+ // try to find the right one.
+ var i = indexOf(state.pipes, dest);
+ if (i === -1)
+ return this;
- //add end marker, so that appending 0's creats a different hash.
- x[this._len % bl] = 0x80
- fill(this._block, this._len % bl + 1)
+ state.pipes.splice(i, 1);
+ state.pipesCount -= 1;
+ if (state.pipesCount === 1)
+ state.pipes = state.pipes[0];
- if(bits >= fl*8) {
- this._update(this._block)
- u.zeroFill(this._block, 0)
- }
+ dest.emit('unpipe', this);
- //TODO: handle case where the bit length is > Math.pow(2, 29)
- x.writeInt32BE(len, fl + 4) //big endian
+ return this;
+};
- var hash = this._update(this._block) || this._hash()
- if(enc == null) return hash
- return hash.toString(enc)
+// set up data events if they are asked for
+// Ensure readable listeners eventually get something
+Readable.prototype.on = function(ev, fn) {
+ var res = Stream.prototype.on.call(this, ev, fn);
+
+ // If listening to data, and it has not explicitly been paused,
+ // then call resume to start the flow of data on the next tick.
+ if (ev === 'data' && false !== this._readableState.flowing) {
+ this.resume();
+ }
+
+ if (ev === 'readable' && this.readable) {
+ var state = this._readableState;
+ if (!state.readableListening) {
+ state.readableListening = true;
+ state.emittedReadable = false;
+ state.needReadable = true;
+ if (!state.reading) {
+ var self = this;
+ process.nextTick(function() {
+ debug('readable nexttick read 0');
+ self.read(0);
+ });
+ } else if (state.length) {
+ emitReadable(this, state);
+ }
+ }
}
- Hash.prototype._update = function () {
- throw new Error('_update must be implemented by subclass')
+ return res;
+};
+Readable.prototype.addListener = Readable.prototype.on;
+
+// pause() and resume() are remnants of the legacy readable stream API
+// If the user uses them, then switch into old mode.
+Readable.prototype.resume = function() {
+ var state = this._readableState;
+ if (!state.flowing) {
+ debug('resume');
+ state.flowing = true;
+ if (!state.reading) {
+ debug('resume read 0');
+ this.read(0);
+ }
+ resume(this, state);
}
+ return this;
+};
- return Hash
+function resume(stream, state) {
+ if (!state.resumeScheduled) {
+ state.resumeScheduled = true;
+ process.nextTick(function() {
+ resume_(stream, state);
+ });
+ }
}
-},{"./util":26}],23:[function(_dereq_,module,exports){
-var exports = module.exports = function (alg) {
- var Alg = exports[alg]
- if(!Alg) throw new Error(alg + ' is not supported (we accept pull requests)')
- return new Alg()
+function resume_(stream, state) {
+ state.resumeScheduled = false;
+ stream.emit('resume');
+ flow(stream);
+ if (state.flowing && !state.reading)
+ stream.read(0);
}
-var Buffer = _dereq_('buffer').Buffer
-var Hash = _dereq_('./hash')(Buffer)
-
-exports.sha =
-exports.sha1 = _dereq_('./sha1')(Buffer, Hash)
-exports.sha256 = _dereq_('./sha256')(Buffer, Hash)
-
-},{"./hash":22,"./sha1":24,"./sha256":25,"buffer":8}],24:[function(_dereq_,module,exports){
-/*
- * A JavaScript implementation of the Secure Hash Algorithm, SHA-1, as defined
- * in FIPS PUB 180-1
- * Version 2.1a Copyright Paul Johnston 2000 - 2002.
- * Other contributors: Greg Holt, Andrew Kepert, Ydnar, Lostinet
- * Distributed under the BSD License
- * See http://pajhome.org.uk/crypt/md5 for details.
- */
-module.exports = function (Buffer, Hash) {
-
- var inherits = _dereq_('util').inherits
-
- inherits(Sha1, Hash)
+Readable.prototype.pause = function() {
+ debug('call pause flowing=%j', this._readableState.flowing);
+ if (false !== this._readableState.flowing) {
+ debug('pause');
+ this._readableState.flowing = false;
+ this.emit('pause');
+ }
+ return this;
+};
- var A = 0|0
- var B = 4|0
- var C = 8|0
- var D = 12|0
- var E = 16|0
+function flow(stream) {
+ var state = stream._readableState;
+ debug('flow', state.flowing);
+ if (state.flowing) {
+ do {
+ var chunk = stream.read();
+ } while (null !== chunk && state.flowing);
+ }
+}
- var BE = false
- var LE = true
+// wrap an old-style stream as the async data source.
+// This is *not* part of the readable stream interface.
+// It is an ugly unfortunate mess of history.
+Readable.prototype.wrap = function(stream) {
+ var state = this._readableState;
+ var paused = false;
- var W = new Int32Array(80)
+ var self = this;
+ stream.on('end', function() {
+ debug('wrapped end');
+ if (state.decoder && !state.ended) {
+ var chunk = state.decoder.end();
+ if (chunk && chunk.length)
+ self.push(chunk);
+ }
- var POOL = []
+ self.push(null);
+ });
- function Sha1 () {
- if(POOL.length)
- return POOL.pop().init()
+ stream.on('data', function(chunk) {
+ debug('wrapped data');
+ if (state.decoder)
+ chunk = state.decoder.write(chunk);
+ if (!chunk || !state.objectMode && !chunk.length)
+ return;
+
+ var ret = self.push(chunk);
+ if (!ret) {
+ paused = true;
+ stream.pause();
+ }
+ });
- if(!(this instanceof Sha1)) return new Sha1()
- this._w = W
- Hash.call(this, 16*4, 14*4)
-
- this._h = null
- this.init()
+ // proxy all the other methods.
+ // important when wrapping filters and duplexes.
+ for (var i in stream) {
+ if (util.isFunction(stream[i]) && util.isUndefined(this[i])) {
+ this[i] = function(method) { return function() {
+ return stream[method].apply(stream, arguments);
+ }}(i);
+ }
}
- Sha1.prototype.init = function () {
- this._a = 0x67452301
- this._b = 0xefcdab89
- this._c = 0x98badcfe
- this._d = 0x10325476
- this._e = 0xc3d2e1f0
+ // proxy certain important events.
+ var events = ['error', 'close', 'destroy', 'pause', 'resume'];
+ forEach(events, function(ev) {
+ stream.on(ev, self.emit.bind(self, ev));
+ });
- Hash.prototype.init.call(this)
- return this
- }
+ // when we try to consume some more bytes, simply unpause the
+ // underlying stream.
+ self._read = function(n) {
+ debug('wrapped _read', n);
+ if (paused) {
+ paused = false;
+ stream.resume();
+ }
+ };
- Sha1.prototype._POOL = POOL
+ return self;
+};
- // assume that array is a Uint32Array with length=16,
- // and that if it is the last block, it already has the length and the 1 bit appended.
- var isDV = new Buffer(1) instanceof DataView
- function readInt32BE (X, i) {
- return isDV
- ? X.getInt32(i, false)
- : X.readInt32BE(i)
- }
+// exposed for testing purposes only.
+Readable._fromList = fromList;
- Sha1.prototype._update = function (array) {
+// Pluck off n bytes from an array of buffers.
+// Length is the combined lengths of all the buffers in the list.
+function fromList(n, state) {
+ var list = state.buffer;
+ var length = state.length;
+ var stringMode = !!state.decoder;
+ var objectMode = !!state.objectMode;
+ var ret;
- var X = this._block
- var h = this._h
- var a, b, c, d, e, _a, _b, _c, _d, _e
+ // nothing in the list, definitely empty.
+ if (list.length === 0)
+ return null;
- a = _a = this._a
- b = _b = this._b
- c = _c = this._c
- d = _d = this._d
- e = _e = this._e
+ if (length === 0)
+ ret = null;
+ else if (objectMode)
+ ret = list.shift();
+ else if (!n || n >= length) {
+ // read it all, truncate the array.
+ if (stringMode)
+ ret = list.join('');
+ else
+ ret = Buffer.concat(list, length);
+ list.length = 0;
+ } else {
+ // read just some of it.
+ if (n < list[0].length) {
+ // just take a part of the first list item.
+ // slice is the same for buffers and strings.
+ var buf = list[0];
+ ret = buf.slice(0, n);
+ list[0] = buf.slice(n);
+ } else if (n === list[0].length) {
+ // first list is a perfect match
+ ret = list.shift();
+ } else {
+ // complex case.
+ // we have enough to cover it, but it spans past the first buffer.
+ if (stringMode)
+ ret = '';
+ else
+ ret = new Buffer(n);
- var w = this._w
+ var c = 0;
+ for (var i = 0, l = list.length; i < l && c < n; i++) {
+ var buf = list[0];
+ var cpy = Math.min(n - c, buf.length);
- for(var j = 0; j < 80; j++) {
- var W = w[j]
- = j < 16
- //? X.getInt32(j*4, false)
- //? readInt32BE(X, j*4) //*/ X.readInt32BE(j*4) //*/
- ? X.readInt32BE(j*4)
- : rol(w[j - 3] ^ w[j - 8] ^ w[j - 14] ^ w[j - 16], 1)
+ if (stringMode)
+ ret += buf.slice(0, cpy);
+ else
+ buf.copy(ret, c, 0, cpy);
- var t =
- add(
- add(rol(a, 5), sha1_ft(j, b, c, d)),
- add(add(e, W), sha1_kt(j))
- );
+ if (cpy < buf.length)
+ list[0] = buf.slice(cpy);
+ else
+ list.shift();
- e = d
- d = c
- c = rol(b, 30)
- b = a
- a = t
+ c += cpy;
+ }
}
-
- this._a = add(a, _a)
- this._b = add(b, _b)
- this._c = add(c, _c)
- this._d = add(d, _d)
- this._e = add(e, _e)
}
- Sha1.prototype._hash = function () {
- if(POOL.length < 100) POOL.push(this)
- var H = new Buffer(20)
- //console.log(this._a|0, this._b|0, this._c|0, this._d|0, this._e|0)
- H.writeInt32BE(this._a|0, A)
- H.writeInt32BE(this._b|0, B)
- H.writeInt32BE(this._c|0, C)
- H.writeInt32BE(this._d|0, D)
- H.writeInt32BE(this._e|0, E)
- return H
- }
+ return ret;
+}
- /*
- * Perform the appropriate triplet combination function for the current
- * iteration
- */
- function sha1_ft(t, b, c, d) {
- if(t < 20) return (b & c) | ((~b) & d);
- if(t < 40) return b ^ c ^ d;
- if(t < 60) return (b & c) | (b & d) | (c & d);
- return b ^ c ^ d;
- }
+function endReadable(stream) {
+ var state = stream._readableState;
- /*
- * Determine the appropriate additive constant for the current iteration
- */
- function sha1_kt(t) {
- return (t < 20) ? 1518500249 : (t < 40) ? 1859775393 :
- (t < 60) ? -1894007588 : -899497514;
- }
+ // If we get here before consuming all the bytes, then that is a
+ // bug in node. Should never happen.
+ if (state.length > 0)
+ throw new Error('endReadable called on non-empty stream');
- /*
- * Add integers, wrapping at 2^32. This uses 16-bit operations internally
- * to work around bugs in some JS interpreters.
- * //dominictarr: this is 10 years old, so maybe this can be dropped?)
- *
- */
- function add(x, y) {
- return (x + y ) | 0
- //lets see how this goes on testling.
- // var lsw = (x & 0xFFFF) + (y & 0xFFFF);
- // var msw = (x >> 16) + (y >> 16) + (lsw >> 16);
- // return (msw << 16) | (lsw & 0xFFFF);
+ if (!state.endEmitted) {
+ state.ended = true;
+ process.nextTick(function() {
+ // Check that we didn't get one last unshift.
+ if (!state.endEmitted && state.length === 0) {
+ state.endEmitted = true;
+ stream.readable = false;
+ stream.emit('end');
+ }
+ });
}
+}
- /*
- * Bitwise rotate a 32-bit number to the left.
- */
- function rol(num, cnt) {
- return (num << cnt) | (num >>> (32 - cnt));
+function forEach (xs, f) {
+ for (var i = 0, l = xs.length; i < l; i++) {
+ f(xs[i], i);
}
+}
- return Sha1
+function indexOf (xs, x) {
+ for (var i = 0, l = xs.length; i < l; i++) {
+ if (xs[i] === x) return i;
+ }
+ return -1;
}
-},{"util":14}],25:[function(_dereq_,module,exports){
+}).call(this,require('_process'))
+},{"./_stream_duplex":16,"_process":14,"buffer":7,"core-util-is":21,"events":11,"inherits":12,"isarray":13,"stream":26,"string_decoder/":27,"util":6}],19:[function(require,module,exports){
+// Copyright Joyent, Inc. and other Node contributors.
+//
+// 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.
+
-/**
- * A JavaScript implementation of the Secure Hash Algorithm, SHA-256, as defined
- * in FIPS 180-2
- * Version 2.2-beta Copyright Angel Marin, Paul Johnston 2000 - 2009.
- * Other contributors: Greg Holt, Andrew Kepert, Ydnar, Lostinet
- *
- */
+// a transform stream is a readable/writable stream where you do
+// something with the data. Sometimes it's called a "filter",
+// but that's not a great name for it, since that implies a thing where
+// some bits pass through, and others are simply ignored. (That would
+// be a valid example of a transform, of course.)
+//
+// While the output is causally related to the input, it's not a
+// necessarily symmetric or synchronous transformation. For example,
+// a zlib stream might take multiple plain-text writes(), and then
+// emit a single compressed chunk some time in the future.
+//
+// Here's how this works:
+//
+// The Transform stream has all the aspects of the readable and writable
+// stream classes. When you write(chunk), that calls _write(chunk,cb)
+// internally, and returns false if there's a lot of pending writes
+// buffered up. When you call read(), that calls _read(n) until
+// there's enough pending readable data buffered up.
+//
+// In a transform stream, the written data is placed in a buffer. When
+// _read(n) is called, it transforms the queued up data, calling the
+// buffered _write cb's as it consumes chunks. If consuming a single
+// written chunk would result in multiple output chunks, then the first
+// outputted bit calls the readcb, and subsequent chunks just go into
+// the read buffer, and will cause it to emit 'readable' if necessary.
+//
+// This way, back-pressure is actually determined by the reading side,
+// since _read has to be called to start processing a new chunk. However,
+// a pathological inflate type of transform can cause excessive buffering
+// here. For example, imagine a stream where every byte of input is
+// interpreted as an integer from 0-255, and then results in that many
+// bytes of output. Writing the 4 bytes {ff,ff,ff,ff} would result in
+// 1kb of data being output. In this case, you could write a very small
+// amount of input, and end up with a very large amount of output. In
+// such a pathological inflating mechanism, there'd be no way to tell
+// the system to stop doing the transform. A single 4MB write could
+// cause the system to run out of memory.
+//
+// However, even in such a pathological case, only a single written chunk
+// would be consumed, and then the rest would wait (un-transformed) until
+// the results of the previous transformed chunk were consumed.
-var inherits = _dereq_('util').inherits
-var BE = false
-var LE = true
-var u = _dereq_('./util')
-
-module.exports = function (Buffer, Hash) {
-
- var K = [
- 0x428A2F98, 0x71374491, 0xB5C0FBCF, 0xE9B5DBA5,
- 0x3956C25B, 0x59F111F1, 0x923F82A4, 0xAB1C5ED5,
- 0xD807AA98, 0x12835B01, 0x243185BE, 0x550C7DC3,
- 0x72BE5D74, 0x80DEB1FE, 0x9BDC06A7, 0xC19BF174,
- 0xE49B69C1, 0xEFBE4786, 0x0FC19DC6, 0x240CA1CC,
- 0x2DE92C6F, 0x4A7484AA, 0x5CB0A9DC, 0x76F988DA,
- 0x983E5152, 0xA831C66D, 0xB00327C8, 0xBF597FC7,
- 0xC6E00BF3, 0xD5A79147, 0x06CA6351, 0x14292967,
- 0x27B70A85, 0x2E1B2138, 0x4D2C6DFC, 0x53380D13,
- 0x650A7354, 0x766A0ABB, 0x81C2C92E, 0x92722C85,
- 0xA2BFE8A1, 0xA81A664B, 0xC24B8B70, 0xC76C51A3,
- 0xD192E819, 0xD6990624, 0xF40E3585, 0x106AA070,
- 0x19A4C116, 0x1E376C08, 0x2748774C, 0x34B0BCB5,
- 0x391C0CB3, 0x4ED8AA4A, 0x5B9CCA4F, 0x682E6FF3,
- 0x748F82EE, 0x78A5636F, 0x84C87814, 0x8CC70208,
- 0x90BEFFFA, 0xA4506CEB, 0xBEF9A3F7, 0xC67178F2
- ]
+module.exports = Transform;
- inherits(Sha256, Hash)
- var W = new Array(64)
- var POOL = []
- function Sha256() {
- // Closure compiler warning - this code lacks side effects - thus commented out
- // if(POOL.length) {
- // return POOL.shift().init()
- // }
- //this._data = new Buffer(32)
+var Duplex = require('./_stream_duplex');
- this.init()
+/*<replacement>*/
+var util = require('core-util-is');
+util.inherits = require('inherits');
+/*</replacement>*/
- this._w = W //new Array(64)
+util.inherits(Transform, Duplex);
- Hash.call(this, 16*4, 14*4)
+
+function TransformState(options, stream) {
+ this.afterTransform = function(er, data) {
+ return afterTransform(stream, er, data);
};
- Sha256.prototype.init = function () {
+ this.needTransform = false;
+ this.transforming = false;
+ this.writecb = null;
+ this.writechunk = null;
+}
- this._a = 0x6a09e667|0
- this._b = 0xbb67ae85|0
- this._c = 0x3c6ef372|0
- this._d = 0xa54ff53a|0
- this._e = 0x510e527f|0
- this._f = 0x9b05688c|0
- this._g = 0x1f83d9ab|0
- this._h = 0x5be0cd19|0
+function afterTransform(stream, er, data) {
+ var ts = stream._transformState;
+ ts.transforming = false;
- this._len = this._s = 0
+ var cb = ts.writecb;
- return this
- }
+ if (!cb)
+ return stream.emit('error', new Error('no writecb in Transform class'));
- var safe_add = function(x, y) {
- var lsw = (x & 0xFFFF) + (y & 0xFFFF);
- var msw = (x >> 16) + (y >> 16) + (lsw >> 16);
- return (msw << 16) | (lsw & 0xFFFF);
- }
+ ts.writechunk = null;
+ ts.writecb = null;
- function S (X, n) {
- return (X >>> n) | (X << (32 - n));
- }
+ if (!util.isNullOrUndefined(data))
+ stream.push(data);
- function R (X, n) {
- return (X >>> n);
- }
+ if (cb)
+ cb(er);
- function Ch (x, y, z) {
- return ((x & y) ^ ((~x) & z));
+ var rs = stream._readableState;
+ rs.reading = false;
+ if (rs.needReadable || rs.length < rs.highWaterMark) {
+ stream._read(rs.highWaterMark);
}
+}
- function Maj (x, y, z) {
- return ((x & y) ^ (x & z) ^ (y & z));
- }
- function Sigma0256 (x) {
- return (S(x, 2) ^ S(x, 13) ^ S(x, 22));
- }
+function Transform(options) {
+ if (!(this instanceof Transform))
+ return new Transform(options);
- function Sigma1256 (x) {
- return (S(x, 6) ^ S(x, 11) ^ S(x, 25));
- }
+ Duplex.call(this, options);
- function Gamma0256 (x) {
- return (S(x, 7) ^ S(x, 18) ^ R(x, 3));
- }
+ this._transformState = new TransformState(options, this);
- function Gamma1256 (x) {
- return (S(x, 17) ^ S(x, 19) ^ R(x, 10));
- }
+ // when the writable side finishes, then flush out anything remaining.
+ var stream = this;
- Sha256.prototype._update = function(m) {
- var M = this._block
- var W = this._w
- var a, b, c, d, e, f, g, h
- var T1, T2
+ // start out asking for a readable event once data is transformed.
+ this._readableState.needReadable = true;
- a = this._a | 0
- b = this._b | 0
- c = this._c | 0
- d = this._d | 0
- e = this._e | 0
- f = this._f | 0
- g = this._g | 0
- h = this._h | 0
+ // we have implemented the _read method, and done the other things
+ // that Readable wants before the first _read call, so unset the
+ // sync guard flag.
+ this._readableState.sync = false;
+
+ this.once('prefinish', function() {
+ if (util.isFunction(this._flush))
+ this._flush(function(er) {
+ done(stream, er);
+ });
+ else
+ done(stream);
+ });
+}
- for (var j = 0; j < 64; j++) {
- var w = W[j] = j < 16
- ? M.readInt32BE(j * 4)
- : Gamma1256(W[j - 2]) + W[j - 7] + Gamma0256(W[j - 15]) + W[j - 16]
+Transform.prototype.push = function(chunk, encoding) {
+ this._transformState.needTransform = false;
+ return Duplex.prototype.push.call(this, chunk, encoding);
+};
- T1 = h + Sigma1256(e) + Ch(e, f, g) + K[j] + w
+// This is the part where you do stuff!
+// override this function in implementation classes.
+// 'chunk' is an input chunk.
+//
+// Call `push(newChunk)` to pass along transformed output
+// to the readable side. You may call 'push' zero or more times.
+//
+// Call `cb(err)` when you are done with this chunk. If you pass
+// an error, then that'll put the hurt on the whole operation. If you
+// never call cb(), then you'll never get another chunk.
+Transform.prototype._transform = function(chunk, encoding, cb) {
+ throw new Error('not implemented');
+};
- T2 = Sigma0256(a) + Maj(a, b, c);
- h = g; g = f; f = e; e = d + T1; d = c; c = b; b = a; a = T1 + T2;
- }
+Transform.prototype._write = function(chunk, encoding, cb) {
+ var ts = this._transformState;
+ ts.writecb = cb;
+ ts.writechunk = chunk;
+ ts.writeencoding = encoding;
+ if (!ts.transforming) {
+ var rs = this._readableState;
+ if (ts.needTransform ||
+ rs.needReadable ||
+ rs.length < rs.highWaterMark)
+ this._read(rs.highWaterMark);
+ }
+};
- this._a = (a + this._a) | 0
- this._b = (b + this._b) | 0
- this._c = (c + this._c) | 0
- this._d = (d + this._d) | 0
- this._e = (e + this._e) | 0
- this._f = (f + this._f) | 0
- this._g = (g + this._g) | 0
- this._h = (h + this._h) | 0
+// Doesn't matter what the args are here.
+// _transform does all the work.
+// That we got here means that the readable side wants more data.
+Transform.prototype._read = function(n) {
+ var ts = this._transformState;
- };
+ if (!util.isNull(ts.writechunk) && ts.writecb && !ts.transforming) {
+ ts.transforming = true;
+ this._transform(ts.writechunk, ts.writeencoding, ts.afterTransform);
+ } else {
+ // mark that we need a transform, so that any data that comes in
+ // will get processed, now that we've asked for it.
+ ts.needTransform = true;
+ }
+};
- Sha256.prototype._hash = function () {
- if(POOL.length < 10)
- POOL.push(this)
- var H = new Buffer(32)
+function done(stream, er) {
+ if (er)
+ return stream.emit('error', er);
- H.writeInt32BE(this._a, 0)
- H.writeInt32BE(this._b, 4)
- H.writeInt32BE(this._c, 8)
- H.writeInt32BE(this._d, 12)
- H.writeInt32BE(this._e, 16)
- H.writeInt32BE(this._f, 20)
- H.writeInt32BE(this._g, 24)
- H.writeInt32BE(this._h, 28)
+ // if there's nothing in the write buffer, then that means
+ // that nothing more will ever be provided
+ var ws = stream._writableState;
+ var ts = stream._transformState;
- return H
- }
+ if (ws.length)
+ throw new Error('calling transform done when ws.length != 0');
- return Sha256
+ if (ts.transforming)
+ throw new Error('calling transform done when still transforming');
+ return stream.push(null);
}
-},{"./util":26,"util":14}],26:[function(_dereq_,module,exports){
-exports.write = write
-exports.zeroFill = zeroFill
+},{"./_stream_duplex":16,"core-util-is":21,"inherits":12}],20:[function(require,module,exports){
+(function (process){
+// Copyright Joyent, Inc. and other Node contributors.
+//
+// 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.
+
+// A bit simpler than readable streams.
+// Implement an async ._write(chunk, cb), and it'll handle all
+// the drain event emission and buffering.
-exports.toString = toString
+module.exports = Writable;
-function write (buffer, string, enc, start, from, to, LE) {
- var l = (to - from)
- if(enc === 'ascii' || enc === 'binary') {
- for( var i = 0; i < l; i++) {
- buffer[start + i] = string.charCodeAt(i + from)
- }
- }
- else if(enc == null) {
- for( var i = 0; i < l; i++) {
- buffer[start + i] = string[i + from]
- }
- }
- else if(enc === 'hex') {
- for(var i = 0; i < l; i++) {
- var j = from + i
- buffer[start + i] = parseInt(string[j*2] + string[(j*2)+1], 16)
- }
- }
- else if(enc === 'base64') {
- throw new Error('base64 encoding not yet supported')
- }
- else
- throw new Error(enc +' encoding not yet supported')
-}
+/*<replacement>*/
+var Buffer = require('buffer').Buffer;
+/*</replacement>*/
-//always fill to the end!
-function zeroFill(buf, from) {
- for(var i = from; i < buf.length; i++)
- buf[i] = 0
-}
+Writable.WritableState = WritableState;
-},{}],27:[function(_dereq_,module,exports){
-(function (Buffer){
-// JavaScript PBKDF2 Implementation
-// Based on http://git.io/qsv2zw
-// Licensed under LGPL v3
-// Copyright (c) 2013 jduncanator
-
-var blocksize = 64
-var zeroBuffer = new Buffer(blocksize); zeroBuffer.fill(0)
-
-module.exports = function (createHmac, exports) {
- exports = exports || {}
-
- exports.pbkdf2 = function(password, salt, iterations, keylen, cb) {
- if('function' !== typeof cb)
- throw new Error('No callback provided to pbkdf2');
- setTimeout(function () {
- cb(null, exports.pbkdf2Sync(password, salt, iterations, keylen))
- })
- }
+/*<replacement>*/
+var util = require('core-util-is');
+util.inherits = require('inherits');
+/*</replacement>*/
- exports.pbkdf2Sync = function(key, salt, iterations, keylen) {
- if('number' !== typeof iterations)
- throw new TypeError('Iterations not a number')
- if(iterations < 0)
- throw new TypeError('Bad iterations')
- if('number' !== typeof keylen)
- throw new TypeError('Key length not a number')
- if(keylen < 0)
- throw new TypeError('Bad key length')
-
- //stretch key to the correct length that hmac wants it,
- //otherwise this will happen every time hmac is called
- //twice per iteration.
- var key = !Buffer.isBuffer(key) ? new Buffer(key) : key
-
- if(key.length > blocksize) {
- key = createHash(alg).update(key).digest()
- } else if(key.length < blocksize) {
- key = Buffer.concat([key, zeroBuffer], blocksize)
- }
-
- var HMAC;
- var cplen, p = 0, i = 1, itmp = new Buffer(4), digtmp;
- var out = new Buffer(keylen);
- out.fill(0);
- while(keylen) {
- if(keylen > 20)
- cplen = 20;
- else
- cplen = keylen;
-
- /* We are unlikely to ever use more than 256 blocks (5120 bits!)
- * but just in case...
- */
- itmp[0] = (i >> 24) & 0xff;
- itmp[1] = (i >> 16) & 0xff;
- itmp[2] = (i >> 8) & 0xff;
- itmp[3] = i & 0xff;
-
- HMAC = createHmac('sha1', key);
- HMAC.update(salt)
- HMAC.update(itmp);
- digtmp = HMAC.digest();
- digtmp.copy(out, p, 0, cplen);
-
- for(var j = 1; j < iterations; j++) {
- HMAC = createHmac('sha1', key);
- HMAC.update(digtmp);
- digtmp = HMAC.digest();
- for(var k = 0; k < cplen; k++) {
- out[k] ^= digtmp[k];
- }
- }
- keylen -= cplen;
- i++;
- p += cplen;
- }
+var Stream = require('stream');
- return out;
- }
+util.inherits(Writable, Stream);
- return exports
+function WriteReq(chunk, encoding, cb) {
+ this.chunk = chunk;
+ this.encoding = encoding;
+ this.callback = cb;
}
-}).call(this,_dereq_("buffer").Buffer)
-},{"buffer":8}],28:[function(_dereq_,module,exports){
-(function (Buffer){
-// Original code adapted from Robert Kieffer.
-// details at https://github.com/broofa/node-uuid
+function WritableState(options, stream) {
+ var Duplex = require('./_stream_duplex');
+ options = options || {};
-(function() {
- var _global = this;
+ // the point at which write() starts returning false
+ // Note: 0 is a valid value, means that we always return false if
+ // the entire buffer is not flushed immediately on write()
+ var hwm = options.highWaterMark;
+ var defaultHwm = options.objectMode ? 16 : 16 * 1024;
+ this.highWaterMark = (hwm || hwm === 0) ? hwm : defaultHwm;
- var mathRNG, whatwgRNG;
+ // object stream flag to indicate whether or not this stream
+ // contains buffers or objects.
+ this.objectMode = !!options.objectMode;
- // NOTE: Math.random() does not guarantee "cryptographic quality"
- mathRNG = function(size) {
- var bytes = new Buffer(size);
- var r;
+ if (stream instanceof Duplex)
+ this.objectMode = this.objectMode || !!options.writableObjectMode;
- for (var i = 0, r; i < size; i++) {
- if ((i & 0x03) == 0) r = Math.random() * 0x100000000;
- bytes[i] = r >>> ((i & 0x03) << 3) & 0xff;
- }
+ // cast to ints.
+ this.highWaterMark = ~~this.highWaterMark;
- return bytes;
- }
+ this.needDrain = false;
+ // at the start of calling end()
+ this.ending = false;
+ // when end() has been called, and returned
+ this.ended = false;
+ // when 'finish' is emitted
+ this.finished = false;
- if (_global.crypto && crypto.getRandomValues) {
- whatwgRNG = function(size) {
- var bytes = new Buffer(size); //in browserify, this is an extended Uint8Array
- crypto.getRandomValues(bytes);
- return bytes;
- }
- }
+ // should we decode strings into buffers before passing to _write?
+ // this is here so that some node-core streams can optimize string
+ // handling at a lower level.
+ var noDecode = options.decodeStrings === false;
+ this.decodeStrings = !noDecode;
- module.exports = whatwgRNG || mathRNG;
+ // Crypto is kind of old and crusty. Historically, its default string
+ // encoding is 'binary' so we have to make this configurable.
+ // Everything else in the universe uses 'utf8', though.
+ this.defaultEncoding = options.defaultEncoding || 'utf8';
-}())
+ // not an actual buffer we keep track of, but a measurement
+ // of how much we're waiting to get pushed to some underlying
+ // socket or file.
+ this.length = 0;
-}).call(this,_dereq_("buffer").Buffer)
-},{"buffer":8}],29:[function(_dereq_,module,exports){
-;(function (root, factory, undef) {
- if (typeof exports === "object") {
- // CommonJS
- module.exports = exports = factory(_dereq_("./core"), _dereq_("./enc-base64"), _dereq_("./md5"), _dereq_("./evpkdf"), _dereq_("./cipher-core"));
- }
- else if (typeof define === "function" && define.amd) {
- // AMD
- define(["./core", "./enc-base64", "./md5", "./evpkdf", "./cipher-core"], factory);
- }
- else {
- // Global (browser)
- factory(root.CryptoJS);
- }
-}(this, function (CryptoJS) {
-
- (function () {
- // Shortcuts
- var C = CryptoJS;
- var C_lib = C.lib;
- var BlockCipher = C_lib.BlockCipher;
- var C_algo = C.algo;
-
- // Lookup tables
- var SBOX = [];
- var INV_SBOX = [];
- var SUB_MIX_0 = [];
- var SUB_MIX_1 = [];
- var SUB_MIX_2 = [];
- var SUB_MIX_3 = [];
- var INV_SUB_MIX_0 = [];
- var INV_SUB_MIX_1 = [];
- var INV_SUB_MIX_2 = [];
- var INV_SUB_MIX_3 = [];
-
- // Compute lookup tables
- (function () {
- // Compute double table
- var d = [];
- for (var i = 0; i < 256; i++) {
- if (i < 128) {
- d[i] = i << 1;
- } else {
- d[i] = (i << 1) ^ 0x11b;
- }
- }
-
- // Walk GF(2^8)
- var x = 0;
- var xi = 0;
- for (var i = 0; i < 256; i++) {
- // Compute sbox
- var sx = xi ^ (xi << 1) ^ (xi << 2) ^ (xi << 3) ^ (xi << 4);
- sx = (sx >>> 8) ^ (sx & 0xff) ^ 0x63;
- SBOX[x] = sx;
- INV_SBOX[sx] = x;
-
- // Compute multiplication
- var x2 = d[x];
- var x4 = d[x2];
- var x8 = d[x4];
-
- // Compute sub bytes, mix columns tables
- var t = (d[sx] * 0x101) ^ (sx * 0x1010100);
- SUB_MIX_0[x] = (t << 24) | (t >>> 8);
- SUB_MIX_1[x] = (t << 16) | (t >>> 16);
- SUB_MIX_2[x] = (t << 8) | (t >>> 24);
- SUB_MIX_3[x] = t;
-
- // Compute inv sub bytes, inv mix columns tables
- var t = (x8 * 0x1010101) ^ (x4 * 0x10001) ^ (x2 * 0x101) ^ (x * 0x1010100);
- INV_SUB_MIX_0[sx] = (t << 24) | (t >>> 8);
- INV_SUB_MIX_1[sx] = (t << 16) | (t >>> 16);
- INV_SUB_MIX_2[sx] = (t << 8) | (t >>> 24);
- INV_SUB_MIX_3[sx] = t;
-
- // Compute next counter
- if (!x) {
- x = xi = 1;
- } else {
- x = x2 ^ d[d[d[x8 ^ x2]]];
- xi ^= d[d[xi]];
- }
- }
- }());
-
- // Precomputed Rcon lookup
- var RCON = [0x00, 0x01, 0x02, 0x04, 0x08, 0x10, 0x20, 0x40, 0x80, 0x1b, 0x36];
-
- /**
- * AES block cipher algorithm.
- */
- var AES = C_algo.AES = BlockCipher.extend({
- _doReset: function () {
- // Shortcuts
- var key = this._key;
- var keyWords = key.words;
- var keySize = key.sigBytes / 4;
-
- // Compute number of rounds
- var nRounds = this._nRounds = keySize + 6
-
- // Compute number of key schedule rows
- var ksRows = (nRounds + 1) * 4;
-
- // Compute key schedule
- var keySchedule = this._keySchedule = [];
- for (var ksRow = 0; ksRow < ksRows; ksRow++) {
- if (ksRow < keySize) {
- keySchedule[ksRow] = keyWords[ksRow];
- } else {
- var t = keySchedule[ksRow - 1];
-
- if (!(ksRow % keySize)) {
- // Rot word
- t = (t << 8) | (t >>> 24);
-
- // Sub word
- t = (SBOX[t >>> 24] << 24) | (SBOX[(t >>> 16) & 0xff] << 16) | (SBOX[(t >>> 8) & 0xff] << 8) | SBOX[t & 0xff];
-
- // Mix Rcon
- t ^= RCON[(ksRow / keySize) | 0] << 24;
- } else if (keySize > 6 && ksRow % keySize == 4) {
- // Sub word
- t = (SBOX[t >>> 24] << 24) | (SBOX[(t >>> 16) & 0xff] << 16) | (SBOX[(t >>> 8) & 0xff] << 8) | SBOX[t & 0xff];
- }
-
- keySchedule[ksRow] = keySchedule[ksRow - keySize] ^ t;
- }
- }
-
- // Compute inv key schedule
- var invKeySchedule = this._invKeySchedule = [];
- for (var invKsRow = 0; invKsRow < ksRows; invKsRow++) {
- var ksRow = ksRows - invKsRow;
-
- if (invKsRow % 4) {
- var t = keySchedule[ksRow];
- } else {
- var t = keySchedule[ksRow - 4];
- }
-
- if (invKsRow < 4 || ksRow <= 4) {
- invKeySchedule[invKsRow] = t;
- } else {
- invKeySchedule[invKsRow] = INV_SUB_MIX_0[SBOX[t >>> 24]] ^ INV_SUB_MIX_1[SBOX[(t >>> 16) & 0xff]] ^
- INV_SUB_MIX_2[SBOX[(t >>> 8) & 0xff]] ^ INV_SUB_MIX_3[SBOX[t & 0xff]];
- }
- }
- },
-
- encryptBlock: function (M, offset) {
- this._doCryptBlock(M, offset, this._keySchedule, SUB_MIX_0, SUB_MIX_1, SUB_MIX_2, SUB_MIX_3, SBOX);
- },
-
- decryptBlock: function (M, offset) {
- // Swap 2nd and 4th rows
- var t = M[offset + 1];
- M[offset + 1] = M[offset + 3];
- M[offset + 3] = t;
-
- this._doCryptBlock(M, offset, this._invKeySchedule, INV_SUB_MIX_0, INV_SUB_MIX_1, INV_SUB_MIX_2, INV_SUB_MIX_3, INV_SBOX);
-
- // Inv swap 2nd and 4th rows
- var t = M[offset + 1];
- M[offset + 1] = M[offset + 3];
- M[offset + 3] = t;
- },
-
- _doCryptBlock: function (M, offset, keySchedule, SUB_MIX_0, SUB_MIX_1, SUB_MIX_2, SUB_MIX_3, SBOX) {
- // Shortcut
- var nRounds = this._nRounds;
-
- // Get input, add round key
- var s0 = M[offset] ^ keySchedule[0];
- var s1 = M[offset + 1] ^ keySchedule[1];
- var s2 = M[offset + 2] ^ keySchedule[2];
- var s3 = M[offset + 3] ^ keySchedule[3];
-
- // Key schedule row counter
- var ksRow = 4;
-
- // Rounds
- for (var round = 1; round < nRounds; round++) {
- // Shift rows, sub bytes, mix columns, add round key
- var t0 = SUB_MIX_0[s0 >>> 24] ^ SUB_MIX_1[(s1 >>> 16) & 0xff] ^ SUB_MIX_2[(s2 >>> 8) & 0xff] ^ SUB_MIX_3[s3 & 0xff] ^ keySchedule[ksRow++];
- var t1 = SUB_MIX_0[s1 >>> 24] ^ SUB_MIX_1[(s2 >>> 16) & 0xff] ^ SUB_MIX_2[(s3 >>> 8) & 0xff] ^ SUB_MIX_3[s0 & 0xff] ^ keySchedule[ksRow++];
- var t2 = SUB_MIX_0[s2 >>> 24] ^ SUB_MIX_1[(s3 >>> 16) & 0xff] ^ SUB_MIX_2[(s0 >>> 8) & 0xff] ^ SUB_MIX_3[s1 & 0xff] ^ keySchedule[ksRow++];
- var t3 = SUB_MIX_0[s3 >>> 24] ^ SUB_MIX_1[(s0 >>> 16) & 0xff] ^ SUB_MIX_2[(s1 >>> 8) & 0xff] ^ SUB_MIX_3[s2 & 0xff] ^ keySchedule[ksRow++];
-
- // Update state
- s0 = t0;
- s1 = t1;
- s2 = t2;
- s3 = t3;
- }
-
- // Shift rows, sub bytes, add round key
- var t0 = ((SBOX[s0 >>> 24] << 24) | (SBOX[(s1 >>> 16) & 0xff] << 16) | (SBOX[(s2 >>> 8) & 0xff] << 8) | SBOX[s3 & 0xff]) ^ keySchedule[ksRow++];
- var t1 = ((SBOX[s1 >>> 24] << 24) | (SBOX[(s2 >>> 16) & 0xff] << 16) | (SBOX[(s3 >>> 8) & 0xff] << 8) | SBOX[s0 & 0xff]) ^ keySchedule[ksRow++];
- var t2 = ((SBOX[s2 >>> 24] << 24) | (SBOX[(s3 >>> 16) & 0xff] << 16) | (SBOX[(s0 >>> 8) & 0xff] << 8) | SBOX[s1 & 0xff]) ^ keySchedule[ksRow++];
- var t3 = ((SBOX[s3 >>> 24] << 24) | (SBOX[(s0 >>> 16) & 0xff] << 16) | (SBOX[(s1 >>> 8) & 0xff] << 8) | SBOX[s2 & 0xff]) ^ keySchedule[ksRow++];
-
- // Set output
- M[offset] = t0;
- M[offset + 1] = t1;
- M[offset + 2] = t2;
- M[offset + 3] = t3;
- },
-
- keySize: 256/32
- });
-
- /**
- * Shortcut functions to the cipher's object interface.
- *
- * @example
- *
- * var ciphertext = CryptoJS.AES.encrypt(message, key, cfg);
- * var plaintext = CryptoJS.AES.decrypt(ciphertext, key, cfg);
- */
- C.AES = BlockCipher._createHelper(AES);
- }());
-
-
- return CryptoJS.AES;
-
-}));
-},{"./cipher-core":30,"./core":31,"./enc-base64":32,"./evpkdf":34,"./md5":39}],30:[function(_dereq_,module,exports){
-;(function (root, factory) {
- if (typeof exports === "object") {
- // CommonJS
- module.exports = exports = factory(_dereq_("./core"));
- }
- else if (typeof define === "function" && define.amd) {
- // AMD
- define(["./core"], factory);
- }
- else {
- // Global (browser)
- factory(root.CryptoJS);
- }
-}(this, function (CryptoJS) {
-
- /**
- * Cipher core components.
- */
- CryptoJS.lib.Cipher || (function (undefined) {
- // Shortcuts
- var C = CryptoJS;
- var C_lib = C.lib;
- var Base = C_lib.Base;
- var WordArray = C_lib.WordArray;
- var BufferedBlockAlgorithm = C_lib.BufferedBlockAlgorithm;
- var C_enc = C.enc;
- var Utf8 = C_enc.Utf8;
- var Base64 = C_enc.Base64;
- var C_algo = C.algo;
- var EvpKDF = C_algo.EvpKDF;
-
- /**
- * Abstract base cipher template.
- *
- * @property {number} keySize This cipher's key size. Default: 4 (128 bits)
- * @property {number} ivSize This cipher's IV size. Default: 4 (128 bits)
- * @property {number} _ENC_XFORM_MODE A constant representing encryption mode.
- * @property {number} _DEC_XFORM_MODE A constant representing decryption mode.
- */
- var Cipher = C_lib.Cipher = BufferedBlockAlgorithm.extend({
- /**
- * Configuration options.
- *
- * @property {WordArray} iv The IV to use for this operation.
- */
- cfg: Base.extend(),
-
- /**
- * Creates this cipher in encryption mode.
- *
- * @param {WordArray} key The key.
- * @param {Object} cfg (Optional) The configuration options to use for this operation.
- *
- * @return {Cipher} A cipher instance.
- *
- * @static
- *
- * @example
- *
- * var cipher = CryptoJS.algo.AES.createEncryptor(keyWordArray, { iv: ivWordArray });
- */
- createEncryptor: function (key, cfg) {
- return this.create(this._ENC_XFORM_MODE, key, cfg);
- },
-
- /**
- * Creates this cipher in decryption mode.
- *
- * @param {WordArray} key The key.
- * @param {Object} cfg (Optional) The configuration options to use for this operation.
- *
- * @return {Cipher} A cipher instance.
- *
- * @static
- *
- * @example
- *
- * var cipher = CryptoJS.algo.AES.createDecryptor(keyWordArray, { iv: ivWordArray });
- */
- createDecryptor: function (key, cfg) {
- return this.create(this._DEC_XFORM_MODE, key, cfg);
- },
-
- /**
- * Initializes a newly created cipher.
- *
- * @param {number} xformMode Either the encryption or decryption transormation mode constant.
- * @param {WordArray} key The key.
- * @param {Object} cfg (Optional) The configuration options to use for this operation.
- *
- * @example
- *
- * var cipher = CryptoJS.algo.AES.create(CryptoJS.algo.AES._ENC_XFORM_MODE, keyWordArray, { iv: ivWordArray });
- */
- init: function (xformMode, key, cfg) {
- // Apply config defaults
- this.cfg = this.cfg.extend(cfg);
-
- // Store transform mode and key
- this._xformMode = xformMode;
- this._key = key;
-
- // Set initial values
- this.reset();
- },
-
- /**
- * Resets this cipher to its initial state.
- *
- * @example
- *
- * cipher.reset();
- */
- reset: function () {
- // Reset data buffer
- BufferedBlockAlgorithm.reset.call(this);
-
- // Perform concrete-cipher logic
- this._doReset();
- },
-
- /**
- * Adds data to be encrypted or decrypted.
- *
- * @param {WordArray|string} dataUpdate The data to encrypt or decrypt.
- *
- * @return {WordArray} The data after processing.
- *
- * @example
- *
- * var encrypted = cipher.process('data');
- * var encrypted = cipher.process(wordArray);
- */
- process: function (dataUpdate) {
- // Append
- this._append(dataUpdate);
-
- // Process available blocks
- return this._process();
- },
-
- /**
- * Finalizes the encryption or decryption process.
- * Note that the finalize operation is effectively a destructive, read-once operation.
- *
- * @param {WordArray|string} dataUpdate The final data to encrypt or decrypt.
- *
- * @return {WordArray} The data after final processing.
- *
- * @example
- *
- * var encrypted = cipher.finalize();
- * var encrypted = cipher.finalize('data');
- * var encrypted = cipher.finalize(wordArray);
- */
- finalize: function (dataUpdate) {
- // Final data update
- if (dataUpdate) {
- this._append(dataUpdate);
- }
-
- // Perform concrete-cipher logic
- var finalProcessedData = this._doFinalize();
-
- return finalProcessedData;
- },
-
- keySize: 128/32,
-
- ivSize: 128/32,
-
- _ENC_XFORM_MODE: 1,
-
- _DEC_XFORM_MODE: 2,
-
- /**
- * Creates shortcut functions to a cipher's object interface.
- *
- * @param {Cipher} cipher The cipher to create a helper for.
- *
- * @return {Object} An object with encrypt and decrypt shortcut functions.
- *
- * @static
- *
- * @example
- *
- * var AES = CryptoJS.lib.Cipher._createHelper(CryptoJS.algo.AES);
- */
- _createHelper: (function () {
- function selectCipherStrategy(key) {
- if (typeof key == 'string') {
- return PasswordBasedCipher;
- } else {
- return SerializableCipher;
- }
- }
-
- return function (cipher) {
- return {
- encrypt: function (message, key, cfg) {
- return selectCipherStrategy(key).encrypt(cipher, message, key, cfg);
- },
-
- decrypt: function (ciphertext, key, cfg) {
- return selectCipherStrategy(key).decrypt(cipher, ciphertext, key, cfg);
- }
- };
- };
- }())
- });
-
- /**
- * Abstract base stream cipher template.
- *
- * @property {number} blockSize The number of 32-bit words this cipher operates on. Default: 1 (32 bits)
- */
- var StreamCipher = C_lib.StreamCipher = Cipher.extend({
- _doFinalize: function () {
- // Process partial blocks
- var finalProcessedBlocks = this._process(!!'flush');
-
- return finalProcessedBlocks;
- },
-
- blockSize: 1
- });
-
- /**
- * Mode namespace.
- */
- var C_mode = C.mode = {};
-
- /**
- * Abstract base block cipher mode template.
- */
- var BlockCipherMode = C_lib.BlockCipherMode = Base.extend({
- /**
- * Creates this mode for encryption.
- *
- * @param {Cipher} cipher A block cipher instance.
- * @param {Array} iv The IV words.
- *
- * @static
- *
- * @example
- *
- * var mode = CryptoJS.mode.CBC.createEncryptor(cipher, iv.words);
- */
- createEncryptor: function (cipher, iv) {
- return this.Encryptor.create(cipher, iv);
- },
-
- /**
- * Creates this mode for decryption.
- *
- * @param {Cipher} cipher A block cipher instance.
- * @param {Array} iv The IV words.
- *
- * @static
- *
- * @example
- *
- * var mode = CryptoJS.mode.CBC.createDecryptor(cipher, iv.words);
- */
- createDecryptor: function (cipher, iv) {
- return this.Decryptor.create(cipher, iv);
- },
-
- /**
- * Initializes a newly created mode.
- *
- * @param {Cipher} cipher A block cipher instance.
- * @param {Array} iv The IV words.
- *
- * @example
- *
- * var mode = CryptoJS.mode.CBC.Encryptor.create(cipher, iv.words);
- */
- init: function (cipher, iv) {
- this._cipher = cipher;
- this._iv = iv;
- }
- });
-
- /**
- * Cipher Block Chaining mode.
- */
- var CBC = C_mode.CBC = (function () {
- /**
- * Abstract base CBC mode.
- */
- var CBC = BlockCipherMode.extend();
-
- /**
- * CBC encryptor.
- */
- CBC.Encryptor = CBC.extend({
- /**
- * Processes the data block at offset.
- *
- * @param {Array} words The data words to operate on.
- * @param {number} offset The offset where the block starts.
- *
- * @example
- *
- * mode.processBlock(data.words, offset);
- */
- processBlock: function (words, offset) {
- // Shortcuts
- var cipher = this._cipher;
- var blockSize = cipher.blockSize;
-
- // XOR and encrypt
- xorBlock.call(this, words, offset, blockSize);
- cipher.encryptBlock(words, offset);
-
- // Remember this block to use with next block
- this._prevBlock = words.slice(offset, offset + blockSize);
- }
- });
-
- /**
- * CBC decryptor.
- */
- CBC.Decryptor = CBC.extend({
- /**
- * Processes the data block at offset.
- *
- * @param {Array} words The data words to operate on.
- * @param {number} offset The offset where the block starts.
- *
- * @example
- *
- * mode.processBlock(data.words, offset);
- */
- processBlock: function (words, offset) {
- // Shortcuts
- var cipher = this._cipher;
- var blockSize = cipher.blockSize;
-
- // Remember this block to use with next block
- var thisBlock = words.slice(offset, offset + blockSize);
-
- // Decrypt and XOR
- cipher.decryptBlock(words, offset);
- xorBlock.call(this, words, offset, blockSize);
-
- // This block becomes the previous block
- this._prevBlock = thisBlock;
- }
- });
-
- function xorBlock(words, offset, blockSize) {
- // Shortcut
- var iv = this._iv;
-
- // Choose mixing block
- if (iv) {
- var block = iv;
-
- // Remove IV for subsequent blocks
- this._iv = undefined;
- } else {
- var block = this._prevBlock;
- }
-
- // XOR blocks
- for (var i = 0; i < blockSize; i++) {
- words[offset + i] ^= block[i];
- }
- }
-
- return CBC;
- }());
-
- /**
- * Padding namespace.
- */
- var C_pad = C.pad = {};
-
- /**
- * PKCS #5/7 padding strategy.
- */
- var Pkcs7 = C_pad.Pkcs7 = {
- /**
- * Pads data using the algorithm defined in PKCS #5/7.
- *
- * @param {WordArray} data The data to pad.
- * @param {number} blockSize The multiple that the data should be padded to.
- *
- * @static
- *
- * @example
- *
- * CryptoJS.pad.Pkcs7.pad(wordArray, 4);
- */
- pad: function (data, blockSize) {
- // Shortcut
- var blockSizeBytes = blockSize * 4;
-
- // Count padding bytes
- var nPaddingBytes = blockSizeBytes - data.sigBytes % blockSizeBytes;
-
- // Create padding word
- var paddingWord = (nPaddingBytes << 24) | (nPaddingBytes << 16) | (nPaddingBytes << 8) | nPaddingBytes;
-
- // Create padding
- var paddingWords = [];
- for (var i = 0; i < nPaddingBytes; i += 4) {
- paddingWords.push(paddingWord);
- }
- var padding = WordArray.create(paddingWords, nPaddingBytes);
-
- // Add padding
- data.concat(padding);
- },
-
- /**
- * Unpads data that had been padded using the algorithm defined in PKCS #5/7.
- *
- * @param {WordArray} data The data to unpad.
- *
- * @static
- *
- * @example
- *
- * CryptoJS.pad.Pkcs7.unpad(wordArray);
- */
- unpad: function (data) {
- // Get number of padding bytes from last byte
- var nPaddingBytes = data.words[(data.sigBytes - 1) >>> 2] & 0xff;
-
- // Remove padding
- data.sigBytes -= nPaddingBytes;
- }
- };
-
- /**
- * Abstract base block cipher template.
- *
- * @property {number} blockSize The number of 32-bit words this cipher operates on. Default: 4 (128 bits)
- */
- var BlockCipher = C_lib.BlockCipher = Cipher.extend({
- /**
- * Configuration options.
- *
- * @property {Mode} mode The block mode to use. Default: CBC
- * @property {Padding} padding The padding strategy to use. Default: Pkcs7
- */
- cfg: Cipher.cfg.extend({
- mode: CBC,
- padding: Pkcs7
- }),
-
- reset: function () {
- // Reset cipher
- Cipher.reset.call(this);
-
- // Shortcuts
- var cfg = this.cfg;
- var iv = cfg.iv;
- var mode = cfg.mode;
-
- // Reset block mode
- if (this._xformMode == this._ENC_XFORM_MODE) {
- var modeCreator = mode.createEncryptor;
- } else /* if (this._xformMode == this._DEC_XFORM_MODE) */ {
- var modeCreator = mode.createDecryptor;
-
- // Keep at least one block in the buffer for unpadding
- this._minBufferSize = 1;
- }
- this._mode = modeCreator.call(mode, this, iv && iv.words);
- },
-
- _doProcessBlock: function (words, offset) {
- this._mode.processBlock(words, offset);
- },
-
- _doFinalize: function () {
- // Shortcut
- var padding = this.cfg.padding;
-
- // Finalize
- if (this._xformMode == this._ENC_XFORM_MODE) {
- // Pad data
- padding.pad(this._data, this.blockSize);
-
- // Process final blocks
- var finalProcessedBlocks = this._process(!!'flush');
- } else /* if (this._xformMode == this._DEC_XFORM_MODE) */ {
- // Process final blocks
- var finalProcessedBlocks = this._process(!!'flush');
-
- // Unpad data
- padding.unpad(finalProcessedBlocks);
- }
-
- return finalProcessedBlocks;
- },
-
- blockSize: 128/32
- });
-
- /**
- * A collection of cipher parameters.
- *
- * @property {WordArray} ciphertext The raw ciphertext.
- * @property {WordArray} key The key to this ciphertext.
- * @property {WordArray} iv The IV used in the ciphering operation.
- * @property {WordArray} salt The salt used with a key derivation function.
- * @property {Cipher} algorithm The cipher algorithm.
- * @property {Mode} mode The block mode used in the ciphering operation.
- * @property {Padding} padding The padding scheme used in the ciphering operation.
- * @property {number} blockSize The block size of the cipher.
- * @property {Format} formatter The default formatting strategy to convert this cipher params object to a string.
- */
- var CipherParams = C_lib.CipherParams = Base.extend({
- /**
- * Initializes a newly created cipher params object.
- *
- * @param {Object} cipherParams An object with any of the possible cipher parameters.
- *
- * @example
- *
- * var cipherParams = CryptoJS.lib.CipherParams.create({
- * ciphertext: ciphertextWordArray,
- * key: keyWordArray,
- * iv: ivWordArray,
- * salt: saltWordArray,
- * algorithm: CryptoJS.algo.AES,
- * mode: CryptoJS.mode.CBC,
- * padding: CryptoJS.pad.PKCS7,
- * blockSize: 4,
- * formatter: CryptoJS.format.OpenSSL
- * });
- */
- init: function (cipherParams) {
- this.mixIn(cipherParams);
- },
-
- /**
- * Converts this cipher params object to a string.
- *
- * @param {Format} formatter (Optional) The formatting strategy to use.
- *
- * @return {string} The stringified cipher params.
- *
- * @throws Error If neither the formatter nor the default formatter is set.
- *
- * @example
- *
- * var string = cipherParams + '';
- * var string = cipherParams.toString();
- * var string = cipherParams.toString(CryptoJS.format.OpenSSL);
- */
- toString: function (formatter) {
- return (formatter || this.formatter).stringify(this);
- }
- });
-
- /**
- * Format namespace.
- */
- var C_format = C.format = {};
-
- /**
- * OpenSSL formatting strategy.
- */
- var OpenSSLFormatter = C_format.OpenSSL = {
- /**
- * Converts a cipher params object to an OpenSSL-compatible string.
- *
- * @param {CipherParams} cipherParams The cipher params object.
- *
- * @return {string} The OpenSSL-compatible string.
- *
- * @static
- *
- * @example
- *
- * var openSSLString = CryptoJS.format.OpenSSL.stringify(cipherParams);
- */
- stringify: function (cipherParams) {
- // Shortcuts
- var ciphertext = cipherParams.ciphertext;
- var salt = cipherParams.salt;
-
- // Format
- if (salt) {
- var wordArray = WordArray.create([0x53616c74, 0x65645f5f]).concat(salt).concat(ciphertext);
- } else {
- var wordArray = ciphertext;
- }
-
- return wordArray.toString(Base64);
- },
-
- /**
- * Converts an OpenSSL-compatible string to a cipher params object.
- *
- * @param {string} openSSLStr The OpenSSL-compatible string.
- *
- * @return {CipherParams} The cipher params object.
- *
- * @static
- *
- * @example
- *
- * var cipherParams = CryptoJS.format.OpenSSL.parse(openSSLString);
- */
- parse: function (openSSLStr) {
- // Parse base64
- var ciphertext = Base64.parse(openSSLStr);
-
- // Shortcut
- var ciphertextWords = ciphertext.words;
-
- // Test for salt
- if (ciphertextWords[0] == 0x53616c74 && ciphertextWords[1] == 0x65645f5f) {
- // Extract salt
- var salt = WordArray.create(ciphertextWords.slice(2, 4));
-
- // Remove salt from ciphertext
- ciphertextWords.splice(0, 4);
- ciphertext.sigBytes -= 16;
- }
-
- return CipherParams.create({ ciphertext: ciphertext, salt: salt });
- }
- };
-
- /**
- * A cipher wrapper that returns ciphertext as a serializable cipher params object.
- */
- var SerializableCipher = C_lib.SerializableCipher = Base.extend({
- /**
- * Configuration options.
- *
- * @property {Formatter} format The formatting strategy to convert cipher param objects to and from a string. Default: OpenSSL
- */
- cfg: Base.extend({
- format: OpenSSLFormatter
- }),
-
- /**
- * Encrypts a message.
- *
- * @param {Cipher} cipher The cipher algorithm to use.
- * @param {WordArray|string} message The message to encrypt.
- * @param {WordArray} key The key.
- * @param {Object} cfg (Optional) The configuration options to use for this operation.
- *
- * @return {CipherParams} A cipher params object.
- *
- * @static
- *
- * @example
- *
- * var ciphertextParams = CryptoJS.lib.SerializableCipher.encrypt(CryptoJS.algo.AES, message, key);
- * var ciphertextParams = CryptoJS.lib.SerializableCipher.encrypt(CryptoJS.algo.AES, message, key, { iv: iv });
- * var ciphertextParams = CryptoJS.lib.SerializableCipher.encrypt(CryptoJS.algo.AES, message, key, { iv: iv, format: CryptoJS.format.OpenSSL });
- */
- encrypt: function (cipher, message, key, cfg) {
- // Apply config defaults
- cfg = this.cfg.extend(cfg);
-
- // Encrypt
- var encryptor = cipher.createEncryptor(key, cfg);
- var ciphertext = encryptor.finalize(message);
-
- // Shortcut
- var cipherCfg = encryptor.cfg;
-
- // Create and return serializable cipher params
- return CipherParams.create({
- ciphertext: ciphertext,
- key: key,
- iv: cipherCfg.iv,
- algorithm: cipher,
- mode: cipherCfg.mode,
- padding: cipherCfg.padding,
- blockSize: cipher.blockSize,
- formatter: cfg.format
- });
- },
-
- /**
- * Decrypts serialized ciphertext.
- *
- * @param {Cipher} cipher The cipher algorithm to use.
- * @param {CipherParams|string} ciphertext The ciphertext to decrypt.
- * @param {WordArray} key The key.
- * @param {Object} cfg (Optional) The configuration options to use for this operation.
- *
- * @return {WordArray} The plaintext.
- *
- * @static
- *
- * @example
- *
- * var plaintext = CryptoJS.lib.SerializableCipher.decrypt(CryptoJS.algo.AES, formattedCiphertext, key, { iv: iv, format: CryptoJS.format.OpenSSL });
- * var plaintext = CryptoJS.lib.SerializableCipher.decrypt(CryptoJS.algo.AES, ciphertextParams, key, { iv: iv, format: CryptoJS.format.OpenSSL });
- */
- decrypt: function (cipher, ciphertext, key, cfg) {
- // Apply config defaults
- cfg = this.cfg.extend(cfg);
-
- // Convert string to CipherParams
- ciphertext = this._parse(ciphertext, cfg.format);
-
- // Decrypt
- var plaintext = cipher.createDecryptor(key, cfg).finalize(ciphertext.ciphertext);
-
- return plaintext;
- },
-
- /**
- * Converts serialized ciphertext to CipherParams,
- * else assumed CipherParams already and returns ciphertext unchanged.
- *
- * @param {CipherParams|string} ciphertext The ciphertext.
- * @param {Formatter} format The formatting strategy to use to parse serialized ciphertext.
- *
- * @return {CipherParams} The unserialized ciphertext.
- *
- * @static
- *
- * @example
- *
- * var ciphertextParams = CryptoJS.lib.SerializableCipher._parse(ciphertextStringOrParams, format);
- */
- _parse: function (ciphertext, format) {
- if (typeof ciphertext == 'string') {
- return format.parse(ciphertext, this);
- } else {
- return ciphertext;
- }
- }
- });
-
- /**
- * Key derivation function namespace.
- */
- var C_kdf = C.kdf = {};
-
- /**
- * OpenSSL key derivation function.
- */
- var OpenSSLKdf = C_kdf.OpenSSL = {
- /**
- * Derives a key and IV from a password.
- *
- * @param {string} password The password to derive from.
- * @param {number} keySize The size in words of the key to generate.
- * @param {number} ivSize The size in words of the IV to generate.
- * @param {WordArray|string} salt (Optional) A 64-bit salt to use. If omitted, a salt will be generated randomly.
- *
- * @return {CipherParams} A cipher params object with the key, IV, and salt.
- *
- * @static
- *
- * @example
- *
- * var derivedParams = CryptoJS.kdf.OpenSSL.execute('Password', 256/32, 128/32);
- * var derivedParams = CryptoJS.kdf.OpenSSL.execute('Password', 256/32, 128/32, 'saltsalt');
- */
- execute: function (password, keySize, ivSize, salt) {
- // Generate random salt
- if (!salt) {
- salt = WordArray.random(64/8);
- }
-
- // Derive key and IV
- var key = EvpKDF.create({ keySize: keySize + ivSize }).compute(password, salt);
-
- // Separate key and IV
- var iv = WordArray.create(key.words.slice(keySize), ivSize * 4);
- key.sigBytes = keySize * 4;
-
- // Return params
- return CipherParams.create({ key: key, iv: iv, salt: salt });
- }
- };
-
- /**
- * A serializable cipher wrapper that derives the key from a password,
- * and returns ciphertext as a serializable cipher params object.
- */
- var PasswordBasedCipher = C_lib.PasswordBasedCipher = SerializableCipher.extend({
- /**
- * Configuration options.
- *
- * @property {KDF} kdf The key derivation function to use to generate a key and IV from a password. Default: OpenSSL
- */
- cfg: SerializableCipher.cfg.extend({
- kdf: OpenSSLKdf
- }),
-
- /**
- * Encrypts a message using a password.
- *
- * @param {Cipher} cipher The cipher algorithm to use.
- * @param {WordArray|string} message The message to encrypt.
- * @param {string} password The password.
- * @param {Object} cfg (Optional) The configuration options to use for this operation.
- *
- * @return {CipherParams} A cipher params object.
- *
- * @static
- *
- * @example
- *
- * var ciphertextParams = CryptoJS.lib.PasswordBasedCipher.encrypt(CryptoJS.algo.AES, message, 'password');
- * var ciphertextParams = CryptoJS.lib.PasswordBasedCipher.encrypt(CryptoJS.algo.AES, message, 'password', { format: CryptoJS.format.OpenSSL });
- */
- encrypt: function (cipher, message, password, cfg) {
- // Apply config defaults
- cfg = this.cfg.extend(cfg);
-
- // Derive key and other params
- var derivedParams = cfg.kdf.execute(password, cipher.keySize, cipher.ivSize);
-
- // Add IV to config
- cfg.iv = derivedParams.iv;
-
- // Encrypt
- var ciphertext = SerializableCipher.encrypt.call(this, cipher, message, derivedParams.key, cfg);
-
- // Mix in derived params
- ciphertext.mixIn(derivedParams);
-
- return ciphertext;
- },
-
- /**
- * Decrypts serialized ciphertext using a password.
- *
- * @param {Cipher} cipher The cipher algorithm to use.
- * @param {CipherParams|string} ciphertext The ciphertext to decrypt.
- * @param {string} password The password.
- * @param {Object} cfg (Optional) The configuration options to use for this operation.
- *
- * @return {WordArray} The plaintext.
- *
- * @static
- *
- * @example
- *
- * var plaintext = CryptoJS.lib.PasswordBasedCipher.decrypt(CryptoJS.algo.AES, formattedCiphertext, 'password', { format: CryptoJS.format.OpenSSL });
- * var plaintext = CryptoJS.lib.PasswordBasedCipher.decrypt(CryptoJS.algo.AES, ciphertextParams, 'password', { format: CryptoJS.format.OpenSSL });
- */
- decrypt: function (cipher, ciphertext, password, cfg) {
- // Apply config defaults
- cfg = this.cfg.extend(cfg);
-
- // Convert string to CipherParams
- ciphertext = this._parse(ciphertext, cfg.format);
-
- // Derive key and other params
- var derivedParams = cfg.kdf.execute(password, cipher.keySize, cipher.ivSize, ciphertext.salt);
-
- // Add IV to config
- cfg.iv = derivedParams.iv;
-
- // Decrypt
- var plaintext = SerializableCipher.decrypt.call(this, cipher, ciphertext, derivedParams.key, cfg);
-
- return plaintext;
- }
- });
- }());
-
-
-}));
-},{"./core":31}],31:[function(_dereq_,module,exports){
-;(function (root, factory) {
- if (typeof exports === "object") {
- // CommonJS
- module.exports = exports = factory();
- }
- else if (typeof define === "function" && define.amd) {
- // AMD
- define([], factory);
- }
- else {
- // Global (browser)
- root.CryptoJS = factory();
- }
-}(this, function () {
-
- /**
- * CryptoJS core components.
- */
- var CryptoJS = CryptoJS || (function (Math, undefined) {
- /**
- * CryptoJS namespace.
- */
- var C = {};
-
- /**
- * Library namespace.
- */
- var C_lib = C.lib = {};
-
- /**
- * Base object for prototypal inheritance.
- */
- var Base = C_lib.Base = (function () {
- function F() {}
-
- return {
- /**
- * Creates a new object that inherits from this object.
- *
- * @param {Object} overrides Properties to copy into the new object.
- *
- * @return {Object} The new object.
- *
- * @static
- *
- * @example
- *
- * var MyType = CryptoJS.lib.Base.extend({
- * field: 'value',
- *
- * method: function () {
- * }
- * });
- */
- extend: function (overrides) {
- // Spawn
- F.prototype = this;
- var subtype = new F();
-
- // Augment
- if (overrides) {
- subtype.mixIn(overrides);
- }
-
- // Create default initializer
- if (!subtype.hasOwnProperty('init')) {
- subtype.init = function () {
- subtype.$super.init.apply(this, arguments);
- };
- }
-
- // Initializer's prototype is the subtype object
- subtype.init.prototype = subtype;
-
- // Reference supertype
- subtype.$super = this;
-
- return subtype;
- },
-
- /**
- * Extends this object and runs the init method.
- * Arguments to create() will be passed to init().
- *
- * @return {Object} The new object.
- *
- * @static
- *
- * @example
- *
- * var instance = MyType.create();
- */
- create: function () {
- var instance = this.extend();
- instance.init.apply(instance, arguments);
-
- return instance;
- },
-
- /**
- * Initializes a newly created object.
- * Override this method to add some logic when your objects are created.
- *
- * @example
- *
- * var MyType = CryptoJS.lib.Base.extend({
- * init: function () {
- * // ...
- * }
- * });
- */
- init: function () {
- },
-
- /**
- * Copies properties into this object.
- *
- * @param {Object} properties The properties to mix in.
- *
- * @example
- *
- * MyType.mixIn({
- * field: 'value'
- * });
- */
- mixIn: function (properties) {
- for (var propertyName in properties) {
- if (properties.hasOwnProperty(propertyName)) {
- this[propertyName] = properties[propertyName];
- }
- }
-
- // IE won't copy toString using the loop above
- if (properties.hasOwnProperty('toString')) {
- this.toString = properties.toString;
- }
- },
-
- /**
- * Creates a copy of this object.
- *
- * @return {Object} The clone.
- *
- * @example
- *
- * var clone = instance.clone();
- */
- clone: function () {
- return this.init.prototype.extend(this);
- }
- };
- }());
-
- /**
- * An array of 32-bit words.
- *
- * @property {Array} words The array of 32-bit words.
- * @property {number} sigBytes The number of significant bytes in this word array.
- */
- var WordArray = C_lib.WordArray = Base.extend({
- /**
- * Initializes a newly created word array.
- *
- * @param {Array} words (Optional) An array of 32-bit words.
- * @param {number} sigBytes (Optional) The number of significant bytes in the words.
- *
- * @example
- *
- * var wordArray = CryptoJS.lib.WordArray.create();
- * var wordArray = CryptoJS.lib.WordArray.create([0x00010203, 0x04050607]);
- * var wordArray = CryptoJS.lib.WordArray.create([0x00010203, 0x04050607], 6);
- */
- init: function (words, sigBytes) {
- words = this.words = words || [];
-
- if (sigBytes != undefined) {
- this.sigBytes = sigBytes;
- } else {
- this.sigBytes = words.length * 4;
- }
- },
-
- /**
- * Converts this word array to a string.
- *
- * @param {Encoder} encoder (Optional) The encoding strategy to use. Default: CryptoJS.enc.Hex
- *
- * @return {string} The stringified word array.
- *
- * @example
- *
- * var string = wordArray + '';
- * var string = wordArray.toString();
- * var string = wordArray.toString(CryptoJS.enc.Utf8);
- */
- toString: function (encoder) {
- return (encoder || Hex).stringify(this);
- },
-
- /**
- * Concatenates a word array to this word array.
- *
- * @param {WordArray} wordArray The word array to append.
- *
- * @return {WordArray} This word array.
- *
- * @example
- *
- * wordArray1.concat(wordArray2);
- */
- concat: function (wordArray) {
- // Shortcuts
- var thisWords = this.words;
- var thatWords = wordArray.words;
- var thisSigBytes = this.sigBytes;
- var thatSigBytes = wordArray.sigBytes;
-
- // Clamp excess bits
- this.clamp();
-
- // Concat
- if (thisSigBytes % 4) {
- // Copy one byte at a time
- for (var i = 0; i < thatSigBytes; i++) {
- var thatByte = (thatWords[i >>> 2] >>> (24 - (i % 4) * 8)) & 0xff;
- thisWords[(thisSigBytes + i) >>> 2] |= thatByte << (24 - ((thisSigBytes + i) % 4) * 8);
- }
- } else if (thatWords.length > 0xffff) {
- // Copy one word at a time
- for (var i = 0; i < thatSigBytes; i += 4) {
- thisWords[(thisSigBytes + i) >>> 2] = thatWords[i >>> 2];
- }
- } else {
- // Copy all words at once
- thisWords.push.apply(thisWords, thatWords);
- }
- this.sigBytes += thatSigBytes;
-
- // Chainable
- return this;
- },
-
- /**
- * Removes insignificant bits.
- *
- * @example
- *
- * wordArray.clamp();
- */
- clamp: function () {
- // Shortcuts
- var words = this.words;
- var sigBytes = this.sigBytes;
-
- // Clamp
- words[sigBytes >>> 2] &= 0xffffffff << (32 - (sigBytes % 4) * 8);
- words.length = Math.ceil(sigBytes / 4);
- },
-
- /**
- * Creates a copy of this word array.
- *
- * @return {WordArray} The clone.
- *
- * @example
- *
- * var clone = wordArray.clone();
- */
- clone: function () {
- var clone = Base.clone.call(this);
- clone.words = this.words.slice(0);
-
- return clone;
- },
-
- /**
- * Creates a word array filled with random bytes.
- *
- * @param {number} nBytes The number of random bytes to generate.
- *
- * @return {WordArray} The random word array.
- *
- * @static
- *
- * @example
- *
- * var wordArray = CryptoJS.lib.WordArray.random(16);
- */
- random: function (nBytes) {
- var words = [];
- for (var i = 0; i < nBytes; i += 4) {
- words.push((Math.random() * 0x100000000) | 0);
- }
-
- return new WordArray.init(words, nBytes);
- }
- });
-
- /**
- * Encoder namespace.
- */
- var C_enc = C.enc = {};
-
- /**
- * Hex encoding strategy.
- */
- var Hex = C_enc.Hex = {
- /**
- * Converts a word array to a hex string.
- *
- * @param {WordArray} wordArray The word array.
- *
- * @return {string} The hex string.
- *
- * @static
- *
- * @example
- *
- * var hexString = CryptoJS.enc.Hex.stringify(wordArray);
- */
- stringify: function (wordArray) {
- // Shortcuts
- var words = wordArray.words;
- var sigBytes = wordArray.sigBytes;
-
- // Convert
- var hexChars = [];
- for (var i = 0; i < sigBytes; i++) {
- var bite = (words[i >>> 2] >>> (24 - (i % 4) * 8)) & 0xff;
- hexChars.push((bite >>> 4).toString(16));
- hexChars.push((bite & 0x0f).toString(16));
- }
-
- return hexChars.join('');
- },
-
- /**
- * Converts a hex string to a word array.
- *
- * @param {string} hexStr The hex string.
- *
- * @return {WordArray} The word array.
- *
- * @static
- *
- * @example
- *
- * var wordArray = CryptoJS.enc.Hex.parse(hexString);
- */
- parse: function (hexStr) {
- // Shortcut
- var hexStrLength = hexStr.length;
-
- // Convert
- var words = [];
- for (var i = 0; i < hexStrLength; i += 2) {
- words[i >>> 3] |= parseInt(hexStr.substr(i, 2), 16) << (24 - (i % 8) * 4);
- }
-
- return new WordArray.init(words, hexStrLength / 2);
- }
- };
-
- /**
- * Latin1 encoding strategy.
- */
- var Latin1 = C_enc.Latin1 = {
- /**
- * Converts a word array to a Latin1 string.
- *
- * @param {WordArray} wordArray The word array.
- *
- * @return {string} The Latin1 string.
- *
- * @static
- *
- * @example
- *
- * var latin1String = CryptoJS.enc.Latin1.stringify(wordArray);
- */
- stringify: function (wordArray) {
- // Shortcuts
- var words = wordArray.words;
- var sigBytes = wordArray.sigBytes;
-
- // Convert
- var latin1Chars = [];
- for (var i = 0; i < sigBytes; i++) {
- var bite = (words[i >>> 2] >>> (24 - (i % 4) * 8)) & 0xff;
- latin1Chars.push(String.fromCharCode(bite));
- }
-
- return latin1Chars.join('');
- },
-
- /**
- * Converts a Latin1 string to a word array.
- *
- * @param {string} latin1Str The Latin1 string.
- *
- * @return {WordArray} The word array.
- *
- * @static
- *
- * @example
- *
- * var wordArray = CryptoJS.enc.Latin1.parse(latin1String);
- */
- parse: function (latin1Str) {
- // Shortcut
- var latin1StrLength = latin1Str.length;
-
- // Convert
- var words = [];
- for (var i = 0; i < latin1StrLength; i++) {
- words[i >>> 2] |= (latin1Str.charCodeAt(i) & 0xff) << (24 - (i % 4) * 8);
- }
-
- return new WordArray.init(words, latin1StrLength);
- }
- };
-
- /**
- * UTF-8 encoding strategy.
- */
- var Utf8 = C_enc.Utf8 = {
- /**
- * Converts a word array to a UTF-8 string.
- *
- * @param {WordArray} wordArray The word array.
- *
- * @return {string} The UTF-8 string.
- *
- * @static
- *
- * @example
- *
- * var utf8String = CryptoJS.enc.Utf8.stringify(wordArray);
- */
- stringify: function (wordArray) {
- try {
- return decodeURIComponent(escape(Latin1.stringify(wordArray)));
- } catch (e) {
- throw new Error('Malformed UTF-8 data');
- }
- },
-
- /**
- * Converts a UTF-8 string to a word array.
- *
- * @param {string} utf8Str The UTF-8 string.
- *
- * @return {WordArray} The word array.
- *
- * @static
- *
- * @example
- *
- * var wordArray = CryptoJS.enc.Utf8.parse(utf8String);
- */
- parse: function (utf8Str) {
- return Latin1.parse(unescape(encodeURIComponent(utf8Str)));
- }
- };
-
- /**
- * Abstract buffered block algorithm template.
- *
- * The property blockSize must be implemented in a concrete subtype.
- *
- * @property {number} _minBufferSize The number of blocks that should be kept unprocessed in the buffer. Default: 0
- */
- var BufferedBlockAlgorithm = C_lib.BufferedBlockAlgorithm = Base.extend({
- /**
- * Resets this block algorithm's data buffer to its initial state.
- *
- * @example
- *
- * bufferedBlockAlgorithm.reset();
- */
- reset: function () {
- // Initial values
- this._data = new WordArray.init();
- this._nDataBytes = 0;
- },
-
- /**
- * Adds new data to this block algorithm's buffer.
- *
- * @param {WordArray|string} data The data to append. Strings are converted to a WordArray using UTF-8.
- *
- * @example
- *
- * bufferedBlockAlgorithm._append('data');
- * bufferedBlockAlgorithm._append(wordArray);
- */
- _append: function (data) {
- // Convert string to WordArray, else assume WordArray already
- if (typeof data == 'string') {
- data = Utf8.parse(data);
- }
-
- // Append
- this._data.concat(data);
- this._nDataBytes += data.sigBytes;
- },
-
- /**
- * Processes available data blocks.
- *
- * This method invokes _doProcessBlock(offset), which must be implemented by a concrete subtype.
- *
- * @param {boolean} doFlush Whether all blocks and partial blocks should be processed.
- *
- * @return {WordArray} The processed data.
- *
- * @example
- *
- * var processedData = bufferedBlockAlgorithm._process();
- * var processedData = bufferedBlockAlgorithm._process(!!'flush');
- */
- _process: function (doFlush) {
- // Shortcuts
- var data = this._data;
- var dataWords = data.words;
- var dataSigBytes = data.sigBytes;
- var blockSize = this.blockSize;
- var blockSizeBytes = blockSize * 4;
-
- // Count blocks ready
- var nBlocksReady = dataSigBytes / blockSizeBytes;
- if (doFlush) {
- // Round up to include partial blocks
- nBlocksReady = Math.ceil(nBlocksReady);
- } else {
- // Round down to include only full blocks,
- // less the number of blocks that must remain in the buffer
- nBlocksReady = Math.max((nBlocksReady | 0) - this._minBufferSize, 0);
- }
-
- // Count words ready
- var nWordsReady = nBlocksReady * blockSize;
-
- // Count bytes ready
- var nBytesReady = Math.min(nWordsReady * 4, dataSigBytes);
-
- // Process blocks
- if (nWordsReady) {
- for (var offset = 0; offset < nWordsReady; offset += blockSize) {
- // Perform concrete-algorithm logic
- this._doProcessBlock(dataWords, offset);
- }
-
- // Remove processed words
- var processedWords = dataWords.splice(0, nWordsReady);
- data.sigBytes -= nBytesReady;
- }
-
- // Return processed words
- return new WordArray.init(processedWords, nBytesReady);
- },
-
- /**
- * Creates a copy of this object.
- *
- * @return {Object} The clone.
- *
- * @example
- *
- * var clone = bufferedBlockAlgorithm.clone();
- */
- clone: function () {
- var clone = Base.clone.call(this);
- clone._data = this._data.clone();
-
- return clone;
- },
-
- _minBufferSize: 0
- });
-
- /**
- * Abstract hasher template.
- *
- * @property {number} blockSize The number of 32-bit words this hasher operates on. Default: 16 (512 bits)
- */
- var Hasher = C_lib.Hasher = BufferedBlockAlgorithm.extend({
- /**
- * Configuration options.
- */
- cfg: Base.extend(),
-
- /**
- * Initializes a newly created hasher.
- *
- * @param {Object} cfg (Optional) The configuration options to use for this hash computation.
- *
- * @example
- *
- * var hasher = CryptoJS.algo.SHA256.create();
- */
- init: function (cfg) {
- // Apply config defaults
- this.cfg = this.cfg.extend(cfg);
-
- // Set initial values
- this.reset();
- },
-
- /**
- * Resets this hasher to its initial state.
- *
- * @example
- *
- * hasher.reset();
- */
- reset: function () {
- // Reset data buffer
- BufferedBlockAlgorithm.reset.call(this);
-
- // Perform concrete-hasher logic
- this._doReset();
- },
-
- /**
- * Updates this hasher with a message.
- *
- * @param {WordArray|string} messageUpdate The message to append.
- *
- * @return {Hasher} This hasher.
- *
- * @example
- *
- * hasher.update('message');
- * hasher.update(wordArray);
- */
- update: function (messageUpdate) {
- // Append
- this._append(messageUpdate);
-
- // Update the hash
- this._process();
-
- // Chainable
- return this;
- },
-
- /**
- * Finalizes the hash computation.
- * Note that the finalize operation is effectively a destructive, read-once operation.
- *
- * @param {WordArray|string} messageUpdate (Optional) A final message update.
- *
- * @return {WordArray} The hash.
- *
- * @example
- *
- * var hash = hasher.finalize();
- * var hash = hasher.finalize('message');
- * var hash = hasher.finalize(wordArray);
- */
- finalize: function (messageUpdate) {
- // Final message update
- if (messageUpdate) {
- this._append(messageUpdate);
- }
-
- // Perform concrete-hasher logic
- var hash = this._doFinalize();
-
- return hash;
- },
-
- blockSize: 512/32,
-
- /**
- * Creates a shortcut function to a hasher's object interface.
- *
- * @param {Hasher} hasher The hasher to create a helper for.
- *
- * @return {Function} The shortcut function.
- *
- * @static
- *
- * @example
- *
- * var SHA256 = CryptoJS.lib.Hasher._createHelper(CryptoJS.algo.SHA256);
- */
- _createHelper: function (hasher) {
- return function (message, cfg) {
- return new hasher.init(cfg).finalize(message);
- };
- },
-
- /**
- * Creates a shortcut function to the HMAC's object interface.
- *
- * @param {Hasher} hasher The hasher to use in this HMAC helper.
- *
- * @return {Function} The shortcut function.
- *
- * @static
- *
- * @example
- *
- * var HmacSHA256 = CryptoJS.lib.Hasher._createHmacHelper(CryptoJS.algo.SHA256);
- */
- _createHmacHelper: function (hasher) {
- return function (message, key) {
- return new C_algo.HMAC.init(hasher, key).finalize(message);
- };
- }
- });
-
- /**
- * Algorithm namespace.
- */
- var C_algo = C.algo = {};
-
- return C;
- }(Math));
-
-
- return CryptoJS;
-
-}));
-},{}],32:[function(_dereq_,module,exports){
-;(function (root, factory) {
- if (typeof exports === "object") {
- // CommonJS
- module.exports = exports = factory(_dereq_("./core"));
- }
- else if (typeof define === "function" && define.amd) {
- // AMD
- define(["./core"], factory);
- }
- else {
- // Global (browser)
- factory(root.CryptoJS);
- }
-}(this, function (CryptoJS) {
-
- (function () {
- // Shortcuts
- var C = CryptoJS;
- var C_lib = C.lib;
- var WordArray = C_lib.WordArray;
- var C_enc = C.enc;
-
- /**
- * Base64 encoding strategy.
- */
- var Base64 = C_enc.Base64 = {
- /**
- * Converts a word array to a Base64 string.
- *
- * @param {WordArray} wordArray The word array.
- *
- * @return {string} The Base64 string.
- *
- * @static
- *
- * @example
- *
- * var base64String = CryptoJS.enc.Base64.stringify(wordArray);
- */
- stringify: function (wordArray) {
- // Shortcuts
- var words = wordArray.words;
- var sigBytes = wordArray.sigBytes;
- var map = this._map;
-
- // Clamp excess bits
- wordArray.clamp();
-
- // Convert
- var base64Chars = [];
- for (var i = 0; i < sigBytes; i += 3) {
- var byte1 = (words[i >>> 2] >>> (24 - (i % 4) * 8)) & 0xff;
- var byte2 = (words[(i + 1) >>> 2] >>> (24 - ((i + 1) % 4) * 8)) & 0xff;
- var byte3 = (words[(i + 2) >>> 2] >>> (24 - ((i + 2) % 4) * 8)) & 0xff;
-
- var triplet = (byte1 << 16) | (byte2 << 8) | byte3;
-
- for (var j = 0; (j < 4) && (i + j * 0.75 < sigBytes); j++) {
- base64Chars.push(map.charAt((triplet >>> (6 * (3 - j))) & 0x3f));
- }
- }
-
- // Add padding
- var paddingChar = map.charAt(64);
- if (paddingChar) {
- while (base64Chars.length % 4) {
- base64Chars.push(paddingChar);
- }
- }
-
- return base64Chars.join('');
- },
-
- /**
- * Converts a Base64 string to a word array.
- *
- * @param {string} base64Str The Base64 string.
- *
- * @return {WordArray} The word array.
- *
- * @static
- *
- * @example
- *
- * var wordArray = CryptoJS.enc.Base64.parse(base64String);
- */
- parse: function (base64Str) {
- // Shortcuts
- var base64StrLength = base64Str.length;
- var map = this._map;
-
- // Ignore padding
- var paddingChar = map.charAt(64);
- if (paddingChar) {
- var paddingIndex = base64Str.indexOf(paddingChar);
- if (paddingIndex != -1) {
- base64StrLength = paddingIndex;
- }
- }
-
- // Convert
- var words = [];
- var nBytes = 0;
- for (var i = 0; i < base64StrLength; i++) {
- if (i % 4) {
- var bits1 = map.indexOf(base64Str.charAt(i - 1)) << ((i % 4) * 2);
- var bits2 = map.indexOf(base64Str.charAt(i)) >>> (6 - (i % 4) * 2);
- words[nBytes >>> 2] |= (bits1 | bits2) << (24 - (nBytes % 4) * 8);
- nBytes++;
- }
- }
-
- return WordArray.create(words, nBytes);
- },
-
- _map: 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/='
- };
- }());
-
-
- return CryptoJS.enc.Base64;
-
-}));
-},{"./core":31}],33:[function(_dereq_,module,exports){
-;(function (root, factory) {
- if (typeof exports === "object") {
- // CommonJS
- module.exports = exports = factory(_dereq_("./core"));
- }
- else if (typeof define === "function" && define.amd) {
- // AMD
- define(["./core"], factory);
- }
- else {
- // Global (browser)
- factory(root.CryptoJS);
- }
-}(this, function (CryptoJS) {
-
- (function () {
- // Shortcuts
- var C = CryptoJS;
- var C_lib = C.lib;
- var WordArray = C_lib.WordArray;
- var C_enc = C.enc;
-
- /**
- * UTF-16 BE encoding strategy.
- */
- var Utf16BE = C_enc.Utf16 = C_enc.Utf16BE = {
- /**
- * Converts a word array to a UTF-16 BE string.
- *
- * @param {WordArray} wordArray The word array.
- *
- * @return {string} The UTF-16 BE string.
- *
- * @static
- *
- * @example
- *
- * var utf16String = CryptoJS.enc.Utf16.stringify(wordArray);
- */
- stringify: function (wordArray) {
- // Shortcuts
- var words = wordArray.words;
- var sigBytes = wordArray.sigBytes;
-
- // Convert
- var utf16Chars = [];
- for (var i = 0; i < sigBytes; i += 2) {
- var codePoint = (words[i >>> 2] >>> (16 - (i % 4) * 8)) & 0xffff;
- utf16Chars.push(String.fromCharCode(codePoint));
- }
-
- return utf16Chars.join('');
- },
-
- /**
- * Converts a UTF-16 BE string to a word array.
- *
- * @param {string} utf16Str The UTF-16 BE string.
- *
- * @return {WordArray} The word array.
- *
- * @static
- *
- * @example
- *
- * var wordArray = CryptoJS.enc.Utf16.parse(utf16String);
- */
- parse: function (utf16Str) {
- // Shortcut
- var utf16StrLength = utf16Str.length;
-
- // Convert
- var words = [];
- for (var i = 0; i < utf16StrLength; i++) {
- words[i >>> 1] |= utf16Str.charCodeAt(i) << (16 - (i % 2) * 16);
- }
-
- return WordArray.create(words, utf16StrLength * 2);
- }
- };
-
- /**
- * UTF-16 LE encoding strategy.
- */
- C_enc.Utf16LE = {
- /**
- * Converts a word array to a UTF-16 LE string.
- *
- * @param {WordArray} wordArray The word array.
- *
- * @return {string} The UTF-16 LE string.
- *
- * @static
- *
- * @example
- *
- * var utf16Str = CryptoJS.enc.Utf16LE.stringify(wordArray);
- */
- stringify: function (wordArray) {
- // Shortcuts
- var words = wordArray.words;
- var sigBytes = wordArray.sigBytes;
-
- // Convert
- var utf16Chars = [];
- for (var i = 0; i < sigBytes; i += 2) {
- var codePoint = swapEndian((words[i >>> 2] >>> (16 - (i % 4) * 8)) & 0xffff);
- utf16Chars.push(String.fromCharCode(codePoint));
- }
-
- return utf16Chars.join('');
- },
-
- /**
- * Converts a UTF-16 LE string to a word array.
- *
- * @param {string} utf16Str The UTF-16 LE string.
- *
- * @return {WordArray} The word array.
- *
- * @static
- *
- * @example
- *
- * var wordArray = CryptoJS.enc.Utf16LE.parse(utf16Str);
- */
- parse: function (utf16Str) {
- // Shortcut
- var utf16StrLength = utf16Str.length;
-
- // Convert
- var words = [];
- for (var i = 0; i < utf16StrLength; i++) {
- words[i >>> 1] |= swapEndian(utf16Str.charCodeAt(i) << (16 - (i % 2) * 16));
- }
-
- return WordArray.create(words, utf16StrLength * 2);
- }
- };
-
- function swapEndian(word) {
- return ((word << 8) & 0xff00ff00) | ((word >>> 8) & 0x00ff00ff);
- }
- }());
-
-
- return CryptoJS.enc.Utf16;
-
-}));
-},{"./core":31}],34:[function(_dereq_,module,exports){
-;(function (root, factory, undef) {
- if (typeof exports === "object") {
- // CommonJS
- module.exports = exports = factory(_dereq_("./core"), _dereq_("./sha1"), _dereq_("./hmac"));
- }
- else if (typeof define === "function" && define.amd) {
- // AMD
- define(["./core", "./sha1", "./hmac"], factory);
- }
- else {
- // Global (browser)
- factory(root.CryptoJS);
- }
-}(this, function (CryptoJS) {
-
- (function () {
- // Shortcuts
- var C = CryptoJS;
- var C_lib = C.lib;
- var Base = C_lib.Base;
- var WordArray = C_lib.WordArray;
- var C_algo = C.algo;
- var MD5 = C_algo.MD5;
-
- /**
- * This key derivation function is meant to conform with EVP_BytesToKey.
- * www.openssl.org/docs/crypto/EVP_BytesToKey.html
- */
- var EvpKDF = C_algo.EvpKDF = Base.extend({
- /**
- * Configuration options.
- *
- * @property {number} keySize The key size in words to generate. Default: 4 (128 bits)
- * @property {Hasher} hasher The hash algorithm to use. Default: MD5
- * @property {number} iterations The number of iterations to perform. Default: 1
- */
- cfg: Base.extend({
- keySize: 128/32,
- hasher: MD5,
- iterations: 1
- }),
-
- /**
- * Initializes a newly created key derivation function.
- *
- * @param {Object} cfg (Optional) The configuration options to use for the derivation.
- *
- * @example
- *
- * var kdf = CryptoJS.algo.EvpKDF.create();
- * var kdf = CryptoJS.algo.EvpKDF.create({ keySize: 8 });
- * var kdf = CryptoJS.algo.EvpKDF.create({ keySize: 8, iterations: 1000 });
- */
- init: function (cfg) {
- this.cfg = this.cfg.extend(cfg);
- },
-
- /**
- * Derives a key from a password.
- *
- * @param {WordArray|string} password The password.
- * @param {WordArray|string} salt A salt.
- *
- * @return {WordArray} The derived key.
- *
- * @example
- *
- * var key = kdf.compute(password, salt);
- */
- compute: function (password, salt) {
- // Shortcut
- var cfg = this.cfg;
-
- // Init hasher
- var hasher = cfg.hasher.create();
-
- // Initial values
- var derivedKey = WordArray.create();
-
- // Shortcuts
- var derivedKeyWords = derivedKey.words;
- var keySize = cfg.keySize;
- var iterations = cfg.iterations;
-
- // Generate key
- while (derivedKeyWords.length < keySize) {
- if (block) {
- hasher.update(block);
- }
- var block = hasher.update(password).finalize(salt);
- hasher.reset();
-
- // Iterations
- for (var i = 1; i < iterations; i++) {
- block = hasher.finalize(block);
- hasher.reset();
- }
-
- derivedKey.concat(block);
- }
- derivedKey.sigBytes = keySize * 4;
-
- return derivedKey;
- }
- });
-
- /**
- * Derives a key from a password.
- *
- * @param {WordArray|string} password The password.
- * @param {WordArray|string} salt A salt.
- * @param {Object} cfg (Optional) The configuration options to use for this computation.
- *
- * @return {WordArray} The derived key.
- *
- * @static
- *
- * @example
- *
- * var key = CryptoJS.EvpKDF(password, salt);
- * var key = CryptoJS.EvpKDF(password, salt, { keySize: 8 });
- * var key = CryptoJS.EvpKDF(password, salt, { keySize: 8, iterations: 1000 });
- */
- C.EvpKDF = function (password, salt, cfg) {
- return EvpKDF.create(cfg).compute(password, salt);
- };
- }());
-
-
- return CryptoJS.EvpKDF;
-
-}));
-},{"./core":31,"./hmac":36,"./sha1":55}],35:[function(_dereq_,module,exports){
-;(function (root, factory, undef) {
- if (typeof exports === "object") {
- // CommonJS
- module.exports = exports = factory(_dereq_("./core"), _dereq_("./cipher-core"));
- }
- else if (typeof define === "function" && define.amd) {
- // AMD
- define(["./core", "./cipher-core"], factory);
- }
- else {
- // Global (browser)
- factory(root.CryptoJS);
- }
-}(this, function (CryptoJS) {
-
- (function (undefined) {
- // Shortcuts
- var C = CryptoJS;
- var C_lib = C.lib;
- var CipherParams = C_lib.CipherParams;
- var C_enc = C.enc;
- var Hex = C_enc.Hex;
- var C_format = C.format;
-
- var HexFormatter = C_format.Hex = {
- /**
- * Converts the ciphertext of a cipher params object to a hexadecimally encoded string.
- *
- * @param {CipherParams} cipherParams The cipher params object.
- *
- * @return {string} The hexadecimally encoded string.
- *
- * @static
- *
- * @example
- *
- * var hexString = CryptoJS.format.Hex.stringify(cipherParams);
- */
- stringify: function (cipherParams) {
- return cipherParams.ciphertext.toString(Hex);
- },
-
- /**
- * Converts a hexadecimally encoded ciphertext string to a cipher params object.
- *
- * @param {string} input The hexadecimally encoded string.
- *
- * @return {CipherParams} The cipher params object.
- *
- * @static
- *
- * @example
- *
- * var cipherParams = CryptoJS.format.Hex.parse(hexString);
- */
- parse: function (input) {
- var ciphertext = Hex.parse(input);
- return CipherParams.create({ ciphertext: ciphertext });
- }
- };
- }());
-
-
- return CryptoJS.format.Hex;
-
-}));
-},{"./cipher-core":30,"./core":31}],36:[function(_dereq_,module,exports){
-;(function (root, factory) {
- if (typeof exports === "object") {
- // CommonJS
- module.exports = exports = factory(_dereq_("./core"));
- }
- else if (typeof define === "function" && define.amd) {
- // AMD
- define(["./core"], factory);
- }
- else {
- // Global (browser)
- factory(root.CryptoJS);
- }
-}(this, function (CryptoJS) {
-
- (function () {
- // Shortcuts
- var C = CryptoJS;
- var C_lib = C.lib;
- var Base = C_lib.Base;
- var C_enc = C.enc;
- var Utf8 = C_enc.Utf8;
- var C_algo = C.algo;
-
- /**
- * HMAC algorithm.
- */
- var HMAC = C_algo.HMAC = Base.extend({
- /**
- * Initializes a newly created HMAC.
- *
- * @param {Hasher} hasher The hash algorithm to use.
- * @param {WordArray|string} key The secret key.
- *
- * @example
- *
- * var hmacHasher = CryptoJS.algo.HMAC.create(CryptoJS.algo.SHA256, key);
- */
- init: function (hasher, key) {
- // Init hasher
- hasher = this._hasher = new hasher.init();
-
- // Convert string to WordArray, else assume WordArray already
- if (typeof key == 'string') {
- key = Utf8.parse(key);
- }
-
- // Shortcuts
- var hasherBlockSize = hasher.blockSize;
- var hasherBlockSizeBytes = hasherBlockSize * 4;
-
- // Allow arbitrary length keys
- if (key.sigBytes > hasherBlockSizeBytes) {
- key = hasher.finalize(key);
- }
-
- // Clamp excess bits
- key.clamp();
-
- // Clone key for inner and outer pads
- var oKey = this._oKey = key.clone();
- var iKey = this._iKey = key.clone();
-
- // Shortcuts
- var oKeyWords = oKey.words;
- var iKeyWords = iKey.words;
-
- // XOR keys with pad constants
- for (var i = 0; i < hasherBlockSize; i++) {
- oKeyWords[i] ^= 0x5c5c5c5c;
- iKeyWords[i] ^= 0x36363636;
- }
- oKey.sigBytes = iKey.sigBytes = hasherBlockSizeBytes;
-
- // Set initial values
- this.reset();
- },
-
- /**
- * Resets this HMAC to its initial state.
- *
- * @example
- *
- * hmacHasher.reset();
- */
- reset: function () {
- // Shortcut
- var hasher = this._hasher;
-
- // Reset
- hasher.reset();
- hasher.update(this._iKey);
- },
-
- /**
- * Updates this HMAC with a message.
- *
- * @param {WordArray|string} messageUpdate The message to append.
- *
- * @return {HMAC} This HMAC instance.
- *
- * @example
- *
- * hmacHasher.update('message');
- * hmacHasher.update(wordArray);
- */
- update: function (messageUpdate) {
- this._hasher.update(messageUpdate);
-
- // Chainable
- return this;
- },
-
- /**
- * Finalizes the HMAC computation.
- * Note that the finalize operation is effectively a destructive, read-once operation.
- *
- * @param {WordArray|string} messageUpdate (Optional) A final message update.
- *
- * @return {WordArray} The HMAC.
- *
- * @example
- *
- * var hmac = hmacHasher.finalize();
- * var hmac = hmacHasher.finalize('message');
- * var hmac = hmacHasher.finalize(wordArray);
- */
- finalize: function (messageUpdate) {
- // Shortcut
- var hasher = this._hasher;
-
- // Compute HMAC
- var innerHash = hasher.finalize(messageUpdate);
- hasher.reset();
- var hmac = hasher.finalize(this._oKey.clone().concat(innerHash));
-
- return hmac;
- }
- });
- }());
-
-
-}));
-},{"./core":31}],37:[function(_dereq_,module,exports){
-;(function (root, factory, undef) {
- if (typeof exports === "object") {
- // CommonJS
- module.exports = exports = factory(_dereq_("./core"), _dereq_("./x64-core"), _dereq_("./lib-typedarrays"), _dereq_("./enc-utf16"), _dereq_("./enc-base64"), _dereq_("./md5"), _dereq_("./sha1"), _dereq_("./sha256"), _dereq_("./sha224"), _dereq_("./sha512"), _dereq_("./sha384"), _dereq_("./sha3"), _dereq_("./ripemd160"), _dereq_("./hmac"), _dereq_("./pbkdf2"), _dereq_("./evpkdf"), _dereq_("./cipher-core"), _dereq_("./mode-cfb"), _dereq_("./mode-ctr"), _dereq_("./mode-ctr-gladman"), _dereq_("./mode-ofb"), _dereq_("./mode-ecb"), _dereq_("./pad-ansix923"), _dereq_("./pad-iso10126"), _dereq_("./pad-iso97971"), _dereq_("./pad-zeropadding"), _dereq_("./pad-nopadding"), _dereq_("./format-hex"), _dereq_("./aes"), _dereq_("./tripledes"), _dereq_("./rc4"), _dereq_("./rabbit"), _dereq_("./rabbit-legacy"));
- }
- else if (typeof define === "function" && define.amd) {
- // AMD
- define(["./core", "./x64-core", "./lib-typedarrays", "./enc-utf16", "./enc-base64", "./md5", "./sha1", "./sha256", "./sha224", "./sha512", "./sha384", "./sha3", "./ripemd160", "./hmac", "./pbkdf2", "./evpkdf", "./cipher-core", "./mode-cfb", "./mode-ctr", "./mode-ctr-gladman", "./mode-ofb", "./mode-ecb", "./pad-ansix923", "./pad-iso10126", "./pad-iso97971", "./pad-zeropadding", "./pad-nopadding", "./format-hex", "./aes", "./tripledes", "./rc4", "./rabbit", "./rabbit-legacy"], factory);
- }
- else {
- // Global (browser)
- factory(root.CryptoJS);
- }
-}(this, function (CryptoJS) {
+ // a flag to see when we're in the middle of a write.
+ this.writing = false;
- return CryptoJS;
+ // when true all writes will be buffered until .uncork() call
+ this.corked = 0;
-}));
-},{"./aes":29,"./cipher-core":30,"./core":31,"./enc-base64":32,"./enc-utf16":33,"./evpkdf":34,"./format-hex":35,"./hmac":36,"./lib-typedarrays":38,"./md5":39,"./mode-cfb":40,"./mode-ctr":42,"./mode-ctr-gladman":41,"./mode-ecb":43,"./mode-ofb":44,"./pad-ansix923":45,"./pad-iso10126":46,"./pad-iso97971":47,"./pad-nopadding":48,"./pad-zeropadding":49,"./pbkdf2":50,"./rabbit":52,"./rabbit-legacy":51,"./rc4":53,"./ripemd160":54,"./sha1":55,"./sha224":56,"./sha256":57,"./sha3":58,"./sha384":59,"./sha512":60,"./tripledes":61,"./x64-core":62}],38:[function(_dereq_,module,exports){
-;(function (root, factory) {
- if (typeof exports === "object") {
- // CommonJS
- module.exports = exports = factory(_dereq_("./core"));
- }
- else if (typeof define === "function" && define.amd) {
- // AMD
- define(["./core"], factory);
- }
- else {
- // Global (browser)
- factory(root.CryptoJS);
- }
-}(this, function (CryptoJS) {
-
- (function () {
- // Check if typed arrays are supported
- if (typeof ArrayBuffer != 'function') {
- return;
- }
-
- // Shortcuts
- var C = CryptoJS;
- var C_lib = C.lib;
- var WordArray = C_lib.WordArray;
-
- // Reference original init
- var superInit = WordArray.init;
-
- // Augment WordArray.init to handle typed arrays
- var subInit = WordArray.init = function (typedArray) {
- // Convert buffers to uint8
- if (typedArray instanceof ArrayBuffer) {
- typedArray = new Uint8Array(typedArray);
- }
-
- // Convert other array views to uint8
- if (
- typedArray instanceof Int8Array ||
- typedArray instanceof Uint8ClampedArray ||
- typedArray instanceof Int16Array ||
- typedArray instanceof Uint16Array ||
- typedArray instanceof Int32Array ||
- typedArray instanceof Uint32Array ||
- typedArray instanceof Float32Array ||
- typedArray instanceof Float64Array
- ) {
- typedArray = new Uint8Array(typedArray.buffer, typedArray.byteOffset, typedArray.byteLength);
- }
-
- // Handle Uint8Array
- if (typedArray instanceof Uint8Array) {
- // Shortcut
- var typedArrayByteLength = typedArray.byteLength;
-
- // Extract bytes
- var words = [];
- for (var i = 0; i < typedArrayByteLength; i++) {
- words[i >>> 2] |= typedArray[i] << (24 - (i % 4) * 8);
- }
-
- // Initialize this word array
- superInit.call(this, words, typedArrayByteLength);
- } else {
- // Else call normal init
- superInit.apply(this, arguments);
- }
- };
-
- subInit.prototype = WordArray;
- }());
-
-
- return CryptoJS.lib.WordArray;
-
-}));
-},{"./core":31}],39:[function(_dereq_,module,exports){
-;(function (root, factory) {
- if (typeof exports === "object") {
- // CommonJS
- module.exports = exports = factory(_dereq_("./core"));
- }
- else if (typeof define === "function" && define.amd) {
- // AMD
- define(["./core"], factory);
- }
- else {
- // Global (browser)
- factory(root.CryptoJS);
- }
-}(this, function (CryptoJS) {
-
- (function (Math) {
- // Shortcuts
- var C = CryptoJS;
- var C_lib = C.lib;
- var WordArray = C_lib.WordArray;
- var Hasher = C_lib.Hasher;
- var C_algo = C.algo;
-
- // Constants table
- var T = [];
-
- // Compute constants
- (function () {
- for (var i = 0; i < 64; i++) {
- T[i] = (Math.abs(Math.sin(i + 1)) * 0x100000000) | 0;
- }
- }());
-
- /**
- * MD5 hash algorithm.
- */
- var MD5 = C_algo.MD5 = Hasher.extend({
- _doReset: function () {
- this._hash = new WordArray.init([
- 0x67452301, 0xefcdab89,
- 0x98badcfe, 0x10325476
- ]);
- },
-
- _doProcessBlock: function (M, offset) {
- // Swap endian
- for (var i = 0; i < 16; i++) {
- // Shortcuts
- var offset_i = offset + i;
- var M_offset_i = M[offset_i];
-
- M[offset_i] = (
- (((M_offset_i << 8) | (M_offset_i >>> 24)) & 0x00ff00ff) |
- (((M_offset_i << 24) | (M_offset_i >>> 8)) & 0xff00ff00)
- );
- }
-
- // Shortcuts
- var H = this._hash.words;
-
- var M_offset_0 = M[offset + 0];
- var M_offset_1 = M[offset + 1];
- var M_offset_2 = M[offset + 2];
- var M_offset_3 = M[offset + 3];
- var M_offset_4 = M[offset + 4];
- var M_offset_5 = M[offset + 5];
- var M_offset_6 = M[offset + 6];
- var M_offset_7 = M[offset + 7];
- var M_offset_8 = M[offset + 8];
- var M_offset_9 = M[offset + 9];
- var M_offset_10 = M[offset + 10];
- var M_offset_11 = M[offset + 11];
- var M_offset_12 = M[offset + 12];
- var M_offset_13 = M[offset + 13];
- var M_offset_14 = M[offset + 14];
- var M_offset_15 = M[offset + 15];
-
- // Working varialbes
- var a = H[0];
- var b = H[1];
- var c = H[2];
- var d = H[3];
-
- // Computation
- a = FF(a, b, c, d, M_offset_0, 7, T[0]);
- d = FF(d, a, b, c, M_offset_1, 12, T[1]);
- c = FF(c, d, a, b, M_offset_2, 17, T[2]);
- b = FF(b, c, d, a, M_offset_3, 22, T[3]);
- a = FF(a, b, c, d, M_offset_4, 7, T[4]);
- d = FF(d, a, b, c, M_offset_5, 12, T[5]);
- c = FF(c, d, a, b, M_offset_6, 17, T[6]);
- b = FF(b, c, d, a, M_offset_7, 22, T[7]);
- a = FF(a, b, c, d, M_offset_8, 7, T[8]);
- d = FF(d, a, b, c, M_offset_9, 12, T[9]);
- c = FF(c, d, a, b, M_offset_10, 17, T[10]);
- b = FF(b, c, d, a, M_offset_11, 22, T[11]);
- a = FF(a, b, c, d, M_offset_12, 7, T[12]);
- d = FF(d, a, b, c, M_offset_13, 12, T[13]);
- c = FF(c, d, a, b, M_offset_14, 17, T[14]);
- b = FF(b, c, d, a, M_offset_15, 22, T[15]);
-
- a = GG(a, b, c, d, M_offset_1, 5, T[16]);
- d = GG(d, a, b, c, M_offset_6, 9, T[17]);
- c = GG(c, d, a, b, M_offset_11, 14, T[18]);
- b = GG(b, c, d, a, M_offset_0, 20, T[19]);
- a = GG(a, b, c, d, M_offset_5, 5, T[20]);
- d = GG(d, a, b, c, M_offset_10, 9, T[21]);
- c = GG(c, d, a, b, M_offset_15, 14, T[22]);
- b = GG(b, c, d, a, M_offset_4, 20, T[23]);
- a = GG(a, b, c, d, M_offset_9, 5, T[24]);
- d = GG(d, a, b, c, M_offset_14, 9, T[25]);
- c = GG(c, d, a, b, M_offset_3, 14, T[26]);
- b = GG(b, c, d, a, M_offset_8, 20, T[27]);
- a = GG(a, b, c, d, M_offset_13, 5, T[28]);
- d = GG(d, a, b, c, M_offset_2, 9, T[29]);
- c = GG(c, d, a, b, M_offset_7, 14, T[30]);
- b = GG(b, c, d, a, M_offset_12, 20, T[31]);
-
- a = HH(a, b, c, d, M_offset_5, 4, T[32]);
- d = HH(d, a, b, c, M_offset_8, 11, T[33]);
- c = HH(c, d, a, b, M_offset_11, 16, T[34]);
- b = HH(b, c, d, a, M_offset_14, 23, T[35]);
- a = HH(a, b, c, d, M_offset_1, 4, T[36]);
- d = HH(d, a, b, c, M_offset_4, 11, T[37]);
- c = HH(c, d, a, b, M_offset_7, 16, T[38]);
- b = HH(b, c, d, a, M_offset_10, 23, T[39]);
- a = HH(a, b, c, d, M_offset_13, 4, T[40]);
- d = HH(d, a, b, c, M_offset_0, 11, T[41]);
- c = HH(c, d, a, b, M_offset_3, 16, T[42]);
- b = HH(b, c, d, a, M_offset_6, 23, T[43]);
- a = HH(a, b, c, d, M_offset_9, 4, T[44]);
- d = HH(d, a, b, c, M_offset_12, 11, T[45]);
- c = HH(c, d, a, b, M_offset_15, 16, T[46]);
- b = HH(b, c, d, a, M_offset_2, 23, T[47]);
-
- a = II(a, b, c, d, M_offset_0, 6, T[48]);
- d = II(d, a, b, c, M_offset_7, 10, T[49]);
- c = II(c, d, a, b, M_offset_14, 15, T[50]);
- b = II(b, c, d, a, M_offset_5, 21, T[51]);
- a = II(a, b, c, d, M_offset_12, 6, T[52]);
- d = II(d, a, b, c, M_offset_3, 10, T[53]);
- c = II(c, d, a, b, M_offset_10, 15, T[54]);
- b = II(b, c, d, a, M_offset_1, 21, T[55]);
- a = II(a, b, c, d, M_offset_8, 6, T[56]);
- d = II(d, a, b, c, M_offset_15, 10, T[57]);
- c = II(c, d, a, b, M_offset_6, 15, T[58]);
- b = II(b, c, d, a, M_offset_13, 21, T[59]);
- a = II(a, b, c, d, M_offset_4, 6, T[60]);
- d = II(d, a, b, c, M_offset_11, 10, T[61]);
- c = II(c, d, a, b, M_offset_2, 15, T[62]);
- b = II(b, c, d, a, M_offset_9, 21, T[63]);
-
- // Intermediate hash value
- H[0] = (H[0] + a) | 0;
- H[1] = (H[1] + b) | 0;
- H[2] = (H[2] + c) | 0;
- H[3] = (H[3] + d) | 0;
- },
-
- _doFinalize: function () {
- // Shortcuts
- var data = this._data;
- var dataWords = data.words;
-
- var nBitsTotal = this._nDataBytes * 8;
- var nBitsLeft = data.sigBytes * 8;
-
- // Add padding
- dataWords[nBitsLeft >>> 5] |= 0x80 << (24 - nBitsLeft % 32);
-
- var nBitsTotalH = Math.floor(nBitsTotal / 0x100000000);
- var nBitsTotalL = nBitsTotal;
- dataWords[(((nBitsLeft + 64) >>> 9) << 4) + 15] = (
- (((nBitsTotalH << 8) | (nBitsTotalH >>> 24)) & 0x00ff00ff) |
- (((nBitsTotalH << 24) | (nBitsTotalH >>> 8)) & 0xff00ff00)
- );
- dataWords[(((nBitsLeft + 64) >>> 9) << 4) + 14] = (
- (((nBitsTotalL << 8) | (nBitsTotalL >>> 24)) & 0x00ff00ff) |
- (((nBitsTotalL << 24) | (nBitsTotalL >>> 8)) & 0xff00ff00)
- );
-
- data.sigBytes = (dataWords.length + 1) * 4;
-
- // Hash final blocks
- this._process();
-
- // Shortcuts
- var hash = this._hash;
- var H = hash.words;
-
- // Swap endian
- for (var i = 0; i < 4; i++) {
- // Shortcut
- var H_i = H[i];
-
- H[i] = (((H_i << 8) | (H_i >>> 24)) & 0x00ff00ff) |
- (((H_i << 24) | (H_i >>> 8)) & 0xff00ff00);
- }
-
- // Return final computed hash
- return hash;
- },
-
- clone: function () {
- var clone = Hasher.clone.call(this);
- clone._hash = this._hash.clone();
-
- return clone;
- }
- });
-
- function FF(a, b, c, d, x, s, t) {
- var n = a + ((b & c) | (~b & d)) + x + t;
- return ((n << s) | (n >>> (32 - s))) + b;
- }
-
- function GG(a, b, c, d, x, s, t) {
- var n = a + ((b & d) | (c & ~d)) + x + t;
- return ((n << s) | (n >>> (32 - s))) + b;
- }
-
- function HH(a, b, c, d, x, s, t) {
- var n = a + (b ^ c ^ d) + x + t;
- return ((n << s) | (n >>> (32 - s))) + b;
- }
-
- function II(a, b, c, d, x, s, t) {
- var n = a + (c ^ (b | ~d)) + x + t;
- return ((n << s) | (n >>> (32 - s))) + b;
- }
-
- /**
- * Shortcut function to the hasher's object interface.
- *
- * @param {WordArray|string} message The message to hash.
- *
- * @return {WordArray} The hash.
- *
- * @static
- *
- * @example
- *
- * var hash = CryptoJS.MD5('message');
- * var hash = CryptoJS.MD5(wordArray);
- */
- C.MD5 = Hasher._createHelper(MD5);
-
- /**
- * Shortcut function to the HMAC's object interface.
- *
- * @param {WordArray|string} message The message to hash.
- * @param {WordArray|string} key The secret key.
- *
- * @return {WordArray} The HMAC.
- *
- * @static
- *
- * @example
- *
- * var hmac = CryptoJS.HmacMD5(message, key);
- */
- C.HmacMD5 = Hasher._createHmacHelper(MD5);
- }(Math));
-
-
- return CryptoJS.MD5;
-
-}));
-},{"./core":31}],40:[function(_dereq_,module,exports){
-;(function (root, factory, undef) {
- if (typeof exports === "object") {
- // CommonJS
- module.exports = exports = factory(_dereq_("./core"), _dereq_("./cipher-core"));
- }
- else if (typeof define === "function" && define.amd) {
- // AMD
- define(["./core", "./cipher-core"], factory);
- }
- else {
- // Global (browser)
- factory(root.CryptoJS);
- }
-}(this, function (CryptoJS) {
-
- /**
- * Cipher Feedback block mode.
- */
- CryptoJS.mode.CFB = (function () {
- var CFB = CryptoJS.lib.BlockCipherMode.extend();
-
- CFB.Encryptor = CFB.extend({
- processBlock: function (words, offset) {
- // Shortcuts
- var cipher = this._cipher;
- var blockSize = cipher.blockSize;
-
- generateKeystreamAndEncrypt.call(this, words, offset, blockSize, cipher);
-
- // Remember this block to use with next block
- this._prevBlock = words.slice(offset, offset + blockSize);
- }
- });
-
- CFB.Decryptor = CFB.extend({
- processBlock: function (words, offset) {
- // Shortcuts
- var cipher = this._cipher;
- var blockSize = cipher.blockSize;
-
- // Remember this block to use with next block
- var thisBlock = words.slice(offset, offset + blockSize);
-
- generateKeystreamAndEncrypt.call(this, words, offset, blockSize, cipher);
-
- // This block becomes the previous block
- this._prevBlock = thisBlock;
- }
- });
-
- function generateKeystreamAndEncrypt(words, offset, blockSize, cipher) {
- // Shortcut
- var iv = this._iv;
-
- // Generate keystream
- if (iv) {
- var keystream = iv.slice(0);
-
- // Remove IV for subsequent blocks
- this._iv = undefined;
- } else {
- var keystream = this._prevBlock;
- }
- cipher.encryptBlock(keystream, 0);
-
- // Encrypt
- for (var i = 0; i < blockSize; i++) {
- words[offset + i] ^= keystream[i];
- }
- }
-
- return CFB;
- }());
-
-
- return CryptoJS.mode.CFB;
-
-}));
-},{"./cipher-core":30,"./core":31}],41:[function(_dereq_,module,exports){
-;(function (root, factory, undef) {
- if (typeof exports === "object") {
- // CommonJS
- module.exports = exports = factory(_dereq_("./core"), _dereq_("./cipher-core"));
- }
- else if (typeof define === "function" && define.amd) {
- // AMD
- define(["./core", "./cipher-core"], factory);
- }
- else {
- // Global (browser)
- factory(root.CryptoJS);
- }
-}(this, function (CryptoJS) {
-
- /** @preserve
- * Counter block mode compatible with Dr Brian Gladman fileenc.c
- * derived from CryptoJS.mode.CTR
- * Jan Hruby jhruby.web@gmail.com
- */
- CryptoJS.mode.CTRGladman = (function () {
- var CTRGladman = CryptoJS.lib.BlockCipherMode.extend();
-
- function incWord(word)
- {
- if (((word >> 24) & 0xff) === 0xff) { //overflow
- var b1 = (word >> 16)&0xff;
- var b2 = (word >> 8)&0xff;
- var b3 = word & 0xff;
-
- if (b1 === 0xff) // overflow b1
- {
- b1 = 0;
- if (b2 === 0xff)
- {
- b2 = 0;
- if (b3 === 0xff)
- {
- b3 = 0;
- }
- else
- {
- ++b3;
- }
- }
- else
- {
- ++b2;
- }
- }
- else
- {
- ++b1;
- }
+ // a flag to be able to tell if the onwrite cb is called immediately,
+ // or on a later tick. We set this to true at first, because any
+ // actions that shouldn't happen until "later" should generally also
+ // not happen before the first write call.
+ this.sync = true;
- word = 0;
- word += (b1 << 16);
- word += (b2 << 8);
- word += b3;
- }
- else
- {
- word += (0x01 << 24);
- }
- return word;
- }
+ // a flag to know if we're processing previously buffered items, which
+ // may call the _write() callback in the same tick, so that we don't
+ // end up in an overlapped onwrite situation.
+ this.bufferProcessing = false;
- function incCounter(counter)
- {
- if ((counter[0] = incWord(counter[0])) === 0)
- {
- // encr_data in fileenc.c from Dr Brian Gladman's counts only with DWORD j < 8
- counter[1] = incWord(counter[1]);
- }
- return counter;
- }
+ // the callback that's passed to _write(chunk,cb)
+ this.onwrite = function(er) {
+ onwrite(stream, er);
+ };
- var Encryptor = CTRGladman.Encryptor = CTRGladman.extend({
- processBlock: function (words, offset) {
- // Shortcuts
- var cipher = this._cipher
- var blockSize = cipher.blockSize;
- var iv = this._iv;
- var counter = this._counter;
+ // the callback that the user supplies to write(chunk,encoding,cb)
+ this.writecb = null;
- // Generate keystream
- if (iv) {
- counter = this._counter = iv.slice(0);
+ // the amount that is being written when _write is called.
+ this.writelen = 0;
- // Remove IV for subsequent blocks
- this._iv = undefined;
- }
+ this.buffer = [];
- incCounter(counter);
+ // number of pending user-supplied write callbacks
+ // this must be 0 before 'finish' can be emitted
+ this.pendingcb = 0;
- var keystream = counter.slice(0);
- cipher.encryptBlock(keystream, 0);
+ // emit prefinish if the only thing we're waiting for is _write cbs
+ // This is relevant for synchronous Transform streams
+ this.prefinished = false;
- // Encrypt
- for (var i = 0; i < blockSize; i++) {
- words[offset + i] ^= keystream[i];
- }
- }
- });
+ // True if the error was already emitted and should not be thrown again
+ this.errorEmitted = false;
+}
- CTRGladman.Decryptor = Encryptor;
+function Writable(options) {
+ var Duplex = require('./_stream_duplex');
- return CTRGladman;
- }());
+ // Writable ctor is applied to Duplexes, though they're not
+ // instanceof Writable, they're instanceof Readable.
+ if (!(this instanceof Writable) && !(this instanceof Duplex))
+ return new Writable(options);
+ this._writableState = new WritableState(options, this);
+ // legacy.
+ this.writable = true;
+ Stream.call(this);
+}
- return CryptoJS.mode.CTRGladman;
+// Otherwise people can pipe Writable streams, which is just wrong.
+Writable.prototype.pipe = function() {
+ this.emit('error', new Error('Cannot pipe. Not readable.'));
+};
-}));
-},{"./cipher-core":30,"./core":31}],42:[function(_dereq_,module,exports){
-;(function (root, factory, undef) {
- if (typeof exports === "object") {
- // CommonJS
- module.exports = exports = factory(_dereq_("./core"), _dereq_("./cipher-core"));
- }
- else if (typeof define === "function" && define.amd) {
- // AMD
- define(["./core", "./cipher-core"], factory);
- }
- else {
- // Global (browser)
- factory(root.CryptoJS);
- }
-}(this, function (CryptoJS) {
-
- /**
- * Counter block mode.
- */
- CryptoJS.mode.CTR = (function () {
- var CTR = CryptoJS.lib.BlockCipherMode.extend();
-
- var Encryptor = CTR.Encryptor = CTR.extend({
- processBlock: function (words, offset) {
- // Shortcuts
- var cipher = this._cipher
- var blockSize = cipher.blockSize;
- var iv = this._iv;
- var counter = this._counter;
-
- // Generate keystream
- if (iv) {
- counter = this._counter = iv.slice(0);
-
- // Remove IV for subsequent blocks
- this._iv = undefined;
- }
- var keystream = counter.slice(0);
- cipher.encryptBlock(keystream, 0);
-
- // Increment counter
- counter[blockSize - 1] = (counter[blockSize - 1] + 1) | 0
-
- // Encrypt
- for (var i = 0; i < blockSize; i++) {
- words[offset + i] ^= keystream[i];
- }
- }
- });
-
- CTR.Decryptor = Encryptor;
-
- return CTR;
- }());
-
-
- return CryptoJS.mode.CTR;
-
-}));
-},{"./cipher-core":30,"./core":31}],43:[function(_dereq_,module,exports){
-;(function (root, factory, undef) {
- if (typeof exports === "object") {
- // CommonJS
- module.exports = exports = factory(_dereq_("./core"), _dereq_("./cipher-core"));
- }
- else if (typeof define === "function" && define.amd) {
- // AMD
- define(["./core", "./cipher-core"], factory);
- }
- else {
- // Global (browser)
- factory(root.CryptoJS);
- }
-}(this, function (CryptoJS) {
-
- /**
- * Electronic Codebook block mode.
- */
- CryptoJS.mode.ECB = (function () {
- var ECB = CryptoJS.lib.BlockCipherMode.extend();
-
- ECB.Encryptor = ECB.extend({
- processBlock: function (words, offset) {
- this._cipher.encryptBlock(words, offset);
- }
- });
-
- ECB.Decryptor = ECB.extend({
- processBlock: function (words, offset) {
- this._cipher.decryptBlock(words, offset);
- }
- });
-
- return ECB;
- }());
-
-
- return CryptoJS.mode.ECB;
-
-}));
-},{"./cipher-core":30,"./core":31}],44:[function(_dereq_,module,exports){
-;(function (root, factory, undef) {
- if (typeof exports === "object") {
- // CommonJS
- module.exports = exports = factory(_dereq_("./core"), _dereq_("./cipher-core"));
- }
- else if (typeof define === "function" && define.amd) {
- // AMD
- define(["./core", "./cipher-core"], factory);
- }
- else {
- // Global (browser)
- factory(root.CryptoJS);
- }
-}(this, function (CryptoJS) {
-
- /**
- * Output Feedback block mode.
- */
- CryptoJS.mode.OFB = (function () {
- var OFB = CryptoJS.lib.BlockCipherMode.extend();
-
- var Encryptor = OFB.Encryptor = OFB.extend({
- processBlock: function (words, offset) {
- // Shortcuts
- var cipher = this._cipher
- var blockSize = cipher.blockSize;
- var iv = this._iv;
- var keystream = this._keystream;
-
- // Generate keystream
- if (iv) {
- keystream = this._keystream = iv.slice(0);
-
- // Remove IV for subsequent blocks
- this._iv = undefined;
- }
- cipher.encryptBlock(keystream, 0);
-
- // Encrypt
- for (var i = 0; i < blockSize; i++) {
- words[offset + i] ^= keystream[i];
- }
- }
- });
-
- OFB.Decryptor = Encryptor;
-
- return OFB;
- }());
-
-
- return CryptoJS.mode.OFB;
-
-}));
-},{"./cipher-core":30,"./core":31}],45:[function(_dereq_,module,exports){
-;(function (root, factory, undef) {
- if (typeof exports === "object") {
- // CommonJS
- module.exports = exports = factory(_dereq_("./core"), _dereq_("./cipher-core"));
- }
- else if (typeof define === "function" && define.amd) {
- // AMD
- define(["./core", "./cipher-core"], factory);
- }
- else {
- // Global (browser)
- factory(root.CryptoJS);
- }
-}(this, function (CryptoJS) {
-
- /**
- * ANSI X.923 padding strategy.
- */
- CryptoJS.pad.AnsiX923 = {
- pad: function (data, blockSize) {
- // Shortcuts
- var dataSigBytes = data.sigBytes;
- var blockSizeBytes = blockSize * 4;
-
- // Count padding bytes
- var nPaddingBytes = blockSizeBytes - dataSigBytes % blockSizeBytes;
-
- // Compute last byte position
- var lastBytePos = dataSigBytes + nPaddingBytes - 1;
-
- // Pad
- data.clamp();
- data.words[lastBytePos >>> 2] |= nPaddingBytes << (24 - (lastBytePos % 4) * 8);
- data.sigBytes += nPaddingBytes;
- },
-
- unpad: function (data) {
- // Get number of padding bytes from last byte
- var nPaddingBytes = data.words[(data.sigBytes - 1) >>> 2] & 0xff;
-
- // Remove padding
- data.sigBytes -= nPaddingBytes;
- }
- };
+function writeAfterEnd(stream, state, cb) {
+ var er = new Error('write after end');
+ // TODO: defer error events consistently everywhere, not just the cb
+ stream.emit('error', er);
+ process.nextTick(function() {
+ cb(er);
+ });
+}
- return CryptoJS.pad.Ansix923;
+// If we get something that is not a buffer, string, null, or undefined,
+// and we're not in objectMode, then that's an error.
+// Otherwise stream chunks are all considered to be of length=1, and the
+// watermarks determine how many objects to keep in the buffer, rather than
+// how many bytes or characters.
+function validChunk(stream, state, chunk, cb) {
+ var valid = true;
+ if (!util.isBuffer(chunk) &&
+ !util.isString(chunk) &&
+ !util.isNullOrUndefined(chunk) &&
+ !state.objectMode) {
+ var er = new TypeError('Invalid non-string/buffer chunk');
+ stream.emit('error', er);
+ process.nextTick(function() {
+ cb(er);
+ });
+ valid = false;
+ }
+ return valid;
+}
-}));
-},{"./cipher-core":30,"./core":31}],46:[function(_dereq_,module,exports){
-;(function (root, factory, undef) {
- if (typeof exports === "object") {
- // CommonJS
- module.exports = exports = factory(_dereq_("./core"), _dereq_("./cipher-core"));
- }
- else if (typeof define === "function" && define.amd) {
- // AMD
- define(["./core", "./cipher-core"], factory);
- }
- else {
- // Global (browser)
- factory(root.CryptoJS);
- }
-}(this, function (CryptoJS) {
-
- /**
- * ISO 10126 padding strategy.
- */
- CryptoJS.pad.Iso10126 = {
- pad: function (data, blockSize) {
- // Shortcut
- var blockSizeBytes = blockSize * 4;
-
- // Count padding bytes
- var nPaddingBytes = blockSizeBytes - data.sigBytes % blockSizeBytes;
-
- // Pad
- data.concat(CryptoJS.lib.WordArray.random(nPaddingBytes - 1)).
- concat(CryptoJS.lib.WordArray.create([nPaddingBytes << 24], 1));
- },
-
- unpad: function (data) {
- // Get number of padding bytes from last byte
- var nPaddingBytes = data.words[(data.sigBytes - 1) >>> 2] & 0xff;
-
- // Remove padding
- data.sigBytes -= nPaddingBytes;
- }
- };
+Writable.prototype.write = function(chunk, encoding, cb) {
+ var state = this._writableState;
+ var ret = false;
+ if (util.isFunction(encoding)) {
+ cb = encoding;
+ encoding = null;
+ }
- return CryptoJS.pad.Iso10126;
+ if (util.isBuffer(chunk))
+ encoding = 'buffer';
+ else if (!encoding)
+ encoding = state.defaultEncoding;
-}));
-},{"./cipher-core":30,"./core":31}],47:[function(_dereq_,module,exports){
-;(function (root, factory, undef) {
- if (typeof exports === "object") {
- // CommonJS
- module.exports = exports = factory(_dereq_("./core"), _dereq_("./cipher-core"));
- }
- else if (typeof define === "function" && define.amd) {
- // AMD
- define(["./core", "./cipher-core"], factory);
- }
- else {
- // Global (browser)
- factory(root.CryptoJS);
- }
-}(this, function (CryptoJS) {
-
- /**
- * ISO/IEC 9797-1 Padding Method 2.
- */
- CryptoJS.pad.Iso97971 = {
- pad: function (data, blockSize) {
- // Add 0x80 byte
- data.concat(CryptoJS.lib.WordArray.create([0x80000000], 1));
-
- // Zero pad the rest
- CryptoJS.pad.ZeroPadding.pad(data, blockSize);
- },
-
- unpad: function (data) {
- // Remove zero padding
- CryptoJS.pad.ZeroPadding.unpad(data);
-
- // Remove one more byte -- the 0x80 byte
- data.sigBytes--;
- }
- };
+ if (!util.isFunction(cb))
+ cb = function() {};
+ if (state.ended)
+ writeAfterEnd(this, state, cb);
+ else if (validChunk(this, state, chunk, cb)) {
+ state.pendingcb++;
+ ret = writeOrBuffer(this, state, chunk, encoding, cb);
+ }
- return CryptoJS.pad.Iso97971;
+ return ret;
+};
-}));
-},{"./cipher-core":30,"./core":31}],48:[function(_dereq_,module,exports){
-;(function (root, factory, undef) {
- if (typeof exports === "object") {
- // CommonJS
- module.exports = exports = factory(_dereq_("./core"), _dereq_("./cipher-core"));
- }
- else if (typeof define === "function" && define.amd) {
- // AMD
- define(["./core", "./cipher-core"], factory);
- }
- else {
- // Global (browser)
- factory(root.CryptoJS);
- }
-}(this, function (CryptoJS) {
+Writable.prototype.cork = function() {
+ var state = this._writableState;
- /**
- * A noop padding strategy.
- */
- CryptoJS.pad.NoPadding = {
- pad: function () {
- },
+ state.corked++;
+};
- unpad: function () {
- }
- };
+Writable.prototype.uncork = function() {
+ var state = this._writableState;
+ if (state.corked) {
+ state.corked--;
- return CryptoJS.pad.NoPadding;
+ if (!state.writing &&
+ !state.corked &&
+ !state.finished &&
+ !state.bufferProcessing &&
+ state.buffer.length)
+ clearBuffer(this, state);
+ }
+};
-}));
-},{"./cipher-core":30,"./core":31}],49:[function(_dereq_,module,exports){
-;(function (root, factory, undef) {
- if (typeof exports === "object") {
- // CommonJS
- module.exports = exports = factory(_dereq_("./core"), _dereq_("./cipher-core"));
- }
- else if (typeof define === "function" && define.amd) {
- // AMD
- define(["./core", "./cipher-core"], factory);
- }
- else {
- // Global (browser)
- factory(root.CryptoJS);
- }
-}(this, function (CryptoJS) {
-
- /**
- * Zero padding strategy.
- */
- CryptoJS.pad.ZeroPadding = {
- pad: function (data, blockSize) {
- // Shortcut
- var blockSizeBytes = blockSize * 4;
-
- // Pad
- data.clamp();
- data.sigBytes += blockSizeBytes - ((data.sigBytes % blockSizeBytes) || blockSizeBytes);
- },
-
- unpad: function (data) {
- // Shortcut
- var dataWords = data.words;
-
- // Unpad
- var i = data.sigBytes - 1;
- while (!((dataWords[i >>> 2] >>> (24 - (i % 4) * 8)) & 0xff)) {
- i--;
- }
- data.sigBytes = i + 1;
- }
- };
+function decodeChunk(state, chunk, encoding) {
+ if (!state.objectMode &&
+ state.decodeStrings !== false &&
+ util.isString(chunk)) {
+ chunk = new Buffer(chunk, encoding);
+ }
+ return chunk;
+}
+// if we're already writing something, then just put this
+// in the queue, and wait our turn. Otherwise, call _write
+// If we return false, then we need a drain event, so set that flag.
+function writeOrBuffer(stream, state, chunk, encoding, cb) {
+ chunk = decodeChunk(state, chunk, encoding);
+ if (util.isBuffer(chunk))
+ encoding = 'buffer';
+ var len = state.objectMode ? 1 : chunk.length;
- return CryptoJS.pad.ZeroPadding;
+ state.length += len;
-}));
-},{"./cipher-core":30,"./core":31}],50:[function(_dereq_,module,exports){
-;(function (root, factory, undef) {
- if (typeof exports === "object") {
- // CommonJS
- module.exports = exports = factory(_dereq_("./core"), _dereq_("./sha1"), _dereq_("./hmac"));
- }
- else if (typeof define === "function" && define.amd) {
- // AMD
- define(["./core", "./sha1", "./hmac"], factory);
- }
- else {
- // Global (browser)
- factory(root.CryptoJS);
- }
-}(this, function (CryptoJS) {
-
- (function () {
- // Shortcuts
- var C = CryptoJS;
- var C_lib = C.lib;
- var Base = C_lib.Base;
- var WordArray = C_lib.WordArray;
- var C_algo = C.algo;
- var SHA1 = C_algo.SHA1;
- var HMAC = C_algo.HMAC;
-
- /**
- * Password-Based Key Derivation Function 2 algorithm.
- */
- var PBKDF2 = C_algo.PBKDF2 = Base.extend({
- /**
- * Configuration options.
- *
- * @property {number} keySize The key size in words to generate. Default: 4 (128 bits)
- * @property {Hasher} hasher The hasher to use. Default: SHA1
- * @property {number} iterations The number of iterations to perform. Default: 1
- */
- cfg: Base.extend({
- keySize: 128/32,
- hasher: SHA1,
- iterations: 1
- }),
-
- /**
- * Initializes a newly created key derivation function.
- *
- * @param {Object} cfg (Optional) The configuration options to use for the derivation.
- *
- * @example
- *
- * var kdf = CryptoJS.algo.PBKDF2.create();
- * var kdf = CryptoJS.algo.PBKDF2.create({ keySize: 8 });
- * var kdf = CryptoJS.algo.PBKDF2.create({ keySize: 8, iterations: 1000 });
- */
- init: function (cfg) {
- this.cfg = this.cfg.extend(cfg);
- },
-
- /**
- * Computes the Password-Based Key Derivation Function 2.
- *
- * @param {WordArray|string} password The password.
- * @param {WordArray|string} salt A salt.
- *
- * @return {WordArray} The derived key.
- *
- * @example
- *
- * var key = kdf.compute(password, salt);
- */
- compute: function (password, salt) {
- // Shortcut
- var cfg = this.cfg;
-
- // Init HMAC
- var hmac = HMAC.create(cfg.hasher, password);
-
- // Initial values
- var derivedKey = WordArray.create();
- var blockIndex = WordArray.create([0x00000001]);
-
- // Shortcuts
- var derivedKeyWords = derivedKey.words;
- var blockIndexWords = blockIndex.words;
- var keySize = cfg.keySize;
- var iterations = cfg.iterations;
-
- // Generate key
- while (derivedKeyWords.length < keySize) {
- var block = hmac.update(salt).finalize(blockIndex);
- hmac.reset();
-
- // Shortcuts
- var blockWords = block.words;
- var blockWordsLength = blockWords.length;
-
- // Iterations
- var intermediate = block;
- for (var i = 1; i < iterations; i++) {
- intermediate = hmac.finalize(intermediate);
- hmac.reset();
-
- // Shortcut
- var intermediateWords = intermediate.words;
-
- // XOR intermediate with block
- for (var j = 0; j < blockWordsLength; j++) {
- blockWords[j] ^= intermediateWords[j];
- }
- }
-
- derivedKey.concat(block);
- blockIndexWords[0]++;
- }
- derivedKey.sigBytes = keySize * 4;
-
- return derivedKey;
- }
- });
-
- /**
- * Computes the Password-Based Key Derivation Function 2.
- *
- * @param {WordArray|string} password The password.
- * @param {WordArray|string} salt A salt.
- * @param {Object} cfg (Optional) The configuration options to use for this computation.
- *
- * @return {WordArray} The derived key.
- *
- * @static
- *
- * @example
- *
- * var key = CryptoJS.PBKDF2(password, salt);
- * var key = CryptoJS.PBKDF2(password, salt, { keySize: 8 });
- * var key = CryptoJS.PBKDF2(password, salt, { keySize: 8, iterations: 1000 });
- */
- C.PBKDF2 = function (password, salt, cfg) {
- return PBKDF2.create(cfg).compute(password, salt);
- };
- }());
-
-
- return CryptoJS.PBKDF2;
-
-}));
-},{"./core":31,"./hmac":36,"./sha1":55}],51:[function(_dereq_,module,exports){
-;(function (root, factory, undef) {
- if (typeof exports === "object") {
- // CommonJS
- module.exports = exports = factory(_dereq_("./core"), _dereq_("./enc-base64"), _dereq_("./md5"), _dereq_("./evpkdf"), _dereq_("./cipher-core"));
- }
- else if (typeof define === "function" && define.amd) {
- // AMD
- define(["./core", "./enc-base64", "./md5", "./evpkdf", "./cipher-core"], factory);
- }
- else {
- // Global (browser)
- factory(root.CryptoJS);
- }
-}(this, function (CryptoJS) {
-
- (function () {
- // Shortcuts
- var C = CryptoJS;
- var C_lib = C.lib;
- var StreamCipher = C_lib.StreamCipher;
- var C_algo = C.algo;
-
- // Reusable objects
- var S = [];
- var C_ = [];
- var G = [];
-
- /**
- * Rabbit stream cipher algorithm.
- *
- * This is a legacy version that neglected to convert the key to little-endian.
- * This error doesn't affect the cipher's security,
- * but it does affect its compatibility with other implementations.
- */
- var RabbitLegacy = C_algo.RabbitLegacy = StreamCipher.extend({
- _doReset: function () {
- // Shortcuts
- var K = this._key.words;
- var iv = this.cfg.iv;
-
- // Generate initial state values
- var X = this._X = [
- K[0], (K[3] << 16) | (K[2] >>> 16),
- K[1], (K[0] << 16) | (K[3] >>> 16),
- K[2], (K[1] << 16) | (K[0] >>> 16),
- K[3], (K[2] << 16) | (K[1] >>> 16)
- ];
-
- // Generate initial counter values
- var C = this._C = [
- (K[2] << 16) | (K[2] >>> 16), (K[0] & 0xffff0000) | (K[1] & 0x0000ffff),
- (K[3] << 16) | (K[3] >>> 16), (K[1] & 0xffff0000) | (K[2] & 0x0000ffff),
- (K[0] << 16) | (K[0] >>> 16), (K[2] & 0xffff0000) | (K[3] & 0x0000ffff),
- (K[1] << 16) | (K[1] >>> 16), (K[3] & 0xffff0000) | (K[0] & 0x0000ffff)
- ];
-
- // Carry bit
- this._b = 0;
-
- // Iterate the system four times
- for (var i = 0; i < 4; i++) {
- nextState.call(this);
- }
-
- // Modify the counters
- for (var i = 0; i < 8; i++) {
- C[i] ^= X[(i + 4) & 7];
- }
-
- // IV setup
- if (iv) {
- // Shortcuts
- var IV = iv.words;
- var IV_0 = IV[0];
- var IV_1 = IV[1];
-
- // Generate four subvectors
- var i0 = (((IV_0 << 8) | (IV_0 >>> 24)) & 0x00ff00ff) | (((IV_0 << 24) | (IV_0 >>> 8)) & 0xff00ff00);
- var i2 = (((IV_1 << 8) | (IV_1 >>> 24)) & 0x00ff00ff) | (((IV_1 << 24) | (IV_1 >>> 8)) & 0xff00ff00);
- var i1 = (i0 >>> 16) | (i2 & 0xffff0000);
- var i3 = (i2 << 16) | (i0 & 0x0000ffff);
-
- // Modify counter values
- C[0] ^= i0;
- C[1] ^= i1;
- C[2] ^= i2;
- C[3] ^= i3;
- C[4] ^= i0;
- C[5] ^= i1;
- C[6] ^= i2;
- C[7] ^= i3;
-
- // Iterate the system four times
- for (var i = 0; i < 4; i++) {
- nextState.call(this);
- }
- }
- },
-
- _doProcessBlock: function (M, offset) {
- // Shortcut
- var X = this._X;
-
- // Iterate the system
- nextState.call(this);
-
- // Generate four keystream words
- S[0] = X[0] ^ (X[5] >>> 16) ^ (X[3] << 16);
- S[1] = X[2] ^ (X[7] >>> 16) ^ (X[5] << 16);
- S[2] = X[4] ^ (X[1] >>> 16) ^ (X[7] << 16);
- S[3] = X[6] ^ (X[3] >>> 16) ^ (X[1] << 16);
-
- for (var i = 0; i < 4; i++) {
- // Swap endian
- S[i] = (((S[i] << 8) | (S[i] >>> 24)) & 0x00ff00ff) |
- (((S[i] << 24) | (S[i] >>> 8)) & 0xff00ff00);
-
- // Encrypt
- M[offset + i] ^= S[i];
- }
- },
-
- blockSize: 128/32,
-
- ivSize: 64/32
- });
-
- function nextState() {
- // Shortcuts
- var X = this._X;
- var C = this._C;
-
- // Save old counter values
- for (var i = 0; i < 8; i++) {
- C_[i] = C[i];
- }
-
- // Calculate new counter values
- C[0] = (C[0] + 0x4d34d34d + this._b) | 0;
- C[1] = (C[1] + 0xd34d34d3 + ((C[0] >>> 0) < (C_[0] >>> 0) ? 1 : 0)) | 0;
- C[2] = (C[2] + 0x34d34d34 + ((C[1] >>> 0) < (C_[1] >>> 0) ? 1 : 0)) | 0;
- C[3] = (C[3] + 0x4d34d34d + ((C[2] >>> 0) < (C_[2] >>> 0) ? 1 : 0)) | 0;
- C[4] = (C[4] + 0xd34d34d3 + ((C[3] >>> 0) < (C_[3] >>> 0) ? 1 : 0)) | 0;
- C[5] = (C[5] + 0x34d34d34 + ((C[4] >>> 0) < (C_[4] >>> 0) ? 1 : 0)) | 0;
- C[6] = (C[6] + 0x4d34d34d + ((C[5] >>> 0) < (C_[5] >>> 0) ? 1 : 0)) | 0;
- C[7] = (C[7] + 0xd34d34d3 + ((C[6] >>> 0) < (C_[6] >>> 0) ? 1 : 0)) | 0;
- this._b = (C[7] >>> 0) < (C_[7] >>> 0) ? 1 : 0;
-
- // Calculate the g-values
- for (var i = 0; i < 8; i++) {
- var gx = X[i] + C[i];
-
- // Construct high and low argument for squaring
- var ga = gx & 0xffff;
- var gb = gx >>> 16;
-
- // Calculate high and low result of squaring
- var gh = ((((ga * ga) >>> 17) + ga * gb) >>> 15) + gb * gb;
- var gl = (((gx & 0xffff0000) * gx) | 0) + (((gx & 0x0000ffff) * gx) | 0);
-
- // High XOR low
- G[i] = gh ^ gl;
- }
-
- // Calculate new state values
- X[0] = (G[0] + ((G[7] << 16) | (G[7] >>> 16)) + ((G[6] << 16) | (G[6] >>> 16))) | 0;
- X[1] = (G[1] + ((G[0] << 8) | (G[0] >>> 24)) + G[7]) | 0;
- X[2] = (G[2] + ((G[1] << 16) | (G[1] >>> 16)) + ((G[0] << 16) | (G[0] >>> 16))) | 0;
- X[3] = (G[3] + ((G[2] << 8) | (G[2] >>> 24)) + G[1]) | 0;
- X[4] = (G[4] + ((G[3] << 16) | (G[3] >>> 16)) + ((G[2] << 16) | (G[2] >>> 16))) | 0;
- X[5] = (G[5] + ((G[4] << 8) | (G[4] >>> 24)) + G[3]) | 0;
- X[6] = (G[6] + ((G[5] << 16) | (G[5] >>> 16)) + ((G[4] << 16) | (G[4] >>> 16))) | 0;
- X[7] = (G[7] + ((G[6] << 8) | (G[6] >>> 24)) + G[5]) | 0;
- }
-
- /**
- * Shortcut functions to the cipher's object interface.
- *
- * @example
- *
- * var ciphertext = CryptoJS.RabbitLegacy.encrypt(message, key, cfg);
- * var plaintext = CryptoJS.RabbitLegacy.decrypt(ciphertext, key, cfg);
- */
- C.RabbitLegacy = StreamCipher._createHelper(RabbitLegacy);
- }());
-
-
- return CryptoJS.RabbitLegacy;
-
-}));
-},{"./cipher-core":30,"./core":31,"./enc-base64":32,"./evpkdf":34,"./md5":39}],52:[function(_dereq_,module,exports){
-;(function (root, factory, undef) {
- if (typeof exports === "object") {
- // CommonJS
- module.exports = exports = factory(_dereq_("./core"), _dereq_("./enc-base64"), _dereq_("./md5"), _dereq_("./evpkdf"), _dereq_("./cipher-core"));
- }
- else if (typeof define === "function" && define.amd) {
- // AMD
- define(["./core", "./enc-base64", "./md5", "./evpkdf", "./cipher-core"], factory);
- }
- else {
- // Global (browser)
- factory(root.CryptoJS);
- }
-}(this, function (CryptoJS) {
-
- (function () {
- // Shortcuts
- var C = CryptoJS;
- var C_lib = C.lib;
- var StreamCipher = C_lib.StreamCipher;
- var C_algo = C.algo;
-
- // Reusable objects
- var S = [];
- var C_ = [];
- var G = [];
-
- /**
- * Rabbit stream cipher algorithm
- */
- var Rabbit = C_algo.Rabbit = StreamCipher.extend({
- _doReset: function () {
- // Shortcuts
- var K = this._key.words;
- var iv = this.cfg.iv;
-
- // Swap endian
- for (var i = 0; i < 4; i++) {
- K[i] = (((K[i] << 8) | (K[i] >>> 24)) & 0x00ff00ff) |
- (((K[i] << 24) | (K[i] >>> 8)) & 0xff00ff00);
- }
-
- // Generate initial state values
- var X = this._X = [
- K[0], (K[3] << 16) | (K[2] >>> 16),
- K[1], (K[0] << 16) | (K[3] >>> 16),
- K[2], (K[1] << 16) | (K[0] >>> 16),
- K[3], (K[2] << 16) | (K[1] >>> 16)
- ];
-
- // Generate initial counter values
- var C = this._C = [
- (K[2] << 16) | (K[2] >>> 16), (K[0] & 0xffff0000) | (K[1] & 0x0000ffff),
- (K[3] << 16) | (K[3] >>> 16), (K[1] & 0xffff0000) | (K[2] & 0x0000ffff),
- (K[0] << 16) | (K[0] >>> 16), (K[2] & 0xffff0000) | (K[3] & 0x0000ffff),
- (K[1] << 16) | (K[1] >>> 16), (K[3] & 0xffff0000) | (K[0] & 0x0000ffff)
- ];
-
- // Carry bit
- this._b = 0;
-
- // Iterate the system four times
- for (var i = 0; i < 4; i++) {
- nextState.call(this);
- }
-
- // Modify the counters
- for (var i = 0; i < 8; i++) {
- C[i] ^= X[(i + 4) & 7];
- }
-
- // IV setup
- if (iv) {
- // Shortcuts
- var IV = iv.words;
- var IV_0 = IV[0];
- var IV_1 = IV[1];
-
- // Generate four subvectors
- var i0 = (((IV_0 << 8) | (IV_0 >>> 24)) & 0x00ff00ff) | (((IV_0 << 24) | (IV_0 >>> 8)) & 0xff00ff00);
- var i2 = (((IV_1 << 8) | (IV_1 >>> 24)) & 0x00ff00ff) | (((IV_1 << 24) | (IV_1 >>> 8)) & 0xff00ff00);
- var i1 = (i0 >>> 16) | (i2 & 0xffff0000);
- var i3 = (i2 << 16) | (i0 & 0x0000ffff);
-
- // Modify counter values
- C[0] ^= i0;
- C[1] ^= i1;
- C[2] ^= i2;
- C[3] ^= i3;
- C[4] ^= i0;
- C[5] ^= i1;
- C[6] ^= i2;
- C[7] ^= i3;
-
- // Iterate the system four times
- for (var i = 0; i < 4; i++) {
- nextState.call(this);
- }
- }
- },
-
- _doProcessBlock: function (M, offset) {
- // Shortcut
- var X = this._X;
-
- // Iterate the system
- nextState.call(this);
-
- // Generate four keystream words
- S[0] = X[0] ^ (X[5] >>> 16) ^ (X[3] << 16);
- S[1] = X[2] ^ (X[7] >>> 16) ^ (X[5] << 16);
- S[2] = X[4] ^ (X[1] >>> 16) ^ (X[7] << 16);
- S[3] = X[6] ^ (X[3] >>> 16) ^ (X[1] << 16);
-
- for (var i = 0; i < 4; i++) {
- // Swap endian
- S[i] = (((S[i] << 8) | (S[i] >>> 24)) & 0x00ff00ff) |
- (((S[i] << 24) | (S[i] >>> 8)) & 0xff00ff00);
-
- // Encrypt
- M[offset + i] ^= S[i];
- }
- },
-
- blockSize: 128/32,
-
- ivSize: 64/32
- });
-
- function nextState() {
- // Shortcuts
- var X = this._X;
- var C = this._C;
-
- // Save old counter values
- for (var i = 0; i < 8; i++) {
- C_[i] = C[i];
- }
-
- // Calculate new counter values
- C[0] = (C[0] + 0x4d34d34d + this._b) | 0;
- C[1] = (C[1] + 0xd34d34d3 + ((C[0] >>> 0) < (C_[0] >>> 0) ? 1 : 0)) | 0;
- C[2] = (C[2] + 0x34d34d34 + ((C[1] >>> 0) < (C_[1] >>> 0) ? 1 : 0)) | 0;
- C[3] = (C[3] + 0x4d34d34d + ((C[2] >>> 0) < (C_[2] >>> 0) ? 1 : 0)) | 0;
- C[4] = (C[4] + 0xd34d34d3 + ((C[3] >>> 0) < (C_[3] >>> 0) ? 1 : 0)) | 0;
- C[5] = (C[5] + 0x34d34d34 + ((C[4] >>> 0) < (C_[4] >>> 0) ? 1 : 0)) | 0;
- C[6] = (C[6] + 0x4d34d34d + ((C[5] >>> 0) < (C_[5] >>> 0) ? 1 : 0)) | 0;
- C[7] = (C[7] + 0xd34d34d3 + ((C[6] >>> 0) < (C_[6] >>> 0) ? 1 : 0)) | 0;
- this._b = (C[7] >>> 0) < (C_[7] >>> 0) ? 1 : 0;
-
- // Calculate the g-values
- for (var i = 0; i < 8; i++) {
- var gx = X[i] + C[i];
-
- // Construct high and low argument for squaring
- var ga = gx & 0xffff;
- var gb = gx >>> 16;
-
- // Calculate high and low result of squaring
- var gh = ((((ga * ga) >>> 17) + ga * gb) >>> 15) + gb * gb;
- var gl = (((gx & 0xffff0000) * gx) | 0) + (((gx & 0x0000ffff) * gx) | 0);
-
- // High XOR low
- G[i] = gh ^ gl;
- }
-
- // Calculate new state values
- X[0] = (G[0] + ((G[7] << 16) | (G[7] >>> 16)) + ((G[6] << 16) | (G[6] >>> 16))) | 0;
- X[1] = (G[1] + ((G[0] << 8) | (G[0] >>> 24)) + G[7]) | 0;
- X[2] = (G[2] + ((G[1] << 16) | (G[1] >>> 16)) + ((G[0] << 16) | (G[0] >>> 16))) | 0;
- X[3] = (G[3] + ((G[2] << 8) | (G[2] >>> 24)) + G[1]) | 0;
- X[4] = (G[4] + ((G[3] << 16) | (G[3] >>> 16)) + ((G[2] << 16) | (G[2] >>> 16))) | 0;
- X[5] = (G[5] + ((G[4] << 8) | (G[4] >>> 24)) + G[3]) | 0;
- X[6] = (G[6] + ((G[5] << 16) | (G[5] >>> 16)) + ((G[4] << 16) | (G[4] >>> 16))) | 0;
- X[7] = (G[7] + ((G[6] << 8) | (G[6] >>> 24)) + G[5]) | 0;
- }
-
- /**
- * Shortcut functions to the cipher's object interface.
- *
- * @example
- *
- * var ciphertext = CryptoJS.Rabbit.encrypt(message, key, cfg);
- * var plaintext = CryptoJS.Rabbit.decrypt(ciphertext, key, cfg);
- */
- C.Rabbit = StreamCipher._createHelper(Rabbit);
- }());
-
-
- return CryptoJS.Rabbit;
-
-}));
-},{"./cipher-core":30,"./core":31,"./enc-base64":32,"./evpkdf":34,"./md5":39}],53:[function(_dereq_,module,exports){
-;(function (root, factory, undef) {
- if (typeof exports === "object") {
- // CommonJS
- module.exports = exports = factory(_dereq_("./core"), _dereq_("./enc-base64"), _dereq_("./md5"), _dereq_("./evpkdf"), _dereq_("./cipher-core"));
- }
- else if (typeof define === "function" && define.amd) {
- // AMD
- define(["./core", "./enc-base64", "./md5", "./evpkdf", "./cipher-core"], factory);
- }
- else {
- // Global (browser)
- factory(root.CryptoJS);
- }
-}(this, function (CryptoJS) {
-
- (function () {
- // Shortcuts
- var C = CryptoJS;
- var C_lib = C.lib;
- var StreamCipher = C_lib.StreamCipher;
- var C_algo = C.algo;
-
- /**
- * RC4 stream cipher algorithm.
- */
- var RC4 = C_algo.RC4 = StreamCipher.extend({
- _doReset: function () {
- // Shortcuts
- var key = this._key;
- var keyWords = key.words;
- var keySigBytes = key.sigBytes;
-
- // Init sbox
- var S = this._S = [];
- for (var i = 0; i < 256; i++) {
- S[i] = i;
- }
-
- // Key setup
- for (var i = 0, j = 0; i < 256; i++) {
- var keyByteIndex = i % keySigBytes;
- var keyByte = (keyWords[keyByteIndex >>> 2] >>> (24 - (keyByteIndex % 4) * 8)) & 0xff;
-
- j = (j + S[i] + keyByte) % 256;
-
- // Swap
- var t = S[i];
- S[i] = S[j];
- S[j] = t;
- }
-
- // Counters
- this._i = this._j = 0;
- },
-
- _doProcessBlock: function (M, offset) {
- M[offset] ^= generateKeystreamWord.call(this);
- },
-
- keySize: 256/32,
-
- ivSize: 0
- });
-
- function generateKeystreamWord() {
- // Shortcuts
- var S = this._S;
- var i = this._i;
- var j = this._j;
-
- // Generate keystream word
- var keystreamWord = 0;
- for (var n = 0; n < 4; n++) {
- i = (i + 1) % 256;
- j = (j + S[i]) % 256;
-
- // Swap
- var t = S[i];
- S[i] = S[j];
- S[j] = t;
-
- keystreamWord |= S[(S[i] + S[j]) % 256] << (24 - n * 8);
- }
-
- // Update counters
- this._i = i;
- this._j = j;
-
- return keystreamWord;
- }
-
- /**
- * Shortcut functions to the cipher's object interface.
- *
- * @example
- *
- * var ciphertext = CryptoJS.RC4.encrypt(message, key, cfg);
- * var plaintext = CryptoJS.RC4.decrypt(ciphertext, key, cfg);
- */
- C.RC4 = StreamCipher._createHelper(RC4);
-
- /**
- * Modified RC4 stream cipher algorithm.
- */
- var RC4Drop = C_algo.RC4Drop = RC4.extend({
- /**
- * Configuration options.
- *
- * @property {number} drop The number of keystream words to drop. Default 192
- */
- cfg: RC4.cfg.extend({
- drop: 192
- }),
-
- _doReset: function () {
- RC4._doReset.call(this);
-
- // Drop
- for (var i = this.cfg.drop; i > 0; i--) {
- generateKeystreamWord.call(this);
- }
- }
- });
-
- /**
- * Shortcut functions to the cipher's object interface.
- *
- * @example
- *
- * var ciphertext = CryptoJS.RC4Drop.encrypt(message, key, cfg);
- * var plaintext = CryptoJS.RC4Drop.decrypt(ciphertext, key, cfg);
- */
- C.RC4Drop = StreamCipher._createHelper(RC4Drop);
- }());
-
-
- return CryptoJS.RC4;
-
-}));
-},{"./cipher-core":30,"./core":31,"./enc-base64":32,"./evpkdf":34,"./md5":39}],54:[function(_dereq_,module,exports){
-;(function (root, factory) {
- if (typeof exports === "object") {
- // CommonJS
- module.exports = exports = factory(_dereq_("./core"));
- }
- else if (typeof define === "function" && define.amd) {
- // AMD
- define(["./core"], factory);
- }
- else {
- // Global (browser)
- factory(root.CryptoJS);
- }
-}(this, function (CryptoJS) {
+ var ret = state.length < state.highWaterMark;
+ // we must ensure that previous needDrain will not be reset to false.
+ if (!ret)
+ state.needDrain = true;
- /** @preserve
- (c) 2012 by Cédric Mesnil. All rights reserved.
+ if (state.writing || state.corked)
+ state.buffer.push(new WriteReq(chunk, encoding, cb));
+ else
+ doWrite(stream, state, false, len, chunk, encoding, cb);
- Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
+ return ret;
+}
- - 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.
+function doWrite(stream, state, writev, len, chunk, encoding, cb) {
+ state.writelen = len;
+ state.writecb = cb;
+ state.writing = true;
+ state.sync = true;
+ if (writev)
+ stream._writev(chunk, state.onwrite);
+ else
+ stream._write(chunk, encoding, state.onwrite);
+ state.sync = false;
+}
- 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.
- */
+function onwriteError(stream, state, sync, er, cb) {
+ if (sync)
+ process.nextTick(function() {
+ state.pendingcb--;
+ cb(er);
+ });
+ else {
+ state.pendingcb--;
+ cb(er);
+ }
- (function (Math) {
- // Shortcuts
- var C = CryptoJS;
- var C_lib = C.lib;
- var WordArray = C_lib.WordArray;
- var Hasher = C_lib.Hasher;
- var C_algo = C.algo;
-
- // Constants table
- var _zl = WordArray.create([
- 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 = WordArray.create([
- 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 = WordArray.create([
- 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 = WordArray.create([
- 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 = WordArray.create([ 0x00000000, 0x5A827999, 0x6ED9EBA1, 0x8F1BBCDC, 0xA953FD4E]);
- var _hr = WordArray.create([ 0x50A28BE6, 0x5C4DD124, 0x6D703EF3, 0x7A6D76E9, 0x00000000]);
-
- /**
- * RIPEMD160 hash algorithm.
- */
- var RIPEMD160 = C_algo.RIPEMD160 = Hasher.extend({
- _doReset: function () {
- this._hash = WordArray.create([0x67452301, 0xEFCDAB89, 0x98BADCFE, 0x10325476, 0xC3D2E1F0]);
- },
-
- _doProcessBlock: function (M, offset) {
-
- // Swap endian
- for (var i = 0; i < 16; i++) {
- // Shortcuts
- 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)
- );
- }
- // Shortcut
- var H = this._hash.words;
- var hl = _hl.words;
- var hr = _hr.words;
- var zl = _zl.words;
- var zr = _zr.words;
- var sl = _sl.words;
- var sr = _sr.words;
-
- // 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;
- },
-
- _doFinalize: function () {
- // Shortcuts
- var data = this._data;
- var dataWords = data.words;
-
- var nBitsTotal = this._nDataBytes * 8;
- var nBitsLeft = data.sigBytes * 8;
-
- // Add padding
- dataWords[nBitsLeft >>> 5] |= 0x80 << (24 - nBitsLeft % 32);
- dataWords[(((nBitsLeft + 64) >>> 9) << 4) + 14] = (
- (((nBitsTotal << 8) | (nBitsTotal >>> 24)) & 0x00ff00ff) |
- (((nBitsTotal << 24) | (nBitsTotal >>> 8)) & 0xff00ff00)
- );
- data.sigBytes = (dataWords.length + 1) * 4;
-
- // Hash final blocks
- this._process();
-
- // Shortcuts
- var hash = this._hash;
- var H = hash.words;
-
- // 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);
- }
-
- // Return final computed hash
- return hash;
- },
-
- clone: function () {
- var clone = Hasher.clone.call(this);
- clone._hash = this._hash.clone();
-
- return clone;
- }
- });
-
-
- 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));
- }
-
-
- /**
- * Shortcut function to the hasher's object interface.
- *
- * @param {WordArray|string} message The message to hash.
- *
- * @return {WordArray} The hash.
- *
- * @static
- *
- * @example
- *
- * var hash = CryptoJS.RIPEMD160('message');
- * var hash = CryptoJS.RIPEMD160(wordArray);
- */
- C.RIPEMD160 = Hasher._createHelper(RIPEMD160);
-
- /**
- * Shortcut function to the HMAC's object interface.
- *
- * @param {WordArray|string} message The message to hash.
- * @param {WordArray|string} key The secret key.
- *
- * @return {WordArray} The HMAC.
- *
- * @static
- *
- * @example
- *
- * var hmac = CryptoJS.HmacRIPEMD160(message, key);
- */
- C.HmacRIPEMD160 = Hasher._createHmacHelper(RIPEMD160);
- }(Math));
-
-
- return CryptoJS.RIPEMD160;
-
-}));
-},{"./core":31}],55:[function(_dereq_,module,exports){
-;(function (root, factory) {
- if (typeof exports === "object") {
- // CommonJS
- module.exports = exports = factory(_dereq_("./core"));
- }
- else if (typeof define === "function" && define.amd) {
- // AMD
- define(["./core"], factory);
- }
- else {
- // Global (browser)
- factory(root.CryptoJS);
- }
-}(this, function (CryptoJS) {
-
- (function () {
- // Shortcuts
- var C = CryptoJS;
- var C_lib = C.lib;
- var WordArray = C_lib.WordArray;
- var Hasher = C_lib.Hasher;
- var C_algo = C.algo;
-
- // Reusable object
- var W = [];
-
- /**
- * SHA-1 hash algorithm.
- */
- var SHA1 = C_algo.SHA1 = Hasher.extend({
- _doReset: function () {
- this._hash = new WordArray.init([
- 0x67452301, 0xefcdab89,
- 0x98badcfe, 0x10325476,
- 0xc3d2e1f0
- ]);
- },
-
- _doProcessBlock: function (M, offset) {
- // Shortcut
- var H = this._hash.words;
-
- // Working variables
- var a = H[0];
- var b = H[1];
- var c = H[2];
- var d = H[3];
- var e = H[4];
-
- // Computation
- for (var i = 0; i < 80; i++) {
- if (i < 16) {
- W[i] = M[offset + i] | 0;
- } else {
- var n = W[i - 3] ^ W[i - 8] ^ W[i - 14] ^ W[i - 16];
- W[i] = (n << 1) | (n >>> 31);
- }
-
- var t = ((a << 5) | (a >>> 27)) + e + W[i];
- if (i < 20) {
- t += ((b & c) | (~b & d)) + 0x5a827999;
- } else if (i < 40) {
- t += (b ^ c ^ d) + 0x6ed9eba1;
- } else if (i < 60) {
- t += ((b & c) | (b & d) | (c & d)) - 0x70e44324;
- } else /* if (i < 80) */ {
- t += (b ^ c ^ d) - 0x359d3e2a;
- }
-
- e = d;
- d = c;
- c = (b << 30) | (b >>> 2);
- b = a;
- a = t;
- }
-
- // Intermediate hash value
- H[0] = (H[0] + a) | 0;
- H[1] = (H[1] + b) | 0;
- H[2] = (H[2] + c) | 0;
- H[3] = (H[3] + d) | 0;
- H[4] = (H[4] + e) | 0;
- },
-
- _doFinalize: function () {
- // Shortcuts
- var data = this._data;
- var dataWords = data.words;
-
- var nBitsTotal = this._nDataBytes * 8;
- var nBitsLeft = data.sigBytes * 8;
-
- // Add padding
- dataWords[nBitsLeft >>> 5] |= 0x80 << (24 - nBitsLeft % 32);
- dataWords[(((nBitsLeft + 64) >>> 9) << 4) + 14] = Math.floor(nBitsTotal / 0x100000000);
- dataWords[(((nBitsLeft + 64) >>> 9) << 4) + 15] = nBitsTotal;
- data.sigBytes = dataWords.length * 4;
-
- // Hash final blocks
- this._process();
-
- // Return final computed hash
- return this._hash;
- },
-
- clone: function () {
- var clone = Hasher.clone.call(this);
- clone._hash = this._hash.clone();
-
- return clone;
- }
- });
-
- /**
- * Shortcut function to the hasher's object interface.
- *
- * @param {WordArray|string} message The message to hash.
- *
- * @return {WordArray} The hash.
- *
- * @static
- *
- * @example
- *
- * var hash = CryptoJS.SHA1('message');
- * var hash = CryptoJS.SHA1(wordArray);
- */
- C.SHA1 = Hasher._createHelper(SHA1);
-
- /**
- * Shortcut function to the HMAC's object interface.
- *
- * @param {WordArray|string} message The message to hash.
- * @param {WordArray|string} key The secret key.
- *
- * @return {WordArray} The HMAC.
- *
- * @static
- *
- * @example
- *
- * var hmac = CryptoJS.HmacSHA1(message, key);
- */
- C.HmacSHA1 = Hasher._createHmacHelper(SHA1);
- }());
-
-
- return CryptoJS.SHA1;
-
-}));
-},{"./core":31}],56:[function(_dereq_,module,exports){
-;(function (root, factory, undef) {
- if (typeof exports === "object") {
- // CommonJS
- module.exports = exports = factory(_dereq_("./core"), _dereq_("./sha256"));
- }
- else if (typeof define === "function" && define.amd) {
- // AMD
- define(["./core", "./sha256"], factory);
- }
- else {
- // Global (browser)
- factory(root.CryptoJS);
- }
-}(this, function (CryptoJS) {
-
- (function () {
- // Shortcuts
- var C = CryptoJS;
- var C_lib = C.lib;
- var WordArray = C_lib.WordArray;
- var C_algo = C.algo;
- var SHA256 = C_algo.SHA256;
-
- /**
- * SHA-224 hash algorithm.
- */
- var SHA224 = C_algo.SHA224 = SHA256.extend({
- _doReset: function () {
- this._hash = new WordArray.init([
- 0xc1059ed8, 0x367cd507, 0x3070dd17, 0xf70e5939,
- 0xffc00b31, 0x68581511, 0x64f98fa7, 0xbefa4fa4
- ]);
- },
-
- _doFinalize: function () {
- var hash = SHA256._doFinalize.call(this);
-
- hash.sigBytes -= 4;
-
- return hash;
- }
- });
-
- /**
- * Shortcut function to the hasher's object interface.
- *
- * @param {WordArray|string} message The message to hash.
- *
- * @return {WordArray} The hash.
- *
- * @static
- *
- * @example
- *
- * var hash = CryptoJS.SHA224('message');
- * var hash = CryptoJS.SHA224(wordArray);
- */
- C.SHA224 = SHA256._createHelper(SHA224);
-
- /**
- * Shortcut function to the HMAC's object interface.
- *
- * @param {WordArray|string} message The message to hash.
- * @param {WordArray|string} key The secret key.
- *
- * @return {WordArray} The HMAC.
- *
- * @static
- *
- * @example
- *
- * var hmac = CryptoJS.HmacSHA224(message, key);
- */
- C.HmacSHA224 = SHA256._createHmacHelper(SHA224);
- }());
-
-
- return CryptoJS.SHA224;
-
-}));
-},{"./core":31,"./sha256":57}],57:[function(_dereq_,module,exports){
-;(function (root, factory) {
- if (typeof exports === "object") {
- // CommonJS
- module.exports = exports = factory(_dereq_("./core"));
- }
- else if (typeof define === "function" && define.amd) {
- // AMD
- define(["./core"], factory);
- }
- else {
- // Global (browser)
- factory(root.CryptoJS);
- }
-}(this, function (CryptoJS) {
-
- (function (Math) {
- // Shortcuts
- var C = CryptoJS;
- var C_lib = C.lib;
- var WordArray = C_lib.WordArray;
- var Hasher = C_lib.Hasher;
- var C_algo = C.algo;
-
- // Initialization and round constants tables
- var H = [];
- var K = [];
-
- // Compute constants
- (function () {
- function isPrime(n) {
- var sqrtN = Math.sqrt(n);
- for (var factor = 2; factor <= sqrtN; factor++) {
- if (!(n % factor)) {
- return false;
- }
- }
-
- return true;
- }
-
- function getFractionalBits(n) {
- return ((n - (n | 0)) * 0x100000000) | 0;
- }
-
- var n = 2;
- var nPrime = 0;
- while (nPrime < 64) {
- if (isPrime(n)) {
- if (nPrime < 8) {
- H[nPrime] = getFractionalBits(Math.pow(n, 1 / 2));
- }
- K[nPrime] = getFractionalBits(Math.pow(n, 1 / 3));
-
- nPrime++;
- }
-
- n++;
- }
- }());
-
- // Reusable object
- var W = [];
-
- /**
- * SHA-256 hash algorithm.
- */
- var SHA256 = C_algo.SHA256 = Hasher.extend({
- _doReset: function () {
- this._hash = new WordArray.init(H.slice(0));
- },
-
- _doProcessBlock: function (M, offset) {
- // Shortcut
- var H = this._hash.words;
-
- // Working variables
- var a = H[0];
- var b = H[1];
- var c = H[2];
- var d = H[3];
- var e = H[4];
- var f = H[5];
- var g = H[6];
- var h = H[7];
-
- // Computation
- for (var i = 0; i < 64; i++) {
- if (i < 16) {
- W[i] = M[offset + i] | 0;
- } else {
- var gamma0x = W[i - 15];
- var gamma0 = ((gamma0x << 25) | (gamma0x >>> 7)) ^
- ((gamma0x << 14) | (gamma0x >>> 18)) ^
- (gamma0x >>> 3);
-
- var gamma1x = W[i - 2];
- var gamma1 = ((gamma1x << 15) | (gamma1x >>> 17)) ^
- ((gamma1x << 13) | (gamma1x >>> 19)) ^
- (gamma1x >>> 10);
-
- W[i] = gamma0 + W[i - 7] + gamma1 + W[i - 16];
- }
-
- var ch = (e & f) ^ (~e & g);
- var maj = (a & b) ^ (a & c) ^ (b & c);
-
- var sigma0 = ((a << 30) | (a >>> 2)) ^ ((a << 19) | (a >>> 13)) ^ ((a << 10) | (a >>> 22));
- var sigma1 = ((e << 26) | (e >>> 6)) ^ ((e << 21) | (e >>> 11)) ^ ((e << 7) | (e >>> 25));
-
- var t1 = h + sigma1 + ch + K[i] + W[i];
- var t2 = sigma0 + maj;
-
- h = g;
- g = f;
- f = e;
- e = (d + t1) | 0;
- d = c;
- c = b;
- b = a;
- a = (t1 + t2) | 0;
- }
-
- // Intermediate hash value
- H[0] = (H[0] + a) | 0;
- H[1] = (H[1] + b) | 0;
- H[2] = (H[2] + c) | 0;
- H[3] = (H[3] + d) | 0;
- H[4] = (H[4] + e) | 0;
- H[5] = (H[5] + f) | 0;
- H[6] = (H[6] + g) | 0;
- H[7] = (H[7] + h) | 0;
- },
-
- _doFinalize: function () {
- // Shortcuts
- var data = this._data;
- var dataWords = data.words;
-
- var nBitsTotal = this._nDataBytes * 8;
- var nBitsLeft = data.sigBytes * 8;
-
- // Add padding
- dataWords[nBitsLeft >>> 5] |= 0x80 << (24 - nBitsLeft % 32);
- dataWords[(((nBitsLeft + 64) >>> 9) << 4) + 14] = Math.floor(nBitsTotal / 0x100000000);
- dataWords[(((nBitsLeft + 64) >>> 9) << 4) + 15] = nBitsTotal;
- data.sigBytes = dataWords.length * 4;
-
- // Hash final blocks
- this._process();
-
- // Return final computed hash
- return this._hash;
- },
-
- clone: function () {
- var clone = Hasher.clone.call(this);
- clone._hash = this._hash.clone();
-
- return clone;
- }
- });
-
- /**
- * Shortcut function to the hasher's object interface.
- *
- * @param {WordArray|string} message The message to hash.
- *
- * @return {WordArray} The hash.
- *
- * @static
- *
- * @example
- *
- * var hash = CryptoJS.SHA256('message');
- * var hash = CryptoJS.SHA256(wordArray);
- */
- C.SHA256 = Hasher._createHelper(SHA256);
-
- /**
- * Shortcut function to the HMAC's object interface.
- *
- * @param {WordArray|string} message The message to hash.
- * @param {WordArray|string} key The secret key.
- *
- * @return {WordArray} The HMAC.
- *
- * @static
- *
- * @example
- *
- * var hmac = CryptoJS.HmacSHA256(message, key);
- */
- C.HmacSHA256 = Hasher._createHmacHelper(SHA256);
- }(Math));
-
-
- return CryptoJS.SHA256;
-
-}));
-},{"./core":31}],58:[function(_dereq_,module,exports){
-;(function (root, factory, undef) {
- if (typeof exports === "object") {
- // CommonJS
- module.exports = exports = factory(_dereq_("./core"), _dereq_("./x64-core"));
- }
- else if (typeof define === "function" && define.amd) {
- // AMD
- define(["./core", "./x64-core"], factory);
- }
- else {
- // Global (browser)
- factory(root.CryptoJS);
- }
-}(this, function (CryptoJS) {
-
- (function (Math) {
- // Shortcuts
- var C = CryptoJS;
- var C_lib = C.lib;
- var WordArray = C_lib.WordArray;
- var Hasher = C_lib.Hasher;
- var C_x64 = C.x64;
- var X64Word = C_x64.Word;
- var C_algo = C.algo;
-
- // Constants tables
- var RHO_OFFSETS = [];
- var PI_INDEXES = [];
- var ROUND_CONSTANTS = [];
-
- // Compute Constants
- (function () {
- // Compute rho offset constants
- var x = 1, y = 0;
- for (var t = 0; t < 24; t++) {
- RHO_OFFSETS[x + 5 * y] = ((t + 1) * (t + 2) / 2) % 64;
-
- var newX = y % 5;
- var newY = (2 * x + 3 * y) % 5;
- x = newX;
- y = newY;
- }
-
- // Compute pi index constants
- for (var x = 0; x < 5; x++) {
- for (var y = 0; y < 5; y++) {
- PI_INDEXES[x + 5 * y] = y + ((2 * x + 3 * y) % 5) * 5;
- }
- }
-
- // Compute round constants
- var LFSR = 0x01;
- for (var i = 0; i < 24; i++) {
- var roundConstantMsw = 0;
- var roundConstantLsw = 0;
-
- for (var j = 0; j < 7; j++) {
- if (LFSR & 0x01) {
- var bitPosition = (1 << j) - 1;
- if (bitPosition < 32) {
- roundConstantLsw ^= 1 << bitPosition;
- } else /* if (bitPosition >= 32) */ {
- roundConstantMsw ^= 1 << (bitPosition - 32);
- }
- }
-
- // Compute next LFSR
- if (LFSR & 0x80) {
- // Primitive polynomial over GF(2): x^8 + x^6 + x^5 + x^4 + 1
- LFSR = (LFSR << 1) ^ 0x71;
- } else {
- LFSR <<= 1;
- }
- }
-
- ROUND_CONSTANTS[i] = X64Word.create(roundConstantMsw, roundConstantLsw);
- }
- }());
-
- // Reusable objects for temporary values
- var T = [];
- (function () {
- for (var i = 0; i < 25; i++) {
- T[i] = X64Word.create();
- }
- }());
-
- /**
- * SHA-3 hash algorithm.
- */
- var SHA3 = C_algo.SHA3 = Hasher.extend({
- /**
- * Configuration options.
- *
- * @property {number} outputLength
- * The desired number of bits in the output hash.
- * Only values permitted are: 224, 256, 384, 512.
- * Default: 512
- */
- cfg: Hasher.cfg.extend({
- outputLength: 512
- }),
-
- _doReset: function () {
- var state = this._state = []
- for (var i = 0; i < 25; i++) {
- state[i] = new X64Word.init();
- }
-
- this.blockSize = (1600 - 2 * this.cfg.outputLength) / 32;
- },
-
- _doProcessBlock: function (M, offset) {
- // Shortcuts
- var state = this._state;
- var nBlockSizeLanes = this.blockSize / 2;
-
- // Absorb
- for (var i = 0; i < nBlockSizeLanes; i++) {
- // Shortcuts
- var M2i = M[offset + 2 * i];
- var M2i1 = M[offset + 2 * i + 1];
-
- // Swap endian
- M2i = (
- (((M2i << 8) | (M2i >>> 24)) & 0x00ff00ff) |
- (((M2i << 24) | (M2i >>> 8)) & 0xff00ff00)
- );
- M2i1 = (
- (((M2i1 << 8) | (M2i1 >>> 24)) & 0x00ff00ff) |
- (((M2i1 << 24) | (M2i1 >>> 8)) & 0xff00ff00)
- );
-
- // Absorb message into state
- var lane = state[i];
- lane.high ^= M2i1;
- lane.low ^= M2i;
- }
-
- // Rounds
- for (var round = 0; round < 24; round++) {
- // Theta
- for (var x = 0; x < 5; x++) {
- // Mix column lanes
- var tMsw = 0, tLsw = 0;
- for (var y = 0; y < 5; y++) {
- var lane = state[x + 5 * y];
- tMsw ^= lane.high;
- tLsw ^= lane.low;
- }
-
- // Temporary values
- var Tx = T[x];
- Tx.high = tMsw;
- Tx.low = tLsw;
- }
- for (var x = 0; x < 5; x++) {
- // Shortcuts
- var Tx4 = T[(x + 4) % 5];
- var Tx1 = T[(x + 1) % 5];
- var Tx1Msw = Tx1.high;
- var Tx1Lsw = Tx1.low;
-
- // Mix surrounding columns
- var tMsw = Tx4.high ^ ((Tx1Msw << 1) | (Tx1Lsw >>> 31));
- var tLsw = Tx4.low ^ ((Tx1Lsw << 1) | (Tx1Msw >>> 31));
- for (var y = 0; y < 5; y++) {
- var lane = state[x + 5 * y];
- lane.high ^= tMsw;
- lane.low ^= tLsw;
- }
- }
-
- // Rho Pi
- for (var laneIndex = 1; laneIndex < 25; laneIndex++) {
- // Shortcuts
- var lane = state[laneIndex];
- var laneMsw = lane.high;
- var laneLsw = lane.low;
- var rhoOffset = RHO_OFFSETS[laneIndex];
-
- // Rotate lanes
- if (rhoOffset < 32) {
- var tMsw = (laneMsw << rhoOffset) | (laneLsw >>> (32 - rhoOffset));
- var tLsw = (laneLsw << rhoOffset) | (laneMsw >>> (32 - rhoOffset));
- } else /* if (rhoOffset >= 32) */ {
- var tMsw = (laneLsw << (rhoOffset - 32)) | (laneMsw >>> (64 - rhoOffset));
- var tLsw = (laneMsw << (rhoOffset - 32)) | (laneLsw >>> (64 - rhoOffset));
- }
-
- // Transpose lanes
- var TPiLane = T[PI_INDEXES[laneIndex]];
- TPiLane.high = tMsw;
- TPiLane.low = tLsw;
- }
-
- // Rho pi at x = y = 0
- var T0 = T[0];
- var state0 = state[0];
- T0.high = state0.high;
- T0.low = state0.low;
-
- // Chi
- for (var x = 0; x < 5; x++) {
- for (var y = 0; y < 5; y++) {
- // Shortcuts
- var laneIndex = x + 5 * y;
- var lane = state[laneIndex];
- var TLane = T[laneIndex];
- var Tx1Lane = T[((x + 1) % 5) + 5 * y];
- var Tx2Lane = T[((x + 2) % 5) + 5 * y];
-
- // Mix rows
- lane.high = TLane.high ^ (~Tx1Lane.high & Tx2Lane.high);
- lane.low = TLane.low ^ (~Tx1Lane.low & Tx2Lane.low);
- }
- }
-
- // Iota
- var lane = state[0];
- var roundConstant = ROUND_CONSTANTS[round];
- lane.high ^= roundConstant.high;
- lane.low ^= roundConstant.low;;
- }
- },
-
- _doFinalize: function () {
- // Shortcuts
- var data = this._data;
- var dataWords = data.words;
- var nBitsTotal = this._nDataBytes * 8;
- var nBitsLeft = data.sigBytes * 8;
- var blockSizeBits = this.blockSize * 32;
-
- // Add padding
- dataWords[nBitsLeft >>> 5] |= 0x1 << (24 - nBitsLeft % 32);
- dataWords[((Math.ceil((nBitsLeft + 1) / blockSizeBits) * blockSizeBits) >>> 5) - 1] |= 0x80;
- data.sigBytes = dataWords.length * 4;
-
- // Hash final blocks
- this._process();
-
- // Shortcuts
- var state = this._state;
- var outputLengthBytes = this.cfg.outputLength / 8;
- var outputLengthLanes = outputLengthBytes / 8;
-
- // Squeeze
- var hashWords = [];
- for (var i = 0; i < outputLengthLanes; i++) {
- // Shortcuts
- var lane = state[i];
- var laneMsw = lane.high;
- var laneLsw = lane.low;
-
- // Swap endian
- laneMsw = (
- (((laneMsw << 8) | (laneMsw >>> 24)) & 0x00ff00ff) |
- (((laneMsw << 24) | (laneMsw >>> 8)) & 0xff00ff00)
- );
- laneLsw = (
- (((laneLsw << 8) | (laneLsw >>> 24)) & 0x00ff00ff) |
- (((laneLsw << 24) | (laneLsw >>> 8)) & 0xff00ff00)
- );
-
- // Squeeze state to retrieve hash
- hashWords.push(laneLsw);
- hashWords.push(laneMsw);
- }
-
- // Return final computed hash
- return new WordArray.init(hashWords, outputLengthBytes);
- },
-
- clone: function () {
- var clone = Hasher.clone.call(this);
-
- var state = clone._state = this._state.slice(0);
- for (var i = 0; i < 25; i++) {
- state[i] = state[i].clone();
- }
-
- return clone;
- }
- });
-
- /**
- * Shortcut function to the hasher's object interface.
- *
- * @param {WordArray|string} message The message to hash.
- *
- * @return {WordArray} The hash.
- *
- * @static
- *
- * @example
- *
- * var hash = CryptoJS.SHA3('message');
- * var hash = CryptoJS.SHA3(wordArray);
- */
- C.SHA3 = Hasher._createHelper(SHA3);
-
- /**
- * Shortcut function to the HMAC's object interface.
- *
- * @param {WordArray|string} message The message to hash.
- * @param {WordArray|string} key The secret key.
- *
- * @return {WordArray} The HMAC.
- *
- * @static
- *
- * @example
- *
- * var hmac = CryptoJS.HmacSHA3(message, key);
- */
- C.HmacSHA3 = Hasher._createHmacHelper(SHA3);
- }(Math));
-
-
- return CryptoJS.SHA3;
-
-}));
-},{"./core":31,"./x64-core":62}],59:[function(_dereq_,module,exports){
-;(function (root, factory, undef) {
- if (typeof exports === "object") {
- // CommonJS
- module.exports = exports = factory(_dereq_("./core"), _dereq_("./x64-core"), _dereq_("./sha512"));
- }
- else if (typeof define === "function" && define.amd) {
- // AMD
- define(["./core", "./x64-core", "./sha512"], factory);
- }
- else {
- // Global (browser)
- factory(root.CryptoJS);
- }
-}(this, function (CryptoJS) {
-
- (function () {
- // Shortcuts
- var C = CryptoJS;
- var C_x64 = C.x64;
- var X64Word = C_x64.Word;
- var X64WordArray = C_x64.WordArray;
- var C_algo = C.algo;
- var SHA512 = C_algo.SHA512;
-
- /**
- * SHA-384 hash algorithm.
- */
- var SHA384 = C_algo.SHA384 = SHA512.extend({
- _doReset: function () {
- this._hash = new X64WordArray.init([
- new X64Word.init(0xcbbb9d5d, 0xc1059ed8), new X64Word.init(0x629a292a, 0x367cd507),
- new X64Word.init(0x9159015a, 0x3070dd17), new X64Word.init(0x152fecd8, 0xf70e5939),
- new X64Word.init(0x67332667, 0xffc00b31), new X64Word.init(0x8eb44a87, 0x68581511),
- new X64Word.init(0xdb0c2e0d, 0x64f98fa7), new X64Word.init(0x47b5481d, 0xbefa4fa4)
- ]);
- },
-
- _doFinalize: function () {
- var hash = SHA512._doFinalize.call(this);
-
- hash.sigBytes -= 16;
-
- return hash;
- }
- });
-
- /**
- * Shortcut function to the hasher's object interface.
- *
- * @param {WordArray|string} message The message to hash.
- *
- * @return {WordArray} The hash.
- *
- * @static
- *
- * @example
- *
- * var hash = CryptoJS.SHA384('message');
- * var hash = CryptoJS.SHA384(wordArray);
- */
- C.SHA384 = SHA512._createHelper(SHA384);
-
- /**
- * Shortcut function to the HMAC's object interface.
- *
- * @param {WordArray|string} message The message to hash.
- * @param {WordArray|string} key The secret key.
- *
- * @return {WordArray} The HMAC.
- *
- * @static
- *
- * @example
- *
- * var hmac = CryptoJS.HmacSHA384(message, key);
- */
- C.HmacSHA384 = SHA512._createHmacHelper(SHA384);
- }());
-
-
- return CryptoJS.SHA384;
-
-}));
-},{"./core":31,"./sha512":60,"./x64-core":62}],60:[function(_dereq_,module,exports){
-;(function (root, factory, undef) {
- if (typeof exports === "object") {
- // CommonJS
- module.exports = exports = factory(_dereq_("./core"), _dereq_("./x64-core"));
- }
- else if (typeof define === "function" && define.amd) {
- // AMD
- define(["./core", "./x64-core"], factory);
- }
- else {
- // Global (browser)
- factory(root.CryptoJS);
- }
-}(this, function (CryptoJS) {
-
- (function () {
- // Shortcuts
- var C = CryptoJS;
- var C_lib = C.lib;
- var Hasher = C_lib.Hasher;
- var C_x64 = C.x64;
- var X64Word = C_x64.Word;
- var X64WordArray = C_x64.WordArray;
- var C_algo = C.algo;
-
- function X64Word_create() {
- return X64Word.create.apply(X64Word, arguments);
- }
-
- // Constants
- var K = [
- X64Word_create(0x428a2f98, 0xd728ae22), X64Word_create(0x71374491, 0x23ef65cd),
- X64Word_create(0xb5c0fbcf, 0xec4d3b2f), X64Word_create(0xe9b5dba5, 0x8189dbbc),
- X64Word_create(0x3956c25b, 0xf348b538), X64Word_create(0x59f111f1, 0xb605d019),
- X64Word_create(0x923f82a4, 0xaf194f9b), X64Word_create(0xab1c5ed5, 0xda6d8118),
- X64Word_create(0xd807aa98, 0xa3030242), X64Word_create(0x12835b01, 0x45706fbe),
- X64Word_create(0x243185be, 0x4ee4b28c), X64Word_create(0x550c7dc3, 0xd5ffb4e2),
- X64Word_create(0x72be5d74, 0xf27b896f), X64Word_create(0x80deb1fe, 0x3b1696b1),
- X64Word_create(0x9bdc06a7, 0x25c71235), X64Word_create(0xc19bf174, 0xcf692694),
- X64Word_create(0xe49b69c1, 0x9ef14ad2), X64Word_create(0xefbe4786, 0x384f25e3),
- X64Word_create(0x0fc19dc6, 0x8b8cd5b5), X64Word_create(0x240ca1cc, 0x77ac9c65),
- X64Word_create(0x2de92c6f, 0x592b0275), X64Word_create(0x4a7484aa, 0x6ea6e483),
- X64Word_create(0x5cb0a9dc, 0xbd41fbd4), X64Word_create(0x76f988da, 0x831153b5),
- X64Word_create(0x983e5152, 0xee66dfab), X64Word_create(0xa831c66d, 0x2db43210),
- X64Word_create(0xb00327c8, 0x98fb213f), X64Word_create(0xbf597fc7, 0xbeef0ee4),
- X64Word_create(0xc6e00bf3, 0x3da88fc2), X64Word_create(0xd5a79147, 0x930aa725),
- X64Word_create(0x06ca6351, 0xe003826f), X64Word_create(0x14292967, 0x0a0e6e70),
- X64Word_create(0x27b70a85, 0x46d22ffc), X64Word_create(0x2e1b2138, 0x5c26c926),
- X64Word_create(0x4d2c6dfc, 0x5ac42aed), X64Word_create(0x53380d13, 0x9d95b3df),
- X64Word_create(0x650a7354, 0x8baf63de), X64Word_create(0x766a0abb, 0x3c77b2a8),
- X64Word_create(0x81c2c92e, 0x47edaee6), X64Word_create(0x92722c85, 0x1482353b),
- X64Word_create(0xa2bfe8a1, 0x4cf10364), X64Word_create(0xa81a664b, 0xbc423001),
- X64Word_create(0xc24b8b70, 0xd0f89791), X64Word_create(0xc76c51a3, 0x0654be30),
- X64Word_create(0xd192e819, 0xd6ef5218), X64Word_create(0xd6990624, 0x5565a910),
- X64Word_create(0xf40e3585, 0x5771202a), X64Word_create(0x106aa070, 0x32bbd1b8),
- X64Word_create(0x19a4c116, 0xb8d2d0c8), X64Word_create(0x1e376c08, 0x5141ab53),
- X64Word_create(0x2748774c, 0xdf8eeb99), X64Word_create(0x34b0bcb5, 0xe19b48a8),
- X64Word_create(0x391c0cb3, 0xc5c95a63), X64Word_create(0x4ed8aa4a, 0xe3418acb),
- X64Word_create(0x5b9cca4f, 0x7763e373), X64Word_create(0x682e6ff3, 0xd6b2b8a3),
- X64Word_create(0x748f82ee, 0x5defb2fc), X64Word_create(0x78a5636f, 0x43172f60),
- X64Word_create(0x84c87814, 0xa1f0ab72), X64Word_create(0x8cc70208, 0x1a6439ec),
- X64Word_create(0x90befffa, 0x23631e28), X64Word_create(0xa4506ceb, 0xde82bde9),
- X64Word_create(0xbef9a3f7, 0xb2c67915), X64Word_create(0xc67178f2, 0xe372532b),
- X64Word_create(0xca273ece, 0xea26619c), X64Word_create(0xd186b8c7, 0x21c0c207),
- X64Word_create(0xeada7dd6, 0xcde0eb1e), X64Word_create(0xf57d4f7f, 0xee6ed178),
- X64Word_create(0x06f067aa, 0x72176fba), X64Word_create(0x0a637dc5, 0xa2c898a6),
- X64Word_create(0x113f9804, 0xbef90dae), X64Word_create(0x1b710b35, 0x131c471b),
- X64Word_create(0x28db77f5, 0x23047d84), X64Word_create(0x32caab7b, 0x40c72493),
- X64Word_create(0x3c9ebe0a, 0x15c9bebc), X64Word_create(0x431d67c4, 0x9c100d4c),
- X64Word_create(0x4cc5d4be, 0xcb3e42b6), X64Word_create(0x597f299c, 0xfc657e2a),
- X64Word_create(0x5fcb6fab, 0x3ad6faec), X64Word_create(0x6c44198c, 0x4a475817)
- ];
-
- // Reusable objects
- var W = [];
- (function () {
- for (var i = 0; i < 80; i++) {
- W[i] = X64Word_create();
- }
- }());
-
- /**
- * SHA-512 hash algorithm.
- */
- var SHA512 = C_algo.SHA512 = Hasher.extend({
- _doReset: function () {
- this._hash = new X64WordArray.init([
- new X64Word.init(0x6a09e667, 0xf3bcc908), new X64Word.init(0xbb67ae85, 0x84caa73b),
- new X64Word.init(0x3c6ef372, 0xfe94f82b), new X64Word.init(0xa54ff53a, 0x5f1d36f1),
- new X64Word.init(0x510e527f, 0xade682d1), new X64Word.init(0x9b05688c, 0x2b3e6c1f),
- new X64Word.init(0x1f83d9ab, 0xfb41bd6b), new X64Word.init(0x5be0cd19, 0x137e2179)
- ]);
- },
-
- _doProcessBlock: function (M, offset) {
- // Shortcuts
- var H = this._hash.words;
-
- var H0 = H[0];
- var H1 = H[1];
- var H2 = H[2];
- var H3 = H[3];
- var H4 = H[4];
- var H5 = H[5];
- var H6 = H[6];
- var H7 = H[7];
-
- var H0h = H0.high;
- var H0l = H0.low;
- var H1h = H1.high;
- var H1l = H1.low;
- var H2h = H2.high;
- var H2l = H2.low;
- var H3h = H3.high;
- var H3l = H3.low;
- var H4h = H4.high;
- var H4l = H4.low;
- var H5h = H5.high;
- var H5l = H5.low;
- var H6h = H6.high;
- var H6l = H6.low;
- var H7h = H7.high;
- var H7l = H7.low;
-
- // Working variables
- var ah = H0h;
- var al = H0l;
- var bh = H1h;
- var bl = H1l;
- var ch = H2h;
- var cl = H2l;
- var dh = H3h;
- var dl = H3l;
- var eh = H4h;
- var el = H4l;
- var fh = H5h;
- var fl = H5l;
- var gh = H6h;
- var gl = H6l;
- var hh = H7h;
- var hl = H7l;
-
- // Rounds
- for (var i = 0; i < 80; i++) {
- // Shortcut
- var Wi = W[i];
-
- // Extend message
- if (i < 16) {
- var Wih = Wi.high = M[offset + i * 2] | 0;
- var Wil = Wi.low = M[offset + i * 2 + 1] | 0;
- } else {
- // Gamma0
- var gamma0x = W[i - 15];
- var gamma0xh = gamma0x.high;
- var gamma0xl = gamma0x.low;
- var gamma0h = ((gamma0xh >>> 1) | (gamma0xl << 31)) ^ ((gamma0xh >>> 8) | (gamma0xl << 24)) ^ (gamma0xh >>> 7);
- var gamma0l = ((gamma0xl >>> 1) | (gamma0xh << 31)) ^ ((gamma0xl >>> 8) | (gamma0xh << 24)) ^ ((gamma0xl >>> 7) | (gamma0xh << 25));
-
- // Gamma1
- var gamma1x = W[i - 2];
- var gamma1xh = gamma1x.high;
- var gamma1xl = gamma1x.low;
- var gamma1h = ((gamma1xh >>> 19) | (gamma1xl << 13)) ^ ((gamma1xh << 3) | (gamma1xl >>> 29)) ^ (gamma1xh >>> 6);
- var gamma1l = ((gamma1xl >>> 19) | (gamma1xh << 13)) ^ ((gamma1xl << 3) | (gamma1xh >>> 29)) ^ ((gamma1xl >>> 6) | (gamma1xh << 26));
-
- // W[i] = gamma0 + W[i - 7] + gamma1 + W[i - 16]
- var Wi7 = W[i - 7];
- var Wi7h = Wi7.high;
- var Wi7l = Wi7.low;
-
- var Wi16 = W[i - 16];
- var Wi16h = Wi16.high;
- var Wi16l = Wi16.low;
-
- var Wil = gamma0l + Wi7l;
- var Wih = gamma0h + Wi7h + ((Wil >>> 0) < (gamma0l >>> 0) ? 1 : 0);
- var Wil = Wil + gamma1l;
- var Wih = Wih + gamma1h + ((Wil >>> 0) < (gamma1l >>> 0) ? 1 : 0);
- var Wil = Wil + Wi16l;
- var Wih = Wih + Wi16h + ((Wil >>> 0) < (Wi16l >>> 0) ? 1 : 0);
-
- Wi.high = Wih;
- Wi.low = Wil;
- }
-
- var chh = (eh & fh) ^ (~eh & gh);
- var chl = (el & fl) ^ (~el & gl);
- var majh = (ah & bh) ^ (ah & ch) ^ (bh & ch);
- var majl = (al & bl) ^ (al & cl) ^ (bl & cl);
-
- var sigma0h = ((ah >>> 28) | (al << 4)) ^ ((ah << 30) | (al >>> 2)) ^ ((ah << 25) | (al >>> 7));
- var sigma0l = ((al >>> 28) | (ah << 4)) ^ ((al << 30) | (ah >>> 2)) ^ ((al << 25) | (ah >>> 7));
- var sigma1h = ((eh >>> 14) | (el << 18)) ^ ((eh >>> 18) | (el << 14)) ^ ((eh << 23) | (el >>> 9));
- var sigma1l = ((el >>> 14) | (eh << 18)) ^ ((el >>> 18) | (eh << 14)) ^ ((el << 23) | (eh >>> 9));
-
- // t1 = h + sigma1 + ch + K[i] + W[i]
- var Ki = K[i];
- var Kih = Ki.high;
- var Kil = Ki.low;
-
- var t1l = hl + sigma1l;
- var t1h = hh + sigma1h + ((t1l >>> 0) < (hl >>> 0) ? 1 : 0);
- var t1l = t1l + chl;
- var t1h = t1h + chh + ((t1l >>> 0) < (chl >>> 0) ? 1 : 0);
- var t1l = t1l + Kil;
- var t1h = t1h + Kih + ((t1l >>> 0) < (Kil >>> 0) ? 1 : 0);
- var t1l = t1l + Wil;
- var t1h = t1h + Wih + ((t1l >>> 0) < (Wil >>> 0) ? 1 : 0);
-
- // t2 = sigma0 + maj
- var t2l = sigma0l + majl;
- var t2h = sigma0h + majh + ((t2l >>> 0) < (sigma0l >>> 0) ? 1 : 0);
-
- // Update working variables
- hh = gh;
- hl = gl;
- gh = fh;
- gl = fl;
- fh = eh;
- fl = el;
- el = (dl + t1l) | 0;
- eh = (dh + t1h + ((el >>> 0) < (dl >>> 0) ? 1 : 0)) | 0;
- dh = ch;
- dl = cl;
- ch = bh;
- cl = bl;
- bh = ah;
- bl = al;
- al = (t1l + t2l) | 0;
- ah = (t1h + t2h + ((al >>> 0) < (t1l >>> 0) ? 1 : 0)) | 0;
- }
-
- // Intermediate hash value
- H0l = H0.low = (H0l + al);
- H0.high = (H0h + ah + ((H0l >>> 0) < (al >>> 0) ? 1 : 0));
- H1l = H1.low = (H1l + bl);
- H1.high = (H1h + bh + ((H1l >>> 0) < (bl >>> 0) ? 1 : 0));
- H2l = H2.low = (H2l + cl);
- H2.high = (H2h + ch + ((H2l >>> 0) < (cl >>> 0) ? 1 : 0));
- H3l = H3.low = (H3l + dl);
- H3.high = (H3h + dh + ((H3l >>> 0) < (dl >>> 0) ? 1 : 0));
- H4l = H4.low = (H4l + el);
- H4.high = (H4h + eh + ((H4l >>> 0) < (el >>> 0) ? 1 : 0));
- H5l = H5.low = (H5l + fl);
- H5.high = (H5h + fh + ((H5l >>> 0) < (fl >>> 0) ? 1 : 0));
- H6l = H6.low = (H6l + gl);
- H6.high = (H6h + gh + ((H6l >>> 0) < (gl >>> 0) ? 1 : 0));
- H7l = H7.low = (H7l + hl);
- H7.high = (H7h + hh + ((H7l >>> 0) < (hl >>> 0) ? 1 : 0));
- },
-
- _doFinalize: function () {
- // Shortcuts
- var data = this._data;
- var dataWords = data.words;
-
- var nBitsTotal = this._nDataBytes * 8;
- var nBitsLeft = data.sigBytes * 8;
-
- // Add padding
- dataWords[nBitsLeft >>> 5] |= 0x80 << (24 - nBitsLeft % 32);
- dataWords[(((nBitsLeft + 128) >>> 10) << 5) + 30] = Math.floor(nBitsTotal / 0x100000000);
- dataWords[(((nBitsLeft + 128) >>> 10) << 5) + 31] = nBitsTotal;
- data.sigBytes = dataWords.length * 4;
-
- // Hash final blocks
- this._process();
-
- // Convert hash to 32-bit word array before returning
- var hash = this._hash.toX32();
-
- // Return final computed hash
- return hash;
- },
-
- clone: function () {
- var clone = Hasher.clone.call(this);
- clone._hash = this._hash.clone();
-
- return clone;
- },
-
- blockSize: 1024/32
- });
-
- /**
- * Shortcut function to the hasher's object interface.
- *
- * @param {WordArray|string} message The message to hash.
- *
- * @return {WordArray} The hash.
- *
- * @static
- *
- * @example
- *
- * var hash = CryptoJS.SHA512('message');
- * var hash = CryptoJS.SHA512(wordArray);
- */
- C.SHA512 = Hasher._createHelper(SHA512);
-
- /**
- * Shortcut function to the HMAC's object interface.
- *
- * @param {WordArray|string} message The message to hash.
- * @param {WordArray|string} key The secret key.
- *
- * @return {WordArray} The HMAC.
- *
- * @static
- *
- * @example
- *
- * var hmac = CryptoJS.HmacSHA512(message, key);
- */
- C.HmacSHA512 = Hasher._createHmacHelper(SHA512);
- }());
-
-
- return CryptoJS.SHA512;
-
-}));
-},{"./core":31,"./x64-core":62}],61:[function(_dereq_,module,exports){
-;(function (root, factory, undef) {
- if (typeof exports === "object") {
- // CommonJS
- module.exports = exports = factory(_dereq_("./core"), _dereq_("./enc-base64"), _dereq_("./md5"), _dereq_("./evpkdf"), _dereq_("./cipher-core"));
- }
- else if (typeof define === "function" && define.amd) {
- // AMD
- define(["./core", "./enc-base64", "./md5", "./evpkdf", "./cipher-core"], factory);
- }
- else {
- // Global (browser)
- factory(root.CryptoJS);
- }
-}(this, function (CryptoJS) {
-
- (function () {
- // Shortcuts
- var C = CryptoJS;
- var C_lib = C.lib;
- var WordArray = C_lib.WordArray;
- var BlockCipher = C_lib.BlockCipher;
- var C_algo = C.algo;
-
- // Permuted Choice 1 constants
- var PC1 = [
- 57, 49, 41, 33, 25, 17, 9, 1,
- 58, 50, 42, 34, 26, 18, 10, 2,
- 59, 51, 43, 35, 27, 19, 11, 3,
- 60, 52, 44, 36, 63, 55, 47, 39,
- 31, 23, 15, 7, 62, 54, 46, 38,
- 30, 22, 14, 6, 61, 53, 45, 37,
- 29, 21, 13, 5, 28, 20, 12, 4
- ];
-
- // Permuted Choice 2 constants
- var PC2 = [
- 14, 17, 11, 24, 1, 5,
- 3, 28, 15, 6, 21, 10,
- 23, 19, 12, 4, 26, 8,
- 16, 7, 27, 20, 13, 2,
- 41, 52, 31, 37, 47, 55,
- 30, 40, 51, 45, 33, 48,
- 44, 49, 39, 56, 34, 53,
- 46, 42, 50, 36, 29, 32
- ];
-
- // Cumulative bit shift constants
- var BIT_SHIFTS = [1, 2, 4, 6, 8, 10, 12, 14, 15, 17, 19, 21, 23, 25, 27, 28];
-
- // SBOXes and round permutation constants
- var SBOX_P = [
- {
- 0x0: 0x808200,
- 0x10000000: 0x8000,
- 0x20000000: 0x808002,
- 0x30000000: 0x2,
- 0x40000000: 0x200,
- 0x50000000: 0x808202,
- 0x60000000: 0x800202,
- 0x70000000: 0x800000,
- 0x80000000: 0x202,
- 0x90000000: 0x800200,
- 0xa0000000: 0x8200,
- 0xb0000000: 0x808000,
- 0xc0000000: 0x8002,
- 0xd0000000: 0x800002,
- 0xe0000000: 0x0,
- 0xf0000000: 0x8202,
- 0x8000000: 0x0,
- 0x18000000: 0x808202,
- 0x28000000: 0x8202,
- 0x38000000: 0x8000,
- 0x48000000: 0x808200,
- 0x58000000: 0x200,
- 0x68000000: 0x808002,
- 0x78000000: 0x2,
- 0x88000000: 0x800200,
- 0x98000000: 0x8200,
- 0xa8000000: 0x808000,
- 0xb8000000: 0x800202,
- 0xc8000000: 0x800002,
- 0xd8000000: 0x8002,
- 0xe8000000: 0x202,
- 0xf8000000: 0x800000,
- 0x1: 0x8000,
- 0x10000001: 0x2,
- 0x20000001: 0x808200,
- 0x30000001: 0x800000,
- 0x40000001: 0x808002,
- 0x50000001: 0x8200,
- 0x60000001: 0x200,
- 0x70000001: 0x800202,
- 0x80000001: 0x808202,
- 0x90000001: 0x808000,
- 0xa0000001: 0x800002,
- 0xb0000001: 0x8202,
- 0xc0000001: 0x202,
- 0xd0000001: 0x800200,
- 0xe0000001: 0x8002,
- 0xf0000001: 0x0,
- 0x8000001: 0x808202,
- 0x18000001: 0x808000,
- 0x28000001: 0x800000,
- 0x38000001: 0x200,
- 0x48000001: 0x8000,
- 0x58000001: 0x800002,
- 0x68000001: 0x2,
- 0x78000001: 0x8202,
- 0x88000001: 0x8002,
- 0x98000001: 0x800202,
- 0xa8000001: 0x202,
- 0xb8000001: 0x808200,
- 0xc8000001: 0x800200,
- 0xd8000001: 0x0,
- 0xe8000001: 0x8200,
- 0xf8000001: 0x808002
- },
- {
- 0x0: 0x40084010,
- 0x1000000: 0x4000,
- 0x2000000: 0x80000,
- 0x3000000: 0x40080010,
- 0x4000000: 0x40000010,
- 0x5000000: 0x40084000,
- 0x6000000: 0x40004000,
- 0x7000000: 0x10,
- 0x8000000: 0x84000,
- 0x9000000: 0x40004010,
- 0xa000000: 0x40000000,
- 0xb000000: 0x84010,
- 0xc000000: 0x80010,
- 0xd000000: 0x0,
- 0xe000000: 0x4010,
- 0xf000000: 0x40080000,
- 0x800000: 0x40004000,
- 0x1800000: 0x84010,
- 0x2800000: 0x10,
- 0x3800000: 0x40004010,
- 0x4800000: 0x40084010,
- 0x5800000: 0x40000000,
- 0x6800000: 0x80000,
- 0x7800000: 0x40080010,
- 0x8800000: 0x80010,
- 0x9800000: 0x0,
- 0xa800000: 0x4000,
- 0xb800000: 0x40080000,
- 0xc800000: 0x40000010,
- 0xd800000: 0x84000,
- 0xe800000: 0x40084000,
- 0xf800000: 0x4010,
- 0x10000000: 0x0,
- 0x11000000: 0x40080010,
- 0x12000000: 0x40004010,
- 0x13000000: 0x40084000,
- 0x14000000: 0x40080000,
- 0x15000000: 0x10,
- 0x16000000: 0x84010,
- 0x17000000: 0x4000,
- 0x18000000: 0x4010,
- 0x19000000: 0x80000,
- 0x1a000000: 0x80010,
- 0x1b000000: 0x40000010,
- 0x1c000000: 0x84000,
- 0x1d000000: 0x40004000,
- 0x1e000000: 0x40000000,
- 0x1f000000: 0x40084010,
- 0x10800000: 0x84010,
- 0x11800000: 0x80000,
- 0x12800000: 0x40080000,
- 0x13800000: 0x4000,
- 0x14800000: 0x40004000,
- 0x15800000: 0x40084010,
- 0x16800000: 0x10,
- 0x17800000: 0x40000000,
- 0x18800000: 0x40084000,
- 0x19800000: 0x40000010,
- 0x1a800000: 0x40004010,
- 0x1b800000: 0x80010,
- 0x1c800000: 0x0,
- 0x1d800000: 0x4010,
- 0x1e800000: 0x40080010,
- 0x1f800000: 0x84000
- },
- {
- 0x0: 0x104,
- 0x100000: 0x0,
- 0x200000: 0x4000100,
- 0x300000: 0x10104,
- 0x400000: 0x10004,
- 0x500000: 0x4000004,
- 0x600000: 0x4010104,
- 0x700000: 0x4010000,
- 0x800000: 0x4000000,
- 0x900000: 0x4010100,
- 0xa00000: 0x10100,
- 0xb00000: 0x4010004,
- 0xc00000: 0x4000104,
- 0xd00000: 0x10000,
- 0xe00000: 0x4,
- 0xf00000: 0x100,
- 0x80000: 0x4010100,
- 0x180000: 0x4010004,
- 0x280000: 0x0,
- 0x380000: 0x4000100,
- 0x480000: 0x4000004,
- 0x580000: 0x10000,
- 0x680000: 0x10004,
- 0x780000: 0x104,
- 0x880000: 0x4,
- 0x980000: 0x100,
- 0xa80000: 0x4010000,
- 0xb80000: 0x10104,
- 0xc80000: 0x10100,
- 0xd80000: 0x4000104,
- 0xe80000: 0x4010104,
- 0xf80000: 0x4000000,
- 0x1000000: 0x4010100,
- 0x1100000: 0x10004,
- 0x1200000: 0x10000,
- 0x1300000: 0x4000100,
- 0x1400000: 0x100,
- 0x1500000: 0x4010104,
- 0x1600000: 0x4000004,
- 0x1700000: 0x0,
- 0x1800000: 0x4000104,
- 0x1900000: 0x4000000,
- 0x1a00000: 0x4,
- 0x1b00000: 0x10100,
- 0x1c00000: 0x4010000,
- 0x1d00000: 0x104,
- 0x1e00000: 0x10104,
- 0x1f00000: 0x4010004,
- 0x1080000: 0x4000000,
- 0x1180000: 0x104,
- 0x1280000: 0x4010100,
- 0x1380000: 0x0,
- 0x1480000: 0x10004,
- 0x1580000: 0x4000100,
- 0x1680000: 0x100,
- 0x1780000: 0x4010004,
- 0x1880000: 0x10000,
- 0x1980000: 0x4010104,
- 0x1a80000: 0x10104,
- 0x1b80000: 0x4000004,
- 0x1c80000: 0x4000104,
- 0x1d80000: 0x4010000,
- 0x1e80000: 0x4,
- 0x1f80000: 0x10100
- },
- {
- 0x0: 0x80401000,
- 0x10000: 0x80001040,
- 0x20000: 0x401040,
- 0x30000: 0x80400000,
- 0x40000: 0x0,
- 0x50000: 0x401000,
- 0x60000: 0x80000040,
- 0x70000: 0x400040,
- 0x80000: 0x80000000,
- 0x90000: 0x400000,
- 0xa0000: 0x40,
- 0xb0000: 0x80001000,
- 0xc0000: 0x80400040,
- 0xd0000: 0x1040,
- 0xe0000: 0x1000,
- 0xf0000: 0x80401040,
- 0x8000: 0x80001040,
- 0x18000: 0x40,
- 0x28000: 0x80400040,
- 0x38000: 0x80001000,
- 0x48000: 0x401000,
- 0x58000: 0x80401040,
- 0x68000: 0x0,
- 0x78000: 0x80400000,
- 0x88000: 0x1000,
- 0x98000: 0x80401000,
- 0xa8000: 0x400000,
- 0xb8000: 0x1040,
- 0xc8000: 0x80000000,
- 0xd8000: 0x400040,
- 0xe8000: 0x401040,
- 0xf8000: 0x80000040,
- 0x100000: 0x400040,
- 0x110000: 0x401000,
- 0x120000: 0x80000040,
- 0x130000: 0x0,
- 0x140000: 0x1040,
- 0x150000: 0x80400040,
- 0x160000: 0x80401000,
- 0x170000: 0x80001040,
- 0x180000: 0x80401040,
- 0x190000: 0x80000000,
- 0x1a0000: 0x80400000,
- 0x1b0000: 0x401040,
- 0x1c0000: 0x80001000,
- 0x1d0000: 0x400000,
- 0x1e0000: 0x40,
- 0x1f0000: 0x1000,
- 0x108000: 0x80400000,
- 0x118000: 0x80401040,
- 0x128000: 0x0,
- 0x138000: 0x401000,
- 0x148000: 0x400040,
- 0x158000: 0x80000000,
- 0x168000: 0x80001040,
- 0x178000: 0x40,
- 0x188000: 0x80000040,
- 0x198000: 0x1000,
- 0x1a8000: 0x80001000,
- 0x1b8000: 0x80400040,
- 0x1c8000: 0x1040,
- 0x1d8000: 0x80401000,
- 0x1e8000: 0x400000,
- 0x1f8000: 0x401040
- },
- {
- 0x0: 0x80,
- 0x1000: 0x1040000,
- 0x2000: 0x40000,
- 0x3000: 0x20000000,
- 0x4000: 0x20040080,
- 0x5000: 0x1000080,
- 0x6000: 0x21000080,
- 0x7000: 0x40080,
- 0x8000: 0x1000000,
- 0x9000: 0x20040000,
- 0xa000: 0x20000080,
- 0xb000: 0x21040080,
- 0xc000: 0x21040000,
- 0xd000: 0x0,
- 0xe000: 0x1040080,
- 0xf000: 0x21000000,
- 0x800: 0x1040080,
- 0x1800: 0x21000080,
- 0x2800: 0x80,
- 0x3800: 0x1040000,
- 0x4800: 0x40000,
- 0x5800: 0x20040080,
- 0x6800: 0x21040000,
- 0x7800: 0x20000000,
- 0x8800: 0x20040000,
- 0x9800: 0x0,
- 0xa800: 0x21040080,
- 0xb800: 0x1000080,
- 0xc800: 0x20000080,
- 0xd800: 0x21000000,
- 0xe800: 0x1000000,
- 0xf800: 0x40080,
- 0x10000: 0x40000,
- 0x11000: 0x80,
- 0x12000: 0x20000000,
- 0x13000: 0x21000080,
- 0x14000: 0x1000080,
- 0x15000: 0x21040000,
- 0x16000: 0x20040080,
- 0x17000: 0x1000000,
- 0x18000: 0x21040080,
- 0x19000: 0x21000000,
- 0x1a000: 0x1040000,
- 0x1b000: 0x20040000,
- 0x1c000: 0x40080,
- 0x1d000: 0x20000080,
- 0x1e000: 0x0,
- 0x1f000: 0x1040080,
- 0x10800: 0x21000080,
- 0x11800: 0x1000000,
- 0x12800: 0x1040000,
- 0x13800: 0x20040080,
- 0x14800: 0x20000000,
- 0x15800: 0x1040080,
- 0x16800: 0x80,
- 0x17800: 0x21040000,
- 0x18800: 0x40080,
- 0x19800: 0x21040080,
- 0x1a800: 0x0,
- 0x1b800: 0x21000000,
- 0x1c800: 0x1000080,
- 0x1d800: 0x40000,
- 0x1e800: 0x20040000,
- 0x1f800: 0x20000080
- },
- {
- 0x0: 0x10000008,
- 0x100: 0x2000,
- 0x200: 0x10200000,
- 0x300: 0x10202008,
- 0x400: 0x10002000,
- 0x500: 0x200000,
- 0x600: 0x200008,
- 0x700: 0x10000000,
- 0x800: 0x0,
- 0x900: 0x10002008,
- 0xa00: 0x202000,
- 0xb00: 0x8,
- 0xc00: 0x10200008,
- 0xd00: 0x202008,
- 0xe00: 0x2008,
- 0xf00: 0x10202000,
- 0x80: 0x10200000,
- 0x180: 0x10202008,
- 0x280: 0x8,
- 0x380: 0x200000,
- 0x480: 0x202008,
- 0x580: 0x10000008,
- 0x680: 0x10002000,
- 0x780: 0x2008,
- 0x880: 0x200008,
- 0x980: 0x2000,
- 0xa80: 0x10002008,
- 0xb80: 0x10200008,
- 0xc80: 0x0,
- 0xd80: 0x10202000,
- 0xe80: 0x202000,
- 0xf80: 0x10000000,
- 0x1000: 0x10002000,
- 0x1100: 0x10200008,
- 0x1200: 0x10202008,
- 0x1300: 0x2008,
- 0x1400: 0x200000,
- 0x1500: 0x10000000,
- 0x1600: 0x10000008,
- 0x1700: 0x202000,
- 0x1800: 0x202008,
- 0x1900: 0x0,
- 0x1a00: 0x8,
- 0x1b00: 0x10200000,
- 0x1c00: 0x2000,
- 0x1d00: 0x10002008,
- 0x1e00: 0x10202000,
- 0x1f00: 0x200008,
- 0x1080: 0x8,
- 0x1180: 0x202000,
- 0x1280: 0x200000,
- 0x1380: 0x10000008,
- 0x1480: 0x10002000,
- 0x1580: 0x2008,
- 0x1680: 0x10202008,
- 0x1780: 0x10200000,
- 0x1880: 0x10202000,
- 0x1980: 0x10200008,
- 0x1a80: 0x2000,
- 0x1b80: 0x202008,
- 0x1c80: 0x200008,
- 0x1d80: 0x0,
- 0x1e80: 0x10000000,
- 0x1f80: 0x10002008
- },
- {
- 0x0: 0x100000,
- 0x10: 0x2000401,
- 0x20: 0x400,
- 0x30: 0x100401,
- 0x40: 0x2100401,
- 0x50: 0x0,
- 0x60: 0x1,
- 0x70: 0x2100001,
- 0x80: 0x2000400,
- 0x90: 0x100001,
- 0xa0: 0x2000001,
- 0xb0: 0x2100400,
- 0xc0: 0x2100000,
- 0xd0: 0x401,
- 0xe0: 0x100400,
- 0xf0: 0x2000000,
- 0x8: 0x2100001,
- 0x18: 0x0,
- 0x28: 0x2000401,
- 0x38: 0x2100400,
- 0x48: 0x100000,
- 0x58: 0x2000001,
- 0x68: 0x2000000,
- 0x78: 0x401,
- 0x88: 0x100401,
- 0x98: 0x2000400,
- 0xa8: 0x2100000,
- 0xb8: 0x100001,
- 0xc8: 0x400,
- 0xd8: 0x2100401,
- 0xe8: 0x1,
- 0xf8: 0x100400,
- 0x100: 0x2000000,
- 0x110: 0x100000,
- 0x120: 0x2000401,
- 0x130: 0x2100001,
- 0x140: 0x100001,
- 0x150: 0x2000400,
- 0x160: 0x2100400,
- 0x170: 0x100401,
- 0x180: 0x401,
- 0x190: 0x2100401,
- 0x1a0: 0x100400,
- 0x1b0: 0x1,
- 0x1c0: 0x0,
- 0x1d0: 0x2100000,
- 0x1e0: 0x2000001,
- 0x1f0: 0x400,
- 0x108: 0x100400,
- 0x118: 0x2000401,
- 0x128: 0x2100001,
- 0x138: 0x1,
- 0x148: 0x2000000,
- 0x158: 0x100000,
- 0x168: 0x401,
- 0x178: 0x2100400,
- 0x188: 0x2000001,
- 0x198: 0x2100000,
- 0x1a8: 0x0,
- 0x1b8: 0x2100401,
- 0x1c8: 0x100401,
- 0x1d8: 0x400,
- 0x1e8: 0x2000400,
- 0x1f8: 0x100001
- },
- {
- 0x0: 0x8000820,
- 0x1: 0x20000,
- 0x2: 0x8000000,
- 0x3: 0x20,
- 0x4: 0x20020,
- 0x5: 0x8020820,
- 0x6: 0x8020800,
- 0x7: 0x800,
- 0x8: 0x8020000,
- 0x9: 0x8000800,
- 0xa: 0x20800,
- 0xb: 0x8020020,
- 0xc: 0x820,
- 0xd: 0x0,
- 0xe: 0x8000020,
- 0xf: 0x20820,
- 0x80000000: 0x800,
- 0x80000001: 0x8020820,
- 0x80000002: 0x8000820,
- 0x80000003: 0x8000000,
- 0x80000004: 0x8020000,
- 0x80000005: 0x20800,
- 0x80000006: 0x20820,
- 0x80000007: 0x20,
- 0x80000008: 0x8000020,
- 0x80000009: 0x820,
- 0x8000000a: 0x20020,
- 0x8000000b: 0x8020800,
- 0x8000000c: 0x0,
- 0x8000000d: 0x8020020,
- 0x8000000e: 0x8000800,
- 0x8000000f: 0x20000,
- 0x10: 0x20820,
- 0x11: 0x8020800,
- 0x12: 0x20,
- 0x13: 0x800,
- 0x14: 0x8000800,
- 0x15: 0x8000020,
- 0x16: 0x8020020,
- 0x17: 0x20000,
- 0x18: 0x0,
- 0x19: 0x20020,
- 0x1a: 0x8020000,
- 0x1b: 0x8000820,
- 0x1c: 0x8020820,
- 0x1d: 0x20800,
- 0x1e: 0x820,
- 0x1f: 0x8000000,
- 0x80000010: 0x20000,
- 0x80000011: 0x800,
- 0x80000012: 0x8020020,
- 0x80000013: 0x20820,
- 0x80000014: 0x20,
- 0x80000015: 0x8020000,
- 0x80000016: 0x8000000,
- 0x80000017: 0x8000820,
- 0x80000018: 0x8020820,
- 0x80000019: 0x8000020,
- 0x8000001a: 0x8000800,
- 0x8000001b: 0x0,
- 0x8000001c: 0x20800,
- 0x8000001d: 0x820,
- 0x8000001e: 0x20020,
- 0x8000001f: 0x8020800
- }
- ];
-
- // Masks that select the SBOX input
- var SBOX_MASK = [
- 0xf8000001, 0x1f800000, 0x01f80000, 0x001f8000,
- 0x0001f800, 0x00001f80, 0x000001f8, 0x8000001f
- ];
-
- /**
- * DES block cipher algorithm.
- */
- var DES = C_algo.DES = BlockCipher.extend({
- _doReset: function () {
- // Shortcuts
- var key = this._key;
- var keyWords = key.words;
-
- // Select 56 bits according to PC1
- var keyBits = [];
- for (var i = 0; i < 56; i++) {
- var keyBitPos = PC1[i] - 1;
- keyBits[i] = (keyWords[keyBitPos >>> 5] >>> (31 - keyBitPos % 32)) & 1;
- }
-
- // Assemble 16 subkeys
- var subKeys = this._subKeys = [];
- for (var nSubKey = 0; nSubKey < 16; nSubKey++) {
- // Create subkey
- var subKey = subKeys[nSubKey] = [];
-
- // Shortcut
- var bitShift = BIT_SHIFTS[nSubKey];
-
- // Select 48 bits according to PC2
- for (var i = 0; i < 24; i++) {
- // Select from the left 28 key bits
- subKey[(i / 6) | 0] |= keyBits[((PC2[i] - 1) + bitShift) % 28] << (31 - i % 6);
-
- // Select from the right 28 key bits
- subKey[4 + ((i / 6) | 0)] |= keyBits[28 + (((PC2[i + 24] - 1) + bitShift) % 28)] << (31 - i % 6);
- }
-
- // Since each subkey is applied to an expanded 32-bit input,
- // the subkey can be broken into 8 values scaled to 32-bits,
- // which allows the key to be used without expansion
- subKey[0] = (subKey[0] << 1) | (subKey[0] >>> 31);
- for (var i = 1; i < 7; i++) {
- subKey[i] = subKey[i] >>> ((i - 1) * 4 + 3);
- }
- subKey[7] = (subKey[7] << 5) | (subKey[7] >>> 27);
- }
-
- // Compute inverse subkeys
- var invSubKeys = this._invSubKeys = [];
- for (var i = 0; i < 16; i++) {
- invSubKeys[i] = subKeys[15 - i];
- }
- },
-
- encryptBlock: function (M, offset) {
- this._doCryptBlock(M, offset, this._subKeys);
- },
-
- decryptBlock: function (M, offset) {
- this._doCryptBlock(M, offset, this._invSubKeys);
- },
-
- _doCryptBlock: function (M, offset, subKeys) {
- // Get input
- this._lBlock = M[offset];
- this._rBlock = M[offset + 1];
-
- // Initial permutation
- exchangeLR.call(this, 4, 0x0f0f0f0f);
- exchangeLR.call(this, 16, 0x0000ffff);
- exchangeRL.call(this, 2, 0x33333333);
- exchangeRL.call(this, 8, 0x00ff00ff);
- exchangeLR.call(this, 1, 0x55555555);
-
- // Rounds
- for (var round = 0; round < 16; round++) {
- // Shortcuts
- var subKey = subKeys[round];
- var lBlock = this._lBlock;
- var rBlock = this._rBlock;
-
- // Feistel function
- var f = 0;
- for (var i = 0; i < 8; i++) {
- f |= SBOX_P[i][((rBlock ^ subKey[i]) & SBOX_MASK[i]) >>> 0];
- }
- this._lBlock = rBlock;
- this._rBlock = lBlock ^ f;
- }
-
- // Undo swap from last round
- var t = this._lBlock;
- this._lBlock = this._rBlock;
- this._rBlock = t;
-
- // Final permutation
- exchangeLR.call(this, 1, 0x55555555);
- exchangeRL.call(this, 8, 0x00ff00ff);
- exchangeRL.call(this, 2, 0x33333333);
- exchangeLR.call(this, 16, 0x0000ffff);
- exchangeLR.call(this, 4, 0x0f0f0f0f);
-
- // Set output
- M[offset] = this._lBlock;
- M[offset + 1] = this._rBlock;
- },
-
- keySize: 64/32,
-
- ivSize: 64/32,
-
- blockSize: 64/32
- });
-
- // Swap bits across the left and right words
- function exchangeLR(offset, mask) {
- var t = ((this._lBlock >>> offset) ^ this._rBlock) & mask;
- this._rBlock ^= t;
- this._lBlock ^= t << offset;
- }
-
- function exchangeRL(offset, mask) {
- var t = ((this._rBlock >>> offset) ^ this._lBlock) & mask;
- this._lBlock ^= t;
- this._rBlock ^= t << offset;
- }
-
- /**
- * Shortcut functions to the cipher's object interface.
- *
- * @example
- *
- * var ciphertext = CryptoJS.DES.encrypt(message, key, cfg);
- * var plaintext = CryptoJS.DES.decrypt(ciphertext, key, cfg);
- */
- C.DES = BlockCipher._createHelper(DES);
-
- /**
- * Triple-DES block cipher algorithm.
- */
- var TripleDES = C_algo.TripleDES = BlockCipher.extend({
- _doReset: function () {
- // Shortcuts
- var key = this._key;
- var keyWords = key.words;
-
- // Create DES instances
- this._des1 = DES.createEncryptor(WordArray.create(keyWords.slice(0, 2)));
- this._des2 = DES.createEncryptor(WordArray.create(keyWords.slice(2, 4)));
- this._des3 = DES.createEncryptor(WordArray.create(keyWords.slice(4, 6)));
- },
-
- encryptBlock: function (M, offset) {
- this._des1.encryptBlock(M, offset);
- this._des2.decryptBlock(M, offset);
- this._des3.encryptBlock(M, offset);
- },
-
- decryptBlock: function (M, offset) {
- this._des3.decryptBlock(M, offset);
- this._des2.encryptBlock(M, offset);
- this._des1.decryptBlock(M, offset);
- },
-
- keySize: 192/32,
-
- ivSize: 64/32,
-
- blockSize: 64/32
- });
-
- /**
- * Shortcut functions to the cipher's object interface.
- *
- * @example
- *
- * var ciphertext = CryptoJS.TripleDES.encrypt(message, key, cfg);
- * var plaintext = CryptoJS.TripleDES.decrypt(ciphertext, key, cfg);
- */
- C.TripleDES = BlockCipher._createHelper(TripleDES);
- }());
-
-
- return CryptoJS.TripleDES;
-
-}));
-},{"./cipher-core":30,"./core":31,"./enc-base64":32,"./evpkdf":34,"./md5":39}],62:[function(_dereq_,module,exports){
-;(function (root, factory) {
- if (typeof exports === "object") {
- // CommonJS
- module.exports = exports = factory(_dereq_("./core"));
- }
- else if (typeof define === "function" && define.amd) {
- // AMD
- define(["./core"], factory);
- }
- else {
- // Global (browser)
- factory(root.CryptoJS);
- }
-}(this, function (CryptoJS) {
-
- (function (undefined) {
- // Shortcuts
- var C = CryptoJS;
- var C_lib = C.lib;
- var Base = C_lib.Base;
- var X32WordArray = C_lib.WordArray;
-
- /**
- * x64 namespace.
- */
- var C_x64 = C.x64 = {};
-
- /**
- * A 64-bit word.
- */
- var X64Word = C_x64.Word = Base.extend({
- /**
- * Initializes a newly created 64-bit word.
- *
- * @param {number} high The high 32 bits.
- * @param {number} low The low 32 bits.
- *
- * @example
- *
- * var x64Word = CryptoJS.x64.Word.create(0x00010203, 0x04050607);
- */
- init: function (high, low) {
- this.high = high;
- this.low = low;
- }
-
- /**
- * Bitwise NOTs this word.
- *
- * @return {X64Word} A new x64-Word object after negating.
- *
- * @example
- *
- * var negated = x64Word.not();
- */
- // not: function () {
- // var high = ~this.high;
- // var low = ~this.low;
-
- // return X64Word.create(high, low);
- // },
-
- /**
- * Bitwise ANDs this word with the passed word.
- *
- * @param {X64Word} word The x64-Word to AND with this word.
- *
- * @return {X64Word} A new x64-Word object after ANDing.
- *
- * @example
- *
- * var anded = x64Word.and(anotherX64Word);
- */
- // and: function (word) {
- // var high = this.high & word.high;
- // var low = this.low & word.low;
-
- // return X64Word.create(high, low);
- // },
-
- /**
- * Bitwise ORs this word with the passed word.
- *
- * @param {X64Word} word The x64-Word to OR with this word.
- *
- * @return {X64Word} A new x64-Word object after ORing.
- *
- * @example
- *
- * var ored = x64Word.or(anotherX64Word);
- */
- // or: function (word) {
- // var high = this.high | word.high;
- // var low = this.low | word.low;
-
- // return X64Word.create(high, low);
- // },
-
- /**
- * Bitwise XORs this word with the passed word.
- *
- * @param {X64Word} word The x64-Word to XOR with this word.
- *
- * @return {X64Word} A new x64-Word object after XORing.
- *
- * @example
- *
- * var xored = x64Word.xor(anotherX64Word);
- */
- // xor: function (word) {
- // var high = this.high ^ word.high;
- // var low = this.low ^ word.low;
-
- // return X64Word.create(high, low);
- // },
-
- /**
- * Shifts this word n bits to the left.
- *
- * @param {number} n The number of bits to shift.
- *
- * @return {X64Word} A new x64-Word object after shifting.
- *
- * @example
- *
- * var shifted = x64Word.shiftL(25);
- */
- // shiftL: function (n) {
- // if (n < 32) {
- // var high = (this.high << n) | (this.low >>> (32 - n));
- // var low = this.low << n;
- // } else {
- // var high = this.low << (n - 32);
- // var low = 0;
- // }
-
- // return X64Word.create(high, low);
- // },
-
- /**
- * Shifts this word n bits to the right.
- *
- * @param {number} n The number of bits to shift.
- *
- * @return {X64Word} A new x64-Word object after shifting.
- *
- * @example
- *
- * var shifted = x64Word.shiftR(7);
- */
- // shiftR: function (n) {
- // if (n < 32) {
- // var low = (this.low >>> n) | (this.high << (32 - n));
- // var high = this.high >>> n;
- // } else {
- // var low = this.high >>> (n - 32);
- // var high = 0;
- // }
-
- // return X64Word.create(high, low);
- // },
-
- /**
- * Rotates this word n bits to the left.
- *
- * @param {number} n The number of bits to rotate.
- *
- * @return {X64Word} A new x64-Word object after rotating.
- *
- * @example
- *
- * var rotated = x64Word.rotL(25);
- */
- // rotL: function (n) {
- // return this.shiftL(n).or(this.shiftR(64 - n));
- // },
-
- /**
- * Rotates this word n bits to the right.
- *
- * @param {number} n The number of bits to rotate.
- *
- * @return {X64Word} A new x64-Word object after rotating.
- *
- * @example
- *
- * var rotated = x64Word.rotR(7);
- */
- // rotR: function (n) {
- // return this.shiftR(n).or(this.shiftL(64 - n));
- // },
-
- /**
- * Adds this word with the passed word.
- *
- * @param {X64Word} word The x64-Word to add with this word.
- *
- * @return {X64Word} A new x64-Word object after adding.
- *
- * @example
- *
- * var added = x64Word.add(anotherX64Word);
- */
- // add: function (word) {
- // var low = (this.low + word.low) | 0;
- // var carry = (low >>> 0) < (this.low >>> 0) ? 1 : 0;
- // var high = (this.high + word.high + carry) | 0;
-
- // return X64Word.create(high, low);
- // }
- });
-
- /**
- * An array of 64-bit words.
- *
- * @property {Array} words The array of CryptoJS.x64.Word objects.
- * @property {number} sigBytes The number of significant bytes in this word array.
- */
- var X64WordArray = C_x64.WordArray = Base.extend({
- /**
- * Initializes a newly created word array.
- *
- * @param {Array} words (Optional) An array of CryptoJS.x64.Word objects.
- * @param {number} sigBytes (Optional) The number of significant bytes in the words.
- *
- * @example
- *
- * var wordArray = CryptoJS.x64.WordArray.create();
- *
- * var wordArray = CryptoJS.x64.WordArray.create([
- * CryptoJS.x64.Word.create(0x00010203, 0x04050607),
- * CryptoJS.x64.Word.create(0x18191a1b, 0x1c1d1e1f)
- * ]);
- *
- * var wordArray = CryptoJS.x64.WordArray.create([
- * CryptoJS.x64.Word.create(0x00010203, 0x04050607),
- * CryptoJS.x64.Word.create(0x18191a1b, 0x1c1d1e1f)
- * ], 10);
- */
- init: function (words, sigBytes) {
- words = this.words = words || [];
-
- if (sigBytes != undefined) {
- this.sigBytes = sigBytes;
- } else {
- this.sigBytes = words.length * 8;
- }
- },
-
- /**
- * Converts this 64-bit word array to a 32-bit word array.
- *
- * @return {CryptoJS.lib.WordArray} This word array's data as a 32-bit word array.
- *
- * @example
- *
- * var x32WordArray = x64WordArray.toX32();
- */
- toX32: function () {
- // Shortcuts
- var x64Words = this.words;
- var x64WordsLength = x64Words.length;
-
- // Convert
- var x32Words = [];
- for (var i = 0; i < x64WordsLength; i++) {
- var x64Word = x64Words[i];
- x32Words.push(x64Word.high);
- x32Words.push(x64Word.low);
- }
-
- return X32WordArray.create(x32Words, this.sigBytes);
- },
-
- /**
- * Creates a copy of this word array.
- *
- * @return {X64WordArray} The clone.
- *
- * @example
- *
- * var clone = x64WordArray.clone();
- */
- clone: function () {
- var clone = Base.clone.call(this);
-
- // Clone "words" array
- var words = clone.words = this.words.slice(0);
-
- // Clone each X64Word object
- var wordsLength = words.length;
- for (var i = 0; i < wordsLength; i++) {
- words[i] = words[i].clone();
- }
-
- return clone;
- }
- });
- }());
-
-
- return CryptoJS;
-
-}));
-},{"./core":31}],63:[function(_dereq_,module,exports){
-var assert = _dereq_('assert')
-var BigInteger = _dereq_('bigi')
-
-var Point = _dereq_('./point')
+ stream._writableState.errorEmitted = true;
+ stream.emit('error', er);
+}
-function Curve(p, a, b, Gx, Gy, n, h) {
- this.p = p
- this.a = a
- this.b = b
- this.G = Point.fromAffine(this, Gx, Gy)
- this.n = n
- this.h = h
+function onwriteStateUpdate(state) {
+ state.writing = false;
+ state.writecb = null;
+ state.length -= state.writelen;
+ state.writelen = 0;
+}
- this.infinity = new Point(this, null, null, BigInteger.ZERO)
+function onwrite(stream, er) {
+ var state = stream._writableState;
+ var sync = state.sync;
+ var cb = state.writecb;
- // result caching
- this.pOverFour = p.add(BigInteger.ONE).shiftRight(2)
-}
+ onwriteStateUpdate(state);
-Curve.prototype.pointFromX = function(isOdd, x) {
- var alpha = x.pow(3).add(this.a.multiply(x)).add(this.b).mod(this.p)
- var beta = alpha.modPow(this.pOverFour, this.p)
+ if (er)
+ onwriteError(stream, state, sync, er, cb);
+ else {
+ // Check if we're actually ready to finish, but don't emit yet
+ var finished = needFinish(stream, state);
+
+ if (!finished &&
+ !state.corked &&
+ !state.bufferProcessing &&
+ state.buffer.length) {
+ clearBuffer(stream, state);
+ }
- var y = beta
- if (beta.isEven() ^ !isOdd) {
- y = this.p.subtract(y) // -y % p
+ if (sync) {
+ process.nextTick(function() {
+ afterWrite(stream, state, finished, cb);
+ });
+ } else {
+ afterWrite(stream, state, finished, cb);
+ }
}
-
- return Point.fromAffine(this, x, y)
}
-Curve.prototype.isInfinity = function(Q) {
- if (Q === this.infinity) return true
+function afterWrite(stream, state, finished, cb) {
+ if (!finished)
+ onwriteDrain(stream, state);
+ state.pendingcb--;
+ cb();
+ finishMaybe(stream, state);
+}
- return Q.z.signum() === 0 && Q.y.signum() !== 0
+// Must force callback to be called on nextTick, so that we don't
+// emit 'drain' before the write() consumer gets the 'false' return
+// value, and has a chance to attach a 'drain' listener.
+function onwriteDrain(stream, state) {
+ if (state.length === 0 && state.needDrain) {
+ state.needDrain = false;
+ stream.emit('drain');
+ }
}
-Curve.prototype.isOnCurve = function(Q) {
- if (this.isInfinity(Q)) return true
- var x = Q.affineX
- var y = Q.affineY
- var a = this.a
- var b = this.b
- var p = this.p
+// if there's something in the buffer waiting, then process it
+function clearBuffer(stream, state) {
+ state.bufferProcessing = true;
- // Check that xQ and yQ are integers in the interval [0, p - 1]
- if (x.signum() < 0 || x.compareTo(p) >= 0) return false
- if (y.signum() < 0 || y.compareTo(p) >= 0) return false
+ if (stream._writev && state.buffer.length > 1) {
+ // Fast case, write everything using _writev()
+ var cbs = [];
+ for (var c = 0; c < state.buffer.length; c++)
+ cbs.push(state.buffer[c].callback);
- // and check that y^2 = x^3 + ax + b (mod p)
- var lhs = y.square().mod(p)
- var rhs = x.pow(3).add(a.multiply(x)).add(b).mod(p)
- return lhs.equals(rhs)
+ // count the one we are adding, as well.
+ // TODO(isaacs) clean this up
+ state.pendingcb++;
+ doWrite(stream, state, true, state.length, state.buffer, '', function(err) {
+ for (var i = 0; i < cbs.length; i++) {
+ state.pendingcb--;
+ cbs[i](err);
+ }
+ });
+
+ // Clear buffer
+ state.buffer = [];
+ } else {
+ // Slow case, write chunks one-by-one
+ for (var c = 0; c < state.buffer.length; c++) {
+ var entry = state.buffer[c];
+ var chunk = entry.chunk;
+ var encoding = entry.encoding;
+ var cb = entry.callback;
+ var len = state.objectMode ? 1 : chunk.length;
+
+ doWrite(stream, state, false, len, chunk, encoding, cb);
+
+ // if we didn't call the onwrite immediately, then
+ // it means that we need to wait until it does.
+ // also, that means that the chunk and cb are currently
+ // being processed, so move the buffer counter past them.
+ if (state.writing) {
+ c++;
+ break;
+ }
+ }
+
+ if (c < state.buffer.length)
+ state.buffer = state.buffer.slice(c);
+ else
+ state.buffer.length = 0;
+ }
+
+ state.bufferProcessing = false;
}
-/**
- * Validate an elliptic curve point.
- *
- * See SEC 1, section 3.2.2.1: Elliptic Curve Public Key Validation Primitive
- */
-Curve.prototype.validate = function(Q) {
- // Check Q != O
- assert(!this.isInfinity(Q), 'Point is at infinity')
- assert(this.isOnCurve(Q), 'Point is not on the curve')
+Writable.prototype._write = function(chunk, encoding, cb) {
+ cb(new Error('not implemented'));
- // Check nQ = O (where Q is a scalar multiple of G)
- var nQ = Q.multiply(this.n)
- assert(this.isInfinity(nQ), 'Point is not a scalar multiple of G')
+};
- return true
+Writable.prototype._writev = null;
+
+Writable.prototype.end = function(chunk, encoding, cb) {
+ var state = this._writableState;
+
+ if (util.isFunction(chunk)) {
+ cb = chunk;
+ chunk = null;
+ encoding = null;
+ } else if (util.isFunction(encoding)) {
+ cb = encoding;
+ encoding = null;
+ }
+
+ if (!util.isNullOrUndefined(chunk))
+ this.write(chunk, encoding);
+
+ // .end() fully uncorks
+ if (state.corked) {
+ state.corked = 1;
+ this.uncork();
+ }
+
+ // ignore unnecessary end() calls.
+ if (!state.ending && !state.finished)
+ endWritable(this, state, cb);
+};
+
+
+function needFinish(stream, state) {
+ return (state.ending &&
+ state.length === 0 &&
+ !state.finished &&
+ !state.writing);
}
-module.exports = Curve
+function prefinish(stream, state) {
+ if (!state.prefinished) {
+ state.prefinished = true;
+ stream.emit('prefinish');
+ }
+}
-},{"./point":67,"assert":4,"bigi":3}],64:[function(_dereq_,module,exports){
-module.exports={
- "secp128r1": {
- "p": "fffffffdffffffffffffffffffffffff",
- "a": "fffffffdfffffffffffffffffffffffc",
- "b": "e87579c11079f43dd824993c2cee5ed3",
- "n": "fffffffe0000000075a30d1b9038a115",
- "h": "01",
- "Gx": "161ff7528b899b2d0c28607ca52c5b86",
- "Gy": "cf5ac8395bafeb13c02da292dded7a83"
- },
- "secp160k1": {
- "p": "fffffffffffffffffffffffffffffffeffffac73",
- "a": "00",
- "b": "07",
- "n": "0100000000000000000001b8fa16dfab9aca16b6b3",
- "h": "01",
- "Gx": "3b4c382ce37aa192a4019e763036f4f5dd4d7ebb",
- "Gy": "938cf935318fdced6bc28286531733c3f03c4fee"
- },
- "secp160r1": {
- "p": "ffffffffffffffffffffffffffffffff7fffffff",
- "a": "ffffffffffffffffffffffffffffffff7ffffffc",
- "b": "1c97befc54bd7a8b65acf89f81d4d4adc565fa45",
- "n": "0100000000000000000001f4c8f927aed3ca752257",
- "h": "01",
- "Gx": "4a96b5688ef573284664698968c38bb913cbfc82",
- "Gy": "23a628553168947d59dcc912042351377ac5fb32"
- },
- "secp192k1": {
- "p": "fffffffffffffffffffffffffffffffffffffffeffffee37",
- "a": "00",
- "b": "03",
- "n": "fffffffffffffffffffffffe26f2fc170f69466a74defd8d",
- "h": "01",
- "Gx": "db4ff10ec057e9ae26b07d0280b7f4341da5d1b1eae06c7d",
- "Gy": "9b2f2f6d9c5628a7844163d015be86344082aa88d95e2f9d"
- },
- "secp192r1": {
- "p": "fffffffffffffffffffffffffffffffeffffffffffffffff",
- "a": "fffffffffffffffffffffffffffffffefffffffffffffffc",
- "b": "64210519e59c80e70fa7e9ab72243049feb8deecc146b9b1",
- "n": "ffffffffffffffffffffffff99def836146bc9b1b4d22831",
- "h": "01",
- "Gx": "188da80eb03090f67cbf20eb43a18800f4ff0afd82ff1012",
- "Gy": "07192b95ffc8da78631011ed6b24cdd573f977a11e794811"
- },
- "secp224r1": {
- "p": "ffffffffffffffffffffffffffffffff000000000000000000000001",
- "a": "fffffffffffffffffffffffffffffffefffffffffffffffffffffffe",
- "b": "b4050a850c04b3abf54132565044b0b7d7bfd8ba270b39432355ffb4",
- "n": "ffffffffffffffffffffffffffff16a2e0b8f03e13dd29455c5c2a3d",
- "h": "01",
- "Gx": "b70e0cbd6bb4bf7f321390b94a03c1d356c21122343280d6115c1d21",
- "Gy": "bd376388b5f723fb4c22dfe6cd4375a05a07476444d5819985007e34"
- },
- "secp256k1": {
- "p": "fffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f",
- "a": "00",
- "b": "07",
- "n": "fffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141",
- "h": "01",
- "Gx": "79be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798",
- "Gy": "483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8"
- },
- "secp256r1": {
- "p": "ffffffff00000001000000000000000000000000ffffffffffffffffffffffff",
- "a": "ffffffff00000001000000000000000000000000fffffffffffffffffffffffc",
- "b": "5ac635d8aa3a93e7b3ebbd55769886bc651d06b0cc53b0f63bce3c3e27d2604b",
- "n": "ffffffff00000000ffffffffffffffffbce6faada7179e84f3b9cac2fc632551",
- "h": "01",
- "Gx": "6b17d1f2e12c4247f8bce6e563a440f277037d812deb33a0f4a13945d898c296",
- "Gy": "4fe342e2fe1a7f9b8ee7eb4a7c0f9e162bce33576b315ececbb6406837bf51f5"
+function finishMaybe(stream, state) {
+ var need = needFinish(stream, state);
+ if (need) {
+ if (state.pendingcb === 0) {
+ prefinish(stream, state);
+ state.finished = true;
+ stream.emit('finish');
+ } else
+ prefinish(stream, state);
}
+ return need;
}
-},{}],65:[function(_dereq_,module,exports){
-var Point = _dereq_('./point')
-var Curve = _dereq_('./curve')
+function endWritable(stream, state, cb) {
+ state.ending = true;
+ finishMaybe(stream, state);
+ if (cb) {
+ if (state.finished)
+ process.nextTick(cb);
+ else
+ stream.once('finish', cb);
+ }
+ state.ended = true;
+}
-var getCurveByName = _dereq_('./names')
+}).call(this,require('_process'))
+},{"./_stream_duplex":16,"_process":14,"buffer":7,"core-util-is":21,"inherits":12,"stream":26}],21:[function(require,module,exports){
+(function (Buffer){
+// Copyright Joyent, Inc. and other Node contributors.
+//
+// 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.
-module.exports = {
- Curve: Curve,
- Point: Point,
- getCurveByName: getCurveByName
+// NOTE: These type checking functions intentionally don't use `instanceof`
+// because it is fragile and can be easily faked with `Object.create()`.
+function isArray(ar) {
+ return Array.isArray(ar);
}
+exports.isArray = isArray;
-},{"./curve":63,"./names":66,"./point":67}],66:[function(_dereq_,module,exports){
-var BigInteger = _dereq_('bigi')
-
-var curves = _dereq_('./curves')
-var Curve = _dereq_('./curve')
+function isBoolean(arg) {
+ return typeof arg === 'boolean';
+}
+exports.isBoolean = isBoolean;
-function getCurveByName(name) {
- var curve = curves[name]
- if (!curve) return null
+function isNull(arg) {
+ return arg === null;
+}
+exports.isNull = isNull;
- var p = new BigInteger(curve.p, 16)
- var a = new BigInteger(curve.a, 16)
- var b = new BigInteger(curve.b, 16)
- var n = new BigInteger(curve.n, 16)
- var h = new BigInteger(curve.h, 16)
- var Gx = new BigInteger(curve.Gx, 16)
- var Gy = new BigInteger(curve.Gy, 16)
+function isNullOrUndefined(arg) {
+ return arg == null;
+}
+exports.isNullOrUndefined = isNullOrUndefined;
- return new Curve(p, a, b, Gx, Gy, n, h)
+function isNumber(arg) {
+ return typeof arg === 'number';
}
+exports.isNumber = isNumber;
-module.exports = getCurveByName
+function isString(arg) {
+ return typeof arg === 'string';
+}
+exports.isString = isString;
-},{"./curve":63,"./curves":64,"bigi":3}],67:[function(_dereq_,module,exports){
-(function (Buffer){
-var assert = _dereq_('assert')
-var BigInteger = _dereq_('bigi')
+function isSymbol(arg) {
+ return typeof arg === 'symbol';
+}
+exports.isSymbol = isSymbol;
-var THREE = BigInteger.valueOf(3)
+function isUndefined(arg) {
+ return arg === void 0;
+}
+exports.isUndefined = isUndefined;
-function Point(curve, x, y, z) {
- assert.notStrictEqual(z, undefined, 'Missing Z coordinate')
+function isRegExp(re) {
+ return isObject(re) && objectToString(re) === '[object RegExp]';
+}
+exports.isRegExp = isRegExp;
- this.curve = curve
- this.x = x
- this.y = y
- this.z = z
- this._zInv = null
+function isObject(arg) {
+ return typeof arg === 'object' && arg !== null;
+}
+exports.isObject = isObject;
- this.compressed = true
+function isDate(d) {
+ return isObject(d) && objectToString(d) === '[object Date]';
}
+exports.isDate = isDate;
-Object.defineProperty(Point.prototype, 'zInv', {
- get: function() {
- if (this._zInv === null) {
- this._zInv = this.z.modInverse(this.curve.p)
- }
+function isError(e) {
+ return isObject(e) &&
+ (objectToString(e) === '[object Error]' || e instanceof Error);
+}
+exports.isError = isError;
- return this._zInv
- }
-})
+function isFunction(arg) {
+ return typeof arg === 'function';
+}
+exports.isFunction = isFunction;
-Object.defineProperty(Point.prototype, 'affineX', {
- get: function() {
- return this.x.multiply(this.zInv).mod(this.curve.p)
- }
-})
+function isPrimitive(arg) {
+ return arg === null ||
+ typeof arg === 'boolean' ||
+ typeof arg === 'number' ||
+ typeof arg === 'string' ||
+ typeof arg === 'symbol' || // ES6 symbol
+ typeof arg === 'undefined';
+}
+exports.isPrimitive = isPrimitive;
-Object.defineProperty(Point.prototype, 'affineY', {
- get: function() {
- return this.y.multiply(this.zInv).mod(this.curve.p)
- }
-})
+function isBuffer(arg) {
+ return Buffer.isBuffer(arg);
+}
+exports.isBuffer = isBuffer;
-Point.fromAffine = function(curve, x, y) {
- return new Point(curve, x, y, BigInteger.ONE)
+function objectToString(o) {
+ return Object.prototype.toString.call(o);
}
+}).call(this,require("buffer").Buffer)
+},{"buffer":7}],22:[function(require,module,exports){
+module.exports = require("./lib/_stream_passthrough.js")
-Point.prototype.equals = function(other) {
- if (other === this) return true
- if (this.curve.isInfinity(this)) return this.curve.isInfinity(other)
- if (this.curve.isInfinity(other)) return this.curve.isInfinity(this)
+},{"./lib/_stream_passthrough.js":17}],23:[function(require,module,exports){
+exports = module.exports = require('./lib/_stream_readable.js');
+exports.Stream = require('stream');
+exports.Readable = exports;
+exports.Writable = require('./lib/_stream_writable.js');
+exports.Duplex = require('./lib/_stream_duplex.js');
+exports.Transform = require('./lib/_stream_transform.js');
+exports.PassThrough = require('./lib/_stream_passthrough.js');
- // u = Y2 * Z1 - Y1 * Z2
- var u = other.y.multiply(this.z).subtract(this.y.multiply(other.z)).mod(this.curve.p)
+},{"./lib/_stream_duplex.js":16,"./lib/_stream_passthrough.js":17,"./lib/_stream_readable.js":18,"./lib/_stream_transform.js":19,"./lib/_stream_writable.js":20,"stream":26}],24:[function(require,module,exports){
+module.exports = require("./lib/_stream_transform.js")
- if (u.signum() !== 0) return false
+},{"./lib/_stream_transform.js":19}],25:[function(require,module,exports){
+module.exports = require("./lib/_stream_writable.js")
- // v = X2 * Z1 - X1 * Z2
- var v = other.x.multiply(this.z).subtract(this.x.multiply(other.z)).mod(this.curve.p)
+},{"./lib/_stream_writable.js":20}],26:[function(require,module,exports){
+// Copyright Joyent, Inc. and other Node contributors.
+//
+// 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.
- return v.signum() === 0
-}
+module.exports = Stream;
-Point.prototype.negate = function() {
- var y = this.curve.p.subtract(this.y)
+var EE = require('events').EventEmitter;
+var inherits = require('inherits');
- return new Point(this.curve, this.x, y, this.z)
+inherits(Stream, EE);
+Stream.Readable = require('readable-stream/readable.js');
+Stream.Writable = require('readable-stream/writable.js');
+Stream.Duplex = require('readable-stream/duplex.js');
+Stream.Transform = require('readable-stream/transform.js');
+Stream.PassThrough = require('readable-stream/passthrough.js');
+
+// Backwards-compat with node 0.4.x
+Stream.Stream = Stream;
+
+
+
+// old-style streams. Note that the pipe method (the only relevant
+// part of this class) is overridden in the Readable class.
+
+function Stream() {
+ EE.call(this);
}
-Point.prototype.add = function(b) {
- if (this.curve.isInfinity(this)) return b
- if (this.curve.isInfinity(b)) return this
+Stream.prototype.pipe = function(dest, options) {
+ var source = this;
- var x1 = this.x
- var y1 = this.y
- var x2 = b.x
- var y2 = b.y
+ function ondata(chunk) {
+ if (dest.writable) {
+ if (false === dest.write(chunk) && source.pause) {
+ source.pause();
+ }
+ }
+ }
- // u = Y2 * Z1 - Y1 * Z2
- var u = y2.multiply(this.z).subtract(y1.multiply(b.z)).mod(this.curve.p)
- // v = X2 * Z1 - X1 * Z2
- var v = x2.multiply(this.z).subtract(x1.multiply(b.z)).mod(this.curve.p)
+ source.on('data', ondata);
- if (v.signum() === 0) {
- if (u.signum() === 0) {
- return this.twice() // this == b, so double
+ function ondrain() {
+ if (source.readable && source.resume) {
+ source.resume();
}
+ }
- return this.curve.infinity // this = -b, so infinity
+ dest.on('drain', ondrain);
+
+ // If the 'end' option is not supplied, dest.end() will be called when
+ // source gets the 'end' or 'close' events. Only dest.end() once.
+ if (!dest._isStdio && (!options || options.end !== false)) {
+ source.on('end', onend);
+ source.on('close', onclose);
}
- 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.p)
- // 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.p)
- // z3 = v^3 * z1 * z2
- var z3 = v3.multiply(this.z).multiply(b.z).mod(this.curve.p)
-
- return new Point(this.curve, x3, y3, z3)
-}
-
-Point.prototype.twice = function() {
- if (this.curve.isInfinity(this)) return this
- if (this.y.signum() === 0) return this.curve.infinity
+ var didOnEnd = false;
+ function onend() {
+ if (didOnEnd) return;
+ didOnEnd = true;
- var x1 = this.x
- var y1 = this.y
+ dest.end();
+ }
- var y1z1 = y1.multiply(this.z)
- var y1sqz1 = y1z1.multiply(y1).mod(this.curve.p)
- var a = this.curve.a
- // w = 3 * x1^2 + a * z1^2
- var w = x1.square().multiply(THREE)
+ function onclose() {
+ if (didOnEnd) return;
+ didOnEnd = true;
- if (a.signum() !== 0) {
- w = w.add(this.z.square().multiply(a))
+ if (typeof dest.destroy === 'function') dest.destroy();
}
- w = w.mod(this.curve.p)
- // 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.p)
- // 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.pow(3)).mod(this.curve.p)
- // z3 = 8 * (y1 * z1)^3
- var z3 = y1z1.pow(3).shiftLeft(3).mod(this.curve.p)
-
- return new Point(this.curve, x3, y3, z3)
-}
+ // don't leave dangling pipes when there are errors.
+ function onerror(er) {
+ cleanup();
+ if (EE.listenerCount(this, 'error') === 0) {
+ throw er; // Unhandled stream error in pipe.
+ }
+ }
-// Simple NAF (Non-Adjacent Form) multiplication algorithm
-// TODO: modularize the multiplication algorithm
-Point.prototype.multiply = function(k) {
- if (this.curve.isInfinity(this)) return this
- if (k.signum() === 0) return this.curve.infinity
+ source.on('error', onerror);
+ dest.on('error', onerror);
- var e = k
- var h = e.multiply(THREE)
+ // remove all the event listeners that were added.
+ function cleanup() {
+ source.removeListener('data', ondata);
+ dest.removeListener('drain', ondrain);
- var neg = this.negate()
- var R = this
+ source.removeListener('end', onend);
+ source.removeListener('close', onclose);
- for (var i = h.bitLength() - 2; i > 0; --i) {
- R = R.twice()
+ source.removeListener('error', onerror);
+ dest.removeListener('error', onerror);
- var hBit = h.testBit(i)
- var eBit = e.testBit(i)
+ source.removeListener('end', cleanup);
+ source.removeListener('close', cleanup);
- if (hBit != eBit) {
- R = R.add(hBit ? this : neg)
- }
+ dest.removeListener('close', cleanup);
}
- return R
-}
+ source.on('end', cleanup);
+ source.on('close', cleanup);
-// Compute this*j + x*k (simultaneous multiplication)
-Point.prototype.multiplyTwo = function(j, x, k) {
- var i
+ dest.on('close', cleanup);
- if (j.bitLength() > k.bitLength())
- i = j.bitLength() - 1
- else
- i = k.bitLength() - 1
+ dest.emit('pipe', source);
- var R = this.curve.infinity
- var both = this.add(x)
+ // Allow for unix-like usage: A.pipe(B).pipe(C)
+ return dest;
+};
- while (i >= 0) {
- R = R.twice()
+},{"events":11,"inherits":12,"readable-stream/duplex.js":15,"readable-stream/passthrough.js":22,"readable-stream/readable.js":23,"readable-stream/transform.js":24,"readable-stream/writable.js":25}],27:[function(require,module,exports){
+// Copyright Joyent, Inc. and other Node contributors.
+//
+// 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.
- var jBit = j.testBit(i)
- var kBit = k.testBit(i)
+var Buffer = require('buffer').Buffer;
- if (jBit) {
- if (kBit) {
- R = R.add(both)
+var isBufferEncoding = Buffer.isEncoding
+ || function(encoding) {
+ switch (encoding && encoding.toLowerCase()) {
+ case 'hex': case 'utf8': case 'utf-8': case 'ascii': case 'binary': case 'base64': case 'ucs2': case 'ucs-2': case 'utf16le': case 'utf-16le': case 'raw': return true;
+ default: return false;
+ }
+ }
- } else {
- R = R.add(this)
- }
- } else {
- if (kBit) {
- R = R.add(x)
- }
- }
- --i
+function assertEncoding(encoding) {
+ if (encoding && !isBufferEncoding(encoding)) {
+ throw new Error('Unknown encoding: ' + encoding);
}
-
- return R
}
-Point.prototype.getEncoded = function(compressed) {
- if (compressed == undefined) compressed = this.compressed
- if (this.curve.isInfinity(this)) return new Buffer('00', 'hex') // Infinity point encoded is simply '00'
-
- var x = this.affineX
- var y = this.affineY
-
- var buffer
-
- // Determine size of q in bytes
- var byteLength = Math.floor((this.curve.p.bitLength() + 7) / 8)
-
- // 0x02/0x03 | X
- if (compressed) {
- buffer = new Buffer(1 + byteLength)
- buffer.writeUInt8(y.isEven() ? 0x02 : 0x03, 0)
-
- // 0x04 | X | Y
- } else {
- buffer = new Buffer(1 + byteLength + byteLength)
- buffer.writeUInt8(0x04, 0)
-
- y.toBuffer(byteLength).copy(buffer, 1 + byteLength)
+// StringDecoder provides an interface for efficiently splitting a series of
+// buffers into a series of JS strings without breaking apart multi-byte
+// characters. CESU-8 is handled as part of the UTF-8 encoding.
+//
+// @TODO Handling all encodings inside a single object makes it very difficult
+// to reason about this code, so it should be split up in the future.
+// @TODO There should be a utf8-strict encoding that rejects invalid UTF-8 code
+// points as used by CESU-8.
+var StringDecoder = exports.StringDecoder = function(encoding) {
+ this.encoding = (encoding || 'utf8').toLowerCase().replace(/[-_]/, '');
+ assertEncoding(encoding);
+ switch (this.encoding) {
+ case 'utf8':
+ // CESU-8 represents each of Surrogate Pair by 3-bytes
+ this.surrogateSize = 3;
+ break;
+ case 'ucs2':
+ case 'utf16le':
+ // UTF-16 represents each of Surrogate Pair by 2-bytes
+ this.surrogateSize = 2;
+ this.detectIncompleteChar = utf16DetectIncompleteChar;
+ break;
+ case 'base64':
+ // Base-64 stores 3 bytes in 4 chars, and pads the remainder.
+ this.surrogateSize = 3;
+ this.detectIncompleteChar = base64DetectIncompleteChar;
+ break;
+ default:
+ this.write = passThroughWrite;
+ return;
}
- x.toBuffer(byteLength).copy(buffer, 1)
+ // Enough space to store all bytes of a single character. UTF-8 needs 4
+ // bytes, but CESU-8 may require up to 6 (3 bytes per surrogate).
+ this.charBuffer = new Buffer(6);
+ // Number of bytes received for the current incomplete multi-byte character.
+ this.charReceived = 0;
+ // Number of bytes expected for the current incomplete multi-byte character.
+ this.charLength = 0;
+};
- return buffer
-}
-Point.decodeFrom = function(curve, buffer) {
- var type = buffer.readUInt8(0)
- var compressed = (type !== 4)
+// write decodes the given buffer and returns it as JS string that is
+// guaranteed to not contain any partial multi-byte characters. Any partial
+// character found at the end of the buffer is buffered up, and will be
+// returned when calling write again with the remaining bytes.
+//
+// Note: Converting a Buffer containing an orphan surrogate to a String
+// currently works, but converting a String to a Buffer (via `new Buffer`, or
+// Buffer#write) will replace incomplete surrogates with the unicode
+// replacement character. See https://codereview.chromium.org/121173009/ .
+StringDecoder.prototype.write = function(buffer) {
+ var charStr = '';
+ // if our last write ended with an incomplete multibyte character
+ while (this.charLength) {
+ // determine how many remaining bytes this buffer has to offer for this char
+ var available = (buffer.length >= this.charLength - this.charReceived) ?
+ this.charLength - this.charReceived :
+ buffer.length;
+
+ // add the new bytes to the char buffer
+ buffer.copy(this.charBuffer, this.charReceived, 0, available);
+ this.charReceived += available;
+
+ if (this.charReceived < this.charLength) {
+ // still not enough chars in this buffer? wait for more ...
+ return '';
+ }
- var x = BigInteger.fromBuffer(buffer.slice(1, 33))
- var byteLength = Math.floor((curve.p.bitLength() + 7) / 8)
+ // remove bytes belonging to the current character from the buffer
+ buffer = buffer.slice(available, buffer.length);
- var Q
- if (compressed) {
- assert.equal(buffer.length, byteLength + 1, 'Invalid sequence length')
- assert(type === 0x02 || type === 0x03, 'Invalid sequence tag')
+ // get the character that was split
+ charStr = this.charBuffer.slice(0, this.charLength).toString(this.encoding);
- var isOdd = (type === 0x03)
- Q = curve.pointFromX(isOdd, x)
+ // CESU-8: lead surrogate (D800-DBFF) is also the incomplete character
+ var charCode = charStr.charCodeAt(charStr.length - 1);
+ if (charCode >= 0xD800 && charCode <= 0xDBFF) {
+ this.charLength += this.surrogateSize;
+ charStr = '';
+ continue;
+ }
+ this.charReceived = this.charLength = 0;
- } else {
- assert.equal(buffer.length, 1 + byteLength + byteLength, 'Invalid sequence length')
+ // if there are no more bytes in this buffer, just emit our char
+ if (buffer.length === 0) {
+ return charStr;
+ }
+ break;
+ }
- var y = BigInteger.fromBuffer(buffer.slice(1 + byteLength))
- Q = Point.fromAffine(curve, x, y)
+ // determine and set charLength / charReceived
+ this.detectIncompleteChar(buffer);
+
+ var end = buffer.length;
+ if (this.charLength) {
+ // buffer the incomplete character bytes we got
+ buffer.copy(this.charBuffer, 0, buffer.length - this.charReceived, end);
+ end -= this.charReceived;
}
- Q.compressed = compressed
- return Q
-}
+ charStr += buffer.toString(this.encoding, 0, end);
-Point.prototype.toString = function () {
- if (this.curve.isInfinity(this)) return '(INFINITY)'
+ var end = charStr.length - 1;
+ var charCode = charStr.charCodeAt(end);
+ // CESU-8: lead surrogate (D800-DBFF) is also the incomplete character
+ if (charCode >= 0xD800 && charCode <= 0xDBFF) {
+ var size = this.surrogateSize;
+ this.charLength += size;
+ this.charReceived += size;
+ this.charBuffer.copy(this.charBuffer, size, 0, size);
+ buffer.copy(this.charBuffer, 0, 0, size);
+ return charStr.substring(0, end);
+ }
- return '(' + this.affineX.toString() + ',' + this.affineY.toString() + ')'
-}
+ // or just emit the charStr
+ return charStr;
+};
-module.exports = Point
+// detectIncompleteChar determines if there is an incomplete UTF-8 character at
+// the end of the given buffer. If so, it sets this.charLength to the byte
+// length that character, and sets this.charReceived to the number of bytes
+// that are available for this character.
+StringDecoder.prototype.detectIncompleteChar = function(buffer) {
+ // determine how many bytes we have to check at the end of this buffer
+ var i = (buffer.length >= 3) ? 3 : buffer.length;
+
+ // Figure out if one of the last i bytes of our buffer announces an
+ // incomplete char.
+ for (; i > 0; i--) {
+ var c = buffer[buffer.length - i];
+
+ // See http://en.wikipedia.org/wiki/UTF-8#Description
+
+ // 110XXXXX
+ if (i == 1 && c >> 5 == 0x06) {
+ this.charLength = 2;
+ break;
+ }
-}).call(this,_dereq_("buffer").Buffer)
-},{"assert":4,"bigi":3,"buffer":8}],68:[function(_dereq_,module,exports){
-(function (process,Buffer){
-// Closure compiler error - result of 'not' operator not being used
-//!function(globals){
-(function(globals){
-'use strict'
+ // 1110XXXX
+ if (i <= 2 && c >> 4 == 0x0E) {
+ this.charLength = 3;
+ break;
+ }
-//*** UMD BEGIN
-if (typeof define !== 'undefined' && define.amd) { //require.js / AMD
- define([], function() {
- return secureRandom
- })
-} else if (typeof module !== 'undefined' && module.exports) { //CommonJS
- module.exports = secureRandom
-} else { //script / browser
- globals.secureRandom = secureRandom
-}
-//*** UMD END
-
-//options.type is the only valid option
-function secureRandom(count, options) {
- options = options || {type: 'Array'}
- //we check for process.pid to prevent browserify from tricking us
- if (typeof process != 'undefined' && typeof process.pid == 'number') {
- return nodeRandom(count, options)
- } else {
- var crypto = window.crypto || window.msCrypto
- if (!crypto) throw new Error("Your browser does not support window.crypto.")
- return browserRandom(count, options)
+ // 11110XXX
+ if (i <= 3 && c >> 3 == 0x1E) {
+ this.charLength = 4;
+ break;
+ }
}
-}
+ this.charReceived = i;
+};
-function nodeRandom(count, options) {
- var crypto = _dereq_('crypto')
- var buf = crypto.randomBytes(count)
+StringDecoder.prototype.end = function(buffer) {
+ var res = '';
+ if (buffer && buffer.length)
+ res = this.write(buffer);
- switch (options.type) {
- case 'Array':
- return [].slice.call(buf)
- case 'Buffer':
- return buf
- case 'Uint8Array':
- var arr = new Uint8Array(count)
- for (var i = 0; i < count; ++i) { arr[i] = buf.readUInt8(i) }
- return arr
- default:
- throw new Error(options.type + " is unsupported.")
+ if (this.charReceived) {
+ var cr = this.charReceived;
+ var buf = this.charBuffer;
+ var enc = this.encoding;
+ res += buf.slice(0, cr).toString(enc);
}
-}
-function browserRandom(count, options) {
- var nativeArr = new Uint8Array(count)
- var crypto = window.crypto || window.msCrypto
- crypto.getRandomValues(nativeArr)
+ return res;
+};
- switch (options.type) {
- case 'Array':
- return [].slice.call(nativeArr)
- case 'Buffer':
- try { var b = new Buffer(1) } catch(e) { throw new Error('Buffer not supported in this environment. Use Node.js or Browserify for browser support.')}
- return new Buffer(nativeArr)
- case 'Uint8Array':
- return nativeArr
- default:
- throw new Error(options.type + " is unsupported.")
- }
+function passThroughWrite(buffer) {
+ return buffer.toString(this.encoding);
}
-secureRandom.randomArray = function(byteCount) {
- return secureRandom(byteCount, {type: 'Array'})
+function utf16DetectIncompleteChar(buffer) {
+ this.charReceived = buffer.length % 2;
+ this.charLength = this.charReceived ? 2 : 0;
}
-secureRandom.randomUint8Array = function(byteCount) {
- return secureRandom(byteCount, {type: 'Uint8Array'})
+function base64DetectIncompleteChar(buffer) {
+ this.charReceived = buffer.length % 3;
+ this.charLength = this.charReceived ? 3 : 0;
}
-secureRandom.randomBuffer = function(byteCount) {
- return secureRandom(byteCount, {type: 'Buffer'})
+},{"buffer":7}],28:[function(require,module,exports){
+module.exports = function isBuffer(arg) {
+ return arg && typeof arg === 'object'
+ && typeof arg.copy === 'function'
+ && typeof arg.fill === 'function'
+ && typeof arg.readUInt8 === 'function';
}
+},{}],29:[function(require,module,exports){
+(function (process,global){
+// Copyright Joyent, Inc. and other Node contributors.
+//
+// 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.
+var formatRegExp = /%[sdj%]/g;
+exports.format = function(f) {
+ if (!isString(f)) {
+ var objects = [];
+ for (var i = 0; i < arguments.length; i++) {
+ objects.push(inspect(arguments[i]));
+ }
+ return objects.join(' ');
+ }
-})(this);
-
-}).call(this,_dereq_("FWaASH"),_dereq_("buffer").Buffer)
-},{"FWaASH":12,"buffer":8,"crypto":7}],69:[function(_dereq_,module,exports){
-(function (Buffer){
-var assert = _dereq_('assert')
-var base58check = _dereq_('./base58check')
-var networks = _dereq_('./networks')
-var scripts = _dereq_('./scripts')
-
-function findScriptTypeByVersion(version) {
- for (var networkName in networks) {
- var network = networks[networkName]
-
- if (version === network.pubKeyHash) return 'pubkeyhash'
- if (version === network.scriptHash) return 'scripthash'
+ var i = 1;
+ var args = arguments;
+ var len = args.length;
+ var str = String(f).replace(formatRegExp, function(x) {
+ if (x === '%%') return '%';
+ if (i >= len) return x;
+ switch (x) {
+ case '%s': return String(args[i++]);
+ case '%d': return Number(args[i++]);
+ case '%j':
+ try {
+ return JSON.stringify(args[i++]);
+ } catch (_) {
+ return '[Circular]';
+ }
+ default:
+ return x;
+ }
+ });
+ for (var x = args[i]; i < len; x = args[++i]) {
+ if (isNull(x) || !isObject(x)) {
+ str += ' ' + x;
+ } else {
+ str += ' ' + inspect(x);
+ }
}
-}
+ return str;
+};
-function Address(hash, version) {
- assert(Buffer.isBuffer(hash), 'Expected Buffer, got ' + hash)
- assert.strictEqual(hash.length, 20, 'Invalid hash length')
- assert.strictEqual(version & 0xff, version, 'Invalid version byte')
- this.hash = hash
- this.version = version
-}
-
-// Import functions
-Address.fromBase58Check = function(string) {
- var payload = base58check.decode(string)
- var version = payload.readUInt8(0)
- var hash = payload.slice(1)
+// Mark that a method should not be used.
+// Returns a modified function which warns once by default.
+// If --no-deprecation is set, then it is a no-op.
+exports.deprecate = function(fn, msg) {
+ // Allow for deprecating things in the process of starting up.
+ if (isUndefined(global.process)) {
+ return function() {
+ return exports.deprecate(fn, msg).apply(this, arguments);
+ };
+ }
- return new Address(hash, version)
-}
+ if (process.noDeprecation === true) {
+ return fn;
+ }
-Address.fromOutputScript = function(script, network) {
- network = network || networks.bitcoin
+ var warned = false;
+ function deprecated() {
+ if (!warned) {
+ if (process.throwDeprecation) {
+ throw new Error(msg);
+ } else if (process.traceDeprecation) {
+ console.trace(msg);
+ } else {
+ console.error(msg);
+ }
+ warned = true;
+ }
+ return fn.apply(this, arguments);
+ }
- var type = scripts.classifyOutput(script)
+ return deprecated;
+};
- if (type === 'pubkeyhash') return new Address(script.chunks[2], network.pubKeyHash)
- if (type === 'scripthash') return new Address(script.chunks[1], network.scriptHash)
- assert(false, type + ' has no matching Address')
-}
+var debugs = {};
+var debugEnviron;
+exports.debuglog = function(set) {
+ if (isUndefined(debugEnviron))
+ debugEnviron = process.env.NODE_DEBUG || '';
+ set = set.toUpperCase();
+ if (!debugs[set]) {
+ if (new RegExp('\\b' + set + '\\b', 'i').test(debugEnviron)) {
+ var pid = process.pid;
+ debugs[set] = function() {
+ var msg = exports.format.apply(exports, arguments);
+ console.error('%s %d: %s', set, pid, msg);
+ };
+ } else {
+ debugs[set] = function() {};
+ }
+ }
+ return debugs[set];
+};
-// Export functions
-Address.prototype.toBase58Check = function () {
- var payload = new Buffer(21)
- payload.writeUInt8(this.version, 0)
- this.hash.copy(payload, 1)
- return base58check.encode(payload)
+/**
+ * Echos the value of a value. Trys to print the value out
+ * in the best way possible given the different types.
+ *
+ * @param {Object} obj The object to print out.
+ * @param {Object} opts Optional options object that alters the output.
+ */
+/* legacy: obj, showHidden, depth, colors*/
+function inspect(obj, opts) {
+ // default options
+ var ctx = {
+ seen: [],
+ stylize: stylizeNoColor
+ };
+ // legacy...
+ if (arguments.length >= 3) ctx.depth = arguments[2];
+ if (arguments.length >= 4) ctx.colors = arguments[3];
+ if (isBoolean(opts)) {
+ // legacy...
+ ctx.showHidden = opts;
+ } else if (opts) {
+ // got an "options" object
+ exports._extend(ctx, opts);
+ }
+ // set default options
+ if (isUndefined(ctx.showHidden)) ctx.showHidden = false;
+ if (isUndefined(ctx.depth)) ctx.depth = 2;
+ if (isUndefined(ctx.colors)) ctx.colors = false;
+ if (isUndefined(ctx.customInspect)) ctx.customInspect = true;
+ if (ctx.colors) ctx.stylize = stylizeWithColor;
+ return formatValue(ctx, obj, ctx.depth);
}
+exports.inspect = inspect;
-Address.prototype.toOutputScript = function() {
- var scriptType = findScriptTypeByVersion(this.version)
-
- if (scriptType === 'pubkeyhash') return scripts.pubKeyHashOutput(this.hash)
- if (scriptType === 'scripthash') return scripts.scriptHashOutput(this.hash)
-
- assert(false, this.toString() + ' has no matching Script')
-}
-Address.prototype.toString = Address.prototype.toBase58Check
+// http://en.wikipedia.org/wiki/ANSI_escape_code#graphics
+inspect.colors = {
+ 'bold' : [1, 22],
+ 'italic' : [3, 23],
+ 'underline' : [4, 24],
+ 'inverse' : [7, 27],
+ 'white' : [37, 39],
+ 'grey' : [90, 39],
+ 'black' : [30, 39],
+ 'blue' : [34, 39],
+ 'cyan' : [36, 39],
+ 'green' : [32, 39],
+ 'magenta' : [35, 39],
+ 'red' : [31, 39],
+ 'yellow' : [33, 39]
+};
-module.exports = Address
+// Don't use 'blue' not visible on cmd.exe
+inspect.styles = {
+ 'special': 'cyan',
+ 'number': 'yellow',
+ 'boolean': 'yellow',
+ 'undefined': 'grey',
+ 'null': 'bold',
+ 'string': 'green',
+ 'date': 'magenta',
+ // "name": intentionally not styling
+ 'regexp': 'red'
+};
-}).call(this,_dereq_("buffer").Buffer)
-},{"./base58check":70,"./networks":81,"./scripts":84,"assert":4,"buffer":8}],70:[function(_dereq_,module,exports){
-(function (Buffer){
-// https://en.bitcoin.it/wiki/Base58Check_encoding
-var assert = _dereq_('assert')
-var base58 = _dereq_('bs58')
-var crypto = _dereq_('./crypto')
-// Encode a buffer as a base58-check-encoded string
-function encode(payload) {
- var checksum = crypto.hash256(payload).slice(0, 4)
+function stylizeWithColor(str, styleType) {
+ var style = inspect.styles[styleType];
- return base58.encode(Buffer.concat([
- payload,
- checksum
- ]))
+ if (style) {
+ return '\u001b[' + inspect.colors[style][0] + 'm' + str +
+ '\u001b[' + inspect.colors[style][1] + 'm';
+ } else {
+ return str;
+ }
}
-// Decode a base58-check-encoded string to a buffer
-function decode(string) {
- var buffer = base58.decode(string)
-
- var payload = buffer.slice(0, -4)
- var checksum = buffer.slice(-4)
- var newChecksum = crypto.hash256(payload).slice(0, 4)
-
- assert.deepEqual(newChecksum, checksum, 'Invalid checksum')
- return payload
+function stylizeNoColor(str, styleType) {
+ return str;
}
-module.exports = {
- encode: encode,
- decode: decode
-}
-}).call(this,_dereq_("buffer").Buffer)
-},{"./crypto":73,"assert":4,"bs58":15,"buffer":8}],71:[function(_dereq_,module,exports){
-var assert = _dereq_('assert')
-var opcodes = _dereq_('./opcodes')
+function arrayToHash(array) {
+ var hash = {};
-// https://github.com/feross/buffer/blob/master/index.js#L1127
-function verifuint(value, max) {
- assert(typeof value === 'number', 'cannot write a non-number as a number')
- assert(value >= 0, 'specified a negative value for writing an unsigned value')
- assert(value <= max, 'value is larger than maximum value for type')
- assert(Math.floor(value) === value, 'value has a fractional component')
-}
+ array.forEach(function(val, idx) {
+ hash[val] = true;
+ });
-function pushDataSize(i) {
- return i < opcodes.OP_PUSHDATA1 ? 1
- : i < 0xff ? 2
- : i < 0xffff ? 3
- : 5
+ return hash;
}
-function readPushDataInt(buffer, offset) {
- var opcode = buffer.readUInt8(offset)
- var number, size
-
- // ~6 bit
- if (opcode < opcodes.OP_PUSHDATA1) {
- number = opcode
- size = 1
- // 8 bit
- } else if (opcode === opcodes.OP_PUSHDATA1) {
- number = buffer.readUInt8(offset + 1)
- size = 2
+function formatValue(ctx, value, recurseTimes) {
+ // Provide a hook for user-specified inspect functions.
+ // Check that value is an object with an inspect function on it
+ if (ctx.customInspect &&
+ value &&
+ isFunction(value.inspect) &&
+ // Filter out the util module, it's inspect function is special
+ value.inspect !== exports.inspect &&
+ // Also filter out any prototype objects using the circular check.
+ !(value.constructor && value.constructor.prototype === value)) {
+ var ret = value.inspect(recurseTimes, ctx);
+ if (!isString(ret)) {
+ ret = formatValue(ctx, ret, recurseTimes);
+ }
+ return ret;
+ }
- // 16 bit
- } else if (opcode === opcodes.OP_PUSHDATA2) {
- number = buffer.readUInt16LE(offset + 1)
- size = 3
+ // Primitive types cannot have properties
+ var primitive = formatPrimitive(ctx, value);
+ if (primitive) {
+ return primitive;
+ }
- // 32 bit
- } else {
- assert.equal(opcode, opcodes.OP_PUSHDATA4, 'Unexpected opcode')
+ // Look up the keys of the object.
+ var keys = Object.keys(value);
+ var visibleKeys = arrayToHash(keys);
- number = buffer.readUInt32LE(offset + 1)
- size = 5
+ if (ctx.showHidden) {
+ keys = Object.getOwnPropertyNames(value);
+ }
+ // IE doesn't make error fields non-enumerable
+ // http://msdn.microsoft.com/en-us/library/ie/dww52sbt(v=vs.94).aspx
+ if (isError(value)
+ && (keys.indexOf('message') >= 0 || keys.indexOf('description') >= 0)) {
+ return formatError(value);
}
- return {
- opcode: opcode,
- number: number,
- size: size
+ // Some type of object without properties can be shortcutted.
+ if (keys.length === 0) {
+ if (isFunction(value)) {
+ var name = value.name ? ': ' + value.name : '';
+ return ctx.stylize('[Function' + name + ']', 'special');
+ }
+ if (isRegExp(value)) {
+ return ctx.stylize(RegExp.prototype.toString.call(value), 'regexp');
+ }
+ if (isDate(value)) {
+ return ctx.stylize(Date.prototype.toString.call(value), 'date');
+ }
+ if (isError(value)) {
+ return formatError(value);
+ }
}
-}
-function readUInt64LE(buffer, offset) {
- var a = buffer.readUInt32LE(offset)
- var b = buffer.readUInt32LE(offset + 4)
- b *= 0x100000000
+ var base = '', array = false, braces = ['{', '}'];
- verifuint(b + a, 0x001fffffffffffff)
+ // Make Array say that they are Array
+ if (isArray(value)) {
+ array = true;
+ braces = ['[', ']'];
+ }
- return b + a
-}
-
-function readVarInt(buffer, offset) {
- var t = buffer.readUInt8(offset)
- var number, size
-
- // 8 bit
- if (t < 253) {
- number = t
- size = 1
-
- // 16 bit
- } else if (t < 254) {
- number = buffer.readUInt16LE(offset + 1)
- size = 3
-
- // 32 bit
- } else if (t < 255) {
- number = buffer.readUInt32LE(offset + 1)
- size = 5
+ // Make functions say that they are functions
+ if (isFunction(value)) {
+ var n = value.name ? ': ' + value.name : '';
+ base = ' [Function' + n + ']';
+ }
- // 64 bit
- } else {
- number = readUInt64LE(buffer, offset + 1)
- size = 9
+ // Make RegExps say that they are RegExps
+ if (isRegExp(value)) {
+ base = ' ' + RegExp.prototype.toString.call(value);
}
- return {
- number: number,
- size: size
+ // Make dates with properties first say the date
+ if (isDate(value)) {
+ base = ' ' + Date.prototype.toUTCString.call(value);
}
-}
-function writePushDataInt(buffer, number, offset) {
- var size = pushDataSize(number)
+ // Make error with message first say the error
+ if (isError(value)) {
+ base = ' ' + formatError(value);
+ }
- // ~6 bit
- if (size === 1) {
- buffer.writeUInt8(number, offset)
+ if (keys.length === 0 && (!array || value.length == 0)) {
+ return braces[0] + base + braces[1];
+ }
- // 8 bit
- } else if (size === 2) {
- buffer.writeUInt8(opcodes.OP_PUSHDATA1, offset)
- buffer.writeUInt8(number, offset + 1)
+ if (recurseTimes < 0) {
+ if (isRegExp(value)) {
+ return ctx.stylize(RegExp.prototype.toString.call(value), 'regexp');
+ } else {
+ return ctx.stylize('[Object]', 'special');
+ }
+ }
- // 16 bit
- } else if (size === 3) {
- buffer.writeUInt8(opcodes.OP_PUSHDATA2, offset)
- buffer.writeUInt16LE(number, offset + 1)
+ ctx.seen.push(value);
- // 32 bit
+ var output;
+ if (array) {
+ output = formatArray(ctx, value, recurseTimes, visibleKeys, keys);
} else {
- buffer.writeUInt8(opcodes.OP_PUSHDATA4, offset)
- buffer.writeUInt32LE(number, offset + 1)
-
+ output = keys.map(function(key) {
+ return formatProperty(ctx, value, recurseTimes, visibleKeys, key, array);
+ });
}
- return size
+ ctx.seen.pop();
+
+ return reduceToSingleString(output, base, braces);
}
-function writeUInt64LE(buffer, value, offset) {
- verifuint(value, 0x001fffffffffffff)
- buffer.writeInt32LE(value & -1, offset)
- buffer.writeUInt32LE(Math.floor(value / 0x100000000), offset + 4)
+function formatPrimitive(ctx, value) {
+ if (isUndefined(value))
+ return ctx.stylize('undefined', 'undefined');
+ if (isString(value)) {
+ var simple = '\'' + JSON.stringify(value).replace(/^"|"$/g, '')
+ .replace(/'/g, "\\'")
+ .replace(/\\"/g, '"') + '\'';
+ return ctx.stylize(simple, 'string');
+ }
+ if (isNumber(value))
+ return ctx.stylize('' + value, 'number');
+ if (isBoolean(value))
+ return ctx.stylize('' + value, 'boolean');
+ // For some reason typeof null is "object", so special case here.
+ if (isNull(value))
+ return ctx.stylize('null', 'null');
}
-function varIntSize(i) {
- return i < 253 ? 1
- : i < 0x10000 ? 3
- : i < 0x100000000 ? 5
- : 9
-}
-function writeVarInt(buffer, number, offset) {
- var size = varIntSize(number)
+function formatError(value) {
+ return '[' + Error.prototype.toString.call(value) + ']';
+}
- // 8 bit
- if (size === 1) {
- buffer.writeUInt8(number, offset)
- // 16 bit
- } else if (size === 3) {
- buffer.writeUInt8(253, offset)
- buffer.writeUInt16LE(number, offset + 1)
+function formatArray(ctx, value, recurseTimes, visibleKeys, keys) {
+ var output = [];
+ for (var i = 0, l = value.length; i < l; ++i) {
+ if (hasOwnProperty(value, String(i))) {
+ output.push(formatProperty(ctx, value, recurseTimes, visibleKeys,
+ String(i), true));
+ } else {
+ output.push('');
+ }
+ }
+ keys.forEach(function(key) {
+ if (!key.match(/^\d+$/)) {
+ output.push(formatProperty(ctx, value, recurseTimes, visibleKeys,
+ key, true));
+ }
+ });
+ return output;
+}
- // 32 bit
- } else if (size === 5) {
- buffer.writeUInt8(254, offset)
- buffer.writeUInt32LE(number, offset + 1)
- // 64 bit
+function formatProperty(ctx, value, recurseTimes, visibleKeys, key, array) {
+ var name, str, desc;
+ desc = Object.getOwnPropertyDescriptor(value, key) || { value: value[key] };
+ if (desc.get) {
+ if (desc.set) {
+ str = ctx.stylize('[Getter/Setter]', 'special');
+ } else {
+ str = ctx.stylize('[Getter]', 'special');
+ }
} else {
- buffer.writeUInt8(255, offset)
- writeUInt64LE(buffer, number, offset + 1)
+ if (desc.set) {
+ str = ctx.stylize('[Setter]', 'special');
+ }
+ }
+ if (!hasOwnProperty(visibleKeys, key)) {
+ name = '[' + key + ']';
+ }
+ if (!str) {
+ if (ctx.seen.indexOf(desc.value) < 0) {
+ if (isNull(recurseTimes)) {
+ str = formatValue(ctx, desc.value, null);
+ } else {
+ str = formatValue(ctx, desc.value, recurseTimes - 1);
+ }
+ if (str.indexOf('\n') > -1) {
+ if (array) {
+ str = str.split('\n').map(function(line) {
+ return ' ' + line;
+ }).join('\n').substr(2);
+ } else {
+ str = '\n' + str.split('\n').map(function(line) {
+ return ' ' + line;
+ }).join('\n');
+ }
+ }
+ } else {
+ str = ctx.stylize('[Circular]', 'special');
+ }
+ }
+ if (isUndefined(name)) {
+ if (array && key.match(/^\d+$/)) {
+ return str;
+ }
+ name = JSON.stringify('' + key);
+ if (name.match(/^"([a-zA-Z_][a-zA-Z_0-9]*)"$/)) {
+ name = name.substr(1, name.length - 2);
+ name = ctx.stylize(name, 'name');
+ } else {
+ name = name.replace(/'/g, "\\'")
+ .replace(/\\"/g, '"')
+ .replace(/(^"|"$)/g, "'");
+ name = ctx.stylize(name, 'string');
+ }
}
- return size
-}
-
-module.exports = {
- pushDataSize: pushDataSize,
- readPushDataInt: readPushDataInt,
- readUInt64LE: readUInt64LE,
- readVarInt: readVarInt,
- varIntSize: varIntSize,
- writePushDataInt: writePushDataInt,
- writeUInt64LE: writeUInt64LE,
- writeVarInt: writeVarInt
+ return name + ': ' + str;
}
-},{"./opcodes":82,"assert":4}],72:[function(_dereq_,module,exports){
-(function (Buffer){
-var assert = _dereq_('assert')
-var Crypto = _dereq_('crypto-js')
-var WordArray = Crypto.lib.WordArray
-function bufferToWordArray(buffer) {
- assert(Buffer.isBuffer(buffer), 'Expected Buffer, got', buffer)
+function reduceToSingleString(output, base, braces) {
+ var numLinesEst = 0;
+ var length = output.reduce(function(prev, cur) {
+ numLinesEst++;
+ if (cur.indexOf('\n') >= 0) numLinesEst++;
+ return prev + cur.replace(/\u001b\[\d\d?m/g, '').length + 1;
+ }, 0);
- var words = []
- for (var i = 0, b = 0; i < buffer.length; i++, b += 8) {
- words[b >>> 5] |= buffer[i] << (24 - b % 32)
+ if (length > 60) {
+ return braces[0] +
+ (base === '' ? '' : base + '\n ') +
+ ' ' +
+ output.join(',\n ') +
+ ' ' +
+ braces[1];
}
- return new WordArray.init(words, buffer.length)
+ return braces[0] + base + ' ' + output.join(', ') + ' ' + braces[1];
}
-function wordArrayToBuffer(wordArray) {
- assert(Array.isArray(wordArray.words), 'Expected WordArray, got' + wordArray)
- var words = wordArray.words
- var buffer = new Buffer(words.length * 4)
-
- words.forEach(function(value, i) {
- buffer.writeInt32BE(value & -1, i * 4)
- })
-
- return buffer
+// NOTE: These type checking functions intentionally don't use `instanceof`
+// because it is fragile and can be easily faked with `Object.create()`.
+function isArray(ar) {
+ return Array.isArray(ar);
}
+exports.isArray = isArray;
-module.exports = {
- bufferToWordArray: bufferToWordArray,
- wordArrayToBuffer: wordArrayToBuffer
+function isBoolean(arg) {
+ return typeof arg === 'boolean';
}
+exports.isBoolean = isBoolean;
-}).call(this,_dereq_("buffer").Buffer)
-},{"assert":4,"buffer":8,"crypto-js":37}],73:[function(_dereq_,module,exports){
-(function (Buffer){
-// Crypto, crypto, where art thou crypto
-var assert = _dereq_('assert')
-var CryptoJS = _dereq_('crypto-js')
-var crypto = _dereq_('crypto')
-var convert = _dereq_('./convert')
-
-function hash160(buffer) {
- return ripemd160(sha256(buffer))
+function isNull(arg) {
+ return arg === null;
}
+exports.isNull = isNull;
-function hash256(buffer) {
- return sha256(sha256(buffer))
+function isNullOrUndefined(arg) {
+ return arg == null;
}
+exports.isNullOrUndefined = isNullOrUndefined;
-function ripemd160(buffer) {
- return crypto.createHash('rmd160').update(buffer).digest()
+function isNumber(arg) {
+ return typeof arg === 'number';
}
+exports.isNumber = isNumber;
-function sha1(buffer) {
- return crypto.createHash('sha1').update(buffer).digest()
+function isString(arg) {
+ return typeof arg === 'string';
}
+exports.isString = isString;
-function sha256(buffer) {
- return crypto.createHash('sha256').update(buffer).digest()
+function isSymbol(arg) {
+ return typeof arg === 'symbol';
}
+exports.isSymbol = isSymbol;
-// FIXME: Name not consistent with others
-function HmacSHA256(buffer, secret) {
- return crypto.createHmac('sha256', secret).update(buffer).digest()
+function isUndefined(arg) {
+ return arg === void 0;
}
+exports.isUndefined = isUndefined;
-function HmacSHA512(data, secret) {
- assert(Buffer.isBuffer(data), 'Expected Buffer for data, got ' + data)
- assert(Buffer.isBuffer(secret), 'Expected Buffer for secret, got ' + secret)
+function isRegExp(re) {
+ return isObject(re) && objectToString(re) === '[object RegExp]';
+}
+exports.isRegExp = isRegExp;
- var dataWords = convert.bufferToWordArray(data)
- var secretWords = convert.bufferToWordArray(secret)
+function isObject(arg) {
+ return typeof arg === 'object' && arg !== null;
+}
+exports.isObject = isObject;
- var hash = CryptoJS.HmacSHA512(dataWords, secretWords)
+function isDate(d) {
+ return isObject(d) && objectToString(d) === '[object Date]';
+}
+exports.isDate = isDate;
- return convert.wordArrayToBuffer(hash)
+function isError(e) {
+ return isObject(e) &&
+ (objectToString(e) === '[object Error]' || e instanceof Error);
}
+exports.isError = isError;
-module.exports = {
- ripemd160: ripemd160,
- sha1: sha1,
- sha256: sha256,
- hash160: hash160,
- hash256: hash256,
- HmacSHA256: HmacSHA256,
- HmacSHA512: HmacSHA512
+function isFunction(arg) {
+ return typeof arg === 'function';
}
+exports.isFunction = isFunction;
-}).call(this,_dereq_("buffer").Buffer)
-},{"./convert":72,"assert":4,"buffer":8,"crypto":19,"crypto-js":37}],74:[function(_dereq_,module,exports){
-(function (Buffer){
-var assert = _dereq_('assert')
-var crypto = _dereq_('./crypto')
+function isPrimitive(arg) {
+ return arg === null ||
+ typeof arg === 'boolean' ||
+ typeof arg === 'number' ||
+ typeof arg === 'string' ||
+ typeof arg === 'symbol' || // ES6 symbol
+ typeof arg === 'undefined';
+}
+exports.isPrimitive = isPrimitive;
-var BigInteger = _dereq_('bigi')
-var ECSignature = _dereq_('./ecsignature')
-var Point = _dereq_('ecurve').Point
+exports.isBuffer = require('./support/isBuffer');
-// https://tools.ietf.org/html/rfc6979#section-3.2
-function deterministicGenerateK(curve, hash, d) {
- assert(Buffer.isBuffer(hash), 'Hash must be a Buffer, not ' + hash)
- assert.equal(hash.length, 32, 'Hash must be 256 bit')
- assert(d instanceof BigInteger, 'Private key must be a BigInteger')
+function objectToString(o) {
+ return Object.prototype.toString.call(o);
+}
- var x = d.toBuffer(32)
- var k = new Buffer(32)
- var v = new Buffer(32)
- // Step B
- v.fill(1)
+function pad(n) {
+ return n < 10 ? '0' + n.toString(10) : n.toString(10);
+}
- // Step C
- k.fill(0)
- // Step D
- k = crypto.HmacSHA256(Buffer.concat([v, new Buffer([0]), x, hash]), k)
+var months = ['Jan', 'Feb', 'Mar', 'Apr', 'May', 'Jun', 'Jul', 'Aug', 'Sep',
+ 'Oct', 'Nov', 'Dec'];
- // Step E
- v = crypto.HmacSHA256(v, k)
+// 26 Feb 16:19:34
+function timestamp() {
+ var d = new Date();
+ var time = [pad(d.getHours()),
+ pad(d.getMinutes()),
+ pad(d.getSeconds())].join(':');
+ return [d.getDate(), months[d.getMonth()], time].join(' ');
+}
- // Step F
- k = crypto.HmacSHA256(Buffer.concat([v, new Buffer([1]), x, hash]), k)
- // Step G
- v = crypto.HmacSHA256(v, k)
+// log is just a thin wrapper to console.log that prepends a timestamp
+exports.log = function() {
+ console.log('%s - %s', timestamp(), exports.format.apply(exports, arguments));
+};
- // Step H1/H2a, ignored as tlen === qlen (256 bit)
- // Step H2b
- v = crypto.HmacSHA256(v, k)
- var T = BigInteger.fromBuffer(v)
+/**
+ * Inherit the prototype methods from one constructor into another.
+ *
+ * The Function.prototype.inherits from lang.js rewritten as a standalone
+ * function (not on Function.prototype). NOTE: If this file is to be loaded
+ * during bootstrapping this function needs to be rewritten using some native
+ * functions as prototype setup using normal JavaScript does not work as
+ * expected during bootstrapping (see mirror.js in r114903).
+ *
+ * @param {function} ctor Constructor function which needs to inherit the
+ * prototype.
+ * @param {function} superCtor Constructor function to inherit prototype from.
+ */
+exports.inherits = require('inherits');
- // Step H3, repeat until T is within the interval [1, n - 1]
- while ((T.signum() <= 0) || (T.compareTo(curve.n) >= 0)) {
- k = crypto.HmacSHA256(Buffer.concat([v, new Buffer([0])]), k)
- v = crypto.HmacSHA256(v, k)
+exports._extend = function(origin, add) {
+ // Don't do anything if add isn't an object
+ if (!add || !isObject(add)) return origin;
- T = BigInteger.fromBuffer(v)
+ var keys = Object.keys(add);
+ var i = keys.length;
+ while (i--) {
+ origin[keys[i]] = add[keys[i]];
}
+ return origin;
+};
- return T
+function hasOwnProperty(obj, prop) {
+ return Object.prototype.hasOwnProperty.call(obj, prop);
}
-function sign(curve, hash, d) {
- var k = deterministicGenerateK(curve, hash, d)
-
- var n = curve.n
- var G = curve.G
- var Q = G.multiply(k)
- var e = BigInteger.fromBuffer(hash)
+}).call(this,require('_process'),typeof global !== "undefined" ? global : typeof self !== "undefined" ? self : typeof window !== "undefined" ? window : {})
+},{"./support/isBuffer":28,"_process":14,"inherits":12}],30:[function(require,module,exports){
+// Base58 encoding/decoding
+// Originally written by Mike Hearn for BitcoinJ
+// Copyright (c) 2011 Google Inc
+// Ported to JavaScript by Stefan Thomas
+// Merged Buffer refactorings from base58-native by Stephen Pair
+// Copyright (c) 2013 BitPay Inc
- var r = Q.affineX.mod(n)
- assert.notEqual(r.signum(), 0, 'Invalid R value')
+var ALPHABET = '123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz'
+var ALPHABET_MAP = {}
+for(var i = 0; i < ALPHABET.length; i++) {
+ ALPHABET_MAP[ALPHABET.charAt(i)] = i
+}
+var BASE = 58
- var s = k.modInverse(n).multiply(e.add(d.multiply(r))).mod(n)
- assert.notEqual(s.signum(), 0, 'Invalid S value')
+function encode(buffer) {
+ if (buffer.length === 0) return ''
- var N_OVER_TWO = n.shiftRight(1)
+ var i, j, digits = [0]
+ for (i = 0; i < buffer.length; i++) {
+ for (j = 0; j < digits.length; j++) digits[j] <<= 8
- // enforce low S values, see bip62: 'low s values in signatures'
- if (s.compareTo(N_OVER_TWO) > 0) {
- s = n.subtract(s)
- }
+ digits[0] += buffer[i]
- return new ECSignature(r, s)
-}
+ var carry = 0
+ for (j = 0; j < digits.length; ++j) {
+ digits[j] += carry
-function verify(curve, hash, signature, Q) {
- var e = BigInteger.fromBuffer(hash)
+ carry = (digits[j] / BASE) | 0
+ digits[j] %= BASE
+ }
- return verifyRaw(curve, e, signature, Q)
-}
+ while (carry) {
+ digits.push(carry % BASE)
-function verifyRaw(curve, e, signature, Q) {
- var n = curve.n
- var G = curve.G
+ carry = (carry / BASE) | 0
+ }
+ }
- var r = signature.r
- var s = signature.s
+ // deal with leading zeros
+ for (i = 0; buffer[i] === 0 && i < buffer.length - 1; i++) digits.push(0)
- if (r.signum() === 0 || r.compareTo(n) >= 0) return false
- if (s.signum() === 0 || s.compareTo(n) >= 0) return false
+ // convert digits to a string
+ var stringOutput = ""
+ for (var i = digits.length - 1; i >= 0; i--) {
+ stringOutput = stringOutput + ALPHABET[digits[i]]
+ }
+ return stringOutput
+}
- var c = s.modInverse(n)
+function decode(string) {
+ if (string.length === 0) return []
- var u1 = e.multiply(c).mod(n)
- var u2 = r.multiply(c).mod(n)
+ var i, j, bytes = [0]
+ for (i = 0; i < string.length; i++) {
+ var c = string[i]
+ if (!(c in ALPHABET_MAP)) throw new Error('Non-base58 character')
- var point = G.multiplyTwo(u1, Q, u2)
- var v = point.affineX.mod(n)
+ for (j = 0; j < bytes.length; j++) bytes[j] *= BASE
+ bytes[0] += ALPHABET_MAP[c]
- return v.equals(r)
-}
+ var carry = 0
+ for (j = 0; j < bytes.length; ++j) {
+ bytes[j] += carry
-/**
- * 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
- */
-function recoverPubKey(curve, e, signature, i) {
- assert.strictEqual(i & 3, i, 'Recovery param is more than two bits')
+ carry = bytes[j] >> 8
+ bytes[j] &= 0xff
+ }
- var r = signature.r
- var s = signature.s
+ while (carry) {
+ bytes.push(carry & 0xff)
- // A set LSB signifies that the y-coordinate is odd
- var isYOdd = i & 1
+ carry >>= 8
+ }
+ }
- // The more significant bit specifies whether we should use the
- // first or second candidate key.
- var isSecondKey = i >> 1
+ // deal with leading zeros
+ for (i = 0; string[i] === '1' && i < string.length - 1; i++) bytes.push(0)
- var n = curve.n
- var G = curve.G
+ return bytes.reverse()
+}
- // 1.1 Let x = r + jn
- var x = isSecondKey ? r.add(n) : r
- var R = curve.pointFromX(isYOdd, x)
+module.exports = {
+ encode: encode,
+ decode: decode
+}
- // 1.4 Check that nR is at infinity
- var nR = R.multiply(n)
- assert(curve.isInfinity(nR), 'nR is not a valid curve point')
+},{}],31:[function(require,module,exports){
+(function (Buffer){
+'use strict'
- // Compute -e from e
- var eNeg = e.negate().mod(n)
+var base58 = require('bs58')
+var createHash = require('create-hash')
- // 1.6.1 Compute Q = r^-1 (sR - eG)
- // Q = r^-1 (sR + -eG)
- var rInv = r.modInverse(n)
+// SHA256(SHA256(buffer))
+function sha256x2 (buffer) {
+ buffer = createHash('sha256').update(buffer).digest()
+ return createHash('sha256').update(buffer).digest()
+}
- var Q = R.multiplyTwo(s, G, eNeg).multiply(rInv)
- curve.validate(Q)
+// Encode a buffer as a base58-check encoded string
+function encode (payload) {
+ var checksum = sha256x2(payload).slice(0, 4)
- return Q
+ return base58.encode(Buffer.concat([
+ payload,
+ checksum
+ ]))
}
-/**
- * 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.
- */
-function calcPubKeyRecoveryParam(curve, e, signature, Q) {
- for (var i = 0; i < 4; i++) {
- var Qprime = recoverPubKey(curve, e, signature, i)
+// Decode a base58-check encoded string to a buffer
+function decode (string) {
+ var buffer = new Buffer(base58.decode(string))
- // 1.6.2 Verify Q
- if (Qprime.equals(Q)) {
- return i
- }
+ var payload = buffer.slice(0, -4)
+ var checksum = buffer.slice(-4)
+ var newChecksum = sha256x2(payload).slice(0, 4)
+
+ for (var i = 0; i < newChecksum.length; ++i) {
+ if (newChecksum[i] === checksum[i]) continue
+
+ throw new Error('Invalid checksum')
}
- throw new Error('Unable to find valid recovery factor')
+ return payload
}
module.exports = {
- calcPubKeyRecoveryParam: calcPubKeyRecoveryParam,
- deterministicGenerateK: deterministicGenerateK,
- recoverPubKey: recoverPubKey,
- sign: sign,
- verify: verify,
- verifyRaw: verifyRaw
+ encode: encode,
+ decode: decode
}
-}).call(this,_dereq_("buffer").Buffer)
-},{"./crypto":73,"./ecsignature":77,"assert":4,"bigi":3,"buffer":8,"ecurve":65}],75:[function(_dereq_,module,exports){
+}).call(this,require("buffer").Buffer)
+},{"bs58":30,"buffer":7,"create-hash":32}],32:[function(require,module,exports){
(function (Buffer){
-var assert = _dereq_('assert')
-var base58check = _dereq_('./base58check')
-var ecdsa = _dereq_('./ecdsa')
-var networks = _dereq_('./networks')
-var secureRandom = _dereq_('secure-random')
+'use strict';
+var inherits = require('inherits')
+var md5 = require('./md5')
+var rmd160 = require('ripemd160')
+var sha = require('sha.js')
-var BigInteger = _dereq_('bigi')
-var ECPubKey = _dereq_('./ecpubkey')
+var Transform = require('stream').Transform
-var ecurve = _dereq_('ecurve')
-var curve = ecurve.getCurveByName('secp256k1')
+function HashNoConstructor(hash) {
+ Transform.call(this)
-function ECKey(d, compressed) {
- assert(d.signum() > 0, 'Private key must be greater than 0')
- assert(d.compareTo(curve.n) < 0, 'Private key must be less than the curve order')
+ this._hash = hash
+ this.buffers = []
+}
- var Q = curve.G.multiply(d)
+inherits(HashNoConstructor, Transform)
- this.d = d
- this.pub = new ECPubKey(Q, compressed)
+HashNoConstructor.prototype._transform = function (data, _, next) {
+ this.buffers.push(data)
+
+ next()
}
-// Static constructors
-ECKey.fromWIF = function(string) {
- var payload = base58check.decode(string)
- var compressed = false
+HashNoConstructor.prototype._flush = function (next) {
+ this.push(this.digest())
+ next()
+}
- // Ignore the version byte
- payload = payload.slice(1)
+HashNoConstructor.prototype.update = function (data, enc) {
+ if (typeof data === 'string') {
+ data = new Buffer(data, enc)
+ }
- if (payload.length === 33) {
- assert.strictEqual(payload[32], 0x01, 'Invalid compression flag')
+ this.buffers.push(data)
+ return this
+}
- // Truncate the compression flag
- payload = payload.slice(0, -1)
- compressed = true
- }
+HashNoConstructor.prototype.digest = function (enc) {
+ var buf = Buffer.concat(this.buffers)
+ var r = this._hash(buf)
+ this.buffers = null
- assert.equal(payload.length, 32, 'Invalid WIF payload length')
+ return enc ? r.toString(enc) : r
+}
- var d = BigInteger.fromBuffer(payload)
- return new ECKey(d, compressed)
+function Hash(hash) {
+ Transform.call(this)
+
+ this._hash = hash
}
-ECKey.makeRandom = function(compressed, rng) {
- rng = rng || secureRandom.randomBuffer
+inherits(Hash, Transform)
- var buffer = rng(32)
- assert(Buffer.isBuffer(buffer), 'Expected Buffer, got ' + buffer)
+Hash.prototype._transform = function (data, enc, next) {
+ if (enc) data = new Buffer(data, enc)
- var d = BigInteger.fromBuffer(buffer)
- d = d.mod(curve.n)
+ this._hash.update(data)
- return new ECKey(d, compressed)
+ next()
}
-// Export functions
-ECKey.prototype.toWIF = function(network) {
- network = network || networks.bitcoin
-
- var bufferLen = this.pub.compressed ? 34 : 33
- var buffer = new Buffer(bufferLen)
+Hash.prototype._flush = function (next) {
+ this.push(this._hash.digest())
+ this._hash = null
- buffer.writeUInt8(network.wif, 0)
- this.d.toBuffer(32).copy(buffer, 1)
+ next()
+}
- if (this.pub.compressed) {
- buffer.writeUInt8(0x01, 33)
+Hash.prototype.update = function (data, enc) {
+ if (typeof data === 'string') {
+ data = new Buffer(data, enc)
}
- return base58check.encode(buffer)
+ this._hash.update(data)
+ return this
}
-// Operations
-ECKey.prototype.sign = function(hash) {
- return ecdsa.sign(curve, hash, this.d)
-}
-
-module.exports = ECKey
+Hash.prototype.digest = function (enc) {
+ var outData = this._hash.digest()
-}).call(this,_dereq_("buffer").Buffer)
-},{"./base58check":70,"./ecdsa":74,"./ecpubkey":76,"./networks":81,"assert":4,"bigi":3,"buffer":8,"ecurve":65,"secure-random":68}],76:[function(_dereq_,module,exports){
-(function (Buffer){
-var assert = _dereq_('assert')
-var crypto = _dereq_('./crypto')
-var ecdsa = _dereq_('./ecdsa')
-var networks = _dereq_('./networks')
+ return enc ? outData.toString(enc) : outData
+}
-var Address = _dereq_('./address')
+module.exports = function createHash (alg) {
+ if ('md5' === alg) return new HashNoConstructor(md5)
+ if ('rmd160' === alg) return new HashNoConstructor(rmd160)
-var ecurve = _dereq_('ecurve')
-var curve = ecurve.getCurveByName('secp256k1')
+ return new Hash(sha(alg))
+}
-function ECPubKey(Q, compressed) {
- assert(Q instanceof ecurve.Point, 'Expected Point, got ' + Q)
+}).call(this,require("buffer").Buffer)
+},{"./md5":34,"buffer":7,"inherits":35,"ripemd160":36,"sha.js":38,"stream":26}],33:[function(require,module,exports){
+(function (Buffer){
+'use strict';
+var intSize = 4;
+var zeroBuffer = new Buffer(intSize); zeroBuffer.fill(0);
+var chrsz = 8;
- if (compressed == undefined) compressed = true
- assert.strictEqual(typeof compressed, 'boolean', 'Expected boolean, got ' + compressed)
+function toArray(buf, bigEndian) {
+ if ((buf.length % intSize) !== 0) {
+ var len = buf.length + (intSize - (buf.length % intSize));
+ buf = Buffer.concat([buf, zeroBuffer], len);
+ }
- this.compressed = compressed
- this.Q = Q
+ var arr = [];
+ var fn = bigEndian ? buf.readInt32BE : buf.readInt32LE;
+ for (var i = 0; i < buf.length; i += intSize) {
+ arr.push(fn.call(buf, i));
+ }
+ return arr;
}
-// Static constructors
-ECPubKey.fromBuffer = function(buffer) {
- var Q = ecurve.Point.decodeFrom(curve, buffer)
- return new ECPubKey(Q, Q.compressed)
+function toBuffer(arr, size, bigEndian) {
+ var buf = new Buffer(size);
+ var fn = bigEndian ? buf.writeInt32BE : buf.writeInt32LE;
+ for (var i = 0; i < arr.length; i++) {
+ fn.call(buf, arr[i], i * 4, true);
+ }
+ return buf;
}
-ECPubKey.fromHex = function(hex) {
- return ECPubKey.fromBuffer(new Buffer(hex, 'hex'))
+function hash(buf, fn, hashSize, bigEndian) {
+ if (!Buffer.isBuffer(buf)) buf = new Buffer(buf);
+ var arr = fn(toArray(buf, bigEndian), buf.length * chrsz);
+ return toBuffer(arr, hashSize, bigEndian);
}
+exports.hash = hash;
+}).call(this,require("buffer").Buffer)
+},{"buffer":7}],34:[function(require,module,exports){
+'use strict';
+/*
+ * A JavaScript implementation of the RSA Data Security, Inc. MD5 Message
+ * Digest Algorithm, as defined in RFC 1321.
+ * Version 2.1 Copyright (C) Paul Johnston 1999 - 2002.
+ * Other contributors: Greg Holt, Andrew Kepert, Ydnar, Lostinet
+ * Distributed under the BSD License
+ * See http://pajhome.org.uk/crypt/md5 for more info.
+ */
-// Operations
-ECPubKey.prototype.getAddress = function(network) {
- network = network || networks.bitcoin
+var helpers = require('./helpers');
- return new Address(crypto.hash160(this.toBuffer()), network.pubKeyHash)
-}
+/*
+ * Calculate the MD5 of an array of little-endian words, and a bit length
+ */
+function core_md5(x, len)
+{
+ /* append padding */
+ x[len >> 5] |= 0x80 << ((len) % 32);
+ x[(((len + 64) >>> 9) << 4) + 14] = len;
-ECPubKey.prototype.verify = function(hash, signature) {
- return ecdsa.verify(curve, hash, signature, this.Q)
-}
+ var a = 1732584193;
+ var b = -271733879;
+ var c = -1732584194;
+ var d = 271733878;
-// Export functions
-ECPubKey.prototype.toBuffer = function() {
- return this.Q.getEncoded(this.compressed)
-}
+ for(var i = 0; i < x.length; i += 16)
+ {
+ var olda = a;
+ var oldb = b;
+ var oldc = c;
+ var oldd = d;
-ECPubKey.prototype.toHex = function() {
- return this.toBuffer().toString('hex')
-}
+ a = md5_ff(a, b, c, d, x[i+ 0], 7 , -680876936);
+ d = md5_ff(d, a, b, c, x[i+ 1], 12, -389564586);
+ c = md5_ff(c, d, a, b, x[i+ 2], 17, 606105819);
+ b = md5_ff(b, c, d, a, x[i+ 3], 22, -1044525330);
+ a = md5_ff(a, b, c, d, x[i+ 4], 7 , -176418897);
+ d = md5_ff(d, a, b, c, x[i+ 5], 12, 1200080426);
+ c = md5_ff(c, d, a, b, x[i+ 6], 17, -1473231341);
+ b = md5_ff(b, c, d, a, x[i+ 7], 22, -45705983);
+ a = md5_ff(a, b, c, d, x[i+ 8], 7 , 1770035416);
+ d = md5_ff(d, a, b, c, x[i+ 9], 12, -1958414417);
+ c = md5_ff(c, d, a, b, x[i+10], 17, -42063);
+ b = md5_ff(b, c, d, a, x[i+11], 22, -1990404162);
+ a = md5_ff(a, b, c, d, x[i+12], 7 , 1804603682);
+ d = md5_ff(d, a, b, c, x[i+13], 12, -40341101);
+ c = md5_ff(c, d, a, b, x[i+14], 17, -1502002290);
+ b = md5_ff(b, c, d, a, x[i+15], 22, 1236535329);
-module.exports = ECPubKey
+ a = md5_gg(a, b, c, d, x[i+ 1], 5 , -165796510);
+ d = md5_gg(d, a, b, c, x[i+ 6], 9 , -1069501632);
+ c = md5_gg(c, d, a, b, x[i+11], 14, 643717713);
+ b = md5_gg(b, c, d, a, x[i+ 0], 20, -373897302);
+ a = md5_gg(a, b, c, d, x[i+ 5], 5 , -701558691);
+ d = md5_gg(d, a, b, c, x[i+10], 9 , 38016083);
+ c = md5_gg(c, d, a, b, x[i+15], 14, -660478335);
+ b = md5_gg(b, c, d, a, x[i+ 4], 20, -405537848);
+ a = md5_gg(a, b, c, d, x[i+ 9], 5 , 568446438);
+ d = md5_gg(d, a, b, c, x[i+14], 9 , -1019803690);
+ c = md5_gg(c, d, a, b, x[i+ 3], 14, -187363961);
+ b = md5_gg(b, c, d, a, x[i+ 8], 20, 1163531501);
+ a = md5_gg(a, b, c, d, x[i+13], 5 , -1444681467);
+ d = md5_gg(d, a, b, c, x[i+ 2], 9 , -51403784);
+ c = md5_gg(c, d, a, b, x[i+ 7], 14, 1735328473);
+ b = md5_gg(b, c, d, a, x[i+12], 20, -1926607734);
-}).call(this,_dereq_("buffer").Buffer)
-},{"./address":69,"./crypto":73,"./ecdsa":74,"./networks":81,"assert":4,"buffer":8,"ecurve":65}],77:[function(_dereq_,module,exports){
-(function (Buffer){
-var assert = _dereq_('assert')
-var BigInteger = _dereq_('bigi')
+ a = md5_hh(a, b, c, d, x[i+ 5], 4 , -378558);
+ d = md5_hh(d, a, b, c, x[i+ 8], 11, -2022574463);
+ c = md5_hh(c, d, a, b, x[i+11], 16, 1839030562);
+ b = md5_hh(b, c, d, a, x[i+14], 23, -35309556);
+ a = md5_hh(a, b, c, d, x[i+ 1], 4 , -1530992060);
+ d = md5_hh(d, a, b, c, x[i+ 4], 11, 1272893353);
+ c = md5_hh(c, d, a, b, x[i+ 7], 16, -155497632);
+ b = md5_hh(b, c, d, a, x[i+10], 23, -1094730640);
+ a = md5_hh(a, b, c, d, x[i+13], 4 , 681279174);
+ d = md5_hh(d, a, b, c, x[i+ 0], 11, -358537222);
+ c = md5_hh(c, d, a, b, x[i+ 3], 16, -722521979);
+ b = md5_hh(b, c, d, a, x[i+ 6], 23, 76029189);
+ a = md5_hh(a, b, c, d, x[i+ 9], 4 , -640364487);
+ d = md5_hh(d, a, b, c, x[i+12], 11, -421815835);
+ c = md5_hh(c, d, a, b, x[i+15], 16, 530742520);
+ b = md5_hh(b, c, d, a, x[i+ 2], 23, -995338651);
-function ECSignature(r, s) {
- assert(r instanceof BigInteger, 'Expected BigInteger, got ' + r)
- assert(s instanceof BigInteger, 'Expected BigInteger, got ' + s)
- this.r = r
- this.s = s
-}
+ a = md5_ii(a, b, c, d, x[i+ 0], 6 , -198630844);
+ d = md5_ii(d, a, b, c, x[i+ 7], 10, 1126891415);
+ c = md5_ii(c, d, a, b, x[i+14], 15, -1416354905);
+ b = md5_ii(b, c, d, a, x[i+ 5], 21, -57434055);
+ a = md5_ii(a, b, c, d, x[i+12], 6 , 1700485571);
+ d = md5_ii(d, a, b, c, x[i+ 3], 10, -1894986606);
+ c = md5_ii(c, d, a, b, x[i+10], 15, -1051523);
+ b = md5_ii(b, c, d, a, x[i+ 1], 21, -2054922799);
+ a = md5_ii(a, b, c, d, x[i+ 8], 6 , 1873313359);
+ d = md5_ii(d, a, b, c, x[i+15], 10, -30611744);
+ c = md5_ii(c, d, a, b, x[i+ 6], 15, -1560198380);
+ b = md5_ii(b, c, d, a, x[i+13], 21, 1309151649);
+ a = md5_ii(a, b, c, d, x[i+ 4], 6 , -145523070);
+ d = md5_ii(d, a, b, c, x[i+11], 10, -1120210379);
+ c = md5_ii(c, d, a, b, x[i+ 2], 15, 718787259);
+ b = md5_ii(b, c, d, a, x[i+ 9], 21, -343485551);
-// Import operations
-ECSignature.parseCompact = function(buffer) {
- assert.equal(buffer.length, 65, 'Invalid signature length')
- var i = buffer.readUInt8(0) - 27
+ a = safe_add(a, olda);
+ b = safe_add(b, oldb);
+ c = safe_add(c, oldc);
+ d = safe_add(d, oldd);
+ }
+ return Array(a, b, c, d);
- // At most 3 bits
- assert.equal(i, i & 7, 'Invalid signature parameter')
- var compressed = !!(i & 4)
+}
- // Recovery param only
- i = i & 3
+/*
+ * These functions implement the four basic operations the algorithm uses.
+ */
+function md5_cmn(q, a, b, x, s, t)
+{
+ return safe_add(bit_rol(safe_add(safe_add(a, q), safe_add(x, t)), s),b);
+}
+function md5_ff(a, b, c, d, x, s, t)
+{
+ return md5_cmn((b & c) | ((~b) & d), a, b, x, s, t);
+}
+function md5_gg(a, b, c, d, x, s, t)
+{
+ return md5_cmn((b & d) | (c & (~d)), a, b, x, s, t);
+}
+function md5_hh(a, b, c, d, x, s, t)
+{
+ return md5_cmn(b ^ c ^ d, a, b, x, s, t);
+}
+function md5_ii(a, b, c, d, x, s, t)
+{
+ return md5_cmn(c ^ (b | (~d)), a, b, x, s, t);
+}
- var r = BigInteger.fromBuffer(buffer.slice(1, 33))
- var s = BigInteger.fromBuffer(buffer.slice(33))
+/*
+ * Add integers, wrapping at 2^32. This uses 16-bit operations internally
+ * to work around bugs in some JS interpreters.
+ */
+function safe_add(x, y)
+{
+ var lsw = (x & 0xFFFF) + (y & 0xFFFF);
+ var msw = (x >> 16) + (y >> 16) + (lsw >> 16);
+ return (msw << 16) | (lsw & 0xFFFF);
+}
- return {
- compressed: compressed,
- i: i,
- signature: new ECSignature(r, s)
- }
+/*
+ * Bitwise rotate a 32-bit number to the left.
+ */
+function bit_rol(num, cnt)
+{
+ return (num << cnt) | (num >>> (32 - cnt));
}
-ECSignature.fromDER = function(buffer) {
- assert.equal(buffer.readUInt8(0), 0x30, 'Not a DER sequence')
- assert.equal(buffer.readUInt8(1), buffer.length - 2, 'Invalid sequence length')
- assert.equal(buffer.readUInt8(2), 0x02, 'Expected a DER integer')
+module.exports = function md5(buf) {
+ return helpers.hash(buf, core_md5, 16);
+};
+},{"./helpers":33}],35:[function(require,module,exports){
+arguments[4][12][0].apply(exports,arguments)
+},{"dup":12}],36:[function(require,module,exports){
+(function (Buffer){
+/*
+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.
- var rLen = buffer.readUInt8(3)
- assert(rLen > 0, 'R length is zero')
+Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
- var offset = 4 + rLen
- assert.equal(buffer.readUInt8(offset), 0x02, 'Expected a DER integer (2)')
+ - 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.
- var sLen = buffer.readUInt8(offset + 1)
- assert(sLen > 0, 'S length is zero')
+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.
+*/
- var rB = buffer.slice(4, offset)
- var sB = buffer.slice(offset + 2)
- offset += 2 + sLen
+// 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
+]
- if (rLen > 1 && rB.readUInt8(0) === 0x00) {
- assert(rB.readUInt8(1) & 0x80, 'R value excessively padded')
- }
+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
+]
- if (sLen > 1 && sB.readUInt8(0) === 0x00) {
- assert(sB.readUInt8(1) & 0x80, 'S value excessively padded')
- }
+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
+]
- assert.equal(offset, buffer.length, 'Invalid DER encoding')
- var r = BigInteger.fromDERInteger(rB)
- var s = BigInteger.fromDERInteger(sB)
+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
+]
- assert(r.signum() >= 0, 'R value is negative')
- assert(s.signum() >= 0, 'S value is negative')
+var hl = [0x00000000, 0x5A827999, 0x6ED9EBA1, 0x8F1BBCDC, 0xA953FD4E]
+var hr = [0x50A28BE6, 0x5C4DD124, 0x6D703EF3, 0x7A6D76E9, 0x00000000]
- return new ECSignature(r, s)
+function bytesToWords (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
}
-// FIXME: 0x00, 0x04, 0x80 are SIGHASH_* boundary constants, importing Transaction causes a circular dependency
-ECSignature.parseScriptSignature = function(buffer) {
- var hashType = buffer.readUInt8(buffer.length - 1)
- var hashTypeMod = hashType & ~0x80
-
- assert(hashTypeMod > 0x00 && hashTypeMod < 0x04, 'Invalid hashType')
-
- return {
- signature: ECSignature.fromDER(buffer.slice(0, -1)),
- hashType: hashType
+function wordsToBytes (words) {
+ var bytes = []
+ for (var b = 0; b < words.length * 32; b += 8) {
+ bytes.push((words[b >>> 5] >>> (24 - b % 32)) & 0xFF)
}
+ return bytes
}
-// Export operations
-ECSignature.prototype.toCompact = function(i, compressed) {
- if (compressed) i += 4
- i += 27
+function processBlock (H, M, offset) {
+ // swap endian
+ for (var i = 0; i < 16; i++) {
+ var offset_i = offset + i
+ var M_offset_i = M[offset_i]
- var buffer = new Buffer(65)
- buffer.writeUInt8(i, 0)
+ // Swap
+ M[offset_i] = (
+ (((M_offset_i << 8) | (M_offset_i >>> 24)) & 0x00ff00ff) |
+ (((M_offset_i << 24) | (M_offset_i >>> 8)) & 0xff00ff00)
+ )
+ }
- this.r.toBuffer(32).copy(buffer, 1)
- this.s.toBuffer(32).copy(buffer, 33)
+ // 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 (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]
+ }
- return buffer
-}
+ t = t | 0
+ t = rotl(t, sr[i])
+ t = (t + er) | 0
+ ar = er
+ er = dr
+ dr = rotl(cr, 10)
+ cr = br
+ br = t
+ }
-ECSignature.prototype.toDER = function() {
- var rBa = this.r.toDERInteger()
- var sBa = this.s.toDERInteger()
+ // 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
+}
- var sequence = []
- sequence.push(0x02) // INTEGER
- sequence.push(rBa.length)
- sequence = sequence.concat(rBa)
+function f1 (x, y, z) {
+ return ((x) ^ (y) ^ (z))
+}
- sequence.push(0x02) // INTEGER
- sequence.push(sBa.length)
- sequence = sequence.concat(sBa)
+function f2 (x, y, z) {
+ return (((x) & (y)) | ((~x) & (z)))
+}
- sequence.unshift(sequence.length)
- sequence.unshift(0x30) // SEQUENCE
+function f3 (x, y, z) {
+ return (((x) | (~(y))) ^ (z))
+}
- return new Buffer(sequence)
+function f4 (x, y, z) {
+ return (((x) & (z)) | ((y) & (~(z))))
}
-ECSignature.prototype.toScriptSignature = function(hashType) {
- var hashTypeBuffer = new Buffer(1)
- hashTypeBuffer.writeUInt8(hashType, 0)
+function f5 (x, y, z) {
+ return ((x) ^ ((y) | (~(z))))
+}
- return Buffer.concat([this.toDER(), hashTypeBuffer])
+function rotl (x, n) {
+ return (x << n) | (x >>> (32 - n))
}
-module.exports = ECSignature
+function ripemd160 (message) {
+ var H = [0x67452301, 0xEFCDAB89, 0x98BADCFE, 0x10325476, 0xC3D2E1F0]
-}).call(this,_dereq_("buffer").Buffer)
-},{"assert":4,"bigi":3,"buffer":8}],78:[function(_dereq_,module,exports){
-(function (Buffer){
-var assert = _dereq_('assert')
-var base58check = _dereq_('./base58check')
-var crypto = _dereq_('./crypto')
-var networks = _dereq_('./networks')
+ if (typeof message === 'string') {
+ message = new Buffer(message, 'utf8')
+ }
-var BigInteger = _dereq_('bigi')
-var ECKey = _dereq_('./eckey')
-var ECPubKey = _dereq_('./ecpubkey')
+ var m = bytesToWords(message)
-var ecurve = _dereq_('ecurve')
-var curve = ecurve.getCurveByName('secp256k1')
+ var nBitsLeft = message.length * 8
+ var nBitsTotal = message.length * 8
-function findBIP32ParamsByVersion(version) {
- for (var name in networks) {
- var network = networks[name]
+ // 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 type in network.bip32) {
- if (version != network.bip32[type]) continue
+ for (var i = 0; i < m.length; i += 16) {
+ processBlock(H, m, i)
+ }
- return {
- isPrivate: (type === 'private'),
- network: network
- }
- }
+ // swap endian
+ for (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)
}
- assert(false, 'Could not find version ' + version.toString(16))
+ var digestbytes = wordsToBytes(H)
+ return new Buffer(digestbytes)
}
-function HDNode(K, chainCode, network) {
- network = network || networks.bitcoin
-
- assert(Buffer.isBuffer(chainCode), 'Expected Buffer, got ' + chainCode)
- assert(network.bip32, 'Unknown BIP32 constants for network')
+module.exports = ripemd160
- this.chainCode = chainCode
- this.depth = 0
- this.index = 0
- this.network = network
+}).call(this,require("buffer").Buffer)
+},{"buffer":7}],37:[function(require,module,exports){
+(function (Buffer){
+// prototype class for hash functions
+function Hash (blockSize, finalSize) {
+ this._block = new Buffer(blockSize)
+ this._finalSize = finalSize
+ this._blockSize = blockSize
+ this._len = 0
+ this._s = 0
+}
- if (K instanceof BigInteger) {
- this.privKey = new ECKey(K, true)
- this.pubKey = this.privKey.pub
- } else {
- this.pubKey = new ECPubKey(K, true)
+Hash.prototype.update = function (data, enc) {
+ if (typeof data === 'string') {
+ enc = enc || 'utf8'
+ data = new Buffer(data, enc)
}
-}
-HDNode.MASTER_SECRET = new Buffer('Bitcoin seed')
-HDNode.HIGHEST_BIT = 0x80000000
-HDNode.LENGTH = 78
+ var l = this._len += data.length
+ var s = this._s || 0
+ var f = 0
+ var buffer = this._block
-HDNode.fromSeedBuffer = function(seed, network) {
- var I = crypto.HmacSHA512(seed, HDNode.MASTER_SECRET)
- var IL = I.slice(0, 32)
- var IR = I.slice(32)
+ while (s < l) {
+ var t = Math.min(data.length, f + this._blockSize - (s % this._blockSize))
+ var ch = (t - f)
- // In case IL is 0 or >= n, the master key is invalid
- // This is handled by `new ECKey` in the HDNode constructor
- var pIL = BigInteger.fromBuffer(IL)
+ for (var i = 0; i < ch; i++) {
+ buffer[(s % this._blockSize) + i] = data[i + f]
+ }
- return new HDNode(pIL, IR, network)
-}
+ s += ch
+ f += ch
-HDNode.fromSeedHex = function(hex, network) {
- return HDNode.fromSeedBuffer(new Buffer(hex, 'hex'), network)
-}
+ if ((s % this._blockSize) === 0) {
+ this._update(buffer)
+ }
+ }
+ this._s = s
-HDNode.fromBase58 = function(string) {
- return HDNode.fromBuffer(base58check.decode(string))
+ return this
}
-HDNode.fromBuffer = function(buffer) {
- assert.strictEqual(buffer.length, HDNode.LENGTH, 'Invalid buffer length')
+Hash.prototype.digest = function (enc) {
+ // Suppose the length of the message M, in bits, is l
+ var l = this._len * 8
- // 4 byte: version bytes
- var version = buffer.readUInt32BE(0)
- var params = findBIP32ParamsByVersion(version)
+ // Append the bit 1 to the end of the message
+ this._block[this._len % this._blockSize] = 0x80
- // 1 byte: depth: 0x00 for master nodes, 0x01 for level-1 descendants, ...
- var depth = buffer.readUInt8(4)
+ // and then k zero bits, where k is the smallest non-negative solution to the equation (l + 1 + k) === finalSize mod blockSize
+ this._block.fill(0, this._len % this._blockSize + 1)
- // 4 bytes: the fingerprint of the parent's key (0x00000000 if master key)
- var parentFingerprint = buffer.readUInt32BE(5)
- if (depth === 0) {
- assert.strictEqual(parentFingerprint, 0x00000000, 'Invalid parent fingerprint')
+ if (l % (this._blockSize * 8) >= this._finalSize * 8) {
+ this._update(this._block)
+ this._block.fill(0)
}
- // 4 bytes: child number. This is the number i in xi = xpar/i, with xi the key being serialized.
- // This is encoded in MSB order. (0x00000000 if master key)
- var index = buffer.readUInt32BE(9)
- assert(depth > 0 || index === 0, 'Invalid index')
+ // to this append the block which is equal to the number l written in binary
+ // TODO: handle case where l is > Math.pow(2, 29)
+ this._block.writeInt32BE(l, this._blockSize - 4)
- // 32 bytes: the chain code
- var chainCode = buffer.slice(13, 45)
- var hd
+ var hash = this._update(this._block) || this._hash()
- // 33 bytes: private key data (0x00 + k)
- if (params.isPrivate) {
- assert.strictEqual(buffer.readUInt8(45), 0x00, 'Invalid private key')
- var data = buffer.slice(46, 78)
- var d = BigInteger.fromBuffer(data)
- hd = new HDNode(d, chainCode, params.network)
+ return enc ? hash.toString(enc) : hash
+}
- // 33 bytes: public key data (0x02 + X or 0x03 + X)
- } else {
- var data = buffer.slice(45, 78)
- var Q = ecurve.Point.decodeFrom(curve, data)
- assert.equal(Q.compressed, true, 'Invalid public key')
+Hash.prototype._update = function () {
+ throw new Error('_update must be implemented by subclass')
+}
- // Verify that the X coordinate in the public point corresponds to a point on the curve.
- // If not, the extended public key is invalid.
- curve.validate(Q)
+module.exports = Hash
- hd = new HDNode(Q, chainCode, params.network)
- }
+}).call(this,require("buffer").Buffer)
+},{"buffer":7}],38:[function(require,module,exports){
+var exports = module.exports = function SHA (algorithm) {
+ algorithm = algorithm.toLowerCase()
- hd.depth = depth
- hd.index = index
- hd.parentFingerprint = parentFingerprint
+ var Algorithm = exports[algorithm]
+ if (!Algorithm) throw new Error(algorithm + ' is not supported (we accept pull requests)')
- return hd
+ return new Algorithm()
}
-HDNode.fromHex = function(hex) {
- return HDNode.fromBuffer(new Buffer(hex, 'hex'))
-}
+exports.sha = require('./sha')
+exports.sha1 = require('./sha1')
+exports.sha224 = require('./sha224')
+exports.sha256 = require('./sha256')
+exports.sha384 = require('./sha384')
+exports.sha512 = require('./sha512')
-HDNode.prototype.getIdentifier = function() {
- return crypto.hash160(this.pubKey.toBuffer())
-}
+},{"./sha":39,"./sha1":40,"./sha224":41,"./sha256":42,"./sha384":43,"./sha512":44}],39:[function(require,module,exports){
+(function (Buffer){
+/*
+ * A JavaScript implementation of the Secure Hash Algorithm, SHA-0, as defined
+ * in FIPS PUB 180-1
+ * This source code is derived from sha1.js of the same repository.
+ * The difference between SHA-0 and SHA-1 is just a bitwise rotate left
+ * operation was added.
+ */
-HDNode.prototype.getFingerprint = function() {
- return this.getIdentifier().slice(0, 4)
-}
+var inherits = require('inherits')
+var Hash = require('./hash')
-HDNode.prototype.getAddress = function() {
- return this.pubKey.getAddress(this.network)
-}
+var W = new Array(80)
-HDNode.prototype.toBase58 = function(isPrivate) {
- return base58check.encode(this.toBuffer(isPrivate))
+function Sha () {
+ this.init()
+ this._w = W
+
+ Hash.call(this, 64, 56)
}
-HDNode.prototype.toBuffer = function(isPrivate) {
- if (isPrivate == undefined) isPrivate = !!this.privKey
+inherits(Sha, Hash)
- // Version
- var version = isPrivate ? this.network.bip32.private : this.network.bip32.public
- var buffer = new Buffer(HDNode.LENGTH)
+Sha.prototype.init = function () {
+ this._a = 0x67452301 | 0
+ this._b = 0xefcdab89 | 0
+ this._c = 0x98badcfe | 0
+ this._d = 0x10325476 | 0
+ this._e = 0xc3d2e1f0 | 0
- // 4 bytes: version bytes
- buffer.writeUInt32BE(version, 0)
+ return this
+}
- // Depth
- // 1 byte: depth: 0x00 for master nodes, 0x01 for level-1 descendants, ....
- buffer.writeUInt8(this.depth, 4)
+/*
+ * Bitwise rotate a 32-bit number to the left.
+ */
+function rol (num, cnt) {
+ return (num << cnt) | (num >>> (32 - cnt))
+}
- // 4 bytes: the fingerprint of the parent's key (0x00000000 if master key)
- var fingerprint = (this.depth === 0) ? 0x00000000 : this.parentFingerprint
- buffer.writeUInt32BE(fingerprint, 5)
+Sha.prototype._update = function (M) {
+ var W = this._w
- // 4 bytes: child number. This is the number i in xi = xpar/i, with xi the key being serialized.
- // This is encoded in Big endian. (0x00000000 if master key)
- buffer.writeUInt32BE(this.index, 9)
+ var a = this._a
+ var b = this._b
+ var c = this._c
+ var d = this._d
+ var e = this._e
- // 32 bytes: the chain code
- this.chainCode.copy(buffer, 13)
+ var j = 0, k
- // 33 bytes: the public key or private key data
- if (isPrivate) {
- assert(this.privKey, 'Missing private key')
+ /*
+ * SHA-1 has a bitwise rotate left operation. But, SHA is not
+ * function calcW() { return rol(W[j - 3] ^ W[j - 8] ^ W[j - 14] ^ W[j - 16], 1) }
+ */
+ function calcW () { return W[j - 3] ^ W[j - 8] ^ W[j - 14] ^ W[j - 16] }
+ function loop (w, f) {
+ W[j] = w
- // 0x00 + k for private keys
- buffer.writeUInt8(0, 45)
- this.privKey.d.toBuffer(32).copy(buffer, 46)
- } else {
+ var t = rol(a, 5) + f + e + w + k
- // X9.62 encoding for public keys
- this.pubKey.toBuffer().copy(buffer, 45)
+ e = d
+ d = c
+ c = rol(b, 30)
+ b = a
+ a = t
+ j++
}
- return buffer
-}
+ k = 1518500249
+ while (j < 16) loop(M.readInt32BE(j * 4), (b & c) | ((~b) & d))
+ while (j < 20) loop(calcW(), (b & c) | ((~b) & d))
+ k = 1859775393
+ while (j < 40) loop(calcW(), b ^ c ^ d)
+ k = -1894007588
+ while (j < 60) loop(calcW(), (b & c) | (b & d) | (c & d))
+ k = -899497514
+ while (j < 80) loop(calcW(), b ^ c ^ d)
-HDNode.prototype.toHex = function(isPrivate) {
- return this.toBuffer(isPrivate).toString('hex')
+ this._a = (a + this._a) | 0
+ this._b = (b + this._b) | 0
+ this._c = (c + this._c) | 0
+ this._d = (d + this._d) | 0
+ this._e = (e + this._e) | 0
}
-// https://github.com/bitcoin/bips/blob/master/bip-0032.mediawiki#child-key-derivation-ckd-functions
-HDNode.prototype.derive = function(index) {
- var isHardened = index >= HDNode.HIGHEST_BIT
- var indexBuffer = new Buffer(4)
- indexBuffer.writeUInt32BE(index, 0)
+Sha.prototype._hash = function () {
+ var H = new Buffer(20)
- var data
+ H.writeInt32BE(this._a | 0, 0)
+ H.writeInt32BE(this._b | 0, 4)
+ H.writeInt32BE(this._c | 0, 8)
+ H.writeInt32BE(this._d | 0, 12)
+ H.writeInt32BE(this._e | 0, 16)
- // Hardened child
- if (isHardened) {
- assert(this.privKey, 'Could not derive hardened child key')
+ return H
+}
- // data = 0x00 || ser256(kpar) || ser32(index)
- data = Buffer.concat([
- this.privKey.d.toBuffer(33),
- indexBuffer
- ])
+module.exports = Sha
- // Normal child
- } else {
- // data = serP(point(kpar)) || ser32(index)
- // = serP(Kpar) || ser32(index)
- data = Buffer.concat([
- this.pubKey.toBuffer(),
- indexBuffer
- ])
- }
- var I = crypto.HmacSHA512(data, this.chainCode)
- var IL = I.slice(0, 32)
- var IR = I.slice(32)
+}).call(this,require("buffer").Buffer)
+},{"./hash":37,"buffer":7,"inherits":35}],40:[function(require,module,exports){
+(function (Buffer){
+/*
+ * A JavaScript implementation of the Secure Hash Algorithm, SHA-1, as defined
+ * in FIPS PUB 180-1
+ * Version 2.1a Copyright Paul Johnston 2000 - 2002.
+ * Other contributors: Greg Holt, Andrew Kepert, Ydnar, Lostinet
+ * Distributed under the BSD License
+ * See http://pajhome.org.uk/crypt/md5 for details.
+ */
- var pIL = BigInteger.fromBuffer(IL)
+var inherits = require('inherits')
+var Hash = require('./hash')
- // In case parse256(IL) >= n, proceed with the next value for i
- if (pIL.compareTo(curve.n) >= 0) {
- return this.derive(index + 1)
- }
+var W = new Array(80)
- // Private parent key -> private child key
- var hd
- if (this.privKey) {
- // ki = parse256(IL) + kpar (mod n)
- var ki = pIL.add(this.privKey.d).mod(curve.n)
+function Sha1 () {
+ this.init()
+ this._w = W
- // In case ki == 0, proceed with the next value for i
- if (ki.signum() === 0) {
- return this.derive(index + 1)
- }
+ Hash.call(this, 64, 56)
+}
- hd = new HDNode(ki, IR, this.network)
+inherits(Sha1, Hash)
- // Public parent key -> public child key
- } else {
- // Ki = point(parse256(IL)) + Kpar
- // = G*IL + Kpar
- var Ki = curve.G.multiply(pIL).add(this.pubKey.Q)
+Sha1.prototype.init = function () {
+ this._a = 0x67452301 | 0
+ this._b = 0xefcdab89 | 0
+ this._c = 0x98badcfe | 0
+ this._d = 0x10325476 | 0
+ this._e = 0xc3d2e1f0 | 0
- // In case Ki is the point at infinity, proceed with the next value for i
- if (curve.isInfinity(Ki)) {
- return this.derive(index + 1)
- }
+ return this
+}
- hd = new HDNode(Ki, IR, this.network)
- }
+/*
+ * Bitwise rotate a 32-bit number to the left.
+ */
+function rol (num, cnt) {
+ return (num << cnt) | (num >>> (32 - cnt))
+}
- hd.depth = this.depth + 1
- hd.index = index
- hd.parentFingerprint = this.getFingerprint().readUInt32BE(0)
+Sha1.prototype._update = function (M) {
+ var W = this._w
- return hd
-}
+ var a = this._a
+ var b = this._b
+ var c = this._c
+ var d = this._d
+ var e = this._e
-HDNode.prototype.deriveHardened = function(index) {
- // Only derives hardened private keys by default
- return this.derive(index + HDNode.HIGHEST_BIT)
-}
+ var j = 0, k
-HDNode.prototype.toString = HDNode.prototype.toBase58
+ function calcW () { return rol(W[j - 3] ^ W[j - 8] ^ W[j - 14] ^ W[j - 16], 1) }
+ function loop (w, f) {
+ W[j] = w
-module.exports = HDNode
+ var t = rol(a, 5) + f + e + w + k
-}).call(this,_dereq_("buffer").Buffer)
-},{"./base58check":70,"./crypto":73,"./eckey":75,"./ecpubkey":76,"./networks":81,"assert":4,"bigi":3,"buffer":8,"ecurve":65}],79:[function(_dereq_,module,exports){
-module.exports = {
- Address: _dereq_('./address'),
- base58check: _dereq_('./base58check'),
- bufferutils: _dereq_('./bufferutils'),
- convert: _dereq_('./convert'),
- crypto: _dereq_('./crypto'),
- ecdsa: _dereq_('./ecdsa'),
- ECKey: _dereq_('./eckey'),
- ECPubKey: _dereq_('./ecpubkey'),
- ECSignature: _dereq_('./ecsignature'),
- Message: _dereq_('./message'),
- opcodes: _dereq_('./opcodes'),
- HDNode: _dereq_('./hdnode'),
- Script: _dereq_('./script'),
- scripts: _dereq_('./scripts'),
- Transaction: _dereq_('./transaction'),
- networks: _dereq_('./networks'),
- Wallet: _dereq_('./wallet')
-}
-
-},{"./address":69,"./base58check":70,"./bufferutils":71,"./convert":72,"./crypto":73,"./ecdsa":74,"./eckey":75,"./ecpubkey":76,"./ecsignature":77,"./hdnode":78,"./message":80,"./networks":81,"./opcodes":82,"./script":83,"./scripts":84,"./transaction":85,"./wallet":86}],80:[function(_dereq_,module,exports){
-(function (Buffer){
-/// Implements Bitcoin's feature for signing arbitrary messages.
-var Address = _dereq_('./address')
-var BigInteger = _dereq_('bigi')
-var bufferutils = _dereq_('./bufferutils')
-var crypto = _dereq_('./crypto')
-var ecdsa = _dereq_('./ecdsa')
-var networks = _dereq_('./networks')
-
-var Address = _dereq_('./address')
-var ECPubKey = _dereq_('./ecpubkey')
-var ECSignature = _dereq_('./ecsignature')
-
-var ecurve = _dereq_('ecurve')
-var ecparams = ecurve.getCurveByName('secp256k1')
+ e = d
+ d = c
+ c = rol(b, 30)
+ b = a
+ a = t
+ j++
+ }
-function magicHash(message, network) {
- var magicPrefix = new Buffer(network.magicPrefix)
- var messageBuffer = new Buffer(message)
- var lengthBuffer = new Buffer(bufferutils.varIntSize(messageBuffer.length))
- bufferutils.writeVarInt(lengthBuffer, messageBuffer.length, 0)
+ k = 1518500249
+ while (j < 16) loop(M.readInt32BE(j * 4), (b & c) | ((~b) & d))
+ while (j < 20) loop(calcW(), (b & c) | ((~b) & d))
+ k = 1859775393
+ while (j < 40) loop(calcW(), b ^ c ^ d)
+ k = -1894007588
+ while (j < 60) loop(calcW(), (b & c) | (b & d) | (c & d))
+ k = -899497514
+ while (j < 80) loop(calcW(), b ^ c ^ d)
- var buffer = Buffer.concat([magicPrefix, lengthBuffer, messageBuffer])
- return crypto.hash256(buffer)
+ this._a = (a + this._a) | 0
+ this._b = (b + this._b) | 0
+ this._c = (c + this._c) | 0
+ this._d = (d + this._d) | 0
+ this._e = (e + this._e) | 0
}
-function sign(privKey, message, network) {
- network = network || networks.bitcoin
+Sha1.prototype._hash = function () {
+ var H = new Buffer(20)
- var hash = magicHash(message, network)
- var signature = privKey.sign(hash)
- var e = BigInteger.fromBuffer(hash)
- var i = ecdsa.calcPubKeyRecoveryParam(ecparams, e, signature, privKey.pub.Q)
+ H.writeInt32BE(this._a | 0, 0)
+ H.writeInt32BE(this._b | 0, 4)
+ H.writeInt32BE(this._c | 0, 8)
+ H.writeInt32BE(this._d | 0, 12)
+ H.writeInt32BE(this._e | 0, 16)
- return signature.toCompact(i, privKey.pub.compressed)
+ return H
}
-// TODO: network could be implied from address
-function verify(address, signatureBuffer, message, network) {
- if (address instanceof Address) {
- address = address.toString()
- }
- network = network || networks.bitcoin
+module.exports = Sha1
- var hash = magicHash(message, network)
- var parsed = ECSignature.parseCompact(signatureBuffer)
- var e = BigInteger.fromBuffer(hash)
- var Q = ecdsa.recoverPubKey(ecparams, e, parsed.signature, parsed.i)
-
- var pubKey = new ECPubKey(Q, parsed.compressed)
- return pubKey.getAddress(network).toString() === address
-}
-
-module.exports = {
- magicHash: magicHash,
- sign: sign,
- verify: verify
-}
-
-}).call(this,_dereq_("buffer").Buffer)
-},{"./address":69,"./bufferutils":71,"./crypto":73,"./ecdsa":74,"./ecpubkey":76,"./ecsignature":77,"./networks":81,"bigi":3,"buffer":8,"ecurve":65}],81:[function(_dereq_,module,exports){
-// https://en.bitcoin.it/wiki/List_of_address_prefixes
-// Dogecoin BIP32 is a proposed standard: https://bitcointalk.org/index.php?topic=409731
+}).call(this,require("buffer").Buffer)
+},{"./hash":37,"buffer":7,"inherits":35}],41:[function(require,module,exports){
+(function (Buffer){
+/**
+ * A JavaScript implementation of the Secure Hash Algorithm, SHA-256, as defined
+ * in FIPS 180-2
+ * Version 2.2-beta Copyright Angel Marin, Paul Johnston 2000 - 2009.
+ * Other contributors: Greg Holt, Andrew Kepert, Ydnar, Lostinet
+ *
+ */
-var networks = {
- bitcoin: {
- magicPrefix: '\x18Bitcoin Signed Message:\n',
- bip32: {
- public: 0x0488b21e,
- private: 0x0488ade4
- },
- pubKeyHash: 0x00,
- scriptHash: 0x05,
- wif: 0x80,
- dustThreshold: 546, // https://github.com/bitcoin/bitcoin/blob/v0.9.2/src/core.h#L151-L162
- feePerKb: 10000, // https://github.com/bitcoin/bitcoin/blob/v0.9.2/src/main.cpp#L53
- estimateFee: estimateFee('bitcoin')
- },
- dogecoin: {
- magicPrefix: '\x19Dogecoin Signed Message:\n',
- bip32: {
- public: 0x02facafd,
- private: 0x02fac398
- },
- pubKeyHash: 0x1e,
- scriptHash: 0x16,
- wif: 0x9e,
- dustThreshold: 0, // https://github.com/dogecoin/dogecoin/blob/v1.7.1/src/core.h#L155-L160
- dustSoftThreshold: 100000000, // https://github.com/dogecoin/dogecoin/blob/v1.7.1/src/main.h#L62
- feePerKb: 100000000, // https://github.com/dogecoin/dogecoin/blob/v1.7.1/src/main.cpp#L58
- estimateFee: estimateFee('dogecoin')
- },
- litecoin: {
- magicPrefix: '\x19Litecoin Signed Message:\n',
- bip32: {
- public: 0x019da462,
- private: 0x019d9cfe
- },
- pubKeyHash: 0x30,
- scriptHash: 0x05,
- wif: 0xb0,
- dustThreshold: 0, // https://github.com/litecoin-project/litecoin/blob/v0.8.7.2/src/main.cpp#L360-L365
- dustSoftThreshold: 100000, // https://github.com/litecoin-project/litecoin/blob/v0.8.7.2/src/main.h#L53
- feePerKb: 100000, // https://github.com/litecoin-project/litecoin/blob/v0.8.7.2/src/main.cpp#L56
- estimateFee: estimateFee('litecoin')
- },
- testnet: {
- magicPrefix: '\x18Bitcoin Signed Message:\n',
- bip32: {
- public: 0x043587cf,
- private: 0x04358394
- },
- pubKeyHash: 0x6f,
- scriptHash: 0xc4,
- wif: 0xef,
- dustThreshold: 546,
- feePerKb: 10000,
- estimateFee: estimateFee('testnet')
- }
-}
+var inherits = require('inherits')
+var Sha256 = require('./sha256')
+var Hash = require('./hash')
-function estimateFee(type) {
- return function(tx) {
- var network = networks[type]
- var baseFee = network.feePerKb
- var byteSize = tx.toBuffer().length
+var W = new Array(64)
- var fee = baseFee * Math.ceil(byteSize / 1000)
- if (network.dustSoftThreshold == undefined) return fee
+function Sha224 () {
+ this.init()
- tx.outs.forEach(function(e){
- if (e.value < network.dustSoftThreshold) {
- fee += baseFee
- }
- })
+ this._w = W // new Array(64)
- return fee
- }
+ Hash.call(this, 64, 56)
}
-module.exports = networks
+inherits(Sha224, Sha256)
-},{}],82:[function(_dereq_,module,exports){
-module.exports = {
- // push value
- OP_FALSE : 0,
- OP_0 : 0,
- OP_PUSHDATA1 : 76,
- OP_PUSHDATA2 : 77,
- OP_PUSHDATA4 : 78,
- OP_1NEGATE : 79,
- OP_RESERVED : 80,
- OP_1 : 81,
- OP_TRUE : 81,
- OP_2 : 82,
- OP_3 : 83,
- OP_4 : 84,
- OP_5 : 85,
- OP_6 : 86,
- OP_7 : 87,
- OP_8 : 88,
- OP_9 : 89,
- OP_10 : 90,
- OP_11 : 91,
- OP_12 : 92,
- OP_13 : 93,
- OP_14 : 94,
- OP_15 : 95,
- OP_16 : 96,
+Sha224.prototype.init = function () {
+ this._a = 0xc1059ed8 | 0
+ this._b = 0x367cd507 | 0
+ this._c = 0x3070dd17 | 0
+ this._d = 0xf70e5939 | 0
+ this._e = 0xffc00b31 | 0
+ this._f = 0x68581511 | 0
+ this._g = 0x64f98fa7 | 0
+ this._h = 0xbefa4fa4 | 0
- // control
- OP_NOP : 97,
- OP_VER : 98,
- OP_IF : 99,
- OP_NOTIF : 100,
- OP_VERIF : 101,
- OP_VERNOTIF : 102,
- OP_ELSE : 103,
- OP_ENDIF : 104,
- OP_VERIFY : 105,
- OP_RETURN : 106,
+ return this
+}
- // stack ops
- OP_TOALTSTACK : 107,
- OP_FROMALTSTACK : 108,
- OP_2DROP : 109,
- OP_2DUP : 110,
- OP_3DUP : 111,
- OP_2OVER : 112,
- OP_2ROT : 113,
- OP_2SWAP : 114,
- OP_IFDUP : 115,
- OP_DEPTH : 116,
- OP_DROP : 117,
- OP_DUP : 118,
- OP_NIP : 119,
- OP_OVER : 120,
- OP_PICK : 121,
- OP_ROLL : 122,
- OP_ROT : 123,
- OP_SWAP : 124,
- OP_TUCK : 125,
+Sha224.prototype._hash = function () {
+ var H = new Buffer(28)
- // splice ops
- OP_CAT : 126,
- OP_SUBSTR : 127,
- OP_LEFT : 128,
- OP_RIGHT : 129,
- OP_SIZE : 130,
+ H.writeInt32BE(this._a, 0)
+ H.writeInt32BE(this._b, 4)
+ H.writeInt32BE(this._c, 8)
+ H.writeInt32BE(this._d, 12)
+ H.writeInt32BE(this._e, 16)
+ H.writeInt32BE(this._f, 20)
+ H.writeInt32BE(this._g, 24)
- // bit logic
- OP_INVERT : 131,
- OP_AND : 132,
- OP_OR : 133,
- OP_XOR : 134,
- OP_EQUAL : 135,
- OP_EQUALVERIFY : 136,
- OP_RESERVED1 : 137,
- OP_RESERVED2 : 138,
+ return H
+}
- // numeric
- OP_1ADD : 139,
- OP_1SUB : 140,
- OP_2MUL : 141,
- OP_2DIV : 142,
- OP_NEGATE : 143,
- OP_ABS : 144,
- OP_NOT : 145,
- OP_0NOTEQUAL : 146,
-
- OP_ADD : 147,
- OP_SUB : 148,
- OP_MUL : 149,
- OP_DIV : 150,
- OP_MOD : 151,
- OP_LSHIFT : 152,
- OP_RSHIFT : 153,
-
- OP_BOOLAND : 154,
- OP_BOOLOR : 155,
- OP_NUMEQUAL : 156,
- OP_NUMEQUALVERIFY : 157,
- OP_NUMNOTEQUAL : 158,
- OP_LESSTHAN : 159,
- OP_GREATERTHAN : 160,
- OP_LESSTHANOREQUAL : 161,
- OP_GREATERTHANOREQUAL : 162,
- OP_MIN : 163,
- OP_MAX : 164,
-
- OP_WITHIN : 165,
+module.exports = Sha224
- // crypto
- OP_RIPEMD160 : 166,
- OP_SHA1 : 167,
- OP_SHA256 : 168,
- OP_HASH160 : 169,
- OP_HASH256 : 170,
- OP_CODESEPARATOR : 171,
- OP_CHECKSIG : 172,
- OP_CHECKSIGVERIFY : 173,
- OP_CHECKMULTISIG : 174,
- OP_CHECKMULTISIGVERIFY : 175,
+}).call(this,require("buffer").Buffer)
+},{"./hash":37,"./sha256":42,"buffer":7,"inherits":35}],42:[function(require,module,exports){
+(function (Buffer){
+/**
+ * A JavaScript implementation of the Secure Hash Algorithm, SHA-256, as defined
+ * in FIPS 180-2
+ * Version 2.2-beta Copyright Angel Marin, Paul Johnston 2000 - 2009.
+ * Other contributors: Greg Holt, Andrew Kepert, Ydnar, Lostinet
+ *
+ */
- // expansion
- OP_NOP1 : 176,
- OP_NOP2 : 177,
- OP_NOP3 : 178,
- OP_NOP4 : 179,
- OP_NOP5 : 180,
- OP_NOP6 : 181,
- OP_NOP7 : 182,
- OP_NOP8 : 183,
- OP_NOP9 : 184,
- OP_NOP10 : 185,
+var inherits = require('inherits')
+var Hash = require('./hash')
+
+var K = [
+ 0x428A2F98, 0x71374491, 0xB5C0FBCF, 0xE9B5DBA5,
+ 0x3956C25B, 0x59F111F1, 0x923F82A4, 0xAB1C5ED5,
+ 0xD807AA98, 0x12835B01, 0x243185BE, 0x550C7DC3,
+ 0x72BE5D74, 0x80DEB1FE, 0x9BDC06A7, 0xC19BF174,
+ 0xE49B69C1, 0xEFBE4786, 0x0FC19DC6, 0x240CA1CC,
+ 0x2DE92C6F, 0x4A7484AA, 0x5CB0A9DC, 0x76F988DA,
+ 0x983E5152, 0xA831C66D, 0xB00327C8, 0xBF597FC7,
+ 0xC6E00BF3, 0xD5A79147, 0x06CA6351, 0x14292967,
+ 0x27B70A85, 0x2E1B2138, 0x4D2C6DFC, 0x53380D13,
+ 0x650A7354, 0x766A0ABB, 0x81C2C92E, 0x92722C85,
+ 0xA2BFE8A1, 0xA81A664B, 0xC24B8B70, 0xC76C51A3,
+ 0xD192E819, 0xD6990624, 0xF40E3585, 0x106AA070,
+ 0x19A4C116, 0x1E376C08, 0x2748774C, 0x34B0BCB5,
+ 0x391C0CB3, 0x4ED8AA4A, 0x5B9CCA4F, 0x682E6FF3,
+ 0x748F82EE, 0x78A5636F, 0x84C87814, 0x8CC70208,
+ 0x90BEFFFA, 0xA4506CEB, 0xBEF9A3F7, 0xC67178F2
+]
+
+var W = new Array(64)
+
+function Sha256 () {
+ this.init()
+
+ this._w = W // new Array(64)
+
+ Hash.call(this, 64, 56)
+}
+
+inherits(Sha256, Hash)
+
+Sha256.prototype.init = function () {
+ this._a = 0x6a09e667 | 0
+ this._b = 0xbb67ae85 | 0
+ this._c = 0x3c6ef372 | 0
+ this._d = 0xa54ff53a | 0
+ this._e = 0x510e527f | 0
+ this._f = 0x9b05688c | 0
+ this._g = 0x1f83d9ab | 0
+ this._h = 0x5be0cd19 | 0
- // template matching params
- OP_PUBKEYHASH : 253,
- OP_PUBKEY : 254,
- OP_INVALIDOPCODE : 255
+ return this
}
-},{}],83:[function(_dereq_,module,exports){
-(function (Buffer){
-var assert = _dereq_('assert')
-var bufferutils = _dereq_('./bufferutils')
-var crypto = _dereq_('./crypto')
-var opcodes = _dereq_('./opcodes')
+function S (X, n) {
+ return (X >>> n) | (X << (32 - n))
+}
-function Script(buffer, chunks) {
- assert(Buffer.isBuffer(buffer), 'Expected Buffer, got ' + buffer)
- assert(Array.isArray(chunks), 'Expected Array, got ' + chunks)
+function R (X, n) {
+ return (X >>> n)
+}
- this.buffer = buffer
- this.chunks = chunks
+function Ch (x, y, z) {
+ return ((x & y) ^ ((~x) & z))
}
-// Import operations
-Script.fromASM = function(asm) {
- var strChunks = asm.split(' ')
+function Maj (x, y, z) {
+ return ((x & y) ^ (x & z) ^ (y & z))
+}
- var chunks = strChunks.map(function(strChunk) {
- if (strChunk in opcodes) {
- return opcodes[strChunk]
+function Sigma0256 (x) {
+ return (S(x, 2) ^ S(x, 13) ^ S(x, 22))
+}
- } else {
- return new Buffer(strChunk, 'hex')
- }
- })
+function Sigma1256 (x) {
+ return (S(x, 6) ^ S(x, 11) ^ S(x, 25))
+}
- return Script.fromChunks(chunks)
+function Gamma0256 (x) {
+ return (S(x, 7) ^ S(x, 18) ^ R(x, 3))
}
-Script.fromBuffer = function(buffer) {
- var chunks = []
+function Gamma1256 (x) {
+ return (S(x, 17) ^ S(x, 19) ^ R(x, 10))
+}
- var i = 0
+Sha256.prototype._update = function (M) {
+ var W = this._w
- while (i < buffer.length) {
- var opcode = buffer.readUInt8(i)
+ var a = this._a | 0
+ var b = this._b | 0
+ var c = this._c | 0
+ var d = this._d | 0
+ var e = this._e | 0
+ var f = this._f | 0
+ var g = this._g | 0
+ var h = this._h | 0
- if ((opcode > opcodes.OP_0) && (opcode <= opcodes.OP_PUSHDATA4)) {
- var d = bufferutils.readPushDataInt(buffer, i)
- i += d.size
+ var j = 0
- var data = buffer.slice(i, i + d.number)
- i += d.number
+ function calcW () { return Gamma1256(W[j - 2]) + W[j - 7] + Gamma0256(W[j - 15]) + W[j - 16] }
+ function loop (w) {
+ W[j] = w
- chunks.push(data)
+ var T1 = h + Sigma1256(e) + Ch(e, f, g) + K[j] + w
+ var T2 = Sigma0256(a) + Maj(a, b, c)
- } else {
- chunks.push(opcode)
+ h = g
+ g = f
+ f = e
+ e = d + T1
+ d = c
+ c = b
+ b = a
+ a = T1 + T2
- i += 1
- }
+ j++
}
- return new Script(buffer, chunks)
+ while (j < 16) loop(M.readInt32BE(j * 4))
+ while (j < 64) loop(calcW())
+
+ this._a = (a + this._a) | 0
+ this._b = (b + this._b) | 0
+ this._c = (c + this._c) | 0
+ this._d = (d + this._d) | 0
+ this._e = (e + this._e) | 0
+ this._f = (f + this._f) | 0
+ this._g = (g + this._g) | 0
+ this._h = (h + this._h) | 0
}
-Script.fromChunks = function(chunks) {
- assert(Array.isArray(chunks), 'Expected Array, got ' + chunks)
+Sha256.prototype._hash = function () {
+ var H = new Buffer(32)
- var bufferSize = chunks.reduce(function(accum, chunk) {
- if (Buffer.isBuffer(chunk)) {
- return accum + bufferutils.pushDataSize(chunk.length) + chunk.length
- }
+ H.writeInt32BE(this._a, 0)
+ H.writeInt32BE(this._b, 4)
+ H.writeInt32BE(this._c, 8)
+ H.writeInt32BE(this._d, 12)
+ H.writeInt32BE(this._e, 16)
+ H.writeInt32BE(this._f, 20)
+ H.writeInt32BE(this._g, 24)
+ H.writeInt32BE(this._h, 28)
- return accum + 1
- }, 0.0)
+ return H
+}
- var buffer = new Buffer(bufferSize)
- var offset = 0
+module.exports = Sha256
- chunks.forEach(function(chunk) {
- if (Buffer.isBuffer(chunk)) {
- offset += bufferutils.writePushDataInt(buffer, chunk.length, offset)
+}).call(this,require("buffer").Buffer)
+},{"./hash":37,"buffer":7,"inherits":35}],43:[function(require,module,exports){
+(function (Buffer){
+var inherits = require('inherits')
+var SHA512 = require('./sha512')
+var Hash = require('./hash')
- chunk.copy(buffer, offset)
- offset += chunk.length
+var W = new Array(160)
- } else {
- buffer.writeUInt8(chunk, offset)
- offset += 1
- }
- })
+function Sha384 () {
+ this.init()
+ this._w = W
- assert.equal(offset, buffer.length, 'Could not decode chunks')
- return new Script(buffer, chunks)
+ Hash.call(this, 128, 112)
}
-Script.fromHex = function(hex) {
- return Script.fromBuffer(new Buffer(hex, 'hex'))
-}
+inherits(Sha384, SHA512)
-// Constants
-Script.EMPTY = Script.fromChunks([])
+Sha384.prototype.init = function () {
+ this._a = 0xcbbb9d5d | 0
+ this._b = 0x629a292a | 0
+ this._c = 0x9159015a | 0
+ this._d = 0x152fecd8 | 0
+ this._e = 0x67332667 | 0
+ this._f = 0x8eb44a87 | 0
+ this._g = 0xdb0c2e0d | 0
+ this._h = 0x47b5481d | 0
-// Operations
-Script.prototype.getHash = function() {
- return crypto.hash160(this.buffer)
-}
+ this._al = 0xc1059ed8 | 0
+ this._bl = 0x367cd507 | 0
+ this._cl = 0x3070dd17 | 0
+ this._dl = 0xf70e5939 | 0
+ this._el = 0xffc00b31 | 0
+ this._fl = 0x68581511 | 0
+ this._gl = 0x64f98fa7 | 0
+ this._hl = 0xbefa4fa4 | 0
-// FIXME: doesn't work for data chunks, maybe time to use buffertools.compare...
-Script.prototype.without = function(needle) {
- return Script.fromChunks(this.chunks.filter(function(op) {
- return op !== needle
- }))
+ return this
}
-// Export operations
-var reverseOps = []
-for (var op in opcodes) {
- var code = opcodes[op]
- reverseOps[code] = op
-}
+Sha384.prototype._hash = function () {
+ var H = new Buffer(48)
-Script.prototype.toASM = function() {
- return this.chunks.map(function(chunk) {
- if (Buffer.isBuffer(chunk)) {
- return chunk.toString('hex')
+ function writeInt64BE (h, l, offset) {
+ H.writeInt32BE(h, offset)
+ H.writeInt32BE(l, offset + 4)
+ }
- } else {
- return reverseOps[chunk]
- }
- }).join(' ')
-}
+ writeInt64BE(this._a, this._al, 0)
+ writeInt64BE(this._b, this._bl, 8)
+ writeInt64BE(this._c, this._cl, 16)
+ writeInt64BE(this._d, this._dl, 24)
+ writeInt64BE(this._e, this._el, 32)
+ writeInt64BE(this._f, this._fl, 40)
-Script.prototype.toBuffer = function() {
- return this.buffer
+ return H
}
-Script.prototype.toHex = function() {
- return this.toBuffer().toString('hex')
+module.exports = Sha384
+
+}).call(this,require("buffer").Buffer)
+},{"./hash":37,"./sha512":44,"buffer":7,"inherits":35}],44:[function(require,module,exports){
+(function (Buffer){
+var inherits = require('inherits')
+var Hash = require('./hash')
+
+var K = [
+ 0x428a2f98, 0xd728ae22, 0x71374491, 0x23ef65cd,
+ 0xb5c0fbcf, 0xec4d3b2f, 0xe9b5dba5, 0x8189dbbc,
+ 0x3956c25b, 0xf348b538, 0x59f111f1, 0xb605d019,
+ 0x923f82a4, 0xaf194f9b, 0xab1c5ed5, 0xda6d8118,
+ 0xd807aa98, 0xa3030242, 0x12835b01, 0x45706fbe,
+ 0x243185be, 0x4ee4b28c, 0x550c7dc3, 0xd5ffb4e2,
+ 0x72be5d74, 0xf27b896f, 0x80deb1fe, 0x3b1696b1,
+ 0x9bdc06a7, 0x25c71235, 0xc19bf174, 0xcf692694,
+ 0xe49b69c1, 0x9ef14ad2, 0xefbe4786, 0x384f25e3,
+ 0x0fc19dc6, 0x8b8cd5b5, 0x240ca1cc, 0x77ac9c65,
+ 0x2de92c6f, 0x592b0275, 0x4a7484aa, 0x6ea6e483,
+ 0x5cb0a9dc, 0xbd41fbd4, 0x76f988da, 0x831153b5,
+ 0x983e5152, 0xee66dfab, 0xa831c66d, 0x2db43210,
+ 0xb00327c8, 0x98fb213f, 0xbf597fc7, 0xbeef0ee4,
+ 0xc6e00bf3, 0x3da88fc2, 0xd5a79147, 0x930aa725,
+ 0x06ca6351, 0xe003826f, 0x14292967, 0x0a0e6e70,
+ 0x27b70a85, 0x46d22ffc, 0x2e1b2138, 0x5c26c926,
+ 0x4d2c6dfc, 0x5ac42aed, 0x53380d13, 0x9d95b3df,
+ 0x650a7354, 0x8baf63de, 0x766a0abb, 0x3c77b2a8,
+ 0x81c2c92e, 0x47edaee6, 0x92722c85, 0x1482353b,
+ 0xa2bfe8a1, 0x4cf10364, 0xa81a664b, 0xbc423001,
+ 0xc24b8b70, 0xd0f89791, 0xc76c51a3, 0x0654be30,
+ 0xd192e819, 0xd6ef5218, 0xd6990624, 0x5565a910,
+ 0xf40e3585, 0x5771202a, 0x106aa070, 0x32bbd1b8,
+ 0x19a4c116, 0xb8d2d0c8, 0x1e376c08, 0x5141ab53,
+ 0x2748774c, 0xdf8eeb99, 0x34b0bcb5, 0xe19b48a8,
+ 0x391c0cb3, 0xc5c95a63, 0x4ed8aa4a, 0xe3418acb,
+ 0x5b9cca4f, 0x7763e373, 0x682e6ff3, 0xd6b2b8a3,
+ 0x748f82ee, 0x5defb2fc, 0x78a5636f, 0x43172f60,
+ 0x84c87814, 0xa1f0ab72, 0x8cc70208, 0x1a6439ec,
+ 0x90befffa, 0x23631e28, 0xa4506ceb, 0xde82bde9,
+ 0xbef9a3f7, 0xb2c67915, 0xc67178f2, 0xe372532b,
+ 0xca273ece, 0xea26619c, 0xd186b8c7, 0x21c0c207,
+ 0xeada7dd6, 0xcde0eb1e, 0xf57d4f7f, 0xee6ed178,
+ 0x06f067aa, 0x72176fba, 0x0a637dc5, 0xa2c898a6,
+ 0x113f9804, 0xbef90dae, 0x1b710b35, 0x131c471b,
+ 0x28db77f5, 0x23047d84, 0x32caab7b, 0x40c72493,
+ 0x3c9ebe0a, 0x15c9bebc, 0x431d67c4, 0x9c100d4c,
+ 0x4cc5d4be, 0xcb3e42b6, 0x597f299c, 0xfc657e2a,
+ 0x5fcb6fab, 0x3ad6faec, 0x6c44198c, 0x4a475817
+]
+
+var W = new Array(160)
+
+function Sha512 () {
+ this.init()
+ this._w = W
+
+ Hash.call(this, 128, 112)
+}
+
+inherits(Sha512, Hash)
+
+Sha512.prototype.init = function () {
+ this._a = 0x6a09e667 | 0
+ this._b = 0xbb67ae85 | 0
+ this._c = 0x3c6ef372 | 0
+ this._d = 0xa54ff53a | 0
+ this._e = 0x510e527f | 0
+ this._f = 0x9b05688c | 0
+ this._g = 0x1f83d9ab | 0
+ this._h = 0x5be0cd19 | 0
+
+ this._al = 0xf3bcc908 | 0
+ this._bl = 0x84caa73b | 0
+ this._cl = 0xfe94f82b | 0
+ this._dl = 0x5f1d36f1 | 0
+ this._el = 0xade682d1 | 0
+ this._fl = 0x2b3e6c1f | 0
+ this._gl = 0xfb41bd6b | 0
+ this._hl = 0x137e2179 | 0
+
+ return this
}
-module.exports = Script
+function S (X, Xl, n) {
+ return (X >>> n) | (Xl << (32 - n))
+}
+
+function Ch (x, y, z) {
+ return ((x & y) ^ ((~x) & z))
+}
+
+function Maj (x, y, z) {
+ return ((x & y) ^ (x & z) ^ (y & z))
+}
+
+Sha512.prototype._update = function (M) {
+ var W = this._w
+
+ var a = this._a | 0
+ var b = this._b | 0
+ var c = this._c | 0
+ var d = this._d | 0
+ var e = this._e | 0
+ var f = this._f | 0
+ var g = this._g | 0
+ var h = this._h | 0
+
+ var al = this._al | 0
+ var bl = this._bl | 0
+ var cl = this._cl | 0
+ var dl = this._dl | 0
+ var el = this._el | 0
+ var fl = this._fl | 0
+ var gl = this._gl | 0
+ var hl = this._hl | 0
+
+ var i = 0, j = 0
+ var Wi, Wil
+ function calcW () {
+ var x = W[j - 15 * 2]
+ var xl = W[j - 15 * 2 + 1]
+ var gamma0 = S(x, xl, 1) ^ S(x, xl, 8) ^ (x >>> 7)
+ var gamma0l = S(xl, x, 1) ^ S(xl, x, 8) ^ S(xl, x, 7)
+
+ x = W[j - 2 * 2]
+ xl = W[j - 2 * 2 + 1]
+ var gamma1 = S(x, xl, 19) ^ S(xl, x, 29) ^ (x >>> 6)
+ var gamma1l = S(xl, x, 19) ^ S(x, xl, 29) ^ S(xl, x, 6)
+
+ // W[i] = gamma0 + W[i - 7] + gamma1 + W[i - 16]
+ var Wi7 = W[j - 7 * 2]
+ var Wi7l = W[j - 7 * 2 + 1]
+
+ var Wi16 = W[j - 16 * 2]
+ var Wi16l = W[j - 16 * 2 + 1]
-}).call(this,_dereq_("buffer").Buffer)
-},{"./bufferutils":71,"./crypto":73,"./opcodes":82,"assert":4,"buffer":8}],84:[function(_dereq_,module,exports){
-(function (Buffer){
-var assert = _dereq_('assert')
-var opcodes = _dereq_('./opcodes')
+ Wil = gamma0l + Wi7l
+ Wi = gamma0 + Wi7 + ((Wil >>> 0) < (gamma0l >>> 0) ? 1 : 0)
+ Wil = Wil + gamma1l
+ Wi = Wi + gamma1 + ((Wil >>> 0) < (gamma1l >>> 0) ? 1 : 0)
+ Wil = Wil + Wi16l
+ Wi = Wi + Wi16 + ((Wil >>> 0) < (Wi16l >>> 0) ? 1 : 0)
+ }
+
+ function loop () {
+ W[j] = Wi
+ W[j + 1] = Wil
-// FIXME: use ECPubKey, currently the circular dependency breaks everything.
-//
-// Solutions:
-// * Remove ECPubKey.getAddress
-// - Minimal change, but likely unpopular
-// * Move all script related functionality out of Address
-// - Means a lot of changes to Transaction/Wallet
-// * Ignore it (existing solution)
-// * Some form of hackery with commonjs
-//
-var ecurve = _dereq_('ecurve')
-var curve = ecurve.getCurveByName('secp256k1')
+ var maj = Maj(a, b, c)
+ var majl = Maj(al, bl, cl)
-var ECSignature = _dereq_('./ecsignature')
-var Script = _dereq_('./script')
+ var sigma0h = S(a, al, 28) ^ S(al, a, 2) ^ S(al, a, 7)
+ var sigma0l = S(al, a, 28) ^ S(a, al, 2) ^ S(a, al, 7)
+ var sigma1h = S(e, el, 14) ^ S(e, el, 18) ^ S(el, e, 9)
+ var sigma1l = S(el, e, 14) ^ S(el, e, 18) ^ S(e, el, 9)
-function classifyOutput(script) {
- assert(script instanceof Script, 'Expected Script, got ', script)
+ // t1 = h + sigma1 + ch + K[i] + W[i]
+ var Ki = K[j]
+ var Kil = K[j + 1]
- if (isPubKeyHashOutput.call(script)) {
- return 'pubkeyhash'
- } else if (isScriptHashOutput.call(script)) {
- return 'scripthash'
- } else if (isMultisigOutput.call(script)) {
- return 'multisig'
- } else if (isPubKeyOutput.call(script)) {
- return 'pubkey'
- } else if (isNulldataOutput.call(script)) {
- return 'nulldata'
- } else {
- return 'nonstandard'
- }
-}
+ var ch = Ch(e, f, g)
+ var chl = Ch(el, fl, gl)
-function classifyInput(script) {
- assert(script instanceof Script, 'Expected Script, got ', script)
+ var t1l = hl + sigma1l
+ var t1 = h + sigma1h + ((t1l >>> 0) < (hl >>> 0) ? 1 : 0)
+ t1l = t1l + chl
+ t1 = t1 + ch + ((t1l >>> 0) < (chl >>> 0) ? 1 : 0)
+ t1l = t1l + Kil
+ t1 = t1 + Ki + ((t1l >>> 0) < (Kil >>> 0) ? 1 : 0)
+ t1l = t1l + Wil
+ t1 = t1 + Wi + ((t1l >>> 0) < (Wil >>> 0) ? 1 : 0)
- if (isPubKeyHashInput.call(script)) {
- return 'pubkeyhash'
- } else if (isScriptHashInput.call(script)) {
- return 'scripthash'
- } else if (isMultisigInput.call(script)) {
- return 'multisig'
- } else if (isPubKeyInput.call(script)) {
- return 'pubkey'
- } else {
- return 'nonstandard'
- }
-}
+ // t2 = sigma0 + maj
+ var t2l = sigma0l + majl
+ var t2 = sigma0h + maj + ((t2l >>> 0) < (sigma0l >>> 0) ? 1 : 0)
-function isCanonicalPubKey(buffer) {
- if (!Buffer.isBuffer(buffer)) return false
+ h = g
+ hl = gl
+ g = f
+ gl = fl
+ f = e
+ fl = el
+ el = (dl + t1l) | 0
+ e = (d + t1 + ((el >>> 0) < (dl >>> 0) ? 1 : 0)) | 0
+ d = c
+ dl = cl
+ c = b
+ cl = bl
+ b = a
+ bl = al
+ al = (t1l + t2l) | 0
+ a = (t1 + t2 + ((al >>> 0) < (t1l >>> 0) ? 1 : 0)) | 0
+
+ i++
+ j += 2
+ }
+
+ while (i < 16) {
+ Wi = M.readInt32BE(j * 4)
+ Wil = M.readInt32BE(j * 4 + 4)
+
+ loop()
+ }
+
+ while (i < 80) {
+ calcW()
+ loop()
+ }
+
+ this._al = (this._al + al) | 0
+ this._bl = (this._bl + bl) | 0
+ this._cl = (this._cl + cl) | 0
+ this._dl = (this._dl + dl) | 0
+ this._el = (this._el + el) | 0
+ this._fl = (this._fl + fl) | 0
+ this._gl = (this._gl + gl) | 0
+ this._hl = (this._hl + hl) | 0
+
+ this._a = (this._a + a + ((this._al >>> 0) < (al >>> 0) ? 1 : 0)) | 0
+ this._b = (this._b + b + ((this._bl >>> 0) < (bl >>> 0) ? 1 : 0)) | 0
+ this._c = (this._c + c + ((this._cl >>> 0) < (cl >>> 0) ? 1 : 0)) | 0
+ this._d = (this._d + d + ((this._dl >>> 0) < (dl >>> 0) ? 1 : 0)) | 0
+ this._e = (this._e + e + ((this._el >>> 0) < (el >>> 0) ? 1 : 0)) | 0
+ this._f = (this._f + f + ((this._fl >>> 0) < (fl >>> 0) ? 1 : 0)) | 0
+ this._g = (this._g + g + ((this._gl >>> 0) < (gl >>> 0) ? 1 : 0)) | 0
+ this._h = (this._h + h + ((this._hl >>> 0) < (hl >>> 0) ? 1 : 0)) | 0
+}
+
+Sha512.prototype._hash = function () {
+ var H = new Buffer(64)
+
+ function writeInt64BE (h, l, offset) {
+ H.writeInt32BE(h, offset)
+ H.writeInt32BE(l, offset + 4)
+ }
+
+ writeInt64BE(this._a, this._al, 0)
+ writeInt64BE(this._b, this._bl, 8)
+ writeInt64BE(this._c, this._cl, 16)
+ writeInt64BE(this._d, this._dl, 24)
+ writeInt64BE(this._e, this._el, 32)
+ writeInt64BE(this._f, this._fl, 40)
+ writeInt64BE(this._g, this._gl, 48)
+ writeInt64BE(this._h, this._hl, 56)
+
+ return H
+}
+
+module.exports = Sha512
+
+}).call(this,require("buffer").Buffer)
+},{"./hash":37,"buffer":7,"inherits":35}],45:[function(require,module,exports){
+(function (Buffer){
+'use strict';
+var createHash = require('create-hash/browser');
+var inherits = require('inherits')
- try {
- // FIXME: boo
- ecurve.Point.decodeFrom(curve, buffer)
- } catch (e) {
- if (!(e.message.match(/Invalid sequence (length|tag)/))) throw e
+var Transform = require('stream').Transform
- return false
+var ZEROS = new Buffer(128)
+ZEROS.fill(0)
+
+function Hmac(alg, key) {
+ Transform.call(this)
+
+ if (typeof key === 'string') {
+ key = new Buffer(key)
}
- return true
-}
+ var blocksize = (alg === 'sha512' || alg === 'sha384') ? 128 : 64
-function isCanonicalSignature(buffer) {
- if (!Buffer.isBuffer(buffer)) return false
+ this._alg = alg
+ this._key = key
- try {
- ECSignature.parseScriptSignature(buffer)
- } catch(e) {
- if (!(e.message.match(/Not a DER sequence|Invalid sequence length|Expected a DER integer|R length is zero|S length is zero|R value excessively padded|S value excessively padded|R value is negative|S value is negative|Invalid hashType/))) throw e
+ if (key.length > blocksize) {
+ key = createHash(alg).update(key).digest()
- return false
+ } else if (key.length < blocksize) {
+ key = Buffer.concat([key, ZEROS], blocksize)
}
- return true
-}
+ var ipad = this._ipad = new Buffer(blocksize)
+ var opad = this._opad = new Buffer(blocksize)
-function isPubKeyHashInput() {
- return this.chunks.length === 2 &&
- isCanonicalSignature(this.chunks[0]) &&
- isCanonicalPubKey(this.chunks[1])
-}
+ for (var i = 0; i < blocksize; i++) {
+ ipad[i] = key[i] ^ 0x36
+ opad[i] = key[i] ^ 0x5C
+ }
-function isPubKeyHashOutput() {
- return this.chunks.length === 5 &&
- this.chunks[0] === opcodes.OP_DUP &&
- this.chunks[1] === opcodes.OP_HASH160 &&
- Buffer.isBuffer(this.chunks[2]) &&
- this.chunks[2].length === 20 &&
- this.chunks[3] === opcodes.OP_EQUALVERIFY &&
- this.chunks[4] === opcodes.OP_CHECKSIG
+ this._hash = createHash(alg).update(ipad)
}
-function isPubKeyInput() {
- return this.chunks.length === 1 &&
- isCanonicalSignature(this.chunks[0])
-}
+inherits(Hmac, Transform)
+
+Hmac.prototype.update = function (data, enc) {
+ this._hash.update(data, enc)
-function isPubKeyOutput() {
- return this.chunks.length === 2 &&
- isCanonicalPubKey(this.chunks[0]) &&
- this.chunks[1] === opcodes.OP_CHECKSIG
+ return this
}
-function isScriptHashInput() {
- if (this.chunks.length < 2) return false
- var lastChunk = this.chunks[this.chunks.length - 1]
+Hmac.prototype._transform = function (data, _, next) {
+ this._hash.update(data)
- if (!Buffer.isBuffer(lastChunk)) return false
+ next()
+}
- var scriptSig = Script.fromChunks(this.chunks.slice(0, -1))
- var scriptPubKey = Script.fromBuffer(lastChunk)
+Hmac.prototype._flush = function (next) {
+ this.push(this.digest())
- return classifyInput(scriptSig) === classifyOutput(scriptPubKey)
+ next()
}
-function isScriptHashOutput() {
- return this.chunks.length === 3 &&
- this.chunks[0] === opcodes.OP_HASH160 &&
- Buffer.isBuffer(this.chunks[1]) &&
- this.chunks[1].length === 20 &&
- this.chunks[2] === opcodes.OP_EQUAL
-}
+Hmac.prototype.digest = function (enc) {
+ var h = this._hash.digest()
-function isMultisigInput() {
- return this.chunks[0] === opcodes.OP_0 &&
- this.chunks.slice(1).every(isCanonicalSignature)
+ return createHash(this._alg).update(this._opad).update(h).digest(enc)
}
-function isMultisigOutput() {
- if (this.chunks < 4) return false
- if (this.chunks[this.chunks.length - 1] !== opcodes.OP_CHECKMULTISIG) return false
-
- var mOp = this.chunks[0]
- if (mOp === opcodes.OP_0) return false
- if (mOp < opcodes.OP_1) return false
- if (mOp > opcodes.OP_16) return false
+module.exports = function createHmac(alg, key) {
+ return new Hmac(alg, key)
+}
- var nOp = this.chunks[this.chunks.length - 2]
- if (nOp === opcodes.OP_0) return false
- if (nOp < opcodes.OP_1) return false
- if (nOp > opcodes.OP_16) return false
+}).call(this,require("buffer").Buffer)
+},{"buffer":7,"create-hash/browser":32,"inherits":46,"stream":26}],46:[function(require,module,exports){
+arguments[4][12][0].apply(exports,arguments)
+},{"dup":12}],47:[function(require,module,exports){
+var assert = require('assert')
+var BigInteger = require('bigi')
- var m = mOp - (opcodes.OP_1 - 1)
- var n = nOp - (opcodes.OP_1 - 1)
- if (n < m) return false
+var Point = require('./point')
- var pubKeys = this.chunks.slice(1, -2)
- if (n < pubKeys.length) return false
+function Curve(p, a, b, Gx, Gy, n, h) {
+ this.p = p
+ this.a = a
+ this.b = b
+ this.G = Point.fromAffine(this, Gx, Gy)
+ this.n = n
+ this.h = h
- return pubKeys.every(isCanonicalPubKey)
-}
+ this.infinity = new Point(this, null, null, BigInteger.ZERO)
-function isNulldataOutput() {
- return this.chunks[0] === opcodes.OP_RETURN
+ // result caching
+ this.pOverFour = p.add(BigInteger.ONE).shiftRight(2)
}
-// Standard Script Templates
-// {pubKey} OP_CHECKSIG
-function pubKeyOutput(pubKey) {
- return Script.fromChunks([
- pubKey.toBuffer(),
- opcodes.OP_CHECKSIG
- ])
-}
+Curve.prototype.pointFromX = function(isOdd, x) {
+ var alpha = x.pow(3).add(this.a.multiply(x)).add(this.b).mod(this.p)
+ var beta = alpha.modPow(this.pOverFour, this.p) // XXX: not compatible with all curves
-// OP_DUP OP_HASH160 {pubKeyHash} OP_EQUALVERIFY OP_CHECKSIG
-function pubKeyHashOutput(hash) {
- assert(Buffer.isBuffer(hash), 'Expected Buffer, got ' + hash)
+ var y = beta
+ if (beta.isEven() ^ !isOdd) {
+ y = this.p.subtract(y) // -y % p
+ }
- return Script.fromChunks([
- opcodes.OP_DUP,
- opcodes.OP_HASH160,
- hash,
- opcodes.OP_EQUALVERIFY,
- opcodes.OP_CHECKSIG
- ])
+ return Point.fromAffine(this, x, y)
}
-// OP_HASH160 {scriptHash} OP_EQUAL
-function scriptHashOutput(hash) {
- assert(Buffer.isBuffer(hash), 'Expected Buffer, got ' + hash)
+Curve.prototype.isInfinity = function(Q) {
+ if (Q === this.infinity) return true
- return Script.fromChunks([
- opcodes.OP_HASH160,
- hash,
- opcodes.OP_EQUAL
- ])
+ return Q.z.signum() === 0 && Q.y.signum() !== 0
}
-// m [pubKeys ...] n OP_CHECKMULTISIG
-function multisigOutput(m, pubKeys) {
- assert(Array.isArray(pubKeys), 'Expected Array, got ' + pubKeys)
- assert(pubKeys.length >= m, 'Not enough pubKeys provided')
-
- var pubKeyBuffers = pubKeys.map(function(pubKey) {
- return pubKey.toBuffer()
- })
- var n = pubKeys.length
+Curve.prototype.isOnCurve = function(Q) {
+ if (this.isInfinity(Q)) return true
- return Script.fromChunks([].concat(
- (opcodes.OP_1 - 1) + m,
- pubKeyBuffers,
- (opcodes.OP_1 - 1) + n,
- opcodes.OP_CHECKMULTISIG
- ))
-}
+ var x = Q.affineX
+ var y = Q.affineY
+ var a = this.a
+ var b = this.b
+ var p = this.p
-// {signature}
-function pubKeyInput(signature) {
- assert(Buffer.isBuffer(signature), 'Expected Buffer, got ' + signature)
+ // Check that xQ and yQ are integers in the interval [0, p - 1]
+ if (x.signum() < 0 || x.compareTo(p) >= 0) return false
+ if (y.signum() < 0 || y.compareTo(p) >= 0) return false
- return Script.fromChunks([signature])
+ // and check that y^2 = x^3 + ax + b (mod p)
+ var lhs = y.square().mod(p)
+ var rhs = x.pow(3).add(a.multiply(x)).add(b).mod(p)
+ return lhs.equals(rhs)
}
-// {signature} {pubKey}
-function pubKeyHashInput(signature, pubKey) {
- assert(Buffer.isBuffer(signature), 'Expected Buffer, got ' + signature)
+/**
+ * Validate an elliptic curve point.
+ *
+ * See SEC 1, section 3.2.2.1: Elliptic Curve Public Key Validation Primitive
+ */
+Curve.prototype.validate = function(Q) {
+ // Check Q != O
+ assert(!this.isInfinity(Q), 'Point is at infinity')
+ assert(this.isOnCurve(Q), 'Point is not on the curve')
- return Script.fromChunks([signature, pubKey.toBuffer()])
-}
+ // Check nQ = O (where Q is a scalar multiple of G)
+ var nQ = Q.multiply(this.n)
+ assert(this.isInfinity(nQ), 'Point is not a scalar multiple of G')
-// <scriptSig> {serialized scriptPubKey script}
-function scriptHashInput(scriptSig, scriptPubKey) {
- return Script.fromChunks([].concat(
- scriptSig.chunks,
- scriptPubKey.toBuffer()
- ))
+ return true
}
-// OP_0 [signatures ...]
-function multisigInput(signatures, scriptPubKey) {
- if (scriptPubKey) {
- assert(isMultisigOutput.call(scriptPubKey))
+module.exports = Curve
- var m = scriptPubKey.chunks[0]
- var k = m - (opcodes.OP_1 - 1)
- assert(k <= signatures.length, 'Not enough signatures provided')
+},{"./point":51,"assert":5,"bigi":3}],48:[function(require,module,exports){
+module.exports={
+ "secp128r1": {
+ "p": "fffffffdffffffffffffffffffffffff",
+ "a": "fffffffdfffffffffffffffffffffffc",
+ "b": "e87579c11079f43dd824993c2cee5ed3",
+ "n": "fffffffe0000000075a30d1b9038a115",
+ "h": "01",
+ "Gx": "161ff7528b899b2d0c28607ca52c5b86",
+ "Gy": "cf5ac8395bafeb13c02da292dded7a83"
+ },
+ "secp160k1": {
+ "p": "fffffffffffffffffffffffffffffffeffffac73",
+ "a": "00",
+ "b": "07",
+ "n": "0100000000000000000001b8fa16dfab9aca16b6b3",
+ "h": "01",
+ "Gx": "3b4c382ce37aa192a4019e763036f4f5dd4d7ebb",
+ "Gy": "938cf935318fdced6bc28286531733c3f03c4fee"
+ },
+ "secp160r1": {
+ "p": "ffffffffffffffffffffffffffffffff7fffffff",
+ "a": "ffffffffffffffffffffffffffffffff7ffffffc",
+ "b": "1c97befc54bd7a8b65acf89f81d4d4adc565fa45",
+ "n": "0100000000000000000001f4c8f927aed3ca752257",
+ "h": "01",
+ "Gx": "4a96b5688ef573284664698968c38bb913cbfc82",
+ "Gy": "23a628553168947d59dcc912042351377ac5fb32"
+ },
+ "secp192k1": {
+ "p": "fffffffffffffffffffffffffffffffffffffffeffffee37",
+ "a": "00",
+ "b": "03",
+ "n": "fffffffffffffffffffffffe26f2fc170f69466a74defd8d",
+ "h": "01",
+ "Gx": "db4ff10ec057e9ae26b07d0280b7f4341da5d1b1eae06c7d",
+ "Gy": "9b2f2f6d9c5628a7844163d015be86344082aa88d95e2f9d"
+ },
+ "secp192r1": {
+ "p": "fffffffffffffffffffffffffffffffeffffffffffffffff",
+ "a": "fffffffffffffffffffffffffffffffefffffffffffffffc",
+ "b": "64210519e59c80e70fa7e9ab72243049feb8deecc146b9b1",
+ "n": "ffffffffffffffffffffffff99def836146bc9b1b4d22831",
+ "h": "01",
+ "Gx": "188da80eb03090f67cbf20eb43a18800f4ff0afd82ff1012",
+ "Gy": "07192b95ffc8da78631011ed6b24cdd573f977a11e794811"
+ },
+ "secp256k1": {
+ "p": "fffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f",
+ "a": "00",
+ "b": "07",
+ "n": "fffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141",
+ "h": "01",
+ "Gx": "79be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798",
+ "Gy": "483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8"
+ },
+ "secp256r1": {
+ "p": "ffffffff00000001000000000000000000000000ffffffffffffffffffffffff",
+ "a": "ffffffff00000001000000000000000000000000fffffffffffffffffffffffc",
+ "b": "5ac635d8aa3a93e7b3ebbd55769886bc651d06b0cc53b0f63bce3c3e27d2604b",
+ "n": "ffffffff00000000ffffffffffffffffbce6faada7179e84f3b9cac2fc632551",
+ "h": "01",
+ "Gx": "6b17d1f2e12c4247f8bce6e563a440f277037d812deb33a0f4a13945d898c296",
+ "Gy": "4fe342e2fe1a7f9b8ee7eb4a7c0f9e162bce33576b315ececbb6406837bf51f5"
}
-
- return Script.fromChunks([].concat(opcodes.OP_0, signatures))
}
+},{}],49:[function(require,module,exports){
+var Point = require('./point')
+var Curve = require('./curve')
+
+var getCurveByName = require('./names')
+
module.exports = {
- classifyInput: classifyInput,
- classifyOutput: classifyOutput,
- multisigInput: multisigInput,
- multisigOutput: multisigOutput,
- pubKeyHashInput: pubKeyHashInput,
- pubKeyHashOutput: pubKeyHashOutput,
- pubKeyInput: pubKeyInput,
- pubKeyOutput: pubKeyOutput,
- scriptHashInput: scriptHashInput,
- scriptHashOutput: scriptHashOutput
+ Curve: Curve,
+ Point: Point,
+ getCurveByName: getCurveByName
}
-}).call(this,_dereq_("buffer").Buffer)
-},{"./ecsignature":77,"./opcodes":82,"./script":83,"assert":4,"buffer":8,"ecurve":65}],85:[function(_dereq_,module,exports){
-(function (Buffer){
-var assert = _dereq_('assert')
-var bufferutils = _dereq_('./bufferutils')
-var crypto = _dereq_('./crypto')
-var opcodes = _dereq_('./opcodes')
-var scripts = _dereq_('./scripts')
-
-var Address = _dereq_('./address')
-var ECKey = _dereq_('./eckey')
-var ECSignature = _dereq_('./ecsignature')
-var Script = _dereq_('./script')
+},{"./curve":47,"./names":50,"./point":51}],50:[function(require,module,exports){
+var BigInteger = require('bigi')
-Transaction.DEFAULT_SEQUENCE = 0xffffffff
-Transaction.SIGHASH_ALL = 0x01
-Transaction.SIGHASH_NONE = 0x02
-Transaction.SIGHASH_SINGLE = 0x03
-Transaction.SIGHASH_ANYONECANPAY = 0x80
+var curves = require('./curves')
+var Curve = require('./curve')
-function Transaction() {
- this.version = 1
- this.locktime = 0
- this.ins = []
- this.outs = []
-}
+function getCurveByName(name) {
+ var curve = curves[name]
+ if (!curve) return null
-/**
- * Create a new txin.
- *
- * Can be called with any of:
- *
- * - A transaction and an index
- * - A transaction hash and an index
- *
- * Note that this method does not sign the created input.
- */
-Transaction.prototype.addInput = function(tx, index, sequence) {
- if (sequence == undefined) sequence = Transaction.DEFAULT_SEQUENCE
+ var p = new BigInteger(curve.p, 16)
+ var a = new BigInteger(curve.a, 16)
+ var b = new BigInteger(curve.b, 16)
+ var n = new BigInteger(curve.n, 16)
+ var h = new BigInteger(curve.h, 16)
+ var Gx = new BigInteger(curve.Gx, 16)
+ var Gy = new BigInteger(curve.Gy, 16)
- var hash
+ return new Curve(p, a, b, Gx, Gy, n, h)
+}
- if (typeof tx === 'string') {
- hash = new Buffer(tx, 'hex')
+module.exports = getCurveByName
- // TxId hex is big-endian, we need little-endian
- Array.prototype.reverse.call(hash)
+},{"./curve":47,"./curves":48,"bigi":3}],51:[function(require,module,exports){
+(function (Buffer){
+var assert = require('assert')
+var BigInteger = require('bigi')
- } else if (tx instanceof Transaction) {
- hash = tx.getHash()
+var THREE = BigInteger.valueOf(3)
- } else {
- hash = tx
- }
+function Point(curve, x, y, z) {
+ assert.notStrictEqual(z, undefined, 'Missing Z coordinate')
- assert(Buffer.isBuffer(hash), 'Expected Transaction, txId or txHash, got ' + tx)
- assert.equal(hash.length, 32, 'Expected hash length of 32, got ' + hash.length)
- assert.equal(typeof index, 'number', 'Expected number index, got ' + index)
+ this.curve = curve
+ this.x = x
+ this.y = y
+ this.z = z
+ this._zInv = null
- return (this.ins.push({
- hash: hash,
- index: index,
- script: Script.EMPTY,
- sequence: sequence
- }) - 1)
+ this.compressed = true
}
-/**
- * Create a new txout.
- *
- * Can be called with:
- *
- * - A base58 address string and a value
- * - An Address object and a value
- * - A scriptPubKey Script and a value
- */
-Transaction.prototype.addOutput = function(scriptPubKey, value) {
- // Attempt to get a valid address if it's a base58 address string
- if (typeof scriptPubKey === 'string') {
- scriptPubKey = Address.fromBase58Check(scriptPubKey)
+Object.defineProperty(Point.prototype, 'zInv', {
+ get: function() {
+ if (this._zInv === null) {
+ this._zInv = this.z.modInverse(this.curve.p)
+ }
+
+ return this._zInv
}
+})
- // Attempt to get a valid script if it's an Address object
- if (scriptPubKey instanceof Address) {
- var address = scriptPubKey
+Object.defineProperty(Point.prototype, 'affineX', {
+ get: function() {
+ return this.x.multiply(this.zInv).mod(this.curve.p)
+ }
+})
- scriptPubKey = address.toOutputScript()
+Object.defineProperty(Point.prototype, 'affineY', {
+ get: function() {
+ return this.y.multiply(this.zInv).mod(this.curve.p)
}
+})
- return (this.outs.push({
- script: scriptPubKey,
- value: value,
- }) - 1)
+Point.fromAffine = function(curve, x, y) {
+ return new Point(curve, x, y, BigInteger.ONE)
}
-Transaction.prototype.toBuffer = function () {
- var txInSize = this.ins.reduce(function(a, x) {
- return a + (40 + bufferutils.varIntSize(x.script.buffer.length) + x.script.buffer.length)
- }, 0)
-
- var txOutSize = this.outs.reduce(function(a, x) {
- return a + (8 + bufferutils.varIntSize(x.script.buffer.length) + x.script.buffer.length)
- }, 0)
-
- var buffer = new Buffer(
- 8 +
- bufferutils.varIntSize(this.ins.length) +
- bufferutils.varIntSize(this.outs.length) +
- txInSize +
- txOutSize
- )
-
- var offset = 0
- function writeSlice(slice) {
- slice.copy(buffer, offset)
- offset += slice.length
- }
- function writeUInt32(i) {
- buffer.writeUInt32LE(i, offset)
- offset += 4
- }
- function writeUInt64(i) {
- bufferutils.writeUInt64LE(buffer, i, offset)
- offset += 8
- }
- function writeVarInt(i) {
- var n = bufferutils.writeVarInt(buffer, i, offset)
- offset += n
- }
-
- writeUInt32(this.version)
- writeVarInt(this.ins.length)
-
- this.ins.forEach(function(txin) {
- writeSlice(txin.hash)
- writeUInt32(txin.index)
- writeVarInt(txin.script.buffer.length)
- writeSlice(txin.script.buffer)
- writeUInt32(txin.sequence)
- })
+Point.prototype.equals = function(other) {
+ if (other === this) return true
+ if (this.curve.isInfinity(this)) return this.curve.isInfinity(other)
+ if (this.curve.isInfinity(other)) return this.curve.isInfinity(this)
- writeVarInt(this.outs.length)
- this.outs.forEach(function(txout) {
- writeUInt64(txout.value)
- writeVarInt(txout.script.buffer.length)
- writeSlice(txout.script.buffer)
- })
+ // u = Y2 * Z1 - Y1 * Z2
+ var u = other.y.multiply(this.z).subtract(this.y.multiply(other.z)).mod(this.curve.p)
- writeUInt32(this.locktime)
+ if (u.signum() !== 0) return false
- return buffer
-}
+ // v = X2 * Z1 - X1 * Z2
+ var v = other.x.multiply(this.z).subtract(this.x.multiply(other.z)).mod(this.curve.p)
-Transaction.prototype.toHex = function() {
- return this.toBuffer().toString('hex')
+ return v.signum() === 0
}
-/**
- * Hash transaction for signing a specific input.
- *
- * Bitcoin uses a different hash for each signed transaction input. This
- * method copies the transaction, makes the necessary changes based on the
- * hashType, serializes and finally hashes the result. This hash can then be
- * used to sign the transaction input in question.
- */
-Transaction.prototype.hashForSignature = function(prevOutScript, inIndex, hashType) {
- assert(inIndex >= 0, 'Invalid vin index')
- assert(inIndex < this.ins.length, 'Invalid vin index')
- assert(prevOutScript instanceof Script, 'Invalid Script object')
+Point.prototype.negate = function() {
+ var y = this.curve.p.subtract(this.y)
- var txTmp = this.clone()
- var hashScript = prevOutScript.without(opcodes.OP_CODESEPARATOR)
+ return new Point(this.curve, this.x, y, this.z)
+}
- // Blank out other inputs' signatures
- txTmp.ins.forEach(function(txin) {
- txin.script = Script.EMPTY
- })
- txTmp.ins[inIndex].script = hashScript
+Point.prototype.add = function(b) {
+ if (this.curve.isInfinity(this)) return b
+ if (this.curve.isInfinity(b)) return this
- var hashTypeModifier = hashType & 0x1f
- if (hashTypeModifier === Transaction.SIGHASH_NONE) {
- assert(false, 'SIGHASH_NONE not yet supported')
+ var x1 = this.x
+ var y1 = this.y
+ var x2 = b.x
+ var y2 = b.y
- } else if (hashTypeModifier === Transaction.SIGHASH_SINGLE) {
- assert(false, 'SIGHASH_SINGLE not yet supported')
+ // u = Y2 * Z1 - Y1 * Z2
+ var u = y2.multiply(this.z).subtract(y1.multiply(b.z)).mod(this.curve.p)
+ // v = X2 * Z1 - X1 * Z2
+ var v = x2.multiply(this.z).subtract(x1.multiply(b.z)).mod(this.curve.p)
- }
+ if (v.signum() === 0) {
+ if (u.signum() === 0) {
+ return this.twice() // this == b, so double
+ }
- if (hashType & Transaction.SIGHASH_ANYONECANPAY) {
- assert(false, 'SIGHASH_ANYONECANPAY not yet supported')
+ return this.curve.infinity // this = -b, so infinity
}
- var hashTypeBuffer = new Buffer(4)
- hashTypeBuffer.writeInt32LE(hashType, 0)
+ var v2 = v.square()
+ var v3 = v2.multiply(v)
+ var x1v2 = x1.multiply(v2)
+ var zu2 = u.square().multiply(this.z)
- var buffer = Buffer.concat([txTmp.toBuffer(), hashTypeBuffer])
- return crypto.hash256(buffer)
-}
+ // 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.p)
+ // 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.p)
+ // z3 = v^3 * z1 * z2
+ var z3 = v3.multiply(this.z).multiply(b.z).mod(this.curve.p)
-Transaction.prototype.getHash = function () {
- return crypto.hash256(this.toBuffer())
+ return new Point(this.curve, x3, y3, z3)
}
-Transaction.prototype.getId = function () {
- var buffer = this.getHash()
+Point.prototype.twice = function() {
+ if (this.curve.isInfinity(this)) return this
+ if (this.y.signum() === 0) return this.curve.infinity
- // Big-endian is used for TxHash
- Array.prototype.reverse.call(buffer)
+ var x1 = this.x
+ var y1 = this.y
- return buffer.toString('hex')
-}
+ var y1z1 = y1.multiply(this.z)
+ var y1sqz1 = y1z1.multiply(y1).mod(this.curve.p)
+ var a = this.curve.a
-Transaction.prototype.clone = function () {
- var newTx = new Transaction()
- newTx.version = this.version
- newTx.locktime = this.locktime
+ // w = 3 * x1^2 + a * z1^2
+ var w = x1.square().multiply(THREE)
- newTx.ins = this.ins.map(function(txin) {
- return {
- hash: txin.hash,
- index: txin.index,
- script: txin.script,
- sequence: txin.sequence
- }
- })
+ if (a.signum() !== 0) {
+ w = w.add(this.z.square().multiply(a))
+ }
- newTx.outs = this.outs.map(function(txout) {
- return {
- script: txout.script,
- value: txout.value
- }
- })
+ w = w.mod(this.curve.p)
+ // 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.p)
+ // 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.pow(3)).mod(this.curve.p)
+ // z3 = 8 * (y1 * z1)^3
+ var z3 = y1z1.pow(3).shiftLeft(3).mod(this.curve.p)
- return newTx
+ return new Point(this.curve, x3, y3, z3)
}
-Transaction.fromBuffer = function(buffer) {
- var offset = 0
- function readSlice(n) {
- offset += n
- return buffer.slice(offset - n, offset)
- }
- function readUInt32() {
- var i = buffer.readUInt32LE(offset)
- offset += 4
- return i
- }
- function readUInt64() {
- var i = bufferutils.readUInt64LE(buffer, offset)
- offset += 8
- return i
- }
- function readVarInt() {
- var vi = bufferutils.readVarInt(buffer, offset)
- offset += vi.size
- return vi.number
- }
+// Simple NAF (Non-Adjacent Form) multiplication algorithm
+// TODO: modularize the multiplication algorithm
+Point.prototype.multiply = function(k) {
+ if (this.curve.isInfinity(this)) return this
+ if (k.signum() === 0) return this.curve.infinity
- var tx = new Transaction()
- tx.version = readUInt32()
+ var e = k
+ var h = e.multiply(THREE)
- var vinLen = readVarInt()
- for (var i = 0; i < vinLen; ++i) {
- var hash = readSlice(32)
- var vout = readUInt32()
- var scriptLen = readVarInt()
- var script = readSlice(scriptLen)
- var sequence = readUInt32()
-
- tx.ins.push({
- hash: hash,
- index: vout,
- script: Script.fromBuffer(script),
- sequence: sequence
- })
- }
+ var neg = this.negate()
+ var R = this
- var voutLen = readVarInt()
- for (i = 0; i < voutLen; ++i) {
- var value = readUInt64()
- var scriptLen = readVarInt()
- var script = readSlice(scriptLen)
+ for (var i = h.bitLength() - 2; i > 0; --i) {
+ R = R.twice()
- tx.outs.push({
- value: value,
- script: Script.fromBuffer(script)
- })
- }
+ var hBit = h.testBit(i)
+ var eBit = e.testBit(i)
- tx.locktime = readUInt32()
- assert.equal(offset, buffer.length, 'Transaction has unexpected data')
+ if (hBit != eBit) {
+ R = R.add(hBit ? this : neg)
+ }
+ }
- return tx
+ return R
}
-Transaction.fromHex = function(hex) {
- return Transaction.fromBuffer(new Buffer(hex, 'hex'))
-}
+// Compute this*j + x*k (simultaneous multiplication)
+Point.prototype.multiplyTwo = function(j, x, k) {
+ var i
-/**
- * Signs a pubKeyHash output at some index with the given key
- */
-Transaction.prototype.sign = function(index, privKey, hashType) {
- var prevOutScript = privKey.pub.getAddress().toOutputScript()
- var signature = this.signInput(index, prevOutScript, privKey, hashType)
+ if (j.bitLength() > k.bitLength())
+ i = j.bitLength() - 1
+ else
+ i = k.bitLength() - 1
- // FIXME: Assumed prior TX was pay-to-pubkey-hash
- var scriptSig = scripts.pubKeyHashInput(signature, privKey.pub)
- this.setInputScript(index, scriptSig)
-}
+ var R = this.curve.infinity
+ var both = this.add(x)
-Transaction.prototype.signInput = function(index, prevOutScript, privKey, hashType) {
- hashType = hashType || Transaction.SIGHASH_ALL
+ while (i >= 0) {
+ R = R.twice()
- var hash = this.hashForSignature(prevOutScript, index, hashType)
- var signature = privKey.sign(hash)
+ var jBit = j.testBit(i)
+ var kBit = k.testBit(i)
- return signature.toScriptSignature(hashType)
-}
+ if (jBit) {
+ if (kBit) {
+ R = R.add(both)
-Transaction.prototype.setInputScript = function(index, script) {
- this.ins[index].script = script
-}
+ } else {
+ R = R.add(this)
+ }
-// FIXME: could be validateInput(index, prevTxOut, pub)
-Transaction.prototype.validateInput = function(index, prevOutScript, pubKey, buffer) {
- var parsed = ECSignature.parseScriptSignature(buffer)
- var hash = this.hashForSignature(prevOutScript, index, parsed.hashType)
+ } else {
+ if (kBit) {
+ R = R.add(x)
+ }
+ }
+ --i
+ }
- return pubKey.verify(hash, parsed.signature)
+ return R
}
-module.exports = Transaction
+Point.prototype.getEncoded = function(compressed) {
+ if (compressed == undefined) compressed = this.compressed
+ if (this.curve.isInfinity(this)) return new Buffer('00', 'hex') // Infinity point encoded is simply '00'
-}).call(this,_dereq_("buffer").Buffer)
-},{"./address":69,"./bufferutils":71,"./crypto":73,"./eckey":75,"./ecsignature":77,"./opcodes":82,"./script":83,"./scripts":84,"assert":4,"buffer":8}],86:[function(_dereq_,module,exports){
-(function (Buffer){
-var assert = _dereq_('assert')
-var networks = _dereq_('./networks')
-var rng = _dereq_('secure-random')
+ var x = this.affineX
+ var y = this.affineY
-var Address = _dereq_('./address')
-var HDNode = _dereq_('./hdnode')
-var Transaction = _dereq_('./transaction')
+ var buffer
-function Wallet(seed, network) {
- network = network || networks.bitcoin
+ // Determine size of q in bytes
+ var byteLength = Math.floor((this.curve.p.bitLength() + 7) / 8)
- // Stored in a closure to make accidental serialization less likely
- var masterkey = null
- var me = this
- var accountZero = null
- var internalAccount = null
- var externalAccount = null
+ // 0x02/0x03 | X
+ if (compressed) {
+ buffer = new Buffer(1 + byteLength)
+ buffer.writeUInt8(y.isEven() ? 0x02 : 0x03, 0)
- // Addresses
- this.addresses = []
- this.changeAddresses = []
+ // 0x04 | X | Y
+ } else {
+ buffer = new Buffer(1 + byteLength + byteLength)
+ buffer.writeUInt8(0x04, 0)
- // Transaction output data
- this.outputs = {}
+ y.toBuffer(byteLength).copy(buffer, 1 + byteLength)
+ }
- // Make a new master key
- this.newMasterKey = function(seed) {
- seed = seed || new Buffer(rng(32))
- masterkey = HDNode.fromSeedBuffer(seed, network)
+ x.toBuffer(byteLength).copy(buffer, 1)
- // HD first-level child derivation method should be hardened
- // See https://bitcointalk.org/index.php?topic=405179.msg4415254#msg4415254
- accountZero = masterkey.deriveHardened(0)
- externalAccount = accountZero.derive(0)
- internalAccount = accountZero.derive(1)
+ return buffer
+}
- me.addresses = []
- me.changeAddresses = []
+Point.decodeFrom = function(curve, buffer) {
+ var type = buffer.readUInt8(0)
+ var compressed = (type !== 4)
- me.outputs = {}
- }
+ var byteLength = Math.floor((curve.p.bitLength() + 7) / 8)
+ var x = BigInteger.fromBuffer(buffer.slice(1, 1 + byteLength))
- this.newMasterKey(seed)
+ var Q
+ if (compressed) {
+ assert.equal(buffer.length, byteLength + 1, 'Invalid sequence length')
+ assert(type === 0x02 || type === 0x03, 'Invalid sequence tag')
- this.generateAddress = function() {
- var key = externalAccount.derive(this.addresses.length)
- this.addresses.push(key.getAddress().toString())
- return this.addresses[this.addresses.length - 1]
- }
+ var isOdd = (type === 0x03)
+ Q = curve.pointFromX(isOdd, x)
- this.generateChangeAddress = function() {
- var key = internalAccount.derive(this.changeAddresses.length)
- this.changeAddresses.push(key.getAddress().toString())
- return this.changeAddresses[this.changeAddresses.length - 1]
- }
+ } else {
+ assert.equal(buffer.length, 1 + byteLength + byteLength, 'Invalid sequence length')
- this.getBalance = function() {
- return this.getUnspentOutputs().reduce(function(memo, output){
- return memo + output.value
- }, 0)
+ var y = BigInteger.fromBuffer(buffer.slice(1 + byteLength))
+ Q = Point.fromAffine(curve, x, y)
}
- this.getUnspentOutputs = function() {
- var utxo = []
+ Q.compressed = compressed
+ return Q
+}
+
+Point.prototype.toString = function () {
+ if (this.curve.isInfinity(this)) return '(INFINITY)'
- for(var key in this.outputs){
- var output = this.outputs[key]
- if(!output.to) utxo.push(outputToUnspentOutput(output))
- }
+ return '(' + this.affineX.toString() + ',' + this.affineY.toString() + ')'
+}
+
+module.exports = Point
- return utxo
+}).call(this,require("buffer").Buffer)
+},{"assert":5,"bigi":3,"buffer":7}],52:[function(require,module,exports){
+(function (process,global,Buffer){
+'use strict';
+
+var crypto = global.crypto || global.msCrypto
+if(crypto && crypto.getRandomValues) {
+ module.exports = randomBytes;
+} else {
+ module.exports = oldBrowser;
+}
+function randomBytes(size, cb) {
+ var bytes = new Buffer(size); //in browserify, this is an extended Uint8Array
+ /* This will not work in older browsers.
+ * See https://developer.mozilla.org/en-US/docs/Web/API/window.crypto.getRandomValues
+ */
+
+ crypto.getRandomValues(bytes);
+ if (typeof cb === 'function') {
+ return process.nextTick(function () {
+ cb(null, bytes);
+ });
}
+ return bytes;
+}
+function oldBrowser() {
+ throw new Error(
+ 'secure random number generation not supported by this browser\n'+
+ 'use chrome, FireFox or Internet Explorer 11'
+ )
+}
- this.setUnspentOutputs = function(utxo) {
- var outputs = {}
+}).call(this,require('_process'),typeof global !== "undefined" ? global : typeof self !== "undefined" ? self : typeof window !== "undefined" ? window : {},require("buffer").Buffer)
+},{"_process":14,"buffer":7}],53:[function(require,module,exports){
+(function (Buffer){
+'use strict';
- utxo.forEach(function(uo){
- validateUnspentOutput(uo)
- var o = unspentOutputToOutput(uo)
- outputs[o.from] = o
- })
+function getFunctionName(fn) {
+ return fn.name || fn.toString().match(/function (.*?)\s*\(/)[1];
+}
- this.outputs = outputs
+function getTypeTypeName(type) {
+ if (nativeTypes.Function(type)) {
+ type = type.toJSON ? type.toJSON() : getFunctionName(type);
}
+ if (nativeTypes.Object(type)) return JSON.stringify(type);
+
+ return type;
+}
- function outputToUnspentOutput(output){
- var hashAndIndex = output.from.split(":")
+function getValueTypeName(value) {
+ if (nativeTypes.Null(value)) return '';
- return {
- hash: hashAndIndex[0],
- outputIndex: parseInt(hashAndIndex[1]),
- address: output.address,
- value: output.value,
- pending: output.pending
+ return getFunctionName(value.constructor);
+}
+
+function tfErrorString(type, value) {
+ var typeTypeName = getTypeTypeName(type);
+ var valueTypeName = getValueTypeName(value);
+
+ return 'Expected ' + typeTypeName + ', got ' + (valueTypeName && valueTypeName + ' ') + JSON.stringify(value);
+}
+
+function tfPropertyErrorString(type, name, value) {
+ return tfErrorString('property \"' + name + '\" of type ' + getTypeTypeName(type), value);
+}
+
+var nativeTypes = {
+ Array: (function (_Array) {
+ function Array(_x) {
+ return _Array.apply(this, arguments);
}
- }
- function unspentOutputToOutput(o) {
- var hash = o.hash
- var key = hash + ":" + o.outputIndex
- return {
- from: key,
- address: o.address,
- value: o.value,
- pending: o.pending
+ Array.toString = function () {
+ return _Array.toString();
+ };
+
+ return Array;
+ })(function (value) {
+ return value !== null && value !== undefined && value.constructor === Array;
+ }),
+ Boolean: function Boolean(value) {
+ return typeof value === 'boolean';
+ },
+ Buffer: (function (_Buffer) {
+ function Buffer(_x2) {
+ return _Buffer.apply(this, arguments);
}
+
+ Buffer.toString = function () {
+ return _Buffer.toString();
+ };
+
+ return Buffer;
+ })(function (value) {
+ return Buffer.isBuffer(value);
+ }),
+ Function: function Function(value) {
+ return typeof value === 'function';
+ },
+ Null: function Null(value) {
+ return value === undefined || value === null;
+ },
+ Number: function Number(value) {
+ return typeof value === 'number';
+ },
+ Object: function Object(value) {
+ return typeof value === 'object';
+ },
+ String: function String(value) {
+ return typeof value === 'string';
+ },
+ '': function _() {
+ return true;
}
+};
- function validateUnspentOutput(uo) {
- var missingField
+function tJSON(type) {
+ return type && type.toJSON ? type.toJSON() : type;
+}
- if (isNullOrUndefined(uo.hash)) {
- missingField = "hash"
- }
+function sJSON(type) {
+ var json = tJSON(type);
+ return nativeTypes.Object(json) ? JSON.stringify(json) : json;
+}
- var requiredKeys = ['outputIndex', 'address', 'value']
- requiredKeys.forEach(function (key) {
- if (isNullOrUndefined(uo[key])){
- missingField = key
+var otherTypes = {
+ arrayOf: function arrayOf(type) {
+ function arrayOf(value, strict) {
+ try {
+ return nativeTypes.Array(value) && value.every(function (x) {
+ return typeforce(type, x, strict);
+ });
+ } catch (e) {
+ return false;
}
- })
-
- if (missingField) {
- var message = [
- 'Invalid unspent output: key', missingField, 'is missing.',
- 'A valid unspent output must contain'
- ]
- message.push(requiredKeys.join(', '))
- message.push("and hash")
- throw new Error(message.join(' '))
}
- }
+ arrayOf.toJSON = function () {
+ return [tJSON(type)];
+ };
- function isNullOrUndefined(value) {
- return value == undefined
- }
+ return arrayOf;
+ },
- this.processPendingTx = function(tx){
- processTx(tx, true)
- }
+ maybe: function maybe(type) {
+ function maybe(value, strict) {
+ return nativeTypes.Null(value) || typeforce(type, value, strict);
+ }
+ maybe.toJSON = function () {
+ return '?' + sJSON(type);
+ };
- this.processConfirmedTx = function(tx){
- processTx(tx, false)
- }
+ return maybe;
+ },
- function processTx(tx, isPending) {
- var txid = tx.getId()
+ object: function object(type) {
+ function object(value, strict) {
+ typeforce(nativeTypes.Object, value, strict);
- tx.outs.forEach(function(txOut, i) {
- var address
+ var propertyName, propertyType, propertyValue;
try {
- address = Address.fromOutputScript(txOut.script, network).toString()
- } catch(e) {
- if (!(e.message.match(/has no matching Address/))) throw e
+ for (propertyName in type) {
+ propertyType = type[propertyName];
+ propertyValue = value[propertyName];
+
+ typeforce(propertyType, propertyValue, strict);
+ }
+ } catch (e) {
+ throw new TypeError(tfPropertyErrorString(propertyType, propertyName, propertyValue));
}
- if (isMyAddress(address)) {
- var output = txid + ':' + i
+ if (strict) {
+ for (propertyName in value) {
+ if (type[propertyName]) continue;
- me.outputs[output] = {
- from: output,
- value: txOut.value,
- address: address,
- pending: isPending
+ throw new TypeError('Unexpected property "' + propertyName + '"');
}
}
- })
- tx.ins.forEach(function(txIn, i) {
- // copy and convert to big-endian hex
- var txinId = new Buffer(txIn.hash)
- Array.prototype.reverse.call(txinId)
- txinId = txinId.toString('hex')
+ return true;
+ }
+ object.toJSON = function () {
+ return type;
+ };
- var output = txinId + ':' + txIn.index
+ return object;
+ },
- if (!(output in me.outputs)) return
+ oneOf: function oneOf() {
+ for (var _len = arguments.length, types = Array(_len), _key = 0; _key < _len; _key++) {
+ types[_key] = arguments[_key];
+ }
- if (isPending) {
- me.outputs[output].to = txid + ':' + i
- me.outputs[output].pending = true
- } else {
- delete me.outputs[output]
- }
- })
- }
+ function oneOf(value, strict) {
+ return types.some(function (type) {
+ try {
+ return typeforce(type, value, strict);
+ } catch (e) {
+ return false;
+ }
+ });
+ }
+ oneOf.toJSON = function () {
+ return types.map(sJSON).join('|');
+ };
- this.createTx = function(to, value, fixedFee, changeAddress) {
- assert(value > network.dustThreshold, value + ' must be above dust threshold (' + network.dustThreshold + ' Satoshis)')
+ return oneOf;
+ },
- var utxos = getCandidateOutputs(value)
- var accum = 0
- var subTotal = value
- var addresses = []
+ quacksLike: function quacksLike(type) {
+ function quacksLike(value, strict) {
+ return type === getValueTypeName(value);
+ }
+ quacksLike.toJSON = function () {
+ return type;
+ };
- var tx = new Transaction()
- tx.addOutput(to, value)
+ return quacksLike;
+ },
- for (var i = 0; i < utxos.length; ++i) {
- var utxo = utxos[i]
- addresses.push(utxo.address)
+ tuple: function tuple() {
+ for (var _len2 = arguments.length, types = Array(_len2), _key2 = 0; _key2 < _len2; _key2++) {
+ types[_key2] = arguments[_key2];
+ }
- var outpoint = utxo.from.split(':')
- tx.addInput(outpoint[0], parseInt(outpoint[1]))
+ function tuple(value, strict) {
+ return types.every(function (type, i) {
+ return typeforce(type, value[i], strict);
+ });
+ }
+ tuple.toJSON = function () {
+ return '(' + types.map(sJSON).join(', ') + ')';
+ };
- var fee = fixedFee == undefined ? estimateFeePadChangeOutput(tx) : fixedFee
+ return tuple;
+ },
- accum += utxo.value
- subTotal = value + fee
- if (accum >= subTotal) {
- var change = accum - subTotal
+ value: function value(expected) {
+ function value(actual) {
+ return actual === expected;
+ }
+ value.toJSON = function () {
+ return expected;
+ };
- if (change > network.dustThreshold) {
- tx.addOutput(changeAddress || getChangeAddress(), change)
- }
+ return value;
+ }
+};
- break
- }
- }
+function compile(type) {
+ if (nativeTypes.String(type)) {
+ if (type[0] === '?') return otherTypes.maybe(compile(type.slice(1)));
- assert(accum >= subTotal, 'Not enough funds (incl. fee): ' + accum + ' < ' + subTotal)
+ return nativeTypes[type] || otherTypes.quacksLike(type);
+ } else if (type && nativeTypes.Object(type)) {
+ if (nativeTypes.Array(type)) return otherTypes.arrayOf(compile(type[0]));
- this.signWith(tx, addresses)
- return tx
+ var compiled = {};
+
+ for (var propertyName in type) {
+ compiled[propertyName] = compile(type[propertyName]);
+ }
+
+ return otherTypes.object(compiled);
+ } else if (nativeTypes.Function(type)) {
+ return type;
}
- function getCandidateOutputs() {
- var unspent = []
+ return otherTypes.value(type);
+}
+
+function typeforce(_x3, _x4, _x5) {
+ var _again = true;
- for (var key in me.outputs) {
- var output = me.outputs[key]
- if (!output.pending) unspent.push(output)
+ _function: while (_again) {
+ var type = _x3,
+ value = _x4,
+ strict = _x5;
+ _again = false;
+
+ if (nativeTypes.Function(type)) {
+ if (type(value, strict)) return true;
+
+ throw new TypeError(tfErrorString(type, value));
}
- var sortByValueDesc = unspent.sort(function(o1, o2){
- return o2.value - o1.value
- })
+ // JIT
+ _x3 = compile(type);
+ _x4 = value;
+ _x5 = strict;
+ _again = true;
+ continue _function;
+ }
+}
+
+// assign all types to typeforce function
+var typeName;
+Object.keys(nativeTypes).forEach(function (typeName) {
+ var nativeType = nativeTypes[typeName];
+ nativeType.toJSON = function () {
+ return typeName;
+ };
+
+ typeforce[typeName] = nativeType;
+});
+
+for (typeName in otherTypes) {
+ typeforce[typeName] = otherTypes[typeName];
+}
+
+module.exports = typeforce;
+module.exports.compile = compile;
+}).call(this,require("buffer").Buffer)
+},{"buffer":7}],54:[function(require,module,exports){
+(function (Buffer){
+var assert = require('assert')
+var base58check = require('bs58check')
+var typeForce = require('typeforce')
+var networks = require('./networks')
+var scripts = require('./scripts')
+
+function findScriptTypeByVersion (version) {
+ for (var networkName in networks) {
+ var network = networks[networkName]
- return sortByValueDesc
+ if (version === network.pubKeyHash) return 'pubkeyhash'
+ if (version === network.scriptHash) return 'scripthash'
}
+}
+
+function Address (hash, version) {
+ typeForce('Buffer', hash)
+
+ assert.strictEqual(hash.length, 20, 'Invalid hash length')
+ assert.strictEqual(version & 0xff, version, 'Invalid version byte')
+
+ this.hash = hash
+ this.version = version
+}
+
+Address.fromBase58Check = function (string) {
+ var payload = base58check.decode(string)
+ var version = payload.readUInt8(0)
+ var hash = payload.slice(1)
+
+ return new Address(hash, version)
+}
+
+Address.fromOutputScript = function (script, network) {
+ network = network || networks.bitcoin
+
+ if (scripts.isPubKeyHashOutput(script)) return new Address(script.chunks[2], network.pubKeyHash)
+ if (scripts.isScriptHashOutput(script)) return new Address(script.chunks[1], network.scriptHash)
+
+ assert(false, script.toASM() + ' has no matching Address')
+}
+
+Address.prototype.toBase58Check = function () {
+ var payload = new Buffer(21)
+ payload.writeUInt8(this.version, 0)
+ this.hash.copy(payload, 1)
+
+ return base58check.encode(payload)
+}
+
+Address.prototype.toOutputScript = function () {
+ var scriptType = findScriptTypeByVersion(this.version)
+
+ if (scriptType === 'pubkeyhash') return scripts.pubKeyHashOutput(this.hash)
+ if (scriptType === 'scripthash') return scripts.scriptHashOutput(this.hash)
+
+ assert(false, this.toString() + ' has no matching Script')
+}
+
+Address.prototype.toString = Address.prototype.toBase58Check
+
+module.exports = Address
+
+}).call(this,require("buffer").Buffer)
+},{"./networks":66,"./scripts":69,"assert":5,"bs58check":31,"buffer":7,"typeforce":53}],55:[function(require,module,exports){
+var bs58check = require('bs58check')
+
+function decode () {
+ console.warn('bs58check will be removed in 2.0.0. require("bs58check") instead.')
+
+ return bs58check.decode.apply(undefined, arguments)
+}
+
+function encode () {
+ console.warn('bs58check will be removed in 2.0.0. require("bs58check") instead.')
+
+ return bs58check.encode.apply(undefined, arguments)
+}
+
+module.exports = {
+ decode: decode,
+ encode: encode
+}
+
+},{"bs58check":31}],56:[function(require,module,exports){
+(function (Buffer){
+var assert = require('assert')
+var bufferutils = require('./bufferutils')
+var crypto = require('./crypto')
+
+var Transaction = require('./transaction')
- function estimateFeePadChangeOutput(tx) {
- var tmpTx = tx.clone()
- tmpTx.addOutput(getChangeAddress(), network.dustSoftThreshold || 0)
+function Block () {
+ this.version = 1
+ this.prevHash = null
+ this.merkleRoot = null
+ this.timestamp = 0
+ this.bits = 0
+ this.nonce = 0
+}
- return network.estimateFee(tmpTx)
+Block.fromBuffer = function (buffer) {
+ assert(buffer.length >= 80, 'Buffer too small (< 80 bytes)')
+
+ var offset = 0
+ function readSlice (n) {
+ offset += n
+ return buffer.slice(offset - n, offset)
}
- function getChangeAddress() {
- if(me.changeAddresses.length === 0) me.generateChangeAddress();
- return me.changeAddresses[me.changeAddresses.length - 1]
+ function readUInt32 () {
+ var i = buffer.readUInt32LE(offset)
+ offset += 4
+ return i
}
- this.signWith = function(tx, addresses) {
- assert.equal(tx.ins.length, addresses.length, 'Number of addresses must match number of transaction inputs')
+ var block = new Block()
+ block.version = readUInt32()
+ block.prevHash = readSlice(32)
+ block.merkleRoot = readSlice(32)
+ block.timestamp = readUInt32()
+ block.bits = readUInt32()
+ block.nonce = readUInt32()
- addresses.forEach(function(address, i) {
- var key = me.getPrivateKeyForAddress(address)
+ if (buffer.length === 80) return block
- tx.sign(i, key)
- })
+ function readVarInt () {
+ var vi = bufferutils.readVarInt(buffer, offset)
+ offset += vi.size
+ return vi.number
+ }
+ // FIXME: poor performance
+ function readTransaction () {
+ var tx = Transaction.fromBuffer(buffer.slice(offset), true)
+
+ offset += tx.toBuffer().length
return tx
}
- this.getMasterKey = function() { return masterkey }
- this.getAccountZero = function() { return accountZero }
- this.getInternalAccount = function() { return internalAccount }
- this.getExternalAccount = function() { return externalAccount }
+ var nTransactions = readVarInt()
+ block.transactions = []
- this.getPrivateKey = function(index) {
- return externalAccount.derive(index).privKey
+ for (var i = 0; i < nTransactions; ++i) {
+ var tx = readTransaction()
+ block.transactions.push(tx)
}
- this.getInternalPrivateKey = function(index) {
- return internalAccount.derive(index).privKey
- }
+ return block
+}
- this.getPrivateKeyForAddress = function(address) {
- var index
- if((index = this.addresses.indexOf(address)) > -1) {
- return this.getPrivateKey(index)
- } else if((index = this.changeAddresses.indexOf(address)) > -1) {
- return this.getInternalPrivateKey(index)
- } else {
- throw new Error('Unknown address. Make sure the address is from the keychain and has been generated.')
- }
- }
+Block.fromHex = function (hex) {
+ return Block.fromBuffer(new Buffer(hex, 'hex'))
+}
- function isReceiveAddress(address){
- return me.addresses.indexOf(address) > -1
- }
+Block.prototype.getHash = function () {
+ return crypto.hash256(this.toBuffer(true))
+}
+
+Block.prototype.getId = function () {
+ return bufferutils.reverse(this.getHash()).toString('hex')
+}
+
+Block.prototype.getUTCDate = function () {
+ var date = new Date(0) // epoch
+ date.setUTCSeconds(this.timestamp)
+
+ return date
+}
- function isChangeAddress(address){
- return me.changeAddresses.indexOf(address) > -1
+Block.prototype.toBuffer = function (headersOnly) {
+ var buffer = new Buffer(80)
+
+ var offset = 0
+ function writeSlice (slice) {
+ slice.copy(buffer, offset)
+ offset += slice.length
}
- function isMyAddress(address) {
- return isReceiveAddress(address) || isChangeAddress(address)
+ function writeUInt32 (i) {
+ buffer.writeUInt32LE(i, offset)
+ offset += 4
}
+
+ writeUInt32(this.version)
+ writeSlice(this.prevHash)
+ writeSlice(this.merkleRoot)
+ writeUInt32(this.timestamp)
+ writeUInt32(this.bits)
+ writeUInt32(this.nonce)
+
+ if (headersOnly || !this.transactions) return buffer
+
+ var txLenBuffer = bufferutils.varIntBuffer(this.transactions.length)
+ var txBuffers = this.transactions.map(function (tx) {
+ return tx.toBuffer()
+ })
+
+ return Buffer.concat([buffer, txLenBuffer].concat(txBuffers))
}
-module.exports = Wallet
+Block.prototype.toHex = function (headersOnly) {
+ return this.toBuffer(headersOnly).toString('hex')
+}
-}).call(this,_dereq_("buffer").Buffer)
-},{"./address":69,"./hdnode":78,"./networks":81,"./transaction":85,"assert":4,"buffer":8,"secure-random":68}]},{},[79])
-(79)
-});
- </script>
+module.exports = Block
- <!--<script src="/js/asmcrypto.js"></script>-->
-<script>
-// INCLUDE ASMCRYPTO
-// https://rawgit.com/tresorit/asmcrypto.js/598a1098504f1b2d0e615bc51dd8404afd2d338b/asmcrypto.js
-// Provides PBKDF2 functionality
-// It's faster than CryptoJS
-// Couldn't get SJCL working as desired
-
-
-(function(exports, global) {
- "use strict";
- global["asmCrypto"] = exports;
- function string_to_bytes(str) {
- var i, len = str.length, arr = new Uint8Array(len);
- for (i = 0; i < len; i += 1) {
- arr[i] = str.charCodeAt(i);
- }
- return arr;
- }
- function hex_to_bytes(str) {
- var arr = [], len = str.length, i;
- if (len & 1) {
- str = "0" + str;
- len++;
- }
- for (i = 0; i < len; i += 2) {
- arr.push(parseInt(str.substr(i, 2), 16));
- }
- return new Uint8Array(arr);
- }
- function base64_to_bytes(str) {
- return string_to_bytes(atob(str));
- }
- function bytes_to_string(arr) {
- var str = "";
- for (var i = 0; i < arr.length; i++) str += String.fromCharCode(arr[i]);
- return str;
- }
- function bytes_to_hex(arr) {
- var sz = (arr.byteLength || arr.length) / arr.length, str = "";
- for (var i = 0; i < arr.length; i++) {
- var h = arr[i].toString(16);
- if (h.length < 2 * sz) str += "00000000000000".substr(0, 2 * sz - h.length);
- str += h;
- }
- return str;
- }
- function bytes_to_base64(arr) {
- return btoa(bytes_to_string(arr));
- }
- function pow2_ceil(a) {
- a -= 1;
- a |= a >>> 1;
- a |= a >>> 2;
- a |= a >>> 4;
- a |= a >>> 8;
- a |= a >>> 16;
- a += 1;
- return a;
- }
- function is_number(a) {
- return typeof a === "number";
- }
- function is_string(a) {
- return typeof a === "string";
- }
- function is_buffer(a) {
- return a instanceof ArrayBuffer;
- }
- function is_bytes(a) {
- return a instanceof Uint8Array;
- }
- function is_typed_array(a) {
- return a instanceof Int8Array || a instanceof Uint8Array || a instanceof Int16Array || a instanceof Uint16Array || a instanceof Int32Array || a instanceof Uint32Array || a instanceof Float32Array || a instanceof Float64Array;
- }
- function IllegalStateError() {
- Error.apply(this, arguments);
- }
- IllegalStateError.prototype = new Error();
- function IllegalArgumentError() {
- Error.apply(this, arguments);
- }
- IllegalArgumentError.prototype = new Error();
- function SecurityError() {
- Error.apply(this, arguments);
- }
- IllegalArgumentError.prototype = new Error();
- var _aes_tables = [ 99, 124, 119, 123, 242, 107, 111, 197, 48, 1, 103, 43, 254, 215, 171, 118, 202, 130, 201, 125, 250, 89, 71, 240, 173, 212, 162, 175, 156, 164, 114, 192, 183, 253, 147, 38, 54, 63, 247, 204, 52, 165, 229, 241, 113, 216, 49, 21, 4, 199, 35, 195, 24, 150, 5, 154, 7, 18, 128, 226, 235, 39, 178, 117, 9, 131, 44, 26, 27, 110, 90, 160, 82, 59, 214, 179, 41, 227, 47, 132, 83, 209, 0, 237, 32, 252, 177, 91, 106, 203, 190, 57, 74, 76, 88, 207, 208, 239, 170, 251, 67, 77, 51, 133, 69, 249, 2, 127, 80, 60, 159, 168, 81, 163, 64, 143, 146, 157, 56, 245, 188, 182, 218, 33, 16, 255, 243, 210, 205, 12, 19, 236, 95, 151, 68, 23, 196, 167, 126, 61, 100, 93, 25, 115, 96, 129, 79, 220, 34, 42, 144, 136, 70, 238, 184, 20, 222, 94, 11, 219, 224, 50, 58, 10, 73, 6, 36, 92, 194, 211, 172, 98, 145, 149, 228, 121, 231, 200, 55, 109, 141, 213, 78, 169, 108, 86, 244, 234, 101, 122, 174, 8, 186, 120, 37, 46, 28, 166, 180, 198, 232, 221, 116, 31, 75, 189, 139, 138, 112, 62, 181, 102, 72, 3, 246, 14, 97, 53, 87, 185, 134, 193, 29, 158, 225, 248, 152, 17, 105, 217, 142, 148, 155, 30, 135, 233, 206, 85, 40, 223, 140, 161, 137, 13, 191, 230, 66, 104, 65, 153, 45, 15, 176, 84, 187, 22, 82, 9, 106, 213, 48, 54, 165, 56, 191, 64, 163, 158, 129, 243, 215, 251, 124, 227, 57, 130, 155, 47, 255, 135, 52, 142, 67, 68, 196, 222, 233, 203, 84, 123, 148, 50, 166, 194, 35, 61, 238, 76, 149, 11, 66, 250, 195, 78, 8, 46, 161, 102, 40, 217, 36, 178, 118, 91, 162, 73, 109, 139, 209, 37, 114, 248, 246, 100, 134, 104, 152, 22, 212, 164, 92, 204, 93, 101, 182, 146, 108, 112, 72, 80, 253, 237, 185, 218, 94, 21, 70, 87, 167, 141, 157, 132, 144, 216, 171, 0, 140, 188, 211, 10, 247, 228, 88, 5, 184, 179, 69, 6, 208, 44, 30, 143, 202, 63, 15, 2, 193, 175, 189, 3, 1, 19, 138, 107, 58, 145, 17, 65, 79, 103, 220, 234, 151, 242, 207, 206, 240, 180, 230, 115, 150, 172, 116, 34, 231, 173, 53, 133, 226, 249, 55, 232, 28, 117, 223, 110, 71, 241, 26, 113, 29, 41, 197, 137, 111, 183, 98, 14, 170, 24, 190, 27, 252, 86, 62, 75, 198, 210, 121, 32, 154, 219, 192, 254, 120, 205, 90, 244, 31, 221, 168, 51, 136, 7, 199, 49, 177, 18, 16, 89, 39, 128, 236, 95, 96, 81, 127, 169, 25, 181, 74, 13, 45, 229, 122, 159, 147, 201, 156, 239, 160, 224, 59, 77, 174, 42, 245, 176, 200, 235, 187, 60, 131, 83, 153, 97, 23, 43, 4, 126, 186, 119, 214, 38, 225, 105, 20, 99, 85, 33, 12, 125, 198, 248, 238, 246, 255, 214, 222, 145, 96, 2, 206, 86, 231, 181, 77, 236, 143, 31, 137, 250, 239, 178, 142, 251, 65, 179, 95, 69, 35, 83, 228, 155, 117, 225, 61, 76, 108, 126, 245, 131, 104, 81, 209, 249, 226, 171, 98, 42, 8, 149, 70, 157, 48, 55, 10, 47, 14, 36, 27, 223, 205, 78, 127, 234, 18, 29, 88, 52, 54, 220, 180, 91, 164, 118, 183, 125, 82, 221, 94, 19, 166, 185, 0, 193, 64, 227, 121, 182, 212, 141, 103, 114, 148, 152, 176, 133, 187, 197, 79, 237, 134, 154, 102, 17, 138, 233, 4, 254, 160, 120, 37, 75, 162, 93, 128, 5, 63, 33, 112, 241, 99, 119, 175, 66, 32, 229, 253, 191, 129, 24, 38, 195, 190, 53, 136, 46, 147, 85, 252, 122, 200, 186, 50, 230, 192, 25, 158, 163, 68, 84, 59, 11, 140, 199, 107, 40, 167, 188, 22, 173, 219, 100, 116, 20, 146, 12, 72, 184, 159, 189, 67, 196, 57, 49, 211, 242, 213, 139, 110, 218, 1, 177, 156, 73, 216, 172, 243, 207, 202, 244, 71, 16, 111, 240, 74, 92, 56, 87, 115, 151, 203, 161, 232, 62, 150, 97, 13, 15, 224, 124, 113, 204, 144, 6, 247, 28, 194, 106, 174, 105, 23, 153, 58, 39, 217, 235, 43, 34, 210, 169, 7, 51, 45, 60, 21, 201, 135, 170, 80, 165, 3, 89, 9, 26, 101, 215, 132, 208, 130, 41, 90, 30, 123, 168, 109, 44, 165, 132, 153, 141, 13, 189, 177, 84, 80, 3, 169, 125, 25, 98, 230, 154, 69, 157, 64, 135, 21, 235, 201, 11, 236, 103, 253, 234, 191, 247, 150, 91, 194, 28, 174, 106, 90, 65, 2, 79, 92, 244, 52, 8, 147, 115, 83, 63, 12, 82, 101, 94, 40, 161, 15, 181, 9, 54, 155, 61, 38, 105, 205, 159, 27, 158, 116, 46, 45, 178, 238, 251, 246, 77, 97, 206, 123, 62, 113, 151, 245, 104, 0, 44, 96, 31, 200, 237, 190, 70, 217, 75, 222, 212, 232, 74, 107, 42, 229, 22, 197, 215, 85, 148, 207, 16, 6, 129, 240, 68, 186, 227, 243, 254, 192, 138, 173, 188, 72, 4, 223, 193, 117, 99, 48, 26, 14, 109, 76, 20, 53, 47, 225, 162, 204, 57, 87, 242, 130, 71, 172, 231, 43, 149, 160, 152, 209, 127, 102, 126, 171, 131, 202, 41, 211, 60, 121, 226, 29, 118, 59, 86, 78, 30, 219, 10, 108, 228, 93, 110, 239, 166, 168, 164, 55, 139, 50, 67, 89, 183, 140, 100, 210, 224, 180, 250, 7, 37, 175, 142, 233, 24, 213, 136, 111, 114, 36, 241, 199, 81, 35, 124, 156, 33, 221, 220, 134, 133, 144, 66, 196, 170, 216, 5, 1, 18, 163, 95, 249, 208, 145, 88, 39, 185, 56, 19, 179, 51, 187, 112, 137, 167, 182, 34, 146, 32, 73, 255, 120, 122, 143, 248, 128, 23, 218, 49, 198, 184, 195, 176, 119, 17, 203, 252, 214, 58, 0, 9, 18, 27, 36, 45, 54, 63, 72, 65, 90, 83, 108, 101, 126, 119, 144, 153, 130, 139, 180, 189, 166, 175, 216, 209, 202, 195, 252, 245, 238, 231, 59, 50, 41, 32, 31, 22, 13, 4, 115, 122, 97, 104, 87, 94, 69, 76, 171, 162, 185, 176, 143, 134, 157, 148, 227, 234, 241, 248, 199, 206, 213, 220, 118, 127, 100, 109, 82, 91, 64, 73, 62, 55, 44, 37, 26, 19, 8, 1, 230, 239, 244, 253, 194, 203, 208, 217, 174, 167, 188, 181, 138, 131, 152, 145, 77, 68, 95, 86, 105, 96, 123, 114, 5, 12, 23, 30, 33, 40, 51, 58, 221, 212, 207, 198, 249, 240, 235, 226, 149, 156, 135, 142, 177, 184, 163, 170, 236, 229, 254, 247, 200, 193, 218, 211, 164, 173, 182, 191, 128, 137, 146, 155, 124, 117, 110, 103, 88, 81, 74, 67, 52, 61, 38, 47, 16, 25, 2, 11, 215, 222, 197, 204, 243, 250, 225, 232, 159, 150, 141, 132, 187, 178, 169, 160, 71, 78, 85, 92, 99, 106, 113, 120, 15, 6, 29, 20, 43, 34, 57, 48, 154, 147, 136, 129, 190, 183, 172, 165, 210, 219, 192, 201, 246, 255, 228, 237, 10, 3, 24, 17, 46, 39, 60, 53, 66, 75, 80, 89, 102, 111, 116, 125, 161, 168, 179, 186, 133, 140, 151, 158, 233, 224, 251, 242, 205, 196, 223, 214, 49, 56, 35, 42, 21, 28, 7, 14, 121, 112, 107, 98, 93, 84, 79, 70, 0, 11, 22, 29, 44, 39, 58, 49, 88, 83, 78, 69, 116, 127, 98, 105, 176, 187, 166, 173, 156, 151, 138, 129, 232, 227, 254, 245, 196, 207, 210, 217, 123, 112, 109, 102, 87, 92, 65, 74, 35, 40, 53, 62, 15, 4, 25, 18, 203, 192, 221, 214, 231, 236, 241, 250, 147, 152, 133, 142, 191, 180, 169, 162, 246, 253, 224, 235, 218, 209, 204, 199, 174, 165, 184, 179, 130, 137, 148, 159, 70, 77, 80, 91, 106, 97, 124, 119, 30, 21, 8, 3, 50, 57, 36, 47, 141, 134, 155, 144, 161, 170, 183, 188, 213, 222, 195, 200, 249, 242, 239, 228, 61, 54, 43, 32, 17, 26, 7, 12, 101, 110, 115, 120, 73, 66, 95, 84, 247, 252, 225, 234, 219, 208, 205, 198, 175, 164, 185, 178, 131, 136, 149, 158, 71, 76, 81, 90, 107, 96, 125, 118, 31, 20, 9, 2, 51, 56, 37, 46, 140, 135, 154, 145, 160, 171, 182, 189, 212, 223, 194, 201, 248, 243, 238, 229, 60, 55, 42, 33, 16, 27, 6, 13, 100, 111, 114, 121, 72, 67, 94, 85, 1, 10, 23, 28, 45, 38, 59, 48, 89, 82, 79, 68, 117, 126, 99, 104, 177, 186, 167, 172, 157, 150, 139, 128, 233, 226, 255, 244, 197, 206, 211, 216, 122, 113, 108, 103, 86, 93, 64, 75, 34, 41, 52, 63, 14, 5, 24, 19, 202, 193, 220, 215, 230, 237, 240, 251, 146, 153, 132, 143, 190, 181, 168, 163, 0, 13, 26, 23, 52, 57, 46, 35, 104, 101, 114, 127, 92, 81, 70, 75, 208, 221, 202, 199, 228, 233, 254, 243, 184, 181, 162, 175, 140, 129, 150, 155, 187, 182, 161, 172, 143, 130, 149, 152, 211, 222, 201, 196, 231, 234, 253, 240, 107, 102, 113, 124, 95, 82, 69, 72, 3, 14, 25, 20, 55, 58, 45, 32, 109, 96, 119, 122, 89, 84, 67, 78, 5, 8, 31, 18, 49, 60, 43, 38, 189, 176, 167, 170, 137, 132, 147, 158, 213, 216, 207, 194, 225, 236, 251, 246, 214, 219, 204, 193, 226, 239, 248, 245, 190, 179, 164, 169, 138, 135, 144, 157, 6, 11, 28, 17, 50, 63, 40, 37, 110, 99, 116, 121, 90, 87, 64, 77, 218, 215, 192, 205, 238, 227, 244, 249, 178, 191, 168, 165, 134, 139, 156, 145, 10, 7, 16, 29, 62, 51, 36, 41, 98, 111, 120, 117, 86, 91, 76, 65, 97, 108, 123, 118, 85, 88, 79, 66, 9, 4, 19, 30, 61, 48, 39, 42, 177, 188, 171, 166, 133, 136, 159, 146, 217, 212, 195, 206, 237, 224, 247, 250, 183, 186, 173, 160, 131, 142, 153, 148, 223, 210, 197, 200, 235, 230, 241, 252, 103, 106, 125, 112, 83, 94, 73, 68, 15, 2, 21, 24, 59, 54, 33, 44, 12, 1, 22, 27, 56, 53, 34, 47, 100, 105, 126, 115, 80, 93, 74, 71, 220, 209, 198, 203, 232, 229, 242, 255, 180, 185, 174, 163, 128, 141, 154, 151, 0, 14, 28, 18, 56, 54, 36, 42, 112, 126, 108, 98, 72, 70, 84, 90, 224, 238, 252, 242, 216, 214, 196, 202, 144, 158, 140, 130, 168, 166, 180, 186, 219, 213, 199, 201, 227, 237, 255, 241, 171, 165, 183, 185, 147, 157, 143, 129, 59, 53, 39, 41, 3, 13, 31, 17, 75, 69, 87, 89, 115, 125, 111, 97, 173, 163, 177, 191, 149, 155, 137, 135, 221, 211, 193, 207, 229, 235, 249, 247, 77, 67, 81, 95, 117, 123, 105, 103, 61, 51, 33, 47, 5, 11, 25, 23, 118, 120, 106, 100, 78, 64, 82, 92, 6, 8, 26, 20, 62, 48, 34, 44, 150, 152, 138, 132, 174, 160, 178, 188, 230, 232, 250, 244, 222, 208, 194, 204, 65, 79, 93, 83, 121, 119, 101, 107, 49, 63, 45, 35, 9, 7, 21, 27, 161, 175, 189, 179, 153, 151, 133, 139, 209, 223, 205, 195, 233, 231, 245, 251, 154, 148, 134, 136, 162, 172, 190, 176, 234, 228, 246, 248, 210, 220, 206, 192, 122, 116, 102, 104, 66, 76, 94, 80, 10, 4, 22, 24, 50, 60, 46, 32, 236, 226, 240, 254, 212, 218, 200, 198, 156, 146, 128, 142, 164, 170, 184, 182, 12, 2, 16, 30, 52, 58, 40, 38, 124, 114, 96, 110, 68, 74, 88, 86, 55, 57, 43, 37, 15, 1, 19, 29, 71, 73, 91, 85, 127, 113, 99, 109, 215, 217, 203, 197, 239, 225, 243, 253, 167, 169, 187, 181, 159, 145, 131, 141 ];
- var _aes_heap_start = 2048;
- function _aes_asm(stdlib, foreign, buffer) {
- // Closure Compiler warning - commented out
- //"use asm";
- var S0 = 0, S1 = 0, S2 = 0, S3 = 0, S4 = 0, S5 = 0, S6 = 0, S7 = 0, S8 = 0, S9 = 0, SA = 0, SB = 0, SC = 0, SD = 0, SE = 0, SF = 0;
- var keySize = 0;
- var R00 = 0, R01 = 0, R02 = 0, R03 = 0, R04 = 0, R05 = 0, R06 = 0, R07 = 0, R08 = 0, R09 = 0, R0A = 0, R0B = 0, R0C = 0, R0D = 0, R0E = 0, R0F = 0, R10 = 0, R11 = 0, R12 = 0, R13 = 0, R14 = 0, R15 = 0, R16 = 0, R17 = 0, R18 = 0, R19 = 0, R1A = 0, R1B = 0, R1C = 0, R1D = 0, R1E = 0, R1F = 0, R20 = 0, R21 = 0, R22 = 0, R23 = 0, R24 = 0, R25 = 0, R26 = 0, R27 = 0, R28 = 0, R29 = 0, R2A = 0, R2B = 0, R2C = 0, R2D = 0, R2E = 0, R2F = 0, R30 = 0, R31 = 0, R32 = 0, R33 = 0, R34 = 0, R35 = 0, R36 = 0, R37 = 0, R38 = 0, R39 = 0, R3A = 0, R3B = 0, R3C = 0, R3D = 0, R3E = 0, R3F = 0, R40 = 0, R41 = 0, R42 = 0, R43 = 0, R44 = 0, R45 = 0, R46 = 0, R47 = 0, R48 = 0, R49 = 0, R4A = 0, R4B = 0, R4C = 0, R4D = 0, R4E = 0, R4F = 0, R50 = 0, R51 = 0, R52 = 0, R53 = 0, R54 = 0, R55 = 0, R56 = 0, R57 = 0, R58 = 0, R59 = 0, R5A = 0, R5B = 0, R5C = 0, R5D = 0, R5E = 0, R5F = 0, R60 = 0, R61 = 0, R62 = 0, R63 = 0, R64 = 0, R65 = 0, R66 = 0, R67 = 0, R68 = 0, R69 = 0, R6A = 0, R6B = 0, R6C = 0, R6D = 0, R6E = 0, R6F = 0, R70 = 0, R71 = 0, R72 = 0, R73 = 0, R74 = 0, R75 = 0, R76 = 0, R77 = 0, R78 = 0, R79 = 0, R7A = 0, R7B = 0, R7C = 0, R7D = 0, R7E = 0, R7F = 0, R80 = 0, R81 = 0, R82 = 0, R83 = 0, R84 = 0, R85 = 0, R86 = 0, R87 = 0, R88 = 0, R89 = 0, R8A = 0, R8B = 0, R8C = 0, R8D = 0, R8E = 0, R8F = 0, R90 = 0, R91 = 0, R92 = 0, R93 = 0, R94 = 0, R95 = 0, R96 = 0, R97 = 0, R98 = 0, R99 = 0, R9A = 0, R9B = 0, R9C = 0, R9D = 0, R9E = 0, R9F = 0, RA0 = 0, RA1 = 0, RA2 = 0, RA3 = 0, RA4 = 0, RA5 = 0, RA6 = 0, RA7 = 0, RA8 = 0, RA9 = 0, RAA = 0, RAB = 0, RAC = 0, RAD = 0, RAE = 0, RAF = 0, RB0 = 0, RB1 = 0, RB2 = 0, RB3 = 0, RB4 = 0, RB5 = 0, RB6 = 0, RB7 = 0, RB8 = 0, RB9 = 0, RBA = 0, RBB = 0, RBC = 0, RBD = 0, RBE = 0, RBF = 0, RC0 = 0, RC1 = 0, RC2 = 0, RC3 = 0, RC4 = 0, RC5 = 0, RC6 = 0, RC7 = 0, RC8 = 0, RC9 = 0, RCA = 0, RCB = 0, RCC = 0, RCD = 0, RCE = 0, RCF = 0, RD0 = 0, RD1 = 0, RD2 = 0, RD3 = 0, RD4 = 0, RD5 = 0, RD6 = 0, RD7 = 0, RD8 = 0, RD9 = 0, RDA = 0, RDB = 0, RDC = 0, RDD = 0, RDE = 0, RDF = 0, RE0 = 0, RE1 = 0, RE2 = 0, RE3 = 0, RE4 = 0, RE5 = 0, RE6 = 0, RE7 = 0, RE8 = 0, RE9 = 0, REA = 0, REB = 0, REC = 0, RED = 0, REE = 0, REF = 0;
- var HEAP = new stdlib.Uint8Array(buffer);
- function _expand_key_128() {
- var sbox = 0;
- R10 = R00 ^ HEAP[sbox | R0D] ^ 1;
- R11 = R01 ^ HEAP[sbox | R0E];
- R12 = R02 ^ HEAP[sbox | R0F];
- R13 = R03 ^ HEAP[sbox | R0C];
- R14 = R04 ^ R10;
- R15 = R05 ^ R11;
- R16 = R06 ^ R12;
- R17 = R07 ^ R13;
- R18 = R08 ^ R14;
- R19 = R09 ^ R15;
- R1A = R0A ^ R16;
- R1B = R0B ^ R17;
- R1C = R0C ^ R18;
- R1D = R0D ^ R19;
- R1E = R0E ^ R1A;
- R1F = R0F ^ R1B;
- R20 = R10 ^ HEAP[sbox | R1D] ^ 2;
- R21 = R11 ^ HEAP[sbox | R1E];
- R22 = R12 ^ HEAP[sbox | R1F];
- R23 = R13 ^ HEAP[sbox | R1C];
- R24 = R14 ^ R20;
- R25 = R15 ^ R21;
- R26 = R16 ^ R22;
- R27 = R17 ^ R23;
- R28 = R18 ^ R24;
- R29 = R19 ^ R25;
- R2A = R1A ^ R26;
- R2B = R1B ^ R27;
- R2C = R1C ^ R28;
- R2D = R1D ^ R29;
- R2E = R1E ^ R2A;
- R2F = R1F ^ R2B;
- R30 = R20 ^ HEAP[sbox | R2D] ^ 4;
- R31 = R21 ^ HEAP[sbox | R2E];
- R32 = R22 ^ HEAP[sbox | R2F];
- R33 = R23 ^ HEAP[sbox | R2C];
- R34 = R24 ^ R30;
- R35 = R25 ^ R31;
- R36 = R26 ^ R32;
- R37 = R27 ^ R33;
- R38 = R28 ^ R34;
- R39 = R29 ^ R35;
- R3A = R2A ^ R36;
- R3B = R2B ^ R37;
- R3C = R2C ^ R38;
- R3D = R2D ^ R39;
- R3E = R2E ^ R3A;
- R3F = R2F ^ R3B;
- R40 = R30 ^ HEAP[sbox | R3D] ^ 8;
- R41 = R31 ^ HEAP[sbox | R3E];
- R42 = R32 ^ HEAP[sbox | R3F];
- R43 = R33 ^ HEAP[sbox | R3C];
- R44 = R34 ^ R40;
- R45 = R35 ^ R41;
- R46 = R36 ^ R42;
- R47 = R37 ^ R43;
- R48 = R38 ^ R44;
- R49 = R39 ^ R45;
- R4A = R3A ^ R46;
- R4B = R3B ^ R47;
- R4C = R3C ^ R48;
- R4D = R3D ^ R49;
- R4E = R3E ^ R4A;
- R4F = R3F ^ R4B;
- R50 = R40 ^ HEAP[sbox | R4D] ^ 16;
- R51 = R41 ^ HEAP[sbox | R4E];
- R52 = R42 ^ HEAP[sbox | R4F];
- R53 = R43 ^ HEAP[sbox | R4C];
- R54 = R44 ^ R50;
- R55 = R45 ^ R51;
- R56 = R46 ^ R52;
- R57 = R47 ^ R53;
- R58 = R48 ^ R54;
- R59 = R49 ^ R55;
- R5A = R4A ^ R56;
- R5B = R4B ^ R57;
- R5C = R4C ^ R58;
- R5D = R4D ^ R59;
- R5E = R4E ^ R5A;
- R5F = R4F ^ R5B;
- R60 = R50 ^ HEAP[sbox | R5D] ^ 32;
- R61 = R51 ^ HEAP[sbox | R5E];
- R62 = R52 ^ HEAP[sbox | R5F];
- R63 = R53 ^ HEAP[sbox | R5C];
- R64 = R54 ^ R60;
- R65 = R55 ^ R61;
- R66 = R56 ^ R62;
- R67 = R57 ^ R63;
- R68 = R58 ^ R64;
- R69 = R59 ^ R65;
- R6A = R5A ^ R66;
- R6B = R5B ^ R67;
- R6C = R5C ^ R68;
- R6D = R5D ^ R69;
- R6E = R5E ^ R6A;
- R6F = R5F ^ R6B;
- R70 = R60 ^ HEAP[sbox | R6D] ^ 64;
- R71 = R61 ^ HEAP[sbox | R6E];
- R72 = R62 ^ HEAP[sbox | R6F];
- R73 = R63 ^ HEAP[sbox | R6C];
- R74 = R64 ^ R70;
- R75 = R65 ^ R71;
- R76 = R66 ^ R72;
- R77 = R67 ^ R73;
- R78 = R68 ^ R74;
- R79 = R69 ^ R75;
- R7A = R6A ^ R76;
- R7B = R6B ^ R77;
- R7C = R6C ^ R78;
- R7D = R6D ^ R79;
- R7E = R6E ^ R7A;
- R7F = R6F ^ R7B;
- R80 = R70 ^ HEAP[sbox | R7D] ^ 128;
- R81 = R71 ^ HEAP[sbox | R7E];
- R82 = R72 ^ HEAP[sbox | R7F];
- R83 = R73 ^ HEAP[sbox | R7C];
- R84 = R74 ^ R80;
- R85 = R75 ^ R81;
- R86 = R76 ^ R82;
- R87 = R77 ^ R83;
- R88 = R78 ^ R84;
- R89 = R79 ^ R85;
- R8A = R7A ^ R86;
- R8B = R7B ^ R87;
- R8C = R7C ^ R88;
- R8D = R7D ^ R89;
- R8E = R7E ^ R8A;
- R8F = R7F ^ R8B;
- R90 = R80 ^ HEAP[sbox | R8D] ^ 27;
- R91 = R81 ^ HEAP[sbox | R8E];
- R92 = R82 ^ HEAP[sbox | R8F];
- R93 = R83 ^ HEAP[sbox | R8C];
- R94 = R84 ^ R90;
- R95 = R85 ^ R91;
- R96 = R86 ^ R92;
- R97 = R87 ^ R93;
- R98 = R88 ^ R94;
- R99 = R89 ^ R95;
- R9A = R8A ^ R96;
- R9B = R8B ^ R97;
- R9C = R8C ^ R98;
- R9D = R8D ^ R99;
- R9E = R8E ^ R9A;
- R9F = R8F ^ R9B;
- RA0 = R90 ^ HEAP[sbox | R9D] ^ 54;
- RA1 = R91 ^ HEAP[sbox | R9E];
- RA2 = R92 ^ HEAP[sbox | R9F];
- RA3 = R93 ^ HEAP[sbox | R9C];
- RA4 = R94 ^ RA0;
- RA5 = R95 ^ RA1;
- RA6 = R96 ^ RA2;
- RA7 = R97 ^ RA3;
- RA8 = R98 ^ RA4;
- RA9 = R99 ^ RA5;
- RAA = R9A ^ RA6;
- RAB = R9B ^ RA7;
- RAC = R9C ^ RA8;
- RAD = R9D ^ RA9;
- RAE = R9E ^ RAA;
- RAF = R9F ^ RAB;
- }
- function _expand_key_256() {
- var sbox = 0;
- R20 = R00 ^ HEAP[sbox | R1D] ^ 1;
- R21 = R01 ^ HEAP[sbox | R1E];
- R22 = R02 ^ HEAP[sbox | R1F];
- R23 = R03 ^ HEAP[sbox | R1C];
- R24 = R04 ^ R20;
- R25 = R05 ^ R21;
- R26 = R06 ^ R22;
- R27 = R07 ^ R23;
- R28 = R08 ^ R24;
- R29 = R09 ^ R25;
- R2A = R0A ^ R26;
- R2B = R0B ^ R27;
- R2C = R0C ^ R28;
- R2D = R0D ^ R29;
- R2E = R0E ^ R2A;
- R2F = R0F ^ R2B;
- R30 = R10 ^ HEAP[sbox | R2C];
- R31 = R11 ^ HEAP[sbox | R2D];
- R32 = R12 ^ HEAP[sbox | R2E];
- R33 = R13 ^ HEAP[sbox | R2F];
- R34 = R14 ^ R30;
- R35 = R15 ^ R31;
- R36 = R16 ^ R32;
- R37 = R17 ^ R33;
- R38 = R18 ^ R34;
- R39 = R19 ^ R35;
- R3A = R1A ^ R36;
- R3B = R1B ^ R37;
- R3C = R1C ^ R38;
- R3D = R1D ^ R39;
- R3E = R1E ^ R3A;
- R3F = R1F ^ R3B;
- R40 = R20 ^ HEAP[sbox | R3D] ^ 2;
- R41 = R21 ^ HEAP[sbox | R3E];
- R42 = R22 ^ HEAP[sbox | R3F];
- R43 = R23 ^ HEAP[sbox | R3C];
- R44 = R24 ^ R40;
- R45 = R25 ^ R41;
- R46 = R26 ^ R42;
- R47 = R27 ^ R43;
- R48 = R28 ^ R44;
- R49 = R29 ^ R45;
- R4A = R2A ^ R46;
- R4B = R2B ^ R47;
- R4C = R2C ^ R48;
- R4D = R2D ^ R49;
- R4E = R2E ^ R4A;
- R4F = R2F ^ R4B;
- R50 = R30 ^ HEAP[sbox | R4C];
- R51 = R31 ^ HEAP[sbox | R4D];
- R52 = R32 ^ HEAP[sbox | R4E];
- R53 = R33 ^ HEAP[sbox | R4F];
- R54 = R34 ^ R50;
- R55 = R35 ^ R51;
- R56 = R36 ^ R52;
- R57 = R37 ^ R53;
- R58 = R38 ^ R54;
- R59 = R39 ^ R55;
- R5A = R3A ^ R56;
- R5B = R3B ^ R57;
- R5C = R3C ^ R58;
- R5D = R3D ^ R59;
- R5E = R3E ^ R5A;
- R5F = R3F ^ R5B;
- R60 = R40 ^ HEAP[sbox | R5D] ^ 4;
- R61 = R41 ^ HEAP[sbox | R5E];
- R62 = R42 ^ HEAP[sbox | R5F];
- R63 = R43 ^ HEAP[sbox | R5C];
- R64 = R44 ^ R60;
- R65 = R45 ^ R61;
- R66 = R46 ^ R62;
- R67 = R47 ^ R63;
- R68 = R48 ^ R64;
- R69 = R49 ^ R65;
- R6A = R4A ^ R66;
- R6B = R4B ^ R67;
- R6C = R4C ^ R68;
- R6D = R4D ^ R69;
- R6E = R4E ^ R6A;
- R6F = R4F ^ R6B;
- R70 = R50 ^ HEAP[sbox | R6C];
- R71 = R51 ^ HEAP[sbox | R6D];
- R72 = R52 ^ HEAP[sbox | R6E];
- R73 = R53 ^ HEAP[sbox | R6F];
- R74 = R54 ^ R70;
- R75 = R55 ^ R71;
- R76 = R56 ^ R72;
- R77 = R57 ^ R73;
- R78 = R58 ^ R74;
- R79 = R59 ^ R75;
- R7A = R5A ^ R76;
- R7B = R5B ^ R77;
- R7C = R5C ^ R78;
- R7D = R5D ^ R79;
- R7E = R5E ^ R7A;
- R7F = R5F ^ R7B;
- R80 = R60 ^ HEAP[sbox | R7D] ^ 8;
- R81 = R61 ^ HEAP[sbox | R7E];
- R82 = R62 ^ HEAP[sbox | R7F];
- R83 = R63 ^ HEAP[sbox | R7C];
- R84 = R64 ^ R80;
- R85 = R65 ^ R81;
- R86 = R66 ^ R82;
- R87 = R67 ^ R83;
- R88 = R68 ^ R84;
- R89 = R69 ^ R85;
- R8A = R6A ^ R86;
- R8B = R6B ^ R87;
- R8C = R6C ^ R88;
- R8D = R6D ^ R89;
- R8E = R6E ^ R8A;
- R8F = R6F ^ R8B;
- R90 = R70 ^ HEAP[sbox | R8C];
- R91 = R71 ^ HEAP[sbox | R8D];
- R92 = R72 ^ HEAP[sbox | R8E];
- R93 = R73 ^ HEAP[sbox | R8F];
- R94 = R74 ^ R90;
- R95 = R75 ^ R91;
- R96 = R76 ^ R92;
- R97 = R77 ^ R93;
- R98 = R78 ^ R94;
- R99 = R79 ^ R95;
- R9A = R7A ^ R96;
- R9B = R7B ^ R97;
- R9C = R7C ^ R98;
- R9D = R7D ^ R99;
- R9E = R7E ^ R9A;
- R9F = R7F ^ R9B;
- RA0 = R80 ^ HEAP[sbox | R9D] ^ 16;
- RA1 = R81 ^ HEAP[sbox | R9E];
- RA2 = R82 ^ HEAP[sbox | R9F];
- RA3 = R83 ^ HEAP[sbox | R9C];
- RA4 = R84 ^ RA0;
- RA5 = R85 ^ RA1;
- RA6 = R86 ^ RA2;
- RA7 = R87 ^ RA3;
- RA8 = R88 ^ RA4;
- RA9 = R89 ^ RA5;
- RAA = R8A ^ RA6;
- RAB = R8B ^ RA7;
- RAC = R8C ^ RA8;
- RAD = R8D ^ RA9;
- RAE = R8E ^ RAA;
- RAF = R8F ^ RAB;
- RB0 = R90 ^ HEAP[sbox | RAC];
- RB1 = R91 ^ HEAP[sbox | RAD];
- RB2 = R92 ^ HEAP[sbox | RAE];
- RB3 = R93 ^ HEAP[sbox | RAF];
- RB4 = R94 ^ RB0;
- RB5 = R95 ^ RB1;
- RB6 = R96 ^ RB2;
- RB7 = R97 ^ RB3;
- RB8 = R98 ^ RB4;
- RB9 = R99 ^ RB5;
- RBA = R9A ^ RB6;
- RBB = R9B ^ RB7;
- RBC = R9C ^ RB8;
- RBD = R9D ^ RB9;
- RBE = R9E ^ RBA;
- RBF = R9F ^ RBB;
- RC0 = RA0 ^ HEAP[sbox | RBD] ^ 32;
- RC1 = RA1 ^ HEAP[sbox | RBE];
- RC2 = RA2 ^ HEAP[sbox | RBF];
- RC3 = RA3 ^ HEAP[sbox | RBC];
- RC4 = RA4 ^ RC0;
- RC5 = RA5 ^ RC1;
- RC6 = RA6 ^ RC2;
- RC7 = RA7 ^ RC3;
- RC8 = RA8 ^ RC4;
- RC9 = RA9 ^ RC5;
- RCA = RAA ^ RC6;
- RCB = RAB ^ RC7;
- RCC = RAC ^ RC8;
- RCD = RAD ^ RC9;
- RCE = RAE ^ RCA;
- RCF = RAF ^ RCB;
- RD0 = RB0 ^ HEAP[sbox | RCC];
- RD1 = RB1 ^ HEAP[sbox | RCD];
- RD2 = RB2 ^ HEAP[sbox | RCE];
- RD3 = RB3 ^ HEAP[sbox | RCF];
- RD4 = RB4 ^ RD0;
- RD5 = RB5 ^ RD1;
- RD6 = RB6 ^ RD2;
- RD7 = RB7 ^ RD3;
- RD8 = RB8 ^ RD4;
- RD9 = RB9 ^ RD5;
- RDA = RBA ^ RD6;
- RDB = RBB ^ RD7;
- RDC = RBC ^ RD8;
- RDD = RBD ^ RD9;
- RDE = RBE ^ RDA;
- RDF = RBF ^ RDB;
- RE0 = RC0 ^ HEAP[sbox | RDD] ^ 64;
- RE1 = RC1 ^ HEAP[sbox | RDE];
- RE2 = RC2 ^ HEAP[sbox | RDF];
- RE3 = RC3 ^ HEAP[sbox | RDC];
- RE4 = RC4 ^ RE0;
- RE5 = RC5 ^ RE1;
- RE6 = RC6 ^ RE2;
- RE7 = RC7 ^ RE3;
- RE8 = RC8 ^ RE4;
- RE9 = RC9 ^ RE5;
- REA = RCA ^ RE6;
- REB = RCB ^ RE7;
- REC = RCC ^ RE8;
- RED = RCD ^ RE9;
- REE = RCE ^ REA;
- REF = RCF ^ REB;
- }
- function _encrypt(s0, s1, s2, s3, s4, s5, s6, s7, s8, s9, sA, sB, sC, sD, sE, sF) {
- s0 = s0 | 0;
- s1 = s1 | 0;
- s2 = s2 | 0;
- s3 = s3 | 0;
- s4 = s4 | 0;
- s5 = s5 | 0;
- s6 = s6 | 0;
- s7 = s7 | 0;
- s8 = s8 | 0;
- s9 = s9 | 0;
- sA = sA | 0;
- sB = sB | 0;
- sC = sC | 0;
- sD = sD | 0;
- sE = sE | 0;
- sF = sF | 0;
- var t0 = 0, t1 = 0, t2 = 0, t3 = 0, t4 = 0, t5 = 0, t6 = 0, t7 = 0, t8 = 0, t9 = 0, tA = 0, tB = 0, tC = 0, tD = 0, tE = 0, tF = 0, sbox = 0, x2_sbox = 512, x3_sbox = 768;
- s0 = s0 ^ R00;
- s1 = s1 ^ R01;
- s2 = s2 ^ R02;
- s3 = s3 ^ R03;
- s4 = s4 ^ R04;
- s5 = s5 ^ R05;
- s6 = s6 ^ R06;
- s7 = s7 ^ R07;
- s8 = s8 ^ R08;
- s9 = s9 ^ R09;
- sA = sA ^ R0A;
- sB = sB ^ R0B;
- sC = sC ^ R0C;
- sD = sD ^ R0D;
- sE = sE ^ R0E;
- sF = sF ^ R0F;
- t0 = HEAP[x2_sbox | s0] ^ HEAP[x3_sbox | s5] ^ HEAP[sbox | sA] ^ HEAP[sbox | sF] ^ R10;
- t1 = HEAP[sbox | s0] ^ HEAP[x2_sbox | s5] ^ HEAP[x3_sbox | sA] ^ HEAP[sbox | sF] ^ R11;
- t2 = HEAP[sbox | s0] ^ HEAP[sbox | s5] ^ HEAP[x2_sbox | sA] ^ HEAP[x3_sbox | sF] ^ R12;
- t3 = HEAP[x3_sbox | s0] ^ HEAP[sbox | s5] ^ HEAP[sbox | sA] ^ HEAP[x2_sbox | sF] ^ R13;
- t4 = HEAP[x2_sbox | s4] ^ HEAP[x3_sbox | s9] ^ HEAP[sbox | sE] ^ HEAP[sbox | s3] ^ R14;
- t5 = HEAP[sbox | s4] ^ HEAP[x2_sbox | s9] ^ HEAP[x3_sbox | sE] ^ HEAP[sbox | s3] ^ R15;
- t6 = HEAP[sbox | s4] ^ HEAP[sbox | s9] ^ HEAP[x2_sbox | sE] ^ HEAP[x3_sbox | s3] ^ R16;
- t7 = HEAP[x3_sbox | s4] ^ HEAP[sbox | s9] ^ HEAP[sbox | sE] ^ HEAP[x2_sbox | s3] ^ R17;
- t8 = HEAP[x2_sbox | s8] ^ HEAP[x3_sbox | sD] ^ HEAP[sbox | s2] ^ HEAP[sbox | s7] ^ R18;
- t9 = HEAP[sbox | s8] ^ HEAP[x2_sbox | sD] ^ HEAP[x3_sbox | s2] ^ HEAP[sbox | s7] ^ R19;
- tA = HEAP[sbox | s8] ^ HEAP[sbox | sD] ^ HEAP[x2_sbox | s2] ^ HEAP[x3_sbox | s7] ^ R1A;
- tB = HEAP[x3_sbox | s8] ^ HEAP[sbox | sD] ^ HEAP[sbox | s2] ^ HEAP[x2_sbox | s7] ^ R1B;
- tC = HEAP[x2_sbox | sC] ^ HEAP[x3_sbox | s1] ^ HEAP[sbox | s6] ^ HEAP[sbox | sB] ^ R1C;
- tD = HEAP[sbox | sC] ^ HEAP[x2_sbox | s1] ^ HEAP[x3_sbox | s6] ^ HEAP[sbox | sB] ^ R1D;
- tE = HEAP[sbox | sC] ^ HEAP[sbox | s1] ^ HEAP[x2_sbox | s6] ^ HEAP[x3_sbox | sB] ^ R1E;
- tF = HEAP[x3_sbox | sC] ^ HEAP[sbox | s1] ^ HEAP[sbox | s6] ^ HEAP[x2_sbox | sB] ^ R1F;
- s0 = HEAP[x2_sbox | t0] ^ HEAP[x3_sbox | t5] ^ HEAP[sbox | tA] ^ HEAP[sbox | tF] ^ R20;
- s1 = HEAP[sbox | t0] ^ HEAP[x2_sbox | t5] ^ HEAP[x3_sbox | tA] ^ HEAP[sbox | tF] ^ R21;
- s2 = HEAP[sbox | t0] ^ HEAP[sbox | t5] ^ HEAP[x2_sbox | tA] ^ HEAP[x3_sbox | tF] ^ R22;
- s3 = HEAP[x3_sbox | t0] ^ HEAP[sbox | t5] ^ HEAP[sbox | tA] ^ HEAP[x2_sbox | tF] ^ R23;
- s4 = HEAP[x2_sbox | t4] ^ HEAP[x3_sbox | t9] ^ HEAP[sbox | tE] ^ HEAP[sbox | t3] ^ R24;
- s5 = HEAP[sbox | t4] ^ HEAP[x2_sbox | t9] ^ HEAP[x3_sbox | tE] ^ HEAP[sbox | t3] ^ R25;
- s6 = HEAP[sbox | t4] ^ HEAP[sbox | t9] ^ HEAP[x2_sbox | tE] ^ HEAP[x3_sbox | t3] ^ R26;
- s7 = HEAP[x3_sbox | t4] ^ HEAP[sbox | t9] ^ HEAP[sbox | tE] ^ HEAP[x2_sbox | t3] ^ R27;
- s8 = HEAP[x2_sbox | t8] ^ HEAP[x3_sbox | tD] ^ HEAP[sbox | t2] ^ HEAP[sbox | t7] ^ R28;
- s9 = HEAP[sbox | t8] ^ HEAP[x2_sbox | tD] ^ HEAP[x3_sbox | t2] ^ HEAP[sbox | t7] ^ R29;
- sA = HEAP[sbox | t8] ^ HEAP[sbox | tD] ^ HEAP[x2_sbox | t2] ^ HEAP[x3_sbox | t7] ^ R2A;
- sB = HEAP[x3_sbox | t8] ^ HEAP[sbox | tD] ^ HEAP[sbox | t2] ^ HEAP[x2_sbox | t7] ^ R2B;
- sC = HEAP[x2_sbox | tC] ^ HEAP[x3_sbox | t1] ^ HEAP[sbox | t6] ^ HEAP[sbox | tB] ^ R2C;
- sD = HEAP[sbox | tC] ^ HEAP[x2_sbox | t1] ^ HEAP[x3_sbox | t6] ^ HEAP[sbox | tB] ^ R2D;
- sE = HEAP[sbox | tC] ^ HEAP[sbox | t1] ^ HEAP[x2_sbox | t6] ^ HEAP[x3_sbox | tB] ^ R2E;
- sF = HEAP[x3_sbox | tC] ^ HEAP[sbox | t1] ^ HEAP[sbox | t6] ^ HEAP[x2_sbox | tB] ^ R2F;
- t0 = HEAP[x2_sbox | s0] ^ HEAP[x3_sbox | s5] ^ HEAP[sbox | sA] ^ HEAP[sbox | sF] ^ R30;
- t1 = HEAP[sbox | s0] ^ HEAP[x2_sbox | s5] ^ HEAP[x3_sbox | sA] ^ HEAP[sbox | sF] ^ R31;
- t2 = HEAP[sbox | s0] ^ HEAP[sbox | s5] ^ HEAP[x2_sbox | sA] ^ HEAP[x3_sbox | sF] ^ R32;
- t3 = HEAP[x3_sbox | s0] ^ HEAP[sbox | s5] ^ HEAP[sbox | sA] ^ HEAP[x2_sbox | sF] ^ R33;
- t4 = HEAP[x2_sbox | s4] ^ HEAP[x3_sbox | s9] ^ HEAP[sbox | sE] ^ HEAP[sbox | s3] ^ R34;
- t5 = HEAP[sbox | s4] ^ HEAP[x2_sbox | s9] ^ HEAP[x3_sbox | sE] ^ HEAP[sbox | s3] ^ R35;
- t6 = HEAP[sbox | s4] ^ HEAP[sbox | s9] ^ HEAP[x2_sbox | sE] ^ HEAP[x3_sbox | s3] ^ R36;
- t7 = HEAP[x3_sbox | s4] ^ HEAP[sbox | s9] ^ HEAP[sbox | sE] ^ HEAP[x2_sbox | s3] ^ R37;
- t8 = HEAP[x2_sbox | s8] ^ HEAP[x3_sbox | sD] ^ HEAP[sbox | s2] ^ HEAP[sbox | s7] ^ R38;
- t9 = HEAP[sbox | s8] ^ HEAP[x2_sbox | sD] ^ HEAP[x3_sbox | s2] ^ HEAP[sbox | s7] ^ R39;
- tA = HEAP[sbox | s8] ^ HEAP[sbox | sD] ^ HEAP[x2_sbox | s2] ^ HEAP[x3_sbox | s7] ^ R3A;
- tB = HEAP[x3_sbox | s8] ^ HEAP[sbox | sD] ^ HEAP[sbox | s2] ^ HEAP[x2_sbox | s7] ^ R3B;
- tC = HEAP[x2_sbox | sC] ^ HEAP[x3_sbox | s1] ^ HEAP[sbox | s6] ^ HEAP[sbox | sB] ^ R3C;
- tD = HEAP[sbox | sC] ^ HEAP[x2_sbox | s1] ^ HEAP[x3_sbox | s6] ^ HEAP[sbox | sB] ^ R3D;
- tE = HEAP[sbox | sC] ^ HEAP[sbox | s1] ^ HEAP[x2_sbox | s6] ^ HEAP[x3_sbox | sB] ^ R3E;
- tF = HEAP[x3_sbox | sC] ^ HEAP[sbox | s1] ^ HEAP[sbox | s6] ^ HEAP[x2_sbox | sB] ^ R3F;
- s0 = HEAP[x2_sbox | t0] ^ HEAP[x3_sbox | t5] ^ HEAP[sbox | tA] ^ HEAP[sbox | tF] ^ R40;
- s1 = HEAP[sbox | t0] ^ HEAP[x2_sbox | t5] ^ HEAP[x3_sbox | tA] ^ HEAP[sbox | tF] ^ R41;
- s2 = HEAP[sbox | t0] ^ HEAP[sbox | t5] ^ HEAP[x2_sbox | tA] ^ HEAP[x3_sbox | tF] ^ R42;
- s3 = HEAP[x3_sbox | t0] ^ HEAP[sbox | t5] ^ HEAP[sbox | tA] ^ HEAP[x2_sbox | tF] ^ R43;
- s4 = HEAP[x2_sbox | t4] ^ HEAP[x3_sbox | t9] ^ HEAP[sbox | tE] ^ HEAP[sbox | t3] ^ R44;
- s5 = HEAP[sbox | t4] ^ HEAP[x2_sbox | t9] ^ HEAP[x3_sbox | tE] ^ HEAP[sbox | t3] ^ R45;
- s6 = HEAP[sbox | t4] ^ HEAP[sbox | t9] ^ HEAP[x2_sbox | tE] ^ HEAP[x3_sbox | t3] ^ R46;
- s7 = HEAP[x3_sbox | t4] ^ HEAP[sbox | t9] ^ HEAP[sbox | tE] ^ HEAP[x2_sbox | t3] ^ R47;
- s8 = HEAP[x2_sbox | t8] ^ HEAP[x3_sbox | tD] ^ HEAP[sbox | t2] ^ HEAP[sbox | t7] ^ R48;
- s9 = HEAP[sbox | t8] ^ HEAP[x2_sbox | tD] ^ HEAP[x3_sbox | t2] ^ HEAP[sbox | t7] ^ R49;
- sA = HEAP[sbox | t8] ^ HEAP[sbox | tD] ^ HEAP[x2_sbox | t2] ^ HEAP[x3_sbox | t7] ^ R4A;
- sB = HEAP[x3_sbox | t8] ^ HEAP[sbox | tD] ^ HEAP[sbox | t2] ^ HEAP[x2_sbox | t7] ^ R4B;
- sC = HEAP[x2_sbox | tC] ^ HEAP[x3_sbox | t1] ^ HEAP[sbox | t6] ^ HEAP[sbox | tB] ^ R4C;
- sD = HEAP[sbox | tC] ^ HEAP[x2_sbox | t1] ^ HEAP[x3_sbox | t6] ^ HEAP[sbox | tB] ^ R4D;
- sE = HEAP[sbox | tC] ^ HEAP[sbox | t1] ^ HEAP[x2_sbox | t6] ^ HEAP[x3_sbox | tB] ^ R4E;
- sF = HEAP[x3_sbox | tC] ^ HEAP[sbox | t1] ^ HEAP[sbox | t6] ^ HEAP[x2_sbox | tB] ^ R4F;
- t0 = HEAP[x2_sbox | s0] ^ HEAP[x3_sbox | s5] ^ HEAP[sbox | sA] ^ HEAP[sbox | sF] ^ R50;
- t1 = HEAP[sbox | s0] ^ HEAP[x2_sbox | s5] ^ HEAP[x3_sbox | sA] ^ HEAP[sbox | sF] ^ R51;
- t2 = HEAP[sbox | s0] ^ HEAP[sbox | s5] ^ HEAP[x2_sbox | sA] ^ HEAP[x3_sbox | sF] ^ R52;
- t3 = HEAP[x3_sbox | s0] ^ HEAP[sbox | s5] ^ HEAP[sbox | sA] ^ HEAP[x2_sbox | sF] ^ R53;
- t4 = HEAP[x2_sbox | s4] ^ HEAP[x3_sbox | s9] ^ HEAP[sbox | sE] ^ HEAP[sbox | s3] ^ R54;
- t5 = HEAP[sbox | s4] ^ HEAP[x2_sbox | s9] ^ HEAP[x3_sbox | sE] ^ HEAP[sbox | s3] ^ R55;
- t6 = HEAP[sbox | s4] ^ HEAP[sbox | s9] ^ HEAP[x2_sbox | sE] ^ HEAP[x3_sbox | s3] ^ R56;
- t7 = HEAP[x3_sbox | s4] ^ HEAP[sbox | s9] ^ HEAP[sbox | sE] ^ HEAP[x2_sbox | s3] ^ R57;
- t8 = HEAP[x2_sbox | s8] ^ HEAP[x3_sbox | sD] ^ HEAP[sbox | s2] ^ HEAP[sbox | s7] ^ R58;
- t9 = HEAP[sbox | s8] ^ HEAP[x2_sbox | sD] ^ HEAP[x3_sbox | s2] ^ HEAP[sbox | s7] ^ R59;
- tA = HEAP[sbox | s8] ^ HEAP[sbox | sD] ^ HEAP[x2_sbox | s2] ^ HEAP[x3_sbox | s7] ^ R5A;
- tB = HEAP[x3_sbox | s8] ^ HEAP[sbox | sD] ^ HEAP[sbox | s2] ^ HEAP[x2_sbox | s7] ^ R5B;
- tC = HEAP[x2_sbox | sC] ^ HEAP[x3_sbox | s1] ^ HEAP[sbox | s6] ^ HEAP[sbox | sB] ^ R5C;
- tD = HEAP[sbox | sC] ^ HEAP[x2_sbox | s1] ^ HEAP[x3_sbox | s6] ^ HEAP[sbox | sB] ^ R5D;
- tE = HEAP[sbox | sC] ^ HEAP[sbox | s1] ^ HEAP[x2_sbox | s6] ^ HEAP[x3_sbox | sB] ^ R5E;
- tF = HEAP[x3_sbox | sC] ^ HEAP[sbox | s1] ^ HEAP[sbox | s6] ^ HEAP[x2_sbox | sB] ^ R5F;
- s0 = HEAP[x2_sbox | t0] ^ HEAP[x3_sbox | t5] ^ HEAP[sbox | tA] ^ HEAP[sbox | tF] ^ R60;
- s1 = HEAP[sbox | t0] ^ HEAP[x2_sbox | t5] ^ HEAP[x3_sbox | tA] ^ HEAP[sbox | tF] ^ R61;
- s2 = HEAP[sbox | t0] ^ HEAP[sbox | t5] ^ HEAP[x2_sbox | tA] ^ HEAP[x3_sbox | tF] ^ R62;
- s3 = HEAP[x3_sbox | t0] ^ HEAP[sbox | t5] ^ HEAP[sbox | tA] ^ HEAP[x2_sbox | tF] ^ R63;
- s4 = HEAP[x2_sbox | t4] ^ HEAP[x3_sbox | t9] ^ HEAP[sbox | tE] ^ HEAP[sbox | t3] ^ R64;
- s5 = HEAP[sbox | t4] ^ HEAP[x2_sbox | t9] ^ HEAP[x3_sbox | tE] ^ HEAP[sbox | t3] ^ R65;
- s6 = HEAP[sbox | t4] ^ HEAP[sbox | t9] ^ HEAP[x2_sbox | tE] ^ HEAP[x3_sbox | t3] ^ R66;
- s7 = HEAP[x3_sbox | t4] ^ HEAP[sbox | t9] ^ HEAP[sbox | tE] ^ HEAP[x2_sbox | t3] ^ R67;
- s8 = HEAP[x2_sbox | t8] ^ HEAP[x3_sbox | tD] ^ HEAP[sbox | t2] ^ HEAP[sbox | t7] ^ R68;
- s9 = HEAP[sbox | t8] ^ HEAP[x2_sbox | tD] ^ HEAP[x3_sbox | t2] ^ HEAP[sbox | t7] ^ R69;
- sA = HEAP[sbox | t8] ^ HEAP[sbox | tD] ^ HEAP[x2_sbox | t2] ^ HEAP[x3_sbox | t7] ^ R6A;
- sB = HEAP[x3_sbox | t8] ^ HEAP[sbox | tD] ^ HEAP[sbox | t2] ^ HEAP[x2_sbox | t7] ^ R6B;
- sC = HEAP[x2_sbox | tC] ^ HEAP[x3_sbox | t1] ^ HEAP[sbox | t6] ^ HEAP[sbox | tB] ^ R6C;
- sD = HEAP[sbox | tC] ^ HEAP[x2_sbox | t1] ^ HEAP[x3_sbox | t6] ^ HEAP[sbox | tB] ^ R6D;
- sE = HEAP[sbox | tC] ^ HEAP[sbox | t1] ^ HEAP[x2_sbox | t6] ^ HEAP[x3_sbox | tB] ^ R6E;
- sF = HEAP[x3_sbox | tC] ^ HEAP[sbox | t1] ^ HEAP[sbox | t6] ^ HEAP[x2_sbox | tB] ^ R6F;
- t0 = HEAP[x2_sbox | s0] ^ HEAP[x3_sbox | s5] ^ HEAP[sbox | sA] ^ HEAP[sbox | sF] ^ R70;
- t1 = HEAP[sbox | s0] ^ HEAP[x2_sbox | s5] ^ HEAP[x3_sbox | sA] ^ HEAP[sbox | sF] ^ R71;
- t2 = HEAP[sbox | s0] ^ HEAP[sbox | s5] ^ HEAP[x2_sbox | sA] ^ HEAP[x3_sbox | sF] ^ R72;
- t3 = HEAP[x3_sbox | s0] ^ HEAP[sbox | s5] ^ HEAP[sbox | sA] ^ HEAP[x2_sbox | sF] ^ R73;
- t4 = HEAP[x2_sbox | s4] ^ HEAP[x3_sbox | s9] ^ HEAP[sbox | sE] ^ HEAP[sbox | s3] ^ R74;
- t5 = HEAP[sbox | s4] ^ HEAP[x2_sbox | s9] ^ HEAP[x3_sbox | sE] ^ HEAP[sbox | s3] ^ R75;
- t6 = HEAP[sbox | s4] ^ HEAP[sbox | s9] ^ HEAP[x2_sbox | sE] ^ HEAP[x3_sbox | s3] ^ R76;
- t7 = HEAP[x3_sbox | s4] ^ HEAP[sbox | s9] ^ HEAP[sbox | sE] ^ HEAP[x2_sbox | s3] ^ R77;
- t8 = HEAP[x2_sbox | s8] ^ HEAP[x3_sbox | sD] ^ HEAP[sbox | s2] ^ HEAP[sbox | s7] ^ R78;
- t9 = HEAP[sbox | s8] ^ HEAP[x2_sbox | sD] ^ HEAP[x3_sbox | s2] ^ HEAP[sbox | s7] ^ R79;
- tA = HEAP[sbox | s8] ^ HEAP[sbox | sD] ^ HEAP[x2_sbox | s2] ^ HEAP[x3_sbox | s7] ^ R7A;
- tB = HEAP[x3_sbox | s8] ^ HEAP[sbox | sD] ^ HEAP[sbox | s2] ^ HEAP[x2_sbox | s7] ^ R7B;
- tC = HEAP[x2_sbox | sC] ^ HEAP[x3_sbox | s1] ^ HEAP[sbox | s6] ^ HEAP[sbox | sB] ^ R7C;
- tD = HEAP[sbox | sC] ^ HEAP[x2_sbox | s1] ^ HEAP[x3_sbox | s6] ^ HEAP[sbox | sB] ^ R7D;
- tE = HEAP[sbox | sC] ^ HEAP[sbox | s1] ^ HEAP[x2_sbox | s6] ^ HEAP[x3_sbox | sB] ^ R7E;
- tF = HEAP[x3_sbox | sC] ^ HEAP[sbox | s1] ^ HEAP[sbox | s6] ^ HEAP[x2_sbox | sB] ^ R7F;
- s0 = HEAP[x2_sbox | t0] ^ HEAP[x3_sbox | t5] ^ HEAP[sbox | tA] ^ HEAP[sbox | tF] ^ R80;
- s1 = HEAP[sbox | t0] ^ HEAP[x2_sbox | t5] ^ HEAP[x3_sbox | tA] ^ HEAP[sbox | tF] ^ R81;
- s2 = HEAP[sbox | t0] ^ HEAP[sbox | t5] ^ HEAP[x2_sbox | tA] ^ HEAP[x3_sbox | tF] ^ R82;
- s3 = HEAP[x3_sbox | t0] ^ HEAP[sbox | t5] ^ HEAP[sbox | tA] ^ HEAP[x2_sbox | tF] ^ R83;
- s4 = HEAP[x2_sbox | t4] ^ HEAP[x3_sbox | t9] ^ HEAP[sbox | tE] ^ HEAP[sbox | t3] ^ R84;
- s5 = HEAP[sbox | t4] ^ HEAP[x2_sbox | t9] ^ HEAP[x3_sbox | tE] ^ HEAP[sbox | t3] ^ R85;
- s6 = HEAP[sbox | t4] ^ HEAP[sbox | t9] ^ HEAP[x2_sbox | tE] ^ HEAP[x3_sbox | t3] ^ R86;
- s7 = HEAP[x3_sbox | t4] ^ HEAP[sbox | t9] ^ HEAP[sbox | tE] ^ HEAP[x2_sbox | t3] ^ R87;
- s8 = HEAP[x2_sbox | t8] ^ HEAP[x3_sbox | tD] ^ HEAP[sbox | t2] ^ HEAP[sbox | t7] ^ R88;
- s9 = HEAP[sbox | t8] ^ HEAP[x2_sbox | tD] ^ HEAP[x3_sbox | t2] ^ HEAP[sbox | t7] ^ R89;
- sA = HEAP[sbox | t8] ^ HEAP[sbox | tD] ^ HEAP[x2_sbox | t2] ^ HEAP[x3_sbox | t7] ^ R8A;
- sB = HEAP[x3_sbox | t8] ^ HEAP[sbox | tD] ^ HEAP[sbox | t2] ^ HEAP[x2_sbox | t7] ^ R8B;
- sC = HEAP[x2_sbox | tC] ^ HEAP[x3_sbox | t1] ^ HEAP[sbox | t6] ^ HEAP[sbox | tB] ^ R8C;
- sD = HEAP[sbox | tC] ^ HEAP[x2_sbox | t1] ^ HEAP[x3_sbox | t6] ^ HEAP[sbox | tB] ^ R8D;
- sE = HEAP[sbox | tC] ^ HEAP[sbox | t1] ^ HEAP[x2_sbox | t6] ^ HEAP[x3_sbox | tB] ^ R8E;
- sF = HEAP[x3_sbox | tC] ^ HEAP[sbox | t1] ^ HEAP[sbox | t6] ^ HEAP[x2_sbox | tB] ^ R8F;
- t0 = HEAP[x2_sbox | s0] ^ HEAP[x3_sbox | s5] ^ HEAP[sbox | sA] ^ HEAP[sbox | sF] ^ R90;
- t1 = HEAP[sbox | s0] ^ HEAP[x2_sbox | s5] ^ HEAP[x3_sbox | sA] ^ HEAP[sbox | sF] ^ R91;
- t2 = HEAP[sbox | s0] ^ HEAP[sbox | s5] ^ HEAP[x2_sbox | sA] ^ HEAP[x3_sbox | sF] ^ R92;
- t3 = HEAP[x3_sbox | s0] ^ HEAP[sbox | s5] ^ HEAP[sbox | sA] ^ HEAP[x2_sbox | sF] ^ R93;
- t4 = HEAP[x2_sbox | s4] ^ HEAP[x3_sbox | s9] ^ HEAP[sbox | sE] ^ HEAP[sbox | s3] ^ R94;
- t5 = HEAP[sbox | s4] ^ HEAP[x2_sbox | s9] ^ HEAP[x3_sbox | sE] ^ HEAP[sbox | s3] ^ R95;
- t6 = HEAP[sbox | s4] ^ HEAP[sbox | s9] ^ HEAP[x2_sbox | sE] ^ HEAP[x3_sbox | s3] ^ R96;
- t7 = HEAP[x3_sbox | s4] ^ HEAP[sbox | s9] ^ HEAP[sbox | sE] ^ HEAP[x2_sbox | s3] ^ R97;
- t8 = HEAP[x2_sbox | s8] ^ HEAP[x3_sbox | sD] ^ HEAP[sbox | s2] ^ HEAP[sbox | s7] ^ R98;
- t9 = HEAP[sbox | s8] ^ HEAP[x2_sbox | sD] ^ HEAP[x3_sbox | s2] ^ HEAP[sbox | s7] ^ R99;
- tA = HEAP[sbox | s8] ^ HEAP[sbox | sD] ^ HEAP[x2_sbox | s2] ^ HEAP[x3_sbox | s7] ^ R9A;
- tB = HEAP[x3_sbox | s8] ^ HEAP[sbox | sD] ^ HEAP[sbox | s2] ^ HEAP[x2_sbox | s7] ^ R9B;
- tC = HEAP[x2_sbox | sC] ^ HEAP[x3_sbox | s1] ^ HEAP[sbox | s6] ^ HEAP[sbox | sB] ^ R9C;
- tD = HEAP[sbox | sC] ^ HEAP[x2_sbox | s1] ^ HEAP[x3_sbox | s6] ^ HEAP[sbox | sB] ^ R9D;
- tE = HEAP[sbox | sC] ^ HEAP[sbox | s1] ^ HEAP[x2_sbox | s6] ^ HEAP[x3_sbox | sB] ^ R9E;
- tF = HEAP[x3_sbox | sC] ^ HEAP[sbox | s1] ^ HEAP[sbox | s6] ^ HEAP[x2_sbox | sB] ^ R9F;
- if ((keySize | 0) == 16) {
- S0 = HEAP[sbox | t0] ^ RA0;
- S1 = HEAP[sbox | t5] ^ RA1;
- S2 = HEAP[sbox | tA] ^ RA2;
- S3 = HEAP[sbox | tF] ^ RA3;
- S4 = HEAP[sbox | t4] ^ RA4;
- S5 = HEAP[sbox | t9] ^ RA5;
- S6 = HEAP[sbox | tE] ^ RA6;
- S7 = HEAP[sbox | t3] ^ RA7;
- S8 = HEAP[sbox | t8] ^ RA8;
- S9 = HEAP[sbox | tD] ^ RA9;
- SA = HEAP[sbox | t2] ^ RAA;
- SB = HEAP[sbox | t7] ^ RAB;
- SC = HEAP[sbox | tC] ^ RAC;
- SD = HEAP[sbox | t1] ^ RAD;
- SE = HEAP[sbox | t6] ^ RAE;
- SF = HEAP[sbox | tB] ^ RAF;
- return;
- }
- s0 = HEAP[x2_sbox | t0] ^ HEAP[x3_sbox | t5] ^ HEAP[sbox | tA] ^ HEAP[sbox | tF] ^ RA0;
- s1 = HEAP[sbox | t0] ^ HEAP[x2_sbox | t5] ^ HEAP[x3_sbox | tA] ^ HEAP[sbox | tF] ^ RA1;
- s2 = HEAP[sbox | t0] ^ HEAP[sbox | t5] ^ HEAP[x2_sbox | tA] ^ HEAP[x3_sbox | tF] ^ RA2;
- s3 = HEAP[x3_sbox | t0] ^ HEAP[sbox | t5] ^ HEAP[sbox | tA] ^ HEAP[x2_sbox | tF] ^ RA3;
- s4 = HEAP[x2_sbox | t4] ^ HEAP[x3_sbox | t9] ^ HEAP[sbox | tE] ^ HEAP[sbox | t3] ^ RA4;
- s5 = HEAP[sbox | t4] ^ HEAP[x2_sbox | t9] ^ HEAP[x3_sbox | tE] ^ HEAP[sbox | t3] ^ RA5;
- s6 = HEAP[sbox | t4] ^ HEAP[sbox | t9] ^ HEAP[x2_sbox | tE] ^ HEAP[x3_sbox | t3] ^ RA6;
- s7 = HEAP[x3_sbox | t4] ^ HEAP[sbox | t9] ^ HEAP[sbox | tE] ^ HEAP[x2_sbox | t3] ^ RA7;
- s8 = HEAP[x2_sbox | t8] ^ HEAP[x3_sbox | tD] ^ HEAP[sbox | t2] ^ HEAP[sbox | t7] ^ RA8;
- s9 = HEAP[sbox | t8] ^ HEAP[x2_sbox | tD] ^ HEAP[x3_sbox | t2] ^ HEAP[sbox | t7] ^ RA9;
- sA = HEAP[sbox | t8] ^ HEAP[sbox | tD] ^ HEAP[x2_sbox | t2] ^ HEAP[x3_sbox | t7] ^ RAA;
- sB = HEAP[x3_sbox | t8] ^ HEAP[sbox | tD] ^ HEAP[sbox | t2] ^ HEAP[x2_sbox | t7] ^ RAB;
- sC = HEAP[x2_sbox | tC] ^ HEAP[x3_sbox | t1] ^ HEAP[sbox | t6] ^ HEAP[sbox | tB] ^ RAC;
- sD = HEAP[sbox | tC] ^ HEAP[x2_sbox | t1] ^ HEAP[x3_sbox | t6] ^ HEAP[sbox | tB] ^ RAD;
- sE = HEAP[sbox | tC] ^ HEAP[sbox | t1] ^ HEAP[x2_sbox | t6] ^ HEAP[x3_sbox | tB] ^ RAE;
- sF = HEAP[x3_sbox | tC] ^ HEAP[sbox | t1] ^ HEAP[sbox | t6] ^ HEAP[x2_sbox | tB] ^ RAF;
- t0 = HEAP[x2_sbox | s0] ^ HEAP[x3_sbox | s5] ^ HEAP[sbox | sA] ^ HEAP[sbox | sF] ^ RB0;
- t1 = HEAP[sbox | s0] ^ HEAP[x2_sbox | s5] ^ HEAP[x3_sbox | sA] ^ HEAP[sbox | sF] ^ RB1;
- t2 = HEAP[sbox | s0] ^ HEAP[sbox | s5] ^ HEAP[x2_sbox | sA] ^ HEAP[x3_sbox | sF] ^ RB2;
- t3 = HEAP[x3_sbox | s0] ^ HEAP[sbox | s5] ^ HEAP[sbox | sA] ^ HEAP[x2_sbox | sF] ^ RB3;
- t4 = HEAP[x2_sbox | s4] ^ HEAP[x3_sbox | s9] ^ HEAP[sbox | sE] ^ HEAP[sbox | s3] ^ RB4;
- t5 = HEAP[sbox | s4] ^ HEAP[x2_sbox | s9] ^ HEAP[x3_sbox | sE] ^ HEAP[sbox | s3] ^ RB5;
- t6 = HEAP[sbox | s4] ^ HEAP[sbox | s9] ^ HEAP[x2_sbox | sE] ^ HEAP[x3_sbox | s3] ^ RB6;
- t7 = HEAP[x3_sbox | s4] ^ HEAP[sbox | s9] ^ HEAP[sbox | sE] ^ HEAP[x2_sbox | s3] ^ RB7;
- t8 = HEAP[x2_sbox | s8] ^ HEAP[x3_sbox | sD] ^ HEAP[sbox | s2] ^ HEAP[sbox | s7] ^ RB8;
- t9 = HEAP[sbox | s8] ^ HEAP[x2_sbox | sD] ^ HEAP[x3_sbox | s2] ^ HEAP[sbox | s7] ^ RB9;
- tA = HEAP[sbox | s8] ^ HEAP[sbox | sD] ^ HEAP[x2_sbox | s2] ^ HEAP[x3_sbox | s7] ^ RBA;
- tB = HEAP[x3_sbox | s8] ^ HEAP[sbox | sD] ^ HEAP[sbox | s2] ^ HEAP[x2_sbox | s7] ^ RBB;
- tC = HEAP[x2_sbox | sC] ^ HEAP[x3_sbox | s1] ^ HEAP[sbox | s6] ^ HEAP[sbox | sB] ^ RBC;
- tD = HEAP[sbox | sC] ^ HEAP[x2_sbox | s1] ^ HEAP[x3_sbox | s6] ^ HEAP[sbox | sB] ^ RBD;
- tE = HEAP[sbox | sC] ^ HEAP[sbox | s1] ^ HEAP[x2_sbox | s6] ^ HEAP[x3_sbox | sB] ^ RBE;
- tF = HEAP[x3_sbox | sC] ^ HEAP[sbox | s1] ^ HEAP[sbox | s6] ^ HEAP[x2_sbox | sB] ^ RBF;
- s0 = HEAP[x2_sbox | t0] ^ HEAP[x3_sbox | t5] ^ HEAP[sbox | tA] ^ HEAP[sbox | tF] ^ RC0;
- s1 = HEAP[sbox | t0] ^ HEAP[x2_sbox | t5] ^ HEAP[x3_sbox | tA] ^ HEAP[sbox | tF] ^ RC1;
- s2 = HEAP[sbox | t0] ^ HEAP[sbox | t5] ^ HEAP[x2_sbox | tA] ^ HEAP[x3_sbox | tF] ^ RC2;
- s3 = HEAP[x3_sbox | t0] ^ HEAP[sbox | t5] ^ HEAP[sbox | tA] ^ HEAP[x2_sbox | tF] ^ RC3;
- s4 = HEAP[x2_sbox | t4] ^ HEAP[x3_sbox | t9] ^ HEAP[sbox | tE] ^ HEAP[sbox | t3] ^ RC4;
- s5 = HEAP[sbox | t4] ^ HEAP[x2_sbox | t9] ^ HEAP[x3_sbox | tE] ^ HEAP[sbox | t3] ^ RC5;
- s6 = HEAP[sbox | t4] ^ HEAP[sbox | t9] ^ HEAP[x2_sbox | tE] ^ HEAP[x3_sbox | t3] ^ RC6;
- s7 = HEAP[x3_sbox | t4] ^ HEAP[sbox | t9] ^ HEAP[sbox | tE] ^ HEAP[x2_sbox | t3] ^ RC7;
- s8 = HEAP[x2_sbox | t8] ^ HEAP[x3_sbox | tD] ^ HEAP[sbox | t2] ^ HEAP[sbox | t7] ^ RC8;
- s9 = HEAP[sbox | t8] ^ HEAP[x2_sbox | tD] ^ HEAP[x3_sbox | t2] ^ HEAP[sbox | t7] ^ RC9;
- sA = HEAP[sbox | t8] ^ HEAP[sbox | tD] ^ HEAP[x2_sbox | t2] ^ HEAP[x3_sbox | t7] ^ RCA;
- sB = HEAP[x3_sbox | t8] ^ HEAP[sbox | tD] ^ HEAP[sbox | t2] ^ HEAP[x2_sbox | t7] ^ RCB;
- sC = HEAP[x2_sbox | tC] ^ HEAP[x3_sbox | t1] ^ HEAP[sbox | t6] ^ HEAP[sbox | tB] ^ RCC;
- sD = HEAP[sbox | tC] ^ HEAP[x2_sbox | t1] ^ HEAP[x3_sbox | t6] ^ HEAP[sbox | tB] ^ RCD;
- sE = HEAP[sbox | tC] ^ HEAP[sbox | t1] ^ HEAP[x2_sbox | t6] ^ HEAP[x3_sbox | tB] ^ RCE;
- sF = HEAP[x3_sbox | tC] ^ HEAP[sbox | t1] ^ HEAP[sbox | t6] ^ HEAP[x2_sbox | tB] ^ RCF;
- t0 = HEAP[x2_sbox | s0] ^ HEAP[x3_sbox | s5] ^ HEAP[sbox | sA] ^ HEAP[sbox | sF] ^ RD0;
- t1 = HEAP[sbox | s0] ^ HEAP[x2_sbox | s5] ^ HEAP[x3_sbox | sA] ^ HEAP[sbox | sF] ^ RD1;
- t2 = HEAP[sbox | s0] ^ HEAP[sbox | s5] ^ HEAP[x2_sbox | sA] ^ HEAP[x3_sbox | sF] ^ RD2;
- t3 = HEAP[x3_sbox | s0] ^ HEAP[sbox | s5] ^ HEAP[sbox | sA] ^ HEAP[x2_sbox | sF] ^ RD3;
- t4 = HEAP[x2_sbox | s4] ^ HEAP[x3_sbox | s9] ^ HEAP[sbox | sE] ^ HEAP[sbox | s3] ^ RD4;
- t5 = HEAP[sbox | s4] ^ HEAP[x2_sbox | s9] ^ HEAP[x3_sbox | sE] ^ HEAP[sbox | s3] ^ RD5;
- t6 = HEAP[sbox | s4] ^ HEAP[sbox | s9] ^ HEAP[x2_sbox | sE] ^ HEAP[x3_sbox | s3] ^ RD6;
- t7 = HEAP[x3_sbox | s4] ^ HEAP[sbox | s9] ^ HEAP[sbox | sE] ^ HEAP[x2_sbox | s3] ^ RD7;
- t8 = HEAP[x2_sbox | s8] ^ HEAP[x3_sbox | sD] ^ HEAP[sbox | s2] ^ HEAP[sbox | s7] ^ RD8;
- t9 = HEAP[sbox | s8] ^ HEAP[x2_sbox | sD] ^ HEAP[x3_sbox | s2] ^ HEAP[sbox | s7] ^ RD9;
- tA = HEAP[sbox | s8] ^ HEAP[sbox | sD] ^ HEAP[x2_sbox | s2] ^ HEAP[x3_sbox | s7] ^ RDA;
- tB = HEAP[x3_sbox | s8] ^ HEAP[sbox | sD] ^ HEAP[sbox | s2] ^ HEAP[x2_sbox | s7] ^ RDB;
- tC = HEAP[x2_sbox | sC] ^ HEAP[x3_sbox | s1] ^ HEAP[sbox | s6] ^ HEAP[sbox | sB] ^ RDC;
- tD = HEAP[sbox | sC] ^ HEAP[x2_sbox | s1] ^ HEAP[x3_sbox | s6] ^ HEAP[sbox | sB] ^ RDD;
- tE = HEAP[sbox | sC] ^ HEAP[sbox | s1] ^ HEAP[x2_sbox | s6] ^ HEAP[x3_sbox | sB] ^ RDE;
- tF = HEAP[x3_sbox | sC] ^ HEAP[sbox | s1] ^ HEAP[sbox | s6] ^ HEAP[x2_sbox | sB] ^ RDF;
- S0 = HEAP[sbox | t0] ^ RE0;
- S1 = HEAP[sbox | t5] ^ RE1;
- S2 = HEAP[sbox | tA] ^ RE2;
- S3 = HEAP[sbox | tF] ^ RE3;
- S4 = HEAP[sbox | t4] ^ RE4;
- S5 = HEAP[sbox | t9] ^ RE5;
- S6 = HEAP[sbox | tE] ^ RE6;
- S7 = HEAP[sbox | t3] ^ RE7;
- S8 = HEAP[sbox | t8] ^ RE8;
- S9 = HEAP[sbox | tD] ^ RE9;
- SA = HEAP[sbox | t2] ^ REA;
- SB = HEAP[sbox | t7] ^ REB;
- SC = HEAP[sbox | tC] ^ REC;
- SD = HEAP[sbox | t1] ^ RED;
- SE = HEAP[sbox | t6] ^ REE;
- SF = HEAP[sbox | tB] ^ REF;
- }
- function _decrypt(s0, s1, s2, s3, s4, s5, s6, s7, s8, s9, sA, sB, sC, sD, sE, sF) {
- s0 = s0 | 0;
- s1 = s1 | 0;
- s2 = s2 | 0;
- s3 = s3 | 0;
- s4 = s4 | 0;
- s5 = s5 | 0;
- s6 = s6 | 0;
- s7 = s7 | 0;
- s8 = s8 | 0;
- s9 = s9 | 0;
- sA = sA | 0;
- sB = sB | 0;
- sC = sC | 0;
- sD = sD | 0;
- sE = sE | 0;
- sF = sF | 0;
- var t0 = 0, t1 = 0, t2 = 0, t3 = 0, t4 = 0, t5 = 0, t6 = 0, t7 = 0, t8 = 0, t9 = 0, tA = 0, tB = 0, tC = 0, tD = 0, tE = 0, tF = 0, inv_sbox = 256, x9 = 1024, xB = 1280, xD = 1536, xE = 1792;
- if ((keySize | 0) == 32) {
- t0 = HEAP[inv_sbox | s0 ^ RE0] ^ RD0;
- t1 = HEAP[inv_sbox | sD ^ RED] ^ RD1;
- t2 = HEAP[inv_sbox | sA ^ REA] ^ RD2;
- t3 = HEAP[inv_sbox | s7 ^ RE7] ^ RD3;
- t4 = HEAP[inv_sbox | s4 ^ RE4] ^ RD4;
- t5 = HEAP[inv_sbox | s1 ^ RE1] ^ RD5;
- t6 = HEAP[inv_sbox | sE ^ REE] ^ RD6;
- t7 = HEAP[inv_sbox | sB ^ REB] ^ RD7;
- t8 = HEAP[inv_sbox | s8 ^ RE8] ^ RD8;
- t9 = HEAP[inv_sbox | s5 ^ RE5] ^ RD9;
- tA = HEAP[inv_sbox | s2 ^ RE2] ^ RDA;
- tB = HEAP[inv_sbox | sF ^ REF] ^ RDB;
- tC = HEAP[inv_sbox | sC ^ REC] ^ RDC;
- tD = HEAP[inv_sbox | s9 ^ RE9] ^ RDD;
- tE = HEAP[inv_sbox | s6 ^ RE6] ^ RDE;
- tF = HEAP[inv_sbox | s3 ^ RE3] ^ RDF;
- s0 = HEAP[xE | t0] ^ HEAP[xB | t1] ^ HEAP[xD | t2] ^ HEAP[x9 | t3];
- s1 = HEAP[x9 | tC] ^ HEAP[xE | tD] ^ HEAP[xB | tE] ^ HEAP[xD | tF];
- s2 = HEAP[xD | t8] ^ HEAP[x9 | t9] ^ HEAP[xE | tA] ^ HEAP[xB | tB];
- s3 = HEAP[xB | t4] ^ HEAP[xD | t5] ^ HEAP[x9 | t6] ^ HEAP[xE | t7];
- s4 = HEAP[xE | t4] ^ HEAP[xB | t5] ^ HEAP[xD | t6] ^ HEAP[x9 | t7];
- s5 = HEAP[x9 | t0] ^ HEAP[xE | t1] ^ HEAP[xB | t2] ^ HEAP[xD | t3];
- s6 = HEAP[xD | tC] ^ HEAP[x9 | tD] ^ HEAP[xE | tE] ^ HEAP[xB | tF];
- s7 = HEAP[xB | t8] ^ HEAP[xD | t9] ^ HEAP[x9 | tA] ^ HEAP[xE | tB];
- s8 = HEAP[xE | t8] ^ HEAP[xB | t9] ^ HEAP[xD | tA] ^ HEAP[x9 | tB];
- s9 = HEAP[x9 | t4] ^ HEAP[xE | t5] ^ HEAP[xB | t6] ^ HEAP[xD | t7];
- sA = HEAP[xD | t0] ^ HEAP[x9 | t1] ^ HEAP[xE | t2] ^ HEAP[xB | t3];
- sB = HEAP[xB | tC] ^ HEAP[xD | tD] ^ HEAP[x9 | tE] ^ HEAP[xE | tF];
- sC = HEAP[xE | tC] ^ HEAP[xB | tD] ^ HEAP[xD | tE] ^ HEAP[x9 | tF];
- sD = HEAP[x9 | t8] ^ HEAP[xE | t9] ^ HEAP[xB | tA] ^ HEAP[xD | tB];
- sE = HEAP[xD | t4] ^ HEAP[x9 | t5] ^ HEAP[xE | t6] ^ HEAP[xB | t7];
- sF = HEAP[xB | t0] ^ HEAP[xD | t1] ^ HEAP[x9 | t2] ^ HEAP[xE | t3];
- t0 = HEAP[inv_sbox | s0] ^ RC0;
- t1 = HEAP[inv_sbox | s1] ^ RC1;
- t2 = HEAP[inv_sbox | s2] ^ RC2;
- t3 = HEAP[inv_sbox | s3] ^ RC3;
- t4 = HEAP[inv_sbox | s4] ^ RC4;
- t5 = HEAP[inv_sbox | s5] ^ RC5;
- t6 = HEAP[inv_sbox | s6] ^ RC6;
- t7 = HEAP[inv_sbox | s7] ^ RC7;
- t8 = HEAP[inv_sbox | s8] ^ RC8;
- t9 = HEAP[inv_sbox | s9] ^ RC9;
- tA = HEAP[inv_sbox | sA] ^ RCA;
- tB = HEAP[inv_sbox | sB] ^ RCB;
- tC = HEAP[inv_sbox | sC] ^ RCC;
- tD = HEAP[inv_sbox | sD] ^ RCD;
- tE = HEAP[inv_sbox | sE] ^ RCE;
- tF = HEAP[inv_sbox | sF] ^ RCF;
- s0 = HEAP[xE | t0] ^ HEAP[xB | t1] ^ HEAP[xD | t2] ^ HEAP[x9 | t3];
- s1 = HEAP[x9 | tC] ^ HEAP[xE | tD] ^ HEAP[xB | tE] ^ HEAP[xD | tF];
- s2 = HEAP[xD | t8] ^ HEAP[x9 | t9] ^ HEAP[xE | tA] ^ HEAP[xB | tB];
- s3 = HEAP[xB | t4] ^ HEAP[xD | t5] ^ HEAP[x9 | t6] ^ HEAP[xE | t7];
- s4 = HEAP[xE | t4] ^ HEAP[xB | t5] ^ HEAP[xD | t6] ^ HEAP[x9 | t7];
- s5 = HEAP[x9 | t0] ^ HEAP[xE | t1] ^ HEAP[xB | t2] ^ HEAP[xD | t3];
- s6 = HEAP[xD | tC] ^ HEAP[x9 | tD] ^ HEAP[xE | tE] ^ HEAP[xB | tF];
- s7 = HEAP[xB | t8] ^ HEAP[xD | t9] ^ HEAP[x9 | tA] ^ HEAP[xE | tB];
- s8 = HEAP[xE | t8] ^ HEAP[xB | t9] ^ HEAP[xD | tA] ^ HEAP[x9 | tB];
- s9 = HEAP[x9 | t4] ^ HEAP[xE | t5] ^ HEAP[xB | t6] ^ HEAP[xD | t7];
- sA = HEAP[xD | t0] ^ HEAP[x9 | t1] ^ HEAP[xE | t2] ^ HEAP[xB | t3];
- sB = HEAP[xB | tC] ^ HEAP[xD | tD] ^ HEAP[x9 | tE] ^ HEAP[xE | tF];
- sC = HEAP[xE | tC] ^ HEAP[xB | tD] ^ HEAP[xD | tE] ^ HEAP[x9 | tF];
- sD = HEAP[x9 | t8] ^ HEAP[xE | t9] ^ HEAP[xB | tA] ^ HEAP[xD | tB];
- sE = HEAP[xD | t4] ^ HEAP[x9 | t5] ^ HEAP[xE | t6] ^ HEAP[xB | t7];
- sF = HEAP[xB | t0] ^ HEAP[xD | t1] ^ HEAP[x9 | t2] ^ HEAP[xE | t3];
- t0 = HEAP[inv_sbox | s0] ^ RB0;
- t1 = HEAP[inv_sbox | s1] ^ RB1;
- t2 = HEAP[inv_sbox | s2] ^ RB2;
- t3 = HEAP[inv_sbox | s3] ^ RB3;
- t4 = HEAP[inv_sbox | s4] ^ RB4;
- t5 = HEAP[inv_sbox | s5] ^ RB5;
- t6 = HEAP[inv_sbox | s6] ^ RB6;
- t7 = HEAP[inv_sbox | s7] ^ RB7;
- t8 = HEAP[inv_sbox | s8] ^ RB8;
- t9 = HEAP[inv_sbox | s9] ^ RB9;
- tA = HEAP[inv_sbox | sA] ^ RBA;
- tB = HEAP[inv_sbox | sB] ^ RBB;
- tC = HEAP[inv_sbox | sC] ^ RBC;
- tD = HEAP[inv_sbox | sD] ^ RBD;
- tE = HEAP[inv_sbox | sE] ^ RBE;
- tF = HEAP[inv_sbox | sF] ^ RBF;
- s0 = HEAP[xE | t0] ^ HEAP[xB | t1] ^ HEAP[xD | t2] ^ HEAP[x9 | t3];
- s1 = HEAP[x9 | tC] ^ HEAP[xE | tD] ^ HEAP[xB | tE] ^ HEAP[xD | tF];
- s2 = HEAP[xD | t8] ^ HEAP[x9 | t9] ^ HEAP[xE | tA] ^ HEAP[xB | tB];
- s3 = HEAP[xB | t4] ^ HEAP[xD | t5] ^ HEAP[x9 | t6] ^ HEAP[xE | t7];
- s4 = HEAP[xE | t4] ^ HEAP[xB | t5] ^ HEAP[xD | t6] ^ HEAP[x9 | t7];
- s5 = HEAP[x9 | t0] ^ HEAP[xE | t1] ^ HEAP[xB | t2] ^ HEAP[xD | t3];
- s6 = HEAP[xD | tC] ^ HEAP[x9 | tD] ^ HEAP[xE | tE] ^ HEAP[xB | tF];
- s7 = HEAP[xB | t8] ^ HEAP[xD | t9] ^ HEAP[x9 | tA] ^ HEAP[xE | tB];
- s8 = HEAP[xE | t8] ^ HEAP[xB | t9] ^ HEAP[xD | tA] ^ HEAP[x9 | tB];
- s9 = HEAP[x9 | t4] ^ HEAP[xE | t5] ^ HEAP[xB | t6] ^ HEAP[xD | t7];
- sA = HEAP[xD | t0] ^ HEAP[x9 | t1] ^ HEAP[xE | t2] ^ HEAP[xB | t3];
- sB = HEAP[xB | tC] ^ HEAP[xD | tD] ^ HEAP[x9 | tE] ^ HEAP[xE | tF];
- sC = HEAP[xE | tC] ^ HEAP[xB | tD] ^ HEAP[xD | tE] ^ HEAP[x9 | tF];
- sD = HEAP[x9 | t8] ^ HEAP[xE | t9] ^ HEAP[xB | tA] ^ HEAP[xD | tB];
- sE = HEAP[xD | t4] ^ HEAP[x9 | t5] ^ HEAP[xE | t6] ^ HEAP[xB | t7];
- sF = HEAP[xB | t0] ^ HEAP[xD | t1] ^ HEAP[x9 | t2] ^ HEAP[xE | t3];
- t0 = HEAP[inv_sbox | s0] ^ RA0;
- t1 = HEAP[inv_sbox | s1] ^ RA1;
- t2 = HEAP[inv_sbox | s2] ^ RA2;
- t3 = HEAP[inv_sbox | s3] ^ RA3;
- t4 = HEAP[inv_sbox | s4] ^ RA4;
- t5 = HEAP[inv_sbox | s5] ^ RA5;
- t6 = HEAP[inv_sbox | s6] ^ RA6;
- t7 = HEAP[inv_sbox | s7] ^ RA7;
- t8 = HEAP[inv_sbox | s8] ^ RA8;
- t9 = HEAP[inv_sbox | s9] ^ RA9;
- tA = HEAP[inv_sbox | sA] ^ RAA;
- tB = HEAP[inv_sbox | sB] ^ RAB;
- tC = HEAP[inv_sbox | sC] ^ RAC;
- tD = HEAP[inv_sbox | sD] ^ RAD;
- tE = HEAP[inv_sbox | sE] ^ RAE;
- tF = HEAP[inv_sbox | sF] ^ RAF;
- s0 = HEAP[xE | t0] ^ HEAP[xB | t1] ^ HEAP[xD | t2] ^ HEAP[x9 | t3];
- s1 = HEAP[x9 | tC] ^ HEAP[xE | tD] ^ HEAP[xB | tE] ^ HEAP[xD | tF];
- s2 = HEAP[xD | t8] ^ HEAP[x9 | t9] ^ HEAP[xE | tA] ^ HEAP[xB | tB];
- s3 = HEAP[xB | t4] ^ HEAP[xD | t5] ^ HEAP[x9 | t6] ^ HEAP[xE | t7];
- s4 = HEAP[xE | t4] ^ HEAP[xB | t5] ^ HEAP[xD | t6] ^ HEAP[x9 | t7];
- s5 = HEAP[x9 | t0] ^ HEAP[xE | t1] ^ HEAP[xB | t2] ^ HEAP[xD | t3];
- s6 = HEAP[xD | tC] ^ HEAP[x9 | tD] ^ HEAP[xE | tE] ^ HEAP[xB | tF];
- s7 = HEAP[xB | t8] ^ HEAP[xD | t9] ^ HEAP[x9 | tA] ^ HEAP[xE | tB];
- s8 = HEAP[xE | t8] ^ HEAP[xB | t9] ^ HEAP[xD | tA] ^ HEAP[x9 | tB];
- s9 = HEAP[x9 | t4] ^ HEAP[xE | t5] ^ HEAP[xB | t6] ^ HEAP[xD | t7];
- sA = HEAP[xD | t0] ^ HEAP[x9 | t1] ^ HEAP[xE | t2] ^ HEAP[xB | t3];
- sB = HEAP[xB | tC] ^ HEAP[xD | tD] ^ HEAP[x9 | tE] ^ HEAP[xE | tF];
- sC = HEAP[xE | tC] ^ HEAP[xB | tD] ^ HEAP[xD | tE] ^ HEAP[x9 | tF];
- sD = HEAP[x9 | t8] ^ HEAP[xE | t9] ^ HEAP[xB | tA] ^ HEAP[xD | tB];
- sE = HEAP[xD | t4] ^ HEAP[x9 | t5] ^ HEAP[xE | t6] ^ HEAP[xB | t7];
- sF = HEAP[xB | t0] ^ HEAP[xD | t1] ^ HEAP[x9 | t2] ^ HEAP[xE | t3];
- t0 = HEAP[inv_sbox | s0] ^ R90;
- t1 = HEAP[inv_sbox | s1] ^ R91;
- t2 = HEAP[inv_sbox | s2] ^ R92;
- t3 = HEAP[inv_sbox | s3] ^ R93;
- t4 = HEAP[inv_sbox | s4] ^ R94;
- t5 = HEAP[inv_sbox | s5] ^ R95;
- t6 = HEAP[inv_sbox | s6] ^ R96;
- t7 = HEAP[inv_sbox | s7] ^ R97;
- t8 = HEAP[inv_sbox | s8] ^ R98;
- t9 = HEAP[inv_sbox | s9] ^ R99;
- tA = HEAP[inv_sbox | sA] ^ R9A;
- tB = HEAP[inv_sbox | sB] ^ R9B;
- tC = HEAP[inv_sbox | sC] ^ R9C;
- tD = HEAP[inv_sbox | sD] ^ R9D;
- tE = HEAP[inv_sbox | sE] ^ R9E;
- tF = HEAP[inv_sbox | sF] ^ R9F;
- } else {
- t0 = HEAP[inv_sbox | s0 ^ RA0] ^ R90;
- t1 = HEAP[inv_sbox | sD ^ RAD] ^ R91;
- t2 = HEAP[inv_sbox | sA ^ RAA] ^ R92;
- t3 = HEAP[inv_sbox | s7 ^ RA7] ^ R93;
- t4 = HEAP[inv_sbox | s4 ^ RA4] ^ R94;
- t5 = HEAP[inv_sbox | s1 ^ RA1] ^ R95;
- t6 = HEAP[inv_sbox | sE ^ RAE] ^ R96;
- t7 = HEAP[inv_sbox | sB ^ RAB] ^ R97;
- t8 = HEAP[inv_sbox | s8 ^ RA8] ^ R98;
- t9 = HEAP[inv_sbox | s5 ^ RA5] ^ R99;
- tA = HEAP[inv_sbox | s2 ^ RA2] ^ R9A;
- tB = HEAP[inv_sbox | sF ^ RAF] ^ R9B;
- tC = HEAP[inv_sbox | sC ^ RAC] ^ R9C;
- tD = HEAP[inv_sbox | s9 ^ RA9] ^ R9D;
- tE = HEAP[inv_sbox | s6 ^ RA6] ^ R9E;
- tF = HEAP[inv_sbox | s3 ^ RA3] ^ R9F;
- }
- s0 = HEAP[xE | t0] ^ HEAP[xB | t1] ^ HEAP[xD | t2] ^ HEAP[x9 | t3];
- s1 = HEAP[x9 | tC] ^ HEAP[xE | tD] ^ HEAP[xB | tE] ^ HEAP[xD | tF];
- s2 = HEAP[xD | t8] ^ HEAP[x9 | t9] ^ HEAP[xE | tA] ^ HEAP[xB | tB];
- s3 = HEAP[xB | t4] ^ HEAP[xD | t5] ^ HEAP[x9 | t6] ^ HEAP[xE | t7];
- s4 = HEAP[xE | t4] ^ HEAP[xB | t5] ^ HEAP[xD | t6] ^ HEAP[x9 | t7];
- s5 = HEAP[x9 | t0] ^ HEAP[xE | t1] ^ HEAP[xB | t2] ^ HEAP[xD | t3];
- s6 = HEAP[xD | tC] ^ HEAP[x9 | tD] ^ HEAP[xE | tE] ^ HEAP[xB | tF];
- s7 = HEAP[xB | t8] ^ HEAP[xD | t9] ^ HEAP[x9 | tA] ^ HEAP[xE | tB];
- s8 = HEAP[xE | t8] ^ HEAP[xB | t9] ^ HEAP[xD | tA] ^ HEAP[x9 | tB];
- s9 = HEAP[x9 | t4] ^ HEAP[xE | t5] ^ HEAP[xB | t6] ^ HEAP[xD | t7];
- sA = HEAP[xD | t0] ^ HEAP[x9 | t1] ^ HEAP[xE | t2] ^ HEAP[xB | t3];
- sB = HEAP[xB | tC] ^ HEAP[xD | tD] ^ HEAP[x9 | tE] ^ HEAP[xE | tF];
- sC = HEAP[xE | tC] ^ HEAP[xB | tD] ^ HEAP[xD | tE] ^ HEAP[x9 | tF];
- sD = HEAP[x9 | t8] ^ HEAP[xE | t9] ^ HEAP[xB | tA] ^ HEAP[xD | tB];
- sE = HEAP[xD | t4] ^ HEAP[x9 | t5] ^ HEAP[xE | t6] ^ HEAP[xB | t7];
- sF = HEAP[xB | t0] ^ HEAP[xD | t1] ^ HEAP[x9 | t2] ^ HEAP[xE | t3];
- t0 = HEAP[inv_sbox | s0] ^ R80;
- t1 = HEAP[inv_sbox | s1] ^ R81;
- t2 = HEAP[inv_sbox | s2] ^ R82;
- t3 = HEAP[inv_sbox | s3] ^ R83;
- t4 = HEAP[inv_sbox | s4] ^ R84;
- t5 = HEAP[inv_sbox | s5] ^ R85;
- t6 = HEAP[inv_sbox | s6] ^ R86;
- t7 = HEAP[inv_sbox | s7] ^ R87;
- t8 = HEAP[inv_sbox | s8] ^ R88;
- t9 = HEAP[inv_sbox | s9] ^ R89;
- tA = HEAP[inv_sbox | sA] ^ R8A;
- tB = HEAP[inv_sbox | sB] ^ R8B;
- tC = HEAP[inv_sbox | sC] ^ R8C;
- tD = HEAP[inv_sbox | sD] ^ R8D;
- tE = HEAP[inv_sbox | sE] ^ R8E;
- tF = HEAP[inv_sbox | sF] ^ R8F;
- s0 = HEAP[xE | t0] ^ HEAP[xB | t1] ^ HEAP[xD | t2] ^ HEAP[x9 | t3];
- s1 = HEAP[x9 | tC] ^ HEAP[xE | tD] ^ HEAP[xB | tE] ^ HEAP[xD | tF];
- s2 = HEAP[xD | t8] ^ HEAP[x9 | t9] ^ HEAP[xE | tA] ^ HEAP[xB | tB];
- s3 = HEAP[xB | t4] ^ HEAP[xD | t5] ^ HEAP[x9 | t6] ^ HEAP[xE | t7];
- s4 = HEAP[xE | t4] ^ HEAP[xB | t5] ^ HEAP[xD | t6] ^ HEAP[x9 | t7];
- s5 = HEAP[x9 | t0] ^ HEAP[xE | t1] ^ HEAP[xB | t2] ^ HEAP[xD | t3];
- s6 = HEAP[xD | tC] ^ HEAP[x9 | tD] ^ HEAP[xE | tE] ^ HEAP[xB | tF];
- s7 = HEAP[xB | t8] ^ HEAP[xD | t9] ^ HEAP[x9 | tA] ^ HEAP[xE | tB];
- s8 = HEAP[xE | t8] ^ HEAP[xB | t9] ^ HEAP[xD | tA] ^ HEAP[x9 | tB];
- s9 = HEAP[x9 | t4] ^ HEAP[xE | t5] ^ HEAP[xB | t6] ^ HEAP[xD | t7];
- sA = HEAP[xD | t0] ^ HEAP[x9 | t1] ^ HEAP[xE | t2] ^ HEAP[xB | t3];
- sB = HEAP[xB | tC] ^ HEAP[xD | tD] ^ HEAP[x9 | tE] ^ HEAP[xE | tF];
- sC = HEAP[xE | tC] ^ HEAP[xB | tD] ^ HEAP[xD | tE] ^ HEAP[x9 | tF];
- sD = HEAP[x9 | t8] ^ HEAP[xE | t9] ^ HEAP[xB | tA] ^ HEAP[xD | tB];
- sE = HEAP[xD | t4] ^ HEAP[x9 | t5] ^ HEAP[xE | t6] ^ HEAP[xB | t7];
- sF = HEAP[xB | t0] ^ HEAP[xD | t1] ^ HEAP[x9 | t2] ^ HEAP[xE | t3];
- t0 = HEAP[inv_sbox | s0] ^ R70;
- t1 = HEAP[inv_sbox | s1] ^ R71;
- t2 = HEAP[inv_sbox | s2] ^ R72;
- t3 = HEAP[inv_sbox | s3] ^ R73;
- t4 = HEAP[inv_sbox | s4] ^ R74;
- t5 = HEAP[inv_sbox | s5] ^ R75;
- t6 = HEAP[inv_sbox | s6] ^ R76;
- t7 = HEAP[inv_sbox | s7] ^ R77;
- t8 = HEAP[inv_sbox | s8] ^ R78;
- t9 = HEAP[inv_sbox | s9] ^ R79;
- tA = HEAP[inv_sbox | sA] ^ R7A;
- tB = HEAP[inv_sbox | sB] ^ R7B;
- tC = HEAP[inv_sbox | sC] ^ R7C;
- tD = HEAP[inv_sbox | sD] ^ R7D;
- tE = HEAP[inv_sbox | sE] ^ R7E;
- tF = HEAP[inv_sbox | sF] ^ R7F;
- s0 = HEAP[xE | t0] ^ HEAP[xB | t1] ^ HEAP[xD | t2] ^ HEAP[x9 | t3];
- s1 = HEAP[x9 | tC] ^ HEAP[xE | tD] ^ HEAP[xB | tE] ^ HEAP[xD | tF];
- s2 = HEAP[xD | t8] ^ HEAP[x9 | t9] ^ HEAP[xE | tA] ^ HEAP[xB | tB];
- s3 = HEAP[xB | t4] ^ HEAP[xD | t5] ^ HEAP[x9 | t6] ^ HEAP[xE | t7];
- s4 = HEAP[xE | t4] ^ HEAP[xB | t5] ^ HEAP[xD | t6] ^ HEAP[x9 | t7];
- s5 = HEAP[x9 | t0] ^ HEAP[xE | t1] ^ HEAP[xB | t2] ^ HEAP[xD | t3];
- s6 = HEAP[xD | tC] ^ HEAP[x9 | tD] ^ HEAP[xE | tE] ^ HEAP[xB | tF];
- s7 = HEAP[xB | t8] ^ HEAP[xD | t9] ^ HEAP[x9 | tA] ^ HEAP[xE | tB];
- s8 = HEAP[xE | t8] ^ HEAP[xB | t9] ^ HEAP[xD | tA] ^ HEAP[x9 | tB];
- s9 = HEAP[x9 | t4] ^ HEAP[xE | t5] ^ HEAP[xB | t6] ^ HEAP[xD | t7];
- sA = HEAP[xD | t0] ^ HEAP[x9 | t1] ^ HEAP[xE | t2] ^ HEAP[xB | t3];
- sB = HEAP[xB | tC] ^ HEAP[xD | tD] ^ HEAP[x9 | tE] ^ HEAP[xE | tF];
- sC = HEAP[xE | tC] ^ HEAP[xB | tD] ^ HEAP[xD | tE] ^ HEAP[x9 | tF];
- sD = HEAP[x9 | t8] ^ HEAP[xE | t9] ^ HEAP[xB | tA] ^ HEAP[xD | tB];
- sE = HEAP[xD | t4] ^ HEAP[x9 | t5] ^ HEAP[xE | t6] ^ HEAP[xB | t7];
- sF = HEAP[xB | t0] ^ HEAP[xD | t1] ^ HEAP[x9 | t2] ^ HEAP[xE | t3];
- t0 = HEAP[inv_sbox | s0] ^ R60;
- t1 = HEAP[inv_sbox | s1] ^ R61;
- t2 = HEAP[inv_sbox | s2] ^ R62;
- t3 = HEAP[inv_sbox | s3] ^ R63;
- t4 = HEAP[inv_sbox | s4] ^ R64;
- t5 = HEAP[inv_sbox | s5] ^ R65;
- t6 = HEAP[inv_sbox | s6] ^ R66;
- t7 = HEAP[inv_sbox | s7] ^ R67;
- t8 = HEAP[inv_sbox | s8] ^ R68;
- t9 = HEAP[inv_sbox | s9] ^ R69;
- tA = HEAP[inv_sbox | sA] ^ R6A;
- tB = HEAP[inv_sbox | sB] ^ R6B;
- tC = HEAP[inv_sbox | sC] ^ R6C;
- tD = HEAP[inv_sbox | sD] ^ R6D;
- tE = HEAP[inv_sbox | sE] ^ R6E;
- tF = HEAP[inv_sbox | sF] ^ R6F;
- s0 = HEAP[xE | t0] ^ HEAP[xB | t1] ^ HEAP[xD | t2] ^ HEAP[x9 | t3];
- s1 = HEAP[x9 | tC] ^ HEAP[xE | tD] ^ HEAP[xB | tE] ^ HEAP[xD | tF];
- s2 = HEAP[xD | t8] ^ HEAP[x9 | t9] ^ HEAP[xE | tA] ^ HEAP[xB | tB];
- s3 = HEAP[xB | t4] ^ HEAP[xD | t5] ^ HEAP[x9 | t6] ^ HEAP[xE | t7];
- s4 = HEAP[xE | t4] ^ HEAP[xB | t5] ^ HEAP[xD | t6] ^ HEAP[x9 | t7];
- s5 = HEAP[x9 | t0] ^ HEAP[xE | t1] ^ HEAP[xB | t2] ^ HEAP[xD | t3];
- s6 = HEAP[xD | tC] ^ HEAP[x9 | tD] ^ HEAP[xE | tE] ^ HEAP[xB | tF];
- s7 = HEAP[xB | t8] ^ HEAP[xD | t9] ^ HEAP[x9 | tA] ^ HEAP[xE | tB];
- s8 = HEAP[xE | t8] ^ HEAP[xB | t9] ^ HEAP[xD | tA] ^ HEAP[x9 | tB];
- s9 = HEAP[x9 | t4] ^ HEAP[xE | t5] ^ HEAP[xB | t6] ^ HEAP[xD | t7];
- sA = HEAP[xD | t0] ^ HEAP[x9 | t1] ^ HEAP[xE | t2] ^ HEAP[xB | t3];
- sB = HEAP[xB | tC] ^ HEAP[xD | tD] ^ HEAP[x9 | tE] ^ HEAP[xE | tF];
- sC = HEAP[xE | tC] ^ HEAP[xB | tD] ^ HEAP[xD | tE] ^ HEAP[x9 | tF];
- sD = HEAP[x9 | t8] ^ HEAP[xE | t9] ^ HEAP[xB | tA] ^ HEAP[xD | tB];
- sE = HEAP[xD | t4] ^ HEAP[x9 | t5] ^ HEAP[xE | t6] ^ HEAP[xB | t7];
- sF = HEAP[xB | t0] ^ HEAP[xD | t1] ^ HEAP[x9 | t2] ^ HEAP[xE | t3];
- t0 = HEAP[inv_sbox | s0] ^ R50;
- t1 = HEAP[inv_sbox | s1] ^ R51;
- t2 = HEAP[inv_sbox | s2] ^ R52;
- t3 = HEAP[inv_sbox | s3] ^ R53;
- t4 = HEAP[inv_sbox | s4] ^ R54;
- t5 = HEAP[inv_sbox | s5] ^ R55;
- t6 = HEAP[inv_sbox | s6] ^ R56;
- t7 = HEAP[inv_sbox | s7] ^ R57;
- t8 = HEAP[inv_sbox | s8] ^ R58;
- t9 = HEAP[inv_sbox | s9] ^ R59;
- tA = HEAP[inv_sbox | sA] ^ R5A;
- tB = HEAP[inv_sbox | sB] ^ R5B;
- tC = HEAP[inv_sbox | sC] ^ R5C;
- tD = HEAP[inv_sbox | sD] ^ R5D;
- tE = HEAP[inv_sbox | sE] ^ R5E;
- tF = HEAP[inv_sbox | sF] ^ R5F;
- s0 = HEAP[xE | t0] ^ HEAP[xB | t1] ^ HEAP[xD | t2] ^ HEAP[x9 | t3];
- s1 = HEAP[x9 | tC] ^ HEAP[xE | tD] ^ HEAP[xB | tE] ^ HEAP[xD | tF];
- s2 = HEAP[xD | t8] ^ HEAP[x9 | t9] ^ HEAP[xE | tA] ^ HEAP[xB | tB];
- s3 = HEAP[xB | t4] ^ HEAP[xD | t5] ^ HEAP[x9 | t6] ^ HEAP[xE | t7];
- s4 = HEAP[xE | t4] ^ HEAP[xB | t5] ^ HEAP[xD | t6] ^ HEAP[x9 | t7];
- s5 = HEAP[x9 | t0] ^ HEAP[xE | t1] ^ HEAP[xB | t2] ^ HEAP[xD | t3];
- s6 = HEAP[xD | tC] ^ HEAP[x9 | tD] ^ HEAP[xE | tE] ^ HEAP[xB | tF];
- s7 = HEAP[xB | t8] ^ HEAP[xD | t9] ^ HEAP[x9 | tA] ^ HEAP[xE | tB];
- s8 = HEAP[xE | t8] ^ HEAP[xB | t9] ^ HEAP[xD | tA] ^ HEAP[x9 | tB];
- s9 = HEAP[x9 | t4] ^ HEAP[xE | t5] ^ HEAP[xB | t6] ^ HEAP[xD | t7];
- sA = HEAP[xD | t0] ^ HEAP[x9 | t1] ^ HEAP[xE | t2] ^ HEAP[xB | t3];
- sB = HEAP[xB | tC] ^ HEAP[xD | tD] ^ HEAP[x9 | tE] ^ HEAP[xE | tF];
- sC = HEAP[xE | tC] ^ HEAP[xB | tD] ^ HEAP[xD | tE] ^ HEAP[x9 | tF];
- sD = HEAP[x9 | t8] ^ HEAP[xE | t9] ^ HEAP[xB | tA] ^ HEAP[xD | tB];
- sE = HEAP[xD | t4] ^ HEAP[x9 | t5] ^ HEAP[xE | t6] ^ HEAP[xB | t7];
- sF = HEAP[xB | t0] ^ HEAP[xD | t1] ^ HEAP[x9 | t2] ^ HEAP[xE | t3];
- t0 = HEAP[inv_sbox | s0] ^ R40;
- t1 = HEAP[inv_sbox | s1] ^ R41;
- t2 = HEAP[inv_sbox | s2] ^ R42;
- t3 = HEAP[inv_sbox | s3] ^ R43;
- t4 = HEAP[inv_sbox | s4] ^ R44;
- t5 = HEAP[inv_sbox | s5] ^ R45;
- t6 = HEAP[inv_sbox | s6] ^ R46;
- t7 = HEAP[inv_sbox | s7] ^ R47;
- t8 = HEAP[inv_sbox | s8] ^ R48;
- t9 = HEAP[inv_sbox | s9] ^ R49;
- tA = HEAP[inv_sbox | sA] ^ R4A;
- tB = HEAP[inv_sbox | sB] ^ R4B;
- tC = HEAP[inv_sbox | sC] ^ R4C;
- tD = HEAP[inv_sbox | sD] ^ R4D;
- tE = HEAP[inv_sbox | sE] ^ R4E;
- tF = HEAP[inv_sbox | sF] ^ R4F;
- s0 = HEAP[xE | t0] ^ HEAP[xB | t1] ^ HEAP[xD | t2] ^ HEAP[x9 | t3];
- s1 = HEAP[x9 | tC] ^ HEAP[xE | tD] ^ HEAP[xB | tE] ^ HEAP[xD | tF];
- s2 = HEAP[xD | t8] ^ HEAP[x9 | t9] ^ HEAP[xE | tA] ^ HEAP[xB | tB];
- s3 = HEAP[xB | t4] ^ HEAP[xD | t5] ^ HEAP[x9 | t6] ^ HEAP[xE | t7];
- s4 = HEAP[xE | t4] ^ HEAP[xB | t5] ^ HEAP[xD | t6] ^ HEAP[x9 | t7];
- s5 = HEAP[x9 | t0] ^ HEAP[xE | t1] ^ HEAP[xB | t2] ^ HEAP[xD | t3];
- s6 = HEAP[xD | tC] ^ HEAP[x9 | tD] ^ HEAP[xE | tE] ^ HEAP[xB | tF];
- s7 = HEAP[xB | t8] ^ HEAP[xD | t9] ^ HEAP[x9 | tA] ^ HEAP[xE | tB];
- s8 = HEAP[xE | t8] ^ HEAP[xB | t9] ^ HEAP[xD | tA] ^ HEAP[x9 | tB];
- s9 = HEAP[x9 | t4] ^ HEAP[xE | t5] ^ HEAP[xB | t6] ^ HEAP[xD | t7];
- sA = HEAP[xD | t0] ^ HEAP[x9 | t1] ^ HEAP[xE | t2] ^ HEAP[xB | t3];
- sB = HEAP[xB | tC] ^ HEAP[xD | tD] ^ HEAP[x9 | tE] ^ HEAP[xE | tF];
- sC = HEAP[xE | tC] ^ HEAP[xB | tD] ^ HEAP[xD | tE] ^ HEAP[x9 | tF];
- sD = HEAP[x9 | t8] ^ HEAP[xE | t9] ^ HEAP[xB | tA] ^ HEAP[xD | tB];
- sE = HEAP[xD | t4] ^ HEAP[x9 | t5] ^ HEAP[xE | t6] ^ HEAP[xB | t7];
- sF = HEAP[xB | t0] ^ HEAP[xD | t1] ^ HEAP[x9 | t2] ^ HEAP[xE | t3];
- t0 = HEAP[inv_sbox | s0] ^ R30;
- t1 = HEAP[inv_sbox | s1] ^ R31;
- t2 = HEAP[inv_sbox | s2] ^ R32;
- t3 = HEAP[inv_sbox | s3] ^ R33;
- t4 = HEAP[inv_sbox | s4] ^ R34;
- t5 = HEAP[inv_sbox | s5] ^ R35;
- t6 = HEAP[inv_sbox | s6] ^ R36;
- t7 = HEAP[inv_sbox | s7] ^ R37;
- t8 = HEAP[inv_sbox | s8] ^ R38;
- t9 = HEAP[inv_sbox | s9] ^ R39;
- tA = HEAP[inv_sbox | sA] ^ R3A;
- tB = HEAP[inv_sbox | sB] ^ R3B;
- tC = HEAP[inv_sbox | sC] ^ R3C;
- tD = HEAP[inv_sbox | sD] ^ R3D;
- tE = HEAP[inv_sbox | sE] ^ R3E;
- tF = HEAP[inv_sbox | sF] ^ R3F;
- s0 = HEAP[xE | t0] ^ HEAP[xB | t1] ^ HEAP[xD | t2] ^ HEAP[x9 | t3];
- s1 = HEAP[x9 | tC] ^ HEAP[xE | tD] ^ HEAP[xB | tE] ^ HEAP[xD | tF];
- s2 = HEAP[xD | t8] ^ HEAP[x9 | t9] ^ HEAP[xE | tA] ^ HEAP[xB | tB];
- s3 = HEAP[xB | t4] ^ HEAP[xD | t5] ^ HEAP[x9 | t6] ^ HEAP[xE | t7];
- s4 = HEAP[xE | t4] ^ HEAP[xB | t5] ^ HEAP[xD | t6] ^ HEAP[x9 | t7];
- s5 = HEAP[x9 | t0] ^ HEAP[xE | t1] ^ HEAP[xB | t2] ^ HEAP[xD | t3];
- s6 = HEAP[xD | tC] ^ HEAP[x9 | tD] ^ HEAP[xE | tE] ^ HEAP[xB | tF];
- s7 = HEAP[xB | t8] ^ HEAP[xD | t9] ^ HEAP[x9 | tA] ^ HEAP[xE | tB];
- s8 = HEAP[xE | t8] ^ HEAP[xB | t9] ^ HEAP[xD | tA] ^ HEAP[x9 | tB];
- s9 = HEAP[x9 | t4] ^ HEAP[xE | t5] ^ HEAP[xB | t6] ^ HEAP[xD | t7];
- sA = HEAP[xD | t0] ^ HEAP[x9 | t1] ^ HEAP[xE | t2] ^ HEAP[xB | t3];
- sB = HEAP[xB | tC] ^ HEAP[xD | tD] ^ HEAP[x9 | tE] ^ HEAP[xE | tF];
- sC = HEAP[xE | tC] ^ HEAP[xB | tD] ^ HEAP[xD | tE] ^ HEAP[x9 | tF];
- sD = HEAP[x9 | t8] ^ HEAP[xE | t9] ^ HEAP[xB | tA] ^ HEAP[xD | tB];
- sE = HEAP[xD | t4] ^ HEAP[x9 | t5] ^ HEAP[xE | t6] ^ HEAP[xB | t7];
- sF = HEAP[xB | t0] ^ HEAP[xD | t1] ^ HEAP[x9 | t2] ^ HEAP[xE | t3];
- t0 = HEAP[inv_sbox | s0] ^ R20;
- t1 = HEAP[inv_sbox | s1] ^ R21;
- t2 = HEAP[inv_sbox | s2] ^ R22;
- t3 = HEAP[inv_sbox | s3] ^ R23;
- t4 = HEAP[inv_sbox | s4] ^ R24;
- t5 = HEAP[inv_sbox | s5] ^ R25;
- t6 = HEAP[inv_sbox | s6] ^ R26;
- t7 = HEAP[inv_sbox | s7] ^ R27;
- t8 = HEAP[inv_sbox | s8] ^ R28;
- t9 = HEAP[inv_sbox | s9] ^ R29;
- tA = HEAP[inv_sbox | sA] ^ R2A;
- tB = HEAP[inv_sbox | sB] ^ R2B;
- tC = HEAP[inv_sbox | sC] ^ R2C;
- tD = HEAP[inv_sbox | sD] ^ R2D;
- tE = HEAP[inv_sbox | sE] ^ R2E;
- tF = HEAP[inv_sbox | sF] ^ R2F;
- s0 = HEAP[xE | t0] ^ HEAP[xB | t1] ^ HEAP[xD | t2] ^ HEAP[x9 | t3];
- s1 = HEAP[x9 | tC] ^ HEAP[xE | tD] ^ HEAP[xB | tE] ^ HEAP[xD | tF];
- s2 = HEAP[xD | t8] ^ HEAP[x9 | t9] ^ HEAP[xE | tA] ^ HEAP[xB | tB];
- s3 = HEAP[xB | t4] ^ HEAP[xD | t5] ^ HEAP[x9 | t6] ^ HEAP[xE | t7];
- s4 = HEAP[xE | t4] ^ HEAP[xB | t5] ^ HEAP[xD | t6] ^ HEAP[x9 | t7];
- s5 = HEAP[x9 | t0] ^ HEAP[xE | t1] ^ HEAP[xB | t2] ^ HEAP[xD | t3];
- s6 = HEAP[xD | tC] ^ HEAP[x9 | tD] ^ HEAP[xE | tE] ^ HEAP[xB | tF];
- s7 = HEAP[xB | t8] ^ HEAP[xD | t9] ^ HEAP[x9 | tA] ^ HEAP[xE | tB];
- s8 = HEAP[xE | t8] ^ HEAP[xB | t9] ^ HEAP[xD | tA] ^ HEAP[x9 | tB];
- s9 = HEAP[x9 | t4] ^ HEAP[xE | t5] ^ HEAP[xB | t6] ^ HEAP[xD | t7];
- sA = HEAP[xD | t0] ^ HEAP[x9 | t1] ^ HEAP[xE | t2] ^ HEAP[xB | t3];
- sB = HEAP[xB | tC] ^ HEAP[xD | tD] ^ HEAP[x9 | tE] ^ HEAP[xE | tF];
- sC = HEAP[xE | tC] ^ HEAP[xB | tD] ^ HEAP[xD | tE] ^ HEAP[x9 | tF];
- sD = HEAP[x9 | t8] ^ HEAP[xE | t9] ^ HEAP[xB | tA] ^ HEAP[xD | tB];
- sE = HEAP[xD | t4] ^ HEAP[x9 | t5] ^ HEAP[xE | t6] ^ HEAP[xB | t7];
- sF = HEAP[xB | t0] ^ HEAP[xD | t1] ^ HEAP[x9 | t2] ^ HEAP[xE | t3];
- t0 = HEAP[inv_sbox | s0] ^ R10;
- t1 = HEAP[inv_sbox | s1] ^ R11;
- t2 = HEAP[inv_sbox | s2] ^ R12;
- t3 = HEAP[inv_sbox | s3] ^ R13;
- t4 = HEAP[inv_sbox | s4] ^ R14;
- t5 = HEAP[inv_sbox | s5] ^ R15;
- t6 = HEAP[inv_sbox | s6] ^ R16;
- t7 = HEAP[inv_sbox | s7] ^ R17;
- t8 = HEAP[inv_sbox | s8] ^ R18;
- t9 = HEAP[inv_sbox | s9] ^ R19;
- tA = HEAP[inv_sbox | sA] ^ R1A;
- tB = HEAP[inv_sbox | sB] ^ R1B;
- tC = HEAP[inv_sbox | sC] ^ R1C;
- tD = HEAP[inv_sbox | sD] ^ R1D;
- tE = HEAP[inv_sbox | sE] ^ R1E;
- tF = HEAP[inv_sbox | sF] ^ R1F;
- s0 = HEAP[xE | t0] ^ HEAP[xB | t1] ^ HEAP[xD | t2] ^ HEAP[x9 | t3];
- s1 = HEAP[x9 | tC] ^ HEAP[xE | tD] ^ HEAP[xB | tE] ^ HEAP[xD | tF];
- s2 = HEAP[xD | t8] ^ HEAP[x9 | t9] ^ HEAP[xE | tA] ^ HEAP[xB | tB];
- s3 = HEAP[xB | t4] ^ HEAP[xD | t5] ^ HEAP[x9 | t6] ^ HEAP[xE | t7];
- s4 = HEAP[xE | t4] ^ HEAP[xB | t5] ^ HEAP[xD | t6] ^ HEAP[x9 | t7];
- s5 = HEAP[x9 | t0] ^ HEAP[xE | t1] ^ HEAP[xB | t2] ^ HEAP[xD | t3];
- s6 = HEAP[xD | tC] ^ HEAP[x9 | tD] ^ HEAP[xE | tE] ^ HEAP[xB | tF];
- s7 = HEAP[xB | t8] ^ HEAP[xD | t9] ^ HEAP[x9 | tA] ^ HEAP[xE | tB];
- s8 = HEAP[xE | t8] ^ HEAP[xB | t9] ^ HEAP[xD | tA] ^ HEAP[x9 | tB];
- s9 = HEAP[x9 | t4] ^ HEAP[xE | t5] ^ HEAP[xB | t6] ^ HEAP[xD | t7];
- sA = HEAP[xD | t0] ^ HEAP[x9 | t1] ^ HEAP[xE | t2] ^ HEAP[xB | t3];
- sB = HEAP[xB | tC] ^ HEAP[xD | tD] ^ HEAP[x9 | tE] ^ HEAP[xE | tF];
- sC = HEAP[xE | tC] ^ HEAP[xB | tD] ^ HEAP[xD | tE] ^ HEAP[x9 | tF];
- sD = HEAP[x9 | t8] ^ HEAP[xE | t9] ^ HEAP[xB | tA] ^ HEAP[xD | tB];
- sE = HEAP[xD | t4] ^ HEAP[x9 | t5] ^ HEAP[xE | t6] ^ HEAP[xB | t7];
- sF = HEAP[xB | t0] ^ HEAP[xD | t1] ^ HEAP[x9 | t2] ^ HEAP[xE | t3];
- S0 = HEAP[inv_sbox | s0] ^ R00;
- S1 = HEAP[inv_sbox | s1] ^ R01;
- S2 = HEAP[inv_sbox | s2] ^ R02;
- S3 = HEAP[inv_sbox | s3] ^ R03;
- S4 = HEAP[inv_sbox | s4] ^ R04;
- S5 = HEAP[inv_sbox | s5] ^ R05;
- S6 = HEAP[inv_sbox | s6] ^ R06;
- S7 = HEAP[inv_sbox | s7] ^ R07;
- S8 = HEAP[inv_sbox | s8] ^ R08;
- S9 = HEAP[inv_sbox | s9] ^ R09;
- SA = HEAP[inv_sbox | sA] ^ R0A;
- SB = HEAP[inv_sbox | sB] ^ R0B;
- SC = HEAP[inv_sbox | sC] ^ R0C;
- SD = HEAP[inv_sbox | sD] ^ R0D;
- SE = HEAP[inv_sbox | sE] ^ R0E;
- SF = HEAP[inv_sbox | sF] ^ R0F;
- }
- function init_state(s0, s1, s2, s3, s4, s5, s6, s7, s8, s9, sA, sB, sC, sD, sE, sF) {
- s0 = s0 | 0;
- s1 = s1 | 0;
- s2 = s2 | 0;
- s3 = s3 | 0;
- s4 = s4 | 0;
- s5 = s5 | 0;
- s6 = s6 | 0;
- s7 = s7 | 0;
- s8 = s8 | 0;
- s9 = s9 | 0;
- sA = sA | 0;
- sB = sB | 0;
- sC = sC | 0;
- sD = sD | 0;
- sE = sE | 0;
- sF = sF | 0;
- S0 = s0;
- S1 = s1;
- S2 = s2;
- S3 = s3;
- S4 = s4;
- S5 = s5;
- S6 = s6;
- S7 = s7;
- S8 = s8;
- S9 = s9;
- SA = sA;
- SB = sB;
- SC = sC;
- SD = sD;
- SE = sE;
- SF = sF;
- }
- function save_state(offset) {
- offset = offset | 0;
- HEAP[offset] = S0;
- HEAP[offset | 1] = S1;
- HEAP[offset | 2] = S2;
- HEAP[offset | 3] = S3;
- HEAP[offset | 4] = S4;
- HEAP[offset | 5] = S5;
- HEAP[offset | 6] = S6;
- HEAP[offset | 7] = S7;
- HEAP[offset | 8] = S8;
- HEAP[offset | 9] = S9;
- HEAP[offset | 10] = SA;
- HEAP[offset | 11] = SB;
- HEAP[offset | 12] = SC;
- HEAP[offset | 13] = SD;
- HEAP[offset | 14] = SE;
- HEAP[offset | 15] = SF;
- }
- function init_key_128(k0, k1, k2, k3, k4, k5, k6, k7, k8, k9, kA, kB, kC, kD, kE, kF) {
- k0 = k0 | 0;
- k1 = k1 | 0;
- k2 = k2 | 0;
- k3 = k3 | 0;
- k4 = k4 | 0;
- k5 = k5 | 0;
- k6 = k6 | 0;
- k7 = k7 | 0;
- k8 = k8 | 0;
- k9 = k9 | 0;
- kA = kA | 0;
- kB = kB | 0;
- kC = kC | 0;
- kD = kD | 0;
- kE = kE | 0;
- kF = kF | 0;
- R00 = k0;
- R01 = k1;
- R02 = k2;
- R03 = k3;
- R04 = k4;
- R05 = k5;
- R06 = k6;
- R07 = k7;
- R08 = k8;
- R09 = k9;
- R0A = kA;
- R0B = kB;
- R0C = kC;
- R0D = kD;
- R0E = kE;
- R0F = kF;
- keySize = 16;
- _expand_key_128();
- }
- function init_key_256(k00, k01, k02, k03, k04, k05, k06, k07, k08, k09, k0A, k0B, k0C, k0D, k0E, k0F, k10, k11, k12, k13, k14, k15, k16, k17, k18, k19, k1A, k1B, k1C, k1D, k1E, k1F) {
- k00 = k00 | 0;
- k01 = k01 | 0;
- k02 = k02 | 0;
- k03 = k03 | 0;
- k04 = k04 | 0;
- k05 = k05 | 0;
- k06 = k06 | 0;
- k07 = k07 | 0;
- k08 = k08 | 0;
- k09 = k09 | 0;
- k0A = k0A | 0;
- k0B = k0B | 0;
- k0C = k0C | 0;
- k0D = k0D | 0;
- k0E = k0E | 0;
- k0F = k0F | 0;
- k10 = k10 | 0;
- k11 = k11 | 0;
- k12 = k12 | 0;
- k13 = k13 | 0;
- k14 = k14 | 0;
- k15 = k15 | 0;
- k16 = k16 | 0;
- k17 = k17 | 0;
- k18 = k18 | 0;
- k19 = k19 | 0;
- k1A = k1A | 0;
- k1B = k1B | 0;
- k1C = k1C | 0;
- k1D = k1D | 0;
- k1E = k1E | 0;
- k1F = k1F | 0;
- R00 = k00;
- R01 = k01;
- R02 = k02;
- R03 = k03;
- R04 = k04;
- R05 = k05;
- R06 = k06;
- R07 = k07;
- R08 = k08;
- R09 = k09;
- R0A = k0A;
- R0B = k0B;
- R0C = k0C;
- R0D = k0D;
- R0E = k0E;
- R0F = k0F;
- R10 = k10;
- R11 = k11;
- R12 = k12;
- R13 = k13;
- R14 = k14;
- R15 = k15;
- R16 = k16;
- R17 = k17;
- R18 = k18;
- R19 = k19;
- R1A = k1A;
- R1B = k1B;
- R1C = k1C;
- R1D = k1D;
- R1E = k1E;
- R1F = k1F;
- keySize = 32;
- _expand_key_256();
- }
- function cbc_encrypt(offset, length) {
- offset = offset | 0;
- length = length | 0;
- var encrypted = 0;
- if (offset & 15) return -1;
- while ((length | 0) >= 16) {
- _encrypt(S0 ^ HEAP[offset], S1 ^ HEAP[offset | 1], S2 ^ HEAP[offset | 2], S3 ^ HEAP[offset | 3], S4 ^ HEAP[offset | 4], S5 ^ HEAP[offset | 5], S6 ^ HEAP[offset | 6], S7 ^ HEAP[offset | 7], S8 ^ HEAP[offset | 8], S9 ^ HEAP[offset | 9], SA ^ HEAP[offset | 10], SB ^ HEAP[offset | 11], SC ^ HEAP[offset | 12], SD ^ HEAP[offset | 13], SE ^ HEAP[offset | 14], SF ^ HEAP[offset | 15]);
- HEAP[offset] = S0;
- HEAP[offset | 1] = S1;
- HEAP[offset | 2] = S2;
- HEAP[offset | 3] = S3;
- HEAP[offset | 4] = S4;
- HEAP[offset | 5] = S5;
- HEAP[offset | 6] = S6;
- HEAP[offset | 7] = S7;
- HEAP[offset | 8] = S8;
- HEAP[offset | 9] = S9;
- HEAP[offset | 10] = SA;
- HEAP[offset | 11] = SB;
- HEAP[offset | 12] = SC;
- HEAP[offset | 13] = SD;
- HEAP[offset | 14] = SE;
- HEAP[offset | 15] = SF;
- offset = offset + 16 | 0;
- length = length - 16 | 0;
- encrypted = encrypted + 16 | 0;
- }
- return encrypted | 0;
- }
- function cbc_decrypt(offset, length) {
- offset = offset | 0;
- length = length | 0;
- var iv0 = 0, iv1 = 0, iv2 = 0, iv3 = 0, iv4 = 0, iv5 = 0, iv6 = 0, iv7 = 0, iv8 = 0, iv9 = 0, ivA = 0, ivB = 0, ivC = 0, ivD = 0, ivE = 0, ivF = 0, decrypted = 0;
- if (offset & 15) return -1;
- iv0 = S0;
- iv1 = S1;
- iv2 = S2;
- iv3 = S3;
- iv4 = S4;
- iv5 = S5;
- iv6 = S6;
- iv7 = S7;
- iv8 = S8;
- iv9 = S9;
- ivA = SA;
- ivB = SB;
- ivC = SC;
- ivD = SD;
- ivE = SE;
- ivF = SF;
- while ((length | 0) >= 16) {
- _decrypt(HEAP[offset] | 0, HEAP[offset | 1] | 0, HEAP[offset | 2] | 0, HEAP[offset | 3] | 0, HEAP[offset | 4] | 0, HEAP[offset | 5] | 0, HEAP[offset | 6] | 0, HEAP[offset | 7] | 0, HEAP[offset | 8] | 0, HEAP[offset | 9] | 0, HEAP[offset | 10] | 0, HEAP[offset | 11] | 0, HEAP[offset | 12] | 0, HEAP[offset | 13] | 0, HEAP[offset | 14] | 0, HEAP[offset | 15] | 0);
- S0 = S0 ^ iv0;
- iv0 = HEAP[offset] | 0;
- S1 = S1 ^ iv1;
- iv1 = HEAP[offset | 1] | 0;
- S2 = S2 ^ iv2;
- iv2 = HEAP[offset | 2] | 0;
- S3 = S3 ^ iv3;
- iv3 = HEAP[offset | 3] | 0;
- S4 = S4 ^ iv4;
- iv4 = HEAP[offset | 4] | 0;
- S5 = S5 ^ iv5;
- iv5 = HEAP[offset | 5] | 0;
- S6 = S6 ^ iv6;
- iv6 = HEAP[offset | 6] | 0;
- S7 = S7 ^ iv7;
- iv7 = HEAP[offset | 7] | 0;
- S8 = S8 ^ iv8;
- iv8 = HEAP[offset | 8] | 0;
- S9 = S9 ^ iv9;
- iv9 = HEAP[offset | 9] | 0;
- SA = SA ^ ivA;
- ivA = HEAP[offset | 10] | 0;
- SB = SB ^ ivB;
- ivB = HEAP[offset | 11] | 0;
- SC = SC ^ ivC;
- ivC = HEAP[offset | 12] | 0;
- SD = SD ^ ivD;
- ivD = HEAP[offset | 13] | 0;
- SE = SE ^ ivE;
- ivE = HEAP[offset | 14] | 0;
- SF = SF ^ ivF;
- ivF = HEAP[offset | 15] | 0;
- HEAP[offset] = S0;
- HEAP[offset | 1] = S1;
- HEAP[offset | 2] = S2;
- HEAP[offset | 3] = S3;
- HEAP[offset | 4] = S4;
- HEAP[offset | 5] = S5;
- HEAP[offset | 6] = S6;
- HEAP[offset | 7] = S7;
- HEAP[offset | 8] = S8;
- HEAP[offset | 9] = S9;
- HEAP[offset | 10] = SA;
- HEAP[offset | 11] = SB;
- HEAP[offset | 12] = SC;
- HEAP[offset | 13] = SD;
- HEAP[offset | 14] = SE;
- HEAP[offset | 15] = SF;
- offset = offset + 16 | 0;
- length = length - 16 | 0;
- decrypted = decrypted + 16 | 0;
- }
- S0 = iv0;
- S1 = iv1;
- S2 = iv2;
- S3 = iv3;
- S4 = iv4;
- S5 = iv5;
- S6 = iv6;
- S7 = iv7;
- S8 = iv8;
- S9 = iv9;
- SA = ivA;
- SB = ivB;
- SC = ivC;
- SD = ivD;
- SE = ivE;
- SF = ivF;
- return decrypted | 0;
- }
- function cbc_mac(offset, length, output) {
- offset = offset | 0;
- length = length | 0;
- output = output | 0;
- if (offset & 15) return -1;
- if (~output) if (output & 31) return -1;
- while ((length | 0) >= 16) {
- _encrypt(S0 ^ HEAP[offset], S1 ^ HEAP[offset | 1], S2 ^ HEAP[offset | 2], S3 ^ HEAP[offset | 3], S4 ^ HEAP[offset | 4], S5 ^ HEAP[offset | 5], S6 ^ HEAP[offset | 6], S7 ^ HEAP[offset | 7], S8 ^ HEAP[offset | 8], S9 ^ HEAP[offset | 9], SA ^ HEAP[offset | 10], SB ^ HEAP[offset | 11], SC ^ HEAP[offset | 12], SD ^ HEAP[offset | 13], SE ^ HEAP[offset | 14], SF ^ HEAP[offset | 15]);
- offset = offset + 16 | 0;
- length = length - 16 | 0;
- }
- if ((length | 0) > 0) {
- S0 = S0 ^ HEAP[offset];
- if ((length | 0) > 1) S1 = S1 ^ HEAP[offset | 1];
- if ((length | 0) > 2) S2 = S2 ^ HEAP[offset | 2];
- if ((length | 0) > 3) S3 = S3 ^ HEAP[offset | 3];
- if ((length | 0) > 4) S4 = S4 ^ HEAP[offset | 4];
- if ((length | 0) > 5) S5 = S5 ^ HEAP[offset | 5];
- if ((length | 0) > 6) S6 = S6 ^ HEAP[offset | 6];
- if ((length | 0) > 7) S7 = S7 ^ HEAP[offset | 7];
- if ((length | 0) > 8) S8 = S8 ^ HEAP[offset | 8];
- if ((length | 0) > 9) S9 = S9 ^ HEAP[offset | 9];
- if ((length | 0) > 10) SA = SA ^ HEAP[offset | 10];
- if ((length | 0) > 11) SB = SB ^ HEAP[offset | 11];
- if ((length | 0) > 12) SC = SC ^ HEAP[offset | 12];
- if ((length | 0) > 13) SD = SD ^ HEAP[offset | 13];
- if ((length | 0) > 14) SE = SE ^ HEAP[offset | 14];
- _encrypt(S0, S1, S2, S3, S4, S5, S6, S7, S8, S9, SA, SB, SC, SD, SE, SF);
- offset = offset + length | 0;
- length = 0;
- }
- if (~output) {
- HEAP[output | 0] = S0;
- HEAP[output | 1] = S1;
- HEAP[output | 2] = S2;
- HEAP[output | 3] = S3;
- HEAP[output | 4] = S4;
- HEAP[output | 5] = S5;
- HEAP[output | 6] = S6;
- HEAP[output | 7] = S7;
- HEAP[output | 8] = S8;
- HEAP[output | 9] = S9;
- HEAP[output | 10] = SA;
- HEAP[output | 11] = SB;
- HEAP[output | 12] = SC;
- HEAP[output | 13] = SD;
- HEAP[output | 14] = SE;
- HEAP[output | 15] = SF;
- }
- return 0;
- }
- function ccm_encrypt(offset, length, nonce0, nonce1, nonce2, nonce3, nonce4, nonce5, nonce6, nonce7, nonce8, nonce9, nonceA, nonceB, nonceC, nonceD, counter0, counter1) {
- offset = offset | 0;
- length = length | 0;
- nonce0 = nonce0 | 0;
- nonce1 = nonce1 | 0;
- nonce2 = nonce2 | 0;
- nonce3 = nonce3 | 0;
- nonce4 = nonce4 | 0;
- nonce5 = nonce5 | 0;
- nonce6 = nonce6 | 0;
- nonce7 = nonce7 | 0;
- nonce8 = nonce8 | 0;
- nonce9 = nonce9 | 0;
- nonceA = nonceA | 0;
- nonceB = nonceB | 0;
- nonceC = nonceC | 0;
- nonceD = nonceD | 0;
- counter0 = counter0 | 0;
- counter1 = counter1 | 0;
- var iv0 = 0, iv1 = 0, iv2 = 0, iv3 = 0, iv4 = 0, iv5 = 0, iv6 = 0, iv7 = 0, iv8 = 0, iv9 = 0, ivA = 0, ivB = 0, ivC = 0, ivD = 0, ivE = 0, ivF = 0, s0 = 0, s1 = 0, s2 = 0, s3 = 0, s4 = 0, s5 = 0, s6 = 0, s7 = 0, s8 = 0, s9 = 0, sA = 0, sB = 0, sC = 0, sD = 0, sE = 0, sF = 0, encrypted = 0;
- if (offset & 15) return -1;
- iv0 = S0, iv1 = S1, iv2 = S2, iv3 = S3, iv4 = S4, iv5 = S5, iv6 = S6, iv7 = S7,
- iv8 = S8, iv9 = S9, ivA = SA, ivB = SB, ivC = SC, ivD = SD, ivE = SE, ivF = SF;
- while ((length | 0) >= 16) {
- s0 = HEAP[offset] | 0;
- s1 = HEAP[offset | 1] | 0;
- s2 = HEAP[offset | 2] | 0;
- s3 = HEAP[offset | 3] | 0;
- s4 = HEAP[offset | 4] | 0;
- s5 = HEAP[offset | 5] | 0;
- s6 = HEAP[offset | 6] | 0;
- s7 = HEAP[offset | 7] | 0;
- s8 = HEAP[offset | 8] | 0;
- s9 = HEAP[offset | 9] | 0;
- sA = HEAP[offset | 10] | 0;
- sB = HEAP[offset | 11] | 0;
- sC = HEAP[offset | 12] | 0;
- sD = HEAP[offset | 13] | 0;
- sE = HEAP[offset | 14] | 0;
- sF = HEAP[offset | 15] | 0;
- _encrypt(nonce0, nonce1, nonce2, nonce3, nonce4, nonce5, nonce6, nonce7, nonce8 ^ counter0 >>> 24, nonce9 ^ counter0 >>> 16 & 255, nonceA ^ counter0 >>> 8 & 255, nonceB ^ counter0 & 255, nonceC ^ counter1 >>> 24, nonceD ^ counter1 >>> 16 & 255, counter1 >>> 8 & 255, counter1 & 255);
- HEAP[offset] = s0 ^ S0;
- HEAP[offset | 1] = s1 ^ S1;
- HEAP[offset | 2] = s2 ^ S2;
- HEAP[offset | 3] = s3 ^ S3;
- HEAP[offset | 4] = s4 ^ S4;
- HEAP[offset | 5] = s5 ^ S5;
- HEAP[offset | 6] = s6 ^ S6;
- HEAP[offset | 7] = s7 ^ S7;
- HEAP[offset | 8] = s8 ^ S8;
- HEAP[offset | 9] = s9 ^ S9;
- HEAP[offset | 10] = sA ^ SA;
- HEAP[offset | 11] = sB ^ SB;
- HEAP[offset | 12] = sC ^ SC;
- HEAP[offset | 13] = sD ^ SD;
- HEAP[offset | 14] = sE ^ SE;
- HEAP[offset | 15] = sF ^ SF;
- _encrypt(s0 ^ iv0, s1 ^ iv1, s2 ^ iv2, s3 ^ iv3, s4 ^ iv4, s5 ^ iv5, s6 ^ iv6, s7 ^ iv7, s8 ^ iv8, s9 ^ iv9, sA ^ ivA, sB ^ ivB, sC ^ ivC, sD ^ ivD, sE ^ ivE, sF ^ ivF);
- iv0 = S0, iv1 = S1, iv2 = S2, iv3 = S3, iv4 = S4, iv5 = S5, iv6 = S6, iv7 = S7,
- iv8 = S8, iv9 = S9, ivA = SA, ivB = SB, ivC = SC, ivD = SD, ivE = SE, ivF = SF;
- encrypted = encrypted + 16 | 0;
- offset = offset + 16 | 0;
- length = length - 16 | 0;
- counter1 = counter1 + 1 | 0;
- if ((counter1 | 0) == 0) counter0 = counter0 + 1 | 0;
- }
- if ((length | 0) > 0) {
- s0 = HEAP[offset] | 0;
- s1 = (length | 0) > 1 ? HEAP[offset | 1] | 0 : 0;
- s2 = (length | 0) > 2 ? HEAP[offset | 2] | 0 : 0;
- s3 = (length | 0) > 3 ? HEAP[offset | 3] | 0 : 0;
- s4 = (length | 0) > 4 ? HEAP[offset | 4] | 0 : 0;
- s5 = (length | 0) > 5 ? HEAP[offset | 5] | 0 : 0;
- s6 = (length | 0) > 6 ? HEAP[offset | 6] | 0 : 0;
- s7 = (length | 0) > 7 ? HEAP[offset | 7] | 0 : 0;
- s8 = (length | 0) > 8 ? HEAP[offset | 8] | 0 : 0;
- s9 = (length | 0) > 9 ? HEAP[offset | 9] | 0 : 0;
- sA = (length | 0) > 10 ? HEAP[offset | 10] | 0 : 0;
- sB = (length | 0) > 11 ? HEAP[offset | 11] | 0 : 0;
- sC = (length | 0) > 12 ? HEAP[offset | 12] | 0 : 0;
- sD = (length | 0) > 13 ? HEAP[offset | 13] | 0 : 0;
- sE = (length | 0) > 14 ? HEAP[offset | 14] | 0 : 0;
- _encrypt(nonce0, nonce1, nonce2, nonce3, nonce4, nonce5, nonce6, nonce7, nonce8 ^ counter0 >>> 24, nonce9 ^ counter0 >>> 16 & 255, nonceA ^ counter0 >>> 8 & 255, nonceB ^ counter0 & 255, nonceC ^ counter1 >>> 24, nonceD ^ counter1 >>> 16 & 255, counter1 >>> 8 & 255, counter1 & 255);
- HEAP[offset] = s0 ^ S0;
- if ((length | 0) > 1) HEAP[offset | 1] = s1 ^ S1;
- if ((length | 0) > 2) HEAP[offset | 2] = s2 ^ S2;
- if ((length | 0) > 3) HEAP[offset | 3] = s3 ^ S3;
- if ((length | 0) > 4) HEAP[offset | 4] = s4 ^ S4;
- if ((length | 0) > 5) HEAP[offset | 5] = s5 ^ S5;
- if ((length | 0) > 6) HEAP[offset | 6] = s6 ^ S6;
- if ((length | 0) > 7) HEAP[offset | 7] = s7 ^ S7;
- if ((length | 0) > 8) HEAP[offset | 8] = s8 ^ S8;
- if ((length | 0) > 9) HEAP[offset | 9] = s9 ^ S9;
- if ((length | 0) > 10) HEAP[offset | 10] = sA ^ SA;
- if ((length | 0) > 11) HEAP[offset | 11] = sB ^ SB;
- if ((length | 0) > 12) HEAP[offset | 12] = sC ^ SC;
- if ((length | 0) > 13) HEAP[offset | 13] = sD ^ SD;
- if ((length | 0) > 14) HEAP[offset | 14] = sE ^ SE;
- _encrypt(s0 ^ iv0, s1 ^ iv1, s2 ^ iv2, s3 ^ iv3, s4 ^ iv4, s5 ^ iv5, s6 ^ iv6, s7 ^ iv7, s8 ^ iv8, s9 ^ iv9, sA ^ ivA, sB ^ ivB, sC ^ ivC, sD ^ ivD, sE ^ ivE, ivF);
- iv0 = S0, iv1 = S1, iv2 = S2, iv3 = S3, iv4 = S4, iv5 = S5, iv6 = S6, iv7 = S7,
- iv8 = S8, iv9 = S9, ivA = SA, ivB = SB, ivC = SC, ivD = SD, ivE = SE, ivF = SF;
- encrypted = encrypted + length | 0;
- offset = offset + length | 0;
- length = 0;
- counter1 = counter1 + 1 | 0;
- if ((counter1 | 0) == 0) counter0 = counter0 + 1 | 0;
- }
- return encrypted | 0;
- }
- function ccm_decrypt(offset, length, nonce0, nonce1, nonce2, nonce3, nonce4, nonce5, nonce6, nonce7, nonce8, nonce9, nonceA, nonceB, nonceC, nonceD, counter0, counter1) {
- offset = offset | 0;
- length = length | 0;
- nonce0 = nonce0 | 0;
- nonce1 = nonce1 | 0;
- nonce2 = nonce2 | 0;
- nonce3 = nonce3 | 0;
- nonce4 = nonce4 | 0;
- nonce5 = nonce5 | 0;
- nonce6 = nonce6 | 0;
- nonce7 = nonce7 | 0;
- nonce8 = nonce8 | 0;
- nonce9 = nonce9 | 0;
- nonceA = nonceA | 0;
- nonceB = nonceB | 0;
- nonceC = nonceC | 0;
- nonceD = nonceD | 0;
- counter0 = counter0 | 0;
- counter1 = counter1 | 0;
- var iv0 = 0, iv1 = 0, iv2 = 0, iv3 = 0, iv4 = 0, iv5 = 0, iv6 = 0, iv7 = 0, iv8 = 0, iv9 = 0, ivA = 0, ivB = 0, ivC = 0, ivD = 0, ivE = 0, ivF = 0, s0 = 0, s1 = 0, s2 = 0, s3 = 0, s4 = 0, s5 = 0, s6 = 0, s7 = 0, s8 = 0, s9 = 0, sA = 0, sB = 0, sC = 0, sD = 0, sE = 0, sF = 0, decrypted = 0;
- if (offset & 15) return -1;
- iv0 = S0, iv1 = S1, iv2 = S2, iv3 = S3, iv4 = S4, iv5 = S5, iv6 = S6, iv7 = S7,
- iv8 = S8, iv9 = S9, ivA = SA, ivB = SB, ivC = SC, ivD = SD, ivE = SE, ivF = SF;
- while ((length | 0) >= 16) {
- _encrypt(nonce0, nonce1, nonce2, nonce3, nonce4, nonce5, nonce6, nonce7, nonce8 ^ counter0 >>> 24, nonce9 ^ counter0 >>> 16 & 255, nonceA ^ counter0 >>> 8 & 255, nonceB ^ counter0 & 255, nonceC ^ counter1 >>> 24, nonceD ^ counter1 >>> 16 & 255, counter1 >>> 8 & 255, counter1 & 255);
- HEAP[offset] = s0 = HEAP[offset] ^ S0;
- HEAP[offset | 1] = s1 = HEAP[offset | 1] ^ S1;
- HEAP[offset | 2] = s2 = HEAP[offset | 2] ^ S2;
- HEAP[offset | 3] = s3 = HEAP[offset | 3] ^ S3;
- HEAP[offset | 4] = s4 = HEAP[offset | 4] ^ S4;
- HEAP[offset | 5] = s5 = HEAP[offset | 5] ^ S5;
- HEAP[offset | 6] = s6 = HEAP[offset | 6] ^ S6;
- HEAP[offset | 7] = s7 = HEAP[offset | 7] ^ S7;
- HEAP[offset | 8] = s8 = HEAP[offset | 8] ^ S8;
- HEAP[offset | 9] = s9 = HEAP[offset | 9] ^ S9;
- HEAP[offset | 10] = sA = HEAP[offset | 10] ^ SA;
- HEAP[offset | 11] = sB = HEAP[offset | 11] ^ SB;
- HEAP[offset | 12] = sC = HEAP[offset | 12] ^ SC;
- HEAP[offset | 13] = sD = HEAP[offset | 13] ^ SD;
- HEAP[offset | 14] = sE = HEAP[offset | 14] ^ SE;
- HEAP[offset | 15] = sF = HEAP[offset | 15] ^ SF;
- _encrypt(s0 ^ iv0, s1 ^ iv1, s2 ^ iv2, s3 ^ iv3, s4 ^ iv4, s5 ^ iv5, s6 ^ iv6, s7 ^ iv7, s8 ^ iv8, s9 ^ iv9, sA ^ ivA, sB ^ ivB, sC ^ ivC, sD ^ ivD, sE ^ ivE, sF ^ ivF);
- iv0 = S0, iv1 = S1, iv2 = S2, iv3 = S3, iv4 = S4, iv5 = S5, iv6 = S6, iv7 = S7,
- iv8 = S8, iv9 = S9, ivA = SA, ivB = SB, ivC = SC, ivD = SD, ivE = SE, ivF = SF;
- decrypted = decrypted + 16 | 0;
- offset = offset + 16 | 0;
- length = length - 16 | 0;
- counter1 = counter1 + 1 | 0;
- if ((counter1 | 0) == 0) counter0 = counter0 + 1 | 0;
- }
- if ((length | 0) > 0) {
- _encrypt(nonce0, nonce1, nonce2, nonce3, nonce4, nonce5, nonce6, nonce7, nonce8 ^ counter0 >>> 24, nonce9 ^ counter0 >>> 16 & 255, nonceA ^ counter0 >>> 8 & 255, nonceB ^ counter0 & 255, nonceC ^ counter1 >>> 24, nonceD ^ counter1 >>> 16 & 255, counter1 >>> 8 & 255, counter1 & 255);
- s0 = HEAP[offset] ^ S0;
- s1 = (length | 0) > 1 ? HEAP[offset | 1] ^ S1 : 0;
- s2 = (length | 0) > 2 ? HEAP[offset | 2] ^ S2 : 0;
- s3 = (length | 0) > 3 ? HEAP[offset | 3] ^ S3 : 0;
- s4 = (length | 0) > 4 ? HEAP[offset | 4] ^ S4 : 0;
- s5 = (length | 0) > 5 ? HEAP[offset | 5] ^ S5 : 0;
- s6 = (length | 0) > 6 ? HEAP[offset | 6] ^ S6 : 0;
- s7 = (length | 0) > 7 ? HEAP[offset | 7] ^ S7 : 0;
- s8 = (length | 0) > 8 ? HEAP[offset | 8] ^ S8 : 0;
- s9 = (length | 0) > 9 ? HEAP[offset | 9] ^ S9 : 0;
- sA = (length | 0) > 10 ? HEAP[offset | 10] ^ SA : 0;
- sB = (length | 0) > 11 ? HEAP[offset | 11] ^ SB : 0;
- sC = (length | 0) > 12 ? HEAP[offset | 12] ^ SC : 0;
- sD = (length | 0) > 13 ? HEAP[offset | 13] ^ SD : 0;
- sE = (length | 0) > 14 ? HEAP[offset | 14] ^ SE : 0;
- sF = (length | 0) > 15 ? HEAP[offset | 15] ^ SF : 0;
- HEAP[offset] = s0;
- if ((length | 0) > 1) HEAP[offset | 1] = s1;
- if ((length | 0) > 2) HEAP[offset | 2] = s2;
- if ((length | 0) > 3) HEAP[offset | 3] = s3;
- if ((length | 0) > 4) HEAP[offset | 4] = s4;
- if ((length | 0) > 5) HEAP[offset | 5] = s5;
- if ((length | 0) > 6) HEAP[offset | 6] = s6;
- if ((length | 0) > 7) HEAP[offset | 7] = s7;
- if ((length | 0) > 8) HEAP[offset | 8] = s8;
- if ((length | 0) > 9) HEAP[offset | 9] = s9;
- if ((length | 0) > 10) HEAP[offset | 10] = sA;
- if ((length | 0) > 11) HEAP[offset | 11] = sB;
- if ((length | 0) > 12) HEAP[offset | 12] = sC;
- if ((length | 0) > 13) HEAP[offset | 13] = sD;
- if ((length | 0) > 14) HEAP[offset | 14] = sE;
- _encrypt(s0 ^ iv0, s1 ^ iv1, s2 ^ iv2, s3 ^ iv3, s4 ^ iv4, s5 ^ iv5, s6 ^ iv6, s7 ^ iv7, s8 ^ iv8, s9 ^ iv9, sA ^ ivA, sB ^ ivB, sC ^ ivC, sD ^ ivD, sE ^ ivE, sF ^ ivF);
- iv0 = S0, iv1 = S1, iv2 = S2, iv3 = S3, iv4 = S4, iv5 = S5, iv6 = S6, iv7 = S7,
- iv8 = S8, iv9 = S9, ivA = SA, ivB = SB, ivC = SC, ivD = SD, ivE = SE, ivF = SF;
- decrypted = decrypted + length | 0;
- offset = offset + length | 0;
- length = 0;
- counter1 = counter1 + 1 | 0;
- if ((counter1 | 0) == 0) counter0 = counter0 + 1 | 0;
- }
- return decrypted | 0;
- }
- function cfb_encrypt(offset, length) {
- offset = offset | 0;
- length = length | 0;
- var encrypted = 0;
- if (offset & 15) return -1;
- while ((length | 0) >= 16) {
- _encrypt(S0, S1, S2, S3, S4, S5, S6, S7, S8, S9, SA, SB, SC, SD, SE, SF);
- S0 = S0 ^ HEAP[offset];
- S1 = S1 ^ HEAP[offset | 1];
- S2 = S2 ^ HEAP[offset | 2];
- S3 = S3 ^ HEAP[offset | 3];
- S4 = S4 ^ HEAP[offset | 4];
- S5 = S5 ^ HEAP[offset | 5];
- S6 = S6 ^ HEAP[offset | 6];
- S7 = S7 ^ HEAP[offset | 7];
- S8 = S8 ^ HEAP[offset | 8];
- S9 = S9 ^ HEAP[offset | 9];
- SA = SA ^ HEAP[offset | 10];
- SB = SB ^ HEAP[offset | 11];
- SC = SC ^ HEAP[offset | 12];
- SD = SD ^ HEAP[offset | 13];
- SE = SE ^ HEAP[offset | 14];
- SF = SF ^ HEAP[offset | 15];
- HEAP[offset] = S0;
- HEAP[offset | 1] = S1;
- HEAP[offset | 2] = S2;
- HEAP[offset | 3] = S3;
- HEAP[offset | 4] = S4;
- HEAP[offset | 5] = S5;
- HEAP[offset | 6] = S6;
- HEAP[offset | 7] = S7;
- HEAP[offset | 8] = S8;
- HEAP[offset | 9] = S9;
- HEAP[offset | 10] = SA;
- HEAP[offset | 11] = SB;
- HEAP[offset | 12] = SC;
- HEAP[offset | 13] = SD;
- HEAP[offset | 14] = SE;
- HEAP[offset | 15] = SF;
- offset = offset + 16 | 0;
- length = length - 16 | 0;
- encrypted = encrypted + 16 | 0;
- }
- if ((length | 0) > 0) {
- _encrypt(S0, S1, S2, S3, S4, S5, S6, S7, S8, S9, SA, SB, SC, SD, SE, SF);
- HEAP[offset] = HEAP[offset] ^ S0;
- if ((length | 0) > 1) HEAP[offset | 1] = HEAP[offset | 1] ^ S1;
- if ((length | 0) > 2) HEAP[offset | 2] = HEAP[offset | 2] ^ S2;
- if ((length | 0) > 3) HEAP[offset | 3] = HEAP[offset | 3] ^ S3;
- if ((length | 0) > 4) HEAP[offset | 4] = HEAP[offset | 4] ^ S4;
- if ((length | 0) > 5) HEAP[offset | 5] = HEAP[offset | 5] ^ S5;
- if ((length | 0) > 6) HEAP[offset | 6] = HEAP[offset | 6] ^ S6;
- if ((length | 0) > 7) HEAP[offset | 7] = HEAP[offset | 7] ^ S7;
- if ((length | 0) > 8) HEAP[offset | 8] = HEAP[offset | 8] ^ S8;
- if ((length | 0) > 9) HEAP[offset | 9] = HEAP[offset | 9] ^ S9;
- if ((length | 0) > 10) HEAP[offset | 10] = HEAP[offset | 10] ^ SA;
- if ((length | 0) > 11) HEAP[offset | 11] = HEAP[offset | 11] ^ SB;
- if ((length | 0) > 12) HEAP[offset | 12] = HEAP[offset | 12] ^ SC;
- if ((length | 0) > 13) HEAP[offset | 13] = HEAP[offset | 13] ^ SD;
- if ((length | 0) > 14) HEAP[offset | 14] = HEAP[offset | 14] ^ SE;
- encrypted = encrypted + length | 0;
- offset = offset + length | 0;
- length = 0;
- }
- return encrypted | 0;
- }
- function cfb_decrypt(offset, length) {
- offset = offset | 0;
- length = length | 0;
- var iv0 = 0, iv1 = 0, iv2 = 0, iv3 = 0, iv4 = 0, iv5 = 0, iv6 = 0, iv7 = 0, iv8 = 0, iv9 = 0, ivA = 0, ivB = 0, ivC = 0, ivD = 0, ivE = 0, ivF = 0, decrypted = 0;
- if (offset & 15) return -1;
- while ((length | 0) >= 16) {
- _encrypt(S0, S1, S2, S3, S4, S5, S6, S7, S8, S9, SA, SB, SC, SD, SE, SF);
- iv0 = HEAP[offset] | 0;
- iv1 = HEAP[offset | 1] | 0;
- iv2 = HEAP[offset | 2] | 0;
- iv3 = HEAP[offset | 3] | 0;
- iv4 = HEAP[offset | 4] | 0;
- iv5 = HEAP[offset | 5] | 0;
- iv6 = HEAP[offset | 6] | 0;
- iv7 = HEAP[offset | 7] | 0;
- iv8 = HEAP[offset | 8] | 0;
- iv9 = HEAP[offset | 9] | 0;
- ivA = HEAP[offset | 10] | 0;
- ivB = HEAP[offset | 11] | 0;
- ivC = HEAP[offset | 12] | 0;
- ivD = HEAP[offset | 13] | 0;
- ivE = HEAP[offset | 14] | 0;
- ivF = HEAP[offset | 15] | 0;
- HEAP[offset] = S0 ^ iv0;
- HEAP[offset | 1] = S1 ^ iv1;
- HEAP[offset | 2] = S2 ^ iv2;
- HEAP[offset | 3] = S3 ^ iv3;
- HEAP[offset | 4] = S4 ^ iv4;
- HEAP[offset | 5] = S5 ^ iv5;
- HEAP[offset | 6] = S6 ^ iv6;
- HEAP[offset | 7] = S7 ^ iv7;
- HEAP[offset | 8] = S8 ^ iv8;
- HEAP[offset | 9] = S9 ^ iv9;
- HEAP[offset | 10] = SA ^ ivA;
- HEAP[offset | 11] = SB ^ ivB;
- HEAP[offset | 12] = SC ^ ivC;
- HEAP[offset | 13] = SD ^ ivD;
- HEAP[offset | 14] = SE ^ ivE;
- HEAP[offset | 15] = SF ^ ivF;
- S0 = iv0;
- S1 = iv1;
- S2 = iv2;
- S3 = iv3;
- S4 = iv4;
- S5 = iv5;
- S6 = iv6;
- S7 = iv7;
- S8 = iv8;
- S9 = iv9;
- SA = ivA;
- SB = ivB;
- SC = ivC;
- SD = ivD;
- SE = ivE;
- SF = ivF;
- offset = offset + 16 | 0;
- length = length - 16 | 0;
- decrypted = decrypted + 16 | 0;
- }
- if ((length | 0) > 0) {
- _encrypt(S0, S1, S2, S3, S4, S5, S6, S7, S8, S9, SA, SB, SC, SD, SE, SF);
- HEAP[offset] = HEAP[offset] ^ S0;
- if ((length | 0) > 1) HEAP[offset | 1] = HEAP[offset | 1] ^ S1;
- if ((length | 0) > 2) HEAP[offset | 2] = HEAP[offset | 2] ^ S2;
- if ((length | 0) > 3) HEAP[offset | 3] = HEAP[offset | 3] ^ S3;
- if ((length | 0) > 4) HEAP[offset | 4] = HEAP[offset | 4] ^ S4;
- if ((length | 0) > 5) HEAP[offset | 5] = HEAP[offset | 5] ^ S5;
- if ((length | 0) > 6) HEAP[offset | 6] = HEAP[offset | 6] ^ S6;
- if ((length | 0) > 7) HEAP[offset | 7] = HEAP[offset | 7] ^ S7;
- if ((length | 0) > 8) HEAP[offset | 8] = HEAP[offset | 8] ^ S8;
- if ((length | 0) > 9) HEAP[offset | 9] = HEAP[offset | 9] ^ S9;
- if ((length | 0) > 10) HEAP[offset | 10] = HEAP[offset | 10] ^ SA;
- if ((length | 0) > 11) HEAP[offset | 11] = HEAP[offset | 11] ^ SB;
- if ((length | 0) > 12) HEAP[offset | 12] = HEAP[offset | 12] ^ SC;
- if ((length | 0) > 13) HEAP[offset | 13] = HEAP[offset | 13] ^ SD;
- if ((length | 0) > 14) HEAP[offset | 14] = HEAP[offset | 14] ^ SE;
- decrypted = decrypted + length | 0;
- offset = offset + length | 0;
- length = 0;
- }
- return decrypted | 0;
- }
- return {
- init_state: init_state,
- save_state: save_state,
- init_key_128: init_key_128,
- init_key_256: init_key_256,
- cbc_encrypt: cbc_encrypt,
- cbc_decrypt: cbc_decrypt,
- cbc_mac: cbc_mac,
- ccm_encrypt: ccm_encrypt,
- ccm_decrypt: ccm_decrypt,
- cfb_encrypt: cfb_encrypt,
- cfb_decrypt: cfb_decrypt
- };
- }
- function aes_asm(stdlib, foreign, buffer) {
- var heap = new Uint8Array(buffer);
- heap.set(_aes_tables);
- return _aes_asm(stdlib, foreign, buffer);
- }
- var _aes_block_size = 16;
- function _aes_constructor(options) {
- options = options || {};
- options.heapSize = options.heapSize || 4096;
- if (options.heapSize <= 0 || options.heapSize % 4096) throw new IllegalArgumentError("heapSize must be a positive number and multiple of 4096");
- this.BLOCK_SIZE = _aes_block_size;
- this.heap = options.heap || new Uint8Array(options.heapSize);
- this.asm = options.asm || aes_asm(global, null, this.heap.buffer);
- this.pos = _aes_heap_start;
- this.len = 0;
- this.key = null;
- this.result = null;
- this.reset(options);
- }
- function _aes_reset(options) {
- options = options || {};
- this.result = null;
- this.pos = _aes_heap_start;
- this.len = 0;
- var asm = this.asm;
- var key = options.key;
- if (key !== undefined) {
- if (is_buffer(key) || is_bytes(key)) {
- key = new Uint8Array(key);
- } else if (is_string(key)) {
- var str = key;
- key = new Uint8Array(str.length);
- for (var i = 0; i < str.length; ++i) key[i] = str.charCodeAt(i);
- } else {
- throw new TypeError("unexpected key type");
- }
- if (key.length === 16) {
- this.key = key;
- asm.init_key_128.call(asm, key[0], key[1], key[2], key[3], key[4], key[5], key[6], key[7], key[8], key[9], key[10], key[11], key[12], key[13], key[14], key[15]);
- } else if (key.length === 24) {
- throw new IllegalArgumentError("illegal key size");
- } else if (key.length === 32) {
- this.key = key;
- asm.init_key_256.call(asm, key[0], key[1], key[2], key[3], key[4], key[5], key[6], key[7], key[8], key[9], key[10], key[11], key[12], key[13], key[14], key[15], key[16], key[17], key[18], key[19], key[20], key[21], key[22], key[23], key[24], key[25], key[26], key[27], key[28], key[29], key[30], key[31]);
- } else {
- throw new IllegalArgumentError("illegal key size");
- }
- }
- return this;
- }
- function _aes_init_iv(iv) {
- var asm = this.asm;
- if (iv !== undefined) {
- if (is_buffer(iv) || is_bytes(iv)) {
- iv = new Uint8Array(iv);
- } else if (is_string(iv)) {
- var str = iv;
- iv = new Uint8Array(str.length);
- for (var i = 0; i < str.length; ++i) iv[i] = str.charCodeAt(i);
- } else {
- throw new TypeError("unexpected iv type");
- }
- if (iv.length !== _aes_block_size) throw new IllegalArgumentError("illegal iv size");
- this.iv = iv;
- asm.init_state.call(asm, iv[0], iv[1], iv[2], iv[3], iv[4], iv[5], iv[6], iv[7], iv[8], iv[9], iv[10], iv[11], iv[12], iv[13], iv[14], iv[15]);
- } else {
- this.iv = null;
- asm.init_state.call(asm, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0);
- }
- }
- function _aes_heap_write(heap, hpos, data, dpos, dlen) {
- var hlen = heap.byteLength - hpos, wlen = hlen < dlen ? hlen : dlen;
- if (is_buffer(data) || is_bytes(data)) {
- heap.set(new Uint8Array(data.buffer || data, dpos, wlen), hpos);
- } else if (is_string(data)) {
- for (var i = 0; i < wlen; ++i) heap[hpos + i] = data.charCodeAt(dpos + i);
- } else {
- throw new TypeError("unexpected data type");
- }
- return wlen;
- }
- function cbc_aes_constructor(options) {
- this.padding = true;
- this.mode = "cbc";
- this.iv = null;
- _aes_constructor.call(this, options);
- }
- function cbc_aes_encrypt_constructor(options) {
- cbc_aes_constructor.call(this, options);
- }
- function cbc_aes_decrypt_constructor(options) {
- cbc_aes_constructor.call(this, options);
- }
- function cbc_aes_reset(options) {
- options = options || {};
- _aes_reset.call(this, options);
- var padding = options.padding;
- if (padding !== undefined) {
- this.padding = !!padding;
- } else {
- this.padding = true;
- }
- _aes_init_iv.call(this, options.iv);
- return this;
- }
- function cbc_aes_encrypt_process(data) {
- if (!this.key) throw new IllegalStateError("no key is associated with the instance");
- var dpos = data.byteOffset || 0, dlen = data.byteLength || data.length || 0, asm = this.asm, heap = this.heap, pos = this.pos, len = this.len, rpos = 0, rlen = _aes_block_size * Math.floor((len + dlen) / _aes_block_size), wlen = 0;
- var result = new Uint8Array(rlen);
- while (dlen > 0) {
- wlen = _aes_heap_write(heap, pos + len, data, dpos, dlen);
- len += wlen;
- dpos += wlen;
- dlen -= wlen;
- wlen = asm.cbc_encrypt(pos, len);
- result.set(heap.subarray(pos, pos + wlen), rpos);
- rpos += wlen;
- if (wlen < len) {
- pos += wlen;
- len -= wlen;
- } else {
- pos = _aes_heap_start;
- len = 0;
- }
- }
- this.result = result;
- this.pos = pos;
- this.len = len;
- return this;
- }
- function cbc_aes_encrypt_finish() {
- if (!this.key) throw new IllegalStateError("no key is associated with the instance");
- var asm = this.asm, heap = this.heap, padding = this.padding, pos = this.pos, len = this.len, rlen = _aes_block_size * Math.ceil(len / _aes_block_size);
- if (len % _aes_block_size === 0) {
- if (padding) rlen += _aes_block_size;
- } else if (!padding) {
- throw new IllegalArgumentError("data length must be a multiple of " + _aes_block_size);
- }
- var result = new Uint8Array(rlen);
- if (len < rlen) {
- var plen = _aes_block_size - len % _aes_block_size;
- for (var p = 0; p < plen; ++p) heap[pos + len + p] = plen;
- len += plen;
- }
- asm.cbc_encrypt(pos, len);
- result.set(heap.subarray(pos, pos + len));
- this.result = result;
- this.pos = _aes_heap_start;
- this.len = 0;
- return this;
- }
- function cbc_aes_encrypt(data) {
- var result1 = cbc_aes_encrypt_process.call(this, data).result, result2 = cbc_aes_encrypt_finish.call(this).result, result;
- result = new Uint8Array(result1.length + result2.length);
- result.set(result1);
- result.set(result2, result1.length);
- this.result = result;
- return this;
- }
- function cbc_aes_decrypt_process(data) {
- if (!this.key) throw new IllegalStateError("no key is associated with the instance");
- var dpos = data.byteOffset || 0, dlen = data.byteLength || data.length || 0, asm = this.asm, heap = this.heap, padding = this.padding, pos = this.pos, len = this.len, rpos = 0, rlen = _aes_block_size * Math.floor((len + dlen) / _aes_block_size), wlen = 0;
- var result = new Uint8Array(rlen);
- while (dlen > 0) {
- wlen = _aes_heap_write(heap, pos + len, data, dpos, dlen);
- len += wlen;
- dpos += wlen;
- dlen -= wlen;
- wlen = asm.cbc_decrypt(pos, len - (padding && dlen === 0 && len % _aes_block_size === 0 ? _aes_block_size : 0));
- result.set(heap.subarray(pos, pos + wlen), rpos);
- rpos += wlen;
- if (wlen < len) {
- pos += wlen;
- len -= wlen;
- } else {
- pos = _aes_heap_start;
- len = 0;
- }
- }
- this.result = result.subarray(0, rpos);
- this.pos = pos;
- this.len = len;
- return this;
- }
- function cbc_aes_decrypt_finish() {
- if (!this.key) throw new IllegalStateError("no key is associated with the instance");
- var asm = this.asm, heap = this.heap, padding = this.padding, pos = this.pos, len = this.len;
- if (len === 0) {
- if (!padding) {
- this.result = new Uint8Array(0);
- this.pos = _aes_heap_start;
- this.len = 0;
- return this;
- } else {
- throw new IllegalStateError("padding not found");
- }
- }
- if (len % _aes_block_size !== 0) throw new IllegalArgumentError("data length must be a multiple of " + _aes_block_size);
- var result = new Uint8Array(len);
- asm.cbc_decrypt(pos, len);
- result.set(heap.subarray(pos, pos + len));
- if (padding) {
- var pad = result[len - 1];
- result = result.subarray(0, len - pad);
- }
- this.result = result;
- this.pos = _aes_heap_start;
- this.len = 0;
- return this;
- }
- function cbc_aes_decrypt(data) {
- var result1 = cbc_aes_decrypt_process.call(this, data).result, result2 = cbc_aes_decrypt_finish.call(this).result, result;
- result = new Uint8Array(result1.length + result2.length);
- result.set(result1);
- result.set(result2, result1.length);
- this.result = result;
- return this;
- }
- var cbc_aes_encrypt_prototype = cbc_aes_encrypt_constructor.prototype;
- cbc_aes_encrypt_prototype.reset = cbc_aes_reset;
- cbc_aes_encrypt_prototype.process = cbc_aes_encrypt_process;
- cbc_aes_encrypt_prototype.finish = cbc_aes_encrypt_finish;
- var cbc_aes_decrypt_prototype = cbc_aes_decrypt_constructor.prototype;
- cbc_aes_decrypt_prototype.reset = cbc_aes_reset;
- cbc_aes_decrypt_prototype.process = cbc_aes_decrypt_process;
- cbc_aes_decrypt_prototype.finish = cbc_aes_decrypt_finish;
- var cbc_aes_prototype = cbc_aes_constructor.prototype;
- cbc_aes_prototype.reset = cbc_aes_reset;
- cbc_aes_prototype.encrypt = cbc_aes_encrypt;
- cbc_aes_prototype.decrypt = cbc_aes_decrypt;
- function _cbc_mac_process(data) {
- var dpos = data.byteOffset || 0, dlen = data.byteLength || data.length || 0, wlen = 0;
- while (dlen > 0) {
- wlen = _aes_heap_write(this.heap, _aes_heap_start, data, dpos, dlen);
- this.asm.cbc_mac(_aes_heap_start, wlen, -1);
- dpos += wlen;
- dlen -= wlen;
- }
- }
- var _ccm_adata_maxLength = 65279, _ccm_data_maxLength = 68719476720;
- function ccm_aes_constructor(options) {
- this.padding = false;
- this.mode = "ccm";
- this.tagSize = _aes_block_size;
- this.lengthSize = 4;
- this.nonce = null;
- this.adata = null;
- this.iv = null;
- this.dataLength = -1;
- this.dataLeft = -1;
- this.counter = 1;
- _aes_constructor.call(this, options);
- }
- function ccm_aes_encrypt_constructor(options) {
- ccm_aes_constructor.call(this, options);
- }
- function ccm_aes_decrypt_constructor(options) {
- ccm_aes_constructor.call(this, options);
- }
- function _ccm_calculate_iv() {
- var nonce = this.nonce, adata = this.adata, tagSize = this.tagSize, lengthSize = this.lengthSize, dataLength = this.dataLength;
- var data = new Uint8Array(_aes_block_size + (adata ? 2 + adata.byteLength : 0));
- data[0] = (adata ? 64 : 0) | tagSize - 2 << 2 | lengthSize - 1;
- data.set(nonce, 1);
- if (lengthSize > 4) data[11] = (dataLength - (dataLength >>> 0)) / 4294967296 & 15;
- if (lengthSize > 3) data[12] = dataLength >>> 24;
- if (lengthSize > 2) data[13] = dataLength >>> 16 & 255;
- data[14] = dataLength >>> 8 & 255;
- data[15] = dataLength & 255;
- if (adata) {
- data[16] = adata.byteLength >>> 8 & 255;
- data[17] = adata.byteLength & 255;
- data.set(adata, 18);
- }
- _cbc_mac_process.call(this, data);
- this.asm.save_state(_aes_heap_start);
- this.iv = new Uint8Array(this.heap.subarray(_aes_heap_start, _aes_heap_start + _aes_block_size));
- }
- function ccm_aes_reset(options) {
- options = options || {};
- _aes_reset.call(this, options);
- _aes_init_iv.call(this, options.iv);
- var tagSize = options.tagSize;
- if (tagSize !== undefined) {
- if (!is_number(tagSize)) throw new TypeError("tagSize must be a number");
- if (tagSize < 4 || tagSize > 16 || tagSize & 1) throw new IllegalArgumentError("illegal tagSize value");
- this.tagSize = tagSize;
- } else {
- this.tagSize = _aes_block_size;
- }
- var lengthSize = options.lengthSize, nonce = options.nonce;
- if (nonce !== undefined) {
- if (is_buffer(nonce) || is_bytes(nonce)) {
- nonce = new Uint8Array(nonce);
- } else if (is_string(nonce)) {
- var str = nonce;
- nonce = new Uint8Array(str.length);
- for (var i = 0; i < str.length; ++i) nonce[i] = str.charCodeAt(i);
- } else {
- throw new TypeError("unexpected nonce type");
- }
- if (nonce.length < 10 || nonce.length > 13) throw new IllegalArgumentError("illegal nonce length");
- lengthSize = lengthSize || 15 - nonce.length;
- this.nonce = nonce;
- } else {
- this.nonce = null;
- }
- if (lengthSize !== undefined) {
- if (!is_number(lengthSize)) throw new TypeError("lengthSize must be a number");
- if (lengthSize < 2 || lengthSize > 5 || nonce.length + lengthSize !== 15) throw new IllegalArgumentError("illegal lengthSize value");
- this.lengthSize = lengthSize;
- } else {
- this.lengthSize = lengthSize = 4;
- }
- var iv = this.iv;
- var counter = options.counter;
- if (counter !== undefined) {
- if (iv === null) throw new IllegalStateError("iv is also required");
- if (!is_number(counter)) throw new TypeError("counter must be a number");
- this.counter = counter;
- } else {
- this.counter = 1;
- }
- var dataLength = options.dataLength;
- if (dataLength !== undefined) {
- if (!is_number(dataLength)) throw new TypeError("dataLength must be a number");
- if (dataLength < 0 || dataLength > _ccm_data_maxLength || dataLength > Math.pow(2, 8 * lengthSize) - 1) throw new IllegalArgumentError("illegal dataLength value");
- this.dataLength = dataLength;
- var dataLeft = options.dataLeft || dataLength;
- if (!is_number(dataLeft)) throw new TypeError("dataLeft must be a number");
- if (dataLeft < 0 || dataLeft > dataLength) throw new IllegalArgumentError("illegal dataLeft value");
- this.dataLeft = dataLeft;
- } else {
- this.dataLength = dataLength = -1;
- this.dataLeft = dataLength;
- }
- var adata = options.adata;
- if (adata !== undefined) {
- if (iv !== null) throw new IllegalStateError("you must specify either adata or iv, not both");
- if (is_buffer(adata) || is_bytes(adata)) {
- adata = new Uint8Array(adata);
- } else if (is_string(adata)) {
- var str = adata;
- adata = new Uint8Array(str.length);
- for (var i = 0; i < str.length; ++i) adata[i] = str.charCodeAt(i);
- } else {
- throw new TypeError("unexpected adata type");
- }
- if (adata.byteLength === 0 || adata.byteLength > _ccm_adata_maxLength) throw new IllegalArgumentError("illegal adata length");
- this.adata = adata;
- this.counter = 1;
- } else {
- this.adata = adata = null;
- }
- if (dataLength !== -1) _ccm_calculate_iv.call(this);
- return this;
- }
- function ccm_aes_encrypt_process(data) {
- if (!this.key) throw new IllegalStateError("no key is associated with the instance");
- var dpos = data.byteOffset || 0, dlen = data.byteLength || data.length || 0, asm = this.asm, heap = this.heap, nonce = this.nonce, counter = this.counter, pos = this.pos, len = this.len, rpos = 0, rlen = _aes_block_size * Math.floor((len + dlen) / _aes_block_size), wlen = 0;
- if ((counter - 1 << 4) + len + dlen > _ccm_data_maxLength) throw new RangeError("counter overflow");
- var result = new Uint8Array(rlen);
- var asm_args = [ 0, 0, this.lengthSize - 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 ];
- for (var i = 0; i < nonce.length; i++) asm_args[3 + i] = nonce[i];
- while (dlen > 0) {
- wlen = _aes_heap_write(heap, pos + len, data, dpos, dlen);
- len += wlen;
- dpos += wlen;
- dlen -= wlen;
- asm_args[0] = pos;
- asm_args[1] = len & ~15;
- asm_args[16] = counter / 4294967296 >>> 0;
- asm_args[17] = counter >>> 0;
- wlen = asm.ccm_encrypt.apply(asm, asm_args);
- result.set(heap.subarray(pos, pos + wlen), rpos);
- counter += wlen >>> 4;
- rpos += wlen;
- if (wlen < len) {
- pos += wlen;
- len -= wlen;
- } else {
- pos = _aes_heap_start;
- len = 0;
- }
- }
- this.result = result;
- this.counter = counter;
- this.pos = pos;
- this.len = len;
- return this;
- }
- function ccm_aes_encrypt_finish() {
- if (!this.key) throw new IllegalStateError("no key is associated with the instance");
- var asm = this.asm, heap = this.heap, nonce = this.nonce, counter = this.counter, tagSize = this.tagSize, pos = this.pos, len = this.len, wlen = 0;
- var result = new Uint8Array(len + tagSize);
- var asm_args = [ 0, 0, this.lengthSize - 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 ];
- for (var i = 0; i < nonce.length; i++) asm_args[3 + i] = nonce[i];
- asm_args[0] = pos;
- asm_args[1] = len;
- asm_args[16] = counter / 4294967296 >>> 0;
- asm_args[17] = counter >>> 0;
- wlen = asm.ccm_encrypt.apply(asm, asm_args);
- result.set(heap.subarray(pos, pos + wlen));
- counter = 1;
- pos = _aes_heap_start;
- len = 0;
- asm.save_state(_aes_heap_start);
- asm_args[0] = _aes_heap_start, asm_args[1] = _aes_block_size, asm_args[16] = 0;
- asm_args[17] = 0;
- asm.ccm_encrypt.apply(asm, asm_args);
- result.set(heap.subarray(_aes_heap_start, _aes_heap_start + tagSize), wlen);
- this.result = result;
- this.counter = counter;
- this.pos = pos;
- this.len = len;
- return this;
- }
- function ccm_aes_encrypt(data) {
- this.dataLength = this.dataLeft = data.byteLength || data.length || 0;
- var result1 = ccm_aes_encrypt_process.call(this, data).result, result2 = ccm_aes_encrypt_finish.call(this).result, result;
- result = new Uint8Array(result1.length + result2.length);
- result.set(result1);
- result.set(result2, result1.length);
- this.result = result;
- return this;
- }
- function ccm_aes_decrypt_process(data) {
- if (!this.key) throw new IllegalStateError("no key is associated with the instance");
- var dpos = data.byteOffset || 0, dlen = data.byteLength || data.length || 0, asm = this.asm, heap = this.heap, nonce = this.nonce, counter = this.counter, tagSize = this.tagSize, pos = this.pos, len = this.len, rpos = 0, rlen = _aes_block_size * Math.floor((len + dlen) / _aes_block_size), wlen = 0;
- if ((counter - 1 << 4) + len + dlen > _ccm_data_maxLength) throw new RangeError("counter overflow");
- var result = new Uint8Array(rlen);
- var asm_args = [ 0, 0, this.lengthSize - 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 ];
- for (var i = 0; i < nonce.length; i++) asm_args[3 + i] = nonce[i];
- while (dlen > 0) {
- wlen = _aes_heap_write(heap, pos + len, data, dpos, dlen);
- len += wlen;
- dpos += wlen;
- dlen -= wlen;
- asm_args[0] = pos;
- asm_args[1] = len + dlen - tagSize >= _aes_block_size ? dlen >= tagSize ? len & ~15 : len + dlen - tagSize & ~15 : 0;
- asm_args[16] = counter / 4294967296 >>> 0;
- asm_args[17] = counter >>> 0;
- wlen = asm.ccm_decrypt.apply(asm, asm_args);
- result.set(heap.subarray(pos, pos + wlen), rpos);
- counter += wlen >>> 4;
- rpos += wlen;
- if (wlen < len) {
- pos += wlen;
- len -= wlen;
- } else {
- pos = _aes_heap_start;
- len = 0;
- }
- }
- this.result = result.subarray(0, rpos);
- this.counter = counter;
- this.pos = pos;
- this.len = len;
- return this;
- }
- function ccm_aes_decrypt_finish() {
- if (!this.key) throw new IllegalStateError("no key is associated with the instance");
- var asm = this.asm, heap = this.heap, nonce = this.nonce, counter = this.counter, tagSize = this.tagSize, pos = this.pos, len = this.len, rlen = len - tagSize, wlen = 0;
- if (len < tagSize) throw new IllegalStateError("authentication tag not found");
- var result = new Uint8Array(rlen), atag = new Uint8Array(heap.subarray(pos + rlen, pos + len));
- var asm_args = [ 0, 0, this.lengthSize - 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 ];
- for (var i = 0; i < nonce.length; i++) asm_args[3 + i] = nonce[i];
- asm_args[0] = pos;
- asm_args[1] = rlen;
- asm_args[16] = counter / 4294967296 >>> 0;
- asm_args[17] = counter >>> 0;
- wlen = asm.ccm_decrypt.apply(asm, asm_args);
- result.set(heap.subarray(pos, pos + wlen));
- counter = 1;
- pos = _aes_heap_start;
- len = 0;
- asm.save_state(_aes_heap_start);
- asm_args[0] = _aes_heap_start, asm_args[1] = _aes_block_size, asm_args[16] = 0;
- asm_args[17] = 0;
- asm.ccm_encrypt.apply(asm, asm_args);
- var acheck = 0;
- for (var i = 0; i < tagSize; ++i) acheck |= atag[i] ^ heap[_aes_heap_start + i];
- if (acheck) throw new SecurityError("data integrity check failed");
- this.result = result;
- this.counter = counter;
- this.pos = pos;
- this.len = len;
- return this;
- }
- function ccm_aes_decrypt(data) {
- this.dataLength = this.dataLeft = data.byteLength || data.length || 0;
- var result1 = ccm_aes_decrypt_process.call(this, data).result, result2 = ccm_aes_decrypt_finish.call(this).result, result;
- result = new Uint8Array(result1.length + result2.length);
- result.set(result1);
- result.set(result2, result1.length);
- this.result = result;
- return this;
- }
- var ccm_aes_prototype = ccm_aes_constructor.prototype;
- ccm_aes_prototype.reset = ccm_aes_reset;
- ccm_aes_prototype.encrypt = ccm_aes_encrypt;
- ccm_aes_prototype.decrypt = ccm_aes_decrypt;
- var ccm_aes_encrypt_prototype = ccm_aes_encrypt_constructor.prototype;
- ccm_aes_encrypt_prototype.reset = ccm_aes_reset;
- ccm_aes_encrypt_prototype.process = ccm_aes_encrypt_process;
- ccm_aes_encrypt_prototype.finish = ccm_aes_encrypt_finish;
- var ccm_aes_decrypt_prototype = ccm_aes_decrypt_constructor.prototype;
- ccm_aes_decrypt_prototype.reset = ccm_aes_reset;
- ccm_aes_decrypt_prototype.process = ccm_aes_decrypt_process;
- ccm_aes_decrypt_prototype.finish = ccm_aes_decrypt_finish;
- function cfb_aes_constructor(options) {
- this.padding = false;
- this.mode = "cfb";
- this.iv = null;
- _aes_constructor.call(this, options);
- }
- function cfb_aes_encrypt_constructor(options) {
- cfb_aes_constructor.call(this, options);
- }
- function cfb_aes_decrypt_constructor(options) {
- cfb_aes_constructor.call(this, options);
- }
- function cfb_aes_reset(options) {
- options = options || {};
- _aes_reset.call(this, options);
- _aes_init_iv.call(this, options.iv);
- return this;
- }
- function cfb_aes_encrypt_process(data) {
- if (!this.key) throw new IllegalStateError("no key is associated with the instance");
- var dpos = data.byteOffset || 0, dlen = data.byteLength || data.length || 0, asm = this.asm, heap = this.heap, pos = this.pos, len = this.len, rpos = 0, rlen = _aes_block_size * Math.floor((len + dlen) / _aes_block_size), wlen = 0;
- var result = new Uint8Array(rlen);
- while (dlen > 0) {
- wlen = _aes_heap_write(heap, pos + len, data, dpos, dlen);
- len += wlen;
- dpos += wlen;
- dlen -= wlen;
- wlen = asm.cfb_encrypt(pos, _aes_block_size * Math.floor(len / _aes_block_size));
- result.set(heap.subarray(pos, pos + wlen), rpos);
- rpos += wlen;
- if (wlen < len) {
- pos += wlen;
- len -= wlen;
- } else {
- pos = _aes_heap_start;
- len = 0;
- }
- }
- this.result = result;
- this.pos = pos;
- this.len = len;
- return this;
- }
- function cfb_aes_encrypt_finish() {
- if (!this.key) throw new IllegalStateError("no key is associated with the instance");
- var asm = this.asm, heap = this.heap, pos = this.pos, len = this.len;
- var result = new Uint8Array(len);
- asm.cfb_encrypt(pos, len);
- result.set(heap.subarray(pos, pos + len));
- this.result = result;
- this.pos = _aes_heap_start;
- this.len = 0;
- return this;
- }
- function cfb_aes_encrypt(data) {
- var result1 = cfb_aes_encrypt_process.call(this, data).result, result2 = cfb_aes_encrypt_finish.call(this).result, result;
- result = new Uint8Array(result1.length + result2.length);
- result.set(result1);
- result.set(result2, result1.length);
- this.result = result;
- return this;
- }
- function cfb_aes_decrypt_process(data) {
- if (!this.key) throw new IllegalStateError("no key is associated with the instance");
- var dpos = data.byteOffset || 0, dlen = data.byteLength || data.length || 0, asm = this.asm, heap = this.heap, pos = this.pos, len = this.len, rpos = 0, rlen = _aes_block_size * Math.floor((len + dlen) / _aes_block_size), wlen = 0;
- var result = new Uint8Array(rlen);
- while (dlen > 0) {
- wlen = _aes_heap_write(heap, pos + len, data, dpos, dlen);
- len += wlen;
- dpos += wlen;
- dlen -= wlen;
- wlen = asm.cfb_decrypt(pos, _aes_block_size * Math.floor(len / _aes_block_size));
- result.set(heap.subarray(pos, pos + wlen), rpos);
- rpos += wlen;
- if (wlen < len) {
- pos += wlen;
- len -= wlen;
- } else {
- pos = _aes_heap_start;
- len = 0;
- }
- }
- this.result = result.subarray(0, rpos);
- this.pos = pos;
- this.len = len;
- return this;
- }
- function cfb_aes_decrypt_finish() {
- if (!this.key) throw new IllegalStateError("no key is associated with the instance");
- var asm = this.asm, heap = this.heap, pos = this.pos, len = this.len;
- if (len === 0) {
- this.result = new Uint8Array(0);
- this.pos = _aes_heap_start;
- this.len = 0;
- return this;
- }
- var result = new Uint8Array(len);
- asm.cfb_decrypt(pos, len);
- result.set(heap.subarray(pos, pos + len));
- this.result = result;
- this.pos = _aes_heap_start;
- this.len = 0;
- return this;
- }
- function cfb_aes_decrypt(data) {
- var result1 = cfb_aes_decrypt_process.call(this, data).result, result2 = cfb_aes_decrypt_finish.call(this).result, result;
- result = new Uint8Array(result1.length + result2.length);
- result.set(result1);
- result.set(result2, result1.length);
- this.result = result;
- return this;
- }
- var cfb_aes_encrypt_prototype = cfb_aes_encrypt_constructor.prototype;
- cfb_aes_encrypt_prototype.reset = cfb_aes_reset;
- cfb_aes_encrypt_prototype.process = cfb_aes_encrypt_process;
- cfb_aes_encrypt_prototype.finish = cfb_aes_encrypt_finish;
- var cfb_aes_decrypt_prototype = cfb_aes_decrypt_constructor.prototype;
- cfb_aes_decrypt_prototype.reset = cfb_aes_reset;
- cfb_aes_decrypt_prototype.process = cfb_aes_decrypt_process;
- cfb_aes_decrypt_prototype.finish = cfb_aes_decrypt_finish;
- var cfb_aes_prototype = cfb_aes_constructor.prototype;
- cfb_aes_prototype.reset = cfb_aes_reset;
- cfb_aes_prototype.encrypt = cfb_aes_encrypt;
- cfb_aes_prototype.decrypt = cfb_aes_decrypt;
- function sha256_asm(stdlib, foreign, buffer) {
- // Closure Compiler warning - commented out
- //"use asm";
- var H0 = 0, H1 = 0, H2 = 0, H3 = 0, H4 = 0, H5 = 0, H6 = 0, H7 = 0, TOTAL = 0;
- var I0 = 0, I1 = 0, I2 = 0, I3 = 0, I4 = 0, I5 = 0, I6 = 0, I7 = 0, O0 = 0, O1 = 0, O2 = 0, O3 = 0, O4 = 0, O5 = 0, O6 = 0, O7 = 0;
- var HEAP = new stdlib.Uint8Array(buffer);
- function _core(w0, w1, w2, w3, w4, w5, w6, w7, w8, w9, w10, w11, w12, w13, w14, w15) {
- w0 = w0 | 0;
- w1 = w1 | 0;
- w2 = w2 | 0;
- w3 = w3 | 0;
- w4 = w4 | 0;
- w5 = w5 | 0;
- w6 = w6 | 0;
- w7 = w7 | 0;
- w8 = w8 | 0;
- w9 = w9 | 0;
- w10 = w10 | 0;
- w11 = w11 | 0;
- w12 = w12 | 0;
- w13 = w13 | 0;
- w14 = w14 | 0;
- w15 = w15 | 0;
- var a = 0, b = 0, c = 0, d = 0, e = 0, f = 0, g = 0, h = 0, t = 0;
- a = H0;
- b = H1;
- c = H2;
- d = H3;
- e = H4;
- f = H5;
- g = H6;
- h = H7;
- t = w0 + h + (e >>> 6 ^ e >>> 11 ^ e >>> 25 ^ e << 26 ^ e << 21 ^ e << 7) + (g ^ e & (f ^ g)) + 1116352408 | 0;
- h = g;
- g = f;
- f = e;
- e = d + t | 0;
- d = c;
- c = b;
- b = a;
- a = t + (b & c ^ d & (b ^ c)) + (b >>> 2 ^ b >>> 13 ^ b >>> 22 ^ b << 30 ^ b << 19 ^ b << 10) | 0;
- t = w1 + h + (e >>> 6 ^ e >>> 11 ^ e >>> 25 ^ e << 26 ^ e << 21 ^ e << 7) + (g ^ e & (f ^ g)) + 1899447441 | 0;
- h = g;
- g = f;
- f = e;
- e = d + t | 0;
- d = c;
- c = b;
- b = a;
- a = t + (b & c ^ d & (b ^ c)) + (b >>> 2 ^ b >>> 13 ^ b >>> 22 ^ b << 30 ^ b << 19 ^ b << 10) | 0;
- t = w2 + h + (e >>> 6 ^ e >>> 11 ^ e >>> 25 ^ e << 26 ^ e << 21 ^ e << 7) + (g ^ e & (f ^ g)) + 3049323471 | 0;
- h = g;
- g = f;
- f = e;
- e = d + t | 0;
- d = c;
- c = b;
- b = a;
- a = t + (b & c ^ d & (b ^ c)) + (b >>> 2 ^ b >>> 13 ^ b >>> 22 ^ b << 30 ^ b << 19 ^ b << 10) | 0;
- t = w3 + h + (e >>> 6 ^ e >>> 11 ^ e >>> 25 ^ e << 26 ^ e << 21 ^ e << 7) + (g ^ e & (f ^ g)) + 3921009573 | 0;
- h = g;
- g = f;
- f = e;
- e = d + t | 0;
- d = c;
- c = b;
- b = a;
- a = t + (b & c ^ d & (b ^ c)) + (b >>> 2 ^ b >>> 13 ^ b >>> 22 ^ b << 30 ^ b << 19 ^ b << 10) | 0;
- t = w4 + h + (e >>> 6 ^ e >>> 11 ^ e >>> 25 ^ e << 26 ^ e << 21 ^ e << 7) + (g ^ e & (f ^ g)) + 961987163 | 0;
- h = g;
- g = f;
- f = e;
- e = d + t | 0;
- d = c;
- c = b;
- b = a;
- a = t + (b & c ^ d & (b ^ c)) + (b >>> 2 ^ b >>> 13 ^ b >>> 22 ^ b << 30 ^ b << 19 ^ b << 10) | 0;
- t = w5 + h + (e >>> 6 ^ e >>> 11 ^ e >>> 25 ^ e << 26 ^ e << 21 ^ e << 7) + (g ^ e & (f ^ g)) + 1508970993 | 0;
- h = g;
- g = f;
- f = e;
- e = d + t | 0;
- d = c;
- c = b;
- b = a;
- a = t + (b & c ^ d & (b ^ c)) + (b >>> 2 ^ b >>> 13 ^ b >>> 22 ^ b << 30 ^ b << 19 ^ b << 10) | 0;
- t = w6 + h + (e >>> 6 ^ e >>> 11 ^ e >>> 25 ^ e << 26 ^ e << 21 ^ e << 7) + (g ^ e & (f ^ g)) + 2453635748 | 0;
- h = g;
- g = f;
- f = e;
- e = d + t | 0;
- d = c;
- c = b;
- b = a;
- a = t + (b & c ^ d & (b ^ c)) + (b >>> 2 ^ b >>> 13 ^ b >>> 22 ^ b << 30 ^ b << 19 ^ b << 10) | 0;
- t = w7 + h + (e >>> 6 ^ e >>> 11 ^ e >>> 25 ^ e << 26 ^ e << 21 ^ e << 7) + (g ^ e & (f ^ g)) + 2870763221 | 0;
- h = g;
- g = f;
- f = e;
- e = d + t | 0;
- d = c;
- c = b;
- b = a;
- a = t + (b & c ^ d & (b ^ c)) + (b >>> 2 ^ b >>> 13 ^ b >>> 22 ^ b << 30 ^ b << 19 ^ b << 10) | 0;
- t = w8 + h + (e >>> 6 ^ e >>> 11 ^ e >>> 25 ^ e << 26 ^ e << 21 ^ e << 7) + (g ^ e & (f ^ g)) + 3624381080 | 0;
- h = g;
- g = f;
- f = e;
- e = d + t | 0;
- d = c;
- c = b;
- b = a;
- a = t + (b & c ^ d & (b ^ c)) + (b >>> 2 ^ b >>> 13 ^ b >>> 22 ^ b << 30 ^ b << 19 ^ b << 10) | 0;
- t = w9 + h + (e >>> 6 ^ e >>> 11 ^ e >>> 25 ^ e << 26 ^ e << 21 ^ e << 7) + (g ^ e & (f ^ g)) + 310598401 | 0;
- h = g;
- g = f;
- f = e;
- e = d + t | 0;
- d = c;
- c = b;
- b = a;
- a = t + (b & c ^ d & (b ^ c)) + (b >>> 2 ^ b >>> 13 ^ b >>> 22 ^ b << 30 ^ b << 19 ^ b << 10) | 0;
- t = w10 + h + (e >>> 6 ^ e >>> 11 ^ e >>> 25 ^ e << 26 ^ e << 21 ^ e << 7) + (g ^ e & (f ^ g)) + 607225278 | 0;
- h = g;
- g = f;
- f = e;
- e = d + t | 0;
- d = c;
- c = b;
- b = a;
- a = t + (b & c ^ d & (b ^ c)) + (b >>> 2 ^ b >>> 13 ^ b >>> 22 ^ b << 30 ^ b << 19 ^ b << 10) | 0;
- t = w11 + h + (e >>> 6 ^ e >>> 11 ^ e >>> 25 ^ e << 26 ^ e << 21 ^ e << 7) + (g ^ e & (f ^ g)) + 1426881987 | 0;
- h = g;
- g = f;
- f = e;
- e = d + t | 0;
- d = c;
- c = b;
- b = a;
- a = t + (b & c ^ d & (b ^ c)) + (b >>> 2 ^ b >>> 13 ^ b >>> 22 ^ b << 30 ^ b << 19 ^ b << 10) | 0;
- t = w12 + h + (e >>> 6 ^ e >>> 11 ^ e >>> 25 ^ e << 26 ^ e << 21 ^ e << 7) + (g ^ e & (f ^ g)) + 1925078388 | 0;
- h = g;
- g = f;
- f = e;
- e = d + t | 0;
- d = c;
- c = b;
- b = a;
- a = t + (b & c ^ d & (b ^ c)) + (b >>> 2 ^ b >>> 13 ^ b >>> 22 ^ b << 30 ^ b << 19 ^ b << 10) | 0;
- t = w13 + h + (e >>> 6 ^ e >>> 11 ^ e >>> 25 ^ e << 26 ^ e << 21 ^ e << 7) + (g ^ e & (f ^ g)) + 2162078206 | 0;
- h = g;
- g = f;
- f = e;
- e = d + t | 0;
- d = c;
- c = b;
- b = a;
- a = t + (b & c ^ d & (b ^ c)) + (b >>> 2 ^ b >>> 13 ^ b >>> 22 ^ b << 30 ^ b << 19 ^ b << 10) | 0;
- t = w14 + h + (e >>> 6 ^ e >>> 11 ^ e >>> 25 ^ e << 26 ^ e << 21 ^ e << 7) + (g ^ e & (f ^ g)) + 2614888103 | 0;
- h = g;
- g = f;
- f = e;
- e = d + t | 0;
- d = c;
- c = b;
- b = a;
- a = t + (b & c ^ d & (b ^ c)) + (b >>> 2 ^ b >>> 13 ^ b >>> 22 ^ b << 30 ^ b << 19 ^ b << 10) | 0;
- t = w15 + h + (e >>> 6 ^ e >>> 11 ^ e >>> 25 ^ e << 26 ^ e << 21 ^ e << 7) + (g ^ e & (f ^ g)) + 3248222580 | 0;
- h = g;
- g = f;
- f = e;
- e = d + t | 0;
- d = c;
- c = b;
- b = a;
- a = t + (b & c ^ d & (b ^ c)) + (b >>> 2 ^ b >>> 13 ^ b >>> 22 ^ b << 30 ^ b << 19 ^ b << 10) | 0;
- w0 = t = (w1 >>> 7 ^ w1 >>> 18 ^ w1 >>> 3 ^ w1 << 25 ^ w1 << 14) + (w14 >>> 17 ^ w14 >>> 19 ^ w14 >>> 10 ^ w14 << 15 ^ w14 << 13) + w0 + w9 | 0;
- t = t + h + (e >>> 6 ^ e >>> 11 ^ e >>> 25 ^ e << 26 ^ e << 21 ^ e << 7) + (g ^ e & (f ^ g)) + 3835390401 | 0;
- h = g;
- g = f;
- f = e;
- e = d + t | 0;
- d = c;
- c = b;
- b = a;
- a = t + (b & c ^ d & (b ^ c)) + (b >>> 2 ^ b >>> 13 ^ b >>> 22 ^ b << 30 ^ b << 19 ^ b << 10) | 0;
- w1 = t = (w2 >>> 7 ^ w2 >>> 18 ^ w2 >>> 3 ^ w2 << 25 ^ w2 << 14) + (w15 >>> 17 ^ w15 >>> 19 ^ w15 >>> 10 ^ w15 << 15 ^ w15 << 13) + w1 + w10 | 0;
- t = t + h + (e >>> 6 ^ e >>> 11 ^ e >>> 25 ^ e << 26 ^ e << 21 ^ e << 7) + (g ^ e & (f ^ g)) + 4022224774 | 0;
- h = g;
- g = f;
- f = e;
- e = d + t | 0;
- d = c;
- c = b;
- b = a;
- a = t + (b & c ^ d & (b ^ c)) + (b >>> 2 ^ b >>> 13 ^ b >>> 22 ^ b << 30 ^ b << 19 ^ b << 10) | 0;
- w2 = t = (w3 >>> 7 ^ w3 >>> 18 ^ w3 >>> 3 ^ w3 << 25 ^ w3 << 14) + (w0 >>> 17 ^ w0 >>> 19 ^ w0 >>> 10 ^ w0 << 15 ^ w0 << 13) + w2 + w11 | 0;
- t = t + h + (e >>> 6 ^ e >>> 11 ^ e >>> 25 ^ e << 26 ^ e << 21 ^ e << 7) + (g ^ e & (f ^ g)) + 264347078 | 0;
- h = g;
- g = f;
- f = e;
- e = d + t | 0;
- d = c;
- c = b;
- b = a;
- a = t + (b & c ^ d & (b ^ c)) + (b >>> 2 ^ b >>> 13 ^ b >>> 22 ^ b << 30 ^ b << 19 ^ b << 10) | 0;
- w3 = t = (w4 >>> 7 ^ w4 >>> 18 ^ w4 >>> 3 ^ w4 << 25 ^ w4 << 14) + (w1 >>> 17 ^ w1 >>> 19 ^ w1 >>> 10 ^ w1 << 15 ^ w1 << 13) + w3 + w12 | 0;
- t = t + h + (e >>> 6 ^ e >>> 11 ^ e >>> 25 ^ e << 26 ^ e << 21 ^ e << 7) + (g ^ e & (f ^ g)) + 604807628 | 0;
- h = g;
- g = f;
- f = e;
- e = d + t | 0;
- d = c;
- c = b;
- b = a;
- a = t + (b & c ^ d & (b ^ c)) + (b >>> 2 ^ b >>> 13 ^ b >>> 22 ^ b << 30 ^ b << 19 ^ b << 10) | 0;
- w4 = t = (w5 >>> 7 ^ w5 >>> 18 ^ w5 >>> 3 ^ w5 << 25 ^ w5 << 14) + (w2 >>> 17 ^ w2 >>> 19 ^ w2 >>> 10 ^ w2 << 15 ^ w2 << 13) + w4 + w13 | 0;
- t = t + h + (e >>> 6 ^ e >>> 11 ^ e >>> 25 ^ e << 26 ^ e << 21 ^ e << 7) + (g ^ e & (f ^ g)) + 770255983 | 0;
- h = g;
- g = f;
- f = e;
- e = d + t | 0;
- d = c;
- c = b;
- b = a;
- a = t + (b & c ^ d & (b ^ c)) + (b >>> 2 ^ b >>> 13 ^ b >>> 22 ^ b << 30 ^ b << 19 ^ b << 10) | 0;
- w5 = t = (w6 >>> 7 ^ w6 >>> 18 ^ w6 >>> 3 ^ w6 << 25 ^ w6 << 14) + (w3 >>> 17 ^ w3 >>> 19 ^ w3 >>> 10 ^ w3 << 15 ^ w3 << 13) + w5 + w14 | 0;
- t = t + h + (e >>> 6 ^ e >>> 11 ^ e >>> 25 ^ e << 26 ^ e << 21 ^ e << 7) + (g ^ e & (f ^ g)) + 1249150122 | 0;
- h = g;
- g = f;
- f = e;
- e = d + t | 0;
- d = c;
- c = b;
- b = a;
- a = t + (b & c ^ d & (b ^ c)) + (b >>> 2 ^ b >>> 13 ^ b >>> 22 ^ b << 30 ^ b << 19 ^ b << 10) | 0;
- w6 = t = (w7 >>> 7 ^ w7 >>> 18 ^ w7 >>> 3 ^ w7 << 25 ^ w7 << 14) + (w4 >>> 17 ^ w4 >>> 19 ^ w4 >>> 10 ^ w4 << 15 ^ w4 << 13) + w6 + w15 | 0;
- t = t + h + (e >>> 6 ^ e >>> 11 ^ e >>> 25 ^ e << 26 ^ e << 21 ^ e << 7) + (g ^ e & (f ^ g)) + 1555081692 | 0;
- h = g;
- g = f;
- f = e;
- e = d + t | 0;
- d = c;
- c = b;
- b = a;
- a = t + (b & c ^ d & (b ^ c)) + (b >>> 2 ^ b >>> 13 ^ b >>> 22 ^ b << 30 ^ b << 19 ^ b << 10) | 0;
- w7 = t = (w8 >>> 7 ^ w8 >>> 18 ^ w8 >>> 3 ^ w8 << 25 ^ w8 << 14) + (w5 >>> 17 ^ w5 >>> 19 ^ w5 >>> 10 ^ w5 << 15 ^ w5 << 13) + w7 + w0 | 0;
- t = t + h + (e >>> 6 ^ e >>> 11 ^ e >>> 25 ^ e << 26 ^ e << 21 ^ e << 7) + (g ^ e & (f ^ g)) + 1996064986 | 0;
- h = g;
- g = f;
- f = e;
- e = d + t | 0;
- d = c;
- c = b;
- b = a;
- a = t + (b & c ^ d & (b ^ c)) + (b >>> 2 ^ b >>> 13 ^ b >>> 22 ^ b << 30 ^ b << 19 ^ b << 10) | 0;
- w8 = t = (w9 >>> 7 ^ w9 >>> 18 ^ w9 >>> 3 ^ w9 << 25 ^ w9 << 14) + (w6 >>> 17 ^ w6 >>> 19 ^ w6 >>> 10 ^ w6 << 15 ^ w6 << 13) + w8 + w1 | 0;
- t = t + h + (e >>> 6 ^ e >>> 11 ^ e >>> 25 ^ e << 26 ^ e << 21 ^ e << 7) + (g ^ e & (f ^ g)) + 2554220882 | 0;
- h = g;
- g = f;
- f = e;
- e = d + t | 0;
- d = c;
- c = b;
- b = a;
- a = t + (b & c ^ d & (b ^ c)) + (b >>> 2 ^ b >>> 13 ^ b >>> 22 ^ b << 30 ^ b << 19 ^ b << 10) | 0;
- w9 = t = (w10 >>> 7 ^ w10 >>> 18 ^ w10 >>> 3 ^ w10 << 25 ^ w10 << 14) + (w7 >>> 17 ^ w7 >>> 19 ^ w7 >>> 10 ^ w7 << 15 ^ w7 << 13) + w9 + w2 | 0;
- t = t + h + (e >>> 6 ^ e >>> 11 ^ e >>> 25 ^ e << 26 ^ e << 21 ^ e << 7) + (g ^ e & (f ^ g)) + 2821834349 | 0;
- h = g;
- g = f;
- f = e;
- e = d + t | 0;
- d = c;
- c = b;
- b = a;
- a = t + (b & c ^ d & (b ^ c)) + (b >>> 2 ^ b >>> 13 ^ b >>> 22 ^ b << 30 ^ b << 19 ^ b << 10) | 0;
- w10 = t = (w11 >>> 7 ^ w11 >>> 18 ^ w11 >>> 3 ^ w11 << 25 ^ w11 << 14) + (w8 >>> 17 ^ w8 >>> 19 ^ w8 >>> 10 ^ w8 << 15 ^ w8 << 13) + w10 + w3 | 0;
- t = t + h + (e >>> 6 ^ e >>> 11 ^ e >>> 25 ^ e << 26 ^ e << 21 ^ e << 7) + (g ^ e & (f ^ g)) + 2952996808 | 0;
- h = g;
- g = f;
- f = e;
- e = d + t | 0;
- d = c;
- c = b;
- b = a;
- a = t + (b & c ^ d & (b ^ c)) + (b >>> 2 ^ b >>> 13 ^ b >>> 22 ^ b << 30 ^ b << 19 ^ b << 10) | 0;
- w11 = t = (w12 >>> 7 ^ w12 >>> 18 ^ w12 >>> 3 ^ w12 << 25 ^ w12 << 14) + (w9 >>> 17 ^ w9 >>> 19 ^ w9 >>> 10 ^ w9 << 15 ^ w9 << 13) + w11 + w4 | 0;
- t = t + h + (e >>> 6 ^ e >>> 11 ^ e >>> 25 ^ e << 26 ^ e << 21 ^ e << 7) + (g ^ e & (f ^ g)) + 3210313671 | 0;
- h = g;
- g = f;
- f = e;
- e = d + t | 0;
- d = c;
- c = b;
- b = a;
- a = t + (b & c ^ d & (b ^ c)) + (b >>> 2 ^ b >>> 13 ^ b >>> 22 ^ b << 30 ^ b << 19 ^ b << 10) | 0;
- w12 = t = (w13 >>> 7 ^ w13 >>> 18 ^ w13 >>> 3 ^ w13 << 25 ^ w13 << 14) + (w10 >>> 17 ^ w10 >>> 19 ^ w10 >>> 10 ^ w10 << 15 ^ w10 << 13) + w12 + w5 | 0;
- t = t + h + (e >>> 6 ^ e >>> 11 ^ e >>> 25 ^ e << 26 ^ e << 21 ^ e << 7) + (g ^ e & (f ^ g)) + 3336571891 | 0;
- h = g;
- g = f;
- f = e;
- e = d + t | 0;
- d = c;
- c = b;
- b = a;
- a = t + (b & c ^ d & (b ^ c)) + (b >>> 2 ^ b >>> 13 ^ b >>> 22 ^ b << 30 ^ b << 19 ^ b << 10) | 0;
- w13 = t = (w14 >>> 7 ^ w14 >>> 18 ^ w14 >>> 3 ^ w14 << 25 ^ w14 << 14) + (w11 >>> 17 ^ w11 >>> 19 ^ w11 >>> 10 ^ w11 << 15 ^ w11 << 13) + w13 + w6 | 0;
- t = t + h + (e >>> 6 ^ e >>> 11 ^ e >>> 25 ^ e << 26 ^ e << 21 ^ e << 7) + (g ^ e & (f ^ g)) + 3584528711 | 0;
- h = g;
- g = f;
- f = e;
- e = d + t | 0;
- d = c;
- c = b;
- b = a;
- a = t + (b & c ^ d & (b ^ c)) + (b >>> 2 ^ b >>> 13 ^ b >>> 22 ^ b << 30 ^ b << 19 ^ b << 10) | 0;
- w14 = t = (w15 >>> 7 ^ w15 >>> 18 ^ w15 >>> 3 ^ w15 << 25 ^ w15 << 14) + (w12 >>> 17 ^ w12 >>> 19 ^ w12 >>> 10 ^ w12 << 15 ^ w12 << 13) + w14 + w7 | 0;
- t = t + h + (e >>> 6 ^ e >>> 11 ^ e >>> 25 ^ e << 26 ^ e << 21 ^ e << 7) + (g ^ e & (f ^ g)) + 113926993 | 0;
- h = g;
- g = f;
- f = e;
- e = d + t | 0;
- d = c;
- c = b;
- b = a;
- a = t + (b & c ^ d & (b ^ c)) + (b >>> 2 ^ b >>> 13 ^ b >>> 22 ^ b << 30 ^ b << 19 ^ b << 10) | 0;
- w15 = t = (w0 >>> 7 ^ w0 >>> 18 ^ w0 >>> 3 ^ w0 << 25 ^ w0 << 14) + (w13 >>> 17 ^ w13 >>> 19 ^ w13 >>> 10 ^ w13 << 15 ^ w13 << 13) + w15 + w8 | 0;
- t = t + h + (e >>> 6 ^ e >>> 11 ^ e >>> 25 ^ e << 26 ^ e << 21 ^ e << 7) + (g ^ e & (f ^ g)) + 338241895 | 0;
- h = g;
- g = f;
- f = e;
- e = d + t | 0;
- d = c;
- c = b;
- b = a;
- a = t + (b & c ^ d & (b ^ c)) + (b >>> 2 ^ b >>> 13 ^ b >>> 22 ^ b << 30 ^ b << 19 ^ b << 10) | 0;
- w0 = t = (w1 >>> 7 ^ w1 >>> 18 ^ w1 >>> 3 ^ w1 << 25 ^ w1 << 14) + (w14 >>> 17 ^ w14 >>> 19 ^ w14 >>> 10 ^ w14 << 15 ^ w14 << 13) + w0 + w9 | 0;
- t = t + h + (e >>> 6 ^ e >>> 11 ^ e >>> 25 ^ e << 26 ^ e << 21 ^ e << 7) + (g ^ e & (f ^ g)) + 666307205 | 0;
- h = g;
- g = f;
- f = e;
- e = d + t | 0;
- d = c;
- c = b;
- b = a;
- a = t + (b & c ^ d & (b ^ c)) + (b >>> 2 ^ b >>> 13 ^ b >>> 22 ^ b << 30 ^ b << 19 ^ b << 10) | 0;
- w1 = t = (w2 >>> 7 ^ w2 >>> 18 ^ w2 >>> 3 ^ w2 << 25 ^ w2 << 14) + (w15 >>> 17 ^ w15 >>> 19 ^ w15 >>> 10 ^ w15 << 15 ^ w15 << 13) + w1 + w10 | 0;
- t = t + h + (e >>> 6 ^ e >>> 11 ^ e >>> 25 ^ e << 26 ^ e << 21 ^ e << 7) + (g ^ e & (f ^ g)) + 773529912 | 0;
- h = g;
- g = f;
- f = e;
- e = d + t | 0;
- d = c;
- c = b;
- b = a;
- a = t + (b & c ^ d & (b ^ c)) + (b >>> 2 ^ b >>> 13 ^ b >>> 22 ^ b << 30 ^ b << 19 ^ b << 10) | 0;
- w2 = t = (w3 >>> 7 ^ w3 >>> 18 ^ w3 >>> 3 ^ w3 << 25 ^ w3 << 14) + (w0 >>> 17 ^ w0 >>> 19 ^ w0 >>> 10 ^ w0 << 15 ^ w0 << 13) + w2 + w11 | 0;
- t = t + h + (e >>> 6 ^ e >>> 11 ^ e >>> 25 ^ e << 26 ^ e << 21 ^ e << 7) + (g ^ e & (f ^ g)) + 1294757372 | 0;
- h = g;
- g = f;
- f = e;
- e = d + t | 0;
- d = c;
- c = b;
- b = a;
- a = t + (b & c ^ d & (b ^ c)) + (b >>> 2 ^ b >>> 13 ^ b >>> 22 ^ b << 30 ^ b << 19 ^ b << 10) | 0;
- w3 = t = (w4 >>> 7 ^ w4 >>> 18 ^ w4 >>> 3 ^ w4 << 25 ^ w4 << 14) + (w1 >>> 17 ^ w1 >>> 19 ^ w1 >>> 10 ^ w1 << 15 ^ w1 << 13) + w3 + w12 | 0;
- t = t + h + (e >>> 6 ^ e >>> 11 ^ e >>> 25 ^ e << 26 ^ e << 21 ^ e << 7) + (g ^ e & (f ^ g)) + 1396182291 | 0;
- h = g;
- g = f;
- f = e;
- e = d + t | 0;
- d = c;
- c = b;
- b = a;
- a = t + (b & c ^ d & (b ^ c)) + (b >>> 2 ^ b >>> 13 ^ b >>> 22 ^ b << 30 ^ b << 19 ^ b << 10) | 0;
- w4 = t = (w5 >>> 7 ^ w5 >>> 18 ^ w5 >>> 3 ^ w5 << 25 ^ w5 << 14) + (w2 >>> 17 ^ w2 >>> 19 ^ w2 >>> 10 ^ w2 << 15 ^ w2 << 13) + w4 + w13 | 0;
- t = t + h + (e >>> 6 ^ e >>> 11 ^ e >>> 25 ^ e << 26 ^ e << 21 ^ e << 7) + (g ^ e & (f ^ g)) + 1695183700 | 0;
- h = g;
- g = f;
- f = e;
- e = d + t | 0;
- d = c;
- c = b;
- b = a;
- a = t + (b & c ^ d & (b ^ c)) + (b >>> 2 ^ b >>> 13 ^ b >>> 22 ^ b << 30 ^ b << 19 ^ b << 10) | 0;
- w5 = t = (w6 >>> 7 ^ w6 >>> 18 ^ w6 >>> 3 ^ w6 << 25 ^ w6 << 14) + (w3 >>> 17 ^ w3 >>> 19 ^ w3 >>> 10 ^ w3 << 15 ^ w3 << 13) + w5 + w14 | 0;
- t = t + h + (e >>> 6 ^ e >>> 11 ^ e >>> 25 ^ e << 26 ^ e << 21 ^ e << 7) + (g ^ e & (f ^ g)) + 1986661051 | 0;
- h = g;
- g = f;
- f = e;
- e = d + t | 0;
- d = c;
- c = b;
- b = a;
- a = t + (b & c ^ d & (b ^ c)) + (b >>> 2 ^ b >>> 13 ^ b >>> 22 ^ b << 30 ^ b << 19 ^ b << 10) | 0;
- w6 = t = (w7 >>> 7 ^ w7 >>> 18 ^ w7 >>> 3 ^ w7 << 25 ^ w7 << 14) + (w4 >>> 17 ^ w4 >>> 19 ^ w4 >>> 10 ^ w4 << 15 ^ w4 << 13) + w6 + w15 | 0;
- t = t + h + (e >>> 6 ^ e >>> 11 ^ e >>> 25 ^ e << 26 ^ e << 21 ^ e << 7) + (g ^ e & (f ^ g)) + 2177026350 | 0;
- h = g;
- g = f;
- f = e;
- e = d + t | 0;
- d = c;
- c = b;
- b = a;
- a = t + (b & c ^ d & (b ^ c)) + (b >>> 2 ^ b >>> 13 ^ b >>> 22 ^ b << 30 ^ b << 19 ^ b << 10) | 0;
- w7 = t = (w8 >>> 7 ^ w8 >>> 18 ^ w8 >>> 3 ^ w8 << 25 ^ w8 << 14) + (w5 >>> 17 ^ w5 >>> 19 ^ w5 >>> 10 ^ w5 << 15 ^ w5 << 13) + w7 + w0 | 0;
- t = t + h + (e >>> 6 ^ e >>> 11 ^ e >>> 25 ^ e << 26 ^ e << 21 ^ e << 7) + (g ^ e & (f ^ g)) + 2456956037 | 0;
- h = g;
- g = f;
- f = e;
- e = d + t | 0;
- d = c;
- c = b;
- b = a;
- a = t + (b & c ^ d & (b ^ c)) + (b >>> 2 ^ b >>> 13 ^ b >>> 22 ^ b << 30 ^ b << 19 ^ b << 10) | 0;
- w8 = t = (w9 >>> 7 ^ w9 >>> 18 ^ w9 >>> 3 ^ w9 << 25 ^ w9 << 14) + (w6 >>> 17 ^ w6 >>> 19 ^ w6 >>> 10 ^ w6 << 15 ^ w6 << 13) + w8 + w1 | 0;
- t = t + h + (e >>> 6 ^ e >>> 11 ^ e >>> 25 ^ e << 26 ^ e << 21 ^ e << 7) + (g ^ e & (f ^ g)) + 2730485921 | 0;
- h = g;
- g = f;
- f = e;
- e = d + t | 0;
- d = c;
- c = b;
- b = a;
- a = t + (b & c ^ d & (b ^ c)) + (b >>> 2 ^ b >>> 13 ^ b >>> 22 ^ b << 30 ^ b << 19 ^ b << 10) | 0;
- w9 = t = (w10 >>> 7 ^ w10 >>> 18 ^ w10 >>> 3 ^ w10 << 25 ^ w10 << 14) + (w7 >>> 17 ^ w7 >>> 19 ^ w7 >>> 10 ^ w7 << 15 ^ w7 << 13) + w9 + w2 | 0;
- t = t + h + (e >>> 6 ^ e >>> 11 ^ e >>> 25 ^ e << 26 ^ e << 21 ^ e << 7) + (g ^ e & (f ^ g)) + 2820302411 | 0;
- h = g;
- g = f;
- f = e;
- e = d + t | 0;
- d = c;
- c = b;
- b = a;
- a = t + (b & c ^ d & (b ^ c)) + (b >>> 2 ^ b >>> 13 ^ b >>> 22 ^ b << 30 ^ b << 19 ^ b << 10) | 0;
- w10 = t = (w11 >>> 7 ^ w11 >>> 18 ^ w11 >>> 3 ^ w11 << 25 ^ w11 << 14) + (w8 >>> 17 ^ w8 >>> 19 ^ w8 >>> 10 ^ w8 << 15 ^ w8 << 13) + w10 + w3 | 0;
- t = t + h + (e >>> 6 ^ e >>> 11 ^ e >>> 25 ^ e << 26 ^ e << 21 ^ e << 7) + (g ^ e & (f ^ g)) + 3259730800 | 0;
- h = g;
- g = f;
- f = e;
- e = d + t | 0;
- d = c;
- c = b;
- b = a;
- a = t + (b & c ^ d & (b ^ c)) + (b >>> 2 ^ b >>> 13 ^ b >>> 22 ^ b << 30 ^ b << 19 ^ b << 10) | 0;
- w11 = t = (w12 >>> 7 ^ w12 >>> 18 ^ w12 >>> 3 ^ w12 << 25 ^ w12 << 14) + (w9 >>> 17 ^ w9 >>> 19 ^ w9 >>> 10 ^ w9 << 15 ^ w9 << 13) + w11 + w4 | 0;
- t = t + h + (e >>> 6 ^ e >>> 11 ^ e >>> 25 ^ e << 26 ^ e << 21 ^ e << 7) + (g ^ e & (f ^ g)) + 3345764771 | 0;
- h = g;
- g = f;
- f = e;
- e = d + t | 0;
- d = c;
- c = b;
- b = a;
- a = t + (b & c ^ d & (b ^ c)) + (b >>> 2 ^ b >>> 13 ^ b >>> 22 ^ b << 30 ^ b << 19 ^ b << 10) | 0;
- w12 = t = (w13 >>> 7 ^ w13 >>> 18 ^ w13 >>> 3 ^ w13 << 25 ^ w13 << 14) + (w10 >>> 17 ^ w10 >>> 19 ^ w10 >>> 10 ^ w10 << 15 ^ w10 << 13) + w12 + w5 | 0;
- t = t + h + (e >>> 6 ^ e >>> 11 ^ e >>> 25 ^ e << 26 ^ e << 21 ^ e << 7) + (g ^ e & (f ^ g)) + 3516065817 | 0;
- h = g;
- g = f;
- f = e;
- e = d + t | 0;
- d = c;
- c = b;
- b = a;
- a = t + (b & c ^ d & (b ^ c)) + (b >>> 2 ^ b >>> 13 ^ b >>> 22 ^ b << 30 ^ b << 19 ^ b << 10) | 0;
- w13 = t = (w14 >>> 7 ^ w14 >>> 18 ^ w14 >>> 3 ^ w14 << 25 ^ w14 << 14) + (w11 >>> 17 ^ w11 >>> 19 ^ w11 >>> 10 ^ w11 << 15 ^ w11 << 13) + w13 + w6 | 0;
- t = t + h + (e >>> 6 ^ e >>> 11 ^ e >>> 25 ^ e << 26 ^ e << 21 ^ e << 7) + (g ^ e & (f ^ g)) + 3600352804 | 0;
- h = g;
- g = f;
- f = e;
- e = d + t | 0;
- d = c;
- c = b;
- b = a;
- a = t + (b & c ^ d & (b ^ c)) + (b >>> 2 ^ b >>> 13 ^ b >>> 22 ^ b << 30 ^ b << 19 ^ b << 10) | 0;
- w14 = t = (w15 >>> 7 ^ w15 >>> 18 ^ w15 >>> 3 ^ w15 << 25 ^ w15 << 14) + (w12 >>> 17 ^ w12 >>> 19 ^ w12 >>> 10 ^ w12 << 15 ^ w12 << 13) + w14 + w7 | 0;
- t = t + h + (e >>> 6 ^ e >>> 11 ^ e >>> 25 ^ e << 26 ^ e << 21 ^ e << 7) + (g ^ e & (f ^ g)) + 4094571909 | 0;
- h = g;
- g = f;
- f = e;
- e = d + t | 0;
- d = c;
- c = b;
- b = a;
- a = t + (b & c ^ d & (b ^ c)) + (b >>> 2 ^ b >>> 13 ^ b >>> 22 ^ b << 30 ^ b << 19 ^ b << 10) | 0;
- w15 = t = (w0 >>> 7 ^ w0 >>> 18 ^ w0 >>> 3 ^ w0 << 25 ^ w0 << 14) + (w13 >>> 17 ^ w13 >>> 19 ^ w13 >>> 10 ^ w13 << 15 ^ w13 << 13) + w15 + w8 | 0;
- t = t + h + (e >>> 6 ^ e >>> 11 ^ e >>> 25 ^ e << 26 ^ e << 21 ^ e << 7) + (g ^ e & (f ^ g)) + 275423344 | 0;
- h = g;
- g = f;
- f = e;
- e = d + t | 0;
- d = c;
- c = b;
- b = a;
- a = t + (b & c ^ d & (b ^ c)) + (b >>> 2 ^ b >>> 13 ^ b >>> 22 ^ b << 30 ^ b << 19 ^ b << 10) | 0;
- w0 = t = (w1 >>> 7 ^ w1 >>> 18 ^ w1 >>> 3 ^ w1 << 25 ^ w1 << 14) + (w14 >>> 17 ^ w14 >>> 19 ^ w14 >>> 10 ^ w14 << 15 ^ w14 << 13) + w0 + w9 | 0;
- t = t + h + (e >>> 6 ^ e >>> 11 ^ e >>> 25 ^ e << 26 ^ e << 21 ^ e << 7) + (g ^ e & (f ^ g)) + 430227734 | 0;
- h = g;
- g = f;
- f = e;
- e = d + t | 0;
- d = c;
- c = b;
- b = a;
- a = t + (b & c ^ d & (b ^ c)) + (b >>> 2 ^ b >>> 13 ^ b >>> 22 ^ b << 30 ^ b << 19 ^ b << 10) | 0;
- w1 = t = (w2 >>> 7 ^ w2 >>> 18 ^ w2 >>> 3 ^ w2 << 25 ^ w2 << 14) + (w15 >>> 17 ^ w15 >>> 19 ^ w15 >>> 10 ^ w15 << 15 ^ w15 << 13) + w1 + w10 | 0;
- t = t + h + (e >>> 6 ^ e >>> 11 ^ e >>> 25 ^ e << 26 ^ e << 21 ^ e << 7) + (g ^ e & (f ^ g)) + 506948616 | 0;
- h = g;
- g = f;
- f = e;
- e = d + t | 0;
- d = c;
- c = b;
- b = a;
- a = t + (b & c ^ d & (b ^ c)) + (b >>> 2 ^ b >>> 13 ^ b >>> 22 ^ b << 30 ^ b << 19 ^ b << 10) | 0;
- w2 = t = (w3 >>> 7 ^ w3 >>> 18 ^ w3 >>> 3 ^ w3 << 25 ^ w3 << 14) + (w0 >>> 17 ^ w0 >>> 19 ^ w0 >>> 10 ^ w0 << 15 ^ w0 << 13) + w2 + w11 | 0;
- t = t + h + (e >>> 6 ^ e >>> 11 ^ e >>> 25 ^ e << 26 ^ e << 21 ^ e << 7) + (g ^ e & (f ^ g)) + 659060556 | 0;
- h = g;
- g = f;
- f = e;
- e = d + t | 0;
- d = c;
- c = b;
- b = a;
- a = t + (b & c ^ d & (b ^ c)) + (b >>> 2 ^ b >>> 13 ^ b >>> 22 ^ b << 30 ^ b << 19 ^ b << 10) | 0;
- w3 = t = (w4 >>> 7 ^ w4 >>> 18 ^ w4 >>> 3 ^ w4 << 25 ^ w4 << 14) + (w1 >>> 17 ^ w1 >>> 19 ^ w1 >>> 10 ^ w1 << 15 ^ w1 << 13) + w3 + w12 | 0;
- t = t + h + (e >>> 6 ^ e >>> 11 ^ e >>> 25 ^ e << 26 ^ e << 21 ^ e << 7) + (g ^ e & (f ^ g)) + 883997877 | 0;
- h = g;
- g = f;
- f = e;
- e = d + t | 0;
- d = c;
- c = b;
- b = a;
- a = t + (b & c ^ d & (b ^ c)) + (b >>> 2 ^ b >>> 13 ^ b >>> 22 ^ b << 30 ^ b << 19 ^ b << 10) | 0;
- w4 = t = (w5 >>> 7 ^ w5 >>> 18 ^ w5 >>> 3 ^ w5 << 25 ^ w5 << 14) + (w2 >>> 17 ^ w2 >>> 19 ^ w2 >>> 10 ^ w2 << 15 ^ w2 << 13) + w4 + w13 | 0;
- t = t + h + (e >>> 6 ^ e >>> 11 ^ e >>> 25 ^ e << 26 ^ e << 21 ^ e << 7) + (g ^ e & (f ^ g)) + 958139571 | 0;
- h = g;
- g = f;
- f = e;
- e = d + t | 0;
- d = c;
- c = b;
- b = a;
- a = t + (b & c ^ d & (b ^ c)) + (b >>> 2 ^ b >>> 13 ^ b >>> 22 ^ b << 30 ^ b << 19 ^ b << 10) | 0;
- w5 = t = (w6 >>> 7 ^ w6 >>> 18 ^ w6 >>> 3 ^ w6 << 25 ^ w6 << 14) + (w3 >>> 17 ^ w3 >>> 19 ^ w3 >>> 10 ^ w3 << 15 ^ w3 << 13) + w5 + w14 | 0;
- t = t + h + (e >>> 6 ^ e >>> 11 ^ e >>> 25 ^ e << 26 ^ e << 21 ^ e << 7) + (g ^ e & (f ^ g)) + 1322822218 | 0;
- h = g;
- g = f;
- f = e;
- e = d + t | 0;
- d = c;
- c = b;
- b = a;
- a = t + (b & c ^ d & (b ^ c)) + (b >>> 2 ^ b >>> 13 ^ b >>> 22 ^ b << 30 ^ b << 19 ^ b << 10) | 0;
- w6 = t = (w7 >>> 7 ^ w7 >>> 18 ^ w7 >>> 3 ^ w7 << 25 ^ w7 << 14) + (w4 >>> 17 ^ w4 >>> 19 ^ w4 >>> 10 ^ w4 << 15 ^ w4 << 13) + w6 + w15 | 0;
- t = t + h + (e >>> 6 ^ e >>> 11 ^ e >>> 25 ^ e << 26 ^ e << 21 ^ e << 7) + (g ^ e & (f ^ g)) + 1537002063 | 0;
- h = g;
- g = f;
- f = e;
- e = d + t | 0;
- d = c;
- c = b;
- b = a;
- a = t + (b & c ^ d & (b ^ c)) + (b >>> 2 ^ b >>> 13 ^ b >>> 22 ^ b << 30 ^ b << 19 ^ b << 10) | 0;
- w7 = t = (w8 >>> 7 ^ w8 >>> 18 ^ w8 >>> 3 ^ w8 << 25 ^ w8 << 14) + (w5 >>> 17 ^ w5 >>> 19 ^ w5 >>> 10 ^ w5 << 15 ^ w5 << 13) + w7 + w0 | 0;
- t = t + h + (e >>> 6 ^ e >>> 11 ^ e >>> 25 ^ e << 26 ^ e << 21 ^ e << 7) + (g ^ e & (f ^ g)) + 1747873779 | 0;
- h = g;
- g = f;
- f = e;
- e = d + t | 0;
- d = c;
- c = b;
- b = a;
- a = t + (b & c ^ d & (b ^ c)) + (b >>> 2 ^ b >>> 13 ^ b >>> 22 ^ b << 30 ^ b << 19 ^ b << 10) | 0;
- w8 = t = (w9 >>> 7 ^ w9 >>> 18 ^ w9 >>> 3 ^ w9 << 25 ^ w9 << 14) + (w6 >>> 17 ^ w6 >>> 19 ^ w6 >>> 10 ^ w6 << 15 ^ w6 << 13) + w8 + w1 | 0;
- t = t + h + (e >>> 6 ^ e >>> 11 ^ e >>> 25 ^ e << 26 ^ e << 21 ^ e << 7) + (g ^ e & (f ^ g)) + 1955562222 | 0;
- h = g;
- g = f;
- f = e;
- e = d + t | 0;
- d = c;
- c = b;
- b = a;
- a = t + (b & c ^ d & (b ^ c)) + (b >>> 2 ^ b >>> 13 ^ b >>> 22 ^ b << 30 ^ b << 19 ^ b << 10) | 0;
- w9 = t = (w10 >>> 7 ^ w10 >>> 18 ^ w10 >>> 3 ^ w10 << 25 ^ w10 << 14) + (w7 >>> 17 ^ w7 >>> 19 ^ w7 >>> 10 ^ w7 << 15 ^ w7 << 13) + w9 + w2 | 0;
- t = t + h + (e >>> 6 ^ e >>> 11 ^ e >>> 25 ^ e << 26 ^ e << 21 ^ e << 7) + (g ^ e & (f ^ g)) + 2024104815 | 0;
- h = g;
- g = f;
- f = e;
- e = d + t | 0;
- d = c;
- c = b;
- b = a;
- a = t + (b & c ^ d & (b ^ c)) + (b >>> 2 ^ b >>> 13 ^ b >>> 22 ^ b << 30 ^ b << 19 ^ b << 10) | 0;
- w10 = t = (w11 >>> 7 ^ w11 >>> 18 ^ w11 >>> 3 ^ w11 << 25 ^ w11 << 14) + (w8 >>> 17 ^ w8 >>> 19 ^ w8 >>> 10 ^ w8 << 15 ^ w8 << 13) + w10 + w3 | 0;
- t = t + h + (e >>> 6 ^ e >>> 11 ^ e >>> 25 ^ e << 26 ^ e << 21 ^ e << 7) + (g ^ e & (f ^ g)) + 2227730452 | 0;
- h = g;
- g = f;
- f = e;
- e = d + t | 0;
- d = c;
- c = b;
- b = a;
- a = t + (b & c ^ d & (b ^ c)) + (b >>> 2 ^ b >>> 13 ^ b >>> 22 ^ b << 30 ^ b << 19 ^ b << 10) | 0;
- w11 = t = (w12 >>> 7 ^ w12 >>> 18 ^ w12 >>> 3 ^ w12 << 25 ^ w12 << 14) + (w9 >>> 17 ^ w9 >>> 19 ^ w9 >>> 10 ^ w9 << 15 ^ w9 << 13) + w11 + w4 | 0;
- t = t + h + (e >>> 6 ^ e >>> 11 ^ e >>> 25 ^ e << 26 ^ e << 21 ^ e << 7) + (g ^ e & (f ^ g)) + 2361852424 | 0;
- h = g;
- g = f;
- f = e;
- e = d + t | 0;
- d = c;
- c = b;
- b = a;
- a = t + (b & c ^ d & (b ^ c)) + (b >>> 2 ^ b >>> 13 ^ b >>> 22 ^ b << 30 ^ b << 19 ^ b << 10) | 0;
- w12 = t = (w13 >>> 7 ^ w13 >>> 18 ^ w13 >>> 3 ^ w13 << 25 ^ w13 << 14) + (w10 >>> 17 ^ w10 >>> 19 ^ w10 >>> 10 ^ w10 << 15 ^ w10 << 13) + w12 + w5 | 0;
- t = t + h + (e >>> 6 ^ e >>> 11 ^ e >>> 25 ^ e << 26 ^ e << 21 ^ e << 7) + (g ^ e & (f ^ g)) + 2428436474 | 0;
- h = g;
- g = f;
- f = e;
- e = d + t | 0;
- d = c;
- c = b;
- b = a;
- a = t + (b & c ^ d & (b ^ c)) + (b >>> 2 ^ b >>> 13 ^ b >>> 22 ^ b << 30 ^ b << 19 ^ b << 10) | 0;
- w13 = t = (w14 >>> 7 ^ w14 >>> 18 ^ w14 >>> 3 ^ w14 << 25 ^ w14 << 14) + (w11 >>> 17 ^ w11 >>> 19 ^ w11 >>> 10 ^ w11 << 15 ^ w11 << 13) + w13 + w6 | 0;
- t = t + h + (e >>> 6 ^ e >>> 11 ^ e >>> 25 ^ e << 26 ^ e << 21 ^ e << 7) + (g ^ e & (f ^ g)) + 2756734187 | 0;
- h = g;
- g = f;
- f = e;
- e = d + t | 0;
- d = c;
- c = b;
- b = a;
- a = t + (b & c ^ d & (b ^ c)) + (b >>> 2 ^ b >>> 13 ^ b >>> 22 ^ b << 30 ^ b << 19 ^ b << 10) | 0;
- w14 = t = (w15 >>> 7 ^ w15 >>> 18 ^ w15 >>> 3 ^ w15 << 25 ^ w15 << 14) + (w12 >>> 17 ^ w12 >>> 19 ^ w12 >>> 10 ^ w12 << 15 ^ w12 << 13) + w14 + w7 | 0;
- t = t + h + (e >>> 6 ^ e >>> 11 ^ e >>> 25 ^ e << 26 ^ e << 21 ^ e << 7) + (g ^ e & (f ^ g)) + 3204031479 | 0;
- h = g;
- g = f;
- f = e;
- e = d + t | 0;
- d = c;
- c = b;
- b = a;
- a = t + (b & c ^ d & (b ^ c)) + (b >>> 2 ^ b >>> 13 ^ b >>> 22 ^ b << 30 ^ b << 19 ^ b << 10) | 0;
- w15 = t = (w0 >>> 7 ^ w0 >>> 18 ^ w0 >>> 3 ^ w0 << 25 ^ w0 << 14) + (w13 >>> 17 ^ w13 >>> 19 ^ w13 >>> 10 ^ w13 << 15 ^ w13 << 13) + w15 + w8 | 0;
- t = t + h + (e >>> 6 ^ e >>> 11 ^ e >>> 25 ^ e << 26 ^ e << 21 ^ e << 7) + (g ^ e & (f ^ g)) + 3329325298 | 0;
- h = g;
- g = f;
- f = e;
- e = d + t | 0;
- d = c;
- c = b;
- b = a;
- a = t + (b & c ^ d & (b ^ c)) + (b >>> 2 ^ b >>> 13 ^ b >>> 22 ^ b << 30 ^ b << 19 ^ b << 10) | 0;
- H0 = H0 + a | 0;
- H1 = H1 + b | 0;
- H2 = H2 + c | 0;
- H3 = H3 + d | 0;
- H4 = H4 + e | 0;
- H5 = H5 + f | 0;
- H6 = H6 + g | 0;
- H7 = H7 + h | 0;
- }
- function _core_heap(offset) {
- offset = offset | 0;
- _core(HEAP[offset | 0] << 24 | HEAP[offset | 1] << 16 | HEAP[offset | 2] << 8 | HEAP[offset | 3], HEAP[offset | 4] << 24 | HEAP[offset | 5] << 16 | HEAP[offset | 6] << 8 | HEAP[offset | 7], HEAP[offset | 8] << 24 | HEAP[offset | 9] << 16 | HEAP[offset | 10] << 8 | HEAP[offset | 11], HEAP[offset | 12] << 24 | HEAP[offset | 13] << 16 | HEAP[offset | 14] << 8 | HEAP[offset | 15], HEAP[offset | 16] << 24 | HEAP[offset | 17] << 16 | HEAP[offset | 18] << 8 | HEAP[offset | 19], HEAP[offset | 20] << 24 | HEAP[offset | 21] << 16 | HEAP[offset | 22] << 8 | HEAP[offset | 23], HEAP[offset | 24] << 24 | HEAP[offset | 25] << 16 | HEAP[offset | 26] << 8 | HEAP[offset | 27], HEAP[offset | 28] << 24 | HEAP[offset | 29] << 16 | HEAP[offset | 30] << 8 | HEAP[offset | 31], HEAP[offset | 32] << 24 | HEAP[offset | 33] << 16 | HEAP[offset | 34] << 8 | HEAP[offset | 35], HEAP[offset | 36] << 24 | HEAP[offset | 37] << 16 | HEAP[offset | 38] << 8 | HEAP[offset | 39], HEAP[offset | 40] << 24 | HEAP[offset | 41] << 16 | HEAP[offset | 42] << 8 | HEAP[offset | 43], HEAP[offset | 44] << 24 | HEAP[offset | 45] << 16 | HEAP[offset | 46] << 8 | HEAP[offset | 47], HEAP[offset | 48] << 24 | HEAP[offset | 49] << 16 | HEAP[offset | 50] << 8 | HEAP[offset | 51], HEAP[offset | 52] << 24 | HEAP[offset | 53] << 16 | HEAP[offset | 54] << 8 | HEAP[offset | 55], HEAP[offset | 56] << 24 | HEAP[offset | 57] << 16 | HEAP[offset | 58] << 8 | HEAP[offset | 59], HEAP[offset | 60] << 24 | HEAP[offset | 61] << 16 | HEAP[offset | 62] << 8 | HEAP[offset | 63]);
- }
- function _state_to_heap(output) {
- output = output | 0;
- HEAP[output | 0] = H0 >>> 24;
- HEAP[output | 1] = H0 >>> 16 & 255;
- HEAP[output | 2] = H0 >>> 8 & 255;
- HEAP[output | 3] = H0 & 255;
- HEAP[output | 4] = H1 >>> 24;
- HEAP[output | 5] = H1 >>> 16 & 255;
- HEAP[output | 6] = H1 >>> 8 & 255;
- HEAP[output | 7] = H1 & 255;
- HEAP[output | 8] = H2 >>> 24;
- HEAP[output | 9] = H2 >>> 16 & 255;
- HEAP[output | 10] = H2 >>> 8 & 255;
- HEAP[output | 11] = H2 & 255;
- HEAP[output | 12] = H3 >>> 24;
- HEAP[output | 13] = H3 >>> 16 & 255;
- HEAP[output | 14] = H3 >>> 8 & 255;
- HEAP[output | 15] = H3 & 255;
- HEAP[output | 16] = H4 >>> 24;
- HEAP[output | 17] = H4 >>> 16 & 255;
- HEAP[output | 18] = H4 >>> 8 & 255;
- HEAP[output | 19] = H4 & 255;
- HEAP[output | 20] = H5 >>> 24;
- HEAP[output | 21] = H5 >>> 16 & 255;
- HEAP[output | 22] = H5 >>> 8 & 255;
- HEAP[output | 23] = H5 & 255;
- HEAP[output | 24] = H6 >>> 24;
- HEAP[output | 25] = H6 >>> 16 & 255;
- HEAP[output | 26] = H6 >>> 8 & 255;
- HEAP[output | 27] = H6 & 255;
- HEAP[output | 28] = H7 >>> 24;
- HEAP[output | 29] = H7 >>> 16 & 255;
- HEAP[output | 30] = H7 >>> 8 & 255;
- HEAP[output | 31] = H7 & 255;
- }
- function reset() {
- H0 = 1779033703;
- H1 = 3144134277;
- H2 = 1013904242;
- H3 = 2773480762;
- H4 = 1359893119;
- H5 = 2600822924;
- H6 = 528734635;
- H7 = 1541459225;
- TOTAL = 0;
- }
- function init(h0, h1, h2, h3, h4, h5, h6, h7, total) {
- h0 = h0 | 0;
- h1 = h1 | 0;
- h2 = h2 | 0;
- h3 = h3 | 0;
- h4 = h4 | 0;
- h5 = h5 | 0;
- h6 = h6 | 0;
- h7 = h7 | 0;
- total = total | 0;
- H0 = h0;
- H1 = h1;
- H2 = h2;
- H3 = h3;
- H4 = h4;
- H5 = h5;
- H6 = h6;
- H7 = h7;
- TOTAL = total;
- }
- function process(offset, length) {
- offset = offset | 0;
- length = length | 0;
- var hashed = 0;
- if (offset & 63) return -1;
- while ((length | 0) >= 64) {
- _core_heap(offset);
- offset = offset + 64 | 0;
- length = length - 64 | 0;
- hashed = hashed + 64 | 0;
- }
- TOTAL = TOTAL + hashed | 0;
- return hashed | 0;
- }
- function finish(offset, length, output) {
- offset = offset | 0;
- length = length | 0;
- output = output | 0;
- var hashed = 0, i = 0;
- if (offset & 63) return -1;
- if (~output) if (output & 31) return -1;
- if ((length | 0) >= 64) {
- hashed = process(offset, length) | 0;
- if ((hashed | 0) == -1) return -1;
- offset = offset + hashed | 0;
- length = length - hashed | 0;
- }
- hashed = hashed + length | 0;
- TOTAL = TOTAL + length | 0;
- HEAP[offset | length] = 128;
- if ((length | 0) >= 56) {
- for (i = length + 1 | 0; (i | 0) < 64; i = i + 1 | 0) HEAP[offset | i] = 0;
- _core_heap(offset);
- length = 0;
- HEAP[offset | 0] = 0;
- }
- for (i = length + 1 | 0; (i | 0) < 59; i = i + 1 | 0) HEAP[offset | i] = 0;
- HEAP[offset | 59] = TOTAL >>> 29;
- HEAP[offset | 60] = TOTAL >>> 21 & 255;
- HEAP[offset | 61] = TOTAL >>> 13 & 255;
- HEAP[offset | 62] = TOTAL >>> 5 & 255;
- HEAP[offset | 63] = TOTAL << 3 & 255;
- _core_heap(offset);
- if (~output) _state_to_heap(output);
- return hashed | 0;
- }
- function hmac_reset() {
- H0 = I0;
- H1 = I1;
- H2 = I2;
- H3 = I3;
- H4 = I4;
- H5 = I5;
- H6 = I6;
- H7 = I7;
- TOTAL = 64;
- }
- function _hmac_opad() {
- H0 = O0;
- H1 = O1;
- H2 = O2;
- H3 = O3;
- H4 = O4;
- H5 = O5;
- H6 = O6;
- H7 = O7;
- TOTAL = 64;
- }
- function hmac_init(p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, p10, p11, p12, p13, p14, p15) {
- p0 = p0 | 0;
- p1 = p1 | 0;
- p2 = p2 | 0;
- p3 = p3 | 0;
- p4 = p4 | 0;
- p5 = p5 | 0;
- p6 = p6 | 0;
- p7 = p7 | 0;
- p8 = p8 | 0;
- p9 = p9 | 0;
- p10 = p10 | 0;
- p11 = p11 | 0;
- p12 = p12 | 0;
- p13 = p13 | 0;
- p14 = p14 | 0;
- p15 = p15 | 0;
- reset();
- _core(p0 ^ 1549556828, p1 ^ 1549556828, p2 ^ 1549556828, p3 ^ 1549556828, p4 ^ 1549556828, p5 ^ 1549556828, p6 ^ 1549556828, p7 ^ 1549556828, p8 ^ 1549556828, p9 ^ 1549556828, p10 ^ 1549556828, p11 ^ 1549556828, p12 ^ 1549556828, p13 ^ 1549556828, p14 ^ 1549556828, p15 ^ 1549556828);
- O0 = H0;
- O1 = H1;
- O2 = H2;
- O3 = H3;
- O4 = H4;
- O5 = H5;
- O6 = H6;
- O7 = H7;
- reset();
- _core(p0 ^ 909522486, p1 ^ 909522486, p2 ^ 909522486, p3 ^ 909522486, p4 ^ 909522486, p5 ^ 909522486, p6 ^ 909522486, p7 ^ 909522486, p8 ^ 909522486, p9 ^ 909522486, p10 ^ 909522486, p11 ^ 909522486, p12 ^ 909522486, p13 ^ 909522486, p14 ^ 909522486, p15 ^ 909522486);
- I0 = H0;
- I1 = H1;
- I2 = H2;
- I3 = H3;
- I4 = H4;
- I5 = H5;
- I6 = H6;
- I7 = H7;
- TOTAL = 64;
- }
- function hmac_finish(offset, length, output) {
- offset = offset | 0;
- length = length | 0;
- output = output | 0;
- var t0 = 0, t1 = 0, t2 = 0, t3 = 0, t4 = 0, t5 = 0, t6 = 0, t7 = 0, hashed = 0;
- if (offset & 63) return -1;
- if (~output) if (output & 31) return -1;
- hashed = finish(offset, length, -1) | 0;
- t0 = H0, t1 = H1, t2 = H2, t3 = H3, t4 = H4, t5 = H5, t6 = H6, t7 = H7;
- _hmac_opad();
- _core(t0, t1, t2, t3, t4, t5, t6, t7, 2147483648, 0, 0, 0, 0, 0, 0, 768);
- if (~output) _state_to_heap(output);
- return hashed | 0;
- }
- function pbkdf2_generate_block(offset, length, block, count, output) {
- offset = offset | 0;
- length = length | 0;
- block = block | 0;
- count = count | 0;
- output = output | 0;
- var h0 = 0, h1 = 0, h2 = 0, h3 = 0, h4 = 0, h5 = 0, h6 = 0, h7 = 0, t0 = 0, t1 = 0, t2 = 0, t3 = 0, t4 = 0, t5 = 0, t6 = 0, t7 = 0;
- if (offset & 63) return -1;
- if (~output) if (output & 31) return -1;
- HEAP[offset + length | 0] = block >>> 24;
- HEAP[offset + length + 1 | 0] = block >>> 16 & 255;
- HEAP[offset + length + 2 | 0] = block >>> 8 & 255;
- HEAP[offset + length + 3 | 0] = block & 255;
- // Closure compiler warning - The result of the 'bitor' operator is not being used
- //hmac_finish(offset, length + 4 | 0, -1) | 0;
- hmac_finish(offset, length + 4 | 0, -1);
- h0 = t0 = H0, h1 = t1 = H1, h2 = t2 = H2, h3 = t3 = H3, h4 = t4 = H4, h5 = t5 = H5,
- h6 = t6 = H6, h7 = t7 = H7;
- count = count - 1 | 0;
- while ((count | 0) > 0) {
- hmac_reset();
- _core(t0, t1, t2, t3, t4, t5, t6, t7, 2147483648, 0, 0, 0, 0, 0, 0, 768);
- t0 = H0, t1 = H1, t2 = H2, t3 = H3, t4 = H4, t5 = H5, t6 = H6, t7 = H7;
- _hmac_opad();
- _core(t0, t1, t2, t3, t4, t5, t6, t7, 2147483648, 0, 0, 0, 0, 0, 0, 768);
- t0 = H0, t1 = H1, t2 = H2, t3 = H3, t4 = H4, t5 = H5, t6 = H6, t7 = H7;
- h0 = h0 ^ H0;
- h1 = h1 ^ H1;
- h2 = h2 ^ H2;
- h3 = h3 ^ H3;
- h4 = h4 ^ H4;
- h5 = h5 ^ H5;
- h6 = h6 ^ H6;
- h7 = h7 ^ H7;
- count = count - 1 | 0;
- }
- H0 = h0;
- H1 = h1;
- H2 = h2;
- H3 = h3;
- H4 = h4;
- H5 = h5;
- H6 = h6;
- H7 = h7;
- if (~output) _state_to_heap(output);
- return 0;
- }
- return {
- reset: reset,
- init: init,
- process: process,
- finish: finish,
- hmac_reset: hmac_reset,
- hmac_init: hmac_init,
- hmac_finish: hmac_finish,
- pbkdf2_generate_block: pbkdf2_generate_block
- };
- }
- var _sha256_block_size = 64, _sha256_hash_size = 32;
- function sha256_constructor(options) {
- options = options || {};
- options.heapSize = options.heapSize || 4096;
- if (options.heapSize <= 0 || options.heapSize % 4096) throw new IllegalArgumentError("heapSize must be a positive number and multiple of 4096");
- this.heap = options.heap || new Uint8Array(options.heapSize);
- this.asm = options.asm || sha256_asm(global, null, this.heap.buffer);
- this.BLOCK_SIZE = _sha256_block_size;
- this.HASH_SIZE = _sha256_hash_size;
- this.reset();
- }
- function sha256_reset() {
- this.result = null;
- this.pos = 0;
- this.len = 0;
- this.asm.reset();
- return this;
- }
- function sha256_process(data) {
- if (this.result !== null) throw new IllegalStateError("state must be reset before processing new data");
- var dpos = 0, dlen = 0, clen = 0;
- if (is_buffer(data) || is_bytes(data)) {
- dpos = data.byteOffset || 0;
- dlen = data.byteLength;
- } else if (is_string(data)) {
- dlen = data.length;
- } else {
- throw new TypeError("data isn't of expected type");
- }
- while (dlen > 0) {
- clen = this.heap.byteLength - this.pos - this.len;
- clen = clen < dlen ? clen : dlen;
- if (is_buffer(data) || is_bytes(data)) {
- this.heap.set(new Uint8Array(data.buffer || data, dpos, clen), this.pos + this.len);
- } else {
- for (var i = 0; i < clen; i++) this.heap[this.pos + this.len + i] = data.charCodeAt(dpos + i);
- }
- this.len += clen;
- dpos += clen;
- dlen -= clen;
- clen = this.asm.process(this.pos, this.len);
- if (clen < this.len) {
- this.pos += clen;
- this.len -= clen;
- } else {
- this.pos = 0;
- this.len = 0;
- }
- }
- return this;
- }
- function sha256_finish() {
- if (this.result !== null) throw new IllegalStateError("state must be reset before processing new data");
- this.asm.finish(this.pos, this.len, 0);
- this.result = new Uint8Array(_sha256_hash_size);
- this.result.set(this.heap.subarray(0, _sha256_hash_size));
- this.pos = 0;
- this.len = 0;
- return this;
- }
- sha256_constructor.BLOCK_SIZE = _sha256_block_size;
- sha256_constructor.HASH_SIZE = _sha256_hash_size;
- var sha256_prototype = sha256_constructor.prototype;
- sha256_prototype.reset = sha256_reset;
- sha256_prototype.process = sha256_process;
- sha256_prototype.finish = sha256_finish;
- function sha512_asm(stdlib, foreign, buffer) {
- // Closure Compiler warning - commented out
- //"use asm";
- var H0h = 0, H0l = 0, H1h = 0, H1l = 0, H2h = 0, H2l = 0, H3h = 0, H3l = 0, H4h = 0, H4l = 0, H5h = 0, H5l = 0, H6h = 0, H6l = 0, H7h = 0, H7l = 0, TOTAL = 0;
- var I0h = 0, I0l = 0, I1h = 0, I1l = 0, I2h = 0, I2l = 0, I3h = 0, I3l = 0, I4h = 0, I4l = 0, I5h = 0, I5l = 0, I6h = 0, I6l = 0, I7h = 0, I7l = 0, O0h = 0, O0l = 0, O1h = 0, O1l = 0, O2h = 0, O2l = 0, O3h = 0, O3l = 0, O4h = 0, O4l = 0, O5h = 0, O5l = 0, O6h = 0, O6l = 0, O7h = 0, O7l = 0;
- var HEAP = new stdlib.Uint8Array(buffer);
- function _core(w0h, w0l, w1h, w1l, w2h, w2l, w3h, w3l, w4h, w4l, w5h, w5l, w6h, w6l, w7h, w7l, w8h, w8l, w9h, w9l, w10h, w10l, w11h, w11l, w12h, w12l, w13h, w13l, w14h, w14l, w15h, w15l) {
- w0h = w0h | 0;
- w0l = w0l | 0;
- w1h = w1h | 0;
- w1l = w1l | 0;
- w2h = w2h | 0;
- w2l = w2l | 0;
- w3h = w3h | 0;
- w3l = w3l | 0;
- w4h = w4h | 0;
- w4l = w4l | 0;
- w5h = w5h | 0;
- w5l = w5l | 0;
- w6h = w6h | 0;
- w6l = w6l | 0;
- w7h = w7h | 0;
- w7l = w7l | 0;
- w8h = w8h | 0;
- w8l = w8l | 0;
- w9h = w9h | 0;
- w9l = w9l | 0;
- w10h = w10h | 0;
- w10l = w10l | 0;
- w11h = w11h | 0;
- w11l = w11l | 0;
- w12h = w12h | 0;
- w12l = w12l | 0;
- w13h = w13h | 0;
- w13l = w13l | 0;
- w14h = w14h | 0;
- w14l = w14l | 0;
- w15h = w15h | 0;
- w15l = w15l | 0;
- var ah = 0, al = 0, bh = 0, bl = 0, ch = 0, cl = 0, dh = 0, dl = 0, eh = 0, el = 0, fh = 0, fl = 0, gh = 0, gl = 0, hh = 0, hl = 0, th = 0, tl = 0, xl = 0;
- ah = H0h;
- al = H0l;
- bh = H1h;
- bl = H1l;
- ch = H2h;
- cl = H2l;
- dh = H3h;
- dl = H3l;
- eh = H4h;
- el = H4l;
- fh = H5h;
- fl = H5l;
- gh = H6h;
- gl = H6l;
- hh = H7h;
- hl = H7l;
- tl = 3609767458 + w0l | 0;
- th = 1116352408 + w0h + (tl >>> 0 < w0l >>> 0 ? 1 : 0) | 0;
- tl = tl + hl | 0;
- th = th + hh + (tl >>> 0 < hl >>> 0 ? 1 : 0) | 0;
- xl = (el >>> 14 | eh << 18) ^ (el >>> 18 | eh << 14) ^ (el << 23 | eh >>> 9) | 0;
- tl = tl + xl | 0;
- th = th + ((eh >>> 14 | el << 18) ^ (eh >>> 18 | el << 14) ^ (eh << 23 | el >>> 9)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = gl ^ el & (fl ^ gl) | 0;
- tl = tl + xl | 0;
- th = th + (gh ^ eh & (fh ^ gh)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- hl = gl;
- hh = gh;
- gl = fl;
- gh = fh;
- fl = el;
- fh = eh;
- el = dl + tl | 0;
- eh = dh + th + (el >>> 0 < dl >>> 0 ? 1 : 0) | 0;
- dl = cl;
- dh = ch;
- cl = bl;
- ch = bh;
- bl = al;
- bh = ah;
- al = tl + (bl & cl ^ dl & (bl ^ cl)) | 0;
- ah = th + (bh & ch ^ dh & (bh ^ ch)) + (al >>> 0 < tl >>> 0 ? 1 : 0) | 0;
- xl = (bl >>> 28 | bh << 4) ^ (bl << 30 | bh >>> 2) ^ (bl << 25 | bh >>> 7) | 0;
- al = al + xl | 0;
- ah = ah + ((bh >>> 28 | bl << 4) ^ (bh << 30 | bl >>> 2) ^ (bh << 25 | bl >>> 7)) + (al >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- tl = 602891725 + w1l | 0;
- th = 1899447441 + w1h + (tl >>> 0 < w1l >>> 0 ? 1 : 0) | 0;
- tl = tl + hl | 0;
- th = th + hh + (tl >>> 0 < hl >>> 0 ? 1 : 0) | 0;
- xl = (el >>> 14 | eh << 18) ^ (el >>> 18 | eh << 14) ^ (el << 23 | eh >>> 9) | 0;
- tl = tl + xl | 0;
- th = th + ((eh >>> 14 | el << 18) ^ (eh >>> 18 | el << 14) ^ (eh << 23 | el >>> 9)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = gl ^ el & (fl ^ gl) | 0;
- tl = tl + xl | 0;
- th = th + (gh ^ eh & (fh ^ gh)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- hl = gl;
- hh = gh;
- gl = fl;
- gh = fh;
- fl = el;
- fh = eh;
- el = dl + tl | 0;
- eh = dh + th + (el >>> 0 < dl >>> 0 ? 1 : 0) | 0;
- dl = cl;
- dh = ch;
- cl = bl;
- ch = bh;
- bl = al;
- bh = ah;
- al = tl + (bl & cl ^ dl & (bl ^ cl)) | 0;
- ah = th + (bh & ch ^ dh & (bh ^ ch)) + (al >>> 0 < tl >>> 0 ? 1 : 0) | 0;
- xl = (bl >>> 28 | bh << 4) ^ (bl << 30 | bh >>> 2) ^ (bl << 25 | bh >>> 7) | 0;
- al = al + xl | 0;
- ah = ah + ((bh >>> 28 | bl << 4) ^ (bh << 30 | bl >>> 2) ^ (bh << 25 | bl >>> 7)) + (al >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- tl = 3964484399 + w2l | 0;
- th = 3049323471 + w2h + (tl >>> 0 < w2l >>> 0 ? 1 : 0) | 0;
- tl = tl + hl | 0;
- th = th + hh + (tl >>> 0 < hl >>> 0 ? 1 : 0) | 0;
- xl = (el >>> 14 | eh << 18) ^ (el >>> 18 | eh << 14) ^ (el << 23 | eh >>> 9) | 0;
- tl = tl + xl | 0;
- th = th + ((eh >>> 14 | el << 18) ^ (eh >>> 18 | el << 14) ^ (eh << 23 | el >>> 9)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = gl ^ el & (fl ^ gl) | 0;
- tl = tl + xl | 0;
- th = th + (gh ^ eh & (fh ^ gh)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- hl = gl;
- hh = gh;
- gl = fl;
- gh = fh;
- fl = el;
- fh = eh;
- el = dl + tl | 0;
- eh = dh + th + (el >>> 0 < dl >>> 0 ? 1 : 0) | 0;
- dl = cl;
- dh = ch;
- cl = bl;
- ch = bh;
- bl = al;
- bh = ah;
- al = tl + (bl & cl ^ dl & (bl ^ cl)) | 0;
- ah = th + (bh & ch ^ dh & (bh ^ ch)) + (al >>> 0 < tl >>> 0 ? 1 : 0) | 0;
- xl = (bl >>> 28 | bh << 4) ^ (bl << 30 | bh >>> 2) ^ (bl << 25 | bh >>> 7) | 0;
- al = al + xl | 0;
- ah = ah + ((bh >>> 28 | bl << 4) ^ (bh << 30 | bl >>> 2) ^ (bh << 25 | bl >>> 7)) + (al >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- tl = 2173295548 + w3l | 0;
- th = 3921009573 + w3h + (tl >>> 0 < w3l >>> 0 ? 1 : 0) | 0;
- tl = tl + hl | 0;
- th = th + hh + (tl >>> 0 < hl >>> 0 ? 1 : 0) | 0;
- xl = (el >>> 14 | eh << 18) ^ (el >>> 18 | eh << 14) ^ (el << 23 | eh >>> 9) | 0;
- tl = tl + xl | 0;
- th = th + ((eh >>> 14 | el << 18) ^ (eh >>> 18 | el << 14) ^ (eh << 23 | el >>> 9)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = gl ^ el & (fl ^ gl) | 0;
- tl = tl + xl | 0;
- th = th + (gh ^ eh & (fh ^ gh)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- hl = gl;
- hh = gh;
- gl = fl;
- gh = fh;
- fl = el;
- fh = eh;
- el = dl + tl | 0;
- eh = dh + th + (el >>> 0 < dl >>> 0 ? 1 : 0) | 0;
- dl = cl;
- dh = ch;
- cl = bl;
- ch = bh;
- bl = al;
- bh = ah;
- al = tl + (bl & cl ^ dl & (bl ^ cl)) | 0;
- ah = th + (bh & ch ^ dh & (bh ^ ch)) + (al >>> 0 < tl >>> 0 ? 1 : 0) | 0;
- xl = (bl >>> 28 | bh << 4) ^ (bl << 30 | bh >>> 2) ^ (bl << 25 | bh >>> 7) | 0;
- al = al + xl | 0;
- ah = ah + ((bh >>> 28 | bl << 4) ^ (bh << 30 | bl >>> 2) ^ (bh << 25 | bl >>> 7)) + (al >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- tl = 4081628472 + w4l | 0;
- th = 961987163 + w4h + (tl >>> 0 < w4l >>> 0 ? 1 : 0) | 0;
- tl = tl + hl | 0;
- th = th + hh + (tl >>> 0 < hl >>> 0 ? 1 : 0) | 0;
- xl = (el >>> 14 | eh << 18) ^ (el >>> 18 | eh << 14) ^ (el << 23 | eh >>> 9) | 0;
- tl = tl + xl | 0;
- th = th + ((eh >>> 14 | el << 18) ^ (eh >>> 18 | el << 14) ^ (eh << 23 | el >>> 9)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = gl ^ el & (fl ^ gl) | 0;
- tl = tl + xl | 0;
- th = th + (gh ^ eh & (fh ^ gh)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- hl = gl;
- hh = gh;
- gl = fl;
- gh = fh;
- fl = el;
- fh = eh;
- el = dl + tl | 0;
- eh = dh + th + (el >>> 0 < dl >>> 0 ? 1 : 0) | 0;
- dl = cl;
- dh = ch;
- cl = bl;
- ch = bh;
- bl = al;
- bh = ah;
- al = tl + (bl & cl ^ dl & (bl ^ cl)) | 0;
- ah = th + (bh & ch ^ dh & (bh ^ ch)) + (al >>> 0 < tl >>> 0 ? 1 : 0) | 0;
- xl = (bl >>> 28 | bh << 4) ^ (bl << 30 | bh >>> 2) ^ (bl << 25 | bh >>> 7) | 0;
- al = al + xl | 0;
- ah = ah + ((bh >>> 28 | bl << 4) ^ (bh << 30 | bl >>> 2) ^ (bh << 25 | bl >>> 7)) + (al >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- tl = 3053834265 + w5l | 0;
- th = 1508970993 + w5h + (tl >>> 0 < w5l >>> 0 ? 1 : 0) | 0;
- tl = tl + hl | 0;
- th = th + hh + (tl >>> 0 < hl >>> 0 ? 1 : 0) | 0;
- xl = (el >>> 14 | eh << 18) ^ (el >>> 18 | eh << 14) ^ (el << 23 | eh >>> 9) | 0;
- tl = tl + xl | 0;
- th = th + ((eh >>> 14 | el << 18) ^ (eh >>> 18 | el << 14) ^ (eh << 23 | el >>> 9)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = gl ^ el & (fl ^ gl) | 0;
- tl = tl + xl | 0;
- th = th + (gh ^ eh & (fh ^ gh)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- hl = gl;
- hh = gh;
- gl = fl;
- gh = fh;
- fl = el;
- fh = eh;
- el = dl + tl | 0;
- eh = dh + th + (el >>> 0 < dl >>> 0 ? 1 : 0) | 0;
- dl = cl;
- dh = ch;
- cl = bl;
- ch = bh;
- bl = al;
- bh = ah;
- al = tl + (bl & cl ^ dl & (bl ^ cl)) | 0;
- ah = th + (bh & ch ^ dh & (bh ^ ch)) + (al >>> 0 < tl >>> 0 ? 1 : 0) | 0;
- xl = (bl >>> 28 | bh << 4) ^ (bl << 30 | bh >>> 2) ^ (bl << 25 | bh >>> 7) | 0;
- al = al + xl | 0;
- ah = ah + ((bh >>> 28 | bl << 4) ^ (bh << 30 | bl >>> 2) ^ (bh << 25 | bl >>> 7)) + (al >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- tl = 2937671579 + w6l | 0;
- th = 2453635748 + w6h + (tl >>> 0 < w6l >>> 0 ? 1 : 0) | 0;
- tl = tl + hl | 0;
- th = th + hh + (tl >>> 0 < hl >>> 0 ? 1 : 0) | 0;
- xl = (el >>> 14 | eh << 18) ^ (el >>> 18 | eh << 14) ^ (el << 23 | eh >>> 9) | 0;
- tl = tl + xl | 0;
- th = th + ((eh >>> 14 | el << 18) ^ (eh >>> 18 | el << 14) ^ (eh << 23 | el >>> 9)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = gl ^ el & (fl ^ gl) | 0;
- tl = tl + xl | 0;
- th = th + (gh ^ eh & (fh ^ gh)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- hl = gl;
- hh = gh;
- gl = fl;
- gh = fh;
- fl = el;
- fh = eh;
- el = dl + tl | 0;
- eh = dh + th + (el >>> 0 < dl >>> 0 ? 1 : 0) | 0;
- dl = cl;
- dh = ch;
- cl = bl;
- ch = bh;
- bl = al;
- bh = ah;
- al = tl + (bl & cl ^ dl & (bl ^ cl)) | 0;
- ah = th + (bh & ch ^ dh & (bh ^ ch)) + (al >>> 0 < tl >>> 0 ? 1 : 0) | 0;
- xl = (bl >>> 28 | bh << 4) ^ (bl << 30 | bh >>> 2) ^ (bl << 25 | bh >>> 7) | 0;
- al = al + xl | 0;
- ah = ah + ((bh >>> 28 | bl << 4) ^ (bh << 30 | bl >>> 2) ^ (bh << 25 | bl >>> 7)) + (al >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- tl = 3664609560 + w7l | 0;
- th = 2870763221 + w7h + (tl >>> 0 < w7l >>> 0 ? 1 : 0) | 0;
- tl = tl + hl | 0;
- th = th + hh + (tl >>> 0 < hl >>> 0 ? 1 : 0) | 0;
- xl = (el >>> 14 | eh << 18) ^ (el >>> 18 | eh << 14) ^ (el << 23 | eh >>> 9) | 0;
- tl = tl + xl | 0;
- th = th + ((eh >>> 14 | el << 18) ^ (eh >>> 18 | el << 14) ^ (eh << 23 | el >>> 9)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = gl ^ el & (fl ^ gl) | 0;
- tl = tl + xl | 0;
- th = th + (gh ^ eh & (fh ^ gh)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- hl = gl;
- hh = gh;
- gl = fl;
- gh = fh;
- fl = el;
- fh = eh;
- el = dl + tl | 0;
- eh = dh + th + (el >>> 0 < dl >>> 0 ? 1 : 0) | 0;
- dl = cl;
- dh = ch;
- cl = bl;
- ch = bh;
- bl = al;
- bh = ah;
- al = tl + (bl & cl ^ dl & (bl ^ cl)) | 0;
- ah = th + (bh & ch ^ dh & (bh ^ ch)) + (al >>> 0 < tl >>> 0 ? 1 : 0) | 0;
- xl = (bl >>> 28 | bh << 4) ^ (bl << 30 | bh >>> 2) ^ (bl << 25 | bh >>> 7) | 0;
- al = al + xl | 0;
- ah = ah + ((bh >>> 28 | bl << 4) ^ (bh << 30 | bl >>> 2) ^ (bh << 25 | bl >>> 7)) + (al >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- tl = 2734883394 + w8l | 0;
- th = 3624381080 + w8h + (tl >>> 0 < w8l >>> 0 ? 1 : 0) | 0;
- tl = tl + hl | 0;
- th = th + hh + (tl >>> 0 < hl >>> 0 ? 1 : 0) | 0;
- xl = (el >>> 14 | eh << 18) ^ (el >>> 18 | eh << 14) ^ (el << 23 | eh >>> 9) | 0;
- tl = tl + xl | 0;
- th = th + ((eh >>> 14 | el << 18) ^ (eh >>> 18 | el << 14) ^ (eh << 23 | el >>> 9)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = gl ^ el & (fl ^ gl) | 0;
- tl = tl + xl | 0;
- th = th + (gh ^ eh & (fh ^ gh)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- hl = gl;
- hh = gh;
- gl = fl;
- gh = fh;
- fl = el;
- fh = eh;
- el = dl + tl | 0;
- eh = dh + th + (el >>> 0 < dl >>> 0 ? 1 : 0) | 0;
- dl = cl;
- dh = ch;
- cl = bl;
- ch = bh;
- bl = al;
- bh = ah;
- al = tl + (bl & cl ^ dl & (bl ^ cl)) | 0;
- ah = th + (bh & ch ^ dh & (bh ^ ch)) + (al >>> 0 < tl >>> 0 ? 1 : 0) | 0;
- xl = (bl >>> 28 | bh << 4) ^ (bl << 30 | bh >>> 2) ^ (bl << 25 | bh >>> 7) | 0;
- al = al + xl | 0;
- ah = ah + ((bh >>> 28 | bl << 4) ^ (bh << 30 | bl >>> 2) ^ (bh << 25 | bl >>> 7)) + (al >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- tl = 1164996542 + w9l | 0;
- th = 310598401 + w9h + (tl >>> 0 < w9l >>> 0 ? 1 : 0) | 0;
- tl = tl + hl | 0;
- th = th + hh + (tl >>> 0 < hl >>> 0 ? 1 : 0) | 0;
- xl = (el >>> 14 | eh << 18) ^ (el >>> 18 | eh << 14) ^ (el << 23 | eh >>> 9) | 0;
- tl = tl + xl | 0;
- th = th + ((eh >>> 14 | el << 18) ^ (eh >>> 18 | el << 14) ^ (eh << 23 | el >>> 9)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = gl ^ el & (fl ^ gl) | 0;
- tl = tl + xl | 0;
- th = th + (gh ^ eh & (fh ^ gh)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- hl = gl;
- hh = gh;
- gl = fl;
- gh = fh;
- fl = el;
- fh = eh;
- el = dl + tl | 0;
- eh = dh + th + (el >>> 0 < dl >>> 0 ? 1 : 0) | 0;
- dl = cl;
- dh = ch;
- cl = bl;
- ch = bh;
- bl = al;
- bh = ah;
- al = tl + (bl & cl ^ dl & (bl ^ cl)) | 0;
- ah = th + (bh & ch ^ dh & (bh ^ ch)) + (al >>> 0 < tl >>> 0 ? 1 : 0) | 0;
- xl = (bl >>> 28 | bh << 4) ^ (bl << 30 | bh >>> 2) ^ (bl << 25 | bh >>> 7) | 0;
- al = al + xl | 0;
- ah = ah + ((bh >>> 28 | bl << 4) ^ (bh << 30 | bl >>> 2) ^ (bh << 25 | bl >>> 7)) + (al >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- tl = 1323610764 + w10l | 0;
- th = 607225278 + w10h + (tl >>> 0 < w10l >>> 0 ? 1 : 0) | 0;
- tl = tl + hl | 0;
- th = th + hh + (tl >>> 0 < hl >>> 0 ? 1 : 0) | 0;
- xl = (el >>> 14 | eh << 18) ^ (el >>> 18 | eh << 14) ^ (el << 23 | eh >>> 9) | 0;
- tl = tl + xl | 0;
- th = th + ((eh >>> 14 | el << 18) ^ (eh >>> 18 | el << 14) ^ (eh << 23 | el >>> 9)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = gl ^ el & (fl ^ gl) | 0;
- tl = tl + xl | 0;
- th = th + (gh ^ eh & (fh ^ gh)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- hl = gl;
- hh = gh;
- gl = fl;
- gh = fh;
- fl = el;
- fh = eh;
- el = dl + tl | 0;
- eh = dh + th + (el >>> 0 < dl >>> 0 ? 1 : 0) | 0;
- dl = cl;
- dh = ch;
- cl = bl;
- ch = bh;
- bl = al;
- bh = ah;
- al = tl + (bl & cl ^ dl & (bl ^ cl)) | 0;
- ah = th + (bh & ch ^ dh & (bh ^ ch)) + (al >>> 0 < tl >>> 0 ? 1 : 0) | 0;
- xl = (bl >>> 28 | bh << 4) ^ (bl << 30 | bh >>> 2) ^ (bl << 25 | bh >>> 7) | 0;
- al = al + xl | 0;
- ah = ah + ((bh >>> 28 | bl << 4) ^ (bh << 30 | bl >>> 2) ^ (bh << 25 | bl >>> 7)) + (al >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- tl = 3590304994 + w11l | 0;
- th = 1426881987 + w11h + (tl >>> 0 < w11l >>> 0 ? 1 : 0) | 0;
- tl = tl + hl | 0;
- th = th + hh + (tl >>> 0 < hl >>> 0 ? 1 : 0) | 0;
- xl = (el >>> 14 | eh << 18) ^ (el >>> 18 | eh << 14) ^ (el << 23 | eh >>> 9) | 0;
- tl = tl + xl | 0;
- th = th + ((eh >>> 14 | el << 18) ^ (eh >>> 18 | el << 14) ^ (eh << 23 | el >>> 9)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = gl ^ el & (fl ^ gl) | 0;
- tl = tl + xl | 0;
- th = th + (gh ^ eh & (fh ^ gh)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- hl = gl;
- hh = gh;
- gl = fl;
- gh = fh;
- fl = el;
- fh = eh;
- el = dl + tl | 0;
- eh = dh + th + (el >>> 0 < dl >>> 0 ? 1 : 0) | 0;
- dl = cl;
- dh = ch;
- cl = bl;
- ch = bh;
- bl = al;
- bh = ah;
- al = tl + (bl & cl ^ dl & (bl ^ cl)) | 0;
- ah = th + (bh & ch ^ dh & (bh ^ ch)) + (al >>> 0 < tl >>> 0 ? 1 : 0) | 0;
- xl = (bl >>> 28 | bh << 4) ^ (bl << 30 | bh >>> 2) ^ (bl << 25 | bh >>> 7) | 0;
- al = al + xl | 0;
- ah = ah + ((bh >>> 28 | bl << 4) ^ (bh << 30 | bl >>> 2) ^ (bh << 25 | bl >>> 7)) + (al >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- tl = 4068182383 + w12l | 0;
- th = 1925078388 + w12h + (tl >>> 0 < w12l >>> 0 ? 1 : 0) | 0;
- tl = tl + hl | 0;
- th = th + hh + (tl >>> 0 < hl >>> 0 ? 1 : 0) | 0;
- xl = (el >>> 14 | eh << 18) ^ (el >>> 18 | eh << 14) ^ (el << 23 | eh >>> 9) | 0;
- tl = tl + xl | 0;
- th = th + ((eh >>> 14 | el << 18) ^ (eh >>> 18 | el << 14) ^ (eh << 23 | el >>> 9)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = gl ^ el & (fl ^ gl) | 0;
- tl = tl + xl | 0;
- th = th + (gh ^ eh & (fh ^ gh)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- hl = gl;
- hh = gh;
- gl = fl;
- gh = fh;
- fl = el;
- fh = eh;
- el = dl + tl | 0;
- eh = dh + th + (el >>> 0 < dl >>> 0 ? 1 : 0) | 0;
- dl = cl;
- dh = ch;
- cl = bl;
- ch = bh;
- bl = al;
- bh = ah;
- al = tl + (bl & cl ^ dl & (bl ^ cl)) | 0;
- ah = th + (bh & ch ^ dh & (bh ^ ch)) + (al >>> 0 < tl >>> 0 ? 1 : 0) | 0;
- xl = (bl >>> 28 | bh << 4) ^ (bl << 30 | bh >>> 2) ^ (bl << 25 | bh >>> 7) | 0;
- al = al + xl | 0;
- ah = ah + ((bh >>> 28 | bl << 4) ^ (bh << 30 | bl >>> 2) ^ (bh << 25 | bl >>> 7)) + (al >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- tl = 991336113 + w13l | 0;
- th = 2162078206 + w13h + (tl >>> 0 < w13l >>> 0 ? 1 : 0) | 0;
- tl = tl + hl | 0;
- th = th + hh + (tl >>> 0 < hl >>> 0 ? 1 : 0) | 0;
- xl = (el >>> 14 | eh << 18) ^ (el >>> 18 | eh << 14) ^ (el << 23 | eh >>> 9) | 0;
- tl = tl + xl | 0;
- th = th + ((eh >>> 14 | el << 18) ^ (eh >>> 18 | el << 14) ^ (eh << 23 | el >>> 9)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = gl ^ el & (fl ^ gl) | 0;
- tl = tl + xl | 0;
- th = th + (gh ^ eh & (fh ^ gh)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- hl = gl;
- hh = gh;
- gl = fl;
- gh = fh;
- fl = el;
- fh = eh;
- el = dl + tl | 0;
- eh = dh + th + (el >>> 0 < dl >>> 0 ? 1 : 0) | 0;
- dl = cl;
- dh = ch;
- cl = bl;
- ch = bh;
- bl = al;
- bh = ah;
- al = tl + (bl & cl ^ dl & (bl ^ cl)) | 0;
- ah = th + (bh & ch ^ dh & (bh ^ ch)) + (al >>> 0 < tl >>> 0 ? 1 : 0) | 0;
- xl = (bl >>> 28 | bh << 4) ^ (bl << 30 | bh >>> 2) ^ (bl << 25 | bh >>> 7) | 0;
- al = al + xl | 0;
- ah = ah + ((bh >>> 28 | bl << 4) ^ (bh << 30 | bl >>> 2) ^ (bh << 25 | bl >>> 7)) + (al >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- tl = 633803317 + w14l | 0;
- th = 2614888103 + w14h + (tl >>> 0 < w14l >>> 0 ? 1 : 0) | 0;
- tl = tl + hl | 0;
- th = th + hh + (tl >>> 0 < hl >>> 0 ? 1 : 0) | 0;
- xl = (el >>> 14 | eh << 18) ^ (el >>> 18 | eh << 14) ^ (el << 23 | eh >>> 9) | 0;
- tl = tl + xl | 0;
- th = th + ((eh >>> 14 | el << 18) ^ (eh >>> 18 | el << 14) ^ (eh << 23 | el >>> 9)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = gl ^ el & (fl ^ gl) | 0;
- tl = tl + xl | 0;
- th = th + (gh ^ eh & (fh ^ gh)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- hl = gl;
- hh = gh;
- gl = fl;
- gh = fh;
- fl = el;
- fh = eh;
- el = dl + tl | 0;
- eh = dh + th + (el >>> 0 < dl >>> 0 ? 1 : 0) | 0;
- dl = cl;
- dh = ch;
- cl = bl;
- ch = bh;
- bl = al;
- bh = ah;
- al = tl + (bl & cl ^ dl & (bl ^ cl)) | 0;
- ah = th + (bh & ch ^ dh & (bh ^ ch)) + (al >>> 0 < tl >>> 0 ? 1 : 0) | 0;
- xl = (bl >>> 28 | bh << 4) ^ (bl << 30 | bh >>> 2) ^ (bl << 25 | bh >>> 7) | 0;
- al = al + xl | 0;
- ah = ah + ((bh >>> 28 | bl << 4) ^ (bh << 30 | bl >>> 2) ^ (bh << 25 | bl >>> 7)) + (al >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- tl = 3479774868 + w15l | 0;
- th = 3248222580 + w15h + (tl >>> 0 < w15l >>> 0 ? 1 : 0) | 0;
- tl = tl + hl | 0;
- th = th + hh + (tl >>> 0 < hl >>> 0 ? 1 : 0) | 0;
- xl = (el >>> 14 | eh << 18) ^ (el >>> 18 | eh << 14) ^ (el << 23 | eh >>> 9) | 0;
- tl = tl + xl | 0;
- th = th + ((eh >>> 14 | el << 18) ^ (eh >>> 18 | el << 14) ^ (eh << 23 | el >>> 9)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = gl ^ el & (fl ^ gl) | 0;
- tl = tl + xl | 0;
- th = th + (gh ^ eh & (fh ^ gh)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- hl = gl;
- hh = gh;
- gl = fl;
- gh = fh;
- fl = el;
- fh = eh;
- el = dl + tl | 0;
- eh = dh + th + (el >>> 0 < dl >>> 0 ? 1 : 0) | 0;
- dl = cl;
- dh = ch;
- cl = bl;
- ch = bh;
- bl = al;
- bh = ah;
- al = tl + (bl & cl ^ dl & (bl ^ cl)) | 0;
- ah = th + (bh & ch ^ dh & (bh ^ ch)) + (al >>> 0 < tl >>> 0 ? 1 : 0) | 0;
- xl = (bl >>> 28 | bh << 4) ^ (bl << 30 | bh >>> 2) ^ (bl << 25 | bh >>> 7) | 0;
- al = al + xl | 0;
- ah = ah + ((bh >>> 28 | bl << 4) ^ (bh << 30 | bl >>> 2) ^ (bh << 25 | bl >>> 7)) + (al >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- w0l = w0l + w9l | 0;
- w0h = w0h + w9h + (w0l >>> 0 < w9l >>> 0 ? 1 : 0) | 0;
- xl = (w1l >>> 1 | w1h << 31) ^ (w1l >>> 8 | w1h << 24) ^ (w1l >>> 7 | w1h << 25) | 0;
- w0l = w0l + xl | 0;
- w0h = w0h + ((w1h >>> 1 | w1l << 31) ^ (w1h >>> 8 | w1l << 24) ^ w1h >>> 7) + (w0l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = (w14l >>> 19 | w14h << 13) ^ (w14l << 3 | w14h >>> 29) ^ (w14l >>> 6 | w14h << 26) | 0;
- w0l = w0l + xl | 0;
- w0h = w0h + ((w14h >>> 19 | w14l << 13) ^ (w14h << 3 | w14l >>> 29) ^ w14h >>> 6) + (w0l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- tl = 2666613458 + w0l | 0;
- th = 3835390401 + w0h + (tl >>> 0 < w0l >>> 0 ? 1 : 0) | 0;
- tl = tl + hl | 0;
- th = th + hh + (tl >>> 0 < hl >>> 0 ? 1 : 0) | 0;
- xl = (el >>> 14 | eh << 18) ^ (el >>> 18 | eh << 14) ^ (el << 23 | eh >>> 9) | 0;
- tl = tl + xl | 0;
- th = th + ((eh >>> 14 | el << 18) ^ (eh >>> 18 | el << 14) ^ (eh << 23 | el >>> 9)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = gl ^ el & (fl ^ gl) | 0;
- tl = tl + xl | 0;
- th = th + (gh ^ eh & (fh ^ gh)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- hl = gl;
- hh = gh;
- gl = fl;
- gh = fh;
- fl = el;
- fh = eh;
- el = dl + tl | 0;
- eh = dh + th + (el >>> 0 < dl >>> 0 ? 1 : 0) | 0;
- dl = cl;
- dh = ch;
- cl = bl;
- ch = bh;
- bl = al;
- bh = ah;
- al = tl + (bl & cl ^ dl & (bl ^ cl)) | 0;
- ah = th + (bh & ch ^ dh & (bh ^ ch)) + (al >>> 0 < tl >>> 0 ? 1 : 0) | 0;
- xl = (bl >>> 28 | bh << 4) ^ (bl << 30 | bh >>> 2) ^ (bl << 25 | bh >>> 7) | 0;
- al = al + xl | 0;
- ah = ah + ((bh >>> 28 | bl << 4) ^ (bh << 30 | bl >>> 2) ^ (bh << 25 | bl >>> 7)) + (al >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- w1l = w1l + w10l | 0;
- w1h = w1h + w10h + (w1l >>> 0 < w10l >>> 0 ? 1 : 0) | 0;
- xl = (w2l >>> 1 | w2h << 31) ^ (w2l >>> 8 | w2h << 24) ^ (w2l >>> 7 | w2h << 25) | 0;
- w1l = w1l + xl | 0;
- w1h = w1h + ((w2h >>> 1 | w2l << 31) ^ (w2h >>> 8 | w2l << 24) ^ w2h >>> 7) + (w1l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = (w15l >>> 19 | w15h << 13) ^ (w15l << 3 | w15h >>> 29) ^ (w15l >>> 6 | w15h << 26) | 0;
- w1l = w1l + xl | 0;
- w1h = w1h + ((w15h >>> 19 | w15l << 13) ^ (w15h << 3 | w15l >>> 29) ^ w15h >>> 6) + (w1l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- tl = 944711139 + w1l | 0;
- th = 4022224774 + w1h + (tl >>> 0 < w1l >>> 0 ? 1 : 0) | 0;
- tl = tl + hl | 0;
- th = th + hh + (tl >>> 0 < hl >>> 0 ? 1 : 0) | 0;
- xl = (el >>> 14 | eh << 18) ^ (el >>> 18 | eh << 14) ^ (el << 23 | eh >>> 9) | 0;
- tl = tl + xl | 0;
- th = th + ((eh >>> 14 | el << 18) ^ (eh >>> 18 | el << 14) ^ (eh << 23 | el >>> 9)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = gl ^ el & (fl ^ gl) | 0;
- tl = tl + xl | 0;
- th = th + (gh ^ eh & (fh ^ gh)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- hl = gl;
- hh = gh;
- gl = fl;
- gh = fh;
- fl = el;
- fh = eh;
- el = dl + tl | 0;
- eh = dh + th + (el >>> 0 < dl >>> 0 ? 1 : 0) | 0;
- dl = cl;
- dh = ch;
- cl = bl;
- ch = bh;
- bl = al;
- bh = ah;
- al = tl + (bl & cl ^ dl & (bl ^ cl)) | 0;
- ah = th + (bh & ch ^ dh & (bh ^ ch)) + (al >>> 0 < tl >>> 0 ? 1 : 0) | 0;
- xl = (bl >>> 28 | bh << 4) ^ (bl << 30 | bh >>> 2) ^ (bl << 25 | bh >>> 7) | 0;
- al = al + xl | 0;
- ah = ah + ((bh >>> 28 | bl << 4) ^ (bh << 30 | bl >>> 2) ^ (bh << 25 | bl >>> 7)) + (al >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- w2l = w2l + w11l | 0;
- w2h = w2h + w11h + (w2l >>> 0 < w11l >>> 0 ? 1 : 0) | 0;
- xl = (w3l >>> 1 | w3h << 31) ^ (w3l >>> 8 | w3h << 24) ^ (w3l >>> 7 | w3h << 25) | 0;
- w2l = w2l + xl | 0;
- w2h = w2h + ((w3h >>> 1 | w3l << 31) ^ (w3h >>> 8 | w3l << 24) ^ w3h >>> 7) + (w2l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = (w0l >>> 19 | w0h << 13) ^ (w0l << 3 | w0h >>> 29) ^ (w0l >>> 6 | w0h << 26) | 0;
- w2l = w2l + xl | 0;
- w2h = w2h + ((w0h >>> 19 | w0l << 13) ^ (w0h << 3 | w0l >>> 29) ^ w0h >>> 6) + (w2l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- tl = 2341262773 + w2l | 0;
- th = 264347078 + w2h + (tl >>> 0 < w2l >>> 0 ? 1 : 0) | 0;
- tl = tl + hl | 0;
- th = th + hh + (tl >>> 0 < hl >>> 0 ? 1 : 0) | 0;
- xl = (el >>> 14 | eh << 18) ^ (el >>> 18 | eh << 14) ^ (el << 23 | eh >>> 9) | 0;
- tl = tl + xl | 0;
- th = th + ((eh >>> 14 | el << 18) ^ (eh >>> 18 | el << 14) ^ (eh << 23 | el >>> 9)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = gl ^ el & (fl ^ gl) | 0;
- tl = tl + xl | 0;
- th = th + (gh ^ eh & (fh ^ gh)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- hl = gl;
- hh = gh;
- gl = fl;
- gh = fh;
- fl = el;
- fh = eh;
- el = dl + tl | 0;
- eh = dh + th + (el >>> 0 < dl >>> 0 ? 1 : 0) | 0;
- dl = cl;
- dh = ch;
- cl = bl;
- ch = bh;
- bl = al;
- bh = ah;
- al = tl + (bl & cl ^ dl & (bl ^ cl)) | 0;
- ah = th + (bh & ch ^ dh & (bh ^ ch)) + (al >>> 0 < tl >>> 0 ? 1 : 0) | 0;
- xl = (bl >>> 28 | bh << 4) ^ (bl << 30 | bh >>> 2) ^ (bl << 25 | bh >>> 7) | 0;
- al = al + xl | 0;
- ah = ah + ((bh >>> 28 | bl << 4) ^ (bh << 30 | bl >>> 2) ^ (bh << 25 | bl >>> 7)) + (al >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- w3l = w3l + w12l | 0;
- w3h = w3h + w12h + (w3l >>> 0 < w12l >>> 0 ? 1 : 0) | 0;
- xl = (w4l >>> 1 | w4h << 31) ^ (w4l >>> 8 | w4h << 24) ^ (w4l >>> 7 | w4h << 25) | 0;
- w3l = w3l + xl | 0;
- w3h = w3h + ((w4h >>> 1 | w4l << 31) ^ (w4h >>> 8 | w4l << 24) ^ w4h >>> 7) + (w3l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = (w1l >>> 19 | w1h << 13) ^ (w1l << 3 | w1h >>> 29) ^ (w1l >>> 6 | w1h << 26) | 0;
- w3l = w3l + xl | 0;
- w3h = w3h + ((w1h >>> 19 | w1l << 13) ^ (w1h << 3 | w1l >>> 29) ^ w1h >>> 6) + (w3l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- tl = 2007800933 + w3l | 0;
- th = 604807628 + w3h + (tl >>> 0 < w3l >>> 0 ? 1 : 0) | 0;
- tl = tl + hl | 0;
- th = th + hh + (tl >>> 0 < hl >>> 0 ? 1 : 0) | 0;
- xl = (el >>> 14 | eh << 18) ^ (el >>> 18 | eh << 14) ^ (el << 23 | eh >>> 9) | 0;
- tl = tl + xl | 0;
- th = th + ((eh >>> 14 | el << 18) ^ (eh >>> 18 | el << 14) ^ (eh << 23 | el >>> 9)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = gl ^ el & (fl ^ gl) | 0;
- tl = tl + xl | 0;
- th = th + (gh ^ eh & (fh ^ gh)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- hl = gl;
- hh = gh;
- gl = fl;
- gh = fh;
- fl = el;
- fh = eh;
- el = dl + tl | 0;
- eh = dh + th + (el >>> 0 < dl >>> 0 ? 1 : 0) | 0;
- dl = cl;
- dh = ch;
- cl = bl;
- ch = bh;
- bl = al;
- bh = ah;
- al = tl + (bl & cl ^ dl & (bl ^ cl)) | 0;
- ah = th + (bh & ch ^ dh & (bh ^ ch)) + (al >>> 0 < tl >>> 0 ? 1 : 0) | 0;
- xl = (bl >>> 28 | bh << 4) ^ (bl << 30 | bh >>> 2) ^ (bl << 25 | bh >>> 7) | 0;
- al = al + xl | 0;
- ah = ah + ((bh >>> 28 | bl << 4) ^ (bh << 30 | bl >>> 2) ^ (bh << 25 | bl >>> 7)) + (al >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- w4l = w4l + w13l | 0;
- w4h = w4h + w13h + (w4l >>> 0 < w13l >>> 0 ? 1 : 0) | 0;
- xl = (w5l >>> 1 | w5h << 31) ^ (w5l >>> 8 | w5h << 24) ^ (w5l >>> 7 | w5h << 25) | 0;
- w4l = w4l + xl | 0;
- w4h = w4h + ((w5h >>> 1 | w5l << 31) ^ (w5h >>> 8 | w5l << 24) ^ w5h >>> 7) + (w4l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = (w2l >>> 19 | w2h << 13) ^ (w2l << 3 | w2h >>> 29) ^ (w2l >>> 6 | w2h << 26) | 0;
- w4l = w4l + xl | 0;
- w4h = w4h + ((w2h >>> 19 | w2l << 13) ^ (w2h << 3 | w2l >>> 29) ^ w2h >>> 6) + (w4l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- tl = 1495990901 + w4l | 0;
- th = 770255983 + w4h + (tl >>> 0 < w4l >>> 0 ? 1 : 0) | 0;
- tl = tl + hl | 0;
- th = th + hh + (tl >>> 0 < hl >>> 0 ? 1 : 0) | 0;
- xl = (el >>> 14 | eh << 18) ^ (el >>> 18 | eh << 14) ^ (el << 23 | eh >>> 9) | 0;
- tl = tl + xl | 0;
- th = th + ((eh >>> 14 | el << 18) ^ (eh >>> 18 | el << 14) ^ (eh << 23 | el >>> 9)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = gl ^ el & (fl ^ gl) | 0;
- tl = tl + xl | 0;
- th = th + (gh ^ eh & (fh ^ gh)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- hl = gl;
- hh = gh;
- gl = fl;
- gh = fh;
- fl = el;
- fh = eh;
- el = dl + tl | 0;
- eh = dh + th + (el >>> 0 < dl >>> 0 ? 1 : 0) | 0;
- dl = cl;
- dh = ch;
- cl = bl;
- ch = bh;
- bl = al;
- bh = ah;
- al = tl + (bl & cl ^ dl & (bl ^ cl)) | 0;
- ah = th + (bh & ch ^ dh & (bh ^ ch)) + (al >>> 0 < tl >>> 0 ? 1 : 0) | 0;
- xl = (bl >>> 28 | bh << 4) ^ (bl << 30 | bh >>> 2) ^ (bl << 25 | bh >>> 7) | 0;
- al = al + xl | 0;
- ah = ah + ((bh >>> 28 | bl << 4) ^ (bh << 30 | bl >>> 2) ^ (bh << 25 | bl >>> 7)) + (al >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- w5l = w5l + w14l | 0;
- w5h = w5h + w14h + (w5l >>> 0 < w14l >>> 0 ? 1 : 0) | 0;
- xl = (w6l >>> 1 | w6h << 31) ^ (w6l >>> 8 | w6h << 24) ^ (w6l >>> 7 | w6h << 25) | 0;
- w5l = w5l + xl | 0;
- w5h = w5h + ((w6h >>> 1 | w6l << 31) ^ (w6h >>> 8 | w6l << 24) ^ w6h >>> 7) + (w5l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = (w3l >>> 19 | w3h << 13) ^ (w3l << 3 | w3h >>> 29) ^ (w3l >>> 6 | w3h << 26) | 0;
- w5l = w5l + xl | 0;
- w5h = w5h + ((w3h >>> 19 | w3l << 13) ^ (w3h << 3 | w3l >>> 29) ^ w3h >>> 6) + (w5l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- tl = 1856431235 + w5l | 0;
- th = 1249150122 + w5h + (tl >>> 0 < w5l >>> 0 ? 1 : 0) | 0;
- tl = tl + hl | 0;
- th = th + hh + (tl >>> 0 < hl >>> 0 ? 1 : 0) | 0;
- xl = (el >>> 14 | eh << 18) ^ (el >>> 18 | eh << 14) ^ (el << 23 | eh >>> 9) | 0;
- tl = tl + xl | 0;
- th = th + ((eh >>> 14 | el << 18) ^ (eh >>> 18 | el << 14) ^ (eh << 23 | el >>> 9)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = gl ^ el & (fl ^ gl) | 0;
- tl = tl + xl | 0;
- th = th + (gh ^ eh & (fh ^ gh)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- hl = gl;
- hh = gh;
- gl = fl;
- gh = fh;
- fl = el;
- fh = eh;
- el = dl + tl | 0;
- eh = dh + th + (el >>> 0 < dl >>> 0 ? 1 : 0) | 0;
- dl = cl;
- dh = ch;
- cl = bl;
- ch = bh;
- bl = al;
- bh = ah;
- al = tl + (bl & cl ^ dl & (bl ^ cl)) | 0;
- ah = th + (bh & ch ^ dh & (bh ^ ch)) + (al >>> 0 < tl >>> 0 ? 1 : 0) | 0;
- xl = (bl >>> 28 | bh << 4) ^ (bl << 30 | bh >>> 2) ^ (bl << 25 | bh >>> 7) | 0;
- al = al + xl | 0;
- ah = ah + ((bh >>> 28 | bl << 4) ^ (bh << 30 | bl >>> 2) ^ (bh << 25 | bl >>> 7)) + (al >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- w6l = w6l + w15l | 0;
- w6h = w6h + w15h + (w6l >>> 0 < w15l >>> 0 ? 1 : 0) | 0;
- xl = (w7l >>> 1 | w7h << 31) ^ (w7l >>> 8 | w7h << 24) ^ (w7l >>> 7 | w7h << 25) | 0;
- w6l = w6l + xl | 0;
- w6h = w6h + ((w7h >>> 1 | w7l << 31) ^ (w7h >>> 8 | w7l << 24) ^ w7h >>> 7) + (w6l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = (w4l >>> 19 | w4h << 13) ^ (w4l << 3 | w4h >>> 29) ^ (w4l >>> 6 | w4h << 26) | 0;
- w6l = w6l + xl | 0;
- w6h = w6h + ((w4h >>> 19 | w4l << 13) ^ (w4h << 3 | w4l >>> 29) ^ w4h >>> 6) + (w6l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- tl = 3175218132 + w6l | 0;
- th = 1555081692 + w6h + (tl >>> 0 < w6l >>> 0 ? 1 : 0) | 0;
- tl = tl + hl | 0;
- th = th + hh + (tl >>> 0 < hl >>> 0 ? 1 : 0) | 0;
- xl = (el >>> 14 | eh << 18) ^ (el >>> 18 | eh << 14) ^ (el << 23 | eh >>> 9) | 0;
- tl = tl + xl | 0;
- th = th + ((eh >>> 14 | el << 18) ^ (eh >>> 18 | el << 14) ^ (eh << 23 | el >>> 9)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = gl ^ el & (fl ^ gl) | 0;
- tl = tl + xl | 0;
- th = th + (gh ^ eh & (fh ^ gh)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- hl = gl;
- hh = gh;
- gl = fl;
- gh = fh;
- fl = el;
- fh = eh;
- el = dl + tl | 0;
- eh = dh + th + (el >>> 0 < dl >>> 0 ? 1 : 0) | 0;
- dl = cl;
- dh = ch;
- cl = bl;
- ch = bh;
- bl = al;
- bh = ah;
- al = tl + (bl & cl ^ dl & (bl ^ cl)) | 0;
- ah = th + (bh & ch ^ dh & (bh ^ ch)) + (al >>> 0 < tl >>> 0 ? 1 : 0) | 0;
- xl = (bl >>> 28 | bh << 4) ^ (bl << 30 | bh >>> 2) ^ (bl << 25 | bh >>> 7) | 0;
- al = al + xl | 0;
- ah = ah + ((bh >>> 28 | bl << 4) ^ (bh << 30 | bl >>> 2) ^ (bh << 25 | bl >>> 7)) + (al >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- w7l = w7l + w0l | 0;
- w7h = w7h + w0h + (w7l >>> 0 < w0l >>> 0 ? 1 : 0) | 0;
- xl = (w8l >>> 1 | w8h << 31) ^ (w8l >>> 8 | w8h << 24) ^ (w8l >>> 7 | w8h << 25) | 0;
- w7l = w7l + xl | 0;
- w7h = w7h + ((w8h >>> 1 | w8l << 31) ^ (w8h >>> 8 | w8l << 24) ^ w8h >>> 7) + (w7l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = (w5l >>> 19 | w5h << 13) ^ (w5l << 3 | w5h >>> 29) ^ (w5l >>> 6 | w5h << 26) | 0;
- w7l = w7l + xl | 0;
- w7h = w7h + ((w5h >>> 19 | w5l << 13) ^ (w5h << 3 | w5l >>> 29) ^ w5h >>> 6) + (w7l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- tl = 2198950837 + w7l | 0;
- th = 1996064986 + w7h + (tl >>> 0 < w7l >>> 0 ? 1 : 0) | 0;
- tl = tl + hl | 0;
- th = th + hh + (tl >>> 0 < hl >>> 0 ? 1 : 0) | 0;
- xl = (el >>> 14 | eh << 18) ^ (el >>> 18 | eh << 14) ^ (el << 23 | eh >>> 9) | 0;
- tl = tl + xl | 0;
- th = th + ((eh >>> 14 | el << 18) ^ (eh >>> 18 | el << 14) ^ (eh << 23 | el >>> 9)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = gl ^ el & (fl ^ gl) | 0;
- tl = tl + xl | 0;
- th = th + (gh ^ eh & (fh ^ gh)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- hl = gl;
- hh = gh;
- gl = fl;
- gh = fh;
- fl = el;
- fh = eh;
- el = dl + tl | 0;
- eh = dh + th + (el >>> 0 < dl >>> 0 ? 1 : 0) | 0;
- dl = cl;
- dh = ch;
- cl = bl;
- ch = bh;
- bl = al;
- bh = ah;
- al = tl + (bl & cl ^ dl & (bl ^ cl)) | 0;
- ah = th + (bh & ch ^ dh & (bh ^ ch)) + (al >>> 0 < tl >>> 0 ? 1 : 0) | 0;
- xl = (bl >>> 28 | bh << 4) ^ (bl << 30 | bh >>> 2) ^ (bl << 25 | bh >>> 7) | 0;
- al = al + xl | 0;
- ah = ah + ((bh >>> 28 | bl << 4) ^ (bh << 30 | bl >>> 2) ^ (bh << 25 | bl >>> 7)) + (al >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- w8l = w8l + w1l | 0;
- w8h = w8h + w1h + (w8l >>> 0 < w1l >>> 0 ? 1 : 0) | 0;
- xl = (w9l >>> 1 | w9h << 31) ^ (w9l >>> 8 | w9h << 24) ^ (w9l >>> 7 | w9h << 25) | 0;
- w8l = w8l + xl | 0;
- w8h = w8h + ((w9h >>> 1 | w9l << 31) ^ (w9h >>> 8 | w9l << 24) ^ w9h >>> 7) + (w8l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = (w6l >>> 19 | w6h << 13) ^ (w6l << 3 | w6h >>> 29) ^ (w6l >>> 6 | w6h << 26) | 0;
- w8l = w8l + xl | 0;
- w8h = w8h + ((w6h >>> 19 | w6l << 13) ^ (w6h << 3 | w6l >>> 29) ^ w6h >>> 6) + (w8l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- tl = 3999719339 + w8l | 0;
- th = 2554220882 + w8h + (tl >>> 0 < w8l >>> 0 ? 1 : 0) | 0;
- tl = tl + hl | 0;
- th = th + hh + (tl >>> 0 < hl >>> 0 ? 1 : 0) | 0;
- xl = (el >>> 14 | eh << 18) ^ (el >>> 18 | eh << 14) ^ (el << 23 | eh >>> 9) | 0;
- tl = tl + xl | 0;
- th = th + ((eh >>> 14 | el << 18) ^ (eh >>> 18 | el << 14) ^ (eh << 23 | el >>> 9)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = gl ^ el & (fl ^ gl) | 0;
- tl = tl + xl | 0;
- th = th + (gh ^ eh & (fh ^ gh)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- hl = gl;
- hh = gh;
- gl = fl;
- gh = fh;
- fl = el;
- fh = eh;
- el = dl + tl | 0;
- eh = dh + th + (el >>> 0 < dl >>> 0 ? 1 : 0) | 0;
- dl = cl;
- dh = ch;
- cl = bl;
- ch = bh;
- bl = al;
- bh = ah;
- al = tl + (bl & cl ^ dl & (bl ^ cl)) | 0;
- ah = th + (bh & ch ^ dh & (bh ^ ch)) + (al >>> 0 < tl >>> 0 ? 1 : 0) | 0;
- xl = (bl >>> 28 | bh << 4) ^ (bl << 30 | bh >>> 2) ^ (bl << 25 | bh >>> 7) | 0;
- al = al + xl | 0;
- ah = ah + ((bh >>> 28 | bl << 4) ^ (bh << 30 | bl >>> 2) ^ (bh << 25 | bl >>> 7)) + (al >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- w9l = w9l + w2l | 0;
- w9h = w9h + w2h + (w9l >>> 0 < w2l >>> 0 ? 1 : 0) | 0;
- xl = (w10l >>> 1 | w10h << 31) ^ (w10l >>> 8 | w10h << 24) ^ (w10l >>> 7 | w10h << 25) | 0;
- w9l = w9l + xl | 0;
- w9h = w9h + ((w10h >>> 1 | w10l << 31) ^ (w10h >>> 8 | w10l << 24) ^ w10h >>> 7) + (w9l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = (w7l >>> 19 | w7h << 13) ^ (w7l << 3 | w7h >>> 29) ^ (w7l >>> 6 | w7h << 26) | 0;
- w9l = w9l + xl | 0;
- w9h = w9h + ((w7h >>> 19 | w7l << 13) ^ (w7h << 3 | w7l >>> 29) ^ w7h >>> 6) + (w9l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- tl = 766784016 + w9l | 0;
- th = 2821834349 + w9h + (tl >>> 0 < w9l >>> 0 ? 1 : 0) | 0;
- tl = tl + hl | 0;
- th = th + hh + (tl >>> 0 < hl >>> 0 ? 1 : 0) | 0;
- xl = (el >>> 14 | eh << 18) ^ (el >>> 18 | eh << 14) ^ (el << 23 | eh >>> 9) | 0;
- tl = tl + xl | 0;
- th = th + ((eh >>> 14 | el << 18) ^ (eh >>> 18 | el << 14) ^ (eh << 23 | el >>> 9)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = gl ^ el & (fl ^ gl) | 0;
- tl = tl + xl | 0;
- th = th + (gh ^ eh & (fh ^ gh)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- hl = gl;
- hh = gh;
- gl = fl;
- gh = fh;
- fl = el;
- fh = eh;
- el = dl + tl | 0;
- eh = dh + th + (el >>> 0 < dl >>> 0 ? 1 : 0) | 0;
- dl = cl;
- dh = ch;
- cl = bl;
- ch = bh;
- bl = al;
- bh = ah;
- al = tl + (bl & cl ^ dl & (bl ^ cl)) | 0;
- ah = th + (bh & ch ^ dh & (bh ^ ch)) + (al >>> 0 < tl >>> 0 ? 1 : 0) | 0;
- xl = (bl >>> 28 | bh << 4) ^ (bl << 30 | bh >>> 2) ^ (bl << 25 | bh >>> 7) | 0;
- al = al + xl | 0;
- ah = ah + ((bh >>> 28 | bl << 4) ^ (bh << 30 | bl >>> 2) ^ (bh << 25 | bl >>> 7)) + (al >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- w10l = w10l + w3l | 0;
- w10h = w10h + w3h + (w10l >>> 0 < w3l >>> 0 ? 1 : 0) | 0;
- xl = (w11l >>> 1 | w11h << 31) ^ (w11l >>> 8 | w11h << 24) ^ (w11l >>> 7 | w11h << 25) | 0;
- w10l = w10l + xl | 0;
- w10h = w10h + ((w11h >>> 1 | w11l << 31) ^ (w11h >>> 8 | w11l << 24) ^ w11h >>> 7) + (w10l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = (w8l >>> 19 | w8h << 13) ^ (w8l << 3 | w8h >>> 29) ^ (w8l >>> 6 | w8h << 26) | 0;
- w10l = w10l + xl | 0;
- w10h = w10h + ((w8h >>> 19 | w8l << 13) ^ (w8h << 3 | w8l >>> 29) ^ w8h >>> 6) + (w10l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- tl = 2566594879 + w10l | 0;
- th = 2952996808 + w10h + (tl >>> 0 < w10l >>> 0 ? 1 : 0) | 0;
- tl = tl + hl | 0;
- th = th + hh + (tl >>> 0 < hl >>> 0 ? 1 : 0) | 0;
- xl = (el >>> 14 | eh << 18) ^ (el >>> 18 | eh << 14) ^ (el << 23 | eh >>> 9) | 0;
- tl = tl + xl | 0;
- th = th + ((eh >>> 14 | el << 18) ^ (eh >>> 18 | el << 14) ^ (eh << 23 | el >>> 9)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = gl ^ el & (fl ^ gl) | 0;
- tl = tl + xl | 0;
- th = th + (gh ^ eh & (fh ^ gh)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- hl = gl;
- hh = gh;
- gl = fl;
- gh = fh;
- fl = el;
- fh = eh;
- el = dl + tl | 0;
- eh = dh + th + (el >>> 0 < dl >>> 0 ? 1 : 0) | 0;
- dl = cl;
- dh = ch;
- cl = bl;
- ch = bh;
- bl = al;
- bh = ah;
- al = tl + (bl & cl ^ dl & (bl ^ cl)) | 0;
- ah = th + (bh & ch ^ dh & (bh ^ ch)) + (al >>> 0 < tl >>> 0 ? 1 : 0) | 0;
- xl = (bl >>> 28 | bh << 4) ^ (bl << 30 | bh >>> 2) ^ (bl << 25 | bh >>> 7) | 0;
- al = al + xl | 0;
- ah = ah + ((bh >>> 28 | bl << 4) ^ (bh << 30 | bl >>> 2) ^ (bh << 25 | bl >>> 7)) + (al >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- w11l = w11l + w4l | 0;
- w11h = w11h + w4h + (w11l >>> 0 < w4l >>> 0 ? 1 : 0) | 0;
- xl = (w12l >>> 1 | w12h << 31) ^ (w12l >>> 8 | w12h << 24) ^ (w12l >>> 7 | w12h << 25) | 0;
- w11l = w11l + xl | 0;
- w11h = w11h + ((w12h >>> 1 | w12l << 31) ^ (w12h >>> 8 | w12l << 24) ^ w12h >>> 7) + (w11l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = (w9l >>> 19 | w9h << 13) ^ (w9l << 3 | w9h >>> 29) ^ (w9l >>> 6 | w9h << 26) | 0;
- w11l = w11l + xl | 0;
- w11h = w11h + ((w9h >>> 19 | w9l << 13) ^ (w9h << 3 | w9l >>> 29) ^ w9h >>> 6) + (w11l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- tl = 3203337956 + w11l | 0;
- th = 3210313671 + w11h + (tl >>> 0 < w11l >>> 0 ? 1 : 0) | 0;
- tl = tl + hl | 0;
- th = th + hh + (tl >>> 0 < hl >>> 0 ? 1 : 0) | 0;
- xl = (el >>> 14 | eh << 18) ^ (el >>> 18 | eh << 14) ^ (el << 23 | eh >>> 9) | 0;
- tl = tl + xl | 0;
- th = th + ((eh >>> 14 | el << 18) ^ (eh >>> 18 | el << 14) ^ (eh << 23 | el >>> 9)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = gl ^ el & (fl ^ gl) | 0;
- tl = tl + xl | 0;
- th = th + (gh ^ eh & (fh ^ gh)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- hl = gl;
- hh = gh;
- gl = fl;
- gh = fh;
- fl = el;
- fh = eh;
- el = dl + tl | 0;
- eh = dh + th + (el >>> 0 < dl >>> 0 ? 1 : 0) | 0;
- dl = cl;
- dh = ch;
- cl = bl;
- ch = bh;
- bl = al;
- bh = ah;
- al = tl + (bl & cl ^ dl & (bl ^ cl)) | 0;
- ah = th + (bh & ch ^ dh & (bh ^ ch)) + (al >>> 0 < tl >>> 0 ? 1 : 0) | 0;
- xl = (bl >>> 28 | bh << 4) ^ (bl << 30 | bh >>> 2) ^ (bl << 25 | bh >>> 7) | 0;
- al = al + xl | 0;
- ah = ah + ((bh >>> 28 | bl << 4) ^ (bh << 30 | bl >>> 2) ^ (bh << 25 | bl >>> 7)) + (al >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- w12l = w12l + w5l | 0;
- w12h = w12h + w5h + (w12l >>> 0 < w5l >>> 0 ? 1 : 0) | 0;
- xl = (w13l >>> 1 | w13h << 31) ^ (w13l >>> 8 | w13h << 24) ^ (w13l >>> 7 | w13h << 25) | 0;
- w12l = w12l + xl | 0;
- w12h = w12h + ((w13h >>> 1 | w13l << 31) ^ (w13h >>> 8 | w13l << 24) ^ w13h >>> 7) + (w12l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = (w10l >>> 19 | w10h << 13) ^ (w10l << 3 | w10h >>> 29) ^ (w10l >>> 6 | w10h << 26) | 0;
- w12l = w12l + xl | 0;
- w12h = w12h + ((w10h >>> 19 | w10l << 13) ^ (w10h << 3 | w10l >>> 29) ^ w10h >>> 6) + (w12l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- tl = 1034457026 + w12l | 0;
- th = 3336571891 + w12h + (tl >>> 0 < w12l >>> 0 ? 1 : 0) | 0;
- tl = tl + hl | 0;
- th = th + hh + (tl >>> 0 < hl >>> 0 ? 1 : 0) | 0;
- xl = (el >>> 14 | eh << 18) ^ (el >>> 18 | eh << 14) ^ (el << 23 | eh >>> 9) | 0;
- tl = tl + xl | 0;
- th = th + ((eh >>> 14 | el << 18) ^ (eh >>> 18 | el << 14) ^ (eh << 23 | el >>> 9)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = gl ^ el & (fl ^ gl) | 0;
- tl = tl + xl | 0;
- th = th + (gh ^ eh & (fh ^ gh)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- hl = gl;
- hh = gh;
- gl = fl;
- gh = fh;
- fl = el;
- fh = eh;
- el = dl + tl | 0;
- eh = dh + th + (el >>> 0 < dl >>> 0 ? 1 : 0) | 0;
- dl = cl;
- dh = ch;
- cl = bl;
- ch = bh;
- bl = al;
- bh = ah;
- al = tl + (bl & cl ^ dl & (bl ^ cl)) | 0;
- ah = th + (bh & ch ^ dh & (bh ^ ch)) + (al >>> 0 < tl >>> 0 ? 1 : 0) | 0;
- xl = (bl >>> 28 | bh << 4) ^ (bl << 30 | bh >>> 2) ^ (bl << 25 | bh >>> 7) | 0;
- al = al + xl | 0;
- ah = ah + ((bh >>> 28 | bl << 4) ^ (bh << 30 | bl >>> 2) ^ (bh << 25 | bl >>> 7)) + (al >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- w13l = w13l + w6l | 0;
- w13h = w13h + w6h + (w13l >>> 0 < w6l >>> 0 ? 1 : 0) | 0;
- xl = (w14l >>> 1 | w14h << 31) ^ (w14l >>> 8 | w14h << 24) ^ (w14l >>> 7 | w14h << 25) | 0;
- w13l = w13l + xl | 0;
- w13h = w13h + ((w14h >>> 1 | w14l << 31) ^ (w14h >>> 8 | w14l << 24) ^ w14h >>> 7) + (w13l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = (w11l >>> 19 | w11h << 13) ^ (w11l << 3 | w11h >>> 29) ^ (w11l >>> 6 | w11h << 26) | 0;
- w13l = w13l + xl | 0;
- w13h = w13h + ((w11h >>> 19 | w11l << 13) ^ (w11h << 3 | w11l >>> 29) ^ w11h >>> 6) + (w13l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- tl = 2466948901 + w13l | 0;
- th = 3584528711 + w13h + (tl >>> 0 < w13l >>> 0 ? 1 : 0) | 0;
- tl = tl + hl | 0;
- th = th + hh + (tl >>> 0 < hl >>> 0 ? 1 : 0) | 0;
- xl = (el >>> 14 | eh << 18) ^ (el >>> 18 | eh << 14) ^ (el << 23 | eh >>> 9) | 0;
- tl = tl + xl | 0;
- th = th + ((eh >>> 14 | el << 18) ^ (eh >>> 18 | el << 14) ^ (eh << 23 | el >>> 9)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = gl ^ el & (fl ^ gl) | 0;
- tl = tl + xl | 0;
- th = th + (gh ^ eh & (fh ^ gh)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- hl = gl;
- hh = gh;
- gl = fl;
- gh = fh;
- fl = el;
- fh = eh;
- el = dl + tl | 0;
- eh = dh + th + (el >>> 0 < dl >>> 0 ? 1 : 0) | 0;
- dl = cl;
- dh = ch;
- cl = bl;
- ch = bh;
- bl = al;
- bh = ah;
- al = tl + (bl & cl ^ dl & (bl ^ cl)) | 0;
- ah = th + (bh & ch ^ dh & (bh ^ ch)) + (al >>> 0 < tl >>> 0 ? 1 : 0) | 0;
- xl = (bl >>> 28 | bh << 4) ^ (bl << 30 | bh >>> 2) ^ (bl << 25 | bh >>> 7) | 0;
- al = al + xl | 0;
- ah = ah + ((bh >>> 28 | bl << 4) ^ (bh << 30 | bl >>> 2) ^ (bh << 25 | bl >>> 7)) + (al >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- w14l = w14l + w7l | 0;
- w14h = w14h + w7h + (w14l >>> 0 < w7l >>> 0 ? 1 : 0) | 0;
- xl = (w15l >>> 1 | w15h << 31) ^ (w15l >>> 8 | w15h << 24) ^ (w15l >>> 7 | w15h << 25) | 0;
- w14l = w14l + xl | 0;
- w14h = w14h + ((w15h >>> 1 | w15l << 31) ^ (w15h >>> 8 | w15l << 24) ^ w15h >>> 7) + (w14l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = (w12l >>> 19 | w12h << 13) ^ (w12l << 3 | w12h >>> 29) ^ (w12l >>> 6 | w12h << 26) | 0;
- w14l = w14l + xl | 0;
- w14h = w14h + ((w12h >>> 19 | w12l << 13) ^ (w12h << 3 | w12l >>> 29) ^ w12h >>> 6) + (w14l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- tl = 3758326383 + w14l | 0;
- th = 113926993 + w14h + (tl >>> 0 < w14l >>> 0 ? 1 : 0) | 0;
- tl = tl + hl | 0;
- th = th + hh + (tl >>> 0 < hl >>> 0 ? 1 : 0) | 0;
- xl = (el >>> 14 | eh << 18) ^ (el >>> 18 | eh << 14) ^ (el << 23 | eh >>> 9) | 0;
- tl = tl + xl | 0;
- th = th + ((eh >>> 14 | el << 18) ^ (eh >>> 18 | el << 14) ^ (eh << 23 | el >>> 9)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = gl ^ el & (fl ^ gl) | 0;
- tl = tl + xl | 0;
- th = th + (gh ^ eh & (fh ^ gh)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- hl = gl;
- hh = gh;
- gl = fl;
- gh = fh;
- fl = el;
- fh = eh;
- el = dl + tl | 0;
- eh = dh + th + (el >>> 0 < dl >>> 0 ? 1 : 0) | 0;
- dl = cl;
- dh = ch;
- cl = bl;
- ch = bh;
- bl = al;
- bh = ah;
- al = tl + (bl & cl ^ dl & (bl ^ cl)) | 0;
- ah = th + (bh & ch ^ dh & (bh ^ ch)) + (al >>> 0 < tl >>> 0 ? 1 : 0) | 0;
- xl = (bl >>> 28 | bh << 4) ^ (bl << 30 | bh >>> 2) ^ (bl << 25 | bh >>> 7) | 0;
- al = al + xl | 0;
- ah = ah + ((bh >>> 28 | bl << 4) ^ (bh << 30 | bl >>> 2) ^ (bh << 25 | bl >>> 7)) + (al >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- w15l = w15l + w8l | 0;
- w15h = w15h + w8h + (w15l >>> 0 < w8l >>> 0 ? 1 : 0) | 0;
- xl = (w0l >>> 1 | w0h << 31) ^ (w0l >>> 8 | w0h << 24) ^ (w0l >>> 7 | w0h << 25) | 0;
- w15l = w15l + xl | 0;
- w15h = w15h + ((w0h >>> 1 | w0l << 31) ^ (w0h >>> 8 | w0l << 24) ^ w0h >>> 7) + (w15l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = (w13l >>> 19 | w13h << 13) ^ (w13l << 3 | w13h >>> 29) ^ (w13l >>> 6 | w13h << 26) | 0;
- w15l = w15l + xl | 0;
- w15h = w15h + ((w13h >>> 19 | w13l << 13) ^ (w13h << 3 | w13l >>> 29) ^ w13h >>> 6) + (w15l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- tl = 168717936 + w15l | 0;
- th = 338241895 + w15h + (tl >>> 0 < w15l >>> 0 ? 1 : 0) | 0;
- tl = tl + hl | 0;
- th = th + hh + (tl >>> 0 < hl >>> 0 ? 1 : 0) | 0;
- xl = (el >>> 14 | eh << 18) ^ (el >>> 18 | eh << 14) ^ (el << 23 | eh >>> 9) | 0;
- tl = tl + xl | 0;
- th = th + ((eh >>> 14 | el << 18) ^ (eh >>> 18 | el << 14) ^ (eh << 23 | el >>> 9)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = gl ^ el & (fl ^ gl) | 0;
- tl = tl + xl | 0;
- th = th + (gh ^ eh & (fh ^ gh)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- hl = gl;
- hh = gh;
- gl = fl;
- gh = fh;
- fl = el;
- fh = eh;
- el = dl + tl | 0;
- eh = dh + th + (el >>> 0 < dl >>> 0 ? 1 : 0) | 0;
- dl = cl;
- dh = ch;
- cl = bl;
- ch = bh;
- bl = al;
- bh = ah;
- al = tl + (bl & cl ^ dl & (bl ^ cl)) | 0;
- ah = th + (bh & ch ^ dh & (bh ^ ch)) + (al >>> 0 < tl >>> 0 ? 1 : 0) | 0;
- xl = (bl >>> 28 | bh << 4) ^ (bl << 30 | bh >>> 2) ^ (bl << 25 | bh >>> 7) | 0;
- al = al + xl | 0;
- ah = ah + ((bh >>> 28 | bl << 4) ^ (bh << 30 | bl >>> 2) ^ (bh << 25 | bl >>> 7)) + (al >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- w0l = w0l + w9l | 0;
- w0h = w0h + w9h + (w0l >>> 0 < w9l >>> 0 ? 1 : 0) | 0;
- xl = (w1l >>> 1 | w1h << 31) ^ (w1l >>> 8 | w1h << 24) ^ (w1l >>> 7 | w1h << 25) | 0;
- w0l = w0l + xl | 0;
- w0h = w0h + ((w1h >>> 1 | w1l << 31) ^ (w1h >>> 8 | w1l << 24) ^ w1h >>> 7) + (w0l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = (w14l >>> 19 | w14h << 13) ^ (w14l << 3 | w14h >>> 29) ^ (w14l >>> 6 | w14h << 26) | 0;
- w0l = w0l + xl | 0;
- w0h = w0h + ((w14h >>> 19 | w14l << 13) ^ (w14h << 3 | w14l >>> 29) ^ w14h >>> 6) + (w0l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- tl = 1188179964 + w0l | 0;
- th = 666307205 + w0h + (tl >>> 0 < w0l >>> 0 ? 1 : 0) | 0;
- tl = tl + hl | 0;
- th = th + hh + (tl >>> 0 < hl >>> 0 ? 1 : 0) | 0;
- xl = (el >>> 14 | eh << 18) ^ (el >>> 18 | eh << 14) ^ (el << 23 | eh >>> 9) | 0;
- tl = tl + xl | 0;
- th = th + ((eh >>> 14 | el << 18) ^ (eh >>> 18 | el << 14) ^ (eh << 23 | el >>> 9)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = gl ^ el & (fl ^ gl) | 0;
- tl = tl + xl | 0;
- th = th + (gh ^ eh & (fh ^ gh)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- hl = gl;
- hh = gh;
- gl = fl;
- gh = fh;
- fl = el;
- fh = eh;
- el = dl + tl | 0;
- eh = dh + th + (el >>> 0 < dl >>> 0 ? 1 : 0) | 0;
- dl = cl;
- dh = ch;
- cl = bl;
- ch = bh;
- bl = al;
- bh = ah;
- al = tl + (bl & cl ^ dl & (bl ^ cl)) | 0;
- ah = th + (bh & ch ^ dh & (bh ^ ch)) + (al >>> 0 < tl >>> 0 ? 1 : 0) | 0;
- xl = (bl >>> 28 | bh << 4) ^ (bl << 30 | bh >>> 2) ^ (bl << 25 | bh >>> 7) | 0;
- al = al + xl | 0;
- ah = ah + ((bh >>> 28 | bl << 4) ^ (bh << 30 | bl >>> 2) ^ (bh << 25 | bl >>> 7)) + (al >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- w1l = w1l + w10l | 0;
- w1h = w1h + w10h + (w1l >>> 0 < w10l >>> 0 ? 1 : 0) | 0;
- xl = (w2l >>> 1 | w2h << 31) ^ (w2l >>> 8 | w2h << 24) ^ (w2l >>> 7 | w2h << 25) | 0;
- w1l = w1l + xl | 0;
- w1h = w1h + ((w2h >>> 1 | w2l << 31) ^ (w2h >>> 8 | w2l << 24) ^ w2h >>> 7) + (w1l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = (w15l >>> 19 | w15h << 13) ^ (w15l << 3 | w15h >>> 29) ^ (w15l >>> 6 | w15h << 26) | 0;
- w1l = w1l + xl | 0;
- w1h = w1h + ((w15h >>> 19 | w15l << 13) ^ (w15h << 3 | w15l >>> 29) ^ w15h >>> 6) + (w1l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- tl = 1546045734 + w1l | 0;
- th = 773529912 + w1h + (tl >>> 0 < w1l >>> 0 ? 1 : 0) | 0;
- tl = tl + hl | 0;
- th = th + hh + (tl >>> 0 < hl >>> 0 ? 1 : 0) | 0;
- xl = (el >>> 14 | eh << 18) ^ (el >>> 18 | eh << 14) ^ (el << 23 | eh >>> 9) | 0;
- tl = tl + xl | 0;
- th = th + ((eh >>> 14 | el << 18) ^ (eh >>> 18 | el << 14) ^ (eh << 23 | el >>> 9)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = gl ^ el & (fl ^ gl) | 0;
- tl = tl + xl | 0;
- th = th + (gh ^ eh & (fh ^ gh)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- hl = gl;
- hh = gh;
- gl = fl;
- gh = fh;
- fl = el;
- fh = eh;
- el = dl + tl | 0;
- eh = dh + th + (el >>> 0 < dl >>> 0 ? 1 : 0) | 0;
- dl = cl;
- dh = ch;
- cl = bl;
- ch = bh;
- bl = al;
- bh = ah;
- al = tl + (bl & cl ^ dl & (bl ^ cl)) | 0;
- ah = th + (bh & ch ^ dh & (bh ^ ch)) + (al >>> 0 < tl >>> 0 ? 1 : 0) | 0;
- xl = (bl >>> 28 | bh << 4) ^ (bl << 30 | bh >>> 2) ^ (bl << 25 | bh >>> 7) | 0;
- al = al + xl | 0;
- ah = ah + ((bh >>> 28 | bl << 4) ^ (bh << 30 | bl >>> 2) ^ (bh << 25 | bl >>> 7)) + (al >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- w2l = w2l + w11l | 0;
- w2h = w2h + w11h + (w2l >>> 0 < w11l >>> 0 ? 1 : 0) | 0;
- xl = (w3l >>> 1 | w3h << 31) ^ (w3l >>> 8 | w3h << 24) ^ (w3l >>> 7 | w3h << 25) | 0;
- w2l = w2l + xl | 0;
- w2h = w2h + ((w3h >>> 1 | w3l << 31) ^ (w3h >>> 8 | w3l << 24) ^ w3h >>> 7) + (w2l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = (w0l >>> 19 | w0h << 13) ^ (w0l << 3 | w0h >>> 29) ^ (w0l >>> 6 | w0h << 26) | 0;
- w2l = w2l + xl | 0;
- w2h = w2h + ((w0h >>> 19 | w0l << 13) ^ (w0h << 3 | w0l >>> 29) ^ w0h >>> 6) + (w2l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- tl = 1522805485 + w2l | 0;
- th = 1294757372 + w2h + (tl >>> 0 < w2l >>> 0 ? 1 : 0) | 0;
- tl = tl + hl | 0;
- th = th + hh + (tl >>> 0 < hl >>> 0 ? 1 : 0) | 0;
- xl = (el >>> 14 | eh << 18) ^ (el >>> 18 | eh << 14) ^ (el << 23 | eh >>> 9) | 0;
- tl = tl + xl | 0;
- th = th + ((eh >>> 14 | el << 18) ^ (eh >>> 18 | el << 14) ^ (eh << 23 | el >>> 9)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = gl ^ el & (fl ^ gl) | 0;
- tl = tl + xl | 0;
- th = th + (gh ^ eh & (fh ^ gh)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- hl = gl;
- hh = gh;
- gl = fl;
- gh = fh;
- fl = el;
- fh = eh;
- el = dl + tl | 0;
- eh = dh + th + (el >>> 0 < dl >>> 0 ? 1 : 0) | 0;
- dl = cl;
- dh = ch;
- cl = bl;
- ch = bh;
- bl = al;
- bh = ah;
- al = tl + (bl & cl ^ dl & (bl ^ cl)) | 0;
- ah = th + (bh & ch ^ dh & (bh ^ ch)) + (al >>> 0 < tl >>> 0 ? 1 : 0) | 0;
- xl = (bl >>> 28 | bh << 4) ^ (bl << 30 | bh >>> 2) ^ (bl << 25 | bh >>> 7) | 0;
- al = al + xl | 0;
- ah = ah + ((bh >>> 28 | bl << 4) ^ (bh << 30 | bl >>> 2) ^ (bh << 25 | bl >>> 7)) + (al >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- w3l = w3l + w12l | 0;
- w3h = w3h + w12h + (w3l >>> 0 < w12l >>> 0 ? 1 : 0) | 0;
- xl = (w4l >>> 1 | w4h << 31) ^ (w4l >>> 8 | w4h << 24) ^ (w4l >>> 7 | w4h << 25) | 0;
- w3l = w3l + xl | 0;
- w3h = w3h + ((w4h >>> 1 | w4l << 31) ^ (w4h >>> 8 | w4l << 24) ^ w4h >>> 7) + (w3l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = (w1l >>> 19 | w1h << 13) ^ (w1l << 3 | w1h >>> 29) ^ (w1l >>> 6 | w1h << 26) | 0;
- w3l = w3l + xl | 0;
- w3h = w3h + ((w1h >>> 19 | w1l << 13) ^ (w1h << 3 | w1l >>> 29) ^ w1h >>> 6) + (w3l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- tl = 2643833823 + w3l | 0;
- th = 1396182291 + w3h + (tl >>> 0 < w3l >>> 0 ? 1 : 0) | 0;
- tl = tl + hl | 0;
- th = th + hh + (tl >>> 0 < hl >>> 0 ? 1 : 0) | 0;
- xl = (el >>> 14 | eh << 18) ^ (el >>> 18 | eh << 14) ^ (el << 23 | eh >>> 9) | 0;
- tl = tl + xl | 0;
- th = th + ((eh >>> 14 | el << 18) ^ (eh >>> 18 | el << 14) ^ (eh << 23 | el >>> 9)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = gl ^ el & (fl ^ gl) | 0;
- tl = tl + xl | 0;
- th = th + (gh ^ eh & (fh ^ gh)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- hl = gl;
- hh = gh;
- gl = fl;
- gh = fh;
- fl = el;
- fh = eh;
- el = dl + tl | 0;
- eh = dh + th + (el >>> 0 < dl >>> 0 ? 1 : 0) | 0;
- dl = cl;
- dh = ch;
- cl = bl;
- ch = bh;
- bl = al;
- bh = ah;
- al = tl + (bl & cl ^ dl & (bl ^ cl)) | 0;
- ah = th + (bh & ch ^ dh & (bh ^ ch)) + (al >>> 0 < tl >>> 0 ? 1 : 0) | 0;
- xl = (bl >>> 28 | bh << 4) ^ (bl << 30 | bh >>> 2) ^ (bl << 25 | bh >>> 7) | 0;
- al = al + xl | 0;
- ah = ah + ((bh >>> 28 | bl << 4) ^ (bh << 30 | bl >>> 2) ^ (bh << 25 | bl >>> 7)) + (al >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- w4l = w4l + w13l | 0;
- w4h = w4h + w13h + (w4l >>> 0 < w13l >>> 0 ? 1 : 0) | 0;
- xl = (w5l >>> 1 | w5h << 31) ^ (w5l >>> 8 | w5h << 24) ^ (w5l >>> 7 | w5h << 25) | 0;
- w4l = w4l + xl | 0;
- w4h = w4h + ((w5h >>> 1 | w5l << 31) ^ (w5h >>> 8 | w5l << 24) ^ w5h >>> 7) + (w4l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = (w2l >>> 19 | w2h << 13) ^ (w2l << 3 | w2h >>> 29) ^ (w2l >>> 6 | w2h << 26) | 0;
- w4l = w4l + xl | 0;
- w4h = w4h + ((w2h >>> 19 | w2l << 13) ^ (w2h << 3 | w2l >>> 29) ^ w2h >>> 6) + (w4l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- tl = 2343527390 + w4l | 0;
- th = 1695183700 + w4h + (tl >>> 0 < w4l >>> 0 ? 1 : 0) | 0;
- tl = tl + hl | 0;
- th = th + hh + (tl >>> 0 < hl >>> 0 ? 1 : 0) | 0;
- xl = (el >>> 14 | eh << 18) ^ (el >>> 18 | eh << 14) ^ (el << 23 | eh >>> 9) | 0;
- tl = tl + xl | 0;
- th = th + ((eh >>> 14 | el << 18) ^ (eh >>> 18 | el << 14) ^ (eh << 23 | el >>> 9)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = gl ^ el & (fl ^ gl) | 0;
- tl = tl + xl | 0;
- th = th + (gh ^ eh & (fh ^ gh)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- hl = gl;
- hh = gh;
- gl = fl;
- gh = fh;
- fl = el;
- fh = eh;
- el = dl + tl | 0;
- eh = dh + th + (el >>> 0 < dl >>> 0 ? 1 : 0) | 0;
- dl = cl;
- dh = ch;
- cl = bl;
- ch = bh;
- bl = al;
- bh = ah;
- al = tl + (bl & cl ^ dl & (bl ^ cl)) | 0;
- ah = th + (bh & ch ^ dh & (bh ^ ch)) + (al >>> 0 < tl >>> 0 ? 1 : 0) | 0;
- xl = (bl >>> 28 | bh << 4) ^ (bl << 30 | bh >>> 2) ^ (bl << 25 | bh >>> 7) | 0;
- al = al + xl | 0;
- ah = ah + ((bh >>> 28 | bl << 4) ^ (bh << 30 | bl >>> 2) ^ (bh << 25 | bl >>> 7)) + (al >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- w5l = w5l + w14l | 0;
- w5h = w5h + w14h + (w5l >>> 0 < w14l >>> 0 ? 1 : 0) | 0;
- xl = (w6l >>> 1 | w6h << 31) ^ (w6l >>> 8 | w6h << 24) ^ (w6l >>> 7 | w6h << 25) | 0;
- w5l = w5l + xl | 0;
- w5h = w5h + ((w6h >>> 1 | w6l << 31) ^ (w6h >>> 8 | w6l << 24) ^ w6h >>> 7) + (w5l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = (w3l >>> 19 | w3h << 13) ^ (w3l << 3 | w3h >>> 29) ^ (w3l >>> 6 | w3h << 26) | 0;
- w5l = w5l + xl | 0;
- w5h = w5h + ((w3h >>> 19 | w3l << 13) ^ (w3h << 3 | w3l >>> 29) ^ w3h >>> 6) + (w5l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- tl = 1014477480 + w5l | 0;
- th = 1986661051 + w5h + (tl >>> 0 < w5l >>> 0 ? 1 : 0) | 0;
- tl = tl + hl | 0;
- th = th + hh + (tl >>> 0 < hl >>> 0 ? 1 : 0) | 0;
- xl = (el >>> 14 | eh << 18) ^ (el >>> 18 | eh << 14) ^ (el << 23 | eh >>> 9) | 0;
- tl = tl + xl | 0;
- th = th + ((eh >>> 14 | el << 18) ^ (eh >>> 18 | el << 14) ^ (eh << 23 | el >>> 9)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = gl ^ el & (fl ^ gl) | 0;
- tl = tl + xl | 0;
- th = th + (gh ^ eh & (fh ^ gh)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- hl = gl;
- hh = gh;
- gl = fl;
- gh = fh;
- fl = el;
- fh = eh;
- el = dl + tl | 0;
- eh = dh + th + (el >>> 0 < dl >>> 0 ? 1 : 0) | 0;
- dl = cl;
- dh = ch;
- cl = bl;
- ch = bh;
- bl = al;
- bh = ah;
- al = tl + (bl & cl ^ dl & (bl ^ cl)) | 0;
- ah = th + (bh & ch ^ dh & (bh ^ ch)) + (al >>> 0 < tl >>> 0 ? 1 : 0) | 0;
- xl = (bl >>> 28 | bh << 4) ^ (bl << 30 | bh >>> 2) ^ (bl << 25 | bh >>> 7) | 0;
- al = al + xl | 0;
- ah = ah + ((bh >>> 28 | bl << 4) ^ (bh << 30 | bl >>> 2) ^ (bh << 25 | bl >>> 7)) + (al >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- w6l = w6l + w15l | 0;
- w6h = w6h + w15h + (w6l >>> 0 < w15l >>> 0 ? 1 : 0) | 0;
- xl = (w7l >>> 1 | w7h << 31) ^ (w7l >>> 8 | w7h << 24) ^ (w7l >>> 7 | w7h << 25) | 0;
- w6l = w6l + xl | 0;
- w6h = w6h + ((w7h >>> 1 | w7l << 31) ^ (w7h >>> 8 | w7l << 24) ^ w7h >>> 7) + (w6l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = (w4l >>> 19 | w4h << 13) ^ (w4l << 3 | w4h >>> 29) ^ (w4l >>> 6 | w4h << 26) | 0;
- w6l = w6l + xl | 0;
- w6h = w6h + ((w4h >>> 19 | w4l << 13) ^ (w4h << 3 | w4l >>> 29) ^ w4h >>> 6) + (w6l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- tl = 1206759142 + w6l | 0;
- th = 2177026350 + w6h + (tl >>> 0 < w6l >>> 0 ? 1 : 0) | 0;
- tl = tl + hl | 0;
- th = th + hh + (tl >>> 0 < hl >>> 0 ? 1 : 0) | 0;
- xl = (el >>> 14 | eh << 18) ^ (el >>> 18 | eh << 14) ^ (el << 23 | eh >>> 9) | 0;
- tl = tl + xl | 0;
- th = th + ((eh >>> 14 | el << 18) ^ (eh >>> 18 | el << 14) ^ (eh << 23 | el >>> 9)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = gl ^ el & (fl ^ gl) | 0;
- tl = tl + xl | 0;
- th = th + (gh ^ eh & (fh ^ gh)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- hl = gl;
- hh = gh;
- gl = fl;
- gh = fh;
- fl = el;
- fh = eh;
- el = dl + tl | 0;
- eh = dh + th + (el >>> 0 < dl >>> 0 ? 1 : 0) | 0;
- dl = cl;
- dh = ch;
- cl = bl;
- ch = bh;
- bl = al;
- bh = ah;
- al = tl + (bl & cl ^ dl & (bl ^ cl)) | 0;
- ah = th + (bh & ch ^ dh & (bh ^ ch)) + (al >>> 0 < tl >>> 0 ? 1 : 0) | 0;
- xl = (bl >>> 28 | bh << 4) ^ (bl << 30 | bh >>> 2) ^ (bl << 25 | bh >>> 7) | 0;
- al = al + xl | 0;
- ah = ah + ((bh >>> 28 | bl << 4) ^ (bh << 30 | bl >>> 2) ^ (bh << 25 | bl >>> 7)) + (al >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- w7l = w7l + w0l | 0;
- w7h = w7h + w0h + (w7l >>> 0 < w0l >>> 0 ? 1 : 0) | 0;
- xl = (w8l >>> 1 | w8h << 31) ^ (w8l >>> 8 | w8h << 24) ^ (w8l >>> 7 | w8h << 25) | 0;
- w7l = w7l + xl | 0;
- w7h = w7h + ((w8h >>> 1 | w8l << 31) ^ (w8h >>> 8 | w8l << 24) ^ w8h >>> 7) + (w7l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = (w5l >>> 19 | w5h << 13) ^ (w5l << 3 | w5h >>> 29) ^ (w5l >>> 6 | w5h << 26) | 0;
- w7l = w7l + xl | 0;
- w7h = w7h + ((w5h >>> 19 | w5l << 13) ^ (w5h << 3 | w5l >>> 29) ^ w5h >>> 6) + (w7l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- tl = 344077627 + w7l | 0;
- th = 2456956037 + w7h + (tl >>> 0 < w7l >>> 0 ? 1 : 0) | 0;
- tl = tl + hl | 0;
- th = th + hh + (tl >>> 0 < hl >>> 0 ? 1 : 0) | 0;
- xl = (el >>> 14 | eh << 18) ^ (el >>> 18 | eh << 14) ^ (el << 23 | eh >>> 9) | 0;
- tl = tl + xl | 0;
- th = th + ((eh >>> 14 | el << 18) ^ (eh >>> 18 | el << 14) ^ (eh << 23 | el >>> 9)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = gl ^ el & (fl ^ gl) | 0;
- tl = tl + xl | 0;
- th = th + (gh ^ eh & (fh ^ gh)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- hl = gl;
- hh = gh;
- gl = fl;
- gh = fh;
- fl = el;
- fh = eh;
- el = dl + tl | 0;
- eh = dh + th + (el >>> 0 < dl >>> 0 ? 1 : 0) | 0;
- dl = cl;
- dh = ch;
- cl = bl;
- ch = bh;
- bl = al;
- bh = ah;
- al = tl + (bl & cl ^ dl & (bl ^ cl)) | 0;
- ah = th + (bh & ch ^ dh & (bh ^ ch)) + (al >>> 0 < tl >>> 0 ? 1 : 0) | 0;
- xl = (bl >>> 28 | bh << 4) ^ (bl << 30 | bh >>> 2) ^ (bl << 25 | bh >>> 7) | 0;
- al = al + xl | 0;
- ah = ah + ((bh >>> 28 | bl << 4) ^ (bh << 30 | bl >>> 2) ^ (bh << 25 | bl >>> 7)) + (al >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- w8l = w8l + w1l | 0;
- w8h = w8h + w1h + (w8l >>> 0 < w1l >>> 0 ? 1 : 0) | 0;
- xl = (w9l >>> 1 | w9h << 31) ^ (w9l >>> 8 | w9h << 24) ^ (w9l >>> 7 | w9h << 25) | 0;
- w8l = w8l + xl | 0;
- w8h = w8h + ((w9h >>> 1 | w9l << 31) ^ (w9h >>> 8 | w9l << 24) ^ w9h >>> 7) + (w8l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = (w6l >>> 19 | w6h << 13) ^ (w6l << 3 | w6h >>> 29) ^ (w6l >>> 6 | w6h << 26) | 0;
- w8l = w8l + xl | 0;
- w8h = w8h + ((w6h >>> 19 | w6l << 13) ^ (w6h << 3 | w6l >>> 29) ^ w6h >>> 6) + (w8l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- tl = 1290863460 + w8l | 0;
- th = 2730485921 + w8h + (tl >>> 0 < w8l >>> 0 ? 1 : 0) | 0;
- tl = tl + hl | 0;
- th = th + hh + (tl >>> 0 < hl >>> 0 ? 1 : 0) | 0;
- xl = (el >>> 14 | eh << 18) ^ (el >>> 18 | eh << 14) ^ (el << 23 | eh >>> 9) | 0;
- tl = tl + xl | 0;
- th = th + ((eh >>> 14 | el << 18) ^ (eh >>> 18 | el << 14) ^ (eh << 23 | el >>> 9)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = gl ^ el & (fl ^ gl) | 0;
- tl = tl + xl | 0;
- th = th + (gh ^ eh & (fh ^ gh)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- hl = gl;
- hh = gh;
- gl = fl;
- gh = fh;
- fl = el;
- fh = eh;
- el = dl + tl | 0;
- eh = dh + th + (el >>> 0 < dl >>> 0 ? 1 : 0) | 0;
- dl = cl;
- dh = ch;
- cl = bl;
- ch = bh;
- bl = al;
- bh = ah;
- al = tl + (bl & cl ^ dl & (bl ^ cl)) | 0;
- ah = th + (bh & ch ^ dh & (bh ^ ch)) + (al >>> 0 < tl >>> 0 ? 1 : 0) | 0;
- xl = (bl >>> 28 | bh << 4) ^ (bl << 30 | bh >>> 2) ^ (bl << 25 | bh >>> 7) | 0;
- al = al + xl | 0;
- ah = ah + ((bh >>> 28 | bl << 4) ^ (bh << 30 | bl >>> 2) ^ (bh << 25 | bl >>> 7)) + (al >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- w9l = w9l + w2l | 0;
- w9h = w9h + w2h + (w9l >>> 0 < w2l >>> 0 ? 1 : 0) | 0;
- xl = (w10l >>> 1 | w10h << 31) ^ (w10l >>> 8 | w10h << 24) ^ (w10l >>> 7 | w10h << 25) | 0;
- w9l = w9l + xl | 0;
- w9h = w9h + ((w10h >>> 1 | w10l << 31) ^ (w10h >>> 8 | w10l << 24) ^ w10h >>> 7) + (w9l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = (w7l >>> 19 | w7h << 13) ^ (w7l << 3 | w7h >>> 29) ^ (w7l >>> 6 | w7h << 26) | 0;
- w9l = w9l + xl | 0;
- w9h = w9h + ((w7h >>> 19 | w7l << 13) ^ (w7h << 3 | w7l >>> 29) ^ w7h >>> 6) + (w9l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- tl = 3158454273 + w9l | 0;
- th = 2820302411 + w9h + (tl >>> 0 < w9l >>> 0 ? 1 : 0) | 0;
- tl = tl + hl | 0;
- th = th + hh + (tl >>> 0 < hl >>> 0 ? 1 : 0) | 0;
- xl = (el >>> 14 | eh << 18) ^ (el >>> 18 | eh << 14) ^ (el << 23 | eh >>> 9) | 0;
- tl = tl + xl | 0;
- th = th + ((eh >>> 14 | el << 18) ^ (eh >>> 18 | el << 14) ^ (eh << 23 | el >>> 9)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = gl ^ el & (fl ^ gl) | 0;
- tl = tl + xl | 0;
- th = th + (gh ^ eh & (fh ^ gh)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- hl = gl;
- hh = gh;
- gl = fl;
- gh = fh;
- fl = el;
- fh = eh;
- el = dl + tl | 0;
- eh = dh + th + (el >>> 0 < dl >>> 0 ? 1 : 0) | 0;
- dl = cl;
- dh = ch;
- cl = bl;
- ch = bh;
- bl = al;
- bh = ah;
- al = tl + (bl & cl ^ dl & (bl ^ cl)) | 0;
- ah = th + (bh & ch ^ dh & (bh ^ ch)) + (al >>> 0 < tl >>> 0 ? 1 : 0) | 0;
- xl = (bl >>> 28 | bh << 4) ^ (bl << 30 | bh >>> 2) ^ (bl << 25 | bh >>> 7) | 0;
- al = al + xl | 0;
- ah = ah + ((bh >>> 28 | bl << 4) ^ (bh << 30 | bl >>> 2) ^ (bh << 25 | bl >>> 7)) + (al >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- w10l = w10l + w3l | 0;
- w10h = w10h + w3h + (w10l >>> 0 < w3l >>> 0 ? 1 : 0) | 0;
- xl = (w11l >>> 1 | w11h << 31) ^ (w11l >>> 8 | w11h << 24) ^ (w11l >>> 7 | w11h << 25) | 0;
- w10l = w10l + xl | 0;
- w10h = w10h + ((w11h >>> 1 | w11l << 31) ^ (w11h >>> 8 | w11l << 24) ^ w11h >>> 7) + (w10l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = (w8l >>> 19 | w8h << 13) ^ (w8l << 3 | w8h >>> 29) ^ (w8l >>> 6 | w8h << 26) | 0;
- w10l = w10l + xl | 0;
- w10h = w10h + ((w8h >>> 19 | w8l << 13) ^ (w8h << 3 | w8l >>> 29) ^ w8h >>> 6) + (w10l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- tl = 3505952657 + w10l | 0;
- th = 3259730800 + w10h + (tl >>> 0 < w10l >>> 0 ? 1 : 0) | 0;
- tl = tl + hl | 0;
- th = th + hh + (tl >>> 0 < hl >>> 0 ? 1 : 0) | 0;
- xl = (el >>> 14 | eh << 18) ^ (el >>> 18 | eh << 14) ^ (el << 23 | eh >>> 9) | 0;
- tl = tl + xl | 0;
- th = th + ((eh >>> 14 | el << 18) ^ (eh >>> 18 | el << 14) ^ (eh << 23 | el >>> 9)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = gl ^ el & (fl ^ gl) | 0;
- tl = tl + xl | 0;
- th = th + (gh ^ eh & (fh ^ gh)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- hl = gl;
- hh = gh;
- gl = fl;
- gh = fh;
- fl = el;
- fh = eh;
- el = dl + tl | 0;
- eh = dh + th + (el >>> 0 < dl >>> 0 ? 1 : 0) | 0;
- dl = cl;
- dh = ch;
- cl = bl;
- ch = bh;
- bl = al;
- bh = ah;
- al = tl + (bl & cl ^ dl & (bl ^ cl)) | 0;
- ah = th + (bh & ch ^ dh & (bh ^ ch)) + (al >>> 0 < tl >>> 0 ? 1 : 0) | 0;
- xl = (bl >>> 28 | bh << 4) ^ (bl << 30 | bh >>> 2) ^ (bl << 25 | bh >>> 7) | 0;
- al = al + xl | 0;
- ah = ah + ((bh >>> 28 | bl << 4) ^ (bh << 30 | bl >>> 2) ^ (bh << 25 | bl >>> 7)) + (al >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- w11l = w11l + w4l | 0;
- w11h = w11h + w4h + (w11l >>> 0 < w4l >>> 0 ? 1 : 0) | 0;
- xl = (w12l >>> 1 | w12h << 31) ^ (w12l >>> 8 | w12h << 24) ^ (w12l >>> 7 | w12h << 25) | 0;
- w11l = w11l + xl | 0;
- w11h = w11h + ((w12h >>> 1 | w12l << 31) ^ (w12h >>> 8 | w12l << 24) ^ w12h >>> 7) + (w11l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = (w9l >>> 19 | w9h << 13) ^ (w9l << 3 | w9h >>> 29) ^ (w9l >>> 6 | w9h << 26) | 0;
- w11l = w11l + xl | 0;
- w11h = w11h + ((w9h >>> 19 | w9l << 13) ^ (w9h << 3 | w9l >>> 29) ^ w9h >>> 6) + (w11l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- tl = 106217008 + w11l | 0;
- th = 3345764771 + w11h + (tl >>> 0 < w11l >>> 0 ? 1 : 0) | 0;
- tl = tl + hl | 0;
- th = th + hh + (tl >>> 0 < hl >>> 0 ? 1 : 0) | 0;
- xl = (el >>> 14 | eh << 18) ^ (el >>> 18 | eh << 14) ^ (el << 23 | eh >>> 9) | 0;
- tl = tl + xl | 0;
- th = th + ((eh >>> 14 | el << 18) ^ (eh >>> 18 | el << 14) ^ (eh << 23 | el >>> 9)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = gl ^ el & (fl ^ gl) | 0;
- tl = tl + xl | 0;
- th = th + (gh ^ eh & (fh ^ gh)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- hl = gl;
- hh = gh;
- gl = fl;
- gh = fh;
- fl = el;
- fh = eh;
- el = dl + tl | 0;
- eh = dh + th + (el >>> 0 < dl >>> 0 ? 1 : 0) | 0;
- dl = cl;
- dh = ch;
- cl = bl;
- ch = bh;
- bl = al;
- bh = ah;
- al = tl + (bl & cl ^ dl & (bl ^ cl)) | 0;
- ah = th + (bh & ch ^ dh & (bh ^ ch)) + (al >>> 0 < tl >>> 0 ? 1 : 0) | 0;
- xl = (bl >>> 28 | bh << 4) ^ (bl << 30 | bh >>> 2) ^ (bl << 25 | bh >>> 7) | 0;
- al = al + xl | 0;
- ah = ah + ((bh >>> 28 | bl << 4) ^ (bh << 30 | bl >>> 2) ^ (bh << 25 | bl >>> 7)) + (al >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- w12l = w12l + w5l | 0;
- w12h = w12h + w5h + (w12l >>> 0 < w5l >>> 0 ? 1 : 0) | 0;
- xl = (w13l >>> 1 | w13h << 31) ^ (w13l >>> 8 | w13h << 24) ^ (w13l >>> 7 | w13h << 25) | 0;
- w12l = w12l + xl | 0;
- w12h = w12h + ((w13h >>> 1 | w13l << 31) ^ (w13h >>> 8 | w13l << 24) ^ w13h >>> 7) + (w12l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = (w10l >>> 19 | w10h << 13) ^ (w10l << 3 | w10h >>> 29) ^ (w10l >>> 6 | w10h << 26) | 0;
- w12l = w12l + xl | 0;
- w12h = w12h + ((w10h >>> 19 | w10l << 13) ^ (w10h << 3 | w10l >>> 29) ^ w10h >>> 6) + (w12l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- tl = 3606008344 + w12l | 0;
- th = 3516065817 + w12h + (tl >>> 0 < w12l >>> 0 ? 1 : 0) | 0;
- tl = tl + hl | 0;
- th = th + hh + (tl >>> 0 < hl >>> 0 ? 1 : 0) | 0;
- xl = (el >>> 14 | eh << 18) ^ (el >>> 18 | eh << 14) ^ (el << 23 | eh >>> 9) | 0;
- tl = tl + xl | 0;
- th = th + ((eh >>> 14 | el << 18) ^ (eh >>> 18 | el << 14) ^ (eh << 23 | el >>> 9)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = gl ^ el & (fl ^ gl) | 0;
- tl = tl + xl | 0;
- th = th + (gh ^ eh & (fh ^ gh)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- hl = gl;
- hh = gh;
- gl = fl;
- gh = fh;
- fl = el;
- fh = eh;
- el = dl + tl | 0;
- eh = dh + th + (el >>> 0 < dl >>> 0 ? 1 : 0) | 0;
- dl = cl;
- dh = ch;
- cl = bl;
- ch = bh;
- bl = al;
- bh = ah;
- al = tl + (bl & cl ^ dl & (bl ^ cl)) | 0;
- ah = th + (bh & ch ^ dh & (bh ^ ch)) + (al >>> 0 < tl >>> 0 ? 1 : 0) | 0;
- xl = (bl >>> 28 | bh << 4) ^ (bl << 30 | bh >>> 2) ^ (bl << 25 | bh >>> 7) | 0;
- al = al + xl | 0;
- ah = ah + ((bh >>> 28 | bl << 4) ^ (bh << 30 | bl >>> 2) ^ (bh << 25 | bl >>> 7)) + (al >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- w13l = w13l + w6l | 0;
- w13h = w13h + w6h + (w13l >>> 0 < w6l >>> 0 ? 1 : 0) | 0;
- xl = (w14l >>> 1 | w14h << 31) ^ (w14l >>> 8 | w14h << 24) ^ (w14l >>> 7 | w14h << 25) | 0;
- w13l = w13l + xl | 0;
- w13h = w13h + ((w14h >>> 1 | w14l << 31) ^ (w14h >>> 8 | w14l << 24) ^ w14h >>> 7) + (w13l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = (w11l >>> 19 | w11h << 13) ^ (w11l << 3 | w11h >>> 29) ^ (w11l >>> 6 | w11h << 26) | 0;
- w13l = w13l + xl | 0;
- w13h = w13h + ((w11h >>> 19 | w11l << 13) ^ (w11h << 3 | w11l >>> 29) ^ w11h >>> 6) + (w13l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- tl = 1432725776 + w13l | 0;
- th = 3600352804 + w13h + (tl >>> 0 < w13l >>> 0 ? 1 : 0) | 0;
- tl = tl + hl | 0;
- th = th + hh + (tl >>> 0 < hl >>> 0 ? 1 : 0) | 0;
- xl = (el >>> 14 | eh << 18) ^ (el >>> 18 | eh << 14) ^ (el << 23 | eh >>> 9) | 0;
- tl = tl + xl | 0;
- th = th + ((eh >>> 14 | el << 18) ^ (eh >>> 18 | el << 14) ^ (eh << 23 | el >>> 9)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = gl ^ el & (fl ^ gl) | 0;
- tl = tl + xl | 0;
- th = th + (gh ^ eh & (fh ^ gh)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- hl = gl;
- hh = gh;
- gl = fl;
- gh = fh;
- fl = el;
- fh = eh;
- el = dl + tl | 0;
- eh = dh + th + (el >>> 0 < dl >>> 0 ? 1 : 0) | 0;
- dl = cl;
- dh = ch;
- cl = bl;
- ch = bh;
- bl = al;
- bh = ah;
- al = tl + (bl & cl ^ dl & (bl ^ cl)) | 0;
- ah = th + (bh & ch ^ dh & (bh ^ ch)) + (al >>> 0 < tl >>> 0 ? 1 : 0) | 0;
- xl = (bl >>> 28 | bh << 4) ^ (bl << 30 | bh >>> 2) ^ (bl << 25 | bh >>> 7) | 0;
- al = al + xl | 0;
- ah = ah + ((bh >>> 28 | bl << 4) ^ (bh << 30 | bl >>> 2) ^ (bh << 25 | bl >>> 7)) + (al >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- w14l = w14l + w7l | 0;
- w14h = w14h + w7h + (w14l >>> 0 < w7l >>> 0 ? 1 : 0) | 0;
- xl = (w15l >>> 1 | w15h << 31) ^ (w15l >>> 8 | w15h << 24) ^ (w15l >>> 7 | w15h << 25) | 0;
- w14l = w14l + xl | 0;
- w14h = w14h + ((w15h >>> 1 | w15l << 31) ^ (w15h >>> 8 | w15l << 24) ^ w15h >>> 7) + (w14l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = (w12l >>> 19 | w12h << 13) ^ (w12l << 3 | w12h >>> 29) ^ (w12l >>> 6 | w12h << 26) | 0;
- w14l = w14l + xl | 0;
- w14h = w14h + ((w12h >>> 19 | w12l << 13) ^ (w12h << 3 | w12l >>> 29) ^ w12h >>> 6) + (w14l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- tl = 1467031594 + w14l | 0;
- th = 4094571909 + w14h + (tl >>> 0 < w14l >>> 0 ? 1 : 0) | 0;
- tl = tl + hl | 0;
- th = th + hh + (tl >>> 0 < hl >>> 0 ? 1 : 0) | 0;
- xl = (el >>> 14 | eh << 18) ^ (el >>> 18 | eh << 14) ^ (el << 23 | eh >>> 9) | 0;
- tl = tl + xl | 0;
- th = th + ((eh >>> 14 | el << 18) ^ (eh >>> 18 | el << 14) ^ (eh << 23 | el >>> 9)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = gl ^ el & (fl ^ gl) | 0;
- tl = tl + xl | 0;
- th = th + (gh ^ eh & (fh ^ gh)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- hl = gl;
- hh = gh;
- gl = fl;
- gh = fh;
- fl = el;
- fh = eh;
- el = dl + tl | 0;
- eh = dh + th + (el >>> 0 < dl >>> 0 ? 1 : 0) | 0;
- dl = cl;
- dh = ch;
- cl = bl;
- ch = bh;
- bl = al;
- bh = ah;
- al = tl + (bl & cl ^ dl & (bl ^ cl)) | 0;
- ah = th + (bh & ch ^ dh & (bh ^ ch)) + (al >>> 0 < tl >>> 0 ? 1 : 0) | 0;
- xl = (bl >>> 28 | bh << 4) ^ (bl << 30 | bh >>> 2) ^ (bl << 25 | bh >>> 7) | 0;
- al = al + xl | 0;
- ah = ah + ((bh >>> 28 | bl << 4) ^ (bh << 30 | bl >>> 2) ^ (bh << 25 | bl >>> 7)) + (al >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- w15l = w15l + w8l | 0;
- w15h = w15h + w8h + (w15l >>> 0 < w8l >>> 0 ? 1 : 0) | 0;
- xl = (w0l >>> 1 | w0h << 31) ^ (w0l >>> 8 | w0h << 24) ^ (w0l >>> 7 | w0h << 25) | 0;
- w15l = w15l + xl | 0;
- w15h = w15h + ((w0h >>> 1 | w0l << 31) ^ (w0h >>> 8 | w0l << 24) ^ w0h >>> 7) + (w15l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = (w13l >>> 19 | w13h << 13) ^ (w13l << 3 | w13h >>> 29) ^ (w13l >>> 6 | w13h << 26) | 0;
- w15l = w15l + xl | 0;
- w15h = w15h + ((w13h >>> 19 | w13l << 13) ^ (w13h << 3 | w13l >>> 29) ^ w13h >>> 6) + (w15l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- tl = 851169720 + w15l | 0;
- th = 275423344 + w15h + (tl >>> 0 < w15l >>> 0 ? 1 : 0) | 0;
- tl = tl + hl | 0;
- th = th + hh + (tl >>> 0 < hl >>> 0 ? 1 : 0) | 0;
- xl = (el >>> 14 | eh << 18) ^ (el >>> 18 | eh << 14) ^ (el << 23 | eh >>> 9) | 0;
- tl = tl + xl | 0;
- th = th + ((eh >>> 14 | el << 18) ^ (eh >>> 18 | el << 14) ^ (eh << 23 | el >>> 9)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = gl ^ el & (fl ^ gl) | 0;
- tl = tl + xl | 0;
- th = th + (gh ^ eh & (fh ^ gh)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- hl = gl;
- hh = gh;
- gl = fl;
- gh = fh;
- fl = el;
- fh = eh;
- el = dl + tl | 0;
- eh = dh + th + (el >>> 0 < dl >>> 0 ? 1 : 0) | 0;
- dl = cl;
- dh = ch;
- cl = bl;
- ch = bh;
- bl = al;
- bh = ah;
- al = tl + (bl & cl ^ dl & (bl ^ cl)) | 0;
- ah = th + (bh & ch ^ dh & (bh ^ ch)) + (al >>> 0 < tl >>> 0 ? 1 : 0) | 0;
- xl = (bl >>> 28 | bh << 4) ^ (bl << 30 | bh >>> 2) ^ (bl << 25 | bh >>> 7) | 0;
- al = al + xl | 0;
- ah = ah + ((bh >>> 28 | bl << 4) ^ (bh << 30 | bl >>> 2) ^ (bh << 25 | bl >>> 7)) + (al >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- w0l = w0l + w9l | 0;
- w0h = w0h + w9h + (w0l >>> 0 < w9l >>> 0 ? 1 : 0) | 0;
- xl = (w1l >>> 1 | w1h << 31) ^ (w1l >>> 8 | w1h << 24) ^ (w1l >>> 7 | w1h << 25) | 0;
- w0l = w0l + xl | 0;
- w0h = w0h + ((w1h >>> 1 | w1l << 31) ^ (w1h >>> 8 | w1l << 24) ^ w1h >>> 7) + (w0l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = (w14l >>> 19 | w14h << 13) ^ (w14l << 3 | w14h >>> 29) ^ (w14l >>> 6 | w14h << 26) | 0;
- w0l = w0l + xl | 0;
- w0h = w0h + ((w14h >>> 19 | w14l << 13) ^ (w14h << 3 | w14l >>> 29) ^ w14h >>> 6) + (w0l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- tl = 3100823752 + w0l | 0;
- th = 430227734 + w0h + (tl >>> 0 < w0l >>> 0 ? 1 : 0) | 0;
- tl = tl + hl | 0;
- th = th + hh + (tl >>> 0 < hl >>> 0 ? 1 : 0) | 0;
- xl = (el >>> 14 | eh << 18) ^ (el >>> 18 | eh << 14) ^ (el << 23 | eh >>> 9) | 0;
- tl = tl + xl | 0;
- th = th + ((eh >>> 14 | el << 18) ^ (eh >>> 18 | el << 14) ^ (eh << 23 | el >>> 9)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = gl ^ el & (fl ^ gl) | 0;
- tl = tl + xl | 0;
- th = th + (gh ^ eh & (fh ^ gh)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- hl = gl;
- hh = gh;
- gl = fl;
- gh = fh;
- fl = el;
- fh = eh;
- el = dl + tl | 0;
- eh = dh + th + (el >>> 0 < dl >>> 0 ? 1 : 0) | 0;
- dl = cl;
- dh = ch;
- cl = bl;
- ch = bh;
- bl = al;
- bh = ah;
- al = tl + (bl & cl ^ dl & (bl ^ cl)) | 0;
- ah = th + (bh & ch ^ dh & (bh ^ ch)) + (al >>> 0 < tl >>> 0 ? 1 : 0) | 0;
- xl = (bl >>> 28 | bh << 4) ^ (bl << 30 | bh >>> 2) ^ (bl << 25 | bh >>> 7) | 0;
- al = al + xl | 0;
- ah = ah + ((bh >>> 28 | bl << 4) ^ (bh << 30 | bl >>> 2) ^ (bh << 25 | bl >>> 7)) + (al >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- w1l = w1l + w10l | 0;
- w1h = w1h + w10h + (w1l >>> 0 < w10l >>> 0 ? 1 : 0) | 0;
- xl = (w2l >>> 1 | w2h << 31) ^ (w2l >>> 8 | w2h << 24) ^ (w2l >>> 7 | w2h << 25) | 0;
- w1l = w1l + xl | 0;
- w1h = w1h + ((w2h >>> 1 | w2l << 31) ^ (w2h >>> 8 | w2l << 24) ^ w2h >>> 7) + (w1l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = (w15l >>> 19 | w15h << 13) ^ (w15l << 3 | w15h >>> 29) ^ (w15l >>> 6 | w15h << 26) | 0;
- w1l = w1l + xl | 0;
- w1h = w1h + ((w15h >>> 19 | w15l << 13) ^ (w15h << 3 | w15l >>> 29) ^ w15h >>> 6) + (w1l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- tl = 1363258195 + w1l | 0;
- th = 506948616 + w1h + (tl >>> 0 < w1l >>> 0 ? 1 : 0) | 0;
- tl = tl + hl | 0;
- th = th + hh + (tl >>> 0 < hl >>> 0 ? 1 : 0) | 0;
- xl = (el >>> 14 | eh << 18) ^ (el >>> 18 | eh << 14) ^ (el << 23 | eh >>> 9) | 0;
- tl = tl + xl | 0;
- th = th + ((eh >>> 14 | el << 18) ^ (eh >>> 18 | el << 14) ^ (eh << 23 | el >>> 9)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = gl ^ el & (fl ^ gl) | 0;
- tl = tl + xl | 0;
- th = th + (gh ^ eh & (fh ^ gh)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- hl = gl;
- hh = gh;
- gl = fl;
- gh = fh;
- fl = el;
- fh = eh;
- el = dl + tl | 0;
- eh = dh + th + (el >>> 0 < dl >>> 0 ? 1 : 0) | 0;
- dl = cl;
- dh = ch;
- cl = bl;
- ch = bh;
- bl = al;
- bh = ah;
- al = tl + (bl & cl ^ dl & (bl ^ cl)) | 0;
- ah = th + (bh & ch ^ dh & (bh ^ ch)) + (al >>> 0 < tl >>> 0 ? 1 : 0) | 0;
- xl = (bl >>> 28 | bh << 4) ^ (bl << 30 | bh >>> 2) ^ (bl << 25 | bh >>> 7) | 0;
- al = al + xl | 0;
- ah = ah + ((bh >>> 28 | bl << 4) ^ (bh << 30 | bl >>> 2) ^ (bh << 25 | bl >>> 7)) + (al >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- w2l = w2l + w11l | 0;
- w2h = w2h + w11h + (w2l >>> 0 < w11l >>> 0 ? 1 : 0) | 0;
- xl = (w3l >>> 1 | w3h << 31) ^ (w3l >>> 8 | w3h << 24) ^ (w3l >>> 7 | w3h << 25) | 0;
- w2l = w2l + xl | 0;
- w2h = w2h + ((w3h >>> 1 | w3l << 31) ^ (w3h >>> 8 | w3l << 24) ^ w3h >>> 7) + (w2l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = (w0l >>> 19 | w0h << 13) ^ (w0l << 3 | w0h >>> 29) ^ (w0l >>> 6 | w0h << 26) | 0;
- w2l = w2l + xl | 0;
- w2h = w2h + ((w0h >>> 19 | w0l << 13) ^ (w0h << 3 | w0l >>> 29) ^ w0h >>> 6) + (w2l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- tl = 3750685593 + w2l | 0;
- th = 659060556 + w2h + (tl >>> 0 < w2l >>> 0 ? 1 : 0) | 0;
- tl = tl + hl | 0;
- th = th + hh + (tl >>> 0 < hl >>> 0 ? 1 : 0) | 0;
- xl = (el >>> 14 | eh << 18) ^ (el >>> 18 | eh << 14) ^ (el << 23 | eh >>> 9) | 0;
- tl = tl + xl | 0;
- th = th + ((eh >>> 14 | el << 18) ^ (eh >>> 18 | el << 14) ^ (eh << 23 | el >>> 9)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = gl ^ el & (fl ^ gl) | 0;
- tl = tl + xl | 0;
- th = th + (gh ^ eh & (fh ^ gh)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- hl = gl;
- hh = gh;
- gl = fl;
- gh = fh;
- fl = el;
- fh = eh;
- el = dl + tl | 0;
- eh = dh + th + (el >>> 0 < dl >>> 0 ? 1 : 0) | 0;
- dl = cl;
- dh = ch;
- cl = bl;
- ch = bh;
- bl = al;
- bh = ah;
- al = tl + (bl & cl ^ dl & (bl ^ cl)) | 0;
- ah = th + (bh & ch ^ dh & (bh ^ ch)) + (al >>> 0 < tl >>> 0 ? 1 : 0) | 0;
- xl = (bl >>> 28 | bh << 4) ^ (bl << 30 | bh >>> 2) ^ (bl << 25 | bh >>> 7) | 0;
- al = al + xl | 0;
- ah = ah + ((bh >>> 28 | bl << 4) ^ (bh << 30 | bl >>> 2) ^ (bh << 25 | bl >>> 7)) + (al >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- w3l = w3l + w12l | 0;
- w3h = w3h + w12h + (w3l >>> 0 < w12l >>> 0 ? 1 : 0) | 0;
- xl = (w4l >>> 1 | w4h << 31) ^ (w4l >>> 8 | w4h << 24) ^ (w4l >>> 7 | w4h << 25) | 0;
- w3l = w3l + xl | 0;
- w3h = w3h + ((w4h >>> 1 | w4l << 31) ^ (w4h >>> 8 | w4l << 24) ^ w4h >>> 7) + (w3l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = (w1l >>> 19 | w1h << 13) ^ (w1l << 3 | w1h >>> 29) ^ (w1l >>> 6 | w1h << 26) | 0;
- w3l = w3l + xl | 0;
- w3h = w3h + ((w1h >>> 19 | w1l << 13) ^ (w1h << 3 | w1l >>> 29) ^ w1h >>> 6) + (w3l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- tl = 3785050280 + w3l | 0;
- th = 883997877 + w3h + (tl >>> 0 < w3l >>> 0 ? 1 : 0) | 0;
- tl = tl + hl | 0;
- th = th + hh + (tl >>> 0 < hl >>> 0 ? 1 : 0) | 0;
- xl = (el >>> 14 | eh << 18) ^ (el >>> 18 | eh << 14) ^ (el << 23 | eh >>> 9) | 0;
- tl = tl + xl | 0;
- th = th + ((eh >>> 14 | el << 18) ^ (eh >>> 18 | el << 14) ^ (eh << 23 | el >>> 9)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = gl ^ el & (fl ^ gl) | 0;
- tl = tl + xl | 0;
- th = th + (gh ^ eh & (fh ^ gh)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- hl = gl;
- hh = gh;
- gl = fl;
- gh = fh;
- fl = el;
- fh = eh;
- el = dl + tl | 0;
- eh = dh + th + (el >>> 0 < dl >>> 0 ? 1 : 0) | 0;
- dl = cl;
- dh = ch;
- cl = bl;
- ch = bh;
- bl = al;
- bh = ah;
- al = tl + (bl & cl ^ dl & (bl ^ cl)) | 0;
- ah = th + (bh & ch ^ dh & (bh ^ ch)) + (al >>> 0 < tl >>> 0 ? 1 : 0) | 0;
- xl = (bl >>> 28 | bh << 4) ^ (bl << 30 | bh >>> 2) ^ (bl << 25 | bh >>> 7) | 0;
- al = al + xl | 0;
- ah = ah + ((bh >>> 28 | bl << 4) ^ (bh << 30 | bl >>> 2) ^ (bh << 25 | bl >>> 7)) + (al >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- w4l = w4l + w13l | 0;
- w4h = w4h + w13h + (w4l >>> 0 < w13l >>> 0 ? 1 : 0) | 0;
- xl = (w5l >>> 1 | w5h << 31) ^ (w5l >>> 8 | w5h << 24) ^ (w5l >>> 7 | w5h << 25) | 0;
- w4l = w4l + xl | 0;
- w4h = w4h + ((w5h >>> 1 | w5l << 31) ^ (w5h >>> 8 | w5l << 24) ^ w5h >>> 7) + (w4l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = (w2l >>> 19 | w2h << 13) ^ (w2l << 3 | w2h >>> 29) ^ (w2l >>> 6 | w2h << 26) | 0;
- w4l = w4l + xl | 0;
- w4h = w4h + ((w2h >>> 19 | w2l << 13) ^ (w2h << 3 | w2l >>> 29) ^ w2h >>> 6) + (w4l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- tl = 3318307427 + w4l | 0;
- th = 958139571 + w4h + (tl >>> 0 < w4l >>> 0 ? 1 : 0) | 0;
- tl = tl + hl | 0;
- th = th + hh + (tl >>> 0 < hl >>> 0 ? 1 : 0) | 0;
- xl = (el >>> 14 | eh << 18) ^ (el >>> 18 | eh << 14) ^ (el << 23 | eh >>> 9) | 0;
- tl = tl + xl | 0;
- th = th + ((eh >>> 14 | el << 18) ^ (eh >>> 18 | el << 14) ^ (eh << 23 | el >>> 9)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = gl ^ el & (fl ^ gl) | 0;
- tl = tl + xl | 0;
- th = th + (gh ^ eh & (fh ^ gh)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- hl = gl;
- hh = gh;
- gl = fl;
- gh = fh;
- fl = el;
- fh = eh;
- el = dl + tl | 0;
- eh = dh + th + (el >>> 0 < dl >>> 0 ? 1 : 0) | 0;
- dl = cl;
- dh = ch;
- cl = bl;
- ch = bh;
- bl = al;
- bh = ah;
- al = tl + (bl & cl ^ dl & (bl ^ cl)) | 0;
- ah = th + (bh & ch ^ dh & (bh ^ ch)) + (al >>> 0 < tl >>> 0 ? 1 : 0) | 0;
- xl = (bl >>> 28 | bh << 4) ^ (bl << 30 | bh >>> 2) ^ (bl << 25 | bh >>> 7) | 0;
- al = al + xl | 0;
- ah = ah + ((bh >>> 28 | bl << 4) ^ (bh << 30 | bl >>> 2) ^ (bh << 25 | bl >>> 7)) + (al >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- w5l = w5l + w14l | 0;
- w5h = w5h + w14h + (w5l >>> 0 < w14l >>> 0 ? 1 : 0) | 0;
- xl = (w6l >>> 1 | w6h << 31) ^ (w6l >>> 8 | w6h << 24) ^ (w6l >>> 7 | w6h << 25) | 0;
- w5l = w5l + xl | 0;
- w5h = w5h + ((w6h >>> 1 | w6l << 31) ^ (w6h >>> 8 | w6l << 24) ^ w6h >>> 7) + (w5l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = (w3l >>> 19 | w3h << 13) ^ (w3l << 3 | w3h >>> 29) ^ (w3l >>> 6 | w3h << 26) | 0;
- w5l = w5l + xl | 0;
- w5h = w5h + ((w3h >>> 19 | w3l << 13) ^ (w3h << 3 | w3l >>> 29) ^ w3h >>> 6) + (w5l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- tl = 3812723403 + w5l | 0;
- th = 1322822218 + w5h + (tl >>> 0 < w5l >>> 0 ? 1 : 0) | 0;
- tl = tl + hl | 0;
- th = th + hh + (tl >>> 0 < hl >>> 0 ? 1 : 0) | 0;
- xl = (el >>> 14 | eh << 18) ^ (el >>> 18 | eh << 14) ^ (el << 23 | eh >>> 9) | 0;
- tl = tl + xl | 0;
- th = th + ((eh >>> 14 | el << 18) ^ (eh >>> 18 | el << 14) ^ (eh << 23 | el >>> 9)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = gl ^ el & (fl ^ gl) | 0;
- tl = tl + xl | 0;
- th = th + (gh ^ eh & (fh ^ gh)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- hl = gl;
- hh = gh;
- gl = fl;
- gh = fh;
- fl = el;
- fh = eh;
- el = dl + tl | 0;
- eh = dh + th + (el >>> 0 < dl >>> 0 ? 1 : 0) | 0;
- dl = cl;
- dh = ch;
- cl = bl;
- ch = bh;
- bl = al;
- bh = ah;
- al = tl + (bl & cl ^ dl & (bl ^ cl)) | 0;
- ah = th + (bh & ch ^ dh & (bh ^ ch)) + (al >>> 0 < tl >>> 0 ? 1 : 0) | 0;
- xl = (bl >>> 28 | bh << 4) ^ (bl << 30 | bh >>> 2) ^ (bl << 25 | bh >>> 7) | 0;
- al = al + xl | 0;
- ah = ah + ((bh >>> 28 | bl << 4) ^ (bh << 30 | bl >>> 2) ^ (bh << 25 | bl >>> 7)) + (al >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- w6l = w6l + w15l | 0;
- w6h = w6h + w15h + (w6l >>> 0 < w15l >>> 0 ? 1 : 0) | 0;
- xl = (w7l >>> 1 | w7h << 31) ^ (w7l >>> 8 | w7h << 24) ^ (w7l >>> 7 | w7h << 25) | 0;
- w6l = w6l + xl | 0;
- w6h = w6h + ((w7h >>> 1 | w7l << 31) ^ (w7h >>> 8 | w7l << 24) ^ w7h >>> 7) + (w6l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = (w4l >>> 19 | w4h << 13) ^ (w4l << 3 | w4h >>> 29) ^ (w4l >>> 6 | w4h << 26) | 0;
- w6l = w6l + xl | 0;
- w6h = w6h + ((w4h >>> 19 | w4l << 13) ^ (w4h << 3 | w4l >>> 29) ^ w4h >>> 6) + (w6l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- tl = 2003034995 + w6l | 0;
- th = 1537002063 + w6h + (tl >>> 0 < w6l >>> 0 ? 1 : 0) | 0;
- tl = tl + hl | 0;
- th = th + hh + (tl >>> 0 < hl >>> 0 ? 1 : 0) | 0;
- xl = (el >>> 14 | eh << 18) ^ (el >>> 18 | eh << 14) ^ (el << 23 | eh >>> 9) | 0;
- tl = tl + xl | 0;
- th = th + ((eh >>> 14 | el << 18) ^ (eh >>> 18 | el << 14) ^ (eh << 23 | el >>> 9)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = gl ^ el & (fl ^ gl) | 0;
- tl = tl + xl | 0;
- th = th + (gh ^ eh & (fh ^ gh)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- hl = gl;
- hh = gh;
- gl = fl;
- gh = fh;
- fl = el;
- fh = eh;
- el = dl + tl | 0;
- eh = dh + th + (el >>> 0 < dl >>> 0 ? 1 : 0) | 0;
- dl = cl;
- dh = ch;
- cl = bl;
- ch = bh;
- bl = al;
- bh = ah;
- al = tl + (bl & cl ^ dl & (bl ^ cl)) | 0;
- ah = th + (bh & ch ^ dh & (bh ^ ch)) + (al >>> 0 < tl >>> 0 ? 1 : 0) | 0;
- xl = (bl >>> 28 | bh << 4) ^ (bl << 30 | bh >>> 2) ^ (bl << 25 | bh >>> 7) | 0;
- al = al + xl | 0;
- ah = ah + ((bh >>> 28 | bl << 4) ^ (bh << 30 | bl >>> 2) ^ (bh << 25 | bl >>> 7)) + (al >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- w7l = w7l + w0l | 0;
- w7h = w7h + w0h + (w7l >>> 0 < w0l >>> 0 ? 1 : 0) | 0;
- xl = (w8l >>> 1 | w8h << 31) ^ (w8l >>> 8 | w8h << 24) ^ (w8l >>> 7 | w8h << 25) | 0;
- w7l = w7l + xl | 0;
- w7h = w7h + ((w8h >>> 1 | w8l << 31) ^ (w8h >>> 8 | w8l << 24) ^ w8h >>> 7) + (w7l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = (w5l >>> 19 | w5h << 13) ^ (w5l << 3 | w5h >>> 29) ^ (w5l >>> 6 | w5h << 26) | 0;
- w7l = w7l + xl | 0;
- w7h = w7h + ((w5h >>> 19 | w5l << 13) ^ (w5h << 3 | w5l >>> 29) ^ w5h >>> 6) + (w7l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- tl = 3602036899 + w7l | 0;
- th = 1747873779 + w7h + (tl >>> 0 < w7l >>> 0 ? 1 : 0) | 0;
- tl = tl + hl | 0;
- th = th + hh + (tl >>> 0 < hl >>> 0 ? 1 : 0) | 0;
- xl = (el >>> 14 | eh << 18) ^ (el >>> 18 | eh << 14) ^ (el << 23 | eh >>> 9) | 0;
- tl = tl + xl | 0;
- th = th + ((eh >>> 14 | el << 18) ^ (eh >>> 18 | el << 14) ^ (eh << 23 | el >>> 9)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = gl ^ el & (fl ^ gl) | 0;
- tl = tl + xl | 0;
- th = th + (gh ^ eh & (fh ^ gh)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- hl = gl;
- hh = gh;
- gl = fl;
- gh = fh;
- fl = el;
- fh = eh;
- el = dl + tl | 0;
- eh = dh + th + (el >>> 0 < dl >>> 0 ? 1 : 0) | 0;
- dl = cl;
- dh = ch;
- cl = bl;
- ch = bh;
- bl = al;
- bh = ah;
- al = tl + (bl & cl ^ dl & (bl ^ cl)) | 0;
- ah = th + (bh & ch ^ dh & (bh ^ ch)) + (al >>> 0 < tl >>> 0 ? 1 : 0) | 0;
- xl = (bl >>> 28 | bh << 4) ^ (bl << 30 | bh >>> 2) ^ (bl << 25 | bh >>> 7) | 0;
- al = al + xl | 0;
- ah = ah + ((bh >>> 28 | bl << 4) ^ (bh << 30 | bl >>> 2) ^ (bh << 25 | bl >>> 7)) + (al >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- w8l = w8l + w1l | 0;
- w8h = w8h + w1h + (w8l >>> 0 < w1l >>> 0 ? 1 : 0) | 0;
- xl = (w9l >>> 1 | w9h << 31) ^ (w9l >>> 8 | w9h << 24) ^ (w9l >>> 7 | w9h << 25) | 0;
- w8l = w8l + xl | 0;
- w8h = w8h + ((w9h >>> 1 | w9l << 31) ^ (w9h >>> 8 | w9l << 24) ^ w9h >>> 7) + (w8l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = (w6l >>> 19 | w6h << 13) ^ (w6l << 3 | w6h >>> 29) ^ (w6l >>> 6 | w6h << 26) | 0;
- w8l = w8l + xl | 0;
- w8h = w8h + ((w6h >>> 19 | w6l << 13) ^ (w6h << 3 | w6l >>> 29) ^ w6h >>> 6) + (w8l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- tl = 1575990012 + w8l | 0;
- th = 1955562222 + w8h + (tl >>> 0 < w8l >>> 0 ? 1 : 0) | 0;
- tl = tl + hl | 0;
- th = th + hh + (tl >>> 0 < hl >>> 0 ? 1 : 0) | 0;
- xl = (el >>> 14 | eh << 18) ^ (el >>> 18 | eh << 14) ^ (el << 23 | eh >>> 9) | 0;
- tl = tl + xl | 0;
- th = th + ((eh >>> 14 | el << 18) ^ (eh >>> 18 | el << 14) ^ (eh << 23 | el >>> 9)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = gl ^ el & (fl ^ gl) | 0;
- tl = tl + xl | 0;
- th = th + (gh ^ eh & (fh ^ gh)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- hl = gl;
- hh = gh;
- gl = fl;
- gh = fh;
- fl = el;
- fh = eh;
- el = dl + tl | 0;
- eh = dh + th + (el >>> 0 < dl >>> 0 ? 1 : 0) | 0;
- dl = cl;
- dh = ch;
- cl = bl;
- ch = bh;
- bl = al;
- bh = ah;
- al = tl + (bl & cl ^ dl & (bl ^ cl)) | 0;
- ah = th + (bh & ch ^ dh & (bh ^ ch)) + (al >>> 0 < tl >>> 0 ? 1 : 0) | 0;
- xl = (bl >>> 28 | bh << 4) ^ (bl << 30 | bh >>> 2) ^ (bl << 25 | bh >>> 7) | 0;
- al = al + xl | 0;
- ah = ah + ((bh >>> 28 | bl << 4) ^ (bh << 30 | bl >>> 2) ^ (bh << 25 | bl >>> 7)) + (al >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- w9l = w9l + w2l | 0;
- w9h = w9h + w2h + (w9l >>> 0 < w2l >>> 0 ? 1 : 0) | 0;
- xl = (w10l >>> 1 | w10h << 31) ^ (w10l >>> 8 | w10h << 24) ^ (w10l >>> 7 | w10h << 25) | 0;
- w9l = w9l + xl | 0;
- w9h = w9h + ((w10h >>> 1 | w10l << 31) ^ (w10h >>> 8 | w10l << 24) ^ w10h >>> 7) + (w9l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = (w7l >>> 19 | w7h << 13) ^ (w7l << 3 | w7h >>> 29) ^ (w7l >>> 6 | w7h << 26) | 0;
- w9l = w9l + xl | 0;
- w9h = w9h + ((w7h >>> 19 | w7l << 13) ^ (w7h << 3 | w7l >>> 29) ^ w7h >>> 6) + (w9l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- tl = 1125592928 + w9l | 0;
- th = 2024104815 + w9h + (tl >>> 0 < w9l >>> 0 ? 1 : 0) | 0;
- tl = tl + hl | 0;
- th = th + hh + (tl >>> 0 < hl >>> 0 ? 1 : 0) | 0;
- xl = (el >>> 14 | eh << 18) ^ (el >>> 18 | eh << 14) ^ (el << 23 | eh >>> 9) | 0;
- tl = tl + xl | 0;
- th = th + ((eh >>> 14 | el << 18) ^ (eh >>> 18 | el << 14) ^ (eh << 23 | el >>> 9)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = gl ^ el & (fl ^ gl) | 0;
- tl = tl + xl | 0;
- th = th + (gh ^ eh & (fh ^ gh)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- hl = gl;
- hh = gh;
- gl = fl;
- gh = fh;
- fl = el;
- fh = eh;
- el = dl + tl | 0;
- eh = dh + th + (el >>> 0 < dl >>> 0 ? 1 : 0) | 0;
- dl = cl;
- dh = ch;
- cl = bl;
- ch = bh;
- bl = al;
- bh = ah;
- al = tl + (bl & cl ^ dl & (bl ^ cl)) | 0;
- ah = th + (bh & ch ^ dh & (bh ^ ch)) + (al >>> 0 < tl >>> 0 ? 1 : 0) | 0;
- xl = (bl >>> 28 | bh << 4) ^ (bl << 30 | bh >>> 2) ^ (bl << 25 | bh >>> 7) | 0;
- al = al + xl | 0;
- ah = ah + ((bh >>> 28 | bl << 4) ^ (bh << 30 | bl >>> 2) ^ (bh << 25 | bl >>> 7)) + (al >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- w10l = w10l + w3l | 0;
- w10h = w10h + w3h + (w10l >>> 0 < w3l >>> 0 ? 1 : 0) | 0;
- xl = (w11l >>> 1 | w11h << 31) ^ (w11l >>> 8 | w11h << 24) ^ (w11l >>> 7 | w11h << 25) | 0;
- w10l = w10l + xl | 0;
- w10h = w10h + ((w11h >>> 1 | w11l << 31) ^ (w11h >>> 8 | w11l << 24) ^ w11h >>> 7) + (w10l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = (w8l >>> 19 | w8h << 13) ^ (w8l << 3 | w8h >>> 29) ^ (w8l >>> 6 | w8h << 26) | 0;
- w10l = w10l + xl | 0;
- w10h = w10h + ((w8h >>> 19 | w8l << 13) ^ (w8h << 3 | w8l >>> 29) ^ w8h >>> 6) + (w10l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- tl = 2716904306 + w10l | 0;
- th = 2227730452 + w10h + (tl >>> 0 < w10l >>> 0 ? 1 : 0) | 0;
- tl = tl + hl | 0;
- th = th + hh + (tl >>> 0 < hl >>> 0 ? 1 : 0) | 0;
- xl = (el >>> 14 | eh << 18) ^ (el >>> 18 | eh << 14) ^ (el << 23 | eh >>> 9) | 0;
- tl = tl + xl | 0;
- th = th + ((eh >>> 14 | el << 18) ^ (eh >>> 18 | el << 14) ^ (eh << 23 | el >>> 9)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = gl ^ el & (fl ^ gl) | 0;
- tl = tl + xl | 0;
- th = th + (gh ^ eh & (fh ^ gh)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- hl = gl;
- hh = gh;
- gl = fl;
- gh = fh;
- fl = el;
- fh = eh;
- el = dl + tl | 0;
- eh = dh + th + (el >>> 0 < dl >>> 0 ? 1 : 0) | 0;
- dl = cl;
- dh = ch;
- cl = bl;
- ch = bh;
- bl = al;
- bh = ah;
- al = tl + (bl & cl ^ dl & (bl ^ cl)) | 0;
- ah = th + (bh & ch ^ dh & (bh ^ ch)) + (al >>> 0 < tl >>> 0 ? 1 : 0) | 0;
- xl = (bl >>> 28 | bh << 4) ^ (bl << 30 | bh >>> 2) ^ (bl << 25 | bh >>> 7) | 0;
- al = al + xl | 0;
- ah = ah + ((bh >>> 28 | bl << 4) ^ (bh << 30 | bl >>> 2) ^ (bh << 25 | bl >>> 7)) + (al >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- w11l = w11l + w4l | 0;
- w11h = w11h + w4h + (w11l >>> 0 < w4l >>> 0 ? 1 : 0) | 0;
- xl = (w12l >>> 1 | w12h << 31) ^ (w12l >>> 8 | w12h << 24) ^ (w12l >>> 7 | w12h << 25) | 0;
- w11l = w11l + xl | 0;
- w11h = w11h + ((w12h >>> 1 | w12l << 31) ^ (w12h >>> 8 | w12l << 24) ^ w12h >>> 7) + (w11l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = (w9l >>> 19 | w9h << 13) ^ (w9l << 3 | w9h >>> 29) ^ (w9l >>> 6 | w9h << 26) | 0;
- w11l = w11l + xl | 0;
- w11h = w11h + ((w9h >>> 19 | w9l << 13) ^ (w9h << 3 | w9l >>> 29) ^ w9h >>> 6) + (w11l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- tl = 442776044 + w11l | 0;
- th = 2361852424 + w11h + (tl >>> 0 < w11l >>> 0 ? 1 : 0) | 0;
- tl = tl + hl | 0;
- th = th + hh + (tl >>> 0 < hl >>> 0 ? 1 : 0) | 0;
- xl = (el >>> 14 | eh << 18) ^ (el >>> 18 | eh << 14) ^ (el << 23 | eh >>> 9) | 0;
- tl = tl + xl | 0;
- th = th + ((eh >>> 14 | el << 18) ^ (eh >>> 18 | el << 14) ^ (eh << 23 | el >>> 9)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = gl ^ el & (fl ^ gl) | 0;
- tl = tl + xl | 0;
- th = th + (gh ^ eh & (fh ^ gh)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- hl = gl;
- hh = gh;
- gl = fl;
- gh = fh;
- fl = el;
- fh = eh;
- el = dl + tl | 0;
- eh = dh + th + (el >>> 0 < dl >>> 0 ? 1 : 0) | 0;
- dl = cl;
- dh = ch;
- cl = bl;
- ch = bh;
- bl = al;
- bh = ah;
- al = tl + (bl & cl ^ dl & (bl ^ cl)) | 0;
- ah = th + (bh & ch ^ dh & (bh ^ ch)) + (al >>> 0 < tl >>> 0 ? 1 : 0) | 0;
- xl = (bl >>> 28 | bh << 4) ^ (bl << 30 | bh >>> 2) ^ (bl << 25 | bh >>> 7) | 0;
- al = al + xl | 0;
- ah = ah + ((bh >>> 28 | bl << 4) ^ (bh << 30 | bl >>> 2) ^ (bh << 25 | bl >>> 7)) + (al >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- w12l = w12l + w5l | 0;
- w12h = w12h + w5h + (w12l >>> 0 < w5l >>> 0 ? 1 : 0) | 0;
- xl = (w13l >>> 1 | w13h << 31) ^ (w13l >>> 8 | w13h << 24) ^ (w13l >>> 7 | w13h << 25) | 0;
- w12l = w12l + xl | 0;
- w12h = w12h + ((w13h >>> 1 | w13l << 31) ^ (w13h >>> 8 | w13l << 24) ^ w13h >>> 7) + (w12l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = (w10l >>> 19 | w10h << 13) ^ (w10l << 3 | w10h >>> 29) ^ (w10l >>> 6 | w10h << 26) | 0;
- w12l = w12l + xl | 0;
- w12h = w12h + ((w10h >>> 19 | w10l << 13) ^ (w10h << 3 | w10l >>> 29) ^ w10h >>> 6) + (w12l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- tl = 593698344 + w12l | 0;
- th = 2428436474 + w12h + (tl >>> 0 < w12l >>> 0 ? 1 : 0) | 0;
- tl = tl + hl | 0;
- th = th + hh + (tl >>> 0 < hl >>> 0 ? 1 : 0) | 0;
- xl = (el >>> 14 | eh << 18) ^ (el >>> 18 | eh << 14) ^ (el << 23 | eh >>> 9) | 0;
- tl = tl + xl | 0;
- th = th + ((eh >>> 14 | el << 18) ^ (eh >>> 18 | el << 14) ^ (eh << 23 | el >>> 9)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = gl ^ el & (fl ^ gl) | 0;
- tl = tl + xl | 0;
- th = th + (gh ^ eh & (fh ^ gh)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- hl = gl;
- hh = gh;
- gl = fl;
- gh = fh;
- fl = el;
- fh = eh;
- el = dl + tl | 0;
- eh = dh + th + (el >>> 0 < dl >>> 0 ? 1 : 0) | 0;
- dl = cl;
- dh = ch;
- cl = bl;
- ch = bh;
- bl = al;
- bh = ah;
- al = tl + (bl & cl ^ dl & (bl ^ cl)) | 0;
- ah = th + (bh & ch ^ dh & (bh ^ ch)) + (al >>> 0 < tl >>> 0 ? 1 : 0) | 0;
- xl = (bl >>> 28 | bh << 4) ^ (bl << 30 | bh >>> 2) ^ (bl << 25 | bh >>> 7) | 0;
- al = al + xl | 0;
- ah = ah + ((bh >>> 28 | bl << 4) ^ (bh << 30 | bl >>> 2) ^ (bh << 25 | bl >>> 7)) + (al >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- w13l = w13l + w6l | 0;
- w13h = w13h + w6h + (w13l >>> 0 < w6l >>> 0 ? 1 : 0) | 0;
- xl = (w14l >>> 1 | w14h << 31) ^ (w14l >>> 8 | w14h << 24) ^ (w14l >>> 7 | w14h << 25) | 0;
- w13l = w13l + xl | 0;
- w13h = w13h + ((w14h >>> 1 | w14l << 31) ^ (w14h >>> 8 | w14l << 24) ^ w14h >>> 7) + (w13l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = (w11l >>> 19 | w11h << 13) ^ (w11l << 3 | w11h >>> 29) ^ (w11l >>> 6 | w11h << 26) | 0;
- w13l = w13l + xl | 0;
- w13h = w13h + ((w11h >>> 19 | w11l << 13) ^ (w11h << 3 | w11l >>> 29) ^ w11h >>> 6) + (w13l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- tl = 3733110249 + w13l | 0;
- th = 2756734187 + w13h + (tl >>> 0 < w13l >>> 0 ? 1 : 0) | 0;
- tl = tl + hl | 0;
- th = th + hh + (tl >>> 0 < hl >>> 0 ? 1 : 0) | 0;
- xl = (el >>> 14 | eh << 18) ^ (el >>> 18 | eh << 14) ^ (el << 23 | eh >>> 9) | 0;
- tl = tl + xl | 0;
- th = th + ((eh >>> 14 | el << 18) ^ (eh >>> 18 | el << 14) ^ (eh << 23 | el >>> 9)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = gl ^ el & (fl ^ gl) | 0;
- tl = tl + xl | 0;
- th = th + (gh ^ eh & (fh ^ gh)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- hl = gl;
- hh = gh;
- gl = fl;
- gh = fh;
- fl = el;
- fh = eh;
- el = dl + tl | 0;
- eh = dh + th + (el >>> 0 < dl >>> 0 ? 1 : 0) | 0;
- dl = cl;
- dh = ch;
- cl = bl;
- ch = bh;
- bl = al;
- bh = ah;
- al = tl + (bl & cl ^ dl & (bl ^ cl)) | 0;
- ah = th + (bh & ch ^ dh & (bh ^ ch)) + (al >>> 0 < tl >>> 0 ? 1 : 0) | 0;
- xl = (bl >>> 28 | bh << 4) ^ (bl << 30 | bh >>> 2) ^ (bl << 25 | bh >>> 7) | 0;
- al = al + xl | 0;
- ah = ah + ((bh >>> 28 | bl << 4) ^ (bh << 30 | bl >>> 2) ^ (bh << 25 | bl >>> 7)) + (al >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- w14l = w14l + w7l | 0;
- w14h = w14h + w7h + (w14l >>> 0 < w7l >>> 0 ? 1 : 0) | 0;
- xl = (w15l >>> 1 | w15h << 31) ^ (w15l >>> 8 | w15h << 24) ^ (w15l >>> 7 | w15h << 25) | 0;
- w14l = w14l + xl | 0;
- w14h = w14h + ((w15h >>> 1 | w15l << 31) ^ (w15h >>> 8 | w15l << 24) ^ w15h >>> 7) + (w14l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = (w12l >>> 19 | w12h << 13) ^ (w12l << 3 | w12h >>> 29) ^ (w12l >>> 6 | w12h << 26) | 0;
- w14l = w14l + xl | 0;
- w14h = w14h + ((w12h >>> 19 | w12l << 13) ^ (w12h << 3 | w12l >>> 29) ^ w12h >>> 6) + (w14l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- tl = 2999351573 + w14l | 0;
- th = 3204031479 + w14h + (tl >>> 0 < w14l >>> 0 ? 1 : 0) | 0;
- tl = tl + hl | 0;
- th = th + hh + (tl >>> 0 < hl >>> 0 ? 1 : 0) | 0;
- xl = (el >>> 14 | eh << 18) ^ (el >>> 18 | eh << 14) ^ (el << 23 | eh >>> 9) | 0;
- tl = tl + xl | 0;
- th = th + ((eh >>> 14 | el << 18) ^ (eh >>> 18 | el << 14) ^ (eh << 23 | el >>> 9)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = gl ^ el & (fl ^ gl) | 0;
- tl = tl + xl | 0;
- th = th + (gh ^ eh & (fh ^ gh)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- hl = gl;
- hh = gh;
- gl = fl;
- gh = fh;
- fl = el;
- fh = eh;
- el = dl + tl | 0;
- eh = dh + th + (el >>> 0 < dl >>> 0 ? 1 : 0) | 0;
- dl = cl;
- dh = ch;
- cl = bl;
- ch = bh;
- bl = al;
- bh = ah;
- al = tl + (bl & cl ^ dl & (bl ^ cl)) | 0;
- ah = th + (bh & ch ^ dh & (bh ^ ch)) + (al >>> 0 < tl >>> 0 ? 1 : 0) | 0;
- xl = (bl >>> 28 | bh << 4) ^ (bl << 30 | bh >>> 2) ^ (bl << 25 | bh >>> 7) | 0;
- al = al + xl | 0;
- ah = ah + ((bh >>> 28 | bl << 4) ^ (bh << 30 | bl >>> 2) ^ (bh << 25 | bl >>> 7)) + (al >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- w15l = w15l + w8l | 0;
- w15h = w15h + w8h + (w15l >>> 0 < w8l >>> 0 ? 1 : 0) | 0;
- xl = (w0l >>> 1 | w0h << 31) ^ (w0l >>> 8 | w0h << 24) ^ (w0l >>> 7 | w0h << 25) | 0;
- w15l = w15l + xl | 0;
- w15h = w15h + ((w0h >>> 1 | w0l << 31) ^ (w0h >>> 8 | w0l << 24) ^ w0h >>> 7) + (w15l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = (w13l >>> 19 | w13h << 13) ^ (w13l << 3 | w13h >>> 29) ^ (w13l >>> 6 | w13h << 26) | 0;
- w15l = w15l + xl | 0;
- w15h = w15h + ((w13h >>> 19 | w13l << 13) ^ (w13h << 3 | w13l >>> 29) ^ w13h >>> 6) + (w15l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- tl = 3815920427 + w15l | 0;
- th = 3329325298 + w15h + (tl >>> 0 < w15l >>> 0 ? 1 : 0) | 0;
- tl = tl + hl | 0;
- th = th + hh + (tl >>> 0 < hl >>> 0 ? 1 : 0) | 0;
- xl = (el >>> 14 | eh << 18) ^ (el >>> 18 | eh << 14) ^ (el << 23 | eh >>> 9) | 0;
- tl = tl + xl | 0;
- th = th + ((eh >>> 14 | el << 18) ^ (eh >>> 18 | el << 14) ^ (eh << 23 | el >>> 9)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = gl ^ el & (fl ^ gl) | 0;
- tl = tl + xl | 0;
- th = th + (gh ^ eh & (fh ^ gh)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- hl = gl;
- hh = gh;
- gl = fl;
- gh = fh;
- fl = el;
- fh = eh;
- el = dl + tl | 0;
- eh = dh + th + (el >>> 0 < dl >>> 0 ? 1 : 0) | 0;
- dl = cl;
- dh = ch;
- cl = bl;
- ch = bh;
- bl = al;
- bh = ah;
- al = tl + (bl & cl ^ dl & (bl ^ cl)) | 0;
- ah = th + (bh & ch ^ dh & (bh ^ ch)) + (al >>> 0 < tl >>> 0 ? 1 : 0) | 0;
- xl = (bl >>> 28 | bh << 4) ^ (bl << 30 | bh >>> 2) ^ (bl << 25 | bh >>> 7) | 0;
- al = al + xl | 0;
- ah = ah + ((bh >>> 28 | bl << 4) ^ (bh << 30 | bl >>> 2) ^ (bh << 25 | bl >>> 7)) + (al >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- w0l = w0l + w9l | 0;
- w0h = w0h + w9h + (w0l >>> 0 < w9l >>> 0 ? 1 : 0) | 0;
- xl = (w1l >>> 1 | w1h << 31) ^ (w1l >>> 8 | w1h << 24) ^ (w1l >>> 7 | w1h << 25) | 0;
- w0l = w0l + xl | 0;
- w0h = w0h + ((w1h >>> 1 | w1l << 31) ^ (w1h >>> 8 | w1l << 24) ^ w1h >>> 7) + (w0l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = (w14l >>> 19 | w14h << 13) ^ (w14l << 3 | w14h >>> 29) ^ (w14l >>> 6 | w14h << 26) | 0;
- w0l = w0l + xl | 0;
- w0h = w0h + ((w14h >>> 19 | w14l << 13) ^ (w14h << 3 | w14l >>> 29) ^ w14h >>> 6) + (w0l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- tl = 3928383900 + w0l | 0;
- th = 3391569614 + w0h + (tl >>> 0 < w0l >>> 0 ? 1 : 0) | 0;
- tl = tl + hl | 0;
- th = th + hh + (tl >>> 0 < hl >>> 0 ? 1 : 0) | 0;
- xl = (el >>> 14 | eh << 18) ^ (el >>> 18 | eh << 14) ^ (el << 23 | eh >>> 9) | 0;
- tl = tl + xl | 0;
- th = th + ((eh >>> 14 | el << 18) ^ (eh >>> 18 | el << 14) ^ (eh << 23 | el >>> 9)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = gl ^ el & (fl ^ gl) | 0;
- tl = tl + xl | 0;
- th = th + (gh ^ eh & (fh ^ gh)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- hl = gl;
- hh = gh;
- gl = fl;
- gh = fh;
- fl = el;
- fh = eh;
- el = dl + tl | 0;
- eh = dh + th + (el >>> 0 < dl >>> 0 ? 1 : 0) | 0;
- dl = cl;
- dh = ch;
- cl = bl;
- ch = bh;
- bl = al;
- bh = ah;
- al = tl + (bl & cl ^ dl & (bl ^ cl)) | 0;
- ah = th + (bh & ch ^ dh & (bh ^ ch)) + (al >>> 0 < tl >>> 0 ? 1 : 0) | 0;
- xl = (bl >>> 28 | bh << 4) ^ (bl << 30 | bh >>> 2) ^ (bl << 25 | bh >>> 7) | 0;
- al = al + xl | 0;
- ah = ah + ((bh >>> 28 | bl << 4) ^ (bh << 30 | bl >>> 2) ^ (bh << 25 | bl >>> 7)) + (al >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- w1l = w1l + w10l | 0;
- w1h = w1h + w10h + (w1l >>> 0 < w10l >>> 0 ? 1 : 0) | 0;
- xl = (w2l >>> 1 | w2h << 31) ^ (w2l >>> 8 | w2h << 24) ^ (w2l >>> 7 | w2h << 25) | 0;
- w1l = w1l + xl | 0;
- w1h = w1h + ((w2h >>> 1 | w2l << 31) ^ (w2h >>> 8 | w2l << 24) ^ w2h >>> 7) + (w1l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = (w15l >>> 19 | w15h << 13) ^ (w15l << 3 | w15h >>> 29) ^ (w15l >>> 6 | w15h << 26) | 0;
- w1l = w1l + xl | 0;
- w1h = w1h + ((w15h >>> 19 | w15l << 13) ^ (w15h << 3 | w15l >>> 29) ^ w15h >>> 6) + (w1l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- tl = 566280711 + w1l | 0;
- th = 3515267271 + w1h + (tl >>> 0 < w1l >>> 0 ? 1 : 0) | 0;
- tl = tl + hl | 0;
- th = th + hh + (tl >>> 0 < hl >>> 0 ? 1 : 0) | 0;
- xl = (el >>> 14 | eh << 18) ^ (el >>> 18 | eh << 14) ^ (el << 23 | eh >>> 9) | 0;
- tl = tl + xl | 0;
- th = th + ((eh >>> 14 | el << 18) ^ (eh >>> 18 | el << 14) ^ (eh << 23 | el >>> 9)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = gl ^ el & (fl ^ gl) | 0;
- tl = tl + xl | 0;
- th = th + (gh ^ eh & (fh ^ gh)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- hl = gl;
- hh = gh;
- gl = fl;
- gh = fh;
- fl = el;
- fh = eh;
- el = dl + tl | 0;
- eh = dh + th + (el >>> 0 < dl >>> 0 ? 1 : 0) | 0;
- dl = cl;
- dh = ch;
- cl = bl;
- ch = bh;
- bl = al;
- bh = ah;
- al = tl + (bl & cl ^ dl & (bl ^ cl)) | 0;
- ah = th + (bh & ch ^ dh & (bh ^ ch)) + (al >>> 0 < tl >>> 0 ? 1 : 0) | 0;
- xl = (bl >>> 28 | bh << 4) ^ (bl << 30 | bh >>> 2) ^ (bl << 25 | bh >>> 7) | 0;
- al = al + xl | 0;
- ah = ah + ((bh >>> 28 | bl << 4) ^ (bh << 30 | bl >>> 2) ^ (bh << 25 | bl >>> 7)) + (al >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- w2l = w2l + w11l | 0;
- w2h = w2h + w11h + (w2l >>> 0 < w11l >>> 0 ? 1 : 0) | 0;
- xl = (w3l >>> 1 | w3h << 31) ^ (w3l >>> 8 | w3h << 24) ^ (w3l >>> 7 | w3h << 25) | 0;
- w2l = w2l + xl | 0;
- w2h = w2h + ((w3h >>> 1 | w3l << 31) ^ (w3h >>> 8 | w3l << 24) ^ w3h >>> 7) + (w2l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = (w0l >>> 19 | w0h << 13) ^ (w0l << 3 | w0h >>> 29) ^ (w0l >>> 6 | w0h << 26) | 0;
- w2l = w2l + xl | 0;
- w2h = w2h + ((w0h >>> 19 | w0l << 13) ^ (w0h << 3 | w0l >>> 29) ^ w0h >>> 6) + (w2l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- tl = 3454069534 + w2l | 0;
- th = 3940187606 + w2h + (tl >>> 0 < w2l >>> 0 ? 1 : 0) | 0;
- tl = tl + hl | 0;
- th = th + hh + (tl >>> 0 < hl >>> 0 ? 1 : 0) | 0;
- xl = (el >>> 14 | eh << 18) ^ (el >>> 18 | eh << 14) ^ (el << 23 | eh >>> 9) | 0;
- tl = tl + xl | 0;
- th = th + ((eh >>> 14 | el << 18) ^ (eh >>> 18 | el << 14) ^ (eh << 23 | el >>> 9)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = gl ^ el & (fl ^ gl) | 0;
- tl = tl + xl | 0;
- th = th + (gh ^ eh & (fh ^ gh)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- hl = gl;
- hh = gh;
- gl = fl;
- gh = fh;
- fl = el;
- fh = eh;
- el = dl + tl | 0;
- eh = dh + th + (el >>> 0 < dl >>> 0 ? 1 : 0) | 0;
- dl = cl;
- dh = ch;
- cl = bl;
- ch = bh;
- bl = al;
- bh = ah;
- al = tl + (bl & cl ^ dl & (bl ^ cl)) | 0;
- ah = th + (bh & ch ^ dh & (bh ^ ch)) + (al >>> 0 < tl >>> 0 ? 1 : 0) | 0;
- xl = (bl >>> 28 | bh << 4) ^ (bl << 30 | bh >>> 2) ^ (bl << 25 | bh >>> 7) | 0;
- al = al + xl | 0;
- ah = ah + ((bh >>> 28 | bl << 4) ^ (bh << 30 | bl >>> 2) ^ (bh << 25 | bl >>> 7)) + (al >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- w3l = w3l + w12l | 0;
- w3h = w3h + w12h + (w3l >>> 0 < w12l >>> 0 ? 1 : 0) | 0;
- xl = (w4l >>> 1 | w4h << 31) ^ (w4l >>> 8 | w4h << 24) ^ (w4l >>> 7 | w4h << 25) | 0;
- w3l = w3l + xl | 0;
- w3h = w3h + ((w4h >>> 1 | w4l << 31) ^ (w4h >>> 8 | w4l << 24) ^ w4h >>> 7) + (w3l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = (w1l >>> 19 | w1h << 13) ^ (w1l << 3 | w1h >>> 29) ^ (w1l >>> 6 | w1h << 26) | 0;
- w3l = w3l + xl | 0;
- w3h = w3h + ((w1h >>> 19 | w1l << 13) ^ (w1h << 3 | w1l >>> 29) ^ w1h >>> 6) + (w3l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- tl = 4000239992 + w3l | 0;
- th = 4118630271 + w3h + (tl >>> 0 < w3l >>> 0 ? 1 : 0) | 0;
- tl = tl + hl | 0;
- th = th + hh + (tl >>> 0 < hl >>> 0 ? 1 : 0) | 0;
- xl = (el >>> 14 | eh << 18) ^ (el >>> 18 | eh << 14) ^ (el << 23 | eh >>> 9) | 0;
- tl = tl + xl | 0;
- th = th + ((eh >>> 14 | el << 18) ^ (eh >>> 18 | el << 14) ^ (eh << 23 | el >>> 9)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = gl ^ el & (fl ^ gl) | 0;
- tl = tl + xl | 0;
- th = th + (gh ^ eh & (fh ^ gh)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- hl = gl;
- hh = gh;
- gl = fl;
- gh = fh;
- fl = el;
- fh = eh;
- el = dl + tl | 0;
- eh = dh + th + (el >>> 0 < dl >>> 0 ? 1 : 0) | 0;
- dl = cl;
- dh = ch;
- cl = bl;
- ch = bh;
- bl = al;
- bh = ah;
- al = tl + (bl & cl ^ dl & (bl ^ cl)) | 0;
- ah = th + (bh & ch ^ dh & (bh ^ ch)) + (al >>> 0 < tl >>> 0 ? 1 : 0) | 0;
- xl = (bl >>> 28 | bh << 4) ^ (bl << 30 | bh >>> 2) ^ (bl << 25 | bh >>> 7) | 0;
- al = al + xl | 0;
- ah = ah + ((bh >>> 28 | bl << 4) ^ (bh << 30 | bl >>> 2) ^ (bh << 25 | bl >>> 7)) + (al >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- w4l = w4l + w13l | 0;
- w4h = w4h + w13h + (w4l >>> 0 < w13l >>> 0 ? 1 : 0) | 0;
- xl = (w5l >>> 1 | w5h << 31) ^ (w5l >>> 8 | w5h << 24) ^ (w5l >>> 7 | w5h << 25) | 0;
- w4l = w4l + xl | 0;
- w4h = w4h + ((w5h >>> 1 | w5l << 31) ^ (w5h >>> 8 | w5l << 24) ^ w5h >>> 7) + (w4l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = (w2l >>> 19 | w2h << 13) ^ (w2l << 3 | w2h >>> 29) ^ (w2l >>> 6 | w2h << 26) | 0;
- w4l = w4l + xl | 0;
- w4h = w4h + ((w2h >>> 19 | w2l << 13) ^ (w2h << 3 | w2l >>> 29) ^ w2h >>> 6) + (w4l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- tl = 1914138554 + w4l | 0;
- th = 116418474 + w4h + (tl >>> 0 < w4l >>> 0 ? 1 : 0) | 0;
- tl = tl + hl | 0;
- th = th + hh + (tl >>> 0 < hl >>> 0 ? 1 : 0) | 0;
- xl = (el >>> 14 | eh << 18) ^ (el >>> 18 | eh << 14) ^ (el << 23 | eh >>> 9) | 0;
- tl = tl + xl | 0;
- th = th + ((eh >>> 14 | el << 18) ^ (eh >>> 18 | el << 14) ^ (eh << 23 | el >>> 9)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = gl ^ el & (fl ^ gl) | 0;
- tl = tl + xl | 0;
- th = th + (gh ^ eh & (fh ^ gh)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- hl = gl;
- hh = gh;
- gl = fl;
- gh = fh;
- fl = el;
- fh = eh;
- el = dl + tl | 0;
- eh = dh + th + (el >>> 0 < dl >>> 0 ? 1 : 0) | 0;
- dl = cl;
- dh = ch;
- cl = bl;
- ch = bh;
- bl = al;
- bh = ah;
- al = tl + (bl & cl ^ dl & (bl ^ cl)) | 0;
- ah = th + (bh & ch ^ dh & (bh ^ ch)) + (al >>> 0 < tl >>> 0 ? 1 : 0) | 0;
- xl = (bl >>> 28 | bh << 4) ^ (bl << 30 | bh >>> 2) ^ (bl << 25 | bh >>> 7) | 0;
- al = al + xl | 0;
- ah = ah + ((bh >>> 28 | bl << 4) ^ (bh << 30 | bl >>> 2) ^ (bh << 25 | bl >>> 7)) + (al >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- w5l = w5l + w14l | 0;
- w5h = w5h + w14h + (w5l >>> 0 < w14l >>> 0 ? 1 : 0) | 0;
- xl = (w6l >>> 1 | w6h << 31) ^ (w6l >>> 8 | w6h << 24) ^ (w6l >>> 7 | w6h << 25) | 0;
- w5l = w5l + xl | 0;
- w5h = w5h + ((w6h >>> 1 | w6l << 31) ^ (w6h >>> 8 | w6l << 24) ^ w6h >>> 7) + (w5l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = (w3l >>> 19 | w3h << 13) ^ (w3l << 3 | w3h >>> 29) ^ (w3l >>> 6 | w3h << 26) | 0;
- w5l = w5l + xl | 0;
- w5h = w5h + ((w3h >>> 19 | w3l << 13) ^ (w3h << 3 | w3l >>> 29) ^ w3h >>> 6) + (w5l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- tl = 2731055270 + w5l | 0;
- th = 174292421 + w5h + (tl >>> 0 < w5l >>> 0 ? 1 : 0) | 0;
- tl = tl + hl | 0;
- th = th + hh + (tl >>> 0 < hl >>> 0 ? 1 : 0) | 0;
- xl = (el >>> 14 | eh << 18) ^ (el >>> 18 | eh << 14) ^ (el << 23 | eh >>> 9) | 0;
- tl = tl + xl | 0;
- th = th + ((eh >>> 14 | el << 18) ^ (eh >>> 18 | el << 14) ^ (eh << 23 | el >>> 9)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = gl ^ el & (fl ^ gl) | 0;
- tl = tl + xl | 0;
- th = th + (gh ^ eh & (fh ^ gh)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- hl = gl;
- hh = gh;
- gl = fl;
- gh = fh;
- fl = el;
- fh = eh;
- el = dl + tl | 0;
- eh = dh + th + (el >>> 0 < dl >>> 0 ? 1 : 0) | 0;
- dl = cl;
- dh = ch;
- cl = bl;
- ch = bh;
- bl = al;
- bh = ah;
- al = tl + (bl & cl ^ dl & (bl ^ cl)) | 0;
- ah = th + (bh & ch ^ dh & (bh ^ ch)) + (al >>> 0 < tl >>> 0 ? 1 : 0) | 0;
- xl = (bl >>> 28 | bh << 4) ^ (bl << 30 | bh >>> 2) ^ (bl << 25 | bh >>> 7) | 0;
- al = al + xl | 0;
- ah = ah + ((bh >>> 28 | bl << 4) ^ (bh << 30 | bl >>> 2) ^ (bh << 25 | bl >>> 7)) + (al >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- w6l = w6l + w15l | 0;
- w6h = w6h + w15h + (w6l >>> 0 < w15l >>> 0 ? 1 : 0) | 0;
- xl = (w7l >>> 1 | w7h << 31) ^ (w7l >>> 8 | w7h << 24) ^ (w7l >>> 7 | w7h << 25) | 0;
- w6l = w6l + xl | 0;
- w6h = w6h + ((w7h >>> 1 | w7l << 31) ^ (w7h >>> 8 | w7l << 24) ^ w7h >>> 7) + (w6l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = (w4l >>> 19 | w4h << 13) ^ (w4l << 3 | w4h >>> 29) ^ (w4l >>> 6 | w4h << 26) | 0;
- w6l = w6l + xl | 0;
- w6h = w6h + ((w4h >>> 19 | w4l << 13) ^ (w4h << 3 | w4l >>> 29) ^ w4h >>> 6) + (w6l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- tl = 3203993006 + w6l | 0;
- th = 289380356 + w6h + (tl >>> 0 < w6l >>> 0 ? 1 : 0) | 0;
- tl = tl + hl | 0;
- th = th + hh + (tl >>> 0 < hl >>> 0 ? 1 : 0) | 0;
- xl = (el >>> 14 | eh << 18) ^ (el >>> 18 | eh << 14) ^ (el << 23 | eh >>> 9) | 0;
- tl = tl + xl | 0;
- th = th + ((eh >>> 14 | el << 18) ^ (eh >>> 18 | el << 14) ^ (eh << 23 | el >>> 9)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = gl ^ el & (fl ^ gl) | 0;
- tl = tl + xl | 0;
- th = th + (gh ^ eh & (fh ^ gh)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- hl = gl;
- hh = gh;
- gl = fl;
- gh = fh;
- fl = el;
- fh = eh;
- el = dl + tl | 0;
- eh = dh + th + (el >>> 0 < dl >>> 0 ? 1 : 0) | 0;
- dl = cl;
- dh = ch;
- cl = bl;
- ch = bh;
- bl = al;
- bh = ah;
- al = tl + (bl & cl ^ dl & (bl ^ cl)) | 0;
- ah = th + (bh & ch ^ dh & (bh ^ ch)) + (al >>> 0 < tl >>> 0 ? 1 : 0) | 0;
- xl = (bl >>> 28 | bh << 4) ^ (bl << 30 | bh >>> 2) ^ (bl << 25 | bh >>> 7) | 0;
- al = al + xl | 0;
- ah = ah + ((bh >>> 28 | bl << 4) ^ (bh << 30 | bl >>> 2) ^ (bh << 25 | bl >>> 7)) + (al >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- w7l = w7l + w0l | 0;
- w7h = w7h + w0h + (w7l >>> 0 < w0l >>> 0 ? 1 : 0) | 0;
- xl = (w8l >>> 1 | w8h << 31) ^ (w8l >>> 8 | w8h << 24) ^ (w8l >>> 7 | w8h << 25) | 0;
- w7l = w7l + xl | 0;
- w7h = w7h + ((w8h >>> 1 | w8l << 31) ^ (w8h >>> 8 | w8l << 24) ^ w8h >>> 7) + (w7l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = (w5l >>> 19 | w5h << 13) ^ (w5l << 3 | w5h >>> 29) ^ (w5l >>> 6 | w5h << 26) | 0;
- w7l = w7l + xl | 0;
- w7h = w7h + ((w5h >>> 19 | w5l << 13) ^ (w5h << 3 | w5l >>> 29) ^ w5h >>> 6) + (w7l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- tl = 320620315 + w7l | 0;
- th = 460393269 + w7h + (tl >>> 0 < w7l >>> 0 ? 1 : 0) | 0;
- tl = tl + hl | 0;
- th = th + hh + (tl >>> 0 < hl >>> 0 ? 1 : 0) | 0;
- xl = (el >>> 14 | eh << 18) ^ (el >>> 18 | eh << 14) ^ (el << 23 | eh >>> 9) | 0;
- tl = tl + xl | 0;
- th = th + ((eh >>> 14 | el << 18) ^ (eh >>> 18 | el << 14) ^ (eh << 23 | el >>> 9)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = gl ^ el & (fl ^ gl) | 0;
- tl = tl + xl | 0;
- th = th + (gh ^ eh & (fh ^ gh)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- hl = gl;
- hh = gh;
- gl = fl;
- gh = fh;
- fl = el;
- fh = eh;
- el = dl + tl | 0;
- eh = dh + th + (el >>> 0 < dl >>> 0 ? 1 : 0) | 0;
- dl = cl;
- dh = ch;
- cl = bl;
- ch = bh;
- bl = al;
- bh = ah;
- al = tl + (bl & cl ^ dl & (bl ^ cl)) | 0;
- ah = th + (bh & ch ^ dh & (bh ^ ch)) + (al >>> 0 < tl >>> 0 ? 1 : 0) | 0;
- xl = (bl >>> 28 | bh << 4) ^ (bl << 30 | bh >>> 2) ^ (bl << 25 | bh >>> 7) | 0;
- al = al + xl | 0;
- ah = ah + ((bh >>> 28 | bl << 4) ^ (bh << 30 | bl >>> 2) ^ (bh << 25 | bl >>> 7)) + (al >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- w8l = w8l + w1l | 0;
- w8h = w8h + w1h + (w8l >>> 0 < w1l >>> 0 ? 1 : 0) | 0;
- xl = (w9l >>> 1 | w9h << 31) ^ (w9l >>> 8 | w9h << 24) ^ (w9l >>> 7 | w9h << 25) | 0;
- w8l = w8l + xl | 0;
- w8h = w8h + ((w9h >>> 1 | w9l << 31) ^ (w9h >>> 8 | w9l << 24) ^ w9h >>> 7) + (w8l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = (w6l >>> 19 | w6h << 13) ^ (w6l << 3 | w6h >>> 29) ^ (w6l >>> 6 | w6h << 26) | 0;
- w8l = w8l + xl | 0;
- w8h = w8h + ((w6h >>> 19 | w6l << 13) ^ (w6h << 3 | w6l >>> 29) ^ w6h >>> 6) + (w8l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- tl = 587496836 + w8l | 0;
- th = 685471733 + w8h + (tl >>> 0 < w8l >>> 0 ? 1 : 0) | 0;
- tl = tl + hl | 0;
- th = th + hh + (tl >>> 0 < hl >>> 0 ? 1 : 0) | 0;
- xl = (el >>> 14 | eh << 18) ^ (el >>> 18 | eh << 14) ^ (el << 23 | eh >>> 9) | 0;
- tl = tl + xl | 0;
- th = th + ((eh >>> 14 | el << 18) ^ (eh >>> 18 | el << 14) ^ (eh << 23 | el >>> 9)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = gl ^ el & (fl ^ gl) | 0;
- tl = tl + xl | 0;
- th = th + (gh ^ eh & (fh ^ gh)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- hl = gl;
- hh = gh;
- gl = fl;
- gh = fh;
- fl = el;
- fh = eh;
- el = dl + tl | 0;
- eh = dh + th + (el >>> 0 < dl >>> 0 ? 1 : 0) | 0;
- dl = cl;
- dh = ch;
- cl = bl;
- ch = bh;
- bl = al;
- bh = ah;
- al = tl + (bl & cl ^ dl & (bl ^ cl)) | 0;
- ah = th + (bh & ch ^ dh & (bh ^ ch)) + (al >>> 0 < tl >>> 0 ? 1 : 0) | 0;
- xl = (bl >>> 28 | bh << 4) ^ (bl << 30 | bh >>> 2) ^ (bl << 25 | bh >>> 7) | 0;
- al = al + xl | 0;
- ah = ah + ((bh >>> 28 | bl << 4) ^ (bh << 30 | bl >>> 2) ^ (bh << 25 | bl >>> 7)) + (al >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- w9l = w9l + w2l | 0;
- w9h = w9h + w2h + (w9l >>> 0 < w2l >>> 0 ? 1 : 0) | 0;
- xl = (w10l >>> 1 | w10h << 31) ^ (w10l >>> 8 | w10h << 24) ^ (w10l >>> 7 | w10h << 25) | 0;
- w9l = w9l + xl | 0;
- w9h = w9h + ((w10h >>> 1 | w10l << 31) ^ (w10h >>> 8 | w10l << 24) ^ w10h >>> 7) + (w9l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = (w7l >>> 19 | w7h << 13) ^ (w7l << 3 | w7h >>> 29) ^ (w7l >>> 6 | w7h << 26) | 0;
- w9l = w9l + xl | 0;
- w9h = w9h + ((w7h >>> 19 | w7l << 13) ^ (w7h << 3 | w7l >>> 29) ^ w7h >>> 6) + (w9l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- tl = 1086792851 + w9l | 0;
- th = 852142971 + w9h + (tl >>> 0 < w9l >>> 0 ? 1 : 0) | 0;
- tl = tl + hl | 0;
- th = th + hh + (tl >>> 0 < hl >>> 0 ? 1 : 0) | 0;
- xl = (el >>> 14 | eh << 18) ^ (el >>> 18 | eh << 14) ^ (el << 23 | eh >>> 9) | 0;
- tl = tl + xl | 0;
- th = th + ((eh >>> 14 | el << 18) ^ (eh >>> 18 | el << 14) ^ (eh << 23 | el >>> 9)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = gl ^ el & (fl ^ gl) | 0;
- tl = tl + xl | 0;
- th = th + (gh ^ eh & (fh ^ gh)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- hl = gl;
- hh = gh;
- gl = fl;
- gh = fh;
- fl = el;
- fh = eh;
- el = dl + tl | 0;
- eh = dh + th + (el >>> 0 < dl >>> 0 ? 1 : 0) | 0;
- dl = cl;
- dh = ch;
- cl = bl;
- ch = bh;
- bl = al;
- bh = ah;
- al = tl + (bl & cl ^ dl & (bl ^ cl)) | 0;
- ah = th + (bh & ch ^ dh & (bh ^ ch)) + (al >>> 0 < tl >>> 0 ? 1 : 0) | 0;
- xl = (bl >>> 28 | bh << 4) ^ (bl << 30 | bh >>> 2) ^ (bl << 25 | bh >>> 7) | 0;
- al = al + xl | 0;
- ah = ah + ((bh >>> 28 | bl << 4) ^ (bh << 30 | bl >>> 2) ^ (bh << 25 | bl >>> 7)) + (al >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- w10l = w10l + w3l | 0;
- w10h = w10h + w3h + (w10l >>> 0 < w3l >>> 0 ? 1 : 0) | 0;
- xl = (w11l >>> 1 | w11h << 31) ^ (w11l >>> 8 | w11h << 24) ^ (w11l >>> 7 | w11h << 25) | 0;
- w10l = w10l + xl | 0;
- w10h = w10h + ((w11h >>> 1 | w11l << 31) ^ (w11h >>> 8 | w11l << 24) ^ w11h >>> 7) + (w10l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = (w8l >>> 19 | w8h << 13) ^ (w8l << 3 | w8h >>> 29) ^ (w8l >>> 6 | w8h << 26) | 0;
- w10l = w10l + xl | 0;
- w10h = w10h + ((w8h >>> 19 | w8l << 13) ^ (w8h << 3 | w8l >>> 29) ^ w8h >>> 6) + (w10l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- tl = 365543100 + w10l | 0;
- th = 1017036298 + w10h + (tl >>> 0 < w10l >>> 0 ? 1 : 0) | 0;
- tl = tl + hl | 0;
- th = th + hh + (tl >>> 0 < hl >>> 0 ? 1 : 0) | 0;
- xl = (el >>> 14 | eh << 18) ^ (el >>> 18 | eh << 14) ^ (el << 23 | eh >>> 9) | 0;
- tl = tl + xl | 0;
- th = th + ((eh >>> 14 | el << 18) ^ (eh >>> 18 | el << 14) ^ (eh << 23 | el >>> 9)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = gl ^ el & (fl ^ gl) | 0;
- tl = tl + xl | 0;
- th = th + (gh ^ eh & (fh ^ gh)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- hl = gl;
- hh = gh;
- gl = fl;
- gh = fh;
- fl = el;
- fh = eh;
- el = dl + tl | 0;
- eh = dh + th + (el >>> 0 < dl >>> 0 ? 1 : 0) | 0;
- dl = cl;
- dh = ch;
- cl = bl;
- ch = bh;
- bl = al;
- bh = ah;
- al = tl + (bl & cl ^ dl & (bl ^ cl)) | 0;
- ah = th + (bh & ch ^ dh & (bh ^ ch)) + (al >>> 0 < tl >>> 0 ? 1 : 0) | 0;
- xl = (bl >>> 28 | bh << 4) ^ (bl << 30 | bh >>> 2) ^ (bl << 25 | bh >>> 7) | 0;
- al = al + xl | 0;
- ah = ah + ((bh >>> 28 | bl << 4) ^ (bh << 30 | bl >>> 2) ^ (bh << 25 | bl >>> 7)) + (al >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- w11l = w11l + w4l | 0;
- w11h = w11h + w4h + (w11l >>> 0 < w4l >>> 0 ? 1 : 0) | 0;
- xl = (w12l >>> 1 | w12h << 31) ^ (w12l >>> 8 | w12h << 24) ^ (w12l >>> 7 | w12h << 25) | 0;
- w11l = w11l + xl | 0;
- w11h = w11h + ((w12h >>> 1 | w12l << 31) ^ (w12h >>> 8 | w12l << 24) ^ w12h >>> 7) + (w11l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = (w9l >>> 19 | w9h << 13) ^ (w9l << 3 | w9h >>> 29) ^ (w9l >>> 6 | w9h << 26) | 0;
- w11l = w11l + xl | 0;
- w11h = w11h + ((w9h >>> 19 | w9l << 13) ^ (w9h << 3 | w9l >>> 29) ^ w9h >>> 6) + (w11l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- tl = 2618297676 + w11l | 0;
- th = 1126000580 + w11h + (tl >>> 0 < w11l >>> 0 ? 1 : 0) | 0;
- tl = tl + hl | 0;
- th = th + hh + (tl >>> 0 < hl >>> 0 ? 1 : 0) | 0;
- xl = (el >>> 14 | eh << 18) ^ (el >>> 18 | eh << 14) ^ (el << 23 | eh >>> 9) | 0;
- tl = tl + xl | 0;
- th = th + ((eh >>> 14 | el << 18) ^ (eh >>> 18 | el << 14) ^ (eh << 23 | el >>> 9)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = gl ^ el & (fl ^ gl) | 0;
- tl = tl + xl | 0;
- th = th + (gh ^ eh & (fh ^ gh)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- hl = gl;
- hh = gh;
- gl = fl;
- gh = fh;
- fl = el;
- fh = eh;
- el = dl + tl | 0;
- eh = dh + th + (el >>> 0 < dl >>> 0 ? 1 : 0) | 0;
- dl = cl;
- dh = ch;
- cl = bl;
- ch = bh;
- bl = al;
- bh = ah;
- al = tl + (bl & cl ^ dl & (bl ^ cl)) | 0;
- ah = th + (bh & ch ^ dh & (bh ^ ch)) + (al >>> 0 < tl >>> 0 ? 1 : 0) | 0;
- xl = (bl >>> 28 | bh << 4) ^ (bl << 30 | bh >>> 2) ^ (bl << 25 | bh >>> 7) | 0;
- al = al + xl | 0;
- ah = ah + ((bh >>> 28 | bl << 4) ^ (bh << 30 | bl >>> 2) ^ (bh << 25 | bl >>> 7)) + (al >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- w12l = w12l + w5l | 0;
- w12h = w12h + w5h + (w12l >>> 0 < w5l >>> 0 ? 1 : 0) | 0;
- xl = (w13l >>> 1 | w13h << 31) ^ (w13l >>> 8 | w13h << 24) ^ (w13l >>> 7 | w13h << 25) | 0;
- w12l = w12l + xl | 0;
- w12h = w12h + ((w13h >>> 1 | w13l << 31) ^ (w13h >>> 8 | w13l << 24) ^ w13h >>> 7) + (w12l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = (w10l >>> 19 | w10h << 13) ^ (w10l << 3 | w10h >>> 29) ^ (w10l >>> 6 | w10h << 26) | 0;
- w12l = w12l + xl | 0;
- w12h = w12h + ((w10h >>> 19 | w10l << 13) ^ (w10h << 3 | w10l >>> 29) ^ w10h >>> 6) + (w12l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- tl = 3409855158 + w12l | 0;
- th = 1288033470 + w12h + (tl >>> 0 < w12l >>> 0 ? 1 : 0) | 0;
- tl = tl + hl | 0;
- th = th + hh + (tl >>> 0 < hl >>> 0 ? 1 : 0) | 0;
- xl = (el >>> 14 | eh << 18) ^ (el >>> 18 | eh << 14) ^ (el << 23 | eh >>> 9) | 0;
- tl = tl + xl | 0;
- th = th + ((eh >>> 14 | el << 18) ^ (eh >>> 18 | el << 14) ^ (eh << 23 | el >>> 9)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = gl ^ el & (fl ^ gl) | 0;
- tl = tl + xl | 0;
- th = th + (gh ^ eh & (fh ^ gh)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- hl = gl;
- hh = gh;
- gl = fl;
- gh = fh;
- fl = el;
- fh = eh;
- el = dl + tl | 0;
- eh = dh + th + (el >>> 0 < dl >>> 0 ? 1 : 0) | 0;
- dl = cl;
- dh = ch;
- cl = bl;
- ch = bh;
- bl = al;
- bh = ah;
- al = tl + (bl & cl ^ dl & (bl ^ cl)) | 0;
- ah = th + (bh & ch ^ dh & (bh ^ ch)) + (al >>> 0 < tl >>> 0 ? 1 : 0) | 0;
- xl = (bl >>> 28 | bh << 4) ^ (bl << 30 | bh >>> 2) ^ (bl << 25 | bh >>> 7) | 0;
- al = al + xl | 0;
- ah = ah + ((bh >>> 28 | bl << 4) ^ (bh << 30 | bl >>> 2) ^ (bh << 25 | bl >>> 7)) + (al >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- w13l = w13l + w6l | 0;
- w13h = w13h + w6h + (w13l >>> 0 < w6l >>> 0 ? 1 : 0) | 0;
- xl = (w14l >>> 1 | w14h << 31) ^ (w14l >>> 8 | w14h << 24) ^ (w14l >>> 7 | w14h << 25) | 0;
- w13l = w13l + xl | 0;
- w13h = w13h + ((w14h >>> 1 | w14l << 31) ^ (w14h >>> 8 | w14l << 24) ^ w14h >>> 7) + (w13l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = (w11l >>> 19 | w11h << 13) ^ (w11l << 3 | w11h >>> 29) ^ (w11l >>> 6 | w11h << 26) | 0;
- w13l = w13l + xl | 0;
- w13h = w13h + ((w11h >>> 19 | w11l << 13) ^ (w11h << 3 | w11l >>> 29) ^ w11h >>> 6) + (w13l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- tl = 4234509866 + w13l | 0;
- th = 1501505948 + w13h + (tl >>> 0 < w13l >>> 0 ? 1 : 0) | 0;
- tl = tl + hl | 0;
- th = th + hh + (tl >>> 0 < hl >>> 0 ? 1 : 0) | 0;
- xl = (el >>> 14 | eh << 18) ^ (el >>> 18 | eh << 14) ^ (el << 23 | eh >>> 9) | 0;
- tl = tl + xl | 0;
- th = th + ((eh >>> 14 | el << 18) ^ (eh >>> 18 | el << 14) ^ (eh << 23 | el >>> 9)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = gl ^ el & (fl ^ gl) | 0;
- tl = tl + xl | 0;
- th = th + (gh ^ eh & (fh ^ gh)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- hl = gl;
- hh = gh;
- gl = fl;
- gh = fh;
- fl = el;
- fh = eh;
- el = dl + tl | 0;
- eh = dh + th + (el >>> 0 < dl >>> 0 ? 1 : 0) | 0;
- dl = cl;
- dh = ch;
- cl = bl;
- ch = bh;
- bl = al;
- bh = ah;
- al = tl + (bl & cl ^ dl & (bl ^ cl)) | 0;
- ah = th + (bh & ch ^ dh & (bh ^ ch)) + (al >>> 0 < tl >>> 0 ? 1 : 0) | 0;
- xl = (bl >>> 28 | bh << 4) ^ (bl << 30 | bh >>> 2) ^ (bl << 25 | bh >>> 7) | 0;
- al = al + xl | 0;
- ah = ah + ((bh >>> 28 | bl << 4) ^ (bh << 30 | bl >>> 2) ^ (bh << 25 | bl >>> 7)) + (al >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- w14l = w14l + w7l | 0;
- w14h = w14h + w7h + (w14l >>> 0 < w7l >>> 0 ? 1 : 0) | 0;
- xl = (w15l >>> 1 | w15h << 31) ^ (w15l >>> 8 | w15h << 24) ^ (w15l >>> 7 | w15h << 25) | 0;
- w14l = w14l + xl | 0;
- w14h = w14h + ((w15h >>> 1 | w15l << 31) ^ (w15h >>> 8 | w15l << 24) ^ w15h >>> 7) + (w14l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = (w12l >>> 19 | w12h << 13) ^ (w12l << 3 | w12h >>> 29) ^ (w12l >>> 6 | w12h << 26) | 0;
- w14l = w14l + xl | 0;
- w14h = w14h + ((w12h >>> 19 | w12l << 13) ^ (w12h << 3 | w12l >>> 29) ^ w12h >>> 6) + (w14l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- tl = 987167468 + w14l | 0;
- th = 1607167915 + w14h + (tl >>> 0 < w14l >>> 0 ? 1 : 0) | 0;
- tl = tl + hl | 0;
- th = th + hh + (tl >>> 0 < hl >>> 0 ? 1 : 0) | 0;
- xl = (el >>> 14 | eh << 18) ^ (el >>> 18 | eh << 14) ^ (el << 23 | eh >>> 9) | 0;
- tl = tl + xl | 0;
- th = th + ((eh >>> 14 | el << 18) ^ (eh >>> 18 | el << 14) ^ (eh << 23 | el >>> 9)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = gl ^ el & (fl ^ gl) | 0;
- tl = tl + xl | 0;
- th = th + (gh ^ eh & (fh ^ gh)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- hl = gl;
- hh = gh;
- gl = fl;
- gh = fh;
- fl = el;
- fh = eh;
- el = dl + tl | 0;
- eh = dh + th + (el >>> 0 < dl >>> 0 ? 1 : 0) | 0;
- dl = cl;
- dh = ch;
- cl = bl;
- ch = bh;
- bl = al;
- bh = ah;
- al = tl + (bl & cl ^ dl & (bl ^ cl)) | 0;
- ah = th + (bh & ch ^ dh & (bh ^ ch)) + (al >>> 0 < tl >>> 0 ? 1 : 0) | 0;
- xl = (bl >>> 28 | bh << 4) ^ (bl << 30 | bh >>> 2) ^ (bl << 25 | bh >>> 7) | 0;
- al = al + xl | 0;
- ah = ah + ((bh >>> 28 | bl << 4) ^ (bh << 30 | bl >>> 2) ^ (bh << 25 | bl >>> 7)) + (al >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- w15l = w15l + w8l | 0;
- w15h = w15h + w8h + (w15l >>> 0 < w8l >>> 0 ? 1 : 0) | 0;
- xl = (w0l >>> 1 | w0h << 31) ^ (w0l >>> 8 | w0h << 24) ^ (w0l >>> 7 | w0h << 25) | 0;
- w15l = w15l + xl | 0;
- w15h = w15h + ((w0h >>> 1 | w0l << 31) ^ (w0h >>> 8 | w0l << 24) ^ w0h >>> 7) + (w15l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = (w13l >>> 19 | w13h << 13) ^ (w13l << 3 | w13h >>> 29) ^ (w13l >>> 6 | w13h << 26) | 0;
- w15l = w15l + xl | 0;
- w15h = w15h + ((w13h >>> 19 | w13l << 13) ^ (w13h << 3 | w13l >>> 29) ^ w13h >>> 6) + (w15l >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- tl = 1246189591 + w15l | 0;
- th = 1816402316 + w15h + (tl >>> 0 < w15l >>> 0 ? 1 : 0) | 0;
- tl = tl + hl | 0;
- th = th + hh + (tl >>> 0 < hl >>> 0 ? 1 : 0) | 0;
- xl = (el >>> 14 | eh << 18) ^ (el >>> 18 | eh << 14) ^ (el << 23 | eh >>> 9) | 0;
- tl = tl + xl | 0;
- th = th + ((eh >>> 14 | el << 18) ^ (eh >>> 18 | el << 14) ^ (eh << 23 | el >>> 9)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- xl = gl ^ el & (fl ^ gl) | 0;
- tl = tl + xl | 0;
- th = th + (gh ^ eh & (fh ^ gh)) + (tl >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- hl = gl;
- hh = gh;
- gl = fl;
- gh = fh;
- fl = el;
- fh = eh;
- el = dl + tl | 0;
- eh = dh + th + (el >>> 0 < dl >>> 0 ? 1 : 0) | 0;
- dl = cl;
- dh = ch;
- cl = bl;
- ch = bh;
- bl = al;
- bh = ah;
- al = tl + (bl & cl ^ dl & (bl ^ cl)) | 0;
- ah = th + (bh & ch ^ dh & (bh ^ ch)) + (al >>> 0 < tl >>> 0 ? 1 : 0) | 0;
- xl = (bl >>> 28 | bh << 4) ^ (bl << 30 | bh >>> 2) ^ (bl << 25 | bh >>> 7) | 0;
- al = al + xl | 0;
- ah = ah + ((bh >>> 28 | bl << 4) ^ (bh << 30 | bl >>> 2) ^ (bh << 25 | bl >>> 7)) + (al >>> 0 < xl >>> 0 ? 1 : 0) | 0;
- H0l = H0l + al | 0;
- H0h = H0h + ah + (H0l >>> 0 < al >>> 0 ? 1 : 0) | 0;
- H1l = H1l + bl | 0;
- H1h = H1h + bh + (H1l >>> 0 < bl >>> 0 ? 1 : 0) | 0;
- H2l = H2l + cl | 0;
- H2h = H2h + ch + (H2l >>> 0 < cl >>> 0 ? 1 : 0) | 0;
- H3l = H3l + dl | 0;
- H3h = H3h + dh + (H3l >>> 0 < dl >>> 0 ? 1 : 0) | 0;
- H4l = H4l + el | 0;
- H4h = H4h + eh + (H4l >>> 0 < el >>> 0 ? 1 : 0) | 0;
- H5l = H5l + fl | 0;
- H5h = H5h + fh + (H5l >>> 0 < fl >>> 0 ? 1 : 0) | 0;
- H6l = H6l + gl | 0;
- H6h = H6h + gh + (H6l >>> 0 < gl >>> 0 ? 1 : 0) | 0;
- H7l = H7l + hl | 0;
- H7h = H7h + hh + (H7l >>> 0 < hl >>> 0 ? 1 : 0) | 0;
- }
- function _core_heap(offset) {
- offset = offset | 0;
- _core(HEAP[offset | 0] << 24 | HEAP[offset | 1] << 16 | HEAP[offset | 2] << 8 | HEAP[offset | 3], HEAP[offset | 4] << 24 | HEAP[offset | 5] << 16 | HEAP[offset | 6] << 8 | HEAP[offset | 7], HEAP[offset | 8] << 24 | HEAP[offset | 9] << 16 | HEAP[offset | 10] << 8 | HEAP[offset | 11], HEAP[offset | 12] << 24 | HEAP[offset | 13] << 16 | HEAP[offset | 14] << 8 | HEAP[offset | 15], HEAP[offset | 16] << 24 | HEAP[offset | 17] << 16 | HEAP[offset | 18] << 8 | HEAP[offset | 19], HEAP[offset | 20] << 24 | HEAP[offset | 21] << 16 | HEAP[offset | 22] << 8 | HEAP[offset | 23], HEAP[offset | 24] << 24 | HEAP[offset | 25] << 16 | HEAP[offset | 26] << 8 | HEAP[offset | 27], HEAP[offset | 28] << 24 | HEAP[offset | 29] << 16 | HEAP[offset | 30] << 8 | HEAP[offset | 31], HEAP[offset | 32] << 24 | HEAP[offset | 33] << 16 | HEAP[offset | 34] << 8 | HEAP[offset | 35], HEAP[offset | 36] << 24 | HEAP[offset | 37] << 16 | HEAP[offset | 38] << 8 | HEAP[offset | 39], HEAP[offset | 40] << 24 | HEAP[offset | 41] << 16 | HEAP[offset | 42] << 8 | HEAP[offset | 43], HEAP[offset | 44] << 24 | HEAP[offset | 45] << 16 | HEAP[offset | 46] << 8 | HEAP[offset | 47], HEAP[offset | 48] << 24 | HEAP[offset | 49] << 16 | HEAP[offset | 50] << 8 | HEAP[offset | 51], HEAP[offset | 52] << 24 | HEAP[offset | 53] << 16 | HEAP[offset | 54] << 8 | HEAP[offset | 55], HEAP[offset | 56] << 24 | HEAP[offset | 57] << 16 | HEAP[offset | 58] << 8 | HEAP[offset | 59], HEAP[offset | 60] << 24 | HEAP[offset | 61] << 16 | HEAP[offset | 62] << 8 | HEAP[offset | 63], HEAP[offset | 64] << 24 | HEAP[offset | 65] << 16 | HEAP[offset | 66] << 8 | HEAP[offset | 67], HEAP[offset | 68] << 24 | HEAP[offset | 69] << 16 | HEAP[offset | 70] << 8 | HEAP[offset | 71], HEAP[offset | 72] << 24 | HEAP[offset | 73] << 16 | HEAP[offset | 74] << 8 | HEAP[offset | 75], HEAP[offset | 76] << 24 | HEAP[offset | 77] << 16 | HEAP[offset | 78] << 8 | HEAP[offset | 79], HEAP[offset | 80] << 24 | HEAP[offset | 81] << 16 | HEAP[offset | 82] << 8 | HEAP[offset | 83], HEAP[offset | 84] << 24 | HEAP[offset | 85] << 16 | HEAP[offset | 86] << 8 | HEAP[offset | 87], HEAP[offset | 88] << 24 | HEAP[offset | 89] << 16 | HEAP[offset | 90] << 8 | HEAP[offset | 91], HEAP[offset | 92] << 24 | HEAP[offset | 93] << 16 | HEAP[offset | 94] << 8 | HEAP[offset | 95], HEAP[offset | 96] << 24 | HEAP[offset | 97] << 16 | HEAP[offset | 98] << 8 | HEAP[offset | 99], HEAP[offset | 100] << 24 | HEAP[offset | 101] << 16 | HEAP[offset | 102] << 8 | HEAP[offset | 103], HEAP[offset | 104] << 24 | HEAP[offset | 105] << 16 | HEAP[offset | 106] << 8 | HEAP[offset | 107], HEAP[offset | 108] << 24 | HEAP[offset | 109] << 16 | HEAP[offset | 110] << 8 | HEAP[offset | 111], HEAP[offset | 112] << 24 | HEAP[offset | 113] << 16 | HEAP[offset | 114] << 8 | HEAP[offset | 115], HEAP[offset | 116] << 24 | HEAP[offset | 117] << 16 | HEAP[offset | 118] << 8 | HEAP[offset | 119], HEAP[offset | 120] << 24 | HEAP[offset | 121] << 16 | HEAP[offset | 122] << 8 | HEAP[offset | 123], HEAP[offset | 124] << 24 | HEAP[offset | 125] << 16 | HEAP[offset | 126] << 8 | HEAP[offset | 127]);
- }
- function _state_to_heap(output) {
- output = output | 0;
- HEAP[output | 0] = H0h >>> 24;
- HEAP[output | 1] = H0h >>> 16 & 255;
- HEAP[output | 2] = H0h >>> 8 & 255;
- HEAP[output | 3] = H0h & 255;
- HEAP[output | 4] = H0l >>> 24;
- HEAP[output | 5] = H0l >>> 16 & 255;
- HEAP[output | 6] = H0l >>> 8 & 255;
- HEAP[output | 7] = H0l & 255;
- HEAP[output | 8] = H1h >>> 24;
- HEAP[output | 9] = H1h >>> 16 & 255;
- HEAP[output | 10] = H1h >>> 8 & 255;
- HEAP[output | 11] = H1h & 255;
- HEAP[output | 12] = H1l >>> 24;
- HEAP[output | 13] = H1l >>> 16 & 255;
- HEAP[output | 14] = H1l >>> 8 & 255;
- HEAP[output | 15] = H1l & 255;
- HEAP[output | 16] = H2h >>> 24;
- HEAP[output | 17] = H2h >>> 16 & 255;
- HEAP[output | 18] = H2h >>> 8 & 255;
- HEAP[output | 19] = H2h & 255;
- HEAP[output | 20] = H2l >>> 24;
- HEAP[output | 21] = H2l >>> 16 & 255;
- HEAP[output | 22] = H2l >>> 8 & 255;
- HEAP[output | 23] = H2l & 255;
- HEAP[output | 24] = H3h >>> 24;
- HEAP[output | 25] = H3h >>> 16 & 255;
- HEAP[output | 26] = H3h >>> 8 & 255;
- HEAP[output | 27] = H3h & 255;
- HEAP[output | 28] = H3l >>> 24;
- HEAP[output | 29] = H3l >>> 16 & 255;
- HEAP[output | 30] = H3l >>> 8 & 255;
- HEAP[output | 31] = H3l & 255;
- HEAP[output | 32] = H4h >>> 24;
- HEAP[output | 33] = H4h >>> 16 & 255;
- HEAP[output | 34] = H4h >>> 8 & 255;
- HEAP[output | 35] = H4h & 255;
- HEAP[output | 36] = H4l >>> 24;
- HEAP[output | 37] = H4l >>> 16 & 255;
- HEAP[output | 38] = H4l >>> 8 & 255;
- HEAP[output | 39] = H4l & 255;
- HEAP[output | 40] = H5h >>> 24;
- HEAP[output | 41] = H5h >>> 16 & 255;
- HEAP[output | 42] = H5h >>> 8 & 255;
- HEAP[output | 43] = H5h & 255;
- HEAP[output | 44] = H5l >>> 24;
- HEAP[output | 45] = H5l >>> 16 & 255;
- HEAP[output | 46] = H5l >>> 8 & 255;
- HEAP[output | 47] = H5l & 255;
- HEAP[output | 48] = H6h >>> 24;
- HEAP[output | 49] = H6h >>> 16 & 255;
- HEAP[output | 50] = H6h >>> 8 & 255;
- HEAP[output | 51] = H6h & 255;
- HEAP[output | 52] = H6l >>> 24;
- HEAP[output | 53] = H6l >>> 16 & 255;
- HEAP[output | 54] = H6l >>> 8 & 255;
- HEAP[output | 55] = H6l & 255;
- HEAP[output | 56] = H7h >>> 24;
- HEAP[output | 57] = H7h >>> 16 & 255;
- HEAP[output | 58] = H7h >>> 8 & 255;
- HEAP[output | 59] = H7h & 255;
- HEAP[output | 60] = H7l >>> 24;
- HEAP[output | 61] = H7l >>> 16 & 255;
- HEAP[output | 62] = H7l >>> 8 & 255;
- HEAP[output | 63] = H7l & 255;
- }
- function reset() {
- H0h = 1779033703;
- H0l = 4089235720;
- H1h = 3144134277;
- H1l = 2227873595;
- H2h = 1013904242;
- H2l = 4271175723;
- H3h = 2773480762;
- H3l = 1595750129;
- H4h = 1359893119;
- H4l = 2917565137;
- H5h = 2600822924;
- H5l = 725511199;
- H6h = 528734635;
- H6l = 4215389547;
- H7h = 1541459225;
- H7l = 327033209;
- TOTAL = 0;
- }
- function init(h0h, h0l, h1h, h1l, h2h, h2l, h3h, h3l, h4h, h4l, h5h, h5l, h6h, h6l, h7h, h7l, total) {
- h0h = h0h | 0;
- h0l = h0l | 0;
- h1h = h1h | 0;
- h1l = h1l | 0;
- h2h = h2h | 0;
- h2l = h2l | 0;
- h3h = h3h | 0;
- h3l = h3l | 0;
- h4h = h4h | 0;
- h4l = h4l | 0;
- h5h = h5h | 0;
- h5l = h5l | 0;
- h6h = h6h | 0;
- h6l = h6l | 0;
- h7h = h7h | 0;
- h7l = h7l | 0;
- total = total | 0;
- H0h = h0h;
- H0l = h0l;
- H1h = h1h;
- H1l = h1l;
- H2h = h2h;
- H2l = h2l;
- H3h = h3h;
- H3l = h3l;
- H4h = h4h;
- H4l = h4l;
- H5h = h5h;
- H5l = h5l;
- H6h = h6h;
- H6l = h6l;
- H7h = h7h;
- H7l = h7l;
- TOTAL = total;
- }
- function process(offset, length) {
- offset = offset | 0;
- length = length | 0;
- var hashed = 0;
- if (offset & 127) return -1;
- while ((length | 0) >= 128) {
- _core_heap(offset);
- offset = offset + 128 | 0;
- length = length - 128 | 0;
- hashed = hashed + 128 | 0;
- }
- TOTAL = TOTAL + hashed | 0;
- return hashed | 0;
- }
- function finish(offset, length, output) {
- offset = offset | 0;
- length = length | 0;
- output = output | 0;
- var hashed = 0, i = 0;
- if (offset & 127) return -1;
- if (~output) if (output & 63) return -1;
- if ((length | 0) >= 128) {
- hashed = process(offset, length) | 0;
- if ((hashed | 0) == -1) return -1;
- offset = offset + hashed | 0;
- length = length - hashed | 0;
- }
- hashed = hashed + length | 0;
- TOTAL = TOTAL + length | 0;
- HEAP[offset | length] = 128;
- if ((length | 0) >= 112) {
- for (i = length + 1 | 0; (i | 0) < 128; i = i + 1 | 0) HEAP[offset | i] = 0;
- _core_heap(offset);
- length = 0;
- HEAP[offset | 0] = 0;
- }
- for (i = length + 1 | 0; (i | 0) < 123; i = i + 1 | 0) HEAP[offset | i] = 0;
- HEAP[offset | 123] = TOTAL >>> 29;
- HEAP[offset | 124] = TOTAL >>> 21 & 255;
- HEAP[offset | 125] = TOTAL >>> 13 & 255;
- HEAP[offset | 126] = TOTAL >>> 5 & 255;
- HEAP[offset | 127] = TOTAL << 3 & 255;
- _core_heap(offset);
- if (~output) _state_to_heap(output);
- return hashed | 0;
- }
- function hmac_reset() {
- H0h = I0h;
- H0l = I0l;
- H1h = I1h;
- H1l = I1l;
- H2h = I2h;
- H2l = I2l;
- H3h = I3h;
- H3l = I3l;
- H4h = I4h;
- H4l = I4l;
- H5h = I5h;
- H5l = I5l;
- H6h = I6h;
- H6l = I6l;
- H7h = I7h;
- H7l = I7l;
- TOTAL = 128;
- }
- function _hmac_opad() {
- H0h = O0h;
- H0l = O0l;
- H1h = O1h;
- H1l = O1l;
- H2h = O2h;
- H2l = O2l;
- H3h = O3h;
- H3l = O3l;
- H4h = O4h;
- H4l = O4l;
- H5h = O5h;
- H5l = O5l;
- H6h = O6h;
- H6l = O6l;
- H7h = O7h;
- H7l = O7l;
- TOTAL = 128;
- }
- function hmac_init(p0h, p0l, p1h, p1l, p2h, p2l, p3h, p3l, p4h, p4l, p5h, p5l, p6h, p6l, p7h, p7l, p8h, p8l, p9h, p9l, p10h, p10l, p11h, p11l, p12h, p12l, p13h, p13l, p14h, p14l, p15h, p15l) {
- p0h = p0h | 0;
- p0l = p0l | 0;
- p1h = p1h | 0;
- p1l = p1l | 0;
- p2h = p2h | 0;
- p2l = p2l | 0;
- p3h = p3h | 0;
- p3l = p3l | 0;
- p4h = p4h | 0;
- p4l = p4l | 0;
- p5h = p5h | 0;
- p5l = p5l | 0;
- p6h = p6h | 0;
- p6l = p6l | 0;
- p7h = p7h | 0;
- p7l = p7l | 0;
- p8h = p8h | 0;
- p8l = p8l | 0;
- p9h = p9h | 0;
- p9l = p9l | 0;
- p10h = p10h | 0;
- p10l = p10l | 0;
- p11h = p11h | 0;
- p11l = p11l | 0;
- p12h = p12h | 0;
- p12l = p12l | 0;
- p13h = p13h | 0;
- p13l = p13l | 0;
- p14h = p14h | 0;
- p14l = p14l | 0;
- p15h = p15h | 0;
- p15l = p15l | 0;
- reset();
- _core(p0h ^ 1549556828, p0l ^ 1549556828, p1h ^ 1549556828, p1l ^ 1549556828, p2h ^ 1549556828, p2l ^ 1549556828, p3h ^ 1549556828, p3l ^ 1549556828, p4h ^ 1549556828, p4l ^ 1549556828, p5h ^ 1549556828, p5l ^ 1549556828, p6h ^ 1549556828, p6l ^ 1549556828, p7h ^ 1549556828, p7l ^ 1549556828, p8h ^ 1549556828, p8l ^ 1549556828, p9h ^ 1549556828, p9l ^ 1549556828, p10h ^ 1549556828, p10l ^ 1549556828, p11h ^ 1549556828, p11l ^ 1549556828, p12h ^ 1549556828, p12l ^ 1549556828, p13h ^ 1549556828, p13l ^ 1549556828, p14h ^ 1549556828, p14l ^ 1549556828, p15h ^ 1549556828, p15l ^ 1549556828);
- O0h = H0h;
- O0l = H0l;
- O1h = H1h;
- O1l = H1l;
- O2h = H2h;
- O2l = H2l;
- O3h = H3h;
- O3l = H3l;
- O4h = H4h;
- O4l = H4l;
- O5h = H5h;
- O5l = H5l;
- O6h = H6h;
- O6l = H6l;
- O7h = H7h;
- O7l = H7l;
- reset();
- _core(p0h ^ 909522486, p0l ^ 909522486, p1h ^ 909522486, p1l ^ 909522486, p2h ^ 909522486, p2l ^ 909522486, p3h ^ 909522486, p3l ^ 909522486, p4h ^ 909522486, p4l ^ 909522486, p5h ^ 909522486, p5l ^ 909522486, p6h ^ 909522486, p6l ^ 909522486, p7h ^ 909522486, p7l ^ 909522486, p8h ^ 909522486, p8l ^ 909522486, p9h ^ 909522486, p9l ^ 909522486, p10h ^ 909522486, p10l ^ 909522486, p11h ^ 909522486, p11l ^ 909522486, p12h ^ 909522486, p12l ^ 909522486, p13h ^ 909522486, p13l ^ 909522486, p14h ^ 909522486, p14l ^ 909522486, p15h ^ 909522486, p15l ^ 909522486);
- I0h = H0h;
- I0l = H0l;
- I1h = H1h;
- I1l = H1l;
- I2h = H2h;
- I2l = H2l;
- I3h = H3h;
- I3l = H3l;
- I4h = H4h;
- I4l = H4l;
- I5h = H5h;
- I5l = H5l;
- I6h = H6h;
- I6l = H6l;
- I7h = H7h;
- I7l = H7l;
- TOTAL = 128;
- }
- function hmac_finish(offset, length, output) {
- offset = offset | 0;
- length = length | 0;
- output = output | 0;
- var t0h = 0, t0l = 0, t1h = 0, t1l = 0, t2h = 0, t2l = 0, t3h = 0, t3l = 0, t4h = 0, t4l = 0, t5h = 0, t5l = 0, t6h = 0, t6l = 0, t7h = 0, t7l = 0, hashed = 0;
- if (offset & 127) return -1;
- if (~output) if (output & 63) return -1;
- hashed = finish(offset, length, -1) | 0;
- t0h = H0h;
- t0l = H0l;
- t1h = H1h;
- t1l = H1l;
- t2h = H2h;
- t2l = H2l;
- t3h = H3h;
- t3l = H3l;
- t4h = H4h;
- t4l = H4l;
- t5h = H5h;
- t5l = H5l;
- t6h = H6h;
- t6l = H6l;
- t7h = H7h;
- t7l = H7l;
- _hmac_opad();
- _core(t0h, t0l, t1h, t1l, t2h, t2l, t3h, t3l, t4h, t4l, t5h, t5l, t6h, t6l, t7h, t7l, 2147483648, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1536);
- if (~output) _state_to_heap(output);
- return hashed | 0;
- }
- function pbkdf2_generate_block(offset, length, block, count, output) {
- offset = offset | 0;
- length = length | 0;
- block = block | 0;
- count = count | 0;
- output = output | 0;
- var h0h = 0, h0l = 0, h1h = 0, h1l = 0, h2h = 0, h2l = 0, h3h = 0, h3l = 0, h4h = 0, h4l = 0, h5h = 0, h5l = 0, h6h = 0, h6l = 0, h7h = 0, h7l = 0, t0h = 0, t0l = 0, t1h = 0, t1l = 0, t2h = 0, t2l = 0, t3h = 0, t3l = 0, t4h = 0, t4l = 0, t5h = 0, t5l = 0, t6h = 0, t6l = 0, t7h = 0, t7l = 0;
- if (offset & 127) return -1;
- if (~output) if (output & 63) return -1;
- HEAP[offset + length | 0] = block >>> 24;
- HEAP[offset + length + 1 | 0] = block >>> 16 & 255;
- HEAP[offset + length + 2 | 0] = block >>> 8 & 255;
- HEAP[offset + length + 3 | 0] = block & 255;
- // Closure compiler warning - The result of the 'bitor' operator is not being used
- //hmac_finish(offset, length + 4 | 0, -1) | 0;
- hmac_finish(offset, length + 4 | 0, -1);
- h0h = t0h = H0h;
- h0l = t0l = H0l;
- h1h = t1h = H1h;
- h1l = t1l = H1l;
- h2h = t2h = H2h;
- h2l = t2l = H2l;
- h3h = t3h = H3h;
- h3l = t3l = H3l;
- h4h = t4h = H4h;
- h4l = t4l = H4l;
- h5h = t5h = H5h;
- h5l = t5l = H5l;
- h6h = t6h = H6h;
- h6l = t6l = H6l;
- h7h = t7h = H7h;
- h7l = t7l = H7l;
- count = count - 1 | 0;
- while ((count | 0) > 0) {
- hmac_reset();
- _core(t0h, t0l, t1h, t1l, t2h, t2l, t3h, t3l, t4h, t4l, t5h, t5l, t6h, t6l, t7h, t7l, 2147483648, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1536);
- t0h = H0h;
- t0l = H0l;
- t1h = H1h;
- t1l = H1l;
- t2h = H2h;
- t2l = H2l;
- t3h = H3h;
- t3l = H3l;
- t4h = H4h;
- t4l = H4l;
- t5h = H5h;
- t5l = H5l;
- t6h = H6h;
- t6l = H6l;
- t7h = H7h;
- t7l = H7l;
- _hmac_opad();
- _core(t0h, t0l, t1h, t1l, t2h, t2l, t3h, t3l, t4h, t4l, t5h, t5l, t6h, t6l, t7h, t7l, 2147483648, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1536);
- t0h = H0h;
- t0l = H0l;
- t1h = H1h;
- t1l = H1l;
- t2h = H2h;
- t2l = H2l;
- t3h = H3h;
- t3l = H3l;
- t4h = H4h;
- t4l = H4l;
- t5h = H5h;
- t5l = H5l;
- t6h = H6h;
- t6l = H6l;
- t7h = H7h;
- t7l = H7l;
- h0h = h0h ^ H0h;
- h0l = h0l ^ H0l;
- h1h = h1h ^ H1h;
- h1l = h1l ^ H1l;
- h2h = h2h ^ H2h;
- h2l = h2l ^ H2l;
- h3h = h3h ^ H3h;
- h3l = h3l ^ H3l;
- h4h = h4h ^ H4h;
- h4l = h4l ^ H4l;
- h5h = h5h ^ H5h;
- h5l = h5l ^ H5l;
- h6h = h6h ^ H6h;
- h6l = h6l ^ H6l;
- h7h = h7h ^ H7h;
- h7l = h7l ^ H7l;
- count = count - 1 | 0;
- }
- H0h = h0h;
- H0l = h0l;
- H1h = h1h;
- H1l = h1l;
- H2h = h2h;
- H2l = h2l;
- H3h = h3h;
- H3l = h3l;
- H4h = h4h;
- H4l = h4l;
- H5h = h5h;
- H5l = h5l;
- H6h = h6h;
- H6l = h6l;
- H7h = h7h;
- H7l = h7l;
- if (~output) _state_to_heap(output);
- return 0;
- }
- return {
- reset: reset,
- init: init,
- process: process,
- finish: finish,
- hmac_reset: hmac_reset,
- hmac_init: hmac_init,
- hmac_finish: hmac_finish,
- pbkdf2_generate_block: pbkdf2_generate_block
- };
- }
- var _sha512_block_size = 128, _sha512_hash_size = 64;
- function sha512_constructor(options) {
- options = options || {};
- options.heapSize = options.heapSize || 4096;
- if (options.heapSize <= 0 || options.heapSize % 4096) throw new IllegalArgumentError("heapSize must be a positive number and multiple of 4096");
- this.heap = options.heap || new Uint8Array(options.heapSize);
- this.asm = options.asm || sha512_asm(global, null, this.heap.buffer);
- this.BLOCK_SIZE = _sha512_block_size;
- this.HASH_SIZE = _sha512_hash_size;
- this.reset();
- }
- function sha512_reset() {
- this.result = null;
- this.pos = 0;
- this.len = 0;
- this.asm.reset();
- return this;
- }
- function sha512_process(data) {
- if (this.result !== null) throw new IllegalStateError("state must be reset before processing new data");
- var dpos = 0, dlen = 0, clen = 0;
- if (is_buffer(data) || is_bytes(data)) {
- dpos = data.byteOffset || 0;
- dlen = data.byteLength;
- } else if (is_string(data)) {
- dlen = data.length;
- } else {
- throw new TypeError("data isn't of expected type");
- }
- while (dlen > 0) {
- clen = this.heap.byteLength - this.pos - this.len;
- clen = clen < dlen ? clen : dlen;
- if (is_buffer(data) || is_bytes(data)) {
- this.heap.set(new Uint8Array(data.buffer || data, dpos, clen), this.pos + this.len);
- } else {
- for (var i = 0; i < clen; i++) this.heap[this.pos + this.len + i] = data.charCodeAt(dpos + i);
- }
- this.len += clen;
- dpos += clen;
- dlen -= clen;
- clen = this.asm.process(this.pos, this.len);
- if (clen < this.len) {
- this.pos += clen;
- this.len -= clen;
- } else {
- this.pos = 0;
- this.len = 0;
- }
- }
- return this;
- }
- function sha512_finish() {
- if (this.result !== null) throw new IllegalStateError("state must be reset before processing new data");
- this.asm.finish(this.pos, this.len, 0);
- this.result = new Uint8Array(_sha512_hash_size);
- this.result.set(this.heap.subarray(0, _sha512_hash_size));
- this.pos = 0;
- this.len = 0;
- return this;
- }
- sha512_constructor.BLOCK_SIZE = _sha512_block_size;
- sha512_constructor.HASH_SIZE = _sha512_hash_size;
- var sha512_prototype = sha512_constructor.prototype;
- sha512_prototype.reset = sha512_reset;
- sha512_prototype.process = sha512_process;
- sha512_prototype.finish = sha512_finish;
- function hmac_constructor(options) {
- options = options || {};
- if (!options.hash) throw new SyntaxError("option 'hash' is required");
- if (!options.hash.HASH_SIZE) throw new SyntaxError("option 'hash' supplied doesn't seem to be a valid hash function");
- this.hash = options.hash;
- this.BLOCK_SIZE = this.hash.BLOCK_SIZE;
- this.HMAC_SIZE = this.hash.HASH_SIZE;
- this.key = null;
- this.verify = null;
- this.result = null;
- if (options.password !== undefined || options.verify !== undefined) this.reset(options);
- return this;
- }
- function hmac_sha256_constructor(options) {
- options = options || {};
- if (!(options.hash instanceof sha256_constructor)) options.hash = new sha256_constructor(options);
- hmac_constructor.call(this, options);
- return this;
- }
- function hmac_sha512_constructor(options) {
- options = options || {};
- if (!(options.hash instanceof sha512_constructor)) options.hash = new sha512_constructor(options);
- hmac_constructor.call(this, options);
- return this;
- }
- function _hmac_key(hash, password) {
- var key;
- if (is_buffer(password) || is_bytes(password)) {
- key = new Uint8Array(hash.BLOCK_SIZE);
- if (password.byteLength > hash.BLOCK_SIZE) {
- key.set(new Uint8Array(hash.reset().process(password).finish().result));
- } else if (is_buffer(password)) {
- key.set(new Uint8Array(password));
- } else {
- key.set(password);
- }
- } else if (is_string(password)) {
- key = new Uint8Array(hash.BLOCK_SIZE);
- if (password.length > hash.BLOCK_SIZE) {
- key.set(new Uint8Array(hash.reset().process(password).finish().result));
- } else {
- for (var i = 0; i < password.length; ++i) key[i] = password.charCodeAt(i);
- }
- } else {
- throw new TypeError("password isn't of expected type");
- }
- return key;
- }
- function _hmac_init_verify(verify) {
- if (is_buffer(verify) || is_bytes(verify)) {
- verify = new Uint8Array(verify);
- } else if (is_string(verify)) {
- verify = string_to_bytes(verify);
- } else {
- throw new TypeError("verify tag isn't of expected type");
- }
- if (verify.length !== this.HMAC_SIZE) throw new IllegalArgumentError("illegal verification tag size");
- this.verify = verify;
- }
- function hmac_reset(options) {
- options = options || {};
- var password = options.password;
- if (this.key === null && !is_string(password) && !password) throw new IllegalStateError("no key is associated with the instance");
- this.result = null;
- this.hash.reset();
- if (password || is_string(password)) this.key = _hmac_key(this.hash, password);
- var ipad = new Uint8Array(this.key);
- for (var i = 0; i < ipad.length; ++i) ipad[i] ^= 54;
- this.hash.process(ipad);
- var verify = options.verify;
- if (verify !== undefined) {
- _hmac_init_verify.call(this, verify);
- } else {
- this.verify = null;
- }
- return this;
- }
- function hmac_sha256_reset(options) {
- options = options || {};
- var password = options.password;
- if (this.key === null && !is_string(password) && !password) throw new IllegalStateError("no key is associated with the instance");
- this.result = null;
- this.hash.reset();
- if (password || is_string(password)) {
- this.key = _hmac_key(this.hash, password);
- this.hash.reset().asm.hmac_init(this.key[0] << 24 | this.key[1] << 16 | this.key[2] << 8 | this.key[3], this.key[4] << 24 | this.key[5] << 16 | this.key[6] << 8 | this.key[7], this.key[8] << 24 | this.key[9] << 16 | this.key[10] << 8 | this.key[11], this.key[12] << 24 | this.key[13] << 16 | this.key[14] << 8 | this.key[15], this.key[16] << 24 | this.key[17] << 16 | this.key[18] << 8 | this.key[19], this.key[20] << 24 | this.key[21] << 16 | this.key[22] << 8 | this.key[23], this.key[24] << 24 | this.key[25] << 16 | this.key[26] << 8 | this.key[27], this.key[28] << 24 | this.key[29] << 16 | this.key[30] << 8 | this.key[31], this.key[32] << 24 | this.key[33] << 16 | this.key[34] << 8 | this.key[35], this.key[36] << 24 | this.key[37] << 16 | this.key[38] << 8 | this.key[39], this.key[40] << 24 | this.key[41] << 16 | this.key[42] << 8 | this.key[43], this.key[44] << 24 | this.key[45] << 16 | this.key[46] << 8 | this.key[47], this.key[48] << 24 | this.key[49] << 16 | this.key[50] << 8 | this.key[51], this.key[52] << 24 | this.key[53] << 16 | this.key[54] << 8 | this.key[55], this.key[56] << 24 | this.key[57] << 16 | this.key[58] << 8 | this.key[59], this.key[60] << 24 | this.key[61] << 16 | this.key[62] << 8 | this.key[63]);
- } else {
- this.hash.asm.hmac_reset();
- }
- var verify = options.verify;
- if (verify !== undefined) {
- _hmac_init_verify.call(this, verify);
- } else {
- this.verify = null;
- }
- return this;
- }
- function hmac_sha512_reset(options) {
- options = options || {};
- var password = options.password;
- if (this.key === null && !is_string(password) && !password) throw new IllegalStateError("no key is associated with the instance");
- this.result = null;
- this.hash.reset();
- if (password || is_string(password)) {
- this.key = _hmac_key(this.hash, password);
- this.hash.reset().asm.hmac_init(this.key[0] << 24 | this.key[1] << 16 | this.key[2] << 8 | this.key[3], this.key[4] << 24 | this.key[5] << 16 | this.key[6] << 8 | this.key[7], this.key[8] << 24 | this.key[9] << 16 | this.key[10] << 8 | this.key[11], this.key[12] << 24 | this.key[13] << 16 | this.key[14] << 8 | this.key[15], this.key[16] << 24 | this.key[17] << 16 | this.key[18] << 8 | this.key[19], this.key[20] << 24 | this.key[21] << 16 | this.key[22] << 8 | this.key[23], this.key[24] << 24 | this.key[25] << 16 | this.key[26] << 8 | this.key[27], this.key[28] << 24 | this.key[29] << 16 | this.key[30] << 8 | this.key[31], this.key[32] << 24 | this.key[33] << 16 | this.key[34] << 8 | this.key[35], this.key[36] << 24 | this.key[37] << 16 | this.key[38] << 8 | this.key[39], this.key[40] << 24 | this.key[41] << 16 | this.key[42] << 8 | this.key[43], this.key[44] << 24 | this.key[45] << 16 | this.key[46] << 8 | this.key[47], this.key[48] << 24 | this.key[49] << 16 | this.key[50] << 8 | this.key[51], this.key[52] << 24 | this.key[53] << 16 | this.key[54] << 8 | this.key[55], this.key[56] << 24 | this.key[57] << 16 | this.key[58] << 8 | this.key[59], this.key[60] << 24 | this.key[61] << 16 | this.key[62] << 8 | this.key[63], this.key[64] << 24 | this.key[65] << 16 | this.key[66] << 8 | this.key[67], this.key[68] << 24 | this.key[69] << 16 | this.key[70] << 8 | this.key[71], this.key[72] << 24 | this.key[73] << 16 | this.key[74] << 8 | this.key[75], this.key[76] << 24 | this.key[77] << 16 | this.key[78] << 8 | this.key[79], this.key[80] << 24 | this.key[81] << 16 | this.key[82] << 8 | this.key[83], this.key[84] << 24 | this.key[85] << 16 | this.key[86] << 8 | this.key[87], this.key[88] << 24 | this.key[89] << 16 | this.key[90] << 8 | this.key[91], this.key[92] << 24 | this.key[93] << 16 | this.key[94] << 8 | this.key[95], this.key[96] << 24 | this.key[97] << 16 | this.key[98] << 8 | this.key[99], this.key[100] << 24 | this.key[101] << 16 | this.key[102] << 8 | this.key[103], this.key[104] << 24 | this.key[105] << 16 | this.key[106] << 8 | this.key[107], this.key[108] << 24 | this.key[109] << 16 | this.key[110] << 8 | this.key[111], this.key[112] << 24 | this.key[113] << 16 | this.key[114] << 8 | this.key[115], this.key[116] << 24 | this.key[117] << 16 | this.key[118] << 8 | this.key[119], this.key[120] << 24 | this.key[121] << 16 | this.key[122] << 8 | this.key[123], this.key[124] << 24 | this.key[125] << 16 | this.key[126] << 8 | this.key[127]);
- } else {
- this.hash.asm.hmac_reset();
- }
- var verify = options.verify;
- if (verify !== undefined) {
- _hmac_init_verify.call(this, verify);
- } else {
- this.verify = null;
- }
- return this;
- }
- function hmac_process(data) {
- if (this.key === null) throw new IllegalStateError("no key is associated with the instance");
- if (this.result !== null) throw new IllegalStateError("state must be reset before processing new data");
- this.hash.process(data);
- return this;
- }
- function hmac_finish() {
- if (this.key === null) throw new IllegalStateError("no key is associated with the instance");
- if (this.result !== null) throw new IllegalStateError("state must be reset before processing new data");
- var inner_result = this.hash.finish().result;
- var opad = new Uint8Array(this.key);
- for (var i = 0; i < opad.length; ++i) opad[i] ^= 92;
- var verify = this.verify;
- var result = this.hash.reset().process(opad).process(inner_result).finish().result;
- if (verify) {
- if (verify.length === result.length) {
- var diff = 0;
- for (var i = 0; i < verify.length; i++) {
- diff |= verify[i] ^ result[i];
- }
- this.result = !diff;
- } else {
- this.result = false;
- }
- } else {
- this.result = result;
- }
- return this;
- }
- function hmac_sha256_finish() {
- if (this.key === null) throw new IllegalStateError("no key is associated with the instance");
- if (this.result !== null) throw new IllegalStateError("state must be reset before processing new data");
- var hash = this.hash, asm = this.hash.asm, heap = this.hash.heap;
- asm.hmac_finish(hash.pos, hash.len, 0);
- var verify = this.verify;
- var result = new Uint8Array(_sha256_hash_size);
- result.set(heap.subarray(0, _sha256_hash_size));
- if (verify) {
- if (verify.length === result.length) {
- var diff = 0;
- for (var i = 0; i < verify.length; i++) {
- diff |= verify[i] ^ result[i];
- }
- this.result = !diff;
- } else {
- this.result = false;
- }
- } else {
- this.result = result;
- }
- return this;
- }
- function hmac_sha512_finish() {
- if (this.key === null) throw new IllegalStateError("no key is associated with the instance");
- if (this.result !== null) throw new IllegalStateError("state must be reset before processing new data");
- var hash = this.hash, asm = this.hash.asm, heap = this.hash.heap;
- asm.hmac_finish(hash.pos, hash.len, 0);
- var verify = this.verify;
- var result = new Uint8Array(_sha512_hash_size);
- result.set(heap.subarray(0, _sha512_hash_size));
- if (verify) {
- if (verify.length === result.length) {
- var diff = 0;
- for (var i = 0; i < verify.length; i++) {
- diff |= verify[i] ^ result[i];
- }
- this.result = !diff;
- } else {
- this.result = false;
- }
- } else {
- this.result = result;
- }
- return this;
- }
- var hmac_prototype = hmac_constructor.prototype;
- hmac_prototype.reset = hmac_reset;
- hmac_prototype.process = hmac_process;
- hmac_prototype.finish = hmac_finish;
- hmac_sha256_constructor.BLOCK_SIZE = sha256_constructor.BLOCK_SIZE;
- hmac_sha256_constructor.HMAC_SIZE = sha256_constructor.HASH_SIZE;
- var hmac_sha256_prototype = hmac_sha256_constructor.prototype;
- hmac_sha256_prototype.reset = hmac_sha256_reset;
- hmac_sha256_prototype.process = hmac_process;
- hmac_sha256_prototype.finish = hmac_sha256_finish;
- hmac_sha512_constructor.BLOCK_SIZE = sha512_constructor.BLOCK_SIZE;
- hmac_sha512_constructor.HMAC_SIZE = sha512_constructor.HASH_SIZE;
- var hmac_sha512_prototype = hmac_sha512_constructor.prototype;
- hmac_sha512_prototype.reset = hmac_sha512_reset;
- hmac_sha512_prototype.process = hmac_process;
- hmac_sha512_prototype.finish = hmac_sha512_finish;
- function pbkdf2_constructor(options) {
- options = options || {};
- if (!options.hmac) throw new SyntaxError("option 'hmac' is required");
- if (!options.hmac.HMAC_SIZE) throw new SyntaxError("option 'hmac' supplied doesn't seem to be a valid HMAC function");
- this.hmac = options.hmac;
- this.count = options.count || 4096;
- this.length = options.length || this.hmac.HMAC_SIZE;
- this.result = null;
- var password = options.password;
- if (password || is_string(password)) this.reset(options);
- return this;
- }
- function pbkdf2_hmac_sha256_constructor(options) {
- options = options || {};
- if (!(options.hmac instanceof hmac_sha256_constructor)) options.hmac = new hmac_sha256_constructor(options);
- pbkdf2_constructor.call(this, options);
- return this;
- }
- function pbkdf2_hmac_sha512_constructor(options) {
- options = options || {};
- if (!(options.hmac instanceof hmac_sha512_constructor)) options.hmac = new hmac_sha512_constructor(options);
- pbkdf2_constructor.call(this, options);
- return this;
- }
- function pbkdf2_reset(options) {
- this.result = null;
- this.hmac.reset(options);
- return this;
- }
- function pbkdf2_generate(salt, count, length) {
- if (this.result !== null) throw new IllegalStateError("state must be reset before processing new data");
- if (!salt && !is_string(salt)) throw new IllegalArgumentError("bad 'salt' value");
- count = count || this.count;
- length = length || this.length;
- this.result = new Uint8Array(length);
- var blocks = Math.ceil(length / this.hmac.HMAC_SIZE);
- for (var i = 1; i <= blocks; ++i) {
- var j = (i - 1) * this.hmac.HMAC_SIZE;
- var l = (i < blocks ? 0 : length % this.hmac.HMAC_SIZE) || this.hmac.HMAC_SIZE;
- var tmp = new Uint8Array(this.hmac.reset().process(salt).process(new Uint8Array([ i >>> 24 & 255, i >>> 16 & 255, i >>> 8 & 255, i & 255 ])).finish().result);
- this.result.set(tmp.subarray(0, l), j);
- for (var k = 1; k < count; ++k) {
- tmp = new Uint8Array(this.hmac.reset().process(tmp).finish().result);
- for (var r = 0; r < l; ++r) this.result[j + r] ^= tmp[r];
- }
- }
- return this;
- }
- function pbkdf2_hmac_sha256_generate(salt, count, length) {
- if (this.result !== null) throw new IllegalStateError("state must be reset before processing new data");
- if (!salt && !is_string(salt)) throw new IllegalArgumentError("bad 'salt' value");
- count = count || this.count;
- length = length || this.length;
- this.result = new Uint8Array(length);
- var blocks = Math.ceil(length / this.hmac.HMAC_SIZE);
- for (var i = 1; i <= blocks; ++i) {
- var j = (i - 1) * this.hmac.HMAC_SIZE;
- var l = (i < blocks ? 0 : length % this.hmac.HMAC_SIZE) || this.hmac.HMAC_SIZE;
- this.hmac.reset().process(salt);
- this.hmac.hash.asm.pbkdf2_generate_block(this.hmac.hash.pos, this.hmac.hash.len, i, count, 0);
- this.result.set(this.hmac.hash.heap.subarray(0, l), j);
- }
- return this;
- }
- function pbkdf2_hmac_sha512_generate(salt, count, length) {
- if (this.result !== null) throw new IllegalStateError("state must be reset before processing new data");
- if (!salt && !is_string(salt)) throw new IllegalArgumentError("bad 'salt' value");
- count = count || this.count;
- length = length || this.length;
- this.result = new Uint8Array(length);
- var blocks = Math.ceil(length / this.hmac.HMAC_SIZE);
- for (var i = 1; i <= blocks; ++i) {
- var j = (i - 1) * this.hmac.HMAC_SIZE;
- var l = (i < blocks ? 0 : length % this.hmac.HMAC_SIZE) || this.hmac.HMAC_SIZE;
- this.hmac.reset().process(salt);
- this.hmac.hash.asm.pbkdf2_generate_block(this.hmac.hash.pos, this.hmac.hash.len, i, count, 0);
- this.result.set(this.hmac.hash.heap.subarray(0, l), j);
- }
- return this;
- }
- var pbkdf2_prototype = pbkdf2_constructor.prototype;
- pbkdf2_prototype.reset = pbkdf2_reset;
- pbkdf2_prototype.generate = pbkdf2_generate;
- var pbkdf2_hmac_sha256_prototype = pbkdf2_hmac_sha256_constructor.prototype;
- pbkdf2_hmac_sha256_prototype.reset = pbkdf2_reset;
- pbkdf2_hmac_sha256_prototype.generate = pbkdf2_hmac_sha256_generate;
- var pbkdf2_hmac_sha512_prototype = pbkdf2_hmac_sha512_constructor.prototype;
- pbkdf2_hmac_sha512_prototype.reset = pbkdf2_reset;
- pbkdf2_hmac_sha512_prototype.generate = pbkdf2_hmac_sha512_generate;
- global.IllegalStateError = IllegalStateError;
- global.IllegalArgumentError = IllegalArgumentError;
- global.SecurityError = SecurityError;
- exports.string_to_bytes = string_to_bytes;
- exports.hex_to_bytes = hex_to_bytes;
- exports.base64_to_bytes = base64_to_bytes;
- exports.bytes_to_string = bytes_to_string;
- exports.bytes_to_hex = bytes_to_hex;
- exports.bytes_to_base64 = bytes_to_base64;
- var SHA256_instance = new sha256_constructor({
- heapSize: 1048576
- });
- function sha256_bytes(data) {
- if (data === undefined) throw new SyntaxError("data required");
- return SHA256_instance.reset().process(data).finish().result;
- }
- function sha256_hex(data) {
- var result = sha256_bytes(data);
- return bytes_to_hex(result);
- }
- function sha256_base64(data) {
- var result = sha256_bytes(data);
- return bytes_to_base64(result);
- }
- exports.SHA256 = {
- bytes: sha256_bytes,
- hex: sha256_hex,
- base64: sha256_base64
- };
- var SHA512_instance = new sha512_constructor({
- heapSize: 1048576
- });
- function sha512_bytes(data) {
- if (data === undefined) throw new SyntaxError("data required");
- return SHA512_instance.reset().process(data).finish().result;
- }
- function sha512_hex(data) {
- var result = sha512_bytes(data);
- return bytes_to_hex(result);
- }
- function sha512_base64(data) {
- var result = sha512_bytes(data);
- return bytes_to_base64(result);
- }
- exports.SHA512 = {
- bytes: sha512_bytes,
- hex: sha512_hex,
- base64: sha512_base64
- };
- var hmac_sha256_instance = new hmac_sha256_constructor({
- hash: SHA256_instance
- });
- function hmac_sha256_bytes(data, password) {
- if (data === undefined) throw new SyntaxError("data required");
- if (password === undefined) throw new SyntaxError("password required");
- return hmac_sha256_instance.reset({
- password: password
- }).process(data).finish().result;
- }
- function hmac_sha256_hex(data, password) {
- var result = hmac_sha256_bytes(data, password);
- return bytes_to_hex(result);
- }
- function hmac_sha256_base64(data, password) {
- var result = hmac_sha256_bytes(data, password);
- return bytes_to_base64(result);
- }
- exports.HMAC = exports.HMAC_SHA256 = {
- bytes: hmac_sha256_bytes,
- hex: hmac_sha256_hex,
- base64: hmac_sha256_base64
- };
- var hmac_sha512_instance = new hmac_sha512_constructor({
- hash: SHA512_instance
- });
- function hmac_sha512_bytes(data, password) {
- if (data === undefined) throw new SyntaxError("data required");
- if (password === undefined) throw new SyntaxError("password required");
- return hmac_sha512_instance.reset({
- password: password
- }).process(data).finish().result;
- }
- function hmac_sha512_hex(data, password) {
- var result = hmac_sha512_bytes(data, password);
- return bytes_to_hex(result);
- }
- function hmac_sha512_base64(data, password) {
- var result = hmac_sha512_bytes(data, password);
- return bytes_to_base64(result);
- }
- exports.HMAC_SHA512 = {
- bytes: hmac_sha512_bytes,
- hex: hmac_sha512_hex,
- base64: hmac_sha512_base64
- };
- var pbkdf2_hmac_sha256_instance = new pbkdf2_hmac_sha256_constructor({
- hmac: hmac_sha256_instance
- });
- function pbkdf2_hmac_sha256_bytes(password, salt, iterations, dklen) {
- if (password === undefined) throw new SyntaxError("password required");
- if (salt === undefined) throw new SyntaxError("salt required");
- return pbkdf2_hmac_sha256_instance.reset({
- password: password
- }).generate(salt, iterations, dklen).result;
- }
- function pbkdf2_hmac_sha256_hex(password, salt, iterations, dklen) {
- var result = pbkdf2_hmac_sha256_bytes(password, salt, iterations, dklen);
- return bytes_to_hex(result);
- }
- function pbkdf2_hmac_sha256_base64(password, salt, iterations, dklen) {
- var result = pbkdf2_hmac_sha256_bytes(password, salt, iterations, dklen);
- return bytes_to_base64(result);
- }
- exports.PBKDF2 = exports.PBKDF2_HMAC_SHA256 = {
- bytes: pbkdf2_hmac_sha256_bytes,
- hex: pbkdf2_hmac_sha256_hex,
- base64: pbkdf2_hmac_sha256_base64
- };
- var pbkdf2_hmac_sha512_instance = new pbkdf2_hmac_sha512_constructor({
- hmac: hmac_sha512_instance
- });
- function pbkdf2_hmac_sha512_bytes(password, salt, iterations, dklen) {
- if (password === undefined) throw new SyntaxError("password required");
- if (salt === undefined) throw new SyntaxError("salt required");
- return pbkdf2_hmac_sha512_instance.reset({
- password: password
- }).generate(salt, iterations, dklen).result;
- }
- function pbkdf2_hmac_sha512_hex(password, salt, iterations, dklen) {
- var result = pbkdf2_hmac_sha512_bytes(password, salt, iterations, dklen);
- return bytes_to_hex(result);
- }
- function pbkdf2_hmac_sha512_base64(password, salt, iterations, dklen) {
- var result = pbkdf2_hmac_sha512_bytes(password, salt, iterations, dklen);
- return bytes_to_base64(result);
- }
- exports.PBKDF2_HMAC_SHA512 = {
- bytes: pbkdf2_hmac_sha512_bytes,
- hex: pbkdf2_hmac_sha512_hex,
- base64: pbkdf2_hmac_sha512_base64
- };
- var cbc_aes_instance = new cbc_aes_constructor({
- heapSize: 1048576
- });
- function cbc_aes_encrypt_bytes(data, key, padding, iv) {
- if (data === undefined) throw new SyntaxError("data required");
- if (key === undefined) throw new SyntaxError("key required");
- return cbc_aes_instance.reset({
- key: key,
- padding: padding,
- iv: iv
- }).encrypt(data).result;
- }
- function cbc_aes_decrypt_bytes(data, key, padding, iv) {
- if (data === undefined) throw new SyntaxError("data required");
- if (key === undefined) throw new SyntaxError("key required");
- return cbc_aes_instance.reset({
- key: key,
- padding: padding,
- iv: iv
- }).decrypt(data).result;
- }
- exports.AES = exports.AES_CBC = {
- encrypt: cbc_aes_encrypt_bytes,
- decrypt: cbc_aes_decrypt_bytes
- };
- var ccm_aes_instance = new ccm_aes_constructor({
- heap: cbc_aes_instance.heap,
- asm: cbc_aes_instance.asm
- });
- function ccm_aes_encrypt_bytes(data, key, nonce, adata, tagSize) {
- if (data === undefined) throw new SyntaxError("data required");
- if (key === undefined) throw new SyntaxError("key required");
- if (nonce === undefined) throw new SyntaxError("nonce required");
- var dataLength = data.byteLength || data.length || 0;
- return ccm_aes_instance.reset({
- key: key,
- nonce: nonce,
- adata: adata,
- tagSize: tagSize,
- dataLength: dataLength
- }).encrypt(data).result;
- }
- function ccm_aes_decrypt_bytes(data, key, nonce, adata, tagSize) {
- if (data === undefined) throw new SyntaxError("data required");
- if (key === undefined) throw new SyntaxError("key required");
- if (nonce === undefined) throw new SyntaxError("nonce required");
- var dataLength = data.byteLength || data.length || 0;
- tagSize = tagSize || _aes_block_size;
- return ccm_aes_instance.reset({
- key: key,
- nonce: nonce,
- adata: adata,
- tagSize: tagSize,
- dataLength: dataLength - tagSize
- }).decrypt(data).result;
- }
- exports.AES_CCM = {
- encrypt: ccm_aes_encrypt_bytes,
- decrypt: ccm_aes_decrypt_bytes
- };
- var cfb_aes_instance = new cfb_aes_constructor({
- heap: cbc_aes_instance.heap,
- asm: cbc_aes_instance.asm
- });
- function cfb_aes_encrypt_bytes(data, key, padding, iv) {
- if (data === undefined) throw new SyntaxError("data required");
- if (key === undefined) throw new SyntaxError("key required");
- return cfb_aes_instance.reset({
- key: key,
- padding: padding,
- iv: iv
- }).encrypt(data).result;
- }
- function cfb_aes_decrypt_bytes(data, key, padding, iv) {
- if (data === undefined) throw new SyntaxError("data required");
- if (key === undefined) throw new SyntaxError("key required");
- return cfb_aes_instance.reset({
- key: key,
- padding: padding,
- iv: iv
- }).decrypt(data).result;
- }
- exports.AES_CFB = {
- encrypt: cfb_aes_encrypt_bytes,
- decrypt: cfb_aes_decrypt_bytes
- };
- var cfb_aes_decrypt_instance = new cfb_aes_decrypt_constructor({
- heap: cbc_aes_instance.heap,
- asm: cbc_aes_instance.asm
- });
- function cfb_aes_decrypt_init(key, padding, iv) {
- if (key === undefined) throw new SyntaxError("key required");
- return cfb_aes_decrypt_instance.reset({
- key: key,
- padding: padding,
- iv: iv
- });
- }
- exports.AES_CFB = exports.AES_CFB || {};
- exports.AES_CFB.decryptor = {
- init: cfb_aes_decrypt_init
- };
-})({}, function() {
- return this;
-}());
-</script>
-
- <!--<script src="/js/jsbip39.js"></script>-->
-<script>
-/*
- * Copyright (c) 2013 Pavol Rusnak
- *
- * 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.
- */
+}).call(this,require("buffer").Buffer)
+},{"./bufferutils":57,"./crypto":58,"./transaction":70,"assert":5,"buffer":7}],57:[function(require,module,exports){
+(function (Buffer){
+var assert = require('assert')
+var opcodes = require('./opcodes')
-/*
- * Javascript port from python by Ian Coleman
- *
- * Includes code from asmCrypto
- * https://github.com/tresorit/asmcrypto.js
- */
+// https://github.com/feross/buffer/blob/master/index.js#L1127
+function verifuint (value, max) {
+ assert(typeof value === 'number', 'cannot write a non-number as a number')
+ assert(value >= 0, 'specified a negative value for writing an unsigned value')
+ assert(value <= max, 'value is larger than maximum value for type')
+ assert(Math.floor(value) === value, 'value has a fractional component')
+}
-var Mnemonic = function(language) {
+function pushDataSize (i) {
+ return i < opcodes.OP_PUSHDATA1 ? 1
+ : i < 0xff ? 2
+ : i < 0xffff ? 3
+ : 5
+}
- var PBKDF2_ROUNDS = 2048;
- var RADIX = 2048;
+function readPushDataInt (buffer, offset) {
+ var opcode = buffer.readUInt8(offset)
+ var number, size
- var self = this;
- var wordlist = [];
+ // ~6 bit
+ if (opcode < opcodes.OP_PUSHDATA1) {
+ number = opcode
+ size = 1
- function init() {
- wordlist = WORDLISTS[language];
- if (wordlist.length != RADIX) {
- err = 'Wordlist should contain ' + RADIX + ' words, but it contains ' + wordlist.length + ' words.';
- throw err;
- }
- }
+ // 8 bit
+ } else if (opcode === opcodes.OP_PUSHDATA1) {
+ if (offset + 2 > buffer.length) return null
+ number = buffer.readUInt8(offset + 1)
+ size = 2
- self.generate = function(strength) {
- strength = strength || 128;
- var r = strength % 32;
- if (r > 0) {
- throw 'Strength should be divisible by 32, but it is not (' + r + ').';
- }
- var hasStrongCrypto = 'crypto' in window && window['crypto'] !== null;
- if (!hasStrongCrypto) {
- throw 'Mnemonic should be generated with strong randomness, but crypto.getRandomValues is unavailable';
- }
- var buffer = new Uint8Array(strength / 8);
- var data = crypto.getRandomValues(buffer);
- return self.toMnemonic(data);
- }
+ // 16 bit
+ } else if (opcode === opcodes.OP_PUSHDATA2) {
+ if (offset + 3 > buffer.length) return null
+ number = buffer.readUInt16LE(offset + 1)
+ size = 3
- self.toMnemonic = function(data) {
- if (data.length % 4 > 0) {
- throw 'Data length in bits should be divisible by 32, but it is not (' + data.length + ' bytes = ' + data.length*8 + ' bits).'
- }
+ // 32 bit
+ } else {
+ if (offset + 5 > buffer.length) return null
+ assert.equal(opcode, opcodes.OP_PUSHDATA4, 'Unexpected opcode')
- //h = hashlib.sha256(data).hexdigest()
- var uintArray = new Uint8Array(data);
- var h = asmCrypto.SHA256.bytes(uintArray);
+ number = buffer.readUInt32LE(offset + 1)
+ size = 5
+ }
- // b is a binary string, eg '00111010101100...'
- //b = bin(int(binascii.hexlify(data), 16))[2:].zfill(len(data) * 8) + \
- // bin(int(h, 16))[2:].zfill(256)[:len(data) * 8 / 32]
- //
- // a = bin(int(binascii.hexlify(data), 16))[2:].zfill(len(data) * 8)
- // c = bin(int(h, 16))[2:].zfill(256)
- // d = c[:len(data) * 8 / 32]
- var a = byteArrayToBinaryString(data);
- var c = byteArrayToBinaryString(h);
- var d = c.substring(0, data.length * 8 / 32);
- // b = line1 + line2
- var b = a + d;
+ return {
+ opcode: opcode,
+ number: number,
+ size: size
+ }
+}
- var result = [];
- var blen = b.length / 11;
- for (var i=0; i<blen; i++) {
- var idx = parseInt(b.substring(i * 11, (i + 1) * 11), 2);
- result.push(wordlist[idx]);
- }
- return result.join(' ');
- }
+function readUInt64LE (buffer, offset) {
+ var a = buffer.readUInt32LE(offset)
+ var b = buffer.readUInt32LE(offset + 4)
+ b *= 0x100000000
- self.check = function(mnemonic) {
- var mnemonic = mnemonic.split(' ')
- if (mnemonic.length % 3 > 0) {
- return false
- }
- // idx = map(lambda x: bin(self.wordlist.index(x))[2:].zfill(11), mnemonic)
- var idx = [];
- for (var i=0; i<mnemonic.length; i++) {
- var word = mnemonic[i];
- var wordIndex = wordlist.indexOf(word);
- if (wordIndex == -1) {
- return false;
- }
- var binaryIndex = zfill(wordIndex.toString(2), 11);
- idx.push(binaryIndex);
- }
- var b = idx.join('');
- var l = b.length;
- //d = b[:l / 33 * 32]
- //h = b[-l / 33:]
- var d = b.substring(0, l / 33 * 32);
- var h = b.substring(l - l / 33, l);
- //nd = binascii.unhexlify(hex(int(d, 2))[2:].rstrip('L').zfill(l / 33 * 8))
- //nh = bin(int(hashlib.sha256(nd).hexdigest(), 16))[2:].zfill(256)[:l / 33]
- var nd = binaryStringToByteArray(d);
- var ndHash = asmCrypto.SHA256.bytes(nd);
- var ndBstr = zfill(byteArrayToBinaryString(ndHash), 256);
- var nh = ndBstr.substring(0,l/33);
- return h == nh;
- }
+ verifuint(b + a, 0x001fffffffffffff)
- self.toSeed = function(mnemonic, passphrase) {
- passphrase = passphrase || '';
- mnemonic = self.normalizeString(mnemonic)
- passphrase = self.normalizeString(passphrase)
- passphrase = "mnemonic" + passphrase;
- //return PBKDF2(mnemonic, 'mnemonic' + passphrase, iterations=PBKDF2_ROUNDS, macmodule=hmac, digestmodule=hashlib.sha512).read(64)
- return asmCrypto.PBKDF2_HMAC_SHA512.hex(mnemonic, passphrase, PBKDF2_ROUNDS, 512/8);
- }
+ return b + a
+}
- self.normalizeString = function(str) {
- if (typeof str.normalize == "function") {
- return str.normalize("NFKD");
- }
- else {
- // TODO find a library to do this
- // Not supported on firefox mobile
- console.warn("NFKD Normalization is unavailable");
- return str;
- }
- }
+function readVarInt (buffer, offset) {
+ var t = buffer.readUInt8(offset)
+ var number, size
- function byteArrayToBinaryString(data) {
- var bin = "";
- for (var i=0; i<data.length; i++) {
- bin += zfill(data[i].toString(2), 8);
- }
- return bin;
- }
+ // 8 bit
+ if (t < 253) {
+ number = t
+ size = 1
- function binaryStringToByteArray(str) {
- var arrayLen = str.length / 8;
- var array = new Uint8Array(arrayLen);
- for (var i=0; i<arrayLen; i++) {
- var valueStr = str.substring(0,8);
- var value = parseInt(valueStr, 2);
- array[i] = value;
- str = str.slice(8);
- }
- return array;
- }
+ // 16 bit
+ } else if (t < 254) {
+ number = buffer.readUInt16LE(offset + 1)
+ size = 3
- // Pad a numeric string on the left with zero digits until the given width
- // is reached.
- // Note this differs to the python implementation because it does not
- // handle numbers starting with a sign.
- function zfill(source, length) {
- source = source.toString();
- while (source.length < length) {
- source = '0' + source;
- }
- return source;
- }
+ // 32 bit
+ } else if (t < 255) {
+ number = buffer.readUInt32LE(offset + 1)
+ size = 5
- init();
+ // 64 bit
+ } else {
+ number = readUInt64LE(buffer, offset + 1)
+ size = 9
+ }
+ return {
+ number: number,
+ size: size
+ }
}
-WORDLISTS = {
-"english": [
-"abandon","ability","able","about","above","absent","absorb","abstract","absurd","abuse",
-"access","accident","account","accuse","achieve","acid","acoustic","acquire","across","act",
-"action","actor","actress","actual","adapt","add","addict","address","adjust","admit",
-"adult","advance","advice","aerobic","affair","afford","afraid","again","age","agent",
-"agree","ahead","aim","air","airport","aisle","alarm","album","alcohol","alert",
-"alien","all","alley","allow","almost","alone","alpha","already","also","alter",
-"always","amateur","amazing","among","amount","amused","analyst","anchor","ancient","anger",
-"angle","angry","animal","ankle","announce","annual","another","answer","antenna","antique",
-"anxiety","any","apart","apology","appear","apple","approve","april","arch","arctic",
-"area","arena","argue","arm","armed","armor","army","around","arrange","arrest",
-"arrive","arrow","art","artefact","artist","artwork","ask","aspect","assault","asset",
-"assist","assume","asthma","athlete","atom","attack","attend","attitude","attract","auction",
-"audit","august","aunt","author","auto","autumn","average","avocado","avoid","awake",
-"aware","away","awesome","awful","awkward","axis","baby","bachelor","bacon","badge",
-"bag","balance","balcony","ball","bamboo","banana","banner","bar","barely","bargain",
-"barrel","base","basic","basket","battle","beach","bean","beauty","because","become",
-"beef","before","begin","behave","behind","believe","below","belt","bench","benefit",
-"best","betray","better","between","beyond","bicycle","bid","bike","bind","biology",
-"bird","birth","bitter","black","blade","blame","blanket","blast","bleak","bless",
-"blind","blood","blossom","blouse","blue","blur","blush","board","boat","body",
-"boil","bomb","bone","bonus","book","boost","border","boring","borrow","boss",
-"bottom","bounce","box","boy","bracket","brain","brand","brass","brave","bread",
-"breeze","brick","bridge","brief","bright","bring","brisk","broccoli","broken","bronze",
-"broom","brother","brown","brush","bubble","buddy","budget","buffalo","build","bulb",
-"bulk","bullet","bundle","bunker","burden","burger","burst","bus","business","busy",
-"butter","buyer","buzz","cabbage","cabin","cable","cactus","cage","cake","call",
-"calm","camera","camp","can","canal","cancel","candy","cannon","canoe","canvas",
-"canyon","capable","capital","captain","car","carbon","card","cargo","carpet","carry",
-"cart","case","cash","casino","castle","casual","cat","catalog","catch","category",
-"cattle","caught","cause","caution","cave","ceiling","celery","cement","census","century",
-"cereal","certain","chair","chalk","champion","change","chaos","chapter","charge","chase",
-"chat","cheap","check","cheese","chef","cherry","chest","chicken","chief","child",
-"chimney","choice","choose","chronic","chuckle","chunk","churn","cigar","cinnamon","circle",
-"citizen","city","civil","claim","clap","clarify","claw","clay","clean","clerk",
-"clever","click","client","cliff","climb","clinic","clip","clock","clog","close",
-"cloth","cloud","clown","club","clump","cluster","clutch","coach","coast","coconut",
-"code","coffee","coil","coin","collect","color","column","combine","come","comfort",
-"comic","common","company","concert","conduct","confirm","congress","connect","consider","control",
-"convince","cook","cool","copper","copy","coral","core","corn","correct","cost",
-"cotton","couch","country","couple","course","cousin","cover","coyote","crack","cradle",
-"craft","cram","crane","crash","crater","crawl","crazy","cream","credit","creek",
-"crew","cricket","crime","crisp","critic","crop","cross","crouch","crowd","crucial",
-"cruel","cruise","crumble","crunch","crush","cry","crystal","cube","culture","cup",
-"cupboard","curious","current","curtain","curve","cushion","custom","cute","cycle","dad",
-"damage","damp","dance","danger","daring","dash","daughter","dawn","day","deal",
-"debate","debris","decade","december","decide","decline","decorate","decrease","deer","defense",
-"define","defy","degree","delay","deliver","demand","demise","denial","dentist","deny",
-"depart","depend","deposit","depth","deputy","derive","describe","desert","design","desk",
-"despair","destroy","detail","detect","develop","device","devote","diagram","dial","diamond",
-"diary","dice","diesel","diet","differ","digital","dignity","dilemma","dinner","dinosaur",
-"direct","dirt","disagree","discover","disease","dish","dismiss","disorder","display","distance",
-"divert","divide","divorce","dizzy","doctor","document","dog","doll","dolphin","domain",
-"donate","donkey","donor","door","dose","double","dove","draft","dragon","drama",
-"drastic","draw","dream","dress","drift","drill","drink","drip","drive","drop",
-"drum","dry","duck","dumb","dune","during","dust","dutch","duty","dwarf",
-"dynamic","eager","eagle","early","earn","earth","easily","east","easy","echo",
-"ecology","economy","edge","edit","educate","effort","egg","eight","either","elbow",
-"elder","electric","elegant","element","elephant","elevator","elite","else","embark","embody",
-"embrace","emerge","emotion","employ","empower","empty","enable","enact","end","endless",
-"endorse","enemy","energy","enforce","engage","engine","enhance","enjoy","enlist","enough",
-"enrich","enroll","ensure","enter","entire","entry","envelope","episode","equal","equip",
-"era","erase","erode","erosion","error","erupt","escape","essay","essence","estate",
-"eternal","ethics","evidence","evil","evoke","evolve","exact","example","excess","exchange",
-"excite","exclude","excuse","execute","exercise","exhaust","exhibit","exile","exist","exit",
-"exotic","expand","expect","expire","explain","expose","express","extend","extra","eye",
-"eyebrow","fabric","face","faculty","fade","faint","faith","fall","false","fame",
-"family","famous","fan","fancy","fantasy","farm","fashion","fat","fatal","father",
-"fatigue","fault","favorite","feature","february","federal","fee","feed","feel","female",
-"fence","festival","fetch","fever","few","fiber","fiction","field","figure","file",
-"film","filter","final","find","fine","finger","finish","fire","firm","first",
-"fiscal","fish","fit","fitness","fix","flag","flame","flash","flat","flavor",
-"flee","flight","flip","float","flock","floor","flower","fluid","flush","fly",
-"foam","focus","fog","foil","fold","follow","food","foot","force","forest",
-"forget","fork","fortune","forum","forward","fossil","foster","found","fox","fragile",
-"frame","frequent","fresh","friend","fringe","frog","front","frost","frown","frozen",
-"fruit","fuel","fun","funny","furnace","fury","future","gadget","gain","galaxy",
-"gallery","game","gap","garage","garbage","garden","garlic","garment","gas","gasp",
-"gate","gather","gauge","gaze","general","genius","genre","gentle","genuine","gesture",
-"ghost","giant","gift","giggle","ginger","giraffe","girl","give","glad","glance",
-"glare","glass","glide","glimpse","globe","gloom","glory","glove","glow","glue",
-"goat","goddess","gold","good","goose","gorilla","gospel","gossip","govern","gown",
-"grab","grace","grain","grant","grape","grass","gravity","great","green","grid",
-"grief","grit","grocery","group","grow","grunt","guard","guess","guide","guilt",
-"guitar","gun","gym","habit","hair","half","hammer","hamster","hand","happy",
-"harbor","hard","harsh","harvest","hat","have","hawk","hazard","head","health",
-"heart","heavy","hedgehog","height","hello","helmet","help","hen","hero","hidden",
-"high","hill","hint","hip","hire","history","hobby","hockey","hold","hole",
-"holiday","hollow","home","honey","hood","hope","horn","horror","horse","hospital",
-"host","hotel","hour","hover","hub","huge","human","humble","humor","hundred",
-"hungry","hunt","hurdle","hurry","hurt","husband","hybrid","ice","icon","idea",
-"identify","idle","ignore","ill","illegal","illness","image","imitate","immense","immune",
-"impact","impose","improve","impulse","inch","include","income","increase","index","indicate",
-"indoor","industry","infant","inflict","inform","inhale","inherit","initial","inject","injury",
-"inmate","inner","innocent","input","inquiry","insane","insect","inside","inspire","install",
-"intact","interest","into","invest","invite","involve","iron","island","isolate","issue",
-"item","ivory","jacket","jaguar","jar","jazz","jealous","jeans","jelly","jewel",
-"job","join","joke","journey","joy","judge","juice","jump","jungle","junior",
-"junk","just","kangaroo","keen","keep","ketchup","key","kick","kid","kidney",
-"kind","kingdom","kiss","kit","kitchen","kite","kitten","kiwi","knee","knife",
-"knock","know","lab","label","labor","ladder","lady","lake","lamp","language",
-"laptop","large","later","latin","laugh","laundry","lava","law","lawn","lawsuit",
-"layer","lazy","leader","leaf","learn","leave","lecture","left","leg","legal",
-"legend","leisure","lemon","lend","length","lens","leopard","lesson","letter","level",
-"liar","liberty","library","license","life","lift","light","like","limb","limit",
-"link","lion","liquid","list","little","live","lizard","load","loan","lobster",
-"local","lock","logic","lonely","long","loop","lottery","loud","lounge","love",
-"loyal","lucky","luggage","lumber","lunar","lunch","luxury","lyrics","machine","mad",
-"magic","magnet","maid","mail","main","major","make","mammal","man","manage",
-"mandate","mango","mansion","manual","maple","marble","march","margin","marine","market",
-"marriage","mask","mass","master","match","material","math","matrix","matter","maximum",
-"maze","meadow","mean","measure","meat","mechanic","medal","media","melody","melt",
-"member","memory","mention","menu","mercy","merge","merit","merry","mesh","message",
-"metal","method","middle","midnight","milk","million","mimic","mind","minimum","minor",
-"minute","miracle","mirror","misery","miss","mistake","mix","mixed","mixture","mobile",
-"model","modify","mom","moment","monitor","monkey","monster","month","moon","moral",
-"more","morning","mosquito","mother","motion","motor","mountain","mouse","move","movie",
-"much","muffin","mule","multiply","muscle","museum","mushroom","music","must","mutual",
-"myself","mystery","myth","naive","name","napkin","narrow","nasty","nation","nature",
-"near","neck","need","negative","neglect","neither","nephew","nerve","nest","net",
-"network","neutral","never","news","next","nice","night","noble","noise","nominee",
-"noodle","normal","north","nose","notable","note","nothing","notice","novel","now",
-"nuclear","number","nurse","nut","oak","obey","object","oblige","obscure","observe",
-"obtain","obvious","occur","ocean","october","odor","off","offer","office","often",
-"oil","okay","old","olive","olympic","omit","once","one","onion","online",
-"only","open","opera","opinion","oppose","option","orange","orbit","orchard","order",
-"ordinary","organ","orient","original","orphan","ostrich","other","outdoor","outer","output",
-"outside","oval","oven","over","own","owner","oxygen","oyster","ozone","pact",
-"paddle","page","pair","palace","palm","panda","panel","panic","panther","paper",
-"parade","parent","park","parrot","party","pass","patch","path","patient","patrol",
-"pattern","pause","pave","payment","peace","peanut","pear","peasant","pelican","pen",
-"penalty","pencil","people","pepper","perfect","permit","person","pet","phone","photo",
-"phrase","physical","piano","picnic","picture","piece","pig","pigeon","pill","pilot",
-"pink","pioneer","pipe","pistol","pitch","pizza","place","planet","plastic","plate",
-"play","please","pledge","pluck","plug","plunge","poem","poet","point","polar",
-"pole","police","pond","pony","pool","popular","portion","position","possible","post",
-"potato","pottery","poverty","powder","power","practice","praise","predict","prefer","prepare",
-"present","pretty","prevent","price","pride","primary","print","priority","prison","private",
-"prize","problem","process","produce","profit","program","project","promote","proof","property",
-"prosper","protect","proud","provide","public","pudding","pull","pulp","pulse","pumpkin",
-"punch","pupil","puppy","purchase","purity","purpose","purse","push","put","puzzle",
-"pyramid","quality","quantum","quarter","question","quick","quit","quiz","quote","rabbit",
-"raccoon","race","rack","radar","radio","rail","rain","raise","rally","ramp",
-"ranch","random","range","rapid","rare","rate","rather","raven","raw","razor",
-"ready","real","reason","rebel","rebuild","recall","receive","recipe","record","recycle",
+function writePushDataInt (buffer, number, offset) {
+ var size = pushDataSize(number)
+
+ // ~6 bit
+ if (size === 1) {
+ buffer.writeUInt8(number, offset)
+
+ // 8 bit
+ } else if (size === 2) {
+ buffer.writeUInt8(opcodes.OP_PUSHDATA1, offset)
+ buffer.writeUInt8(number, offset + 1)
+
+ // 16 bit
+ } else if (size === 3) {
+ buffer.writeUInt8(opcodes.OP_PUSHDATA2, offset)
+ buffer.writeUInt16LE(number, offset + 1)
+
+ // 32 bit
+ } else {
+ buffer.writeUInt8(opcodes.OP_PUSHDATA4, offset)
+ buffer.writeUInt32LE(number, offset + 1)
+ }
+
+ return size
+}
+
+function writeUInt64LE (buffer, value, offset) {
+ verifuint(value, 0x001fffffffffffff)
+
+ buffer.writeInt32LE(value & -1, offset)
+ buffer.writeUInt32LE(Math.floor(value / 0x100000000), offset + 4)
+}
+
+function varIntSize (i) {
+ return i < 253 ? 1
+ : i < 0x10000 ? 3
+ : i < 0x100000000 ? 5
+ : 9
+}
+
+function writeVarInt (buffer, number, offset) {
+ var size = varIntSize(number)
+
+ // 8 bit
+ if (size === 1) {
+ buffer.writeUInt8(number, offset)
+
+ // 16 bit
+ } else if (size === 3) {
+ buffer.writeUInt8(253, offset)
+ buffer.writeUInt16LE(number, offset + 1)
+
+ // 32 bit
+ } else if (size === 5) {
+ buffer.writeUInt8(254, offset)
+ buffer.writeUInt32LE(number, offset + 1)
+
+ // 64 bit
+ } else {
+ buffer.writeUInt8(255, offset)
+ writeUInt64LE(buffer, number, offset + 1)
+ }
+
+ return size
+}
+
+function varIntBuffer (i) {
+ var size = varIntSize(i)
+ var buffer = new Buffer(size)
+ writeVarInt(buffer, i, 0)
+
+ return buffer
+}
+
+function reverse (buffer) {
+ var buffer2 = new Buffer(buffer)
+ Array.prototype.reverse.call(buffer2)
+ return buffer2
+}
+
+module.exports = {
+ pushDataSize: pushDataSize,
+ readPushDataInt: readPushDataInt,
+ readUInt64LE: readUInt64LE,
+ readVarInt: readVarInt,
+ reverse: reverse,
+ varIntBuffer: varIntBuffer,
+ varIntSize: varIntSize,
+ writePushDataInt: writePushDataInt,
+ writeUInt64LE: writeUInt64LE,
+ writeVarInt: writeVarInt
+}
+
+}).call(this,require("buffer").Buffer)
+},{"./opcodes":67,"assert":5,"buffer":7}],58:[function(require,module,exports){
+var createHash = require('create-hash')
+
+function hash160 (buffer) {
+ return ripemd160(sha256(buffer))
+}
+
+function hash256 (buffer) {
+ return sha256(sha256(buffer))
+}
+
+function ripemd160 (buffer) {
+ return createHash('rmd160').update(buffer).digest()
+}
+
+function sha1 (buffer) {
+ return createHash('sha1').update(buffer).digest()
+}
+
+function sha256 (buffer) {
+ return createHash('sha256').update(buffer).digest()
+}
+
+// FIXME: Name not consistent with others
+var createHmac = require('create-hmac')
+
+function HmacSHA256 (buffer, secret) {
+ console.warn('Hmac* functions are deprecated for removal in 2.0.0, use node crypto instead')
+ return createHmac('sha256', secret).update(buffer).digest()
+}
+
+function HmacSHA512 (buffer, secret) {
+ console.warn('Hmac* functions are deprecated for removal in 2.0.0, use node crypto instead')
+ return createHmac('sha512', secret).update(buffer).digest()
+}
+
+module.exports = {
+ ripemd160: ripemd160,
+ sha1: sha1,
+ sha256: sha256,
+ hash160: hash160,
+ hash256: hash256,
+ HmacSHA256: HmacSHA256,
+ HmacSHA512: HmacSHA512
+}
+
+},{"create-hash":32,"create-hmac":45}],59:[function(require,module,exports){
+(function (Buffer){
+var assert = require('assert')
+var createHmac = require('create-hmac')
+var typeForce = require('typeforce')
+
+var BigInteger = require('bigi')
+var ECSignature = require('./ecsignature')
+
+var ZERO = new Buffer([0])
+var ONE = new Buffer([1])
+
+// https://tools.ietf.org/html/rfc6979#section-3.2
+function deterministicGenerateK (curve, hash, d, checkSig) {
+ typeForce('Buffer', hash)
+ typeForce('BigInteger', d)
+
+ // FIXME: remove/uncomment for 2.0.0
+ // typeForce('Function', checkSig)
+
+ if (typeof checkSig !== 'function') {
+ console.warn('deterministicGenerateK requires a checkSig callback in 2.0.0, see #337 for more information')
+
+ checkSig = function (k) {
+ var G = curve.G
+ var n = curve.n
+ var e = BigInteger.fromBuffer(hash)
+
+ var Q = G.multiply(k)
+
+ if (curve.isInfinity(Q))
+ return false
+
+ var r = Q.affineX.mod(n)
+ if (r.signum() === 0)
+ return false
+
+ var s = k.modInverse(n).multiply(e.add(d.multiply(r))).mod(n)
+ if (s.signum() === 0)
+ return false
+
+ return true
+ }
+ }
+
+ // sanity check
+ assert.equal(hash.length, 32, 'Hash must be 256 bit')
+
+ var x = d.toBuffer(32)
+ var k = new Buffer(32)
+ var v = new Buffer(32)
+
+ // Step A, ignored as hash already provided
+ // Step B
+ v.fill(1)
+
+ // Step C
+ k.fill(0)
+
+ // Step D
+ k = createHmac('sha256', k)
+ .update(v)
+ .update(ZERO)
+ .update(x)
+ .update(hash)
+ .digest()
+
+ // Step E
+ v = createHmac('sha256', k).update(v).digest()
+
+ // Step F
+ k = createHmac('sha256', k)
+ .update(v)
+ .update(ONE)
+ .update(x)
+ .update(hash)
+ .digest()
+
+ // Step G
+ v = createHmac('sha256', k).update(v).digest()
+
+ // Step H1/H2a, ignored as tlen === qlen (256 bit)
+ // Step H2b
+ v = createHmac('sha256', k).update(v).digest()
+
+ var T = BigInteger.fromBuffer(v)
+
+ // Step H3, repeat until T is within the interval [1, n - 1] and is suitable for ECDSA
+ while ((T.signum() <= 0) || (T.compareTo(curve.n) >= 0) || !checkSig(T)) {
+ k = createHmac('sha256', k)
+ .update(v)
+ .update(ZERO)
+ .digest()
+
+ v = createHmac('sha256', k).update(v).digest()
+
+ // Step H1/H2a, again, ignored as tlen === qlen (256 bit)
+ // Step H2b again
+ v = createHmac('sha256', k).update(v).digest()
+ T = BigInteger.fromBuffer(v)
+ }
+
+ return T
+}
+
+function sign (curve, hash, d) {
+ var r, s
+
+ var e = BigInteger.fromBuffer(hash)
+ var n = curve.n
+ var G = curve.G
+
+ deterministicGenerateK(curve, hash, d, function (k) {
+ var Q = G.multiply(k)
+
+ if (curve.isInfinity(Q))
+ return false
+
+ r = Q.affineX.mod(n)
+ if (r.signum() === 0)
+ return false
+
+ s = k.modInverse(n).multiply(e.add(d.multiply(r))).mod(n)
+ if (s.signum() === 0)
+ return false
+
+ return true
+ })
+
+ var N_OVER_TWO = n.shiftRight(1)
+
+ // enforce low S values, see bip62: 'low s values in signatures'
+ if (s.compareTo(N_OVER_TWO) > 0) {
+ s = n.subtract(s)
+ }
+
+ return new ECSignature(r, s)
+}
+
+function verifyRaw (curve, e, signature, Q) {
+ var n = curve.n
+ var G = curve.G
+
+ var r = signature.r
+ var s = signature.s
+
+ // 1.4.1 Enforce r and s are both integers in the interval [1, n − 1]
+ if (r.signum() <= 0 || r.compareTo(n) >= 0) return false
+ if (s.signum() <= 0 || s.compareTo(n) >= 0) return false
+
+ // c = s^-1 mod n
+ var c = s.modInverse(n)
+
+ // 1.4.4 Compute u1 = es^−1 mod n
+ // u2 = rs^−1 mod n
+ var u1 = e.multiply(c).mod(n)
+ var u2 = r.multiply(c).mod(n)
+
+ // 1.4.5 Compute R = (xR, yR) = u1G + u2Q
+ var R = G.multiplyTwo(u1, Q, u2)
+ var v = R.affineX.mod(n)
+
+ // 1.4.5 (cont.) Enforce R is not at infinity
+ if (curve.isInfinity(R)) return false
+
+ // 1.4.8 If v = r, output "valid", and if v != r, output "invalid"
+ return v.equals(r)
+}
+
+function verify (curve, hash, signature, Q) {
+ // 1.4.2 H = Hash(M), already done by the user
+ // 1.4.3 e = H
+ var e = BigInteger.fromBuffer(hash)
+
+ return verifyRaw(curve, e, signature, Q)
+}
+
+/**
+ * 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
+ */
+function recoverPubKey (curve, e, signature, i) {
+ assert.strictEqual(i & 3, i, 'Recovery param is more than two bits')
+
+ var n = curve.n
+ var G = curve.G
+
+ var r = signature.r
+ var s = signature.s
+
+ assert(r.signum() > 0 && r.compareTo(n) < 0, 'Invalid r value')
+ assert(s.signum() > 0 && s.compareTo(n) < 0, 'Invalid s value')
+
+ // A set LSB signifies that the y-coordinate is odd
+ var isYOdd = i & 1
+
+ // The more significant bit specifies whether we should use the
+ // first or second candidate key.
+ var isSecondKey = i >> 1
+
+ // 1.1 Let x = r + jn
+ var x = isSecondKey ? r.add(n) : r
+ var R = curve.pointFromX(isYOdd, x)
+
+ // 1.4 Check that nR is at infinity
+ var nR = R.multiply(n)
+ assert(curve.isInfinity(nR), 'nR is not a valid curve point')
+
+ // Compute -e from e
+ var eNeg = e.negate().mod(n)
+
+ // 1.6.1 Compute Q = r^-1 (sR - eG)
+ // Q = r^-1 (sR + -eG)
+ var rInv = r.modInverse(n)
+
+ var Q = R.multiplyTwo(s, G, eNeg).multiply(rInv)
+ curve.validate(Q)
+
+ return Q
+}
+
+/**
+ * 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.
+ */
+function calcPubKeyRecoveryParam (curve, e, signature, Q) {
+ for (var i = 0; i < 4; i++) {
+ var Qprime = recoverPubKey(curve, e, signature, i)
+
+ // 1.6.2 Verify Q
+ if (Qprime.equals(Q)) {
+ return i
+ }
+ }
+
+ throw new Error('Unable to find valid recovery factor')
+}
+
+module.exports = {
+ calcPubKeyRecoveryParam: calcPubKeyRecoveryParam,
+ deterministicGenerateK: deterministicGenerateK,
+ recoverPubKey: recoverPubKey,
+ sign: sign,
+ verify: verify,
+ verifyRaw: verifyRaw
+}
+
+}).call(this,require("buffer").Buffer)
+},{"./ecsignature":62,"assert":5,"bigi":3,"buffer":7,"create-hmac":45,"typeforce":53}],60:[function(require,module,exports){
+(function (Buffer){
+var assert = require('assert')
+var base58check = require('bs58check')
+var ecdsa = require('./ecdsa')
+var networks = require('./networks')
+var randomBytes = require('randombytes')
+var typeForce = require('typeforce')
+
+var BigInteger = require('bigi')
+var ECPubKey = require('./ecpubkey')
+
+var ecurve = require('ecurve')
+var secp256k1 = ecurve.getCurveByName('secp256k1')
+
+function ECKey (d, compressed) {
+ assert(d.signum() > 0, 'Private key must be greater than 0')
+ assert(d.compareTo(ECKey.curve.n) < 0, 'Private key must be less than the curve order')
+
+ var Q = ECKey.curve.G.multiply(d)
+
+ this.d = d
+ this.pub = new ECPubKey(Q, compressed)
+}
+
+// Constants
+ECKey.curve = secp256k1
+
+// Static constructors
+ECKey.fromWIF = function (string) {
+ var payload = base58check.decode(string)
+ var compressed = false
+
+ // Ignore the version byte
+ payload = payload.slice(1)
+
+ if (payload.length === 33) {
+ assert.strictEqual(payload[32], 0x01, 'Invalid compression flag')
+
+ // Truncate the compression flag
+ payload = payload.slice(0, -1)
+ compressed = true
+ }
+
+ assert.equal(payload.length, 32, 'Invalid WIF payload length')
+
+ var d = BigInteger.fromBuffer(payload)
+ return new ECKey(d, compressed)
+}
+
+ECKey.makeRandom = function (compressed, rng) {
+ rng = rng || randomBytes
+
+ var buffer = rng(32)
+ typeForce('Buffer', buffer)
+ assert.equal(buffer.length, 32, 'Expected 256-bit Buffer from RNG')
+
+ var d = BigInteger.fromBuffer(buffer)
+ d = d.mod(ECKey.curve.n)
+
+ return new ECKey(d, compressed)
+}
+
+// Export functions
+ECKey.prototype.toWIF = function (network) {
+ network = network || networks.bitcoin
+
+ var bufferLen = this.pub.compressed ? 34 : 33
+ var buffer = new Buffer(bufferLen)
+
+ buffer.writeUInt8(network.wif, 0)
+ this.d.toBuffer(32).copy(buffer, 1)
+
+ if (this.pub.compressed) {
+ buffer.writeUInt8(0x01, 33)
+ }
+
+ return base58check.encode(buffer)
+}
+
+// Operations
+ECKey.prototype.sign = function (hash) {
+ return ecdsa.sign(ECKey.curve, hash, this.d)
+}
+
+module.exports = ECKey
+
+}).call(this,require("buffer").Buffer)
+},{"./ecdsa":59,"./ecpubkey":61,"./networks":66,"assert":5,"bigi":3,"bs58check":31,"buffer":7,"ecurve":49,"randombytes":52,"typeforce":53}],61:[function(require,module,exports){
+(function (Buffer){
+var crypto = require('./crypto')
+var ecdsa = require('./ecdsa')
+var typeForce = require('typeforce')
+var networks = require('./networks')
+
+var Address = require('./address')
+
+var ecurve = require('ecurve')
+var secp256k1 = ecurve.getCurveByName('secp256k1')
+
+function ECPubKey (Q, compressed) {
+ if (compressed === undefined) {
+ compressed = true
+ }
+
+ typeForce('Point', Q)
+ typeForce('Boolean', compressed)
+
+ this.compressed = compressed
+ this.Q = Q
+}
+
+// Constants
+ECPubKey.curve = secp256k1
+
+// Static constructors
+ECPubKey.fromBuffer = function (buffer) {
+ var Q = ecurve.Point.decodeFrom(ECPubKey.curve, buffer)
+ return new ECPubKey(Q, Q.compressed)
+}
+
+ECPubKey.fromHex = function (hex) {
+ return ECPubKey.fromBuffer(new Buffer(hex, 'hex'))
+}
+
+// Operations
+ECPubKey.prototype.getAddress = function (network) {
+ network = network || networks.bitcoin
+
+ return new Address(crypto.hash160(this.toBuffer()), network.pubKeyHash)
+}
+
+ECPubKey.prototype.verify = function (hash, signature) {
+ return ecdsa.verify(ECPubKey.curve, hash, signature, this.Q)
+}
+
+// Export functions
+ECPubKey.prototype.toBuffer = function () {
+ return this.Q.getEncoded(this.compressed)
+}
+
+ECPubKey.prototype.toHex = function () {
+ return this.toBuffer().toString('hex')
+}
+
+module.exports = ECPubKey
+
+}).call(this,require("buffer").Buffer)
+},{"./address":54,"./crypto":58,"./ecdsa":59,"./networks":66,"buffer":7,"ecurve":49,"typeforce":53}],62:[function(require,module,exports){
+(function (Buffer){
+var assert = require('assert')
+var typeForce = require('typeforce')
+
+var BigInteger = require('bigi')
+
+function ECSignature (r, s) {
+ typeForce('BigInteger', r)
+ typeForce('BigInteger', s)
+
+ this.r = r
+ this.s = s
+}
+
+ECSignature.parseCompact = function (buffer) {
+ assert.equal(buffer.length, 65, 'Invalid signature length')
+ var i = buffer.readUInt8(0) - 27
+
+ // At most 3 bits
+ assert.equal(i, i & 7, 'Invalid signature parameter')
+ var compressed = !!(i & 4)
+
+ // Recovery param only
+ i = i & 3
+
+ var r = BigInteger.fromBuffer(buffer.slice(1, 33))
+ var s = BigInteger.fromBuffer(buffer.slice(33))
+
+ return {
+ compressed: compressed,
+ i: i,
+ signature: new ECSignature(r, s)
+ }
+}
+
+ECSignature.fromDER = function (buffer) {
+ assert.equal(buffer.readUInt8(0), 0x30, 'Not a DER sequence')
+ assert.equal(buffer.readUInt8(1), buffer.length - 2, 'Invalid sequence length')
+ assert.equal(buffer.readUInt8(2), 0x02, 'Expected a DER integer')
+
+ var rLen = buffer.readUInt8(3)
+ assert(rLen > 0, 'R length is zero')
+
+ var offset = 4 + rLen
+ assert.equal(buffer.readUInt8(offset), 0x02, 'Expected a DER integer (2)')
+
+ var sLen = buffer.readUInt8(offset + 1)
+ assert(sLen > 0, 'S length is zero')
+
+ var rB = buffer.slice(4, offset)
+ var sB = buffer.slice(offset + 2)
+ offset += 2 + sLen
+
+ if (rLen > 1 && rB.readUInt8(0) === 0x00) {
+ assert(rB.readUInt8(1) & 0x80, 'R value excessively padded')
+ }
+
+ if (sLen > 1 && sB.readUInt8(0) === 0x00) {
+ assert(sB.readUInt8(1) & 0x80, 'S value excessively padded')
+ }
+
+ assert.equal(offset, buffer.length, 'Invalid DER encoding')
+ var r = BigInteger.fromDERInteger(rB)
+ var s = BigInteger.fromDERInteger(sB)
+
+ assert(r.signum() >= 0, 'R value is negative')
+ assert(s.signum() >= 0, 'S value is negative')
+
+ return new ECSignature(r, s)
+}
+
+// BIP62: 1 byte hashType flag (only 0x01, 0x02, 0x03, 0x81, 0x82 and 0x83 are allowed)
+ECSignature.parseScriptSignature = function (buffer) {
+ var hashType = buffer.readUInt8(buffer.length - 1)
+ var hashTypeMod = hashType & ~0x80
+
+ assert(hashTypeMod > 0x00 && hashTypeMod < 0x04, 'Invalid hashType ' + hashType)
+
+ return {
+ signature: ECSignature.fromDER(buffer.slice(0, -1)),
+ hashType: hashType
+ }
+}
+
+ECSignature.prototype.toCompact = function (i, compressed) {
+ if (compressed) {
+ i += 4
+ }
+
+ i += 27
+
+ var buffer = new Buffer(65)
+ buffer.writeUInt8(i, 0)
+
+ this.r.toBuffer(32).copy(buffer, 1)
+ this.s.toBuffer(32).copy(buffer, 33)
+
+ return buffer
+}
+
+ECSignature.prototype.toDER = function () {
+ var rBa = this.r.toDERInteger()
+ var sBa = this.s.toDERInteger()
+
+ var sequence = []
+
+ // INTEGER
+ sequence.push(0x02, rBa.length)
+ sequence = sequence.concat(rBa)
+
+ // INTEGER
+ sequence.push(0x02, sBa.length)
+ sequence = sequence.concat(sBa)
+
+ // SEQUENCE
+ sequence.unshift(0x30, sequence.length)
+
+ return new Buffer(sequence)
+}
+
+ECSignature.prototype.toScriptSignature = function (hashType) {
+ var hashTypeMod = hashType & ~0x80
+ assert(hashTypeMod > 0x00 && hashTypeMod < 0x04, 'Invalid hashType ' + hashType)
+
+ var hashTypeBuffer = new Buffer(1)
+ hashTypeBuffer.writeUInt8(hashType, 0)
+
+ return Buffer.concat([this.toDER(), hashTypeBuffer])
+}
+
+module.exports = ECSignature
+
+}).call(this,require("buffer").Buffer)
+},{"assert":5,"bigi":3,"buffer":7,"typeforce":53}],63:[function(require,module,exports){
+(function (Buffer){
+var assert = require('assert')
+var base58check = require('bs58check')
+var bcrypto = require('./crypto')
+var createHmac = require('create-hmac')
+var typeForce = require('typeforce')
+var networks = require('./networks')
+
+var BigInteger = require('bigi')
+var ECKey = require('./eckey')
+var ECPubKey = require('./ecpubkey')
+
+var ecurve = require('ecurve')
+var curve = ecurve.getCurveByName('secp256k1')
+
+function findBIP32NetworkByVersion (version) {
+ for (var name in networks) {
+ var network = networks[name]
+
+ if (version === network.bip32.private || version === network.bip32.public) {
+ return network
+ }
+ }
+
+ assert(false, 'Could not find network for ' + version.toString(16))
+}
+
+function HDNode (K, chainCode, network) {
+ network = network || networks.bitcoin
+
+ typeForce('Buffer', chainCode)
+
+ assert.equal(chainCode.length, 32, 'Expected chainCode length of 32, got ' + chainCode.length)
+ assert(network.bip32, 'Unknown BIP32 constants for network')
+
+ this.chainCode = chainCode
+ this.depth = 0
+ this.index = 0
+ this.parentFingerprint = 0x00000000
+ this.network = network
+
+ if (K instanceof BigInteger) {
+ this.privKey = new ECKey(K, true)
+ this.pubKey = this.privKey.pub
+ } else if (K instanceof ECKey) {
+ assert(K.pub.compressed, 'ECKey must be compressed')
+ this.privKey = K
+ this.pubKey = K.pub
+ } else if (K instanceof ECPubKey) {
+ assert(K.compressed, 'ECPubKey must be compressed')
+ this.pubKey = K
+ } else {
+ this.pubKey = new ECPubKey(K, true)
+ }
+}
+
+HDNode.MASTER_SECRET = new Buffer('Bitcoin seed')
+HDNode.HIGHEST_BIT = 0x80000000
+HDNode.LENGTH = 78
+
+HDNode.fromSeedBuffer = function (seed, network) {
+ typeForce('Buffer', seed)
+
+ assert(seed.length >= 16, 'Seed should be at least 128 bits')
+ assert(seed.length <= 64, 'Seed should be at most 512 bits')
+
+ var I = createHmac('sha512', HDNode.MASTER_SECRET).update(seed).digest()
+ var IL = I.slice(0, 32)
+ var IR = I.slice(32)
+
+ // In case IL is 0 or >= n, the master key is invalid
+ // This is handled by `new ECKey` in the HDNode constructor
+ var pIL = BigInteger.fromBuffer(IL)
+
+ return new HDNode(pIL, IR, network)
+}
+
+HDNode.fromSeedHex = function (hex, network) {
+ return HDNode.fromSeedBuffer(new Buffer(hex, 'hex'), network)
+}
+
+HDNode.fromBase58 = function (string, network) {
+ return HDNode.fromBuffer(base58check.decode(string), network, true)
+}
+
+// FIXME: remove in 2.x.y
+HDNode.fromBuffer = function (buffer, network, __ignoreDeprecation) {
+ if (!__ignoreDeprecation) {
+ console.warn('HDNode.fromBuffer() is deprecated for removal in 2.x.y, use fromBase58 instead')
+ }
+
+ assert.strictEqual(buffer.length, HDNode.LENGTH, 'Invalid buffer length')
+
+ // 4 byte: version bytes
+ var version = buffer.readUInt32BE(0)
+
+ if (network) {
+ assert(version === network.bip32.private || version === network.bip32.public, "Network doesn't match")
+
+ // auto-detect
+ } else {
+ network = findBIP32NetworkByVersion(version)
+ }
+
+ // 1 byte: depth: 0x00 for master nodes, 0x01 for level-1 descendants, ...
+ var depth = buffer.readUInt8(4)
+
+ // 4 bytes: the fingerprint of the parent's key (0x00000000 if master key)
+ var parentFingerprint = buffer.readUInt32BE(5)
+ if (depth === 0) {
+ assert.strictEqual(parentFingerprint, 0x00000000, 'Invalid parent fingerprint')
+ }
+
+ // 4 bytes: child number. This is the number i in xi = xpar/i, with xi the key being serialized.
+ // This is encoded in MSB order. (0x00000000 if master key)
+ var index = buffer.readUInt32BE(9)
+ assert(depth > 0 || index === 0, 'Invalid index')
+
+ // 32 bytes: the chain code
+ var chainCode = buffer.slice(13, 45)
+ var data, hd
+
+ // 33 bytes: private key data (0x00 + k)
+ if (version === network.bip32.private) {
+ assert.strictEqual(buffer.readUInt8(45), 0x00, 'Invalid private key')
+ data = buffer.slice(46, 78)
+ var d = BigInteger.fromBuffer(data)
+ hd = new HDNode(d, chainCode, network)
+
+ // 33 bytes: public key data (0x02 + X or 0x03 + X)
+ } else {
+ data = buffer.slice(45, 78)
+ var Q = ecurve.Point.decodeFrom(curve, data)
+ assert.equal(Q.compressed, true, 'Invalid public key')
+
+ // Verify that the X coordinate in the public point corresponds to a point on the curve.
+ // If not, the extended public key is invalid.
+ curve.validate(Q)
+
+ hd = new HDNode(Q, chainCode, network)
+ }
+
+ hd.depth = depth
+ hd.index = index
+ hd.parentFingerprint = parentFingerprint
+
+ return hd
+}
+
+// FIXME: remove in 2.x.y
+HDNode.fromHex = function (hex, network) {
+ return HDNode.fromBuffer(new Buffer(hex, 'hex'), network)
+}
+
+HDNode.prototype.getIdentifier = function () {
+ return bcrypto.hash160(this.pubKey.toBuffer())
+}
+
+HDNode.prototype.getFingerprint = function () {
+ return this.getIdentifier().slice(0, 4)
+}
+
+HDNode.prototype.getAddress = function () {
+ return this.pubKey.getAddress(this.network)
+}
+
+HDNode.prototype.neutered = function () {
+ var neutered = new HDNode(this.pubKey.Q, this.chainCode, this.network)
+ neutered.depth = this.depth
+ neutered.index = this.index
+ neutered.parentFingerprint = this.parentFingerprint
+
+ return neutered
+}
+
+HDNode.prototype.toBase58 = function (isPrivate) {
+ return base58check.encode(this.toBuffer(isPrivate, true))
+}
+
+// FIXME: remove in 2.x.y
+HDNode.prototype.toBuffer = function (isPrivate, __ignoreDeprecation) {
+ if (isPrivate === undefined) {
+ isPrivate = !!this.privKey
+
+ // FIXME: remove in 2.x.y
+ } else {
+ console.warn('isPrivate flag is deprecated, please use the .neutered() method instead')
+ }
+
+ if (!__ignoreDeprecation) {
+ console.warn('HDNode.toBuffer() is deprecated for removal in 2.x.y, use toBase58 instead')
+ }
+
+ // Version
+ var version = isPrivate ? this.network.bip32.private : this.network.bip32.public
+ var buffer = new Buffer(HDNode.LENGTH)
+
+ // 4 bytes: version bytes
+ buffer.writeUInt32BE(version, 0)
+
+ // Depth
+ // 1 byte: depth: 0x00 for master nodes, 0x01 for level-1 descendants, ....
+ buffer.writeUInt8(this.depth, 4)
+
+ // 4 bytes: the fingerprint of the parent's key (0x00000000 if master key)
+ buffer.writeUInt32BE(this.parentFingerprint, 5)
+
+ // 4 bytes: child number. This is the number i in xi = xpar/i, with xi the key being serialized.
+ // This is encoded in Big endian. (0x00000000 if master key)
+ buffer.writeUInt32BE(this.index, 9)
+
+ // 32 bytes: the chain code
+ this.chainCode.copy(buffer, 13)
+
+ // 33 bytes: the public key or private key data
+ if (isPrivate) {
+ // FIXME: remove in 2.x.y
+ assert(this.privKey, 'Missing private key')
+
+ // 0x00 + k for private keys
+ buffer.writeUInt8(0, 45)
+ this.privKey.d.toBuffer(32).copy(buffer, 46)
+ } else {
+ // X9.62 encoding for public keys
+ this.pubKey.toBuffer().copy(buffer, 45)
+ }
+
+ return buffer
+}
+
+// FIXME: remove in 2.x.y
+HDNode.prototype.toHex = function (isPrivate) {
+ return this.toBuffer(isPrivate).toString('hex')
+}
+
+// https://github.com/bitcoin/bips/blob/master/bip-0032.mediawiki#child-key-derivation-ckd-functions
+HDNode.prototype.derive = function (index) {
+ var isHardened = index >= HDNode.HIGHEST_BIT
+ var indexBuffer = new Buffer(4)
+ indexBuffer.writeUInt32BE(index, 0)
+
+ var data
+
+ // Hardened child
+ if (isHardened) {
+ assert(this.privKey, 'Could not derive hardened child key')
+
+ // data = 0x00 || ser256(kpar) || ser32(index)
+ data = Buffer.concat([
+ this.privKey.d.toBuffer(33),
+ indexBuffer
+ ])
+
+ // Normal child
+ } else {
+ // data = serP(point(kpar)) || ser32(index)
+ // = serP(Kpar) || ser32(index)
+ data = Buffer.concat([
+ this.pubKey.toBuffer(),
+ indexBuffer
+ ])
+ }
+
+ var I = createHmac('sha512', this.chainCode).update(data).digest()
+ var IL = I.slice(0, 32)
+ var IR = I.slice(32)
+
+ var pIL = BigInteger.fromBuffer(IL)
+
+ // In case parse256(IL) >= n, proceed with the next value for i
+ if (pIL.compareTo(curve.n) >= 0) {
+ return this.derive(index + 1)
+ }
+
+ // Private parent key -> private child key
+ var hd
+ if (this.privKey) {
+ // ki = parse256(IL) + kpar (mod n)
+ var ki = pIL.add(this.privKey.d).mod(curve.n)
+
+ // In case ki == 0, proceed with the next value for i
+ if (ki.signum() === 0) {
+ return this.derive(index + 1)
+ }
+
+ hd = new HDNode(ki, IR, this.network)
+
+ // Public parent key -> public child key
+ } else {
+ // Ki = point(parse256(IL)) + Kpar
+ // = G*IL + Kpar
+ var Ki = curve.G.multiply(pIL).add(this.pubKey.Q)
+
+ // In case Ki is the point at infinity, proceed with the next value for i
+ if (curve.isInfinity(Ki)) {
+ return this.derive(index + 1)
+ }
+
+ hd = new HDNode(Ki, IR, this.network)
+ }
+
+ hd.depth = this.depth + 1
+ hd.index = index
+ hd.parentFingerprint = this.getFingerprint().readUInt32BE(0)
+
+ return hd
+}
+
+HDNode.prototype.deriveHardened = function (index) {
+ // Only derives hardened private keys by default
+ return this.derive(index + HDNode.HIGHEST_BIT)
+}
+
+HDNode.prototype.toString = HDNode.prototype.toBase58
+
+module.exports = HDNode
+
+}).call(this,require("buffer").Buffer)
+},{"./crypto":58,"./eckey":60,"./ecpubkey":61,"./networks":66,"assert":5,"bigi":3,"bs58check":31,"buffer":7,"create-hmac":45,"ecurve":49,"typeforce":53}],64:[function(require,module,exports){
+module.exports = {
+ Address: require('./address'),
+ base58check: require('./base58check'),
+ Block: require('./block'),
+ bufferutils: require('./bufferutils'),
+ crypto: require('./crypto'),
+ ecdsa: require('./ecdsa'),
+ ECKey: require('./eckey'),
+ ECPubKey: require('./ecpubkey'),
+ ECSignature: require('./ecsignature'),
+ Message: require('./message'),
+ opcodes: require('./opcodes'),
+ HDNode: require('./hdnode'),
+ Script: require('./script'),
+ scripts: require('./scripts'),
+ Transaction: require('./transaction'),
+ TransactionBuilder: require('./transaction_builder'),
+ networks: require('./networks'),
+ Wallet: require('./wallet')
+}
+
+},{"./address":54,"./base58check":55,"./block":56,"./bufferutils":57,"./crypto":58,"./ecdsa":59,"./eckey":60,"./ecpubkey":61,"./ecsignature":62,"./hdnode":63,"./message":65,"./networks":66,"./opcodes":67,"./script":68,"./scripts":69,"./transaction":70,"./transaction_builder":71,"./wallet":72}],65:[function(require,module,exports){
+(function (Buffer){
+var bufferutils = require('./bufferutils')
+var crypto = require('./crypto')
+var ecdsa = require('./ecdsa')
+var networks = require('./networks')
+
+var BigInteger = require('bigi')
+var ECPubKey = require('./ecpubkey')
+var ECSignature = require('./ecsignature')
+
+var ecurve = require('ecurve')
+var ecparams = ecurve.getCurveByName('secp256k1')
+
+function magicHash (message, network) {
+ var magicPrefix = new Buffer(network.magicPrefix)
+ var messageBuffer = new Buffer(message)
+ var lengthBuffer = bufferutils.varIntBuffer(messageBuffer.length)
+
+ var buffer = Buffer.concat([magicPrefix, lengthBuffer, messageBuffer])
+ return crypto.hash256(buffer)
+}
+
+function sign (privKey, message, network) {
+ network = network || networks.bitcoin
+
+ var hash = magicHash(message, network)
+ var signature = privKey.sign(hash)
+ var e = BigInteger.fromBuffer(hash)
+ var i = ecdsa.calcPubKeyRecoveryParam(ecparams, e, signature, privKey.pub.Q)
+
+ return signature.toCompact(i, privKey.pub.compressed)
+}
+
+// TODO: network could be implied from address
+function verify (address, signature, message, network) {
+ if (!Buffer.isBuffer(signature)) {
+ signature = new Buffer(signature, 'base64')
+ }
+
+ network = network || networks.bitcoin
+
+ var hash = magicHash(message, network)
+ var parsed = ECSignature.parseCompact(signature)
+ var e = BigInteger.fromBuffer(hash)
+ var Q = ecdsa.recoverPubKey(ecparams, e, parsed.signature, parsed.i)
+
+ var pubKey = new ECPubKey(Q, parsed.compressed)
+ return pubKey.getAddress(network).toString() === address.toString()
+}
+
+module.exports = {
+ magicHash: magicHash,
+ sign: sign,
+ verify: verify
+}
+
+}).call(this,require("buffer").Buffer)
+},{"./bufferutils":57,"./crypto":58,"./ecdsa":59,"./ecpubkey":61,"./ecsignature":62,"./networks":66,"bigi":3,"buffer":7,"ecurve":49}],66:[function(require,module,exports){
+// https://en.bitcoin.it/wiki/List_of_address_prefixes
+// Dogecoin BIP32 is a proposed standard: https://bitcointalk.org/index.php?topic=409731
+
+var networks = {
+ bitcoin: {
+ magicPrefix: '\x18Bitcoin Signed Message:\n',
+ bip32: {
+ public: 0x0488b21e,
+ private: 0x0488ade4
+ },
+ pubKeyHash: 0x00,
+ scriptHash: 0x05,
+ wif: 0x80,
+ dustThreshold: 546, // https://github.com/bitcoin/bitcoin/blob/v0.9.2/src/core.h#L151-L162
+ feePerKb: 10000, // https://github.com/bitcoin/bitcoin/blob/v0.9.2/src/main.cpp#L53
+ estimateFee: estimateFee('bitcoin')
+ },
+ testnet: {
+ magicPrefix: '\x18Bitcoin Signed Message:\n',
+ bip32: {
+ public: 0x043587cf,
+ private: 0x04358394
+ },
+ pubKeyHash: 0x6f,
+ scriptHash: 0xc4,
+ wif: 0xef,
+ dustThreshold: 546,
+ feePerKb: 10000,
+ estimateFee: estimateFee('testnet')
+ },
+ litecoin: {
+ magicPrefix: '\x19Litecoin Signed Message:\n',
+ bip32: {
+ public: 0x019da462,
+ private: 0x019d9cfe
+ },
+ pubKeyHash: 0x30,
+ scriptHash: 0x05,
+ wif: 0xb0,
+ dustThreshold: 0, // https://github.com/litecoin-project/litecoin/blob/v0.8.7.2/src/main.cpp#L360-L365
+ dustSoftThreshold: 100000, // https://github.com/litecoin-project/litecoin/blob/v0.8.7.2/src/main.h#L53
+ feePerKb: 100000, // https://github.com/litecoin-project/litecoin/blob/v0.8.7.2/src/main.cpp#L56
+ estimateFee: estimateFee('litecoin')
+ },
+ dogecoin: {
+ magicPrefix: '\x19Dogecoin Signed Message:\n',
+ bip32: {
+ public: 0x02facafd,
+ private: 0x02fac398
+ },
+ pubKeyHash: 0x1e,
+ scriptHash: 0x16,
+ wif: 0x9e,
+ dustThreshold: 0, // https://github.com/dogecoin/dogecoin/blob/v1.7.1/src/core.h#L155-L160
+ dustSoftThreshold: 100000000, // https://github.com/dogecoin/dogecoin/blob/v1.7.1/src/main.h#L62
+ feePerKb: 100000000, // https://github.com/dogecoin/dogecoin/blob/v1.7.1/src/main.cpp#L58
+ estimateFee: estimateFee('dogecoin')
+ },
+ viacoin: {
+ magicPrefix: '\x18Viacoin Signed Message:\n',
+ bip32: {
+ public: 0x0488b21e,
+ private: 0x0488ade4
+ },
+ pubKeyHash: 0x47,
+ scriptHash: 0x21,
+ wif: 0xc7,
+ dustThreshold: 560,
+ dustSoftThreshold: 100000,
+ feePerKb: 100000, //
+ estimateFee: estimateFee('viacoin')
+ },
+ viacointestnet: {
+ magicPrefix: '\x18Viacoin Signed Message:\n',
+ bip32: {
+ public: 0x043587cf,
+ private: 0x04358394
+ },
+ pubKeyHash: 0x7f,
+ scriptHash: 0xc4,
+ wif: 0xff,
+ dustThreshold: 560,
+ dustSoftThreshold: 100000,
+ feePerKb: 100000,
+ estimateFee: estimateFee('viacointestnet')
+ },
+ gamerscoin: {
+ magicPrefix: '\x19Gamerscoin Signed Message:\n',
+ bip32: {
+ public: 0x019da462,
+ private: 0x019d9cfe
+ },
+ pubKeyHash: 0x26,
+ scriptHash: 0x05,
+ wif: 0xA6,
+ dustThreshold: 0, // https://github.com/gamers-coin/gamers-coinv3/blob/master/src/main.cpp#L358-L363
+ dustSoftThreshold: 100000, // https://github.com/gamers-coin/gamers-coinv3/blob/master/src/main.cpp#L51
+ feePerKb: 100000, // https://github.com/gamers-coin/gamers-coinv3/blob/master/src/main.cpp#L54
+ estimateFee: estimateFee('gamerscoin')
+ },
+ jumbucks: {
+ magicPrefix: '\x19Jumbucks Signed Message:\n',
+ bip32: {
+ public: 0x037a689a,
+ private: 0x037a6460
+ },
+ pubKeyHash: 0x2b,
+ scriptHash: 0x05,
+ wif: 0xab,
+ dustThreshold: 0,
+ dustSoftThreshold: 10000,
+ feePerKb: 10000,
+ estimateFee: estimateFee('jumbucks')
+ },
+ zetacoin: {
+ magicPrefix: '\x18Zetacoin Signed Message:\n',
+ bip32: {
+ public: 0x0488b21e,
+ private: 0x0488ade4
+ },
+ pubKeyHash: 0x50,
+ scriptHash: 0x09,
+ wif: 0xe0,
+ dustThreshold: 546, // https://github.com/zetacoin/zetacoin/blob/master/src/core.h#L159
+ feePerKb: 10000, // https://github.com/zetacoin/zetacoin/blob/master/src/main.cpp#L54
+ estimateFee: estimateFee('zetacoin')
+ }
+}
+
+function estimateFee (type) {
+ return function (tx) {
+ var network = networks[type]
+ var baseFee = network.feePerKb
+ var byteSize = tx.toBuffer().length
+
+ var fee = baseFee * Math.ceil(byteSize / 1000)
+ if (network.dustSoftThreshold === undefined) return fee
+
+ tx.outs.forEach(function (e) {
+ if (e.value < network.dustSoftThreshold) {
+ fee += baseFee
+ }
+ })
+
+ return fee
+ }
+}
+
+module.exports = networks
+
+},{}],67:[function(require,module,exports){
+module.exports = {
+ // push value
+ OP_FALSE: 0,
+ OP_0: 0,
+ OP_PUSHDATA1: 76,
+ OP_PUSHDATA2: 77,
+ OP_PUSHDATA4: 78,
+ OP_1NEGATE: 79,
+ OP_RESERVED: 80,
+ OP_1: 81,
+ OP_TRUE: 81,
+ OP_2: 82,
+ OP_3: 83,
+ OP_4: 84,
+ OP_5: 85,
+ OP_6: 86,
+ OP_7: 87,
+ OP_8: 88,
+ OP_9: 89,
+ OP_10: 90,
+ OP_11: 91,
+ OP_12: 92,
+ OP_13: 93,
+ OP_14: 94,
+ OP_15: 95,
+ OP_16: 96,
+
+ // control
+ OP_NOP: 97,
+ OP_VER: 98,
+ OP_IF: 99,
+ OP_NOTIF: 100,
+ OP_VERIF: 101,
+ OP_VERNOTIF: 102,
+ OP_ELSE: 103,
+ OP_ENDIF: 104,
+ OP_VERIFY: 105,
+ OP_RETURN: 106,
+
+ // stack ops
+ OP_TOALTSTACK: 107,
+ OP_FROMALTSTACK: 108,
+ OP_2DROP: 109,
+ OP_2DUP: 110,
+ OP_3DUP: 111,
+ OP_2OVER: 112,
+ OP_2ROT: 113,
+ OP_2SWAP: 114,
+ OP_IFDUP: 115,
+ OP_DEPTH: 116,
+ OP_DROP: 117,
+ OP_DUP: 118,
+ OP_NIP: 119,
+ OP_OVER: 120,
+ OP_PICK: 121,
+ OP_ROLL: 122,
+ OP_ROT: 123,
+ OP_SWAP: 124,
+ OP_TUCK: 125,
+
+ // splice ops
+ OP_CAT: 126,
+ OP_SUBSTR: 127,
+ OP_LEFT: 128,
+ OP_RIGHT: 129,
+ OP_SIZE: 130,
+
+ // bit logic
+ OP_INVERT: 131,
+ OP_AND: 132,
+ OP_OR: 133,
+ OP_XOR: 134,
+ OP_EQUAL: 135,
+ OP_EQUALVERIFY: 136,
+ OP_RESERVED1: 137,
+ OP_RESERVED2: 138,
+
+ // numeric
+ OP_1ADD: 139,
+ OP_1SUB: 140,
+ OP_2MUL: 141,
+ OP_2DIV: 142,
+ OP_NEGATE: 143,
+ OP_ABS: 144,
+ OP_NOT: 145,
+ OP_0NOTEQUAL: 146,
+
+ OP_ADD: 147,
+ OP_SUB: 148,
+ OP_MUL: 149,
+ OP_DIV: 150,
+ OP_MOD: 151,
+ OP_LSHIFT: 152,
+ OP_RSHIFT: 153,
+
+ OP_BOOLAND: 154,
+ OP_BOOLOR: 155,
+ OP_NUMEQUAL: 156,
+ OP_NUMEQUALVERIFY: 157,
+ OP_NUMNOTEQUAL: 158,
+ OP_LESSTHAN: 159,
+ OP_GREATERTHAN: 160,
+ OP_LESSTHANOREQUAL: 161,
+ OP_GREATERTHANOREQUAL: 162,
+ OP_MIN: 163,
+ OP_MAX: 164,
+
+ OP_WITHIN: 165,
+
+ // crypto
+ OP_RIPEMD160: 166,
+ OP_SHA1: 167,
+ OP_SHA256: 168,
+ OP_HASH160: 169,
+ OP_HASH256: 170,
+ OP_CODESEPARATOR: 171,
+ OP_CHECKSIG: 172,
+ OP_CHECKSIGVERIFY: 173,
+ OP_CHECKMULTISIG: 174,
+ OP_CHECKMULTISIGVERIFY: 175,
+
+ // expansion
+ OP_NOP1: 176,
+ OP_NOP2: 177,
+ OP_NOP3: 178,
+ OP_NOP4: 179,
+ OP_NOP5: 180,
+ OP_NOP6: 181,
+ OP_NOP7: 182,
+ OP_NOP8: 183,
+ OP_NOP9: 184,
+ OP_NOP10: 185,
+
+ // template matching params
+ OP_PUBKEYHASH: 253,
+ OP_PUBKEY: 254,
+ OP_INVALIDOPCODE: 255
+}
+
+},{}],68:[function(require,module,exports){
+(function (Buffer){
+var assert = require('assert')
+var bufferutils = require('./bufferutils')
+var crypto = require('./crypto')
+var typeForce = require('typeforce')
+var opcodes = require('./opcodes')
+
+function Script (buffer, chunks) {
+ typeForce('Buffer', buffer)
+ typeForce('Array', chunks)
+
+ this.buffer = buffer
+ this.chunks = chunks
+}
+
+Script.fromASM = function (asm) {
+ var strChunks = asm.split(' ')
+ var chunks = strChunks.map(function (strChunk) {
+ // opcode
+ if (strChunk in opcodes) {
+ return opcodes[strChunk]
+
+ // data chunk
+ } else {
+ return new Buffer(strChunk, 'hex')
+ }
+ })
+
+ return Script.fromChunks(chunks)
+}
+
+Script.fromBuffer = function (buffer) {
+ var chunks = []
+ var i = 0
+
+ while (i < buffer.length) {
+ var opcode = buffer.readUInt8(i)
+
+ // data chunk
+ if ((opcode > opcodes.OP_0) && (opcode <= opcodes.OP_PUSHDATA4)) {
+ var d = bufferutils.readPushDataInt(buffer, i)
+
+ // did reading a pushDataInt fail? return non-chunked script
+ if (d === null) return new Script(buffer, [])
+ i += d.size
+
+ // attempt to read too much data?
+ if (i + d.number > buffer.length) return new Script(buffer, [])
+
+ var data = buffer.slice(i, i + d.number)
+ i += d.number
+
+ chunks.push(data)
+
+ // opcode
+ } else {
+ chunks.push(opcode)
+
+ i += 1
+ }
+ }
+
+ return new Script(buffer, chunks)
+}
+
+Script.fromChunks = function (chunks) {
+ typeForce('Array', chunks)
+
+ var bufferSize = chunks.reduce(function (accum, chunk) {
+ // data chunk
+ if (Buffer.isBuffer(chunk)) {
+ return accum + bufferutils.pushDataSize(chunk.length) + chunk.length
+ }
+
+ // opcode
+ return accum + 1
+ }, 0.0)
+
+ var buffer = new Buffer(bufferSize)
+ var offset = 0
+
+ chunks.forEach(function (chunk) {
+ // data chunk
+ if (Buffer.isBuffer(chunk)) {
+ offset += bufferutils.writePushDataInt(buffer, chunk.length, offset)
+
+ chunk.copy(buffer, offset)
+ offset += chunk.length
+
+ // opcode
+ } else {
+ buffer.writeUInt8(chunk, offset)
+ offset += 1
+ }
+ })
+
+ assert.equal(offset, buffer.length, 'Could not decode chunks')
+ return new Script(buffer, chunks)
+}
+
+Script.fromHex = function (hex) {
+ return Script.fromBuffer(new Buffer(hex, 'hex'))
+}
+
+Script.EMPTY = Script.fromChunks([])
+
+Script.prototype.getHash = function () {
+ return crypto.hash160(this.buffer)
+}
+
+// FIXME: doesn't work for data chunks, maybe time to use buffertools.compare...
+Script.prototype.without = function (needle) {
+ return Script.fromChunks(this.chunks.filter(function (op) {
+ return op !== needle
+ }))
+}
+
+var reverseOps = []
+for (var op in opcodes) {
+ var code = opcodes[op]
+ reverseOps[code] = op
+}
+
+Script.prototype.toASM = function () {
+ return this.chunks.map(function (chunk) {
+ // data chunk
+ if (Buffer.isBuffer(chunk)) {
+ return chunk.toString('hex')
+
+ // opcode
+ } else {
+ return reverseOps[chunk]
+ }
+ }).join(' ')
+}
+
+Script.prototype.toBuffer = function () {
+ return this.buffer
+}
+
+Script.prototype.toHex = function () {
+ return this.toBuffer().toString('hex')
+}
+
+module.exports = Script
+
+}).call(this,require("buffer").Buffer)
+},{"./bufferutils":57,"./crypto":58,"./opcodes":67,"assert":5,"buffer":7,"typeforce":53}],69:[function(require,module,exports){
+(function (Buffer){
+var assert = require('assert')
+var ops = require('./opcodes')
+var typeForce = require('typeforce')
+
+var ecurve = require('ecurve')
+var curve = ecurve.getCurveByName('secp256k1')
+
+var ECSignature = require('./ecsignature')
+var Script = require('./script')
+
+function isCanonicalPubKey (buffer) {
+ if (!Buffer.isBuffer(buffer)) return false
+
+ try {
+ ecurve.Point.decodeFrom(curve, buffer)
+ } catch (e) {
+ if (!(e.message.match(/Invalid sequence (length|tag)/)))
+ throw e
+
+ return false
+ }
+
+ return true
+}
+
+function isCanonicalSignature (buffer) {
+ if (!Buffer.isBuffer(buffer)) return false
+
+ try {
+ ECSignature.parseScriptSignature(buffer)
+ } catch (e) {
+ if (!(e.message.match(/Not a DER sequence|Invalid sequence length|Expected a DER integer|R length is zero|S length is zero|R value excessively padded|S value excessively padded|R value is negative|S value is negative|Invalid hashType/))) {
+ throw e
+ }
+
+ return false
+ }
+
+ return true
+}
+
+function isPubKeyHashInput (script) {
+ return script.chunks.length === 2 &&
+ isCanonicalSignature(script.chunks[0]) &&
+ isCanonicalPubKey(script.chunks[1])
+}
+
+function isPubKeyHashOutput (script) {
+ return script.chunks.length === 5 &&
+ script.chunks[0] === ops.OP_DUP &&
+ script.chunks[1] === ops.OP_HASH160 &&
+ Buffer.isBuffer(script.chunks[2]) &&
+ script.chunks[2].length === 20 &&
+ script.chunks[3] === ops.OP_EQUALVERIFY &&
+ script.chunks[4] === ops.OP_CHECKSIG
+}
+
+function isPubKeyInput (script) {
+ return script.chunks.length === 1 &&
+ isCanonicalSignature(script.chunks[0])
+}
+
+function isPubKeyOutput (script) {
+ return script.chunks.length === 2 &&
+ isCanonicalPubKey(script.chunks[0]) &&
+ script.chunks[1] === ops.OP_CHECKSIG
+}
+
+function isScriptHashInput (script, allowIncomplete) {
+ if (script.chunks.length < 2) return false
+
+ var lastChunk = script.chunks[script.chunks.length - 1]
+ if (!Buffer.isBuffer(lastChunk)) return false
+
+ var scriptSig = Script.fromChunks(script.chunks.slice(0, -1))
+ var redeemScript = Script.fromBuffer(lastChunk)
+
+ // is redeemScript a valid script?
+ if (redeemScript.chunks.length === 0) return false
+
+ return classifyInput(scriptSig, allowIncomplete) === classifyOutput(redeemScript)
+}
+
+function isScriptHashOutput (script) {
+ return script.chunks.length === 3 &&
+ script.chunks[0] === ops.OP_HASH160 &&
+ Buffer.isBuffer(script.chunks[1]) &&
+ script.chunks[1].length === 20 &&
+ script.chunks[2] === ops.OP_EQUAL
+}
+
+// allowIncomplete is to account for combining signatures
+// See https://github.com/bitcoin/bitcoin/blob/f425050546644a36b0b8e0eb2f6934a3e0f6f80f/src/script/sign.cpp#L195-L197
+function isMultisigInput (script, allowIncomplete) {
+ if (script.chunks.length < 2) return false
+ if (script.chunks[0] !== ops.OP_0) return false
+
+ if (allowIncomplete) {
+ return script.chunks.slice(1).every(function (chunk) {
+ return chunk === ops.OP_0 || isCanonicalSignature(chunk)
+ })
+ }
+
+ return script.chunks.slice(1).every(isCanonicalSignature)
+}
+
+function isMultisigOutput (script) {
+ if (script.chunks.length < 4) return false
+ if (script.chunks[script.chunks.length - 1] !== ops.OP_CHECKMULTISIG) return false
+
+ var mOp = script.chunks[0]
+ if (mOp === ops.OP_0) return false
+ if (mOp < ops.OP_1) return false
+ if (mOp > ops.OP_16) return false
+
+ var nOp = script.chunks[script.chunks.length - 2]
+ if (nOp === ops.OP_0) return false
+ if (nOp < ops.OP_1) return false
+ if (nOp > ops.OP_16) return false
+
+ var m = mOp - (ops.OP_1 - 1)
+ var n = nOp - (ops.OP_1 - 1)
+ if (n < m) return false
+
+ var pubKeys = script.chunks.slice(1, -2)
+ if (n < pubKeys.length) return false
+
+ return pubKeys.every(isCanonicalPubKey)
+}
+
+function isNullDataOutput (script) {
+ return script.chunks[0] === ops.OP_RETURN
+}
+
+function classifyOutput (script) {
+ typeForce('Script', script)
+
+ if (isPubKeyHashOutput(script)) {
+ return 'pubkeyhash'
+ } else if (isScriptHashOutput(script)) {
+ return 'scripthash'
+ } else if (isMultisigOutput(script)) {
+ return 'multisig'
+ } else if (isPubKeyOutput(script)) {
+ return 'pubkey'
+ } else if (isNullDataOutput(script)) {
+ return 'nulldata'
+ }
+
+ return 'nonstandard'
+}
+
+function classifyInput (script, allowIncomplete) {
+ typeForce('Script', script)
+
+ if (isPubKeyHashInput(script)) {
+ return 'pubkeyhash'
+ } else if (isMultisigInput(script, allowIncomplete)) {
+ return 'multisig'
+ } else if (isScriptHashInput(script, allowIncomplete)) {
+ return 'scripthash'
+ } else if (isPubKeyInput(script)) {
+ return 'pubkey'
+ }
+
+ return 'nonstandard'
+}
+
+// Standard Script Templates
+// {pubKey} OP_CHECKSIG
+function pubKeyOutput (pubKey) {
+ return Script.fromChunks([
+ pubKey.toBuffer(),
+ ops.OP_CHECKSIG
+ ])
+}
+
+// OP_DUP OP_HASH160 {pubKeyHash} OP_EQUALVERIFY OP_CHECKSIG
+function pubKeyHashOutput (hash) {
+ typeForce('Buffer', hash)
+
+ return Script.fromChunks([
+ ops.OP_DUP,
+ ops.OP_HASH160,
+ hash,
+ ops.OP_EQUALVERIFY,
+ ops.OP_CHECKSIG
+ ])
+}
+
+// OP_HASH160 {scriptHash} OP_EQUAL
+function scriptHashOutput (hash) {
+ typeForce('Buffer', hash)
+
+ return Script.fromChunks([
+ ops.OP_HASH160,
+ hash,
+ ops.OP_EQUAL
+ ])
+}
+
+// m [pubKeys ...] n OP_CHECKMULTISIG
+function multisigOutput (m, pubKeys) {
+ typeForce(['ECPubKey'], pubKeys)
+
+ assert(pubKeys.length >= m, 'Not enough pubKeys provided')
+
+ var pubKeyBuffers = pubKeys.map(function (pubKey) {
+ return pubKey.toBuffer()
+ })
+ var n = pubKeys.length
+
+ return Script.fromChunks([].concat(
+ (ops.OP_1 - 1) + m,
+ pubKeyBuffers,
+ (ops.OP_1 - 1) + n,
+ ops.OP_CHECKMULTISIG
+ ))
+}
+
+// {signature}
+function pubKeyInput (signature) {
+ typeForce('Buffer', signature)
+
+ return Script.fromChunks([signature])
+}
+
+// {signature} {pubKey}
+function pubKeyHashInput (signature, pubKey) {
+ typeForce('Buffer', signature)
+
+ return Script.fromChunks([signature, pubKey.toBuffer()])
+}
+
+// <scriptSig> {serialized scriptPubKey script}
+function scriptHashInput (scriptSig, scriptPubKey) {
+ return Script.fromChunks([].concat(
+ scriptSig.chunks,
+ scriptPubKey.toBuffer()
+ ))
+}
+
+// OP_0 [signatures ...]
+function multisigInput (signatures, scriptPubKey) {
+ if (scriptPubKey) {
+ assert(isMultisigOutput(scriptPubKey))
+
+ var mOp = scriptPubKey.chunks[0]
+ var nOp = scriptPubKey.chunks[scriptPubKey.chunks.length - 2]
+ var m = mOp - (ops.OP_1 - 1)
+ var n = nOp - (ops.OP_1 - 1)
+
+ assert(signatures.length >= m, 'Not enough signatures provided')
+ assert(signatures.length <= n, 'Too many signatures provided')
+ }
+
+ return Script.fromChunks([].concat(ops.OP_0, signatures))
+}
+
+function nullDataOutput (data) {
+ return Script.fromChunks([ops.OP_RETURN, data])
+}
+
+module.exports = {
+ isCanonicalPubKey: isCanonicalPubKey,
+ isCanonicalSignature: isCanonicalSignature,
+ isPubKeyHashInput: isPubKeyHashInput,
+ isPubKeyHashOutput: isPubKeyHashOutput,
+ isPubKeyInput: isPubKeyInput,
+ isPubKeyOutput: isPubKeyOutput,
+ isScriptHashInput: isScriptHashInput,
+ isScriptHashOutput: isScriptHashOutput,
+ isMultisigInput: isMultisigInput,
+ isMultisigOutput: isMultisigOutput,
+ isNullDataOutput: isNullDataOutput,
+ classifyOutput: classifyOutput,
+ classifyInput: classifyInput,
+ pubKeyOutput: pubKeyOutput,
+ pubKeyHashOutput: pubKeyHashOutput,
+ scriptHashOutput: scriptHashOutput,
+ multisigOutput: multisigOutput,
+ pubKeyInput: pubKeyInput,
+ pubKeyHashInput: pubKeyHashInput,
+ scriptHashInput: scriptHashInput,
+ multisigInput: multisigInput,
+ dataOutput: function (data) {
+ console.warn('dataOutput is deprecated, use nullDataOutput by 2.0.0')
+ return nullDataOutput(data)
+ },
+ nullDataOutput: nullDataOutput
+}
+
+}).call(this,require("buffer").Buffer)
+},{"./ecsignature":62,"./opcodes":67,"./script":68,"assert":5,"buffer":7,"ecurve":49,"typeforce":53}],70:[function(require,module,exports){
+(function (Buffer){
+var assert = require('assert')
+var bufferutils = require('./bufferutils')
+var crypto = require('./crypto')
+var typeForce = require('typeforce')
+var opcodes = require('./opcodes')
+var scripts = require('./scripts')
+
+var Address = require('./address')
+var ECSignature = require('./ecsignature')
+var Script = require('./script')
+
+function Transaction () {
+ this.version = 1
+ this.locktime = 0
+ this.ins = []
+ this.outs = []
+}
+
+Transaction.DEFAULT_SEQUENCE = 0xffffffff
+Transaction.SIGHASH_ALL = 0x01
+Transaction.SIGHASH_NONE = 0x02
+Transaction.SIGHASH_SINGLE = 0x03
+Transaction.SIGHASH_ANYONECANPAY = 0x80
+
+Transaction.fromBuffer = function (buffer, __disableAssert) {
+ var offset = 0
+ function readSlice (n) {
+ offset += n
+ return buffer.slice(offset - n, offset)
+ }
+
+ function readUInt32 () {
+ var i = buffer.readUInt32LE(offset)
+ offset += 4
+ return i
+ }
+
+ function readUInt64 () {
+ var i = bufferutils.readUInt64LE(buffer, offset)
+ offset += 8
+ return i
+ }
+
+ function readVarInt () {
+ var vi = bufferutils.readVarInt(buffer, offset)
+ offset += vi.size
+ return vi.number
+ }
+
+ function readScript () {
+ return Script.fromBuffer(readSlice(readVarInt()))
+ }
+
+ function readGenerationScript () {
+ return new Script(readSlice(readVarInt()), [])
+ }
+
+ var tx = new Transaction()
+ tx.version = readUInt32()
+
+ var vinLen = readVarInt()
+ for (var i = 0; i < vinLen; ++i) {
+ var hash = readSlice(32)
+
+ if (Transaction.isCoinbaseHash(hash)) {
+ tx.ins.push({
+ hash: hash,
+ index: readUInt32(),
+ script: readGenerationScript(),
+ sequence: readUInt32()
+ })
+ } else {
+ tx.ins.push({
+ hash: hash,
+ index: readUInt32(),
+ script: readScript(),
+ sequence: readUInt32()
+ })
+ }
+ }
+
+ var voutLen = readVarInt()
+ for (i = 0; i < voutLen; ++i) {
+ tx.outs.push({
+ value: readUInt64(),
+ script: readScript()
+ })
+ }
+
+ tx.locktime = readUInt32()
+
+ if (!__disableAssert) {
+ assert.equal(offset, buffer.length, 'Transaction has unexpected data')
+ }
+
+ return tx
+}
+
+Transaction.fromHex = function (hex) {
+ return Transaction.fromBuffer(new Buffer(hex, 'hex'))
+}
+
+Transaction.isCoinbaseHash = function (buffer) {
+ return Array.prototype.every.call(buffer, function (x) {
+ return x === 0
+ })
+}
+
+/**
+ * Create a new txIn.
+ *
+ * Can be called with any of:
+ *
+ * - A transaction and an index
+ * - A transaction hash and an index
+ *
+ * Note that this method does not sign the created input.
+ */
+Transaction.prototype.addInput = function (hash, index, sequence, script) {
+ if (sequence === undefined || sequence === null) {
+ sequence = Transaction.DEFAULT_SEQUENCE
+ }
+
+ script = script || Script.EMPTY
+
+ if (typeof hash === 'string') {
+ // TxId hex is big-endian, we need little-endian
+ hash = bufferutils.reverse(new Buffer(hash, 'hex'))
+ } else if (hash instanceof Transaction) {
+ hash = hash.getHash()
+ }
+
+ typeForce('Buffer', hash)
+ typeForce('Number', index)
+ typeForce('Number', sequence)
+ typeForce('Script', script)
+
+ assert.equal(hash.length, 32, 'Expected hash length of 32, got ' + hash.length)
+
+ // Add the input and return the input's index
+ return (this.ins.push({
+ hash: hash,
+ index: index,
+ script: script,
+ sequence: sequence
+ }) - 1)
+}
+
+/**
+ * Create a new txOut.
+ *
+ * Can be called with:
+ *
+ * - A base58 address string and a value
+ * - An Address object and a value
+ * - A scriptPubKey Script and a value
+ */
+Transaction.prototype.addOutput = function (scriptPubKey, value) {
+ // Attempt to get a valid address if it's a base58 address string
+ if (typeof scriptPubKey === 'string') {
+ scriptPubKey = Address.fromBase58Check(scriptPubKey)
+ }
+
+ // Attempt to get a valid script if it's an Address object
+ if (scriptPubKey instanceof Address) {
+ scriptPubKey = scriptPubKey.toOutputScript()
+ }
+
+ typeForce('Script', scriptPubKey)
+ typeForce('Number', value)
+
+ // Add the output and return the output's index
+ return (this.outs.push({
+ script: scriptPubKey,
+ value: value
+ }) - 1)
+}
+
+Transaction.prototype.clone = function () {
+ var newTx = new Transaction()
+ newTx.version = this.version
+ newTx.locktime = this.locktime
+
+ newTx.ins = this.ins.map(function (txIn) {
+ return {
+ hash: txIn.hash,
+ index: txIn.index,
+ script: txIn.script,
+ sequence: txIn.sequence
+ }
+ })
+
+ newTx.outs = this.outs.map(function (txOut) {
+ return {
+ script: txOut.script,
+ value: txOut.value
+ }
+ })
+
+ return newTx
+}
+
+/**
+ * Hash transaction for signing a specific input.
+ *
+ * Bitcoin uses a different hash for each signed transaction input. This
+ * method copies the transaction, makes the necessary changes based on the
+ * hashType, serializes and finally hashes the result. This hash can then be
+ * used to sign the transaction input in question.
+ */
+Transaction.prototype.hashForSignature = function (inIndex, prevOutScript, hashType) {
+ // FIXME: remove in 2.x.y
+ if (arguments[0] instanceof Script) {
+ console.warn('hashForSignature(prevOutScript, inIndex, ...) has been deprecated. Use hashForSignature(inIndex, prevOutScript, ...)')
+
+ // swap the arguments (must be stored in tmp, arguments is special)
+ var tmp = arguments[0]
+ inIndex = arguments[1]
+ prevOutScript = tmp
+ }
+
+ typeForce('Number', inIndex)
+ typeForce('Script', prevOutScript)
+ typeForce('Number', hashType)
+
+ assert(inIndex >= 0, 'Invalid vin index')
+ assert(inIndex < this.ins.length, 'Invalid vin index')
+
+ var txTmp = this.clone()
+ var hashScript = prevOutScript.without(opcodes.OP_CODESEPARATOR)
+
+ // Blank out other inputs' signatures
+ txTmp.ins.forEach(function (txIn) {
+ txIn.script = Script.EMPTY
+ })
+ txTmp.ins[inIndex].script = hashScript
+
+ var hashTypeModifier = hashType & 0x1f
+
+ if (hashTypeModifier === Transaction.SIGHASH_NONE) {
+ assert(false, 'SIGHASH_NONE not yet supported')
+ } else if (hashTypeModifier === Transaction.SIGHASH_SINGLE) {
+ assert(false, 'SIGHASH_SINGLE not yet supported')
+ }
+
+ if (hashType & Transaction.SIGHASH_ANYONECANPAY) {
+ assert(false, 'SIGHASH_ANYONECANPAY not yet supported')
+ }
+
+ var hashTypeBuffer = new Buffer(4)
+ hashTypeBuffer.writeInt32LE(hashType, 0)
+
+ var buffer = Buffer.concat([txTmp.toBuffer(), hashTypeBuffer])
+ return crypto.hash256(buffer)
+}
+
+Transaction.prototype.getHash = function () {
+ return crypto.hash256(this.toBuffer())
+}
+
+Transaction.prototype.getId = function () {
+ // TxHash is little-endian, we need big-endian
+ return bufferutils.reverse(this.getHash()).toString('hex')
+}
+
+Transaction.prototype.toBuffer = function () {
+ function scriptSize (script) {
+ var length = script.buffer.length
+
+ return bufferutils.varIntSize(length) + length
+ }
+
+ var buffer = new Buffer(
+ 8 +
+ bufferutils.varIntSize(this.ins.length) +
+ bufferutils.varIntSize(this.outs.length) +
+ this.ins.reduce(function (sum, input) { return sum + 40 + scriptSize(input.script) }, 0) +
+ this.outs.reduce(function (sum, output) { return sum + 8 + scriptSize(output.script) }, 0)
+ )
+
+ var offset = 0
+ function writeSlice (slice) {
+ slice.copy(buffer, offset)
+ offset += slice.length
+ }
+
+ function writeUInt32 (i) {
+ buffer.writeUInt32LE(i, offset)
+ offset += 4
+ }
+
+ function writeUInt64 (i) {
+ bufferutils.writeUInt64LE(buffer, i, offset)
+ offset += 8
+ }
+
+ function writeVarInt (i) {
+ var n = bufferutils.writeVarInt(buffer, i, offset)
+ offset += n
+ }
+
+ writeUInt32(this.version)
+ writeVarInt(this.ins.length)
+
+ this.ins.forEach(function (txIn) {
+ writeSlice(txIn.hash)
+ writeUInt32(txIn.index)
+ writeVarInt(txIn.script.buffer.length)
+ writeSlice(txIn.script.buffer)
+ writeUInt32(txIn.sequence)
+ })
+
+ writeVarInt(this.outs.length)
+ this.outs.forEach(function (txOut) {
+ writeUInt64(txOut.value)
+ writeVarInt(txOut.script.buffer.length)
+ writeSlice(txOut.script.buffer)
+ })
+
+ writeUInt32(this.locktime)
+
+ return buffer
+}
+
+Transaction.prototype.toHex = function () {
+ return this.toBuffer().toString('hex')
+}
+
+Transaction.prototype.setInputScript = function (index, script) {
+ typeForce('Number', index)
+ typeForce('Script', script)
+
+ this.ins[index].script = script
+}
+
+// FIXME: remove in 2.x.y
+Transaction.prototype.sign = function (index, privKey, hashType) {
+ console.warn('Transaction.prototype.sign is deprecated. Use TransactionBuilder instead.')
+
+ var prevOutScript = privKey.pub.getAddress().toOutputScript()
+ var signature = this.signInput(index, prevOutScript, privKey, hashType)
+
+ var scriptSig = scripts.pubKeyHashInput(signature, privKey.pub)
+ this.setInputScript(index, scriptSig)
+}
+
+// FIXME: remove in 2.x.y
+Transaction.prototype.signInput = function (index, prevOutScript, privKey, hashType) {
+ console.warn('Transaction.prototype.signInput is deprecated. Use TransactionBuilder instead.')
+
+ hashType = hashType || Transaction.SIGHASH_ALL
+
+ var hash = this.hashForSignature(index, prevOutScript, hashType)
+ var signature = privKey.sign(hash)
+
+ return signature.toScriptSignature(hashType)
+}
+
+// FIXME: remove in 2.x.y
+Transaction.prototype.validateInput = function (index, prevOutScript, pubKey, buffer) {
+ console.warn('Transaction.prototype.validateInput is deprecated. Use TransactionBuilder instead.')
+
+ var parsed = ECSignature.parseScriptSignature(buffer)
+ var hash = this.hashForSignature(index, prevOutScript, parsed.hashType)
+
+ return pubKey.verify(hash, parsed.signature)
+}
+
+module.exports = Transaction
+
+}).call(this,require("buffer").Buffer)
+},{"./address":54,"./bufferutils":57,"./crypto":58,"./ecsignature":62,"./opcodes":67,"./script":68,"./scripts":69,"assert":5,"buffer":7,"typeforce":53}],71:[function(require,module,exports){
+(function (Buffer){
+var assert = require('assert')
+var ops = require('./opcodes')
+var scripts = require('./scripts')
+
+var ECPubKey = require('./ecpubkey')
+var ECSignature = require('./ecsignature')
+var Script = require('./script')
+var Transaction = require('./transaction')
+
+function extractInput (txIn) {
+ var redeemScript
+ var scriptSig = txIn.script
+ var prevOutScript
+ var prevOutType = scripts.classifyInput(scriptSig, true)
+ var scriptType
+
+ // Re-classify if scriptHash
+ if (prevOutType === 'scripthash') {
+ redeemScript = Script.fromBuffer(scriptSig.chunks.slice(-1)[0])
+ prevOutScript = scripts.scriptHashOutput(redeemScript.getHash())
+
+ scriptSig = Script.fromChunks(scriptSig.chunks.slice(0, -1))
+ scriptType = scripts.classifyInput(scriptSig, true)
+ } else {
+ scriptType = prevOutType
+ }
+
+ // Extract hashType, pubKeys and signatures
+ var hashType, parsed, pubKeys, signatures
+
+ switch (scriptType) {
+ case 'pubkeyhash': {
+ parsed = ECSignature.parseScriptSignature(scriptSig.chunks[0])
+ hashType = parsed.hashType
+ pubKeys = [ECPubKey.fromBuffer(scriptSig.chunks[1])]
+ signatures = [parsed.signature]
+ prevOutScript = pubKeys[0].getAddress().toOutputScript()
+
+ break
+ }
+
+ case 'pubkey': {
+ parsed = ECSignature.parseScriptSignature(scriptSig.chunks[0])
+ hashType = parsed.hashType
+ signatures = [parsed.signature]
+
+ if (redeemScript) {
+ pubKeys = [ECPubKey.fromBuffer(redeemScript.chunks[0])]
+ }
+
+ break
+ }
+
+ case 'multisig': {
+ signatures = scriptSig.chunks.slice(1).map(function (chunk) {
+ if (chunk === ops.OP_0) return chunk
+
+ var parsed = ECSignature.parseScriptSignature(chunk)
+ hashType = parsed.hashType
+
+ return parsed.signature
+ })
+
+ if (redeemScript) {
+ pubKeys = redeemScript.chunks.slice(1, -2).map(ECPubKey.fromBuffer)
+ }
+
+ break
+ }
+ }
+
+ return {
+ hashType: hashType,
+ prevOutScript: prevOutScript,
+ prevOutType: prevOutType,
+ pubKeys: pubKeys,
+ redeemScript: redeemScript,
+ scriptType: scriptType,
+ signatures: signatures
+ }
+}
+
+function TransactionBuilder () {
+ this.prevTxMap = {}
+ this.prevOutScripts = {}
+ this.prevOutTypes = {}
+
+ this.inputs = []
+ this.tx = new Transaction()
+}
+
+TransactionBuilder.fromTransaction = function (transaction) {
+ var txb = new TransactionBuilder()
+
+ // Copy other transaction fields
+ txb.tx.version = transaction.version
+ txb.tx.locktime = transaction.locktime
+
+ // Extract/add inputs
+ transaction.ins.forEach(function (txIn) {
+ txb.addInput(txIn.hash, txIn.index, txIn.sequence)
+ })
+
+ // Extract/add outputs
+ transaction.outs.forEach(function (txOut) {
+ txb.addOutput(txOut.script, txOut.value)
+ })
+
+ // Extract/add signatures
+ txb.inputs = transaction.ins.map(function (txIn) {
+ // TODO: remove me after testcase added
+ assert(!Transaction.isCoinbaseHash(txIn.hash), 'coinbase inputs not supported')
+
+ // Ignore empty scripts
+ if (txIn.script.buffer.length === 0) return {}
+
+ return extractInput(txIn)
+ })
+
+ return txb
+}
+
+TransactionBuilder.prototype.addInput = function (prevTx, index, sequence, prevOutScript) {
+ var prevOutHash
+
+ // txId
+ if (typeof prevTx === 'string') {
+ prevOutHash = new Buffer(prevTx, 'hex')
+
+ // TxId hex is big-endian, we want little-endian hash
+ Array.prototype.reverse.call(prevOutHash)
+
+ // Transaction
+ } else if (prevTx instanceof Transaction) {
+ prevOutHash = prevTx.getHash()
+ prevOutScript = prevTx.outs[index].script
+
+ // txHash
+ } else {
+ prevOutHash = prevTx
+ }
+
+ var input = {}
+ if (prevOutScript) {
+ var prevOutType = scripts.classifyOutput(prevOutScript)
+
+ // if we can, extract pubKey information
+ switch (prevOutType) {
+ case 'multisig': {
+ input.pubKeys = prevOutScript.chunks.slice(1, -2).map(ECPubKey.fromBuffer)
+ break
+ }
+
+ case 'pubkey': {
+ input.pubKeys = prevOutScript.chunks.slice(0, 1).map(ECPubKey.fromBuffer)
+ break
+ }
+ }
+
+ if (prevOutType !== 'scripthash') {
+ input.scriptType = prevOutType
+ }
+
+ input.prevOutScript = prevOutScript
+ input.prevOutType = prevOutType
+ }
+
+ assert(this.inputs.every(function (input2) {
+ if (input2.hashType === undefined) return true
+
+ return input2.hashType & Transaction.SIGHASH_ANYONECANPAY
+ }), 'No, this would invalidate signatures')
+
+ var prevOut = prevOutHash.toString('hex') + ':' + index
+ assert(!(prevOut in this.prevTxMap), 'Transaction is already an input')
+
+ var vin = this.tx.addInput(prevOutHash, index, sequence)
+ this.inputs[vin] = input
+ this.prevTxMap[prevOut] = vin
+
+ return vin
+}
+
+TransactionBuilder.prototype.addOutput = function (scriptPubKey, value) {
+ assert(this.inputs.every(function (input) {
+ if (input.hashType === undefined) return true
+
+ return (input.hashType & 0x1f) === Transaction.SIGHASH_SINGLE
+ }), 'No, this would invalidate signatures')
+
+ return this.tx.addOutput(scriptPubKey, value)
+}
+
+TransactionBuilder.prototype.build = function () {
+ return this.__build(false)
+}
+TransactionBuilder.prototype.buildIncomplete = function () {
+ return this.__build(true)
+}
+
+var canSignTypes = {
+ 'pubkeyhash': true,
+ 'multisig': true,
+ 'pubkey': true
+}
+
+TransactionBuilder.prototype.__build = function (allowIncomplete) {
+ if (!allowIncomplete) {
+ assert(this.tx.ins.length > 0, 'Transaction has no inputs')
+ assert(this.tx.outs.length > 0, 'Transaction has no outputs')
+ }
+
+ var tx = this.tx.clone()
+
+ // Create script signatures from signature meta-data
+ this.inputs.forEach(function (input, index) {
+ var scriptType = input.scriptType
+ var scriptSig
+
+ if (!allowIncomplete) {
+ assert(!!scriptType, 'Transaction is not complete')
+ assert(scriptType in canSignTypes, scriptType + ' not supported')
+ assert(input.signatures, 'Transaction is missing signatures')
+ }
+
+ if (input.signatures) {
+ switch (scriptType) {
+ case 'pubkeyhash': {
+ var pkhSignature = input.signatures[0].toScriptSignature(input.hashType)
+ scriptSig = scripts.pubKeyHashInput(pkhSignature, input.pubKeys[0])
+ break
+ }
+
+ case 'multisig': {
+ // Array.prototype.map is sparse-compatible
+ var msSignatures = input.signatures.map(function (signature) {
+ return signature && signature.toScriptSignature(input.hashType)
+ })
+
+ // fill in blanks with OP_0
+ if (allowIncomplete) {
+ for (var i = 0; i < msSignatures.length; ++i) {
+ if (msSignatures[i]) continue
+
+ msSignatures[i] = ops.OP_0
+ }
+ } else {
+ // Array.prototype.filter returns non-sparse array
+ msSignatures = msSignatures.filter(function (x) { return x })
+ }
+
+ var redeemScript = allowIncomplete ? undefined : input.redeemScript
+ scriptSig = scripts.multisigInput(msSignatures, redeemScript)
+ break
+ }
+
+ case 'pubkey': {
+ var pkSignature = input.signatures[0].toScriptSignature(input.hashType)
+ scriptSig = scripts.pubKeyInput(pkSignature)
+ break
+ }
+ }
+ }
+
+ // did we build a scriptSig?
+ if (scriptSig) {
+ // wrap as scriptHash if necessary
+ if (input.prevOutType === 'scripthash') {
+ scriptSig = scripts.scriptHashInput(scriptSig, input.redeemScript)
+ }
+
+ tx.setInputScript(index, scriptSig)
+ }
+ })
+
+ return tx
+}
+
+TransactionBuilder.prototype.sign = function (index, privKey, redeemScript, hashType) {
+ assert(index in this.inputs, 'No input at index: ' + index)
+ hashType = hashType || Transaction.SIGHASH_ALL
+
+ var input = this.inputs[index]
+ var canSign = input.hashType &&
+ input.prevOutScript &&
+ input.prevOutType &&
+ input.pubKeys &&
+ input.scriptType &&
+ input.signatures
+
+ // are we almost ready to sign?
+ if (canSign) {
+ // if redeemScript was provided, enforce consistency
+ if (redeemScript) {
+ assert.deepEqual(input.redeemScript, redeemScript, 'Inconsistent redeemScript')
+ }
+
+ assert.equal(input.hashType, hashType, 'Inconsistent hashType')
+
+ // no? prepare
+ } else {
+ // must be pay-to-scriptHash?
+ if (redeemScript) {
+ // if we have a prevOutScript, enforce scriptHash equality to the redeemScript
+ if (input.prevOutScript) {
+ assert.equal(input.prevOutType, 'scripthash', 'PrevOutScript must be P2SH')
+
+ var scriptHash = input.prevOutScript.chunks[1]
+ assert.deepEqual(scriptHash, redeemScript.getHash(), 'RedeemScript does not match ' + scriptHash.toString('hex'))
+ }
+
+ var scriptType = scripts.classifyOutput(redeemScript)
+ assert(scriptType in canSignTypes, 'RedeemScript not supported (' + scriptType + ')')
+
+ var pubKeys = []
+ switch (scriptType) {
+ case 'multisig': {
+ pubKeys = redeemScript.chunks.slice(1, -2).map(ECPubKey.fromBuffer)
+ break
+ }
+
+ case 'pubkeyhash': {
+ var pkh1 = redeemScript.chunks[2]
+ var pkh2 = privKey.pub.getAddress().hash
+
+ assert.deepEqual(pkh1, pkh2, 'privateKey cannot sign for this input')
+ pubKeys = [privKey.pub]
+ break
+ }
+
+ case 'pubkey': {
+ pubKeys = redeemScript.chunks.slice(0, 1).map(ECPubKey.fromBuffer)
+ break
+ }
+ }
+
+ if (!input.prevOutScript) {
+ input.prevOutScript = scripts.scriptHashOutput(redeemScript.getHash())
+ input.prevOutType = 'scripthash'
+ }
+
+ input.pubKeys = pubKeys
+ input.redeemScript = redeemScript
+ input.scriptType = scriptType
+
+ // cannot be pay-to-scriptHash
+ } else {
+ assert.notEqual(input.prevOutType, 'scripthash', 'PrevOutScript is P2SH, missing redeemScript')
+
+ // can we otherwise sign this?
+ if (input.scriptType) {
+ assert(input.pubKeys, input.scriptType + ' not supported')
+
+ // we know nothin' Jon Snow, assume pubKeyHash
+ } else {
+ input.prevOutScript = privKey.pub.getAddress().toOutputScript()
+ input.prevOutType = 'pubkeyhash'
+ input.pubKeys = [privKey.pub]
+ input.scriptType = input.prevOutType
+ }
+ }
+
+ input.hashType = hashType
+ input.signatures = input.signatures || []
+ }
+
+ var signatureScript = input.redeemScript || input.prevOutScript
+ var signatureHash = this.tx.hashForSignature(index, signatureScript, hashType)
+
+ // enforce signature order matches public keys
+ if (input.scriptType === 'multisig' && input.redeemScript && input.signatures.length !== input.pubKeys.length) {
+ // maintain a local copy of unmatched signatures
+ var unmatched = input.signatures.slice()
+
+ input.signatures = input.pubKeys.map(function (pubKey) {
+ var match
+
+ // check for any matching signatures
+ unmatched.some(function (signature, i) {
+ if (!pubKey.verify(signatureHash, signature)) return false
+ match = signature
+
+ // remove matched signature from unmatched
+ unmatched.splice(i, 1)
+
+ return true
+ })
+
+ return match || undefined
+ })
+ }
+
+ // enforce in order signing of public keys
+ assert(input.pubKeys.some(function (pubKey, i) {
+ if (!privKey.pub.Q.equals(pubKey.Q)) return false
+
+ assert(!input.signatures[i], 'Signature already exists')
+ var signature = privKey.sign(signatureHash)
+ input.signatures[i] = signature
+
+ return true
+ }, this), 'privateKey cannot sign for this input')
+}
+
+module.exports = TransactionBuilder
+
+}).call(this,require("buffer").Buffer)
+},{"./ecpubkey":61,"./ecsignature":62,"./opcodes":67,"./script":68,"./scripts":69,"./transaction":70,"assert":5,"buffer":7}],72:[function(require,module,exports){
+(function (Buffer){
+var assert = require('assert')
+var bufferutils = require('./bufferutils')
+var typeForce = require('typeforce')
+var networks = require('./networks')
+var randomBytes = require('randombytes')
+
+var Address = require('./address')
+var HDNode = require('./hdnode')
+var TransactionBuilder = require('./transaction_builder')
+var Script = require('./script')
+
+function Wallet (seed, network) {
+ console.warn('Wallet is deprecated and will be removed in 2.0.0, see #296')
+
+ seed = seed || randomBytes(32)
+ network = network || networks.bitcoin
+
+ // Stored in a closure to make accidental serialization less likely
+ var masterKey = HDNode.fromSeedBuffer(seed, network)
+
+ // HD first-level child derivation method should be hardened
+ // See https://bitcointalk.org/index.php?topic=405179.msg4415254#msg4415254
+ var accountZero = masterKey.deriveHardened(0)
+ var externalAccount = accountZero.derive(0)
+ var internalAccount = accountZero.derive(1)
+
+ this.addresses = []
+ this.changeAddresses = []
+ this.network = network
+ this.unspents = []
+
+ // FIXME: remove in 2.0.0
+ this.unspentMap = {}
+
+ // FIXME: remove in 2.0.0
+ var me = this
+ this.newMasterKey = function (seed) {
+ console.warn('newMasterKey is deprecated, please make a new Wallet instance instead')
+
+ seed = seed || randomBytes(32)
+ masterKey = HDNode.fromSeedBuffer(seed, network)
+
+ accountZero = masterKey.deriveHardened(0)
+ externalAccount = accountZero.derive(0)
+ internalAccount = accountZero.derive(1)
+
+ me.addresses = []
+ me.changeAddresses = []
+
+ me.unspents = []
+ me.unspentMap = {}
+ }
+
+ this.getMasterKey = function () {
+ return masterKey
+ }
+ this.getAccountZero = function () {
+ return accountZero
+ }
+ this.getExternalAccount = function () {
+ return externalAccount
+ }
+ this.getInternalAccount = function () {
+ return internalAccount
+ }
+}
+
+Wallet.prototype.createTransaction = function (to, value, options) {
+ // FIXME: remove in 2.0.0
+ if (typeof options !== 'object') {
+ if (options !== undefined) {
+ console.warn('Non options object parameters are deprecated, use options object instead')
+
+ options = {
+ fixedFee: arguments[2],
+ changeAddress: arguments[3]
+ }
+ }
+ }
+
+ options = options || {}
+
+ assert(value > this.network.dustThreshold, value + ' must be above dust threshold (' + this.network.dustThreshold + ' Satoshis)')
+
+ var changeAddress = options.changeAddress
+ var fixedFee = options.fixedFee
+ var minConf = options.minConf === undefined ? 0 : options.minConf // FIXME: change minConf:1 by default in 2.0.0
+
+ // filter by minConf, then pending and sort by descending value
+ var unspents = this.unspents.filter(function (unspent) {
+ return unspent.confirmations >= minConf
+ }).filter(function (unspent) {
+ return !unspent.pending
+ }).sort(function (o1, o2) {
+ return o2.value - o1.value
+ })
+
+ var accum = 0
+ var addresses = []
+ var subTotal = value
+
+ var txb = new TransactionBuilder()
+ txb.addOutput(to, value)
+
+ for (var i = 0; i < unspents.length; ++i) {
+ var unspent = unspents[i]
+ addresses.push(unspent.address)
+
+ txb.addInput(unspent.txHash, unspent.index)
+
+ var fee = fixedFee === undefined ? estimatePaddedFee(txb.buildIncomplete(), this.network) : fixedFee
+
+ accum += unspent.value
+ subTotal = value + fee
+
+ if (accum >= subTotal) {
+ var change = accum - subTotal
+
+ if (change > this.network.dustThreshold) {
+ txb.addOutput(changeAddress || this.getChangeAddress(), change)
+ }
+
+ break
+ }
+ }
+
+ assert(accum >= subTotal, 'Not enough funds (incl. fee): ' + accum + ' < ' + subTotal)
+
+ return this.signWith(txb, addresses).build()
+}
+
+// FIXME: remove in 2.0.0
+Wallet.prototype.processPendingTx = function (tx) {
+ this.__processTx(tx, true)
+}
+
+// FIXME: remove in 2.0.0
+Wallet.prototype.processConfirmedTx = function (tx) {
+ this.__processTx(tx, false)
+}
+
+// FIXME: remove in 2.0.0
+Wallet.prototype.__processTx = function (tx, isPending) {
+ console.warn('processTransaction is considered harmful, see issue #260 for more information')
+
+ var txId = tx.getId()
+ var txHash = tx.getHash()
+
+ tx.outs.forEach(function (txOut, i) {
+ var address
+
+ try {
+ address = Address.fromOutputScript(txOut.script, this.network).toString()
+ } catch (e) {
+ if (!(e.message.match(/has no matching Address/)))
+ throw e
+ }
+
+ var myAddresses = this.addresses.concat(this.changeAddresses)
+ if (myAddresses.indexOf(address) > -1) {
+ var lookup = txId + ':' + i
+ if (lookup in this.unspentMap) return
+
+ // its unique, add it
+ var unspent = {
+ address: address,
+ confirmations: 0, // no way to determine this without more information
+ index: i,
+ txHash: txHash,
+ txId: txId,
+ value: txOut.value,
+ pending: isPending
+ }
+
+ this.unspentMap[lookup] = unspent
+ this.unspents.push(unspent)
+ }
+ }, this)
+
+ tx.ins.forEach(function (txIn) {
+ // copy and convert to big-endian hex
+ var txInId = bufferutils.reverse(txIn.hash).toString('hex')
+
+ var lookup = txInId + ':' + txIn.index
+ if (!(lookup in this.unspentMap)) return
+
+ var unspent = this.unspentMap[lookup]
+
+ if (isPending) {
+ unspent.pending = true
+ unspent.spent = true
+ } else {
+ delete this.unspentMap[lookup]
+
+ this.unspents = this.unspents.filter(function (unspent2) {
+ return unspent !== unspent2
+ })
+ }
+ }, this)
+}
+
+Wallet.prototype.generateAddress = function () {
+ var k = this.addresses.length
+ var address = this.getExternalAccount().derive(k).getAddress()
+
+ this.addresses.push(address.toString())
+
+ return this.getReceiveAddress()
+}
+
+Wallet.prototype.generateChangeAddress = function () {
+ var k = this.changeAddresses.length
+ var address = this.getInternalAccount().derive(k).getAddress()
+
+ this.changeAddresses.push(address.toString())
+
+ return this.getChangeAddress()
+}
+
+Wallet.prototype.getAddress = function () {
+ if (this.addresses.length === 0) {
+ this.generateAddress()
+ }
+
+ return this.addresses[this.addresses.length - 1]
+}
+
+Wallet.prototype.getBalance = function (minConf) {
+ minConf = minConf || 0
+
+ return this.unspents.filter(function (unspent) {
+ return unspent.confirmations >= minConf
+
+ // FIXME: remove spent filter in 2.0.0
+ }).filter(function (unspent) {
+ return !unspent.spent
+ }).reduce(function (accum, unspent) {
+ return accum + unspent.value
+ }, 0)
+}
+
+Wallet.prototype.getChangeAddress = function () {
+ if (this.changeAddresses.length === 0) {
+ this.generateChangeAddress()
+ }
+
+ return this.changeAddresses[this.changeAddresses.length - 1]
+}
+
+Wallet.prototype.getInternalPrivateKey = function (index) {
+ return this.getInternalAccount().derive(index).privKey
+}
+
+Wallet.prototype.getPrivateKey = function (index) {
+ return this.getExternalAccount().derive(index).privKey
+}
+
+Wallet.prototype.getPrivateKeyForAddress = function (address) {
+ var index
+
+ if ((index = this.addresses.indexOf(address)) > -1) {
+ return this.getPrivateKey(index)
+ }
+
+ if ((index = this.changeAddresses.indexOf(address)) > -1) {
+ return this.getInternalPrivateKey(index)
+ }
+
+ assert(false, 'Unknown address. Make sure the address is from the keychain and has been generated')
+}
+
+Wallet.prototype.getUnspentOutputs = function (minConf) {
+ minConf = minConf || 0
+
+ return this.unspents.filter(function (unspent) {
+ return unspent.confirmations >= minConf
+
+ // FIXME: remove spent filter in 2.0.0
+ }).filter(function (unspent) {
+ return !unspent.spent
+ }).map(function (unspent) {
+ return {
+ address: unspent.address,
+ confirmations: unspent.confirmations,
+ index: unspent.index,
+ txId: unspent.txId,
+ value: unspent.value,
+
+ // FIXME: remove in 2.0.0
+ hash: unspent.txId,
+ pending: unspent.pending
+ }
+ })
+}
+
+Wallet.prototype.setUnspentOutputs = function (unspents) {
+ this.unspentMap = {}
+ this.unspents = unspents.map(function (unspent) {
+ // FIXME: remove unspent.hash in 2.0.0
+ var txId = unspent.txId || unspent.hash
+ var index = unspent.index
+
+ // FIXME: remove in 2.0.0
+ if (unspent.hash !== undefined) {
+ console.warn('unspent.hash is deprecated, use unspent.txId instead')
+ }
+
+ // FIXME: remove in 2.0.0
+ if (index === undefined) {
+ console.warn('unspent.outputIndex is deprecated, use unspent.index instead')
+ index = unspent.outputIndex
+ }
+
+ typeForce('String', txId)
+ typeForce('Number', index)
+ typeForce('Number', unspent.value)
+
+ assert.equal(txId.length, 64, 'Expected valid txId, got ' + txId)
+ assert.doesNotThrow(function () {
+ Address.fromBase58Check(unspent.address)
+ }, 'Expected Base58 Address, got ' + unspent.address)
+ assert(isFinite(index), 'Expected finite index, got ' + index)
+
+ // FIXME: remove branch in 2.0.0
+ if (unspent.confirmations !== undefined) {
+ typeForce('Number', unspent.confirmations)
+ }
+
+ var txHash = bufferutils.reverse(new Buffer(txId, 'hex'))
+
+ unspent = {
+ address: unspent.address,
+ confirmations: unspent.confirmations || 0,
+ index: index,
+ txHash: txHash,
+ txId: txId,
+ value: unspent.value,
+
+ // FIXME: remove in 2.0.0
+ pending: unspent.pending || false
+ }
+
+ // FIXME: remove in 2.0.0
+ this.unspentMap[txId + ':' + index] = unspent
+
+ return unspent
+ }, this)
+}
+
+Wallet.prototype.signWith = function (tx, addresses) {
+ addresses.forEach(function (address, i) {
+ var privKey = this.getPrivateKeyForAddress(address)
+
+ tx.sign(i, privKey)
+ }, this)
+
+ return tx
+}
+
+function estimatePaddedFee (tx, network) {
+ var tmpTx = tx.clone()
+ tmpTx.addOutput(Script.EMPTY, network.dustSoftThreshold || 0)
+
+ return network.estimateFee(tmpTx)
+}
+
+// FIXME: 1.0.0 shims, remove in 2.0.0
+Wallet.prototype.getReceiveAddress = Wallet.prototype.getAddress
+Wallet.prototype.createTx = Wallet.prototype.createTransaction
+
+module.exports = Wallet
+
+}).call(this,require("buffer").Buffer)
+},{"./address":54,"./bufferutils":57,"./hdnode":63,"./networks":66,"./script":68,"./transaction_builder":71,"assert":5,"buffer":7,"randombytes":52,"typeforce":53}]},{},[64])(64)
+});</script>
+ <script>bitcoin.networks.shadow = {
+ magicPrefix: '\x19ShadowCash Signed Message:\n',
+ bip32: {
+ public: 0xEE80286A,
+ private: 0xEE8031E8
+ },
+ pubKeyHash: 0x3f,
+ scriptHash: 0x7d,
+ wif: 0xbf,
+ dustThreshold: 0,
+ feePerKb: 1000,
+ estimateFee: function() { return "unused in this app" },
+};
+
+bitcoin.networks.shadowtn = {
+ magicPrefix: '\x19ShadowCash Signed Message:\n',
+ bip32: {
+ public: 0x76C0FDFB,
+ private: 0x76C1077A
+ },
+ pubKeyHash: 0x7f,
+ scriptHash: 0xc4,
+ wif: 0xff,
+ dustThreshold: 0,
+ feePerKb: 1000,
+ estimateFee: function() { return "unused in this app" },
+};
+
+bitcoin.networks.clam = {
+ bip32: {
+ public: 0xa8c26d64,
+ private: 0xa8c17826
+ },
+ pubKeyHash: 0x89,
+ wif: 0x85,
+};
+
+bitcoin.networks.dash = {
+ bip32: {
+ public: 0x0488b21e,
+ private: 0x0488ade4
+ },
+ pubKeyHash: 0x4c,
+ scriptHash: 0x10,
+ wif: 0xcc,
+};
+
+bitcoin.networks.namecoin = {
+ bip32: {
+ public: 0x0488b21e,
+ private: 0x0488ade4
+ },
+ pubKeyHash: 0x34,
+ //scriptHash: 0x10,
+ wif: 0x80,
+};
+
+bitcoin.networks.peercoin = {
+ bip32: {
+ public: 0x0488b21e,
+ private: 0x0488ade4
+ },
+ pubKeyHash: 0x37,
+ //scriptHash: 0x10,
+ wif: 0xb7,
+};
+
+</script>
+ <script>// Select components from sjcl to suit the crypto operations bip39 requires.
+
+//// base.js
+
+/** @fileOverview Javascript cryptography implementation.
+ *
+ * Crush to remove comments, shorten variable names and
+ * generally reduce transmission size.
+ *
+ * @author Emily Stark
+ * @author Mike Hamburg
+ * @author Dan Boneh
+ */
+
+"use strict";
+/*jslint indent: 2, bitwise: false, nomen: false, plusplus: false, white: false, regexp: false */
+/*global document, window, escape, unescape, module, require, Uint32Array */
+
+/** @namespace The Stanford Javascript Crypto Library, top-level namespace. */
+var sjcl = {
+ /** @namespace Symmetric ciphers. */
+ cipher: {},
+
+ /** @namespace Hash functions. Right now only SHA256 is implemented. */
+ hash: {},
+
+ /** @namespace Key exchange functions. Right now only SRP is implemented. */
+ keyexchange: {},
+
+ /** @namespace Block cipher modes of operation. */
+ mode: {},
+
+ /** @namespace Miscellaneous. HMAC and PBKDF2. */
+ misc: {},
+
+ /**
+ * @namespace Bit array encoders and decoders.
+ *
+ * @description
+ * The members of this namespace are functions which translate between
+ * SJCL's bitArrays and other objects (usually strings). Because it
+ * isn't always clear which direction is encoding and which is decoding,
+ * the method names are "fromBits" and "toBits".
+ */
+ codec: {},
+
+ /** @namespace Exceptions. */
+ exception: {
+ /** @constructor Ciphertext is corrupt. */
+ corrupt: function(message) {
+ this.toString = function() { return "CORRUPT: "+this.message; };
+ this.message = message;
+ },
+
+ /** @constructor Invalid parameter. */
+ invalid: function(message) {
+ this.toString = function() { return "INVALID: "+this.message; };
+ this.message = message;
+ },
+
+ /** @constructor Bug or missing feature in SJCL. @constructor */
+ bug: function(message) {
+ this.toString = function() { return "BUG: "+this.message; };
+ this.message = message;
+ },
+
+ /** @constructor Something isn't ready. */
+ notReady: function(message) {
+ this.toString = function() { return "NOT READY: "+this.message; };
+ this.message = message;
+ }
+ }
+};
+
+if(typeof module !== 'undefined' && module.exports){
+ module.exports = sjcl;
+}
+if (typeof define === "function") {
+ define([], function () {
+ return sjcl;
+ });
+}
+
+
+//// bitArray.js
+
+/** @fileOverview Arrays of bits, encoded as arrays of Numbers.
+ *
+ * @author Emily Stark
+ * @author Mike Hamburg
+ * @author Dan Boneh
+ */
+
+/** @namespace Arrays of bits, encoded as arrays of Numbers.
+ *
+ * @description
+ * <p>
+ * These objects are the currency accepted by SJCL's crypto functions.
+ * </p>
+ *
+ * <p>
+ * Most of our crypto primitives operate on arrays of 4-byte words internally,
+ * but many of them can take arguments that are not a multiple of 4 bytes.
+ * This library encodes arrays of bits (whose size need not be a multiple of 8
+ * bits) as arrays of 32-bit words. The bits are packed, big-endian, into an
+ * array of words, 32 bits at a time. Since the words are double-precision
+ * floating point numbers, they fit some extra data. We use this (in a private,
+ * possibly-changing manner) to encode the number of bits actually present
+ * in the last word of the array.
+ * </p>
+ *
+ * <p>
+ * Because bitwise ops clear this out-of-band data, these arrays can be passed
+ * to ciphers like AES which want arrays of words.
+ * </p>
+ */
+sjcl.bitArray = {
+ /**
+ * Array slices in units of bits.
+ * @param {bitArray} a The array to slice.
+ * @param {Number} bstart The offset to the start of the slice, in bits.
+ * @param {Number} bend The offset to the end of the slice, in bits. If this is undefined,
+ * slice until the end of the array.
+ * @return {bitArray} The requested slice.
+ */
+ bitSlice: function (a, bstart, bend) {
+ a = sjcl.bitArray._shiftRight(a.slice(bstart/32), 32 - (bstart & 31)).slice(1);
+ return (bend === undefined) ? a : sjcl.bitArray.clamp(a, bend-bstart);
+ },
+
+ /**
+ * Extract a number packed into a bit array.
+ * @param {bitArray} a The array to slice.
+ * @param {Number} bstart The offset to the start of the slice, in bits.
+ * @param {Number} length The length of the number to extract.
+ * @return {Number} The requested slice.
+ */
+ extract: function(a, bstart, blength) {
+ // FIXME: this Math.floor is not necessary at all, but for some reason
+ // seems to suppress a bug in the Chromium JIT.
+ var x, sh = Math.floor((-bstart-blength) & 31);
+ if ((bstart + blength - 1 ^ bstart) & -32) {
+ // it crosses a boundary
+ x = (a[bstart/32|0] << (32 - sh)) ^ (a[bstart/32+1|0] >>> sh);
+ } else {
+ // within a single word
+ x = a[bstart/32|0] >>> sh;
+ }
+ return x & ((1<<blength) - 1);
+ },
+
+ /**
+ * Concatenate two bit arrays.
+ * @param {bitArray} a1 The first array.
+ * @param {bitArray} a2 The second array.
+ * @return {bitArray} The concatenation of a1 and a2.
+ */
+ concat: function (a1, a2) {
+ if (a1.length === 0 || a2.length === 0) {
+ return a1.concat(a2);
+ }
+
+ var last = a1[a1.length-1], shift = sjcl.bitArray.getPartial(last);
+ if (shift === 32) {
+ return a1.concat(a2);
+ } else {
+ return sjcl.bitArray._shiftRight(a2, shift, last|0, a1.slice(0,a1.length-1));
+ }
+ },
+
+ /**
+ * Find the length of an array of bits.
+ * @param {bitArray} a The array.
+ * @return {Number} The length of a, in bits.
+ */
+ bitLength: function (a) {
+ var l = a.length, x;
+ if (l === 0) { return 0; }
+ x = a[l - 1];
+ return (l-1) * 32 + sjcl.bitArray.getPartial(x);
+ },
+
+ /**
+ * Truncate an array.
+ * @param {bitArray} a The array.
+ * @param {Number} len The length to truncate to, in bits.
+ * @return {bitArray} A new array, truncated to len bits.
+ */
+ clamp: function (a, len) {
+ if (a.length * 32 < len) { return a; }
+ a = a.slice(0, Math.ceil(len / 32));
+ var l = a.length;
+ len = len & 31;
+ if (l > 0 && len) {
+ a[l-1] = sjcl.bitArray.partial(len, a[l-1] & 0x80000000 >> (len-1), 1);
+ }
+ return a;
+ },
+
+ /**
+ * Make a partial word for a bit array.
+ * @param {Number} len The number of bits in the word.
+ * @param {Number} x The bits.
+ * @param {Number} [0] _end Pass 1 if x has already been shifted to the high side.
+ * @return {Number} The partial word.
+ */
+ partial: function (len, x, _end) {
+ if (len === 32) { return x; }
+ return (_end ? x|0 : x << (32-len)) + len * 0x10000000000;
+ },
+
+ /**
+ * Get the number of bits used by a partial word.
+ * @param {Number} x The partial word.
+ * @return {Number} The number of bits used by the partial word.
+ */
+ getPartial: function (x) {
+ return Math.round(x/0x10000000000) || 32;
+ },
+
+ /**
+ * Compare two arrays for equality in a predictable amount of time.
+ * @param {bitArray} a The first array.
+ * @param {bitArray} b The second array.
+ * @return {boolean} true if a == b; false otherwise.
+ */
+ equal: function (a, b) {
+ if (sjcl.bitArray.bitLength(a) !== sjcl.bitArray.bitLength(b)) {
+ return false;
+ }
+ var x = 0, i;
+ for (i=0; i<a.length; i++) {
+ x |= a[i]^b[i];
+ }
+ return (x === 0);
+ },
+
+ /** Shift an array right.
+ * @param {bitArray} a The array to shift.
+ * @param {Number} shift The number of bits to shift.
+ * @param {Number} [carry=0] A byte to carry in
+ * @param {bitArray} [out=[]] An array to prepend to the output.
+ * @private
+ */
+ _shiftRight: function (a, shift, carry, out) {
+ var i, last2=0, shift2;
+ if (out === undefined) { out = []; }
+
+ for (; shift >= 32; shift -= 32) {
+ out.push(carry);
+ carry = 0;
+ }
+ if (shift === 0) {
+ return out.concat(a);
+ }
+
+ for (i=0; i<a.length; i++) {
+ out.push(carry | a[i]>>>shift);
+ carry = a[i] << (32-shift);
+ }
+ last2 = a.length ? a[a.length-1] : 0;
+ shift2 = sjcl.bitArray.getPartial(last2);
+ out.push(sjcl.bitArray.partial(shift+shift2 & 31, (shift + shift2 > 32) ? carry : out.pop(),1));
+ return out;
+ },
+
+ /** xor a block of 4 words together.
+ * @private
+ */
+ _xor4: function(x,y) {
+ return [x[0]^y[0],x[1]^y[1],x[2]^y[2],x[3]^y[3]];
+ },
+
+ /** byteswap a word array inplace.
+ * (does not handle partial words)
+ * @param {sjcl.bitArray} a word array
+ * @return {sjcl.bitArray} byteswapped array
+ */
+ byteswapM: function(a) {
+ var i, v, m = 0xff00;
+ for (i = 0; i < a.length; ++i) {
+ v = a[i];
+ a[i] = (v >>> 24) | ((v >>> 8) & m) | ((v & m) << 8) | (v << 24);
+ }
+ return a;
+ }
+};
+
+
+//// codecString.js
+
+/** @fileOverview Bit array codec implementations.
+ *
+ * @author Emily Stark
+ * @author Mike Hamburg
+ * @author Dan Boneh
+ */
+
+/** @namespace UTF-8 strings */
+sjcl.codec.utf8String = {
+ /** Convert from a bitArray to a UTF-8 string. */
+ fromBits: function (arr) {
+ var out = "", bl = sjcl.bitArray.bitLength(arr), i, tmp;
+ for (i=0; i<bl/8; i++) {
+ if ((i&3) === 0) {
+ tmp = arr[i/4];
+ }
+ out += String.fromCharCode(tmp >>> 24);
+ tmp <<= 8;
+ }
+ return decodeURIComponent(escape(out));
+ },
+
+ /** Convert from a UTF-8 string to a bitArray. */
+ toBits: function (str) {
+ str = unescape(encodeURIComponent(str));
+ var out = [], i, tmp=0;
+ for (i=0; i<str.length; i++) {
+ tmp = tmp << 8 | str.charCodeAt(i);
+ if ((i&3) === 3) {
+ out.push(tmp);
+ tmp = 0;
+ }
+ }
+ if (i&3) {
+ out.push(sjcl.bitArray.partial(8*(i&3), tmp));
+ }
+ return out;
+ }
+};
+
+
+//// codecHex.js
+
+/** @fileOverview Bit array codec implementations.
+ *
+ * @author Emily Stark
+ * @author Mike Hamburg
+ * @author Dan Boneh
+ */
+
+/** @namespace Hexadecimal */
+sjcl.codec.hex = {
+ /** Convert from a bitArray to a hex string. */
+ fromBits: function (arr) {
+ var out = "", i;
+ for (i=0; i<arr.length; i++) {
+ out += ((arr[i]|0)+0xF00000000000).toString(16).substr(4);
+ }
+ return out.substr(0, sjcl.bitArray.bitLength(arr)/4);//.replace(/(.{8})/g, "$1 ");
+ },
+ /** Convert from a hex string to a bitArray. */
+ toBits: function (str) {
+ var i, out=[], len;
+ str = str.replace(/\s|0x/g, "");
+ len = str.length;
+ str = str + "00000000";
+ for (i=0; i<str.length; i+=8) {
+ out.push(parseInt(str.substr(i,8),16)^0);
+ }
+ return sjcl.bitArray.clamp(out, len*4);
+ }
+};
+
+
+//// sha512.js
+
+/** @fileOverview Javascript SHA-512 implementation.
+ *
+ * This implementation was written for CryptoJS by Jeff Mott and adapted for
+ * SJCL by Stefan Thomas.
+ *
+ * CryptoJS (c) 2009–2012 by Jeff Mott. All rights reserved.
+ * Released with New BSD License
+ *
+ * @author Emily Stark
+ * @author Mike Hamburg
+ * @author Dan Boneh
+ * @author Jeff Mott
+ * @author Stefan Thomas
+ */
+
+/**
+ * Context for a SHA-512 operation in progress.
+ * @constructor
+ * @class Secure Hash Algorithm, 512 bits.
+ */
+sjcl.hash.sha512 = function (hash) {
+ if (!this._key[0]) { this._precompute(); }
+ if (hash) {
+ this._h = hash._h.slice(0);
+ this._buffer = hash._buffer.slice(0);
+ this._length = hash._length;
+ } else {
+ this.reset();
+ }
+};
+
+/**
+ * Hash a string or an array of words.
+ * @static
+ * @param {bitArray|String} data the data to hash.
+ * @return {bitArray} The hash value, an array of 16 big-endian words.
+ */
+sjcl.hash.sha512.hash = function (data) {
+ return (new sjcl.hash.sha512()).update(data).finalize();
+};
+
+sjcl.hash.sha512.prototype = {
+ /**
+ * The hash's block size, in bits.
+ * @constant
+ */
+ blockSize: 1024,
+
+ /**
+ * Reset the hash state.
+ * @return this
+ */
+ reset:function () {
+ this._h = this._init.slice(0);
+ this._buffer = [];
+ this._length = 0;
+ return this;
+ },
+
+ /**
+ * Input several words to the hash.
+ * @param {bitArray|String} data the data to hash.
+ * @return this
+ */
+ update: function (data) {
+ if (typeof data === "string") {
+ data = sjcl.codec.utf8String.toBits(data);
+ }
+ var i, b = this._buffer = sjcl.bitArray.concat(this._buffer, data),
+ ol = this._length,
+ nl = this._length = ol + sjcl.bitArray.bitLength(data);
+ for (i = 1024+ol & -1024; i <= nl; i+= 1024) {
+ this._block(b.splice(0,32));
+ }
+ return this;
+ },
+
+ /**
+ * Complete hashing and output the hash value.
+ * @return {bitArray} The hash value, an array of 16 big-endian words.
+ */
+ finalize:function () {
+ var i, b = this._buffer, h = this._h;
+
+ // Round out and push the buffer
+ b = sjcl.bitArray.concat(b, [sjcl.bitArray.partial(1,1)]);
+
+ // Round out the buffer to a multiple of 32 words, less the 4 length words.
+ for (i = b.length + 4; i & 31; i++) {
+ b.push(0);
+ }
+
+ // append the length
+ b.push(0);
+ b.push(0);
+ b.push(Math.floor(this._length / 0x100000000));
+ b.push(this._length | 0);
+
+ while (b.length) {
+ this._block(b.splice(0,32));
+ }
+
+ this.reset();
+ return h;
+ },
+
+ /**
+ * The SHA-512 initialization vector, to be precomputed.
+ * @private
+ */
+ _init:[],
+
+ /**
+ * Least significant 24 bits of SHA512 initialization values.
+ *
+ * Javascript only has 53 bits of precision, so we compute the 40 most
+ * significant bits and add the remaining 24 bits as constants.
+ *
+ * @private
+ */
+ _initr: [ 0xbcc908, 0xcaa73b, 0x94f82b, 0x1d36f1, 0xe682d1, 0x3e6c1f, 0x41bd6b, 0x7e2179 ],
+
+ /*
+ _init:
+ [0x6a09e667, 0xf3bcc908, 0xbb67ae85, 0x84caa73b, 0x3c6ef372, 0xfe94f82b, 0xa54ff53a, 0x5f1d36f1,
+ 0x510e527f, 0xade682d1, 0x9b05688c, 0x2b3e6c1f, 0x1f83d9ab, 0xfb41bd6b, 0x5be0cd19, 0x137e2179],
+ */
+
+ /**
+ * The SHA-512 hash key, to be precomputed.
+ * @private
+ */
+ _key:[],
+
+ /**
+ * Least significant 24 bits of SHA512 key values.
+ * @private
+ */
+ _keyr:
+ [0x28ae22, 0xef65cd, 0x4d3b2f, 0x89dbbc, 0x48b538, 0x05d019, 0x194f9b, 0x6d8118,
+ 0x030242, 0x706fbe, 0xe4b28c, 0xffb4e2, 0x7b896f, 0x1696b1, 0xc71235, 0x692694,
+ 0xf14ad2, 0x4f25e3, 0x8cd5b5, 0xac9c65, 0x2b0275, 0xa6e483, 0x41fbd4, 0x1153b5,
+ 0x66dfab, 0xb43210, 0xfb213f, 0xef0ee4, 0xa88fc2, 0x0aa725, 0x03826f, 0x0e6e70,
+ 0xd22ffc, 0x26c926, 0xc42aed, 0x95b3df, 0xaf63de, 0x77b2a8, 0xedaee6, 0x82353b,
+ 0xf10364, 0x423001, 0xf89791, 0x54be30, 0xef5218, 0x65a910, 0x71202a, 0xbbd1b8,
+ 0xd2d0c8, 0x41ab53, 0x8eeb99, 0x9b48a8, 0xc95a63, 0x418acb, 0x63e373, 0xb2b8a3,
+ 0xefb2fc, 0x172f60, 0xf0ab72, 0x6439ec, 0x631e28, 0x82bde9, 0xc67915, 0x72532b,
+ 0x26619c, 0xc0c207, 0xe0eb1e, 0x6ed178, 0x176fba, 0xc898a6, 0xf90dae, 0x1c471b,
+ 0x047d84, 0xc72493, 0xc9bebc, 0x100d4c, 0x3e42b6, 0x657e2a, 0xd6faec, 0x475817],
+
+ /*
+ _key:
+ [0x428a2f98, 0xd728ae22, 0x71374491, 0x23ef65cd, 0xb5c0fbcf, 0xec4d3b2f, 0xe9b5dba5, 0x8189dbbc,
+ 0x3956c25b, 0xf348b538, 0x59f111f1, 0xb605d019, 0x923f82a4, 0xaf194f9b, 0xab1c5ed5, 0xda6d8118,
+ 0xd807aa98, 0xa3030242, 0x12835b01, 0x45706fbe, 0x243185be, 0x4ee4b28c, 0x550c7dc3, 0xd5ffb4e2,
+ 0x72be5d74, 0xf27b896f, 0x80deb1fe, 0x3b1696b1, 0x9bdc06a7, 0x25c71235, 0xc19bf174, 0xcf692694,
+ 0xe49b69c1, 0x9ef14ad2, 0xefbe4786, 0x384f25e3, 0x0fc19dc6, 0x8b8cd5b5, 0x240ca1cc, 0x77ac9c65,
+ 0x2de92c6f, 0x592b0275, 0x4a7484aa, 0x6ea6e483, 0x5cb0a9dc, 0xbd41fbd4, 0x76f988da, 0x831153b5,
+ 0x983e5152, 0xee66dfab, 0xa831c66d, 0x2db43210, 0xb00327c8, 0x98fb213f, 0xbf597fc7, 0xbeef0ee4,
+ 0xc6e00bf3, 0x3da88fc2, 0xd5a79147, 0x930aa725, 0x06ca6351, 0xe003826f, 0x14292967, 0x0a0e6e70,
+ 0x27b70a85, 0x46d22ffc, 0x2e1b2138, 0x5c26c926, 0x4d2c6dfc, 0x5ac42aed, 0x53380d13, 0x9d95b3df,
+ 0x650a7354, 0x8baf63de, 0x766a0abb, 0x3c77b2a8, 0x81c2c92e, 0x47edaee6, 0x92722c85, 0x1482353b,
+ 0xa2bfe8a1, 0x4cf10364, 0xa81a664b, 0xbc423001, 0xc24b8b70, 0xd0f89791, 0xc76c51a3, 0x0654be30,
+ 0xd192e819, 0xd6ef5218, 0xd6990624, 0x5565a910, 0xf40e3585, 0x5771202a, 0x106aa070, 0x32bbd1b8,
+ 0x19a4c116, 0xb8d2d0c8, 0x1e376c08, 0x5141ab53, 0x2748774c, 0xdf8eeb99, 0x34b0bcb5, 0xe19b48a8,
+ 0x391c0cb3, 0xc5c95a63, 0x4ed8aa4a, 0xe3418acb, 0x5b9cca4f, 0x7763e373, 0x682e6ff3, 0xd6b2b8a3,
+ 0x748f82ee, 0x5defb2fc, 0x78a5636f, 0x43172f60, 0x84c87814, 0xa1f0ab72, 0x8cc70208, 0x1a6439ec,
+ 0x90befffa, 0x23631e28, 0xa4506ceb, 0xde82bde9, 0xbef9a3f7, 0xb2c67915, 0xc67178f2, 0xe372532b,
+ 0xca273ece, 0xea26619c, 0xd186b8c7, 0x21c0c207, 0xeada7dd6, 0xcde0eb1e, 0xf57d4f7f, 0xee6ed178,
+ 0x06f067aa, 0x72176fba, 0x0a637dc5, 0xa2c898a6, 0x113f9804, 0xbef90dae, 0x1b710b35, 0x131c471b,
+ 0x28db77f5, 0x23047d84, 0x32caab7b, 0x40c72493, 0x3c9ebe0a, 0x15c9bebc, 0x431d67c4, 0x9c100d4c,
+ 0x4cc5d4be, 0xcb3e42b6, 0x597f299c, 0xfc657e2a, 0x5fcb6fab, 0x3ad6faec, 0x6c44198c, 0x4a475817],
+ */
+
+ /**
+ * Function to precompute _init and _key.
+ * @private
+ */
+ _precompute: function () {
+ // XXX: This code is for precomputing the SHA256 constants, change for
+ // SHA512 and re-enable.
+ var i = 0, prime = 2, factor;
+
+ function frac(x) { return (x-Math.floor(x)) * 0x100000000 | 0; }
+ function frac2(x) { return (x-Math.floor(x)) * 0x10000000000 & 0xff; }
+
+ outer: for (; i<80; prime++) {
+ for (factor=2; factor*factor <= prime; factor++) {
+ if (prime % factor === 0) {
+ // not a prime
+ continue outer;
+ }
+ }
+
+ if (i<8) {
+ this._init[i*2] = frac(Math.pow(prime, 1/2));
+ this._init[i*2+1] = (frac2(Math.pow(prime, 1/2)) << 24) | this._initr[i];
+ }
+ this._key[i*2] = frac(Math.pow(prime, 1/3));
+ this._key[i*2+1] = (frac2(Math.pow(prime, 1/3)) << 24) | this._keyr[i];
+ i++;
+ }
+ },
+
+ /**
+ * Perform one cycle of SHA-512.
+ * @param {bitArray} words one block of words.
+ * @private
+ */
+ _block:function (words) {
+ var i, wrh, wrl,
+ w = words.slice(0),
+ h = this._h,
+ k = this._key,
+ h0h = h[ 0], h0l = h[ 1], h1h = h[ 2], h1l = h[ 3],
+ h2h = h[ 4], h2l = h[ 5], h3h = h[ 6], h3l = h[ 7],
+ h4h = h[ 8], h4l = h[ 9], h5h = h[10], h5l = h[11],
+ h6h = h[12], h6l = h[13], h7h = h[14], h7l = h[15];
+
+ // Working variables
+ var ah = h0h, al = h0l, bh = h1h, bl = h1l,
+ ch = h2h, cl = h2l, dh = h3h, dl = h3l,
+ eh = h4h, el = h4l, fh = h5h, fl = h5l,
+ gh = h6h, gl = h6l, hh = h7h, hl = h7l;
+
+ for (i=0; i<80; i++) {
+ // load up the input word for this round
+ if (i<16) {
+ wrh = w[i * 2];
+ wrl = w[i * 2 + 1];
+ } else {
+ // Gamma0
+ var gamma0xh = w[(i-15) * 2];
+ var gamma0xl = w[(i-15) * 2 + 1];
+ var gamma0h =
+ ((gamma0xl << 31) | (gamma0xh >>> 1)) ^
+ ((gamma0xl << 24) | (gamma0xh >>> 8)) ^
+ (gamma0xh >>> 7);
+ var gamma0l =
+ ((gamma0xh << 31) | (gamma0xl >>> 1)) ^
+ ((gamma0xh << 24) | (gamma0xl >>> 8)) ^
+ ((gamma0xh << 25) | (gamma0xl >>> 7));
+
+ // Gamma1
+ var gamma1xh = w[(i-2) * 2];
+ var gamma1xl = w[(i-2) * 2 + 1];
+ var gamma1h =
+ ((gamma1xl << 13) | (gamma1xh >>> 19)) ^
+ ((gamma1xh << 3) | (gamma1xl >>> 29)) ^
+ (gamma1xh >>> 6);
+ var gamma1l =
+ ((gamma1xh << 13) | (gamma1xl >>> 19)) ^
+ ((gamma1xl << 3) | (gamma1xh >>> 29)) ^
+ ((gamma1xh << 26) | (gamma1xl >>> 6));
+
+ // Shortcuts
+ var wr7h = w[(i-7) * 2];
+ var wr7l = w[(i-7) * 2 + 1];
+
+ var wr16h = w[(i-16) * 2];
+ var wr16l = w[(i-16) * 2 + 1];
+
+ // W(round) = gamma0 + W(round - 7) + gamma1 + W(round - 16)
+ wrl = gamma0l + wr7l;
+ wrh = gamma0h + wr7h + ((wrl >>> 0) < (gamma0l >>> 0) ? 1 : 0);
+ wrl += gamma1l;
+ wrh += gamma1h + ((wrl >>> 0) < (gamma1l >>> 0) ? 1 : 0);
+ wrl += wr16l;
+ wrh += wr16h + ((wrl >>> 0) < (wr16l >>> 0) ? 1 : 0);
+ }
+
+ w[i*2] = wrh |= 0;
+ w[i*2 + 1] = wrl |= 0;
+
+ // Ch
+ var chh = (eh & fh) ^ (~eh & gh);
+ var chl = (el & fl) ^ (~el & gl);
+
+ // Maj
+ var majh = (ah & bh) ^ (ah & ch) ^ (bh & ch);
+ var majl = (al & bl) ^ (al & cl) ^ (bl & cl);
+
+ // Sigma0
+ var sigma0h = ((al << 4) | (ah >>> 28)) ^ ((ah << 30) | (al >>> 2)) ^ ((ah << 25) | (al >>> 7));
+ var sigma0l = ((ah << 4) | (al >>> 28)) ^ ((al << 30) | (ah >>> 2)) ^ ((al << 25) | (ah >>> 7));
+
+ // Sigma1
+ var sigma1h = ((el << 18) | (eh >>> 14)) ^ ((el << 14) | (eh >>> 18)) ^ ((eh << 23) | (el >>> 9));
+ var sigma1l = ((eh << 18) | (el >>> 14)) ^ ((eh << 14) | (el >>> 18)) ^ ((el << 23) | (eh >>> 9));
+
+ // K(round)
+ var krh = k[i*2];
+ var krl = k[i*2+1];
+
+ // t1 = h + sigma1 + ch + K(round) + W(round)
+ var t1l = hl + sigma1l;
+ var t1h = hh + sigma1h + ((t1l >>> 0) < (hl >>> 0) ? 1 : 0);
+ t1l += chl;
+ t1h += chh + ((t1l >>> 0) < (chl >>> 0) ? 1 : 0);
+ t1l += krl;
+ t1h += krh + ((t1l >>> 0) < (krl >>> 0) ? 1 : 0);
+ t1l = t1l + wrl|0; // FF32..FF34 perf issue https://bugzilla.mozilla.org/show_bug.cgi?id=1054972
+ t1h += wrh + ((t1l >>> 0) < (wrl >>> 0) ? 1 : 0);
+
+ // t2 = sigma0 + maj
+ var t2l = sigma0l + majl;
+ var t2h = sigma0h + majh + ((t2l >>> 0) < (sigma0l >>> 0) ? 1 : 0);
+
+ // Update working variables
+ hh = gh;
+ hl = gl;
+ gh = fh;
+ gl = fl;
+ fh = eh;
+ fl = el;
+ el = (dl + t1l) | 0;
+ eh = (dh + t1h + ((el >>> 0) < (dl >>> 0) ? 1 : 0)) | 0;
+ dh = ch;
+ dl = cl;
+ ch = bh;
+ cl = bl;
+ bh = ah;
+ bl = al;
+ al = (t1l + t2l) | 0;
+ ah = (t1h + t2h + ((al >>> 0) < (t1l >>> 0) ? 1 : 0)) | 0;
+ }
+
+ // Intermediate hash
+ h0l = h[1] = (h0l + al) | 0;
+ h[0] = (h0h + ah + ((h0l >>> 0) < (al >>> 0) ? 1 : 0)) | 0;
+ h1l = h[3] = (h1l + bl) | 0;
+ h[2] = (h1h + bh + ((h1l >>> 0) < (bl >>> 0) ? 1 : 0)) | 0;
+ h2l = h[5] = (h2l + cl) | 0;
+ h[4] = (h2h + ch + ((h2l >>> 0) < (cl >>> 0) ? 1 : 0)) | 0;
+ h3l = h[7] = (h3l + dl) | 0;
+ h[6] = (h3h + dh + ((h3l >>> 0) < (dl >>> 0) ? 1 : 0)) | 0;
+ h4l = h[9] = (h4l + el) | 0;
+ h[8] = (h4h + eh + ((h4l >>> 0) < (el >>> 0) ? 1 : 0)) | 0;
+ h5l = h[11] = (h5l + fl) | 0;
+ h[10] = (h5h + fh + ((h5l >>> 0) < (fl >>> 0) ? 1 : 0)) | 0;
+ h6l = h[13] = (h6l + gl) | 0;
+ h[12] = (h6h + gh + ((h6l >>> 0) < (gl >>> 0) ? 1 : 0)) | 0;
+ h7l = h[15] = (h7l + hl) | 0;
+ h[14] = (h7h + hh + ((h7l >>> 0) < (hl >>> 0) ? 1 : 0)) | 0;
+ }
+};
+
+
+//// hmac.js
+
+/** @fileOverview HMAC implementation.
+ *
+ * @author Emily Stark
+ * @author Mike Hamburg
+ * @author Dan Boneh
+ */
+
+/** HMAC with the specified hash function.
+ * @constructor
+ * @param {bitArray} key the key for HMAC.
+ * @param {Object} [hash=sjcl.hash.sha256] The hash function to use.
+ */
+sjcl.misc.hmac = function (key, Hash) {
+ this._hash = Hash = Hash || sjcl.hash.sha256;
+ var exKey = [[],[]], i,
+ bs = Hash.prototype.blockSize / 32;
+ this._baseHash = [new Hash(), new Hash()];
+
+ if (key.length > bs) {
+ key = Hash.hash(key);
+ }
+
+ for (i=0; i<bs; i++) {
+ exKey[0][i] = key[i]^0x36363636;
+ exKey[1][i] = key[i]^0x5C5C5C5C;
+ }
+
+ this._baseHash[0].update(exKey[0]);
+ this._baseHash[1].update(exKey[1]);
+ this._resultHash = new Hash(this._baseHash[0]);
+};
+
+/** HMAC with the specified hash function. Also called encrypt since it's a prf.
+ * @param {bitArray|String} data The data to mac.
+ */
+sjcl.misc.hmac.prototype.encrypt = sjcl.misc.hmac.prototype.mac = function (data) {
+ if (!this._updated) {
+ this.update(data);
+ return this.digest(data);
+ } else {
+ throw new sjcl.exception.invalid("encrypt on already updated hmac called!");
+ }
+};
+
+sjcl.misc.hmac.prototype.reset = function () {
+ this._resultHash = new this._hash(this._baseHash[0]);
+ this._updated = false;
+};
+
+sjcl.misc.hmac.prototype.update = function (data) {
+ this._updated = true;
+ this._resultHash.update(data);
+};
+
+sjcl.misc.hmac.prototype.digest = function () {
+ var w = this._resultHash.finalize(), result = new (this._hash)(this._baseHash[1]).update(w).finalize();
+
+ this.reset();
+
+ return result;
+};
+
+
+//// pbkdf2.js
+
+
+/** @fileOverview Password-based key-derivation function, version 2.0.
+ *
+ * @author Emily Stark
+ * @author Mike Hamburg
+ * @author Dan Boneh
+ */
+
+/** Password-Based Key-Derivation Function, version 2.0.
+ *
+ * Generate keys from passwords using PBKDF2-HMAC-SHA256.
+ *
+ * This is the method specified by RSA's PKCS #5 standard.
+ *
+ * @param {bitArray|String} password The password.
+ * @param {bitArray|String} salt The salt. Should have lots of entropy.
+ * @param {Number} [count=1000] The number of iterations. Higher numbers make the function slower but more secure.
+ * @param {Number} [length] The length of the derived key. Defaults to the
+ output size of the hash function.
+ * @param {Object} [Prff=sjcl.misc.hmac] The pseudorandom function family.
+ * @return {bitArray} the derived key.
+ */
+sjcl.misc.pbkdf2 = function (password, salt, count, length, Prff) {
+ count = count || 1000;
+
+ if (length < 0 || count < 0) {
+ throw sjcl.exception.invalid("invalid params to pbkdf2");
+ }
+
+ if (typeof password === "string") {
+ password = sjcl.codec.utf8String.toBits(password);
+ }
+
+ if (typeof salt === "string") {
+ salt = sjcl.codec.utf8String.toBits(salt);
+ }
+
+ Prff = Prff || sjcl.misc.hmac;
+
+ var prf = new Prff(password),
+ u, ui, i, j, k, out = [], b = sjcl.bitArray;
+
+ for (k = 1; 32 * out.length < (length || 1); k++) {
+ u = ui = prf.encrypt(b.concat(salt,[k]));
+
+ for (i=1; i<count; i++) {
+ ui = prf.encrypt(ui);
+ for (j=0; j<ui.length; j++) {
+ u[j] ^= ui[j];
+ }
+ }
+
+ out = out.concat(u);
+ }
+
+ if (length) { out = b.clamp(out, length); }
+
+ return out;
+};
+
+
+//// sha256.js
+
+/** @fileOverview Javascript SHA-256 implementation.
+ *
+ * An older version of this implementation is available in the public
+ * domain, but this one is (c) Emily Stark, Mike Hamburg, Dan Boneh,
+ * Stanford University 2008-2010 and BSD-licensed for liability
+ * reasons.
+ *
+ * Special thanks to Aldo Cortesi for pointing out several bugs in
+ * this code.
+ *
+ * @author Emily Stark
+ * @author Mike Hamburg
+ * @author Dan Boneh
+ */
+
+/**
+ * Context for a SHA-256 operation in progress.
+ * @constructor
+ * @class Secure Hash Algorithm, 256 bits.
+ */
+sjcl.hash.sha256 = function (hash) {
+ if (!this._key[0]) { this._precompute(); }
+ if (hash) {
+ this._h = hash._h.slice(0);
+ this._buffer = hash._buffer.slice(0);
+ this._length = hash._length;
+ } else {
+ this.reset();
+ }
+};
+
+/**
+ * Hash a string or an array of words.
+ * @static
+ * @param {bitArray|String} data the data to hash.
+ * @return {bitArray} The hash value, an array of 16 big-endian words.
+ */
+sjcl.hash.sha256.hash = function (data) {
+ return (new sjcl.hash.sha256()).update(data).finalize();
+};
+
+sjcl.hash.sha256.prototype = {
+ /**
+ * The hash's block size, in bits.
+ * @constant
+ */
+ blockSize: 512,
+
+ /**
+ * Reset the hash state.
+ * @return this
+ */
+ reset:function () {
+ this._h = this._init.slice(0);
+ this._buffer = [];
+ this._length = 0;
+ return this;
+ },
+
+ /**
+ * Input several words to the hash.
+ * @param {bitArray|String} data the data to hash.
+ * @return this
+ */
+ update: function (data) {
+ if (typeof data === "string") {
+ data = sjcl.codec.utf8String.toBits(data);
+ }
+ var i, b = this._buffer = sjcl.bitArray.concat(this._buffer, data),
+ ol = this._length,
+ nl = this._length = ol + sjcl.bitArray.bitLength(data);
+ for (i = 512+ol & -512; i <= nl; i+= 512) {
+ this._block(b.splice(0,16));
+ }
+ return this;
+ },
+
+ /**
+ * Complete hashing and output the hash value.
+ * @return {bitArray} The hash value, an array of 8 big-endian words.
+ */
+ finalize:function () {
+ var i, b = this._buffer, h = this._h;
+
+ // Round out and push the buffer
+ b = sjcl.bitArray.concat(b, [sjcl.bitArray.partial(1,1)]);
+
+ // Round out the buffer to a multiple of 16 words, less the 2 length words.
+ for (i = b.length + 2; i & 15; i++) {
+ b.push(0);
+ }
+
+ // append the length
+ b.push(Math.floor(this._length / 0x100000000));
+ b.push(this._length | 0);
+
+ while (b.length) {
+ this._block(b.splice(0,16));
+ }
+
+ this.reset();
+ return h;
+ },
+
+ /**
+ * The SHA-256 initialization vector, to be precomputed.
+ * @private
+ */
+ _init:[],
+ /*
+ _init:[0x6a09e667,0xbb67ae85,0x3c6ef372,0xa54ff53a,0x510e527f,0x9b05688c,0x1f83d9ab,0x5be0cd19],
+ */
+
+ /**
+ * The SHA-256 hash key, to be precomputed.
+ * @private
+ */
+ _key:[],
+ /*
+ _key:
+ [0x428a2f98, 0x71374491, 0xb5c0fbcf, 0xe9b5dba5, 0x3956c25b, 0x59f111f1, 0x923f82a4, 0xab1c5ed5,
+ 0xd807aa98, 0x12835b01, 0x243185be, 0x550c7dc3, 0x72be5d74, 0x80deb1fe, 0x9bdc06a7, 0xc19bf174,
+ 0xe49b69c1, 0xefbe4786, 0x0fc19dc6, 0x240ca1cc, 0x2de92c6f, 0x4a7484aa, 0x5cb0a9dc, 0x76f988da,
+ 0x983e5152, 0xa831c66d, 0xb00327c8, 0xbf597fc7, 0xc6e00bf3, 0xd5a79147, 0x06ca6351, 0x14292967,
+ 0x27b70a85, 0x2e1b2138, 0x4d2c6dfc, 0x53380d13, 0x650a7354, 0x766a0abb, 0x81c2c92e, 0x92722c85,
+ 0xa2bfe8a1, 0xa81a664b, 0xc24b8b70, 0xc76c51a3, 0xd192e819, 0xd6990624, 0xf40e3585, 0x106aa070,
+ 0x19a4c116, 0x1e376c08, 0x2748774c, 0x34b0bcb5, 0x391c0cb3, 0x4ed8aa4a, 0x5b9cca4f, 0x682e6ff3,
+ 0x748f82ee, 0x78a5636f, 0x84c87814, 0x8cc70208, 0x90befffa, 0xa4506ceb, 0xbef9a3f7, 0xc67178f2],
+ */
+
+
+ /**
+ * Function to precompute _init and _key.
+ * @private
+ */
+ _precompute: function () {
+ var i = 0, prime = 2, factor;
+
+ function frac(x) { return (x-Math.floor(x)) * 0x100000000 | 0; }
+
+ outer: for (; i<64; prime++) {
+ for (factor=2; factor*factor <= prime; factor++) {
+ if (prime % factor === 0) {
+ // not a prime
+ continue outer;
+ }
+ }
+
+ if (i<8) {
+ this._init[i] = frac(Math.pow(prime, 1/2));
+ }
+ this._key[i] = frac(Math.pow(prime, 1/3));
+ i++;
+ }
+ },
+
+ /**
+ * Perform one cycle of SHA-256.
+ * @param {bitArray} words one block of words.
+ * @private
+ */
+ _block:function (words) {
+ var i, tmp, a, b,
+ w = words.slice(0),
+ h = this._h,
+ k = this._key,
+ h0 = h[0], h1 = h[1], h2 = h[2], h3 = h[3],
+ h4 = h[4], h5 = h[5], h6 = h[6], h7 = h[7];
+
+ /* Rationale for placement of |0 :
+ * If a value can overflow is original 32 bits by a factor of more than a few
+ * million (2^23 ish), there is a possibility that it might overflow the
+ * 53-bit mantissa and lose precision.
+ *
+ * To avoid this, we clamp back to 32 bits by |'ing with 0 on any value that
+ * propagates around the loop, and on the hash state h[]. I don't believe
+ * that the clamps on h4 and on h0 are strictly necessary, but it's close
+ * (for h4 anyway), and better safe than sorry.
+ *
+ * The clamps on h[] are necessary for the output to be correct even in the
+ * common case and for short inputs.
+ */
+ for (i=0; i<64; i++) {
+ // load up the input word for this round
+ if (i<16) {
+ tmp = w[i];
+ } else {
+ a = w[(i+1 ) & 15];
+ b = w[(i+14) & 15];
+ tmp = w[i&15] = ((a>>>7 ^ a>>>18 ^ a>>>3 ^ a<<25 ^ a<<14) +
+ (b>>>17 ^ b>>>19 ^ b>>>10 ^ b<<15 ^ b<<13) +
+ w[i&15] + w[(i+9) & 15]) | 0;
+ }
+
+ tmp = (tmp + h7 + (h4>>>6 ^ h4>>>11 ^ h4>>>25 ^ h4<<26 ^ h4<<21 ^ h4<<7) + (h6 ^ h4&(h5^h6)) + k[i]); // | 0;
+
+ // shift register
+ h7 = h6; h6 = h5; h5 = h4;
+ h4 = h3 + tmp | 0;
+ h3 = h2; h2 = h1; h1 = h0;
+
+ h0 = (tmp + ((h1&h2) ^ (h3&(h1^h2))) + (h1>>>2 ^ h1>>>13 ^ h1>>>22 ^ h1<<30 ^ h1<<19 ^ h1<<10)) | 0;
+ }
+
+ h[0] = h[0]+h0 | 0;
+ h[1] = h[1]+h1 | 0;
+ h[2] = h[2]+h2 | 0;
+ h[3] = h[3]+h3 | 0;
+ h[4] = h[4]+h4 | 0;
+ h[5] = h[5]+h5 | 0;
+ h[6] = h[6]+h6 | 0;
+ h[7] = h[7]+h7 | 0;
+ }
+};
+</script>
+ <script>WORDLISTS = typeof WORDLISTS == "undefined" ? {} : WORDLISTS;
+WORDLISTS["english"] = [
+"abandon","ability","able","about","above","absent","absorb","abstract","absurd","abuse",
+"access","accident","account","accuse","achieve","acid","acoustic","acquire","across","act",
+"action","actor","actress","actual","adapt","add","addict","address","adjust","admit",
+"adult","advance","advice","aerobic","affair","afford","afraid","again","age","agent",
+"agree","ahead","aim","air","airport","aisle","alarm","album","alcohol","alert",
+"alien","all","alley","allow","almost","alone","alpha","already","also","alter",
+"always","amateur","amazing","among","amount","amused","analyst","anchor","ancient","anger",
+"angle","angry","animal","ankle","announce","annual","another","answer","antenna","antique",
+"anxiety","any","apart","apology","appear","apple","approve","april","arch","arctic",
+"area","arena","argue","arm","armed","armor","army","around","arrange","arrest",
+"arrive","arrow","art","artefact","artist","artwork","ask","aspect","assault","asset",
+"assist","assume","asthma","athlete","atom","attack","attend","attitude","attract","auction",
+"audit","august","aunt","author","auto","autumn","average","avocado","avoid","awake",
+"aware","away","awesome","awful","awkward","axis","baby","bachelor","bacon","badge",
+"bag","balance","balcony","ball","bamboo","banana","banner","bar","barely","bargain",
+"barrel","base","basic","basket","battle","beach","bean","beauty","because","become",
+"beef","before","begin","behave","behind","believe","below","belt","bench","benefit",
+"best","betray","better","between","beyond","bicycle","bid","bike","bind","biology",
+"bird","birth","bitter","black","blade","blame","blanket","blast","bleak","bless",
+"blind","blood","blossom","blouse","blue","blur","blush","board","boat","body",
+"boil","bomb","bone","bonus","book","boost","border","boring","borrow","boss",
+"bottom","bounce","box","boy","bracket","brain","brand","brass","brave","bread",
+"breeze","brick","bridge","brief","bright","bring","brisk","broccoli","broken","bronze",
+"broom","brother","brown","brush","bubble","buddy","budget","buffalo","build","bulb",
+"bulk","bullet","bundle","bunker","burden","burger","burst","bus","business","busy",
+"butter","buyer","buzz","cabbage","cabin","cable","cactus","cage","cake","call",
+"calm","camera","camp","can","canal","cancel","candy","cannon","canoe","canvas",
+"canyon","capable","capital","captain","car","carbon","card","cargo","carpet","carry",
+"cart","case","cash","casino","castle","casual","cat","catalog","catch","category",
+"cattle","caught","cause","caution","cave","ceiling","celery","cement","census","century",
+"cereal","certain","chair","chalk","champion","change","chaos","chapter","charge","chase",
+"chat","cheap","check","cheese","chef","cherry","chest","chicken","chief","child",
+"chimney","choice","choose","chronic","chuckle","chunk","churn","cigar","cinnamon","circle",
+"citizen","city","civil","claim","clap","clarify","claw","clay","clean","clerk",
+"clever","click","client","cliff","climb","clinic","clip","clock","clog","close",
+"cloth","cloud","clown","club","clump","cluster","clutch","coach","coast","coconut",
+"code","coffee","coil","coin","collect","color","column","combine","come","comfort",
+"comic","common","company","concert","conduct","confirm","congress","connect","consider","control",
+"convince","cook","cool","copper","copy","coral","core","corn","correct","cost",
+"cotton","couch","country","couple","course","cousin","cover","coyote","crack","cradle",
+"craft","cram","crane","crash","crater","crawl","crazy","cream","credit","creek",
+"crew","cricket","crime","crisp","critic","crop","cross","crouch","crowd","crucial",
+"cruel","cruise","crumble","crunch","crush","cry","crystal","cube","culture","cup",
+"cupboard","curious","current","curtain","curve","cushion","custom","cute","cycle","dad",
+"damage","damp","dance","danger","daring","dash","daughter","dawn","day","deal",
+"debate","debris","decade","december","decide","decline","decorate","decrease","deer","defense",
+"define","defy","degree","delay","deliver","demand","demise","denial","dentist","deny",
+"depart","depend","deposit","depth","deputy","derive","describe","desert","design","desk",
+"despair","destroy","detail","detect","develop","device","devote","diagram","dial","diamond",
+"diary","dice","diesel","diet","differ","digital","dignity","dilemma","dinner","dinosaur",
+"direct","dirt","disagree","discover","disease","dish","dismiss","disorder","display","distance",
+"divert","divide","divorce","dizzy","doctor","document","dog","doll","dolphin","domain",
+"donate","donkey","donor","door","dose","double","dove","draft","dragon","drama",
+"drastic","draw","dream","dress","drift","drill","drink","drip","drive","drop",
+"drum","dry","duck","dumb","dune","during","dust","dutch","duty","dwarf",
+"dynamic","eager","eagle","early","earn","earth","easily","east","easy","echo",
+"ecology","economy","edge","edit","educate","effort","egg","eight","either","elbow",
+"elder","electric","elegant","element","elephant","elevator","elite","else","embark","embody",
+"embrace","emerge","emotion","employ","empower","empty","enable","enact","end","endless",
+"endorse","enemy","energy","enforce","engage","engine","enhance","enjoy","enlist","enough",
+"enrich","enroll","ensure","enter","entire","entry","envelope","episode","equal","equip",
+"era","erase","erode","erosion","error","erupt","escape","essay","essence","estate",
+"eternal","ethics","evidence","evil","evoke","evolve","exact","example","excess","exchange",
+"excite","exclude","excuse","execute","exercise","exhaust","exhibit","exile","exist","exit",
+"exotic","expand","expect","expire","explain","expose","express","extend","extra","eye",
+"eyebrow","fabric","face","faculty","fade","faint","faith","fall","false","fame",
+"family","famous","fan","fancy","fantasy","farm","fashion","fat","fatal","father",
+"fatigue","fault","favorite","feature","february","federal","fee","feed","feel","female",
+"fence","festival","fetch","fever","few","fiber","fiction","field","figure","file",
+"film","filter","final","find","fine","finger","finish","fire","firm","first",
+"fiscal","fish","fit","fitness","fix","flag","flame","flash","flat","flavor",
+"flee","flight","flip","float","flock","floor","flower","fluid","flush","fly",
+"foam","focus","fog","foil","fold","follow","food","foot","force","forest",
+"forget","fork","fortune","forum","forward","fossil","foster","found","fox","fragile",
+"frame","frequent","fresh","friend","fringe","frog","front","frost","frown","frozen",
+"fruit","fuel","fun","funny","furnace","fury","future","gadget","gain","galaxy",
+"gallery","game","gap","garage","garbage","garden","garlic","garment","gas","gasp",
+"gate","gather","gauge","gaze","general","genius","genre","gentle","genuine","gesture",
+"ghost","giant","gift","giggle","ginger","giraffe","girl","give","glad","glance",
+"glare","glass","glide","glimpse","globe","gloom","glory","glove","glow","glue",
+"goat","goddess","gold","good","goose","gorilla","gospel","gossip","govern","gown",
+"grab","grace","grain","grant","grape","grass","gravity","great","green","grid",
+"grief","grit","grocery","group","grow","grunt","guard","guess","guide","guilt",
+"guitar","gun","gym","habit","hair","half","hammer","hamster","hand","happy",
+"harbor","hard","harsh","harvest","hat","have","hawk","hazard","head","health",
+"heart","heavy","hedgehog","height","hello","helmet","help","hen","hero","hidden",
+"high","hill","hint","hip","hire","history","hobby","hockey","hold","hole",
+"holiday","hollow","home","honey","hood","hope","horn","horror","horse","hospital",
+"host","hotel","hour","hover","hub","huge","human","humble","humor","hundred",
+"hungry","hunt","hurdle","hurry","hurt","husband","hybrid","ice","icon","idea",
+"identify","idle","ignore","ill","illegal","illness","image","imitate","immense","immune",
+"impact","impose","improve","impulse","inch","include","income","increase","index","indicate",
+"indoor","industry","infant","inflict","inform","inhale","inherit","initial","inject","injury",
+"inmate","inner","innocent","input","inquiry","insane","insect","inside","inspire","install",
+"intact","interest","into","invest","invite","involve","iron","island","isolate","issue",
+"item","ivory","jacket","jaguar","jar","jazz","jealous","jeans","jelly","jewel",
+"job","join","joke","journey","joy","judge","juice","jump","jungle","junior",
+"junk","just","kangaroo","keen","keep","ketchup","key","kick","kid","kidney",
+"kind","kingdom","kiss","kit","kitchen","kite","kitten","kiwi","knee","knife",
+"knock","know","lab","label","labor","ladder","lady","lake","lamp","language",
+"laptop","large","later","latin","laugh","laundry","lava","law","lawn","lawsuit",
+"layer","lazy","leader","leaf","learn","leave","lecture","left","leg","legal",
+"legend","leisure","lemon","lend","length","lens","leopard","lesson","letter","level",
+"liar","liberty","library","license","life","lift","light","like","limb","limit",
+"link","lion","liquid","list","little","live","lizard","load","loan","lobster",
+"local","lock","logic","lonely","long","loop","lottery","loud","lounge","love",
+"loyal","lucky","luggage","lumber","lunar","lunch","luxury","lyrics","machine","mad",
+"magic","magnet","maid","mail","main","major","make","mammal","man","manage",
+"mandate","mango","mansion","manual","maple","marble","march","margin","marine","market",
+"marriage","mask","mass","master","match","material","math","matrix","matter","maximum",
+"maze","meadow","mean","measure","meat","mechanic","medal","media","melody","melt",
+"member","memory","mention","menu","mercy","merge","merit","merry","mesh","message",
+"metal","method","middle","midnight","milk","million","mimic","mind","minimum","minor",
+"minute","miracle","mirror","misery","miss","mistake","mix","mixed","mixture","mobile",
+"model","modify","mom","moment","monitor","monkey","monster","month","moon","moral",
+"more","morning","mosquito","mother","motion","motor","mountain","mouse","move","movie",
+"much","muffin","mule","multiply","muscle","museum","mushroom","music","must","mutual",
+"myself","mystery","myth","naive","name","napkin","narrow","nasty","nation","nature",
+"near","neck","need","negative","neglect","neither","nephew","nerve","nest","net",
+"network","neutral","never","news","next","nice","night","noble","noise","nominee",
+"noodle","normal","north","nose","notable","note","nothing","notice","novel","now",
+"nuclear","number","nurse","nut","oak","obey","object","oblige","obscure","observe",
+"obtain","obvious","occur","ocean","october","odor","off","offer","office","often",
+"oil","okay","old","olive","olympic","omit","once","one","onion","online",
+"only","open","opera","opinion","oppose","option","orange","orbit","orchard","order",
+"ordinary","organ","orient","original","orphan","ostrich","other","outdoor","outer","output",
+"outside","oval","oven","over","own","owner","oxygen","oyster","ozone","pact",
+"paddle","page","pair","palace","palm","panda","panel","panic","panther","paper",
+"parade","parent","park","parrot","party","pass","patch","path","patient","patrol",
+"pattern","pause","pave","payment","peace","peanut","pear","peasant","pelican","pen",
+"penalty","pencil","people","pepper","perfect","permit","person","pet","phone","photo",
+"phrase","physical","piano","picnic","picture","piece","pig","pigeon","pill","pilot",
+"pink","pioneer","pipe","pistol","pitch","pizza","place","planet","plastic","plate",
+"play","please","pledge","pluck","plug","plunge","poem","poet","point","polar",
+"pole","police","pond","pony","pool","popular","portion","position","possible","post",
+"potato","pottery","poverty","powder","power","practice","praise","predict","prefer","prepare",
+"present","pretty","prevent","price","pride","primary","print","priority","prison","private",
+"prize","problem","process","produce","profit","program","project","promote","proof","property",
+"prosper","protect","proud","provide","public","pudding","pull","pulp","pulse","pumpkin",
+"punch","pupil","puppy","purchase","purity","purpose","purse","push","put","puzzle",
+"pyramid","quality","quantum","quarter","question","quick","quit","quiz","quote","rabbit",
+"raccoon","race","rack","radar","radio","rail","rain","raise","rally","ramp",
+"ranch","random","range","rapid","rare","rate","rather","raven","raw","razor",
+"ready","real","reason","rebel","rebuild","recall","receive","recipe","record","recycle",
"reduce","reflect","reform","refuse","region","regret","regular","reject","relax","release",
"relief","rely","remain","remember","remind","remove","render","renew","rent","reopen",
"repair","repeat","replace","report","require","rescue","resemble","resist","resource","response",
"wish","witness","wolf","woman","wonder","wood","wool","word","work","world",
"worry","worth","wrap","wreck","wrestle","wrist","write","wrong","yard","year",
"yellow","you","young","youth","zebra","zero","zone","zoo"]
+</script>
+ <script>WORDLISTS = typeof WORDLISTS == "undefined" ? {} : WORDLISTS;
+WORDLISTS["japanese"] = [
+"あいこくしん", "あいさつ", "あいだ", "あおぞら", "あかちゃん", "あきる", "あけがた", "あける", "あこがれる", "あさい",
+"あさひ", "あしあと", "あじわう", "あずかる", "あずき", "あそぶ", "あたえる", "あたためる", "あたりまえ", "あたる",
+"あつい", "あつかう", "あっしゅく", "あつまり", "あつめる", "あてな", "あてはまる", "あひる", "あぶら", "あぶる",
+"あふれる", "あまい", "あまど", "あまやかす", "あまり", "あみもの", "あめりか", "あやまる", "あゆむ", "あらいぐま",
+"あらし", "あらすじ", "あらためる", "あらゆる", "あらわす", "ありがとう", "あわせる", "あわてる", "あんい", "あんがい",
+"あんこ", "あんぜん", "あんてい", "あんない", "あんまり", "いいだす", "いおん", "いがい", "いがく", "いきおい",
+"いきなり", "いきもの", "いきる", "いくじ", "いくぶん", "いけばな", "いけん", "いこう", "いこく", "いこつ",
+"いさましい", "いさん", "いしき", "いじゅう", "いじょう", "いじわる", "いずみ", "いずれ", "いせい", "いせえび",
+"いせかい", "いせき", "いぜん", "いそうろう", "いそがしい", "いだい", "いだく", "いたずら", "いたみ", "いたりあ",
+"いちおう", "いちじ", "いちど", "いちば", "いちぶ", "いちりゅう", "いつか", "いっしゅん", "いっせい", "いっそう",
+"いったん", "いっち", "いってい", "いっぽう", "いてざ", "いてん", "いどう", "いとこ", "いない", "いなか",
+"いねむり", "いのち", "いのる", "いはつ", "いばる", "いはん", "いびき", "いひん", "いふく", "いへん",
+"いほう", "いみん", "いもうと", "いもたれ", "いもり", "いやがる", "いやす", "いよかん", "いよく", "いらい",
+"いらすと", "いりぐち", "いりょう", "いれい", "いれもの", "いれる", "いろえんぴつ", "いわい", "いわう", "いわかん",
+"いわば", "いわゆる", "いんげんまめ", "いんさつ", "いんしょう", "いんよう", "うえき", "うえる", "うおざ", "うがい",
+"うかぶ", "うかべる", "うきわ", "うくらいな", "うくれれ", "うけたまわる", "うけつけ", "うけとる", "うけもつ", "うける",
+"うごかす", "うごく", "うこん", "うさぎ", "うしなう", "うしろがみ", "うすい", "うすぎ", "うすぐらい", "うすめる",
+"うせつ", "うちあわせ", "うちがわ", "うちき", "うちゅう", "うっかり", "うつくしい", "うったえる", "うつる", "うどん",
+"うなぎ", "うなじ", "うなずく", "うなる", "うねる", "うのう", "うぶげ", "うぶごえ", "うまれる", "うめる",
+"うもう", "うやまう", "うよく", "うらがえす", "うらぐち", "うらない", "うりあげ", "うりきれ", "うるさい", "うれしい",
+"うれゆき", "うれる", "うろこ", "うわき", "うわさ", "うんこう", "うんちん", "うんてん", "うんどう", "えいえん",
+"えいが", "えいきょう", "えいご", "えいせい", "えいぶん", "えいよう", "えいわ", "えおり", "えがお", "えがく",
+"えきたい", "えくせる", "えしゃく", "えすて", "えつらん", "えのぐ", "えほうまき", "えほん", "えまき", "えもじ",
+"えもの", "えらい", "えらぶ", "えりあ", "えんえん", "えんかい", "えんぎ", "えんげき", "えんしゅう", "えんぜつ",
+"えんそく", "えんちょう", "えんとつ", "おいかける", "おいこす", "おいしい", "おいつく", "おうえん", "おうさま", "おうじ",
+"おうせつ", "おうたい", "おうふく", "おうべい", "おうよう", "おえる", "おおい", "おおう", "おおどおり", "おおや",
+"おおよそ", "おかえり", "おかず", "おがむ", "おかわり", "おぎなう", "おきる", "おくさま", "おくじょう", "おくりがな",
+"おくる", "おくれる", "おこす", "おこなう", "おこる", "おさえる", "おさない", "おさめる", "おしいれ", "おしえる",
+"おじぎ", "おじさん", "おしゃれ", "おそらく", "おそわる", "おたがい", "おたく", "おだやか", "おちつく", "おっと",
+"おつり", "おでかけ", "おとしもの", "おとなしい", "おどり", "おどろかす", "おばさん", "おまいり", "おめでとう", "おもいで",
+"おもう", "おもたい", "おもちゃ", "おやつ", "おやゆび", "およぼす", "おらんだ", "おろす", "おんがく", "おんけい",
+"おんしゃ", "おんせん", "おんだん", "おんちゅう", "おんどけい", "かあつ", "かいが", "がいき", "がいけん", "がいこう",
+"かいさつ", "かいしゃ", "かいすいよく", "かいぜん", "かいぞうど", "かいつう", "かいてん", "かいとう", "かいふく", "がいへき",
+"かいほう", "かいよう", "がいらい", "かいわ", "かえる", "かおり", "かかえる", "かがく", "かがし", "かがみ",
+"かくご", "かくとく", "かざる", "がぞう", "かたい", "かたち", "がちょう", "がっきゅう", "がっこう", "がっさん",
+"がっしょう", "かなざわし", "かのう", "がはく", "かぶか", "かほう", "かほご", "かまう", "かまぼこ", "かめれおん",
+"かゆい", "かようび", "からい", "かるい", "かろう", "かわく", "かわら", "がんか", "かんけい", "かんこう",
+"かんしゃ", "かんそう", "かんたん", "かんち", "がんばる", "きあい", "きあつ", "きいろ", "ぎいん", "きうい",
+"きうん", "きえる", "きおう", "きおく", "きおち", "きおん", "きかい", "きかく", "きかんしゃ", "ききて",
+"きくばり", "きくらげ", "きけんせい", "きこう", "きこえる", "きこく", "きさい", "きさく", "きさま", "きさらぎ",
+"ぎじかがく", "ぎしき", "ぎじたいけん", "ぎじにってい", "ぎじゅつしゃ", "きすう", "きせい", "きせき", "きせつ", "きそう",
+"きぞく", "きぞん", "きたえる", "きちょう", "きつえん", "ぎっちり", "きつつき", "きつね", "きてい", "きどう",
+"きどく", "きない", "きなが", "きなこ", "きぬごし", "きねん", "きのう", "きのした", "きはく", "きびしい",
+"きひん", "きふく", "きぶん", "きぼう", "きほん", "きまる", "きみつ", "きむずかしい", "きめる", "きもだめし",
+"きもち", "きもの", "きゃく", "きやく", "ぎゅうにく", "きよう", "きょうりゅう", "きらい", "きらく", "きりん",
+"きれい", "きれつ", "きろく", "ぎろん", "きわめる", "ぎんいろ", "きんかくじ", "きんじょ", "きんようび", "ぐあい",
+"くいず", "くうかん", "くうき", "くうぐん", "くうこう", "ぐうせい", "くうそう", "ぐうたら", "くうふく", "くうぼ",
+"くかん", "くきょう", "くげん", "ぐこう", "くさい", "くさき", "くさばな", "くさる", "くしゃみ", "くしょう",
+"くすのき", "くすりゆび", "くせげ", "くせん", "ぐたいてき", "くださる", "くたびれる", "くちこみ", "くちさき", "くつした",
+"ぐっすり", "くつろぐ", "くとうてん", "くどく", "くなん", "くねくね", "くのう", "くふう", "くみあわせ", "くみたてる",
+"くめる", "くやくしょ", "くらす", "くらべる", "くるま", "くれる", "くろう", "くわしい", "ぐんかん", "ぐんしょく",
+"ぐんたい", "ぐんて", "けあな", "けいかく", "けいけん", "けいこ", "けいさつ", "げいじゅつ", "けいたい", "げいのうじん",
+"けいれき", "けいろ", "けおとす", "けおりもの", "げきか", "げきげん", "げきだん", "げきちん", "げきとつ", "げきは",
+"げきやく", "げこう", "げこくじょう", "げざい", "けさき", "げざん", "けしき", "けしごむ", "けしょう", "げすと",
+"けたば", "けちゃっぷ", "けちらす", "けつあつ", "けつい", "けつえき", "けっこん", "けつじょ", "けっせき", "けってい",
+"けつまつ", "げつようび", "げつれい", "けつろん", "げどく", "けとばす", "けとる", "けなげ", "けなす", "けなみ",
+"けぬき", "げねつ", "けねん", "けはい", "げひん", "けぶかい", "げぼく", "けまり", "けみかる", "けむし",
+"けむり", "けもの", "けらい", "けろけろ", "けわしい", "けんい", "けんえつ", "けんお", "けんか", "げんき",
+"けんげん", "けんこう", "けんさく", "けんしゅう", "けんすう", "げんそう", "けんちく", "けんてい", "けんとう", "けんない",
+"けんにん", "げんぶつ", "けんま", "けんみん", "けんめい", "けんらん", "けんり", "こあくま", "こいぬ", "こいびと",
+"ごうい", "こうえん", "こうおん", "こうかん", "ごうきゅう", "ごうけい", "こうこう", "こうさい", "こうじ", "こうすい",
+"ごうせい", "こうそく", "こうたい", "こうちゃ", "こうつう", "こうてい", "こうどう", "こうない", "こうはい", "ごうほう",
+"ごうまん", "こうもく", "こうりつ", "こえる", "こおり", "ごかい", "ごがつ", "ごかん", "こくご", "こくさい",
+"こくとう", "こくない", "こくはく", "こぐま", "こけい", "こける", "ここのか", "こころ", "こさめ", "こしつ",
+"こすう", "こせい", "こせき", "こぜん", "こそだて", "こたい", "こたえる", "こたつ", "こちょう", "こっか",
+"こつこつ", "こつばん", "こつぶ", "こてい", "こてん", "ことがら", "ことし", "ことば", "ことり", "こなごな",
+"こねこね", "このまま", "このみ", "このよ", "ごはん", "こひつじ", "こふう", "こふん", "こぼれる", "ごまあぶら",
+"こまかい", "ごますり", "こまつな", "こまる", "こむぎこ", "こもじ", "こもち", "こもの", "こもん", "こやく",
+"こやま", "こゆう", "こゆび", "こよい", "こよう", "こりる", "これくしょん", "ころっけ", "こわもて", "こわれる",
+"こんいん", "こんかい", "こんき", "こんしゅう", "こんすい", "こんだて", "こんとん", "こんなん", "こんびに", "こんぽん",
+"こんまけ", "こんや", "こんれい", "こんわく", "ざいえき", "さいかい", "さいきん", "ざいげん", "ざいこ", "さいしょ",
+"さいせい", "ざいたく", "ざいちゅう", "さいてき", "ざいりょう", "さうな", "さかいし", "さがす", "さかな", "さかみち",
+"さがる", "さぎょう", "さくし", "さくひん", "さくら", "さこく", "さこつ", "さずかる", "ざせき", "さたん",
+"さつえい", "ざつおん", "ざっか", "ざつがく", "さっきょく", "ざっし", "さつじん", "ざっそう", "さつたば", "さつまいも",
+"さてい", "さといも", "さとう", "さとおや", "さとし", "さとる", "さのう", "さばく", "さびしい", "さべつ",
+"さほう", "さほど", "さます", "さみしい", "さみだれ", "さむけ", "さめる", "さやえんどう", "さゆう", "さよう",
+"さよく", "さらだ", "ざるそば", "さわやか", "さわる", "さんいん", "さんか", "さんきゃく", "さんこう", "さんさい",
+"ざんしょ", "さんすう", "さんせい", "さんそ", "さんち", "さんま", "さんみ", "さんらん", "しあい", "しあげ",
+"しあさって", "しあわせ", "しいく", "しいん", "しうち", "しえい", "しおけ", "しかい", "しかく", "じかん",
+"しごと", "しすう", "じだい", "したうけ", "したぎ", "したて", "したみ", "しちょう", "しちりん", "しっかり",
+"しつじ", "しつもん", "してい", "してき", "してつ", "じてん", "じどう", "しなぎれ", "しなもの", "しなん",
+"しねま", "しねん", "しのぐ", "しのぶ", "しはい", "しばかり", "しはつ", "しはらい", "しはん", "しひょう",
+"しふく", "じぶん", "しへい", "しほう", "しほん", "しまう", "しまる", "しみん", "しむける", "じむしょ",
+"しめい", "しめる", "しもん", "しゃいん", "しゃうん", "しゃおん", "じゃがいも", "しやくしょ", "しゃくほう", "しゃけん",
+"しゃこ", "しゃざい", "しゃしん", "しゃせん", "しゃそう", "しゃたい", "しゃちょう", "しゃっきん", "じゃま", "しゃりん",
+"しゃれい", "じゆう", "じゅうしょ", "しゅくはく", "じゅしん", "しゅっせき", "しゅみ", "しゅらば", "じゅんばん", "しょうかい",
+"しょくたく", "しょっけん", "しょどう", "しょもつ", "しらせる", "しらべる", "しんか", "しんこう", "じんじゃ", "しんせいじ",
+"しんちく", "しんりん", "すあげ", "すあし", "すあな", "ずあん", "すいえい", "すいか", "すいとう", "ずいぶん",
+"すいようび", "すうがく", "すうじつ", "すうせん", "すおどり", "すきま", "すくう", "すくない", "すける", "すごい",
+"すこし", "ずさん", "すずしい", "すすむ", "すすめる", "すっかり", "ずっしり", "ずっと", "すてき", "すてる",
+"すねる", "すのこ", "すはだ", "すばらしい", "ずひょう", "ずぶぬれ", "すぶり", "すふれ", "すべて", "すべる",
+"ずほう", "すぼん", "すまい", "すめし", "すもう", "すやき", "すらすら", "するめ", "すれちがう", "すろっと",
+"すわる", "すんぜん", "すんぽう", "せあぶら", "せいかつ", "せいげん", "せいじ", "せいよう", "せおう", "せかいかん",
+"せきにん", "せきむ", "せきゆ", "せきらんうん", "せけん", "せこう", "せすじ", "せたい", "せたけ", "せっかく",
+"せっきゃく", "ぜっく", "せっけん", "せっこつ", "せっさたくま", "せつぞく", "せつだん", "せつでん", "せっぱん", "せつび",
+"せつぶん", "せつめい", "せつりつ", "せなか", "せのび", "せはば", "せびろ", "せぼね", "せまい", "せまる",
+"せめる", "せもたれ", "せりふ", "ぜんあく", "せんい", "せんえい", "せんか", "せんきょ", "せんく", "せんげん",
+"ぜんご", "せんさい", "せんしゅ", "せんすい", "せんせい", "せんぞ", "せんたく", "せんちょう", "せんてい", "せんとう",
+"せんぬき", "せんねん", "せんぱい", "ぜんぶ", "ぜんぽう", "せんむ", "せんめんじょ", "せんもん", "せんやく", "せんゆう",
+"せんよう", "ぜんら", "ぜんりゃく", "せんれい", "せんろ", "そあく", "そいとげる", "そいね", "そうがんきょう", "そうき",
+"そうご", "そうしん", "そうだん", "そうなん", "そうび", "そうめん", "そうり", "そえもの", "そえん", "そがい",
+"そげき", "そこう", "そこそこ", "そざい", "そしな", "そせい", "そせん", "そそぐ", "そだてる", "そつう",
+"そつえん", "そっかん", "そつぎょう", "そっけつ", "そっこう", "そっせん", "そっと", "そとがわ", "そとづら", "そなえる",
+"そなた", "そふぼ", "そぼく", "そぼろ", "そまつ", "そまる", "そむく", "そむりえ", "そめる", "そもそも",
+"そよかぜ", "そらまめ", "そろう", "そんかい", "そんけい", "そんざい", "そんしつ", "そんぞく", "そんちょう", "ぞんび",
+"ぞんぶん", "そんみん", "たあい", "たいいん", "たいうん", "たいえき", "たいおう", "だいがく", "たいき", "たいぐう",
+"たいけん", "たいこ", "たいざい", "だいじょうぶ", "だいすき", "たいせつ", "たいそう", "だいたい", "たいちょう", "たいてい",
+"だいどころ", "たいない", "たいねつ", "たいのう", "たいはん", "だいひょう", "たいふう", "たいへん", "たいほ", "たいまつばな",
+"たいみんぐ", "たいむ", "たいめん", "たいやき", "たいよう", "たいら", "たいりょく", "たいる", "たいわん", "たうえ",
+"たえる", "たおす", "たおる", "たおれる", "たかい", "たかね", "たきび", "たくさん", "たこく", "たこやき",
+"たさい", "たしざん", "だじゃれ", "たすける", "たずさわる", "たそがれ", "たたかう", "たたく", "ただしい", "たたみ",
+"たちばな", "だっかい", "だっきゃく", "だっこ", "だっしゅつ", "だったい", "たてる", "たとえる", "たなばた", "たにん",
+"たぬき", "たのしみ", "たはつ", "たぶん", "たべる", "たぼう", "たまご", "たまる", "だむる", "ためいき",
+"ためす", "ためる", "たもつ", "たやすい", "たよる", "たらす", "たりきほんがん", "たりょう", "たりる", "たると",
+"たれる", "たれんと", "たろっと", "たわむれる", "だんあつ", "たんい", "たんおん", "たんか", "たんき", "たんけん",
+"たんご", "たんさん", "たんじょうび", "だんせい", "たんそく", "たんたい", "だんち", "たんてい", "たんとう", "だんな",
+"たんにん", "だんねつ", "たんのう", "たんぴん", "だんぼう", "たんまつ", "たんめい", "だんれつ", "だんろ", "だんわ",
+"ちあい", "ちあん", "ちいき", "ちいさい", "ちえん", "ちかい", "ちから", "ちきゅう", "ちきん", "ちけいず",
+"ちけん", "ちこく", "ちさい", "ちしき", "ちしりょう", "ちせい", "ちそう", "ちたい", "ちたん", "ちちおや",
+"ちつじょ", "ちてき", "ちてん", "ちぬき", "ちぬり", "ちのう", "ちひょう", "ちへいせん", "ちほう", "ちまた",
+"ちみつ", "ちみどろ", "ちめいど", "ちゃんこなべ", "ちゅうい", "ちゆりょく", "ちょうし", "ちょさくけん", "ちらし", "ちらみ",
+"ちりがみ", "ちりょう", "ちるど", "ちわわ", "ちんたい", "ちんもく", "ついか", "ついたち", "つうか", "つうじょう",
+"つうはん", "つうわ", "つかう", "つかれる", "つくね", "つくる", "つけね", "つける", "つごう", "つたえる",
+"つづく", "つつじ", "つつむ", "つとめる", "つながる", "つなみ", "つねづね", "つのる", "つぶす", "つまらない",
+"つまる", "つみき", "つめたい", "つもり", "つもる", "つよい", "つるぼ", "つるみく", "つわもの", "つわり",
+"てあし", "てあて", "てあみ", "ていおん", "ていか", "ていき", "ていけい", "ていこく", "ていさつ", "ていし",
+"ていせい", "ていたい", "ていど", "ていねい", "ていひょう", "ていへん", "ていぼう", "てうち", "ておくれ", "てきとう",
+"てくび", "でこぼこ", "てさぎょう", "てさげ", "てすり", "てそう", "てちがい", "てちょう", "てつがく", "てつづき",
+"でっぱ", "てつぼう", "てつや", "でぬかえ", "てぬき", "てぬぐい", "てのひら", "てはい", "てぶくろ", "てふだ",
+"てほどき", "てほん", "てまえ", "てまきずし", "てみじか", "てみやげ", "てらす", "てれび", "てわけ", "てわたし",
+"でんあつ", "てんいん", "てんかい", "てんき", "てんぐ", "てんけん", "てんごく", "てんさい", "てんし", "てんすう",
+"でんち", "てんてき", "てんとう", "てんない", "てんぷら", "てんぼうだい", "てんめつ", "てんらんかい", "でんりょく", "でんわ",
+"どあい", "といれ", "どうかん", "とうきゅう", "どうぐ", "とうし", "とうむぎ", "とおい", "とおか", "とおく",
+"とおす", "とおる", "とかい", "とかす", "ときおり", "ときどき", "とくい", "とくしゅう", "とくてん", "とくに",
+"とくべつ", "とけい", "とける", "とこや", "とさか", "としょかん", "とそう", "とたん", "とちゅう", "とっきゅう",
+"とっくん", "とつぜん", "とつにゅう", "とどける", "ととのえる", "とない", "となえる", "となり", "とのさま", "とばす",
+"どぶがわ", "とほう", "とまる", "とめる", "ともだち", "ともる", "どようび", "とらえる", "とんかつ", "どんぶり",
+"ないかく", "ないこう", "ないしょ", "ないす", "ないせん", "ないそう", "なおす", "ながい", "なくす", "なげる",
+"なこうど", "なさけ", "なたでここ", "なっとう", "なつやすみ", "ななおし", "なにごと", "なにもの", "なにわ", "なのか",
+"なふだ", "なまいき", "なまえ", "なまみ", "なみだ", "なめらか", "なめる", "なやむ", "ならう", "ならび",
+"ならぶ", "なれる", "なわとび", "なわばり", "にあう", "にいがた", "にうけ", "におい", "にかい", "にがて",
+"にきび", "にくしみ", "にくまん", "にげる", "にさんかたんそ", "にしき", "にせもの", "にちじょう", "にちようび", "にっか",
+"にっき", "にっけい", "にっこう", "にっさん", "にっしょく", "にっすう", "にっせき", "にってい", "になう", "にほん",
+"にまめ", "にもつ", "にやり", "にゅういん", "にりんしゃ", "にわとり", "にんい", "にんか", "にんき", "にんげん",
+"にんしき", "にんずう", "にんそう", "にんたい", "にんち", "にんてい", "にんにく", "にんぷ", "にんまり", "にんむ",
+"にんめい", "にんよう", "ぬいくぎ", "ぬかす", "ぬぐいとる", "ぬぐう", "ぬくもり", "ぬすむ", "ぬまえび", "ぬめり",
+"ぬらす", "ぬんちゃく", "ねあげ", "ねいき", "ねいる", "ねいろ", "ねぐせ", "ねくたい", "ねくら", "ねこぜ",
+"ねこむ", "ねさげ", "ねすごす", "ねそべる", "ねだん", "ねつい", "ねっしん", "ねつぞう", "ねったいぎょ", "ねぶそく",
+"ねふだ", "ねぼう", "ねほりはほり", "ねまき", "ねまわし", "ねみみ", "ねむい", "ねむたい", "ねもと", "ねらう",
+"ねわざ", "ねんいり", "ねんおし", "ねんかん", "ねんきん", "ねんぐ", "ねんざ", "ねんし", "ねんちゃく", "ねんど",
+"ねんぴ", "ねんぶつ", "ねんまつ", "ねんりょう", "ねんれい", "のいず", "のおづま", "のがす", "のきなみ", "のこぎり",
+"のこす", "のこる", "のせる", "のぞく", "のぞむ", "のたまう", "のちほど", "のっく", "のばす", "のはら",
+"のべる", "のぼる", "のみもの", "のやま", "のらいぬ", "のらねこ", "のりもの", "のりゆき", "のれん", "のんき",
+"ばあい", "はあく", "ばあさん", "ばいか", "ばいく", "はいけん", "はいご", "はいしん", "はいすい", "はいせん",
+"はいそう", "はいち", "ばいばい", "はいれつ", "はえる", "はおる", "はかい", "ばかり", "はかる", "はくしゅ",
+"はけん", "はこぶ", "はさみ", "はさん", "はしご", "ばしょ", "はしる", "はせる", "ぱそこん", "はそん",
+"はたん", "はちみつ", "はつおん", "はっかく", "はづき", "はっきり", "はっくつ", "はっけん", "はっこう", "はっさん",
+"はっしん", "はったつ", "はっちゅう", "はってん", "はっぴょう", "はっぽう", "はなす", "はなび", "はにかむ", "はぶらし",
+"はみがき", "はむかう", "はめつ", "はやい", "はやし", "はらう", "はろうぃん", "はわい", "はんい", "はんえい",
+"はんおん", "はんかく", "はんきょう", "ばんぐみ", "はんこ", "はんしゃ", "はんすう", "はんだん", "ぱんち", "ぱんつ",
+"はんてい", "はんとし", "はんのう", "はんぱ", "はんぶん", "はんぺん", "はんぼうき", "はんめい", "はんらん", "はんろん",
+"ひいき", "ひうん", "ひえる", "ひかく", "ひかり", "ひかる", "ひかん", "ひくい", "ひけつ", "ひこうき",
+"ひこく", "ひさい", "ひさしぶり", "ひさん", "びじゅつかん", "ひしょ", "ひそか", "ひそむ", "ひたむき", "ひだり",
+"ひたる", "ひつぎ", "ひっこし", "ひっし", "ひつじゅひん", "ひっす", "ひつぜん", "ぴったり", "ぴっちり", "ひつよう",
+"ひてい", "ひとごみ", "ひなまつり", "ひなん", "ひねる", "ひはん", "ひびく", "ひひょう", "ひほう", "ひまわり",
+"ひまん", "ひみつ", "ひめい", "ひめじし", "ひやけ", "ひやす", "ひよう", "びょうき", "ひらがな", "ひらく",
+"ひりつ", "ひりょう", "ひるま", "ひるやすみ", "ひれい", "ひろい", "ひろう", "ひろき", "ひろゆき", "ひんかく",
+"ひんけつ", "ひんこん", "ひんしゅ", "ひんそう", "ぴんち", "ひんぱん", "びんぼう", "ふあん", "ふいうち", "ふうけい",
+"ふうせん", "ぷうたろう", "ふうとう", "ふうふ", "ふえる", "ふおん", "ふかい", "ふきん", "ふくざつ", "ふくぶくろ",
+"ふこう", "ふさい", "ふしぎ", "ふじみ", "ふすま", "ふせい", "ふせぐ", "ふそく", "ぶたにく", "ふたん",
+"ふちょう", "ふつう", "ふつか", "ふっかつ", "ふっき", "ふっこく", "ぶどう", "ふとる", "ふとん", "ふのう",
+"ふはい", "ふひょう", "ふへん", "ふまん", "ふみん", "ふめつ", "ふめん", "ふよう", "ふりこ", "ふりる",
+"ふるい", "ふんいき", "ぶんがく", "ぶんぐ", "ふんしつ", "ぶんせき", "ふんそう", "ぶんぽう", "へいあん", "へいおん",
+"へいがい", "へいき", "へいげん", "へいこう", "へいさ", "へいしゃ", "へいせつ", "へいそ", "へいたく", "へいてん",
+"へいねつ", "へいわ", "へきが", "へこむ", "べにいろ", "べにしょうが", "へらす", "へんかん", "べんきょう", "べんごし",
+"へんさい", "へんたい", "べんり", "ほあん", "ほいく", "ぼうぎょ", "ほうこく", "ほうそう", "ほうほう", "ほうもん",
+"ほうりつ", "ほえる", "ほおん", "ほかん", "ほきょう", "ぼきん", "ほくろ", "ほけつ", "ほけん", "ほこう",
+"ほこる", "ほしい", "ほしつ", "ほしゅ", "ほしょう", "ほせい", "ほそい", "ほそく", "ほたて", "ほたる",
+"ぽちぶくろ", "ほっきょく", "ほっさ", "ほったん", "ほとんど", "ほめる", "ほんい", "ほんき", "ほんけ", "ほんしつ",
+"ほんやく", "まいにち", "まかい", "まかせる", "まがる", "まける", "まこと", "まさつ", "まじめ", "ますく",
+"まぜる", "まつり", "まとめ", "まなぶ", "まぬけ", "まねく", "まほう", "まもる", "まゆげ", "まよう",
+"まろやか", "まわす", "まわり", "まわる", "まんが", "まんきつ", "まんぞく", "まんなか", "みいら", "みうち",
+"みえる", "みがく", "みかた", "みかん", "みけん", "みこん", "みじかい", "みすい", "みすえる", "みせる",
+"みっか", "みつかる", "みつける", "みてい", "みとめる", "みなと", "みなみかさい", "みねらる", "みのう", "みのがす",
+"みほん", "みもと", "みやげ", "みらい", "みりょく", "みわく", "みんか", "みんぞく", "むいか", "むえき",
+"むえん", "むかい", "むかう", "むかえ", "むかし", "むぎちゃ", "むける", "むげん", "むさぼる", "むしあつい",
+"むしば", "むじゅん", "むしろ", "むすう", "むすこ", "むすぶ", "むすめ", "むせる", "むせん", "むちゅう",
+"むなしい", "むのう", "むやみ", "むよう", "むらさき", "むりょう", "むろん", "めいあん", "めいうん", "めいえん",
+"めいかく", "めいきょく", "めいさい", "めいし", "めいそう", "めいぶつ", "めいれい", "めいわく", "めぐまれる", "めざす",
+"めした", "めずらしい", "めだつ", "めまい", "めやす", "めんきょ", "めんせき", "めんどう", "もうしあげる", "もうどうけん",
+"もえる", "もくし", "もくてき", "もくようび", "もちろん", "もどる", "もらう", "もんく", "もんだい", "やおや",
+"やける", "やさい", "やさしい", "やすい", "やすたろう", "やすみ", "やせる", "やそう", "やたい", "やちん",
+"やっと", "やっぱり", "やぶる", "やめる", "ややこしい", "やよい", "やわらかい", "ゆうき", "ゆうびんきょく", "ゆうべ",
+"ゆうめい", "ゆけつ", "ゆしゅつ", "ゆせん", "ゆそう", "ゆたか", "ゆちゃく", "ゆでる", "ゆにゅう", "ゆびわ",
+"ゆらい", "ゆれる", "ようい", "ようか", "ようきゅう", "ようじ", "ようす", "ようちえん", "よかぜ", "よかん",
+"よきん", "よくせい", "よくぼう", "よけい", "よごれる", "よさん", "よしゅう", "よそう", "よそく", "よっか",
+"よてい", "よどがわく", "よねつ", "よやく", "よゆう", "よろこぶ", "よろしい", "らいう", "らくがき", "らくご",
+"らくさつ", "らくだ", "らしんばん", "らせん", "らぞく", "らたい", "らっか", "られつ", "りえき", "りかい",
+"りきさく", "りきせつ", "りくぐん", "りくつ", "りけん", "りこう", "りせい", "りそう", "りそく", "りてん",
+"りねん", "りゆう", "りゅうがく", "りよう", "りょうり", "りょかん", "りょくちゃ", "りょこう", "りりく", "りれき",
+"りろん", "りんご", "るいけい", "るいさい", "るいじ", "るいせき", "るすばん", "るりがわら", "れいかん", "れいぎ",
+"れいせい", "れいぞうこ", "れいとう", "れいぼう", "れきし", "れきだい", "れんあい", "れんけい", "れんこん", "れんさい",
+"れんしゅう", "れんぞく", "れんらく", "ろうか", "ろうご", "ろうじん", "ろうそく", "ろくが", "ろこつ", "ろじうら",
+"ろしゅつ", "ろせん", "ろてん", "ろめん", "ろれつ", "ろんぎ", "ろんぱ", "ろんぶん", "ろんり", "わかす",
+"わかめ", "わかやま", "わかれる", "わしつ", "わじまし", "わすれもの", "わらう", "われる"]
+</script>
+ <script>WORDLISTS = typeof WORDLISTS == "undefined" ? {} : WORDLISTS;
+WORDLISTS["spanish"] = [
+"ábaco", "abdomen", "abeja", "abierto", "abogado", "abono", "aborto", "abrazo", "abrir", "abuelo",
+"abuso", "acabar", "academia", "acceso", "acción", "aceite", "acelga", "acento", "aceptar", "ácido",
+"aclarar", "acné", "acoger", "acoso", "activo", "acto", "actriz", "actuar", "acudir", "acuerdo",
+"acusar", "adicto", "admitir", "adoptar", "adorno", "aduana", "adulto", "aéreo", "afectar", "afición",
+"afinar", "afirmar", "ágil", "agitar", "agonía", "agosto", "agotar", "agregar", "agrio", "agua",
+"agudo", "águila", "aguja", "ahogo", "ahorro", "aire", "aislar", "ajedrez", "ajeno", "ajuste",
+"alacrán", "alambre", "alarma", "alba", "álbum", "alcalde", "aldea", "alegre", "alejar", "alerta",
+"aleta", "alfiler", "alga", "algodón", "aliado", "aliento", "alivio", "alma", "almeja", "almíbar",
+"altar", "alteza", "altivo", "alto", "altura", "alumno", "alzar", "amable", "amante", "amapola",
+"amargo", "amasar", "ámbar", "ámbito", "ameno", "amigo", "amistad", "amor", "amparo", "amplio",
+"ancho", "anciano", "ancla", "andar", "andén", "anemia", "ángulo", "anillo", "ánimo", "anís",
+"anotar", "antena", "antiguo", "antojo", "anual", "anular", "anuncio", "añadir", "añejo", "año",
+"apagar", "aparato", "apetito", "apio", "aplicar", "apodo", "aporte", "apoyo", "aprender", "aprobar",
+"apuesta", "apuro", "arado", "araña", "arar", "árbitro", "árbol", "arbusto", "archivo", "arco",
+"arder", "ardilla", "arduo", "área", "árido", "aries", "armonía", "arnés", "aroma", "arpa",
+"arpón", "arreglo", "arroz", "arruga", "arte", "artista", "asa", "asado", "asalto", "ascenso",
+"asegurar", "aseo", "asesor", "asiento", "asilo", "asistir", "asno", "asombro", "áspero", "astilla",
+"astro", "astuto", "asumir", "asunto", "atajo", "ataque", "atar", "atento", "ateo", "ático",
+"atleta", "átomo", "atraer", "atroz", "atún", "audaz", "audio", "auge", "aula", "aumento",
+"ausente", "autor", "aval", "avance", "avaro", "ave", "avellana", "avena", "avestruz", "avión",
+"aviso", "ayer", "ayuda", "ayuno", "azafrán", "azar", "azote", "azúcar", "azufre", "azul",
+"baba", "babor", "bache", "bahía", "baile", "bajar", "balanza", "balcón", "balde", "bambú",
+"banco", "banda", "baño", "barba", "barco", "barniz", "barro", "báscula", "bastón", "basura",
+"batalla", "batería", "batir", "batuta", "baúl", "bazar", "bebé", "bebida", "bello", "besar",
+"beso", "bestia", "bicho", "bien", "bingo", "blanco", "bloque", "blusa", "boa", "bobina",
+"bobo", "boca", "bocina", "boda", "bodega", "boina", "bola", "bolero", "bolsa", "bomba",
+"bondad", "bonito", "bono", "bonsái", "borde", "borrar", "bosque", "bote", "botín", "bóveda",
+"bozal", "bravo", "brazo", "brecha", "breve", "brillo", "brinco", "brisa", "broca", "broma",
+"bronce", "brote", "bruja", "brusco", "bruto", "buceo", "bucle", "bueno", "buey", "bufanda",
+"bufón", "búho", "buitre", "bulto", "burbuja", "burla", "burro", "buscar", "butaca", "buzón",
+"caballo", "cabeza", "cabina", "cabra", "cacao", "cadáver", "cadena", "caer", "café", "caída",
+"caimán", "caja", "cajón", "cal", "calamar", "calcio", "caldo", "calidad", "calle", "calma",
+"calor", "calvo", "cama", "cambio", "camello", "camino", "campo", "cáncer", "candil", "canela",
+"canguro", "canica", "canto", "caña", "cañón", "caoba", "caos", "capaz", "capitán", "capote",
+"captar", "capucha", "cara", "carbón", "cárcel", "careta", "carga", "cariño", "carne", "carpeta",
+"carro", "carta", "casa", "casco", "casero", "caspa", "castor", "catorce", "catre", "caudal",
+"causa", "cazo", "cebolla", "ceder", "cedro", "celda", "célebre", "celoso", "célula", "cemento",
+"ceniza", "centro", "cerca", "cerdo", "cereza", "cero", "cerrar", "certeza", "césped", "cetro",
+"chacal", "chaleco", "champú", "chancla", "chapa", "charla", "chico", "chiste", "chivo", "choque",
+"choza", "chuleta", "chupar", "ciclón", "ciego", "cielo", "cien", "cierto", "cifra", "cigarro",
+"cima", "cinco", "cine", "cinta", "ciprés", "circo", "ciruela", "cisne", "cita", "ciudad",
+"clamor", "clan", "claro", "clase", "clave", "cliente", "clima", "clínica", "cobre", "cocción",
+"cochino", "cocina", "coco", "código", "codo", "cofre", "coger", "cohete", "cojín", "cojo",
+"cola", "colcha", "colegio", "colgar", "colina", "collar", "colmo", "columna", "combate", "comer",
+"comida", "cómodo", "compra", "conde", "conejo", "conga", "conocer", "consejo", "contar", "copa",
+"copia", "corazón", "corbata", "corcho", "cordón", "corona", "correr", "coser", "cosmos", "costa",
+"cráneo", "cráter", "crear", "crecer", "creído", "crema", "cría", "crimen", "cripta", "crisis",
+"cromo", "crónica", "croqueta", "crudo", "cruz", "cuadro", "cuarto", "cuatro", "cubo", "cubrir",
+"cuchara", "cuello", "cuento", "cuerda", "cuesta", "cueva", "cuidar", "culebra", "culpa", "culto",
+"cumbre", "cumplir", "cuna", "cuneta", "cuota", "cupón", "cúpula", "curar", "curioso", "curso",
+"curva", "cutis", "dama", "danza", "dar", "dardo", "dátil", "deber", "débil", "década",
+"decir", "dedo", "defensa", "definir", "dejar", "delfín", "delgado", "delito", "demora", "denso",
+"dental", "deporte", "derecho", "derrota", "desayuno", "deseo", "desfile", "desnudo", "destino", "desvío",
+"detalle", "detener", "deuda", "día", "diablo", "diadema", "diamante", "diana", "diario", "dibujo",
+"dictar", "diente", "dieta", "diez", "difícil", "digno", "dilema", "diluir", "dinero", "directo",
+"dirigir", "disco", "diseño", "disfraz", "diva", "divino", "doble", "doce", "dolor", "domingo",
+"don", "donar", "dorado", "dormir", "dorso", "dos", "dosis", "dragón", "droga", "ducha",
+"duda", "duelo", "dueño", "dulce", "dúo", "duque", "durar", "dureza", "duro", "ébano",
+"ebrio", "echar", "eco", "ecuador", "edad", "edición", "edificio", "editor", "educar", "efecto",
+"eficaz", "eje", "ejemplo", "elefante", "elegir", "elemento", "elevar", "elipse", "élite", "elixir",
+"elogio", "eludir", "embudo", "emitir", "emoción", "empate", "empeño", "empleo", "empresa", "enano",
+"encargo", "enchufe", "encía", "enemigo", "enero", "enfado", "enfermo", "engaño", "enigma", "enlace",
+"enorme", "enredo", "ensayo", "enseñar", "entero", "entrar", "envase", "envío", "época", "equipo",
+"erizo", "escala", "escena", "escolar", "escribir", "escudo", "esencia", "esfera", "esfuerzo", "espada",
+"espejo", "espía", "esposa", "espuma", "esquí", "estar", "este", "estilo", "estufa", "etapa",
+"eterno", "ética", "etnia", "evadir", "evaluar", "evento", "evitar", "exacto", "examen", "exceso",
+"excusa", "exento", "exigir", "exilio", "existir", "éxito", "experto", "explicar", "exponer", "extremo",
+"fábrica", "fábula", "fachada", "fácil", "factor", "faena", "faja", "falda", "fallo", "falso",
+"faltar", "fama", "familia", "famoso", "faraón", "farmacia", "farol", "farsa", "fase", "fatiga",
+"fauna", "favor", "fax", "febrero", "fecha", "feliz", "feo", "feria", "feroz", "fértil",
+"fervor", "festín", "fiable", "fianza", "fiar", "fibra", "ficción", "ficha", "fideo", "fiebre",
+"fiel", "fiera", "fiesta", "figura", "fijar", "fijo", "fila", "filete", "filial", "filtro",
+"fin", "finca", "fingir", "finito", "firma", "flaco", "flauta", "flecha", "flor", "flota",
+"fluir", "flujo", "flúor", "fobia", "foca", "fogata", "fogón", "folio", "folleto", "fondo",
+"forma", "forro", "fortuna", "forzar", "fosa", "foto", "fracaso", "frágil", "franja", "frase",
+"fraude", "freír", "freno", "fresa", "frío", "frito", "fruta", "fuego", "fuente", "fuerza",
+"fuga", "fumar", "función", "funda", "furgón", "furia", "fusil", "fútbol", "futuro", "gacela",
+"gafas", "gaita", "gajo", "gala", "galería", "gallo", "gamba", "ganar", "gancho", "ganga",
+"ganso", "garaje", "garza", "gasolina", "gastar", "gato", "gavilán", "gemelo", "gemir", "gen",
+"género", "genio", "gente", "geranio", "gerente", "germen", "gesto", "gigante", "gimnasio", "girar",
+"giro", "glaciar", "globo", "gloria", "gol", "golfo", "goloso", "golpe", "goma", "gordo",
+"gorila", "gorra", "gota", "goteo", "gozar", "grada", "gráfico", "grano", "grasa", "gratis",
+"grave", "grieta", "grillo", "gripe", "gris", "grito", "grosor", "grúa", "grueso", "grumo",
+"grupo", "guante", "guapo", "guardia", "guerra", "guía", "guiño", "guion", "guiso", "guitarra",
+"gusano", "gustar", "haber", "hábil", "hablar", "hacer", "hacha", "hada", "hallar", "hamaca",
+"harina", "haz", "hazaña", "hebilla", "hebra", "hecho", "helado", "helio", "hembra", "herir",
+"hermano", "héroe", "hervir", "hielo", "hierro", "hígado", "higiene", "hijo", "himno", "historia",
+"hocico", "hogar", "hoguera", "hoja", "hombre", "hongo", "honor", "honra", "hora", "hormiga",
+"horno", "hostil", "hoyo", "hueco", "huelga", "huerta", "hueso", "huevo", "huida", "huir",
+"humano", "húmedo", "humilde", "humo", "hundir", "huracán", "hurto", "icono", "ideal", "idioma",
+"ídolo", "iglesia", "iglú", "igual", "ilegal", "ilusión", "imagen", "imán", "imitar", "impar",
+"imperio", "imponer", "impulso", "incapaz", "índice", "inerte", "infiel", "informe", "ingenio", "inicio",
+"inmenso", "inmune", "innato", "insecto", "instante", "interés", "íntimo", "intuir", "inútil", "invierno",
+"ira", "iris", "ironía", "isla", "islote", "jabalí", "jabón", "jamón", "jarabe", "jardín",
+"jarra", "jaula", "jazmín", "jefe", "jeringa", "jinete", "jornada", "joroba", "joven", "joya",
+"juerga", "jueves", "juez", "jugador", "jugo", "juguete", "juicio", "junco", "jungla", "junio",
+"juntar", "júpiter", "jurar", "justo", "juvenil", "juzgar", "kilo", "koala", "labio", "lacio",
+"lacra", "lado", "ladrón", "lagarto", "lágrima", "laguna", "laico", "lamer", "lámina", "lámpara",
+"lana", "lancha", "langosta", "lanza", "lápiz", "largo", "larva", "lástima", "lata", "látex",
+"latir", "laurel", "lavar", "lazo", "leal", "lección", "leche", "lector", "leer", "legión",
+"legumbre", "lejano", "lengua", "lento", "leña", "león", "leopardo", "lesión", "letal", "letra",
+"leve", "leyenda", "libertad", "libro", "licor", "líder", "lidiar", "lienzo", "liga", "ligero",
+"lima", "límite", "limón", "limpio", "lince", "lindo", "línea", "lingote", "lino", "linterna",
+"líquido", "liso", "lista", "litera", "litio", "litro", "llaga", "llama", "llanto", "llave",
+"llegar", "llenar", "llevar", "llorar", "llover", "lluvia", "lobo", "loción", "loco", "locura",
+"lógica", "logro", "lombriz", "lomo", "lonja", "lote", "lucha", "lucir", "lugar", "lujo",
+"luna", "lunes", "lupa", "lustro", "luto", "luz", "maceta", "macho", "madera", "madre",
+"maduro", "maestro", "mafia", "magia", "mago", "maíz", "maldad", "maleta", "malla", "malo",
+"mamá", "mambo", "mamut", "manco", "mando", "manejar", "manga", "maniquí", "manjar", "mano",
+"manso", "manta", "mañana", "mapa", "máquina", "mar", "marco", "marea", "marfil", "margen",
+"marido", "mármol", "marrón", "martes", "marzo", "masa", "máscara", "masivo", "matar", "materia",
+"matiz", "matriz", "máximo", "mayor", "mazorca", "mecha", "medalla", "medio", "médula", "mejilla",
+"mejor", "melena", "melón", "memoria", "menor", "mensaje", "mente", "menú", "mercado", "merengue",
+"mérito", "mes", "mesón", "meta", "meter", "método", "metro", "mezcla", "miedo", "miel",
+"miembro", "miga", "mil", "milagro", "militar", "millón", "mimo", "mina", "minero", "mínimo",
+"minuto", "miope", "mirar", "misa", "miseria", "misil", "mismo", "mitad", "mito", "mochila",
+"moción", "moda", "modelo", "moho", "mojar", "molde", "moler", "molino", "momento", "momia",
+"monarca", "moneda", "monja", "monto", "moño", "morada", "morder", "moreno", "morir", "morro",
+"morsa", "mortal", "mosca", "mostrar", "motivo", "mover", "móvil", "mozo", "mucho", "mudar",
+"mueble", "muela", "muerte", "muestra", "mugre", "mujer", "mula", "muleta", "multa", "mundo",
+"muñeca", "mural", "muro", "músculo", "museo", "musgo", "música", "muslo", "nácar", "nación",
+"nadar", "naipe", "naranja", "nariz", "narrar", "nasal", "natal", "nativo", "natural", "náusea",
+"naval", "nave", "navidad", "necio", "néctar", "negar", "negocio", "negro", "neón", "nervio",
+"neto", "neutro", "nevar", "nevera", "nicho", "nido", "niebla", "nieto", "niñez", "niño",
+"nítido", "nivel", "nobleza", "noche", "nómina", "noria", "norma", "norte", "nota", "noticia",
+"novato", "novela", "novio", "nube", "nuca", "núcleo", "nudillo", "nudo", "nuera", "nueve",
+"nuez", "nulo", "número", "nutria", "oasis", "obeso", "obispo", "objeto", "obra", "obrero",
+"observar", "obtener", "obvio", "oca", "ocaso", "océano", "ochenta", "ocho", "ocio", "ocre",
+"octavo", "octubre", "oculto", "ocupar", "ocurrir", "odiar", "odio", "odisea", "oeste", "ofensa",
+"oferta", "oficio", "ofrecer", "ogro", "oído", "oír", "ojo", "ola", "oleada", "olfato",
+"olivo", "olla", "olmo", "olor", "olvido", "ombligo", "onda", "onza", "opaco", "opción",
+"ópera", "opinar", "oponer", "optar", "óptica", "opuesto", "oración", "orador", "oral", "órbita",
+"orca", "orden", "oreja", "órgano", "orgía", "orgullo", "oriente", "origen", "orilla", "oro",
+"orquesta", "oruga", "osadía", "oscuro", "osezno", "oso", "ostra", "otoño", "otro", "oveja",
+"óvulo", "óxido", "oxígeno", "oyente", "ozono", "pacto", "padre", "paella", "página", "pago",
+"país", "pájaro", "palabra", "palco", "paleta", "pálido", "palma", "paloma", "palpar", "pan",
+"panal", "pánico", "pantera", "pañuelo", "papá", "papel", "papilla", "paquete", "parar", "parcela",
+"pared", "parir", "paro", "párpado", "parque", "párrafo", "parte", "pasar", "paseo", "pasión",
+"paso", "pasta", "pata", "patio", "patria", "pausa", "pauta", "pavo", "payaso", "peatón",
+"pecado", "pecera", "pecho", "pedal", "pedir", "pegar", "peine", "pelar", "peldaño", "pelea",
+"peligro", "pellejo", "pelo", "peluca", "pena", "pensar", "peñón", "peón", "peor", "pepino",
+"pequeño", "pera", "percha", "perder", "pereza", "perfil", "perico", "perla", "permiso", "perro",
+"persona", "pesa", "pesca", "pésimo", "pestaña", "pétalo", "petróleo", "pez", "pezuña", "picar",
+"pichón", "pie", "piedra", "pierna", "pieza", "pijama", "pilar", "piloto", "pimienta", "pino",
+"pintor", "pinza", "piña", "piojo", "pipa", "pirata", "pisar", "piscina", "piso", "pista",
+"pitón", "pizca", "placa", "plan", "plata", "playa", "plaza", "pleito", "pleno", "plomo",
+"pluma", "plural", "pobre", "poco", "poder", "podio", "poema", "poesía", "poeta", "polen",
+"policía", "pollo", "polvo", "pomada", "pomelo", "pomo", "pompa", "poner", "porción", "portal",
+"posada", "poseer", "posible", "poste", "potencia", "potro", "pozo", "prado", "precoz", "pregunta",
+"premio", "prensa", "preso", "previo", "primo", "príncipe", "prisión", "privar", "proa", "probar",
+"proceso", "producto", "proeza", "profesor", "programa", "prole", "promesa", "pronto", "propio", "próximo",
+"prueba", "público", "puchero", "pudor", "pueblo", "puerta", "puesto", "pulga", "pulir", "pulmón",
+"pulpo", "pulso", "puma", "punto", "puñal", "puño", "pupa", "pupila", "puré", "quedar",
+"queja", "quemar", "querer", "queso", "quieto", "química", "quince", "quitar", "rábano", "rabia",
+"rabo", "ración", "radical", "raíz", "rama", "rampa", "rancho", "rango", "rapaz", "rápido",
+"rapto", "rasgo", "raspa", "rato", "rayo", "raza", "razón", "reacción", "realidad", "rebaño",
+"rebote", "recaer", "receta", "rechazo", "recoger", "recreo", "recto", "recurso", "red", "redondo",
+"reducir", "reflejo", "reforma", "refrán", "refugio", "regalo", "regir", "regla", "regreso", "rehén",
+"reino", "reír", "reja", "relato", "relevo", "relieve", "relleno", "reloj", "remar", "remedio",
+"remo", "rencor", "rendir", "renta", "reparto", "repetir", "reposo", "reptil", "res", "rescate",
+"resina", "respeto", "resto", "resumen", "retiro", "retorno", "retrato", "reunir", "revés", "revista",
+"rey", "rezar", "rico", "riego", "rienda", "riesgo", "rifa", "rígido", "rigor", "rincón",
+"riñón", "río", "riqueza", "risa", "ritmo", "rito", "rizo", "roble", "roce", "rociar",
+"rodar", "rodeo", "rodilla", "roer", "rojizo", "rojo", "romero", "romper", "ron", "ronco",
+"ronda", "ropa", "ropero", "rosa", "rosca", "rostro", "rotar", "rubí", "rubor", "rudo",
+"rueda", "rugir", "ruido", "ruina", "ruleta", "rulo", "rumbo", "rumor", "ruptura", "ruta",
+"rutina", "sábado", "saber", "sabio", "sable", "sacar", "sagaz", "sagrado", "sala", "saldo",
+"salero", "salir", "salmón", "salón", "salsa", "salto", "salud", "salvar", "samba", "sanción",
+"sandía", "sanear", "sangre", "sanidad", "sano", "santo", "sapo", "saque", "sardina", "sartén",
+"sastre", "satán", "sauna", "saxofón", "sección", "seco", "secreto", "secta", "sed", "seguir",
+"seis", "sello", "selva", "semana", "semilla", "senda", "sensor", "señal", "señor", "separar",
+"sepia", "sequía", "ser", "serie", "sermón", "servir", "sesenta", "sesión", "seta", "setenta",
+"severo", "sexo", "sexto", "sidra", "siesta", "siete", "siglo", "signo", "sílaba", "silbar",
+"silencio", "silla", "símbolo", "simio", "sirena", "sistema", "sitio", "situar", "sobre", "socio",
+"sodio", "sol", "solapa", "soldado", "soledad", "sólido", "soltar", "solución", "sombra", "sondeo",
+"sonido", "sonoro", "sonrisa", "sopa", "soplar", "soporte", "sordo", "sorpresa", "sorteo", "sostén",
+"sótano", "suave", "subir", "suceso", "sudor", "suegra", "suelo", "sueño", "suerte", "sufrir",
+"sujeto", "sultán", "sumar", "superar", "suplir", "suponer", "supremo", "sur", "surco", "sureño",
+"surgir", "susto", "sutil", "tabaco", "tabique", "tabla", "tabú", "taco", "tacto", "tajo",
+"talar", "talco", "talento", "talla", "talón", "tamaño", "tambor", "tango", "tanque", "tapa",
+"tapete", "tapia", "tapón", "taquilla", "tarde", "tarea", "tarifa", "tarjeta", "tarot", "tarro",
+"tarta", "tatuaje", "tauro", "taza", "tazón", "teatro", "techo", "tecla", "técnica", "tejado",
+"tejer", "tejido", "tela", "teléfono", "tema", "temor", "templo", "tenaz", "tender", "tener",
+"tenis", "tenso", "teoría", "terapia", "terco", "término", "ternura", "terror", "tesis", "tesoro",
+"testigo", "tetera", "texto", "tez", "tibio", "tiburón", "tiempo", "tienda", "tierra", "tieso",
+"tigre", "tijera", "tilde", "timbre", "tímido", "timo", "tinta", "tío", "típico", "tipo",
+"tira", "tirón", "titán", "títere", "título", "tiza", "toalla", "tobillo", "tocar", "tocino",
+"todo", "toga", "toldo", "tomar", "tono", "tonto", "topar", "tope", "toque", "tórax",
+"torero", "tormenta", "torneo", "toro", "torpedo", "torre", "torso", "tortuga", "tos", "tosco",
+"toser", "tóxico", "trabajo", "tractor", "traer", "tráfico", "trago", "traje", "tramo", "trance",
+"trato", "trauma", "trazar", "trébol", "tregua", "treinta", "tren", "trepar", "tres", "tribu",
+"trigo", "tripa", "triste", "triunfo", "trofeo", "trompa", "tronco", "tropa", "trote", "trozo",
+"truco", "trueno", "trufa", "tubería", "tubo", "tuerto", "tumba", "tumor", "túnel", "túnica",
+"turbina", "turismo", "turno", "tutor", "ubicar", "úlcera", "umbral", "unidad", "unir", "universo",
+"uno", "untar", "uña", "urbano", "urbe", "urgente", "urna", "usar", "usuario", "útil",
+"utopía", "uva", "vaca", "vacío", "vacuna", "vagar", "vago", "vaina", "vajilla", "vale",
+"válido", "valle", "valor", "válvula", "vampiro", "vara", "variar", "varón", "vaso", "vecino",
+"vector", "vehículo", "veinte", "vejez", "vela", "velero", "veloz", "vena", "vencer", "venda",
+"veneno", "vengar", "venir", "venta", "venus", "ver", "verano", "verbo", "verde", "vereda",
+"verja", "verso", "verter", "vía", "viaje", "vibrar", "vicio", "víctima", "vida", "vídeo",
+"vidrio", "viejo", "viernes", "vigor", "vil", "villa", "vinagre", "vino", "viñedo", "violín",
+"viral", "virgo", "virtud", "visor", "víspera", "vista", "vitamina", "viudo", "vivaz", "vivero",
+"vivir", "vivo", "volcán", "volumen", "volver", "voraz", "votar", "voto", "voz", "vuelo",
+"vulgar", "yacer", "yate", "yegua", "yema", "yerno", "yeso", "yodo", "yoga", "yogur",
+"zafiro", "zanja", "zapato", "zarza", "zona", "zorro", "zumo", "zurdo"]
+</script>
+ <script>WORDLISTS = typeof WORDLISTS == "undefined" ? {} : WORDLISTS;
+WORDLISTS["chinese_simplified"] = [
+"的", "一", "是", "在", "不", "了", "有", "和", "人", "这",
+"中", "大", "为", "上", "个", "国", "我", "以", "要", "他",
+"时", "来", "用", "们", "生", "到", "作", "地", "于", "出",
+"就", "分", "对", "成", "会", "可", "主", "发", "年", "动",
+"同", "工", "也", "能", "下", "过", "子", "说", "产", "种",
+"面", "而", "方", "后", "多", "定", "行", "学", "法", "所",
+"民", "得", "经", "十", "三", "之", "进", "着", "等", "部",
+"度", "家", "电", "力", "里", "如", "水", "化", "高", "自",
+"二", "理", "起", "小", "物", "现", "实", "加", "量", "都",
+"两", "体", "制", "机", "当", "使", "点", "从", "业", "本",
+"去", "把", "性", "好", "应", "开", "它", "合", "还", "因",
+"由", "其", "些", "然", "前", "外", "天", "政", "四", "日",
+"那", "社", "义", "事", "平", "形", "相", "全", "表", "间",
+"样", "与", "关", "各", "重", "新", "线", "内", "数", "正",
+"心", "反", "你", "明", "看", "原", "又", "么", "利", "比",
+"或", "但", "质", "气", "第", "向", "道", "命", "此", "变",
+"条", "只", "没", "结", "解", "问", "意", "建", "月", "公",
+"无", "系", "军", "很", "情", "者", "最", "立", "代", "想",
+"已", "通", "并", "提", "直", "题", "党", "程", "展", "五",
+"果", "料", "象", "员", "革", "位", "入", "常", "文", "总",
+"次", "品", "式", "活", "设", "及", "管", "特", "件", "长",
+"求", "老", "头", "基", "资", "边", "流", "路", "级", "少",
+"图", "山", "统", "接", "知", "较", "将", "组", "见", "计",
+"别", "她", "手", "角", "期", "根", "论", "运", "农", "指",
+"几", "九", "区", "强", "放", "决", "西", "被", "干", "做",
+"必", "战", "先", "回", "则", "任", "取", "据", "处", "队",
+"南", "给", "色", "光", "门", "即", "保", "治", "北", "造",
+"百", "规", "热", "领", "七", "海", "口", "东", "导", "器",
+"压", "志", "世", "金", "增", "争", "济", "阶", "油", "思",
+"术", "极", "交", "受", "联", "什", "认", "六", "共", "权",
+"收", "证", "改", "清", "美", "再", "采", "转", "更", "单",
+"风", "切", "打", "白", "教", "速", "花", "带", "安", "场",
+"身", "车", "例", "真", "务", "具", "万", "每", "目", "至",
+"达", "走", "积", "示", "议", "声", "报", "斗", "完", "类",
+"八", "离", "华", "名", "确", "才", "科", "张", "信", "马",
+"节", "话", "米", "整", "空", "元", "况", "今", "集", "温",
+"传", "土", "许", "步", "群", "广", "石", "记", "需", "段",
+"研", "界", "拉", "林", "律", "叫", "且", "究", "观", "越",
+"织", "装", "影", "算", "低", "持", "音", "众", "书", "布",
+"复", "容", "儿", "须", "际", "商", "非", "验", "连", "断",
+"深", "难", "近", "矿", "千", "周", "委", "素", "技", "备",
+"半", "办", "青", "省", "列", "习", "响", "约", "支", "般",
+"史", "感", "劳", "便", "团", "往", "酸", "历", "市", "克",
+"何", "除", "消", "构", "府", "称", "太", "准", "精", "值",
+"号", "率", "族", "维", "划", "选", "标", "写", "存", "候",
+"毛", "亲", "快", "效", "斯", "院", "查", "江", "型", "眼",
+"王", "按", "格", "养", "易", "置", "派", "层", "片", "始",
+"却", "专", "状", "育", "厂", "京", "识", "适", "属", "圆",
+"包", "火", "住", "调", "满", "县", "局", "照", "参", "红",
+"细", "引", "听", "该", "铁", "价", "严", "首", "底", "液",
+"官", "德", "随", "病", "苏", "失", "尔", "死", "讲", "配",
+"女", "黄", "推", "显", "谈", "罪", "神", "艺", "呢", "席",
+"含", "企", "望", "密", "批", "营", "项", "防", "举", "球",
+"英", "氧", "势", "告", "李", "台", "落", "木", "帮", "轮",
+"破", "亚", "师", "围", "注", "远", "字", "材", "排", "供",
+"河", "态", "封", "另", "施", "减", "树", "溶", "怎", "止",
+"案", "言", "士", "均", "武", "固", "叶", "鱼", "波", "视",
+"仅", "费", "紧", "爱", "左", "章", "早", "朝", "害", "续",
+"轻", "服", "试", "食", "充", "兵", "源", "判", "护", "司",
+"足", "某", "练", "差", "致", "板", "田", "降", "黑", "犯",
+"负", "击", "范", "继", "兴", "似", "余", "坚", "曲", "输",
+"修", "故", "城", "夫", "够", "送", "笔", "船", "占", "右",
+"财", "吃", "富", "春", "职", "觉", "汉", "画", "功", "巴",
+"跟", "虽", "杂", "飞", "检", "吸", "助", "升", "阳", "互",
+"初", "创", "抗", "考", "投", "坏", "策", "古", "径", "换",
+"未", "跑", "留", "钢", "曾", "端", "责", "站", "简", "述",
+"钱", "副", "尽", "帝", "射", "草", "冲", "承", "独", "令",
+"限", "阿", "宣", "环", "双", "请", "超", "微", "让", "控",
+"州", "良", "轴", "找", "否", "纪", "益", "依", "优", "顶",
+"础", "载", "倒", "房", "突", "坐", "粉", "敌", "略", "客",
+"袁", "冷", "胜", "绝", "析", "块", "剂", "测", "丝", "协",
+"诉", "念", "陈", "仍", "罗", "盐", "友", "洋", "错", "苦",
+"夜", "刑", "移", "频", "逐", "靠", "混", "母", "短", "皮",
+"终", "聚", "汽", "村", "云", "哪", "既", "距", "卫", "停",
+"烈", "央", "察", "烧", "迅", "境", "若", "印", "洲", "刻",
+"括", "激", "孔", "搞", "甚", "室", "待", "核", "校", "散",
+"侵", "吧", "甲", "游", "久", "菜", "味", "旧", "模", "湖",
+"货", "损", "预", "阻", "毫", "普", "稳", "乙", "妈", "植",
+"息", "扩", "银", "语", "挥", "酒", "守", "拿", "序", "纸",
+"医", "缺", "雨", "吗", "针", "刘", "啊", "急", "唱", "误",
+"训", "愿", "审", "附", "获", "茶", "鲜", "粮", "斤", "孩",
+"脱", "硫", "肥", "善", "龙", "演", "父", "渐", "血", "欢",
+"械", "掌", "歌", "沙", "刚", "攻", "谓", "盾", "讨", "晚",
+"粒", "乱", "燃", "矛", "乎", "杀", "药", "宁", "鲁", "贵",
+"钟", "煤", "读", "班", "伯", "香", "介", "迫", "句", "丰",
+"培", "握", "兰", "担", "弦", "蛋", "沉", "假", "穿", "执",
+"答", "乐", "谁", "顺", "烟", "缩", "征", "脸", "喜", "松",
+"脚", "困", "异", "免", "背", "星", "福", "买", "染", "井",
+"概", "慢", "怕", "磁", "倍", "祖", "皇", "促", "静", "补",
+"评", "翻", "肉", "践", "尼", "衣", "宽", "扬", "棉", "希",
+"伤", "操", "垂", "秋", "宜", "氢", "套", "督", "振", "架",
+"亮", "末", "宪", "庆", "编", "牛", "触", "映", "雷", "销",
+"诗", "座", "居", "抓", "裂", "胞", "呼", "娘", "景", "威",
+"绿", "晶", "厚", "盟", "衡", "鸡", "孙", "延", "危", "胶",
+"屋", "乡", "临", "陆", "顾", "掉", "呀", "灯", "岁", "措",
+"束", "耐", "剧", "玉", "赵", "跳", "哥", "季", "课", "凯",
+"胡", "额", "款", "绍", "卷", "齐", "伟", "蒸", "殖", "永",
+"宗", "苗", "川", "炉", "岩", "弱", "零", "杨", "奏", "沿",
+"露", "杆", "探", "滑", "镇", "饭", "浓", "航", "怀", "赶",
+"库", "夺", "伊", "灵", "税", "途", "灭", "赛", "归", "召",
+"鼓", "播", "盘", "裁", "险", "康", "唯", "录", "菌", "纯",
+"借", "糖", "盖", "横", "符", "私", "努", "堂", "域", "枪",
+"润", "幅", "哈", "竟", "熟", "虫", "泽", "脑", "壤", "碳",
+"欧", "遍", "侧", "寨", "敢", "彻", "虑", "斜", "薄", "庭",
+"纳", "弹", "饲", "伸", "折", "麦", "湿", "暗", "荷", "瓦",
+"塞", "床", "筑", "恶", "户", "访", "塔", "奇", "透", "梁",
+"刀", "旋", "迹", "卡", "氯", "遇", "份", "毒", "泥", "退",
+"洗", "摆", "灰", "彩", "卖", "耗", "夏", "择", "忙", "铜",
+"献", "硬", "予", "繁", "圈", "雪", "函", "亦", "抽", "篇",
+"阵", "阴", "丁", "尺", "追", "堆", "雄", "迎", "泛", "爸",
+"楼", "避", "谋", "吨", "野", "猪", "旗", "累", "偏", "典",
+"馆", "索", "秦", "脂", "潮", "爷", "豆", "忽", "托", "惊",
+"塑", "遗", "愈", "朱", "替", "纤", "粗", "倾", "尚", "痛",
+"楚", "谢", "奋", "购", "磨", "君", "池", "旁", "碎", "骨",
+"监", "捕", "弟", "暴", "割", "贯", "殊", "释", "词", "亡",
+"壁", "顿", "宝", "午", "尘", "闻", "揭", "炮", "残", "冬",
+"桥", "妇", "警", "综", "招", "吴", "付", "浮", "遭", "徐",
+"您", "摇", "谷", "赞", "箱", "隔", "订", "男", "吹", "园",
+"纷", "唐", "败", "宋", "玻", "巨", "耕", "坦", "荣", "闭",
+"湾", "键", "凡", "驻", "锅", "救", "恩", "剥", "凝", "碱",
+"齿", "截", "炼", "麻", "纺", "禁", "废", "盛", "版", "缓",
+"净", "睛", "昌", "婚", "涉", "筒", "嘴", "插", "岸", "朗",
+"庄", "街", "藏", "姑", "贸", "腐", "奴", "啦", "惯", "乘",
+"伙", "恢", "匀", "纱", "扎", "辩", "耳", "彪", "臣", "亿",
+"璃", "抵", "脉", "秀", "萨", "俄", "网", "舞", "店", "喷",
+"纵", "寸", "汗", "挂", "洪", "贺", "闪", "柬", "爆", "烯",
+"津", "稻", "墙", "软", "勇", "像", "滚", "厘", "蒙", "芳",
+"肯", "坡", "柱", "荡", "腿", "仪", "旅", "尾", "轧", "冰",
+"贡", "登", "黎", "削", "钻", "勒", "逃", "障", "氨", "郭",
+"峰", "币", "港", "伏", "轨", "亩", "毕", "擦", "莫", "刺",
+"浪", "秘", "援", "株", "健", "售", "股", "岛", "甘", "泡",
+"睡", "童", "铸", "汤", "阀", "休", "汇", "舍", "牧", "绕",
+"炸", "哲", "磷", "绩", "朋", "淡", "尖", "启", "陷", "柴",
+"呈", "徒", "颜", "泪", "稍", "忘", "泵", "蓝", "拖", "洞",
+"授", "镜", "辛", "壮", "锋", "贫", "虚", "弯", "摩", "泰",
+"幼", "廷", "尊", "窗", "纲", "弄", "隶", "疑", "氏", "宫",
+"姐", "震", "瑞", "怪", "尤", "琴", "循", "描", "膜", "违",
+"夹", "腰", "缘", "珠", "穷", "森", "枝", "竹", "沟", "催",
+"绳", "忆", "邦", "剩", "幸", "浆", "栏", "拥", "牙", "贮",
+"礼", "滤", "钠", "纹", "罢", "拍", "咱", "喊", "袖", "埃",
+"勤", "罚", "焦", "潜", "伍", "墨", "欲", "缝", "姓", "刊",
+"饱", "仿", "奖", "铝", "鬼", "丽", "跨", "默", "挖", "链",
+"扫", "喝", "袋", "炭", "污", "幕", "诸", "弧", "励", "梅",
+"奶", "洁", "灾", "舟", "鉴", "苯", "讼", "抱", "毁", "懂",
+"寒", "智", "埔", "寄", "届", "跃", "渡", "挑", "丹", "艰",
+"贝", "碰", "拔", "爹", "戴", "码", "梦", "芽", "熔", "赤",
+"渔", "哭", "敬", "颗", "奔", "铅", "仲", "虎", "稀", "妹",
+"乏", "珍", "申", "桌", "遵", "允", "隆", "螺", "仓", "魏",
+"锐", "晓", "氮", "兼", "隐", "碍", "赫", "拨", "忠", "肃",
+"缸", "牵", "抢", "博", "巧", "壳", "兄", "杜", "讯", "诚",
+"碧", "祥", "柯", "页", "巡", "矩", "悲", "灌", "龄", "伦",
+"票", "寻", "桂", "铺", "圣", "恐", "恰", "郑", "趣", "抬",
+"荒", "腾", "贴", "柔", "滴", "猛", "阔", "辆", "妻", "填",
+"撤", "储", "签", "闹", "扰", "紫", "砂", "递", "戏", "吊",
+"陶", "伐", "喂", "疗", "瓶", "婆", "抚", "臂", "摸", "忍",
+"虾", "蜡", "邻", "胸", "巩", "挤", "偶", "弃", "槽", "劲",
+"乳", "邓", "吉", "仁", "烂", "砖", "租", "乌", "舰", "伴",
+"瓜", "浅", "丙", "暂", "燥", "橡", "柳", "迷", "暖", "牌",
+"秧", "胆", "详", "簧", "踏", "瓷", "谱", "呆", "宾", "糊",
+"洛", "辉", "愤", "竞", "隙", "怒", "粘", "乃", "绪", "肩",
+"籍", "敏", "涂", "熙", "皆", "侦", "悬", "掘", "享", "纠",
+"醒", "狂", "锁", "淀", "恨", "牲", "霸", "爬", "赏", "逆",
+"玩", "陵", "祝", "秒", "浙", "貌", "役", "彼", "悉", "鸭",
+"趋", "凤", "晨", "畜", "辈", "秩", "卵", "署", "梯", "炎",
+"滩", "棋", "驱", "筛", "峡", "冒", "啥", "寿", "译", "浸",
+"泉", "帽", "迟", "硅", "疆", "贷", "漏", "稿", "冠", "嫩",
+"胁", "芯", "牢", "叛", "蚀", "奥", "鸣", "岭", "羊", "凭",
+"串", "塘", "绘", "酵", "融", "盆", "锡", "庙", "筹", "冻",
+"辅", "摄", "袭", "筋", "拒", "僚", "旱", "钾", "鸟", "漆",
+"沈", "眉", "疏", "添", "棒", "穗", "硝", "韩", "逼", "扭",
+"侨", "凉", "挺", "碗", "栽", "炒", "杯", "患", "馏", "劝",
+"豪", "辽", "勃", "鸿", "旦", "吏", "拜", "狗", "埋", "辊",
+"掩", "饮", "搬", "骂", "辞", "勾", "扣", "估", "蒋", "绒",
+"雾", "丈", "朵", "姆", "拟", "宇", "辑", "陕", "雕", "偿",
+"蓄", "崇", "剪", "倡", "厅", "咬", "驶", "薯", "刷", "斥",
+"番", "赋", "奉", "佛", "浇", "漫", "曼", "扇", "钙", "桃",
+"扶", "仔", "返", "俗", "亏", "腔", "鞋", "棱", "覆", "框",
+"悄", "叔", "撞", "骗", "勘", "旺", "沸", "孤", "吐", "孟",
+"渠", "屈", "疾", "妙", "惜", "仰", "狠", "胀", "谐", "抛",
+"霉", "桑", "岗", "嘛", "衰", "盗", "渗", "脏", "赖", "涌",
+"甜", "曹", "阅", "肌", "哩", "厉", "烃", "纬", "毅", "昨",
+"伪", "症", "煮", "叹", "钉", "搭", "茎", "笼", "酷", "偷",
+"弓", "锥", "恒", "杰", "坑", "鼻", "翼", "纶", "叙", "狱",
+"逮", "罐", "络", "棚", "抑", "膨", "蔬", "寺", "骤", "穆",
+"冶", "枯", "册", "尸", "凸", "绅", "坯", "牺", "焰", "轰",
+"欣", "晋", "瘦", "御", "锭", "锦", "丧", "旬", "锻", "垄",
+"搜", "扑", "邀", "亭", "酯", "迈", "舒", "脆", "酶", "闲",
+"忧", "酚", "顽", "羽", "涨", "卸", "仗", "陪", "辟", "惩",
+"杭", "姚", "肚", "捉", "飘", "漂", "昆", "欺", "吾", "郎",
+"烷", "汁", "呵", "饰", "萧", "雅", "邮", "迁", "燕", "撒",
+"姻", "赴", "宴", "烦", "债", "帐", "斑", "铃", "旨", "醇",
+"董", "饼", "雏", "姿", "拌", "傅", "腹", "妥", "揉", "贤",
+"拆", "歪", "葡", "胺", "丢", "浩", "徽", "昂", "垫", "挡",
+"览", "贪", "慰", "缴", "汪", "慌", "冯", "诺", "姜", "谊",
+"凶", "劣", "诬", "耀", "昏", "躺", "盈", "骑", "乔", "溪",
+"丛", "卢", "抹", "闷", "咨", "刮", "驾", "缆", "悟", "摘",
+"铒", "掷", "颇", "幻", "柄", "惠", "惨", "佳", "仇", "腊",
+"窝", "涤", "剑", "瞧", "堡", "泼", "葱", "罩", "霍", "捞",
+"胎", "苍", "滨", "俩", "捅", "湘", "砍", "霞", "邵", "萄",
+"疯", "淮", "遂", "熊", "粪", "烘", "宿", "档", "戈", "驳",
+"嫂", "裕", "徙", "箭", "捐", "肠", "撑", "晒", "辨", "殿",
+"莲", "摊", "搅", "酱", "屏", "疫", "哀", "蔡", "堵", "沫",
+"皱", "畅", "叠", "阁", "莱", "敲", "辖", "钩", "痕", "坝",
+"巷", "饿", "祸", "丘", "玄", "溜", "曰", "逻", "彭", "尝",
+"卿", "妨", "艇", "吞", "韦", "怨", "矮", "歇" ]
+</script>
+ <script>WORDLISTS = typeof WORDLISTS == "undefined" ? {} : WORDLISTS;
+WORDLISTS["chinese_traditional"] = [
+"的", "一", "是", "在", "不", "了", "有", "和", "人", "這",
+"中", "大", "為", "上", "個", "國", "我", "以", "要", "他",
+"時", "來", "用", "們", "生", "到", "作", "地", "於", "出",
+"就", "分", "對", "成", "會", "可", "主", "發", "年", "動",
+"同", "工", "也", "能", "下", "過", "子", "說", "產", "種",
+"面", "而", "方", "後", "多", "定", "行", "學", "法", "所",
+"民", "得", "經", "十", "三", "之", "進", "著", "等", "部",
+"度", "家", "電", "力", "裡", "如", "水", "化", "高", "自",
+"二", "理", "起", "小", "物", "現", "實", "加", "量", "都",
+"兩", "體", "制", "機", "當", "使", "點", "從", "業", "本",
+"去", "把", "性", "好", "應", "開", "它", "合", "還", "因",
+"由", "其", "些", "然", "前", "外", "天", "政", "四", "日",
+"那", "社", "義", "事", "平", "形", "相", "全", "表", "間",
+"樣", "與", "關", "各", "重", "新", "線", "內", "數", "正",
+"心", "反", "你", "明", "看", "原", "又", "麼", "利", "比",
+"或", "但", "質", "氣", "第", "向", "道", "命", "此", "變",
+"條", "只", "沒", "結", "解", "問", "意", "建", "月", "公",
+"無", "系", "軍", "很", "情", "者", "最", "立", "代", "想",
+"已", "通", "並", "提", "直", "題", "黨", "程", "展", "五",
+"果", "料", "象", "員", "革", "位", "入", "常", "文", "總",
+"次", "品", "式", "活", "設", "及", "管", "特", "件", "長",
+"求", "老", "頭", "基", "資", "邊", "流", "路", "級", "少",
+"圖", "山", "統", "接", "知", "較", "將", "組", "見", "計",
+"別", "她", "手", "角", "期", "根", "論", "運", "農", "指",
+"幾", "九", "區", "強", "放", "決", "西", "被", "幹", "做",
+"必", "戰", "先", "回", "則", "任", "取", "據", "處", "隊",
+"南", "給", "色", "光", "門", "即", "保", "治", "北", "造",
+"百", "規", "熱", "領", "七", "海", "口", "東", "導", "器",
+"壓", "志", "世", "金", "增", "爭", "濟", "階", "油", "思",
+"術", "極", "交", "受", "聯", "什", "認", "六", "共", "權",
+"收", "證", "改", "清", "美", "再", "採", "轉", "更", "單",
+"風", "切", "打", "白", "教", "速", "花", "帶", "安", "場",
+"身", "車", "例", "真", "務", "具", "萬", "每", "目", "至",
+"達", "走", "積", "示", "議", "聲", "報", "鬥", "完", "類",
+"八", "離", "華", "名", "確", "才", "科", "張", "信", "馬",
+"節", "話", "米", "整", "空", "元", "況", "今", "集", "溫",
+"傳", "土", "許", "步", "群", "廣", "石", "記", "需", "段",
+"研", "界", "拉", "林", "律", "叫", "且", "究", "觀", "越",
+"織", "裝", "影", "算", "低", "持", "音", "眾", "書", "布",
+"复", "容", "兒", "須", "際", "商", "非", "驗", "連", "斷",
+"深", "難", "近", "礦", "千", "週", "委", "素", "技", "備",
+"半", "辦", "青", "省", "列", "習", "響", "約", "支", "般",
+"史", "感", "勞", "便", "團", "往", "酸", "歷", "市", "克",
+"何", "除", "消", "構", "府", "稱", "太", "準", "精", "值",
+"號", "率", "族", "維", "劃", "選", "標", "寫", "存", "候",
+"毛", "親", "快", "效", "斯", "院", "查", "江", "型", "眼",
+"王", "按", "格", "養", "易", "置", "派", "層", "片", "始",
+"卻", "專", "狀", "育", "廠", "京", "識", "適", "屬", "圓",
+"包", "火", "住", "調", "滿", "縣", "局", "照", "參", "紅",
+"細", "引", "聽", "該", "鐵", "價", "嚴", "首", "底", "液",
+"官", "德", "隨", "病", "蘇", "失", "爾", "死", "講", "配",
+"女", "黃", "推", "顯", "談", "罪", "神", "藝", "呢", "席",
+"含", "企", "望", "密", "批", "營", "項", "防", "舉", "球",
+"英", "氧", "勢", "告", "李", "台", "落", "木", "幫", "輪",
+"破", "亞", "師", "圍", "注", "遠", "字", "材", "排", "供",
+"河", "態", "封", "另", "施", "減", "樹", "溶", "怎", "止",
+"案", "言", "士", "均", "武", "固", "葉", "魚", "波", "視",
+"僅", "費", "緊", "愛", "左", "章", "早", "朝", "害", "續",
+"輕", "服", "試", "食", "充", "兵", "源", "判", "護", "司",
+"足", "某", "練", "差", "致", "板", "田", "降", "黑", "犯",
+"負", "擊", "范", "繼", "興", "似", "餘", "堅", "曲", "輸",
+"修", "故", "城", "夫", "夠", "送", "筆", "船", "佔", "右",
+"財", "吃", "富", "春", "職", "覺", "漢", "畫", "功", "巴",
+"跟", "雖", "雜", "飛", "檢", "吸", "助", "昇", "陽", "互",
+"初", "創", "抗", "考", "投", "壞", "策", "古", "徑", "換",
+"未", "跑", "留", "鋼", "曾", "端", "責", "站", "簡", "述",
+"錢", "副", "盡", "帝", "射", "草", "衝", "承", "獨", "令",
+"限", "阿", "宣", "環", "雙", "請", "超", "微", "讓", "控",
+"州", "良", "軸", "找", "否", "紀", "益", "依", "優", "頂",
+"礎", "載", "倒", "房", "突", "坐", "粉", "敵", "略", "客",
+"袁", "冷", "勝", "絕", "析", "塊", "劑", "測", "絲", "協",
+"訴", "念", "陳", "仍", "羅", "鹽", "友", "洋", "錯", "苦",
+"夜", "刑", "移", "頻", "逐", "靠", "混", "母", "短", "皮",
+"終", "聚", "汽", "村", "雲", "哪", "既", "距", "衛", "停",
+"烈", "央", "察", "燒", "迅", "境", "若", "印", "洲", "刻",
+"括", "激", "孔", "搞", "甚", "室", "待", "核", "校", "散",
+"侵", "吧", "甲", "遊", "久", "菜", "味", "舊", "模", "湖",
+"貨", "損", "預", "阻", "毫", "普", "穩", "乙", "媽", "植",
+"息", "擴", "銀", "語", "揮", "酒", "守", "拿", "序", "紙",
+"醫", "缺", "雨", "嗎", "針", "劉", "啊", "急", "唱", "誤",
+"訓", "願", "審", "附", "獲", "茶", "鮮", "糧", "斤", "孩",
+"脫", "硫", "肥", "善", "龍", "演", "父", "漸", "血", "歡",
+"械", "掌", "歌", "沙", "剛", "攻", "謂", "盾", "討", "晚",
+"粒", "亂", "燃", "矛", "乎", "殺", "藥", "寧", "魯", "貴",
+"鐘", "煤", "讀", "班", "伯", "香", "介", "迫", "句", "豐",
+"培", "握", "蘭", "擔", "弦", "蛋", "沉", "假", "穿", "執",
+"答", "樂", "誰", "順", "煙", "縮", "徵", "臉", "喜", "松",
+"腳", "困", "異", "免", "背", "星", "福", "買", "染", "井",
+"概", "慢", "怕", "磁", "倍", "祖", "皇", "促", "靜", "補",
+"評", "翻", "肉", "踐", "尼", "衣", "寬", "揚", "棉", "希",
+"傷", "操", "垂", "秋", "宜", "氫", "套", "督", "振", "架",
+"亮", "末", "憲", "慶", "編", "牛", "觸", "映", "雷", "銷",
+"詩", "座", "居", "抓", "裂", "胞", "呼", "娘", "景", "威",
+"綠", "晶", "厚", "盟", "衡", "雞", "孫", "延", "危", "膠",
+"屋", "鄉", "臨", "陸", "顧", "掉", "呀", "燈", "歲", "措",
+"束", "耐", "劇", "玉", "趙", "跳", "哥", "季", "課", "凱",
+"胡", "額", "款", "紹", "卷", "齊", "偉", "蒸", "殖", "永",
+"宗", "苗", "川", "爐", "岩", "弱", "零", "楊", "奏", "沿",
+"露", "桿", "探", "滑", "鎮", "飯", "濃", "航", "懷", "趕",
+"庫", "奪", "伊", "靈", "稅", "途", "滅", "賽", "歸", "召",
+"鼓", "播", "盤", "裁", "險", "康", "唯", "錄", "菌", "純",
+"借", "糖", "蓋", "橫", "符", "私", "努", "堂", "域", "槍",
+"潤", "幅", "哈", "竟", "熟", "蟲", "澤", "腦", "壤", "碳",
+"歐", "遍", "側", "寨", "敢", "徹", "慮", "斜", "薄", "庭",
+"納", "彈", "飼", "伸", "折", "麥", "濕", "暗", "荷", "瓦",
+"塞", "床", "築", "惡", "戶", "訪", "塔", "奇", "透", "梁",
+"刀", "旋", "跡", "卡", "氯", "遇", "份", "毒", "泥", "退",
+"洗", "擺", "灰", "彩", "賣", "耗", "夏", "擇", "忙", "銅",
+"獻", "硬", "予", "繁", "圈", "雪", "函", "亦", "抽", "篇",
+"陣", "陰", "丁", "尺", "追", "堆", "雄", "迎", "泛", "爸",
+"樓", "避", "謀", "噸", "野", "豬", "旗", "累", "偏", "典",
+"館", "索", "秦", "脂", "潮", "爺", "豆", "忽", "托", "驚",
+"塑", "遺", "愈", "朱", "替", "纖", "粗", "傾", "尚", "痛",
+"楚", "謝", "奮", "購", "磨", "君", "池", "旁", "碎", "骨",
+"監", "捕", "弟", "暴", "割", "貫", "殊", "釋", "詞", "亡",
+"壁", "頓", "寶", "午", "塵", "聞", "揭", "炮", "殘", "冬",
+"橋", "婦", "警", "綜", "招", "吳", "付", "浮", "遭", "徐",
+"您", "搖", "谷", "贊", "箱", "隔", "訂", "男", "吹", "園",
+"紛", "唐", "敗", "宋", "玻", "巨", "耕", "坦", "榮", "閉",
+"灣", "鍵", "凡", "駐", "鍋", "救", "恩", "剝", "凝", "鹼",
+"齒", "截", "煉", "麻", "紡", "禁", "廢", "盛", "版", "緩",
+"淨", "睛", "昌", "婚", "涉", "筒", "嘴", "插", "岸", "朗",
+"莊", "街", "藏", "姑", "貿", "腐", "奴", "啦", "慣", "乘",
+"夥", "恢", "勻", "紗", "扎", "辯", "耳", "彪", "臣", "億",
+"璃", "抵", "脈", "秀", "薩", "俄", "網", "舞", "店", "噴",
+"縱", "寸", "汗", "掛", "洪", "賀", "閃", "柬", "爆", "烯",
+"津", "稻", "牆", "軟", "勇", "像", "滾", "厘", "蒙", "芳",
+"肯", "坡", "柱", "盪", "腿", "儀", "旅", "尾", "軋", "冰",
+"貢", "登", "黎", "削", "鑽", "勒", "逃", "障", "氨", "郭",
+"峰", "幣", "港", "伏", "軌", "畝", "畢", "擦", "莫", "刺",
+"浪", "秘", "援", "株", "健", "售", "股", "島", "甘", "泡",
+"睡", "童", "鑄", "湯", "閥", "休", "匯", "舍", "牧", "繞",
+"炸", "哲", "磷", "績", "朋", "淡", "尖", "啟", "陷", "柴",
+"呈", "徒", "顏", "淚", "稍", "忘", "泵", "藍", "拖", "洞",
+"授", "鏡", "辛", "壯", "鋒", "貧", "虛", "彎", "摩", "泰",
+"幼", "廷", "尊", "窗", "綱", "弄", "隸", "疑", "氏", "宮",
+"姐", "震", "瑞", "怪", "尤", "琴", "循", "描", "膜", "違",
+"夾", "腰", "緣", "珠", "窮", "森", "枝", "竹", "溝", "催",
+"繩", "憶", "邦", "剩", "幸", "漿", "欄", "擁", "牙", "貯",
+"禮", "濾", "鈉", "紋", "罷", "拍", "咱", "喊", "袖", "埃",
+"勤", "罰", "焦", "潛", "伍", "墨", "欲", "縫", "姓", "刊",
+"飽", "仿", "獎", "鋁", "鬼", "麗", "跨", "默", "挖", "鏈",
+"掃", "喝", "袋", "炭", "污", "幕", "諸", "弧", "勵", "梅",
+"奶", "潔", "災", "舟", "鑑", "苯", "訟", "抱", "毀", "懂",
+"寒", "智", "埔", "寄", "屆", "躍", "渡", "挑", "丹", "艱",
+"貝", "碰", "拔", "爹", "戴", "碼", "夢", "芽", "熔", "赤",
+"漁", "哭", "敬", "顆", "奔", "鉛", "仲", "虎", "稀", "妹",
+"乏", "珍", "申", "桌", "遵", "允", "隆", "螺", "倉", "魏",
+"銳", "曉", "氮", "兼", "隱", "礙", "赫", "撥", "忠", "肅",
+"缸", "牽", "搶", "博", "巧", "殼", "兄", "杜", "訊", "誠",
+"碧", "祥", "柯", "頁", "巡", "矩", "悲", "灌", "齡", "倫",
+"票", "尋", "桂", "鋪", "聖", "恐", "恰", "鄭", "趣", "抬",
+"荒", "騰", "貼", "柔", "滴", "猛", "闊", "輛", "妻", "填",
+"撤", "儲", "簽", "鬧", "擾", "紫", "砂", "遞", "戲", "吊",
+"陶", "伐", "餵", "療", "瓶", "婆", "撫", "臂", "摸", "忍",
+"蝦", "蠟", "鄰", "胸", "鞏", "擠", "偶", "棄", "槽", "勁",
+"乳", "鄧", "吉", "仁", "爛", "磚", "租", "烏", "艦", "伴",
+"瓜", "淺", "丙", "暫", "燥", "橡", "柳", "迷", "暖", "牌",
+"秧", "膽", "詳", "簧", "踏", "瓷", "譜", "呆", "賓", "糊",
+"洛", "輝", "憤", "競", "隙", "怒", "粘", "乃", "緒", "肩",
+"籍", "敏", "塗", "熙", "皆", "偵", "懸", "掘", "享", "糾",
+"醒", "狂", "鎖", "淀", "恨", "牲", "霸", "爬", "賞", "逆",
+"玩", "陵", "祝", "秒", "浙", "貌", "役", "彼", "悉", "鴨",
+"趨", "鳳", "晨", "畜", "輩", "秩", "卵", "署", "梯", "炎",
+"灘", "棋", "驅", "篩", "峽", "冒", "啥", "壽", "譯", "浸",
+"泉", "帽", "遲", "矽", "疆", "貸", "漏", "稿", "冠", "嫩",
+"脅", "芯", "牢", "叛", "蝕", "奧", "鳴", "嶺", "羊", "憑",
+"串", "塘", "繪", "酵", "融", "盆", "錫", "廟", "籌", "凍",
+"輔", "攝", "襲", "筋", "拒", "僚", "旱", "鉀", "鳥", "漆",
+"沈", "眉", "疏", "添", "棒", "穗", "硝", "韓", "逼", "扭",
+"僑", "涼", "挺", "碗", "栽", "炒", "杯", "患", "餾", "勸",
+"豪", "遼", "勃", "鴻", "旦", "吏", "拜", "狗", "埋", "輥",
+"掩", "飲", "搬", "罵", "辭", "勾", "扣", "估", "蔣", "絨",
+"霧", "丈", "朵", "姆", "擬", "宇", "輯", "陝", "雕", "償",
+"蓄", "崇", "剪", "倡", "廳", "咬", "駛", "薯", "刷", "斥",
+"番", "賦", "奉", "佛", "澆", "漫", "曼", "扇", "鈣", "桃",
+"扶", "仔", "返", "俗", "虧", "腔", "鞋", "棱", "覆", "框",
+"悄", "叔", "撞", "騙", "勘", "旺", "沸", "孤", "吐", "孟",
+"渠", "屈", "疾", "妙", "惜", "仰", "狠", "脹", "諧", "拋",
+"黴", "桑", "崗", "嘛", "衰", "盜", "滲", "臟", "賴", "湧",
+"甜", "曹", "閱", "肌", "哩", "厲", "烴", "緯", "毅", "昨",
+"偽", "症", "煮", "嘆", "釘", "搭", "莖", "籠", "酷", "偷",
+"弓", "錐", "恆", "傑", "坑", "鼻", "翼", "綸", "敘", "獄",
+"逮", "罐", "絡", "棚", "抑", "膨", "蔬", "寺", "驟", "穆",
+"冶", "枯", "冊", "屍", "凸", "紳", "坯", "犧", "焰", "轟",
+"欣", "晉", "瘦", "禦", "錠", "錦", "喪", "旬", "鍛", "壟",
+"搜", "撲", "邀", "亭", "酯", "邁", "舒", "脆", "酶", "閒",
+"憂", "酚", "頑", "羽", "漲", "卸", "仗", "陪", "闢", "懲",
+"杭", "姚", "肚", "捉", "飄", "漂", "昆", "欺", "吾", "郎",
+"烷", "汁", "呵", "飾", "蕭", "雅", "郵", "遷", "燕", "撒",
+"姻", "赴", "宴", "煩", "債", "帳", "斑", "鈴", "旨", "醇",
+"董", "餅", "雛", "姿", "拌", "傅", "腹", "妥", "揉", "賢",
+"拆", "歪", "葡", "胺", "丟", "浩", "徽", "昂", "墊", "擋",
+"覽", "貪", "慰", "繳", "汪", "慌", "馮", "諾", "姜", "誼",
+"兇", "劣", "誣", "耀", "昏", "躺", "盈", "騎", "喬", "溪",
+"叢", "盧", "抹", "悶", "諮", "刮", "駕", "纜", "悟", "摘",
+"鉺", "擲", "頗", "幻", "柄", "惠", "慘", "佳", "仇", "臘",
+"窩", "滌", "劍", "瞧", "堡", "潑", "蔥", "罩", "霍", "撈",
+"胎", "蒼", "濱", "倆", "捅", "湘", "砍", "霞", "邵", "萄",
+"瘋", "淮", "遂", "熊", "糞", "烘", "宿", "檔", "戈", "駁",
+"嫂", "裕", "徙", "箭", "捐", "腸", "撐", "曬", "辨", "殿",
+"蓮", "攤", "攪", "醬", "屏", "疫", "哀", "蔡", "堵", "沫",
+"皺", "暢", "疊", "閣", "萊", "敲", "轄", "鉤", "痕", "壩",
+"巷", "餓", "禍", "丘", "玄", "溜", "曰", "邏", "彭", "嘗",
+"卿", "妨", "艇", "吞", "韋", "怨", "矮", "歇" ]
+</script>
+ <script>WORDLISTS = typeof WORDLISTS == "undefined" ? {} : WORDLISTS;
+WORDLISTS["french"] = [
+"abaisser", "abandon", "abdiquer", "abeille", "abolir", "aborder", "aboutir", "aboyer", "abrasif", "abreuver",
+"abriter", "abroger", "abrupt", "absence", "absolu", "absurde", "abusif", "abyssal", "académie", "acajou",
+"acarien", "accabler", "accepter", "acclamer", "accolade", "accroche", "accuser", "acerbe", "achat", "acheter",
+"aciduler", "acier", "acompte", "acquérir", "acronyme", "acteur", "actif", "actuel", "adepte", "adéquat",
+"adhésif", "adjectif", "adjuger", "admettre", "admirer", "adopter", "adorer", "adoucir", "adresse", "adroit",
+"adulte", "adverbe", "aérer", "aéronef", "affaire", "affecter", "affiche", "affreux", "affubler", "agacer",
+"agencer", "agile", "agiter", "agrafer", "agréable", "agrume", "aider", "aiguille", "ailier", "aimable",
+"aisance", "ajouter", "ajuster", "alarmer", "alchimie", "alerte", "algèbre", "algue", "aliéner", "aliment",
+"alléger", "alliage", "allouer", "allumer", "alourdir", "alpaga", "altesse", "alvéole", "amateur", "ambigu",
+"ambre", "aménager", "amertume", "amidon", "amiral", "amorcer", "amour", "amovible", "amphibie", "ampleur",
+"amusant", "analyse", "anaphore", "anarchie", "anatomie", "ancien", "anéantir", "angle", "angoisse", "anguleux",
+"animal", "annexer", "annonce", "annuel", "anodin", "anomalie", "anonyme", "anormal", "antenne", "antidote",
+"anxieux", "apaiser", "apéritif", "aplanir", "apologie", "appareil", "appeler", "apporter", "appuyer", "aquarium",
+"aqueduc", "arbitre", "arbuste", "ardeur", "ardoise", "argent", "arlequin", "armature", "armement", "armoire",
+"armure", "arpenter", "arracher", "arriver", "arroser", "arsenic", "artériel", "article", "aspect", "asphalte",
+"aspirer", "assaut", "asservir", "assiette", "associer", "assurer", "asticot", "astre", "astuce", "atelier",
+"atome", "atrium", "atroce", "attaque", "attentif", "attirer", "attraper", "aubaine", "auberge", "audace",
+"audible", "augurer", "aurore", "automne", "autruche", "avaler", "avancer", "avarice", "avenir", "averse",
+"aveugle", "aviateur", "avide", "avion", "aviser", "avoine", "avouer", "avril", "axial", "axiome",
+"badge", "bafouer", "bagage", "baguette", "baignade", "balancer", "balcon", "baleine", "balisage", "bambin",
+"bancaire", "bandage", "banlieue", "bannière", "banquier", "barbier", "baril", "baron", "barque", "barrage",
+"bassin", "bastion", "bataille", "bateau", "batterie", "baudrier", "bavarder", "belette", "bélier", "belote",
+"bénéfice", "berceau", "berger", "berline", "bermuda", "besace", "besogne", "bétail", "beurre", "biberon",
+"bicycle", "bidule", "bijou", "bilan", "bilingue", "billard", "binaire", "biologie", "biopsie", "biotype",
+"biscuit", "bison", "bistouri", "bitume", "bizarre", "blafard", "blague", "blanchir", "blessant", "blinder",
+"blond", "bloquer", "blouson", "bobard", "bobine", "boire", "boiser", "bolide", "bonbon", "bondir",
+"bonheur", "bonifier", "bonus", "bordure", "borne", "botte", "boucle", "boueux", "bougie", "boulon",
+"bouquin", "bourse", "boussole", "boutique", "boxeur", "branche", "brasier", "brave", "brebis", "brèche",
+"breuvage", "bricoler", "brigade", "brillant", "brioche", "brique", "brochure", "broder", "bronzer", "brousse",
+"broyeur", "brume", "brusque", "brutal", "bruyant", "buffle", "buisson", "bulletin", "bureau", "burin",
+"bustier", "butiner", "butoir", "buvable", "buvette", "cabanon", "cabine", "cachette", "cadeau", "cadre",
+"caféine", "caillou", "caisson", "calculer", "calepin", "calibre", "calmer", "calomnie", "calvaire", "camarade",
+"caméra", "camion", "campagne", "canal", "caneton", "canon", "cantine", "canular", "capable", "caporal",
+"caprice", "capsule", "capter", "capuche", "carabine", "carbone", "caresser", "caribou", "carnage", "carotte",
+"carreau", "carton", "cascade", "casier", "casque", "cassure", "causer", "caution", "cavalier", "caverne",
+"caviar", "cédille", "ceinture", "céleste", "cellule", "cendrier", "censurer", "central", "cercle", "cérébral",
+"cerise", "cerner", "cerveau", "cesser", "chagrin", "chaise", "chaleur", "chambre", "chance", "chapitre",
+"charbon", "chasseur", "chaton", "chausson", "chavirer", "chemise", "chenille", "chéquier", "chercher", "cheval",
+"chien", "chiffre", "chignon", "chimère", "chiot", "chlorure", "chocolat", "choisir", "chose", "chouette",
+"chrome", "chute", "cigare", "cigogne", "cimenter", "cinéma", "cintrer", "circuler", "cirer", "cirque",
+"citerne", "citoyen", "citron", "civil", "clairon", "clameur", "claquer", "classe", "clavier", "client",
+"cligner", "climat", "clivage", "cloche", "clonage", "cloporte", "cobalt", "cobra", "cocasse", "cocotier",
+"coder", "codifier", "coffre", "cogner", "cohésion", "coiffer", "coincer", "colère", "colibri", "colline",
+"colmater", "colonel", "combat", "comédie", "commande", "compact", "concert", "conduire", "confier", "congeler",
+"connoter", "consonne", "contact", "convexe", "copain", "copie", "corail", "corbeau", "cordage", "corniche",
+"corpus", "correct", "cortège", "cosmique", "costume", "coton", "coude", "coupure", "courage", "couteau",
+"couvrir", "coyote", "crabe", "crainte", "cravate", "crayon", "créature", "créditer", "crémeux", "creuser",
+"crevette", "cribler", "crier", "cristal", "critère", "croire", "croquer", "crotale", "crucial", "cruel",
+"crypter", "cubique", "cueillir", "cuillère", "cuisine", "cuivre", "culminer", "cultiver", "cumuler", "cupide",
+"curatif", "curseur", "cyanure", "cycle", "cylindre", "cynique", "daigner", "damier", "danger", "danseur",
+"dauphin", "débattre", "débiter", "déborder", "débrider", "débutant", "décaler", "décembre", "déchirer", "décider",
+"déclarer", "décorer", "décrire", "décupler", "dédale", "déductif", "déesse", "défensif", "défiler", "défrayer",
+"dégager", "dégivrer", "déglutir", "dégrafer", "déjeuner", "délice", "déloger", "demander", "demeurer", "démolir",
+"dénicher", "dénouer", "dentelle", "dénuder", "départ", "dépenser", "déphaser", "déplacer", "déposer", "déranger",
+"dérober", "désastre", "descente", "désert", "désigner", "désobéir", "dessiner", "destrier", "détacher", "détester",
+"détourer", "détresse", "devancer", "devenir", "deviner", "devoir", "diable", "dialogue", "diamant", "dicter",
+"différer", "digérer", "digital", "digne", "diluer", "dimanche", "diminuer", "dioxyde", "directif", "diriger",
+"discuter", "disposer", "dissiper", "distance", "divertir", "diviser", "docile", "docteur", "dogme", "doigt",
+"domaine", "domicile", "dompter", "donateur", "donjon", "donner", "dopamine", "dortoir", "dorure", "dosage",
+"doseur", "dossier", "dotation", "douanier", "double", "douceur", "douter", "doyen", "dragon", "draper",
+"dresser", "dribbler", "droiture", "duperie", "duplexe", "durable", "durcir", "dynastie", "éblouir", "écarter",
+"écharpe", "échelle", "éclairer", "éclipse", "éclore", "écluse", "école", "économie", "écorce", "écouter",
+"écraser", "écrémer", "écrivain", "écrou", "écume", "écureuil", "édifier", "éduquer", "effacer", "effectif",
+"effigie", "effort", "effrayer", "effusion", "égaliser", "égarer", "éjecter", "élaborer", "élargir", "électron",
+"élégant", "éléphant", "élève", "éligible", "élitisme", "éloge", "élucider", "éluder", "emballer", "embellir",
+"embryon", "émeraude", "émission", "emmener", "émotion", "émouvoir", "empereur", "employer", "emporter", "emprise",
+"émulsion", "encadrer", "enchère", "enclave", "encoche", "endiguer", "endosser", "endroit", "enduire", "énergie",
+"enfance", "enfermer", "enfouir", "engager", "engin", "englober", "énigme", "enjamber", "enjeu", "enlever",
+"ennemi", "ennuyeux", "enrichir", "enrobage", "enseigne", "entasser", "entendre", "entier", "entourer", "entraver",
+"énumérer", "envahir", "enviable", "envoyer", "enzyme", "éolien", "épaissir", "épargne", "épatant", "épaule",
+"épicerie", "épidémie", "épier", "épilogue", "épine", "épisode", "épitaphe", "époque", "épreuve", "éprouver",
+"épuisant", "équerre", "équipe", "ériger", "érosion", "erreur", "éruption", "escalier", "espadon", "espèce",
+"espiègle", "espoir", "esprit", "esquiver", "essayer", "essence", "essieu", "essorer", "estime", "estomac",
+"estrade", "étagère", "étaler", "étanche", "étatique", "éteindre", "étendoir", "éternel", "éthanol", "éthique",
+"ethnie", "étirer", "étoffer", "étoile", "étonnant", "étourdir", "étrange", "étroit", "étude", "euphorie",
+"évaluer", "évasion", "éventail", "évidence", "éviter", "évolutif", "évoquer", "exact", "exagérer", "exaucer",
+"exceller", "excitant", "exclusif", "excuse", "exécuter", "exemple", "exercer", "exhaler", "exhorter", "exigence",
+"exiler", "exister", "exotique", "expédier", "explorer", "exposer", "exprimer", "exquis", "extensif", "extraire",
+"exulter", "fable", "fabuleux", "facette", "facile", "facture", "faiblir", "falaise", "fameux", "famille",
+"farceur", "farfelu", "farine", "farouche", "fasciner", "fatal", "fatigue", "faucon", "fautif", "faveur",
+"favori", "fébrile", "féconder", "fédérer", "félin", "femme", "fémur", "fendoir", "féodal", "fermer",
+"féroce", "ferveur", "festival", "feuille", "feutre", "février", "fiasco", "ficeler", "fictif", "fidèle",
+"figure", "filature", "filetage", "filière", "filleul", "filmer", "filou", "filtrer", "financer", "finir",
+"fiole", "firme", "fissure", "fixer", "flairer", "flamme", "flasque", "flatteur", "fléau", "flèche",
+"fleur", "flexion", "flocon", "flore", "fluctuer", "fluide", "fluvial", "folie", "fonderie", "fongible",
+"fontaine", "forcer", "forgeron", "formuler", "fortune", "fossile", "foudre", "fougère", "fouiller", "foulure",
+"fourmi", "fragile", "fraise", "franchir", "frapper", "frayeur", "frégate", "freiner", "frelon", "frémir",
+"frénésie", "frère", "friable", "friction", "frisson", "frivole", "froid", "fromage", "frontal", "frotter",
+"fruit", "fugitif", "fuite", "fureur", "furieux", "furtif", "fusion", "futur", "gagner", "galaxie",
+"galerie", "gambader", "garantir", "gardien", "garnir", "garrigue", "gazelle", "gazon", "géant", "gélatine",
+"gélule", "gendarme", "général", "génie", "genou", "gentil", "géologie", "géomètre", "géranium", "germe",
+"gestuel", "geyser", "gibier", "gicler", "girafe", "givre", "glace", "glaive", "glisser", "globe",
+"gloire", "glorieux", "golfeur", "gomme", "gonfler", "gorge", "gorille", "goudron", "gouffre", "goulot",
+"goupille", "gourmand", "goutte", "graduel", "graffiti", "graine", "grand", "grappin", "gratuit", "gravir",
+"grenat", "griffure", "griller", "grimper", "grogner", "gronder", "grotte", "groupe", "gruger", "grutier",
+"gruyère", "guépard", "guerrier", "guide", "guimauve", "guitare", "gustatif", "gymnaste", "gyrostat", "habitude",
+"hachoir", "halte", "hameau", "hangar", "hanneton", "haricot", "harmonie", "harpon", "hasard", "hélium",
+"hématome", "herbe", "hérisson", "hermine", "héron", "hésiter", "heureux", "hiberner", "hibou", "hilarant",
+"histoire", "hiver", "homard", "hommage", "homogène", "honneur", "honorer", "honteux", "horde", "horizon",
+"horloge", "hormone", "horrible", "houleux", "housse", "hublot", "huileux", "humain", "humble", "humide",
+"humour", "hurler", "hydromel", "hygiène", "hymne", "hypnose", "idylle", "ignorer", "iguane", "illicite",
+"illusion", "image", "imbiber", "imiter", "immense", "immobile", "immuable", "impact", "impérial", "implorer",
+"imposer", "imprimer", "imputer", "incarner", "incendie", "incident", "incliner", "incolore", "indexer", "indice",
+"inductif", "inédit", "ineptie", "inexact", "infini", "infliger", "informer", "infusion", "ingérer", "inhaler",
+"inhiber", "injecter", "injure", "innocent", "inoculer", "inonder", "inscrire", "insecte", "insigne", "insolite",
+"inspirer", "instinct", "insulter", "intact", "intense", "intime", "intrigue", "intuitif", "inutile", "invasion",
+"inventer", "inviter", "invoquer", "ironique", "irradier", "irréel", "irriter", "isoler", "ivoire", "ivresse",
+"jaguar", "jaillir", "jambe", "janvier", "jardin", "jauger", "jaune", "javelot", "jetable", "jeton",
+"jeudi", "jeunesse", "joindre", "joncher", "jongler", "joueur", "jouissif", "journal", "jovial", "joyau",
+"joyeux", "jubiler", "jugement", "junior", "jupon", "juriste", "justice", "juteux", "juvénile", "kayak",
+"kimono", "kiosque", "label", "labial", "labourer", "lacérer", "lactose", "lagune", "laine", "laisser",
+"laitier", "lambeau", "lamelle", "lampe", "lanceur", "langage", "lanterne", "lapin", "largeur", "larme",
+"laurier", "lavabo", "lavoir", "lecture", "légal", "léger", "légume", "lessive", "lettre", "levier",
+"lexique", "lézard", "liasse", "libérer", "libre", "licence", "licorne", "liège", "lièvre", "ligature",
+"ligoter", "ligue", "limer", "limite", "limonade", "limpide", "linéaire", "lingot", "lionceau", "liquide",
+"lisière", "lister", "lithium", "litige", "littoral", "livreur", "logique", "lointain", "loisir", "lombric",
+"loterie", "louer", "lourd", "loutre", "louve", "loyal", "lubie", "lucide", "lucratif", "lueur",
+"lugubre", "luisant", "lumière", "lunaire", "lundi", "luron", "lutter", "luxueux", "machine", "magasin",
+"magenta", "magique", "maigre", "maillon", "maintien", "mairie", "maison", "majorer", "malaxer", "maléfice",
+"malheur", "malice", "mallette", "mammouth", "mandater", "maniable", "manquant", "manteau", "manuel", "marathon",
+"marbre", "marchand", "mardi", "maritime", "marqueur", "marron", "marteler", "mascotte", "massif", "matériel",
+"matière", "matraque", "maudire", "maussade", "mauve", "maximal", "méchant", "méconnu", "médaille", "médecin",
+"méditer", "méduse", "meilleur", "mélange", "mélodie", "membre", "mémoire", "menacer", "mener", "menhir",
+"mensonge", "mentor", "mercredi", "mérite", "merle", "messager", "mesure", "métal", "météore", "méthode",
+"métier", "meuble", "miauler", "microbe", "miette", "mignon", "migrer", "milieu", "million", "mimique",
+"mince", "minéral", "minimal", "minorer", "minute", "miracle", "miroiter", "missile", "mixte", "mobile",
+"moderne", "moelleux", "mondial", "moniteur", "monnaie", "monotone", "monstre", "montagne", "monument", "moqueur",
+"morceau", "morsure", "mortier", "moteur", "motif", "mouche", "moufle", "moulin", "mousson", "mouton",
+"mouvant", "multiple", "munition", "muraille", "murène", "murmure", "muscle", "muséum", "musicien", "mutation",
+"muter", "mutuel", "myriade", "myrtille", "mystère", "mythique", "nageur", "nappe", "narquois", "narrer",
+"natation", "nation", "nature", "naufrage", "nautique", "navire", "nébuleux", "nectar", "néfaste", "négation",
+"négliger", "négocier", "neige", "nerveux", "nettoyer", "neurone", "neutron", "neveu", "niche", "nickel",
+"nitrate", "niveau", "noble", "nocif", "nocturne", "noirceur", "noisette", "nomade", "nombreux", "nommer",
+"normatif", "notable", "notifier", "notoire", "nourrir", "nouveau", "novateur", "novembre", "novice", "nuage",
+"nuancer", "nuire", "nuisible", "numéro", "nuptial", "nuque", "nutritif", "obéir", "objectif", "obliger",
+"obscur", "observer", "obstacle", "obtenir", "obturer", "occasion", "occuper", "océan", "octobre", "octroyer",
+"octupler", "oculaire", "odeur", "odorant", "offenser", "officier", "offrir", "ogive", "oiseau", "oisillon",
+"olfactif", "olivier", "ombrage", "omettre", "onctueux", "onduler", "onéreux", "onirique", "opale", "opaque",
+"opérer", "opinion", "opportun", "opprimer", "opter", "optique", "orageux", "orange", "orbite", "ordonner",
+"oreille", "organe", "orgueil", "orifice", "ornement", "orque", "ortie", "osciller", "osmose", "ossature",
+"otarie", "ouragan", "ourson", "outil", "outrager", "ouvrage", "ovation", "oxyde", "oxygène", "ozone",
+"paisible", "palace", "palmarès", "palourde", "palper", "panache", "panda", "pangolin", "paniquer", "panneau",
+"panorama", "pantalon", "papaye", "papier", "papoter", "papyrus", "paradoxe", "parcelle", "paresse", "parfumer",
+"parler", "parole", "parrain", "parsemer", "partager", "parure", "parvenir", "passion", "pastèque", "paternel",
+"patience", "patron", "pavillon", "pavoiser", "payer", "paysage", "peigne", "peintre", "pelage", "pélican",
+"pelle", "pelouse", "peluche", "pendule", "pénétrer", "pénible", "pensif", "pénurie", "pépite", "péplum",
+"perdrix", "perforer", "période", "permuter", "perplexe", "persil", "perte", "peser", "pétale", "petit",
+"pétrir", "peuple", "pharaon", "phobie", "phoque", "photon", "phrase", "physique", "piano", "pictural",
+"pièce", "pierre", "pieuvre", "pilote", "pinceau", "pipette", "piquer", "pirogue", "piscine", "piston",
+"pivoter", "pixel", "pizza", "placard", "plafond", "plaisir", "planer", "plaque", "plastron", "plateau",
+"pleurer", "plexus", "pliage", "plomb", "plonger", "pluie", "plumage", "pochette", "poésie", "poète",
+"pointe", "poirier", "poisson", "poivre", "polaire", "policier", "pollen", "polygone", "pommade", "pompier",
+"ponctuel", "pondérer", "poney", "portique", "position", "posséder", "posture", "potager", "poteau", "potion",
+"pouce", "poulain", "poumon", "pourpre", "poussin", "pouvoir", "prairie", "pratique", "précieux", "prédire",
+"préfixe", "prélude", "prénom", "présence", "prétexte", "prévoir", "primitif", "prince", "prison", "priver",
+"problème", "procéder", "prodige", "profond", "progrès", "proie", "projeter", "prologue", "promener", "propre",
+"prospère", "protéger", "prouesse", "proverbe", "prudence", "pruneau", "psychose", "public", "puceron", "puiser",
+"pulpe", "pulsar", "punaise", "punitif", "pupitre", "purifier", "puzzle", "pyramide", "quasar", "querelle",
+"question", "quiétude", "quitter", "quotient", "racine", "raconter", "radieux", "ragondin", "raideur", "raisin",
+"ralentir", "rallonge", "ramasser", "rapide", "rasage", "ratisser", "ravager", "ravin", "rayonner", "réactif",
+"réagir", "réaliser", "réanimer", "recevoir", "réciter", "réclamer", "récolter", "recruter", "reculer", "recycler",
+"rédiger", "redouter", "refaire", "réflexe", "réformer", "refrain", "refuge", "régalien", "région", "réglage",
+"régulier", "réitérer", "rejeter", "rejouer", "relatif", "relever", "relief", "remarque", "remède", "remise",
+"remonter", "remplir", "remuer", "renard", "renfort", "renifler", "renoncer", "rentrer", "renvoi", "replier",
+"reporter", "reprise", "reptile", "requin", "réserve", "résineux", "résoudre", "respect", "rester", "résultat",
+"rétablir", "retenir", "réticule", "retomber", "retracer", "réunion", "réussir", "revanche", "revivre", "révolte",
+"révulsif", "richesse", "rideau", "rieur", "rigide", "rigoler", "rincer", "riposter", "risible", "risque",
+"rituel", "rival", "rivière", "rocheux", "romance", "rompre", "ronce", "rondin", "roseau", "rosier",
+"rotatif", "rotor", "rotule", "rouge", "rouille", "rouleau", "routine", "royaume", "ruban", "rubis",
+"ruche", "ruelle", "rugueux", "ruiner", "ruisseau", "ruser", "rustique", "rythme", "sabler", "saboter",
+"sabre", "sacoche", "safari", "sagesse", "saisir", "salade", "salive", "salon", "saluer", "samedi",
+"sanction", "sanglier", "sarcasme", "sardine", "saturer", "saugrenu", "saumon", "sauter", "sauvage", "savant",
+"savonner", "scalpel", "scandale", "scélérat", "scénario", "sceptre", "schéma", "science", "scinder", "score",
+"scrutin", "sculpter", "séance", "sécable", "sécher", "secouer", "sécréter", "sédatif", "séduire", "seigneur",
+"séjour", "sélectif", "semaine", "sembler", "semence", "séminal", "sénateur", "sensible", "sentence", "séparer",
+"séquence", "serein", "sergent", "sérieux", "serrure", "sérum", "service", "sésame", "sévir", "sevrage",
+"sextuple", "sidéral", "siècle", "siéger", "siffler", "sigle", "signal", "silence", "silicium", "simple",
+"sincère", "sinistre", "siphon", "sirop", "sismique", "situer", "skier", "social", "socle", "sodium",
+"soigneux", "soldat", "soleil", "solitude", "soluble", "sombre", "sommeil", "somnoler", "sonde", "songeur",
+"sonnette", "sonore", "sorcier", "sortir", "sosie", "sottise", "soucieux", "soudure", "souffle", "soulever",
+"soupape", "source", "soutirer", "souvenir", "spacieux", "spatial", "spécial", "sphère", "spiral", "stable",
+"station", "sternum", "stimulus", "stipuler", "strict", "studieux", "stupeur", "styliste", "sublime", "substrat",
+"subtil", "subvenir", "succès", "sucre", "suffixe", "suggérer", "suiveur", "sulfate", "superbe", "supplier",
+"surface", "suricate", "surmener", "surprise", "sursaut", "survie", "suspect", "syllabe", "symbole", "symétrie",
+"synapse", "syntaxe", "système", "tabac", "tablier", "tactile", "tailler", "talent", "talisman", "talonner",
+"tambour", "tamiser", "tangible", "tapis", "taquiner", "tarder", "tarif", "tartine", "tasse", "tatami",
+"tatouage", "taupe", "taureau", "taxer", "témoin", "temporel", "tenaille", "tendre", "teneur", "tenir",
+"tension", "terminer", "terne", "terrible", "tétine", "texte", "thème", "théorie", "thérapie", "thorax",
+"tibia", "tiède", "timide", "tirelire", "tiroir", "tissu", "titane", "titre", "tituber", "toboggan",
+"tolérant", "tomate", "tonique", "tonneau", "toponyme", "torche", "tordre", "tornade", "torpille", "torrent",
+"torse", "tortue", "totem", "toucher", "tournage", "tousser", "toxine", "traction", "trafic", "tragique",
+"trahir", "train", "trancher", "travail", "trèfle", "tremper", "trésor", "treuil", "triage", "tribunal",
+"tricoter", "trilogie", "triomphe", "tripler", "triturer", "trivial", "trombone", "tronc", "tropical", "troupeau",
+"tuile", "tulipe", "tumulte", "tunnel", "turbine", "tuteur", "tutoyer", "tuyau", "tympan", "typhon",
+"typique", "tyran", "ubuesque", "ultime", "ultrason", "unanime", "unifier", "union", "unique", "unitaire",
+"univers", "uranium", "urbain", "urticant", "usage", "usine", "usuel", "usure", "utile", "utopie",
+"vacarme", "vaccin", "vagabond", "vague", "vaillant", "vaincre", "vaisseau", "valable", "valise", "vallon",
+"valve", "vampire", "vanille", "vapeur", "varier", "vaseux", "vassal", "vaste", "vecteur", "vedette",
+"végétal", "véhicule", "veinard", "véloce", "vendredi", "vénérer", "venger", "venimeux", "ventouse", "verdure",
+"vérin", "vernir", "verrou", "verser", "vertu", "veston", "vétéran", "vétuste", "vexant", "vexer",
+"viaduc", "viande", "victoire", "vidange", "vidéo", "vignette", "vigueur", "vilain", "village", "vinaigre",
+"violon", "vipère", "virement", "virtuose", "virus", "visage", "viseur", "vision", "visqueux", "visuel",
+"vital", "vitesse", "viticole", "vitrine", "vivace", "vivipare", "vocation", "voguer", "voile", "voisin",
+"voiture", "volaille", "volcan", "voltiger", "volume", "vorace", "vortex", "voter", "vouloir", "voyage",
+"voyelle", "wagon", "xénon", "yacht", "zèbre", "zénith", "zeste", "zoologie"]
+</script>
+ <script>WORDLISTS = typeof WORDLISTS == "undefined" ? {} : WORDLISTS;
+WORDLISTS["italian"] = [
+"abaco", "abbaglio", "abbinato", "abete", "abisso", "abolire", "abrasivo", "abrogato", "accadere", "accenno",
+"accusato", "acetone", "achille", "acido", "acqua", "acre", "acrilico", "acrobata", "acuto", "adagio",
+"addebito", "addome", "adeguato", "aderire", "adipe", "adottare", "adulare", "affabile", "affetto", "affisso",
+"affranto", "aforisma", "afoso", "africano", "agave", "agente", "agevole", "aggancio", "agire", "agitare",
+"agonismo", "agricolo", "agrumeto", "aguzzo", "alabarda", "alato", "albatro", "alberato", "albo", "albume",
+"alce", "alcolico", "alettone", "alfa", "algebra", "aliante", "alibi", "alimento", "allagato", "allegro",
+"allievo", "allodola", "allusivo", "almeno", "alogeno", "alpaca", "alpestre", "altalena", "alterno", "alticcio",
+"altrove", "alunno", "alveolo", "alzare", "amalgama", "amanita", "amarena", "ambito", "ambrato", "ameba",
+"america", "ametista", "amico", "ammasso", "ammenda", "ammirare", "ammonito", "amore", "ampio", "ampliare",
+"amuleto", "anacardo", "anagrafe", "analista", "anarchia", "anatra", "anca", "ancella", "ancora", "andare",
+"andrea", "anello", "angelo", "angolare", "angusto", "anima", "annegare", "annidato", "anno", "annuncio",
+"anonimo", "anticipo", "anzi", "apatico", "apertura", "apode", "apparire", "appetito", "appoggio", "approdo",
+"appunto", "aprile", "arabica", "arachide", "aragosta", "araldica", "arancio", "aratura", "arazzo", "arbitro",
+"archivio", "ardito", "arenile", "argento", "argine", "arguto", "aria", "armonia", "arnese", "arredato",
+"arringa", "arrosto", "arsenico", "arso", "artefice", "arzillo", "asciutto", "ascolto", "asepsi", "asettico",
+"asfalto", "asino", "asola", "aspirato", "aspro", "assaggio", "asse", "assoluto", "assurdo", "asta",
+"astenuto", "astice", "astratto", "atavico", "ateismo", "atomico", "atono", "attesa", "attivare", "attorno",
+"attrito", "attuale", "ausilio", "austria", "autista", "autonomo", "autunno", "avanzato", "avere", "avvenire",
+"avviso", "avvolgere", "azione", "azoto", "azzimo", "azzurro", "babele", "baccano", "bacino", "baco",
+"badessa", "badilata", "bagnato", "baita", "balcone", "baldo", "balena", "ballata", "balzano", "bambino",
+"bandire", "baraonda", "barbaro", "barca", "baritono", "barlume", "barocco", "basilico", "basso", "batosta",
+"battuto", "baule", "bava", "bavosa", "becco", "beffa", "belgio", "belva", "benda", "benevole",
+"benigno", "benzina", "bere", "berlina", "beta", "bibita", "bici", "bidone", "bifido", "biga",
+"bilancia", "bimbo", "binocolo", "biologo", "bipede", "bipolare", "birbante", "birra", "biscotto", "bisesto",
+"bisnonno", "bisonte", "bisturi", "bizzarro", "blando", "blatta", "bollito", "bonifico", "bordo", "bosco",
+"botanico", "bottino", "bozzolo", "braccio", "bradipo", "brama", "branca", "bravura", "bretella", "brevetto",
+"brezza", "briglia", "brillante", "brindare", "broccolo", "brodo", "bronzina", "brullo", "bruno", "bubbone",
+"buca", "budino", "buffone", "buio", "bulbo", "buono", "burlone", "burrasca", "bussola", "busta",
+"cadetto", "caduco", "calamaro", "calcolo", "calesse", "calibro", "calmo", "caloria", "cambusa", "camerata",
+"camicia", "cammino", "camola", "campale", "canapa", "candela", "cane", "canino", "canotto", "cantina",
+"capace", "capello", "capitolo", "capogiro", "cappero", "capra", "capsula", "carapace", "carcassa", "cardo",
+"carisma", "carovana", "carretto", "cartolina", "casaccio", "cascata", "caserma", "caso", "cassone", "castello",
+"casuale", "catasta", "catena", "catrame", "cauto", "cavillo", "cedibile", "cedrata", "cefalo", "celebre",
+"cellulare", "cena", "cenone", "centesimo", "ceramica", "cercare", "certo", "cerume", "cervello", "cesoia",
+"cespo", "ceto", "chela", "chiaro", "chicca", "chiedere", "chimera", "china", "chirurgo", "chitarra",
+"ciao", "ciclismo", "cifrare", "cigno", "cilindro", "ciottolo", "circa", "cirrosi", "citrico", "cittadino",
+"ciuffo", "civetta", "civile", "classico", "clinica", "cloro", "cocco", "codardo", "codice", "coerente",
+"cognome", "collare", "colmato", "colore", "colposo", "coltivato", "colza", "coma", "cometa", "commando",
+"comodo", "computer", "comune", "conciso", "condurre", "conferma", "congelare", "coniuge", "connesso", "conoscere",
+"consumo", "continuo", "convegno", "coperto", "copione", "coppia", "copricapo", "corazza", "cordata", "coricato",
+"cornice", "corolla", "corpo", "corredo", "corsia", "cortese", "cosmico", "costante", "cottura", "covato",
+"cratere", "cravatta", "creato", "credere", "cremoso", "crescita", "creta", "criceto", "crinale", "crisi",
+"critico", "croce", "cronaca", "crostata", "cruciale", "crusca", "cucire", "cuculo", "cugino", "cullato",
+"cupola", "curatore", "cursore", "curvo", "cuscino", "custode", "dado", "daino", "dalmata", "damerino",
+"daniela", "dannoso", "danzare", "datato", "davanti", "davvero", "debutto", "decennio", "deciso", "declino",
+"decollo", "decreto", "dedicato", "definito", "deforme", "degno", "delegare", "delfino", "delirio", "delta",
+"demenza", "denotato", "dentro", "deposito", "derapata", "derivare", "deroga", "descritto", "deserto", "desiderio",
+"desumere", "detersivo", "devoto", "diametro", "dicembre", "diedro", "difeso", "diffuso", "digerire", "digitale",
+"diluvio", "dinamico", "dinnanzi", "dipinto", "diploma", "dipolo", "diradare", "dire", "dirotto", "dirupo",
+"disagio", "discreto", "disfare", "disgelo", "disposto", "distanza", "disumano", "dito", "divano", "divelto",
+"dividere", "divorato", "doblone", "docente", "doganale", "dogma", "dolce", "domato", "domenica", "dominare",
+"dondolo", "dono", "dormire", "dote", "dottore", "dovuto", "dozzina", "drago", "druido", "dubbio",
+"dubitare", "ducale", "duna", "duomo", "duplice", "duraturo", "ebano", "eccesso", "ecco", "eclissi",
+"economia", "edera", "edicola", "edile", "editoria", "educare", "egemonia", "egli", "egoismo", "egregio",
+"elaborato", "elargire", "elegante", "elencato", "eletto", "elevare", "elfico", "elica", "elmo", "elsa",
+"eluso", "emanato", "emblema", "emesso", "emiro", "emotivo", "emozione", "empirico", "emulo", "endemico",
+"enduro", "energia", "enfasi", "enoteca", "entrare", "enzima", "epatite", "epilogo", "episodio", "epocale",
+"eppure", "equatore", "erario", "erba", "erboso", "erede", "eremita", "erigere", "ermetico", "eroe",
+"erosivo", "errante", "esagono", "esame", "esanime", "esaudire", "esca", "esempio", "esercito", "esibito",
+"esigente", "esistere", "esito", "esofago", "esortato", "esoso", "espanso", "espresso", "essenza", "esso",
+"esteso", "estimare", "estonia", "estroso", "esultare", "etilico", "etnico", "etrusco", "etto", "euclideo",
+"europa", "evaso", "evidenza", "evitato", "evoluto", "evviva", "fabbrica", "faccenda", "fachiro", "falco",
+"famiglia", "fanale", "fanfara", "fango", "fantasma", "fare", "farfalla", "farinoso", "farmaco", "fascia",
+"fastoso", "fasullo", "faticare", "fato", "favoloso", "febbre", "fecola", "fede", "fegato", "felpa",
+"feltro", "femmina", "fendere", "fenomeno", "fermento", "ferro", "fertile", "fessura", "festivo", "fetta",
+"feudo", "fiaba", "fiducia", "fifa", "figurato", "filo", "finanza", "finestra", "finire", "fiore",
+"fiscale", "fisico", "fiume", "flacone", "flamenco", "flebo", "flemma", "florido", "fluente", "fluoro",
+"fobico", "focaccia", "focoso", "foderato", "foglio", "folata", "folclore", "folgore", "fondente", "fonetico",
+"fonia", "fontana", "forbito", "forchetta", "foresta", "formica", "fornaio", "foro", "fortezza", "forzare",
+"fosfato", "fosso", "fracasso", "frana", "frassino", "fratello", "freccetta", "frenata", "fresco", "frigo",
+"frollino", "fronde", "frugale", "frutta", "fucilata", "fucsia", "fuggente", "fulmine", "fulvo", "fumante",
+"fumetto", "fumoso", "fune", "funzione", "fuoco", "furbo", "furgone", "furore", "fuso", "futile",
+"gabbiano", "gaffe", "galateo", "gallina", "galoppo", "gambero", "gamma", "garanzia", "garbo", "garofano",
+"garzone", "gasdotto", "gasolio", "gastrico", "gatto", "gaudio", "gazebo", "gazzella", "geco", "gelatina",
+"gelso", "gemello", "gemmato", "gene", "genitore", "gennaio", "genotipo", "gergo", "ghepardo", "ghiaccio",
+"ghisa", "giallo", "gilda", "ginepro", "giocare", "gioiello", "giorno", "giove", "girato", "girone",
+"gittata", "giudizio", "giurato", "giusto", "globulo", "glutine", "gnomo", "gobba", "golf", "gomito",
+"gommone", "gonfio", "gonna", "governo", "gracile", "grado", "grafico", "grammo", "grande", "grattare",
+"gravoso", "grazia", "greca", "gregge", "grifone", "grigio", "grinza", "grotta", "gruppo", "guadagno",
+"guaio", "guanto", "guardare", "gufo", "guidare", "ibernato", "icona", "identico", "idillio", "idolo",
+"idra", "idrico", "idrogeno", "igiene", "ignaro", "ignorato", "ilare", "illeso", "illogico", "illudere",
+"imballo", "imbevuto", "imbocco", "imbuto", "immane", "immerso", "immolato", "impacco", "impeto", "impiego",
+"importo", "impronta", "inalare", "inarcare", "inattivo", "incanto", "incendio", "inchino", "incisivo", "incluso",
+"incontro", "incrocio", "incubo", "indagine", "india", "indole", "inedito", "infatti", "infilare", "inflitto",
+"ingaggio", "ingegno", "inglese", "ingordo", "ingrosso", "innesco", "inodore", "inoltrare", "inondato", "insano",
+"insetto", "insieme", "insonnia", "insulina", "intasato", "intero", "intonaco", "intuito", "inumidire", "invalido",
+"invece", "invito", "iperbole", "ipnotico", "ipotesi", "ippica", "iride", "irlanda", "ironico", "irrigato",
+"irrorare", "isolato", "isotopo", "isterico", "istituto", "istrice", "italia", "iterare", "labbro", "labirinto",
+"lacca", "lacerato", "lacrima", "lacuna", "laddove", "lago", "lampo", "lancetta", "lanterna", "lardoso",
+"larga", "laringe", "lastra", "latenza", "latino", "lattuga", "lavagna", "lavoro", "legale", "leggero",
+"lembo", "lentezza", "lenza", "leone", "lepre", "lesivo", "lessato", "lesto", "letterale", "leva",
+"levigato", "libero", "lido", "lievito", "lilla", "limatura", "limitare", "limpido", "lineare", "lingua",
+"liquido", "lira", "lirica", "lisca", "lite", "litigio", "livrea", "locanda", "lode", "logica",
+"lombare", "londra", "longevo", "loquace", "lorenzo", "loto", "lotteria", "luce", "lucidato", "lumaca",
+"luminoso", "lungo", "lupo", "luppolo", "lusinga", "lusso", "lutto", "macabro", "macchina", "macero",
+"macinato", "madama", "magico", "maglia", "magnete", "magro", "maiolica", "malafede", "malgrado", "malinteso",
+"malsano", "malto", "malumore", "mana", "mancia", "mandorla", "mangiare", "manifesto", "mannaro", "manovra",
+"mansarda", "mantide", "manubrio", "mappa", "maratona", "marcire", "maretta", "marmo", "marsupio", "maschera",
+"massaia", "mastino", "materasso", "matricola", "mattone", "maturo", "mazurca", "meandro", "meccanico", "mecenate",
+"medesimo", "meditare", "mega", "melassa", "melis", "melodia", "meninge", "meno", "mensola", "mercurio",
+"merenda", "merlo", "meschino", "mese", "messere", "mestolo", "metallo", "metodo", "mettere", "miagolare",
+"mica", "micelio", "michele", "microbo", "midollo", "miele", "migliore", "milano", "milite", "mimosa",
+"minerale", "mini", "minore", "mirino", "mirtillo", "miscela", "missiva", "misto", "misurare", "mitezza",
+"mitigare", "mitra", "mittente", "mnemonico", "modello", "modifica", "modulo", "mogano", "mogio", "mole",
+"molosso", "monastero", "monco", "mondina", "monetario", "monile", "monotono", "monsone", "montato", "monviso",
+"mora", "mordere", "morsicato", "mostro", "motivato", "motosega", "motto", "movenza", "movimento", "mozzo",
+"mucca", "mucosa", "muffa", "mughetto", "mugnaio", "mulatto", "mulinello", "multiplo", "mummia", "munto",
+"muovere", "murale", "musa", "muscolo", "musica", "mutevole", "muto", "nababbo", "nafta", "nanometro",
+"narciso", "narice", "narrato", "nascere", "nastrare", "naturale", "nautica", "naviglio", "nebulosa", "necrosi",
+"negativo", "negozio", "nemmeno", "neofita", "neretto", "nervo", "nessuno", "nettuno", "neutrale", "neve",
+"nevrotico", "nicchia", "ninfa", "nitido", "nobile", "nocivo", "nodo", "nome", "nomina", "nordico",
+"normale", "norvegese", "nostrano", "notare", "notizia", "notturno", "novella", "nucleo", "nulla", "numero",
+"nuovo", "nutrire", "nuvola", "nuziale", "oasi", "obbedire", "obbligo", "obelisco", "oblio", "obolo",
+"obsoleto", "occasione", "occhio", "occidente", "occorrere", "occultare", "ocra", "oculato", "odierno", "odorare",
+"offerta", "offrire", "offuscato", "oggetto", "oggi", "ognuno", "olandese", "olfatto", "oliato", "oliva",
+"ologramma", "oltre", "omaggio", "ombelico", "ombra", "omega", "omissione", "ondoso", "onere", "onice",
+"onnivoro", "onorevole", "onta", "operato", "opinione", "opposto", "oracolo", "orafo", "ordine", "orecchino",
+"orefice", "orfano", "organico", "origine", "orizzonte", "orma", "ormeggio", "ornativo", "orologio", "orrendo",
+"orribile", "ortensia", "ortica", "orzata", "orzo", "osare", "oscurare", "osmosi", "ospedale", "ospite",
+"ossa", "ossidare", "ostacolo", "oste", "otite", "otre", "ottagono", "ottimo", "ottobre", "ovale",
+"ovest", "ovino", "oviparo", "ovocito", "ovunque", "ovviare", "ozio", "pacchetto", "pace", "pacifico",
+"padella", "padrone", "paese", "paga", "pagina", "palazzina", "palesare", "pallido", "palo", "palude",
+"pandoro", "pannello", "paolo", "paonazzo", "paprica", "parabola", "parcella", "parere", "pargolo", "pari",
+"parlato", "parola", "partire", "parvenza", "parziale", "passivo", "pasticca", "patacca", "patologia", "pattume",
+"pavone", "peccato", "pedalare", "pedonale", "peggio", "peloso", "penare", "pendice", "penisola", "pennuto",
+"penombra", "pensare", "pentola", "pepe", "pepita", "perbene", "percorso", "perdonato", "perforare", "pergamena",
+"periodo", "permesso", "perno", "perplesso", "persuaso", "pertugio", "pervaso", "pesatore", "pesista", "peso",
+"pestifero", "petalo", "pettine", "petulante", "pezzo", "piacere", "pianta", "piattino", "piccino", "picozza",
+"piega", "pietra", "piffero", "pigiama", "pigolio", "pigro", "pila", "pilifero", "pillola", "pilota",
+"pimpante", "pineta", "pinna", "pinolo", "pioggia", "piombo", "piramide", "piretico", "pirite", "pirolisi",
+"pitone", "pizzico", "placebo", "planare", "plasma", "platano", "plenario", "pochezza", "poderoso", "podismo",
+"poesia", "poggiare", "polenta", "poligono", "pollice", "polmonite", "polpetta", "polso", "poltrona", "polvere",
+"pomice", "pomodoro", "ponte", "popoloso", "porfido", "poroso", "porpora", "porre", "portata", "posa",
+"positivo", "possesso", "postulato", "potassio", "potere", "pranzo", "prassi", "pratica", "precluso", "predica",
+"prefisso", "pregiato", "prelievo", "premere", "prenotare", "preparato", "presenza", "pretesto", "prevalso", "prima",
+"principe", "privato", "problema", "procura", "produrre", "profumo", "progetto", "prolunga", "promessa", "pronome",
+"proposta", "proroga", "proteso", "prova", "prudente", "prugna", "prurito", "psiche", "pubblico", "pudica",
+"pugilato", "pugno", "pulce", "pulito", "pulsante", "puntare", "pupazzo", "pupilla", "puro", "quadro",
+"qualcosa", "quasi", "querela", "quota", "raccolto", "raddoppio", "radicale", "radunato", "raffica", "ragazzo",
+"ragione", "ragno", "ramarro", "ramingo", "ramo", "randagio", "rantolare", "rapato", "rapina", "rappreso",
+"rasatura", "raschiato", "rasente", "rassegna", "rastrello", "rata", "ravveduto", "reale", "recepire", "recinto",
+"recluta", "recondito", "recupero", "reddito", "redimere", "regalato", "registro", "regola", "regresso", "relazione",
+"remare", "remoto", "renna", "replica", "reprimere", "reputare", "resa", "residente", "responso", "restauro",
+"rete", "retina", "retorica", "rettifica", "revocato", "riassunto", "ribadire", "ribelle", "ribrezzo", "ricarica",
+"ricco", "ricevere", "riciclato", "ricordo", "ricreduto", "ridicolo", "ridurre", "rifasare", "riflesso", "riforma",
+"rifugio", "rigare", "rigettato", "righello", "rilassato", "rilevato", "rimanere", "rimbalzo", "rimedio", "rimorchio",
+"rinascita", "rincaro", "rinforzo", "rinnovo", "rinomato", "rinsavito", "rintocco", "rinuncia", "rinvenire", "riparato",
+"ripetuto", "ripieno", "riportare", "ripresa", "ripulire", "risata", "rischio", "riserva", "risibile", "riso",
+"rispetto", "ristoro", "risultato", "risvolto", "ritardo", "ritegno", "ritmico", "ritrovo", "riunione", "riva",
+"riverso", "rivincita", "rivolto", "rizoma", "roba", "robotico", "robusto", "roccia", "roco", "rodaggio",
+"rodere", "roditore", "rogito", "rollio", "romantico", "rompere", "ronzio", "rosolare", "rospo", "rotante",
+"rotondo", "rotula", "rovescio", "rubizzo", "rubrica", "ruga", "rullino", "rumine", "rumoroso", "ruolo",
+"rupe", "russare", "rustico", "sabato", "sabbiare", "sabotato", "sagoma", "salasso", "saldatura", "salgemma",
+"salivare", "salmone", "salone", "saltare", "saluto", "salvo", "sapere", "sapido", "saporito", "saraceno",
+"sarcasmo", "sarto", "sassoso", "satellite", "satira", "satollo", "saturno", "savana", "savio", "saziato",
+"sbadiglio", "sbalzo", "sbancato", "sbarra", "sbattere", "sbavare", "sbendare", "sbirciare", "sbloccato", "sbocciato",
+"sbrinare", "sbruffone", "sbuffare", "scabroso", "scadenza", "scala", "scambiare", "scandalo", "scapola", "scarso",
+"scatenare", "scavato", "scelto", "scenico", "scettro", "scheda", "schiena", "sciarpa", "scienza", "scindere",
+"scippo", "sciroppo", "scivolo", "sclerare", "scodella", "scolpito", "scomparto", "sconforto", "scoprire", "scorta",
+"scossone", "scozzese", "scriba", "scrollare", "scrutinio", "scuderia", "scultore", "scuola", "scuro", "scusare",
+"sdebitare", "sdoganare", "seccatura", "secondo", "sedano", "seggiola", "segnalato", "segregato", "seguito", "selciato",
+"selettivo", "sella", "selvaggio", "semaforo", "sembrare", "seme", "seminato", "sempre", "senso", "sentire",
+"sepolto", "sequenza", "serata", "serbato", "sereno", "serio", "serpente", "serraglio", "servire", "sestina",
+"setola", "settimana", "sfacelo", "sfaldare", "sfamato", "sfarzoso", "sfaticato", "sfera", "sfida", "sfilato",
+"sfinge", "sfocato", "sfoderare", "sfogo", "sfoltire", "sforzato", "sfratto", "sfruttato", "sfuggito", "sfumare",
+"sfuso", "sgabello", "sgarbato", "sgonfiare", "sgorbio", "sgrassato", "sguardo", "sibilo", "siccome", "sierra",
+"sigla", "signore", "silenzio", "sillaba", "simbolo", "simpatico", "simulato", "sinfonia", "singolo", "sinistro",
+"sino", "sintesi", "sinusoide", "sipario", "sisma", "sistole", "situato", "slitta", "slogatura", "sloveno",
+"smarrito", "smemorato", "smentito", "smeraldo", "smilzo", "smontare", "smottato", "smussato", "snellire", "snervato",
+"snodo", "sobbalzo", "sobrio", "soccorso", "sociale", "sodale", "soffitto", "sogno", "soldato", "solenne",
+"solido", "sollazzo", "solo", "solubile", "solvente", "somatico", "somma", "sonda", "sonetto", "sonnifero",
+"sopire", "soppeso", "sopra", "sorgere", "sorpasso", "sorriso", "sorso", "sorteggio", "sorvolato", "sospiro",
+"sosta", "sottile", "spada", "spalla", "spargere", "spatola", "spavento", "spazzola", "specie", "spedire",
+"spegnere", "spelatura", "speranza", "spessore", "spettrale", "spezzato", "spia", "spigoloso", "spillato", "spinoso",
+"spirale", "splendido", "sportivo", "sposo", "spranga", "sprecare", "spronato", "spruzzo", "spuntino", "squillo",
+"sradicare", "srotolato", "stabile", "stacco", "staffa", "stagnare", "stampato", "stantio", "starnuto", "stasera",
+"statuto", "stelo", "steppa", "sterzo", "stiletto", "stima", "stirpe", "stivale", "stizzoso", "stonato",
+"storico", "strappo", "stregato", "stridulo", "strozzare", "strutto", "stuccare", "stufo", "stupendo", "subentro",
+"succoso", "sudore", "suggerito", "sugo", "sultano", "suonare", "superbo", "supporto", "surgelato", "surrogato",
+"sussurro", "sutura", "svagare", "svedese", "sveglio", "svelare", "svenuto", "svezia", "sviluppo", "svista",
+"svizzera", "svolta", "svuotare", "tabacco", "tabulato", "tacciare", "taciturno", "tale", "talismano", "tampone",
+"tannino", "tara", "tardivo", "targato", "tariffa", "tarpare", "tartaruga", "tasto", "tattico", "taverna",
+"tavolata", "tazza", "teca", "tecnico", "telefono", "temerario", "tempo", "temuto", "tendone", "tenero",
+"tensione", "tentacolo", "teorema", "terme", "terrazzo", "terzetto", "tesi", "tesserato", "testato", "tetro",
+"tettoia", "tifare", "tigella", "timbro", "tinto", "tipico", "tipografo", "tiraggio", "tiro", "titanio",
+"titolo", "titubante", "tizio", "tizzone", "toccare", "tollerare", "tolto", "tombola", "tomo", "tonfo",
+"tonsilla", "topazio", "topologia", "toppa", "torba", "tornare", "torrone", "tortora", "toscano", "tossire",
+"tostatura", "totano", "trabocco", "trachea", "trafila", "tragedia", "tralcio", "tramonto", "transito", "trapano",
+"trarre", "trasloco", "trattato", "trave", "treccia", "tremolio", "trespolo", "tributo", "tricheco", "trifoglio",
+"trillo", "trincea", "trio", "tristezza", "triturato", "trivella", "tromba", "trono", "troppo", "trottola",
+"trovare", "truccato", "tubatura", "tuffato", "tulipano", "tumulto", "tunisia", "turbare", "turchino", "tuta",
+"tutela", "ubicato", "uccello", "uccisore", "udire", "uditivo", "uffa", "ufficio", "uguale", "ulisse",
+"ultimato", "umano", "umile", "umorismo", "uncinetto", "ungere", "ungherese", "unicorno", "unificato", "unisono",
+"unitario", "unte", "uovo", "upupa", "uragano", "urgenza", "urlo", "usanza", "usato", "uscito",
+"usignolo", "usuraio", "utensile", "utilizzo", "utopia", "vacante", "vaccinato", "vagabondo", "vagliato", "valanga",
+"valgo", "valico", "valletta", "valoroso", "valutare", "valvola", "vampata", "vangare", "vanitoso", "vano",
+"vantaggio", "vanvera", "vapore", "varano", "varcato", "variante", "vasca", "vedetta", "vedova", "veduto",
+"vegetale", "veicolo", "velcro", "velina", "velluto", "veloce", "venato", "vendemmia", "vento", "verace",
+"verbale", "vergogna", "verifica", "vero", "verruca", "verticale", "vescica", "vessillo", "vestale", "veterano",
+"vetrina", "vetusto", "viandante", "vibrante", "vicenda", "vichingo", "vicinanza", "vidimare", "vigilia", "vigneto",
+"vigore", "vile", "villano", "vimini", "vincitore", "viola", "vipera", "virgola", "virologo", "virulento",
+"viscoso", "visione", "vispo", "vissuto", "visura", "vita", "vitello", "vittima", "vivanda", "vivido",
+"viziare", "voce", "voga", "volatile", "volere", "volpe", "voragine", "vulcano", "zampogna", "zanna",
+"zappato", "zattera", "zavorra", "zefiro", "zelante", "zelo", "zenzero", "zerbino", "zibetto", "zinco",
+"zircone", "zitto", "zolla", "zotico", "zucchero", "zufolo", "zulu", "zuppa"]
+</script>
+ <script>/*
+ * Copyright (c) 2013 Pavol Rusnak
+ *
+ * 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.
+ */
+
+/*
+ * Javascript port from python by Ian Coleman
+ *
+ * Requires code from sjcl
+ * https://github.com/bitwiseshiftleft/sjcl
+ */
+
+var Mnemonic = function(language) {
+
+ var PBKDF2_ROUNDS = 2048;
+ var RADIX = 2048;
+
+ var self = this;
+ var wordlist = [];
+
+ var hmacSHA512 = function(key) {
+ var hasher = new sjcl.misc.hmac(key, sjcl.hash.sha512);
+ this.encrypt = function() {
+ return hasher.encrypt.apply(hasher, arguments);
+ };
+ };
+
+ function init() {
+ wordlist = WORDLISTS[language];
+ if (wordlist.length != RADIX) {
+ err = 'Wordlist should contain ' + RADIX + ' words, but it contains ' + wordlist.length + ' words.';
+ throw err;
+ }
+ }
+
+ self.generate = function(strength) {
+ strength = strength || 128;
+ var r = strength % 32;
+ if (r > 0) {
+ throw 'Strength should be divisible by 32, but it is not (' + r + ').';
+ }
+ var hasStrongCrypto = 'crypto' in window && window['crypto'] !== null;
+ if (!hasStrongCrypto) {
+ throw 'Mnemonic should be generated with strong randomness, but crypto.getRandomValues is unavailable';
+ }
+ var buffer = new Uint8Array(strength / 8);
+ var data = crypto.getRandomValues(buffer);
+ return self.toMnemonic(data);
+ }
+
+ self.toMnemonic = function(byteArray) {
+ if (byteArray.length % 4 > 0) {
+ throw 'Data length in bits should be divisible by 32, but it is not (' + byteArray.length + ' bytes = ' + byteArray.length*8 + ' bits).'
+ }
+
+ //h = hashlib.sha256(data).hexdigest()
+ var data = byteArrayToWordArray(byteArray);
+ var hash = sjcl.hash.sha256.hash(data);
+ var h = sjcl.codec.hex.fromBits(hash);
+
+ // b is a binary string, eg '00111010101100...'
+ //b = bin(int(binascii.hexlify(data), 16))[2:].zfill(len(data) * 8) + \
+ // bin(int(h, 16))[2:].zfill(256)[:len(data) * 8 / 32]
+ //
+ // a = bin(int(binascii.hexlify(data), 16))[2:].zfill(len(data) * 8)
+ // c = bin(int(h, 16))[2:].zfill(256)
+ // d = c[:len(data) * 8 / 32]
+ var a = byteArrayToBinaryString(byteArray);
+ var c = zfill(hexStringToBinaryString(h), 256);
+ var d = c.substring(0, byteArray.length * 8 / 32);
+ // b = line1 + line2
+ var b = a + d;
+
+ var result = [];
+ var blen = b.length / 11;
+ for (var i=0; i<blen; i++) {
+ var idx = parseInt(b.substring(i * 11, (i + 1) * 11), 2);
+ result.push(wordlist[idx]);
+ }
+ return self.joinWords(result);
+ }
+
+ self.check = function(mnemonic) {
+ var mnemonic = self.splitWords(mnemonic);
+ if (mnemonic.length % 3 > 0) {
+ return false
+ }
+ // idx = map(lambda x: bin(self.wordlist.index(x))[2:].zfill(11), mnemonic)
+ var idx = [];
+ for (var i=0; i<mnemonic.length; i++) {
+ var word = mnemonic[i];
+ var wordIndex = wordlist.indexOf(word);
+ if (wordIndex == -1) {
+ return false;
+ }
+ var binaryIndex = zfill(wordIndex.toString(2), 11);
+ idx.push(binaryIndex);
+ }
+ var b = idx.join('');
+ var l = b.length;
+ //d = b[:l / 33 * 32]
+ //h = b[-l / 33:]
+ var d = b.substring(0, l / 33 * 32);
+ var h = b.substring(l - l / 33, l);
+ //nd = binascii.unhexlify(hex(int(d, 2))[2:].rstrip('L').zfill(l / 33 * 8))
+ var nd = binaryStringToWordArray(d);
+ //nh = bin(int(hashlib.sha256(nd).hexdigest(), 16))[2:].zfill(256)[:l / 33]
+ var ndHash = sjcl.hash.sha256.hash(nd);
+ var ndHex = sjcl.codec.hex.fromBits(ndHash);
+ var ndBstr = zfill(hexStringToBinaryString(ndHex), 256);
+ var nh = ndBstr.substring(0,l/33);
+ return h == nh;
+ }
+
+ self.toSeed = function(mnemonic, passphrase) {
+ passphrase = passphrase || '';
+ mnemonic = self.joinWords(self.splitWords(self.normalizeString(mnemonic))); // removes blanks
+ passphrase = self.normalizeString(passphrase)
+ passphrase = "mnemonic" + passphrase;
+ var mnemonicBits = sjcl.codec.utf8String.toBits(mnemonic);
+ var passphraseBits = sjcl.codec.utf8String.toBits(passphrase);
+ var result = sjcl.misc.pbkdf2(mnemonicBits, passphraseBits, PBKDF2_ROUNDS, 512, hmacSHA512);
+ var hashHex = sjcl.codec.hex.fromBits(result);
+ return hashHex;
+ }
+
+ self.splitWords = function(mnemonic) {
+ return mnemonic.split(/\s/g).filter(function(x) { return x.length; });
+ }
+
+ self.joinWords = function(words) {
+ // Set space correctly depending on the language
+ // see https://github.com/bitcoin/bips/blob/master/bip-0039/bip-0039-wordlists.md#japanese
+ var space = " ";
+ if (language == "japanese") {
+ space = "\u3000"; // ideographic space
+ }
+ return words.join(space);
+ }
+
+ self.normalizeString = function(str) {
+ if (typeof str.normalize == "function") {
+ return str.normalize("NFKD");
+ }
+ else {
+ // TODO decide how to handle this in the future.
+ // https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String/normalize
+ return str;
+ }
+ }
+
+ function byteArrayToWordArray(data) {
+ var a = [];
+ for (var i=0; i<data.length/4; i++) {
+ v = 0;
+ v += data[i*4 + 0] << 8 * 3;
+ v += data[i*4 + 1] << 8 * 2;
+ v += data[i*4 + 2] << 8 * 1;
+ v += data[i*4 + 3] << 8 * 0;
+ a.push(v);
+ }
+ return a;
+ }
+
+ function byteArrayToBinaryString(data) {
+ var bin = "";
+ for (var i=0; i<data.length; i++) {
+ bin += zfill(data[i].toString(2), 8);
+ }
+ return bin;
+ }
+
+ function hexStringToBinaryString(hexString) {
+ binaryString = "";
+ for (var i=0; i<hexString.length; i++) {
+ binaryString += zfill(parseInt(hexString[i], 16).toString(2),4);
+ }
+ return binaryString;
+ }
+
+ function binaryStringToWordArray(binary) {
+ var aLen = binary.length / 32;
+ var a = [];
+ for (var i=0; i<aLen; i++) {
+ var valueStr = binary.substring(0,32);
+ var value = parseInt(valueStr, 2);
+ a.push(value);
+ binary = binary.slice(32);
+ }
+ return a;
+ }
+
+ // Pad a numeric string on the left with zero digits until the given width
+ // is reached.
+ // Note this differs to the python implementation because it does not
+ // handle numbers starting with a sign.
+ function zfill(source, length) {
+ source = source.toString();
+ while (source.length < length) {
+ source = '0' + source;
+ }
+ return source;
+ }
+
+ init();
+
+}
+</script>
+ <script>window.Entropy = new (function() {
+
+ var matchers = {
+ binary: /[0-1]/gi,
+ base6: /[0-5]/gi,
+ dice: /[1-6]/gi, // ie dice numbers
+ base10: /[0-9]/gi,
+ hex: /[0-9A-F]/gi,
+ }
+
+ this.fromString = function(rawEntropyStr) {
+ // Find type of entropy being used (binary, hex, dice etc)
+ var base = getBase(rawEntropyStr);
+ // Convert dice to base6 entropy (ie 1-6 to 0-5)
+ if (base.str == "dice") {
+ var newRawEntropyStr = "";
+ for (var i=0; i<rawEntropyStr.length; i++) {
+ var c = rawEntropyStr[i];
+ if ("123456".indexOf(c) > -1) {
+ newRawEntropyStr += (parseInt(c) - 1).toString();
+ }
+ else {
+ newRawEntropyStr += c
+ }
+ }
+ rawEntropyStr = newRawEntropyStr;
+ base.str = "base 6 (dice)";
+ base.matcher = matchers.base6;
+ }
+ var entropyParts = rawEntropyStr.match(base.matcher) || [];
+ var entropyStr = entropyParts.join("");
+ // Detect empty entropy
+ if (entropyStr.length == 0) {
+ return {
+ binaryStr: "",
+ hexStr: "",
+ cleanStr: "",
+ base: base,
+ };
+ }
+ // Pull leading zeros off
+ var leadingZeros = "";
+ while (entropyStr[0] == "0") {
+ leadingZeros += "0";
+ entropyStr = entropyStr.substring(1);
+ }
+ // Convert leading zeros to binary equivalent
+ var numBinLeadingZeros = Math.ceil(Math.log2(base.asInt) * leadingZeros.length);
+ var binLeadingZeros = "";
+ for (var i=0; i<numBinLeadingZeros; i++) {
+ binLeadingZeros += "0";
+ }
+ // Convert leading zeros to hex equivalent
+ var numHexLeadingZeros = Math.floor(numBinLeadingZeros / 4);
+ var hexLeadingZeros = "";
+ for (var i=0; i<numHexLeadingZeros; i++) {
+ hexLeadingZeros += "0";
+ }
+ // Handle entropy of zero
+ if (entropyStr == "") {
+ return {
+ binaryStr: binLeadingZeros,
+ hexStr: hexLeadingZeros || "0",
+ cleanStr: leadingZeros,
+ base: base,
+ }
+ }
+ // If using hex, should always be multiples of 4 bits, which can get
+ // out of sync if first number has leading 0 bits, eg 2 in hex is 0010
+ // which would show up as 10, thus missing 2 bits it should have.
+ if (base.asInt == 16) {
+ var firstDigit = parseInt(entropyStr[0], 16);
+ if (firstDigit >= 4 && firstDigit < 8) {
+ binLeadingZeros += "0";
+ }
+ else if (firstDigit >= 2 && firstDigit < 4) {
+ binLeadingZeros += "00";
+ }
+ else if (firstDigit >= 1 && firstDigit < 2) {
+ binLeadingZeros += "000";
+ }
+ }
+ // Convert entropy to different foramts
+ var entropyInt = BigInteger.parse(entropyStr, base.asInt);
+ var entropyBin = binLeadingZeros + entropyInt.toString(2);
+ var entropyHex = hexLeadingZeros + entropyInt.toString(16);
+ var entropyClean = leadingZeros + entropyStr;
+ var e = {
+ binaryStr: entropyBin,
+ hexStr: entropyHex,
+ cleanStr: entropyClean,
+ base: base,
+ }
+ return e;
+ }
+
+ function getBase(str) {
+ // Need to get the lowest base for the supplied entropy.
+ // This prevents interpreting, say, dice rolls as hexadecimal.
+ var binaryMatches = str.match(matchers.binary) || [];
+ var base6Matches = str.match(matchers.base6) || [];
+ var diceMatches = str.match(matchers.dice) || [];
+ var base10Matches = str.match(matchers.base10) || [];
+ var hexMatches = str.match(matchers.hex) || [];
+ // Find the lowest base that can be used, whilst ignoring any irrelevant chars
+ if (binaryMatches.length == hexMatches.length) {
+ return {
+ matcher: matchers.binary,
+ asInt: 2,
+ str: "binary",
+ }
+ }
+ if (diceMatches.length == hexMatches.length) {
+ return {
+ matcher: matchers.dice,
+ asInt: 6,
+ str: "dice",
+ }
+ }
+ if (base6Matches.length == hexMatches.length) {
+ return {
+ matcher: matchers.base6,
+ asInt: 6,
+ str: "base 6",
+ }
+ }
+ if (base10Matches.length == hexMatches.length) {
+ return {
+ matcher: matchers.base10,
+ asInt: 10,
+ str: "base 10",
+ }
+ }
+ return {
+ matcher: matchers.hex,
+ asInt: 16,
+ str: "hexadecimal",
+ }
+ }
+
+ // Polyfill for Math.log2
+ // See https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Math/log2#Polyfill
+ Math.log2 = Math.log2 || function(x) {
+ return Math.log(x) * Math.LOG2E;
+ };
+
+})();
+
+
+// BigInteger library included here because
+// only the entropy library depends on it
+// so if entropy detection is removed so is the dependency
+
+
+/*
+ JavaScript BigInteger library version 0.9.1
+ http://silentmatt.com/biginteger/
+
+ Copyright (c) 2009 Matthew Crumley <email@matthewcrumley.com>
+ Copyright (c) 2010,2011 by John Tobey <John.Tobey@gmail.com>
+ Licensed under the MIT license.
+
+ Support for arbitrary internal representation base was added by
+ Vitaly Magerya.
+*/
+
+/*
+ File: biginteger.js
+
+ Exports:
+
+ <BigInteger>
+*/
+(function(exports) {
+"use strict";
+/*
+ Class: BigInteger
+ An arbitrarily-large integer.
+
+ <BigInteger> objects should be considered immutable. None of the "built-in"
+ methods modify *this* or their arguments. All properties should be
+ considered private.
+
+ All the methods of <BigInteger> instances can be called "statically". The
+ static versions are convenient if you don't already have a <BigInteger>
+ object.
+
+ As an example, these calls are equivalent.
+
+ > BigInteger(4).multiply(5); // returns BigInteger(20);
+ > BigInteger.multiply(4, 5); // returns BigInteger(20);
+
+ > var a = 42;
+ > var a = BigInteger.toJSValue("0b101010"); // Not completely useless...
+*/
+
+var CONSTRUCT = {}; // Unique token to call "private" version of constructor
+
+/*
+ Constructor: BigInteger()
+ Convert a value to a <BigInteger>.
+
+ Although <BigInteger()> is the constructor for <BigInteger> objects, it is
+ best not to call it as a constructor. If *n* is a <BigInteger> object, it is
+ simply returned as-is. Otherwise, <BigInteger()> is equivalent to <parse>
+ without a radix argument.
+
+ > var n0 = BigInteger(); // Same as <BigInteger.ZERO>
+ > var n1 = BigInteger("123"); // Create a new <BigInteger> with value 123
+ > var n2 = BigInteger(123); // Create a new <BigInteger> with value 123
+ > var n3 = BigInteger(n2); // Return n2, unchanged
+
+ The constructor form only takes an array and a sign. *n* must be an
+ array of numbers in little-endian order, where each digit is between 0
+ and BigInteger.base. The second parameter sets the sign: -1 for
+ negative, +1 for positive, or 0 for zero. The array is *not copied and
+ may be modified*. If the array contains only zeros, the sign parameter
+ is ignored and is forced to zero.
+
+ > new BigInteger([5], -1): create a new BigInteger with value -5
+
+ Parameters:
+
+ n - Value to convert to a <BigInteger>.
+
+ Returns:
+
+ A <BigInteger> value.
+
+ See Also:
+
+ <parse>, <BigInteger>
+*/
+function BigInteger(n, s, token) {
+ if (token !== CONSTRUCT) {
+ if (n instanceof BigInteger) {
+ return n;
+ }
+ else if (typeof n === "undefined") {
+ return ZERO;
+ }
+ return BigInteger.parse(n);
+ }
+
+ n = n || []; // Provide the nullary constructor for subclasses.
+ while (n.length && !n[n.length - 1]) {
+ --n.length;
+ }
+ this._d = n;
+ this._s = n.length ? (s || 1) : 0;
+}
+
+BigInteger._construct = function(n, s) {
+ return new BigInteger(n, s, CONSTRUCT);
+};
+
+// Base-10 speedup hacks in parse, toString, exp10 and log functions
+// require base to be a power of 10. 10^7 is the largest such power
+// that won't cause a precision loss when digits are multiplied.
+var BigInteger_base = 10000000;
+var BigInteger_base_log10 = 7;
+
+BigInteger.base = BigInteger_base;
+BigInteger.base_log10 = BigInteger_base_log10;
+
+var ZERO = new BigInteger([], 0, CONSTRUCT);
+// Constant: ZERO
+// <BigInteger> 0.
+BigInteger.ZERO = ZERO;
+
+var ONE = new BigInteger([1], 1, CONSTRUCT);
+// Constant: ONE
+// <BigInteger> 1.
+BigInteger.ONE = ONE;
+
+var M_ONE = new BigInteger(ONE._d, -1, CONSTRUCT);
+// Constant: M_ONE
+// <BigInteger> -1.
+BigInteger.M_ONE = M_ONE;
+
+// Constant: _0
+// Shortcut for <ZERO>.
+BigInteger._0 = ZERO;
+
+// Constant: _1
+// Shortcut for <ONE>.
+BigInteger._1 = ONE;
+
+/*
+ Constant: small
+ Array of <BigIntegers> from 0 to 36.
+
+ These are used internally for parsing, but useful when you need a "small"
+ <BigInteger>.
+
+ See Also:
+
+ <ZERO>, <ONE>, <_0>, <_1>
+*/
+BigInteger.small = [
+ ZERO,
+ ONE,
+ /* Assuming BigInteger_base > 36 */
+ new BigInteger( [2], 1, CONSTRUCT),
+ new BigInteger( [3], 1, CONSTRUCT),
+ new BigInteger( [4], 1, CONSTRUCT),
+ new BigInteger( [5], 1, CONSTRUCT),
+ new BigInteger( [6], 1, CONSTRUCT),
+ new BigInteger( [7], 1, CONSTRUCT),
+ new BigInteger( [8], 1, CONSTRUCT),
+ new BigInteger( [9], 1, CONSTRUCT),
+ new BigInteger([10], 1, CONSTRUCT),
+ new BigInteger([11], 1, CONSTRUCT),
+ new BigInteger([12], 1, CONSTRUCT),
+ new BigInteger([13], 1, CONSTRUCT),
+ new BigInteger([14], 1, CONSTRUCT),
+ new BigInteger([15], 1, CONSTRUCT),
+ new BigInteger([16], 1, CONSTRUCT),
+ new BigInteger([17], 1, CONSTRUCT),
+ new BigInteger([18], 1, CONSTRUCT),
+ new BigInteger([19], 1, CONSTRUCT),
+ new BigInteger([20], 1, CONSTRUCT),
+ new BigInteger([21], 1, CONSTRUCT),
+ new BigInteger([22], 1, CONSTRUCT),
+ new BigInteger([23], 1, CONSTRUCT),
+ new BigInteger([24], 1, CONSTRUCT),
+ new BigInteger([25], 1, CONSTRUCT),
+ new BigInteger([26], 1, CONSTRUCT),
+ new BigInteger([27], 1, CONSTRUCT),
+ new BigInteger([28], 1, CONSTRUCT),
+ new BigInteger([29], 1, CONSTRUCT),
+ new BigInteger([30], 1, CONSTRUCT),
+ new BigInteger([31], 1, CONSTRUCT),
+ new BigInteger([32], 1, CONSTRUCT),
+ new BigInteger([33], 1, CONSTRUCT),
+ new BigInteger([34], 1, CONSTRUCT),
+ new BigInteger([35], 1, CONSTRUCT),
+ new BigInteger([36], 1, CONSTRUCT)
+];
+
+// Used for parsing/radix conversion
+BigInteger.digits = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ".split("");
+
+/*
+ Method: toString
+ Convert a <BigInteger> to a string.
+
+ When *base* is greater than 10, letters are upper case.
+
+ Parameters:
+
+ base - Optional base to represent the number in (default is base 10).
+ Must be between 2 and 36 inclusive, or an Error will be thrown.
+
+ Returns:
+
+ The string representation of the <BigInteger>.
+*/
+BigInteger.prototype.toString = function(base) {
+ base = +base || 10;
+ if (base < 2 || base > 36) {
+ throw new Error("illegal radix " + base + ".");
+ }
+ if (this._s === 0) {
+ return "0";
+ }
+ if (base === 10) {
+ var str = this._s < 0 ? "-" : "";
+ str += this._d[this._d.length - 1].toString();
+ for (var i = this._d.length - 2; i >= 0; i--) {
+ var group = this._d[i].toString();
+ while (group.length < BigInteger_base_log10) group = '0' + group;
+ str += group;
+ }
+ return str;
+ }
+ else {
+ var numerals = BigInteger.digits;
+ base = BigInteger.small[base];
+ var sign = this._s;
+
+ var n = this.abs();
+ var digits = [];
+ var digit;
+
+ while (n._s !== 0) {
+ var divmod = n.divRem(base);
+ n = divmod[0];
+ digit = divmod[1];
+ // TODO: This could be changed to unshift instead of reversing at the end.
+ // Benchmark both to compare speeds.
+ digits.push(numerals[digit.valueOf()]);
+ }
+ return (sign < 0 ? "-" : "") + digits.reverse().join("");
+ }
+};
+
+// Verify strings for parsing
+BigInteger.radixRegex = [
+ /^$/,
+ /^$/,
+ /^[01]*$/,
+ /^[012]*$/,
+ /^[0-3]*$/,
+ /^[0-4]*$/,
+ /^[0-5]*$/,
+ /^[0-6]*$/,
+ /^[0-7]*$/,
+ /^[0-8]*$/,
+ /^[0-9]*$/,
+ /^[0-9aA]*$/,
+ /^[0-9abAB]*$/,
+ /^[0-9abcABC]*$/,
+ /^[0-9a-dA-D]*$/,
+ /^[0-9a-eA-E]*$/,
+ /^[0-9a-fA-F]*$/,
+ /^[0-9a-gA-G]*$/,
+ /^[0-9a-hA-H]*$/,
+ /^[0-9a-iA-I]*$/,
+ /^[0-9a-jA-J]*$/,
+ /^[0-9a-kA-K]*$/,
+ /^[0-9a-lA-L]*$/,
+ /^[0-9a-mA-M]*$/,
+ /^[0-9a-nA-N]*$/,
+ /^[0-9a-oA-O]*$/,
+ /^[0-9a-pA-P]*$/,
+ /^[0-9a-qA-Q]*$/,
+ /^[0-9a-rA-R]*$/,
+ /^[0-9a-sA-S]*$/,
+ /^[0-9a-tA-T]*$/,
+ /^[0-9a-uA-U]*$/,
+ /^[0-9a-vA-V]*$/,
+ /^[0-9a-wA-W]*$/,
+ /^[0-9a-xA-X]*$/,
+ /^[0-9a-yA-Y]*$/,
+ /^[0-9a-zA-Z]*$/
+];
+
+/*
+ Function: parse
+ Parse a string into a <BigInteger>.
+
+ *base* is optional but, if provided, must be from 2 to 36 inclusive. If
+ *base* is not provided, it will be guessed based on the leading characters
+ of *s* as follows:
+
+ - "0x" or "0X": *base* = 16
+ - "0c" or "0C": *base* = 8
+ - "0b" or "0B": *base* = 2
+ - else: *base* = 10
+
+ If no base is provided, or *base* is 10, the number can be in exponential
+ form. For example, these are all valid:
+
+ > BigInteger.parse("1e9"); // Same as "1000000000"
+ > BigInteger.parse("1.234*10^3"); // Same as 1234
+ > BigInteger.parse("56789 * 10 ** -2"); // Same as 567
+
+ If any characters fall outside the range defined by the radix, an exception
+ will be thrown.
+
+ Parameters:
+
+ s - The string to parse.
+ base - Optional radix (default is to guess based on *s*).
+
+ Returns:
+
+ a <BigInteger> instance.
+*/
+BigInteger.parse = function(s, base) {
+ // Expands a number in exponential form to decimal form.
+ // expandExponential("-13.441*10^5") === "1344100";
+ // expandExponential("1.12300e-1") === "0.112300";
+ // expandExponential(1000000000000000000000000000000) === "1000000000000000000000000000000";
+ function expandExponential(str) {
+ str = str.replace(/\s*[*xX]\s*10\s*(\^|\*\*)\s*/, "e");
+
+ return str.replace(/^([+\-])?(\d+)\.?(\d*)[eE]([+\-]?\d+)$/, function(x, s, n, f, c) {
+ c = +c;
+ var l = c < 0;
+ var i = n.length + c;
+ x = (l ? n : f).length;
+ c = ((c = Math.abs(c)) >= x ? c - x + l : 0);
+ var z = (new Array(c + 1)).join("0");
+ var r = n + f;
+ return (s || "") + (l ? r = z + r : r += z).substr(0, i += l ? z.length : 0) + (i < r.length ? "." + r.substr(i) : "");
+ });
+ }
+
+ s = s.toString();
+ if (typeof base === "undefined" || +base === 10) {
+ s = expandExponential(s);
+ }
+
+ var prefixRE;
+ if (typeof base === "undefined") {
+ prefixRE = '0[xcb]';
+ }
+ else if (base == 16) {
+ prefixRE = '0x';
+ }
+ else if (base == 8) {
+ prefixRE = '0c';
+ }
+ else if (base == 2) {
+ prefixRE = '0b';
+ }
+ else {
+ prefixRE = '';
+ }
+ var parts = new RegExp('^([+\\-]?)(' + prefixRE + ')?([0-9a-z]*)(?:\\.\\d*)?$', 'i').exec(s);
+ if (parts) {
+ var sign = parts[1] || "+";
+ var baseSection = parts[2] || "";
+ var digits = parts[3] || "";
+
+ if (typeof base === "undefined") {
+ // Guess base
+ if (baseSection === "0x" || baseSection === "0X") { // Hex
+ base = 16;
+ }
+ else if (baseSection === "0c" || baseSection === "0C") { // Octal
+ base = 8;
+ }
+ else if (baseSection === "0b" || baseSection === "0B") { // Binary
+ base = 2;
+ }
+ else {
+ base = 10;
+ }
+ }
+ else if (base < 2 || base > 36) {
+ throw new Error("Illegal radix " + base + ".");
+ }
+
+ base = +base;
+
+ // Check for digits outside the range
+ if (!(BigInteger.radixRegex[base].test(digits))) {
+ throw new Error("Bad digit for radix " + base);
+ }
+
+ // Strip leading zeros, and convert to array
+ digits = digits.replace(/^0+/, "").split("");
+ if (digits.length === 0) {
+ return ZERO;
+ }
+
+ // Get the sign (we know it's not zero)
+ sign = (sign === "-") ? -1 : 1;
+
+ // Optimize 10
+ if (base == 10) {
+ var d = [];
+ while (digits.length >= BigInteger_base_log10) {
+ d.push(parseInt(digits.splice(digits.length-BigInteger.base_log10, BigInteger.base_log10).join(''), 10));
+ }
+ d.push(parseInt(digits.join(''), 10));
+ return new BigInteger(d, sign, CONSTRUCT);
+ }
+
+ // Do the conversion
+ var d = ZERO;
+ base = BigInteger.small[base];
+ var small = BigInteger.small;
+ for (var i = 0; i < digits.length; i++) {
+ d = d.multiply(base).add(small[parseInt(digits[i], 36)]);
+ }
+ return new BigInteger(d._d, sign, CONSTRUCT);
+ }
+ else {
+ throw new Error("Invalid BigInteger format: " + s);
+ }
+};
+
+/*
+ Function: add
+ Add two <BigIntegers>.
+
+ Parameters:
+
+ n - The number to add to *this*. Will be converted to a <BigInteger>.
+
+ Returns:
+
+ The numbers added together.
+
+ See Also:
+
+ <subtract>, <multiply>, <quotient>, <next>
+*/
+BigInteger.prototype.add = function(n) {
+ if (this._s === 0) {
+ return BigInteger(n);
+ }
+
+ n = BigInteger(n);
+ if (n._s === 0) {
+ return this;
+ }
+ if (this._s !== n._s) {
+ n = n.negate();
+ return this.subtract(n);
+ }
+
+ var a = this._d;
+ var b = n._d;
+ var al = a.length;
+ var bl = b.length;
+ var sum = new Array(Math.max(al, bl) + 1);
+ var size = Math.min(al, bl);
+ var carry = 0;
+ var digit;
+
+ for (var i = 0; i < size; i++) {
+ digit = a[i] + b[i] + carry;
+ sum[i] = digit % BigInteger_base;
+ carry = (digit / BigInteger_base) | 0;
+ }
+ if (bl > al) {
+ a = b;
+ al = bl;
+ }
+ for (i = size; carry && i < al; i++) {
+ digit = a[i] + carry;
+ sum[i] = digit % BigInteger_base;
+ carry = (digit / BigInteger_base) | 0;
+ }
+ if (carry) {
+ sum[i] = carry;
+ }
+
+ for ( ; i < al; i++) {
+ sum[i] = a[i];
+ }
+
+ return new BigInteger(sum, this._s, CONSTRUCT);
+};
+
+/*
+ Function: negate
+ Get the additive inverse of a <BigInteger>.
+
+ Returns:
+
+ A <BigInteger> with the same magnatude, but with the opposite sign.
+
+ See Also:
+
+ <abs>
+*/
+BigInteger.prototype.negate = function() {
+ return new BigInteger(this._d, (-this._s) | 0, CONSTRUCT);
+};
+
+/*
+ Function: abs
+ Get the absolute value of a <BigInteger>.
+
+ Returns:
+
+ A <BigInteger> with the same magnatude, but always positive (or zero).
+
+ See Also:
+
+ <negate>
+*/
+BigInteger.prototype.abs = function() {
+ return (this._s < 0) ? this.negate() : this;
+};
+
+/*
+ Function: subtract
+ Subtract two <BigIntegers>.
+
+ Parameters:
+
+ n - The number to subtract from *this*. Will be converted to a <BigInteger>.
+
+ Returns:
+
+ The *n* subtracted from *this*.
+
+ See Also:
+
+ <add>, <multiply>, <quotient>, <prev>
+*/
+BigInteger.prototype.subtract = function(n) {
+ if (this._s === 0) {
+ return BigInteger(n).negate();
+ }
+
+ n = BigInteger(n);
+ if (n._s === 0) {
+ return this;
+ }
+ if (this._s !== n._s) {
+ n = n.negate();
+ return this.add(n);
+ }
+
+ var m = this;
+ // negative - negative => -|a| - -|b| => -|a| + |b| => |b| - |a|
+ if (this._s < 0) {
+ m = new BigInteger(n._d, 1, CONSTRUCT);
+ n = new BigInteger(this._d, 1, CONSTRUCT);
+ }
+
+ // Both are positive => a - b
+ var sign = m.compareAbs(n);
+ if (sign === 0) {
+ return ZERO;
+ }
+ else if (sign < 0) {
+ // swap m and n
+ var t = n;
+ n = m;
+ m = t;
+ }
+
+ // a > b
+ var a = m._d;
+ var b = n._d;
+ var al = a.length;
+ var bl = b.length;
+ var diff = new Array(al); // al >= bl since a > b
+ var borrow = 0;
+ var i;
+ var digit;
+
+ for (i = 0; i < bl; i++) {
+ digit = a[i] - borrow - b[i];
+ if (digit < 0) {
+ digit += BigInteger_base;
+ borrow = 1;
+ }
+ else {
+ borrow = 0;
+ }
+ diff[i] = digit;
+ }
+ for (i = bl; i < al; i++) {
+ digit = a[i] - borrow;
+ if (digit < 0) {
+ digit += BigInteger_base;
+ }
+ else {
+ diff[i++] = digit;
+ break;
+ }
+ diff[i] = digit;
+ }
+ for ( ; i < al; i++) {
+ diff[i] = a[i];
+ }
+
+ return new BigInteger(diff, sign, CONSTRUCT);
+};
+
+(function() {
+ function addOne(n, sign) {
+ var a = n._d;
+ var sum = a.slice();
+ var carry = true;
+ var i = 0;
+
+ while (true) {
+ var digit = (a[i] || 0) + 1;
+ sum[i] = digit % BigInteger_base;
+ if (digit <= BigInteger_base - 1) {
+ break;
+ }
+ ++i;
+ }
+
+ return new BigInteger(sum, sign, CONSTRUCT);
+ }
+
+ function subtractOne(n, sign) {
+ var a = n._d;
+ var sum = a.slice();
+ var borrow = true;
+ var i = 0;
+
+ while (true) {
+ var digit = (a[i] || 0) - 1;
+ if (digit < 0) {
+ sum[i] = digit + BigInteger_base;
+ }
+ else {
+ sum[i] = digit;
+ break;
+ }
+ ++i;
+ }
+
+ return new BigInteger(sum, sign, CONSTRUCT);
+ }
+
+ /*
+ Function: next
+ Get the next <BigInteger> (add one).
+
+ Returns:
+
+ *this* + 1.
+
+ See Also:
+
+ <add>, <prev>
+ */
+ BigInteger.prototype.next = function() {
+ switch (this._s) {
+ case 0:
+ return ONE;
+ case -1:
+ return subtractOne(this, -1);
+ // case 1:
+ default:
+ return addOne(this, 1);
+ }
+ };
+
+ /*
+ Function: prev
+ Get the previous <BigInteger> (subtract one).
+
+ Returns:
+
+ *this* - 1.
+
+ See Also:
+
+ <next>, <subtract>
+ */
+ BigInteger.prototype.prev = function() {
+ switch (this._s) {
+ case 0:
+ return M_ONE;
+ case -1:
+ return addOne(this, -1);
+ // case 1:
+ default:
+ return subtractOne(this, 1);
+ }
+ };
+})();
+
+/*
+ Function: compareAbs
+ Compare the absolute value of two <BigIntegers>.
+
+ Calling <compareAbs> is faster than calling <abs> twice, then <compare>.
+
+ Parameters:
+
+ n - The number to compare to *this*. Will be converted to a <BigInteger>.
+
+ Returns:
+
+ -1, 0, or +1 if *|this|* is less than, equal to, or greater than *|n|*.
+
+ See Also:
+
+ <compare>, <abs>
+*/
+BigInteger.prototype.compareAbs = function(n) {
+ if (this === n) {
+ return 0;
+ }
+
+ if (!(n instanceof BigInteger)) {
+ if (!isFinite(n)) {
+ return(isNaN(n) ? n : -1);
+ }
+ n = BigInteger(n);
+ }
+
+ if (this._s === 0) {
+ return (n._s !== 0) ? -1 : 0;
+ }
+ if (n._s === 0) {
+ return 1;
+ }
+
+ var l = this._d.length;
+ var nl = n._d.length;
+ if (l < nl) {
+ return -1;
+ }
+ else if (l > nl) {
+ return 1;
+ }
+
+ var a = this._d;
+ var b = n._d;
+ for (var i = l-1; i >= 0; i--) {
+ if (a[i] !== b[i]) {
+ return a[i] < b[i] ? -1 : 1;
+ }
+ }
+
+ return 0;
+};
+
+/*
+ Function: compare
+ Compare two <BigIntegers>.
+
+ Parameters:
+
+ n - The number to compare to *this*. Will be converted to a <BigInteger>.
+
+ Returns:
+
+ -1, 0, or +1 if *this* is less than, equal to, or greater than *n*.
+
+ See Also:
+
+ <compareAbs>, <isPositive>, <isNegative>, <isUnit>
+*/
+BigInteger.prototype.compare = function(n) {
+ if (this === n) {
+ return 0;
+ }
+
+ n = BigInteger(n);
+
+ if (this._s === 0) {
+ return -n._s;
+ }
+
+ if (this._s === n._s) { // both positive or both negative
+ var cmp = this.compareAbs(n);
+ return cmp * this._s;
+ }
+ else {
+ return this._s;
+ }
+};
+
+/*
+ Function: isUnit
+ Return true iff *this* is either 1 or -1.
+
+ Returns:
+
+ true if *this* compares equal to <BigInteger.ONE> or <BigInteger.M_ONE>.
+
+ See Also:
+
+ <isZero>, <isNegative>, <isPositive>, <compareAbs>, <compare>,
+ <BigInteger.ONE>, <BigInteger.M_ONE>
+*/
+BigInteger.prototype.isUnit = function() {
+ return this === ONE ||
+ this === M_ONE ||
+ (this._d.length === 1 && this._d[0] === 1);
+};
+
+/*
+ Function: multiply
+ Multiply two <BigIntegers>.
+
+ Parameters:
+
+ n - The number to multiply *this* by. Will be converted to a
+ <BigInteger>.
+
+ Returns:
+
+ The numbers multiplied together.
+
+ See Also:
+
+ <add>, <subtract>, <quotient>, <square>
+*/
+BigInteger.prototype.multiply = function(n) {
+ // TODO: Consider adding Karatsuba multiplication for large numbers
+ if (this._s === 0) {
+ return ZERO;
+ }
+
+ n = BigInteger(n);
+ if (n._s === 0) {
+ return ZERO;
+ }
+ if (this.isUnit()) {
+ if (this._s < 0) {
+ return n.negate();
+ }
+ return n;
+ }
+ if (n.isUnit()) {
+ if (n._s < 0) {
+ return this.negate();
+ }
+ return this;
+ }
+ if (this === n) {
+ return this.square();
+ }
+
+ var r = (this._d.length >= n._d.length);
+ var a = (r ? this : n)._d; // a will be longer than b
+ var b = (r ? n : this)._d;
+ var al = a.length;
+ var bl = b.length;
+
+ var pl = al + bl;
+ var partial = new Array(pl);
+ var i;
+ for (i = 0; i < pl; i++) {
+ partial[i] = 0;
+ }
+
+ for (i = 0; i < bl; i++) {
+ var carry = 0;
+ var bi = b[i];
+ var jlimit = al + i;
+ var digit;
+ for (var j = i; j < jlimit; j++) {
+ digit = partial[j] + bi * a[j - i] + carry;
+ carry = (digit / BigInteger_base) | 0;
+ partial[j] = (digit % BigInteger_base) | 0;
+ }
+ if (carry) {
+ digit = partial[j] + carry;
+ carry = (digit / BigInteger_base) | 0;
+ partial[j] = digit % BigInteger_base;
+ }
+ }
+ return new BigInteger(partial, this._s * n._s, CONSTRUCT);
+};
+
+// Multiply a BigInteger by a single-digit native number
+// Assumes that this and n are >= 0
+// This is not really intended to be used outside the library itself
+BigInteger.prototype.multiplySingleDigit = function(n) {
+ if (n === 0 || this._s === 0) {
+ return ZERO;
+ }
+ if (n === 1) {
+ return this;
+ }
+
+ var digit;
+ if (this._d.length === 1) {
+ digit = this._d[0] * n;
+ if (digit >= BigInteger_base) {
+ return new BigInteger([(digit % BigInteger_base)|0,
+ (digit / BigInteger_base)|0], 1, CONSTRUCT);
+ }
+ return new BigInteger([digit], 1, CONSTRUCT);
+ }
+
+ if (n === 2) {
+ return this.add(this);
+ }
+ if (this.isUnit()) {
+ return new BigInteger([n], 1, CONSTRUCT);
+ }
+
+ var a = this._d;
+ var al = a.length;
+
+ var pl = al + 1;
+ var partial = new Array(pl);
+ for (var i = 0; i < pl; i++) {
+ partial[i] = 0;
+ }
+
+ var carry = 0;
+ for (var j = 0; j < al; j++) {
+ digit = n * a[j] + carry;
+ carry = (digit / BigInteger_base) | 0;
+ partial[j] = (digit % BigInteger_base) | 0;
+ }
+ if (carry) {
+ partial[j] = carry;
+ }
+
+ return new BigInteger(partial, 1, CONSTRUCT);
+};
+
+/*
+ Function: square
+ Multiply a <BigInteger> by itself.
+
+ This is slightly faster than regular multiplication, since it removes the
+ duplicated multiplcations.
+
+ Returns:
+
+ > this.multiply(this)
+
+ See Also:
+ <multiply>
+*/
+BigInteger.prototype.square = function() {
+ // Normally, squaring a 10-digit number would take 100 multiplications.
+ // Of these 10 are unique diagonals, of the remaining 90 (100-10), 45 are repeated.
+ // This procedure saves (N*(N-1))/2 multiplications, (e.g., 45 of 100 multiplies).
+ // Based on code by Gary Darby, Intellitech Systems Inc., www.DelphiForFun.org
+
+ if (this._s === 0) {
+ return ZERO;
+ }
+ if (this.isUnit()) {
+ return ONE;
+ }
+
+ var digits = this._d;
+ var length = digits.length;
+ var imult1 = new Array(length + length + 1);
+ var product, carry, k;
+ var i;
+
+ // Calculate diagonal
+ for (i = 0; i < length; i++) {
+ k = i * 2;
+ product = digits[i] * digits[i];
+ carry = (product / BigInteger_base) | 0;
+ imult1[k] = product % BigInteger_base;
+ imult1[k + 1] = carry;
+ }
+
+ // Calculate repeating part
+ for (i = 0; i < length; i++) {
+ carry = 0;
+ k = i * 2 + 1;
+ for (var j = i + 1; j < length; j++, k++) {
+ product = digits[j] * digits[i] * 2 + imult1[k] + carry;
+ carry = (product / BigInteger_base) | 0;
+ imult1[k] = product % BigInteger_base;
+ }
+ k = length + i;
+ var digit = carry + imult1[k];
+ carry = (digit / BigInteger_base) | 0;
+ imult1[k] = digit % BigInteger_base;
+ imult1[k + 1] += carry;
+ }
+
+ return new BigInteger(imult1, 1, CONSTRUCT);
+};
+
+/*
+ Function: quotient
+ Divide two <BigIntegers> and truncate towards zero.
+
+ <quotient> throws an exception if *n* is zero.
+
+ Parameters:
+
+ n - The number to divide *this* by. Will be converted to a <BigInteger>.
+
+ Returns:
+
+ The *this* / *n*, truncated to an integer.
+
+ See Also:
+
+ <add>, <subtract>, <multiply>, <divRem>, <remainder>
+*/
+BigInteger.prototype.quotient = function(n) {
+ return this.divRem(n)[0];
+};
+
+/*
+ Function: divide
+ Deprecated synonym for <quotient>.
+*/
+BigInteger.prototype.divide = BigInteger.prototype.quotient;
+
+/*
+ Function: remainder
+ Calculate the remainder of two <BigIntegers>.
+
+ <remainder> throws an exception if *n* is zero.
+
+ Parameters:
+
+ n - The remainder after *this* is divided *this* by *n*. Will be
+ converted to a <BigInteger>.
+
+ Returns:
+
+ *this* % *n*.
+
+ See Also:
+
+ <divRem>, <quotient>
+*/
+BigInteger.prototype.remainder = function(n) {
+ return this.divRem(n)[1];
+};
+
+/*
+ Function: divRem
+ Calculate the integer quotient and remainder of two <BigIntegers>.
+
+ <divRem> throws an exception if *n* is zero.
+
+ Parameters:
+
+ n - The number to divide *this* by. Will be converted to a <BigInteger>.
+
+ Returns:
+
+ A two-element array containing the quotient and the remainder.
+
+ > a.divRem(b)
+
+ is exactly equivalent to
+
+ > [a.quotient(b), a.remainder(b)]
+
+ except it is faster, because they are calculated at the same time.
+
+ See Also:
+
+ <quotient>, <remainder>
+*/
+BigInteger.prototype.divRem = function(n) {
+ n = BigInteger(n);
+ if (n._s === 0) {
+ throw new Error("Divide by zero");
+ }
+ if (this._s === 0) {
+ return [ZERO, ZERO];
+ }
+ if (n._d.length === 1) {
+ return this.divRemSmall(n._s * n._d[0]);
+ }
+
+ // Test for easy cases -- |n1| <= |n2|
+ switch (this.compareAbs(n)) {
+ case 0: // n1 == n2
+ return [this._s === n._s ? ONE : M_ONE, ZERO];
+ case -1: // |n1| < |n2|
+ return [ZERO, this];
+ }
+
+ var sign = this._s * n._s;
+ var a = n.abs();
+ var b_digits = this._d;
+ var b_index = b_digits.length;
+ var digits = n._d.length;
+ var quot = [];
+ var guess;
+
+ var part = new BigInteger([], 0, CONSTRUCT);
+
+ while (b_index) {
+ part._d.unshift(b_digits[--b_index]);
+ part = new BigInteger(part._d, 1, CONSTRUCT);
+
+ if (part.compareAbs(n) < 0) {
+ quot.push(0);
+ continue;
+ }
+ if (part._s === 0) {
+ guess = 0;
+ }
+ else {
+ var xlen = part._d.length, ylen = a._d.length;
+ var highx = part._d[xlen-1]*BigInteger_base + part._d[xlen-2];
+ var highy = a._d[ylen-1]*BigInteger_base + a._d[ylen-2];
+ if (part._d.length > a._d.length) {
+ // The length of part._d can either match a._d length,
+ // or exceed it by one.
+ highx = (highx+1)*BigInteger_base;
+ }
+ guess = Math.ceil(highx/highy);
+ }
+ do {
+ var check = a.multiplySingleDigit(guess);
+ if (check.compareAbs(part) <= 0) {
+ break;
+ }
+ guess--;
+ } while (guess);
+
+ quot.push(guess);
+ if (!guess) {
+ continue;
+ }
+ var diff = part.subtract(check);
+ part._d = diff._d.slice();
+ }
+
+ return [new BigInteger(quot.reverse(), sign, CONSTRUCT),
+ new BigInteger(part._d, this._s, CONSTRUCT)];
+};
+
+// Throws an exception if n is outside of (-BigInteger.base, -1] or
+// [1, BigInteger.base). It's not necessary to call this, since the
+// other division functions will call it if they are able to.
+BigInteger.prototype.divRemSmall = function(n) {
+ var r;
+ n = +n;
+ if (n === 0) {
+ throw new Error("Divide by zero");
+ }
+
+ var n_s = n < 0 ? -1 : 1;
+ var sign = this._s * n_s;
+ n = Math.abs(n);
+
+ if (n < 1 || n >= BigInteger_base) {
+ throw new Error("Argument out of range");
+ }
+
+ if (this._s === 0) {
+ return [ZERO, ZERO];
+ }
+
+ if (n === 1 || n === -1) {
+ return [(sign === 1) ? this.abs() : new BigInteger(this._d, sign, CONSTRUCT), ZERO];
+ }
+
+ // 2 <= n < BigInteger_base
+
+ // divide a single digit by a single digit
+ if (this._d.length === 1) {
+ var q = new BigInteger([(this._d[0] / n) | 0], 1, CONSTRUCT);
+ r = new BigInteger([(this._d[0] % n) | 0], 1, CONSTRUCT);
+ if (sign < 0) {
+ q = q.negate();
+ }
+ if (this._s < 0) {
+ r = r.negate();
+ }
+ return [q, r];
+ }
+
+ var digits = this._d.slice();
+ var quot = new Array(digits.length);
+ var part = 0;
+ var diff = 0;
+ var i = 0;
+ var guess;
+
+ while (digits.length) {
+ part = part * BigInteger_base + digits[digits.length - 1];
+ if (part < n) {
+ quot[i++] = 0;
+ digits.pop();
+ diff = BigInteger_base * diff + part;
+ continue;
+ }
+ if (part === 0) {
+ guess = 0;
+ }
+ else {
+ guess = (part / n) | 0;
+ }
+
+ var check = n * guess;
+ diff = part - check;
+ quot[i++] = guess;
+ if (!guess) {
+ digits.pop();
+ continue;
+ }
+
+ digits.pop();
+ part = diff;
+ }
+
+ r = new BigInteger([diff], 1, CONSTRUCT);
+ if (this._s < 0) {
+ r = r.negate();
+ }
+ return [new BigInteger(quot.reverse(), sign, CONSTRUCT), r];
+};
+
+/*
+ Function: isEven
+ Return true iff *this* is divisible by two.
+
+ Note that <BigInteger.ZERO> is even.
+
+ Returns:
+
+ true if *this* is even, false otherwise.
+
+ See Also:
+
+ <isOdd>
+*/
+BigInteger.prototype.isEven = function() {
+ var digits = this._d;
+ return this._s === 0 || digits.length === 0 || (digits[0] % 2) === 0;
+};
+
+/*
+ Function: isOdd
+ Return true iff *this* is not divisible by two.
+
+ Returns:
+
+ true if *this* is odd, false otherwise.
+
+ See Also:
+
+ <isEven>
+*/
+BigInteger.prototype.isOdd = function() {
+ return !this.isEven();
+};
+
+/*
+ Function: sign
+ Get the sign of a <BigInteger>.
+
+ Returns:
+
+ * -1 if *this* < 0
+ * 0 if *this* == 0
+ * +1 if *this* > 0
+
+ See Also:
+
+ <isZero>, <isPositive>, <isNegative>, <compare>, <BigInteger.ZERO>
+*/
+BigInteger.prototype.sign = function() {
+ return this._s;
+};
+
+/*
+ Function: isPositive
+ Return true iff *this* > 0.
+
+ Returns:
+
+ true if *this*.compare(<BigInteger.ZERO>) == 1.
+
+ See Also:
+
+ <sign>, <isZero>, <isNegative>, <isUnit>, <compare>, <BigInteger.ZERO>
+*/
+BigInteger.prototype.isPositive = function() {
+ return this._s > 0;
+};
+
+/*
+ Function: isNegative
+ Return true iff *this* < 0.
+
+ Returns:
+
+ true if *this*.compare(<BigInteger.ZERO>) == -1.
+
+ See Also:
+
+ <sign>, <isPositive>, <isZero>, <isUnit>, <compare>, <BigInteger.ZERO>
+*/
+BigInteger.prototype.isNegative = function() {
+ return this._s < 0;
+};
+
+/*
+ Function: isZero
+ Return true iff *this* == 0.
+
+ Returns:
+
+ true if *this*.compare(<BigInteger.ZERO>) == 0.
+
+ See Also:
+
+ <sign>, <isPositive>, <isNegative>, <isUnit>, <BigInteger.ZERO>
+*/
+BigInteger.prototype.isZero = function() {
+ return this._s === 0;
+};
+
+/*
+ Function: exp10
+ Multiply a <BigInteger> by a power of 10.
+
+ This is equivalent to, but faster than
+
+ > if (n >= 0) {
+ > return this.multiply(BigInteger("1e" + n));
+ > }
+ > else { // n <= 0
+ > return this.quotient(BigInteger("1e" + -n));
+ > }
+
+ Parameters:
+
+ n - The power of 10 to multiply *this* by. *n* is converted to a
+ javascipt number and must be no greater than <BigInteger.MAX_EXP>
+ (0x7FFFFFFF), or an exception will be thrown.
+
+ Returns:
+
+ *this* * (10 ** *n*), truncated to an integer if necessary.
+
+ See Also:
+
+ <pow>, <multiply>
+*/
+BigInteger.prototype.exp10 = function(n) {
+ n = +n;
+ if (n === 0) {
+ return this;
+ }
+ if (Math.abs(n) > Number(MAX_EXP)) {
+ throw new Error("exponent too large in BigInteger.exp10");
+ }
+ // Optimization for this == 0. This also keeps us from having to trim zeros in the positive n case
+ if (this._s === 0) {
+ return ZERO;
+ }
+ if (n > 0) {
+ var k = new BigInteger(this._d.slice(), this._s, CONSTRUCT);
+
+ for (; n >= BigInteger_base_log10; n -= BigInteger_base_log10) {
+ k._d.unshift(0);
+ }
+ if (n == 0)
+ return k;
+ k._s = 1;
+ k = k.multiplySingleDigit(Math.pow(10, n));
+ return (this._s < 0 ? k.negate() : k);
+ } else if (-n >= this._d.length*BigInteger_base_log10) {
+ return ZERO;
+ } else {
+ var k = new BigInteger(this._d.slice(), this._s, CONSTRUCT);
+
+ for (n = -n; n >= BigInteger_base_log10; n -= BigInteger_base_log10) {
+ k._d.shift();
+ }
+ return (n == 0) ? k : k.divRemSmall(Math.pow(10, n))[0];
+ }
+};
+
+/*
+ Function: pow
+ Raise a <BigInteger> to a power.
+
+ In this implementation, 0**0 is 1.
+
+ Parameters:
+
+ n - The exponent to raise *this* by. *n* must be no greater than
+ <BigInteger.MAX_EXP> (0x7FFFFFFF), or an exception will be thrown.
+
+ Returns:
+
+ *this* raised to the *nth* power.
+
+ See Also:
+
+ <modPow>
+*/
+BigInteger.prototype.pow = function(n) {
+ if (this.isUnit()) {
+ if (this._s > 0) {
+ return this;
+ }
+ else {
+ return BigInteger(n).isOdd() ? this : this.negate();
+ }
+ }
+
+ n = BigInteger(n);
+ if (n._s === 0) {
+ return ONE;
+ }
+ else if (n._s < 0) {
+ if (this._s === 0) {
+ throw new Error("Divide by zero");
+ }
+ else {
+ return ZERO;
+ }
+ }
+ if (this._s === 0) {
+ return ZERO;
+ }
+ if (n.isUnit()) {
+ return this;
+ }
+
+ if (n.compareAbs(MAX_EXP) > 0) {
+ throw new Error("exponent too large in BigInteger.pow");
+ }
+ var x = this;
+ var aux = ONE;
+ var two = BigInteger.small[2];
+
+ while (n.isPositive()) {
+ if (n.isOdd()) {
+ aux = aux.multiply(x);
+ if (n.isUnit()) {
+ return aux;
+ }
+ }
+ x = x.square();
+ n = n.quotient(two);
+ }
+
+ return aux;
+};
+
+/*
+ Function: modPow
+ Raise a <BigInteger> to a power (mod m).
+
+ Because it is reduced by a modulus, <modPow> is not limited by
+ <BigInteger.MAX_EXP> like <pow>.
+
+ Parameters:
+
+ exponent - The exponent to raise *this* by. Must be positive.
+ modulus - The modulus.
+
+ Returns:
+
+ *this* ^ *exponent* (mod *modulus*).
+
+ See Also:
+
+ <pow>, <mod>
+*/
+BigInteger.prototype.modPow = function(exponent, modulus) {
+ var result = ONE;
+ var base = this;
+
+ while (exponent.isPositive()) {
+ if (exponent.isOdd()) {
+ result = result.multiply(base).remainder(modulus);
+ }
+
+ exponent = exponent.quotient(BigInteger.small[2]);
+ if (exponent.isPositive()) {
+ base = base.square().remainder(modulus);
+ }
+ }
+
+ return result;
+};
+
+/*
+ Function: log
+ Get the natural logarithm of a <BigInteger> as a native JavaScript number.
+
+ This is equivalent to
+
+ > Math.log(this.toJSValue())
+
+ but handles values outside of the native number range.
+
+ Returns:
+
+ log( *this* )
+
+ See Also:
+
+ <toJSValue>
+*/
+BigInteger.prototype.log = function() {
+ switch (this._s) {
+ case 0: return -Infinity;
+ case -1: return NaN;
+ default: // Fall through.
+ }
+
+ var l = this._d.length;
+
+ if (l*BigInteger_base_log10 < 30) {
+ return Math.log(this.valueOf());
+ }
+
+ var N = Math.ceil(30/BigInteger_base_log10);
+ var firstNdigits = this._d.slice(l - N);
+ return Math.log((new BigInteger(firstNdigits, 1, CONSTRUCT)).valueOf()) + (l - N) * Math.log(BigInteger_base);
+};
+
+/*
+ Function: valueOf
+ Convert a <BigInteger> to a native JavaScript integer.
+
+ This is called automatically by JavaScipt to convert a <BigInteger> to a
+ native value.
+
+ Returns:
+
+ > parseInt(this.toString(), 10)
+
+ See Also:
+
+ <toString>, <toJSValue>
+*/
+BigInteger.prototype.valueOf = function() {
+ return parseInt(this.toString(), 10);
+};
+
+/*
+ Function: toJSValue
+ Convert a <BigInteger> to a native JavaScript integer.
+
+ This is the same as valueOf, but more explicitly named.
+
+ Returns:
+
+ > parseInt(this.toString(), 10)
+
+ See Also:
+
+ <toString>, <valueOf>
+*/
+BigInteger.prototype.toJSValue = function() {
+ return parseInt(this.toString(), 10);
};
-</script>
- <!--<script src="/js/index.js"></script>-->
-<script>
+var MAX_EXP = BigInteger(0x7FFFFFFF);
+// Constant: MAX_EXP
+// The largest exponent allowed in <pow> and <exp10> (0x7FFFFFFF or 2147483647).
+BigInteger.MAX_EXP = MAX_EXP;
+
(function() {
+ function makeUnary(fn) {
+ return function(a) {
+ return fn.call(BigInteger(a));
+ };
+ }
+
+ function makeBinary(fn) {
+ return function(a, b) {
+ return fn.call(BigInteger(a), BigInteger(b));
+ };
+ }
+
+ function makeTrinary(fn) {
+ return function(a, b, c) {
+ return fn.call(BigInteger(a), BigInteger(b), BigInteger(c));
+ };
+ }
- var mnemonic = new Mnemonic("english");
+ (function() {
+ var i, fn;
+ var unary = "toJSValue,isEven,isOdd,sign,isZero,isNegative,abs,isUnit,square,negate,isPositive,toString,next,prev,log".split(",");
+ var binary = "compare,remainder,divRem,subtract,add,quotient,divide,multiply,pow,compareAbs".split(",");
+ var trinary = ["modPow"];
+
+ for (i = 0; i < unary.length; i++) {
+ fn = unary[i];
+ BigInteger[fn] = makeUnary(BigInteger.prototype[fn]);
+ }
+
+ for (i = 0; i < binary.length; i++) {
+ fn = binary[i];
+ BigInteger[fn] = makeBinary(BigInteger.prototype[fn]);
+ }
+
+ for (i = 0; i < trinary.length; i++) {
+ fn = trinary[i];
+ BigInteger[fn] = makeTrinary(BigInteger.prototype[fn]);
+ }
+
+ BigInteger.exp10 = function(x, n) {
+ return BigInteger(x).exp10(n);
+ };
+ })();
+})();
+
+exports.BigInteger = BigInteger;
+})(typeof exports !== 'undefined' ? exports : this);
+</script>
+ <script>(function() {
+
+ // mnemonics is populated as required by getLanguage
+ var mnemonics = { "english": new Mnemonic("english") };
+ var mnemonic = mnemonics["english"];
+ var seed = null
var bip32RootKey = null;
var bip32ExtendedKey = null;
- var network = Bitcoin.networks.bitcoin;
+ var network = bitcoin.networks.bitcoin;
var addressRowTemplate = $("#address-row-template");
+ var showIndex = true;
+ var showAddress = true;
+ var showPubKey = true;
+ var showPrivKey = true;
+
+ var entropyChangeTimeoutEvent = null;
var phraseChangeTimeoutEvent = null;
+ var rootKeyChangedTimeoutEvent = null;
var DOM = {};
+ DOM.network = $(".network");
+ DOM.phraseNetwork = $("#network-phrase");
+ DOM.useEntropy = $(".use-entropy");
+ DOM.entropyContainer = $(".entropy-container");
+ DOM.entropy = $(".entropy");
+ DOM.entropyError = $(".entropy-error");
DOM.phrase = $(".phrase");
DOM.passphrase = $(".passphrase");
+ DOM.generateContainer = $(".generate-container");
DOM.generate = $(".generate");
+ DOM.seed = $(".seed");
DOM.rootKey = $(".root-key");
DOM.extendedPrivKey = $(".extended-priv-key");
DOM.extendedPubKey = $(".extended-pub-key");
+ DOM.bip32tab = $("#bip32-tab");
+ DOM.bip44tab = $("#bip44-tab");
+ DOM.bip32panel = $("#bip32");
+ DOM.bip44panel = $("#bip44");
DOM.bip32path = $("#bip32-path");
DOM.bip44path = $("#bip44-path");
DOM.bip44purpose = $("#bip44 .purpose");
DOM.bip44account = $("#bip44 .account");
DOM.bip44change = $("#bip44 .change");
DOM.strength = $(".strength");
+ DOM.hardenedAddresses = $(".hardened-addresses");
DOM.addresses = $(".addresses");
DOM.rowsToAdd = $(".rows-to-add");
DOM.more = $(".more");
DOM.tab = $(".derivation-type a");
DOM.indexToggle = $(".index-toggle");
DOM.addressToggle = $(".address-toggle");
+ DOM.publicKeyToggle = $(".public-key-toggle");
DOM.privateKeyToggle = $(".private-key-toggle");
-
- var derivationPath = DOM.bip44path.val();
+ DOM.languages = $(".languages a");
function init() {
// Events
+ DOM.network.on("change", networkChanged);
+ DOM.useEntropy.on("change", setEntropyVisibility);
+ DOM.entropy.on("input", delayedEntropyChanged);
DOM.phrase.on("input", delayedPhraseChanged);
DOM.passphrase.on("input", delayedPhraseChanged);
DOM.generate.on("click", generateClicked);
DOM.more.on("click", showMore);
- DOM.bip32path.on("input", bip32Changed);
- DOM.bip44purpose.on("input", bip44Changed);
- DOM.bip44coin.on("input", bip44Changed);
- DOM.bip44account.on("input", bip44Changed);
- DOM.bip44change.on("input", bip44Changed);
- DOM.tab.on("click", tabClicked);
+ DOM.rootKey.on("input", delayedRootKeyChanged);
+ DOM.bip32path.on("input", calcForDerivationPath);
+ DOM.bip44purpose.on("input", calcForDerivationPath);
+ DOM.bip44coin.on("input", calcForDerivationPath);
+ DOM.bip44account.on("input", calcForDerivationPath);
+ DOM.bip44change.on("input", calcForDerivationPath);
+ DOM.tab.on("shown.bs.tab", calcForDerivationPath);
+ DOM.hardenedAddresses.on("change", calcForDerivationPath);
DOM.indexToggle.on("click", toggleIndexes);
DOM.addressToggle.on("click", toggleAddresses);
+ DOM.publicKeyToggle.on("click", togglePublicKeys);
DOM.privateKeyToggle.on("click", togglePrivateKeys);
+ DOM.languages.on("click", languageChanged);
disableForms();
hidePending();
hideValidationError();
+ populateNetworkSelect();
}
// Event handlers
+ function networkChanged(e) {
+ var networkIndex = e.target.value;
+ networks[networkIndex].onSelect();
+ if (seed != null) {
+ phraseChanged();
+ }
+ else {
+ rootKeyChanged();
+ }
+ }
+
+ function setEntropyVisibility() {
+ if (isUsingOwnEntropy()) {
+ DOM.entropyContainer.removeClass("hidden");
+ DOM.generateContainer.addClass("hidden");
+ DOM.phrase.prop("readonly", true);
+ DOM.entropy.focus();
+ entropyChanged();
+ }
+ else {
+ DOM.entropyContainer.addClass("hidden");
+ DOM.generateContainer.removeClass("hidden");
+ DOM.phrase.prop("readonly", false);
+ }
+ }
+
function delayedPhraseChanged() {
hideValidationError();
showPending();
function phraseChanged() {
showPending();
hideValidationError();
+ setMnemonicLanguage();
// Get the mnemonic phrase
var phrase = DOM.phrase.val();
- var passphrase = DOM.passphrase.val();
var errorText = findPhraseErrors(phrase);
if (errorText) {
showValidationError(errorText);
return;
}
- // Get the derivation path
- var errorText = findDerivationPathErrors();
+ // Calculate and display
+ var passphrase = DOM.passphrase.val();
+ calcBip32RootKeyFromSeed(phrase, passphrase);
+ calcForDerivationPath();
+ hidePending();
+ }
+
+ function delayedEntropyChanged() {
+ hideValidationError();
+ showPending();
+ if (entropyChangeTimeoutEvent != null) {
+ clearTimeout(entropyChangeTimeoutEvent);
+ }
+ entropyChangeTimeoutEvent = setTimeout(entropyChanged, 400);
+ }
+
+ function entropyChanged() {
+ setMnemonicFromEntropy();
+ phraseChanged();
+ }
+
+ function delayedRootKeyChanged() {
+ // Warn if there is an existing mnemonic or passphrase.
+ if (DOM.phrase.val().length > 0 || DOM.passphrase.val().length > 0) {
+ if (!confirm("This will clear existing mnemonic and passphrase")) {
+ DOM.rootKey.val(bip32RootKey);
+ return
+ }
+ }
+ hideValidationError();
+ showPending();
+ // Clear existing mnemonic and passphrase
+ DOM.phrase.val("");
+ DOM.passphrase.val("");
+ seed = null;
+ if (rootKeyChangedTimeoutEvent != null) {
+ clearTimeout(rootKeyChangedTimeoutEvent);
+ }
+ rootKeyChangedTimeoutEvent = setTimeout(rootKeyChanged, 400);
+ }
+
+ function rootKeyChanged() {
+ showPending();
+ hideValidationError();
+ // Validate the root key TODO
+ var rootKeyBase58 = DOM.rootKey.val();
+ var errorText = validateRootKey(rootKeyBase58);
if (errorText) {
showValidationError(errorText);
return;
}
// Calculate and display
- calcBip32Seed(phrase, passphrase, derivationPath);
+ calcBip32RootKeyFromBase58(rootKeyBase58);
+ calcForDerivationPath();
+ hidePending();
+ }
+
+ function calcForDerivationPath() {
+ showPending();
+ hideValidationError();
+ // Get the derivation path
+ var derivationPath = getDerivationPath();
+ var errorText = findDerivationPathErrors(derivationPath);
+ if (errorText) {
+ showValidationError(errorText);
+ return;
+ }
+ calcBip32ExtendedKey(derivationPath);
displayBip32Info();
hidePending();
}
function generateClicked() {
+ if (isUsingOwnEntropy()) {
+ return;
+ }
clearDisplay();
showPending();
setTimeout(function() {
+ setMnemonicLanguage();
var phrase = generateRandomPhrase();
if (!phrase) {
return;
}, 50);
}
- function tabClicked(e) {
- var activePath = $(e.target.getAttribute("href") + " .path");
- derivationPath = activePath.val();
- derivationChanged();
- }
-
- function derivationChanged() {
- delayedPhraseChanged();
- }
-
- function bip32Changed() {
- derivationPath = DOM.bip32path.val();
- derivationChanged();
- }
-
- function bip44Changed() {
- setBip44DerivationPath();
- derivationPath = DOM.bip44path.val();
- derivationChanged();
+ function languageChanged() {
+ setTimeout(function() {
+ setMnemonicLanguage();
+ if (DOM.phrase.val().length > 0) {
+ var newPhrase = convertPhraseToNewLanguage();
+ DOM.phrase.val(newPhrase);
+ phraseChanged();
+ }
+ else {
+ DOM.generate.trigger("click");
+ }
+ }, 50);
}
function toggleIndexes() {
+ showIndex = !showIndex;
$("td.index span").toggleClass("invisible");
}
function toggleAddresses() {
+ showAddress = !showAddress;
$("td.address span").toggleClass("invisible");
}
+ function togglePublicKeys() {
+ showPubKey = !showPubKey;
+ $("td.pubkey span").toggleClass("invisible");
+ }
+
function togglePrivateKeys() {
+ showPrivKey = !showPrivKey;
$("td.privkey span").toggleClass("invisible");
}
return;
}
var numWords = parseInt(DOM.strength.val());
- // Check strength is an integer
- if (isNaN(numWords)) {
- DOM.strength.val("12");
- numWords = 12;
- }
- // Check strength is a multiple of 32, if not round it down
- if (numWords % 3 != 0) {
- numWords = Math.floor(numWords / 3) * 3;
- DOM.strength.val(numWords);
- }
- // Check strength is at least 32
- if (numWords == 0) {
- numWords = 3;
- DOM.strength.val(numWords);
- }
var strength = numWords / 3 * 32;
var words = mnemonic.generate(strength);
DOM.phrase.val(words);
return words;
}
- function calcBip32Seed(phrase, passphrase, path) {
- var seed = mnemonic.toSeed(phrase, passphrase);
- bip32RootKey = Bitcoin.HDNode.fromSeedHex(seed, network);
+ function calcBip32RootKeyFromSeed(phrase, passphrase) {
+ seed = mnemonic.toSeed(phrase, passphrase);
+ bip32RootKey = bitcoin.HDNode.fromSeedHex(seed, network);
+ }
+
+ function calcBip32RootKeyFromBase58(rootKeyBase58) {
+ bip32RootKey = bitcoin.HDNode.fromBase58(rootKeyBase58, network);
+ }
+
+ function calcBip32ExtendedKey(path) {
bip32ExtendedKey = bip32RootKey;
// Derive the key from the path
var pathBits = path.split("/");
// TODO make this right
// Preprocess the words
phrase = mnemonic.normalizeString(phrase);
- var parts = phrase.split(" ");
- var proper = [];
- for (var i=0; i<parts.length; i++) {
- var part = parts[i];
- if (part.length > 0) {
- // TODO check that lowercasing is always valid to do
- proper.push(part.toLowerCase());
+ var words = phraseToWordArray(phrase);
+ // Check each word
+ for (var i=0; i<words.length; i++) {
+ var word = words[i];
+ var language = getLanguage();
+ if (WORDLISTS[language].indexOf(word) == -1) {
+ console.log("Finding closest match to " + word);
+ var nearestWord = findNearestWord(word);
+ return word + " not in wordlist, did you mean " + nearestWord + "?";
}
}
- // TODO some levenstein on the words
- var properPhrase = proper.join(' ');
// Check the words are valid
+ var properPhrase = wordArrayToPhrase(words);
var isValid = mnemonic.check(properPhrase);
if (!isValid) {
return "Invalid mnemonic";
return false;
}
+ function validateRootKey(rootKeyBase58) {
+ try {
+ bitcoin.HDNode.fromBase58(rootKeyBase58);
+ }
+ catch (e) {
+ return "Invalid root key";
+ }
+ return "";
+ }
+
+ function getDerivationPath() {
+ if (DOM.bip44tab.hasClass("active")) {
+ var purpose = parseIntNoNaN(DOM.bip44purpose.val(), 44);
+ var coin = parseIntNoNaN(DOM.bip44coin.val(), 0);
+ var account = parseIntNoNaN(DOM.bip44account.val(), 0);
+ var change = parseIntNoNaN(DOM.bip44change.val(), 0);
+ var path = "m/";
+ path += purpose + "'/";
+ path += coin + "'/";
+ path += account + "'/";
+ path += change;
+ DOM.bip44path.val(path);
+ var derivationPath = DOM.bip44path.val();
+ console.log("Using derivation path from BIP44 tab: " + derivationPath);
+ return derivationPath;
+ }
+ else if (DOM.bip32tab.hasClass("active")) {
+ var derivationPath = DOM.bip32path.val();
+ console.log("Using derivation path from BIP32 tab: " + derivationPath);
+ return derivationPath;
+ }
+ else {
+ console.log("Unknown derivation path");
+ }
+ }
+
function findDerivationPathErrors(path) {
- // TODO
+ // TODO is not perfect but is better than nothing
+ // Inspired by
+ // https://github.com/bitcoin/bips/blob/master/bip-0032.mediawiki#test-vectors
+ // and
+ // https://github.com/bitcoin/bips/blob/master/bip-0032.mediawiki#extended-keys
+ var maxDepth = 255; // TODO verify this!!
+ var maxIndexValue = Math.pow(2, 31); // TODO verify this!!
+ if (path[0] != "m") {
+ return "First character must be 'm'";
+ }
+ if (path.length > 1) {
+ if (path[1] != "/") {
+ return "Separator must be '/'";
+ }
+ var indexes = path.split("/");
+ if (indexes.length > maxDepth) {
+ return "Derivation depth is " + indexes.length + ", must be less than " + maxDepth;
+ }
+ for (var depth = 1; depth<indexes.length; depth++) {
+ var index = indexes[depth];
+ var invalidChars = index.replace(/^[0-9]+'?$/g, "")
+ if (invalidChars.length > 0) {
+ return "Invalid characters " + invalidChars + " found at depth " + depth;
+ }
+ var indexValue = parseInt(index.replace("'", ""));
+ if (isNaN(depth)) {
+ return "Invalid number at depth " + depth;
+ }
+ if (indexValue > maxIndexValue) {
+ return "Value of " + indexValue + " at depth " + depth + " must be less than " + maxIndexValue;
+ }
+ }
+ }
return false;
}
function displayBip32Info() {
// Display the key
+ DOM.seed.val(seed);
var rootKey = bip32RootKey.toBase58();
DOM.rootKey.val(rootKey);
var extendedPrivKey = bip32ExtendedKey.toBase58();
function displayAddresses(start, total) {
for (var i=0; i<total; i++) {
- var index = i+ start;
- var key = bip32ExtendedKey.derive(index);
- var address = key.getAddress().toString();
- var privkey = key.privKey.toWIF(network);
- addAddressToList(index, address, privkey);
+ var index = i + start;
+ new TableRow(index);
+ }
+ }
+
+ function TableRow(index) {
+
+ var useHardenedAddresses = DOM.hardenedAddresses.prop("checked");
+
+ function init() {
+ calculateValues();
+ }
+
+ function calculateValues() {
+ setTimeout(function() {
+ var key = "";
+ if (useHardenedAddresses) {
+ key = bip32ExtendedKey.deriveHardened(index);
+ }
+ else {
+ key = bip32ExtendedKey.derive(index);
+ }
+ var address = key.getAddress().toString();
+ var privkey = key.privKey.toWIF(network);
+ var pubkey = key.pubKey.toHex();
+ var indexText = getDerivationPath() + "/" + index;
+ if (useHardenedAddresses) {
+ indexText = indexText + "'";
+ }
+ addAddressToList(indexText, address, pubkey, privkey);
+ }, 50)
}
+
+ init();
+
}
function showMore() {
return;
}
}
- showPending();
- setTimeout(function() {
displayAddresses(start, rowsToAdd);
- hidePending();
- }, 50);
}
function clearDisplay() {
DOM.extendedPubKey.val("");
}
- function addAddressToList(index, address, privkey) {
+ function addAddressToList(indexText, address, pubkey, privkey) {
var row = $(addressRowTemplate.html());
- row.find(".index span").text(index);
- row.find(".address span").text(address);
- row.find(".privkey span").text(privkey);
+ // Elements
+ var indexCell = row.find(".index span");
+ var addressCell = row.find(".address span");
+ var pubkeyCell = row.find(".pubkey span");
+ var privkeyCell = row.find(".privkey span");
+ // Content
+ indexCell.text(indexText);
+ addressCell.text(address);
+ pubkeyCell.text(pubkey);
+ privkeyCell.text(privkey);
+ // Visibility
+ if (!showIndex) {
+ indexCell.addClass("invisible");
+ }
+ if (!showAddress) {
+ addressCell.addClass("invisible");
+ }
+ if (!showPubKey) {
+ pubkeyCell.addClass("invisible");
+ }
+ if (!showPrivKey) {
+ privkeyCell.addClass("invisible");
+ }
DOM.addresses.append(row);
}
});
}
- function setBip44DerivationPath() {
- var purpose = parseIntNoNaN(DOM.bip44purpose.val(), 44);
- var coin = parseIntNoNaN(DOM.bip44coin.val(), 0);
- var account = parseIntNoNaN(DOM.bip44account.val(), 0);
- var change = parseIntNoNaN(DOM.bip44change.val(), 0);
- var path = "m/";
- path += purpose + "'/";
- path += coin + "'/";
- path += account + "'/";
- path += change;
- DOM.bip44path.val(path);
- }
-
function parseIntNoNaN(val, defaultVal) {
var v = parseInt(val);
if (isNaN(v)) {
.show();
}
+ function findNearestWord(word) {
+ var language = getLanguage();
+ var words = WORDLISTS[language];
+ var minDistance = 99;
+ var closestWord = words[0];
+ for (var i=0; i<words.length; i++) {
+ var comparedTo = words[i];
+ var distance = Levenshtein.get(word, comparedTo);
+ if (distance < minDistance) {
+ closestWord = comparedTo;
+ minDistance = distance;
+ }
+ }
+ return closestWord;
+ }
+
function hidePending() {
DOM.feedback
.text("")
.hide();
}
+ function populateNetworkSelect() {
+ for (var i=0; i<networks.length; i++) {
+ var network = networks[i];
+ var option = $("<option>");
+ option.attr("value", i);
+ option.text(network.name);
+ DOM.phraseNetwork.append(option);
+ }
+ }
+
+ function getLanguage() {
+ var defaultLanguage = "english";
+ // Try to get from existing phrase
+ var language = getLanguageFromPhrase();
+ // Try to get from url if not from phrase
+ if (language.length == 0) {
+ language = getLanguageFromUrl();
+ }
+ // Default to English if no other option
+ if (language.length == 0) {
+ language = defaultLanguage;
+ }
+ return language;
+ }
+
+ function getLanguageFromPhrase(phrase) {
+ // Check if how many words from existing phrase match a language.
+ var language = "";
+ if (!phrase) {
+ phrase = DOM.phrase.val();
+ }
+ if (phrase.length > 0) {
+ var words = phraseToWordArray(phrase);
+ var languageMatches = {};
+ for (l in WORDLISTS) {
+ // Track how many words match in this language
+ languageMatches[l] = 0;
+ for (var i=0; i<words.length; i++) {
+ var wordInLanguage = WORDLISTS[l].indexOf(words[i]) > -1;
+ if (wordInLanguage) {
+ languageMatches[l]++;
+ }
+ }
+ // Find languages with most word matches.
+ // This is made difficult due to commonalities between Chinese
+ // simplified vs traditional.
+ var mostMatches = 0;
+ var mostMatchedLanguages = [];
+ for (var l in languageMatches) {
+ var numMatches = languageMatches[l];
+ if (numMatches > mostMatches) {
+ mostMatches = numMatches;
+ mostMatchedLanguages = [l];
+ }
+ else if (numMatches == mostMatches) {
+ mostMatchedLanguages.push(l);
+ }
+ }
+ }
+ if (mostMatchedLanguages.length > 0) {
+ // Use first language and warn if multiple detected
+ language = mostMatchedLanguages[0];
+ if (mostMatchedLanguages.length > 1) {
+ console.warn("Multiple possible languages");
+ console.warn(mostMatchedLanguages);
+ }
+ }
+ }
+ return language;
+ }
+
+ function getLanguageFromUrl() {
+ for (var language in WORDLISTS) {
+ if (window.location.hash.indexOf(language) > -1) {
+ return language;
+ }
+ }
+ return "";
+ }
+
+ function setMnemonicLanguage() {
+ var language = getLanguage();
+ // Load the bip39 mnemonic generator for this language if required
+ if (!(language in mnemonics)) {
+ mnemonics[language] = new Mnemonic(language);
+ }
+ mnemonic = mnemonics[language];
+ }
+
+ function convertPhraseToNewLanguage() {
+ var oldLanguage = getLanguageFromPhrase();
+ var newLanguage = getLanguageFromUrl();
+ var oldPhrase = DOM.phrase.val();
+ var oldWords = phraseToWordArray(oldPhrase);
+ var newWords = [];
+ for (var i=0; i<oldWords.length; i++) {
+ var oldWord = oldWords[i];
+ var index = WORDLISTS[oldLanguage].indexOf(oldWord);
+ var newWord = WORDLISTS[newLanguage][index];
+ newWords.push(newWord);
+ }
+ newPhrase = wordArrayToPhrase(newWords);
+ return newPhrase;
+ }
+
+ // TODO look at jsbip39 - mnemonic.splitWords
+ function phraseToWordArray(phrase) {
+ var words = phrase.split(/\s/g);
+ var noBlanks = [];
+ for (var i=0; i<words.length; i++) {
+ var word = words[i];
+ if (word.length > 0) {
+ noBlanks.push(word);
+ }
+ }
+ return noBlanks;
+ }
+
+ // TODO look at jsbip39 - mnemonic.joinWords
+ function wordArrayToPhrase(words) {
+ var phrase = words.join(" ");
+ var language = getLanguageFromPhrase(phrase);
+ if (language == "japanese") {
+ phrase = words.join("\u3000");
+ }
+ return phrase;
+ }
+
+ function isUsingOwnEntropy() {
+ return DOM.useEntropy.prop("checked");
+ }
+
+ function setMnemonicFromEntropy() {
+ hideEntropyError();
+ // Work out minimum base for entropy
+ var entropyStr = DOM.entropy.val();
+ var entropy = Entropy.fromString(entropyStr);
+ if (entropy.hexStr.length == 0) {
+ return;
+ }
+ // Show entropy details
+ var extraBits = 32 - (entropy.binaryStr.length % 32);
+ var extraChars = Math.ceil(extraBits * Math.log(2) / Math.log(entropy.base.asInt));
+ var strength = "an extremely weak";
+ if (entropy.hexStr.length >= 8) {
+ strength = "a very weak";
+ }
+ if (entropy.hexStr.length >= 12) {
+ strength = "a weak";
+ }
+ if (entropy.hexStr.length >= 24) {
+ strength = "a strong";
+ }
+ if (entropy.hexStr.length >= 32) {
+ strength = "a very strong";
+ }
+ if (entropy.hexStr.length >= 40) {
+ strength = "an extremely strong";
+ }
+ if (entropy.hexStr.length >=48) {
+ strength = "an even stronger"
+ }
+ var msg = "Have " + entropy.binaryStr.length + " bits of entropy, " + extraChars + " more " + entropy.base.str + " chars required to generate " + strength + " mnemonic: " + entropy.cleanStr;
+ showEntropyError(msg);
+ // Discard trailing entropy
+ var hexStr = entropy.hexStr.substring(0, Math.floor(entropy.hexStr.length / 8) * 8);
+ // Convert entropy string to numeric array
+ var entropyArr = [];
+ for (var i=0; i<hexStr.length / 2; i++) {
+ var entropyByte = parseInt(hexStr[i*2].concat(hexStr[i*2+1]), 16);
+ entropyArr.push(entropyByte)
+ }
+ // Convert entropy array to mnemonic
+ var phrase = mnemonic.toMnemonic(entropyArr);
+ // Set the mnemonic in the UI
+ DOM.phrase.val(phrase);
+ }
+
+ function hideEntropyError() {
+ DOM.entropyError.addClass("hidden");
+ }
+
+ function showEntropyError(msg) {
+ DOM.entropyError.text(msg);
+ DOM.entropyError.removeClass("hidden");
+ }
+
+ var networks = [
+ {
+ name: "Bitcoin",
+ onSelect: function() {
+ network = bitcoin.networks.bitcoin;
+ DOM.bip44coin.val(0);
+ },
+ },
+ {
+ name: "Bitcoin Testnet",
+ onSelect: function() {
+ network = bitcoin.networks.testnet;
+ DOM.bip44coin.val(1);
+ },
+ },
+ {
+ name: "Litecoin",
+ onSelect: function() {
+ network = bitcoin.networks.litecoin;
+ DOM.bip44coin.val(2);
+ },
+ },
+ {
+ name: "Dogecoin",
+ onSelect: function() {
+ network = bitcoin.networks.dogecoin;
+ DOM.bip44coin.val(3);
+ },
+ },
+ {
+ name: "ShadowCash",
+ onSelect: function() {
+ network = bitcoin.networks.shadow;
+ DOM.bip44coin.val(35);
+ },
+ },
+ {
+ name: "ShadowCash Testnet",
+ onSelect: function() {
+ network = bitcoin.networks.shadowtn;
+ DOM.bip44coin.val(1);
+ },
+ },
+ {
+ name: "Viacoin",
+ onSelect: function() {
+ network = bitcoin.networks.viacoin;
+ DOM.bip44coin.val(14);
+ },
+ },
+ {
+ name: "Viacoin Testnet",
+ onSelect: function() {
+ network = bitcoin.networks.viacointestnet;
+ DOM.bip44coin.val(1);
+ },
+ },
+ {
+ name: "Jumbucks",
+ onSelect: function() {
+ network = bitcoin.networks.jumbucks;
+ DOM.bip44coin.val(26);
+ },
+ },
+ {
+ name: "CLAM",
+ onSelect: function() {
+ network = bitcoin.networks.clam;
+ DOM.bip44coin.val(23);
+ },
+ },
+ {
+ name: "DASH",
+ onSelect: function() {
+ network = bitcoin.networks.dash;
+ DOM.bip44coin.val(5);
+ },
+ },
+ {
+ name: "Namecoin",
+ onSelect: function() {
+ network = bitcoin.networks.namecoin;
+ DOM.bip44coin.val(7);
+ },
+ },
+ {
+ name: "Peercoin",
+ onSelect: function() {
+ network = bitcoin.networks.peercoin;
+ DOM.bip44coin.val(6);
+ },
+ },
+ ]
+
init();
})();
projects / perso / Immae / Projets / Cryptomonnaies / BIP39.git / blobdiff