Event germs, guard, transport, and finite code

Sufficient data-wire counts, excluding fixed identifiers and tables, are

The generic synthesis uses at most $2M_B$ or $2M_A$ wires including clean work, plus tables and active matter. These are existence, not efficiency, bounds.

The $n$-dependent storage is separately reserved transport/history storage, not a global-name-count guard. The implementation covers the discrete event only, not continuous affine evolution, arbitrary real clocks, or arbitrary configurations.