Let $\Phi$ be a uniformly random $k$-SAT formula with $n$ variables and $m$
clauses. We study the algorithmic task of finding a satisfying assignment of
$\Phi$. It is known that satisfying assignments exist with high probability up
to clause density $m/n = 2^k \log 2 - \frac12 (\log 2