The subproduct run fits in an eight-bit mask
ProvedCouret.S5.subRun_boundcouret-programmecouret-unification-20261108
For every finite word in the eight unit residues modulo 30, the natural number mask computed by the subproduct run satisfies
This certifies the fixed eight-bit representation for every word length.
Preamble
import Definitions.Def_Couret_SubproductSemantics_e0771d3a736f import Std import Theorems.Thm_Couret_shiftMaskOn_lt_256 import Theorems.Thm_Couret_singletonMask_lt_256 import Definitions.Def_Couret_BCS5MaskSemantics_646df6f48a3c set_option maxRecDepth 100000 set_option maxHeartbeats 4000000 namespace Couret namespace S5
Formal statement
theorem subRun_bound (w : Word Code30) : subRun w < 256 := by sorry end S5 end Couret
Source
Alexandre Couret, Certified minimal memory for a divisor-residue presence observable modulo 30, https://zenodo.org/records/23989640; archive Couret_BC_MOD30_Companion_20261105.zip, SHA-256 9bb2678164c63a9e47c192093f5ce9deb1b7b74a1f1c8fecc77f305a408266a2; file source/S5/SubproductSemantics.lean, lines 25–28; source file SHA-256 ba13bc319dc0b6baacbd98ea26d1e89628af10edec99409e87d0f01ff3d4e21c; theorem Couret.S5.subRun_bound