Q&A for Module 1

If you have any questions after taking the full Module 1 of the course, leave them here.

If you haven’t finished the entire module yet, do not leave a question yet. Your question will probably be covered in the upcoming resources.

1 comment / Add your comment below

  1. For Merkle tree/Merkle root, If we have an odd number of transactions (say n) in a block then why need to add n+1 hashes, can’t it work with n hashes for that block?

    if no must-have n+1 hashes then It is for, all siblings nodes/transactions must be on the same level of Merkle tree.

Leave a Reply

Your email address will not be published. Required fields are marked *