The whole btree vs hash discussion is interesting. Many people assume "ID" columns should be hash, but iirc the default btree works best for those. Also treelike structures are fundamentally better for nearly-sequential value insertion.
The blog post that this links to comes to the opposite conclusion though, showing hash winning the benchmarks.