I posted about @WalrusProtocol 2 weeks back. While drafting that, I came across a research paper they dropped in April. Finally sat down with it. TL;DR ↓ • Every decentralized storage network has the same problem: How do you keep data safe without making 25 copies of everything? • Arweave: Just make 25 copies. Safe, expensive. • Storj/Sia: chop files into pieces, 3 copies worth. Cheap, but if a node dies you have to download the whole file to rebuild its piece. Brutal at scale. • Walrus: 4.5 copies worth, but when a node dies, the replacement only downloads a tiny fraction of the file to rebuild what was lost. • Imagine the file as a grid instead of a list. Each node holds one row and one column. Lose a node and the new node grabs one cell from each surviving node, enough to mathematically reconstruct the missing row and column. When storage nodes swap in or out, most protocols pause writes during the handoff. Walrus doesn't. New writes go to the new nodes, old reads stay with the old. Every file is tagged with when it was written so clients know where to look. Decentralized storage used to force tradeoffs of low cost, fast recovery, OR no downtime. Walrus’ architecture somehow managed to get all three done. Disclosure: I’m holding $WAL