Soft math

Soft Math

Soft math is characterized by the use of mathematics-oriented computer software, and has been used to collect heuristic or statistical evidence for may conjectures such as the Riemann hypothesis and the Birch and Swinnerton-Dyer conjecture.

In some ways it may be seen as “applied” rather than pure mathematics which would be based on formal definitions and proofs for all key terms and theorems based on them, even if it isn’t “applied” as such to practical use “out on the farm” as it were.

Much of the “soft math“ we are presented with in abstract algebra or group theory journal articles and so forth has become too abstract, advanced and theoretical with vague definitions leaving behind the formal proofs for the initial simplest concrete results upon which it is based. This is what happened at the monstrous moonshine camp.

General recommendations to mitigate

Cryptography is a martial art which cannot be practiced properly without the discipline of simple rigorous definitions and hard, step-by-step proofs, and accordingly all mathematical concepts which are employed in the service of strong cryptography must be brought into the jurisdiction of the martial arts as such.

Our goals and objectives here are to overcome heavy resistance, espionage and well-armed campaigns of disinformation from entrenched insiders of the “soft math” camps in order to simplify and strengthen the definitions and make the theorems more rigorous and provable for engineering applications outside a peculiar academic sub-discipline of advanced algebraic group theory which has “gone soft,” so that we can better understand from an outsider perspective the group structure of elliptic curves over finite fields with a point of view of establishing and maintaining provable security properties for cryptographic applications.