标题: 数学类项目技术新闻总帖(更新于2008.5.1)
  本主题由 fwjmath 于 2007-10-30 16:29 置顶 
fwjmath
超级版主
Rank: 6Rank: 6
Strasbourg~~~


UID 5458
精华 7
积分 2434
帖子 2127
阅读权限 101
注册 2005-5-22
来自 广东佛山
发表于 2007-1-13 08:30  资料  主页 短消息  加为好友  添加 fwjmath 为MSN好友 通过MSN和 fwjmath 交谈 QQ
数学类项目技术新闻总帖(更新于2008.5.1)

本帖是数学类项目技术新闻总帖,谢绝跟贴,对于新闻的讨论请另开主题。本主题非新闻跟贴将被删除。如果我没有及时更新某项项目的新闻,而您又觉得这个项目的新闻很迫切需要添加的话,请将其直接翻译并附到回帖,我回来的时候就会尽快更新,而大家也可以及时看到最新的新闻,又可以保持一个项目新闻的有序性。谢谢!
由于数学类项目相对较多而各项目新闻相对较少,故将其归类到同一个帖子内。
关于各项目背景、参加方法等,请参阅置顶帖中的相关主题和帖子,当然您也可以利用论坛搜索来搜索您想要的内容。

本帖收集新闻的项目及来源有:
GIMPS     (http://www.mersenne.org/status.htm
Distributed.net     (来源不确定,大部分为distributedcomputing.info)
Seventeen Or Bust     (www.seventeenorbust.com
Primegrid     (www.primegrid.com
RieselSieve(BOINC)     (boinc.rieselsieve.com)
ABC@home(包含beta)     (abcathome.com)
SZTAKI Grid    (http://szdg.lpds.sztaki.hu/szdg/
Pi Segment    (www.pisegment.net
Rectilinear Crossing Number     (http://dist.ist.tugraz.at/cape5/
Sudoku     (http://dist2.ist.tugraz.at/sudoku/

直接点击项目名称就可在新窗口上直接打开对应帖子。
如果您发现新的新闻,或者认为有值得加入新闻列表的项目,又或者有什么好的建议的话,请用论坛短信息告知,谢谢!

这些项目另有分开的新闻帖如下:
[分享] PrimeGrid 项目新闻

[url=http://www.equn.com/forum/thread-17030-1-1.html][SoB News]11TH PRIME FOUND! ONLY 6 REMAIN![/url3

[ 本帖最后由 fwjmath 于 2008-5-1 05:54 编辑 ]





顶部
fwjmath
超级版主
Rank: 6Rank: 6
Strasbourg~~~


UID 5458
精华 7
积分 2434
帖子 2127
阅读权限 101
注册 2005-5-22
来自 广东佛山
发表于 2007-1-13 08:36  资料  主页 短消息  加为好友  添加 fwjmath 为MSN好友 通过MSN和 fwjmath 交谈 QQ
GIMPS

December 31, 2007: All exponents below 20,000,000 tested at least once.
2007.12.31:所有低于 20000000 的指数都已经被测试过至少一次。

December 3, 2007: All exponents below 16,000,000 double-checked.
2007.12.3:所有低于16000000的指数都已经被复查过。

April 23, 2007: All exponents below 15,000,000 double-checked.
2007.4.23:所有低于15000000的指数都已经被复查过。

October 24, 2006: All exponents below 18,000,000 tested at least once.
2006.10.24:所有低于 18000000 的指数都已经被测试过至少一次。

September 11, 2006: All exponents below 14,000,000 double-checked.
2006.9.11:所有低于 14000000 的指数都已经被复查过。

September 4, 2006: Prime M(32582657) discovered!!
2006.9.4:发现 M(32582657)=2^32582657-1 是质数!

July 10, 2006: Double-checking proves M(13466917) is the 39th Mersenne prime.
206.7.10:复查证明 M(13466917)=2^13466917-1 是第 39 个梅森质数。

[ 本帖最后由 fwjmath 于 2008-1-8 02:21 编辑 ]





顶部
fwjmath
超级版主
Rank: 6Rank: 6
Strasbourg~~~


UID 5458
精华 7
积分 2434
帖子 2127
阅读权限 101
注册 2005-5-22
来自 广东佛山
发表于 2007-1-13 08:38  资料  主页 短消息  加为好友  添加 fwjmath 为MSN好友 通过MSN和 fwjmath 交谈 QQ
Distributed.net

version 2.9013.500 of the distributed.net client is available for most major platforms as of October 22. Also, the project held a code-a-thon at the end of October to begin the preparation and internal development of a new project. The project will run in parallel with RC5-72 and OGR-25. More information about the new project will be available in the next few months.
客户端推出新版本 v2.9013.500。

For the last week and a half things have been very busy for us behind the scenes at distributed.net! That is because we hosted an official "code-a-thon" event here in Austin, Texas in order to help kick off the preparation and internal development of a new project!
Although we're not prepared to say much more about the new project quite yet, we can say that it will be operated in parallel to the existing RC5-72 and OGR projects. We hope to provide more information and begin rolling out the project in the next couple months.
将会有新的子项目,这个子项目将会与现存的 RC5-72 和 OGR-25 同时进行。在将来的几个月会有更多的关于此项目的消息。

关于进度:
RC5-72:
Total Blocks to Search: 1,099,511,627,776
Total Blocks Tested: 4,941,880,681
Percent Complete: 0.449%

OGR-25:
Percent Complete (Phase 1): 100.00%
Percent Complete (Phase 2): ~74.01%

Similarly for OGR-25, there was a phase 1, and then there are nine sub-phases in phase 2.

Phase 1 (aka "OGR25 classic"): 6-diffs stubs (len <= 70) belong to the OGR contest. Completed!
Phase 2 (aka "OGRp2-25" sub-phases 1 thru 5): 6-diffs stubs (70 < len <= 95). Extension to the OGR contest. Subdivided into five chunks for manageability:
48979672 6-diffs stubs : 70 < stub-length <= 81 Completed!
42196852 6-diffs stubs : 81 < stub-length <= 86 Completed!
47775232 6-diffs stubs : 86 < stub-length <= 90 Completed!
46417392 6-diffs stubs : 90 < stub-length <= 93 In Progress
36267180 6-diffs stubs : 93 < stub-length <= 95 In Progress
(Total : 221636328 6-diffs stubs.)
Phase 2 (aka "OGRp2-25" sub-phases 6 thru 7): 5-diffs stubs (len < 112, the client places the 7th mark at a position > 95). Subdivided into two chunks for manageability:
38361468 5-diffs stubs : 0 < stub-length <= 98 In Progress
38106790 5-diffs stubs : 98 < stub-length <= 111 In Progress
(Total : 76468258 5-diffs stubs.)
Phase 2 (aka "OGRp2-25" sub-phase 8): 4-diffs stubs (len < 122, the client places the 6th mark at a position >= 112). Unstarted (Total : 6515212 4-diff stubs.)
Phase 2 (aka "OGRp2-25" sub-phase 9): 3-diffs stubs (the client places the 5th mark at a position >= 122). Unstarted (Total : 237944 3-diffs stubs.)
(Total : 304857742 OGRp2-25 stubs.)

[ 本帖最后由 fwjmath 于 2007-11-15 03:20 编辑 ]





顶部
fwjmath
超级版主
Rank: 6Rank: 6
Strasbourg~~~


UID 5458
精华 7
积分 2434
帖子 2127
阅读权限 101
注册 2005-5-22
来自 广东佛山
发表于 2007-1-13 08:44  资料  主页 短消息  加为好友  添加 fwjmath 为MSN好友 通过MSN和 fwjmath 交谈 QQ
Seventeen Or Bust

Seventeen Or Bust

11TH PRIME FOUND! ONLY 6 REMAIN!
(posted by louis helm)  Tuesday, 30 Oct 2007  
33661^7031232+1 is prime! The double checking effort uncovered this new prime showing once again why it is so important to conduct these kinds of re-testing efforts. The large majority of tests completed are eventually verified but some need a 3rd test and others like this one end up being prime. The discoverer, Sturle Sunde is a giant in the prime searching world. He is the #2 overall contributor to SB and also the #4 all-time contributor to GIMPS!
This result was reported at 2:03PM EST, October 13th. We've checked and re-checked the primality several times and have recently submitted it to The Prime Page so the current 10th largest prime [2,116,617 digits] can be recorded and certified.
Sturle is a member of team Busty Seventeen... and actually he hasn't yet been officially notified about the prime because he was out-of-town today when I tried to call him in Oslo, Norway. ;) MORE INFO COMING HERE SOON!! Meanwhile feel free to comment in the forums!

发现了第十一个质数!只剩下六个了!
33661^7031232+1 是质数!在复查行动中我们再次发现了一个质数,这表明了复查其实是很重要的。虽然在复查中绝大部分的测试都被验证为正确,但是有一些也需要进行第三次测试,也有另一些像这个一样得到了一个质数。这个质数的发现者 Strule Sunde 在分布式质数搜索方面是强人,他在我们这个项目是第二大贡献者,在 GIMPS 是第四大贡献者!
这个发现是在 10 月 13 号 EST 2:03PM 报告到服务器的。我们已经重复检查了好几次它的素性,而且已经提交到 Prime Pages 了。这是迄今为止发现质数当中第十大的(2,116,617 位),这已经被 Prime Pages 确认了。
Sturle 是 Busty Seventeen 的一员...而且他现在还没有被正式通知发现了质数,因为今天我想通知在挪威的奥斯陆的他,但是他出去了。后续将会有更多报道!现在请随意来论坛发表感想!

10TH PRIME DISCOVERED!!!!!
(posted by louis helm)  Saturday, 05 May 2007  
19249 * 2^13018586 + 1 is prime!!!! SB has done it again, discovering a new largest ever non-Mersenne prime. This latest result was submitted at 00:33 EST on March 26th by Konstantin Agafonov, a member of team TSC! Russia. Konstantin is from Korolev, Russia where he works as a systems administrator for a construction company.
Before joining SB, Konstantin participated in other DC projects like Find-a-Drug, where he was the 5th largest overall contributor! Konstantin says he has used up to 100 computers on SB. This particular prime was found on one of his 3GHz Pentium 4s running Windows.
To read more about the discovery, check out the official Press Release.
Thanks to all our dedicated number crunching volunteers... some of whom have been crunching for five years now! Every one of you helped make this discovery possible! Congratulations and Happy Cinco de Mayo!

发现了第十个质数!!!
19249 * 2^13018586 + 1 是一个质数!!!SOB 又发现了一个新的最大的非梅森质数。这个结果是在 2007.3.26 00:33 EST 由 TSC! Russia 队的 Konstantin Agafonov。 Konstantin Agafonov 来自俄罗斯的 Korolev,他的工作是一个建筑公司的系统管理员。在加入 SOB 之前,他曾经参加过其它分布式计算项目,比如说 Find-a-Drug。他在那里可是第五大的贡献者!他说他在 SOB 上投入了 100 多台计算机。这个质数是由他的一台 P4 3.0G Windows 机器上发现的。想要知道贡多,请参阅官方报告。感谢所有投入精力计算的志愿者,你们当中有的可能已经参加这个项目 5 年了!是你们所有人使这个发现变得可能!祝大家 Cinco de Mayo 节快乐!


关于客户端:
SB v2.5 released
SB v2.5.0 is now available for Win32 and Linux (and FreeBSD!) on the download page.
Changes:
faster SSE2 code for A64/P4 processors
fixes known bug with old x87 CPUs that don't support prefetch
suppors FFTs up to 32 million

请参看以下主题:
http://www.equn.com/forum/viewthread.php?tid=9037&fpage=1

关于进度:
k            总测试数        状态(正在运行的测试数与正在测试的最大指数)
4847      47832 tests    prime found: 4847•2^3321063+1
5359      26615 tests    prime found: 5359•2^5054502+1
10223    85560 tests    671 tests 10133176 14302661
19249    30177 tests    prime found: 19249•2^13018586+1
21181    72906 tests    560 tests 11543659 14306900
22699    30144 tests    247 tests 12768309 14319838
24737    78194 tests    595 tests 12381606 14308807
27653    28049 tests    prime found: 27653•2^9167433+1
28433    18687 tests    prime found: 28433•2^7830457+1
33661    72871 tests    327 tests 11047415 14275944
44131    2965 tests      prime found: 44131•2^995972+1
46157    534 tests        prime found: 46157•2^698207+1
54767    4670 tests      prime found: 54767•2^1337287+1
55459    103280 tests  757 tests 10491717 14322298
65567    167 tests        prime found: 65567•2^1013803+1
67607    25937 tests    240 tests 12701546 14296131
69109    865 tests        prime found: 69109•2^1157446+1

[ 本帖最后由 fwjmath 于 2007-10-31 16:11 编辑 ]





顶部
fwjmath
超级版主
Rank: 6Rank: 6
Strasbourg~~~


UID 5458
精华 7
积分 2434
帖子 2127
阅读权限 101
注册 2005-5-22
来自 广东佛山
发表于 2007-1-13 08:47  资料  主页 短消息  加为好友  添加 fwjmath 为MSN好友 通过MSN和 fwjmath 交谈 QQ
PrimeGrid

2008-04-30 13:55 UTC Sieve WU lengths increased
In an attempt to lower the size of the database, we have increased the WU length to both the PSP Sieve and GCW Sieve projects. WU's are now 1.5X as long...so a 6 minute WU now takes 9 minutes. Credit has been adjusted accordingly.
为了尝试减少数据库的大小,我们将 PSPSieve 和 GCWSieve 子项目的包都调成了原来的 1.5 倍。

2008-04-26 17:00 UTC Workunit deadlines increased
The deadlines for subprojects that have very long workunits have been increased to 12 days. The subprojects affected are Woodall Prime Search, Cullen Prime Search, 321 Prime Search and Prime Sierpinski Project (all LLR).
所有有 LLR 运算的子项目的上报期限都调整到了 12 天。

2008-04-18 15:05 UTC Mega Prime for 321 Search
On 23 Mar 2008 7:57:28 UTC, PrimeGrid, in collaboration with 321 Search, found another Mega Prime: 3*2^4235414-1
The prime is 1,274,987 digits long and enters The Largest Known Primes Database ranked 14th overall. This is 321 Searches's first mega prime and 11th prime overall. It is the second largest found mega-digit prime using LLR.
The discovery was made by Dylan Bennett of Canada using an Intel C2D @ 1.66 GHz with 2GB RAM. This computer took almost 15 hours and 30 minutes to complete the primality test.
PrimeGrid 和 321Search 联袂发现了另一个百万位质数:3*2^4235414-1(共 1274987 位)。这个质数在目前的最大已知质数数据库里边排名第十四,也是 321 Search 的第一个百万位质数和第十一个发现的质数,而且还是第二个用 LLR 找到的百万位质数。
这个发现是由加拿大的 Dylan Bennett 的一台 Intel C2D@1.66G + 2G RAM 上做出的,素性检测花了 15.5 小时。

2008-04-10 17:40 UTC PSP finds Mega Prime
The Prime Sierpinski Project has discovered their first mega prime: 265711*2^4858008+1 (1462412 digits long). The project has now found 16 primes total. There are only 13 primes left to solve the Prime Sierpinski Problem.
PSP 子项目发现了它的第一个百万位质数:265711*2^4858008+1 (共 1462412 位)。现在这个子项目已经发现了 16 个质数了。再有 13 个的话就能解决谢尔品斯基质数问题了。

2008-03-02 15:00 UTC 64bit Linux sr2sieve
A 64bit Linux sr2sieve application has been released for the Prime Sierpinski Problem sieve. For more information, please see the forum post.
大家期待已久的子项目 Prime Sierpinski Problem sieve 的 64bit Linux sr2sieve 程序终于出来了!

2008-02-18 10:15 UTC 64bit Linux gcwsieve
I know some of you were eagerly awaiting this. Well, the time has come - we now started testing 64bit Linux gcwsieve application. For more information, see the forum thread.
大家期待已久的 64bit Linux gcwsieve 程序终于出来了!

2008-02-15 15:23 UTC End of the life cycle of primegen application
We are inserting the final batches of work for our oldest available application, primegen. While primegen has proved to be very useful in the early project stages for infrastructure testing, it has served it's purpose and it's time to make way for newer, more efficient applications. Once the final batches are completed the cleanup will be executed, finally removing old stuck workunits.
We suggest participants running primegen exclusively also select an additional subproject for future processing. Sieve subprojects are very similar to primegen in size, so it is probably a good choice. Once there are no more primegen work to send, we will update project for such participants to select sieve subprojects.
我们添加了 PrimeGen 这个 PrimeGrid 最“古老”的程序的最后一批工作包。在项目早期的测试中 PrimeGen 被实践证明了对于测试非常有用,但现在它已经结束了它的使命,要让位于更新更快的程序了。这批工作包完成之后,清理工作会马上开始,然后所有的老工作包的信息都会被清除出数据库。
我们建议只运行 PrimeGen 的用户选择另外一个子项目进行将来的计算。筛选类的子项目在工作包大小上与 PrimeGen 大小相似,所以它们应该是不错的选择。在 PrimeGen 的所有工作包结束之后,我们会更新项目,让原来只运行 PrimeGen 的用户选择筛选类的子项目。

2007-12-29 21:05 UTC Record breaking Woodall prime
On 21 Dec 2007, 10:09:30 UTC, PrimeGrid's Woodall Prime Search found the 33rd and largest known to date Woodall prime:
3752948*2^3752948-1
The prime is 1,129,757 digits long and enters The Largest Known Primes Database ranked 1st for Woodall primes and 13th overall. It's the first found mega-digit prime using LLR.
The discovery was made by Matthew J. Thompson of the United States using an Intel P4 @ 2.8 GHz with 512MB RAM. This computer took almost 15 hours and 11 minutes to complete the primality test.
在 2007 年 12 月 21 日 10:09:30 UTC,我们的 Woodall 质数搜索发现了第 33 个也是迄今为止最大的一个 Woodall 质数:3752948*2^3752948-1。
这个质数的十进制表示长度为 1129757 位,被收入了已知大质数数据库,大小在已找到的 Woodall 质数中排第一,在所有已找到的最大质数中排第 13。这是第一个用 LLR 发现的“百万位级”的质数。这个发现是在位于美国的 Matthew J. Thompson 的一台 Intel P4 2.8G, 512MB 的机器上得到的。这台机器用了 15 小时 11 分钟完成了素性测试。

2007-12-05 17:45 UTC New subproject available
We have released the LLR application for the 321 Search. 321 is attempting to find a mega prime in the form 3*2^n-1. The 4+ year old project currently holds the largest non-GIMPS/non-Seventeen or Bust prime.
As usual, you can choose to crunch work for this project by visiting your project preferences page. Supported platforms: 32bit Linux & Windows.
我们已经发布了用于 321 Search 项目的 LLR 程序。321 Search 项目旨在寻找形如 3*2^n-1 的大质数。这个四年多前开始的项目目前保持着最大的非 GIMPS 和非 SoB 质数的记录。与往常一样,您可以在项目参数设置页选择是否接受这个子项目的工作。目前支持平台:32bit Linux 与 Windows。

2007-10-30 9:45 UTC Automatic reporting to the Prime Pages available
From now on you can give permission to PrimeGrid to report the primes you find to the Prime Pages on your behalf. To do this, go to the project preferences page and enter your data.
从现在起您可以授权 PrimeGrid 当您发现质数的时候代表您向 Prime Pages 报告。如果您想这样做的话,请到项目偏好设置页面输入您的信息。

2007-10-14 12:15 UTC Linux LLR available!
Good news for Linux lovers - with the help from our user Der Meister we have released 32bit Linux LLR application for Twin Prime Search project. If it goes well, it will be released for Cullen/Woodall Prime Search, too. The 32bit application is also being sent to 64bit hosts.
Linux 爱好者的好消息:在用户 Der Meister 的帮助下我们发布了用于孪生质数搜索的 32bit Linux LLR 客户端。如果一切顺利的话,用于 Cullen/Woodall 质数搜索的程序也会出来。我们也将这个 32bit 的程序发送到 64bit 的机器上。

2007-10-13 14:15 UTC Prime Sierpinski Project sieve available
We have released Sieve application for Prime Sierpinski Project. It is trying to solve the Prime Sierpinski Problem. Windows 32bit and 64bit versions are supported. As usual, you can choose to crunch work for this project by visiting your project preferences page.
我们发布了一个 Prime Sierpinski Project 的筛选程序,这是用于解决谢尔宾斯基质数问题的(注:与SOB目标相近)。Windows 32bit 和 64bit 版本都有。按照惯例,您可以在项目参数设置页选择是否接受这个子项目的工作。

2007-09-30 16:15 UTC LLR Cullen percentage reporting bug fixed
Thanks to Bryan from Riesel Sieve, the Cullen workunit progress reporting bug has been fixed. The workunits running application version 5.08 should correctly display feedback during processing.
感谢 Riesel Sieve 的 Byran,Cullen 工作包的进度报告中的 Bug 已经被修复了。5.08 版的程序应该可以正确显示进度了。

2007-09-29 15:30 UTC 64bit sieving application available
A 64bit Windows version of GCW sieve application has been released. It improves speed twice comparing to 32bit version. The new application is automatically sent to hosts running 64bit version of BOINC that have sieving subproject enabled in the project preferences.
我们发布了一个针对 64bit Windows 的 General Cullen/Woodall 筛选程序。相对于 32bit 的程序,它的速度提高了2倍。新客户端会被自动发送到运行 64bit 版本的 BOINC 的接受该子项目任务的机器上。

2007-09-15 18:35 UTC Cullen/Woodall Sieve available
We have released a sieving app for Cullen/Woodall Prime Search. Sieving will help to greatly reduce the amount of probable primes, therefore speeding up the actual prime search. You can choose to run sieve application by visiting project preferences page; please have in mind that the application has just been released, so it may have bugs or issues (although we haven't noticed any).
Supported platforms: Windows 2000/XP/2003/Vista.
我们推出了一个针对 Cullen/Woodall 质数搜索的筛选程序。预先筛选可以大大减小工作量,从而加快搜索的速度。您可以在参数设置页中进行设置从而启用这个程序。但是要注意的是因为这个程序刚刚推出,所以可能会有 bug(尽管我们还没有观察到)。支持平台:Windows 2000/XP/2003/Vista

2007-09-03 15:00 UTC Record Woodall prime number found... again!
On 20 Aug 2007, 2:40:57 UTC, PrimeGrid's servers returned a positive result in the Woodall Prime Search. It was the double check validating that a Woodall prime was found on 13 Aug 2007, 1:42:08 UTC.
2367906*22367906-1
This is the 32nd and largest known to date Woodall prime. It is 712818 digits long and enters The Largest Known Primes Database (http://primes.utm.edu/primes/) ranked 1st for Woodall primes and 25th overall.
The discovery was made by Stephen Kohlman of Canada using an Intel C2D 6300 @ 1.86 GHz with 1 GB RAM. This computer took a little over 5 hours and 41 minutes to test using the LLR program. Stephen is a member of Team Canada.
在2007年8月20日,PrimeGrid的服务器接收到了一个 Woodall 质数搜索的可能发现报告。这是一个复查,确认在2007年8月13日发现的候选目标 2367906*2^2367906-1 的确是一个质数。这个质数有 712818 位十进位,是迄今为止发现的最大的 Woodall 质数,也是迄今为止发现的第 25 大的质数。这个发现是由加拿大的 Stephen Kohlman 的一台C2D 6300 @ 1.86G 1GB 做出的。Stephen Kohlman 是 Team Canada 小组的一员。

2007-08-09 18:00:00 UTC    Record Woodall prime number foundfrom PrimeGrid
On 7 Aug 2007, 15:25:07 UTC, PrimeGrid's servers returned a positive result in the Woodall Prime Search. It was the double check validating that a Woodall prime was found on 4 Aug 2007, 19:36:57 UTC. 2013992*2^2013992-1 The prime is 606279 digits long and enters The Largest Known Primes Database (http://primes.utm.edu/primes/) ranked 1st for Woodall primes and 37th overall. The discovery was made by Lasse Mejling Andersen of Denmark using an Intel Celeron 2.80 GHz with 512 MB RAM. This machine took a little over 3 hours and 27 minutes to test using the LLR program. For more details, please see here.
在2007年8月7日,PrimeGrid的服务器接收到了一个 Woodall 质数搜索的可能发现报告。这是一个复查,确认在2007年8月4日发现的候选目标 2013992*2^2013992-1 的确是一个质数。这个质数有 606292 位十进位,是迄今为止发现的最大的 Woodall 质数,也是迄今为止发现的第 37 大的质数。这个发现是由丹麦的 Lasse Mejling Andersen 的一台赛扬 2.8G 512MB 做出的。这台机器用了 3 小时 27 分钟来通过程序判断出这个数是一个质数。详细情况参见这里

2007-07-03 17:16:20 UTC   New subproject added
We have added a new prime search project, Cullen/Woodall prime search. These primes are of forms n*2n+1 and n*2n-1 respectively. Our goal is to find the biggest Cullen and Woodall primes ever. This isn't as easy as it may sound, only 12 Cullen primes and 15 Woodall primes have ever been found, however, we believe that PrimeGrid has sufficient computing power to make this search plausible.
It is now possible to choose the subprojects you would like to run in project preferences page. Please note that when you are using account managers your choice may be reset when changing resource share allocation.
我们添加了一个新的子项目,就是 Cullen/Woodall 质数搜索。Cullen/Woodall 质数分别就是形如 n*(2^n)+1 和 n*(2^n)-1 的质数。我们的目标就是要找出打破纪录的这种质数。这并不像看起来那么容易,到现在为止也只发现了 12 个 Cullen 质数和 15 个 Woodall 质数。然而,我们相信 PrimeGrid 拥有足以进行这个搜索的计算能力。
现在在项目的参数设置页中可以设置参加的子项目。注意,如果你使用 Account Manager 来调整参数的话,当资源分享数改变的时候你的设置将被重置。

2007-04-22 13:32:59 UTC   64bit support
PrimeGrid scheduler has been upgraded to support upcomming official 64bit client (Windows only). The scheduler will send 32bit applications to 64bit hosts that run the client which sends alt_platform tag in the scheduler request (expected to be present in version 5.9.5 - version 5.9.4 has it, but it sends invalid data).
PrimeGrid 的任务调度器已经升级来迎接新的 64 位程序(仅限 Windows )。任务调度器暂时会将 32 位程序发送到 64 位的主机上(BOINC 版本应该在 5.9.4 以上,5.9.4 发送的信息不正确)。

2007-2-28 21:19:00 UTC  100!
PrimeGrid has reached the milestone of 100 primes reported to the Prime Pages. Thanks to all crunchers who made this possible! Also, please check your mailbox, it is really possible that you received an email asking to report the primes you found, and put your name into the top 5000 list of biggest prime numbers of all times.
PrimeGrid 到现在为止已经发现了100个质数。感谢所有的计算者,是你们使这件事成为可能!同时,请你们检查一下你们的邮箱,可能会有要求你报告质数的邮件,只要你成功地报告了质数,你就可以将你的名字放入最大的5000个已发现质数的列表中。

2007-02-11 19:05:47 UTC   LLR Application Updated
LLR application has been updated to version 5.06. It should fix the occasionally popping up LLR window on some systems. Your BOINC will get updated application automatically.
LLR程序已经被更新到5.06版,这次的更新应该会修复在某些系统时不时会弹出窗口的Bug。你的BOINC将会自动更新该程序。

2007-01-16 18:46:59 UTC   Twin Prime Search and PrimeGrid finds world's largest twin primes
On January 15, 2007, the Twin Prime Search (TPS) project in collaboration with PrimeGrid (BOINC platform) found the largest known twin primes, 2003663613*2^195000-1 and 2003663613*2^195000+1. The two primes are 58711 digits long.
The discoverer is Eric Vautier, from France.
The credits of the discovery go to two projects: TPS and PrimeGrid and to the following people: Eric Vautier (France), Dmitri Gribenko (Ukraine), Patrick W. McKibbon (USA).
The project has been coordinated by the following people: Michael Kwok (USA), Andrea Pacini (Italy) and Rytis Slatkevicius (Lithuania).
The discovery has been made using the LLR primality testing program and NewPgen sieving program. Special thanks to all the contributors.
在 2007.1.15,与我们合作的 Twin Prime Search 项目找到了已知最大的一对孪生素数:2003663613*2^195000-1 和 2003663613*2^195000+1。这两个数均有 58711 位。
后面是鸣谢,就不翻译了~~~

2007-01-15 11:39:24 UTC   TPS status update
The Twin Prime Search project, currently in testing in PrimeGrid, has successfully found a twin prime, therefore no work will be issued in testing subproject PrimeGrid for some time. The older primegen application will continue running. More information to follow later.
在 PrimeGrid 上测试的 Twin Prime Search 项目成功发现了一对孪生素数,所以这个测试的子项目将会停止一段时间。老的 primegen 程序仍将继续运行。请关注后续新闻。

2006-12-22 16:07:02 UTC   Twin Prime Search LLR application update
An updated LLR application for Twin Prime Search subproject has been released. This version should fix the two main problems: LLR window that pops up randomly, and suspending/termination issues.
我们对 Twin Prime Search 子项目的 LLR 程序进行了更新。新版本修复了两个主要问题:时不时弹出的 LLR 窗口和关于暂停/终止的问题。

2006-11-26 10:28:35 UTC   New Application Testing
PrimeGrid has started testing a new application for more sophisticated prime number searches. The new sub-project is created in collaboration with Twin Prime Search project.
Please note that the new application is in quite early stages of development and might have issues. Therefore it is only sent to people who choose to run test applications. We do not recommend running this application on production systems.
To enable test applications, go to project preferences page and choose to allow test applications.
PrimeGrid 正在开始测试一个用于更专业的质数搜索的程序。这个新的子项目是与 Twin Prime Search 合作的。
请注意,由于程序尚在开发期间,可能会有各种各样的问题,所以我们只将其分发给愿意进行测试的人们。我们不建议在贡献量大的机器上运行这个程序。
如果您想运行测试程序的话,请到您的帐户的参数设置页面设置“允许测试程序”。

[ 本帖最后由 fwjmath 于 2008-5-1 05:53 编辑 ]





顶部
fwjmath
超级版主
Rank: 6Rank: 6
Strasbourg~~~


UID 5458
精华 7
积分 2434
帖子 2127
阅读权限 101
注册 2005-5-22
来自 广东佛山
发表于 2007-1-13 08:52  资料  主页 短消息  加为好友  添加 fwjmath 为MSN好友 通过MSN和 fwjmath 交谈 QQ
RieselSieve(BOINC)

2007-10-28 01:01:35 UTC   Riesel Sieve Finds its First BOINC Prime!
Congratulations to Mackerel, who had a box turn in our first BOINC Prime this evening. The k is 469949, a relatively light k at about 29,000 k/n pairs removed. However, the test was a missed test on 1st run, highlighting the need for a proper double-check by BOINC.
We will release the full k/n pair after it is submitted to PrimePages, but it does weigh in at just over 496,000 digits. Is there another double-check prime out there? Only way to find out is to run LLR and help us hunt down the remaining 66 k's. Thank you to all the participants for helping us bring down the workload, and a special thanks to Mackerel for killing his second k.
Manual sieveing DAT file will be released in the morning; the new DAT for BOINC will be released as part of our server switch.
恭喜 Mackerel 发现了我们在 BOINC 上的第一个质数。这个指数的 k 是 469949,相对来说比较“轻量级”,只有 29000 对“k/n”对。然而,这个质数在第一次检查的时候溜过去了,这就说明了 BOINC 上的复查是很重要的。
在提交到 Prime Pages 之后,我们会公布这对 k/n 对。但是这个质数只有大约 496000 位。还有没有别的溜过去的指数呢?要想知道,唯一的办法就是帮助我们搞定剩下的 66 个 k。感谢您的参与和帮助我们减低工作量,特别鸣谢 Mackerel,他干掉了他的第二个 k。
手动筛法的 DAT 文件会在早上发布,BOINC 的 DAT 文件会作为服务器升级的一部分发布。

2007-10-21 19:41:34 UTC   Status Update 10-21
Lee and I wanted to post a notice and let everyone know that things are running well - so, we're going to start making some changes.
k=141941 is about 30 tests away from being tested to n=2^22 - far beyond the other k's we are testing. Unfortunately, a prime has not yet been yielded. We are examining where we want LLR to go next. For the time being, the shorter, double-check workunits are being run.
In the next week or so, we will be migrating from PerlBOINC to 'true' BOINC. While we do not anticipate any major problems or items of notice to the users, there may be small periods of downtime while we switch. We'll make every effort to post them in the forums beforehand. Some extra features, like the sieve & llr range pages, may not be updated or available during the transition.
We are also planning to release all new clients when we switch to the new server code. Linux 64-bit sieve will return, and we will be upgrading all the sieve clients to the latest versions of sr2sieve, with the goal of an additional speed improvement. We also will release a new DAT file for sieve at that time. LLR will receive a new wrapper, with the hopes of finally nailing the dreaded queue crash bug.
All in all, it should be a busy (and much more exciting) next couple of weeks - stay tuned for details!
我和 Lee 想在这里放个通知,让大家知道一切顺利。而且我们正在准备做出一些改进的东西。
k=141941 现在只差 30 个测试就会到达 n=2^22 了,这比其它所有的 k 测试得都要远。不走运的是我们还没有发现一个质数。我们正在考虑我们下一步 LLR 测试的计划。现在运行的是复查的比较短的工作包。
在下个星期左右我们就要从 PerlBOINC 移植到真正的 BOINC 了。我们虽然不希望出现什么引起用户注意的问题,但是在我们转移的过程中服务器可能会时断时续。我们会尝试在这种情况发生之前在论坛上通知大家。有一些功能在转移过程中可能会暂时失效,如 sieve & llr 范围页。
在转移后,我们也准备发布新的客户端。Linux 64-bit 筛法程序将会卷土重来,我们也会用最新的 srsieve 程序代码来更新所有的筛法程序,这样会提高速度。到时我们也会发布一个新的 DAT 文件。LLR 会有一个新的 wrapper,希望这次能解决队列崩溃的问题。
总的来说,下几个星期会是忙碌但令人兴奋的。等着我们的消息!

2007-09-07 22:44:07 UTC   Linux Sieve Problem
We are currently experiencing a major problem with the Linux sieve client, which is affecting about 90% of workunits sent out to linux boxes.
We are actively working on the fix; in the interim, we have switched all linux clients to LLR work (regardless of beta app settings), as the linux LLR client has been incredibly stable.
As an aside, we hope to have a new client out for all platforms this weekend (this was planned), as we plan to release an updated DAT file for sieveing. More details will be posted.
For updates on the Linux sieve problem, please see the forums.
我们的 Linux 客户端出了一个严重的问题,影响到大约 90% 的 Linux 工作包。我们正在努力修复这个问题,在这个过程当中我们已经将分配给 Linux 机器的工作包全都调成 LLR 工作包(忽略是否接受测试程序的选项),因为现在 Linux 的 LLR 程序还是稳定的。我们希望在这个周末能够在所有平台推出一个新版本的客户端,顺便带上新的 DAT 文件(这是在计划中的)。我们将会公布更多的细节。在我们的论坛上有这个问题的更新消息。

2007-07-11 11:42:46 UTC   LLR Focus on k=141941
Lee and I are determined to defeat k=141941, our largest k. He feels that there was a missed prime somewhere for this k, so we're going to turn all of our attention - LLRNet AND BOINC LLR to this one k. LLRNet will go up to 5 million, BOINC LLR will do the re-check from the current level (about 1.5M) to 3.0M.
To rally the troops, all Linux BOINC clients will get LLR work (we're confident that the scoring has been balanced finally, but will still monitor closely). We are also encouraging windows users to switch over to LLR if possible.
LLRNet has about 4000 pairs to do before the k=141941 assault truly begins, and BOINC has about 1400. Here's to slaying another k!
我和 Lee 决定了要挫败 k=141941 这个最大的 k 值。他觉得对于这个值应该有一个属于它的质数,所以我们现在将我们 LLRNet 和 BOINC LLR 所有的注意力都集中到这个 k 上面来。LLRNet 会计算到 n=5M,BOINC LLR 会进行从现在的 1.5M 到 3M 这个范围进行复查。为了打赢这场战役,我们决定让所有 Linux BOINC 的客户端都能接收到 LLR 的工作包(我们相信得分已经被平衡好了,但是我们仍在仔细监控着)。我们也鼓励 Windows 用户尽量转向接收 LLR 工作包。LLRNet 现在还有大约 4000 对数才能开始对 k=141941 的攻击,而 BOINC 则还有大约 1400 对。现在让我们来搞定这一个 k 值吧!

2007-06-26 18:26:09 UTC   Linux LLR Now Available
LLR testing is now available on Linux. Make sure that you have "Allow test applications" enabled for your host and you will receive LLR workunits. If you have questions, please visit the forums.
现在 LLR 测试在 Linux 上也可以进行了。你只要选择“允许测试程序”就可以收到 LLR 的 WU 了。如果你有任何问题,请到论坛上提问。

2007-06-10 14:49:47 UTC   Work Problems June 10th
This morning, a bad sieve range was fed into the work generator. This created about a 6-hour period of repeatedly bad work.
We have fixed the work generation, although workunits will now be 1G for sieve, which is 2x as long as the "old" workunits. We have adjusted crediting to account for this.
The latest info regarding the problems that were created and the current status on the servers can be found in the forums.
今天早上,一个错误的筛法范围被扔进了 WU 生成器,然后它就产出了以 6 小时为循环的坏工作。我们已经把它修好了,而且 WU 被延长了 1 倍。我们已经由此修正了得分方法。在论坛中有详细的信息。

Mon, 14 May 2007 23:39:37 GMT  New LLR Client Version
We're pleased to announce the 5.20 series of LLR clients. This is the first in a series of upgrades & updates we plan to make in the next 1-2 weeks. This introduces the new wrapper format to the Windows OS - it has worked extremely well on Linux, so we're hoping to duplicate those successes. Internal testing over the weekend went well. Two main breakthroughs with this new wrapper: (1) no more 0.00 CPU time LLR WU. (2) (hopefully) No more random queue crash for LLR WU. As long as (2) does not creep up this week - please monitor your hosts - we will move forward with our plans to make LLR more of a project-wide priority.The LLR executable itself stays the same, we are only changing the wrapper and introducing a job file.Please make sure that you notify us of any queue troubles or other issues with the wrapper (or just drop in and tell us how great it is). Thanks in advance!
我们很高兴我们发布了 5.20 版的 LLR 客户端。这是在接下来的一两个星期的一系列的更新之中的第一个。这个客户端将在 Linux 上能良好运行的新的 Wrapper 引入了 Windows 系统,我们希望能再次取得成功。整个周末进行的测试很顺利。新的 Wrapper 有两个好处:(1) 不会出现 CPU 时间是 0 的 WU。(2)(我们希望)不再出现随机的崩溃。因为测试中我们没有遇到崩溃,所以如果遇到这种情况请汇报。我们计划将 LLR 提升到与 Sieve 同样的地位。在这次升级中,LLR 程序本身不变,我们只是改变了 Wrapper 和添加了一个新的 job 文件。如果遇到崩溃情况,请通知我们。提前谢谢了!

Thu, 10 May 2007 07:19:13 GMT  New Linux Clients
A new x86 and x86_64 set of linux clients has been sent out to the hosts. It includes the new DAT file, updated sr2sieve, and a new wrapper format that will allow us to interchange what is run in the wrapper more easily. Look for the PPC build to come out this evening. As always - send any questions over to the forums.
新的 x86 和 x86_64 Linux 平台上的计算程序已经投入使用,它包含了新的 DAT 文件,升级版的 sr2sieve 和一个令交换信息更方便的新的 wrapper 格式。PPC 平台上的程序今晚就能出来。如有问题,请到论坛提出。

Mon, 30 Apr 2007 00:32:50 GMT Prime Found - and a New DAT Version
Congratulations to Cipher, who found his 2nd prime with the Riesel Sieve Project. While not a BOINC prime, this LLRNet beast weighed in at #19 in the world - 794,556 digits long. 342673*2^2639439-1 is indeed prime. Thank you to everyone that has made this prime possible. I'm also pleased to announce the 5.35 release of the Windows client. This is a real bugfix, as watzkej has been gracious enough to spend most of the evening in #rieselsieve debug testing things, and Chuck has helped narrow down all my bad coding problems (that he could find). We're on track again with this 5.35 release and should see a speed increase - both from the smaller dat (about 200,000 pairs, between the Sieve effort and removing 1 k) and the use of sr2sieve. Thanks for sticking with us this last week - it has been quite a hectic time for all of us.
恭喜 Cipher 发现了他在这个项目里发现的第二个质数!这个由经典客户端发现的“怪物”有 794556 位,世界排名第 19。它就是 342673*2^2639439-1。感谢所有参与者,是你们使这个质数得以被发现。我在这里顺便宣布一下,我们发布了 Windows 计算程序的 5.35 版。这回真的是一个可用版本了。感谢 watzkej 在帮助调试中度过一个个不眠之夜,感谢 Chuck 找出了他所有能够找出的错误。现在我们正在监控 5.35 版的运行状况。这个程序应该会更快,因为我们有一个更小的 dat 文件(经过筛法和移除一个 k 后大约剩下 200000 对),而且我们使用了更快的 sr2sieve。谢谢在这个星期对我们的支持,这个星期发生的一切的确让我们每个人都很尴尬。

2007-04-28 12:10:08 UTC   Back to 5.31 Sieve Temporarily
Temporarily, we've had to go back to the 5.31 sieve version. We cannot get 5.32-5.34 working correctly, so 5.31 is the "last working" version. It does not checkpoint, and it is actually the checkpoints themselves causing the problems in 5.32-5.34 I've found. Once I have this hammered out, we'll be back on track.
暂时我们得回到 5.31 版的程序了,更新的版本工作不正常,所以 5.13 版是最后一个可工作的版本。这个版本不会存盘,而我发现正式存盘的部分使更新的版本不能工作。只要我能把这东西捣鼓好,我们就第一时间回到正常的轨道上来。

2007-04-24 23:22:18 UTC   New Day, New Client for Sieve + Good News
Version 5.34 of the Sieve has been released. I'm hoping this is the last release required to stomp out this loop bug that is plaguing the sieve. I'm already starting work on a pseudo-wrapper that will only have one executable file, limiting how much has to be updated when we need to make changes. I also hope that it will bring us closer to a true native BOINC app.
On the good news side of things, a possible prime is undergoing internal verification - it would be the 19th largest in the world if it comes back prime. A prime would cause the release of version 5.35, with a new DAT, later this week.
Thank you all for your help and patience these last two weeks - the variety of problems has kept us all very busy. In the end, I promise, things will be for the better.
5.34 版本的程序已经推出了。我希望这次能解决问题。我正在试图将 wrapper 跟筛法程序绑在一起,这样的话我们更新的时候就省事多了,而且也会使我们的程序更接近于原生的 BOINC 程序。
另外有一个好消息。我们发现了一个疑似的质数!我们正在检查它的素性。如果证实的话,它将会是现在第 19 大的质数,我们也会推出新版本,换用新的 DAT 文件,大概就是这星期内。
谢谢你们在这两个星期来的帮助与配合。各种问题的出现把我们弄得团团转,但是到最后,一切东西都会好起来的。

2007-04-24 00:06:30 UTC   Abort 5.32 Sieve WU on Windows
Users with 5.32 series WU on Windows should abort the WU. The 5.32 client does not properly report its status as "finished", which causes an endless loop for the sieve. Version 5.33 has been released which fixes this problem. Please visit the forums for more information.
Windows 用户请终止掉所有用 5.32 版程序计算的 WU。5.32 版本的程序不能正确地报告它的状态为“完成”,这会导致一个死循环。5.33 版本的程序已经推出,用以修复这个问题。详情请访问我们的论坛。

2007-04-22 23:01:07 UTC   New Sieve App Release for Windows
-------Windows/x86 & Windows/x86_64 Verison 5.32-------

Known Bugs: We don't have the same checkpoint logic as the linux apps, as Windows doesn't support process signals. We are working on a true solution. Right now, checkpoints will occur every 5 minutes.
Having "leave apps in memory while suspended" caused the app to hang in 1 trial (out of 4, on the same box). I'm looking into it. Similarly, in certain cases, the sieve app did not always get properly closed when boinc was being closed.
Bugs Fixed: Problems associated with the 5.31 release - including no progress reporting, some app suspension handling, etc. Fixes handling of 1000T+ WU properly. Note: this is the first windows app to include sr2sieve. We will be putting out a new set of optimized sieve apps, catered to different architectures. This is the athlon-tuned, SSE2-enabled (when CPU has it) edition.
A true 64 bit client is coming - I have to get mingw running 64-bit first.
我们有面向 Windows 的,32 位和 64 位的新的筛法程序了!
已知 Bug:这个程序的检查点逻辑跟 Linux 版本的不同,这是因为 Windows 不支持进程信号。我们正在努力尝试解决这个问题。现在,程序每五分钟做一个检查点。
BOINC 的“暂停时驻留在内存”选项会让程序有大约 1/4 的概率挂掉。我正在检查是什么问题。同样,有时 BOINC 关闭时程序的行为也不大正常
修复的 Bug:所有 5.13 版的问题,如没有进度、暂停问题等都已经解决了。程序已经可以正常处理 1000T+ 的任务了。注:这是首个包含 sr2sieve 的 Windows 程序。我们会放出新的一系列的优化程序。现在的版本是为 Athlon 调节过的支持 SSE2 的版本。
真正的 64 位程序就要来了——等到我将 mingw 搞得能运行在 64 位模式下就可以了。

2007-02-26 22:11:25 UTC   Connectivity to Asia & Australia Restored
We've been receiving confirmation from users that connectivity to Asia, Australia, and the Pacific have been restored as of this afternoon/evening. Thank you to the numerous people, especially AMDave, Webmaster Yoda, and others, who helped with tracerts, pings, and figuring out where exactly our link to the Internet was having problems. Sorry about the long delay, but it took a lot of testing/convincing to get things fixed.
我们已经收到亚洲、澳大利亚和太平洋用户的确定能够重新访问我们的消息。感谢许多许多人,特别是 AMDave、Webmaster Yoda,还有别的人帮忙探测故障处。我们对这个延误深感抱歉,但我们的确需要很多测试才能解决这个问题。

2007-02-21 00:25:09 UTC   New x86_64 Application Version
Due to some bad compilation flags, the 5.33 application version for x86_64 is excruciatingly slow (~20 hours/WU). We've released a new version that has the correct flags in the sr2sieve app, and the speed that should be there has returned. Updates are pushing out to the x86_64 clients now. This did not affect our other clients.
由于搞错了编译开关,x86_64 的 Linux 版程序极其缓慢(~20 小时/WU)。我们已经用修正过的新版本替代了原来的程序,这样的话速度就可以重新上去了。现在这个新版本的程序正在被发放到每台 x86_64 的机器上。其它版本的程序不受影响。

2007-02-19 19:29:13 UTC   Another Linux & PPC Release + x86_64 (Linux) App
A bug has been found in the Linux & PPC apps. So, we've released new version of the Linux/x86 app + the Linux/ppc64 app, which will correct this error.
We also have, thanks to Bok from Free-DC, an x86_64 Linux app for the first time. Instead of a 32-bit app, we're sending a 64-bit version of sr2sieve + the wrapper.
As always, please direct questions/comments to the forums.
在 Linux 和 PPC 程序中发现了一个错误,所以我们发放了新版本的 Linux/x86 和 Linux/ppc64 的计算程序,这将会修正这些错误。
感谢来自 Free-DC 的 Bok,我们终于有了第一个 x86_64 的 Linux 计算程序。我们现在已经用这个 64 位的程序替代了原先的 32 位的程序了。
如果有意见或者建议的话,请到论坛提出。

2007-02-17 02:04:58 UTC   New Linux Sieve Version + PPC/Linux Support Added
It's been a busy, but exciting, night at RieselSieve. We finally have a new Linux/x86 version that correctly reports its timing & status to the BOINC client. It also implements sr2sieve, rather than proth_sieve, so users should see a HUGE speedup.
We also have introduced a Linux/ppc64 client. This will download from our server automatically, as long as you have compiled BOINC from source on your box. We plan to have a binary available soon. The new, from-source build is necessary because of the version string, powerpc64-unknown-linux-gnu, that it uses. Our server matches that & sends out a TRUE PPC sr2sieve version & wrapper. This also has the corrected linux progress & checkpointing capabilities. Thanks to BlisteringSheep for his help & access to a PPC box for us.
As always, please visit the forums to notify us of bugs/changes.
对于 RieselSieve,今晚是个忙碌而又令人激动的晚上。我们终于得到了一个新的可以向 BOINC 客户端准确汇报时间和状态的 Linux/x86 的客户端。我们还在其中用 sr2sieve 替代了 proth_sieve,得到了一个巨大的速度提升。
我们也写了一个 Linux/ppc64 的客户端,不过要在你自己的机器上编译。很快就会直接有能自动下载的程序了。这个版本也包括了关于进度和检查点的改进。感谢 BlisteringSheep 的帮助和提供的 PPC。
如果有意见或者建议的话,请到论坛提出。

2007-02-04 11:20:56 UTC   New LLR Beta Application Version Released
We've brought out a new version of the LLR Beta App that should permanently prevent the "popup window" that has surfaced when a WU crashes in certain situations.
Because of an error in the XML for the 5.18 version, please abort any 5.18 version WU you get, but allow the 5.19 version to crunch. This should stop the signature verification errors that happened overnight. If you have any questions, please stop by the forums.
新的LLR程序已经发布,相信它可以一劳永逸地解决WU计算失败时弹出窗口的Bug。由于在5.18版本的XML中有一个错误,所以请终止所有用5.18版本计算的WU而去计算5.19版本的WU。这样的话应该可以避免像昨晚发生的的签名验证错误。如果有什么问题的话,请到我们的论坛。

2006-12-02 17:19:10 UTC   A New Prime & 5.30 Sieve Released
Congratulations to DarkStar, who found the 742167-digit prime 26773*2^2465343-1 using our "classic" LLR application on Friday. We have verified and submitted the prime, which ranks #20 in the world.
As a result, a new, lean, mean riesel.dat is available for download, which requires the release of a new wrapper file as well. 5.30 for windows is being sent out as we speak. There's about 150,000 fewer pairs in the DAT file, thanks to the removal of 72,000 from the k and another 75,000+ from BOINC.
Thanks to everyone supporting Riesel Sieve, and here's to another prime!
祝贺 DarkStar,他用“经典”客户端发现了 26773*2^2465343-1 这个 742167 位的质数!我们已经确认并申报了这个质数,这个质数是暂时发现的第 20 大的质数。这样,我们就通过清理约 150000 对 k/n 对而得到一个更精炼的 riesle.dat 文件,其中有约 72000 对归功于“经典”客户端,另 75000+ 对归功于 BOINC。谢谢大家!

2006-11-19 21:49:35 UTC   LLR Test Application Now Available
We have enabled a test application using LLR. In order to crunch LLR workunits, you will need to edit your preferences for Riesel Sieve and "Allow test applications". You can set only P4 clients to run the test application using a venue (home, work, or school), and then they will run LLR as long as work is available. We plan to have processor detection/selection in the near future, but the venues will serve as a temporary workaround.
If you have any questions/problems with the new LLR application, please visit the forums.
我们已经启用了一个 LLR 的测试程序。为了启用此程序,请在参数设置页面上设置为“允许测试程序”。您只能用 P4 来运行这个程序,所以请做好设置,建议利用“计算机位置”的分开的设置做到这一点。我们将来会加入识别处理器的部分。如果您在使用新的 LLR 程序的时候遇到问题的话,请访问论坛。

2006-10-28 13:17:40 UTC   Optimized Sieve Applications Now Available
We have now published a list of EXE files that are official optimized sieve applications depending upon CPU features - CMOV5, CMOV7, SSE2, or non-CMOV. The basic application, CMOV6, is most common, which is why we have ran it so far.
These applications will speed up the WU processing, allowing a user to complete more WU per day, and in turn increasing their overall production/score. For details on how to install and the EXE downloads, please see this forum thread: Official Optimized Clients
我们已经发放了一系列针对不同 CPU 特性的正式优化程序:CMOV5, CMOV7, SSE2 和 非-CMOV 版本。我们现在使用的默认版本 CMOV6 是可以最普遍地提升性能的,所以我们直到现在都是利用这个程序进行计算。这些优化程序可以提高计算机处理 WU 的速度,从而增加获得的分数。关于如何安装优化程序的细节,请参看:Official Optimized Clients

[ 本帖最后由 fwjmath 于 2007-10-30 04:11 编辑 ]





顶部
fwjmath
超级版主
Rank: 6Rank: 6
Strasbourg~~~


UID 5458
精华 7
积分 2434
帖子 2127
阅读权限 101
注册 2005-5-22
来自 广东佛山
发表于 2007-1-13 08:53  资料  主页 短消息  加为好友  添加 fwjmath 为MSN好友 通过MSN和 fwjmath 交谈 QQ
ABC@home(beta included)

21 November, 2007
Powerpc client has been added. From now on version 1.03 is mandatory, all results with previous versions are invalid, 1.03 has been available since 4 weeks.
加上了 PowerPC 的计算程序,从现在开始1.03 版就是正式的版本了,所有以前的版本得到的结果都将会被视作无效,这是一个月之前的事情了。

13 October, 2007
I added additional workunits that somehow got skipped. Thanks a lot to Cori for the new logo!
我补上了一些不知道为什么被跳过的工作包。感谢 Cori,我们有了一个新的 Logo。

13 October, 2007
I fixed a bug in the stats daemon, stats are being regenerated. I also redesigned a part of the makework daemon, now before it is started it does a precheck over a large interval trying to predict the number of work to be done in a small interval for a workunit. It won't help any with these peak workunits over 30 hours, but it will prevent workunits that are too short, hopefully.
我修正了统计生成器的一个 bug,统计已经被重新生成了。我也重新设计了工作包生成器的一个部分,现在它在开始工作之前会预先检查一个大的区间,尝试预测一个工作包的小区间的工作量。这不会使那些要算 30 个小时的大工作包变小,但是应该可以防止那些太短的工作包。

11 October, 2007
I doubled the workunit length for now, because most were really getting to short, and it's not good for the database to have tons of small workunits. I hope this doesn't cause inconvenience, today or tomorrow I will try to think and make something that will sort of predict the workunit length in order to have more or less constant workunit length.
我已经将工作包的长度加倍了,因为它们现在变得有些短,这样子会加重服务器的负担。希望这样不会带来太多不便。今天或者明天我会尝试一下有什么办法可以预测工作包的长度,这样的话它们或多或少会变得整齐一些。

10 October, 2007
Check out the images I've made about abc-triples from the project here.
我做了一些以我们这个计划发现了的 abc 三联组的图示,请参看这里

08 October, 2007
Both linux and windows 64bit version 103 are now in the stable project. You can expect the same amazing speed for the windows version as you're used from the linux 64bit one! The validator has also been adjusted to allow mixed results from version 102 and 103, if you encounter any problems, please report them as soon as possible. Happy calculating!
Linux 和 Windows 的 64bit 客户端(版本 103)已经被添加进了正式项目中了。您现在可以感受到跟 64 位 Linux 一样的速度了!我们已经调整了验证程序来允许 102 和 103 版本程序的混合。如果您遇到了任何问题,请尽快向我们汇报。祝计算愉快!

06 October, 2007
Good news, the 64bit (truly 64bit) windows client is finally done and seems to work great! It will go into the beta project and then as soon as possible in the stable.
好消息!一个 64 位的 Windows 客户端已经编译好了,看起来运行得还不错!我们将会在 beta 项目里边测试它,通过测试以后我们会尽快将它放进正式项目里边的。

06 October, 2007
The delay bound has been increased to two weeks, let's see if that is large enough. The homepage layout has changed. The news from the beta project will from now on also be posted here, in order to simplify and let you see news faster.
上报期限延长到了两个星期。网页的样子改了。beta 项目的新闻以后也会在这里贴出来,这样的话你们就能更快看到新闻了。

05 October, 2007
In the beta project we are currently testing a new abc client, only for linux at the moment, which should make the code portable to more platforms including mac powerpc. It also contains better anti-cheat protection.
我们正在 beta 项目中测试一个新的 abc 客户端,现在只有 Linux 版本。这个新版本的客户端的可移植性会更好,也加入更好的防止欺骗的机制。

01 July, 2007
I added the mac intel version of the abc application into the stable project. Please let me know if there are any problems. Added a favicon made by Krunchin' Keith, thanks!
我添加了含 Intel 处理器苹果机上的程序,有什么问题请告诉我。新增加了 Krunchin' Keith 制作的网站标签,谢谢 Krunchin' Keith!

16 June, 2007
Back. The workunit length has been slightly increased, the database has been considerably cleaned up, it should run a lot faster. Furthermore, the amount of workunits one can get has been increased from 5 to 20.
我回来了。WU被稍微加大,数据库被清理了一遍,估计它应该运行得更快了。此外,每台机器可以下载的WU数量由5提升至20。

20 March, 2007
ABC@HOME beta is back, now running on a seperate server. The url changed, please report this to the stat sites: abcbeta.math.leidenuniv.nl. I hope we can soon start testing again a 64 bit windows binary
Beta 版本又回来了!这次是在另一个服务器上。URL 也换了:abcbeta.math.leidenuniv.nl。希望我们能尽快重新测试 64 位的 Windows 程序。

04 March, 2007
The workunit length has been doubled, almost all workunits were really too short. Tomorrow I'm beginning to install the new server and at the end of the week I think we will migrate, there might be a downtime of a few hours at most then
WU 的长度又被加倍了,因为现在每个 WU 的计算时间实在是太短了。明天我会开始安装新服务器,大概周末的时候我们就会换服务器,那时候大概会有几个小时的断线。(注:三月15号就换了服务器了)

16 February, 2007
The new server and the mac have arrived. Available work has been increased to 750 workunits, which is more than enough. A bug in the assimilator has been fixed
新的服务器和 Mac 都已经到了。可发放的 WU 的数目也增加到了 750 个。WU 生成器中的一个错误已被修正。

14 February, 2007
The 64bit version for linux has been put into stable. It's about 3x or more faster than the 32bit version. A windows version still is giving some trouble, but should appear later on..
Linux上的64位版本已经推出了,大概比原来的32位版本快三倍。Windows版的编译还是有些问题,但应该快能够推出了...

10 February, 2007
Credit granting has been adjusted in a positive sense, longer workunits are awarded a bit more to stimulate to finish them, you can read more about it on the forums. A macintosh has been ordered to begin developing and building a mac client..
积分系统作了一些修正,让那些长的WU拿到相对更多的积分来鼓励大家完成这些长的WU。还有,我们现在买了一台Mac来编译一个Mac版的计算程序。

24 January, 2007
Fixed a bug in the statistics program that caused some missing personal triples in your personal account view on Reken mee met ABC..
Reken mee met ABC 上修复了一个会导致统计页面上个人发现的三元数组丢失的故障。

21 January, 2007
Workunits have slightly been increased in overall length. Statistically, this should not influence the long workunits by making them even longer, but it will make all the shorter workunits more normal in length. If you might encounter a long workunit anyway, you should be fairly safe with version 1.01.
工作包的长度被稍微增加了一点。从统计的观点来看,这应该不会使“长”的工作包变得更长,不过可以使较短的工作包运行时间看起来正常一点。如果您遇到很长的工作包,不要惊慌,总是能算完的。

20 January, 2007
A great improvement has been made on both checkpointing and progress indication in the new just released version 1.01 . Progress is very very accurate and should update about every second. Checkpointing now totally relies on your boinc preference settings, there are no more large time gaps between when abc gives boinc a chance to checkpoint. I have to mention that this was made possible by all the good feedback that was given on the forums. The long workunits took us by surprise too, and by all the reporting we realized our old progress and checkpointing system was not sufficient for the huge bound 10^18 we scan to. The old system left users wondering how long it was going to last and left them in uncertainty. After we redesigned it excellent testing took place and bug reporting was done in the beta project, ensuring a reliable client in the stable. So when you see odd behaviour and you don't like it as a boinc user, report it, and keep reporting it, so that we together can make a rock solid client in the end. Note that workunits still can last long, but now you know exactly how long it is going to last, and you can stop it anytime and resume with almost no loss in computing time..
在新版本1.01的程序中,检查点和进度显示有了很大的改进。进度很精确,几乎每秒就会更新一次。检查点现在完全根据 BOINC 的设定来写入,在通知写入和实际写入之间的间隔也被缩小了。必须提到的是这些改进都源于论坛上的回馈意见。那些“长”的工作包也是我们很惊讶,使我们发现我们原来的检查点和进度系统不适合 10^18 的这么大区间的搜索。旧的系统使用户对于完成时间和进度摸不着头脑。当我们重新设计程序并在 Beta 处测试后我们就得到了一个新的稳定的程序了。如果有什么问题的话,请通知我们,这样我们才能做出一个可靠的程序。现在的工作包需时仍然不变,但是运行时间已经是可以捉摸的了。你可以在除了 99% 附近的地方暂停程序而不会浪费任何处理时间。

15 January, 2007
Some more news once again! As some of you might not know, the algorithm ABC@home uses to find abc-triples is brand new, and much much faster than any method before. Together with distributed computing power we are now able to scan where no man has scanned before. Also ABC@home has a national Dutch sister site called Reken mee met ABC. On this site counters are visible that show how much hits have been found and how many triples we scanned through already together! Statistics are also available, showing a top 100 each day of the best participants for example, who found the best abc-triple, who scanned the most triples and so on. You can also login with your BOINC account information (in the upper right corner) to view your own personal statistics. Furthermore there is a progress indication of the entire project. All this will probably become available in the near future for the international site abcathome.com too. Tomorrow this site will be officially opened and featured in Dutch media along with other information regarding ABC@home. The server might be busy, let's hope the load doesn't get too high. If it does and you cannot reach it anymore, please be patient with us!
又有更多的新闻了!你们可能不知道,ABC@home 所用的寻找 abc-三元组的算法是全新的,而且比以往的方法快很多很多。再加上分布式计算的力量,我们有能力搜寻那些前人从未搜寻过的区域。ABC@home 有一个姊妹站点 Reken mee met ABC。在这个站点上我们可以看到我们现在已经搜寻过的区域。那里也有各种统计,如计算量的统计等等。你可以用 BOINC 的帐号登陆(在右上角)来查看自己的统计。那里也有整个项目的总体完成度。所有这些在将来的某一天会在这个站点上添加。

15 January, 2007
ABC's workunits seem to be coming more predictable, we're slowly getting to a point were they should have more or less a constant running time, we're not there yet, but we're closing in. On most hosts a workunit lasts now about 0 till 0.6 hours cpu time, with an occasional long workunit (which you should not abort, because it will finish correctly!). We strive to make them about 1 hour on most hosts, the last thing we want is irregular workunits jumping here and there with unpredictable behaviour and where you as a user do not know what is happening with it..
ABC@home 的工作包的时间需求现在好像愈来愈可预测了,它们的运行时间应该大约是一个常数。我们还没有把工作包完全调整到这一点上面,但也差不多了。在主流的机器上一个工作包耗时大概是 0.6 小时或以下。有时候也会有一些超长的工作包,请不要终止它们,它们会正确地运算完毕的,只是多花一些时间而已。


(BETA)15 January, 2007
Today it is 64bit testing day part 1. A 64bit version for linux should be ready, and hopefully later one for windows.
If all goes well as it should, this will give a lot more fire power to the project since true 64bitness will be used. Be sure to use a 64bit boinc core client!
今天我们会进行 64 位程序的第一部分测试。我们现在已经有一个 Linux 上的 64 位版的程序,很快 Windows 上的也会出来的。如果一切顺利的话,这个 64 位实验将会给这个项目带来更强的计算能力。注意要使用 64 位的 BOINC 客户端!

14 January, 2007
Account creation has been opened and a mass mail has been sent out to our beta testers (we try to sent as little mail as possible). To all our beta testers: We are very gratefull for you and you enabled us to have come so far, without you we couldn't have made it. Now, let us calculate!
新用户注册已经开放!我们给 Beta 测试者发了一封邮件,感谢你们的积极配合,谢谢!

14 January, 2007
Some workunits might last longer than indicated, but this does not mean it is a bad workunit. It will finish, and you will get credits for all that time. So far there hasn't been a single run-away workunit that kept on forever. These long workunits might just contain a lot of lucky numbers and calculations that were unpredictable causing the length of it..
有一些工作包可能计算的时间比预期的要长,但是这不意味着这个工作包坏了。它最终会结束,而您也会拿到与计算时间相应的积分。现在还没有一个工作包是陷入无限循环的。这些比较长的工作包可能包含着很多对整个搜索来说十分幸运的数字,所以额外的计算会使它的计算时间变长一些...

14 January, 2007
Again news from your local ABC news station! Work has restarted, everything is running smoothly except the duration of workunits. The further we come the more regular they are. Once all new workunits are predictable and have an average running time of about 1 hour, I can set the deadline and estimates properly
so that progress is indicicated properly.
After that account creation will be opened.
How fast we get there depends on the current testers, but I'd say pretty fast! Hopefully in a few hours.
ABC 又有新闻了!搜索已经开始,一切看起来很顺利,然则那些 WU 的完成时间好像稍微变长了。但将来这种情况会变得更稳定。一旦所有的 WU 的完成时间可以被控制在大约一个小时,我就可以正确设定最后期限,然后这个项目就会进入正轨。此时我们将会开启新用户注册。这个过程时间长短取决于现在的测试者,具体多快我不知道,但是是相当的快,运气好的话大概几个小时就可以了。

13 January, 2007
Another 1000 workunits are generated.
Most of them should be done by tomorrow morning,
and then account creation will be openend..
加入了 1000 个 WU,其中绝大多数会在明天早上之前完成,然后我们就会开启帐号的注册。

13 January, 2007
Statistics are now exported again in abcathome.com/stats.
Notify your local stats supplier. Don't forget ABC@home
is a different project than ABC@home beta, they are now independent.
Beta will be solely used for testing purposes.
Here your credits et al are all reset to zero, but not on the beta.
统计已经重新导出到 abcathome.com/stats 了,请项目统计的提供者注意这一点。注意现在 ABC@home 跟 ABC@home beta 是两个完全不同的项目。ABC@home beta 只会用作测试用途。现在每个用户的积分都被清零了。

13 January, 2007
Workunits are waiting for the first diehards.
Please report any abnormalities or things you miss or are not working
on the forums so it gets fixed.
现在有一批 WU 提供给这个项目的坚决拥护者。如果遇到什么问题或者有什么建议的话,请到论坛上提出。

13 January, 2007
The immense search has started! One of the greatest mathematical searches
for numbers which might last for years.
In a few minutes the first workunits will be available for the participants from the beta.
Once everything is running smoothly the doors will be open for everyone. For the beta testers: please participate/attach to the stable and help us out to make it work smoothly.

这个巨大的搜索行动终于开始了!这是一个可能延续数年的意义巨大的数学搜索行动!几分钟后就会有第一个 WU 给用户开算了。只要所有东西都运行顺利,我们很快就会向全世界打开这个搜索的大门,让每一个人都有机会参与其中!参加 Beta 测试的测试者请重新加入正式项目。


BETA)12 january, 2007
The hardware upgrade is complete and succesful.
Plans about going live have changed slightly:
1. I will try to import all users from beta into the stable soon, maybe tonight
2. a 1000 results are waiting there for computation
3. if they are computed ok, and it is running smoothly, and everybody agrees that it is going ok, account creation for stable will open up and we will go live.
You will get the amount of credits from the stable you're used to from the beta, and the results you work off for the stable will be saved and used.
Work from the beta will slowly stop and when the stable is fully up and running work for beta will only be generated when there is something to test.
我已成功完成项目服务器硬件的升级。项目计划有轻微变化:
1. 我会尝试尽快将测试的用户转入正式项目的数据库中。
2. 现在有大约 1000 个 WU 需要计算。
3. 如果所有事情都顺利的话,我们就正式开始项目。
参加测试的用户在正式项目开始时能够直接得到测试时的积分。而测试项目在以后将停止发放工作包,除非需要进行新的测试。

[ 本帖最后由 fwjmath 于 2007-11-22 02:39 编辑 ]





顶部
fwjmath
超级版主
Rank: 6Rank: 6
Strasbourg~~~


UID 5458
精华 7
积分 2434
帖子 2127
阅读权限 101
注册 2005-5-22
来自 广东佛山
发表于 2007-1-13 11:35  资料  主页 短消息  加为好友  添加 fwjmath 为MSN好友 通过MSN和 fwjmath 交谈 QQ
SZTAKI Grid

2007. may. 21.
New workunits will be available soon.
很快就有新的 WU 了。

2007. apr. 28.
Discrepancies of the credit registries have been equalized.
积分差异已经被修正。

2007. mar. 29.
New application version for the windows and i686-apple paltforms brings an increase in processing speed. Linux and powerpc-apple versions are coming this weekend.
面向 Windows 和 i686-apple 的新程序已经出来了,带来了一些速度上的提升。Linux 和 powerpc-apple 平台的程序大概这个周末就会出来。

(非正式新闻)
2007.1.8
Longer term aims: it seems that the application is not doing well with WUs containing only 1 matrix, which is more likely to be the case with higher dimensions. This generates all the problem, rendering the application not to be user friendly. However, the research is very promising as our mathematician colleagues say, so we are thinking about continuing this application in a private manner, with less computers and longer run times...
Meanwhile, we are seeking new applications in Hungary - that would be more user friendly - to be run on SZTAKI Desktop Grid. So, if you stay with us and continue work, the reward will be a new user-friendlier application run on SZDG.
大意是:由于现在有一些 WU 运行时间太长而又没有检查点,不适合用户计算,所以在将来 SZDG 上的 BinSYS 项目可能会修改为一个半公开的项目,只让那些愿意运行长时间的 WU 的用户来计算。我们正在寻找一些适合用户计算的项目。请大家继续坚持。
来源:http://szdg.lpds.sztaki.hu/szdg/forum_thread.php?id=526

2006. dec. 5.
The maximum number of false, total and success results has been increased to 10, 20, 10.
错误结果、总结果、成功结果的最大数目分别被调为 10, 20, 10.

[ 本帖最后由 fwjmath 于 2007-7-11 07:15 编辑 ]





顶部
fwjmath
超级版主
Rank: 6Rank: 6
Strasbourg~~~


UID 5458
精华 7
积分 2434
帖子 2127
阅读权限 101
注册 2005-5-22
来自 广东佛山
发表于 2007-7-11 07:26  资料  主页 短消息  加为好友  添加 fwjmath 为MSN好友 通过MSN和 fwjmath 交谈 QQ
Rectilinear Crossing Number

March 31, 2008
There are no W6 anymore. We've canceled them in order to do an interim analysis. The remaining work will be splitted into smaller parts to increase the efficiency of the project. You can choose to crunch down (within 2 days) or cancel the W6's you have. For the next few days we will crunch rCross. Then the W7 series will start.
没有 W6 的工作包了。为了做一个内部分析我们已经将它们全部取消了。没计算过的工作包将会被分解成更小的部分来提高项目的效率。您可以选择继续(在两天内)或者取消这些工作包。未来几天我们会做 rCross,然后我们就开始处理 W7 的工作包。

January 24, 2008
Good news: RCN finally has a screensaver. Johannes told me yesterday that it works for Windows and 32-bit Linux. The screensaver has been implemented by our user ''S@NL FilmFreak''. Thank you, Robin!
好消息!RCN 终于有屏保了!昨天 Johannes 告诉我说这个屏保可以在 Windows 和 32 位 Linux 上运行。这个屏保是我们的用户 ''S@NL FilmFreak'' 做的。太谢谢了,Robin!

January 5, 2008
The W6 workunits were too large. Therefore they have been canceled and replaced by 2688999 W6q workunits (q means quarter, every W6 has been replaced by 4 W6q). If you still have W6 workunits you can cancel them or crunch them. You will get your credits.
W6 工作包太大了,所以它们已经被 2688999 个 W6q 工作包(q 代表四分之一)取代了,每个 W6 工作包被劈成了 4 个 W6q 工作包。如果您现在还有 W6 工作包的话可以将它们取消,但如果您继续计算的话仍然会获得积分。

January 3, 2008
Another bunch of workunits is ready: 764.000 workunits, named ''W6...'' are online to feed your hungry machines. As we get closer to the project's target the problem gets harder and harder. Therefore the maximum running time of the workunits is 10 hours now. If you have still W5's you can cancel them as their range of numbers is included in the W6's. However, if you crunch them you will get your credits.
另一组工作包正式推出了,他们一共有 764000 个,名字以 "W6" 开头。因为我们越来越靠近最终的目标,工作包也越来越大,所以我们现在将时限调节为 10 小时。如果您现在还有 W5 工作包的话可以将它们取消,因为新的 W6 已经包含了所有计算了。但如果您继续计算的话仍然会获得积分。

September 21, 2007
From November 14th 2006 until today we had no hardware problems add all. But today our server wasn't able to write to the raid anymore. After a restart most services work again and probably I will be able to reactivate the database and restart RCN today. But there must be some hardware failure and therefore the crash might reoccur in the future. Unfortunately I will be on a research stay in France from Sep. 25th until Oct. 8th. So if the project isn't running, you might want to crunch workunits from our Sudoku-Project (http://dist2.ist.tugraz.at/sudoku) meantime.
从 2006 年 11 月 14 日直到昨天我们的硬件都没有出过问题,但是今天我们的服务器突然不能读写 raid 磁盘阵列了。重启之后大部分的服务都重新启动了,所以可能我可以操作一下数据库,尝试一下今天能不能重新启动 RCN。但是硬件错误估计依然存在而且可能在以后也会导致错误。但不走运的是我从 9 月 25 日到 10 月 8 日都在法国出差研究,所以如果在这段时间服务器挂了的话,您可能希望暂时算一下我们的数独项目(http://dist2.ist.turgaz.at/sudoku)。

June 29, 2007
Great! More than 5 cpu years yesterday! And it seems to get even more today. FYI: We work hard on the new Sudoko project. The new server http://dist2.ist.tugraz.at/ is up an running. However, the scientific application is not ready yet. I will announce the official start of the project here. Best B.
昨天一天的CPU 时间达到 5 年了!我们新加了一台服务器做新项目“SUDOKU”,就是那个叫“数独”的益智类游戏。新项目估计在一两周内上线。

June 20, 2007
Currently we have only a few tcape-crossing workunits left (W2,W2b,W2c) and I have lowered the maximum buffer size to 2 workunits in order to achieve the best possible distribution. We will start the W3 series very soon.
经过一些tcape-crossing的WU(1小时包)过渡,W3的包已经开始发了。

May 16, 2007
We have another 111 000 wednesday workunits. They are called W2 and they are the same as the W1's but we have increased the maximum running time to 8 hours per workunit for all CPU types. Note that we have checkpointing now and you won't lose your credit if you need to reboot your machine.
新WU发布,命名W2,最大运行时间8小时。已经增加了进度显示和检查点,这样重起机器后就不会丢失未算完的进度。

[ 本帖最后由 fwjmath 于 2008-3-31 20:12 编辑 ]





顶部
fwjmath
超级版主
Rank: 6Rank: 6
Strasbourg~~~


UID 5458
精华 7
积分 2434
帖子 2127
阅读权限 101
注册 2005-5-22
来自 广东佛山
发表于 2007-9-9 05:08  资料  主页 短消息  加为好友  添加 fwjmath 为MSN好友 通过MSN和 fwjmath 交谈 QQ
Sudoku

September 21, 2007 PROGRESS IN PROJECT DEVELOPMENT
PowerPC's are supported by the SUDOKU project now. A 64bit linux version will follow soon. The bugfix release 5.36 of the scientific application is out. And we have customized the skin of the client's simple view with pictures from Cori and Rebirther.
我们的 SUDOKU 项目现在支持 PowerPC 了。一个面向 64bit Linux 的计算程序也即将推出。修复了一些 bug 的 5.36 版计算程序也出来了。在 Cori 和 Rebirther 的帮助下我们也添加了在简易视图上面的一些项目自定义外观了。

September 4, 2007 The real alpha test starts now
Right now I'm inserting 10 000 sudoku workunits. If you have a LINUX machine (or a Linux Live-CD) you can try it out. You just have to enable beta-versions in your preferences. I don't know much about the stability and probably you will get a very low amount of credits today. Don't complain, you've been warned. I will tweek the credit system as soon as I have enough results back. Most of the workunits of this first bunch are very short (seconds).
现在我已经插进了 10000 个 sudoku 工作包了。如果你有 Linux 机器的话你就可以立刻一尝滋味了。你只需要在你的用户偏好设置里边选择允许 beta 版测试程序就可以了。我不大清楚这个程序的稳定性,所以今天你可能只会拿到很少的分数。抱怨的时候不要说我没提醒过你。如果我拿到了足够的结果的话我就尽快调整得分系统的了。绝大多数这一批的工作包都是很短的,可以以秒计算。