As the hash can be completely constructed after we know all reference definition links (i.e. between block analysis and inline analysis), it might be also possible to use perfect hashing. The construction is O(n), retrieval O(1). There is no need to fear what kind of cryptographic weakness shall be found tomorrow or whether you generate key in secure-enough way.