Decentralized Trapdoor VDF Enables Accountable, Consistent Redactable Blockchains
Introducing the Decentralized Trapdoor VDF, this primitive resolves the immutability-redaction conflict, unlocking regulatory-compliant blockchain architectures.
Class Group Verifiable Delay Functions Secure Decentralized Time and Unbiasable Randomness
Class Group Verifiable Delay Functions establish provably sequential time-delay, enabling secure, low-energy consensus and unbiasable on-chain randomness.
Cost-Effective Verifiable Delay Functions Unlock Secure EVM Randomness
Optimizing Pietrzak's VDF verification from 4M to 2M gas makes unbiasable on-chain randomness feasible, securing leader election and decentralized applications.
Verifiable Delay Functions Secure Decentralized Randomness and Consensus Integrity
The Verifiable Delay Function is a cryptographic time-lock, enforcing a mandatory sequential computation to generate unbiasable randomness, thereby securing consensus leader election.
Lattice-Based VDF Achieves Post-Quantum Security for Decentralized Randomness and Consensus
Papercraft, a lattice-based Verifiable Delay Function, secures leader election and randomness against quantum adversaries with a practical 7-second verification time.
Lattice Verifiable Delay Function Achieves Practical Post-Quantum Consensus Security
Papercraft introduces the first practical lattice-based VDF, securing decentralized randomness and leader election against the imminent threat of quantum adversaries.
Verifiable Delay Puzzles Enable Fair Energy-Efficient Nakamoto Consensus
The Verifiable Delay Puzzle (VDP) replaces energy-intensive Proof-of-Work with a sequential-only computation, ensuring fair, decentralized block production.
