hunting-hadamards
census · order 33

good-n33

reproduced

Origin not yet classified

Original source attribution: Published searches surveyed in arXiv:1811.05094 (Szekeres 1988; Koukouvinos 1999; Georgiou, Koukouvinos, Stylianou 2002; Đoković and Kotsireas 2018; Bright, Đoković, Kotsireas, Ganesh 2019); enumerated here by the vxvware good census
Submitted / imported by: vprusso · 2026-10-29
Board cell: Good (ksss)
Entry file: census/good-n33.json · raw JSON

Notes

Full census replayed on this board by good-census-c-v1 on every verification. Before the engine was pinned its class sets were checked against the Python enumerator at orders 3 to 15, the stored saw-best-matrix censuses at 17 to 45, and the published counts of arXiv:1811.05094 at orders divisible by 3.

Checks and result

{
  "id": "good-n33",
  "type": "census",
  "n": 33,
  "stratum": "good",
  "equivalence": "equiv-v1",
  "count": 15,
  "bound": "exact",
  "tier": "reproduced",
  "claimed_count": 15,
  "claim_kind": "computed-exact",
  "checks": [
    "representative-existence",
    "pairwise-inequivalence",
    "full-enumeration-replayed"
  ],
  "contributions": []
}

Sources

Submission JSON
{
  "schema_version": 1,
  "n": 33,
  "group": {
    "kind": "cyclic",
    "invariant_factors": [
      33
    ]
  },
  "submitted_by": "vprusso",
  "submitted_at": "2026-10-29",
  "discovered_by": [
    "Published searches surveyed in arXiv:1811.05094 (Szekeres 1988; Koukouvinos 1999; Georgiou, Koukouvinos, Stylianou 2002; Đoković and Kotsireas 2018; Bright, Đoković, Kotsireas, Ganesh 2019); enumerated here by the vxvware good census"
  ],
  "sources": [
    {
      "title": "This board's pinned census good-census-c-v1, replayed at n=33",
      "url": "https://github.com/vxvware/goethals-seidel-challenge/blob/f9862dd59ab3f981e08810e66860ba84c9c2d782/research/starter/good/good_c.c",
      "commit": "f9862dd59ab3f981e08810e66860ba84c9c2d782",
      "source_path": "research/starter/good/good_c.c"
    },
    {
      "title": "Bright, Đoković, Kotsireas, Ganesh, A SAT+CAS approach to finding good matrices: new examples and counterexamples (AAAI 2019), Table 1 and its survey of earlier searches",
      "url": "https://arxiv.org/abs/1811.05094"
    }
  ],
  "equivalence": "equiv-v1",
  "id": "good-n33",
  "type": "census",
  "stratum": "good",
  "representatives": [
    "n33-03b19decc3812569f87d",
    "n33-38a03be799bfa81b596d",
    "n33-394fd84684c74c9fe4c4",
    "n33-4a3834b547b0d8584954",
    "n33-5598006b0af71ca22ba2",
    "n33-810f5c15e21dfd73adee",
    "n33-82126cdb9f6a13c02587",
    "n33-8323225b8996d72ae493",
    "n33-8715a6b6e7a9bb432b31",
    "n33-a6565f96b5a54299a023",
    "n33-cccd777dd53e10033366",
    "n33-d57c961b02702bad373b",
    "n33-e2beedec9c9c5597117c",
    "n33-eb04b58679d36e336179",
    "n33-fad3cc68da7e7f8ebed5"
  ],
  "claimed_count": 15,
  "claim_kind": "computed-exact",
  "enumerator": "good-census-c-v1",
  "notes": "Full census replayed on this board by good-census-c-v1 on every verification. Before the engine was pinned its class sets were checked against the Python enumerator at orders 3 to 15, the stored saw-best-matrix censuses at 17 to 45, and the published counts of arXiv:1811.05094 at orders divisible by 3."
}