Topic: Mnemonic words Known and target address known but order missing - Please help (Read 481 times)

Perhaps I'm being too harsh too fast, but I call this request for help bullshit, there is no known 12 seed words here. Just greed and misconceptions.

bc1qinal276kkvrkn36a33xvly1f89spcdkp012zsz has 42 characters.

bc1qinal276kkvrkn36a33xvly1f89spcd has 34 characters.

I am not sure he has a good address

i think there might be possibility that the guy wanted to use simple blockchain wallet instead of using complex hardware wallets, and the security of blockchain also very good.

If you want to search multiple paths, specify those paths in "/btcrecover-1.12.0/derivationpath-lists/BTC.txt" (comment-out the other default paths) or provide multiple paths in --bip32-path arg.

m/84'/0'/0'/1
m/84'/0'/1'/0
m/84'/0'/1'/1
m/84'/0'/2'/0
m/84'/0'/2'/1

now i am doubting the genuineness of project i got from my client
~
My client said its a blockchain wallet

he has the 12 words mnemonics but when he is trying to restore the wallet through blockchain its showing error invalid bip39 checksum

I really appreciate your time and effort to help me i checked the first 1000 address using seedrecover with bip-32 path m/84/0/0 but i found nothing,

My client said its a blockchain wallet

Even though i have drivers and everything updated but its showing 0 p/s but i can hear gpus started whirling shall i have to wait.

-snip- and please guide me how to enable multiple gpus using --opencl-devices ID1 ID2 like that with an example i have four gpus

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,

Total number of permutations: 479001600

That's 479 M.

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

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?  

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.

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

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)