Petar Maymounkov retweeted
I'm super proud to unveil and open-source Project Thruput. Our mission is to eliminate all practical blockchain scaling limits to make smart contract execution free. thruput.network/ #Blockchain #smartcontracts #Stellar
I've been privileged to get to help build this with @dmazieres, @GeoffRamseyer, @chambaz and a small team of crazies at @StellarOrg who are daring to tackle the hard problems head on.
I'm super proud to unveil and open-source Project Thruput. Our mission is to eliminate all practical blockchain scaling limits to make smart contract execution free. thruput.network/ #Blockchain #smartcontracts #Stellar
Petar Maymounkov retweeted
I have been disappointed by blockchain
I wanted a new internet, a world computer
but I immediately hit friction. gas fees, layer 2s, compute limits
this is why I joined @StellarOrg Project Thruput
to make smart contracts free & compute abundant 🫡
thruput.network
Petar Maymounkov retweeted
We updated our Lattice Deduction Transformers paper, check it out: arxiv.org/abs/2605.08605
@liamjdavis146 will be presenting it at @NeurIPSConf. Come stop by our poster!
The updated version of the paper is available on arxiv, incorporating feedback from reviewers and @huskydogewoof. Thank you to everyone that helped improve the paper, which will be presented next month at @NeurIPSConf in Atlanta.
📄arxiv.org/abs/2605.08605
Petar Maymounkov retweeted
The Together Compiler (TKCC) from @simran_s_arora and her team is honestly one of the coolest things ever, and we have validated one of the InferenceX/AgentX results! The ability to continuously improve performance automatically while ensuring accuracy is great enough to quickly deploy to production!
Simran and her team are using TKCC and working on applying it to even more use cases. They will share more soon!
teapaw.org/simran_s_arora/status/…
Introducing the Together Compiler: continual compilation for AI inference! I’m super proud to finally share this work from our research team! ✨
Today’s inference is “Polymorphic” or shape-shifting, it doesn’t sit still. On OpenRouter, 80% of traffic goes to models released in the last three months and the top ten most popular open models each use a different architecture. Our customers constantly change their usage behaviors. Together Compiler leverages agents to continually optimize our deployments immediately as these changes occur.
Together Compiler research highlights include:
1. 252x better throughput: TKCC lets agents try 252x more optimization experiments per hour compared to prior agent inference optimization systems.
2. State-of-the-art TPS across InferenceX workloads we tried: TKCC outperforms the best InferenceX engine across all tested settings in just 24 hours & 2 nodes per compile. Including 1111 TPS on MiniMax M3.1 B200 and 1205 TPS on DeepSeek v4.1 Flash GB300 at batch size 1. NVIDIA, AMD, Trainium2.
3. Continuous recompilation: TKCC currently serves many trillions of production tokens per day and adapts to traffic shifts within just a few hours of recompilation.
4. Bitter lessons: TKCC’s design builds on 2+ years of building frameworks to accelerate AI Inference, starting from ThunderKittens and Megakernels. Compilers have always used abstractions and IRs, but we show that agentic compilers now reach higher performance ceilings without abstractions.
From an incredible team @reyna_abhyankar @dylan__lim @realDanFu @togethercompute!!
Petar Maymounkov retweeted
Most think vibecoding at scale is slop. Here’s a counterexample.
Today we release a 16M-line formalization of the entire Stacks Project, critical infra underlying modern math, with optimized code quality and its highly interconnected structure preserved.
A mathematical city 🌆
Petar Maymounkov retweeted
Finally open sourcing what I've been working on!
thruput.network
I'm super proud to unveil and open-source Project Thruput. Our mission is to eliminate all practical blockchain scaling limits to make smart contract execution free. thruput.network/ #Blockchain #smartcontracts #Stellar
Petar Maymounkov retweeted
👇
I'm super proud to unveil and open-source Project Thruput. Our mission is to eliminate all practical blockchain scaling limits to make smart contract execution free. thruput.network/ #Blockchain #smartcontracts #Stellar
It's a pride and pleasure to finally reveal what I've been working on with a world-class team: Project Thruput — the blockchain for abundance. No gas fees. No practical limit to scale. Open source. 7M txs/sec on day one. I can't wait to see what folks build on it: thruput.network
Petar Maymounkov retweeted
Only on Stellar
Janus Henderson and Centrifuge launch JQQQ, a fund that seeks to track the Nasdaq-100 and is issued natively onchain. It is available only on Stellar.
unchainedcrypto.com/janus-he…
Petar Maymounkov retweeted
Most of my followers have never met me, so let me introduce myself.
I got my math PhD from the University of Washington. I have three Masters degrees, about 20 papers, a few were published in math journals, most in ML conferences. I've worked in mathematical biology, scientific machine learning, numerical PDEs, sampling, diffusion models, formalization and lately AI. I've done four different Google internships. At the University of Washington I taught the first Lean class in the math department, back in 2024. I co-founded the UW Math AI Lab, where we have done lots of formalization, first by hand and nowadays with AI. I finished my PhD in June and joined Axiom Math to continue working on formalization. I am the creator and maintainer of Lean Pool, the largest maintained formalization library. My short term goal is to formalize ~all known math.
I live in the bay area. In my free time I like rock climbing, I'm proud to have done an outdoor V11! If you are in the bay area and would like to discuss formalization, math, or go climbing, DM me!
Petar Maymounkov retweeted
Here is a prompt to build a verified version of software X in Lean, prove correctness and optimize it to run faster than its original.
/goal Implement X in Lean. Get it to pass all the tests of X. Then state theorems that guarantee that your implementation is correct. Then prove them in Lean. Then pick a well-established benchmark or dataset, ensure your implementation works on it. Measure the speed baseline. Then aggressively optimize your implementation to run at least 10% faster than the fastest implementation of X, while passing the tests and proving the correctness guaranteeing theorems for each optimized version. This may take a long time and lots of ingenuity, don't stop until fully and honestly done. Put your work in a public Github repo. Include the proven theorems and a gif of plot showing the results of your optimizations over iterations, compared to competing implementations.
This workflow was inspired by @tqft's (Kim Morrison) lean-zip github.com/kim-em/lean-zip.
Here are two examples:
1. Implementation of algorithms factoring integers into primes: github.com/Vilin97/PrimeFact…
2. Implementation of jump processes in Lean, faster than Julia's: github.com/Vilin97/JumpProce….
Petar Maymounkov retweeted
Samsung open-sourced a method that shrinks 13B parameter LLM into less than 1 GB.
It's called "LittleBit"
Instead of storing AI weights as standard numbers, they used latent factorization to crush them down to extreme sub-1-bit levels.
In some configurations, they hit 0.1 bits per weight.
But here is where the architecture gets crazy.
When you compress an AI this much, you can stop doing math.
Instead of forcing the hardware to do heavy floating-point multiplication, LittleBit replaces the core computation with a bitwise XOR operation.
It swaps complex matrix math for basic sign flips.
The results rewrite the rules of model deployment:
• Unlocks a massive 11.6x inference speedup relative to standard FP16 models.
• Radically reduces memory footprint and loading bandwidth.
• Maintains robustness in extreme sub-0.5 bit regimes where previous compression methods catastrophically fail.
This is not a clever optimization.
It is the blueprint for running massive, state-of-the-art AI locally on cheap, resource-constrained devices.
Petar Maymounkov retweeted
Cool eval. Simply ask an LLM “Land or Water?” and give it a latitude and longitude coordinate as text. Ask 16,200 times, plot as image. The models know. From compressing the internet.
Petar Maymounkov retweeted
We'll be spending a lot more time trying to understand the outputs of language models. A few thoughts, tips & tricks:
Writing. Something I've had success with: Ask your LLM to explain something in ASD-STE100, it's a controlled language specification originally developed for aerospace maintenance documentation. LLMs well-versed in this language and it comes with heavy constraints on clean writing style that I often find a lot more readable. Sometimes I've tried to soften it a bit e.g. ask for "80% of the way to ASD-STE100" because the spec is quite stringent. But even better:
Diagrams / images. Instead of writing, ask your LLM to create a diagram. These can be a lot easier to process, parse, and understand. But even better:
Web pages. Ask for output "in HTML" to get a beautiful, interactive webpage. LLMs are getting really good at frontend and can create beautiful experiences, animations, etc. But even better:
Explainer videos. The output format I am most bullish on is fully custom / bespoke explainer videos generated on any arbitrary topic. Experiment with things like "Create a 3b1b style video explainer on X. Use my ElevenLabs API key for audio narration". (you'd need an API key for the latter or you can ask your LLM to find you decent free alternatives that use your local compute). This is actually starting to work!
In summary:
- As LLMs get better, they will do more and more of the legwork autonomously, and a lot more of our work will rise up the abstractions into oversight and understanding.
- Luckily, LLMs can help here too because as intelligence and code are increasingly abundant, you can ask for large, custom, discardable software artifacts (e.g. web apps, video explainers) that would have never made sense to create before. Push the boundaries here and you'll be surprised.
Petar Maymounkov retweeted
Wojtek made a cool skill for systematically applying Leslie Lamport's proof style. This is useful when you want to find issues in, for example, AI-generated proofs. It can also make formalization easier. It's one of my favourite tricks for writing proofs.
Following encouraging feedback, I decided to make my proof-auditing Codex plugin public. It revolves around a hierarchical way of writing proofs, called Lamport proofs, where one breaks each step down and justifies why it follows. This idea was introduced to me by @nasqret as a semi-formal way of verifying work that is not quite yet ready for formal verification in Lean. It has three skills:
1. $convert-lamport restructures a prose proof into a Lamport proof.
2. $forward-lamport audits a Lamport proof from assumptions to conclusion.
3. $reverse-lamport starts at the conclusion and traces back through what actually supports it. This one's my own little invention and my favorite of the three. It often catches gaps the forward direction can read right past.
I hope it will be useful both for professional mathematicians wanting another pair of careful eyes on their own work as well as amateurs who can use it before seeking feedback from professional mathematicians.
github.com/WWresearch/lampor…
Petar Maymounkov retweeted
I can't get enough of this family of illusions (not least because it took me so long to figure out how they work).
Petar Maymounkov retweeted
Unpopular opinion: The 3x+1 Conjecture might be False!
Here's why I think this may be the case. (thread)
My first paper, with Y. Sinai in 2002, arxiv.org/abs/math/0601622 proves that 3x+1 paths are a geometric Brownian motion (in a precise asymptotic sense), with drift log 3/4 < 0




























