A paper accepted for Crypto 2026 in Santa Barbara says it resolves a theoretical gap in permissionless consensus by replacing a public beacon that supplied participants with fresh random values at regular intervals. The problem is how parties can reach Byzantine agreement without knowing in advance who is participating, except for an upper bound on the number of participants, and without relying on a public-key infrastructure. Bitcoin helped motivate this line of research, but the public records do not present the new work as a Bitcoin upgrade or a change for any live network. Related Reading
This “quantum-safe” Bitcoin idea removes Taproot’s key-path — and raises fees on purpose If it ever activates, it’s opt-in and slow, because Bitcoin’s real constraint is coordination, not cryptography. Feb 13, 2026 · Gino Matos
The University of Edinburgh research record lists Damiano Abram, Marshall Ball, Juan Garay, and Aggelos Kiayias as authors of “Permissionless consensus from a common random string.” Crypto 2026 runs from Aug. 17 through Aug. 20. How the permissionless consensus construction removes the beacon A 2024 construction by Ball and collaborators combined proofs of work with fine-grained complexity assumptions. Its model also gave every participant access to a beacon that delivered a fresh public random value at regular intervals. Related Reading
A rare Bitcoin reorg just showed why six confirmations may not guarantee a final payment A rare two-block reorg and the rise of a dominant mining pool are reviving the question of how “irreversible” is a Bitcoin payment. Mar 25, 2026 · Gino Matos
The new paper says it removes that recurring service with d-wise independent distributed samplers. In plain terms, the samplers are designed to keep multiple executions secure at the same time, without requiring the beacon to keep producing new public randomness. 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 also 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 therefore changes one dependency in the earlier design rather than eliminating cryptographic assumptions.
The result remains theoretical for permissionless consensus. The public material does not state the 2026 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, so the available evidence does not support comparisons with Bitcoin’s security model or claims that the protocol is ready for deployment. Related Reading
Ethereum’s massive fee shock: New post-quantum signatures are 40x larger, threatening to crush network throughput and user costs Coinbase, Solana, Polkadot, and Bitcoin all moved on PQ planning, but wallet UX and aggregation may decide the winner. Jan 27, 2026 · Gino Matos
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. The post Blockchains may finally break their hidden reliance on a ticking randomness clock to keep networks secure appeared first on CryptoSlate.