Second compression step in a Pareto-frontier chain. Start from the new N=1253, |A|=27 witness (itself compressed from the local-maximum N=1267, |A|=28 witness), apply x -> 1076x+395 mod 1253, reduce to N=1225, and delete one element hitting all new conflicts. Iterative local-maximum compression.
Yongxi (Aaron) Lin · 2026-08-07 21:29:51 UTC