The spanning theorem

What the legal rows look like, level by level
levels that span
excluded levels
rows with q = 1, 2 (a single entry) rows with q ≥ 3 (one entry per a/q) columns carrying the obstruction x

Reading the picture

Levels that span

Excluded levels

Ranks computed modulo the prime \(2^{61}-1\) (full rank modulo a prime implies full rank over \(\mathbb Q\)). For every level that spans, the rank is \(Q\) at the table's \(Q\) and below \(Q'\) at \(Q'=Q/p\) for each prime \(p\mid Q\), as the table says. For the excluded levels the orthogonality of the amber vector to all legal rows was checked numerically (largest pairing below \(10^{-15}\)).