Currently, murky builds a full binary tree to calculate the root / proof of a given set of data elements. This mismatches with other implementations which build a complete binary tree. This PR is an early draft of support for building complete trees and generating roots and proofs over them.
Currently, murky builds a full binary tree to calculate the root / proof of a given set of data elements. This mismatches with other implementations which build a complete binary tree. This PR is an early draft of support for building complete trees and generating roots and proofs over them.