I created a script under the worst possible conditions for prefix searching (intentionally). Even so, if you run several tests, you'll see that the prefix search achieves the same frequency of success as yours in this particular case, though you only publish instances where your method wins.
You might have missed my point.
I'm not saying my method "wins". I'm saying that on average prefix theories have EXACTLY the same speed as a linear search. Which this script demonstrates beautifully.
How could I take them seriously and make a proposal on equal terms in the pursuit of truth if I receive childish responses?
I don't see what was childish about my response. As I told you I'm very happy to make this script evolve until you can be convinced that prefixes do not provide a speedup over linear.
The only thing that matters is reaching the truth under correct conditions, right?
Exactly, so let's reach the truth.
You dont need a fast PC to run the script, I can do that on my end.