title: How some NoSQL DB (like MongoDB) can handle all of C and P in CAP theorem?
body: <p>In any technologies article talk about CAP theorem (<a href="https://gerardnico.com/data/distributed/cap" rel="nofollow noreferrer">example</a>) , I get information:</p>
  <blockquote>
  <p>If a node of the system cannot talk to each other, If two node of the system cannot talk to each other, can they make forward progress on their own?</p>
  <p>If not, you sacrifice Availability
  If so, you might have to sacrifice Consistency.</p>
  </blockquote>
  <p>My question is: How do system handle consistency( all nodes have the same data) if a node cann't talk to each other? Assumes there is updating a value on node A, how can node B has new data when node A and B cann't talk each other because of network failure?</p>