Sign inSign in
ConceptSystems & CS

Merkle tree

A tree structure of cryptographic hashes used to create an unambiguous summary of a log's contents.
as Robert Morris defines itMITThe wording closest to all 4 definitions
Watch it explained

Know first

Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.

Opens up

Concepts that name this one as a prerequisite.

Lecturers

4

Each in their own terms, from the easiest level.

  • Nicholas Weaver

    Ruhr University Bochum · Undergraduate

    A binary tree of hashes where data elements are at the leaves and parent nodes are hashes of their children.
    • 8:34Cryptocurrency: An Overview and Critique
  • Christof Paar

    Ruhr University Bochum · Undergraduate

    A tree structure where every leaf node is labeled with the cryptographic hash of a data block, used to securely summarize large sets of data.
    • 3:08Post-Quantum Cryptography: Merkle Signature Schemes
  • Michael Sperber

    Active Group, Germany · Graduate

    A tree of hashes where each internal node is a hash of its children, allowing efficient synchronization between distributed systems by exchanging top hashes.
    • 11:08Local-First Distributed Configuration (Experience Report)

Lectures that assume it

1

Connections

12

The lectures that define it or assume it, and the concepts next to it.

4 lecturers. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.