mersenneforum.org  

Go Back   mersenneforum.org > Factoring Projects > Factoring

Reply
 
Thread Tools
Old 2021-05-06, 01:28   #947
frmky
 
frmky's Avatar
 
Jul 2003
So Cal

40648 Posts
Default

Yes, I think so. Along with computing resources to complete both the sieving and linear algebra.
frmky is online now   Reply With Quote
Old 2021-05-06, 11:34   #948
wreck
 
wreck's Avatar
 
"Bo Chen"
Oct 2005
Wuhan,China

101010002 Posts
Default

Congratulations, it's a pleasure to see that msieve could work without crash when unique relations' count larger than 2000M.
wreck is offline   Reply With Quote
Old 2021-05-06, 18:16   #949
henryzz
Just call me Henry
 
henryzz's Avatar
 
"David"
Sep 2007
Cambridge (GMT/BST)

16F416 Posts
Default

Congratulations for finally getting this problematic number done.
henryzz is offline   Reply With Quote
Old 2021-05-08, 15:28   #950
mathwiz
 
Mar 2019

2·5·17 Posts
Default

Quote:
Originally Posted by Pascal Ochem View Post
Ryan, frmky, thank you.
Now I explore the subtrees unlocked by the new factors for lower bounds on many parameters of an OPN.
Which file(s) of numbers needed will be regenerated as a result of this exploration?
mathwiz is offline   Reply With Quote
Old 2021-05-10, 20:26   #951
Pascal Ochem
 
Pascal Ochem's Avatar
 
Apr 2006

101 Posts
Default

For the factor P220 of the C301, I have factored 1+P220 by finding a P48.
And now the roadblock has completely disappeared for the bound \(10^{2200}\).
I started the full run for proving the bounds \(10^{2100}\) (to see how the weights drop)
and \(10^{2200}\) (to hopefully get a new bound).
They will finish in a few weeks and we will have the new mwrb files.
The tXXXX files are unaffected.

The other parameters where we encountered the C301 are
- The total number of prime factors \(\Omega\): I try to extend the bound from 111 factors to 115.
- \(\Omega-2\omega\): trying to go from 51 to 53 seems difficult.
In both cases, C301 was also the worst roadblock, although way less bad than for the bound \(10^{2100}\)
In both cases, there are still a few mild roadblocks in the unlocked subtrees, not worth considering.
There is no available file of composites here.

And my webpage needs an update: C301 was the example to explain how to circumvent roadblocks.
Pascal Ochem is offline   Reply With Quote
Old 2021-05-24, 21:35   #952
Pascal Ochem
 
Pascal Ochem's Avatar
 
Apr 2006

101 Posts
Default

The run with bound \(10^{2100}\) just finished and we see the impact of the C301.
The old file has 1589 composites.
http://www.lirmm.fr/~ochem/opn/old_mwrb2100.txt
The new file has 1192 composites.
http://www.lirmm.fr/~ochem/opn/mwrb2100.txt

Don't worry if you are working on a composite that has disappeared.
It will re-appear in mwrb2200 once the run with bound \(10^{2200}\) is over, because of the composite \(\sigma(11^{330})\).
Pascal Ochem is offline   Reply With Quote
Old 2021-05-24, 22:09   #953
mathwiz
 
Mar 2019

AA16 Posts
Default

Quote:
Originally Posted by Pascal Ochem View Post
The run with bound \(10^{2100}\) just finished and we see the impact of the C301.
The old file has 1589 composites.
http://www.lirmm.fr/~ochem/opn/old_mwrb2100.txt
The new file has 1192 composites.
http://www.lirmm.fr/~ochem/opn/mwrb2100.txt

Don't worry if you are working on a composite that has disappeared.
It will re-appear in mwrb2200 once the run with bound \(10^{2200}\) is over, because of the composite \(\sigma(11^{330})\).
Does this tell us anything about whether the \(10^{2200}\) run will succeed, or are the two completely independent?
mathwiz is offline   Reply With Quote
Old 2021-05-25, 05:01   #954
wblipp
 
wblipp's Avatar
 
"William"
May 2003
New Haven

17×139 Posts
Default

@Pascal

I think you posted the old mwrb file to both links. They both start with

6115909044841454629 16

--------------
@mathwiz
As described in Pascal's summary page, he circumvents roadblocks using a process similar to Kevin Hare's process. This can be applied recursively. In principle, the proof can be extended to any level. In practice, each roadblock causes a large number of additional tree terms, and the limit on the proof is how much time he is willing to commit to generating the proof. Pascal's intuition is that the factoring of the C301 reduced the roadblock complexity sufficiently to allow him to complete the 2200 proof in tolerable time. Unless it turns out he has grossly underestimated the time, he will almost certainly stick to the process long enough to complete the 2200 proof.
wblipp is offline   Reply With Quote
Old 2021-05-25, 05:21   #955
ryanp
 
ryanp's Avatar
 
Jun 2012
Boulder, CO

283 Posts
Default

Quote:
Originally Posted by wblipp View Post
@Pascal

I think you posted the old mwrb file to both links. They both start with

6115909044841454629 16
Seems fixed now at least?

Code:
$ curl -s http://www.lirmm.fr/~ochem/opn/old_mwrb2100.txt | wc -l
1589
$ curl -s http://www.lirmm.fr/~ochem/opn/mwrb2100.txt | wc -l
1192
ryanp is offline   Reply With Quote
Old 2021-05-25, 16:40   #956
ryanp
 
ryanp's Avatar
 
Jun 2012
Boulder, CO

283 Posts
Default

Quote:
Originally Posted by Pascal Ochem View Post
The run with bound \(10^{2100}\) just finished and we see the impact of the C301.
The old file has 1589 composites.
http://www.lirmm.fr/~ochem/opn/old_mwrb2100.txt
The new file has 1192 composites.
http://www.lirmm.fr/~ochem/opn/mwrb2100.txt

Don't worry if you are working on a composite that has disappeared.
It will re-appear in mwrb2200 once the run with bound \(10^{2200}\) is over, because of the composite \(\sigma(11^{330})\).
I'm doing some ECM work now. Already found one: http://factordb.com/index.php?id=1100000000012016966 (I assume if I just report to FDB, it'll be picked up by Pascal's scraper as usual)?
ryanp is offline   Reply With Quote
Old 2021-05-25, 21:12   #957
wblipp
 
wblipp's Avatar
 
"William"
May 2003
New Haven

17·139 Posts
Default

Quote:
Originally Posted by ryanp View Post
Seems fixed now at least?
I needed to clear my cache. Probably worked correctly all along if not cached.

Last fiddled with by wblipp on 2021-05-28 at 06:45 Reason: Fix Tags
wblipp is offline   Reply With Quote
Reply

Thread Tools


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

All times are UTC. The time now is 21:26.

Sat Jun 12 21:26:29 UTC 2021 up 15 days, 19:13, 0 users, load averages: 1.38, 1.58, 1.58

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.