diff --git a/Numeric/Search.hs b/Numeric/Search.hs
--- a/Numeric/Search.hs
+++ b/Numeric/Search.hs
@@ -229,6 +229,7 @@
 -- This splitter assumes that the arguments are Integral, and uses the `div` funtion.
 --
 -- Note that our dividing algorithm always find the mid value for any  @hi-lo >= 2@.
+--
 -- >>> prove $ \x y -> (y .>= x+2 &&& x+2 .> x) ==> let z = (x+1) `sDiv` 2 + y `sDiv` 2  in x .< z &&& z .< (y::SInt32)
 -- Q.E.D.
 
diff --git a/binary-search.cabal b/binary-search.cabal
--- a/binary-search.cabal
+++ b/binary-search.cabal
@@ -1,5 +1,5 @@
 Name:           binary-search
-Version:        1.0
+Version:        1.0.0.1
 Build-Type:     Simple
 License:        BSD3
 license-file:   LICENSE