Constant MAX_LEVELS 

pub const MAX_LEVELS: usize = _; // 32usize

There should never be more than 32 sibling levels in a proof. Because Proof::leaf_count is a u32, a tree can have at most u32::MAX leaves, which requires at most u32::BITS sibling hashes per proven item.