Skip to content

Comment on Errors in Database Systems, Eventual Consistency, and the CAP Theoremparent

Comments

fwiw, here is the formal version of the theorem from the gilbert/lynch proof paper:

Theorem 1. It is impossible in the asynchronous network model to implement a read/write data object that guarantees the following properties: * Availability, * Atomic consistency, in all fair executions (including those in which messages are lost).

AboutSource Built by g1lg1l

Hackerly is an independent reader for Hacker News, built on the public HN API. Not affiliated with Y Combinator.