Quote from: fixedpaul on Today at 08:19:23 PM

Quote from: WanderingPhilospher on Today at 07:19:33 PM

10 each, 48+ matching prefixes in 66 minutes.

Equivalent to what, 710,795,395,733 K/s, average speed to find 10 in that amount of time?

Just FYI, they were not all in order...

...
...hashing functions don’t generate uniformly distributed numbers
...

I am confused. Isn't this exactly what I am proving? That the functions / results DO form uniformly, over x sized range, within y amount of keys?

By you saying, "...actually proving that cryptographic and hashing functions don’t generate uniformly distributed numbers", that means you believe the hashes do generate uniformly numbers, correct? If so, what is so hard to understand lol?!

"And, ordered based on what?" - Meaning they were not in sequential order, the private keys. I only dropped that in there because I have read it 9349723947 times, that it is a possibility, but more so, how the next key could be a match just as well as one 329463923987 keys away. Which both are true, but chances are so slim, I'd have almost the same luck breaking RIPEMD160! But to some, it has become a war drum.

"What you're saying is extremely unlikely." - A lot of people say this and that, but very few, take the time/spend the money to really do tests. Or some just want to believe what they believe based on x y and z, even though it could easily be tested/studied/analyzed, with all the free and public data Bram gave the world. But hardly any will actually do their own tests in conjunction with looking at what's free/public.

Code:

04683d2700fcf099ccc8fea6df5987a42b9aac6cae0fc99174f38ab1b911ccb5
6ae0c0e04226b5e365251103d85a261fe55416975f8de9643877f88f734a9675
587ab46cc569dfb28b515edb8c69dc45f4868222062dd48cf76c1d0d82141393
1fa7f53807f33dddef1fc9d544ff4b1624d4cb3ba584fedc64c56bba590f01b2