{"p":"can-20","op":"mint","tick":"can","amt":"1000","rows":[{"df":"qa","content":[{"q":"How do I calculate the cost of creating a concurrent Merkle tree on the chain in JavaScript?","a":"First, determine the depth of the Merkle tree. A Merkle  tree with a depth of h can represent 2^h - 1 leaf nodes."}]}],"pr":"a5f19c48b1c3a7af3b7731d499ff98617f093e500f515ec644b85671b7fb85de"}