Crit-bit tree

Adapting the code from patricia to critbit trees should be rather easy.

https://cr.yp.to/critbit.html

Moreover, because the position in a 64-bit index can be stored using 6 bits, we could even store this position in OCaml's tag byte (gaining two words instead of one)