Before revision:  It stores }  ]  O(\log^2\log U) + (  H_0/I_0)b \approx 1.98b bits , and estimates cardinalities of multisets of U with a standard error of ( 1 +o(1)) /\sqrt{b}.
After revision:  It stores } estimator function. It is proved that with high probability, Fishmonger processes a multiset of ] O(\log^2\log U) + ( H_0/I_0)b \approx 1.98b bits , and estimates cardinalities of multisets of U with a standard error of ( 1 +o(1)) /\sqrt{b}.