ALGORITHM / Merkle–Damgård

SHA-256

A 256-bit hash built from 64 compression rounds. Reduced-round collision research does not establish a break of the full standard.

THE COLLISION FRONTIER

How far can we push?

Source connected

320 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
sha25629c9499d-9f4d-47e6-b99f-c8424cc534a5	sha256	open	Source manual review · pareto	Target & rules
sha256-r37-exploratory4f9e5d52-55ee-49b9-9e5f-6aa1996305c2	sha256	open	Source manual review · scalar	Target & rules
sha256-r38-exploratory71414160-42e9-4f5c-be0f-76c46d0572e2	sha256	open	Source manual review · scalar	Target & rules
sha256-r31-exploratoryf10ad4ca-737d-40d1-aa10-e1655e27940b	sha256	closed	Source manual review · scalar	Target & rules
sha256-r32-exploratory472669a3-e4a4-4961-a7ad-7d4cf75ad940	sha256	closed	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.