You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Formal verification, AI research, and a healthy allergy to overclaiming.
Senior Software Architect (ESG data platforms, API architecture) working at the
seam of formal verification and AI research. I build verified tools for
AI agents and a machine-checked Lean 4 proof corpus. If it is claimed here, it is
proved, tested, or it says plainly what is trusted.
A local MCP approval gate for Claude Code: exact-call prompts, at-most-once approval, drift refusal, and signed decision receipts. Seal is a gate, not a sandbox.
Lean 4 proofs behind five CRDTs (G-Set, G-Counter, PN-Counter, OR-Set, RGA/Text) in no_std Rust, with C ABI, WASM/TypeScript and Python surfaces. You bring the transport.
A cited, importable library of machine-checked mathematics spanning the spine of
modern AI: optimisation, dynamical systems, learning theory. Most repos are
zero-sorry; each states its axioms and any documented gaps.
A local MCP approval gate for Claude Code: exact-call prompts, at-most-once approval, drift refusal, and signed decision receipts. Seal is a gate, not a sandbox.
Lean 4 proofs behind five CRDTs (G-Set, G-Counter, PN-Counter, OR-Set, RGA/Text) in no_std Rust, with C ABI, WASM/TypeScript and Python surfaces. You bring the transport. Open source under Apache-2.0.
Lean 4 / Mathlib formalisation of hard and soft attention expressivity over finite Boolean cubes: exact head-count bounds proved to the kernel, carried from argmax to softmax at the Boolean-output ...
Lean
Something went wrong, please refresh the page to try again.
If the problem persists, check the GitHub status page
or contact support.