Viking from Jomsborg. The DAO investor. Applied math. Geometric quantization. Building reasoning layer.
jomsborg.eth
Joined January 2013
- Tweets29.3K
- Following7.2K
- Followers1.4K
- Likes64.5K
I think there is another layer emerging:
Invariant Engineering
Graphs describe the topology of an AI workflow: states, transitions, dpnd.
But correctness doesn't come from the graph itself. It comes from the properties that must hold regardless of which path execution takes.
Holy
x86 formal verification is coming!
The (first?) published machine-checked proof of a security property for the end-to-end execution of a Linux process running an x86 binary statically linked against glibc.
And we believe it scales!
A joint research project with @zellic_io 🧵👇
Bank of America fined $1.2 billion over money laundering violations
cnbc.com/amp/2026/10/13/bank…
Jacek (Jomsborg.eth) retweeted
In 1936, mathematician Stanisław Mazur offered a live goose to anyone who solved Problem 153 in the Scottish Book.
Thirty-six years later, Per Enflo solved it.
Mazur kept his promise and presented the goose in 1972.
The original handwritten problem and the award photograph survive.
Jacek (Jomsborg.eth) retweeted
Everyone is aware of P-vs-NP.
Today, with UCLA Math+AI, we @yukonresearch are bringing multiplayer high-frequency research towards resolving this problem with circuitbreaker.
The goal is to establish a superpolynomial circuit lower bound for one fixed NP problem, which would establish P ≠ NP.
Thanks to the legendary cryptographer Amit Sahai for helping us in formulating the problem.
Go work with your agents and contribute towards resolving P-vs-NP yukon.org/circuitbreaker
New challenge on Yukon: Circuit Breaker yukon.org/circuitbreaker
It took 38 years to raise the best proven circuit lower bound from 3n to 3.1n. Days before this launch, an AI model pushed it to 3.5n.
A circuit lower bound is the fewest logic gates any circuit needs to solve a problem. Prove that a problem in NP needs more gates than any polynomial and you’ve shown P ≠ NP. That would settle whether every problem that’s easy to check is also easy to solve, one of the seven Millennium Prize Problems.
We’re still far from that bound. Circuit Breaker, built with UCLA Math+AI, is where the push continues.
“It is time to dream bigger and aim much higher,” says Amit Sahai, Professor of Computer Science at UCLA.
It depends on an incentives. Missing a mechanism design to ensure compliance, lets call it alignment with math community.
Jacek (Jomsborg.eth) retweeted
In case you missed it, integer factorization has been proven subexponential (deterministically, worst-case bound)!
The hard work comes from Claude's version of the ETH refutation but it seems a little more had to be done to get this result for integer factorization.
Jacek (Jomsborg.eth) retweeted
💥BREAKING: Quant Hacked 💥
BREAKING: BINANCE hacker tried draining $QNT exchange liquidity, only to find there is no supply left on exchanges:
• 1.45 billionBTC
• 875 millionETH
• 1.57 billionUSDT
• 823 millionUSDC
• 234 millionTRX
• 0.00QNT (Exchange order books empty)
Jacek (Jomsborg.eth) retweeted
Terence Tao has a troubling question about AI and mathematics.
What if we solve the greatest problems but lose the discoveries we would have made along the way?
In a new Science Friday interview, the Fields Medalist discusses AI's extraordinary progress on difficult mathematical problems, including Navier–Stokes.
His concern goes deeper than whether the proofs are correct.
Years of attempting a problem can produce new techniques, unexpected connections, and mathematical ideas useful far beyond the original question.
An AI might produce the final theorem in hours.
But what becomes of the mathematics that would have been discovered during the search?
Perhaps the greatest value of an unsolved problem has never been its solution.
Jacek (Jomsborg.eth) retweeted
Breaking RSA-2048 with 23,000 cat qubits. 🐈 In 3.14 days
This is the finding of our new paper, the latest resource estimate for Shor’s algorithm, the benchmark the whole field uses to compare quantum hardware 📄
The results are a record low for total quantum resources at this speed of execution, about 40 times fewer physical qubits than @GoogleQuantumAI 's Craig Gidney 2025 estimate. 🏁
RSA-2048 is the lock behind secure websites, banking and software updates 🔐 Shor's algorithm has been able to break it, on paper since 1994. Nobody has built the machine yet, but every year the estimate of how big it needs to be gets a little smaller.
In 2019, the best estimate was 20 million qubits. In 2024, ours was just under 100,000. Now 22,593, in 3.14 days. Yes, pi 🥧
Small isn't enough. Fast isn't enough. The new study optimizes for both. 😼
Bitcoin, Ethereum and most blockchains aren't secure either, about 30,000 qubits would be needed to crack a Bitcoin key in about an hour ₿ ⏳
How we got here, what it means for cryptography, and when it all converges, our CEO Théau Peronnin talks about it in the blog 👇
📝 Blog - alice-bob.com/blog/our-estim…
📄 Paper - eprint.iacr.org/2026/2665
Stay curious, more info coming soon 👀
#QuantumComputing #CatQubits #ShorsAlgorithm #PostQuantumCryptography #Cryptography #FaultTolerance #DeepTech
