Consensus Randomness Trilemma Bounds Efficiency, Adaptive Security, and Entropy Cost
A new trilemma proves that efficient, adaptively secure consensus requires a logarithmic lower bound on public randomness consumption, fundamentally limiting design space.
Establish a Randomness Trilemma for Adaptive Secure Consensus Protocols
A new theoretical trilemma proves Byzantine consensus cannot be simultaneously efficient, adaptively secure, and consume minimal public randomness.
