Space-efficient asynchronous consensus without shared memory initialization

We study the consensus problem in a shared memory model where all processes are programmed alike, there is no global synchronization, it is not possible to simultaneously reset all parts of the system to a known initial state, and processes may be faulty. We present a consensus protocol for n processes which can tolerate up to ⌈n/2⌉ - 1 failures and which uses a single (2⌈1.5n-1⌉)-valued shared register.