If I'm understanding what you're writing... you have something like:
- possible_word1(list of ~4-10 words)
- possible_word2(list of ~4-10 words)
- possible_word3(list of ~4-10 words)
...
- possible_word12(list of ~4-10 words)
and from the sounds of it, you actually 13 words? so, this is the "old" electrum seed format?
- possible_word1(list of ~4-10 words)
- possible_word2(list of ~4-10 words)
- possible_word3(list of ~4-10 words)
...
- possible_word12(list of ~4-10 words)
and from the sounds of it, you actually 13 words? so, this is the "old" electrum seed format?
It could also be a BIP39 seed with a one-word BIP38 password. OP did not clarify if each file corresponds to a word in the seed so it's possible that the order is also unknown and this is no different from having one file full of words.
Actually, we don't even know which wordlist is used which makes a big difference if the seed phrase is for a custom wordlist (otherwise I would not see the point of having a file full of BIP39 or Electrum words
)With some optimisation, and maybe porting to C or something faster than Python, you'd probably gain some performance benefits... I'm sure it's in the realms of reality to be able to do it within a matter of days? It really depends on how big your search space is... what are the exact number of words you have in each position?
It really depends on how big your search space is... what are the exact number of words you have in each position? Ultra modern processors (AMD Ryzen/ anything using Zen microarchitecture and Intel ice lake 10xxx have hardware accelerated SHA256 instructions which you can call from C using the __asm__ keyword: SHA256RNDS2, SHA256MSG1 and SHA256MSG2.