🚀 go-pugleaf

Hello Netters,

We'd like to ask for your help (actually your CPU's help) in doing
a large scale parallel computation. This computation will give
upper and lower bounds on the area of the Mandelbrot set (if you
don't know what that is, ask on sci.fractals).

The mail server mset@kepler.ucsd.edu can send you help describing
the project and will also allow you to join and/or receive other
information. Briefly, we have partitioned an area containing the
boundary of M into 119 pieces, each of which is recursively quadtree
partitioned into squares which are then classified as in the set,
out of the set, or unknown. The unknown squares are partitioned
again, to depth 15.

To get a piece of the action (a segment to compute) send email to
mset@kepler.ucsd.edu.  The message should have the word "join",
without the " of course, on the beginning of its first line and
nothing else.  You will receive a mail message back which will
contain a C program.  Compile it, run it, and send the output
verbatim back to mset@kepler.ucsd.edu.  The comments at the top of
the program you will receive give UNIX commands for compiling and
running the program and for automatically mailing back the results.
These comments will also tell you how to run the program at low
priority, so that your computer will only be computing its little
portion when it has nothing better to do. You can expect the runs
to last as long as 100 CPU hours on a 2-4 MF machine, but the
average should be about 48 CPU hours. Some programs may finish in
much less time.  You who are kind hearted, can join again and
again.  Please do.

To receive a help file on this stuff, send a message whose first
line begins with the word "help" to mset@kepler.ucsd.edu.

If you have any problems or comments, please write to Jay Hill
(hilljr@jupiter.saic.com) or Yuval Fisher (fisher@inls1.ucsd.edu).
When the 'smoke clears' in a week or two or three, we'll have an
area estimate.  Your contributations will be logged and acknowledged.

Thanks,

Jay Hill
Yuval Fisher


-- 
{ hilljr@jupiter.saic.com } begin writeln(3*ln(640320)/sqrt(163):17:15) end.
void main(){double sqrt(), y=1/sqrt(2.), a=.5, m=1,z; int n=0;
for(;m*=2,z=sqrt(1-y*y),y=(1-z)/(1+z),a=a*(1+y)*(1+y)-m*y,n<3;n++);
printf("%17.15lf\n",1/a);}