The disagreement power of an adversary
Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui, Andreas Tielmann · 2009
At the heart of distributed computing lies the fundamental result that the level of agreement that can be obtained in an asynchronous shared memory model where t processes can crash is exactly t+1. In other words, an adversary that can crash any subset of size at most t can prevent the processes from agreeing on t values. But what about the rest (22n − n) adversaries that might crash certain combination of processes and not others?