  Let $a_1, \dots, a_n \in \mathbb{R}$ satisfy $\sum_i a_i^2 = 1$, and let
$\varepsilon_1, \ldots, \varepsilon_n$ be uniformly random $\pm 1$ signs and $X
= \sum_{i=1}^{n} a_i \varepsilon_i$. It is conjectured that $X = \sum_{i=1}^{n}
a_i \varepsilon_i$ has $\Pr[X \geq 1] \geq 7/64$. The best lower bound so far
is $1/20$, due to Oleszkiewicz. In this paper we improve this to $\Pr[X \geq 1]
\geq 6/64$.
