Applied Formal Methods Researcher (Lean 4)
Offre en anglaisExpiréTranslate informal mathematical proofs into machine-verifiable Lean 4 formalizations while analyzing proofs for logical gaps and hidden assumptions. Collaborate with researchers to design verification strategies and document findings on why automated provers struggle with specific mathematical structures.
- Télétravail
- Montreal, Quebec, Canada
- Publié 6 août 2026
- Postuler avant le 5 sept. 2026
- 1 poste
Ce poste est expiré
Ce poste chez Alignerr n’accepte plus de candidatures. L’offre originale reste disponible ci-dessous à titre de référence.
Expiré le 14 août 2026
Postes actuels chez Alignerr
Ces possibilités vérifiées acceptent toujours des candidatures.
Offre d’emploi originale
About The Role What if your deep mathematical training could directly shape how AI understands and reasons about formal proof? We're looking for mathematicians and formal verification specialists to translate rigorous human arguments into machine-verifiable Lean 4 proofs — working at the very edge of what automated reasoning can do today. This is a fully remote, flexible contract role designed for people who find genuine satisfaction in the precision and structural elegance of formal mathematics. No AI background required — just deep mathematical maturity and hands-on experience with proof assistants. Organization: Alignerr Type: Hourly Contract Location: Remote Commitment: 10–40 hours/week What You'll Do Translate informal mathematical proofs into clean, structured, machine-verifiable Lean 4 formalizations Analyze proofs across domains — identifying hidden assumptions, logical gaps, and formalizable sub-structures Construct formalizations that probe the limits of existing proof assistants, especially where automation breaks down Investigate why automated provers struggle — complexity, missing lemmas, insufficient libraries — and document your findings clearly Collaborate with researchers to design, refine, and evaluate formal verification strategies and pipelines Develop highly readable, reproducible proof scripts aligned with mathematical best practices and Lean idioms Guide proof decomposition, lemma selection, and structuring decisions for complex formal models Formalize classical proofs and compare machine-verifiable structures against textbook arguments Surface deeper patterns or generalizations implicit in the original mathematics Who You Are Holds a Master's degree or higher in Mathematics, Logic, Theoretical Computer Science, or a closely related field Strong foundation in rigorous proof writing across algebra, analysis, topology, logic, or discrete mathematics Hands-on experience with Lean (Lean 3 or Lean 4), Coq, Isabelle/HOL, Agda, or comparable systems — Lean strongly preferred Genuinely enthusiastic about formal verification, proof assistants, and mechanized mathematics Able to translate dense informal arguments into clean, precise formal proofs Comfortable working independently in an asynchronous, remote environment Nice to Have Familiarity with type theory, the Curry-Howard correspondence, and proof automation tools Experience contributing to large-scale formalization projects such as Mathlib Exposure to theorem provers where automated reasoning frequently fails or requires manual scaffolding Prior experience with data annotation, data quality, or evaluation workflows Strong communication skills for articulating formalization decisions, edge cases, and reasoning strategies The Ideal Candidate You're a mathematically mature problem-solver who thrives at the frontier of formal verification. You find deep satisfaction in taking an elegant human argument and expressing it in a form a machine can verify. You appreciate precision, structural beauty, and the intellectual challenge of resolving gaps that automated tools cannot yet bridge. Why Join Us Work on cutting-edge AI projects alongside leading research labs Fully remote and flexible — work when and where it suits you Freelance autonomy with the structure of meaningful, intellectually stimulating work Gain direct exposure to how advanced AI models are trained on formal mathematical reasoning Contribute to work that is genuinely pushing the boundaries of mechanized mathematics Potential for ongoing work and contract extension as new projects launch
Ce que vous ferez
Translate informal mathematical proofs into machine-verifiable Lean 4 formalizations while analyzing proofs for logical gaps and hidden assumptions. Collaborate with researchers to design verification strategies and document findings on why automated provers struggle with specific mathematical structures.
Exigences
Requires a Master's degree or higher in Mathematics, Logic, or Theoretical Computer Science with a strong foundation in rigorous proof writing. Candidates must have hands-on experience with proof assistants like Lean, Coq, or Isabelle/HOL.
Autres compétences pertinentes
Relevées dans la description du poste. Confirmez les exigences importantes ci-dessus.
- Lean 4
- Formal verification
- Mathematics
- Proof assistants
- Automated reasoning
- Logic
- Theoretical computer science
- Coq
- Isabelle/HOL
- Agda
- Type theory
- Curry-Howard correspondence
- Mathlib
- Data annotation
- Proof decomposition
Domaines d’emploi
- Science & Research
- Technology
- Software
- Data & Analytics
Renseignements supplémentaires
- Formation minimale
- Maîtrise
- Expérience minimale
- 2+ ans
- Postuler avant le
- 5 sept. 2026
- Langue de l’offre
- anglais
- Heures de travail
- 40 heures par semaine
- Exigences de lieu
- Country, Montreal, Quebec, Canada
- Niveau d’expérience
- Entry level