this is not very optimized at all. This is slightly more complex than collatz. After some optimizing the algorithm now begins to slow down once the confirmeds list reached the middle 1200s. Before, it dramatically slowed down when confirmeds list gets over 30 elements.
any even number bigger than 2 is can be expressed as a sum of two primes. It will stop once it catches something that breaks the conjecture. Tell me if you find any bug. Turbo mode does not make it faster btw
