On: RSA-896

[gpugreg]

Here's a larger partial hash collision (108 trailing bits):

    echo 23ca73454a1b981fe51cad0dbd05f4e696795ba67abb28c61aea1a024e5bbeca | xxd -r -p | sha256sum
    echo a16a8141361ae9834ad171ec28961fc8a951ff1bfc3a9ce0dc2fcdbdfa2ccd35 | xxd -r -p | sha256sum

From this post from 6 years ago: https://www.reddit.com/r/crypto/comments/guctw4/finding_sha2...

[Retr0id → gpugreg]

True, I forgot about that! It's more fun when the inputs are printable ascii, though :P

It should also be easy to beat with just a few GPU weeks.

[gpugreg → Retr0id]

I agree that ASCII is definitely cooler, for example when personalizing the hashed data as in your example.