20170504, 06:49  #1 
Mar 2006
Germany
3^{2}×5^{2}×13 Posts 
Reserved for MF  Sequence 276
The intention of creating my pages at rieselprime.de 10 years ago was to collect data spreaded over the whole forum and display a condensed version of those information and to easily find all related stuff.
So for the old 15ksearch project those days to say a special kval was searched up to a given nval, without looking dozens of post or thread in here. As there're many projects working on such problems it's no managable anymore like I did a long time. I saw the possibility of a Wiki software to give users the chance to update those page by themselves. The problem is you have to know how to edit and that's in my opinion to many users reason enough not doing so. The page at MersenneWiki is an example how this could be done more userfriendly without knowing much about the Wiki interna. It would also help to collect and summarize information about users doing their own searches but haven't their own page to dislpay them. For ALQs Zimmerman, Clavier and seqs reserved by others than yoyo could put their data in there, too, so things like 276 won't be missed then. Whishful thinking I know, but the internet was started because someone had an idea to make work easier. 
20170504, 06:51  #2 
Romulan Interpreter
Jun 2011
Thailand
2·3·7·233 Posts 
Sequence 276
As we used to say, every kick in the butt is a step ahead...
This is good opportunity for Ryan to step in... 
20170504, 18:39  #3 
Oct 2006
Berlin, Germany
272_{16} Posts 
For the sequence 276, does it make sense to run ecm to 65 digits (B1=850M)?

20170504, 19:15  #4 
"Curtis"
Feb 2005
Riverside, CA
4,999 Posts 
For a C201, I would run about 25% of a T65 at 850M, and then a couple thousand curves at 3e9 (say, 0.2T65 worth). I have no justification that's merely what I would choose to acheive roughly half a T65.
I'd like to see what the Bayesian tool has to say! 
20170504, 21:04  #5  
Jun 2012
3,203 Posts 
Quote:
I'm willing to help with AS276, though yoyo would be the logical player for ECM. Can this effort fit into the 15e siever? It's a daunting task! 

20170504, 22:48  #6  
I moo ablest echo power!
May 2013
2^{3}×223 Posts 
Quote:
Code:
7900 curves with B1 = 2.9e9 

20170505, 12:49  #7 
Oct 2006
Berlin, Germany
2×313 Posts 
I will run 20000 curves with B1=850M on it.
Don't know if this is sufficient? I can run also much more, even on higher B1. 
20170505, 14:27  #8 
Jun 2012
3,203 Posts 
As a suggestion, how about a total of 40000 curves @B1=85e7 and then 8000 curves @B1=29e8? It's probably a bit of overkill but should certainly provide proper due diligence in the preprocessing stage.
Thoughts? 
20170505, 16:51  #9 
"Curtis"
Feb 2005
Riverside, CA
4,999 Posts 
In the spirit of the Bayesian tool, I like doing effort similar to what you suggest, but with more at 29e8 and less at 85e7. How about 20k at 85e7 for now, then 10k (or 15k) at 29e8?
Some forumites can do some 29e8 curves while yoyo tackles the 85e7 set; or can his network do the bigbound curves too? The CADO rootopt tools seem to take about a digit of difficulty off, compared to 201415 msieve. Scores have been 1015% better than most msieve bestpolys for each digit length above 160; if that holds at 200, that "free" digit should really help the matrix step. 
20170505, 18:22  #10 
Oct 2006
Berlin, Germany
2·313 Posts 
My Minion network can run also 29e8 on this C201.

20170505, 21:33  #11 
Jun 2012
3,203 Posts 

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Reserved for MF  Sequence 4788  schickel  Aliquot Sequences  3141  20211022 13:36 
Reserved for MF  Sequence 3366  RichD  Aliquot Sequences  524  20210906 21:00 
A new sequence  devarajkandadai  Miscellaneous Math  3  20201201 22:08 
Primes in nfibonacci sequence and nstep fibonacci sequence  sweety439  And now for something completely different  17  20170613 03:49 
80M to 64 bits ... but not really reserved  petrw1  Lone Mersenne Hunters  82  20100111 01:57 