Seal a huge list of numbers into one tiny value, then prove any single entry with one tiny proof.
The idea: Write the data as a polynomial: a curve passing through all your values. The setup hides a secret point τ inside curve points, so you can compute "the polynomial at τ", hidden, without knowing τ. That one point is the commitment. To prove the value at some position is y, you show that the polynomial minus y divides cleanly by (x - position), which takes one extra point that a pairing can check. Since nobody knows τ, nobody can find a different polynomial matching the same commitment.
Why it matters: Used by zero-knowledge proof systems and by Ethereum to handle rollup data.
Commit to a whole polynomial with one short value, then prove its value at any point with one short proof (Kate, Zaverucha, Goldberg 2010)[1].
It needs a trusted setup (published powers of a secret τ) and q-type assumptions. Where you meet it: PLONK-style zero-knowledge proof systems[2] and Ethereum's blob data (EIP-4844)[3].
If any of these breaks, this breaks too.
If this breaks, these break with it.
Nothing on the map depends on it: it is an end point, something people use directly.