Efficiency on scale instead of detail.

A hash method would quickly run out of disk space before it could be used to verify every single file. Hence hashed b-tree for xfs (or is it jfs? I forget), and stuff like that.

A verify once used many times method is more efficient on a large scale.

I'm no maths expert, heck i don't even know calculus.