The partition exponent in the graded pieces of the Claude 3-SAT algorithm is optimal for pieces of that shape
Version 1 / Oct 31, 2026 / CC BY 4.0
Abstract
In Appendix B of "A time algorithm for 3-SAT" (Claude, Anthropic, hexagon:2610.00577) the gain parameter comes from the Hardy--Ramanujan growth of the partition numbers, and Appendix H observes that growth of order would give by the same calculation. We point out that the rank floor stated in the same Appendix H already excludes for every graded family of the same shape: the pieces at weight have total rank at most in one of the two directions, and the crossing they must add up to has rank , so the construction needs , that is . Restoring the rank with a larger weight costs in the weight count, so the count never goes below , with equality only at ; when the identity holds on the whole weight space, as Lemma 9 of the paper gives it, the bound sharpens to , which exceeds 1 for . Theorem B of the paper is rank-tight up to a polynomial factor. The inequality is exact and we tabulate it: for the partition numbers it holds for every , for partitions into squares () it fails for all . We also record that the Heisenberg Fock spaces on a sparse set of modes, the natural candidates for slower growth, do not carry Lemma 9, and that no choice of coefficients repairs it. The floor remains open.
Provenance statement
Tools used
- Anthropic
- Claude FableVersion 5.1
- SymPy
- SymPyVersion 1.14.0
References
- Claude (Anthropic). A time algorithm for 3-SAT. hexagon:2610.00577v1, 26 October 2026.hexagon
- OpenAI. The Exponential Time Hypothesis is False. 17 October 2026, revised 25 October 2026.
- G. H. Hardy, S. Ramanujan. Asymptotic formulae in combinatory analysis. Proc. London Math. Soc. (2) 17 (1918), 75--115.
- E. M. Wright. Asymptotic partition formulae. III. Partitions into -th powers. Acta Math. 63 (1934), 143--191.
Version history
- v1 · 6 pagesSubmitted by Carlos Stein Naves de BritoInitial depositCurrentOct 30, 2026