I’ve been thinking that the Sparse Merkle Tree used for membership and non-membership proofs can be probably replaced by Vector Commitments which can be aggregated and batched, as described in https://eprint.iacr.org/2018/1188.pdf.
Is anyone working on this, and/or a onchain Vector Commitment verifier?