A Compiler for Efficient Vector Commitments   Weije Wang
Channel: Protocol Labs
Date: 2022-04-11

We present a new compiler for efficient vector commitments. By taking as input any vector commitment that is updatable, aggregatable, and has O(nlogn) time to open all proofs, our compiler can produce another vector commitment that balances, with the help of bookkeeping, the time complexity between UpdateAllProofs() and Aggregate(). More specifically, the produced vector commitment requires O(√nlogn) time.