The A166944 target follows from two caps, each weaker than the travel bound
ProvedA166944Research.a166944_target_of_two_capsLet be the Rowland-type recursion of OEIS A166944 and its first differences. Let be a difference record whose value is known to be the greater member of a twin-prime pair, so that ; the canonical replay starts at the state and jumps to the next index at which the recursion's gcd is nontrivial. Write for the state where it terminates.
Assume the replay satisfies two caps, for every record already known to be a greater twin prime:
Then the A166944 conjecture holds: every difference record above is the greater member of a twin-prime pair.
Why two caps rather than one
The development previously carried a single hypothesis, the travel bound
and a dozen independent routes were recorded as all converging on it. That target was too strong. The only place the travel bound is consumed is a step that determines the next record from the replay, and measuring what its arithmetic actually needs shows it tolerates up to : the relaxation is , about million at .
So the pair of caps is strictly easier than the travel bound while sufficing for the same conclusion. That it is genuinely weaker, not a restatement, is witnessed: at the pair satisfies both caps and violates the travel bound.
There is also a structural gain. The replay's case analysis has two branches, and the branch where the replay crosses the record is discharged by an existing theorem about horizon growth using only the first cap. Only the quiet branch consumes the second.
Where it stands
Neither cap is proved for all ; both are uniform statements about the terminal state of a canonical replay, and the development's kernel-verified certificates reach record and no further. What this theorem establishes is that those two statements, rather than the stronger travel bound, are what stand between the finite certificates and the conjecture.
Formalization Note The lower bound is where the explicit replay certificates stop; below it both caps are discharged by replay. IsGreaterTwinPrime M is carried because the argument is an induction that only needs the caps after a record already known to be a twin prime, which is how circularity is avoided. The two hypotheses are stated separately rather than as a conjunction so that each can be attacked on its own.
import Definitions.Def_a166944_moving_horizon open A166944Research
namespace A166944Research
theorem a166944_target_of_two_caps
(hA : ∀ {M sf Cf p : Nat}, 45895573 ≤ M → IsGreaterTwinPrime M → d (M + 2) = M →
HasMovingHorizonPathTo (M + 2) (2 * M - 2) sf Cf p →
IsAttainedPreviousMaximum M sf → Cf ≤ 3 * M + 4)
(hB : ∀ {M sf Cf p : Nat}, 45895573 ≤ M → IsGreaterTwinPrime M → d (M + 2) = M →
HasMovingHorizonPathTo (M + 2) (2 * M - 2) sf Cf p →
IsAttainedPreviousMaximum M sf → 4 * sf ≤ 7 * M - 1) :
∀ R : Nat, 5 < R → IsDifferenceRecord R → IsGreaterTwinPrime R := by
sorry
end A166944Research