.. the Swarm peer-to-peer network. In this presentation, we describe in detail how non-local redundancy is implemented in the Swarm peer-to-peer network. Among other things, we show how to apply classic Reed-Solomon erasure codes to files in Swarm, discuss security levels of data availability and derive their respective parameterisations, describe a construct that enables cross-neighbourhood redundancy for singleton chunks to complete erasure coding, and explore alternative retrieval strategies applicable to erasure-coded files and their impact on latency as well as price of retrieval.