diff --git a/ChangeLog.md b/ChangeLog.md
--- a/ChangeLog.md
+++ b/ChangeLog.md
@@ -1,3 +1,7 @@
+## 0.9.2.1
+
+* Tweak test suite for 32-bit systems [#78](https://github.com/snoyberg/mono-traversable/issues/78)
+
 ## 0.9.2
 
 * MonoComonad
diff --git a/mono-traversable.cabal b/mono-traversable.cabal
--- a/mono-traversable.cabal
+++ b/mono-traversable.cabal
@@ -1,5 +1,5 @@
 name:                mono-traversable
-version:             0.9.2
+version:             0.9.2.1
 synopsis:            Type classes for mapping, folding, and traversing monomorphic containers
 description:         Monomorphic variants of the Functor, Foldable, and Traversable typeclasses. If you understand Haskell's basic typeclasses, you understand mono-traversable. In addition to what you are used to, it adds on an IsSequence typeclass and has code for marking data structures as non-empty.
 homepage:            https://github.com/snoyberg/mono-traversable
diff --git a/test/Spec.hs b/test/Spec.hs
--- a/test/Spec.hs
+++ b/test/Spec.hs
@@ -145,9 +145,10 @@
 
     describe "index" $ do
         let test name dummy = prop name $
-              \(NonNegative i) (QCM.NonEmpty xs) ->
+              \(NonNegative i') (QCM.NonEmpty xs) ->
                 let seq' = fromListAs xs dummy
                     mx   = index xs (fromIntegral i)
+                    i    = fromIntegral (i' :: Int)
                  in do
                     mx @?= index seq' i
                     case mx of