Search:

I doubt that SoB will pass GIMPS. When the primes habe about the same size, it takes much more time to complete one single primbility test besides the lower probability of being prime (due to the...

By the way



Are the numbers with k=5359 and an exponent smaller than the new prime going to be tested?
I think it makes sense in order to prove that the new prime is the smallest one with...

hi,



I also noticed, that mklasson was sometimes quite unlucky. I always thought he will pass me next days because he did more sieving. The chance to find a factor within the window is now...

Frodo42,

Did you try rediscovering your factor with different bounds?
What would happen if you used bounds that are too small to find the unknown factor?

What happens, if you continue using...

I don't know exactly, but I think so.

At 4650000 one test took me 50 minutes;

at 4820000 it is 1:40 and
at 4700000 - 4780000 it is 1:20

It seems as if there are two steps (one for fft and...

Hi,

I tried to find now the FFT limit for SSE2 processors.

It is somewhere between 4780000 and 4781000.
at that point the b1 increases from 15000 to 20000 (1.1; 256M Ram) increasing the...

Hi,

At the moment only a part of all the candidates are prp tested. So there is a lot of choice.

Does someone know, where the limits for FFT sizes (SSE" and not SSE2) are. In that case these...

I think this cap is a good idea. Maybe it is better to synchronize this limit to the reserving border than the submitting border (or 90 % of them). the reason of that is, that if people start to...

When doublechecking reaches that point, first time checking is probably beyond 10M scoring 12500 each factor. In that case these 1200 points are not that important anymore compared to the factors of...

Now when sieving, there are quite many factors and most of them are outside the active window. These factors do not score much now, but it will increase if the active window is moving and no prime is...

by the way,

be careful that you don't reserve a range which is too near the prp effort.
If your factors leave the active range before you submit them, you will only score ~0.4 instead of 2100.
...

A factor value of 1.5 seems quite good even if don't have too much statistical material to analyse.

At the moment it seems as if primality testing is approaching p-1 factoring. There is a huge gap...

Nuri, are there new graphs about the distribution of factors available? I think it would be quite interesting.

It seems, as if the approximation is still correct around 40T.

On the other hand,...

Hi,

It was easy to predict that the new distribution of the p-1 factors will mess up the statistics quite a bit. One factor could score up to 18 million (64 bits).
It was really funny to see me...

Hi,

I tried p-1 on the mantisse 21181 between 350000 and 390000 until now.
There were 142 candidates and I found 7 factors with the bounds 100000 and 1000000.

I think (just a feeling), that it...

Hi,

I think, the p-1 factroing will mix up the stats quite a bit. The new factors are distributed between 1T and beyond 1E.

On the other hand, the update of the scoring algorithm as suggested...

Are the new factors writeen into a file or are they only displayed in the screen output?
In that case it is quite difficult not to lose any factor as it is scrolling quite quickly.

biwema

Hi Louie

it's a good idea to adapt the gimps p-1 code for sierpinski factoring.
Well done!

Nevertheless, I think, something does not work optimally, but I don't know what.

ecm.exe 24737...

Hi,

Here I have 2 candidates for the largest accepted gap:

candidate 1: between
1125875640686911 and
1126101624584753
Size: 225.98 G

1 factor expected every 64.9 G,

Hi,

Is there a version of SoBSieve available which is maybe a little bit slower then 1.33, but can handle factors beyond 281500 G like versioin 1.22?
At the moment 1.22 is only half as fast as...

Hi,

Finally I managed to find a 1P factor. On average one would expect 1 factor every 55 billion. But there was no factor in a range of 200G. I was even more surprised when I found 3 factors in...

Hi everyone,

As Louie suggested I’ve tried to find a 1P factor as well. This is quite tricky because they become quite sparse. According to Phil’s calculations there are about 11 times fewer...