P(doom) = 50%. It either happens, or it doesn’t.
Lao Mein | Statistics is Hard. | Patreon
I give full permission for anyone to post part or all of any of my comments/posts to other platforms, with attribution.
Currently doing solo work on glitch tokens and tokenizer analysis. Feel free to send me job/collaboration offers.
DM me interesting papers you would like to see analyzed. I also specialize in bioinformatics.
The arithmetic one involves two key operations: (-70 − 55) and −125%56. After that, all parentheses can be ignored? The first one never actually invokes the mod 20 rules, and you don’t actually need to calculate such problems all the way through in order to determine which action you take at every step—for example, a “even-ness” representation and a “how this step changes even-ness” representation are natural if Astra were in fact trained on arithmetic puzzles. Also, 8 being 2^3 allows 3 lines to be skipped.
In general, I think there are ways around the core “hardness” of these types of problems if you think really really hard. Perhaps the real takeaway is that Astra’s architecture is better at absorbing RLVR, and that it was RLVR’d on a lot of math puzzles in between googling “Kubernetes orchestration”?
I think it might be as simple as “Astra groks solving systems of linear equations in a single pass”, if we were to only base it off of the example in the appendix, although I have no idea how that would be possible. If I were paranoid, I might wave at non-existent context-compacting summarizer agents somehow doing parts of the work.
Also, I verified by hand that it didn’t cheat by using smaller-than-expected tokens (eg [12][34][56] instead of [123][456]).