I think I'm a distributed computing fanboy. I'd like to pull a few EC2 (or GPU) instances and see how quick brute forcing different encryption/hashing would take, how big of a prime number one could compute in a few hours, do the same pi/e/eulers, or let some genetic algorithms generate a huge wad of data. No idea why or to what ends, just seems like a cool thing to do with spare time.

See wealth of background material: http://boom.cs.berkeley.edu/papers.html

FYI: the name seems to stem from the BOOM project, and have nothing to do with 'Bloom filters'.

i feel like this is an interesting step in the right direction

but... what happens if i want to read, process and write a log message....? thats three different bloom blocks that require 2 partial orderings.

instead of totally unordering everything, id rather have the ability to declaratively order functions for a request, where a function is a typical sequenced set of operations.

their examples arent particularly helpful, looks like most of these bloom blocks are single lines...

I like it! umm... but what the hell is it? I STFA (skimmed-the-f*ing-article) and don't know what's going on here. Quick! What does this mean?