BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Meetup//Meetup Calendar 1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
NAME:Papers We Love PDX
X-WR-CALNAME:Papers We Love PDX
BEGIN:VTIMEZONE
TZID:America/Los_Angeles
TZURL:http://tzurl.org/zoneinfo-outlook/America/Los_Angeles
X-LIC-LOCATION:America/Los_Angeles
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:19700308T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:19701101T020000
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:event_314247804@meetup.com
SEQUENCE:1
DTSTAMP:20260525T032250Z
DTSTART;TZID=America/Los_Angeles:20260603T180000
DTEND;TZID=America/Los_Angeles:20260603T193000
SUMMARY:The FLP Paper
DESCRIPTION:Papers We Love PDX\nOur next paper is "Impossibility of Distri
 buted Consensus with One Faulty Process" by Fischer\, Lynch\, and Paterson
 . This paper is considered foundational for blockchain and modern distribu
 ted architectures.\n\n*The consensus problem involves an asynchronous syst
 em of processes\, some of which may be unreliable. The problem is for the 
 reliable processes to agree on a binary value. In this paper\, it is shown
  that every protocol for this problem has the possibility of non-terminati
 on\, even with only one faulty process. By way of contrast\, solutions are
  known for the synchronous case\, the “Byzantine Generals” problem.*\n
 \nLink: [https://groups.csail.mit.edu/tds/papers/Lynch/jacm85.pdf](https:/
 /groups.csail.mit.edu/tds/papers/Lynch/jacm85.pdf)\n\nAfterwards we'll soc
 ialize with a drink and a bite somewhere nearby.\n\nWe will let you in so 
 please arrive on time.
URL;VALUE=URI:https://www.meetup.com/papers-we-love-pdx/events/314247804/
STATUS:CONFIRMED
CREATED:20260412T164140Z
LAST-MODIFIED:20260412T164140Z
CLASS:PUBLIC
END:VEVENT
X-ORIGINAL-URL:https://www.meetup.com/papers-we-love-pdx/events/ical/
X-WR-CALNAME:Papers We Love PDX
END:VCALENDAR