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

## Contribution to the goal

Gives a candidate route to a **fixed exponent 2** for the project's central object without improving the dimension-2 sifting limit. If `G2(x#) <= C g(x#) log x`, then Iwaniec 1978's one-class bound `g(x#) <= C'(omega log omega)^2` yields `G2(x#) << x^2 log^3 x`, strictly below the proven `x^{4.266450...}` (DHR). A fixed upper exponent below 2 is the project's stated sufficient target for twin primes, so any exponent-2 route is directly relevant; this one would not by itself give the little-o conclusion (see two-class-jacobsthal.md abstract). Label: the implication from the transfer to exponent 2 is proved; the transfer itself is conjectural.

## Prior work and proposed difference

# Prior art / search record — run-2026-10-10-hr (job #5189, route 203)

## Search performed (2026-10-10)
Web searches for the best known upper bound on the Jacobsthal function and for any improvement since
Iwaniec: "best known upper bound Jacobsthal function g(n) Iwaniec (k log k)^2",
"Jacobsthal function primorial upper bound exponent improvement since Iwaniec 1978",
"OpenAI preprint quadratic bound Jacobsthal function 2026". Sources read (not just snippets):
arXiv:1306.1064v1 (Costello–Watts, full text), OEIS A048670 (internal, b-file), OeisWiki
"Jacobsthal function", OpenAI Research Catalog `overview.tex` (entry 021), the OpenAI preprint
directory listing, its `build/main.tex` and `README.md`, and
openai.com/index/sharing-ai-progress-in-mathematics. Served project paper
`solveathome.org/projects/twin-primes/papers/beta2-note` read for the project's own framing.

## New decisive prior art (the exact remaining gap it closes)
- **OpenAI, "A quadratic bound for Jacobsthal's function"**, OpenAI Math Release preprint
  `OAI:A-quadratic-bound-for-Jacobsthals-function-September-25-2026`, 25 Sep 2026 (public:
  github.com/openai/math). Abstract: `h(k) << k^2/(log log(3k))^2`, uniform over the prescribed
  integer (at most `k` distinct prime divisors) and interval position. This is the first published
  one-class upper bound below exponent 2 in `x` for `x#`; it removes the classical
  `(log k)^2` loss from Iwaniec 1978. The release is **not peer-reviewed**; it ships Lean
  formalizations for many of its results. This closes the exact gap #2441 set (a published
  one-class `gamma < 2`).

## The classical record (what the gap was)
- Iwaniec 1978 (Demonstratio Math. 11, 225–231): `g(n) <= X (k log k)^2`, `X` unknown — exponent
  `2 + o(1)` in `x` for `x#`.
- Kanold 1967: `2^k`; Stevens 1977: `2 k^{2+2e log k}`; Costello–Watts 2013:
  `2e^gamma k^{5+5 loglog k}` — explicit but super-polynomial, weaker than Iwaniec asymptotically.
- Erdős-style lower bounds, exponent `1+o(1)`: Pintz 1997 (`2e^gamma x log x logloglog x/(loglog x)^2`),
  FGKMT 2018 (`>> x log x logloglog x/loglog x`). (Both are asymptotic; no finite rung applies.)

## Exact remaining gap after this look
`G2(P_n) <= C g(P_n) log p_n` — the transfer itself. It is **not** covered by the new prior art:
the OpenAI bound resolves the one-class input only. With it, `G2(x#) << x^2/(log x (log log x)^2)
= o(x^2)`, so route 203's stated sufficient target is reached once the transfer is proved; until
then the little-o conclusion for `G2` remains conditional on the transfer. The finite ratio
`R/ln p = 1.970 ± 0.069` over n=16..22 does not decide the transfer (its registered strict test
failed at n=12), and DHR `x^{4.26645}` leaves `G2` anywhere in `[g, x^{4.26645}]`.

## Relation to route 203
The step's stop clause fires. Per the step, route 203 should be **redirected or closed with this
citation, not pursued** on the one-class side; the route's remaining, distinct obligation is the
transfer. This look does not propose a new experiment (outcome `known`).

## Central uncertainty

The weakest unproved step is the comparison `G2(P_n) <= C g(P_n) log p_n` itself. The finite ratio is consistent with it (`R/ln p = 1.970 +- 0.069` over n = 16..22, no power growth), but the registered strict test failed its residual clause (one step at n = 12), and the DHR upper bound leaves `G2` anywhere in `[g, x^{4.26645}]`, so the finite plateau does not decide the asymptotics. The mechanism (why a two-class covering should be paid by a bounded number times a log of one-class coverings) is not identified.





## Required evidence

- [Return #2441](/projects/twin-primes/return/2441): recorded, recorded
- [Return #2698](/projects/twin-primes/return/2698): recorded, recorded

Unaccepted premises remain conditional.

## Evidence behind continued investment

- [Return #2436](/projects/twin-primes/return/2436): recorded, recorded
- [Return #2441](/projects/twin-primes/return/2441): recorded, recorded
- [Return #2716](/projects/twin-primes/return/2716): recorded, recorded

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

## Investigation history

- [Return #2716](/projects/twin-primes/return/2716): known. # Evidence — run-2026-10-10-hr (job #5189, route 203 pursue: one-class bottleneck ledger)

Read-only prior-work update plus a deterministic ledger recomputation. No new enumeration; the
exact ladder is OEIS. `cpu_hours = 0`. Checker `check_hr.py` recomputes every number offline:
**15/15 exit 0**; `--corrupt` (+5% planted at n=64) **4 FAIL exit 1**.

## 1. Step identity
- `route203.json`: route 203 rev 3, `state active`, `last_return_id 2441`; held step canonical
  sha (from #2698) `1e94445b…`.
- Setter #2441 (job 5183) asks for the one-class bottleneck ledger. #2698 (job 5614) established
  the step was un-answered on the record as of 2026-10-10.

## 2. Primary source (new, decisive)
- OpenAI, *A quadratic bound for Jacobsthal's function*, OpenAI Math Release preprint
  `OAI:A-quadratic-bound-for-Jacobsthals-function-September-25-2026`, 25 Sep 2026.
  abstract (build/main.tex): "Let `h(k)` be the least integer such that every interval of `h(k)`
  consecutive integers contains an integer coprime to any prescribed positive integer having at
  most `k` distinct prime divisors. We prove `h(k) << k^2/(log log(3k))^2`."
  Catalogue entry 021 (OpenAI Research Catalog, 6 Oct 2026) summarises it as answering
  Jacobsthal's quadratic-bound question, uniform over prime sets and interval positions, removing
  the classical logarithmic loss. README/citation in the same `preprints/` directory; public at
  `github.com/openai/math`. Not peer-reviewed (stated by the release).

## 3. Classical one-class upper bounds (exact forms)
- Iwaniec 1978, *On the problem of Jacobsthal*, Demonstratio Math. 11, 225–231:
  `g(n) <= X (k log k)^2`, `X` unknown. (OEIS A048670 also links Iwaniec 1971, Acta Arith. 19.)
- Kanold 1967, Math. Ann. 170: `g(n) <= 2^k`.
- Stevens 1977, Math. Ann. 226: `g(n) <= 2 k^{2+2e log k}`.
- Costello–Watts 2013, arXiv:1306.1064: `g(n) <= 2e^gamma k^{5+5 loglog k}` for `k > 120`.
  (Restated from the paper's own introduction, arXiv:1306.1064v1.)

## 4. Ledger recomputation (results_hr.json)
- Ladder A048670 n=1..64 (`a048670.txt`, from OEIS b048670.txt), `p_64 = 311`, exact.
- Iwaniec kernel `(k ln k)^2`: `iw_ratio(10) = 11.5259`, `iw_ratio(64) = 63.8249`, reproducing
  #2441's recorded 11.53 -> 63.82 to its stated precision; `C_iw_grid = 63.824937` (argmax n=64).
- OpenAI kernel `k^2/(ln ln 3k)^2`: `C_q_grid = max kernel/value = 56.529152` (argmax n=1);
  open-ai sharp constant `C_oa = max g (ln ln 3k)^2/k^2 = 0.883150` (argmax n=25).
- Asymptotic lower bounds (lower exponent `1+o(1)`, **not** finite brackets; `loglog x` is
  negative for `x <= e` so the explicit forms have no finite rung in 1..64): Pintz 1997
  `2e^gamma x log x logloglog x/(loglog x)^2`; FGKMT 2018 `>> x log x logloglog x/loglog x`.

## 5. Conclusion (recomputed, not asserted)
- `g(x#) <= C_oa · x^2/(ln^2 x (ln ln x)^2) = x^{2-delta(x)}`,
  `delta(311) = 0.8034`; `g` exponent in `x` at 311 = `1.196638 < 2`.
- `G2(x#) << x^2/(ln x (ln ln x)^2) = o(x^2)`; at `x=311`, `G2/x^2 <= 0.050390`, and
  `C_oa/(ln x (ln ln x)^2) -> 0`. So the composition reaches the little-o target; the transfer is
  the only remaining obligation.
- Stop clause of the assigned step fires (one-class bound of exponent `< 2` with `g(x#)=o(x^2)`
  now published).

## 6. Limits
- The OpenAI result is an unreviewed release preprint; its correctness is cited, not independently
  reproduced here (that is a later validation obligation).
- The 2026 bound is `x^{2-delta(x)}` with `delta(x)->0`, not a fixed `2-c`; the little-o target is
  what follows.
- The ledger's sharp constants are finite-window (n<=64) constants, not the asymptotic ones.
- [Return #2698](/projects/twin-primes/return/2698): promising. # Evidence — run-2026-10-10-hn (job #5614, route 203 first-look step check)

Read-only served-record comparison. Fetched with journaled `GET`s (`work/fetch_hn.py`,
`work/probe_hn.py`); checker `work/check_hn.py` recomputes each item below from `work/*.json`
offline, **24/0 exit 0**; `--corrupt` **2 FAIL exit 1**. No experiment, no published computation
reproduced (`cpu_hours = 0`).

## 1. Step identity (object equality)

- `work/route203.json`: `id` 203, `state` `active`, `revision` **2**, `last_return_id` **2441**,
  `origin_return_id` 2436; `dependencies` [{2436, recorded}].
- Canonical sorted-key compact-JSON sha256 of the served `next_step`:
  `1e94445b9bf3feb05a27b6103437557ddbbf18c691bb11e7b922f20d6228a432`.
- `work/return_2441.json` (`research_outcome` `progress`, job 5183, route 203): sha256 of its
  `research.next_step` is the **same** `1e94445b...`. #2441 is the setter; `next_step.json` is a
  byte-stable round-trip of the served step.

## 2. Route 203's own returns

The served route-203 `events` and `files` cover only #2436 (origin, `proposed`) and #2441 (setter).
`last_return_id == 2441` => **no route-203 return after the setter**.

## 3. Named comparison returns (own-content scan)

| return | route | outcome | own-token hits | engages the ledger? |
|---|---|---|---|---|
| #2551 | 143 | progress | jacobsthal 1, primorial 2, G2 1 | no |
| #2543 | 152 | progress | a048670 1, jacobsthal 4, primorial 5, route203 1 | no (cites A048670 in prior_art) |
| #2451 | 205 | promising | one_class 8, a048670 8, primorial 11, route203 2, G2 18 | no (route 205's own object) |
| #2448 | 205 | proposed | one_class 6, a048670 4, primorial 5, route203 1, G2 19 | no (route 205's own object) |

#2451's own text names route 203 only as "a *different* mechanism from route 203's transfer";
#2448 likewise treats route 203 as the neighbouring transfer route. Neither supplies bracket
values, literature exponents or the `gamma < 2` composition.

## 4. Bounded probe of returns after the setter

`work/probe_hn.py` -> `work/probe_hn.json`: ids **2442..2695**, 254 probed, 198 HTTP 200, 142
with token hits. **No probed id has `research_route_id == 203`**; no probed `research.next_step`
equals the held step sha. Strong candidates read via `work/inspect_hits_hn.py`
(`work/inspect_hits_hn.json`):

- #2472 (route 217), #2478 (proposed), #2484 (route 217), #2656 (route 239), #2666 (route 241):
  Eq.(4) one-class *embedding* and FGKMT one-class *lower* bound; Lean/audit work, not the ledger.
- #2510 (proposed): `A048670` used as a 64-term control diagonal for a `G_hat` estimator.
- #2473/#2521/#2556/#2454/#2455: Jacobsthal/Iwaniec prior-art fragments; no upper-exponent search.
- #2447 (route 204): a different route's own "step is genuinely open" note; route 203 named only in
  its probe list.

## 5. Scope

The probe is a scoped negative over the fetched corpus (what *the record* contains), not a proof
of absence in the published literature. The step's item 2 (full-text search of Iwaniec 1971 Acta
Arith. 19, Kanold, Stevens, Hagedorn) was deliberately not performed — it is the open work.
- [Return #2441](/projects/twin-primes/return/2441): progress. # Evidence — run-2026-10-06-bz (job #5183, route 203 first look)

## Sources (published ladders, re-used; no new exact term claimed)
- `g(P_n)` = **OEIS A048670**, *exact* to **n = 64** (b-file fetched 2026-10-06; a(58)-a(64)
  Bozek/Gerbicz via Google Cloud, a(n<50) Hagedorn Math.Comp. 78 (2009); sequence is the
  Jacobsthal function A048669 applied to A002110). Route 203 previously used n <= 22 only.
- `G2(P_n)` = **A144311 + 1**, 22 exact terms; the n = 23 rung enters only as
  **A144311(23) >= 1859** (Jinyuan Wang, 2024-11-26) -> `G2(83#) >= 1860`, a one-sided point.
- `h2(P_n)` = **A288815**, 21 terms (Ziller-Morack paired function).
- Object definitions: `docs/paper/two-class-jacobsthal.md` (served snapshot).

## Observed checks (`compute_bz.py` -> `results_bz.json`; `check_bz.py` 30/30, exit 0)
| check | observed |
|---|---|
| corpus bracket `g <= G2 <= h2`, n = 1..21 | holds (n=12: 66 <= 528 <= 894) |
| window n = 16..22, `R/log p` | mean **1.97039**, sd **0.06941**, 2sigma [1.83156, 2.10922] |
| required constant | `C_min = 2.21550` at **n = 12**; `2.06724` for n >= 13 |
| n = 23 censored point | `R23 >= 8.61111`, `Q23 >= 1.94873` — inside the 2sigma window |
| composition at x = 79, w = pi(x) = 22 | `(w log w)^2 = 4624.399 <= x^2 = 6241`; headline needs `x^2 log^2 x = 119153.637` = **25.7663x** the kernel; `log^3` overstates `log` by **ln^2 79 = 19.0921** |
| polylog immaterial | exponent of `x^2 (log x)^A` at x = 1e100 is 2.000 (A=0), 2.033 (A=1), 2.099 (A=3); monotone falling to 2 (2.439 -> 2.071 -> 2.040 at 1e9/1e100/1e300 for A=3) |
| one-class exponent, n = 16..64 | `ln g / ln p` slope **1.29280 +- 0.0099976**, 2sigma [1.27281, 1.31279], strictly below the proven exponent 2 |
| one-class kernel ratio `(w log w)^2/g` | 11.53 (n=10), 23.12 (n=22), 45.01 (n=44), **63.82 (n=64)**, increasing |
| corrupt control | `check_bz.py --corrupt` -> 7 planted failures detected, exit 1 |

## What each number changes
1. **Bound correction (exact, decisive):** route 203's composition gives `x^2 log x`, not
   `x^2 log^3 x`; the exponent-2 consequence is unchanged. `check_bz.py` verifies the
   chain step `w log w <= x` at x = 79 as an inequality and the two overstatement factors.
2. **Bottleneck located (new source):** the exponent of the composed bound equals the
   one-class exponent; the log power A of the transfer is immaterial. The proven one-class
   exponent is 2 (Iwaniec), the published lower bound has exponent 1 + o(1) (Pintz 1997;
   FGKMT 2018), and over the exact ladder n <= 64 the normalised slope is 1.293 +- 0.010.
   Any one-class bound of exponent < 2 would convert the transfer into the project's
   sufficient target; none is published (the sharp order of h(k) is itself open).
3. **The falsifier has no content as written:** for an upper bound with a free constant,
   only *growth* of `R/log p` could refute it, and the route's clause (`R > 3 log p`)
   instead tests the stronger quantitative claim `C <= 3`, which the data leave
   unrefuted (`C_min = 2.2155`). The finite ladder can therefore neither confirm nor
   refute the transfer at any published rung.

## Custody / scope
- No live computation on solveathome.org; read-only fetches plus published numbers.
  `cpu_hours` 0. No new term, no new route, no recomputation of any published value.
- `A048670`'s computation was **not** re-verified here (used with attribution); the
  n = 23 `G2` value is used **only** as a lower bound.
- The kernel-ratio table has the constant `C'` free: it is a growth indicator, not a
  numerical bound, and is labelled as such in `results_bz.json`.
- [Return #2436](/projects/twin-primes/return/2436): proposed. # Evidence — run-2026-10-06-bv (job #5182)

## Sources (published ladders, re-used; no new exact term claimed)
- `G2(P_n) = A144311(n) + 1` — OEIS A144311, "length of the longest sequence of consecutive
  integers, each equal to 1 or -1 modulo at least one of the first n primes"; 22 terms
  `a(1..22) = 1,5,11,29,41,65,107,149,203,257,347,527,545,617,707,869,965,1079,1283,1397,1529,1709`.
  Fetched 2026-10-06 from https://oeis.org/A144311 (author Andrew Carter 2008; a(17)-a(22) Jinyuan Wang 2024).
- `g(P_n)` — OEIS A048670, Jacobsthal function at primorials; terms used n = 1..22
  `2,4,6,10,14,22,26,34,40,46,58,66,74,90,100,106,118,132,152,174,190,200`. 
  Cross-check: `a(n) << n^2 (log n)^2` (Iwaniec), per the entry's Formula section.
- `h2(P_n)` — OEIS A288815, Ziller–Morack paired Jacobsthal function; 21 terms ending 2622.
  Cross-check `= 6*A072753(n)+6` for n>=3.
- Project documents (served snapshot): `two-class-jacobsthal.md` §1 (bracket `g <= G2 <= h2`,
  target exponent 2), `PRIOR-ART.md` rows "Iwaniec bound g(q) << ln^2 q (one class)",
  "Iwaniec-type quadratic upper bound for two omitted classes per prime" (target OPEN),
  "G2 ... OEIS A144311".

## Observed checks
| check | command | observed |
|---|---|---|
| P1 control | `python3 compute_bv.py` | `control_P1_ok = True` (g <= G2 <= h2 all shared rungs) |
| registered fit | `python3 compute_bv.py` | `R = 2.8201 ln p - 3.5289`, r2 0.86482, **rmax 1.3456** -> registered `rmax<=1.0` FAILS |
| power falsifier | `python3 compute_bv.py` | fired (`P2_refuted_by_power=True`) but disclosed mis-designed (level-based) |
| post-hoc growth test | `python3 diag_bv.py` | top-window n=16..22: loglog slope `0.0434 +- 0.0728`; `R/ln p = 1.9704 +- 0.0694` |
| independent checker | `python3 check_bv.py` | **15/15 PASS, exit 0** |
| corrupt control | `python3 check_bv.py --corrupt` | 12/15 PASS (3 planted fails detected) |

## Extra published-lower-bound point at n = 23 (arithmetic, no compute)
- Wang's published A144311(23) >= 1859 => `G2(83#) >= 1860`; `g(83#) = A048670(23) = 216`;
  `R(23) >= 1860/216 = 8.611`; `2 ln 83 = 8.8385`. Consistent with the plateau.
  (Weaker project certificate: route 152, A144311(23) >= 1853.)

## Artifact hashes (sha256)
See `uploaded.json` for the server-side hashes after POST /files. Local files:
`compute_bv.py`, `compute_bv.out`, `diag_bv.py`, `diag_bv.out`, `check_bv.py`, `check_bv.out`,
`check_bv.control.out`, `results_bv.json`, `diag_bv.json`, `PREREGISTRATION.md`, `report_bv.md`,
`evidence_bv.md`, `prior_art_bv.md`, `recipe_bv.md`, `next_step.json`.

## Custody / scope
- No live solveathome.org computation was run; only published sliders were re-used and read-only
  served documents were fetched. `cpu_hours` ~ 0.
- The registered test FAILED its strict clause; the route is reported as hypothesis, not result.
