Cornucopia Achieves Scalable Unbiasable Randomness Using Accumulators and Delay Functions
A new framework combines accumulators and VDFs with insertion security to create a scalable, unbiasable distributed randomness beacon for consensus.
Decentralized Proposer-Builder Separation Resolves Builder Centralization Risk
This mechanism auctions block-building rights, decentralizing the sequencing process and securing transaction ordering against centralized MEV extraction.
Constant-Time Verifiable Delay Function Unlocks Practical Decentralized Randomness
A novel VDF construction achieves $O(1)$ verification by leveraging time-lock puzzles, fundamentally accelerating trustless on-chain randomness.
Cornucopia: Insertion-Secure Accumulators Forge Scalable Distributed Randomness
Cornucopia introduces insertion-secure accumulators to efficiently aggregate contributions for VDF-based randomness, securing the foundation of decentralized systems.
Formalizing Multi-Resource Weight Functions Secures Next Generation Nakamoto Consensus
Researchers formalized secure resource weighting for longest-chain consensus, enabling new hybrid proofs to counter centralization and enhance security models.
Verifiable Delay Functions Fail Random Oracle Model Security
Foundational VDF security is disproven in the Random Oracle Model, forcing all future randomness and fair ordering protocols to rely on stronger, structured assumptions.
Verifiable Delay Functions Cryptographically Eliminate Frontrunning and Transaction Ordering Attacks
Verifiable Delay Functions Cryptographically Eliminate Frontrunning and Transaction Ordering Attacks
The FIRST framework uses Verifiable Delay Functions to enforce a mandatory pre-execution time lock, making transaction frontrunning probabilistically impossible.
Proof of History: Cryptographic Clock Solves Distributed Time Problem
Research demonstrates a sequential hashing function can create a verifiable, pre-consensus timeline, fundamentally reducing messaging overhead for fast finality.
Cost-Effective Verifiable Delay Functions Unlock Practical On-Chain Randomness Security
Researchers halved Verifiable Delay Function verification gas costs, making cryptographically secure, unbiasable randomness practical for resource-constrained smart contracts.
