Hi all, If you have a small number (less than 2^31, I would say from a quick look at the source) and you test it using -tm, -tp, or -tc, even if it is prime ...
There is one more problem I found recently. On 2 machines I run the command line version of pfgw using the Task Scheduler (Win-2k), I set it to start at a...
I will look at this, but it is VERY possible, that there is nothing to do (other than find a different "scheduling" mechanism). The buildin scheduler is not...
Jim - over the weekend I found another little bug in the 'Lucky Minus' file handling code. I'll fix that and send the corrected file to you. Regards, Paul. ...
FYI, I have fixed this bug and the one that I saw last week (-t[pmc] with small candidates). I hope that didn't duplicate work, but it was only a three line...
Thanks for your reply. Note that there are two issues here: 1) Command line client doesn't catch the scheduller's kill signal and suddenly stops without...
I have not had a chance to look at this problem (yet). The scheduler handles command line apps by killing the CMD console, and not the app. There is no...
An example of numbers I'm working on right now: PRP: 121088*13^121088-1 85000/448095 requires between 90 minutes of fast P-4's and 200 minutes on slow P-3's....
... I'm just looking at the code, and although it pulls the power of 2 out (as if it was going to use it for a SPRP test), if you run it it does a fermat PRP ...
I have had a look at the code and can see no good reason why b is limited to the range 2 to 255. To allow values up to 2^31 is a simple two line change: ...
... The prime95 fft routines allow multiplying by a small constant in the rounding and carry propagation step. This is much cheaper than a separate step after...
Thanks George. I was pretty sure this was the case, but was not exactly sure (in the PRP since). Jim. ... limited to ... the ... separate ... Anyway, Chris ...
This is just a passing thought, but since the PFGW executable is so *huge*, I routinely compress it using the UPX utility (see http://upx.sourceforge.net/). ...
Changes were made in the code that chooses the FFT size due to just this type of problem occuring with certain numbers in the 1.1 release. Choosing the correct...
This error has nothting to do with those changes. This error was "added" since 1.1 In the code for PRP, this code "existed". It is a "quick-check" to see if...
A stronger KP-combined algorithm ******************************** Suppose that every factor f of N satisfies f = 1 mod F f = N^j mod G for some j in [0, T-1]...
Informal PS: I had been racking my brains trying to wind up to F1+F2>0.3, but I can't for the life of me see how to do that, however much Bouk goads me:-) ...
Personally BASIC-style syntax causes my brain to implode, which is why in the last few years I've written precisely _zero_ PFGW scripts. Perhaps a more C-like...
... Yes! Surely there must be an open source interpreter that can be leveraged? Paul __________________________________________________ Virus checked by...
... That would be the "proper" way. However, the problem appealed to the hacker in me, so there's a squeezee-cheezee solution on its way. You'll not like it,...
How about INTERCAL: http://www.muppetlabs.com/~breadbox/intercal-man/home.html which like any decent language has no GOTO - but does have a COME FROM... ...
... I can't stand the faux politeness of intercal. Then again, I'm not supposed to like it, am I? However, you're talking to someone who dabbled with...
... Well, I was originally going to suggest its 1-D equivalent, http://www.muppetlabs.com/~breadbox/bf/ before I plumped for Intercal... ... So how complex can...
... Backus? Sounds like an excuse to party! I can't beat 1954, but one of may favourites is still 1957's "Are you now, or have you ever been... a LISP...
... I don't know. Honestly, I don't know. I said you wouldn't like it... Phil ===== Given that Dubya has control of a such vast arsenal, I'm sure the most...