"Merkle tree" meaning in English

See Merkle tree in All languages combined, or Wiktionary

Noun

Forms: Merkle trees [plural]
Etymology: Named after American computer scientist Ralph Merkle (1952–), who patented it in 1979. Etymology templates: {{named-after/list|computer scientist||||}} computer scientist, {{!}} |, {{lang|en|Ralph Merkle}} Ralph Merkle, {{named-after|en|Ralph Merkle|born=1952|nat=American|occ=computer scientist|wplink==}} Named after American computer scientist Ralph Merkle (1952–) Head templates: {{en-noun}} Merkle tree (plural Merkle trees)
  1. (computer science, cryptography) A binary hash tree. Wikipedia link: Merkle tree Categories (topical): Computer science, Cryptography Related terms: binary tree, tree, trie Translations (binary hash tree): 墨克樹 (Chinese Mandarin), 墨克树 (mòkèshù) (Chinese Mandarin), 默克爾樹 (Chinese Mandarin), 默克尔树 (Mòkè'ěr shù) (Chinese Mandarin), Merkle-puu (Finnish)

Inflected forms

Download JSON data for Merkle tree meaning in English (4.3kB)

{
  "etymology_templates": [
    {
      "args": {
        "1": "computer scientist",
        "2": "",
        "3": "",
        "4": "",
        "5": ""
      },
      "expansion": "computer scientist",
      "name": "named-after/list"
    },
    {
      "args": {},
      "expansion": "|",
      "name": "!"
    },
    {
      "args": {
        "1": "en",
        "2": "Ralph Merkle"
      },
      "expansion": "Ralph Merkle",
      "name": "lang"
    },
    {
      "args": {
        "1": "en",
        "2": "Ralph Merkle",
        "born": "1952",
        "nat": "American",
        "occ": "computer scientist",
        "wplink": "="
      },
      "expansion": "Named after American computer scientist Ralph Merkle (1952–)",
      "name": "named-after"
    }
  ],
  "etymology_text": "Named after American computer scientist Ralph Merkle (1952–), who patented it in 1979.",
  "forms": [
    {
      "form": "Merkle trees",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "Merkle tree (plural Merkle trees)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        {
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Mandarin terms with redundant transliterations",
          "parents": [
            "Terms with redundant transliterations",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Computer science",
          "orig": "en:Computer science",
          "parents": [
            "Computing",
            "Sciences",
            "Technology",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Cryptography",
          "orig": "en:Cryptography",
          "parents": [
            "Computer science",
            "Formal sciences",
            "Mathematics",
            "Computing",
            "Sciences",
            "Technology",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "examples": [
        {
          "text": "2001, Josep Domingo-Ferrer, Mobile Agent Route Protection through Hash-Based Mechanisms, C. Pandu Rangan, Cunsheng Ding (editors), Progress in Cryptology - INDOCRYPT 2001: 2nd International Conference, Proceedings, Volume 2, Springer, LNCS 2247, page 17,\nThe second solution uses Merkle trees and minimizes the cost of route protection by the agent owner, so that a single digital signature suffices to protect the whole route; for hosts along the route, the verification cost is similar to the cost of previous schemes in the literature, namely one digital signature verification per route step."
        },
        {
          "text": "2004, Michael Szydlo, Merkle Tree Traversal in Log Space and Time, Christian Cachin, Jan Camenisch (editors), Advances in Cryptology - EUROCRYPT 2004: International Conference, Proceedings, Springer, LNCS 3027, page 541,\nMerkle trees have found many uses in theoretical cryptographic constructions, having been specifically designed so that a leaf value can be verified with respect to a publicly known root value and the authentication data of the leaf."
        },
        {
          "ref": "2015, Puonam M. Pardeshi, Bharat Tidke, “Improvement of Data Integrity and Data Dynamics for Data Storage Security in Cloud Computing”, in J. K. Mandal, Suresh Chandra Satapathy, Manas Kumar Sanyal, Partha Pratim Sarkar, Anirban Mukhopadhyay, editors, Information Systems Design and Intelligent Applications, Proceedings of 2nd International Conference, Volume 1, Springer, page 279",
          "text": "In order to support dynamic data operations, the Merkle Tree is made dynamic by making use of relative index.",
          "type": "quotation"
        }
      ],
      "glosses": [
        "A binary hash tree."
      ],
      "id": "en-Merkle_tree-en-noun-VWkvCadZ",
      "links": [
        [
          "computer science",
          "computer science"
        ],
        [
          "cryptography",
          "cryptography"
        ],
        [
          "binary",
          "binary tree"
        ],
        [
          "hash tree",
          "hash tree"
        ]
      ],
      "raw_glosses": [
        "(computer science, cryptography) A binary hash tree."
      ],
      "related": [
        {
          "word": "binary tree"
        },
        {
          "word": "tree"
        },
        {
          "word": "trie"
        }
      ],
      "topics": [
        "computer",
        "computing",
        "cryptography",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "science",
        "sciences"
      ],
      "translations": [
        {
          "code": "cmn",
          "lang": "Chinese Mandarin",
          "sense": "binary hash tree",
          "word": "墨克樹"
        },
        {
          "code": "cmn",
          "lang": "Chinese Mandarin",
          "roman": "mòkèshù",
          "sense": "binary hash tree",
          "word": "墨克树"
        },
        {
          "code": "cmn",
          "lang": "Chinese Mandarin",
          "sense": "binary hash tree",
          "word": "默克爾樹"
        },
        {
          "code": "cmn",
          "lang": "Chinese Mandarin",
          "roman": "Mòkè'ěr shù",
          "sense": "binary hash tree",
          "word": "默克尔树"
        },
        {
          "code": "fi",
          "lang": "Finnish",
          "sense": "binary hash tree",
          "word": "Merkle-puu"
        }
      ],
      "wikipedia": [
        "Merkle tree"
      ]
    }
  ],
  "word": "Merkle tree"
}
{
  "etymology_templates": [
    {
      "args": {
        "1": "computer scientist",
        "2": "",
        "3": "",
        "4": "",
        "5": ""
      },
      "expansion": "computer scientist",
      "name": "named-after/list"
    },
    {
      "args": {},
      "expansion": "|",
      "name": "!"
    },
    {
      "args": {
        "1": "en",
        "2": "Ralph Merkle"
      },
      "expansion": "Ralph Merkle",
      "name": "lang"
    },
    {
      "args": {
        "1": "en",
        "2": "Ralph Merkle",
        "born": "1952",
        "nat": "American",
        "occ": "computer scientist",
        "wplink": "="
      },
      "expansion": "Named after American computer scientist Ralph Merkle (1952–)",
      "name": "named-after"
    }
  ],
  "etymology_text": "Named after American computer scientist Ralph Merkle (1952–), who patented it in 1979.",
  "forms": [
    {
      "form": "Merkle trees",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "Merkle tree (plural Merkle trees)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "related": [
    {
      "word": "binary tree"
    },
    {
      "word": "tree"
    },
    {
      "word": "trie"
    }
  ],
  "senses": [
    {
      "categories": [
        "English countable nouns",
        "English entries with incorrect language header",
        "English eponyms",
        "English lemmas",
        "English multiword terms",
        "English nouns",
        "English terms with quotations",
        "Mandarin terms with redundant transliterations",
        "en:Computer science",
        "en:Cryptography"
      ],
      "examples": [
        {
          "text": "2001, Josep Domingo-Ferrer, Mobile Agent Route Protection through Hash-Based Mechanisms, C. Pandu Rangan, Cunsheng Ding (editors), Progress in Cryptology - INDOCRYPT 2001: 2nd International Conference, Proceedings, Volume 2, Springer, LNCS 2247, page 17,\nThe second solution uses Merkle trees and minimizes the cost of route protection by the agent owner, so that a single digital signature suffices to protect the whole route; for hosts along the route, the verification cost is similar to the cost of previous schemes in the literature, namely one digital signature verification per route step."
        },
        {
          "text": "2004, Michael Szydlo, Merkle Tree Traversal in Log Space and Time, Christian Cachin, Jan Camenisch (editors), Advances in Cryptology - EUROCRYPT 2004: International Conference, Proceedings, Springer, LNCS 3027, page 541,\nMerkle trees have found many uses in theoretical cryptographic constructions, having been specifically designed so that a leaf value can be verified with respect to a publicly known root value and the authentication data of the leaf."
        },
        {
          "ref": "2015, Puonam M. Pardeshi, Bharat Tidke, “Improvement of Data Integrity and Data Dynamics for Data Storage Security in Cloud Computing”, in J. K. Mandal, Suresh Chandra Satapathy, Manas Kumar Sanyal, Partha Pratim Sarkar, Anirban Mukhopadhyay, editors, Information Systems Design and Intelligent Applications, Proceedings of 2nd International Conference, Volume 1, Springer, page 279",
          "text": "In order to support dynamic data operations, the Merkle Tree is made dynamic by making use of relative index.",
          "type": "quotation"
        }
      ],
      "glosses": [
        "A binary hash tree."
      ],
      "links": [
        [
          "computer science",
          "computer science"
        ],
        [
          "cryptography",
          "cryptography"
        ],
        [
          "binary",
          "binary tree"
        ],
        [
          "hash tree",
          "hash tree"
        ]
      ],
      "raw_glosses": [
        "(computer science, cryptography) A binary hash tree."
      ],
      "topics": [
        "computer",
        "computing",
        "cryptography",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "science",
        "sciences"
      ],
      "wikipedia": [
        "Merkle tree"
      ]
    }
  ],
  "translations": [
    {
      "code": "cmn",
      "lang": "Chinese Mandarin",
      "sense": "binary hash tree",
      "word": "墨克樹"
    },
    {
      "code": "cmn",
      "lang": "Chinese Mandarin",
      "roman": "mòkèshù",
      "sense": "binary hash tree",
      "word": "墨克树"
    },
    {
      "code": "cmn",
      "lang": "Chinese Mandarin",
      "sense": "binary hash tree",
      "word": "默克爾樹"
    },
    {
      "code": "cmn",
      "lang": "Chinese Mandarin",
      "roman": "Mòkè'ěr shù",
      "sense": "binary hash tree",
      "word": "默克尔树"
    },
    {
      "code": "fi",
      "lang": "Finnish",
      "sense": "binary hash tree",
      "word": "Merkle-puu"
    }
  ],
  "word": "Merkle tree"
}

This page is a part of the kaikki.org machine-readable English dictionary. This dictionary is based on structured data extracted on 2024-05-01 from the enwiktionary dump dated 2024-04-21 using wiktextract (f4fd8c9 and c9440ce). The data shown on this site has been post-processed and various details (e.g., extra categories) removed, some information disambiguated, and additional data merged from other sources. See the raw data download page for the unprocessed wiktextract data.

If you use this data in academic research, please cite Tatu Ylonen: Wiktextract: Wiktionary as Machine-Readable Structured Data, Proceedings of the 13th Conference on Language Resources and Evaluation (LREC), pp. 1317-1325, Marseille, 20-25 June 2022. Linking to the relevant page(s) under https://kaikki.org would also be greatly appreciated.