diff --git a/TrieMap.cabal b/TrieMap.cabal
--- a/TrieMap.cabal
+++ b/TrieMap.cabal
@@ -1,5 +1,5 @@
 name:		     TrieMap
-version:             3.0.0
+version:             3.0.1
 cabal-version:       >= 1.6
 tested-with:	     GHC
 category:            Algorithms
@@ -15,7 +15,8 @@
                      
                      Compared to Data.Map and Data.Set, on e.g. @ByteString@s, TrieMaps support 6-12x faster @union@, 
                      @intersection@, and @difference@ operations, 2x faster @lookup@, but 2x slower @toList@, and 4x slower @filter@.
-                     Other operations are closely tied.
+                     Other operations are closely tied.  TrieMaps tend to use somewhat more memory, and frequently perform better
+                     with increased heap space and allocation area.
 license:             BSD3
 license-file:	     LICENSE
 author:              Louis Wasserman