btree->prune_timestamp is updated sequentially when we pick up a new checkpoint. There is no concurrent writes to the variable. In addition, the value is increased monotonically. Therefore, either the reader reads the old value or the newly written value doesn't impact correctness. We can safely read it using relaxed ordering as well.