BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//pretalx//pretalx.com//hack-lu-2026//speaker//FSETUL
BEGIN:VTIMEZONE
TZID:Europe/Luxembourg
BEGIN:DAYLIGHT
DTSTART:20251021T000000
TZNAME:CEST
TZOFFSETFROM:+0200
TZOFFSETTO:+0200
END:DAYLIGHT
BEGIN:STANDARD
DTSTART:20251026T030000
RDATE:20261025T030000
TZNAME:CET
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
END:STANDARD
BEGIN:DAYLIGHT
DTSTART:20260329T030000
RDATE:20270328T030000
TZNAME:CEST
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
SUMMARY:Unintended Computations - Nicolas Seriot
DTSTART;TZID=Europe/Luxembourg:20261021T114500
DTEND;TZID=Europe/Luxembourg:20261021T121500
DTSTAMP:20261009T050027Z
UID:pretalx-hack-lu-2026-WNYDFF@pretalx.com
DESCRIPTION:A printer language\, a Jira rule\, and Unicode transliteration
  are rarely treated as execution environments. Yet ordinary features can c
 ompose into something much more powerful than their intended role suggests
 .\n\nThis talk asks a simple question: **what can this system compute?**\n
 \nWe start with a network printer playing chess\, then make the question s
 ystematic. A universal two-counter machine is assembled from ordinary text
  utilities\, then rebuilt in Jira automation. Finally\, universal computat
 ion emerges from Unicode transliteration rules.\n\nAcross these examples\,
  the same pattern appears: **state\, conditional choice\, and feedback**. 
 Together they can create an unexpected programmable substrate even when no
  individual component looks like an interpreter.\n\nBut computational powe
 r alone is not a vulnerability. The security questions come next: **who ca
 n steer the computation\, what operational bounds constrain it\, what auth
 ority does it inherit\, and what trust boundaries can it cross?**\n\nThe r
 esult is a practical method for finding unexpected execution surfaces hidd
 en inside ordinary systems and their composition.
LOCATION:Europe
URL:https://pretalx.com/hack-lu-2026/talk/WNYDFF/
END:VEVENT
END:VCALENDAR