I want update in place for sorted element list and proof for accumulator encoding of only element updated. I try to find technique similar to this, but only GCTI pop up and similar methods.
It must get elements in order of sorted list, replace ith element ($e^i$) with update list element ($e'^i$) to make new accumulation with modification. I must need proof so accumulation with update and replaced element is accepted and non-update elements check to be not updated.
If anyone know method similar to this one or some place I can find, I greatly appreciate.