Re: Probabilistic search of prefixes vs random+sequential
Yeah, finally I see something interesting here instead of endless blah-blah from people who think that they know everything, have >100 years of expertise etc.
To scan entire range (to get 100% probability of success), your method requires same number of ops as bruteforce (so it does not break any math laws), but it has better changes to find the key faster than bruteforce because it has non-linear probability of success (higher at the beginning and lower at the end comparing to bruteforce). Nice!
I think results can be improved a bit by using more complex logic, but your script demonstrates the main idea very well.
Thanks for the fun!
I donated some btc to your address.
To scan entire range (to get 100% probability of success), your method requires same number of ops as bruteforce (so it does not break any math laws), but it has better changes to find the key faster than bruteforce because it has non-linear probability of success (higher at the beginning and lower at the end comparing to bruteforce). Nice!
I think results can be improved a bit by using more complex logic, but your script demonstrates the main idea very well.
Thanks for the fun!
I donated some btc to your address.Thank you, Rc, it is a very noble gesture on your part, especially during this time in my life. I truly appreciate it infinitely.
Why did you close the thread? The prefix method is better.
Make the donation worthwhile. Stay strong.