Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

The BBP algorithm is not only parallelizable, it's embarrassingly parallel. Each term in the series can be computed independently of the rest.

In case you missed half of the joke: The PiHex project computed the quadrillionth bit of Pi back in 1998-2000... and was run by yours truly.



I sure did. Funny thing is, I was into this stuff back then (at one point me and another guy were chasing the record for the largest 7-tuple in arithmetic progression; we ended up with the second largest), so I'm sure I heard about your effort at the time. BBP survives in my memory a decade later, but not PiHex.

I have to say though, your original comment was definitely an obscure reference, even on HN :-)


I have to say though, your original comment was definitely an obscure reference, even on HN

I think a lot of people who have been here for longer than you were aware of my connection to PiHex -- it has come up a few times.


Not all of us keep our leather bound "Life and Times of Colin Percival" on our desks.

Some of us keep them under our pillows so we can have sweet, sweet cperciva dreams.


Just read that comment again, I meant the largest 7-tuple of primes in arithmetic progression. Otherwise that doesn't make any sense :-)




Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: