📅 Original date posted:2022-07-08
📝 Original message:> What do you do if the "first" word (of 12), happens to be the last word in
> the list alphabetically?
>
That couldn't happen. If one word is the very last from the wordlist, it
would end up at the end of your mnemonic once you rearrange your 12 words
alphabetically.
However!
(@vjudeu) Choosing 11 random words and then sorting them alphabetically
before assigning a checksum would reduce entropy considerably. If you think
about it, to bruteforce the entire keyspace one would only need to come up
with every possible combination of 11 words + 1 checksum. I'm not the best
at napkin math, but I think that leaves you with around 10 trillion
combinations, which would only take a couple months to exhaust with
hardware that can do 1 million guesses per second.
James
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.linuxfoundation.org/pipermail/bitcoin-dev/attachments/20220708/fa49a159/attachment.html>;
James MacWhyte [ARCHIVE] /
npub12t…pye9h
2023-06-07 23:11:17
in reply to nevent1q…7d2z
Author Public Key
npub12tjaqer27049ejmvf0f3yd7kq6p93gg6ecavgrczge4rlzf59y5q2pye9hPublished at
2023-06-07 23:11:17Event JSON
{
"id": "6f979e3035e789284a063cd1222aaabfe6aa57e4d03786b3ad2ece36117816e7",
"pubkey": "52e5d0646af3ea5ccb6c4bd31237d6068258a11ace3ac40f02466a3f89342928",
"created_at": 1686179477,
"kind": 1,
"tags": [
[
"e",
"eac87b4c91a108febb37fcfdedf34b8ebc91e557769313850338d8ae3e1c4c99",
"",
"root"
],
[
"e",
"d23496ea9ffc8837de5bfbc1ab9e41e841464d9f3a256a5a196704fd04fe3bd9",
"",
"reply"
],
[
"p",
"7ac0bd39b854f24cbf067103758f3a9d398c23832d6d75824d190ae35c6c23be"
]
],
"content": "📅 Original date posted:2022-07-08\n📝 Original message:\u003e What do you do if the \"first\" word (of 12), happens to be the last word in\n\u003e the list alphabetically?\n\u003e\n\nThat couldn't happen. If one word is the very last from the wordlist, it\nwould end up at the end of your mnemonic once you rearrange your 12 words\nalphabetically.\n\nHowever!\n\n(@vjudeu) Choosing 11 random words and then sorting them alphabetically\nbefore assigning a checksum would reduce entropy considerably. If you think\nabout it, to bruteforce the entire keyspace one would only need to come up\nwith every possible combination of 11 words + 1 checksum. I'm not the best\nat napkin math, but I think that leaves you with around 10 trillion\ncombinations, which would only take a couple months to exhaust with\nhardware that can do 1 million guesses per second.\n\nJames\n-------------- next part --------------\nAn HTML attachment was scrubbed...\nURL: \u003chttp://lists.linuxfoundation.org/pipermail/bitcoin-dev/attachments/20220708/fa49a159/attachment.html\u003e",
"sig": "7a481a844c7b05c8d4957eb736f18ab56db4ec143385b37c876754a64253f9129c06d8d5aacc62d3e150190e473933e14b943cf8c4cccda73971c3b731387ded"
}