Exponential growth of random infinite Fibonacci sequences

We consider the recursion $X_{n+1}=\sum_{i=0}^n \epsilon_{n,i}X_{n-i}$, where $\epsilon_{n,i}$ are i.i.d. (Bernoulli) random variables taking values in $\{-1,1\}$, and $X_0=1$, $X_{-j}=0$ for $j>0$. We prove that almost surely, $n^{-1}\log |X_n|\to \bar \gamma>0$, where $\bar \gamma$ is an appropriate Lyapunov exponent. This answers a question of Viswanath and Trefethen (\textit{SIAM J. Matrix Anal. Appl. 19:564--581, 1998}).