Definition
A vector commitment lets a prover commit to an ordered sequence of values with a single short string, then later open the commitment at any chosen position, proving that a particular value sits at index i without revealing or re-transmitting the whole vector. The defining requirement is conciseness: both the commitment and each opening proof are independent of the vector length, so committing to a million entries costs the same to verify as committing to ten.
Position binding
The core security property is position binding. An adversary must not be able to open the same committed position to two different values. A Merkle tree is the simplest example of a binding, concise vector commitment, though its proofs grow logarithmically and it is not hiding by default. More advanced algebraic constructions achieve constant-size openings.
Why it matters for stateless designs
Vector commitments are the cryptographic engine behind compact state proofs. By committing to large state vectors and shipping tiny witnesses, systems can let lightweight nodes validate data they do not fully store. Some schemes also support efficient updates, recomputing the commitment when one element changes without redoing the entire structure.
The pairing-based polynomial form underpins the Verkle tree, while the broader cryptographic family connects directly to the polynomial commitment scheme.
In Simple Terms
A vector commitment lets a prover commit to an ordered sequence of values with a single short string, then later open the commitment at any…