Bruteforce partial electrum seed words - page 2.

BASE16

member

Activity: 180

Merit: 38

Here is how i do.
Put all words in a text file and load it into the filereader.
Split() strip() and trim() into array.
Then you rotate the words randomly and validate the resulting mnemonic.
If true verify it to the target address.
It's even easier because it will not load words that are not in the BIP39 word list so you can read in entire books, but will always end up with only the valid words.

eranglr

newbie

Activity: 47

Merit: 0

Quote from: BASE16 on February 08, 2021, 04:34:43 PM

You can also modify the autocomplete function.
This will normally 'predict' words when you start typing.
You could modify it in a way that you can type a * wildcard for the unknown letters and have it show a list with possible words from the known letter input.

https://i.ibb.co/YTtJWkc/autocomplete.png

Thanks, I already have a possible word list for every word of the seed (1.txt, 2.txt...13.txt).
I now trying to find a way to use those words to bruteforce the seed.

BASE16

member

Activity: 180

Merit: 38

You can also modify the autocomplete function.
This will normally 'predict' words when you start typing.
You could modify it in a way that you can type a * wildcard for the unknown letters and have it show a list with possible words from the known letter input.

eranglr

newbie

Activity: 47

Merit: 0

Quote from: BlackHatCoiner on February 08, 2021, 04:04:34 PM

Quote from: eranglr on February 08, 2021, 03:24:18 PM

I know it's possible bruteforce 4 missing words

Are you sure that this is possible? I know that for two electrum missing words, it can take around 20 seconds on an average pc. For three words it'll take 20*2048 = 40960 seconds which is equal with ~11.3 hours. But for 4 words... Oh boy. It'll take around 23,142 hours which is 964 days.

Quote from: eranglr on February 08, 2021, 03:24:18 PM

Let's say that I don't know any of the words, but for 12 words (out of 13) I know the last one or two letters, and for two words I know the first letter.
I also know their order and even some of their length.

You can surely reduce it, by a lot. But still, brute forcing by not knowing 4 out of 12 words isn't meant to be found.

Quote from: eranglr on February 08, 2021, 03:49:42 PM

So let's say that now I have 13 lists of possible words, is there a available tool that I can use with those words as input?

Are we talking 13 lists of mnemonics that don't have 4 words out of 12? It seems impossible to me the way you describe it.

Anyway, there is no program that can do your job, but if you have 13 lists of possible words then you can try FinderOuter. Instead of opening one window, open as many as you want and use a mouse scheduler for each window.

Thanks, I have 13 text files with possible words.
I don't see an option to use them in FinderOuter, any idea?

BASE16

member

Activity: 180

Merit: 38

Of course there is a program that can do it.
It's just all custom made to suit particular implementations.
That is why you have to tweak it by coding the word lengths and letters into the code one by one.
If you are talking about the black lives matters puzzle those runes are already decoded that way.

Here you have an example:

Code:

BlackHatCoiner

legendary

Activity: 1512

Merit: 7340

Farewell, Leo

Quote from: eranglr on February 08, 2021, 03:24:18 PM

I know it's possible bruteforce 4 missing words

Are you sure that this is possible? I know that for two electrum missing words, it can take around 20 seconds on an average pc. For three words it'll take 20*2048 = 40960 seconds which is equal with ~11.3 hours. But for 4 words... Oh boy. It'll take around 23,142 hours which is 964 days.

Quote from: eranglr on February 08, 2021, 03:24:18 PM

Let's say that I don't know any of the words, but for 12 words (out of 13) I know the last one or two letters, and for two words I know the first letter.
I also know their order and even some of their length.

You can surely reduce it, by a lot. But still, brute forcing by not knowing 4 out of 12 words isn't meant to be found.

Quote from: eranglr on February 08, 2021, 03:49:42 PM

So let's say that now I have 13 lists of possible words, is there a available tool that I can use with those words as input?

Are we talking 13 lists of mnemonics that don't have 4 words out of 12? It seems impossible to me the way you describe it.

Anyway, there is no program that can do your job, but if you have 13 lists of possible words then you can try FinderOuter. Instead of opening one window, open as many as you want and use a mouse scheduler for each window.

eranglr

newbie

Activity: 47

Merit: 0

Thanks.

So let's say that now I have 13 lists of possible words, is there a available tool that I can use with those words as input?

BASE16

member

Activity: 180

Merit: 38

Of course you can do if word

=='a' then you will get all words in the list with that letter at that position.

Very easy just take a few lines of code.

eranglr

newbie

Activity: 47

Merit: 0

Edit:
I have 13 text files with possible seed words (1.txt, 2.txt...13.txt). most of the files contain 4-10 words.
I'm looking for a way to brute-force the seed based on those text files.

I know it's possible bruteforce 4 missing words, but how about the following scenario:

Let's say that I don't know any of the words, but for 12 words (out of 13) I know the last one or two letters, and for two words I know the first letter.
I also know their order and even some of their length.

Is there a known tool that I can play with to solve such puzzle?

Topic: Bruteforce partial electrum seed words - page 2. (Read 386 times)