BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//pretalx//cfp.protocol.berlin//protocol-berg-v2//talk//TV3VT3
BEGIN:VTIMEZONE
TZID:CET
BEGIN:STANDARD
DTSTART:20001029T040000
RRULE:FREQ=YEARLY;BYDAY=-1SU;BYMONTH=10
TZNAME:CET
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
END:STANDARD
BEGIN:DAYLIGHT
DTSTART:20000326T030000
RRULE:FREQ=YEARLY;BYDAY=-1SU;BYMONTH=3
TZNAME:CEST
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
UID:pretalx-protocol-berg-v2-TV3VT3@cfp.protocol.berlin
DTSTART;TZID=CET:20250612T110000
DTEND;TZID=CET:20250612T112000
DESCRIPTION:In this presentation\, we describe in detail how non-local redu
 ndancy is implemented in the Swarm  peer-to-peer network. Among other thin
 gs\, we show how to apply classic Reed-Solomon erasure codes to files in S
 warm\, discuss security levels of data availability and derive their respe
 ctive parameterisations\, describe a construct that enables cross-neighbou
 rhood redundancy for singleton chunks to complete erasure coding\, and exp
 lore alternative retrieval strategies applicable to erasure-coded files an
 d their impact on latency as well as price of retrieval.
DTSTAMP:20260414T205638Z
LOCATION:Cinema 10
SUMMARY:Non-local redundancy: Erasure coding and dispersed replicas for rob
 ust retrieval in the Swarm peer-to-peer network - viktor tron
URL:https://cfp.protocol.berlin/protocol-berg-v2/talk/TV3VT3/
END:VEVENT
END:VCALENDAR