diff --git a/rp-tree.cabal b/rp-tree.cabal
--- a/rp-tree.cabal
+++ b/rp-tree.cabal
@@ -1,9 +1,9 @@
 name:                rp-tree
-version:             0.3.3
+version:             0.3.4
 synopsis:            Random projection trees
 description:         Random projection trees for approximate nearest neighbor search in high-dimensional vector spaces
                      .
-                     The entry point to the library and all documentation is in the "Data.RPTree" module.
+                     To use the library, import "Data.RPTree", which also contains all documentation.
 homepage:            https://github.com/ocramz/rp-tree
 license:             BSD3
 license-file:        LICENSE
@@ -15,7 +15,7 @@
 extra-source-files:  README.md
                      Changelog.md
 extra-doc-files:     r/scatter.png
-cabal-version:       >=1.18
+cabal-version:       1.18
 tested-with:         GHC == 8.10.4
 
 library
@@ -35,9 +35,9 @@
                      , conduit >= 1.3.4.1
                      , containers >= 0.6.2.1
                      , deepseq >= 1.4.4.0
-                     , exceptions
-                     , microlens
-                     , microlens-th
+                     -- , exceptions
+                     -- , microlens
+                     -- , microlens-th
                      , mtl
                      -- , psqueues
                      , serialise >= 0.2.3.0
diff --git a/src/Data/RPTree/Conduit.hs b/src/Data/RPTree/Conduit.hs
--- a/src/Data/RPTree/Conduit.hs
+++ b/src/Data/RPTree/Conduit.hs
@@ -24,8 +24,8 @@
 import qualified Data.Conduit.List as C (chunksOf, unfold, unfoldM, mapAccum)
 -- containers
 import qualified Data.IntMap.Strict as IM (IntMap, fromList, insert, lookup, map, mapWithKey, traverseWithKey, foldlWithKey, foldrWithKey, intersectionWith)
--- exceptions
-import Control.Monad.Catch (MonadThrow(..))
+-- -- exceptions
+-- import Control.Monad.Catch (MonadThrow(..))
 -- mtl
 import Control.Monad.State (MonadState(..), modify)
 -- splitmix-distributions