{"author":{"username":"balajis","displayName":"balajis","fid":37},"timestamp":"2023-08-17T22:41:55.000Z","text":"His analogy between information theory and cryptographic hardness is also excellent.\n\nOf 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.\n\n“Hards” as the new bits?","farcaster":"https://farcaster.xyz/balajis/0xce10fe07","firefly":"https://firefly.social/post/farcaster/0xce10fe07871d4b8ee1a1a2fd22bfffd08863dddb"}