diff --git a/index.html b/index.html
index 3c256cf..ca2c60f 100644
--- a/index.html
+++ b/index.html
@@ -55,59 +55,59 @@ SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
 
   <script type="text/javascript">
 // Array.prototype.map function is in the public domain.
-// Production steps of ECMA-262, Edition 5, 15.4.4.19
-// Reference: http://es5.github.com/#x15.4.4.19
+// Production steps of ECMA-262, Edition 5, 15.4.4.19  
+// Reference: http://es5.github.com/#x15.4.4.19  
 if (!Array.prototype.map) {
 	Array.prototype.map = function (callback, thisArg) {
 		var T, A, k;
 		if (this == null) {
 			throw new TypeError(" this is null or not defined");
 		}
-		// 1. Let O be the result of calling ToObject passing the |this| value as the argument.
+		// 1. Let O be the result of calling ToObject passing the |this| value as the argument.  
 		var O = Object(this);
-		// 2. Let lenValue be the result of calling the Get internal method of O with the argument "length".
-		// 3. Let len be ToUint32(lenValue).
+		// 2. Let lenValue be the result of calling the Get internal method of O with the argument "length".  
+		// 3. Let len be ToUint32(lenValue).  
 		var len = O.length >>> 0;
-		// 4. If IsCallable(callback) is false, throw a TypeError exception.
-		// See: http://es5.github.com/#x9.11
+		// 4. If IsCallable(callback) is false, throw a TypeError exception.  
+		// See: http://es5.github.com/#x9.11  
 		if ({}.toString.call(callback) != "[object Function]") {
 			throw new TypeError(callback + " is not a function");
 		}
-		// 5. If thisArg was supplied, let T be thisArg; else let T be undefined.
+		// 5. If thisArg was supplied, let T be thisArg; else let T be undefined.  
 		if (thisArg) {
 			T = thisArg;
 		}
-		// 6. Let A be a new array created as if by the expression new Array(len) where Array is
-		// the standard built-in constructor with that name and len is the value of len.
+		// 6. Let A be a new array created as if by the expression new Array(len) where Array is  
+		// the standard built-in constructor with that name and len is the value of len.  
 		A = new Array(len);
-		// 7. Let k be 0
+		// 7. Let k be 0  
 		k = 0;
-		// 8. Repeat, while k < len
+		// 8. Repeat, while k < len  
 		while (k < len) {
 			var kValue, mappedValue;
-			// a. Let Pk be ToString(k).
-			//   This is implicit for LHS operands of the in operator
-			// b. Let kPresent be the result of calling the HasProperty internal method of O with argument Pk.
-			//   This step can be combined with c
-			// c. If kPresent is true, then
+			// a. Let Pk be ToString(k).  
+			//   This is implicit for LHS operands of the in operator  
+			// b. Let kPresent be the result of calling the HasProperty internal method of O with argument Pk.  
+			//   This step can be combined with c  
+			// c. If kPresent is true, then  
 			if (k in O) {
-				// i. Let kValue be the result of calling the Get internal method of O with argument Pk.
+				// i. Let kValue be the result of calling the Get internal method of O with argument Pk.  
 				kValue = O[k];
-				// ii. Let mappedValue be the result of calling the Call internal method of callback
-				// with T as the this value and argument list containing kValue, k, and O.
+				// ii. Let mappedValue be the result of calling the Call internal method of callback  
+				// with T as the this value and argument list containing kValue, k, and O.  
 				mappedValue = callback.call(T, kValue, k, O);
-				// iii. Call the DefineOwnProperty internal method of A with arguments
-				// Pk, Property Descriptor {Value: mappedValue, Writable: true, Enumerable: true, Configurable: true},
-				// and false.
-				// In browsers that support Object.defineProperty, use the following:
-				// Object.defineProperty(A, Pk, { value: mappedValue, writable: true, enumerable: true, configurable: true });
-				// For best browser support, use the following:
+				// iii. Call the DefineOwnProperty internal method of A with arguments  
+				// Pk, Property Descriptor {Value: mappedValue, Writable: true, Enumerable: true, Configurable: true},  
+				// and false.  
+				// In browsers that support Object.defineProperty, use the following:  
+				// Object.defineProperty(A, Pk, { value: mappedValue, writable: true, enumerable: true, configurable: true });  
+				// For best browser support, use the following:  
 				A[k] = mappedValue;
 			}
-			// d. Increase k by 1.
+			// d. Increase k by 1.  
 			k++;
 		}
-		// 9. return A
+		// 9. return A  
 		return A;
 	};
 }
@@ -606,7 +606,7 @@ if (typeof Crypto == "undefined" || !Crypto.util) {
 			// Allow mode to override options
 			if (mode.fixOptions) mode.fixOptions(options);
 
-			var
+			var 
 
 			// Convert to bytes if message is a string
 		m = (
@@ -647,7 +647,7 @@ if (typeof Crypto == "undefined" || !Crypto.util) {
 			// Allow mode to override options
 			if (mode.fixOptions) mode.fixOptions(options);
 
-			var
+			var 
 
 			// Convert to bytes if ciphertext is a string
 		c = (
@@ -1089,9 +1089,9 @@ if (typeof Crypto == "undefined" || !Crypto.util) {
 
 	/**
 	* Electronic Code Book mode.
-	*
+	* 
 	* ECB applies the cipher directly against each block of the input.
-	*
+	* 
 	* ECB does not require an initialization vector.
 	*/
 	var ECB = C_mode.ECB = function () {
@@ -1126,7 +1126,7 @@ if (typeof Crypto == "undefined" || !Crypto.util) {
 
 	/**
 	* Cipher block chaining
-	*
+	* 
 	* The first block is XORed with the IV. Subsequent blocks are XOR with the
 	* previous cipher output.
 	*/
@@ -1180,11 +1180,11 @@ if (typeof Crypto == "undefined" || !Crypto.util) {
 
 	/**
 	* Cipher feed back
-	*
+	* 
 	* The cipher output is XORed with the plain text to produce the cipher output,
 	* which is then fed back into the cipher to produce a bit pattern to XOR the
 	* next block with.
-	*
+	* 
 	* This is a stream cipher mode and does not require padding.
 	*/
 	var CFB = C_mode.CFB = function () {
@@ -1232,10 +1232,10 @@ if (typeof Crypto == "undefined" || !Crypto.util) {
 
 	/**
 	* Output feed back
-	*
+	* 
 	* The cipher repeatedly encrypts its own output. The output is XORed with the
 	* plain text to produce the cipher text.
-	*
+	* 
 	* This is a stream cipher mode and does not require padding.
 	*/
 	var OFB = C_mode.OFB = function () {
@@ -1491,11 +1491,11 @@ if (typeof Crypto == "undefined" || !Crypto.util) {
   <script type="text/javascript">
 /*!
 * Random number generator with ArcFour PRNG
-*
+* 
 * NOTE: For best results, put code like
 * <body onclick='SecureRandom.seedTime();' onkeypress='SecureRandom.seedTime();'>
 * in your main HTML document.
-*
+* 
 * Copyright Tom Wu, bitaddress.org  BSD License.
 * http://www-cs-students.stanford.edu/~tjw/jsbn/LICENSE
 */
@@ -1547,7 +1547,7 @@ if (typeof Crypto == "undefined" || !Crypto.util) {
 			alert("Premature initialisation of the random generator. Something is really wrong, do not generate wallets.");
 			return NaN;
 		}
-
+		
 		if (sr.state == null) {
 			sr.seedTime();
 			sr.state = sr.ArcFour(); // Plug in your RNG constructor here
@@ -1683,7 +1683,7 @@ if (typeof Crypto == "undefined" || !Crypto.util) {
 * Basic Javascript Elliptic Curve implementation
 * Ported loosely from BouncyCastle's Java EC code
 * Only Fp curves implemented for now
-*
+* 
 * Copyright Tom Wu, bitaddress.org  BSD License.
 * http://www-cs-students.stanford.edu/~tjw/jsbn/LICENSE
 */
@@ -1744,7 +1744,7 @@ if (typeof Crypto == "undefined" || !Crypto.util) {
 	/**
 	* return a sqrt root - the routine verifies that the calculation
 	* returns the right value - if none exists it returns null.
-	*
+	* 
 	* Copyright (c) 2000 - 2011 The Legion Of The Bouncy Castle (http://www.bouncycastle.org)
 	* Ported to JavaScript by bitaddress.org
 	*/
@@ -2033,7 +2033,7 @@ if (typeof Crypto == "undefined" || !Crypto.util) {
 		var len = 32; // integerToBytes will zero pad if integer is less than 32 bytes. 32 bytes length is required by the Bitcoin protocol.
 		var enc = ec.integerToBytes(x, len);
 
-		// when compressed prepend byte depending if y point is even or odd
+		// when compressed prepend byte depending if y point is even or odd 
 		if (compressed) {
 			if (y.isEven()) {
 				enc.unshift(0x02);
@@ -2351,7 +2351,7 @@ if (typeof Crypto == "undefined" || !Crypto.util) {
   <script type="text/javascript">
 /*!
 * Basic JavaScript BN library - subset useful for RSA encryption. v1.3
-*
+* 
 * Copyright (c) 2005  Tom Wu
 * All Rights Reserved.
 * BSD License
@@ -3632,7 +3632,7 @@ if (typeof Crypto == "undefined" || !Crypto.util) {
 // Licensed under the MIT license:
 //   http://www.opensource.org/licenses/mit-license.php
 //
-// The word "QR Code" is registered trademark of
+// The word "QR Code" is registered trademark of 
 // DENSO WAVE INCORPORATED
 //   http://www.denso-wave.com/qrcode/faqpatent-e.html
 //
@@ -3846,7 +3846,7 @@ if (typeof Crypto == "undefined" || !Crypto.util) {
 			var data = (this.errorCorrectLevel << 3) | maskPattern;
 			var bits = QRCode.Util.getBCHTypeInfo(data);
 
-			// vertical
+			// vertical		
 			for (var i = 0; i < 15; i++) {
 
 				var mod = (!test && ((bits >> i) & 1) == 1);
@@ -4529,7 +4529,7 @@ if (typeof Crypto == "undefined" || !Crypto.util) {
 	[2, 35, 17],
 	[2, 35, 13],
 
-	// 4
+	// 4		
 	[1, 100, 80],
 	[2, 50, 32],
 	[2, 50, 24],
@@ -4547,7 +4547,7 @@ if (typeof Crypto == "undefined" || !Crypto.util) {
 	[4, 43, 19],
 	[4, 43, 15],
 
-	// 7
+	// 7		
 	[2, 98, 78],
 	[4, 49, 31],
 	[2, 32, 14, 4, 33, 15],
@@ -4565,7 +4565,7 @@ if (typeof Crypto == "undefined" || !Crypto.util) {
 	[4, 36, 16, 4, 37, 17],
 	[4, 36, 12, 4, 37, 13],
 
-	// 10
+	// 10		
 	[2, 86, 68, 2, 87, 69],
 	[4, 69, 43, 1, 70, 44],
 	[6, 43, 19, 2, 44, 20],
@@ -4935,7 +4935,7 @@ Bitcoin.ECDSA = (function () {
 		* Parses a byte array containing a DER-encoded signature.
 		*
 		* This function will return an object of the form:
-		*
+		* 
 		* {
 		*   r: BigInteger,
 		*   s: BigInteger
@@ -5113,7 +5113,7 @@ Bitcoin.ECKey = (function () {
 			} else if (ECKey.isBase64Format(input)) {
 				bytes = Crypto.util.base64ToBytes(input);
 			}
-
+			
 			if (ECKey.isBase6Format(input)) {
 				this.priv = new BigInteger(input, 6);
 			} else if (bytes == null || bytes.length != 32) {
@@ -5211,7 +5211,7 @@ Bitcoin.ECKey = (function () {
 		return this;
 	};
 
-	// Sipa Private Key Wallet Import Format
+	// Sipa Private Key Wallet Import Format 
 	ECKey.prototype.getBitcoinWalletImportFormat = function () {
 		var bytes = this.getBitcoinPrivateKeyByteArray();
 		bytes.unshift(janin.currency.privateKeyPrefix()); // prepend private key prefix
@@ -5222,12 +5222,12 @@ Bitcoin.ECKey = (function () {
 		return privWif;
 	};
 
-	// Private Key Hex Format
+	// Private Key Hex Format 
 	ECKey.prototype.getBitcoinHexFormat = function () {
 		return Crypto.util.bytesToHex(this.getBitcoinPrivateKeyByteArray()).toString().toUpperCase();
 	};
 
-	// Private Key Base64 Format
+	// Private Key Base64 Format 
 	ECKey.prototype.getBitcoinBase64Format = function () {
 		return Crypto.util.bytesToBase64(this.getBitcoinPrivateKeyByteArray());
 	};
@@ -5235,7 +5235,7 @@ Bitcoin.ECKey = (function () {
 	ECKey.prototype.getBitcoinPrivateKeyByteArray = function () {
 		// Get a copy of private key as a byte array
 		var bytes = this.priv.toByteArrayUnsigned();
-		// zero pad if private key is less than 32 bytes
+		// zero pad if private key is less than 32 bytes 
 		while (bytes.length < 32) bytes.unshift(0x00);
 		return bytes;
 	};
@@ -5459,17 +5459,17 @@ Bitcoin.Util = {
   <script type="text/javascript">
 /*
 * Copyright (c) 2010-2011 Intalio Pte, All Rights Reserved
-*
+* 
 * Permission is hereby granted, free of charge, to any person obtaining a copy
 * of this software and associated documentation files (the "Software"), to deal
 * in the Software without restriction, including without limitation the rights
 * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
 * copies of the Software, and to permit persons to whom the Software is
 * furnished to do so, subject to the following conditions:
-*
+* 
 * The above copyright notice and this permission notice shall be included in
 * all copies or substantial portions of the Software.
-*
+* 
 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
@@ -5489,7 +5489,7 @@ Bitcoin.Util = {
 	* N = Cpu cost
 	* r = Memory cost
 	* p = parallelization cost
-	*
+	* 
 	*/
 	window.Crypto_scrypt = function (passwd, salt, N, r, p, dkLen, callback) {
 		if (N == 0 || (N & (N - 1)) != 0) throw Error("N must be > 0 and a power of 2");
@@ -5755,10 +5755,10 @@ Bitcoin.Util = {
   </script>
   <script type="text/javascript">
 /*
-  Ported to JavaScript by Lazar Laszlo 2011
-
+  Ported to JavaScript by Lazar Laszlo 2011 
+  
   lazarsoft@gmail.com, www.lazarsoft.info
-
+  
 */
 
 /*
@@ -5849,7 +5849,7 @@ GridSampler.checkAndNudgePoints=function( image,  points)
 				}
 			}
 		}
-
+	
 
 
 GridSampler.sampleGrid3=function( image,  dimension,  transform)
@@ -5902,7 +5902,7 @@ GridSampler.sampleGrid3=function( image,  dimension,  transform)
 GridSampler.sampleGridx=function( image,  dimension,  p1ToX,  p1ToY,  p2ToX,  p2ToY,  p3ToX,  p3ToY,  p4ToX,  p4ToY,  p1FromX,  p1FromY,  p2FromX,  p2FromY,  p3FromX,  p3FromY,  p4FromX,  p4FromY)
 {
 	var transform = PerspectiveTransform.quadrilateralToQuadrilateral(p1ToX, p1ToY, p2ToX, p2ToY, p3ToX, p3ToY, p4ToX, p4ToY, p1FromX, p1FromY, p2FromX, p2FromY, p3FromX, p3FromY, p4FromX, p4FromY);
-
+			
 	return GridSampler.sampleGrid3(image, dimension, transform);
 }
 
@@ -5910,7 +5910,7 @@ function ECB(count,  dataCodewords)
 {
 	this.count = count;
 	this.dataCodewords = dataCodewords;
-
+	
 	this.__defineGetter__("Count", function()
 	{
 		return this.count;
@@ -5928,17 +5928,17 @@ function ECBlocks( ecCodewordsPerBlock,  ecBlocks1,  ecBlocks2)
 		this.ecBlocks = new Array(ecBlocks1, ecBlocks2);
 	else
 		this.ecBlocks = new Array(ecBlocks1);
-
+	
 	this.__defineGetter__("ECCodewordsPerBlock", function()
 	{
 		return this.ecCodewordsPerBlock;
 	});
-
+	
 	this.__defineGetter__("TotalECCodewords", function()
 	{
 		return  this.ecCodewordsPerBlock * this.NumBlocks;
 	});
-
+	
 	this.__defineGetter__("NumBlocks", function()
 	{
 		var total = 0;
@@ -5948,7 +5948,7 @@ function ECBlocks( ecCodewordsPerBlock,  ecBlocks1,  ecBlocks2)
 		}
 		return total;
 	});
-
+	
 	this.getECBlocks=function()
 			{
 				return this.ecBlocks;
@@ -5960,7 +5960,7 @@ function Version( versionNumber,  alignmentPatternCenters,  ecBlocks1,  ecBlocks
 	this.versionNumber = versionNumber;
 	this.alignmentPatternCenters = alignmentPatternCenters;
 	this.ecBlocks = new Array(ecBlocks1, ecBlocks2, ecBlocks3, ecBlocks4);
-
+	
 	var total = 0;
 	var ecCodewords = ecBlocks1.ECCodewordsPerBlock;
 	var ecbArray = ecBlocks1.getECBlocks();
@@ -5970,12 +5970,12 @@ function Version( versionNumber,  alignmentPatternCenters,  ecBlocks1,  ecBlocks
 		total += ecBlock.Count * (ecBlock.DataCodewords + ecCodewords);
 	}
 	this.totalCodewords = total;
-
+	
 	this.__defineGetter__("VersionNumber", function()
 	{
 		return  this.versionNumber;
 	});
-
+	
 	this.__defineGetter__("AlignmentPatternCenters", function()
 	{
 		return  this.alignmentPatternCenters;
@@ -5988,19 +5988,19 @@ function Version( versionNumber,  alignmentPatternCenters,  ecBlocks1,  ecBlocks
 	{
 		return  17 + 4 * this.versionNumber;
 	});
-
+	
 	this.buildFunctionPattern=function()
 		{
 			var dimension = this.DimensionForVersion;
 			var bitMatrix = new BitMatrix(dimension);
-
+			
 			// Top left finder pattern + separator + format
 			bitMatrix.setRegion(0, 0, 9, 9);
 			// Top right finder pattern + separator + format
 			bitMatrix.setRegion(dimension - 8, 0, 8, 9);
 			// Bottom left finder pattern + separator + format
 			bitMatrix.setRegion(0, dimension - 8, 9, 8);
-
+			
 			// Alignment patterns
 			var max = this.alignmentPatternCenters.length;
 			for (var x = 0; x < max; x++)
@@ -6016,12 +6016,12 @@ function Version( versionNumber,  alignmentPatternCenters,  ecBlocks1,  ecBlocks
 					bitMatrix.setRegion(this.alignmentPatternCenters[y] - 2, i, 5, 5);
 				}
 			}
-
+			
 			// Vertical timing pattern
 			bitMatrix.setRegion(6, 9, 1, dimension - 17);
 			// Horizontal timing pattern
 			bitMatrix.setRegion(9, 6, dimension - 17, 1);
-
+			
 			if (this.versionNumber > 6)
 			{
 				// Version info, top right
@@ -6029,7 +6029,7 @@ function Version( versionNumber,  alignmentPatternCenters,  ecBlocks1,  ecBlocks
 				// Version info, bottom left
 				bitMatrix.setRegion(0, dimension - 11, 6, 3);
 			}
-
+			
 			return bitMatrix;
 		}
 	this.getECBlocksForLevel=function( ecLevel)
@@ -6100,45 +6100,45 @@ Version.decodeVersionInformation=function( versionBits)
 
 function buildVersions()
 {
-	return new Array(new Version(1, new Array(), new ECBlocks(7, new ECB(1, 19)), new ECBlocks(10, new ECB(1, 16)), new ECBlocks(13, new ECB(1, 13)), new ECBlocks(17, new ECB(1, 9))),
-	new Version(2, new Array(6, 18), new ECBlocks(10, new ECB(1, 34)), new ECBlocks(16, new ECB(1, 28)), new ECBlocks(22, new ECB(1, 22)), new ECBlocks(28, new ECB(1, 16))),
-	new Version(3, new Array(6, 22), new ECBlocks(15, new ECB(1, 55)), new ECBlocks(26, new ECB(1, 44)), new ECBlocks(18, new ECB(2, 17)), new ECBlocks(22, new ECB(2, 13))),
-	new Version(4, new Array(6, 26), new ECBlocks(20, new ECB(1, 80)), new ECBlocks(18, new ECB(2, 32)), new ECBlocks(26, new ECB(2, 24)), new ECBlocks(16, new ECB(4, 9))),
-	new Version(5, new Array(6, 30), new ECBlocks(26, new ECB(1, 108)), new ECBlocks(24, new ECB(2, 43)), new ECBlocks(18, new ECB(2, 15), new ECB(2, 16)), new ECBlocks(22, new ECB(2, 11), new ECB(2, 12))),
-	new Version(6, new Array(6, 34), new ECBlocks(18, new ECB(2, 68)), new ECBlocks(16, new ECB(4, 27)), new ECBlocks(24, new ECB(4, 19)), new ECBlocks(28, new ECB(4, 15))),
-	new Version(7, new Array(6, 22, 38), new ECBlocks(20, new ECB(2, 78)), new ECBlocks(18, new ECB(4, 31)), new ECBlocks(18, new ECB(2, 14), new ECB(4, 15)), new ECBlocks(26, new ECB(4, 13), new ECB(1, 14))),
-	new Version(8, new Array(6, 24, 42), new ECBlocks(24, new ECB(2, 97)), new ECBlocks(22, new ECB(2, 38), new ECB(2, 39)), new ECBlocks(22, new ECB(4, 18), new ECB(2, 19)), new ECBlocks(26, new ECB(4, 14), new ECB(2, 15))),
-	new Version(9, new Array(6, 26, 46), new ECBlocks(30, new ECB(2, 116)), new ECBlocks(22, new ECB(3, 36), new ECB(2, 37)), new ECBlocks(20, new ECB(4, 16), new ECB(4, 17)), new ECBlocks(24, new ECB(4, 12), new ECB(4, 13))),
-	new Version(10, new Array(6, 28, 50), new ECBlocks(18, new ECB(2, 68), new ECB(2, 69)), new ECBlocks(26, new ECB(4, 43), new ECB(1, 44)), new ECBlocks(24, new ECB(6, 19), new ECB(2, 20)), new ECBlocks(28, new ECB(6, 15), new ECB(2, 16))),
-	new Version(11, new Array(6, 30, 54), new ECBlocks(20, new ECB(4, 81)), new ECBlocks(30, new ECB(1, 50), new ECB(4, 51)), new ECBlocks(28, new ECB(4, 22), new ECB(4, 23)), new ECBlocks(24, new ECB(3, 12), new ECB(8, 13))),
-	new Version(12, new Array(6, 32, 58), new ECBlocks(24, new ECB(2, 92), new ECB(2, 93)), new ECBlocks(22, new ECB(6, 36), new ECB(2, 37)), new ECBlocks(26, new ECB(4, 20), new ECB(6, 21)), new ECBlocks(28, new ECB(7, 14), new ECB(4, 15))),
-	new Version(13, new Array(6, 34, 62), new ECBlocks(26, new ECB(4, 107)), new ECBlocks(22, new ECB(8, 37), new ECB(1, 38)), new ECBlocks(24, new ECB(8, 20), new ECB(4, 21)), new ECBlocks(22, new ECB(12, 11), new ECB(4, 12))),
-	new Version(14, new Array(6, 26, 46, 66), new ECBlocks(30, new ECB(3, 115), new ECB(1, 116)), new ECBlocks(24, new ECB(4, 40), new ECB(5, 41)), new ECBlocks(20, new ECB(11, 16), new ECB(5, 17)), new ECBlocks(24, new ECB(11, 12), new ECB(5, 13))),
-	new Version(15, new Array(6, 26, 48, 70), new ECBlocks(22, new ECB(5, 87), new ECB(1, 88)), new ECBlocks(24, new ECB(5, 41), new ECB(5, 42)), new ECBlocks(30, new ECB(5, 24), new ECB(7, 25)), new ECBlocks(24, new ECB(11, 12), new ECB(7, 13))),
-	new Version(16, new Array(6, 26, 50, 74), new ECBlocks(24, new ECB(5, 98), new ECB(1, 99)), new ECBlocks(28, new ECB(7, 45), new ECB(3, 46)), new ECBlocks(24, new ECB(15, 19), new ECB(2, 20)), new ECBlocks(30, new ECB(3, 15), new ECB(13, 16))),
-	new Version(17, new Array(6, 30, 54, 78), new ECBlocks(28, new ECB(1, 107), new ECB(5, 108)), new ECBlocks(28, new ECB(10, 46), new ECB(1, 47)), new ECBlocks(28, new ECB(1, 22), new ECB(15, 23)), new ECBlocks(28, new ECB(2, 14), new ECB(17, 15))),
-	new Version(18, new Array(6, 30, 56, 82), new ECBlocks(30, new ECB(5, 120), new ECB(1, 121)), new ECBlocks(26, new ECB(9, 43), new ECB(4, 44)), new ECBlocks(28, new ECB(17, 22), new ECB(1, 23)), new ECBlocks(28, new ECB(2, 14), new ECB(19, 15))),
-	new Version(19, new Array(6, 30, 58, 86), new ECBlocks(28, new ECB(3, 113), new ECB(4, 114)), new ECBlocks(26, new ECB(3, 44), new ECB(11, 45)), new ECBlocks(26, new ECB(17, 21), new ECB(4, 22)), new ECBlocks(26, new ECB(9, 13), new ECB(16, 14))),
-	new Version(20, new Array(6, 34, 62, 90), new ECBlocks(28, new ECB(3, 107), new ECB(5, 108)), new ECBlocks(26, new ECB(3, 41), new ECB(13, 42)), new ECBlocks(30, new ECB(15, 24), new ECB(5, 25)), new ECBlocks(28, new ECB(15, 15), new ECB(10, 16))),
-	new Version(21, new Array(6, 28, 50, 72, 94), new ECBlocks(28, new ECB(4, 116), new ECB(4, 117)), new ECBlocks(26, new ECB(17, 42)), new ECBlocks(28, new ECB(17, 22), new ECB(6, 23)), new ECBlocks(30, new ECB(19, 16), new ECB(6, 17))),
-	new Version(22, new Array(6, 26, 50, 74, 98), new ECBlocks(28, new ECB(2, 111), new ECB(7, 112)), new ECBlocks(28, new ECB(17, 46)), new ECBlocks(30, new ECB(7, 24), new ECB(16, 25)), new ECBlocks(24, new ECB(34, 13))),
-	new Version(23, new Array(6, 30, 54, 74, 102), new ECBlocks(30, new ECB(4, 121), new ECB(5, 122)), new ECBlocks(28, new ECB(4, 47), new ECB(14, 48)), new ECBlocks(30, new ECB(11, 24), new ECB(14, 25)), new ECBlocks(30, new ECB(16, 15), new ECB(14, 16))),
-	new Version(24, new Array(6, 28, 54, 80, 106), new ECBlocks(30, new ECB(6, 117), new ECB(4, 118)), new ECBlocks(28, new ECB(6, 45), new ECB(14, 46)), new ECBlocks(30, new ECB(11, 24), new ECB(16, 25)), new ECBlocks(30, new ECB(30, 16), new ECB(2, 17))),
-	new Version(25, new Array(6, 32, 58, 84, 110), new ECBlocks(26, new ECB(8, 106), new ECB(4, 107)), new ECBlocks(28, new ECB(8, 47), new ECB(13, 48)), new ECBlocks(30, new ECB(7, 24), new ECB(22, 25)), new ECBlocks(30, new ECB(22, 15), new ECB(13, 16))),
-	new Version(26, new Array(6, 30, 58, 86, 114), new ECBlocks(28, new ECB(10, 114), new ECB(2, 115)), new ECBlocks(28, new ECB(19, 46), new ECB(4, 47)), new ECBlocks(28, new ECB(28, 22), new ECB(6, 23)), new ECBlocks(30, new ECB(33, 16), new ECB(4, 17))),
+	return new Array(new Version(1, new Array(), new ECBlocks(7, new ECB(1, 19)), new ECBlocks(10, new ECB(1, 16)), new ECBlocks(13, new ECB(1, 13)), new ECBlocks(17, new ECB(1, 9))), 
+	new Version(2, new Array(6, 18), new ECBlocks(10, new ECB(1, 34)), new ECBlocks(16, new ECB(1, 28)), new ECBlocks(22, new ECB(1, 22)), new ECBlocks(28, new ECB(1, 16))), 
+	new Version(3, new Array(6, 22), new ECBlocks(15, new ECB(1, 55)), new ECBlocks(26, new ECB(1, 44)), new ECBlocks(18, new ECB(2, 17)), new ECBlocks(22, new ECB(2, 13))), 
+	new Version(4, new Array(6, 26), new ECBlocks(20, new ECB(1, 80)), new ECBlocks(18, new ECB(2, 32)), new ECBlocks(26, new ECB(2, 24)), new ECBlocks(16, new ECB(4, 9))), 
+	new Version(5, new Array(6, 30), new ECBlocks(26, new ECB(1, 108)), new ECBlocks(24, new ECB(2, 43)), new ECBlocks(18, new ECB(2, 15), new ECB(2, 16)), new ECBlocks(22, new ECB(2, 11), new ECB(2, 12))), 
+	new Version(6, new Array(6, 34), new ECBlocks(18, new ECB(2, 68)), new ECBlocks(16, new ECB(4, 27)), new ECBlocks(24, new ECB(4, 19)), new ECBlocks(28, new ECB(4, 15))), 
+	new Version(7, new Array(6, 22, 38), new ECBlocks(20, new ECB(2, 78)), new ECBlocks(18, new ECB(4, 31)), new ECBlocks(18, new ECB(2, 14), new ECB(4, 15)), new ECBlocks(26, new ECB(4, 13), new ECB(1, 14))), 
+	new Version(8, new Array(6, 24, 42), new ECBlocks(24, new ECB(2, 97)), new ECBlocks(22, new ECB(2, 38), new ECB(2, 39)), new ECBlocks(22, new ECB(4, 18), new ECB(2, 19)), new ECBlocks(26, new ECB(4, 14), new ECB(2, 15))), 
+	new Version(9, new Array(6, 26, 46), new ECBlocks(30, new ECB(2, 116)), new ECBlocks(22, new ECB(3, 36), new ECB(2, 37)), new ECBlocks(20, new ECB(4, 16), new ECB(4, 17)), new ECBlocks(24, new ECB(4, 12), new ECB(4, 13))), 
+	new Version(10, new Array(6, 28, 50), new ECBlocks(18, new ECB(2, 68), new ECB(2, 69)), new ECBlocks(26, new ECB(4, 43), new ECB(1, 44)), new ECBlocks(24, new ECB(6, 19), new ECB(2, 20)), new ECBlocks(28, new ECB(6, 15), new ECB(2, 16))), 
+	new Version(11, new Array(6, 30, 54), new ECBlocks(20, new ECB(4, 81)), new ECBlocks(30, new ECB(1, 50), new ECB(4, 51)), new ECBlocks(28, new ECB(4, 22), new ECB(4, 23)), new ECBlocks(24, new ECB(3, 12), new ECB(8, 13))), 
+	new Version(12, new Array(6, 32, 58), new ECBlocks(24, new ECB(2, 92), new ECB(2, 93)), new ECBlocks(22, new ECB(6, 36), new ECB(2, 37)), new ECBlocks(26, new ECB(4, 20), new ECB(6, 21)), new ECBlocks(28, new ECB(7, 14), new ECB(4, 15))), 
+	new Version(13, new Array(6, 34, 62), new ECBlocks(26, new ECB(4, 107)), new ECBlocks(22, new ECB(8, 37), new ECB(1, 38)), new ECBlocks(24, new ECB(8, 20), new ECB(4, 21)), new ECBlocks(22, new ECB(12, 11), new ECB(4, 12))), 
+	new Version(14, new Array(6, 26, 46, 66), new ECBlocks(30, new ECB(3, 115), new ECB(1, 116)), new ECBlocks(24, new ECB(4, 40), new ECB(5, 41)), new ECBlocks(20, new ECB(11, 16), new ECB(5, 17)), new ECBlocks(24, new ECB(11, 12), new ECB(5, 13))), 
+	new Version(15, new Array(6, 26, 48, 70), new ECBlocks(22, new ECB(5, 87), new ECB(1, 88)), new ECBlocks(24, new ECB(5, 41), new ECB(5, 42)), new ECBlocks(30, new ECB(5, 24), new ECB(7, 25)), new ECBlocks(24, new ECB(11, 12), new ECB(7, 13))), 
+	new Version(16, new Array(6, 26, 50, 74), new ECBlocks(24, new ECB(5, 98), new ECB(1, 99)), new ECBlocks(28, new ECB(7, 45), new ECB(3, 46)), new ECBlocks(24, new ECB(15, 19), new ECB(2, 20)), new ECBlocks(30, new ECB(3, 15), new ECB(13, 16))), 
+	new Version(17, new Array(6, 30, 54, 78), new ECBlocks(28, new ECB(1, 107), new ECB(5, 108)), new ECBlocks(28, new ECB(10, 46), new ECB(1, 47)), new ECBlocks(28, new ECB(1, 22), new ECB(15, 23)), new ECBlocks(28, new ECB(2, 14), new ECB(17, 15))), 
+	new Version(18, new Array(6, 30, 56, 82), new ECBlocks(30, new ECB(5, 120), new ECB(1, 121)), new ECBlocks(26, new ECB(9, 43), new ECB(4, 44)), new ECBlocks(28, new ECB(17, 22), new ECB(1, 23)), new ECBlocks(28, new ECB(2, 14), new ECB(19, 15))), 
+	new Version(19, new Array(6, 30, 58, 86), new ECBlocks(28, new ECB(3, 113), new ECB(4, 114)), new ECBlocks(26, new ECB(3, 44), new ECB(11, 45)), new ECBlocks(26, new ECB(17, 21), new ECB(4, 22)), new ECBlocks(26, new ECB(9, 13), new ECB(16, 14))), 
+	new Version(20, new Array(6, 34, 62, 90), new ECBlocks(28, new ECB(3, 107), new ECB(5, 108)), new ECBlocks(26, new ECB(3, 41), new ECB(13, 42)), new ECBlocks(30, new ECB(15, 24), new ECB(5, 25)), new ECBlocks(28, new ECB(15, 15), new ECB(10, 16))), 
+	new Version(21, new Array(6, 28, 50, 72, 94), new ECBlocks(28, new ECB(4, 116), new ECB(4, 117)), new ECBlocks(26, new ECB(17, 42)), new ECBlocks(28, new ECB(17, 22), new ECB(6, 23)), new ECBlocks(30, new ECB(19, 16), new ECB(6, 17))), 
+	new Version(22, new Array(6, 26, 50, 74, 98), new ECBlocks(28, new ECB(2, 111), new ECB(7, 112)), new ECBlocks(28, new ECB(17, 46)), new ECBlocks(30, new ECB(7, 24), new ECB(16, 25)), new ECBlocks(24, new ECB(34, 13))), 
+	new Version(23, new Array(6, 30, 54, 74, 102), new ECBlocks(30, new ECB(4, 121), new ECB(5, 122)), new ECBlocks(28, new ECB(4, 47), new ECB(14, 48)), new ECBlocks(30, new ECB(11, 24), new ECB(14, 25)), new ECBlocks(30, new ECB(16, 15), new ECB(14, 16))), 
+	new Version(24, new Array(6, 28, 54, 80, 106), new ECBlocks(30, new ECB(6, 117), new ECB(4, 118)), new ECBlocks(28, new ECB(6, 45), new ECB(14, 46)), new ECBlocks(30, new ECB(11, 24), new ECB(16, 25)), new ECBlocks(30, new ECB(30, 16), new ECB(2, 17))), 
+	new Version(25, new Array(6, 32, 58, 84, 110), new ECBlocks(26, new ECB(8, 106), new ECB(4, 107)), new ECBlocks(28, new ECB(8, 47), new ECB(13, 48)), new ECBlocks(30, new ECB(7, 24), new ECB(22, 25)), new ECBlocks(30, new ECB(22, 15), new ECB(13, 16))), 
+	new Version(26, new Array(6, 30, 58, 86, 114), new ECBlocks(28, new ECB(10, 114), new ECB(2, 115)), new ECBlocks(28, new ECB(19, 46), new ECB(4, 47)), new ECBlocks(28, new ECB(28, 22), new ECB(6, 23)), new ECBlocks(30, new ECB(33, 16), new ECB(4, 17))), 
 	new Version(27, new Array(6, 34, 62, 90, 118), new ECBlocks(30, new ECB(8, 122), new ECB(4, 123)), new ECBlocks(28, new ECB(22, 45), new ECB(3, 46)), new ECBlocks(30, new ECB(8, 23), new ECB(26, 24)), new ECBlocks(30, new ECB(12, 15), 		new ECB(28, 16))),
-	new Version(28, new Array(6, 26, 50, 74, 98, 122), new ECBlocks(30, new ECB(3, 117), new ECB(10, 118)), new ECBlocks(28, new ECB(3, 45), new ECB(23, 46)), new ECBlocks(30, new ECB(4, 24), new ECB(31, 25)), new ECBlocks(30, new ECB(11, 15), new ECB(31, 16))),
-	new Version(29, new Array(6, 30, 54, 78, 102, 126), new ECBlocks(30, new ECB(7, 116), new ECB(7, 117)), new ECBlocks(28, new ECB(21, 45), new ECB(7, 46)), new ECBlocks(30, new ECB(1, 23), new ECB(37, 24)), new ECBlocks(30, new ECB(19, 15), new ECB(26, 16))),
-	new Version(30, new Array(6, 26, 52, 78, 104, 130), new ECBlocks(30, new ECB(5, 115), new ECB(10, 116)), new ECBlocks(28, new ECB(19, 47), new ECB(10, 48)), new ECBlocks(30, new ECB(15, 24), new ECB(25, 25)), new ECBlocks(30, new ECB(23, 15), new ECB(25, 16))),
-	new Version(31, new Array(6, 30, 56, 82, 108, 134), new ECBlocks(30, new ECB(13, 115), new ECB(3, 116)), new ECBlocks(28, new ECB(2, 46), new ECB(29, 47)), new ECBlocks(30, new ECB(42, 24), new ECB(1, 25)), new ECBlocks(30, new ECB(23, 15), new ECB(28, 16))),
-	new Version(32, new Array(6, 34, 60, 86, 112, 138), new ECBlocks(30, new ECB(17, 115)), new ECBlocks(28, new ECB(10, 46), new ECB(23, 47)), new ECBlocks(30, new ECB(10, 24), new ECB(35, 25)), new ECBlocks(30, new ECB(19, 15), new ECB(35, 16))),
-	new Version(33, new Array(6, 30, 58, 86, 114, 142), new ECBlocks(30, new ECB(17, 115), new ECB(1, 116)), new ECBlocks(28, new ECB(14, 46), new ECB(21, 47)), new ECBlocks(30, new ECB(29, 24), new ECB(19, 25)), new ECBlocks(30, new ECB(11, 15), new ECB(46, 16))),
-	new Version(34, new Array(6, 34, 62, 90, 118, 146), new ECBlocks(30, new ECB(13, 115), new ECB(6, 116)), new ECBlocks(28, new ECB(14, 46), new ECB(23, 47)), new ECBlocks(30, new ECB(44, 24), new ECB(7, 25)), new ECBlocks(30, new ECB(59, 16), new ECB(1, 17))),
-	new Version(35, new Array(6, 30, 54, 78, 102, 126, 150), new ECBlocks(30, new ECB(12, 121), new ECB(7, 122)), new ECBlocks(28, new ECB(12, 47), new ECB(26, 48)), new ECBlocks(30, new ECB(39, 24), new ECB(14, 25)),new ECBlocks(30, new ECB(22, 15), new ECB(41, 16))),
-	new Version(36, new Array(6, 24, 50, 76, 102, 128, 154), new ECBlocks(30, new ECB(6, 121), new ECB(14, 122)), new ECBlocks(28, new ECB(6, 47), new ECB(34, 48)), new ECBlocks(30, new ECB(46, 24), new ECB(10, 25)), new ECBlocks(30, new ECB(2, 15), new ECB(64, 16))),
-	new Version(37, new Array(6, 28, 54, 80, 106, 132, 158), new ECBlocks(30, new ECB(17, 122), new ECB(4, 123)), new ECBlocks(28, new ECB(29, 46), new ECB(14, 47)), new ECBlocks(30, new ECB(49, 24), new ECB(10, 25)), new ECBlocks(30, new ECB(24, 15), new ECB(46, 16))),
-	new Version(38, new Array(6, 32, 58, 84, 110, 136, 162), new ECBlocks(30, new ECB(4, 122), new ECB(18, 123)), new ECBlocks(28, new ECB(13, 46), new ECB(32, 47)), new ECBlocks(30, new ECB(48, 24), new ECB(14, 25)), new ECBlocks(30, new ECB(42, 15), new ECB(32, 16))),
-	new Version(39, new Array(6, 26, 54, 82, 110, 138, 166), new ECBlocks(30, new ECB(20, 117), new ECB(4, 118)), new ECBlocks(28, new ECB(40, 47), new ECB(7, 48)), new ECBlocks(30, new ECB(43, 24), new ECB(22, 25)), new ECBlocks(30, new ECB(10, 15), new ECB(67, 16))),
+	new Version(28, new Array(6, 26, 50, 74, 98, 122), new ECBlocks(30, new ECB(3, 117), new ECB(10, 118)), new ECBlocks(28, new ECB(3, 45), new ECB(23, 46)), new ECBlocks(30, new ECB(4, 24), new ECB(31, 25)), new ECBlocks(30, new ECB(11, 15), new ECB(31, 16))), 
+	new Version(29, new Array(6, 30, 54, 78, 102, 126), new ECBlocks(30, new ECB(7, 116), new ECB(7, 117)), new ECBlocks(28, new ECB(21, 45), new ECB(7, 46)), new ECBlocks(30, new ECB(1, 23), new ECB(37, 24)), new ECBlocks(30, new ECB(19, 15), new ECB(26, 16))), 
+	new Version(30, new Array(6, 26, 52, 78, 104, 130), new ECBlocks(30, new ECB(5, 115), new ECB(10, 116)), new ECBlocks(28, new ECB(19, 47), new ECB(10, 48)), new ECBlocks(30, new ECB(15, 24), new ECB(25, 25)), new ECBlocks(30, new ECB(23, 15), new ECB(25, 16))), 
+	new Version(31, new Array(6, 30, 56, 82, 108, 134), new ECBlocks(30, new ECB(13, 115), new ECB(3, 116)), new ECBlocks(28, new ECB(2, 46), new ECB(29, 47)), new ECBlocks(30, new ECB(42, 24), new ECB(1, 25)), new ECBlocks(30, new ECB(23, 15), new ECB(28, 16))), 
+	new Version(32, new Array(6, 34, 60, 86, 112, 138), new ECBlocks(30, new ECB(17, 115)), new ECBlocks(28, new ECB(10, 46), new ECB(23, 47)), new ECBlocks(30, new ECB(10, 24), new ECB(35, 25)), new ECBlocks(30, new ECB(19, 15), new ECB(35, 16))), 
+	new Version(33, new Array(6, 30, 58, 86, 114, 142), new ECBlocks(30, new ECB(17, 115), new ECB(1, 116)), new ECBlocks(28, new ECB(14, 46), new ECB(21, 47)), new ECBlocks(30, new ECB(29, 24), new ECB(19, 25)), new ECBlocks(30, new ECB(11, 15), new ECB(46, 16))), 
+	new Version(34, new Array(6, 34, 62, 90, 118, 146), new ECBlocks(30, new ECB(13, 115), new ECB(6, 116)), new ECBlocks(28, new ECB(14, 46), new ECB(23, 47)), new ECBlocks(30, new ECB(44, 24), new ECB(7, 25)), new ECBlocks(30, new ECB(59, 16), new ECB(1, 17))), 
+	new Version(35, new Array(6, 30, 54, 78, 102, 126, 150), new ECBlocks(30, new ECB(12, 121), new ECB(7, 122)), new ECBlocks(28, new ECB(12, 47), new ECB(26, 48)), new ECBlocks(30, new ECB(39, 24), new ECB(14, 25)),new ECBlocks(30, new ECB(22, 15), new ECB(41, 16))), 
+	new Version(36, new Array(6, 24, 50, 76, 102, 128, 154), new ECBlocks(30, new ECB(6, 121), new ECB(14, 122)), new ECBlocks(28, new ECB(6, 47), new ECB(34, 48)), new ECBlocks(30, new ECB(46, 24), new ECB(10, 25)), new ECBlocks(30, new ECB(2, 15), new ECB(64, 16))), 
+	new Version(37, new Array(6, 28, 54, 80, 106, 132, 158), new ECBlocks(30, new ECB(17, 122), new ECB(4, 123)), new ECBlocks(28, new ECB(29, 46), new ECB(14, 47)), new ECBlocks(30, new ECB(49, 24), new ECB(10, 25)), new ECBlocks(30, new ECB(24, 15), new ECB(46, 16))), 
+	new Version(38, new Array(6, 32, 58, 84, 110, 136, 162), new ECBlocks(30, new ECB(4, 122), new ECB(18, 123)), new ECBlocks(28, new ECB(13, 46), new ECB(32, 47)), new ECBlocks(30, new ECB(48, 24), new ECB(14, 25)), new ECBlocks(30, new ECB(42, 15), new ECB(32, 16))), 
+	new Version(39, new Array(6, 26, 54, 82, 110, 138, 166), new ECBlocks(30, new ECB(20, 117), new ECB(4, 118)), new ECBlocks(28, new ECB(40, 47), new ECB(7, 48)), new ECBlocks(30, new ECB(43, 24), new ECB(22, 25)), new ECBlocks(30, new ECB(10, 15), new ECB(67, 16))), 
 	new Version(40, new Array(6, 30, 58, 86, 114, 142, 170), new ECBlocks(30, new ECB(19, 118), new ECB(6, 119)), new ECBlocks(28, new ECB(18, 47), new ECB(31, 48)), new ECBlocks(30, new ECB(34, 24), new ECB(34, 25)), new ECBlocks(30, new ECB(20, 15), new ECB(61, 16))));
 }
 
@@ -6201,7 +6201,7 @@ function PerspectiveTransform( a11,  a21,  a31,  a12,  a22,  a32,  a13,  a23,  a
 
 PerspectiveTransform.quadrilateralToQuadrilateral=function( x0,  y0,  x1,  y1,  x2,  y2,  x3,  y3,  x0p,  y0p,  x1p,  y1p,  x2p,  y2p,  x3p,  y3p)
 {
-
+	
 	var qToS = this.quadrilateralToSquare(x0, y0, x1, y1, x2, y2, x3, y3);
 	var sToQ = this.squareToQuadrilateral(x0p, y0p, x1p, y1p, x2p, y2p, x3p, y3p);
 	return sToQ.times(qToS);
@@ -6245,7 +6245,7 @@ function Detector(image)
 {
 	this.image=image;
 	this.resultPointCallback = null;
-
+	
 	this.sizeOfBlackWhiteBlackRun=function( fromX,  fromY,  toX,  toY)
 		{
 			// Mild variant of Bresenham's algorithm;
@@ -6260,7 +6260,7 @@ function Detector(image)
 				toX = toY;
 				toY = temp;
 			}
-
+			
 			var dx = Math.abs(toX - fromX);
 			var dy = Math.abs(toY - fromY);
 			var error = - dx >> 1;
@@ -6269,7 +6269,7 @@ function Detector(image)
 			var state = 0; // In black pixels, looking for white, first or second time
 			for (var x = fromX, y = fromY; x != toX; x += xstep)
 			{
-
+				
 				var realX = steep?y:x;
 				var realY = steep?x:y;
 				if (state == 1)
@@ -6287,7 +6287,7 @@ function Detector(image)
 						state++;
 					}
 				}
-
+				
 				if (state == 3)
 				{
 					// Found black, white, black, and stumbled back onto white; done
@@ -6311,12 +6311,12 @@ function Detector(image)
 			return  Math.sqrt( (diffX2 * diffX2 + diffY2 * diffY2));
 		}
 
-
+	
 	this.sizeOfBlackWhiteBlackRunBothWays=function( fromX,  fromY,  toX,  toY)
 		{
-
+			
 			var result = this.sizeOfBlackWhiteBlackRun(fromX, fromY, toX, toY);
-
+			
 			// Now count other way -- don't run off image though of course
 			var scale = 1.0;
 			var otherToX = fromX - (toX - fromX);
@@ -6331,7 +6331,7 @@ function Detector(image)
 				otherToX = qrcode.width - 1;
 			}
 			var otherToY = Math.floor (fromY - (toY - fromY) * scale);
-
+			
 			scale = 1.0;
 			if (otherToY < 0)
 			{
@@ -6344,13 +6344,13 @@ function Detector(image)
 				otherToY = qrcode.height - 1;
 			}
 			otherToX = Math.floor (fromX + (otherToX - fromX) * scale);
-
+			
 			result += this.sizeOfBlackWhiteBlackRun(fromX, fromY, otherToX, otherToY);
 			return result - 1.0; // -1 because we counted the middle pixel twice
 		}
+		
 
-
-
+	
 	this.calculateModuleSizeOneWay=function( pattern,  otherPattern)
 		{
 			var moduleSizeEst1 = this.sizeOfBlackWhiteBlackRunBothWays(Math.floor( pattern.X), Math.floor( pattern.Y), Math.floor( otherPattern.X), Math.floor(otherPattern.Y));
@@ -6368,7 +6368,7 @@ function Detector(image)
 			return (moduleSizeEst1 + moduleSizeEst2) / 14.0;
 		}
 
-
+	
 	this.calculateModuleSize=function( topLeft,  topRight,  bottomLeft)
 		{
 			// Take the average
@@ -6383,24 +6383,24 @@ function Detector(image)
 	}
 	this.computeDimension=function( topLeft,  topRight,  bottomLeft,  moduleSize)
 		{
-
+			
 			var tltrCentersDimension = Math.round(this.distance(topLeft, topRight) / moduleSize);
 			var tlblCentersDimension = Math.round(this.distance(topLeft, bottomLeft) / moduleSize);
 			var dimension = ((tltrCentersDimension + tlblCentersDimension) >> 1) + 7;
 			switch (dimension & 0x03)
 			{
-
+				
 				// mod 4
-				case 0:
+				case 0: 
 					dimension++;
 					break;
 					// 1? do nothing
-
-				case 2:
+				
+				case 2: 
 					dimension--;
 					break;
-
-				case 3:
+				
+				case 3: 
 					throw "Error";
 				}
 			return dimension;
@@ -6417,14 +6417,14 @@ function Detector(image)
 			{
 				throw "Error";
 			}
-
+			
 			var alignmentAreaTopY = Math.max(0, estAlignmentY - allowance);
 			var alignmentAreaBottomY = Math.min(qrcode.height - 1, estAlignmentY + allowance);
-
+			
 			var alignmentFinder = new AlignmentPatternFinder(this.image, alignmentAreaLeftX, alignmentAreaTopY, alignmentAreaRightX - alignmentAreaLeftX, alignmentAreaBottomY - alignmentAreaTopY, overallEstModuleSize, this.resultPointCallback);
 			return alignmentFinder.find();
 		}
-
+		
 	this.createTransform=function( topLeft,  topRight,  bottomLeft, alignmentPattern, dimension)
 		{
 			var dimMinusThree =  dimension - 3.5;
@@ -6445,26 +6445,26 @@ function Detector(image)
 				bottomRightY = (topRight.Y - topLeft.Y) + bottomLeft.Y;
 				sourceBottomRightX = sourceBottomRightY = dimMinusThree;
 			}
-
+			
 			var transform = PerspectiveTransform.quadrilateralToQuadrilateral(3.5, 3.5, dimMinusThree, 3.5, sourceBottomRightX, sourceBottomRightY, 3.5, dimMinusThree, topLeft.X, topLeft.Y, topRight.X, topRight.Y, bottomRightX, bottomRightY, bottomLeft.X, bottomLeft.Y);
-
+			
 			return transform;
-		}
-
+		}		
+	
 	this.sampleGrid=function( image,  transform,  dimension)
 		{
-
+			
 			var sampler = GridSampler;
 			return sampler.sampleGrid3(image, dimension, transform);
 		}
-
+	
 	this.processFinderPatternInfo = function( info)
 		{
-
+			
 			var topLeft = info.TopLeft;
 			var topRight = info.TopRight;
 			var bottomLeft = info.BottomLeft;
-
+			
 			var moduleSize = this.calculateModuleSize(topLeft, topRight, bottomLeft);
 			if (moduleSize < 1.0)
 			{
@@ -6473,22 +6473,22 @@ function Detector(image)
 			var dimension = this.computeDimension(topLeft, topRight, bottomLeft, moduleSize);
 			var provisionalVersion = Version.getProvisionalVersionForDimension(dimension);
 			var modulesBetweenFPCenters = provisionalVersion.DimensionForVersion - 7;
-
+			
 			var alignmentPattern = null;
 			// Anything above version 1 has an alignment pattern
 			if (provisionalVersion.AlignmentPatternCenters.length > 0)
 			{
-
+				
 				// Guess where a "bottom right" finder pattern would have been
 				var bottomRightX = topRight.X - topLeft.X + bottomLeft.X;
 				var bottomRightY = topRight.Y - topLeft.Y + bottomLeft.Y;
-
+				
 				// Estimate that alignment pattern is closer by 3 modules
 				// from "bottom right" to known top left location
 				var correctionToTopLeft = 1.0 - 3.0 /  modulesBetweenFPCenters;
 				var estAlignmentX = Math.floor (topLeft.X + correctionToTopLeft * (bottomRightX - topLeft.X));
 				var estAlignmentY = Math.floor (topLeft.Y + correctionToTopLeft * (bottomRightY - topLeft.Y));
-
+				
 				// Kind of arbitrary -- expand search radius before giving up
 				for (var i = 4; i <= 16; i <<= 1)
 				{
@@ -6504,11 +6504,11 @@ function Detector(image)
 				}
 				// If we didn't find alignment pattern... well try anyway without it
 			}
-
+			
 			var transform = this.createTransform(topLeft, topRight, bottomLeft, alignmentPattern, dimension);
-
+			
 			var bits = this.sampleGrid(this.image, transform, dimension);
-
+			
 			var points;
 			if (alignmentPattern == null)
 			{
@@ -6520,14 +6520,14 @@ function Detector(image)
 			}
 			return new DetectorResult(bits, points);
 		}
+		
 
-
-
+	
 	this.detect=function()
 	{
 		var info =  new FinderPatternFinder().findFinderPattern(this.image);
-
-		return this.processFinderPatternInfo(info);
+			
+		return this.processFinderPatternInfo(info); 
 	}
 }
 
@@ -6662,7 +6662,7 @@ function BitMatrix( width,  height)
 	this.bits = new Array(rowSize * height);
 	for(var i=0;i<this.bits.length;i++)
 		this.bits[i]=0;
-
+	
 	this.__defineGetter__("Width", function()
 	{
 		return this.width;
@@ -6679,7 +6679,7 @@ function BitMatrix( width,  height)
 		}
 		return this.width;
 	});
-
+	
 	this.get_Renamed=function( x,  y)
 		{
 			var offset = y * this.rowSize + (x >> 5);
@@ -6734,7 +6734,7 @@ function DataBlock(numDataCodewords,  codewords)
 {
 	this.numDataCodewords = numDataCodewords;
 	this.codewords = codewords;
-
+	
 	this.__defineGetter__("NumDataCodewords", function()
 	{
 		return this.numDataCodewords;
@@ -6743,20 +6743,20 @@ function DataBlock(numDataCodewords,  codewords)
 	{
 		return this.codewords;
 	});
-}
-
+}	
+	
 DataBlock.getDataBlocks=function(rawCodewords,  version,  ecLevel)
 {
-
+	
 	if (rawCodewords.length != version.TotalCodewords)
 	{
 		throw "ArgumentException";
 	}
-
+	
 	// Figure out the number and size of data blocks used by this version and
 	// error correction level
 	var ecBlocks = version.getECBlocksForLevel(ecLevel);
-
+	
 	// First count the total number of data blocks
 	var totalBlocks = 0;
 	var ecBlockArray = ecBlocks.getECBlocks();
@@ -6764,7 +6764,7 @@ DataBlock.getDataBlocks=function(rawCodewords,  version,  ecLevel)
 	{
 		totalBlocks += ecBlockArray[i].Count;
 	}
-
+	
 	// Now establish DataBlocks of the appropriate size and number of data codewords
 	var result = new Array(totalBlocks);
 	var numResultBlocks = 0;
@@ -6778,7 +6778,7 @@ DataBlock.getDataBlocks=function(rawCodewords,  version,  ecLevel)
 			result[numResultBlocks++] = new DataBlock(numDataCodewords, new Array(numBlockCodewords));
 		}
 	}
-
+	
 	// All blocks have the same amount of data, except that the last n
 	// (where n may be 0) have 1 more byte. Figure out where these start.
 	var shorterBlocksTotalCodewords = result[0].codewords.length;
@@ -6793,7 +6793,7 @@ DataBlock.getDataBlocks=function(rawCodewords,  version,  ecLevel)
 		longerBlocksStartAt--;
 	}
 	longerBlocksStartAt++;
-
+	
 	var shorterBlocksNumDataCodewords = shorterBlocksTotalCodewords - ecBlocks.ECCodewordsPerBlock;
 	// The last elements of result may be 1 element longer;
 	// first fill out as many elements as all of them have
@@ -6833,19 +6833,19 @@ function BitMatrixParser(bitMatrix)
 	this.bitMatrix = bitMatrix;
 	this.parsedVersion = null;
 	this.parsedFormatInfo = null;
-
+	
 	this.copyBit=function( i,  j,  versionBits)
 	{
 		return this.bitMatrix.get_Renamed(i, j)?(versionBits << 1) | 0x1:versionBits << 1;
 	}
-
+	
 	this.readFormatInformation=function()
 	{
 			if (this.parsedFormatInfo != null)
 			{
 				return this.parsedFormatInfo;
 			}
-
+			
 			// Read top-left format info bits
 			var formatInfoBits = 0;
 			for (var i = 0; i < 6; i++)
@@ -6861,13 +6861,13 @@ function BitMatrixParser(bitMatrix)
 			{
 				formatInfoBits = this.copyBit(8, j, formatInfoBits);
 			}
-
+			
 			this.parsedFormatInfo = FormatInformation.decodeFormatInformation(formatInfoBits);
 			if (this.parsedFormatInfo != null)
 			{
 				return this.parsedFormatInfo;
 			}
-
+			
 			// Hmm, failed. Try the top-right/bottom-left pattern
 			var dimension = this.bitMatrix.Dimension;
 			formatInfoBits = 0;
@@ -6880,30 +6880,30 @@ function BitMatrixParser(bitMatrix)
 			{
 				formatInfoBits = this.copyBit(8, j, formatInfoBits);
 			}
-
+			
 			this.parsedFormatInfo = FormatInformation.decodeFormatInformation(formatInfoBits);
 			if (this.parsedFormatInfo != null)
 			{
 				return this.parsedFormatInfo;
 			}
-			throw "Error readFormatInformation";
+			throw "Error readFormatInformation";	
 	}
 	this.readVersion=function()
 		{
-
+			
 			if (this.parsedVersion != null)
 			{
 				return this.parsedVersion;
 			}
-
+			
 			var dimension = this.bitMatrix.Dimension;
-
+			
 			var provisionalVersion = (dimension - 17) >> 2;
 			if (provisionalVersion <= 6)
 			{
 				return Version.getVersionForNumber(provisionalVersion);
 			}
-
+			
 			// Read top-right version info: 3 wide by 6 tall
 			var versionBits = 0;
 			var ijMin = dimension - 11;
@@ -6914,13 +6914,13 @@ function BitMatrixParser(bitMatrix)
 					versionBits = this.copyBit(i, j, versionBits);
 				}
 			}
-
+			
 			this.parsedVersion = Version.decodeVersionInformation(versionBits);
 			if (this.parsedVersion != null && this.parsedVersion.DimensionForVersion == dimension)
 			{
 				return this.parsedVersion;
 			}
-
+			
 			// Hmm, failed. Try bottom left: 6 wide by 3 tall
 			versionBits = 0;
 			for (var i = 5; i >= 0; i--)
@@ -6930,7 +6930,7 @@ function BitMatrixParser(bitMatrix)
 					versionBits = this.copyBit(i, j, versionBits);
 				}
 			}
-
+			
 			this.parsedVersion = Version.decodeVersionInformation(versionBits);
 			if (this.parsedVersion != null && this.parsedVersion.DimensionForVersion == dimension)
 			{
@@ -6940,18 +6940,18 @@ function BitMatrixParser(bitMatrix)
 		}
 	this.readCodewords=function()
 		{
-
+			
 			var formatInfo = this.readFormatInformation();
 			var version = this.readVersion();
-
+			
 			// Get the data mask for the format used in this QR Code. This will exclude
 			// some bits from reading as we wind through the bit matrix.
 			var dataMask = DataMask.forReference( formatInfo.DataMask);
 			var dimension = this.bitMatrix.Dimension;
 			dataMask.unmaskBitMatrix(this.bitMatrix, dimension);
-
+			
 			var functionPattern = version.buildFunctionPattern();
-
+			
 			var readingUp = true;
 			var result = new Array(version.TotalCodewords);
 			var resultOffset = 0;
@@ -7224,7 +7224,7 @@ function ReedSolomonDecoder(field)
 				received[position] = GF256.addOrSubtract(received[position], errorMagnitudes[i]);
 			}
 	}
-
+	
 	this.runEuclideanAlgorithm=function( a,  b,  R)
 		{
 			// Assume a's degree is >= b's
@@ -7234,14 +7234,14 @@ function ReedSolomonDecoder(field)
 				a = b;
 				b = temp;
 			}
-
+			
 			var rLast = a;
 			var r = b;
 			var sLast = this.field.One;
 			var s = this.field.Zero;
 			var tLast = this.field.Zero;
 			var t = this.field.One;
-
+			
 			// Run Euclidean algorithm until r's degree is less than R/2
 			while (r.Degree >= Math.floor(R / 2))
 			{
@@ -7251,7 +7251,7 @@ function ReedSolomonDecoder(field)
 				rLast = r;
 				sLast = s;
 				tLast = t;
-
+				
 				// Divide rLastLast by rLast, with quotient in q and remainder in r
 				if (rLast.Zero)
 				{
@@ -7270,17 +7270,17 @@ function ReedSolomonDecoder(field)
 					r = r.addOrSubtract(rLast.multiplyByMonomial(degreeDiff, scale));
 					//r.EXE();
 				}
-
+				
 				s = q.multiply1(sLast).addOrSubtract(sLastLast);
 				t = q.multiply1(tLast).addOrSubtract(tLastLast);
 			}
-
+			
 			var sigmaTildeAtZero = t.getCoefficient(0);
 			if (sigmaTildeAtZero == 0)
 			{
 				throw "ReedSolomonException sigmaTilde(0) was zero";
 			}
-
+			
 			var inverse = this.field.inverse(sigmaTildeAtZero);
 			var sigma = t.multiply2(inverse);
 			var omega = r.multiply2(inverse);
@@ -7370,7 +7370,7 @@ function GF256Poly(field,  coefficients)
 	{
 		this.coefficients = coefficients;
 	}
-
+	
 	this.__defineGetter__("Zero", function()
 	{
 		return this.coefficients[0] == 0;
@@ -7383,12 +7383,12 @@ function GF256Poly(field,  coefficients)
 	{
 		return this.coefficients;
 	});
-
+	
 	this.getCoefficient=function( degree)
 	{
 		return this.coefficients[this.coefficients.length - 1 - degree];
 	}
-
+	
 	this.evaluateAt=function( a)
 	{
 		if (a == 0)
@@ -7414,7 +7414,7 @@ function GF256Poly(field,  coefficients)
 		}
 		return result2;
 	}
-
+	
 	this.addOrSubtract=function( other)
 		{
 			if (this.field != other.field)
@@ -7429,7 +7429,7 @@ function GF256Poly(field,  coefficients)
 			{
 				return this;
 			}
-
+			
 			var smallerCoefficients = this.coefficients;
 			var largerCoefficients = other.coefficients;
 			if (smallerCoefficients.length > largerCoefficients.length)
@@ -7443,12 +7443,12 @@ function GF256Poly(field,  coefficients)
 			// Copy high-order terms only found in higher-degree polynomial's coefficients
 			//Array.Copy(largerCoefficients, 0, sumDiff, 0, lengthDiff);
 			for(var ci=0;ci<lengthDiff;ci++)sumDiff[ci]=largerCoefficients[ci];
-
+			
 			for (var i = lengthDiff; i < largerCoefficients.length; i++)
 			{
 				sumDiff[i] = GF256.addOrSubtract(smallerCoefficients[i - lengthDiff], largerCoefficients[i]);
 			}
-
+			
 			return new GF256Poly(field, sumDiff);
 	}
 	this.multiply1=function( other)
@@ -7523,13 +7523,13 @@ function GF256Poly(field,  coefficients)
 			{
 				throw "Divide by 0";
 			}
-
+			
 			var quotient = this.field.Zero;
 			var remainder = this;
-
+			
 			var denominatorLeadingTerm = other.getCoefficient(other.Degree);
 			var inverseDenominatorLeadingTerm = this.field.inverse(denominatorLeadingTerm);
-
+			
 			while (remainder.Degree >= other.Degree && !remainder.Zero)
 			{
 				var degreeDifference = remainder.Degree - other.Degree;
@@ -7539,7 +7539,7 @@ function GF256Poly(field,  coefficients)
 				quotient = quotient.addOrSubtract(iterationQuotient);
 				remainder = remainder.addOrSubtract(term);
 			}
-
+			
 			return new Array(quotient, remainder);
 		}
 }
@@ -7567,7 +7567,7 @@ function GF256( primitive)
 	this.zero = new GF256Poly(this, new Array(at0));
 	var at1=new Array(1);at1[0]=1;
 	this.one = new GF256Poly(this, new Array(at1));
-
+	
 	this.__defineGetter__("Zero", function()
 	{
 		return this.zero;
@@ -7626,7 +7626,7 @@ function GF256( primitive)
 				return a;
 			}
 			return this.expTable[(this.logTable[a] + this.logTable[b]) % 255];
-		}
+		}		
 }
 
 GF256.QR_CODE_FIELD = new GF256(0x011D);
@@ -7673,13 +7673,13 @@ Decoder.decode=function(bits)
 	var parser = new BitMatrixParser(bits);
 	var version = parser.readVersion();
 	var ecLevel = parser.readFormatInformation().ErrorCorrectionLevel;
-
+	
 	// Read codewords
 	var codewords = parser.readCodewords();
 
 	// Separate into data blocks
 	var dataBlocks = DataBlock.getDataBlocks(codewords, version, ecLevel);
-
+	
 	// Count total number of data bytes
 	var totalBytes = 0;
 	for (var i = 0; i < dataBlocks.length; i++)
@@ -7688,7 +7688,7 @@ Decoder.decode=function(bits)
 	}
 	var resultBytes = new Array(totalBytes);
 	var resultOffset = 0;
-
+	
 	// Error-correct and copy data blocks together into a stream of bytes
 	for (var j = 0; j < dataBlocks.length; j++)
 	{
@@ -7701,7 +7701,7 @@ Decoder.decode=function(bits)
 			resultBytes[resultOffset++] = codewordBytes[i];
 		}
 	}
-
+	
 	// Decode the contents of that stream of bytes
 	var reader = new QRCodeDataBlockReader(resultBytes, version.VersionNumber, ecLevel.Bits);
 	return reader;
@@ -7721,7 +7721,7 @@ qrcode.sizeOfDataLengthInfo =  [  [ 10, 9, 8, 8 ],  [ 12, 11, 16, 10 ],  [ 14, 1
 qrcode.callback = null;
 
 qrcode.decode = function(src){
-
+    
     if(arguments.length==0)
     {
         var canvas_qr = document.getElementById("qr-canvas");
@@ -7752,7 +7752,7 @@ qrcode.decode = function(src){
 
             canvas_qr.width = nwidth;
             canvas_qr.height = nheight;
-
+            
             context.drawImage(image, 0, 0, canvas_qr.width, canvas_qr.height );
             qrcode.width = canvas_qr.width;
             qrcode.height = canvas_qr.height;
@@ -7764,7 +7764,7 @@ qrcode.decode = function(src){
                     qrcode.callback(qrcode.result);
                 return;
             }
-
+            
             try
             {
                 qrcode.result = qrcode.process(context);
@@ -7819,12 +7819,12 @@ qrcode.decode_utf8 = function ( s )
 }
 
 qrcode.process = function(ctx){
-
+    
     var start = new Date().getTime();
 
     var image = qrcode.grayScaleToBitmap(qrcode.grayscale());
     //var image = qrcode.binarize(128);
-
+    
     if(qrcode.debug)
     {
         for (var y = 0; y < qrcode.height; y++)
@@ -7839,13 +7839,13 @@ qrcode.process = function(ctx){
         }
         ctx.putImageData(qrcode.imagedata, 0, 0);
     }
-
+    
     //var finderPatternInfo = new FinderPatternFinder().findFinderPattern(image);
-
+    
     var detector = new Detector(image);
 
     var qRCodeMatrix = detector.detect();
-
+    
     /*for (var y = 0; y < qRCodeMatrix.bits.Height; y++)
     {
         for (var x = 0; x < qRCodeMatrix.bits.Width; x++)
@@ -7858,7 +7858,7 @@ qrcode.process = function(ctx){
     }*/
     if(qrcode.debug)
         ctx.putImageData(qrcode.imagedata, 0, 0);
-
+    
     var reader = Decoder.decode(qRCodeMatrix.bits);
     var data = reader.DataByte;
     var str="";
@@ -7867,11 +7867,11 @@ qrcode.process = function(ctx){
         for(var j=0;j<data[i].length;j++)
             str+=String.fromCharCode(data[i][j]);
     }
-
+    
     var end = new Date().getTime();
     var time = end - start;
     console.log(time);
-
+    
     return qrcode.decode_utf8(str);
     //alert("Time:" + time + " Code: "+str);
 }
@@ -7895,7 +7895,7 @@ qrcode.binarize = function(th){
         for (var x = 0; x < qrcode.width; x++)
         {
             var gray = qrcode.getPixel(x, y);
-
+            
             ret[x+y*qrcode.width] = gray<=th?true:false;
         }
     }
@@ -7951,7 +7951,7 @@ qrcode.getMiddleBrightnessPerArea=function(image)
         //Console.out.println("");
     }
     //Console.out.println("");
-
+    
     return middle;
 }
 
@@ -7962,7 +7962,7 @@ qrcode.grayScaleToBitmap=function(grayScale)
     var areaWidth = Math.floor(qrcode.width / sqrtNumArea);
     var areaHeight = Math.floor(qrcode.height / sqrtNumArea);
     var bitmap = new Array(qrcode.height*qrcode.width);
-
+    
     for (var ay = 0; ay < sqrtNumArea; ay++)
     {
         for (var ax = 0; ax < sqrtNumArea; ax++)
@@ -7986,7 +7986,7 @@ qrcode.grayscale = function(){
         for (var x = 0; x < qrcode.width; x++)
         {
             var gray = qrcode.getPixel(x, y);
-
+            
             ret[x+y*qrcode.width] = gray;
         }
     }
@@ -8018,14 +8018,14 @@ var CENTER_QUORUM = 2;
 
 qrcode.orderBestPatterns=function(patterns)
 		{
-
+			
 			function distance( pattern1,  pattern2)
 			{
 				xDiff = pattern1.X - pattern2.X;
 				yDiff = pattern1.Y - pattern2.Y;
 				return  Math.sqrt( (xDiff * xDiff + yDiff * yDiff));
 			}
-
+			
 			/// <summary> Returns the z component of the cross product between vectors BC and BA.</summary>
 			function crossProductZ( pointA,  pointB,  pointC)
 			{
@@ -8034,12 +8034,12 @@ qrcode.orderBestPatterns=function(patterns)
 				return ((pointC.x - bX) * (pointA.y - bY)) - ((pointC.y - bY) * (pointA.x - bX));
 			}
 
-
+			
 			// Find distances between pattern centers
 			var zeroOneDistance = distance(patterns[0], patterns[1]);
 			var oneTwoDistance = distance(patterns[1], patterns[2]);
 			var zeroTwoDistance = distance(patterns[0], patterns[2]);
-
+			
 			var pointA, pointB, pointC;
 			// Assume one closest to other two is B; A and C will just be guesses at first
 			if (oneTwoDistance >= zeroOneDistance && oneTwoDistance >= zeroTwoDistance)
@@ -8060,7 +8060,7 @@ qrcode.orderBestPatterns=function(patterns)
 				pointA = patterns[0];
 				pointC = patterns[1];
 			}
-
+			
 			// Use cross product to figure out whether A and C are correct or flipped.
 			// This asks whether BC x BA has a positive z component, which is the arrangement
 			// we want for A, B, C. If it's negative, then we've got it flipped around and
@@ -8071,7 +8071,7 @@ qrcode.orderBestPatterns=function(patterns)
 				pointA = pointC;
 				pointC = temp;
 			}
-
+			
 			patterns[0] = pointA;
 			patterns[1] = pointB;
 			patterns[2] = pointC;
@@ -8084,11 +8084,11 @@ function FinderPattern(posX, posY,  estimatedModuleSize)
 	this.y=posY;
 	this.count = 1;
 	this.estimatedModuleSize = estimatedModuleSize;
-
+	
 	this.__defineGetter__("EstimatedModuleSize", function()
 	{
 		return this.estimatedModuleSize;
-	});
+	}); 
 	this.__defineGetter__("Count", function()
 	{
 		return this.count;
@@ -8114,7 +8114,7 @@ function FinderPattern(posX, posY,  estimatedModuleSize)
 			}
 			return false;
 		}
-
+	
 }
 
 function FinderPatternInfo(patternCenters)
@@ -8125,15 +8125,15 @@ function FinderPatternInfo(patternCenters)
 	this.__defineGetter__("BottomLeft", function()
 	{
 		return this.bottomLeft;
-	});
+	}); 
 	this.__defineGetter__("TopLeft", function()
 	{
 		return this.topLeft;
-	});
+	}); 
 	this.__defineGetter__("TopRight", function()
 	{
 		return this.topRight;
-	});
+	}); 
 }
 
 function FinderPatternFinder()
@@ -8143,7 +8143,7 @@ function FinderPatternFinder()
 	this.hasSkipped = false;
 	this.crossCheckStateCount = new Array(0,0,0,0,0);
 	this.resultPointCallback = null;
-
+	
 	this.__defineGetter__("CrossCheckStateCount", function()
 	{
 		this.crossCheckStateCount[0] = 0;
@@ -8152,8 +8152,8 @@ function FinderPatternFinder()
 		this.crossCheckStateCount[3] = 0;
 		this.crossCheckStateCount[4] = 0;
 		return this.crossCheckStateCount;
-	});
-
+	}); 
+	
 	this.foundPatternCross=function( stateCount)
 		{
 			var totalModuleSize = 0;
@@ -8182,10 +8182,10 @@ function FinderPatternFinder()
 	this.crossCheckVertical=function( startI,  centerJ,  maxCount,  originalStateCountTotal)
 		{
 			var image = this.image;
-
+			
 			var maxI = qrcode.height;
 			var stateCount = this.CrossCheckStateCount;
-
+			
 			// Start counting up from center
 			var i = startI;
 			while (i >= 0 && image[centerJ + i*qrcode.width])
@@ -8216,7 +8216,7 @@ function FinderPatternFinder()
 			{
 				return NaN;
 			}
-
+			
 			// Now also count down from center
 			i = startI + 1;
 			while (i < maxI && image[centerJ +i*qrcode.width])
@@ -8246,7 +8246,7 @@ function FinderPatternFinder()
 			{
 				return NaN;
 			}
-
+			
 			// If we found a finder-pattern-like section, but its size is more than 40% different than
 			// the original, assume it's a false positive
 			var stateCountTotal = stateCount[0] + stateCount[1] + stateCount[2] + stateCount[3] + stateCount[4];
@@ -8254,16 +8254,16 @@ function FinderPatternFinder()
 			{
 				return NaN;
 			}
-
+			
 			return this.foundPatternCross(stateCount)?this.centerFromEnd(stateCount, i):NaN;
 		}
 	this.crossCheckHorizontal=function( startJ,  centerI,  maxCount, originalStateCountTotal)
 		{
 			var image = this.image;
-
+			
 			var maxJ = qrcode.width;
 			var stateCount = this.CrossCheckStateCount;
-
+			
 			var j = startJ;
 			while (j >= 0 && image[j+ centerI*qrcode.width])
 			{
@@ -8292,7 +8292,7 @@ function FinderPatternFinder()
 			{
 				return NaN;
 			}
-
+			
 			j = startJ + 1;
 			while (j < maxJ && image[j+ centerI*qrcode.width])
 			{
@@ -8321,7 +8321,7 @@ function FinderPatternFinder()
 			{
 				return NaN;
 			}
-
+			
 			// If we found a finder-pattern-like section, but its size is significantly different than
 			// the original, assume it's a false positive
 			var stateCountTotal = stateCount[0] + stateCount[1] + stateCount[2] + stateCount[3] + stateCount[4];
@@ -8329,7 +8329,7 @@ function FinderPatternFinder()
 			{
 				return NaN;
 			}
-
+			
 			return this.foundPatternCross(stateCount)?this.centerFromEnd(stateCount, j):NaN;
 		}
 	this.handlePossibleCenter=function( stateCount,  i,  j)
@@ -8371,17 +8371,17 @@ function FinderPatternFinder()
 			}
 			return false;
 		}
-
+		
 	this.selectBestPatterns=function()
 		{
-
+			
 			var startSize = this.possibleCenters.length;
 			if (startSize < 3)
 			{
 				// Couldn't find enough finder patterns
 				throw "Couldn't find enough finder patterns";
 			}
-
+			
 			// Filter outlier possibilities whose module size is too different
 			if (startSize > 3)
 			{
@@ -8421,7 +8421,7 @@ function FinderPatternFinder()
 					}
 				}
 			}
-
+			
 			if (this.possibleCenters.length > 3)
 			{
 				// Throw away all but those first size candidate points we found.
@@ -8431,10 +8431,10 @@ function FinderPatternFinder()
 					return 0;
 				});
 			}
-
+			
 			return new Array( this.possibleCenters[0],  this.possibleCenters[1],  this.possibleCenters[2]);
 		}
-
+		
 	this.findRowSkip=function()
 		{
 			var max = this.possibleCenters.length;
@@ -8466,7 +8466,7 @@ function FinderPatternFinder()
 			}
 			return 0;
 		}
-
+	
 	this.haveMultiplyConfirmedCenters=function()
 		{
 			var confirmedCount = 0;
@@ -8498,7 +8498,7 @@ function FinderPatternFinder()
 			}
 			return totalDeviation <= 0.05 * totalModuleSize;
 		}
-
+		
 	this.findFinderPattern = function(image){
 		var tryHarder = false;
 		this.image=image;
@@ -8509,7 +8509,7 @@ function FinderPatternFinder()
 		{
 				iSkip = MIN_SKIP;
 		}
-
+		
 		var done = false;
 		var stateCount = new Array(5);
 		for (var i = iSkip - 1; i < maxI && !done; i += iSkip)
@@ -8564,7 +8564,7 @@ function FinderPatternFinder()
 											// and top of presumed third confirmed center
 											// but back up a bit to get a full chance of detecting
 											// it, entire width of center of finder pattern
-
+											
 											// Skip by rowSkip, but back off by stateCount[2] (size of last center
 											// of pattern we saw) to be conservative, and also back off by iSkip which
 											// is about to be re-added
@@ -8576,7 +8576,7 @@ function FinderPatternFinder()
 								else
 								{
 									// Advance to next black pixel
-									do
+									do 
 									{
 										j++;
 									}
@@ -8628,10 +8628,10 @@ function FinderPatternFinder()
 				}
 			}
 		}
-
+		
 		var patternInfo = this.selectBestPatterns();
 		qrcode.orderBestPatterns(patternInfo);
-
+		
 		return new FinderPatternInfo(patternInfo);
 	};
 }
@@ -8642,11 +8642,11 @@ function AlignmentPattern(posX, posY,  estimatedModuleSize)
 	this.y=posY;
 	this.count = 1;
 	this.estimatedModuleSize = estimatedModuleSize;
-
+	
 	this.__defineGetter__("EstimatedModuleSize", function()
 	{
 		return this.estimatedModuleSize;
-	});
+	}); 
 	this.__defineGetter__("Count", function()
 	{
 		return this.count;
@@ -8672,7 +8672,7 @@ function AlignmentPattern(posX, posY,  estimatedModuleSize)
 			}
 			return false;
 		}
-
+	
 }
 
 function AlignmentPatternFinder( image,  startX,  startY,  width,  height,  moduleSize,  resultPointCallback)
@@ -8686,7 +8686,7 @@ function AlignmentPatternFinder( image,  startX,  startY,  width,  height,  modu
 	this.moduleSize = moduleSize;
 	this.crossCheckStateCount = new Array(0,0,0);
 	this.resultPointCallback = resultPointCallback;
-
+	
 	this.centerFromEnd=function(stateCount,  end)
 		{
 			return  (end - stateCount[2]) - stateCount[1] / 2.0;
@@ -8708,13 +8708,13 @@ function AlignmentPatternFinder( image,  startX,  startY,  width,  height,  modu
 	this.crossCheckVertical=function( startI,  centerJ,  maxCount,  originalStateCountTotal)
 		{
 			var image = this.image;
-
+			
 			var maxI = qrcode.height;
 			var stateCount = this.crossCheckStateCount;
 			stateCount[0] = 0;
 			stateCount[1] = 0;
 			stateCount[2] = 0;
-
+			
 			// Start counting up from center
 			var i = startI;
 			while (i >= 0 && image[centerJ + i*qrcode.width] && stateCount[1] <= maxCount)
@@ -8736,7 +8736,7 @@ function AlignmentPatternFinder( image,  startX,  startY,  width,  height,  modu
 			{
 				return NaN;
 			}
-
+			
 			// Now also count down from center
 			i = startI + 1;
 			while (i < maxI && image[centerJ + i*qrcode.width] && stateCount[1] <= maxCount)
@@ -8757,16 +8757,16 @@ function AlignmentPatternFinder( image,  startX,  startY,  width,  height,  modu
 			{
 				return NaN;
 			}
-
+			
 			var stateCountTotal = stateCount[0] + stateCount[1] + stateCount[2];
 			if (5 * Math.abs(stateCountTotal - originalStateCountTotal) >= 2 * originalStateCountTotal)
 			{
 				return NaN;
 			}
-
+			
 			return this.foundPatternCross(stateCount)?this.centerFromEnd(stateCount, i):NaN;
 		}
-
+		
 	this.handlePossibleCenter=function( stateCount,  i,  j)
 		{
 			var stateCountTotal = stateCount[0] + stateCount[1] + stateCount[2];
@@ -8795,7 +8795,7 @@ function AlignmentPatternFinder( image,  startX,  startY,  width,  height,  modu
 			}
 			return null;
 		}
-
+		
 	this.find = function()
 	{
 			var startX = this.startX;
@@ -8878,17 +8878,17 @@ function AlignmentPatternFinder( image,  startX,  startY,  width,  height,  modu
 					}
 				}
 			}
-
+			
 			// Hmm, nothing we saw was observed and confirmed twice. If we had
 			// any guess at all, return it.
 			if (!(this.possibleCenters.length == 0))
 			{
 				return  this.possibleCenters[0];
 			}
-
+			
 			throw "Couldn't find enough alignment patterns";
 		}
-
+	
 }
 
 function QRCodeDataBlockReader(blocks,  version,  numErrorCorrectionCode)
@@ -8904,9 +8904,9 @@ function QRCodeDataBlockReader(blocks,  version,  numErrorCorrectionCode)
 		this.dataLengthMode = 1;
 	else if (version >= 27 && version <= 40)
 		this.dataLengthMode = 2;
-
+		
 	this.getNextBits = function( numBits)
-		{
+		{			
 			var bits = 0;
 			if (numBits < this.bitPointer + 1)
 			{
@@ -8917,7 +8917,7 @@ function QRCodeDataBlockReader(blocks,  version,  numErrorCorrectionCode)
 					mask += (1 << i);
 				}
 				mask <<= (this.bitPointer - numBits + 1);
-
+				
 				bits = (this.blocks[this.blockPointer] & mask) >> (this.bitPointer - numBits + 1);
 				this.bitPointer -= numBits;
 				return bits;
@@ -8933,7 +8933,7 @@ function QRCodeDataBlockReader(blocks,  version,  numErrorCorrectionCode)
 				bits = (this.blocks[this.blockPointer] & mask1) << (numBits - (this.bitPointer + 1));
                 this.blockPointer++;
 				bits += ((this.blocks[this.blockPointer]) >> (8 - (numBits - (this.bitPointer + 1))));
-
+				
 				this.bitPointer = this.bitPointer - numBits % 8;
 				if (this.bitPointer < 0)
 				{
@@ -8948,24 +8948,24 @@ function QRCodeDataBlockReader(blocks,  version,  numErrorCorrectionCode)
 				var mask3 = 0; // mask of 3rd block
 				//bitPointer + 1 : number of bits of the 1st block
 				//8 : number of the 2nd block (note that use already 8bits because next word uses 3 data blocks)
-				//numBits - (bitPointer + 1 + 8) : number of bits of the 3rd block
+				//numBits - (bitPointer + 1 + 8) : number of bits of the 3rd block 
 				for (var i = 0; i < this.bitPointer + 1; i++)
 				{
 					mask1 += (1 << i);
 				}
 				var bitsFirstBlock = (this.blocks[this.blockPointer] & mask1) << (numBits - (this.bitPointer + 1));
 				this.blockPointer++;
-
+				
 				var bitsSecondBlock = this.blocks[this.blockPointer] << (numBits - (this.bitPointer + 1 + 8));
 				this.blockPointer++;
-
+				
 				for (var i = 0; i < numBits - (this.bitPointer + 1 + 8); i++)
 				{
 					mask3 += (1 << i);
 				}
 				mask3 <<= 8 - (numBits - (this.bitPointer + 1 + 8));
 				var bitsThirdBlock = (this.blocks[this.blockPointer] & mask3) >> (8 - (numBits - (this.bitPointer + 1 + 8)));
-
+				
 				bits = bitsFirstBlock + bitsSecondBlock + bitsThirdBlock;
 				this.bitPointer = this.bitPointer - (numBits - 8) % 8;
 				if (this.bitPointer < 0)
@@ -8995,7 +8995,7 @@ function QRCodeDataBlockReader(blocks,  version,  numErrorCorrectionCode)
 					break;
 				index++;
 			}
-
+			
 			return this.getNextBits(qrcode.sizeOfDataLengthInfo[this.dataLengthMode][index]);
 		}
 	this.getRomanAndFigureString=function( dataLength)
@@ -9004,7 +9004,7 @@ function QRCodeDataBlockReader(blocks,  version,  numErrorCorrectionCode)
 			var intData = 0;
 			var strData = "";
 			var tableRomanAndFigure = new Array('0', '1', '2', '3', '4', '5', '6', '7', '8', '9', 'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J', 'K', 'L', 'M', 'N', 'O', 'P', 'Q', 'R', 'S', 'T', 'U', 'V', 'W', 'X', 'Y', 'Z', ' ', unescape('%24'), '%', '*', '+', '-', '.', '/', ':');
-			do
+			do 
 			{
 				if (length > 1)
 				{
@@ -9023,7 +9023,7 @@ function QRCodeDataBlockReader(blocks,  version,  numErrorCorrectionCode)
 				}
 			}
 			while (length > 0);
-
+			
 			return strData;
 		}
 	this.getFigureString=function( dataLength)
@@ -9031,7 +9031,7 @@ function QRCodeDataBlockReader(blocks,  version,  numErrorCorrectionCode)
 			var length = dataLength;
 			var intData = 0;
 			var strData = "";
-			do
+			do 
 			{
 				if (length >= 3)
 				{
@@ -9057,7 +9057,7 @@ function QRCodeDataBlockReader(blocks,  version,  numErrorCorrectionCode)
 				strData += intData;
 			}
 			while (length > 0);
-
+			
 			return strData;
 		}
 	this.get8bitByteArray=function( dataLength)
@@ -9065,8 +9065,8 @@ function QRCodeDataBlockReader(blocks,  version,  numErrorCorrectionCode)
 			var length = dataLength;
 			var intData = 0;
 			var output = new Array();
-
-			do
+			
+			do 
 			{
 				intData = this.getNextBits(8);
 				output.push( intData);
@@ -9080,12 +9080,12 @@ function QRCodeDataBlockReader(blocks,  version,  numErrorCorrectionCode)
 			var length = dataLength;
 			var intData = 0;
 			var unicodeString = "";
-			do
+			do 
 			{
 				intData = getNextBits(13);
 				var lowerByte = intData % 0xC0;
 				var higherByte = intData / 0xC0;
-
+				
 				var tempWord = (higherByte << 8) + lowerByte;
 				var shiftjisWord = 0;
 				if (tempWord + 0x8140 <= 0x9FFC)
@@ -9098,7 +9098,7 @@ function QRCodeDataBlockReader(blocks,  version,  numErrorCorrectionCode)
 					// between E040 - EBBF on Shift_JIS character set
 					shiftjisWord = tempWord + 0xC140;
 				}
-
+				
 				//var tempByte = new Array(0,0);
 				//tempByte[0] = (sbyte) (shiftjisWord >> 8);
 				//tempByte[1] = (sbyte) (shiftjisWord & 0xFF);
@@ -9107,8 +9107,8 @@ function QRCodeDataBlockReader(blocks,  version,  numErrorCorrectionCode)
 				length--;
 			}
 			while (length > 0);
-
-
+			
+			
 			return unicodeString;
 		}
 
@@ -9119,7 +9119,7 @@ function QRCodeDataBlockReader(blocks,  version,  numErrorCorrectionCode)
 	    var MODE_ROMAN_AND_NUMBER = 2;
 	    var MODE_8BIT_BYTE = 4;
 	    var MODE_KANJI = 8;
-		do
+		do 
 					{
 						var mode = this.NextMode();
 						//canvas.println("mode: " + mode);
@@ -9146,8 +9146,8 @@ function QRCodeDataBlockReader(blocks,  version,  numErrorCorrectionCode)
 						//canvas.println("length: " + dataLength);
 						switch (mode)
 						{
-
-							case MODE_NUMBER:
+							
+							case MODE_NUMBER: 
 								//canvas.println("Mode: Figure");
 								var temp_str = this.getFigureString(dataLength);
 								var ta = new Array(temp_str.length);
@@ -9155,8 +9155,8 @@ function QRCodeDataBlockReader(blocks,  version,  numErrorCorrectionCode)
 									ta[j]=temp_str.charCodeAt(j);
 								output.push(ta);
 								break;
-
-							case MODE_ROMAN_AND_NUMBER:
+							
+							case MODE_ROMAN_AND_NUMBER: 
 								//canvas.println("Mode: Roman&Figure");
 								var temp_str = this.getRomanAndFigureString(dataLength);
 								var ta = new Array(temp_str.length);
@@ -9165,16 +9165,16 @@ function QRCodeDataBlockReader(blocks,  version,  numErrorCorrectionCode)
 								output.push(ta );
 								//output.Write(SystemUtils.ToByteArray(temp_sbyteArray2), 0, temp_sbyteArray2.Length);
 								break;
-
-							case MODE_8BIT_BYTE:
+							
+							case MODE_8BIT_BYTE: 
 								//canvas.println("Mode: 8bit Byte");
 								//sbyte[] temp_sbyteArray3;
 								var temp_sbyteArray3 = this.get8bitByteArray(dataLength);
 								output.push(temp_sbyteArray3);
 								//output.Write(SystemUtils.ToByteArray(temp_sbyteArray3), 0, temp_sbyteArray3.Length);
 								break;
-
-							case MODE_KANJI:
+							
+							case MODE_KANJI: 
 								//canvas.println("Mode: Kanji");
 								//sbyte[] temp_sbyteArray4;
 								//temp_sbyteArray4 = SystemUtils.ToSByteArray(SystemUtils.ToByteArray(getKanjiString(dataLength)));
@@ -9183,7 +9183,7 @@ function QRCodeDataBlockReader(blocks,  version,  numErrorCorrectionCode)
 								output.push(temp_str);
 								break;
 							}
-						//
+						//			
 						//canvas.println("DataLength: " + dataLength);
 						//Console.out.println(dataString);
 					}
@@ -9244,7 +9244,7 @@ function QRCodeScanner(width, height, container, success, error) {
 			_video = document.getElementById(_id_video);
 
 			navigator.getUserMedia(
-				{video: true},
+				{video: true}, 
 				function(stream) {
 					_stream = stream;
 					_video.src = window.URL.createObjectURL(stream) || stream;
@@ -9253,7 +9253,7 @@ function QRCodeScanner(width, height, container, success, error) {
 						canvasInit();
 						_interval = setInterval(captureToCanvas, 500);
 					}, 250); // Needed to get videoWidth/videoHeight
-				},
+				}, 
 				function(error) {
 					_container.innerHTML = '';
 					_video = null;
@@ -10410,8 +10410,8 @@ janin.currencies = [
     janin.currency.createCurrency ("BBQcoin",    0x55, 0xd5, "6",    "T"    , "bTFFC3Gg2XzQygLxxakHkNM3ravBZby1y9"),
     janin.currency.createCurrency ("Bitcoin",    0x00, 0x80, "5",    "[LK]" , "15DHZzv7eBUwss77qczZiL3DUEZLjDYhbM"),
     janin.currency.createCurrency ("BitcoinDark",0x3c, 0xbc, "7",    "U"    , "RWtY5fg9ZQ9tYaPd7WJLgsdae1m1ZfrVRe"),
-    janin.currency.createCurrency ("BitSynq",    0x3f, 0xbf, "7",    "V"    , "SRtKRZxSjjwb9BXujkmvLfRHiutk7s7VXh"),
     janin.currency.createCurrency ("Birdcoin",   0x2f, 0xaf, "6",    "[ST]" , "L97vGT4wRnyyiugHpLXzZzjqueN8YWRdRJ"),
+    janin.currency.createCurrency ("BitSynq",    0x3f, 0xbf, "7",    "V"    , "SRtKRZxSjjwb9BXujkmvLfRHiutk7s7VXh"),
     janin.currency.createCurrency ("Blackcoin",  0x19, 0x99, "6",    "P"    , "BFeJrZGyJ6bntd7RLXoNGvdn1HB5AQeiz4"),
     janin.currency.createCurrency ("BlackJack", 0x15, 0x95, "[56]",  "P"    , "9pzHRZkJ4Df3EBiqXhDVgtB2A7FaAq6nnG"),
     janin.currency.createCurrency ("BunnyCoin",  0x1a, 0x9a, "6",    "P"    , "BosRXiiSB6WmiSbvzVAdUjpezCWhqpJGyW"),
@@ -10588,7 +10588,7 @@ ninja.privateKey = {
 			callback(new Error(ninja.translator.get("detailalertnotvalidprivatekey")));
 			return;
 		}
-		// first byte is always 0x01
+		// first byte is always 0x01 
 		else if (hex[0] != 0x01) {
 			callback(new Error(ninja.translator.get("detailalertnotvalidprivatekey")));
 			return;
@@ -10617,7 +10617,7 @@ ninja.privateKey = {
 				return;
 			}
 		}
-		// second byte for EC-multiplied key
+		// second byte for EC-multiplied key 
 		else if (hex[1] == 0x43) {
 			isECMult = true;
 			isCompPoint = (hex[2] & 0x20) != 0;
@@ -10903,7 +10903,7 @@ ninja.publicKey = {
 		isDone: function() {
 			return ninja.seeder.seedCount >= ninja.seeder.seedLimit;
 		},
-
+		
 		// seed function exists to wait for mouse movement to add more entropy before generating an address
 		seed: function (evt) {
 			if (!evt) var evt = window.event;
@@ -10963,7 +10963,7 @@ ninja.publicKey = {
 			div.setAttribute("class", "seedpoint");
 			div.style.top = y + "px";
 			div.style.left = x + "px";
-
+			
 			// let's make the entropy 'points' grow and change color!
 			percentageComplete = ninja.seeder.seedCount / ninja.seeder.seedLimit;
 			document.getElementById("progress-bar-percentage").style.width=Math.ceil(percentageComplete*100)+"%";
@@ -11032,7 +11032,7 @@ ninja.qrCode = {
 		return canvas;
 	},
 
-	// generate a QRCode and return it's representation as an Html table
+	// generate a QRCode and return it's representation as an Html table 
 	createTableHtml: function (text) {
 		var typeNumber = ninja.qrCode.getTypeNumber(text);
 		var qr = new QRCode(typeNumber, QRCode.ErrorCorrectLevel.H);
@@ -11055,7 +11055,7 @@ ninja.qrCode = {
 	},
 
 	// show QRCodes with canvas OR table (IE8)
-	// parameter: keyValuePair
+	// parameter: keyValuePair 
 	// example: { "id1": "string1", "id2": "string2"}
 	//		"id1" is the id of a div element where you want a QRCode inserted.
 	//		"string1" is the string you want encoded into the QRCode.
@@ -11099,7 +11099,7 @@ ninja.envSecurityCheck = function() {
 			innerHTML = '<span style="color: #009900;">' + ninja.translator.get("securitychecklistofflineOK") + '</span>';
 			break;
 		default:
-	}
+	} 
 	document.getElementById('envSecurityCheck').innerHTML = innerHTML;
 };
 
@@ -11109,7 +11109,7 @@ ninja.browserSecurityCheck = function() {
 		innerHTML = '<span style="color: #009900;">' + ninja.translator.get("securitychecklistrandomOK") + '</span>';
 	} else {
 		innerHTML = '<span style="color: #990000;">' + ninja.translator.get("securitychecklistrandomNOK") + '</span>';
-	}
+	} 
 	document.getElementById('browserSecurityCheck').innerHTML = innerHTML;
 }
 
@@ -11203,7 +11203,7 @@ ninja.translator = {
 		var translation = ninja.translator.translations[ninja.translator.currentCulture][id];
 		return translation;
 	},
-
+    
     staticID: [
         "defaultTitle",
         "title",
@@ -11633,10 +11633,10 @@ ninja.wallets.paperwallet = {
 			ninja.wallets.paperwallet.showArtisticWallet(idPostFix, bitcoinAddress, privateKeyWif);
 		}
 	},
-
+	
 	// Verify that a self-entered key is valid, and compute the corresponding
 	// public address, render the wallet.
-	testAndApplyVanityKey: function () {
+	testAndApplyVanityKey: function () { 
 		var suppliedKey = document.getElementById('suppliedPrivateKey').value;
 		suppliedKey = suppliedKey.trim(); // in case any spaces or whitespace got pasted in
 		document.getElementById('suppliedPrivateKey').value = suppliedKey;
@@ -11679,11 +11679,11 @@ ninja.wallets.paperwallet = {
 		var keyValuePair = {};
 		keyValuePair["qrcode_public" + idPostFix] = bitcoinAddress;
 		ninja.qrCode.showQrCode(keyValuePair, 3.5);
-
+		
         var keyValuePair = {};
         keyValuePair["qrcode_private" + idPostFix] = privateKey;
         ninja.qrCode.showQrCode(keyValuePair, 2.8);
-
+        
         document.getElementById("btcaddress" + idPostFix).innerHTML = bitcoinAddress;
 		document.getElementById("btcprivwif" + idPostFix).innerHTML = privateKey;
 	},
@@ -11752,8 +11752,8 @@ ninja.wallets.bulkwallet = {
 			bulkWallet.csv.push((bulkWallet.csvRowLimit - bulkWallet.csvRowsRemaining + bulkWallet.csvStartIndex)
 								+ ",\"" + key.getBitcoinAddress() + "\",\"" + key.toString("wif")
 			//+	"\",\"" + key.toString("wifcomp")    // uncomment these lines to add different private key formats to the CSV
-			//+ "\",\"" + key.getBitcoinHexFormat()
-			//+ "\",\"" + key.toString("base64")
+			//+ "\",\"" + key.getBitcoinHexFormat() 
+			//+ "\",\"" + key.toString("base64") 
 								+ "\"");
 
 			document.getElementById("bulktextarea").value = ninja.translator.get("bulkgeneratingaddresses") + bulkWallet.csvRowsRemaining;
@@ -11888,7 +11888,7 @@ ninja.wallets.detailwallet = {
 		document.getElementById("detailarea").style.display = "block";
 		document.getElementById("detailprivkey").focus();
 		if (!ninja.wallets.detailwallet.qrscanner.scanner) {
-			ninja.wallets.detailwallet.qrscanner.scanner = new QRCodeScanner(320, 240, 'paperqroutput',
+			ninja.wallets.detailwallet.qrscanner.scanner = new QRCodeScanner(320, 240, 'paperqroutput', 
 				function(data) {
 					document.getElementById('detailprivkey').value = data;
 					document.getElementById('paperqrscanner').className = '';
@@ -12044,12 +12044,12 @@ ninja.wallets.donate = {
     close: function () {
         document.getElementById("donatearea").style.display = "none";
     },
-
+    
     displayQrCode: function (currencyid, e) {
         var keyValuePair = {};
     	keyValuePair["donateqrcode"] = janin.currencies[currencyid].donate;
 		ninja.qrCode.showQrCode(keyValuePair, 4);
-
+        
         document.getElementById("donateqrcode").style.display = "block";
         document.getElementById("donateqrcode").style.top = (e.offsetTop+15) + 'px';
     }
@@ -12732,9 +12732,9 @@ if (ninja.getQueryString()["i18nextract"]) {
     elem.setAttribute("rows", "30");
     elem.setAttribute("style", "width: 99%");
     elem.setAttribute("wrap", "off");
-
-    a=document.getElementsByClassName("i18n");
-
+    
+    a=document.getElementsByClassName("i18n");    
+    
     var i18n = "\"" + culture + "\": {\n";
     for(x=0; x<a.length; x++) {
         i18n += "\t";
@@ -12754,9 +12754,9 @@ if (ninja.getQueryString()["i18nextract"]) {
             i18n += "(ENGLISH)" + cleani18n(ninja.translator.translations["en"][ninja.translator.staticID[x]]);
         i18n += "\",\n";
     }
-
+    
     i18n += "},"
-
+    
     elem.innerHTML = i18n;
     div.appendChild(elem);
     document.body.appendChild(div);
diff --git a/src/array.map.js b/src/array.map.js
index 936cd82..d1b362f 100644
--- a/src/array.map.js
+++ b/src/array.map.js
@@ -1,57 +1,57 @@
 // Array.prototype.map function is in the public domain.
-// Production steps of ECMA-262, Edition 5, 15.4.4.19
-// Reference: http://es5.github.com/#x15.4.4.19
+// Production steps of ECMA-262, Edition 5, 15.4.4.19  
+// Reference: http://es5.github.com/#x15.4.4.19  
 if (!Array.prototype.map) {
 	Array.prototype.map = function (callback, thisArg) {
 		var T, A, k;
 		if (this == null) {
 			throw new TypeError(" this is null or not defined");
 		}
-		// 1. Let O be the result of calling ToObject passing the |this| value as the argument.
+		// 1. Let O be the result of calling ToObject passing the |this| value as the argument.  
 		var O = Object(this);
-		// 2. Let lenValue be the result of calling the Get internal method of O with the argument "length".
-		// 3. Let len be ToUint32(lenValue).
+		// 2. Let lenValue be the result of calling the Get internal method of O with the argument "length".  
+		// 3. Let len be ToUint32(lenValue).  
 		var len = O.length >>> 0;
-		// 4. If IsCallable(callback) is false, throw a TypeError exception.
-		// See: http://es5.github.com/#x9.11
+		// 4. If IsCallable(callback) is false, throw a TypeError exception.  
+		// See: http://es5.github.com/#x9.11  
 		if ({}.toString.call(callback) != "[object Function]") {
 			throw new TypeError(callback + " is not a function");
 		}
-		// 5. If thisArg was supplied, let T be thisArg; else let T be undefined.
+		// 5. If thisArg was supplied, let T be thisArg; else let T be undefined.  
 		if (thisArg) {
 			T = thisArg;
 		}
-		// 6. Let A be a new array created as if by the expression new Array(len) where Array is
-		// the standard built-in constructor with that name and len is the value of len.
+		// 6. Let A be a new array created as if by the expression new Array(len) where Array is  
+		// the standard built-in constructor with that name and len is the value of len.  
 		A = new Array(len);
-		// 7. Let k be 0
+		// 7. Let k be 0  
 		k = 0;
-		// 8. Repeat, while k < len
+		// 8. Repeat, while k < len  
 		while (k < len) {
 			var kValue, mappedValue;
-			// a. Let Pk be ToString(k).
-			//   This is implicit for LHS operands of the in operator
-			// b. Let kPresent be the result of calling the HasProperty internal method of O with argument Pk.
-			//   This step can be combined with c
-			// c. If kPresent is true, then
+			// a. Let Pk be ToString(k).  
+			//   This is implicit for LHS operands of the in operator  
+			// b. Let kPresent be the result of calling the HasProperty internal method of O with argument Pk.  
+			//   This step can be combined with c  
+			// c. If kPresent is true, then  
 			if (k in O) {
-				// i. Let kValue be the result of calling the Get internal method of O with argument Pk.
+				// i. Let kValue be the result of calling the Get internal method of O with argument Pk.  
 				kValue = O[k];
-				// ii. Let mappedValue be the result of calling the Call internal method of callback
-				// with T as the this value and argument list containing kValue, k, and O.
+				// ii. Let mappedValue be the result of calling the Call internal method of callback  
+				// with T as the this value and argument list containing kValue, k, and O.  
 				mappedValue = callback.call(T, kValue, k, O);
-				// iii. Call the DefineOwnProperty internal method of A with arguments
-				// Pk, Property Descriptor {Value: mappedValue, Writable: true, Enumerable: true, Configurable: true},
-				// and false.
-				// In browsers that support Object.defineProperty, use the following:
-				// Object.defineProperty(A, Pk, { value: mappedValue, writable: true, enumerable: true, configurable: true });
-				// For best browser support, use the following:
+				// iii. Call the DefineOwnProperty internal method of A with arguments  
+				// Pk, Property Descriptor {Value: mappedValue, Writable: true, Enumerable: true, Configurable: true},  
+				// and false.  
+				// In browsers that support Object.defineProperty, use the following:  
+				// Object.defineProperty(A, Pk, { value: mappedValue, writable: true, enumerable: true, configurable: true });  
+				// For best browser support, use the following:  
 				A[k] = mappedValue;
 			}
-			// d. Increase k by 1.
+			// d. Increase k by 1.  
 			k++;
 		}
-		// 9. return A
+		// 9. return A  
 		return A;
 	};
-}
+}
\ No newline at end of file
diff --git a/src/biginteger.js b/src/biginteger.js
index 819dc68..4d9c4ef 100644
--- a/src/biginteger.js
+++ b/src/biginteger.js
@@ -1,6 +1,6 @@
 /*!
 * Basic JavaScript BN library - subset useful for RSA encryption. v1.3
-*
+* 
 * Copyright (c) 2005  Tom Wu
 * All Rights Reserved.
 * BSD License
@@ -1268,4 +1268,4 @@
 	// r = x^2 mod m; x != r
 	Barrett.prototype.sqrTo = function (x, r) { x.squareTo(r); this.reduce(r); };
 
-})();
+})();
\ No newline at end of file
diff --git a/src/bitcoinjs-lib.ecdsa.js b/src/bitcoinjs-lib.ecdsa.js
index a420f8e..72e45ac 100644
--- a/src/bitcoinjs-lib.ecdsa.js
+++ b/src/bitcoinjs-lib.ecdsa.js
@@ -136,7 +136,7 @@ Bitcoin.ECDSA = (function () {
 		* Parses a byte array containing a DER-encoded signature.
 		*
 		* This function will return an object of the form:
-		*
+		* 
 		* {
 		*   r: BigInteger,
 		*   s: BigInteger
@@ -280,4 +280,4 @@ Bitcoin.ECDSA = (function () {
 	};
 
 	return ECDSA;
-})();
+})();
\ No newline at end of file
diff --git a/src/bitcoinjs-lib.eckey.js b/src/bitcoinjs-lib.eckey.js
index 9395ed5..f73c5da 100644
--- a/src/bitcoinjs-lib.eckey.js
+++ b/src/bitcoinjs-lib.eckey.js
@@ -29,7 +29,7 @@ Bitcoin.ECKey = (function () {
 			} else if (ECKey.isBase64Format(input)) {
 				bytes = Crypto.util.base64ToBytes(input);
 			}
-
+			
 			if (ECKey.isBase6Format(input)) {
 				this.priv = new BigInteger(input, 6);
 			} else if (bytes == null || bytes.length != 32) {
@@ -127,7 +127,7 @@ Bitcoin.ECKey = (function () {
 		return this;
 	};
 
-	// Sipa Private Key Wallet Import Format
+	// Sipa Private Key Wallet Import Format 
 	ECKey.prototype.getBitcoinWalletImportFormat = function () {
 		var bytes = this.getBitcoinPrivateKeyByteArray();
 		bytes.unshift(janin.currency.privateKeyPrefix()); // prepend private key prefix
@@ -138,12 +138,12 @@ Bitcoin.ECKey = (function () {
 		return privWif;
 	};
 
-	// Private Key Hex Format
+	// Private Key Hex Format 
 	ECKey.prototype.getBitcoinHexFormat = function () {
 		return Crypto.util.bytesToHex(this.getBitcoinPrivateKeyByteArray()).toString().toUpperCase();
 	};
 
-	// Private Key Base64 Format
+	// Private Key Base64 Format 
 	ECKey.prototype.getBitcoinBase64Format = function () {
 		return Crypto.util.bytesToBase64(this.getBitcoinPrivateKeyByteArray());
 	};
@@ -151,7 +151,7 @@ Bitcoin.ECKey = (function () {
 	ECKey.prototype.getBitcoinPrivateKeyByteArray = function () {
 		// Get a copy of private key as a byte array
 		var bytes = this.priv.toByteArrayUnsigned();
-		// zero pad if private key is less than 32 bytes
+		// zero pad if private key is less than 32 bytes 
 		while (bytes.length < 32) bytes.unshift(0x00);
 		return bytes;
 	};
@@ -263,4 +263,4 @@ Bitcoin.ECKey = (function () {
 	};
 
 	return ECKey;
-})();
+})();
\ No newline at end of file
diff --git a/src/crypto-scrypt.js b/src/crypto-scrypt.js
index 476ff59..01600f4 100644
--- a/src/crypto-scrypt.js
+++ b/src/crypto-scrypt.js
@@ -1,16 +1,16 @@
 /*
 * Copyright (c) 2010-2011 Intalio Pte, All Rights Reserved
-*
+* 
 * Permission is hereby granted, free of charge, to any person obtaining a copy
 * of this software and associated documentation files (the "Software"), to deal
 * in the Software without restriction, including without limitation the rights
 * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
 * copies of the Software, and to permit persons to whom the Software is
 * furnished to do so, subject to the following conditions:
-*
+* 
 * The above copyright notice and this permission notice shall be included in
 * all copies or substantial portions of the Software.
-*
+* 
 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
@@ -30,7 +30,7 @@
 	* N = Cpu cost
 	* r = Memory cost
 	* p = parallelization cost
-	*
+	* 
 	*/
 	window.Crypto_scrypt = function (passwd, salt, N, r, p, dkLen, callback) {
 		if (N == 0 || (N & (N - 1)) != 0) throw Error("N must be > 0 and a power of 2");
@@ -292,4 +292,4 @@
 			}
 		} // scryptCore
 	}; // window.Crypto_scrypt
-})();
+})();
\ No newline at end of file
diff --git a/src/cryptojs.aes.js b/src/cryptojs.aes.js
index df59836..dfcba32 100644
--- a/src/cryptojs.aes.js
+++ b/src/cryptojs.aes.js
@@ -102,7 +102,7 @@
 			// Allow mode to override options
 			if (mode.fixOptions) mode.fixOptions(options);
 
-			var
+			var 
 
 			// Convert to bytes if message is a string
 		m = (
@@ -143,7 +143,7 @@
 			// Allow mode to override options
 			if (mode.fixOptions) mode.fixOptions(options);
 
-			var
+			var 
 
 			// Convert to bytes if ciphertext is a string
 		c = (
@@ -404,4 +404,4 @@
 
 	};
 
-})();
+})();
\ No newline at end of file
diff --git a/src/cryptojs.blockmodes.js b/src/cryptojs.blockmodes.js
index 5e2cbbf..e0de9e6 100644
--- a/src/cryptojs.blockmodes.js
+++ b/src/cryptojs.blockmodes.js
@@ -176,9 +176,9 @@
 
 	/**
 	* Electronic Code Book mode.
-	*
+	* 
 	* ECB applies the cipher directly against each block of the input.
-	*
+	* 
 	* ECB does not require an initialization vector.
 	*/
 	var ECB = C_mode.ECB = function () {
@@ -213,7 +213,7 @@
 
 	/**
 	* Cipher block chaining
-	*
+	* 
 	* The first block is XORed with the IV. Subsequent blocks are XOR with the
 	* previous cipher output.
 	*/
@@ -267,11 +267,11 @@
 
 	/**
 	* Cipher feed back
-	*
+	* 
 	* The cipher output is XORed with the plain text to produce the cipher output,
 	* which is then fed back into the cipher to produce a bit pattern to XOR the
 	* next block with.
-	*
+	* 
 	* This is a stream cipher mode and does not require padding.
 	*/
 	var CFB = C_mode.CFB = function () {
@@ -319,10 +319,10 @@
 
 	/**
 	* Output feed back
-	*
+	* 
 	* The cipher repeatedly encrypts its own output. The output is XORed with the
 	* plain text to produce the cipher text.
-	*
+	* 
 	* This is a stream cipher mode and does not require padding.
 	*/
 	var OFB = C_mode.OFB = function () {
@@ -407,4 +407,4 @@
 	};
 	CTR_prototype._doDecrypt = CTR_prototype._doEncrypt;
 
-})(Crypto);
+})(Crypto);
\ No newline at end of file
diff --git a/src/ellipticcurve.js b/src/ellipticcurve.js
index 15f6e76..d41fee6 100644
--- a/src/ellipticcurve.js
+++ b/src/ellipticcurve.js
@@ -3,7 +3,7 @@
 * Basic Javascript Elliptic Curve implementation
 * Ported loosely from BouncyCastle's Java EC code
 * Only Fp curves implemented for now
-*
+* 
 * Copyright Tom Wu, bitaddress.org  BSD License.
 * http://www-cs-students.stanford.edu/~tjw/jsbn/LICENSE
 */
@@ -64,7 +64,7 @@
 	/**
 	* return a sqrt root - the routine verifies that the calculation
 	* returns the right value - if none exists it returns null.
-	*
+	* 
 	* Copyright (c) 2000 - 2011 The Legion Of The Bouncy Castle (http://www.bouncycastle.org)
 	* Ported to JavaScript by bitaddress.org
 	*/
@@ -353,7 +353,7 @@
 		var len = 32; // integerToBytes will zero pad if integer is less than 32 bytes. 32 bytes length is required by the Bitcoin protocol.
 		var enc = ec.integerToBytes(x, len);
 
-		// when compressed prepend byte depending if y point is even or odd
+		// when compressed prepend byte depending if y point is even or odd 
 		if (compressed) {
 			if (y.isEven()) {
 				enc.unshift(0x02);
@@ -666,4 +666,4 @@
 		if (ec.secNamedCurves[name] == undefined) return null;
 		return ec.secNamedCurves[name]();
 	}
-})();
+})();
\ No newline at end of file
diff --git a/src/jsqrcode.js b/src/jsqrcode.js
index 59a5653..4f50782 100644
--- a/src/jsqrcode.js
+++ b/src/jsqrcode.js
@@ -1,8 +1,8 @@
 /*
-  Ported to JavaScript by Lazar Laszlo 2011
-
+  Ported to JavaScript by Lazar Laszlo 2011 
+  
   lazarsoft@gmail.com, www.lazarsoft.info
-
+  
 */
 
 /*
@@ -93,7 +93,7 @@ GridSampler.checkAndNudgePoints=function( image,  points)
 				}
 			}
 		}
-
+	
 
 
 GridSampler.sampleGrid3=function( image,  dimension,  transform)
@@ -146,7 +146,7 @@ GridSampler.sampleGrid3=function( image,  dimension,  transform)
 GridSampler.sampleGridx=function( image,  dimension,  p1ToX,  p1ToY,  p2ToX,  p2ToY,  p3ToX,  p3ToY,  p4ToX,  p4ToY,  p1FromX,  p1FromY,  p2FromX,  p2FromY,  p3FromX,  p3FromY,  p4FromX,  p4FromY)
 {
 	var transform = PerspectiveTransform.quadrilateralToQuadrilateral(p1ToX, p1ToY, p2ToX, p2ToY, p3ToX, p3ToY, p4ToX, p4ToY, p1FromX, p1FromY, p2FromX, p2FromY, p3FromX, p3FromY, p4FromX, p4FromY);
-
+			
 	return GridSampler.sampleGrid3(image, dimension, transform);
 }
 
@@ -154,7 +154,7 @@ function ECB(count,  dataCodewords)
 {
 	this.count = count;
 	this.dataCodewords = dataCodewords;
-
+	
 	this.__defineGetter__("Count", function()
 	{
 		return this.count;
@@ -172,17 +172,17 @@ function ECBlocks( ecCodewordsPerBlock,  ecBlocks1,  ecBlocks2)
 		this.ecBlocks = new Array(ecBlocks1, ecBlocks2);
 	else
 		this.ecBlocks = new Array(ecBlocks1);
-
+	
 	this.__defineGetter__("ECCodewordsPerBlock", function()
 	{
 		return this.ecCodewordsPerBlock;
 	});
-
+	
 	this.__defineGetter__("TotalECCodewords", function()
 	{
 		return  this.ecCodewordsPerBlock * this.NumBlocks;
 	});
-
+	
 	this.__defineGetter__("NumBlocks", function()
 	{
 		var total = 0;
@@ -192,7 +192,7 @@ function ECBlocks( ecCodewordsPerBlock,  ecBlocks1,  ecBlocks2)
 		}
 		return total;
 	});
-
+	
 	this.getECBlocks=function()
 			{
 				return this.ecBlocks;
@@ -204,7 +204,7 @@ function Version( versionNumber,  alignmentPatternCenters,  ecBlocks1,  ecBlocks
 	this.versionNumber = versionNumber;
 	this.alignmentPatternCenters = alignmentPatternCenters;
 	this.ecBlocks = new Array(ecBlocks1, ecBlocks2, ecBlocks3, ecBlocks4);
-
+	
 	var total = 0;
 	var ecCodewords = ecBlocks1.ECCodewordsPerBlock;
 	var ecbArray = ecBlocks1.getECBlocks();
@@ -214,12 +214,12 @@ function Version( versionNumber,  alignmentPatternCenters,  ecBlocks1,  ecBlocks
 		total += ecBlock.Count * (ecBlock.DataCodewords + ecCodewords);
 	}
 	this.totalCodewords = total;
-
+	
 	this.__defineGetter__("VersionNumber", function()
 	{
 		return  this.versionNumber;
 	});
-
+	
 	this.__defineGetter__("AlignmentPatternCenters", function()
 	{
 		return  this.alignmentPatternCenters;
@@ -232,19 +232,19 @@ function Version( versionNumber,  alignmentPatternCenters,  ecBlocks1,  ecBlocks
 	{
 		return  17 + 4 * this.versionNumber;
 	});
-
+	
 	this.buildFunctionPattern=function()
 		{
 			var dimension = this.DimensionForVersion;
 			var bitMatrix = new BitMatrix(dimension);
-
+			
 			// Top left finder pattern + separator + format
 			bitMatrix.setRegion(0, 0, 9, 9);
 			// Top right finder pattern + separator + format
 			bitMatrix.setRegion(dimension - 8, 0, 8, 9);
 			// Bottom left finder pattern + separator + format
 			bitMatrix.setRegion(0, dimension - 8, 9, 8);
-
+			
 			// Alignment patterns
 			var max = this.alignmentPatternCenters.length;
 			for (var x = 0; x < max; x++)
@@ -260,12 +260,12 @@ function Version( versionNumber,  alignmentPatternCenters,  ecBlocks1,  ecBlocks
 					bitMatrix.setRegion(this.alignmentPatternCenters[y] - 2, i, 5, 5);
 				}
 			}
-
+			
 			// Vertical timing pattern
 			bitMatrix.setRegion(6, 9, 1, dimension - 17);
 			// Horizontal timing pattern
 			bitMatrix.setRegion(9, 6, dimension - 17, 1);
-
+			
 			if (this.versionNumber > 6)
 			{
 				// Version info, top right
@@ -273,7 +273,7 @@ function Version( versionNumber,  alignmentPatternCenters,  ecBlocks1,  ecBlocks
 				// Version info, bottom left
 				bitMatrix.setRegion(0, dimension - 11, 6, 3);
 			}
-
+			
 			return bitMatrix;
 		}
 	this.getECBlocksForLevel=function( ecLevel)
@@ -344,45 +344,45 @@ Version.decodeVersionInformation=function( versionBits)
 
 function buildVersions()
 {
-	return new Array(new Version(1, new Array(), new ECBlocks(7, new ECB(1, 19)), new ECBlocks(10, new ECB(1, 16)), new ECBlocks(13, new ECB(1, 13)), new ECBlocks(17, new ECB(1, 9))),
-	new Version(2, new Array(6, 18), new ECBlocks(10, new ECB(1, 34)), new ECBlocks(16, new ECB(1, 28)), new ECBlocks(22, new ECB(1, 22)), new ECBlocks(28, new ECB(1, 16))),
-	new Version(3, new Array(6, 22), new ECBlocks(15, new ECB(1, 55)), new ECBlocks(26, new ECB(1, 44)), new ECBlocks(18, new ECB(2, 17)), new ECBlocks(22, new ECB(2, 13))),
-	new Version(4, new Array(6, 26), new ECBlocks(20, new ECB(1, 80)), new ECBlocks(18, new ECB(2, 32)), new ECBlocks(26, new ECB(2, 24)), new ECBlocks(16, new ECB(4, 9))),
-	new Version(5, new Array(6, 30), new ECBlocks(26, new ECB(1, 108)), new ECBlocks(24, new ECB(2, 43)), new ECBlocks(18, new ECB(2, 15), new ECB(2, 16)), new ECBlocks(22, new ECB(2, 11), new ECB(2, 12))),
-	new Version(6, new Array(6, 34), new ECBlocks(18, new ECB(2, 68)), new ECBlocks(16, new ECB(4, 27)), new ECBlocks(24, new ECB(4, 19)), new ECBlocks(28, new ECB(4, 15))),
-	new Version(7, new Array(6, 22, 38), new ECBlocks(20, new ECB(2, 78)), new ECBlocks(18, new ECB(4, 31)), new ECBlocks(18, new ECB(2, 14), new ECB(4, 15)), new ECBlocks(26, new ECB(4, 13), new ECB(1, 14))),
-	new Version(8, new Array(6, 24, 42), new ECBlocks(24, new ECB(2, 97)), new ECBlocks(22, new ECB(2, 38), new ECB(2, 39)), new ECBlocks(22, new ECB(4, 18), new ECB(2, 19)), new ECBlocks(26, new ECB(4, 14), new ECB(2, 15))),
-	new Version(9, new Array(6, 26, 46), new ECBlocks(30, new ECB(2, 116)), new ECBlocks(22, new ECB(3, 36), new ECB(2, 37)), new ECBlocks(20, new ECB(4, 16), new ECB(4, 17)), new ECBlocks(24, new ECB(4, 12), new ECB(4, 13))),
-	new Version(10, new Array(6, 28, 50), new ECBlocks(18, new ECB(2, 68), new ECB(2, 69)), new ECBlocks(26, new ECB(4, 43), new ECB(1, 44)), new ECBlocks(24, new ECB(6, 19), new ECB(2, 20)), new ECBlocks(28, new ECB(6, 15), new ECB(2, 16))),
-	new Version(11, new Array(6, 30, 54), new ECBlocks(20, new ECB(4, 81)), new ECBlocks(30, new ECB(1, 50), new ECB(4, 51)), new ECBlocks(28, new ECB(4, 22), new ECB(4, 23)), new ECBlocks(24, new ECB(3, 12), new ECB(8, 13))),
-	new Version(12, new Array(6, 32, 58), new ECBlocks(24, new ECB(2, 92), new ECB(2, 93)), new ECBlocks(22, new ECB(6, 36), new ECB(2, 37)), new ECBlocks(26, new ECB(4, 20), new ECB(6, 21)), new ECBlocks(28, new ECB(7, 14), new ECB(4, 15))),
-	new Version(13, new Array(6, 34, 62), new ECBlocks(26, new ECB(4, 107)), new ECBlocks(22, new ECB(8, 37), new ECB(1, 38)), new ECBlocks(24, new ECB(8, 20), new ECB(4, 21)), new ECBlocks(22, new ECB(12, 11), new ECB(4, 12))),
-	new Version(14, new Array(6, 26, 46, 66), new ECBlocks(30, new ECB(3, 115), new ECB(1, 116)), new ECBlocks(24, new ECB(4, 40), new ECB(5, 41)), new ECBlocks(20, new ECB(11, 16), new ECB(5, 17)), new ECBlocks(24, new ECB(11, 12), new ECB(5, 13))),
-	new Version(15, new Array(6, 26, 48, 70), new ECBlocks(22, new ECB(5, 87), new ECB(1, 88)), new ECBlocks(24, new ECB(5, 41), new ECB(5, 42)), new ECBlocks(30, new ECB(5, 24), new ECB(7, 25)), new ECBlocks(24, new ECB(11, 12), new ECB(7, 13))),
-	new Version(16, new Array(6, 26, 50, 74), new ECBlocks(24, new ECB(5, 98), new ECB(1, 99)), new ECBlocks(28, new ECB(7, 45), new ECB(3, 46)), new ECBlocks(24, new ECB(15, 19), new ECB(2, 20)), new ECBlocks(30, new ECB(3, 15), new ECB(13, 16))),
-	new Version(17, new Array(6, 30, 54, 78), new ECBlocks(28, new ECB(1, 107), new ECB(5, 108)), new ECBlocks(28, new ECB(10, 46), new ECB(1, 47)), new ECBlocks(28, new ECB(1, 22), new ECB(15, 23)), new ECBlocks(28, new ECB(2, 14), new ECB(17, 15))),
-	new Version(18, new Array(6, 30, 56, 82), new ECBlocks(30, new ECB(5, 120), new ECB(1, 121)), new ECBlocks(26, new ECB(9, 43), new ECB(4, 44)), new ECBlocks(28, new ECB(17, 22), new ECB(1, 23)), new ECBlocks(28, new ECB(2, 14), new ECB(19, 15))),
-	new Version(19, new Array(6, 30, 58, 86), new ECBlocks(28, new ECB(3, 113), new ECB(4, 114)), new ECBlocks(26, new ECB(3, 44), new ECB(11, 45)), new ECBlocks(26, new ECB(17, 21), new ECB(4, 22)), new ECBlocks(26, new ECB(9, 13), new ECB(16, 14))),
-	new Version(20, new Array(6, 34, 62, 90), new ECBlocks(28, new ECB(3, 107), new ECB(5, 108)), new ECBlocks(26, new ECB(3, 41), new ECB(13, 42)), new ECBlocks(30, new ECB(15, 24), new ECB(5, 25)), new ECBlocks(28, new ECB(15, 15), new ECB(10, 16))),
-	new Version(21, new Array(6, 28, 50, 72, 94), new ECBlocks(28, new ECB(4, 116), new ECB(4, 117)), new ECBlocks(26, new ECB(17, 42)), new ECBlocks(28, new ECB(17, 22), new ECB(6, 23)), new ECBlocks(30, new ECB(19, 16), new ECB(6, 17))),
-	new Version(22, new Array(6, 26, 50, 74, 98), new ECBlocks(28, new ECB(2, 111), new ECB(7, 112)), new ECBlocks(28, new ECB(17, 46)), new ECBlocks(30, new ECB(7, 24), new ECB(16, 25)), new ECBlocks(24, new ECB(34, 13))),
-	new Version(23, new Array(6, 30, 54, 74, 102), new ECBlocks(30, new ECB(4, 121), new ECB(5, 122)), new ECBlocks(28, new ECB(4, 47), new ECB(14, 48)), new ECBlocks(30, new ECB(11, 24), new ECB(14, 25)), new ECBlocks(30, new ECB(16, 15), new ECB(14, 16))),
-	new Version(24, new Array(6, 28, 54, 80, 106), new ECBlocks(30, new ECB(6, 117), new ECB(4, 118)), new ECBlocks(28, new ECB(6, 45), new ECB(14, 46)), new ECBlocks(30, new ECB(11, 24), new ECB(16, 25)), new ECBlocks(30, new ECB(30, 16), new ECB(2, 17))),
-	new Version(25, new Array(6, 32, 58, 84, 110), new ECBlocks(26, new ECB(8, 106), new ECB(4, 107)), new ECBlocks(28, new ECB(8, 47), new ECB(13, 48)), new ECBlocks(30, new ECB(7, 24), new ECB(22, 25)), new ECBlocks(30, new ECB(22, 15), new ECB(13, 16))),
-	new Version(26, new Array(6, 30, 58, 86, 114), new ECBlocks(28, new ECB(10, 114), new ECB(2, 115)), new ECBlocks(28, new ECB(19, 46), new ECB(4, 47)), new ECBlocks(28, new ECB(28, 22), new ECB(6, 23)), new ECBlocks(30, new ECB(33, 16), new ECB(4, 17))),
+	return new Array(new Version(1, new Array(), new ECBlocks(7, new ECB(1, 19)), new ECBlocks(10, new ECB(1, 16)), new ECBlocks(13, new ECB(1, 13)), new ECBlocks(17, new ECB(1, 9))), 
+	new Version(2, new Array(6, 18), new ECBlocks(10, new ECB(1, 34)), new ECBlocks(16, new ECB(1, 28)), new ECBlocks(22, new ECB(1, 22)), new ECBlocks(28, new ECB(1, 16))), 
+	new Version(3, new Array(6, 22), new ECBlocks(15, new ECB(1, 55)), new ECBlocks(26, new ECB(1, 44)), new ECBlocks(18, new ECB(2, 17)), new ECBlocks(22, new ECB(2, 13))), 
+	new Version(4, new Array(6, 26), new ECBlocks(20, new ECB(1, 80)), new ECBlocks(18, new ECB(2, 32)), new ECBlocks(26, new ECB(2, 24)), new ECBlocks(16, new ECB(4, 9))), 
+	new Version(5, new Array(6, 30), new ECBlocks(26, new ECB(1, 108)), new ECBlocks(24, new ECB(2, 43)), new ECBlocks(18, new ECB(2, 15), new ECB(2, 16)), new ECBlocks(22, new ECB(2, 11), new ECB(2, 12))), 
+	new Version(6, new Array(6, 34), new ECBlocks(18, new ECB(2, 68)), new ECBlocks(16, new ECB(4, 27)), new ECBlocks(24, new ECB(4, 19)), new ECBlocks(28, new ECB(4, 15))), 
+	new Version(7, new Array(6, 22, 38), new ECBlocks(20, new ECB(2, 78)), new ECBlocks(18, new ECB(4, 31)), new ECBlocks(18, new ECB(2, 14), new ECB(4, 15)), new ECBlocks(26, new ECB(4, 13), new ECB(1, 14))), 
+	new Version(8, new Array(6, 24, 42), new ECBlocks(24, new ECB(2, 97)), new ECBlocks(22, new ECB(2, 38), new ECB(2, 39)), new ECBlocks(22, new ECB(4, 18), new ECB(2, 19)), new ECBlocks(26, new ECB(4, 14), new ECB(2, 15))), 
+	new Version(9, new Array(6, 26, 46), new ECBlocks(30, new ECB(2, 116)), new ECBlocks(22, new ECB(3, 36), new ECB(2, 37)), new ECBlocks(20, new ECB(4, 16), new ECB(4, 17)), new ECBlocks(24, new ECB(4, 12), new ECB(4, 13))), 
+	new Version(10, new Array(6, 28, 50), new ECBlocks(18, new ECB(2, 68), new ECB(2, 69)), new ECBlocks(26, new ECB(4, 43), new ECB(1, 44)), new ECBlocks(24, new ECB(6, 19), new ECB(2, 20)), new ECBlocks(28, new ECB(6, 15), new ECB(2, 16))), 
+	new Version(11, new Array(6, 30, 54), new ECBlocks(20, new ECB(4, 81)), new ECBlocks(30, new ECB(1, 50), new ECB(4, 51)), new ECBlocks(28, new ECB(4, 22), new ECB(4, 23)), new ECBlocks(24, new ECB(3, 12), new ECB(8, 13))), 
+	new Version(12, new Array(6, 32, 58), new ECBlocks(24, new ECB(2, 92), new ECB(2, 93)), new ECBlocks(22, new ECB(6, 36), new ECB(2, 37)), new ECBlocks(26, new ECB(4, 20), new ECB(6, 21)), new ECBlocks(28, new ECB(7, 14), new ECB(4, 15))), 
+	new Version(13, new Array(6, 34, 62), new ECBlocks(26, new ECB(4, 107)), new ECBlocks(22, new ECB(8, 37), new ECB(1, 38)), new ECBlocks(24, new ECB(8, 20), new ECB(4, 21)), new ECBlocks(22, new ECB(12, 11), new ECB(4, 12))), 
+	new Version(14, new Array(6, 26, 46, 66), new ECBlocks(30, new ECB(3, 115), new ECB(1, 116)), new ECBlocks(24, new ECB(4, 40), new ECB(5, 41)), new ECBlocks(20, new ECB(11, 16), new ECB(5, 17)), new ECBlocks(24, new ECB(11, 12), new ECB(5, 13))), 
+	new Version(15, new Array(6, 26, 48, 70), new ECBlocks(22, new ECB(5, 87), new ECB(1, 88)), new ECBlocks(24, new ECB(5, 41), new ECB(5, 42)), new ECBlocks(30, new ECB(5, 24), new ECB(7, 25)), new ECBlocks(24, new ECB(11, 12), new ECB(7, 13))), 
+	new Version(16, new Array(6, 26, 50, 74), new ECBlocks(24, new ECB(5, 98), new ECB(1, 99)), new ECBlocks(28, new ECB(7, 45), new ECB(3, 46)), new ECBlocks(24, new ECB(15, 19), new ECB(2, 20)), new ECBlocks(30, new ECB(3, 15), new ECB(13, 16))), 
+	new Version(17, new Array(6, 30, 54, 78), new ECBlocks(28, new ECB(1, 107), new ECB(5, 108)), new ECBlocks(28, new ECB(10, 46), new ECB(1, 47)), new ECBlocks(28, new ECB(1, 22), new ECB(15, 23)), new ECBlocks(28, new ECB(2, 14), new ECB(17, 15))), 
+	new Version(18, new Array(6, 30, 56, 82), new ECBlocks(30, new ECB(5, 120), new ECB(1, 121)), new ECBlocks(26, new ECB(9, 43), new ECB(4, 44)), new ECBlocks(28, new ECB(17, 22), new ECB(1, 23)), new ECBlocks(28, new ECB(2, 14), new ECB(19, 15))), 
+	new Version(19, new Array(6, 30, 58, 86), new ECBlocks(28, new ECB(3, 113), new ECB(4, 114)), new ECBlocks(26, new ECB(3, 44), new ECB(11, 45)), new ECBlocks(26, new ECB(17, 21), new ECB(4, 22)), new ECBlocks(26, new ECB(9, 13), new ECB(16, 14))), 
+	new Version(20, new Array(6, 34, 62, 90), new ECBlocks(28, new ECB(3, 107), new ECB(5, 108)), new ECBlocks(26, new ECB(3, 41), new ECB(13, 42)), new ECBlocks(30, new ECB(15, 24), new ECB(5, 25)), new ECBlocks(28, new ECB(15, 15), new ECB(10, 16))), 
+	new Version(21, new Array(6, 28, 50, 72, 94), new ECBlocks(28, new ECB(4, 116), new ECB(4, 117)), new ECBlocks(26, new ECB(17, 42)), new ECBlocks(28, new ECB(17, 22), new ECB(6, 23)), new ECBlocks(30, new ECB(19, 16), new ECB(6, 17))), 
+	new Version(22, new Array(6, 26, 50, 74, 98), new ECBlocks(28, new ECB(2, 111), new ECB(7, 112)), new ECBlocks(28, new ECB(17, 46)), new ECBlocks(30, new ECB(7, 24), new ECB(16, 25)), new ECBlocks(24, new ECB(34, 13))), 
+	new Version(23, new Array(6, 30, 54, 74, 102), new ECBlocks(30, new ECB(4, 121), new ECB(5, 122)), new ECBlocks(28, new ECB(4, 47), new ECB(14, 48)), new ECBlocks(30, new ECB(11, 24), new ECB(14, 25)), new ECBlocks(30, new ECB(16, 15), new ECB(14, 16))), 
+	new Version(24, new Array(6, 28, 54, 80, 106), new ECBlocks(30, new ECB(6, 117), new ECB(4, 118)), new ECBlocks(28, new ECB(6, 45), new ECB(14, 46)), new ECBlocks(30, new ECB(11, 24), new ECB(16, 25)), new ECBlocks(30, new ECB(30, 16), new ECB(2, 17))), 
+	new Version(25, new Array(6, 32, 58, 84, 110), new ECBlocks(26, new ECB(8, 106), new ECB(4, 107)), new ECBlocks(28, new ECB(8, 47), new ECB(13, 48)), new ECBlocks(30, new ECB(7, 24), new ECB(22, 25)), new ECBlocks(30, new ECB(22, 15), new ECB(13, 16))), 
+	new Version(26, new Array(6, 30, 58, 86, 114), new ECBlocks(28, new ECB(10, 114), new ECB(2, 115)), new ECBlocks(28, new ECB(19, 46), new ECB(4, 47)), new ECBlocks(28, new ECB(28, 22), new ECB(6, 23)), new ECBlocks(30, new ECB(33, 16), new ECB(4, 17))), 
 	new Version(27, new Array(6, 34, 62, 90, 118), new ECBlocks(30, new ECB(8, 122), new ECB(4, 123)), new ECBlocks(28, new ECB(22, 45), new ECB(3, 46)), new ECBlocks(30, new ECB(8, 23), new ECB(26, 24)), new ECBlocks(30, new ECB(12, 15), 		new ECB(28, 16))),
-	new Version(28, new Array(6, 26, 50, 74, 98, 122), new ECBlocks(30, new ECB(3, 117), new ECB(10, 118)), new ECBlocks(28, new ECB(3, 45), new ECB(23, 46)), new ECBlocks(30, new ECB(4, 24), new ECB(31, 25)), new ECBlocks(30, new ECB(11, 15), new ECB(31, 16))),
-	new Version(29, new Array(6, 30, 54, 78, 102, 126), new ECBlocks(30, new ECB(7, 116), new ECB(7, 117)), new ECBlocks(28, new ECB(21, 45), new ECB(7, 46)), new ECBlocks(30, new ECB(1, 23), new ECB(37, 24)), new ECBlocks(30, new ECB(19, 15), new ECB(26, 16))),
-	new Version(30, new Array(6, 26, 52, 78, 104, 130), new ECBlocks(30, new ECB(5, 115), new ECB(10, 116)), new ECBlocks(28, new ECB(19, 47), new ECB(10, 48)), new ECBlocks(30, new ECB(15, 24), new ECB(25, 25)), new ECBlocks(30, new ECB(23, 15), new ECB(25, 16))),
-	new Version(31, new Array(6, 30, 56, 82, 108, 134), new ECBlocks(30, new ECB(13, 115), new ECB(3, 116)), new ECBlocks(28, new ECB(2, 46), new ECB(29, 47)), new ECBlocks(30, new ECB(42, 24), new ECB(1, 25)), new ECBlocks(30, new ECB(23, 15), new ECB(28, 16))),
-	new Version(32, new Array(6, 34, 60, 86, 112, 138), new ECBlocks(30, new ECB(17, 115)), new ECBlocks(28, new ECB(10, 46), new ECB(23, 47)), new ECBlocks(30, new ECB(10, 24), new ECB(35, 25)), new ECBlocks(30, new ECB(19, 15), new ECB(35, 16))),
-	new Version(33, new Array(6, 30, 58, 86, 114, 142), new ECBlocks(30, new ECB(17, 115), new ECB(1, 116)), new ECBlocks(28, new ECB(14, 46), new ECB(21, 47)), new ECBlocks(30, new ECB(29, 24), new ECB(19, 25)), new ECBlocks(30, new ECB(11, 15), new ECB(46, 16))),
-	new Version(34, new Array(6, 34, 62, 90, 118, 146), new ECBlocks(30, new ECB(13, 115), new ECB(6, 116)), new ECBlocks(28, new ECB(14, 46), new ECB(23, 47)), new ECBlocks(30, new ECB(44, 24), new ECB(7, 25)), new ECBlocks(30, new ECB(59, 16), new ECB(1, 17))),
-	new Version(35, new Array(6, 30, 54, 78, 102, 126, 150), new ECBlocks(30, new ECB(12, 121), new ECB(7, 122)), new ECBlocks(28, new ECB(12, 47), new ECB(26, 48)), new ECBlocks(30, new ECB(39, 24), new ECB(14, 25)),new ECBlocks(30, new ECB(22, 15), new ECB(41, 16))),
-	new Version(36, new Array(6, 24, 50, 76, 102, 128, 154), new ECBlocks(30, new ECB(6, 121), new ECB(14, 122)), new ECBlocks(28, new ECB(6, 47), new ECB(34, 48)), new ECBlocks(30, new ECB(46, 24), new ECB(10, 25)), new ECBlocks(30, new ECB(2, 15), new ECB(64, 16))),
-	new Version(37, new Array(6, 28, 54, 80, 106, 132, 158), new ECBlocks(30, new ECB(17, 122), new ECB(4, 123)), new ECBlocks(28, new ECB(29, 46), new ECB(14, 47)), new ECBlocks(30, new ECB(49, 24), new ECB(10, 25)), new ECBlocks(30, new ECB(24, 15), new ECB(46, 16))),
-	new Version(38, new Array(6, 32, 58, 84, 110, 136, 162), new ECBlocks(30, new ECB(4, 122), new ECB(18, 123)), new ECBlocks(28, new ECB(13, 46), new ECB(32, 47)), new ECBlocks(30, new ECB(48, 24), new ECB(14, 25)), new ECBlocks(30, new ECB(42, 15), new ECB(32, 16))),
-	new Version(39, new Array(6, 26, 54, 82, 110, 138, 166), new ECBlocks(30, new ECB(20, 117), new ECB(4, 118)), new ECBlocks(28, new ECB(40, 47), new ECB(7, 48)), new ECBlocks(30, new ECB(43, 24), new ECB(22, 25)), new ECBlocks(30, new ECB(10, 15), new ECB(67, 16))),
+	new Version(28, new Array(6, 26, 50, 74, 98, 122), new ECBlocks(30, new ECB(3, 117), new ECB(10, 118)), new ECBlocks(28, new ECB(3, 45), new ECB(23, 46)), new ECBlocks(30, new ECB(4, 24), new ECB(31, 25)), new ECBlocks(30, new ECB(11, 15), new ECB(31, 16))), 
+	new Version(29, new Array(6, 30, 54, 78, 102, 126), new ECBlocks(30, new ECB(7, 116), new ECB(7, 117)), new ECBlocks(28, new ECB(21, 45), new ECB(7, 46)), new ECBlocks(30, new ECB(1, 23), new ECB(37, 24)), new ECBlocks(30, new ECB(19, 15), new ECB(26, 16))), 
+	new Version(30, new Array(6, 26, 52, 78, 104, 130), new ECBlocks(30, new ECB(5, 115), new ECB(10, 116)), new ECBlocks(28, new ECB(19, 47), new ECB(10, 48)), new ECBlocks(30, new ECB(15, 24), new ECB(25, 25)), new ECBlocks(30, new ECB(23, 15), new ECB(25, 16))), 
+	new Version(31, new Array(6, 30, 56, 82, 108, 134), new ECBlocks(30, new ECB(13, 115), new ECB(3, 116)), new ECBlocks(28, new ECB(2, 46), new ECB(29, 47)), new ECBlocks(30, new ECB(42, 24), new ECB(1, 25)), new ECBlocks(30, new ECB(23, 15), new ECB(28, 16))), 
+	new Version(32, new Array(6, 34, 60, 86, 112, 138), new ECBlocks(30, new ECB(17, 115)), new ECBlocks(28, new ECB(10, 46), new ECB(23, 47)), new ECBlocks(30, new ECB(10, 24), new ECB(35, 25)), new ECBlocks(30, new ECB(19, 15), new ECB(35, 16))), 
+	new Version(33, new Array(6, 30, 58, 86, 114, 142), new ECBlocks(30, new ECB(17, 115), new ECB(1, 116)), new ECBlocks(28, new ECB(14, 46), new ECB(21, 47)), new ECBlocks(30, new ECB(29, 24), new ECB(19, 25)), new ECBlocks(30, new ECB(11, 15), new ECB(46, 16))), 
+	new Version(34, new Array(6, 34, 62, 90, 118, 146), new ECBlocks(30, new ECB(13, 115), new ECB(6, 116)), new ECBlocks(28, new ECB(14, 46), new ECB(23, 47)), new ECBlocks(30, new ECB(44, 24), new ECB(7, 25)), new ECBlocks(30, new ECB(59, 16), new ECB(1, 17))), 
+	new Version(35, new Array(6, 30, 54, 78, 102, 126, 150), new ECBlocks(30, new ECB(12, 121), new ECB(7, 122)), new ECBlocks(28, new ECB(12, 47), new ECB(26, 48)), new ECBlocks(30, new ECB(39, 24), new ECB(14, 25)),new ECBlocks(30, new ECB(22, 15), new ECB(41, 16))), 
+	new Version(36, new Array(6, 24, 50, 76, 102, 128, 154), new ECBlocks(30, new ECB(6, 121), new ECB(14, 122)), new ECBlocks(28, new ECB(6, 47), new ECB(34, 48)), new ECBlocks(30, new ECB(46, 24), new ECB(10, 25)), new ECBlocks(30, new ECB(2, 15), new ECB(64, 16))), 
+	new Version(37, new Array(6, 28, 54, 80, 106, 132, 158), new ECBlocks(30, new ECB(17, 122), new ECB(4, 123)), new ECBlocks(28, new ECB(29, 46), new ECB(14, 47)), new ECBlocks(30, new ECB(49, 24), new ECB(10, 25)), new ECBlocks(30, new ECB(24, 15), new ECB(46, 16))), 
+	new Version(38, new Array(6, 32, 58, 84, 110, 136, 162), new ECBlocks(30, new ECB(4, 122), new ECB(18, 123)), new ECBlocks(28, new ECB(13, 46), new ECB(32, 47)), new ECBlocks(30, new ECB(48, 24), new ECB(14, 25)), new ECBlocks(30, new ECB(42, 15), new ECB(32, 16))), 
+	new Version(39, new Array(6, 26, 54, 82, 110, 138, 166), new ECBlocks(30, new ECB(20, 117), new ECB(4, 118)), new ECBlocks(28, new ECB(40, 47), new ECB(7, 48)), new ECBlocks(30, new ECB(43, 24), new ECB(22, 25)), new ECBlocks(30, new ECB(10, 15), new ECB(67, 16))), 
 	new Version(40, new Array(6, 30, 58, 86, 114, 142, 170), new ECBlocks(30, new ECB(19, 118), new ECB(6, 119)), new ECBlocks(28, new ECB(18, 47), new ECB(31, 48)), new ECBlocks(30, new ECB(34, 24), new ECB(34, 25)), new ECBlocks(30, new ECB(20, 15), new ECB(61, 16))));
 }
 
@@ -445,7 +445,7 @@ function PerspectiveTransform( a11,  a21,  a31,  a12,  a22,  a32,  a13,  a23,  a
 
 PerspectiveTransform.quadrilateralToQuadrilateral=function( x0,  y0,  x1,  y1,  x2,  y2,  x3,  y3,  x0p,  y0p,  x1p,  y1p,  x2p,  y2p,  x3p,  y3p)
 {
-
+	
 	var qToS = this.quadrilateralToSquare(x0, y0, x1, y1, x2, y2, x3, y3);
 	var sToQ = this.squareToQuadrilateral(x0p, y0p, x1p, y1p, x2p, y2p, x3p, y3p);
 	return sToQ.times(qToS);
@@ -489,7 +489,7 @@ function Detector(image)
 {
 	this.image=image;
 	this.resultPointCallback = null;
-
+	
 	this.sizeOfBlackWhiteBlackRun=function( fromX,  fromY,  toX,  toY)
 		{
 			// Mild variant of Bresenham's algorithm;
@@ -504,7 +504,7 @@ function Detector(image)
 				toX = toY;
 				toY = temp;
 			}
-
+			
 			var dx = Math.abs(toX - fromX);
 			var dy = Math.abs(toY - fromY);
 			var error = - dx >> 1;
@@ -513,7 +513,7 @@ function Detector(image)
 			var state = 0; // In black pixels, looking for white, first or second time
 			for (var x = fromX, y = fromY; x != toX; x += xstep)
 			{
-
+				
 				var realX = steep?y:x;
 				var realY = steep?x:y;
 				if (state == 1)
@@ -531,7 +531,7 @@ function Detector(image)
 						state++;
 					}
 				}
-
+				
 				if (state == 3)
 				{
 					// Found black, white, black, and stumbled back onto white; done
@@ -555,12 +555,12 @@ function Detector(image)
 			return  Math.sqrt( (diffX2 * diffX2 + diffY2 * diffY2));
 		}
 
-
+	
 	this.sizeOfBlackWhiteBlackRunBothWays=function( fromX,  fromY,  toX,  toY)
 		{
-
+			
 			var result = this.sizeOfBlackWhiteBlackRun(fromX, fromY, toX, toY);
-
+			
 			// Now count other way -- don't run off image though of course
 			var scale = 1.0;
 			var otherToX = fromX - (toX - fromX);
@@ -575,7 +575,7 @@ function Detector(image)
 				otherToX = qrcode.width - 1;
 			}
 			var otherToY = Math.floor (fromY - (toY - fromY) * scale);
-
+			
 			scale = 1.0;
 			if (otherToY < 0)
 			{
@@ -588,13 +588,13 @@ function Detector(image)
 				otherToY = qrcode.height - 1;
 			}
 			otherToX = Math.floor (fromX + (otherToX - fromX) * scale);
-
+			
 			result += this.sizeOfBlackWhiteBlackRun(fromX, fromY, otherToX, otherToY);
 			return result - 1.0; // -1 because we counted the middle pixel twice
 		}
+		
 
-
-
+	
 	this.calculateModuleSizeOneWay=function( pattern,  otherPattern)
 		{
 			var moduleSizeEst1 = this.sizeOfBlackWhiteBlackRunBothWays(Math.floor( pattern.X), Math.floor( pattern.Y), Math.floor( otherPattern.X), Math.floor(otherPattern.Y));
@@ -612,7 +612,7 @@ function Detector(image)
 			return (moduleSizeEst1 + moduleSizeEst2) / 14.0;
 		}
 
-
+	
 	this.calculateModuleSize=function( topLeft,  topRight,  bottomLeft)
 		{
 			// Take the average
@@ -627,24 +627,24 @@ function Detector(image)
 	}
 	this.computeDimension=function( topLeft,  topRight,  bottomLeft,  moduleSize)
 		{
-
+			
 			var tltrCentersDimension = Math.round(this.distance(topLeft, topRight) / moduleSize);
 			var tlblCentersDimension = Math.round(this.distance(topLeft, bottomLeft) / moduleSize);
 			var dimension = ((tltrCentersDimension + tlblCentersDimension) >> 1) + 7;
 			switch (dimension & 0x03)
 			{
-
+				
 				// mod 4
-				case 0:
+				case 0: 
 					dimension++;
 					break;
 					// 1? do nothing
-
-				case 2:
+				
+				case 2: 
 					dimension--;
 					break;
-
-				case 3:
+				
+				case 3: 
 					throw "Error";
 				}
 			return dimension;
@@ -661,14 +661,14 @@ function Detector(image)
 			{
 				throw "Error";
 			}
-
+			
 			var alignmentAreaTopY = Math.max(0, estAlignmentY - allowance);
 			var alignmentAreaBottomY = Math.min(qrcode.height - 1, estAlignmentY + allowance);
-
+			
 			var alignmentFinder = new AlignmentPatternFinder(this.image, alignmentAreaLeftX, alignmentAreaTopY, alignmentAreaRightX - alignmentAreaLeftX, alignmentAreaBottomY - alignmentAreaTopY, overallEstModuleSize, this.resultPointCallback);
 			return alignmentFinder.find();
 		}
-
+		
 	this.createTransform=function( topLeft,  topRight,  bottomLeft, alignmentPattern, dimension)
 		{
 			var dimMinusThree =  dimension - 3.5;
@@ -689,26 +689,26 @@ function Detector(image)
 				bottomRightY = (topRight.Y - topLeft.Y) + bottomLeft.Y;
 				sourceBottomRightX = sourceBottomRightY = dimMinusThree;
 			}
-
+			
 			var transform = PerspectiveTransform.quadrilateralToQuadrilateral(3.5, 3.5, dimMinusThree, 3.5, sourceBottomRightX, sourceBottomRightY, 3.5, dimMinusThree, topLeft.X, topLeft.Y, topRight.X, topRight.Y, bottomRightX, bottomRightY, bottomLeft.X, bottomLeft.Y);
-
+			
 			return transform;
-		}
-
+		}		
+	
 	this.sampleGrid=function( image,  transform,  dimension)
 		{
-
+			
 			var sampler = GridSampler;
 			return sampler.sampleGrid3(image, dimension, transform);
 		}
-
+	
 	this.processFinderPatternInfo = function( info)
 		{
-
+			
 			var topLeft = info.TopLeft;
 			var topRight = info.TopRight;
 			var bottomLeft = info.BottomLeft;
-
+			
 			var moduleSize = this.calculateModuleSize(topLeft, topRight, bottomLeft);
 			if (moduleSize < 1.0)
 			{
@@ -717,22 +717,22 @@ function Detector(image)
 			var dimension = this.computeDimension(topLeft, topRight, bottomLeft, moduleSize);
 			var provisionalVersion = Version.getProvisionalVersionForDimension(dimension);
 			var modulesBetweenFPCenters = provisionalVersion.DimensionForVersion - 7;
-
+			
 			var alignmentPattern = null;
 			// Anything above version 1 has an alignment pattern
 			if (provisionalVersion.AlignmentPatternCenters.length > 0)
 			{
-
+				
 				// Guess where a "bottom right" finder pattern would have been
 				var bottomRightX = topRight.X - topLeft.X + bottomLeft.X;
 				var bottomRightY = topRight.Y - topLeft.Y + bottomLeft.Y;
-
+				
 				// Estimate that alignment pattern is closer by 3 modules
 				// from "bottom right" to known top left location
 				var correctionToTopLeft = 1.0 - 3.0 /  modulesBetweenFPCenters;
 				var estAlignmentX = Math.floor (topLeft.X + correctionToTopLeft * (bottomRightX - topLeft.X));
 				var estAlignmentY = Math.floor (topLeft.Y + correctionToTopLeft * (bottomRightY - topLeft.Y));
-
+				
 				// Kind of arbitrary -- expand search radius before giving up
 				for (var i = 4; i <= 16; i <<= 1)
 				{
@@ -748,11 +748,11 @@ function Detector(image)
 				}
 				// If we didn't find alignment pattern... well try anyway without it
 			}
-
+			
 			var transform = this.createTransform(topLeft, topRight, bottomLeft, alignmentPattern, dimension);
-
+			
 			var bits = this.sampleGrid(this.image, transform, dimension);
-
+			
 			var points;
 			if (alignmentPattern == null)
 			{
@@ -764,14 +764,14 @@ function Detector(image)
 			}
 			return new DetectorResult(bits, points);
 		}
+		
 
-
-
+	
 	this.detect=function()
 	{
 		var info =  new FinderPatternFinder().findFinderPattern(this.image);
-
-		return this.processFinderPatternInfo(info);
+			
+		return this.processFinderPatternInfo(info); 
 	}
 }
 
@@ -906,7 +906,7 @@ function BitMatrix( width,  height)
 	this.bits = new Array(rowSize * height);
 	for(var i=0;i<this.bits.length;i++)
 		this.bits[i]=0;
-
+	
 	this.__defineGetter__("Width", function()
 	{
 		return this.width;
@@ -923,7 +923,7 @@ function BitMatrix( width,  height)
 		}
 		return this.width;
 	});
-
+	
 	this.get_Renamed=function( x,  y)
 		{
 			var offset = y * this.rowSize + (x >> 5);
@@ -978,7 +978,7 @@ function DataBlock(numDataCodewords,  codewords)
 {
 	this.numDataCodewords = numDataCodewords;
 	this.codewords = codewords;
-
+	
 	this.__defineGetter__("NumDataCodewords", function()
 	{
 		return this.numDataCodewords;
@@ -987,20 +987,20 @@ function DataBlock(numDataCodewords,  codewords)
 	{
 		return this.codewords;
 	});
-}
-
+}	
+	
 DataBlock.getDataBlocks=function(rawCodewords,  version,  ecLevel)
 {
-
+	
 	if (rawCodewords.length != version.TotalCodewords)
 	{
 		throw "ArgumentException";
 	}
-
+	
 	// Figure out the number and size of data blocks used by this version and
 	// error correction level
 	var ecBlocks = version.getECBlocksForLevel(ecLevel);
-
+	
 	// First count the total number of data blocks
 	var totalBlocks = 0;
 	var ecBlockArray = ecBlocks.getECBlocks();
@@ -1008,7 +1008,7 @@ DataBlock.getDataBlocks=function(rawCodewords,  version,  ecLevel)
 	{
 		totalBlocks += ecBlockArray[i].Count;
 	}
-
+	
 	// Now establish DataBlocks of the appropriate size and number of data codewords
 	var result = new Array(totalBlocks);
 	var numResultBlocks = 0;
@@ -1022,7 +1022,7 @@ DataBlock.getDataBlocks=function(rawCodewords,  version,  ecLevel)
 			result[numResultBlocks++] = new DataBlock(numDataCodewords, new Array(numBlockCodewords));
 		}
 	}
-
+	
 	// All blocks have the same amount of data, except that the last n
 	// (where n may be 0) have 1 more byte. Figure out where these start.
 	var shorterBlocksTotalCodewords = result[0].codewords.length;
@@ -1037,7 +1037,7 @@ DataBlock.getDataBlocks=function(rawCodewords,  version,  ecLevel)
 		longerBlocksStartAt--;
 	}
 	longerBlocksStartAt++;
-
+	
 	var shorterBlocksNumDataCodewords = shorterBlocksTotalCodewords - ecBlocks.ECCodewordsPerBlock;
 	// The last elements of result may be 1 element longer;
 	// first fill out as many elements as all of them have
@@ -1077,19 +1077,19 @@ function BitMatrixParser(bitMatrix)
 	this.bitMatrix = bitMatrix;
 	this.parsedVersion = null;
 	this.parsedFormatInfo = null;
-
+	
 	this.copyBit=function( i,  j,  versionBits)
 	{
 		return this.bitMatrix.get_Renamed(i, j)?(versionBits << 1) | 0x1:versionBits << 1;
 	}
-
+	
 	this.readFormatInformation=function()
 	{
 			if (this.parsedFormatInfo != null)
 			{
 				return this.parsedFormatInfo;
 			}
-
+			
 			// Read top-left format info bits
 			var formatInfoBits = 0;
 			for (var i = 0; i < 6; i++)
@@ -1105,13 +1105,13 @@ function BitMatrixParser(bitMatrix)
 			{
 				formatInfoBits = this.copyBit(8, j, formatInfoBits);
 			}
-
+			
 			this.parsedFormatInfo = FormatInformation.decodeFormatInformation(formatInfoBits);
 			if (this.parsedFormatInfo != null)
 			{
 				return this.parsedFormatInfo;
 			}
-
+			
 			// Hmm, failed. Try the top-right/bottom-left pattern
 			var dimension = this.bitMatrix.Dimension;
 			formatInfoBits = 0;
@@ -1124,30 +1124,30 @@ function BitMatrixParser(bitMatrix)
 			{
 				formatInfoBits = this.copyBit(8, j, formatInfoBits);
 			}
-
+			
 			this.parsedFormatInfo = FormatInformation.decodeFormatInformation(formatInfoBits);
 			if (this.parsedFormatInfo != null)
 			{
 				return this.parsedFormatInfo;
 			}
-			throw "Error readFormatInformation";
+			throw "Error readFormatInformation";	
 	}
 	this.readVersion=function()
 		{
-
+			
 			if (this.parsedVersion != null)
 			{
 				return this.parsedVersion;
 			}
-
+			
 			var dimension = this.bitMatrix.Dimension;
-
+			
 			var provisionalVersion = (dimension - 17) >> 2;
 			if (provisionalVersion <= 6)
 			{
 				return Version.getVersionForNumber(provisionalVersion);
 			}
-
+			
 			// Read top-right version info: 3 wide by 6 tall
 			var versionBits = 0;
 			var ijMin = dimension - 11;
@@ -1158,13 +1158,13 @@ function BitMatrixParser(bitMatrix)
 					versionBits = this.copyBit(i, j, versionBits);
 				}
 			}
-
+			
 			this.parsedVersion = Version.decodeVersionInformation(versionBits);
 			if (this.parsedVersion != null && this.parsedVersion.DimensionForVersion == dimension)
 			{
 				return this.parsedVersion;
 			}
-
+			
 			// Hmm, failed. Try bottom left: 6 wide by 3 tall
 			versionBits = 0;
 			for (var i = 5; i >= 0; i--)
@@ -1174,7 +1174,7 @@ function BitMatrixParser(bitMatrix)
 					versionBits = this.copyBit(i, j, versionBits);
 				}
 			}
-
+			
 			this.parsedVersion = Version.decodeVersionInformation(versionBits);
 			if (this.parsedVersion != null && this.parsedVersion.DimensionForVersion == dimension)
 			{
@@ -1184,18 +1184,18 @@ function BitMatrixParser(bitMatrix)
 		}
 	this.readCodewords=function()
 		{
-
+			
 			var formatInfo = this.readFormatInformation();
 			var version = this.readVersion();
-
+			
 			// Get the data mask for the format used in this QR Code. This will exclude
 			// some bits from reading as we wind through the bit matrix.
 			var dataMask = DataMask.forReference( formatInfo.DataMask);
 			var dimension = this.bitMatrix.Dimension;
 			dataMask.unmaskBitMatrix(this.bitMatrix, dimension);
-
+			
 			var functionPattern = version.buildFunctionPattern();
-
+			
 			var readingUp = true;
 			var result = new Array(version.TotalCodewords);
 			var resultOffset = 0;
@@ -1468,7 +1468,7 @@ function ReedSolomonDecoder(field)
 				received[position] = GF256.addOrSubtract(received[position], errorMagnitudes[i]);
 			}
 	}
-
+	
 	this.runEuclideanAlgorithm=function( a,  b,  R)
 		{
 			// Assume a's degree is >= b's
@@ -1478,14 +1478,14 @@ function ReedSolomonDecoder(field)
 				a = b;
 				b = temp;
 			}
-
+			
 			var rLast = a;
 			var r = b;
 			var sLast = this.field.One;
 			var s = this.field.Zero;
 			var tLast = this.field.Zero;
 			var t = this.field.One;
-
+			
 			// Run Euclidean algorithm until r's degree is less than R/2
 			while (r.Degree >= Math.floor(R / 2))
 			{
@@ -1495,7 +1495,7 @@ function ReedSolomonDecoder(field)
 				rLast = r;
 				sLast = s;
 				tLast = t;
-
+				
 				// Divide rLastLast by rLast, with quotient in q and remainder in r
 				if (rLast.Zero)
 				{
@@ -1514,17 +1514,17 @@ function ReedSolomonDecoder(field)
 					r = r.addOrSubtract(rLast.multiplyByMonomial(degreeDiff, scale));
 					//r.EXE();
 				}
-
+				
 				s = q.multiply1(sLast).addOrSubtract(sLastLast);
 				t = q.multiply1(tLast).addOrSubtract(tLastLast);
 			}
-
+			
 			var sigmaTildeAtZero = t.getCoefficient(0);
 			if (sigmaTildeAtZero == 0)
 			{
 				throw "ReedSolomonException sigmaTilde(0) was zero";
 			}
-
+			
 			var inverse = this.field.inverse(sigmaTildeAtZero);
 			var sigma = t.multiply2(inverse);
 			var omega = r.multiply2(inverse);
@@ -1614,7 +1614,7 @@ function GF256Poly(field,  coefficients)
 	{
 		this.coefficients = coefficients;
 	}
-
+	
 	this.__defineGetter__("Zero", function()
 	{
 		return this.coefficients[0] == 0;
@@ -1627,12 +1627,12 @@ function GF256Poly(field,  coefficients)
 	{
 		return this.coefficients;
 	});
-
+	
 	this.getCoefficient=function( degree)
 	{
 		return this.coefficients[this.coefficients.length - 1 - degree];
 	}
-
+	
 	this.evaluateAt=function( a)
 	{
 		if (a == 0)
@@ -1658,7 +1658,7 @@ function GF256Poly(field,  coefficients)
 		}
 		return result2;
 	}
-
+	
 	this.addOrSubtract=function( other)
 		{
 			if (this.field != other.field)
@@ -1673,7 +1673,7 @@ function GF256Poly(field,  coefficients)
 			{
 				return this;
 			}
-
+			
 			var smallerCoefficients = this.coefficients;
 			var largerCoefficients = other.coefficients;
 			if (smallerCoefficients.length > largerCoefficients.length)
@@ -1687,12 +1687,12 @@ function GF256Poly(field,  coefficients)
 			// Copy high-order terms only found in higher-degree polynomial's coefficients
 			//Array.Copy(largerCoefficients, 0, sumDiff, 0, lengthDiff);
 			for(var ci=0;ci<lengthDiff;ci++)sumDiff[ci]=largerCoefficients[ci];
-
+			
 			for (var i = lengthDiff; i < largerCoefficients.length; i++)
 			{
 				sumDiff[i] = GF256.addOrSubtract(smallerCoefficients[i - lengthDiff], largerCoefficients[i]);
 			}
-
+			
 			return new GF256Poly(field, sumDiff);
 	}
 	this.multiply1=function( other)
@@ -1767,13 +1767,13 @@ function GF256Poly(field,  coefficients)
 			{
 				throw "Divide by 0";
 			}
-
+			
 			var quotient = this.field.Zero;
 			var remainder = this;
-
+			
 			var denominatorLeadingTerm = other.getCoefficient(other.Degree);
 			var inverseDenominatorLeadingTerm = this.field.inverse(denominatorLeadingTerm);
-
+			
 			while (remainder.Degree >= other.Degree && !remainder.Zero)
 			{
 				var degreeDifference = remainder.Degree - other.Degree;
@@ -1783,7 +1783,7 @@ function GF256Poly(field,  coefficients)
 				quotient = quotient.addOrSubtract(iterationQuotient);
 				remainder = remainder.addOrSubtract(term);
 			}
-
+			
 			return new Array(quotient, remainder);
 		}
 }
@@ -1811,7 +1811,7 @@ function GF256( primitive)
 	this.zero = new GF256Poly(this, new Array(at0));
 	var at1=new Array(1);at1[0]=1;
 	this.one = new GF256Poly(this, new Array(at1));
-
+	
 	this.__defineGetter__("Zero", function()
 	{
 		return this.zero;
@@ -1870,7 +1870,7 @@ function GF256( primitive)
 				return a;
 			}
 			return this.expTable[(this.logTable[a] + this.logTable[b]) % 255];
-		}
+		}		
 }
 
 GF256.QR_CODE_FIELD = new GF256(0x011D);
@@ -1917,13 +1917,13 @@ Decoder.decode=function(bits)
 	var parser = new BitMatrixParser(bits);
 	var version = parser.readVersion();
 	var ecLevel = parser.readFormatInformation().ErrorCorrectionLevel;
-
+	
 	// Read codewords
 	var codewords = parser.readCodewords();
 
 	// Separate into data blocks
 	var dataBlocks = DataBlock.getDataBlocks(codewords, version, ecLevel);
-
+	
 	// Count total number of data bytes
 	var totalBytes = 0;
 	for (var i = 0; i < dataBlocks.length; i++)
@@ -1932,7 +1932,7 @@ Decoder.decode=function(bits)
 	}
 	var resultBytes = new Array(totalBytes);
 	var resultOffset = 0;
-
+	
 	// Error-correct and copy data blocks together into a stream of bytes
 	for (var j = 0; j < dataBlocks.length; j++)
 	{
@@ -1945,7 +1945,7 @@ Decoder.decode=function(bits)
 			resultBytes[resultOffset++] = codewordBytes[i];
 		}
 	}
-
+	
 	// Decode the contents of that stream of bytes
 	var reader = new QRCodeDataBlockReader(resultBytes, version.VersionNumber, ecLevel.Bits);
 	return reader;
@@ -1965,7 +1965,7 @@ qrcode.sizeOfDataLengthInfo =  [  [ 10, 9, 8, 8 ],  [ 12, 11, 16, 10 ],  [ 14, 1
 qrcode.callback = null;
 
 qrcode.decode = function(src){
-
+    
     if(arguments.length==0)
     {
         var canvas_qr = document.getElementById("qr-canvas");
@@ -1996,7 +1996,7 @@ qrcode.decode = function(src){
 
             canvas_qr.width = nwidth;
             canvas_qr.height = nheight;
-
+            
             context.drawImage(image, 0, 0, canvas_qr.width, canvas_qr.height );
             qrcode.width = canvas_qr.width;
             qrcode.height = canvas_qr.height;
@@ -2008,7 +2008,7 @@ qrcode.decode = function(src){
                     qrcode.callback(qrcode.result);
                 return;
             }
-
+            
             try
             {
                 qrcode.result = qrcode.process(context);
@@ -2063,12 +2063,12 @@ qrcode.decode_utf8 = function ( s )
 }
 
 qrcode.process = function(ctx){
-
+    
     var start = new Date().getTime();
 
     var image = qrcode.grayScaleToBitmap(qrcode.grayscale());
     //var image = qrcode.binarize(128);
-
+    
     if(qrcode.debug)
     {
         for (var y = 0; y < qrcode.height; y++)
@@ -2083,13 +2083,13 @@ qrcode.process = function(ctx){
         }
         ctx.putImageData(qrcode.imagedata, 0, 0);
     }
-
+    
     //var finderPatternInfo = new FinderPatternFinder().findFinderPattern(image);
-
+    
     var detector = new Detector(image);
 
     var qRCodeMatrix = detector.detect();
-
+    
     /*for (var y = 0; y < qRCodeMatrix.bits.Height; y++)
     {
         for (var x = 0; x < qRCodeMatrix.bits.Width; x++)
@@ -2102,7 +2102,7 @@ qrcode.process = function(ctx){
     }*/
     if(qrcode.debug)
         ctx.putImageData(qrcode.imagedata, 0, 0);
-
+    
     var reader = Decoder.decode(qRCodeMatrix.bits);
     var data = reader.DataByte;
     var str="";
@@ -2111,11 +2111,11 @@ qrcode.process = function(ctx){
         for(var j=0;j<data[i].length;j++)
             str+=String.fromCharCode(data[i][j]);
     }
-
+    
     var end = new Date().getTime();
     var time = end - start;
     console.log(time);
-
+    
     return qrcode.decode_utf8(str);
     //alert("Time:" + time + " Code: "+str);
 }
@@ -2139,7 +2139,7 @@ qrcode.binarize = function(th){
         for (var x = 0; x < qrcode.width; x++)
         {
             var gray = qrcode.getPixel(x, y);
-
+            
             ret[x+y*qrcode.width] = gray<=th?true:false;
         }
     }
@@ -2195,7 +2195,7 @@ qrcode.getMiddleBrightnessPerArea=function(image)
         //Console.out.println("");
     }
     //Console.out.println("");
-
+    
     return middle;
 }
 
@@ -2206,7 +2206,7 @@ qrcode.grayScaleToBitmap=function(grayScale)
     var areaWidth = Math.floor(qrcode.width / sqrtNumArea);
     var areaHeight = Math.floor(qrcode.height / sqrtNumArea);
     var bitmap = new Array(qrcode.height*qrcode.width);
-
+    
     for (var ay = 0; ay < sqrtNumArea; ay++)
     {
         for (var ax = 0; ax < sqrtNumArea; ax++)
@@ -2230,7 +2230,7 @@ qrcode.grayscale = function(){
         for (var x = 0; x < qrcode.width; x++)
         {
             var gray = qrcode.getPixel(x, y);
-
+            
             ret[x+y*qrcode.width] = gray;
         }
     }
@@ -2262,14 +2262,14 @@ var CENTER_QUORUM = 2;
 
 qrcode.orderBestPatterns=function(patterns)
 		{
-
+			
 			function distance( pattern1,  pattern2)
 			{
 				xDiff = pattern1.X - pattern2.X;
 				yDiff = pattern1.Y - pattern2.Y;
 				return  Math.sqrt( (xDiff * xDiff + yDiff * yDiff));
 			}
-
+			
 			/// <summary> Returns the z component of the cross product between vectors BC and BA.</summary>
 			function crossProductZ( pointA,  pointB,  pointC)
 			{
@@ -2278,12 +2278,12 @@ qrcode.orderBestPatterns=function(patterns)
 				return ((pointC.x - bX) * (pointA.y - bY)) - ((pointC.y - bY) * (pointA.x - bX));
 			}
 
-
+			
 			// Find distances between pattern centers
 			var zeroOneDistance = distance(patterns[0], patterns[1]);
 			var oneTwoDistance = distance(patterns[1], patterns[2]);
 			var zeroTwoDistance = distance(patterns[0], patterns[2]);
-
+			
 			var pointA, pointB, pointC;
 			// Assume one closest to other two is B; A and C will just be guesses at first
 			if (oneTwoDistance >= zeroOneDistance && oneTwoDistance >= zeroTwoDistance)
@@ -2304,7 +2304,7 @@ qrcode.orderBestPatterns=function(patterns)
 				pointA = patterns[0];
 				pointC = patterns[1];
 			}
-
+			
 			// Use cross product to figure out whether A and C are correct or flipped.
 			// This asks whether BC x BA has a positive z component, which is the arrangement
 			// we want for A, B, C. If it's negative, then we've got it flipped around and
@@ -2315,7 +2315,7 @@ qrcode.orderBestPatterns=function(patterns)
 				pointA = pointC;
 				pointC = temp;
 			}
-
+			
 			patterns[0] = pointA;
 			patterns[1] = pointB;
 			patterns[2] = pointC;
@@ -2328,11 +2328,11 @@ function FinderPattern(posX, posY,  estimatedModuleSize)
 	this.y=posY;
 	this.count = 1;
 	this.estimatedModuleSize = estimatedModuleSize;
-
+	
 	this.__defineGetter__("EstimatedModuleSize", function()
 	{
 		return this.estimatedModuleSize;
-	});
+	}); 
 	this.__defineGetter__("Count", function()
 	{
 		return this.count;
@@ -2358,7 +2358,7 @@ function FinderPattern(posX, posY,  estimatedModuleSize)
 			}
 			return false;
 		}
-
+	
 }
 
 function FinderPatternInfo(patternCenters)
@@ -2369,15 +2369,15 @@ function FinderPatternInfo(patternCenters)
 	this.__defineGetter__("BottomLeft", function()
 	{
 		return this.bottomLeft;
-	});
+	}); 
 	this.__defineGetter__("TopLeft", function()
 	{
 		return this.topLeft;
-	});
+	}); 
 	this.__defineGetter__("TopRight", function()
 	{
 		return this.topRight;
-	});
+	}); 
 }
 
 function FinderPatternFinder()
@@ -2387,7 +2387,7 @@ function FinderPatternFinder()
 	this.hasSkipped = false;
 	this.crossCheckStateCount = new Array(0,0,0,0,0);
 	this.resultPointCallback = null;
-
+	
 	this.__defineGetter__("CrossCheckStateCount", function()
 	{
 		this.crossCheckStateCount[0] = 0;
@@ -2396,8 +2396,8 @@ function FinderPatternFinder()
 		this.crossCheckStateCount[3] = 0;
 		this.crossCheckStateCount[4] = 0;
 		return this.crossCheckStateCount;
-	});
-
+	}); 
+	
 	this.foundPatternCross=function( stateCount)
 		{
 			var totalModuleSize = 0;
@@ -2426,10 +2426,10 @@ function FinderPatternFinder()
 	this.crossCheckVertical=function( startI,  centerJ,  maxCount,  originalStateCountTotal)
 		{
 			var image = this.image;
-
+			
 			var maxI = qrcode.height;
 			var stateCount = this.CrossCheckStateCount;
-
+			
 			// Start counting up from center
 			var i = startI;
 			while (i >= 0 && image[centerJ + i*qrcode.width])
@@ -2460,7 +2460,7 @@ function FinderPatternFinder()
 			{
 				return NaN;
 			}
-
+			
 			// Now also count down from center
 			i = startI + 1;
 			while (i < maxI && image[centerJ +i*qrcode.width])
@@ -2490,7 +2490,7 @@ function FinderPatternFinder()
 			{
 				return NaN;
 			}
-
+			
 			// If we found a finder-pattern-like section, but its size is more than 40% different than
 			// the original, assume it's a false positive
 			var stateCountTotal = stateCount[0] + stateCount[1] + stateCount[2] + stateCount[3] + stateCount[4];
@@ -2498,16 +2498,16 @@ function FinderPatternFinder()
 			{
 				return NaN;
 			}
-
+			
 			return this.foundPatternCross(stateCount)?this.centerFromEnd(stateCount, i):NaN;
 		}
 	this.crossCheckHorizontal=function( startJ,  centerI,  maxCount, originalStateCountTotal)
 		{
 			var image = this.image;
-
+			
 			var maxJ = qrcode.width;
 			var stateCount = this.CrossCheckStateCount;
-
+			
 			var j = startJ;
 			while (j >= 0 && image[j+ centerI*qrcode.width])
 			{
@@ -2536,7 +2536,7 @@ function FinderPatternFinder()
 			{
 				return NaN;
 			}
-
+			
 			j = startJ + 1;
 			while (j < maxJ && image[j+ centerI*qrcode.width])
 			{
@@ -2565,7 +2565,7 @@ function FinderPatternFinder()
 			{
 				return NaN;
 			}
-
+			
 			// If we found a finder-pattern-like section, but its size is significantly different than
 			// the original, assume it's a false positive
 			var stateCountTotal = stateCount[0] + stateCount[1] + stateCount[2] + stateCount[3] + stateCount[4];
@@ -2573,7 +2573,7 @@ function FinderPatternFinder()
 			{
 				return NaN;
 			}
-
+			
 			return this.foundPatternCross(stateCount)?this.centerFromEnd(stateCount, j):NaN;
 		}
 	this.handlePossibleCenter=function( stateCount,  i,  j)
@@ -2615,17 +2615,17 @@ function FinderPatternFinder()
 			}
 			return false;
 		}
-
+		
 	this.selectBestPatterns=function()
 		{
-
+			
 			var startSize = this.possibleCenters.length;
 			if (startSize < 3)
 			{
 				// Couldn't find enough finder patterns
 				throw "Couldn't find enough finder patterns";
 			}
-
+			
 			// Filter outlier possibilities whose module size is too different
 			if (startSize > 3)
 			{
@@ -2665,7 +2665,7 @@ function FinderPatternFinder()
 					}
 				}
 			}
-
+			
 			if (this.possibleCenters.length > 3)
 			{
 				// Throw away all but those first size candidate points we found.
@@ -2675,10 +2675,10 @@ function FinderPatternFinder()
 					return 0;
 				});
 			}
-
+			
 			return new Array( this.possibleCenters[0],  this.possibleCenters[1],  this.possibleCenters[2]);
 		}
-
+		
 	this.findRowSkip=function()
 		{
 			var max = this.possibleCenters.length;
@@ -2710,7 +2710,7 @@ function FinderPatternFinder()
 			}
 			return 0;
 		}
-
+	
 	this.haveMultiplyConfirmedCenters=function()
 		{
 			var confirmedCount = 0;
@@ -2742,7 +2742,7 @@ function FinderPatternFinder()
 			}
 			return totalDeviation <= 0.05 * totalModuleSize;
 		}
-
+		
 	this.findFinderPattern = function(image){
 		var tryHarder = false;
 		this.image=image;
@@ -2753,7 +2753,7 @@ function FinderPatternFinder()
 		{
 				iSkip = MIN_SKIP;
 		}
-
+		
 		var done = false;
 		var stateCount = new Array(5);
 		for (var i = iSkip - 1; i < maxI && !done; i += iSkip)
@@ -2808,7 +2808,7 @@ function FinderPatternFinder()
 											// and top of presumed third confirmed center
 											// but back up a bit to get a full chance of detecting
 											// it, entire width of center of finder pattern
-
+											
 											// Skip by rowSkip, but back off by stateCount[2] (size of last center
 											// of pattern we saw) to be conservative, and also back off by iSkip which
 											// is about to be re-added
@@ -2820,7 +2820,7 @@ function FinderPatternFinder()
 								else
 								{
 									// Advance to next black pixel
-									do
+									do 
 									{
 										j++;
 									}
@@ -2872,10 +2872,10 @@ function FinderPatternFinder()
 				}
 			}
 		}
-
+		
 		var patternInfo = this.selectBestPatterns();
 		qrcode.orderBestPatterns(patternInfo);
-
+		
 		return new FinderPatternInfo(patternInfo);
 	};
 }
@@ -2886,11 +2886,11 @@ function AlignmentPattern(posX, posY,  estimatedModuleSize)
 	this.y=posY;
 	this.count = 1;
 	this.estimatedModuleSize = estimatedModuleSize;
-
+	
 	this.__defineGetter__("EstimatedModuleSize", function()
 	{
 		return this.estimatedModuleSize;
-	});
+	}); 
 	this.__defineGetter__("Count", function()
 	{
 		return this.count;
@@ -2916,7 +2916,7 @@ function AlignmentPattern(posX, posY,  estimatedModuleSize)
 			}
 			return false;
 		}
-
+	
 }
 
 function AlignmentPatternFinder( image,  startX,  startY,  width,  height,  moduleSize,  resultPointCallback)
@@ -2930,7 +2930,7 @@ function AlignmentPatternFinder( image,  startX,  startY,  width,  height,  modu
 	this.moduleSize = moduleSize;
 	this.crossCheckStateCount = new Array(0,0,0);
 	this.resultPointCallback = resultPointCallback;
-
+	
 	this.centerFromEnd=function(stateCount,  end)
 		{
 			return  (end - stateCount[2]) - stateCount[1] / 2.0;
@@ -2952,13 +2952,13 @@ function AlignmentPatternFinder( image,  startX,  startY,  width,  height,  modu
 	this.crossCheckVertical=function( startI,  centerJ,  maxCount,  originalStateCountTotal)
 		{
 			var image = this.image;
-
+			
 			var maxI = qrcode.height;
 			var stateCount = this.crossCheckStateCount;
 			stateCount[0] = 0;
 			stateCount[1] = 0;
 			stateCount[2] = 0;
-
+			
 			// Start counting up from center
 			var i = startI;
 			while (i >= 0 && image[centerJ + i*qrcode.width] && stateCount[1] <= maxCount)
@@ -2980,7 +2980,7 @@ function AlignmentPatternFinder( image,  startX,  startY,  width,  height,  modu
 			{
 				return NaN;
 			}
-
+			
 			// Now also count down from center
 			i = startI + 1;
 			while (i < maxI && image[centerJ + i*qrcode.width] && stateCount[1] <= maxCount)
@@ -3001,16 +3001,16 @@ function AlignmentPatternFinder( image,  startX,  startY,  width,  height,  modu
 			{
 				return NaN;
 			}
-
+			
 			var stateCountTotal = stateCount[0] + stateCount[1] + stateCount[2];
 			if (5 * Math.abs(stateCountTotal - originalStateCountTotal) >= 2 * originalStateCountTotal)
 			{
 				return NaN;
 			}
-
+			
 			return this.foundPatternCross(stateCount)?this.centerFromEnd(stateCount, i):NaN;
 		}
-
+		
 	this.handlePossibleCenter=function( stateCount,  i,  j)
 		{
 			var stateCountTotal = stateCount[0] + stateCount[1] + stateCount[2];
@@ -3039,7 +3039,7 @@ function AlignmentPatternFinder( image,  startX,  startY,  width,  height,  modu
 			}
 			return null;
 		}
-
+		
 	this.find = function()
 	{
 			var startX = this.startX;
@@ -3122,17 +3122,17 @@ function AlignmentPatternFinder( image,  startX,  startY,  width,  height,  modu
 					}
 				}
 			}
-
+			
 			// Hmm, nothing we saw was observed and confirmed twice. If we had
 			// any guess at all, return it.
 			if (!(this.possibleCenters.length == 0))
 			{
 				return  this.possibleCenters[0];
 			}
-
+			
 			throw "Couldn't find enough alignment patterns";
 		}
-
+	
 }
 
 function QRCodeDataBlockReader(blocks,  version,  numErrorCorrectionCode)
@@ -3148,9 +3148,9 @@ function QRCodeDataBlockReader(blocks,  version,  numErrorCorrectionCode)
 		this.dataLengthMode = 1;
 	else if (version >= 27 && version <= 40)
 		this.dataLengthMode = 2;
-
+		
 	this.getNextBits = function( numBits)
-		{
+		{			
 			var bits = 0;
 			if (numBits < this.bitPointer + 1)
 			{
@@ -3161,7 +3161,7 @@ function QRCodeDataBlockReader(blocks,  version,  numErrorCorrectionCode)
 					mask += (1 << i);
 				}
 				mask <<= (this.bitPointer - numBits + 1);
-
+				
 				bits = (this.blocks[this.blockPointer] & mask) >> (this.bitPointer - numBits + 1);
 				this.bitPointer -= numBits;
 				return bits;
@@ -3177,7 +3177,7 @@ function QRCodeDataBlockReader(blocks,  version,  numErrorCorrectionCode)
 				bits = (this.blocks[this.blockPointer] & mask1) << (numBits - (this.bitPointer + 1));
                 this.blockPointer++;
 				bits += ((this.blocks[this.blockPointer]) >> (8 - (numBits - (this.bitPointer + 1))));
-
+				
 				this.bitPointer = this.bitPointer - numBits % 8;
 				if (this.bitPointer < 0)
 				{
@@ -3192,24 +3192,24 @@ function QRCodeDataBlockReader(blocks,  version,  numErrorCorrectionCode)
 				var mask3 = 0; // mask of 3rd block
 				//bitPointer + 1 : number of bits of the 1st block
 				//8 : number of the 2nd block (note that use already 8bits because next word uses 3 data blocks)
-				//numBits - (bitPointer + 1 + 8) : number of bits of the 3rd block
+				//numBits - (bitPointer + 1 + 8) : number of bits of the 3rd block 
 				for (var i = 0; i < this.bitPointer + 1; i++)
 				{
 					mask1 += (1 << i);
 				}
 				var bitsFirstBlock = (this.blocks[this.blockPointer] & mask1) << (numBits - (this.bitPointer + 1));
 				this.blockPointer++;
-
+				
 				var bitsSecondBlock = this.blocks[this.blockPointer] << (numBits - (this.bitPointer + 1 + 8));
 				this.blockPointer++;
-
+				
 				for (var i = 0; i < numBits - (this.bitPointer + 1 + 8); i++)
 				{
 					mask3 += (1 << i);
 				}
 				mask3 <<= 8 - (numBits - (this.bitPointer + 1 + 8));
 				var bitsThirdBlock = (this.blocks[this.blockPointer] & mask3) >> (8 - (numBits - (this.bitPointer + 1 + 8)));
-
+				
 				bits = bitsFirstBlock + bitsSecondBlock + bitsThirdBlock;
 				this.bitPointer = this.bitPointer - (numBits - 8) % 8;
 				if (this.bitPointer < 0)
@@ -3239,7 +3239,7 @@ function QRCodeDataBlockReader(blocks,  version,  numErrorCorrectionCode)
 					break;
 				index++;
 			}
-
+			
 			return this.getNextBits(qrcode.sizeOfDataLengthInfo[this.dataLengthMode][index]);
 		}
 	this.getRomanAndFigureString=function( dataLength)
@@ -3248,7 +3248,7 @@ function QRCodeDataBlockReader(blocks,  version,  numErrorCorrectionCode)
 			var intData = 0;
 			var strData = "";
 			var tableRomanAndFigure = new Array('0', '1', '2', '3', '4', '5', '6', '7', '8', '9', 'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J', 'K', 'L', 'M', 'N', 'O', 'P', 'Q', 'R', 'S', 'T', 'U', 'V', 'W', 'X', 'Y', 'Z', ' ', unescape('%24'), '%', '*', '+', '-', '.', '/', ':');
-			do
+			do 
 			{
 				if (length > 1)
 				{
@@ -3267,7 +3267,7 @@ function QRCodeDataBlockReader(blocks,  version,  numErrorCorrectionCode)
 				}
 			}
 			while (length > 0);
-
+			
 			return strData;
 		}
 	this.getFigureString=function( dataLength)
@@ -3275,7 +3275,7 @@ function QRCodeDataBlockReader(blocks,  version,  numErrorCorrectionCode)
 			var length = dataLength;
 			var intData = 0;
 			var strData = "";
-			do
+			do 
 			{
 				if (length >= 3)
 				{
@@ -3301,7 +3301,7 @@ function QRCodeDataBlockReader(blocks,  version,  numErrorCorrectionCode)
 				strData += intData;
 			}
 			while (length > 0);
-
+			
 			return strData;
 		}
 	this.get8bitByteArray=function( dataLength)
@@ -3309,8 +3309,8 @@ function QRCodeDataBlockReader(blocks,  version,  numErrorCorrectionCode)
 			var length = dataLength;
 			var intData = 0;
 			var output = new Array();
-
-			do
+			
+			do 
 			{
 				intData = this.getNextBits(8);
 				output.push( intData);
@@ -3324,12 +3324,12 @@ function QRCodeDataBlockReader(blocks,  version,  numErrorCorrectionCode)
 			var length = dataLength;
 			var intData = 0;
 			var unicodeString = "";
-			do
+			do 
 			{
 				intData = getNextBits(13);
 				var lowerByte = intData % 0xC0;
 				var higherByte = intData / 0xC0;
-
+				
 				var tempWord = (higherByte << 8) + lowerByte;
 				var shiftjisWord = 0;
 				if (tempWord + 0x8140 <= 0x9FFC)
@@ -3342,7 +3342,7 @@ function QRCodeDataBlockReader(blocks,  version,  numErrorCorrectionCode)
 					// between E040 - EBBF on Shift_JIS character set
 					shiftjisWord = tempWord + 0xC140;
 				}
-
+				
 				//var tempByte = new Array(0,0);
 				//tempByte[0] = (sbyte) (shiftjisWord >> 8);
 				//tempByte[1] = (sbyte) (shiftjisWord & 0xFF);
@@ -3351,8 +3351,8 @@ function QRCodeDataBlockReader(blocks,  version,  numErrorCorrectionCode)
 				length--;
 			}
 			while (length > 0);
-
-
+			
+			
 			return unicodeString;
 		}
 
@@ -3363,7 +3363,7 @@ function QRCodeDataBlockReader(blocks,  version,  numErrorCorrectionCode)
 	    var MODE_ROMAN_AND_NUMBER = 2;
 	    var MODE_8BIT_BYTE = 4;
 	    var MODE_KANJI = 8;
-		do
+		do 
 					{
 						var mode = this.NextMode();
 						//canvas.println("mode: " + mode);
@@ -3390,8 +3390,8 @@ function QRCodeDataBlockReader(blocks,  version,  numErrorCorrectionCode)
 						//canvas.println("length: " + dataLength);
 						switch (mode)
 						{
-
-							case MODE_NUMBER:
+							
+							case MODE_NUMBER: 
 								//canvas.println("Mode: Figure");
 								var temp_str = this.getFigureString(dataLength);
 								var ta = new Array(temp_str.length);
@@ -3399,8 +3399,8 @@ function QRCodeDataBlockReader(blocks,  version,  numErrorCorrectionCode)
 									ta[j]=temp_str.charCodeAt(j);
 								output.push(ta);
 								break;
-
-							case MODE_ROMAN_AND_NUMBER:
+							
+							case MODE_ROMAN_AND_NUMBER: 
 								//canvas.println("Mode: Roman&Figure");
 								var temp_str = this.getRomanAndFigureString(dataLength);
 								var ta = new Array(temp_str.length);
@@ -3409,16 +3409,16 @@ function QRCodeDataBlockReader(blocks,  version,  numErrorCorrectionCode)
 								output.push(ta );
 								//output.Write(SystemUtils.ToByteArray(temp_sbyteArray2), 0, temp_sbyteArray2.Length);
 								break;
-
-							case MODE_8BIT_BYTE:
+							
+							case MODE_8BIT_BYTE: 
 								//canvas.println("Mode: 8bit Byte");
 								//sbyte[] temp_sbyteArray3;
 								var temp_sbyteArray3 = this.get8bitByteArray(dataLength);
 								output.push(temp_sbyteArray3);
 								//output.Write(SystemUtils.ToByteArray(temp_sbyteArray3), 0, temp_sbyteArray3.Length);
 								break;
-
-							case MODE_KANJI:
+							
+							case MODE_KANJI: 
 								//canvas.println("Mode: Kanji");
 								//sbyte[] temp_sbyteArray4;
 								//temp_sbyteArray4 = SystemUtils.ToSByteArray(SystemUtils.ToByteArray(getKanjiString(dataLength)));
@@ -3427,7 +3427,7 @@ function QRCodeDataBlockReader(blocks,  version,  numErrorCorrectionCode)
 								output.push(temp_str);
 								break;
 							}
-						//
+						//			
 						//canvas.println("DataLength: " + dataLength);
 						//Console.out.println(dataString);
 					}
@@ -3488,7 +3488,7 @@ function QRCodeScanner(width, height, container, success, error) {
 			_video = document.getElementById(_id_video);
 
 			navigator.getUserMedia(
-				{video: true},
+				{video: true}, 
 				function(stream) {
 					_stream = stream;
 					_video.src = window.URL.createObjectURL(stream) || stream;
@@ -3497,7 +3497,7 @@ function QRCodeScanner(width, height, container, success, error) {
 						canvasInit();
 						_interval = setInterval(captureToCanvas, 500);
 					}, 250); // Needed to get videoWidth/videoHeight
-				},
+				}, 
 				function(error) {
 					_container.innerHTML = '';
 					_video = null;
diff --git a/src/ninja.bulkwallet.js b/src/ninja.bulkwallet.js
index 4360b5e..c9cb83a 100644
--- a/src/ninja.bulkwallet.js
+++ b/src/ninja.bulkwallet.js
@@ -43,8 +43,8 @@ ninja.wallets.bulkwallet = {
 			bulkWallet.csv.push((bulkWallet.csvRowLimit - bulkWallet.csvRowsRemaining + bulkWallet.csvStartIndex)
 								+ ",\"" + key.getBitcoinAddress() + "\",\"" + key.toString("wif")
 			//+	"\",\"" + key.toString("wifcomp")    // uncomment these lines to add different private key formats to the CSV
-			//+ "\",\"" + key.getBitcoinHexFormat()
-			//+ "\",\"" + key.toString("base64")
+			//+ "\",\"" + key.getBitcoinHexFormat() 
+			//+ "\",\"" + key.toString("base64") 
 								+ "\"");
 
 			document.getElementById("bulktextarea").value = ninja.translator.get("bulkgeneratingaddresses") + bulkWallet.csvRowsRemaining;
@@ -70,4 +70,4 @@ ninja.wallets.bulkwallet = {
 			document.getElementById("bulke" + faqNum).setAttribute("class", "less");
 		}
 	}
-};
+};
\ No newline at end of file
diff --git a/src/ninja.detailwallet.js b/src/ninja.detailwallet.js
index b26c5cb..9c30827 100644
--- a/src/ninja.detailwallet.js
+++ b/src/ninja.detailwallet.js
@@ -38,7 +38,7 @@ ninja.wallets.detailwallet = {
 		document.getElementById("detailarea").style.display = "block";
 		document.getElementById("detailprivkey").focus();
 		if (!ninja.wallets.detailwallet.qrscanner.scanner) {
-			ninja.wallets.detailwallet.qrscanner.scanner = new QRCodeScanner(320, 240, 'paperqroutput',
+			ninja.wallets.detailwallet.qrscanner.scanner = new QRCodeScanner(320, 240, 'paperqroutput', 
 				function(data) {
 					document.getElementById('detailprivkey').value = data;
 					document.getElementById('paperqrscanner').className = '';
@@ -183,4 +183,4 @@ ninja.wallets.detailwallet = {
 		document.getElementById("detailbip38commands").style.display = "none";
 		document.getElementById("detailbip38").style.display = "none";
 	}
-};
+};
\ No newline at end of file
diff --git a/src/ninja.donatetab.js b/src/ninja.donatetab.js
index d6c1a39..6a42ebb 100644
--- a/src/ninja.donatetab.js
+++ b/src/ninja.donatetab.js
@@ -6,13 +6,13 @@ ninja.wallets.donate = {
     close: function () {
         document.getElementById("donatearea").style.display = "none";
     },
-
+    
     displayQrCode: function (currencyid, e) {
         var keyValuePair = {};
     	keyValuePair["donateqrcode"] = janin.currencies[currencyid].donate;
 		ninja.qrCode.showQrCode(keyValuePair, 4);
-
+        
         document.getElementById("donateqrcode").style.display = "block";
         document.getElementById("donateqrcode").style.top = (e.offsetTop+15) + 'px';
     }
-};
+};
\ No newline at end of file
diff --git a/src/ninja.key.js b/src/ninja.key.js
index 90fc328..a1daff7 100644
--- a/src/ninja.key.js
+++ b/src/ninja.key.js
@@ -53,7 +53,7 @@ ninja.privateKey = {
 			callback(new Error(ninja.translator.get("detailalertnotvalidprivatekey")));
 			return;
 		}
-		// first byte is always 0x01
+		// first byte is always 0x01 
 		else if (hex[0] != 0x01) {
 			callback(new Error(ninja.translator.get("detailalertnotvalidprivatekey")));
 			return;
@@ -82,7 +82,7 @@ ninja.privateKey = {
 				return;
 			}
 		}
-		// second byte for EC-multiplied key
+		// second byte for EC-multiplied key 
 		else if (hex[1] == 0x43) {
 			isECMult = true;
 			isCompPoint = (hex[2] & 0x20) != 0;
@@ -347,4 +347,4 @@ ninja.publicKey = {
 		var pubHexUncompressed = ninja.publicKey.getHexFromByteArray(pubByteArray);
 		return pubHexUncompressed;
 	}
-};
+};
\ No newline at end of file
diff --git a/src/ninja.misc.js b/src/ninja.misc.js
index 2d6d6e7..78633c7 100644
--- a/src/ninja.misc.js
+++ b/src/ninja.misc.js
@@ -16,7 +16,7 @@
 		isDone: function() {
 			return ninja.seeder.seedCount >= ninja.seeder.seedLimit;
 		},
-
+		
 		// seed function exists to wait for mouse movement to add more entropy before generating an address
 		seed: function (evt) {
 			if (!evt) var evt = window.event;
@@ -76,7 +76,7 @@
 			div.setAttribute("class", "seedpoint");
 			div.style.top = y + "px";
 			div.style.left = x + "px";
-
+			
 			// let's make the entropy 'points' grow and change color!
 			percentageComplete = ninja.seeder.seedCount / ninja.seeder.seedLimit;
 			document.getElementById("progress-bar-percentage").style.width=Math.ceil(percentageComplete*100)+"%";
@@ -145,7 +145,7 @@ ninja.qrCode = {
 		return canvas;
 	},
 
-	// generate a QRCode and return it's representation as an Html table
+	// generate a QRCode and return it's representation as an Html table 
 	createTableHtml: function (text) {
 		var typeNumber = ninja.qrCode.getTypeNumber(text);
 		var qr = new QRCode(typeNumber, QRCode.ErrorCorrectLevel.H);
@@ -168,7 +168,7 @@ ninja.qrCode = {
 	},
 
 	// show QRCodes with canvas OR table (IE8)
-	// parameter: keyValuePair
+	// parameter: keyValuePair 
 	// example: { "id1": "string1", "id2": "string2"}
 	//		"id1" is the id of a div element where you want a QRCode inserted.
 	//		"string1" is the string you want encoded into the QRCode.
@@ -212,7 +212,7 @@ ninja.envSecurityCheck = function() {
 			innerHTML = '<span style="color: #009900;">' + ninja.translator.get("securitychecklistofflineOK") + '</span>';
 			break;
 		default:
-	}
+	} 
 	document.getElementById('envSecurityCheck').innerHTML = innerHTML;
 };
 
@@ -222,7 +222,7 @@ ninja.browserSecurityCheck = function() {
 		innerHTML = '<span style="color: #009900;">' + ninja.translator.get("securitychecklistrandomOK") + '</span>';
 	} else {
 		innerHTML = '<span style="color: #990000;">' + ninja.translator.get("securitychecklistrandomNOK") + '</span>';
-	}
+	} 
 	document.getElementById('browserSecurityCheck').innerHTML = innerHTML;
 }
 
@@ -271,4 +271,4 @@ ninja.foreachSerialized = function (collection, whatToDo, onComplete) {
 ninja.toggleFaqQuestion = function (elementId) {
 	var answerDiv = document.getElementById(elementId);
 	answerDiv.style.display = answerDiv.style.display == "block" ? "none" : "block";
-};
+};
\ No newline at end of file
diff --git a/src/ninja.onload.js b/src/ninja.onload.js
index 3ae2f7a..556cb69 100644
--- a/src/ninja.onload.js
+++ b/src/ninja.onload.js
@@ -78,9 +78,9 @@ if (ninja.getQueryString()["i18nextract"]) {
     elem.setAttribute("rows", "30");
     elem.setAttribute("style", "width: 99%");
     elem.setAttribute("wrap", "off");
-
-    a=document.getElementsByClassName("i18n");
-
+    
+    a=document.getElementsByClassName("i18n");    
+    
     var i18n = "\"" + culture + "\": {\n";
     for(x=0; x<a.length; x++) {
         i18n += "\t";
@@ -100,9 +100,9 @@ if (ninja.getQueryString()["i18nextract"]) {
             i18n += "(ENGLISH)" + cleani18n(ninja.translator.translations["en"][ninja.translator.staticID[x]]);
         i18n += "\",\n";
     }
-
+    
     i18n += "},"
-
+    
     elem.innerHTML = i18n;
     div.appendChild(elem);
     document.body.appendChild(div);
diff --git a/src/ninja.paperwallet.js b/src/ninja.paperwallet.js
index 8b3be3d..1871ec7 100644
--- a/src/ninja.paperwallet.js
+++ b/src/ninja.paperwallet.js
@@ -93,10 +93,10 @@ ninja.wallets.paperwallet = {
 			ninja.wallets.paperwallet.showArtisticWallet(idPostFix, bitcoinAddress, privateKeyWif);
 		}
 	},
-
+	
 	// Verify that a self-entered key is valid, and compute the corresponding
 	// public address, render the wallet.
-	testAndApplyVanityKey: function () {
+	testAndApplyVanityKey: function () { 
 		var suppliedKey = document.getElementById('suppliedPrivateKey').value;
 		suppliedKey = suppliedKey.trim(); // in case any spaces or whitespace got pasted in
 		document.getElementById('suppliedPrivateKey').value = suppliedKey;
@@ -139,11 +139,11 @@ ninja.wallets.paperwallet = {
 		var keyValuePair = {};
 		keyValuePair["qrcode_public" + idPostFix] = bitcoinAddress;
 		ninja.qrCode.showQrCode(keyValuePair, 3.5);
-
+		
         var keyValuePair = {};
         keyValuePair["qrcode_private" + idPostFix] = privateKey;
         ninja.qrCode.showQrCode(keyValuePair, 2.8);
-
+        
         document.getElementById("btcaddress" + idPostFix).innerHTML = bitcoinAddress;
 		document.getElementById("btcprivwif" + idPostFix).innerHTML = privateKey;
 	},
@@ -164,4 +164,4 @@ ninja.wallets.paperwallet = {
 			document.getElementById("paperkeyarea").style.fontSize = "95%";
 		}
 	}
-};
+};
\ No newline at end of file
diff --git a/src/ninja.translator.js b/src/ninja.translator.js
index d8c5c5a..2729543 100644
--- a/src/ninja.translator.js
+++ b/src/ninja.translator.js
@@ -40,7 +40,7 @@ ninja.translator = {
 		var translation = ninja.translator.translations[ninja.translator.currentCulture][id];
 		return translation;
 	},
-
+    
     staticID: [
         "defaultTitle",
         "title",
diff --git a/src/qrcode.js b/src/qrcode.js
index 1a7e0ae..21a311d 100644
--- a/src/qrcode.js
+++ b/src/qrcode.js
@@ -8,7 +8,7 @@
 // Licensed under the MIT license:
 //   http://www.opensource.org/licenses/mit-license.php
 //
-// The word "QR Code" is registered trademark of
+// The word "QR Code" is registered trademark of 
 // DENSO WAVE INCORPORATED
 //   http://www.denso-wave.com/qrcode/faqpatent-e.html
 //
@@ -222,7 +222,7 @@
 			var data = (this.errorCorrectLevel << 3) | maskPattern;
 			var bits = QRCode.Util.getBCHTypeInfo(data);
 
-			// vertical
+			// vertical		
 			for (var i = 0; i < 15; i++) {
 
 				var mod = (!test && ((bits >> i) & 1) == 1);
@@ -905,7 +905,7 @@
 	[2, 35, 17],
 	[2, 35, 13],
 
-	// 4
+	// 4		
 	[1, 100, 80],
 	[2, 50, 32],
 	[2, 50, 24],
@@ -923,7 +923,7 @@
 	[4, 43, 19],
 	[4, 43, 15],
 
-	// 7
+	// 7		
 	[2, 98, 78],
 	[4, 49, 31],
 	[2, 32, 14, 4, 33, 15],
@@ -941,7 +941,7 @@
 	[4, 36, 16, 4, 37, 17],
 	[4, 36, 12, 4, 37, 13],
 
-	// 10
+	// 10		
 	[2, 86, 68, 2, 87, 69],
 	[4, 69, 43, 1, 70, 44],
 	[6, 43, 19, 2, 44, 20],
@@ -1031,4 +1031,4 @@
 			this.length++;
 		}
 	};
-})();
+})();
\ No newline at end of file
diff --git a/src/securerandom.js b/src/securerandom.js
index cfb39e1..278450a 100644
--- a/src/securerandom.js
+++ b/src/securerandom.js
@@ -1,10 +1,10 @@
 /*!
 * Random number generator with ArcFour PRNG
-*
+* 
 * NOTE: For best results, put code like
 * <body onclick='SecureRandom.seedTime();' onkeypress='SecureRandom.seedTime();'>
 * in your main HTML document.
-*
+* 
 * Copyright Tom Wu, bitaddress.org  BSD License.
 * http://www-cs-students.stanford.edu/~tjw/jsbn/LICENSE
 */
@@ -56,7 +56,7 @@
 			alert("Premature initialisation of the random generator. Something is really wrong, do not generate wallets.");
 			return NaN;
 		}
-
+		
 		if (sr.state == null) {
 			sr.seedTime();
 			sr.state = sr.ArcFour(); // Plug in your RNG constructor here
@@ -184,4 +184,4 @@
 			sr.seedInt8(entropyBytes[i]);
 		}
 	}
-})();
+})();
\ No newline at end of file