[QUOTE=LaurV;370750]Even with the new assignment rules?

(I did not check anything, I am just honestly asking, you know, we put some hopes in these new rules...)[/QUOTE]Here is one to start you off: 31455961

And there are hundreds more just like it. Are you prepared to "poach" all of those to meet the 2014-07-04 deadline?

I personally have no remorse to poach few of those :razz:
Fortunately for the assignees, I have plenty of other things to do... Chris is torturing me with those ranges of his, to factor... So don't count on me this time. I was only the curious monkey.

Disclaimer: this is more of a (serious) joke, and not an invitation to poaching! I don't approve indiscriminate poaching.

[QUOTE=lycorn;370296]Just got done. No more exponents trial factored to less than 61 bits.
Good job, petrw1, the "tail" in the table got shorter.
Tackling 61 bits will be way harder a job, though...[/QUOTE]

With exponents this small would the P-1 trick in [url]http://mersenneforum.org/showthread.php?t=14265&page=8[/url] post 83 be a quicker way to prove there are no factors smaller than your desired bound? Or arbooker's Pollard-Strassen app. mentioned in the same thread?

Chris

[QUOTE=LaurV;370758]Fortunately for the assignees, I have plenty of other things to do... Chris is torturing me with those ranges of his, to factor... So don't count on me this time.[/QUOTE]

Hey, you've been very well paid in kind! :razz: :wink: :smile:

[QUOTE=chris2be8;370791]With exponents this small would the P-1 trick in [URL]http://mersenneforum.org/showthread.php?t=14265&page=8[/URL] post 83 be a quicker way to prove there are no factors smaller than your desired bound? Or arbooker's Pollard-Strassen app. mentioned in the same thread?

Chris[/QUOTE]
B2 is limited to around 1e17 which limits us somewhat. There might be ways around this.

You can get round the limit on B2 by running just stage 1 and saving the result, then resuming several times with a range of B2 values. This can be used to spread stage 2 over several machines (or several cores on one machine if you have enough RAM). See the ecm man page for details.

The ultimate limit is that B1 can't be more than 9007199254740996 so B2 can't be more that that squared. But I don't think anyone will reach that limit in this century.

Chris

Can you get a higher value of P? Do you need to?

our first 10M range under 200,000 remaining
 

Thanks in a big part to GPU72 advancing the bit levels the 60-69M range now has less than 200,000 unfactored exps.

Shortening the tail...
 

May 1, 2014. All exponents below 51 million have been tested at least once.

[QUOTE=NBtarheel_33;372438]May 1, 2014. All exponents below 51 million have been tested at least once.[/QUOTE]
I noticed that this morning. The attached graph, that looks like a city skyline,
shows the gap between the tail end of OneLL and TwoLL.
It is (OneLL - TwoLL) / OneLL expressed as a %age.

I don't like that graph. I'd say we should zoom in a lot more but I'm guessing the resolution doesn't exist.

In the 90's the overall gap would have been massive on account of there being so few exponents to begin with. The surge in 2007 is interesting, though.