Inverse Galois Problem (IGP24). Degree 24 polynomial construction, Frobenius fingerprinting and LMFDB baseline analysis for the SAIR Foundation competition.
-
Updated
Sep 19, 2026 - Python
Inverse Galois Problem (IGP24). Degree 24 polynomial construction, Frobenius fingerprinting and LMFDB baseline analysis for the SAIR Foundation competition.
Lean Kernel Challenge. Independent Lean 4 proof checker: NDJSON export reader, type checker and arena harness for the SAIR Foundation competition.
Modular Arithmetic Challenge. Neural induction of exact (a x b) mod p through abacus embeddings, algorithmic scratchpads and grokking, for the SAIR Foundation competition.
Mathematics Distillation Challenge, Equational Theories. Stage 1 cheatsheet and Stage 2 Lean 4 certificate solver for the SAIR Foundation competition.
A single index to every SAIR Foundation challenge entered: the open problem each one states, the repository holding the method and the code, and what that method actually reached. Open science competitions in mathematics and computation, run by the Foundation for Science and AI Research.
Andrews-Curtis Conjecture (ACC) Challenge. Short trivialisations of balanced presentations of the trivial group: the AC moves, a replay verifier and a measured baseline search, for the SAIR Foundation competition.
To associate your repository with the sair-foundation topic, visit your repo's landing page and select "manage topics."