mersenneforum.org  

Go Back   mersenneforum.org > Factoring Projects > FermatSearch

Reply
 
Thread Tools
Old 2016-07-04, 08:46   #1
ET_
Banned
 
ET_'s Avatar
 
"Luigi"
Aug 2002
Team Italia

2×2,383 Posts
Default FermFact

Does a version of FermFact for Linux exist? Will ever?

I need to re-test for Fermat factors and gfn 2 small ranges:

Code:
N=14,000-14,500  and  k=20,000,000-30,000,000
N=15,000-16,000  and  k=100,000-200,000
but can't create a suitable abc/npg input file for ppsieve... Any hints?

Luigi

P.S. I'm playing with Nsieve now...

Last fiddled with by ET_ on 2016-07-04 at 09:34 Reason: Elaboration
ET_ is offline   Reply With Quote
Old 2016-07-04, 11:04   #2
ET_
Banned
 
ET_'s Avatar
 
"Luigi"
Aug 2002
Team Italia

2·2,383 Posts
Default

Quote:
Originally Posted by ET_ View Post
Does a version of FermFact for Linux exist? Will ever?

I need to re-test for Fermat factors and gfn 2 small ranges:

Code:
N=14,000-14,500  and  k=20,000,000-30,000,000
N=15,000-16,000  and  k=100,000-200,000
but can't create a suitable abc/npg input file for ppsieve... Any hints?

Luigi

P.S. I'm playing with Nsieve now...
It seems that I had an issue with Nsieve: 7388 remaining candidates for 2G < P < 10G
ET_ is offline   Reply With Quote
Old 2016-07-04, 11:25   #3
henryzz
Just call me Henry
 
henryzz's Avatar
 
"David"
Sep 2007
Cambridge (GMT/BST)

2×2,861 Posts
Default

You could try Wine.
Assuming you don't need them sieving long before you can pass them to ppsieve then I could do that stage and upload them.
henryzz is offline   Reply With Quote
Old 2016-07-04, 12:55   #4
henryzz
Just call me Henry
 
henryzz's Avatar
 
"David"
Sep 2007
Cambridge (GMT/BST)

165A16 Posts
Default

Here are the files. The compression ratio was about 6% for these so don't be surprised to get a 2GB file.
https://www.dropbox.com/sh/q3bahghnl...DEiqxp9ha?dl=0
henryzz is offline   Reply With Quote
Old 2016-07-04, 12:58   #5
ET_
Banned
 
ET_'s Avatar
 
"Luigi"
Aug 2002
Team Italia

112368 Posts
Default

Quote:
Originally Posted by henryzz View Post
Here are the files. The compression ratio was about 6% for these so don't be surprised to get a 2GB file.
https://www.dropbox.com/sh/q3bahghnl...DEiqxp9ha?dl=0
You are just too kind, Henry thank you very much!
ET_ is offline   Reply With Quote
Old 2016-07-04, 14:07   #6
rogue
 
rogue's Avatar
 
"Mark"
Apr 2003
Between here and the

3·1,973 Posts
Default

Do we have source for FermFact? Is it something that would benefit by being rewritten or today's CPUs/GPUs?

Last fiddled with by rogue on 2016-07-04 at 14:07
rogue is online now   Reply With Quote
Old 2016-07-04, 16:05   #7
ET_
Banned
 
ET_'s Avatar
 
"Luigi"
Aug 2002
Team Italia

2·2,383 Posts
Default

Quote:
Originally Posted by rogue View Post
Do we have source for FermFact? Is it something that would benefit by being rewritten or today's CPUs/GPUs?
I don't have it

Maybe someone might ask the author (Jim Fougeron). The program is at version 2.0 and uses SSE2 acceleration.

If no one will contact him in a week or two, I will.
ET_ is offline   Reply With Quote
Old 2016-07-04, 16:51   #8
rogue
 
rogue's Avatar
 
"Mark"
Apr 2003
Between here and the

591910 Posts
Default

Quote:
Originally Posted by ET_ View Post
I don't have it

Maybe someone might ask the author (Jim Fougeron). The program is at version 2.0 and uses SSE2 acceleration.

If no one will contact him in a week or two, I will.
I've had no success in the past, so go for it.
rogue is online now   Reply With Quote
Old 2017-12-22, 20:10   #9
rogue
 
rogue's Avatar
 
"Mark"
Apr 2003
Between here and the

171F16 Posts
Default

I was running a test today with fermfact and ran into something very distressing. I ran with the following:

Code:
fermfact -mn=1000 -Mn=2000 -mk=10000 -Mk=20000 -O=ff.out -pb=52 -l=1000
With the -l option I started getting a lot of errors like this:

ERROR!!! Verification of (12123*2^1172+1)%887651 FAILED!!!!

This error is correct. That prime is not a divisor of that number. If I do not include the -l option, then it doesn't produce this message. I'm starting to wonder if fermfact is removing terms incorrectly.

Can anyone else reproduce this?
rogue is online now   Reply With Quote
Old 2017-12-22, 21:07   #10
wombatman
I moo ablest echo power!
 
wombatman's Avatar
 
May 2013

32×193 Posts
Default

Quote:
Originally Posted by rogue View Post
I was running a test today with fermfact and ran into something very distressing. I ran with the following:

Code:
fermfact -mn=1000 -Mn=2000 -mk=10000 -Mk=20000 -O=ff.out -pb=52 -l=1000
With the -l option I started getting a lot of errors like this:

ERROR!!! Verification of (12123*2^1172+1)%887651 FAILED!!!!

This error is correct. That prime is not a divisor of that number. If I do not include the -l option, then it doesn't produce this message. I'm starting to wonder if fermfact is removing terms incorrectly.

Can anyone else reproduce this?
Confirmed on a Windows 10 PC using Fermfact 2.0 RC1d.

Edit: It does look like Fermfact should catch at least some of these by default, but there may be an issue when p < maxk:
Code:
-v-     Turn off secondary verification of factors.  Verification happens
         for all found factors where p>maxk.  The factors are put through a
         a secondary verification process, but -v- turns this off.

Last fiddled with by wombatman on 2017-12-22 at 21:15
wombatman is offline   Reply With Quote
Old 2017-12-22, 22:22   #11
rogue
 
rogue's Avatar
 
"Mark"
Apr 2003
Between here and the

3×1,973 Posts
Default

It doesn't appear to be removing the term that fails, but I haven't run enough tests to verify that.
rogue is online now   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
FermFact and more... ET_ Programming 4 2010-04-19 19:32

All times are UTC. The time now is 03:21.

Tue Sep 29 03:21:40 UTC 2020 up 19 days, 32 mins, 0 users, load averages: 1.50, 1.73, 1.68

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