Mnemonic words Known and target address known but order missing - Please help

[iconbtcx]

Hai friends,

                  i Got a project from my friend he has a client who has 2500btc in it and he has the 12 words mnemonics but when he is trying to restore the wallet through blockchain its showing error invalid bip39 checksum, i need any gpu based mnemonic recovery programn, as they asked me to keep project confidential i cant share the words though but i am happy to share btc address.
Btc address:- bc1qlmal276kkvrkn36m33xvlylfgqspcdkp0l2zsz
Kindly help me to recover i am trying powel gowny lost word in permuatation check mode first one to thousand address but gpu programn would be better cpu based programns taking long time

I tried to build jhoncartnell97 bip39-solver-gpu but its throwing some build errors
Those who assist seriously in recovering the mnemonics and btc a good reward will be promised
Thank you
U Kosal Ram
ICONBTCX

[1714488398]

1714488398

[Zaguru12]

Yes it will actually give an invalid checksum because the words are arranged in wrong order. You can use the btcrecover to get the arrangement check here https://btcrecover.readthedocs.io/en/latest/.

With the address format know it will be a bit easier, what you do is follow the command line for a segwit address (P2PWKH) recovery because that’s the format for your address

[iconbtcx]

Hai guys,

           Thanks for your suggestions but btcrecover is replacing seeds with unknown words like 4 phases i tried its not that much worth the shot i think and finder outer also bit slow and systems hang up, its also not that much effective because we dont know exact path location of address means m/84/0/0/0-1000 it may be any where in the first 1000 address,  i tried all these methods please i need if someone able to developed @jhoncartnell97 bip39-solver-gpu rust code when i am trying to build programn it throwing erros.
Guys please dont worry about reward i am a man of my word sure whom help i will definitely give some good reward.
Thank you
U Kosal Ram
ICONBTCX

[pbies]

This can be done with itertools in Python.

I have already mixing script to do that.

[iconbtcx]

Mizogg bro has given me one its excellent one but taking long time it takes 2 days just to move to fourth position he developed an excellent code permutation and iter based
We need some solid gpu code bro we have lot of gpus for scrambled mnemonic recovery

[Pmalek]

Does the client know the position of any of the words of the seed phrase or does he not have any idea what goes where? It would certainly speed things up if he knew, at least, some of the words. It's good that you have the funded address. I still think that BTCrecover is the way to go here. You can take a look at this guide that concerns the recovery of seed words.

If nothing else works, you could use a trusted paid service. Dave's wallet recovery services have been around for years, and he knows what he is doing. If you and your friend can't manage yourselves, contact Dave.
 
https://bitcointalk.org/index.php?topic=240779.0
https://www.walletrecoveryservices.com/

Someone who knows much more than me about these things estimated a long time ago that it would take 200 years to bruteforce the order of a 24-word seed. Yours has 12 words, but it would still be a difficult task. And there have been advancements in computer tech since 2017. Anyways, good luck!

So, you have 24 words.

That means that you have 24 possibilities for the word in position number 1.

If you try each of those words in position number 1, that leaves 23 words to try in position number 2.

Try the first word, with each of the other 23 in the second position, then try the second word with each of the other 23 in the second position, then the third word with each of the other 23 in the second position and so on.

When you've done that, you'll have tried:24 X 23 = 552 different possibilities.

Each of those 552 possibilities will have 22 remaining words that you can try in the third position.

So that's:
552 X 22 = 12144 possible combinations of 3 out of the 24 words.
(Notice that's the same as 24 X 23 X 22 = 12144)

Then for each of those 12144 possibilities will have 21 remaining words that you can try in the third position

That's:
12144 X 21 = 255024 possible combinations of 4 out of the 24 words.
(Notice that's the same as 24 X 23 X 22  X 21= 255024)

Perhaps you can see now that as we continue, by the time you try all the 24 word combinations of 24 words, the pattern will repeat all the way to:
24 X 23 X 22 X 21 X 20 X 19 X 18 X 17 X 16 X 15 X 14 X 13 X 12 X 11 X 10 X 9 X 8 X 7 X 6 X 5 X 4 X 3 X 2 X 1 = ?
In maths that pattern is called a "factorial" and is represented as:
24!

If you do that multiplication, you'll find that the total number of combinations you'll have to try will be:
620448401733239439360000

That's about 6.2 X 10²³.

Lets assume that you have enough computing power to try 100 trillion combinations per second.

620448401733239439360000 combinations / 100000000000000 combinatins per second = 6204484017 seconds.

Since there are 60 seconds in a minute, that is:
6204484017 seconds / 60 seconds per minute = 103408066 minutes.

There are 60 minutes in an hour, so:
103408066 minutes / 60 minutes per hour = 1723467 hours.

There are 24 hours in a day...
1723467 hours / 24 hours per day = 71811 days.

There are about 365.25 days per year...
71811 days / 365.25 days per year = 196.6 years.

If you actually had the ability to try 100 trillion combinations per second, then it's going to take you nearly 200 years of trying non-stop 24 hours a day to try all the combinations.

If the number of attempts you can make per second is less, then obviously it's going to take you longer than that.


The only way you are going to be able to find the right combination in your lifetime is if you already have some of the words in the right order, or if you can remember what order some of the words belong in.  Knowing for certain the position of just 1 word reduces the effort required by a factor of 24.  Knowing for certain the position of just 2 words reduces the effort by a factor of 552.

Using our "100 trillion combinations per second" example, knowing for certain the position of 1 word reduces the time required to try all possibilities from 196.6 years to:
196.6 / 24 = 8.2 years.

Knowing for certain the position of 2 words reduces the time required to try all possibilities to:
196.6 / 552 = 0.36 years (about 4.3 months)

[satscraper]

Yours has 12 words, but it would still be a difficult task. And there have been advancements in computer tech since 2017. Anyways, good luck!

With the premise "you have enough computing power to try 100 trillion combinations per second" taken from your example it would be an easy task as 12 words allow only  4.790016∗10⁸
distinguishable permutations rather than 6.2044840173323943936∗10²³ as in the  case of 24 words.

What is the realistic computational power to perform   a single  12 of 12 permutation?

[DaveF]

Did you take a look at

https://btcrecover.readthedocs.io/en/latest/

and

https://btcrecover.readthedocs.io/en/latest/Usage_Examples/2020-05-02_Descrambling_a_12_word_seed/Example_Descrambling_a_12_word_seed/

Should give you a general idea of what to do, how to do it and how long it will take.
With videos.

-Dave

[iconbtcx]

Hai guys thanks for your support
As seeing the calculations you had shared with me
I would like to mention the words are not 24 its 12
all we need to do is permutation check in those words each words should replace only once in the sequence
so 12p12 is just 479001600 combos
I think its not impossible.
THanks for your concern all i need is a gpu based permutation check

[satscraper]

Did you take a look at

https://btcrecover.readthedocs.io/en/latest/

and

https://btcrecover.readthedocs.io/en/latest/Usage_Examples/2020-05-02_Descrambling_a_12_word_seed/Example_Descrambling_a_12_word_seed/

Should give you a general idea of what to do, how to do it and how long it will take.
With videos.

-Dave

Thanks. I watched that "Recover Scrambled 12 Word Seeds with BTCRecover" video and and was convinced in my correctness - the set  12 known words can be unscrabled with virtually no effort even with use of machine of moderate  computational power. It took something around 50 minutes for guy to descramble BIP39 Seed phrase and even less time in the case of Electrum seed.

[Pmalek]

Thanks. I watched that "Recover Scrambled 12 Word Seeds with BTCRecover" video and and was convinced in my correctness - the set  12 known words can be unscrabled with virtually no effort even with use of machine of moderate  computational power. It took something around 50 minutes for guy to descramble BIP39 Seed phrase and even less time in the case of Electrum seed.

I am surprised it's that quick. But on the other hand, all words are known, and there is no need to bruteforce unknown words in any positions. Is it a requirement for such a quick recovery to know an address that belongs to the seed or the script type?   

[satscraper]

Thanks. I watched that "Recover Scrambled 12 Word Seeds with BTCRecover" video and and was convinced in my correctness - the set  12 known words can be unscrabled with virtually no effort even with use of machine of moderate  computational power. It took something around 50 minutes for guy to descramble BIP39 Seed phrase and even less time in the case of Electrum seed.

I am surprised it's that quick. But on the other hand, all words are known, and there is no need to bruteforce unknown words in any positions. Is it a requirement for such a quick recovery to know an address that belongs to the seed or the script type?  

In fact , this is not surprising in those   4.790016∗10⁸ chances.

Address that belongs to the seed is among those  parameters taken required by seedrecover.py . Amidst them are also address limit  and derivation path. The latter is as important (I think) as address itself.

[nc50lc]

THanks for your concern all i need is a gpu based permutation check

The post above this quoted reply supports select GPUs in the form of --enable-opencl command line arg.
But it is still experimental so it may or may not work; in my test, it worked in electrum wallet password recovery but not in BIP39 seed.
You likely have a different GPU and specs anyways; in any case, any decent CPU can still solve it in reasonable time.

Additionally, since you don't know the derivation path of the address, using a larger --addr-limit can drastically reduce its speed.
Just find a way to reduce the addresses to cross-check by utilizing options like --mpk to significantly speed it up if you know your xpub and even better with --bip32-path.

[pbies]

Code:

#!/usr/bin/env python3

import itertools

words = ['word1', 'word2', 'word3', 'word4', 'word5', 'word6', 'word7', 'word8', 'word9', 'word10', 'word11', 'word12']
permutations = list(itertools.permutations(words))

Total number of permutations: 479001600

That's 479 M.

[satscraper]

Code:

#!/usr/bin/env python3

import itertools

words = ['word1', 'word2', 'word3', 'word4', 'word5', 'word6', 'word7', 'word8', 'word9', 'word10', 'word11', 'word12']
permutations = list(itertools.permutations(words))

Total number of permutations: 479001600

That's 479 M.

OP needs to find SEED relevant to address that holds his stash rather than to get the full  list of all possible  permutations pertaining to his 12 scrambled words , thus the script you suggested is, in fact, useless for him.

To find what OP wants he needs to run seedrecover.py (or similar script) that perfectly does his job.

[o_e_l_e_o]

This is trivial to do using btcrecover.

First of all create a new text file with one word of the seed phrase per line. Something along the lines of this:

Code:

one
two
three
four
five
six
seven
eight
nine
ten
eleven
twelve

Then run the following command using btcrecover:

Code:

python seedrecover.py --no-eta --no-dupchecks --mnemonic-length 12 --language EN --dsw  --wallet-type BIP39 --addr-limit 1000 --addrs bc1qlmal276kkvrkn36m33xvlylfgqspcdkp0l2zsz --tokenlist ./PATH/TO/YOUR/FILE.txt

This will check every address between m/84/0'/0'/0/0 and m/84'/0'/0'/0/999 for every valid combination of your 12 words. If this is very slow on your hardware, you can experiment using GPU acceleration by following the instructions here and adding the relevant arguments to your command: https://btcrecover.readthedocs.io/en/latest/GPU_Acceleration/

[iconbtcx]

Thanks brothers for your valuable support,
I counting on btcrecover seedrecover if i want to search of the address in definitive path shall i have to give option --bip32-path m/84'/0'/0'/0 or shall i avoid this, and please guide me how to enable multiple gpus using --opencl-devices ID1 ID2 like that with an example i have four gpus
THanks for your valuable support and hope its good and we can able to recover i promise everyone who tried to help surely get rewards.
Fingers crossed brothers

[iconbtcx]

https://imgur.com/a/NWBT4Jh
why its not working

[o_e_l_e_o]

Does it run if you leave out the --enable-opencl argument? If it does, then it probably means you haven't installed the correct drivers or libraries for your GPU.

[nc50lc]

I counting on btcrecover seedrecover if i want to search of the address in definitive path shall i have to give option --bip32-path m/84'/0'/0'/0 or shall i avoid this,

It'll be faster with it, in general it searches for the paths listed in "/derivationpath-lists/BTC.txt" regardless of the address type,
with --bip32-path arg or by commenting-out the unneeded lines, it will only search those 1000 address_index in one derivation path.

But you'll have to make sure that your wallet is using the specified path or you'll get false-negative result.