Exploring Key Retrieval with Kangaroo Algorithm

I was curious about how long it takes a regular PC without a GPU to fetch a key in the range of 2^74 to 2^75. So I coded my version of the kangaroo algorithm and ran some tests.

Hey, awesome! What were the results?

On my laptop with an Intel i7-12700H, it takes about 3 seconds per key. I found that searching multiple keys at once speeds things up a bit.

What’s the size of your database?

It’s 6GB, but it can handle higher ranges like 2^77 2^78 or even 2^80 2^81 with the same setup.

Nice! Isthe second file still available?

I think it should be working now.

Cool, could you share the command you used?

Sure, it's./kangaroo_wild extend <hash> <min_range> <max_range>.

I removed some options because they slowed the program down. Now the retrieval time is about 25% faster with the updated version.

What’s the time for your new setup?

With this new database, I get 2.2 seconds for each key in sequential search. In parallel, it’s about 1.1 seconds. Got some slower times for higher ranges though.

Sounds great! What about the 135th puzzle?

This program is really meant for 2^74-2^75 and similar ranges. CPUs aren’t really cut out for the 135th puzzle; GPUs crush it.

So you’re saying I shouldn’t bother with CPU for that?

Yeah, unless you’ve got a super powerful setup, it's gonna take ages. Like, years for higher ranges.

I saw a 404 error on GitHub. What happened?

There’s a glitch with my account. I’ve re-uploaded everything somewhere else.

Really? Can you link it?

Just give me a sec, I’ll drop the new link.