[$] BPF loop verification with scalar evolution

The BPF verifier has, in the course of wrestling with the difficult problem ofstatically analyzing loops, grown special support for many kinds of loops over itshistory, but its fundamental approach to simple for loops has notchanged.When it encounters a loop, it evaluates it, iteration by iteration, until reachingan exit condition - a process that can cause the verifier to mistakenly hit thelimit on the number of allowed instructions where a better implementationwould not.Eduard Zingermanspoke at the 2026Linux Storage, Filesystem, Memory-Management, and BPF Summitabout his in-progress work on improving the verifier's treatment of loops, especially nestedloops.