In the current implementation, the hash (and equivalence) of a node depends on the hash of all child-nodes, making the hash computation more expensive than needed. By storing the hash (and liveliness flags) of all child nodes in the parent node, we can optimize the hash computation significantly.