Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it
Isn't this a super easy task, to test? Give me the same program, and I will run it with a GPU and then with a CPU, and let's see which solves the key first. Let's make it an 80 bit range. 1 GPU versus a single core, or do you want to use as many cores as the CPU has? Any bets on which one finds the key first?
80bits yes, because you can use low DP. For 120 and higher - you have to use high DP and you will get crazy overhead with JLP. So it's easy to test for 80bits range, but not for 120 range
Also, RetiredCoder, make mods to the program, to create less "kangs" when using a GPU, if it's to crazy for you...it's super easy to do. And another question, how does the speed of "kangs", impact the finding of High DP bits. Does a CPU (which the individual kangs are faster) find high DP bits, faster? Or does the GPU's slow, but many, find more, DP bits, faster?
And the last question, which "high puzzles" have you solved and what did you use to solve (CPU, GPU, DP, etc)
[/quote]
Yes I started with JLP code a long time ago, but after some time I got enough experience and I created my own software from scratch - much faster and efficient. So it's not a mod.
I won't post its source, but soon I will post some software for K (examining K*sqrt ops) - from classic 2.1 to best 1.23 so people who are interested can learn some things.
I solved #120, #125 and #130 for now, for 130 DB with DP was about 1TB.
About crazy DP overhead in JLP you can check my old posts, I'm glad that it's super easy for you to make less number but faster kangaroos to reduce this overhead