I know what you’re trying to get at, but my point is this: Imagine you have two streams of data, one from a CSPRNG, and one from what you call “true randomness”. How can you tell which one is which (as long as you’re staying under the CSPRNGs limit from your initial entropy)?
If you can’t tell me a way, there is no functional difference between these two options. So what advantage would true randomness hold?
KairuByte@lemmy.dbzer0.com 11 months ago
I said this in another comment, but while I agree that there is virtually no functional difference, and in the vast majority of cases truly random and functionally random are equivalent, that doesn’t mean that something which is functionally random is truly random.
FooBarrington@lemmy.world 11 months ago
But it is truly random for all intents and purposes, since the input is truly random. Just because the process contains deterministic steps doesn’t mean the input entropy isn’t true entropy anymore.
KairuByte@lemmy.dbzer0.com 11 months ago
And a pool is clean for all intents and purposes. There is still a distinction though. The fact that it is deterministic inherently makes it less random than true randomness.
FooBarrington@lemmy.world 11 months ago
The input is not deterministic.