mersenneforum.org  

Go Back   mersenneforum.org > Prime Search Projects > Twin Prime Search

Reply
 
Thread Tools
Old 2006-12-28, 12:42   #12
biwema
 
biwema's Avatar
 
Mar 2004

17D16 Posts
Default

Quote:
Originally Posted by MooooMoo View Post
edit: There needs to be some kind of system (maybe a factor verification script?) to deter cheaters. This is quite important, since part of the credit for finding the twin will go to the top siever. Suggestions on preventing/deterring cheating are welcome.
Yes, that is a good point.
If we synchronize the sieving effort by exchanging the factors removed (that is already supported by NewPGen), they can quickly be checked when merging.
That way we can also prevent destroying the candidate file in case someone tries to merge a factor file of a different exponent. (NewPGen adds everything without any information about the exponent into the NewPGen.del file even if there were already factors of a previous search inside. verifying could sort out the valid factors if the user mix up information here)
biwema is offline   Reply With Quote
Old 2006-12-28, 14:49   #13
smh
 
smh's Avatar
 
"Sander"
Oct 2002
52.345322,5.52471

4A516 Posts
Default

I would like to reserve:

205T - 215T
smh is offline   Reply With Quote
Old 2006-12-28, 19:52   #14
MooMoo2
 
MooMoo2's Avatar
 
"Michael Kwok"
Mar 2006

22358 Posts
Default

As many of you have probably noticed, there is a new thread to reserve ranges for sieving: http://www.mersenneforum.org/showthread.php?t=6858

Enjoy.
MooMoo2 is offline   Reply With Quote
Old 2006-12-28, 20:40   #15
smh
 
smh's Avatar
 
"Sander"
Oct 2002
52.345322,5.52471

29·41 Posts
Default

How do you create a new input file using only the removed numbers file?

NewPgen has the option to merge files, but it looks like this uses only output files

BTW, anyone has any luck running newpgen on a dual processor machine (not just with this input file, but any sieving)?

Once i start the sieving, the program just exits. This happend on 3 computers (all Windows 2003). I tried two cingle cpu machines, which both worked fine. (only 1 is sieving though)
smh is offline   Reply With Quote
Old 2006-12-28, 21:01   #16
VBCurtis
 
VBCurtis's Avatar
 
"Curtis"
Feb 2005
Riverside, CA

10110110111102 Posts
Default

smh-
I run two instances of NewPGen on a Core2Duo by starting one copy, going into task manager and setting affinity of that instance to CPU1 only; then starting a second instance, setting its affinity to CPU0. I had difficulty like yours when I did not set affinity. Also note that LLR can set affinity in a menu within the program; running LLR on CPU1 and NewPGen without setting affinity works fine.

To set affinity within task manager (at least in XP Pro), right-click on a process from within the "processes" tab.
Happy Hunting.
-Curtis
VBCurtis is offline   Reply With Quote
Old 2006-12-28, 21:51   #17
gribozavr
 
gribozavr's Avatar
 
Mar 2005
Internet; Ukraine, Kiev

11·37 Posts
Default

Just out of interest, I started sieving on my Celeron. I got DSM_LogDeleted = 1 in newpgen.ini, but I see no newpgen.del file. Anyway, removing rate was 5.8 k/sec.

Newpgen was about 1.5-2 times slower (factors checked/sec) than at 195000. For n=195000 25G range newpgen says it uses fastarray, and for n=333333 100G it uses array. Maybe that is the cause?
gribozavr is offline   Reply With Quote
Old 2006-12-28, 23:31   #18
biwema
 
biwema's Avatar
 
Mar 2004

3×127 Posts
Default

Quote:
Originally Posted by gribozavr View Post
Just out of interest, I started sieving on my Celeron. I got DSM_LogDeleted = 1 in newpgen.ini, but I see no newpgen.del file. Anyway, removing rate was 5.8 k/sec.

Newpgen was about 1.5-2 times slower (factors checked/sec) than at 195000. For n=195000 25G range newpgen says it uses fastarray, and for n=333333 100G it uses array. Maybe that is the cause?
What version / Operating system are you using?

My tests (Windows XP, Vers 2.82, SSE2) always says using array.
Both 195000 and 333333 and a small array as well as a large array
(0.3 KByte for tests, 292.5MB for the 100G file)

How much are you sieving per second (increasing of p per second)?
biwema is offline   Reply With Quote
Old 2006-12-29, 00:18   #19
gribozavr
 
gribozavr's Avatar
 
Mar 2005
Internet; Ukraine, Kiev

11·37 Posts
Default

Code:
$ uname -a
Linux server 2.4.27-custom8jul2005 #1 Птн Июл 8 11:07:36 EEST 2005 i686 GNU/Linux
$ cat /proc/cpuinfo
processor       : 0
vendor_id       : GenuineIntel
cpu family      : 6
model           : 11
model name      : Intel(R) Celeron(TM) CPU                1200MHz
stepping        : 1
cpu MHz         : 1202.751
cache size      : 256 KB
fdiv_bug        : no
hlt_bug         : no
f00f_bug        : no
coma_bug        : no
fpu             : yes
fpu_exception   : yes
cpuid level     : 2
wp              : yes
flags           : fpu vme de pse tsc msr pae mce cx8 apic sep mtrr pge mca cmov pat pse36 mmx fxsr sse
bogomips        : 2398.61
Sieving 2700M-25G n=195000 says "using array", uses 192Mb of RAM, rate is 16777200 p/sec. I used the following command to capture two screenshots delayed by 1 sec:
Code:
(import -window root s1.bmp &); sleep 1; import -window root s2.bmp

Last fiddled with by gribozavr on 2006-12-29 at 00:30
gribozavr is offline   Reply With Quote
Old 2006-12-29, 07:27   #20
R. Gerbicz
 
R. Gerbicz's Avatar
 
"Robert Gerbicz"
Oct 2005
Hungary

3·547 Posts
Default

Quote:
Originally Posted by gribozavr View Post
Sieving 2700M-25G n=195000 says "using array", uses 192Mb of RAM, rate is 16777200 p/sec.
Are you using Newpgen version 2.82 ?

Another thing: 16777200 is about 2^24=16777216, so this isn't the correct p/sec. time probably. It would be a little better to sieve say 10G range and from times get the p/sec rate=10000000000/used_seconds is a good approximation.

Yesterday I've done also a test, the two speeds were almost same.
But I think that in theory n=333333 can be slower by 5-7% if it is using one more squaremod operation than n=195000.
R. Gerbicz is offline   Reply With Quote
Old 2006-12-29, 11:24   #21
ValerieVonck
 
ValerieVonck's Avatar
 
Mar 2004
Belgium

7·112 Posts
Default

Ok I have downloaded the zip file, how do I set a range to sieve from to
in NewPgen?

Thank you
ValerieVonck is offline   Reply With Quote
Old 2006-12-29, 13:05   #22
biwema
 
biwema's Avatar
 
Mar 2004

3×127 Posts
Default

I don't know the exact difference between the windows and linus version of NewPGen. Maybe that can explain some issues.
For example 192M array for a 25G range is quite a lot (the 100G range needs 292.5M ) maybe there is a different type of array used under linux if there is plenty of memory. (As already discussed before, the time difference should not differ that much if p is large)

Also windows prints an output every 2^24. so sieving some G is more accurate. I have around 80M/s with 3.4GHz P4. Probably some AMD architectures are even faster.

Set a range:
Start of the range: best use a Hex editor and set the starting value into the first line. Normally a Hex editor does not need to load the whole file into memory and is therefore very fast.

End of the range:
Newpgen provides an option to set a manual p max. It needs to be set before the sieving process starts otherwise it does not stop there.
biwema is offline   Reply With Quote
Reply



Similar Threads
Thread Thread Starter Forum Replies Last Post
n=333333 Twin Found! Kosmaj Twin Prime Search 12 2009-08-14 13:10
What if we don't find twin prime n=333333? cipher Twin Prime Search 5 2009-04-16 21:53
n=333333 off the list TimSorbet No Prime Left Behind 2 2008-05-13 17:26
After n=333333, our next exponent will be... (revised poll) MooMoo2 Twin Prime Search 24 2007-02-01 06:30

All times are UTC. The time now is 13:42.


Fri Jul 7 13:42:36 UTC 2023 up 323 days, 11:11, 0 users, load averages: 1.04, 1.04, 1.10

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

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