3 ms·eBPF isn’t Turing complete because it has to be able to prove that loops are bounded.by School-Cotton 2y agoeBPF isn’t Turing complete because it has to be able to prove that loops are bounded.