BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//pretalx//cfp.protocol.berlin//protocol-berg-v2//speaker//QFCEN9
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-V3TSVJ@cfp.protocol.berlin
DTSTART;TZID=CET:20250612T133000
DTEND;TZID=CET:20250612T135000
DESCRIPTION:Blockchains today are decentralized networks of fat servers. Ro
 llups also operate on fat servers for sequencing and proving. The vast maj
 ority of users of these systems run thin clients that always interact thro
 ugh these servers\, an architecture that (1) fails to leverage the local c
 ompute capability (2) rely on (decentralised) middlemen for interaction\, 
 necessitating transaction fees for middlemen incentivisation. \n\nThis tal
 k introduces coordination-avoidance as a paradigm shift in decentralized c
 omputing. Instead of enforcing global consensus\, coordination-avoidance e
 nables direct P2P execution among users that operate local-first clients. 
 This paradigm unlocks a new design space for applications that benefit fro
 m decentralization\, high responsiveness\, and safety at the same time.\n\
 nI will discuss how DRP (Distributed Real-time Programs)\, a new Internet 
 protocol\, constructs a new kind of BFT state from consensus-free P2P netw
 orks. This approach enables applications with novel economic models that a
 re impractical for any existing client-server architectures\, regardless i
 f the servers are decentralised.
DTSTAMP:20260617T012636Z
LOCATION:Cinema 7
SUMMARY:Coordination-Avoidance: Rethinking Decentralized Networks Beyond Gl
 obal Consensus - Thomas Hsueh
URL:https://cfp.protocol.berlin/protocol-berg-v2/talk/V3TSVJ/
END:VEVENT
END:VCALENDAR