Re: == Bitcoin challenge transaction: ~100 BTC total bounty to solvers! ==UPDATED==
you should go back in earlier post to you, where i said you need to correct define, block, thread and process, and you will get 10x faster speed 
hope you soon you will able to assign this in user level with switches -b -t -p , as per bitcracked assign for manage load of full GPU power
You can use -g 128 or -g 64hope you soon you will able to assign this in user level with switches -b -t -p , as per bitcracked assign for manage load of full GPU power
I wrote several times what speed depends on! How much can you talk from the same thing? Modulo inversion is performed every time after a jump (using 1 group inversion for wild and tame), since the distance is unknown. Dear "brainless", I know perfectly well which step I need to go back to, and please leave behind your BitCrack and VanitySearch used is 1version for 1024 keys / steps using the Mongomery method, since the step is known - THE SPEED IN 1024/2 TIMES MORE !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
In addition, the program counts 2 wild and tame jumps in 1 jump - multiply the speed by 2 if you want to.