Subproduct rank certificate at mask 160
ProvedCouret.S5.rank_row_160couret-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_160 : RankFacts 160 := 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/RankBlock10.lean, lines 7–7; source file SHA-256 52b63cffad1c4846b6e501c6169d3b95ec6d20a23003c5390648bc639bbcb164; theorem Couret.S5.rank_row_160