Invitation to Crack Codes Using AI
Could you use AI to crack a cypher? For instance, predict the next bits in bitstreams produced by a high-quality PRNG (pseudo-random generator). Or correctly guessing the next bit in sub-sequences of 100,000 consecutive binary digits of π starting at arbitrary positions, with a success rate above 55%. Without knowing that the digits come from […]
Read More
NPG: New Random Generator, 3x Faster & Stronger than PCG64
The NumPy library in Python, and many other systems, relied on the Mersenne Twister PRNG (pseudo-random number generator) for a long time. It was slow and did not mimic randomness well enough, failing some statistical tests. In addition, it could be cracked, raising security issues. It was replaced recently by PCG64 which addresses some of […]
Read More
Mesmerizing Video that will Make you Love Math, Engineering, and Probability
Featuring the roots of various polynomials whose coefficients are the binary digits of numbers like π. Complex roots cluster around the circle, and the few real ones are on the horizontal X-axis (positive on the right, negative on the left). Download the free paper to see how to interpret the colors and get the […]
Read More
How Random are the Digits of π? State of the Art & Free Book on the Topic
Over the last 10 years, I spent a lot of time analyzing the digits of the classic math constants such as π, e, log 2, √2 and so on. Not testing them for randomness but trying to formally prove that they are undistinguishable from random bit streams. And trying to identify which constants are the […]
Read More
Pi Day in the age of AI — The Missing $1m Millenium Prize
Pi Day is celebrated every year on 3/14. Enjoy and share the video I created with our “Pi Day AI agent” at BondingAI, generating hundreds of webpages, turning each one in a screenshot (a frame in the video). All done in Python with source code available here. The video is also on YouTube, here. For […]
Read More
Checking for Randomness: Replacing Test Batteries with a Single Test
In cybersecurity applications where replicability is critical, or when building pseudo-random number generators, it is typical to perform a large number of various tests to check if a sequence of bits is random enough for practical purposes. This is also true in scientific research, to assess whether or not the digits of π or other […]
Read More
Spectacular New Discovery about the Digits of π
Everyone believes that the digits of constants such as π or √2 cannot be distinguished from a sequence of random bits. The first few trillion successfully pass all tests of randomness. However, proving that they indeed behave perfectly randomly is arguably one of the oldest and most difficult unsolved math conjectures. So far, nobody succeeded […]
Read More
New Book: Breakthroughs on the Digit Distribution of Classic Constants
Since the first edition entitled “0 and 1 — From Elemental Math to Quantum AI” and released in early 2025, a lot of progress has been made. Fascinating new results have been uncovered and proved by the author, many still leading to interesting quantum dynamics. In 100 pages, the new material presented here goes far […]
Read More
Short Introduction to Signal Processing and Convolution
In less than 3 pages, this tutorial covers signal processing and convolution quite thoroughly, even advanced concepts. I illustrate the techniques with the Riemann zeta function and the kernel method, along with short, home-made Python code that shows all the detailed steps, rather than based on Blackbox Python libraries. The document looks like a cheat […]
Read More
Simple Normality Test with Application to Random Number Generation
Numbers such as π, e, log 2 or √2 have binary digits (bits) that look randomly distributed. They are very good candidates to generate randomness especially in cryptography. One way to assess their randomness is by proving that they are normal numbers. Such a proof has remained elusive for centuries. Here I focus on a […]
Read More
You must be logged in to post a comment.