Indeed, most that was cracked is 4 words by John Cantrell

However he wrote his own tooling in Rust and made the process as efficient as it can be.

https://medium.com/@johncantrell97/how-i-checked-over-1-trillion-mnemonics-in-30-hours-to-win-a-bitcoin-635fe051a752

Reply to this note

Please Login to reply.

Discussion

I remember this.

But did he take it down? I was looking to recover an old seed a while back.

Still up.

Indeed this is mainainted by a new dude now.

https://github.com/gurnec/btcrecover

Is there a way of refining the search when you know the first letter of those forgotten words?

Yes, it allows for almost anything you can think of.

Check this playlist on YT.

https://www.youtube.com/watch?v=8q65eqpf4gE&list=PL7rfJxwogDzmd1IanPrmlTg3ewAIq-BZJ

If its not there go through the documentation.

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

Thanks!

Wonder why I didn't see this before...

Alex, any interest in hunting for some lost coins for a 50% bounty? It’s not a sizable amount but it’s an interesting problem: recursive bip85, several layers deep.

Normally I would, but now I’m working on my movie(Satoshis Don’t Exist)I have 0 free time.

Contact this guy, he is the one maintaining the tool.

https://twitter.com/ytcryptoguide

I tried talking to John, he prob thought I was a scammer.

Can’t easily get a hold of the guy you linked through X, I’ll try other means eventually. Not really in a rush, as it makes for good nitty gritty work for my future kids lol

hE wRoTe ThE tOoLiNg In RuSt

doesn't matter, it's bulk computation

it's just generate secret, generate pubkey, hash to address, check, repeat

i've not yet seen anyone write an AVX2 secret->pubkey derivation algorithm so i doubt that it mattered that he used C, C++, C# or Go

there's really almost no scope for making this computation more efficient, it's scalar multiplication, mostly

i just want to point that out because fuck rust

The articles clarifies why he managed to get better time.

Hint parallelisation.