Project Updates

[Abruraspingi]

Looks like the team consists of about 34 members and they have plenty of credits. Looks like it was from a while ago. I assum two members have received or attempted to receive credits recently and that's why it's only showing two.

but this is weird

[tazzduke]

Also turns out that Numberfields is a project for the BOINC Pentathlon this year.

[chooka03]

Looks like the team consists of about 34 members and they have plenty of credits. Looks like it was from a while ago. I assum two members have received or attempted to receive credits recently and that's why it's only showing two.

but this is weird

Yes I thought I'd give it a day or 2 to wash out but I don't think it's changing.
I will ask the question on the forum if it still looks odd.

[chooka03]

Who knows, I cannot even get to Numberfields website, it just keeps timing out.

I tried going to the project page via BOINC but it failed too. When I googled it, it worked.


https://numberfields.asu.edu/NumberFields/

[Dingo]

NumberFields@home: 2024 Year End Summary
The main highlights this year were:

1. We spent the majority of the year on row 14 for the subfield 6 searches. Row 14 is now in the "essentially complete" phase, with only 14x12 left. Only 2 more rows to go!

2. Subfield 7, which is essentially complete, continues to be chipped away by Gerasim. No new fields were found, but with 7 of the 25 congruences completed, the evidence that we are indeed complete continues to mount.



Looking ahead to 2025, the main goal will be to complete row 15 (except last column) for subfield 6. This will get row 15 to the "essentially complete" phase.



Thanks everyone for your contributions and have a wonderful New Year!
1/01/2025 6:39:45 AM  1-NuucBoxG3    more...

[Dingo]

NumberFields@home: Thank you to Formula BOINC Challenge participants.
I'd like to thank all the participants of the recent FB Sprint Challenge. As always, many good results were returned over the 3 day period, and are much appreciated!
1/06/2025 5:38:15 PM · more...

[chooka03]

Just FYI...... 22 days until Team GPU Users Group overtake us.

I might have to throw some hardware at this soon.

 

[Dingo]

I am away for a week but have put my three GPU's on it for today and tomorrow before I go.

[Dingo]

[NumberFields@home] New Faster Apps Coming Soon
New optimized versions of the GetDecics app have been discussed in other threads, but I thought it best to start a new thread.

First, a thank you to Alperen for optimizing the current apps. Yes, he used Claude, but that's not necessarily a bad thing. I don't have the experience required or the time to learn the AVX tricks that were used here. So without Alperen and Claude, this probably never would have happened.

I have spent many hours going through the new code. The original code was basically left untouched, and the change was in the addition of a new subroutine that pre-filters the polynomials prior to the normal processing chain. This leaves just the one subroutine that needs validation. From a theoretical perspective, the method is sound. The method can be decomposed into 2 parts:


1. The first part was a simple trick (I wish I had seen this myself!) that allows us to deal with the polynomial discriminant modulo a small set of primes. This eliminates the need for the multi-precision integers that were growing to ~1000 bits, and gives the first speed improvement. This was simple enough I could independently code it up myself using Pari's built-in functions. In some offline tests I was seeing a speed improvement of between 2 and 3, just for this simple change.

2. The second improvement was in the coding of the resultant modulo q. This was essentially done in parallel using AVX2, which allows resultants to be computed for several primes simultaneously. This is the part that is very tricky and hard for me to follow. I welcome any expert in this kind of optimization to look at the code. Alperen has made it public here:
https://github.com/alplix/passiflora


So the method in general is sound, but the second part was hard for me to validate. For this reason, I will use sufficient testing to validate the new apps. The idea is to test each new app version on ~1000 old cases which can be taken as truth. This will be done using the "testDecics" app that was recently created. When an app is deemed good, it will be transitioned into an official app.

I will be creating a new app called fastGetDecics where the new validated apps will go. This will still allow me to keep the results separate. It will also allow me to create new WUs for the fast apps that will not put a burden on the server, while retaining older style WUs for the legacy apps. This will give me time to test and migrate the fast apps in pieces rather than all at once. App versions for the original GetDecics will be deprecated once the corresponding fast version has been deemed trustworthy.

View article · Fri, 16 Oct 2026 18:24:26 +0000

[Abruraspingi]

That's exciting. Someone else was working on WU's compatible with ARM, hopefully they can get incorporated as well