I may have proved that every single hash function is shit

* hashes are always fixed lenght e.g. 256bit
* data can be unlimited big so there are infinite possibilitys to construct data
* so there are infinite conflicts, thus its just a matter of average data size which defines if a hash function is shit or not

So how is the shittynes of a hashfunction defined? It should define the current average datasize

Pls correct me if im wrong