CRC (cyclic redundancy check) is one of the most common methods of error detection. It uses some interesting mathematical tricks to guarantee that it can catch certain kinds of errors. How does it work? Support these videos on Patreon: https://www.patreon.com/beneater or https://eater.net/support for other ways to support. 00:00 - Detecting errors with modulo division 10:51 - Message data as a polynomial 16:41 - Finite fields 22:57 - Polynomial division 31:04 - Sending and verifying CRC 36:29 - Choosing a generator polynomial ------------------ Social media: Website: https://www.eater.net/ Twitter: https://twitter.com/ben_eater Patreon: https://patreon.com/beneater Reddit: https://www.reddit.com/r/beneater Special thanks to these supporters for making this video possible: Ben Dyson Ben Kamens Ben Williams Brandon Stranzl Christopher Blackmon Debilu Krastas Eric Dynowski Gonzalo Belascuen Greg Stratton Jay Binks Jayne Gabriele Johnathan Roatch Jordan Scales Manne Moquist Michael Nicholas Moresco Nick Wrightsman Randy True Ric Allinson Sachin Chitale SonOfSofaman