[rbqbheir] Bloom filter of the entire internet

Bloom filters with 99% confidence require -log(0.01)/log(2)^2/8 = 1.2 bytes per element.

Bloom filters with forgery-proof false positive rate 1/2^128 require 128*log(2)/log(2)^2/8 = 23 bytes per element.

Assuming the world wide web is a trillion objects, it's big but not too big. For text, to avoid losing on dynamically generated content, we could also do substrings.

It might be useful for digital timestamping.