Breakthrough in Permissionless Consensus: Removing the Randomness Clock

A breakthrough in permissionless consensus has been made by researchers from the University of Edinburgh. In their paper, 'Permissionless consensus from a common random string,' they propose a new construction that removes the reliance on a public beacon to supply participants with fresh random values at regular intervals.

The current model uses a recurring service provided by the beacon to keep networks secure, but this new construction replaces it with d-wise independent distributed samplers. These samplers are designed to keep multiple executions secure at the same time without requiring the beacon to produce new randomness.

The authors combine these samplers with proofs of work grounded in fine-grained complexity assumptions and build multi-verifier signatures of work, which the consensus protocol uses as a modular component. However, it's essential to note that this is still a theoretical result for permissionless consensus, and no implementation details are provided.

The research was accepted for presentation at Crypto 2026 in Santa Barbara, which runs from August 17 through August 20. The manuscript remains embargoed until August 20 at 00:00 BST.