Randomness, Efficiency, and Adaptive Security Form a Consensus Trilemma
New research formalizes a consensus trilemma, proving no protocol can be simultaneously efficient, adaptively secure, and minimize public randomness.
Deterministic Bounds Secure Committee Selection Replacing Probabilistic Guarantees
New sortition algorithms introduce deterministic security bounds, fundamentally enabling smaller, faster consensus committees without sacrificing decentralization.
Probabilistic Leader Election Enforces Cryptographic Fairness in Transaction Ordering
FairSort uses Verifiable Random Functions to probabilistically elect ephemeral sequencers, cryptographically guaranteeing transaction ordering fairness and mitigating MEV.
