About the Role:
We are building the Autonomous Security Architect (ASA)—a deep-tech, closed-loop machine designed to automatically intercept, remediate, and mathematically prove the structural integrity of broken open-source dependencies within high-throughput production runtimes. We are not building another corporate compliance dashboard. We are building an automated verification engine. As our Lead Formal Methods Engineer, you will own the platform's "unassailable validator." You will be responsible for ensuring that every single automated software patch generated by our AI engine is mathematically proven to be free of buffer overflows, race conditions, or memory leaks before code is pushed to production.
Key Responsibilities:
- Develop and maintain automated symbolic execution pipelines to exhaustively analyze execution bounds across open-source libraries.
- Write programmatic logical constraints using SMT Solvers to mathematically disprove vulnerability vectors.
- Implement custom code-traversal hooks to strip namespaces and map incoming data primitives to strict safety invariants.
- Bridge abstract mathematical theorem proving directly into fast-executing production system code.
Technical Requirements & Qualifications:
- Master's or Ph.D. in Applied Mathematics, Formal Methods, Computer Engineering, or a highly related quantitative field.
- Verifiable expert-level history working natively with the Z3 Theorem Prover API, CVC5, or KLEE Symbolic Execution Engines.
- Strong familiarity with static analysis frameworks, compiler architectures (LLVM, rustc structures), or interactive theorem provers (Coq, Lean).
- Advanced proficiency in Python or Rust backend systems programming.
THE MANDATORY 48-HOUR TECHNICAL TAKE-HOME CHALLENGE:
We bypass generic behavioral screening loops in favor of raw technical execution. To fast-track your profile to a live technical sync with our leadership, you must reply to this posting with a functional Python code snippet (or descriptive pseudocode) utilizing the z3-solver library that:
- Accepts a target integer variable parameter.
- Sets an explicit safety bounds constraint constraint (e.g., x > 0 and x < 100).
- Executes an automated check to verify and output whether a theoretical counter-example value can successfully bypass the guardrails.
- Incorporates robust try/except defensive exception blocks to catch malformed data without crashing the execution worker queues.
Submissions that rely on third-party LLM wrappers, generic regex filters, or basic string matching will be immediately discarded. Show us your mathematical logic.
Pay: $85.00 - $95.00 per hour
Application Question(s):
- Question 1 (Yes/No): Do you have verifiable, hands-on experience utilizing the Z3 Theorem Prover API, CVC5, or KLEE Symbolic Execution Engine to programmatically verify code logic bounds or discover memory vulnerabilities?Question 2 (Yes/No): Are you comfortable with a flexible, remote, part-time R&D contract of 10–15 hours per week at an advisory rate of $85–$95/hr prior to transitioning to full-time W-2 employment post-funding?Question 3 (Free Text - Limit 250 characters): Briefly state which static analysis or formal verification framework (e.g., KLEE, LLVM, Coq, Lean) you have deep production or research experience with, and your primary programming language for implementing it.Question 4 (Yes/No): Have you reviewed and included your solution to the mandatory 48-Hour Technical Take-Home Challenge (Z3 Bounds Leak Verification) inside your application text/cover letter?
Education:
Work Location: Remote
