Rigorous Proofs for Open Problems Riemann Hypothesis, Polignac's and Twin Prime Conjectures

Mathematics for Incompletely Predictable Problems is associated with Incompletely Predictable problems containing Incompletely Predictable entities. Nontrivial zeros and two types of Gram points in Riemann zeta function (or its proxy Dirichlet eta function) together with prime and composite numbers from Sieve of Eratosthenes are Incompletely Predictable entities. Correct and complete mathematical arguments for first key step of converting this function into its continuous format version, and second key step of applying Information-Complexity conservation to this Sieve result in direct spin-offs from first step consisting of proving Riemann hypothesis (and explaining two types of Gram points), and second step consisting of proving Polignac's and Twin prime conjectures.