The code that didn’t break

Last week I wrote a post on hiding cryptographic keys in decks of cards. I wrote some code for that post that shouldn t work, but before fixing I noticed that it in fact did work. The code computes logarithms for integers larger than the largest representable float. For example, the largest float is on the [ ] The post The code that didn’t break first appeared on John D. Cook .