38 unmodified lines
39A hash function $H$ maps arbitrary data $D$ to a fixed-size digest:
40
41$ H: {0, 1}^* -> {0, 1}^n $
42
43For CAS to work properly, the hash must be:
43For CAS to work, the hash must be:
44
45- *deterministic* — same input always produces same output
46- *collision-resistant* — hard to find $x != y$ where $H(x) = H(y)$
47- *fast* — hashing should not be a bottleneck
84 unmodified lines