Formal Verification Quantifies Algorand Consensus Robustness and Adversarial Limitations
Researchers used a process algebraic model and noninterference framework to formally verify Algorand's consensus security, revealing precise adversarial limits.
Eliminating Threshold Cryptography Latency in Byzantine Fault Tolerant Consensus
Foundational research eliminates the inherent one-message latency price of threshold cryptography in BFT systems, enabling faster, provably secure on-chain randomness.
Optimal DAG BFT Achieves Theoretical Minimum Latency
Mysticeti-C, a new DAG-BFT, achieves the theoretical three-round latency lower bound by eliminating block certification, unifying high throughput with instant finality.
