We study append-only set commitments with efficient updates and inclusion proofs, or cryptographic accumulators. In particular, we examine how often the inclusion proofs (or witnesses) for individual items must change as new items are added to the accumulated set. Using a compression argument, we show unconditionally that to accumulate a set of n items, any construction with a succinct accumulator value ( \(O(\lambda \ \textsf{polylog}\ n)\) storage) must induce at least \(\omega (n)\) total witness updates as n items are sequentially added. In a certain regime, we strengthen this bound to \(\varOmega (n \log n/\log \log n)\) total witness updates. These lower bounds hold not just in the worst case, but with overwhelming probability over a random choice of the accumulated set. Our results show that a close variant of the Merkle Mountain range, an elegant construction that has become popular in practice, is essentially optimal.