performance over alternatives?

I saw there's a go version of same idea https://github.com/openacid/succinct

which has some kind of "index" to speed up the read and they have some numbers in terms of perf.

maybe this lib can have something similar too?

Start by reading the linked succinct implementation and its reported performance numbers, then inspect trie-hard's existing read path and any benchmark entry points. The issue does not identify files, tests, or a specific indexing design, so the completion criteria need to be clarified before implementation.

Written by the indexing model from the issue text.