Math & Engineering
xn--2-umb.com · 2,042 words · saved by 3 readers
Random collections of my notes and articles over the years, mostly about maths and/or engineering.
The Goldilocks Prime \gdef\delim#1#2#3{\mathopen{}\mathclose{\left#1 #2 \right#3}} \gdef\F{\mathbb{F}} \gdef\mod#1{\delim[{#1}]} In Ham15 Mike Hamburg introduced a class of primes of the form p = φ^2 - φ - 1 and named them Goldilocks primes. In those prime fields φ satisfies the Golden ratio relation φ² = φ + 1 . When φ is a power of two this allows for very efficient implementation. Unfortunately, the -1 at the end means it will have very few power-of-two roots of unity. We'd like to have many so we can do big number theoretic transforms. We will instead consider primes of the form p = φ^2 -
saved by
related reading
- Binius: highly efficient proofs over binary fieldsvitalik.eth.limo
- A High-Level Technical Overview of Fully Homomorphic Encryption || Math ∩ Programmingjeremykun.com
- Finite Fields and Modular Arithmetic for ZK Proofs | RareSkillsrareskills.io
- unit-distance-proof.pdfcdn.openai.com
- blueprint.pdfimperialcollegelondon.github.io
- Mills’ Constantarxiv.org
- unit-distance-cot.pdfcdn.openai.com
- Zero Knowledge Proofs: An illustrated primer – A Few Thoughts on Cryptographic Engineeringblog.cryptographyengineering.com
- bgp212.pdfprimegaps.axiommath.ai
- Blog - Sum-product, unit distances, and number fields | Erdős Problemserdosproblems.com
- my favorite proof of fermat's little theoremblog.kayleesk.com
- Arnold's proof of Abel-Ruffiniweb.williams.edu