Bloom filter with sparse merkle trees

A Bloom filter is combined with an SMT to form a compact commitment to a set. The Bloom filter is divided into blocks of 32 bytes. In order to support N item insertions with a negligible false positive probability of log p = –128, the total number of leaves in the SMT is approximately 0.72N.