Durrett's mixing-time conjecture for lazy random walk on random 3-regular graphs

Let $G\sim\mathcal{G}(n,3)$ be a random $3$-regular graph, and consider the lazy random walk on $G$. Its mixing time is measured in total variation and the lazy walk stays in place with probability $1/2$ at each step. Durrett's conjecture. The mixing time for the lazy random walk on the random $3$-regular graph is asymptotically

$$6\log_2 n.$$

Durrett's conjecture gives the conjectured sharp value of the asymptotic mixing time following the previously established lower bound; the source does not state whether it has been resolved.