Life & fun · alternatives · 2026
24 alternatives to Lapisla – A Theorem Proving Platform for Openness and Reusability
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…
Below are 24 products that do a similar job, ranked by how close each is in meaning and then by launch-day votes.
- 1
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 →
- 2IW
The book page links to a blog post that explains how I got about it (and has a link to sample content), but the TL&DR is that I could not find a lot of books that were on "our" history _and_ were larded with technical details. So I set about writing one, and some five years later I'm happy to share the result. I think it's one of the few "computer history" books that has tons of code, but correct me if I'm wrong (I wrote this both to tell a story and to learn :-)). My favorite languages are Smalltalk and Lisp, but as an Emacs user, I've been using the latter for much longer and for my…
Feb 2026 · berksoft.ca · its alternatives →
- 3
Long-simmering side project that is finally ready to see the light. HAMTs are a cool persistent data structure and implementing one has been a lot of fun. Beyond the code, there is likely some value in the extensive and largely complete implementation docs; basic benchmarks are linked in the README, too. Kind of aiming to be "the libavl for HAMTs". That is obviously a high and aspirational bar but a distinct possibility if it stirs up a little interest and/or contribution. Anyways, it's time for this to go out, collect feedback and maybe even some use outside of toy projects. Let me…
2023 · github.com · its alternatives →
- 4
Everything that would be here is in the README. I hope this gets big, it has tons of potential.
2013 · github.com · its alternatives →
- 5IA
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 →
- 6
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 · its alternatives →
- 7
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 →
- 8
Hey HN, I wanted to share the new online playground for Salt (https://salt-lang.dev/playground/), a sovereign systems language designed for high-performance, distributed workloads where paying an "abstraction tax" is no longer acceptable. We started building Salt to bridge the gap between the raw power of manual pointer arithmetic and the safety guarantees of modern high-level languages. The architecture relies on an MLIR-based backbone and a Z3-powered "formal shadow," and the design is rooted in three main pillars: Fast Enough: The target is to stay within 20% of C's…
Jul 2026 · salt-lang.dev · its alternatives →
- 9
An Erlang library for generating adversarial network conditions for QAing distributed applications/systems on a single Linux box. - lostcolony/damocles
2015 · github.com · its alternatives →
- 10
- 11LP
Hi! I am doing a learning project, attempting to build an imperative language (and interpreter). The end product will be useless for others, I just want to learn and better understand how to build imperative languages. :) If someone else shares this interest and want to give some good hints on good resources I would be grateful. Currently I am looking at an awesome text by Bob Nystrom. All suggestions and tips on resources are most welcome. I am very much a beginner in this, but I find this topic very fascinating. Mail me or post links here! Cheers! You can try a beta version Online at…
2020 · its alternatives →
- 12
Wrote this to learn more about the `chumsky` parser combinator library, rustyline, and the `ariadne` error reporting crate. Such a nice DX combo for writing new languages. Still a work in progress, but I thought I'd share :)
2025 · github.com · its alternatives →
- 13
The open source dev environment engine for blockchain infra.
2020 · kurtosistech.com · its alternatives →
- 14
Advancing Formal Mathematical Reasoning via RL
2025 · github.com · its alternatives →
- 15
TypeScript as a proof assistant. GitHub Gist: instantly share code, notes, and snippets.
2025 · gist.github.com · its alternatives →
- 16
By Pranit Garje | github.com/pranitgarje
Apr 2026 · veniatyrannus993225.substack.com · its alternatives →
- 17
An Erlang library for carefully refactoring critical paths - sthadka/fuge
2016 · github.com · its alternatives →
- 18
My partner Matt and I have been working on soj.ooO. It has only been up for a few weeks and has gained a lot of traction. Our goal was to fight the memory hole to ensure that algorithms do not control human discussions (eg auto decay on other sites) and generally bring natural law back into the discussion and relevance equation. Hope you like it!
2025 · hw.glich.co · its alternatives →
- 19
- 20SA
Hi HN, This is ProofTree, and in TLDR: it is a platform where you can chat with an AI to do math, the way you already do, with context-awareness and knows how you personally do math, connected to the fora of other live human mathematicians. So, when you are talking to an AI about a proof at 3 am, and you need a human expert looking at it, or a discussion around it, like you do on StackExchange, this is it! You need an approved email account to use it, so please write here if you would live to try it out.
Jul 2026 · prooftree.ai · 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
We've been working on an open-source coding agent that generates code alongside machine-checkable proofs. We'd love feedback from the HN community, especially from people interested in formal verification, Lean, Dafny, or AI coding agents. Currently, only 3 langauges can be verified.
Jul 2026 · github.com · its alternatives →
- 23
a Pythonic toolkit for working with Boolean expressions - welchbj/tt
2016 · github.com · its alternatives →
- 24AC
I built this toolkit with my colleague to dive deep into OS internals and automate the identification of privilege escalation vectors. Written in pure C without external dependencies, it explores everything from Linux capabilities and Docker escapes to Windows token manipulation and service permissions. We believe that the constant struggle between breaking and securing systems is the ultimate driver of software evolution. This tool is our contribution to that cycle, designed for researchers who want to understand how low-level misconfigurations can be discovered and audited across different…
Jan 2026 · its alternatives →
Also compare
- Formalizing Principia Mathematica using Lean alternatives
- I wrote a technical history book on Lisp alternatives
- A hash array-mapped trie implementation in C alternatives
- I started a repo for sharing algorithm implementations alternatives
- i2forge – A Platform for Verified Reasoning alternatives
- Talos – Open-source WASM interpreter for Lean 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 →