\section{Supplementary proofs} \subsection{A disjoint counting proof with the constants of Theorem~\ref{th:explicit}} Let $N$, $I$, $\delta$ and $A$ be as in the proof of Theorem~\ref{th:explicit}, and put $w=2\delta N$ and $F(t)=A(t)A(x/t)$. Let $M$ be the number of distinct products in the interval and prime ranges of that theorem. For each $0\le at$ is another start, then $t'\ge t+w\ge(1+\delta)t$. The open left endpoint also takes care of equality. At a single start the two prime ranges are disjoint, so unique factorization counts $F(t)$ different products. Across different starts the larger primes are distinct. Thus $\sum_t F(t)\le M$ at every shift, including shifts on interval boundaries. Integrating in $a$ and translating each lattice term gives \[ wM\ \ge\ \int_0^w\sum_{k\in\mathbb Z}\mathbf 1_I(a+kw)F(a+kw)\,da \ =\ \int_I F(t)\,dt \ \ge\ \frac{7N}{24}\,\frac{\delta^2N^2}{16(\log N)^2}. \] Here the sum is understood as restricted to $a+kw\in I$, so only finitely many terms arise. Dividing by $w$ gives $M\ge(14/3)N$. Each product has weight at least $1/(3N)$, so their total weight is at least $14/9$. Both endpoints are strict: $xe^2$, the unique solution of $512(\log N)^2/N=10^{-13}$ lies between $9790103351710472581$ and $9790103351710472582$. Squaring these bounds shows that $9.6\cdot10^{37}$ exceeds the corresponding threshold in $x$ by about $0.16055\%$. The verifier bounds the logarithms with the series for $2\operatorname{arctanh} z$ and a geometric bound for its tail. \subsection{A fixed-length argument} Let \(N=\sqrt{x}\), \(I=[3N/2,2N]\) and \(J=[N/2,2N/3]\). The map \(t\mapsto x/t\) takes \(I\) onto \(J\), and the inverse derivative has absolute value at most 4. Write \(P^-(n)\) for the smallest prime factor of \(n\). We prove the existence of admissible constants using fixed-length factor intervals. For some absolute \(D\), Proposition~1 of GreniƩ, Molteni and Perelli \cite{GMP}, specialized to the number field \(\mathbb Q\), gives under RH \[ \int_Y^{2Y}|\psi(v+h)-\psi(v)-h|^2\,dv \le D Y(h+\log^2Y)\log^2Y \] for all sufficiently large \(Y\) and \(2\le h\le Y\). Here \(\psi(y)=\sum_{p^a\le y}\log p\). Take \(h=K\log^2 N\) with fixed \(K\ge\max(1,192D)\). On each of \([N,2N]\) and \([N/2,N]\), the starts with a \(\psi\)-increment below \(h/2\) have measure at most \(8DY/K\), with \(Y=N,N/2\) respectively. On \(I\), the union of these exceptions and the reciprocals of the second set has measure at most \(24DN/K\le N/8\). Let \(G\) be the set of starts in \(I\) giving two large increments. Then \(|G|\ge N/4\). For \(v\in[N/2,2N]\), the interval \((v,v+h]\) has at most one integer \(a\)-th power for each \(a\ge2\), once \(N\) is sufficiently large. Indeed consecutive \(a\)-th powers in the interval would be separated by at least \((N/2)^{(a-1)/a}\ge\sqrt{N/2}>h\). The total higher-prime-power weight in such an interval is therefore at most \[ \log(3N)\sum_{2\le a\le\log(3N)/\log 2}\frac1a =O(\log N\log\log N)=o(h). \] Each good interval then contains at least \(h/(4\log(3N))\) primes. Choose a shift \(a\in[0,h)\) for which the grid \(a+h\mathbb Z\) meets \(G\) at least \(N/(4h)\) times. Such a shift exists because \[ \int_0^h \sum_{k\in\mathbb Z}\mathbf 1_G(a+kh)\,da=|G|. \] The intervals \((t,t+h]\) for these grid starts are disjoint. At each start there are at least \(h^2/(16\log^2(3N))\) pairs. For large \(N\) we have \(x/t+he^2\) and \(131072\cdot63^2/10^{21}<10^{-8}\). For \(Y=2N,2N/3\) one has \(\log Y\le2L\). Thus the coefficient in the mean-square bound \(3\delta Y^2L^2\) can be replaced by \(808\). The same applications of Chebyshev give \(|B_I|,|B_J|\le (64\cdot808/9)L^2/\delta\). At least \[ N\left(\frac12-\frac{320\cdot808}{9\cdot131072}\right)>N/4 \] units of \(t\) give two good starts. The incidence argument then gives at least \(\delta N^2/(128L^2)=1024N\) distinct products, with weight at least \(1024/3\), in \((x,x+98304\sqrt{x}(\log x)^2]\).