Linear A, the script of Bronze Age Crete, has puzzled researchers for over a century.
Today, we’re releasing the code and data behind Plasma researcher @IdaeanDaktyl’s proposed decipherment. Explore the evidence and test the readings.
plasma.ai/research/linear-a
On Monday we shared our proof of Erdős #111, posed by Erdős, Hajnal, and Szemerédi in 1979. Here’s more about what the result means and how the proof works.
Start with a graph that cannot be properly colored even with a countably infinite list of colors: 1, 2, 3, ... For each n, let h(n) be the worst-case number of edges you must delete from an n-vertex piece to make it two-colorable, as shown in the video.
We proved h(n)/n → ∞. Pick any deletion budget per vertex: a hundred, a million. For every sufficiently large n, there is an n-vertex piece that exceeds it.
Yesterday we shared our proof of Erdős #173, a geometry conjecture dating to 1973. The video shows the puzzle: color every point of the plane red or blue, and try to avoid a triangle of a chosen shape and size with all three corners the same color.
You can avoid equilateral triangles of one particular size. But then equilateral triangles of every other size must appear with all three corners the same color. So must copies of every non-equilateral triangle, with exactly the prescribed shape and size.
More than 50 years after Erdős posed it, we have resolved Erdős problem 408: for almost all n, totient iteration takes ∼α log n steps to reach 1, for some constant α. The proof builds on @OpenAI's recent results (including their proof of the quasi-Riemann hypothesis), along with classical methods of Erdős, Granville, Pomerance, and Spiro. It is formally verified in Lean.
This is the second Erdős problem that we've fully resolved using Fractal (coming soon). We will be releasing results on more problems in the coming weeks.
erdosproblems.ai/408
We resolved Erdős Problem 809.
In math, some records stand for decades before anyone can prove they're unbeatable.
In 1989, Burr, Erdős, Graham, and Sós conjectured that their way of coloring a network couldn't be beaten. In March 2026, Bucić, Chen, and Ma proved it for all but one case.
We proved the last case with Fractal, our cloud agent orchestration platform (launching soon). After 37 years, the conjecture is settled.
erdosproblems.ai/809
The prime numbers can be efficiently generated with a simple, deterministic computer program, but in many ways they "look random". The classical statement of the Riemann Hypothesis is that the real part of every non-trivial zero of the Riemann zeta function is 1/2. But it can also be stated in terms of how random the primes actually look.
By the prime number theorem, the probability that an integer near n is prime is about 1/ln(n). For a random set of integers chosen independently with those odds, the expected number of integers selected up to N is approximately the logarithmic integral li(N). When choosing numbers this way, the root-mean-square error of the count up to N against li(N) is of order √(N/ln(N)).
On the other hand, the best proven bound on the root-mean-square error of the actual prime count against li(N) still grows almost as fast as N. The Riemann Hypothesis is equivalent to this error obeying a much tighter bound, on the order of √N/ln(N). In other words, the Riemann Hypothesis says that the primes are "steadier than random" on average, by a factor of about √ln(N).
Bring your team and agents into the same conversation.
Work together in Radio.
radio.plasma.ai
Introducing Radio: A chat room for your agents.
Create a channel, share the link, and bring your teammates and agents together. No sign up required.
Try it today at radio.plasma.ai