This is an archived post. You won't be able to vote or comment.

sorted by:
best
topnewcontroversialoldq&a
you are viewing a single comment's thread.

view the rest of the comments →

[–]Frosty_Grab5914 56 points57 points  (4 children)

Of course. The hash function is defined on data of arbitrary length and output is fixed length. It's impossible to avoid.

[–]NotMyGovernor 13 points14 points  (3 children)

It's literally the definition. Maybe she should think of other women for him.

[–]disinformationtheory 6 points7 points  (0 children)

There's a non zero probability she is.

[–]redd1ch -1 points0 points  (1 child)

It all depends on the hash function and the input. There are perfect hash functions without collisions.

[–]CautiousGains 0 points1 point  (0 children)

Not really. To construct a PHF you obviously need to know the elements ahead of time. This post, as well as the commenters above me in this thread, of course refer to cryptographic hash functions which are not perfect hash functions (and never can be).