Subproduct rank certificate at mask 152
ProvedCouret.S5.rank_row_152couret-programmecouret-unification-20261108
Let be the supplied rank table for masks of the eight unit residues modulo 30, and let be the subproduct mask update on letter . At the fixed mask ,
This is one row of the finite rank-growth certificate.
Preamble
import Definitions.Def_Couret_RankBlock00_bd2f9788729f import Std import Definitions.Def_Couret_RankBlock00_bd2f9788729f set_option maxRecDepth 100000 set_option maxHeartbeats 4000000 namespace Couret namespace S5
Formal statement
theorem rank_row_152 : RankFacts 152 := 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/RankBlock09.lean, lines 15–15; source file SHA-256 cf82452ae772ea8b3c462b4573a0213fc3b411e420f2f7e6970c57e7d682703c; theorem Couret.S5.rank_row_152