NFS@home - Number Field Sieve, поиск больших простых чисел Налаштування

[Rilian]

Проект "Number Field Sieve"

----------------------------------------------------------------------------------------------------------

• Официальный сайт
• Официальная статистика по команде "Ukraine"
• Статус серверов проекта
• статистика команды Ukraine на BoincStats.com

----------------------------------------------------------------------------------------------------------
ТОП-20 участников:

----------------------------------------------------------------------------------------------------------
Дата основания команды - 11.09.2009 Капитан - kid_a
----------------------------------------------------------------------------------------------------------
Для присоединения к команде Украины:
1. Загрузите BOINC менеджер (Если его у Вас еще нет!)
2. Перейдите в "расширенный вид"
3. Выберите сервис ---> добавить проект
4. Введите адрес проекта http://escatter11.fullerton.edu/nfs/
5. Введите свои регистрационные данные.
6. Найдите нашу команду. Она называется Ukraine и адрес ее статистики вы могли видеть выше.
7. Если есть доступные для загрузки задания Вы их получите и начнете расчеты.
----------------------------------------------------------------------------------------------------------
Новичкам: статья со скриншотами, как поставить и настроить BOINC-менеджер
----------------------------------------------------------------------------------------------------------
Полезная информация:
Для идентификации пользователя в BOINC могут служить 2 вещи:
1) пара e-mail/пароль
2) межпроектный идентификационный ID (Cross-project ID) - 32значное шестнадцатиричное число.

Если Вы пожелаете подключится ещё и к другому BOINC-проекту, то помните: чтобы не плодить новых аккаунтов при подключении к новому проекту или команде, нужно обязательно везде регистрироваться с одним и тем же Именем и EMAIL. если при регистрации в проекте указать другой e-mail , BOINC создаст новый аккаунт с тем же именем! В этом случае рекомендуется зайти во все ваши аккаунты и во все проекты и где надо поменять емейл на нужный. Через некоторое время ваши аккаунты сольются в один с одним cross-project-id.
----------------------------------------------------------------------------------------------------------


О проекте: ищет множители больших чисел. сайт периодически лежит. жмите F5 на нужных страницах

About NFS@Home
NFS@Home is a research project that uses Internet-connected computers to do the lattice sieving step in the Number Field Sieve factorization of large integers. As a young school student, you gained your first experience at breaking an integer into prime factors, such as 15 = 3 * 5 or 35 = 5 * 7. NFS@Home is a continuation of that experience, only with integers that are hundreds of digits long. Most recent large factorizations have been done primarily by large clusters at universities. With NFS@Home you can participate in state-of-the-art factorizations simply by downloading and running a free program on your computer.

Integer factorization is interesting from both mathematical and practical perspectives. Mathematically, for instance, the calculation of multiplicative functions in number theory for a particular number require the factors of the number. Likewise, the integer factorization of particular numbers can aid in the proof that an associated number is prime. Practically, many public key algorithms, including the RSA algorithm, rely on the fact that the publicly available modulus cannot be factored. If it is factored, the private key can be easily calculated. Until quite recently, RSA-512, which uses a 512-bit modulus (155 digits), was commonly used but can now be easily broken.

Many of the numbers that we are factoring are chosen from the Cunningham project. Started in 1925, it is one of the oldest continuously ongoing projects in computational number theory. The third edition of the book, published by the American Mathematical Society in 2002, is available as a free download. All results obtained since, including those of NFS@Home, are available on the Cunningham project website.

NFS@Home is hosted at California State University Fullerton, and is supported in part by the National Science Foundation through ACCESS resources provided by the Texas Advanced Computing Center, the San Diego Supercomputer Center, the National Center for Supercomputing Applications, and Purdue University under grant number DMS100027.

Ссылки по теме:

http://www.boinc.ru/forum/default.aspx?g=posts&t=299

Це повідомлення відредагував Rilian: Вчора, 16:44

[Rilian]

Последние новости

Connection issues
September 15, 2009, 10:30 PDT

The project is still running well thanks to BOINC's buffering mechanism, but the site is experiencing intermittent connection issues. Please be patient as we iron these out. Thanks!

5,353+ in postprocessing, next project
September 13, 2009, 22:45 PDT

5,353+ is now in postprocessing. A matrix with 11 million by 11 million elements was created and will take about 19 days to solve. The sieving of 6,316+ is nearing completion, and work units for the next project, the closely related Cunningham number 6,317+, are starting to go out.

2,2214L result, 5,353+ status, next project
September 11, 2009, 13:45 PDT

2,2214L is factored! The composite cofactor was the product of 87-digit and 104-digit primes. The sieving of 5,353+ is nearly complete. There are about 3000 work units still out, and I anticipate that they will trickle in over the next few days. The next project is 6316+1, which is also a Cunningham Project wanted number. Let's keep going!

BOINCstats!
September 10, 2009, 13:00 PDT

We are now included in BOINCstats! The linear algebra for 2,2214L is nearly 50% complete and is on track to finish in another day. The sieving of 5,353+ is still going well, so spread the word and let's move up the list!

2,2214L post-processing has started
September 9, 2009, 12:30 PDT

There remain a few 2,2214L work units out there, but there was sufficient sieving that they are not necessary for the final calculations. Although they will not be used, credit will be given for completing them. Filtering of the relations produced a matrix of 4.49 million x 4.49 million elements. This matrix should take about two days to solve, so we should have our first factors then. We have completed about half of the sieving of 5,353+, so keep crunching!