Solving for faster SHA-1 collision detection

(sam.dev)

22 points | by srijs 2 days ago

4 comments

  • gleenn 3 hours ago
    This seems extremely cool, but man does it also sound complicated. The write up was thorough but the algorithm seems so complicated that the author can't even write good tests for it is concerning. I would be very concerned their algorithm might accidentally skip something important accidentally given they are dealing with dynamically combining large binary expressions. You can make it fast, but if you can't prove it and it's security related that probably needs to be proved out more, even if SHA1 is already compromised.
    • bawolff 58 minutes ago
      Why do you conclude the author cannot write good tests for it?
  • rurban 1 hour ago
    Does git proper already accepts rust? 2x faster pack checks would be worthwhile, as it affects everybody. I heard since 2.55 they already do
    • masklinn 38 minutes ago
      Git proper has had rust code in it since 2.52, as an opt-in optional. 2.55 makes it opt out. 3.0 might make it required.
  • someonebaggy 1 hour ago
    This writing almost feels AI, but it's not AI. Why is that?
    • bawolff 1 hour ago
      This reads like a totally normal article to me. At some point these AI accusations feel like a witch hunt.
  • DreamOfXM 3 hours ago
    [flagged]