In our implementation of TM with orecs, we used a simple vector to store transaction read sets. Suppose there were 216 orecs, with a strong hash function for mapping addresses to orecs. How many...

In our implementation of TM with orecs, we used a simple vector to store transaction read sets. Suppose there were 216 orecs, with a strong hash function for mapping addresses to orecs. How many randomly chosen accesses would a single trans action need to make before it would read the same orec twice?