One major issue is much of the &quot;fast enough&quot; problem is about benchmarks, and possibly even microbenchmarks. When a popular benchmark (or some rando&#x27;s microbenchmark) really just exercises the RNG, the headline will still be &quot;$FOO IS SLOW AS MOLASSES AND THAT&#x27;S BULLSHIT&quot; not &quot;$foo courageously uses a non-garbage RNG by default despite some performance impact in RNG-heavy scenarios&quot;. So the primary incentive for language&#x2F;stdlib developers is to have a fast rng, not to have a good one. They probably aren&#x27;t going to sabotage the rng entirely, but given the choice between &quot;fast and same as everybody else&quot; or &quot;excellent but not as fast&quot; chances are the first one will win, even if it&#x27;s crap.<p>The same problem exists with hash functions.