Project Templates출처: Show HN조회수 6
Show HN: FPGA prime finder – discovered a 1,123-digit Proth prime
By sickthecat2026년 2월 21일
**Show HN: 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...
---
**[devsupporter 해설]**
이 기사는 Show HN에서 제공하는 최신 개발 동향입니다. 관련 도구나 기술에 대해 더 알아보시려면 원본 링크를 참고하세요.
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...
---
**[devsupporter 해설]**
이 기사는 Show HN에서 제공하는 최신 개발 동향입니다. 관련 도구나 기술에 대해 더 알아보시려면 원본 링크를 참고하세요.