What a Proof Is · Challenge problem

Claim: "if $p$ is prime, then $2^p - 1$ is prime." It holds for $p = 2, 3, 5, 7$ (giving $3, 7, 31, 127$). What is the smallest prime $p$ for which it fails?