Conversation

Notices

1. Embed this notice
   Filippo Valsorda (filippo@abyssdomain.expert)'s status on Monday, 05-Jan-2026 00:50:10 JST Filippo Valsorda

   Do you have an idle cluster? Can you spare a couple core-years?

   Help me bruteforce some test vectors for RSA key generation edge cases!

   Here are the instructions, it's just a matter of running a single self-contained cross-compilable Go binary that will report the results autonomously.

   https://gist.github.com/FiloSottile/19e7ceb1fdcdaa128f7d3319ad0939fa

   • Soatok Dreamseeker repeated this.
   • Embed this notice
     Filippo Valsorda (filippo@abyssdomain.expert)'s status on Monday, 05-Jan-2026 11:34:26 JST Filippo Valsorda

     in reply to

     Hell yeah, we got the first (of four) hit! So relieved this is working.

     It's the easiest to find case: a double rejection which has probability (2^-16 + 2^-16)² = 2^-30.

     We should see a handful of these before we hit the other two ~2^-31 cases and the (2^-16)² = 2^-32 case.