vertices 20, edges 30 faces 12 ; distinct half-turns: 15
for every vertex v, the numbers of half-turns h with d(v,h(v)) = 0,1,2,3,4,5 are [0, 3, 0, 6, 3, 3]
N_1, N_2, -N_2, -N_1, -v are the vertices at distance 1, 2, 3, 4, 5 from v = (1,1,1): ok
the table in the proof of Lemma 7.2 (four sign patterns, a.a = 4, v.a, h_a(v)) and h_(1,0,0)(v) = (1,-1,-1): ok
15 axes through the midpoints of the 30 edges: ok
distance matrix rows (vertex order: 8 cube vertices, then (0,+-1/phi,+-phi) and cyclic permutations):
02232335111333222444
20323253321143412234
23023523213431124342
32205332423241314132
23350223132314241423
32532032342124431213
35232302234412143321
53323220444222333111
13241324022423132533
12123434202342213353
11332244220234321335
31423142432033522123
34341212243303252312
33114422324330225231
24132413123522033432
21214343312252303243
22441133231225330324
42314231533132423022
43432121353213342202
44223311335321234220
ALL CHECKS PASSED
