mersenneforum.org  

Go Back   mersenneforum.org > Other Stuff > Open Projects

Reply
 
Thread Tools
Old 2013-07-31, 12:04   #551
robert44444uk
 
robert44444uk's Avatar
 
Jun 2003
Oxford, UK

2·1,009 Posts
Default

Quote:
Originally Posted by Thomas11 View Post
Sorry, it was limited to E<268.

Please try the attached version. It should work up to E=466 (if ever needed).
I'm still only getting 10000 results for E268 and E292.

Can you remind me what the program does, in terms of how many factors it tries to remove?
robert44444uk is offline   Reply With Quote
Old 2013-07-31, 12:55   #552
robert44444uk
 
robert44444uk's Avatar
 
Jun 2003
Oxford, UK

2·1,009 Posts
Default 203!!!

Getting there slowly. Now up to 229074:

190 229069
191? 255530
192? 294807
193? 318934
194? 334623
195? 334645
196? 363020
197? 376732
198? 403709
199? 414907
200? 449150
201? 472040
202? 479697
203? 496187
robert44444uk is offline   Reply With Quote
Old 2013-07-31, 21:46   #553
Thomas11
 
Thomas11's Avatar
 
Feb 2003

5×383 Posts
Default

Quote:
Originally Posted by robert44444uk View Post
I'm still only getting 10000 results for E268 and E292.

Can you remind me what the program does, in terms of how many factors it tries to remove?
Oh, now I see. This is "by design"!
The default Nash sieve uses an exponent limit of 256.
If the E level is larger than this limit, no eliminations will be found up to this limit.

So, for the larger E levels one would need a modified Nash weight by using a higher exponent limit. But then the weights are no longer comparable...

Regarding the algorithm: Please have a look into the source code (see the attached file) - it's relatively simple. It follows the code used in Jack Brennen's Proth weight Java applet.

BTW.: There is a different kind of weight (also called "Nash weight") computed within Robert Gerbicz's Payam program.
Here are a few examples from the Sierpinski side:

Code:
S 989877837408365 316 10.860427
S 42356974817175081 292 10.825832
S 215381047310089587 292 10.823601
S 229441208260289053 268 10.795702
S 140164672130719673 226 10.781194
S 317035114487308151 210 10.701962
S 371766949523237405 210 10.568048
Attached Files
File Type: zip nash_payam_src.zip (1.1 KB, 179 views)

Last fiddled with by Thomas11 on 2013-07-31 at 21:47
Thomas11 is offline   Reply With Quote
Old 2013-07-31, 22:19   #554
Thomas11
 
Thomas11's Avatar
 
Feb 2003

5·383 Posts
Default 204!

And still another prime before n=500,000:

204? 498496

The range n=250,001-500,000 is now fully tested. No other primes to be expected...
Thomas11 is offline   Reply With Quote
Old 2013-08-06, 09:07   #555
robert44444uk
 
robert44444uk's Avatar
 
Jun 2003
Oxford, UK

2×1,009 Posts
Default 205

I am almost at the end of the range 200000 to 250000. There is another to report:

191? 245288
192? 255530
193? 294807
194? 318934
195? 334623
196? 334645
197? 363020
198? 376732
199? 403709
200? 414907
201? 449150
202? 472040
203? 479697
204? 496187
205? 498496

Testing gaps at the time of writing are 237464-238500; 239927-240000 and 245311-250000. I should be through my Thursday.
robert44444uk is offline   Reply With Quote
Old 2013-08-08, 17:36   #556
robert44444uk
 
robert44444uk's Avatar
 
Jun 2003
Oxford, UK

2·1,009 Posts
Default

There were no more primes up to 250K so the question marks can be taken off:

191 245288
192 255530
193 294807
194 318934
195 334623
196 334645
197 363020
198 376732
199 403709
200 414907
201 449150
202 472040
203 479697
204 496187
205 498496
robert44444uk is offline   Reply With Quote
Old 2014-01-24, 17:12   #557
f1pokerspeed
 
Jun 2012

2·53 Posts
Default

Just a bit of blue-sky thinking, but I wonder if this search could be BOINCified? It would be interesting to see how powerful this search could become if such a thing were to come to fruition.

I guess a framework for the server would be something like...
  1. Finding Payam k-values at various E levels
  2. Low-level primality test ranges
  3. High-level primality test singles

How much effort would be required to set such a system up?
f1pokerspeed is offline   Reply With Quote
Old 2014-01-29, 12:51   #558
robert44444uk
 
robert44444uk's Avatar
 
Jun 2003
Oxford, UK

2×1,009 Posts
Default

Quote:
Originally Posted by f1pokerspeed View Post
Just a bit of blue-sky thinking, but I wonder if this search could be BOINCified? It would be interesting to see how powerful this search could become if such a thing were to come to fruition.

I guess a framework for the server would be something like...
  1. Finding Payam k-values at various E levels
  2. Low-level primality test ranges
  3. High-level primality test singles

How much effort would be required to set such a system up?
I would have liked to have seen this done, but I think there is limited interest because it is really hard to get top 5000 primes. The prime testing takes three times longer than for small k.

RPS volunteers are taking the one recent candidate up, but we are falling behind! We cant process the n fast enough to keep up with the 5000th prime cut.

But in principle there is no technical reason that the three exercises you mention could not be successfully done on a distributed basis. I for one don't know how to do this.
robert44444uk is offline   Reply With Quote
Old 2014-01-29, 17:51   #559
f1pokerspeed
 
Jun 2012

11010102 Posts
Default

I think that 1) wouldn't be that difficult. When the project is set up, people that connect will download Payam2, the in.txt, progress.txt and results.txt file.

The files are customized to cover, say, 1 hour's work per core (so however many iterations, more for larger E values), then when the WU is done the results.txt file is sent back and the Ks found get put in to a database.

2) is slightly more tricky, just downloading PFGW and a sieve file (may require a Perl script to split the files or something?) Maybe this is best left to manual testing. 3), on the other hand, is perfect - it's basically equivalent to PrimeGrid, just on a smaller scale.

I think that 2) and 3) would be made even simpler by perhaps creating a PRPnet server or something, which would save a lot of backend issues and time. 1) is still feasible on BOINC, it is just a case of building the apps and setting up a server - non-trivial but could be easier depending on how it would work out here.

I may start work on at least BOINCifying Payam2 (if possible) and maybe thinking about a VM for the server.

http://www.spy-hill.com/~myers/help/...e_Project.html

Last fiddled with by f1pokerspeed on 2014-01-29 at 17:54
f1pokerspeed is offline   Reply With Quote
Old 2014-01-30, 17:26   #560
robert44444uk
 
robert44444uk's Avatar
 
Jun 2003
Oxford, UK

2·1,009 Posts
Default

Quote:
Originally Posted by f1pokerspeed View Post
I think that 1) wouldn't be that difficult. When the project is set up, people that connect will download Payam2, the in.txt, progress.txt and results.txt file.

The files are customized to cover, say, 1 hour's work per core (so however many iterations, more for larger E values), then when the WU is done the results.txt file is sent back and the Ks found get put in to a database.

2) is slightly more tricky, just downloading PFGW and a sieve file (may require a Perl script to split the files or something?) Maybe this is best left to manual testing. 3), on the other hand, is perfect - it's basically equivalent to PrimeGrid, just on a smaller scale.

I think that 2) and 3) would be made even simpler by perhaps creating a PRPnet server or something, which would save a lot of backend issues and time. 1) is still feasible on BOINC, it is just a case of building the apps and setting up a server - non-trivial but could be easier depending on how it would work out here.

I may start work on at least BOINCifying Payam2 (if possible) and maybe thinking about a VM for the server.

http://www.spy-hill.com/~myers/help/...e_Project.html
2) and 3) is where the resources would be most wanted and as you say, would require the minimum adjustment to BOINC - the format would be familiar for most participants. There are 20,000 or so VPS discovered, and the majority of them need to be taken from n=10000.
robert44444uk is offline   Reply With Quote
Old 2014-01-30, 20:57   #561
f1pokerspeed
 
Jun 2012

6A16 Posts
Default

Ugh... this is going to be so much more difficult than I imagined...

1) I need a static IP - I can do that but it'll be a little difficult to manage
2) PRPNet server binaries don't really sem to exist...
3) BOINC projects are annoying to start with w.r.t setting up on Ubuntu - maybe I can test on a VM.

I'd say maybe a day at the least to get the static IP and the VM set up. Do you think Ubuntu/variants or Debian would be better for me to use? I believe the best way to do it might just be to get the VM running on my home server and then push it to Amazon EC2, but I don't have the funds for that.
f1pokerspeed is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Semiprime and n-almost prime candidate for the k's with algebra for the Sierpinski/Riesel problem sweety439 sweety439 11 2020-09-23 01:42
Dual Sierpinski/Riesel prime sweety439 Conjectures 'R Us 0 2016-12-07 15:01
Sierpinski/ Riesel bases 6 to 18 robert44444uk Conjectures 'R Us 139 2007-12-17 05:17
Sierpinski/Riesel Base 10 rogue Conjectures 'R Us 11 2007-12-17 05:08
Sierpinski / Riesel - Base 22 michaf Conjectures 'R Us 49 2007-12-17 05:03

All times are UTC. The time now is 22:19.


Fri Jan 28 22:19:00 UTC 2022 up 189 days, 16:47, 1 user, load averages: 1.22, 1.51, 1.86

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2022, 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.

≠ ± ∓ ÷ × · − √ ‰ ⊗ ⊕ ⊖ ⊘ ⊙ ≤ ≥ ≦ ≧ ≨ ≩ ≺ ≻ ≼ ≽ ⊏ ⊐ ⊑ ⊒ ² ³ °
∠ ∟ ° ≅ ~ ‖ ⟂ ⫛
≡ ≜ ≈ ∝ ∞ ≪ ≫ ⌊⌋ ⌈⌉ ∘ ∏ ∐ ∑ ∧ ∨ ∩ ∪ ⨀ ⊕ ⊗ 𝖕 𝖖 𝖗 ⊲ ⊳
∅ ∖ ∁ ↦ ↣ ∩ ∪ ⊆ ⊂ ⊄ ⊊ ⊇ ⊃ ⊅ ⊋ ⊖ ∈ ∉ ∋ ∌ ℕ ℤ ℚ ℝ ℂ ℵ ℶ ℷ ℸ 𝓟
¬ ∨ ∧ ⊕ → ← ⇒ ⇐ ⇔ ∀ ∃ ∄ ∴ ∵ ⊤ ⊥ ⊢ ⊨ ⫤ ⊣ … ⋯ ⋮ ⋰ ⋱
∫ ∬ ∭ ∮ ∯ ∰ ∇ ∆ δ ∂ ℱ ℒ ℓ
𝛢𝛼 𝛣𝛽 𝛤𝛾 𝛥𝛿 𝛦𝜀𝜖 𝛧𝜁 𝛨𝜂 𝛩𝜃𝜗 𝛪𝜄 𝛫𝜅 𝛬𝜆 𝛭𝜇 𝛮𝜈 𝛯𝜉 𝛰𝜊 𝛱𝜋 𝛲𝜌 𝛴𝜎 𝛵𝜏 𝛶𝜐 𝛷𝜙𝜑 𝛸𝜒 𝛹𝜓 𝛺𝜔