Why do cryptographers need loads of true random numbers? I've just read an answer to fastest-random-number-generator.  The answer is a couple of years old, but mentions a true random number generator capable of running at 300 gigabits per second.  It is re-linked here.  They might go even faster now. .

One time pads are out of favour.  There's no point storing these numbers for reruns as you might as well use a psuedo random number generator.  Most pundits on this forum suggest a maximum of 128 bits of true entropy for seeding.  So why would cryptographers need so many true random numbers? Or is it just a *issing contest between researchers?
Mostly, you do not actually need a lot of true randomness, as you observed. However there are at least some niche cases where you might want a fast TRNG.


Stateless implementations cannot use a typical CSPRNG. Something like a hardware token without writable storage, maybe. The intersection with applications that require a lot of speed is pretty small.
Long term key generation. People tend to want true random numbers when generating long term keys. That is not usually a frequent event, but perhaps something like a federated key store would need to do it often enough.
Latency. Even if you do not need gigabytes of entropy every second, getting e.g. 256 bits quickly can be important. Although again it is probably rare to need it and not be able to use a cache.


There are probably also use cases where the random numbers are used for non-cryptographic algorithms, but need to be both strong and non-deterministic. Maybe in gambling.