What the f*** is a probabilistic brute force method? Is it brute force, or is it not? Is it more efficient or is it not better than something else? Make up your mind. So many freaking things that smell so badly of logical non-sense, when a normal person is trying to read and understand your posts.
Maybe you're a genius, who knows. Those people are never understood by the rational people, since they function on a totally different frequence.
This thread may give a normal person a brain aneurysm once they see fellow people failing to see plain out contradictions when they are being drawn right under their nose more times than there are keys in Puzzle 256. We don't need a freaking diploma in rocket science to have some common sense... I give up.
In computer science, brute-force search or exhaustive search, also known as generate and test, is a very general problem-solving technique and algorithmic paradigm that consists of systematically checking all possible candidates for whether or not each candidate satisfies the problem's statement.
Your problem is that you take all opinions that differ from yours as a call to war, and that says more about you than about me.
Nope, still not. Even with a single GPU the odds of both methods are EXACTLY the same. You have 1/(2**67 - nbKeysAlreadyChecked) chance for every key you check, no matter the order. Trying to use probabilities in arbitrary defined ranges does not improve odds because just like with a coin flip, each event is independent.
I disagree because I replicate your scenario and mine (as it should be done before giving an opinion), and in mine, I always end up obtaining the key first. Although I could be wrong, these are the data I obtain in each test, within a friendly range for my limited resources.
The reason you get this is because the prefix is small enough when compared to the range size.
This is of no use when the prefix size becomes closer to the range size. Like when the prefix is 67 bits and the range also is 67 bits, like for any of those puzzles.