20210506, 01:28  #947 
Jul 2003
So Cal
4064_{8} Posts 
Yes, I think so. Along with computing resources to complete both the sieving and linear algebra.

20210506, 11:34  #948 
"Bo Chen"
Oct 2005
Wuhan,China
10101000_{2} Posts 
Congratulations, it's a pleasure to see that msieve could work without crash when unique relations' count larger than 2000M.

20210506, 18:16  #949 
Just call me Henry
"David"
Sep 2007
Cambridge (GMT/BST)
16F4_{16} Posts 
Congratulations for finally getting this problematic number done.

20210508, 15:28  #950 
Mar 2019
2·5·17 Posts 

20210510, 20:26  #951 
Apr 2006
101 Posts 
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.  \(\Omega2\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. 
20210524, 21:35  #952 
Apr 2006
101 Posts 
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 reappear in mwrb2200 once the run with bound \(10^{2200}\) is over, because of the composite \(\sigma(11^{330})\). 
20210524, 22:09  #953  
Mar 2019
AA_{16} Posts 
Quote:


20210525, 05:01  #954 
"William"
May 2003
New Haven
17×139 Posts 
@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. 
20210525, 05:21  #955  
Jun 2012
Boulder, CO
283 Posts 
Quote:
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 

20210525, 16:40  #956  
Jun 2012
Boulder, CO
283 Posts 
Quote:


20210525, 21:12  #957 
"William"
May 2003
New Haven
17·139 Posts 
I needed to clear my cache. Probably worked correctly all along if not cached.
Last fiddled with by wblipp on 20210528 at 06:45 Reason: Fix Tags 
Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Passive Pascal  Xyzzy  GPU Computing  1  20170517 20:22 
Tesla P100 — 5.4 DP TeraFLOPS — Pascal  Mark Rose  GPU Computing  52  20160702 12:11 
Nvidia Pascal, a third of DP  firejuggler  GPU Computing  12  20160223 06:55 
Calculating perfect numbers in Pascal  Elhueno  Homework Help  5  20080612 16:37 
Factorization attempt to a c163  a new Odd Perfect Number roadblock  jchein1  Factoring  30  20050530 14:43 