Merkle tree data structures used for content addressing in decentralized storage systems are vulnerable to cascading failures where loss of any internal node makes data at multiple chunks unreachable, and this vulnerability increases with tree depth and uneven replication across peers

factualpending

Speaker

Vero Estrada-Galiván

Evidence Quote

“the problem is the cascading failure so if we lose one of these internal nodes we cannot locate the data so the current solution now is high levels of replication and as we can see in our own cluster we make sure we have a 1000 nodes of the password network and we have seen that not supplied replication but in the decentralized network we cannot expect much so the replication is uneven so some some chunks are replicated nine times sanctions are replicating 150 times”

Source

Distributed Consensus with Cellular Automata & Related Systems Research Conference— Wolfram
Created: 8/10/2026, 11:10:13 PM

Your notes

Loading notes...