343*2^731147-1 is prime (220100 digits)

[quote=MyDogBuster;149806]343*2^731147-1 is prime (220100 digits)[/quote]


Nice. Congrats! :smile:

[FONT=Verdana]user=mdettweiler
[2008-11-18 19:15:52]
981*2^570197-1 is prime! Time : 2554.0 sec.

From LLRnet G4000--exactly the confirmation I needed to test that the prime-tracking system in my new scripts are working correctly! :grin:
[/FONT]

825*2^552348-1 is prime

877*2^552961-1 is prime

571*2^570443-1 is prime

[B]519 *2^555760-1 Is a prime[/B]

[B]Lennart[/B]

587*2^550576-1 is prime

931*2^568391-1 is prime

865*2^555071-1 is prime EDITED: My bad it was the line # I wrote down for the k

703*2^569043-1 is prime C443

563*2^550396-1 is prime

601*2^550691-1 is prime

741*2^557981-1 is prime

[quote=IronBits;150481]741*2^557981-1 is prime[/quote]

Don't forget to submit it.

gd_barnes, if 741*2^557981-1 needs to be submitted, have at it. :smile:

[quote=IronBits;150510]gd_barnes, if 741*2^557981-1 needs to be submitted, have at it. :smile:[/quote]


Done.

BTW, I forgot to mention...Ian has been on one of the most impressive runs of primes that we've had at NPLB for a very long time...6 top-5000 primes in < 3 days! I'm jelous. lol

He is also sieving k=1005-2000. In just a few days, he sieved it from P=160G to 240G and said he'll take it to P=1T by year end. After the 1st drive is done, we'll open a team effort to LLR the range from n=50K-500K after we discuss how the best way to break it up would be. To test it in the top-5000 range (likely n>350K by then), we'll probably need to sieve it further then P=1T though.

Thanks for the great contribution Ian! :smile:


Gary

975*2^558469-1 is prime

939*2^558605-1 is prime

Way to go Ian !!! :smile:

861*2^558945-1 is confirmed prime

999*2^571360-1 is prime

459*2^571508-1 is prime

615*2^571623-1 is prime k15(21)

615*2^571871-1 is prime k15(21) another one

861*2^560221-1 is a confirmed prime

439*2^572313-1 is prime

879*2^555471-1 is prime

753*2^561335-1 is prime

861*2^572559-1 is a confirmed prime

855*2^572656-1 is prime k15(29)

821*2^561774-1 is prime! Time : 921.0 sec.

[quote=IronBits;151289]821*2^561774-1 is prime! Time : 921.0 sec.[/quote]

Please submit it.

[quote=em99010pepe;151290]Please submit it.[/quote]
Quoted from earlier in this thread:
[quote=IronBits;150510]gd_barnes, if 741*2^557981-1 needs to be submitted, have at it. :smile:[/quote]
Presumably, this still holds true for additional primes. :smile:

Sure, you or Gary, no matter. First one to see it can have at it :wink:

[quote=IronBits;151303]Sure, you or Gary, no matter. First one to see it can have at it :wink:[/quote]
:grin: :wink:

I saw it first! lol

[quote=Flatlander;151307]I saw it first! lol[/quote]
LOL--you know, that just gave me an idea. Since David doesn't want his primes, maybe we could raffle them off, say, as prizes for whoever produces the most results during our next rally? No, wait...usually that's either Gary or Lennart, both of which usually get plenty of primes anyway. :missingteeth:

[quote=mdettweiler;151311]LOL--you know, that just gave me an idea. Since David doesn't want his primes, maybe we could raffle them off, say, as prizes for whoever produces the most results during our next rally? No, wait...usually that's either Gary or Lennart, both of which usually get plenty of primes anyway. :missingteeth:[/quote]
Maybe we could raffle them off, with 'tickets' being awarded based on results, BUT instead of being a linear thing (1000 results gets 1000 'tickets', 10 gets 10, etc.), have it be some sort of logarithmic thing to encourage smaller hitters with a chance while rewarding heavy hitters a little more appropriately (maybe something like 10*log[sub]10[/sub](number of results) ?).

It's not that I don't want them... I think Beyond entered many for me on my behalf.
I just couldn't figure my way around that web interface to accomplish the task of adding them.

[quote=IronBits;151322]It's not that I don't want them... I think Beyond entered many for me on my behalf.
I just couldn't figure my way around that web interface to accomplish the task of adding them.[/quote]
If you'd like, Gary and I can enter them on your behalf for you.

[QUOTE=IronBits;151322]It's not that I don't want them... I think Beyond entered many for me on my behalf.
I just couldn't figure my way around that web interface to accomplish the task of adding them.[/QUOTE]

I still can, just send me the info.

[quote=IronBits;151322]It's not that I don't want them... I think Beyond entered many for me on my behalf.
I just couldn't figure my way around that web interface to accomplish the task of adding them.[/quote]
it isnt simple is it:smile:

[quote=IronBits;151322]It's not that I don't want them... I think Beyond entered many for me on my behalf.
I just couldn't figure my way around that web interface to accomplish the task of adding them.[/quote]


If you want them, did you know we have very specific detailed instructions for creating new prover codes at the beginning of this thread? I can almost guarantee if you follow them word for word, you'll get it. I intended the instructions for total newbs to prime searching. If you can do that complicated server stuff, you can certainly do it! (lol)

Take a shot at it if you want. If you can get it figured out, I'll be glad to transfer the one that I entered for you over to you. Don't worry if you somehow 'mess up'. Any prover code goof can always be easily corrected by Prof. Caldwell. He's quite prompt at correcting them if requested to do so.

If you don't want to mess with it, here's an interesting idea instead of a raffle: Whoever sees any future prime for you first gets to enter it as his own! It's as simple as that. What do people think of that? I'm at a disadvantage for the next 9 days while I'm out of town since I'm only on about 2X/day but that's not a big deal. You already gave me one.

Edit: By first to see it, I'm referring to ANYONE currently doing searches for NPLB; not just the mods. It will make for an interesting scramble when you pop out another one. lol


Gary

507*2^562132-1 is prime

Actually, the first post is a wee bit confusing for the absolute newbie (not saying that to Ironbits, just in general). Here's a draft that I think is easier: (feel free to make changes to this draft or ignore it or use it how it is :smile:; the biggest difference is giving direct links instead of saying where the link is)

Instructions for submitting a top-5000 prime:

Step 1: For people who have not submitted top-5000 primes previously, create a prover account:
1. Go to [URL]http://primes.utm.edu/bios/newprover.php[/URL].
2. Fill out the form and submit it. You will be assigned a prover account.

Step 2: Create a proof code:
1. Go to [URL]http://primes.utm.edu/bios/index.php[/URL].
2. Next to 'search prover-accounts', type your last name and press enter.
3. Click on your prover account (there may be one or several) and press enter.
4. Towards the bottom, click on 'Create a New Proof-Code' and press enter.
5. If necessary in the little pop-up box, type in your user name (prover account) and password and press enter.
6. You should now have a list of proof programs. Select "Jean Penné's LLR".
7. In the space below all the programs, type in "Srsieve, PrimeSearch" ('Srsieve' for the sieving software and 'PrimeSearch' for the project). (Obviously if you did an individual-k search on your own, then the software may vary.)
8. You should now have a new proof code and can submit the prime. Example...L442.

Step 3: Submit the prime:
1. Go to [URL]http://primes.utm.edu/bios/index.php[/URL].
2. Next to 'search prover-accounts', type your last name and press enter.
3. Towards the bottom, next to 'Submit primes using the proof-code', click on your proof code and press enter.
4. If necessary in the little pop-up box, type in your user name (prover account) and password and press enter.
5. You should see a big free-form box. Type in your prime (no spaces needed) and click 'Press here to submit these prime(s)'.
OR
1-3. Go to (optionally bookmark) this URL with L000 replaced with your proof code and yourusername replaced with your user name:
[URL]http://primes.utm.edu/primes/submit.php?code_str=L000&username=yourusername[/URL]
4. If necessary in the little pop-up box, type in your user name (prover account) and password and press enter.
5. You should see a big free-form box. Type in your prime (no spaces needed) and click 'Press here to submit these prime(s)'.
OR
1. Go to [URL]http://primes.utm.edu/primes/submit.php[/URL].
2. In the first box, enter your user name
3. In the second box, enter your proof code.
4. You should see a big free-form box. Type in your prime (no spaces needed) and click 'Press here to submit these prime(s)'.
5. If necessary in the little pop-up box, type in your user name (prover account) and password and press enter.

6. A verification screen will come up. If the prime is correct, click 'Press here to complete submission'.


(Step 3 is really long...maybe remove the last method or something? If the last method is removed, the 4 and 5 could be grouped with the 6 instead of in separate sections.)

Here's what it currently is:
[quote=gd_barnes;123340]Instructions for submitting a top-5000 prime:

Go to [URL]http://primes.utm.edu/primes/home.php[/URL].

Step 1: For people who have not submitted top-5000 primes previously, create a prover account:
1. Select 'Submit' on the lower left side under 'Join in'.
2. Select the 'click here to create a prover-account' link in the middle of the page.
3. Fill out the form and submit it. You will be assigned a prover account.

Step 2: Create a proof code:
1. Go to the home page in the link above and select 'Index' on the left side under 'Provers'.
2. Next to 'search prover-accounts', type yours and press enter.
3. Click on your prover account (there may be one or several) and press enter.
4. Towards the bottom, click on 'Create a New Proof-Code' and press enter.
5. If necessary in the little pop-up box, type in your user name (prover account) and password and press enter.
6. You should now have a list of proof programs. Select LLR.
7. In the space below all the programs, type in 'PrimeSearch' for the project and 'Srsieve' for the sieving software. Separate each selection by a comma. (Obviously if you did an individual-k search on your own, then the software may vary.)
8. You should now have a new proof code and can submit the prime. Example...L442.

Step 3: Submit the prime:
1. Go to the home page in the link above and select 'Index' on the left side under 'Provers'.
2. Next to 'search proof-code', type your new code from step 2 and press enter.
3. Towards the bottom, next to 'Submit primes using this code as', click on your name (prover account) and press enter.
4. If necessary in the little pop-up box, type in your user name (prover account) and password and press enter.
5. You should see a big free-form box. Type in your prime (no spaces needed) and click 'Press here to submit these prime(s)'.
6. A verification screen will come up. If the prime is correct, click 'Press here to complete submission'.[/quote]

How about a form box?

Login ...

Please enter information below to submit prime.

UserName: IronBits
Select Type: LLR
Input Prime: some long string

<Click to submit> Click

Excellent Mini-Geek! I don't have time to review it in detail but having the direct links helps the "true" newb. :smile:

Max, when you get a chance, can you do a quickie review of Mini-Geek's instruction suggestion here? If all looks good, you can edit the 1st post of this thread with his changes.

It's nice to have helpful people around here! :smile:


Gary

Mini-Geek!!! :w00t:
Awesome instructions. :grin:

Following your instructions, I was able to submit prime 821*2^561774-1
whoops! Max already had it listed.
Do I just post confirmed in this thread now??
Someone check my home work please.

[quote=IronBits;151390]Mini-Geek!!! :w00t:
Awesome instructions. :grin:[/quote]
Thanks. :blush:
[quote=IronBits;151390]Following your instructions, I was able to submit prime 821*2^561774-1
whoops! Max already had it listed.
Do I just post confirmed in this thread now??
Someone check my home work please.[/quote]
I don't think that's how posting confirmed works...after primes are submitted to, and before they are put on, the top 5000, they are double checked automatically. I'm pretty sure that codes and/or accounts are automatically deleted after a day or two with no prime, so you'll probably have to make that again next time you find a prime (in no other circumstances will you need to remake things like that with the same info).
Edit: It looks like you already had an [URL="http://primes.utm.edu/bios/page.php?id=1399"]account[/URL] and had submitted primes, which means that it won't be deleted after a day or two. Were you not the one to actually do the entering before or something?

Yes, I have an account, Beyond used to enter them for me.
(and still will if I ask him to, thanks James! )
I think he set up that account for me, or I figured out how to do it once a long time ago.

[quote=IronBits;151390]Mini-Geek!!! :w00t:
Awesome instructions. :grin:

Following your instructions, I was able to submit prime 821*2^561774-1
whoops! Max already had it listed.
Do I just post confirmed in this thread now??
Someone check my home work please.[/quote]
Ah, sorry about that--yeah, I had already submitted it under my name, so thus it put me down as the "discoverer" and thus complained of an already-listed prime when you tried to submit it. If you'd like, I can email Prof. Caldwell (the guy who runs the Prime Pages) and ask him to change it to your prover code.

That's alright, you can keep it. :smile:

David,

What is your prover code?

Max,

If we can get the correct prover code here, I'm going to suggest that both you and I transfer the primes that we entered over to David's prover code.


Gary

Please, try to put found primes in Top5000 for the guy who found it really!

Changing the prover-code/finder will messing up all stats -> FreeDC too!!! not only mine.

there'is more work to do!

[quote=kar_bon;151450]Please, try to put found primes in Top5000 for the guy who found it really!

Changing the prover-code/finder will messing up all stats -> FreeDC too!!! not only mine.

there'is more work to do![/quote]


Karsten,

Max and I are reflecting IronBits as having found the top-5000 primes in the first post of this thread. That is how it should be and is how we've also done it in the past for other searchers who have let Carlos report some top-5000 primes. In other words: Post 1 of the drive threads show who found the prime. The top-5000 site may show someone else on a very few selected primes.

Is post 1 of this thread what you are referring to?


Gary

999*2^576128-1 is prime

825*2^563255-1 is prime

[quote=gd_barnes;151446]David,

What is your prover code?

Max,

If we can get the correct prover code here, I'm going to suggest that both you and I transfer the primes that we entered over to David's prover code.


Gary[/quote]


David,

You already have a prover code set up and you've already entered several primes for us! You just needed to report these 2 primes that Max and I entered under our codes as yours. The code is L566. We'll have to get them transferred over t you.

Max,

I'm going to send a note to Prof. Caldwell to transfer the prime that I entered for David over to his proof code of L566. Can you do the same for the prime that you entered for him?

David,

Since you already have a proof code set up for our project, do you have any more questions about how to submit a prime using it?


Gary

[quote=gd_barnes;151544]Max,

I'm going to send a note to Prof. Caldwell to transfer the prime that I entered for David over to his proof code of L566. Can you do the same for the prime that you entered for him?[/quote]
Okay, I'll do that shortly. :smile:

None right now, and you guys could have just kept them because I gave them to you...
Thanks

735*2^575880-1 confirmed

749*2^573524-1 is prime

[quote=em99010pepe;151578]735*2^575880-1 confirmed[/quote]
Hmm...this one wasn't on the list of known primes in the 1st Drive thread. Gary, you must have missed this one. (And I know it wasn't a new prime that was recently found by someone else--I checked the top-5000, and it was found back in 2006.) No big deal, though--I've marked it down as a confirmed prime, as usual. :smile:

[quote=IronBits;151558]None right now, and you guys could have just kept them because I gave them to you...
Thanks[/quote]


Sorry. You're forced to keep your primes for yourself. lmao

Prof. Caldwell has now officially transferred both of them.

IMHO you gave them to us because you weren't familiar with the process. It wouldn't have been right for us to keep them since you already had a prover code set up.

Max, thanks for taking care of your end on this.

Edit: And thanks Mini-Geek for a great set of instructions for future new prime searchers! :-)


Gary

Well, if that's all I have to do is submit them, then ya, thanks to Mini-Geek's instructions, I was able to get right into it.
I have bookmarked it for future primes! :grin:

[quote=mdettweiler;151585]Hmm...this one wasn't on the list of known primes in the 1st Drive thread. Gary, you must have missed this one. (And I know it wasn't a new prime that was recently found by someone else--I checked the top-5000, and it was found back in 2006.) No big deal, though--I've marked it down as a confirmed prime, as usual. :smile:[/quote]


Dang. I'm supposed to be perfect. Don't tell anyone about this. :missingteeth:

623*2^563618-1 is prime

791*2^576238-1 is prime

885*2^564282-1 is prime
895*2^564319-1 is prime

:smile:

595*2^547465-1 is prime!

397*2^926925-1 is prime 279035 digits

[quote=MyDogBuster;152028]397*2^926925-1 is prime 279035 digits[/quote]


WEE!! Congrats on a nice fat juicy prime!

user=sm5ymt
[2008-12-05 16:00]
735*2^577763-1 is prime!

confirmed one

user=Jokern3000
[2008-12-07 01:13]
677*2^598310-1 is prime!

387*2^633582-1 is prime

841*2^585467-1 is prime

user=gd_barnes
[2008-12-09 11:07:53]
447*2^585292-1 is prime! Time : 514.0 sec.

[quote=IronBits;152669]user=gd_barnes
[2008-12-09 11:07:53]
447*2^585292-1 is prime! Time : 514.0 sec.[/quote]
Eh? Did Gary report this already? Or is this a confirmed prime that is not listed on the 1st Drive page for whatever reason?

Edit: I just checked and it's not in the top-5000. :huh:

eh? I just saw it on the nplb.ironbits.net so posted it.
Not supposed to do that or what?

[quote=IronBits;152683]eh? I just saw it on the nplb.ironbits.net so posted it.
Not supposed to do that or what?[/quote]
Actually, it's usually the responsibility of the user whose computer reported the prime to post it *after* they've submitted it to the top-5000, so that when we add it to the respective team-drive thread we're absolutely sure that the user was aware of the prime and has reported it to the top-5000. That way primes don't "slip through the cracks" so to speak.

Gary, what's your take on this?

No, if it is a new top-5000 prime, it should not be posted here until it is submitted on the top-5000 site by the person who found it. If you're worried that the person might have missed it, go ahead and PM them with it.

The funny thing is that I just now saw the prime, submitted it, and THEN saw it posted here. That is usually the order that I do things followed by adding it in the 1st post of this thread. I didn't have time to get on the internet late this morning before I left for home from my business trip, hence was a little late submitting it.

The reason we send PM's to searchers about new top-5000 primes is so that they don't get "stolen" by any nefarious individuals.

If it is an already known prime (i.e. confirmed), then it can be posted in this thread by anyone at any time. For those, it just doesn't matter.


Gary

Delete my post and subsequent posts.
I won't post about found primes in the forum again.
I'll leave that up to folks to handle.

[quote=IronBits;152699]Delete my post and subsequent posts.
I won't post about found primes in the forum again.
I'll leave that up to folks to handle.[/quote]


It's no big deal. Leaving the posts here shows other new prime searchers what the typical submission method is. I, for one, appreciate your enthusiasm! :smile:

BTW, be sure and always post your own primes here after submitting them at the top-5000 site. Otherwise, we might miss listing it on post 1 of this thread for quite a while.


Gary

BlisteringSheep has a new prime on port 400! I sent him a PM.

[QUOTE=gd_barnes;152715]BlisteringSheep has a new prime on port 400! I sent him a PM.[/QUOTE]

741*2^585865-1 is prime! Time : 536.851 sec.
176366 digits

user=Kman1293
[2008-12-08 05:19]
843*2^598482-1 is prime!

895*2^578637-1 is prime

user=IronBits
[2008-12-11 21:53:47]
927*2^588621-1 is prime! Time : 348.0 sec.

675*2^578746-1 is a confirmed prime

I've had 8+ quads on port 400 and haven't found a prime in nearly 3 days; almost 15,000 pairs. I move 1 quad to port 4000 and find a prime within 3 hours:

843*2^578747-1 is prime


Go figure.

I couldn't let Ian keep taking ALL of the primes in an obviously good n-range. lol

Actually, I think there's just something wrong with David's server. When a prime is found, I think it changes some of them to composite when it feels like it. :smile:


Gary

[QUOTE]
I couldn't let Ian keep taking ALL of the primes in an obviously good n-range. lol[/QUOTE]

Did ya notice how far apart my confirmed prime was from your prime in terms of n. One of us could have easily gotton BOTH.

[quote=MyDogBuster;153037]Did ya notice how far apart my confirmed prime was from your prime in terms of n. One of us could have easily gotton BOTH.[/quote]


Holy cow. No, I hadn't noticed because when I pasted them in the 1st post of this thread, they went in different sections due to one being confirmed.

That is clearly the record for primes being the closest together for NPLB, even going all the way back to n=260K. It's a little unfortunate that yours had already been found. It would have been something finding 2 new primes within 2 n's!

I think Karsten or Mini had done an analysis on primes the closest together for us previously. Do either of you guys happen to remember what you came up with for that?


Gary

[QUOTE=gd_barnes;153039]
I think Karsten or Mini had done an analysis on primes the closest together for us previously. Do either of you guys happen to remember what you came up with for that?
[/QUOTE]

no, not such close in this high n-level.

i'll check this by pulling all primes out of the data i got so far (by script) sorted by n.
hope i can do this the weekend (need this too for the next Team Drives, to see which primes are known/listed so far).

[quote=gd_barnes;153039]I think Karsten or Mini had done an analysis on primes the closest together for us previously. Do either of you guys happen to remember what you came up with for that?[/quote]
It was me. It was after I found this lovely pair: :grin:
[code]591*2^530223-1 Mini-Geek
565*2^530221-1 Mini-Geek[/code]I don't recall precisely what I found, but I remember pulling data from primes beside NPLB. Looking back at the files from that, it looks like at much lower n values there were pairs in the same n (261255 and 217588, if I'm reading my old file correctly). I haven't done new analysis, but I'd assume Karsten's post above mine is correct for all Drive 1 primes.

user=Jokern3000
[2008-12-12 08:35]
861*2^599041-1 is prime! Time : 2744.0 sec.

confirmed

user=IronBits
[2008-12-12 21:14:59]
813*2^589384-1 is prime! Time : 489.0 sec.