Привіт Гість ( Вхід | Реєстрація )

> The NEO Project
nikelong
Feb 23 2009, 16:47
Пост #1


Тера ранчер
**********

Група: Trusted Members
Повідомлень: 12 443
З нами з: 19-March 05
Користувач №: 92
Стать: Чол





The NEO Project

The NEO Project used the NEO-c (Network Exchange Operation for Charity) platform to participate in various computing challenges and projects, and would have donated any winnings to the charities specified by its users. The project was the first to use Microsoft's .NET architecture. The project ended unexpectedly before any results were found for the challenges below:
The project's first challenge was the RSA 576-bit factoring challenge. The project's first attemp to solve the challenge was through random guesses. For this attemp, volunteers generated 39,033,522 packets (.154885015296E+15 keys checked) for the project. The attempt ended on January 10, 2003. The project's second attempt, Phase 2, would have used a General Number Field Sieve (GNFS) algorithm.

The second challenge was the MD5 project. The MD5 encryption algorithm is widely used in business, secure websites, Unix systems, and the Internet. The challenge would have demonstrated MD5's vulnerability, forcing people who use it to develop a better algorithm. This project began on January 30, 2003, and was stopped on May 20, 2003, due to a lack of interest from the MD5 developers (who were outside of the NEO project). The challenge tested at least 0.53% of the MD5 keyspace.

The third challenge was the Tellurium project, a physics project in which space-time geometry, specifically Isaac Newton's Equivalence Principle (see a simpler explanation), would be tested with the handedness or chirality property of matter. The principle has never been tested this way: if the test had caused it to fail, then Albert Einstein's General Relativity theory would be shown to be subtly incorrect. This challenge began on May 9, 2003, but the alpha client for the challenge was never publicly released.

The fourth challenge was World TSP, a study of the Traveling Salesman Problem. This challenge attempted to find the shortest route which visits all 1,904,711 populated cities and towns on Earth. "The current best lower bound on the length of a tour for the World TSP [was] 7,510,666,782 (Kilometers)." This bound was established on June 18, 2002. The challenge used an evolving artificial intelligence algorithm to attempt to beat that bound. With 97,820 total routes completed, the shortest route discovered was 13,802,932,609 Kilometers.

В общей сложности в проектах было примерно 50 000 участников...

Це повідомлення відредагував nikelong: Mar 10 2009, 00:28
User is offlineProfile CardPM
Go to the top of the page
+Quote Post
 
Reply to this topicStart new topic
Відповідей(1 - 2)
Creatormaster
Oct 13 2010, 22:10
Пост #2


Соромлюсь щось писати
*

Група: New Members
Повідомлень: 9
З нами з: 15-May 10
Користувач №: 1 392
Стать: Чол
Парк машин:
4 компа. 3 - старые пни,но один новый на core i7 920 с частотой 4500мгц



А на русский/украинский было перевести лень?


--------------------
User is offlineProfile CardPM
Go to the top of the page
+Quote Post
nikelong
Oct 13 2010, 22:13
Пост #3


Тера ранчер
**********

Група: Trusted Members
Повідомлень: 12 443
З нами з: 19-March 05
Користувач №: 92
Стать: Чол



Да, ибо мой английский очень слаб, а позорище машинного перевода вешать на форум я не буду (!)


--------------------
User is offlineProfile CardPM
Go to the top of the page
+Quote Post

Reply to this topicStart new topic
1 Користувачів переглядають дану тему (1 Гостей і 0 Прихованих Користувачів)
0 Користувачів:

 



- Lo-Fi Версія Поточний час: 29th March 2024 - 06:51

Invision Power Board v1.3.3 © 1996 IPS, Inc.