Cryptographic Sortition Decentralizes Transaction Ordering Preventing MEV Extraction
A new Verifiable Sortition Orderer mechanism uses cryptographic randomness to break the proposer's monopoly on ordering, mitigating systemic MEV.
Empirical Analysis Exposes Secret Leader Election Vulnerability to Coordinated Attacks
New simulations reveal current Secret Leader Election protocols fail against coordinated validator group attacks, demanding novel cryptographic resilience.
Democratic Random Beacons Eliminate Leader Bottlenecks for Scalable Randomness
Kleroterion, a democratic randomness beacon, achieves linear computation and leaderless input sharing, decoupling beacon performance from network size.
Deterministic Bounds Secure Committee Selection, Strengthening Decentralization and Scalability
By replacing probabilistic committee selection with deterministic bounds, this new sortition mechanism guarantees an honest majority, enhancing consensus security and network scalability.
Deterministic Bounds Secure Committee Selection Replacing Probabilistic Guarantees
New sortition algorithms introduce deterministic security bounds, fundamentally enabling smaller, faster consensus committees without sacrificing decentralization.
Deterministic Sortition Bounds Fortify Committee Security and Scalability
A new cryptographic sortition method achieves deterministic bounds on adversarial committee influence, fundamentally enhancing Proof-of-Stake security and decentralization.
