0x668143c4…385fsent to0xfaa27561…c12d·#23,010,634·view on Etherscan
Simple commit-reveal scheme at the core, such as many RNG systems use. Difference is it relies on very large number of participants that submit "entropy". Avoids issue of choose-to-not-reveal attacks & such, by not simply combining revealed "entropy" into a random number, but rather letting revealed entropy act as vote to select number between 0 and number of participants. By Poisson distribution, known that for given number of participants, the number that receives most votes (assuming random votes) will reach a specific number of votes (such as 13 for 8 billion participants).
Participants cannot know what number they submit. I.e., "entropy" they submit has to "mutate" after they have submitted it. Use result of previous round to change value of each submitted number. For example, hash each contribution with result of previous round + address of submitter.
Has to be "bootstrapped" with secure initial seed. Attack on initialization is discoverable (results not by Poisson distribution). If attacked, initialize again. Repeat until securely initialized.