Lean 4 Proof Engineer - Mathematical Formalization

Lean 4 Proof Engineer — Mathematical FormalizationAbout The RoleWhat if your mathematical expertise could directly shape how AI reasons, proves, and understands the deepest structures of formal logic? We're looking for Lean 4 Proof Engineers to translate advanced mathematical arguments into precise, machine-verifiable formalizations — working at the absolute frontier of what modern proof assistants can do.This is a fully remote, flexible contract role built for mathematicians who love rigor, structure, and the challenge of making a machine understand what a human mind intuits.Organization: AlignerrType: Hourly ContractLocation: RemoteCommitment: 10–40 hours/weekWhat You'll DoTranslate informal mathematical proofs into clean, structured Lean 4 formalizations with an emphasis on correctness and clarityAnalyze proofs across domains — algebra, analysis, topology, logic, discrete math — and identify hidden assumptions, gaps, and formalizable sub-structuresConstruct formalizations that test and expose the limits of existing proof assistants, especially where automation breaks downInvestigate why automated provers fail on specific problems — complexity, missing lemmas, insufficient libraries — and document your findingsCollaborate with AI researchers to design, refine, and evaluate strategies for improving formal verification pipelinesDevelop readable, reproducible proof scripts aligned with mathematical best practices and Lean idiomsCreate Lean proofs that surface deeper patterns or generalizations implicit in the original mathematicsProvide expert guidance on proof decomposition, lemma selection, and structuring techniques for formal modelsWho You AreHold a Master's degree or higher in Mathematics, Logic, Theoretical Computer Science, or a closely related fieldPossess a strong foundation in rigorous proof writing and mathematical reasoning across core areasHave hands-on experience with Lean (Lean 3 or Lean 4), Coq, Isabelle/HOL, Agda, or comparable systems — Lean 4 strongly preferredDeeply enthusiastic about formal verification, proof assistants, and the future of mechanized mathematicsAble to bridge the gap between informal human arguments and precise machine-verifiable structureThrive working independently on technically demanding problems with real research impactNice to HaveFamiliarity with type theory, the Curry-Howard correspondence, and proof automation toolingExperience contributing to large-scale formalization projects such as MathlibExposure to theorem provers where automated reasoning frequently fails or requires manual scaffoldingPrior experience with data annotation, data quality, or AI evaluation systemsStrong written communication skills for explaining formalization decisions and reasoning strategiesThe Ideal CandidateYou're a mathematically mature problem-solver who finds deep satisfaction in taking a dense, 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. You're energized by working at the edge of what formal verification can express — and you want that work to matter for the future of AI.Why Join UsWork on cutting-edge AI projects alongside world-leading research labsFully remote and flexible — work when and where it suits youFreelance autonomy with the structure of meaningful, high-impact technical workGain direct exposure to how advanced AI models are trained and evaluatedPotential for ongoing work and contract extension as new projects launch