The idea here is that it's a public, traceable generation of random numbers. So, if the two of us wanted to flip a coin to settle a disagreement, we could agree on some future value of this beacon (unknowable to us at the moment) to use as the source of entropy, then let one of us choose heads or tails, telling the other person what we chose. Then we wait until the agreed time, check the beacon, and boom, a fair coin toss, which we can be fairly certain wasn't manipulated by either of us.
From tfa:
Often, randomness is thought of as something you want to keep hidden, such as when generating passwords or cryptographic keys. However, there are many applications where an independent and public source of randomness is useful. For example, randomizing public audits, selecting candidates for jury duty, or fairly assigning resources through a lottery.
Sometimes you need publicly verifiable randomness, and then your own hardware (which you might or might not even trust privately, depending on how much you trust your vendors) isn’t much help.
If you still think that's idiotic, I'm happy to bet against you in an unbiased* coin flip simulated on my machine which you unfortunately can't inspect :)
Ever taken a stats class? Recall the "table of random values" in the back of the book? That's why
Because, firstly, this is a university, not some rando self-hosting, and secondly, you can't generate randomness from any classical computer, only pseudorandomness [0]. This means that a dedicated adversary can potentially work out what the outcome will be. For something like the use cases they mention - jury selection, lottery, etc. - you want actual randomness.
[0] - https://en.wikipedia.org/wiki/Pseudorandomness
> So classical computers can generate randomness if you have the right circuits for it.
That is by definition not a classical computer. It's not a quantum computer, but it's probabilistic in a limited sense.
I don't think anybody wrote a description of a classical computer that excludes components that generate harvestable random noise. Effectively all computers are probabilistic, it's just that the probabilities for instructions, memory fetches, bus transfers, etc, have such low error probabilities that you will likely go years without directly observing one.
A classical computer is a pure mathematical object. No real-world computer completely embodies the concept, but they vary in how much they try to hide it. Rdrand is an admission that no they're really not classical computers, and it turns out that that is useful in certain scenarios.
oh you're talking about deterministic turing machines (have not heard that referred to as "classical" computer before- typically when people say that, they mean an actual physical real-world computer, not a theoretical model.
A zener diode- standard component- produces random noise. It needs to be mildly conditioned to be unbiased.