← All terms

Commitment hash

A hash over the exact inputs, factors and result of a calculation, so the same inputs always produce the same value.

A commitment fixes a calculation in place. Recompute with identical inputs and factors and you get an identical hash; change anything and it changes.

What it proves is reproducibility: this result follows from these inputs. What it does not prove is when the calculation happened — for that the commitment has to be anchored to something with an independent timestamp.

The distinction is worth keeping straight, because the two are often described together and only one of them is present in most systems.