(Sorry if this is a naive question; it is not my area!)
Consider the following strengthening of Artin's conjecture on primitive roots (and Dirichlet's theorem) for the case of $n=2$: every arithmetic sequence $a + b \mathbf{Z}$ with $\gcd(a,b)=1$ and $\gcd(a,2)=1$ contains infinitely many primes $p$ such that $2$ is a primitive root mod $p$.
As a particular case, are there infinitely many primes $p \equiv 1 \pmod{4}$ such that $2$ is primitive mod $p$?
Does this follow either from Artin's conjecture (or its quantitative version) or the GRH (like Artin's conjecture does), or something stronger?
For example, the list A001122 of $p$ such that $2$ is a primitive root mod $p$ contains, for every odd prime $q \leq 19$ and every $1 \leq b < q$, an entry $p$ such that $p \equiv b \pmod{q}$. This at least a priori makes it possible to imagine that it contains infinitely many such entries (assuming Artin's conjecture, of course!). Also, without the condition $\gcd(a,2)=1$ (i.e. $a$ is odd), then the strengthening fails, of course, as $2$ is a primitive root mod $p$ only if $p \equiv 3,5 \pmod{8}$ (otherwise it is a quadratic residue).