fn verify_padding_nodes()

in src/proof.rs [713:730]

• 18 lines of code
• 5 McCabe index (conditional complexity)

    fn verify_padding_nodes(
        &self,
        siblings: &&[<V as ProofExtractable>::ProofNode],
        padding_refs: &[(TreeIndex, usize)],
    ) -> bool {
        for i in 0..padding_refs.len() {
            if padding_refs[i].1 >= siblings.len()
                || !<V as PaddingProvable>::verify_padding_node(
                    &siblings[siblings.len() - 1 - padding_refs[i].1],
                    &self.padding_proofs[i],
                    &padding_refs[i].0,
                )
            {
                return false;
            }
        }
        true
    }