Part 2 of the 10²¹ search will be finished, for the most part, today. There are still ~2000 unfinished WUs which can take up to a couple of weeks to complete, depending on individual participants processing them.

Part 3 of the search will look for amicable pairs where the smaller member of the pair has its largest prime factor between 10¹¹ and 10¹⁴:

m=m1*p, 10¹¹ < p < 10¹⁴

There are too many primes larger than 10¹⁴ (all primes up to 5*10¹⁹ need to be checked), so they will require a different approach and a new application when the time comes.

Most of the participants have already started getting part 3 WUs. The new work units will require ~2.5-2.7 GB RAM on CPU, and the same amount of RAM on GPU (for GPU applications), so the minimum requirement for GPUs will be 3 GB RAM.

Update April 9th, 2024: I found a bug in OpenCL applications, which resulted in many false negatives (around 12.5%). The bug was in the new code that I added for the part 3, so the previous search is unaffected. Version 3.09 has this bug fixed, but I had to restart the part 3. Luckily, we were only a couple of weeks in.

Très bonne nouvelle.
On est prêt pour manger toute cette nouvelle aventure.
Merci pour ton travail :)

It is interesting how many other searches do you expect?

Thanks for the update, Sergei. I greatly appreciate the timely updates and explanations! I am delighted to be crunching on behalf of such a well-managed enterprise.

---

I found a bug in OpenCL applications, which resulted in many false negatives (around 12.5%). The bug was in the new code that I added for the part 3, so the previous search is unaffected. Version 3.09 has this bug fixed, but I had to restart the part 3. Luckily, we were only a couple of weeks in.

Good catch! Will all Part 3 WU's run on 3.08 need to be re-run? And if so, will the false-negative tasks and/or their earned credit be removed?

All old v3.08 WUs need to be re-run (each WU missed ~12.5% of amicable pairs), but earned credit will remain.