Worked solution: The three-dimensional case: every Kakeya set in $\mathbb{R}^3$ has dimension 3 (Wang–Zahl, 2025)
Rather than tiling crudely by cubes, Wang and Zahl show (adapting Guth's polynomial-method approach to graininess, since the stickiness-based route of Katz–Łaba–Tao is unavailable here) that the tubes inside a fat tube organize into essentially disjoint 'grains' — flat rectangular prisms of some intermediate, a priori unknown dimensions , taken as large as possible. Replacing the wasteful fat-tube multiplicity from Step 2 by the multiplicity of these tighter-fitting grains, , gives a strictly better multiplicity inequality : if, after rescaling, the grains behave like an ordinary (or sparser) Kakeya configuration, already bounds and a companion bound on closes the induction outright, exactly as in the sticky case.
This step (Wang–Zahl 2025, §5, an adaptation of the 'graininess' technology introduced by Guth via the polynomial method) is the technical heart of the non-sticky case. Because Katz–Łaba–Tao's original stickiness-based graininess reduction needs an 'x-ray estimate' unavailable in this generality, Wang and Zahl instead run a polynomial partitioning argument to find, inside each fat tube , the coarsest possible decomposition of the enclosed thin tubes into flat disjoint prisms. The multiplicity inequality this yields is strictly sharper than the naive of Step 2 whenever the grains are genuinely smaller than the fat tube itself, since then measures overlap of the grains rather than of the much larger, wasteful fat tubes.