addHashesWithProof
Verifies a BitTorrent v2 hashes proof against this tree and, on success, inserts the proven hashes and their uncle nodes. Pure-computation analogue of merkle_validate_and_insert_proofs: the run of baseHashes (starting at flat base-layer offset startIndex) is folded into a subtree root, then the proofLayers uncle hashes are walked upward until they reach a hash already known in this tree (or the expectedRoot). If the proof checks out, the subtree root, the uncle hashes, and the recomputed ancestors are written in and the function returns true; otherwise the tree is left unchanged.
Return
true iff the proof validated against this tree's known hashes/root.
Parameters
contiguous base-layer hashes (non-empty).
offset of the first base hash within the base layer.
uncle hashes bottom-up; may be empty if the subtree root should equal the file root directly.
pad hash for the base layer (default the all-zero block pad).