[$] Added indirection allows for larger BPF programs
The BPF verifier has historically worked by tracing every possible path of execution through a program, checking, at each instruction, that various…
Why am I seeing this Ranked on source trust — LWN
It ranks mainly on source trust: LWN is the most reliable outlet we track on this subject, and is the only one on the story so far.
Single-sourced. No second organisation has confirmed it yet.
Link-outLink-out, because only one organisation carries it and no first-party source is on it and the subject could not be identified from the text. Link-out means we point at the publisher and say nothing of our own.
| Factor | Weight | Score | Contribution | Where it came from |
|---|---|---|---|---|
| Corroboration | 0.35 | 0.39 | +0.135 26% | 1 independent org on the story. Tier-3 aggregators never corroborate — they can show something is circulating, never that it is true. |
| Source trustleads | 0.25 | 0.85 | +0.212 40% | LWN is the highest-trust source on this story. Trust is taken from the best source, not averaged. |
| Pickup rate | 0.20 | 0.00 | +0.000 0% | One counted organisation, so there is no spread to measure — nothing has picked this up to set a rate. |
| Freshness | 0.20 | 0.89 | +0.177 34% | Halves every 10 hours from the newest item on the story. This is the only factor that rewards a story for nothing more than being recent. |
Corroboration counts distinct organisations, once each, and only from tiers 1 and 2. Freshness halves every 10 hours, so this ranking is a snapshot and will differ at the next build.
The BPF verifier has been redesigned to handle larger programs by reducing the computational complexity of state tracking. Previously, the verifier examined every possible execution path through a program, checking safety properties at each instruction. With intricate control flow, this approach caused an exponential growth in the number of states requiring verification.
A patch set from Alexei Starovoitov, a core BPF maintainer, restructures how the verifier tracks these states. The changes aim to contain the exponential expansion that occurs during verification of complex programs, making it feasible to verify larger BPF programs than before.
The rework addresses a fundamental limitation in the verification process without altering the safety guarantees. Programs that previously could not be verified due to state explosion may now pass verification with the improved tracking mechanism.
What happened
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.
How this story arrived
Ordered by when each source was first observed, which is what the velocity figure is computed from. Publishers backdate; observed order does not.
- 01 Lwn first seen [$] Added indirection allows for larger BPF programs
Overclock clusters coverage from independent sources and grades it automatically. The figures above are computed, not editorial. This page summarises and links to reporting by the outlets named — follow the links for the original work.