We all know that we're supposed to take a fairly slow hashing algorithm, salt the password, and run the hash for many iterations. Let's say that I'm following almost everything except for one rule, and I have a static salt. Something like this:

```
password = 'yaypuppies' + some_static_salt

1000.times do
    password = amazing_hash(password)
end

```

And now `password` is a great hashed and salted thing. All is well with the world.

But what if we ran it a whole lot more iterations?

```
3000000000000000000.times do # 3 quintillion
    password = amazing_hash(password)
end

```

Would, in theory, many passwords collide? I.e. would this happen?

```
pass1 -> lkajsdlkajslkjda > 23oiuolekeq > n,mznxc,mnzxc > common_thing > 987123oijd > liasjdlkajsd > 09893oiehd > 09uasodij
pass2 -> loiuoklncas > 9830984cjlas > ioasjdknckauyieuh > common_thing > 987123oijd > liasjdlkajsd > 09893oiehd > 09uasodij

```

And both passwords end up hashed to `09uasodij`?

With a non-randomized-per-password salt, does the chance of a collision go up with every iteration added?