Sublinear Vector Commitments Achieve Optimal Stateless Client Update Efficiency
A new vector commitment scheme achieves sublinear complexity for both global update size and local proof updates, solving the stateless client efficiency trade-off.
