Data-structure lower bounds without encoding arguments

I have recently posted the paper [Vio21] (download) which does something that I have been trying to do for a long time, more than ten years, on and off. Consider the basic data-structure problem of storing bits of data into bits so that the prefix-sum queries can be computed by probing cells (or words) of […]