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?!