Here is a proof that such a polynomial does not exist assuming that every admissible $n$-tuple occurs infinitely often in the sequence of primes.
To see this let $a:=(0, a_1, \dots, a_{n-1})$ be an admissible $n$-tuple. Suppose $P \in \mathbb{Z}[x_1, \dots, x_n]$ is such that the function $f(i):=P(p_i,p_{i+1},\dots p_{i+n-1})$ is bounded. Replacing $x_i$ by $x_1+a_{i-1}$ for all $i \in \{2, \dots, n\}$ we obtain a polynomial $Q_a \in \mathbb{Z}[x_1]$. Assuming that the $n$-tuple $a$ occurs infinitely often, we have $Q_a(p_i)=f(i)$ for infinitely many $i$. Since $f(i)$ is bounded, $Q_a$ is a constant. Thus $Q_a=p(a)$ where $p$ is a non-constant polynomial only depending on $P$. Since $P$ takes only finitely many values, $p(a)$ only takes on finitely many values over all admissible $n$-tuples $a$. However, this is impossible.