I am trying to understand how the Linux CSPRNG works. In a [git commit](https://git.kernel.org/pub/scm/linux/kernel/git/crng/random.git/commit/?id=c57044909484) Jason A Dononfeld explains one of the reasons BLAKE2s was chosen as a cryptographic hash function to serve as a PRNG was that it is a random oracle. The paper Dononfeld [cites](https://eprint.iacr.org/2019/198) explains random oracles offer this robustness. However even after several attempts at reading through the git log notes, Dononfeld's [blog post](https://git.kernel.org/pub/scm/linux/kernel/git/crng/random.git/commit/?id=c57044909484), and the paper Dononfeld cites--I am still not sure how random oracles offer robustness in random generation. May anyone here clarify? If so thanks in advance!