Counted b-trees are going to be implemented not internally, but using a well-documented recipe, just like null keys or duplicate keys. The same strategy for counting could be used for a Merkle tree, once there is an externalized balance interface that will allow the user to mirror a tree structure.