diff --git a/web/lightning/index.html b/web/lightning/index.html
index e0bafba..7a37d15 100644
--- a/web/lightning/index.html
+++ b/web/lightning/index.html
@@ -5,7 +5,7 @@
   <meta name="viewport" content="width=device-width, initial-scale=1" />
   <meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
   <link href="style.css" rel="stylesheet" type="text/css"/>
-  <script src="qrcode.min.js"></script>
+  <script src="qrcodegen.min.js"></script>
 </head>
 <body onload="loadDoc()">
 <div class="tab">
@@ -14,20 +14,25 @@
 </div>
 <div id="channel" class="tabcontent" onclick="copyclipboard('textnode')">
    <p>Scan this QRCode to open a channel to my node. Click to copy to clipboard.</p>
-   <div id="qrnode" class="lnqrcode"></div>
+   <div class="lncontainer"><canvas id="qrnode" class="lnqrcode"></canvas></div>
    <textarea id="textnode" class="lntext" rows="2"></textarea>
 </div>
 <div id="invoice" class="tabcontent">
    <p>Scan or click this QRCode to start a payment.</p>
-   <div id="qrpayed" class="lnsettled">PAID<br/>Thank You</div>
-   <a id="qrlink" href="#"><div id="qrinvoice" class="lnqrcode"></div></a>
+   <div class="lncontainer">
+     <a id="qrlink" href="#"><canvas id="qrinvoice" class="lnqrcode"></canvas></a>
+     <div id="qrpayed" class="lnsettled">PAID<br/>Thank You</div>
+   </div>
    <textarea id="textinvoice" rows="5" class="lntext"></textarea>
-   <input type="button" value="Copy to Clipboard" 
+   <input type="button" value="Copy to Clipboard"
     onclick="copyclipboard('textinvoice')"/>
 </div>
 <script>
+  var border = 4;
+  var scale = 4;
   var uri = "0358327cb80ab2a8db36a5924c62966c7b4a753045600df594aa3863ecb618cc5d@37.221.198.57:9735";
-  new QRCode(document.getElementById("qrnode"), { "text": uri, "correctLevel": QRCode.CorrectLevel.L });
+  var qruri = qrcodegen.QrCode.encodeText(uri.toUpperCase(), qrcodegen.QrCode.Ecc.MEDIUM);
+  qruri.drawCanvas(scale, border, document.getElementById("qrnode"));
   document.getElementById("textnode").value = uri;
 
   function waitfor(rhash) {
@@ -56,9 +61,8 @@
     function handleInvoice(invoice) {
        rhash = invoice.r_hash;
        paymentrequest = invoice.payment_request;
-       qrcode = new QRCode(document.getElementById("qrinvoice"),
-         { "text": paymentrequest,
-           "correctLevel": QRCode.CorrectLevel.L });
+       var qrcode = qrcodegen.QrCode.encodeText(paymentrequest.toUpperCase(), qrcodegen.QrCode.Ecc.LOW);
+       qrcode.drawCanvas(scale, border, document.getElementById("qrinvoice"));
        document.getElementById("qrlink").href = "lightning:" + paymentrequest;
        document.getElementById("textinvoice").value = paymentrequest;
        waitfor(rhash);
diff --git a/web/lightning/qrcodegen.js b/web/lightning/qrcodegen.js
new file mode 100644
index 0000000..13d7abf
--- /dev/null
+++ b/web/lightning/qrcodegen.js
@@ -0,0 +1,982 @@
+/* 
+ * QR Code generator library (JavaScript)
+ * 
+ * Copyright (c) Project Nayuki. (MIT License)
+ * https://www.nayuki.io/page/qr-code-generator-library
+ * 
+ * Permission is hereby granted, free of charge, to any person obtaining a copy of
+ * this software and associated documentation files (the "Software"), to deal in
+ * the Software without restriction, including without limitation the rights to
+ * use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of
+ * the Software, and to permit persons to whom the Software is furnished to do so,
+ * subject to the following conditions:
+ * - The above copyright notice and this permission notice shall be included in
+ *   all copies or substantial portions of the Software.
+ * - The Software is provided "as is", without warranty of any kind, express or
+ *   implied, including but not limited to the warranties of merchantability,
+ *   fitness for a particular purpose and noninfringement. In no event shall the
+ *   authors or copyright holders be liable for any claim, damages or other
+ *   liability, whether in an action of contract, tort or otherwise, arising from,
+ *   out of or in connection with the Software or the use or other dealings in the
+ *   Software.
+ */
+
+"use strict";
+
+
+/* 
+ * Module "qrcodegen", public members:
+ * - Class QrCode:
+ *   - Function encodeText(str text, QrCode.Ecc ecl) -> QrCode
+ *   - Function encodeBinary(list<byte> data, QrCode.Ecc ecl) -> QrCode
+ *   - Function encodeSegments(list<QrSegment> segs, QrCode.Ecc ecl,
+ *         int minVersion=1, int maxVersion=40, mask=-1, boostEcl=true) -> QrCode
+ *   - Constants int MIN_VERSION, MAX_VERSION
+ *   - Constructor QrCode(list<int> datacodewords, int mask, int version, QrCode.Ecc ecl)
+ *   - Fields int version, size, mask
+ *   - Field QrCode.Ecc errorCorrectionLevel
+ *   - Method getModule(int x, int y) -> bool
+ *   - Method drawCanvas(int scale, int border, HTMLCanvasElement canvas) -> void
+ *   - Method toSvgString(int border) -> str
+ *   - Enum Ecc:
+ *     - Constants LOW, MEDIUM, QUARTILE, HIGH
+ *     - Field int ordinal
+ * - Class QrSegment:
+ *   - Function makeBytes(list<int> data) -> QrSegment
+ *   - Function makeNumeric(str data) -> QrSegment
+ *   - Function makeAlphanumeric(str data) -> QrSegment
+ *   - Function makeSegments(str text) -> list<QrSegment>
+ *   - Function makeEci(int assignVal) -> QrSegment
+ *   - Constructor QrSegment(QrSegment.Mode mode, int numChars, list<int> bitData)
+ *   - Field QrSegment.Mode mode
+ *   - Field int numChars
+ *   - Method getBits() -> list<int>
+ *   - Constants RegExp NUMERIC_REGEX, ALPHANUMERIC_REGEX
+ *   - Enum Mode:
+ *     - Constants NUMERIC, ALPHANUMERIC, BYTE, KANJI, ECI
+ */
+var qrcodegen = new function() {
+	
+	/*---- QR Code symbol class ----*/
+	
+	/* 
+	 * A class that represents an immutable square grid of black and white cells for a QR Code symbol,
+	 * with associated static functions to create a QR Code from user-supplied textual or binary data.
+	 * This class covers the QR Code model 2 specification, supporting all versions (sizes)
+	 * from 1 to 40, all 4 error correction levels.
+	 * This constructor creates a new QR Code symbol with the given version number, error correction level, binary data array,
+	 * and mask number. mask = -1 is for automatic choice, or 0 to 7 for fixed choice. This is a cumbersome low-level constructor
+	 * that should not be invoked directly by the user. To go one level up, see the QrCode.encodeSegments() function.
+	 */
+	this.QrCode = function(datacodewords, mask, version, errCorLvl) {
+		
+		/*---- Constructor ----*/
+		
+		// Check arguments and handle simple scalar fields
+		if (mask < -1 || mask > 7)
+			throw "Mask value out of range";
+		if (version < MIN_VERSION || version > MAX_VERSION)
+			throw "Version value out of range";
+		var size = version * 4 + 17;
+		
+		// Initialize both grids to be size*size arrays of Boolean false
+		var row = [];
+		for (var i = 0; i < size; i++)
+			row.push(false);
+		var modules = [];
+		var isFunction = [];
+		for (var i = 0; i < size; i++) {
+			modules.push(row.slice());
+			isFunction.push(row.slice());
+		}
+		
+		// Handle grid fields, draw function patterns, draw all codewords
+		drawFunctionPatterns();
+		var allCodewords = addEccAndInterleave(datacodewords);
+		drawCodewords(allCodewords);
+		
+		// Handle masking
+		if (mask == -1) {  // Automatically choose best mask
+			var minPenalty = Infinity;
+			for (var i = 0; i < 8; i++) {
+				drawFormatBits(i);
+				applyMask(i);
+				var penalty = getPenaltyScore();
+				if (penalty < minPenalty) {
+					mask = i;
+					minPenalty = penalty;
+				}
+				applyMask(i);  // Undoes the mask due to XOR
+			}
+		}
+		if (mask < 0 || mask > 7)
+			throw "Assertion error";
+		drawFormatBits(mask);  // Overwrite old format bits
+		applyMask(mask);  // Apply the final choice of mask
+		isFunction = null;
+		
+		
+		/*---- Read-only instance properties ----*/
+		
+		// This QR Code symbol's version number, which is always between 1 and 40 (inclusive).
+		Object.defineProperty(this, "version", {value:version});
+		
+		// The width and height of this QR Code symbol, measured in modules.
+		// Always equal to version * 4 + 17, in the range 21 to 177.
+		Object.defineProperty(this, "size", {value:size});
+		
+		// The error correction level used in this QR Code symbol.
+		Object.defineProperty(this, "errorCorrectionLevel", {value:errCorLvl});
+		
+		// The mask pattern used in this QR Code symbol, in the range 0 to 7 (i.e. unsigned 3-bit integer).
+		// Note that even if the constructor was called with automatic masking requested
+		// (mask = -1), the resulting object will still have a mask value between 0 and 7.
+		Object.defineProperty(this, "mask", {value:mask});
+		
+		
+		/*---- Accessor methods ----*/
+		
+		// (Public) Returns the color of the module (pixel) at the given coordinates, which is either
+		// false for white or true for black. The top left corner has the coordinates (x=0, y=0).
+		// If the given coordinates are out of bounds, then false (white) is returned.
+		this.getModule = function(x, y) {
+			return 0 <= x && x < size && 0 <= y && y < size && modules[y][x];
+		};
+		
+		
+		/*---- Public instance methods ----*/
+		
+		// Draws this QR Code symbol with the given module scale and number of modules onto the given HTML canvas element.
+		// The canvas will be resized to a width and height of (this.size + border * 2) * scale. The painted image will be purely
+		// black and white with no transparent regions. The scale must be a positive integer, and the border must be a non-negative integer.
+		this.drawCanvas = function(scale, border, canvas) {
+			if (scale <= 0 || border < 0)
+				throw "Value out of range";
+			var width = (size + border * 2) * scale;
+			canvas.width = width;
+			canvas.height = width;
+			var ctx = canvas.getContext("2d");
+			for (var y = -border; y < size + border; y++) {
+				for (var x = -border; x < size + border; x++) {
+					ctx.fillStyle = this.getModule(x, y) ? "#000000" : "#FFFFFF";
+					ctx.fillRect((x + border) * scale, (y + border) * scale, scale, scale);
+				}
+			}
+		};
+		
+		// Returns a string of SVG XML code representing an image of this QR Code symbol with the given
+		// number of border modules. Note that Unix newlines (\n) are always used, regardless of the platform.
+		this.toSvgString = function(border) {
+			if (border < 0)
+				throw "Border must be non-negative";
+			var parts = [];
+			for (var y = 0; y < size; y++) {
+				for (var x = 0; x < size; x++) {
+					if (this.getModule(x, y))
+						parts.push("M" + (x + border) + "," + (y + border) + "h1v1h-1z");
+				}
+			}
+			return '<?xml version="1.0" encoding="UTF-8"?>\n' +
+				'<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN" "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">\n' +
+				'<svg xmlns="http://www.w3.org/2000/svg" version="1.1" viewBox="0 0 ' +
+					(size + border * 2) + ' ' + (size + border * 2) + '" stroke="none">\n' +
+				'\t<rect width="100%" height="100%" fill="#FFFFFF"/>\n' +
+				'\t<path d="' + parts.join(" ") + '" fill="#000000"/>\n' +
+				'</svg>\n';
+		};
+		
+		
+		/*---- Private helper methods for constructor: Drawing function modules ----*/
+		
+		// Reads this object's version field, and draws and marks all function modules.
+		function drawFunctionPatterns() {
+			// Draw horizontal and vertical timing patterns
+			for (var i = 0; i < size; i++) {
+				setFunctionModule(6, i, i % 2 == 0);
+				setFunctionModule(i, 6, i % 2 == 0);
+			}
+			
+			// Draw 3 finder patterns (all corners except bottom right; overwrites some timing modules)
+			drawFinderPattern(3, 3);
+			drawFinderPattern(size - 4, 3);
+			drawFinderPattern(3, size - 4);
+			
+			// Draw numerous alignment patterns
+			var alignPatPos = getAlignmentPatternPositions();
+			var numAlign = alignPatPos.length;
+			for (var i = 0; i < numAlign; i++) {
+				for (var j = 0; j < numAlign; j++) {
+					// Don't draw on the three finder corners
+					if (!(i == 0 && j == 0 || i == 0 && j == numAlign - 1 || i == numAlign - 1 && j == 0))
+						drawAlignmentPattern(alignPatPos[i], alignPatPos[j]);
+				}
+			}
+			
+			// Draw configuration data
+			drawFormatBits(0);  // Dummy mask value; overwritten later in the constructor
+			drawVersion();
+		}
+		
+		
+		// Draws two copies of the format bits (with its own error correction code)
+		// based on the given mask and this object's error correction level field.
+		function drawFormatBits(mask) {
+			// Calculate error correction code and pack bits
+			var data = errCorLvl.formatBits << 3 | mask;  // errCorrLvl is uint2, mask is uint3
+			var rem = data;
+			for (var i = 0; i < 10; i++)
+				rem = (rem << 1) ^ ((rem >>> 9) * 0x537);
+			var bits = (data << 10 | rem) ^ 0x5412;  // uint15
+			if (bits >>> 15 != 0)
+				throw "Assertion error";
+			
+			// Draw first copy
+			for (var i = 0; i <= 5; i++)
+				setFunctionModule(8, i, getBit(bits, i));
+			setFunctionModule(8, 7, getBit(bits, 6));
+			setFunctionModule(8, 8, getBit(bits, 7));
+			setFunctionModule(7, 8, getBit(bits, 8));
+			for (var i = 9; i < 15; i++)
+				setFunctionModule(14 - i, 8, getBit(bits, i));
+			
+			// Draw second copy
+			for (var i = 0; i <= 7; i++)
+				setFunctionModule(size - 1 - i, 8, getBit(bits, i));
+			for (var i = 8; i < 15; i++)
+				setFunctionModule(8, size - 15 + i, getBit(bits, i));
+			setFunctionModule(8, size - 8, true);  // Always black
+		}
+		
+		
+		// Draws two copies of the version bits (with its own error correction code),
+		// based on this object's version field, iff 7 <= version <= 40.
+		function drawVersion() {
+			if (version < 7)
+				return;
+			
+			// Calculate error correction code and pack bits
+			var rem = version;  // version is uint6, in the range [7, 40]
+			for (var i = 0; i < 12; i++)
+				rem = (rem << 1) ^ ((rem >>> 11) * 0x1F25);
+			var bits = version << 12 | rem;  // uint18
+			if (bits >>> 18 != 0)
+				throw "Assertion error";
+			
+			// Draw two copies
+			for (var i = 0; i < 18; i++) {
+				var bit = getBit(bits, i);
+				var a = size - 11 + i % 3;
+				var b = Math.floor(i / 3);
+				setFunctionModule(a, b, bit);
+				setFunctionModule(b, a, bit);
+			}
+		}
+		
+		
+		// Draws a 9*9 finder pattern including the border separator,
+		// with the center module at (x, y). Modules can be out of bounds.
+		function drawFinderPattern(x, y) {
+			for (var dy = -4; dy <= 4; dy++) {
+				for (var dx = -4; dx <= 4; dx++) {
+					var dist = Math.max(Math.abs(dx), Math.abs(dy));  // Chebyshev/infinity norm
+					var xx = x + dx, yy = y + dy;
+					if (0 <= xx && xx < size && 0 <= yy && yy < size)
+						setFunctionModule(xx, yy, dist != 2 && dist != 4);
+				}
+			}
+		}
+		
+		
+		// Draws a 5*5 alignment pattern, with the center module
+		// at (x, y). All modules must be in bounds.
+		function drawAlignmentPattern(x, y) {
+			for (var dy = -2; dy <= 2; dy++) {
+				for (var dx = -2; dx <= 2; dx++)
+					setFunctionModule(x + dx, y + dy, Math.max(Math.abs(dx), Math.abs(dy)) != 1);
+			}
+		}
+		
+		
+		// Sets the color of a module and marks it as a function module.
+		// Only used by the constructor. Coordinates must be in bounds.
+		function setFunctionModule(x, y, isBlack) {
+			modules[y][x] = isBlack;
+			isFunction[y][x] = true;
+		}
+		
+		
+		/*---- Private helper methods for constructor: Codewords and masking ----*/
+		
+		// Returns a new byte string representing the given data with the appropriate error correction
+		// codewords appended to it, based on this object's version and error correction level.
+		function addEccAndInterleave(data) {
+			if (data.length != QrCode.getNumDataCodewords(version, errCorLvl))
+				throw "Invalid argument";
+			
+			// Calculate parameter numbers
+			var numBlocks = QrCode.NUM_ERROR_CORRECTION_BLOCKS[errCorLvl.ordinal][version];
+			var blockEccLen = QrCode.ECC_CODEWORDS_PER_BLOCK  [errCorLvl.ordinal][version];
+			var rawCodewords = Math.floor(QrCode.getNumRawDataModules(version) / 8);
+			var numShortBlocks = numBlocks - rawCodewords % numBlocks;
+			var shortBlockLen = Math.floor(rawCodewords / numBlocks);
+			
+			// Split data into blocks and append ECC to each block
+			var blocks = [];
+			var rs = new ReedSolomonGenerator(blockEccLen);
+			for (var i = 0, k = 0; i < numBlocks; i++) {
+				var dat = data.slice(k, k + shortBlockLen - blockEccLen + (i < numShortBlocks ? 0 : 1));
+				k += dat.length;
+				var ecc = rs.getRemainder(dat);
+				if (i < numShortBlocks)
+					dat.push(0);
+				blocks.push(dat.concat(ecc));
+			}
+			
+			// Interleave (not concatenate) the bytes from every block into a single sequence
+			var result = [];
+			for (var i = 0; i < blocks[0].length; i++) {
+				for (var j = 0; j < blocks.length; j++) {
+					// Skip the padding byte in short blocks
+					if (i != shortBlockLen - blockEccLen || j >= numShortBlocks)
+						result.push(blocks[j][i]);
+				}
+			}
+			if (result.length != rawCodewords)
+				throw "Assertion error";
+			return result;
+		}
+		
+		
+		// Draws the given sequence of 8-bit codewords (data and error correction) onto the entire
+		// data area of this QR Code symbol. Function modules need to be marked off before this is called.
+		function drawCodewords(data) {
+			if (data.length != Math.floor(QrCode.getNumRawDataModules(version) / 8))
+				throw "Invalid argument";
+			var i = 0;  // Bit index into the data
+			// Do the funny zigzag scan
+			for (var right = size - 1; right >= 1; right -= 2) {  // Index of right column in each column pair
+				if (right == 6)
+					right = 5;
+				for (var vert = 0; vert < size; vert++) {  // Vertical counter
+					for (var j = 0; j < 2; j++) {
+						var x = right - j;  // Actual x coordinate
+						var upward = ((right + 1) & 2) == 0;
+						var y = upward ? size - 1 - vert : vert;  // Actual y coordinate
+						if (!isFunction[y][x] && i < data.length * 8) {
+							modules[y][x] = getBit(data[i >>> 3], 7 - (i & 7));
+							i++;
+						}
+						// If this QR Code has any remainder bits (0 to 7), they were assigned as
+						// 0/false/white by the constructor and are left unchanged by this method
+					}
+				}
+			}
+			if (i != data.length * 8)
+				throw "Assertion error";
+		}
+		
+		
+		// XORs the codeword modules in this QR Code with the given mask pattern.
+		// The function modules must be marked and the codeword bits must be drawn
+		// before masking. Due to the arithmetic of XOR, calling applyMask() with
+		// the same mask value a second time will undo the mask. A final well-formed
+		// QR Code symbol needs exactly one (not zero, two, etc.) mask applied.
+		function applyMask(mask) {
+			if (mask < 0 || mask > 7)
+				throw "Mask value out of range";
+			for (var y = 0; y < size; y++) {
+				for (var x = 0; x < size; x++) {
+					var invert;
+					switch (mask) {
+						case 0:  invert = (x + y) % 2 == 0;                                  break;
+						case 1:  invert = y % 2 == 0;                                        break;
+						case 2:  invert = x % 3 == 0;                                        break;
+						case 3:  invert = (x + y) % 3 == 0;                                  break;
+						case 4:  invert = (Math.floor(x / 3) + Math.floor(y / 2)) % 2 == 0;  break;
+						case 5:  invert = x * y % 2 + x * y % 3 == 0;                        break;
+						case 6:  invert = (x * y % 2 + x * y % 3) % 2 == 0;                  break;
+						case 7:  invert = ((x + y) % 2 + x * y % 3) % 2 == 0;                break;
+						default:  throw "Assertion error";
+					}
+					if (!isFunction[y][x] && invert)
+						modules[y][x] = !modules[y][x];
+				}
+			}
+		}
+		
+		
+		// Calculates and returns the penalty score based on state of this QR Code's current modules.
+		// This is used by the automatic mask choice algorithm to find the mask pattern that yields the lowest score.
+		function getPenaltyScore() {
+			var result = 0;
+			
+			// Adjacent modules in row having same color
+			for (var y = 0; y < size; y++) {
+				for (var x = 0, runX, colorX; x < size; x++) {
+					if (x == 0 || modules[y][x] != colorX) {
+						colorX = modules[y][x];
+						runX = 1;
+					} else {
+						runX++;
+						if (runX == 5)
+							result += QrCode.PENALTY_N1;
+						else if (runX > 5)
+							result++;
+					}
+				}
+			}
+			// Adjacent modules in column having same color
+			for (var x = 0; x < size; x++) {
+				for (var y = 0, runY, colorY; y < size; y++) {
+					if (y == 0 || modules[y][x] != colorY) {
+						colorY = modules[y][x];
+						runY = 1;
+					} else {
+						runY++;
+						if (runY == 5)
+							result += QrCode.PENALTY_N1;
+						else if (runY > 5)
+							result++;
+					}
+				}
+			}
+			
+			// 2*2 blocks of modules having same color
+			for (var y = 0; y < size - 1; y++) {
+				for (var x = 0; x < size - 1; x++) {
+					var   color = modules[y][x];
+					if (  color == modules[y][x + 1] &&
+					      color == modules[y + 1][x] &&
+					      color == modules[y + 1][x + 1])
+						result += QrCode.PENALTY_N2;
+				}
+			}
+			
+			// Finder-like pattern in rows
+			for (var y = 0; y < size; y++) {
+				for (var x = 0, bits = 0; x < size; x++) {
+					bits = ((bits << 1) & 0x7FF) | (modules[y][x] ? 1 : 0);
+					if (x >= 10 && (bits == 0x05D || bits == 0x5D0))  // Needs 11 bits accumulated
+						result += QrCode.PENALTY_N3;
+				}
+			}
+			// Finder-like pattern in columns
+			for (var x = 0; x < size; x++) {
+				for (var y = 0, bits = 0; y < size; y++) {
+					bits = ((bits << 1) & 0x7FF) | (modules[y][x] ? 1 : 0);
+					if (y >= 10 && (bits == 0x05D || bits == 0x5D0))  // Needs 11 bits accumulated
+						result += QrCode.PENALTY_N3;
+				}
+			}
+			
+			// Balance of black and white modules
+			var black = 0;
+			modules.forEach(function(row) {
+				row.forEach(function(color) {
+					if (color)
+						black++;
+				});
+			});
+			var total = size * size;  // Note that size is odd, so black/total != 1/2
+			// Compute the smallest integer k >= 0 such that (45-5k)% <= black/total <= (55+5k)%
+			var k = Math.ceil(Math.abs(black * 20 - total * 10) / total) - 1;
+			result += k * QrCode.PENALTY_N4;
+			return result;
+		}
+		
+		
+		// Returns an ascending list of positions of alignment patterns for this version number.
+		// Each position is in the range [0,177), and are used on both the x and y axes.
+		// This could be implemented as lookup table of 40 variable-length lists of integers.
+		function getAlignmentPatternPositions() {
+			if (version == 1)
+				return [];
+			else {
+				var numAlign = Math.floor(version / 7) + 2;
+				var step = (version == 32) ? 26 :
+					Math.ceil((size - 13) / (numAlign*2 - 2)) * 2;
+				var result = [6];
+				for (var i = 0, pos = size - 7; i < numAlign - 1; i++, pos -= step)
+					result.splice(1, 0, pos);
+				return result;
+			}
+		}
+		
+		
+		// Returns true iff the i'th bit of x is set to 1.
+		function getBit(x, i) {
+			return ((x >>> i) & 1) != 0;
+		}
+	};
+	
+	
+	/*---- Public static factory functions for QrCode ----*/
+	
+	/* 
+	 * Returns a QR Code symbol representing the given Unicode text string at the given error correction level.
+	 * As a conservative upper bound, this function is guaranteed to succeed for strings that have 738 or fewer
+	 * Unicode code points (not UTF-16 code units) if the low error correction level is used. The smallest possible
+	 * QR Code version is automatically chosen for the output. The ECC level of the result may be higher than the
+	 * ecl argument if it can be done without increasing the version.
+	 */
+	this.QrCode.encodeText = function(text, ecl) {
+		var segs = qrcodegen.QrSegment.makeSegments(text);
+		return this.encodeSegments(segs, ecl);
+	};
+	
+	
+	/* 
+	 * Returns a QR Code symbol representing the given binary data string at the given error correction level.
+	 * This function always encodes using the binary segment mode, not any text mode. The maximum number of
+	 * bytes allowed is 2953. The smallest possible QR Code version is automatically chosen for the output.
+	 * The ECC level of the result may be higher than the ecl argument if it can be done without increasing the version.
+	 */
+	this.QrCode.encodeBinary = function(data, ecl) {
+		var seg = qrcodegen.QrSegment.makeBytes(data);
+		return this.encodeSegments([seg], ecl);
+	};
+	
+	
+	/* 
+	 * Returns a QR Code symbol representing the given segments with the given encoding parameters.
+	 * The smallest possible QR Code version within the given range is automatically chosen for the output.
+	 * This function allows the user to create a custom sequence of segments that switches
+	 * between modes (such as alphanumeric and binary) to encode text more efficiently.
+	 * This function is considered to be lower level than simply encoding text or binary data.
+	 */
+	this.QrCode.encodeSegments = function(segs, ecl, minVersion, maxVersion, mask, boostEcl) {
+		if (minVersion == undefined) minVersion = MIN_VERSION;
+		if (maxVersion == undefined) maxVersion = MAX_VERSION;
+		if (mask == undefined) mask = -1;
+		if (boostEcl == undefined) boostEcl = true;
+		if (!(MIN_VERSION <= minVersion && minVersion <= maxVersion && maxVersion <= MAX_VERSION) || mask < -1 || mask > 7)
+			throw "Invalid value";
+		
+		// Find the minimal version number to use
+		var version, dataUsedBits;
+		for (version = minVersion; ; version++) {
+			var dataCapacityBits = QrCode.getNumDataCodewords(version, ecl) * 8;  // Number of data bits available
+			dataUsedBits = qrcodegen.QrSegment.getTotalBits(segs, version);
+			if (dataUsedBits <= dataCapacityBits)
+				break;  // This version number is found to be suitable
+			if (version >= maxVersion)  // All versions in the range could not fit the given data
+				throw "Data too long";
+		}
+		
+		// Increase the error correction level while the data still fits in the current version number
+		[this.Ecc.MEDIUM, this.Ecc.QUARTILE, this.Ecc.HIGH].forEach(function(newEcl) {  // From low to high
+			if (boostEcl && dataUsedBits <= QrCode.getNumDataCodewords(version, newEcl) * 8)
+				ecl = newEcl;
+		});
+		
+		// Concatenate all segments to create the data bit string
+		var bb = new BitBuffer();
+		segs.forEach(function(seg) {
+			bb.appendBits(seg.mode.modeBits, 4);
+			bb.appendBits(seg.numChars, seg.mode.numCharCountBits(version));
+			seg.getBits().forEach(function(bit) {
+				bb.push(bit);
+			});
+		});
+		if (bb.length != dataUsedBits)
+			throw "Assertion error";
+		
+		// Add terminator and pad up to a byte if applicable
+		var dataCapacityBits = QrCode.getNumDataCodewords(version, ecl) * 8;
+		if (bb.length > dataCapacityBits)
+			throw "Assertion error";
+		bb.appendBits(0, Math.min(4, dataCapacityBits - bb.length));
+		bb.appendBits(0, (8 - bb.length % 8) % 8);
+		if (bb.length % 8 != 0)
+			throw "Assertion error";
+		
+		// Pad with alternating bytes until data capacity is reached
+		for (var padByte = 0xEC; bb.length < dataCapacityBits; padByte ^= 0xEC ^ 0x11)
+			bb.appendBits(padByte, 8);
+		
+		// Create the QR Code symbol
+		return new this(bb.getBytes(), mask, version, ecl);
+	};
+	
+	
+	/*---- Public constants for QrCode ----*/
+	
+	var MIN_VERSION =  1;
+	var MAX_VERSION = 40;
+	Object.defineProperty(this.QrCode, "MIN_VERSION", {value:MIN_VERSION});
+	Object.defineProperty(this.QrCode, "MAX_VERSION", {value:MAX_VERSION});
+	
+	
+	/*---- Private static helper functions for QrCode ----*/
+	
+	var QrCode = {};  // Private object to assign properties to. Not the same object as 'this.QrCode'.
+	
+	
+	// Returns the number of data bits that can be stored in a QR Code of the given version number, after
+	// all function modules are excluded. This includes remainder bits, so it might not be a multiple of 8.
+	// The result is in the range [208, 29648]. This could be implemented as a 40-entry lookup table.
+	QrCode.getNumRawDataModules = function(ver) {
+		if (ver < MIN_VERSION || ver > MAX_VERSION)
+			throw "Version number out of range";
+		var result = (16 * ver + 128) * ver + 64;
+		if (ver >= 2) {
+			var numAlign = Math.floor(ver / 7) + 2;
+			result -= (25 * numAlign - 10) * numAlign - 55;
+			if (ver >= 7)
+				result -= 36;
+		}
+		return result;
+	};
+	
+	
+	// Returns the number of 8-bit data (i.e. not error correction) codewords contained in any
+	// QR Code of the given version number and error correction level, with remainder bits discarded.
+	// This stateless pure function could be implemented as a (40*4)-cell lookup table.
+	QrCode.getNumDataCodewords = function(ver, ecl) {
+		return Math.floor(QrCode.getNumRawDataModules(ver) / 8) -
+			QrCode.ECC_CODEWORDS_PER_BLOCK    [ecl.ordinal][ver] *
+			QrCode.NUM_ERROR_CORRECTION_BLOCKS[ecl.ordinal][ver];
+	};
+	
+	
+	/*---- Private tables of constants for QrCode ----*/
+	
+	// For use in getPenaltyScore(), when evaluating which mask is best.
+	QrCode.PENALTY_N1 =  3;
+	QrCode.PENALTY_N2 =  3;
+	QrCode.PENALTY_N3 = 40;
+	QrCode.PENALTY_N4 = 10;
+	
+	QrCode.ECC_CODEWORDS_PER_BLOCK = [
+		// Version: (note that index 0 is for padding, and is set to an illegal value)
+		//  0,  1,  2,  3,  4,  5,  6,  7,  8,  9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40    Error correction level
+		[null,  7, 10, 15, 20, 26, 18, 20, 24, 30, 18, 20, 24, 26, 30, 22, 24, 28, 30, 28, 28, 28, 28, 30, 30, 26, 28, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30],  // Low
+		[null, 10, 16, 26, 18, 24, 16, 18, 22, 22, 26, 30, 22, 22, 24, 24, 28, 28, 26, 26, 26, 26, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28],  // Medium
+		[null, 13, 22, 18, 26, 18, 24, 18, 22, 20, 24, 28, 26, 24, 20, 30, 24, 28, 28, 26, 30, 28, 30, 30, 30, 30, 28, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30],  // Quartile
+		[null, 17, 28, 22, 16, 22, 28, 26, 26, 24, 28, 24, 28, 22, 24, 24, 30, 28, 28, 26, 28, 30, 24, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30],  // High
+	];
+	
+	QrCode.NUM_ERROR_CORRECTION_BLOCKS = [
+		// Version: (note that index 0 is for padding, and is set to an illegal value)
+		//  0, 1, 2, 3, 4, 5, 6, 7, 8, 9,10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40    Error correction level
+		[null, 1, 1, 1, 1, 1, 2, 2, 2, 2, 4,  4,  4,  4,  4,  6,  6,  6,  6,  7,  8,  8,  9,  9, 10, 12, 12, 12, 13, 14, 15, 16, 17, 18, 19, 19, 20, 21, 22, 24, 25],  // Low
+		[null, 1, 1, 1, 2, 2, 4, 4, 4, 5, 5,  5,  8,  9,  9, 10, 10, 11, 13, 14, 16, 17, 17, 18, 20, 21, 23, 25, 26, 28, 29, 31, 33, 35, 37, 38, 40, 43, 45, 47, 49],  // Medium
+		[null, 1, 1, 2, 2, 4, 4, 6, 6, 8, 8,  8, 10, 12, 16, 12, 17, 16, 18, 21, 20, 23, 23, 25, 27, 29, 34, 34, 35, 38, 40, 43, 45, 48, 51, 53, 56, 59, 62, 65, 68],  // Quartile
+		[null, 1, 1, 2, 4, 4, 4, 5, 6, 8, 8, 11, 11, 16, 16, 18, 16, 19, 21, 25, 25, 25, 34, 30, 32, 35, 37, 40, 42, 45, 48, 51, 54, 57, 60, 63, 66, 70, 74, 77, 81],  // High
+	];
+	
+	
+	/*---- Public helper enumeration ----*/
+	
+	/* 
+	 * Represents the error correction level used in a QR Code symbol.
+	 */
+	this.QrCode.Ecc = {
+		// Constants declared in ascending order of error protection
+		LOW     : new Ecc(0, 1),
+		MEDIUM  : new Ecc(1, 0),
+		QUARTILE: new Ecc(2, 3),
+		HIGH    : new Ecc(3, 2),
+	};
+	
+	
+	// Private constructor.
+	function Ecc(ord, fb) {
+		// (Public) In the range 0 to 3 (unsigned 2-bit integer)
+		Object.defineProperty(this, "ordinal", {value:ord});
+		
+		// (Package-private) In the range 0 to 3 (unsigned 2-bit integer)
+		Object.defineProperty(this, "formatBits", {value:fb});
+	}
+	
+	
+	
+	/*---- Data segment class ----*/
+	
+	/* 
+	 * Represents a segment of character data, binary data, or control data
+	 * to be put into a QR Code symbol. Instances of this class are immutable.
+	 * This segment class imposes no length restrictions, but QR Codes have restrictions.
+	 * Even in the most favorable conditions, a QR Code can only hold 7089 characters of data.
+	 * Any segment longer than this is meaningless for the purpose of generating QR Codes.
+	 */
+	this.QrSegment = function(mode, numChars, bitData) {
+		if (numChars < 0 || !(mode instanceof Mode))
+			throw "Invalid argument";
+		bitData = bitData.slice();  // Make defensive copy
+		
+		// The mode indicator for this segment.
+		Object.defineProperty(this, "mode", {value:mode});
+		
+		// The length of this segment's unencoded data, measured in characters. Always zero or positive.
+		Object.defineProperty(this, "numChars", {value:numChars});
+		
+		// Returns a copy of all bits, which is an array of 0s and 1s.
+		this.getBits = function() {
+			return bitData.slice();  // Make defensive copy
+		};
+	};
+	
+	
+	/*---- Public static factory functions for QrSegment ----*/
+	
+	/* 
+	 * Returns a segment representing the given binary data encoded in byte mode.
+	 */
+	this.QrSegment.makeBytes = function(data) {
+		var bb = new BitBuffer();
+		data.forEach(function(b) {
+			bb.appendBits(b, 8);
+		});
+		return new this(this.Mode.BYTE, data.length, bb);
+	};
+	
+	
+	/* 
+	 * Returns a segment representing the given string of decimal digits encoded in numeric mode.
+	 */
+	this.QrSegment.makeNumeric = function(digits) {
+		if (!this.NUMERIC_REGEX.test(digits))
+			throw "String contains non-numeric characters";
+		var bb = new BitBuffer();
+		for (var i = 0; i < digits.length; ) {  // Consume up to 3 digits per iteration
+			var n = Math.min(digits.length - i, 3);
+			bb.appendBits(parseInt(digits.substr(i, n), 10), n * 3 + 1);
+			i += n;
+		}
+		return new this(this.Mode.NUMERIC, digits.length, bb);
+	};
+	
+	
+	/* 
+	 * Returns a segment representing the given text string encoded in alphanumeric mode.
+	 * The characters allowed are: 0 to 9, A to Z (uppercase only), space,
+	 * dollar, percent, asterisk, plus, hyphen, period, slash, colon.
+	 */
+	this.QrSegment.makeAlphanumeric = function(text) {
+		if (!this.ALPHANUMERIC_REGEX.test(text))
+			throw "String contains unencodable characters in alphanumeric mode";
+		var bb = new BitBuffer();
+		var i;
+		for (i = 0; i + 2 <= text.length; i += 2) {  // Process groups of 2
+			var temp = QrSegment.ALPHANUMERIC_CHARSET.indexOf(text.charAt(i)) * 45;
+			temp += QrSegment.ALPHANUMERIC_CHARSET.indexOf(text.charAt(i + 1));
+			bb.appendBits(temp, 11);
+		}
+		if (i < text.length)  // 1 character remaining
+			bb.appendBits(QrSegment.ALPHANUMERIC_CHARSET.indexOf(text.charAt(i)), 6);
+		return new this(this.Mode.ALPHANUMERIC, text.length, bb);
+	};
+	
+	
+	/* 
+	 * Returns a new mutable list of zero or more segments to represent the given Unicode text string.
+	 * The result may use various segment modes and switch modes to optimize the length of the bit stream.
+	 */
+	this.QrSegment.makeSegments = function(text) {
+		// Select the most efficient segment encoding automatically
+		if (text == "")
+			return [];
+		else if (this.NUMERIC_REGEX.test(text))
+			return [this.makeNumeric(text)];
+		else if (this.ALPHANUMERIC_REGEX.test(text))
+			return [this.makeAlphanumeric(text)];
+		else
+			return [this.makeBytes(toUtf8ByteArray(text))];
+	};
+	
+	
+	/* 
+	 * Returns a segment representing an Extended Channel Interpretation
+	 * (ECI) designator with the given assignment value.
+	 */
+	this.QrSegment.makeEci = function(assignVal) {
+		var bb = new BitBuffer();
+		if (0 <= assignVal && assignVal < (1 << 7))
+			bb.appendBits(assignVal, 8);
+		else if ((1 << 7) <= assignVal && assignVal < (1 << 14)) {
+			bb.appendBits(2, 2);
+			bb.appendBits(assignVal, 14);
+		} else if ((1 << 14) <= assignVal && assignVal < 1000000) {
+			bb.appendBits(6, 3);
+			bb.appendBits(assignVal, 21);
+		} else
+			throw "ECI assignment value out of range";
+		return new this(this.Mode.ECI, 0, bb);
+	};
+	
+	
+	// (Package-private) Calculates and returns the number of bits needed to encode the given segments at the
+	// given version. The result is infinity if a segment has too many characters to fit its length field.
+	this.QrSegment.getTotalBits = function(segs, version) {
+		var result = 0;
+		for (var i = 0; i < segs.length; i++) {
+			var seg = segs[i];
+			var ccbits = seg.mode.numCharCountBits(version);
+			if (seg.numChars >= (1 << ccbits))
+				return Infinity;  // The segment's length doesn't fit the field's bit width
+			result += 4 + ccbits + seg.getBits().length;
+		}
+		return result;
+	};
+	
+	
+	/*---- Constants for QrSegment ----*/
+	
+	var QrSegment = {};  // Private object to assign properties to. Not the same object as 'this.QrSegment'.
+	
+	// (Public) Can test whether a string is encodable in numeric mode (such as by using QrSegment.makeNumeric()).
+	this.QrSegment.NUMERIC_REGEX = /^[0-9]*$/;
+	
+	// (Public) Can test whether a string is encodable in alphanumeric mode (such as by using QrSegment.makeAlphanumeric()).
+	this.QrSegment.ALPHANUMERIC_REGEX = /^[A-Z0-9 $%*+.\/:-]*$/;
+	
+	// (Private) The set of all legal characters in alphanumeric mode, where each character value maps to the index in the string.
+	QrSegment.ALPHANUMERIC_CHARSET = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ $%*+-./:";
+	
+	
+	/*---- Public helper enumeration ----*/
+	
+	/* 
+	 * Represents the mode field of a segment. Immutable.
+	 */
+	this.QrSegment.Mode = {  // Constants
+		NUMERIC     : new Mode(0x1, [10, 12, 14]),
+		ALPHANUMERIC: new Mode(0x2, [ 9, 11, 13]),
+		BYTE        : new Mode(0x4, [ 8, 16, 16]),
+		KANJI       : new Mode(0x8, [ 8, 10, 12]),
+		ECI         : new Mode(0x7, [ 0,  0,  0]),
+	};
+	
+	
+	// Private constructor.
+	function Mode(mode, ccbits) {
+		// (Package-private) The mode indicator bits, which is a uint4 value (range 0 to 15).
+		Object.defineProperty(this, "modeBits", {value:mode});
+		
+		// (Package-private) Returns the bit width of the segment character count field for this mode object at the given version number.
+		this.numCharCountBits = function(ver) {
+			return ccbits[Math.floor((ver + 7) / 17)];
+		};
+	}
+	
+	
+	
+	/*---- Private helper functions and classes ----*/
+	
+	// Returns a new array of bytes representing the given string encoded in UTF-8.
+	function toUtf8ByteArray(str) {
+		str = encodeURI(str);
+		var result = [];
+		for (var i = 0; i < str.length; i++) {
+			if (str.charAt(i) != "%")
+				result.push(str.charCodeAt(i));
+			else {
+				result.push(parseInt(str.substr(i + 1, 2), 16));
+				i += 2;
+			}
+		}
+		return result;
+	}
+	
+	
+	
+	/* 
+	 * A private helper class that computes the Reed-Solomon error correction codewords for a sequence of
+	 * data codewords at a given degree. Objects are immutable, and the state only depends on the degree.
+	 * This class exists because each data block in a QR Code shares the same the divisor polynomial.
+	 * This constructor creates a Reed-Solomon ECC generator for the given degree. This could be implemented
+	 * as a lookup table over all possible parameter values, instead of as an algorithm.
+	 */
+	function ReedSolomonGenerator(degree) {
+		if (degree < 1 || degree > 255)
+			throw "Degree out of range";
+		
+		// Coefficients of the divisor polynomial, stored from highest to lowest power, excluding the leading term which
+		// is always 1. For example the polynomial x^3 + 255x^2 + 8x + 93 is stored as the uint8 array {255, 8, 93}.
+		var coefficients = [];
+		
+		// Start with the monomial x^0
+		for (var i = 0; i < degree - 1; i++)
+			coefficients.push(0);
+		coefficients.push(1);
+		
+		// Compute the product polynomial (x - r^0) * (x - r^1) * (x - r^2) * ... * (x - r^{degree-1}),
+		// drop the highest term, and store the rest of the coefficients in order of descending powers.
+		// Note that r = 0x02, which is a generator element of this field GF(2^8/0x11D).
+		var root = 1;
+		for (var i = 0; i < degree; i++) {
+			// Multiply the current product by (x - r^i)
+			for (var j = 0; j < coefficients.length; j++) {
+				coefficients[j] = ReedSolomonGenerator.multiply(coefficients[j], root);
+				if (j + 1 < coefficients.length)
+					coefficients[j] ^= coefficients[j + 1];
+			}
+			root = ReedSolomonGenerator.multiply(root, 0x02);
+		}
+		
+		// Computes and returns the Reed-Solomon error correction codewords for the given
+		// sequence of data codewords. The returned object is always a new byte array.
+		// This method does not alter this object's state (because it is immutable).
+		this.getRemainder = function(data) {
+			// Compute the remainder by performing polynomial division
+			var result = coefficients.map(function() { return 0; });
+			data.forEach(function(b) {
+				var factor = b ^ result.shift();
+				result.push(0);
+				for (var i = 0; i < result.length; i++)
+					result[i] ^= ReedSolomonGenerator.multiply(coefficients[i], factor);
+			});
+			return result;
+		};
+	}
+	
+	// This static function returns the product of the two given field elements modulo GF(2^8/0x11D). The arguments and
+	// result are unsigned 8-bit integers. This could be implemented as a lookup table of 256*256 entries of uint8.
+	ReedSolomonGenerator.multiply = function(x, y) {
+		if (x >>> 8 != 0 || y >>> 8 != 0)
+			throw "Byte out of range";
+		// Russian peasant multiplication
+		var z = 0;
+		for (var i = 7; i >= 0; i--) {
+			z = (z << 1) ^ ((z >>> 7) * 0x11D);
+			z ^= ((y >>> i) & 1) * x;
+		}
+		if (z >>> 8 != 0)
+			throw "Assertion error";
+		return z;
+	};
+	
+	
+	
+	/* 
+	 * A private helper class that represents an appendable sequence of bits.
+	 * This constructor creates an empty bit buffer (length 0).
+	 */
+	function BitBuffer() {
+		
+		// Packs this buffer's bits into bytes in big endian,
+		// padding with '0' bit values, and returns the new array.
+		this.getBytes = function() {
+			var result = [];
+			while (result.length * 8 < this.length)
+				result.push(0);
+			this.forEach(function(bit, i) {
+				result[i >>> 3] |= bit << (7 - (i & 7));
+			});
+			return result;
+		};
+		
+		// Appends the given number of low bits of the given value
+		// to this sequence. Requires 0 <= val < 2^len.
+		this.appendBits = function(val, len) {
+			if (len < 0 || len > 31 || val >>> len != 0)
+				throw "Value out of range";
+			for (var i = len - 1; i >= 0; i--)  // Append bit by bit
+				this.push((val >>> i) & 1);
+		};
+	}
+	
+	BitBuffer.prototype = Object.create(Array.prototype);
+	
+};
diff --git a/web/lightning/qrcodegen.min.js b/web/lightning/qrcodegen.min.js
new file mode 100644
index 0000000..ca0389c
--- /dev/null
+++ b/web/lightning/qrcodegen.min.js
@@ -0,0 +1 @@
+"use strict";var qrcodegen=new function(){function t(t,r){Object.defineProperty(this,"ordinal",{value:t}),Object.defineProperty(this,"formatBits",{value:r})}function r(t,r){Object.defineProperty(this,"modeBits",{value:t}),this.numCharCountBits=function(t){return r[Math.floor((t+7)/17)]}}function e(t){t=encodeURI(t);for(var r=[],e=0;e<t.length;e++)"%"!=t.charAt(e)?r.push(t.charCodeAt(e)):(r.push(parseInt(t.substr(e+1,2),16)),e+=2);return r}function n(t){if(t<1||t>255)throw"Degree out of range";for(var r=[],e=0;e<t-1;e++)r.push(0);r.push(1);for(var o=1,e=0;e<t;e++){for(var a=0;a<r.length;a++)r[a]=n.multiply(r[a],o),a+1<r.length&&(r[a]^=r[a+1]);o=n.multiply(o,2)}this.getRemainder=function(t){var e=r.map(function(){return 0});return t.forEach(function(t){var o=t^e.shift();e.push(0);for(var a=0;a<e.length;a++)e[a]^=n.multiply(r[a],o)}),e}}function o(){this.getBytes=function(){for(var t=[];8*t.length<this.length;)t.push(0);return this.forEach(function(r,e){t[e>>>3]|=r<<7-(7&e)}),t},this.appendBits=function(t,r){if(r<0||r>31||t>>>r!=0)throw"Value out of range";for(var e=r-1;e>=0;e--)this.push(t>>>e&1)}}this.QrCode=function(t,r,e,o){function h(t){for(var r=o.formatBits<<3|t,e=r,n=0;n<10;n++)e=e<<1^1335*(e>>>9);var a=21522^(r<<10|e);if(a>>>15!=0)throw"Assertion error";for(var n=0;n<=5;n++)l(8,n,d(a,n));l(8,7,d(a,6)),l(8,8,d(a,7)),l(7,8,d(a,8));for(var n=9;n<15;n++)l(14-n,8,d(a,n));for(var n=0;n<=7;n++)l(E-1-n,8,d(a,n));for(var n=8;n<15;n++)l(8,E-15+n,d(a,n));l(8,E-8,!0)}function f(){if(!(e<7)){for(var t=e,r=0;r<12;r++)t=t<<1^7973*(t>>>11);var n=e<<12|t;if(n>>>18!=0)throw"Assertion error";for(var r=0;r<18;r++){var o=d(n,r),a=E-11+r%3,i=Math.floor(r/3);l(a,i,o),l(i,a,o)}}}function u(t,r){for(var e=-4;e<=4;e++)for(var n=-4;n<=4;n++){var o=Math.max(Math.abs(n),Math.abs(e)),a=t+n,i=r+e;0<=a&&a<E&&0<=i&&i<E&&l(a,i,2!=o&&4!=o)}}function c(t,r){for(var e=-2;e<=2;e++)for(var n=-2;n<=2;n++)l(t+n,r+e,1!=Math.max(Math.abs(n),Math.abs(e)))}function l(t,r,e){C[r][t]=e,w[r][t]=!0}function v(t){if(t<0||t>7)throw"Mask value out of range";for(var r=0;r<E;r++)for(var e=0;e<E;e++){var n;switch(t){case 0:n=(e+r)%2==0;break;case 1:n=r%2==0;break;case 2:n=e%3==0;break;case 3:n=(e+r)%3==0;break;case 4:n=(Math.floor(e/3)+Math.floor(r/2))%2==0;break;case 5:n=e*r%2+e*r%3==0;break;case 6:n=(e*r%2+e*r%3)%2==0;break;case 7:n=((e+r)%2+e*r%3)%2==0;break;default:throw"Assertion error"}!w[r][e]&&n&&(C[r][e]=!C[r][e])}}function g(){if(1==e)return[];for(var t=Math.floor(e/7)+2,r=32==e?26:2*Math.ceil((E-13)/(2*t-2)),n=[6],o=0,a=E-7;o<t-1;o++,a-=r)n.splice(1,0,a);return n}function d(t,r){return 0!=(t>>>r&1)}if(r<-1||r>7)throw"Mask value out of range";if(e<a||e>i)throw"Version value out of range";for(var E=4*e+17,m=[],p=0;p<E;p++)m.push(!1);for(var C=[],w=[],p=0;p<E;p++)C.push(m.slice()),w.push(m.slice());!function(){for(var t=0;t<E;t++)l(6,t,t%2==0),l(t,6,t%2==0);u(3,3),u(E-4,3),u(3,E-4);for(var r=g(),e=r.length,t=0;t<e;t++)for(var n=0;n<e;n++)0==t&&0==n||0==t&&n==e-1||t==e-1&&0==n||c(r[t],r[n]);h(0),f()}();var M=function(t){if(t.length!=s.getNumDataCodewords(e,o))throw"Invalid argument";for(var r=s.NUM_ERROR_CORRECTION_BLOCKS[o.ordinal][e],a=s.ECC_CODEWORDS_PER_BLOCK[o.ordinal][e],i=Math.floor(s.getNumRawDataModules(e)/8),h=r-i%r,f=Math.floor(i/r),u=[],c=new n(a),l=0,v=0;l<r;l++){var g=t.slice(v,v+f-a+(l<h?0:1));v+=g.length;var d=c.getRemainder(g);l<h&&g.push(0),u.push(g.concat(d))}for(var E=[],l=0;l<u[0].length;l++)for(var m=0;m<u.length;m++)(l!=f-a||m>=h)&&E.push(u[m][l]);if(E.length!=i)throw"Assertion error";return E}(t);if(function(t){if(t.length!=Math.floor(s.getNumRawDataModules(e)/8))throw"Invalid argument";for(var r=0,n=E-1;n>=1;n-=2){6==n&&(n=5);for(var o=0;o<E;o++)for(var a=0;a<2;a++){var i=n-a,h=0==(n+1&2),f=h?E-1-o:o;!w[f][i]&&r<8*t.length&&(C[f][i]=d(t[r>>>3],7-(7&r)),r++)}}if(r!=8*t.length)throw"Assertion error"}(M),-1==r)for(var R=1/0,p=0;p<8;p++){h(p),v(p);var N=function(){for(var t=0,r=0;r<E;r++)for(var e,n,o=0;o<E;o++)0==o||C[r][o]!=n?(n=C[r][o],e=1):(e++,5==e?t+=s.PENALTY_N1:e>5&&t++);for(var o=0;o<E;o++)for(var a,i,r=0;r<E;r++)0==r||C[r][o]!=i?(i=C[r][o],a=1):(a++,5==a?t+=s.PENALTY_N1:a>5&&t++);for(var r=0;r<E-1;r++)for(var o=0;o<E-1;o++){var h=C[r][o];h==C[r][o+1]&&h==C[r+1][o]&&h==C[r+1][o+1]&&(t+=s.PENALTY_N2)}for(var r=0;r<E;r++)for(var o=0,f=0;o<E;o++)f=f<<1&2047|(C[r][o]?1:0),o>=10&&(93==f||1488==f)&&(t+=s.PENALTY_N3);for(var o=0;o<E;o++)for(var r=0,f=0;r<E;r++)f=f<<1&2047|(C[r][o]?1:0),r>=10&&(93==f||1488==f)&&(t+=s.PENALTY_N3);var u=0;C.forEach(function(t){t.forEach(function(t){t&&u++})});var c=E*E;return t+=(Math.ceil(Math.abs(20*u-10*c)/c)-1)*s.PENALTY_N4}();N<R&&(r=p,R=N),v(p)}if(r<0||r>7)throw"Assertion error";h(r),v(r),w=null,Object.defineProperty(this,"version",{value:e}),Object.defineProperty(this,"size",{value:E}),Object.defineProperty(this,"errorCorrectionLevel",{value:o}),Object.defineProperty(this,"mask",{value:r}),this.getModule=function(t,r){return 0<=t&&t<E&&0<=r&&r<E&&C[r][t]},this.drawCanvas=function(t,r,e){if(t<=0||r<0)throw"Value out of range";var n=(E+2*r)*t;e.width=n,e.height=n;for(var o=e.getContext("2d"),a=-r;a<E+r;a++)for(var i=-r;i<E+r;i++)o.fillStyle=this.getModule(i,a)?"#000000":"#FFFFFF",o.fillRect((i+r)*t,(a+r)*t,t,t)},this.toSvgString=function(t){if(t<0)throw"Border must be non-negative";for(var r=[],e=0;e<E;e++)for(var n=0;n<E;n++)this.getModule(n,e)&&r.push("M"+(n+t)+","+(e+t)+"h1v1h-1z");return'<?xml version="1.0" encoding="UTF-8"?>\n<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN" "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">\n<svg xmlns="http://www.w3.org/2000/svg" version="1.1" viewBox="0 0 '+(E+2*t)+" "+(E+2*t)+'" stroke="none">\n\t<rect width="100%" height="100%" fill="#FFFFFF"/>\n\t<path d="'+r.join(" ")+'" fill="#000000"/>\n</svg>\n'}},this.QrCode.encodeText=function(t,r){var e=qrcodegen.QrSegment.makeSegments(t);return this.encodeSegments(e,r)},this.QrCode.encodeBinary=function(t,r){var e=qrcodegen.QrSegment.makeBytes(t);return this.encodeSegments([e],r)},this.QrCode.encodeSegments=function(t,r,e,n,h,f){if(void 0==e&&(e=a),void 0==n&&(n=i),void 0==h&&(h=-1),void 0==f&&(f=!0),!(a<=e&&e<=n&&n<=i)||h<-1||h>7)throw"Invalid value";var u,c;for(u=e;;u++){var l=8*s.getNumDataCodewords(u,r);if((c=qrcodegen.QrSegment.getTotalBits(t,u))<=l)break;if(u>=n)throw"Data too long"}[this.Ecc.MEDIUM,this.Ecc.QUARTILE,this.Ecc.HIGH].forEach(function(t){f&&c<=8*s.getNumDataCodewords(u,t)&&(r=t)});var v=new o;if(t.forEach(function(t){v.appendBits(t.mode.modeBits,4),v.appendBits(t.numChars,t.mode.numCharCountBits(u)),t.getBits().forEach(function(t){v.push(t)})}),v.length!=c)throw"Assertion error";var l=8*s.getNumDataCodewords(u,r);if(v.length>l)throw"Assertion error";if(v.appendBits(0,Math.min(4,l-v.length)),v.appendBits(0,(8-v.length%8)%8),v.length%8!=0)throw"Assertion error";for(var g=236;v.length<l;g^=253)v.appendBits(g,8);return new this(v.getBytes(),h,u,r)};var a=1,i=40;Object.defineProperty(this.QrCode,"MIN_VERSION",{value:a}),Object.defineProperty(this.QrCode,"MAX_VERSION",{value:i});var s={};s.getNumRawDataModules=function(t){if(t<a||t>i)throw"Version number out of range";var r=(16*t+128)*t+64;if(t>=2){var e=Math.floor(t/7)+2;r-=(25*e-10)*e-55,t>=7&&(r-=36)}return r},s.getNumDataCodewords=function(t,r){return Math.floor(s.getNumRawDataModules(t)/8)-s.ECC_CODEWORDS_PER_BLOCK[r.ordinal][t]*s.NUM_ERROR_CORRECTION_BLOCKS[r.ordinal][t]},s.PENALTY_N1=3,s.PENALTY_N2=3,s.PENALTY_N3=40,s.PENALTY_N4=10,s.ECC_CODEWORDS_PER_BLOCK=[[null,7,10,15,20,26,18,20,24,30,18,20,24,26,30,22,24,28,30,28,28,28,28,30,30,26,28,30,30,30,30,30,30,30,30,30,30,30,30,30,30],[null,10,16,26,18,24,16,18,22,22,26,30,22,22,24,24,28,28,26,26,26,26,28,28,28,28,28,28,28,28,28,28,28,28,28,28,28,28,28,28,28],[null,13,22,18,26,18,24,18,22,20,24,28,26,24,20,30,24,28,28,26,30,28,30,30,30,30,28,30,30,30,30,30,30,30,30,30,30,30,30,30,30],[null,17,28,22,16,22,28,26,26,24,28,24,28,22,24,24,30,28,28,26,28,30,24,30,30,30,30,30,30,30,30,30,30,30,30,30,30,30,30,30,30]],s.NUM_ERROR_CORRECTION_BLOCKS=[[null,1,1,1,1,1,2,2,2,2,4,4,4,4,4,6,6,6,6,7,8,8,9,9,10,12,12,12,13,14,15,16,17,18,19,19,20,21,22,24,25],[null,1,1,1,2,2,4,4,4,5,5,5,8,9,9,10,10,11,13,14,16,17,17,18,20,21,23,25,26,28,29,31,33,35,37,38,40,43,45,47,49],[null,1,1,2,2,4,4,6,6,8,8,8,10,12,16,12,17,16,18,21,20,23,23,25,27,29,34,34,35,38,40,43,45,48,51,53,56,59,62,65,68],[null,1,1,2,4,4,4,5,6,8,8,11,11,16,16,18,16,19,21,25,25,25,34,30,32,35,37,40,42,45,48,51,54,57,60,63,66,70,74,77,81]],this.QrCode.Ecc={LOW:new t(0,1),MEDIUM:new t(1,0),QUARTILE:new t(2,3),HIGH:new t(3,2)},this.QrSegment=function(t,e,n){if(e<0||!(t instanceof r))throw"Invalid argument";n=n.slice(),Object.defineProperty(this,"mode",{value:t}),Object.defineProperty(this,"numChars",{value:e}),this.getBits=function(){return n.slice()}},this.QrSegment.makeBytes=function(t){var r=new o;return t.forEach(function(t){r.appendBits(t,8)}),new this(this.Mode.BYTE,t.length,r)},this.QrSegment.makeNumeric=function(t){if(!this.NUMERIC_REGEX.test(t))throw"String contains non-numeric characters";for(var r=new o,e=0;e<t.length;){var n=Math.min(t.length-e,3);r.appendBits(parseInt(t.substr(e,n),10),3*n+1),e+=n}return new this(this.Mode.NUMERIC,t.length,r)},this.QrSegment.makeAlphanumeric=function(t){if(!this.ALPHANUMERIC_REGEX.test(t))throw"String contains unencodable characters in alphanumeric mode";var r,e=new o;for(r=0;r+2<=t.length;r+=2){var n=45*h.ALPHANUMERIC_CHARSET.indexOf(t.charAt(r));n+=h.ALPHANUMERIC_CHARSET.indexOf(t.charAt(r+1)),e.appendBits(n,11)}return r<t.length&&e.appendBits(h.ALPHANUMERIC_CHARSET.indexOf(t.charAt(r)),6),new this(this.Mode.ALPHANUMERIC,t.length,e)},this.QrSegment.makeSegments=function(t){return""==t?[]:this.NUMERIC_REGEX.test(t)?[this.makeNumeric(t)]:this.ALPHANUMERIC_REGEX.test(t)?[this.makeAlphanumeric(t)]:[this.makeBytes(e(t))]},this.QrSegment.makeEci=function(t){var r=new o;if(0<=t&&t<128)r.appendBits(t,8);else if(128<=t&&t<16384)r.appendBits(2,2),r.appendBits(t,14);else{if(!(16384<=t&&t<1e6))throw"ECI assignment value out of range";r.appendBits(6,3),r.appendBits(t,21)}return new this(this.Mode.ECI,0,r)},this.QrSegment.getTotalBits=function(t,r){for(var e=0,n=0;n<t.length;n++){var o=t[n],a=o.mode.numCharCountBits(r);if(o.numChars>=1<<a)return 1/0;e+=4+a+o.getBits().length}return e};var h={};this.QrSegment.NUMERIC_REGEX=/^[0-9]*$/,this.QrSegment.ALPHANUMERIC_REGEX=/^[A-Z0-9 $%*+.\/:-]*$/,h.ALPHANUMERIC_CHARSET="0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ $%*+-./:",this.QrSegment.Mode={NUMERIC:new r(1,[10,12,14]),ALPHANUMERIC:new r(2,[9,11,13]),BYTE:new r(4,[8,16,16]),KANJI:new r(8,[8,10,12]),ECI:new r(7,[0,0,0])},n.multiply=function(t,r){if(t>>>8!=0||r>>>8!=0)throw"Byte out of range";for(var e=0,n=7;n>=0;n--)e=e<<1^285*(e>>>7),e^=(r>>>n&1)*t;if(e>>>8!=0)throw"Assertion error";return e},o.prototype=Object.create(Array.prototype)};
diff --git a/web/lightning/style.css b/web/lightning/style.css
index 04e32c3..d112ef0 100644
--- a/web/lightning/style.css
+++ b/web/lightning/style.css
@@ -5,7 +5,7 @@ body {
 
 /* Style the tab */
 .tab {
-    max-width: 500px;
+    max-width: 524px;
     overflow: hidden;
     border: 1px solid #ccc;
     background-color: #f1f1f1;
@@ -41,12 +41,14 @@ body {
     border-top: none;
 }
 
+.lncontainer {
+    position: relative;
+    width: 100%;
+    text-align: center;
+}
+
 .lnqrcode {
-    margin-left: auto;
-    margin-right: auto;
-    padding: 20px 0px;
-    width: 256px;
-    height: 256px;
+    display: inline;
 }
 
 .lntext {
@@ -58,9 +60,9 @@ body {
 .lnsettled {
     display: none;
     position: absolute;
-    text-align: center;
-    top: 200px;
-    left: 150px;
+    top: 50%;
+    left: 50%;
+    transform: translate(-50%, -50%);
     color: green;
     font-size: 300%;
     font-family: Arial, sans-serif;
diff --git a/web/queue/index.html b/web/queue/index.html
index 055ed1e..5a1d464 100644
--- a/web/queue/index.html
+++ b/web/queue/index.html
@@ -16,6 +16,7 @@
     <meta name="author" content="Jochen Hoenicke"/>
     <meta name="keywords" content="Jochen Hoenicke, Bitcoin, Mempool, Statistics"/>
     <meta name="description" content="Johoe's Bitcoin Mempool Size Statistics"/>
+    <meta property="og:image" content="https://jochen-hoenicke.de/queue/mempool-20180219.png"/>
     <link href="style.css" rel="stylesheet" type="text/css"/>
 </head>
 <body>
@@ -46,17 +47,17 @@
    <h2>Donation Addresses</h2>
     <div class="centered">
       <div class="donation">
-        <a href="bitcoin:bc1qs5q679tac0uvfunt0gdwuymves5re7v7q8fntv"><div class="qrcontainer"><span class="cover pixelated qrcode" style="width:148px; height:148px; background-image: url(data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAACUAAAAlAQMAAAD/ULJAAAAABlBMVEX///8AAABVwtN+AAAA0UlEQVQI12NABvatT/kfMCjsM/BQYNBbq+O9gEGvtTMbRO54vYBBYYYmUNx+1ar1DxgY+FkVGBhkezIOHGCwkb3EosAgMIv7fAODarrpzgQGsduHNyxgkEoycklgsFj7XcaBQcft4yIGBo7lzOUKDII5LT0LGLSmW2smMIi4Cvx2YBCe9uQgA4OGT9L2BQzcF6brLGAQze/ybWDQ7hexA1pjoJ0MtHfSbi2g29Z1JAHdNunC/wcMevtZ1zAw6C07lcbAoLB9twjQ/X1bnA8gewgAMu1BFLs54BYAAAAASUVORK5CYII=);"></span><img class="qrlogo" src="bc-logo-32x32.png" alt=""/></div></a><a href="#" onClick="window.open('../lightning/','ln','resizeable,height=600,width=500'); return false;"><img class="bolt" src="../lightning/lightning-bolt.png" alt="lightning" /></a><br />
+        <a href="bitcoin:bc1qs5q679tac0uvfunt0gdwuymves5re7v7q8fntv"><div class="qrcontainer"><img class="cover pixelated qrcode" width="148" height="148" src="data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAACUAAAAlAQMAAAD/ULJAAAAABlBMVEX///8AAABVwtN+AAAA0UlEQVQI12NABvatT/kfMCjsM/BQYNBbq+O9gEGvtTMbRO54vYBBYYYmUNx+1ar1DxgY+FkVGBhkezIOHGCwkb3EosAgMIv7fAODarrpzgQGsduHNyxgkEoycklgsFj7XcaBQcft4yIGBo7lzOUKDII5LT0LGLSmW2smMIi4Cvx2YBCe9uQgA4OGT9L2BQzcF6brLGAQze/ybWDQ7hexA1pjoJ0MtHfSbi2g29Z1JAHdNunC/wcMevtZ1zAw6C07lcbAoLB9twjQ/X1bnA8gewgAMu1BFLs54BYAAAAASUVORK5CYII=" alt=""/><img class="qrlogo" src="bc-logo-32x32.png" alt=""/></div></a><a href="#" onClick="window.open('../lightning/','ln','resizeable,height=600,width=500'); return false;"><img class="bolt" src="../lightning/lightning-bolt.png" alt="lightning" /></a><br />
 	bitcoin:<a href="bitcoin:bc1qs5q679tac0uvfunt0gdwuymves5re7v7q8fntv">bc1qs5q679tac0uvfunt0gdwuymves5re7v7q8fntv</a><br/>
         (old bitcoin:<a href="bitcoin:3LrXizKejCGYyGUxYzGweyuxFVtfs3odEe">3LrXizKejCGYyGUxYzGweyuxFVtfs3odEe</a>)
       </div>
       <div class="donation">
-        <a href="bitcoincash:qqc0a3s49uzj329rju4v27erlc6kx5paqs6t5l70n6"><div class="qrcontainer"><span class="cover pixelated qrcode" style="width:148px; height:148px; background-image: url(data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAACUAAAAlAQMAAAD/ULJAAAAABlBMVEX///8AAABVwtN+AAAA00lEQVQI12NABvYTMvsfMChsuHZCgUGv6/7qBQx6+xSygeSe00BSodsKKG6/atX6BwwMKt8cGBjEF/NJOzAwemu0MTCwPIzNd2Aw95l0ZgED6zbpiQ8YFEOPuiswcJ06qOzAYM+d+3cBA9Mds5MLGHiNT9YqMOj8EytKYOBg2xm1gEH7y/T6BgYTg0k3GBhU9xf6LWDQYRTkfsBgtivU7gADg57QogUM9tOfr3JgUFi/SgkosDS9PoFBb/cinQMMejN3PwG6ea2jJtCWvpftB5A9BAB0VkYyusTI4gAAAABJRU5ErkJggg==);"></span><img class="qrlogo" src="bch-logo-30.png" alt=""/></div></a><br/>
+        <a href="bitcoincash:qqc0a3s49uzj329rju4v27erlc6kx5paqs6t5l70n6"><div class="qrcontainer"><img class="cover pixelated qrcode" width="148" height="148" src="data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAACUAAAAlAQMAAAD/ULJAAAAABlBMVEX///8AAABVwtN+AAAA00lEQVQI12NABvYTMvsfMChsuHZCgUGv6/7qBQx6+xSygeSe00BSodsKKG6/atX6BwwMKt8cGBjEF/NJOzAwemu0MTCwPIzNd2Aw95l0ZgED6zbpiQ8YFEOPuiswcJ06qOzAYM+d+3cBA9Mds5MLGHiNT9YqMOj8EytKYOBg2xm1gEH7y/T6BgYTg0k3GBhU9xf6LWDQYRTkfsBgtivU7gADg57QogUM9tOfr3JgUFi/SgkosDS9PoFBb/cinQMMejN3PwG6ea2jJtCWvpftB5A9BAB0VkYyusTI4gAAAABJRU5ErkJggg==" alt=""/><img class="qrlogo" src="bch-logo-30.png" alt=""/></div></a><br/>
         <a href="bitcoincash:qqc0a3s49uzj329rju4v27erlc6kx5paqs6t5l70n6">bitcoincash:qqc0a3s49uzj329rju4v27erlc6kx5paqs6t5l70n6</a><br/>
         (old bitcoincash:<a href="bitcoincash:15U4eCYkRBQZMLALWC4WqapVS9Qi8zyFut">15U4eCYkRBQZMLALWC4WqapVS9Qi8zyFut</a>)
       </div>
       <div class="donation">
-        <a href="litecoin:ltc1qp2qsuh73rrj8gxpvw65ck554qfnv8s5pke3qzm"><div class="qrcontainer"><span class="cover pixelated qrcode" style="width:148px; height:148px; background-image: url(data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAACUAAAAlAQMAAAD/ULJAAAAABlBMVEX///8AAABVwtN+AAAA1ElEQVQI12NABvZTW9Y/YFDojj2hwKA3vWv1Aga9Za9OA8nJ+14vYFDY9LlDgcF+1SqgGgY1DwcGBom2u7oMDLLxCVkPGASe2O9OYBDOWnNTgcH22v32BwxmjtKvHjCIvZiV94BBqVB8IQOD9J0bmxkYFIVL9Q8wyK2LE0xgEKlbH/aAgeu0pOMCBkbWB4wJDGY/dGoeMDAnGgYpMJjfELU/wMBg8OnxAaDbQlc1MChM+LcI6La50f8aGPQaTy08wKC3taof6ObFYl1At034mJuA7CEA8yNLCukmy7UAAAAASUVORK5CYII=);"></span><img class="qrlogo" src="ltc-32px.png" alt=""/></div></a><br />
+        <a href="litecoin:ltc1qp2qsuh73rrj8gxpvw65ck554qfnv8s5pke3qzm"><div class="qrcontainer"><img class="cover pixelated qrcode" width="148" height="148" src="data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAACUAAAAlAQMAAAD/ULJAAAAABlBMVEX///8AAABVwtN+AAAA1ElEQVQI12NABvZTW9Y/YFDojj2hwKA3vWv1Aga9Za9OA8nJ+14vYFDY9LlDgcF+1SqgGgY1DwcGBom2u7oMDLLxCVkPGASe2O9OYBDOWnNTgcH22v32BwxmjtKvHjCIvZiV94BBqVB8IQOD9J0bmxkYFIVL9Q8wyK2LE0xgEKlbH/aAgeu0pOMCBkbWB4wJDGY/dGoeMDAnGgYpMJjfELU/wMBg8OnxAaDbQlc1MChM+LcI6La50f8aGPQaTy08wKC3taof6ObFYl1At034mJuA7CEA8yNLCukmy7UAAAAASUVORK5CYII=" alt=""/><img class="qrlogo" src="ltc-32px.png" alt=""/></div></a><br />
 	litecoin:<a href="litecoin:ltc1qp2qsuh73rrj8gxpvw65ck554qfnv8s5pke3qzm">ltc1qp2qsuh73rrj8gxpvw65ck554qfnv8s5pke3qzm</a><br/>
         (old litecoin:<a href="litecoin:MK7jfGG48RTsETCXTAz1wP27uVoFhBUV5o">MK7jfGG48RTsETCXTAz1wP27uVoFhBUV5o</a>)
       </div>
