argosofithica / xorshift-brute-force Goto Github PK

Nice program, I can really use it as Iwant an XORSHIFT algorithm for any n, not just 8 or 16.

Just a small suggestion:

You could optimize it by simply stopping the loop in xor_shift_period as soon as a value is seen twice (testing for result[x] = 1), speeding up the program by at least a factor of 2 (or more? Haven't really done the math).

Oh, and you are testing 0 values for a, b and c which are not a possible result.

BTW here is my Java version and a table of working triplets up to word size 31. BTW I am allowing 0 in a triplet to indicate skipping one of the right xorshifts. This way we get faster RNGs, and we can include 1 and 2 bits.