Skip to main content
Include information from meshcollider's comment
Source Link
Murch
  • 77.8k
  • 35
  • 190
  • 641

There are only 720 (6!) possible ways to order six words, so you could write a script that generates them all and then checks whether there are any transactions associated with any.

As @meshcollider pointed out in a comment, you could then use the 4-bit checksum that mnemonic seeds include to reduce this set of possible combinations even further to about 45 seeds for which you'd need to check the addresses.

There are only 720 (6!) possible ways to order six words, so you could write a script that generates them all and then checks whether there are any transactions associated with any.

There are only 720 (6!) possible ways to order six words, so you could write a script that generates them all and then checks whether there are any transactions associated with any.

As @meshcollider pointed out in a comment, you could then use the 4-bit checksum that mnemonic seeds include to reduce this set of possible combinations even further to about 45 seeds for which you'd need to check the addresses.

Source Link
Murch
  • 77.8k
  • 35
  • 190
  • 641

There are only 720 (6!) possible ways to order six words, so you could write a script that generates them all and then checks whether there are any transactions associated with any.