Cryptographic Sequential Delay Secures Decentralized Randomness Beacons
Verifiable Delay Functions introduce cryptographically enforced sequential time, preventing parallel computation and eliminating randomness bias in Proof-of-Stake leader election.
Cryptanalysis Exposes Flaw in Verifiable Delay Function Security
Cryptanalysis revealed that parallel computation bypasses the sequential time delay in VDFs, challenging the security of verifiable randomness primitives.
Consensus Randomness Trilemma Bounds Efficiency, Adaptive Security, and Entropy Cost
A new trilemma proves that efficient, adaptively secure consensus requires a logarithmic lower bound on public randomness consumption, fundamentally limiting design space.
Cryptanalysis Exposes Verifiable Delay Function Flaws Threatening Consensus Security
Cryptographers proved a Verifiable Delay Function's fixed sequential time can be bypassed, challenging its use for secure, fair randomness in Proof-of-Stake.