X-Git-Url: https://git.immae.eu/?a=blobdiff_plain;f=tests.js;h=8de6391fd7bb0aafe6b9317d9c2b46285998bb2c;hb=adc8ce127d4f8ea0d7e5ede6a82c2791d60ff4d2;hp=914be245532a28eb921bf3e36ec8207b78a60204;hpb=1b12b2f5f12b32a2ed6e69ff77f10b889b383e97;p=perso%2FImmae%2FProjets%2FCryptomonnaies%2FBIP39.git diff --git a/tests.js b/tests.js index 914be24..8de6391 100644 --- a/tests.js +++ b/tests.js @@ -75,6 +75,40 @@ function waitForFeedback(fn, maxTime) { wait(); } +function waitForEntropyFeedback(fn, maxTime) { + if (!maxTime) { + maxTime = testMaxTime; + } + var origFeedback = page.evaluate(function() { + return $(".entropy-error").text(); + }); + var start = new Date().getTime(); + var wait = function keepWaiting() { + var now = new Date().getTime(); + var hasTimedOut = now - start > maxTime; + if (hasTimedOut) { + console.log("Test timed out"); + fn(); + return; + } + var feedback = page.evaluate(function() { + var feedback = $(".entropy-error"); + if (feedback.css("display") == "none") { + return ""; + } + return feedback.text(); + }); + var hasFinished = feedback != origFeedback; + if (hasFinished) { + fn(); + } + else { + setTimeout(keepWaiting, 100); + } + } + wait(); +} + function next() { if (tests.length > 0) { var testsStr = tests.length == 1 ? "test" : "tests"; @@ -1960,6 +1994,784 @@ page.open(url, function(status) { }); }, +// Entropy unit tests +function() { +page.open(url, function(status) { + var response = page.evaluate(function() { + var e; + // binary entropy is detected + try { + e = Entropy.fromString("01010101"); + if (e.base.str != "binary") { + return "Binary entropy not detected correctly"; + } + } + catch (e) { + return e.message; + } + // base6 entropy is detected + try { + e = Entropy.fromString("012345012345"); + if (e.base.str != "base 6") { + return "base6 entropy not detected correctly"; + } + } + catch (e) { + return e.message; + } + // dice entropy is detected + try { + e = Entropy.fromString("123456123456"); + if (e.base.str != "base 6 (dice)") { + return "dice entropy not detected correctly"; + } + } + catch (e) { + return e.message; + } + // base10 entropy is detected + try { + e = Entropy.fromString("0123456789"); + if (e.base.str != "base 10") { + return "base10 entropy not detected correctly"; + } + } + catch (e) { + return e.message; + } + // hex entropy is detected + try { + e = Entropy.fromString("0123456789ABCDEF"); + if (e.base.str != "hexadecimal") { + return "hexadecimal entropy not detected correctly"; + } + } + catch (e) { + return e.message; + } + // card entropy is detected + try { + e = Entropy.fromString("AC4DTHKS"); + if (e.base.str != "card") { + return "card entropy not detected correctly"; + } + } + catch (e) { + return e.message; + } + // entropy is case insensitive + try { + e = Entropy.fromString("aBcDeF"); + if (e.cleanStr != "aBcDeF") { + return "Entropy should not be case sensitive"; + } + } + catch (e) { + return e.message; + } + // dice entropy is converted to base6 + try { + e = Entropy.fromString("123456"); + if (e.cleanStr != "012345") { + return "Dice entropy is not automatically converted to base6"; + } + } + catch (e) { + return e.message; + } + // dice entropy is preferred to base6 if ambiguous + try { + e = Entropy.fromString("12345"); + if (e.base.str != "base 6 (dice)") { + return "dice not used as default over base 6"; + } + } + catch (e) { + return e.message; + } + // unused characters are ignored + try { + e = Entropy.fromString("fghijkl"); + if (e.cleanStr != "f") { + return "additional characters are not ignored"; + } + } + catch (e) { + return e.message; + } + // the lowest base is used by default + // 7 could be decimal or hexadecimal, but should be detected as decimal + try { + e = Entropy.fromString("7"); + if (e.base.str != "base 10") { + return "lowest base is not used"; + } + } + catch (e) { + return e.message; + } + // Leading zeros are retained + try { + e = Entropy.fromString("000A"); + if (e.cleanStr != "000A") { + return "Leading zeros are not retained"; + } + } + catch (e) { + return e.message; + } + // Leading zeros are correctly preserved for hex in binary string + try { + e = Entropy.fromString("2A"); + if (e.binaryStr != "00101010") { + return "Hex leading zeros are not correct in binary"; + } + } + catch (e) { + return e.message; + } + // Leading zeros are correctly preserved for base 6 in binary string + try { + e = Entropy.fromString("2"); + if (e.binaryStr != "010") { + return "Base 6 leading zeros are not correct in binary"; + } + } + catch (e) { + return e.message; + } + // Keyboard mashing results in weak entropy + // Despite being a long string, it's less than 30 bits of entropy + try { + e = Entropy.fromString("aj;se ifj; ask,dfv js;ifj"); + if (e.binaryStr.length >= 30) { + return "Keyboard mashing should produce weak entropy"; + } + } + catch (e) { + return e.message; + } + // Card entropy is used if every pair could be a card + try { + e = Entropy.fromString("4c3c2c"); + if (e.base.str != "card") { + return "Card entropy not used if all pairs are cards"; + } + } + catch (e) { + return e.message; + } + // Card entropy uses base 52 + // [ cards, binary ] + try { + var cards = [ + [ "ac", "00000" ], + [ "acac", "00000000000" ], + [ "acac2c", "00000000000000001" ], + [ "acks", "00000110011" ], + [ "acacks", "00000000000110011" ], + [ "2c", "000001" ], + [ "3d", "001111" ], + [ "4h", "011101" ], + [ "5s", "101011" ], + [ "6c", "000101" ], + [ "7d", "010011" ], + [ "8h", "100001" ], + [ "9s", "101111" ], + [ "tc", "001001" ], + [ "jd", "010111" ], + [ "qh", "100101" ], + [ "ks", "110011" ], + [ "ks2c", "101001011101" ], + [ "KS2C", "101001011101" ], + ]; + for (var i=0; i -1) { + console.log("Dice entropy value is shown instead of true base 6 value"); + fail(); + } + next(); + }); +}); +}, + +// The number of bits of entropy accumulated is shown +function() { +page.open(url, function(status) { + //[ entropy, bits ] + var tests = [ + [ "0000 0000 0000 0000 0000", "20" ], + [ "0", "1" ], + [ "0000", "4" ], + [ "6", "3" ], + [ "7", "4" ], + [ "8", "4" ], + [ "F", "4" ], + [ "29", "7" ], + [ "0A", "8" ], + [ "1A", "8" ], // hex is always multiple of 4 bits of entropy + [ "2A", "8" ], + [ "4A", "8" ], + [ "8A", "8" ], + [ "FA", "8" ], + [ "000A", "16" ], + [ "2220", "11" ], + [ "2221", "11" ], // uses dice, so entropy is actually 1110 + [ "2227", "14" ], + [ "222F", "16" ], + [ "FFFF", "16" ], + ] + // use entropy + page.evaluate(function(e) { + $(".use-entropy").prop("checked", true).trigger("change"); + }); + // Run each test + var nextTest = function runNextTest(i) { + var entropy = tests[i][0]; + var expected = tests[i][1]; + // set entropy + page.evaluate(function(e) { + $(".entropy").val(e).trigger("input"); + }, entropy); + // check the number of bits of entropy is shown + waitForEntropyFeedback(function() { + var entropyText = page.evaluate(function() { + return $(".entropy-error").text(); + }); + if (entropyText.indexOf("Have " + expected + " bits of entropy") == -1) { + console.log("Accumulated entropy is not shown correctly for " + entropy); + console.log(entropyText); + fail(); + } + var isLastTest = i == tests.length - 1; + if (isLastTest) { + next(); + } + else { + runNextTest(i+1); + } + }); + } + nextTest(0); +}); +}, + +// The number of bits of entropy to reach the next mnemonic strength is shown +function() { +page.open(url, function(status) { + // use entropy + page.evaluate(function() { + $(".use-entropy").prop("checked", true).trigger("change"); + $(".entropy").val("7654321").trigger("input"); + }); + // check the amount of additional entropy required is shown + waitForEntropyFeedback(function() { + var entropyText = page.evaluate(function() { + return $(".entropy-container").text(); + }); + if (entropyText.indexOf("3 more base 10 chars required") == -1) { + console.log("Additional entropy requirement is not shown"); + fail(); + } + next(); + }); +}); +}, + +// The next strength above 0-word mnemonics is considered extremely weak +// The next strength above 3-word mnemonics is considered very weak +// The next strength above 6-word mnemonics is considered weak +// The next strength above 9-word mnemonics is considered strong +// The next strength above 12-word mnemonics is considered very strong +// The next strength above 15-word mnemonics is considered extremely strong +function() { +page.open(url, function(status) { + var tests = [ + { + entropy: "A", + words: 0, + nextStrength: "an extremely weak", + }, + { + entropy: "AAAAAAAA", + words: 3, + nextStrength: "a very weak", + }, + { + entropy: "AAAAAAAA B", + words: 3, + nextStrength: "a very weak", + }, + { + entropy: "AAAAAAAA BBBBBBBB", + words: 6, + nextStrength: "a weak", + }, + { + entropy: "AAAAAAAA BBBBBBBB CCCCCCCC", + words: 9, + nextStrength: "a strong", + }, + { + entropy: "AAAAAAAA BBBBBBBB CCCCCCCC DDDDDDDD", + words: 12, + nextStrength: "a very strong", + }, + { + entropy: "AAAAAAAA BBBBBBBB CCCCCCCC DDDDDDDD EEEEEEEE", + words: 15, + nextStrength: "an extremely strong", + } + ]; + // use entropy + page.evaluate(function() { + $(".use-entropy").prop("checked", true).trigger("change"); + }); + var nextTest = function runNextTest(i) { + test = tests[i]; + page.evaluate(function(e) { + $(".addresses").empty(); + $(".phrase").val(""); + $(".entropy").val(e).trigger("input"); + }, test.entropy); + if (test.words == 0) { + var mnemonic = page.evaluate(function() { + return $(".phrase").val(); + }); + if (mnemonic.length > 0) { + console.log("Mnemonic length for " + test.nextStrength + " strength is not " + test.words); + console.log("Mnemonic: " + mnemonic); + fail(); + } + var isLastTest = i == tests.length - 1; + if (isLastTest) { + next(); + } + else { + runNextTest(i+1); + } + } + else { + waitForGenerate(function() { + // check the strength of the current mnemonic + var mnemonic = page.evaluate(function() { + return $(".phrase").val(); + }); + if (mnemonic.split(" ").length != test.words) { + console.log("Mnemonic length for " + test.nextStrength + " strength is not " + test.words); + console.log("Mnemonic: " + mnemonic); + fail(); + } + // check the strength of the next mnemonic is shown + var entropyText = page.evaluate(function() { + return $(".entropy-container").text(); + }); + if (entropyText.indexOf("required to generate " + test.nextStrength + " mnemonic") == -1) { + console.log("Strength indicator for " + test.nextStrength + " mnemonic is incorrect"); + fail(); + } + var isLastTest = i == tests.length - 1; + if (isLastTest) { + next(); + } + else { + runNextTest(i+1); + } + }); + } + } + nextTest(0); +}); +}, + +// Entropy is truncated from the right +function() { +page.open(url, function(status) { + var expected = "abandon abandon ability"; + // use entropy + page.evaluate(function() { + $(".use-entropy").prop("checked", true).trigger("change"); + var entropy = "00000000 00000000 00000000 00000000"; + entropy += "11111111 11111111 11111111 1111"; // Missing last byte, only first 8 bytes are used + $(".entropy").val(entropy).trigger("input"); + }); + // check the entropy is truncated from the right + waitForGenerate(function() { + var actual = page.evaluate(function() { + return $(".phrase").val(); + }); + if (actual != expected) { + console.log("Entropy is not truncated from the right"); + console.log("Expected: " + expected); + console.log("Got: " + actual); + fail(); + } + next(); + }); +}); +}, + +// Very large entropy results in very long mnemonics +function() { +page.open(url, function(status) { + // use entropy + page.evaluate(function() { + $(".use-entropy").prop("checked", true).trigger("change"); + var entropy = ""; + // Generate a very long entropy string + for (var i=0; i<33; i++) { + entropy += "AAAAAAAA"; // 3 words * 33 iterations = 99 words + } + $(".entropy").val(entropy).trigger("input"); + }); + // check the mnemonic is very long + waitForGenerate(function() { + var wordCount = page.evaluate(function() { + return $(".phrase").val().split(" ").length; + }); + if (wordCount != 99) { + console.log("Large entropy does not generate long mnemonic"); + console.log("Expected 99 words, got " + wordCount); + fail(); + } + next(); + }); +}); +}, + +// Is compatible with bip32jp entropy +// https://bip32jp.github.io/english/index.html +// NOTES: +// Is incompatible with: +// base 6 with leading zeros +// base 6 wth 12 words / 53 chars +// base 20 +function() { +page.open(url, function(status) { + var expected = "defy trip fatal jaguar mean rack rifle survey satisfy drift twist champion steel wife state furnace night consider glove olympic oblige donor novel left"; + // use entropy + page.evaluate(function() { + $(".use-entropy").prop("checked", true).trigger("change"); + var entropy = "123450123450123450123450123450123450123450123450123450123450123450123450123450123450123450123450123"; + $(".entropy").val(entropy).trigger("input"); + }); + // check the mnemonic matches the expected value from bip32jp + waitForGenerate(function() { + var actual = page.evaluate(function() { + return $(".phrase").val(); + }); + if (actual != expected) { + console.log("Mnemonic does not match bip32jp for base 6 entropy"); + console.log("Expected: " + expected); + console.log("Got: " + actual); + fail(); + } + next(); + }); +}); +}, + +// Blank entropy does not generate mnemonic or addresses +function() { +page.open(url, function(status) { + // use entropy + page.evaluate(function() { + $(".use-entropy").prop("checked", true).trigger("change"); + $(".entropy").val("").trigger("input"); + }); + waitForFeedback(function() { + // check there is no mnemonic + var phrase = page.evaluate(function() { + return $(".phrase").val(); + }); + if (phrase != "") { + console.log("Blank entropy does not result in blank mnemonic"); + console.log("Got: " + phrase); + fail(); + } + // check there are no addresses displayed + var addresses = page.evaluate(function() { + return $(".address").length; + }); + if (addresses != 0) { + console.log("Blank entropy does not result in zero addresses"); + fail(); + } + // Check the feedback says 'blank entropy' + var feedback = page.evaluate(function() { + return $(".feedback").text(); + }); + if (feedback != "Blank entropy") { + console.log("Blank entropy does not show feedback message"); + fail(); + } + next(); + }); +}); +}, + // If you wish to add more tests, do so here... // Here is a blank test template