Researcher - Lean 4 & Formal Proof Systems

Researcher - Lean 4 & Formal Proof Systems

Base pay range: $70.00/hr - $150.00/hr (Hourly Contract, Remote, 10–40 hours/week)

We are seeking mathematicians with deep training in rigorous proof construction and hands‑on experience with formal proof languages, especially Lean. This role sits at the intersection of mathematics and computer science, focusing on translating human‑written mathematical arguments into precise, machine‑verifiable formalizations.

• Translate informal mathematical proofs into Lean (and related proof systems) with an emphasis on clarity, structure, and correctness.
• Analyze generic and domain‑specific proofs, identifying gaps, hidden assumptions, and formalizable sub‑structures.
• Construct formalizations that test the limits of existing proof assistants, especially where tools struggle or fail.
• Collaborate with researchers to design, refine, and evaluate strategies for improving formal verification pipelines.
• Develop highly readable, reproducible proof scripts aligned with mathematical best practices and proof assistant idioms.
• Provide guidance on proof decomposition, lemma selection, and structuring techniques for formal models.
• Sample work: formalize classical proofs, investigate where automated provers break down, and create Lean proofs that reveal deeper patterns or generalizations implicit in the original mathematics.

• Master’s degree (or higher) in Mathematics, Logic, Theoretical Computer Science, or a closely related field.
• Strong foundation in rigorous proof writing and mathematical reasoning across areas such as algebra, analysis, topology, logic, or discrete math.
• Hands‑on experience with Lean (Lean 3 or Lean
  4), Coq, Isabelle/HOL, Agda, or comparable systems (Lean strongly preferred).
• Deep enthusiasm for formal verification, proof assistants, and the future of mechanized mathematics.
• Ability to translate informal arguments into clean, structured formal proofs.

• Prior experience with data annotation, data quality, or evaluation systems.
• Familiarity with type theory, Curry‑Howard correspondence, and proof automation tools.
• Experience with large‑scale formalization projects (e.g., mathlib).
• Exposure to theorem provers where automated reasoning frequently fails or requires manual scaffolding.
• Strong communication skills for explaining formalization decisions, edge cases, and reasoning strategies.

• Competitive pay and flexible remote work.
• Collaborate with a team on cutting‑edge AI projects.
• Exposure to advanced LLMs and how they’re trained.
• Freelance perks: autonomy, flexibility, global collaboration.
• Potential for contract extension.

Submit your resume → Complete a short screening → Project matching and onboarding (takes approximately 15‑20 minutes).

PS:
Our team reviews applications daily. Please complete your AI interview and application steps to be considered for this opportunity.