86 unknowns for Hilbert's tenth problem over the rationals

Recently, Hilbert’s Tenth Problem over the field $\mathbb{Q}$ of rational numbers was solved negatively by OpenAI based on a five-contact height estimate and a pole-parity construction. In this paper, we prove further that there is no algorithm to decide for any polynomial $P(x_1,\dots ,x_{86})$ with integer coefficients whether the equation $P(x_1,\dots ,x_{86})=0$ has solutions with $x_1,\dots ,x_{86}\in \mathbb{Q}$.