Even if a chance of approximation error were introduced for each hash function, this may be justified in greater overall fidelity from the resultant increase in b.
we propose to approximate the online hash function, using a novel technique we call Reservoir Counting, in order to create a space trade-off between the number of projections and the amount of memory each projection requires.