You'd be surprised. Sometimes its much harder to find hidden faulty logic in a proof for an algorithm's correctness or running time.
If I recall correctly, Ramanujan once wrote a proof for 1=2 that baffled mathematicians for quite some time before they figured out what was wrong. I believe that proof was rather short (< 1 page). For a long proof with a tiny error, things could be much worse.