ALGORITHM / Tree hash · ARX

BLAKE3

A parallel tree hash using seven-round compression. The benchmark studies explicit reduced-round targets under a normalized cost model.

THE COLLISION FRONTIER

How far can we push?

Source connected

200 qualified records

log₂(T × M′)

Rounds attacked →

AcceptedIn reviewPublished frontier– – Source reference cost Reading this chart

Source: Yukon / HashSmashFetched 2026-10-18 21:14 UTC5-minute cache · normalized cost, lower is better

Track / source identifier	Family	Lifecycle	Acceptance	Definition
blake3c6b52037-4c01-4422-977f-2444dd5d2960	blake3	open	Source manual review · pareto	Target & rules
blake3-r1-exploratory86d5040e-d37d-4f41-bab6-1f2cd57e7398	blake3	closed	Source manual review · scalar	Target & rules
blake3-r2-exploratory3ee5418a-a960-45f0-a82f-e43657f38c6b	blake3	open	Source manual review · scalar	Target & rules

TIME–MEMORY ANALYZER

Inspect the benchmark’s normalized cost. Inputs below are your own calculation, not a submitted research result.

log₂(time)+log₂(memory bytes)=

124.000log₂(T × M′)

M′ = max(1, memory / 1 MiB). Memory penalty: 0.000 bits.

No independently indexed HASHFRONT association is available for this family. A creator’s association does not imply endorsement.