In the first part of this series, we explored how packet loss accumulates in block and fountain codesâeven in simple network topologies such as daisy chainsâand how the recoding capability of RLNC effectively mitigates this issue. In this follow-up article, we examine hierarchical topologies, such as trees, which have been adopted by Web3 protocols such as Monad and Solana. We present a simple example demonstrating that, even in tree-based architectures, RLNC can outperform both Raptor and ReedâSolomon (RS) codes by achieving lower latency.