eBPF has changed several of these constraints [0] - Verifier can explore up to 1million insns now instead of 4096 - 512 bytes of stack but with tail chaining

eBPF has changed several of these constraints [0] - Verifier can explore up to 1million insns now instead of 4096 - 512 bytes of stack but with tail chaining you have up to 8k - Bounded loops have been added. Unbounded loops are prevented by design to not stall the kernel [0] https://docs.cilium.io/en/v1.12/bpf/ https://docs.cilium.io/en/v1.12/bpf/