From: porkchop@invalid.foo   
      
   On Wed, 24 Dec 2025 23:35:55 -0600, BGB wrote:   
      
   > While arguably a typical C library "rand()" isn't that strong, if one   
   > has a number sequence of output random digits, it might still take an   
   > impractical amount of time to brute-force search the entire seed space   
   > for a 64-bit seed.   
      
   That is a great point IMO. After reading this I used Gemini to get a guess   
   on the number of permutations for A-Z, its reply was:   
      
   'over 403 quintillion millions' of permatations for A-Z...   
      
   Now if we split that list (assuming each line was randomized 26 characters   
   A-Z) & used each line exactly *once*, then destroyed it, we might maintain   
   some privacy. At least till quantum stuff is in every day use...   
      
   --   
   :wq   
   Mike Sanders   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)