# With the attached generate.py in the current directory:
from generate import BinderCumulants
g = BinderCumulants()
g.value({'m': 6, 'n': 6}, 100)
list(g.enumerate()) # every rectangle 2 <= m <= n <= 6Exact integer counts of down spins and disagreement bonds are computed by row transfer, and each cumulant is evaluated exactly in $\mathbb Q(\sqrt2)$. Its rational coefficients are enclosed at the positive square root of $2$ using real ball arithmetic [3]. Computation at 429 bits, including 96 guard bits, retains at least 418 bits of relative accuracy, about 125 decimal digits, before serialization to 100 significant digits. The generator recomputes the counts; the attached count data and numerical evidence are outputs, not inputs.
An independent edge-subgraph expansion counts subgraphs with zero, two or four odd-degree vertices, giving separate second and fourth magnetization moments for every rectangle. Its even-subgraph polynomial also reproduces every coefficient of the zero-field cut polynomial. Direct spin enumeration checks the full two-variable counts for all nine rectangles with at most 16 sites. Checks cover spin reversal, rotational symmetry, the specializations at $b=0$ and $b=1$, and the corresponding magnetization moments. The single spin, the single bond and the four-cycle provide known-answer controls. Every stored decimal interval contains a 600-bit enclosure of the independent exact cumulant, and every entry passes generator verification. Reproducible checks, exact counts and numerical evidence are attached.