diff --git a/PersistentMap/Readme.org b/PersistentMap/Readme.org
index bb278dd..7563a71 100644
--- a/PersistentMap/Readme.org
+++ b/PersistentMap/Readme.org
@@ -2,7 +2,7 @@
 
 A high-performance, persistent (Copy-on-Write) B+ Tree implemented in C#. 
 
-It is designed for zero-overhead reads, SIMD-accelerated key routing, and allocation-free range queries. It supports both fully immutable usage and "Transient" mode for high-throughput bulk mutations.
+It is designed for zero-overhead reads, SIMD-accelerated key routing, and allocation-free range queries. It supports both fully immutable usage and "Transient" mode for high-throughput bulk mutations. The primary use case is for when editing operations are in bulk. Updating single elements many times will fail to distinguish this collection from other more mature collections. Bulk writes are very fast using transient interfaces, random reads are fastish depending on key type and entropy, Sequential reads and min/max queries are very fast. 
 
 ** Features
 - *Copy-on-Write Semantics*: Thread-safe, immutable tree states. Modifying the tre yields a new version while sharing unmodified nodes.