eBPF: Now Turing Complete!
Talkat Cilium + eBPF Day North America 2024 · on Tuesday, 2024-11-12· at 10:15· Salt Palace | Level 1 | Grand Ballroom B·
summary
Implements Conway's Game of Life entirely inside the kernel using eBPF by splitting logic across multiple programs and persisting cells in maps for state, proving eBPF can be Turing complete despite the verifier's one million instruction analysis limit. Scheduling happens via BPF timers or attaching programs to perf events; rendering is done in user space while all cell evolution runs in-kernel. Code is available on the Isovalent GitHub and the demo runs continuously.
AI-written summary · about
