It's the first time I've seen a third-party (Thegrideon in this case) try to sell a wallet.dat cracker. I also haven't seen many people working on crackers for some time, so I'm a little surprised that their cracker has all these listed features: "mixed, dictionary and brute-force methods", "SSE, AVX optimization", AMD and NVIDIA card support out of the box which implies that the program has both a CUDA and OpenCL kernel.

Consequently, this makes me think they just bundled hashcat in their program with a little .NET wrapper for the GUI, no?

If that's true, it would mean the CU value might also be printed by hashcat proper. I've only paid attention to hashcat speeds, not CUs so I don't remember if they are logged too.

With Pollard Rho we calculate:


We can see here, how important a high keyrate is.

For Pollard Rho you need simple point additions.

Wikipedia: yotta 10^24 = 1000000000000000000000000

1 Yottakeys/s = 10^24 keys/s

i have one question....!!!!!!!!!! is this challenge true....?
i mean,  is it serous..?
i just smell like scammers here..?
because ...why no body till now cracked #64..although it is 16 digits length.
i will make more clear :
challenges 61,62,63 and 64 are same length = 16 digits.
how they cracked 61+62+63 and no one can crack 64 since july 2019...(last time they cracked #63)..?

yes, you are absolutely right..
thanks for the reply.
 i was just asking in two years no one claimed this damn challenge(#64).
how some one will solve #66 and up..?

IMO this thread should have been self-moderated so we can put a local rule "obnoxious dumps of keys and bytes should be done on Github Gist or Pastebin", the sheer volume of data being passed around on this thread is hard to keep track of and makes following actual discussions hard.  

Useless script, VanitySearch makes it much faster.

NotATether, I don't know of any existing tool that only supports searching one range at a time. It may be inefficient to search a larger range, but no tools lock you in to one range at a time.

The time to solve it depend of your speed those low  puzzle can be resolved in less time with the currents speed, here are my calculation for those with distinct speeds


I ask the same question in some ther tocic: https://bt.irlbtc.com/view/5365099.msg58158290#msg58158290

I found the answer by my self, here there are some small summary of it with links to the related post and answer

Addresses from 1 to 50 puzzles were solved simultaneous by an unknow person/group
Addresses from 51 to 54 puzzles were solved by the the LBC project with variable speed from some 190 trillion keys per day
Addresses from 55 to 58 puzzles were solved by a Unknow person/group
Addresses from 59 to 63 puzzles were solved by Zielar with a speed of 248 Gkeys/s with bitcrack

There are interesting things in that Topic

Zielar talk about 0 costs of the electricity for him:
https://bt.irlbtc.com/view/1306983.1140

Speed of 248 GKeys/s are written here:
https://bt.irlbtc.com/view/1306983.msg51808347#msg51808347

He use upto 100 GPUs Tesla
https://bt.irlbtc.com/view/1306983.msg51848002#msg51848002

But in some previous post he only talk aboout 4 or 8 GPUs seems that he manage to get access to 100 GPUs at 0 cost for him

That is all that i want to know.

Regards!