For #120, that is roughly 58 days with 64 RTX 4090s, to solve
For #125, with 128 RTX 4090s, that would be around 163 days, to solve.
And those are running on some zero-point module free energy?
So you basically stored 500 billion DP 0, tames, basically just printing pubs and privs to a file, and now are offsetting 130s pub by random amounts, and looking for a collision?
No (to all of the questions). Have you looked at the 2**65 keyspace? It's 36893488147419103232.
BTW it only takes around 16 bytes / key to store hundreds of billions of tame kangaroos for 129 bit case.
Ofcourse I'm not simply "printing pubs and privs" to a text file, that's an over-simplification.
If you want some hints: the more keys a hash table has, the less space/key is required.
For the traditional Kangaroo algo, for 130, with DP 32, I need to find only 9 billion tames and 9 billion wilds to solve. So it sounds like you just stored random pubs and privs, because 500 billion tames, with a decent DP, would take a loooooong time.
Also, you need to perform roughly 2^66.05 "steps" for #130, that would be the average.
I think you are kidding with your 9 billion kangaroos. You are missing something critical about the underlying theory.
Otherwise, you can solve all puzzles with 2 kangaroos, if you wait a trillion years.
If you are so sure #120 / #125 were solved with existing software, did you also do the math about how many kangaroos would have been needed? At DP 0 /1 / 2 etc? Your times have no meaning without space complexity attached to them.