I have a set of data that I want to sync, and instead of sending an entire set of data, I wanted to use a hash.
It is basically a list of GUIDs with either "true" or "false".
eaa54efe-2b10-4d3b-b9c2-30d2bcca7e06 : true 94297d72-573a-4e6c-a45e-37a390750b64 : false 36d1acbd-b2dc-4a90-a7be-fb65b63639a5 : true
I plan to generate a hash of the entire list so that I can send much fewer data to sync than the entire data set.
Should I ever be concerned that a specific change of true/false will happen to randomly result in a collision and become "undetected" or is that really not going to happen?
I don't really understand the math and proofs behind the hashes, but I also understand that good hashes are supposed to be designed against trivial collision.
Note: the main goal is just data comparison. There is no encryption of the data because they're useless data without the meaning behind the GUIDs. This is, literally, live data I just posted.