Is it worth to implement another proof calculation algorithm

[gennadylaventman]

Current proof algorithm based on QLDB hash concatenation algorithm and may result in smaller intermediate hashes that path from root to leaf node in Merkle tree. There are another algorithms that do this calculation differently and provide longer proofs - same length as path from root to leaf node.