Search:

The developers would be me and Paul.

Your link looks interesting... I was under the impression that you could no longer download ICC-Linux for free, but it seems I was wrong. I'll have a look.
...

Hi,

memory latency and things like that no doubt makes a difference, yes. The difference between OSs on the same machine is due to, as you say, compiler optimization differences and to some extent...

I rewrote the timing routines in conjunction with the bsd port, so that may explain the more stable rate. It shouldn't be any faster though, so if it is then it's quite likely just an artifact of the...

Nah, stats.txt is just there for kicks, statistics, and debugging.

"# tested" is the number of k and p values that were processed. For SOB the k count is 11 times the p count. "#tested p : 10"...

Would everyone using sobistrator v1.15 or v1.16 please upgrade to the new v1.18?

I made a bit of a screwup there, so B2 at RieselSieve is getting all your factors. :) Luckily he's forwarding them...

Hi Deoje,


Are you sure you didn't accidentally input a higher number for the end of the range? That would explain why it hasn't stopped. You can look at the "pmax=*" line (first or second line)...

Congratulations!

Here's to hoping this will give the project a little boost,
Mikael

Hi Washuu,

if the Celeron is a PIV Celeron then it's because the FPU on PIVs is really slow, and proth_sieve makes heavy use of the FPU when doing modular multiplication.

As for NBeGon, it was...

Yes, that matters. The reason hc_grove's bounds didn't need to be so high is that the bounds only had to be sufficient for a 19-digit factor (and an 18-digit one).

The chance that a set of small...

But that's not really what the P-1 algorithm found. Rather it found two factors (simultaneously, since the bounds covered both):
1695263162018308849-1:
2^4 * 3^4 * 7^2 * 157 * 317 * 2237 * 239779...

Congratulations, but that factor isn't prime (Mr. Killjoy here). :)

261252098359999236987971694398316499 =
1695263162018308849 * 154107105146414851

I think the sumout error is what you get when your processor fails due to overclocking or similar phenomena. Try lowering the clock a bit if you have oc'ed it.

dunno... a wild guess is 40%, but that's just that -- a wild guess. Don't put any weight whatsoever in it. I just replied so you wouldn't feel ignored... :) I don't know enough about the amd64...

You're better off waiting then, at least as far as my client coding goes.

I'm very curious to see how an amd64 optimized siever would perform... It certainly feels as if it could be Speedy. Feel like buying me one too? ;)

MikeH,
saaaay, what's up with -17K under "Other"?

Score breakdown
Total New factors ( %) Score change ( %) Other ( %)
Daily change last 1...

larsivi,

you'll probably see your new factors again if you press refresh.

I'm not sure, but I think I fixed that some time ago... At least I don't have the same problem in the version I'm...

Thanks! :D

MikeH,
very nice! I seem a bit unlucky though... Good thing the active window starts moving again soon. *rubbing hands* :)

Yes. How much depends on which k is killed.

That factor is incorrect. Bug in sbfactor?

Yes, you have to calculate bigger powers as p (and the order of 2 in Z_p) increases. The overall rate doesn't seem terribly affected though -- the effect is offset somewhat by the diminishing density...

Mystwalker,

the complexity of the Silver-Pohlig-Hellman discrete log algorithm is O(sqrt(q)), where q is the biggest prime factor of p-1. That gives you the full DL though, which we're not really...

Ooookay. That sounds a bit odd to me, but, aaah, congratulations! :D Are you sure you haven't changed anything else?

Keroberts1,
just enjoy your new blazing speed. ;)

Mikael

I just put up a new proth_sieve v0.37. There was a bug in v0.36 that could cause it to miss factors (something like 1 in 400 factors). I'm very, very, very sorry about that. :( I used to sieve 257...