In property based testing we do not apply a function under test to known inputs and check for known outputs, but state \emph{properties} relating inputs and outputs. We then apply the function to \emph{random} inputs, and verify that the property holds; if not, we found a bug. Randomly generated inputs tend to be large and must be minimised, traditionally using an explicitly provided \emph{shrinker}. In this paper we propose a way to write generators that obsoletes the need to write a separate shrinker. Inspired by the Python library Hypothesis, the approach can work even across monadic bind. Compared to Hypothesis, we claim that our approach is more suitable to the Haskell setting: it depends on minimal set of core principles, and handles generation and shrinking of infinite data structures, including functions.