I had a similar idea and called them "Shifted Search Trees". I can see how they are also a kind of Trie

I've written about how they can not only be used for hashes but also for storing sparse indexes. I'm hoping to write an extremely tiny Lua implementation which uses only slab allocation (even better than arena IMO! Though I do love arena allocators)

https://github.com/civboot/civboot/blob/main/blog/0013-civbo...