We present the design and implementation of a general framework that enables implementation and performance comparison of Authenticated Data Structures (ADSs). The framework guarantees that an ADS supports initialization, updates, and verification of queries. In the framework, we implemented the hash tree, skip list, and state-of-the-art SeqHash, and extended their functionality to enable insertion and deletion of a list of entries. We alleviate the task of a programmer by reducing insertion and deletion from three core methods: create, merge, and split. We present the results of the performance comparison. Our implementation of the skip list proves to outperform SeqHash, while supporting the same operations, being more intuitive and easier to implement, and is therefore a good alternative for practical use.