Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it
No matter how fast it is, it's not enough. I told you in the previous post—you need to process thousands of prefixes per second, not one per minute. 
Have you try With Non Standard Decoding Like a, heuristic Methode - checksum-ignored Base58 decoding.
it can be faster.
it can be faster.
I've played around with HashCat and Kali Linux a bit, and honestly, they look nice—but they're slower than NoMachine WIF Hunter when it comes to Base58 decoding on the CPU. I've never, ever seen faster decoding and checksumming of WIFs—I'm getting 25MKeys/s here. And yes, it uses nested loops—testing all combinations—just like HashCat does. But NO random mode here. But who cares how many prefixes there are? What you really need is a pure random version here. Checksum-ignored Base58 decoding won’t work well here—you’ll just end up with overhead from false positives or false negatives.
