I don't have the actual code, but it was something like this.
Thanks for posting that.
However, for my purposes -- deterministically generating a randomly distributed value -- it doesn't work well. With the MD5, every single bit change in the input generates an average of 64-bits change in the output -- which is near perfect.
But this crc algorithm -- which was probably great for your purposes -- only generates a single bit change in the output for each single bit change in the input:
In reply to Re^4: [OT] The statistics of hashing.
by BrowserUk
in thread [OT] The statistics of hashing.
by BrowserUk
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |