Final compressed hypothesis: E4[70:97]=W4[73:100]=E5[71:98] plus W1[38]=W1[68], interpreted as equal plaintext actions, zero-based end-exclusive. All35 possible fixed exception pairs are excluded with fresh domains and complete boundary branching. No ordinary-alphabet count limit or shared initial deck is used.

A tempting18-action triple core excluded the last pair(1,82), but a full census left(1,80) and(3,82). That failed compression is saved intact in census.json. The final27-action core restores enough earlier context for those two pairs and was replayed freshly for all35. This is adaptive proof compression, not a proof that27 actions are necessary.
