Paley graph extractor conjecture

Let $p$ be an odd prime, let $n=\lceil\log_2 p\rceil$, and let $\operatorname{Ext}_p:\mathbb{F}_p\times\mathbb{F}_p\to\{0,1\}$ be the Paley graph extractor defined from the quadratic character of $\mathbb{F}_p$. A two-source $(k,\epsilon)$-extractor is an extractor for two independent sources on $\{0,1\}^n$ whose min-entropy is at least $k$ and whose error is at most $\epsilon$. Paley graph extractor conjecture. For every $0<\alpha<1$, $\operatorname{Ext}_p$ is a two-source $(\alpha n,\epsilon)$-extractor for some negligible $\epsilon$. This is the conjecture introduced by Chor and Goldreich and is supported in the paper by the Paley graph conjecture; it remains open.