Teorema CAP nyatakake manawa sistem terdistribusi bisa njamin paling akeh loro saka telung sifat — Konsistensi, Ketersediaan, lan Toleransi Partisi — ing wektu sing sama. Amerga partisi jaringan ora bisa dihindari, pilihan sing nyata yaiku antara konsistensi lan ketersediaan nalika partisi.
Telung sifat
CONSISTENCY (C) → every read sees the latest write (all nodes agree on the data)
AVAILABILITY (A) → every request gets a response (the system stays responsive)
PARTITION TOLERANCE (P) → the system keeps working despite network partitions
(communication breaks between nodes)
→ CAP: you can only fully guarantee TWO of these three simultaneously.
