&gt; Hash functions are supposed to be fast, though.<p>First, apparently that was unclear and I left it unspecified so note that my mention was intended about general hash functions (as you&#x27;d use in a hash table, which could easily bottleneck a benchmark without its developer realising it) not specifically cryptographic ones.<p>Second, so are number generators and more or less everything else (aside from KDFs), the issue is none of these are <i>only</i> supposed to be fast, and while they should be as fast it&#x27;s usually more important that they&#x27;re good, yet the incentive for language developer is to ignore good (whatever that is for the domain) and focus solely on fast. <i>That</i> is what my comment was about.