Take the 2-minute tour ×  At this moment I'm using a simple
checksum scheme, that just adds the words in a buffer. Firstly,
my question is what is the probability of a false negative, that
is, the receiving system calculating the same checksum as the
sending system even when the data is different (corrupted).
Secondly, how can I reduce the probability of false negatives?
What is the best checksuming scheme for that. Note that each
word in the buffer is of size 64 bits or 8 bytes, that is a long
variable in a 64 bit system.  share|improve this question Is
there a reason you are not using an industry-standard checksum
like CRC, MD5 or SHA? –  Jon Mar 1 '12 at 10:44 do I understand
correctly that the order of words doesn't matter? note: if you
assign a unique id for each input (store it in a database) then
you can reduce the probability to zero.. question is do you need
that? –  Karoly Horvath Mar 1 '12 at 10:45 Assigning a
probability of non detection of changes is possible only if you
give the probability of