How do YOU determine the "best" DP? It was already in the original code based on x y and z. How do you plan on determining the "best" (properly selecting according to the range)? And how will you know if a random is "too random"? These comments do not make much sense to me, so, please explain.
Selecting the optimal DP might involve a combination of testing and tuning based on statistical analysis or heuristics that allow predicting success at different ranges. Too high a DP might be overly accurate but inefficient, while too low a DP might be fast but inaccurate.
As for the randomness in the jumps, it is necessary to avoid predictable patterns, but too much randomness can result in significant deviations that negatively affect performance.
As for what I mean by "too random", I mean finding a balance in randomness so that it is enough to avoid predictable patterns but not so much as to move away from the target points within larger ranges.
According to Chaos Theory, sensitivity to initial conditions affects probability, so an inappropriate configuration may seem the best option at low ranges, but this does not mean that it is the best for the puzzle 135, 140...
The multi pub, via additions, is done with each jump. Think about it.
If you add multiple pubs, then you are slowing down the jumps / machine speed. Cobras has been told this many times, there really are no advantages for multi pub. Meaning, if you add 1,000 pubs to the search, to search at once, then your program speed is slowed down by 1,000. I have a GPU program that can check 1,024 pubs, at once. There was no speed up in time solved.
You are right, it would not be efficient to focus on searches for multiple public keys.
