diff --git a/Data/Buffon/Machine.hs b/Data/Buffon/Machine.hs
--- a/Data/Buffon/Machine.hs
+++ b/Data/Buffon/Machine.hs
@@ -128,7 +128,7 @@
 -- | Computations consuming random bits using RBGs.
 --   Note that the implementation is essentially a State monad,
 --   passing RNG throughout its computations.
-type BuffonMachine g a = State (Rand g) a
+type BuffonMachine g = State (Rand g)
 
 -- | Runs the given Buffon machine within the IO monad
 --    using StdGen as its random bit oracle.
@@ -513,9 +513,6 @@
         if c' < n then return c'
                   else uniform' n (v' - n) (c' - n)
                else uniform' n v' c'
-
--- | Lays out a given set of probabilities p_1,...,p_n
---   such that p_1 + ... + p_n = 1 on the segment [0,1).
 
 -- | Given a set of probabilities p_1 up to p_{n-1}, 'layout'
 --   aligns them on the [0,1) real line segment, assigning
diff --git a/buffon-machines.cabal b/buffon-machines.cabal
--- a/buffon-machines.cabal
+++ b/buffon-machines.cabal
@@ -1,5 +1,5 @@
 name:           buffon-machines
-version:        1.1.1.0
+version:        1.1.1.1
 synopsis:       Perfect simulation of discrete random variables
 description:    Monadic implementation of Buffon machines meant for perfect simulation of discrete random variables
 homepage:       https://github.com/maciej-bendkowski/buffon-machines#readme