What was already known
The two-summand Tu–Deng conjecture was solved using cyclic carries; no prior three-summand all-width plateau is identified in the repository’s literature review.
AI involvement
The repository credits GPT-5.6 Sol with the derivation and Claude Opus 5 with question selection and prior-art search. The human publisher reports no mathematical input.
The first-person disclosure assigns the mathematical derivation to AI and denies human mathematical input.
Importance
Gives an exact value for one infinite family of three-summand targets.
Limitations
Lean checks cover carry algebra and selected lemmas, and exact programs check specified formulas and finite cases. The bridge to Fₖ and the main plateau are not formalized; no human mathematical proof check or independent novelty review is documented.
Technical verification
Source-reported Lean 4 checks cover carry algebra and selected auxiliary lemmas; exact Python integer-polynomial certificates check specified formulas and finite cases. The source explicitly says the bridge from CarryConfig to F_k and the main two-zero plateau are not formalized. No check was reproduced here.
Human understanding
No person's account explaining the central carry derivation is documented; Few is the evidence default, not a finding of incomprehensibility.
Correction and publication history
Gives an exact value for one infinite family of three-summand targets.
Read this published revision