pub const MAX_AUDIT_DEPTH: u32 = 31;Expand description
Largest subdivision depth the coverage audit can represent exactly.
Each subdivision splits all four parameter axes, so a leaf at depth d
covers 16^-d of its root box. The audit sums 16^(MAX_AUDIT_DEPTH - d)
as u128, needing 4 * MAX_AUDIT_DEPTH <= 127 to stay exact. A larger
bound would silently saturate, and a saturated sum can mask a real gap.