The way 'bit rot' degrades digital data over time

Digital data isn't permanent; it’s actually as fussy as a woolly jumper left in a damp beach hut. We call it "bit rot," and it’s the slow, silent decay of your files.

Imagine your data as a long line of light switches. Over years, magnetic fields weaken or a stray cosmic ray zaps the drive, flipping a switch from "on" to "off."

That single tiny flip—a one becoming a zero—is all it takes to turn a crisp photo into a glitchy mess. Even silicon eventually loses its memory.

Wait, if it's just one switch, why can't the computer just flip it back?

It would, if it knew which one tripped! But imagine you’ve got a thousand jars of jam in the larder and one label falls off. Unless you remember exactly what was in that specific jar, you’re just guessing whether it’s plum or strawberry.

To fix it, we have to store 'checksums'—basically a little note on the back of the door saying how many jars of each there should be. It’s extra housework, and most cheap consumer gadgets are far too lazy to bother with those chores.

Without those notes, the computer just sees the zero and assumes that’s how you wanted it. It doesn't realize the switch was bumped by a cosmic breeze until you try to open the file and find it's gone off.

But surely those little 'checksum' notes can rot away as well?

That's the snag! If the note gets a smudge, the whole larder is a mystery again. To avoid that, we use 'redundancy'—which is just a fancy word for keeping spares.

It’s like having three copies of a recipe. If one gets covered in jam and another blows away at the beach, you’ve still got the third one in your knitting bag.

Computers store these 'notes' in multiple spots or use clever patterns that can rebuild themselves even if a corner is torn off. It’s extra housework, but it keeps the digital moths at bay.

So we have to waste triple the space just to stay safe?

Goodness, no! That would be a right muddle, filling the entire pantry with identical jars. We’ve found a much thriftier way to manage the faff, often called "parity."

Think of it like a simple sum: 2 + 3 = 5. If the "3" gets smudged, you can look at the 2 and the 5 and work out exactly what’s missing. You don't need a whole second sum; you just need that one extra "result" to solve the puzzle.

It’s clever maths doing the heavy lifting so you don't have to buy a bigger cupboard. We store just enough "clues" to recalculate the lost bits without actually doubling the luggage.

Does that simple sum still work if two numbers go missing?

Oh, you’ve spotted the catch! A single sum is a one-trick pony. If both the '2' and the '3' vanish, you’re just left with a '5' and a confused face. You can't tell if it was 1+4 or 0+5.

To handle a proper disaster, we use fancier maths, similar to a Sudoku puzzle. We create overlapping 'clues' so a missing bit can be found using a different 'sum' entirely.

It’s more 'faff' for the computer, but it keeps the tea party on track. We simply add a few more 'result' jars to the row.