The BPF verifier has historically worked by tracing every possible path of execution through a program, checking, at each instruction, that various safety properties hold. This works, but it can result in an exponential increase in the number of states that need checking in programs with complicated control-flow. Alexei Starovoitov, one of the kernel's core BPF maintainers, has shared
a patch set that substantially reworks how the verifier tracks states, in order to reduce the size of that exponential explosion.
![[$] Added indirection allows for larger BPF programs](/_next/image?url=https%3A%2F%2Fapi.wrkm.app%2Fstorage%2Fmedia%2Fdefaults%2Fcategory-operating-systems-v1.png&w=3840&q=75)





