-
Notifications
You must be signed in to change notification settings - Fork 0
/
bitcoinjs.min.js
4661 lines (4661 loc) · 283 KB
/
bitcoinjs.min.js
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
(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(){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}return e})()({1:[function(require,module,exports){let bitcoin=require('bitcoinjs-lib')
function KeyPair(){var keyPair=bitcoin.ECPair.makeRandom();var pubKey=keyPair.getAddress();var privKey=keyPair.toWIF();return{pubKey,privKey}}
module.exports={KeyPair}},{"bitcoinjs-lib":54}],2:[function(require,module,exports){var Buffer=require('safe-buffer').Buffer
module.exports=function base(ALPHABET){var ALPHABET_MAP={}
var BASE=ALPHABET.length
var LEADER=ALPHABET.charAt(0)
for(var z=0;z<ALPHABET.length;z++){var x=ALPHABET.charAt(z)
if(ALPHABET_MAP[x]!==undefined)throw new TypeError(x+' is ambiguous')
ALPHABET_MAP[x]=z}
function encode(source){if(source.length===0)return''
var digits=[0]
for(var i=0;i<source.length;++i){for(var j=0,carry=source[i];j<digits.length;++j){carry+=digits[j]<<8
digits[j]=carry%BASE
carry=(carry/BASE)|0}
while(carry>0){digits.push(carry%BASE)
carry=(carry/BASE)|0}}
var string=''
for(var k=0;source[k]===0&&k<source.length-1;++k)string+=LEADER
for(var q=digits.length-1;q>=0;--q)string+=ALPHABET[digits[q]]
return string}
function decodeUnsafe(string){if(typeof string!=='string')throw new TypeError('Expected String')
if(string.length===0)return Buffer.allocUnsafe(0)
var bytes=[0]
for(var i=0;i<string.length;i++){var value=ALPHABET_MAP[string[i]]
if(value===undefined)return
for(var j=0,carry=value;j<bytes.length;++j){carry+=bytes[j]*BASE
bytes[j]=carry&0xff
carry>>=8}
while(carry>0){bytes.push(carry&0xff)
carry>>=8}}
for(var k=0;string[k]===LEADER&&k<string.length-1;++k){bytes.push(0)}
return Buffer.from(bytes.reverse())}
function decode(string){var buffer=decodeUnsafe(string)
if(buffer)return buffer
throw new Error('Non-base'+BASE+' character')}
return{encode:encode,decodeUnsafe:decodeUnsafe,decode:decode}}},{"safe-buffer":31}],3:[function(require,module,exports){'use strict'
var ALPHABET='qpzry9x8gf2tvdw0s3jn54khce6mua7l'
var ALPHABET_MAP={}
for(var z=0;z<ALPHABET.length;z++){var x=ALPHABET.charAt(z)
if(ALPHABET_MAP[x]!==undefined)throw new TypeError(x+' is ambiguous')
ALPHABET_MAP[x]=z}
function polymodStep(pre){var b=pre>>25
return((pre&0x1FFFFFF)<<5)^(-((b>>0)&1)&0x3b6a57b2)^(-((b>>1)&1)&0x26508e6d)^(-((b>>2)&1)&0x1ea119fa)^(-((b>>3)&1)&0x3d4233dd)^(-((b>>4)&1)&0x2a1462b3)}
function prefixChk(prefix){var chk=1
for(var i=0;i<prefix.length;++i){var c=prefix.charCodeAt(i)
if(c<33||c>126)throw new Error('Invalid prefix ('+prefix+')')
chk=polymodStep(chk)^(c>>5)}
chk=polymodStep(chk)
for(i=0;i<prefix.length;++i){var v=prefix.charCodeAt(i)
chk=polymodStep(chk)^(v&0x1f)}
return chk}
function encode(prefix,words,LIMIT){LIMIT=LIMIT||90
if((prefix.length+7+words.length)>LIMIT)throw new TypeError('Exceeds length limit')
prefix=prefix.toLowerCase()
var chk=prefixChk(prefix)
var result=prefix+'1'
for(var i=0;i<words.length;++i){var x=words[i]
if((x>>5)!==0)throw new Error('Non 5-bit word')
chk=polymodStep(chk)^x
result+=ALPHABET.charAt(x)}
for(i=0;i<6;++i){chk=polymodStep(chk)}
chk^=1
for(i=0;i<6;++i){var v=(chk>>((5-i)*5))&0x1f
result+=ALPHABET.charAt(v)}
return result}
function decode(str,LIMIT){LIMIT=LIMIT||90
if(str.length<8)throw new TypeError(str+' too short')
if(str.length>LIMIT)throw new TypeError('Exceeds length limit')
var lowered=str.toLowerCase()
var uppered=str.toUpperCase()
if(str!==lowered&&str!==uppered)throw new Error('Mixed-case string '+str)
str=lowered
var split=str.lastIndexOf('1')
if(split===-1)throw new Error('No separator character for '+str)
if(split===0)throw new Error('Missing prefix for '+str)
var prefix=str.slice(0,split)
var wordChars=str.slice(split+1)
if(wordChars.length<6)throw new Error('Data too short')
var chk=prefixChk(prefix)
var words=[]
for(var i=0;i<wordChars.length;++i){var c=wordChars.charAt(i)
var v=ALPHABET_MAP[c]
if(v===undefined)throw new Error('Unknown character '+c)
chk=polymodStep(chk)^v
if(i+6>=wordChars.length)continue
words.push(v)}
if(chk!==1)throw new Error('Invalid checksum for '+str)
return{prefix:prefix,words:words}}
function convert(data,inBits,outBits,pad){var value=0
var bits=0
var maxV=(1<<outBits)-1
var result=[]
for(var i=0;i<data.length;++i){value=(value<<inBits)|data[i]
bits+=inBits
while(bits>=outBits){bits-=outBits
result.push((value>>bits)&maxV)}}
if(pad){if(bits>0){result.push((value<<(outBits-bits))&maxV)}}else{if(bits>=inBits)throw new Error('Excess padding')
if((value<<(outBits-bits))&maxV)throw new Error('Non-zero padding')}
return result}
function toWords(bytes){return convert(bytes,8,5,true)}
function fromWords(words){return convert(words,5,8,false)}
module.exports={decode:decode,encode:encode,toWords:toWords,fromWords:fromWords}},{}],4:[function(require,module,exports){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)}}
var proto=BigInteger.prototype
proto.__bigi=require('../package.json').version
BigInteger.isBigInteger=function(obj,check_ver){return obj&&obj.__bigi&&(!check_ver||obj.__bigi===proto.__bigi)}
var dbits
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}
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 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}
BigInteger.prototype.am=am1
dbits=26
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_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}
function bnpCopyTo(r){for(var i=this.t-1;i>=0;--i)r[i]=this[i]
r.t=this.t
r.s=this.s}
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}
function nbv(i){var r=new BigInteger()
r.fromInt(i)
return r}
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;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))}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}
self.clamp()
if(mi)BigInteger.ZERO.subTo(self,self)}
function bnpClamp(){var c=this.s&this.DM
while(this.t>0&&this[this.t-1]==c)--this.t}
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}}
if(d>0)m=true
if(m)r+=int2char(d)}}
return m?r:"0"}
function bnNegate(){var r=new BigInteger()
BigInteger.ZERO.subTo(this,r)
return r}
function bnAbs(){return(this.s<0)?this.negate():this}
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}
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}
function bnBitLength(){if(this.t<=0)return 0
return this.DB*(this.t-1)+nbits(this[this.t-1]^(this.s&this.DM))}
function bnByteLength(){return this.bitLength()>>3}
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 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 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 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 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-=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()}
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 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}}
if(r.t>0)r[r.t-1]+=x.am(i,x[i],r,2*i,0,1)
r.s=0
r.clamp()}
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=new BigInteger()
var y=new BigInteger(),ts=self.s,ms=m.s
var nsh=self.DB-nbits(pm[pm.t-1]);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);while(y.t<ys)y[y.t++]=0
while(--j>=0){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){y.dlShiftTo(j,t)
r.subTo(t,r)
while(r[i]<--qd)r.subTo(t,r)}}
if(q!=null){r.drShiftTo(ys,q)
if(ts!=ms)BigInteger.ZERO.subTo(q,q)}
r.t=ys
r.clamp()
if(nsh>0)r.rShiftTo(nsh,r);if(ts<0)BigInteger.ZERO.subTo(r,r)}
function bnMod(a){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}
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}
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
function bnpInvDigit(){if(this.t<1)return 0
var x=this[0]
if((x&1)==0)return 0
var y=x&3;y=(y*(2-(x&0xf)*y))&0xf;y=(y*(2-(x&0xff)*y))&0xff;y=(y*(2-(((x&0xffff)*y)&0xffff)))&0xffff;y=(y*(2-x*y%this.DV))%this.DV;return(y>0)?this.DV-y:-y}
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}
function montConvert(x){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}
function montRevert(x){var r=new BigInteger()
x.copyTo(r)
this.reduce(r)
return r}
function montReduce(x){while(x.t<=this.mt2)
x[x.t++]=0
for(var i=0;i<this.m.t;++i){var j=x[i]&0x7fff
var u0=(j*this.mpl+(((j*this.mph+(x[i]>>15)*this.mpl)&this.um)<<15))&x.DM
j=i+this.m.t
x[j]+=this.m.am(0,u0,x,i,0,this.m.t)
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)}
function montSqrTo(x,r){x.squareTo(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
function bnpIsEven(){return((this.t>0)?(this[0]&1):this.s)==0}
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)}
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)}
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.toString=bnToString
proto.negate=bnNegate
proto.abs=bnAbs
proto.compareTo=bnCompareTo
proto.bitLength=bnBitLength
proto.byteLength=bnByteLength
proto.mod=bnMod
proto.modPowInt=bnModPowInt
function bnClone(){var r=new BigInteger()
this.copyTo(r)
return r}
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
return((this[1]&((1<<(32-this.DB))-1))<<this.DB)|this[0]}
function bnByteValue(){return(this.t==0)?this.s:(this[0]<<24)>>24}
function bnShortValue(){return(this.t==0)?this.s:(this[0]<<16)>>16}
function bnpChunkSize(r){return Math.floor(Math.LN2*this.DB/Math.log(r))}
function bnSigNum(){if(this.s<0)return-1
else if(this.t<=0||(this.t==1&&this[0]<=0))return 0
else return 1}
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=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}
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}}
if(j>0){self.dMultiply(Math.pow(b,j))
self.dAddOffset(w,0)}
if(mi)BigInteger.ZERO.subTo(self,self)}
function bnpFromNumber(a,b,c){var self=this
if("number"==typeof b){if(a<2)self.fromInt(1)
else{self.fromNumber(a,c)
if(!self.testBit(a-1))
self.bitwiseTo(BigInteger.ONE.shiftLeft(a-1),op_or,self)
if(self.isEven())self.dAddOffset(1,0);while(!self.isProbablePrime(b)){self.dAddOffset(2,0)
if(self.bitLength()>a)self.subTo(BigInteger.ONE.shiftLeft(a-1),self)}}}else{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)}}
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}}
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}
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 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()}
function op_and(x,y){return x&y}
function bnAnd(a){var r=new BigInteger()
this.bitwiseTo(a,op_and,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}
function op_xor(x,y){return x^y}
function bnXor(a){var r=new BigInteger()
this.bitwiseTo(a,op_xor,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}
function bnNot(){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}
function bnShiftLeft(n){var r=new BigInteger()
if(n<0)this.rShiftTo(-n,r)
else this.lShiftTo(n,r)
return r}
function bnShiftRight(n){var r=new BigInteger()
if(n<0)this.lShiftTo(-n,r)
else this.rShiftTo(n,r)
return r}
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}
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}
function cbit(x){var r=0
while(x!=0){x&=x-1
++r}
return r}
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}
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)}
function bnpChangeBit(n,op){var r=BigInteger.ONE.shiftLeft(n)
this.bitwiseTo(r,op,r)
return r}
function bnSetBit(n){return this.changeBit(n,op_or)}
function bnClearBit(n){return this.changeBit(n,op_andnot)}
function bnFlipBit(n){return this.changeBit(n,op_xor)}
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}
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}
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()}
function bnAdd(a){var r=new BigInteger()
this.addTo(a,r)
return r}
function bnSubtract(a){var r=new BigInteger()
this.subTo(a,r)
return r}
function bnMultiply(a){var r=new BigInteger()
this.multiplyTo(a,r)
return r}
function bnSquare(){var r=new BigInteger()
this.squareTo(r)
return r}
function bnDivide(a){var r=new BigInteger()
this.divRemTo(a,r,null)
return r}
function bnRemainder(a){var r=new BigInteger()
this.divRemTo(a,null,r)
return r}
function bnDivideAndRemainder(a){var q=new BigInteger(),r=new BigInteger()
this.divRemTo(a,q,r)
return new Array(q,r)}
function bnpDMultiply(n){this[this.t]=this.am(0,n-1,this,0,0,this.t)
++this.t
this.clamp()}
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 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 bnPow(e){return this.exp(e,new NullExp())}
function bnpMultiplyLowerTo(a,n,r){var i=Math.min(this.t+a.t,n)
r.s=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()}
function bnpMultiplyUpperTo(a,n,r){--n
var i=r.t=this.t+a.t-n
r.s=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)}
function Barrett(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=new BigInteger()
x.copyTo(r)
this.reduce(r)
return r}}
function barrettRevert(x){return x}
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)}
function barrettSqrTo(x,r){x.squareTo(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
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)
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)}
n=k
while((w&1)==0){w>>=1
--n}
if((i-=n)<0){i+=this.DB
--j}
if(is1){g[w].copyTo(r)
is1=false}else{while(n>1){z.sqrTo(r,r2)
z.sqrTo(r2,r)
n-=2}
if(n>0)z.sqrTo(r,r2)
else{t=r
r=r2
r2=t}
z.mulTo(r2,g[w],r)}
while(j>=0&&(e[j]&(1<<i))==0){z.sqrTo(r,r2)
t=r
r=r2
r2=t
if(--i<0){i=this.DB-1
--j}}}
return z.revert(r)}
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)}}
if(g>0)y.lShiftTo(g,y)
return y}
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}
function bnModInverse(m){var ac=m.isEven()
if(this.signum()===0)throw new Error('division by zero')
if((this.isEven()&&ac)||m.signum()==0)return BigInteger.ZERO
var u=m.clone(),v=this.clone()
var a=nbv(1),b=nbv(0),c=nbv(0),d=nbv(1)
while(u.signum()!=0){while(u.isEven()){u.rShiftTo(1,u)
if(ac){if(!a.isEven()||!b.isEven()){a.addTo(this,a)
b.subTo(m,b)}
a.rShiftTo(1,a)}else if(!b.isEven())b.subTo(m,b)
b.rShiftTo(1,b)}
while(v.isEven()){v.rShiftTo(1,v)
if(ac){if(!c.isEven()||!d.isEven()){c.addTo(this,c)
d.subTo(m,d)}
c.rShiftTo(1,c)}else if(!d.isEven())d.subTo(m,d)
d.rShiftTo(1,d)}
if(u.compareTo(v)>=0){u.subTo(v,u)
if(ac)a.subTo(c,a)
b.subTo(d,b)}else{v.subTo(u,v)
if(ac)c.subTo(a,c)
d.subTo(b,d)}}
if(v.compareTo(BigInteger.ONE)!=0)return BigInteger.ZERO
while(d.compareTo(m)>=0)d.subTo(m,d)
while(d.signum()<0)d.addTo(m,d)
return d}
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]
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)}
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}}
return true}
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
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
proto.square=bnSquare
BigInteger.ZERO=nbv(0)
BigInteger.ONE=nbv(1)
BigInteger.valueOf=nbv
module.exports=BigInteger},{"../package.json":7}],5:[function(require,module,exports){(function(Buffer){var assert=require('assert')
var BigInteger=require('./bigi')
BigInteger.fromByteArrayUnsigned=function(byteArray){if(byteArray[0]&0x80){return new BigInteger([0].concat(byteArray))}
return new BigInteger(byteArray)}
BigInteger.prototype.toByteArrayUnsigned=function(){var byteArray=this.toByteArray()
return byteArray[0]===0?byteArray.slice(1):byteArray}
BigInteger.fromDERInteger=function(byteArray){return new BigInteger(byteArray)}
BigInteger.prototype.toDERInteger=BigInteger.prototype.toByteArray
BigInteger.fromBuffer=function(buffer){if(buffer[0]&0x80){var byteArray=Array.prototype.slice.call(buffer)
return new BigInteger([0].concat(byteArray))}
return new BigInteger(buffer)}
BigInteger.fromHex=function(hex){if(hex==='')return BigInteger.ZERO
assert.equal(hex,hex.match(/^[A-Fa-f0-9]+/),'Invalid hex string')
assert.equal(hex.length%2,0,'Incomplete hex')
return new BigInteger(hex,16)}
BigInteger.prototype.toBuffer=function(size){var byteArray=this.toByteArrayUnsigned()
var zeros=[]
var padding=size-byteArray.length
while(zeros.length<padding)zeros.push(0)
return new Buffer(zeros.concat(byteArray))}
BigInteger.prototype.toHex=function(size){return this.toBuffer(size).toString('hex')}}).call(this,require("buffer").Buffer)},{"./bigi":4,"assert":83,"buffer":86}],6:[function(require,module,exports){var BigInteger=require('./bigi')
require('./convert')
module.exports=BigInteger},{"./bigi":4,"./convert":5}],7:[function(require,module,exports){module.exports={"_from":"bigi@^1.4.0","_id":"bigi@1.4.2","_inBundle":false,"_integrity":"sha1-nGZalfiLiwj8Bc/XMfVhhZ1yWCU=","_location":"/bitcoinjs-lib/bigi","_phantomChildren":{},"_requested":{"type":"range","registry":true,"raw":"bigi@^1.4.0","name":"bigi","escapedName":"bigi","rawSpec":"^1.4.0","saveSpec":null,"fetchSpec":"^1.4.0"},"_requiredBy":["/bitcoinjs-lib","/bitcoinjs-lib/ecurve"],"_resolved":"https://registry.npmjs.org/bigi/-/bigi-1.4.2.tgz","_shasum":"9c665a95f88b8b08fc05cfd731f561859d725825","_spec":"bigi@^1.4.0","_where":"C:\\Users\\Dog\\Desktop\\node-v9.6.1-win-x64\\node_modules\\bitcoinjs-lib","bugs":{"url":"https://github.com/cryptocoinjs/bigi/issues"},"bundleDependencies":false,"dependencies":{},"deprecated":false,"description":"Big integers.","devDependencies":{"coveralls":"^2.11.2","istanbul":"^0.3.5","jshint":"^2.5.1","mocha":"^2.1.0","mochify":"^2.1.0"},"homepage":"https://github.com/cryptocoinjs/bigi#readme","keywords":["cryptography","math","bitcoin","arbitrary","precision","arithmetic","big","integer","int","number","biginteger","bigint","bignumber","decimal","float"],"main":"./lib/index.js","name":"bigi","repository":{"url":"git+https://github.com/cryptocoinjs/bigi.git","type":"git"},"scripts":{"browser-test":"mochify --wd -R spec","coverage":"istanbul cover ./node_modules/.bin/_mocha -- --reporter list test/*.js","coveralls":"npm run-script coverage && node ./node_modules/.bin/coveralls < coverage/lcov.info","jshint":"jshint --config jshint.json lib/*.js ; true","test":"_mocha -- test/*.js","unit":"mocha"},"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"]},"version":"1.4.2"}},{}],8:[function(require,module,exports){var Buffer=require('safe-buffer').Buffer
function check(buffer){if(buffer.length<8)return false
if(buffer.length>72)return false
if(buffer[0]!==0x30)return false
if(buffer[1]!==buffer.length-2)return false
if(buffer[2]!==0x02)return false
var lenR=buffer[3]
if(lenR===0)return false
if(5+lenR>=buffer.length)return false
if(buffer[4+lenR]!==0x02)return false
var lenS=buffer[5+lenR]
if(lenS===0)return false
if((6+lenR+lenS)!==buffer.length)return false
if(buffer[4]&0x80)return false
if(lenR>1&&(buffer[4]===0x00)&&!(buffer[5]&0x80))return false
if(buffer[lenR+6]&0x80)return false
if(lenS>1&&(buffer[lenR+6]===0x00)&&!(buffer[lenR+7]&0x80))return false
return true}
function decode(buffer){if(buffer.length<8)throw new Error('DER sequence length is too short')
if(buffer.length>72)throw new Error('DER sequence length is too long')
if(buffer[0]!==0x30)throw new Error('Expected DER sequence')
if(buffer[1]!==buffer.length-2)throw new Error('DER sequence length is invalid')
if(buffer[2]!==0x02)throw new Error('Expected DER integer')
var lenR=buffer[3]
if(lenR===0)throw new Error('R length is zero')
if(5+lenR>=buffer.length)throw new Error('R length is too long')
if(buffer[4+lenR]!==0x02)throw new Error('Expected DER integer (2)')
var lenS=buffer[5+lenR]
if(lenS===0)throw new Error('S length is zero')
if((6+lenR+lenS)!==buffer.length)throw new Error('S length is invalid')
if(buffer[4]&0x80)throw new Error('R value is negative')
if(lenR>1&&(buffer[4]===0x00)&&!(buffer[5]&0x80))throw new Error('R value excessively padded')
if(buffer[lenR+6]&0x80)throw new Error('S value is negative')
if(lenS>1&&(buffer[lenR+6]===0x00)&&!(buffer[lenR+7]&0x80))throw new Error('S value excessively padded')
return{r:buffer.slice(4,4+lenR),s:buffer.slice(6+lenR)}}
function encode(r,s){var lenR=r.length
var lenS=s.length
if(lenR===0)throw new Error('R length is zero')
if(lenS===0)throw new Error('S length is zero')
if(lenR>33)throw new Error('R length is too long')
if(lenS>33)throw new Error('S length is too long')
if(r[0]&0x80)throw new Error('R value is negative')
if(s[0]&0x80)throw new Error('S value is negative')
if(lenR>1&&(r[0]===0x00)&&!(r[1]&0x80))throw new Error('R value excessively padded')
if(lenS>1&&(s[0]===0x00)&&!(s[1]&0x80))throw new Error('S value excessively padded')
var signature=Buffer.allocUnsafe(6+lenR+lenS)
signature[0]=0x30
signature[1]=signature.length-2
signature[2]=0x02
signature[3]=r.length
r.copy(signature,4)
signature[4+lenR]=0x02
signature[5+lenR]=s.length
s.copy(signature,6+lenR)
return signature}
module.exports={check:check,decode:decode,encode:encode}},{"safe-buffer":31}],9:[function(require,module,exports){module.exports={"OP_FALSE":0,"OP_0":0,"OP_PUSHDATA1":76,"OP_PUSHDATA2":77,"OP_PUSHDATA4":78,"OP_1NEGATE":79,"OP_RESERVED":80,"OP_TRUE":81,"OP_1":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,"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,"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,"OP_CAT":126,"OP_SUBSTR":127,"OP_LEFT":128,"OP_RIGHT":129,"OP_SIZE":130,"OP_INVERT":131,"OP_AND":132,"OP_OR":133,"OP_XOR":134,"OP_EQUAL":135,"OP_EQUALVERIFY":136,"OP_RESERVED1":137,"OP_RESERVED2":138,"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,"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,"OP_NOP1":176,"OP_NOP2":177,"OP_CHECKLOCKTIMEVERIFY":177,"OP_NOP3":178,"OP_CHECKSEQUENCEVERIFY":178,"OP_NOP4":179,"OP_NOP5":180,"OP_NOP6":181,"OP_NOP7":182,"OP_NOP8":183,"OP_NOP9":184,"OP_NOP10":185,"OP_PUBKEYHASH":253,"OP_PUBKEY":254,"OP_INVALIDOPCODE":255}},{}],10:[function(require,module,exports){var OPS=require('./index.json')
var map={}
for(var op in OPS){var code=OPS[op]
map[code]=op}
module.exports=map},{"./index.json":9}],11:[function(require,module,exports){var basex=require('base-x')
var ALPHABET='123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz'
module.exports=basex(ALPHABET)},{"base-x":2}],12:[function(require,module,exports){'use strict'
var base58=require('bs58')
var Buffer=require('safe-buffer').Buffer
module.exports=function(checksumFn){function encode(payload){var checksum=checksumFn(payload)
return base58.encode(Buffer.concat([payload,checksum],payload.length+4))}
function decodeRaw(buffer){var payload=buffer.slice(0,-4)
var checksum=buffer.slice(-4)
var newChecksum=checksumFn(payload)
if(checksum[0]^newChecksum[0]|checksum[1]^newChecksum[1]|checksum[2]^newChecksum[2]|checksum[3]^newChecksum[3])return
return payload}
function decodeUnsafe(string){var buffer=base58.decodeUnsafe(string)
if(!buffer)return
return decodeRaw(buffer)}
function decode(string){var buffer=base58.decode(string)
var payload=decodeRaw(buffer,checksumFn)
if(!payload)throw new Error('Invalid checksum')
return payload}
return{encode:encode,decode:decode,decodeUnsafe:decodeUnsafe}}},{"bs58":11,"safe-buffer":31}],13:[function(require,module,exports){'use strict'
var createHash=require('create-hash')
var bs58checkBase=require('./base')
function sha256x2(buffer){var tmp=createHash('sha256').update(buffer).digest()
return createHash('sha256').update(tmp).digest()}
module.exports=bs58checkBase(sha256x2)},{"./base":12,"create-hash":15}],14:[function(require,module,exports){var Buffer=require('safe-buffer').Buffer
var Transform=require('stream').Transform
var StringDecoder=require('string_decoder').StringDecoder
var inherits=require('inherits')
function CipherBase(hashMode){Transform.call(this)
this.hashMode=typeof hashMode==='string'
if(this.hashMode){this[hashMode]=this._finalOrDigest}else{this.final=this._finalOrDigest}
if(this._final){this.__final=this._final
this._final=null}
this._decoder=null
this._encoding=null}
inherits(CipherBase,Transform)
CipherBase.prototype.update=function(data,inputEnc,outputEnc){if(typeof data==='string'){data=Buffer.from(data,inputEnc)}
var outData=this._update(data)
if(this.hashMode)return this
if(outputEnc){outData=this._toString(outData,outputEnc)}
return outData}
CipherBase.prototype.setAutoPadding=function(){}
CipherBase.prototype.getAuthTag=function(){throw new Error('trying to get auth tag in unsupported state')}
CipherBase.prototype.setAuthTag=function(){throw new Error('trying to set auth tag in unsupported state')}
CipherBase.prototype.setAAD=function(){throw new Error('trying to set aad in unsupported state')}
CipherBase.prototype._transform=function(data,_,next){var err
try{if(this.hashMode){this._update(data)}else{this.push(this._update(data))}}catch(e){err=e}finally{next(err)}}
CipherBase.prototype._flush=function(done){var err
try{this.push(this.__final())}catch(e){err=e}
done(err)}
CipherBase.prototype._finalOrDigest=function(outputEnc){var outData=this.__final()||Buffer.alloc(0)
if(outputEnc){outData=this._toString(outData,outputEnc,true)}
return outData}
CipherBase.prototype._toString=function(value,enc,fin){if(!this._decoder){this._decoder=new StringDecoder(enc)
this._encoding=enc}
if(this._encoding!==enc)throw new Error('can\'t switch encodings')
var out=this._decoder.write(value)
if(fin){out+=this._decoder.end()}
return out}
module.exports=CipherBase},{"inherits":26,"safe-buffer":31,"stream":109,"string_decoder":110}],15:[function(require,module,exports){(function(Buffer){'use strict'
var inherits=require('inherits')
var md5=require('./md5')
var RIPEMD160=require('ripemd160')
var sha=require('sha.js')
var Base=require('cipher-base')
function HashNoConstructor(hash){Base.call(this,'digest')
this._hash=hash
this.buffers=[]}
inherits(HashNoConstructor,Base)
HashNoConstructor.prototype._update=function(data){this.buffers.push(data)}