hunting-hadamards
The Goethals–Seidel challenge

Hunting Hadamards

Four ±1 sequences of length n that fit together give a Hadamard matrix of order 4n. This board tracks every known case for odd n ≤ 131, each one verified exactly.

In every matrix picture skew blocks are green, symmetric blocks blue and blocks with neither symmetry grey; light is +1 and dark is −1.

Status by order and type

The first two columns are about the order 4n itself: whether a Hadamard matrix and a skew-Hadamard matrix of that order is known by any construction, according to the sources of the orders page. Each shows the order and links to its row there. The other columns are about cyclic Goethals–Seidel quadruples at n, by the symmetry types of the blocks A, B, C, D: s symmetric, k skew. The column for quadruples with a skew block contains the good, best and G-matrix columns, and the last column is any quadruple. A cell of the second group can be unresolved while a matrix of order 4n is known by another construction, as for skew-Hadamard matrices at n = 85, 129 and 131. Class counts treat reversals as equivalent; the last two columns also identify independent cyclic shifts (equiv-v2), without which every class at those orders splits into thousands.

Verified; a number is the class count, ✓ is existence without a countPublished, not importedEmptyUnresolvedContradicts a published resultNew result
Order 4n: a verified matrix is on this boardknown by some construction, not held herereported, not yet in a reviewed sourceopen in the sources read
nmatrix of order 4n, any constructioncyclic Goethals–Seidel quadruples at n
hadamardskew-hadamardWilliamson (ssss)Good (ksss)Best (kkks)G-matrices (kkss)With a skew blockAny
144111111
31212111111
5202011–111
72828232144
9363631–2913
11444413–02448
1352524626247588
156060411–18452217870
17686842–06017103093
19767668–51007461649523
218484710712✓✓
23929216–8✓✓
25100100109–7✓✓
27108108613–10✓✓
2911611615–0✓✓
311241242324✓✓
33132132515–20✓✓
3514014006–0✓✓
3714814842–7✓✓
3915615615–0✓✓
411641641––3✓✓
431721722154✓✓
4518018014–1✓✓
4718818800–0✓✓
4919619610–1✓✓
5120420420–4✓✓
5321221201–0✓✓
5522022011–3✓✓
572282281130✓✓
5923623600–1✓✓
6124424411–2✓✓
632522522––✓✓✓
652602600?––✓✓
67268268?–––✓✓
692762761––?✓✓
71284284??––✓✓
73292292????✓✓
75300300✓?–✓✓✓
77308308??–?✓✓
79316316✓?–✓✓✓
81324324??––✓✓
83332332??––✓✓
85340340✓?–??✓
87348348✓?–✓✓✓
89356356??––✓✓
91364364✓??✓✓✓
93372372??–?✓✓
95380380??––✓✓
97388388✓?–?✓✓
99396396✓?–✓✓✓
101404404??––??
103412412??–?✓✓
105420420??––✓✓
107428428??––??
109436436??––✓✓
111444444????✓✓
113452452??–?✓✓
115460460✓?–✓✓✓
117468468✓?–?✓✓
119476476??––✓✓
121484484✓?–?✓✓
123492492??–?✓✓
125500500??––✓✓
127508508?✓––✓✓
129516516✓?–??✓
131524524??–???

New results

Statements on this board that a literature search did not find in any source it could read. Some relevant papers could not be read, so this reports the searches and does not claim priority.

Contradicts a published result

Not found by a literature search made on 2026-11-21. Counts are equivalence classes. Each statement comes from an exhaustive computer search, not from a proof.

Classifications

Not found by a literature search made on 2026-11-21. Counts are equivalence classes. Each statement comes from an exhaustive computer search, not from a proof.

Nonexistence

Not found by a literature search made on 2026-11-21. Counts are equivalence classes. Each statement comes from an exhaustive computer search, not from a proof.

Existence

Each statement is about explicit rows on the board, which the verifier checks exactly; no exhaustive search is involved. The date of the search for earlier matrices is given with each item.

Bring a construction

Submit four defining rows or negative-index sets. The verifier derives the family, checks the PAF identity, and detects equivalent entries.

./gs verify candidate.json
./gs submit candidate.json

Contribution guide ↗