diff --git a/bitvec.cabal b/bitvec.cabal
--- a/bitvec.cabal
+++ b/bitvec.cabal
@@ -1,5 +1,5 @@
 name:                   bitvec
-version:                0.1
+version:                0.1.0.1
 stability:              experimental
 
 cabal-version:          >= 1.9.2
@@ -13,7 +13,17 @@
 
 category:               Data, Bit Vectors
 synopsis:               Unboxed vectors of bits / dense IntSets
-description:            Unboxed vectors of bits / dense IntSets
+description:            Another bit-array library for Haskell.  This one defines a `Bit` 
+                        type (which is an instance of all the "expected" classes, including
+                        numeric ones) and makes that type an instance of `Data.Vector.Unboxed.
+                        Unbox`, so we get a lot of nice APIs for free.  `Bool` is already an
+                        unboxable type, but the current unboxed `Vector` implementation packs
+                        each bit as a byte.  This one packs 8 bits per byte, as expected
+                        (`UArray` from the `array` package also uses one bit per `Bool`).
+                        .
+                        In addition to the `Vector` interface, there are several high-level
+                        operations and some low-level ones suitable for building new bulk
+                        operations by viewing the bit-vector as a word vector.
 
 tested-with:            GHC == 6.10.4, GHC == 6.12.3, GHC == 7.0.4,
                         GHC == 7.2.1, GHC == 7.2.2, GHC == 7.4.1
diff --git a/src/Data/Vector/Unboxed/Bit.hs b/src/Data/Vector/Unboxed/Bit.hs
--- a/src/Data/Vector/Unboxed/Bit.hs
+++ b/src/Data/Vector/Unboxed/Bit.hs
@@ -60,9 +60,9 @@
 import safe           Data.Bit.Internal
 import safe           Data.Bits
 import safe qualified Data.List                          as L
-import safe qualified Data.Vector.Generic.Safe           as V
-import safe qualified Data.Vector.Generic.Mutable.Safe   as MV
-import safe           Data.Vector.Unboxed.Safe           as U
+import      qualified Data.Vector.Generic                as V
+import      qualified Data.Vector.Generic.Mutable        as MV
+import                Data.Vector.Unboxed                as U
     hiding (and, or, any, all, reverse, findIndex)
 import      qualified Data.Vector.Unboxed                as Unsafe
 import safe qualified Data.Vector.Unboxed.Mutable.Bit    as B
diff --git a/src/Data/Vector/Unboxed/Mutable/Bit.hs b/src/Data/Vector/Unboxed/Mutable/Bit.hs
--- a/src/Data/Vector/Unboxed/Mutable/Bit.hs
+++ b/src/Data/Vector/Unboxed/Mutable/Bit.hs
@@ -52,9 +52,9 @@
 import safe           Data.Bit.Internal
 import safe           Data.Bits
 import      qualified Data.Vector.Generic.Mutable       as MV
-import safe qualified Data.Vector.Generic.Safe          as V
-import safe qualified Data.Vector.Unboxed.Safe          as U (Vector)
-import safe           Data.Vector.Unboxed.Mutable.Safe  as U
+import      qualified Data.Vector.Generic               as V
+import      qualified Data.Vector.Unboxed               as U (Vector)
+import                Data.Vector.Unboxed.Mutable       as U
 import                Data.Vector.Unboxed.Bit.Internal
 import safe           Data.Word
 import safe           Prelude                           as P