maxTime = testMaxTime;
}
var origFeedback = page.evaluate(function() {
- return $(".entropy-feedback").text();
+ return $(".entropy-container").text();
});
var start = new Date().getTime();
var wait = function keepWaiting() {
return;
}
var feedback = page.evaluate(function() {
- return $(".entropy-feedback").text();
+ return $(".entropy-container").text();
});
var hasFinished = feedback != origFeedback;
if (hasFinished) {
"dice",
"base 10",
"hexadecimal",
+ "cards",
];
for (var i=0; i<options.length; i++) {
var option = options[i];
// check the number of bits of entropy is shown
waitForEntropyFeedback(function() {
var entropyText = page.evaluate(function() {
- return $(".entropy-feedback").text();
+ return $(".entropy-container").text();
});
if (entropyText.replace(/\s/g,"").indexOf("Bits" + expected) == -1) {
console.log("Accumulated entropy is not shown correctly for " + entropy);
});
},
-// 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
+// There is feedback provided about the supplied entropy
function() {
page.open(url, function(status) {
var tests = [
{
entropy: "A",
+ filtered: "A",
+ type: "hexadecimal",
+ events: 1,
+ bits: 4,
words: 0,
strength: "extremely weak",
},
{
entropy: "AAAAAAAA",
+ filtered: "AAAAAAAA",
+ type: "hexadecimal",
+ events: 8,
+ bits: 32,
words: 3,
strength: "extremely weak",
},
{
entropy: "AAAAAAAA B",
+ filtered: "AAAAAAAAB",
+ type: "hexadecimal",
+ events: 9,
+ bits: 36,
words: 3,
strength: "extremely weak",
},
{
entropy: "AAAAAAAA BBBBBBBB",
+ filtered: "AAAAAAAABBBBBBBB",
+ type: "hexadecimal",
+ events: 16,
+ bits: 64,
words: 6,
strength: "very weak",
},
{
entropy: "AAAAAAAA BBBBBBBB CCCCCCCC",
+ filtered: "AAAAAAAABBBBBBBBCCCCCCCC",
+ type: "hexadecimal",
+ events: 24,
+ bits: 96,
words: 9,
strength: "weak",
},
{
entropy: "AAAAAAAA BBBBBBBB CCCCCCCC DDDDDDDD",
+ filtered: "AAAAAAAABBBBBBBBCCCCCCCCDDDDDDDD",
+ type: "hexadecimal",
+ events: 32,
+ bits: 128,
+ words: 12,
+ strength: "easily cracked",
+ },
+ {
+ entropy: "AAAAAAAA BBBBBBBB CCCCCCCC DDDDDDDA",
+ filtered: "AAAAAAAABBBBBBBBCCCCCCCCDDDDDDDA",
+ type: "hexadecimal",
+ events: 32,
+ bits: 128,
words: 12,
strength: "strong",
},
{
- entropy: "AAAAAAAA BBBBBBBB CCCCCCCC DDDDDDDD EEEEEEEE",
+ entropy: "AAAAAAAA BBBBBBBB CCCCCCCC DDDDDDDA EEEEEEEE",
+ filtered: "AAAAAAAABBBBBBBBCCCCCCCCDDDDDDDAEEEEEEEE",
+ type: "hexadecimal",
+ events: 40,
+ bits: 160,
words: 15,
strength: "very strong",
},
{
- entropy: "AAAAAAAA BBBBBBBB CCCCCCCC DDDDDDDD EEEEEEEE FFFFFFFF",
+ entropy: "AAAAAAAA BBBBBBBB CCCCCCCC DDDDDDDA EEEEEEEE FFFFFFFF",
+ filtered: "AAAAAAAABBBBBBBBCCCCCCCCDDDDDDDAEEEEEEEEFFFFFFFF",
+ type: "hexadecimal",
+ events: 48,
+ bits: 192,
words: 18,
strength: "extremely strong",
- }
+ },
];
// use entropy
page.evaluate(function() {
$(".use-entropy").prop("checked", true).trigger("change");
});
var nextTest = function runNextTest(i) {
+ function getFeedbackError(expected, actual) {
+ if (actual.indexOf(expected.filtered) == -1) {
+ return "Filtered value not in feedback";
+ }
+ if (actual.indexOf(expected.type) == -1) {
+ return "Entropy type not in feedback";
+ }
+ if (actual.indexOf(expected.events) == -1) {
+ return "Event count not in feedback";
+ }
+ if (actual.indexOf(expected.bits) == -1) {
+ return "Bit count not in feedback";
+ }
+ if (actual.indexOf(expected.strength) == -1) {
+ return "Strength not in feedback";
+ }
+ return false;
+ }
test = tests[i];
page.evaluate(function(e) {
$(".addresses").empty();
$(".phrase").val("");
$(".entropy").val(e).trigger("input");
}, test.entropy);
- if (test.words == 0) {
+ waitForEntropyFeedback(function() {
var mnemonic = page.evaluate(function() {
return $(".phrase").val();
});
- if (mnemonic.length > 0) {
- console.log("Mnemonic length for " + test.strength + " strength is not " + test.words);
- console.log("Mnemonic: " + mnemonic);
+ // Check mnemonic length
+ if (test.words == 0) {
+ if (mnemonic.length > 0) {
+ console.log("Mnemonic length for " + test.strength + " strength is not " + test.words);
+ console.log("Mnemonic: " + mnemonic);
+ fail();
+ }
+ }
+ else {
+ if (mnemonic.split(" ").length != test.words) {
+ console.log("Mnemonic length for " + test.strength + " strength is not " + test.words);
+ console.log("Mnemonic: " + mnemonic);
+ fail();
+ }
+ }
+ // check feedback
+ var feedback = page.evaluate(function() {
+ return $(".entropy-container").text();
+ });
+ var feedbackError = getFeedbackError(test, feedback);
+ if (feedbackError) {
+ console.log("Entropy feedback for " + test.entropy + " returned error");
+ console.log(feedbackError);
fail();
}
+ // Run next test
var isLastTest = i == tests.length - 1;
if (isLastTest) {
next();
else {
runNextTest(i+1);
}
- }
- else {
- waitForGenerate(function() {
- // check the number of words in the current mnemonic
- var mnemonic = page.evaluate(function() {
- return $(".phrase").val();
- });
- if (mnemonic.split(" ").length != test.words) {
- console.log("Mnemonic length for " + test.strength + " strength is not " + test.words);
- console.log("Mnemonic: " + mnemonic);
- fail();
- }
- // check the strength of the mnemonic is shown
- var entropyText = page.evaluate(function() {
- return $(".entropy-container").text();
- });
- if (entropyText.indexOf(test.strength) == -1) {
- console.log("Strength indicator for " + test.strength + " 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
+// Entropy is truncated from the left
function() {
page.open(url, function(status) {
- var expected = "abandon abandon ability";
+ var expected = "avocado zoo zone";
// 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 += "11111111 11111111 11111111 1111"; // Missing last byte
$(".entropy").val(entropy).trigger("input");
});
// check the entropy is truncated from the right
// 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) {
});
},
+// Mnemonic length can be selected even for weak entropy
+function() {
+page.open(url, function(status) {
+ // use entropy
+ page.evaluate(function() {
+ $(".use-entropy").prop("checked", true).trigger("change");
+ $(".entropy").val("012345");
+ $(".mnemonic-length").val("18").trigger("change");
+ });
+ // check the mnemonic is the correct length
+ waitForGenerate(function() {
+ var phrase = page.evaluate(function() {
+ return $(".phrase").val();
+ });
+ var numberOfWords = phrase.split(/\s/g).length;
+ if (numberOfWords != 18) {
+ console.log("Weak entropy cannot be overridden to give 18 word mnemonic");
+ console.log(phrase);
+ fail();
+ }
+ next();
+ });
+});
+},
+
// If you wish to add more tests, do so here...
// Here is a blank test template