```
ID: f-p8-decay-assign
Type: f

H2. ASSIGNMENT: the longest k that fires wins outright, and there is no accumulation and therefore
no decay at all.

If a k=2 token application reaches this position, the position's new state IS what that application
delivered; otherwise it is the elementwise LSA maximum of the forward and backward k=1
applications; if neither fires, 256 zeros. The axis's degenerate point, and the control that shows
what accumulating buys once the delivery is no longer saturating.

It is the one alternative on either f axis whose settling DRAWS NO ENTROPY, which is what makes it
conformance-checkable in a viewer without replaying the stream.

HISTORY.
Generation 5, A1's idea (#f-p8-assign) restated on the cap-8 delivery. A1 ran with the k=1 delivery
at 255, so an assignment wrote a saturated row: one entry at 255 and the rest at 0, a position
claiming absolute knowledge from a rule that holds twice in five occurrences. At the cap-8 delivery
an assignment writes 8 and the rest 0, which is a claim of partial knowledge, and the readout's
tie-break stops deciding a large share of the answers by default.

WHY.
Pruned as a design in generation 1 and not un-pruned here: it is built because the generation
restates all six, and because a control that draws no entropy is worth having (#p8v2_gen3 wanted it
kept for exactly that).
```