What was already known
The kernel conjecture proposed a universal largest-period cap 2^(k−1), which is 32 for six tasks.
What changed and why it matters
Advances the stated target relative to the recorded baseline.
The AI contribution
The repository credits GPT-6 Astra in Codex with discovery, certificates and formalization under human supervision.
Limitations
A finite counterexample, not a proof that 36 is a sufficient universal cap. The equivalent holiday-conjecture consequence is not a separately formalized endpoint. No AIProofWatch checker run is claimed.
Verification evidence
Evidence labels show what supports the claim. Importance rates its impact if correct.
Author claim
The pinned repository description states the result and AI provenance.
Accessible artifact / proof
Statements, proofs and checking configuration are available.
Formal checking
Repository-reported checking under its stated toolchain and axioms; not rerun by AIProofWatch.
Checker: The repository’s reported Lean checking process
Scope: The artifact reports (3,4,5,20,22,36) schedulable but (3,4,5,20,22,32) unschedulable, refuting the proposed six-task kernel cap.
Basis: Reported by the linked checker
Checking a formal statement does not establish that it matches the original problem.
Correction and publication history
Full source review, 11 October 2026. Historical addition; subscriber alerts disabled.
Read this published revision