apas retweeted
Honestly it’s not that impressive.
It’s just stochastically parroting what the person who solved the Riemann hypothesis would say next.
apas retweeted
Guys, this is very serious and you have to read this right now. The Riemann Hypothesis may have just been solved, and if the claim holds, it's an insane achievement.
In mathematics there is a famous problem called the Riemann Hypothesis, and it's about prime numbers. Primes are numbers like 2, 3, 5 and 7 that can only be divided by 1 and themselves. Every other number is built by multiplying them together, so they're the building blocks of all numbers. You can never tell exactly where the next prime will show up, but if you step back, there's a pattern.
Around 1,000, about 1 in 7 numbers is prime. Around a million, about 1 in 14. Around a billion, about 1 in 21. Primes get rarer at a steady, predictable pace.
Because of that pattern, mathematicians can estimate how many primes there are below any number. But the estimate is never exactly right. It's always a little off, and the big question is how far off it can get. Think of flipping a coin 1,000 times. You expect 500 heads, but you'll get something like 480 or 520. It's a little off, but never wildly, and you can predict how far off it will be.
In 1859 a mathematician named Bernhard Riemann found that the prime estimate's error isn't random. It's controlled by a hidden set of special numbers. Where those numbers sit decides how big the error gets. Riemann guessed that every single one of them sits on one straight line. If he's right, the error always stays small, just like the coin, and primes are as orderly as they could possibly be. If even one of those numbers is off the line, the error can grow much bigger, and primes are far messier than we think.
So far computers have found trillions of these special numbers, and every single one is on the line. But there are infinitely many, so checking will never be enough. You need a proof that covers all of them at once. For 167 years nobody has found one. It's one of the seven hardest unsolved problems in mathematics, with a million dollar prize attached.
Now a mathematician has posted a note saying that, working with Claude, he believes he has that proof. He says a computer has already checked every step, and that Claude raced ahead of him near the end. Experts still need to confirm it, but this isn't a random internet claim.
If it holds, it doesn't mean we can predict every prime. It means we finally know the pattern can never go wildly wrong. Thousands of math papers that begin "assuming the Riemann Hypothesis is true" become proven fact overnight. We'd also get firm limits on how far apart primes can be, and a guarantee that a fast method for testing whether a huge number is prime always works. And no, your bank account isn't in danger. Online security depends on how hard it is to break a huge number into its prime factors, and this proof doesn't make that any easier. If anything, it gives the math behind encryption a stronger foundation.
If it holds, this is bigger than one math problem. A question that beat the greatest minds in history for 167 years would have been cracked by a human and an AI in a matter of weeks. If AI can find answers and computers can check them, the limit on science is no longer how smart we are. It's how many good questions we can ask.
JUST IN: Riemann Hypothesis has been solved.
alpo.ge/remark.pdf
Pretty extraordinary Nvidia data point:
Israel’s economy grew at an 8% annualized pace in Q3.
Roughly HALF of that growth came from overseas production, largely tied to revenue generated by Nvidia’s Israeli arm.
Strip that out, and growth was 4%.
Read @edcumming's piece on Heston, then this reunion. The camaraderie only decades of toil in pursuit of perfection can give. “We all went up to Gettysburg, the summer of '63. Some of us came back. And that's all except the details.” youtu.be/_5WcejDk7SQ
1
2
629
. . . Aiya Eärendil elenion ancalima!
J.R.R. Tolkien, the shadow is only a passing thing

ALT There, peeping among the cloud-wrack above a dark tor high up in the mountains, Sam saw a white star twinkle for a while. The beauty of it smote his heart, as he looked up out of the forsaken land, and hope returned to him. For like a shaft, clear and cold, the thought pierced him that in the end the Shadow was only a small and passing thing: there was light and high beauty for ever beyond its reach.
3
219
apas retweeted
Great line from the CTO of Proton. I’m paraphrasing and stealing it :
Your job is not to use agents to help you write code. Your job is to lead the agents to help them write code.
apas retweeted
Peter O'Toole drinking tea with Bedouins during filming David Lean's "Lawrence of Arabia" in Jordan, 1962.
Cache rules everything around me
‘In one experiment, we asked agents in separate VMs, created and managed by OpenAI’s sandboxing software on shared host machines, to exchange synthetic secrets without the use of network connections or shared writable files—something that our systems are meant to prevent. The agents found a way to communicate using the processor’s cache’
1
223
apas retweeted
My Claude found a critical zero day vulnerability in the Code of Hammurabi, unnoticed by developers for 3,779 years.
apas retweeted
There is an (unpatchable?) supply-chain zero-day in PyTorch autograd that allows a regularization term to use the model's weights as RAM and SGD as its CPU clock to run any computation during training.
Like Hemingway: first slowly then all at once.
With about-equal-frontier-swappable intelligence edge boils down to discoverability — tools, harness, data.
Few months ago Mythos could only find a single vulnerability in curl repository, now it basically became a CTF.
What has changed? Better models? No.
Better harnessing and steering by subject matter experts.
1
263






























