Dev tools · alternatives · 2026
24 alternatives to 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 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… Below are 24 products that do a similar job, ranked by how close each is in meaning and then by launch-day votes. FLP Impossibility Theorem Proof in Coq launched in 2015; newer entries below may have overtaken it.
- 1
A pipeline that translates Rust GPU code into formal Coq models, as a foundation for memory model proofs - neelsomani/vericuda
2025 · github.com · its alternatives →
- 2
This 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…
2025 · github.com · its alternatives →
- 3
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 · its alternatives →
- 4
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…
Jun 2026 · github.com · its alternatives →
- 5GC
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]…
2025 · medium.com · its alternatives →
- 6
Automatically interpret and validate nested natural logic arguments based on rules of inference and propositional logic - ParhamP/Natural_Logic_Interpreter
2017 · github.com · its alternatives →
- 7
Free cross-platform deniable encryption cryptoarchiver - GitHub - zorggomat/FractalCryptGUI: Free cross-platform deniable encryption cryptoarchiver
2021 · github.com · its alternatives →
- 8
a minimal versioned log structured relational DB in Common Lisp - GitHub - codr7/whirlog: a minimal versioned log structured relational DB in Common Lisp
2021 · github.com · its alternatives →
- 9
A rules engine for Clojure(Script). Contribute to oakes/odoyle-rules development by creating an account on GitHub.
2020 · github.com · its alternatives →
- 10
An encoding of the UK's self-isolation rules in Prolog - jamespwilliams/prolog-isolation-checker
2021 · github.com · its alternatives →
- 11
Hi HN, I turned the freshly published paper “The Constructor Theory of Time” by David Deutsch and Chiara Marletto (arXiv, 13 May 2025) into an executable Python library. What you’ll find • One-to-one translation of the paper’s formalism: Substrates, Attributes, Tasks, Constructors, and task-algebra operators • Possibility / impossibility predicates and counterfactuals encoded exactly as defined • Test suite that mirrors every lemma and example (>95 % coverage, mypy-typed) • Reproductions of key results: time-keeping substrates, irreversibility proofs, quantum branching tasks, and a…
2025 · github.com · its alternatives →
- 12ZK
2019 · zkwasm.kobi.one · its alternatives →
- 13IA
Hi! We're Amisi and Claude, builders of the i2 language and the i2forge platform. i2 is an (early draft of a) language designed to make formal verification easy for mathematicians. We are launching the language as an open source project today (https://i2lang.org) together with a closed alpha for i2forge. However, we have a publicly accessible demo page which anyone can use, and we would love your feedback. Thanks.
2023 · i2forge.com · its alternatives →
- 14
Framework for specifying and proving properties—such as robustness, fairness, and interpretability—of machine learning models using Lean 4. - fraware/leanverifier
2025 · github.com · its alternatives →
- 15
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 · its alternatives →
- 16
The Thiele Machine is a formally verified universal computational model the surpasses Turing machines in key ways. It's fully proven in Coq (including kernel theorems and universality containment), features a python implementation for simulation and includes hardware designs in Verilog for potential FPGA/ASIC builds. The core idea: a paradigm shift using μ-bits for stricter computation under real-world constraints, tying into physics (e.g., Noether’s theorem) and emergence in chaotic systems. The repo includes a 13-chapter thesis (PDF and sources), proofs, and tools for exploration.…
Jan 2026 · github.com · its alternatives →
- 17
A cross-language, zero-copy coroutine observability framework based on the cTP shared-memory protocol, utilizing lock-free ring buffers for ultra-low overhead state tracing. - lixiasky-back/coroTracer
Mar 2026 · github.com · its alternatives →
- 18
Implementations of various type systems in OCaml. Contribute to tomprimozic/type-systems development by creating an account on GitHub.
2014 · github.com · its alternatives →
- 19
A Clojure implementation of the logic programming language from chapter 4 of SICP - jdormit/sicp-logic
2019 · github.com · its alternatives →
- 20
2017 · github.com · its alternatives →
- 21
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 · its alternatives →
- 22
TypeScript as a proof assistant. GitHub Gist: instantly share code, notes, and snippets.
2025 · gist.github.com · its alternatives →
- 23
A Cloud monad based on transient for the creation of Web and reactive distributed applications that are fully composable, where Web browsers are first class nodes in the cloud - GitHub - transient-haskell/transient-universe: A Cloud monad based on transient for the creation of Web and reactive distr
2016 · github.com · its alternatives →
- 24
Here is the protocol worklow. Let us define g as the generator of the multiplicative cyclic group G of order q. Let us define p = 2q + 1 (a safe prime). The values p, g, a1, b1, c1 are publicly available to the prover and the verifier. a1 = g^a mod q b1 = g^b mod q c1 = g^ab mod q where a and b are cryptographically secure randomly generated numbers. prover wants to prove he knows a secret x. the prover computes y1 = g^x mod q and y2 = b1^x mod q. the prover sends y1 and y2 to the verifier. The verifier then computes a challenge value s and sends it to the prover. the prover then computes z…
2025 · github.com · its alternatives →
Also compare
- Cuq – Formal Verification of Rust GPU Kernels alternatives
- Formalizing Principia Mathematica using Lean alternatives
- zkGolf – Competitive optimization of formally verified circuits alternatives
- Formally verified polygon intersection – Opus 4.8 oneshots, prev failed alternatives
- Goldbach Conjecture up to 4*10^18+7*10^13 alternatives
- Automatically interpret and validate nested natural logic arguments alternatives
Ranked by how close each launch is in meaning, then by votes. Prices were read from each product’s own site when checked and can change. Refine with your own description →