Show HN: Formally verified polygon intersection, Opus 4.8 one-shot
Hacker News (AI keywords)4 days agoNew ToolThis GitHub project presents a formally verified multipolygon intersection algorithm checked in Lean 4. The author argues trust comes from the Lean checker and a small human-reviewed specification, not from trusting LLM output directly. It also documents how Claude Opus versions improved on Lean proof work, with Opus 4.8 reportedly completing larger proof strategies that earlier attempts could not.
Spherical Voronoi Diagram
Hacker News (AI keywords)5 days agoTutorialJason Davies’ page demonstrates a spherical Voronoi diagram, where seed points divide the surface of a globe into nearest-neighbor regions. It relates the visualization to circumcircles and Delaunay triangulation. The implementation notes say it uses a randomized incremental algorithm to compute the 3D convex hull of spherical points, equivalent to their spherical Delaunay triangulation, and that the project remains a work in progress.