An exhaustive check of the sharp Hilbert-form conjecture Psi = H + 3|T| <= 3 over all 2^48 sign inputs at resolution 2 (our own conjecture, a finite case; not progress on C*)
In our dyadic triangular Hilbert preprint (doi:10.5281/zenodo.23232389) we conjectured (Conjecture 7.1) that Ψ = H + 3|T| ≤ 3 ∏||Fv||3 for all real inputs, which would give C* = 3. Here we check the sign-input, resolution-2 case exhaustively. Over all 248 sign inputs F ∈ {±1}48 at resolution N = 2 we find Ψ ≤ 3, with maximum exactly 3 (S = 192 in units of 1/64) and 0 violations. The enumeration runs over 230 reduced pairs (F0, F1); 4,608 of them attain 3. The independent auditor found, as a by-product, that 36,864 of the 248 inputs attain Ψ = 3. Three enumerations agree. Two producer implementations (a Python float32 kernel under a 224 exactness guard, and an integer-only C program) are independent implementations that share two reductions (a sign fix and an ℓ1 reduction over F2); both are exact identities, proved in the audit. The auditor's own enumeration uses neither (an exact diagonal sign gauge, orbits of size 211, and a literal maximum over all 216 choices of F2) and reproduces the producer histogram bin by bin (times 512) in all five modes. Controls. The earlier max R = 2 is reproduced; the Haar-free form reaches N + 1 = 3 for R and 5 for Ψ (7,356,928 pairs above 3); a planted weight 4 in place of 3 gives 741,888 violating pairs. The preregistered kill criterion (60 core-hours) projected 1.135 core-hours and did not fire; about 10 core-hours were used. Status. This is our own conjecture; an exhaustive check at N = 2 for sign inputs (two producer enumerations plus an independent auditor enumeration); not progress on C*; Tier C. What this is NOT: nothing for real-valued inputs, nothing for N ≥ 3, nothing about the value of C*, no Lean or other proof object for the 248 statement; the compiler and hardware are trusted (all runs on one machine). No erratum for the earlier preprint is needed. Limitations. Independently audited by a separate AI agent instance (AUDIT.md, ACCEPT_WITH_CORRECTIONS, corrections applied); no human audit. The Python float32 kernel was not rerun by the auditor. The Elenchus ledger gate exits with code 0 (10 claims, no findings; no Tier A rows).
Authors
- Xavier Callens
Publication Details
- Journal
- Zenodo (CERN European Organization for Nuclear Research)
- Published
- 2026-10-31
- DOI
- https://doi.org/10.5281/zenodo.23840416
- Primary Topic
- Analytic Number Theory Research
- Type
- preprint