Pascal's OPN roadblock files - Page 105

RichD · 2023-05-31, 03:43

A few more. The factors from me will diminish as more of my resources will be devoted to the big a** number mentioned above.

Code:

3467610346919918834126678092499928327442767745107716019351977621838827
2735455769058518946491682720378295861
14967784005618433966569966686009341
4059758330560316115149536915656637
6640331280279601934472939918911396630485770669593
6860912768819879162004010474902267559738391446489331375836811
72993077118248788907478349027226347
767723359717672328857726146997
8408341579745335853285431401802254864197788285502144701
351431591613319033089274720527267233931851952975320885024401058612059
3207814835919094251709827273475889089141

VBCurtis · 2023-05-31, 20:57

Looks like everyone who showed interest in this team-CADO job is connected and working. Yield so far is between 4.0 and 4.05; we have collected 25M relations so far, and ETA jumped from 19 Jul yesterday to 7 July currently (so someone added a few clients).

We will need at minimum 100MQ sieved to reach our target relations, likely closer to 110M Q-range.

I'll post updates every 5-7 days here, but you can track general progress by simply noting the Q your client is currently sieving; we started at Q=50M, end will be Q=160M.

RichD · 2023-06-02, 02:14

And...

Code:

24889656724823269744341366087096829169834872627978107754106975766043471003
337089672698299220320631981001909641
1018947298607899822252210318574886621183254236721
5315386473288793667257455674964149017689774006007762831777401624712339447911834404608430928647011415929747311668182487269

Pascal Ochem · 2023-06-03, 05:49

The t550 file is now empty. Thank you!
Now I will maintain a t570 file instead.

Henry, with your ability to explore factor trees, maybe you can investigate this:
get a lower bound on the largest component of an OPN with special component 5^1 (or equivalently a number with abundancy index 5/3).
It should be easy to improve the bound 10^62 that holds for an unrestricted OPN.
Since 3 divides our number, we only need to forbid the prime 3 instead of millions of primes,
and we don't have the final argument with a system of inequalities.

With the currently known factors, you should not encounter any composite until a quite high bound, certainly greater than 10^150.

henryzz · 2023-06-03, 12:47

Quote:

Originally Posted by Pascal Ochem

The t550 file is now empty. Thank you!
Now I will maintain a t570 file instead.

Henry, with your ability to explore factor trees, maybe you can investigate this:
get a lower bound on the largest component of an OPN with special component 5^1 (or equivalently a number with abundancy index 5/3).
It should be easy to improve the bound 10^62 that holds for an unrestricted OPN.
Since 3 divides our number, we only need to forbid the prime 3 instead of millions of primes,
and we don't have the final argument with a system of inequalities.

With the currently known factors, you should not encounter any composite until a quite high bound, certainly greater than 10^150.

Is this basically the following command(with x set)?
pfn -COMP x -UT 3 -F
This doesn't force 5^1, although I believe it excludes 3 as required. 5^1 is excluded by 3.

Do you have a more recent version of the code than the version at https://www.arthy.org/opn/ ? In https://mersenneforum.org/showpost.p...&postcount=962 you mention a -Y option, which this does not have.

Is our current list of excluded primes sufficient? 127,19,7,11,331,31,97,61,13,398581,1093,3,5,307,17 http://www.lirmm.fr/~ochem/opn/efficiency.txt suggests this was only sufficient up to 1735. Adding 23 or 29 to the end of the list would be according to that script.

VBCurtis · 2023-06-04, 15:55

The team-sieve has gathered over 100M relations. ETA is now 23 June, thanks to swellman pointing all his machines at this job the last few days.
Yield is down into the 3.9's, which shifts our end-Q to something in 165-170M range.

The half of the job running on NFS@home should finish around 17 June, so I expect to be able to try filtering & matrix-building before we reach 450M local relations.

swellman · 2023-06-04, 17:00

Quote:

Originally Posted by VBCurtis

The team-sieve has gathered over 100M relations. ETA is now 23 June, thanks to swellman pointing all his machines at this job the last few days.

I just noticed a few minutes ago that my big machine had gone into a coma, i.e. goes to sleep and won’t respond to any known stimuli. Had to hard reboot. It ran for days with 20 threads pointed at this CADO job with no problem but last night I jumped it up to 44 threads and it didn’t last 12 hours (though it was running normally early this morning). Hmm.

Throttling back to 24 threads to see if that’s more stable.

henryzz · 2023-06-05, 12:58

Quote:

Originally Posted by henryzz

Is this basically the following command(with x set)?
pfn -COMP x -UT 3 -F
This doesn't force 5^1, although I believe it excludes 3 as required. 5^1 is excluded by 3.

Do you have a more recent version of the code than the version at https://www.arthy.org/opn/ ? In https://mersenneforum.org/showpost.p...&postcount=962 you mention a -Y option, which this does not have.

Is our current list of excluded primes sufficient? 127,19,7,11,331,31,97,61,13,398581,1093,3,5,307,17 http://www.lirmm.fr/~ochem/opn/efficiency.txt suggests this was only sufficient up to 1735. Adding 23 or 29 to the end of the list would be according to that script.

As an update to this, I have run "pfn -COMP 90 -UT 3 -F" successfully.
I have been iterating runs of 110 that have returned 0 due to 8 then 3 then 1 then 2 composites. Hopefully, the next run will succeed. edit: no another 2 edit2: and yet another 2. Moving to larger runs as reading the factors is taking the majority of the time.
How much further I can push this will depend on the number of factorisations that are needed for larger bounds and whether they are snfs or gnfs candidates.

SuikaPredator · 2023-06-06, 02:22

Quote:

Originally Posted by SuikaPredator

Halfway through t35. Factors:

Finished t35. Factors:

henryzz · 2023-06-06, 08:33

Quote:

Originally Posted by SuikaPredator

Finished t35. Factors:

Can I recommend that you keep a record of which numbers you have run t35 on. Attaching the list to a post(zipped) might be a good option.

I hope to be able to share a file including this info in the future.

Thanks for the factors.

SuikaPredator · 2023-06-06, 09:45

Quote:

Originally Posted by henryzz

Can I recommend that you keep a record of which numbers you have run t35 on. Attaching the list to a post(zipped) might be a good option.

I hope to be able to share a file including this info in the future.

Thanks for the factors.

Here are the remaining composites that survived t35.

2023-06-03, 05:49	#1148
Pascal Ochem Apr 2006 109 Posts	The t550 file is now empty. Thank you! Now I will maintain a t570 file instead. Henry, with your ability to explore factor trees, maybe you can investigate this: get a lower bound on the largest component of an OPN with special component 5^1 (or equivalently a number with abundancy index 5/3). It should be easy to improve the bound 10^62 that holds for an unrestricted OPN. Since 3 divides our number, we only need to forbid the prime 3 instead of millions of primes, and we don't have the final argument with a system of inequalities. With the currently known factors, you should not encounter any composite until a quite high bound, certainly greater than 10^150. Last fiddled with by Pascal Ochem on 2023-06-03 at 05:54

Similar Threads
Thread	Thread Starter	Forum	Replies	Last Post
Passive Pascal	Xyzzy	GPU Computing	1	2017-05-17 20:22
Tesla P100 — 5.4 DP TeraFLOPS — Pascal	Mark Rose	GPU Computing	52	2016-07-02 12:11
Nvidia Pascal, a third of DP	firejuggler	GPU Computing	12	2016-02-23 06:55
Calculating perfect numbers in Pascal	Elhueno	Homework Help	5	2008-06-12 16:37
Factorization attempt to a c163 - a new Odd Perfect Number roadblock	jchein1	Factoring	30	2005-05-30 14:43

2023-05-31, 20:57	#1146
VBCurtis "Curtis" Feb 2005 Riverside, CA 13336₈ Posts	Looks like everyone who showed interest in this team-CADO job is connected and working. Yield so far is between 4.0 and 4.05; we have collected 25M relations so far, and ETA jumped from 19 Jul yesterday to 7 July currently (so someone added a few clients). We will need at minimum 100MQ sieved to reach our target relations, likely closer to 110M Q-range. I'll post updates every 5-7 days here, but you can track general progress by simply noting the Q your client is currently sieving; we started at Q=50M, end will be Q=160M.

2023-06-04, 15:55	#1150
VBCurtis "Curtis" Feb 2005 Riverside, CA 5854₁₀ Posts	The team-sieve has gathered over 100M relations. ETA is now 23 June, thanks to swellman pointing all his machines at this job the last few days. Yield is down into the 3.9's, which shifts our end-Q to something in 165-170M range. The half of the job running on NFS@home should finish around 17 June, so I expect to be able to try filtering & matrix-building before we reach 450M local relations.