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

H7. The decay is the NUMBER OF APPLICATIONS THAT ACTUALLY ARRIVED at this position on this time
step, rather than a constant.

THE RULE. Same accumulation as the baseline, and the same SHAPE of decay, but the amount is
fwd_fired plus bwd_fired plus tok_fired, subtracted with lsa_sub from every one of the 256 entries.
A position that two patterns reached decays by 2, one that three reached decays by 3, and one that
nothing reached does not decay at all.

It therefore differs from a constant fall-off exactly where applications are MISSING: the first and
last positions of a window (the non-overlapping tiling means an edge settles from one side only),
positions before the second byte where no token context exists, and every position whose backward
direction has an empty predecessor set under B1, which at e64 is 218 of the 256 bytes. Under a
constant those positions decay at the full rate while receiving less than the full evidence.

It needs no support at all, so unlike #f-p8-decay-deficit and #f-p8-decay-period it is untouched by
the k=1 strength gap and by axis B, and it is the cheapest of the six to reason about.

HISTORY.
Generation 5, A6's idea (#f-p8-indegree) restated on the cap-8 delivery -- the smallest correction
that removes the withdrawn argument entirely. The 2 that A2 subtracted was the count of neighbours,
from the constant-sum derivation that generation 3 withdrew. The invariant is gone; the COUNTING was
never the questionable part.
```