Alternatives

Products that do what Prove set membership without exposing the set or the member does

1DH
Diffie-Hellman exchange for the layman▲75
2021 · borisreitman.com
2PA
Poica – Algebraic data types and type introspection for pure C▲116
2020 · github.com
3FI
FLP Impossibility Theorem Proof in Coq▲38
2015 · github.com
4AI
An Interpreter for Extended Relational Algebra (Scheme Based)▲52
2016 · github.com
5ZK
Zero-Knowledge Proofs in WebAssembly▲81
2019 · zkwasm.kobi.one
6PC
Proof Companion – Geometry proof practice for students▲64
2017 · proofcompanion.com
7AT
A toy compiler of a Scala subset▲13
2021 · mykolav.github.io
8CS
Cocert: split your private keys securely amongst untrusted network▲37
2021 · github.com
9DK
Decentralized, k-ordered unique IDs in Clojure▲53
2014 · github.com
10SF
Snigl – Forth with Lisp in C▲87
2019 · gitlab.com
11MV
Minimal versioned log structured relational DB in Common Lisp▲110
2021 · github.com
12AL
A Lock- and wait-free hashtable (and an array too), written in C▲24
2016 · github.com
13ZC
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
14AR
A Rigorous Proofless Approach to Linear Algebra [pdf]▲14
2017 · github.com
15PO
Proof of Position▲17
2014 · proofofposition.com
16AA
AnoProof – Anonymous Proof of Identity▲5
2020 · anoproof.com
17LL
LCON – Ludicrously Compact Object Notation▲35
2014 · github.com
18LC
Lazysodium – Cryptography made effortless▲5
2018 · github.com
19IM
I made a free alternative to Splitwise, without input limits▲7
2024 · letsplit.com
20TA
The A-C Coupling Theorem – Solving Diophantine Systems in O(1)▲5
Jun 2026 · zenodo.org
21KS
Kotlin∇: Shape-Safe Symbolic Differentiation with Algebraic Data Types▲15
2021 · github.com
22JR
`join!` – Rust macros with combinators to join everything▲5
2019 · github.com
23YC
You can program without loop and recursion and×÷- is all you need▲9
2024 · github.com
24EI
Efficient integer ID obfuscation▲6
2016 · github.com

Ranked by how close each launch is in meaning, then by votes. Refine with a description →