This actually makes no sense. The modified kangaroo programs out there that increased the search range to 254/256 bits, did not do anything to increase speed / efficiency. Unless you have ran both and extracted the data in the workfiles, do not comment on it and spread false info.
I have not seen one modified JLP program, for increased bit range search size, that had speed increases. All they did was make the workfiles, double the size. Instead of only increasing the distance entries, they increased the points and distance entries; so now the workfiles are double the size.
You can run all of your tests you want to, but math is math, it doesn't lie. If I have a kangaroo program that is 3 times faster than yours, I will find the number of average DPs needed to solve, 3 times faster than yours. Efficiency does not equate to being able to search higher bit ranges, you dig?
That's what I preach, you can't mess with the birthday paradox without losing efficiency, if your software doesn't do this right for you, at least you're not looking for a fish in the sky. My comments are directed towards @ktimesg's crazy proposals. If you read the context you'll understand.