Simultaneous Prime-Free Runs After Even Powers with Prime Indices

For any fixed finite nonempty set \( Q\) of primes, this note proves that infinitely many prime indices \(r\) simultaneously produce long runs of composite integers immediately after every \(q²ʳ\), with \(q∈ Q\). Define \(KQ(r)=minq∈ Q(nextprime(q²ʳ)-q²ʳ)\), where \(nextprime(x)\) denotes the least prime strictly greater than \(x\). We prove that \(KQ(r)Qlog r\,loglog r/logloglog r\) along an unbounded set of prime indices. Consequently, for every prescribed positive integer \(B\), infinitely many primes \(r\) make all the integers \(q²ʳ+1,…,q²ʳ+B\) composite simultaneously for every \(q∈ Q\). The same prime index works for all bases in the fixed finite set. The index \(r\) is prime, while the exponent \(2r\) is even. The proof combines an elementary congruence construction with Linnik's theorem on the least prime in an arithmetic progression and Kalmynin's sieve estimate for \(\{p-1:p≤ x,\ p prime\}\). The note includes a complete derivation from these established inputs and an explicit simultaneous example. The novelty of the exact formulation has not been established, and no resolution of a named open conjecture is claimed.