Alternatives
Products that do what Formally verified polygon intersection – Opus 4.8 oneshots, prev failed does
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…
- 1FV
To my knowledge, this is the first formally verified implementation of a 3D constructive solid geometry (CSG) operation: mesh intersection, implemented in Lean 4 and verified against a concise specification that pins down the surface of the resulting mesh exactly and guarantees practical well-formedness conditions on the triangulation. This project is also an experiment in avoiding having to trust AI-generated code. A human reviewer only needs to read 93 lines of formal specification and run the Lean checker to certify the correctness of the kernel, skipping the intricate 1000+ lines of…
Jul 2026 · github.com
- 2IT
2018 · wykobi.com
- 3TO
At Cajal (YC W26) we’re excited to share Talos (https://github.com/cajal-technologies/talos), an open source framework for formal verification of WebAssembly modules in Lean. AI is now writing tons of the code that gets pushed to production. As code generation gets cheaper, verification becomes the bottleneck. We believe in a future where every piece of software comes with a mathematical proof that it does what its author intended - in doing so, eliminating many classes of exploits. Talos is part of the foundation for that. Talos provides a Wasm interpreter optimized for…
Jun 2026 · github.com
- 4PC
2017 · proofcompanion.com
- 5
- 6ZC
Zero-Knowledge Proofs (ZKPs) let an untrusted proved show that computation was executed correctly without revealing the inputs to the verifier. However to prove anything, the computation first has to be expressed as a circuit: a system of polynomial equations (constraints) over a finite field. Circuits are the assembly language of zk and every constraint costs prover (and sometimes verifier) time, so production circuits are aggressively hand-optimized. Over the last months, we have been experimenting with writing formal specifications instead and letting LLMs produce the circuits: as long as…
Jul 2026 · zk.golf
- 7SA
Hi everyone, I’m a student with a strong interest in computer science and complexity theory. Recently, I worked on a manuscript attempting to prove that P ≠ NP. I know how this sounds — it’s one of the hardest and most debated problems in CS, and many have tried and failed. I don’t claim to have the final answer, but I believe the approach I used might at least offer some fresh perspective or provoke useful critique. The idea involves geometric separation between deterministic and nondeterministic computation, using high-dimensional lattice constructions and some physics-inspired intuition.…
2025 · zenodo.org
- 8AP
2019 · pmp-library.org
- 9IB
I am Francisco, a researcher from Spain. My English is not great so please be patient with me. One year ago I had a simple frustration: every AI agent works alone. When one agent solves a problem, the next agent has to solve it again from zero. There is no way for agents to find each other, share results, or build on each other's work. I decided to build the missing layer. P2PCLAW is a peer-to-peer network where AI agents and human researchers can find each other, publish scientific results, and validate claims using formal mathematical proof. Not opinion. Not LLM review. Real Lean 4 proof.…
Mar 2026
- 10LA
Hey HN! We built *lapisla*, a theorem proving platform designed to make formal proofs more open and collaborative. We developed a kernel, editor, proof registry, and platform ── all accessible directly in the browser. Why we built this: Existing theorem provers are powerful, but they often feel isolated and difficult to extend. Unlike modern programming languages, which thrive on package managers and shared libraries, theorem proving tools lack a seamless way to integrate others' work. lapisla aims to bridge this gap by: * Offering a verified public proof registry for sharing and discovering…
2025 · github.com
- 11NA
2020 · nodi3d.com
- 12IB
I've always been fascinated by cryptographic principles, so I decided to dive deep into zero-knowledge proofs and implement a Groth16 proof verifier entirely in Rust. This project validates cryptographic proofs and demonstrates how succinct, verifiable computations can be achieved. Using Rust's powerful libraries like arkworks, I implemented pairing checks, public input commitments, and proof validation logic while ensuring the code remains modular and efficient. I handled the complexities of affine group operations, scalar multiplications, and optimized public input verification to make…
2024 · github.com
- 13
- 14GA
Just a quick little feature I implemented over the weekend. TODO: Assure that polygons can be palindromic as well
2024 · altayakkus.dev
- 15
Contribute to skorotkiewicz/algebruh development by creating an account on GitHub.
29d ago · github.com
- 16
Isoline ▲9Node-based procedural 3D geometry in the browser. No install
Jul 2026 · isoline-studio.netlify.app
- 17GC
2020 · programmingdesignsystems.com
- 18SP
Current support for nonlinear inequalities in Lean is quite limited. This package attempts to solve this. It contains a collection of Lean4 tactics for proving polynomial inequalities via sum-of-squares (SOS) decompositions, powered by a Python backend. You can use it via Python or Lean. These tactics are significantly more powerful than `nlinarith` and `positivity` -- i.e., they can prove inequalities they cannot. In theory, they can be used to prove any of the following types of statements - prove that a polynomial is nonnegative globally - prove that a polynomial is nonnegative over a…
Apr 2026 · github.com
- 19FM
As the title and description of the GitHub repo suggest, I’m working on a small project for purely educational purposes, with the goal of implementing generative model inference (small models capable of modeling 2D distributions) based on the Flow Matching paradigm in C. I’ve worked on generative AI models based on Flow Matching from a more “abstract” perspective, using frameworks like PyTorch, and I wanted to understand what goes on behind the scenes. The repository is still a work in progress and is also one of my first "serious" projects in C.
Jul 2026 · github.com
- 20LA
I created LemmaScript to compile TypeScript to a verification backend (Dafny or Lean) and prove properties on the systematically derived model. I'll keep developing this, but I have a few case studies already, and it looks quite promising, with the caveat that each case study pushed the development of the core further. I can support both greenfield and brownfield projects, and in many cases, verification can be in-place: the TypeScript source is just annotated and verified independently but runs as is.
Apr 2026 · github.com
- 21PP
I've been working on applying LLMs to long-context, verifiable problems over the past year, and today I'm releasing a benchmark of 62,000 pencil puzzles across 94 types (sudoku, nonori, slitherlink, etc.). The benchmark also allows for intermediate checks /rule breaks for all varieties at any step. I tested 51 models against a subset (300 puzzles) in two modes: single-shot (output the full solution) and agentic (iterate with verifier feedback). Some results: - Best model (GPT 5.2@xhigh) solves 56%. (~ half the puzzles are unsolved by any model) - Agentic solves average 29 turns. The…
Mar 2026 · ppbench.com
- 22QA
Q12 is a new web-based 2D parametric drawing tool built specifically for geometric problem solving, for playing interactive "what if" games with drawings, and for the design and optimization of mechanisms. Q12 has the usual set of drawing constraints found in other CAD tools (e.g. "lines are parallel") but also supports inequality constraints, area constraints, and arbitrary expressions between geometric quantities. We built Q12 to solve problems like those below, after finding that existing CAD systems couldn't handle them well: * Given dimensions on a surveyor's map, figure out if the…
Feb 2026 · q12.app
- 23VA
Hi all, Gorkem here. I started VerifyWise [1] to make AI governance less painful. Today, we’re launching our open-source platform to help teams take control of their AI compliance process. VerifyWise helps organizations navigate AI governance by providing audit readiness, risk registers, model fairness checks, and compliance documentation. Those are all built into a single platform you can self-host. We’ve been quietly building VerifyWise for a while, and we’re now at a place where it’s ready for more teams to try. Since we started, we've: - Released our core platform on GitHub:…
2025 · verifywise.ai
- 24
Ranked by how close each launch is in meaning, then by votes. Refine with a description →