Dev tools · alternatives · 2026

24 alternatives to Tiny Hoare logic verifier using SMT

Course on Metaprogramming. Contribute to namin/metaprogramming development by creating an account on GitHub.

Tiny Hoare logic verifier using SMT is a formal verification tool that checks program correctness using Hoare logic and SMT (Satisfiability Modulo Theories) solvers. It is designed for developers and computer science… Below are 24 products that do a similar job, ranked by how close each is in meaning and then by launch-day votes.

1
LLM Verified with Monte Carlo Tree Search▲102
This is a weekend hack that I'd like to further develop as it's working surprisingly well. Using MCTS, we can explore a space of possible verified programs with an LLM. We check the partial programs at each step, and so steer towards programs that pass the verifier. https://github.com/namin/llm-verified-with-monte-carlo-tree-...
2023 · github.com · its alternatives →
2
GPT‑5.4 mini and nano▲267
Fast and efficient models optimized for coding and subagents
Mar 2026 · openai.com · its alternatives →
3
Automatically interpret and validate nested natural logic arguments▲53
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 →
4
Tiny-vLLM – high performance LLM inference engine in C++ and CUDA▲205
Build your own high performance LLM inference engine in C++ and CUDA - a smaller version of vLLM - jmaczan/tiny-vllm
May 2026 · github.com · its alternatives →
5
We made our own inference engine for Apple Silicon▲186
We wrote our inference engine on Rust, it is faster than llama cpp in all of the use cases. Your feedback is very welcomed. Written from scratch with idea that you can add support of any kernel and platform.
2025 · github.com · its alternatives →
6
TinyGo – LLVM-based Go compiler for microcontrollers▲177
Go compiler for small places. Microcontrollers, WebAssembly (WASM/WASI), and command-line tools. Based on LLVM. - tinygo-org/tinygo
2018 · github.com · its alternatives →
7
Entropy-Guided Loop – How to make small models reason▲33
TLDR: A small, vendor-agnostic inference loop that turns token logprobs/perplexity/entropy into an extra pass and reasoning for LLMs. - Captures logprobs/top-k during generation, computes perplexity and token-level entropy. - Triggers at most one refine when simple thresholds fire; passes a compact “uncertainty report” (uncertain tokens + top-k alts + local context) back to the model. - In our tests on technical Q&A / math / code, a small model recovered much of “reasoning” quality at ~⅓ the cost while refining ~⅓ of outputs. I kept seeing “reasoning” models behave…
2025 · github.com · its alternatives →
8
zkGolf – Competitive optimization of formally verified circuits▲69
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 →
9
Tiny – A 2D Game Engine in Kotlin Working with Lua▲100
I created a small 2D game engine named Tiny. The engine was created using Kotlin Multiplatform and can run on a JVM and JS. Funny things: Games can be created using the programming language Lua. Tiny is designed to help you create and test your ideas quickly and effectively. Not only can you run your games on your desktop computer, but you can also export them for the web, making it easy to share your creations with others. You can create games easily with the hot reload, small API and Lua, which is very easy to learn. If you want to test a game idea, to try to create your first game or just…
2023 · minigdx.github.io · its alternatives →
10
A hash array-mapped trie implementation in C▲171
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 →
11
An encoding of the UK's self-isolation rules in Prolog▲108
An encoding of the UK's self-isolation rules in Prolog - jamespwilliams/prolog-isolation-checker
2021 · github.com · its alternatives →
12
Formalizing Principia Mathematica using Lean▲188
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 →
13
Small Clojure Interpreter▲143
Configurable Clojure/Script interpreter suitable for scripting and Clojure DSLs - babashka/sci
2019 · github.com · its alternatives →
14MA
Micrologic – A tiny, literate implementation of miniKanren/core.logic▲28
2015 · mullr.github.io · its alternatives →
15TC
Ternary Computer System▲145
Hi everyone! I'm an Italian programmer, very passionate about computer architecture. Some time ago I realized that some architectures potentially much superior to the classic VonNeumann, have been forgotten because there were no reliable technical solutions to implement them. One of these architectures particularly struck me and it is the "Dataflow architecture", in which there is no Program counter, but the instructions are executed in real contemporaneity whenever the operands are available. In trying to find a technical solution that implements this type of architecture effectively…
2024 · ternary-computing.com · its alternatives →
16
TypeScript as a proof assistant for intuitionistic propositional logic▲17
TypeScript as a proof assistant. GitHub Gist: instantly share code, notes, and snippets.
2025 · gist.github.com · its alternatives →
17
A Clojure implementation of logic programming language in SICP▲56
A Clojure implementation of the logic programming language from chapter 4 of SICP - jdormit/sicp-logic
2019 · github.com · its alternatives →
18
Klarity – Open-source tool to analyze uncertainty/entropy in LLM output▲132
We've open-sourced Klarity - a tool for analyzing uncertainty and decision-making in LLM token generation. It provides structured insights into how models choose tokens and where they show uncertainty. What Klarity does: - Real-time analysis of model uncertainty during generation - Dual analysis combining log probabilities and semantic understanding - Structured JSON output with actionable insights - Fully self-hostable with customizable analysis models The tool works by analyzing each step of text generation and returns a structured JSON: - uncertainty_points: array of {step, entropy,…
2025 · github.com · its alternatives →
19
PlanckForth – Bootstrapping an interpreter from handwritten 1kb binary▲132
Bootstrapping a Forth interpreter from hand-written tiny ELF binary. Just for fun. - GitHub - nineties/planckforth: Bootstrapping a Forth interpreter from hand-written tiny ELF binary. Just for fun.
2021 · github.com · its alternatives →
20
Tiny – An interpeted dynamic langauge with inline Go native functions▲41
A lightweight programming language built with Go. Contribute to confh/Tiny development by creating an account on GitHub.
Jun 2026 · github.com · its alternatives →
21
O'Doyle Rules – a new rules engine for Clojure▲100
A rules engine for Clojure(Script). Contribute to oakes/odoyle-rules development by creating an account on GitHub.
2020 · github.com · its alternatives →
22IA
i2forge – A Platform for Verified Reasoning▲35
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 →
23
Tiny Tool Use by Bagel Labs▲17
Achieve tool use with open-source LLMs, made simple
2025 · github.com · its alternatives →
24
I wrote a VM and Compiler for a small language in Go▲37
My implementation of Thorsten Bell's book (Writing an Interpreter in Go) - actuallyachraf/monkey-giggle
2020 · github.com · its alternatives →

Also compare

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 →