Again, can someone do this and find the key, maybe. Could they do this and skip/miss the key, 100%.
With this, I see that you don't understand my logic. There's no way to lose the target since it is self-adjusting, designed to focus on the most probable range down to the least probable. It covers the entire range. I thought you understood it the last time. Maybe you are confusing it with Bibilgin. Honestly, I don't see the logic of Bibilgin as viable in my head, but this one is, because I only do what you call a 'full random' search. Instead of dividing into subranges, I focus on avoiding less probable ranges, and then if necessary, I narrow down the path. Honestly, I don't understand why there is so much fuss about this; it's just probabilities.
Then yes, I would need to see more, or in application. Maybe a further explanation of what happens before the search (if anything), and during the search.
I understand that they need to know more about what I mean, but I haven't even published the keyhunt mod yet, and I almost receive mocking attacks every 10 minutes. It seems easier for people to attack these days, even based on assumptions, without even knowing the idea they're attacking. It's funny to me.
But come on, you know what I mean. I don't see a problem with probabilistic software for a huge space, especially if there's no risk of losing the key. In the worst-case scenario, it just adjusts a smaller percentage until it reaches 0% (which means scanning everything). I don't think this is so hard to understand.
Are you talking about the script you made where it pads each side of a found key so that area is skipped if landed on again? Or something else?
If we are talking same script, yes, I see problems with it. If you are talking something else, then I can't say. Sorry if we are talking about 2 different things lol.