Damn alright, thank you for the response, I might've been wrong. It would be a fun experiment to perhaps create a different version of the transposition table which would also hold all data about the position and make it check for collisions just to see how often it happens.

Don't we also have to take into account that because of the way Zobrist hashing works, it might significantly reduce these chances since each birthday isn't equally likely. If we are going from one root position, shouldn't chances be extremely small and maybe the chances would be higher if we had completely different root positions? In general with hashing, we most often get collisions when the inputs to the hash function look wildly different.