In his paper "On systems of complexity one in the primes", Henriot showed that any subset of the primes up to N of relative density at least C(log log N)-c contains a non-trivial solution to a given system of linear equations of complexity 1. In this talk we explain the mathematics underlying this result, and discuss some possible extensions and related problems.