Completeness
MerkleTree.completeness
Project documentation
Completeness theorem for Merkle trees: for any full binary tree with 2 ^ n leaves, and for any index i, the honestly-generated opening proof verifies against the honestly-built root with probability one.
Source project: VCVio
Person-level attribution pending.