diff --git a/Changelog b/Changelog
new file mode 100644
--- /dev/null
+++ b/Changelog
@@ -0,0 +1,3 @@
+0.2 Added Miller Rabin Test
+0.1 Adaptive prime wheels for primes
+0.0 Initial version
diff --git a/Data/Numbers.hs b/Data/Numbers.hs
--- a/Data/Numbers.hs
+++ b/Data/Numbers.hs
@@ -3,6 +3,7 @@
 (
     primes,
     isPrime,
+    isProbablyPrime,
     primeFactors,
     numOfFactors,
     factorSum,
diff --git a/Numbers.cabal b/Numbers.cabal
--- a/Numbers.cabal
+++ b/Numbers.cabal
@@ -1,5 +1,5 @@
 Name:                Numbers
-Version:             0.1
+Version:             0.2
 Cabal-Version: >= 1.2
 Synopsis:            An assortment of number theoretic functions
 Description:         Functions for finding prime numbers, checking whether a number is prime, finding the factors of a number etc.
@@ -8,12 +8,14 @@
 Author:              Adrian Neumann
 Category:            Algorithms, Number Theory
 Maintainer:          aneumann@inf.fu-berlin.de
+Homepage:            http://page.mi.fu-berlin.de/aneumann/numbers/index.html
 stability:           alpha
 build-type:          Simple
-extra-source-files:  README, test.hs, lgpl-3.0.txt
+extra-source-files:  README, Changelog, test.hs, lgpl-3.0.txt
 
 Library
     exposed-modules:     Data.Numbers
     build-depends: 
-         base
+         base,
+         random >= 1.0.0.1
     GHC-Options:    -O2
diff --git a/test.hs b/test.hs
--- a/test.hs
+++ b/test.hs
@@ -1,5 +1,6 @@
 import Data.Numbers
 import Data.List
+import System.Random
 
 test_primes = take 1000 primes == take 1000 check where
     check =  sieve [2..]
@@ -9,3 +10,5 @@
 test_isprime = and $ map (isPrime) $ take 1000 primes
 
 test_primeFactors = let l = take 5 primes in sort (primeFactors (product l)) == sort l
+
+test_millerRabin =and $ map (fst.flip isProbablyPrime (mkStdGen 42)) (take 5000 primes)