It is an interesting idea. There just seems a lot wrong with the presentation of the benchmark comparisons... Specifically where is a full suite of comparison

It is an interesting idea. There just seems a lot wrong with the presentation of the benchmark comparisons... Specifically where is a full suite of comparisons as compared with other libraries for time and space, insert and retrieval. Hell, I make those graphs for other people's code, let alone my own. Usually when you come up with a new algorithm it is typical to be so over the moon to show how it compares all around. I'm not seeing this here and that is a red flag. I'll definitely give it a whirl though as it sounds promising, although I'm personally more interested in order preserving hashes.