Forisek and Jancina Primality Test - by Murage Kibicho

kept by sundarpatel sep 28

The Forisek & Jancina primality test provides a deterministic 512‑byte lookup‑table method to check primality of 32‑ and 64‑bit integers using a single strong probable‑prime test.

Learning more about Claude's mathematical capabilities \ Anthropic
An unreleased version of Claude improved the lower bound for the fraction of Riemann zeta zeros satisfying the Riemann hypothesis from 41.6% to 67.2% by combining prior mathematical research.
also on #number-theory
The Cypherpunk Library
The Cypherpunk Library offers a curated collection of public-domain readings on cryptography and privacy, free and available for browsing.
also on #cryptography
Turing Award Goes to Inventors of Quantum Cryptography - The New York Times
The Turing Award has been awarded to Charles Bennett and Gilles Brassard for their 1980s invention of quantum cryptography, an unbreakable encryption method.
also on #cryptography
ASCII characters are not pixels: a deep dive into ASCII rendering
A developer built an ASCII renderer that uses shape vectors and contrast enhancement to achieve sharp edges, overcoming blurriness from treating characters as pixels.
also on #algorithms
Punycode: My New Favorite Algorithm - Ian Duncan - Ian Duncan
Punycode uses adaptive bias adjustment, delta compression, and variable-length base-36 encoding to efficiently encode Unicode into ASCII for DNS without shared state.
also on #algorithms