On Oct 1, 2009, at 3:48 PM, Nicolás Alvarez wrote: > El Jue 01 Oct 2009 10:41:16 [email protected] escribió: >> Redundancy of 2 catches essentially ALL random errors Given the >> current >> number of computers, it would be more than a millennium before a >> single >> undetected random error was missed - assuming that there were only >> 128 bits >> of output / task. > > "Number is prime" is a 1-bit output.
Depends on how you search ... if you issue one number and divide down then you have a one bit return If you issue a range to search , using sieve for example, then the number(s) have/has to be returned. _______________________________________________ boinc_dev mailing list [email protected] http://lists.ssl.berkeley.edu/mailman/listinfo/boinc_dev To unsubscribe, visit the above URL and (near bottom of page) enter your email address.
