The message boards have been quiet for some time now, so I thought I should give a quick status report. The 2nd search over Q(sqrt(5)) is about to enter the final stage. Since run times go up geometrically with discriminant, this final stage will take some time (~6 months). At the same time we will be picking off some of the low hanging fruit for the next search over Q(sqrt(2)), which will allow us to compute timing info for the later stages of that search.
Thank you for all your contributions!

Well, with more chrunchers we could speed up this project a whole lot faster.

So, how do we get more chruchers to contribute to this project?

(These kind of projekts should probably not take more than a year to finish with a hell lot of chrunchers.)

:)

Well, with more chrunchers we could speed up this project a whole lot faster.

So, how do we get more chruchers to contribute to this project?

(These kind of projekts should probably not take more than a year to finish with a hell lot of chrunchers.)

:)

With enough crunchers we could probably finish a search in less than a year. But there is a search for every combination of prime numbers (we are currently doing the set {2,5}), so the number of searches are limitless.

During the recent SETI challenge, we had twice as many TFLOPS, which made a noticeable difference. We are currently looking into porting the app to GPUs and ARMs (not just for smart phones, but also for the parallela), which should help to increase our TFLOPS.

We are currently looking into porting the app to GPUs and ARMs (not just for smart phones, but also for the parallela), which should help to increase our TFLOPS.

good news eric!

if you need testers..