Hash Addressible Mapped Trie

Guaranteed determinstic output from a set of instructions, regardless of order.

Breaks up a hash of the keys into fixed-bitwidth segments and then groups them.

Bluesky uses a “merkle search tree” variant. See also: “Prolly trie”