Life & fun · alternatives · 2026
24 alternatives to Chaum Pedersen ZK Protocol Using gRPC
Here is the protocol worklow. Let us define g as the generator of the multiplicative cyclic group G of order q. Let us define p = 2q + 1 (a safe prime). The values p, g, a1, b1, c1 are publicly available to the prover and the verifier. a1 = g^a mod q b1 = g^b mod q c1 = g^ab mod q where a and b are cryptographically secure randomly generated numbers. prover wants to prove he knows a secret x. the prover computes y1 = g^x mod q and y2 = b1^x mod q. the prover sends y1 and y2 to the verifier. The verifier then computes a challenge value s and sends it to the prover. the prover then computes z…
This is an implementation of the Chaum Pedersen zero-knowledge proof protocol using gRPC for communication between a prover and verifier. The system enables one party to cryptographically prove knowledge of a secret… Below are 24 products that do a similar job, ranked by how close each is in meaning and then by launch-day votes. Prices are shown for the 1 we have checked on their own sites, 1 of them free or with a free tier.
- 1GC
Achieved a new world record in verifying the Goldbach Conjecture using grid computing, by extending the verification up to 4 quadrillion (4×10¹⁸) + 70 trillion (7×10¹³). My grid computing system - Gridbach is a cloud-based distributed computing system accessible from any PC or smartphone. It requires no login or app installation. The high-performance WASM (WebAssembly) binary code is downloaded as browser content, enabling computation on the user’s browser. [Website] https://gridbach.com/ [Medium]…
2025 · medium.com · its alternatives →
- 2
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 →
- 3
filippo.io/mlkem768 is a pure-Go implementation of the post-quantum key exchange mechanism ML-KEM-768 optimized for correctness and readability.
2024 · words.filippo.io · its alternatives →
- 4
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 →
- 5
Very basic blockchain-free cryptocurrency PoC in Python - spipm/crackcoin
2017 · github.com · its alternatives →
- 6CP
Evaluate a degree-n polynomial with about n/2 multiplications. Type a polynomial, pick ℚ, ℝ, ℂ, a Mersenne prime or a binary field, and get the preprocessed evaluation chain as math, C code or a circuit — everything runs in your browser.
Sep 2026 · thomasahle.com · its alternatives →
- 7
A pipeline that translates Rust GPU code into formal Coq models, as a foundation for memory model proofs - neelsomani/vericuda
Oct 2025 · github.com · its alternatives →
- 8
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 →
- 9DH
2013 · 9ac345a5509a.github.io · its alternatives →
- 10
Hi HN, We (myself, Adhyyan1252 and yush_g) are undergrad students that hacked out this side project last month during Hack Lodge[1] (the ideas and many of the underlying circuits for which came from the 0xPARC community[2])! We’re extremely excited to share this new primitive. Besides the technical challenges building this project that folks here would find interesting (fixing the ZK proof compiler, modifying nodeJS V8 params etc.), we think this is a very novel use case for ZK tech, and ECDSA inside ZK-SNARKs is a starting point that unlocks many other ideas! :D A summarized version of our…
2022 · github.com · its alternatives →
- 11
Mobile ZK Puzzle Game with NFT rewards. Contribute to nalinbhardwaj/wordlines development by creating an account on GitHub.
2022 · github.com · its alternatives →
- 12
Neptune is a quantum-safe layer 1 blockchain combining zk-STARKs and PoW consensus. Private by default, programmable, and built for global scale
2014 · neptune.io · its alternatives →
- 13
GpgFrontend▲87Take the initiative to protect privacy in your own hands
2021 · github.com · its alternatives →
- 14
Generalized Diffie-Hellman key exchange Java library built on top of the Vert.x framework - maxamel/GDH
2017 · github.com · its alternatives →
- 15DB
The only way to get a trust-less random value is to have it distributed and time-locked three ways, player, server and a future-entropy. In the demo above, the moment you commit (Roll-Dice) a commit with the hash of a player secret is sent to the server and the server accepts that and sends back the hash of its secret back and the "future" drand round number at which the randomness will resolve. The future used in the demo is 10 secs When the reveal happens (after drand's particular round) all the secrets are revealed and the random number is generated using…
Feb 2026 · blockrand.net · its alternatives →
- 16
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 →
- 17ZK
2019 · zkwasm.kobi.one · its alternatives →
- 18
grpc microservices with mutual TLS and token authentication in Go - 3n21c0/hello-auth-grpc
2017 · github.com · its alternatives →
- 19
Wordle, but with ZK proofs! Contribute to nalinbhardwaj/zordle development by creating an account on GitHub.
2022 · github.com · its alternatives →
- 20
Generalized Diffie-Hellman key exchange Java library built on top of the Vert.x framework - maxamel/GDH
2018 · github.com · its alternatives →
- 21
This project template lets you bootstrap your next gRPC app with zero trust overlay networking. Make your gRPC server invisible to bad actors, and only allow verified clients to connect to it.
2022 · github.com · its alternatives →
- 22
It is based on phase noise, consumes less than 60 LUT4s/FFs and achieves up to 7.99 bits of entropy per byte. Feel free to comment if you have any questions, ideas or thoughts :)
2023 · github.com · its alternatives →
- 23IP
2017 · strandmark.net · its alternatives →
- 24
The A-C Coupling Framework presents a general law for n-dimensional linear Diophantine systems of the form N = Σ cᵢ · xᵢ. Two structural conditions are identified as jointly sufficient for a direct, single-step determination of the minimum starting value A₀ = N mod c₂: Condition one (Foundation): th
Jun 2026 · zenodo.org · its alternatives →
Also compare
- Goldbach Conjecture up to 4*10^18+7*10^13 alternatives
- zkGolf – Competitive optimization of formally verified circuits alternatives
- filippo.io/mlkem768 – Post-Quantum Cryptography for the Go Ecosystem alternatives
- I Built a Groth16 ZK-Proof Verifier from Scratch Using Rust alternatives
- Very basic blockchain-free cryptocurrency PoC in Python alternatives
- Compute Polynomials Twice as Fast 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 →