```
ID: f-p8-period
Type: f

A5, generation 3, the literal reading of "each pattern fires at a rate set by its own support".

The rate is a schedule rather than an attenuation, and there is no decay at all. A pattern of support
s is applied only on the time steps where the step number is a multiple of 2^(smax - s), so the
best-supported pattern in the model is applied on every step, one at half that support on every
second step, and so on. What an application delivers is unchanged; how often it happens is the axis.

This is the alternative that takes the word "rate" at face value, and it makes a prediction the others
do not: a window runs W time steps, so a pattern whose period exceeds W NEVER FIRES INSIDE A WINDOW at
all. Whether that is the right behaviour for weak evidence or a defect is the sort of thing the
generation exists to look at rather than to argue about.

The fall-off is implicit: nothing is subtracted, and a position's state stops growing simply because
the patterns feeding it are applied less often. If a constant-sum-like behaviour is wanted, this is
where it would have to come from, and it would come from the rates rather than from an invariant
imposed after the fact.

AS BUILT, and these are the numbers the runs used rather than what should win. smax is the largest
learned weight over the k=1 argmax pairs and over the kept k=2 rules, floored at 1: 2 at e64, 6 at
e1k, 9 at e10k. A pattern's own support s_p is the LEARNED weight -- for k=1 it is
c1[a*256 + table[a]] and for k=2 it is the rule's stored weight -- so a k=1 pattern here
simultaneously DELIVERS at the absolute 255 and has a rate set by a support of 0, 1 or 2. That is the
k=1 strength gap of #f-p8 appearing inside this alternative, not beside it. At e64, 229 of the 256
sup1 entries are 0, a byte never seen as a predecessor.

AND THE PREDICTION ABOVE IS NOT HYPOTHETICAL. The period is 2^(smax - s_p) and W is 128, so at e64
the periods are 1, 2 or 4 and everything fires; at e1k they reach 64; at e10k they reach 512 and a
support-0 pattern NEVER FIRES INSIDE A WINDOW, which at that sample is 169 of the 256 bytes.

AS BUILT IT ALSO BUYS NOTHING. The three vectors are computed, and settle_apps counted, BEFORE the
period decides whether to apply them, so a skipped application costs what a taken one costs. #f-p8's
derivation says applying a pattern always costs energy, which is the whole reason a rate is a rate;
an implementation that meant it would decide before computing. Recorded rather than fixed, because
changing it changes what was measured.

Deterministic, for the same reason as #f-p8-deficit, and with the same note about where support comes
from and about the reference support smax.
```