5 ms·
My rule of thumb is that digital system error rates are about 1 bit per 10^12 to 10^15, depending on the specifics. That's the typical bit error rate quoted by
by jiggawatts 5y ago
My rule of thumb is that digital system error rates are about 1 bit per 10^12 to 10^15, depending on the specifics.
That's the typical bit error rate quoted by manufacturers of network devices and hard drives. Physically, something like a PCIe bus is also a network link, and has similar bit error rates.
Of course, some of these are detectable, and some are correctable. But some are uncorrectable, and the worst ones are undetectable.
In my experience, digital signing or encryption for protocols helps noticeably reduce random crashes and weird unreproducible errors. Similarly, disk formats like ZFS, BTRFS, and ReFS that keep cryptographic hashes of the data also regularly report corruption when used at scale.
A rule that I've come up with is:
Security is synonymous with robustness.
Things that improve one almost always improve the other, and neither is really possible without the other. Cryptography is not just there to keep the hackers out, it also ensures that bit flips are caught before they crash your mission-critical application.
- jxf 5y agoWhat's an example of an error that's undetectable? I'm a little confused about what that means. If an error produces no observable effect, it doesn't seem like it matters very much, unless I'm missing something.
- ironmagma 5y agoI assume an undetectable error would be one that cannot be detected except by running the computation again and comparing the results, as opposed to a simple check like a checksum. Or maybe it’s e.g. an error that flips 2 bits, with a 1 bit parity check.
- pdw 5y agoSuppose you protect a piece of data with a checksum. The data gets corrupted and the checksum no longer matches. That's a detectable error. But if you're unlucky, the checksum of the corrupted data matches the original checksum. That's an undetectable error.
- Rexxar 5y agoIf you do a numerical simulation the result could be different than expected but without any easily visible error.
- michael1999 5y agoThey mean that single bit errors are detected in storage systems like ecc memory, or ZFS, and will raise a fault (I.e. be detected). Checksums tend not to follow data into the code. So bit flips in the cpu could do anything at runtime: wrong addition, choosing the wrong branch of an “if” block, etc.
- carlmr 5y ago>Security is synonymous with robustness. There's certainly a large overlap. At the same time you can use insecure hashes for robustness, so the implication doesn't go both ways. That's why I would say security usually implies robustness.