Toward Optimal-Complexity Hash-Based Asynchronous MVBA with Optimal Resilience
cs.DC
Submitted: 2024-10-16
Updated: 2026-11-10
Terminology
Sources
- The latest gossip on BFT consensus
- OciorMVBA: Near-Optimal Error-Free Asynchronous MVBA
- Two More Algorithms for Randomized Signature-Free Asynchronous Binary Byzantine Consensus with $t < n/3$ and $O(n^2)$ Messages and $O(1)$ Round Expected Termination
- Correction to Byzantine Agreement in Expected Polynomial Time, JACM 2016
Related papers
- Programmable Probabilistic Computer with 1,000,000 p-bits
- BatchGen: An Architecture for Scalable and Efficient Batch Inference
- Seamless Reconfiguration for DAG-BFT (Technical Report)
- ELDR: Expert-Locality-Aware Decode Routing for PD-Disaggregated MoE Serving
- iScheduler: Reinforcement Learning-Driven Continual Optimization for Large-Scale Resource Investment Problems
- TIRx: A Unified Tile Primitive ML Compiler Across Heterogeneous Backends