Certified means an exact certificate and a second checker. Everything else is labelled. If a certified claim cannot be rebuilt from the repo, that is a bug.
We also showed that if part of a secret prime leaks, the first bits are worth more than the last bits.
If the two primes were generated sloppily so p−1 and q−1 share a large factor, there is a proven method that beats the 2021 record. Ordinary keys are not generated that way.
This is not the algorithm that factors RSA in the real world. That one is much faster.
It’s the fastest factoring method that comes with a proof. Under the rules that method uses: N^(1/3) cells, N^(1/5) with today’s packing, N^(1/6) even with perfect packing.
N^(1/6) needs a pattern in the start positions that isn’t there. 2048-bit N^(1/6) is still ~2^341. Not an exploit.
The estimate’s effort setting then reads 417 / 642 / 900 instead of 406 / 624 / 874.
A standard simulator, run to the end, gives the same three numbers. What’s new is the proof that nothing obeying the rule does better, and a certificate a second program re-checks.
Not a claim the new standard is safer or weaker.
The old estimate used a straight line. The line starts where no allowed shape can — 6% too short.
You shall not pass. Unless you change the rules. Then you shall.
A fast an effective framework, which helped me put a UI around a prototype agent driven ML paper to code tool I put together...
There is also clearly a deep semantic analysis taking place on the image content, such as understanding iconography and the contextual meaning of it for a given document
How does this multimodal capability appear to work? An interesting differential is the reported token length of the retrieved pdf document. In contrast, the underlying text represents around 12k tokens.
