A common technique for proving that a diophantine equation does not have a solution is to prove that it does not have a solution mod $m$ for a suitable modulus $m$.
This technique works with $m=11$ for the equation $x^5 - y^2 = 4$ mentioned in this question.
Now, $11$ seems to be the only prime modulus that works. Moreover, the other moduli that work are all multiples of $11$. (I've tested all moduli up to $10^4$.)
(This is probably related to the rational points in the hyperelliptic curve $y^2=x^5-4$, but I don't know anything about this.)
Is it true that $11$ is the only prime modulus that works for that equation?