Answers are grounded in this paper and cite their sources.
Different BFT (Byzantine Fault Tolerance) consensus algorithms have distinct characteristics and their optimal use cases. Rarely does a protocol demonstrate outstanding performance across different environments. Sometimes, systems need to switch consensus algorithms to adapt to different environments. This paper aims to investigate how to achieve seamless consensus algorithm switching without system downtime and compromising the security and consistency of the original consensus module. To address this issue, we propose Cox, a reliable online switching protocol for BFT consensus algorithms, and design a corresponding recovery sub-protocol for the lagging nodes. The experimental results indicate that, under the assumption of a partially synchronous network, Cox can ensure both the liveness and safety of the consensus module, and achieve reliable switching in milliseconds.
No takes yet. Share an insight, caveat, or question.
Li et al. (2025) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: