Search the web
Sign In
New User? Sign Up
ggnfs
? Already a member? Sign in to Yahoo!

Yahoo! Groups Tips

Did you know...
Want to share photos of your group with the world? Add a group photo to Flickr.

Best of Y! Groups

   Check them out and nominate your group.
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.

Messages

  Messages Help
Advanced
Messages 2457 - 2486 of 2486   Oldest  |  < Older  |  Newer >  |  Newest
Messages: Simplify | Expand   (Group by Topic) Author Sort by Date ^
2457
What is the expected time in years for factorize a number with 2048 bits with ggnfs...
alfaropas
Offline Send Email
Sep 23, 2009
11:29 am
2458
... I suppose it's silly to ask, but is there any reason why polynomial selection couldn't be made to use multiple CPUs? John....
loukoume
Offline Send Email
Sep 23, 2009
11:31 am
2459
Kudos to Jason for the new version. I have had a number of snfs factorings, which have bombed out immediately with the previous version. Now I started a...
torbjornalm
Offline Send Email
Sep 23, 2009
10:04 pm
2460
... For practical purposes, infinity. See http://mersenneforum.org/showthread.php?t=12125 for a discussion of factoring a 1536 bit general number. And 2048...
chris2be8
Offline Send Email
Sep 25, 2009
3:43 pm
2461
Hello, I've tested the matrix solving step with 1 vs 2 threads on a single core CPU with hyperthreading. It runs *faster* with 1 thread than with 2. Lattice...
chris2be8
Offline Send Email
Oct 4, 2009
9:14 am
2462
Hi dear group ,after downlouding ggnfs 340 and extracting and downlouding  CYGWIN and install , on double clicking CYGWIN I  get a flash window only and on...
jamal othman
jamalothman2003
Offline Send Email
Oct 7, 2009
8:56 am
2463
... The ggnfs binaries are command line tools so you can double click on them, you need to run them from either a cygwin shell or from a command prompt...
Jeff Gilchrist
jeff.gilchrist
Offline Send Email
Oct 7, 2009
2:49 pm
2464
... Great find, this has been updated in the SVN code so it will not longer produce that output. ... That is a very good question. I'm not sure if anyone here...
Jeff Gilchrist
jeff.gilchrist
Offline Send Email
Nov 5, 2009
8:35 pm
2465
Hello, Everyone ... What was the sort of garbage seen? ... wrong. We have: printf("%d %lu %u ",x,qx,ulqx); x here is of type i16_t qx - u64_t ulqx - u32_t The...
Anton Korobeynikov
aslsoft
Offline Send Email
Nov 6, 2009
12:40 pm
2466
... That wouldn't work for the Windows build because the Microsoft compiler doesn't support most of the C99 stuff and has no stdint.h header file. We could...
br_gladman
Offline Send Email
Nov 6, 2009
2:30 pm
2467
Hello, Brian ... At least we need to use proper format specifiers, since "unsigned long" is still 32 bits on win64. I was told that stuff from ...
Anton Korobeynikov
aslsoft
Offline Send Email
Nov 6, 2009
2:58 pm
2468
... Hello Anton I haven't tried the one you reference above but I have had trouble with earlier attempts to add inttypes.h to Visual Studio. In fact this might...
br_gladman
Offline Send Email
Nov 6, 2009
3:30 pm
2469
Hi, I am currently running the command: perl factmsieve.pl ..\..\example.n and factmsieve.pl is running pol51opt and pol51m0b searching for leading...
chuacw_scea
Online Now Send Email
Nov 11, 2009
3:43 pm
2470
Dear Chris, Did you have time to make it work? We will gladly help to hammer on it and try to find and (possibly try to help to) fix some bugs. Block Wiedemann...
batalovs
Offline Send Email
Nov 16, 2009
10:58 pm
2471
dear all I would be thankful if someone provide me the estimated time to run GGNFS on different integers. You can fix any machine, for example core2 due 2.ghz....
H.M.B. Ibrahim
hmb.ibrahim
Offline Send Email
Nov 17, 2009
7:44 am
2472
... You can get good estimates from these graphs here: http://homepage2.nifty.com/m_kamada/math/graphs.htm There are total time graphs for both GNFS and SFNS,...
Jeff Gilchrist
jeff.gilchrist
Offline Send Email
Nov 17, 2009
12:24 pm
2473
Hi all, As inferred from the subject I am interested in factoring an ~150 digit composite (p*q where p and q are prime; p != q). It is my understanding that by...
Freddie Witherden
freddie@...
Send Email
Nov 18, 2009
5:13 pm
2474
150 digits should not be too difficult on the resources you describe. A quad-core system should be able to handle the workload in 10-12 days. Even the...
Al Edwards
alwards
Offline Send Email
Nov 18, 2009
7:01 pm
2475
... Yes, I think I remember seeing that when I ran msieve --help (the [X,Y] range). However, how should one go about determining the overall range (is it 0..Y...
Freddie Witherden
freddie@...
Send Email
Nov 18, 2009
7:33 pm
2476
On Wed, Nov 18, 2009 at 2:28 PM, Freddie Witherden ... Freddie, You can always use the 'kill -STOP <pid>' and 'kill -CONT <pid>' commands at a unix shell...
David Willmore
davidwillmore
Offline Send Email
Nov 20, 2009
3:58 pm
2477
Hi, ... Yes, that seems to be just what I need! I've been playing around with some smaller numbers first -- just to get my bearings. It seems simple to divide...
Freddie Witherden
freddie@...
Send Email
Nov 20, 2009
10:47 pm
2478
I have a load of polynomials (produced by msieve and then concatenated) along with 'n', but can not work out the correct calling convention for the program. ...
Al Edwards
alwards
Offline Send Email
Nov 20, 2009
11:57 pm
2479
i have problem in compiling the source code for sieve file in GNFS ihave dev c++ ,vista...
i gad
gad_12006
Offline Send Email
Nov 21, 2009
4:49 pm
2480
... Okay. So my current plan is to run a load of msieve instances (one-per-core- per-system). However, msieve auto-selects a range between [0,n] for me for a ...
Freddie Witherden
freddie@...
Send Email
Nov 21, 2009
6:09 pm
2481
... Msieve's poly selector does not randomize anything when given a range of coefficients to search, so you will crunch the same numbers multiple times. For...
Jason Papadopoulos
jasonp@...
Send Email
Nov 21, 2009
6:29 pm
2482
... I have 12 AMD Opteron cores averaging 2.3 GHz, and I run 64-bit Linux so as to use the faster 64-bit lattice sievers and GMP-ECM. The C158 was not bad: ...
Al Edwards
alwards
Offline Send Email
Nov 21, 2009
7:14 pm
2483
Hello, ... In order to help resolve your problem we are going to require some more information. Firstly, what file is giving you compiler errors and what form...
Freddie Witherden
freddie@...
Send Email
Nov 21, 2009
7:17 pm
2484
... Does GMP-ECM help with polynomial selection? I thought it was just used to knock-out small factors? Finally, when selecting the range to sieve did you just...
Freddie Witherden
freddie@...
Send Email
Nov 21, 2009
7:46 pm
2485
... Great! Hello, this is the Juno stating that I am currently factoring a 150-digit composite number for the form 10^420 + 1 and I understood the point of...
fjuno37
Offline Send Email
Nov 22, 2009
1:20 am
2486
... Namely: {print(#Str(subst(polcyclo(840),x,10)/ (134401*575794801*67501680066009758096678991121)));} 150 Good luck David...
djbroadhurst
Offline Send Email
Nov 22, 2009
8:30 am
Messages 2457 - 2486 of 2486   Oldest  |  < Older  |  Newer >  |  Newest
Advanced
Add to My Yahoo!      XML What's This?

Copyright © 2009 Yahoo! Inc. All rights reserved.
Privacy Policy - Terms of Service - Guidelines - Help