Re:Solving for faster SHA-1 collision detection
by srijs on Thursday September 24, 2026 @05:36AM
(#49828299)
Hi, author here. FWIW the blog is fully hand-written. I used Claude to help me generate the visuals.
What goes into head vs. tail is actually fully deterministically decided by the solver based on a P(tail) gradient, so expressions that are more effective in filtering out blocks before they can hit the (slower) tail are preferred in the prefix.
What goes into head vs. tail is actually fully deterministically decided by the solver based on a P(tail) gradient, so expressions that are more effective in filtering out blocks before they can hit the (slower) tail are preferred in the prefix.