diff --git a/ChangeLog.md b/ChangeLog.md
--- a/ChangeLog.md
+++ b/ChangeLog.md
@@ -1,3 +1,9 @@
+# 0.0.3 (2015-05-16)
+
+* Rename System.Random.MemoRandom as System.Random.Memoized.
+* Re-export System.Random from System.Random.Memoized.
+* Add benchmarking results to the documentation.
+
 # 0.0.2 (2015-05-15)
 
 * Implement memoized randomRs', randoms', randomRIO', randomIO'.
diff --git a/README.md b/README.md
--- a/README.md
+++ b/README.md
@@ -9,3 +9,11 @@
 
 [StdGen]: http://hackage.haskell.org/package/random/docs/System-Random.html#t:StdGen
 [Int]:    https://hackage.haskell.org/package/base/docs/Prelude.html#t:Int
+
+In a benchmark, the initial generation of 100000 random `Int`s took 10.30
+seconds and consumed 2.5 gigabytes of memory. Generating the 100000 `Int`s
+again from the same seed only took 2.06 seconds, a 5-fold speedup thanks to
+memoization!
+
+Incidentally, generating the 100000 `Int`s with the non-memoized function took
+0.12 seconds, but that of course lacks all the benefits of memoization.
diff --git a/acme-memorandom.cabal b/acme-memorandom.cabal
--- a/acme-memorandom.cabal
+++ b/acme-memorandom.cabal
@@ -1,6 +1,6 @@
 name: acme-memorandom
 category: ACME
-version: 0.0.2
+version: 0.0.3
 license: MIT
 license-file: LICENSE
 author: Johan Kiviniemi <devel@johan.kiviniemi.name>
@@ -15,6 +15,14 @@
   a lazy table indexed by serialized 'StdGen'. Monomorphism is used to
   facilitate memoization, users should adapt their design to work with random
   'Int' values only.
+  .
+  In a benchmark, the initial generation of 100000 random 'Int's took 10.30
+  seconds and consumed 2.5 gigabytes of memory. Generating the 100000 'Int's
+  again from the same seed only took 2.06 seconds, a 5-fold speedup thanks to
+  memoization!
+  .
+  Incidentally, generating the 100000 'Int's with the non-memoized function
+  took 0.12 seconds, but that of course lacks all the benefits of memoization.
 tested-with: GHC == 7.10.1
 
 build-type: Simple
@@ -29,7 +37,7 @@
   location: https://github.com/ion1/acme-memorandom.git
 
 library
-  exposed-modules: System.Random.MemoRandom
+  exposed-modules: System.Random.Memoized
   hs-source-dirs: src
   other-extensions: CPP, TypeFamilies, TypeOperators
   build-depends: base == 4.*
diff --git a/src/System/Random/MemoRandom.hs b/src/System/Random/MemoRandom.hs
deleted file mode 100644
--- a/src/System/Random/MemoRandom.hs
+++ /dev/null
@@ -1,86 +0,0 @@
-{-# LANGUAGE CPP #-}
-{-# LANGUAGE TypeFamilies #-}
-{-# LANGUAGE TypeOperators #-}
-
--- |
--- Module      : Systen.Random.MemoRandom
--- Description : Memoized random number generation
--- Copyright   : © 2015 Johan Kiviniemi
--- License     : MIT
--- Maintainer  : Johan Kiviniemi <devel@johan.kiviniemi.name>
--- Stability   : provisional
--- Portability : TypeFamilies, TypeOperators
---
--- A library for generating random numbers in a memoized manner. Implemented as
--- a lazy table indexed by serialized 'StdGen'. Monomorphism is used to
--- facilitate memoization, users should adapt their design to work with random
--- 'Int' values only.
-module System.Random.MemoRandom
-  ( randomR'
-  , random'
-  , randomRs'
-  , randoms'
-  , randomRIO'
-  , randomIO'
-  ) where
-
-import Data.MemoTrie
-import System.Random
-
-#ifdef __GLASGOW_HASKELL__
-import GHC.Exts (build)
-#else
--- | A dummy variant of build without fusion.
-{-# INLINE build #-}
-build :: ((a -> [a] -> [a]) -> [a] -> [a]) -> [a]
-build g = g (:) []
-#endif
-
-newtype StdGen' = StdGen' { unStdGen' :: StdGen }
-
-instance HasTrie StdGen' where
-  newtype StdGen' :->: a = StdGenTrie' (String :->: a)
-  trie f = StdGenTrie' (trie (f . StdGen' . read))
-  untrie (StdGenTrie' t) = untrie t . show . unStdGen'
-  enumerate (StdGenTrie' t) = [ (StdGen' (read a), b) | (a,b) <- enumerate t ]
-
--- | A memoized variant of 'randomR'.
-randomR' :: (Int, Int) -> StdGen -> (Int, StdGen)
-randomR' ival = memo2 (\ival' -> randomR ival' . unStdGen') ival . StdGen'
-
--- | A memoized variant of 'random'.
-random' :: StdGen -> (Int, StdGen)
-random' = memo (random . unStdGen') . StdGen'
-
--- | A memoized variant of 'randomRs'.
-{-# INLINE randomRs' #-}
-randomRs' :: (Int, Int) -> StdGen -> [Int]
-randomRs' ival g = build (\cons _nil -> buildRandoms cons (randomR' ival) g)
-
--- | A memoized variant of 'randoms'.
-{-# INLINE randoms' #-}
-randoms' :: StdGen -> [Int]
-randoms' g = build (\cons _nil -> buildRandoms cons random' g)
-
--- | A memoized variant of 'randomRIO'.
-randomRIO' :: (Int, Int) -> IO Int
-randomRIO' ival = getStdRandom (randomR' ival)
-
--- | A memoized variant of 'randomIO'.
-randomIO' :: IO Int
-randomIO' = getStdRandom random'
-
--- | Produce an infinite list-equivalent of random values.
---
--- Copied from System.Random verbatim (but originally written by the author of
--- MemoRandom, commit 4695ffa).
-{-# INLINE buildRandoms #-}
-buildRandoms :: RandomGen g
-             => (a -> as -> as)  -- ^ E.g. '(:)' but subject to fusion
-             -> (g -> (a,g))     -- ^ E.g. 'random'
-             -> g                -- ^ A 'RandomGen' instance
-             -> as
-buildRandoms cons rand = go
-  where
-    -- The seq fixes part of #4218 and also makes fused Core simpler.
-    go g = x `seq` (x `cons` go g') where (x,g') = rand g
diff --git a/src/System/Random/Memoized.hs b/src/System/Random/Memoized.hs
new file mode 100644
--- /dev/null
+++ b/src/System/Random/Memoized.hs
@@ -0,0 +1,95 @@
+{-# LANGUAGE CPP #-}
+{-# LANGUAGE TypeFamilies #-}
+{-# LANGUAGE TypeOperators #-}
+
+-- |
+-- Module      : Systen.Random.Memoized
+-- Description : Memoized random number generation
+-- Copyright   : © 2015 Johan Kiviniemi
+-- License     : MIT
+-- Maintainer  : Johan Kiviniemi <devel@johan.kiviniemi.name>
+-- Stability   : provisional
+-- Portability : CPP, TypeFamilies, TypeOperators
+--
+-- A library for generating random numbers in a memoized manner. Implemented as
+-- a lazy table indexed by serialized 'StdGen'. Monomorphism is used to
+-- facilitate memoization, users should adapt their design to work with random
+-- 'Int' values only.
+--
+-- In a benchmark, the initial generation of 100000 random 'Int's took 10.30
+-- seconds and consumed 2.5 gigabytes of memory. Generating the 100000 'Int's
+-- again from the same seed only took 2.06 seconds, a 5-fold speedup thanks to
+-- memoization!
+--
+-- Incidentally, generating the 100000 'Int's with the non-memoized function
+-- took 0.12 seconds, but that of course lacks all the benefits of memoization.
+module System.Random.Memoized
+  ( randomR'
+  , random'
+  , randomRs'
+  , randoms'
+  , randomRIO'
+  , randomIO'
+  , module System.Random
+  ) where
+
+import Data.MemoTrie
+import System.Random
+
+#ifdef __GLASGOW_HASKELL__
+import GHC.Exts (build)
+#else
+-- | A dummy variant of build without fusion.
+{-# INLINE build #-}
+build :: ((a -> [a] -> [a]) -> [a] -> [a]) -> [a]
+build g = g (:) []
+#endif
+
+newtype StdGen' = StdGen' { unStdGen' :: StdGen }
+
+instance HasTrie StdGen' where
+  newtype StdGen' :->: a = StdGenTrie' (String :->: a)
+  trie f = StdGenTrie' (trie (f . StdGen' . read))
+  untrie (StdGenTrie' t) = untrie t . show . unStdGen'
+  enumerate (StdGenTrie' t) = [ (StdGen' (read a), b) | (a,b) <- enumerate t ]
+
+-- | A memoized variant of 'randomR'.
+randomR' :: (Int, Int) -> StdGen -> (Int, StdGen)
+randomR' ival = memo2 (\ival' -> randomR ival' . unStdGen') ival . StdGen'
+
+-- | A memoized variant of 'random'.
+random' :: StdGen -> (Int, StdGen)
+random' = memo (random . unStdGen') . StdGen'
+
+-- | A memoized variant of 'randomRs'.
+{-# INLINE randomRs' #-}
+randomRs' :: (Int, Int) -> StdGen -> [Int]
+randomRs' ival g = build (\cons _nil -> buildRandoms cons (randomR' ival) g)
+
+-- | A memoized variant of 'randoms'.
+{-# INLINE randoms' #-}
+randoms' :: StdGen -> [Int]
+randoms' g = build (\cons _nil -> buildRandoms cons random' g)
+
+-- | A memoized variant of 'randomRIO'.
+randomRIO' :: (Int, Int) -> IO Int
+randomRIO' ival = getStdRandom (randomR' ival)
+
+-- | A memoized variant of 'randomIO'.
+randomIO' :: IO Int
+randomIO' = getStdRandom random'
+
+-- | Produce an infinite list-equivalent of random values.
+--
+-- Copied from System.Random verbatim (but originally written by the author of
+-- Memoized, commit 4695ffa).
+{-# INLINE buildRandoms #-}
+buildRandoms :: RandomGen g
+             => (a -> as -> as)  -- ^ E.g. '(:)' but subject to fusion
+             -> (g -> (a,g))     -- ^ E.g. 'random'
+             -> g                -- ^ A 'RandomGen' instance
+             -> as
+buildRandoms cons rand = go
+  where
+    -- The seq fixes part of #4218 and also makes fused Core simpler.
+    go g = x `seq` (x `cons` go g') where (x,g') = rand g