20100419, 05:35  #364 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
9324_{10} Posts 
The new binary nailed all three. Thanks!
In the end, when all factors are reported, the binary lingers for a second and then says >> couldn't reallocate string when parsing Exit 255 It doesn't hurt (really), but what is it doing for that second? The commandline is # echo "siqs(732566077883908909845195639793682175206731)"  yafu v Doesn't seem to "freeze" without v. 
20100419, 07:42  #365  
Bamboozled!
"πΊππ·π·π"
May 2003
Down not across
24533_{8} Posts 
Quote:
Code:
x[i+1] = (6364136223846793005*x[i] + 1442695040888963407) mod 2^64 Paul 

20100419, 13:56  #366  
"Ben"
Feb 2007
3,371 Posts 
Quote:
Quote:
Everything works fine without the v because the program is able to determine that there is something in the pipe, processes it, and exits. It gets confused with the v because there is both something in the pipe and an input argument which causes it to open in interpreter mode. There is apparently a neverending stream of stuff coming out of an open pipe... . A workaround until I can fix this is to just use yafu "siqs(732566077883908909845195639793682175206731)" v, or use echo but put the v in the .ini file. apologies,  b. 

20100419, 15:36  #368  
Bamboozled!
"πΊππ·π·π"
May 2003
Down not across
3·3,529 Posts 
Quote:
Until you know your requirements (speed, cycle length, cryptographic strength, code complexity, sundry statistical properties, etc) it is difficult to give advice other than to conduct research. The 3rd Edition of Numerical Recipes has some nice proposals for noncryptographic PRNGs. My guess is that the MMIX may be sufficient for what you want, which is why I proposed it. It is certainly very quick to write and to run as it consists of two simple arithmetic operations on a 64bit variable. It's what I use all the time when I can't justify anything more complex. Paul Last fiddled with by xilman on 20100419 at 15:39 Reason: Add final paragraph. 

20100419, 17:22  #369  
"Ben"
Feb 2007
110100101011_{2} Posts 
Quote:
That's a good question; me neither, really. Random numbers are used in many places throughout the code, but mostly for noncritical things like generating random ECM curve sigmas and random factor base indices from which SIQS polynomials are built, that sort of thing. MMIX, I'm sure, would be fine for those. The only "mission critical" application from a RNG standpoint that I can think of is the RSA number generation function. But I've never meant that to be targeted for cryptographic use  only for generating test cases for siqs and other factoring routines. Quote:
Thanks!  ben. 

20100525, 06:32  #370 
May 2008
10001000111_{2} Posts 

20100611, 10:38  #372 
Mar 2006
Germany
13^{2}·17 Posts 
Suggestion:
The output from yafu V1.18 in a DOSbox gives the length of the candidate like rho: ... on C99 pp1: ... on C99 ecm: ... on C99 ... but the file 'factor.log' only prints this in bitsize! So could you equalize both outputs? I like the Cxx more. 
20100611, 13:11  #373 
"Ben"
Feb 2007
3,371 Posts 
Sure, thanks for the suggestion.

20100729, 14:49  #374 
"Ben"
Feb 2007
3,371 Posts 
YAFU 1.19 available
... in the usual place.
New in version 1.19 + much improved sieve of Eratosthenes + faster prime counting (fastest available on modern 64 bit CPUs in some situations) + higher limit (up to 4e18) + less memory usage + some new flags for printing primes. + slightly faster SQUFOF implementation + bugfixes + misc requested changes + addition of fermat's factorization algorithm For this version I again mostly concentrated on the sieve of Eratosthenes. Also the usual bug fixes and requested changes. Any feedback is welcome. 
Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Running YAFU via Aliqueit doesn't find yafu.ini  EdH  YAFU  8  20180314 17:22 
YAFU1.34  bsquared  YAFU  119  20151105 16:24 
Yafu bug.  storflyt32  YAFU  2  20150629 05:19 
yafu1.33  bsquared  YAFU  12  20121108 04:12 
yafu1.32.1  bsquared  YAFU  21  20120904 19:44 