The 396/237-Matrix Algorithms
Our entire world/universe/simulation substrate runs on a Prouhet–Thue–Morse sequence. This is the binary sequence (an infinite sequence of 0s and 1s) that can be obtained by starting with 0 and successively appending the Boolean complement / logical opposite of the sequence obtained thus far.
This generates an exceptional infinite binary number string / sieve which is always in a perfect balance. This is not new knowledge, since several people have discovered and investigated this fair share sequence.
What nobody realized until now, is that this binary sequence generates an automated morality time-based matrix algorithm in the upper bases, like the decimal and hexadecimal bases.
In the decimal base10, the first four bits of the string embed the famous 369 Nikola Tesla 369-patterns, the first byte reveals the 1467 vs 2358 moral polarity; the first 16 bits emerge the 237-Lucky Number sieve, the first 32 bits reveal the Master Trio 147-258-369 vocabulary, and 64 bits act as a recursive closure of the lower/shorter bit-levels. In hexadecimal, the patterns concentrate on the ying/yang numbers 6 and 9, with a flipping mechanism in-between.
Free downloads here
Free downloads here
Free downloads here
Free downloads here
