Dev tools · alternatives · 2026
24 alternatives to Goldbach Conjecture up to 4*10^18+7*10^13
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]…
Gridbach is a cloud-based distributed computing system that verifies the Goldbach Conjecture using grid computing. Accessible from any PC or smartphone without login or app installation, it downloads high-performance… Below are 24 products that do a similar job, ranked by how close each is in meaning and then by launch-day votes.
- 1
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 →
- 2
A pipeline that translates Rust GPU code into formal Coq models, as a foundation for memory model proofs - neelsomani/vericuda
2025 · github.com · its alternatives →
- 3
I made a chess engine today, and made it fit within 2KB. I used a variant of MinMax called Negamax, with alpha beta pruning. For the board representation I have used a 120-cell "mailbox". I managed to squeeze in checkmate/stalemate in there, after trimming out some edge cases. I am a great fan of demoscene (computer art subculture) since middle school, and hence it was a ritual i had to perform. For estimating the Elo, I measured 240 automated games against Stockfish Elo levels (1320 to 1600) under fixed depth-5 and some constrained rules, using equal color distribution. Then converted…
Feb 2026 · github.com · its alternatives →
- 4
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 →
- 5
A totally proof-of-concept FoundationDB based network block device backend - dividuum/fdb-nbd
2018 · github.com · its alternatives →
- 6
A Fully Homomorphic Encryption Brainfuck virtual machine - f-prime/arcanevm
2019 · github.com · its alternatives →
- 7
To my knowledge, this is the first formally verified implementation of an intersection algorithm for polygons. The experience of working with AI agents on this project changed a lot with recent model releases, as I describe in the readme. Opus 4.8 is able to provide algorithm implementation with formal proof in one shot, whereas previous models required me to provide proof strategies in multiple steps. Trust in the correctness comes entirely from the Lean checker and human review of a small specification, not from the LLM. Also check out the web demo built around the verified core linked in…
Jun 2026 · github.com · its alternatives →
- 8
I created a web page to compare different analytical databases (both self-managed and services, open-source and proprietary) on a realistic dataset. It contains 20+ databases, each with installation and data loading scripts. And they can be compared to each other on a set of 43 queries, by data load time or by storage size. There are switches to select different types of databases for comparison - for example, only MySQL compatible or PostgreSQL compatible. If you play with the switches, many interesting details will be uncovered. Full description:…
2022 · benchmark.clickhouse.com · its alternatives →
- 9
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 · its alternatives →
- 10
The core question: how did HP's scientific calculators actually work at the gate level? That rabbit hole led to building one from scratch. The architectural decision everything else follows from: a decimal calculator should store numbers as BCD — one decimal digit per 4-bit nibble. A standard byte-oriented CPU (Z80, 6502) fights that layout constantly. So I designed a small custom CPU in Verilog where 4 bits is the natural data width and memory is nibble addressable. What the project covers: - Custom CPU: Harvard architecture, 12-bit ISA, 8-state execution FSM, hardware stack guard with a…
May 2026 · 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 →
- 12LN
I was reviewing Dirac's Large Numbers Hypothesis (https://en.wikipedia.org/wiki/Dirac_large_numbers_hypothesis) and decided to give it a second go, now with measurements of fundamental constants more precise than 100 years ago. And I stumbled upon a value for Hubble's constant that's uncannily close. Here are the full calculations. https://colab.research.google.com/drive/1K1qoUFvqZp1fWbpcKJWq63nflgwS0ZHh?usp=sharing Meaningless, or meaningful coincidence?
2021 · its alternatives →
- 13IA
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 →
- 14TK
I analyzed two orderings of the 64 I Ching hexagrams and found the permutation cycle decomposition between them is [52, 10, 2] with zero fixed points. Nobody has done this kind of analysis before and this cycle type has not been reported in the literature. You can verify it yourself.
Mar 2026 · gzw1987-bit.github.io · its alternatives →
- 15
We were genuinely impressed by Yann LeCun’s recent announcement about his Sudoku solver based on Energy-Based Models here: https://logicalintelligence.com/yann-lecun So we (a software engineer and prodigy mathematician) worked in the weekend to see if we can beat it and we did! If Kona solves puzzles in 313 milliseconds, we currently solve 270,000 puzzles per second! We do not know the internal mechanics behind Logical Intelligence’s system, but we are happy to share ours in the webpage there is a full description, code and also a paper published. Why people are obsessed with…
Feb 2026 · davisgeometric.com · its alternatives →
- 16
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…
2025 · github.com · its alternatives →
- 17
After five weeks of nearly non-stop computation, a new record for the computation of the value has been set: 500 billion digits of precision computed with Alexander Yee’s y-cruncher. This is the Gamma function, which when evaluated with the input , results in Motivation There isn’t a pra
2020 · andrewsun.com · its alternatives →
- 18
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 →
- 19HA
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 · its alternatives →
- 20SA
Hey HN, I’m a physicist turned quant. Some friends and I 'built' SymDerive because we wanted a symbolic math library that was "Agent-Native" by design, but still a practical tool for humans. It boils down to two main goals: 1. Agent Reliability: I’ve found that AI agents write much more reliable code when they stick to stateless, functional pipelines (Lisp-style). It keeps them from hallucinating state changes or getting lost in long procedural scripts. I wanted a library that enforces that "Input -> Transform -> Output" flow by default. 2. Easing the transition to Python: For many…
Feb 2026 · its alternatives →
- 21
pvac-hfhe: PoC for publicly verifiable arithmetic computations with hypergraph based homomorphic encryption over Fp (p = 2^127 - 1), omissions for large numbers and excluded the transfer mechanism for data convertation (applies only to the prod version of octra network). c++17 header-only. - GitHub
Dec 2025 · github.com · its alternatives →
- 22
Sharing my project inspired by twitter snowflake UUID generator but that supports: 1) Longer range of id's to be generated. 2) No coordination with other machines in the distributed system.
2022 · github.com · its alternatives →
- 23
The model uses a 1024-dimensional complex Hilbert space with 32 layers of programmable Mach–Zehnder meshes (Reck architecture) and derives token probabilities directly via the Born rule. Despite using only unitary operations and no attention mechanism, a 1024×32 model achieves coherent TinyStories generation after < 1.8 hours of training on a single consumer GPU. This is Part 1 - the next step is physical implementation with $50 of optics from AliExpress.
Nov 2025 · zenodo.org · its alternatives →
- 24DB
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 →
Also compare
- filippo.io/mlkem768 – Post-Quantum Cryptography for the Go Ecosystem alternatives
- Cuq – Formal Verification of Rust GPU Kernels alternatives
- Sameshi – a ~1200 Elo chess engine that fits within 2KB alternatives
- zkGolf – Competitive optimization of formally verified circuits alternatives
- A proof-of-concept FoundationDB based network block device backend alternatives
- ArcaneVM – A Fully Homomorphic Encryption Brainfuck Virtual Machine 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 →