EFF: Hill-Climbing Our Way to Defeating DRM
Hill-Climbing Our Way to Defeating DRM Computer science has long grappled with the problem of unknowable terrain: how do you route a packet from A to E when B, C, and D are nodes that keep coming up and going down as they get flooded by traffic from other sources? How do you shard a database when uncontrollable third parties are shoving records into it all the time? What’s the best way to sort some data when spammers are always coming up with new tactics for re-sorting it in ways that suit them, but not you or your users? One way to address the problem is the very useful notion of “hill-climbing.” Hill-climbing is modeled on a metaphor of a many-legged insect, like an ant. The ant has forward-facing eyes and can’t look up to scout the terrain and spot the high ground, but it can still ascend towards a peak by checking to see which foot is highest and taking a step in that direction. Once it’s situated in that new place, it can repeat the process, climbing stepwise toward the highe...