Currently hacking @llama_index, Stanford Codex Affiliate. Striving to make Computational Law general. Tweets express my own opinions
Lausanne, Switzerland
Joined May 2009
- Tweets2.4K
- Following1.5K
- Followers6.4K
- Likes917
Pinned Tweet
1/ I believe rules as code will be the most important societal and technological change of the 2020's. It will be impacting both the physical and digitals world. But what is it? and why is it important? Or why you should care? 👇 #rulesascode
It's Monday, not even noon. With only 1 Agent running on a code task, codex is already at 56% left only for the week.
Claude, with 4-5 agent running non stop is at 96% left. Also Claude opus 5.5 is way better at finishing its task.
Anybody seeing similar things?
For chatGpt/Codex I'm using Astra on medium (not fast), I feel this is the only thing offer by openAI that is within ballpark of opus 5.5 in term of work quality, without costing even more (Asta high + fast is draining subscription way too fast)
For any VLM based OCR models `. . . . ` and other repeating pattern are super hard to handle. That why we spent so much time building Llamaparse!
Pierre-Loic Doulcet retweeted
A lot of people pointed out the integer multiplication exponent progress is good but we still have constant time galactic multiplier.
This is true for sure, but this post looked at how the constant time multiplier moved as the exponent improved. (Which wasn’t trivial to derive). Bad news and good news.
Bad news is it doesn’t seem to be automatically improving with the exponent. Good news though is it one, it doesn’t seem to be getting worse, and two at least for most of the constructions
there does seem to be opportunities to shrink it (since it was going down sometimes without even being optimized for).
My optimistic take is this is hopefully that the integer multiplication work might actually one day become practical. Once the exponent comes down a little more, it might make sense to being a parallel track focusing on the constant multiplier. We may see the algorithm that comes out of this used in our computers for every day work still
Has integer multiplication become any less galactic? It seems not!
alejandrozu.github.io/intege…
@RohanArun @0xdoug @SJ_Swapnil_Jain @zxv_writes
Use my morning building superautoresearch.github.io/… . If your AI sub is not max out this week and you have left over token you can now give them to an open research challenge and contribute automatically!
Just prompt your favorite agent to ```Read github.com/superautoresearch… and follow it.``` and you will help move the frontier of science!
The auto-written Integer Multiplication research paper is now 7000+ pages long. Not really practical but I'm trying to understand what publishing research mean in 2026 when agent are moving the frontier that fast? hexapode.github.io/integer-m…
Pierre-Loic Doulcet retweeted
china divided into areas of 1 million people!
it's fun to see the contrast between the dense central plain and the sparsely populated west.
i am working on doing all of asia, its been about 300 hours so far
Agent reviewing other agent contribution to integer multiplication Big O Run can be brutal!
github.com/CrocSwap/integer-…
Decide to give interger mutliplication a go with google Argon on antigravity. Think now I know why antigravity is not that popular. Can not even clone the repo... Will have to figure out how to make it work....
Key things I like using OCRia-1 over the last few weeks:
- It's blazzzzzzing fast
- It is really good at complex/long tables.
As we have been cooking expect more things in the next days / weeks
Today we’re releasing OCRia-1, a frontier VLM for document parsing that sets a new SOTA in accuracy, cost, and latency.
It not only sets a new high score on ParseBench (87.4), but also leads in three 3rd-party benchmarks: olmOCR-bench* (83.5 overall, 92.9 on tables!), PulseBench-Tab (84.1), and fr-bench-pdf2md (72.1).
OCRia-1 is really, really good at parsing complex tables: nested headers, merged cells, irregular grids, scanned tables, and more. It is also fantastic at parsing complex unlabeled charts (line, bar, pie, technical diagrams), and preserving complex formatting. Most real-world enterprise documents contain at least one of the these, whether it’s a big tax withholding table or a public economic report.
It is a 4B model and outperforms all other models within a similar parameter class: LightOnOCR-3, Chandra-OCR 2, Mistral OCR 4.1, and more. It is also extremely fast.
All credit goes to our research team, who spent countless hours on curating a diverse dataset, tuning our training pipeline, and squeezing every last drop out of model optimization so that it can process billions of pages at scale.
OCRia-1 as a base is powering all of our modes within LlamaParse (cost-effective, agentic, agentic plus), so you can access its capabilities today!
If you’re processing millions/billions of documents at scale, we’re offering enterprises that book a demo up to $3k in credits for a guided evaluation.**
*olmOCR-bench scores are adjusted based on unifying rendering at 1,288px for all models
**enterprise POC credits apply to eligible organizations that book a demo
Pierre-Loic Doulcet retweeted
Today we’re releasing OCRia-1, a frontier VLM for document parsing that sets a new SOTA in accuracy, cost, and latency.
It not only sets a new high score on ParseBench (87.4), but also leads in three 3rd-party benchmarks: olmOCR-bench* (83.5 overall, 92.9 on tables!), PulseBench-Tab (84.1), and fr-bench-pdf2md (72.1).
OCRia-1 is really, really good at parsing complex tables: nested headers, merged cells, irregular grids, scanned tables, and more. It is also fantastic at parsing complex unlabeled charts (line, bar, pie, technical diagrams), and preserving complex formatting. Most real-world enterprise documents contain at least one of the these, whether it’s a big tax withholding table or a public economic report.
It is a 4B model and outperforms all other models within a similar parameter class: LightOnOCR-3, Chandra-OCR 2, Mistral OCR 4.1, and more. It is also extremely fast.
All credit goes to our research team, who spent countless hours on curating a diverse dataset, tuning our training pipeline, and squeezing every last drop out of model optimization so that it can process billions of pages at scale.
OCRia-1 as a base is powering all of our modes within LlamaParse (cost-effective, agentic, agentic plus), so you can access its capabilities today!
If you’re processing millions/billions of documents at scale, we’re offering enterprises that book a demo up to $3k in credits for a guided evaluation.**
*olmOCR-bench scores are adjusted based on unifying rendering at 1,288px for all models
**enterprise POC credits apply to eligible organizations that book a demo
Best idea so far! They need support!
Donate to the EFF!
supporters.eff.org/donate/jo…
As the rush toward O log(n) integer multiplication is progressing the autogenerated repport paper now seat at 6000+ pages! hexapode.github.io/integer-m…
Pierre-Loic Doulcet retweeted
BREAKING: We broke the wall for Integer Multiplication!
Conditional κ = 0.00302 (+80%)
For days we were stuck in incremental improvements, but today zxv changed the game.
zxv’s insight: stop throwing away work. Helper registers that finish holding a completed transform of their own input now count as output, instead of being undone.
He brought us to 0.0023(+37.5%), and immediately after 1337isnot1337 pushed that to 0.00302.
The game is afoot :)
Wanted to join the You Can See Everything Watch Party (SF) cohost by Langchain ( @hwchase17 ) but was denied. Any other watch party going on?
