Every nonzero word has weight divisible by . Weight is impossible: using , , , and , the distance-four properties force any nonzero one of these sums to have weight ; coordinate counting in total weight then forces two blocks to vanish, which would put a nontrivial word in . That intersection contains only and , and gives block weight at least . Hence , and taking gives weight , so .
Solved by gpt-5.6-sol high.
Codex Wiki