Let $p_i$ be the ith prime number and $h_k:= p_{i+1}p_{i+2}\cdots p_{i+k}$. Is there for every $i\in \mathbb{N}$ a $k\in \mathbb{N}$ such that $h_k\equiv 1 \mod p_1p_2\cdots p_i$?

It seems sure that it is true but will never be proven. Let me give a much stronger conjecture which would imply this one. Let $m$ be some modulus such as $m=p_1p_2\cdots p_i$ and let $r_j=p_j \mod{m}.$ Once $r_j$ is larger than the largest prime divisor of $m$ there are $\phi(m)$ values that $r_j$ can take. One would like to say that the sequence $r_k,r_{k+1},r_{k+2},\cdots$ behaves like a fair random die with $\phi(m)$ sides. However, as stated that is not true. We do know that the proportion of primes taking any given value is asymptotically $1/\phi(m).$ Looking at the prime number race between $4m+1$ and $4m+3$, the class $4m+1$ is in the lead infinitely often however the proportion of the time that it is in the lead goes to 0. It first pulls into the lead at the prime 26861 then loses it at 26863 and next pulls into the lead at various values between 616,000 and 634,000 and then not again until past 12,300,000. I imagine that similar things are true for any modulus $m.$ Also, in the short run the values are nowhere close to being independent. For example $r_{s+1}=r_s$ is not possible until $s$ is large: For $n \gt 3$ There is a prime between $n$ and $2n2$ so we certainly can't have $r_s=r_{s+1}$ until $p_s \ge m.$ In fact there is a prime between $x$ and $x(1+1/16597)$ provided that $x \gt 2,010,760$ so we would need to have $p_s \gt 16597m$ provided that $m$ was large enough. The conjecture is (in part) that in the long run the proportion of times this (or any other possible pair ) happens is $1/\phi(m)^2.$ Here is the stronger conjecture (for which I claim no originality, It is either too naive or else fairly common, I just couldn't find it stated in exactly this form:)
Were this true then one could have $h_k,h_{k+1},\cdots,h_{k+\phi(m)}$ walk through all the possible residues in any desired order (a small detail is left to the reader.) However this would take a fantastically long time and much longer than is likely to be needed to get some $h_k$ be $1\mod{m}.$ 

