I started a new program to search for LFSR Polynomials which is quicker than bruteforcing assembler
The taps are randomly chosen so some runs will produce better results (less taps), it seems to be doing something useful
Next I need to add logic to convert taps into assembler and see what it spits out (if that is at all possible ?)
https://zoltar.eu.org/wip/prng-generator/poly-007.html (no optimization, extreme periods may freeze the browser)
The taps are randomly chosen so some runs will produce better results (less taps), it seems to be doing something useful
Next I need to add logic to convert taps into assembler and see what it spits out (if that is at all possible ?)
https://zoltar.eu.org/wip/prng-generator/poly-007.html (no optimization, extreme periods may freeze the browser)
Statistics: Posted by lovebug — Wed Jan 28, 2026 3:53 am