Exclusion proof cost I am trying to understand what is the cost of non-membership verification for a universal accumulator?

More specifically, how can I compute it?

Whether using an accumulator is more efficient than the Merkle Hash tree?
In section 5.3 of this paper you can find a comparison between an accumulator and MHT. The complexity totally depends on the scheme.



In general, MHT is linear in the proof of exclusion (in the order of depth of the tree). Because the verifier has to check all the possible paths to convince a leaf is not in the tree.