When you don't have a need for a cryptographic digest, it's important to think of the channel's bit error distribution in selecting a checksum algorithm.
Different checksum algorithms can provide better error detection for specific channel error models (potentially even with fewer bits). Non-cryptographic checksums are typically designed for various failure models like a burst of corrupt bits, trading off what they do/don't detect to better match detection of corruption in the data they will protect.
For example, if you know that there will be at most one bit flip in your message, a single bit checksum (parity check) is sufficient to identify that an error occurred, regardless of your message size. (Note that this is an illustrative example only, since, typically, messages have a certain number of errors for a certain number of message bits -- the expected number of errors depends on the size of the message.)
The Navy Electricity and Electronics Training Series (NEETS) are a good high level overview that can help you learn which areas you want to explore further. Specifically to the questions you asked, module 1 will give you the overview on basic circuits.
Rechargeable battery wear can be separated out into (1) cycle aging and (2) calendar aging.
One of those typically dominates the total battery degradation, depending on the use case. EVs for personal use tend to have calendar aging dominate the overall battery degradation early in their life.
The book referenced in the original comment (Command and Control: Nuclear Weapons, the Damascus Accident, and the Illusion of Safety) specifically digs in to the limitations behind the safety mechanisms.
Specific to the incident here, only 1 of 4 safety mechanisms prevented an catastrophic incident. The details in the wikipedia page [1] about this incident is well worth a read.
Some more context here is that Reed Solomon and Shamir's Secret Sharing both take some data and produce N pieces (commonly called shards or horocruxes), any K of which can reconstruct the original data (K <= N).
The difference is that Shamir's makes it so that having up to K-1 pieces reveals _no_ information about the original data. You may be able to infer certain data from less than K shards in Reed Solomon.