-
@ 501e99e5:e8aa01aa
2025-02-22 23:53:41
https://blossom.f7z.io/2be5436777ac4b41301c6d2593e4eb14dbb2f68abedea5aaddff7161ded24ed9.png
what we have here is a visualization over n iterations for probability of change for each bit. different colors represent values of each bit, so we have 256 different bit values to track over iterations. perfect hash function is a function where output bits change by exactly 0.5 probability for any change in input. such hash function does not exist however, because hash functions are based on pseudo randomness, ie programmed changes in bits.
when we find a pattern from the probabilities that differ from the ideal probability 0.5, it opens a weakness in hashing function.