diff --git a/20210323005824-distributed_systems.org b/20210323005824-distributed_systems.org
index 010e1b9..ab4ed20 100644
--- a/20210323005824-distributed_systems.org
+++ b/20210323005824-distributed_systems.org
@@ -64,4 +64,17 @@ or more actions executing simultaneously.
 Python threads are concurrent, but not parallel (execution is serialized,
 contending for access to the Global Interpreter Lock).
 * [[file:20210323010014-cap_theorem.org][CAP Theorem]]
+
+[[file:data/e3/98cb62-2f26-46e5-ae00-64260adc4c43/Visualization-of-CAP-theorem.png]]
+
+#+begin_quote
+CAP is frequently misunderstood as if one has to choose to abandon one of the
+three guarantees at all times. In fact, the choice is really between consistency
+and availability only when a network partition or failure happens; at all other
+times, no trade-off has to be made.
+#+end_quote
+
+Not absolutist, there are trade-offs that can be made to achieve a best possible
+outcome.
+
 * [[file:20210323010307-conflict_free_replicated_data_types.org][CRDTs]]
diff --git a/20210323010014-cap_theorem.org b/20210323010014-cap_theorem.org
index afd3f9f..9a4d03d 100644
--- a/20210323010014-cap_theorem.org
+++ b/20210323010014-cap_theorem.org
@@ -3,6 +3,12 @@
 States that a [[file:20210323005824-distributed_systems.org][Distributed System]] cannot simultaneously be consistent, available,
 and partition tolerant -- typically only achieving two of the three.
 
+[[file:data/e3/98cb62-2f26-46e5-ae00-64260adc4c43/Visualization-of-CAP-theorem.png]]
+
 * Consistency
 * Availability
 * Partition Tolerance
+* Attachments :noexport:ATTACH:
+:PROPERTIES:
+:ID:       e398cb62-2f26-46e5-ae00-64260adc4c43
+:END:
diff --git a/data/e3/98cb62-2f26-46e5-ae00-64260adc4c43/Visualization-of-CAP-theorem.png b/data/e3/98cb62-2f26-46e5-ae00-64260adc4c43/Visualization-of-CAP-theorem.png
new file mode 100644
index 0000000..2ed3097
Binary files /dev/null and b/data/e3/98cb62-2f26-46e5-ae00-64260adc4c43/Visualization-of-CAP-theorem.png differ