---
# This file is licensed under the MIT License (MIT) available on
# http://opensource.org/licenses/MIT.

required:
                                           #-------------40 characters-------------#
    title_max_40_characters_no_formatting: Merkle Tree

    summary_max_255_characters_no_formatting: >
        A tree constructed by hashing paired data (the leaves), then
        pairing and hashing the results until a single hash remains, the
        merkle root.  In Dash, the leaves are almost always
        transactions from a single block.

    synonyms_shown_in_glossary_capitalize_first_letter:
        - Merkle tree

optional:
    synonyms_and_pluralizations_not_shown_in_glossary:
        - merkle trees

    not_to_be_confused_with_capitalize_first_letter:
        - Partial merkle branch (a branch connecting one or more leaves to the root)
        - Merkle block (a partial merkle branch connecting one or more transactions from a single block to the block merkle root)

    links_html_or_markdown_style_capitalize_first_letter:
        - "[Merkle tree](/en/developer-guide#term-merkle-tree) --- Developer Guide"
        - "[Merkle trees](https://en.bitcoin.it/wiki/Protocol_documentation#Merkle_Trees) --- Bitcoin Wiki"
        - "[How do I implement a merkle tree?](http://bitcoin.stackexchange.com/q/1110) --- Bitcoin StackExchange"
        - "[Merkle tree](https://en.wikipedia.org/wiki/Merkle_tree) --- Wikipedia"

---