var page = require('webpage').create();
var url = 'src/index.html';
-var testMaxTime = 10000;
+var testMaxTime = 20000;
+
+page.viewportSize = {
+ width: 1024,
+ height: 720
+};
page.onResourceError = function(e) {
console.log("Error loading " + e.url);
});
},
+// Network can be set to ethereum
+function() {
+
+page.open(url, function(status) {
+
+ // set the phrase and coin
+ page.evaluate(function() {
+ $(".phrase").val("abandon abandon ability");
+ $(".phrase").trigger("input");
+ $(".network option[selected]").removeAttr("selected");
+ $(".network option[value=13]").prop("selected", true);
+ $(".network").trigger("change");
+ });
+ waitForGenerate(function() {
+ // check the address is generated correctly
+ // this value comes from
+ // https://www.myetherwallet.com/#view-wallet-info
+ // Unusual capitalization is due to checksum
+ var expected = "0xe5815d5902Ad612d49283DEdEc02100Bd44C2772";
+ var actual = page.evaluate(function() {
+ return $(".address:first").text();
+ });
+ if (actual != expected) {
+ console.log("Ethereum address is incorrect");
+ console.log("Expected: " + expected);
+ console.log("Actual: " + actual);
+ fail();
+ }
+ // check the private key is correct
+ // this private key can be imported into
+ // https://www.myetherwallet.com/#view-wallet-info
+ // and it should correlate to the address above
+ var expected = "8f253078b73d7498302bb78c171b23ce7a8fb511987d2b2702b731638a4a15e7";
+ var actual = page.evaluate(function() {
+ return $(".privkey:first").text();
+ });
+ if (actual != expected) {
+ console.log("Ethereum privkey is incorrect");
+ console.log("Expected: " + expected);
+ console.log("Actual: " + actual);
+ fail();
+ }
+ // check the public key is correct
+ // TODO
+ // don't have any third-party source to generate the expected value
+ //var expected = "?";
+ //var actual = page.evaluate(function() {
+ // return $(".pubkey:first").text();
+ //});
+ //if (actual != expected) {
+ // console.log("Ethereum privkey is incorrect");
+ // console.log("Expected: " + expected);
+ // console.log("Actual: " + actual);
+ // fail();
+ //}
+ next();
+ });
+});
+},
+
// BIP39 seed is set from phrase
function() {
page.open(url, function(status) {
});
},
+// Github pull request 48
+// First four letters of word shows that word, not closest
+// since first four letters gives unique word in BIP39 wordlist
+// eg ille should show illegal, not idle
+function() {
+page.open(url, function(status) {
+ // set the incomplete word
+ page.evaluate(function() {
+ $(".phrase").val("ille").trigger("input");
+ });
+ // check there is a suggestion shown
+ waitForFeedback(function() {
+ var feedback = page.evaluate(function() {
+ return $(".feedback").text();
+ });
+ if (feedback.indexOf("did you mean illegal?") < 0) {
+ console.log("Start of word does not show correct suggestion");
+ console.log("Error: " + error);
+ fail();
+ }
+ next();
+ });
+});
+},
+
// Incorrect BIP32 root key shows error
function() {
page.open(url, function(status) {
catch (e) {
return e.message;
}
- // Leading zeros for card entropy as binary string
+ // Leading zeros for card entropy as binary string.
+ // Card entropy is hashed so 2c does not necessarily produce leading zeros.
try {
e = Entropy.fromString("2c");
- if (e.binaryStr != "00001") {
+ if (e.binaryStr != "0010") {
return "Card entropy as binary has leading zeros";
}
}
// [ cards, binary ]
try {
var cards = [
- [ "ac", "00000" ],
- [ "acac", "00000000000" ],
- [ "acac2c", "00000000000000001" ],
- [ "acks", "00000110011" ],
- [ "acacks", "00000000000110011" ],
- [ "2c", "00001" ],
- [ "3d", "01111" ],
- [ "4h", "11101" ],
- [ "5s", "101011" ],
- [ "6c", "00101" ],
- [ "7d", "10011" ],
- [ "8h", "100001" ],
- [ "9s", "101111" ],
- [ "tc", "01001" ],
- [ "jd", "10111" ],
- [ "qh", "100101" ],
- [ "ks", "110011" ],
- [ "ks2c", "101001011101" ],
- [ "KS2C", "101001011101" ],
+ [ "ac", "0101" ],
+ [ "acqs", "11011100" ],
+ [ "acks", "01011100" ],
+ [ "2cac", "11111000" ],
+ [ "2c", "0010" ],
+ [ "3d", "0001" ],
+ [ "4h", "1001" ],
+ [ "5s", "1001" ],
+ [ "6c", "0000" ],
+ [ "7d", "0001" ],
+ [ "8h", "1011" ],
+ [ "9s", "0010" ],
+ [ "tc", "1001" ],
+ [ "jd", "1111" ],
+ [ "qh", "0010" ],
+ [ "ks", "0101" ],
+ [ "ks2c", "01010100" ],
+ [ "KS2C", "01010100" ],
];
for (var i=0; i<cards.length; i++) {
var card = cards[i][0];
e = Entropy.fromString(card);
console.log(e.binary + " " + result);
if (e.binaryStr !== result) {
- return "card entropy not parsed correctly: " + result + " != " + e.binaryStr;
+ return "card entropy " + card + " not parsed correctly: " + result + " != " + e.binaryStr;
}
}
}
[ "222F", "16" ],
[ "FFFF", "16" ],
[ "0000101017", "33" ], // 10 events at 3.32 bits per event
- [ "ac2c3c4c5c6c7c8c9ctcjcqckcad2d3d4d5d6d7d8d9dtdjdqdkdah2h3h4h5h6h7h8h9hthjhqhkhas2s3s4s5s6s7s8s9stsjsqsks", "226" ], // cards are not replaced, so a full deck is not 52^52 entropy which is 296 bits, it's 52!, which is 226 bits
+ [ "ac2c3c4c5c6c7c8c9ctcjcqckcad2d3d4d5d6d7d8d9dtdjdqdkdah2h3h4h5h6h7h8h9hthjhqhkhas2s3s4s5s6s7s8s9stsjsqsks", "225" ], // cards are not replaced, so a full deck is not 52^52 entropy which is 296 bits, it's 52!, which is 225 bits
]
// use entropy
page.evaluate(function(e) {
entropy: "ac2c3c4c5c6c7c8c9ctcjcqckcad2d3d4d5d6d7d8d9dtdjdqdkdah2h3h4h5h6h7h8h9hthjhqhkhas2s3s4s5s6s7s8s9stsjsqsks",
type: "card (full deck)",
events: 52,
- bits: 226,
- words: 27,
+ bits: 225,
+ words: 21,
strength: "extremely strong",
},
{
entropy: "ac2c3c4c5c6c7c8c9ctcjcqckcad2d3d4d5d6d7d8d9dtdjdqdkdah2h3h4h5h6h7h8h9hthjhqhkhas2s3s4s5s6s7s8s9stsjsqsks3d",
type: "card (full deck, 1 duplicate: 3d)",
events: 53,
- bits: 232,
- words: 27,
+ bits: 254,
+ words: 21,
strength: "extremely strong",
},
{
entropy: "ac2c3c4c5c6c7c8c9ctcjcqckcad2d3d4d5d6d7d8d9dtdjdqdkdah2h3h4h5h6h7h8h9hthjhqhkhas2s3s4s5s6s7s8s9stsjsqs3d4d",
- type: "card (2 duplicates: 3d 4d)",
+ type: "card (2 duplicates: 3d 4d, 1 missing: KS)",
events: 53,
- bits: 232,
- words: 27,
+ bits: 254,
+ words: 21,
strength: "extremely strong",
},
{
entropy: "ac2c3c4c5c6c7c8c9ctcjcqckcad2d3d4d5d6d7d8d9dtdjdqdkdah2h3h4h5h6h7h8h9hthjhqhkhas2s3s4s5s6s7s8s9stsjsqs3d4d5d6d",
- type: "card (4 duplicates: 3d 4d 5d...)",
+ type: "card (4 duplicates: 3d 4d 5d..., 1 missing: KS)",
events: 53,
- bits: 243,
- words: 27,
+ bits: 264,
+ words: 24,
strength: "extremely strong",
},
// Next test was throwing uncaught error in zxcvbn
+ // Also tests 451 bits, ie Math.log2(52!)*2 = 225.58 * 2
{
entropy: "ac2c3c4c5c6c7c8c9ctcjcqckcad2d3d4d5d6d7d8d9dtdjdqdkdah2h3h4h5h6h7h8h9hthjhqhkhas2s3s4s5s6s7s8s9stsjsqsksac2c3c4c5c6c7c8c9ctcjcqckcad2d3d4d5d6d7d8d9dtdjdqdkdah2h3h4h5h6h7h8h9hthjhqhkhas2s3s4s5s6s7s8s9stsjsqsks",
type: "card (full deck, 52 duplicates: ac 2c 3c...)",
events: 104,
- bits: 452,
- words: 54,
+ bits: 499,
+ words: 45,
strength: "extremely strong",
},
// Case insensitivity to duplicate cards
entropy: "asAS",
type: "card (1 duplicate: AS)",
events: 2,
- bits: 12,
+ bits: 9,
words: 0,
strength: "extremely weak",
},
entropy: "ASas",
type: "card (1 duplicate: as)",
events: 2,
- bits: 12,
+ bits: 9,
words: 0,
strength: "extremely weak",
},
+ // Missing cards are detected
+ {
+ entropy: "ac2c3c4c5c6c7c8c tcjcqckcad2d3d4d5d6d7d8d9dtdjdqdkdah2h3h4h5h6h7h8h9hthjhqhkhas2s3s4s5s6s7s8s9stsjsqsks",
+ type: "card (1 missing: 9C)",
+ events: 51,
+ bits: 221,
+ words: 18,
+ strength: "extremely strong",
+ },
+ {
+ entropy: "ac2c3c4c5c6c7c8c tcjcqckcad2d3d4d 6d7d8d9dtdjdqdkdah2h3h4h5h6h7h8h9hthjhqhkhas2s3s4s5s6s7s8s9stsjsqsks",
+ type: "card (2 missing: 9C 5D)",
+ events: 50,
+ bits: 216,
+ words: 18,
+ strength: "extremely strong",
+ },
+ {
+ entropy: "ac2c3c4c5c6c7c8c tcjcqckcad2d3d4d 6d7d8d9dtdjd kdah2h3h 5h6h7h8h9hthjhqhkhas2s3s4s5s6s7s8s9stsjsqsks",
+ type: "card (4 missing: 9C 5D QD...)",
+ events: 48,
+ bits: 208,
+ words: 18,
+ strength: "extremely strong",
+ },
+ // More than six missing cards does not show message
+ {
+ entropy: "ac2c3c4c5c6c7c8c tcjcqckcad2d3d4d 6d 8d9d jd kdah2h3h 5h6h7h8h9hthjhqhkh 2s3s4s5s6s7s8s9stsjsqsks",
+ type: "card",
+ events: 45,
+ bits: 195,
+ words: 18,
+ strength: "extremely strong",
+ },
+ // Multiple decks of cards increases bits per event
+ {
+ entropy: "3d",
+ events: 1,
+ bits: 4,
+ bitsPerEvent: 4.34,
+ },
+ {
+ entropy: "3d3d",
+ events: 2,
+ bits: 9,
+ bitsPerEvent: 4.80,
+ },
+ {
+ entropy: "3d3d3d",
+ events: 3,
+ bits: 15,
+ bitsPerEvent: 5.01,
+ },
+ {
+ entropy: "3d3d3d3d",
+ events: 4,
+ bits: 20,
+ bitsPerEvent: 5.14,
+ },
+ {
+ entropy: "3d3d3d3d3d",
+ events: 5,
+ bits: 26,
+ bitsPerEvent: 5.22,
+ },
+ {
+ entropy: "3d3d3d3d3d3d",
+ events: 6,
+ bits: 31,
+ bitsPerEvent: 5.28,
+ },
+ {
+ entropy: "3d3d3d3d3d3d3d3d3d3d3d3d3d3d3d3d3d3d3d3d3d3d3d3d3d3d3d3d3d3d3d3d3d",
+ events: 33,
+ bits: 184,
+ bitsPerEvent: 5.59,
+ strength: 'easily cracked - Repeats like "abcabcabc" are only slightly harder to guess than "abc"',
+ },
];
// use entropy
page.evaluate(function() {
if ("filtered" in expected && actual.indexOf(expected.filtered) == -1) {
return "Filtered value not in feedback";
}
- if (actual.indexOf(expected.type) == -1) {
+ if ("type" in expected && actual.indexOf(expected.type) == -1) {
return "Entropy type not in feedback";
}
- if (actual.indexOf(expected.events) == -1) {
+ if ("events" in expected && actual.indexOf(expected.events) == -1) {
return "Event count not in feedback";
}
- if (actual.indexOf(expected.bits) == -1) {
+ if ("bits" in expected && actual.indexOf(expected.bits) == -1) {
return "Bit count not in feedback";
}
- if (actual.indexOf(expected.strength) == -1) {
+ if ("strength" in expected && actual.indexOf(expected.strength) == -1) {
return "Strength not in feedback";
}
+ if ("bitsPerEvent" in expected && actual.indexOf(expected.bitsPerEvent) == -1) {
+ return "bitsPerEvent not in feedback";
+ }
return false;
}
test = tests[i];
return $(".phrase").val();
});
// Check mnemonic length
- if (test.words == 0) {
+ if ("words" in test && test.words == 0) {
if (mnemonic.length > 0) {
console.log("Mnemonic length for " + test.strength + " strength is not " + test.words);
+ console.log("Entropy: " + test.entropy);
console.log("Mnemonic: " + mnemonic);
fail();
}
}
- else {
+ else if ("words" in test) {
if (mnemonic.split(" ").length != test.words) {
console.log("Mnemonic length for " + test.strength + " strength is not " + test.words);
+ console.log("Entropy: " + test.entropy);
console.log("Mnemonic: " + mnemonic);
fail();
}
});
},
+// Github issue 33
+// https://github.com/iancoleman/bip39/issues/33
+// Final cards should contribute entropy
+function() {
+page.open(url, function(status) {
+ // use entropy
+ page.evaluate(function() {
+ $(".use-entropy").prop("checked", true).trigger("change");
+ $(".entropy").val("7S 9H 9S QH 8C KS AS 7D 7C QD 4S 4D TC 2D 5S JS 3D 8S 8H 4C 3C AC 3S QC 9C JC 7H AD TD JD 6D KH 5C QS 2S 6S 6H JH KD 9D-6C TS TH 4H KC 5H 2H AH 2C 8D 3H 5D").trigger("input");
+ });
+ // get the mnemonic
+ waitForGenerate(function() {
+ var originalPhrase = page.evaluate(function() {
+ return $(".phrase").val();
+ });
+ // Set the last 12 cards to be AS
+ page.evaluate(function() {
+ $(".addresses").empty();
+ $(".entropy").val("7S 9H 9S QH 8C KS AS 7D 7C QD 4S 4D TC 2D 5S JS 3D 8S 8H 4C 3C AC 3S QC 9C JC 7H AD TD JD 6D KH 5C QS 2S 6S 6H JH KD 9D-AS AS AS AS AS AS AS AS AS AS AS AS").trigger("input");
+ });
+ // get the new mnemonic
+ waitForGenerate(function() {
+ var newPhrase = page.evaluate(function() {
+ return $(".phrase").val();
+ });
+ // check the phrase has changed
+ if (newPhrase == originalPhrase) {
+ console.log("Changing last 12 cards does not change mnemonic");
+ console.log("Original:");
+ console.log(originalPhrase);
+ console.log("New:");
+ console.log(newPhrase);
+ fail();
+ }
+ next();
+ });
+ });
+});
+},
+
+// Github issue 35
+// https://github.com/iancoleman/bip39/issues/35
+// QR Code support
+function() {
+page.open(url, function(status) {
+ // use entropy
+ page.evaluate(function() {
+ $(".generate").click();
+ });
+ waitForGenerate(function() {
+ var p = page.evaluate(function() {
+ // get position of mnemonic element
+ return $(".phrase").offset();
+ });
+ p.top = Math.ceil(p.top);
+ p.left = Math.ceil(p.left);
+ // check the qr code shows
+ page.sendEvent("mousemove", p.left+4, p.top+4);
+ var qrShowing = page.evaluate(function() {
+ return $(".qr-container").find("canvas").length > 0;
+ });
+ if (!qrShowing) {
+ console.log("QR Code does not show");
+ fail();
+ }
+ // check the qr code hides
+ page.sendEvent("mousemove", p.left-4, p.top-4);
+ var qrHidden = page.evaluate(function() {
+ return $(".qr-container").find("canvas").length == 0;
+ });
+ if (!qrHidden) {
+ console.log("QR Code does not hide");
+ fail();
+ }
+ next();
+ });
+});
+},
+
+// BIP44 account extendend private key is shown
+// github issue 37 - compatibility with electrum
+function() {
+page.open(url, function(status) {
+ // set the phrase
+ var expected = "xprv9yzrnt4zWVJUr1k2VxSPy9ettKz5PpeDMgaVG7UKedhqnw1tDkxP2UyYNhuNSumk2sLE5ctwKZs9vwjsq3e1vo9egCK6CzP87H2cVYXpfwQ";
+ page.evaluate(function() {
+ $(".phrase").val("abandon abandon ability");
+ $(".phrase").trigger("input");
+ });
+ // check the BIP44 account extended private key
+ waitForGenerate(function() {
+ var actual = page.evaluate(function() {
+ return $(".account-xprv").val();
+ });
+ if (actual != expected) {
+ console.log("BIP44 account extended private key is incorrect");
+ console.log("Expected: " + expected);
+ console.log("Actual: " + actual);
+ fail();
+ }
+ next();
+ });
+});
+},
+
+// BIP44 account extendend public key is shown
+// github issue 37 - compatibility with electrum
+function() {
+page.open(url, function(status) {
+ // set the phrase
+ var expected = "xpub6CzDCPbtLrrn4VpVbyyQLHbdSMpZoHN4iuW64VswCyEpfjM2mJGdaHJ2DyuZwtst96E16VvcERb8BBeJdHSCVmAq9RhtRQg6eAZFrTKCNqf";
+ page.evaluate(function() {
+ $(".phrase").val("abandon abandon ability");
+ $(".phrase").trigger("input");
+ });
+ // check the BIP44 account extended public key
+ waitForGenerate(function() {
+ var actual = page.evaluate(function() {
+ return $(".account-xpub").val();
+ });
+ if (actual != expected) {
+ console.log("BIP44 account extended public key is incorrect");
+ console.log("Expected: " + expected);
+ console.log("Actual: " + actual);
+ fail();
+ }
+ next();
+ });
+});
+},
+
+// github issue 40
+// BIP32 root key can be set as an xpub
+function() {
+page.open(url, function(status) {
+ // set the phrase
+ page.evaluate(function() {
+ // set xpub for account 0 of bip44 for 'abandon abandon ability'
+ var bip44AccountXpub = "xpub6CzDCPbtLrrn4VpVbyyQLHbdSMpZoHN4iuW64VswCyEpfjM2mJGdaHJ2DyuZwtst96E16VvcERb8BBeJdHSCVmAq9RhtRQg6eAZFrTKCNqf";
+ $("#root-key").val(bip44AccountXpub);
+ $("#root-key").trigger("input");
+ });
+ waitForFeedback(function() {
+ page.evaluate(function() {
+ // Use bip32 tab
+ $("#bip32-tab a").click();
+ });
+ waitForGenerate(function() {
+ page.evaluate(function() {
+ // derive external addresses for this xpub
+ var firstAccountDerivationPath = "m/0";
+ $("#bip32-path").val(firstAccountDerivationPath);
+ $("#bip32-path").trigger("input");
+ });
+ waitForGenerate(function() {
+ // check the addresses are generated
+ var expected = "1Di3Vp7tBWtyQaDABLAjfWtF6V7hYKJtug";
+ var actual = page.evaluate(function() {
+ return $(".address:first").text();
+ });
+ if (actual != expected) {
+ console.log("xpub key does not generate addresses in table");
+ console.log("Expected: " + expected);
+ console.log("Actual: " + actual);
+ fail();
+ }
+ // check the xprv key is not set
+ var expected = "NA";
+ var actual = page.evaluate(function() {
+ return $(".extended-priv-key").val();
+ });
+ if (actual != expected) {
+ console.log("xpub key as root shows derived bip32 xprv key");
+ console.log("Expected: " + expected);
+ console.log("Actual: " + actual);
+ fail();
+ }
+ // check the private key is not set
+ var expected = "NA";
+ var actual = page.evaluate(function() {
+ return $(".privkey:first").text();
+ });
+ if (actual != expected) {
+ console.log("xpub key generates private key in addresses table");
+ console.log("Expected: " + expected);
+ console.log("Actual: " + actual);
+ fail();
+ }
+ next();
+ });
+ });
+ });
+});
+},
+
+// github issue 40
+// xpub for bip32 root key will not work with hardened derivation paths
+function() {
+page.open(url, function(status) {
+ // set the phrase
+ page.evaluate(function() {
+ // set xpub for account 0 of bip44 for 'abandon abandon ability'
+ var bip44AccountXpub = "xpub6CzDCPbtLrrn4VpVbyyQLHbdSMpZoHN4iuW64VswCyEpfjM2mJGdaHJ2DyuZwtst96E16VvcERb8BBeJdHSCVmAq9RhtRQg6eAZFrTKCNqf";
+ $("#root-key").val(bip44AccountXpub);
+ $("#root-key").trigger("input");
+ });
+ waitForFeedback(function() {
+ // Check feedback is correct
+ var expected = "Hardened derivation path is invalid with xpub key";
+ var actual = page.evaluate(function() {
+ return $(".feedback").text();
+ });
+ if (actual != expected) {
+ console.log("xpub key with hardened derivation path does not show feedback");
+ console.log("Expected: " + expected);
+ console.log("Actual: " + actual);
+ fail();
+ }
+ // Check no addresses are shown
+ var expected = 0;
+ var actual = page.evaluate(function() {
+ return $(".addresses tr").length;
+ });
+ if (actual != expected) {
+ console.log("addresses still show after setting xpub key with hardened derivation path");
+ console.log("Expected: " + expected);
+ console.log("Actual: " + actual);
+ fail();
+ }
+ next();
+ });
+});
+},
+
+// github issue 39
+// no root key shows feedback
+function() {
+page.open(url, function(status) {
+ // click the bip32 tab on fresh page
+ page.evaluate(function() {
+ $("#bip32-tab a").click();
+ });
+ waitForFeedback(function() {
+ // Check feedback is correct
+ var expected = "No root key";
+ var actual = page.evaluate(function() {
+ return $(".feedback").text();
+ });
+ if (actual != expected) {
+ console.log("Blank root key not detected");
+ console.log("Expected: " + expected);
+ console.log("Actual: " + actual);
+ fail();
+ }
+ next();
+ });
+});
+},
+
+// Github issue 44
+// display error switching tabs while addresses are generating
+function() {
+page.open(url, function(status) {
+ // set the phrase
+ page.evaluate(function() {
+ $(".phrase").val("abandon abandon ability").trigger("input");
+ });
+ waitForGenerate(function() {
+ // set to generate 500 more addresses
+ // generate more addresses
+ // change tabs which should cancel the previous generating
+ page.evaluate(function() {
+ $(".rows-to-add").val("100");
+ $(".more").click();
+ $("#bip32-tab a").click();
+ });
+ // check the derivation paths are in order and of the right quantity
+ waitForGenerate(function() {
+ var paths = page.evaluate(function() {
+ return $(".index").map(function(i, e) {
+ return $(e).text();
+ });
+ });
+ for (var i=0; i<paths.length; i++) {
+ var expected = "m/0/" + i;
+ var actual = paths[i];
+ if (actual != expected) {
+ console.log("Path " + i + " is not in correct order");
+ console.log("Expected: " + expected);
+ console.log("Actual: " + actual);
+ fail();
+ }
+ }
+ if (paths.length != 20) {
+ console.log("Generation was not cancelled by new action");
+ fail();
+ }
+ next();
+ });
+ });
+});
+},
+
+// Github issue 49
+// padding for binary should give length with multiple of 256
+// hashed entropy 1111 is length 252, so requires 4 leading zeros
+// prior to issue 49 it would only generate 2 leading zeros, ie missing 2
+function() {
+page.open(url, function(status) {
+ expected = "avocado valid quantum cross link predict excuse edit street able flame large galaxy ginger nuclear"
+ // use entropy
+ page.evaluate(function() {
+ $(".use-entropy").prop("checked", true).trigger("change");
+ $(".mnemonic-length").val("15");
+ $(".entropy").val("1111").trigger("input");
+ });
+ waitForGenerate(function() {
+ // get the mnemonic
+ var actual = page.evaluate(function() {
+ return $(".phrase").val();
+ });
+ // check the mnemonic is correct
+ if (actual != expected) {
+ console.log("Left padding error for entropy");
+ console.log("Expected: " + expected);
+ console.log("Actual: " + actual);
+ fail();
+ }
+ next();
+ });
+});
+},
+
// If you wish to add more tests, do so here...
// Here is a blank test template
projects / perso / Immae / Projets / Cryptomonnaies / BIP39.git / blobdiff