Editing Checksum (section)

==Algorithms==
===Parity byte or parity word===
The simplest checksum algorithm is the so-called [[longitudinal redundancy check|longitudinal parity check]], which breaks the data into "words" with a fixed number {{math|''n''}} of bits, and then computes the bitwise [[exclusive or]] (XOR) of all those words.  The result is appended to the message as an extra word. In simpler terms, for {{math|''n''}}=1 this means adding a bit to the end of the data bits to guarantee that there is an even number of '1's. To check the integrity of a message, the receiver computes the bitwise exclusive or of all its words, including the checksum; if the result is not a word consisting of {{math|''n''}} zeros, the receiver knows a transmission error occurred.<ref>{{Cite web |last=Fairhurst |first=Gorry |date=2014 |title=Checksums & Integrity Checks |url=https://erg.abdn.ac.uk/users/gorry/eg3576/checksums.html |access-date=March 11, 2022 |archive-date=April 8, 2022 |archive-url=https://web.archive.org/web/20220408011213/https://erg.abdn.ac.uk/users/gorry/eg3576/checksums.html |url-status=live }}</ref>

With this checksum, any transmission error which flips a single bit of the message, or an odd number of bits, will be detected as an incorrect checksum.  However, an error that affects two bits will not be detected if those bits lie at the same position in two distinct words.  Also swapping of two or more words will not be detected. If the affected bits are independently chosen at random, the probability of a two-bit error being undetected is {{math|1/''n''}}.

===Sum complement===

A variant of the previous algorithm is to add all the "words" as unsigned binary numbers, discarding any overflow bits, and append the [[two's complement]] of the total as the checksum.  To validate a message, the receiver adds all the words in the same manner, including the checksum; if the result is not a word full of zeros, an error must have occurred.  This variant, too, detects any single-bit error, but the pro modular sum is used in [[SAE J1708]].<ref>{{cite web|url=http://www.kvaser.com/zh/about-can/related-protocols-and-standards/50.html |title=SAE J1708 |publisher=Kvaser.com |archive-url=https://web.archive.org/web/20131211152639/http://www.kvaser.com/zh/about-can/related-protocols-and-standards/50.html |archive-date=11 December 2013 }}</ref>

===Position-dependent===

The simple checksums described above fail to detect some common errors which affect many bits at once, such as changing the order of data words, or inserting or deleting words with all bits set to zero.  The checksum algorithms most used in practice, such as [[Fletcher's checksum]], [[Adler-32]], and [[cyclic redundancy check]]s (CRCs), address these weaknesses by considering not only the value of each word but also its position in the sequence. This feature generally increases the [[Analysis of algorithms|cost]] of computing the checksum.

==={{anchor|fuzzy checksum}}Fuzzy checksum===
The idea of fuzzy checksum was developed for detection of [[email spam]] by building up cooperative databases from multiple ISPs of email suspected to be spam.   The content of such spam may often vary in its details, which would render normal checksumming ineffective.  By contrast, a "fuzzy checksum" reduces the body text to its characteristic minimum, then generates a checksum in the usual manner. This greatly increases the chances of slightly different spam emails producing the same checksum.  The ISP spam detection software, such as [[SpamAssassin]], of co-operating ISPs, submits checksums of all emails to the centralised service such as [[Distributed Checksum Clearinghouse|DCC]].  If the count of a submitted fuzzy checksum exceeds a certain threshold, the database notes that this probably indicates spam.  ISP service users similarly generate a fuzzy checksum on each of their emails and request the service for a spam likelihood.<ref>{{cite web | url=https://cwiki.apache.org/confluence/display/spamassassin/iXhash | title=IXhash | publisher=Apache | access-date=7 January 2020 | archive-date=31 August 2020 | archive-url=https://web.archive.org/web/20200831125801/https://cwiki.apache.org/confluence/display/spamassassin/iXhash | url-status=live }}</ref>

===General considerations===

A message that is {{math|''m''}} bits long can be viewed as a corner of the {{math|''m''}}-dimensional [[hypercube]]. The effect of a checksum algorithm that yields an {{math|''n''}}-bit checksum is to map each {{math|''m''}}-bit message to a corner of a larger hypercube, with dimension {{math|''m'' + ''n''}}. The {{math|2<sup>''m'' + ''n''</sup>}} corners of this hypercube represent all possible received messages. The valid received messages (those that have the correct checksum) comprise a smaller set, with only {{math|2<sup>''m''</sup>}} corners.

A single-bit transmission error then corresponds to a displacement from a valid corner (the correct message and checksum) to one of the {{math|''m''}} adjacent corners.  An error which affects {{math|''k''}} bits moves the message to a corner which is {{math|''k''}} steps removed from its correct corner.  The goal of a good checksum algorithm is to spread the valid corners as far from each other as possible, to increase the likelihood "typical" transmission errors will end up in an invalid corner.