Search:

Hi all,

I haven't been receiving notification of updates for some reason, so I haven't been here for a while, but I have just subscribed to the thread again. However let me say here my thanks to...

That would have to be a completely new sieving effort, rather than being added to the current data - we want to check them for divisiblity against the 'small' primes as well, after all.

Values up...

Hi,

I have got a Linux version of SoBSieve... does somebody want to test it for me? If so, PM me with your email address.

Regards,

Paul.

Ah, well I read it, and the problem with implementing it - as with any "order of 2" idea - is that there is no fast way to find the order of 2 mod p. The only way it can be done is to completely...

OK, here is one branded 1.35 for y'all.

Ok guys,

It look like I forgot about a 1.34 release somewhere along the way. This is the latest code though, so there shouldn't be any problems with it. Sorry about that! I can make a release...

Did we? I thought the last release was 1.33 - though I might have put a 1.34 up for a while then withdrawn it...

Anyhow, if it doesn't cause a problem I won't rerelease. BTW, does it work as...

Hi,

Attached is a 1.34 release of SoBSieve. This is almost identical to the 1.33 release - it does a couple of things in a different order to help the Sieving Server development effort, but apart...

Louie et al,

I am on a well-deserved holiday travelling around Spain right now, and my only chance to hit the internet is today while we are in Grenada and Karen is "shopping for shoes" :)

I...

It isn't a silly question... it is an easy change to make. If anybody wants to experiment, a version without the 9.99 restriction on alpha is attached.

The 34 million can't be changed - that is...

In a word, yes, this is comparatively new behaviour. The rounding has always been present, but with the current implementation - where each k value appears multiple times in the sieve - the effect is...

Well, looking at the code I can see that I get two values: arange, and brange.

arange=sqrt (alpha*34 million);

arange is then rounded up to the nearest multiple of 15840.
...

That is the next thing that I am going to do. But I wanted to get this fixed version out ASAP first.



Thank you! As I recall, 3*2^414840-1's rank was 134 when it was added, and I don't think...

To explain the problem: I had some dodgy code that meant that the various k values were sharing the same bitmap in different ways. This meant that for a given k value, the bitmap would contain the n...

Ah, I forgot it. Here it is.

Regards,

Paul.

Hi all,

I found the problem that was cuasing the extra factors to be found. It has been fixed in the attached release. I strongly recommend that you up grade to this version!

Regards,

Paul.

Hi Reto,

You know...thinking about it, the math in the current version should be good up to 2^60. I will check, and if it is the case (and I am 90% sure that it is) I will ease the restriction.
...

The answer is yes, yes, and yes.

Definitely one p can eliminate n values for different ks. It is also true that one p can eliminate many ns for one k value - particularly when p is small (for...

Mike,

use

-a=<value> on the command line, for example

SoBSieveConsole -a=3.0

You can also use

Yes, definitely!


I have been thinking about a Linux version, but haven't had the time to get it done properly. If there are any volunteers out there who have got time and know gcc and embedded...

Hi all,

Here is a 1.33 release. This uses a lot less memory than 1.32, but is just as fast - in fact, it might be a tad faster (but the difference is negligible).

Regards,

Paul.

OK, I had a brainwave tonight and I worked out how to get rid of loads of the extra memory that it is using. This probably wont make it any faster, but it will make it a better friend to the other...

That is odd... you see, for my testing I remove one particular test so that it will report divisors that are not in the bitmap. That way, I get a lot more results reported. All of the results are...

I have managed to get some more speed out of it... on this Athlon the rate goes from 258 kp/sec to 300 kp/sec. Which isn't too bad :)

Mike/Xeltrix, the console rate problem was just a reporting...

I would have thought not. The important factors in deciding alpha are the range of n, and how many k values are being sieved together.

By the way, this new release may well need some...