n=10: 1 exact positive certificate(s); first modes=(1, 2, 3, 4)
n=24: 1 exact positive certificate(s); first modes=(3, 4, 8, 9)
checked through n=25
n=28: 6 exact positive certificate(s); first modes=(1, 2, 6, 13)
n=40: 8 exact positive certificate(s); first modes=(1, 2, 9, 18)
n=42: 2 exact positive certificate(s); first modes=(3, 9, 14, 15)
checked through n=50
n=60: 12 exact positive certificate(s); first modes=(1, 2, 13, 28)
checked through n=75
n=84: 4 exact positive certificate(s); first modes=(1, 25, 35, 37)
checked through n=100
checked through n=125

primitive levels found: [10, 24, 28, 40, 42, 60, 84]
NOTE: absence of hits is computational evidence, not a nonexistence proof, because candidate generation uses floating-point screening.
elapsed=0:01.97
