In the corrupted compass model on a vertex-transitive graph, a neighbouring edge of every vertex is chosen uniformly at random and opened. Additionally, with probability $p$, independently for every vertex, every neighbouring edge is opened. We study the size of open clusters in this model. Hirsch et al. have shown that for small $p$ all open clusters are finite almost surely, while for large $p$, depending on the underlying graph, there exists an infinite open cluster almost surely. We show that the corresponding phase transition is sharp, i.e., in the subcritical regime, all open clusters are exponentially small. Furthermore we prove a mean-field lower bound in the supercritical regime. The proof uses the by now well established method using the OSSS inequality. A second goal of this note is to showcase this method in an uncomplicated setting.