NMT's treap implementation originally used JFR's PRNG implementation and seeded it with os::random. This turns out to lead to poor performance at times, as JFR's PRNG only has 48 bits of entropy. We can improve the situation markedly by implementing a better RNG (for example, achieving 64 bits of entropy via os::next_random).