Alternatives
Products that do what Anders CCHM/HTS Theorem Prover does
Anders is HoTT theorem prover based on: classical MLTT-80 with 0, 1, 2, W types; CCHM in CHM flavour as cubical type system with hcomp/trans Kan operations; HTS sctrict equality on pretypes; de Rham stack modality primitives. We tend not to touch general recursive higher inductive schemes yet, instead we will try to express as much HIT as possible through W, Coequlizer and HubSpokes Disc in the style of HoTT/Coq homotopy library and Three-HIT theorem. Written in OCaml https://github.com/groupoid/anders
- 1CA
2015 · github.com
- 2AK
I shipped a wiki layer for AI agents that uses markdown + git as the source of truth, with a bleve (BM25) + SQLite index on top. No vector or graph db yet. It runs locally in ~/.wuphf/wiki/ and you can git clone it out if you want to take your knowledge with you. The shape is the one Karpathy has been circling for a while: an LLM-native knowledge substrate that agents both read from and write into, so context compounds across sessions rather than getting re-pasted every morning. Most implementations of that idea land on Postgres, pgvector, Neo4j, Kafka, and a dashboard. I…
Apr 2026 · github.com
- 3CA
2021 · github.com
- 4ZC
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
- 5FV
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
- 6PA
2020 · github.com
- 7
- 8MA
2017 · github.com
- 9AI
2016 · github.com
- 10WA
2020 · axellang.github.io
- 11FI
2015 · github.com
- 12
Contribute to skorotkiewicz/algebruh development by creating an account on GitHub.
29d ago · github.com
- 13LA
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
- 14IB
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
- 15AA
2017 · github.com
- 16TA
Jun 2026 · zenodo.org
- 17E0
2017 · github.com
- 18LA
2019 · github.com
- 19NT
I built a CLI tool that turns codebases and PRs into diagrams so you can quickly understand how things fit together. Originally made it because I couldn't follow my own AI-generated repos. Just shipped a big update: - Switched from D2 to Mermaid for rendering - Tree-sitter AST parsing + agentic flow instead of raw LLM calls. ~50x faster. - Works on any GitHub repo or PR, not just local - Dropped the web frontend, it's just a CLI now - Published as a pip package Still a ton to improve and I'm building fast. Feedback, issues, PRs all welcome.
Feb 2026 · github.com
- 20RA
Hey HN! I've been building Claurst - a clean-room implementation of Claude Code in Rust, with extra features to make my ideal agentic Open-Source AI CLI. It's WIP and rough, but I'm shipping a lot to make it amaze amaze amaze. Inspired by this HN post [1] I saw a few hours ago about caveman speak for token-efficient output, I added /Caveman and /Rocky (from project Hail Mary) to Claurst. Caveman grammar drops ~70% of output tokens keeping technical substance and Rocky brings a close compression with more personality. Both are first-class slash commands with three levels: lite,…
Apr 2026 · github.com
- 21DA
Hi HN, Today I'd like to present the results of my weekend project of the last year or so. Given there are many posts on HN about LLMs and Prolog, I thought that this would be of interest. DeepClause is my own (possibly misguided :-) attempt at combining LLMs with Logic Programming, ultimately hoping to establish a foundation for building more reliable agents, that produce reproducible and fully traceable result. At the heart of DeepClause is a DSL called "DeepClause Meta Language" (DML) which can be used to encode agent behaviors as executable logic programs. DML is executed by a…
Nov 2025 · github.com
- 22CT
Hey there HN! We’re Vasilije, Boris, and Laszlo, and we’re excited to introduce cognee, an open-source Python library that approaches building evolving semantic memory using knowledge graphs + data pipelines Before we built cognee, Vasilije(B Economics and Clinical Psychology) worked at a few unicorns (Omio, Zalando, Taxfix), while Boris managed large-scale applications in production at Pera and StuDocu. Laszlo joined after getting his PhD in Graph Theory at the University of Szeged. Using LLMs to connect to large datasets (RAG) has been popularized and has shown great promise.…
2025 · github.com
- 23SA
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
- 24MA
I'm interested in Buddhist philosophy, and specifically studying Nāgārjuna's Middle Way gave me inspiration to formalize it mathematically and see what would emerge as a result. (My background: engineer/co-founder (Qualcomm/Adreno GPU, Bumble, Stereo), 16 years of meditation practice, 2+ years in Southeast Asian monasteries and silent retreats) Starting from one Buddhist-inspired axiom—recursive duality E={E⁻,E⁺} - I derived: 1) Boolean logic (from period structure of minimal couplings) 2) Universal computation (closure enables Turing-completeness) 3) Memory (pattern persistence…
Jan 2026
Ranked by how close each launch is in meaning, then by votes. Refine with a description →