Alternatives
Products that do what FPGA prime finder – discovered a 1,123-digit Proth prime does
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…
- 1PN
2024 · aravind.rs
- 2PA
2023 · github.com
- 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
- 4AN
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
- 5PN
2017 · prime-numbers.info
- 6AT
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
- 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
- 8IM
I've been studying interval arithmetic for the past few weeks and it's a really interesting field because while there is a ton of super interesting research published over the past decades, it has never really gotten the recognition that it deserves, IMO. One reason for this is that standard interval arithmetic has really poor handling of division by intervals containing zero. If you compute 1 / [-1, 2] in regular interval arithmetic, you get either [-∞, +∞], or you have to say that the operation is undefined. Both solutions are virtually useless. The real answer of course is [-∞, -1] U…
Apr 2026 · victorpoughon.github.io
- 9
- 10AN
2018 · github.com
- 11CP
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
- 12
- 13VP
2016 · github.com
- 14ZC
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
- 15ZA
2015 · zero.karaniwan.org
- 16AS
2018 · github.com
- 17FV
Feb 2026 · github.com
- 18EA
Hi HN, I made this small game in my spare time. It's quite addictive, I spent a lot of hours playing instead of polishing it. My own highscore is 96,792. Source code is at https://github.com/MikeBellika/tile-game. It's made with react, tailwind, and framer motion. Hope you enjoy!
2024 · bellika.dk
- 19BA
2020 · andrewsun.com
- 20PN
I was messing around representing integers using binary trees, and noticed that a certain tree format makes it trivial to grep for prime numbers. Probably not very novel, but thought y'all might enjoy it. Here's one through sixteen: * (()()) * ((()())()) * (((()())())()) (((()())())(()())) * ((((()())())())()) ((((()())())())(()())) * ((((()())())(()()))()) ((((()())())(()()))(()())) ((((()())())(()()))((()())())) ((((()())())(()()))(((()())())())) * (((((()())())())())()) (((((()())())())())(()())) * (((((()())())())(()()))()) (((((()())())())(()()))(()()))…
2018
- 21IB
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
- 22
- 23SA
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
- 24A2
I’ve been experimenting with structured logic as a way to frame search spaces — not in an academic way, just as a personal project. I wanted to know: what happens if you initialize a brute-force run with a simple equality like xy = x / y? Not as a filter, just as a logical ignition point. I used AES-256-CBC encrypted files with UUID passwords and tested against a 1 million UUID space. It cracked it in under 40 seconds. Then I scaled it to a 1 billion UUID range, and it still found the key without issue. This isn’t a crypto tool, and I’m not trying to solve any cryptographic problems.…
2025 · github.com
Ranked by how close each launch is in meaning, then by votes. Refine with a description →