Formally verified polygon intersection
Opus 4.8 oneshots, prev failed
Get picks like this daily. Today's launch numbers, the top launches, AI and tech news, and a daily opportunity pick, straight to your inbox.
Want to reach these readers? Sponsor an issue.
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.
HN · launched Jun 4, 2026 · 93 upvotes (top 9%) · 0 views
Niche: specialized algorithms and computing libraries · 230 launches, 3 in the last 7 days ▼ -80% · Explore this niche →
Category and tags
- Horizontal
- Dev tools
- Developer
- AI feature
- Hobby / open-source project
Visit website ↗ Source listing ↗
More like this: all 230 launches in specialized algorithms and computing libraries →
Could you build this?
No Formal software verification involves interactive theorem provers (like Coq, Lean, or Isabelle) and rigorous mathematical proofs of computational geometry edge cases.
What it would actually take: Requires formal specification in Lean 4 or Coq, encoding geometric topology, floating-point or arbitrary-precision arithmetic proofs, and proving correctness invariants across all degenerate intersection cases. This demands deep expertise in formal methods, computational geometry, and interactive theorem proving.
Discussion
20 comments analyzed.
Competitors mentioned: Video games and GIS systems (existing polygon intersection implementations), Delaunay triangulation libraries, Shewchuk robust predicates
Concerns raised: Real number representation limitations in computer implementation, Floating-point precision issues for computational geometry, Polygon intersection is well-known; unclear what makes this novel, Lack of formal verification library for IEEE floats in Lean (Flocq equivalent)
Feature requests: Extend proof to real coordinates (algebraic numbers like sqrt(2)), Support spline segments instead of just line segments, Formal verification library for floating-point numbers (Flocq-level quality), Extend to 3D polyhedrons with formal verification, Shewchuk robust predicates formally verified library
Competitors
Other products that read as similar to this one : 67 launches clear the similarity bar, closest 8 shown.
Attention rank: #7 of 68 (itself plus its competitors, highest first, normalized so YC and Product Hunt are compared fairly).
Launched 157 days after the earliest competitor.
- Formally verified 3D CSG: Trust 93 lines spec, not 1000 lines AI code · hn · 2026-07-28 · 115 upvotes · similarity 0.63
- TheoremSmith: Mass-Producing Hard Proof Problems to Train LLMs · hn · 2026-11-10 · 10 upvotes · similarity 0.44
- genpark-moller-trumbore-3d-ray-triangle-intersection-skill · github · 2026-09-09 · 8 upvotes · similarity 0.41
- c-hd-proof · github · 2026-09-21 · 44 upvotes · similarity 0.41
- Talos · hn · 2026-06-18 · 106 upvotes · similarity 0.39
- polystrata · github · 2026-10-21 · 11 upvotes · similarity 0.37
- zkGolf · hn · 2026-07-02 · 69 upvotes · similarity 0.37
- Sostactic · hn · 2026-04-18 · 14 upvotes · similarity 0.36
The niche, labels, vibe code rating and competitor comparison on this page are analysis by Nicheloom. If you use them, please credit nicheloom.com. How you may use our data.