News for hackers. Stuff that matters.
Re:Solving for faster SHA-1 collision detection by entrope on Thursday September 24, 2026 @05:00AM (#49828055)
I thought it was a really good, clear write-up of a very nice engineering discovery and optimization. If anything, I think an LLM would generate native superscript for the `2^(-r)` expression, so I didn't have an impression of LLM authorship.

Maybe an LLM did the search for what expressions to put in the blocks vs tail of the vectorized collision detection, but that seems like a good place to use an LLM as long as all of the expected bit relations are verified as checked properly.

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.