Brewer’s Conjecture and the Feasibility of Consistent, Available, Partition-Tolerant Web Services Seth Gilbert∗ Nancy Lynch∗ Abstract When designing distributed web services, there are three properties that are commonly desired: consistency, avail-Brewer’s Conjecture and the Feasibility of Consistent, Available, Partition-Tolerant Web Services Seth Gilbert∗ Nancy Lynch∗ Abstract When designing distributed web services, there are three properties that are commonly desired: consistency, avail- ability, and partition tolerance. It is impossible to achieve all three. In this note, we prove this conjecture in the asyn- chronous network model, a
