start to split into node commonjs style modules

- no longer is the global Bitcoin used for modules
- cleaner and more maintainable code
- add more tests

package.json

@@ -2,6 +2,7 @@
   "name": "bitcoinjs-lib",
   "version": "0.1.3",
   "description": "Client-side Bitcoin JavaScript library",
+  "main": "./src/index.js",
 
   "keywords": [
     "bitcoin",
@@ -18,7 +19,10 @@
   },
 
   "devDependencies" : {
-    "pkginfo" : ">=0.2.1",
+    "mocha": "1.8.1"
-    "jake-uglify" : ">=1.0.0"
+  },
+
+  "scripts": {
+    "test": "mocha test/*.js"
   }
 }

src/address.js

@@ -1,6 +1,20 @@
-Bitcoin.Address = function (bytes) {
+var base58 = require('./base58');
-  if ("string" == typeof bytes) {
+var Crypto = require('./crypto-js/crypto');
-    bytes = Bitcoin.Address.decodeString(bytes);
+var conv = require('./convert');
+
+var address_types = {
+    prod: 0,
+    testnet: 111
+};
+
+var p2sh_types = {
+    prod: 5,
+    testnet: 196
+};
+
+var Address = function (bytes) {
+  if (typeof bytes === 'string') {
+    bytes = Address.decodeString(bytes);
   }
   this.hash = bytes;
 
@@ -12,7 +26,7 @@ Bitcoin.Address = function (bytes) {
  *
  * Returns the address as a base58-encoded string in the standardized format.
  */
-Bitcoin.Address.prototype.toString = function () {
+Address.prototype.toString = function () {
   // Get a copy of the hash
   var hash = this.hash.slice(0);
 
@@ -23,18 +37,46 @@ Bitcoin.Address.prototype.toString = function () {
 
   var bytes = hash.concat(checksum.slice(0,4));
 
-  return Bitcoin.Base58.encode(bytes);
+  return base58.encode(bytes);
+};
+
+Address.prototype.getHashBase64 = function () {
+  return conv.bytesToBase64(this.hash);
 };
 
-Bitcoin.Address.prototype.getHashBase64 = function () {
+// TODO(shtylman) isValid?
-  return Crypto.util.bytesToBase64(this.hash);
+Address.validate = function(string, type) {
+  try {
+    var bytes = base58.decode(string);
+  } catch (e) {
+    return false;
+  }
+
+  var hash = bytes.slice(0, 21);
+
+  var checksum = Crypto.SHA256(Crypto.SHA256(hash, {asBytes: true}), {asBytes: true});
+
+  if (checksum[0] != bytes[21] ||
+      checksum[1] != bytes[22] ||
+      checksum[2] != bytes[23] ||
+      checksum[3] != bytes[24]) {
+    return false;
+  }
+
+  var version = hash[0];
+
+  if (type && version !== address_types[type] && version !== p2sh_types[type]) {
+    return false;
+  }
+
+  return true;
 };
 
 /**
  * Parse a Bitcoin address contained in a string.
  */
-Bitcoin.Address.decodeString = function (string) {
+Address.decodeString = function (string) {
-  var bytes = Bitcoin.Base58.decode(string);
+  var bytes = base58.decode(string);
 
   var hash = bytes.slice(0, 21);
 
@@ -44,14 +86,16 @@ Bitcoin.Address.decodeString = function (string) {
       checksum[1] != bytes[22] ||
       checksum[2] != bytes[23] ||
       checksum[3] != bytes[24]) {
-    throw "Checksum validation failed!";
+    throw new Error('Address Checksum validation failed: ' + string);
   }
 
   var version = hash.shift();
-
+  // TODO(shtylman) allow for specific version decoding same as validate above
   if (version != 0) {
-    throw "Version "+version+" not supported!";
+    throw new Error('Address version not supported: ' + string);
   }
 
   return hash;
 };
+
+module.exports = Address;

src/base58.js

@@ -1,71 +1,78 @@
-(function (Bitcoin) {
+
-  Bitcoin.Base58 = {
+// https://en.bitcoin.it/wiki/Base58Check_encoding
-    alphabet: "123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz",
+
-    validRegex: /^[1-9A-HJ-NP-Za-km-z]+$/,
+var BigInteger = require('./jsbn/jsbn');
-    base: BigInteger.valueOf(58),
+
-
+var alphabet = "123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz";
-    /**
+var base = BigInteger.valueOf(58);
-     * Convert a byte array to a base58-encoded string.
+
-     *
+var positions = {};
-     * Written by Mike Hearn for BitcoinJ.
+for (var i=0 ; i < alphabet.length ; ++i) {
-     *   Copyright (c) 2011 Google Inc.
+    positions[alphabet[i]] = i;
-     *
+}
-     * Ported to JavaScript by Stefan Thomas.
+
-     */
+// Convert a byte array to a base58-encoded string.
-    encode: function (input) {
+// Written by Mike Hearn for BitcoinJ.
+//   Copyright (c) 2011 Google Inc.
+// Ported to JavaScript by Stefan Thomas.
+module.exports.encode = function (input) {
     var bi = BigInteger.fromByteArrayUnsigned(input);
     var chars = [];
 
-      while (bi.compareTo(B58.base) >= 0) {
+    while (bi.compareTo(base) >= 0) {
-        var mod = bi.mod(B58.base);
+        var mod = bi.mod(base);
-        chars.unshift(B58.alphabet[mod.intValue()]);
+        chars.push(alphabet[mod.intValue()]);
-        bi = bi.subtract(mod).divide(B58.base);
+        bi = bi.subtract(mod).divide(base);
     }
-      chars.unshift(B58.alphabet[bi.intValue()]);
+    chars.push(alphabet[bi.intValue()]);
 
     // Convert leading zeros too.
     for (var i = 0; i < input.length; i++) {
         if (input[i] == 0x00) {
-          chars.unshift(B58.alphabet[0]);
+            chars.push(alphabet[0]);
         } else break;
     }
 
-      return chars.join('');
+    return chars.reverse().join('');
 },
 
-    /**
+// decode a base58 string into a byte array
-     * Convert a base58-encoded string to a byte array.
+// input should be a base58 encoded string
-     *
+// @return Array
-     * Written by Mike Hearn for BitcoinJ.
+module.exports.decode = function (input) {
-     *   Copyright (c) 2011 Google Inc.
+
-     *
+  var base = BigInteger.valueOf(58);
-     * Ported to JavaScript by Stefan Thomas.
+
-     */
+  var length = input.length;
-    decode: function (input) {
+  var num = BigInteger.valueOf(0);
-      var bi = BigInteger.valueOf(0);
+  var leading_zero = 0;
-      var leadingZerosNum = 0;
+  var seen_other = false;
-      for (var i = input.length - 1; i >= 0; i--) {
+  for (var i=0; i<length ; ++i) {
-        var alphaIndex = B58.alphabet.indexOf(input[i]);
+      var char = input[i];
-        if (alphaIndex < 0) {
+      var p = positions[char];
-          throw "Invalid character";
+
+      // if we encounter an invalid character, decoding fails
+      if (p === undefined) {
+          throw new Error('invalid base58 string: ' + input);
       }
-        bi = bi.add(BigInteger.valueOf(alphaIndex)
-                    .multiply(B58.base.pow(input.length - 1 -i)));
 
-        // This counts leading zero bytes
+      num = num.multiply(base).add(BigInteger.valueOf(p));
-        if (input[i] == "1") leadingZerosNum++;
+
-        else leadingZerosNum = 0;
+      if (char == '1' && !seen_other) {
+          ++leading_zero;
+      }
+      else {
+          seen_other = true;
       }
-      var bytes = bi.toByteArrayUnsigned();
+  }
+
+  var bytes = num.toByteArrayUnsigned();
 
-      // Add leading zeros
+  // remove leading zeros
-      while (leadingZerosNum-- > 0) bytes.unshift(0);
+  while (leading_zero-- > 0) {
+      bytes.unshift(0);
+  }
 
   return bytes;
 }
-  };
 
-  var B58 = Bitcoin.Base58;
-})(
-  'undefined' != typeof Bitcoin ? Bitcoin : module.exports
-);

src/bitcoin.js

@@ -1,13 +1,3 @@
-(function (exports) {
-  var Bitcoin = exports;
-
-  if ('object' !== typeof module) {
-    Bitcoin.EventEmitter = EventEmitter;
-  }
-})(
-  'object' === typeof module ? module.exports : (window.Bitcoin = {})
-);
-
 /*
   function makeKeypair()
   {

src/convert.js

@@ -0,0 +1,59 @@
+// convert to/from various values
+
+var base64map = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
+
+// Convert a byte array to a hex string
+module.exports.bytesToHex = function(bytes) {
+		for (var hex = [], i = 0; i < bytes.length; i++) {
+			hex.push((bytes[i] >>> 4).toString(16));
+			hex.push((bytes[i] & 0xF).toString(16));
+		}
+		return hex.join("");
+};
+
+// Convert a hex string to a byte array
+module.exports.hexToBytes = function(hex) {
+		for (var bytes = [], c = 0; c < hex.length; c += 2)
+			bytes.push(parseInt(hex.substr(c, 2), 16));
+		return bytes;
+}
+
+	// Convert a byte array to a base-64 string
+module.exports.bytesToBase64 = function(bytes) {
+		// Use browser-native function if it exists
+		if (typeof btoa == "function") return btoa(Binary.bytesToString(bytes));
+
+		for(var base64 = [], i = 0; i < bytes.length; i += 3) {
+			var triplet = (bytes[i] << 16) | (bytes[i + 1] << 8) | bytes[i + 2];
+			for (var j = 0; j < 4; j++) {
+				if (i * 8 + j * 6 <= bytes.length * 8)
+					base64.push(base64map.charAt((triplet >>> 6 * (3 - j)) & 0x3F));
+				else base64.push("=");
+			}
+		}
+
+		return base64.join("");
+}
+
+
+	// Convert a base-64 string to a byte array
+module.exports.base64ToBytes = function(base64) {
+		// Use browser-native function if it exists
+		if (typeof atob == "function") return Binary.stringToBytes(atob(base64));
+
+		// Remove non-base-64 characters
+		base64 = base64.replace(/[^A-Z0-9+\/]/ig, "");
+
+		for (var bytes = [], i = 0, imod4 = 0; i < base64.length; imod4 = ++i % 4) {
+			if (imod4 == 0) continue;
+			bytes.push(((base64map.indexOf(base64.charAt(i - 1)) & (Math.pow(2, -2 * imod4 + 8) - 1)) << (imod4 * 2)) |
+			           (base64map.indexOf(base64.charAt(i)) >>> (6 - imod4 * 2)));
+		}
+
+		return bytes;
+}
+
+// utf8 and binary?
+//stringToBytes
+//bytesToString
+

src/crypto-js/crypto-min.js

@@ -1,7 +0,0 @@
-/*
- * Crypto-JS v2.0.0
- * http://code.google.com/p/crypto-js/
- * Copyright (c) 2009, Jeff Mott. All rights reserved.
- * http://code.google.com/p/crypto-js/wiki/License
- */
-(function(){var c="ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";var d=window.Crypto={};var a=d.util={rotl:function(h,g){return(h<<g)|(h>>>(32-g))},rotr:function(h,g){return(h<<(32-g))|(h>>>g)},endian:function(h){if(h.constructor==Number){return a.rotl(h,8)&16711935|a.rotl(h,24)&4278255360}for(var g=0;g<h.length;g++){h[g]=a.endian(h[g])}return h},randomBytes:function(h){for(var g=[];h>0;h--){g.push(Math.floor(Math.random()*256))}return g},bytesToWords:function(h){for(var k=[],j=0,g=0;j<h.length;j++,g+=8){k[g>>>5]|=h[j]<<(24-g%32)}return k},wordsToBytes:function(i){for(var h=[],g=0;g<i.length*32;g+=8){h.push((i[g>>>5]>>>(24-g%32))&255)}return h},bytesToHex:function(g){for(var j=[],h=0;h<g.length;h++){j.push((g[h]>>>4).toString(16));j.push((g[h]&15).toString(16))}return j.join("")},hexToBytes:function(h){for(var g=[],i=0;i<h.length;i+=2){g.push(parseInt(h.substr(i,2),16))}return g},bytesToBase64:function(h){if(typeof btoa=="function"){return btoa(e.bytesToString(h))}for(var g=[],l=0;l<h.length;l+=3){var m=(h[l]<<16)|(h[l+1]<<8)|h[l+2];for(var k=0;k<4;k++){if(l*8+k*6<=h.length*8){g.push(c.charAt((m>>>6*(3-k))&63))}else{g.push("=")}}}return g.join("")},base64ToBytes:function(h){if(typeof atob=="function"){return e.stringToBytes(atob(h))}h=h.replace(/[^A-Z0-9+\/]/ig,"");for(var g=[],j=0,k=0;j<h.length;k=++j%4){if(k==0){continue}g.push(((c.indexOf(h.charAt(j-1))&(Math.pow(2,-2*k+8)-1))<<(k*2))|(c.indexOf(h.charAt(j))>>>(6-k*2)))}return g}};d.mode={};var b=d.charenc={};var f=b.UTF8={stringToBytes:function(g){return e.stringToBytes(unescape(encodeURIComponent(g)))},bytesToString:function(g){return decodeURIComponent(escape(e.bytesToString(g)))}};var e=b.Binary={stringToBytes:function(j){for(var g=[],h=0;h<j.length;h++){g.push(j.charCodeAt(h))}return g},bytesToString:function(g){for(var j=[],h=0;h<g.length;h++){j.push(String.fromCharCode(g[h]))}return j.join("")}}})();

src/crypto-js/crypto.js

@@ -4,42 +4,13 @@
  * Copyright (c) 2009, Jeff Mott. All rights reserved.
  * http://code.google.com/p/crypto-js/wiki/License
  */
-(function(){
-
-var base64map = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
 
 // Global Crypto object
-var Crypto = window.Crypto = {};
+var Crypto = module.exports = {};
 
 // Crypto utilities
 var util = Crypto.util = {
 
-	// Bit-wise rotate left
-	rotl: function (n, b) {
-		return (n << b) | (n >>> (32 - b));
-	},
-
-	// Bit-wise rotate right
-	rotr: function (n, b) {
-		return (n << (32 - b)) | (n >>> b);
-	},
-
-	// Swap big-endian to little-endian and vice versa
-	endian: function (n) {
-
-		// If number given, swap endian
-		if (n.constructor == Number) {
-			return util.rotl(n,  8) & 0x00FF00FF |
-			       util.rotl(n, 24) & 0xFF00FF00;
-		}
-
-		// Else, assume array and swap all items
-		for (var i = 0; i < n.length; i++)
-			n[i] = util.endian(n[i]);
-		return n;
-
-	},
-
 	// Generate an array of any length of random bytes
 	randomBytes: function (n) {
 		for (var bytes = []; n > 0; n--)
@@ -47,74 +18,6 @@ var util = Crypto.util = {
 		return bytes;
 	},
 
-	// Convert a byte array to big-endian 32-bit words
-	bytesToWords: function (bytes) {
-		for (var words = [], i = 0, b = 0; i < bytes.length; i++, b += 8)
-			words[b >>> 5] |= bytes[i] << (24 - b % 32);
-		return words;
-	},
-
-	// Convert big-endian 32-bit words to a byte array
-	wordsToBytes: function (words) {
-		for (var bytes = [], b = 0; b < words.length * 32; b += 8)
-			bytes.push((words[b >>> 5] >>> (24 - b % 32)) & 0xFF);
-		return bytes;
-	},
-
-	// Convert a byte array to a hex string
-	bytesToHex: function (bytes) {
-		for (var hex = [], i = 0; i < bytes.length; i++) {
-			hex.push((bytes[i] >>> 4).toString(16));
-			hex.push((bytes[i] & 0xF).toString(16));
-		}
-		return hex.join("");
-	},
-
-	// Convert a hex string to a byte array
-	hexToBytes: function (hex) {
-		for (var bytes = [], c = 0; c < hex.length; c += 2)
-			bytes.push(parseInt(hex.substr(c, 2), 16));
-		return bytes;
-	},
-
-	// Convert a byte array to a base-64 string
-	bytesToBase64: function (bytes) {
-
-		// Use browser-native function if it exists
-		if (typeof btoa == "function") return btoa(Binary.bytesToString(bytes));
-
-		for(var base64 = [], i = 0; i < bytes.length; i += 3) {
-			var triplet = (bytes[i] << 16) | (bytes[i + 1] << 8) | bytes[i + 2];
-			for (var j = 0; j < 4; j++) {
-				if (i * 8 + j * 6 <= bytes.length * 8)
-					base64.push(base64map.charAt((triplet >>> 6 * (3 - j)) & 0x3F));
-				else base64.push("=");
-			}
-		}
-
-		return base64.join("");
-
-	},
-
-	// Convert a base-64 string to a byte array
-	base64ToBytes: function (base64) {
-
-		// Use browser-native function if it exists
-		if (typeof atob == "function") return Binary.stringToBytes(atob(base64));
-
-		// Remove non-base-64 characters
-		base64 = base64.replace(/[^A-Z0-9+\/]/ig, "");
-
-		for (var bytes = [], i = 0, imod4 = 0; i < base64.length; imod4 = ++i % 4) {
-			if (imod4 == 0) continue;
-			bytes.push(((base64map.indexOf(base64.charAt(i - 1)) & (Math.pow(2, -2 * imod4 + 8) - 1)) << (imod4 * 2)) |
-			           (base64map.indexOf(base64.charAt(i)) >>> (6 - imod4 * 2)));
-		}
-
-		return bytes;
-
-	}
-
 };
 
 // Crypto mode namespace
@@ -157,4 +60,5 @@ var Binary = charenc.Binary = {
 
 };
 
-})();
+module.exports.SHA256 = require('./sha256');
+module.exports.RIPEMD160 = require('./ripemd160');

src/crypto-js/ripemd160.js

@@ -13,7 +13,8 @@
  * Ported to Crypto-JS by Stefan Thomas.
  */
 
-(function () {
+var Crypto = require('./crypto');
+
 	// Shortcuts
 	var C = Crypto,
     util = C.util,
@@ -22,7 +23,7 @@
     Binary = charenc.Binary;
 
 	// Convert a byte array to little-endian 32-bit words
-	util.bytesToLWords = function (bytes) {
+	var bytesToLWords = function (bytes) {
 
 		var output = Array(bytes.length >> 2);
 		for (var i = 0; i < output.length; i++)
@@ -33,7 +34,7 @@
 	};
 
 	// Convert little-endian 32-bit words to a byte array
-	util.lWordsToBytes = function (words) {
+	var lWordsToBytes = function (words) {
 		var output = [];
 		for (var i = 0; i < words.length * 32; i += 8)
 			output.push((words[i>>5] >>> (i % 32)) & 0xff);
@@ -42,7 +43,7 @@
 
 	// Public API
 	var RIPEMD160 = C.RIPEMD160 = function (message, options) {
-		var digestbytes = util.lWordsToBytes(RIPEMD160._rmd160(message));
+		var digestbytes = lWordsToBytes(RIPEMD160._rmd160(message));
 		return options && options.asBytes ? digestbytes :
 			options && options.asString ? Binary.bytesToString(digestbytes) :
 			util.bytesToHex(digestbytes);
@@ -54,7 +55,7 @@
 		// Convert to byte array
 		if (message.constructor == String) message = UTF8.stringToBytes(message);
 
-		var x = util.bytesToLWords(message),
+		var x = bytesToLWords(message),
 		    len = message.length * 8;
 
 		/* append padding */
@@ -167,4 +168,5 @@
 	{
 		return (num << cnt) | (num >>> (32 - cnt));
 	}
-})();
+
+	module.exports = RIPEMD160

src/crypto-js/sha256-min.js

@@ -1,7 +0,0 @@
-/*
- * Crypto-JS v2.0.0
- * http://code.google.com/p/crypto-js/
- * Copyright (c) 2009, Jeff Mott. All rights reserved.
- * http://code.google.com/p/crypto-js/wiki/License
- */
-(function(){var g=Crypto,b=g.util,c=g.charenc,f=c.UTF8,e=c.Binary;var a=[1116352408,1899447441,3049323471,3921009573,961987163,1508970993,2453635748,2870763221,3624381080,310598401,607225278,1426881987,1925078388,2162078206,2614888103,3248222580,3835390401,4022224774,264347078,604807628,770255983,1249150122,1555081692,1996064986,2554220882,2821834349,2952996808,3210313671,3336571891,3584528711,113926993,338241895,666307205,773529912,1294757372,1396182291,1695183700,1986661051,2177026350,2456956037,2730485921,2820302411,3259730800,3345764771,3516065817,3600352804,4094571909,275423344,430227734,506948616,659060556,883997877,958139571,1322822218,1537002063,1747873779,1955562222,2024104815,2227730452,2361852424,2428436474,2756734187,3204031479,3329325298];var d=g.SHA256=function(j,h){var i=b.wordsToBytes(d._sha256(j));return h&&h.asBytes?i:h&&h.asString?e.bytesToString(i):b.bytesToHex(i)};d._sha256=function(q){if(q.constructor==String){q=f.stringToBytes(q)}var y=b.bytesToWords(q),z=q.length*8,r=[1779033703,3144134277,1013904242,2773480762,1359893119,2600822924,528734635,1541459225],s=[],K,J,I,G,F,E,D,C,B,A,p,o;y[z>>5]|=128<<(24-z%32);y[((z+64>>9)<<4)+15]=z;for(var B=0;B<y.length;B+=16){K=r[0];J=r[1];I=r[2];G=r[3];F=r[4];E=r[5];D=r[6];C=r[7];for(var A=0;A<64;A++){if(A<16){s[A]=y[A+B]}else{var n=s[A-15],u=s[A-2],M=((n<<25)|(n>>>7))^((n<<14)|(n>>>18))^(n>>>3),L=((u<<15)|(u>>>17))^((u<<13)|(u>>>19))^(u>>>10);s[A]=M+(s[A-7]>>>0)+L+(s[A-16]>>>0)}var t=F&E^~F&D,k=K&J^K&I^J&I,x=((K<<30)|(K>>>2))^((K<<19)|(K>>>13))^((K<<10)|(K>>>22)),v=((F<<26)|(F>>>6))^((F<<21)|(F>>>11))^((F<<7)|(F>>>25));p=(C>>>0)+v+t+(a[A])+(s[A]>>>0);o=x+k;C=D;D=E;E=F;F=G+p;G=I;I=J;J=K;K=p+o}r[0]+=K;r[1]+=J;r[2]+=I;r[3]+=G;r[4]+=F;r[5]+=E;r[6]+=D;r[7]+=C}return r};d._blocksize=16})();

src/crypto-js/sha256.js

@@ -4,7 +4,22 @@
  * Copyright (c) 2009, Jeff Mott. All rights reserved.
  * http://code.google.com/p/crypto-js/wiki/License
  */
-(function(){
+
+	// Convert a byte array to big-endian 32-bit words
+var bytesToWords = function (bytes) {
+	for (var words = [], i = 0, b = 0; i < bytes.length; i++, b += 8)
+		words[b >>> 5] |= bytes[i] << (24 - b % 32);
+	return words;
+};
+
+	// Convert big-endian 32-bit words to a byte array
+var wordsToBytes = function (words) {
+	for (var bytes = [], b = 0; b < words.length * 32; b += 8)
+		bytes.push((words[b >>> 5] >>> (24 - b % 32)) & 0xFF);
+	return bytes;
+};
+
+var Crypto = require('./crypto');
 
 // Shortcuts
 var C = Crypto,
@@ -33,7 +48,7 @@ var K = [ 0x428A2F98, 0x71374491, 0xB5C0FBCF, 0xE9B5DBA5,
 
 // Public API
 var SHA256 = C.SHA256 = function (message, options) {
-	var digestbytes = util.wordsToBytes(SHA256._sha256(message));
+	var digestbytes = wordsToBytes(SHA256._sha256(message));
 	return options && options.asBytes ? digestbytes :
 	       options && options.asString ? Binary.bytesToString(digestbytes) :
 	       util.bytesToHex(digestbytes);
@@ -46,7 +61,7 @@ SHA256._sha256 = function (message) {
 	if (message.constructor == String) message = UTF8.stringToBytes(message);
 	/* else, assume byte array already */
 
-	var m = util.bytesToWords(message),
+	var m = bytesToWords(message),
 	    l = message.length * 8,
 	    H = [ 0x6A09E667, 0xBB67AE85, 0x3C6EF372, 0xA54FF53A,
 	          0x510E527F, 0x9B05688C, 0x1F83D9AB, 0x5BE0CD19 ],
@@ -130,4 +145,4 @@ SHA256._sha256 = function (message) {
 // Package private blocksize
 SHA256._blocksize = 16;
 
-})();
+module.exports = SHA256;

src/ecdsa.js

@@ -1,197 +1,12 @@
-function integerToBytes(i, len) {
+var sec = require('./jsbn/sec');
-  var bytes = i.toByteArrayUnsigned();
+var util = require('./util');
+var SecureRandom = require('./jsbn/rng');
+var BigInteger = require('./jsbn/jsbn');
 
-  if (len < bytes.length) {
+var ECPointFp = require('./jsbn/ec').ECPointFp;
-    bytes = bytes.slice(bytes.length-len);
-  } else while (len > bytes.length) {
-    bytes.unshift(0);
-  }
-
-  return bytes;
-};
-
-ECFieldElementFp.prototype.getByteLength = function () {
-  return Math.floor((this.toBigInteger().bitLength() + 7) / 8);
-};
-
-ECPointFp.prototype.getEncoded = function (compressed) {
-  var x = this.getX().toBigInteger();
-  var y = this.getY().toBigInteger();
-
-  // Get value as a 32-byte Buffer
-  // Fixed length based on a patch by bitaddress.org and Casascius
-  var enc = integerToBytes(x, 32);
-
-  if (compressed) {
-    if (y.isEven()) {
-      // Compressed even pubkey
-      // M = 02 || X
-      enc.unshift(0x02);
-    } else {
-      // Compressed uneven pubkey
-      // M = 03 || X
-      enc.unshift(0x03);
-    }
-  } else {
-    // Uncompressed pubkey
-    // M = 04 || X || Y
-    enc.unshift(0x04);
-    enc = enc.concat(integerToBytes(y, 32));
-  }
-  return enc;
-};
-
-ECPointFp.decodeFrom = function (curve, enc) {
-  var type = enc[0];
-  var dataLen = enc.length-1;
-
-  // Extract x and y as byte arrays
-  var xBa = enc.slice(1, 1 + dataLen/2);
-  var yBa = enc.slice(1 + dataLen/2, 1 + dataLen);
-
-  // Prepend zero byte to prevent interpretation as negative integer
-  xBa.unshift(0);
-  yBa.unshift(0);
-
-  // Convert to BigIntegers
-  var x = new BigInteger(xBa);
-  var y = new BigInteger(yBa);
-
-  // Return point
-  return new ECPointFp(curve, curve.fromBigInteger(x), curve.fromBigInteger(y));
-};
-
-ECPointFp.prototype.add2D = function (b) {
-  if(this.isInfinity()) return b;
-  if(b.isInfinity()) return this;
-
-  if (this.x.equals(b.x)) {
-    if (this.y.equals(b.y)) {
-      // this = b, i.e. this must be doubled
-      return this.twice();
-    }
-    // this = -b, i.e. the result is the point at infinity
-    return this.curve.getInfinity();
-  }
-
-  var x_x = b.x.subtract(this.x);
-  var y_y = b.y.subtract(this.y);
-  var gamma = y_y.divide(x_x);
-
-  var x3 = gamma.square().subtract(this.x).subtract(b.x);
-  var y3 = gamma.multiply(this.x.subtract(x3)).subtract(this.y);
-
-  return new ECPointFp(this.curve, x3, y3);
-};
-
-ECPointFp.prototype.twice2D = function () {
-  if (this.isInfinity()) return this;
-  if (this.y.toBigInteger().signum() == 0) {
-    // if y1 == 0, then (x1, y1) == (x1, -y1)
-    // and hence this = -this and thus 2(x1, y1) == infinity
-    return this.curve.getInfinity();
-  }
-
-  var TWO = this.curve.fromBigInteger(BigInteger.valueOf(2));
-  var THREE = this.curve.fromBigInteger(BigInteger.valueOf(3));
-  var gamma = this.x.square().multiply(THREE).add(this.curve.a).divide(this.y.multiply(TWO));
-
-  var x3 = gamma.square().subtract(this.x.multiply(TWO));
-  var y3 = gamma.multiply(this.x.subtract(x3)).subtract(this.y);
-
-  return new ECPointFp(this.curve, x3, y3);
-};
-
-ECPointFp.prototype.multiply2D = function (k) {
-  if(this.isInfinity()) return this;
-  if(k.signum() == 0) return this.curve.getInfinity();
 
-  var e = k;
-  var h = e.multiply(new BigInteger("3"));
-
-  var neg = this.negate();
-  var R = this;
-
-  var i;
-  for (i = h.bitLength() - 2; i > 0; --i) {
-    R = R.twice();
-
-    var hBit = h.testBit(i);
-    var eBit = e.testBit(i);
-
-    if (hBit != eBit) {
-      R = R.add2D(hBit ? this : neg);
-    }
-  }
-
-  return R;
-};
-
-ECPointFp.prototype.isOnCurve = function () {
-  var x = this.getX().toBigInteger();
-  var y = this.getY().toBigInteger();
-  var a = this.curve.getA().toBigInteger();
-  var b = this.curve.getB().toBigInteger();
-  var n = this.curve.getQ();
-  var lhs = y.multiply(y).mod(n);
-  var rhs = x.multiply(x).multiply(x)
-    .add(a.multiply(x)).add(b).mod(n);
-  return lhs.equals(rhs);
-};
-
-ECPointFp.prototype.toString = function () {
-  return '('+this.getX().toBigInteger().toString()+','+
-    this.getY().toBigInteger().toString()+')';
-};
-
-/**
- * Validate an elliptic curve point.
- *
- * See SEC 1, section 3.2.2.1: Elliptic Curve Public Key Validation Primitive
- */
-ECPointFp.prototype.validate = function () {
-  var n = this.curve.getQ();
-
-  // Check Q != O
-  if (this.isInfinity()) {
-    throw new Error("Point is at infinity.");
-  }
-
-  // Check coordinate bounds
-  var x = this.getX().toBigInteger();
-  var y = this.getY().toBigInteger();
-  if (x.compareTo(BigInteger.ONE) < 0 ||
-      x.compareTo(n.subtract(BigInteger.ONE)) > 0) {
-    throw new Error('x coordinate out of bounds');
-  }
-  if (y.compareTo(BigInteger.ONE) < 0 ||
-      y.compareTo(n.subtract(BigInteger.ONE)) > 0) {
-    throw new Error('y coordinate out of bounds');
-  }
-
-  // Check y^2 = x^3 + ax + b (mod n)
-  if (!this.isOnCurve()) {
-    throw new Error("Point is not on the curve.");
-  }
-
-  // Check nQ = 0 (Q is a scalar multiple of G)
-  if (this.multiply(n).isInfinity()) {
-    // TODO: This check doesn't work - fix.
-    throw new Error("Point is not a scalar multiple of G.");
-  }
-
-  return true;
-};
-
-function dmp(v) {
-  if (!(v instanceof BigInteger)) v = v.toBigInteger();
-  return Crypto.util.bytesToHex(v.toByteArrayUnsigned());
-};
-
-Bitcoin.ECDSA = (function () {
-  var ecparams = getSECCurveByName("secp256k1");
 var rng = new SecureRandom();
-
+var ecparams = sec("secp256k1");
 var P_OVER_FOUR = null;
 
 function implShamirsTrick(P, k, Q, l)
@@ -247,7 +62,7 @@ Bitcoin.ECDSA = (function () {
 
   verify: function (hash, sig, pubkey) {
     var r,s;
-      if (Bitcoin.Util.isArray(sig)) {
+    if (util.isArray(sig)) {
       var obj = ECDSA.parseSig(sig);
       r = obj.r;
       s = obj.s;
@@ -261,7 +76,7 @@ Bitcoin.ECDSA = (function () {
     var Q;
     if (pubkey instanceof ECPointFp) {
       Q = pubkey;
-      } else if (Bitcoin.Util.isArray(pubkey)) {
+    } else if (util.isArray(pubkey)) {
       Q = ECPointFp.decodeFrom(ecparams.getCurve(), pubkey);
     } else {
       throw "Invalid format for pubkey value, must be byte array or ECPointFp";
@@ -471,5 +286,5 @@ Bitcoin.ECDSA = (function () {
   }
 };
 
-  return ECDSA;
+module.exports = ECDSA;
-})();
+

src/eckey.js

@@ -1,31 +1,61 @@
-Bitcoin.ECKey = (function () {
+var BigInteger = require('./jsbn/jsbn');
-  var ECDSA = Bitcoin.ECDSA;
+var sec = require('./jsbn/sec');
-  var ecparams = getSECCurveByName("secp256k1");
+var base58 = require('./base58');
-  var rng = new SecureRandom();
+var Crypto = require('./crypto-js/crypto');
-
+var util = require('./util');
+var conv = require('./convert');
+var Address = require('./address');
+var ecdsa = require('./ecdsa');
+
+var ecparams = sec("secp256k1");
+
+// input can be nothing, array of bytes, hex string, or base58 string
 var ECKey = function (input) {
+  if (!(this instanceof ECKey)) {
+    return new ECKey(input);
+  }
+
+  this.compressed = !!ECKey.compressByDefault;
+
   if (!input) {
     // Generate new key
     var n = ecparams.getN();
-      this.priv = ECDSA.getBigRandom(n);
+    this.priv = ecdsa.getBigRandom(n);
   } else if (input instanceof BigInteger) {
     // Input is a private key value
     this.priv = input;
-    } else if (Bitcoin.Util.isArray(input)) {
+  } else if (util.isArray(input)) {
     // Prepend zero byte to prevent interpretation as negative integer
     this.priv = BigInteger.fromByteArrayUnsigned(input);
+    this.compressed = false;
   } else if ("string" == typeof input) {
     if (input.length == 51 && input[0] == '5') {
       // Base58 encoded private key
       this.priv = BigInteger.fromByteArrayUnsigned(ECKey.decodeString(input));
+      this.compressed = false;
+    }
+    else if (input.length == 52 && (input[0] === 'K' || input[0] === 'L')) {
+      // Base58 encoded private key
+      this.priv = BigInteger.fromByteArrayUnsigned(ECKey.decodeString(input));
+      this.compressed = true;
     } else {
+      // hex string?
+      // //wtf is base64 here for?
       // Prepend zero byte to prevent interpretation as negative integer
-        this.priv = BigInteger.fromByteArrayUnsigned(Crypto.util.base64ToBytes(input));
+      this.priv = BigInteger.fromByteArrayUnsigned(conv.base64ToBytes(input));
     }
   }
-    this.compressed = !!ECKey.compressByDefault;
 };
 
+// TODO(shtylman) methods
+// wallet import format (base58 check with meta info)
+// fromWIF
+// toWIF
+// fromBytes
+// toBytes
+// fromHex
+// toHex
+
 /**
  * Whether public keys should be returned compressed by default.
  */
@@ -63,12 +93,12 @@ Bitcoin.ECKey = (function () {
 ECKey.prototype.getPubKeyHash = function () {
   if (this.pubKeyHash) return this.pubKeyHash;
 
-    return this.pubKeyHash = Bitcoin.Util.sha256ripe160(this.getPub());
+  return this.pubKeyHash = util.sha256ripe160(this.getPub());
 };
 
 ECKey.prototype.getBitcoinAddress = function () {
   var hash = this.getPubKeyHash();
-    var addr = new Bitcoin.Address(hash);
+  var addr = new Address(hash);
   return addr;
 };
 
@@ -87,28 +117,43 @@ Bitcoin.ECKey = (function () {
 
 ECKey.prototype.toString = function (format) {
   if (format === "base64") {
-      return Crypto.util.bytesToBase64(this.priv.toByteArrayUnsigned());
+    return conv.bytesToBase64(this.priv.toByteArrayUnsigned());
   } else {
     return Crypto.util.bytesToHex(this.priv.toByteArrayUnsigned());
   }
 };
 
 ECKey.prototype.sign = function (hash) {
-    return ECDSA.sign(hash, this.priv);
+  return ecdsa.sign(hash, this.priv);
 };
 
 ECKey.prototype.verify = function (hash, sig) {
-    return ECDSA.verify(hash, sig, this.getPub());
+  return ecdsa.verify(hash, sig, this.getPub());
 };
 
 /**
  * Parse an exported private key contained in a string.
  */
 ECKey.decodeString = function (string) {
-    var bytes = Bitcoin.Base58.decode(string);
+  var bytes = base58.decode(string);
+
+  if (bytes.length !== 37 && bytes.length !== 38) {
+    throw new Error('not a valid base58 encoded private key');
+  }
+
+  //Format:
+  //* uncompressed: 0x80 + [32-byte secret] + [4 bytes of Hash() of
+  //previous 33 bytes], base58 encoded
+  //* compressed: 0x80 + [32-byte secret] + 0x01 + [4 bytes of Hash()
+  //previous 34 bytes], base58 encoded
+
+  if (bytes[33] === 0x01) {
+    // compressed
+  }
 
   var hash = bytes.slice(0, 33);
 
+  /*
   var checksum = Crypto.SHA256(Crypto.SHA256(hash, {asBytes: true}), {asBytes: true});
 
   if (checksum[0] != bytes[33] ||
@@ -117,6 +162,7 @@ Bitcoin.ECKey = (function () {
       checksum[3] != bytes[36]) {
     throw "Checksum validation failed!";
   }
+  */
 
   var version = hash.shift();
 
@@ -127,5 +173,4 @@ Bitcoin.ECKey = (function () {
   return hash;
 };
 
-  return ECKey;
+module.exports = ECKey;
-})();

src/index.js

@@ -0,0 +1,46 @@
+// Bit-wise rotate left
+var rotl = function (n, b) {
+    return (n << b) | (n >>> (32 - b));
+};
+
+// Bit-wise rotate right
+var rotr = function (n, b) {
+    return (n << (32 - b)) | (n >>> b);
+};
+
+// Swap big-endian to little-endian and vice versa
+var endian = function (n) {
+    // If number given, swap endian
+    if (n.constructor == Number) {
+        return rotl(n,  8) & 0x00FF00FF | rotl(n, 24) & 0xFF00FF00;
+    }
+
+    // Else, assume array and swap all items
+    for (var i = 0; i < n.length; i++) {
+        n[i] = endian(n[i]);
+    }
+    return n;
+}
+
+module.exports = {
+    Address: require('./address'),
+    Key: require('./eckey'),
+    BigInteger: require('./jsbn/jsbn'),
+    Script: require('./script'),
+    Opcode: require('./opcode'),
+    Transaction: require('./transaction').Transaction,
+    TransactionIn: require('./transaction').TransactionIn,
+    TransactionOut: require('./transaction').TransactionOut,
+    ECPointFp: require('./jsbn/ec').ECPointFp,
+    Wallet: require('./wallet'),
+
+    ecdsa: require('./ecdsa'),
+
+    // base58 encoding/decoding to bytes
+    base58: require('./base58'),
+
+    // conversions
+    convert: require('./convert'),
+
+    endian: endian
+}

src/jsbn/ec.js

@@ -2,7 +2,7 @@
 // Ported loosely from BouncyCastle's Java EC code
 // Only Fp curves implemented for now
 
-// Requires jsbn.js and jsbn2.js
+var BigInteger = require('./jsbn');
 
 // ----------------
 // ECFieldElementFp
@@ -314,3 +314,194 @@ ECCurveFp.prototype.equals = curveFpEquals;
 ECCurveFp.prototype.getInfinity = curveFpGetInfinity;
 ECCurveFp.prototype.fromBigInteger = curveFpFromBigInteger;
 ECCurveFp.prototype.decodePointHex = curveFpDecodePointHex;
+
+// prepends 0 if bytes < len
+// cuts off start if bytes > len
+function integerToBytes(i, len) {
+  var bytes = i.toByteArrayUnsigned();
+
+  if (len < bytes.length) {
+    bytes = bytes.slice(bytes.length-len);
+  } else while (len > bytes.length) {
+    bytes.unshift(0);
+  }
+
+  return bytes;
+};
+
+ECFieldElementFp.prototype.getByteLength = function () {
+  return Math.floor((this.toBigInteger().bitLength() + 7) / 8);
+};
+
+ECPointFp.prototype.getEncoded = function (compressed) {
+  var x = this.getX().toBigInteger();
+  var y = this.getY().toBigInteger();
+
+  // Get value as a 32-byte Buffer
+  // Fixed length based on a patch by bitaddress.org and Casascius
+  var enc = integerToBytes(x, 32);
+
+  if (compressed) {
+    if (y.isEven()) {
+      // Compressed even pubkey
+      // M = 02 || X
+      enc.unshift(0x02);
+    } else {
+      // Compressed uneven pubkey
+      // M = 03 || X
+      enc.unshift(0x03);
+    }
+  } else {
+    // Uncompressed pubkey
+    // M = 04 || X || Y
+    enc.unshift(0x04);
+    enc = enc.concat(integerToBytes(y, 32));
+  }
+  return enc;
+};
+
+ECPointFp.decodeFrom = function (curve, enc) {
+  var type = enc[0];
+  var dataLen = enc.length-1;
+
+  // Extract x and y as byte arrays
+  var xBa = enc.slice(1, 1 + dataLen/2);
+  var yBa = enc.slice(1 + dataLen/2, 1 + dataLen);
+
+  // Prepend zero byte to prevent interpretation as negative integer
+  xBa.unshift(0);
+  yBa.unshift(0);
+
+  // Convert to BigIntegers
+  var x = new BigInteger(xBa);
+  var y = new BigInteger(yBa);
+
+  // Return point
+  return new ECPointFp(curve, curve.fromBigInteger(x), curve.fromBigInteger(y));
+};
+
+ECPointFp.prototype.add2D = function (b) {
+  if(this.isInfinity()) return b;
+  if(b.isInfinity()) return this;
+
+  if (this.x.equals(b.x)) {
+    if (this.y.equals(b.y)) {
+      // this = b, i.e. this must be doubled
+      return this.twice();
+    }
+    // this = -b, i.e. the result is the point at infinity
+    return this.curve.getInfinity();
+  }
+
+  var x_x = b.x.subtract(this.x);
+  var y_y = b.y.subtract(this.y);
+  var gamma = y_y.divide(x_x);
+
+  var x3 = gamma.square().subtract(this.x).subtract(b.x);
+  var y3 = gamma.multiply(this.x.subtract(x3)).subtract(this.y);
+
+  return new ECPointFp(this.curve, x3, y3);
+};
+
+ECPointFp.prototype.twice2D = function () {
+  if (this.isInfinity()) return this;
+  if (this.y.toBigInteger().signum() == 0) {
+    // if y1 == 0, then (x1, y1) == (x1, -y1)
+    // and hence this = -this and thus 2(x1, y1) == infinity
+    return this.curve.getInfinity();
+  }
+
+  var TWO = this.curve.fromBigInteger(BigInteger.valueOf(2));
+  var THREE = this.curve.fromBigInteger(BigInteger.valueOf(3));
+  var gamma = this.x.square().multiply(THREE).add(this.curve.a).divide(this.y.multiply(TWO));
+
+  var x3 = gamma.square().subtract(this.x.multiply(TWO));
+  var y3 = gamma.multiply(this.x.subtract(x3)).subtract(this.y);
+
+  return new ECPointFp(this.curve, x3, y3);
+};
+
+ECPointFp.prototype.multiply2D = function (k) {
+  if(this.isInfinity()) return this;
+  if(k.signum() == 0) return this.curve.getInfinity();
+
+  var e = k;
+  var h = e.multiply(new BigInteger("3"));
+
+  var neg = this.negate();
+  var R = this;
+
+  var i;
+  for (i = h.bitLength() - 2; i > 0; --i) {
+    R = R.twice();
+
+    var hBit = h.testBit(i);
+    var eBit = e.testBit(i);
+
+    if (hBit != eBit) {
+      R = R.add2D(hBit ? this : neg);
+    }
+  }
+
+  return R;
+};
+
+ECPointFp.prototype.isOnCurve = function () {
+  var x = this.getX().toBigInteger();
+  var y = this.getY().toBigInteger();
+  var a = this.curve.getA().toBigInteger();
+  var b = this.curve.getB().toBigInteger();
+  var n = this.curve.getQ();
+  var lhs = y.multiply(y).mod(n);
+  var rhs = x.multiply(x).multiply(x)
+    .add(a.multiply(x)).add(b).mod(n);
+  return lhs.equals(rhs);
+};
+
+ECPointFp.prototype.toString = function () {
+  return '('+this.getX().toBigInteger().toString()+','+
+    this.getY().toBigInteger().toString()+')';
+};
+
+/**
+ * Validate an elliptic curve point.
+ *
+ * See SEC 1, section 3.2.2.1: Elliptic Curve Public Key Validation Primitive
+ */
+ECPointFp.prototype.validate = function () {
+  var n = this.curve.getQ();
+
+  // Check Q != O
+  if (this.isInfinity()) {
+    throw new Error("Point is at infinity.");
+  }
+
+  // Check coordinate bounds
+  var x = this.getX().toBigInteger();
+  var y = this.getY().toBigInteger();
+  if (x.compareTo(BigInteger.ONE) < 0 ||
+      x.compareTo(n.subtract(BigInteger.ONE)) > 0) {
+    throw new Error('x coordinate out of bounds');
+  }
+  if (y.compareTo(BigInteger.ONE) < 0 ||
+      y.compareTo(n.subtract(BigInteger.ONE)) > 0) {
+    throw new Error('y coordinate out of bounds');
+  }
+
+  // Check y^2 = x^3 + ax + b (mod n)
+  if (!this.isOnCurve()) {
+    throw new Error("Point is not on the curve.");
+  }
+
+  // Check nQ = 0 (Q is a scalar multiple of G)
+  if (this.multiply(n).isInfinity()) {
+    // TODO: This check doesn't work - fix.
+    throw new Error("Point is not a scalar multiple of G.");
+  }
+
+  return true;
+};
+
+
+module.exports = ECCurveFp;
+module.exports.ECPointFp = ECPointFp;

src/jsbn/jsbn2.js

@@ -1,656 +0,0 @@
-// Copyright (c) 2005-2009  Tom Wu
-// All Rights Reserved.
-// See "LICENSE" for details.
-
-// Extended JavaScript BN functions, required for RSA private ops.
-
-// Version 1.1: new BigInteger("0", 10) returns "proper" zero
-// Version 1.2: square() API, isProbablePrime fix
-
-// (public)
-function bnClone() { var r = nbi(); this.copyTo(r); return r; }
-
-// (public) return value as integer
-function bnIntValue() {
-  if(this.s < 0) {
-    if(this.t == 1) return this[0]-this.DV;
-    else if(this.t == 0) return -1;
-  }
-  else if(this.t == 1) return this[0];
-  else if(this.t == 0) return 0;
-  // assumes 16 < DB < 32
-  return ((this[1]&((1<<(32-this.DB))-1))<<this.DB)|this[0];
-}
-
-// (public) return value as byte
-function bnByteValue() { return (this.t==0)?this.s:(this[0]<<24)>>24; }
-
-// (public) return value as short (assumes DB>=16)
-function bnShortValue() { return (this.t==0)?this.s:(this[0]<<16)>>16; }
-
-// (protected) return x s.t. r^x < DV
-function bnpChunkSize(r) { return Math.floor(Math.LN2*this.DB/Math.log(r)); }
-
-// (public) 0 if this == 0, 1 if this > 0
-function bnSigNum() {
-  if(this.s < 0) return -1;
-  else if(this.t <= 0 || (this.t == 1 && this[0] <= 0)) return 0;
-  else return 1;
-}
-
-// (protected) convert to radix string
-function bnpToRadix(b) {
-  if(b == null) b = 10;
-  if(this.signum() == 0 || b < 2 || b > 36) return "0";
-  var cs = this.chunkSize(b);
-  var a = Math.pow(b,cs);
-  var d = nbv(a), y = nbi(), z = nbi(), r = "";
-  this.divRemTo(d,y,z);
-  while(y.signum() > 0) {
-    r = (a+z.intValue()).toString(b).substr(1) + r;
-    y.divRemTo(d,y,z);
-  }
-  return z.intValue().toString(b) + r;
-}
-
-// (protected) convert from radix string
-function bnpFromRadix(s,b) {
-  this.fromInt(0);
-  if(b == null) b = 10;
-  var cs = this.chunkSize(b);
-  var d = Math.pow(b,cs), mi = false, j = 0, w = 0;
-  for(var i = 0; i < s.length; ++i) {
-    var x = intAt(s,i);
-    if(x < 0) {
-      if(s.charAt(i) == "-" && this.signum() == 0) mi = true;
-      continue;
-    }
-    w = b*w+x;
-    if(++j >= cs) {
-      this.dMultiply(d);
-      this.dAddOffset(w,0);
-      j = 0;
-      w = 0;
-    }
-  }
-  if(j > 0) {
-    this.dMultiply(Math.pow(b,j));
-    this.dAddOffset(w,0);
-  }
-  if(mi) BigInteger.ZERO.subTo(this,this);
-}
-
-// (protected) alternate constructor
-function bnpFromNumber(a,b,c) {
-  if("number" == typeof b) {
-    // new BigInteger(int,int,RNG)
-    if(a < 2) this.fromInt(1);
-    else {
-      this.fromNumber(a,c);
-      if(!this.testBit(a-1))	// force MSB set
-        this.bitwiseTo(BigInteger.ONE.shiftLeft(a-1),op_or,this);
-      if(this.isEven()) this.dAddOffset(1,0); // force odd
-      while(!this.isProbablePrime(b)) {
-        this.dAddOffset(2,0);
-        if(this.bitLength() > a) this.subTo(BigInteger.ONE.shiftLeft(a-1),this);
-      }
-    }
-  }
-  else {
-    // new BigInteger(int,RNG)
-    var x = new Array(), t = a&7;
-    x.length = (a>>3)+1;
-    b.nextBytes(x);
-    if(t > 0) x[0] &= ((1<<t)-1); else x[0] = 0;
-    this.fromString(x,256);
-  }
-}
-
-// (public) convert to bigendian byte array
-function bnToByteArray() {
-  var i = this.t, r = new Array();
-  r[0] = this.s;
-  var p = this.DB-(i*this.DB)%8, d, k = 0;
-  if(i-- > 0) {
-    if(p < this.DB && (d = this[i]>>p) != (this.s&this.DM)>>p)
-      r[k++] = d|(this.s<<(this.DB-p));
-    while(i >= 0) {
-      if(p < 8) {
-        d = (this[i]&((1<<p)-1))<<(8-p);
-        d |= this[--i]>>(p+=this.DB-8);
-      }
-      else {
-        d = (this[i]>>(p-=8))&0xff;
-        if(p <= 0) { p += this.DB; --i; }
-      }
-      if((d&0x80) != 0) d |= -256;
-      if(k == 0 && (this.s&0x80) != (d&0x80)) ++k;
-      if(k > 0 || d != this.s) r[k++] = d;
-    }
-  }
-  return r;
-}
-
-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; }
-
-// (protected) r = this op a (bitwise)
-function bnpBitwiseTo(a,op,r) {
-  var i, f, m = Math.min(a.t,this.t);
-  for(i = 0; i < m; ++i) r[i] = op(this[i],a[i]);
-  if(a.t < this.t) {
-    f = a.s&this.DM;
-    for(i = m; i < this.t; ++i) r[i] = op(this[i],f);
-    r.t = this.t;
-  }
-  else {
-    f = this.s&this.DM;
-    for(i = m; i < a.t; ++i) r[i] = op(f,a[i]);
-    r.t = a.t;
-  }
-  r.s = op(this.s,a.s);
-  r.clamp();
-}
-
-// (public) this & a
-function op_and(x,y) { return x&y; }
-function bnAnd(a) { var r = nbi(); this.bitwiseTo(a,op_and,r); return r; }
-
-// (public) this | a
-function op_or(x,y) { return x|y; }
-function bnOr(a) { var r = nbi(); this.bitwiseTo(a,op_or,r); return r; }
-
-// (public) this ^ a
-function op_xor(x,y) { return x^y; }
-function bnXor(a) { var r = nbi(); this.bitwiseTo(a,op_xor,r); return r; }
-
-// (public) this & ~a
-function op_andnot(x,y) { return x&~y; }
-function bnAndNot(a) { var r = nbi(); this.bitwiseTo(a,op_andnot,r); return r; }
-
-// (public) ~this
-function bnNot() {
-  var r = nbi();
-  for(var i = 0; i < this.t; ++i) r[i] = this.DM&~this[i];
-  r.t = this.t;
-  r.s = ~this.s;
-  return r;
-}
-
-// (public) this << n
-function bnShiftLeft(n) {
-  var r = nbi();
-  if(n < 0) this.rShiftTo(-n,r); else this.lShiftTo(n,r);
-  return r;
-}
-
-// (public) this >> n
-function bnShiftRight(n) {
-  var r = nbi();
-  if(n < 0) this.lShiftTo(-n,r); else this.rShiftTo(n,r);
-  return r;
-}
-
-// return index of lowest 1-bit in x, x < 2^31
-function lbit(x) {
-  if(x == 0) return -1;
-  var r = 0;
-  if((x&0xffff) == 0) { x >>= 16; r += 16; }
-  if((x&0xff) == 0) { x >>= 8; r += 8; }
-  if((x&0xf) == 0) { x >>= 4; r += 4; }
-  if((x&3) == 0) { x >>= 2; r += 2; }
-  if((x&1) == 0) ++r;
-  return r;
-}
-
-// (public) returns index of lowest 1-bit (or -1 if none)
-function bnGetLowestSetBit() {
-  for(var i = 0; i < this.t; ++i)
-    if(this[i] != 0) return i*this.DB+lbit(this[i]);
-  if(this.s < 0) return this.t*this.DB;
-  return -1;
-}
-
-// return number of 1 bits in x
-function cbit(x) {
-  var r = 0;
-  while(x != 0) { x &= x-1; ++r; }
-  return r;
-}
-
-// (public) return number of set bits
-function bnBitCount() {
-  var r = 0, x = this.s&this.DM;
-  for(var i = 0; i < this.t; ++i) r += cbit(this[i]^x);
-  return r;
-}
-
-// (public) true iff nth bit is set
-function bnTestBit(n) {
-  var j = Math.floor(n/this.DB);
-  if(j >= this.t) return(this.s!=0);
-  return((this[j]&(1<<(n%this.DB)))!=0);
-}
-
-// (protected) this op (1<<n)
-function bnpChangeBit(n,op) {
-  var r = BigInteger.ONE.shiftLeft(n);
-  this.bitwiseTo(r,op,r);
-  return r;
-}
-
-// (public) this | (1<<n)
-function bnSetBit(n) { return this.changeBit(n,op_or); }
-
-// (public) this & ~(1<<n)
-function bnClearBit(n) { return this.changeBit(n,op_andnot); }
-
-// (public) this ^ (1<<n)
-function bnFlipBit(n) { return this.changeBit(n,op_xor); }
-
-// (protected) r = this + a
-function bnpAddTo(a,r) {
-  var i = 0, c = 0, m = Math.min(a.t,this.t);
-  while(i < m) {
-    c += this[i]+a[i];
-    r[i++] = c&this.DM;
-    c >>= this.DB;
-  }
-  if(a.t < this.t) {
-    c += a.s;
-    while(i < this.t) {
-      c += this[i];
-      r[i++] = c&this.DM;
-      c >>= this.DB;
-    }
-    c += this.s;
-  }
-  else {
-    c += this.s;
-    while(i < a.t) {
-      c += a[i];
-      r[i++] = c&this.DM;
-      c >>= this.DB;
-    }
-    c += a.s;
-  }
-  r.s = (c<0)?-1:0;
-  if(c > 0) r[i++] = c;
-  else if(c < -1) r[i++] = this.DV+c;
-  r.t = i;
-  r.clamp();
-}
-
-// (public) this + a
-function bnAdd(a) { var r = nbi(); this.addTo(a,r); return r; }
-
-// (public) this - a
-function bnSubtract(a) { var r = nbi(); this.subTo(a,r); return r; }
-
-// (public) this * a
-function bnMultiply(a) { var r = nbi(); this.multiplyTo(a,r); return r; }
-
-// (public) this^2
-function bnSquare() { var r = nbi(); this.squareTo(r); return r; }
-
-// (public) this / a
-function bnDivide(a) { var r = nbi(); this.divRemTo(a,r,null); return r; }
-
-// (public) this % a
-function bnRemainder(a) { var r = nbi(); this.divRemTo(a,null,r); return r; }
-
-// (public) [this/a,this%a]
-function bnDivideAndRemainder(a) {
-  var q = nbi(), r = nbi();
-  this.divRemTo(a,q,r);
-  return new Array(q,r);
-}
-
-// (protected) this *= n, this >= 0, 1 < n < DV
-function bnpDMultiply(n) {
-  this[this.t] = this.am(0,n-1,this,0,0,this.t);
-  ++this.t;
-  this.clamp();
-}
-
-// (protected) this += n << w words, this >= 0
-function bnpDAddOffset(n,w) {
-  if(n == 0) return;
-  while(this.t <= w) this[this.t++] = 0;
-  this[w] += n;
-  while(this[w] >= this.DV) {
-    this[w] -= this.DV;
-    if(++w >= this.t) this[this.t++] = 0;
-    ++this[w];
-  }
-}
-
-// A "null" reducer
-function NullExp() {}
-function nNop(x) { return x; }
-function nMulTo(x,y,r) { x.multiplyTo(y,r); }
-function nSqrTo(x,r) { x.squareTo(r); }
-
-NullExp.prototype.convert = nNop;
-NullExp.prototype.revert = nNop;
-NullExp.prototype.mulTo = nMulTo;
-NullExp.prototype.sqrTo = nSqrTo;
-
-// (public) this^e
-function bnPow(e) { return this.exp(e,new NullExp()); }
-
-// (protected) r = lower n words of "this * a", a.t <= n
-// "this" should be the larger one if appropriate.
-function bnpMultiplyLowerTo(a,n,r) {
-  var i = Math.min(this.t+a.t,n);
-  r.s = 0; // assumes a,this >= 0
-  r.t = i;
-  while(i > 0) r[--i] = 0;
-  var j;
-  for(j = r.t-this.t; i < j; ++i) r[i+this.t] = this.am(0,a[i],r,i,0,this.t);
-  for(j = Math.min(a.t,n); i < j; ++i) this.am(0,a[i],r,i,0,n-i);
-  r.clamp();
-}
-
-// (protected) r = "this * a" without lower n words, n > 0
-// "this" should be the larger one if appropriate.
-function bnpMultiplyUpperTo(a,n,r) {
-  --n;
-  var i = r.t = this.t+a.t-n;
-  r.s = 0; // assumes a,this >= 0
-  while(--i >= 0) r[i] = 0;
-  for(i = Math.max(n-this.t,0); i < a.t; ++i)
-    r[this.t+i-n] = this.am(n-i,a[i],r,0,0,this.t+i-n);
-  r.clamp();
-  r.drShiftTo(1,r);
-}
-
-// Barrett modular reduction
-function Barrett(m) {
-  // setup Barrett
-  this.r2 = nbi();
-  this.q3 = nbi();
-  BigInteger.ONE.dlShiftTo(2*m.t,this.r2);
-  this.mu = this.r2.divide(m);
-  this.m = m;
-}
-
-function barrettConvert(x) {
-  if(x.s < 0 || x.t > 2*this.m.t) return x.mod(this.m);
-  else if(x.compareTo(this.m) < 0) return x;
-  else { var r = nbi(); x.copyTo(r); this.reduce(r); return r; }
-}
-
-function barrettRevert(x) { return x; }
-
-// x = x mod m (HAC 14.42)
-function barrettReduce(x) {
-  x.drShiftTo(this.m.t-1,this.r2);
-  if(x.t > this.m.t+1) { x.t = this.m.t+1; x.clamp(); }
-  this.mu.multiplyUpperTo(this.r2,this.m.t+1,this.q3);
-  this.m.multiplyLowerTo(this.q3,this.m.t+1,this.r2);
-  while(x.compareTo(this.r2) < 0) x.dAddOffset(1,this.m.t+1);
-  x.subTo(this.r2,x);
-  while(x.compareTo(this.m) >= 0) x.subTo(this.m,x);
-}
-
-// r = x^2 mod m; x != r
-function barrettSqrTo(x,r) { x.squareTo(r); this.reduce(r); }
-
-// r = x*y mod m; x,y != r
-function barrettMulTo(x,y,r) { x.multiplyTo(y,r); this.reduce(r); }
-
-Barrett.prototype.convert = barrettConvert;
-Barrett.prototype.revert = barrettRevert;
-Barrett.prototype.reduce = barrettReduce;
-Barrett.prototype.mulTo = barrettMulTo;
-Barrett.prototype.sqrTo = barrettSqrTo;
-
-// (public) this^e % m (HAC 14.85)
-function bnModPow(e,m) {
-  var i = e.bitLength(), k, r = nbv(1), z;
-  if(i <= 0) return r;
-  else if(i < 18) k = 1;
-  else if(i < 48) k = 3;
-  else if(i < 144) k = 4;
-  else if(i < 768) k = 5;
-  else k = 6;
-  if(i < 8)
-    z = new Classic(m);
-  else if(m.isEven())
-    z = new Barrett(m);
-  else
-    z = new Montgomery(m);
-
-  // precomputation
-  var g = new Array(), n = 3, k1 = k-1, km = (1<<k)-1;
-  g[1] = z.convert(this);
-  if(k > 1) {
-    var g2 = nbi();
-    z.sqrTo(g[1],g2);
-    while(n <= km) {
-      g[n] = nbi();
-      z.mulTo(g2,g[n-2],g[n]);
-      n += 2;
-    }
-  }
-
-  var j = e.t-1, w, is1 = true, r2 = nbi(), t;
-  i = nbits(e[j])-1;
-  while(j >= 0) {
-    if(i >= k1) w = (e[j]>>(i-k1))&km;
-    else {
-      w = (e[j]&((1<<(i+1))-1))<<(k1-i);
-      if(j > 0) w |= e[j-1]>>(this.DB+i-k1);
-    }
-
-    n = k;
-    while((w&1) == 0) { w >>= 1; --n; }
-    if((i -= n) < 0) { i += this.DB; --j; }
-    if(is1) {	// ret == 1, don't bother squaring or multiplying it
-      g[w].copyTo(r);
-      is1 = false;
-    }
-    else {
-      while(n > 1) { z.sqrTo(r,r2); z.sqrTo(r2,r); n -= 2; }
-      if(n > 0) z.sqrTo(r,r2); else { t = r; r = r2; r2 = t; }
-      z.mulTo(r2,g[w],r);
-    }
-
-    while(j >= 0 && (e[j]&(1<<i)) == 0) {
-      z.sqrTo(r,r2); t = r; r = r2; r2 = t;
-      if(--i < 0) { i = this.DB-1; --j; }
-    }
-  }
-  return z.revert(r);
-}
-
-// (public) gcd(this,a) (HAC 14.54)
-function bnGCD(a) {
-  var x = (this.s<0)?this.negate():this.clone();
-  var y = (a.s<0)?a.negate():a.clone();
-  if(x.compareTo(y) < 0) { var t = x; x = y; y = t; }
-  var i = x.getLowestSetBit(), g = y.getLowestSetBit();
-  if(g < 0) return x;
-  if(i < g) g = i;
-  if(g > 0) {
-    x.rShiftTo(g,x);
-    y.rShiftTo(g,y);
-  }
-  while(x.signum() > 0) {
-    if((i = x.getLowestSetBit()) > 0) x.rShiftTo(i,x);
-    if((i = y.getLowestSetBit()) > 0) y.rShiftTo(i,y);
-    if(x.compareTo(y) >= 0) {
-      x.subTo(y,x);
-      x.rShiftTo(1,x);
-    }
-    else {
-      y.subTo(x,y);
-      y.rShiftTo(1,y);
-    }
-  }
-  if(g > 0) y.lShiftTo(g,y);
-  return y;
-}
-
-// (protected) this % n, n < 2^26
-function bnpModInt(n) {
-  if(n <= 0) return 0;
-  var d = this.DV%n, r = (this.s<0)?n-1:0;
-  if(this.t > 0)
-    if(d == 0) r = this[0]%n;
-    else for(var i = this.t-1; i >= 0; --i) r = (d*r+this[i])%n;
-  return r;
-}
-
-// (public) 1/this % m (HAC 14.61)
-function bnModInverse(m) {
-  var ac = m.isEven();
-  if((this.isEven() && ac) || m.signum() == 0) return BigInteger.ZERO;
-  var u = m.clone(), v = this.clone();
-  var a = nbv(1), b = nbv(0), c = nbv(0), d = nbv(1);
-  while(u.signum() != 0) {
-    while(u.isEven()) {
-      u.rShiftTo(1,u);
-      if(ac) {
-        if(!a.isEven() || !b.isEven()) { a.addTo(this,a); b.subTo(m,b); }
-        a.rShiftTo(1,a);
-      }
-      else if(!b.isEven()) b.subTo(m,b);
-      b.rShiftTo(1,b);
-    }
-    while(v.isEven()) {
-      v.rShiftTo(1,v);
-      if(ac) {
-        if(!c.isEven() || !d.isEven()) { c.addTo(this,c); d.subTo(m,d); }
-        c.rShiftTo(1,c);
-      }
-      else if(!d.isEven()) d.subTo(m,d);
-      d.rShiftTo(1,d);
-    }
-    if(u.compareTo(v) >= 0) {
-      u.subTo(v,u);
-      if(ac) a.subTo(c,a);
-      b.subTo(d,b);
-    }
-    else {
-      v.subTo(u,v);
-      if(ac) c.subTo(a,c);
-      d.subTo(b,d);
-    }
-  }
-  if(v.compareTo(BigInteger.ONE) != 0) return BigInteger.ZERO;
-  if(d.compareTo(m) >= 0) return d.subtract(m);
-  if(d.signum() < 0) d.addTo(m,d); else return d;
-  if(d.signum() < 0) return d.add(m); else return d;
-}
-
-var lowprimes = [2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97,101,103,107,109,113,127,131,137,139,149,151,157,163,167,173,179,181,191,193,197,199,211,223,227,229,233,239,241,251,257,263,269,271,277,281,283,293,307,311,313,317,331,337,347,349,353,359,367,373,379,383,389,397,401,409,419,421,431,433,439,443,449,457,461,463,467,479,487,491,499,503,509,521,523,541,547,557,563,569,571,577,587,593,599,601,607,613,617,619,631,641,643,647,653,659,661,673,677,683,691,701,709,719,727,733,739,743,751,757,761,769,773,787,797,809,811,821,823,827,829,839,853,857,859,863,877,881,883,887,907,911,919,929,937,941,947,953,967,971,977,983,991,997];
-var lplim = (1<<26)/lowprimes[lowprimes.length-1];
-
-// (public) test primality with certainty >= 1-.5^t
-function bnIsProbablePrime(t) {
-  var i, x = this.abs();
-  if(x.t == 1 && x[0] <= lowprimes[lowprimes.length-1]) {
-    for(i = 0; i < lowprimes.length; ++i)
-      if(x[0] == lowprimes[i]) return true;
-    return false;
-  }
-  if(x.isEven()) return false;
-  i = 1;
-  while(i < lowprimes.length) {
-    var m = lowprimes[i], j = i+1;
-    while(j < lowprimes.length && m < lplim) m *= lowprimes[j++];
-    m = x.modInt(m);
-    while(i < j) if(m%lowprimes[i++] == 0) return false;
-  }
-  return x.millerRabin(t);
-}
-
-// (protected) true if probably prime (HAC 4.24, Miller-Rabin)
-function bnpMillerRabin(t) {
-  var n1 = this.subtract(BigInteger.ONE);
-  var k = n1.getLowestSetBit();
-  if(k <= 0) return false;
-  var r = n1.shiftRight(k);
-  t = (t+1)>>1;
-  if(t > lowprimes.length) t = lowprimes.length;
-  var a = nbi();
-  for(var i = 0; i < t; ++i) {
-    //Pick bases at random, instead of starting at 2
-    a.fromInt(lowprimes[Math.floor(Math.random()*lowprimes.length)]);
-    var y = a.modPow(r,this);
-    if(y.compareTo(BigInteger.ONE) != 0 && y.compareTo(n1) != 0) {
-      var j = 1;
-      while(j++ < k && y.compareTo(n1) != 0) {
-        y = y.modPowInt(2,this);
-        if(y.compareTo(BigInteger.ONE) == 0) return false;
-      }
-      if(y.compareTo(n1) != 0) return false;
-    }
-  }
-  return true;
-}
-
-// protected
-BigInteger.prototype.chunkSize = bnpChunkSize;
-BigInteger.prototype.toRadix = bnpToRadix;
-BigInteger.prototype.fromRadix = bnpFromRadix;
-BigInteger.prototype.fromNumber = bnpFromNumber;
-BigInteger.prototype.bitwiseTo = bnpBitwiseTo;
-BigInteger.prototype.changeBit = bnpChangeBit;
-BigInteger.prototype.addTo = bnpAddTo;
-BigInteger.prototype.dMultiply = bnpDMultiply;
-BigInteger.prototype.dAddOffset = bnpDAddOffset;
-BigInteger.prototype.multiplyLowerTo = bnpMultiplyLowerTo;
-BigInteger.prototype.multiplyUpperTo = bnpMultiplyUpperTo;
-BigInteger.prototype.modInt = bnpModInt;
-BigInteger.prototype.millerRabin = bnpMillerRabin;
-
-// public
-BigInteger.prototype.clone = bnClone;
-BigInteger.prototype.intValue = bnIntValue;
-BigInteger.prototype.byteValue = bnByteValue;
-BigInteger.prototype.shortValue = bnShortValue;
-BigInteger.prototype.signum = bnSigNum;
-BigInteger.prototype.toByteArray = bnToByteArray;
-BigInteger.prototype.equals = bnEquals;
-BigInteger.prototype.min = bnMin;
-BigInteger.prototype.max = bnMax;
-BigInteger.prototype.and = bnAnd;
-BigInteger.prototype.or = bnOr;
-BigInteger.prototype.xor = bnXor;
-BigInteger.prototype.andNot = bnAndNot;
-BigInteger.prototype.not = bnNot;
-BigInteger.prototype.shiftLeft = bnShiftLeft;
-BigInteger.prototype.shiftRight = bnShiftRight;
-BigInteger.prototype.getLowestSetBit = bnGetLowestSetBit;
-BigInteger.prototype.bitCount = bnBitCount;
-BigInteger.prototype.testBit = bnTestBit;
-BigInteger.prototype.setBit = bnSetBit;
-BigInteger.prototype.clearBit = bnClearBit;
-BigInteger.prototype.flipBit = bnFlipBit;
-BigInteger.prototype.add = bnAdd;
-BigInteger.prototype.subtract = bnSubtract;
-BigInteger.prototype.multiply = bnMultiply;
-BigInteger.prototype.divide = bnDivide;
-BigInteger.prototype.remainder = bnRemainder;
-BigInteger.prototype.divideAndRemainder = bnDivideAndRemainder;
-BigInteger.prototype.modPow = bnModPow;
-BigInteger.prototype.modInverse = bnModInverse;
-BigInteger.prototype.pow = bnPow;
-BigInteger.prototype.gcd = bnGCD;
-BigInteger.prototype.isProbablePrime = bnIsProbablePrime;
-
-// JSBN-specific extension
-BigInteger.prototype.square = bnSquare;
-
-// BigInteger interfaces not implemented in jsbn:
-
-// BigInteger(int signum, byte[] magnitude)
-// double doubleValue()
-// float floatValue()
-// int hashCode()
-// long longValue()
-// static BigInteger valueOf(long val)

src/jsbn/prng4.js

@@ -35,11 +35,5 @@ function ARC4next() {
 Arcfour.prototype.init = ARC4init;
 Arcfour.prototype.next = ARC4next;
 
-// Plug in your RNG constructor here
+module.exports = Arcfour;
-function prng_newstate() {
-  return new Arcfour();
-}
 
-// Pool size must be a multiple of 4 and greater than 32.
-// An array of bytes the size of the pool will be passed to init()
-var rng_psize = 256;

src/jsbn/rng.js

@@ -1,4 +1,16 @@
 // Random number generator - requires a PRNG backend, e.g. prng4.js
+// prng4.js - uses Arcfour as a PRNG
+
+var Arcfour = require('./prng4');
+
+// Plug in your RNG constructor here
+function prng_newstate() {
+  return new Arcfour();
+}
+
+// Pool size must be a multiple of 4 and greater than 32.
+// An array of bytes the size of the pool will be passed to init()
+var rng_psize = 256;
 
 // For best results, put code like
 // <body onClick='rng_seed_time();' onKeyPress='rng_seed_time();'>
@@ -27,12 +39,15 @@ if(rng_pool == null) {
   rng_pool = new Array();
   rng_pptr = 0;
   var t;
+  // TODO(shtylman) use browser crypto if available
+  /*
   if(navigator.appName == "Netscape" && navigator.appVersion < "5" && window.crypto) {
     // Extract entropy (256 bits) from NS4 RNG if available
     var z = window.crypto.random(32);
     for(t = 0; t < z.length; ++t)
       rng_pool[rng_pptr++] = z.charCodeAt(t) & 255;
   }
+  */
   while(rng_pptr < rng_psize) {  // extract some randomness from Math.random()
     t = Math.floor(65536 * Math.random());
     rng_pool[rng_pptr++] = t >>> 8;
@@ -66,3 +81,5 @@ function rng_get_bytes(ba) {
 function SecureRandom() {}
 
 SecureRandom.prototype.nextBytes = rng_get_bytes;
+
+module.exports = SecureRandom;

src/jsbn/sec.js

@@ -2,6 +2,9 @@
 
 // Requires ec.js, jsbn.js, and jsbn2.js
 
+var ECCurveFp = require('./ec');
+var BigInteger = require('./jsbn');
+
 // ----------------
 // X9ECParameters
 
@@ -171,3 +174,5 @@ function getSECCurveByName(name) {
     if(name == "secp256r1") return secp256r1();
     return null;
 }
+
+module.exports = getSECCurveByName;

src/message.js

@@ -1,7 +1,6 @@
 /**
  * Implements Bitcoin's feature for signing arbitrary messages.
  */
-Bitcoin.Message = (function () {
 var Message = {};
 
 Message.magicPrefix = "Bitcoin Signed Message:\n";
@@ -65,5 +64,4 @@ Bitcoin.Message = (function () {
   return (address === expectedAddress);
 };
 
-  return Message;
+module.exports = Message;
-})();

src/opcode.js

@@ -1,5 +1,4 @@
-(function () {
+var Opcode = function (num) {
-  var Opcode = Bitcoin.Opcode = function (num) {
   this.code = num;
 };
 
@@ -151,4 +150,5 @@
 for (var i in Opcode.map) {
   Opcode.reverseMap[Opcode.map[i]] = i;
 }
-})();
+
+module.exports = Opcode;

src/script.js

@@ -1,17 +1,13 @@
-(function () {
+var Opcode = require('./opcode');
-  var Opcode = Bitcoin.Opcode;
+var util = require('./util');
+var conv = require('./convert');
 
-  // Make opcodes available as pseudo-constants
+var Script = function (data) {
-  for (var i in Opcode.map) {
-    eval("var " + i + " = " + Opcode.map[i] + ";");
-  }
-
-  var Script = Bitcoin.Script = function (data) {
   if (!data) {
     this.buffer = [];
   } else if ("string" == typeof data) {
     this.buffer = Crypto.util.base64ToBytes(data);
-    } else if (Bitcoin.Util.isArray(data)) {
+  } else if (util.isArray(data)) {
     this.buffer = data;
   } else if (data instanceof Script) {
     this.buffer = data.buffer;
@@ -22,6 +18,32 @@
   this.parse();
 };
 
+Script.fromPubKey = function(str) {
+  var script = new Script();
+  var s = str.split(" ");
+  for (var i in s) {
+    if (Opcode.map.hasOwnProperty(s[i])){
+      script.writeOp(Opcode.map[s[i]]);
+    } else {
+      script.writeBytes(conv.hexToBytes(s[i]));
+    }
+  }
+  return script;
+};
+
+Script.fromScriptSig = function(str) {
+  var script = new Script();
+  var s = str.split(" ");
+  for (var i in s) {
+    if (Opcode.map.hasOwnProperty(s[i])){
+      script.writeOp(Opcode.map[s[i]]);
+    } else {
+      script.writeBytes(conv.hexToBytes(s[i]));
+    }
+  }
+  return script;
+};
+
 /**
  * Update the parsed script representation.
  *
@@ -55,16 +77,16 @@
     }
 
     var len;
-      if (opcode > 0 && opcode < OP_PUSHDATA1) {
+    if (opcode > 0 && opcode < Opcode.map.OP_PUSHDATA1) {
       // Read some bytes of data, opcode value is the length of data
       readChunk(opcode);
-      } else if (opcode == OP_PUSHDATA1) {
+    } else if (opcode == Opcode.map.OP_PUSHDATA1) {
       len = this.buffer[i++];
       readChunk(len);
-      } else if (opcode == OP_PUSHDATA2) {
+    } else if (opcode == Opcode.map.OP_PUSHDATA2) {
       len = (this.buffer[i++] << 8) | this.buffer[i++];
       readChunk(len);
-      } else if (opcode == OP_PUSHDATA4) {
+    } else if (opcode == Opcode.map.OP_PUSHDATA4) {
       len = (this.buffer[i++] << 24) |
         (this.buffer[i++] << 16) |
         (this.buffer[i++] << 8) |
@@ -95,19 +117,18 @@
  *   Any other script (no template matched).
  */
 Script.prototype.getOutType = function () {
-
+if (this.chunks[this.chunks.length-1] == Opcode.map.OP_CHECKMULTISIG && this.chunks[this.chunks.length-2] <= 3) {
-  if (this.chunks[this.chunks.length-1] == OP_CHECKMULTISIG && this.chunks[this.chunks.length-2] <= 3) {
   // Transfer to M-OF-N
   return 'Multisig';
 } else if (this.chunks.length == 5 &&
-    this.chunks[0] == OP_DUP &&
+  this.chunks[0] == Opcode.map.OP_DUP &&
-    this.chunks[1] == OP_HASH160 &&
+  this.chunks[1] == Opcode.map.OP_HASH160 &&
-    this.chunks[3] == OP_EQUALVERIFY &&
+  this.chunks[3] == Opcode.map.OP_EQUALVERIFY &&
-    this.chunks[4] == OP_CHECKSIG) {
+  this.chunks[4] == Opcode.map.OP_CHECKSIG) {
   // Transfer to Bitcoin address
   return 'Address';
 } else if (this.chunks.length == 2 &&
-         this.chunks[1] == OP_CHECKSIG) {
+       this.chunks[1] == Opcode.map.OP_CHECKSIG) {
   // Transfer to IP address
   return 'Pubkey';
 } else {
@@ -135,7 +156,7 @@
   case 'Pubkey':
     return Bitcoin.Util.sha256ripe160(this.chunks[0]);
   default:
-      throw new Error("Encountered non-standard scriptPubKey");
+    throw new Error("Encountered non-standard scriptPubKey: " + this.getOutType());
   }
 };
 
@@ -176,8 +197,8 @@
     // TODO: We could also check that the length of the data is correct.
     return 'Pubkey';
   } else if (this.chunks.length == 2 &&
-               Bitcoin.Util.isArray(this.chunks[0]) &&
+             util.isArray(this.chunks[0]) &&
-               Bitcoin.Util.isArray(this.chunks[1])) {
+             util.isArray(this.chunks[1])) {
     return 'Address';
   } else {
     return 'Strange';
@@ -252,17 +273,17 @@
  */
 Script.prototype.writeBytes = function (data)
 {
-    if (data.length < OP_PUSHDATA1) {
+  if (data.length < Opcode.map.OP_PUSHDATA1) {
     this.buffer.push(data.length);
   } else if (data.length <= 0xff) {
-      this.buffer.push(OP_PUSHDATA1);
+    this.buffer.push(Opcode.map.OP_PUSHDATA1);
     this.buffer.push(data.length);
   } else if (data.length <= 0xffff) {
-      this.buffer.push(OP_PUSHDATA2);
+    this.buffer.push(Opcode.map.OP_PUSHDATA2);
     this.buffer.push(data.length & 0xff);
     this.buffer.push((data.length >>> 8) & 0xff);
   } else {
-      this.buffer.push(OP_PUSHDATA4);
+    this.buffer.push(Opcode.map.OP_PUSHDATA4);
     this.buffer.push(data.length & 0xff);
     this.buffer.push((data.length >>> 8) & 0xff);
     this.buffer.push((data.length >>> 16) & 0xff);
@@ -278,11 +299,11 @@
 Script.createOutputScript = function (address)
 {
   var script = new Script();
-    script.writeOp(OP_DUP);
+  script.writeOp(Opcode.map.OP_DUP);
-    script.writeOp(OP_HASH160);
+  script.writeOp(Opcode.map.OP_HASH160);
   script.writeBytes(address.hash);
-    script.writeOp(OP_EQUALVERIFY);
+  script.writeOp(Opcode.map.OP_EQUALVERIFY);
-    script.writeOp(OP_CHECKSIG);
+  script.writeOp(Opcode.map.OP_CHECKSIG);
   return script;
 };
 
@@ -314,17 +335,17 @@
  */
 Script.createMultiSigOutputScript = function (m, pubkeys)
 {
-    var script = new Bitcoin.Script();
+  var script = new Script();
   
-    script.writeOp(OP_1 + m - 1);
+  script.writeOp(Opcode.map.OP_1 + m - 1);
   
   for (var i = 0; i < pubkeys.length; ++i) {
     script.writeBytes(pubkeys[i]);
   }
   
-    script.writeOp(OP_1 + pubkeys.length - 1);
+  script.writeOp(Opcode.map.OP_1 + pubkeys.length - 1);
 
-    script.writeOp(OP_CHECKMULTISIG);
+  script.writeOp(Opcode.map.OP_CHECKMULTISIG);
 
   return script;
 };
@@ -344,4 +365,5 @@
 {
   return new Script(this.buffer);
 };
-})();
+
+module.exports = Script;

src/transaction.js

@@ -1,7 +1,10 @@
-(function () {
+var BigInteger = require('./jsbn/jsbn');
-  var Script = Bitcoin.Script;
+var Script = require('./script');
+var util = require('./util');
+var conv = require('./convert');
+var Crypto = require('./crypto-js/crypto');
 
-  var Transaction = Bitcoin.Transaction = function (doc) {
+var Transaction = function (doc) {
   this.version = 1;
   this.lock_time = 0;
   this.ins = [];
@@ -61,7 +64,7 @@
         hash: tx.hash,
         index: outIndex
       },
-        script: new Bitcoin.Script(),
+      script: new Script(),
       sequence: 4294967295
     }));
   }
@@ -93,6 +96,21 @@
   }
 };
 
+// TODO(shtylman) crypto sha uses this also
+// Convert a byte array to big-endian 32-bit words
+var bytesToWords = function (bytes) {
+	for (var words = [], i = 0, b = 0; i < bytes.length; i++, b += 8)
+		words[b >>> 5] |= bytes[i] << (24 - b % 32);
+	return words;
+};
+
+	// Convert big-endian 32-bit words to a byte array
+var wordsToBytes = function (words) {
+	for (var bytes = [], b = 0; b < words.length * 32; b += 8)
+		bytes.push((words[b >>> 5] >>> (24 - b % 32)) & 0xFF);
+	return bytes;
+};
+
 /**
  * Serialize this transaction.
  *
@@ -103,26 +121,26 @@
 Transaction.prototype.serialize = function ()
 {
   var buffer = [];
-    buffer = buffer.concat(Crypto.util.wordsToBytes([parseInt(this.version)]).reverse());
+  buffer = buffer.concat(wordsToBytes([parseInt(this.version)]).reverse());
-    buffer = buffer.concat(Bitcoin.Util.numToVarInt(this.ins.length));
+  buffer = buffer.concat(util.numToVarInt(this.ins.length));
   for (var i = 0; i < this.ins.length; i++) {
     var txin = this.ins[i];
-      buffer = buffer.concat(Crypto.util.base64ToBytes(txin.outpoint.hash));
+    buffer = buffer.concat(conv.base64ToBytes(txin.outpoint.hash));
-      buffer = buffer.concat(Crypto.util.wordsToBytes([parseInt(txin.outpoint.index)]).reverse());
+    buffer = buffer.concat(wordsToBytes([parseInt(txin.outpoint.index)]).reverse());
     var scriptBytes = txin.script.buffer;
-      buffer = buffer.concat(Bitcoin.Util.numToVarInt(scriptBytes.length));
+    buffer = buffer.concat(util.numToVarInt(scriptBytes.length));
     buffer = buffer.concat(scriptBytes);
-      buffer = buffer.concat(Crypto.util.wordsToBytes([parseInt(txin.sequence)]).reverse());
+    buffer = buffer.concat(wordsToBytes([parseInt(txin.sequence)]).reverse());
   }
-    buffer = buffer.concat(Bitcoin.Util.numToVarInt(this.outs.length));
+  buffer = buffer.concat(util.numToVarInt(this.outs.length));
   for (var i = 0; i < this.outs.length; i++) {
     var txout = this.outs[i];
     buffer = buffer.concat(txout.value);
     var scriptBytes = txout.script.buffer;
-      buffer = buffer.concat(Bitcoin.Util.numToVarInt(scriptBytes.length));
+    buffer = buffer.concat(util.numToVarInt(scriptBytes.length));
     buffer = buffer.concat(scriptBytes);
   }
-    buffer = buffer.concat(Crypto.util.wordsToBytes([parseInt(this.lock_time)]).reverse());
+  buffer = buffer.concat(wordsToBytes([parseInt(this.lock_time)]).reverse());
 
   return buffer;
 };
@@ -180,7 +198,7 @@
 
   var buffer = txTmp.serialize();
 
-    buffer = buffer.concat(Crypto.util.wordsToBytes([parseInt(hashType)]).reverse());
+  buffer = buffer.concat(wordsToBytes([parseInt(hashType)]).reverse());
 
   var hash1 = Crypto.SHA256(buffer, {asBytes: true});
 
@@ -391,13 +409,14 @@
   }
 };
 
-  var TransactionIn = Bitcoin.TransactionIn = function (data)
+var TransactionIn = function (data)
 {
   this.outpoint = data.outpoint;
   if (data.script instanceof Script) {
     this.script = data.script;
   } else {
-      this.script = new Script(data.script);
+    //this.script = new Script(data.script);
+    this.script = Script.fromScriptSig(data.scriptSig);
   }
   this.sequence = data.sequence;
 };
@@ -415,20 +434,21 @@
   return newTxin;
 };
 
-  var TransactionOut = Bitcoin.TransactionOut = function (data)
+var TransactionOut = function (data)
 {
   if (data.script instanceof Script) {
     this.script = data.script;
   } else {
-      this.script = new Script(data.script);
+    //this.script = new Script(data.script);
+    this.script = Script.fromPubKey(data.scriptPubKey);
   }
 
-    if (Bitcoin.Util.isArray(data.value)) {
+  if (util.isArray(data.value)) {
     this.value = data.value;
   } else if ("string" == typeof data.value) {
     var valueHex = (new BigInteger(data.value, 10)).toString(16);
     while (valueHex.length < 16) valueHex = "0" + valueHex;
-      this.value = Crypto.util.hexToBytes(valueHex);
+    this.value = conv.hexToBytes(valueHex);
   }
 };
 
@@ -440,6 +460,8 @@
   });
   return newTxout;
 };
-})();
 
+module.exports.Transaction = Transaction;
+module.exports.TransactionIn = TransactionIn;
+module.exports.TransactionOut = TransactionOut;
 

src/util.js

@@ -1,117 +1,7 @@
-// BigInteger monkey patching
+var BigInteger = require('./jsbn/jsbn');
-BigInteger.valueOf = nbv;
+var Crypto = require('./crypto-js/crypto');
 
-/**
+module.exports = {
- * Returns a byte array representation of the big integer.
- *
- * This returns the absolute of the contained value in big endian
- * form. A value of zero results in an empty array.
- */
-BigInteger.prototype.toByteArrayUnsigned = function () {
-  var ba = this.abs().toByteArray();
-  if (ba.length) {
-    if (ba[0] == 0) {
-      ba = ba.slice(1);
-    }
-    return ba.map(function (v) {
-      return (v < 0) ? v + 256 : v;
-    });
-  } else {
-    // Empty array, nothing to do
-    return ba;
-  }
-};
-
-/**
- * Turns a byte array into a big integer.
- *
- * This function will interpret a byte array as a big integer in big
- * endian notation and ignore leading zeros.
- */
-BigInteger.fromByteArrayUnsigned = function (ba) {
-  if (!ba.length) {
-    return ba.valueOf(0);
-  } else if (ba[0] & 0x80) {
-    // Prepend a zero so the BigInteger class doesn't mistake this
-    // for a negative integer.
-    return new BigInteger([0].concat(ba));
-  } else {
-    return new BigInteger(ba);
-  }
-};
-
-/**
- * Converts big integer to signed byte representation.
- *
- * The format for this value uses a the most significant bit as a sign
- * bit. If the most significant bit is already occupied by the
- * absolute value, an extra byte is prepended and the sign bit is set
- * there.
- *
- * Examples:
- *
- *      0 =>     0x00
- *      1 =>     0x01
- *     -1 =>     0x81
- *    127 =>     0x7f
- *   -127 =>     0xff
- *    128 =>   0x0080
- *   -128 =>   0x8080
- *    255 =>   0x00ff
- *   -255 =>   0x80ff
- *  16300 =>   0x3fac
- * -16300 =>   0xbfac
- *  62300 => 0x00f35c
- * -62300 => 0x80f35c
- */
-BigInteger.prototype.toByteArraySigned = function () {
-  var val = this.abs().toByteArrayUnsigned();
-  var neg = this.compareTo(BigInteger.ZERO) < 0;
-
-  if (neg) {
-    if (val[0] & 0x80) {
-      val.unshift(0x80);
-    } else {
-      val[0] |= 0x80;
-    }
-  } else {
-    if (val[0] & 0x80) {
-      val.unshift(0x00);
-    }
-  }
-
-  return val;
-};
-
-/**
- * Parse a signed big integer byte representation.
- *
- * For details on the format please see BigInteger.toByteArraySigned.
- */
-BigInteger.fromByteArraySigned = function (ba) {
-  // Check for negative value
-  if (ba[0] & 0x80) {
-    // Remove sign bit
-    ba[0] &= 0x7f;
-
-    return BigInteger.fromByteArrayUnsigned(ba).negate();
-  } else {
-    return BigInteger.fromByteArrayUnsigned(ba);
-  }
-};
-
-// Console ignore
-var names = ["log", "debug", "info", "warn", "error", "assert", "dir",
-             "dirxml", "group", "groupEnd", "time", "timeEnd", "count",
-             "trace", "profile", "profileEnd"];
-
-if ("undefined" == typeof window.console) window.console = {};
-for (var i = 0; i < names.length; ++i)
-  if ("undefined" == typeof window.console[names[i]])
-    window.console[names[i]] = function() {};
-
-// Bitcoin utility functions
-Bitcoin.Util = {
   /**
    * Cross-browser compatibility version of Array.isArray.
    */
@@ -220,9 +110,3 @@ Bitcoin.Util = {
     return Crypto.RIPEMD160(Crypto.SHA256(data, {asBytes: true}), {asBytes: true});
   }
 };
-
-for (var i in Crypto.util) {
-  if (Crypto.util.hasOwnProperty(i)) {
-    Bitcoin.Util[i] = Crypto.util[i];
-  }
-}

src/wallet.js

@@ -1,7 +1,13 @@
-Bitcoin.Wallet = (function () {
+var Script = require('./script');
-  var Script = Bitcoin.Script,
+var ECKey = require('./eckey');
-  TransactionIn = Bitcoin.TransactionIn,
+var conv = require('./convert');
-  TransactionOut = Bitcoin.TransactionOut;
+var util = require('./util');
+
+var BigInteger = require('./jsbn/jsbn');
+
+var Transaction = require('./transaction').Transaction;
+var TransactionIn = require('./transaction').TransactionIn;
+var TransactionOut = require('./transaction').TransactionOut;
 
 var Wallet = function () {
   // Keychain
@@ -31,8 +37,8 @@ Bitcoin.Wallet = (function () {
    * expensively calculate it later.
    */
   this.addKey = function (key, pub) {
-      if (!(key instanceof Bitcoin.ECKey)) {
+    if (!(key instanceof ECKey)) {
-        key = new Bitcoin.ECKey(key);
+      key = new ECKey(key);
     }
     keys.push(key);
 
@@ -140,10 +146,21 @@ Bitcoin.Wallet = (function () {
    * automatically.
    */
   this.getNextAddress = function () {
+    if (keys.length === 0) {
+      this.generateAddress();
+    }
+    else {
+    }
+
+    /*
     this.addressPointer++;
     if (!keys[this.addressPointer]) {
       this.generateAddress();
     }
+    */
+    // TODO(shtylman) this shit is trying to be too smart
+    // it is making a new address when it shouldn't
+    // it should just stop being so "smart" and just do what it is told
     return keys[this.addressPointer].getBitcoinAddress();
   };
 
@@ -154,7 +171,7 @@ Bitcoin.Wallet = (function () {
    * to be signed as the second parameter.
    */
   this.signWithKey = function (pubKeyHash, hash) {
-      pubKeyHash = Crypto.util.bytesToBase64(pubKeyHash);
+    pubKeyHash = conv.bytesToBase64(pubKeyHash);
     for (var i = 0; i < this.addressHashes.length; i++) {
       if (this.addressHashes[i] == pubKeyHash) {
         return keys[i].sign(hash);
@@ -170,7 +187,7 @@ Bitcoin.Wallet = (function () {
    * wallet.
    */
   this.getPubKeyFromHash = function (pubKeyHash) {
-      pubKeyHash = Crypto.util.bytesToBase64(pubKeyHash);
+    pubKeyHash = conv.bytesToBase64(pubKeyHash);
     for (var i = 0; i < this.addressHashes.length; i++) {
       if (this.addressHashes[i] == pubKeyHash) {
         return keys[i].getPub();
@@ -181,7 +198,7 @@ Bitcoin.Wallet = (function () {
 };
 
 Wallet.prototype.generateAddress = function () {
-    this.addKey(new Bitcoin.ECKey());
+  this.addKey(new ECKey());
 };
 
 /**
@@ -197,9 +214,9 @@ Bitcoin.Wallet = (function () {
   var k;
   var hash;
   // Gather outputs
-    for (j = 0; j < tx.outs.length; j++) {
+  for (j = 0; j < tx.out.length; j++) {
-      var txout = new TransactionOut(tx.outs[j]);
+    var txout = new TransactionOut(tx.out[j]);
-      hash = Crypto.util.bytesToBase64(txout.script.simpleOutPubKeyHash());
+    hash = conv.bytesToBase64(txout.script.simpleOutPubKeyHash());
     for (k = 0; k < this.addressHashes.length; k++) {
       if (this.addressHashes[k] === hash) {
         this.unspentOuts.push({tx: tx, index: j, out: txout});
@@ -209,10 +226,10 @@ Bitcoin.Wallet = (function () {
   }
 
   // Remove spent outputs
-    for (j = 0; j < tx.ins.length; j++) {
+  for (j = 0; j < tx.in.length; j++) {
-      var txin = new TransactionIn(tx.ins[j]);
+    var txin = new TransactionIn(tx.in[j]);
     var pubkey = txin.script.simpleInPubKey();
-      hash = Crypto.util.bytesToBase64(Bitcoin.Util.sha256ripe160(pubkey));
+    hash = conv.bytesToBase64(util.sha256ripe160(pubkey));
     for (k = 0; k < this.addressHashes.length; k++) {
       if (this.addressHashes[k] === hash) {
         for (var l = 0; l < this.unspentOuts.length; l++) {
@@ -234,7 +251,7 @@ Bitcoin.Wallet = (function () {
   var balance = BigInteger.valueOf(0);
   for (var i = 0; i < this.unspentOuts.length; i++) {
     var txout = this.unspentOuts[i].out;
-      balance = balance.add(Bitcoin.Util.valueToBigInt(txout.value));
+    balance = balance.add(util.valueToBigInt(txout.value));
   }
   return balance;
 };
@@ -245,8 +262,9 @@ Bitcoin.Wallet = (function () {
   var availableValue = BigInteger.ZERO;
   var i;
   for (i = 0; i < this.unspentOuts.length; i++) {
-      selectedOuts.push(this.unspentOuts[i]);
+    var txout = this.unspentOuts[i];
-      availableValue = availableValue.add(Bitcoin.Util.valueToBigInt(this.unspentOuts[i].out.value));
+    selectedOuts.push(txout);
+    availableValue = availableValue.add(util.valueToBigInt(txout.out.value));
 
     if (availableValue.compareTo(txValue) >= 0) break;
   }
@@ -255,10 +273,9 @@ Bitcoin.Wallet = (function () {
     throw new Error('Insufficient funds.');
   }
 
-
   var changeValue = availableValue.subtract(txValue);
 
-    var sendTx = new Bitcoin.Transaction();
+  var sendTx = new Transaction();
 
   for (i = 0; i < selectedOuts.length; i++) {
     sendTx.addInput(selectedOuts[i].tx, selectedOuts[i].index);
@@ -303,6 +320,4 @@ Bitcoin.Wallet = (function () {
   return false;
 };
 
-  return Wallet;
+module.exports = Wallet;
-})();
-

test/address.js

@@ -0,0 +1,46 @@
+var assert = require('assert');
+var Address = require('../').Address;
+
+test('string', function() {
+    var addr = '18fN1QTGWmHWCA9r2dyDH6FbMEyc7XHmQQ';
+    assert.equal((new Address(addr)).toString(), addr);
+});
+
+test('valid', function() {
+    function validate(addr, type) {
+        assert.ok(Address.validate(addr, type));
+    };
+
+    validate('1A1zP1eP5QGefi2DMPTfTL5SLmv7DivfNa');
+    validate('1A1zP1eP5QGefi2DMPTfTL5SLmv7DivfNa', 'prod');
+    validate('mzBc4XEFSdzCDcTxAgf6EZXgsZWpztRhef');
+    validate('mzBc4XEFSdzCDcTxAgf6EZXgsZWpztRhef', 'testnet');
+
+    validate('12KYrjTdVGjFMtaxERSk3gphreJ5US8aUP');
+    validate('12QeMLzSrB8XH8FvEzPMVoRxVAzTr5XM2y');
+    validate('1oNLrsHnBcR6dpaBpwz3LSwutbUNkNSjs');
+    validate('1SQHtwR5oJRKLfiWQ2APsAd9miUc4k2ez');
+    validate('116CGDLddrZhMrTwhCVJXtXQpxygTT1kHd');
+
+    // p2sh addresses
+    validate('3NJZLcZEEYBpxYEUGewU4knsQRn1WM5Fkt');
+    validate('3NJZLcZEEYBpxYEUGewU4knsQRn1WM5Fkt', 'prod');
+    validate('2MxKEf2su6FGAUfCEAHreGFQvEYrfYNHvL7');
+    validate('2MxKEf2su6FGAUfCEAHreGFQvEYrfYNHvL7', 'testnet');
+});
+
+
+test('invalid', function() {
+    function invalid(addr, type) {
+        assert.ok(!Address.validate(addr, type));
+    };
+
+    invalid('');
+    invalid('mzBc4XEFSdzCDcTxAgf6EZXgsZWpztRhe');
+    invalid('1A1zP1eP5QGefi2DMPTfTL5SLmv7DivfNa', 'testnet');
+    invalid('mzBc4XEFSdzCDcTxAgf6EZXgsZWpztRhef', 'prod');
+
+    // invalid base58 string
+    invalid('%%@');
+});
+

test/base58.js

@@ -0,0 +1,15 @@
+var assert = require('assert');
+var base58 = require('../').base58;
+var conv = require('../').convert;
+
+test('decode base58', function() {
+    var enc = '5HueCGU8rMjxEXxiPuD5BDku4MkFqeZyd4dZ1jvhTVqvbTLvyTJ';
+    var hex = '800c28fca386c7a227600b2fe50b7cae11ec86d3bf1fbe471be89827e19d72aa1d507a5b8d';
+    assert.deepEqual(base58.decode(enc), conv.hexToBytes(hex));
+});
+
+test('encode base58', function() {
+    var enc = '5HueCGU8rMjxEXxiPuD5BDku4MkFqeZyd4dZ1jvhTVqvbTLvyTJ';
+    var hex = '800c28fca386c7a227600b2fe50b7cae11ec86d3bf1fbe471be89827e19d72aa1d507a5b8d';
+    assert.equal(base58.encode(conv.hexToBytes(hex)), enc);
+});

test/convert.js

@@ -0,0 +1,24 @@
+var assert = require('assert');
+var conv = require('../').convert;
+
+var bytesToHex = conv.bytesToHex;
+var hexToBytes = conv.hexToBytes;
+
+test('bytesToHex', function() {
+    assert.equal(bytesToHex([0, 1, 2, 255]), '000102ff');
+});
+
+test('hexToBytes', function() {
+    assert.deepEqual(hexToBytes('000102ff'), [0, 1, 2, 255]);
+});
+
+test('bytesToHex - hexToBytes', function() {
+    var bytes = [];
+    for (var i=0 ; i<256 ; ++i) {
+        bytes.push(i);
+    }
+
+    var hex = bytesToHex(bytes);
+    assert.equal(hex.length, 512);
+    assert.deepEqual(hexToBytes(hex), bytes);
+});

test/ec.js

@@ -0,0 +1,20 @@
+var assert = require('assert');
+var sec = require('../src/jsbn/sec');
+var ecdsa = require('../').ecdsa;
+
+var ecparams = sec('secp256k1');
+
+test("Point multiplication", function () {
+    var G = ecparams.getG();
+    var n = ecparams.getN();
+
+    assert.ok(G.multiply(n).isInfinity(), "Gn is infinite");
+
+    var k = ecdsa.getBigRandom(n);
+    var P = G.multiply(k);
+    assert.ok(!P.isInfinity(), "kG is not infinite");
+    assert.ok(P.isOnCurve(), "kG on curve");
+    assert.ok(P.multiply(n).isInfinity(), "kGn is infinite");
+
+    assert.ok(P.validate(), "kG validates as a public key");
+});

test/index.html

@@ -1,36 +0,0 @@
-<!DOCTYPE html>
-<html>
-<head>
-	<title>BitcoinJS-lib Test Suite</title>
-	<link rel="stylesheet" href="../vendor/qunit/qunit.css" type="text/css" media="screen">
-	<script type="text/javascript" src="https://ajax.googleapis.com/ajax/libs/jquery/1.4.4/jquery.min.js"></script>
-	<script type="text/javascript" src="../vendor/qunit/qunit.js"></script>
-  <script type="text/javascript" src="../src/crypto-js/crypto.js"></script>
-  <script type="text/javascript" src="../src/crypto-js/sha256.js"></script>
-  <script type="text/javascript" src="../src/jsbn/prng4.js"></script>
-  <script type="text/javascript" src="../src/jsbn/rng.js"></script>
-  <script type="text/javascript" src="../src/jsbn/jsbn.js"></script>
-  <script type="text/javascript" src="../src/jsbn/jsbn2.js"></script>
-
-  <script type="text/javascript" src="../src/jsbn/ec.js"></script>
-  <script type="text/javascript" src="../src/jsbn/sec.js"></script>
-  <script type="text/javascript" src="../src/events/eventemitter.js"></script>
-  <script type="text/javascript" src="../src/bitcoin.js"></script>
-  <script type="text/javascript" src="../src/util.js"></script>
-  <script type="text/javascript" src="../src/base58.js"></script>
-
-  <script type="text/javascript" src="../src/address.js"></script>
-  <script type="text/javascript" src="../src/ecdsa.js"></script>
-  <script type="text/javascript" src="../src/eckey.js"></script>
-  <script type="text/javascript" src="../src/paillier.js"></script>
-	<script type="text/javascript" src="test.js"></script>
-</head>
-<body>
-	<h1 id="qunit-header">BitcoinJS-lib Test Suite</h1>
-	<h2 id="qunit-banner"></h2>
-	<div id="qunit-testrunner-toolbar"></div>
-	<h2 id="qunit-userAgent"></h2>
-	<ol id="qunit-tests"></ol>
-	<div id="qunit-fixture"></div>
-</body>
-</html>

test/integer.js

@@ -0,0 +1,24 @@
+var assert = require('assert');
+var BigInteger = require('../').BigInteger;
+var bytesToHex = require('../').convert.bytesToHex;
+
+test('toByteArraySigned', function() {
+    function hex(num) {
+        var bytes = BigInteger.valueOf(num).toByteArraySigned();
+        var hex = bytesToHex(bytes);
+        return '0x' + hex;
+    }
+
+    assert.equal(hex( 0), '0x');
+    assert.equal(hex( 1), '0x01');
+    assert.equal(hex(-1), '0x81');
+    assert.equal(hex( 127), '0x7f');
+    assert.equal(hex(-127), '0xff');
+    assert.equal(hex( 255), '0x00ff');
+    assert.equal(hex(-255), '0x80ff');
+    assert.equal(hex( 16300),  '0x3fac');
+    assert.equal(hex(-16300), '0xbfac');
+    assert.equal(hex( 62300), '0x00f35c');
+    assert.equal(hex(-62300), '0x80f35c');
+});
+

test/key.js

@@ -0,0 +1,35 @@
+var assert = require('assert');
+var Key = require('../').Key;
+var bytesToHex = require('../').convert.bytesToHex;
+var hexToBytes = require('../').convert.hexToBytes;
+var base58 = require('../').base58;
+
+// get public key from private key
+test('from private base58', function() {
+
+    var priv = '18e14a7b6a307f426a94f8114701e7c8e774e7f9a47e2c2035db29a206321725';
+    var pub = '0450863ad64a87ae8a2fe83c1af1a8403cb53f53e486d8511dad8a04887e5b23522cd470243453a299fa9e77237716103abc11a1df38855ed6f2ee187e9c582ba6';
+    var key = Key(hexToBytes(priv));
+
+    assert.equal(bytesToHex(key.getPub()), pub);
+    assert.equal(key.compressed, false);
+
+    var priv = '5HwoXVkHoRM8sL2KmNRS217n1g8mPPBomrY7yehCuXC1115WWsh';
+    var pub = '044f355bdcb7cc0af728ef3cceb9615d90684bb5b2ca5f859ab0f0b704075871aa385b6b1b8ead809ca67454d9683fcf2ba03456d6fe2c4abe2b07f0fbdbb2f1c1';
+    var addr = '1MsHWS1BnwMc3tLE8G35UXsS58fKipzB7a';
+    var key = Key(priv);
+
+    assert.equal(key.compressed, false);
+    assert.equal(bytesToHex(key.getPub()), pub);
+    assert.equal(key.getBitcoinAddress().toString(), addr);
+
+    var priv = 'KwntMbt59tTsj8xqpqYqRRWufyjGunvhSyeMo3NTYpFYzZbXJ5Hp';
+    var pub = '034f355bdcb7cc0af728ef3cceb9615d90684bb5b2ca5f859ab0f0b704075871aa'
+    var addr = '1Q1pE5vPGEEMqRcVRMbtBK842Y6Pzo6nK9';
+    var key = Key(priv);
+
+    assert.equal(key.compressed, true);
+    assert.equal(bytesToHex(key.getPub()), pub);
+    assert.equal(key.getBitcoinAddress().toString(), addr);
+});
+

test/mocha.opts

@@ -0,0 +1 @@
+--ui qunit

test/test.js

@@ -1,84 +1,50 @@
-//
+var assert = require('assert');
-// Testing elliptic curve math
+var bitcoinjs = require('../');
-// -----------------------------------------------------------------------------
+var sec = require('../src/jsbn/sec');
-module("ec");
+var BigInteger = require('../src/jsbn/jsbn');
 
-var ecparams = getSECCurveByName("secp256k1");
+var Crypto = require('../src/crypto-js/crypto');
-var rng = new SecureRandom();
-
-test("Classes", function () {
-  expect(3);
-  ok(ECPointFp, "ECPointFp");
-  ok(ECFieldElementFp, "ECFieldElementFp");
-  ok(ECCurveFp, "ECCurveFp");
-});
-
-test("Point multiplication", function () {
-	expect(5);
-
-	var G = ecparams.getG();
-	var n = ecparams.getN();
-
-	ok(G.multiply(n).isInfinity(), "Gn is infinite");
-
-  var k = Bitcoin.ECDSA.getBigRandom(n);
-  var P = G.multiply(k);
-	ok(!P.isInfinity(), "kG is not infinite");
-	ok(P.isOnCurve(), "kG on curve");
-	ok(P.multiply(n).isInfinity(), "kGn is infinite");
-
-  ok(P.validate(), "kG validates as a public key");
-});
 
+var SecureRandom = require('../src/jsbn/rng');
+var rng = new SecureRandom();
 
-//
+var ecparams = sec('secp256k1');
-// Testing ECDSA
+var ECPointFp = bitcoinjs.ECPointFp;
-// -----------------------------------------------------------------------------
-module("ecdsa");
-
-test("Classes", function () {
-  expect(2);
-  ok(Bitcoin.ECDSA, "Bitcoin.ECDSA");
-  ok(Bitcoin.ECKey, "Bitcoin.ECKey");
-});
 
 test("Keys & Key Management", function () {
-  expect(5);
 
-  var s1 = new Bitcoin.ECKey();
+  var p1 = bitcoinjs.Key().getPub();
-  var p1 = s1.getPub();
+  assert.equal(p1.length, 65);
-  equals(p1.length, 65, "Public key is correct length");
 
   var p1_q = ECPointFp.decodeFrom(ecparams.getCurve(), p1);
-  ok(p1_q, "Decode point from generated bytestring");
+  assert.ok(p1_q);
-  ok(p1_q.validate(), "Is a valid public point");
+  assert.ok(p1_q.validate());
 
-  var p2 = Crypto.util.hexToBytes(
+  var p2 = bitcoinjs.convert.hexToBytes(
     "0486f356006a38b847bedec1bf47013776925d939d5a35a97a4d1263e550c7f1a" +
     "b5aba44ab74d22892097a0e851addf07ba97e33416df5affaceeb35d5607cd23c"
   );
+
   var p2_q = ECPointFp.decodeFrom(ecparams.getCurve(), p2);
-  ok(p2_q, "Decode point from constant");
+  assert.ok(p2_q);
-  ok(p2_q.validate(), "Is a valid public point");
+  assert.ok(p2_q.validate());
 });
 
 test("Signing and Verifying", function () {
-  expect(7);
 
-  var s1 = new Bitcoin.ECKey();
+  var s1 = bitcoinjs.Key();
   var sig_a = s1.sign(BigInteger.ZERO);
-  ok(sig_a, "Sign null");
+  assert.ok(sig_a, "Sign null");
-  equals(sig_a.length, 70, "Signature is correct length");
+
-  ok(s1.verify(BigInteger.ZERO, sig_a));
+  assert.ok(s1.verify(BigInteger.ZERO, sig_a));
 
   var message = new BigInteger(1024, rng).toByteArrayUnsigned();
   var hash = Crypto.SHA256(message, {asBytes: true});
   var sig_b = s1.sign(hash);
-  ok(sig_b, "Sign random string");
+  assert.ok(sig_b, "Sign random string");
-  equals(sig_b.length, 70, "Signature is correct length");
+  assert.ok(s1.verify(hash, sig_b));
-  ok(s1.verify(hash, sig_b));
 
-  var message2 = Crypto.util.hexToBytes(
+  var message2 = bitcoinjs.convert.hexToBytes(
     "12dce2c169986b3346827ffb2305cf393984627f5f9722a1b1368e933c8d" +
     "d296653fbe5d7ac031c4962ad0eb1c4298c3b91d244e1116b4a76a130c13" +
     "1e7aec7fa70184a71a2e66797052831511b93c6e8d72ae58a1980eaacb66" +
@@ -86,27 +52,15 @@ test("Signing and Verifying", function () {
     "3d82507b932b84e4"
   );
   var hash2 = Crypto.SHA256(message2, {asBytes: true});
-  var sig_c = Crypto.util.hexToBytes(
+  var sig_c = bitcoinjs.convert.hexToBytes(
     "3044022038d9b8dd5c9fbf330565c1f51d72a59ba869aeb2c2001be959d3" +
     "79e861ec71960220a73945f32cf90d03127d2c3410d16cee120fa1a4b4c3" +
     "f273ab082801a95506c4"
   );
-  var s2 = Crypto.util.hexToBytes(
+  var s2 = bitcoinjs.convert.hexToBytes(
     "045a1594316e433fb91f35ef4874610d22177c3f1a1060f6c1e70a609d51" +
     "b20be5795cd2a5eae0d6b872ba42db95e9afaeea3fbb89e98099575b6828" +
     "609a978528"
   );
-  ok(Bitcoin.ECDSA.verify(hash2, sig_c, s2), "Verify constant signature");
+  assert.ok(bitcoinjs.ecdsa.verify(hash2, sig_c, s2), "Verify constant signature");
-});
-
-//
-// Testing Paillier
-// -----------------------------------------------------------------------------
-module("paillier");
-
-test("Classes", function () {
-  expect(3);
-  ok(Bitcoin.Paillier, "Bitcoin.Paillier");
-  ok(Bitcoin.Paillier.PublicKey, "Bitcoin.Paillier.PublicKey");
-  ok(Bitcoin.Paillier.PrivateKey, "Bitcoin.Paillier.PrivateKey");
 });