Re: == Bitcoin challenge transaction: ~100 BTC total bounty to solvers! ==UPDATED==

Thanks for pointing to the github. I learned a lot from Telariust code.
Now Ive modified the algorithm (Ill write the whole algorithm here soon) in terms of performing operations specific to python and productivity has increased by 14%. And this is only single-threaded execution.
I also have a multithreaded part ready.
I still can not lay out a single-threaded code, because it is not optimized by memory. Soon

When rewriting program for CUDA, I dont share the code.
./vs-kangaroo-hybrid -v 1 -p 8 -gpu -bits 65 0230210c23b1a047bc9bdbb13448e67deddc108946de6de639bcc75d47c0216b1b

Code:

bla bla bla
[x] EXIT

Bro, show us the result of finding the address # 105, othervise all this has no sense at all...

Why spend electricity on 105 bits Huh

, preferably 110 bits.

If with this code you still need to waste an electricity for #105, then this code is still useless. In order to have it profitable it must solve #105 in a few seconds... ok, few minutes... ok, few hours... )))