mirror of
https://github.com/sigmasternchen/libsfuid
synced 2025-03-16 00:19:07 +00:00
Update README.md
This commit is contained in:
parent
2aeff36187
commit
8c9d87fc4e
1 changed files with 1 additions and 1 deletions
|
@ -55,7 +55,7 @@ It's basically a kind of MCG (multiplicative congruential generator) but instead
|
|||
|
||||
So the formular to get a specific ID is:
|
||||
|
||||

|
||||

|
||||
|
||||
The condition for p and m is that their GCD is 1. I chose m to be a power of 2 so it's prime factors are only 2. For p I chose a prime that is about 25 % of m. For that I hardcoded a list of possible primes candidated into the program.
|
||||
|
||||
|
|
Loading…
Reference in a new issue