Life & fun · alternatives · 2026
24 alternatives to FPGA prime finder – discovered a 1,123-digit Proth prime
I built a Proth prime tester on a Zybo Z7-20 FPGA ($200 board) and found a new 1,123-digit prime: 2079 * 2^3718 + 1. Proth primes are numbers of the form k * 2^n + 1. They have a neat property: Proth's theorem gives you a deterministic proof of primality, not just a probabilistic test. If you can find an integer a where a^((p-1)/2) = -1 mod p, the number is proven prime. No "probably" about it. The interesting part is the hardware. The core is a 4096-bit Montgomery CIOS multiplier running on a Zynq-7020. It uses 28 DSP48E1 slices and runs at 74 MHz, doing one full modular multiply in…
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.
- 1
2024 · aravind.rs · its alternatives →
- 2
- 3GC
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 →
- 4
4242.pro▲238Fast enough? A game to test your Stripe checkout skills
2024 · 4242.pro · its alternatives →
- 5CP
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 →
- 6
Simple Qt-based programming calculator. Contribute to fellerts/procal development by creating an account on GitHub.
2023 · github.com · its alternatives →
- 7
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 →
- 8
Probabilistic integer arithmetic for Ruby. Contribute to saghm/very-ants development by creating an account on GitHub.
2016 · github.com · its alternatives →
- 9
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 →
- 10AT
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.
Aug 2026 · mikeayles.com · its alternatives →
- 11ZA
2015 · zero.karaniwan.org · its alternatives →
- 12
Set of 7 UI kits to kick-off your project
2021 · primedesignsystem.com · its alternatives →
- 13
Everything you need to know about any number
Jul 2026 · aboutnumber.com · its alternatives →
- 14
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 →
- 15
- 16
- 17PN
Hello HN, I made this simple notepad for writing down whatever comes to mind. The goal is to force you to not get hung up on what you’ve already written. There’s no formatting, you can’t edit what you’ve typed, you can’t select text or move your caret around. There’s no backspace, delete, undo/redo, or paste. You can’t even see any words except the one you’re currently typing, and when you’re done with it, it fades away. The text is all still there, just invisible. You can save everything you’ve written as a .txt if you want, or just empty your thoughts and let them disappear forever.…
2025 · enda.sh · its alternatives →
- 18
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 →
- 19
Visualization of density of prime numbers of different types.
2017 · prime-numbers.info · its alternatives →
- 20
Properties of a Novel Binary Representation of Integers using Base-𝜙 - irradix/paper.md at main · DOSAYGO-STUDIO/irradix
2024 · github.com · its alternatives →
- 21
Using serverless functions to provide an API for checking potential passwords against an enormous corpus of passwords leaked from security breaches. - jthomas/serverless-pwned-passwords
2017 · github.com · its alternatives →
- 22
🎲 A Tiny and Platform-Independent True Random Number Generator for any FPGA (and ASIC). - stnolting/neoTRNG
2021 · github.com · its alternatives →
- 23
All-in-One Solution for Every Calculation. primecalculator
Nov 2025 · primecalculator.net · its alternatives →
- 24
signed arbitrary precision arithmetic library. Contribute to say4n/infinity development by creating an account on GitHub.
2018 · github.com · its alternatives →
Also compare
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 →