diff --git a/benchmark/Main.hs b/benchmark/Main.hs
deleted file mode 100644
--- a/benchmark/Main.hs
+++ /dev/null
@@ -1,88 +0,0 @@
-{-# LANGUAGE BangPatterns #-}
-module Main where
-
-import Control.Monad
-import Control.Applicative
-
-import System.Random
-
-import Data.Maybe
-import Data.Time.Clock
-
-import Network.Haskoin.Crypto.ECDSA
-import Network.Haskoin.Crypto.Keys
-import Network.Haskoin.Crypto.Point
-import Network.Haskoin.Crypto.Ring
-import Network.Haskoin.Crypto.Curve
-
-
-bench :: Int -> String -> IO a -> IO a
-bench n s f = do
-    start <- getCurrentTime
-    !r <- f
-    end <- getCurrentTime
-    let t = (diffUTCTime end start)
-    putStrLn $ "----------------------------"
-    putStrLn $ s ++ " (" ++ (show n) ++ " samples)"
-    putStrLn $ "Total time: " ++ (show t)
-    putStrLn $ "Op/sec    : " ++ (show $ (fromIntegral n)/t)
-    seq r $ return r
-
-main :: IO ()
-main = do
-
-    _ <- bench (10^(7 :: Int)) "Ring multiplication (mod n)" 
-        (return $ testRing $ 10^(7 :: Int))
-        
-    _ <- bench (10^(5 :: Int)) "Ring inversion (mod n)" 
-        (return $ invRing $ 10^(5 :: Int))
-
-    let elems = 2000
-        msg   = fromInteger $ curveN - 10
-
-    !priv <- replicateM elems $
-                (fromJust . makePrvKey) <$> 
-                getStdRandom (randomR (1, curveN))
-
-    !pub <- bench elems "Point multiplications" $ forM priv $ \x -> 
-        return $! derivePubKey x
-
-    _ <- bench 100000 "Point additions" $ 
-        forM (take 100000 $ cycle pub) $ \x -> do
-            let !a = pubKeyPoint x
-            return $! addPoint a a
-
-    _ <- bench 100000 "Point doubling" $ 
-        forM (take 100000 $ cycle pub) $ \x -> do
-            let !a = pubKeyPoint x
-            return $! doublePoint a
-
-    _ <- bench elems "Shamirs trick" $ 
-        forM (priv `zip` pub) $ \(d,q) -> do
-            let !a = prvKeyFieldN d
-                !b = pubKeyPoint q
-            return $! shamirsTrick a b a b
-
-    !sigs <- bench elems "Signature creations" $ 
-        withSource devURandom $! forM priv (signMsg msg) 
-        
-    _ <- bench elems "Signature verifications" $ 
-        forM (sigs `zip` pub) $ \(s,q) -> 
-            return $! verifySig msg s q
-
-    return ()
-
-testRing :: Int -> FieldN
-testRing maxVal = go 2 0
-  where 
-    go i n
-        | n < maxVal = go (i*i) (n + 1)
-        | otherwise = i
-
-invRing :: Int -> FieldN
-invRing maxVal = go 1 0
-  where 
-    go i n
-        | n < maxVal = go ((inverseN i) + 1) (n + 1)
-        | otherwise = i
-
diff --git a/haskoin-crypto.cabal b/haskoin-crypto.cabal
--- a/haskoin-crypto.cabal
+++ b/haskoin-crypto.cabal
@@ -1,5 +1,5 @@
 name:                  haskoin-crypto
-version:               0.0.1
+version:               0.0.1.1
 synopsis:              Implementation of Bitcoin cryptographic primitives.
 description:
   This package provides the elliptic curve cryptography required for creating
@@ -68,22 +68,5 @@
                        test-framework-hunit       == 0.3.*, 
                        HUnit                      == 1.2.*
     hs-source-dirs:    . tests
-    ghc-options:       -Wall -fno-warn-orphans
-
-Benchmark bench-haskoin-crypto
-    type:              exitcode-stdio-1.0
-    main-is:           Main.hs
-    build-depends:     base         == 4.6.*, 
-                       containers   == 0.5.*,
-                       mtl          == 2.1.*, 
-                       binary       == 0.7.*, 
-                       bytestring   == 0.10.*, 
-                       byteable     == 0.1.*,
-                       cryptohash   == 0.11.*,
-                       haskoin-util == 0.0.*,
-                       time         == 1.4.*,
-                       random       == 1.0.*
-    hs-source-dirs:    . benchmark
-    ghc-prof-options:  -auto-all -with-rtsopts=-p
     ghc-options:       -Wall -fno-warn-orphans