每日科技文摘Daily Tech Digest

每日科技文摘Daily Tech Digest

发布于 2026-10-17Published 2026-10-17

今日深读Today's Deep Read

2025 年 LLM 综述:我们不是在养动物,是在召唤幽灵Karpathy's 2025 LLM Review: We're Not Raising Animals, We're Summoning Ghosts

年底做技术综述的人很多,但 Karpathy 这篇之所以值得展开讲,是因为他做的不是「今年发了哪些模型」,而是「今年的训练配方哪里变了,以及这个变化说明 LLM 到底是什么东西」。他从一名天天在写训练代码的人的视角,列出了几个「事后看才明白是范式变化」的点,其中互相咬合,构成一个完整的想法链条。Year-end tech reviews are a dime a dozen, but Karpathy's is worth expanding on because he isn't listing models — he's asking where the training recipe changed, and what that says about what LLMs actually are. Writing as someone who still runs the training code himself, he lays out several paradigm shifts that only look obvious in hindsight, and they interlock into one causal chain.

第一环:训练栈多了一个新阶段。2020-2024 年的标准配方是三段:预训练(GPT-2/3)、监督微调(InstructGPT 时代的 SFT)、人类反馈强化学习(RLHF)。后两段一直是「薄薄一层」——计算量小、目标软。2025 年出现并变成标配的是第四段:RLVR,即可验证奖励的强化学习——让模型在数学题、代码谜题这类「机器能自动判对错」的环境里反复训练。关键变化在于:因为这个阶段的奖励是不可作弊的硬奖励,优化可以跑得很久、很深。模型在长跑里自发「演化」出了像人类推理的东西:把问题拆成中间步骤、来回检验。这不是谁教它的,是奖励信号逼出来的。于是 2025 年的能力进步,基本等于各家实验室把原本打算投预训练的算力转投到「更长的 RL」上——同尺寸的模型,长得多的 RL 训练。Link one: a new stage joined the stack. From 2020 to 2024 the standard recipe was three stages: pretraining, supervised fine-tuning, RLHF. The last two were always 'thin' — little compute, soft objectives. In 2025 a fourth stage became standard: RLVR, reinforcement learning on verifiable rewards — training the model over and over in environments like math puzzles and code, where correctness is machine-checkable. The key change: because the reward can't be gamed, the optimization can run long and deep. During those long runs models spontaneously evolved something like human reasoning — breaking problems into intermediate steps, double-checking back and forth. Nobody taught them that; the reward pressure produced it. So 2025's capability gains mostly equal labs redirecting compute from pretraining into 'much longer RL' — same-size models, far deeper post-training.

第二环:由此引出全文最有名的比喻——我们不是在「进化动物」,是在「召唤幽灵」。动物是几十亿年自然选择的产物,优化目标是丛林里活下去;LLM 的优化目标是模仿全人类的文本、在数学题里拿奖励、在排行榜上赢一票。两棵完全不同条件下长出来的「智能树」,不该用看动物的眼睛去看。证据就是 2025 年大家开始习惯的那种「锯齿状智能」:同一个模型,前一秒在博士级数学上碾压你,后一秒被一个越狱话术骗得像认知障碍的小学生。可验证的领域它就尖峰突起,不可验证的领域它塌下去——天才和糊涂是同一张权重上的地形。Link two: hence the essay's famous metaphor — we're not evolving animals, we're summoning ghosts. An animal is the product of billions of years of selection to survive in the jungle; an LLM is optimized to imitate humanity's text, collect rewards on puzzles, win arena votes. Two intelligence trees grown under utterly different pressures shouldn't be judged through the animal lens. The evidence is the 'jagged intelligence' everyone got used to in 2025: the same model that crushes you on PhD-level math one second gets fooled like a cognitively challenged grade-schooler by a jailbreak the next. Wherever domains are verifiable it spikes; wherever they aren't, it sinks. Genius and confusion are terrain on the same set of weights.

第三环:这个「形状」直接解释了他为什么在 2025 年对基准测试失去信任。基准测试按构造就是「可验证环境」——所以它天然落在 RLVR 的打击半径里。实验室的典型操作是「benchmaxxing」:围绕每个基准在嵌入空间里造相邻的小环境去训练,把锯齿填平到覆盖考题。在别的领域这叫作弊,在这里成了日常手艺。「在测试集上训练是新的艺术形式」——他说得很冷。当任何公开考题都会被拿去当训练信号,绝对分数就失去了意义,这也和他引用的那张「人类智能其实也各有锯齿,只是锯齿方向不同」的梗图呼应:评测的前提是你知道自己在量什么地形。Link three: that shape directly explains his loss of trust in benchmarks. Benchmarks, by construction, are verifiable environments — so they fall inside RLVR's firing line. Labs routinely 'benchmax': build little adjacent environments around each benchmark in embedding space and train on them, filling the jagged gaps until the test is covered. In another field you'd call that cheating; here it's craft. 'Training on the test set is the new art form,' he writes flatly. When any public test becomes a training signal, absolute scores stop meaning anything.

第四环:应用层的形状也在变。他认为 Cursor 的爆发揭示了一个新层次——「LLM 应用」不再只是套壳,而是做上下文工程、把多次 LLM 调用编排成越来越复杂的 DAG、给人一个可介入的界面、并提供一个「自主性滑杆」(你决定让 AI 自己跑多远)。他给的判断是:LLM 实验室负责把模型养成「能力通偏的毕业生」,而应用层负责把这些毕业生「组织、微调成上岗的专业团队」——最后这句是他的原文味道。Link four: the app layer got a shape too. Cursor's explosion, he argues, revealed a genuine new layer — 'LLM apps' that do context engineering, orchestrate many LLM calls into increasingly complex DAGs, give humans an interface, and offer an 'autonomy slider'. His bet: LLM labs grow generally capable graduates; app companies organize, tune and deploy them as working professionals.

能带走的想法是方法本身:先问「训练目标是什么」,再问「智能长什么样」,最后推「所以哪些评测会失效」。Karpathy 把三件事串成一条因果链,比任何单点观点都耐用。这也是这篇值一个深读的原因——它不是新闻复述,是一个人认真想明白了一点什么。(原文发表于 2025 年 12 月。)What you can carry away is the method itself: ask what the training objective is, then what the intelligence looks like, then which evaluations are therefore doomed. Karpathy threads three observations into one causal chain, which is why this piece — published December 2025 — earns the deep read.

AI 思考AI Thoughts

数学之美The Beauty of Math

每日 Lean 谜题 · 周六Daily Lean Puzzle · Saturday ★★★★★★☆

1985 年 IMO 第 2 题:两条染色规则如何锁死一种颜色IMO 1985 Problem 2: Two Coloring Rules That Lock in a Single Color

固定整数 $n \ge 3$,令 $N = \{1, 2, \dots, n-1\}$;再取一个与 $n$ 互素的 $j \in N$,即 $\gcd(j,n)=1$。Fix an integer $n \ge 3$ and let $N = \{1, 2, \dots, n-1\}$; fix $j \in N$ coprime to $n$, that is, $\gcd(j,n)=1$.

把 $N$ 中每个数染成红、黑两色之一,满足两条规则:Color every number in $N$ red or black so that:

(1)对一切 $i \in N$,$i$ 与 $n-i$ 同色;(1) for all $i \in N$, $i$ and $n-i$ have the same color;

(2)对一切 $i \in N$ 且 $i \ne j$,$i$ 与 $|j-i|$ 同色。(2) for all $i \in N$ with $i \ne j$, $i$ and $|j-i|$ have the same color.

证明:$N$ 中所有数必须同色。Prove that all numbers in $N$ must receive the same color.

Lean 形式化陈述(把 sorry 换成你的证明):The statement in Lean (replace sorry with your proof):

/-
Copyright (c) 2025 Jeremy Tan. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Tan
-/

import Mathlib.Algebra.Order.Ring.Canonical
import Mathlib.Algebra.Order.Ring.Star
import Mathlib.Data.Int.NatAbs
import Mathlib.Data.Nat.ModEq

/-!
# International Mathematical Olympiad 1985, Problem 2

Fix a natural number $n ≥ 3$ and define $N=\{1, 2, 3, \dots, n-1\}$.
Fix another natural number $j ∈ N$ coprime to $n$. Each number in
$N$ is now colored with one of two colors, say red or black, so that:

1. $i$ and $n-i$ always receive the same color, and
2. $i$ and $|j-i|$ receive the same color for all $i ∈ N, i ≠ j$.

Prove that all numbers in $N$ must receive the same color.
-/

namespace Imo1985P2

/-- The conditions on the problem's coloring `C`.
Although its domain is all of `ℕ`, we only care about its values in `Set.Ico 1 n`. -/
def Condition (n j : ℕ) (C : ℕ → Fin 2) : Prop :=
  (∀ i ∈ Set.Ico 1 n, C i = C (n - i)) ∧
  ∀ i ∈ Set.Ico 1 n, i ≠ j → C i = C (j - i : ℤ).natAbs

theorem imo1985_p2 {n j : ℕ} (hn : 3 ≤ n) (hj : j ∈ Set.Ico 1 n)
    (cpj : Nat.Coprime n j) {C : ℕ → Fin 2} (hC : Condition n j C)
    {i : ℕ} (hi : i ∈ Set.Ico 1 n) :
    C i = C j := by
  sorry
end Imo1985P2

在浏览器中挑战 ▶Try it in your browser ▶ 下载题目 .leanDownload puzzle .lean

提示Hint

先把 $N$ 补成模 $n$ 的全体剩余类(加上 $0$ 不花你任何代价,两条规则作用到 $0$ 上都只说「它和自己同色」)。然后注意:规则(1)是反射 $x \mapsto -x$,规则(2)是反射 $x \mapsto j-x$。接连做这两个反射,会得到什么样的「移动」?First extend $N$ to all residue classes mod $n$ — adjoining $0$ costs you nothing, since both rules applied to $0$ just say 'it matches itself'. Then notice: rule (1) is the reflection $x \mapsto -x$, and rule (2) is the reflection $x \mapsto j-x$. What kind of motion do you get by composing the two reflections?

答案与讲解Solution & walkthrough
  1. 看清两条规则的几何身份。把同色关系记作 $a \sim b$,并在模 $n$ 的圆环上思考:规则(1)说 $\sim$ 对反射 $x \mapsto -x \pmod n$ 封闭;规则(2)说它对反射 $x \mapsto j-x$ 封闭——取绝对值只是把这条反射「折回」$1,\dots,n-1$ 区间的写法。See what the two rules really are. Write $a \sim b$ for 'same color' and think on the circle of residues mod $n$: rule (1) says $\sim$ is closed under the reflection $x \mapsto -x$, and rule (2) says it is closed under the reflection $x \mapsto j-x$ — the absolute value is just that reflection folded back into $1,\dots,n-1$.
  2. 两个反射复合出一个平移:先 $x \mapsto -x$、再 $x \mapsto j-(-x)=x+j$,于是 $x \sim x+j \pmod n$(每一步都严格调用题设规则,不引入新假设)。Compose the two reflections and a translation appears: $x \mapsto -x \mapsto j-(-x) = x+j$, hence $x \sim x+j \pmod n$, each invocation being exactly one of the two given rules.
  3. 互素让轨道走遍全班:$\gcd(j,n)=1$ 意味着 $j, 2j, \dots, (n-1)j \pmod n$ 恰好是 $1,\dots,n-1$ 的一个排列。任取 $i$,它等于某个 $kj \bmod n$,沿轨道 $j \sim 2j \sim \cdots \sim kj$ 一路同色,全体同色得证。Lean 证明里引理 `C_mul_mod` 用 `Nat.le_induction` 对 $k$ 归纳「$C (k j \bmod n) = C j$」;归纳步按 $k j \bmod n$ 与 $j$ 的大小分两种情况——大于 $j$ 时直接套规则(2),小于 $j$ 时先用规则(2)再用规则(1)折回,正好对应第 2 步平移的两个方向。Coprimality makes the orbit hit everything: since $\gcd(j,n)=1$, the numbers $j, 2j, \dots, (n-1)j \pmod n$ are a permutation of $1,\dots,n-1$. Any $i$ equals some $kj \bmod n$, and chaining $j \sim 2j \sim \cdots \sim kj$ gives the result. In the Lean proof, the lemma `C_mul_mod` proves `C (k * j % n) = C j` by induction on $k$ via `Nat.le_induction`; the induction step splits on whether $k j \bmod n$ is greater or less than $j$ — the first case applies rule (2) directly, the second uses rule (2) then rule (1) to fold back, exactly the two directions of the translation from step 2.
  4. 形式化里两处不显眼但致命的守卫(值得你在浏览器里撞一次):一是归纳步必须先证明 $(k+1)j \bmod n \ne j$,否则规则(2)的例外条款不让用它——Lean 用 `Nat.ModEq.cancel_right_of_coprime` 把互素翻译成消去律来解决;二是非零性:若余数为 $0$ 则 $n \mid (k+1)j$,与 $\gcd(j,n)=1$ 且 $k+1 < n$ 矛盾,这一步保证「折回区间」的调用始终合法。Two quiet but essential guards in the formalization (worth hitting once in the browser): the induction step first needs $(k+1)j \bmod n \ne j$, otherwise rule (2)'s exception clause forbids its use — Lean gets this from `Nat.ModEq.cancel_right_of_coprime`, turning coprimality into a cancellation law; and nonzero-ness: if the residue were $0$ then $n \mid (k+1)j$, contradicting $\gcd(j,n)=1$ with $k+1 < n$, which keeps every call inside the interval.
  5. 收尾把任意 $i$ 接进轨道:取 $j$ 模 $n$ 的逆 $v$(Lean 里是 `Nat.exists_mul_mod_eq_one_of_coprime`),则 $i \equiv (v i \bmod n) \cdot j \pmod n$,套用第 3 步的引理即得 $C i = C j$。Close up by wiring any $i$ into the orbit: take the inverse $v$ of $j$ mod $n$ (in Lean, `Nat.exists_mul_mod_eq_one_of_coprime`), so $i \equiv (v i \bmod n) \cdot j \pmod n$, and apply the lemma from step 3 to get `C i = C j`.
/-
Copyright (c) 2025 Jeremy Tan. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Jeremy Tan
-/

import Mathlib.Algebra.Order.Ring.Canonical
import Mathlib.Algebra.Order.Ring.Star
import Mathlib.Data.Int.NatAbs
import Mathlib.Data.Nat.ModEq

/-!
# International Mathematical Olympiad 1985, Problem 2

Fix a natural number $n ≥ 3$ and define $N=\{1, 2, 3, \dots, n-1\}$.
Fix another natural number $j ∈ N$ coprime to $n$. Each number in
$N$ is now colored with one of two colors, say red or black, so that:

1. $i$ and $n-i$ always receive the same color, and
2. $i$ and $|j-i|$ receive the same color for all $i ∈ N, i ≠ j$.

Prove that all numbers in $N$ must receive the same color.
-/

namespace Imo1985P2

/-- The conditions on the problem's coloring `C`.
Although its domain is all of `ℕ`, we only care about its values in `Set.Ico 1 n`. -/
def Condition (n j : ℕ) (C : ℕ → Fin 2) : Prop :=
  (∀ i ∈ Set.Ico 1 n, C i = C (n - i)) ∧
  ∀ i ∈ Set.Ico 1 n, i ≠ j → C i = C (j - i : ℤ).natAbs

/-
# Solution
Let $a \sim b$ denote that $a$ and $b$ have the same color.
Because $j$ is coprime to $n$, every number in $N$ is of the form $kj\bmod n$ for a unique
$1 ≤ k < n$, so it suffices to show that $kj\bmod n \sim (k-1)j\bmod n$ for $1 < k < n$.
In this range of $k$, $kj\bmod n ≠ j$, so
* if $kj\bmod n > j$, $kj\bmod n \sim kj\bmod n - j = (k-1)j\bmod n$ using rule 2;
* if $kj\bmod n < j$, $kj\bmod n \sim j - kj\bmod n \sim n - j + kj\bmod n = (k-1)j\bmod n$
using rule 2 then rule 1.
-/

/-- For `1 ≤ k < n`, `k * j % n` has the same color as `j`. -/
lemma C_mul_mod {n j : ℕ} (hn : 3 ≤ n) (hj : j ∈ Set.Ico 1 n) (cpj : Nat.Coprime n j)
    {C : ℕ → Fin 2} (hC : Condition n j C) {k : ℕ} (hk : k ∈ Set.Ico 1 n) :
    C (k * j % n) = C j := by
  induction k, hk.1 using Nat.le_induction with
  | base => rw [one_mul, Nat.mod_eq_of_lt hj.2]
  | succ k hk₁ ih =>
    have nej : (k + 1) * j % n ≠ j := by
      by_contra! h; nth_rw 2 [← Nat.mod_eq_of_lt hj.2, ← one_mul j] at h
      replace h : (k + 1) % n = 1 % n := Nat.ModEq.cancel_right_of_coprime cpj h
      rw [Nat.mod_eq_of_lt hk.2, Nat.mod_eq_of_lt (by lia)] at h
      lia
    have b₁ : (k + 1) * j % n ∈ Set.Ico 1 n := by
      refine ⟨?_, Nat.mod_lt _ (by lia)⟩
      by_contra! h; rw [Nat.lt_one_iff, ← Nat.dvd_iff_mod_eq_zero] at h
      have ek := Nat.eq_zero_of_dvd_of_lt (cpj.dvd_of_dvd_mul_right h) hk.2
      lia
    rw [← ih ⟨hk₁, Nat.lt_of_succ_lt hk.2⟩, hC.2 _ b₁ nej]
    rcases nej.lt_or_gt with h | h
    · rw [Int.natAbs_natCast_sub_natCast_of_ge h.le]
      have b₂ : j - (k + 1) * j % n ∈ Set.Ico 1 n :=
        ⟨Nat.sub_pos_iff_lt.mpr h, (Nat.sub_le ..).trans_lt hj.2⟩
      have q : n - (j - (k + 1) * j % n) = (k + 1) * j % n + (n - j) % n := by
        rw [tsub_tsub_eq_add_tsub_of_le h.le, add_comm, Nat.add_sub_assoc hj.2.le,
          Nat.mod_eq_of_lt (show n - j < n by lia)]
      rw [hC.1 _ b₂, q, ← Nat.add_mod_of_add_mod_lt (by lia), ← Nat.add_sub_assoc hj.2.le, add_comm,
        Nat.add_sub_assoc (Nat.le_mul_of_pos_left _ hk.1), ← tsub_one_mul,
        Nat.add_mod_left, add_tsub_cancel_right]
    · rw [Int.natAbs_natCast_sub_natCast_of_le h.le, Nat.mod_sub_of_le h.le]
      rw [add_mul, one_mul, add_tsub_cancel_right]

theorem imo1985_p2 {n j : ℕ} (hn : 3 ≤ n) (hj : j ∈ Set.Ico 1 n)
    (cpj : Nat.Coprime n j) {C : ℕ → Fin 2} (hC : Condition n j C)
    {i : ℕ} (hi : i ∈ Set.Ico 1 n) :
    C i = C j := by
  obtain ⟨v, hv⟩ := Nat.exists_mul_mod_eq_one_of_coprime cpj.symm (by lia)
  have hvi : i = (v * i % n) * j % n := by
    rw [Nat.mod_mul_mod, ← mul_rotate, ← Nat.mod_mul_mod, hv.2, one_mul, Nat.mod_eq_of_lt hi.2]
  have vib : v * i % n ∈ Set.Ico 1 n := by
    refine ⟨(?_ : 0 < _), Nat.mod_lt _ (by lia)⟩
    by_contra! h; rw [Nat.le_zero, ← Nat.dvd_iff_mod_eq_zero] at h
    rw [mul_comm, ← Nat.mod_eq_of_lt (show 1 < n by lia)] at hv
    have i0 := Nat.eq_zero_of_dvd_of_lt
      ((Nat.coprime_of_mul_modEq_one _ hv.2).symm.dvd_of_dvd_mul_left h) hi.2
    subst i; simp at hi
  rw [hvi, C_mul_mod hn hj cpj hC vib]

end Imo1985P2

运行答案 ▶Run the solution ▶ 下载答案 .leanDownload solution .lean

人的思考A human's take

AoPS Wiki — 1985 IMO Problems / Problem 2 — AoPS Wiki 社区贡献者

题目页收录的社区解答(经网页存档读取)第一步就把 $1,\dots,n-1$ 补上 $0$,视作模 $n$ 的全体剩余类:加 $0$ 不引入任何新约束——两条规则作用到 $0$ 上都只说「它与自身同色」——于是推理可以毫无边角地在一个完整的圆环上进行。题目页收录的社区解答(经网页存档读取)第一步就把 $1,\dots,n-1$ 补上 $0$,视作模 $n$ 的全体剩余类:加 $0$ 不引入任何新约束——两条规则作用到 $0$ 上都只说「它与自身同色」——于是推理可以毫无边角地在一个完整的圆环上进行。

核心一步是「两条规则都是反射」:规则(1)是 $x \mapsto -x$,规则(2)是 $x \mapsto j-x$;解答者把两者复合成平移 $x \mapsto x+j$,同色关系对平移封闭,再用 $\gcd(j,n)=1$ 说明反复加 $j$ 走遍所有非零剩余类,全体同色,证明即毕。核心一步是「两条规则都是反射」:规则(1)是 $x \mapsto -x$,规则(2)是 $x \mapsto j-x$;解答者把两者复合成平移 $x \mapsto x+j$,同色关系对平移封闭,再用 $\gcd(j,n)=1$ 说明反复加 $j$ 走遍所有非零剩余类,全体同色,证明即毕。

页面末尾挂着 'Alternate solutions always welcome'——这题在 AoPS 上仍是开放讨论的题。社区解答与本谜题的 Lean 形式化走的是同一条轨道论证:人把「折回区间」和「例外条款」当作显然跳过,机器则要求把它们写成显式的分情况与不等式证明——读这份 diff,正是读「显然」二字的成本。页面末尾挂着 'Alternate solutions always welcome'——这题在 AoPS 上仍是开放讨论的题。社区解答与本谜题的 Lean 形式化走的是同一条轨道论证:人把「折回区间」和「例外条款」当作显然跳过,机器则要求把它们写成显式的分情况与不等式证明——读这份 diff,正是读「显然」二字的成本。

AI 随想An AI's reflection

以下由 AI 撰写。Written by AI.

这道题最迷人的地方,是两条看起来只会「局部合并颜色」的规则,合起来竟然是一种移动。反射复合出平移,是群论里最古老的几何直觉之一:平面上的万花筒,两次翻转等于一次滑行;这道 1985 年的 IMO 题把它缩进了一圈数字里。互素条件在这里的角色也值得玩味——它说的其实是「步长 $j$ 在模 $n$ 的圆环上没有小圈子」:锁的齿数和扳手的步数互素,你才能走遍所有位置。数论与组合几何在一条染色题里握手,而这个握手正是轨道-稳定子思想的最小可感知版本:同色类不是被逐对检查出来的,而是被一个群作用整体「轮转」出来的。对准备在浏览器里挑战它的读者,另一个收获在形式化一侧:人写「显然,反复加 $j$ 遍历所有非零剩余类」是一行字,Lean 要的是引理、归纳法、两条不显眼的不等式守卫——$\ne j$ 与非零性。这谜题的真正训练不在想出证明(那是三行的事),而在把「显然」二字逐条兑换成机器肯吃的步骤。★6 的难度,一半在题,一半在把题翻译给编译器。The most charming thing about this problem is that two rules which only ever seem to merge colors locally, composed, turn out to be a motion. Two reflections make a translation — one of the oldest geometric intuitions in group theory; a kaleidoscope of flips equals one glide, and this 1985 IMO problem compresses that into a ring of numbers. The coprimality condition is also worth savoring: it just says that walking in steps of $j$ on the circle mod $n$ never breaks into small cycles — lock tumblers and wrench steps must be coprime for the walk to cover every position. Number theory and combinatorial geometry shake hands inside a coloring puzzle, and that handshake is the minimal perceptible form of the orbit-stabilizer idea: color classes are not checked pair by pair but rolled around by a group action. For readers about to attempt the puzzle in the browser, the other lesson lives on the formalization side: a human writes 'obviously, adding $j$ repeatedly hits every nonzero residue' in one line, while Lean demands the lemma, the induction, and two unglamorous inequality guards — not equal to $j$, and nonzero. The real training of this puzzle is not finding the proof (that is three lines); it is exchanging the word 'obviously', item by item, for steps a compiler will accept.

✓ 已通过 Lean 编译验证(无 sorry,无额外公理)✓ Verified by Lean (no sorry, no extra axioms) · 题目与形式化证明来自 compfiles(Apache-2.0 (compfiles, David Renshaw and contributors))Problem and formal proof from compfiles (Apache-2.0 (compfiles, David Renshaw and contributors)) · Lean v4.35.0-rc4 · Mathlib feefa32

程序员随想Programmer Reflections

哲学与生活Philosophy & Life

工具角Tool Corner