I am working on a proof of concept around cryptographic accumulators. The following is my understanding so far
delta : the current size of the tails file in the accumulator.
witness : the current value of the accumulator when the entry of your number was made.
index : the actual index that is added to the accumulator.
tails file :list of all witnesses.
When an index is added to the accumulator, the witness and delta are shared with the prover.
When the prover wants to prove to a verifier that the index is part of the accumulator he updates the witness using the delta(and tails file) and shares the updated witness with the verifier which allows for verification.
My question is: Wouldn't the tails file become very large as the number of entries increase slowing down the process of proof and verification?
Is there a solution to this?