First formally verified polygon intersection algorithm developed using AI-assisted formal verification
By
permute
Fresh out the oven, still warm. Top of the tray.
Summary
This article presents a formally verified implementation of a polygon intersection algorithm, claimed to be the first of its kind. It discusses how the project was developed using AI agents (Lean theorem prover) and how recent AI model releases have dramatically improved the ability to generate algorithm implementations with formal proofs in a single step. The correctness relies on the Lean proof checker and human review of a small specification, rather than extensive testing.
Key quotes
· 4 pulledTo my knowledge, this is the first formally verified implementation of an intersection algorithm for polygons.
The experience of working with AI agents on this project changed a lot with recent model releases.
Latest models are able to provide algorithm implementation with formal proof in one shot, whereas previous models required me to provide proof strategies in multiple steps.
Trust in the correctness comes entirely from the Lean checker and human review of a small specification, not from...
You might also wanna read
MerLean-Prover: A Recursive Agent Harness for Lean 4 Theorem Proving Outperforms Baselines
MerLean-Prover is an end-to-end Lean4 theorem prover that replaces 'sorry' declarations with kernel-checkable proofs using three agent types

Designing Transparency for Agentic AI Systems: Finding the Right Moments for Clarity
This article explores the design challenges of agentic AI systems, focusing on how to provide appropriate transparency without overwhelming
