Salt
a systems language with Z3 theorem proving in the compiler
Get picks like this daily. Today's launch numbers, the top launches, AI and tech news, and a daily opportunity pick, straight to your inbox.
Want to reach these readers? Sponsor an issue.
HN · launched Jul 1, 2026 · 44 upvotes (top 17%) · 0 views
Niche: programming languages and interpreters · 162 launches, 1 in the last 7 days ▼ -88% · Explore this niche →
Category and tags
- Horizontal
- Dev tools
- Developer
- Not AI
- Hobby / open-source project
Visit website ↗ Source listing ↗
More like this: all 162 launches in programming languages and interpreters →
Could you build this?
No Designing a systems programming language with an embedded formal verification engine and SMT solver (Z3) integration in the compiler requires deep expertise in formal methods, type systems, and compiler design. Vibe coding cannot reliably construct sound compiler semantics and mathematical theorem-proving pipelines.
What it would actually take: A realistic implementation requires a custom compiler frontend (parsing, AST, semantic analysis) written in Rust or C++, an intermediate representation designed for verification, and deep integration with the Z3 SMT solver via its C/Rust API. The hardest challenge is formal semantics design: translating program invariants, preconditions, and postconditions into SMT formulas without divergence or unsoundness. This requires advanced expertise in formal verification, automated theorem proving, and low-level code generation (e.g., via LLVM).
Discussion
20 comments analyzed.
Competitors mentioned: Verus - formal verification system with similar goals, The Vera Project - more mature with 92 contributors, Salt - different ergonomics and performance goals, Liquid Haskell - verification with different syntax
Concerns raised: AI-generated code raises questions about expertise and reliability, Unclear what is verified at compile-time vs runtime (bounds checks, overflow), Missing requires clauses in documented examples, Discrepancy between automatic loop tiling claims and manual tiling in implementation, Complex loop invariants not automatically inferred for cases like bubblesort
Feature requests: Better error messages for verification failures, Automatic invariant inference for array content verification, Support for complex while loop conditions beyond simple counters, Warning when checks are deferred to runtime
Competitors
Other products that read as similar to this one : 3515 launches clear the similarity bar, closest 8 shown.
Attention rank: #586 of 3516 (itself plus its competitors, highest first, normalized so YC and Product Hunt are compared fairly).
Launched 245 days after the earliest competitor.
- Agent-to-code JIT compiler for Z3-theorem-proving agents · hn · 2025-11-13 · 6 upvotes · similarity 0.69
- oss-verify-proofs · github · 2026-10-22 · 160 upvotes · similarity 0.66
- Kvist · hn · 2026-08-28 · 34 upvotes · similarity 0.66
- blackbox · github · 2026-09-23 · 14 upvotes · similarity 0.65
- rok · github · 2026-10-25 · 15 upvotes · similarity 0.65
- X · hn · 2026-06-15 · 5 upvotes · similarity 0.65
- vearl · github · 2026-10-10 · 15 upvotes · similarity 0.64
- Stacks · github · 2026-11-04 · 127 upvotes · similarity 0.64
The niche, labels, vibe code rating and competitor comparison on this page are analysis by Nicheloom. If you use them, please credit nicheloom.com. How you may use our data.