Are these the same as Crit-bit trees [0]?

[0]: https://cr.yp.to/critbit.html

Edit: I think I understand now from the design section on your page, they are both tries, but the HAMT uses the hash of the key to locate the node whereas Crit-bit uses the key itself.