williamson-n61
reproducedLang and Schneider [21] report in their introduction that they implemented the exhaustive algorithm of Holzmann, Kharaghani and Tayfeh-Rezaie [17], extended its results from order 59 to order 61, and found exactly one equivalence class of Williamson matrices of order 61, which is of Turyn type; Bright, Kotsireas and Ganesh [5] cite the enumeration at 61 to that paper. Only the first two pages of [21] were read for this record. The board's own census is a full run of the pinned engine williamson-hkt-v2 on 2026-11-14 (17,359 s on 8 threads), registered as a replay: it returned one class, the Turyn-type quadruple already on the board, so the board's count agrees with the published one. The run is an independent reproduction of a published classification, not a first result.
Original source attribution: Turyn 1972 construction (the class tabulated by Hall and London); classified as the only class at this order by this board's pinned census williamson-hkt-v2
Submitted / imported by: vprusso · 2026-11-14
Board cell: Williamson (ssss)
Entry file: census/williamson-n61.json · raw JSON
Notes
No published exhaustive classification at this order is recorded (Lang and Schneider classify only the Turyn type). The full census run on this board finds exactly one class, the Turyn-type one; the count is exact on the board only through the registered replay of the pinned engine.
Checks and result
{
"id": "williamson-n61",
"type": "census",
"n": 61,
"stratum": "williamson",
"equivalence": "equiv-v1",
"count": 1,
"bound": "exact",
"tier": "reproduced",
"claimed_count": 1,
"claim_kind": "lower-bound",
"checks": [
"pairwise-inequivalence",
"registered-full-census-replay",
"representative-existence"
],
"replay": {
"engine_id": "williamson-hkt-v2",
"host": "bos-game",
"threads": 8,
"date": "2026-11-14",
"wall_seconds": 17359.0,
"raw_rows": 1
},
"limitations": [
"Full offline replay of a pinned engine, re-derived from its raw rows here; the same engine can reproduce its own systematic bugs."
],
"contributions": [
{
"id": "williamson-61-reproduction",
"title": "Williamson census at n=61, one class, reproducing a published classification",
"relation": "independent-reproduction",
"publication_status": "published",
"contributors": [
{
"name": "vxvware",
"github": "vxvware"
}
],
"summary": "Lang and Schneider [@lang2012turyn] report in their introduction that they implemented the exhaustive algorithm of Holzmann, Kharaghani and Tayfeh-Rezaie [@holzmann2008williamson], extended its results from order 59 to order 61, and found exactly one equivalence class of Williamson matrices of order 61, which is of Turyn type; Bright, Kotsireas and Ganesh [@bright2020williamson] cite the enumeration at 61 to that paper. Only the first two pages of [@lang2012turyn] were read for this record. The board's own census is a full run of the pinned engine williamson-hkt-v2 on 2026-11-14 (17,359 s on 8 threads), registered as a replay: it returned one class, the Turyn-type quadruple already on the board, so the board's count agrees with the published one. The run is an independent reproduction of a published classification, not a first result.",
"entry_ids": [
"williamson-n61"
],
"featured": false,
"stratum": "williamson",
"label": "Independent reproduction",
"position": 23,
"recorded_at": "2026-10-15"
}
]
}Sources
- This board's pinned census williamson-hkt-v2, run to completion at n=61
- Lang, Schneider, Turyn type Williamson matrices up to order 99, Des. Codes Cryptogr. 62 (2012): the Turyn-type classes at this order [21]
Submission JSON
{
"schema_version": 1,
"n": 61,
"group": {
"kind": "cyclic",
"invariant_factors": [
61
]
},
"submitted_by": "vprusso",
"submitted_at": "2026-11-14",
"discovered_by": [
"Turyn 1972 construction (the class tabulated by Hall and London); classified as the only class at this order by this board's pinned census williamson-hkt-v2"
],
"sources": [
{
"title": "This board's pinned census williamson-hkt-v2, run to completion at n=61",
"url": "https://github.com/vxvware/goethals-seidel-challenge/blob/c9ad8d3f82680b9153028b7a15f0e1ad80403244/research/starter/williamson/wil_hkt2.c",
"commit": "c9ad8d3f82680b9153028b7a15f0e1ad80403244",
"source_path": "research/starter/williamson/wil_hkt2.c"
},
{
"title": "Lang, Schneider, Turyn type Williamson matrices up to order 99, Des. Codes Cryptogr. 62 (2012): the Turyn-type classes at this order",
"url": "https://doi.org/10.1007/s10623-011-9498-9"
}
],
"equivalence": "equiv-v1",
"id": "williamson-n61",
"type": "census",
"stratum": "williamson",
"representatives": [
"n61-0732fca9a2b40fa15e62"
],
"claimed_count": 1,
"claim_kind": "lower-bound",
"notes": "No published exhaustive classification at this order is recorded (Lang and Schneider classify only the Turyn type). The full census run on this board finds exactly one class, the Turyn-type one; the count is exact on the board only through the registered replay of the pinned engine."
}