FLP Impossibility Theorem Proof in Coq
Formalization of FLP Impossibility Theorem. Contribute to kushti/flp development by creating an account on GitHub.
FLP Impossibility Theorem Proof in Coq launched on June 9, 2015 with 38 votes, #1,292 of 3,954 launches that month and more than 90% of that year's launches. The site was still online in September 2026, 11 years on.
In plain words
FLP Impossibility Theorem Proof in Coq is a formalized proof of the Fischer-Lynch-Paterson impossibility theorem using the Coq proof assistant. It is designed for researchers and developers working with distributed systems and formal verification. The project is hosted on GitHub and allows contributors to participate in its development.
written from the facts on this page · September 2026
Does a similar job
all alternatives →
Cuq – Formal Verification of Rust GPU Kernels2025 · github.com · ▲94A pipeline that translates Rust GPU code into formal Coq models, as a foundation for memory model proofs - neelsomani/vericuda
Formalizing Principia Mathematica using Lean2025 · github.com · ▲188This project aims to formalize the first volume of Prof. Bertrand Russell’s Principia Mathematica using the Lean theorem prover. Throughout the formalization, I tried to rigorously follow Prof. Russell’s proof, with no or little added statements from my side, which were only necessary for the formalization but not the logical argument. Should you notice any inaccuracy (even if it does not necessarily falsify the proof), please let me know as I would like to proceed with the same spirit of rigour. Before starting this project, I had already found Prof. Elkind’s formalization of the Principia…
zkGolf – Competitive optimization of formally verified circuitsJul 2026 · zk.golf · ▲69Zero-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…
Formally verified polygon intersection – Opus 4.8 oneshots, prev failedJun 2026 · github.com · ▲93To 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…
- GCGoldbach Conjecture up to 4*10^18+7*10^132025 · medium.com · ▲244
Achieved a new world record in verifying the Goldbach Conjecture using grid computing, by extending the verification up to 4 quadrillion (4×10¹⁸) + 70 trillion (7×10¹³). My grid computing system - Gridbach is a cloud-based distributed computing system accessible from any PC or smartphone. It requires no login or app installation. The high-performance WASM (WebAssembly) binary code is downloaded as browser content, enabling computation on the user’s browser. [Website] https://gridbach.com/ [Medium]…
Automatically interpret and validate nested natural logic arguments2017 · github.com · ▲53Automatically interpret and validate nested natural logic arguments based on rules of inference and propositional logic - ParhamP/Natural_Logic_Interpreter
More dev tools this month
the category →
Contribute to oosexgang/hackios-xnu-kernel development by creating an account on GitHub.
Dev tools · 1d ago · github.com
open-source IDE for thoughtful software design. Contribute to devdotfast/whiteboard development by creating an account on GitHub.
Dev tools · 29d ago · github.com
Contribute to reladraw/reladraw development by creating an account on GitHub.
Dev tools · 27d ago · github.com
OpenBot▲362Grok Bot alternative: free, local, open-source, multiplayer
Dev tools · 24d ago · openbot.run
Talanoa▲346Hi HN, I’m a fullstack developer, and honestly, I’ve lost count of how many side projects I’ve worked on over the years. But one idea kept coming back to me: a different kind of email client. It first came to me in 2014: “What if we could handle emails more like conversations?” Every year, I’d revisit this concept in my “Build Notes.” Ten years later, no one had built exactly what I had in mind — so I finally decided to do it myself. That’s how Talanoa was born. I wanted something focused on people, not timelines. I was tired of marking messages as unread just to remember to reply later, or…
Dev tools · 22d ago · talanoa.email
Source: Show HN post ↗
Launched alongside, June 2015
the whole month →
Startup Launch List▲1,251Articles you need to read before launching a startup.
Growth · 2015 · startuplaunchlist.com
Get any site's company logo with just a URL
Dev tools · 2015 · clearbit.com
