From the front page:

The final results of this project will be complete tables of number fields. The results are given in table form or as a searchable database.

I assume this means that this project has a finite run time, and not open ended. Approximately how long will this take to complete? A month, year, 10 years? Just looking for a ballpark.

Thanks!

---

Reno, NV
Team: SETI.USA

Hi zombie67,

Technically speaking, the project could go on forever, as our searches depend on field degree and ramified primes. Right now we are concentrating on degree 10 fields. After that, we could move on to higher degrees. We also sort fields by ramified primes. So for each set of primes, the search will be finite, but there are an unlimited combination of primes.

To give you an idea of the time required for a specific case, part of my dissertation found all degree 10 fields ramified over the set {2,3}, and this would have taken about 5 years on a single cpu (it took 60 days using boinc, but the total run time summed over all hosts was 4.7 years).

Thanks,
Eric

Thanks!

---

Reno, NV
Team: SETI.USA

Good day.

Eric, may we have some progressbar or ETA for each field set?

Like "total wus" / "wus crunched in previous day" = days left

or something like this.

this is interesting for crunchers.

Good day.

Eric, may we have some progressbar or ETA for each field set?

Like "total wus" / "wus crunched in previous day" = days left

or something like this.

this is interesting for crunchers.

Yeah, I could do something like that. Do you know any other projects that do this, so I can try to mimic what they do? I'm thinking the server status page might be the best place to put the information, because the type of db access that would be required is already being done in that piece of code.

Eric

like SIMAP?

http://boincsimap.org/boincsimap/batchmonitor.php

like SIMAP?

http://boincsimap.org/boincsimap/batchmonitor.php

Thanks Frank.

Can you guys give an example of possible application in math research that these tables we are computing will help? I know it will be in algebraic number theory, but I would like a more concrete example. Or some reference of related research will also be fine.

Cheers,
fwjmath.

I plan to create a separate page that describes the project in more detail, including applications of the results. I am still several weeks away from getting that done.

One application would be in the realm of automorphic forms. For example, the table could be used to determine whether or not certain automorphic forms with special properties existed. I give one such example in my dissertation. I just realized I dont have a link to that from the main page - I will add that in the next several days.

I hear that there are also potential applications to cryptography, but I myself don't know about that. This is something I will look into and include it in my description page.

Thanks for your interest in the project!

For those that are interested, I did add a link to my dissertation. Its at a pretty high level, but should be readable by anyone with a math degree or who has taken an abstract algebra course (and knows about groups, rings, and fields).