Improved performance by ~25% in heavy usage situations, such as a program with heavy recursion that triggers the garbage collector often. The main bottleneck when parsing stack frames is lookup_return_address, which used 64-bit integer division to compute the hash table's bucket index. I've rounded up the number of entries to be a power-of-two and use a bitwise-AND instead.