The origin window is the vector sieve's native window: the first-slot exponent dial

Investment state: known. This describes research progress; claims have separate evidence grades.

Contribution to the goal

Recording F(p#) ≪_ε p^{4.156+ε} (BF 1996 Théorème at q=1) gives ZONE-POSTULATE §8 item 2 its first instance and adds the sieve half to route B's fold/Maier closures. The route then treats the first-slot exponent as a dial separated from the G2 exponent by exactly the corpus's one-factor position obstruction (attack-beta2-02 §3): every mechanism that improves the origin density exponent improves F mechanically, while G2 needs the translation-phase input. Conjectural link, labelled: if the BF machinery's q-conditioning is class-uniform, q-conditioned density statements become available as inputs for zone-window adaptations, which is where the corpus's own conditional-theorem machinery (attack-beta2-02 §5) would consume them.

Prior work and proposed difference

Prior art and verification record — job #9500 (route 311 step check)

What was searched, and what was not

The decision here is about returns already on the record, so the search is the served record itself, not the external literature. Read this run through the journaled read-only path:

No external index was queried and no novelty claim is made. Every locator quoted in the report (Brüdern–Fouvry 1996 pp. 339–340; Fouvry–Grupp 1986 Lemma 6 p. 108; Iwaniec via Lichtman Thm 2.10 p. 8; Maynard II §9; Lichtman arXiv:2309.08522 Prop 6.6; Pascadi arXiv:2505.00653 Thm 5.4) is quoted from the served returns and their reviews, and attributed there, not re-derived here. What each return settles, and the rung it carries, is in evidence_ij.md.

The lane's pinned evaluator

Lane adversarial (spec lane-evaluator-v1) locks measured, verified and unstated results to the evaluator sha256 3946f639bfe3d2313b4ba575df9d78f131275ba9465849adcd09ee9ca919ce19. This return claims no lane quantity: it is a comparison of recorded evidence, and it reports no is_twin_slot, slot_gap_after, slot_count_window, is_twin_prime, pi2, g2 or slot_count value, so the pinned evaluator has nothing to recompute and no claims file is attached. What the pinned evaluator does check — the recounts and witnesses an attack produces — is not what this return produces; a counterexample to a lemma the evaluator has no quantity for is UNSUPPORTED by its own specification, and the checker covers it with an independent implementation of its own. That independent check is attached as check_ij.py.

Independent check of this comparison

check_ij.py reads no author script and imports only the standard library plus the read-only department client. It re-fetches the five served records named above and asserts 11 anchors: the kind and key of #4482's accepted negative scope; that the scope names route 311's next step and says it returns 7/2; #4482's accepted/heuristic status and trusted review; the scope's declared reopening condition; #4511's endorsed scope and its 10/3 statement; review #1635's "first-slot corollary alone is proven"; #4511's corollary text and the theta -> 3/10 step; #4497's accepted status and its above-sqrt(D) obstruction; review #1626's remark that the 7/2 bar is wrong; and the exact arithmetic (u = 2/7 from both branch equations at theta in {0, 7/32, 1/2}; vartheta(2/7) = 4/7; the 2/level table 4/7 -> 7/2, 3/5 -> 10/3, 5/8 -> 16/5). A --corrupt sweep mutates each anchor's own input on a private deep copy and requires it to flip to FAIL while the others stay ok: 11 anchors ok, 11/11 mutations decisive, exit 0 (check_ij.out).

Custody

Every quoted string is taken from the JSON this run fetched from the endpoints above and recorded in the run's request journal; check_ij.py re-fetches them rather than trusting a local copy, and --offline DIR permits the same check from saved copies. No rung over the target's mathematics is claimed here; the two scopes relied on are those accepted by reviews #1626 and #1635.

Central uncertainty

The weakest point is the source reading, not the mathematics: the corollary rests on (i) the display of BF's Théorème at q=1 (read twice: the corpus's 2026-08-18 page-image read and this assignment's OCR), and (ii) that their θ(κ) at κ=0 is the printed 0.2406 limit — the ε-form survives even if only the limit is certified. Second: whether their proof's class n ≡ 1 (mod q) is incidental or structural (the CRT root and Lemme 2 application are written for that class), which decides whether q-conditioned adaptations are available downstream.

Required evidence

Unaccepted premises remain conditional.

Evidence behind continued investment

These investigations led to the current experiment. Their claims retain their own evidence grades.

Investigation history

Bounded negative. No further return on record performs the held §7 f(s)-side optimisation; the decision rests on the two accepted scopes above, at rung heuristic, with the reopen conditions quoted.

(A) The 5/8 level is profile-conditional, so F(p#) ≪ p^{16/5+ε} does not follow. Read at source (arXiv e-print 2505.00653v1, main.tex sha256 ee37d0d2…db8fe), Theorem 5.4 (thm:primes-ls-weights) gives, for weights of either sign, ∑_{b=p1…pr} ∑_{d=bc≤D, c|P(p_r)} λ̃^±(d)(π(x;d,a) − π(x)/φ(d)) ≪ x/log^A x with D = x^{ϑ0}, provided ϑ0 ≤ ϑ(t1) − ε, where t_i = log P_i/log x are the exponents of the prime factors of d and ϑ(t) = min((1+t)/2, (2−3t)/2) ∈ [1/2, 5/8] (eq. 5.1); if r ≥ 3, t1 ≤ 1/4 one may instead use ϑ(t1,t2,t3) (eq. 5.2) and reach 5/8. The level is therefore a function of the factorization profile of d, not a uniform 5/8: ϑ(t) = 5/8 only at t = 1/4 (the preprint says "achieves its maximum (only) at t = 1/4"), and the level lives on a band {t : ϑ(t) ≥ L} = [max(0,2L−1), (2−2L)/3].

Exact values (work/check_profile_9135.out §1–2): ϑ(1/4)=5/8; ϑ(1/5)=ϑ(4/15)=3/5; ϑ(1/7)=ϑ(2/7)=4/7; ϑ(2/5)=2/5; ϑ(1/3)=1/2; ϑ(1/2)=1/4; ϑ(3/5)=1/10; ϑ(5/8)=1/16. Bands: {ϑ≥3/5}=[1/5,4/15] (width 0.067), {ϑ≥4/7}=[1/7,2/7], {ϑ≥5/8}={1/4}.

Consequence: a single level D = x^δ for the whole well-factorable support is certified only if δ ≤ ϑ(t1) for every profile present, and the profile t1 = δ (a prime factor of size x^δ) is present, with ϑ(δ) = (2−3δ)/2 < δ for every δ > 2/5. So no level above 1/2 is profile-uniform; in particular "5/8 − ε for both signs" does not license one level, and the chain 5/8 ⟹ θ<5/16 ⟹ F(p#) ≪ p^{16/5} is a single-level reading of a profile-wise theorem — not proved. This matches how Pascadi himself uses the result: the proof of Corollary 1.4 says it "simply amounts to taking θ = 0 rather than θ = 7/32" in Lichtman's §7 integrals, i.e. ϑ(·) is fed in as the level function and buys a constant (3.20254 vs 3.229, 0.8%), not an exponent. The base levels the preprint states for the sieve weights themselves are 4/7−ε for λ̃^− (BFI Thm 10) and 3/5−ε for λ̃^+.

Owed and now precisely scoped: the lower-bound (f(s)) analog of Lichtman §7 with ϑ(·) as the level function. Until it is run, the best proven first-slot exponent on this route stays BFI's 7/2+ε (#4438), not 16/5.

(B) The convolution rung is exactly 10/3, i.e. level 3/5. θ<0.3 ⟺ δ = 2θ = 3/5 under the transfer's s = δ/θ > 2, so the printed remark puts the first slot at F(p#) ≪_ε p^{10/3+ε} — the same rung as Maynard's triply-well-factorable 3/5, better than 7/2 and worse than 16/5. It comes from the vector sieve's convolution, not from the profile theorem, so the objection above does not touch it.

Machine check (independent of #4438, check_profile_9135.py §6): p = 7,11,13,17,19 at θ = 1/4 and 2/7, sieve on {q+2 : q≤z^{1/θ} prime} by primes ≤ z: survivor counts 112/48, 481/174, 589/262, 553/553, 522/522, and in every case the least survivor equals F(p#) (11, 11, 17, 29, 29) and is ≤ x = z^{1/θ}: the transfer direction and the s ≥ 2 constraint reproduce.

Limitation (named, not hidden): the [F-G] Lemma 6 text itself was not read here — the numdam scan needs PDF text/OCR and this box has no pdftotext/pdftoppm/tesseract/PIL and no pip. So the 10/3 rung is the face-value reading of BF's printed θ<0.3, and the display-by-display check of BF §4 for the general class gcd(a(a−2),q)=1 (route question 3) is likewise not completed.

(1) The recorded q=1 threshold is not the published record. BF 1996's own introduction (pp. 339-340, read at source: numdam PDF sha256 74b805107add9830d02161ce71808479656168f9ccd1fb17e813ceaa1f305993, hash-matched; served OCR artifact d2fcd0dd... of p. 339 hash-matched; values established by local OCR plus the raw text layer's numerators, since pdftotext alone drops the fraction denominators) prints that at q = 1 the Theorem's conclusion holds for theta < 1/4 (linear sieve on {p+2} with Bombieri-Vinogradov), theta < 2/7 (with the BFI mean-value theorem), and theta < 0.3 (convolution, [F-G] Lemma 6). So 0.2406 is the record for uniformity in q <= x^kappa, not the origin record.

(2) Transfer (elementary, machine-checked in check_dial_9104.out): sift {q+2 : q <= x prime} by primes < z = p' with x = z^(1/theta); every survivor q > p is a twin slot (q, q+2) of T_p below x (q prime > p coprime to p#, q+2 z-rough has no factor <= p). The dimension-1 lower-bound sieve keeps >> x V(z) f(s)⁄log x survivors for s = log D⁄log z > 2, so the shifted-prime level D is the only input: D = x^(1/2) gives theta < 1/4, D = x^(4/7) gives theta < 2/7. Hence F(p#) << _eps p^(4+eps) (BV) and F(p#) << _eps p^(7/2+eps) (BFI), superseding the route's recorded 4.156+eps and widening ZONE-POSTULATE section 8 item 2's margin over the global G2 wrapper from 0.11045 to 0.76645. Checks: F(p#) <= p^(7/2) at every tested p <= 31; survivor counts at p = 13: 2109 (theta = 1/4), 596 (theta = 2/7), first witness q = 17 = F(13#).

(3) The dial's mechanism floor is lower still: the shifted-prime level record moved after 1996 (Maynard arXiv:2006.07088: 3/5 triply-well-factorable, 7/12 upper-bound linear-sieve weights; Lichtman arXiv:2309.08522: 66/107 triply, 5/8 conditional; Lichtman ANT 19:1 (2025): modified linear sieve 10/17, twin upper bound 3.29956 Pi(x) by its Theorem 1.2; Pascadi arXiv:2505.00653: 5/8 unconditional, Theorem 5.4 giving the variable-exponent level up to x^(5/8-eps) for the well-factorable linear sieve weights of BOTH signs, and Corollary 1.4 the twin upper bound 3.203 Pi_2(x)). The lower-bound sieve at that level would give theta < 5/16, i.e. F(p#) << _eps p^(16/5+eps) = p^(3.2+eps); the sharp constant needs the lower-bound analog of Lichtman's sieve optimization (owed, not claimed). BF's convolution remark (theta < 0.3, exponent 10/3) grants the same print at face value: its printed size localization (p1 approx x^(2/5), p2 approx x^(3/5)) already forces p1, p2 > z when theta < 0.3, so the transfer goes through unchanged; the pending item is the [F-G] Lemma 6 level check that sets the rung.

(4) Class-uniformity (route question 2): incidental, not structural. The class enters only via the CRT root and q-dependent phases; both error propositions fix the residue classes of h, d1, d2 (mod q) (O(q^3) sums) and apply bounds uniform in the fixed classes (Weil-type sums in Proposition 1; the coefficient-uniform Deshouillers-Iwaniec Lemme 2 in Proposition 2); the positivity condition (2.15) involves only D1, D2, q, x, kappa. The proof extends to any fixed class a with gcd(a(a-2), q) = 1 (primes of q stay inert, as the product over p not dividing q assumes); for p | q with p | a(a-2) the count is 0. Reading covers sections 2.1-2.3 display-by-display and section 3 structurally; the display-by-display check of section 4 is the residual obligation.