Commit Graph

9 Commits

Author SHA1 Message Date
naddy
2276d3b230 remove WWW lines 2003-12-15 21:42:08 +00:00
lebel
a6fdb1b646 update misc/dnetc for i386 to 2.9007.486; thanks to Michael Coulter <mjc (at) bitz.ca> 2003-12-12 14:45:08 +00:00
lebel
4a4d24c24b update misc/dnetc to 2.9005.483 on m68k, 2.9005.484 on i386 and 2.9002.479 on sparc 2003-07-10 15:40:23 +00:00
lebel
12bd1c573a update misc/dnetc to 2.9001.478 for both sparc and i386.
thanks to David Krause <openbsd@davidkrause.com> for the heads up.
2002-12-04 20:16:16 +00:00
naddy
a6bb19643d No regression tests available. 2002-10-27 21:07:53 +00:00
espie
e82b62f79c Bump NEED_VERSION 2002-03-21 21:09:16 +00:00
espie
5b37289c23 md5->distinfo 2002-03-21 19:59:18 +00:00
lebel
575ae4b0f9 - add support for sparc architecture with version 2.8015.469
- clean master site.
- i386 still at version 2.8010.463.
2001-06-13 15:52:52 +00:00
lebel
059f973a47 initial import of dnetc-2.8010.463:
--
RC5-64:
 
distributed.net's longest-running project is the RC5-64 challenge.
We're now cracking at 127.24 billion keys per second and are moving
through the keyspace faster every day.
 
Optimal 24 Mark Golomb Rulers:
 
Essentially, a Golomb Ruler is a mathematical term given to a set
of whole numbers where no two pairs of numbers have the same
difference. An Optimal Golomb Ruler (OGR) is just like an everyday
ruler, except that the marks are placed so that no two pairs of
marks measure the same distance. OGR's have many uses in the real
world; for more information about them and the status of the project,
please visit our pages devoted to our OGR effort. We're now testing
at 182.49 billion nodes per second.
2001-05-06 14:36:05 +00:00