Alternatives
Products that do what zkGolf – Competitive optimization of formally verified circuits does
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…
- 1ZK
2019 · zkwasm.kobi.one
- 2AC
2019 · github.com
- 3AA
2017 · github.com
- 4IB
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
- 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
- 6ZV
I was learning ZK proofs and found that visualizing things really helped me understand them. Noticed there aren't many interactive visualizations out there, so I built one. Here's the first version: zkvisualizer.com It walks through the full pipeline step by step (Problem → Circuit → R1CS → Polynomials → Witness → Proof → Verification) with real Groth16 proofs generated in your browser using snarkjs. You can toggle between what the prover knows vs what the verifier sees, and there's a tamper detection demo where you can watch verification fail. This is still very early on, but I would be…
Jan 2026 · zkvisualizer.com
- 7AT
A 3.16M-parameter INT4 transformer running entirely in the on-chip memory of a Xilinx Kria KV260. Zero DRAM in the token loop, 59,965 tok/s on the fabric, bit-exact. Chat with it live.
27d ago · mikeayles.com
- 8
- 9HA
Most ZK proving systems are optimized for server-grade hardware with massive RAM. When scaling to industrial-sized traces (2^20+ rows), they often hit a "Memory Wall" where allocation and data movement become a larger bottleneck than the actual computation. I have been developing Hekate, a ZK engine written in Rust that utilizes a Zero-Copy streaming model and a hybrid tiled evaluator. To test its limits, I ran a head-to-head benchmark against Binius64 on an Apple M3 Max laptop using Keccak-256. The results highlight a significant architectural divergence: At 2^15 rows: Binius64 is faster…
Jan 2026
- 10AO
2020 · github.com
- 11E0
2017 · github.com
- 12IO
Hey folks, I’m the creator of WFGY — a semantic reasoning framework for LLMs. After open-sourcing it, I did a full technical and value audit — and realized this engine might be worth $8M–$17M based on AI module licensing norms. If embedded as part of a platform core, the valuation could exceed $30M. Too late to pull it back. So here it is — fully free, open-sourced under MIT. --- ### What does it solve? Current LLMs (even GPT-4+) lack *self-consistent reasoning*. They struggle with: - Fragmented logic across turns - No internal loopback or self-calibration - No modular thought units - Weak…
2025 · 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
- 14VL
Nov 2025 · github.com
- 15AT
Nov 2025 · github.com
- 16PA
2021 · github.com
- 17OS
We’ve just released an open-source library for solving the Maximum Independent Set (MIS) problem with neutral atom quantum computing, running on both quantum processing units (QPUs) and classical hardware, thanks to emulators. This project is the result of collaboration between Pasqal, academic researchers, and industry partners, aiming to make it practical to experiment with quantum approaches to hard combinatorial optimization tasks. The MIS problem appears in real-world scenarios like scheduling, resource allocation, and network optimization, areas where classical solvers often struggle…
2025
- 18ZZ
A collection of high-performance data structures for Zig.
Dec 2025 · github.com
- 19SA
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
- 20SA
2018 · branchfree.org
- 21AG
2019 · made2591.github.io
- 22TA
Jun 2026 · zenodo.org
- 23SA
Hey HN, My co-author and I just published a paper on arXiv that formalises a framework we've been using successfully in probabilistic logic for many years. We decided it was time to properly lay out its foundations for classical propositional logic. We cast propositional logic into a formal algebra where logical formulas are represented by sparse matrices. State Algebra isn't an algorithm in itself, but rather a language for manipulating Boolean functions. It provides a new set of tools that lets you express and reformulate existing optimization heuristics (like those from modern SAT…
Sep 2025 · arxiv.org
- 24AN
Kimi K3 has 2.78 trillion parameters and ships as 1.42 TB of weights. It clearly does not fit in the memory of a laptop. But K3 is a Mixture-of-Experts model. For each token, only a small fraction of its 896 experts per layer is activated. That changes the problem: the entire model does not need to be resident in RAM, as long as the weights required by each token can be reached quickly enough. We built WASTE — the Weight-Aware Streaming Tensor Engine — to explore that idea. WASTE keeps the dense, repeatedly used part of the model resident in memory, stores the routed experts in an…
Jul 2026
Ranked by how close each launch is in meaning, then by votes. Refine with a description →