12 | 13 | 14 | 44 | -------------------------------------------------------------------------------- /lib/cw_address_key_generator/README.md: -------------------------------------------------------------------------------- 1 | # cw_address_key_generator 2 | 3 | A tool to allow you to check/retrieve/generate your counterwallet bitcoin addresses/keys using your counterwallet 12 word passphrase. And to also sign messages with your private keys 4 | 5 | --- 6 | 7 | Copyright (c) 2015 mtbitcoin (blockscan.com) 8 | 9 | Permission is hereby granted, free of charge, to any person obtaining a copy 10 | of this software and associated documentation files (the "Software"), to deal 11 | in the Software without restriction, including without limitation the rights 12 | to use, copy, modify, merge, publish, distribute, sublicense, and/or sell 13 | copies of the Software, and to permit persons to whom the Software is 14 | furnished to do so, subject to the following conditions: 15 | 16 | The above copyright notice and this permission notice shall be included in 17 | all copies or substantial portions of the Software. 18 | 19 | THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR 20 | IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, 21 | FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE 22 | AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER 23 | LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, 24 | OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN 25 | THE SOFTWARE. 26 | -------------------------------------------------------------------------------- /lib/mnemonic/chrome/mnemonic.html: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 |
Mnemonic passphrase generator 15 | from Crypho AS 16 |
17 |
18 |
19 |
27 |
28 |
29 |
30 |
31 |
33 |
34 |
35 |
36 |
37 |
38 |
39 |
--------------------------------------------------------------------------------
/lib/seedrandom/package.json:
--------------------------------------------------------------------------------
1 | {
2 | "name": "seedrandom",
3 | "version": "2.4.2",
4 | "description": "Seeded random number generator for Javascript.",
5 | "main": "index.js",
6 | "keywords": [
7 | "random",
8 | "seed",
9 | "crypto"
10 | ],
11 | "scripts": {
12 | "test": "grunt travis"
13 | },
14 | "repository": {
15 | "type": "git",
16 | "url": "git://github.com/davidbau/seedrandom.git"
17 | },
18 | "author": "David Bau",
19 | "license": "MIT",
20 | "bugs": {
21 | "url": "https://github.com/davidbau/seedrandom/issues"
22 | },
23 | "homepage": "http://davidbau.com/archives/2010/01/30/random_seeds_coded_hints_and_quintillions.html",
24 | "config": {
25 | "blanket": {
26 | "pattern": [
27 | "seedrandom.js",
28 | "lib/alea.js",
29 | "lib/xor128.js",
30 | "lib/xorwow.js",
31 | "lib/xorshift7.js",
32 | "lib/tychei.js",
33 | "lib/xor4096.js"
34 | ]
35 | }
36 | },
37 | "devDependencies": {
38 | "blanket": "latest",
39 | "grunt": "latest",
40 | "grunt-bowercopy": "latest",
41 | "grunt-cli": "latest",
42 | "grunt-contrib-qunit": "<=0.5.2",
43 | "grunt-contrib-uglify": "latest",
44 | "grunt-mocha-cov": "latest",
45 | "grunt-release": "latest",
46 | "grunt-sed": "latest",
47 | "phantomjs": "latest",
48 | "proxyquire": "latest",
49 | "requirejs": "latest"
50 | }
51 | }
52 |
--------------------------------------------------------------------------------
/lib/seedrandom/test/state.html:
--------------------------------------------------------------------------------
1 |
2 |
3 |
4 |
5 |
6 |
7 |
8 |
9 |
10 |
54 |
55 |
56 |
--------------------------------------------------------------------------------
/lib/seedrandom/test/bitgen.js:
--------------------------------------------------------------------------------
1 | #!/usr/bin/env node
2 | var seedrandom = require('../seedrandom');
3 |
4 | // process.on('SIGPIPE', process.exit);
5 | function epipeBomb(stream, callback) {
6 | if (stream == null) stream = process.stdout;
7 | if (callback == null) callback = process.exit;
8 |
9 | function epipeFilter(err) {
10 | if (err.code === 'EPIPE') return callback();
11 |
12 | // If there's more than one error handler (ie, us),
13 | // then the error won't be bubbled up anyway
14 | if (stream.listeners('error').length <= 1) {
15 | stream.removeAllListeners(); // Pretend we were never here
16 | stream.emit('error', err); // Then emit as if we were never here
17 | stream.on('error', epipeFilter);// Reattach, ready for the next error!
18 | }
19 | }
20 |
21 | stream.on('error', epipeFilter);
22 | }
23 |
24 | epipeBomb();
25 |
26 | var bufsize = 1024 * 256,
27 | buf = new Buffer(bufsize * 4),
28 | prng = seedrandom(0),
29 | count = parseInt(process.argv[2]) || Infinity;
30 | function dowrite() {
31 | while (count > 0) {
32 | for (var j = 0; j < bufsize; ++j) {
33 | buf.writeUInt32BE(Math.floor(
34 | prng() * 256 * 256 * 256 * 256
35 | ), j * 4);
36 | }
37 | count -= bufsize * 32;
38 | if (!process.stdout.write(buf)) {
39 | process.stdout.once('drain', function() { setTimeout(dowrite, 0) });
40 | return;
41 | }
42 | }
43 | }
44 |
45 | dowrite();
46 |
--------------------------------------------------------------------------------
/lib/bitcore/LICENSE:
--------------------------------------------------------------------------------
1 | Copyright (c) 2013-2015 BitPay, Inc.
2 |
3 | Parts of this software are based on fullnode
4 | Copyright (c) 2014 Ryan X. Charles
5 | Copyright (c) 2014 reddit, Inc.
6 |
7 | Parts of this software are based on BitcoinJS
8 | Copyright (c) 2011 Stefan Thomas Extract XCP Asset Send Transaction Data (multi-sig encoded only)
41 |Tx Hash
42 |
43 |
44 |
45 |
46 |
47 |
48 |
49 |
50 | >>24]<<24|j[d>>>16&255]<<16|j[d>>>8&255]<<8|j[d&255]):(d=d<<8|d>>>24,d=j[d>>>24]<<24|j[d>>>16&255]<<16|j[d>>>8&255]<<8|j[d&255],d^=F[h/a|0]<<24);b[h]=b[h-a]^d}e=this._invKeySchedule=[];for(a=0;aa||4>=h?d:s[j[d>>>24]]^u[j[d>>>16&255]]^v[j[d>>>
9 | 8&255]]^w[j[d&255]]},encryptBlock:function(c,e){this._doCryptBlock(c,e,this._keySchedule,z,A,B,C,j)},decryptBlock:function(c,e){var a=c[e+1];c[e+1]=c[e+3];c[e+3]=a;this._doCryptBlock(c,e,this._invKeySchedule,s,u,v,w,y);a=c[e+1];c[e+1]=c[e+3];c[e+3]=a},_doCryptBlock:function(c,e,a,b,h,d,j,m){for(var n=this._nRounds,f=c[e]^a[0],g=c[e+1]^a[1],k=c[e+2]^a[2],p=c[e+3]^a[3],l=4,t=1;t>>24]^h[g>>>16&255]^d[k>>>8&255]^j[p&255]^a[l++],r=b[g>>>24]^h[k>>>16&255]^d[p>>>8&255]^j[f&255]^a[l++],s=
10 | b[k>>>24]^h[p>>>16&255]^d[f>>>8&255]^j[g&255]^a[l++],p=b[p>>>24]^h[f>>>16&255]^d[g>>>8&255]^j[k&255]^a[l++],f=q,g=r,k=s;q=(m[f>>>24]<<24|m[g>>>16&255]<<16|m[k>>>8&255]<<8|m[p&255])^a[l++];r=(m[g>>>24]<<24|m[k>>>16&255]<<16|m[p>>>8&255]<<8|m[f&255])^a[l++];s=(m[k>>>24]<<24|m[p>>>16&255]<<16|m[f>>>8&255]<<8|m[g&255])^a[l++];p=(m[p>>>24]<<24|m[f>>>16&255]<<16|m[g>>>8&255]<<8|m[k&255])^a[l++];c[e]=q;c[e+1]=r;c[e+2]=s;c[e+3]=p},keySize:8});q.AES=x._createHelper(r)})();
11 |
--------------------------------------------------------------------------------
/lib/cryptojs v3.1.2/components/lib-typedarrays.js:
--------------------------------------------------------------------------------
1 | /*
2 | CryptoJS v3.1.2
3 | code.google.com/p/crypto-js
4 | (c) 2009-2013 by Jeff Mott. All rights reserved.
5 | code.google.com/p/crypto-js/wiki/License
6 | */
7 | (function () {
8 | // Check if typed arrays are supported
9 | if (typeof ArrayBuffer != 'function') {
10 | return;
11 | }
12 |
13 | // Shortcuts
14 | var C = CryptoJS;
15 | var C_lib = C.lib;
16 | var WordArray = C_lib.WordArray;
17 |
18 | // Reference original init
19 | var superInit = WordArray.init;
20 |
21 | // Augment WordArray.init to handle typed arrays
22 | var subInit = WordArray.init = function (typedArray) {
23 | // Convert buffers to uint8
24 | if (typedArray instanceof ArrayBuffer) {
25 | typedArray = new Uint8Array(typedArray);
26 | }
27 |
28 | // Convert other array views to uint8
29 | if (
30 | typedArray instanceof Int8Array ||
31 | typedArray instanceof Uint8ClampedArray ||
32 | typedArray instanceof Int16Array ||
33 | typedArray instanceof Uint16Array ||
34 | typedArray instanceof Int32Array ||
35 | typedArray instanceof Uint32Array ||
36 | typedArray instanceof Float32Array ||
37 | typedArray instanceof Float64Array
38 | ) {
39 | typedArray = new Uint8Array(typedArray.buffer, typedArray.byteOffset, typedArray.byteLength);
40 | }
41 |
42 | // Handle Uint8Array
43 | if (typedArray instanceof Uint8Array) {
44 | // Shortcut
45 | var typedArrayByteLength = typedArray.byteLength;
46 |
47 | // Extract bytes
48 | var words = [];
49 | for (var i = 0; i < typedArrayByteLength; i++) {
50 | words[i >>> 2] |= typedArray[i] << (24 - (i % 4) * 8);
51 | }
52 |
53 | // Initialize this word array
54 | superInit.call(this, words, typedArrayByteLength);
55 | } else {
56 | // Else call normal init
57 | superInit.apply(this, arguments);
58 | }
59 | };
60 |
61 | subInit.prototype = WordArray;
62 | }());
63 |
--------------------------------------------------------------------------------
/lib/cryptojs v3.1.2/components/sha384.js:
--------------------------------------------------------------------------------
1 | /*
2 | CryptoJS v3.1.2
3 | code.google.com/p/crypto-js
4 | (c) 2009-2013 by Jeff Mott. All rights reserved.
5 | code.google.com/p/crypto-js/wiki/License
6 | */
7 | (function () {
8 | // Shortcuts
9 | var C = CryptoJS;
10 | var C_x64 = C.x64;
11 | var X64Word = C_x64.Word;
12 | var X64WordArray = C_x64.WordArray;
13 | var C_algo = C.algo;
14 | var SHA512 = C_algo.SHA512;
15 |
16 | /**
17 | * SHA-384 hash algorithm.
18 | */
19 | var SHA384 = C_algo.SHA384 = SHA512.extend({
20 | _doReset: function () {
21 | this._hash = new X64WordArray.init([
22 | new X64Word.init(0xcbbb9d5d, 0xc1059ed8), new X64Word.init(0x629a292a, 0x367cd507),
23 | new X64Word.init(0x9159015a, 0x3070dd17), new X64Word.init(0x152fecd8, 0xf70e5939),
24 | new X64Word.init(0x67332667, 0xffc00b31), new X64Word.init(0x8eb44a87, 0x68581511),
25 | new X64Word.init(0xdb0c2e0d, 0x64f98fa7), new X64Word.init(0x47b5481d, 0xbefa4fa4)
26 | ]);
27 | },
28 |
29 | _doFinalize: function () {
30 | var hash = SHA512._doFinalize.call(this);
31 |
32 | hash.sigBytes -= 16;
33 |
34 | return hash;
35 | }
36 | });
37 |
38 | /**
39 | * Shortcut function to the hasher's object interface.
40 | *
41 | * @param {WordArray|string} message The message to hash.
42 | *
43 | * @return {WordArray} The hash.
44 | *
45 | * @static
46 | *
47 | * @example
48 | *
49 | * var hash = CryptoJS.SHA384('message');
50 | * var hash = CryptoJS.SHA384(wordArray);
51 | */
52 | C.SHA384 = SHA512._createHelper(SHA384);
53 |
54 | /**
55 | * Shortcut function to the HMAC's object interface.
56 | *
57 | * @param {WordArray|string} message The message to hash.
58 | * @param {WordArray|string} key The secret key.
59 | *
60 | * @return {WordArray} The HMAC.
61 | *
62 | * @static
63 | *
64 | * @example
65 | *
66 | * var hmac = CryptoJS.HmacSHA384(message, key);
67 | */
68 | C.HmacSHA384 = SHA512._createHmacHelper(SHA384);
69 | }());
70 |
--------------------------------------------------------------------------------
/lib/bitcore/package.json:
--------------------------------------------------------------------------------
1 | {
2 | "name": "bitcore",
3 | "version": "0.9.3",
4 | "description": "A pure and powerful JavaScript Bitcoin library.",
5 | "author": "BitPay ",
6 | "main": "index.js",
7 | "scripts": {
8 | "lint": "gulp lint",
9 | "test": "gulp test",
10 | "coverage": "gulp coverage",
11 | "build": "gulp"
12 | },
13 | "contributors": [
14 | {
15 | "name": "Daniel Cousens",
16 | "email": "bitcoin@dcousens.com"
17 | },
18 | {
19 | "name": "Esteban Ordano",
20 | "email": "eordano@gmail.com"
21 | },
22 | {
23 | "name": "Gordon Hall",
24 | "email": "gordon@bitpay.com"
25 | },
26 | {
27 | "name": "Jeff Garzik",
28 | "email": "jgarzik@bitpay.com"
29 | },
30 | {
31 | "name": "Kyle Drake",
32 | "email": "kyle@kyledrake.net"
33 | },
34 | {
35 | "name": "Manuel Araoz",
36 | "email": "manuelaraoz@gmail.com"
37 | },
38 | {
39 | "name": "Matias Alejo Garcia",
40 | "email": "ematiu@gmail.com"
41 | },
42 | {
43 | "name": "Ryan X. Charles",
44 | "email": "ryanxcharles@gmail.com"
45 | },
46 | {
47 | "name": "Stefan Thomas",
48 | "email": "moon@justmoon.net"
49 | },
50 | {
51 | "name": "Stephen Pair",
52 | "email": "stephen@bitpay.com"
53 | },
54 | {
55 | "name": "Wei Lu",
56 | "email": "luwei.here@gmail.com"
57 | }
58 | ],
59 | "keywords": [
60 | "bitcoin",
61 | "bip32",
62 | "bip37",
63 | "bip70",
64 | "merge",
65 | "multisig"
66 | ],
67 | "repository": {
68 | "type": "git",
69 | "url": "https://github.com/bitpay/bitcore.git"
70 | },
71 | "browser": {
72 | "request": "browser-request"
73 | },
74 | "dependencies": {
75 | "bn.js": "=0.16.1",
76 | "bs58": "=2.0.0",
77 | "elliptic": "=0.16.0",
78 | "hash.js": "=0.3.2",
79 | "inherits": "=2.0.1",
80 | "lodash": "=2.4.1",
81 | "sha512": "=0.0.1"
82 | },
83 | "devDependencies": {
84 | "bitcore-build": "git://github.com/bitpay/bitcore-build.git",
85 | "brfs": "^1.2.0",
86 | "chai": "^1.10.0",
87 | "gulp": "^3.8.10"
88 | },
89 | "license": "MIT"
90 | }
91 |
--------------------------------------------------------------------------------
/lib/cryptojs v3.1.2/components/rabbit-legacy-min.js:
--------------------------------------------------------------------------------
1 | /*
2 | CryptoJS v3.1.2
3 | code.google.com/p/crypto-js
4 | (c) 2009-2013 by Jeff Mott. All rights reserved.
5 | code.google.com/p/crypto-js/wiki/License
6 | */
7 | (function(){function g(){for(var a=this._X,d=this._C,c=0;8>c;c++)f[c]=d[c];d[0]=d[0]+1295307597+this._b|0;d[1]=d[1]+3545052371+(d[0]>>>0>>0?1:0)|0;d[2]=d[2]+886263092+(d[1]>>>0>>0?1:0)|0;d[3]=d[3]+1295307597+(d[2]>>>0>>0?1:0)|0;d[4]=d[4]+3545052371+(d[3]>>>0>>0?1:0)|0;d[5]=d[5]+886263092+(d[4]>>>0>>0?1:0)|0;d[6]=d[6]+1295307597+(d[5]>>>0>>0?1:0)|0;d[7]=d[7]+3545052371+(d[6]>>>0>>0?1:0)|0;this._b=d[7]>>>0>>0?1:0;for(c=0;8>c;c++){var h=a[c]+d[c],e=h&65535,
8 | g=h>>>16;b[c]=((e*e>>>17)+e*g>>>15)+g*g^((h&4294901760)*h|0)+((h&65535)*h|0)}a[0]=b[0]+(b[7]<<16|b[7]>>>16)+(b[6]<<16|b[6]>>>16)|0;a[1]=b[1]+(b[0]<<8|b[0]>>>24)+b[7]|0;a[2]=b[2]+(b[1]<<16|b[1]>>>16)+(b[0]<<16|b[0]>>>16)|0;a[3]=b[3]+(b[2]<<8|b[2]>>>24)+b[1]|0;a[4]=b[4]+(b[3]<<16|b[3]>>>16)+(b[2]<<16|b[2]>>>16)|0;a[5]=b[5]+(b[4]<<8|b[4]>>>24)+b[3]|0;a[6]=b[6]+(b[5]<<16|b[5]>>>16)+(b[4]<<16|b[4]>>>16)|0;a[7]=b[7]+(b[6]<<8|b[6]>>>24)+b[5]|0}var j=CryptoJS,k=j.lib.StreamCipher,e=[],f=[],b=[],l=j.algo.RabbitLegacy=
9 | k.extend({_doReset:function(){for(var a=this._key.words,d=this.cfg.iv,c=this._X=[a[0],a[3]<<16|a[2]>>>16,a[1],a[0]<<16|a[3]>>>16,a[2],a[1]<<16|a[0]>>>16,a[3],a[2]<<16|a[1]>>>16],a=this._C=[a[2]<<16|a[2]>>>16,a[0]&4294901760|a[1]&65535,a[3]<<16|a[3]>>>16,a[1]&4294901760|a[2]&65535,a[0]<<16|a[0]>>>16,a[2]&4294901760|a[3]&65535,a[1]<<16|a[1]>>>16,a[3]&4294901760|a[0]&65535],b=this._b=0;4>b;b++)g.call(this);for(b=0;8>b;b++)a[b]^=c[b+4&7];if(d){var c=d.words,d=c[0],c=c[1],d=(d<<8|d>>>24)&16711935|(d<<
10 | 24|d>>>8)&4278255360,c=(c<<8|c>>>24)&16711935|(c<<24|c>>>8)&4278255360,b=d>>>16|c&4294901760,e=c<<16|d&65535;a[0]^=d;a[1]^=b;a[2]^=c;a[3]^=e;a[4]^=d;a[5]^=b;a[6]^=c;a[7]^=e;for(b=0;4>b;b++)g.call(this)}},_doProcessBlock:function(a,b){var c=this._X;g.call(this);e[0]=c[0]^c[5]>>>16^c[3]<<16;e[1]=c[2]^c[7]>>>16^c[5]<<16;e[2]=c[4]^c[1]>>>16^c[7]<<16;e[3]=c[6]^c[3]>>>16^c[1]<<16;for(c=0;4>c;c++)e[c]=(e[c]<<8|e[c]>>>24)&16711935|(e[c]<<24|e[c]>>>8)&4278255360,a[b+c]^=e[c]},blockSize:4,ivSize:2});j.RabbitLegacy=
11 | k._createHelper(l)})();
12 |
--------------------------------------------------------------------------------
/lib/chrome-wallet-mod/js/bitcore/package.json:
--------------------------------------------------------------------------------
1 | {
2 | "name": "bitcore",
3 | "version": "0.9.3",
4 | "description": "A pure and powerful JavaScript Bitcoin library.",
5 | "author": "BitPay ",
6 | "main": "index.js",
7 | "scripts": {
8 | "lint": "gulp lint",
9 | "test": "gulp test",
10 | "coverage": "gulp coverage",
11 | "build": "gulp"
12 | },
13 | "contributors": [
14 | {
15 | "name": "Daniel Cousens",
16 | "email": "bitcoin@dcousens.com"
17 | },
18 | {
19 | "name": "Esteban Ordano",
20 | "email": "eordano@gmail.com"
21 | },
22 | {
23 | "name": "Gordon Hall",
24 | "email": "gordon@bitpay.com"
25 | },
26 | {
27 | "name": "Jeff Garzik",
28 | "email": "jgarzik@bitpay.com"
29 | },
30 | {
31 | "name": "Kyle Drake",
32 | "email": "kyle@kyledrake.net"
33 | },
34 | {
35 | "name": "Manuel Araoz",
36 | "email": "manuelaraoz@gmail.com"
37 | },
38 | {
39 | "name": "Matias Alejo Garcia",
40 | "email": "ematiu@gmail.com"
41 | },
42 | {
43 | "name": "Ryan X. Charles",
44 | "email": "ryanxcharles@gmail.com"
45 | },
46 | {
47 | "name": "Stefan Thomas",
48 | "email": "moon@justmoon.net"
49 | },
50 | {
51 | "name": "Stephen Pair",
52 | "email": "stephen@bitpay.com"
53 | },
54 | {
55 | "name": "Wei Lu",
56 | "email": "luwei.here@gmail.com"
57 | }
58 | ],
59 | "keywords": [
60 | "bitcoin",
61 | "bip32",
62 | "bip37",
63 | "bip70",
64 | "merge",
65 | "multisig"
66 | ],
67 | "repository": {
68 | "type": "git",
69 | "url": "https://github.com/bitpay/bitcore.git"
70 | },
71 | "browser": {
72 | "request": "browser-request"
73 | },
74 | "dependencies": {
75 | "bn.js": "=0.16.1",
76 | "bs58": "=2.0.0",
77 | "elliptic": "=0.16.0",
78 | "hash.js": "=0.3.2",
79 | "inherits": "=2.0.1",
80 | "lodash": "=2.4.1",
81 | "sha512": "=0.0.1"
82 | },
83 | "devDependencies": {
84 | "bitcore-build": "git://github.com/bitpay/bitcore-build.git",
85 | "brfs": "^1.2.0",
86 | "chai": "^1.10.0",
87 | "gulp": "^3.8.10"
88 | },
89 | "license": "MIT"
90 | }
91 |
--------------------------------------------------------------------------------
/lib/cryptojs v3.1.2/components/sha3-min.js:
--------------------------------------------------------------------------------
1 | /*
2 | CryptoJS v3.1.2
3 | code.google.com/p/crypto-js
4 | (c) 2009-2013 by Jeff Mott. All rights reserved.
5 | code.google.com/p/crypto-js/wiki/License
6 | */
7 | (function(y){for(var p=CryptoJS,m=p.lib,z=m.WordArray,q=m.Hasher,s=p.x64.Word,m=p.algo,v=[],w=[],x=[],c=1,d=0,l=0;24>l;l++){v[c+5*d]=(l+1)*(l+2)/2%64;var r=(2*c+3*d)%5,c=d%5,d=r}for(c=0;5>c;c++)for(d=0;5>d;d++)w[c+5*d]=d+5*((2*c+3*d)%5);c=1;for(d=0;24>d;d++){for(var t=r=l=0;7>t;t++){if(c&1){var u=(1<u?r^=1<c;c++)j[c]=s.create();m=m.SHA3=q.extend({cfg:q.cfg.extend({outputLength:512}),_doReset:function(){for(var c=this._state=
8 | [],n=0;25>n;n++)c[n]=new s.init;this.blockSize=(1600-2*this.cfg.outputLength)/32},_doProcessBlock:function(c,n){for(var h=this._state,d=this.blockSize/2,b=0;b>>24)&16711935|(e<<24|e>>>8)&4278255360,f=(f<<8|f>>>24)&16711935|(f<<24|f>>>8)&4278255360,a=h[b];a.high^=f;a.low^=e}for(d=0;24>d;d++){for(b=0;5>b;b++){for(var k=e=0,g=0;5>g;g++)a=h[b+5*g],e^=a.high,k^=a.low;a=j[b];a.high=e;a.low=k}for(b=0;5>b;b++){a=j[(b+4)%5];e=j[(b+1)%5];f=e.high;g=e.low;e=a.high^
9 | (f<<1|g>>>31);k=a.low^(g<<1|f>>>31);for(g=0;5>g;g++)a=h[b+5*g],a.high^=e,a.low^=k}for(f=1;25>f;f++)a=h[f],b=a.high,a=a.low,g=v[f],32>g?(e=b<>>32-g,k=a<>>32-g):(e=a<>>64-g,k=b<>>64-g),a=j[w[f]],a.high=e,a.low=k;a=j[0];b=h[0];a.high=b.high;a.low=b.low;for(b=0;5>b;b++)for(g=0;5>g;g++)f=b+5*g,a=h[f],e=j[f],f=j[(b+1)%5+5*g],k=j[(b+2)%5+5*g],a.high=e.high^~f.high&k.high,a.low=e.low^~f.low&k.low;a=h[0];b=x[d];a.high^=b.high;a.low^=b.low}},_doFinalize:function(){var c=this._data,
10 | d=c.words,h=8*c.sigBytes,j=32*this.blockSize;d[h>>>5]|=1<<24-h%32;d[(y.ceil((h+1)/j)*j>>>5)-1]|=128;c.sigBytes=4*d.length;this._process();for(var c=this._state,d=this.cfg.outputLength/8,h=d/8,j=[],b=0;b>>24)&16711935|(f<<24|f>>>8)&4278255360,e=(e<<8|e>>>24)&16711935|(e<<24|e>>>8)&4278255360;j.push(e);j.push(f)}return new z.init(j,d)},clone:function(){for(var c=q.clone.call(this),d=c._state=this._state.slice(0),h=0;25>h;h++)d[h]=d[h].clone();return c}});
11 | p.SHA3=q._createHelper(m);p.HmacSHA3=q._createHmacHelper(m)})(Math);
12 |
--------------------------------------------------------------------------------
/lib/cw_address_key_generator/jss/bitcore/package.json:
--------------------------------------------------------------------------------
1 | {
2 | "name": "bitcore",
3 | "version": "0.9.3",
4 | "description": "A pure and powerful JavaScript Bitcoin library.",
5 | "author": "BitPay ",
6 | "main": "index.js",
7 | "scripts": {
8 | "lint": "gulp lint",
9 | "test": "gulp test",
10 | "coverage": "gulp coverage",
11 | "build": "gulp"
12 | },
13 | "contributors": [
14 | {
15 | "name": "Daniel Cousens",
16 | "email": "bitcoin@dcousens.com"
17 | },
18 | {
19 | "name": "Esteban Ordano",
20 | "email": "eordano@gmail.com"
21 | },
22 | {
23 | "name": "Gordon Hall",
24 | "email": "gordon@bitpay.com"
25 | },
26 | {
27 | "name": "Jeff Garzik",
28 | "email": "jgarzik@bitpay.com"
29 | },
30 | {
31 | "name": "Kyle Drake",
32 | "email": "kyle@kyledrake.net"
33 | },
34 | {
35 | "name": "Manuel Araoz",
36 | "email": "manuelaraoz@gmail.com"
37 | },
38 | {
39 | "name": "Matias Alejo Garcia",
40 | "email": "ematiu@gmail.com"
41 | },
42 | {
43 | "name": "Ryan X. Charles",
44 | "email": "ryanxcharles@gmail.com"
45 | },
46 | {
47 | "name": "Stefan Thomas",
48 | "email": "moon@justmoon.net"
49 | },
50 | {
51 | "name": "Stephen Pair",
52 | "email": "stephen@bitpay.com"
53 | },
54 | {
55 | "name": "Wei Lu",
56 | "email": "luwei.here@gmail.com"
57 | }
58 | ],
59 | "keywords": [
60 | "bitcoin",
61 | "bip32",
62 | "bip37",
63 | "bip70",
64 | "merge",
65 | "multisig"
66 | ],
67 | "repository": {
68 | "type": "git",
69 | "url": "https://github.com/bitpay/bitcore.git"
70 | },
71 | "browser": {
72 | "request": "browser-request"
73 | },
74 | "dependencies": {
75 | "bn.js": "=0.16.1",
76 | "bs58": "=2.0.0",
77 | "elliptic": "=0.16.0",
78 | "hash.js": "=0.3.2",
79 | "inherits": "=2.0.1",
80 | "lodash": "=2.4.1",
81 | "sha512": "=0.0.1"
82 | },
83 | "devDependencies": {
84 | "bitcore-build": "git://github.com/bitpay/bitcore-build.git",
85 | "brfs": "^1.2.0",
86 | "chai": "^1.10.0",
87 | "gulp": "^3.8.10"
88 | },
89 | "license": "MIT"
90 | }
91 |
--------------------------------------------------------------------------------
/lib/cryptojs v3.1.2/components/rabbit-min.js:
--------------------------------------------------------------------------------
1 | /*
2 | CryptoJS v3.1.2
3 | code.google.com/p/crypto-js
4 | (c) 2009-2013 by Jeff Mott. All rights reserved.
5 | code.google.com/p/crypto-js/wiki/License
6 | */
7 | (function(){function g(){for(var b=this._X,d=this._C,a=0;8>a;a++)f[a]=d[a];d[0]=d[0]+1295307597+this._b|0;d[1]=d[1]+3545052371+(d[0]>>>0>>0?1:0)|0;d[2]=d[2]+886263092+(d[1]>>>0>>0?1:0)|0;d[3]=d[3]+1295307597+(d[2]>>>0>>0?1:0)|0;d[4]=d[4]+3545052371+(d[3]>>>0>>0?1:0)|0;d[5]=d[5]+886263092+(d[4]>>>0>>0?1:0)|0;d[6]=d[6]+1295307597+(d[5]>>>0>>0?1:0)|0;d[7]=d[7]+3545052371+(d[6]>>>0>>0?1:0)|0;this._b=d[7]>>>0>>0?1:0;for(a=0;8>a;a++){var h=b[a]+d[a],e=h&65535,
8 | g=h>>>16;c[a]=((e*e>>>17)+e*g>>>15)+g*g^((h&4294901760)*h|0)+((h&65535)*h|0)}b[0]=c[0]+(c[7]<<16|c[7]>>>16)+(c[6]<<16|c[6]>>>16)|0;b[1]=c[1]+(c[0]<<8|c[0]>>>24)+c[7]|0;b[2]=c[2]+(c[1]<<16|c[1]>>>16)+(c[0]<<16|c[0]>>>16)|0;b[3]=c[3]+(c[2]<<8|c[2]>>>24)+c[1]|0;b[4]=c[4]+(c[3]<<16|c[3]>>>16)+(c[2]<<16|c[2]>>>16)|0;b[5]=c[5]+(c[4]<<8|c[4]>>>24)+c[3]|0;b[6]=c[6]+(c[5]<<16|c[5]>>>16)+(c[4]<<16|c[4]>>>16)|0;b[7]=c[7]+(c[6]<<8|c[6]>>>24)+c[5]|0}var j=CryptoJS,k=j.lib.StreamCipher,e=[],f=[],c=[],l=j.algo.Rabbit=
9 | k.extend({_doReset:function(){for(var b=this._key.words,d=this.cfg.iv,a=0;4>a;a++)b[a]=(b[a]<<8|b[a]>>>24)&16711935|(b[a]<<24|b[a]>>>8)&4278255360;for(var c=this._X=[b[0],b[3]<<16|b[2]>>>16,b[1],b[0]<<16|b[3]>>>16,b[2],b[1]<<16|b[0]>>>16,b[3],b[2]<<16|b[1]>>>16],b=this._C=[b[2]<<16|b[2]>>>16,b[0]&4294901760|b[1]&65535,b[3]<<16|b[3]>>>16,b[1]&4294901760|b[2]&65535,b[0]<<16|b[0]>>>16,b[2]&4294901760|b[3]&65535,b[1]<<16|b[1]>>>16,b[3]&4294901760|b[0]&65535],a=this._b=0;4>a;a++)g.call(this);for(a=0;8>
10 | a;a++)b[a]^=c[a+4&7];if(d){var a=d.words,d=a[0],a=a[1],d=(d<<8|d>>>24)&16711935|(d<<24|d>>>8)&4278255360,a=(a<<8|a>>>24)&16711935|(a<<24|a>>>8)&4278255360,c=d>>>16|a&4294901760,e=a<<16|d&65535;b[0]^=d;b[1]^=c;b[2]^=a;b[3]^=e;b[4]^=d;b[5]^=c;b[6]^=a;b[7]^=e;for(a=0;4>a;a++)g.call(this)}},_doProcessBlock:function(b,c){var a=this._X;g.call(this);e[0]=a[0]^a[5]>>>16^a[3]<<16;e[1]=a[2]^a[7]>>>16^a[5]<<16;e[2]=a[4]^a[1]>>>16^a[7]<<16;e[3]=a[6]^a[3]>>>16^a[1]<<16;for(a=0;4>a;a++)e[a]=(e[a]<<8|e[a]>>>24)&
11 | 16711935|(e[a]<<24|e[a]>>>8)&4278255360,b[c+a]^=e[a]},blockSize:4,ivSize:2});j.Rabbit=k._createHelper(l)})();
12 |
--------------------------------------------------------------------------------
/lib/seedrandom/lib/xorwow.js:
--------------------------------------------------------------------------------
1 | // A Javascript implementaion of the "xorwow" prng algorithm by
2 | // George Marsaglia. See http://www.jstatsoft.org/v08/i14/paper
3 |
4 | (function(global, module, define) {
5 |
6 | function XorGen(seed) {
7 | var me = this, strseed = '';
8 |
9 | // Set up generator function.
10 | me.next = function() {
11 | var t = (me.x ^ (me.x >>> 2));
12 | me.x = me.y; me.y = me.z; me.z = me.w; me.w = me.v;
13 | return (me.d = (me.d + 362437 | 0)) +
14 | (me.v = (me.v ^ (me.v << 4)) ^ (t ^ (t << 1))) | 0;
15 | };
16 |
17 | me.x = 0;
18 | me.y = 0;
19 | me.z = 0;
20 | me.w = 0;
21 | me.v = 0;
22 |
23 | if (seed === (seed | 0)) {
24 | // Integer seed.
25 | me.x = seed;
26 | } else {
27 | // String seed.
28 | strseed += seed;
29 | }
30 |
31 | // Mix in string seed, then discard an initial batch of 64 values.
32 | for (var k = 0; k < strseed.length + 64; k++) {
33 | me.x ^= strseed.charCodeAt(k) | 0;
34 | if (k == strseed.length) {
35 | me.d = me.x << 10 ^ me.x >>> 4;
36 | }
37 | me.next();
38 | }
39 | }
40 |
41 | function copy(f, t) {
42 | t.x = f.x;
43 | t.y = f.y;
44 | t.z = f.z;
45 | t.w = f.w;
46 | t.v = f.v;
47 | t.d = f.d;
48 | return t;
49 | }
50 |
51 | function impl(seed, opts) {
52 | var xg = new XorGen(seed),
53 | state = opts && opts.state,
54 | prng = function() { return (xg.next() >>> 0) / 0x100000000; };
55 | prng.double = function() {
56 | do {
57 | var top = xg.next() >>> 11,
58 | bot = (xg.next() >>> 0) / 0x100000000,
59 | result = (top + bot) / (1 << 21);
60 | } while (result === 0);
61 | return result;
62 | };
63 | prng.int32 = xg.next;
64 | prng.quick = prng;
65 | if (state) {
66 | if (typeof(state) == 'object') copy(state, xg);
67 | prng.state = function() { return copy(xg, {}); }
68 | }
69 | return prng;
70 | }
71 |
72 | if (module && module.exports) {
73 | module.exports = impl;
74 | } else if (define && define.amd) {
75 | define(function() { return impl; });
76 | } else {
77 | this.xorwow = impl;
78 | }
79 |
80 | })(
81 | this,
82 | (typeof module) == 'object' && module, // present in node.js
83 | (typeof define) == 'function' && define // present with an AMD loader
84 | );
85 |
86 |
87 |
--------------------------------------------------------------------------------
/lib/seedrandom/index.js:
--------------------------------------------------------------------------------
1 | // A library of seedable RNGs implemented in Javascript.
2 | //
3 | // Usage:
4 | //
5 | // var seedrandom = require('seedrandom');
6 | // var random = seedrandom(1); // or any seed.
7 | // var x = random(); // 0 <= x < 1. Every bit is random.
8 | // var x = random.quick(); // 0 <= x < 1. 32 bits of randomness.
9 |
10 | // alea, a 53-bit multiply-with-carry generator by Johannes Baagøe.
11 | // Period: ~2^116
12 | // Reported to pass all BigCrush tests.
13 | var alea = require('./lib/alea');
14 |
15 | // xor128, a pure xor-shift generator by George Marsaglia.
16 | // Period: 2^128-1.
17 | // Reported to fail: MatrixRank and LinearComp.
18 | var xor128 = require('./lib/xor128');
19 |
20 | // xorwow, George Marsaglia's 160-bit xor-shift combined plus weyl.
21 | // Period: 2^192-2^32
22 | // Reported to fail: CollisionOver, SimpPoker, and LinearComp.
23 | var xorwow = require('./lib/xorwow');
24 |
25 | // xorshift7, by François Panneton and Pierre L'ecuyer, takes
26 | // a different approach: it adds robustness by allowing more shifts
27 | // than Marsaglia's original three. It is a 7-shift generator
28 | // with 256 bits, that passes BigCrush with no systmatic failures.
29 | // Period 2^256-1.
30 | // No systematic BigCrush failures reported.
31 | var xorshift7 = require('./lib/xorshift7');
32 |
33 | // xor4096, by Richard Brent, is a 4096-bit xor-shift with a
34 | // very long period that also adds a Weyl generator. It also passes
35 | // BigCrush with no systematic failures. Its long period may
36 | // be useful if you have many generators and need to avoid
37 | // collisions.
38 | // Period: 2^4128-2^32.
39 | // No systematic BigCrush failures reported.
40 | var xor4096 = require('./lib/xor4096');
41 |
42 | // Tyche-i, by Samuel Neves and Filipe Araujo, is a bit-shifting random
43 | // number generator derived from ChaCha, a modern stream cipher.
44 | // https://eden.dei.uc.pt/~sneves/pubs/2011-snfa2.pdf
45 | // Period: ~2^127
46 | // No systematic BigCrush failures reported.
47 | var tychei = require('./lib/tychei');
48 |
49 | // The original ARC4-based prng included in this library.
50 | // Period: ~2^1600
51 | var sr = require('./seedrandom');
52 |
53 | sr.alea = alea;
54 | sr.xor128 = xor128;
55 | sr.xorwow = xorwow;
56 | sr.xorshift7 = xorshift7;
57 | sr.xor4096 = xor4096;
58 | sr.tychei = tychei;
59 |
60 | module.exports = sr;
61 |
--------------------------------------------------------------------------------
/lib/seedrandom/Gruntfile.js:
--------------------------------------------------------------------------------
1 | module.exports = function(grunt) {
2 | "use strict";
3 |
4 | grunt.initConfig({
5 | pkg: grunt.file.readJSON("package.json"),
6 | bowercopy: {
7 | options: {
8 | clean: true
9 | },
10 | test: {
11 | options: {
12 | destPrefix: "test/lib"
13 | },
14 | files: {
15 | "qunit.js" : "qunit/qunit/qunit.js",
16 | "qunit.css" : "qunit/qunit/qunit.css",
17 | "require.js" : "requirejs/require.js"
18 | }
19 | }
20 | },
21 | uglify: {
22 | all: {
23 | files: {
24 | "<%= pkg.name %>.min.js": [ "<%= pkg.name %>.js" ],
25 | "lib/alea.min.js": [ "lib/alea.js" ],
26 | "lib/tychei.min.js": [ "lib/tychei.js" ],
27 | "lib/xor4096.min.js": [ "lib/xor4096.js" ],
28 | "lib/xorshift7.min.js": [ "lib/xorshift7.js" ],
29 | "lib/xorwow.min.js": [ "lib/xorwow.js" ],
30 | "lib/xor128.min.js": [ "lib/xor128.js" ]
31 | },
32 | options: {
33 | preserveComments: false,
34 | report: "min",
35 | beautify: {
36 | ascii_only: true
37 | }
38 | }
39 | }
40 | },
41 | sed: {
42 | nullchar: {
43 | path: "<%= pkg.name %>.min.js",
44 | pattern: '\\\\x00',
45 | replacement: '\\0'
46 | },
47 | },
48 | qunit: {
49 | options: {
50 | noGlobals: true
51 | },
52 | all: ["test/*.html"]
53 | },
54 | mochacov: {
55 | options: {
56 | files: ['test/cryptotest.js', 'test/nodetest.js', 'test/prngtest.js']
57 | },
58 | coverage: {
59 | options: {
60 | coveralls: true
61 | }
62 | },
63 | test: {
64 | options: {
65 | reporter: 'dot'
66 | }
67 | }
68 | },
69 | release: {
70 | options: {
71 | bump: false
72 | }
73 | }
74 | });
75 |
76 | grunt.loadNpmTasks('grunt-bowercopy');
77 | grunt.loadNpmTasks('grunt-contrib-qunit');
78 | grunt.loadNpmTasks('grunt-contrib-uglify');
79 | grunt.loadNpmTasks('grunt-mocha-cov');
80 | grunt.loadNpmTasks('grunt-release');
81 | grunt.loadNpmTasks('grunt-sed');
82 |
83 | grunt.registerTask("default", ["uglify", "sed", "qunit", "mochacov:test"]);
84 | grunt.registerTask("travis", ["default", "mochacov:coverage"]);
85 | };
86 |
87 |
--------------------------------------------------------------------------------
/lib/seedrandom/test/cryptotest.js:
--------------------------------------------------------------------------------
1 | var proxyquire = require('proxyquire');
2 | var assert = require("assert");
3 | var Module = require("module");
4 |
5 | describe("Crypto API Test", function() {
6 |
7 | var crypto_stub = {};
8 | var original = Math.random;
9 | var rng, r;
10 |
11 | // Load seedrandom in absence of any crypto package.
12 | it("should be able to seed without crypto", function() {
13 | var noncrypto_sr = proxyquire('../seedrandom', { crypto: null });
14 | rng = noncrypto_sr('hello.');
15 | assert.equal(typeof(rng), 'function', "Should return a function.");
16 | r = rng();
17 | assert.equal(r, 0.9282578795792454, "Should be 'hello.'#1");
18 | assert(original === Math.random, "Should not change Math.random.");
19 | assert(original !== rng, "PRNG should not be Math.random.");
20 | var noncrypto_sr = proxyquire('../seedrandom', { crypto: null });
21 | result = noncrypto_sr();
22 | assert.equal(typeof(result), 'function', "Should return function.");
23 | assert(original === Math.random, "Should not change Math.random.");
24 | r = result();
25 | assert(r != 0.9282578795792454, "Should not be 'hello.'#1");
26 | assert(r != 0.7316977468919549, "Should not be 'hello.'#3");
27 | assert(r != 0.23144008215179881, "Should not be '\\0'#1");
28 | assert(r != 0.7220382488550928, "Should not be '\\1'#1");
29 | // Recache original seedrandom.
30 | proxyquire('../seedrandom', {});
31 | });
32 |
33 | // Load seedrandom with zeroed-out crypto package.
34 | it("should be able to seed ('hello.') with zero crypto", function() {
35 | var zerocrypto_sr = proxyquire('../seedrandom', {
36 | crypto: { randomBytes: function(n) {
37 | result = []; while (n-- > 0) { result.push(1); } return result; } }
38 | });
39 | rng = zerocrypto_sr('hello.');
40 | assert.equal(typeof(rng), 'function', "Should return a function.");
41 | r = rng();
42 | assert.equal(r, 0.9282578795792454 , "Should be 'hello.'#1");
43 | assert(original === Math.random, "Should not change Math.random.");
44 | assert(original !== rng, "PRNG should not be Math.random.");
45 | rng = zerocrypto_sr();
46 | assert.equal(typeof(rng), 'function', "Should return function.");
47 | assert(original === Math.random, "Should not change Math.random.");
48 | r = rng();
49 | assert.equal(r, 0.7220382488550928, "Should be '\\1'#1");
50 | r = rng();
51 | assert.equal(r, 0.0259971860493045, "Should be '\\1'#2");
52 | // Recache original seedrandom.
53 | proxyquire('../seedrandom', {});
54 | });
55 |
56 |
57 | });
58 |
--------------------------------------------------------------------------------
/lib/chrome-wallet-mod/js/tipbutton.js:
--------------------------------------------------------------------------------
1 | //var address = $(".companion-tip-address").text();
2 |
3 | var iconpathicon = chrome.extension.getURL('pockets-48.png');
4 | var iconpathblue = chrome.extension.getURL('images/paywithpockets-blue.png');
5 | var iconpathyellow = chrome.extension.getURL('images/paywithpockets-yellow.png');
6 | var iconpathgreen = chrome.extension.getURL('images/paywithpockets-green.png');
7 | var tipsplash = chrome.extension.getURL('tipsplash.html');
8 |
9 | //$('.pockets-url').html(tipsplash);
10 | //$('.pockets-image').html(iconpathblue);
11 | //$('.pockets-image-blue').html(iconpathblue);
12 | //$('.pockets-image-yellow').html(iconpathyellow);
13 | //$('.pockets-image-green').html(iconpathgreen);
14 | //$('.pockets-image-icon').html(iconpathicon);
15 | //
16 | //$('.pockets-payment-button').each(function(i, obj) {
17 | //
18 | // var buttoncolor = $(this).attr("data-color");
19 | //
20 | // if (buttoncolor == "yellow") {
21 | // var iconcolor = "yellow";
22 | // var iconwidth = 160;
23 | // iconpath = chrome.extension.getURL('images/paywithpockets-'+iconcolor+'.png');
24 | // } else if (buttoncolor == "green") {
25 | // var iconcolor = "green";
26 | // var iconwidth = 160;
27 | // iconpath = chrome.extension.getURL('images/paywithpockets-'+iconcolor+'.png');
28 | // } else if (buttoncolor == "icon") {
29 | // var iconcolor = "icon";
30 | // var iconwidth = 24;
31 | // iconpath = chrome.extension.getURL('pockets-48.png');
32 | // } else {
33 | // var iconcolor = "blue";
34 | // var iconwidth = 160;
35 | // iconpath = chrome.extension.getURL('images/paywithpockets-'+iconcolor+'.png');
36 | // }
37 | //
38 | // var address = $(this).attr("data-address");
39 | // var label = $(this).attr("data-label");
40 | //// var isxcp = $(this).attr("data-isxcp");
41 | // var tokens = $(this).attr("data-tokens");
42 | // var amount = $(this).attr("data-amount");
43 | //
44 | // var labelurl = encodeURIComponent(label).replace(/[!'()*]/g, escape);
45 | // var tokensurl = encodeURIComponent(tokens);
46 | //
47 | // var tipbutton = "![]("+iconpath+")
";
48 | //
49 | // //"&isxcp="+isxcp+
50 | //
51 | // $(this).html(tipbutton);
52 | //
53 | //});
54 |
55 |
56 |
57 |
58 |
--------------------------------------------------------------------------------
/lib/mnemonic/tests/specs/mnemonic_spec.js:
--------------------------------------------------------------------------------
1 | (function (Mnemonic) {
2 |
3 | describe('Mnemonic', function () {
4 |
5 | it('creates mnemonics of 32*n bits', function () {
6 | var m;
7 | m = new Mnemonic(32);
8 | expect(m.seed.length).toEqual(1);
9 | m = new Mnemonic(64);
10 | expect(m.seed.length).toEqual(2);
11 | m = new Mnemonic(); // Default 96bits
12 | expect(m.seed.length).toEqual(3);
13 | m = new Mnemonic(256);
14 | expect(m.seed.length).toEqual(8);
15 |
16 | var illegal = function () {
17 | return new Mnemonic(42);
18 | };
19 | expect(illegal).toThrow();
20 | });
21 |
22 | it('produces the right words', function () {
23 | var m;
24 | m = new Mnemonic(32);
25 | m.seed[0] = 0;
26 | expect(m.toWords()).toEqual(['like', 'like', 'like']); // First word 3 times
27 |
28 | m.seed[0] = Mnemonic.wc - 1;
29 | expect(m.toWords()).toEqual(['weary', 'weary', 'weary']); // Last word 3 times
30 |
31 | m.seed[0] = Math.pow(2,32) - 1;
32 | expect(m.toWords()).toEqual(['fail', 'husband', 'howl']);
33 | });
34 |
35 | it('produces the right hex', function () {
36 | var m;
37 | m = new Mnemonic(32);
38 | m.seed[0] = 0;
39 | expect(m.toHex()).toEqual('00000000'); // First word 3 times
40 |
41 | m.seed[0] = Mnemonic.wc - 1;
42 | expect(m.toHex()).toEqual('00000659'); // Last word 3 times
43 |
44 | m.seed[0] = Math.pow(2,32) - 1;
45 | expect(m.toHex()).toEqual('ffffffff');
46 | });
47 |
48 | it('can be constructed from a Uint32 array', function () {
49 | var arr, m2, m1 = new Mnemonic();
50 | arr = m1.seed;
51 | m2 = new Mnemonic(arr);
52 | expect(m1.seed).toEqual(m2.seed);
53 | });
54 |
55 | it('can be reconstructed from words', function () {
56 | var m2, m1 = new Mnemonic();
57 | m2 = Mnemonic.fromWords(m1.toWords());
58 | expect(m1.seed).toEqual(m2.seed);
59 | });
60 |
61 | it('can be reconstructed from hex', function () {
62 | var m2, m1 = new Mnemonic();
63 | m2 = Mnemonic.fromHex(m1.toHex());
64 | expect(m1.seed).toEqual(m2.seed);
65 | });
66 | });
67 |
68 |
69 | })(this.Mnemonic);
70 |
--------------------------------------------------------------------------------
/lib/cryptojs v3.1.2/components/mode-ctr-gladman.js:
--------------------------------------------------------------------------------
1 | /*
2 | CryptoJS v3.1.2
3 | code.google.com/p/crypto-js
4 | (c) 2009-2013 by Jeff Mott. All rights reserved.
5 | code.google.com/p/crypto-js/wiki/License
6 | */
7 | /** @preserve
8 | * Counter block mode compatible with Dr Brian Gladman fileenc.c
9 | * derived from CryptoJS.mode.CTR
10 | * Jan Hruby jhruby.web@gmail.com
11 | */
12 | CryptoJS.mode.CTRGladman = (function () {
13 | var CTRGladman = CryptoJS.lib.BlockCipherMode.extend();
14 |
15 | function incWord(word)
16 | {
17 | if (((word >> 24) & 0xff) === 0xff) { //overflow
18 | var b1 = (word >> 16)&0xff;
19 | var b2 = (word >> 8)&0xff;
20 | var b3 = word & 0xff;
21 |
22 | if (b1 === 0xff) // overflow b1
23 | {
24 | b1 = 0;
25 | if (b2 === 0xff)
26 | {
27 | b2 = 0;
28 | if (b3 === 0xff)
29 | {
30 | b3 = 0;
31 | }
32 | else
33 | {
34 | ++b3;
35 | }
36 | }
37 | else
38 | {
39 | ++b2;
40 | }
41 | }
42 | else
43 | {
44 | ++b1;
45 | }
46 |
47 | word = 0;
48 | word += (b1 << 16);
49 | word += (b2 << 8);
50 | word += b3;
51 | }
52 | else
53 | {
54 | word += (0x01 << 24);
55 | }
56 | return word;
57 | }
58 |
59 | function incCounter(counter)
60 | {
61 | if ((counter[0] = incWord(counter[0])) === 0)
62 | {
63 | // encr_data in fileenc.c from Dr Brian Gladman's counts only with DWORD j < 8
64 | counter[1] = incWord(counter[1]);
65 | }
66 | return counter;
67 | }
68 |
69 | var Encryptor = CTRGladman.Encryptor = CTRGladman.extend({
70 | processBlock: function (words, offset) {
71 | // Shortcuts
72 | var cipher = this._cipher
73 | var blockSize = cipher.blockSize;
74 | var iv = this._iv;
75 | var counter = this._counter;
76 |
77 | // Generate keystream
78 | if (iv) {
79 | counter = this._counter = iv.slice(0);
80 |
81 | // Remove IV for subsequent blocks
82 | this._iv = undefined;
83 | }
84 |
85 | incCounter(counter);
86 |
87 | var keystream = counter.slice(0);
88 | cipher.encryptBlock(keystream, 0);
89 |
90 | // Encrypt
91 | for (var i = 0; i < blockSize; i++) {
92 | words[offset + i] ^= keystream[i];
93 | }
94 | }
95 | });
96 |
97 | CTRGladman.Decryptor = Encryptor;
98 |
99 | return CTRGladman;
100 | }());
101 |
102 |
103 |
--------------------------------------------------------------------------------
/template.html:
--------------------------------------------------------------------------------
1 |
2 |
3 |
4 |
5 | >>32-h)+f}function k(a,f,g,j,p,h,k){a=a+(f&j|g&~j)+p+k;return(a<>>32-h)+f}function l(a,f,g,j,h,k,l){a=a+(f^g^j)+h+l;return(a<>>32-k)+f}function n(a,f,g,j,h,k,l){a=a+(g^(f|~j))+h+l;return(a<>>32-k)+f}for(var r=CryptoJS,q=r.lib,F=q.WordArray,s=q.Hasher,q=r.algo,a=[],t=0;64>t;t++)a[t]=4294967296*E.abs(E.sin(t+1))|0;q=q.MD5=s.extend({_doReset:function(){this._hash=new F.init([1732584193,4023233417,2562383102,271733878])},
8 | _doProcessBlock:function(m,f){for(var g=0;16>g;g++){var j=f+g,p=m[j];m[j]=(p<<8|p>>>24)&16711935|(p<<24|p>>>8)&4278255360}var g=this._hash.words,j=m[f+0],p=m[f+1],q=m[f+2],r=m[f+3],s=m[f+4],t=m[f+5],u=m[f+6],v=m[f+7],w=m[f+8],x=m[f+9],y=m[f+10],z=m[f+11],A=m[f+12],B=m[f+13],C=m[f+14],D=m[f+15],b=g[0],c=g[1],d=g[2],e=g[3],b=h(b,c,d,e,j,7,a[0]),e=h(e,b,c,d,p,12,a[1]),d=h(d,e,b,c,q,17,a[2]),c=h(c,d,e,b,r,22,a[3]),b=h(b,c,d,e,s,7,a[4]),e=h(e,b,c,d,t,12,a[5]),d=h(d,e,b,c,u,17,a[6]),c=h(c,d,e,b,v,22,a[7]),
9 | b=h(b,c,d,e,w,7,a[8]),e=h(e,b,c,d,x,12,a[9]),d=h(d,e,b,c,y,17,a[10]),c=h(c,d,e,b,z,22,a[11]),b=h(b,c,d,e,A,7,a[12]),e=h(e,b,c,d,B,12,a[13]),d=h(d,e,b,c,C,17,a[14]),c=h(c,d,e,b,D,22,a[15]),b=k(b,c,d,e,p,5,a[16]),e=k(e,b,c,d,u,9,a[17]),d=k(d,e,b,c,z,14,a[18]),c=k(c,d,e,b,j,20,a[19]),b=k(b,c,d,e,t,5,a[20]),e=k(e,b,c,d,y,9,a[21]),d=k(d,e,b,c,D,14,a[22]),c=k(c,d,e,b,s,20,a[23]),b=k(b,c,d,e,x,5,a[24]),e=k(e,b,c,d,C,9,a[25]),d=k(d,e,b,c,r,14,a[26]),c=k(c,d,e,b,w,20,a[27]),b=k(b,c,d,e,B,5,a[28]),e=k(e,b,
10 | c,d,q,9,a[29]),d=k(d,e,b,c,v,14,a[30]),c=k(c,d,e,b,A,20,a[31]),b=l(b,c,d,e,t,4,a[32]),e=l(e,b,c,d,w,11,a[33]),d=l(d,e,b,c,z,16,a[34]),c=l(c,d,e,b,C,23,a[35]),b=l(b,c,d,e,p,4,a[36]),e=l(e,b,c,d,s,11,a[37]),d=l(d,e,b,c,v,16,a[38]),c=l(c,d,e,b,y,23,a[39]),b=l(b,c,d,e,B,4,a[40]),e=l(e,b,c,d,j,11,a[41]),d=l(d,e,b,c,r,16,a[42]),c=l(c,d,e,b,u,23,a[43]),b=l(b,c,d,e,x,4,a[44]),e=l(e,b,c,d,A,11,a[45]),d=l(d,e,b,c,D,16,a[46]),c=l(c,d,e,b,q,23,a[47]),b=n(b,c,d,e,j,6,a[48]),e=n(e,b,c,d,v,10,a[49]),d=n(d,e,b,c,
11 | C,15,a[50]),c=n(c,d,e,b,t,21,a[51]),b=n(b,c,d,e,A,6,a[52]),e=n(e,b,c,d,r,10,a[53]),d=n(d,e,b,c,y,15,a[54]),c=n(c,d,e,b,p,21,a[55]),b=n(b,c,d,e,w,6,a[56]),e=n(e,b,c,d,D,10,a[57]),d=n(d,e,b,c,u,15,a[58]),c=n(c,d,e,b,B,21,a[59]),b=n(b,c,d,e,s,6,a[60]),e=n(e,b,c,d,z,10,a[61]),d=n(d,e,b,c,q,15,a[62]),c=n(c,d,e,b,x,21,a[63]);g[0]=g[0]+b|0;g[1]=g[1]+c|0;g[2]=g[2]+d|0;g[3]=g[3]+e|0},_doFinalize:function(){var a=this._data,f=a.words,g=8*this._nDataBytes,j=8*a.sigBytes;f[j>>>5]|=128<<24-j%32;var h=E.floor(g/
12 | 4294967296);f[(j+64>>>9<<4)+15]=(h<<8|h>>>24)&16711935|(h<<24|h>>>8)&4278255360;f[(j+64>>>9<<4)+14]=(g<<8|g>>>24)&16711935|(g<<24|g>>>8)&4278255360;a.sigBytes=4*(f.length+1);this._process();a=this._hash;f=a.words;for(g=0;4>g;g++)j=f[g],f[g]=(j<<8|j>>>24)&16711935|(j<<24|j>>>8)&4278255360;return a},clone:function(){var a=s.clone.call(this);a._hash=this._hash.clone();return a}});r.MD5=s._createHelper(q);r.HmacMD5=s._createHmacHelper(q)})(Math);
13 |
--------------------------------------------------------------------------------
/lib/chrome-wallet-mod/issue-tx.html:
--------------------------------------------------------------------------------
1 |
2 |
3 |
4 |
5 |
6 | Review Token Information
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 |
6 | Review Token Information
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 | >>2]|=(d[e>>>2]>>>24-8*(e%4)&255)<<24-8*((c+e)%4);else if(65535>>2]=d[e>>>2];else b.push.apply(b,d);this.sigBytes+=a;return this},clamp:function(){var a=this.words,b=this.sigBytes;a[b>>>2]&=4294967295<<
9 | 32-8*(b%4);a.length=h.ceil(b/4)},clone:function(){var a=f.clone.call(this);a.words=this.words.slice(0);return a},random:function(a){for(var b=[],d=0;d>>2]>>>24-8*(c%4)&255;d.push((e>>>4).toString(16));d.push((e&15).toString(16))}return d.join("")},parse:function(a){for(var b=a.length,d=[],c=0;c>>3]|=parseInt(a.substr(c,
10 | 2),16)<<24-4*(c%8);return new j.init(d,b/2)}},p=m.Latin1={stringify:function(a){var b=a.words;a=a.sigBytes;for(var d=[],c=0;c>>2]>>>24-8*(c%4)&255));return d.join("")},parse:function(a){for(var b=a.length,d=[],c=0;c>>2]|=(a.charCodeAt(c)&255)<<24-8*(c%4);return new j.init(d,b)}},t=m.Utf8={stringify:function(a){try{return decodeURIComponent(escape(p.stringify(a)))}catch(b){throw Error("Malformed UTF-8 data");}},parse:function(a){return p.parse(unescape(encodeURIComponent(a)))}},
11 | q=l.BufferedBlockAlgorithm=f.extend({reset:function(){this._data=new j.init;this._nDataBytes=0},_append:function(a){"string"==typeof a&&(a=t.parse(a));this._data.concat(a);this._nDataBytes+=a.sigBytes},_process:function(a){var b=this._data,d=b.words,c=b.sigBytes,e=this.blockSize,f=c/(4*e),f=a?h.ceil(f):h.max((f|0)-this._minBufferSize,0);a=f*e;c=h.min(4*a,c);if(a){for(var g=0;g
2 |
3 |
4 |
5 |
6 |
7 |
8 |
9 |
10 |
11 |
12 |
13 |
14 |
15 |
16 |
60 |
61 |
62 |
63 |
64 |
65 |
Hashed Data:
51 |
52 | Asset ID:
53 |
54 | Asset Amount:
55 |
56 |
57 |
58 |
--------------------------------------------------------------------------------
/lib/cryptojs v3.1.2/components/mode-cfb.js:
--------------------------------------------------------------------------------
1 | /*
2 | CryptoJS v3.1.2
3 | code.google.com/p/crypto-js
4 | (c) 2009-2013 by Jeff Mott. All rights reserved.
5 | code.google.com/p/crypto-js/wiki/License
6 | */
7 | /**
8 | * Cipher Feedback block mode.
9 | */
10 | CryptoJS.mode.CFB = (function () {
11 | var CFB = CryptoJS.lib.BlockCipherMode.extend();
12 |
13 | CFB.Encryptor = CFB.extend({
14 | processBlock: function (words, offset) {
15 | // Shortcuts
16 | var cipher = this._cipher;
17 | var blockSize = cipher.blockSize;
18 |
19 | generateKeystreamAndEncrypt.call(this, words, offset, blockSize, cipher);
20 |
21 | // Remember this block to use with next block
22 | this._prevBlock = words.slice(offset, offset + blockSize);
23 | }
24 | });
25 |
26 | CFB.Decryptor = CFB.extend({
27 | processBlock: function (words, offset) {
28 | // Shortcuts
29 | var cipher = this._cipher;
30 | var blockSize = cipher.blockSize;
31 |
32 | // Remember this block to use with next block
33 | var thisBlock = words.slice(offset, offset + blockSize);
34 |
35 | generateKeystreamAndEncrypt.call(this, words, offset, blockSize, cipher);
36 |
37 | // This block becomes the previous block
38 | this._prevBlock = thisBlock;
39 | }
40 | });
41 |
42 | function generateKeystreamAndEncrypt(words, offset, blockSize, cipher) {
43 | // Shortcut
44 | var iv = this._iv;
45 |
46 | // Generate keystream
47 | if (iv) {
48 | var keystream = iv.slice(0);
49 |
50 | // Remove IV for subsequent blocks
51 | this._iv = undefined;
52 | } else {
53 | var keystream = this._prevBlock;
54 | }
55 | cipher.encryptBlock(keystream, 0);
56 |
57 | // Encrypt
58 | for (var i = 0; i < blockSize; i++) {
59 | words[offset + i] ^= keystream[i];
60 | }
61 | }
62 |
63 | return CFB;
64 | }());
65 |
--------------------------------------------------------------------------------
/lib/seedrandom/lib/xor128.js:
--------------------------------------------------------------------------------
1 | // A Javascript implementaion of the "xor128" prng algorithm by
2 | // George Marsaglia. See http://www.jstatsoft.org/v08/i14/paper
3 |
4 | (function(global, module, define) {
5 |
6 | function XorGen(seed) {
7 | var me = this, strseed = '';
8 |
9 | me.x = 0;
10 | me.y = 0;
11 | me.z = 0;
12 | me.w = 0;
13 |
14 | // Set up generator function.
15 | me.next = function() {
16 | var t = me.x ^ (me.x << 11);
17 | me.x = me.y;
18 | me.y = me.z;
19 | me.z = me.w;
20 | return me.w ^= (me.w >>> 19) ^ t ^ (t >>> 8);
21 | };
22 |
23 | if (seed === (seed | 0)) {
24 | // Integer seed.
25 | me.x = seed;
26 | } else {
27 | // String seed.
28 | strseed += seed;
29 | }
30 |
31 | // Mix in string seed, then discard an initial batch of 64 values.
32 | for (var k = 0; k < strseed.length + 64; k++) {
33 | me.x ^= strseed.charCodeAt(k) | 0;
34 | me.next();
35 | }
36 | }
37 |
38 | function copy(f, t) {
39 | t.x = f.x;
40 | t.y = f.y;
41 | t.z = f.z;
42 | t.w = f.w;
43 | return t;
44 | }
45 |
46 | function impl(seed, opts) {
47 | var xg = new XorGen(seed),
48 | state = opts && opts.state,
49 | prng = function() { return (xg.next() >>> 0) / 0x100000000; };
50 | prng.double = function() {
51 | do {
52 | var top = xg.next() >>> 11,
53 | bot = (xg.next() >>> 0) / 0x100000000,
54 | result = (top + bot) / (1 << 21);
55 | } while (result === 0);
56 | return result;
57 | };
58 | prng.int32 = xg.next;
59 | prng.quick = prng;
60 | if (state) {
61 | if (typeof(state) == 'object') copy(state, xg);
62 | prng.state = function() { return copy(xg, {}); }
63 | }
64 | return prng;
65 | }
66 |
67 | if (module && module.exports) {
68 | module.exports = impl;
69 | } else if (define && define.amd) {
70 | define(function() { return impl; });
71 | } else {
72 | this.xor128 = impl;
73 | }
74 |
75 | })(
76 | this,
77 | (typeof module) == 'object' && module, // present in node.js
78 | (typeof define) == 'function' && define // present with an AMD loader
79 | );
80 |
81 |
82 |
--------------------------------------------------------------------------------
/lib/cryptojs v3.1.2/components/aes-min.js:
--------------------------------------------------------------------------------
1 | /*
2 | CryptoJS v3.1.2
3 | code.google.com/p/crypto-js
4 | (c) 2009-2013 by Jeff Mott. All rights reserved.
5 | code.google.com/p/crypto-js/wiki/License
6 | */
7 | (function(){for(var q=CryptoJS,x=q.lib.BlockCipher,r=q.algo,j=[],y=[],z=[],A=[],B=[],C=[],s=[],u=[],v=[],w=[],g=[],k=0;256>k;k++)g[k]=128>k?k<<1:k<<1^283;for(var n=0,l=0,k=0;256>k;k++){var f=l^l<<1^l<<2^l<<3^l<<4,f=f>>>8^f&255^99;j[n]=f;y[f]=n;var t=g[n],D=g[t],E=g[D],b=257*g[f]^16843008*f;z[n]=b<<24|b>>>8;A[n]=b<<16|b>>>16;B[n]=b<<8|b>>>24;C[n]=b;b=16843009*E^65537*D^257*t^16843008*n;s[f]=b<<24|b>>>8;u[f]=b<<16|b>>>16;v[f]=b<<8|b>>>24;w[f]=b;n?(n=t^g[g[g[E^t]]],l^=g[g[l]]):n=l=1}var F=[0,1,2,4,8,
8 | 16,32,64,128,27,54],r=r.AES=x.extend({_doReset:function(){for(var c=this._key,e=c.words,a=c.sigBytes/4,c=4*((this._nRounds=a+6)+1),b=this._keySchedule=[],h=0;h
49 |
52 |
53 |
54 |
57 |
58 |
59 |
60 |
61 |
62 |
--------------------------------------------------------------------------------
/lib/chrome-wallet-mod/js/hex2dec-cs.js:
--------------------------------------------------------------------------------
1 | /**
2 | * A function for converting hex <-> dec w/o loss of precision.
3 | *
4 | * The problem is that parseInt("0x12345...") isn't precise enough to convert
5 | * 64-bit integers correctly.
6 | *
7 | * Internally, this uses arrays to encode decimal digits starting with the least
8 | * significant:
9 | * 8 = [8]
10 | * 16 = [6, 1]
11 | * 1024 = [4, 2, 0, 1]
12 | */
13 |
14 | // Adds two arrays for the given base (10 or 16), returning the result.
15 | // This turns out to be the only "primitive" operation we need.
16 | function add(x, y, base) {
17 | var z = [];
18 | var n = Math.max(x.length, y.length);
19 | var carry = 0;
20 | var i = 0;
21 | while (i < n || carry) {
22 | var xi = i < x.length ? x[i] : 0;
23 | var yi = i < y.length ? y[i] : 0;
24 | var zi = carry + xi + yi;
25 | z.push(zi % base);
26 | carry = Math.floor(zi / base);
27 | i++;
28 | }
29 | return z;
30 | }
31 |
32 | // Returns a*x, where x is an array of decimal digits and a is an ordinary
33 | // JavaScript number. base is the number base of the array x.
34 | function multiplyByNumber(num, x, base) {
35 | if (num < 0) return null;
36 | if (num == 0) return [];
37 |
38 | var result = [];
39 | var power = x;
40 | while (true) {
41 | if (num & 1) {
42 | result = add(result, power, base);
43 | }
44 | num = num >> 1;
45 | if (num === 0) break;
46 | power = add(power, power, base);
47 | }
48 |
49 | return result;
50 | }
51 |
52 | function parseToDigitsArray(str, base) {
53 | var digits = str.split('');
54 | var ary = [];
55 | for (var i = digits.length - 1; i >= 0; i--) {
56 | var n = parseInt(digits[i], base);
57 | if (isNaN(n)) return null;
58 | ary.push(n);
59 | }
60 | return ary;
61 | }
62 |
63 | function convertBase(str, fromBase, toBase) {
64 | var digits = parseToDigitsArray(str, fromBase);
65 | if (digits === null) return null;
66 |
67 | var outArray = [];
68 | var power = [1];
69 | for (var i = 0; i < digits.length; i++) {
70 | // invariant: at this point, fromBase^i = power
71 | if (digits[i]) {
72 | outArray = add(outArray, multiplyByNumber(digits[i], power, toBase), toBase);
73 | }
74 | power = multiplyByNumber(fromBase, power, toBase);
75 | }
76 |
77 | var out = '';
78 | for (var i = outArray.length - 1; i >= 0; i--) {
79 | out += outArray[i].toString(toBase);
80 | }
81 | return out;
82 | }
83 |
84 | function decToHex(decStr) {
85 | var hex = convertBase(decStr, 10, 16);
86 | return hex ? '0x' + hex : null;
87 | }
88 |
89 | function hexToDec(hexStr) {
90 | if (hexStr.substring(0, 2) === '0x') hexStr = hexStr.substring(2);
91 | hexStr = hexStr.toLowerCase();
92 | return convertBase(hexStr, 16, 10);
93 | }
--------------------------------------------------------------------------------
/lib/seedrandom/lib/xorshift7.js:
--------------------------------------------------------------------------------
1 | // A Javascript implementaion of the "xorshift7" algorithm by
2 | // François Panneton and Pierre L'ecuyer:
3 | // "On the Xorgshift Random Number Generators"
4 | // http://saluc.engr.uconn.edu/refs/crypto/rng/panneton05onthexorshift.pdf
5 |
6 | (function(global, module, define) {
7 |
8 | function XorGen(seed) {
9 | var me = this;
10 |
11 | // Set up generator function.
12 | me.next = function() {
13 | // Update xor generator.
14 | var X = me.x, i = me.i, t, v, w;
15 | t = X[i]; t ^= (t >>> 7); v = t ^ (t << 24);
16 | t = X[(i + 1) & 7]; v ^= t ^ (t >>> 10);
17 | t = X[(i + 3) & 7]; v ^= t ^ (t >>> 3);
18 | t = X[(i + 4) & 7]; v ^= t ^ (t << 7);
19 | t = X[(i + 7) & 7]; t = t ^ (t << 13); v ^= t ^ (t << 9);
20 | X[i] = v;
21 | me.i = (i + 1) & 7;
22 | return v;
23 | };
24 |
25 | function init(me, seed) {
26 | var j, w, X = [];
27 |
28 | if (seed === (seed | 0)) {
29 | // Seed state array using a 32-bit integer.
30 | w = X[0] = seed;
31 | } else {
32 | // Seed state using a string.
33 | seed = '' + seed;
34 | for (j = 0; j < seed.length; ++j) {
35 | X[j & 7] = (X[j & 7] << 15) ^
36 | (seed.charCodeAt(j) + X[(j + 1) & 7] << 13);
37 | }
38 | }
39 | // Enforce an array length of 8, not all zeroes.
40 | while (X.length < 8) X.push(0);
41 | for (j = 0; j < 8 && X[j] === 0; ++j);
42 | if (j == 8) w = X[7] = -1; else w = X[j];
43 |
44 | me.x = X;
45 | me.i = 0;
46 |
47 | // Discard an initial 256 values.
48 | for (j = 256; j > 0; --j) {
49 | me.next();
50 | }
51 | }
52 |
53 | init(me, seed);
54 | }
55 |
56 | function copy(f, t) {
57 | t.x = f.x.slice();
58 | t.i = f.i;
59 | return t;
60 | }
61 |
62 | function impl(seed, opts) {
63 | if (seed == null) seed = +(new Date);
64 | var xg = new XorGen(seed),
65 | state = opts && opts.state,
66 | prng = function() { return (xg.next() >>> 0) / 0x100000000; };
67 | prng.double = function() {
68 | do {
69 | var top = xg.next() >>> 11,
70 | bot = (xg.next() >>> 0) / 0x100000000,
71 | result = (top + bot) / (1 << 21);
72 | } while (result === 0);
73 | return result;
74 | };
75 | prng.int32 = xg.next;
76 | prng.quick = prng;
77 | if (state) {
78 | if (state.x) copy(state, xg);
79 | prng.state = function() { return copy(xg, {}); }
80 | }
81 | return prng;
82 | }
83 |
84 | if (module && module.exports) {
85 | module.exports = impl;
86 | } else if (define && define.amd) {
87 | define(function() { return impl; });
88 | } else {
89 | this.xorshift7 = impl;
90 | }
91 |
92 | })(
93 | this,
94 | (typeof module) == 'object' && module, // present in node.js
95 | (typeof define) == 'function' && define // present with an AMD loader
96 | );
97 |
98 |
--------------------------------------------------------------------------------
/lib/chrome-wallet-mod/js/apiserver.js:
--------------------------------------------------------------------------------
1 | function getInsightServer() {
2 | var INSIGHT_SERVER = "localbitcoinschain.com";
3 |
4 | console.log("Insight Server: "+INSIGHT_SERVER);
5 |
6 | return INSIGHT_SERVER;
7 |
8 | // $.getJSON( "https://"+INSIGHT_SERVER+"/api/peer", function( data ) {
9 | //
10 | // //console.log(data.connected);
11 | //
12 | // if (data.connected != true) {
13 | //
14 | // INSIGHT_SERVER = "chain.localbitcoins.com";
15 | //
16 | // $.getJSON( "https://"+INSIGHT_SERVER+"/api/peer", function( data ) {
17 | //
18 | // if (data.connected != true) {
19 | //
20 | // INSIGHT_SERVER = "search.bitaccess.ca";
21 | // console.log("Active Insight Server: "+INSIGHT_SERVER);
22 | //
23 | // return INSIGHT_SERVER;
24 | //
25 | // } else {
26 | //
27 | // console.log("Active Insight Server: "+INSIGHT_SERVER);
28 | //
29 | // return INSIGHT_SERVER;
30 | //
31 | // }
32 | //
33 | // });
34 | //
35 | // } else {
36 | //
37 | // console.log("Active Insight Server: "+INSIGHT_SERVER);
38 | //
39 | // return INSIGHT_SERVER;
40 | //
41 | // }
42 | //
43 | // });
44 | }
45 |
46 | //function getInsightServerCallback(callback) {
47 | // var INSIGHT_SERVER = "insight.bitpay.com";
48 | //
49 | // $.getJSON( "https://"+INSIGHT_SERVER+"/api/peer", function( data ) {
50 | //
51 | // console.log(data.connected);
52 | //
53 | // if (data.connected != true) {
54 | //
55 | // INSIGHT_SERVER = "chain.localbitcoins.com";
56 | //
57 | // $.getJSON( "https://"+INSIGHT_SERVER+"/api/peer", function( data ) {
58 | //
59 | // if (data.connected != true) {
60 | //
61 | // INSIGHT_SERVER = "search.bitaccess.ca";
62 | // console.log("Insight Server: "+INSIGHT_SERVER);
63 | //
64 | // callback(INSIGHT_SERVER);
65 | //
66 | // } else {
67 | //
68 | // console.log("Insight Server: "+INSIGHT_SERVER);
69 | //
70 | // callback(INSIGHT_SERVER);
71 | //
72 | // }
73 | //
74 | // });
75 | //
76 | // } else {
77 | //
78 | // console.log("Insight Server: "+INSIGHT_SERVER);
79 | //
80 | // callback(INSIGHT_SERVER);
81 | //
82 | // }
83 | //
84 | // });
85 | //}
86 | //
87 | //
88 |
--------------------------------------------------------------------------------
/lib/cw_address_key_generator/assets/plugins/bootstrap/fonts/WS_FTP.LOG:
--------------------------------------------------------------------------------
1 | 2014.08.26 16:14 B J:\Unify\HTML\assets\plugins\bootstrap\fonts\glyphicons-halflings-regular.eot --> svr3.website.my /BlockScan/wwwroot/unify/assets/plugins/bootstrap/fonts glyphicons-halflings-regular.eot
2 | 2014.08.26 16:14 B J:\Unify\HTML\assets\plugins\bootstrap\fonts\glyphicons-halflings-regular.svg --> svr3.website.my /BlockScan/wwwroot/unify/assets/plugins/bootstrap/fonts glyphicons-halflings-regular.svg
3 | 2014.08.26 16:14 B J:\Unify\HTML\assets\plugins\bootstrap\fonts\glyphicons-halflings-regular.ttf --> svr3.website.my /BlockScan/wwwroot/unify/assets/plugins/bootstrap/fonts glyphicons-halflings-regular.ttf
4 | 2014.08.26 16:14 B J:\Unify\HTML\assets\plugins\bootstrap\fonts\glyphicons-halflings-regular.woff --> svr3.website.my /BlockScan/wwwroot/unify/assets/plugins/bootstrap/fonts glyphicons-halflings-regular.woff
5 | 2014.08.27 00:39 B J:\Unify\HTML\assets\plugins\bootstrap\fonts\WS_FTP.LOG --> svr3.website.my /BlockScan/wwwroot/unify/assets/plugins/bootstrap/fonts WS_FTP.LOG
6 | 2014.08.27 01:13 B J:\BlockScan\assets\plugins\bootstrap\fonts\glyphicons-halflings-regular.eot --> svr3.website.my /BlockScan/wwwroot/assets/plugins/bootstrap/fonts glyphicons-halflings-regular.eot
7 | 2014.08.27 01:13 B J:\BlockScan\assets\plugins\bootstrap\fonts\glyphicons-halflings-regular.svg --> svr3.website.my /BlockScan/wwwroot/assets/plugins/bootstrap/fonts glyphicons-halflings-regular.svg
8 | 2014.08.27 01:13 B J:\BlockScan\assets\plugins\bootstrap\fonts\glyphicons-halflings-regular.ttf --> svr3.website.my /BlockScan/wwwroot/assets/plugins/bootstrap/fonts glyphicons-halflings-regular.ttf
9 | 2014.08.27 01:13 B J:\BlockScan\assets\plugins\bootstrap\fonts\glyphicons-halflings-regular.woff --> svr3.website.my /BlockScan/wwwroot/assets/plugins/bootstrap/fonts glyphicons-halflings-regular.woff
10 | 2014.08.27 01:13 B J:\BlockScan\assets\plugins\bootstrap\fonts\WS_FTP.LOG --> svr3.website.my /BlockScan/wwwroot/assets/plugins/bootstrap/fonts WS_FTP.LOG
11 | 2015.01.01 03:18 B J:\BlockscanSolution\BlockScan\assets\plugins\bootstrap\fonts\glyphicons-halflings-regular.eot --> svr1.bitcoin2u.com /Blockscan/wwwroot/assets/plugins/bootstrap/fonts glyphicons-halflings-regular.eot
12 | 2015.01.01 03:18 B J:\BlockscanSolution\BlockScan\assets\plugins\bootstrap\fonts\glyphicons-halflings-regular.svg --> svr1.bitcoin2u.com /Blockscan/wwwroot/assets/plugins/bootstrap/fonts glyphicons-halflings-regular.svg
13 | 2015.01.01 03:18 B J:\BlockscanSolution\BlockScan\assets\plugins\bootstrap\fonts\glyphicons-halflings-regular.ttf --> svr1.bitcoin2u.com /Blockscan/wwwroot/assets/plugins/bootstrap/fonts glyphicons-halflings-regular.ttf
14 | 2015.01.01 03:18 B J:\BlockscanSolution\BlockScan\assets\plugins\bootstrap\fonts\glyphicons-halflings-regular.woff --> svr1.bitcoin2u.com /Blockscan/wwwroot/assets/plugins/bootstrap/fonts glyphicons-halflings-regular.woff
15 | 2015.01.01 03:18 B J:\BlockscanSolution\BlockScan\assets\plugins\bootstrap\fonts\WS_FTP.LOG --> svr1.bitcoin2u.com /Blockscan/wwwroot/assets/plugins/bootstrap/fonts WS_FTP.LOG
16 |
--------------------------------------------------------------------------------
/lib/seedrandom/lib/tychei.js:
--------------------------------------------------------------------------------
1 | // A Javascript implementaion of the "Tyche-i" prng algorithm by
2 | // Samuel Neves and Filipe Araujo.
3 | // See https://eden.dei.uc.pt/~sneves/pubs/2011-snfa2.pdf
4 |
5 | (function(global, module, define) {
6 |
7 | function XorGen(seed) {
8 | var me = this, strseed = '';
9 |
10 | // Set up generator function.
11 | me.next = function() {
12 | var b = me.b, c = me.c, d = me.d, a = me.a;
13 | b = (b << 25) ^ (b >>> 7) ^ c;
14 | c = (c - d) | 0;
15 | d = (d << 24) ^ (d >>> 8) ^ a;
16 | a = (a - b) | 0;
17 | me.b = b = (b << 20) ^ (b >>> 12) ^ c;
18 | me.c = c = (c - d) | 0;
19 | me.d = (d << 16) ^ (c >>> 16) ^ a;
20 | return me.a = (a - b) | 0;
21 | };
22 |
23 | /* The following is non-inverted tyche, which has better internal
24 | * bit diffusion, but which is about 25% slower than tyche-i in JS.
25 | me.next = function() {
26 | var a = me.a, b = me.b, c = me.c, d = me.d;
27 | a = (me.a + me.b | 0) >>> 0;
28 | d = me.d ^ a; d = d << 16 ^ d >>> 16;
29 | c = me.c + d | 0;
30 | b = me.b ^ c; b = b << 12 ^ d >>> 20;
31 | me.a = a = a + b | 0;
32 | d = d ^ a; me.d = d = d << 8 ^ d >>> 24;
33 | me.c = c = c + d | 0;
34 | b = b ^ c;
35 | return me.b = (b << 7 ^ b >>> 25);
36 | }
37 | */
38 |
39 | me.a = 0;
40 | me.b = 0;
41 | me.c = 2654435769 | 0;
42 | me.d = 1367130551;
43 |
44 | if (seed === Math.floor(seed)) {
45 | // Integer seed.
46 | me.a = (seed / 0x100000000) | 0;
47 | me.b = seed | 0;
48 | } else {
49 | // String seed.
50 | strseed += seed;
51 | }
52 |
53 | // Mix in string seed, then discard an initial batch of 64 values.
54 | for (var k = 0; k < strseed.length + 20; k++) {
55 | me.b ^= strseed.charCodeAt(k) | 0;
56 | me.next();
57 | }
58 | }
59 |
60 | function copy(f, t) {
61 | t.a = f.a;
62 | t.b = f.b;
63 | t.c = f.c;
64 | t.d = f.d;
65 | return t;
66 | };
67 |
68 | function impl(seed, opts) {
69 | var xg = new XorGen(seed),
70 | state = opts && opts.state,
71 | prng = function() { return (xg.next() >>> 0) / 0x100000000; };
72 | prng.double = function() {
73 | do {
74 | var top = xg.next() >>> 11,
75 | bot = (xg.next() >>> 0) / 0x100000000,
76 | result = (top + bot) / (1 << 21);
77 | } while (result === 0);
78 | return result;
79 | };
80 | prng.int32 = xg.next;
81 | prng.quick = prng;
82 | if (state) {
83 | if (typeof(state) == 'object') copy(state, xg);
84 | prng.state = function() { return copy(xg, {}); }
85 | }
86 | return prng;
87 | }
88 |
89 | if (module && module.exports) {
90 | module.exports = impl;
91 | } else if (define && define.amd) {
92 | define(function() { return impl; });
93 | } else {
94 | this.tychei = impl;
95 | }
96 |
97 | })(
98 | this,
99 | (typeof module) == 'object' && module, // present in node.js
100 | (typeof define) == 'function' && define // present with an AMD loader
101 | );
102 |
103 |
104 |
--------------------------------------------------------------------------------
/lib/cryptojs v3.1.2/components/md5-min.js:
--------------------------------------------------------------------------------
1 | /*
2 | CryptoJS v3.1.2
3 | code.google.com/p/crypto-js
4 | (c) 2009-2013 by Jeff Mott. All rights reserved.
5 | code.google.com/p/crypto-js/wiki/License
6 | */
7 | (function(E){function h(a,f,g,j,p,h,k){a=a+(f&g|~f&j)+p+k;return(a<Review Token Information
48 |
49 |
52 |
63 |
64 |
--------------------------------------------------------------------------------
/lib/chrome-wallet-mod/issue-tx-wt.html:
--------------------------------------------------------------------------------
1 |
2 |
3 |
4 |
5 | Review Token Information
48 |
49 |
52 |
63 |
64 |
--------------------------------------------------------------------------------
/lib/cryptojs v3.1.2/components/core-min.js:
--------------------------------------------------------------------------------
1 | /*
2 | CryptoJS v3.1.2
3 | code.google.com/p/crypto-js
4 | (c) 2009-2013 by Jeff Mott. All rights reserved.
5 | code.google.com/p/crypto-js/wiki/License
6 | */
7 | var CryptoJS=CryptoJS||function(h,r){var k={},l=k.lib={},n=function(){},f=l.Base={extend:function(a){n.prototype=this;var b=new n;a&&b.mixIn(a);b.hasOwnProperty("init")||(b.init=function(){b.$super.init.apply(this,arguments)});b.init.prototype=b;b.$super=this;return b},create:function(){var a=this.extend();a.init.apply(a,arguments);return a},init:function(){},mixIn:function(a){for(var b in a)a.hasOwnProperty(b)&&(this[b]=a[b]);a.hasOwnProperty("toString")&&(this.toString=a.toString)},clone:function(){return this.init.prototype.extend(this)}},
8 | j=l.WordArray=f.extend({init:function(a,b){a=this.words=a||[];this.sigBytes=b!=r?b:4*a.length},toString:function(a){return(a||s).stringify(this)},concat:function(a){var b=this.words,d=a.words,c=this.sigBytes;a=a.sigBytes;this.clamp();if(c%4)for(var e=0;eCreate XCP Asset Send - BTC Raw Transaction
66 |Use https://blockchain.info/pushtx to broadcast a raw transaction to the Bitcoin network
67 | Mnemonic Passphrase (12 words)
68 |
69 |
70 | Sending Address
71 |
72 |
73 | Receiving Address
74 |
75 |
76 | Asset
77 |
78 |
79 | Send Amount
80 |
81 |
82 | Divisible
83 |
84 |
85 |
86 |
87 |
88 |
89 |
90 |
91 |
92 |
93 |
94 |
95 |
96 |
--------------------------------------------------------------------------------
/lib/chrome-wallet-mod/js/xcp-js/decode.js:
--------------------------------------------------------------------------------
1 |
2 | function get_xcp_encoded(tx_id, callback) {
3 |
4 | var source_html = "https://blockchain.info/rawtx/"+tx_id+"?format=json&cors=true";
5 |
6 | var target_tx = new Array();
7 |
8 | $.getJSON( source_html, function( target_tx ) {
9 |
10 | var tx_index = target_tx.inputs[0].prev_out.tx_index;
11 |
12 | //console.log(tx_index);
13 |
14 | $.each(target_tx['out'], function(i, item) {
15 |
16 | if ("addr3" in target_tx['out'][i]){
17 | var target_script = target_tx['out'][i].script;
18 | var haystack = target_script;
19 |
20 | //address_from_pubkeyhash(haystack.substring(70, 4));
21 |
22 | var finddata = haystack.substring(68, 6);
23 |
24 | finddata += haystack.substring(136, 74);
25 |
26 | var xcp_pubkey_data = finddata;
27 |
28 | console.log(xcp_pubkey_data);
29 |
30 | var source_html_tx_index = "https://blockchain.info/tx-index/"+tx_index+"?format=json&cors=true";
31 |
32 | $.getJSON( source_html_tx_index, xcp_pubkey_data, function( data ) {
33 |
34 | //console.log(data.hash);
35 | //console.log(xcp_pubkey_data);
36 |
37 | var xcp_decoded = xcp_rc4(data.hash, xcp_pubkey_data);
38 |
39 | callback(data.hash, xcp_decoded);
40 |
41 | });
42 |
43 | }
44 |
45 |
46 | });
47 |
48 | });
49 |
50 | }
51 |
52 | function get_xcp_encoded_opreturn(tx_id, callback) {
53 |
54 |
55 | var source_html = "https://chain.so/api/v2/get_tx/BTC/"+tx_id;
56 | //var source_html = "https://blockchain.info/rawtx/"+tx_id+"?format=json&cors=true";
57 |
58 | var target_tx = new Array();
59 |
60 | $.getJSON( source_html, function( target_tx ) {
61 |
62 | var tx_index = target_tx.data.inputs[0].from_output.txid;
63 | //var tx_index = target_tx.inputs[0].prev_out.tx_index;
64 |
65 | //console.log(tx_index);
66 |
67 | $.each(target_tx.data.outputs, function(i, item) {
68 |
69 | if ((target_tx.data.outputs[i].address == "nonstandard")){
70 | var target_script = target_tx.data.outputs[i].script;
71 | var xcp_pubkey_data = target_script.substring(10);
72 |
73 |
74 |
75 | var source_html_tx_index = "https://chain.so/api/v2/get_tx/BTC/"+tx_index;
76 |
77 | $.getJSON( source_html_tx_index, xcp_pubkey_data, function( data ) {
78 |
79 | //console.log(data.hash);
80 | //console.log(xcp_pubkey_data);
81 |
82 | var xcp_decoded = xcp_rc4(data.data.txid, xcp_pubkey_data);
83 |
84 | xcp_decoded = "1c"+xcp_decoded; //add first byte to simulate OP_CHECKMULTISIG
85 |
86 | callback(data.data.txid, xcp_decoded);
87 |
88 | });
89 |
90 | }
91 |
92 |
93 | });
94 |
95 | });
96 |
97 | }
98 |
99 |
100 |
--------------------------------------------------------------------------------
/README.md:
--------------------------------------------------------------------------------
1 | # CounterTools
2 | CounterTools is a modular JavaScript Bitcoin and Counterparty GUI Wallet.
3 |
4 | Download the zip file, extract the directory and open index.html. Follow instructions in the GUI.
5 |
6 | ## Disclaimer
7 | The wallet is not actively maintained. Bugs and loss of funds may occur. No warranty. For development use only.
8 |
9 | ## Features
10 | - Send BTC, XCP and assets
11 | - View BTC, XCP and asset balances
12 | - Counterwallet compatible passphrase
13 | - Encrypt wallet
14 | - Send to an alias (converts to asset owner address)
15 | - Send to many from a list
16 | - Send any amount of BTC together with asset
17 | - Register alphabetic or numeric asset
18 | - Register anchored asset (numeric asset which is hash of description)
19 | - Register assets in bulk
20 | - Instant asset search
21 | - Broadcast text or bet
22 | - Make many broadcasts from a list
23 | - Notarize a file (broadcast file's SHA256 hash)
24 | - Generate new passphrase
25 | - Generate passphrase with vanity addresses
26 | - Repair a broken passphrase
27 | - Generate paper wallet
28 | - Export keys (all passphrase tools can be used on offline computer)
29 | - YouTube module with relevant Counterparty videos
30 | - Customizable design, menu and modules
31 | - Developer guide
32 |
33 | ## Use Cases
34 |
35 | #### Wallet
36 | The wallet can be used out of the box. It is meant to complement Counterwallet, Chrome Wallet and IndieSquare. The same passphrase can be used in every wallet. The advantages of this wallet are
37 | - All files are stored locally
38 | - No installation (only edit a text file)
39 | - Can run from a USB drive or CD rom
40 | - Fees can be custom set
41 | - Can send to alias (asset owner)
42 | - Supports anchored assets
43 | - Quick links to block explorers
44 |
45 | DEX support and history will be added shortly.
46 |
47 | #### Toolbox
48 | - The send tools make it easy to send, register assets and make broadcasts from a text list.
49 | - The passphrase tools require no Internet access, thus is a safe way to generate keys.
50 |
51 | #### Skeleton for other projects
52 | - Fork this project and make your own design.
53 |
54 | #### Framework for 3rd party addons
55 | - Rename `template.html` and start building your own plugin immediately.
56 | - A module is only HTML5 and JavaScript.
57 | - Find useful functions in `developer.html`.
58 | - Finally just add a reference to your module in `settings/menu.txt`.
59 |
60 | #### Library for other Counterparty projects
61 | - `lib/xcp-toolbox` contatins heaps of useful functions for passphrases, asset validations, API calls, etc.
62 | - `lib/chrome-wallet-mod` is a modified version of Chrome Wallet's library. Redundant API calls, error checks, and user feedback are added.
63 |
64 | ## Credits
65 | - Joe Looney for his open source [Chrome Extension] (https://github.com/loon3/XCP-Wallet/tree/master/Chrome-Extension).
66 | - Blockscan for Counterparty APIs.
67 | - CounterpartyChain (CoinDaddy) for APIs.
68 | - And the thousands of contributors to codes that this project runs on.
69 |
70 | ## Licence
71 | Free Public License 1.0.0
72 | Permission to use, copy, modify, and/or distribute this software for any purpose with or without fee is hereby granted.
73 | THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
74 |
75 |
76 |
--------------------------------------------------------------------------------