Show HN: Formally verified polygon intersection – Opus 4.8 oneshots, prev failed

·Hacker News··

To 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, as I describe in the readme. Opus 4.8 is 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 the LLM.Also check out the web demo built around the verified core linked in the readme: https://schildep.github.io/verified-polygon-intersection/. It supports multipolygons including holes, self intersections, and overlapping edges.

Read full article →

Related Articles

Anthropic S-1
SiNTEx · Hacker News · 1d ago
Solar power is becoming bigger than nuclear
geox · Hacker News · 1d ago
Python's experimental JIT to be removed
f311a · Hacker News · 5h ago
The Exponential Time Hypothesis Is False [pdf]
vok · Hacker News · 19h ago
Oldest GUI application that still runs on Windows 11
enlyth · Hacker News · 23h ago