Efficient diffing against the base node state

As discussed on oak-dev@, diffing modified node states against their base states (i.e. compare(base, builder.getNodeState(), ...)) should be an O(k) operation, where k is the number of changes instead of O(n) where n is the size of the base state.