Hi all ! I am happy to join the Openpfgw project, and thank Chris Nash who invited me to do so. With the hope I should contribute soon with something usefull. ...
Jean Penné
j_penne@...
Apr 11, 2001 5:47 am
362
Welcome Jean, You will find that this group frequently appears to be dead, and then has growth spurts where a lot of new things get added. We have been dead...
Jim Fougeron
jfoug@...
Apr 11, 2001 12:08 pm
363
... Might http://groups.yahoo.com/group/primeform/message/1816 (et seqq) be a place to resume. Should I look for a factorfile that require N-1 and N+1 with -x...
d.broadhurst@...
Apr 11, 2001 4:12 pm
364
Hi, I have finally got round to putting the networking mode into a usable form. If you are interested have a look at ...
Michael Bell
mdb36@...
Apr 11, 2001 6:27 pm
365
... I still need to fix the modular sieve... (It never fully worked in the first place, so it's not really 'fix'ing). Work is mad. My 2 development PCs have...
Phil Carmody
fatphil@...
Apr 11, 2001 9:40 pm
366
Hi folks ... Whoa there David, go easy with the thumbscrews on me :) Seriously though, 'genuine' N^2-1 tests are not too far away in pfgw - the N+1 internals...
Chris Nash
chris_nash@...
Apr 12, 2001 4:33 am
367
Welcome Jean to the list! As Jim points out, things here can be very quiet at times. Then suddenly very much happens. This evening I have lots of new files to ...
Chris Nash
chris_nash@...
Apr 12, 2001 4:33 am
368
Hi, ... Yes, I have already received several messages from the group, and it encourages me ! ... Yes, it seems to be true : I tested three well known prime...
Jean Penné
j_penne@...
Apr 12, 2001 8:04 pm
369
... Wow! That is impressive, Jean. ... Off to the (virtual) library.... So that test is v[i]^2=v[i-1]^2-2 and v[n-2]=0 mod N iff N=h*2^n-1 is prime with all...
d.broadhurst@...
Apr 12, 2001 9:01 pm
370
... It would be much more impressive (a factor from 2 to 3 further) if it were possible to use the DWT and irrational base method of Richard Crandall to ...
Jean Penné
j_penne@...
Apr 13, 2001 6:13 am
371
... I note that Riesel says that he can find the Lucasian starting value for any h<2^n in N=h*2^n-1. What is the largest h<2^n for which a non-trivial starting...
d.broadhurst@...
Apr 13, 2001 1:55 pm
372
... Yes, this is the limit of his method. ... I don't know, but I wish to make a program to see how frequent are the failures to find the starting value v1,...
Jean Penné
j_penne@...
Apr 13, 2001 8:13 pm
373
... Thanks Jean. I like that: no worse than present PFGW for any legal h; 3 times faster for h << 2^n. Conclusion: do not restrict h to be small in code? David...
d.broadhurst@...
Apr 13, 2001 8:31 pm
374
Hi folks, George Woltman told me about Jean's results - I was sure they would be impressive. And indeed they are.... ... -it ? ... used. ... or ... That is...
Chris Nash
chris_nash@...
Apr 14, 2001 1:10 am
375
Hi folks, There's a partial drop of the current dev level of openpfgw in the yahoogroups files area http://www.yahoogroups.com/files/primeform I've dropped it...
Chris Nash
chris_nash@...
Apr 14, 2001 6:34 am
376
Hi folks, There are new preview versions of the pfgw, pfoo, and winbuild components (labeled 20010415) at http://groups.yahoo.com/group/openpfgw/files/ ...
Chris Nash
chris_nash@...
Apr 15, 2001 4:47 am
377
... [...] ... Yes, thanks Jim for the speedy windows version, which runs well on the usual supspects, so far. ... Oh it's easy to propose where I cannot...
d.broadhurst@...
Apr 15, 2001 5:55 am
378
Hi all, Is it time for us to "freeze" a 1.1 release? I for one think so. There have been a lot of things added since the 1.0 release. If too much more gets...
Jim Fougeron
jfoug@...
Apr 16, 2001 3:59 am
379
Hi folks ... I think it may be worth it too. The first "release version" definitely needed the .0. It was untidy, unforgiving, and was definitely lacking the...
Chris Nash
chris_nash@...
Apr 16, 2001 6:48 am
380
... And 2 times faster for h ~2^n, because I did not take into account that, when h~2^n, N = h*2^n-1 has approximatively 2*n bits, and so, is comparable in...
Jean Penné
j_penne@...
Apr 16, 2001 7:30 pm
381
Test case: (213*2^3369-22932195)*2^94811-1 [I'm being generous and keeping h<<2^n] How long to finding the Lucasian starting value? Good luck, Jean! David...
d.broadhurst@...
Apr 16, 2001 7:58 pm
382
Hi all, Wow - I go away for Easter and everything seems to be going on on the PFGW front :) Great work on the combined tests by the sounds of things Chris, ...
Michael Bell
mdb36@...
Apr 17, 2001 6:05 pm
383
Hi folks ... PFGW ... Chris, ... Welcome back to the list Michael - not much code has changed, but there's a lot of activity and talk going on. The list has a...
Chris Nash
chris_nash@...
Apr 17, 2001 8:00 pm
384
... I'd hope it was the opposite. I would hope that the source of the numbers to be tested should be as independent from the testing as possible. A pipe is a...
Phil Carmody
fatphil@...
Apr 17, 2001 8:28 pm
385
... to be tested should be as independent from the testing as possible. A pipe is a (f)readable stream (given an fdopen), a socket is (f)readable stream, ...
Michael Bell
mdb36@...
Apr 17, 2001 9:44 pm
386
Here is big news from Carl Pomerance. OpenPfgw may be able to program N-1 or N+1 with only 30%. Chris and I need to get our teeth into this! David ... David, ...
d.broadhurst@...
Apr 23, 2001 6:05 pm
387
Hi, I have noticed that it may sometimes be useful to not be restricted to numbers when writing ABC files, for example you may want to do something odd like...
Michael Bell
mdb36@...
May 10, 2001 6:31 pm
388
Michael, Please also post source files or patches. Jim. ... to ... something odd ... puzzles). ... being able to ... were ... see the ... I've ... 4096, so ......
jfoug@...
May 10, 2001 8:21 pm
389
Hi, Sorry - have posted these now. If we are making a stable version I would not include this feature, as it makes significant changes to both ABC and ABC2...
Michael Bell
mdb36@...
May 11, 2001 12:08 am
390
Hi there folks, I have the strangest feeling Michael's latest feature could turn out very useful indeed, the ability to vary not just numbers, but the ...
Having problems with message search?
Fill out this form to ensure your group is one of the first to be migrated to the new message search system.
