FSST is similar in terms of underlying complexity. You need this complexity to get good performance though, it seems from the research.

If there were something better than FastPFOR, we would use it. If something comes up, we can always use a new tag and add it in the future.

There is still a lot to do, for example one can do like-operators on FSST without decompressing it.