Paper Shows How to Strip Randomness Beacon from Consensus

For this permissionless consensus construction, the replacement still needs shared setup. Participants use a common random string, although the abstract says it does not need to be structured or sampled precisely when the protocol begins. The sampler constructions rely on the decisional Diffie-Hellman and learning with errors assumptions. The authors combine those samplers with proofs of work grounded in fine-grained complexity to build multi-verifier signatures of work, which the consensus protocol uses as a modular component. Removing the beacon thus changes one dependency in the earlier design rather than eliminating cryptographic assumptions.

The result remains theoretical. The public material does not state the protocol’s numerical corruption threshold, exact synchrony and communication conditions, concrete costs, or benchmark performance. Details from the 2024 construction cannot be assumed to carry forward. The available evidence does not support comparisons with Bitcoin’s security model or claims that the protocol is ready for deployment.

The accepted manuscript remains embargoed until Aug. 20 at 00:00 BST, according to the Edinburgh record. What is public supports a specific advance: a recurring randomness beacon is replaced by distributed samplers and a common random string, while DDH, LWE, and fine-grained proof-of-work assumptions remain part of the construction.

For a deeper look at how theoretical developments might eventually touch live blockchain security, see our crypto market analysis.