betaFeedback

WorksComputer Science

Thermodynamic saturation and prescribed window barriers for Kleinian-code graded spaces

Abstract

We investigate prescribed graded-window dimensions for Kleinian-code characters, motivated by the four-leg construction of a subexponential 3-SAT algorithm, but without claiming new admissible algebraic operators. For every compact J⋐(0,∞)J\Subset(0,\infty), we prove, uniformly for isotropic additive codes S⊂KmS\subset K^m, ρwin(VS;h,λ)≥12+ηJ−CJm−1/2, \rho_{\mathrm{win}}(V_S;h,\lambda)\geq \frac{1}{\sqrt{2}}+\eta_J-C_Jm^{-1/2}, whenever h/m∈Jh/m\in J and 2λ≤dim⁡(VS)h2^\lambda\leq\dim(V_S)_h, where ηJ>0\eta_J>0 is specified by the proof but has not yet been evaluated as a certified numerical constant for any given compact interval. The fixed-density proof combines the central-window inequality, sectorwise thermodynamic estimates based on the isotropic local weight bound, finite-length concentration, and certified interval arithmetic (Arb, cross-checked with mpmath.iv) for specified sign inequalities. These numerical certificates do not formalize the complete proof. No concavity or convergence assumption on the code-weight spectrum is needed. For additive codes of 2-rank at most mm, we also prove that the maximally encoded prescribed-window cost converges uniformly to 1/21/\sqrt{2} as h/m→∞h/m\to\infty, with two-sided explicit errors of order O(m/h+(mh)−1/4)O(\sqrt{m/h}+(mh)^{-1/4}) for admissible h≥15mh\geq 15m and mh≥4000mh\geq 4000. These are statements about window dimensions, not intrinsic matrix ranks or implementations within a SAT algorithm.

Introduction

Background

For classical background on exponential-time hypotheses and sparsification, see Impagliazzo–Paturi and Impagliazzo–Paturi–Zane [1, 2]. A related preprint by OpenAI [3] investigates the Exponential Time Hypothesis; no claim from that work is used in the proofs below. The present analysis is restricted to the indicated prescribed graded-window geometry.

Let λ≥1\lambda\ge1. The crossing tensor is

Xλ(x,y;u,v)=[x=v][y=u],x,y,u,v∈{0,1}.(1)X_{\lambda}(x,y;u,v) = [x = v][y = u], \qquad x,y,u,v \in\{0,1\}. \tag*{(1)}

The source algorithm [4] represents a nonzero multiple of XλX_{\lambda} by efficiently computable pieces with bounded row- and column-factorization bit costs. Its principal construction gives ρ=11/12\rho= 11/12; Appendix B gives the window-based value ρ=1/2\rho= 1/\sqrt{2} on a polynomial ring whose weight-EE dimension is the partition number p(E)p(E), classically governed at large weight by the Hardy–Ramanujan asymptotic [8]. The complexity exponent is α=log⁡2(1/ρ)\alpha= \log_{2}(1/\rho) in the source model.

Main result and interpretation

The original partition-number example in [4] has a window cost approaching 1/21/\sqrt{2}. The question considered here is whether natural graded code families can improve the prescribed window dimensions in the analogous geometry. Theorem 6.5 answers this in the negative at any fixed compact range of densities: not only is the 1/21/\sqrt{2} threshold inaccessible asymptotically, but the cost is separated from it by a positive interval-dependent gap. Theorem 6.4 is the local analytic mechanism, while Lemma 4.7 transfers that sign to dimension growth. Theorem 7.1 complements the result by giving a code-uniform high-density limit, not a new strict fixed-density gap.

The analytic heart of the fixed-density proof is an entropy-growth inequality for cumulative dimensions, stated explicitly after Theorem 6.5. The positive margin is not yet assigned a certified numerical value. An illustrative, non-certified numerical evaluation of the proof’s choices suggests η[1,2]≈0.005\eta_{[1,2]} \approx0.005, which is considerably smaller than the observed limiting margins in simple example codes; this estimate is not used in any theorem.

The argument uses the single central window t=0t = 0: ρwin≥D(2h)/(2λ)\rho_{\mathrm{win}} \ge D(2h)/(2\lambda). This is a statement about the prescribed intermediate graded spaces. It neither bounds the intrinsic row/column ranks of a different factorization nor constructs the operators or identities required by the source algorithm. The gap depends on J\mathcal{J} and does not survive uniformly as h/m→∞h/m \to\infty: Theorem 7.1 proves quantitative high-density saturation for maximal admissible encodings.

Related work and scope

The source preprint by Claude/Anthropic [4] reports an exact algebraic decomposition of the crossing tensor. Its main-text piece construction has ρ=11/12\rho= 11/12, while Appendix B provides ρ=1/2\rho= 1/\sqrt{2} through partition growth; Appendix H discusses why square-root growth arises in that construction. Neither the value 1/21/\sqrt{2} nor its partition-growth mechanism is claimed as new here.

Brito [5] proves obstructions for power-growth graded pieces of Appendix-B shape, including the competing rank floor that rules out simply taking a smaller power exponent. Majdoddin [6], Section 4.7, Proposition 4.24 gives a 2/3−o(1)2/3 - o(1) lower bound for concave profiles under the corresponding four-node hypotheses, including W,H≥2hW, H \ge2h, and discusses nonconcave (“kinked”) profiles as an open escape. These are not assertions about all possible algebraic factorizations. Our strict fixed-density lower bound is numerically stronger at leading order within the particular Kleinian-code family, without assuming concavity of its code-weight spectrum; it is not a universal strengthening of either paper’s theorem.

Tulsyan [7], Section 4.2, Theorem 4.3 and Proposition 4.4] already studies the same central-spread mechanism in graded two-order pieces. In his convention f(E)=log⁡2dim⁡VEf(E) = \log_{2} \dim V_E, Proposition 4.4 states a lower bound of the form ρ≥f(2h)/(2f(h))−clog⁡(2λ)/(4λ)\rho\ge f(2h)/(2f(h)) - c\log(2\lambda)/(4\lambda) for prescribed graded costs with spread H=2hH = 2h, and obtains 1/2−o(1)1/\sqrt{2} - o(1) for Fock-space examples and a stated class of vertex-operator algebras. The dimension inequalities behind his Theorem 4.3 are machine-checked; Proposition 4.4 is a paper-only statement. Accordingly, neither the central-window idea nor the leading 1/21/\sqrt{2} barrier is claimed as novel here. What is specific to the present manuscript is the strict fixed-compact code-uniform gap for isotropic Kleinian Hilbert characters, without a concavity or limiting weight-spectrum hypothesis, together with quantitative two-sided high-density errors for maximal encodings. Our DS(E)=log⁡2dim⁡(VS,≤E)D_S(E)=\log_2\dim(V_{S,\leq E}) is a cumulative profile, whereas Tulsyan’s displayed f(E)f(E) counts exact levels; the two statements should not be silently identified. These prescribed window bounds are not intrinsic lower bounds for the ranks of the actual crossing-piece matrices.

WorkSetting and hypothesesRelevant conclusion
Brito [5]Graded pieces of the Appendix-B shape; power-growth profiles and encoding/rank restrictions.A 1/21/\sqrt{2} obstruction for the specified power-profile route.
Majdoddin [6]Four-leg dimension profiles satisfying the stated concavity and window-size hypotheses.A 2/3−o(1)2/3-o(1) bound in that regime.
Tulsyan [7]Graded two-order pieces with stated spread and pairing conditions.Central-spread and 1/21/\sqrt{2}-scale obstructions for specified graded models.
This workIsotropic Kleinian-code characters at fixed h/m∈J⋐(0,∞)h/m\in\mathcal{J}\Subset(0,\infty); no limiting or concavity hypothesis on code-weight spectra.Strict prescribed-window bound 1/2+ηJ−OJ(m−1/2)1/\sqrt{2}+\eta_{\mathcal{J}}-O_{\mathcal{J}}(m^{-1/2}).
This workAdditive Kleinian codes of 2-rank at most mm and maximally encoded levels with h/m→∞h/m\to\infty.Uniform prescribed-window saturation at 1/21/\sqrt{2} with explicit two-sided errors.

Table 1. Comparison of the stated settings and conclusions. This table does not establish independent priority or logical non-implication.

The leading high-energy term used in the present note is consistent with the classical Hardy–Ramanujan partition asymptotics [8] and the Cardy square-root entropy law [13]. The coefficient-monotonicity/tauberian viewpoint has precedents in Ingham [9], while modular-invariance bounds for microcanonical entropy have been developed by Mukhametzhanov–Zhiboedov [10]. The universal large-central-charge Cardy regime studied by Hartman–Keller–Stoica [17] uses a sparse-light-spectrum hypothesis; we do not apply that theorem to VSV_S. Instead, our family-specific estimates are derived directly from its explicit characters. The background relation between codes, lattices and conformal field theory is discussed by Höhn [18] and, for distinct Lorentzian/Narain code constructions, by Dymarsky–Shapere [15]; these should not be treated as an identification of the two constructions.

Precise scope of the contribution. The claim of this note is a proved quantitative formulation for the specified Kleinian-code characters: a strict lower gap on each fixed positive compact density interval, uniform in mm and the isotropic code SS with an OJ(m−1/2)O_{\mathcal{J}}(m^{-1/2}) correction and without any concavity or limiting weight-spectrum assumption; and a complementary uniform high-density limit for maximal admissible encodings, with explicit two-sided errors. In the specific statements of the papers compared above, we have not identified that exact pair of code-uniform estimates. This limited comparison is neither an exhaustive priority search nor a claim that the estimates cannot be derived from broader existing principles. In particular, the high-density leading constant is classical, the quantitative bounds are conservative, the window cost is not an intrinsic matrix rank, and no new admissible piece system or SAT algorithm is constructed.

Window factorizations

A graded space V=⨁E∈ΓVEV=\bigoplus_{E\in\Gamma}V_E has discrete Γ⊂[0,∞)\Gamma\subset[0,\infty) and finite-dimensional components. Put

V≤E=⨁e≤EVe,D(E)=log⁡2dim⁡V≤E,V[a,b]=⨁e∈[a,b]Ve,W[a,b]=log⁡2max⁡{1,dim⁡V[a,b]}.V_{\leq E}=\bigoplus_{e\leq E}V_e,\qquad D(E)=\log_2\dim V_{\leq E},\qquad V_{[a,b]}=\bigoplus_{e\in[a,b]}V_e,\qquad W[a,b]=\log_2\max\{1,\dim V_{[a,b]}\}.

Notation. We use tt for a freely varying window shift, reserving ss for codewords in SS when code sectors are discussed. The source notation AsA_s for the indexed crossing-tensor pieces is retained verbatim to permit comparison with Anthropic’s Appendix B; its index ss is not a codeword. In Section 6, ww denotes a sector weight; in Section 7 and Appendix C, rS=log⁡2∣S∣r_S = \log_2 |S| denotes the code 2-rank. The analytic remainder r(β)r(\beta) in Appendix C is a separate function.

Definition 2.1 (Window cost). For h>0h > 0, λ≥1\lambda\ge1 and ∣t∣≤2h|t| \le2h set

Ch(t)=W[t,t+2h]+W[−t,2h−t],ρwin(V;h,λ)=14λsup⁡∣t∣≤2hCh(t).C_h(t) = W[t,t+2h] + W[-t,2h-t], \qquad\rho_{\mathrm{win}}(V;h,\lambda) = \frac{1}{4\lambda}\sup_{|t|\le2h} C_h(t).

Exact dictionary with Anthropic. In [4 Appendix B, equations (54)–(56)], V=Q[t1,t2,…]V = \mathbb{Q}[t_1,t_2,\ldots] has integer weights, dim⁡VE=p(E)\dim V_E = p(E), and the 2λ2^\lambda inputs are encoded by distinct monomials in weight hh (chosen as the least integer with p(h)≥2λp(h) \ge2^\lambda). The pieces are indexed by I={−2h,−2h+1,…,2h}I = \{-2h,-2h+1,\ldots,2h\}, including s=0s=0. In Definition 2.1 we denote the shift by tt and allow real tt, while the source indexes pieces by integer ss; we use logarithms of window dimensions, whereas the source takes the ceilings of the binary logarithms. We also allow any λ\lambda satisfying the encoding condition, whereas the source chooses the least integer hh for which p(h)≥2λp(h) \ge2^\lambda. These differences must be maintained when comparing costs; all arguments below use the full real window range and the stated grading. The row and column factorization dimensions of piece ss are, respectively,

Rsrow=∑i=02hp(s+i),Rscol=∑i=02hp(2h−s−i),R_s^{\mathrm{row}} = \sum_{i=0}^{2h} p(s+i), \qquad R_s^{\mathrm{col}} = \sum_{i=0}^{2h} p(2h-s-i),

where p(j)=0p(j)=0 for j<0j<0, and their bit costs are the ceilings of the binary logarithms. In [4 Definition 7], the parameters satisfy 1/2≤ρ<11/2 \le\rho< 1 and c≥1c \ge1 is an integer. The two-direction bit-budget condition is specifically Definition 7(b):

csrow+cscol≤4ρλ+clog⁡(2λ).(2)c_s^{\mathrm{row}} + c_s^{\mathrm{col}} \le4\rho\lambda+ c\log(2\lambda). \tag*{(2)}

Separately, Definition 7(c) requires

∣I∣≤(2λ)c,|I| \le(2\lambda)^c,

and imposes magnitude bounds on the indices, coefficients and factorization data, together with effective-computability requirements. Definition 7(a) is the crossing-identity requirement. Thus (2.1) is only the bit-budget portion of the source definition, not a claim that a new graded space provides all admissible pieces. The 4ρλ+84\rho\lambda+8 estimate in the source Lemma 2(c) concerns its main-text ρ=11/12\rho=11/12 pieces and should not replace Definition 7(b) in the Appendix-B comparison. The bound on ρwin\rho_{\mathrm{win}} transfers to the specified window-cost form of (2.1), with the logarithmic tolerance, in Corollary 6.13. Our construction of graded spaces alone supplies no operators satisfying the source identities.

A family of matrices {As}s∈I\{A_s\}_{s\in I} summing to dXλdX_\lambda (d≠0d\ne0) is a window factorization over VV when each row flattening factors through V[s,s+2h]V_{[s,s+2h]} and each column flattening through V[−s,2h−s]V_{[-s,2h-s]}.

Lemma 2.2 (Ranks versus windows). For such a factorization,

ρrank:=14λmax⁡s(log⁡2max⁡{1,rank⁡rowAs}+log⁡2max⁡{1,rank⁡colAs})≤ρwin.\rho_{\mathrm{rank}} := \frac{1}{4\lambda}\max_s\left(\log_2\max\{1,\operatorname{rank}_{\mathrm{row}} A_s\}+\log_2\max\{1,\operatorname{rank}_{\mathrm{col}} A_s\}\right)\le\rho_{\mathrm{win}}.

The reverse inequality need not hold. The convention log⁡2max⁡{1,rank⁡}\log_2\max\{1,\operatorname{rank}\} allows zero matrices.

Proof. The rank of a factorization through an NN-dimensional space is at most NN.

The source encoding gives the constraint

2λ≤dim⁡Vh,λ≤D(h)(E)2^\lambda\le\dim V_h,\qquad\lambda\le D(h) \qquad\text{(E)}

Lemma 2.3 (Rank floor). If dXλdX_\lambda is the sum of ∣I∣|I| such pieces, then

2λ≤D(4h)+log⁡2∣I∣(R)2\lambda\le D(4h)+\log_2 |I| \qquad\text{(R)}

References

  1. [1]R. Impagliazzo and R. Paturi, On the complexity of k-SAT, J. Comput. System Sci. 62 (2001), 367–375.DOI
  2. [2]R. Impagliazzo, R. Paturi, and F. Zane, Which problems have strongly exponential complexity?, J. Comput. System Sci. 63(4) (2001), 512–530. https://doi.org/10.1006/jcss.2001.1774.
  3. [3]OpenAI, The Exponential Time Hypothesis is False, OpenAI Math Release preprint, revised 25 October 2026. https://github.com/openai/math/tree/main/preprints/The-Exponential-Time-Hypothesis-is-False-October-25-2026.hub.valency.io/works/W_h8uqubsk
  4. [4]Claude (Anthropic), A 2^{o(n)} time algorithm for 3-SAT, Hexagon preprint 2610.00577v1 (deposited 27 October 2026). https://hexagonmath.org/2610.00577v1.
  5. [5]Carlos Stein Naves de Brito, The partition exponent in the graded pieces of the Claude 3-SAT algorithm is optimal for pieces of that shape, Hexagon preprint 2610.00692v1 (31 October 2026). https://hexagonmath.org/2610.00692v1.
  6. [6]Ruhollah Majdomdin, Lowered crossover points of Anthropic’s subexponential 3-SAT algorithm, arXiv:2610.41622v1 (submitted 30 October 2026). https://arxiv.org/abs/2610.41622.
  7. [7]Vaibhav Tulsyan, What the ETH refutations do not give: barriers for the counting engines, with machine-checked lemmas, Hexagon preprint 2611.00149v1 (6 November 2026). https://hexagonmath.org/2611.00149v1.hub.valency.io/works/W_py8r3393
  8. [8]G. H. Hardy and S. Ramanujan, Asymptotic formulae in combinatory analysis, Proc. London Math. Soc. (2) 17 (1918), 75–115.
  9. [9]A. E. Ingham, A Tauberian theorem for partitions, Ann. of Math. (2) 42 (1941), 1075–1090. https://doi.org/10.2307/1970462.
  10. [10]B. Mukhametzhanov and A. Zhiboedov, Modular invariance, tauberian theorems and microcanonical entropy, JHEP 10 (2019), 261. https://doi.org/10.1007/JHEP10(2019)261.
  11. [11]T. M. Apostol, Modular Functions and Dirichlet Series in Number Theory, 2nd ed., Springer (1990).
  12. [12]A. R. Calderbank, E. M. Rains, P. W. Shor, N. J. A. Sloane, Quantum error correction via codes over GF(4), IEEE Trans. Inform. Theory 44 (1998), 1369–1387.
  13. [13]J. L. Cardy, Operator content of two-dimensional conformally invariant theories, Nucl. Phys. B 270 (1986), 186–204.DOI
  14. [14]J. H. Conway, N. J. A. Sloane, Sphere Packings, Lattices and Groups, 3rd ed., Springer (1999).
  15. [15]A. Dymarsky and A. Shapere, Quantum stabilizer codes, lattices, and CFTs, JHEP 03 (2021), 160; arXiv:2009.01244. https://doi.org/10.1007/JHEP03(2021)160.
  16. [16]R. S. Ellis, Entropy, Large Deviations, and Statistical Mechanics, Springer (1985).
  17. [17]T. Hartman, C. A. Keller and B. Stoica, Universal spectrum of 2d conformal field theory in the large c limit, JHEP 09 (2014), 118. https://doi.org/10.1007/JHEP09(2014)118.
  18. [18]G. Höhn, Self-dual codes over the Kleinian four group, Math. Ann. 327 (2003), 227–255; arXiv:math/0005266.arxiv.org/abs/math/0005266
  19. [19]F. Johansson, Arb: efficient arbitrary-precision midpoint-radius interval arithmetic, IEEE Trans. Computers 66 (2017), 1281–1292.arxiv.org/abs/1611.02831

Paper details

vlnc:W_yny74wex
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Computer Science

Not recorded for this paper

View statement
Looking for related papers…
Contents