BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//pretalx//cfp.devcon.org//devcon8//speaker//Y83WVG
BEGIN:VTIMEZONE
TZID:IST
BEGIN:STANDARD
DTSTART:20000101T000000
RRULE:FREQ=YEARLY;BYMONTH=1
TZNAME:IST
TZOFFSETFROM:+0530
TZOFFSETTO:+0530
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:pretalx-devcon8-SBGB8A@cfp.devcon.org
DTSTART;TZID=IST:20261105T145000
DTEND;TZID=IST:20261105T145700
DESCRIPTION:We do what we can. Consensus is hard. Machines do Hard Work\, o
 n Hard Computational problems to maintain it: consensus.\nCan we break fre
 e of the shackles? let's unleash the chains: can PoWs act as honeypot-like
  detectors for certain types of computation? (eg Quantum Solvers)\nWhat do
 es a world like that look like? What computational class elegantly scales 
 between quantum-easy and classically hard? Can we attract quantum solvers 
 to the nectar\, showing their hand in the process?--even ready to help us 
 compute routines in The Big Computer.
DTSTAMP:20261101T133502Z
LOCATION:Lotus Stage 1
SUMMARY:Prisoners of Work: Can Proof-of-Work Detect Quantum Computers? - Aa
 ta Hokoridani
URL:https://cfp.devcon.org/devcon8/talk/SBGB8A/
END:VEVENT
END:VCALENDAR