This week, I presented this paper at ICCCN'26. This is joint work with Aleksey Charapko (University of New Hampshire) and my MongoDB colleagues Matt Broadstone, Daniel Gomez Ferro, and Akshat Vig. The paper investigates how to build a metastability tolerant execution control system (ECS) for a...
I have been reading the classic consensus papers (Paxos, FLP) recently and the next one in line is about Byzantine Fault Tolerance (BFT). The goal of this class of algorithms is the same -- have all replicas of a state machine reach consensus (typically about the next input). The difference is in...
FLP impossibility result states that there does not exist a fault-tolerant, safe, and live consensus protocol for an asynchronous distributed system. A fault-tolerant protocol is one that can handle failure of some nodes in the system. A safe protocol is one in which all the nodes reach the same...