Topic: Why doesn't the CAP theorem kill BitCoin? (Read 6551 times)

What ?

As I said no consistency is guaranteed by design, so the question of the OP is answered.

"Why doesn't the CAP theorem kill Bitcoin ?" :
1. Because theorems don't kill things
2. Because bitcoin does not guarantee consistency.

Bitcoin only guarantees that it will try its best to make any inconsistency be solved eventually.

Well the CAP doesn't really apply to the p2p network since the network doesn't have any state (except the blockchain) :/

I see the p2p network as independent from the block chain.

Bitcoin gets Partition Tolerance, davout was right in saying bitcoin doesn't get consistency.

In the event of a partition both halves will continue working separately (and thus the state is inconsistent in those two halves). Then when the two halves connect the partition is sorted out (arguably not in the best way possible, but it does restore the system to a sensible state).

Hi. You need to start by reading the Bitcoin paper, especially section 5.

Bitcoin does not guarantee this.

Bitcoin doesn't get P.

However, the block chain can fork and be rejoined.

Doing a web search I find nothing mentioning both BitCoin and the CAP theorem.  Is there a report on this topic somewhere offline?

Because Bitcoin is designed to deal with it. This is done through occasional block chain reorganizations, most of which happen automatically behind the scenes.

CAP theorem
From Wikipedia, the free encyclopedia

The CAP theorem, also known as Brewer's theorem, states that it is impossible for a distributed computer system to simultaneously provide all three of the following guarantees:[1][2]

Consistency (all nodes see the same data at the same time)
Availability (node failures do not prevent survivors from continuing to operate)
Partition tolerance (the system continues to operate despite arbitrary message loss)
According to the theorem, a distributed system can satisfy any two of these guarantees at the same time, but not all three.[3]

History
The theorem began as a conjecture made by University of California, Berkeley computer scientist Eric Brewer at the 2000 Symposium on Principles of Distributed Computing (PODC).[4] In 2002, Seth Gilbert and Nancy Lynch of MIT published a formal proof of Brewer's conjecture, establishing it as a theorem.[1]

References
[1] a b Nancy Lynch and Seth Gilbert, “Brewer's conjecture and the feasibility of consistent, available, partition-tolerant web services”, ACM SIGACT News, Volume 33 Issue 2 (2002), pg. 51-59.
[2] "Brewer's CAP Theorem", julianbrowne.com, Retrieved 02-Mar-2010
[3] "Brewers CAP theorem on distributed systems", royans.net
[4] Eric Brewer, "Towards Robust Distributed Systems"

External links
"Problems with CAP, and Yahoo's little known NoSQL system" by Daniel Abadi
"CAP equivalent for analytics"


P ≟ NP    This theoretical computer science-related article is a stub. You can help Wikipedia by expanding it.