diff --git a/docs/license-report.md b/docs/license-report.md
--- a/docs/license-report.md
+++ b/docs/license-report.md
@@ -11,7 +11,7 @@
 | **`base`** | [`4.20.0.0`](http://hackage.haskell.org/package/base-4.20.0.0) | [`BSD-3-Clause`](http://hackage.haskell.org/package/base-4.20.0.0/src/LICENSE) | Core data structures and operations | *(core library)* |
 | `deriving-compat` | [`0.6.7`](http://hackage.haskell.org/package/deriving-compat-0.6.7) | [`BSD-3-Clause`](http://hackage.haskell.org/package/deriving-compat-0.6.7/src/LICENSE) | Backports of GHC deriving extensions |  |
 | `hedgehog` | [`1.5`](http://hackage.haskell.org/package/hedgehog-1.5) | [`BSD-3-Clause`](http://hackage.haskell.org/package/hedgehog-1.5/src/LICENSE) | Release with confidence. |  |
-| `yaya` | [`0.6.2.2`](http://hackage.haskell.org/package/yaya-0.6.2.2) | [`AGPL-3.0-or-later`](http://hackage.haskell.org/package/yaya-0.6.2.2/src/LICENSE) | Total recursion schemes. |  |
+| `yaya` | [`0.6.2.3`](http://hackage.haskell.org/package/yaya-0.6.2.3) |  *MISSING* | *MISSING* |  |
 
 ## Indirect transitive dependencies
 
@@ -69,7 +69,7 @@
 | `primitive` | [`0.9.0.0`](http://hackage.haskell.org/package/primitive-0.9.0.0) | [`BSD-3-Clause`](http://hackage.haskell.org/package/primitive-0.9.0.0/src/LICENSE) | Primitive memory-related operations | `hedgehog`, `resourcet`, `vector` |
 | **`process`** | [`1.6.19.0`](http://hackage.haskell.org/package/process-1.6.19.0) | [`BSD-3-Clause`](http://hackage.haskell.org/package/process-1.6.19.0/src/LICENSE) | Process libraries | `concurrent-output` |
 | `profunctors` | [`5.6.2`](http://hackage.haskell.org/package/profunctors-5.6.2) | [`BSD-3-Clause`](http://hackage.haskell.org/package/profunctors-5.6.2/src/LICENSE) | Profunctors | `adjunctions`, `either`, `free`, `invariant`, `kan-extensions`, `lens`, `yaya` |
-| `random` | [`1.2.1.3`](http://hackage.haskell.org/package/random-1.2.1.3) | [`BSD-3-Clause`](http://hackage.haskell.org/package/random-1.2.1.3/src/LICENSE) | Pseudo-random number generation | `hedgehog` |
+| `random` | [`1.3.0`](http://hackage.haskell.org/package/random-1.3.0) | [`BSD-3-Clause`](http://hackage.haskell.org/package/random-1.3.0/src/LICENSE) | Pseudo-random number generation | `hedgehog` |
 | `reflection` | [`2.1.9`](http://hackage.haskell.org/package/reflection-2.1.9) | [`BSD-3-Clause`](http://hackage.haskell.org/package/reflection-2.1.9/src/LICENSE) | Reifies arbitrary terms into types that can be reflected back into terms | `lens` |
 | `resourcet` | [`1.3.0`](http://hackage.haskell.org/package/resourcet-1.3.0) | [`BSD-3-Clause`](http://hackage.haskell.org/package/resourcet-1.3.0/src/LICENSE) | Deterministic allocation and freeing of scarce resources. | `hedgehog` |
 | `safe-exceptions` | [`0.1.7.4`](http://hackage.haskell.org/package/safe-exceptions-0.1.7.4) | [`MIT`](http://hackage.haskell.org/package/safe-exceptions-0.1.7.4/src/LICENSE) | Safe, consistent, and easy exception handling | `hedgehog` |
@@ -85,7 +85,7 @@
 | `th-abstraction` | [`0.7.1.0`](http://hackage.haskell.org/package/th-abstraction-0.7.1.0) | [`ISC`](http://hackage.haskell.org/package/th-abstraction-0.7.1.0/src/LICENSE) | Nicer interface for reified information about data types | `bifunctors`, `deriving-compat`, `free`, `invariant`, `lens`, `yaya` |
 | `these` | [`1.2.1`](http://hackage.haskell.org/package/these-1.2.1) | [`BSD-3-Clause`](http://hackage.haskell.org/package/these-1.2.1/src/LICENSE) | An either-or-both data type. | `lens`, `strict` |
 | **`time`** | [`1.12.2`](http://hackage.haskell.org/package/time-1.12.2) | [`BSD-2-Clause`](http://hackage.haskell.org/package/time-1.12.2/src/LICENSE) | A time library | `directory`, `hedgehog`, `unix` |
-| **`transformers`** | [`0.6.1.1`](http://hackage.haskell.org/package/transformers-0.6.1.1) | [`BSD-3-Clause`](http://hackage.haskell.org/package/transformers-0.6.1.1/src/LICENSE) | Concrete functor and monad transformers | `StateVar`, `adjunctions`, `barbies`, `bifunctors`, `boring`, `comonad`, `concurrent-output`, `constraints`, `contravariant`, `deriving-compat`, `distributive`, `exceptions`, `free`, `hedgehog`, `indexed-traversable`, `invariant`, `kan-extensions`, `lens`, `mmorph`, `monad-control`, `mtl`, `primitive`, `profunctors`, `resourcet`, `safe-exceptions`, `semigroupoids`, `strict`, `tagged`, `transformers-base`, `transformers-compat`, `unliftio-core`, `yaya` |
+| **`transformers`** | [`0.6.1.1`](http://hackage.haskell.org/package/transformers-0.6.1.1) | [`BSD-3-Clause`](http://hackage.haskell.org/package/transformers-0.6.1.1/src/LICENSE) | Concrete functor and monad transformers | `StateVar`, `adjunctions`, `barbies`, `bifunctors`, `boring`, `comonad`, `concurrent-output`, `constraints`, `contravariant`, `deriving-compat`, `distributive`, `exceptions`, `free`, `hedgehog`, `indexed-traversable`, `invariant`, `kan-extensions`, `lens`, `mmorph`, `monad-control`, `mtl`, `primitive`, `profunctors`, `random`, `resourcet`, `safe-exceptions`, `semigroupoids`, `strict`, `tagged`, `transformers-base`, `transformers-compat`, `unliftio-core`, `yaya` |
 | `transformers-base` | [`0.4.6`](http://hackage.haskell.org/package/transformers-base-0.4.6) | [`BSD-3-Clause`](http://hackage.haskell.org/package/transformers-base-0.4.6/src/LICENSE) | Lift computations from the bottom of a transformer stack | `free`, `hedgehog`, `lifted-async`, `lifted-base`, `monad-control` |
 | `transformers-compat` | [`0.7.2`](http://hackage.haskell.org/package/transformers-compat-0.7.2) | [`BSD-3-Clause`](http://hackage.haskell.org/package/transformers-compat-0.7.2/src/LICENSE) | A small compatibility shim for the transformers library | `adjunctions`, `comonad`, `deriving-compat`, `invariant`, `lens`, `mmorph`, `monad-control`, `semigroupoids`, `transformers-base` |
 | **`unix`** | [`2.8.5.1`](http://hackage.haskell.org/package/unix-2.8.5.1) | [`BSD-3-Clause`](http://hackage.haskell.org/package/unix-2.8.5.1/src/LICENSE) | POSIX functionality | `concurrent-output`, `directory`, `process` |
diff --git a/yaya-hedgehog.cabal b/yaya-hedgehog.cabal
--- a/yaya-hedgehog.cabal
+++ b/yaya-hedgehog.cabal
@@ -1,7 +1,7 @@
 cabal-version: 3.0
 
 name: yaya-hedgehog
-version: 0.3.0.4
+version: 0.3.0.5
 synopsis: Hedgehog testing support for the Yaya recursion scheme library.
 description: If you use Yaya in your own code and have tests written
              using Hedgehog, then this library will help you with
@@ -180,7 +180,7 @@
   hs-source-dirs: tests
   main-is: doctests.hs
   build-depends:
-    doctest ^>= {0.16.0, 0.18.1, 0.20.1, 0.21.1, 0.22.2},
+    doctest ^>= {0.16.0, 0.18.1, 0.20.1, 0.21.1, 0.22.2, 0.24.0},
     yaya-hedgehog,
   if impl(ghc >= 8.10.1)
     ghc-options:
