Re: == Bitcoin challenge transaction: ~100 BTC total bounty to solvers! ==UPDATED==
these results from 1 thread inside gpu, ?
i think you need to manage, b t p like bitcrack for run full gpu load, then maybe you get highest jumps count per second, p100 card and 49m jumps, its seems not useing full gpu load, check with experts calculation
Check with experts i think you need to manage, b t p like bitcrack for run full gpu load, then maybe you get highest jumps count per second, p100 card and 49m jumps, its seems not useing full gpu load, check with experts calculation
This is the result of all threads.
1 jumps uses 1 inverse modulo! This is the most expensive operation for the processor! The VanitySearch version uses 1 group inversion modulo 1024 keys (delta step) - because it is known what the next step will be (+1 and -1). In Pollard, the step distance is unknown - it is calculated by dividing modulo the X coordinate after each jump. To calculate the next distance, the invMod function is again required. In addition, 1 jump equals 2 in the degree of Hop_modulo. 2 ^ 44 = 0x100000000000 and 0x100000000000 * 49M = 0x2ebae4000000000000 keys. Such a distance in 1 second pass all the threads. It should be
