> `f : {0,1}^n → {0,1}^n` is a perfect PRF if and only if given a distribution `d : {0,1}^n → [0,1]`, `f` maps inputs following the distribution `d` to the uniform distribution.<p>Is this even possible? If the distribution `d` always returns 0, how can a function make it uniform?<p>It would be nice, if the article would go into more details on how SeaHash obtains this property, and how it related to collision avoidance.