His analogy between information theory and cryptographic hardness is also excellent.
Of course many have written on this topic, but quantifying the computational *and* financial cost of falsifying something may become as important as calculating how many bits it has.
“Hards” as the new bits?
The post this replies to
Terminus needs JavaScript to show replies and pictures.