Godelian Encryption and Goldbach’s Conjecture

This paper outlines an idea for an unbreakable encryption-decryption technology within it’s entitled difference of quotient of (a) methodology suited to and situated on modular relationships. Based on a Godelian concept of emptiness, the dependency on the Goldbach Conjecture is a stated to which a proof is preliminarily afforded or dis-afforded within the mathematical structure of emptiness of retractile or reductive proof’s; to the advantage of the pre-text of leverage of the stochasticity of a variety of homological err and congruence. The co-terminal relation of two modular relations for in that of power to exponentially founded Fundamental Theorem of Algebraic Exponent’s advantages the shrinking of an informational capacity requirement to the leverage of the pre-text of diminishment of algebraic and geometric (ray) computational exponents (of-a-certain) logarithmic compressibility on a conventional binary machine. What seems to be ’stripped’ or forgotten is the combinatorial re-assortment of a ’dictionary’ on that of the prime-modulo enumeration in Godelian pre-scriptive prowess. What is not lost or ’spent’ is the afforded gesture that a ’hidden’ and ’uncontainable’ lamentation at number-series-reductive lemma structure cannot-be-taught; but, must be-learned. The essential idea conjectured at is that if there does not exist a general solution to Goldbach’s Conjecture there would exist a solution to Fermat’s Last Theorem, and by a-contractual contradiction since it is known that Fermat’s Last Theorem has no solution via preliminary works of other’s [Et. Al.], Goldbach’s Conjecture must be certain in it’s derviational certainty & true (within a certain understated context) herein to an existence proof via Godelian emptiness. The demonstrative ideal is to that of the geometric quotient that of a radical free nomenative declaration; that -statedly-that of one ray by contractual reduction is reducible from a two (2) dimensional enfolding to a radical free (1) and (0) dimensional ever diminishing exponent by any third (3) bi-inclinic ray. From here, an algorithm is deduced that is generative of an unbreakable encryption methodology (todo’s); providing the root clause of data supremacy and data encryption; standardization of compactual relations of an-infinitive nature and of it’s understated recombinatorial addressibility & assembly. Compactual binary space partition(s) are therefore reducible to at most (5) elements; (to be depicted as earth, air, fire, water, and wood) to which is the free data right of a simplicially connected/disconnected and (re)-establish(-able)ed flow of/and regularization concept layer analogous to free radical prime bases of geometrically induced quasilinear relations of 5 th order.