mirror of
https://github.com/OneKeyHQ/bip39.git
synced 2026-04-06 02:43:49 +00:00
1220 lines
39 KiB
JavaScript
1220 lines
39 KiB
JavaScript
(function() {
|
|
|
|
// mnemonics is populated as required by getLanguage
|
|
var mnemonics = { "english": new Mnemonic("english") };
|
|
var mnemonic = mnemonics["english"];
|
|
var seed = null;
|
|
var bip32RootKey = null;
|
|
var bip32ExtendedKey = null;
|
|
var network = bitcoin.networks.bitcoin;
|
|
var addressRowTemplate = $("#address-row-template");
|
|
|
|
var showIndex = true;
|
|
var showAddress = true;
|
|
var showPubKey = true;
|
|
var showPrivKey = true;
|
|
var showQr = false;
|
|
|
|
var entropyChangeTimeoutEvent = null;
|
|
var phraseChangeTimeoutEvent = null;
|
|
var rootKeyChangedTimeoutEvent = null;
|
|
|
|
var generationProcesses = [];
|
|
|
|
var DOM = {};
|
|
DOM.network = $(".network");
|
|
DOM.bip32Client = $("#bip32-client");
|
|
DOM.phraseNetwork = $("#network-phrase");
|
|
DOM.useEntropy = $(".use-entropy");
|
|
DOM.entropyContainer = $(".entropy-container");
|
|
DOM.entropy = $(".entropy");
|
|
DOM.entropyFiltered = DOM.entropyContainer.find(".filtered");
|
|
DOM.entropyType = DOM.entropyContainer.find(".type");
|
|
DOM.entropyStrength = DOM.entropyContainer.find(".strength");
|
|
DOM.entropyEventCount = DOM.entropyContainer.find(".event-count");
|
|
DOM.entropyBits = DOM.entropyContainer.find(".bits");
|
|
DOM.entropyBitsPerEvent = DOM.entropyContainer.find(".bits-per-event");
|
|
DOM.entropyWordCount = DOM.entropyContainer.find(".word-count");
|
|
DOM.entropyBinary = DOM.entropyContainer.find(".binary");
|
|
DOM.entropyMnemonicLength = DOM.entropyContainer.find(".mnemonic-length");
|
|
DOM.phrase = $(".phrase");
|
|
DOM.passphrase = $(".passphrase");
|
|
DOM.generateContainer = $(".generate-container");
|
|
DOM.generate = $(".generate");
|
|
DOM.seed = $(".seed");
|
|
DOM.rootKey = $(".root-key");
|
|
DOM.extendedPrivKey = $(".extended-priv-key");
|
|
DOM.extendedPubKey = $(".extended-pub-key");
|
|
DOM.bip32tab = $("#bip32-tab");
|
|
DOM.bip44tab = $("#bip44-tab");
|
|
DOM.bip32panel = $("#bip32");
|
|
DOM.bip44panel = $("#bip44");
|
|
DOM.bip32path = $("#bip32-path");
|
|
DOM.bip44path = $("#bip44-path");
|
|
DOM.bip44purpose = $("#bip44 .purpose");
|
|
DOM.bip44coin = $("#bip44 .coin");
|
|
DOM.bip44account = $("#bip44 .account");
|
|
DOM.bip44accountXprv = $("#bip44 .account-xprv");
|
|
DOM.bip44accountXpub = $("#bip44 .account-xpub");
|
|
DOM.bip44change = $("#bip44 .change");
|
|
DOM.generatedStrength = $(".generate-container .strength");
|
|
DOM.hardenedAddresses = $(".hardened-addresses");
|
|
DOM.addresses = $(".addresses");
|
|
DOM.rowsToAdd = $(".rows-to-add");
|
|
DOM.more = $(".more");
|
|
DOM.feedback = $(".feedback");
|
|
DOM.tab = $(".derivation-type a");
|
|
DOM.indexToggle = $(".index-toggle");
|
|
DOM.addressToggle = $(".address-toggle");
|
|
DOM.publicKeyToggle = $(".public-key-toggle");
|
|
DOM.privateKeyToggle = $(".private-key-toggle");
|
|
DOM.languages = $(".languages a");
|
|
DOM.qrContainer = $(".qr-container");
|
|
DOM.qrHider = DOM.qrContainer.find(".qr-hider");
|
|
DOM.qrImage = DOM.qrContainer.find(".qr-image");
|
|
DOM.qrHint = DOM.qrContainer.find(".qr-hint");
|
|
DOM.showQrEls = $("[data-show-qr]");
|
|
|
|
function init() {
|
|
// Events
|
|
DOM.network.on("change", networkChanged);
|
|
DOM.bip32Client.on("change", bip32ClientChanged);
|
|
DOM.useEntropy.on("change", setEntropyVisibility);
|
|
DOM.entropy.on("input", delayedEntropyChanged);
|
|
DOM.entropyMnemonicLength.on("change", entropyChanged);
|
|
DOM.phrase.on("input", delayedPhraseChanged);
|
|
DOM.passphrase.on("input", delayedPhraseChanged);
|
|
DOM.generate.on("click", generateClicked);
|
|
DOM.more.on("click", showMore);
|
|
DOM.rootKey.on("input", delayedRootKeyChanged);
|
|
DOM.bip32path.on("input", calcForDerivationPath);
|
|
DOM.bip44purpose.on("input", calcForDerivationPath);
|
|
DOM.bip44coin.on("input", calcForDerivationPath);
|
|
DOM.bip44account.on("input", calcForDerivationPath);
|
|
DOM.bip44change.on("input", calcForDerivationPath);
|
|
DOM.tab.on("shown.bs.tab", calcForDerivationPath);
|
|
DOM.hardenedAddresses.on("change", calcForDerivationPath);
|
|
DOM.indexToggle.on("click", toggleIndexes);
|
|
DOM.addressToggle.on("click", toggleAddresses);
|
|
DOM.publicKeyToggle.on("click", togglePublicKeys);
|
|
DOM.privateKeyToggle.on("click", togglePrivateKeys);
|
|
DOM.languages.on("click", languageChanged);
|
|
setQrEvents(DOM.showQrEls);
|
|
disableForms();
|
|
hidePending();
|
|
hideValidationError();
|
|
populateNetworkSelect();
|
|
populateClientSelect();
|
|
}
|
|
|
|
// Event handlers
|
|
|
|
function networkChanged(e) {
|
|
var networkIndex = e.target.value;
|
|
networks[networkIndex].onSelect();
|
|
if (seed != null) {
|
|
phraseChanged();
|
|
}
|
|
else {
|
|
rootKeyChanged();
|
|
}
|
|
}
|
|
|
|
function bip32ClientChanged(e) {
|
|
var clientIndex = DOM.bip32Client.val();
|
|
if (clientIndex == "custom") {
|
|
DOM.bip32path.prop("readonly", false);
|
|
}
|
|
else {
|
|
DOM.bip32path.prop("readonly", true);
|
|
clients[clientIndex].onSelect();
|
|
if (seed != null) {
|
|
phraseChanged();
|
|
}
|
|
else {
|
|
rootKeyChanged();
|
|
}
|
|
}
|
|
}
|
|
|
|
function setEntropyVisibility() {
|
|
if (isUsingOwnEntropy()) {
|
|
DOM.entropyContainer.removeClass("hidden");
|
|
DOM.generateContainer.addClass("hidden");
|
|
DOM.phrase.prop("readonly", true);
|
|
DOM.entropy.focus();
|
|
entropyChanged();
|
|
}
|
|
else {
|
|
DOM.entropyContainer.addClass("hidden");
|
|
DOM.generateContainer.removeClass("hidden");
|
|
DOM.phrase.prop("readonly", false);
|
|
hidePending();
|
|
}
|
|
}
|
|
|
|
function delayedPhraseChanged() {
|
|
hideValidationError();
|
|
showPending();
|
|
if (phraseChangeTimeoutEvent != null) {
|
|
clearTimeout(phraseChangeTimeoutEvent);
|
|
}
|
|
phraseChangeTimeoutEvent = setTimeout(phraseChanged, 400);
|
|
}
|
|
|
|
function phraseChanged() {
|
|
showPending();
|
|
hideValidationError();
|
|
setMnemonicLanguage();
|
|
// Get the mnemonic phrase
|
|
var phrase = DOM.phrase.val();
|
|
var errorText = findPhraseErrors(phrase);
|
|
if (errorText) {
|
|
showValidationError(errorText);
|
|
return;
|
|
}
|
|
// Calculate and display
|
|
var passphrase = DOM.passphrase.val();
|
|
calcBip32RootKeyFromSeed(phrase, passphrase);
|
|
calcForDerivationPath();
|
|
hidePending();
|
|
}
|
|
|
|
function delayedEntropyChanged() {
|
|
hideValidationError();
|
|
showPending();
|
|
if (entropyChangeTimeoutEvent != null) {
|
|
clearTimeout(entropyChangeTimeoutEvent);
|
|
}
|
|
entropyChangeTimeoutEvent = setTimeout(entropyChanged, 400);
|
|
}
|
|
|
|
function entropyChanged() {
|
|
// If blank entropy, clear mnemonic, addresses, errors
|
|
if (DOM.entropy.val().trim().length == 0) {
|
|
clearDisplay();
|
|
clearEntropyFeedback();
|
|
DOM.phrase.val("");
|
|
showValidationError("Blank entropy");
|
|
return;
|
|
}
|
|
// Get the current phrase to detect changes
|
|
var phrase = DOM.phrase.val();
|
|
// Set the phrase from the entropy
|
|
setMnemonicFromEntropy();
|
|
// Recalc addresses if the phrase has changed
|
|
var newPhrase = DOM.phrase.val();
|
|
if (newPhrase != phrase) {
|
|
if (newPhrase.length == 0) {
|
|
clearDisplay();
|
|
}
|
|
else {
|
|
phraseChanged();
|
|
}
|
|
}
|
|
else {
|
|
hidePending();
|
|
}
|
|
}
|
|
|
|
function delayedRootKeyChanged() {
|
|
// Warn if there is an existing mnemonic or passphrase.
|
|
if (DOM.phrase.val().length > 0 || DOM.passphrase.val().length > 0) {
|
|
if (!confirm("This will clear existing mnemonic and passphrase")) {
|
|
DOM.rootKey.val(bip32RootKey);
|
|
return
|
|
}
|
|
}
|
|
hideValidationError();
|
|
showPending();
|
|
// Clear existing mnemonic and passphrase
|
|
DOM.phrase.val("");
|
|
DOM.passphrase.val("");
|
|
seed = null;
|
|
if (rootKeyChangedTimeoutEvent != null) {
|
|
clearTimeout(rootKeyChangedTimeoutEvent);
|
|
}
|
|
rootKeyChangedTimeoutEvent = setTimeout(rootKeyChanged, 400);
|
|
}
|
|
|
|
function rootKeyChanged() {
|
|
showPending();
|
|
hideValidationError();
|
|
// Validate the root key TODO
|
|
var rootKeyBase58 = DOM.rootKey.val();
|
|
var errorText = validateRootKey(rootKeyBase58);
|
|
if (errorText) {
|
|
showValidationError(errorText);
|
|
return;
|
|
}
|
|
// Calculate and display
|
|
calcBip32RootKeyFromBase58(rootKeyBase58);
|
|
calcForDerivationPath();
|
|
}
|
|
|
|
function calcForDerivationPath() {
|
|
showPending();
|
|
clearAddressesList();
|
|
hideValidationError();
|
|
// Get the derivation path
|
|
var derivationPath = getDerivationPath();
|
|
var errorText = findDerivationPathErrors(derivationPath);
|
|
if (errorText) {
|
|
showValidationError(errorText);
|
|
return;
|
|
}
|
|
bip32ExtendedKey = calcBip32ExtendedKey(derivationPath);
|
|
if (bip44TabSelected()) {
|
|
displayBip44Info();
|
|
}
|
|
displayBip32Info();
|
|
hidePending();
|
|
}
|
|
|
|
function generateClicked() {
|
|
if (isUsingOwnEntropy()) {
|
|
return;
|
|
}
|
|
clearDisplay();
|
|
showPending();
|
|
setTimeout(function() {
|
|
setMnemonicLanguage();
|
|
var phrase = generateRandomPhrase();
|
|
if (!phrase) {
|
|
return;
|
|
}
|
|
phraseChanged();
|
|
}, 50);
|
|
}
|
|
|
|
function languageChanged() {
|
|
setTimeout(function() {
|
|
setMnemonicLanguage();
|
|
if (DOM.phrase.val().length > 0) {
|
|
var newPhrase = convertPhraseToNewLanguage();
|
|
DOM.phrase.val(newPhrase);
|
|
phraseChanged();
|
|
}
|
|
else {
|
|
DOM.generate.trigger("click");
|
|
}
|
|
}, 50);
|
|
}
|
|
|
|
function toggleIndexes() {
|
|
showIndex = !showIndex;
|
|
$("td.index span").toggleClass("invisible");
|
|
}
|
|
|
|
function toggleAddresses() {
|
|
showAddress = !showAddress;
|
|
$("td.address span").toggleClass("invisible");
|
|
}
|
|
|
|
function togglePublicKeys() {
|
|
showPubKey = !showPubKey;
|
|
$("td.pubkey span").toggleClass("invisible");
|
|
}
|
|
|
|
function togglePrivateKeys() {
|
|
showPrivKey = !showPrivKey;
|
|
$("td.privkey span").toggleClass("invisible");
|
|
}
|
|
|
|
// Private methods
|
|
|
|
function generateRandomPhrase() {
|
|
if (!hasStrongRandom()) {
|
|
var errorText = "This browser does not support strong randomness";
|
|
showValidationError(errorText);
|
|
return;
|
|
}
|
|
var numWords = parseInt(DOM.generatedStrength.val());
|
|
var strength = numWords / 3 * 32;
|
|
var words = mnemonic.generate(strength);
|
|
DOM.phrase.val(words);
|
|
return words;
|
|
}
|
|
|
|
function calcBip32RootKeyFromSeed(phrase, passphrase) {
|
|
seed = mnemonic.toSeed(phrase, passphrase);
|
|
bip32RootKey = bitcoin.HDNode.fromSeedHex(seed, network);
|
|
}
|
|
|
|
function calcBip32RootKeyFromBase58(rootKeyBase58) {
|
|
bip32RootKey = bitcoin.HDNode.fromBase58(rootKeyBase58, network);
|
|
}
|
|
|
|
function calcBip32ExtendedKey(path) {
|
|
// Check there's a root key to derive from
|
|
if (!bip32RootKey) {
|
|
return bip32RootKey;
|
|
}
|
|
var extendedKey = bip32RootKey;
|
|
// Derive the key from the path
|
|
var pathBits = path.split("/");
|
|
for (var i=0; i<pathBits.length; i++) {
|
|
var bit = pathBits[i];
|
|
var index = parseInt(bit);
|
|
if (isNaN(index)) {
|
|
continue;
|
|
}
|
|
var hardened = bit[bit.length-1] == "'";
|
|
var isPriv = "privKey" in extendedKey;
|
|
var invalidDerivationPath = hardened && !isPriv;
|
|
if (invalidDerivationPath) {
|
|
extendedKey = null;
|
|
}
|
|
else if (hardened) {
|
|
extendedKey = extendedKey.deriveHardened(index);
|
|
}
|
|
else {
|
|
extendedKey = extendedKey.derive(index);
|
|
}
|
|
}
|
|
return extendedKey
|
|
}
|
|
|
|
function showValidationError(errorText) {
|
|
DOM.feedback
|
|
.text(errorText)
|
|
.show();
|
|
}
|
|
|
|
function hideValidationError() {
|
|
DOM.feedback
|
|
.text("")
|
|
.hide();
|
|
}
|
|
|
|
function findPhraseErrors(phrase) {
|
|
// Preprocess the words
|
|
phrase = mnemonic.normalizeString(phrase);
|
|
var words = phraseToWordArray(phrase);
|
|
// Detect blank phrase
|
|
if (words.length == 0) {
|
|
return "Blank mnemonic";
|
|
}
|
|
// Check each word
|
|
for (var i=0; i<words.length; i++) {
|
|
var word = words[i];
|
|
var language = getLanguage();
|
|
if (WORDLISTS[language].indexOf(word) == -1) {
|
|
console.log("Finding closest match to " + word);
|
|
var nearestWord = findNearestWord(word);
|
|
return word + " not in wordlist, did you mean " + nearestWord + "?";
|
|
}
|
|
}
|
|
// Check the words are valid
|
|
var properPhrase = wordArrayToPhrase(words);
|
|
var isValid = mnemonic.check(properPhrase);
|
|
if (!isValid) {
|
|
return "Invalid mnemonic";
|
|
}
|
|
return false;
|
|
}
|
|
|
|
function validateRootKey(rootKeyBase58) {
|
|
try {
|
|
bitcoin.HDNode.fromBase58(rootKeyBase58);
|
|
}
|
|
catch (e) {
|
|
return "Invalid root key";
|
|
}
|
|
return "";
|
|
}
|
|
|
|
function getDerivationPath() {
|
|
if (bip44TabSelected()) {
|
|
var purpose = parseIntNoNaN(DOM.bip44purpose.val(), 44);
|
|
var coin = parseIntNoNaN(DOM.bip44coin.val(), 0);
|
|
var account = parseIntNoNaN(DOM.bip44account.val(), 0);
|
|
var change = parseIntNoNaN(DOM.bip44change.val(), 0);
|
|
var path = "m/";
|
|
path += purpose + "'/";
|
|
path += coin + "'/";
|
|
path += account + "'/";
|
|
path += change;
|
|
DOM.bip44path.val(path);
|
|
var derivationPath = DOM.bip44path.val();
|
|
console.log("Using derivation path from BIP44 tab: " + derivationPath);
|
|
return derivationPath;
|
|
}
|
|
else if (bip32TabSelected()) {
|
|
var derivationPath = DOM.bip32path.val();
|
|
console.log("Using derivation path from BIP32 tab: " + derivationPath);
|
|
return derivationPath;
|
|
}
|
|
else {
|
|
console.log("Unknown derivation path");
|
|
}
|
|
}
|
|
|
|
function findDerivationPathErrors(path) {
|
|
// TODO is not perfect but is better than nothing
|
|
// Inspired by
|
|
// https://github.com/bitcoin/bips/blob/master/bip-0032.mediawiki#test-vectors
|
|
// and
|
|
// https://github.com/bitcoin/bips/blob/master/bip-0032.mediawiki#extended-keys
|
|
var maxDepth = 255; // TODO verify this!!
|
|
var maxIndexValue = Math.pow(2, 31); // TODO verify this!!
|
|
if (path[0] != "m") {
|
|
return "First character must be 'm'";
|
|
}
|
|
if (path.length > 1) {
|
|
if (path[1] != "/") {
|
|
return "Separator must be '/'";
|
|
}
|
|
var indexes = path.split("/");
|
|
if (indexes.length > maxDepth) {
|
|
return "Derivation depth is " + indexes.length + ", must be less than " + maxDepth;
|
|
}
|
|
for (var depth = 1; depth<indexes.length; depth++) {
|
|
var index = indexes[depth];
|
|
var invalidChars = index.replace(/^[0-9]+'?$/g, "")
|
|
if (invalidChars.length > 0) {
|
|
return "Invalid characters " + invalidChars + " found at depth " + depth;
|
|
}
|
|
var indexValue = parseInt(index.replace("'", ""));
|
|
if (isNaN(depth)) {
|
|
return "Invalid number at depth " + depth;
|
|
}
|
|
if (indexValue > maxIndexValue) {
|
|
return "Value of " + indexValue + " at depth " + depth + " must be less than " + maxIndexValue;
|
|
}
|
|
}
|
|
}
|
|
// Check root key exists or else derivation path is useless!
|
|
if (!bip32RootKey) {
|
|
return "No root key";
|
|
}
|
|
// Check no hardened derivation path when using xpub keys
|
|
var hardened = path.indexOf("'") > -1;
|
|
var isXpubkey = !("privKey" in bip32RootKey);
|
|
if (hardened && isXpubkey) {
|
|
return "Hardened derivation path is invalid with xpub key";
|
|
}
|
|
return false;
|
|
}
|
|
|
|
function displayBip44Info() {
|
|
// Get the derivation path for the account
|
|
var purpose = parseIntNoNaN(DOM.bip44purpose.val(), 44);
|
|
var coin = parseIntNoNaN(DOM.bip44coin.val(), 0);
|
|
var account = parseIntNoNaN(DOM.bip44account.val(), 0);
|
|
var path = "m/";
|
|
path += purpose + "'/";
|
|
path += coin + "'/";
|
|
path += account + "'/";
|
|
// Calculate the account extended keys
|
|
var accountExtendedKey = calcBip32ExtendedKey(path);
|
|
var accountXprv = accountExtendedKey.toBase58();
|
|
var accountXpub = accountExtendedKey.toBase58(false);
|
|
// Display the extended keys
|
|
DOM.bip44accountXprv.val(accountXprv);
|
|
DOM.bip44accountXpub.val(accountXpub);
|
|
}
|
|
|
|
function displayBip32Info() {
|
|
// Display the key
|
|
DOM.seed.val(seed);
|
|
var rootKey = bip32RootKey.toBase58();
|
|
DOM.rootKey.val(rootKey);
|
|
var xprvkeyB58 = "NA";
|
|
if (bip32ExtendedKey.privKey) {
|
|
xprvkeyB58 = bip32ExtendedKey.toBase58();
|
|
}
|
|
var extendedPrivKey = xprvkeyB58;
|
|
DOM.extendedPrivKey.val(extendedPrivKey);
|
|
var extendedPubKey = bip32ExtendedKey.toBase58(false);
|
|
DOM.extendedPubKey.val(extendedPubKey);
|
|
// Display the addresses and privkeys
|
|
clearAddressesList();
|
|
displayAddresses(0, 20);
|
|
}
|
|
|
|
function displayAddresses(start, total) {
|
|
generationProcesses.push(new (function() {
|
|
|
|
var rows = [];
|
|
|
|
this.stop = function() {
|
|
for (var i=0; i<rows.length; i++) {
|
|
rows[i].shouldGenerate = false;
|
|
}
|
|
}
|
|
|
|
for (var i=0; i<total; i++) {
|
|
var index = i + start;
|
|
rows.push(new TableRow(index));
|
|
}
|
|
|
|
})());
|
|
}
|
|
|
|
function TableRow(index) {
|
|
|
|
var self = this;
|
|
this.shouldGenerate = true;
|
|
var useHardenedAddresses = DOM.hardenedAddresses.prop("checked");
|
|
|
|
function init() {
|
|
calculateValues();
|
|
}
|
|
|
|
function calculateValues() {
|
|
setTimeout(function() {
|
|
if (!self.shouldGenerate) {
|
|
return;
|
|
}
|
|
var key = "";
|
|
if (useHardenedAddresses) {
|
|
key = bip32ExtendedKey.deriveHardened(index);
|
|
}
|
|
else {
|
|
key = bip32ExtendedKey.derive(index);
|
|
}
|
|
var address = key.getAddress().toString();
|
|
var privkey = "NA";
|
|
if (key.privKey) {
|
|
privkey = key.privKey.toWIF(network);
|
|
}
|
|
var pubkey = key.pubKey.toHex();
|
|
var indexText = getDerivationPath() + "/" + index;
|
|
if (useHardenedAddresses) {
|
|
indexText = indexText + "'";
|
|
}
|
|
// Ethereum values are different
|
|
if (networks[DOM.network.val()].name == "Ethereum") {
|
|
var privKeyBuffer = key.privKey.d.toBuffer();
|
|
privkey = privKeyBuffer.toString('hex');
|
|
var addressBuffer = ethUtil.privateToAddress(privKeyBuffer);
|
|
var hexAddress = addressBuffer.toString('hex');
|
|
var checksumAddress = ethUtil.toChecksumAddress(hexAddress);
|
|
address = ethUtil.addHexPrefix(checksumAddress);
|
|
}
|
|
// Ripple values are different
|
|
if (networks[DOM.network.val()].name == "Ripple") {
|
|
privkey = convertRipplePriv(privkey);
|
|
address = convertRippleAdrr(address);
|
|
}
|
|
addAddressToList(indexText, address, pubkey, privkey);
|
|
}, 50)
|
|
}
|
|
|
|
init();
|
|
|
|
}
|
|
|
|
function showMore() {
|
|
var start = DOM.addresses.children().length;
|
|
var rowsToAdd = parseInt(DOM.rowsToAdd.val());
|
|
if (isNaN(rowsToAdd)) {
|
|
rowsToAdd = 20;
|
|
DOM.rowsToAdd.val("20");
|
|
}
|
|
if (rowsToAdd > 200) {
|
|
var msg = "Generating " + rowsToAdd + " rows could take a while. ";
|
|
msg += "Do you want to continue?";
|
|
if (!confirm(msg)) {
|
|
return;
|
|
}
|
|
}
|
|
displayAddresses(start, rowsToAdd);
|
|
}
|
|
|
|
function clearDisplay() {
|
|
clearAddressesList();
|
|
clearKey();
|
|
hideValidationError();
|
|
}
|
|
|
|
function clearAddressesList() {
|
|
DOM.addresses.empty();
|
|
stopGenerating();
|
|
}
|
|
|
|
function stopGenerating() {
|
|
while (generationProcesses.length > 0) {
|
|
var generation = generationProcesses.shift();
|
|
generation.stop();
|
|
}
|
|
}
|
|
|
|
function clearKey() {
|
|
DOM.rootKey.val("");
|
|
DOM.extendedPrivKey.val("");
|
|
DOM.extendedPubKey.val("");
|
|
}
|
|
|
|
function addAddressToList(indexText, address, pubkey, privkey) {
|
|
var row = $(addressRowTemplate.html());
|
|
// Elements
|
|
var indexCell = row.find(".index span");
|
|
var addressCell = row.find(".address span");
|
|
var pubkeyCell = row.find(".pubkey span");
|
|
var privkeyCell = row.find(".privkey span");
|
|
// Content
|
|
indexCell.text(indexText);
|
|
addressCell.text(address);
|
|
pubkeyCell.text(pubkey);
|
|
privkeyCell.text(privkey);
|
|
// Visibility
|
|
if (!showIndex) {
|
|
indexCell.addClass("invisible");
|
|
}
|
|
if (!showAddress) {
|
|
addressCell.addClass("invisible");
|
|
}
|
|
if (!showPubKey) {
|
|
pubkeyCell.addClass("invisible");
|
|
}
|
|
if (!showPrivKey) {
|
|
privkeyCell.addClass("invisible");
|
|
}
|
|
DOM.addresses.append(row);
|
|
var rowShowQrEls = row.find("[data-show-qr]");
|
|
setQrEvents(rowShowQrEls);
|
|
}
|
|
|
|
function hasStrongRandom() {
|
|
return 'crypto' in window && window['crypto'] !== null;
|
|
}
|
|
|
|
function disableForms() {
|
|
$("form").on("submit", function(e) {
|
|
e.preventDefault();
|
|
});
|
|
}
|
|
|
|
function parseIntNoNaN(val, defaultVal) {
|
|
var v = parseInt(val);
|
|
if (isNaN(v)) {
|
|
return defaultVal;
|
|
}
|
|
return v;
|
|
}
|
|
|
|
function showPending() {
|
|
DOM.feedback
|
|
.text("Calculating...")
|
|
.show();
|
|
}
|
|
|
|
function findNearestWord(word) {
|
|
var language = getLanguage();
|
|
var words = WORDLISTS[language];
|
|
var minDistance = 99;
|
|
var closestWord = words[0];
|
|
for (var i=0; i<words.length; i++) {
|
|
var comparedTo = words[i];
|
|
if (comparedTo.indexOf(word) == 0) {
|
|
return comparedTo;
|
|
}
|
|
var distance = Levenshtein.get(word, comparedTo);
|
|
if (distance < minDistance) {
|
|
closestWord = comparedTo;
|
|
minDistance = distance;
|
|
}
|
|
}
|
|
return closestWord;
|
|
}
|
|
|
|
function hidePending() {
|
|
DOM.feedback
|
|
.text("")
|
|
.hide();
|
|
}
|
|
|
|
function populateNetworkSelect() {
|
|
for (var i=0; i<networks.length; i++) {
|
|
var network = networks[i];
|
|
var option = $("<option>");
|
|
option.attr("value", i);
|
|
option.text(network.name);
|
|
DOM.phraseNetwork.append(option);
|
|
}
|
|
}
|
|
|
|
function populateClientSelect() {
|
|
for (var i=0; i<clients.length; i++) {
|
|
var client = clients[i];
|
|
var option = $("<option>");
|
|
option.attr("value", i);
|
|
option.text(client.name);
|
|
DOM.bip32Client.append(option);
|
|
}
|
|
}
|
|
|
|
function getLanguage() {
|
|
var defaultLanguage = "english";
|
|
// Try to get from existing phrase
|
|
var language = getLanguageFromPhrase();
|
|
// Try to get from url if not from phrase
|
|
if (language.length == 0) {
|
|
language = getLanguageFromUrl();
|
|
}
|
|
// Default to English if no other option
|
|
if (language.length == 0) {
|
|
language = defaultLanguage;
|
|
}
|
|
return language;
|
|
}
|
|
|
|
function getLanguageFromPhrase(phrase) {
|
|
// Check if how many words from existing phrase match a language.
|
|
var language = "";
|
|
if (!phrase) {
|
|
phrase = DOM.phrase.val();
|
|
}
|
|
if (phrase.length > 0) {
|
|
var words = phraseToWordArray(phrase);
|
|
var languageMatches = {};
|
|
for (l in WORDLISTS) {
|
|
// Track how many words match in this language
|
|
languageMatches[l] = 0;
|
|
for (var i=0; i<words.length; i++) {
|
|
var wordInLanguage = WORDLISTS[l].indexOf(words[i]) > -1;
|
|
if (wordInLanguage) {
|
|
languageMatches[l]++;
|
|
}
|
|
}
|
|
// Find languages with most word matches.
|
|
// This is made difficult due to commonalities between Chinese
|
|
// simplified vs traditional.
|
|
var mostMatches = 0;
|
|
var mostMatchedLanguages = [];
|
|
for (var l in languageMatches) {
|
|
var numMatches = languageMatches[l];
|
|
if (numMatches > mostMatches) {
|
|
mostMatches = numMatches;
|
|
mostMatchedLanguages = [l];
|
|
}
|
|
else if (numMatches == mostMatches) {
|
|
mostMatchedLanguages.push(l);
|
|
}
|
|
}
|
|
}
|
|
if (mostMatchedLanguages.length > 0) {
|
|
// Use first language and warn if multiple detected
|
|
language = mostMatchedLanguages[0];
|
|
if (mostMatchedLanguages.length > 1) {
|
|
console.warn("Multiple possible languages");
|
|
console.warn(mostMatchedLanguages);
|
|
}
|
|
}
|
|
}
|
|
return language;
|
|
}
|
|
|
|
function getLanguageFromUrl() {
|
|
for (var language in WORDLISTS) {
|
|
if (window.location.hash.indexOf(language) > -1) {
|
|
return language;
|
|
}
|
|
}
|
|
return "";
|
|
}
|
|
|
|
function setMnemonicLanguage() {
|
|
var language = getLanguage();
|
|
// Load the bip39 mnemonic generator for this language if required
|
|
if (!(language in mnemonics)) {
|
|
mnemonics[language] = new Mnemonic(language);
|
|
}
|
|
mnemonic = mnemonics[language];
|
|
}
|
|
|
|
function convertPhraseToNewLanguage() {
|
|
var oldLanguage = getLanguageFromPhrase();
|
|
var newLanguage = getLanguageFromUrl();
|
|
var oldPhrase = DOM.phrase.val();
|
|
var oldWords = phraseToWordArray(oldPhrase);
|
|
var newWords = [];
|
|
for (var i=0; i<oldWords.length; i++) {
|
|
var oldWord = oldWords[i];
|
|
var index = WORDLISTS[oldLanguage].indexOf(oldWord);
|
|
var newWord = WORDLISTS[newLanguage][index];
|
|
newWords.push(newWord);
|
|
}
|
|
newPhrase = wordArrayToPhrase(newWords);
|
|
return newPhrase;
|
|
}
|
|
|
|
// TODO look at jsbip39 - mnemonic.splitWords
|
|
function phraseToWordArray(phrase) {
|
|
var words = phrase.split(/\s/g);
|
|
var noBlanks = [];
|
|
for (var i=0; i<words.length; i++) {
|
|
var word = words[i];
|
|
if (word.length > 0) {
|
|
noBlanks.push(word);
|
|
}
|
|
}
|
|
return noBlanks;
|
|
}
|
|
|
|
// TODO look at jsbip39 - mnemonic.joinWords
|
|
function wordArrayToPhrase(words) {
|
|
var phrase = words.join(" ");
|
|
var language = getLanguageFromPhrase(phrase);
|
|
if (language == "japanese") {
|
|
phrase = words.join("\u3000");
|
|
}
|
|
return phrase;
|
|
}
|
|
|
|
function isUsingOwnEntropy() {
|
|
return DOM.useEntropy.prop("checked");
|
|
}
|
|
|
|
function setMnemonicFromEntropy() {
|
|
clearEntropyFeedback();
|
|
// Get entropy value
|
|
var entropyStr = DOM.entropy.val();
|
|
// Work out minimum base for entropy
|
|
var entropy = Entropy.fromString(entropyStr);
|
|
if (entropy.binaryStr.length == 0) {
|
|
return;
|
|
}
|
|
// Show entropy details
|
|
showEntropyFeedback(entropy);
|
|
// Use entropy hash if not using raw entropy
|
|
var bits = entropy.binaryStr;
|
|
var mnemonicLength = DOM.entropyMnemonicLength.val();
|
|
if (mnemonicLength != "raw") {
|
|
// Get bits by hashing entropy with SHA256
|
|
var hash = sjcl.hash.sha256.hash(entropy.cleanStr);
|
|
var hex = sjcl.codec.hex.fromBits(hash);
|
|
bits = BigInteger.parse(hex, 16).toString(2);
|
|
while (bits.length % 256 != 0) {
|
|
bits = "0" + bits;
|
|
}
|
|
// Truncate hash to suit number of words
|
|
mnemonicLength = parseInt(mnemonicLength);
|
|
var numberOfBits = 32 * mnemonicLength / 3;
|
|
bits = bits.substring(0, numberOfBits);
|
|
}
|
|
// Discard trailing entropy
|
|
var bitsToUse = Math.floor(bits.length / 32) * 32;
|
|
var start = bits.length - bitsToUse;
|
|
var binaryStr = bits.substring(start);
|
|
// Convert entropy string to numeric array
|
|
var entropyArr = [];
|
|
for (var i=0; i<binaryStr.length / 8; i++) {
|
|
var byteAsBits = binaryStr.substring(i*8, i*8+8);
|
|
var entropyByte = parseInt(byteAsBits, 2);
|
|
entropyArr.push(entropyByte)
|
|
}
|
|
// Convert entropy array to mnemonic
|
|
var phrase = mnemonic.toMnemonic(entropyArr);
|
|
// Set the mnemonic in the UI
|
|
DOM.phrase.val(phrase);
|
|
}
|
|
|
|
function clearEntropyFeedback() {
|
|
DOM.entropyStrength.text("...");
|
|
DOM.entropyType.text("");
|
|
DOM.entropyWordCount.text("0");
|
|
DOM.entropyEventCount.text("0");
|
|
DOM.entropyBitsPerEvent.text("0");
|
|
DOM.entropyBits.text("0");
|
|
DOM.entropyFiltered.html(" ");
|
|
DOM.entropyBinary.html(" ");
|
|
}
|
|
|
|
function showEntropyFeedback(entropy) {
|
|
var numberOfBits = entropy.binaryStr.length;
|
|
var strength = "extremely weak";
|
|
if (numberOfBits >= 64) {
|
|
strength = "very weak";
|
|
}
|
|
if (numberOfBits >= 96) {
|
|
strength = "weak";
|
|
}
|
|
if (numberOfBits >= 128) {
|
|
strength = "strong";
|
|
}
|
|
if (numberOfBits >= 160) {
|
|
strength = "very strong";
|
|
}
|
|
if (numberOfBits >= 192) {
|
|
strength = "extremely strong";
|
|
}
|
|
// If time to crack is less than one day, and password is considered
|
|
// strong or better based on the number of bits, rename strength to
|
|
// 'easily cracked'.
|
|
try {
|
|
var z = zxcvbn(entropy.base.parts.join(""));
|
|
var timeToCrack = z.crack_times_seconds.offline_fast_hashing_1e10_per_second;
|
|
if (timeToCrack < 86400 && entropy.binaryStr.length >= 128) {
|
|
strength = "easily cracked";
|
|
if (z.feedback.warning != "") {
|
|
strength = strength + " - " + z.feedback.warning;
|
|
};
|
|
}
|
|
}
|
|
catch (e) {
|
|
strength = "unknown";
|
|
console.log("Error detecting entropy strength with zxcvbn:");
|
|
console.log(e);
|
|
}
|
|
var entropyTypeStr = getEntropyTypeStr(entropy);
|
|
var wordCount = Math.floor(numberOfBits / 32) * 3;
|
|
var bitsPerEvent = entropy.bitsPerEvent.toFixed(2);
|
|
DOM.entropyFiltered.html(entropy.cleanHtml);
|
|
DOM.entropyType.text(entropyTypeStr);
|
|
DOM.entropyStrength.text(strength);
|
|
DOM.entropyEventCount.text(entropy.base.ints.length);
|
|
DOM.entropyBits.text(numberOfBits);
|
|
DOM.entropyWordCount.text(wordCount);
|
|
DOM.entropyBinary.text(entropy.binaryStr);
|
|
DOM.entropyBitsPerEvent.text(bitsPerEvent);
|
|
}
|
|
|
|
function getEntropyTypeStr(entropy) {
|
|
var typeStr = entropy.base.str;
|
|
// Add some detail if these are cards
|
|
if (entropy.base.asInt == 52) {
|
|
var cardDetail = []; // array of message strings
|
|
// Detect duplicates
|
|
var dupes = [];
|
|
var dupeTracker = {};
|
|
for (var i=0; i<entropy.base.parts.length; i++) {
|
|
var card = entropy.base.parts[i];
|
|
var cardUpper = card.toUpperCase();
|
|
if (cardUpper in dupeTracker) {
|
|
dupes.push(card);
|
|
}
|
|
dupeTracker[cardUpper] = true;
|
|
}
|
|
if (dupes.length > 0) {
|
|
var dupeWord = "duplicates";
|
|
if (dupes.length == 1) {
|
|
dupeWord = "duplicate";
|
|
}
|
|
var msg = dupes.length + " " + dupeWord + ": " + dupes.slice(0,3).join(" ");
|
|
if (dupes.length > 3) {
|
|
msg += "...";
|
|
}
|
|
cardDetail.push(msg);
|
|
}
|
|
// Detect full deck
|
|
var uniqueCards = [];
|
|
for (var uniqueCard in dupeTracker) {
|
|
uniqueCards.push(uniqueCard);
|
|
}
|
|
if (uniqueCards.length == 52) {
|
|
cardDetail.unshift("full deck");
|
|
}
|
|
// Detect missing cards
|
|
var values = "A23456789TJQK";
|
|
var suits = "CDHS";
|
|
var missingCards = [];
|
|
for (var i=0; i<suits.length; i++) {
|
|
for (var j=0; j<values.length; j++) {
|
|
var card = values[j] + suits[i];
|
|
if (!(card in dupeTracker)) {
|
|
missingCards.push(card);
|
|
}
|
|
}
|
|
}
|
|
// Display missing cards if six or less, ie clearly going for full deck
|
|
if (missingCards.length > 0 && missingCards.length <= 6) {
|
|
var msg = missingCards.length + " missing: " + missingCards.slice(0,3).join(" ");
|
|
if (missingCards.length > 3) {
|
|
msg += "...";
|
|
}
|
|
cardDetail.push(msg);
|
|
}
|
|
// Add card details to typeStr
|
|
if (cardDetail.length > 0) {
|
|
typeStr += " (" + cardDetail.join(", ") + ")";
|
|
}
|
|
}
|
|
return typeStr;
|
|
}
|
|
|
|
function setQrEvents(els) {
|
|
els.on("mouseenter", createQr);
|
|
els.on("mouseleave", destroyQr);
|
|
els.on("click", toggleQr);
|
|
}
|
|
|
|
function createQr(e) {
|
|
var content = e.target.textContent || e.target.value;
|
|
if (content) {
|
|
var size = 130;
|
|
DOM.qrImage.qrcode({width: size, height: size, text: content});
|
|
if (!showQr) {
|
|
DOM.qrHider.addClass("hidden");
|
|
}
|
|
else {
|
|
DOM.qrHider.removeClass("hidden");
|
|
}
|
|
DOM.qrContainer.removeClass("hidden");
|
|
}
|
|
}
|
|
|
|
function destroyQr() {
|
|
DOM.qrImage.text("");
|
|
DOM.qrContainer.addClass("hidden");
|
|
}
|
|
|
|
function toggleQr() {
|
|
showQr = !showQr;
|
|
DOM.qrHider.toggleClass("hidden");
|
|
DOM.qrHint.toggleClass("hidden");
|
|
}
|
|
|
|
function bip44TabSelected() {
|
|
return DOM.bip44tab.hasClass("active");
|
|
}
|
|
|
|
function bip32TabSelected() {
|
|
return DOM.bip32tab.hasClass("active");
|
|
}
|
|
|
|
var networks = [
|
|
{
|
|
name: "Bitcoin",
|
|
onSelect: function() {
|
|
network = bitcoin.networks.bitcoin;
|
|
DOM.bip44coin.val(0);
|
|
},
|
|
},
|
|
{
|
|
name: "Bitcoin Testnet",
|
|
onSelect: function() {
|
|
network = bitcoin.networks.testnet;
|
|
DOM.bip44coin.val(1);
|
|
},
|
|
},
|
|
{
|
|
name: "CLAM",
|
|
onSelect: function() {
|
|
network = bitcoin.networks.clam;
|
|
DOM.bip44coin.val(23);
|
|
},
|
|
},
|
|
{
|
|
name: "Dogecoin",
|
|
onSelect: function() {
|
|
network = bitcoin.networks.dogecoin;
|
|
DOM.bip44coin.val(3);
|
|
},
|
|
},
|
|
{
|
|
name: "DASH",
|
|
onSelect: function() {
|
|
network = bitcoin.networks.dash;
|
|
DOM.bip44coin.val(5);
|
|
},
|
|
},
|
|
{
|
|
name: "Ethereum",
|
|
onSelect: function() {
|
|
network = bitcoin.networks.bitcoin;
|
|
DOM.bip44coin.val(60);
|
|
},
|
|
},
|
|
{
|
|
name: "GAME",
|
|
onSelect: function() {
|
|
network = bitcoin.networks.game;
|
|
DOM.bip44coin.val(101);
|
|
},
|
|
},
|
|
{
|
|
name: "Jumbucks",
|
|
onSelect: function() {
|
|
network = bitcoin.networks.jumbucks;
|
|
DOM.bip44coin.val(26);
|
|
},
|
|
},
|
|
{
|
|
name: "Litecoin",
|
|
onSelect: function() {
|
|
network = bitcoin.networks.litecoin;
|
|
DOM.bip44coin.val(2);
|
|
},
|
|
},
|
|
{
|
|
name: "Namecoin",
|
|
onSelect: function() {
|
|
network = bitcoin.networks.namecoin;
|
|
DOM.bip44coin.val(7);
|
|
},
|
|
},
|
|
{
|
|
name: "Peercoin",
|
|
onSelect: function() {
|
|
network = bitcoin.networks.peercoin;
|
|
DOM.bip44coin.val(6);
|
|
},
|
|
},
|
|
{
|
|
name: "Ripple",
|
|
onSelect: function() {
|
|
network = bitcoin.networks.bitcoin;
|
|
DOM.bip44coin.val(144);
|
|
},
|
|
},
|
|
{
|
|
name: "ShadowCash",
|
|
onSelect: function() {
|
|
network = bitcoin.networks.shadow;
|
|
DOM.bip44coin.val(35);
|
|
},
|
|
},
|
|
{
|
|
name: "ShadowCash Testnet",
|
|
onSelect: function() {
|
|
network = bitcoin.networks.shadowtn;
|
|
DOM.bip44coin.val(1);
|
|
},
|
|
},
|
|
{
|
|
name: "Viacoin",
|
|
onSelect: function() {
|
|
network = bitcoin.networks.viacoin;
|
|
DOM.bip44coin.val(14);
|
|
},
|
|
},
|
|
{
|
|
name: "Viacoin Testnet",
|
|
onSelect: function() {
|
|
network = bitcoin.networks.viacointestnet;
|
|
DOM.bip44coin.val(1);
|
|
},
|
|
},
|
|
]
|
|
|
|
var clients = [
|
|
{
|
|
name: "Bitcoin Core",
|
|
onSelect: function() {
|
|
DOM.bip32path.val("m/0'/0'");
|
|
DOM.hardenedAddresses.prop('checked', true);
|
|
},
|
|
},
|
|
{
|
|
name: "blockchain.info",
|
|
onSelect: function() {
|
|
DOM.bip32path.val("m/44'/0'/0'");
|
|
DOM.hardenedAddresses.prop('checked', false);
|
|
},
|
|
},
|
|
{
|
|
name: "MultiBit HD",
|
|
onSelect: function() {
|
|
DOM.bip32path.val("m/0'/0");
|
|
DOM.hardenedAddresses.prop('checked', false);
|
|
},
|
|
}
|
|
]
|
|
|
|
init();
|
|
|
|
})();
|