# Download generate.py and eta-data.json from this table.
from generate import ThompsonCoefficients
generator = ThompsonCoefficients()
# One more grade in a selected class; the result is exact.
print(generator.value({'g': '3A', 'n': '205'}, 100))Computed using exact integer Euler-product recurrences and rational linear combinations of the eta bases supplied in [3] and [4]. Every division in the recurrence is checked for exact divisibility, every final coefficient is required to be integral, and coefficients outside the plus-space residues are required to vanish. No decimal approximation or numerical rounding produces a stored value.
All 816 entries agree with the author’s supplementary coefficient list. An independent Rankin–Cohen construction reproduces all 102 identity-class entries. The rational identities in [1], Table A.6, hold through the full selected range for all eight theta-split total series and for the separate odd sectors of five classes, using finite Euler products rather than the generator’s recurrence. Seven selected congruences hold at all 102 grades. The first six representation decompositions agree with the Thompson degrees, and all 30 overlapping fundamental-discriminant values agree with the separately computed twisted-trace table.
The attached CM checker also tests all 61 positive fundamental-discriminant grades in the selected range with independent reduced quadratic forms and 1024-bit Arb modular-j evaluations. It requires finite enclosures with real and imaginary radii below $10^{-110}$ before checking the exact predicted trace. Known-answer and deliberately incorrect controls precede the comparisons. The attached scripts repeat the checks on values read from the draft; numerical-evidence.json and cm-evidence.json record the outcomes.