diff --git a/OrderedBits.cabal b/OrderedBits.cabal
--- a/OrderedBits.cabal
+++ b/OrderedBits.cabal
@@ -1,9 +1,10 @@
 name:           OrderedBits
-version:        0.0.0.1
+version:        0.0.0.2
 author:         Christian Hoener zu Siederdissen
 copyright:      Christian Hoener zu Siederdissen, 2014 - 2015
-homepage:       http://www.bioinf.uni-leipzig.de/~choener/
-maintainer:     choener@tbi.univie.ac.at
+homepage:       https://github.com/choener/OrderedBits
+bug-reports:    https://github.com/choener/OrderedBits/issues
+maintainer:     choener@bioinf.uni-leipzig.de
 category:       Data
 license:        BSD3
 license-file:   LICENSE
@@ -14,11 +15,12 @@
 synopsis:       Efficient ordered (by popcount) enumeration of bits
 description:
                 This library provides efficient methods to enumerate all
-                elements of a set in order of the population count. First, the
-                empty set, then all 1-element sets, all 2-element sets, etc.
-                Such enumerations are important for algorithms over unordered
-                data sets. Examples include the travelling salesman problem and
-                the closely related Hamiltonian path problem.
+                elements of a set in order of the population count, or the
+                ordered enumerations of the elements of the powerset of a set.
+                First, the empty set, then all 1-element sets, all 2-element
+                sets, etc.  Such enumerations are important for algorithms over
+                unordered data sets. Examples include the travelling salesman
+                problem and the closely related Hamiltonian path problem.
 
 
 
@@ -28,20 +30,13 @@
 
 
 
-flag llvm
-  description:  build using LLVM
-  default:      False
-  manual:       True
-
-
-
 library
-  build-depends:  base              >= 4.7      && < 4.9
-               ,  bits              == 0.4.*
-               ,  primitive         >= 0.5      && < 0.7
-               ,  QuickCheck        >= 2.7      && < 2.9
-               ,  vector            == 0.10.*
-               ,  vector-algorithms == 0.6.*
+  build-depends: base               >= 4.7      && < 4.9
+               , bits               >= 0.4      && < 0.5
+               , primitive          >= 0.5      && < 0.7
+               , QuickCheck         >= 2.7      && < 2.9
+               , vector             >= 0.10     && < 0.11
+               , vector-algorithms  >= 0.6      && < 0.7.1
   default-language:
     Haskell2010
   default-extensions: BangPatterns
@@ -49,7 +44,6 @@
                     , FlexibleContexts
                     , PatternGuards
                     , ScopedTypeVariables
-
   exposed-modules:
     Data.Bits.Ordered
     Data.Bits.Ordered.QuickCheck
@@ -74,11 +68,6 @@
   ghc-options:
     -O2
     -funbox-strict-fields
-  if flag(llvm)
-    ghc-options:
-      -fllvm
-      -optlo-O3 -optlo-std-compile-opts
-      -fllvm-tbaa
 
 
 
diff --git a/README.md b/README.md
--- a/README.md
+++ b/README.md
@@ -1,10 +1,10 @@
-# OrderedBits
-
 [![Build Status](https://travis-ci.org/choener/OrderedBits.svg?branch=master)](https://travis-ci.org/choener/OrderedBits)
 
+# OrderedBits
+
 The OrderedBits library provides methods to generate unboxed vectors of Ints
 (and others) ordered by their population count or Hamming distance to the 0
-set.
+set. In other words, we enumerate the power set of a given input set.
 
 Such an order is important for dynamic programming algorithms for Hamiltonian
 path problems and the travelling salesman problem.
@@ -13,7 +13,8 @@
 
 #### Contact
 
-Christian Hoener zu Siederdissen
-choener@bioinf.uni-leipzig.de
-http://www.bioinf.uni-leipzig.de/~choener/
+Christian Hoener zu Siederdissen  
+Leipzig University, Leipzig, Germany  
+choener@bioinf.uni-leipzig.de  
+http://www.bioinf.uni-leipzig.de/~choener/  
 
diff --git a/changelog.md b/changelog.md
--- a/changelog.md
+++ b/changelog.md
@@ -1,5 +1,13 @@
+0.0.0.2
+-------
+
+- vector-algorithms version bump
+- removed explicit llvm flag (use --ghc-options)
+
 0.0.0.1
 -------
 
 - initial checkin of the (naive) sorted implementation
 - memoization of Int-sets up to 31 bit
+- non-memo versions (somewhat efficient)
+- travis-ci integration