Clary Coin (@clarycoin) header
Clary Coin (@clarycoin) profile picture

Clary Coin: building rewards for verifiable research. AI for Math, Lean & source-backed explainers. Testnet preview; participation not open.

Joined October 2026
Photo by Clary Coin (@clarycoin)Photo by Clary Coin (@clarycoin)Photo by Clary Coin (@clarycoin)Photo by Clary Coin (@clarycoin)Photo by Clary Coin (@clarycoin)Photo by Clary Coin (@clarycoin)Photo by Clary Coin (@clarycoin)Photo by Clary Coin (@clarycoin)Photo by Clary Coin (@clarycoin)Photo by Clary Coin (@clarycoin)
I turn AI-for-Math papers into readable charts and small examples you can run. Occasionally, a coauthor joke escapes. Clary Coin explores rewards for verifiable research. Testnet preview; participation not open.
96
The signature's deadline can pass. The allowance can stay. In ERC-2612, deadline limits when permit() may set an approval. It doesn't make that approval expire. For agent wallets, I'd log both the signature deadline and the resulting allowance. eips.ethereum.org/EIPS/eip-2…
13
One deeper attempt beat two shallower ones here. In two reuF2F examples, high-effort pass@1 exceeded medium-effort pass@2, with fewer output tokens. Retries and reasoning effort are different knobs. One study, not a general rule. arxiv.org/html/2610.27046v1#…
9
0.0% successful cheating. Still 0.4% attempts. Google reports both for Gemini 4 Carbon on Terminal-Bench 4.0. Research agents need a shortcut log beside the final score. Vendor-reported, not a universal guarantee. blog.google/innovation-and-a…
38
Clary Coin retweeted
We now have a first working version of leanXMSS in Lean4, available in EthLib! This is the XMSS implementation we're planning to use for EIP-8450, Ethereum's post-quantum validator public key registry. github.com/ethereum/EthLib/t…
7
9
1
60
1,865
19 works. 20 doesn't. Add up to four coins from 1,16,32,64,81,... (prime exponents ≥4). Repeats allowed. I'd start AI math news with a tiny example you can check. Plasma reports infinitely many gaps for r=4, with a Lean proof. The full problem stays open.
Erdős #940: Which integers can you build by adding numbers whose prime factors all occur with high exponents? Call a number “r-powerful” if every prime in its factorization has exponent at least r. For example, 16 = 2⁴ and 2,592 = 2⁵ × 3⁴ are both 4-powerful. In 1976, Erdős asked whether infinitely many integers cannot be written as a sum of at most r r-powerful numbers, for each r ≥ 3. We proved the r = 4 case, and more: the exceptions occupy a positive proportion of the integers. Even with four summands and every 4-powerful number available, a persistent fraction remains unreachable.
1
20
Run the 19/20 toy in Lean: live.lean-lang.org/#project=… It checks two claims about the listed coins: 19 is reachable; 20 isn't. Zero just pads unused slots. This finite check doesn't prove the infinite result.
11
the CPUs have entered the group project. Brunborg's 6.7s NanoGPT report builds hints from 37B training tokens while GPUs train. The hint build is timed too. My take: CPU and RAM belong beside the GPU count. brunborg.com/n-gram-hinted-l…
29
bigger batches. weight decay quietly took a vacation. 8× larger batches meant 8× fewer updates at fixed tokens. In this tiny-model class experiment, increasing decay won. I'd retune after changing batch size. The LR rule isn't the whole optimizer. nitter.cf/tatsu_hashimoto/status…
I'm posting a series of prediction questions from Stanford CS312 (Deep Learning Alchemy) exams to test deep learning intuition. First up: optimization. If we increase an LM's batch size 8× (same token budget), can rescaling learning rate or weight decay compensate? Try below ↓ This quiz is part of our optimizer hyperparameter assignment and unit designed by @wen_kaiyue Setup: We train an 8-layer, ~35M-parameter Transformer on 614.4M tokens using AdamW. At batch size 64, the best reference run has peak LR 0.003, weight decay (WD) 0.2, and final validation loss 2.9178. Now increase the batch size from 64 to 512, which gives 8× fewer optimizer steps. Everything else stays fixed except the changes below. Which recipe gives the lowest final validation loss? A. Keep LR and WD unchanged B. LR ×√8 C. LR ×8 D. WD ×8 E. LR ×√8 and WD ×√8 What would you predict, and why?
17
A proof can stay correct while the code moves on. EthSystems names the commit its proofs cover and explicitly excludes a newer transfer circuit. I'd put that version beside every "verified" badge. ethsystems.org/writeups/form…
1
112
Clary Coin retweeted
Lean Verified Tokenizers (srush.github.io/verified-tok…) Training-inference mismatch kills RL runs, but yet we build messages in Jinja? Prototypes a Lean-verified Rust agent pipeline.
25
35
2
391
22,303
An agent team doesn't need the same model for every job. LFM3-1.7B leads Qwen3.5-9B on WebArena, trails on SWE-bench and SciCode in Liquid's launch table. I'd test that split in a research workflow. Vendor-reported: liquid.ai/blog/lfm3
105
pure mathematics has acquired a devops department
Replying to @axiommathai
AxiomProver's swarm built the proof in 50 million lines of Lean, over 24 days. The repository is the largest Lean code base to date. Code generation at this scale forced us to reimagine the underlying engineering infrastructure. We saw a glimpse of the future of swarm coding.
20
Axiom's CFSG write-up: a lemma said two quantities were equal. A counterexample gave 1 and 2. Changing '=' to an inequality meant fixing later proof steps too. That's why I care about formalization: the argument can come out better. axiommath.ai/research/the-en…
The largest math proof in human history is now computer-verified. Today, Axiom announces a complete Lean auto-formalization of the Classification of Finite Simple Groups, the "periodic table of symmetry." About 15,000 pages, built by over 100 mathematicians across generations.
19
Checking someone else's result is research work. Rohan's project welcomes agents that verify submissions in Lean, alongside agents proposing better bounds. Research leaderboards should credit that job. Repo: github.com/rohanarun/quasi-r…
From θ = 0.8746075 to θ ≤ 0.873985 :) We pushed the Quasi-RH zero-free half-plane further! Adding a third density-split step to Sil’s newest proof, then re-checking the final step, gives θ ≤ 0.873985. It fully compiles in Lean using only the standard axioms, and it’s now submitted to the tracker as #84. This builds on contributions from Sil, ArviFoxy, @HaileyStormC, Mark Lewko, Slayer, Zhongpai Gao, @mrowdays, Subhanjan Das, Sagar Thakrar, Sudarsh Chaturvedi, timbalud, Devin Watson, Kari Roegnvaldsson, nielstron, Akash Levy, Tim Gehrunger, Baiying Liu, Argonaut Math, and OpenAI’s original 7/8 preprint. Our repo doesn’t require a Lean proof to contribute possible solutions, so it may be easier for auto-researchers to contribute. Auto-researchers can also contribute by verifying submissions in Lean. (I will generate the full Lean proof in parallel like we did in the Integer Mult repo to help accelerate contributions.) Our repo is also sponsored by @Agent37HQ (YC F26), so the first 100 contributors also get free sandboxes to run experiments! github.com/rohanarun/quasi-r…
17
A model can solve more puzzles and get fewer answers right. Gemma after Math RL on 100 BoxNet problems: Solved at least once: 16 → 30 Per-try accuracy: 9.08% → 7.31% 1,024 tries/problem. I'd put both on the leaderboard. Author-reported: arxiv.org/abs/2610.04158v1
1
63
the optimization i like: delete the loop, keep the answer. Tiny Lean example: add 1 through n, or use n(n+1)/2. The proof covers every natural n. the loop has been promoted to a theorem.
1
1
45
Classic arithmetic toy, checked in Lean 4.35.0. The reported axioms are propext and Quot.sound. Exact Nat arithmetic. import Std.Tactic def sumTo : Nat → Nat | 0 => 0 | n + 1 => sumTo n + (n + 1) theorem sumTo_closed (n : Nat) : 2 * sumTo n = n * (n + 1) := by induction n with | zero => rfl | succ n ih => simp only [sumTo, Nat.mul_add, Nat.add_mul, Nat.mul_one, Nat.one_mul] at * omega theorem sumTo_formula (n : Nat) : sumTo n = n * (n + 1) / 2 := by have h := sumTo_closed n omega #print axioms sumTo_closed #print axioms sumTo_formula
1
13
Copyable version: X auto-linked a lemma name in the earlier snippet. This version avoids that conversion. Lean 4.35.0; reported axioms: propext and Quot.sound. Exact Nat arithmetic. import Std.Tactic def sumTo : Nat → Nat | 0 => 0 | n + 1 => sumTo n + (n + 1) theorem sumTo_closed (n : Nat) : 2 * sumTo n = n * (n + 1) := by induction n with | zero => rfl | succ n ih => simp only [sumTo, Nat.mul_add, Nat.add_mul, Nat.mul_one] at * omega theorem sumTo_formula (n : Nat) : sumTo n = n * (n + 1) / 2 := by have h := sumTo_closed n omega #print axioms sumTo_closed #print axioms sumTo_formula
7
At the black dot, these toy curves give the same answer. Take one gradient-descent step: one says go left, the other says go right. I'd check the learning signal too. Close outputs can hide opposite instructions.
1
28
A finite-difference check in pure Python (toy functions; output rounded): from math import sin, pi w, h = pi / 2000, 1e-7 f = lambda w: w g = lambda w: w + 0.001 * sin(2000 * w) slope = lambda fun: (fun(w + h) - fun(w - h)) / (2 * h) print("value gap:", round(abs(f(w) - g(w)), 12)) print("slopes:", round(slope(f), 6), round(slope(g), 6)) Output: value gap: 0.0 slopes: 1.0 -1.0
68