DSRG(78,27,13,8,10) and DSRG(78,50,36,32,32) (teichmuller_lift, 5 Nov 2026). Code MIT, data CC BY 4.0.
Vertices (i, x), i in {0,1,2}, x in Z_26, label 26 i + x; (i,x) -> (j, x+g) for g in D_ij.
blocks_n26.jsonl          all 24 solutions of the half-shift model at n = 26, one 3x3 list of D_ij per line
A78_27_class*.txt         one adjacency matrix per isomorphism class (6 classes = 3 converse pairs, |Aut| = 52 each)
A78_50_36_32_32_from00.txt  complement of class 00
sym3h.py                  the search (numpy): python3 sym3h.py 26 s 4 out.jsonl for s = 0..3 (under 2 min each)
verify_dsrg_pure.py       pure-Python 2-path count: python3 verify_dsrg_pure.py A78_27_class00.txt 78 27 13 8 10 -> PASS
