hello. Can I ask you a question about kangaroos? using the example of the kangaroo RC.
When the program starts, the total number of kangaroos is displayed - 1507328 kangaroos, Speed: 2271 MKeys/s - do I understand correctly that the speed is indicated for each kangaroo?
no its all the kangaroo's combined.
why is the speed so low for just math? keyhant (bsgs) is much faster with enough RAM and processor threads.
do you know where to find the fastest algorithm for obtaining a public key and address? maybe someone has, can you share?