You can use 24 bytes of "true" randomness (16 for key and 8 for nonce) and then get 2^64 16-byte blocks of randomness before re-keying at better than 1Gbps per core using AESNI. How much more do you need?
It's not wrong, and I didn't downvote you, but I'm not sure we need to concede that anything more difficult than "read numbers from /dev/urandom" is required here. :)