Is the following conjecture true?

__Conjecture.__ If $r > s \ge 1$ are relatively prime integers such that
\begin{equation}
	 (r-s)^4-1 \equiv 0\!\pmod{4r^2s},  \tag{1}
\end{equation}
then $r-s = 1$ or $2r > 3s$.

A brute-force computer search has so far found only solutions with $r-s=1$ and the two additional solutions $(r,s)=(10,3)$ and $(r,s)=(255,4)$. [_n.b._ Noam Elkies confirmed the conjecture up to $r = 3 \cdot 2^{22} > 1.25 \cdot 10^7$ using __gp__.]

I posted [a partial proof on MSE][1], but got no help despite several upvotes and a bounty offer (which has since expired).

The motivation for the proof is the application of Vieta jumping to equations greater than the second degree, primarily as a method of attacking Thue equations. So although any proof of the conjecture would be nice, a completion of my partial proof would be preferred.

  [1]: http://math.stackexchange.com/questions/921872/seeking-help-extending-vieta-jumping-to-higher-powers