Quote from: kTimesG on February 03, 2025, 06:08:34 PM

Quote from: karrask on February 03, 2025, 05:19:08 PM

Quote from: madogss on February 03, 2025, 04:24:08 PM

Quote from: karrask on February 03, 2025, 05:32:10 AM

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?

BSGS shows speed of how many keys are not a solution, it doesn't compute any of them except one in every sqrt(interval_size) keys. Think of it like you have a really big table of divisors (RAM) for some number, and then checking whether you can find some number (the solution) which is the inverse of the divisor. Because of the math, you can dismiss an entire sqrt(N) subinterval by just doing a single check after some simple multiplication or whatever.

Kangaroo shows speed of keys that are actually being computed. It doesn't require any RAM, just a small constant storage. It can solve the types os problems for which there isn't enough RAM on planet Earth to run a BSGS algorithm (like any puzzle above 100 bits more or less).

It doesn't matter that you see BSGS speeds of petakeys/s because the interval size is so huge that this "speed" is totally useless. You should probably divide that "speed" by sqrt(N) to have a fair comparison with a Kangaroo speed.

We don't have a fastest algorithm to do what you want, otherwise this thread would be dead since many years ago. And probably all cryptos would have a value of zero since they'd be broken.

The speed is low because you don't have a fast enough computing device. No one has a magic unicorn chip that does ECC math for free, without wasting power and dissipating heat.

Which one is better? They both have the same actual real speed, but BSGS requires RAM which you might not have enough of (the type of amounts that would require an entire solar system, if you go for higher puzzles)

Thank you for the clarification. I wanted to understand the difference between a keyhant and a kangaroo. as for the fastest algorithm, I meant which is the fastest at the moment, not in theory.
I have an idea and I would really like someone to tell me about kangaroo's work. You need the core of the algorithm and not much information to change the jumping mechanics. We also need an algorithm for calculating the bitcoin address.
Can you help me with this?