Research any topic before you write.

Find related topics. | Discover entities. | See connections. | Build a topical map.

BLAKE (hash function)

BLAKE is a cryptographic hash function based on Daniel J. Bernstein's ChaCha stream cipher, but a permuted copy of the input block, XORed with round constants, is added before each ChaCha round. Like SHA-2, there are two variants differing in the word size. ChaCha operates on a 4×4 array of words. BLAKE repeatedly combines an 8-word hash value with 16…

History, BLAKE2 & BLAKE3

Use the mouse wheel or two fingers (on touchscreens) to zoom in and out of the map.

Research this topic

Explore the main themes, entities and connections around BLAKE (hash function). Start with the topic map, then use the sections below for research and deeper semantic analysis.

Explore this topic

Start with a few of the strongest sections from the source topic. These are research directions, not a list of keywords you must use.

Key facts & relationships

High-confidence facts extracted from structured source data. Use them as anchors for further research.

Certification
SHA-3 finalist
Derived from
LAKE
Designers
Jean-Philippe Aumasson, Luca Henzen, Willi Meier, Raphael C.-W. Phan
Digest sizes
224, 256, 384 or 512 bits
Rounds
14 or 16
Speed
8.4 cpb on Core 2 for BLAKE-256; 7.8 cpb for BLAKE-512

Topics to explore

Browse the full topic structure. Each item opens a new analysis centered on that subject.

Overview

History

Algorithm

Example digests

BLAKE2

BLAKE3

Advanced semantic analysis

Deeper signals for content research, entity SEO and topical coverage. The plain-language headings explain what each technical view is useful for.

Map overview Semantic statistics

BLAKE (hash function)

Nodes85
Edges84
Triples8
Avg. degree1.98
Density0.023529
Components1

How this topic connects Entity context

See the strongest relationship patterns around the current topic before diving into the raw triples.

BLAKE (hash function)

Top relations

Certification · 1
BLAKE (hash function) → SHA-3 finalist
Derived from · 1
BLAKE (hash function) → LAKE
Designers · 1
BLAKE (hash function) → Jean-Philippe Aumasson, Luca Henzen, Willi Meier, Raphael C.-W. Phan
Digest sizes · 1
BLAKE (hash function) → 224, 256, 384 or 512 bits
Rounds · 1
BLAKE (hash function) → 14 or 16
Speed · 1
BLAKE (hash function) → 8.4 cpb on Core 2 for BLAKE-256; 7.8 cpb for BLAKE-512
Structure · 1
BLAKE (hash function) → HAIFA construction
Successors · 1
BLAKE (hash function) → BLAKE2

Important terminology Word statistics

Use these terms to understand the vocabulary surrounding the topic, not as a checklist for keyword stuffing.

Important terminology

function blake2 hash blake3 blake words uses blake2b based chacha 16 bits 512 sha-2 blake2s supports algorithm 256 number version

Entity relationships Subject–Predicate–Object triples

SubjectPredicateObjectConfidenceSrc
BLAKE (hash function)CertificationSHA-3 finalist1.00infobox
BLAKE (hash function)Derived fromLAKE1.00infobox
BLAKE (hash function)DesignersJean-Philippe Aumasson, Luca Henzen, Willi Meier, Raphael C.-W. Phan1.00infobox
BLAKE (hash function)Digest sizes224, 256, 384 or 512 bits1.00infobox
BLAKE (hash function)Rounds14 or 161.00infobox
BLAKE (hash function)Speed8.4 cpb on Core 2 for BLAKE-256; 7.8 cpb for BLAKE-5121.00infobox
BLAKE (hash function)StructureHAIFA construction1.00infobox
BLAKE (hash function)SuccessorsBLAKE21.00infobox

Related concept clusters Concept neighborhoods

These clusters group vocabulary that occurs around closely connected concepts in the source material.

    Connections between topic areas Semantic bridges

    Bridges can reveal useful research angles that are easy to miss in a flat list of related terms.

    Min side: 3
    For writers, content strategists, SEOs, marketers and creators — from quick topic research to advanced semantic analysis.