Distributed agreement in dynamic peer-to-peer networks

•We introduce a rigorous framework for modeling churn in a dynamic distributed network.•We provide a fast algorithm to reach agreement even with εn nodes churning per time step.•We provide a fast algorithm that can tolerate O((n)) nodes churning per round against the harder adaptive adversary.•We show that deterministic agreement algorithms can tolerate at most O(1) churn per time step.