Encryption algorithm based on system of linear diophantine equations resistant to quantum algorithms

via Collapse Theory and AK High-Dimensional Projection This repository contains Version 2.0 of a formally verifiable, obstruction-theoretic proof of the ABC Conjecture, based on:

Computational laboratory for the Erdős–Straus conjecture studying residue-class identities, structural coverage, and empirical hardness of representations 4 / 𝑛 = 1 / 𝑥 + 1 / 𝑦 + 1 / 𝑧 4/n=1/x+1/y+1/z.

Formal Proof of the Non-Existence of Perfect Cuboids via Mordell-Weil Rank Exhaustion and Minimal Polynomial Irreducibility of the Perfect Cuboid Surface.

Program finds a general formula, which gives all integer solutions to a two variable diophantine linear equation

The Beal Symmetry Collision: A Machine-Certified Solution via p-adic Valuations

🧮 Solve linear Diophantine equations of the form ax + by = c

Algorithms relating to Diophantine equations

onstructive proof of the Catalan Conjecture (Mihăilescu's Theorem)

🔢 High-performance Rust library for solving Pell equations (x² - D·y² = 1). Features streaming API, performance boosted, arbitrary precision arithmetic, and comprehensive mathematical analysis tools. Perfect for cryptography, number theory research, and educational applications. 58 tests, zero warnings, production-ready.

Interactive solver for linear Diophantine equations using React + TypeScript

Prove the non-existence of perfect cuboids using formal methods and algebraic structures verified in Lean 4 with detailed mathematical analysis.