Collision probability between truncating vs subsequencing of SHA256 hash to 128 bits?

I am taking a SHA256 hash output in hexadecimal (64 hex nibbles), subsequencing it by taking every other character to make it 32 hex nibbles or 128 bits, and formatting it into a UUID string.
This isn’t being used for security purposes, ma… Continue reading Collision probability between truncating vs subsequencing of SHA256 hash to 128 bits?

What is the hash method producing 128-bit output (32 hex chars) with lowest collision likelyhood? [migrated]

I need to utilize the UUID datatype (128bit) for storing my hashes. The goal is to be able quickly calculate/identify different records by comparing it rather than millions of 1-10k char long strings. So the goal here is not the security (… Continue reading What is the hash method producing 128-bit output (32 hex chars) with lowest collision likelyhood? [migrated]