Neuromorphic Consensus Leverages Neural Dynamics for Energy-Efficient, Scalable Blockchain Finality
Proof-of-Spiking-Neurons introduces a new consensus class, modeling block proposal as competitive neural firing to achieve BFT security with minimal overhead.
Game-Theoretic Incentives Guarantee Provably Uniform Decentralized Randomness
A new Randomness Incentive Game (RIG) establishes a Nash Equilibrium where participants are compelled to submit provably uniform inputs, securing all decentralized randomness protocols.
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.
Cornucopia: Accumulators and VDFs Secure Scalable Decentralized Randomness Beacons
This new Cornucopia framework combines Verifiable Delay Functions with accumulators to create a scalable, bias-resistant randomness beacon secure with only one honest participant.
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.
