Constant Latency BFT Achieved on Dynamically Available Directed Acyclic Graphs
New DAG-based BFT protocol guarantees constant finality time despite validators frequently sleeping, solving a core dynamic availability problem.
Secure BFT Consensus for Dynamically Available Networks Using PVSS
A novel BFT protocol integrates PVSS with pre-commits to secure fast consensus in dynamic networks, achieving $4Delta$ latency and 50% resilience.
