Asynchronous Consensus Achieves Low Latency through Optimistic Responsiveness
A new BFT protocol guarantees safety under full asynchrony while achieving synchronous-like speed during periods of network stability, resolving the latency-robustness trade-off.
Coding Techniques Achieve Near-Optimal Synchronous BFT Communication Complexity
The Hamster protocol uses coding techniques to reduce Byzantine Fault Tolerance communication to near-optimal $O(mn)$, unlocking linear throughput scaling.
Formalizing Accountable Liveness to Identify Consensus Faulting Nodes
This research introduces provable liveness accountability, enabling verifiable identification of nodes causing consensus stalls for enhanced blockchain reliability.
