There are subexponential algorithms for integer factorization, e.g., the general number field sieve and Lenstra’s ECM.
7,409 karma · joined November 25, 2012
There are subexponential algorithms for integer factorization, e.g., the general number field sieve and Lenstra’s ECM.
Annoyingly, this is a concrete argument that open source software may be easier to attack.
> "Knowledge transfer. Agents can actively generate on-demand explanations, architectural summaries, and updated documentation at merge time, which is a more reliable and scalable mechanism for propagating knowledge than the incidental commentary of a busy colleague.
Knowledge transfer is much more than what they claim. An critical goal of code review is making sure humans do deeply understand overall what software actually does. Code is far more precise and detailed than any "on-demand explanations, architectural summaries, and updated documentation."
[1] https://jointmathematicsmeetings.org/meetings/national/jmm20...
For what it is worth, in my experience one of the most important skills one should strive to get much better at to be good at using coding agents is reading and understanding code.
The context for every single turn could in theory be nearly 1MB. Since this context is being stored in the repo and constantly changing, after a thousand turns, won't it make just doing a "git checkout" start to be really heavy?
For example, codex-cli stores every single context for a given session in a jsonl file (in .codex). I've easily got that file to hit 4 GB in size, just working for a few days; amusingly, codex-cli would then take many GB of RAM at startup. I ended up writing a script that trims the jsonl history automatically periodically. The latest codex-cli has an optional sqlite store for context state.
My guess is that by "context", Checkpoints doesn't actually mean the contents of the context window, but just distilled reasoning traces, which are more manageable... but still can be pretty large.
I also was annoyed by Theo saying that.