 
Summary: WaitFree Consensus with Infinite Arrivals
James Aspnes
aspnes@cs.yale.edu
Gauri Shah
gauri.shah@yale.edu
Jatin Shah
jatin.shah@yale.edu
Department of Computer Science
Yale University
New Haven, CT 065208285, USA
ABSTRACT
A randomized algorithm is given that solves the waitfree
consensus problem for a sharedmemory model with infinitely
many processes. The algorithm is based on a weak shared
coin algorithm that uses weighted voting to achieve a major
ity outcome with at least constant probability that cannot
be disguised even if a strong adversary is allowed to destroy
infinitely many votes. The number of operations performed
by process i is a polynomial function of i. Additional al
gorithms are given for solving consensus more efficiently in
